group_id
stringlengths 12
18
| problem_description
stringlengths 85
3.02k
| candidates
listlengths 3
20
|
|---|---|---|
aoj_0732_cpp
|
いちご 2 (Strawberry 2)
問題文
果物好きのビ太郎は，いちごのつかみ取りに挑戦することにした．ビ太郎の目の前には
1
脚の机がある．机は長方形の形をしており，縦
H
行，横
W
列のマス目状に区切られている．机には
N
個のいちごが置かれており，
i
番目 (
1 ≦ i ≦ N
) のいちごは上から
A
i
行目，左から
B
i
列目のマスにある．複数のいちごが同じマスに置かれている可能性もある．
ビ太郎は机から，縦
3
行，横
3
列の正方形の領域をなす
9
個のマスを選び，それらのマスにあるいちごをすべて取る．この動作は
1
回だけ行う．
ビ太郎は，なるべく多くのいちごを取りたい．
机の大きさといちごの位置についての情報が与えられたとき，取れるいちごの個数の最大値を求めるプログラムを作成せよ．
制約
3 ≦ H ≦ 1 000 000 000
．
3 ≦ W ≦ 1 000 000 000
．
1 ≦ N ≦ 60 000
．
1 ≦ A
i
≦ H
(
1 ≦ i ≦ N
)．
1 ≦ B
i
≦ W
(
1 ≦ i ≦ N
)．
入力される値はすべて整数である．
入力
入力は以下の形式で標準入力から与えられる．
H
W
N
A
1
B
1
A
2
B
2
:
A
N
B
N
出力
標準出力に，取れるいちごの個数の最大値を
1
行で出力せよ．
入出力例
入力例 1
4 5
7
1 1
1 5
2 2
2 4
3 3
4 2
4 4
出力例 1
5
いちごの配置は図のようになっている (赤い丸がいちごを表す)．
太枠で囲った領域をなすマスを選ぶことで，
5
個のいちごが取れる．
5
個よりも多くのいちごを取ることはできないので，
5
を出力する．
入力例 2
3 5
6
1 1
1 2
2 1
2 4
2 4
3 4
出力例 2
4
複数のいちごが同じマスに置かれていることもある．
入力例 3
3 99999
9
1 77813
2 77813
3 77813
1 77814
2 77814
3 77814
1 77815
2 77815
3 77815
出力例 3
9
入力例 4
11 11
20
7 7
6 11
5 7
8 8
9 9
5 5
8 4
4 4
4 8
2 6
1 6
6 2
3 3
9 3
7 5
6 1
10 6
6 10
11 6
3 9
出力例 4
4
情報オリンピック日本委員会
作 『日本情報オリンピック第2回女性部門 本選 競技課題』
|
[
{
"submission_id": "aoj_0732_10881893",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n#include <algorithm>\nusing namespace std;\n\nint main() {\n int H, W, N;\n cin >> H >> W >> N;\n\n vector<pair<int, int>> strawberries(N);\n for (int i = 0; i < N; ++i) {\n int r, c;\n cin >> r >> c;\n strawberries[i] = {r, c};\n }\n\n map<pair<int, int>, int> count;\n\n for (auto [r, c] : strawberries) {\n // 3×3 の範囲の中心座標を列挙（いちごを含む可能性のある範囲）\n for (int dr = -2; dr <= 0; ++dr) {\n for (int dc = -2; dc <= 0; ++dc) {\n int center_r = r + dr + 1;\n int center_c = c + dc + 1;\n\n // 範囲が盤面内かチェック\n if (center_r - 1 >= 1 && center_r + 1 <= H &&\n center_c - 1 >= 1 && center_c + 1 <= W) {\n count[{center_r, center_c}]++;\n }\n }\n }\n }\n\n int max_strawberries = 0;\n for (auto [_, cnt] : count) {\n max_strawberries = max(max_strawberries, cnt);\n }\n\n cout << max_strawberries << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 37276,
"score_of_the_acc": -0.4852,
"final_rank": 6
},
{
"submission_id": "aoj_0732_10552068",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nstruct Point {\n int row;\n int col;\n int num;\n};\n\nbool comp(const Point& a, const Point& b) {\n if (a.row == b.row)\n return a.col < b.col;\n else\n return a.row < b.row;\n}\n\nint main()\n{\n int H, W, N;\n std::cin >> H >> W >> N;\n std::vector<Point> point(N * 9);\n std::vector<Point> point2(N * 9);\n\n int A, B;\n int j = 0;\n for (int i = 0; i < N; i++) {\n std::cin >> A >> B;\n if (A + 2 <= H) {\n if (B + 2 <= W) {\n point[j].row = A;\n point[j].col = B;\n point[j].num = 1;\n j++;\n }\n if (2 <= B && B + 1 <= W) {\n point[j].row = A;\n point[j].col = B - 1;\n point[j].num = 1;\n j++;\n }\n if (3 <= B && B <= W) {\n point[j].row = A;\n point[j].col = B - 2;\n point[j].num = 1;\n j++;\n }\n }\n if (2 <= A && A + 1 <= H) {\n if (B + 2 <= W) {\n point[j].row = A - 1;\n point[j].col = B;\n point[j].num = 1;\n j++;\n }\n if (2 <= B && B + 1 <= W) {\n point[j].row = A - 1;\n point[j].col = B - 1;\n point[j].num = 1;\n j++;\n }\n if (3 <= B && B <= W) {\n point[j].row = A - 1;\n point[j].col = B - 2;\n point[j].num = 1;\n j++;\n }\n }\n if (3 <= A && A <= H) {\n if (B + 2 <= W) {\n point[j].row = A - 2;\n point[j].col = B;\n point[j].num = 1;\n j++;\n }\n if (2 <= B && B + 1 <= W) {\n point[j].row = A - 2;\n point[j].col = B - 1;\n point[j].num = 1;\n j++;\n }\n if (3 <= B && B <= W) {\n point[j].row = A - 2;\n point[j].col = B - 2;\n point[j].num = 1;\n j++;\n }\n }\n }\n \n std::sort(point.begin(), point.end(), comp);\n\n j = 0;\n point2[0].row = point[0].row;\n point2[0].col = point[0].col;\n point2[0].num = point[0].num;\n for (int i = 1; i < point.size(); i++) {\n if (point[i].row == point[i - 1].row &&\n point[i].col == point[i - 1].col)\n point2[j].num += point[i].num;\n else {\n j++;\n point2[j].row = point[i].row;\n point2[j].col = point[i].col;\n point2[j].num = point[i].num;\n }\n }\n\n int max = -1000000000;\n for (int i = 0; i < point2.size(); i++)\n if (max < point2[i].num)\n max = point2[i].num;\n \n std::cout << max << std::endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 15776,
"score_of_the_acc": -0.1886,
"final_rank": 3
},
{
"submission_id": "aoj_0732_10333437",
"code_snippet": "#include <iostream>\n#include <set>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <unordered_map>\n#include <algorithm>\n#include <numeric>\n#include <cstdlib>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\ntemplate <typename Map>\nauto max_value_element(const Map& umap) {\n return std::max_element(\n umap.begin(), umap.end(),\n [](const auto& a, const auto& b) { return a.second < b.second; }\n );\n}\n\nstruct pair_hash {\n template <typename T1, typename T2>\n size_t operator ()(const pair<T1, T2>& p) const {\n auto h1 = hash<T1>{}(p.first);\n auto h2 = hash<T2>{}(p.second);\n return h1 ^ (h2 << 1);\n }\n};\nconst int dx[3]={-1,0,1};\nconst int dy[3]={-1,0,1};\n\nint main(){\n int h,w,n;\n cin >> h >> w >> n;\n unordered_map<pair<int,int>,int,pair_hash> ami;\n rep(k,n){\n int a,b;\n cin >> a >> b;\n for(int i=0;i<3;i++){\n for(int j=0;j<3;j++){\n ami[{a+dx[i],b+dy[j]}]++;\n }\n }\n }\n cout << max_value_element(ami)->second << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 790,
"memory_kb": 35332,
"score_of_the_acc": -1.3225,
"final_rank": 13
},
{
"submission_id": "aoj_0732_8981317",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n{\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\tunsigned int H, W;\n\tunsigned short N, i, j, _i, _j, max = 0, temp;\n\tcin >> H >> W >> N;\n\tvector<pair<unsigned int, unsigned int>> berry(N);\n\tfor (i = 0; i != N; ++i) cin >> berry[i].first >> berry[i].second;\n\tstable_sort(berry.begin(), berry.end());\n\n\tfor (i = 0; i != N; ++i)\n\t{\n\t\tfor (_i = 0; _i != 3 && berry[i].first >= _i; ++_i)\n\t\t\tfor (_j = 0; _j != 3 && berry[i].second >= _j; ++_j)\n\t\t\t{\n\t\t\t\ttemp = 0;\n\t\t\t\tfor (j = 0; j != 3; ++j)\n\t\t\t\t\ttemp += lower_bound(berry.begin(), berry.end(), make_pair(berry[i].first - _i + j, berry[i].second - _j + 3)) - lower_bound(berry.begin(), berry.end(), make_pair(berry[i].first - _i + j, berry[i].second - _j));\n\t\t\t\tif (temp > max) max = temp;\n\t\t\t}\n\t}\n\n\tcout << max << '\\n';\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 4156,
"score_of_the_acc": -0.1095,
"final_rank": 1
},
{
"submission_id": "aoj_0732_8894545",
"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\t\n\tauto H=in(),W=in(),N=in();\n\tvll S(N);\n\tREP(i,N){\n\t\tauto Y=in(),X=in();\n\t\tS[i]=X+Y*W;\n\t}\n\tsort(ALL(S));\n\tll C=0;\n\tREP(i,N){\n\t\tll offset[9]={-W-1ll,-W,-W+1ll,-1ll,0ll,1ll,W-1ll,W,W+1ll};\n\t\tREP(j,9){\n\t\t\tll A=0;\n\t\t\tREP(k,9){\n\t\t\t\tauto res = equal_range(ALL(S),S[i]+offset[j]+offset[k]);\n\t\t\t\tA += distance(res.first,res.second);\n\t\t\t}\n\t\t\tchmax(C,A);\n\t\t}\n\t}\n\tout(C);\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 3612,
"score_of_the_acc": -0.1429,
"final_rank": 2
},
{
"submission_id": "aoj_0732_8886697",
"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> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\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 if (x < 0) { cout << (i64)(x); }\n else { cout << (u64)(x); }\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer(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 H, W, N, A, B;\n cin >> H >> W >> N;\n map<pi, ll> ichigo;\n rep(N) {\n cin >> A >> B;\n ichigo[mp(A, B)]++;\n }\n set<pi> centered;\n ll ans = 0;\n for (auto [p, c]: ichigo) {\n ll y = p.fi;\n ll x = p.se;\n static const vi dy{-1,-1,-1, 0, 0, 0, 1, 1, 1};\n static const vi dx{-1, 0, 1,-1, 0, 1,-1, 0, 1};\n auto calc_count = [&](ll y, ll x) {\n ll ret = 0;\n rep(i, len(dy)) {\n ll ny = y + dy[i];\n ll nx = x + dx[i];\n auto np = mp(ny, nx);\n if (ichigo.find(np) != ichigo.end()) {\n ret += ichigo[np];\n }\n }\n return ret;\n };\n rep(i, len(dy)) {\n ll ny = y + dy[i];\n ll nx = x + dx[i];\n auto np = mp(ny, nx);\n if (centered.find(np) == centered.end()) {\n chmax(ans, calc_count(ny, nx));\n }\n }\n }\n print(ans);\n return 0;\n}",
"accuracy": 1,
"time_ms": 630,
"memory_kb": 7208,
"score_of_the_acc": -0.8288,
"final_rank": 12
},
{
"submission_id": "aoj_0732_8879779",
"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 H=in(),W=in(),N=in();\n\tvll S(N);\n\tREP(i,N){\n\t\tauto X=in(),Y=in();\n\t\tS[i]=X+Y*W;\n\t}\n\tsort(ALL(S));\n\tll C=0;\n\tREP(i,N){\n\t\tll offset[9]={-W-1ll,-W,-W+1ll,-1ll,0ll,1ll,W-1ll,W,W+1ll};\n\t\tREP(j,9){\n\t\t\tll A=0;\n\t\t\tREP(k,9){\n\t\t\t\tauto res = equal_range(ALL(S),S[i]+offset[j]+offset[k]);\n\t\t\t\tA += distance(res.first,res.second);\n\t\t\t}\n\t\t\tchmax(C,A);\n\t\t}\n\t}\n\tout(C);\n\treturn 0;\n}",
"accuracy": 0.32,
"time_ms": 130,
"memory_kb": 3608,
"score_of_the_acc": -0.1429,
"final_rank": 18
},
{
"submission_id": "aoj_0732_8384615",
"code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0732.cc: いちご 2 (Strawberry 2)\n */\n\n#include<cstdio>\n#include<map>\n#include<algorithm>\n#include<utility>\n \nusing namespace std;\n\n/* constant */\n\n/* typedef */\n\ntypedef pair<int,int> pii;\ntypedef map<pii,int> mpii;\n\n/* global variables */\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int h, w, n;\n scanf(\"%d%d%d\", &h, &w, &n);\n\n mpii pcs;\n\n for (int i = 0; i < n; i++) {\n int a, b;\n scanf(\"%d%d\", &a, &b);\n\n for (int da = 0; da < 3; da++)\n for (int db = 0; db < 3; db++) {\n\tint a0 = a - da, a1 = a0 + 2;\n\tint b0 = b - db, b1 = b0 + 2;\n\tif (1 <= a0 && a1 <= h && 1 <= b0 && b1 <= w)\n\t pcs[pii(a0, b0)]++;\n }\n }\n\n int maxc = 0;\n for (auto &pc: pcs)\n maxc = max(maxc, pc.second);\n\n printf(\"%d\\n\", maxc);\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 36760,
"score_of_the_acc": -0.4539,
"final_rank": 5
},
{
"submission_id": "aoj_0732_7995533",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n \n ll H,W;\n cin>>H>>W;\n ll N;\n cin>>N;\n unordered_map<ll,ll> M;\n vll dy={-1,0,1};\n vll dx=dy;\n ll WW=2e9;\n rep(i,N){\n ll A,B;\n cin>>A>>B;\n rep(yy,3)rep(xx,3){\n M[(A+dy[yy])*WW+B+dx[xx]]++;\n }\n }\n ll an=0;\n for(auto p:M)chmax(an,p.second);\n cout<<an<<endl;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 27576,
"score_of_the_acc": -0.3086,
"final_rank": 4
},
{
"submission_id": "aoj_0732_7977746",
"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<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 H,W; cin >> H >> W;\n int n; cin >> n;\n vector<int> a(n),b(n);\n int res = 0;\n map<pair<int,int>,int> mp;\n for(int i=0;i<n;i++){\n cin >> a[i] >> b[i];\n for(int j=-1;j<=1;j++){\n for(int k=-1;k<=1;k++){\n mp[{a[i]+j,b[i]+k}]++;\n }\n }\n }\n for(auto p:mp){\n res = max(res, p.second);\n }\n cout << res << endl;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 37420,
"score_of_the_acc": -0.4996,
"final_rank": 7
},
{
"submission_id": "aoj_0732_7917463",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<map>\nusing namespace std;\n\nint main(){\n int h,w,n;\n cin >> h >> w >> n;\n //vector<vector<int>> straw(h+1,vector<int>(w+1,0));\n map<pair<int, int>, int> straw;\n vector<int> a(n),b(n);\n\n for(int i = 0; i < n; i++){\n cin >> a[i] >> b[i];\n }\n for(int i = 0; i < n; i++){\n straw[pair(a[i]-1, b[i]-1)] += 1;\n //cout << a[i]-1 << b[i]-1 << endl;\n }\n int max = -1, t = 0;\n\n //存在と周囲8マスを中心として判定を行う\n for(int i = 0; i < n; i++){ //いちごのあるマスを参照する\n for(int j = -1; j <= 1; j++){ //いちごの縦+-1の範囲を中心に\n for(int k = -1; k <= 1; k++){ //いちごの横+-1の範囲を中心に\n\n for(int l = -1; l <= 1; l++){ //\n for(int m = -1; m <= 1; m++){ //上と共に、中心と周囲8マスを探索\n if(a[i]+j+l-1 < 0 or b[i]+k+m-1 < 0){break;}\n else if(h < a[i]+j+l-1 or w < b[i]+k+m-1){break;}\n else if(straw[pair(a[i]+j+l-1, b[i]+k+m-1)] > 0){\n t += straw[pair(a[i]+j+l-1, b[i]+k+m-1)];\n }\n }\n }\n if(max < t){max = t;}\n t = 0;\n }\n }\n }\n cout << max << endl;\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 97236,
"score_of_the_acc": -1.6402,
"final_rank": 14
},
{
"submission_id": "aoj_0732_7917050",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\n\nint main(){\n int h,w,n;\n cin >> h >> w >> n;\n vector<vector<int>> straw(h+1,vector<int>(w+1,0));\n vector<int> a(n),b(n);\n\n for(int i = 0; i < n; i++){\n cin >> a[i] >> b[i];\n }\n for(int i = 0; i < n; i++){\n straw[a[i]-1][b[i]-1] += 1;\n //cout << a[i]-1 << b[i]-1 << endl;\n }\n int max = -1, t = 0;\n //存在の周囲8マスのみから判定を行う\n for(int i = 0; i < n; i++){ //いちごのあるマスを参照する\n for(int j = -1; j <= 1; j++){ //いちごの縦+-1の範囲を中心に\n for(int k = -1; k <= 1; k++){ //いちごの横+-1の範囲を中心に\n\n for(int l = -1; l <= 1; l++){ //\n for(int m = -1; m <= 1; m++){ //上と共に、中心の周囲8マスを探索\n if(a[i]+j+l-1 < 0 or b[i]+k+m-1 < 0){break;}\n else if(h < a[i]+j+l-1 or w < b[i]+k+m-1){break;}\n else if(straw[a[i]+j+l-1][b[i]+k+m-1] > 0){\n t += straw[a[i]+j+l-1][b[i]+k+m-1];\n }\n }\n }\n if(max < t){max = t;}\n t = 0;\n }\n }\n }\n cout << max << endl;\n}",
"accuracy": 0.375,
"time_ms": 20,
"memory_kb": 7576,
"score_of_the_acc": -0.0403,
"final_rank": 17
},
{
"submission_id": "aoj_0732_7916861",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\n\nint main(){\n int h,w,n;\n cin >> h >> w >> n;\n vector<vector<int>> straw(h+1,vector<int>(w+1,0));\n vector<int> a(n),b(n);\n\n for(int i = 0; i < n; i++){\n cin >> a[i] >> b[i];\n }\n for(int i = 0; i < n; i++){\n straw[a[i]-1][b[i]-1] += 1;\n //cout << a[i]-1 << b[i]-1 << endl;\n }\n int max = -1, t = 0;\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n for(int k = 0; k < 3; k++){\n for(int l = 0; l < 3; l++){\n if(h < i+k or w < j+l){break;}\n else if(i+k < 0 or j+l < 0){break;}\n else if(straw[i+k][j+l] > 0){t += straw[i+k][j+l];}\n }\n }\n\n //for(int k = 0; k < 3; k++){\n // for(int l = 0; l < 3; l++){\n // if(h < a[i]+k-1 or w < b[i]+l-1){break;}\n // else if(a[i]+k-1 < 0 or b[i]+l-1 < 0){break;}\n // else if(straw[a[i]+k-1][b[i]+l-1] > 0){t += straw[a[i]+k-1][b[i]+l-1];}\n // }\n // }\n if(max < t){max = t;}\n t = 0;\n }\n }\n cout << max << endl;\n}",
"accuracy": 0.375,
"time_ms": 20,
"memory_kb": 7572,
"score_of_the_acc": -0.0403,
"final_rank": 16
},
{
"submission_id": "aoj_0732_7912008",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 60005\n\nint H,W;\nmap<pair<int,int>,int> MAP;\nint R[SIZE],C[SIZE];\n\nbool rangeCheck(int row,int col){\n\n\treturn row >= 1 && row <= H && col >= 1 && col <= W;\n}\n\nint main(){\n\n\tscanf(\"%d %d\",&H,&W);\n\n\tint N;\n\tscanf(\"%d\",&N);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%d %d\",&R[i],&C[i]);\n\t\tMAP[make_pair(R[i],C[i])]++;\n\t}\n\n\tint maxi = 0;\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int diff_row = -1; diff_row <= 1; diff_row++){\n\t\t\tfor(int diff_col = -1; diff_col <= 1; diff_col++){\n\n\t\t\t\tint base_row = R[i]+diff_row,base_col = C[i]+diff_col;\n\t\t\t\tif(!rangeCheck(base_row,base_col)){\n\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tint tmp = 0;\n\t\t\t\tfor(int d_row = -1; d_row <= 1; d_row++){\n\t\t\t\t\tfor(int d_col = -1; d_col <= 1; d_col++){\n\t\t\t\t\t\tint tmp_row = base_row+d_row;\n\t\t\t\t\t\tint tmp_col = base_col+d_col;\n\n\t\t\t\t\t\tif(!rangeCheck(tmp_row,tmp_col)){\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tauto at = MAP.find(make_pair(tmp_row,tmp_col));\n\t\t\t\t\t\tif(at == MAP.end()){\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\ttmp += MAP[make_pair(tmp_row,tmp_col)];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tchmax(maxi,tmp);\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",maxi);\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 480,
"memory_kb": 7784,
"score_of_the_acc": -0.6399,
"final_rank": 11
},
{
"submission_id": "aoj_0732_7875948",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = std::int64_t;\n#define REP(i, m, n) for (int i = (m); i < int(n); ++i)\n#define rep(i, n) REP(i, 0, n)\ntemplate <class T, class U>\nbool chmax(T &a, const U b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nbool chmin(T &a, const U b) {\n return (T)b < a ? a = (T)b, true : false;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr int MOD = 1000000007;\n\nint main(void) {\n ll h, w;\n cin >> h >> w;\n int n;\n cin >> n;\n map<pair<ll, ll>, int> mp;\n while (n--) {\n ll x, y;\n cin >> x >> y;\n rep (dx, 3) {\n rep (dy, 3) mp[{x + dx, y + dy}]++;\n }\n }\n\n int ans = 0;\n for (auto [p, s] : mp) {\n chmax(ans, s);\n }\n cout << ans << endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 37188,
"score_of_the_acc": -0.5102,
"final_rank": 8
},
{
"submission_id": "aoj_0732_7866887",
"code_snippet": "#include <bits/extc++.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) begin(x),end(x)\n#define Fixed fixed << setprecision(12)\n#define updiv(a, b) (((a) + (b) - 1) / (b))\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\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 T, class U> istream& operator>>(istream& is, pair<T, U>& p){ is >> p.first >> p.second; return (is); }\ntemplate<class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p){ os << p.first << ' ' << p.second; return (os); }\ntemplate<class T> istream& operator>>(istream& is, vector<T>& v){ for (auto &&e : v) is >> e; return (is); }\ntemplate<class T> ostream& operator<<(ostream& os, vector<T>& v){ for (auto &&e : v) os << e << ' '; return (os); }\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 max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T, vector<T>, greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A, B>;\ntemplate <class T> using uset = unordered_set<T>;\n\ntemplate <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;\ntemplate <class T> using Rope = __gnu_cxx::rope<T>;\nusing Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n\ntemplate <class T> void bye(T x){ cout << x << '\\n'; exit(0); }\ninline int square(int a){ return (a * a); }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1,0};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1,0};\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 h, w, n;\n cin >> h >> w >> n;\n\n assert(3 <= h && h <= 1000000000);\n assert(3 <= w && w <= 1000000000);\n assert(1 <= n && n <= 60000);\n\n map<pair<int, int>, int> mp;\n\n for (int i = 0; i < n; ++i) {\n int a, b;\n cin >> a >> b;\n assert(1 <= a && a <= h);\n assert(1 <= b && b <= w);\n mp[make_pair(a, b)]++;\n }\n\n int res = 0;\n\n for (auto [k, v] : mp) {\n auto [a, b] = k;\n for (int i = 0; i < 9; ++i) {\n int ca = a + dx[i];\n int cb = b + dy[i];\n int cnt = 0;\n for (int j = 0; j < 9; ++j) {\n int na = ca + dx[j];\n int nb = cb + dy[j];\n if (auto itr = mp.find(make_pair(na, nb)); itr != mp.end()) {\n cnt += itr->second;\n }\n }\n chmax(res, cnt);\n }\n }\n\n cout << res << '\\n';\n\n return (0);\n}",
"accuracy": 1,
"time_ms": 420,
"memory_kb": 7144,
"score_of_the_acc": -0.5554,
"final_rank": 10
},
{
"submission_id": "aoj_0732_7866885",
"code_snippet": "#include <bits/extc++.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) begin(x),end(x)\n#define Fixed fixed << setprecision(12)\n#define updiv(a, b) (((a) + (b) - 1) / (b))\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\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 T, class U> istream& operator>>(istream& is, pair<T, U>& p){ is >> p.first >> p.second; return (is); }\ntemplate<class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p){ os << p.first << ' ' << p.second; return (os); }\ntemplate<class T> istream& operator>>(istream& is, vector<T>& v){ for (auto &&e : v) is >> e; return (is); }\ntemplate<class T> ostream& operator<<(ostream& os, vector<T>& v){ for (auto &&e : v) os << e << ' '; return (os); }\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 max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T, vector<T>, greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A, B>;\ntemplate <class T> using uset = unordered_set<T>;\n\ntemplate <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;\ntemplate <class T> using Rope = __gnu_cxx::rope<T>;\nusing Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n\ntemplate <class T> void bye(T x){ cout << x << '\\n'; exit(0); }\ninline int square(int a){ return (a * a); }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1,0};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1,0};\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 h, w, n;\n cin >> h >> w >> n;\n\n assert(3 <= h && h <= 1000000000);\n assert(3 <= w && w <= 1000000000);\n assert(1 <= n && n <= 60000);\n\n map<pair<int, int>, int> mp;\n\n for (int i = 0; i < n; ++i) {\n int a, b;\n cin >> a >> b;\n mp[make_pair(a, b)]++;\n }\n\n int res = 0;\n\n for (auto [k, v] : mp) {\n auto [a, b] = k;\n for (int i = 0; i < 9; ++i) {\n int ca = a + dx[i];\n int cb = b + dy[i];\n int cnt = 0;\n for (int j = 0; j < 9; ++j) {\n int na = ca + dx[j];\n int nb = cb + dy[j];\n if (auto itr = mp.find(make_pair(na, nb)); itr != mp.end()) {\n cnt += itr->second;\n }\n }\n chmax(res, cnt);\n }\n }\n\n cout << res << '\\n';\n\n return (0);\n}",
"accuracy": 1,
"time_ms": 410,
"memory_kb": 7252,
"score_of_the_acc": -0.5435,
"final_rank": 9
},
{
"submission_id": "aoj_0732_7848635",
"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(h,w);\n map<int,map<int,int>> mp;\n INT(n);\n vector<array<int,2>> a(n);\n rep(i,n){\n in(a[i][0],a[i][1]);\n mp[a[i][0]][a[i][1]]++;\n }\n auto f=[&](int x,int y){\n int res=0;\n for(int dx=-1;dx<=1;dx++){\n for(int dy=-1;dy<=1;dy++){\n res+=mp[x+dx][y+dy];\n }\n }\n return res;\n };\n int ans=0;\n rep(i,n){\n for(int dx=-1;dx<=1;dx++){\n for(int dy=-1;dy<=1;dy++){\n chmax(ans,f(a[i][0]+dx,a[i][1]+dy));\n }\n }\n }\n out(ans);\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 101964,
"score_of_the_acc": -1.6883,
"final_rank": 15
}
] |
aoj_0751_cpp
|
日本沈没 2 (Japan Sinks 2)
問題文
日本列島は東西に細長い列島である．日本列島は南北方向の境界線により
N
個の区画に分けられている．区画には西から順に
1
から
N
までの番号が付けられている．現在，区画
i
(
1 ≦ i ≦ N
) の標高は
A
i
m
である．
日本列島ではたびたび嵐が起きている．嵐が起きると波による浸食で各区画の標高が以下のように減少する．
強さ
x
の
西風の
嵐では，西から数えて
x
個以内の区画のうち，「それより西に自身より標高の高い区画が存在しない」ようなすべての区画の標高が
1 m
減少する．すなわち，嵐の前の区画
i
の標高を
a
i
で表すと，
i ≦ x
かつ，
1 ≦ k ＜ i
となるすべての
k
に対して
a
k
≦ a
i
となる場合に区画
i
の標高は
1 m
減り，それ以外の場合には変わらない．
強さ
x
の
東風の
嵐では，東から数えて
x
個以内の区画のうち，「それより東に自身より標高の高い区画が存在しない」ようなすべての区画の標高が
1 m
減少する．すなわち，嵐の前の区画
i
の標高を
a
i
で表すと，
i ≧ N - x + 1
かつ，
i ＜ k ≦ N
となるすべての
k
に対して
a
k
≦ a
i
となる場合に区画
i
の標高は
1 m
減り，それ以外の場合には変わらない．
あなたは，今後
Q
日間の出来事をシミュレーションしなければならない．
j
日目 (
1 ≦ j ≦ Q
) には次のような出来事が起きる．
T
j
= 1
のとき，強さ
X
j
の西風の嵐が起きる．
T
j
= 2
のとき，強さ
X
j
の東風の嵐が起きる．
T
j
= 3
のとき，その時点での区画
X
j
の標高を報告する．
なお，制約より，どの区画の標高も負にならないことが保証される．
現在の各区画の標高および今後
Q
日間の出来事が与えられるので，
T
j
= 3
である日に対して，指定された区画の標高を求めるプログラムを作成せよ．
制約
1 ≦ N ≦ 300000
．
1 ≦ Q ≦ 300000
．
Q ≦ A
i
≦ 10
9
(
1 ≦ i ≦ N
)．
1 ≦ T
j
≦ 3
(
1 ≦ j ≦ Q
)．
1 ≦ X
j
≦ N
(
1 ≦ j ≦ Q
)．
入力される値はすべて整数である．
入力
入力は以下の形式で与えられる．
N
Q
A
1
A
2
…
A
N
T
1
X
1
T
2
X
2
:
T
Q
X
Q
出力
T
j
= 3
である
j
(
1 ≦ j ≦ Q
) それぞれに対して，
j
日目時点での区画
X
j
の標高 (
m
) を表す整数を，
1
行ずつ順に出力せよ．
入出力例
入力例 1
5 7
7 7 7 7 7
1 3
1 1
3 1
2 1
2 5
3 2
3 4
出力例 1
5
6
6
区画
1, 2, 3, 4, 5
の標高
(m)
出来事
開始時
7, 7, 7, 7, 7
1
日目
強さ
3
の西風の嵐が起きる．
西から
3
個以内の区画で，「それより西に自分より標高の高い区画が存在しない」ものは区画
1, 2, 3
である．
6, 6, 6, 7, 7
2
日目
強さ
1
の西風の嵐が起きる．
西から
1
個以内の区画で，「それより西に自分より標高の高い区画が存在しない」ものは区画
1
のみである．
5, 6, 6, 7, 7
3
日目
区画
1
の標高は現在
5 m
なので，
5
を出力する．
5, 6, 6, 7, 7
4
日目
強さ
1
の東風の嵐が起きる．
東から
1
個以内の区画で，「それより東に自分より標高の高い区画が存在しない」ものは区画
5
のみである．
5, 6, 6, 7, 6
5
日目
強さ
5
の東風の嵐が起きる．
東から
5
個以内の区画で，「それより東に自分より標高の高い区画が存在しない」ものは区画
4, 5
のみである．
5, 6, 6, 6, 5
6
日目
区画
2
の標高は現在
6 m
なので，
6
を出力する．
5, 6, 6, 6, 5
7
日目
区画
4
の標高は現在
6 m
なので，
6
を出力する．
入力例 2
5 7
10 13 14 7 12
1 5
2 5
3 3
3 4
2 5
3 1
3 2
出力例 2
12
7
9
11
入力例 3
5 6
8 6 7 8 9
1 1
3 1
3 5
1 3
3 2
3 3
出力例 3
7
9
6
6
入力例 4
5 6
6 8 6 9 7
2 1
2 4
3 5
1 5
3 4
3 3
出力例 4
5
7
6
情報オリンピック日本委員会
作 『第 22 回日本情報オリンピック JOI 2022/2023 二次予選競技課題』
|
[
{
"submission_id": "aoj_0751_10575051",
"code_snippet": "/* import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\tint q = sc.nextInt();\n\n\t\tint[] A = new int[n + 1];\n\n\t\tfor (int i = 1; i < n + 1; i++) {\n\t\t\tA[i] = sc.nextInt();\n\t\t}\n\n\t\tfor (int i = 0; i < q; i++) {\n\t\t\tint t = sc.nextInt();\n\t\t\tint x = sc.nextInt();\n\n\t\t\tswitch (t) {\n\t\t\t\tcase 1:\n\t\t\t\t\tint max = 0;\n\t\t\t\t\tfor (int j = 1; j <= x; j++) {\n\t\t\t\t\t\tif (A[j] >= max) {\n\t\t\t\t\t\t\tA[j]--;\n\t\t\t\t\t\t\tif (A[j] + 1 > max) {\n\t\t\t\t\t\t\t\tmax = A[j] + 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\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\tmax = 0;\n\t\t\t\t\tfor (int j = n; j > n - x; j--) {\n\t\t\t\t\t\tif (A[j] >= max) {\n\t\t\t\t\t\t\tA[j]--;\n\t\t\t\t\t\t\tif (A[j] + 1 > max) {\n\t\t\t\t\t\t\t\tmax = A[j] + 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\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tSystem.out.println(A[x]);\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t}\n} */\n\n#include <stdio.h>\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint in() { // 非負整数の入力\n int n = 0; int c = gc();\n do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');\n return n;\n}\n\nvoid out(int n) { // 非負整数の表示（出力）\n char b[30];\n if (!n) pc('0');\n else {\n int i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n while (i--) pc(b[i]);\n }\n pc('\\n');\n}\n\n#define NMAX (1 << 19)\n\nstatic inline int Min(int a, int b) { return a < b ? a : b; }\nstatic inline int Max(int a, int b) { return a > b ? a : b; }\n\nint sta[2*NMAX], stu[2*NMAX], stv[2*NMAX];\nint aa[NMAX];\nint N;\n\nvoid build(int aa[], int n) {\n int i, a;\n\n N = 1;\n while (N <= n) N <<= 1;\n for (i = 0; i < n; i++) sta[N + i] = aa[i];\n a = 0;\n for (i = 0; i < n; i++)\n if (a < aa[i]) stu[N + i] = aa[i] - a, a = aa[i];\n a = 0;\n for (i = n - 1; i >= 0; i--)\n if (a < aa[i]) stv[N + i] = aa[i] - a, a = aa[i];\n for (i = N - 1; i > 0; i--) {\n int l = i << 1, r = l | 1;\n sta[i] = Max(sta[l], sta[r]);\n stu[i] = stu[l] + stu[r];\n stv[i] = stv[l] + stv[r];\n }\n}\n\nint prev(int r, int a) {\n int l = 0;\n for (l += N, r += N; l <= r; l >>= 1, r >>= 1) {\n if ((r & 1) == 0) {\n if (sta[r] >= a) {\n while (r < N) r = sta[r << 1 | 1] >= a ? r << 1 | 1 : r << 1 | 0;\n return r - N;\n }\n r--;\n }\n }\n return -1;\n}\n\nint next(int l, int a) {\n int r = N - 1;\n for (l += N, r += N; l <= r; l >>= 1, r >>= 1) {\n if ((l & 1) == 1) {\n if (sta[l] >= a) {\n while (l < N) l = sta[l << 1 | 0] >= a ? l << 1 | 0 : l << 1 | 1;\n return l - N;\n }\n l++;\n }\n }\n return -1;\n}\n\nint first() {\n int i = 1;\n while (i < N) i = stu[i << 1 | 1] != 0 ? i << 1 | 1 : i << 1 | 0;\n return i - N;\n}\n\nint last() {\n int i = 1;\n while (i < N) i = stv[i << 1 | 0] != 0 ? i << 1 | 0 : i << 1 | 1;\n return i - N;\n}\n\nvoid update_u(int i, int x) {\n for (i += N; i > 0; i >>= 1) stu[i] += x;\n}\n\nint query_u(int l, int r) {\n int u = 0;\n for (l += N, r += N; l <= r; l >>= 1, r >>= 1) {\n if ((l & 1) == 1) u += stu[l++];\n if ((r & 1) == 0) u += stu[r--];\n }\n return u;\n}\n\nvoid update_v(int i, int x) {\n for (i += N; i > 0; i >>= 1) stv[i] += x;\n}\n\nint query_v(int l, int r) {\n int v = 0;\n for (l += N, r += N; l <= r; l >>= 1, r >>= 1) {\n if ((l & 1) == 1) v += stv[l++];\n if ((r & 1) == 0) v += stv[r--];\n }\n return v;\n}\n\nint main() {\n int n, Q, t, i, u, v;\n\n n = in(), Q = in();\n for (i = 0; i < n; i++) aa[i] = in();\n build(aa, n);\n while (Q--) {\n t = in(), i = in()-1;\n if (t == 1) {\n u = query_u(0, i);\n if (u <= query_v(i + 1, n - 1)) update_u(next(i + 1, u), 1);\n else update_v(last(), -1);\n update_u(0, -1);\n } else if (t == 2) {\n i = n - 1 - i;\n v = query_v(i, n - 1);\n if (v <= query_u(0, i - 1)) update_v(prev(i - 1, v), 1);\n else update_u(first(), -1);\n update_v(n - 1, -1);\n } else out(Min(aa[i], Min(query_u(0, i), query_v(i, n - 1))));\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 16252,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0751_9462913",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nconstexpr int NMAX = 1 << 19;\n\ninline int Min(int a, int b) { return a < b ? a : b; }\ninline int Max(int a, int b) { return a > b ? a : b; }\n\nvector<int> sta(2 * NMAX), stu(2 * NMAX), stv(2 * NMAX);\nvector<int> aa(NMAX);\nint N;\n\nvoid build(const vector<int>& aa, int n) {\n N = 1;\n while (N <= n) N <<= 1;\n for (int i = 0; i < n; i++) sta[N + i] = aa[i];\n int a = 0;\n for (int i = 0; i < n; i++)\n if (a < aa[i]) stu[N + i] = aa[i] - a, a = aa[i];\n a = 0;\n for (int i = n - 1; i >= 0; i--)\n if (a < aa[i]) stv[N + i] = aa[i] - a, a = aa[i];\n for (int i = N - 1; i > 0; i--) {\n int l = i << 1, r = l | 1;\n sta[i] = Max(sta[l], sta[r]);\n stu[i] = stu[l] + stu[r];\n stv[i] = stv[l] + stv[r];\n }\n}\n\nint prev(int r, int a) {\n int l = 0;\n for (l += N, r += N; l <= r; l >>= 1, r >>= 1) {\n if ((r & 1) == 0) {\n if (sta[r] >= a) {\n while (r < N) r = sta[r << 1 | 1] >= a ? r << 1 | 1 : r << 1 | 0;\n return r - N;\n }\n r--;\n }\n }\n return -1;\n}\n\nint next(int l, int a) {\n int r = N - 1;\n for (l += N, r += N; l <= r; l >>= 1, r >>= 1) {\n if ((l & 1) == 1) {\n if (sta[l] >= a) {\n while (l < N) l = sta[l << 1 | 0] >= a ? l << 1 | 0 : l << 1 | 1;\n return l - N;\n }\n l++;\n }\n }\n return -1;\n}\n\nint first() {\n int i = 1;\n while (i < N) i = stu[i << 1 | 1] != 0 ? i << 1 | 1 : i << 1 | 0;\n return i - N;\n}\n\nint last() {\n int i = 1;\n while (i < N) i = stv[i << 1 | 0] != 0 ? i << 1 | 0 : i << 1 | 1;\n return i - N;\n}\n\nvoid update_u(int i, int x) {\n for (i += N; i > 0; i >>= 1) stu[i] += x;\n}\n\nint query_u(int l, int r) {\n int u = 0;\n for (l += N, r += N; l <= r; l >>= 1, r >>= 1) {\n if ((l & 1) == 1) u += stu[l++];\n if ((r & 1) == 0) u += stu[r--];\n }\n return u;\n}\n\nvoid update_v(int i, int x) {\n for (i += N; i > 0; i >>= 1) stv[i] += x;\n}\n\nint query_v(int l, int r) {\n int v = 0;\n for (l += N, r += N; l <= r; l >>= 1, r >>= 1) {\n if ((l & 1) == 1) v += stv[l++];\n if ((r & 1) == 0) v += stv[r--];\n }\n return v;\n}\n\nint main() {\n int n, Q, t, i, u, v;\n\n cin >> n >> Q;\n for (i = 0; i < n; i++) cin >> aa[i];\n build(aa, n);\n while (Q--) {\n cin >> t >> i;\n i--; // 0-based index\n if (t == 1) {\n u = query_u(0, i);\n if (u <= query_v(i + 1, n - 1)) update_u(next(i + 1, u), 1);\n else update_v(last(), -1);\n update_u(0, -1);\n } else if (t == 2) {\n i = n - 1 - i;\n v = query_v(i, n - 1);\n if (v <= query_u(0, i - 1)) update_v(prev(i - 1, v), 1);\n else update_u(first(), -1);\n update_v(n - 1, -1);\n } else {\n cout << Min(aa[i], Min(query_u(0, i), query_v(i, n - 1))) << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 17352,
"score_of_the_acc": -1.4186,
"final_rank": 3
},
{
"submission_id": "aoj_0751_8004581",
"code_snippet": "#include <bits/extc++.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) begin(x),end(x)\n#define Fixed fixed << setprecision(12)\n#define updiv(a, b) (((a) + (b) - 1) / (b))\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\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 T, class U> istream& operator>>(istream& is, pair<T, U>& p){ is >> p.first >> p.second; return (is); }\ntemplate<class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p){ os << p.first << ' ' << p.second; return (os); }\ntemplate<class T> istream& operator>>(istream& is, vector<T>& v){ for (auto &&e : v) is >> e; return (is); }\ntemplate<class T> ostream& operator<<(ostream& os, vector<T>& v){ for (auto &&e : v) os << e << ' '; return (os); }\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 max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T, vector<T>, greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A, B>;\ntemplate <class T> using uset = unordered_set<T>;\n\ntemplate <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;\ntemplate <class T> using Rope = __gnu_cxx::rope<T>;\nusing Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n\ntemplate <class T> void bye(T x){ cout << x << '\\n'; exit(0); }\ninline int square(int a){ return (a * a); }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\n\ntemplate< typename T, typename F >\nstruct SegmentTree {\n int n, sz;\n vector< T > seg;\n\n const F f;\n const T ti;\n\n SegmentTree() = default;\n\n explicit SegmentTree(int n, const F f, const T &ti) : n(n), f(f), ti(ti) {\n sz = 1;\n while(sz < n) sz <<= 1;\n seg.assign(2 * sz, ti);\n }\n\n explicit SegmentTree(const vector< T > &v, const F f, const T &ti) :\n SegmentTree((int) v.size(), f, ti) {\n build(v);\n }\n\n void build(const vector< T > &v) {\n assert(n == (int) v.size());\n for(int k = 0; k < n; k++) seg[k + sz] = v[k];\n for(int k = sz - 1; k > 0; k--) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n void update(int k, const T &x) {\n k += sz;\n seg[k] = x;\n while(k >>= 1) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n T get(int k) const {\n return seg[k + sz];\n }\n\n T operator[](const int &k) const {\n return get(k);\n }\n\n void apply(int k, const T &x) {\n k += sz;\n seg[k] = f(seg[k], x);\n while(k >>= 1) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n T query(int l, int r) const {\n T L = ti, R = ti;\n for(l += sz, r += sz; l < r; l >>= 1, r >>= 1) {\n if(l & 1) L = f(L, seg[l++]);\n if(r & 1) R = f(seg[--r], R);\n }\n return f(L, R);\n }\n\n T query() const {\n return seg[1];\n }\n\n template< typename C >\n int find_first(int l, const C &check) const {\n if(l >= n) return n;\n l += sz;\n T sum = ti;\n do {\n while((l & 1) == 0) l >>= 1;\n if(check(f(sum, seg[l]))) {\n while(l < sz) {\n l <<= 1;\n auto nxt = f(sum, seg[l]);\n if(not check(nxt)) {\n sum = nxt;\n l++;\n }\n }\n return l + 1 - sz;\n }\n sum = f(sum, seg[l++]);\n } while((l & -l) != l);\n return n;\n }\n\n template< typename C >\n int find_last(int r, const C &check) const {\n if(r <= 0) return -1;\n r += sz;\n T sum = ti;\n do {\n r--;\n while(r > 1 and (r & 1)) r >>= 1;\n if(check(f(seg[r], sum))) {\n while(r < sz) {\n r = (r << 1) + 1;\n auto nxt = f(seg[r], sum);\n if(not check(nxt)) {\n sum = nxt;\n r--;\n }\n }\n return r - sz;\n }\n sum = f(seg[r], sum);\n } while((r & -r) != r);\n return -1;\n }\n};\n\ntemplate< typename T, typename F >\nSegmentTree< T, F > get_segment_tree(int N, const F &f, const T &ti) {\n return SegmentTree{N, f, ti};\n}\n\ntemplate< typename T, typename F >\nSegmentTree< T, F > get_segment_tree(const vector< T > &v, const F &f, const T &ti) {\n return SegmentTree{v, f, ti};\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, q;\n cin >> n >> q;\n\n vector<int> a(n), l(n), r(n);\n\n cin >> a;\n\n int minv = 0;\n for (int i = 0; i < n; ++i) {\n if (minv < a[i]) {\n l[i] = a[i] - minv;\n minv = a[i];\n }\n }\n minv = 0;\n for (int i = n - 1; i >= 0; --i) {\n if (minv < a[i]) {\n r[i] = a[i] - minv;\n minv = a[i];\n }\n }\n\n auto rmq = get_segment_tree(a, [](auto a, auto b) { return max(a, b); }, 0);\n auto segl = get_segment_tree(l, [](auto a, auto b) { return (a + b); }, 0);\n auto segr = get_segment_tree(r, [](auto a, auto b) { return (a + b); }, 0);\n\n for (int i = 0; i < q; ++i) {\n int t, x;\n cin >> t >> x;\n\n if (t == 1) {\n int maxl = segl.query(0, x);\n if (maxl <= segr.query(x, n)) {\n int pos = rmq.find_first(x, [&](auto a) { return (a >= maxl); }) - 1;\n segl.apply(pos, 1);\n } else {\n int pos = segr.find_first(0, [](auto a) { return (a != 0); }) - 1;\n segr.apply(pos, -1);\n }\n segl.apply(0, -1);\n } else if (t == 2) {\n x = n - x;\n int maxr = segr.query(x, n);\n if (maxr <= segl.query(0, x)) {\n int pos = rmq.find_last(x, [&](auto a) { return (a >= maxr); });\n segr.apply(pos, 1);\n } else {\n int pos = segl.find_last(n, [](auto a) { return (a != 0); });\n segl.apply(pos, -1);\n }\n segr.apply(n - 1, -1);\n } else {\n --x;\n cout << min({a[x], segl.query(0, x + 1), segr.query(x, n)}) << '\\n';\n }\n }\n\n return (0);\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 18880,
"score_of_the_acc": -1.2083,
"final_rank": 2
}
] |
aoj_0750_cpp
|
貨物列車 (Freight Train)
問題文
IOI 鉄道は
1
本の鉄道路線を運営している．IOI 鉄道線には一直線上に並んだ
N
個の駅があり，順に
1
から
N
までの番号が付けられている．各
i
(
1 ≦ i ≦ N - 1
) に対して，駅
i
と駅
i + 1
の間は線路で結ばれており，その長さは
1
である．
IOI 鉄道は貨物を取り扱っている．駅
2, 3, …, N
には貨物が
1
つずつ置かれており，駅
i
(
2 ≦ i ≦ N
) に置かれている貨物の価値は
A
i
である．
IOI 鉄道は貨物列車を
1
編成所有している．この列車は最初駅
1
におり，IOI 鉄道線上を双方向に走行できる．それぞれの駅では，その駅に置いてある貨物を列車に積むことや，列車に積まれている貨物を下ろし，その駅に置いておくことができる．
この貨物列車を用いて 駅
2, 3, …, N
に置かれている貨物を駅
1
に輸送したい．ただし，この列車には貨物を
W
個以下しか載せることができない．すなわち，どの時点においても列車に貨物が
W + 1
個以上載っていることは許されない．また，この列車は燃料の都合上，最大でも総距離
D
しか走行することができない．そのため，すべての貨物を駅
1
に輸送することはできないかもしれない．
IOI 鉄道の社長である JOI くんは，この条件のもと適切に貨物列車を走行させることで，最終的に駅
1
に置かれている貨物の価値の合計をなるべく大きくしたい．
貨物列車の情報と各駅に置かれている貨物の情報が与えられたとき，最終的に駅
1
に置かれている貨物の価値の合計として達成可能な最大値を求めるプログラムを作成せよ．
制約
2 ≦ N ≦ 450
．
1 ≦ W ≦ N - 1
．
2 ≦ D ≦ N
2
- N
．
1 ≦ A
i
≦ 1000000
(
2 ≦ i ≦ N
)．
入力される値はすべて整数である．
入力
入力は以下の形式で与えられる．
N
W
D
A
2
A
3
…
A
N
出力
最終的に駅
1
に置かれている貨物の価値の合計として達成可能な最大値を
1
行で出力せよ．
入出力例
入力例 1
4 1 10
1 1 1
出力例 1
2
例えば，以下のように貨物列車を走行させると最終的に駅
1
に置かれている貨物の価値の合計を
2
にすることができる．
最初，貨物列車は駅
1
にいる．
貨物列車を駅
2
に走行させる．
駅
2
に置かれている価値
1
の貨物を貨物列車に積む．
貨物列車を駅
1
に走行させる．
貨物列車に積まれている価値
1
の貨物を駅
1
に置く．
貨物列車を駅
4
に走行させる．
駅
4
に置かれている価値
1
の貨物を貨物列車に積む．
貨物列車を駅
1
に走行させる．
貨物列車に積まれている価値
1
の貨物を駅
1
に置く．
列車の走行した総距離は
8
であり，列車が総距離
10
以下しか走行できないという条件を満たしている．
このとき，最終的に駅
1
に置かれている貨物の価値の合計は
2
である．最終的に駅
1
に置かれている貨物の価値の合計を
3
以上にすることはできないため，
2
を出力する．
入力例 2
7 3 16
1 1 1 1 1 1
出力例 2
5
例えば，以下のように貨物列車を走行させると最終的に駅
1
に置かれている貨物の価値の合計を
5
にすることができる．
最初，貨物列車は駅
1
にいる．
貨物列車を駅
5
に走行させる．
駅
5
に置かれている価値
1
の貨物を貨物列車に積む．
貨物列車を駅
6
に走行させる．
駅
6
に置かれている価値
1
の貨物を貨物列車に積む．
貨物列車を駅
1
に走行させる．
貨物列車に積まれている
2
つの価値
1
の貨物をすべて駅
1
に置く．
貨物列車を駅
2
に走行させる．
駅
2
に置かれている価値
1
の貨物を貨物列車に積む．
貨物列車を駅
3
に走行させる．
駅
3
に置かれている価値
1
の貨物を貨物列車に積む．
貨物列車を駅
4
に走行させる．
駅
4
に置かれている価値
1
の貨物を貨物列車に積む．
貨物列車を駅
1
に走行させる．
貨物列車に積まれている
3
つの価値
1
の貨物をすべて駅
1
に置く．
列車の走行した総距離は
16
であり，列車が総距離
16
以下しか走行できないという条件を満たしている．
このとき，最終的に駅
1
に置かれている貨物の価値の合計は
5
である．最終的に駅
1
に置かれている貨物の価値の合計を
6
以上にすることはできないため，
5
を出力する．
入力例 3
5 2 12
40 30 20 10
出力例 3
100
例えば，以下のように貨物列車を走行させると最終的に駅
1
に置かれている貨物の価値の合計を
100
にすることができる．
最初，貨物列車は駅
1
にいる．
貨物列車を駅
5
に走行させる．
駅
5
に置かれている価値
10
の貨物を貨物列車に積む．
貨物列車を駅
4
に走行される．
駅
4
に置かれている価値
20
の貨物を貨物列車に積む．
貨物列車を駅
2
に走行させる．
貨物列車に積まれている価値
10
の貨物と価値
20
の貨物を駅
2
に置く．
駅
2
に置かれている価値
40
の貨物を貨物列車に積む．
貨物列車を駅
3
に走行させる．
駅
3
に置かれている価値
30
の貨物を貨物列車に積む．
貨物列車を駅
1
に走行させる．
貨物列車に積まれている価値
30
の貨物と価値
40
の貨物を駅
1
に置く．
貨物列車を駅
2
に走行させる．
駅
2
に置かれている価値
10
の貨物と価値
20
の貨物を貨物列車に積む．
貨物列車を駅
1
に走行させる．
貨物列車に積まれている価値
10
の貨物と価値
20
の貨物を駅
1
に置く．
列車の走行した総距離は
12
であり，列車が総距離
12
以下しか走行できないという条件を満たしている．
このとき，最終的に駅
1
に置かれている貨物の価値の合計は
100
である．最終的に駅
1
に置かれている貨物の価値の合計を
101
以上にすることはできないため，
100
を出力する．
入力例 4
5 1 11
2 7 1 8
出力例 4
10
入力例 5
9 3 14
54640 754112 604290 105866 591907 801383 502975 379373
出力例 5
2214425
情報オリンピック日本委員会
作 『第 22 回日本情報オリンピック JOI 2022/2023 二次予選競技課題』
|
[
{
"submission_id": "aoj_0750_9662876",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)\n#define RREP(i,n) RFOR(i,0,n)\nint main(){\n ll n,w,d;cin>>n>>w>>d;\n d/=2;\n d=min(d,(n/w+1)*(n/w+2)/2*w);\n vector<int>a(n);\n FOR(i,1,n)cin>>a[i];\n vector<vector<int>>dp(d+1,vector<int>(w,-1e9));\n REP(k,w)dp[0][k]=0;\n int ans=0;\n FOR(i,1,n){\n RREP(j,d+1-i)RREP(k,w){\n if(k<w-1)dp[j][k+1]=max(dp[j][k+1],dp[j][k]+a[i]);\n else if(j+i<=d){\n dp[j+i][0]=max(dp[j+i][0],dp[j][k]+a[i]);\n ans=max(ans,dp[j+i][0]);\n }\n }\n }\n cout<<ans<<endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 8624,
"score_of_the_acc": -0.116,
"final_rank": 2
},
{
"submission_id": "aoj_0750_9564838",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nint main(){\n ll N,W,D;\n cin>>N>>W>>D;\n D/=2;\n vector<ll> A(N-1);\n for(ll i=0;i<N-1;i++)cin>>A[i];\n\n ll LL=0;\n for(int i=N-1;i>0;i-=W){\n LL+=i;\n }\n if(LL<=D){\n ll an=0;\n for(int i=0;i<N-1;i++){\n an+=A[i];\n }\n cout<<an<<endl;\n return 0;\n }\n vector<vector<ll>> DP(D+1,vector<ll>(W,-1e18));\n DP[0][0]=0;\n ll an=0;\n\n for(int n=0;n<N-1;n++){\n vector<vector<ll>> NDP=DP;\n for(int d=0;d<=D;d++){\n for(int w=0;w<W;w++){\n if(w+1<W){\n NDP[d][w+1]=max(NDP[d][w+1],DP[d][w]+A[n]);\n }\n if(d+(n+1)<=D){\n NDP[d+(n+1)][0]=max(NDP[d+(n+1)][0],DP[d][w]+A[n]);\n an=max(NDP[d+(n+1)][0],an);\n }\n }\n }\n swap(DP,NDP);\n }\n cout<<an<<endl;\n}",
"accuracy": 1,
"time_ms": 1350,
"memory_kb": 14016,
"score_of_the_acc": -1.0255,
"final_rank": 6
},
{
"submission_id": "aoj_0750_9476143",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000LL // オーバーフローに注意\n#define MOD 998244353\n// #define MOD 1000000007\n#define EPS 0.000000001\n\n#define SIZE 450\n\nint A[SIZE];\nvector<vector<vector<int>>> dp;\n\nint main() {\n int N, W, D;\n cin >> N >> W >> D;\n\n for (int i = 2; i <= N; ++i) {\n cin >> A[i];\n }\n\n // 必要な燃料の最大量を求める\n int work = 0;\n int rest = (N - 1);\n while (true) {\n work += 2 * rest;\n rest -= W;\n if (rest <= 0) break;\n }\n\n D = min(D, work);\n\n dp.resize(2, vector<vector<int>>(W, vector<int>(D + 1, -1)));\n\n int now = 0, next = 1;\n int ans = 0;\n\n dp[now][W - 1][D] = 0;\n\n for (int i = N; i >= 2; --i) {\n // 選ばない\n for (int k = 0; k < W; ++k) {\n for (int p = 0; p <= D; ++p) {\n dp[next][k][p] = dp[now][k][p];\n }\n }\n\n // 選ぶ\n for (int k = 0; k < W; ++k) {\n for (int p = 0; p <= D; ++p) {\n if (dp[now][k][p] == -1) continue;\n\n int tmp = dp[now][k][p] + A[i];\n\n if (k == W - 1) { // 次が右端\n if (p >= 2 * (i - 1)) {\n chmax(dp[next][0][p - 2 * (i - 1)], tmp);\n chmax(ans, tmp);\n }\n } else { // 右端でないので燃料を消費しない\n chmax(dp[next][k + 1][p], tmp);\n chmax(ans, tmp);\n }\n }\n }\n swap(now, next);\n }\n\n cout << ans << endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 7840,
"score_of_the_acc": -0.1515,
"final_rank": 5
},
{
"submission_id": "aoj_0750_9209644",
"code_snippet": "#include <iostream>\n#include <string.h>\n#include <map>\nusing namespace std;\n\nstruct E{\n\tint time;\n\tint value;\n};\n\nconst int M=453;\nE dp[M][M];\nint ds[M];\nint main() {\n\t// your code goes here\n\tmemset(ds,0,sizeof(ds));\n\tint n,w,d;\n\tcin>>n>>w>>d;\n\t\n\t\n\tfor(int i=2;i<=n;i++){\n\t\tcin>>ds[i];\n\t}\n\tfor(int i=0;i<=n;i++){\n\t\tfor(int j=0;j<=n;j++){\n\t\t\tE e;\n\t\t\te.time=0;\n\t\t\te.value=0;\n\t\t\tdp[i][j]=e;\n\t\t}\n\t}\n\tfor(int i=3;i<=n;i++){\n\t\tE e;\n\t\te.time=2;\n\t\te.value=ds[i];\n\t\tdp[1][i-1]=e;\n\t}\n\tint ans=ds[2];\n\tfor(int i=0;i<=n;i++){\n\t\tfor(int j=n;j>=1;j--){\n\t\t\tint c0=(j-1)/w*2+2;\n\t\t\tint c1=(j)/w*2+2;\n\t\t\tfor(int k=2;k<=n;k++){\n\t\t\t\tE e=dp[j][k];\n\t\t\t\tE e2=dp[j][k];\n\t\t\t\tif(e.time==0)continue;\n\t\t\t\tif(e.time+c0<=d){\n\t\t\t\t\te2.time=e.time+c0;\n\t\t\t\t\tdp[j][k-1]=e2;\n\t\t\t\t}\n\t\t\t\tif(j+1<=n && e.time+c1<=d){\n\t\t\t\t\te2.time=e.time+c1;\n\t\t\t\t\te2.value=e.value+ds[k];\n\t\t\t\t\tdp[j+1][k-1]=e2;\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t\tfor(int j=1;j<=n;j++){\n\t\t\tE e=dp[j][1];\n\t\t\tif(0<e.time && ans<e.value){\n\t\t\t\tans=e.value;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}",
"accuracy": 0.41830065359477125,
"time_ms": 70,
"memory_kb": 4700,
"score_of_the_acc": -0.0376,
"final_rank": 9
},
{
"submission_id": "aoj_0750_8364595",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 450\n\nint A[SIZE];\nint ***dp;\n\n\nint main(){\n\n\tint N,W,D;\n\tscanf(\"%d %d %d\",&N,&W,&D);\n\n\tfor(int i = 2; i <= N; i++){\n\n\t\tscanf(\"%d\",&A[i]);\n\t}\n\n\t//必要な燃料の最大量を求める\n\tint work = 0;\n\tint rest = (N-1);\n\twhile(true){\n\n\t\twork += 2*rest;\n\t\trest -= W;\n\t\tif(rest <= 0)break;\n\t}\n\n\tD = min(D,work);\n\n\tdp = new int**[2];\n\tfor(int i = 0; i < 2; i++){\n\t\tdp[i] = new int*[W];\n\t\tfor(int k = 0; k < W; k++){\n\n\t\t\tdp[i][k] = new int[D+1];\n\t\t\tfor(int p = 0; p <= D; p++){\n\n\t\t\t\tdp[i][k][p] = -1;\n\t\t\t}\n\t\t}\n\t}\n\n\tint now = 0,next = 1;\n\tint ans = 0;\n\n\tdp[now][W-1][D] = 0;\n\n\tfor(int i = N; i >= 2; i--){\n\n\t\t//選ばない\n\t\tfor(int k = 0; k < W; k++){\n\t\t\tfor(int p = 0; p <= D; p++){\n\n\t\t\t\tdp[next][k][p] = dp[now][k][p];\n\t\t\t}\n\t\t}\n\n\t\t//選ぶ\n\t\tfor(int k = 0; k < W; k++){\n\t\t\tfor(int p = 0; p <= D; p++){\n\t\t\t\tif(dp[now][k][p] == -1)continue;\n\n\t\t\t\tint tmp = dp[now][k][p]+A[i];\n\n\t\t\t\tif(k == W-1){ //次が右端\n\n\t\t\t\t\tif(p >= 2*(i-1)){\n\n\t\t\t\t\t\tchmax(dp[next][0][p-2*(i-1)],tmp);\n\t\t\t\t\t\tchmax(ans,tmp);\n\t\t\t\t\t}\n\n\t\t\t\t}else{ //右端でないので燃料を消費しない\n\n\t\t\t\t\tchmax(dp[next][k+1][p],tmp);\n\t\t\t\t\tchmax(ans,tmp);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tswap(now,next);\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 6376,
"score_of_the_acc": -0.1399,
"final_rank": 4
},
{
"submission_id": "aoj_0750_8364593",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 450\n\nint A[SIZE];\nint ***dp;\n\n\nint main(){\n\n\tint N,W,D;\n\tscanf(\"%d %d %d\",&N,&W,&D);\n\n\tfor(int i = 2; i <= N; i++){\n\n\t\tscanf(\"%d\",&A[i]);\n\t}\n\n\tint work = 0;\n\tint rest = (N-1);\n\twhile(true){\n\n\t\twork += 2*rest;\n\t\trest -= W;\n\t\tif(rest <= 0)break;\n\t}\n\n\tD = min(D,work);\n\n\t//printf(\"D:%d\\n\",D);\n\n\tdp = new int**[2];\n\tfor(int i = 0; i < 2; i++){\n\t\tdp[i] = new int*[W];\n\t\tfor(int k = 0; k < W; k++){\n\n\t\t\tdp[i][k] = new int[D+1];\n\t\t\tfor(int p = 0; p <= D; p++){\n\n\t\t\t\tdp[i][k][p] = -1;\n\t\t\t}\n\t\t}\n\t}\n\n\tint now = 0,next = 1;\n\tint ans = 0;\n\n\tdp[now][W-1][D] = 0;\n\n\tfor(int i = N; i >= 2; i--){\n\n\t\t//選ばない\n\t\tfor(int k = 0; k < W; k++){\n\t\t\tfor(int p = 0; p <= D; p++){\n\n\t\t\t\tdp[next][k][p] = dp[now][k][p];\n\t\t\t}\n\t\t}\n\n\t\t//printf(\"\\ni:%d\\n\",i);\n\n\t\t//選ぶ\n\t\tfor(int k = 0; k < W; k++){\n\t\t\tfor(int p = 0; p <= D; p++){\n\t\t\t\tif(dp[now][k][p] == -1)continue;\n\n\t\t\t\tint tmp = dp[now][k][p]+A[i];\n\n\t\t\t\tif(k == W-1){ //次が右端\n\n\t\t\t\t\tif(p >= 2*(i-1)){\n\n\t\t\t\t\t\tchmax(dp[next][0][p-2*(i-1)],tmp);\n\t\t\t\t\t\t//printf(\"燃料;%d で選んで、tmp;%d\\n\",p,tmp);\n\t\t\t\t\t\tchmax(ans,tmp);\n\t\t\t\t\t}\n\n\t\t\t\t}else{ //右端でないので燃料を消費しない\n\n\t\t\t\t\tchmax(dp[next][k+1][p],tmp);\n\t\t\t\t\tchmax(ans,tmp);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tswap(now,next);\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 6352,
"score_of_the_acc": -0.1399,
"final_rank": 3
},
{
"submission_id": "aoj_0750_7949389",
"code_snippet": "#include <bits/extc++.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) begin(x),end(x)\n#define Fixed fixed << setprecision(12)\n#define updiv(a, b) (((a) + (b) - 1) / (b))\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\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 T, class U> istream& operator>>(istream& is, pair<T, U>& p){ is >> p.first >> p.second; return (is); }\ntemplate<class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p){ os << p.first << ' ' << p.second; return (os); }\ntemplate<class T> istream& operator>>(istream& is, vector<T>& v){ for (auto &&e : v) is >> e; return (is); }\ntemplate<class T> ostream& operator<<(ostream& os, vector<T>& v){ for (auto &&e : v) os << e << ' '; return (os); }\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 max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T, vector<T>, greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A, B>;\ntemplate <class T> using uset = unordered_set<T>;\n\ntemplate <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;\ntemplate <class T> using Rope = __gnu_cxx::rope<T>;\nusing Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n\ntemplate <class T> void bye(T x){ cout << x << '\\n'; exit(0); }\ninline int square(int a){ return (a * a); }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\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, w, d;\n cin >> n >> w >> d;\n\n assert(2 <= n && n <= 450);\n assert(1 <= w && w <= n - 1);\n assert(2 <= d && d <= n * n - n);\n\n d /= 2;\n\n vector<int> a(n);\n\n for (int i = 1; i < n; ++i) {\n cin >> a[i];\n assert(1 <= a[i] && a[i] <= 1000000);\n }\n\n int maxd = 0, cnt = 0;\n for (int i = n; i >= 1; --i) {\n if (cnt == 0) {\n maxd += i;\n }\n cnt = (cnt + 1) % w;\n }\n\n chmin(d, maxd);\n\n vector dp(n + 1, vector(w, vector(d + 1, -INF)));\n\n dp[n][0][0] = 0;\n\n int res = 0;\n for (int i = n - 1; i >= 1; --i) {\n for (int j = 0; j < w; ++j) {\n for (int k = 0; k <= d; ++k) {\n if (j == 0) {\n if (k + i <= d) {\n chmax(dp[i][(j + 1) % w][k + i], dp[i + 1][j][k] + a[i]);\n }\n } else{\n chmax(dp[i][(j + 1) % w][k], dp[i + 1][j][k] + a[i]);\n }\n chmax(dp[i][j][k], dp[i + 1][j][k]);\n }\n }\n }\n\n for (int j = 0; j < w; ++j) {\n for (int k = 0; k <= d; ++k) {\n chmax(res, dp[1][j][k]);\n }\n }\n\n cout << res << '\\n';\n\n return (0);\n}",
"accuracy": 1,
"time_ms": 330,
"memory_kb": 369516,
"score_of_the_acc": -1.2331,
"final_rank": 7
},
{
"submission_id": "aoj_0750_7949383",
"code_snippet": "#include <bits/extc++.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) begin(x),end(x)\n#define Fixed fixed << setprecision(12)\n#define updiv(a, b) (((a) + (b) - 1) / (b))\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\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 T, class U> istream& operator>>(istream& is, pair<T, U>& p){ is >> p.first >> p.second; return (is); }\ntemplate<class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p){ os << p.first << ' ' << p.second; return (os); }\ntemplate<class T> istream& operator>>(istream& is, vector<T>& v){ for (auto &&e : v) is >> e; return (is); }\ntemplate<class T> ostream& operator<<(ostream& os, vector<T>& v){ for (auto &&e : v) os << e << ' '; return (os); }\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 max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T, vector<T>, greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A, B>;\ntemplate <class T> using uset = unordered_set<T>;\n\ntemplate <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;\ntemplate <class T> using Rope = __gnu_cxx::rope<T>;\nusing Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n\ntemplate <class T> void bye(T x){ cout << x << '\\n'; exit(0); }\ninline int square(int a){ return (a * a); }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\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, w, d;\n cin >> n >> w >> d;\n\n d /= 2;\n\n vector<int> a(n);\n\n for (int i = 1; i < n; ++i) {\n cin >> a[i];\n }\n\n int maxd = 0, cnt = 0;\n for (int i = n; i >= 1; --i) {\n if (cnt == 0) {\n maxd += i;\n }\n cnt = (cnt + 1) % w;\n }\n\n chmin(d, maxd);\n\n vector dp(n + 1, vector(w, vector(d + 1, -INF)));\n\n dp[n][0][0] = 0;\n\n int res = 0;\n for (int i = n - 1; i >= 1; --i) {\n for (int j = 0; j < w; ++j) {\n for (int k = 0; k <= d; ++k) {\n if (j == 0) {\n if (k + i <= d) {\n chmax(dp[i][(j + 1) % w][k + i], dp[i + 1][j][k] + a[i]);\n }\n } else{\n chmax(dp[i][(j + 1) % w][k], dp[i + 1][j][k] + a[i]);\n }\n chmax(dp[i][j][k], dp[i + 1][j][k]);\n }\n }\n }\n\n for (int j = 0; j < w; ++j) {\n for (int k = 0; k <= d; ++k) {\n chmax(res, dp[1][j][k]);\n }\n }\n\n cout << res << '\\n';\n\n return (0);\n}",
"accuracy": 1,
"time_ms": 350,
"memory_kb": 369340,
"score_of_the_acc": -1.2476,
"final_rank": 8
},
{
"submission_id": "aoj_0750_7892762",
"code_snippet": "#include <bits/extc++.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) begin(x),end(x)\n#define Fixed fixed << setprecision(12)\n#define updiv(a, b) (((a) + (b) - 1) / (b))\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\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 T, class U> istream& operator>>(istream& is, pair<T, U>& p){ is >> p.first >> p.second; return (is); }\ntemplate<class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p){ os << p.first << ' ' << p.second; return (os); }\ntemplate<class T> istream& operator>>(istream& is, vector<T>& v){ for (auto &&e : v) is >> e; return (is); }\ntemplate<class T> ostream& operator<<(ostream& os, vector<T>& v){ for (auto &&e : v) os << e << ' '; return (os); }\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 max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T, vector<T>, greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A, B>;\ntemplate <class T> using uset = unordered_set<T>;\n\ntemplate <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;\ntemplate <class T> using Rope = __gnu_cxx::rope<T>;\nusing Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n\ntemplate <class T> void bye(T x){ cout << x << '\\n'; exit(0); }\ninline int square(int a){ return (a * a); }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\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, w, d;\n cin >> n >> w >> d;\n\n d /= 2;\n\n vector<int> a(n);\n\n for (int i = 1; i < n; ++i) {\n cin >> a[i];\n }\n\n // (i, j]\n // vector<vector<int> > val(n, vector<int>(n));\n int val[n][n];\n\n for (int i = 0; i < n; ++i) {\n int sum = 0;\n min_heap<int> pq;\n for (int j = i + 1; j < n; ++j) {\n pq.push(a[j]);\n if (pq.size() > w) {\n sum -= pq.top();\n pq.pop();\n }\n sum += a[j];\n val[i][j] = sum;\n }\n }\n // vector<vector<int> > dp(n, vector<int>(d + 1, -1));\n int dp[n][d + 1];\n for (int i = 0; i < n; ++i) {\n memset(dp[i], -1, 4 * (d + 1));\n }\n\n dp[0][0] = 0;\n for (int i = 0; i < n - 1; ++i) {\n int maxv = -1;\n for (int j = 0; j <= d && dp[i][j] != -1; ++j) {\n if (chmax(maxv, dp[i][j])) {\n chmax(dp[i + 1][j], maxv);\n for (int k = i + 1; k < n && j + k <= d; ++k) {\n chmax(dp[k][j + k], maxv + val[i][k]);\n }\n }\n }\n for (int j = 0; j < d && dp[i + 1][j] != -1; ++j) {\n chmax(dp[i + 1][j + 1], dp[i + 1][j]);\n }\n }\n\n cout << *max_element(dp[n - 1], dp[n - 1] + d + 1) << '\\n';\n\n return (0);\n}",
"accuracy": 0.11764705882352941,
"time_ms": 20,
"memory_kb": 35660,
"score_of_the_acc": -0.0849,
"final_rank": 10
},
{
"submission_id": "aoj_0750_7848660",
"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, W, D;\n cin >> N >> W >> D;\n vector<int> a(N);\n for(int i = 1; i < N; i++)cin >> a[i];\n D /= 2;\n int temp = (N + W - 1) / W;\n D = min(D, temp * (temp + 1) / 2 * W);\n vector<vector<int>> dp(W, vector<int>(D + 1, -(1 << 30)));\n dp[0][D] = 0;\n for(int i = N - 1; i >= 1; i--){\n int r = max(0, D - i + 1);\n vector<int> ndp(r, -(1 << 30));\n for(int j = i; j <= D; j++)ndp[j - i] = max(ndp[j - i], dp[0][j] + a[i]);\n for(int j = 1; j < W; j++){\n for(int k = 0; k <= D; k++){\n dp[j - 1][k] = max(dp[j - 1][k], dp[j][k] + a[i]);\n }\n }\n for(int j = 0; j < r; j++) dp[W - 1][j] = max(dp[W - 1][j], ndp[j]);\n }\n int ans = 0;\n for(int i = 0; i < W; i++)ans = max(ans, *max_element(dp[i].begin(), dp[i].end()));\n cout << ans << '\\n';\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 5352,
"score_of_the_acc": -0.0995,
"final_rank": 1
}
] |
aoj_0762_cpp
|
タイピング大会 (Typing Contest)
問題文
JOIG 国では JOIG 語が使用されており，JOIG 語では文字
A
,
B
,
C
,
D
,
E
,
F
,
G
,
H
,
I
,
J
,
K
,
L
,
M
,
N
,
O
の
15
種類の文字が用いられる．
来月 JOIG 国で開催されるタイピング大会では，JOIG 語で用いられる
15
種類の文字からなる長さ
N
の文字列
S
を入力するのにかかる時間を競う．この大会では，参加者は以下の条件でタイピングを行う．
参加者は，
1
本の指を使ってタイピングをする．
参加者は，
15
種類の文字のキー
1
つずつを
1
列に並べた，左右に細長いキーボードを使用する．なお，どの位置にどの文字のキーを配置するかは，各参加者が自由に決めることができる．
参加者は，文字列
S
の
1, 2, …, N
文字目のキーをこの順に打つことによって文字列
S
を入力する．
この大会には
Q
人が参加する予定である．参加者によってタイピングの能力は様々である．
i
番目 (
1 ≦ i ≦ Q
) の参加者は，タイピングに際して以下のような時間がかかる．
指の真下にあるキーを
1
回打つのに
A
i
ミリ秒かかる．
指を
1
つ左のキーの上に移動させるのに
L
i
ミリ秒かかる．
指を
1
つ右のキーの上に移動させるのに
R
i
ミリ秒かかる．
文字列
S
および各参加者の情報が与えられるので，各参加者に対して，文字列
S
の最初の文字を打ち始めてから最後の文字を打ち終わるまでに最短何ミリ秒かかるかを求めるプログラムを作成せよ．
制約
1 ≦ N ≦ 1 000 000
．
S
は長さ
N
の文字列である．
S
の各文字は
A
,
B
,
C
,
D
,
E
,
F
,
G
,
H
,
I
,
J
,
K
,
L
,
M
,
N
,
O
のいずれかである．
1 ≦ Q ≦ 150 000
．
1 ≦ A
i
≦ 10
11
(
1 ≦ i ≦ Q
)．
1 ≦ L
i
≦ 10
11
(
1 ≦ i ≦ Q
)．
1 ≦ R
i
≦ 10
11
(
1 ≦ i ≦ Q
)．
N, Q, A
i
, L
i
, R
i
は整数である．
入力
入力は以下の形式で与えられる．
N
S
Q
A
1
L
1
R
1
A
2
L
2
R
2
:
A
Q
L
Q
R
Q
出力
Q
行出力せよ．
i
行目 (
1 ≦ i ≦ Q
) には，参加者
i
が文字列
S
の最初の文字を打ち始めてから最後の文字を打ち終わるまでに最短何ミリ秒かかるかを出力せよ．
入出力例
入力例 1
6
ABAABB
1
100 150 210
出力例 1
1110
例えば，キーボードの配列を左から順に
ONMLKJIHGFEDCBA
とすることを考える．このとき，以下の表のような動作を行うことで，
1110
ミリ秒で文字列
ABAABB
を入力できる．
手順
動作
指の真下にあるキー
時間（ミリ秒）
1
A のキーを打つ
A
100
2
指を
1
つ左のキーの上に移動させる
A → B
150
3
B のキーを打つ
B
100
4
指を
1
つ右のキーの上に移動させる
B → A
210
5
A のキーを打つ
A
100
6
A のキーを打つ
A
100
7
指を
1
つ左のキーの上に移動させる
A → B
150
8
B のキーを打つ
B
100
9
B のキーを打つ
B
100
上に挙げたキーボードの配列以外にも，文字列
ABAABB
を同じ時間で入力できるものはあるが，より短い時間で入力することはできない．よって
1110
を出力する．
入力例 2
6
CBACAB
1
150 240 220
出力例 2
2260
例えば，キーボードの配列を左から順に
CABDEFGHIJKLMNO
とすることを考える．このとき，以下の表のような動作を行うことで，
2260
ミリ秒で文字列
CBACAB
を入力できる．
手順
動作
指の真下にあるキー
時間（ミリ秒）
1
C のキーを打つ
C
150
2
指を
1
つ右のキーの上に移動させる
C → A
220
3
指を
1
つ右のキーの上に移動させる
A → B
220
4
B のキーを打つ
B
150
5
指を
1
つ左のキーの上に移動させる
B → A
240
6
A のキーを打つ
A
150
7
指を
1
つ左のキーの上に移動させる
A → C
240
8
C のキーを打つ
C
150
9
指を
1
つ右のキーの上に移動させる
C → A
220
10
A のキーを打つ
A
150
11
指を
1
つ右のキーの上に移動させる
A → B
220
12
B のキーを打つ
B
150
上に挙げたキーボードの配列以外でも，文字列
CBACAB
を同じ時間で入力できるものはあるが，より短い時間で入力することはできない．よって
2260
を出力する．
入力例 3
20
AAAAAAAAAAAAAAAAAAAA
1
230000000 80000000 80000000
出力例 3
4600000000
A
を
20
回打つことになるので，キーボードの配列にかかわらず，入力し終わるまでに最短で
230000000 × 20 = 4600000000
ミリ秒かかる．よって
4600000000
を出力する．
入力例 4
7
EACHBAG
5
130 104 162
107 219 45
144 168 157
213 79 257
100000000000 100000000000 100000000000
出力例 4
2078
1766
2465
2894
1600000000000
入力例 5
19
JOIGCODINGCHALLENGE
5
1 1 1
100 200 200
225 111 111
123456789 987654321 987654321
31415926535 27182818284 27182818284
出力例 5
48
7700
7494
30987654300
1385204334401
情報オリンピック日本委員会
作 『日本情報オリンピック第3回女性部門 本選 競技課題』
|
[
{
"submission_id": "aoj_0762_9666432",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef vector<vvi> vvvi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)\n#define RREP(i,n) RFOR(i,0,n)\n#define sz(A) ((ll)A.size())\n#define ALL(A) A.begin(),A.end()\nint main(){\n int N;cin>>N;\n string S;cin>>S;\n vvi A(15,vi(15));\n REP(i,N-1)A[S[i]-'A'][S[i+1]-'A']++;\n vvi X(15,vi(15,1e18));\n vvi pre(1<<15,vi(15));\n REP(i,1<<15)REP(j,15){\n ll c=__builtin_popcount(i);\n REP(k,15)if(k!=j){\n if((i>>k)%2)pre[i][j]+=c*(A[j][k]+A[k][j]);\n else pre[i][j]-=c*(A[j][k]+A[k][j]);\n }\n }\n REP(i,15)REP(j,15)if((S[0]==S[N-1])^(i!=j)){\n int s=S[0]-'A',t=S[N-1]-'A';\n vi DP(1<<15,1e18);\n DP[0]=0;\n REP(k,1<<15){\n ll c=__builtin_popcount(k);\n if(c==i){\n if((k>>s)%2)continue;\n DP[k+(1<<s)]=min(DP[k+(1<<s)],DP[k]+pre[k][s]);\n }\n else if(c==j){\n if((k>>t)%2)continue;\n DP[k+(1<<t)]=min(DP[k+(1<<t)],DP[k]+pre[k][t]);\n }\n else{\n REP(l,15)if((k>>l)%2==0)DP[k+(1<<l)]=min(DP[k+(1<<l)],DP[k]+pre[k][l]);\n }\n }\n X[i][j]=DP.back();\n }\n int Q;cin>>Q;\n while(Q--){\n ll a,l,r;cin>>a>>l>>r;\n ll ans=1e18;\n REP(i,15)REP(j,15)if(X[i][j]<1e17){\n ans=min(ans,l*((X[i][j]-(j-i))/2)+r*((X[i][j]+(j-i))/2));\n }\n cout<<a*N+ans<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 520,
"memory_kb": 9180,
"score_of_the_acc": -0.9803,
"final_rank": 7
},
{
"submission_id": "aoj_0762_9476409",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n#define SIZE 1000005\n#define MAX 15\n\nstruct Info{\n Info(ll arg_L, ll arg_R) {\n L = arg_L;\n R = arg_R;\n }\n bool operator<(const struct Info& arg) const {\n if (L != arg.L) {\n return L < arg.L;\n } else {\n return R < arg.R;\n }\n }\n ll L, R;\n};\n\nll N;\nll POW[MAX+1];\nchar buf[SIZE];\nll memo[1024*32], A[SIZE];\nll dp[1024*32];\nll table[MAX][MAX];\n\nint popcount(int x) {\n int count = 0;\n while (x) {\n count += x & 1;\n x >>= 1;\n }\n return count;\n}\n\nint main() {\n\n POW[0] = 1;\n for (int i = 1; i <= MAX; i++) {\n POW[i] = POW[i-1]*2;\n }\n\n scanf(\"%lld %s\", &N, buf);\n for (ll i = 0; i < N; i++) {\n A[i] = buf[i] - 'A';\n }\n for (ll i = 0; i < N-1; i++) {\n table[A[i]][A[i+1]]++; // A[i]の次にA[i+1]を打つ必要がある回数\n }\n\n // 集合による、左方移動の最小値を前計算\n for (int state = 1; state < POW[MAX]-1; state++) {\n vector<int> P, Q;\n for (int loop = 0; loop < MAX; loop++) {\n if (state & POW[loop]) {\n P.push_back(loop); // 左方に配置済\n } else {\n Q.push_back(loop); // 未配置(右方にある)\n }\n }\n\n ll tmp = 0;\n\n for (size_t a = 0; a < P.size(); a++) {\n int to = P[a];\n for (size_t b = 0; b < Q.size(); b++) {\n int from = Q[b];\n tmp += table[from][to]; // 左方への動きを数える\n }\n }\n memo[state] = tmp;\n }\n\n vector<Info> vec;\n\n ll head = A[0], tail = A[N-1];\n\n if (head == tail) {\n for (int loc = 0; loc < MAX; loc++) {\n // dp初期化\n for (ll state = 0; state < POW[MAX]; state++) {\n dp[state] = HUGE_NUM;\n }\n\n dp[0] = 0;\n\n for (ll state = 0; state < POW[MAX]; state++) {\n int p_count = popcount(state);\n if (p_count == loc) { // 次はhead\n ll next_state = state | POW[head];\n ll add = memo[next_state];\n chmin(dp[next_state], dp[state] + add);\n } else {\n for (int next = 0; next < MAX; next++) {\n if (next == head) continue;\n if (state & POW[next]) continue;\n\n ll next_state = state | POW[next];\n ll add = memo[next_state];\n chmin(dp[next_state], dp[state] + add);\n }\n }\n }\n vec.push_back(Info(dp[POW[MAX]-1], dp[POW[MAX]-1])); // 左右の合計移動回数は同じ\n }\n } else {\n for (int i = 0; i < MAX; i++) { // headの位置\n for (int k = 0; k < MAX; k++) { // tailの位置\n if (k == i) continue;\n\n // dp初期化\n for (ll state = 0; state < POW[MAX]; state++) {\n dp[state] = HUGE_NUM;\n }\n dp[0] = 0;\n\n for (ll state = 0; state < POW[MAX]; state++) {\n int p_count = popcount(state);\n if (p_count == i) {\n ll next_state = state | POW[head];\n ll add = memo[next_state];\n chmin(dp[next_state], dp[state] + add);\n } else if (p_count == k) {\n ll next_state = state | POW[tail];\n ll add = memo[next_state];\n chmin(dp[next_state], dp[state] + add);\n } else {\n for (int next = 0; next < MAX; next++) {\n if (next == head || next == tail) continue;\n if (state & POW[next]) continue;\n\n ll next_state = state | POW[next];\n ll add = memo[next_state];\n chmin(dp[next_state], dp[state] + add);\n }\n }\n }\n\n ll toL = dp[POW[MAX]-1], toR = toL + (k - i);\n vec.push_back(Info(toL, toR));\n }\n }\n }\n\n sort(vec.begin(), vec.end());\n ll mini = HUGE_NUM;\n\n vector<Info> V;\n for (size_t i = 0; i < vec.size(); i++) {\n if (vec[i].R < mini) {\n mini = vec[i].R;\n V.push_back(vec[i]); // Lの昇順に見ていくので、Rは過去最小値のものだけ採用\n }\n }\n\n int numQ;\n scanf(\"%d\", &numQ);\n\n ll valA, valL, valR;\n\n for (int loop = 0; loop < numQ; loop++) {\n scanf(\"%lld %lld %lld\", &valA, &valL, &valR);\n\n int L = 0, R = V.size() - 1;\n\n ll calcL = valL * V[L].L + valR * V[L].R + valA * N;\n ll calcR = valL * V[R].L + valR * V[R].R + valA * N;\n\n ll ans = min(calcL, calcR);\n\n int pre1 = -1;\n int pre2 = -1;\n\n for (int loop = 0; loop < 100; loop++) {\n int mid1 = (2 * L + R) / 3;\n int mid2 = (L + 2 * R) / 3;\n\n if (mid1 == pre1 && mid2 == pre2) {\n if (mid2 - mid1 == 2) {\n ll work = valL * V[mid2 - 1].L + valR * V[mid2 - 1].R + valA * N;\n chmin(ans, work);\n }\n break;\n }\n\n ll val1 = valL * V[mid1].L + valR * V[mid1].R + valA * N;\n ll val2 = valL * V[mid2].L + valR * V[mid2].R + valA * N;\n\n chmin(ans, min(val1, val2));\n\n if (val1 > val2) {\n L = mid1;\n } else {\n R = mid2;\n }\n pre1 = mid1;\n pre2 = mid2;\n }\n\n printf(\"%lld\\n\", ans);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 340,
"memory_kb": 12900,
"score_of_the_acc": -0.5084,
"final_rank": 5
},
{
"submission_id": "aoj_0762_9052673",
"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, q;\n string s;\n cin >> n >> s >> q;\n const int M = 15;\n vector<vector<int>> cnt(M, vector<int>(M));\n for (int i = 0; i + 1 < n; i++) {\n cnt[s[i] - 'A'][s[i + 1] - 'A'] += 1;\n }\n int S = s[0] - 'A', T = s.back() - 'A';\n const int inf = 2e9;\n const int K = 14;\n vector<int> cal(K * 2 + 1, inf);\n\n vector<int> popcount(1 << M);\n for (int i = 0; i < (1 << M); i++) {\n popcount[i] = __builtin_popcount(i);\n }\n vector<int> pre(1 << M);\n for (int i = 0; i < (1 << M); i++) {\n for (int j = 0; j < M; j++) {\n if ((1 << j) & i) continue;\n for (int k = 0; k < M; k++) {\n if ((1 << k) & i) pre[i] += cnt[j][k];\n }\n }\n }\n\n // (Tの位置)-(Sの位置) = i\n for (int i = -K; i <= K; i++) {\n if ((S == T) ^ (i == 0)) continue;\n for (int a = 0; a < M; a++) {\n int b = a + i;\n if (b < 0 or M <= b) continue;\n\n vector<int> dp((1 << M), inf);\n dp[0] = 0;\n for (int j = 0; j < (1 << M); j++) {\n for (int k = 0; k < M; k++) {\n if ((1 << k) & j) continue;\n if (k == S and popcount[j] != a) continue;\n if (k == T and popcount[j] != b) continue;\n int nxt = j + (1 << k);\n dp[nxt] = min(dp[nxt], dp[j] + pre[nxt]);\n }\n }\n\n cal[i + K] = min(cal[i + K], dp.back());\n }\n }\n\n while (q--) {\n ll a, l, r;\n cin >> a >> l >> r;\n ll res = (ll)inf * (ll)inf;\n for (int i = -K; i <= K; i++) {\n ll cntL = cal[i + K];\n if (cntL == inf) continue;\n ll cntR = cntL + i;\n res = min(res, cntL * l + cntR * r);\n }\n res += a * n;\n cout << res << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 380,
"memory_kb": 4428,
"score_of_the_acc": -0.5556,
"final_rank": 6
},
{
"submission_id": "aoj_0762_8525840",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\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\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll N, Q;\n string S;\n cin >> N >> S >> Q;\n ll CN = 15;\n vvll P(CN, vll(CN, 0));\n rep(i, N - 1) {\n P[S[i] - 'A'][S[i + 1] - 'A']++;\n }\n\n vll ML(1 << CN, 0), MR(1 << CN, 0);\n rep(bit, 1 << CN) {\n rep(i, CN)rep(j, CN) {\n if (bit & (1 << i)) {\n if (!(bit & (1 << j))) {\n MR[bit] += P[i][j];\n ML[bit] += P[j][i];\n }\n }\n }\n }\n map<ll, ll> RminusL;\n rep(i, CN)rep(j, CN) {//S[0]がi番目,S[N-1]がj番目 \n if (S[0] == S[N - 1] && i != j)continue;\n if (S[0] != S[N - 1] && i == j)continue;\n vll DP(1 << CN, 1e18);\n DP[0] = 0;\n rep(bit, 1 << CN) {\n ll cnt = 0;\n rep(k, CN)if (bit & (1 << k))cnt++;\n\n rep(k, CN) {\n if (cnt == i && k != S[0] - 'A')continue;\n if (cnt == j && k != S[N - 1] - 'A')continue;\n if (bit & (1 << k))continue;\n ll nbit = bit + (1 << k);\n ll cost = MR[nbit];\n chmin(DP[bit + (1 << k)], DP[bit] + cost);\n }\n }\n if(!RminusL.count(i-j))\n RminusL[i - j] = DP[(1 << CN) - 1];\n\n chmin(RminusL[i - j], DP[(1 << CN) - 1]);\n }\n\n rep(q, Q) {\n ll A, L, R;\n cin >> A >> L >> R;\n ll an = A * N;\n ll bn = 1e18;\n for (auto m : RminusL) {\n ll RN = m.second;\n ll LN = RN + m.first;\n chmin(bn, R * RN + L * LN);\n }\n cout << an + bn << endl;\n }\n\n\n}",
"accuracy": 1,
"time_ms": 540,
"memory_kb": 4920,
"score_of_the_acc": -1.0037,
"final_rank": 9
},
{
"submission_id": "aoj_0762_8369924",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 1000005\n#define MAX 15\n\nstruct Info{\n\tInfo(ll arg_L,ll arg_R){\n\t\tL = arg_L;\n\t\tR = arg_R;\n\t}\n\tbool operator<(const struct Info& arg) const{\n\t\tif(L != arg.L){\n\n\t\t\treturn L < arg.L;\n\t\t}else{\n\n\t\t\treturn R < arg.R;\n\t\t}\n\t}\n\tll L,R;\n};\n\nll N;\nll POW[MAX+1];\nchar buf[SIZE];\nll memo[1024*32],A[SIZE];\nll dp[1024*32];\nll table[MAX][MAX];\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\tscanf(\"%lld %s\",&N,buf);\n\tfor(ll i = 0; i < N; i++){\n\n\t\tA[i] = buf[i]-'A';\n\t}\n\tfor(ll i = 0; i < N-1; i++){\n\n\t\ttable[A[i]][A[i+1]]++; //A[i]の次にA[i+1]を打つ必要がある回数\n\t}\n\n\t//集合による、左方移動の最小値を前計算\n\tfor(int state = 1; state < POW[MAX]-1; state++){\n\t\tvector<int> P,Q;\n\t\tfor(int loop = 0; loop < MAX; loop++){\n\t\t\tif(state&POW[loop]){\n\n\t\t\t\tP.push_back(loop); //左方に配置済\n\n\t\t\t}else{\n\n\t\t\t\tQ.push_back(loop); //未配置(右方にある)\n\t\t\t}\n\t\t}\n\n\t\tll tmp = 0;\n\n\t\tfor(int a = 0; a < P.size(); a++){\n\t\t\tint to = P[a];\n\n\t\t\tfor(int b = 0; b < Q.size(); b++){\n\t\t\t\tint from = Q[b];\n\t\t\t\ttmp += table[from][to]; //左方への動きを数える\n\t\t\t}\n\t\t}\n\t\tmemo[state] = tmp;\n\t}\n\n\tvector<Info> vec;\n\n\tll head = A[0],tail = A[N-1];\n\n\tif(head == tail){\n\n\t\tfor(int loc = 0; loc < MAX; loc++){\n\n\t\t\t//dp初期化\n\t\t\tfor(ll state = 0; state < POW[MAX]; state++){\n\t\t\t\tdp[state] = HUGE_NUM;\n\t\t\t}\n\n\t\t\tdp[0] = 0;\n\n\t\t\tfor(ll state = 0; state < POW[MAX]; state++){\n\t\t\t\tint p_count = __builtin_popcount(state);\n\t\t\t\tif(p_count == loc){ //■次はhead\n\n\t\t\t\t\tll next_state = state|POW[head];\n\t\t\t\t\tll add = memo[next_state];\n\t\t\t\t\tchmin(dp[next_state],dp[state]+add);\n\n\t\t\t\t}else{\n\n\t\t\t\t\tfor(int next = 0; next < MAX; next++){\n\t\t\t\t\t\tif(next == head)continue;\n\t\t\t\t\t\tif(state&POW[next])continue;\n\n\t\t\t\t\t\tll next_state = state|POW[next];\n\t\t\t\t\t\tll add = memo[next_state];\n\t\t\t\t\t\tchmin(dp[next_state],dp[state]+add);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tvec.push_back(Info(dp[POW[MAX]-1],dp[POW[MAX]-1])); //左右の合計移動回数は同じ\n\t\t}\n\n\n\t}else{\n\n\t\tfor(int i = 0; i < MAX; i++){ //headの位置\n\t\t\tfor(int k = 0; k < MAX; k++){ //tailの位置\n\t\t\t\tif(k == i)continue;\n\n\t\t\t\t//dp初期化\n\t\t\t\tfor(ll state = 0; state < POW[MAX]; state++){\n\t\t\t\t\tdp[state] = HUGE_NUM;\n\t\t\t\t}\n\t\t\t\tdp[0] = 0;\n\n\t\t\t\tfor(ll state = 0; state < POW[MAX]; state++){\n\t\t\t\t\tint p_count = __builtin_popcount(state);\n\t\t\t\t\tif(p_count == i){\n\n\t\t\t\t\t\tll next_state = state|POW[head];\n\t\t\t\t\t\tll add = memo[next_state];\n\t\t\t\t\t\tchmin(dp[next_state],dp[state]+add);\n\n\t\t\t\t\t}else if(p_count == k){\n\n\t\t\t\t\t\tll next_state = state|POW[tail];\n\t\t\t\t\t\tll add = memo[next_state];\n\t\t\t\t\t\tchmin(dp[next_state],dp[state]+add);\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tfor(int next = 0; next < MAX; next++){\n\t\t\t\t\t\t\tif(next == head || next == tail)continue;\n\t\t\t\t\t\t\tif(state&POW[next])continue;\n\n\t\t\t\t\t\t\tll next_state = state|POW[next];\n\t\t\t\t\t\t\tll add = memo[next_state];\n\t\t\t\t\t\t\tchmin(dp[next_state],dp[state]+add);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tll toL = dp[POW[MAX]-1],toR = toL + (k-i);\n\t\t\t\tvec.push_back(Info(toL,toR));\n\t\t\t}\n\t\t}\n\t}\n\n\tsort(vec.begin(),vec.end());\n\tll mini = HUGE_NUM;\n\n\tvector<Info> V;\n\tfor(int i = 0; i < vec.size(); i++){\n\t\tif(vec[i].R < mini){\n\n\t\t\tmini = vec[i].R;\n\t\t\tV.push_back(vec[i]); //Lの昇順に見ていくので、Rは過去最小値のものだけ採用\n\t\t}\n\t}\n\n\tint numQ;\n\tscanf(\"%d\",&numQ);\n\n\tll valA,valL,valR;\n\n\tfor(int loop = 0; loop < numQ; loop++){\n\n\t\tscanf(\"%lld %lld %lld\",&valA,&valL,&valR);\n\n\t\tint L = 0,R = V.size()-1;\n\n\t\tll calcL = valL*V[L].L + valR*V[L].R + valA*N;\n\t\tll calcR = valL*V[R].L + valR*V[R].R + valA*N;\n\n\t\tll ans = min(calcL,calcR);\n\n\t\tint pre1 = -1;\n\t\tint pre2 = -1;\n\n\t\tfor(int loop = 0; loop < 100; loop++){\n\n\t\t\tint mid1 = (2*L+R)/3;\n\t\t\tint mid2 = (L+2*R)/3;\n\n\t\t\tif(mid1 == pre1 && mid2 == pre2){\n\t\t\t\tif(mid2-mid1 == 2){\n\n\t\t\t\t\tll work = valL*V[mid2-1].L + valR*V[mid2-1].R + valA*N;\n\t\t\t\t\tchmin(ans,work);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tll val1 = valL*V[mid1].L + valR*V[mid1].R + valA*N;\n\t\t\tll val2 = valL*V[mid2].L + valR*V[mid2].R + valA*N;\n\n\t\t\tchmin(ans,min(val1,val2));\n\n\t\t\tif(val1 > val2){\n\n\t\t\t\tL = mid1;\n\t\t\t}else{\n\n\t\t\t\tR = mid2;\n\t\t\t}\n\t\t\tpre1 = mid1;\n\t\t\tpre2 = mid2;\n\t\t}\n\n\t\tprintf(\"%lld\\n\",ans);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 340,
"memory_kb": 12520,
"score_of_the_acc": -0.5055,
"final_rank": 3
},
{
"submission_id": "aoj_0762_8369923",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 1000005\n#define MAX 15\n\nstruct Info{\n\tInfo(ll arg_L,ll arg_R){\n\t\tL = arg_L;\n\t\tR = arg_R;\n\t}\n\tbool operator<(const struct Info& arg) const{\n\t\tif(L != arg.L){\n\n\t\t\treturn L < arg.L;\n\t\t}else{\n\n\t\t\treturn R < arg.R;\n\t\t}\n\t}\n\tll L,R;\n};\n\nll N;\nll POW[MAX+1];\nchar buf[SIZE];\nll memo[1024*32],A[SIZE];\nll dp[1024*32];\nll table[MAX][MAX];\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\tscanf(\"%lld %s\",&N,buf);\n\tfor(ll i = 0; i < N; i++){\n\n\t\tA[i] = buf[i]-'A';\n\t}\n\tfor(ll i = 0; i < N-1; i++){\n\n\t\ttable[A[i]][A[i+1]]++; //A[i]→A[i+1]が隣接している回数\n\t}\n\n\tfor(int state = 1; state < POW[MAX]-1; state++){\n\t\tvector<int> P,Q;\n\t\tfor(int loop = 0; loop < MAX; loop++){\n\t\t\tif(state&POW[loop]){\n\n\t\t\t\tP.push_back(loop); //左方に配置済\n\n\t\t\t}else{\n\n\t\t\t\tQ.push_back(loop); //未配置(右方にある)\n\t\t\t}\n\t\t}\n\n\t\tll tmp = 0;\n\n\t\tfor(int a = 0; a < P.size(); a++){\n\t\t\tint to = P[a];\n\n\t\t\tfor(int b = 0; b < Q.size(); b++){\n\t\t\t\tint from = Q[b];\n\t\t\t\ttmp += table[from][to]; //左方への動きを数える\n\t\t\t}\n\t\t}\n\t\tmemo[state] = tmp;\n\t}\n\n\tvector<Info> vec;\n\n\tll head = A[0],tail = A[N-1];\n\n\tif(head == tail){\n\n\t\tfor(int loc = 0; loc < MAX; loc++){\n\n\t\t\t//dp初期化\n\t\t\tfor(ll state = 0; state < POW[MAX]; state++){\n\t\t\t\tdp[state] = HUGE_NUM;\n\t\t\t}\n\n\t\t\tdp[0] = 0;\n\n\t\t\tfor(ll state = 0; state < POW[MAX]; state++){\n\t\t\t\tint p_count = __builtin_popcount(state);\n\t\t\t\tif(p_count == loc){ //■次はhead\n\n\t\t\t\t\tll next_state = state|POW[head];\n\t\t\t\t\tll add = memo[next_state];\n\t\t\t\t\tchmin(dp[next_state],dp[state]+add);\n\n\t\t\t\t}else{\n\n\t\t\t\t\tfor(int next = 0; next < MAX; next++){\n\t\t\t\t\t\tif(next == head)continue;\n\t\t\t\t\t\tif(state&POW[next])continue;\n\n\t\t\t\t\t\tll next_state = state|POW[next];\n\t\t\t\t\t\tll add = memo[next_state];\n\t\t\t\t\t\tchmin(dp[next_state],dp[state]+add);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tvec.push_back(Info(dp[POW[MAX]-1],dp[POW[MAX]-1])); //左右の合計移動回数は同じ\n\t\t}\n\n\n\t}else{\n\n\t\tfor(int i = 0; i < MAX; i++){ //headの位置\n\t\t\tfor(int k = 0; k < MAX; k++){ //tailの位置\n\t\t\t\tif(k == i)continue;\n\n\t\t\t\t//dp初期化\n\t\t\t\tfor(ll state = 0; state < POW[MAX]; state++){\n\t\t\t\t\tdp[state] = HUGE_NUM;\n\t\t\t\t}\n\t\t\t\tdp[0] = 0;\n\n\t\t\t\tfor(ll state = 0; state < POW[MAX]; state++){\n\t\t\t\t\tint p_count = __builtin_popcount(state);\n\t\t\t\t\tif(p_count == i){\n\n\t\t\t\t\t\tll next_state = state|POW[head];\n\t\t\t\t\t\tll add = memo[next_state];\n\t\t\t\t\t\tchmin(dp[next_state],dp[state]+add);\n\n\t\t\t\t\t}else if(p_count == k){\n\n\t\t\t\t\t\tll next_state = state|POW[tail];\n\t\t\t\t\t\tll add = memo[next_state];\n\t\t\t\t\t\tchmin(dp[next_state],dp[state]+add);\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tfor(int next = 0; next < MAX; next++){\n\t\t\t\t\t\t\tif(next == head || next == tail)continue;\n\t\t\t\t\t\t\tif(state&POW[next])continue;\n\n\t\t\t\t\t\t\tll next_state = state|POW[next];\n\t\t\t\t\t\t\tll add = memo[next_state];\n\t\t\t\t\t\t\tchmin(dp[next_state],dp[state]+add);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tll toL = dp[POW[MAX]-1],toR = toL + k-i;\n\t\t\t\tvec.push_back(Info(toL,toR));\n\t\t\t}\n\t\t}\n\t}\n\n\tsort(vec.begin(),vec.end());\n\tll mini = HUGE_NUM;\n\n\tvector<Info> V;\n\tfor(int i = 0; i < vec.size(); i++){\n\t\tif(vec[i].R < mini){\n\n\t\t\tmini = vec[i].R;\n\t\t\tV.push_back(vec[i]); //Lの昇順に見ていくので、Rは過去最小値のものだけ採用\n\t\t}\n\t}\n\n\t/*for(int i = 0; i < V.size(); i++){\n\n\t\tprintf(\"L:%lld R:%lld\\n\",V[i].L,V[i].R);\n\t}*/\n\n\tint numQ;\n\tscanf(\"%d\",&numQ);\n\n\tll valA,valL,valR;\n\n\tfor(int loop = 0; loop < numQ; loop++){\n\n\t\tscanf(\"%lld %lld %lld\",&valA,&valL,&valR);\n\n\t\tint L = 0,R = V.size()-1;\n\n\t\tll calcL = valL*V[L].L + valR*V[L].R + valA*N;\n\t\tll calcR = valL*V[R].L + valR*V[R].R + valA*N;\n\n\t\tll ans = min(calcL,calcR);\n\n\t\tint pre1 = -1;\n\t\tint pre2 = -1;\n\n\t\tfor(int loop = 0; loop < 100; loop++){\n\n\t\t\tint mid1 = (2*L+R)/3;\n\t\t\tint mid2 = (L+2*R)/3;\n\n\t\t\tif(mid1 == pre1 && mid2 == pre2){\n\t\t\t\tif(mid2-mid1 >= 2){\n\n\t\t\t\t\tll work = valL*V[mid2-1].L + valR*V[mid2-1].R + valA*N;\n\t\t\t\t\tchmin(ans,work);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t//printf(\"mid1:%d mid2:%d\\n\",mid1,mid2);\n\n\t\t\tll val1 = valL*V[mid1].L + valR*V[mid1].R + valA*N;\n\t\t\tll val2 = valL*V[mid2].L + valR*V[mid2].R + valA*N;\n\n\t\t\tchmin(ans,min(val1,val2));\n\n\t\t\tif(val1 > val2){\n\n\t\t\t\tL = mid1;\n\t\t\t}else{\n\n\t\t\t\tR = mid2;\n\t\t\t}\n\t\t\tpre1 = mid1;\n\t\t\tpre2 = mid2;\n\t\t}\n\n\t\tprintf(\"%lld\\n\",ans);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 340,
"memory_kb": 12532,
"score_of_the_acc": -0.5056,
"final_rank": 4
},
{
"submission_id": "aoj_0762_8369922",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 1000005\n#define MAX 15\n\nstruct Info{\n\tInfo(ll arg_L,ll arg_R){\n\t\tL = arg_L;\n\t\tR = arg_R;\n\t}\n\tbool operator<(const struct Info& arg) const{\n\t\tif(L != arg.L){\n\n\t\t\treturn L < arg.L;\n\t\t}else{\n\n\t\t\treturn R < arg.R;\n\t\t}\n\t}\n\tll L,R;\n};\n\nll N;\nll POW[MAX+1];\nchar buf[SIZE];\nll memo[1024*32],A[SIZE];\nll dp[1024*32];\nll table[MAX][MAX];\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\tscanf(\"%lld %s\",&N,buf);\n\tfor(ll i = 0; i < N; i++){\n\n\t\tA[i] = buf[i]-'A';\n\t}\n\tfor(ll i = 0; i < N-1; i++){\n\n\t\ttable[A[i]][A[i+1]]++; //A[i]→A[i+1]が隣接している回数\n\t}\n\n\tfor(int state = 1; state < POW[MAX]-1; state++){\n\t\tvector<int> P,Q;\n\t\tfor(int loop = 0; loop < MAX; loop++){\n\t\t\tif(state&POW[loop]){\n\n\t\t\t\tP.push_back(loop); //左方に配置済\n\n\t\t\t}else{\n\n\t\t\t\tQ.push_back(loop); //未配置(右方にある)\n\t\t\t}\n\t\t}\n\n\t\tll tmp = 0;\n\n\t\tfor(int a = 0; a < P.size(); a++){\n\t\t\tint to = P[a];\n\n\t\t\tfor(int b = 0; b < Q.size(); b++){\n\t\t\t\tint from = Q[b];\n\t\t\t\ttmp += table[from][to]; //左方への動きを数える\n\t\t\t}\n\t\t}\n\t\tmemo[state] = tmp;\n\t}\n\n\tvector<Info> vec;\n\n\tll head = A[0],tail = A[N-1];\n\n\tif(head == tail){\n\n\t\tfor(int loc = 0; loc < MAX; loc++){\n\n\t\t\t//dp初期化\n\t\t\tfor(ll state = 0; state < POW[MAX]; state++){\n\t\t\t\tdp[state] = HUGE_NUM;\n\t\t\t}\n\n\t\t\tdp[0] = 0;\n\n\t\t\tfor(ll state = 0; state < POW[MAX]; state++){\n\t\t\t\tint p_count = __builtin_popcount(state);\n\t\t\t\tif(p_count == loc){ //■次はhead\n\n\t\t\t\t\tll next_state = state|POW[head];\n\t\t\t\t\tll add = memo[next_state];\n\t\t\t\t\tchmin(dp[next_state],dp[state]+add);\n\n\t\t\t\t}else{\n\n\t\t\t\t\tfor(int next = 0; next < MAX; next++){\n\t\t\t\t\t\tif(next == head)continue;\n\t\t\t\t\t\tif(state&POW[next])continue;\n\n\t\t\t\t\t\tll next_state = state|POW[next];\n\t\t\t\t\t\tll add = memo[next_state];\n\t\t\t\t\t\tchmin(dp[next_state],dp[state]+add);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tvec.push_back(Info(dp[POW[MAX]-1],dp[POW[MAX]-1])); //左右の合計移動回数は同じ\n\t\t}\n\n\n\t}else{\n\n\t\tfor(int i = 0; i < MAX; i++){ //headの位置\n\t\t\tfor(int k = 0; k < MAX; k++){ //tailの位置\n\t\t\t\tif(k == i)continue;\n\n\t\t\t\t//dp初期化\n\t\t\t\tfor(ll state = 0; state < POW[MAX]; state++){\n\t\t\t\t\tdp[state] = HUGE_NUM;\n\t\t\t\t}\n\t\t\t\tdp[0] = 0;\n\n\t\t\t\tfor(ll state = 0; state < POW[MAX]; state++){\n\t\t\t\t\tint p_count = __builtin_popcount(state);\n\t\t\t\t\tif(p_count == i){\n\n\t\t\t\t\t\tll next_state = state|POW[head];\n\t\t\t\t\t\tll add = memo[next_state];\n\t\t\t\t\t\tchmin(dp[next_state],dp[state]+add);\n\n\t\t\t\t\t}else if(p_count == k){\n\n\t\t\t\t\t\tll next_state = state|POW[tail];\n\t\t\t\t\t\tll add = memo[next_state];\n\t\t\t\t\t\tchmin(dp[next_state],dp[state]+add);\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tfor(int next = 0; next < MAX; next++){\n\t\t\t\t\t\t\tif(next == head || next == tail)continue;\n\t\t\t\t\t\t\tif(state&POW[next])continue;\n\n\t\t\t\t\t\t\tll next_state = state|POW[next];\n\t\t\t\t\t\t\tll add = memo[next_state];\n\t\t\t\t\t\t\tchmin(dp[next_state],dp[state]+add);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tll toL = dp[POW[MAX]-1],toR = toL + k-i;\n\t\t\t\tif(toL == 0){\n\t\t\t\t\tprintf(\"■■i:%d k;%d\\n\",i,k);\n\n\t\t\t\t}\n\t\t\t\tvec.push_back(Info(toL,toR));\n\t\t\t}\n\t\t}\n\t}\n\n\tsort(vec.begin(),vec.end());\n\tll mini = HUGE_NUM;\n\n\tvector<Info> V;\n\tfor(int i = 0; i < vec.size(); i++){\n\t\tif(vec[i].R < mini){\n\n\t\t\tmini = vec[i].R;\n\t\t\tV.push_back(vec[i]); //Lの昇順に見ていくので、Rは過去最小値のものだけ採用\n\t\t}\n\t}\n\n\t/*for(int i = 0; i < V.size(); i++){\n\n\t\tprintf(\"L:%lld R:%lld\\n\",V[i].L,V[i].R);\n\t}*/\n\n\tint numQ;\n\tscanf(\"%d\",&numQ);\n\n\tll valA,valL,valR;\n\n\tfor(int loop = 0; loop < numQ; loop++){\n\n\t\tscanf(\"%lld %lld %lld\",&valA,&valL,&valR);\n\n\t\tint L = 0,R = V.size()-1;\n\n\t\tll calcL = valL*V[L].L + valR*V[L].R + valA*N;\n\t\tll calcR = valL*V[R].L + valR*V[R].R + valA*N;\n\n\t\tll ans = min(calcL,calcR);\n\n\t\tint pre1 = -1;\n\t\tint pre2 = -1;\n\n\t\tfor(int loop = 0; loop < 100; loop++){\n\n\t\t\tint mid1 = (2*L+R)/3;\n\t\t\tint mid2 = (L+2*R)/3;\n\n\t\t\tif(mid1 == pre1 && mid2 == pre2){\n\t\t\t\tif(mid2-mid1 >= 2){\n\n\t\t\t\t\tll work = valL*V[mid2-1].L + valR*V[mid2-1].R + valA*N;\n\t\t\t\t\tchmin(ans,work);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t//printf(\"mid1:%d mid2:%d\\n\",mid1,mid2);\n\n\t\t\tll val1 = valL*V[mid1].L + valR*V[mid1].R + valA*N;\n\t\t\tll val2 = valL*V[mid2].L + valR*V[mid2].R + valA*N;\n\n\t\t\tchmin(ans,min(val1,val2));\n\n\t\t\tif(val1 > val2){\n\n\t\t\t\tL = mid1;\n\t\t\t}else{\n\n\t\t\t\tR = mid2;\n\t\t\t}\n\t\t\tpre1 = mid1;\n\t\t\tpre2 = mid2;\n\t\t}\n\n\t\tprintf(\"%lld\\n\",ans);\n\t}\n\n\treturn 0;\n}",
"accuracy": 0.7692307692307693,
"time_ms": 290,
"memory_kb": 12528,
"score_of_the_acc": -0.3667,
"final_rank": 10
},
{
"submission_id": "aoj_0762_7999515",
"code_snippet": "#include <bits/extc++.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) begin(x),end(x)\n#define Fixed fixed << setprecision(12)\n#define updiv(a, b) (((a) + (b) - 1) / (b))\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 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 T, class U> istream& operator>>(istream& is, pair<T, U>& p){ is >> p.first >> p.second; return (is); }\ntemplate<class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p){ os << p.first << ' ' << p.second; return (os); }\ntemplate<class T> istream& operator>>(istream& is, vector<T>& v){ for (auto &&e : v) is >> e; return (is); }\ntemplate<class T> ostream& operator<<(ostream& os, vector<T>& v){ for (auto &&e : v) os << e << ' '; return (os); }\n\ntemplate<class T> inline const T& max(const vector<T> &v) { return *max_element(v.begin(), v.end()); }\ntemplate<class T> inline const T& min(const vector<T> &v) { return *min_element(v.begin(), v.end()); }\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 max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T, vector<T>, greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A, B>;\ntemplate <class T> using uset = unordered_set<T>;\n\ntemplate <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;\ntemplate <class T> using Rope = __gnu_cxx::rope<T>;\nusing Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n\ntemplate <class T> void bye(T x){ cout << x << '\\n'; exit(0); }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1,0};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1,0};\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, q, m = 15;\n string s;\n cin >> n >> s >> q;\n\n assert(1 <= n && n <= 1000000);\n assert(s.size() == n);\n assert(all_of(all(s), [](char c) { return 'A' <= c && c <= 'O'; }));\n assert(1 <= q && q <= 150000);\n\n vector<int> v(n);\n vector<vector<int> > cnt(m, vector<int>(m));\n\n for (int i = 0; i < n; ++i) {\n v[i] = s[i] - 'A';\n }\n\n for (int i = 1; i < n; ++i) {\n cnt[v[i - 1]][v[i]]++;\n }\n\n vector<long long> sum(1 << m);\n\n for (int mask = 0; mask < 1 << m; ++mask) {\n for (int i = 0; i < m; ++i) {\n if (mask >> i & 1) {\n for (int j = 0; j < m; ++j) {\n if (~mask >> j & 1) {\n sum[mask] += cnt[i][j];\n }\n }\n }\n }\n }\n\n long long *minv = new long long[2 * m];\n\n for (int i = 0; i < 2 * m; ++i) minv[i] = LINF;\n\n minv = minv + m;\n\n for (int i = 0; i < m; ++i) {\n for (int j = 0; j < m; ++j) {\n vector<long long> dp(1 << m, LINF);\n dp[0] = 0;\n for (int mask = 0; mask < 1 << m; ++mask) {\n if (__builtin_popcount(mask) == i) {\n if (mask >> v[0] & 1) continue;\n int nxt = mask | 1 << v[0];\n chmin(dp[nxt], dp[mask] + sum[(1 << m) - 1 & ~nxt]);\n } else if (__builtin_popcount(mask) == j) {\n if (mask >> v[n - 1] & 1) continue;\n int nxt = mask | 1 << v[n - 1];\n chmin(dp[nxt], dp[mask] + sum[(1 << m) - 1 & ~nxt]);\n } else {\n for (int k = 0; k < m; ++k) {\n if (k == v[0] || k == v[n - 1]) continue;\n if (mask >> k & 1) continue;\n int nxt = mask | 1 << k;\n chmin(dp[nxt], dp[mask] + sum[(1 << m) - 1 & ~nxt]);\n }\n }\n }\n chmin(minv[j - i], dp.back());\n }\n }\n\n for (int i = 0; i < q; ++i) {\n long long a, l, r;\n cin >> a >> l >> r;\n\n assert(1 <= a && 100000000000);\n assert(1 <= l && 100000000000);\n assert(1 <= r && 100000000000);\n\n long long res = LINF;\n\n for (int j = -m + 1; j < m; ++j) {\n if (minv[j] == LINF) continue;\n chmin(res, minv[j] * l + (minv[j] + j) * r);\n }\n\n cout << res + a * n << '\\n';\n }\n\n return (0);\n}",
"accuracy": 1,
"time_ms": 350,
"memory_kb": 8556,
"score_of_the_acc": -0.5034,
"final_rank": 2
},
{
"submission_id": "aoj_0762_7999481",
"code_snippet": "#include <bits/extc++.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) begin(x),end(x)\n#define Fixed fixed << setprecision(12)\n#define updiv(a, b) (((a) + (b) - 1) / (b))\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 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 T, class U> istream& operator>>(istream& is, pair<T, U>& p){ is >> p.first >> p.second; return (is); }\ntemplate<class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p){ os << p.first << ' ' << p.second; return (os); }\ntemplate<class T> istream& operator>>(istream& is, vector<T>& v){ for (auto &&e : v) is >> e; return (is); }\ntemplate<class T> ostream& operator<<(ostream& os, vector<T>& v){ for (auto &&e : v) os << e << ' '; return (os); }\n\ntemplate<class T> inline const T& max(const vector<T> &v) { return *max_element(v.begin(), v.end()); }\ntemplate<class T> inline const T& min(const vector<T> &v) { return *min_element(v.begin(), v.end()); }\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 max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T, vector<T>, greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A, B>;\ntemplate <class T> using uset = unordered_set<T>;\n\ntemplate <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;\ntemplate <class T> using Rope = __gnu_cxx::rope<T>;\nusing Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n\ntemplate <class T> void bye(T x){ cout << x << '\\n'; exit(0); }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1,0};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1,0};\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, q, m = 15;\n string s;\n cin >> n >> s >> q;\n\n vector<int> v(n);\n vector<vector<int> > cnt(m, vector<int>(m));\n\n for (int i = 0; i < n; ++i) {\n v[i] = s[i] - 'A';\n }\n\n for (int i = 1; i < n; ++i) {\n cnt[v[i - 1]][v[i]]++;\n }\n\n vector<long long> sum(1 << m);\n\n for (int mask = 0; mask < 1 << m; ++mask) {\n for (int i = 0; i < m; ++i) {\n if (mask >> i & 1) {\n for (int j = 0; j < m; ++j) {\n if (~mask >> j & 1) {\n sum[mask] += cnt[i][j];\n }\n }\n }\n }\n }\n\n long long *minv = new long long[2 * m];\n\n for (int i = 0; i < 2 * m; ++i) minv[i] = LINF;\n\n minv = minv + m;\n\n for (int i = 0; i < m; ++i) {\n for (int j = 0; j < m; ++j) {\n vector<long long> dp(1 << m, LINF);\n dp[0] = 0;\n for (int mask = 0; mask < 1 << m; ++mask) {\n if (__builtin_popcount(mask) == i) {\n if (mask >> v[0] & 1) continue;\n int nxt = mask | 1 << v[0];\n chmin(dp[nxt], dp[mask] + sum[(1 << m) - 1 & ~nxt]);\n } else if (__builtin_popcount(mask) == j) {\n if (mask >> v[n - 1] & 1) continue;\n int nxt = mask | 1 << v[n - 1];\n chmin(dp[nxt], dp[mask] + sum[(1 << m) - 1 & ~nxt]);\n } else {\n for (int k = 0; k < m; ++k) {\n if (k == v[0] || k == v[n - 1]) continue;\n if (mask >> k & 1) continue;\n int nxt = mask | 1 << k;\n chmin(dp[nxt], dp[mask] + sum[(1 << m) - 1 & ~nxt]);\n }\n }\n }\n chmin(minv[j - i], dp.back());\n }\n }\n\n for (int i = 0; i < q; ++i) {\n long long a, l, r;\n cin >> a >> l >> r;\n\n long long res = LINF;\n\n for (int j = -m + 1; j < m; ++j) {\n if (minv[j] == LINF) continue;\n chmin(res, minv[j] * l + (minv[j] + j) * r);\n }\n\n cout << res + a * n << '\\n';\n }\n\n return (0);\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 8568,
"score_of_the_acc": -0.3924,
"final_rank": 1
},
{
"submission_id": "aoj_0762_7848677",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n ll n, A, L, R;\n int Q;\n string s;\n cin >> n >> s >> Q;\n vector<vector<ll>> B(15, vector<ll>(15)), dp(1 << 15, vector<ll>(512, INF));\n vector<pair<ll,ll>> C(1 << 15);\n for(int i = 0; i + 1 < n; i++){\n B[s[i] - 'A'][s[i + 1] - 'A']++;\n }\n for(int i = 0; i < (1 << 15); i++){\n R = 0, L = 0;\n for(int j = 0; j < 15; j++){\n for(int k = 0; k < 15; k++){\n if((i >> j & 1) ^ (i >> k & 1)){\n if(i >> j & 1) R += B[j][k];\n else L += B[j][k];\n }\n }\n }\n C[i] = make_pair(R, L);\n }\n dp[0][256] = 0;\n for(int i = 0; i < (1 << 15); i++){\n for(int j = 0; j < 512; j++){\n if(dp[i][j] == INF)continue;\n for(int k = 0; k < 15; k++){\n if(i >> k & 1)continue;\n tie(R, L) = C[i | (1 << k)];\n dp[i | (1 << k)][j + R - L] = min(dp[i | (1 << k)][j + R - L], dp[i][j] + L + R);\n }\n }\n }\n while(Q--){\n cin >> A >> L >> R;\n ll ans = 1ll << 60;\n for(int i = 0; i < 512; i++){\n if(dp.back()[i] == INF)continue;\n ll l, r, d = i - 256;\n r = (dp.back()[i] + d) / 2;\n l = (dp.back()[i] - d) / 2;\n ans = min(ans, A * n + R * r + L * l);\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 136912,
"score_of_the_acc": -1,
"final_rank": 8
}
] |
aoj_0749_cpp
|
塗りつぶし (Painting)
問題文
JOI くんはお絵かきソフトで遊んでいる．
お絵かきソフトでは，縦
H
行，横
W
列の長方形のマス目に絵を描くことができる．それぞれのマスには色が定められており，色は
1
以上
10
9
以下の整数で表される．
上から
i
行目 (
1 ≦ i ≦ H
)，左から
j
列目 (
1 ≦ j ≦ W
) のマスをマス
(i,j)
と呼ぶ．現在，マス
(i,j)
の色は
A
i,j
である．
マス
(i,j)
から辺で接しているマスへの移動を繰り返し，マス
(i,j)
と色が異なるマスに入ることなく移動できるマスの集まりを，ここでは
マス
(i,j)
の領域
と呼ぶ．
お絵かきソフトには，
塗りつぶし
という機能がある．この機能では，あるマス
(x,y)
(
1 ≦ x ≦ H
，
1 ≦ y ≦ W
) と色
c
(
1 ≦ c ≦ 10
9
) を指定すると，マス
(x,y)
の領域に含まれるマスの色がすべて
c
に変化する．
JOI くんはあるマス
(x,y)
と色
c
を選び，そのマスと色を指定して塗りつぶしをちょうど
1
回使う．塗りつぶしを使った後のマス
(x,y)
の領域に含まれるマスの個数が JOI くんの得点となる．
JOI くんの得点として達成可能な最大値を求めるプログラムを作成せよ．
制約
1 ≦ H ≦ 500
．
1 ≦ W ≦ 500
．
1 ≦ A
i,j
≦ 10
9
(
1 ≦ i ≦ H
，
1 ≦ j ≦ W
)．
入力される値はすべて整数である．
入力
入力は以下の形式で与えられる．
H
W
A
1,1
A
1,2
…
A
1,W
A
2,1
A
2,2
…
A
2,W
:
A
H,1
A
H,2
…
A
H,W
出力
JOI くんの得点として達成可能な最大値を
1
行に出力せよ．
入出力例
入力例 1
4 4
1 2 3 1
2 2 3 1
1 2 3 1
3 3 2 2
出力例 1
9
最初の時点で，マス
(2,2)
の領域に含まれるマスはマス
(1,2), (2,1), (2,2), (3,2)
の
4
個である．そのため，マス
(2,2)
と色
3
を指定して塗りつぶしを使うと，下図のように，これらの
4
マスの色が
3
に変化する．
塗りつぶしを使った後，マス
(2,2)
の領域に含まれるマスはマス
(1,2), (1,3), (2,1), (2,2), (2,3), (3,2), (3,3), (4,1), (4,2)
の
9
個になる．よって，JOI くんの得点は
9
となる．
JOI くんの得点を
10
以上にすることはできないので，
9
を出力する．
入力例 2
2 10
1 2 2 1 3 3 3 3 1 1
1 1 1 1 1 1 1 3 3 3
出力例 2
18
入力例 3
5 5
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
出力例 3
25
情報オリンピック日本委員会
作 『第 22 回日本情報オリンピック JOI 2022/2023 二次予選競技課題』
|
[
{
"submission_id": "aoj_0749_9662779",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\nint main(){\n int h,w;cin>>h>>w;\n vector<vector<ll>>a(h,vector<ll>(w));\n REP(i,h)REP(j,w)cin>>a[i][j];\n vector<vector<int>>idx(h,vector<int>(w,-1));\n int cnt=0;\n REP(i,h)REP(j,w)if(idx[i][j]==-1){\n idx[i][j]=cnt;\n using pi=pair<int,int>;\n queue<pi>Q;\n Q.emplace(pi(i,j));\n while(!Q.empty()){\n auto p=Q.front();Q.pop();\n if(p.first&&a[p.first-1][p.second]==a[p.first][p.second]&&idx[p.first-1][p.second]==-1){\n idx[p.first-1][p.second]=cnt;\n Q.emplace(pi(p.first-1,p.second));\n }\n if(p.second&&a[p.first][p.second-1]==a[p.first][p.second]&&idx[p.first][p.second-1]==-1){\n idx[p.first][p.second-1]=cnt;\n Q.emplace(pi(p.first,p.second-1));\n }\n if(p.first+1<h&&a[p.first+1][p.second]==a[p.first][p.second]&&idx[p.first+1][p.second]==-1){\n idx[p.first+1][p.second]=cnt;\n Q.emplace(pi(p.first+1,p.second));\n }\n if(p.second+1<w&&a[p.first][p.second+1]==a[p.first][p.second]&&idx[p.first][p.second+1]==-1){\n idx[p.first][p.second+1]=cnt;\n Q.emplace(pi(p.first,p.second+1));\n }\n }\n cnt++;\n }\n vector<int>size(cnt),color(cnt);\n REP(i,h)REP(j,w)size[idx[i][j]]++,color[idx[i][j]]=a[i][j];\n vector<vector<int>>E(cnt);\n REP(i,h)REP(j,w){\n if(i&&idx[i-1][j]!=idx[i][j]){\n E[idx[i][j]].emplace_back(idx[i-1][j]);\n E[idx[i-1][j]].emplace_back(idx[i][j]);\n }\n if(j&&idx[i][j-1]!=idx[i][j]){\n E[idx[i][j]].emplace_back(idx[i][j-1]);\n E[idx[i][j-1]].emplace_back(idx[i][j]);\n }\n }\n int ans=0;\n REP(i,cnt){\n sort(E[i].begin(),E[i].end());\n E[i].erase(unique(E[i].begin(),E[i].end()),E[i].end());\n map<int,int>memo;\n for(auto j:E[i])memo[color[j]]+=size[j];\n ans=max(ans,size[i]);\n for(auto[k,v]:memo)ans=max(ans,size[i]+v);\n }\n cout<<ans<<endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 21720,
"score_of_the_acc": -0.0663,
"final_rank": 5
},
{
"submission_id": "aoj_0749_9463065",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 505*505\n\nint N;\nint boss[SIZE],height[SIZE],num_member[SIZE];\n\nint H,W;\nint A[505][505];\nint d_row[4] = {-1,0,0,1},d_col[4] = {0,-1,1,0};\nint value[SIZE];\nvector<int> V[SIZE];\n\nbool rangeCheck(int row,int col){\n\n\treturn row >= 0 && row <= H-1 && col >= 0 && col <= W-1;\n}\n\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 isSame(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[boss_x] > height[boss_y]){\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tnum_member[boss_y] += num_member[boss_x];\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\nint getIndex(int row,int col){\n\n\treturn row*W + col;\n}\n\nint main(){\n\n\tscanf(\"%d %d\",&H,&W);\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tscanf(\"%d\",&A[row][col]);\n\t\t}\n\t}\n\n\tN = H*W;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t\tnum_member[i] = 1;\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tint from = getIndex(row,col);\n\n\t\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\t\tint adj_row = row+d_row[i];\n\t\t\t\tint adj_col = col+d_col[i];\n\t\t\t\tif(!rangeCheck(adj_row,adj_col)||A[row][col] != A[adj_row][adj_col])continue;\n\n\t\t\t\tint to = getIndex(adj_row,adj_col);\n\n\t\t\t\tunite(from,to);\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tint from = getIndex(row,col);\n\n\t\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\t\tint adj_row = row+d_row[i];\n\t\t\t\tint adj_col = col+d_col[i];\n\t\t\t\tif(!rangeCheck(adj_row,adj_col))continue;\n\n\t\t\t\tint to = getIndex(adj_row,adj_col);\n\n\t\t\t\t//辺で接するグループの組合せを記録しておく\n\t\t\t\tif(A[row][col] != A[adj_row][adj_col]){\n\n\t\t\t\t\tV[get_boss(from)].push_back(get_boss(to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = 0;\n\n\tvector<int> vec;\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(i != get_boss(i))continue;\n\n\t\tvec.push_back(i);\n\n\t\tchmax(ans,num_member[i]);\n\t\tint tmp_row = i/W;\n\t\tint tmp_col = i%W;\n\t\tvalue[i] = A[tmp_row][tmp_col]; //そのグループの数字\n\n\t\tif(V[i].size() == 0)continue;\n\n\t\tsort(V[i].begin(),V[i].end());\n\t\tV[i].erase(unique(V[i].begin(),V[i].end()),V[i].end());\n\t}\n\n\tfor(int i = 0; i < vec.size(); i++){\n\n\t\t//隣接するグループの数字ごとに、総和を集計する\n\t\tmap<int,int> MAP;\n\t\tfor(int k = 0; k < V[vec[i]].size(); k++){\n\n\t\t\tMAP[value[V[vec[i]][k]]] += num_member[V[vec[i]][k]];\n\t\t}\n\n\t\tfor(auto at = MAP.begin(); at != MAP.end(); at++){\n\n\t\t\tint work = num_member[vec[i]] + at->second;\n\t\t\tchmax(ans,work);\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 25204,
"score_of_the_acc": -0.0421,
"final_rank": 4
},
{
"submission_id": "aoj_0749_9072200",
"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 dx[] = {1, 0, -1, 0};\nint dy[] = {0, 1, 0, -1};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int h, w;\n cin >> h >> w;\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 vector<vector<int>> idx(h, vector<int>(w, -1));\n vector<int> cnt(h * w);\n queue<pair<int, int>> q;\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n if (idx[i][j] == -1) {\n q.push({i, j});\n idx[i][j] = i * w + j;\n }\n while (q.size()) {\n auto p = q.front();\n q.pop();\n int x = p.first, y = p.second;\n cnt[idx[x][y]] += 1;\n for (int k = 0; k < 4; ++k) {\n int nx = x + dx[k];\n int ny = y + dy[k];\n if (0 <= nx and nx < h and 0 <= ny and ny < w and a[nx][ny] == a[x][y] and idx[nx][ny] == -1) {\n idx[nx][ny] = idx[x][y];\n q.push({nx, ny});\n }\n }\n }\n }\n }\n \n int res = 0;\n vector<vector<bool>> used(h, vector<bool>(w));\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n if (used[i][j]) continue;\n map<int, int> mp;\n set<int> st;\n q.push({i, j});\n used[i][j] = true;\n while (q.size()) {\n auto p = q.front();\n q.pop();\n int x = p.first, y = p.second;\n for (int k = 0; k < 4; ++k) {\n int nx = x + dx[k];\n int ny = y + dy[k];\n if (0 <= nx and nx < h and 0 <= ny and ny < w) {\n if (a[nx][ny] != a[x][y]) {\n int id = idx[nx][ny];\n int col = a[nx][ny];\n if (st.find(id) == st.end()) {\n st.insert(id);\n mp[col] += cnt[id];\n }\n } else if (!used[nx][ny]) {\n used[nx][ny] = true;\n q.push({nx, ny});\n }\n }\n }\n }\n res = max(res, cnt[idx[i][j]]);\n for (auto p : mp) {\n res = max(res, p.second + cnt[idx[i][j]]);\n }\n }\n }\n cout << res << endl;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 17776,
"score_of_the_acc": -0.033,
"final_rank": 1
},
{
"submission_id": "aoj_0749_9043378",
"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 if (x < 0) { cout << (i64)(x); }\n else { cout << (u64)(x); }\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer(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()) {break;}\n return 0;\n}\n\nint solve() {\n ll H, W;\n cin >> H >> W;\n vv(ll, A, H, W);\n rep(i, H) rep(j, W) cin >> A[i][j];\n ll ans = 0;\n UnionFind uf(H*W);\n auto conv = [&](ll y, ll x) -> ll {\n return y*W + x;\n };\n vv(bool, visited, H, W, false);\n map<ll, vc<pi>> PP;\n map<ll, map<ll,ll>> PC;\n static vi dy{-1, 1, 0, 0};\n static vi dx{ 0, 0,-1, 1};\n rep(i, H) rep(j, W) {\n if (visited[i][j]) continue;\n ll c = A[i][j];\n ll rt = conv(i, j);\n queue<pi> Q;\n Q.emplace(mp(i, j));\n visited[i][j] = true;\n while (!Q.empty()) {\n auto [y, x] = POP(Q);\n rep(k, len(dy)) {\n ll ny = y + dy[k];\n ll nx = x + dx[k];\n if ((0 <= ny) and (ny < H) and (0 <= nx) and (nx < W)) {\n if (visited[ny][nx]) continue;\n if (A[ny][nx] != c) continue;\n visited[ny][nx] = true;\n uf.merge(rt, conv(ny,nx));\n if (!PP.count(uf[rt])) PP[uf[rt]].eb(mp(i, j));\n PP[uf[rt]].eb(mp(ny, nx));\n Q.emplace(mp(ny, nx));\n }\n }\n }\n if (!PP.count(uf[rt])) PP[uf[rt]].eb(mp(i, j));\n chmax(ans, len(PP[uf[rt]]));\n }\n for (auto [id, v]: PP) {\n ll c = A[v[0].fi][v[0].se];\n set<ll> added;\n for (auto [i, j]: v) {\n rep(kk, len(dy)) {\n ll ny = i + dy[kk];\n ll nx = j + dx[kk];\n if ((0 <= ny) and (ny < H) and (0 <= nx) and (nx < W)) {\n if (A[ny][nx] == c) continue;\n ll id2 = uf[conv(ny, nx)];\n if (added.count(id2)) continue;\n PC[id][A[ny][nx]] += len(PP[id2]);\n added.insert(id2);\n }\n }\n }\n }\n set<pi> checked;\n set<ll> checked_g;\n rep(i, H) rep(j, W) {\n ll idrt = uf[conv(i, j)];\n if (checked_g.count(idrt)) continue;\n checked_g.insert(idrt);\n ll c = A[i][j];\n rep(k, len(dy)) {\n ll ny = i + dy[k];\n ll nx = j + dx[k];\n if ((0 <= ny) and (ny < H) and (0 <= nx) and (nx < W)) {\n ll id = uf[conv(ny, nx)];\n if (c == A[ny][nx]) continue;\n if (checked.count(mp(id, c))) continue;\n checked.insert(mp(id, c));\n ll counter = len(PP[id]) + PC[id][c];\n chmax(ans, counter);\n }\n }\n }\n print(ans);\n return 0;\n}",
"accuracy": 1,
"time_ms": 980,
"memory_kb": 194336,
"score_of_the_acc": -2,
"final_rank": 14
},
{
"submission_id": "aoj_0749_8746382",
"code_snippet": "#line 1 \"a.cpp\"\n#define PROBLEM \"\"\n#line 2 \"/home/kuhaku/home/github/algo/lib/algorithm/compress.hpp\"\n#include <algorithm>\n#include <iterator>\n#include <vector>\n\n/**\n * @brief 座標圧縮\n *\n * @tparam T 要素の型\n */\ntemplate <class T>\nstruct coordinate_compression {\n coordinate_compression() = default;\n coordinate_compression(const std::vector<T> &_data) : data(_data) { build(); }\n\n const T &operator[](int i) const { return data[i]; }\n T &operator[](int i) { return data[i]; }\n\n void add(T x) { data.emplace_back(x); }\n\n void build() {\n std::sort(std::begin(data), std::end(data));\n data.erase(std::unique(std::begin(data), std::end(data)), std::end(data));\n }\n\n bool exists(T x) const {\n auto it = std::lower_bound(std::begin(data), std::end(data), x);\n return it != std::end(data) && *it == x;\n }\n\n int get(T x) const {\n auto it = std::lower_bound(std::begin(data), std::end(data), x);\n return std::distance(std::begin(data), it);\n }\n\n int size() const { return std::size(data); }\n\n private:\n std::vector<T> data;\n};\n\n/**\n * @brief 座標圧縮\n *\n * @tparam T 要素の型\n * @param v 配列\n * @return std::vector<T>\n */\ntemplate <class T>\nstd::vector<T> compress(const std::vector<T> &v) {\n coordinate_compression cps(v);\n std::vector<T> res;\n res.reserve(std::size(v));\n for (auto &&x : v) res.emplace_back(cps.get(x));\n return res;\n}\n#line 2 \"/home/kuhaku/home/github/algo/lib/template/template.hpp\"\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = M_PI;\n#line 3 \"/home/kuhaku/home/github/algo/lib/template/macro.hpp\"\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\n#line 3 \"/home/kuhaku/home/github/algo/lib/template/sonic.hpp\"\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n\n constexpr void operator()() const {}\n} sonic;\n#line 5 \"/home/kuhaku/home/github/algo/lib/template/atcoder.hpp\"\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) {\n os << (it == v.begin() ? \"\" : \" \") << *it;\n }\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\ntemplate <typename T, typename... Args>\nauto make_vector(T x, int arg, Args... args) {\n if constexpr (sizeof...(args) == 0) return std::vector<T>(arg, x);\n else return std::vector(arg, make_vector<T>(x, args...));\n}\nvoid Yes(bool is_correct = true) {\n std::cout << (is_correct ? \"Yes\" : \"No\") << '\\n';\n}\nvoid No(bool is_not_correct = true) {\n Yes(!is_not_correct);\n}\nvoid YES(bool is_correct = true) {\n std::cout << (is_correct ? \"YES\" : \"NO\") << '\\n';\n}\nvoid NO(bool is_not_correct = true) {\n YES(!is_not_correct);\n}\nvoid Takahashi(bool is_correct = true) {\n std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n';\n}\nvoid Aoki(bool is_not_correct = true) {\n Takahashi(!is_not_correct);\n}\n#line 3 \"/home/kuhaku/home/github/algo/lib/tree/union_find.hpp\"\n\n/**\n * @brief 素集合データ構造\n * @details Implement (union by size) + (path compression)\n * @see https://github.com/atcoder/ac-library/blob/master/atcoder/dsu.hpp\n */\nstruct union_find {\n union_find() = default;\n explicit union_find(int _n) : data(_n, -1) {}\n\n int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }\n int get_root(int x) { return root(x); }\n\n bool is_root(int x) const { return data[x] < 0; }\n\n bool same(int x, int y) { return root(x) == root(y); }\n bool is_same(int x, int y) { return same(x, y); }\n\n int size(int x) { return -(data[root(x)]); }\n int get_size(int x) { return size(x); }\n\n std::vector<int> leaders() {\n std::vector<int> res;\n for (int i = 0; i < (int)data.size(); ++i) {\n if (is_root(i)) res.emplace_back(i);\n }\n return res;\n }\n\n bool unite(int x, int y) {\n x = root(x), y = root(y);\n if (x == y) return false;\n if (data[x] > data[y]) std::swap(x, y);\n data[x] += data[y];\n data[y] = x;\n return true;\n }\n\n template <class F>\n bool unite(int x, int y, F f) {\n x = root(x), y = root(y);\n if (x != y) {\n if (data[x] > data[y]) std::swap(x, y);\n data[x] += data[y];\n data[y] = x;\n }\n f(x, y);\n return x != y;\n }\n\n private:\n std::vector<int> data;\n};\n#line 5 \"a.cpp\"\n\nint main(void) {\n int h, w;\n cin >> h >> w;\n vector a(h, vector(w, 0));\n cin >> a;\n\n auto in_field = [&](int x, int y) {\n return 0 <= x && x < h && 0 <= y && y < w;\n };\n\n union_find uf(h * w);\n vector<int> dx = {1, 0}, dy = {0, 1};\n rep (x, h) {\n rep (y, w) {\n rep (k, 2) {\n int nx = x + dx[k], ny = y + dy[k];\n if (!in_field(nx, ny))\n continue;\n if (a[x][y] == a[nx][ny])\n uf.unite(x * w + y, nx * w + ny);\n }\n }\n }\n\n auto ls = uf.leaders();\n vector<int> cs(ls.size()), ss(ls.size());\n rep (i, ls.size()) {\n int x = ls[i] / w;\n int y = ls[i] % w;\n cs[i] = a[x][y];\n ss[i] = uf.size(ls[i]);\n }\n coordinate_compression cps(ls);\n vector<set<int>> v(ls.size());\n rep (x, h) {\n rep (y, w) {\n rep (k, 2) {\n int nx = x + dx[k], ny = y + dy[k];\n if (!in_field(nx, ny))\n continue;\n if (a[x][y] != a[nx][ny]) {\n int l = cps.get(uf.root(x * w + y));\n int r = cps.get(uf.root(nx * w + ny));\n v[l].emplace(r);\n v[r].emplace(l);\n }\n }\n }\n }\n\n vector<unordered_map<int, int>> mp(ls.size());\n rep (i, ls.size()) {\n for (int e : v[i]) {\n mp[i][cs[e]] += ss[e];\n }\n }\n\n int ans = *max_element(all(ss));\n rep (i, ls.size()) {\n for (auto [x, y] : mp[i]) {\n chmax(ans, ss[i] + y);\n }\n }\n co(ans);\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 127948,
"score_of_the_acc": -0.7668,
"final_rank": 13
},
{
"submission_id": "aoj_0749_8445348",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define all(A) A.begin(),A.end()\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\n\nvll dx = { -1,0,1,0 };\nvll dy = { 0,1,0,-1 };\nint main() {\n ll H, W;\n cin >> H >> W;\n vvll A(H, vll(W));\n rep(h, H)rep(w, W)cin >> A[h][w];\n vvll B(H, vll(W, -1));\n ll c = 0;\n vll CN;\n vll CL;\n rep(h, H)rep(w, W) {\n if (B[h][w] != -1)continue;\n queue<pair<ll, ll>> Q;\n Q.push({ h,w });\n ll cnt = 0;\n while (!Q.empty()) {\n ll y = Q.front().first;\n ll x = Q.front().second;\n Q.pop();\n if (B[y][x] != -1)continue;\n B[y][x] = c;\n cnt++;\n rep(d, 4) {\n ll ny = y + dy[d];\n ll nx = x + dx[d];\n if (ny < 0 || nx < 0 || ny >= H || nx >= W)continue;\n if (B[ny][nx] != -1)continue;\n if (A[ny][nx] != A[y][x])continue;\n Q.push({ ny,nx });\n }\n }\n c++;\n CN.push_back(cnt);\n CL.push_back(A[h][w]);\n }\n vector<set<ll>> S(c);\n rep(h, H)rep(w, W - 1) {\n if (B[h][w] != B[h][w + 1]) {\n S[B[h][w]].insert(B[h][w + 1]);\n S[B[h][w + 1]].insert(B[h][w]);\n }\n }\n rep(h, H - 1)rep(w, W) {\n if (B[h][w] != B[h + 1][w]) {\n S[B[h][w]].insert(B[h + 1][w]);\n S[B[h + 1][w]].insert(B[h][w]);\n }\n }\n ll an = 0;\n rep(i, c) {\n map<ll, ll> cl;\n ll res = 0;\n for (auto s : S[i]) {\n cl[CL[s]] += CN[s];\n res = max(res, cl[CL[s]]);\n }\n an = max(an, res + CN[i]);\n }\n cout << an << endl;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 69564,
"score_of_the_acc": -0.4032,
"final_rank": 11
},
{
"submission_id": "aoj_0749_8378417",
"code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0749.cc: 塗りつぶし (Painting)\n */\n\n#include<cstdio>\n#include<set>\n#include<map>\n#include<queue>\n#include<algorithm>\n#include<utility>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_H = 500;\nconst int MAX_W = 500;\nconst int MAX_N = MAX_H * MAX_W;\nconst int dxs[] = { 1, 0, -1, 0 }, dys[] = { 0, -1, 0, 1 };\n\n/* typedef */\n\ntypedef set<int> si;\ntypedef pair<int,int> pii;\ntypedef queue<pii> qpii;\ntypedef map<int,int> mii;\n\n/* global variables */\n\nint as[MAX_H][MAX_W], gs[MAX_H][MAX_W];\nint gas[MAX_N], gcs[MAX_N];\nsi nbrs[MAX_N];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int h, w;\n scanf(\"%d%d\", &h, &w);\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++) scanf(\"%d\", as[i] + j);\n\n for (int i = 0; i < h; i++) fill(gs[i], gs[i] + w, -1);\n\n int gn = 0;\n \n for (int y = 0; y < h; y++)\n for (int x = 0; x < w; x++)\n if (gs[y][x] < 0) {\n\tint g = gs[y][x] = gn++;\n\tint a = gas[g] = as[y][x];\n\tgcs[g]++;\n\n\tqpii q;\n\tq.push(pii(y, x));\n\n\twhile (! q.empty()) {\n\t auto u = q.front(); q.pop();\n\t int uy = u.first, ux = u.second;\n\n\t for (int di = 0; di < 4; di++) {\n\t int vy = uy + dys[di], vx = ux + dxs[di];\n\t if (vy >= 0 && vy < h && vx >= 0 && vx < w &&\n\t\tgs[vy][vx] < 0 && as[vy][vx] == a) {\n\t gs[vy][vx] = g;\n\t gcs[g]++;\n\t q.push(pii(vy, vx));\n\t }\n\t }\n\t}\n }\n\n for (int y = 0; y < h; y++)\n for (int x = 0; x < w; x++) {\n int g0 = gs[y][x], g1;\n if (y + 1 < h && (g1 = gs[y + 1][x]) != g0) {\n\tnbrs[g0].insert(g1);\n\tnbrs[g1].insert(g0);\n }\n if (x + 1 < w && (g1 = gs[y][x + 1]) != g0) {\n\tnbrs[g0].insert(g1);\n\tnbrs[g1].insert(g0);\n }\n }\n\n int maxs = 0;\n for (int i = 0; i < gn; i++) {\n mii acs;\n for (auto v: nbrs[i]) acs[gas[v]] += gcs[v];\n int maxc = 0;\n for (auto ac: acs) maxc = max(maxc, ac.second);\n maxs = max(maxs, gcs[i] + maxc);\n }\n\n printf(\"%d\\n\", maxs);\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 65416,
"score_of_the_acc": -0.3248,
"final_rank": 9
},
{
"submission_id": "aoj_0749_8196265",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <string>\n#include <fstream>\n#include <vector>\n#include <math.h>\n#include <stdio.h>\n#include <algorithm>\n#include <sstream>\n#include <tuple>\n#include <unordered_map>\n#include <queue>\n#include <complex>\n#include <iomanip>\n#include <set>\n#include <unordered_set>\nusing namespace std;\ntypedef long long ll;\n\nint r, c;\nint tmp = 0;\nconst int S = 250001;\n\nint* cellcolor;\nint* visited;\nvector<int> groups;\nint* number_cell_group;\nvector<int> nexts[S];\n\nvoid dfs(int a, int prev, int g)\n{\n if (cellcolor[a] != prev)\n {\n nexts[g].emplace_back(a);\n return;\n }\n if (visited[a] != -1)\n return;\n\n int col = cellcolor[a];\n visited[a] = g;\n tmp++;\n int y = a / c;\n int x = a % c;\n if (x + 1 < c)\n dfs(a + 1, col, g);\n if (x - 1 >= 0)\n dfs(a - 1, col, g);\n if (y + 1 < r)\n dfs(a + c, col, g);\n if (0 <= y - 1)\n dfs(a - c, col, g);\n}\n\nint main(void)\n{\n ifstream input;\n input.open(\"input.txt\");\n std::ifstream in;\n if (input)\n {\n input.close();\n in = std::ifstream(\"input.txt\");\n std::cin.rdbuf(in.rdbuf());\n }\n cin >> r >> c;\n int N = r * c;\n\n cellcolor = new int[N];\n visited = new int[N];\n number_cell_group = new int[N];\n\n for (int i = 0; i < N; i++)\n {\n cin >> cellcolor[i];\n visited[i] = -1;\n number_cell_group[i] = -1;\n }\n\n for (int i = 0; i < N; i++)\n {\n tmp = 0;\n if (visited[i] != -1)\n continue;\n dfs(i, cellcolor[i], i);\n number_cell_group[i] = tmp;\n groups.emplace_back(i);\n }\n\n int maximum = 0;\n for (auto g : groups)\n {\n unordered_set<int> gnext;\n for (auto ne : nexts[g])\n gnext.insert(visited[ne]);\n maximum = max(number_cell_group[g], maximum);\n unordered_map<int, int> nextmap;\n for (auto ng : gnext)\n nextmap[cellcolor[ng]] += number_cell_group[ng];\n\n for (auto z : nextmap)\n {\n auto temp = z.second + number_cell_group[g];\n maximum = max(temp, maximum);\n }\n }\n cout << maximum << endl;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 36568,
"score_of_the_acc": -0.2053,
"final_rank": 7
},
{
"submission_id": "aoj_0749_8174283",
"code_snippet": "#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(v) v.begin(),v.end()\ntypedef long long ll;\n \n#include<bits/stdc++.h>\nusing namespace std;\n\nclass Dis{\n public:\n vector<ll> rank,p,siz;\n \n Dis(int s){\n rank.resize(s,0);\n p.resize(s,0);\n siz.resize(s,1);\n rep(i,s) makeSet(i);\n }\n \n void makeSet(int x){\n p[x]=x;\n rank[x]=0;\n }\n \n bool same(int x,int y){\n return root(x)==root(y);\n }\n \n void unite(int x,int y){\n if(same(x,y)) return;\n link(root(x),root(y));\n }\n \n void link(int x,int y){\n if(rank[x]>rank[y]){\n p[y]=x;\n siz[x]+=siz[y];\n }\n else{\n p[x]=y;\n siz[y]+=siz[x];\n if(rank[x]==rank[y]) rank[y]++;\n }\n }\n \n int root(int x){\n if(x != p[x]) p[x]=root(p[x]);\n return p[x];\n }\n \n int size(int x){\n return siz[root(x)];\n }\n};\n\nint A[510][510];\nset<int> G[252525];\n \nint main(){\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n \n int h,w;\n cin>>h>>w;\n rep(i,h) rep(j,w) cin>>A[i][j];\n Dis ds=Dis(h*w);\n \n rep(i,h) rep(j,w){\n if(i<h-1 && A[i][j]==A[i+1][j]) ds.unite(i*w+j,(i+1)*w+j);\n if(j<w-1 && A[i][j]==A[i][j+1]) ds.unite(i*w+j,i*w+j+1);\n }\n \n rep(i,h) rep(j,w){\n if(i<h-1 && ds.root(i*w+j)!=ds.root((i+1)*w+j)){\n G[ds.root(i*w+j)].insert(ds.root((i+1)*w+j));\n G[ds.root((i+1)*w+j)].insert(ds.root(i*w+j));\n }\n if(j<w-1 && ds.root(i*w+j)!=ds.root(i*w+j+1)){\n G[ds.root(i*w+j)].insert(ds.root(i*w+j+1));\n G[ds.root(i*w+j+1)].insert(ds.root(i*w+j));\n }\n }\n \n int ans=0;\n rep(i,h) rep(j,w){\n if(ds.root(i*w+j)!=i*w+j) continue;\n map<int,int> m;\n for(auto nv:G[ds.root(i*w+j)]){\n int ni=nv/w,nj=nv%w;\n m[A[ni][nj]]+=ds.size(nv);\n }\n int tmp=0;\n for(auto [a,b]:m) tmp=max(tmp,b);\n ans=max(ans,tmp+ds.size(i*w+j));\n }\n cout<<ans<<endl;\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 68480,
"score_of_the_acc": -0.3421,
"final_rank": 10
},
{
"submission_id": "aoj_0749_8158366",
"code_snippet": "#include <algorithm>\n#include <cassert>\n#include <vector>\n\nnamespace atcoder {\n\n// Implement (union by size) + (path compression)\n// Reference:\n// Zvi Galil and Giuseppe F. Italiano,\n// Data structures and algorithms for disjoint set union problems\nstruct dsu {\n public:\n dsu() : _n(0) {}\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\n\n int merge(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\n parent_or_size[x] += parent_or_size[y];\n parent_or_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n assert(0 <= a && a < _n);\n if (parent_or_size[a] < 0) return a;\n return parent_or_size[a] = leader(parent_or_size[a]);\n }\n\n int size(int a) {\n assert(0 <= a && a < _n);\n return -parent_or_size[leader(a)];\n }\n\n std::vector<std::vector<int>> groups() {\n std::vector<int> leader_buf(_n), group_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n group_size[leader_buf[i]]++;\n }\n std::vector<std::vector<int>> result(_n);\n for (int i = 0; i < _n; i++) {\n result[i].reserve(group_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n result[leader_buf[i]].push_back(i);\n }\n result.erase(\n std::remove_if(result.begin(), result.end(),\n [&](const std::vector<int>& v) { return v.empty(); }),\n result.end());\n return result;\n }\n\n private:\n int _n;\n // root node: -1 * component size\n // otherwise: parent\n std::vector<int> parent_or_size;\n};\n\n} // namespace atcoder\n\n\n#include <bits/stdc++.h>\n// <atcoder/dsu>\nusing namespace std;\n\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\n\nint main() {\n int h, w;\n cin >> h >> w;\n vector<vector<int>> a(h, vector<int>(w));\n for (int i = 0; i < h; i++) for (int j = 0; j < w; j++) cin >> a[i][j];\n atcoder::dsu uf(h * w);\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 int x = i + dx[k], y = j + dy[k];\n if (0 <= x and x < h and 0 <= y and y < w and a[i][j] == a[x][y])\n uf.merge(i * w + j, x * w + y);\n }\n }\n }\n int ans = 0;\n auto g = uf.groups();\n map<int, int> l;\n for (auto s: g) l[uf.leader(s[0])] = s.size();\n for (auto s: g) {\n map<int, set<int>> m;\n for (auto p: s){\n int i = p / w, j = p % w;\n for (int k = 0; k < 4; k++){\n int x = i + dx[k], y = j + dy[k];\n if (0 <= x and x < h and 0 <= y and y < w and a[i][j] != a[x][y])\n m[a[x][y]].insert(uf.leader(x * w + y));\n }\n }\n map<int, int> m2;\n for (auto p: m) for (int i: p.second) m2[p.first] += uf.size(i);\n int d = 0;\n for (auto p: m2) d = max(d, p.second);\n ans = max(ans, (int)s.size() + d);\n }\n cout << ans << '\\n';\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 44848,
"score_of_the_acc": -0.3182,
"final_rank": 8
},
{
"submission_id": "aoj_0749_7912164",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 505*505\n\nint N;\nint boss[SIZE],height[SIZE],num_member[SIZE];\n\nint H,W;\nint A[505][505];\nint d_row[4] = {-1,0,0,1},d_col[4] = {0,-1,1,0};\nint value[SIZE];\nvector<int> V[SIZE];\n\nbool rangeCheck(int row,int col){\n\n\treturn row >= 0 && row <= H-1 && col >= 0 && col <= W-1;\n}\n\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 isSame(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[boss_x] > height[boss_y]){\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tnum_member[boss_y] += num_member[boss_x];\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\nint getIndex(int row,int col){\n\n\treturn row*W + col;\n}\n\nint main(){\n\n\tscanf(\"%d %d\",&H,&W);\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tscanf(\"%d\",&A[row][col]);\n\t\t}\n\t}\n\n\tN = H*W;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t\tnum_member[i] = 1;\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tint from = getIndex(row,col);\n\n\t\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\t\tint adj_row = row+d_row[i];\n\t\t\t\tint adj_col = col+d_col[i];\n\t\t\t\tif(!rangeCheck(adj_row,adj_col)||A[row][col] != A[adj_row][adj_col])continue;\n\n\t\t\t\tint to = getIndex(adj_row,adj_col);\n\n\t\t\t\tunite(from,to);\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tint from = getIndex(row,col);\n\n\t\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\t\tint adj_row = row+d_row[i];\n\t\t\t\tint adj_col = col+d_col[i];\n\t\t\t\tif(!rangeCheck(adj_row,adj_col))continue;\n\n\t\t\t\tint to = getIndex(adj_row,adj_col);\n\n\t\t\t\t//辺で接するグループの組合せを記録しておく\n\t\t\t\tif(A[row][col] != A[adj_row][adj_col]){\n\n\t\t\t\t\tV[get_boss(from)].push_back(get_boss(to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = 0;\n\n\tvector<int> vec;\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(i != get_boss(i))continue;\n\n\t\tvec.push_back(i);\n\n\t\tchmax(ans,num_member[i]);\n\t\tint tmp_row = i/W;\n\t\tint tmp_col = i%W;\n\t\tvalue[i] = A[tmp_row][tmp_col]; //そのグループの数字\n\n\t\tif(V[i].size() == 0)continue;\n\n\t\tsort(V[i].begin(),V[i].end());\n\t\tV[i].erase(unique(V[i].begin(),V[i].end()),V[i].end());\n\t}\n\n\tfor(int i = 0; i < vec.size(); i++){\n\n\t\t//隣接するグループの数字ごとに、総和を集計する\n\t\tmap<int,int> MAP;\n\t\tfor(int k = 0; k < V[vec[i]].size(); k++){\n\n\t\t\tMAP[value[V[vec[i]][k]]] += num_member[V[vec[i]][k]];\n\t\t}\n\n\t\tfor(auto at = MAP.begin(); at != MAP.end(); at++){\n\n\t\t\tint work = num_member[vec[i]] + at->second;\n\t\t\tchmax(ans,work);\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 25080,
"score_of_the_acc": -0.0414,
"final_rank": 2
},
{
"submission_id": "aoj_0749_7912160",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 505*505\n\nint N;\nint boss[SIZE],height[SIZE],num_member[SIZE];\n\nint H,W;\nint A[505][505];\nint d_row[4] = {-1,0,0,1},d_col[4] = {0,-1,1,0};\nint value[SIZE];\nvector<int> V[SIZE];\n\nbool rangeCheck(int row,int col){\n\n\treturn row >= 0 && row <= H-1 && col >= 0 && col <= W-1;\n}\n\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 isSame(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[boss_x] > height[boss_y]){\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tnum_member[boss_y] += num_member[boss_x];\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\nint getIndex(int row,int col){\n\n\treturn row*W + col;\n}\n\nint main(){\n\n\tscanf(\"%d %d\",&H,&W);\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tscanf(\"%d\",&A[row][col]);\n\t\t}\n\t}\n\n\tN = H*W;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t\tnum_member[i] = 1;\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tint from = getIndex(row,col);\n\n\t\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\t\tint adj_row = row+d_row[i];\n\t\t\t\tint adj_col = col+d_col[i];\n\t\t\t\tif(!rangeCheck(adj_row,adj_col)||A[row][col] != A[adj_row][adj_col])continue;\n\n\t\t\t\tint to = getIndex(adj_row,adj_col);\n\n\t\t\t\tunite(from,to);\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tint from = getIndex(row,col);\n\n\t\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\t\tint adj_row = row+d_row[i];\n\t\t\t\tint adj_col = col+d_col[i];\n\t\t\t\tif(!rangeCheck(adj_row,adj_col))continue;\n\n\t\t\t\tint to = getIndex(adj_row,adj_col);\n\n\t\t\t\t//辺で接するグループの組合せを記録しておく\n\t\t\t\tif(A[row][col] != A[adj_row][adj_col]){\n\n\t\t\t\t\tV[get_boss(from)].push_back(get_boss(to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = 0;\n\n\tvector<int> vec;\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(i != get_boss(i))continue;\n\n\t\tvec.push_back(i);\n\n\t\t//printf(\"num_member[%d]:%d\\n\",i,num_member[i]);\n\n\t\tchmax(ans,num_member[i]);\n\t\tint tmp_row = i/W;\n\t\tint tmp_col = i%W;\n\t\tvalue[i] = A[tmp_row][tmp_col]; //そのグループの数字\n\n\t\tif(V[i].size() == 0)continue;\n\n\t\tsort(V[i].begin(),V[i].end());\n\t\tV[i].erase(unique(V[i].begin(),V[i].end()),V[i].end());\n\t}\n\n\tfor(int i = 0; i < vec.size(); i++){\n\n\t\t//隣接するグループの数字ごとに、総和を集計する\n\t\tmap<int,int> MAP;\n\t\tfor(int k = 0; k < V[vec[i]].size(); k++){\n\n\t\t\tMAP[value[V[vec[i]][k]]] += num_member[V[vec[i]][k]];\n\t\t}\n\n\t\tfor(auto at = MAP.begin(); at != MAP.end(); at++){\n\n\t\t\tint work = num_member[vec[i]] + at->second;\n\t\t\tchmax(ans,work);\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 25132,
"score_of_the_acc": -0.0417,
"final_rank": 3
},
{
"submission_id": "aoj_0749_7885285",
"code_snippet": "#include <bits/extc++.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) begin(x),end(x)\n#define Fixed fixed << setprecision(12)\n#define updiv(a, b) (((a) + (b) - 1) / (b))\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\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 T, class U> istream& operator>>(istream& is, pair<T, U>& p){ is >> p.first >> p.second; return (is); }\ntemplate<class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p){ os << p.first << ' ' << p.second; return (os); }\ntemplate<class T> istream& operator>>(istream& is, vector<T>& v){ for (auto &&e : v) is >> e; return (is); }\ntemplate<class T> ostream& operator<<(ostream& os, vector<T>& v){ for (auto &&e : v) os << e << ' '; return (os); }\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 max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T, vector<T>, greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A, B>;\ntemplate <class T> using uset = unordered_set<T>;\n\ntemplate <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;\ntemplate <class T> using Rope = __gnu_cxx::rope<T>;\nusing Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n\ntemplate <class T> void bye(T x){ cout << x << '\\n'; exit(0); }\ninline int square(int a){ return (a * a); }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\n\nstruct UnionFind{\n int n;\n vector<int> data;\n\n UnionFind(int sz) : n(sz), data(sz, -1){}\n\n bool unite(int x, int y){\n x = find(x), y = find(y);\n if(x == y) return (false);\n if(data[x] > data[y]) swap(x, y);\n data[x] += data[y];\n data[y] = x;\n return (true);\n }\n\n int find(int k){\n if(data[k] < 0) return (k);\n return (data[k] = find(data[k]));\n }\n\n int size(int k){\n return (-data[find(k)]);\n }\n\n bool same(int x, int y){\n return (find(x) == find(y));\n }\n\n vector<vector<int> > groups(){\n vector<int> leader_buf(n), group_size(n);\n for(int i = 0; i < n; ++i){\n leader_buf[i] = find(i);\n group_size[leader_buf[i]]++;\n }\n vector<vector<int> > res(n);\n for(int i = 0; i < n; ++i){\n res[i].reserve(group_size[i]);\n }\n for(int i = 0; i < n; ++i){\n res[leader_buf[i]].emplace_back(i);\n }\n res.erase(\n remove_if(res.begin(), res.end(),\n [&](const vector<int>& v){ return (v.empty()); }),\n res.end());\n return (res);\n }\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 h, w;\n cin >> h >> w;\n\n assert(1 <= h && h <= 500);\n assert(1 <= w && w <= 500);\n\n vector<vector<int> > a(h, vector<int>(w));\n\n cin >> a;\n\n for (auto v : a) for (auto e : v) assert(1 <= e && e <= 1000000000);\n\n vector<int> c;\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n c.push_back(a[i][j]);\n }\n }\n\n sort(all(c));\n c.erase(unique(all(c)), c.end());\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n a[i][j] = lower_bound(all(c), a[i][j]) - c.begin();\n }\n }\n\n auto inside = [&](int y, int x) {\n return (0 <= y && y < h && 0 <= x && x < w);\n };\n\n int res = 0;\n\n UnionFind uf(h * w);\n\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 int ty = i + dy[k];\n int tx = j + dx[k];\n if (inside(ty, tx) && a[i][j] == a[ty][tx]) {\n uf.unite(i * w + j, ty * w + tx);\n }\n }\n }\n }\n\n vector<vector<int> > g(h * w);\n\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 int ty = i + dy[k];\n int tx = j + dx[k];\n int cur = i * w + j;\n int tar = ty * w + tx;\n if (inside(ty, tx) && !uf.same(cur, tar)) {\n g[uf.find(cur)].push_back(uf.find(tar));\n }\n }\n }\n }\n\n vector<umap<int, int> > cnt(h * w);\n\n for (int i = 0; i < h * w; ++i) {\n chmax(res, uf.size(i));\n sort(all(g[i]));\n g[i].erase(unique(all(g[i])), g[i].end());\n for (auto tar : g[i]) {\n cnt[i][a[tar / w][tar % w]] += uf.size(tar);\n }\n for (auto [c, s] : cnt[i]) {\n chmax(res, s + uf.size(i));\n }\n }\n\n cout << res << '\\n';\n\n return (0);\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 80116,
"score_of_the_acc": -0.452,
"final_rank": 12
},
{
"submission_id": "aoj_0749_7848659",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstruct dsu {\n public:\n int csz;\n dsu() : _n(0) {}\n dsu(int n) : _n(n), csz(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 csz--;\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 ios::sync_with_stdio(false);\n cin.tie(0);\n int h, w;\n cin >> h >> w;\n vector<vector<int>> A(h, vector<int>(w));\n for(int y = 0; y < h; y++){\n for(int x = 0; x < w; x++){\n cin >> A[y][x];\n }\n }\n\n int ans = 0;\n dsu uf(h * w);\n auto f = [&](int y, int x){return y * w + x; };\n auto g = [&](int v){return make_pair(v / w, v % w); };\n for(int y = 0; y < h; y++){\n for(int x = 0; x < w; x++){\n if(x + 1 < w && A[y][x] == A[y][x + 1])uf.merge(f(y, x), f(y, x + 1));\n if(y + 1 < h && A[y][x] == A[y + 1][x])uf.merge(f(y, x), f(y + 1, x));\n }\n }\n\n auto G = uf.groups();\n for(auto &&vec:G){\n set<int> S;\n map<int,int> mp;\n int v = uf.leader(vec[0]);\n S.insert(v);\n for(auto &&v:vec){\n int y, x;\n tie(y, x) = g(v);\n for(int i = 0; i < 4; i++){\n int ny = y + (i == 0) - (i == 1);\n int nx = x + (i == 2) - (i == 3);\n if(ny < 0 || nx < 0 || ny >= h || nx >= w)continue;\n if(S.count(uf.leader(f(ny, nx))))continue;\n S.insert(uf.leader(f(ny, nx)));\n mp[A[ny][nx]] += uf.size(f(ny, nx));\n }\n }\n ans = max(ans, int(vec.size()));\n for(auto &&p:mp){\n ans = max(ans, int(vec.size()) + p.second);\n }\n }\n cout << ans << '\\n';\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 26968,
"score_of_the_acc": -0.118,
"final_rank": 6
}
] |
aoj_0760_cpp
|
コイン集め 2 (Coin Collecting 2)
問題文
机の上に，縦
H
行，横
W
列の長方形状にコインが並べられている．
最初，上から
i
行目 (
1 ≦ i ≦ H
)，左から
j
列目 (
1 ≦ j ≦ W
) のコインは，
S
i,j
=
#
のとき表面，
S
i,j
=
.
のとき裏面が見えている状態である．
葵と凛は，これらのコインを用いてゲームを行うことにした．ゲームは以下のような流れで行われる．
葵がどれか
1
つの行を選び，その行のコインをすべてひっくり返す．
凛がどれか
1
つの列を選び，その列のコインをすべてひっくり返す．
葵が，表面が見えるコインをすべて獲得する．また凛が，裏面が見えるコインをすべて獲得する．
葵と凛はそれぞれ，できるだけ多くのコインを獲得したい．
ゲーム開始時のコインの状態が与えられたとき，
両者が最善を尽くした場合にそれぞれが獲得できるコインの枚数を求めるプログラムを作成せよ．
制約
H ≧ 1
．
W ≧ 1
．
H × W ≦ 500000
．
S
i, j
は
#
，
.
のいずれかである (
1 ≦ i ≦ H
，
1 ≦ j ≦ W
)．
H, W
は整数である．
入力
入力は以下の形式で与えられる．
H
W
S
1,1
S
1,2
…
S
1,W
S
2,1
S
2,2
…
S
2,W
︙
S
H,1
S
H,2
…
S
H,W
出力
葵と凛の得点をこの順に空白区切りで出力せよ．
入出力例
入力例 1
1 1
#
出力例 1
1 0
この入力例では，必ず以下のようにゲームが進行する．
まず，葵が
1
行目のすべてのコインをひっくり返す．
次に，凛が
1
列目のすべてのコインをひっくり返す．
このとき，唯一のコインの見える面は「表→裏→表」と変化するため，葵が
1
枚のコインを獲得できるが，凛はコインを獲得できない．したがって，
1
，
0
をこの順に空白区切りで出力する．
入力例 2
5 5
#####
####.
###..
##...
#....
出力例 2
13 12
両者が最善を尽くした場合の，ゲームの進行の一例を下図に示す．
入力例 3
1 40
..........##########..........##########
出力例 3
19 21
入力例 4
7 1
#
#
#
#
#
#
#
出力例 4
1 6
入力例 5
5 5
.###.
...##
..##.
.##..
##...
出力例 5
11 14
入力例 6
10 40
........................................
..######.....####.....#####.....####....
.....#......#....#......#......#........
.....#......#....#......#......#........
.....#......#....#......#......#........
.....#......#....#......#......#..####..
..#..#......#....#......#......#....#...
..#..#......#....#......#......#....#...
...##........####.....#####.....####....
........................................
出力例 6
104 296
情報オリンピック日本委員会
作 『日本情報オリンピック第3回女性部門 本選 競技課題』
|
[
{
"submission_id": "aoj_0760_9727722",
"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\t\n\tauto H=in(),W=in();\n\tvvll M(H,vll(W,0));\n\tll F=0;\n\tREP(i,H){\n\t\tauto S=in<string>();\n\t\tREP(j,W){\n\t\t\tif(S[j]=='#'){\n\t\t\t\tM[i][j]=1;\n\t\t\t\tF++;\n\t\t\t}\n\t\t}\n\t}\n\tvll C(W,0);\n\tREP(j,W){\n\t\tREP(i,H){\n\t\t\tC[j] += M[i][j];\n\t\t}\n\t}\n\tll AF=0,AB=H*W;\n\tREP(i,H){\n\t\tvll LC=C;\n\t\tll MC=0;\n\t\tll LF=F;\n\t\tREP(j,W){\n\t\t\tif(M[i][j]){\n\t\t\t\tLF--;\n\t\t\t\tLC[j]--;\n\t\t\t\tchmax(MC,LC[j]);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tLF++;\n\t\t\t\tLC[j]++;\n\t\t\t\tchmax(MC,LC[j]);\n\t\t\t}\n\t\t}\n\t\tll X = H-MC;\n\t\tll LAF = LF-MC+X;\n\t\tll LAB = H*W-LAF;\n\t\tif(LAF>AF){\n\t\t\tAF = LAF;\n\t\t\tAB = LAB;\n\t\t}\n\t}\n\tout(AF,AB);\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 30460,
"score_of_the_acc": -0.7082,
"final_rank": 11
},
{
"submission_id": "aoj_0760_9666362",
"code_snippet": "#include <vector>\n#include <string>\n#include <deque>\n#include <tuple>\n#include <climits>\n#include <numeric>\n#include <iostream>\n#include <iomanip>\n#include <random>\n#include <cfloat>\n#include <set>\n#include <queue>\n#include <cmath>\n#include <algorithm>\n#include <variant>\n#include <bitset>\n#include <unordered_map>\n#include <array>\n#include <cmath>\n#include <map>\n#include <optional>\n#include <cassert>\n#include <filesystem>\n#include <mutex>\n#include <thread>\n#include <functional>\n#include <fstream>\n#include <chrono>\n#include <stack>\n#include <array>\n\n\nint main() {\n\tint height, width; std::cin >> height >> width;\n\tstd::vector<std::string> state(height);\n\tfor (auto& line : state) {\n\t\tstd::cin >> line;\n\t}\n\tstd::vector<int> countByRow(height, 0), countByColumn(width, 0);\n\tfor (auto i = 0; i < height; ++i) {\n\t\tfor (auto j = 0; j < width; ++j) {\n\t\t\tif (state[i][j] == '#') {\n\t\t\t\tcountByRow[i] += 1;\n\t\t\t\tcountByColumn[j] += 1;\n\t\t\t}\n\t\t}\n\t}\n\tconst auto sum{ std::accumulate(countByRow.begin(), countByRow.end(), 0) };\n\tint result{ 0 };\n\tfor (auto i = 0; i < height; ++i) {\n\t\tconst auto diffRow{ width - countByRow[i] * 2 };\n\t\tint worst{ INT_MAX };\n\t\tfor (auto j = 0; j < width; ++j) {\n\t\t\tconst auto diffColumn{ height - countByColumn[j] * 2 };\n\t\t\tconst auto current{ sum + diffRow + diffColumn + (state[i][j] == '#' ? 2 : -2) };\n\t\t\tworst = std::min(worst, current);\n\t\t}\n\t\tresult = std::max(result, worst);\n\t}\n\tstd::cout << result << \" \" << (height * width - result) << '\\n';\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 20580,
"score_of_the_acc": -0.2248,
"final_rank": 8
},
{
"submission_id": "aoj_0760_9666324",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define sz(A) ((ll)A.size())\n#define ALL(A) A.begin(),A.end()\nint main(){\n int H,W;cin>>H>>W;\n vector<string>S(H);\n REP(i,H)cin>>S[i];\n vi X(H),Y(W);\n REP(i,H)REP(j,W)if(S[i][j]=='#')X[i]++,Y[j]++;\n vvi Q(H,vi(W));\n REP(i,H)REP(j,W)Q[i][j]=H-2*X[i]+W-2*Y[j]+(S[i][j]=='#'?2:-2);\n ll ma=-1e18;\n REP(i,H){\n ll m=*min_element(ALL(Q[i]));\n ma=max(ma,m);\n }\n REP(i,H)REP(j,W)if(S[i][j]=='#')ma++;\n cout<<ma<<\" \"<<H*W-ma<<endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 49956,
"score_of_the_acc": -1.5,
"final_rank": 14
},
{
"submission_id": "aoj_0760_9476270",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\n\nint h, w;\nvector<int> cnt(500009);\nvector<int> ci(500009);\nvector<string> c(500009);\n\nint si(int px) {\n for (int i = 0; i < w; i++) {\n if (c[px][i] == '#')\n cnt[i]--;\n if (c[px][i] == '.')\n cnt[i]++;\n }\n int mo = -1;\n int mi = -1;\n for (int j = 0; j < w; j++) {\n if (mo < cnt[j]) {\n mo = cnt[j];\n mi = j;\n }\n }\n cnt[mi] = h - cnt[mi];\n int ret = 0;\n for (int j = 0; j < w; j++)\n ret += cnt[j];\n return ret;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n cin >> h >> w;\n for (int i = 0; i < h; i++)\n cin >> c[i];\n \n for (int j = 0; j < w; j++) {\n cnt[j] = 0;\n for (int i = 0; i < h; i++)\n if (c[i][j] == '#')\n cnt[j]++;\n ci[j] = cnt[j];\n }\n \n int ans = 0;\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++)\n cnt[j] = ci[j];\n ans = max(ans, si(i));\n }\n \n cout << ans << ' ' << h * w - ans << '\\n';\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 23732,
"score_of_the_acc": -0.1592,
"final_rank": 7
},
{
"submission_id": "aoj_0760_9052678",
"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 h, w;\n cin >> h >> w;\n vector<string> s(h);\n for (int i = 0; i < h; i++) {\n cin >> s[i];\n }\n int res = 0;\n vector<int> ch(h), cw(w);\n int sum = 0;\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n if (s[i][j] == '#') {\n ch[i] += 1, cw[j] += 1;\n sum += 1;\n }\n }\n }\n for (int i = 0; i < h; i++) {\n int mi = h * w;\n for (int j = 0; j < w; j++) {\n int uo = sum - ch[i] + (w - ch[i]);\n if (s[i][j] == '#') {\n cw[j] -= 1;\n } else {\n cw[j] += 1;\n }\n uo += (h - cw[j]) - cw[j];\n mi = min(mi, uo);\n if (s[i][j] == '#') {\n cw[j] += 1;\n } else {\n cw[j] -= 1;\n }\n }\n res = max(res, mi);\n }\n\n cout << res << \" \" << h * w - res << endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 20780,
"score_of_the_acc": -0.0645,
"final_rank": 3
},
{
"submission_id": "aoj_0760_8986398",
"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 if (x < 0) { cout << (i64)(x); }\n else { cout << (u64)(x); }\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer(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 H, W;\n cin >> H >> W;\n vc<string> S(H);\n rep(i, H) cin >> S[i];\n vi cols(W, 0);\n rep(i, H) rep(j, W) {\n if (S[i][j] == '#') {\n cols[j]++;\n }\n }\n ll aoi = 0;\n rep(i, H) {\n vi c(cols);\n rep(j, W) {\n if (S[i][j] == '#') c[j]--;\n else c[j]++;\n }\n ll max_r=-1, max_j=-1;\n rep(j, W) {\n if (chmax(max_r, c[j])) max_j = j;\n }\n c[max_j] = H - c[max_j];\n chmax(aoi, SUM(c));\n }\n print(aoi, H*W-aoi);\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 18768,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0760_8749617",
"code_snippet": "#line 1 \"a.cpp\"\n#define PROBLEM \"\"\n#line 2 \"/home/kuhaku/home/github/algo/lib/template/template.hpp\"\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = M_PI;\n#line 3 \"/home/kuhaku/home/github/algo/lib/template/macro.hpp\"\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\n#line 3 \"/home/kuhaku/home/github/algo/lib/template/sonic.hpp\"\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n\n constexpr void operator()() const {}\n} sonic;\n#line 5 \"/home/kuhaku/home/github/algo/lib/template/atcoder.hpp\"\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) {\n os << (it == v.begin() ? \"\" : \" \") << *it;\n }\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\ntemplate <typename T, typename... Args>\nauto make_vector(T x, int arg, Args... args) {\n if constexpr (sizeof...(args) == 0) return std::vector<T>(arg, x);\n else return std::vector(arg, make_vector<T>(x, args...));\n}\nvoid Yes(bool is_correct = true) {\n std::cout << (is_correct ? \"Yes\" : \"No\") << '\\n';\n}\nvoid No(bool is_not_correct = true) {\n Yes(!is_not_correct);\n}\nvoid YES(bool is_correct = true) {\n std::cout << (is_correct ? \"YES\" : \"NO\") << '\\n';\n}\nvoid NO(bool is_not_correct = true) {\n YES(!is_not_correct);\n}\nvoid Takahashi(bool is_correct = true) {\n std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n';\n}\nvoid Aoki(bool is_not_correct = true) {\n Takahashi(!is_not_correct);\n}\n#line 3 \"a.cpp\"\n\nint main(void) {\n int h, w;\n cin >> h >> w;\n vector<string> s(h);\n cin >> s;\n\n int a = 0, b = 0;\n vector<int> c(h), d(w);\n rep (i, h) {\n rep (j, w) {\n if (s[i][j] == '#') {\n ++a;\n ++c[i];\n ++d[j];\n } else {\n ++b;\n }\n }\n }\n\n vector<int> ys(h);\n rep (i, h) {\n a -= c[i] * 2 - w;\n b += c[i] * 2 - w;\n rep (j, w) {\n if (s[i][j] == '#') {\n --d[j];\n } else {\n ++d[j];\n }\n a -= d[j] * 2 - h;\n b += d[j] * 2 - h;\n chmax(ys[i], b);\n a += d[j] * 2 - h;\n b -= d[j] * 2 - h;\n if (s[i][j] == '#') {\n ++d[j];\n } else {\n --d[j];\n }\n }\n a += c[i] * 2 - w;\n b -= c[i] * 2 - w;\n }\n int ans = *min_element(all(ys));\n co(h * w - ans, ans);\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 22704,
"score_of_the_acc": -0.1262,
"final_rank": 6
},
{
"submission_id": "aoj_0760_8658838",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint h, w;\nint cnt[500009];\nint ci[500009];\nstring c[500009];\n\nint si(int px) {\n for (int i = 0; i < w; i++) {\n if (c[px][i] == '#')\n cnt[i]--;\n if (c[px][i] == '.')\n cnt[i]++;\n }\n int mo = -1;\n int mi = -1;\n for (int j = 0; j < w; j++) {\n if (mo < cnt[j]) {\n mo = cnt[j];\n mi = j;\n }\n }\n cnt[mi] = h - cnt[mi];\n int ret = 0;\n for (int j = 0; j < w; j++)\n ret += cnt[j];\n return ret;\n}\n\nint main() {\n cin >> h >> w;\n for (int i = 0; i < h; i++)\n cin >> c[i];\n for (int j = 0; j < w; j++) {\n cnt[j] = 0;\n for (int i = 0; i < h; i++)\n if (c[i][j] == '#')\n cnt[j]++;\n ci[j] = cnt[j];\n }\n int ans = 0;\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++)\n cnt[j] = ci[j];\n ans = max(ans, si(i));\n }\n cout << ans << ' ' << h * w - ans << '\\n';\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 30520,
"score_of_the_acc": -1.3768,
"final_rank": 13
},
{
"submission_id": "aoj_0760_8174991",
"code_snippet": "#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(v) v.begin(),v.end()\ntypedef long long ll;\n \n#include<bits/stdc++.h>\nusing namespace std;\n \nint main(){\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n \n int h,w;\n cin>>h>>w;\n vector<string> S(h);\n rep(i,h) cin>>S[i];\n vector<int> H(h),W(w);\n int cnt=0;\n rep(i,h) rep(j,w){\n if(S[i][j]=='.'){\n H[i]++;\n W[j]++;\n cnt++;\n }\n }\n int mi=h*w+1;\n rep(i,h){\n int ma=-h*w-1;\n rep(j,w){\n int t=w+h-2*H[i]-2*W[j];\n if(S[i][j]=='#') ma=max(ma,t-2);\n else ma=max(ma,t+2);\n }\n mi=min(mi,ma);\n }\n cout<<h*w-mi-cnt<<\" \"<<mi+cnt<<endl;\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 20792,
"score_of_the_acc": -0.0649,
"final_rank": 4
},
{
"submission_id": "aoj_0760_7995377",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\n\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n \n ll H,W;\n cin>>H>>W;\n vll HN(H,0),WN(W,0);\n vector<string> S(H);\n ll cnt=0;\n rep(h,H){\n cin>>S[h];\n rep(w,W){\n if(S[h][w]=='#'){\n HN[h]++;\n WN[w]++;\n cnt++;\n }\n }\n }\n ll an=0;\n rep(h,H){\n ll d=cnt+(W-HN[h])-HN[h];\n ll m=1e18;\n rep(w,W){\n //cout<<d<<endl;\n if(S[h][w]=='#')WN[w]--;\n else WN[w]++;\n\n chmin(m,d-WN[w]+(H-WN[w]));\n if(S[h][w]=='#')WN[w]++;\n else WN[w]--;\n }\n chmax(an,m);\n }\n cout<<an<<\" \"<<H*W-an<<endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 22488,
"score_of_the_acc": -0.1193,
"final_rank": 5
},
{
"submission_id": "aoj_0760_7953340",
"code_snippet": "#include <bits/extc++.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) begin(x),end(x)\n#define Fixed fixed << setprecision(12)\n#define updiv(a, b) (((a) + (b) - 1) / (b))\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\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 T, class U> istream& operator>>(istream& is, pair<T, U>& p){ is >> p.first >> p.second; return (is); }\ntemplate<class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p){ os << p.first << ' ' << p.second; return (os); }\ntemplate<class T> istream& operator>>(istream& is, vector<T>& v){ for (auto &&e : v) is >> e; return (is); }\ntemplate<class T> ostream& operator<<(ostream& os, vector<T>& v){ for (auto &&e : v) os << e << ' '; return (os); }\n\ntemplate<class T> inline const T& max(const vector<T> &v) { return *max_element(v.begin(), v.end()); }\ntemplate<class T> inline const T& min(const vector<T> &v) { return *min_element(v.begin(), v.end()); }\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 max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T, vector<T>, greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A, B>;\ntemplate <class T> using uset = unordered_set<T>;\n\ntemplate <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;\ntemplate <class T> using Rope = __gnu_cxx::rope<T>;\nusing Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n\ntemplate <class T> void bye(T x){ cout << x << '\\n'; exit(0); }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1,0};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1,0};\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 h, w;\n cin >> h >> w;\n\n vector<string> s(h);\n\n cin >> s;\n\n vector<vector<int> > mat(h, vector<int>(w));\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n mat[i][j] = (s[i][j] == '#');\n }\n }\n\n vector<int> r(h), c(w);\n int sum = 0;\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n r[i] += mat[i][j];\n c[j] += mat[i][j];\n sum += mat[i][j];\n }\n }\n\n int res = 0;\n\n for (int i = 0; i < h; ++i) {\n int minv = h * w;\n for (int j = 0; j < w; ++j) {\n int aoi = sum;\n aoi -= r[i] + c[j];\n aoi += mat[i][j];\n aoi += w - r[i] + h - c[j];\n aoi += mat[i][j] - (1 - mat[i][j]) * 2;\n chmin(minv, aoi);\n }\n chmax(res, minv);\n }\n\n cout << res << ' ' << h * w - res << '\\n';\n\n return (0);\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 47932,
"score_of_the_acc": -1.1018,
"final_rank": 12
},
{
"submission_id": "aoj_0760_7886315",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\nenum Type{\n\tSente,\n\tGote,\n};\n\n\nint *numOmoteCol; //列ごとの表の個数を持つ\nint *numOmoteRow; //行ごとの表の数を持つ\nchar **buf;\nint H,W;\nint sumOmote = 0,sumUra = 0;\n\n\nint func(Type type,int base){ //自分の得点を返却\n\n\tint ret = -BIG_NUM;\n\n\tif(type == Sente){ //どれか1つの行を選ぶ\n\n\t\tfor(int row = 0; row < H; row++){\n\n\t\t\tint tmp = func(Gote,row);\n\t\t\tchmax(ret,H*W-tmp);\n\t\t}\n\n\t}else{ //どれか1つの列を選ぶ\n\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\t//この列以外の数\n\t\t\tint otherOmote = sumOmote-numOmoteCol[col]; //この列以外の表の総数\n\t\t\tint otherUra = sumUra-(H-numOmoteCol[col]); //この列以外の裏の総数\n\n\t\t\t//先手による反転結果を反映\n\t\t\tint workOmote = numOmoteRow[base];\n\t\t\tint workUra = W-workOmote;\n\t\t\t//この列は無視\n\t\t\tif(buf[base][col] == '#'){\n\n\t\t\t\tworkOmote--;\n\n\t\t\t}else{\n\n\t\t\t\tworkUra--;\n\t\t\t}\n\n\t\t\totherOmote = otherOmote-workOmote+workUra;\n\t\t\totherUra = otherUra-workUra+workOmote;\n\n\t\t\t//この列の反転前\n\t\t\tint omote = numOmoteCol[col];\n\t\t\tint ura = H-numOmoteCol[col];\n\n\t\t\tif(buf[base][col] == '#'){\n\n\t\t\t\tomote--;\n\t\t\t\tura++;\n\n\t\t\t}else{\n\n\t\t\t\tomote++;\n\t\t\t\tura--;\n\t\t\t}\n\n\t\t\t//この列の反転後\n\t\t\tint nextUra = otherUra+omote;\n\n\t\t\tchmax(ret,nextUra);\n\t\t}\n\t}\n\n\treturn ret;\n}\n\n\nint main(){\n\n\tscanf(\"%d %d\",&H,&W);\n\n\tbuf = new char*[H];\n\tnumOmoteCol = new int[W];\n\tnumOmoteRow = new int[H];\n\n\tfor(int col = 0; col < W; col++){\n\n\t\tnumOmoteCol[col] = 0;\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\n\t\tnumOmoteRow[row] = 0;\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\n\t\tbuf[row] = new char[W+1];\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\n\t\tscanf(\"%s\",buf[row]);\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(buf[row][col] == '#'){\n\n\t\t\t\tsumOmote++;\n\t\t\t\tnumOmoteCol[col]++;\n\t\t\t\tnumOmoteRow[row]++;\n\n\t\t\t}else{\n\n\t\t\t\tsumUra++;\n\t\t\t}\n\t\t}\n\t}\n\n\tint sente = func(Sente,-1);\n\tint gote = H*W-sente;\n\n\tprintf(\"%d %d\\n\",sente,gote);\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 24700,
"score_of_the_acc": -0.3569,
"final_rank": 9
},
{
"submission_id": "aoj_0760_7886313",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\nenum Type{\n\tSente,\n\tGote,\n};\n\n\nint *numOmoteCol; //列ごとの表の個数を持つ\nint *numOmoteRow; //行ごとの表の数を持つ\nchar **buf;\nint H,W;\nint sumOmote = 0,sumUra = 0;\n\n\nint func(Type type,int base){ //自分の得点を返却\n\n\tint ret = -BIG_NUM;\n\n\tif(type == Sente){ //どれか1つの行を選ぶ\n\n\t\tfor(int row = 0; row < H; row++){\n\n\t\t\tint tmp = func(Gote,row);\n\t\t\tchmax(ret,H*W-tmp);\n\t\t}\n\n\t}else{ //どれか1つの列を選ぶ\n\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\t//この列以外の数\n\t\t\tint otherOmote = sumOmote-numOmoteCol[col]; //この列以外の表の総数\n\t\t\tint otherUra = sumUra-(H-numOmoteCol[col]); //この列以外の裏の総数\n\n\t\t\t//printf(\"otherOmote:%d otherUra:%d\\n\",otherOmote,otherUra);\n\n\t\t\t//先手による反転結果を反映\n\t\t\tint workOmote = numOmoteRow[base];\n\t\t\tint workUra = W-workOmote;\n\t\t\t//この列は無視\n\t\t\tif(buf[base][col] == '#'){\n\n\t\t\t\tworkOmote--;\n\n\t\t\t}else{\n\n\t\t\t\tworkUra--;\n\t\t\t}\n\n\t\t\t//printf(\"workOmote:%d workUra:%d\\n\",workOmote,workUra);\n\n\t\t\totherOmote = otherOmote-workOmote+workUra;\n\t\t\totherUra = otherUra-workUra+workOmote;\n\n\t\t\t//printf(\"otherOmote:%d otherUra:%d\\n\",otherOmote,otherUra);\n\n\t\t\t//この列の反転前\n\t\t\tint omote = numOmoteCol[col];\n\t\t\tint ura = H-numOmoteCol[col];\n\n\t\t\t//printf(\"列%dの反転前 omote:%d 裏:%d\\n\",col,omote,ura);\n\n\t\t\tif(buf[base][col] == '#'){\n\n\t\t\t\tomote--;\n\t\t\t\tura++;\n\n\t\t\t}else{\n\n\t\t\t\tomote++;\n\t\t\t\tura--;\n\t\t\t}\n\n\t\t\t//printf(\"列%dの反転後 omote:%d 裏:%d\\n\",col,omote,ura);\n\n\t\t\t//この列の反転後\n\t\t\tint nextOmote = otherOmote+ura;\n\t\t\t//printf(\"nextOmote:%d otherOmote:%d ura:%d\\n\",nextOmote,otherOmote,ura);\n\t\t\tint nextUra = otherUra+omote;\n\t\t\t//printf(\"nextUra:%d otherUra:%d omote:%d\\n\",nextUra,otherUra,omote);\n\n\t\t\tchmax(ret,nextUra);\n\t\t}\n\t}\n\n\treturn ret;\n}\n\n\nint main(){\n\n\tscanf(\"%d %d\",&H,&W);\n\n\tbuf = new char*[H];\n\tnumOmoteCol = new int[W];\n\tnumOmoteRow = new int[H];\n\n\tfor(int col = 0; col < W; col++){\n\n\t\tnumOmoteCol[col] = 0;\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\n\t\tnumOmoteRow[row] = 0;\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\n\t\tbuf[row] = new char[W+1];\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\n\t\tscanf(\"%s\",buf[row]);\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(buf[row][col] == '#'){\n\n\t\t\t\tsumOmote++;\n\t\t\t\tnumOmoteCol[col]++;\n\t\t\t\tnumOmoteRow[row]++;\n\n\t\t\t}else{\n\n\t\t\t\tsumUra++;\n\t\t\t}\n\t\t}\n\t}\n\n\t//printf(\"num0:%d num1:%d\\n\",sumOmote,sumUra);\n\n\tint sente = func(Sente,-1);\n\tint gote = H*W-sente;\n\n\tprintf(\"%d %d\\n\",sente,gote);\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 24716,
"score_of_the_acc": -0.3574,
"final_rank": 10
},
{
"submission_id": "aoj_0760_7848675",
"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 h, w, cnt = 0;\n cin >> h >> w;\n vector<string> A(h);\n vector<int> Y(h), X(w);\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] == '#'){\n Y[y]++;\n X[x]++;\n cnt++;\n }else{\n Y[y]--;\n X[x]--;\n cnt--;\n }\n }\n }\n int ans = -(1 << 30);\n for(int y = 0; y < h; y++){\n int mn = 1 << 30;\n for(int x = 0; x < w; x++){\n mn = min(mn, cnt - 2 * Y[y] - 2 * X[x] + (A[y][x] == '#' ? 4 : -4) );\n }\n ans = max(ans, mn);\n }\n int v = (ans + h * w) / 2, v2 = h * w - v;\n cout << v << \" \" << v2 << '\\n';\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 20704,
"score_of_the_acc": -0.0621,
"final_rank": 2
}
] |
aoj_0761_cpp
|
運河 (Canal)
問題文
JOIG 王国は
H
行
W
列のマス目に区切られた長方形の形をしている．上から
i
行目 (
1 ≦ i ≦ H
)，左から
j
列目 (
1 ≦ j ≦ W
) のマスをマス
(i,j)
と呼ぶ．
各マスには標高と呼ばれる整数が定まっている．マス
(i,j)
の標高は
A
i,j
である．
JOIG 王国では，王国を縦断する運河を建設することにした．運河の建設は，以下のように行われる．
ある整数
k
(
1 ≦ k < W
) を定める．左から
k
列目と
k+1
列目の間に，王国の上端から下端まで縦断する運河を建設する．
運河を横切らず，辺で接している標高が同じマスへの移動を繰り返すことで相互に移動できるマスの集まりをここでは
平地
と呼ぶ．国土を管理しやすくするため，平地の個数ができるだけ少なくなるように運河の建設位置を決めたい．
JOIG 王国の地形の情報が与えられたとき，運河を建設した後の JOIG 王国内の平地の個数としてありうる最小値を求めるプログラムを作成せよ．
制約
H ≧ 1
．
W ≧ 2
．
H × W ≦ 500000
．
1 ≦ A
i,j
≦ 10
9
(
1 ≦ i ≦ H
，
1 ≦ j ≦ W
)．
入力される値はすべて整数である．
入力
入力は以下の形式で与えられる．
H
W
A
1,1
A
1,2
…
A
1,W
A
2,1
A
2,2
…
A
2,W
:
A
H,1
A
H,2
…
A
H,W
出力
運河を建設した後の JOIG 王国内の平地の個数としてありうる最小値を出力せよ．
入出力例
入力例 1
4 4
1 1 1 3
2 2 1 3
2 1 1 3
2 2 2 2
出力例 1
4
k=3
として運河を建設すると，JOIG 王国は以下のように
4
個の平地に分かれる．
マス
(1,1)
，
(1,2)
，
(1,3)
，
(2,3)
，
(3,2)
，
(3,3)
からなる平地
マス
(2,1)
，
(2,2)
，
(3,1)
，
(4,1)
，
(4,2)
，
(4,3)
からなる平地
マス
(1,4)
，
(2,4)
，
(3,4)
からなる平地
マス
(4,4)
からなる平地
JOIG 王国内の平地の個数を
3
個以下にすることはできないので，
4
を出力する．
入力例 2
5 8
1 2 2 5 5 5 5 5
1 1 2 2 5 6 5 6
1 1 1 1 6 6 5 6
1 1 3 1 1 6 7 6
1 4 1 1 1 6 6 6
出力例 2
8
k=1
として運河を建設すると，JOIG 王国は
8
個の平地に分かれる．JOIG 王国内の平地の個数を
7
個以下にすることはできないので，
8
を出力する．
入力例 3
1 6
1 1 2 2 3 3
出力例 3
3
入力例 4
2 10
1 1 1 1 1 3 3 3 3 4
1 2 1 3 3 3 1 1 3 3
出力例 4
6
情報オリンピック日本委員会
作 『日本情報オリンピック第3回女性部門 本選 競技課題』
|
[
{
"submission_id": "aoj_0761_9666396",
"code_snippet": "#include <vector>\n#include <string>\n#include <deque>\n#include <tuple>\n#include <climits>\n#include <numeric>\n#include <iostream>\n#include <iomanip>\n#include <random>\n#include <cfloat>\n#include <set>\n#include <queue>\n#include <cmath>\n#include <algorithm>\n#include <variant>\n#include <bitset>\n#include <unordered_map>\n#include <array>\n#include <cmath>\n#include <map>\n#include <optional>\n#include <cassert>\n#include <filesystem>\n#include <mutex>\n#include <thread>\n#include <functional>\n#include <fstream>\n#include <chrono>\n#include <stack>\n#include <array>\n\nclass UnionFind {\n\tstd::vector<int> vec;\npublic:\n\tUnionFind(const int size) : vec(size, -1) {};\n\tint get(const int a) {\n\t\tif (vec[a] < 0) return a;\n\t\treturn vec[a] = get(vec[a]);\n\t}\n\tbool unite(int a, int b) {\n\t\ta = get(a);\n\t\tb = get(b);\n\t\tif (a == b) return false;\n\t\tif (vec[a] > vec[b]) std::swap(a, b);\n\t\tvec[a] += vec[b];\n\t\tvec[b] = a;\t\t\n\t\treturn true;\n\t}\n};\nint main() {\n\tint height, width; std::cin >> height >> width;\n\tstd::vector<std::vector<int>> state(height, std::vector<int>(width));\n\tfor (auto& line : state) {\n\t\tfor (auto& a : line) {\n\t\t\tstd::cin >> a;\n\t\t}\n\t}\n\tstd::vector<int> forward(width), backward(width);\n\tUnionFind uftForward(height * width), uftBackward(height * width);\n\tint count{ 0 };\n\tfor (auto i = 0; i < width - 1; ++i) {\n\t\tcount += height;\n\t\tfor (auto h = 1; h < height; ++h) {\n\t\t\tif (state[h][i] == state[h - 1][i]) {\n\t\t\t\tif (uftForward.unite(h * width + i, (h - 1) * width + i)) {\n\t\t\t\t\tcount--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (i > 0) {\n\t\t\tfor (auto h = 0; h < height; ++h) {\n\t\t\t\tif (state[h][i - 1] == state[h][i]) {\n\t\t\t\t\tif (uftForward.unite(h * width + i - 1, h * width + i)) {\n\t\t\t\t\t\t--count;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tforward[i] = count;\n\t}\n\tcount = 0;\n\tfor (int i = width - 1; i > 0; --i) {\n\t\tcount += height;\n\t\tfor (auto h = 1; h < height; ++h) {\n\t\t\tif (state[h][i] == state[h - 1][i]) {\n\t\t\t\tif (uftBackward.unite(h * width + i, (h - 1) * width + i)) {\n\t\t\t\t\tcount--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (i + 1 < width) {\n\t\t\tfor (auto h = 0; h < height; ++h) {\n\t\t\t\tif (state[h][i + 1] == state[h][i]) {\n\t\t\t\t\tif (uftBackward.unite(h * width + i + 1, h * width + i)) {\n\t\t\t\t\t\t--count;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbackward[i] = count;\n\t}\n\tint result{ height * width };\n\tfor (auto i = 1; i < width; ++i) {\n\t\tresult = std::min(result, forward[i - 1] + backward[i]);\n\t}\n\tstd::cout << result << '\\n';\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 20628,
"score_of_the_acc": -0.3351,
"final_rank": 9
},
{
"submission_id": "aoj_0761_9666352",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)\n#define RREP(i,n) RFOR(i,0,n)\n#define sz(A) ((ll)A.size())\n#define ALL(A) A.begin(),A.end()\nstruct dsu{\n vector<int>nec;\n dsu(int _N):nec(_N,-1){}\n int leader(int v){\n while(nec[v]>=0)v=nec[v];\n return v;\n }\n int merge(int u,int v){\n u=leader(u);\n v=leader(v);\n if(u==v)return u;\n if(nec[u]<nec[v])swap(u,v);\n nec[v]+=nec[u];\n nec[u]=v;\n return v;\n }\n bool same(int u,int v){\n return leader(u)==leader(v);\n }\n};\nint main(){\n int H,W;cin>>H>>W;\n vvi A(H,vi(W));\n REP(i,H)REP(j,W)cin>>A[i][j];\n vi X(W-1);\n {\n dsu D(H*W);\n ll g=H;\n REP(i,H-1)if(A[i][0]==A[i+1][0])g--,D.merge(i*W,i*W+W);\n REP(j,W-1){\n X[j]=g;\n g+=H;\n REP(i,H)if(A[i][j]==A[i][j+1])g--,D.merge(i*W+j,i*W+j+1);\n REP(i,H-1)if(A[i][j+1]==A[i+1][j+1]&&!D.same(i*W+j+1,i*W+j+1+W))g--,D.merge(i*W+j+1,i*W+j+1+W);\n }\n }\n {\n dsu D(H*W);\n ll g=H;\n REP(i,H-1)if(A[i][W-1]==A[i+1][W-1])g--,D.merge(i*W+W-1,i*W+W-1+W);\n RREP(j,W-1){\n X[j]+=g;\n g+=H;\n REP(i,H)if(A[i][j]==A[i][j+1])g--,D.merge(i*W+j,i*W+j+1);\n REP(i,H-1)if(A[i][j]==A[i+1][j]&&!D.same(i*W+j,i*W+j+W))g--,D.merge(i*W+j,i*W+j+W);\n }\n }\n cout<<*min_element(ALL(X))<<endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 18808,
"score_of_the_acc": -0.3076,
"final_rank": 7
},
{
"submission_id": "aoj_0761_9666335",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)\n#define RREP(i,n) RFOR(i,0,n)\n#define sz(A) ((ll)A.size())\n#define ALL(A) A.begin(),A.end()\nstruct dsu{\n vector<int>nec;\n dsu(int _N):nec(_N,-1){}\n int leader(int v){\n while(nec[v]>=0)v=nec[v];\n return v;\n }\n int merge(int u,int v){\n u=leader(u);\n v=leader(v);\n if(u==v)return u;\n if(nec[u]<nec[v])swap(u,v);\n nec[v]+=nec[u];\n nec[u]=v;\n return v;\n }\n bool same(int u,int v){\n return leader(u)==leader(v);\n }\n};\nint main(){\n int H,W;cin>>H>>W;\n vvi A(H,vi(W));\n REP(i,H)REP(j,W)cin>>A[i][j];\n vi X(W-1);\n {\n dsu D(H*W);\n ll g=H;\n REP(i,H-1)if(A[i][0]==A[i+1][0])g--,D.merge(i*W,i*W+W);\n REP(j,W-1){\n X[j]=g;\n g+=H;\n REP(i,H)if(A[i][j]==A[i][j+1])g--,D.merge(i*W+j,i*W+j+1);\n REP(i,H-1)if(A[i][j+1]==A[i+1][j+1]&&!D.same(i*W+j+1,i*W+j+1+W))g--,D.merge(i*W+j+1,i*W+j+1+W);\n }\n }\n {\n dsu D(H*W);\n ll g=H;\n REP(i,H-1)if(A[i][W-1]==A[i+1][W-1])g--,D.merge(i*W-1,i*W+W-1+W);\n RREP(j,W-1){\n X[j]+=g;\n g+=H;\n REP(i,H)if(A[i][j]==A[i][j+1])g--,D.merge(i*W+j,i*W+j+1);\n REP(i,H-1)if(A[i][j]==A[i+1][j]&&!D.same(i*W+j,i*W+j+W))g--,D.merge(i*W+j,i*W+j+W);\n }\n }\n cout<<*min_element(ALL(X))<<endl;\n return 0;\n}",
"accuracy": 0.1910828025477707,
"time_ms": 120,
"memory_kb": 13004,
"score_of_the_acc": -0.2,
"final_rank": 15
},
{
"submission_id": "aoj_0761_9476373",
"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\nstruct UnionFind {\n vector<int> par, num;\n UnionFind(int n) : par(n), num(n, 1) {\n for (int i = 0; i < n; ++i) par[i] = i;\n }\n int find(int v) { return (par[v] == v) ? v : (par[v] = find(par[v])); }\n void unite(int u, int v) {\n u = find(u), v = find(v);\n if (u == v) return;\n if (num[u] < num[v]) swap(u, v);\n num[u] += num[v];\n par[v] = u;\n }\n bool same(int u, int v) { return find(u) == find(v); }\n int size(int v) { return num[find(v)]; }\n};\n\n#define BUFFER_SIZE 262144\nstruct fastI{\n char in[1<<23];\n const char *o;\n fastI(){\n o = in;\n in[fread(in, 1, sizeof(in)-4, stdin)] = 0;\n }\n fastI& operator>>(char& c){\n c = *o++;\n return *this;\n }\n fastI& operator>>(int& u){\n char c;\n for (u = *o++ & 15; (c = *o++) >= '0'; ){\n u = (u << 3) + (u << 1) + (c & 15);\n }\n return *this;\n }\n} fin;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n, m;\n fin >> n >> m;\n vector<vector<int>> a(n, vector<int>(m));\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n fin >> a[i][j];\n }\n }\n vector<int> L(m + 1), R(m + 1);\n {\n UnionFind uf(n * m);\n for (int j = 0; j < m; j++) {\n L[j + 1] = L[j] + n;\n int cur = j;\n for (int i = 0; i < n; i++) {\n if (i && a[i][j] == a[i - 1][j] && !uf.same(cur, cur - m)) {\n uf.unite(cur, cur - m);\n L[j + 1] -= 1;\n }\n if (j && a[i][j] == a[i][j - 1] && !uf.same(cur, cur - 1)) {\n uf.unite(cur, cur - 1);\n L[j + 1] -= 1;\n }\n cur += m;\n }\n }\n }\n {\n UnionFind uf(n * m);\n for (int jj = 0; jj < m; jj++) {\n int j = m - 1 - jj;\n R[jj + 1] = R[jj] + n;\n int cur = j;\n for (int i = 0; i < n; i++) {\n if (i && a[i][j] == a[i - 1][j] && !uf.same(cur, cur - m)) {\n uf.unite(cur, cur - m);\n R[jj + 1] -= 1;\n }\n if (j < m - 1 && a[i][j] == a[i][j + 1] && !uf.same(cur, cur + 1)) {\n uf.unite(cur, cur + 1);\n R[jj + 1] -= 1;\n }\n cur += m;\n }\n }\n }\n int res = n * m;\n for (int i = 1; i < m; i++) {\n res = min(res, L[i] + R[m - i]);\n }\n cout << res << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 26856,
"score_of_the_acc": -0.2091,
"final_rank": 4
},
{
"submission_id": "aoj_0761_9052677",
"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\nstruct UnionFind {\n vector<int> par, num;\n UnionFind(int n) : par(n), num(n, 1) {\n iota(par.begin(), par.end(), 0); // include<numeric>\n }\n int find(int v) { return (par[v] == v) ? v : (par[v] = find(par[v])); }\n void unite(int u, int v) {\n u = find(u), v = find(v);\n if (u == v) return;\n if (num[u] < num[v]) swap(u, v);\n num[u] += num[v];\n par[v] = u;\n }\n bool same(int u, int v) { return find(u) == find(v); }\n int size(int v) { return num[find(v)]; }\n};\n\n#define BUFFER_SIZE 262144\nstruct fastI{\n char in[1<<23];\n char const*o;\n fastI(){\n o = in;\n in[fread(in, 1, sizeof(in)-4, stdin)] = 0;\n }\n fastI& operator>>(char& c){\n c = *o++;\n return *this;\n }\n fastI& operator>>(int& u){\n char c;\n for (u = *o++ & 15; (c = *o++) >= '0'; ){\n u = (u << 3) + (u << 1) + (c & 15);\n }\n return *this;\n }\n} fin;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n, m;\n fin >> n >> m;\n vector<vector<int>> a(n, vector<int>(m));\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n fin >> a[i][j];\n }\n }\n vector<int> L(m + 1), R(m + 1);\n {\n UnionFind uf(n * m);\n for (int j = 0; j < m; j++) {\n L[j + 1] = L[j] + n;\n int cur = j;\n for (int i = 0; i < n; i++) {\n if (i and a[i][j] == a[i - 1][j] and !uf.same(cur, cur - m)) {\n uf.unite(cur, cur - m);\n L[j + 1] -= 1;\n }\n if (j and a[i][j] == a[i][j - 1] and !uf.same(cur, cur - 1)) {\n uf.unite(cur, cur - 1);\n L[j + 1] -= 1;\n }\n cur += m;\n }\n }\n }\n {\n UnionFind uf(n * m);\n for (int jj = 0; jj < m; jj++) {\n int j = m - 1 - jj;\n R[jj + 1] = R[jj] + n;\n int cur = j;\n for (int i = 0; i < n; i++) {\n if (i and a[i][j] == a[i - 1][j] and !uf.same(cur, cur - m)) {\n uf.unite(cur, cur - m);\n R[jj + 1] -= 1;\n }\n if (j < m - 1 and a[i][j] == a[i][j + 1] and !uf.same(cur, cur + 1)) {\n uf.unite(cur, cur + 1);\n R[jj + 1] -= 1;\n }\n cur += m;\n }\n }\n }\n int res = n * m;\n for (int i = 1; i < m; i++) {\n res = min(res, L[i] + R[m - i]);\n }\n cout << res << endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 26868,
"score_of_the_acc": -0.2092,
"final_rank": 5
},
{
"submission_id": "aoj_0761_9039031",
"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 if (x < 0) { cout << (i64)(x); }\n else { cout << (u64)(x); }\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer(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()) {break;}\n return 0;\n}\n\nint solve() {\n ll H, W;\n cin >> H >> W;\n vv(ll, A, H, W);\n rep(i, H) rep(j, W) cin >> A[i][j];\n vi L(W+1);\n L[0] = 0;\n UnionFind uf(H*W);\n rep(j, W) {\n L[j+1] = L[j] + H;\n if (j > 0) {\n rep(i, H) {\n if (A[i][j] == A[i][j-1]) {\n uf.merge(j*H+i, (j-1)*H+i);\n L[j+1]--;\n }\n }\n }\n rep(i, H-1) {\n if (A[i][j] == A[i+1][j]) {\n if (uf[j*H+i] != uf[j*H+i+1]) {\n uf.merge(j*H+i, j*H+i+1);\n L[j+1]--;\n }\n }\n }\n }\n vi R(W+1);\n R[W] = 0;\n UnionFind uf2(H*W);\n rrep(j, W) {\n R[j] = R[j+1] + H;\n if (j < W-1) {\n rep(i, H) {\n if (A[i][j] == A[i][j+1]) {\n uf2.merge(j*H+i, (j+1)*H+i);\n R[j]--;\n }\n }\n }\n rep(i, H-1) {\n if (A[i][j] == A[i+1][j]) {\n if (uf2[j*H+i] != uf2[j*H+i+1]) {\n uf2.merge(j*H+i, j*H+i+1);\n R[j]--;\n }\n }\n }\n }\n ll ans = H*W;\n rep(i, 1, W) chmin(ans, L[i]+R[i]);\n print(ans);\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 24728,
"score_of_the_acc": -0.237,
"final_rank": 6
},
{
"submission_id": "aoj_0761_8750514",
"code_snippet": "#line 1 \"a.cpp\"\n#define PROBLEM \"\"\n#line 2 \"/home/kuhaku/home/github/algo/lib/template/template.hpp\"\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = M_PI;\n#line 3 \"/home/kuhaku/home/github/algo/lib/template/macro.hpp\"\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\n#line 3 \"/home/kuhaku/home/github/algo/lib/template/sonic.hpp\"\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n\n constexpr void operator()() const {}\n} sonic;\n#line 5 \"/home/kuhaku/home/github/algo/lib/template/atcoder.hpp\"\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) {\n os << (it == v.begin() ? \"\" : \" \") << *it;\n }\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\ntemplate <typename T, typename... Args>\nauto make_vector(T x, int arg, Args... args) {\n if constexpr (sizeof...(args) == 0) return std::vector<T>(arg, x);\n else return std::vector(arg, make_vector<T>(x, args...));\n}\nvoid Yes(bool is_correct = true) {\n std::cout << (is_correct ? \"Yes\" : \"No\") << '\\n';\n}\nvoid No(bool is_not_correct = true) {\n Yes(!is_not_correct);\n}\nvoid YES(bool is_correct = true) {\n std::cout << (is_correct ? \"YES\" : \"NO\") << '\\n';\n}\nvoid NO(bool is_not_correct = true) {\n YES(!is_not_correct);\n}\nvoid Takahashi(bool is_correct = true) {\n std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n';\n}\nvoid Aoki(bool is_not_correct = true) {\n Takahashi(!is_not_correct);\n}\n#line 3 \"/home/kuhaku/home/github/algo/lib/tree/union_find.hpp\"\n\n/**\n * @brief 素集合データ構造\n * @details Implement (union by size) + (path compression)\n * @see https://github.com/atcoder/ac-library/blob/master/atcoder/dsu.hpp\n */\nstruct union_find {\n union_find() = default;\n explicit union_find(int _n) : data(_n, -1) {}\n\n int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }\n int get_root(int x) { return root(x); }\n\n bool is_root(int x) const { return data[x] < 0; }\n\n bool same(int x, int y) { return root(x) == root(y); }\n bool is_same(int x, int y) { return same(x, y); }\n\n int size(int x) { return -(data[root(x)]); }\n int get_size(int x) { return size(x); }\n\n std::vector<int> leaders() {\n std::vector<int> res;\n for (int i = 0; i < (int)data.size(); ++i) {\n if (is_root(i)) res.emplace_back(i);\n }\n return res;\n }\n\n bool unite(int x, int y) {\n x = root(x), y = root(y);\n if (x == y) return false;\n if (data[x] > data[y]) std::swap(x, y);\n data[x] += data[y];\n data[y] = x;\n return true;\n }\n\n template <class F>\n bool unite(int x, int y, F f) {\n x = root(x), y = root(y);\n if (x != y) {\n if (data[x] > data[y]) std::swap(x, y);\n data[x] += data[y];\n data[y] = x;\n }\n f(x, y);\n return x != y;\n }\n\n private:\n std::vector<int> data;\n};\n#line 4 \"a.cpp\"\n\nint main(void) {\n int h, w;\n cin >> h >> w;\n vector a(h, vector(w, 0));\n cin >> a;\n\n auto in_field = [&](int x, int y) {\n return 0 <= x && x < h && 0 <= y && y < w;\n };\n union_find uf(h * w);\n vector<int> dx = {1, 0}, dy = {0, -1};\n int sz = 0;\n vector<int> ans(w - 1);\n rep (y, w - 1) {\n sz += h;\n rep (x, h) {\n rep (k, 2) {\n int nx = x + dx[k], ny = y + dy[k];\n if (!in_field(nx, ny))\n continue;\n if (a[x][y] == a[nx][ny])\n sz -= uf.unite(x * w + y, nx * w + ny);\n }\n }\n ans[y] += sz;\n }\n\n sz = 0;\n dy = {0, 1};\n uf = union_find(h * w);\n for (int y = w - 1; y >= 1; --y) {\n sz += h;\n rep (x, h) {\n rep (k, 2) {\n int nx = x + dx[k], ny = y + dy[k];\n if (!in_field(nx, ny))\n continue;\n if (a[x][y] == a[nx][ny])\n sz -= uf.unite(x * w + y, nx * w + ny);\n }\n }\n ans[y - 1] += sz;\n }\n\n co(*min_element(all(ans)));\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 20588,
"score_of_the_acc": -0.1745,
"final_rank": 1
},
{
"submission_id": "aoj_0761_8658840",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct UnionFind {\npublic:\n\tint N;\n\tvector<int> par;\n\tUnionFind() : N(0) {}\n\texplicit UnionFind(int n) : N(n), par(n, -1) {}\n\tint leader(int a) {\n\t\tif (par[a] < 0) return a;\n\t\treturn par[a] = leader(par[a]);\n\t}\n\tvoid merge(int a, int b) {\n\t\tint x = leader(a), y = leader(b);\n\t\tif (x == y) return;\n\t\tif (-par[x] < -par[y]) swap(x, y);\n\t\tpar[x] += par[y];\n\t\tpar[y] = x;\n\t}\n\tbool same(int a, int b) {\n\t\treturn leader(a) == leader(b);\n\t}\n\tint size(int a) {\n\t\treturn -par[leader(a)];\n\t}\n};\n\nint main() {\n int h, w;\n cin >> h >> w;\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 vector<int> l(w + 1);\n l[0] = 0;\n UnionFind uf1(h * w);\n for (int i = 0; i < w; i++) {\n l[i + 1] = l[i] + h;\n if (i)\n for (int j = 0; j < h; j++)\n if (a[j][i] == a[j][i - 1]) {\n uf1.merge(i * h + j, (i - 1) * h + j);\n l[i + 1]--;\n }\n for (int j = 0; j < h - 1; j++)\n if (a[j][i] == a[j + 1][i])\n if (!uf1.same(i * h + j, i * h + j + 1)) {\n uf1.merge(i * h + j, i * h + j + 1);\n l[i + 1]--;\n }\n }\n vector<int> r(w + 1);\n r[w] = 0;\n UnionFind uf2(h * w);\n for (int i = w - 1; i >= 0; i--) {\n r[i] = r[i + 1] + h;\n if (i < w - 1)\n for (int j = 0; j < h; j++)\n if (a[j][i] == a[j][i + 1]) {\n uf2.merge(i * h + j, (i + 1) * h + j);\n r[i]--;\n }\n for (int j = 0; j < h - 1; j++)\n if (a[j][i] == a[j + 1][i])\n if (!uf2.same(i * h + j, i * h + j + 1)) {\n uf2.merge(i * h + j, i * h + j + 1);\n r[i]--;\n }\n }\n int ans = h * w;\n for (int i = 1; i < w; i++)\n ans = min(ans, l[i] + r[i]);\n cout << ans << '\\n';\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 20636,
"score_of_the_acc": -0.3352,
"final_rank": 10
},
{
"submission_id": "aoj_0761_8445266",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define all(A) A.begin(),A.end()\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\n\nstruct dsu {\n public:\n dsu() : _n(0) {}\n dsu(int n) : _n(n), par_size(n, -1) {}\n\n int merge(int a, int b) {\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-par_size[x] < -par_size[y]) swap(x, y);\n par_size[x] += par_size[y];\n par_size[y] = x;\n return x;\n }\n int merge(pair<ll,ll> p) {\n int a=p.first;\n int b=p.second;\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-par_size[x] < -par_size[y]) swap(x, y);\n par_size[x] += par_size[y];\n par_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n return leader(a) == leader(b);\n }\n bool same(pair<ll,ll> p) {\n int a=p.first;\n int b=p.second;\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n if (par_size[a] < 0) return a;\n return par_size[a] = leader(par_size[a]);\n }\n\n int size(int a) {\n return -par_size[leader(a)];\n }\n\n vector<vector<int>> groups() {\n std::vector<int> leader_buf(_n), gr_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n gr_size[leader_buf[i]]++;\n }\n std::vector<vector<int>> res(_n);\n for (int i = 0; i < _n; i++) {\n res[i].reserve(gr_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n res[leader_buf[i]].push_back(i);\n }\n res.erase(\n remove_if(res.begin(), res.end(),\n [&](const vector<int>& v) { return v.empty(); }),\n res.end());\n return res;\n }\n private:\n int _n;\n vector<int> par_size;\n};\n\nvll dx={-1,0,1,0};\nvll dy={0,1,0,-1};\nint main() {\n ll H,W;\n cin>>H>>W;\n vvll A(H,vll(W));\n rep(h,H)rep(w,W)cin>>A[h][w];\n vvll L(2,vll(W-1,0));\n rep(k,2){\n dsu D(H*W);\n ll res=H;\n rep(h,H-1){\n if(A[h][0]==A[h+1][0]){\n D.merge(h*W,(h+1)*W);\n res--;\n }\n }\n L[k][0]=res;\n rep(w,W-2){\n res+=H;\n rep(h,H){\n if(A[h][w]==A[h][w+1]){\n res--;\n D.merge(h*W+w,h*W+w+1);\n }\n }\n rep(h,H-1){\n if(A[h][w+1]==A[h+1][w+1]){\n if(!D.same(h*W+w+1,(h+1)*W+w+1)){\n res--;\n D.merge(h*W+w+1,(h+1)*W+w+1);\n }\n }\n }\n L[k][w+1]=res;\n }\n rep(h,H)reverse(all(A[h]));\n }\n reverse(all(L[1]));\n ll an=1e18;\n rep(w,W-1)an=min(an,L[0][w]+L[1][w]);\n cout<<an<<endl;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 18812,
"score_of_the_acc": -0.3077,
"final_rank": 8
},
{
"submission_id": "aoj_0761_8184037",
"code_snippet": "#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(v) v.begin(),v.end()\ntypedef long long ll;\n \n#include<bits/stdc++.h>\nusing namespace std;\n\nclass Dis{\n public:\n vector<ll> rank,p,siz;\n \n Dis(int s){\n rank.resize(s,0);\n p.resize(s,0);\n siz.resize(s,1);\n rep(i,s) makeSet(i);\n }\n \n void makeSet(int x){\n p[x]=x;\n rank[x]=0;\n }\n \n bool same(int x,int y){\n return root(x)==root(y);\n }\n \n void unite(int x,int y){\n if(same(x,y)) return;\n link(root(x),root(y));\n }\n \n void link(int x,int y){\n if(rank[x]>rank[y]){\n p[y]=x;\n siz[x]+=siz[y];\n }\n else{\n p[x]=y;\n siz[y]+=siz[x];\n if(rank[x]==rank[y]) rank[y]++;\n }\n }\n \n int root(int x){\n if(x != p[x]) p[x]=root(p[x]);\n return p[x];\n }\n \n int size(int x){\n return siz[root(x)];\n }\n};\n \nint main(){\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n \n int h,w;\n cin>>h>>w;\n vector<vector<int>> A(h,vector<int>(w)),L(h,vector<int>(w)),R(h,vector<int>(w));\n rep(i,h) rep(j,w) cin>>A[i][j];\n Dis dsl=Dis(h*w),dsr=Dis(h*w);\n \n auto f=[&](int i,int j){\n return i*w+j;\n };\n \n rep(j,w){\n rep(i,h){\n if(i<h-1 && A[i][j]==A[i+1][j]) dsl.unite(f(i,j),f(i+1,j));\n if(j>0 && A[i][j]==A[i][j-1]) dsl.unite(f(i,j),f(i,j-1));\n }\n rep(i,h) L[i][j]=dsl.root(f(i,j));\n }\n for(int j=w-1;j>=0;j--){\n rep(i,h){\n if(i<h-1 && A[i][j]==A[i+1][j]) dsr.unite(f(i,j),f(i+1,j));\n if(j<w-1 && A[i][j]==A[i][j+1]) dsr.unite(f(i,j),f(i,j+1));\n }\n rep(i,h) R[i][j]=dsr.root(f(i,j));\n }\n \n int cnt=0;\n rep(i,h) rep(j,w){\n if(dsl.root(f(i,j))==f(i,j)) cnt++;\n }\n \n int mi=h+1;\n rep(j,w-1){\n set<pair<int,int>> s;\n rep(i,h){\n if(A[i][j]==A[i][j+1]) s.insert({L[i][j],R[i][j+1]});\n }\n mi=min(mi,(int)s.size());\n }\n cout<<cnt+mi<<endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 79260,
"score_of_the_acc": -1.18,
"final_rank": 11
},
{
"submission_id": "aoj_0761_8175007",
"code_snippet": "#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(v) v.begin(),v.end()\ntypedef long long ll;\n \n#include<bits/stdc++.h>\nusing namespace std;\n\nclass Dis{\n public:\n vector<ll> rank,p,siz;\n \n Dis(int s){\n rank.resize(s,0);\n p.resize(s,0);\n siz.resize(s,1);\n rep(i,s) makeSet(i);\n }\n \n void makeSet(int x){\n p[x]=x;\n rank[x]=0;\n }\n \n bool same(int x,int y){\n return root(x)==root(y);\n }\n \n void unite(int x,int y){\n if(same(x,y)) return;\n link(root(x),root(y));\n }\n \n void link(int x,int y){\n if(rank[x]>rank[y]){\n p[y]=x;\n siz[x]+=siz[y];\n }\n else{\n p[x]=y;\n siz[y]+=siz[x];\n if(rank[x]==rank[y]) rank[y]++;\n }\n }\n \n int root(int x){\n if(x != p[x]) p[x]=root(p[x]);\n return p[x];\n }\n \n int size(int x){\n return siz[root(x)];\n }\n};\n \nint main(){\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n \n int h,w;\n cin>>h>>w;\n vector<vector<int>> A(h,vector<int>(w));\n rep(i,h) rep(j,w) cin>>A[i][j];\n Dis ds=Dis(h*w);\n \n auto f=[&](int i,int j){\n return i*w+j;\n };\n \n rep(i,h) rep(j,w){\n if(i<h-1 && A[i][j]==A[i+1][j]) ds.unite(f(i,j),f(i+1,j));\n if(j<w-1 && A[i][j]==A[i][j+1]) ds.unite(f(i,j),f(i,j+1));\n }\n int cnt=0;\n rep(i,h) rep(j,w){\n if(ds.root(f(i,j))==f(i,j)) cnt++;\n }\n int mi=w+1;\n rep(j,w-1){\n set<int> s;\n rep(i,h){\n if(A[i][j]==A[i][j+1]) s.insert(ds.root(f(i,j)));\n }\n mi=min(mi,(int)s.size());\n }\n cout<<cnt+mi<<endl;\n\n return 0;\n}",
"accuracy": 0.3885350318471338,
"time_ms": 40,
"memory_kb": 16880,
"score_of_the_acc": -0.0985,
"final_rank": 14
},
{
"submission_id": "aoj_0761_7953627",
"code_snippet": "#include <bits/extc++.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) begin(x),end(x)\n#define Fixed fixed << setprecision(12)\n#define updiv(a, b) (((a) + (b) - 1) / (b))\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\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 T, class U> istream& operator>>(istream& is, pair<T, U>& p){ is >> p.first >> p.second; return (is); }\ntemplate<class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p){ os << p.first << ' ' << p.second; return (os); }\ntemplate<class T> istream& operator>>(istream& is, vector<T>& v){ for (auto &&e : v) is >> e; return (is); }\ntemplate<class T> ostream& operator<<(ostream& os, vector<T>& v){ for (auto &&e : v) os << e << ' '; return (os); }\n\ntemplate<class T> inline const T& max(const vector<T> &v) { return *max_element(v.begin(), v.end()); }\ntemplate<class T> inline const T& min(const vector<T> &v) { return *min_element(v.begin(), v.end()); }\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 max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T, vector<T>, greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A, B>;\ntemplate <class T> using uset = unordered_set<T>;\n\ntemplate <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;\ntemplate <class T> using Rope = __gnu_cxx::rope<T>;\nusing Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n\ntemplate <class T> void bye(T x){ cout << x << '\\n'; exit(0); }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1,0};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1,0};\n\nstruct UnionFind{\n int n;\n vector<int> data;\n\n UnionFind(int sz) : n(sz), data(sz, -1){}\n\n bool unite(int x, int y){\n x = find(x), y = find(y);\n if(x == y) return (false);\n if(data[x] > data[y]) swap(x, y);\n data[x] += data[y];\n data[y] = x;\n return (true);\n }\n\n int find(int k){\n if(data[k] < 0) return (k);\n return (data[k] = find(data[k]));\n }\n\n int size(int k){\n return (-data[find(k)]);\n }\n\n bool same(int x, int y){\n return (find(x) == find(y));\n }\n\n vector<vector<int> > groups(){\n vector<int> leader_buf(n), group_size(n);\n for(int i = 0; i < n; ++i){\n leader_buf[i] = find(i);\n group_size[leader_buf[i]]++;\n }\n vector<vector<int> > res(n);\n for(int i = 0; i < n; ++i){\n res[i].reserve(group_size[i]);\n }\n for(int i = 0; i < n; ++i){\n res[leader_buf[i]].emplace_back(i);\n }\n res.erase(\n remove_if(res.begin(), res.end(),\n [&](const vector<int>& v){ return (v.empty()); }),\n res.end());\n return (res);\n }\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 h, w;\n cin >> h >> w;\n \n assert(1 <= h);\n assert(2 <= w);\n assert(h * w <= 500000);\n\n vector<vector<int> > a(h, vector<int>(w));\n\n cin >> a;\n \n for (auto v : a) {\n for (auto e : v) {\n assert(1 <= e && e <= 1000000000);\n }\n }\n\n UnionFind uf(h * w);\n\n auto conv = [&](int r, int c) {\n return (r * w + c);\n };\n auto inside = [&](int r, int c) {\n return (0 <= r && r < h && 0 <= c && c < w);\n };\n\n vector<int> l(w), r(w);\n\n int cnt = 0;\n for (int j = 0; j < w; ++j) {\n cnt += h;\n for (int i = 0; i < h; ++i) {\n if (inside(i, j - 1) && a[i][j] == a[i][j - 1]) {\n cnt -= uf.unite(conv(i, j - 1), conv(i, j));\n }\n }\n for (int i = 0; i < h; ++i) {\n if (inside(i - 1, j) && a[i][j] == a[i - 1][j]) {\n cnt -= uf.unite(conv(i - 1, j), conv(i, j));\n }\n }\n l[j] = cnt;\n }\n\n uf = UnionFind(h * w);\n cnt = 0;\n\n for (int j = w - 1; j >= 0; --j) {\n cnt += h;\n for (int i = 0; i < h; ++i) {\n if (inside(i, j + 1) && a[i][j] == a[i][j + 1]) {\n cnt -= uf.unite(conv(i, j + 1), conv(i, j));\n }\n }\n for (int i = 0; i < h; ++i) {\n if (inside(i - 1, j) && a[i][j] == a[i - 1][j]) {\n cnt -= uf.unite(conv(i - 1, j), conv(i, j));\n }\n }\n r[j] = cnt;\n }\n\n int res = INF;\n\n for (int i = 0; i < w - 1; ++i) {\n chmin(res, l[i] + r[i + 1]);\n }\n\n // for (int i = 0; i < w; ++i) {\n // cout << l[i] << ' ';\n // }\n // cout << endl;\n // for (int i = 0; i < w; ++i) {\n // cout << r[i] << ' ';\n // }\n // cout << endl;\n\n cout << res << '\\n';\n\n return (0);\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 20632,
"score_of_the_acc": -0.1751,
"final_rank": 2
},
{
"submission_id": "aoj_0761_7888236",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\nenum Type{\n\tNORMAL,\n\tREV,\n};\nType type_array[2] = {NORMAL,REV};\n\n#define SIZE 500005\n\nint H,W;\nint ***table;\nint N;\nint boss[2][SIZE];\n\n\nint get_boss(Type type,int id){\n\tif(boss[type][id] == id)return id;\n\telse{\n\t\treturn boss[type][id] = get_boss(type,boss[type][id]);\n\t}\n}\n\nint isSame(Type type,int x,int y){\n\treturn get_boss(type,x) == get_boss(type,y);\n}\n\nvoid unite(Type type,int x,int y){\n\tint boss_x = get_boss(type,x);\n\tint boss_y = get_boss(type,y);\n\n\tif(boss_x == boss_y)return;\n\n\t//より番号が小さい方をボスとする\n\tif(boss_x < boss_y){\n\n\n\t\tboss[type][boss_y] = boss_x;\n\n\t}else{\n\n\t\tboss[type][boss_x] = boss_y;\n\t}\n}\n\nint getIndex(int row,int col){\n\n\treturn row+H*col;\n}\n\nint main(){\n\n\tscanf(\"%d %d\",&H,&W);\n\tN = H*W;\n\n\tfor(int i = 0; i < 2; i++){\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\tboss[i][k] = k;\n\t\t}\n\t}\n\n\ttable = new int**[2];\n\tfor(int i = 0; i < 2; i++){\n\n\t\ttable[i] = new int*[H];\n\t\tfor(int row = 0; row < H; row++){\n\n\t\t\ttable[i][row] = new int[W];\n\t\t}\n\t}\n\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tscanf(\"%d\",&table[NORMAL][row][col]);\n\t\t}\n\t}\n\n\tfor(int col = 0; col < W; col++){\n\t\tfor(int row = 0; row < H; row++){\n\n\t\t\ttable[REV][row][(W-1)-col] = table[NORMAL][row][col]; //左右反転した表を作る\n\t\t}\n\t}\n\n\t//あらかじめ縦方向にuniteしておく\n\tfor(int i = 0; i < 2; i++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tfor(int row = 0; row < H-1; row++){\n\n\t\t\t\tint a = getIndex(row,col);\n\t\t\t\tint b = getIndex(row+1,col);\n\n\t\t\t\tif(table[i][row][col] == table[i][row+1][col]){\n\n\t\t\t\t\tunite(type_array[i],a,b);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\n\tvector<int> V[2];\n\n\tfor(int i = 0; i < 2; i++){\n\n\t\t//左端の列のグループ数を数える\n\t\tset<int> SET;\n\t\tfor(int row = 0; row < H; row++){\n\n\t\t\tSET.insert(get_boss(type_array[i],getIndex(row,0)));\n\t\t}\n\n\t\tV[type_array[i]].push_back(SET.size());\n\n\t\t//境界をuniteする\n\t\tfor(int col = 1; col <= W-1; col++){\n\t\t\tfor(int row = 0; row < H; row++){\n\t\t\t\tif(table[i][row][col-1] == table[i][row][col]){\n\n\t\t\t\t\tint from = getIndex(row,col-1);\n\t\t\t\t\tint to = getIndex(row,col);\n\n\t\t\t\t\tint a = get_boss(type_array[i],from);\n\t\t\t\t\tint b = get_boss(type_array[i],to);\n\n\t\t\t\t\tSET.erase(a);\n\t\t\t\t\tSET.erase(b);\n\n\t\t\t\t\tunite(type_array[i],from,to);\n\n\t\t\t\t\tint c = get_boss(type_array[i],from);\n\t\t\t\t\tSET.insert(c);\n\t\t\t\t}\n\t\t\t}\n\t\t\t//uniteされなかった行のボスを集める\n\t\t\tfor(int row = 0; row < H; row++){\n\n\t\t\t\tint from = getIndex(row,col);\n\t\t\t\tint a = get_boss(type_array[i],from);\n\n\t\t\t\tSET.insert(a);\n\t\t\t}\n\t\t\tV[type_array[i]].push_back(SET.size());\n\t\t}\n\t}\n\n\treverse(V[REV].begin(),V[REV].end());\n\n\tint ans = BIG_NUM;\n\tfor(int col = 0; col < W-1; col++){\n\n\t\tchmin(ans,V[NORMAL][col]+V[REV][col+1]);\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 520,
"memory_kb": 50120,
"score_of_the_acc": -1.5602,
"final_rank": 13
},
{
"submission_id": "aoj_0761_7888235",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\nenum Type{\n\tNORMAL,\n\tREV,\n};\nType type_array[2] = {NORMAL,REV};\n\n#define SIZE 500005\n\nint H,W;\nint ***table;\nint N;\nint boss[2][SIZE];\n\n\nint get_boss(Type type,int id){\n\tif(boss[type][id] == id)return id;\n\telse{\n\t\treturn boss[type][id] = get_boss(type,boss[type][id]);\n\t}\n}\n\nint isSame(Type type,int x,int y){\n\treturn get_boss(type,x) == get_boss(type,y);\n}\n\nvoid unite(Type type,int x,int y){\n\tint boss_x = get_boss(type,x);\n\tint boss_y = get_boss(type,y);\n\n\tif(boss_x == boss_y)return;\n\n\t//より番号が小さい方をボスとする\n\tif(boss_x < boss_y){\n\n\n\t\tboss[type][boss_y] = boss_x;\n\n\t}else{\n\n\t\tboss[type][boss_x] = boss_y;\n\t}\n}\n\nint getIndex(int row,int col){\n\n\treturn row+H*col;\n}\n\nint main(){\n\n\tscanf(\"%d %d\",&H,&W);\n\tN = H*W;\n\n\tfor(int i = 0; i < 2; i++){\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\tboss[i][k] = k;\n\t\t}\n\t}\n\n\ttable = new int**[2];\n\tfor(int i = 0; i < 2; i++){\n\n\t\ttable[i] = new int*[H];\n\t\tfor(int row = 0; row < H; row++){\n\n\t\t\ttable[i][row] = new int[W];\n\t\t}\n\t}\n\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tscanf(\"%d\",&table[NORMAL][row][col]);\n\t\t}\n\t}\n\n\tfor(int col = 0; col < W; col++){\n\t\tfor(int row = 0; row < H; row++){\n\n\t\t\ttable[REV][row][(W-1)-col] = table[NORMAL][row][col]; //左右反転した表を作る\n\t\t}\n\t}\n\n\t//あらかじめ縦方向にuniteしておく\n\tfor(int i = 0; i < 2; i++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tfor(int row = 0; row < H-1; row++){\n\n\t\t\t\tint a = getIndex(row,col);\n\t\t\t\tint b = getIndex(row+1,col);\n\n\t\t\t\tif(table[i][row][col] == table[i][row+1][col]){\n\n\t\t\t\t\tunite(type_array[i],a,b);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\n\tvector<int> V[2];\n\n\tfor(int i = 0; i < 2; i++){\n\n\t\t//printf(\"\\n\\ni:%d\\n\",i);\n\n\t\t//左端の列のグループ数を数える\n\t\tset<int> SET;\n\t\tfor(int row = 0; row < H; row++){\n\n\t\t\tSET.insert(get_boss(type_array[i],getIndex(row,0)));\n\t\t}\n\n\t\tV[type_array[i]].push_back(SET.size());\n\n\t\t//printf(\"左端のグループ数:%lld\\n\",SET.size());\n\n\t\t//境界をuniteする\n\t\tfor(int col = 1; col <= W-1; col++){\n\t\t\tfor(int row = 0; row < H; row++){\n\t\t\t\tif(table[i][row][col-1] == table[i][row][col]){\n\n\t\t\t\t\tint from = getIndex(row,col-1);\n\t\t\t\t\tint to = getIndex(row,col);\n\n\t\t\t\t\tint a = get_boss(type_array[i],from);\n\t\t\t\t\tint b = get_boss(type_array[i],to);\n\n\t\t\t\t\tSET.erase(a);\n\t\t\t\t\tSET.erase(b);\n\n\t\t\t\t\tunite(type_array[i],from,to);\n\n\t\t\t\t\tint c = get_boss(type_array[i],from);\n\t\t\t\t\tSET.insert(c);\n\t\t\t\t}\n\t\t\t}\n\t\t\t//uniteされなかった行のボスを集める\n\t\t\tfor(int row = 0; row < H; row++){\n\n\t\t\t\tint from = getIndex(row,col);\n\t\t\t\tint a = get_boss(type_array[i],from);\n\n\t\t\t\tSET.insert(a);\n\t\t\t}\n\t\t\t//printf(\"col:%d グループ数:%lld\\n\",col,SET.size());\n\t\t\tV[type_array[i]].push_back(SET.size());\n\t\t}\n\t}\n\n\treverse(V[REV].begin(),V[REV].end());\n\n\tint ans = BIG_NUM;\n\tfor(int col = 0; col < W-1; col++){\n\n\t\tchmin(ans,V[NORMAL][col]+V[REV][col+1]);\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 510,
"memory_kb": 50032,
"score_of_the_acc": -1.5389,
"final_rank": 12
},
{
"submission_id": "aoj_0761_7848676",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstruct dsu {\n public:\n int csz;\n dsu() : _n(0) {}\n dsu(int n) : _n(n), csz(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 csz--;\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 ios::sync_with_stdio(false);\n cin.tie(0);\n int h, w;\n cin >> h >> w;\n vector<vector<int>> A(h, vector<int>(w));\n for(int y = 0; y < h; y++){\n for(int x = 0; x < w; x++){\n cin >> A[y][x];\n }\n }\n dsu uf(h * w);\n auto f = [&](int y, int x){return y * w + x; };\n vector<int> L(w);\n for(int x = 0; x + 1 < w; x++){\n if(x){\n for(int y = 0; y < h; y++){\n if(A[y][x] == A[y][x - 1])uf.merge(f(y, x), f(y, x - 1));\n }\n }\n for(int y = 1; y < h; y++){\n if(A[y][x] == A[y - 1][x])uf.merge(f(y, x), f(y - 1, x));\n }\n L[x] = uf.csz - h * (w - 1 - x);\n }\n uf = dsu(h * w);\n int ans = h * w;\n for(int x = w - 1; x >= 1; x--){\n if(x != w - 1){\n for(int y = 0; y < h; y++){\n if(A[y][x] == A[y][x + 1])uf.merge(f(y, x), f(y, x + 1));\n }\n }\n for(int y = 1; y < h; y++){\n if(A[y][x] == A[y - 1][x])uf.merge(f(y, x), f(y - 1, x));\n }\n ans = min(ans, L[x - 1] + uf.csz - h * x);\n }\n cout << ans << '\\n';\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 20668,
"score_of_the_acc": -0.1757,
"final_rank": 3
}
] |
aoj_0747_cpp
|
年齢の差 (Age Difference)
問題文
JOI 市には
1
から
N
までの番号が付けられた
N
人の住民がおり，住民
i
(
1 ≦ i ≦ N
) の年齢は
A
i
歳である．
JOI 市の住民の年齢
A
1
, A
2
, …, A
N
が与えられる．
i = 1, 2, …, N
に対して，住民
i
と他の住民との年齢の差の最大値を求めるプログラムを作成せよ．
制約
2 ≦ N ≦ 250 000
．
0 ≦ A
i
≦ 10
9
(
1 ≦ i ≦ N
)．
入力される値はすべて整数である．
入力
入力は以下の形式で与えられる．
N
A
1
A
2
…
A
N
出力
N
行出力せよ．
i
行目 (
1 ≦ i ≦ N
) には，住民
i
と他の住民との年齢の差の最大値を出力せよ．
入出力例
入力例 1
3
13 15 20
出力例 1
7
5
7
住民
1
と住民
2, 3
との年齢の差はそれぞれ
2, 7
歳である．これらの最大値は
7
歳であるから，
1
行目には
7
を出力する．
住民
2
と住民
1, 3
との年齢の差はそれぞれ
2, 5
歳である．これらの最大値は
5
歳であるから，
2
行目には
5
を出力する．
住民
3
と住民
1, 2
との年齢の差はそれぞれ
7, 5
歳である．これらの最大値は
7
歳であるから，
3
行目には
7
を出力する．
入力例 2
2
100 100
出力例 2
0
0
住民
1
と住民
2
との年齢の差は
0
歳である．したがって，
1
行目には
0
を出力する．
住民
2
と住民
1
との年齢の差は
0
歳である．したがって，
2
行目には
0
を出力する．
入力例 3
10
440894064 101089692 556439322 34369336 98417847 216265879 623843484 554560874 247445405 718003331
出力例 3
406524728
616913639
522069986
683633995
619585484
501737452
589474148
520191538
470557926
683633995
情報オリンピック日本委員会
作 『第 22 回日本情報オリンピック JOI 2022/2023 二次予選競技課題』
|
[
{
"submission_id": "aoj_0747_10879938",
"code_snippet": "//NOAC 25..\n#include <bits/stdc++.h>\n\n#define endl \"\\n\"\n#define sline cout << endl\n#define ll long long\n#define ull unsigned long long\n#define fi int i =\n#define fj int j =\n\nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector <ll> A(N);\n ull sum = 0;\n for (fi 0; i < N; i++) {\n cin >> A[i];\n sum += A[i];\n }\n\n ull ave = sum / N;\n vector <ll> ans(N);\n int Amax = *max_element(A.begin(), A.end());\n int Amin = *min_element(A.begin(), A.end());\n\n for (fi 0; i < N; i++) {\n /*\n if (A[i] >= ave) {\n ans[i] = A[i] - min;\n }\n else {\n ans[i] = max - A[i];\n }\n */\n ans[i] = max(A[i] - Amin, Amax - A[i]);\n }\n\n for (fi 0; i < N; i++) {\n cout << ans[i] << endl;\n }\n\nreturn 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 7024,
"score_of_the_acc": -1.1389,
"final_rank": 12
},
{
"submission_id": "aoj_0747_10844438",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nint N;\nlong long A[250010];\nlong long B[250010];\n\nint main()\n{\n cin >> N;\n for (int i = 0; i < N; i++)\n cin >> A[i];\n for (int i = 0; i < N; i++)\n B[i] = A[i];\n\n sort(A, A + N);\n for (int i = 0; i < N; i++) {\n long long max_number = max(abs(B[i] - A[0]), abs(B[i] - A[N - 1]));\n cout << max_number << endl;\n }\n \n \n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 7228,
"score_of_the_acc": -1.8462,
"final_rank": 20
},
{
"submission_id": "aoj_0747_10749876",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include<string>\n#include<stack>\n#include<cmath>\nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector<int>A(N);\n for (int i = 0; i < N; i++) {\n cin >> A[i];\n }\n int Amax = *max_element(A.begin(), A.end());\n int Amin = *min_element(A.begin(), A.end());\n for (int i : A) {\n if (abs(i - Amax) > abs(i - Amin)) {\n cout << abs(i - Amax) << endl;\n }\n else {\n cout << abs(i - Amin) << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 4028,
"score_of_the_acc": -0.9315,
"final_rank": 6
},
{
"submission_id": "aoj_0747_10557828",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n\nint main()\n{\n int N;\n std::cin >> N;\n std::vector<int> age(N);\n\n int min = 1000000000, max = 0;\n for (int i = 0; i < N; i++) {\n std::cin >> age[i];\n if (min > age[i])\n min = age[i];\n if (max < age[i])\n max = age[i];\n }\n\n int diff1, diff2;\n for (int i = 0; i < N; i++) {\n diff1 = max - age[i];\n diff2 = age[i] - min;\n if (diff1 < diff2)\n std::cout << diff2 << std::endl;\n else\n std::cout << diff1 << std::endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 4096,
"score_of_the_acc": -0.9493,
"final_rank": 8
},
{
"submission_id": "aoj_0747_10329938",
"code_snippet": "#include <iostream>\n#include <set>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\nint main(){\n int n;\n cin >> n;\n vector<int> a(n);\n rep(i,n) cin >> a[i];\n\n vector<int> b=a;\n sort(b.begin(),b.end());\n \n rep(i,n) {\n cout << max(b[n-1]-a[i],a[i]-b[0]) << endl;\n }\n return 0;\n\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 4960,
"score_of_the_acc": -1.214,
"final_rank": 16
},
{
"submission_id": "aoj_0747_10063102",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int n, m = 1000000007, M =0;\n cin >> n;\n vector<int> a(n);\n for(int i=0;i<n;i++){\n cin >> a[i];\n M = max(M,a[i]);\n m = min(m,a[i]);\n }\n \n for(int i=0;i<n;i++){\n cout << max(M-a[i],a[i]-m) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 4136,
"score_of_the_acc": -0.9598,
"final_rank": 9
},
{
"submission_id": "aoj_0747_10026671",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long INF = 1LL << 60;\nconst int inf = 1<<30;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\n//a:97, A:65\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\nconst double PI = acos(-1);\ntypedef string::const_iterator State;//構文解析用\n\nint main(){\n int n; cin >> n;\n vector<int> a(n),s(n);\n for(int i=0;i<n;i++){\n cin >> a[i];\n s[i]=a[i];\n }\n\n sort(a.begin(),a.end());\n int mi=a[0],mi2=a[0],mx=a[n-1],mx2=a[n-1];\n for(int i=0;i<n;i++) if(a[i]!=mi2){\n mi2=a[i];\n break;\n }\n for(int i=n-1;i>=0;i--) if(a[i]!=mx2){\n mx2=a[i];\n break;\n }\n \n for(int i=0;i<n;i++) cout << max(max(abs(s[i]-mi),abs(s[i]-mi2)), max(abs(s[i]-mx),abs(s[i]-mx2))) << endl;\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 4956,
"score_of_the_acc": -1.2129,
"final_rank": 15
},
{
"submission_id": "aoj_0747_9990845",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int,int> P;\n#define REP(i,n) for(int i=0;i<int(n);i++)\n\n\n\n\n\nint main(void){\n\tcin.tie(nullptr); ios_base::sync_with_stdio(false);\n\tint i,j;\n\n\n\tint N;\n\tcin >> N;\n\tvector<P> a(N);\n\tREP(i,N){\n\t\tint x;\n\t\tcin >> x;\n\t\ta[i]=P(x,i);\n\t}\n\n\n\tsort(a.begin(),a.end());\n\n\tvector<int> b(N);\n REP(i,N){\n\t\tint d=max(a[i].first-a[0].first,a[N-1].first-a[i].first);\n\t\tb[a[i].second]=d;\n\t}\n\n\n REP(i,N) cout << b[i] << endl;\n\n\n\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 5988,
"score_of_the_acc": -1.3677,
"final_rank": 18
},
{
"submission_id": "aoj_0747_9773798",
"code_snippet": "#include <stdio.h>\n#include <stdlib.h>\n#include <limits.h>\n\nint max(int a,int b);\nint max_num(int *age,int num);\nint min_num(int *age,int num);\n\nint main(void){\n int n;\n scanf(\"%d\",&n);\n int *age;\n age = (int*)malloc(sizeof(int) * n);\n for(int i=0;i<n;i++){\n scanf(\"%d\",&age[i]);\n }\n int age_max = max_num(age,n);\n int age_min = min_num(age,n);\n for(int i=0;i<n;i++){\n printf(\"%d\\n\",max(age_max-age[i],age[i]-age_min));\n }\n free(age);\n}\n\nint max_num(int *age,int num){\n int max = INT_MIN;\n for(int i=0;i<num;i++){\n if(max < age[i]){\n max = age[i];\n }\n }\n return max;\n}\nint min_num(int *age,int num){\n int min = INT_MAX;\n for(int i=0;i<num;i++){\n if(min > age[i]){\n min = age[i];\n }\n }\n return min;\n}\nint max(int a,int b){\n if(a > b){\n return a;\n }else{\n return b;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3408,
"score_of_the_acc": -0.0385,
"final_rank": 1
},
{
"submission_id": "aoj_0747_9740940",
"code_snippet": "#include <bits/stdc++.h>\n\nint main()\n{\n int N, min = 1e9, max = 0;\n std::cin >> N;\n std::vector<int> A(N);\n for (auto &a : A) {\n std::cin >> a;\n min = std::min(a, min);\n max = std::max(a, max);\n }\n for (const auto &a : A) {\n std::cout << std::max(a - min, max - a) << std::endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 4088,
"score_of_the_acc": -0.9472,
"final_rank": 7
},
{
"submission_id": "aoj_0747_9737276",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nsigned main() {\n int n;\n cin >> n;\n vector<int> a(n), b(n);\n for (auto &x : a) cin >> x;\n b = a;\n sort(b.begin(), b.end());\n for (int i = 0; i < n; i++) cout << max(a[i] - b[0], b[n - 1] - a[i]) << '\\n';\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 4884,
"score_of_the_acc": -0.5787,
"final_rank": 5
},
{
"submission_id": "aoj_0747_9737271",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nsigned main() {\n int n;\n cin >> n;\n vector<pair<int, int>> a(n), b(n);\n for (int i = 0; i < n; i++) cin >> a[i].first, a[i].second = i;\n b = a;\n sort(b.begin(), b.end());\n for (int i = 0; i < n; i++) {\n if (a[i].second == b[0].second) {\n cout << abs(b[n - 1].first - a[i].first) << '\\n';\n } else if (a[i].second == b[n - 1].second) {\n cout << abs(b[0].first - a[i].first) << '\\n';\n } else {\n cout << max(abs(b[0].first - a[i].first), abs(b[n - 1].first - a[i].first)) << '\\n';\n }\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 7036,
"score_of_the_acc": -1.1805,
"final_rank": 14
},
{
"submission_id": "aoj_0747_9696266",
"code_snippet": "#include <stdio.h>\n\nint main (){\n\tint N;\n\n\t\n\tscanf(\"%d\", &N);\n\t\tint age[N];\n\t\n\tfor (int i = 0 ; i < N; i++){\n\t\tscanf(\"%d\", &age[i]);\n\t\t\n\t}\n\t\n\tint max_age = age[0];\n\tint min_age = age[0];\n\t\n\tfor ( int i = 0 ; i < N ;i++){\n\t\tif ( age[i]>max_age){\n\t\t\tmax_age = age[i];\n\t\t}\n\t\telse if (age[i]<min_age){\n\t\t\tmin_age = age[i];\n\t\t}\n\t}\n\tfor ( int i = 0 ; i<N ; i++){\n\t\tint max_difference = (age[i]- min_age) > (max_age - age[i]) ? (age[i]- min_age) : (max_age - age[i]) ;\n\t\tprintf(\"%d\\n\", max_difference);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3744,
"score_of_the_acc": -0.1264,
"final_rank": 2
},
{
"submission_id": "aoj_0747_9681387",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#ifdef LOCAL\n #include \"settings/debug.cpp\"\n#else\n #define Debug(...) void(0)\n#endif\n#define rep(i, n) for (int i = 0; i < (n); ++i)\nusing ll = long long;\nusing ull = unsigned long long;\n\nint main() {\n int n;\n cin >> n;\n vector<int> a(n);\n rep(i, n) cin >> a[i];\n auto b = a;\n sort(b.begin(), b.end());\n rep(i, n) {\n cout << max(b.back() - a[i], a[i] - b.front()) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 5248,
"score_of_the_acc": -0.9817,
"final_rank": 11
},
{
"submission_id": "aoj_0747_9662724",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\nint main(){\n int n;cin>>n;\n vector<long long>a(n);\n REP(i,n)cin>>a[i];\n auto b=a;\n sort(a.begin(),a.end());\n REP(i,n){\n cout<<max(a.back()-b[i],b[i]-a[0])<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 7036,
"score_of_the_acc": -1.7574,
"final_rank": 19
},
{
"submission_id": "aoj_0747_9654769",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\n\nint main(void)\n{\n int n{};\n std::cin >> n;\n std::vector<int> a(n);\n for (int i{0}; i < n; ++i)\n {\n std::cin >> a[i];\n }\n\n auto [min_it, max_it] = std::minmax_element(a.begin(), a.end());\n\n for (int i{0}; i < n; ++i)\n {\n std::cout << std::max(a[i] - *min_it, *max_it - a[i]) << '\\n';\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 4124,
"score_of_the_acc": -0.3413,
"final_rank": 4
},
{
"submission_id": "aoj_0747_9643795",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm> // max_element, min_element\nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n \n vector<long long> A(N);\n \n // 年齢の入力を受け取る\n for (int i = 0; i < N; i++) {\n cin >> A[i];\n }\n \n // 年齢の最大値と最小値を計算する\n long long max_age = *max_element(A.begin(), A.end());\n long long min_age = *min_element(A.begin(), A.end());\n \n // 各住民の年齢差の最大値を出力\n for (int i = 0; i < N; i++) {\n // 自分自身を除くため、min_age もしくは max_age との差の最大値を取る\n long long max_diff = max(abs(A[i] - max_age), abs(A[i] - min_age));\n cout << max_diff << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 4908,
"score_of_the_acc": -1.1619,
"final_rank": 13
},
{
"submission_id": "aoj_0747_9580255",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n\nint main() {\n // 入力\n ll N;\n cin >> N;\n vector<ll> A(N);\n for (ll i = 0; i < N; i++) cin >> A[i];\n\n // 計算\n ll minA = A[0], maxA = A[0];\n for (ll i = 1; i < N; i++) {\n minA = min(minA, A[i]);\n maxA = max(maxA, A[i]);\n }\n\n // 出力\n for (ll i = 0; i < N; i++)\n cout << max(abs(A[i] - minA), abs(A[i] - maxA)) << endl;\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 280,
"memory_kb": 4668,
"score_of_the_acc": -1.3298,
"final_rank": 17
},
{
"submission_id": "aoj_0747_9561241",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing namespace std;\nusing ll = long long;\nusing vc = vector<int>;\nusing vvc = vector<vector<int>>;\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\nconst long long INF = 1LL << 60;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n int n;\n int ans = 999999999;\n cin >> n;\n vc a(n);\n\n for (int i = 0; i < n; ++i) { cin >> a[i]; }\n\n int an = *max_element(a.begin(), a.end());\n int bn = *min_element(a.begin(), a.end());\n\n for (int i = 0; i < n; ++i)\n {\n ans = max(abs(a[i] - an), abs(a[i] - bn));\n cout << ans << \"\\n\";\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4128,
"score_of_the_acc": -0.1885,
"final_rank": 3
},
{
"submission_id": "aoj_0747_9543203",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint main(){\n int n; cin >> n;\n vector<int> a(n);\n int ma = 0, mi = 1e9;\n for(int i = 0; i < n; i++){\n cin >> a[i];\n if(mi > a[i]){\n mi = a[i];\n }\n if(ma < a[i]){\n ma = a[i];\n }\n }\n for(int i = 0; i < n; i++){\n cout << max(ma - a[i], a[i] - mi) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 4140,
"score_of_the_acc": -0.9609,
"final_rank": 10
}
] |
aoj_0778_cpp
|
庭園 2 (Garden 2)
問題文
JOI 庭園は縦
N
行，横
N
列のマス目状に区切られた正方形の形をしている．
上から
i
行目 (
1 ≦ i ≦ N
)，左から
j
列目 (
1 ≦ j ≦ N
) のマスは区画
(i, j)
と呼ばれている．
JOI 庭園は土壌にあまり恵まれていないため，各区画には特定の
1
種類の色の花を，
最大
1
本しか植えることができない．
具体的には，区画
(i, j)
には
A
i, j
=
R
のとき赤，
A
i, j
=
Y
のとき黄，
A
i, j
=
B
のとき青の色の花を最大
1
本しか植えることができない．
ここで，この庭園の管理者である K 理事長は，航空写真を撮った時の見栄えを良くするため，次の手順で花を植えようと思っている．
大きさ
を表す整数
r
を決める．ただし
0 ≦ r ≦ (N-1) ÷ 2
を満たさなければならない．
中心
を表す区画
(x, y)
を決める．ただし
r+1 ≦ x ≦ N-r
，
r+1 ≦ y ≦ N-r
を満たさなければならない．
色
c
0
, c
1
, c
2
, …, c
r
をそれぞれ赤・黄・青の中から選んで決める．
それぞれの区画
(x', y')
について，
d = |x'-x| + |y'-y|
に応じて以下の規則で花を植える．ただし，
|t|
は
t
の絶対値を表す．
d ≦ r
であるならば，区画
(x', y')
には色
c
d
の花を植える．
d > r
であるならば，区画
(x', y')
には花を植えない．
庭園の大きさ，各区画に植えることができる花の色の情報が与えられたとき，K 理事長が植えることができる花の数の最大値を求めるプログラムを作成せよ．
制約
3 ≦ N ≦ 3 500
．
A
i, j
は
R
，
Y
，
B
のいずれかである (
1 ≦ i ≦ N, 1 ≦ j ≦ N
)．
N
は整数である．
入力
入力は以下の形式で与えられる．
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
出力
K 理事長が植えることができる花の数の最大値を
1
行で出力せよ．
入出力例
入力例 1
3
RYR
YBY
BYY
出力例 1
5
r = 1
，
(x, y) = (2, 2)
とし，
c
0
として青，
c
1
として黄を選ぶと，下図のように
5
本の花を植えることができる．ただし，背景色は各区画に植えることができる花の色を示している．
6
本以上の花を植える方法は存在しないため，
5
を出力する．
入力例 2
9
YYRYBBBYR
BYYRRBYBB
RBRRBRBBY
RYRBRYRBR
YYBRYYYRB
RRYBRYRBR
RBYRBRBRB
BRYYRBBBR
RBBBYBRRY
出力例 2
25
r = 3
，
(x, y) = (5, 6)
とし，
c
0
として黄，
c
1
として黄，
c
2
として赤，
c
3
として青を選ぶと，下図のように
25
本の花を植えることができる．ただし，背景色は各区画に植えることができる花の色を示している．
26
本以上の花を植える方法は存在しないため，
25
を出力する．
入力例 3
6
RBYRBY
BYRBYR
YRBYRB
RBYRBY
BYRBYR
YRBYRB
出力例 3
1
入力例 4
20
RRRRRRRRRRRRRRRRRRRR
RRRRRRRRRRRRRRRRRRRR
RRRRBRRRRRRRRRRRRYRR
RRRRRRRRRRRRRRRRRRRR
RRRRRRRRRRRRRRRRRRRR
RRRRRRRRRRRRRRRRRRRR
RRRRRRRRRRRYRRRRRRRR
RRRRRRRRRRRRRRRRRRRR
RRRRRRRRRRRRRRRRRRRR
RRRRRRRRRRRRRRRRRRRR
RRRRRRRRRRRRRRRRRRRR
RRRRRYRRRRRRRRRRRRRR
RRRRRRRRRRRRRRRRRRRR
RRRRRRRRRRRRRRRRRRRR
RRRRRRRRRRRRRRRRRRBR
RRRRRRRRRRRRRRRRRRRR
RRRRRRRRRRRRRRRRRRRR
RRRRRRRRRRRRRRRRRRRR
RRRRRRRRRRRRRRRRRRRR
RRRRRRRRRRRRRRRRRRRR
出力例 4
85
入力例 5
10
RRRRRRRRRR
RYRRRRRRRR
RRRRYRRRRR
RBRRRRRRRR
RRRRRRRRYR
RBRRRRRRRR
RRRRBRRRRR
RBRRRRRRRR
RRRRRRRRYR
RRRRRRRRRR
出力例 5
25
情報オリンピック日本委員会
作 『第 23 回日本情報オリンピック (JOI 2023/2024) 二次予選競技課題』
|
[
{
"submission_id": "aoj_0778_10827791",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int MAXN = 3505;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int N;\n cin >> N;\n\n vector<string> A(N + 2, string(N + 2, '#')); // 1-indexed, 周囲を番兵で埋める\n\n for (int r = 1; r <= N; r++) {\n string s;\n cin >> s;\n for (int c = 1; c <= N; c++) {\n A[r][c] = s[c - 1];\n }\n }\n\n vector<vector<int>> dp1(N + 2, vector<int>(N + 2, 0));\n vector<vector<int>> dp2(N + 2, vector<int>(N + 2, 0));\n vector<vector<int>> dp3(N + 2, vector<int>(N + 2, 0));\n vector<vector<int>> dp4(N + 2, vector<int>(N + 2, 0));\n\n // 左上\n for (int r = 1; r <= N; r++) {\n for (int c = 1; c <= N; c++) {\n if (A[r][c] != A[r + 1][c - 1]) dp1[r][c] = 0;\n else dp1[r][c] = min(dp1[r - 1][c], dp1[r][c - 1]) + 1;\n }\n }\n\n // 左下\n for (int r = N; r > 0; r--) {\n for (int c = 1; c <= N; c++) {\n if (A[r][c] != A[r + 1][c + 1]) dp2[r][c] = 0;\n else dp2[r][c] = min(dp2[r + 1][c], dp2[r][c - 1]) + 1;\n }\n }\n\n // 右上\n for (int r = 1; r <= N; r++) {\n for (int c = N; c >= 1; c--) {\n if (A[r][c] != A[r - 1][c - 1]) dp3[r][c] = 0;\n else dp3[r][c] = min(dp3[r - 1][c], dp3[r][c + 1]) + 1;\n }\n }\n\n // 右下\n for (int r = N; r > 0; r--) {\n for (int c = N; c >= 1; c--) {\n if (A[r][c] != A[r - 1][c + 1]) dp4[r][c] = 0;\n else dp4[r][c] = min(dp4[r + 1][c], dp4[r][c + 1]) + 1;\n }\n }\n\n int ans = 0;\n for (int r = 2; r < N; r++) {\n for (int c = 2; c < N; c++) {\n int t = dp1[r - 1][c];\n t = min(t, dp2[r][c - 1]);\n t = min(t, dp3[r][c + 1]);\n t = min(t, dp4[r + 1][c]);\n t = min({t, r - 1, c - 1, N - r, N - c});\n ans = max(ans, t);\n }\n }\n\n cout << 1 + 2 * ans * (ans + 1) << \"\\n\";\n return 0;\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 207616,
"score_of_the_acc": -0.0533,
"final_rank": 3
},
{
"submission_id": "aoj_0778_10265308",
"code_snippet": "// AOJ #778 Garden 2\n// 2025.3.4\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cins(char t[]) { // 文字列の入力 スペース以下の文字で入力終了\n char *s = t;\n\tdo *s = gc();\n\twhile (*s++ > ' ');\n\t*(s-1) = 0;\n}\n\nvoid Cout(int n) { // 整数の表示（出力）\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint r = 0; while (n) b[r++] = n % 10 + '0', n /= 10;\n\t\twhile (r--) pc(b[r]);\n\t}\n\tpc('\\n');\n}\n\nvoid chmin(int &a, int b) { if (a > b) a = b; }\nvoid chmax(int &a, int b) { if (a < b) a = b; }\n\nconst int MAXN = 3505;\nint dp1[MAXN][MAXN];\nint dp2[MAXN][MAXN];\nint dp3[MAXN][MAXN];\nint dp4[MAXN][MAXN];\nchar A[MAXN][MAXN];\n\nint main() {\n int N = Cin();\n\tfor (int r = 1; r <= N; r++) Cins(A[r]+1);\n\n\tfor (int r = 1; r <= N; r++) {\n\t\tfor (int c = 1; c <= N; c++) {\n\t\t\tif (A[r][c] != A[r + 1][c - 1]) dp1[r][c] = 0;\n\t\t\telse dp1[r][c] = min(dp1[r - 1][c], dp1[r][c - 1]) + 1;\n\t\t}\n\t}\n\n\tfor (int r = N; r > 0; r--) {\n\t\tfor (int c = 1; c <= N; c++) {\n\t\t\tif (A[r][c] != A[r + 1][c + 1]) dp2[r][c] = 0;\n\t\t\telse dp2[r][c] = min(dp2[r + 1][c], dp2[r][c - 1]) + 1;\n\t\t}\n\t}\n\n\tfor (int r = 1; r <= N; r++) {\n\t\tfor (int c = N; c >= 1; c--) {\n\t\t\tif (A[r][c] != A[r - 1][c - 1]) dp3[r][c] = 0;\n\t\t\telse dp3[r][c] = min(dp3[r - 1][c], dp3[r][c + 1]) + 1;\n\t\t}\n\t}\n\n\tfor (int r = N; r > 0; r--) {\n\t\tfor (int c = N; c >= 1; c--) {\n\t\t\tif (A[r][c] != A[r - 1][c + 1]) dp4[r][c] = 0;\n\t\t\telse dp4[r][c] = min(dp4[r + 1][c], dp4[r][c + 1]) + 1;\n\t\t}\n\t}\n\tint ans = 0;\n\tfor (int r = 2; r < N; r++) {\n\t\tfor (int c = 2; c < N; c++) {\n\t\t\tint t = dp1[r - 1][c];\n\t\t\tchmin(t, dp2[r][c - 1]);\n\t\t\tchmin(t, dp3[r][c + 1]);\n\t\t\tchmin(t, dp4[r + 1][c]);\n\t\t\tchmin(t, min({ r - 1, c - 1, N - r, N - c }));\n\t\t\tchmax(ans, t);\n\t\t}\n\t}\n\tCout(1+2*ans*(ans+1));\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 207328,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_0778_10265305",
"code_snippet": "// AOJ #778 Garden 2\n// 2025.3.4\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cins(char t[]) { // 文字列の入力 スペース以下の文字で入力終了\n char *s = t;\n\tdo *s = gc();\n\twhile (*s++ > ' ');\n\t*(s-1) = 0;\n}\n\nvoid Cout(int n) { // 整数の表示（出力）\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint r = 0; while (n) b[r++] = n % 10 + '0', n /= 10;\n\t\twhile (r--) pc(b[r]);\n\t}\n\tpc('\\n');\n}\n\nvoid chmin(int &a, int b) { if (a > b) a = b; }\nvoid chmax(int &a, int b) { if (a < b) a = b; }\n\nconst int MAXN = 3505;\nint dp1[MAXN][MAXN];\nint dp2[MAXN][MAXN];\nint dp3[MAXN][MAXN];\nint dp4[MAXN][MAXN];\nchar A[MAXN][MAXN];\n\nint main() {\n int N = Cin();\n\tfor (int r = 1; r <= N; r++) Cins(A[r]+1);\n\n\tfor (int r = 1; r <= N; r++) {\n\t\tfor (int c = 1; c <= N; c++) {\n\t\t\tif (A[r][c] != A[r + 1][c - 1]) dp1[r][c] = 0;\n\t\t\tif (A[r][c] == A[r + 1][c - 1]) dp1[r][c] = min(dp1[r - 1][c], dp1[r][c - 1]) + 1;\n\t\t}\n\t}\n\n\tfor (int r = N; r > 0; r--) {\n\t\tfor (int c = 1; c <= N; c++) {\n\t\t\tif (A[r][c] != A[r + 1][c + 1]) dp2[r][c] = 0;\n\t\t\tif (A[r][c] == A[r + 1][c + 1]) dp2[r][c] = min(dp2[r + 1][c], dp2[r][c - 1]) + 1;\n\t\t}\n\t}\n\n\tfor (int r = 1; r <= N; r++) {\n\t\tfor (int c = N; c >= 1; c--) {\n\t\t\tif (A[r][c] != A[r - 1][c - 1]) dp3[r][c] = 0;\n\t\t\tif (A[r][c] == A[r - 1][c - 1]) dp3[r][c] = min(dp3[r - 1][c], dp3[r][c + 1]) + 1;\n\t\t}\n\t}\n\n\tfor (int r = N; r > 0; r--) {\n\t\tfor (int c = N; c >= 1; c--) {\n\t\t\tif (A[r][c] != A[r - 1][c + 1]) dp4[r][c] = 0;\n\t\t\tif (A[r][c] == A[r - 1][c + 1]) dp4[r][c] = min(dp4[r + 1][c], dp4[r][c + 1]) + 1;\n\t\t}\n\t}\n\n\tint ans = 0;\n\tfor (int r = 2; r < N; r++) {\n\t\tfor (int c = 2; c < N; c++) {\n\t\t\tint t = dp1[r - 1][c];\n\t\t\tchmin(t, dp2[r][c - 1]);\n\t\t\tchmin(t, dp3[r][c + 1]);\n\t\t\tchmin(t, dp4[r + 1][c]);\n\t\t\tchmin(t, min({ r - 1, c - 1, N - r, N - c }));\n\t\t\tchmax(ans, t);\n\t\t}\n\t}\n\tCout(1+2*ans*(ans+1));\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 207324,
"score_of_the_acc": -0.0127,
"final_rank": 2
},
{
"submission_id": "aoj_0778_10129605",
"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\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n;\n cin >> n;\n vector<vector<char>> s(n + 2, vector<char>(n + 2, '.'));\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n cin >> s[i + 1][j + 1];\n }\n }\n vector<vector<int>> dp1(n + 2, vector<int>(n + 2, 0)), dp2(n + 2, vector<int>(n + 2, 0));\n vector<vector<int>> dp3(n + 2, vector<int>(n + 2, 0)), dp4(n + 2, vector<int>(n + 2, 0));\n for (int i = 1; i <= n; ++i) {\n for (int j = n; j >= 1; j--) {\n if (s[i][j] == s[i - 1][j - 1]) {\n dp1[i][j] = min(dp1[i - 1][j], dp1[i][j + 1]) + 1;\n }\n }\n }\n for (int i = 1; i <= n; ++i) {\n for (int j = 1; j <= n; ++j) {\n if (s[i][j] == s[i + 1][j - 1]) {\n dp2[i][j] = min(dp2[i - 1][j], dp2[i][j - 1]) + 1;\n }\n }\n }\n for (int i = n; i >= 1; --i) {\n for (int j = 1; j <= n; ++j) {\n if (s[i][j] == s[i + 1][j + 1]) {\n dp3[i][j] = min(dp3[i + 1][j], dp3[i][j - 1]) + 1;\n }\n }\n }\n for (int i = n; i >= 1; --i) {\n for (int j = n; j >= 1; --j) {\n if (s[i][j] == s[i - 1][j + 1]) {\n dp4[i][j] = min(dp4[i + 1][j], dp4[i][j + 1]) + 1;\n }\n }\n }\n\n ll res = 1;\n for (int i = 1; i <= n; ++i) {\n for (int j = 1; j <= n; ++j) {\n ll x = 1e9;\n x = min(x, (ll)dp1[i][j + 1] + 1);\n x = min(x, (ll)dp2[i - 1][j] + 1);\n x = min(x, (ll)dp3[i][j - 1] + 1);\n x = min(x, (ll)dp4[i + 1][j] + 1);\n res = max(res, 2LL * x * (x + 1) - 4 * x + 1);\n }\n }\n cout << res << endl;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 207400,
"score_of_the_acc": -0.1273,
"final_rank": 4
},
{
"submission_id": "aoj_0778_10118912",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\nusing vll=vector<ll>;\nusing vvll=vector<vll>;\n#define rep(i,s,t) for(ll i=s;i<t;i++)\n\n\n\nint main(){\n ll N;\n cin>>N;\n vector<vector<char>> S(N,vector<char>(N));\n rep(i,0,N){\n string T;\n cin>>T;\n rep(j,0,N){\n S[i][j]=T[j];\n }\n }\n vvll DP(N+1,vll(N+1,1e18));\n rep(i,0,N)rep(j,0,N){\n DP[i][j]=min({i+1,j+1,N-i,N-j});\n }\n rep(t,0,4){\n vvll SP(N+1,vll(N+1,0));\n rep(i,0,N){\n rep(j,0,N){\n if(i==N-1||j==0){\n SP[i+1][j+1]=0;\n }\n else if(S[i+1][j-1]!=S[i][j]){\n SP[i+1][j+1]=0;\n }\n else{\n SP[i+1][j+1]=min(SP[i][j+1],SP[i+1][j])+1;\n }\n DP[i][j]=min(DP[i][j],SP[i][j+1]);\n }\n }\n\n vvll NDP(N,vll(N));\n vector<vector<char>> NS(N,vector<char>(N));\n rep(i,0,N)rep(j,0,N){\n NDP[i][j]=DP[j][N-1-i];\n NS[i][j]=S[j][N-i-1];\n }\n swap(NDP,DP);\n swap(NS,S);\n\n }\n ll an=1;\n rep(i,0,N)rep(j,0,N){\n ll d=DP[i][j];\n an=max(an,2*d*d+2*d+1);\n }\n cout<<an<<endl;\n}",
"accuracy": 1,
"time_ms": 980,
"memory_kb": 314904,
"score_of_the_acc": -2,
"final_rank": 5
}
] |
aoj_0748_cpp
|
ジョイ四人組 (JOI04)
問題文
JOI 中学校には
4N
人の一年生が在籍しており，
4
つのクラスに分かれている．各クラスの情報は以下の通りである．
1 年 A 組：
N
人の生徒がいる．それぞれの生徒の身長は
A
1
, A
2
, …, A
N
である．
1 年 B 組：
N
人の生徒がいる．それぞれの生徒の身長は
B
1
, B
2
, …, B
N
である．
1 年 C 組：
N
人の生徒がいる．それぞれの生徒の身長は
C
1
, C
2
, …, C
N
である．
1 年 D 組：
N
人の生徒がいる．それぞれの生徒の身長は
D
1
, D
2
, …, D
N
である．
来月，JOI 中学校では体育祭が開催されることになった．体育祭には，リレー，騎馬戦，棒倒しなどの様々な種目があるが，各学年が踊るダンスは「体育祭の華」とも呼ばれる注目の種目である．
ここで一年生は，各クラスから代表を
1
人ずつ選び，
4
人でダンスをすることになった．ダンスの見栄えをできるだけ良くするため，身長の差ができるだけ小さくなるように
4
人組を選ぶことにした．
一年生の身長が与えられるとき，「
4
人の身長の最大値」と「
4
人の身長の最小値」の差として考えられる最小の値を求めるプログラムを作成せよ．
制約
1 ≦ N ≦ 75000
．
1 ≦ A
i
≦ 10
9
(
1 ≦ i ≦ N
)．
1 ≦ B
j
≦ 10
9
(
1 ≦ j ≦ N
)．
1 ≦ C
k
≦ 10
9
(
1 ≦ k ≦ N
)．
1 ≦ D
l
≦ 10
9
(
1 ≦ l ≦ N
)．
入力される値はすべて整数である．
入力
入力は以下の形式で与えられる．
N
A
1
A
2
…
A
N
B
1
B
2
…
B
N
C
1
C
2
…
C
N
D
1
D
2
…
D
N
出力
「
4
人の身長の最大値」と「
4
人の身長の最小値」の差として考えられる最小の値を
1
行で出力せよ．
入出力例
入力例 1
1
169
173
152
200
出力例 1
48
N = 1
なので，全員の生徒を選んで
4
人組を作らなければならない．このとき，
4
人の身長の最大値は
200
，最小値は
152
となり，その差は
200 - 152 = 48
である．よって，
48
を出力する．
入力例 2
7
7 9 9 4 6 3 5
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
出力例 2
2
入力例 3
7
1 1 1 1 2 1 1
1 2 1 1 1 1 1
1 1 1 1 2 1 1
1 1 1 1 1 1 2
出力例 3
0
入力例 4
5
287 690 413 420 138
813 873 223 415 907
261 330 361 747 787
958 672 544 126 345
出力例 4
70
入力例 5
10
1682 2008 1135 1576 2450 1362 1518 1925 2212 1275
1993 1945 1312 1401 2027 1705 1086 2333 1787 1654
2257 1548 1219 1031 2613 2171 1866 1532 2800 1497
1062 1175 1984 1870 2059 1639 2107 1335 1289 2494
出力例 5
79
情報オリンピック日本委員会
作 『第 22 回日本情報オリンピック JOI 2022/2023 二次予選競技課題』
|
[
{
"submission_id": "aoj_0748_10882878",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include<utility>\n#include<set>\n#include<deque>\n#include <unordered_map>\n#include<string>\n#include<map>\n#include<cmath>\n\nusing namespace std;\n\n\nconst long long INF = 1LL << 60;\nint main() {\n\tint N;\n\tcin >> N;\n\tvector<vector<long long>>A(4, vector<long long>(N, 0));\n\tfor (int i = 0; i < 4; i++) {\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tcin >> A[i][j];\n\t\t}\n\t\tA[i].push_back(INF);\n\t\tsort(A[i].begin(), A[i].end());\n\t}\n\t\n\tlong long ans = INF;\n\tfor (int i = 0; i < 4; i++) {\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tlong long a = A[i][j];\n\n\t\t\tlong long ka = 0;\n\t\t\tfor (int o = 0; o < 4; o++) {\n\t\t\t\tlong long m = *lower_bound(A[o].begin(), A[o].end(), a);\n\t\t\t\t\n\t\t\t\tka = max(ka, m - a);\n\n\t\t\t}\n\t\t\tans = min(ans,ka);\n\t\t}\n\n\n\t}\n\t\n\tcout << ans << endl;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 6084,
"score_of_the_acc": -1.3557,
"final_rank": 19
},
{
"submission_id": "aoj_0748_10556592",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nstruct Student {\n char grp;\n int height;\n};\n\nbool comp(const Student& a, const Student& b) {\n if (a.height == b.height)\n return a.grp < b.grp;\n else\n return a.height < b.height;\n}\n\nint main()\n{\n int N;\n std::cin >> N;\n std::vector<Student> ST(4 * N);\n\n for (int i = 0; i < N; i++) {\n ST[i].grp = 'A';\n std::cin >> ST[i].height;\n }\n for (int i = 0; i < N; i++) {\n ST[N + i].grp = 'B';\n std::cin >> ST[N + i].height;\n }\n for (int i = 0; i < N; i++) {\n ST[2 * N + i].grp = 'C';\n std::cin >> ST[2 * N + i].height;\n }\n for (int i = 0; i < N; i++) {\n ST[3 * N + i].grp = 'D';\n std::cin >> ST[3 * N + i].height;\n }\n\n std::sort(ST.begin(), ST.end(), comp);\n\n int ans = 1000000009;\n int cnt_A = 0, cnt_B = 0, cnt_C = 0, cnt_D = 0;\n int diff;\n int i = 0;\n for (int j = 0; j < 4 * N; j++) {\n if (ST[j].grp == 'A')\n ++cnt_A;\n else if (ST[j].grp == 'B')\n ++cnt_B;\n else if (ST[j].grp == 'C')\n ++cnt_C;\n else\n ++cnt_D;\n while (j - i >= 3 && cnt_A > 0 && cnt_B > 0 && cnt_C > 0 && cnt_D > 0) {\n diff = ST[j].height - ST[i].height;\n if (diff < ans)\n ans = diff;\n if (ST[i].grp == 'A')\n --cnt_A;\n else if (ST[i].grp == 'B')\n --cnt_B;\n else if (ST[i].grp == 'C')\n --cnt_C;\n else\n --cnt_D;\n ++i;\n }\n }\n\n std::cout << ans << std::endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 5364,
"score_of_the_acc": -0.8788,
"final_rank": 16
},
{
"submission_id": "aoj_0748_10339292",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\nint main(){\n int n;\n cin >> n;\n vector<int> a(n),b(n),c(n),d(n);\n rep(i,n){\n cin >> a[i];\n }\n rep(i,n){\n cin >> b[i];\n }\n rep(i,n){\n cin >> c[i];\n }\n rep(i,n){\n cin >> d[i];\n }\n sort(a.begin(),a.end());\n sort(b.begin(),b.end());\n sort(c.begin(),c.end());\n sort(d.begin(),d.end());\n\n int res=INT_MAX;\n int i=0,j=0,k=0,l=0;\n while(i<n && j<n && k<n && l<n){\n int curmax=max({a[i],b[j],c[k],d[l]});\n int curmin=min({a[i],b[j],c[k],d[l]});\n res = min(res,curmax-curmin);\n if(curmin==a[i]){\n i++;\n }\n else if(curmin==b[j]){\n j++;\n }\n else if(curmin==c[k]){\n k++;\n }\n else{\n l++;\n }\n }\n cout << res << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 4348,
"score_of_the_acc": -0.5651,
"final_rank": 11
},
{
"submission_id": "aoj_0748_10027159",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst long long INF = 1LL << 60;\nconst int inf = 1<<30;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\n//a:97, A:65\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\nconst double PI = acos(-1);\ntypedef string::const_iterator State;//構文解析用\n\nint main(){\n int n; cin >> n;\n vector<pair<int,int>> p;\n for(int i=0;i<n;i++){\n int a; cin >> a;\n p.push_back({a,1});\n }\n for(int i=0;i<n;i++){\n int a; cin >> a;\n p.push_back({a,2});\n }\n for(int i=0;i<n;i++){\n int a; cin >> a;\n p.push_back({a,3});\n }\n for(int i=0;i<n;i++){\n int a; cin >> a;\n p.push_back({a,4});\n }\n\n n*=4;\n sort(p.begin(),p.end());\n int a=0,b=0,c=0,d=0,ans=inf;\n while(a<n||b<n||c<n||d<n){ // 4*75000 = 3*10^5\n while(a<n&&p[a].second!=1) a++;\n while(b<n&&p[b].second!=2) b++;\n while(c<n&&p[c].second!=3) c++;\n while(d<n&&p[d].second!=4) d++;\n\n int mx=max(max(p[a].first,p[b].first),max(p[c].first,p[d].first));\n int mi=min(min(p[a].first,p[b].first),min(p[c].first,p[d].first));\n ans=min(ans,mx-mi);\n if(a<n&&mi==p[a].first) a++;\n else if(b<n&&mi==p[b].first) b++;\n else if(c<n&&mi==p[c].first) c++;\n else if(d<n) d++;\n else break;\n //cout << a << \" \" << b << \" \" << c << \" \" << d << endl;\n }\n\n cout << ans << endl;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 9316,
"score_of_the_acc": -1.5556,
"final_rank": 20
},
{
"submission_id": "aoj_0748_9742234",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int N;\n std::cin >> N;\n std::vector<int> A(N), B(N), C(N), D(N);\n for (auto &a : A) std::cin >> a;\n for (auto &b : B) std::cin >> b;\n for (auto &c : C) std::cin >> c;\n for (auto &d : D) std::cin >> d;\n std::sort(A.begin(), A.end());\n std::sort(B.begin(), B.end());\n std::sort(C.begin(), C.end());\n std::sort(D.begin(), D.end());\n int min_diff = 2e9;\n size_t i = 0, j = 0, k = 0, l = 0;\n while (i < A.size() && j < B.size() && k < C.size() && l < D.size()) {\n int min_height = std::min({A[i], B[j], C[k], D[l]});\n int max_height = std::max({A[i], B[j], C[k], D[l]});\n min_diff = std::min(min_diff, max_height - min_height);\n if (min_height == A[i]) i++;\n else if (min_height == B[j]) j++;\n else if (min_height == C[k]) k++;\n else l++;\n }\n std::cout << min_diff << std::endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 4392,
"score_of_the_acc": -0.0183,
"final_rank": 1
},
{
"submission_id": "aoj_0748_9701795",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#ifdef LOCAL\n #include \"settings/debug.cpp\"\n#else\n #define Debug(...) void(0)\n#endif\n#define rep(i, n) for (int i = 0; i < (n); ++i)\nusing ll = long long;\nusing ull = unsigned long long;\n\nint main() {\n int n;\n cin >> n;\n vector<int> a(n), b(n), c(n), d(n);\n rep(i, n) cin >> a[i];\n rep(i, n) cin >> b[i];\n rep(i, n) cin >> c[i];\n rep(i, n) cin >> d[i];\n sort(a.begin(), a.end());\n sort(b.begin(), b.end());\n sort(c.begin(), c.end());\n sort(d.begin(), d.end());\n int ans = 2e9;\n rep(i, n) {\n vector<int> w = { a[i] }, x, y, z;\n for (auto&& [arr, cand] : vector<pair<vector<int>&, vector<int>&>> { { b, x }, { c, y }, { d, z } }) {\n auto it = lower_bound(arr.begin(), arr.end(), a[i]);\n if (it != arr.end()) cand.push_back(*it);\n if (it != arr.begin()) cand.push_back(*prev(it));\n }\n Debug(w, x, y, z);\n for (auto&& wi : w)\n for (auto&& xi : x)\n for (auto&& yi : y)\n for (auto&& zi : z) {\n ans = min(ans, max({ wi, xi, yi, zi }) - min({ wi, xi, yi, zi }));\n }\n }\n cout << ans << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 4480,
"score_of_the_acc": -0.4803,
"final_rank": 8
},
{
"submission_id": "aoj_0748_9662740",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\nint main(){\n int n;cin>>n;\n vector<vector<ll>>a(4,vector<ll>(n));\n REP(i,4)REP(j,n)cin>>a[i][j];\n REP(i,4)sort(a[i].begin(),a[i].end());\n ll ans=1e18;\n REP(i,4)REP(j,n){\n ll s=0;\n REP(k,4){\n auto it=lower_bound(a[k].begin(),a[k].end(),a[i][j]);\n if(it==a[k].end())s=1e18;\n else s=max(s,*it);\n }\n ans=min(ans,s-a[i][j]);\n }\n cout<<ans<<endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 6052,
"score_of_the_acc": -1.3493,
"final_rank": 18
},
{
"submission_id": "aoj_0748_9658839",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <limits>\n#include <vector>\n\nstd::vector<int> read_and_sort_vector(const int n) {\n std::vector<int> res(n);\n for (int i{0}; i < n; ++i) {\n std::cin >> res[i];\n }\n std::sort(res.begin(), res.end());\n\n return res;\n}\n\nint main(void) {\n int n{};\n std::cin >> n;\n const auto a{read_and_sort_vector(n)}, b{read_and_sort_vector(n)},\n c{read_and_sort_vector(n)}, d{read_and_sort_vector(n)};\n\n int ib{0}, ic{0}, id{0}, min_range_size{std::numeric_limits<int>::max()};\n for (int ia{0}; ia < n; ++ia) {\n while (ib + 1 < n && b[ib] < a[ia]) ++ib;\n while (ic + 1 < n && c[ic] < a[ia]) ++ic;\n while (id + 1 < n && d[id] < a[ia]) ++id;\n\n const std::vector<int> candidates_b = {b[std::max(ib - 1, 0)], b[ib]};\n const std::vector<int> candidates_c = {c[std::max(ic - 1, 0)], c[ic]};\n const std::vector<int> candidates_d = {d[std::max(id - 1, 0)], d[id]};\n\n for (const int vb : candidates_b) {\n for (const int vc : candidates_c) {\n for (const int vd : candidates_d) {\n const std::vector<int> v{a[ia], vb, vc, vd};\n const auto [min_it, max_it] =\n std::minmax_element(v.begin(), v.end());\n\n min_range_size =\n std::min(min_range_size, *max_it - *min_it);\n }\n }\n }\n }\n\n std::cout << min_range_size << std::endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 4300,
"score_of_the_acc": -0.5556,
"final_rank": 9
},
{
"submission_id": "aoj_0748_9643819",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <climits>\n\nusing namespace std;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n \n int N;\n cin >> N;\n \n // 4つのクラスの身長を格納するベクター\n vector<long long> A(N), B(N), C(N), D(N);\n \n for(int i=0; i<N; i++) cin >> A[i];\n for(int i=0; i<N; i++) cin >> B[i];\n for(int i=0; i<N; i++) cin >> C[i];\n for(int i=0; i<N; i++) cin >> D[i];\n \n // 各クラスをソート\n sort(A.begin(), A.end());\n sort(B.begin(), B.end());\n sort(C.begin(), C.end());\n sort(D.begin(), D.end());\n \n // 各クラスのポインタを初期化\n int i=0, j=0, k=0, l=0;\n long long min_diff = LLONG_MAX;\n \n while(i < N && j < N && k < N && l < N){\n // 現在の4つの値を取得\n long long current_A = A[i];\n long long current_B = B[j];\n long long current_C = C[k];\n long long current_D = D[l];\n \n // 現在の最大値と最小値を計算\n long long current_max = max({current_A, current_B, current_C, current_D});\n long long current_min = min({current_A, current_B, current_C, current_D});\n \n // 差を計算し、最小差を更新\n long long diff = current_max - current_min;\n if(diff < min_diff){\n min_diff = diff;\n }\n \n // 最小値を持つクラスのポインタを進める\n if(current_min == current_A){\n i++;\n }\n else if(current_min == current_B){\n j++;\n }\n else if(current_min == current_C){\n k++;\n }\n else{ // current_min == current_D\n l++;\n }\n }\n \n // 最終的な結果を出力\n cout << min_diff << endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 5428,
"score_of_the_acc": -0.2249,
"final_rank": 4
},
{
"submission_id": "aoj_0748_9561334",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing namespace std;\nusing ll = long long;\nusing vc = vector<int>;\nusing vvc = vector<vector<int>>;\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\nconst long long INF = 1LL << 60;\n\nint N;\nint A[75009], B[75009], C[75009], D[75009];\n\nint solve(int LIMIT) {\n\tint pos1 = lower_bound(A + 1, A + N + 1, LIMIT) - A;\n\tint pos2 = lower_bound(B + 1, B + N + 1, LIMIT) - B;\n\tint pos3 = lower_bound(C + 1, C + N + 1, LIMIT) - C;\n\tint pos4 = lower_bound(D + 1, D + N + 1, LIMIT) - D;\n\tif (pos1 == N + 1 || pos2 == N + 1 || pos3 == N + 1 || pos4 == N + 1) return 2000000000;\n\treturn max({ A[pos1], B[pos2], C[pos3], D[pos4] });\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n\tcin >> N;\n\tfor (int i = 1; i <= N; i++) cin >> A[i];\n\tfor (int i = 1; i <= N; i++) cin >> B[i];\n\tfor (int i = 1; i <= N; i++) cin >> C[i];\n\tfor (int i = 1; i <= N; i++) cin >> D[i];\n\n\t// 驟榊�繧偵た繝ｼ繝�\n\tsort(A + 1, A + N + 1);\n\tsort(B + 1, B + N + 1);\n\tsort(C + 1, C + N + 1);\n\tsort(D + 1, D + N + 1);\n\n\t// 豎ｺ繧∵遠縺｡蜈ｨ謗｢邏｢\n\tint Answer = 2000000000;\n\tfor (int i = 1; i <= N; i++) Answer = min(Answer, solve(A[i]) - A[i]);\n\tfor (int i = 1; i <= N; i++) Answer = min(Answer, solve(B[i]) - B[i]);\n\tfor (int i = 1; i <= N; i++) Answer = min(Answer, solve(C[i]) - C[i]);\n\tfor (int i = 1; i <= N; i++) Answer = min(Answer, solve(D[i]) - D[i]);\n\n\t// 蜃ｺ蜉�\n\tcout << Answer << endl;\n\treturn 0;\n\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 4600,
"score_of_the_acc": -0.3931,
"final_rank": 5
},
{
"submission_id": "aoj_0748_9561304",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing namespace std;\nusing ll = long long;\nusing vc = vector<int>;\nusing vvc = vector<vector<int>>;\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\nconst long long INF = 1LL << 60;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n\tunsigned int N, i[4], j, max, min = 0, Min = UINT_MAX;\n\tcin >> N;\n\n\tvector<unsigned int> S[4] = { vector<unsigned int>(N), vector<unsigned int>(N), vector<unsigned int>(N), vector<unsigned int>(N) };\n\tfor (j = 0; j != 4; ++j)\n\t{\n\t\tfor (i[j] = 0; i[j] != N; ++i[j]) cin >> S[j][i[j]];\n\t\tstable_sort(S[j].begin(), S[j].end());\n\t}\n\n\tfor (i[0] = i[1] = i[2] = i[3] = 0; i[min] != N; ++i[min])\n\t{\n\t\tmax = 0, min = 0;\n\t\tfor (j = 1; j != 4; ++j)\n\t\t{\n\t\t\tif (S[j][i[j]] < S[min][i[min]]) min = j;\n\t\t\tif (S[j][i[j]] > S[max][i[max]]) max = j;\n\t\t}\n\n\t\tif (S[max][i[max]] - S[min][i[min]] < Min) Min = S[max][i[max]] - S[min][i[min]];\n\t}\n\n\tcout << Min << '\\n';\n\treturn 0;\n\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 4432,
"score_of_the_acc": -0.0263,
"final_rank": 3
},
{
"submission_id": "aoj_0748_9462988",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <climits>\n\nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n\n vector<vector<int>> classes(4, vector<int>(N));\n\n // 入力を読み込む\n for (int i = 0; i < 4; i++) {\n for (int j = 0; j < N; j++) {\n cin >> classes[i][j];\n }\n }\n\n // 各クラスの身長をソート\n for (int i = 0; i < 4; i++) {\n sort(classes[i].begin(), classes[i].end());\n }\n\n int min_diff = INT_MAX;\n int a = 0, b = 0, c = 0, d = 0;\n\n while (a < N && b < N && c < N && d < N) {\n int min_height = min({classes[0][a], classes[1][b], classes[2][c], classes[3][d]});\n int max_height = max({classes[0][a], classes[1][b], classes[2][c], classes[3][d]});\n \n min_diff = min(min_diff, max_height - min_height);\n\n if (classes[0][a] == min_height) a++;\n else if (classes[1][b] == min_height) b++;\n else if (classes[2][c] == min_height) c++;\n else d++;\n }\n\n cout << min_diff << endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 4668,
"score_of_the_acc": -0.6289,
"final_rank": 12
},
{
"submission_id": "aoj_0748_9189035",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <limits>\n\nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n\n vector<int> A(N), B(N), C(N), D(N);\n for (int i = 0; i < N; ++i) cin >> A[i];\n for (int i = 0; i < N; ++i) cin >> B[i];\n for (int i = 0; i < N; ++i) cin >> C[i];\n for (int i = 0; i < N; ++i) cin >> D[i];\n\n // 各リストをソート\n sort(A.begin(), A.end());\n sort(B.begin(), B.end());\n sort(C.begin(), C.end());\n sort(D.begin(), D.end());\n\n // 4-way merge setup\n vector<int> indices(4, 0);\n int min_diff = numeric_limits<int>::max();\n\n while (indices[0] < N && indices[1] < N && indices[2] < N && indices[3] < N) {\n // 現在の4クラスの生徒の身長を取得\n int currentA = A[indices[0]];\n int currentB = B[indices[1]];\n int currentC = C[indices[2]];\n int currentD = D[indices[3]];\n\n // 最小値と最大値を見つける\n int min_height = min({currentA, currentB, currentC, currentD});\n int max_height = max({currentA, currentB, currentC, currentD});\n\n // 差を更新\n min_diff = min(min_diff, max_height - min_height);\n\n // 最小値を持つインデックスを進める\n if (min_height == currentA) {\n indices[0]++;\n } else if (min_height == currentB) {\n indices[1]++;\n } else if (min_height == currentC) {\n indices[2]++;\n } else {\n indices[3]++;\n }\n }\n\n cout << min_diff << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 4300,
"score_of_the_acc": -0.5556,
"final_rank": 9
},
{
"submission_id": "aoj_0748_8976606",
"code_snippet": "#include <iostream>\n#include <climits>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n{\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\tunsigned int N, i[4], j, max, min = 0, Min = UINT_MAX;\n\tcin >> N;\n\n\tvector<unsigned int> S[4] = { vector<unsigned int>(N), vector<unsigned int>(N), vector<unsigned int>(N), vector<unsigned int>(N) };\n\tfor (j = 0; j != 4; ++j)\n\t{\n\t\tfor (i[j] = 0; i[j] != N; ++i[j]) cin >> S[j][i[j]];\n\t\tstable_sort(S[j].begin(), S[j].end());\n\t}\n\n\tfor (i[0] = i[1] = i[2] = i[3] = 0; i[min] != N; ++i[min])\n\t{\n\t\tmax = 0, min = 0;\n\t\tfor (j = 1; j != 4; ++j)\n\t\t{\n\t\t\tif (S[j][i[j]] < S[min][i[min]]) min = j;\n\t\t\tif (S[j][i[j]] > S[max][i[max]]) max = j;\n\t\t}\n\n\t\tif (S[max][i[max]] - S[min][i[min]] < Min) Min = S[max][i[max]] - S[min][i[min]];\n\t}\n\n\tcout << Min << '\\n';\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 4392,
"score_of_the_acc": -0.0183,
"final_rank": 1
},
{
"submission_id": "aoj_0748_8880847",
"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> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\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 if (x < 0) { cout << (i64)(x); }\n else { cout << (u64)(x); }\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer(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 M = 4;\n ll N;\n cin >> N;\n vv(ll, A, M, N);\n rep(i, M) {\n rep(j, N) cin >> A[i][j];\n sort(all(A[i]));\n }\n ll ans = inf;\n rep(i, M) {\n rep(j, N) {\n vi t(4);\n rep(k, M) {\n t[k] = A[k][min((ll)LB(A[k], A[i][j]), N-1)];\n }\n chmin(ans, MAX(t)-MIN(t));\n }\n }\n print(ans);\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 5992,
"score_of_the_acc": -0.7818,
"final_rank": 13
},
{
"submission_id": "aoj_0748_8378281",
"code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0748.cc: ジョイ四人組 (JOI04)\n */\n\n#include<cstdio>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 75000;\nconst int MAX_N4 = MAX_N * 4;\nconst int INF = 1 << 30;\n\n/* typedef */\n\n/* global variables */\n\nint as[MAX_N], bs[MAX_N], cs[MAX_N], ds[MAX_N];\nint xs[MAX_N4];\n\n/* subroutines */\n\nvoid readv(int n, int as[], int &m) {\n for (int i = 0; i < n; i++)\n scanf(\"%d\", as + i), xs[m++] = as[i];\n sort(as, as + n);\n}\n\n/* main */\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n\n int m = 0;\n readv(n, as, m);\n readv(n, bs, m);\n readv(n, cs, m);\n readv(n, ds, m);\n\n sort(xs, xs + m);\n m = unique(xs, xs + m) - xs;\n\n int mind = INF;\n for (int i = 0, ai = 0, bi = 0, ci = 0, di = 0; i < m; i++) {\n while (ai < n && as[ai] < xs[i]) ai++;\n if (ai >= n) break;\n while (bi < n && bs[bi] < xs[i]) bi++;\n if (bi >= n) break;\n while (ci < n && cs[ci] < xs[i]) ci++;\n if (ci >= n) break;\n while (di < n && ds[di] < xs[i]) di++;\n if (di >= n) break;\n\n int maxv = max(max(as[ai], bs[bi]), max(cs[ci], ds[di]));\n mind = min(mind, maxv - xs[i]);\n }\n\n printf(\"%d\\n\", mind);\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 5284,
"score_of_the_acc": -0.4184,
"final_rank": 7
},
{
"submission_id": "aoj_0748_8280582",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int INF=(1<<30)-1;\n\nint func(int key,vector<int> &A,vector<int> &B,vector<int> &C,vector<int> &D){\n int N=A.size();\n int idx1=lower_bound(A.begin(),A.end(),key)-A.begin();\n int idx2=lower_bound(B.begin(),B.end(),key)-B.begin();\n int idx3=lower_bound(C.begin(),C.end(),key)-C.begin();\n int idx4=lower_bound(D.begin(),D.end(),key)-D.begin();\n if(idx1==N or idx2==N or idx3==N or idx4==N) return INF*2;\n return max({A[idx1],B[idx2],C[idx3],D[idx4]});\n}\n\nint main(){\n\n int N; cin >> N;\n vector<int> A(N),B(N),C(N),D(N);\n for(int i=0;i<N;i++) cin >> A[i];\n for(int i=0;i<N;i++) cin >> B[i];\n for(int i=0;i<N;i++) cin >> C[i];\n for(int i=0;i<N;i++) cin >> D[i];\n\n sort(A.begin(),A.end());\n sort(B.begin(),B.end());\n sort(C.begin(),C.end());\n sort(D.begin(),D.end());\n\n int ans=INF*2;\n \n for(int i=0;i<N;i++){\n int minval=A[i];\n int maxval=func(minval,A,B,C,D);\n ans=min(ans,maxval-minval);\n }\n for(int i=0;i<N;i++){\n int minval=B[i];\n int maxval=func(minval,A,B,C,D);\n ans=min(ans,maxval-minval);\n }\n for(int i=0;i<N;i++){\n int minval=C[i];\n int maxval=func(minval,A,B,C,D);\n ans=min(ans,maxval-minval);\n }\n for(int i=0;i<N;i++){\n int minval=D[i];\n int maxval=func(minval,A,B,C,D);\n ans=min(ans,maxval-minval);\n }\n\n cout << ans << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 4340,
"score_of_the_acc": -1.008,
"final_rank": 17
},
{
"submission_id": "aoj_0748_8274640",
"code_snippet": "#include<iostream>\n#include<string>\n#include<string.h>\n#include<algorithm>\n#include<vector>\n#include<tuple>\n#include<math.h>\n#include<numeric>\n#include<set>\n#include <climits>\n#include<map>\n#include<stack>\n#include<queue>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\n//int a, b, c;\nvoid swap(int* p, int* q) {\n int t = *p;\n *p = *q;\n *q = t;\n}\nld you(ld x1, ld y1, ld x2, ld y2) {\n return (ld)sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n}\nint wa(int n) {\n int sum = 0;\n while (n > 0) {\n sum += n % 10;\n n /= 10;\n }\n return sum;\n //自作関数 wa で各桁の和を求める。\n}\nll sinsu(string s, ll k) { // K 進法表記の S を、10 進法表記で表す関数\n ll ans = 0;\n for (char x : s) {\n ans *= k;\n ans += x - '0';\n }\n return ans;\n}\nvector<ll> enumdiv(ll n) {\n vector<ll> S;\n for (int i = 1; 1LL * i * i <= n; i++) {\n if (n % i == 0) {\n S.push_back(i);\n if (i * i != n) {\n S.push_back(n / i);\n }\n }\n }\n sort(S.begin(), S.end());\n return S;\n //約数をlong long 型のvectorでsortして返す \n //auto A = などで受け取って A.size() で約数の数を出す。\n}\nbool IsPrime(int num)\n{\n if (num < 2) return false;\n else if (num == 2) return true;\n else if (num % 2 == 0) return false; // 偶数はあらかじめ除く\n double sqrtNum = sqrt(num);\n for (int i = 3; i <= sqrtNum; i += 2)\n {\n if (num % i == 0)\n {\n // 素数ではない\n return false;\n }\n }\n // 素数である\n return true;\n}\nint MM(int k) {\n int sum = 1;\n for (int i = 1; i <= k; ++i)\n {\n sum *= i;\n }\n return sum;\n}//階上計算\nvector<pair<long long, long long> > prime_factorize(long long N) {\n vector<pair<long long, long long> > res;\n for (long long a = 2; a * a <= N; ++a) {\n if (N % a != 0) continue;\n long long ex = 0; // 指数\n\n // 割れる限り割り続ける\n while (N % a == 0) {\n ++ex;\n N /= a;\n }\n\n // その結果を push\n res.push_back({ a, ex });\n }\n\n // 最後に残った数について\n if (N != 1) res.push_back({ N, 1 });\n return res;\n}\nusing Graph = vector<vector<int>>;\n/*#define ALL(box) (box).begin(),(box).end()\n#define ALL(box2) (box2).begin(),(box2).end()\n#define ALL(boxa) (boxa).begin(),(boxa).end()\n#define ALL(boxb) (boxb).begin(),(boxb).end()\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(box) (box).begin(),(box).end()\n//sort(box.begin(), box.end());\n//sort(box.rbegin(), box.rend());\n//vector<vector<int>> box( a , vector<int>( a ));\n//printf(\"%.7Lf\", n);\n//reverse(t.begin(), t.end());\n//auto It = upper_bound(ALL(box), n); \n//cout << box.end() - It ; 末尾までの距離\n//cout << It - a.begin() ; 先頭までの距離\n//auto It =box.upper_bound( k);set,multiset\n\nll sum = 0;\nll num = 0;\nint pum = 0;\nll mum = 0;\nint min1 = 2000000001;\nint max1 = -2;\nll min2 = 9223372036854775807;\nll max2 = -10000000000000000;\nll mod1 = 1000000007;\nll MOD = 998244353;\n//---------------------------------------------------------\nint kyori(int a, int b, int c, int d) {\n int p = max({ b,c,d });\n return abs(p - a);\n}\nint main() {\n \n int a;\n cin >> a;\n vector<int> A(a), B(a), C(a), D(a);\n rep(i, a) {\n cin >> A[i];\n }\n rep(i, a) {\n cin >> B[i];\n }\n rep(i, a) {\n cin >> C[i];\n }\n rep(i, a) {\n cin >> D[i];\n }\n A.push_back(2000000000);\n B.push_back(2000000000);\n C.push_back(2000000000);\n D.push_back(2000000000);\n sort(A.begin(), A.end());\n sort(B.begin(), B.end());\n sort(C.begin(), C.end());\n sort(D.begin(), D.end());\n\n //sort(ALL(B));\n rep(i, a) {\n int k = A[i];\n auto It = lower_bound(B.begin(),B.end(), k);\n auto It2 = lower_bound(C.begin(), C.end(), k);\n auto It3 = lower_bound(D.begin(), D.end(), k);\n min1 = min({ kyori(k,*It,*It2,*It3),min1 });\n //cout << min1 << \" \";\n }\n rep(i, a) {\n int k = B[i];\n auto It = lower_bound(A.begin(), A.end(), k);\n auto It2 = lower_bound(C.begin(), C.end(), k);\n auto It3 = lower_bound(D.begin(), D.end(), k);\n min1 = min({ kyori(k,*It,*It2,*It3),min1 });\n //cout << min1 << \" \";\n }\n rep(i, a) {\n int k = C[i];\n auto It = lower_bound(B.begin(), B.end(), k);\n auto It2 = lower_bound(A.begin(), A.end(), k);\n auto It3 = lower_bound(D.begin(), D.end(), k);\n min1 = min({ kyori(k,*It,*It2,*It3),min1 });\n //cout << min1 << \" \";\n }\n rep(i, a) {\n int k = D[i];\n auto It = lower_bound(B.begin(), B.end(), k);\n auto It2 = lower_bound(C.begin(), C.end(), k);\n auto It3 = lower_bound(A.begin(), A.end(), k);\n min1 = min({ kyori(k,*It,*It2,*It3),min1 });\n //cout << min1 << \" \";\n }\n cout << min1 << endl;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 4656,
"score_of_the_acc": -0.8488,
"final_rank": 14
},
{
"submission_id": "aoj_0748_8274614",
"code_snippet": "#include<iostream>\n#include<string>\n#include<string.h>\n#include<algorithm>\n#include<vector>\n#include<tuple>\n#include<math.h>\n#include<numeric>\n#include<set>\n#include <climits>\n#include<map>\n#include<stack>\n#include<queue>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\n//int a, b, c;\nvoid swap(int* p, int* q) {\n int t = *p;\n *p = *q;\n *q = t;\n}\nld you(ld x1, ld y1, ld x2, ld y2) {\n return (ld)sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n}\nint wa(int n) {\n int sum = 0;\n while (n > 0) {\n sum += n % 10;\n n /= 10;\n }\n return sum;\n //自作関数 wa で各桁の和を求める。\n}\nll sinsu(string s, ll k) { // K 進法表記の S を、10 進法表記で表す関数\n ll ans = 0;\n for (char x : s) {\n ans *= k;\n ans += x - '0';\n }\n return ans;\n}\nvector<ll> enumdiv(ll n) {\n vector<ll> S;\n for (int i = 1; 1LL * i * i <= n; i++) {\n if (n % i == 0) {\n S.push_back(i);\n if (i * i != n) {\n S.push_back(n / i);\n }\n }\n }\n sort(S.begin(), S.end());\n return S;\n //約数をlong long 型のvectorでsortして返す \n //auto A = などで受け取って A.size() で約数の数を出す。\n}\nbool IsPrime(int num)\n{\n if (num < 2) return false;\n else if (num == 2) return true;\n else if (num % 2 == 0) return false; // 偶数はあらかじめ除く\n double sqrtNum = sqrt(num);\n for (int i = 3; i <= sqrtNum; i += 2)\n {\n if (num % i == 0)\n {\n // 素数ではない\n return false;\n }\n }\n // 素数である\n return true;\n}\nint MM(int k) {\n int sum = 1;\n for (int i = 1; i <= k; ++i)\n {\n sum *= i;\n }\n return sum;\n}//階上計算\nvector<pair<long long, long long> > prime_factorize(long long N) {\n vector<pair<long long, long long> > res;\n for (long long a = 2; a * a <= N; ++a) {\n if (N % a != 0) continue;\n long long ex = 0; // 指数\n\n // 割れる限り割り続ける\n while (N % a == 0) {\n ++ex;\n N /= a;\n }\n\n // その結果を push\n res.push_back({ a, ex });\n }\n\n // 最後に残った数について\n if (N != 1) res.push_back({ N, 1 });\n return res;\n}\nusing Graph = vector<vector<int>>;\n/*#define ALL(box) (box).begin(),(box).end()\n#define ALL(box2) (box2).begin(),(box2).end()\n#define ALL(boxa) (boxa).begin(),(boxa).end()\n#define ALL(boxb) (boxb).begin(),(boxb).end()\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//sort(box.begin(), box.end());\n//sort(box.rbegin(), box.rend());\n//vector<vector<int>> box( a , vector<int>( a ));\n//printf(\"%.7Lf\", n);\n//reverse(t.begin(), t.end());\n//auto It = upper_bound(ALL(box), n); \n//cout << box.end() - It ; 末尾までの距離\n//cout << It - a.begin() ; 先頭までの距離\n//auto It =box.upper_bound( k);set,multiset\n\nll sum = 0;\nll num = 0;\nint pum = 0;\nll mum = 0;\nint min1 = 2000000001;\nint max1 = -2;\nll min2 = 9223372036854775807;\nll max2 = -10000000000000000;\nll mod1 = 1000000007;\nll MOD = 998244353;\n//---------------------------------------------------------\nint kyori(int a, int b, int c, int d) {\n int p = max({ b,c,d });\n return abs(p - a);\n}\nint main() {\n int a;\n cin >> a;\n vector<int> A(a), B(a), C(a), D(a);\n rep(i, a) {\n cin >> A[i];\n }\n rep(i, a) {\n cin >> B[i];\n }\n rep(i, a) {\n cin >> C[i];\n }\n rep(i, a) {\n cin >> D[i];\n }\n A.push_back(2000000000);\n B.push_back(2000000000);\n C.push_back(2000000000);\n D.push_back(2000000000);\n sort(A.begin(), A.end());\n sort(B.begin(), B.end());\n sort(C.begin(), C.end());\n sort(D.begin(), D.end());\n rep(i, a) {\n int k = A[i];\n auto It = lower_bound(B.begin(),B.end(), k);\n auto It2 = lower_bound(C.begin(), C.end(), k);\n auto It3 = lower_bound(D.begin(), D.end(), k);\n min1 = min({ kyori(k,*It,*It2,*It3),min1 });\n //cout << min1 << \" \";\n }\n rep(i, a) {\n int k = B[i];\n auto It = lower_bound(A.begin(), A.end(), k);\n auto It2 = lower_bound(C.begin(), C.end(), k);\n auto It3 = lower_bound(D.begin(), D.end(), k);\n min1 = min({ kyori(k,*It,*It2,*It3),min1 });\n //cout << min1 << \" \";\n }\n rep(i, a) {\n int k = C[i];\n auto It = lower_bound(B.begin(), B.end(), k);\n auto It2 = lower_bound(A.begin(), A.end(), k);\n auto It3 = lower_bound(D.begin(), D.end(), k);\n min1 = min({ kyori(k,*It,*It2,*It3),min1 });\n //cout << min1 << \" \";\n }\n rep(i, a) {\n int k = D[i];\n auto It = lower_bound(B.begin(), B.end(), k);\n auto It2 = lower_bound(C.begin(), C.end(), k);\n auto It3 = lower_bound(A.begin(), A.end(), k);\n min1 = min({ kyori(k,*It,*It2,*It3),min1 });\n //cout << min1 << \" \";\n }\n cout << min1 << endl;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 4680,
"score_of_the_acc": -0.8535,
"final_rank": 15
},
{
"submission_id": "aoj_0748_8174185",
"code_snippet": "#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(v) v.begin(),v.end()\ntypedef long long ll;\n \n#include<bits/stdc++.h>\nusing namespace std;\n \nint main(){\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n \n int n;\n cin>>n;\n vector<vector<int>> G(4,vector<int>(n));\n rep(i,4) rep(j,n) cin>>G[i][j];\n rep(i,4) sort(ALL(G[i]));\n \n int mi=1e9+7;\n rep(i,4){\n rep(j,n){\n int ma=0;\n rep(k,4){\n if(k==i) continue;\n auto t=lower_bound(ALL(G[k]),G[i][j])-G[k].begin();\n if(t==n) ma=1e9+7;\n ma=max(ma,G[k][t]-G[i][j]);\n }\n mi=min(mi,ma);\n }\n }\n cout<<mi<<endl;\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 4660,
"score_of_the_acc": -0.4051,
"final_rank": 6
}
] |
aoj_0779_cpp
|
高速道路の通行料金 (Highway Tolls)
問題文
JOI 王国は
N
個の都市からなる王国であり，これらの都市には
1
から
N
までの番号が付けられている．
JOI 王国には，これらの都市を結ぶ
一方通行
の高速道路が
M
本あり，
1
から
M
までの番号が付けられている．
高速道路
i
(
1 ≦ i ≦ M
) を通ると都市
A
i
から都市
B
i
に移動することができ，通行にかかる時間は
L
i
である．
それぞれの高速道路を通るたびに，通行料金が発生する．
高速道路
i
の通行料金は最も安い時で
C
i
だが，JOI 王国の労働者は皆時間外労働を嫌うため，ある基準となる時刻
0
から離れれば離れるほど通行料金が増えてしまう．
具体的には，都市
A
i
を時刻
t
に出発して高速道路
i
を通行した場合，通行料金は定数
K
を用いて
C
i
+ K × |t|
と表される．
ただし，
|t|
は
t
の絶対値を表す．
都市
1
に住んでいるあなたは，友達の住む都市
N
へ出かける計画を立てている．
あなたは高速道路を通って都市
1
から都市
N
まで移動したいので，まずはそれが可能かどうか確かめ，可能ならば通行料金の総和が最小でいくらになるかも求めたい．
ただし，移動経路や各都市を出発するタイミングは自由に決めることができる．
特に，都市
1
を負の時刻に出発したり，高速道路を通行せずどこかの都市に留まっている時間があったりしてもよい．
高速道路の情報および定数
K
が与えられたとき，高速道路を通って都市
1
から都市
N
まで移動することが可能かどうか判定し，
可能な場合は通行料金の総和の最小値を求めるプログラムを作成せよ．
なお，この問題の制約の下では，高速道路を通って都市
1
から都市
N
まで移動することが可能な場合，通行料金の総和の最小値は必ず整数になることが証明できる．
制約
2 ≦ N ≦ 4 000
．
1 ≦ M ≦ 8 000
．
0 ≦ K ≦ 100 000
．
1 ≦ A
i
≦ N
(
1 ≦ i ≦ M
)．
1 ≦ B
i
≦ N
(
1 ≦ i ≦ M
)．
A
i
≠ B
i
(
1 ≦ i ≦ M
)．
1 ≦ L
i
≦ 1 000 000
(
1 ≦ i ≦ M
)．
0 ≦ C
i
≦ 10
9
(
1 ≦ i ≦ M
)．
入力される値はすべて整数である．
入力
入力は以下の形式で与えられる．
N
M
K
A
1
B
1
L
1
C
1
A
2
B
2
L
2
C
2
︙
A
M
B
M
L
M
C
M
出力
高速道路を通って都市
1
から都市
N
まで移動することが不可能な場合は，
-1
を出力せよ．
可能な場合は，通行料金の総和の最小値を表す整数を
1
行で出力せよ．
入出力例
入力例 1
4 4 2
1 2 3 2
1 3 1 10
2 3 1 4
3 4 5 3
出力例 1
15
JOI 王国の都市と道路の様子を図にすると以下のようになる．
丸は都市を，矢印は道路を表し，各道路の横にはその道路の
L
i
と
C
i
の値がこの順に書かれている．
なお，丸の中に書かれた数字はその都市の番号を表す．
以下のように移動すると通行料金の総和が
15
になる．
時刻
-1
: 都市
1
を出発し，都市
3
へ向かう．通行料金が
10 + 2 × |-1| = 12
かかる．
時刻
0
: 都市
3
に到着し，すぐに都市
4
へ向かう．通行料金が
3 + 2 × |0|=3
かかる．
時刻
5
: 都市
4
に到着する．
通行料金の総和が
15
より小さくなるような移動方法は存在しないため，
15
を出力する．
入力例 2
4 4 0
1 2 3 2
1 3 1 10
2 3 1 4
3 4 5 3
出力例 2
9
入力例
1
とは
K
の値だけが異なる．
以下のように移動すると通行料金の総和が
9
になる．
時刻
-3
: 都市
1
を出発し，都市
2
へ向かう．通行料金が
2 + 0 × |-3| = 2
かかる．
時刻
0
: 都市
2
に到着し，すぐに都市
3
へ向かう．通行料金が
4 + 0 × |0| = 4
かかる．
時刻
1
: 都市
3
に到着し，そのまま都市
3
に留まる．
時刻
3
: 都市
3
を出発し，都市
4
へ向かう．通行料金が
3 + 0 × |3| = 3
かかる．
時刻
8
: 都市
4
に到着する．
通行料金の総和が
9
より小さくなるような移動方法は存在しないため，
9
を出力する．
入力例 3
2 1 10
2 1 4 7
出力例 3
-1
高速道路を通って都市
1
から都市
2
まで移動することは不可能なので，
-1
を出力する．
入力例 4
4 3 5
1 2 3 1
2 3 1 10
3 4 7 6
出力例 4
37
入力例 5
8 8 2
1 2 1 5
5 6 3 1
2 4 10 18
3 5 3 1
1 3 4 2
5 6 2 2
2 5 2 3
6 8 1 1
出力例 5
25
同じ
(A
i
,B
i
)
のペアを持つ複数の道路が存在することもある．
入力例 6
6 10 100000
4 2 212037 752027141
2 5 667097 1571491
2 1 769275 576006950
1 2 711969 526189398
5 3 733555 206320177
3 4 364807 802102091
1 4 467240 183184247
3 5 44994 15991843
5 3 613192 782356546
4 6 832593 639529758
出力例 6
47546714005
|
[
{
"submission_id": "aoj_0779_10827794",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nconstexpr ll INF = LLONG_MAX / 4;\n\ntemplate <class T>\ninline bool chmin(T &a, const T &b) {\n if (a > b) { a = b; return true; }\n return false;\n}\n\nstruct Edge {\n int to;\n ll length, cost;\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int N, M, K;\n cin >> N >> M >> K;\n\n vector<vector<Edge>> forwardGraph(N), reverseGraph(N);\n for (int i = 0; i < M; i++) {\n int A, B; ll L, C;\n cin >> A >> B >> L >> C;\n --A; --B;\n forwardGraph[A].push_back({B, L, C});\n reverseGraph[B].push_back({A, L, C});\n }\n\n vector<vector<ll>> dp(N + 1, vector<ll>(N, INF));\n vector<vector<ll>> reverseDp(N + 1, vector<ll>(N, INF));\n dp[0][0] = 0;\n reverseDp[0][N - 1] = 0;\n\n // forward DP\n for (int k = 0; k < N; k++) {\n for (int n = 0; n < N; n++) {\n if (dp[k][n] == INF) continue;\n for (auto &edge : forwardGraph[n]) {\n chmin(dp[k + 1][edge.to],\n dp[k][n] + edge.cost + (ll)(k + 1) * edge.length * K);\n }\n }\n }\n\n // reverse DP\n for (int k = 0; k < N; k++) {\n for (int n = 0; n < N; n++) {\n if (reverseDp[k][n] == INF) continue;\n for (auto &edge : reverseGraph[n]) {\n chmin(reverseDp[k + 1][edge.to],\n reverseDp[k][n] + edge.cost + (ll)k * edge.length * K);\n }\n }\n }\n\n ll answer = INF;\n for (int n = 0; n < N; n++) {\n ll minForward = INF, minReverse = INF;\n for (int k = 0; k <= N; k++) {\n chmin(minForward, dp[k][n]);\n chmin(minReverse, reverseDp[k][n]);\n }\n if (minForward < INF && minReverse < INF) {\n chmin(answer, minForward + minReverse);\n }\n }\n\n cout << (answer < INF ? answer : -1) << \"\\n\";\n return 0;\n}",
"accuracy": 1,
"time_ms": 570,
"memory_kb": 254464,
"score_of_the_acc": -0.8305,
"final_rank": 4
},
{
"submission_id": "aoj_0779_10566950",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\nconst ll INF = numeric_limits<ll>::max();\n\n// 値を更新する関数 (小さい値に更新する場合に使用)\ninline bool chmin(ll& p, ll q) {\n return p > q ? p = q, true : false;\n}\n\nstruct Edge {\n int to; // 行き先\n ll length, cost; // 距離、コスト\n};\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N, M, K; // 都市数、道路数、コスト定数\n cin >> N >> M >> K;\n\n vector<vector<Edge>> forwardGraph(N), reverseGraph(N); // 正方向、逆方向のグラフ\n for (int i = 0; i < M; ++i) {\n int A, B, L, C;\n cin >> A >> B >> L >> C;\n --A; --B; // 0-indexed に変換\n forwardGraph[A].push_back({B, L, C});\n reverseGraph[B].push_back({A, L, C});\n }\n\n // DPテーブルの初期化\n vector<vector<ll>> dp(N + 1, vector<ll>(N, INF));\n vector<vector<ll>> reverseDp(N + 1, vector<ll>(N, INF));\n dp[0][0] = 0; // 出発地点\n reverseDp[0][N - 1] = 0; // 目的地\n\n // 正方向のDP\n for (int k = 0; k < N; ++k) {\n for (int n = 0; n < N; ++n) {\n if (dp[k][n] == INF) continue; // 更新不要な箇所はスキップ\n for (const auto& edge : forwardGraph[n]) {\n chmin(dp[k + 1][edge.to], dp[k][n] + edge.cost + (k + 1) * edge.length * K);\n }\n }\n }\n\n // 逆方向のDP\n for (int k = 0; k < N; ++k) {\n for (int n = 0; n < N; ++n) {\n if (reverseDp[k][n] == INF) continue; // 更新不要な箇所はスキップ\n for (const auto& edge : reverseGraph[n]) {\n chmin(reverseDp[k + 1][edge.to], reverseDp[k][n] + edge.cost + k * edge.length * K);\n }\n }\n }\n\n // 最終的な答えの計算\n ll answer = INF;\n for (int n = 0; n < N; ++n) {\n ll minForward = INF, minReverse = INF;\n for (int k = 0; k <= N; ++k) {\n chmin(minForward, dp[k][n]);\n chmin(minReverse, reverseDp[k][n]);\n }\n if (minForward < INF && minReverse < INF) {\n chmin(answer, minForward + minReverse);\n }\n }\n\n // 結果の出力\n cout << (answer < INF ? answer : -1) << '\\n';\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 640,
"memory_kb": 254148,
"score_of_the_acc": -0.61,
"final_rank": 3
},
{
"submission_id": "aoj_0779_10131541",
"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\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n, m, K;\n cin >> n >> m >> K;\n vector<vector<tuple<int, int, int>>> g(n), rg(n);\n for (int i = 0; i < m; ++i) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n --a, --b;\n g[a].emplace_back(b, c, d);\n rg[b].emplace_back(a, c, d);\n }\n vector<vector<ll>> dp1(n, vector<ll>(n + 1, 1e18)), dp2(n, vector<ll>(n + 1, 1e18));\n dp1[0][0] = 0;\n for (ll j = 0; j < n; ++j) {\n for (int i = 0; i < n; ++i) {\n if (dp1[i][j] == 1e18) continue;\n for (auto [to, d, c] : g[i]) {\n ll cost = dp1[i][j] + c + (j + 1) * d * K;\n if (dp1[to][j + 1] > cost) {\n dp1[to][j + 1] = cost;\n }\n }\n }\n }\n dp2[n - 1][0] = 0;\n for (ll j = 0; j < n; ++j) {\n for (int i = 0; i < n; ++i) {\n if (dp2[i][j] == 1e18) continue;\n for (auto [to, d, c] : rg[i]) {\n ll cost = dp2[i][j] + c + j * d * K;\n if (dp2[to][j + 1] > cost) {\n dp2[to][j + 1] = cost;\n }\n }\n }\n }\n ll res = 1e18;\n for (int i = 0; i < n; ++i) {\n ll uo1 = 1e18, uo2 = 1e18;\n for (int j = 0; j <= n; ++j) {\n uo1 = min(uo1, dp1[i][j]);\n uo2 = min(uo2, dp2[i][j]);\n }\n res = min(res, uo1 + uo2);\n }\n if (res == 1e18) res = -1;\n cout << res << \"\\n\";\n}",
"accuracy": 1,
"time_ms": 880,
"memory_kb": 253876,
"score_of_the_acc": -1,
"final_rank": 5
},
{
"submission_id": "aoj_0779_10124523",
"code_snippet": "// AOJ #779\n// Highway Tolls 2025.1.20\n\n#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\nconst ll INF = numeric_limits<ll>::max();\n\n// 値を更新する関数 (小さい値に更新する場合に使用)\ninline bool chmin(ll& p, ll q) {\n return p > q ? p = q, true : false;\n}\n\nstruct Edge {\n int to; // 行き先\n ll length, cost; // 距離、コスト\n};\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N, M, K; // 都市数、道路数、コスト定数\n cin >> N >> M >> K;\n\n vector<vector<Edge>> forwardGraph(N), reverseGraph(N); // 正方向、逆方向のグラフ\n for (int i = 0; i < M; ++i) {\n int A, B, L, C;\n cin >> A >> B >> L >> C;\n --A; --B; // 0-indexed に変換\n forwardGraph[A].push_back({B, L, C});\n reverseGraph[B].push_back({A, L, C});\n }\n\n // DPテーブルの初期化\n vector<vector<ll>> dp(N + 1, vector<ll>(N, INF));\n vector<vector<ll>> reverseDp(N + 1, vector<ll>(N, INF));\n dp[0][0] = 0; // 出発地点\n reverseDp[0][N - 1] = 0; // 目的地\n\n // 正方向のDP\n for (int k = 0; k < N; ++k) {\n for (int n = 0; n < N; ++n) {\n if (dp[k][n] == INF) continue; // 更新不要な箇所はスキップ\n for (const auto& edge : forwardGraph[n]) {\n chmin(dp[k + 1][edge.to], dp[k][n] + edge.cost + (k + 1) * edge.length * K);\n }\n }\n }\n\n // 逆方向のDP\n for (int k = 0; k < N; ++k) {\n for (int n = 0; n < N; ++n) {\n if (reverseDp[k][n] == INF) continue; // 更新不要な箇所はスキップ\n for (const auto& edge : reverseGraph[n]) {\n chmin(reverseDp[k + 1][edge.to], reverseDp[k][n] + edge.cost + k * edge.length * K);\n }\n }\n }\n\n // 最終的な答えの計算\n ll answer = INF;\n for (int n = 0; n < N; ++n) {\n ll minForward = INF, minReverse = INF;\n for (int k = 0; k <= N; ++k) {\n chmin(minForward, dp[k][n]);\n chmin(minReverse, reverseDp[k][n]);\n }\n if (minForward < INF && minReverse < INF) {\n chmin(answer, minForward + minReverse);\n }\n }\n\n // 結果の出力\n cout << (answer < INF ? answer : -1) << '\\n';\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 630,
"memory_kb": 254132,
"score_of_the_acc": -0.5551,
"final_rank": 2
},
{
"submission_id": "aoj_0779_10124514",
"code_snippet": "// AOJ #779\n// Highway Tolls 2025.1.20\n\n#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\nconst ll INF = numeric_limits<ll>::max();\n\n// 値を更新する関数 (小さい値に更新する場合に使用)\ninline bool chmin(ll& current, ll newValue) {\n if (current > newValue) {\n current = newValue;\n return true;\n }\n return false;\n}\n\nstruct Edge {\n ll to, length, cost; // 行き先、距離、コスト\n};\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N, M, K; // 都市数、道路数、コスト定数\n cin >> N >> M >> K;\n\n vector<vector<Edge>> forwardGraph(N), reverseGraph(N); // 正方向、逆方向のグラフ\n for (int i = 0; i < M; ++i) {\n int A, B, L, C;\n cin >> A >> B >> L >> C;\n --A; --B; // 0-indexed に変換\n forwardGraph[A].push_back({B, L, C});\n reverseGraph[B].push_back({A, L, C});\n }\n\n // DPテーブルの初期化\n vector<vector<ll>> dp(N + 1, vector<ll>(N, INF));\n vector<vector<ll>> reverseDp(N + 1, vector<ll>(N, INF));\n dp[0][0] = 0; // 出発地点\n reverseDp[0][N - 1] = 0; // 目的地\n\n // 正方向のDP\n for (int k = 0; k < N; ++k) {\n for (int n = 0; n < N; ++n) {\n if (dp[k][n] == INF) continue; // 更新不要な箇所はスキップ\n for (const auto& edge : forwardGraph[n]) {\n chmin(dp[k + 1][edge.to], dp[k][n] + edge.cost + (k + 1) * edge.length * K);\n }\n }\n }\n\n // 逆方向のDP\n for (int k = 0; k < N; ++k) {\n for (int n = 0; n < N; ++n) {\n if (reverseDp[k][n] == INF) continue; // 更新不要な箇所はスキップ\n for (const auto& edge : reverseGraph[n]) {\n chmin(reverseDp[k + 1][edge.to], reverseDp[k][n] + edge.cost + k * edge.length * K);\n }\n }\n }\n\n // 最終的な答えの計算\n ll answer = INF;\n for (int n = 0; n < N; ++n) {\n ll minForward = INF, minReverse = INF;\n for (int k = 0; k <= N; ++k) {\n chmin(minForward, dp[k][n]);\n chmin(minReverse, reverseDp[k][n]);\n }\n if (minForward < INF && minReverse < INF) {\n chmin(answer, minForward + minReverse);\n }\n }\n\n // 結果の出力\n cout << (answer < INF ? answer : -1) << '\\n';\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 620,
"memory_kb": 254132,
"score_of_the_acc": -0.5229,
"final_rank": 1
},
{
"submission_id": "aoj_0779_10118914",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\n#define rep(i,s,t) for(ll i=s;i<t;i++)\n\nbool chmin(ll& p, ll q) {\n if (p > q) {\n p = q;\n return 1;\n }\n return 0;\n}\n\nstruct EDGE {\n ll to, L, C;\n};\n\nint main() {\n ll N, M, K;\n cin >> N >> M >> K;\n vector<vector<EDGE>> G(N), IG(N);\n rep(i, 0, M) {\n ll A, B, L, C;\n cin >> A >> B >> L >> C;\n A--; B--;\n G[A].push_back({ B,L,C });\n IG[B].push_back({ A,L,C });\n }\n vvll DP(N + 1, vll(N, 1e18));\n vvll IDP(N + 1, vll(N, 1e18));\n DP[0][0] = 0;\n IDP[0][N - 1] = 0;\n rep(k, 0, N) {\n rep(n, 0, N) {\n for (auto e : G[n]) {\n chmin(DP[k + 1][e.to], DP[k][n] + e.C + (k + 1) * e.L*K);\n }\n for (auto e : IG[n]) {\n chmin(IDP[k + 1][e.to], IDP[k][n] + e.C + (k)*e.L*K);\n }\n }\n }\n ll an = 1e18;\n vll P(N,1e18), IP(N,1e18);\n rep(n, 0, N) {\n rep(k, 0, N + 1) {\n chmin(P[n], DP[k][n]);\n chmin(IP[n], IDP[k][n]);\n }\n an = min(an, P[n] + IP[n]);\n }\n cout << (an<1e17?an:-1) << endl;\n}",
"accuracy": 1,
"time_ms": 720,
"memory_kb": 254584,
"score_of_the_acc": -1.4839,
"final_rank": 6
}
] |
aoj_0759_cpp
|
鐘 (Bell)
問題文
JOI 市には
1
本の十分に長い道路がある．この道路は数直線とみなすことができ，各地点は
1
個の実数による座標で表される．
また，JOI 市にはこの道路に沿って
N
個の鐘があり，座標の小さい順に
1
から
N
までの番号が付けられている．鐘
i
(
1 ≦ i ≦ N
) は座標
A
i
にある．
JOI 市では，
1
年の終わりにこれらの鐘を一斉に鳴らすのが一大イベントとなっている．
どの鐘も，鳴らすとその鐘と同じ地点では強さ
K
の音で聞こえるが，距離が
1
離れるごとに聞こえる音の強さは
1
小さくなり，距離が
K
以上離れると
0
になる．すなわち，鐘
i
を鳴らしたとき，座標
x
で聞こえる鐘
i
の音の強さは
max\{ K - |x - A
i
|, 0 \}
である．ただし，
|t|
は
t
の絶対値を表す．
すべての鐘を鳴らしたとき，座標
x
で聞こえる鐘の音の強さは，座標
x
で聞こえるそれぞれの鐘の音の強さの最大値である．
JOI 市にはこの道路に沿って
M
個の家があり，古い方から順に
1
から
M
までの番号が付けられている．家
j
(
1 ≦ j ≦ M
) は座標
B
j
にある．
JOI 市の市長であるあなたは，すべての鐘を鳴らしたとき，それぞれの家で聞こえる鐘の音の強さを知りたい．
JOI 市の鐘と家の情報が与えられたとき，すべての鐘を鳴らしたときに座標
B
1
, B
2
, …, B
M
で聞こえる鐘の音の強さを求めるプログラムを作成せよ．
制約
1 ≦ N ≦ 250000
．
1 ≦ M ≦ 250000
．
1 ≦ K ≦ 10
9
．
0 ≦ A
i
≦ 10
9
(
1 ≦ i ≦ N
)．
A
i
＜ A
i+1
(
1 ≦ i ≦ N - 1
)．
0 ≦ B
j
≦ 10
9
(
1 ≦ j ≦ M
)．
B
j
≠ B
k
(
1 ≦ j ＜ k ≦ M
)．
入力される値はすべて整数である．
入力
入力は以下の形式で与えられる．
N
M
K
A
1
A
2
…
A
N
B
1
B
2
…
B
M
出力
M
行出力せよ．
j
行目 (
1 ≦ j ≦ M
) には，すべての鐘を鳴らしたときに座標
B
j
で聞こえる鐘の音の強さを出力せよ．
入出力例
入力例 1
1 5 10
20
20 15 28 10 32
出力例 1
10
5
2
0
0
この入力例では，座標
20
に鐘
1
がある．
鐘
1
を鳴らしたとき，座標
20
で聞こえる鐘
1
の音の強さは
max\{ 10 - |20 - 20|, 0 \} = 10
である．したがって，
1
行目には
10
を出力する．
鐘
1
を鳴らしたとき，座標
15
で聞こえる鐘
1
の音の強さは
max\{10 - |15 - 20|, 0 \} = 5
である．したがって，
2
行目には
5
を出力する．
鐘
1
を鳴らしたとき，座標
28
で聞こえる鐘
1
の音の強さは
max\{10 - |28 - 20|, 0 \} = 2
である．したがって，
3
行目には
2
を出力する．
鐘
1
を鳴らしたとき，座標
10
で聞こえる鐘
1
の音の強さは
max\{10 - |10 - 20|, 0 \} = 0
である．したがって，
4
行目には
0
を出力する．
鐘
1
を鳴らしたとき，座標
32
で聞こえる鐘
1
の音の強さは
max\{10 - |32 - 20|, 0 \} = 0
である．したがって，
5
行目には
0
を出力する．
入力例 2
3 4 100
116 194 258
57 155 222 360
出力例 2
41
61
72
0
鐘
1,2,3
を鳴らしたとき，座標
57
で聞こえる音の強さはそれぞれ
41,0,0
である．したがって，すべての鐘を鳴らしたときに座標
57
で聞こえる音の強さはこれらの最大値である
41
である．そのため，
1
行目には
41
を出力する．
鐘
1,2,3
を鳴らしたとき，座標
155
で聞こえる音の強さはそれぞれ
61,61,0
である．したがって，すべての鐘を鳴らしたときに座標
155
で聞こえる音の強さはこれらの最大値である
61
である．そのため，
2
行目には
61
を出力する．
鐘
1,2,3
を鳴らしたとき，座標
222
で聞こえる音の強さはそれぞれ
0,72,64
である．したがって，すべての鐘を鳴らしたときに座標
222
で聞こえる音の強さはこれらの最大値である
72
である．そのため，
3
行目には
72
を出力する．
鐘
1,2,3
を鳴らしたとき，座標
360
で聞こえる音の強さはそれぞれ
0,0,0
である．したがって，すべての鐘を鳴らしたときに座標
360
で聞こえる音の強さはこれらの最大値である
0
である．そのため，
4
行目には
0
を出力する．
入力例 3
10 10 10000
589 2398 6567 28817 29177 31636 45468 66751 82282 97509
2196 54498 80474 61644 18007 38759 85590 72172 79533 69959
出力例 3
9798
970
8192
4893
0
3291
6692
4579
7251
6792
情報オリンピック日本委員会
作 『日本情報オリンピック第3回女性部門 本選 競技課題』
|
[
{
"submission_id": "aoj_0759_10807001",
"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 N, M;\n long long K;\n cin >> N >> M >> K;\n\n vector<long long> A(N);\n for(int i = 0; i < N; i++) cin >> A[i];\n\n vector<pair<long long,int>> B(M);\n for(int i = 0; i < M; i++){\n cin >> B[i].first;\n B[i].second = i;\n }\n\n // 出力用配列\n vector<long long> ans(M);\n\n // Aは昇順なので、家の座標ごとに近い鐘の場所を二分探索\n for (auto& [pos, idx] : B) {\n // 下限検索でpos以上の最小の鐘の位置を探す\n int p = (int)(lower_bound(A.begin(), A.end(), pos) - A.begin());\n\n long long res = 0;\n // 鐘pが存在すれば音の強さ計算\n if (p < N) {\n long long dist = abs(A[p] - pos);\n if (dist < K) res = max(res, K - dist);\n }\n // 鐘p-1も音の強さ計算\n if (p - 1 >= 0) {\n long long dist = abs(A[p - 1] - pos);\n if (dist < K) res = max(res, K - dist);\n }\n\n ans[idx] = res;\n }\n\n // 順番に出力\n for(int i = 0; i < M; i++){\n cout << ans[i] << \"\\n\";\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 10828,
"score_of_the_acc": -0.1757,
"final_rank": 4
},
{
"submission_id": "aoj_0759_10334410",
"code_snippet": "#include <iostream>\n#include <set>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <unordered_map>\n#include <algorithm>\n#include <numeric>\n#include <cstdlib>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\nint main(){\n int n,m,k;\n cin >> n >> m >> k;\n vector<int> a(n);\n rep(i,n){\n cin >> a[i];\n }\n vector<int> b(m);\n rep(i,m){\n cin >> b[i];\n }\n\n rep(i,m){\n auto it=lower_bound(a.begin(),a.end(),b[i]);\n int j=it-a.begin();\n \n int res=k;\n if(j==0){\n res -= a[0]-b[i];\n }\n else if(j<n){\n res -= min(a[j]-b[i],b[i]-a[j-1]);\n }\n else{\n res -= b[i]-a[n-1];\n }\n res = max(res,0);\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 4924,
"score_of_the_acc": -0.7707,
"final_rank": 11
},
{
"submission_id": "aoj_0759_9735152",
"code_snippet": "#include <iostream>\n#include <map>\n\nusing namespace std;\n\nint main()\n{\n std::map<int, int> A;\n int N, M, K;\n int a, B;\n int bell;\n\n cin >> N >> M >> K;\n for (int i = 0; i < N; i++){\n cin >> a;\n A.insert(make_pair(a, a));\n }\n\n for (int i = 0; i < M; i++){\n cin >> B;\n decltype(A)::iterator it = A.lower_bound(B);\n if (it == A.begin()){\n // cout << \"begin\" << endl;\n bell = it->first - B;\n // cout << \"1:\" << it->first << endl;\n }\n else if (it == A.end()){\n // cout << \"end\" << endl; \n bell = B - (--it)->first;\n // cout << \"2:\" << it->first << endl;\n }\n else {\n int k1 = it->first;\n int k2 = (--it)->first;\n // cout << \"k \" << k1 << \",\" << k2 << endl;\n if (k1 - B < B - k2){\n bell = k1 - B;\n // cout << \"3:\" << it->first << endl;\n }\n else {\n bell = B - k2;\n // cout << \"4:\" << it->first << endl;\n }\n }\n if (K - bell <= 0){\n cout << 0 << endl;\n }\n else {\n cout << K - bell << endl;\n }\n }\n\n return (0);\n}",
"accuracy": 1,
"time_ms": 380,
"memory_kb": 15136,
"score_of_the_acc": -1.2888,
"final_rank": 17
},
{
"submission_id": "aoj_0759_9666353",
"code_snippet": "#include <vector>\n#include <string>\n#include <deque>\n#include <tuple>\n#include <climits>\n#include <numeric>\n#include <iostream>\n#include <iomanip>\n#include <random>\n#include <cfloat>\n#include <set>\n#include <queue>\n#include <cmath>\n#include <algorithm>\n#include <variant>\n#include <bitset>\n#include <unordered_map>\n#include <array>\n#include <cmath>\n#include <map>\n#include <optional>\n#include <cassert>\n#include <filesystem>\n#include <mutex>\n#include <thread>\n#include <functional>\n#include <fstream>\n#include <chrono>\n#include <stack>\n#include <array>\n\n\nint main() {\n\tint n, m, k; std::cin >> n >> m >> k;\n\tstd::vector<int> bellPosition(n);\n\tfor (auto& a : bellPosition) {\n\t\tstd::cin >> a;\n\t}\n\tstd::vector<int> housePosition(m);\n\tfor (auto& b : housePosition) {\n\t\tstd::cin >> b;\n\t}\n\tfor (const auto b : housePosition) {\n\t\tconst auto next{ std::lower_bound(bellPosition.begin(), bellPosition.end(), b) };\n\t\tint max{ 0 };\n\t\tif (next != bellPosition.end()) {\n\t\t\tmax = std::max(max, k - *next + b);\n\t\t}\n\t\tif (next != bellPosition.begin()) {\n\t\t\tmax = std::max(max, k - b + *std::prev(next));\n\t\t}\n\t\tstd::cout << max << '\\n';\n\t}\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 4788,
"score_of_the_acc": -0.2671,
"final_rank": 5
},
{
"submission_id": "aoj_0759_9666306",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define sz(A) ((ll)A.size())\n#define ALL(A) A.begin(),A.end()\nint main(){\n int N,M,K;cin>>N>>M>>K;\n vector<int>A(N);\n REP(i,N)cin>>A[i];\n while(M--){\n int x;cin>>x;\n int t=lower_bound(ALL(A),x)-A.begin();\n int d=1e9;\n if(t<N)d=min(d,A[t]-x);\n if(t)d=min(d,x-A[t-1]);\n cout<<max(0,K-d)<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 4136,
"score_of_the_acc": -0.75,
"final_rank": 9
},
{
"submission_id": "aoj_0759_9643890",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nint main() {\n int N, M, K;\n \n // 入力を受け取る\n cin >> N >> M >> K;\n \n vector<int> A(N), B(M);\n \n for (int i = 0; i < N; ++i) {\n cin >> A[i];\n }\n \n for (int i = 0; i < M; ++i) {\n cin >> B[i];\n }\n \n // 各家の座標について計算\n for (int j = 0; j < M; ++j) {\n int bj = B[j];\n \n // 二分探索で鐘の座標Aの中で最も近い鐘を探す\n auto it = lower_bound(A.begin(), A.end(), bj);\n \n int max_sound = 0;\n \n // 現在の家の座標から近い鐘を確認し、音の強さを計算する\n if (it != A.end()) {\n max_sound = max(max_sound, K - abs(*it - bj));\n }\n \n if (it != A.begin()) {\n --it;\n max_sound = max(max_sound, K - abs(*it - bj));\n }\n \n cout << max_sound << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 4908,
"score_of_the_acc": -0.739,
"final_rank": 8
},
{
"submission_id": "aoj_0759_9592815",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nint main(void)\n{\n\tint N, M, K; cin >> N >> M >> K;\n\tvector<int> A(N), B(M);\n\tfor (auto& x: A) cin >> x;\n\tfor (auto& x: B) cin >> x;\n\n\t// For lower_bound() prev() - need at least 1e9 away due to constraints\n\tA.insert(A.begin(), -1e9 - 1);\n\tA.insert(A.end(), 2e9 + 1);\n\n\tfor (int i = 0; i < M; i++) {\n\t\tauto p = lower_bound(A.begin(), A.end(), B[i]);\n\t\t// Check against 2 closest values\n\t\tint d = min(*p - B[i], B[i] - *prev(p));\n\n\t\tcout << max(K - d, 0) << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 5896,
"score_of_the_acc": -0.765,
"final_rank": 10
},
{
"submission_id": "aoj_0759_9476231",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n\nusing namespace std;\n\nint main() {\n int N, M;\n long long K;\n cin >> N >> M >> K;\n\n vector<long long> A(N);\n for (int i = 0; i < N; ++i) {\n cin >> A[i];\n }\n\n vector<long long> B(M);\n for (int i = 0; i < M; ++i) {\n cin >> B[i];\n }\n\n // 結果を格納するベクトル\n vector<long long> result(M);\n\n // 各家の座標について計算\n for (int i = 0; i < M; ++i) {\n long long x = B[i];\n\n // 二分探索で最も近い鐘を見つける\n auto it = lower_bound(A.begin(), A.end(), x);\n\n long long max_strength = 0;\n\n if (it != A.end()) {\n // 右側の鐘\n max_strength = max(max_strength, K - abs(*it - x));\n }\n\n if (it != A.begin()) {\n // 左側の鐘\n --it;\n max_strength = max(max_strength, K - abs(*it - x));\n }\n\n result[i] = max_strength;\n }\n\n // 結果を出力\n for (int i = 0; i < M; ++i) {\n cout << result[i] << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 8892,
"score_of_the_acc": -0.8749,
"final_rank": 15
},
{
"submission_id": "aoj_0759_8980256",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n{\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\tunsigned int N, M, K, i, B, dist;\n\tcin >> N >> M >> K;\n\tvector<unsigned int> A(N);\n\tfor (i = 0; i != N; ++i) cin >> A[i];\n\tstable_sort(A.begin(), A.end());\n\n\tfor (i = 0; i != M; ++i)\n\t{\n\t\tcin >> B;\n\t\tauto itr = lower_bound(A.begin(), A.end(), B);\n\n\t\tif (itr == A.begin()) dist = *itr - B;\n\t\telse if (itr == A.end()) dist = B - *prev(itr);\n\t\telse dist = min(*itr - B, B - *prev(itr));\n\n\t\tif (dist >= K) cout << \"0\\n\";\n\t\telse cout << K - dist << '\\n';\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 4664,
"score_of_the_acc": -0.0139,
"final_rank": 1
},
{
"submission_id": "aoj_0759_8834668",
"code_snippet": "#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> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\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\n#define endl '\\n'\n#define _onez(s) ((s)? 1 : 0)\n#define _Yes(s) ((_onez(s)==1)? \"Yes\" : \"No\")\n#define _YES(s) ((_onez(s)==1)? \"YES\" : \"NO\")\n#define onez(s) {cout << _onez(s) << '\\n';}\n#define Yes(s) {cout << _Yes(s) << '\\n';}\n#define YES(s) {cout << _YES(s) << '\\n';}\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, M, K;\n cin >> N >> M >> K;\n vi A(N), B(M);\n set<ll> Bs;\n rep(i, N) cin >> A[i];\n rep(i, M) {\n cin >> B[i];\n Bs.insert(B[i]);\n }\n vi v_inc, v_dec, v_fin;\n rep(i, N) {\n v_inc.eb(A[i]-K+1);\n v_dec.eb(A[i]+1);\n }\n ll i=0, j=0, i1=0, j1=0;\n map<ll, ll> ans;\n vi q_inc, q_dec;\n for (auto l : Bs) {\n while ((i < len(v_inc)) and (v_inc[i] <= l)) {\n q_inc.eb(i);\n i++;\n }\n while ((j < len(v_dec)) and (v_dec[j] <= l)) {\n q_dec.eb(j);\n j++;\n chmax(i1, j);\n }\n ans[l] = 0;\n if (!q_inc.empty()) {\n while ((i1+1 < len(q_inc)) and (A[i1]-l > A[i1+1]-l)) {\n i1++;\n }\n if ((i1 < len(q_inc)) and (A[i1]-l >= 0)) {\n chmax(ans[l], K-(A[i1]-l));\n }\n }\n if (!q_dec.empty()) {\n while ((j1+1 < len(q_dec)) and (l-A[j1] > l-A[j1+1])) {\n j1++;\n }\n chmax(ans[l], K-(l-A[j1]));\n }\n }\n rep(i, M) {\n cout << ans[B[i]] << '\\n';\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 42224,
"score_of_the_acc": -1.7188,
"final_rank": 18
},
{
"submission_id": "aoj_0759_8826670",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint get_index(int bell_x[], int left, int right, int x) {\n int mid = (right + left) / 2;\n if (right == left) return right;\n \n if (x < bell_x[mid]) {\n return get_index(bell_x, left, mid, x);\n }\n else if (x > bell_x[mid]) {\n return get_index(bell_x, mid + 1, right, x);\n }\n else {\n return mid;\n }\n}\n\n\nint main(void){\n // Your code here!\n int n, m, k;\n cin >> n >> m >> k;\n int bell_x[250000];\n int house_x[250000];\n for (int i = 0; i < n; i++) {\n cin >> bell_x[i];\n }\n for (int i = 0; i < m; i++) {\n cin >> house_x[i];\n }\n \n for (int i = 0; i < m; i++ ){\n int index = get_index(bell_x, 0, n, house_x[i]);\n int d = abs(house_x[i] - bell_x[index]);\n if (index != 0) {\n d = min(d, abs(house_x[i] - bell_x[index - 1]));\n }\n if (index != n - 1) {\n d = min(d, abs(house_x[i] - bell_x[index + 1]));\n }\n \n cout << max(k - d, 0) << endl;\n }\n \n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 5384,
"score_of_the_acc": -0.7828,
"final_rank": 12
},
{
"submission_id": "aoj_0759_8781550",
"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(),M=in(),K=in();\n\tauto A=vecin(N),B=vecin(M);\n\t\t\n\tREP(i,M){\n\t\tauto res = lower_bound(ALL(A),B[i]);\n\t\tll L=-1,R=-1;\n\t\tif(res!=A.begin()) L = distance(A.begin(),res-1);\n\t\tif(res!=A.end()) R = distance(A.begin(),res);\n\t\tll C=0;\n\t\tif(L>=0) chmax(C,K-abs(B[i]-A[L]));\n\t\tif(R>=0) chmax(C,K-abs(B[i]-A[R]));\n\t\tout(C);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 6928,
"score_of_the_acc": -0.5733,
"final_rank": 7
},
{
"submission_id": "aoj_0759_8690555",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cmath>\nusing namespace std;\n\nstruct Bell{\n int p;\n int e;\n};\n\nstruct House{\n int p;\n int o;\n};\n\nbool operator<(const House& a, const House& b) {\n return a.p < b.p;\n}\n\nbool compare(const House& a, const House& b) {\n return a.o < b.o;\n}\n\n\nint main(){\n int n, m, k;\n cin>>n; cin>>m; cin>>k;\n Bell a[n];\n House b[m];\n for (int i=0; i<n; ++i){\n cin>>a[i].p;\n }\n for(int i=0; i<n-1; ++i){\n a[i].e=(a[i].p + a[i+1].p + 1)/2;\n }\n a[n-1].e=a[n-1].p+k;\n \n for (int i=0; i<m; ++i){\n cin>>b[i].p;\n b[i].o=i;\n }\n sort(b, b+m);\n \n int ct=0;\n \n for (const Bell &elm: a){\n for(;b[ct].p<elm.e && ct<m;++ct){\n int tmp=k-abs(elm.p-b[ct].p);\n b[ct].p=(tmp<0?0:tmp);\n }\n }\n while(ct<m){\n b[ct].p = 0;\n ct++;\n }\n sort(b, b+m, compare);\n for(int i=0; i<m; ++i){\n cout<<b[i].p<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 7276,
"score_of_the_acc": -0.8324,
"final_rank": 14
},
{
"submission_id": "aoj_0759_8690446",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cmath>\nusing namespace std;\n\nstruct Bell{\n long long p;\n long long e;\n};\n\nstruct House{\n long long p;\n long long o;\n \n};\n\nbool operator<(const House& a, const House& b) {\n return a.p < b.p;\n}\n\nbool compare(const House& a, const House& b) {\n return a.o < b.o;\n}\n\n\nint main(){\n long long n, m, k;\n cin>>n; cin>>m; cin>>k;\n Bell a[n];\n House b[m];\n for ( long long i=0; i<n; ++i){\n cin>>a[i].p;\n }\n for( long long i=0; i<n-1; ++i){\n a[i].e=(a[i].p + a[i+1].p)/2;\n }\n a[n-1].e=a[n-1].p+k;\n \n for ( long long i=0; i<m; ++i){\n cin>>b[i].p;\n b[i].o=i;\n }\n sort(b, b+m);\n \n long long ct=0;\n \n for (const Bell &elm: a){\n for(;b[ct].p<elm.e && ct<m;++ct){\n long long tmp=k-abs(elm.p-b[ct].p);\n b[ct].p=(tmp<0?0:tmp);\n }\n }\n while(ct<m){\n b[ct].p = 0;\n ct++;\n }\n sort(b, b+m, compare);\n for( long long i=0; i<m; ++i){\n cout<<b[i].p<<endl;\n }\n}",
"accuracy": 0.7567567567567568,
"time_ms": 230,
"memory_kb": 7428,
"score_of_the_acc": -0.6177,
"final_rank": 20
},
{
"submission_id": "aoj_0759_8684112",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cmath>\nusing namespace std;\n\nstruct Bell{\n int p;\n int e;\n};\n\nstruct House{\n int p;\n int o;\n \n};\n\nbool operator<(const House& a, const House& b) {\n return a.p < b.p;\n}\n\nbool compare(const House& a, const House& b) {\n return a.o < b.o;\n}\n\n\nint main(){\n int n, m, k;\n cin>>n; cin>>m; cin>>k;\n Bell a[n];\n House b[m];\n for (int i=0; i<n; ++i){\n cin>>a[i].p;\n }\n for(int i=0; i<n-1; ++i){\n a[i].e=(a[i].p + a[i+1].p)/2;\n }\n a[n-1].e=a[n-1].p+k;\n \n for (int i=0; i<m; ++i){\n cin>>b[i].p;\n b[i].o=i;\n }\n sort(b, b+m);\n \n int ct=0;\n \n for (const Bell &elm: a){\n for(;b[ct].p<elm.e && ct<m;++ct){\n int tmp=k-abs(elm.p-b[ct].p);\n b[ct].p=(tmp<0?0:tmp);\n }\n }\n while(ct<m){\n b[ct].p = 0;\n ct++;\n }\n sort(b, b+m, compare);\n for(int i=0; i<m; ++i){\n cout<<b[i].p<<endl;\n }\n}",
"accuracy": 0.7567567567567568,
"time_ms": 230,
"memory_kb": 5348,
"score_of_the_acc": -0.5631,
"final_rank": 19
},
{
"submission_id": "aoj_0759_8178532",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n\nusing namespace std;\nint main(void){\n // Your code here!\n int N,M,K;\n cin >> N >> M >> K;\n\n vector<int> As;\n As.reserve(N);\n \n int Bs[M];\n\n int pos;\n for (int i=0;i<N;i++){\n cin >> pos;\n As.push_back(pos);\n }\n for(int j=0;j<M;j++){\n cin >>Bs[j];\n }\n int amp1,amp2;\n int delta;\n for(int j=0;j<M;j++){\n pos=Bs[j];\n vector<int>::iterator itA=lower_bound(As.begin(),As.end(),pos);\n if(itA!=As.begin()){\n amp1=max(K-(pos-*(itA-1)),0);\n }else{\n amp1=0;\n }\n if(itA!=As.end()){\n amp2=max(K-(*itA-pos),0);\n }else{\n amp2=0;\n }\n cout << max(amp1,amp2) << endl;\n } \n \n}",
"accuracy": 1,
"time_ms": 380,
"memory_kb": 4592,
"score_of_the_acc": -1.012,
"final_rank": 16
},
{
"submission_id": "aoj_0759_8174982",
"code_snippet": "#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(v) v.begin(),v.end()\ntypedef long long ll;\n \n#include<bits/stdc++.h>\nusing namespace std;\n \nint main(){\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n \n int n,m,k;\n cin>>n>>m>>k;\n vector<int> A(n),B(m);\n rep(i,n) cin>>A[i];\n rep(i,m) cin>>B[i];\n rep(i,m){\n auto t=lower_bound(ALL(A),B[i])-A.begin();\n if(t==0) cout<<max(0,k-(A[t]-B[i]))<<endl;\n else if(t==n) cout<<max(0,k-(B[i]-A[n-1]))<<endl;\n else cout<<max(max(0,k-(A[t]-B[i])),max(0,k-(B[i]-A[t-1])))<<endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 5032,
"score_of_the_acc": -0.5235,
"final_rank": 6
},
{
"submission_id": "aoj_0759_7995373",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\nint main() {\n ll N,M,K;\n cin>>N>>M>>K;\n vll A(N+2);\n rep(i,N)cin>>A[i+1];\n A[0]=-1e18;\n A[N+1]=1e18;\n rep(i,M){\n ll B;\n cin>>B;\n auto p=lower_bound(all(A),B);\n auto q=lower_bound(all(A),B);\n p--;\n ll d=min(B-*p,*q-B);\n cout<<max(0ll,K-d)<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 4960,
"score_of_the_acc": -0.8029,
"final_rank": 13
},
{
"submission_id": "aoj_0759_7973916",
"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,k; cin >> n >> m >> k;\n vector<ll> vec;\n vec.push_back(-1e18);\n for (int i = 0; i < n; i++) {\n ll a; cin >> a;\n vec.push_back(a);\n }\n vec.push_back(1e18);\n while (m--) {\n ll b; cin >> b;\n auto it = lower_bound(vec.begin(), vec.end(), b) - vec.begin();\n ll res = 0;\n res = max(res, k-abs(b-vec[it]));\n it--;\n res = max(res, k-abs(b-vec[it]));\n cout << res << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 5208,
"score_of_the_acc": -0.0594,
"final_rank": 3
},
{
"submission_id": "aoj_0759_7953232",
"code_snippet": "#include <bits/extc++.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) begin(x),end(x)\n#define Fixed fixed << setprecision(12)\n#define updiv(a, b) (((a) + (b) - 1) / (b))\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\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 T, class U> istream& operator>>(istream& is, pair<T, U>& p){ is >> p.first >> p.second; return (is); }\ntemplate<class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p){ os << p.first << ' ' << p.second; return (os); }\ntemplate<class T> istream& operator>>(istream& is, vector<T>& v){ for (auto &&e : v) is >> e; return (is); }\ntemplate<class T> ostream& operator<<(ostream& os, vector<T>& v){ for (auto &&e : v) os << e << ' '; return (os); }\n\ntemplate<class T> inline const T& max(const vector<T> &v) { return *max_element(v.begin(), v.end()); }\ntemplate<class T> inline const T& min(const vector<T> &v) { return *min_element(v.begin(), v.end()); }\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 max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T, vector<T>, greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A, B>;\ntemplate <class T> using uset = unordered_set<T>;\n\ntemplate <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;\ntemplate <class T> using Rope = __gnu_cxx::rope<T>;\nusing Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n\ntemplate <class T> void bye(T x){ cout << x << '\\n'; exit(0); }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1,0};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1,0};\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, k;\n cin >> n >> m >> k;\n\n vector<int> a(n), b(m);\n\n cin >> a >> b;\n\n a.insert(a.begin(), INT_MIN);\n a.emplace_back(INT_MAX);\n\n for (int i = 0; i < m; ++i) {\n auto r = lower_bound(all(a), b[i]);\n auto l = prev(r);\n cout << max(k - min(abs(b[i] - *l), abs(b[i] - *r)), 0) << '\\n';\n }\n\n return (0);\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 5852,
"score_of_the_acc": -0.0451,
"final_rank": 2
}
] |
aoj_0787_cpp
|
座席 2 (Seats 2)
問題文
JOI 国では，今年プログラミングの世界大会が開かれることとなった．大会には
N
人の選手が参加予定であり，選手には
1
から
N
までの番号が付けられている．
各選手の出身国は
1
以上
10
9
以下の整数の番号で表され，選手
i
(
1 ≦ i ≦ N
) の出身国は国
C
i
である．
N
人の選手の出身国がすべて同じであることはない．
また，各選手の座席は直線状に並んでおり，選手
i
(
1 ≦ i ≦ N
) の座席は位置
X
i
にある．選手
i
(
1 ≦ i ≦ N
) と選手
j
(
1 ≦ j ≦ N
) の
座席の距離
は
|X
i
- X
j
|
である．ただし，
|x|
は
x
の絶対値を表す．
各選手は大会中他の選手と交流をするにあたって，自分とは出身国の異なる選手のうち，自分と座席が最も近い選手までの座席の距離を知りたい．
各選手の出身国と座席の位置の情報が与えられたとき，各選手
i
(
1 ≦ i ≦ N
) について，選手
i
とは出身国の異なる選手のうち，選手
i
との座席の距離が最も小さい選手までの座席の距離を出力するプログラムを作成せよ．
制約
2 ≦ N ≦ 300 000
．
1 ≦ C
i
≦ 10
9
(
1 ≦ i ≦ N
)．
1 ≦ X
i
≦ 10
9
(
1 ≦ i ≦ N
)．
N
人の選手の出身国がすべて同じであることはない．
入力される値はすべて整数である．
入力
入力は以下の形式で与えられる．
N
C
1
X
1
C
2
X
2
︙
C
N
X
N
出力
N
行出力せよ．
i
行目 (
1 ≦ i ≦ N
) には，選手
i
とは出身国の異なる選手のうち，選手
i
との座席の距離が最も小さい選手までの座席の距離を出力せよ．
入出力例
入力例 1
3
2 5
1 1
1 2
出力例 1
3
4
3
選手
1
の出身国は国
2
であり，選手
1
と出身国の異なる選手は選手
2, 3
である．これらの選手のうち，選手
1
との座席の距離が最も小さい選手は選手
3
であり，その座席の距離は
3
である．したがって，
1
行目には
3
を出力する．
選手
2
の出身国は国
1
であり，選手
2
と出身国の異なる選手は選手
1
のみである．選手
2
と選手
1
の座席の距離は
4
なので，
2
行目には
4
を出力する．
選手
3
の出身国は国
1
であり，選手
3
と出身国の異なる選手は選手
1
のみである．選手
3
と選手
1
の座席の距離は
3
なので，
3
行目には
3
を出力する．
入力例 2
5
1 1
2 4
2 14
3 10
2 2
出力例 2
1
3
4
4
1
入力例 3
3
1 1
2 1
1 1
出力例 3
0
0
0
同じ位置に複数の選手の座席があることもある．
情報オリンピック日本委員会
作『日本情報オリンピック第4回女性部門 本選 競技課題』
|
[
{
"submission_id": "aoj_0787_10827800",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Seat {\n long long country, x;\n int idx;\n bool operator<(const Seat &o) const {\n if (x != o.x) return x < o.x;\n return country < o.country;\n }\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n;\n cin >> n;\n vector<Seat> v(n);\n for (int i = 0; i < n; i++) {\n cin >> v[i].country >> v[i].x;\n v[i].idx = i;\n }\n sort(v.begin(), v.end());\n\n vector<long long> ls(n, -1), rs(n, -1);\n\n // 左→右\n int l = 0, r = 0;\n long long cur = v[0].country;\n while (r < n) {\n while (r < n && v[r].country == cur) r++;\n if (r == n) break;\n while (l < r) {\n ls[v[l].idx] = v[r].x - v[l].x;\n l++;\n }\n cur = v[r].country;\n }\n\n // 右→左\n r = n - 1, l = n - 1;\n cur = v[l].country;\n while (l >= 0) {\n while (l >= 0 && v[l].country == cur) l--;\n if (l < 0) break;\n while (l < r) {\n rs[v[r].idx] = v[r].x - v[l].x;\n r--;\n }\n cur = v[l].country;\n }\n\n // 出力\n for (int i = 0; i < n; i++) {\n if (ls[i] == -1) cout << rs[i] << \"\\n\";\n else if (rs[i] == -1) cout << ls[i] << \"\\n\";\n else cout << min(ls[i], rs[i]) << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 15068,
"score_of_the_acc": -0.1472,
"final_rank": 2
},
{
"submission_id": "aoj_0787_10457990",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nstruct Seat {\n int id;\n int posi;\n int cnty;\n int dist;\n\n Seat(int in_id, int in_posi, int in_cnty) {\n id = in_id;\n posi = in_posi;\n cnty = in_cnty;\n dist = 0;\n }\n};\n\nbool comp(const Seat& a, const Seat& b) {\n if (a.posi != b.posi)\n return a.posi < b.posi;\n else if (a.cnty != b.cnty)\n return a.cnty < b.cnty;\n else\n return a.id < b.id;\n}\n\nbool comp2(const Seat& a, const Seat& b) {\n return a.id < b.id;\n}\n\nint binarySearch(int key, std::vector<std::vector<int>> A, int left, int right) {\n int mid;\n\n while (left <= right) {\n mid = left + (right - left + 1) / 2;\n if (A[mid][0] == key)\n return mid;\n else if (A[mid][0] < key)\n left = mid + 1;\n else\n right = mid - 1;\n }\n}\n\nint main()\n{\n int N;\n std::cin >> N;\n int in_cnty, in_posi;\n std::vector<Seat> seat;\n \n for (int i = 0; i < N; i++) {\n std::cin >> in_cnty >> in_posi;\n seat.push_back(Seat(i, in_posi, in_cnty));\n }\n \n std::sort(seat.begin(), seat.end(), comp);\n\n// for (int i = 0; i < seat.size(); i++)\n// std::cout << seat[i].id << \" \" << seat[i].cnty << \" \" << seat[i].posi << std::endl;\n\n int idx = 0, prev = -1000000005;\n for (int i = 1; i < seat.size(); i++)\n if (seat[idx].cnty != seat[i].cnty) {\n while (idx < i) {\n seat[idx].dist = std::min(seat[idx].posi - prev, seat[i].posi - seat[idx].posi);\n ++idx;\n }\n prev = seat[i - 1].posi;\n }\n for (int i = idx; i < seat.size(); i++)\n seat[i].dist = seat[i].posi - prev;\n \n std::sort(seat.begin(), seat.end(), comp2);\n\n// for (int i = 0; i < seat.size(); i++)\n// std::cout << seat[i].id << \" \" << seat[i].cnty << \" \" << seat[i].posi \n// << \" \" << seat[i].dist << std::endl;\n\n for (int i = 0; i < seat.size(); i++)\n std::cout << seat[i].dist << std::endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 390,
"memory_kb": 13276,
"score_of_the_acc": -0.5203,
"final_rank": 4
},
{
"submission_id": "aoj_0787_10436158",
"code_snippet": "#include <iostream>\n#include <string.h>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nlong long int ls[300003];\nlong long int rs[300003];\n\nstruct E{\n\tint p,no;\n\tlong long int x;\n\tbool operator<(const E& e1)const{\n\t\tif(x!=e1.x)return x<e1.x;\n\t\treturn p<e1.p;\n\t}\n};\n\nint main() {\n\tmemset(ls,-1,sizeof(ls));\n\tmemset(rs,-1,sizeof(rs));\n\tint n;\n\tcin>>n;\n\tvector<E> vs;\n\tfor(int i=0;i<n;i++){\n\t\tE e1;\n\t\tcin>>e1.p>>e1.x;\n\t\te1.no=i;\n\t\tvs.push_back(e1);\n\t}\n\tsort(vs.begin(),vs.end());\n\tint l=0;\n\tint r=0;\n\tint p=vs[0].p;\n\twhile(r<n){\n\t\twhile(r<n){\n\t\t\tif(p==vs[r].p){\n\t\t\t\tr++;\n\t\t\t}else{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif(n<=r)break;\n\t\twhile(l<r){\n\t\t\tls[vs[l].no]=vs[r].x-vs[l].x;\n\t\t\tl++;\n\t\t}\n\t\tp=vs[r].p;\n\t}\n\tr=n-1;\n\tl=n-1;\n\tp=vs[l].p;\n\twhile(0<=l){\n\t\twhile(0<=l){\n\t\t\tif(p==vs[l].p){\n\t\t\t\tl--;\n\t\t\t}else{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(l<0)break;\n\t\twhile(l<r){\n\t\t\trs[vs[r].no]=vs[r].x-vs[l].x;\n\t\t\tr--;\n\t\t}\n\t\tp=vs[l].p;\n\t}\n\t\n\tfor(int i=0;i<n;i++){\n\t\t//cout<<ls[i]<<\" \"<<rs[i];\n\t\tif(ls[i]==-1){\n\t\t\tcout<<rs[i];\n\t\t}else if(rs[i]==-1){\n\t\t\tcout<<ls[i];\n\t\t}else{\n\t\t\tcout<<min(ls[i],rs[i]);\n\t\t}\n\t\tcout<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 360,
"memory_kb": 18004,
"score_of_the_acc": -0.5806,
"final_rank": 5
},
{
"submission_id": "aoj_0787_10425418",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n//#define MOD 998244353\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n#define SIZE 300005\n\nstruct Info{\n\n\tint loc;\n};\n\nint number = 0,ANS[SIZE];\nmap<int,int> IND,ALL;\nvector<int> V[SIZE];\nInfo info[SIZE];\n\nint getIndex(int num){\n\n\tauto at = IND.find(num);\n\tif(at == IND.end()){\n\t\tIND[num] = number++;\n\t}\n\treturn IND[num];\n}\n\nint main(){\n\n\tint N;\n\tscanf(\"%d\",&N);\n\n\tint C;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%d %d\",&C,&info[i].loc);\n\t\tint tmp_ind = getIndex(C);\n\n\t\tALL[info[i].loc] += 1;\n\n\t\tV[tmp_ind].push_back(i);\n\t}\n\n\tfor(int i = 0; i < number; i++){\n\n\t\t//自分のグループの位置を消す\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tint tmp_ind = V[i][k];\n\t\t\tALL[info[tmp_ind].loc]--;\n\t\t\tif(ALL[info[tmp_ind].loc] == 0){\n\n\t\t\t\tALL.erase(info[tmp_ind].loc);\n\t\t\t}\n\t\t}\n\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\n\t\t\tint mini = BIG_NUM;\n\t\t\tint tmp_ind = V[i][k];\n\n\t\t\tauto at = ALL.lower_bound(info[tmp_ind].loc);\n\t\t\tif(at != ALL.end()){\n\n\t\t\t\tmini = at->first - info[tmp_ind].loc;\n\t\t\t}\n\t\t\tif(at != ALL.begin()){\n\t\t\t\tat--;\n\t\t\t\tchmin(mini,info[tmp_ind].loc- at->first);\n\t\t\t}\n\n\t\t\tANS[tmp_ind] = mini;\n\t\t}\n\n\t\t//自分のグループの位置を戻す\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tint tmp_ind = V[i][k];\n\t\t\tALL[info[tmp_ind].loc]++;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tprintf(\"%d\\n\",ANS[i]);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 600,
"memory_kb": 50132,
"score_of_the_acc": -1.5251,
"final_rank": 7
},
{
"submission_id": "aoj_0787_10216259",
"code_snippet": "#include <iostream>\n#include <cstdint>\n#include <vector>\n#include <set>\n#include <unordered_map>\n\nusing namespace std;\n\ntemplate<typename T> constexpr T chmin(T& variable, const T value) noexcept\n{\n\tif (variable < value) return variable;\n\telse return (variable = value);\n}\n\nint main()\n{\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tuint32_t N, i, j;\n\tcin >> N;\n\tvector<uint32_t> C(N), X(N);\n\tfor (i = 0; i != N; ++i) cin >> C[i] >> X[i];\n\n\tmultiset<uint32_t> seats;\n\tunordered_map<uint32_t, uint32_t> country_id_for;\n\tvector<vector<pair<uint32_t, uint32_t>>> players_from;\n\tfor (i = 0; i != N; ++i)\n\t{\n\t\tif (!country_id_for.contains(C[i]))\n\t\t{\n\t\t\tcountry_id_for.insert({ C[i], country_id_for.size() });\n\t\t\tplayers_from.emplace_back();\n\t\t}\n\n\t\tseats.insert(X[i]);\n\t\tplayers_from[country_id_for[C[i]]].emplace_back(X[i], i);\n\t}\n\n\tvector<uint32_t> ans(N, UINT32_MAX);\n\tfor (i = 0; i != players_from.size(); ++i)\n\t{\n\t\tfor (j = 0; j != players_from[i].size(); ++j)\n\t\t\tseats.erase(seats.find(players_from[i][j].first));\n\n\t\tfor (j = 0; j != players_from[i].size(); ++j)\n\t\t{\n\t\t\tconst auto itr = seats.lower_bound(players_from[i][j].first);\n\t\t\tif (itr != seats.begin())\n\t\t\t\tchmin(ans[players_from[i][j].second], players_from[i][j].first - *prev(itr));\n\t\t\tif (itr != seats.end())\n\t\t\t\tchmin(ans[players_from[i][j].second], *itr - players_from[i][j].first);\n\t\t}\n\n\t\tfor (j = 0; j != players_from[i].size(); ++j)\n\t\t\tseats.insert(players_from[i][j].first);\n\t}\n\n\tfor (i = 0; i != N; ++i)\n\t\tcout << ans[i] << '\\n';\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 390,
"memory_kb": 51180,
"score_of_the_acc": -1.2935,
"final_rank": 6
},
{
"submission_id": "aoj_0787_10122690",
"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> c(n), x(n), idx(n);\n for (int i = 0; i < n; i++) {\n cin >> c[i] >> x[i];\n idx[i] = i;\n }\n sort(idx.begin(), idx.end(), [&](auto i, auto j) { return x[i] < x[j]; });\n\n vector<int> res(n, 2e9);\n int c1 = -1, c2 = -1;\n int d1 = -1e9, d2 = -1e9;\n for (int i = 0; i < n; i++) {\n int j = idx[i];\n if (c1 != c[j]) {\n res[j] = min(res[j], x[j] - d1);\n c2 = c1, d2 = d1;\n c1 = c[j], d1 = x[j];\n } else {\n res[j] = min(res[j], x[j] - d2);\n c1 = c[j], d1 = x[j];\n }\n }\n c1 = -1, c2 = -1;\n d1 = 2e9, d2 = 2e9;\n for (int i = n - 1; i >= 0; i--) {\n int j = idx[i];\n if (c1 != c[j]) {\n res[j] = min(res[j], d1 - x[j]);\n c2 = c1, d2 = d1;\n c1 = c[j], d1 = x[j];\n } else {\n res[j] = min(res[j], d2 - x[j]);\n c1 = c[j], d1 = x[j];\n }\n }\n\n for (int i = 0; i < n; i++) {\n cout << res[i] << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 7852,
"score_of_the_acc": -0.0241,
"final_rank": 1
},
{
"submission_id": "aoj_0787_10118923",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nint main(){\n int N;\n cin>>N;\n vector<ll> C(N),X(N),AN(N,2e18);\n map<ll,vector<ll>> M;\n multiset<ll> S;\n S.insert(-1e18);\n S.insert(1e18);\n for(ll i=0;i<N;i++){\n cin>>C[i]>>X[i];\n M[C[i]].push_back(i);\n S.insert(X[i]);\n }\n for(auto m:M){\n for(auto x:m.second)S.erase(S.find(X[x]));\n for(auto x:m.second){\n AN[x]=min(AN[x],*(S.lower_bound(X[x]))-X[x]);\n AN[x]=min(AN[x],X[x]-*(prev(S.lower_bound(X[x]))));\n }\n for(auto x:m.second)S.insert(X[x]);\n }\n for(int i=0;i<N;i++)cout<<AN[i]<<endl;\n\n}",
"accuracy": 1,
"time_ms": 880,
"memory_kb": 56876,
"score_of_the_acc": -2,
"final_rank": 8
},
{
"submission_id": "aoj_0787_10092389",
"code_snippet": "// AOJ #787\n// Seats 2 2025.1.11\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 選手の情報を保持する構造体\nstruct Seat {\n long long country; // 国番号\n long long x; // 座席の位置\n int idx; // 元の入力順(0-based)\n};\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n int N;\n cin >> N;\n\n vector<Seat> seats(N);\n for(int i = 0; i < N; i++){\n long long c, x;\n cin >> c >> x;\n seats[i].country = c;\n seats[i].x = x;\n seats[i].idx = i; // 入力順を保持\n }\n\n // 1. 座席を位置 X でソート\n sort(seats.begin(), seats.end(), [](const Seat &a, const Seat &b){\n return a.x < b.x;\n });\n\n // 2. ソート後、同じ国が連続する区間を「ブロック」とする\n // blockId[i] = 座席 i が属するブロック番号\n vector<int> blockId(N);\n vector<long long> blockCountry; // 各ブロックの国番号\n vector<int> blockStart; // 各ブロックの開始インデックス(ソート後)\n vector<int> blockEnd; // 各ブロックの終了インデックス(ソート後)\n\n // 最初のブロック設定\n int blockCount = 0;\n blockId[0] = 0;\n blockCountry.push_back(seats[0].country);\n blockStart.push_back(0);\n\n // ブロック分割\n for (int i = 1; i < N; i++) {\n if (seats[i].country == seats[i - 1].country) {\n // 同じ国なので同じブロック\n blockId[i] = blockCount;\n } else {\n // 国が変わったので前のブロックを閉じて新ブロック開始\n blockEnd.push_back(i - 1); // 直前でブロック終了\n blockCount++;\n blockId[i] = blockCount;\n blockCountry.push_back(seats[i].country);\n blockStart.push_back(i);\n }\n }\n // 最後のブロックを閉じる\n blockEnd.push_back(N - 1);\n blockCount++;\n\n // ブロックの「左端」「右端」の座席位置を取得 (計算しやすいように)\n vector<long long> blockLeftPos(blockCount), blockRightPos(blockCount);\n for (int b = 0; b < blockCount; b++){\n blockLeftPos[b] = seats[ blockStart[b] ].x; // ブロック先頭の位置\n blockRightPos[b] = seats[ blockEnd[b] ].x; // ブロック末尾の位置\n }\n\n // 3. 距離計算用の配列 (元の入力順に格納する)\n vector<long long> answer(N, 0LL);\n\n // 各ブロック内の座席について、左右ブロックとの距離の最小を答えとする\n // distLeft = x_i - blockRightPos[b-1] (b > 0 のとき)\n // distRight = blockLeftPos[b+1] - x_i (b < blockCount-1 のとき)\n // 同じ座席位置なら距離 0 となる可能性がある\n for (int b = 0; b < blockCount; b++) {\n for (int i = blockStart[b]; i <= blockEnd[b]; i++) {\n long long x_i = seats[i].x;\n long long distLeft = LLONG_MAX;\n long long distRight = LLONG_MAX;\n\n if (b > 0) {\n distLeft = x_i - blockRightPos[b - 1];\n if (distLeft < 0) distLeft = 0; // 同じ位置なら 0\n }\n if (b < blockCount - 1) {\n distRight = blockLeftPos[b + 1] - x_i;\n if (distRight < 0) distRight = 0; // 同じ位置なら 0\n }\n\n long long dist = min(distLeft, distRight);\n answer[ seats[i].idx ] = dist;\n }\n }\n\n // 4. 結果を元の入力順で出力\n for (int i = 0; i < N; i++){\n cout << answer[i] << \"\\n\";\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 26696,
"score_of_the_acc": -0.4085,
"final_rank": 3
}
] |
aoj_0776_cpp
|
買い物 2 (Shopping 2)
問題文
JOI 商店には
N
個の商品があり，商品には
1
から
N
までの番号が付けられている．
それぞれの商品には，
定価
と
種類
が定められている．商品
i
(
1 ≦ i ≦ N
) の定価は
P
i
円である．商品の種類は
1
以上
M
以下の整数で表され，商品
i
(
1 ≦ i ≦ N
) の種類は
A
i
である．
JOI 商店は，セールを行うことにした．セールは
M
日間続き，
j
日目 (
1 ≦ j ≦ M
) には種類
j
の商品をすべて定価の半額で買うことができる．
セールの期間中に，
Q
人の客が JOI 商店を訪れた．客には
1
から
Q
までの番号が付けられている．客
k
(
1 ≦ k ≦ Q
) はセールの
T
k
日目に JOI 商店を訪れ，商品
L
k
, L
k
+1, …, R
k
を
1
つずつ買った．
セールの効果を調査するため，それぞれの客が商品を買うのにかかった金額を知りたい．
商品の情報と客の情報が与えられたとき，それぞれの客が商品を買うのにかかった金額を求めるプログラムを作成せよ．
制約
1 ≦ N ≦ 200 000
．
1 ≦ M≦ 200 000
．
1 ≦ Q ≦ 200 000
．
2 ≦ P
i
≦ 10
9
(
1 ≦ i ≦ N
)．
P
i
は偶数である (
1 ≦ i ≦ N
)．
1 ≦ A
i
≦ M
(
1 ≦ i ≦ N
)．
1 ≦ T
k
≦ M
(
1 ≦ k ≦ Q
)．
1 ≦ L
k
≦ R
k
≦ N
(
1 ≦ k ≦ Q
)．
入力される値はすべて整数である．
入力
入力は以下の形式で与えられる．
N
M
Q
P
1
A
1
P
2
A
2
︙
P
N
A
N
T
1
L
1
R
1
T
2
L
2
R
2
︙
T
Q
L
Q
R
Q
出力
Q
行出力せよ．
k
行目 (
1 ≦ k ≦ Q
) には，客
k
が商品を買うのにかかった金額を，単位 (円) を省いて出力せよ．
入出力例
入力例 1
5 1 3
10 1
40 1
30 1
20 1
50 1
1 2 4
1 3 5
1 1 5
出力例 1
45
50
75
客
1
が商品を買うのにかかった金額は
40 ÷ 2 + 30 ÷ 2 + 20 ÷ 2 = 45
円であるため，
1
行目には
45
を出力する．
客
2
が商品を買うのにかかった金額は
30 ÷ 2 + 20 ÷ 2 + 50 ÷ 2 = 50
円であるため，
2
行目には
50
を出力する．
客
3
が商品を買うのにかかった金額は
10 ÷ 2 + 40 ÷ 2 + 30 ÷ 2 + 20 ÷ 2 + 50 ÷ 2 = 75
円であるため，
3
行目には
75
を出力する．
入力例 2
5 3 3
10 1
40 3
30 2
20 1
50 3
1 2 4
3 3 5
2 1 5
出力例 2
80
75
135
客
1
が商品を買うのにかかった金額は
40 + 30 + 20 ÷ 2 = 80
円であるため，
1
行目には
80
を出力する．
客
2
が商品を買うのにかかった金額は
30 + 20 + 50 ÷ 2 = 75
円であるため，
2
行目には
75
を出力する．
客
3
が商品を買うのにかかった金額は
10 + 40 + 30 ÷ 2 + 20 + 50 = 135
円であるため，
3
行目には
135
を出力する．
入力例 3
5 5 3
50 2
70 4
20 5
30 1
10 3
4 2 4
5 1 5
2 3 4
出力例 3
85
170
50
入力例 4
10 5 4
2 1
2 5
2 4
2 3
2 4
2 2
2 2
2 4
2 2
2 1
3 2 7
1 1 7
2 1 10
5 5 8
出力例 4
11
13
17
8
入力例 5
10 10 10
741703628 7
231838922 5
920286164 3
763741914 5
246151406 7
54109256 1
966457488 5
441379880 10
458514202 2
224373612 1
5 5 10
2 2 7
1 9 9
1 3 4
9 4 6
1 1 7
9 4 7
4 8 8
7 5 9
1 4 5
出力例 5
1907757100
3182585150
458514202
1684028078
1064002576
3897234150
2030460064
441379880
2043536529
1009893320
情報オリンピック日本委員会
作 『第 23 回日本情報オリンピック (JOI 2023/2024) 二次予選競技課題』
|
[
{
"submission_id": "aoj_0776_11042720",
"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 n, m, q;\n cin >> n >> m >> q;\n\n vector<long long> P(n + 1, 0);\n vector<int> A(n + 1);\n vector<vector<long long>> prefix_by_type(m + 1, vector<long long>(n + 1, 0));\n\n for (int i = 1; i <= n; i++) {\n long long w;\n int t;\n cin >> w >> t;\n A[i] = t;\n P[i] = P[i - 1] + w;\n for (int k = 1; k <= m; k++) {\n prefix_by_type[k][i] = prefix_by_type[k][i - 1] + ((k == t) ? w / 2 : 0);\n }\n }\n\n while (q--) {\n int t, l, r;\n cin >> t >> l >> r;\n long long minus = prefix_by_type[t][r] - prefix_by_type[t][l - 1];\n long long ans = P[r] - P[l - 1] - minus;\n cout << ans << \"\\n\";\n }\n}",
"accuracy": 0.3380281690140845,
"time_ms": 70,
"memory_kb": 34500,
"score_of_the_acc": -0.6531,
"final_rank": 10
},
{
"submission_id": "aoj_0776_10860618",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\nint N, M, Q;\n\nlong long A[200010];\nlong long P[200010];\nlong long T[200010], L[200010], R[200010];\nlong long S[200010], ans[200010], ans2[200010];\n\n\n\nint main()\n{\n cin >> N >> M >> Q;\n vector<vector<long long >> vec(M + 1, vector<long long >(N + 1));\n for (int i = 1; i <= N; i++)\n cin >> P[i] >> A[i];\n \n for (int i = 1; i <= N; i++)\n S[i] += S[i - 1] + P[i];\n \n for (int i = 1; i <= Q; i++) \n cin >> T[i] >> L[i] >> R[i];\n \n for (int i = 1; i <= Q; i++)\n ans[i] = S[R[i]] - S[L[i] - 1];\n \n \n for (int i = 1; i <= M; i++) {\n for (int j = 1; j <= N; j++) {\n if (i == A[j])\n vec.at(i).at(j) = P[j];\n }\n }\n for (int i = 1; i <= M; i++) {\n for (int j = 1; j <= N; j++) {\n vec.at(i).at(j) += vec.at(i).at(j - 1);\n }\n }\n \n \n for (int i = 1; i <= M; i++) {\n for (int j = 1; j <= Q; j++) {\n if (T[j]== i)\n ans2[j] = vec.at(i).at(R[j]) - vec.at(i).at(L[j] - 1);\n }\n }\n \n for (int i = 1; i <= Q; i++)\n cout << ans[i] - ans2[i] / 2 << endl;\n \n return 0;\n\n}",
"accuracy": 0.3380281690140845,
"time_ms": 290,
"memory_kb": 44672,
"score_of_the_acc": -1.5738,
"final_rank": 11
},
{
"submission_id": "aoj_0776_10860617",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\nint N, M, Q;\n\nlong long A[200010];\nlong long P[200010];\nlong long T[200010], L[200010], R[200010];\nlong long S[200010], ans[200010], ans2[200010];\n\n\n\nint main()\n{\n cin >> N >> M >> Q;\n vector<vector<long long >> vec(M + 1, vector<long long >(N + 10));\n for (int i = 1; i <= N; i++)\n cin >> P[i] >> A[i];\n \n for (int i = 1; i <= N; i++)\n S[i] += S[i - 1] + P[i];\n \n for (int i = 1; i <= Q; i++) \n cin >> T[i] >> L[i] >> R[i];\n \n for (int i = 1; i <= Q; i++)\n ans[i] = S[R[i]] - S[L[i] - 1];\n \n \n for (int i = 1; i <= M; i++) {\n for (int j = 1; j <= N; j++) {\n if (i == A[j])\n vec.at(i).at(j) = P[j];\n }\n }\n for (int i = 1; i <= M; i++) {\n for (int j = 1; j <= N; j++) {\n vec.at(i).at(j) += vec.at(i).at(j - 1);\n }\n }\n \n \n for (int i = 1; i <= M; i++) {\n for (int j = 1; j <= Q; j++) {\n if (T[j]== i)\n ans2[j] = vec.at(i).at(R[j]) - vec.at(i).at(L[j] - 1);\n }\n }\n \n for (int i = 1; i <= Q; i++)\n cout << ans[i] - ans2[i] / 2 << endl;\n \n return 0;\n\n}",
"accuracy": 0.3380281690140845,
"time_ms": 290,
"memory_kb": 44952,
"score_of_the_acc": -1.5832,
"final_rank": 13
},
{
"submission_id": "aoj_0776_10860614",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\nint N, M, Q;\n\nlong long A[200010];\nlong long P[200010];\nlong long T[200010], L[200010], R[200010];\nlong long S[200010], ans[200010], ans2[200010];\n\n\n\nint main()\n{\n cin >> N >> M >> Q;\n vector<vector<long long >> vec(M + 1, vector<long long >(N + 10));\n for (int i = 1; i <= N; i++)\n cin >> P[i] >> A[i];\n \n for (int i = 1; i <= N; i++)\n S[i] += S[i - 1] + P[i];\n \n for (int i = 1; i <= Q; i++) \n cin >> T[i] >> L[i] >> R[i];\n \n for (int i = 1; i <= Q; i++)\n ans[i] = S[R[i]] - S[L[i] - 1];\n \n \n for (int i = 1; i <= M; i++) {\n for (int j = 1; j <= N; j++) {\n if (i == A[j])\n vec.at(i).at(j) = P[j];\n }\n }\n for (int i = 1; i <= M; i++) {\n for (int j = 1; j <= N; j++) {\n vec.at(i).at(j) += vec.at(i).at(j - 1);\n }\n }\n \n \n for (int i = 1; i <= Q; i++) {\n for (int j = 1; j <= M; j++) {\n if (T[i]== j)\n ans2[i] = vec.at(j).at(R[i]) - vec.at(j).at(L[i] - 1);\n }\n }\n \n for (int i = 1; i <= Q; i++)\n cout << ans[i] - ans2[i] / 2 << endl;\n \n return 0;\n\n}",
"accuracy": 0.3380281690140845,
"time_ms": 290,
"memory_kb": 44952,
"score_of_the_acc": -1.5832,
"final_rank": 13
},
{
"submission_id": "aoj_0776_10860612",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\nint N, M, Q;\n\nlong long A[200010];\nlong long P[200010];\nlong long T[200010], L[200010], R[200010];\nlong long S[200010], ans[200010], ans2[200010];\n\n\n\nint main()\n{\n cin >> N >> M >> Q;\n vector<vector<long long >> vec(M + 1, vector<long long >(N + 10));\n for (int i = 1; i <= N; i++)\n cin >> P[i] >> A[i];\n \n for (int i = 1; i <= N; i++)\n S[i] += S[i - 1] + P[i];\n \n for (int i = 1; i <= Q; i++) \n cin >> T[i] >> L[i] >> R[i];\n \n for (int i = 1; i <= Q; i++)\n ans[i] = S[R[i]] - S[L[i] - 1];\n \n \n for (int i = 1; i <= M; i++) {\n for (int j = 1; j <= N; j++) {\n if (i == A[j])\n vec.at(i).at(j) = P[j];\n }\n }\n for (int i = 1; i <= M; i++) {\n for (int j = 1; j <= N; j++) {\n vec.at(i).at(j) += vec.at(i).at(j - 1);\n }\n }\n \n \n for (int i = 1; i <= Q; i++) {\n for (int j = 1; j <= M; j++) {\n if (T[i]== j)\n ans2[i] = vec.at(j).at(R[i]) - vec.at(j).at(L[i] - 1);\n }\n }\n \n for (int i = 1; i <= Q; i++)\n cout << ans[i] - ans2[i] / 2 << endl;\n\n}",
"accuracy": 0.3380281690140845,
"time_ms": 290,
"memory_kb": 44948,
"score_of_the_acc": -1.5831,
"final_rank": 12
},
{
"submission_id": "aoj_0776_10860608",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\nint N, M, Q;\n\nlong long A[200010];\nlong long P[200010];\nlong long T[200010], L[200010], R[200010];\nlong long S[200010], ans[200010], ans2[200010];\n\n\n\nint main()\n{\n cin >> N >> M >> Q;\n vector<vector<long long >> vec(M + 1, vector<long long >(N + 1));\n for (int i = 1; i <= N; i++)\n cin >> P[i] >> A[i];\n \n for (int i = 1; i <= N; i++)\n S[i] += S[i - 1] + P[i];\n \n for (int i = 1; i <= Q; i++) \n cin >> T[i] >> L[i] >> R[i];\n \n for (int i = 1; i <= Q; i++)\n ans[i] = S[R[i]] - S[L[i] - 1];\n \n \n for (int i = 1; i <= M; i++) {\n for (int j = 1; j <= N; j++) {\n if (i == A[j])\n vec.at(i).at(j) += vec.at(i).at(j - 1) + P[j];\n }\n }\n for (int i = 1; i <= M; i++) {\n for (int j = 1; j <= N; j++) {\n vec.at(i).at(j) += vec.at(i).at(j - 1);\n }\n }\n \n for (int i = 1; i <= Q; i++) {\n for (int j = 1; j <= M; j++) {\n if (T[i]== j)\n ans2[i] = vec.at(j).at(R[i]) - vec.at(j).at(L[i] - 1);\n }\n }\n \n for (int i = 1; i <= Q; i++)\n cout << ans[i] - ans2[i] / 2 << endl;\n\n}",
"accuracy": 0.08450704225352113,
"time_ms": 10,
"memory_kb": 44656,
"score_of_the_acc": -0.8364,
"final_rank": 15
},
{
"submission_id": "aoj_0776_10827787",
"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 N, M, Q;\n cin >> N >> M >> Q;\n\n vector<long long> P(N+1);\n vector<int> A(N+1);\n for (int i = 1; i <= N; i++) {\n cin >> P[i] >> A[i];\n }\n\n // 全体の累積和\n vector<long long> prefix(N+1, 0);\n for (int i = 1; i <= N; i++) {\n prefix[i] = prefix[i-1] + P[i];\n }\n\n // 種類ごとの位置と累積和\n vector<vector<pair<int,long long>>> kind(M+1);\n vector<long long> sumKind(M+1, 0);\n for (int i = 1; i <= N; i++) {\n int t = A[i];\n sumKind[t] += P[i];\n kind[t].push_back({i, sumKind[t]});\n }\n\n // クエリ処理\n for (int qi = 0; qi < Q; qi++) {\n int T, L, R;\n cin >> T >> L >> R;\n\n // 区間全体の合計\n long long total = prefix[R] - prefix[L-1];\n\n // 種類T の区間合計 (二分探索)\n auto &vec = kind[T];\n long long halfSum = 0;\n if (!vec.empty()) {\n auto itR = upper_bound(vec.begin(), vec.end(), make_pair(R, LLONG_MAX));\n auto itL = upper_bound(vec.begin(), vec.end(), make_pair(L-1, LLONG_MAX));\n if (itR != vec.begin()) {\n halfSum = prev(itR)->second;\n if (itL != vec.begin()) {\n halfSum -= prev(itL)->second;\n }\n }\n }\n\n // 答え = total - halfSum/2\n cout << total - halfSum/2 << \"\\n\";\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 19760,
"score_of_the_acc": -0.1842,
"final_rank": 1
},
{
"submission_id": "aoj_0776_10797411",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <numeric>\n#include <set>\n#include <map>\n#include <queue>\n#include <bit>\n#include <stack>\n\n#pragma region\n\n#define sz(x) (int)((x).size())\n\ntypedef long long i64;\n\nvoid fast_io() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout.tie(nullptr);\n}\n\nvoid debug(const auto &... x) {\n#ifdef ONLINE_JUDGE\n return;\n#endif\n ((std::cerr << x << ' '), ...);\n std::cerr << '\\n';\n}\n\n#define MODULUS 1000000007\n\n#pragma endregion\n\nclass binary_indexed_tree {\npublic:\n binary_indexed_tree(int n) : A(n) {}\n\n void add(int index, i64 x) {\n if (index < 0 || index >= sz(A)) {\n return;\n }\n if (index == 0) {\n A[0] += x;\n return;\n }\n while (index < sz(A)) {\n A[index] += x;\n index += index & -index;\n }\n }\n\n i64 get_prefix_sum(int index) {\n if (index < 0) {\n return 0;\n }\n index = std::min(index, sz(A) - 1);\n i64 ans = A[0];\n while (index) {\n ans += A[index];\n index &= index - 1;\n }\n return ans;\n }\n\n i64 get_range_sum(int a, int b) {\n return get_prefix_sum(b) - get_prefix_sum(a - 1);\n }\n\nprivate:\n std::vector<i64> A;\n};\n\nint N, M, Q;\n\nstd::vector<int> P;\n\nstd::vector<i64> answers;\n\nstd::vector<std::vector<int>> day_to_products;\n\nstruct visitor {\n int index;\n int L;\n int R;\n};\n\nstd::map<int, std::vector<visitor>> visitors;\n\nvoid input() {\n std::cin >> N >> M >> Q;\n P.resize(N);\n day_to_products.resize(M);\n for (int i = 0; i < N; ++i) {\n int day;\n std::cin >> P[i] >> day;\n --day;\n day_to_products[day].push_back(i);\n }\n\n answers.resize(Q);\n for (int i = 0; i < Q; ++i) {\n int T, L, R;\n std::cin >> T >> L >> R;\n --T;\n --L;\n --R;\n visitors[T].emplace_back(i, L, R);\n }\n}\n\nvoid solve() {\n binary_indexed_tree tree(N);\n for (int i = 0; i < N; ++i) {\n tree.add(i, P[i]);\n }\n for (int day = 0; day < M; ++day) {\n for (int p: day_to_products[day]) {\n tree.add(p, -P[p] / 2);\n }\n\n for (auto &v: visitors[day]) {\n answers[v.index] = tree.get_range_sum(v.L, v.R);\n }\n\n for (int p: day_to_products[day]) {\n tree.add(p, P[p] / 2);\n }\n }\n for (auto &x: answers) {\n std::cout << x << \"\\n\";\n }\n}\n\nint main() {\n fast_io();\n input();\n solve();\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 38340,
"score_of_the_acc": -0.9927,
"final_rank": 6
},
{
"submission_id": "aoj_0776_10498700",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <unordered_map>\n#include <algorithm>\n#include <climits>\n\nint main()\n{\n int N, M, Q;\n std::cin >> N >> M >> Q;\n std::vector<long long> P(N+1);\n std::vector<long long> A(N+1);\n P[0] = 0;\n for(int i = 1; i < N+1; i++){\n std::cin >> P.at(i) >> A.at(i);\n }\n \n std::vector<long long> T(Q);\n std::vector<long long> L(Q);\n std::vector<long long> R(Q);\n for(int k = 0; k < Q; k++){\n std::cin >> T.at(k) >> L.at(k) >> R.at(k);\n }\n\n std::vector<long long> TOTAL(N+1);\n TOTAL.at(0) = 0;\n for(int i = 1; i < N+1; i++){\n int p = P.at(i);\n TOTAL.at(i) = p + TOTAL.at(i-1);\n }\n \n std::unordered_map<int, std::vector<std::pair<long long, long long>>> SALE;\n for(int i = 1; i < N+1; i++){\n SALE[A[i]].emplace_back(i, P[i]);\n }\n\n std::unordered_map<int, std::vector<long long>> SALE_TOTAL;\n for(auto &[t, vec] : SALE){\n std::sort(vec.begin(), vec.end());\n SALE_TOTAL[t].resize(vec.size() + 1, 0); // 1-index\n for(int i = 0; i < vec.size(); i++){\n SALE_TOTAL[t][i+1] = SALE_TOTAL[t][i] + vec[i].second / 2;\n }\n }\n\n for(int k = 0; k < Q; k++){\n auto t = T.at(k);\n auto l = L.at(k);\n auto r = R.at(k);\n long long tmp = TOTAL.at(r) - TOTAL.at(l-1);\n long long d = 0;\n if (SALE.count(t)) {\n const auto& vec = SALE[t];\n const auto& st = SALE_TOTAL[t];\n \n auto it_l = lower_bound(vec.begin(), vec.end(), std::make_pair(l, 0LL));\n auto it_r = upper_bound(vec.begin(), vec.end(), std::make_pair(r, LLONG_MAX));\n\n int il = it_l - vec.begin();\n int ir = it_r - vec.begin();\n\n d = st[ir] - st[il];\n }\n \n std::cout << (tmp - d) << std::endl;\n }\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 49524,
"score_of_the_acc": -1.7368,
"final_rank": 9
},
{
"submission_id": "aoj_0776_10446117",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 200005\n\nstruct Info{\n\tll P;\n\tint type;\n};\n\nInfo info[SIZE];\nvector<int> V[SIZE];\nvector<ll> rui[SIZE];\nll A[SIZE];\n\nint main(){\n\n\tint N,M,numQ;\n\tscanf(\"%d %d %d\",&N,&M,&numQ);\n\n\tfor(int i = 1; i <= M; i++){\n\t\trui[i].push_back(0);\n\t}\n\n\tfor(int i = 1; i <= N; i++){\n\n\t\tscanf(\"%lld %d\",&info[i].P,&info[i].type);\n\t\tV[info[i].type].push_back(i);\n\t\trui[info[i].type].push_back(info[i].P/2);\n\t\tA[i] = info[i].P;\n\t\tA[i] += A[i-1];\n\t}\n\n\tfor(int i = 1; i <= M; i++){\n\t\tif(V[i].size() == 0)continue;\n\n\t\tfor(int k = 1; k < rui[i].size(); k++){\n\t\t\trui[i][k] += rui[i][k-1];\n\t\t}\n\t}\n\n\tint T,L,R;\n\n\tfor(int loop = 0; loop < numQ; loop++){\n\n\t\tscanf(\"%d %d %d\",&T,&L,&R);\n\n\t\tif(V[T].size() == 0){\n\n\t\t\tprintf(\"%lld\\n\",A[R]-A[L-1]);\n\t\t\tcontinue;\n\t\t}\n\n\t\tint left = lower_bound(V[T].begin(),V[T].end(),L)-V[T].begin();\n\t\tint right = upper_bound(V[T].begin(),V[T].end(),R)-V[T].begin();\n\t\tright--;\n\n\t\tll ans = A[R]-A[L-1];\n\t\tll minus = rui[T][right+1]-rui[T][left];\n\n\t\tprintf(\"%lld\\n\",ans-minus);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 30032,
"score_of_the_acc": -0.6346,
"final_rank": 3
},
{
"submission_id": "aoj_0776_10446114",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 200005\n\nstruct Info{\n\tll P;\n\tint type;\n};\n\nInfo info[SIZE];\nvector<int> V[SIZE];\nvector<ll> rui[SIZE];\nll A[SIZE];\n\nint main(){\n\n\tint N,M,numQ;\n\tscanf(\"%d %d %d\",&N,&M,&numQ);\n\n\tfor(int i = 1; i <= M; i++){\n\t\trui[i].push_back(0);\n\t}\n\n\tfor(int i = 1; i <= N; i++){\n\n\t\tscanf(\"%lld %d\",&info[i].P,&info[i].type);\n\t\tV[info[i].type].push_back(i);\n\t\trui[info[i].type].push_back(info[i].P/2);\n\t\tA[i] = info[i].P;\n\t\tA[i] += A[i-1];\n\t}\n\n\tfor(int i = 1; i <= M; i++){\n\t\tif(V[i].size() == 0)continue;\n\n\t\tfor(int k = 1; k < rui[i].size(); k++){\n\t\t\trui[i][k] += rui[i][k-1];\n\t\t}\n\t}\n\n\tint T,L,R;\n\n\tfor(int loop = 0; loop < numQ; loop++){\n\n\t\tscanf(\"%d %d %d\",&T,&L,&R);\n\n\t\tif(V[T].size() == 0){\n\n\t\t\tprintf(\"%lld\\n\",A[R]-A[L-1]);\n\t\t\tcontinue;\n\t\t}\n\n\t\tint left = lower_bound(V[T].begin(),V[T].end(),L)-V[T].begin();\n\t\tint right = upper_bound(V[T].begin(),V[T].end(),R)-V[T].begin();\n\t\tright--;\n\n\t\t//printf(\"left:%d right:%d\\n\",left,right);\n\n\t\tll ans = A[R]-A[L-1];\n\t\tll minus = rui[T][right+1]-rui[T][left];\n\n\t\t//printf(\"ans:%lld minus:%lld\\n\",ans,minus);\n\n\t\tprintf(\"%lld\\n\",ans-minus);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 30060,
"score_of_the_acc": -0.6355,
"final_rank": 4
},
{
"submission_id": "aoj_0776_10215650",
"code_snippet": "#include <iostream>\n#include <cstdint>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n{\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\t\n\tuint32_t N, M, Q, i;\n\tcin >> N >> M >> Q;\n\tvector<uint32_t> P(N), A(N), T(Q), L(Q), R(Q);\n\tfor (i = 0; i != N; ++i) cin >> P[i] >> A[i];\n\tfor (i = 0; i != Q; ++i) cin >> T[i] >> L[i] >> R[i];\n\n\tvector<uint64_t> P_csum(N + 1, 0);\n\tfor (i = 0; i != N; ++i) P_csum[i + 1] = P_csum[i] + P[i];\n\n\tvector<vector<pair<uint32_t, uint64_t>>> discount_csum_at_day(M, vector<pair<uint32_t, uint64_t>>(1, { UINT32_MAX, 0 }));\n\tfor (i = 0; i != N; ++i)\n\t{\n\t\tdiscount_csum_at_day[A[i] - 1].back().first = i;\n\t\tdiscount_csum_at_day[A[i] - 1].emplace_back(UINT32_MAX, discount_csum_at_day[A[i] - 1].back().second + (P[i] >> 1));\n\t}\n\n\tfor (i = 0; i != Q; ++i)\n\t{\n\t\tconst auto& now_on_sale = discount_csum_at_day[T[i] - 1];\n\t\tconst auto discount = upper_bound(now_on_sale.begin(), now_on_sale.end(), pair<uint32_t, uint64_t>{ R[i] - 1, UINT64_MAX })->second - lower_bound(now_on_sale.begin(), now_on_sale.end(), pair<uint32_t, uint64_t>{ L[i] - 1, 0 })->second;\n\t\tcout << P_csum[R[i]] - P_csum[L[i] - 1] - discount << '\\n';\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 26004,
"score_of_the_acc": -0.4203,
"final_rank": 2
},
{
"submission_id": "aoj_0776_10122814",
"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\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n int n;\n vector<S> tree;\n segtree() : segtree(0) {}\n segtree(int n) : n(n), tree(vector<S>(n << 1, e())) {}\n segtree(const vector<S> &v) : n((int)v.size()) {\n tree.resize(n * 2);\n for (int i = 0; i < n; ++i) {\n tree[n + i] = v[i];\n }\n for (int i = n - 1; i >= 1; --i) {\n update(i);\n }\n }\n void update(int k) { tree[k] = op(tree[k << 1 | 0], tree[k << 1 | 1]); }\n S operator[](int i) { return tree[i + n]; }\n void set(int i, S x) {\n i += n;\n tree[i] = x;\n while (i >>= 1) {\n update(i);\n }\n }\n // [l,r)\n S query(int l, int r) {\n S sml = e(), smr = e();\n for (l += n, r += n; l < r; l >>= 1, r >>= 1) {\n if (l & 1) sml = op(sml, tree[l++]);\n if (r & 1) smr = op(tree[--r], smr);\n }\n return op(sml, smr);\n }\n};\n\nusing S = ll;\nS op(S a, S b) { return a + b; }\nS e() { return 0LL; }\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n, m, q;\n cin >> n >> m >> q;\n vector<ll> a(n), b(n);\n vector<vector<int>> v(m);\n for (int i = 0; i < n; ++i) {\n cin >> a[i] >> b[i];\n b[i] -= 1;\n v[b[i]].push_back(i);\n }\n segtree<S, op, e> seg(a);\n vector<ll> res(q);\n vector<vector<tuple<int, int, int>>> query(m);\n for (int i = 0; i < q; ++i) {\n int u;\n cin >> u;\n int l, r;\n cin >> l >> r;\n query[u - 1].push_back({l - 1, r, i});\n }\n for (int i = 0; i < m; ++i) {\n for (int j : v[i]) {\n seg.set(j, a[j] / 2);\n }\n for (auto [l, r, idx] : query[i]) {\n res[idx] = seg.query(l, r);\n }\n for (int j : v[i]) {\n seg.set(j, a[j]);\n }\n }\n for (ll i : res) {\n cout << i << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 31120,
"score_of_the_acc": -0.6975,
"final_rank": 5
},
{
"submission_id": "aoj_0776_10118910",
"code_snippet": "#include<bits/stdc++.h>\n\n#include <algorithm>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nint bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <vector>\n\nnamespace atcoder {\n\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n segtree(int n) : segtree(std::vector<S>(n, e())) {}\n segtree(const std::vector<S>& v) : _n(int(v.size())) {\n log = internal::ceil_pow2(_n);\n size = 1 << log;\n d = std::vector<S>(2 * size, e());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n return d[p + size];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n S sml = e(), smr = e();\n l += size;\n r += size;\n\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n template <bool (*f)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return f(x); });\n }\n template <class F> int max_right(int l, F f) {\n assert(0 <= l && l <= _n);\n assert(f(e()));\n if (l == _n) return _n;\n l += size;\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!f(op(sm, d[l]))) {\n while (l < size) {\n l = (2 * l);\n if (f(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n\n template <bool (*f)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return f(x); });\n }\n template <class F> int min_left(int r, F f) {\n assert(0 <= r && r <= _n);\n assert(f(e()));\n if (r == 0) return 0;\n r += size;\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!f(op(d[r], sm))) {\n while (r < size) {\n r = (2 * r + 1);\n if (f(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n private:\n int _n, size, log;\n std::vector<S> d;\n\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n};\n\n} // namespace atcoder\n\nusing namespace atcoder;\nusing namespace std;\n\nusing ll=long long;\nusing vll=vector<ll>;\n#define rep(i,s,t) for(ll i=s;i<t;i++)\n\nll op(ll a,ll b){return a+b;};\nll e(){return 0;};\n\nint main(){\n ll N,M,Q;\n cin>>N>>M>>Q;\n segtree<ll,op,e> seg(N);\n vector<vll> D(M);\n rep(i,0,N){\n ll P,A;\n cin>>P>>A;\n A--;\n D[A].push_back(i);\n seg.set(i,P);\n }\n vector<vector<pair<ll,pair<ll,ll>>>> query(M);\n rep(i,0,Q){\n ll T,L,R;\n cin>>T>>L>>R;\n query[T-1].push_back({i,{L,R}});\n }\n vll AN(Q);\n rep(i,0,M){\n for(auto t:D[i]){\n seg.set(t,seg.get(t)/2);\n }\n for(auto q:query[i]){\n ll L=q.second.first;\n ll R=q.second.second;\n ll p=q.first;\n AN[p]=seg.prod(L-1,R);\n }\n for(auto t:D[i]){\n seg.set(t,seg.get(t)*2);\n }\n }\n rep(i,0,Q)cout<<AN[i]<<endl;\n}",
"accuracy": 1,
"time_ms": 390,
"memory_kb": 30864,
"score_of_the_acc": -1.3731,
"final_rank": 8
},
{
"submission_id": "aoj_0776_10092241",
"code_snippet": "// AOJ #776\n// Shopping 2 2025.1.11\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n/*\n 問題の制約:\n - 1 <= N, M, Q <= 200000\n - 2 <= P_i <= 10^9, かつ P_i は偶数\n - 1 <= A_i <= M\n - 1 <= T_k <= M\n - 1 <= L_k <= R_k <= N\n*/\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n // 入力受け取り\n long long N, M, Q;\n cin >> N >> M >> Q;\n\n vector<long long> P(N);\n vector<int> A(N);\n for(int i = 0; i < N; i++){\n cin >> P[i] >> A[i];\n // A[i] は 1-indexed で与えられるので，後で配列に入れるときは 0-indexed に合わせるかどうか注意\n A[i]--; // 種類A_iを0-indexed化 (0 <= A[i] < M)\n }\n\n // まず「全商品の価格の累積和」を作る (1-indexed の累積和を使いたいので要注意)\n // prefAll[i] = P[0] + ... + P[i-1] ( i: 1..N )\n // ようにしておくときはサイズN+1で作る。\n vector<long long> prefAll(N+1, 0LL);\n for(int i = 0; i < N; i++){\n prefAll[i+1] = prefAll[i] + P[i];\n }\n\n // 種類ごとに「その種類に属する商品」の(添字,価格)を格納し，ついでに価格のみの累積和を作る\n // typePos[t] : 種類tに属する商品の\"添字 i(0-indexed)\"を昇順に並べる\n // typeVal[t] : その商品価格 P[i]\n // typePref[t] : typeVal[t] のprefix sum (要素数+1)\n vector<vector<int>> typePos(M);\n vector<vector<long long>> typeVal(M);\n // 入力が 1 から N の順番で与えられるので，\n // i が増加していくにつれ i は自動的に昇順になるためソート不要。\n for(int i = 0; i < N; i++){\n int t = A[i]; // 0-indexed 種類\n typePos[t].push_back(i);\n typeVal[t].push_back(P[i]);\n }\n\n // 各種類ごとに prefix sum を作る\n vector<vector<long long>> typePref(M);\n for(int t = 0; t < (int)M; t++){\n typePref[t].resize(typeVal[t].size()+1, 0LL);\n for(int i = 0; i < (int)typeVal[t].size(); i++){\n typePref[t][i+1] = typePref[t][i] + typeVal[t][i];\n }\n }\n\n // クエリ処理\n // クエリ (T_k, L_k, R_k) は 1-indexed で与えられるので注意\n // 計算式:\n // cost = (prefAll[R_k] - prefAll[L_k - 1]) - (1/2)* ( 種類T_k の [L_k..R_k] 範囲の価格合計 )\n\n // 種類T_k は入力時に1-indexedなので 0-indexedに直して扱う\n // 区間 [L, R] も0-indexedで扱うには [L_k - 1, R_k - 1] にする\n\n while(Q--){\n long long T_k, L_k, R_k;\n cin >> T_k >> L_k >> R_k;\n T_k--; // 種類も0-index化\n // いったん 0-index 化\n L_k--; \n R_k--; \n\n // 全商品の定価合計 (区間 [L_k, R_k])\n long long total = prefAll[R_k+1] - prefAll[L_k];\n\n // 種類 T_k の区間 [L_k, R_k] の合計価格を2分探索で求める\n // typePos[T_k] の中で L_k 以上の位置に初めて登場する要素 idxL\n // かつ R_k 以下の位置に最後に登場する要素 idxR を見つければよい\n // idxL = lower_bound(pos.begin(), pos.end(), L_k)\n // idxR = upper_bound(pos.begin(), pos.end(), R_k) - 1\n // idxL <= idxR なら区間が存在\n const auto &posVec = typePos[T_k]; // 種類T_kに該当する商品の添字リスト\n const auto &prefVec = typePref[T_k]; // その累積和\n\n long long sumType = 0LL;\n // lower_bound, upper_bound\n auto itL = std::lower_bound(posVec.begin(), posVec.end(), (int)L_k);\n auto itR = std::upper_bound(posVec.begin(), posVec.end(), (int)R_k);\n\n if(itL != posVec.end() && itR != posVec.begin()){\n // itR は区間外の一つ後ろなので itR-1 が実際の区間終端\n // ただし itL > itR-1 の場合は該当なし\n int idxL = (int)std::distance(posVec.begin(), itL);\n int idxR = (int)std::distance(posVec.begin(), itR) - 1;\n if(idxL <= idxR){\n sumType = prefVec[idxR+1] - prefVec[idxL];\n }\n }\n\n // 実際の支払金額 = total - sumType/2\n // (問題文より P_i は偶数なので /2 は割り切れる)\n long long ans = total - sumType / 2LL;\n\n cout << ans << \"\\n\";\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 39748,
"score_of_the_acc": -1.0137,
"final_rank": 7
}
] |
aoj_0790_cpp
|
感染シミュレーション (Infection Simulation)
問題文
EGOI 食堂には昨日
N
人の客が来店した．
客には
1
から
N
までの番号が付けられており，客
i
(
1 ≦ i ≦ N
) の来店時刻は
L
i
，退店時刻は
R
i
であった．
そして今日，客のうち
1
人が，現在 JOI 国で流行している新型の感染症 X に感染した状態で来店したことが明らかになった．
感染症 X の
感染しづらさ
は整数
x
で表される．
具体的には，
1 ≦ i ≦ N
について，客
i
が
1
人以上の感染者と同時に食堂内にいた時間の累計が
x
以上となったタイミングで，客
i
は新たに感染者となる．
さて，JOI 国では厳格な感染症対策を行っているため，感染者数を正確に把握しなければならない．
しかし困ったことに，誰が感染症 X に感染したかの情報は得られておらず，感染しづらさを表す整数
x
も分かっていない．
そこで EGOI 食堂の店長である理恵さんは，
Q
個のシナリオについて，最終的に何人の客が感染するのかを求めることにした．
j
番目 (
1 ≦ j ≦ Q
) のシナリオでは，最初の感染者が客
P
j
のみであり，感染症 X の感染しづらさが
X
j
である．
来店した客およびシナリオの情報が与えられたとき，それぞれのシナリオにおける最終的な感染者数を出力するプログラムを作成せよ．
ただし，退店時刻ちょうどに感染した場合も，感染者数に含めるものとする．
また，感染症 X に一度感染した客が感染者でなくなることは考えないものとする．
制約
1 ≦ N ≦ 100 000
．
0 ≦ L
i
＜ R
i
≦ 10
9
(
1 ≦ i ≦ N
)．
1 ≦ Q ≦ 100 000
．
1 ≦ P
j
≦ N
(
1 ≦ j ≦ Q
)．
1 ≦ X
j
≦ 10
9
(
1 ≦ j ≦ Q
)．
入力される値はすべて整数である．
入力
入力は以下の形式で与えられる．
N
L
1
R
1
L
2
R
2
︙
L
N
R
N
Q
P
1
X
1
P
2
X
2
︙
P
Q
X
Q
出力
Q
行出力せよ．
j
行目 (
1 ≦ j ≦ Q
) には，
j
番目のシナリオにおける最終的な感染者数を出力せよ．
入出力例
入力例 1
4
10 40
20 80
45 60
70 95
1
1 15
出力例 1
3
1
番目のシナリオでは，最初の感染者が客
1
，感染症 X の感染しづらさが
15
であるため，以下のようにして感染が広がる．
時刻
10
に客
1
が来店する．
時刻
20
に客
2
が来店する．
時刻
35
に客
2
が
1
人以上の感染者と同時に食堂内にいた時間の累計が
15
となり，客
2
が感染する．
時刻
40
に客
1
が退店する．
時刻
45
に客
3
が来店する．
時刻
60
に客
3
が
1
人以上の感染者と同時に食堂内にいた時間の累計が
15
となり，客
3
が感染する．同時に，客
3
が退店する．
時刻
70
に客
4
が来店する．
時刻
80
に客
2
が退店する．
時刻
95
に客
4
が退店する．客
4
が
1
人以上の感染者と同時に食堂内にいたのは時刻
70
から時刻
80
までであり，時間の累計は
10
であるため，客
4
は感染しない．
最終的に客
1, 2, 3
の
3
人が感染するため，
1
行目には
3
を出力する．
入力例 2
8
0 30
0 90
0 80
0 60
0 20
0 40
0 70
0 50
3
1 30
1 40
4 50
出力例 2
7
1
5
1
番目のシナリオでは，最終的に客
1, 2, 3, 4, 6, 7, 8
の
7
人が感染するため，
1
行目には
7
を出力する．
2
番目のシナリオでは，最終的に客
1
の
1
人が感染するため，
2
行目には
1
を出力する．
3
番目のシナリオでは，最終的に客
2, 3, 4, 7, 8
の
5
人が感染するため，
3
行目には
5
を出力する．
入力例 3
5
0 10
0 10
0 10
0 10
0 10
4
1 9
1 10
1 11
1 1000000000
出力例 3
5
5
1
1
入力例 4
7
38 61
13 27
10 54
22 56
49 75
27 47
70 99
1
3 10
出力例 4
6
入力例 5
10
10 20
11 21
13 23
16 26
20 30
25 35
31 41
38 48
46 56
80 90
4
1 3
1 6
1 8
1 10
出力例 5
8
5
3
1
入力例 6
7
10 54
38 61
13 27
22 56
49 75
27 47
70 99
5
1 3
1 6
1 9
1 12
1 15
出力例 6
7
6
6
6
4
入力例 7
7
38 61
13 27
10 54
22 56
49 75
27 47
70 99
5
1 10
2 10
3 10
4 10
5 10
出力例 7
4
6
6
5
2
情報オリンピック日本委員会
作『日本情報オリンピック第4回女性部門 本選 競技課題』
|
[
{
"submission_id": "aoj_0790_10907773",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n; cin >> n; vector<int> B;\n vector<pair<int,int>> A(n); for (auto& [a,b]:A) (cin >> a >> b),B.emplace_back(b);\n sort(B.begin(),B.end()),B.erase(unique(B.begin(),B.end()),B.end()); int m = B.size();\n vector<int> segtree(2*m); vector<vector<int>> dsegtree(2*m);\n auto psolve = [&](){\n multiset<int> M;vector<vector<int>> D(m);\n for (int i(0);i < n;++i) D[lower_bound(B.begin(),B.end(),A[i].second)-B.begin()].emplace_back(A[i].first);\n for (int i(m-1);i > -1;--i){\n if (*M.begin()>=B[i]) M.clear();\n segtree[m+i] = (M.empty()?0:B[i]-(*M.begin()));\n for (int a:D[i]) M.emplace(a);\n }\n for (int i(m-1);i;--i) segtree[i] = min(segtree[i<<1],segtree[i<<1|1]);\n for (int i(0);i < n;++i) for (int k(lower_bound(B.begin(),B.end(),A[i].second)-B.begin()+m);k;k>>=1){\n dsegtree[k].emplace_back(A[i].second-A[i].first);\n }\n for (int i(0);i < m+m;++i) sort(dsegtree[i].begin(),dsegtree[i].end());\n };\n psolve(); int q; cin >> q;\n //for (int i(m);i < m+m;++i) cout << segtree[i] << endl;\n while(q--){\n int p,e; cin >> p >> e; --p; int bf = 0,bs = 0;\n for (int l(lower_bound(B.begin(),B.end(),A[p].second)-B.begin()+m),r(m+m);l < r;l>>=1,r>>=1){\n //cout << m << ' ' << l << ' ' << r << endl;\n if (l&1) if (segtree[l++]<e&&bf==0) bf = l-1;\n if (r&1) if (segtree[--r]<e) bs = r;\n }\n int i = (bf?bf:bs);\n while(i<m){\n i<<=1;\n if (segtree[i]>=e) i|=1;\n }\n int res(0);\n for (int l(lower_bound(B.begin(),B.end(),A[p].first+e)-B.begin()+m),r(i+1);l < r;l>>=1,r>>=1){\n //cout << l << ' ' << r << ' ';\n if (l&1) res += dsegtree[l].end()-lower_bound(dsegtree[l].begin(),dsegtree[l].end(),e),++l;\n if (r&1) --r,res += dsegtree[r].end()-lower_bound(dsegtree[r].begin(),dsegtree[r].end(),e);\n //cout << res << endl;\n }\n cout << (A[p].second-A[p].first<e?1:res) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 380,
"memory_kb": 32376,
"score_of_the_acc": -0.5151,
"final_rank": 4
},
{
"submission_id": "aoj_0790_10573526",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int MAX = 100007;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(int n) { // 整数の表示（出力）\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nint L[MAX], R[MAX];\nint P[MAX], X[MAX];\nint par[MAX], seg[MAX];\nint ans[MAX];\n\nstruct UnionFind {\n int parent[MAX];\n UnionFind() {\n iota(parent, parent + MAX, 0);\n }\n int find(int x) {\n if (x == parent[x]) return x;\n return parent[x] = find(parent[x]);\n }\n void merge(int a, int b) {\n a = find(a), b = find(b);\n if (a == b) return;\n parent[a] = b;\n }\n} uf;\n\nstruct FenwickTree {\n int tree[MAX] = {0};\n void update(int i, int v) {\n for (; i < MAX; i += i & -i) tree[i] += v;\n }\n int query(int L, int R) {\n int sum = 0;\n L--;\n for (; R; R -= R & -R) sum += tree[R];\n for (; L; L -= L & -L) sum -= tree[L];\n return sum;\n }\n} fenw;\n\nint main() {\n int N = Cin();\n for (int i = 1; i <= N; ++i) L[i] = Cin(), R[i] = Cin();\n int Q = Cin();\n for (int i = 1; i <= Q; ++i) P[i] = Cin(), X[i] = Cin();\n\n vector<pair<pair<int, int>, int>> ord;\n for (int i = 1; i <= N; ++i) ord.emplace_back(make_pair(L[i], R[i]), i);\n sort(ord.begin(), ord.end(), [&](auto a, auto b) {\n auto [leftA, rightA] = a.first;\n auto [leftB, rightB] = b.first;\n if (leftA != leftB) return leftA < leftB;\n if (rightA != rightB) return rightA > rightB;\n return a.second < b.second;\n });\n\n vector<pair<pair<int, int>, int>> segStack;\n vector<pair<int, int>> nestedSegments;\n for (int i = 0; i < N; ++i) {\n auto [currentLeftRight, segID] = ord[i];\n auto [curLeft, curRight] = currentLeftRight;\n if (!segStack.empty() && curRight <= segStack.back().first.second) {\n par[segID] = segStack.back().second;\n nestedSegments.push_back(currentLeftRight);\n }\n else {\n seg[segID] = segStack.size();\n par[segID] = segID;\n segStack.push_back({currentLeftRight, segID});\n }\n }\n\n vector<pair<int, int>> gaps;\n int stackSize = segStack.size();\n for (int i = 0; i + 1 < stackSize; ++i) {\n int gap = segStack[i].first.second - segStack[i + 1].first.first;\n gaps.emplace_back(gap, i);\n }\n sort(gaps.begin(), gaps.end());\n\n vector<tuple<int, int, int>> queries;\n for (int i = 1; i <= Q; ++i) {\n if (R[P[i]] - L[P[i]] < X[i]) {\n ans[i] = 1;\n continue;\n }\n queries.emplace_back(X[i], seg[par[P[i]]], i);\n }\n sort(queries.begin(), queries.end(), greater<tuple<int, int, int>>());\n\n vector<pair<int, int>> segLengthRight;\n vector<int> uniqueRight;\n uniqueRight.push_back(-1000000000);\n for (int i = 1; i <= N; ++i) {\n uniqueRight.push_back(R[i]);\n segLengthRight.emplace_back(R[i] - L[i], R[i]);\n }\n sort(uniqueRight.begin(), uniqueRight.end());\n uniqueRight.erase(unique(uniqueRight.begin(), uniqueRight.end()), uniqueRight.end());\n sort(segLengthRight.begin(), segLengthRight.end());\n\n for (auto [thresh, stackPos, qID] : queries) {\n while (!gaps.empty() && thresh <= gaps.back().first) {\n auto [_, pos] = gaps.back();\n gaps.pop_back();\n uf.merge(pos, pos + 1);\n }\n int rootIndex = uf.find(stackPos);\n int queryLeft = L[P[qID]];\n int queryRight = segStack[rootIndex].first.second;\n\n while (!segLengthRight.empty() && thresh <= segLengthRight.back().first) {\n auto [_, rightVal] = segLengthRight.back();\n segLengthRight.pop_back();\n int pos = lower_bound(uniqueRight.begin(), uniqueRight.end(), rightVal) - uniqueRight.begin();\n fenw.update(pos, 1);\n }\n int leftIndex = lower_bound(uniqueRight.begin(), uniqueRight.end(), queryLeft + thresh) - uniqueRight.begin();\n int rightIndex = upper_bound(uniqueRight.begin(), uniqueRight.end(), queryRight) - uniqueRight.begin();\n ans[qID] = fenw.query(leftIndex, rightIndex - 1);\n }\n for (int i = 1; i <= Q; ++i) Cout(ans[i]);\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 14336,
"score_of_the_acc": -0.0665,
"final_rank": 2
},
{
"submission_id": "aoj_0790_10565253",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconstexpr int MAX = 100007;\n\nstruct UnionFind {\n vector<int> parent;\n UnionFind(int n) : parent(n) { iota(parent.begin(), parent.end(), 0); }\n int find(int x) { return x == parent[x] ? x : parent[x] = find(parent[x]); }\n void merge(int a, int b) {\n a = find(a), b = find(b);\n if (a != b) parent[a] = b;\n }\n};\n\nstruct FenwickTree {\n vector<int> tree;\n int N;\n FenwickTree(int n) : tree(n + 2, 0), N(n + 2) {}\n void update(int i, int v) {\n for (; i < N; i += i & -i) tree[i] += v;\n }\n int query(int L, int R) {\n int sum = 0;\n L--;\n for (; R; R -= R & -R) sum += tree[R];\n for (; L; L -= L & -L) sum -= tree[L];\n return sum;\n }\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int N; cin >> N;\n vector<int> L(N + 1), R(N + 1);\n for (int i = 1; i <= N; ++i) cin >> L[i] >> R[i];\n int Q; cin >> Q;\n vector<int> P(Q + 1), X(Q + 1);\n for (int i = 1; i <= Q; ++i) cin >> P[i] >> X[i];\n\n vector<pair<pair<int, int>, int>> ord;\n for (int i = 1; i <= N; ++i)\n ord.emplace_back(make_pair(L[i], R[i]), i);\n\n sort(ord.begin(), ord.end(), [&](auto& a, auto& b) {\n auto [leftA, rightA] = a.first;\n auto [leftB, rightB] = b.first;\n if (leftA != leftB) return leftA < leftB;\n if (rightA != rightB) return rightA > rightB;\n return a.second < b.second;\n });\n\n vector<pair<pair<int, int>, int>> segStack;\n vector<pair<int, int>> nestedSegments;\n vector<int> par(N + 1), seg(N + 1);\n for (int i = 0; i < N; ++i) {\n auto [currentLeftRight, segID] = ord[i];\n auto [curLeft, curRight] = currentLeftRight;\n if (!segStack.empty() && curRight <= segStack.back().first.second) {\n par[segID] = segStack.back().second;\n nestedSegments.push_back(currentLeftRight);\n } else {\n seg[segID] = segStack.size();\n par[segID] = segID;\n segStack.emplace_back(currentLeftRight, segID);\n }\n }\n\n vector<pair<int, int>> gaps;\n int stackSize = segStack.size();\n for (int i = 0; i + 1 < stackSize; ++i) {\n int gap = segStack[i].first.second - segStack[i + 1].first.first;\n gaps.emplace_back(gap, i);\n }\n sort(gaps.begin(), gaps.end());\n\n vector<tuple<int, int, int>> queries;\n vector<int> ans(Q + 1, 0);\n for (int i = 1; i <= Q; ++i) {\n if (R[P[i]] - L[P[i]] < X[i]) {\n ans[i] = 1;\n continue;\n }\n queries.emplace_back(X[i], seg[par[P[i]]], i);\n }\n sort(queries.begin(), queries.end(), greater<tuple<int, int, int>>());\n\n vector<pair<int, int>> segLengthRight;\n vector<int> uniqueRight = {-1000000000};\n for (int i = 1; i <= N; ++i) {\n uniqueRight.push_back(R[i]);\n segLengthRight.emplace_back(R[i] - L[i], R[i]);\n }\n sort(uniqueRight.begin(), uniqueRight.end());\n uniqueRight.erase(unique(uniqueRight.begin(), uniqueRight.end()), uniqueRight.end());\n sort(segLengthRight.begin(), segLengthRight.end());\n\n UnionFind uf(stackSize + 2);\n FenwickTree fenw(uniqueRight.size() + 2);\n\n for (auto [thresh, stackPos, qID] : queries) {\n while (!gaps.empty() && thresh <= gaps.back().first) {\n auto [_, pos] = gaps.back();\n gaps.pop_back();\n uf.merge(pos, pos + 1);\n }\n int rootIndex = uf.find(stackPos);\n int queryLeft = segStack[rootIndex].first.first;\n int queryRight = segStack[rootIndex].first.second;\n\n while (!segLengthRight.empty() && thresh <= segLengthRight.back().first) {\n auto [_, rightVal] = segLengthRight.back();\n segLengthRight.pop_back();\n int pos = lower_bound(uniqueRight.begin(), uniqueRight.end(), rightVal) - uniqueRight.begin();\n fenw.update(pos, 1);\n }\n int leftIndex = lower_bound(uniqueRight.begin(), uniqueRight.end(), queryLeft + thresh) - uniqueRight.begin();\n int rightIndex = upper_bound(uniqueRight.begin(), uniqueRight.end(), queryRight) - uniqueRight.begin();\n ans[qID] = fenw.query(leftIndex, rightIndex - 1);\n }\n\n for (int i = 1; i <= Q; ++i) cout << ans[i] << '\\n';\n return 0;\n}",
"accuracy": 0.08620689655172414,
"time_ms": 40,
"memory_kb": 11020,
"score_of_the_acc": -0.0104,
"final_rank": 6
},
{
"submission_id": "aoj_0790_10565149",
"code_snippet": "// AOJ #790 Infection Simulation\n// 2025.3.7\n// C++20に適合させ、コメントを追加\n\n#include <iostream> // std::cin, std::cout の代わりに getchar_unlocked, putchar_unlocked を使用\n#include <vector>\n#include <algorithm> // std::sort, std::unique, std::lower_bound, std::upper_bound\n#include <numeric> // std::iota\n#include <utility> // std::pair, std::make_pair\n#include <tuple> // std::tuple, std::get\n\n// 定数\nconst int MAX_N_Q = 100007; // N および Q の最大値 +α\nconst int INF_NEG = -1000000000; // 非常に小さい値\n\n// 高速入出力関数 (元のコードから流用)\n// getchar_unlocked, putchar_unlocked は POSIX 環境でのみ利用可能で、\n// 標準C++ではないため、環境によってはコンパイルエラーになる可能性があります。\n// 標準的な std::cin, std::cout を使う場合は、この部分を置き換えてください。\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の高速入力\n int n = 0;\n char c = gc();\n // 負の数には非対応と仮定 (問題の制約 L_i >= 0 より)\n while (c < '0' || c > '9') c = gc(); // 数字が来るまで読み飛ばし\n do {\n n = 10 * n + (c & 0xf); // c - '0' と同等\n c = gc();\n } while (c >= '0' && c <= '9'); // 数字である間処理を続ける\n return n;\n}\n\nvoid Cout(int n) { // 整数の高速表示（出力）\n char b[30]; // 十分なサイズのバッファ\n if (n == 0) { // 0 の場合\n pc('0');\n } else {\n if (n < 0) { // 負の数の場合\n pc('-');\n n = -n;\n }\n int i = 0;\n while (n > 0) {\n b[i++] = (n % 10) + '0';\n n /= 10;\n }\n while (i-- > 0) { // 逆順に出力\n pc(b[i]);\n }\n }\n pc('\\n');\n}\n\n// グローバル変数 (問題の制約に合わせてサイズを設定)\nint L[MAX_N_Q], R[MAX_N_Q]; // 各客の来店時刻 L と退店時刻 R\nint P[MAX_N_Q], X[MAX_N_Q]; // 各クエリの初期感染者 P と感染しきい値 X\nint par[MAX_N_Q]; // 区間の親子関係 (包含関係) を示す配列\nint seg_group_id[MAX_N_Q]; // 各区間が属する\"スタック上の\"区間グループのID\nint ans[MAX_N_Q]; // 各クエリの答えを格納する配列\n\n// Union-Find (素集合データ構造)\nstruct UnionFind {\n int parent[MAX_N_Q];\n\n UnionFind() {\n // 各要素の親を自身として初期化\n std::iota(parent, parent + MAX_N_Q, 0);\n }\n\n // x の根を見つける (経路圧縮付き)\n int find(int x) {\n if (x == parent[x]) return x;\n return parent[x] = find(parent[x]);\n }\n\n // a と b の属する集合を併合する\n void merge(int a, int b) {\n a = find(a);\n b = find(b);\n if (a == b) return; // 同じ集合に属する場合は何もしない\n parent[a] = b; // a の根を b の根に繋ぐ\n }\n} uf;\n\n// Fenwick Tree (Binary Indexed Tree - BIT)\nstruct FenwickTree {\n int tree[MAX_N_Q] = {0}; // 内部配列を0で初期化\n\n // 位置 i に値 v を加算する\n void update(int i, int v) {\n // 1-indexed で動作するため、i > 0 を想定\n for (; i < MAX_N_Q; i += i & -i) { // i に i の最下位ビットを加算して次のインデックスへ\n tree[i] += v;\n }\n }\n\n // 区間 [L, R] (1-indexed) の合計を問い合わせる\n int query(int qL, int qR) {\n if (qL > qR) return 0; // 無効な区間の場合は0\n int sum_R = 0;\n // 内部の tree は 1-indexed の累積和を保持していると考える\n // query(R) - query(L-1) を計算する\n for (; qR > 0; qR -= qR & -qR) {\n sum_R += tree[qR];\n }\n qL--; // L-1 の和を求めるためにデクリメント\n int sum_L_minus_1 = 0;\n for (; qL > 0; qL -= qL & -qL) {\n sum_L_minus_1 += tree[qL];\n }\n return sum_R - sum_L_minus_1;\n }\n};\nFenwickTree fenw; // Fenwick Tree のインスタンス\n\n\nint main() {\n // 高速化のためのおまじない (getchar_unlocked を使う場合は不要なことが多い)\n // std::ios_base::sync_with_stdio(false);\n // std::cin.tie(nullptr);\n\n int N = Cin(); // 客の数\n for (int i = 1; i <= N; ++i) {\n L[i] = Cin();\n R[i] = Cin();\n }\n\n int Q = Cin(); // クエリの数\n for (int i = 1; i <= Q; ++i) {\n P[i] = Cin(); // 初期感染者 (1-indexed)\n X[i] = Cin(); // 感染しきい値\n }\n\n // 客の滞在区間をソートするための準備\n // pair<pair<int, int>, int> は {{L_i, R_i}, i} を表す\n std::vector<std::pair<std::pair<int, int>, int>> ord;\n ord.reserve(N); // 事前にメモリを確保\n for (int i = 1; i <= N; ++i) {\n ord.emplace_back(std::make_pair(L[i], R[i]), i);\n }\n\n // 区間のソート:\n // 1. L_i が小さい順\n // 2. L_i が同じなら R_i が大きい順 (包含関係を見つけやすくするため)\n // 3. L_i, R_i が同じなら元のIDが小さい順 (安定ソートのため)\n std::sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) {\n // C++17 構造化束縛 (ラムダ内でも使える)\n auto [leftA, rightA] = a.first;\n auto [leftB, rightB] = b.first;\n if (leftA != leftB) return leftA < leftB;\n if (rightA != rightB) return rightA > rightB; // R が大きい方を前に\n return a.second < b.second;\n });\n\n // 区間の包含関係を処理し、\"スタック\"構造を構築する\n // segStack は、互いに包含関係にない区間（または最も外側の区間）を保持する\n std::vector<std::pair<std::pair<int, int>, int>> segStack;\n // nestedSegments は、何らかの区間に包含される区間を保持する（このコードでは直接使われていないように見えるが、元の意図を尊重）\n // std::vector<std::pair<int, int>> nestedSegments; // この変数は最終的なロジックで使われていないためコメントアウトも検討\n\n for (int i = 0; i < N; ++i) {\n auto [currentLeftRight, segID] = ord[i]; // 現在処理中の区間とそのID\n auto [curLeft, curRight] = currentLeftRight;\n\n // segStack の末尾の区間が現在の区間を包含するかどうか\n // ord のソート順 (L昇順、R降順) により、新しく処理する区間が\n // stack の末尾の区間に包含される場合、それは nested segment となる。\n // そうでない場合は、stack の末尾の区間は現在の区間と交差しないか、\n // 現在の区間が stack の末尾の区間より「右」にあることになる。\n // curRight <= segStack.back().first.second の条件は、現在の区間の右端が\n // スタックのトップの区間の右端の内側にあるか等しいか、つまり包含関係を示唆する。\n while (!segStack.empty() && curRight <= segStack.back().first.second) {\n // 現在の区間がスタックトップに包含される場合\n par[segID] = segStack.back().second; // 親区間を設定\n // nestedSegments.push_back(currentLeftRight); // 元のコードにあったが、この変数は後続で使われていない\n // このループは、現在の区間を直接包含する最も内側のスタック上の区間を見つけるためのものかもしれない\n // ただし、元のコードのロジックでは、このループは1回で終わるか、入らない。\n // なぜなら、ソート順により L_current >= L_stack_top であり、\n // R_current <= R_stack_top ならば、ネストしている。\n // もし R_current > R_stack_top ならば、ネストしていないのでループに入らない。\n // もし L_current == L_stack_top ならば、R_current <= R_stack_top (ソート順より)\n // このループは、実際にはスタックトップが現在の区間を包含する場合のみ１回実行される\n // もしくは、より深い包含関係を探る意図があったのかもしれないが、現在のコードでは\n // スタックトップの区間が現在の区間を包含する場合のみ par が設定される。\n // 下の else if でスタックからpopするロジックがないため、\n // 厳密な「区間木」のようなスタック処理とは異なる。\n break; // 最初の包含親が見つかればOK\n }\n // 上のwhileは、実際にはifに近い挙動になるはず。\n // 元のコードのロजिक: if (!segStack.empty() && curRight <= segStack.back().first.second)\n if (!segStack.empty() && curRight <= segStack.back().first.second) {\n par[segID] = segStack.back().second;\n } else {\n // 現在の区間がスタックトップに包含されない場合、新しい\"外側\"の区間として扱う\n // seg_group_id は、この区間が segStack の何番目の要素に対応するかを示す\n seg_group_id[segID] = segStack.size();\n par[segID] = segID; // 自分自身を親とする (根)\n segStack.push_back({currentLeftRight, segID});\n }\n }\n\n\n // segStack に残った区間間の \"ギャップ\" を計算\n // ギャップ: segStack[i] の右端と segStack[i+1] の左端の差\n // これが小さいほど、これらの区間グループは「繋がりやすい」\n std::vector<std::pair<int, int>> gaps;\n int stackSize = segStack.size();\n if (stackSize > 0) { // stackSize が 0 の場合を考慮\n gaps.reserve(stackSize -1 > 0 ? stackSize -1 : 0);\n }\n\n\n for (int i = 0; i + 1 < stackSize; ++i) {\n // ギャップ = 前の区間の右端 - 次の区間の左端\n // このギャップは、感染が広がる際の「途切れ目」のコストと解釈できる\n int gap_value = segStack[i].first.second - segStack[i + 1].first.first;\n gaps.emplace_back(gap_value, i); // {ギャップの大きさ, segStack でのインデックス i}\n }\n std::sort(gaps.begin(), gaps.end()); // ギャップが小さい順にソート\n\n // クエリを処理しやすいように変換・ソート\n // tuple<int, int, int> は {X_j, seg_group_id[par[P_j]], 元のクエリID j}\n std::vector<std::tuple<int, int, int>> queries;\n queries.reserve(Q);\n for (int i = 1; i <= Q; ++i) {\n // 初期感染者自身の滞在期間が X_j より短い場合、感染は広がらず、感染者は1人\n if (R[P[i]] - L[P[i]] < X[i]) {\n ans[i] = 1;\n continue;\n }\n // P[i] の親 (最も外側の包含区間、または自身) が属する segStack 上のグループIDを取得\n // queries に {感染しきい値 X, 初期感染者の属するスタックグループID, 元のクエリID} を格納\n queries.emplace_back(X[i], seg_group_id[par[P[i]]], i);\n }\n // クエリを X_j (感染しきい値) が大きい順にソート\n // これにより、X_j が大きい (感染しにくい) ものから処理できる\n // ギャップをマージしていく際、X_j が大きいものは少ないマージで済む\n std::sort(queries.begin(), queries.end(), std::greater<std::tuple<int, int, int>>());\n\n\n // Fenwick Tree で使うための準備\n // segLengthRight: {区間の長さ, 区間の右端 R_i}\n // uniqueRight: 全ての R_i を集めてソートし、重複を除いたもの (座標圧縮用)\n std::vector<std::pair<int, int>> segLengthRight;\n std::vector<int> uniqueRight;\n segLengthRight.reserve(N);\n uniqueRight.reserve(N + 1); // ダミーの最小値も入れるため\n\n uniqueRight.push_back(INF_NEG); // 番兵として非常に小さい値を追加\n for (int i = 1; i <= N; ++i) {\n uniqueRight.push_back(R[i]);\n segLengthRight.emplace_back(R[i] - L[i], R[i]);\n }\n std::sort(uniqueRight.begin(), uniqueRight.end());\n // uniqueRight から重複を削除\n uniqueRight.erase(std::unique(uniqueRight.begin(), uniqueRight.end()), uniqueRight.end());\n // segLengthRight を区間の長さが大きい順にソート\n std::sort(segLengthRight.begin(), segLengthRight.end(), std::greater<std::pair<int, int>>());\n\n\n // ソートされたクエリを処理\n for (const auto& query_tuple : queries) {\n auto [thresh_X, initial_stack_pos, qID] = query_tuple; // 構造化束縛で要素を取得\n\n // 現在の感染しきい値 thresh_X 以下のギャップを持つ区間グループを Union-Find で併合\n // thresh_X が大きいものから処理しているので、gaps は後ろから見ていく\n // (gaps は小さい順にソートされているため)\n // thresh_X が小さくなるにつれて、より多くのギャップがマージ条件を満たす\n // 元のコードは gaps.back().first >= thresh_X だったが、\n // gaps は昇順ソート、queries は thresh_X の降順ソート。\n // よって、thresh_X が小さくなるにつれて、gaps の小さい方から条件を満たすようになる\n // しかし、元のコードは gaps を pop_back しているので、thresh_X が大きいギャップを先に処理する\n // gaps は昇順ソートなので、gaps.back() は最大のギャップ。\n // queries は X が大きい順。\n // X が大きい => 感染しにくい => ギャップが小さくないと繋がらない。\n // このループは、thresh_X が許容する「繋がりやすさ」に基づいて区間グループをマージする。\n // ギャップ <= X という条件なら、gaps の小さい方から見ていく。\n // 元のコードの `thresh <= gaps.back().first` (X_j <= gap_value) は、\n // X_j がこのギャップ値以下であるなら、このギャップでは連結しない、という意味に取れる。\n // しかし、UF.merge は連結させている。\n // おそらく意図は「現在の X で連結できるギャップは全て連結する」\n // X が大きいほど、連結できるギャップは少ない (大きなギャップは連結できない)\n // X が小さいほど、連結できるギャップは多い (小さなギャップは連結できる)\n // queries は X が大きい順。gaps は gap が小さい順。\n // X が大きいクエリでは、uf.merge する回数が少ない。\n // X が小さくなるにつれて、uf.merge が進む。\n // `thresh <= gaps.back().first` は、`X_j` が `gap` 以下の時。\n // X が大きい (例: 100) -> gap (例: 10) -> 100 <= 10 (false)\n // X が小さい (例: 5) -> gap (例: 10) -> 5 <= 10 (true)\n // この条件だと、Xが小さいほどマージが進む。これは意図通り。\n // ただし、gaps.back() を使うので、Xが小さい時に「大きいギャップ」がマージされる。\n // 意図としては、X以上の接続コストを持つギャップは接続できない。\n // よって、Xより「小さい」ギャップを持つものをマージすべき。\n // `gaps.back().first < thresh_X` (現在のXより小さいギャップはマージ)\n // または `gaps.back().first <= thresh_X` (X以下のギャップはマージ)\n\n // 元コードのロジック `thresh <= gaps.back().first` は、\n // `X_j <= gap_value` を意味する。これは「感染しきい値がギャップ以下なら連結」\n // X_j が小さいほど感染しやすい。ギャップが小さいほど連結しやすい。\n // X_j が小さいほど、より多くのギャップが X_j より大きくなり、この条件は満たしにくくなる。\n // これは逆。X_j が「大きい」ほど、より多くの「小さい」ギャップを許容して連結するはず。\n // 正しい条件は `gaps.back().first < X_j` や `gaps.back().first <= X_j` であるべき。\n // ここでは元のコードのロジックを尊重しつつコメント。\n // (ソート順と `back()` の使い方から、`gaps.back().first` は現在処理可能な最大のギャップ)\n // queries が X の降順、gaps が gap の昇順。\n // X が大きいクエリから処理。この時、小さい gap から順にマージしていく。\n // そのためには、gaps のイテレータを保持する必要がある。\n // 以下は元のコードのロジックを再現\n while (!gaps.empty() && thresh_X <= gaps.back().first) { // X が gap以下のとき (Xが小さいほど条件を満たしやすい)\n // しかし、これは「Xが小さいほど大きなギャップをマージする」ことになり、直感と逆。\n // 正しくは「Xが大きいほど、より多くの(より小さい)ギャップをマージできる」\n // または「X以下の(小さい)ギャップだけをマージする」\n // ここでは、X_j 以上のギャップを持つものは連結しない、と解釈し、\n // X_j 未満のギャップを連結していく。\n // X_j の降順でクエリを処理するので、X_j が小さくなるにつれて、\n // それまで連結できなかったギャップが連結できるようになる、ということはない。\n // X_j が小さくなる => 連結の条件が厳しくなる。\n // よって、X_j が大きいときに連結したものは、X_j が小さくても連結したまま。\n // この部分は「X_j より小さいギャップを処理済みとする」オフライン処理と解釈する。\n // 現在の `thresh_X` よりも**小さいか等しい**ギャップを持つものをマージする。\n // `gaps`は昇順ソートされているので、先頭から見ていく。\n // `queries`は`thresh_X`の降順なので、`thresh_X`は小さくなっていく。\n // したがって、`gaps`の処理は一方向に進むポインタで管理できる。\n // --- ここから元のコードのロジックと異なる可能性のある解釈 ---\n // `thresh_X` (現在の感染のしにくさ)\n // `gaps.back().first` (スタックに残っている最大のギャップ)\n // もし `thresh_X <= gaps.back().first` ならば、\n // 感染のしにくさが、この最大のギャップよりも小さいか等しい。\n // これは、このギャップを乗り越えるのが難しい（またはギリギリ）という意味。\n // UFでマージするということは、このギャップを乗り越えて感染が広がることを意味する。\n // この条件は、X が小さい（感染しやすい）ほど、大きなギャップも許容して繋がる、という意味になる。\n // Xの降順ソートと合わせて考えると、Xが大きいときは一部のギャップしかマージされず、\n // Xが小さくなるにつれて、より多くの（より大きい）ギャップもマージされる。\n // これは直感的には正しい。\n // ただし、gapsは昇順ソート。gaps.back()は最大のギャップ。\n // このループはおそらく、現在のthresh_Xで連結「できない」ギャップをpopし、\n // 連結「できる」ギャップだけが残るようにする、という意図かもしれないが、\n // uf.mergeしているので、連結「できる」ものを処理している。\n // `thresh <= gaps.back().first` (X <= gap) -> Xが小さいほど真になりやすい\n // -> Xが小さいほど、大きなgapもマージする\n // これは正しい。\n\n // ここで使うべき `gaps` のイテレータ\n static int gap_ptr = 0; // クエリ間で状態を保持\n if (qID == std::get<2>(queries[0])) gap_ptr = 0; // 最初のクエリでリセット\n\n // X_j 以上のギャップは連結できない。\n // X_j 未満のギャップは連結できる。\n // queries は X_j の降順。gaps は gap_value の昇順。\n // X_j が小さくなるにつれて、連結できるギャナップは減る。\n // これは、X_j が大きいときに連結したものは、小さい X_j でも連結したままというオフライン処理。\n // 正しいループ:\n // while(gap_ptr < gaps.size() && gaps[gap_ptr].first < thresh_X) {\n // uf.merge(gaps[gap_ptr].second, gaps[gap_ptr].second + 1);\n // gap_ptr++;\n // }\n // 元のコードのロジック (thresh <= gaps.back().first) で進める\n while (!gaps.empty() && thresh_X <= gaps.back().first) {\n auto [_, pos] = gaps.back(); // _ はギャップ値 (使わない)\n gaps.pop_back(); //処理したギャップは取り除く\n uf.merge(pos, pos + 1); // 隣接するスタック区間グループを併合\n }\n\n }\n // 初期感染者の属するスタック区間グループの現在の根 (代表元) を求める\n int rootIndex = uf.find(initial_stack_pos);\n // 感染が広がる可能性のある左端 (初期感染者のL_i)\n int queryEffectiveLeft = L[P[qID]];\n // 感染が広がる可能性のある右端 (併合された区間グループ全体の右端)\n // rootIndex は segStack でのインデックス\n int queryEffectiveRight = segStack[rootIndex].first.second;\n\n\n // Fenwick Tree を使って、条件を満たす区間の数を数える\n // 条件: 区間長 >= thresh_X であり、\n // 区間の右端 R_k が [queryEffectiveLeft + thresh_X, queryEffectiveRight] に収まるもの。\n // segLengthRight は区間長が大きい順にソート済み\n // thresh_X はクエリ間で単調非増加 (大きい順に処理)\n // このループもオフライン処理。現在の thresh_X 以上の長さを持つ区間を Fenwick Tree に追加\n static int seg_len_ptr = 0; // クエリ間で状態を保持\n if (qID == std::get<2>(queries[0])) seg_len_ptr = 0; // 最初のクエリでリセット\n\n while(seg_len_ptr < segLengthRight.size() && thresh_X <= segLengthRight[seg_len_ptr].first) {\n auto [len, rightVal] = segLengthRight[seg_len_ptr]; // len は使わない\n // uniqueRight で rightVal の位置 (座標圧縮後のインデックス) を見つける\n // Fenwick Tree は 1-indexed なので +1 することが多いが、\n // lower_bound の結果は既に適切 (0-indexed 配列のインデックス)\n // 元のコードは lower_bound の結果をそのまま使っているので、それに従う。\n // uniqueRight[0] は番兵なので、結果は実質1-indexedのようになる。\n int pos_in_unique_rights = std::lower_bound(uniqueRight.begin(), uniqueRight.end(), rightVal) - uniqueRight.begin();\n fenw.update(pos_in_unique_rights, 1); // その位置に区間が1つ存在することを示す\n seg_len_ptr++;\n }\n\n // Fenwick Tree でクエリ範囲内の区間数を数える\n // queryLeft + thresh は、感染に必要な期間を考慮した実質的な左端\n // R_k >= queryLeft + thresh_X を満たす必要がある\n int fenwick_query_L_idx = std::lower_bound(uniqueRight.begin(), uniqueRight.end(), queryEffectiveLeft + thresh_X) - uniqueRight.begin();\n // R_k <= queryEffectiveRight を満たす必要がある\n int fenwick_query_R_idx = std::upper_bound(uniqueRight.begin(), uniqueRight.end(), queryEffectiveRight) - uniqueRight.begin() -1; // upper_bound は一つ後ろを指すので -1\n\n ans[qID] = fenw.query(fenwick_query_L_idx, fenwick_query_R_idx);\n }\n\n // 答えを出力\n for (int i = 1; i <= Q; ++i) {\n Cout(ans[i]);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 13596,
"score_of_the_acc": -0.0551,
"final_rank": 1
},
{
"submission_id": "aoj_0790_10272746",
"code_snippet": "// AOJ #790 Infection Simulation\n// 2025.3.7\n\n#include <bits/stdc++.h>\nusing namespace std;\nconst int MAX = 100007;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(int n) { // 整数の表示（出力）\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nint L[MAX], R[MAX];\nint P[MAX], X[MAX];\nint par[MAX], seg[MAX];\nint ans[MAX];\n\nstruct UnionFind {\n int parent[MAX];\n UnionFind() {\n iota(parent, parent + MAX, 0);\n }\n int find(int x) {\n if (x == parent[x]) return x;\n return parent[x] = find(parent[x]);\n }\n void merge(int a, int b) {\n a = find(a), b = find(b);\n if (a == b) return;\n parent[a] = b;\n }\n} uf;\n\nstruct FenwickTree {\n int tree[MAX] = {0};\n void update(int i, int v) {\n for (; i < MAX; i += i & -i) tree[i] += v;\n }\n int query(int L, int R) {\n int sum = 0;\n L--;\n for (; R; R -= R & -R) sum += tree[R];\n for (; L; L -= L & -L) sum -= tree[L];\n return sum;\n }\n} fenw;\n\nint main() {\n int N = Cin();\n for (int i = 1; i <= N; ++i) L[i] = Cin(), R[i] = Cin();\n int Q = Cin();\n for (int i = 1; i <= Q; ++i) P[i] = Cin(), X[i] = Cin();\n\n vector<pair<pair<int, int>, int>> ord;\n for (int i = 1; i <= N; ++i) ord.emplace_back(make_pair(L[i], R[i]), i);\n sort(ord.begin(), ord.end(), [&](auto a, auto b) {\n auto [leftA, rightA] = a.first;\n auto [leftB, rightB] = b.first;\n if (leftA != leftB) return leftA < leftB;\n if (rightA != rightB) return rightA > rightB;\n return a.second < b.second;\n });\n\n vector<pair<pair<int, int>, int>> segStack;\n vector<pair<int, int>> nestedSegments;\n for (int i = 0; i < N; ++i) {\n auto [currentLeftRight, segID] = ord[i];\n auto [curLeft, curRight] = currentLeftRight;\n if (!segStack.empty() && curRight <= segStack.back().first.second) {\n par[segID] = segStack.back().second;\n nestedSegments.push_back(currentLeftRight);\n }\n else {\n seg[segID] = segStack.size();\n par[segID] = segID;\n segStack.push_back({currentLeftRight, segID});\n }\n }\n\n vector<pair<int, int>> gaps;\n int stackSize = segStack.size();\n for (int i = 0; i + 1 < stackSize; ++i) {\n int gap = segStack[i].first.second - segStack[i + 1].first.first;\n gaps.emplace_back(gap, i);\n }\n sort(gaps.begin(), gaps.end());\n\n vector<tuple<int, int, int>> queries;\n for (int i = 1; i <= Q; ++i) {\n if (R[P[i]] - L[P[i]] < X[i]) {\n ans[i] = 1;\n continue;\n }\n queries.emplace_back(X[i], seg[par[P[i]]], i);\n }\n sort(queries.begin(), queries.end(), greater<tuple<int, int, int>>());\n\n vector<pair<int, int>> segLengthRight;\n vector<int> uniqueRight;\n uniqueRight.push_back(-1000000000);\n for (int i = 1; i <= N; ++i) {\n uniqueRight.push_back(R[i]);\n segLengthRight.emplace_back(R[i] - L[i], R[i]);\n }\n sort(uniqueRight.begin(), uniqueRight.end());\n uniqueRight.erase(unique(uniqueRight.begin(), uniqueRight.end()), uniqueRight.end());\n sort(segLengthRight.begin(), segLengthRight.end());\n\n for (auto [thresh, stackPos, qID] : queries) {\n while (!gaps.empty() && thresh <= gaps.back().first) {\n auto [_, pos] = gaps.back();\n gaps.pop_back();\n uf.merge(pos, pos + 1);\n }\n int rootIndex = uf.find(stackPos);\n int queryLeft = L[P[qID]];\n int queryRight = segStack[rootIndex].first.second;\n\n while (!segLengthRight.empty() && thresh <= segLengthRight.back().first) {\n auto [_, rightVal] = segLengthRight.back();\n segLengthRight.pop_back();\n int pos = lower_bound(uniqueRight.begin(), uniqueRight.end(), rightVal) - uniqueRight.begin();\n fenw.update(pos, 1);\n }\n int leftIndex = lower_bound(uniqueRight.begin(), uniqueRight.end(), queryLeft + thresh) - uniqueRight.begin();\n int rightIndex = upper_bound(uniqueRight.begin(), uniqueRight.end(), queryRight) - uniqueRight.begin();\n ans[qID] = fenw.query(leftIndex, rightIndex - 1);\n }\n for (int i = 1; i <= Q; ++i) Cout(ans[i]);\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 14416,
"score_of_the_acc": -0.0677,
"final_rank": 3
},
{
"submission_id": "aoj_0790_10206636",
"code_snippet": "// AOJ #790\n// Infection Simulation 2025.2.9\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(ll n) {\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nstruct Interval { ll L, R; ll diff; };\n \nint N;\nvector<Interval> intervals;\nvector<Interval> sortedByL;\nvector<ll> sortedL;\nvector<ll> prefixMaxR;\n \nvoid buildSortedByL(){\n sortedByL = intervals;\n sort(sortedByL.begin(), sortedByL.end(), [](const Interval &a, const Interval &b){\n return a.L < b.L;\n });\n int n = sortedByL.size();\n sortedL.resize(n);\n prefixMaxR.resize(n);\n for (int i = 0; i < n; i++){\n sortedL[i] = sortedByL[i].L;\n if(i==0) prefixMaxR[i] = sortedByL[i].R;\n else prefixMaxR[i] = max(prefixMaxR[i-1], sortedByL[i].R);\n }\n}\n \nll F_func(ll t){\n int pos = upper_bound(sortedL.begin(), sortedL.end(), t) - sortedL.begin() - 1;\n if(pos < 0) return t;\n return prefixMaxR[pos];\n}\n \nstruct SegTree {\n int n;\n vector<vector<ll>> treeR;\n SegTree(int n) : n(n) {\n treeR.resize(4*n);\n }\n void build(int idx, int l, int r) {\n if(l==r)\n treeR[idx].push_back(sortedByL[l].R);\n else {\n int mid = (l+r)/2;\n build(idx*2, l, mid);\n build(idx*2+1, mid+1, r);\n treeR[idx].resize(treeR[idx*2].size() + treeR[idx*2+1].size());\n merge(treeR[idx*2].begin(), treeR[idx*2].end(),\n treeR[idx*2+1].begin(), treeR[idx*2+1].end(),\n treeR[idx].begin());\n }\n }\n void init() { build(1, 0, n-1); }\n int queryR_ge(int idx, int l, int r, int ql, int qr, ll X) {\n if(ql > r || qr < l) return 0;\n if(ql<=l && r<=qr){\n auto &vec = treeR[idx];\n int pos = lower_bound(vec.begin(), vec.end(), X) - vec.begin();\n return vec.size() - pos;\n }\n int mid = (l+r)/2;\n return queryR_ge(idx*2, l, mid, ql, qr, X) + queryR_ge(idx*2+1, mid+1, r, ql, qr, X);\n }\n};\n \nSegTree* segTreePtr = nullptr;\n \nstruct MergeTree {\n int n;\n vector<vector<pair<ll,ll>>> tree;\n MergeTree(int n): n(n) { tree.resize(4*n); }\n void build(int idx, int l, int r) {\n if(l == r)\n tree[idx].push_back({ sortedByL[l].R, sortedByL[l].R - sortedByL[l].L });\n else {\n int mid = (l+r)/2;\n build(idx*2, l, mid);\n build(idx*2+1, mid+1, r);\n int sz1 = tree[idx*2].size(), sz2 = tree[idx*2+1].size();\n tree[idx].resize(sz1+sz2);\n merge(tree[idx*2].begin(), tree[idx*2].end(),\n tree[idx*2+1].begin(), tree[idx*2+1].end(),\n tree[idx].begin(), [](auto &a, auto &b){\n return a.second < b.second;\n });\n }\n }\n int query(int idx, int l, int r, int ql, int qr, ll A, ll x) {\n if(ql > r || qr < l) return 0;\n if(ql<=l && r<=qr){\n auto &vec = tree[idx];\n int pos = lower_bound(vec.begin(), vec.end(), make_pair(-LLONG_MAX, x),\n [](const pair<ll,ll>& a, const pair<ll,ll>& b){\n return a.second < b.second;\n }) - vec.begin();\n int cnt = 0;\n for(int i = pos; i < vec.size(); i++){\n if(vec[i].first <= A) cnt++;\n }\n return cnt;\n }\n int mid = (l+r)/2;\n return query(idx*2, l, mid, ql, qr, A, x) + query(idx*2+1, mid+1, r, ql, qr, A, x);\n }\n};\n \nMergeTree* mergeTreePtr = nullptr;\n \nint main() {\n N = Cin();\n intervals.resize(N);\n for (int i = 0; i < N; i++){\n ll L = Cin(), R = Cin(); \n intervals[i].L = L; \n intervals[i].R = R;\n intervals[i].diff = R - L;\n }\n buildSortedByL();\n int nSorted = sortedByL.size();\n \n segTreePtr = new SegTree(nSorted);\n segTreePtr->init();\n \n mergeTreePtr = new MergeTree(nSorted);\n mergeTreePtr->build(1, 0, nSorted-1);\n \n int Q = Cin();\n for (int qi = 0; qi < Q; qi++){\n int p = Cin()-1; ll x = Cin();\n \n ll L0 = intervals[p].L;\n ll A = intervals[p].R;\n \n int iterCount = 0;\n while (A - L0 >= x) {\n ll arg = A - x;\n if(arg < L0) arg = L0;\n ll cand = F_func(arg);\n if(cand > A) { A = cand; }\n else break;\n iterCount++;\n if(iterCount > 1000000) break;\n }\n ll finalA = A;\n int infectedCount = 0;\n \n int posGroup1 = lower_bound(sortedL.begin(), sortedL.end(), L0) - sortedL.begin();\n int group1Count = 0;\n if(posGroup1 > 0)\n group1Count = segTreePtr->queryR_ge(1, 0, nSorted-1, 0, posGroup1-1, L0 + x);\n \n int posL = lower_bound(sortedL.begin(), sortedL.end(), L0) - sortedL.begin();\n int posR = upper_bound(sortedL.begin(), sortedL.end(), finalA - x) - sortedL.begin();\n \n int group2Count = 0;\n if(posL < posR){\n int countB = segTreePtr->queryR_ge(1, 0, nSorted-1, posL, posR-1, finalA+1);\n int countA = mergeTreePtr->query(1, 0, nSorted-1, posL, posR-1, finalA, x);\n group2Count = countA + countB;\n }\n \n infectedCount = group1Count + group2Count;\n ll expP = min(intervals[p].R, finalA) - L0;\n bool countedP = (expP >= x);\n if(!countedP) infectedCount++;\n Cout(infectedCount);\n }\n return 0;\n}",
"accuracy": 0.13793103448275862,
"time_ms": 1940,
"memory_kb": 76208,
"score_of_the_acc": -2,
"final_rank": 5
},
{
"submission_id": "aoj_0790_10206542",
"code_snippet": "// AOJ #790\n// Infection Simulation 2025.2.9\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(ll n) { // 整数の表示（出力）\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nstruct Interval { ll L, R; ll diff; };\n \nint N;\nvector<Interval> intervals;\nvector<Interval> sortedByL;\nvector<ll> sortedL;\nvector<ll> prefixMaxR;\n \nvoid buildSortedByL(){\n sortedByL = intervals;\n sort(sortedByL.begin(), sortedByL.end(), [](const Interval &a, const Interval &b){\n return a.L < b.L;\n });\n int sz = sortedByL.size();\n sortedL.resize(sz);\n prefixMaxR.resize(sz);\n for (int i = 0; i < sz; i++){\n sortedL[i] = sortedByL[i].L;\n if(i == 0) prefixMaxR[i] = sortedByL[i].R;\n else prefixMaxR[i] = max(prefixMaxR[i-1], sortedByL[i].R);\n }\n}\n \nll F_func(ll t) {\n int pos = upper_bound(sortedL.begin(), sortedL.end(), t) - sortedL.begin() - 1;\n if (pos < 0) return t;\n return prefixMaxR[pos];\n}\n \nstruct SegTree {\n int n;\n vector<vector<ll>> segR;\n vector<vector<ll>> segDiff;\n SegTree(int n) : n(n) {\n segR.resize(4*n);\n segDiff.resize(4*n);\n }\n void build(vector<Interval>& arr, int idx, int l, int r) {\n if(l == r) {\n segR[idx].push_back(arr[l].R);\n segDiff[idx].push_back(arr[l].diff);\n } else {\n int mid = (l+r)/2;\n build(arr, idx*2, l, mid);\n build(arr, idx*2+1, mid+1, r);\n segR[idx].resize(segR[idx*2].size() + segR[idx*2+1].size());\n merge(segR[idx*2].begin(), segR[idx*2].end(),\n segR[idx*2+1].begin(), segR[idx*2+1].end(),\n segR[idx].begin());\n \n segDiff[idx].resize(segDiff[idx*2].size() + segDiff[idx*2+1].size());\n merge(segDiff[idx*2].begin(), segDiff[idx*2].end(),\n segDiff[idx*2+1].begin(), segDiff[idx*2+1].end(),\n segDiff[idx].begin());\n }\n }\n void init(vector<Interval>& arr) {\n build(arr, 1, 0, n-1);\n }\n int queryR_ge(int idx, int l, int r, int ql, int qr, ll X) {\n if(ql > r || qr < l) return 0;\n if(ql<=l && r<=qr) {\n return segR[idx].size() - (lower_bound(segR[idx].begin(), segR[idx].end(), X) - segR[idx].begin());\n }\n int mid = (l+r)/2;\n return queryR_ge(idx*2, l, mid, ql, qr, X) + queryR_ge(idx*2+1, mid+1, r, ql, qr, X);\n }\n int queryR_le(int idx, int l, int r, int ql, int qr, ll X) {\n if(ql > r || qr < l) return 0;\n if(ql<=l && r<=qr) {\n return upper_bound(segR[idx].begin(), segR[idx].end(), X) - segR[idx].begin();\n }\n int mid = (l+r)/2;\n return queryR_le(idx*2, l, mid, ql, qr, X) + queryR_le(idx*2+1, mid+1, r, ql, qr, X);\n }\n};\n \nSegTree* segTreePtr = nullptr;\n \nint main(){\n N = Cin();\n intervals.resize(N);\n for (int i = 0; i < N; i++){\n ll L = Cin(), R = Cin();\n intervals[i].L = L;\n intervals[i].R = R;\n intervals[i].diff = R - L;\n }\n buildSortedByL();\n int nSorted = sortedByL.size();\n segTreePtr = new SegTree(nSorted);\n segTreePtr->init(sortedByL);\n \n int Q = Cin();\n for (int qi = 0; qi < Q; qi++){\n int p = Cin()-1; ll x = Cin();\n \n ll L0 = intervals[p].L;\n ll A = intervals[p].R;\n \n int iterCount = 0;\n while (A - L0 >= x) {\n ll arg = A - x;\n if(arg < L0) arg = L0;\n ll cand = F_func(arg);\n if(cand > A) {\n A = cand;\n } else break;\n iterCount++;\n if(iterCount > 200000) break;\n }\n ll finalA = A;\n \n \n int infectedCount = 0;\n int idx = lower_bound(sortedL.begin(), sortedL.end(), L0) - sortedL.begin();\n int group1Count = 0;\n if(idx > 0)\n group1Count = segTreePtr->queryR_ge(1, 0, nSorted-1, 0, idx-1, L0 + x);\n \n int group2Count = 0;\n for (int i = idx; i < nSorted; i++){\n if(sortedByL[i].R <= finalA)\n if(sortedByL[i].R - sortedByL[i].L >= x) group2Count++;\n else {\n if(sortedByL[i].L <= finalA - x) group2Count++;\n }\n }\n \n infectedCount = group1Count + group2Count;\n \n ll expP = min(intervals[p].R, finalA) - L0;\n bool countedP = (expP >= x);\n if(!countedP) infectedCount++;\n Cout(infectedCount);\n }\n return 0;\n}",
"accuracy": 0.034482758620689655,
"time_ms": 20,
"memory_kb": 62840,
"score_of_the_acc": -0.7949,
"final_rank": 7
}
] |
aoj_0788_cpp
|
たくさんの数字 (Many Digits)
問題文
JOI 高校の葵さんは，
N
行
N
列のマス目の各マスに整数を十進数表記で書くことにした．具体的には上から
i
行目 (
1 ≦ i ≦ N
)，左から
j
列目 (
1 ≦ j ≦ N
) のマスには
A
i
+ B
j
を十進数表記で書く．
葵さんは数字を何文字書くことになるかを知りたい．つまり，葵さんが書く
N
2
個の整数の桁数の合計を求めたい．
A
i
(
1 ≦ i ≦ N
) と
B
j
(
1 ≦ j ≦ N
) が与えられたとき，葵さんが書く
N
2
個の整数の桁数の合計を求めるプログラムを作成せよ．
制約
1 ≦ N ≦ 150 000
．
1 ≦ A
i
≦ 999 999 999
(
1 ≦ i ≦ N
)．
1 ≦ B
j
≦ 999 999 999
(
1 ≦ j ≦ N
)．
入力される値はすべて整数である．
入力
入力は以下の形式で与えられる．
N
A
1
A
2
…
A
N
B
1
B
2
…
B
N
出力
葵さんが書く
N
2
個の整数の桁数の合計を
1
行で出力せよ．
入出力例
入力例 1
3
97 79 7
20 2 21
出力例 1
20
葵さんが各マスに書く整数は以下の図のようになる．
例えば，葵さんは上から
1
行目，左から
1
列目のマスには
A
1
+ B
1
= 97 + 20 = 117
を書く．また，上から
3
行目，左から
2
列目のマスには
A
3
+ B
2
= 7 + 2 = 9
を書く．
葵さんが書く
9
個の整数は
117, 99, 118, 99, 81, 100, 27, 9, 28
であり，それぞれの桁数は
3, 2, 3, 2, 2, 3, 2, 1, 2
である．
よって，葵さんが書く
9
個の整数の桁数の合計は
3 + 2 + 3 + 2 + 2 + 3 + 2 + 1 + 2 = 20
となるため，
20
を出力する．
入力例 2
4
8 97 996 9995
1 2 3 4
出力例 2
46
葵さんが各マスに書く数字は以下の図のようになる．
例えば，葵さんは上から
2
行目，左から
3
列目のマスには
A
2
+ B
3
= 97 + 3 = 100
を書く．この整数の桁数は
3
である．また，上から
4
行目，左から
2
列目のマスには
A
4
+ B
2
= 9 995 + 2 = 9 997
を書く．この整数の桁数は
4
である．
葵さんが書く
16
個の整数の桁数の合計は
46
となるため，
46
を出力する．
入力例 3
1
500000000
500000000
出力例 3
10
葵さんが書く整数は
1
個で，その値は
500 000 000 + 500 000 000 = 1 000 000 000
である．この整数の桁数は
10
である．
よって，葵さんが書く
1
個の整数の桁数の合計は
10
となるため，
10
を出力する．
入力例 4
7
436981378 523812834 456708479 413571178 506402783 598271009 523936624
401203104 501634329 506090236 527167431 485527116 439442403 568364549
出力例 4
463
情報オリンピック日本委員会
作『日本情報オリンピック第4回女性部門 本選 競技課題』
|
[
{
"submission_id": "aoj_0788_10827803",
"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(nullptr);\n\n int N;\n cin >> N;\n vector<ll> A(N), B(N);\n for (int i = 0; i < N; i++) cin >> A[i];\n for (int i = 0; i < N; i++) cin >> B[i];\n\n sort(B.begin(), B.end());\n\n // 桁数境界\n vector<ll> L, R;\n for (ll p = 1; p <= (ll)1e18; p *= 10) {\n L.push_back(p);\n R.push_back(p * 10 - 1);\n }\n\n ll ans = 0;\n for (int i = 0; i < N; i++) {\n for (int d = 1; d <= 18; d++) {\n ll low = L[d - 1] - A[i];\n ll high = R[d - 1] - A[i];\n auto it1 = lower_bound(B.begin(), B.end(), low);\n auto it2 = upper_bound(B.begin(), B.end(), high);\n ans += (it2 - it1) * 1LL * d;\n }\n }\n\n cout << ans << \"\\n\";\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 5760,
"score_of_the_acc": -1.0522,
"final_rank": 6
},
{
"submission_id": "aoj_0788_10425361",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n//#define MOD 998244353\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 150005\n\nint N;\nll A[SIZE],B[SIZE],POW[12];\n\nint calc(ll num){\n\n\tint ret = 0;\n\tdo{\n\t\tret++;\n\t\tnum /= 10;\n\n\t}while(num > 0);\n\treturn ret;\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]*10;\n\t}\n\n\tscanf(\"%d\",&N);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lld\",&A[i]);\n\t}\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%lld\",&B[i]);\n\t}\n\tsort(B,B+N);\n\n\tll ans = 0;\n\tfor(int i = 0; i < N; i++){\n\t\tint base_d = calc(A[i]);\n\n\t\tfor(ll d = base_d; d <= 11; d++){\n\t\t\tll mini = POW[d-1]-A[i];\n\t\t\tll maxi = (POW[d]-1)-A[i];\n\n\t\t\tint left = 0,right = N-1,mid = (left+right)/2;\n\t\t\tll L = N;\n\n\t\t\t//mini以上となる最も左のインデックス\n\t\t\twhile(left <= right){\n\t\t\t\tif(B[mid] >= mini){\n\n\t\t\t\t\tL = mid;\n\t\t\t\t\tright = mid-1;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tleft = mid+1;\n\t\t\t\t}\n\t\t\t\tmid = (left+right)/2;\n\t\t\t}\n\n\t\t\t//maxi以下となる最も右にのインデックス\n\t\t\tleft = 0,right = N-1,mid = (left+right)/2;\n\t\t\tll R = -1;\n\n\t\t\twhile(left <= right){\n\t\t\t\tif(B[mid] <= maxi){\n\n\t\t\t\t\tR = mid;\n\t\t\t\t\tleft = mid+1;\n\t\t\t\t}else{\n\n\t\t\t\t\tright = mid-1;\n\t\t\t\t}\n\t\t\t\tmid = (left+right)/2;\n\t\t\t}\n\n\t\t\tans += d*max(0LL,R-L+1);\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 5916,
"score_of_the_acc": -0.9881,
"final_rank": 4
},
{
"submission_id": "aoj_0788_10425360",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n//#define MOD 998244353\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 150005\n\nint N;\nll A[SIZE],B[SIZE],POW[12];\n\nint calc(ll num){\n\n\tint ret = 0;\n\tdo{\n\t\tret++;\n\t\tnum /= 10;\n\n\t}while(num > 0);\n\treturn ret;\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]*10;\n\t}\n\n\tscanf(\"%d\",&N);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lld\",&A[i]);\n\t}\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%lld\",&B[i]);\n\t}\n\tsort(B,B+N);\n\n\tll ans = 0;\n\tfor(int i = 0; i < N; i++){\n\t\tint base_d = calc(A[i]);\n\t\t//printf(\"\\nA[%d]:%lld base_d:%d\\n\",i,A[i],base_d);\n\n\t\tfor(ll d = base_d; d <= 11; d++){\n\t\t\tll mini = POW[d-1]-A[i];\n\t\t\tll maxi = (POW[d]-1)-A[i];\n\n\t\t\t//printf(\"mini:%lld maxi:%lld\\n\",mini,maxi);\n\n\t\t\tint left = 0,right = N-1,mid = (left+right)/2;\n\t\t\tll L = N;\n\n\t\t\t//mini以上となる最も左のインデックス\n\t\t\twhile(left <= right){\n\t\t\t\tif(B[mid] >= mini){\n\n\t\t\t\t\tL = mid;\n\t\t\t\t\tright = mid-1;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tleft = mid+1;\n\t\t\t\t}\n\t\t\t\tmid = (left+right)/2;\n\t\t\t}\n\n\t\t\t//maxi以下となる最も右にのインデックス\n\t\t\tleft = 0,right = N-1,mid = (left+right)/2;\n\t\t\tll R = -1;\n\n\t\t\twhile(left <= right){\n\t\t\t\tif(B[mid] <= maxi){\n\n\t\t\t\t\tR = mid;\n\t\t\t\t\tleft = mid+1;\n\t\t\t\t}else{\n\n\t\t\t\t\tright = mid-1;\n\t\t\t\t}\n\t\t\t\tmid = (left+right)/2;\n\t\t\t}\n\t\t\t//printf(\"R:%d L:%d\\n\",R,L);\n\t\t\tans += d*max(0LL,R-L+1);\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 5956,
"score_of_the_acc": -1.0001,
"final_rank": 5
},
{
"submission_id": "aoj_0788_10425356",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n//#define MOD 998244353\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 150005\n\nint N;\nll A[SIZE],B[SIZE],POW[12];\n\nint calc(ll num){\n\n\tint ret = 0;\n\tdo{\n\t\tret++;\n\t\tnum /= 10;\n\n\t}while(num > 0);\n\treturn ret;\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]*10;\n\t}\n\n\tscanf(\"%d\",&N);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lld\",&A[i]);\n\t}\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%lld\",&B[i]);\n\t}\n\tsort(B,B+N);\n\n\tll ans = 0;\n\tfor(int i = 0; i < N; i++){\n\t\tint base_d = calc(A[i]);\n\t\t//printf(\"\\nA[%d]:%lld base_d:%d\\n\",i,A[i],base_d);\n\n\t\tfor(ll d = base_d; d <= 11; d++){\n\t\t\tll mini = POW[d-1]-A[i];\n\t\t\tll maxi = (POW[d]-1)-A[i];\n\n\t\t\t//printf(\"mini:%lld maxi:%lld\\n\",mini,maxi);\n\n\t\t\tint left = 0,right = N-1,mid = (left+right)/2;\n\t\t\tll L = N;\n\n\t\t\t//mini以上となる最も左のインデックス\n\t\t\twhile(left <= right){\n\t\t\t\tif(B[mid] >= mini){\n\n\t\t\t\t\tL = mid;\n\t\t\t\t\tright = mid-1;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tleft = mid+1;\n\t\t\t\t}\n\t\t\t\tmid = (left+right)/2;\n\t\t\t}\n\n\t\t\t//maxi以下となる最も右にのインデックス\n\t\t\tleft = 0,right = N-1,mid = (left+right)/2;\n\t\t\tll R = -1;\n\n\t\t\twhile(left <= right){\n\t\t\t\tif(B[mid] <= maxi){\n\n\t\t\t\t\tR = mid;\n\t\t\t\t\tleft = mid+1;\n\t\t\t\t}else{\n\n\t\t\t\t\tright = mid-1;\n\t\t\t\t}\n\t\t\t\tmid = (left+right)/2;\n\t\t\t}\n\t\t\t//printf(\"R:%d L:%d\\n\",R,L);\n\t\t\tans += d*max(0LL,R-L+1);\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}",
"accuracy": 0.3821138211382114,
"time_ms": 60,
"memory_kb": 5888,
"score_of_the_acc": -0.7574,
"final_rank": 12
},
{
"submission_id": "aoj_0788_10425352",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n//#define MOD 998244353\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 150005\n\nint N;\nll A[SIZE],B[SIZE],POW[12];\n\nint calc(ll num){\n\n\tint ret = 0;\n\tdo{\n\t\tret++;\n\t\tnum /= 10;\n\n\t}while(num > 0);\n\treturn ret;\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]*10;\n\t}\n\n\tscanf(\"%d\",&N);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lld\",&A[i]);\n\t}\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%lld\",&B[i]);\n\t}\n\tsort(B,B+N);\n\n\tll ans = 0;\n\tfor(int i = 0; i < N; i++){\n\t\tint base_d = calc(A[i]);\n\t\t//printf(\"\\nA[%d]:%lld base_d:%d\\n\",i,A[i],base_d);\n\n\t\tfor(int d = base_d; d <= 10; d++){\n\t\t\tll mini = POW[d-1]-A[i];\n\t\t\tll maxi = (POW[d]-1)-A[i];\n\n\t\t\t//printf(\"mini:%lld maxi:%lld\\n\",mini,maxi);\n\n\t\t\tint left = 0,right = N-1,mid = (left+right)/2;\n\t\t\tint L = N;\n\n\t\t\t//mini以上となる最も左のインデックス\n\t\t\twhile(left <= right){\n\t\t\t\tif(B[mid] >= mini){\n\n\t\t\t\t\tL = mid;\n\t\t\t\t\tright = mid-1;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tleft = mid+1;\n\t\t\t\t}\n\t\t\t\tmid = (left+right)/2;\n\t\t\t}\n\n\t\t\t//maxi以下となる最も右にのインデックス\n\t\t\tleft = 0,right = N-1,mid = (left+right)/2;\n\t\t\tint R = -1;\n\n\t\t\twhile(left <= right){\n\t\t\t\tif(B[mid] <= maxi){\n\n\t\t\t\t\tR = mid;\n\t\t\t\t\tleft = mid+1;\n\t\t\t\t}else{\n\n\t\t\t\t\tright = mid-1;\n\t\t\t\t}\n\t\t\t\tmid = (left+right)/2;\n\t\t\t}\n\t\t\t//printf(\"R:%d L:%d\\n\",R,L);\n\t\t\tans += d*max(0,R-L+1);\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}",
"accuracy": 0.3821138211382114,
"time_ms": 50,
"memory_kb": 5796,
"score_of_the_acc": -0.6186,
"final_rank": 11
},
{
"submission_id": "aoj_0788_10425351",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n//#define MOD 998244353\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 150005\n\nint N;\nll A[SIZE],B[SIZE],POW[12];\n\nint calc(ll num){\n\n\tint ret = 0;\n\tdo{\n\t\tret++;\n\t\tnum /= 10;\n\n\t}while(num > 0);\n\treturn ret;\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]*10;\n\t}\n\n\tscanf(\"%d\",&N);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lld\",&A[i]);\n\t}\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%lld\",&B[i]);\n\t}\n\tsort(B,B+N);\n\n\tint ans = 0;\n\tfor(int i = 0; i < N; i++){\n\t\tint base_d = calc(A[i]);\n\t\t//printf(\"\\nA[%d]:%lld base_d:%d\\n\",i,A[i],base_d);\n\n\t\tfor(int d = base_d; d <= 10; d++){\n\t\t\tll mini = POW[d-1]-A[i];\n\t\t\tll maxi = (POW[d]-1)-A[i];\n\n\t\t\t//printf(\"mini:%lld maxi:%lld\\n\",mini,maxi);\n\n\t\t\tint left = 0,right = N-1,mid = (left+right)/2;\n\t\t\tint L = N;\n\n\t\t\t//mini以上となる最も左のインデックス\n\t\t\twhile(left <= right){\n\t\t\t\tif(B[mid] >= mini){\n\n\t\t\t\t\tL = mid;\n\t\t\t\t\tright = mid-1;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tleft = mid+1;\n\t\t\t\t}\n\t\t\t\tmid = (left+right)/2;\n\t\t\t}\n\n\t\t\t//maxi以下となる最も右にのインデックス\n\t\t\tleft = 0,right = N-1,mid = (left+right)/2;\n\t\t\tint R = -1;\n\n\t\t\twhile(left <= right){\n\t\t\t\tif(B[mid] <= maxi){\n\n\t\t\t\t\tR = mid;\n\t\t\t\t\tleft = mid+1;\n\t\t\t\t}else{\n\n\t\t\t\t\tright = mid-1;\n\t\t\t\t}\n\t\t\t\tmid = (left+right)/2;\n\t\t\t}\n\t\t\t//printf(\"R:%d L:%d\\n\",R,L);\n\t\t\tans += d*max(0,R-L+1);\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}",
"accuracy": 0.3821138211382114,
"time_ms": 50,
"memory_kb": 5672,
"score_of_the_acc": -0.5813,
"final_rank": 10
},
{
"submission_id": "aoj_0788_10341144",
"code_snippet": "#include <bits/stdc++.h>\n#include <iostream>\n#include <vector>\n#include <string>\n#include <stack>\n#include <algorithm>\n#include <iomanip>\n#include <chrono>\n#pragma GCC target (\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#define rep(i,n) for (ll i = 0;i < (ll)(n);i++)\n#define Yes cout << \"Yes\" << \"\\n\"// YESの短縮\n#define No cout << \"No\" << \"\\n\"// NOの短縮\n#define rtr0 return(0)//return(0)の短縮\n#define gyakugen(x) modpow(x,mod - 2,mod);\n#define agyakugen(x) modpow(x,amod - 2,amod);\nusing namespace std;\n//using namespace ranges;\nusing ll = long long;//63bit型整数型\nusing ld = long double;//doubleよりも長い値を保存できるもの\nusing ull = unsigned long long;//符号がない64bit型整数\nll mod = 998244353;\nll amod = 1000000007;\nll MINF = -5000000000000000000;\nll INF = 5000000000000000000;\nll inf = 5000000000;\nll minf = -5000000000;\nll BAD = -1;\nvector<ll>tate = {0,-1,0,1};//グリッド上の全探索時の四方向の上下のチェック\nvector<ll>yoko = {1,0,-1,0};//グリッド上の全探索時の四方向の右左のチェック\nvector<ll>eightx = {0,-1,-1,-1,0,1,1,1};//グリッド上の全探索時の八方向の上下のチェック\nvector<ll>eighty = {1,1,0,-1,-1,-1,0,1};//グリッド上の全探索時の八方向の右左のチェック\nvector<ll>hexsax = {0,1,1,0,-1,-1};\nvector<ll>hexsay = {1,1,0,-1,-1,0};\n//返り値は素数のリスト。\nvector < bool > isprime;\nvector < ll > Era(int n){//書き方 vector<ll>[] = Era(x); とやるとxまでの素数が出てくる。\n\tisprime.resize(n, true);\n\tvector < ll > res;\n\tisprime[0] = false;\n\tisprime[1] = false;\n\tfor(ll i = 2; i < n; ++i) isprime[i] = true;\n\tfor(ll i = 2; i < n; ++i) {\n\t\tif(isprime[i]) {\n\t\t\tres.push_back(i);\n\t\t\tfor(ll j = i * 2; j < n; j += i) isprime[j] = false;\n\t\t}\n\t}\n\treturn res;\n}\n// 素数判定 21~35\n\nlong long modpow(long long a, long long n, long long mod) {\n\tlong long res = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long npow(long long a, long long n){\n long long res = 1;\n while (n > 0) {\n\t\tif (n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n// モッドを使った累乗\n\n\ntemplate<class T>\nstruct dijkstra{\n public:\n\tvector<vector<pair<T,T>>>graph;\n\tvector<T>ans;\n\tpriority_queue<pair<T,T>,vector<pair<T,T>>,greater<pair<T,T>>>pq;\n\tvoid do_dijkstra(T start){//頂点xからダイクストラを行う\n\t\tpq.push({0,start});\n\t\tans[start] = 0;\n\t\twhile(true){\n\t\t\tif(pq.empty())break;\n\t\t\tT cost = pq.top().first;\n\t\t\tT vertex = pq.top().second;\n\t\t\tpq.pop();\n\t\t\tfor(T i = 0;i<graph[vertex].size();i++){\n\t\t\t\tT nextvertex = graph[vertex][i].first;\n\t\t\t\tT nextcost = graph[vertex][i].second + cost;\n\t\t\t\tif(ans[nextvertex] > nextcost){\n\t\t\t\t\tans[nextvertex] = nextcost;\n\t\t\t\t\tpq.push({nextcost,nextvertex});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tvoid make_indirectedgraph(T u,T v,T cost){//無向辺のグラフ作成\n\t\tgraph[u].push_back({v,cost});\n\t\tgraph[v].push_back({u,cost});\n\t}\n\tvoid make_directedgraph(T u,T v,T cost){//有向辺のグラフ作成\n\t\tgraph[u].push_back({v,cost});\n\t}\n\tT output(T end){//答えを出す\n\t\treturn ans[end];\n\t} \n\tvoid reset(T N){//リセット\n\t\tgraph.clear();\n\t\tans.clear();\n\t\tfor(ll i = 0;i<N;i++){\n\t\t\tgraph.push_back({vector<pair<T,T>>(0)});\n\t\t\tans.push_back(INF);\n\t\t}\n\t}\n};\ntemplate<class T>\nstruct unionfind {\npublic:\n vector<T> parent, rank;\n void reset(T N) { // 初期化\n parent.resize(N);\n rank.assign(N, 1); // 各集合のサイズを 1 にする\n for (T i = 0; i < N; i++) parent[i] = i;\n }\n T leader(T x) { // 経路圧縮による親の取得\n if (parent[x] == x) return x;\n return parent[x] = leader(parent[x]); // 経路圧縮\n }\n void marge(T x, T y) { // ランクによるマージ\n T a = leader(x), b = leader(y);\n if(a!=b){\n if (rank[a] < rank[b]) swap(a, b);\n parent[b] = a;\n rank[a] += rank[b]; // サイズを更新 \n }\n }\n bool same(T x, T y) { // 同じ集合か判定\n return leader(x) == leader(y);\n }\n T size(T x) { // 集合のサイズを取得\n return rank[leader(x)];\n }\n void check(T N) { // デバッグ用: 親の確認\n for (T i = 0; i < N; i++) cout << parent[i] << \" \";\n cout << \"\\n\";\n }\n};\n//セグ木\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n segtree(int n) : segtree(std::vector<S>(n, e())) {}\n segtree(const std::vector<S>& v) : _n(int(v.size())){\n log = ceil_pow2(_n);\n size = 1 << log;\n d = std::vector<S>(2 * size, e());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n \n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n \n S get(int p) {\n assert(0 <= p && p < _n);\n return d[p + size];\n }\n \n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n S sml = e(), smr = e();\n l += size;\n r += size;\n \n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n return op(sml, smr);\n }\n \n S all_prod() { return d[1]; }\n \n template <bool (*f)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return f(x); });\n }\n template <class F> int max_right(int l, F f) {\n assert(0 <= l && l <= _n);\n assert(f(e()));\n if (l == _n) return _n;\n l += size;\n S sm = e();\n do{\n while (l % 2 == 0) l >>= 1;\n if (!f(op(sm, d[l]))) {\n while (l < size) {\n l = (2 * l);\n if (f(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n }while ((l & -l) != l);\n return _n;\n }\n \n template <bool (*f)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return f(x); });\n }\n template <class F> int min_left(int r, F f) {\n assert(0 <= r && r <= _n);\n assert(f(e()));\n if (r == 0) return 0;\n r += size;\n S sm = e();\n do{\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!f(op(d[r], sm))) {\n while (r < size) {\n r = (2 * r + 1);\n if (f(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n }while ((r & -r) != r);\n return 0;\n }\n \n private:\n int _n, size, log;\n std::vector<S> d;\n \n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n int ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n }\n};\n\n//遅延セグ木\ntemplate <class S,S (*op)(S, S),S (*e)(),class F,S (*mapping)(F, S),F (*composition)(F, F),F (*id)()>\nstruct lazy_segtree {\n\n public:\n lazy_segtree() : lazy_segtree(0) {}\n lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\n log = ceil_pow2(_n);\n size = 1 << log;\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push(r >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <bool (*g)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\n }\n template <class G> int max_right(int l, G g) {\n assert(0 <= l && l <= _n);\n assert(g(e()));\n if (l == _n) return _n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, d[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n\n template <bool (*g)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\n }\n template <class G> int min_left(int r, G g) {\n assert(0 <= r && r <= _n);\n assert(g(e()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(d[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n private:\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n int ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n }\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n};\n\n//遅延セグ木のベース\nusing lazyS = ll;\nusing lazyF = ll;//型\nlazyS e(){ return 0;}//範囲外などを起こしてしまったときの返り値\nlazyS op(lazyS a, lazyS b){ return a+b; }//操作したいこと\nlazyS mapping(lazyF f, lazyS x){ return x+f; }//下まで伝播させたいこと\nlazyF composition(lazyF f, lazyF g){ return g+f; }//まとめてやった場合おこしたいこと\nlazyF id(){ return 0; }//遅延セグ木のベース\nint main(){\n//B以上は基本詳細を書いておくと便利 A ＝ ooの値とか 見直す時に便利\n// この問題の本質\nll N;\ncin >> N;\nvector<ll>A(N);\nvector<ll>B(N);\nfor(ll i = 0;i<N;i++)cin >> A[i];\nfor(ll i = 0;i<N;i++)cin >> B[i];\nsort(A.begin(),A.end());\nsort(B.begin(),B.end());\nvector<ll>imos(11);\nA.push_back(INF);\nB.push_back(INF);\nfor(ll i = 0;i<N;i++){\n for(ll ii = 0;ii<=10;ii++){\n ll x = npow(10,ii);\n ll a = B[i];\n a = x-a;\n ll k = lower_bound(A.begin(),A.end(),a)-A.begin();\n if(k<N){\n imos[ii]+=(N-k);\n }\n }\n}\nfor(ll i = 1;i<=10;i++){\n imos[i] += imos[i-1];\n}\ncout << imos[10] << \"\\n\";\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 7800,
"score_of_the_acc": -1.7778,
"final_rank": 9
},
{
"submission_id": "aoj_0788_10340932",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\nlong long count(vector<long long >& a,long long b,long long c){\n return lower_bound(a.begin(),a.end(),c)-lower_bound(a.begin(),a.end(),b);\n}\n\nint main(){\n int n;\n cin >> n;\n vector<long long> a(n),b(n);\n rep(i,n){\n cin >> a[i];\n }\n rep(i,n){\n cin >> b[i];\n }\n sort(b.begin(),b.end());\n \n long long res=0;\n rep(i,n){\n long long power10=1;\n rep(j,10){\n res += (j+1)*count(b,power10-a[i],power10*10-a[i]);\n power10*=10;\n }\n }\n cout << res << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 5492,
"score_of_the_acc": -1.3048,
"final_rank": 8
},
{
"submission_id": "aoj_0788_10215937",
"code_snippet": "#include <iostream>\n#include <cstdint>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n{\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\t\n\tuint32_t N, i, j;\n\tcin >> N;\n\tvector<int32_t> A(N), B(N);\n\tfor (i = 0; i != N; ++i) cin >> A[i];\n\tfor (j = 0; j != N; ++j) cin >> B[j];\n\n\tsort(B.begin(), B.end());\n\tuint64_t ans = 0;\n\tint32_t digit;\n\tfor (i = 0; i != N; ++i)\n\t{\n\t\tfor (digit = 1; digit != 1'000'000'000; digit *= 10)\n\t\t\tans += B.end() - lower_bound(B.begin(), B.end(), digit - A[i]);\n\t\tans += B.end() - lower_bound(B.begin(), B.end(), digit - A[i]);\n\t}\n\n\tcout << ans << '\\n';\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 4480,
"score_of_the_acc": -0.1111,
"final_rank": 1
},
{
"submission_id": "aoj_0788_10122693",
"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<ll> a(n), b(n);\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n }\n for (int i = 0; i < n; i++) {\n cin >> b[i];\n }\n sort(a.begin(), a.end());\n sort(b.begin(), b.end());\n ll res = 0;\n ll base = 1;\n for (int _ = 0; _ < 11; _++) {\n int r = n;\n for (int i = 0; i < n; i++) {\n while (r and a[i] + b[r - 1] >= base) {\n r -= 1;\n }\n res += n - r;\n }\n base *= 10;\n }\n cout << res << endl;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 5468,
"score_of_the_acc": -0.2976,
"final_rank": 2
},
{
"submission_id": "aoj_0788_10118924",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nint main(){\n int N;\n cin>>N;\n vector<ll> A(N),B(N);\n for(auto &a:A)cin>>a;\n for(auto &b:B)cin>>b;\n sort(B.begin(),B.end());\n ll an=0;\n for(ll i=1;i<=1e12;i*=10){\n for(auto a:A)an+=B.end()-lower_bound(B.begin(),B.end(),i-a);\n }\n cout<<an<<endl;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 5468,
"score_of_the_acc": -1.0754,
"final_rank": 7
},
{
"submission_id": "aoj_0788_10092415",
"code_snippet": "// AOJ #788\n// Many Digits 2025.1.11\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n// A, B はそれぞれ昇順ソート済みとする\n// (A[i] + B[j]) <= X となる (i, j) の個数を二ポインタで数える\nlong long count_pairs_leq_X(const vector<long long> &A,\n const vector<long long> &B,\n long long X) {\n long long count = 0;\n int N = (int)A.size();\n int j = N - 1;\n for (int i = 0; i < N; i++) {\n while (j >= 0 && A[i] + B[j] > X) {\n j--;\n }\n // j が -1 のときは加算される個数 0\n count += (j + 1);\n }\n return count;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n int N;\n cin >> N;\n\n vector<long long> A(N), B(N);\n for(int i=0; i<N; i++){\n cin >> A[i];\n }\n for(int j=0; j<N; j++){\n cin >> B[j];\n }\n\n // ソート\n sort(A.begin(), A.end());\n sort(B.begin(), B.end());\n\n // 桁数が変わる境界をまとめる\n // 先頭に 0 を入れ、最後を 1,999,999,998 とする\n // (1 <= A_i, B_j <= 999999999 なので和は最大でも 1999999998)\n vector<long long> D = {\n 0LL, // <=0 の個数 (常に 0 になる)\n 9LL,\n 99LL,\n 999LL,\n 9999LL,\n 99999LL,\n 999999LL,\n 9999999LL,\n 99999999LL,\n 999999999LL,\n 1999999998LL // 最大想定和\n };\n\n // F[i] = f(D[i]) = #( (i,j) | A_i + B_j <= D[i] )\n // 境界ごとに二ポインタで数えて格納\n vector<long long> F(D.size());\n for(int i=0; i<(int)D.size(); i++){\n F[i] = count_pairs_leq_X(A, B, D[i]);\n }\n\n // 桁数の合計を求める\n // D[i-1]+1 〜 D[i] が桁数 i の範囲\n // → ペア数は F[i] - F[i-1], その桁数は i\n long long ans = 0;\n // i=1(1桁) 〜 10(10桁) まで\n for(int k=1; k<=(int)D.size()-1; k++){\n long long cntRange = F[k] - F[k-1]; // その区間に入るペア数\n long long digit = k; // k桁\n ans += digit * cntRange;\n }\n\n cout << ans << \"\\n\";\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 5468,
"score_of_the_acc": -0.2976,
"final_rank": 2
}
] |
aoj_0775_cpp
|
カードゲーム 2 (Card Game 2)
問題文
ビ太郎は
N
枚のカードを持っており，
i
枚目 (
1 ≦ i ≦ N
) のカードには整数
A
i
が書かれている．
これらの中から次の条件を満たすような
3
枚のカードを選びたい．
条件:
選んだカードに書かれている整数が
3
ずつ離れている．
厳密には，選んだカードに書かれている整数が，ある整数
x
を用いて
x, x+3, x+6
と表せる．
例えば，ビ太郎が
5
枚のカードを持っており，それぞれに
2, 4, 5, 7, 10
が書かれているとき，
4, 7, 10
が書かれているカードを選ぶと，条件を満たす．
ビ太郎が持っているカードの情報が与えられたとき，条件を満たすように
3
枚のカードを選ぶことができるかどうか判定するプログラムを作成せよ．
制約
3 ≦ N ≦ 200 000
．
1 ≦ A
i
≦ 200 000
(
1 ≦ i ≦ N
)．
入力される値はすべて整数である．
入力
入力は以下の形式で与えられる．
N
A
1
A
2
…
A
N
出力
条件を満たすように
3
枚のカードを選ぶことができる場合
Yes
を，そうでない場合
No
を出力せよ．
入出力例
入力例 1
3
2 5 8
出力例 1
Yes
2, 5, 8
が書かれているカードを選ぶと，条件を満たす．したがって，
Yes
を出力する．
入力例 2
4
1 4 6 4
出力例 2
No
条件を満たすようにカードを選ぶことはできない．したがって，
No
を出力する．
入力例 3
8
9 8 11 1 1 6 10 4
出力例 3
No
条件を満たすようにカードを選ぶことはできない．したがって，
No
を出力する．
入力例 4
20
2 15 4 30 6 8 11 27 14 3 16 26 19 2 23 21 18 13 28 6
出力例 4
Yes
15, 18, 21
が書かれているカードを選ぶと，条件を満たす．したがって，
Yes
を出力する．
情報オリンピック日本委員会
作 『第 23 回日本情報オリンピック (JOI 2023/2024) 二次予選競技課題』
|
[
{
"submission_id": "aoj_0775_11040880",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint n;\n\tbool a[200006] = {\n\t\t0\n\t};\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t int k;\n\t\tcin >> k;\n\t\ta[k] = true;\n\t}\n\tfor (int i = 0; i < 200000; i++) {\n\t\tif (a[i] == true && a[i + 3] == true && a[i + 6] == true) {\n\t\t\tcout << \"Yes\" << endl;\n\t\t\treturn 0;\n\t\t}\n\n\n\t}\n\tcout << \"No\" << endl;\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3628,
"score_of_the_acc": -0.0588,
"final_rank": 1
},
{
"submission_id": "aoj_0775_11035880",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int N;\n cin >> N;\n int A[N];\n for(int i=0; i<N; i++){\n cin >> A[i];\n }\n\n bool C[200009];\n for(int i=0; i<200008; i++){\n C[i] = false;\n }\n for(int i=0; i<N; i++){\n C[A[i]] = true;\n }\n for(int i=0; i<N; i++){\n if(C[A[i]] == true && C[A[i] + 3] == true && C[A[i] + 6] == true){\n cout << \"Yes\" << endl;\n return 0;\n }\n }\n cout << \"No\" << endl;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 4300,
"score_of_the_acc": -0.1984,
"final_rank": 5
},
{
"submission_id": "aoj_0775_11035872",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int N;\n cin >> N;\n int A[N];\n for(int i=0; i<N; i++){\n cin >> A[i];\n }\n\n bool C[200009];\n for(int i=0; i<N; i++){\n C[i] = false;\n }\n for(int i=0; i<N; i++){\n C[A[i]] = true;\n }\n for(int i=0; i<N; i++){\n if(C[A[i]] == true && C[A[i] + 3] == true && C[A[i] + 6] == true){\n cout << \"Yes\" << endl;\n return 0;\n }\n }\n cout << \"No\" << endl;\n}",
"accuracy": 0.5409836065573771,
"time_ms": 10,
"memory_kb": 4096,
"score_of_the_acc": -0.0562,
"final_rank": 20
},
{
"submission_id": "aoj_0775_11035857",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int N;\n cin >> N;\n int A[N];\n for(int i=0; i<N; i++){\n cin >> A[i];\n }\n\n bool C[200009];\n for(int i=0; i<N; i++){\n C[A[i]] = true;\n }\n for(int i=0; i<N; i++){\n if(C[A[i]] == true && C[A[i] + 3] == true && C[A[i] + 6] == true){\n cout << \"Yes\" << endl;\n return 0;\n }\n }\n cout << \"No\" << endl;\n}",
"accuracy": 0.5409836065573771,
"time_ms": 10,
"memory_kb": 3916,
"score_of_the_acc": -0.0346,
"final_rank": 19
},
{
"submission_id": "aoj_0775_11003267",
"code_snippet": "#include<iostream>\nusing namespace std;\nint main(void){\n int n,mx=0;\n cin>>n;\n int a[200000]={0};\n int mod0[200000]={0},mod1[200000]={0},mod2[200000]={0};\n for(int i=0;i<n;i++){\n cin>>a[i];\n mx=max(mx,a[i]);\n if(a[i]%3==1){\n mod1[a[i]]++;\n }\n else if(a[i]%3==2){\n mod2[a[i]]++;\n }\n else{\n mod0[a[i]]++;\n }\n }\n for(int i=0;i<mx-5;i++){\n int k=i;\n if(k%3==0){\n if(mod0[i]>0 and mod0[i+3]>0 and mod0[i+6]>0){\n cout<<\"Yes\"<<endl;\n return 0;\n }\n \n }\n else if(k%3==1){\n if(mod1[i]>0 and mod1[i+3]>0 and mod1[i+6]>0){\n cout<<\"Yes\"<<endl;\n return 0;\n }\n \n }\n else{\n if(mod2[i]>0 and mod2[i+3]>0 and mod2[i+6]>0){\n cout<<\"Yes\"<<endl;\n return 0;\n }\n \n }\n }\n cout<<\"No\"<<endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 6560,
"score_of_the_acc": -0.4111,
"final_rank": 8
},
{
"submission_id": "aoj_0775_10967401",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nvector<bool> cnt(200000, false);\n\nint main(){\n int N;\n cin >> N;\n vector<int> card(N);\n for(auto& i : card){\n cin >> i;\n cnt[i - 1] = true;\n }\n sort(card.begin(), card.end());\n bool flg = false;\n for(int i = 0; i < N - 2; i++){\n if(card[i] <= 199994 && cnt[card[i] + 2] && cnt[card[i] + 5]){\n flg = true;\n break;\n }\n }\n if(flg) cout << \"Yes\\n\";\n else cout << \"No\\n\";\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4096,
"score_of_the_acc": -0.115,
"final_rank": 2
},
{
"submission_id": "aoj_0775_10932796",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define vi vector<ll>\n// vv(n, vector<Type>(m, d));\n#define vvi vector<vector<ll>>\n#define pqmin priority_queue<ll, vector<ll>, greater<ll>>\n#define rep(a, b, c) for (ll a = b; a < c; a++)\n#define repre(a, b, c) for (ll a = b; a != c; a--)\n#define PI 3.14159265359\nint main(){\n ll n;\n cin>>n;\n ll a;\n set<ll>s;\n rep(i,0,n){\n cin>>a;\n s.insert(a);\n }\n rep(i,0,199995){\n if(s.find(i)!=s.end()&&s.find(i+3)!=s.end()&&s.find(i+6)!=s.end()){\n cout<<\"Yes\"<<\"\\n\";\n return 0;\n }\n }\n cout<<\"No\"<<\"\\n\";\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 9960,
"score_of_the_acc": -0.996,
"final_rank": 10
},
{
"submission_id": "aoj_0775_10914548",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <cmath>\n#include <cstdint>\n#include <iomanip>\n#include <bit>\n#include <queue>\n#include <stack>\n#include <random>\n//#include <atcoder/all>\n\nusing namespace std;\n\n//using mint = atcoder::modint998244353 ;\n\nvoid ansYesNo(bool ans, string yes = \"Yes\", string no = \"No\")\n{\n if (ans)\n {\n cout << yes << endl;\n }\n else\n {\n cout << no << endl;\n }\n}\n\nint d[4][2] = {{1,0},{0,1},{-1,0},{0,-1}} ;\n\ntemplate<class T> void outVectorSameLine(vector<T> v){\n for (int i = 0; i < v.size()-1; i++)\n {\n cout << v.at(i) << \" \" ;\n }\n cout << v.at(v.size()-1) << endl ;\n return ;\n}\n\nstruct Pos{\n int x ;\n int y ;\n};\n\nint main(){\n int n ;\n cin >> n ;\n int max = 200000 ;\n vector<int> b(max + 1,0) ;\n for (int i = 0; i < n; i++)\n {\n int a ;\n cin >> a ;\n b.at(a) ++ ;\n }\n \n bool ans = false ;\n for (int i = 0; i <= max-6 ; i++)\n {\n ans = (b.at(i) > 0 && b.at(i+3) > 0 && b.at(i+6) > 0) ;\n if (ans)\n {\n break ;\n }\n \n }\n ansYesNo(ans) ;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4096,
"score_of_the_acc": -0.115,
"final_rank": 2
},
{
"submission_id": "aoj_0775_10869053",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(){\n int N, a, i;\n int A[200001];\n int check = 0, max = 0;\n cin >> N;\n for(i = 0; i <= 200001; i++) A[i] = 0;\n for(i = 0; i < N; i++){\n cin >> a;\n A[a] = 1; \n if(a > max) max = a;\n }\n\n for(i = 1; i <= 200000; i++){\n if(A[i] == 1 and A[i+3] == 1 and A[i+6] == 1){\n check = 1;\n break;\n }\n }\n if(check == 1) cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4204,
"score_of_the_acc": -0.128,
"final_rank": 4
},
{
"submission_id": "aoj_0775_10869048",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(){\n int N, a, i;\n int A[200001];\n int check = 0, max = 0;\n cin >> N;\n for(i = 0; i < N; i++){\n cin >> a;\n A[a] = 1; \n if(a > max) max = a;\n }\n\n for(i = 1; i <= 200000; i++){\n if(A[i] == 1 and A[i+3] == 1 and A[i+6] == 1){\n check = 1;\n break;\n }\n }\n if(check == 1) cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n return 0;\n}",
"accuracy": 0.639344262295082,
"time_ms": 10,
"memory_kb": 4084,
"score_of_the_acc": -0.0548,
"final_rank": 18
},
{
"submission_id": "aoj_0775_10869037",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(){\n int N, a, i;\n int A[200001];\n int check = 0, max = 0;\n cin >> N;\n for(i = 0; i < N; i++){\n cin >> a;\n A[a] = 1; \n if(a > max) max = a;\n }\n\n for(i = 1; i <= max - 6; i++){\n if(A[i] == 1 and A[i+3] == 1 and A[i+6] == 1){\n check = 1;\n break;\n }\n }\n if(check == 1) cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n return 0;\n}",
"accuracy": 0.7540983606557377,
"time_ms": 30,
"memory_kb": 4212,
"score_of_the_acc": -0.1878,
"final_rank": 17
},
{
"submission_id": "aoj_0775_10869035",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(){\n int N, a, i;\n int A[200001];\n int check = 0, max = 0;\n cin >> N;\n for(i = 0; i < N; i++){\n cin >> a;\n A[a] = 1; \n if(a > max) max = a;\n }\n\n for(i = 1; i <= max; i++){\n if(A[i] == 1 and A[i+3] == 1 and A[i+6] == 1){\n check = 1;\n break;\n }\n }\n if(check == 1) cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n return 0;\n}",
"accuracy": 0.7540983606557377,
"time_ms": 30,
"memory_kb": 4196,
"score_of_the_acc": -0.1859,
"final_rank": 16
},
{
"submission_id": "aoj_0775_10864510",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n;cin>>n;\n vector<int> A(n);\n for(auto&& x:A)cin>>x;\n sort(A.begin(),A.end());\n vector<int> B(0);\n for(int i=0;i<n;i++){\n if(i==0)B.push_back(A[0]);\n else if(A[i-1]!=A[i])B.push_back(A[i]);\n }\n for(uint64_t i=0;i<B.size();i++){\n for(uint8_t j=1;j<B.size()&&j<4;j++){\n if(B[i+j]==B[i]+3){\n for(uint8_t k=1;k<B.size()&&k<4;k++){\n if(B[i+j+k]==B[i+j]+3){\n cout<<\"Yes\"<<endl;\n return 0;\n }\n }\n }\n }\n }\n cout<<\"No\"<<endl;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 4516,
"score_of_the_acc": -0.2243,
"final_rank": 7
},
{
"submission_id": "aoj_0775_10864502",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n;cin>>n;\n vector<int> A(n);\n for(auto&& x:A)cin>>x;\n sort(A.begin(),A.end());\n vector<int> B(0);\n for(int i=0;i<n;i++){\n if(i==0)B.push_back(A[0]);\n else if(A[i-1]!=A[i])B.push_back(A[i]);\n }\n for(uint64_t i=0;i<B.size();i++){\n for(uint64_t j=0;j<B.size()||j<3;j++){\n if(B[i+j]==B[i]+3){\n for(uint64_t k=0;k<B.size()||k<3;k++){\n if(B[i+j+k]==B[i+j]+3){\n cout<<\"Yes\"<<endl;\n return 0;\n }\n }\n }\n }\n }\n cout<<\"No\"<<endl;\n}",
"accuracy": 0.8524590163934426,
"time_ms": 180,
"memory_kb": 4684,
"score_of_the_acc": -1.1269,
"final_rank": 15
},
{
"submission_id": "aoj_0775_10832120",
"code_snippet": "#include<bits/stdc++.h>\n#define endl \"\\n\"\n#define ll long long\n#define IMAX INT_MAX\n#define IMIN INT_MIN\n#define LLMAX LLONG_MAX\n#define LLMIN LLONG_MIN\n#define efor(i,n) for(int i=0;(n);i++)\nusing namespace std;\nvoid Yn(bool b, const std::string& yes = \"Yes\", const std::string& no = \"No\") {\n std::cout << (b ? yes : no) << '\\n';\n}\n\nint main () {\n int n;\n cin >> n;\n set <int> A;\n vector <int> a(n);\n for(int i=0;i<n;i++){\n cin >> a[i];\n A.insert(a[i]);\n }\n bool ans=0;\n for(int i=0;i<n;i++){\n if(A.count(a[i]+3)&&A.count(a[i]+6)){\n ans=1;\n break;\n }\n }\n Yn(ans);\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 10116,
"score_of_the_acc": -1.0736,
"final_rank": 12
},
{
"submission_id": "aoj_0775_10832087",
"code_snippet": "#include <bits/stdc++.h>\n#define endl \"\\n\"\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n vector < int > a(n);\n map < int, bool > m;\n\n for ( int i = 0; i < n; i++ ) {\n cin >> a[i];\n m[a[i]] = true;\n }\n\n for ( int i = 0; i < n; i++ ) {\n int x = a[i];\n if ( m[x + 3] && m[x + 6] ) {\n cout << \"Yes\" << endl;\n return 0;\n }\n }\n\n cout << \"No\" << endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 11952,
"score_of_the_acc": -1.3529,
"final_rank": 14
},
{
"submission_id": "aoj_0775_10830200",
"code_snippet": "//AC 25..\n#include <bits/stdc++.h>\n\n#define endl \"\\n\"\n#define sline cout << endl\n#define ll long long\n#define ull unsigned long long\n#define fi int i =\n#define fj int j =\n\nusing namespace std;\n\nvoid yesno ( bool Yn ) {\n if (Yn == true) {\n cout << \"Yes\" << endl;\n }\n else if (Yn == false) {\n cout << \"No\" << endl;\n }\n}\n\nint main() {\n int N;\n cin >> N;\n vector <int> A(N);\n set <int> s;\n for (fi 0; i < N; i++) {\n cin >> A[i];\n s.insert(A[i]);\n }\n\n for (fi 0; i < N; i++) {\n if (s.count(A[i] + 3) && s.count(A[i] + 6)) {\n yesno(true);\n return 0;\n }\n }\n\n yesno(false);\n\nreturn 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 10212,
"score_of_the_acc": -1.0851,
"final_rank": 13
},
{
"submission_id": "aoj_0775_10827786",
"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 N;\n cin >> N;\n vector<int> A(N);\n for (int i = 0; i < N; i++) cin >> A[i];\n\n unordered_set<int> s(A.begin(), A.end());\n\n for (int a : A) {\n if (s.count(a + 3) && s.count(a + 6)) {\n cout << \"Yes\\n\";\n return 0;\n }\n }\n\n cout << \"No\\n\";\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 9656,
"score_of_the_acc": -0.7242,
"final_rank": 9
},
{
"submission_id": "aoj_0775_10767933",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(){\n int a[250000]={0};\n int n;\n cin>>n;\n \n for(int i=0; i<n; i++){\n int A;\n cin>>A;\n a[A]++;\n }\n \n for(int i=1; i<=200000-6; i++){\n if(a[i]!=0 && a[i+3]!=0 && a[i+6]!=0){\n cout<<\"Yes\"<<endl;\n return 0;\n }\n }\n cout<<\"No\"<<endl;\n return 0;\n \n\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 4416,
"score_of_the_acc": -0.2123,
"final_rank": 6
},
{
"submission_id": "aoj_0775_10753693",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include<string>\n#include<stack>\n#include<set>\nusing namespace std;\n\nint main() {\n int N;\n string a = \"No\";\n string d = \"D\";\n cin >> N;\n vector<int>A(N);\n for (int i = 0; i < N; i++) { cin >> A[i]; }\n set<int> S(A.begin(), A.end());\n vector<int>B(S.begin(), S.end());\n for (int i = 0; i < S.size()-1; i++) {\n string d = \"D\";\n string p = \"D\";\n int J = 0;\n int it = B[i];\n for (int j = i + 1; j < i + 4; j++) {\n if (j == S.size()) {\n break;\n }\n if (it + 3 == B[j]) {\n d = \"Z\";\n J = j;\n break;\n }\n \n } \n \n it = B[J];\n for (int j = J + 1; j < J + 4; j++) {\n if (j >= S.size()) {\n break;\n }\n if (it + 3 == B[j]) {\n p = \"Z\";\n break;\n }\n }\n if (d == \"Z\" and p == \"Z\") {\n a = \"Yes\";\n break;\n }\n }\n cout << a << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 10588,
"score_of_the_acc": -1.0714,
"final_rank": 11
}
] |
aoj_0789_cpp
|
名前 (Name)
問題文
JOI 君と IOI 君は犬を飼うことにした．最初にすべきことは，犬の名前を決めることである．二人で話し合った結果，犬の名前を以下の
4
つの条件を満たすものにすることにした．
条件 1
名前は英大文字 (
A
,
B
, ...,
Z
) と英小文字 (
a
,
b
, ...,
z
) からなる文字列である．
条件 2
JOI 君の好きな文字列は長さ
N
の文字列
S
であるから，
S
が名前の部分列となるようにする．
条件 3
IOI 君の好きな文字列は長さ
M
の文字列
T
であるから，
T
が名前の部分列となるようにする．
条件 4
名前を呼びやすいものにするため，同じ文字の間には別の文字が
K
文字以上あるようにする．厳密には，位置が異なる任意の同じ文字
2
つについて，必ずその間に別の文字が
K
文字以上入っているようにする．なお，
K = 0
の場合や，名前の文字がすべて異なる場合は，この条件を満たしていると考える．
ただし，これらの条件では英大文字と英小文字は区別される．例えば
A
と
a
は異なる文字とみなされることに注意せよ．
ここで，名前の部分列とは，名前から何文字か (
0
文字でもよい) を取り除いて作れる文字列のことである．例えば，名前が
algorithm
であるとき，
ai
や
lgtm
は名前の部分列であるが，
joi
や
logarithm
は名前の部分列ではない．
二人は名前が短いほど良いと考えているため，
4
つの条件のもとで最も短い名前を付けることにした．
JOI 君と IOI 君の好きな文字列および整数
K
が与えられたとき，犬に付ける名前の文字数を求めるプログラムを作成せよ．
制約
1 ≦ N ≦ 500
．
1 ≦ M ≦ 500
．
0 ≦ K ≦ 3
．
S
は英大文字と英小文字からなる長さ
N
の文字列である．
T
は英大文字と英小文字からなる長さ
M
の文字列である．
N, M, K
は整数である．
入力
入力は以下の形式で与えられる．
N
M
K
S
T
出力
犬に付ける名前の文字数を
1
行で出力せよ．
入出力例
入力例 1
10 10 0
hottokeiki
hottokeiki
出力例 1
10
JOI 君と IOI 君の好きな文字列はどちらも
hottokeiki
である．ここで，犬の名前を
hottokeiki
にすることを考える．これは以下のように
4
つの条件を満たす．
条件 1:
名前は英大文字と英小文字からなる．
条件 2:
文字列
S
(
hottokeiki
) は犬の名前
hottokeiki
の部分列である．
条件 3:
文字列
T
(
hottokeiki
) は犬の名前
hottokeiki
の部分列である．
条件 4:
K = 0
なので，この条件は満たしている．
また，これが
4
つの条件を満たす中で最も短い名前である．この文字数
10
を出力する．
入力例 2
10 10 1
hottokeiki
hottokeiki
出力例 2
11
入力例
1
とは
K
の値のみが異なる．
もし犬の名前を入力例
1
と同じ
hottokeiki
にすれば，
条件 4
を満たさない．なぜなら，
2
つの
t
の間に文字が
1
個もないからである．
4
つの条件を満たす最も短い名前として
hotNtokeiki
などが考えられる．この文字数
11
を出力する．
入力例 3
10 10 3
hottokeiki
hottokeiki
出力例 3
15
入力例
1, 2
とは
K
の値のみが異なる．
もし犬の名前を入力例
2
と同じ
hotNtokeiki
にすれば，
条件 4
を満たさない．なぜなら，
2
つの
t
の間に
1
文字しかなく，
2
つの
k
の間に
2
文字しかなく，
2
つの
i
の間に
1
文字しかないからである．
4
つの条件を満たす最も短い名前として
hotarutokeiyuki
などが考えられる．この文字数
15
を出力する．
入力例 4
6 9 0
Jouhou
Orinpikku
出力例 4
14
JOI 君の好きな文字列は
Jouhou
，IOI 君の好きな文字列は
Orinpikku
である．ここで，犬の名前を
OJouhorinpikku
にすることを考える．これは以下のように
4
つの条件を満たす．
条件 1:
名前は英大文字と英小文字からなる．
条件 2:
文字列
S
(
Jouhou
) は犬の名前
OJouhorinpikku
の部分列である．
条件 3:
文字列
T
(
Orinpikku
) は犬の名前
OJouhorinpikku
の部分列である．
条件 4:
K = 0
なので，この条件は満たしている．
また，これが
4
つの条件を満たす中で最も短い名前のひとつである．この文字数
14
を出力する．なお，英大文字と英小文字は区別されるため，
jouhorinpikku
（文字数
13
）などは条件を満たさない．
入力例 5
9 7 1
CoMMiTTee
TeRRaCe
出力例 5
15
4
つの条件を満たす最も短い名前として
CoMaMiTeRTeRaCe
などが考えられる．この文字数
15
を出力する．
入力例 6
6 8 2
JOIIOI
JOIGEGOI
出力例 6
9
4
つの条件を満たす最も短い名前は
JOIGEIGOI
である．この文字数
9
を出力する．
情報オリンピック日本委員会
作『日本情報オリンピック第4回女性部門 本選 競技課題』
|
[
{
"submission_id": "aoj_0789_10573174",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = 1000000000;\ninline void chmin(int &a, int b) { if (a > b) a = b; }\nint baseVals[8] = {0, 1, 4, 5, 16, 17, 20, 21};\nint bitCount[8] = {0, 4, 4, 6, 4, 6, 6, 7};\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n ll N, M, K;\n cin >> N >> M >> K;\n string S, T;\n cin >> S >> T;\n\n int dpSize = (M + 1) * 64;\n vector<int> dp(dpSize, INF);\n\n int mask = (7 << (3 - K)) & 7;\n int pc2[64] = {};\n for (int i = 0; i < 8; i++) {\n for (int j = 0; j < 8; j++) {\n int idx = baseVals[i] + baseVals[j] * 2;\n pc2[idx] = baseVals[ bitCount[i & mask] ] + baseVals[ bitCount[j & mask] ] * 2;\n }\n }\n dp[0] = 0;\n for (int posS = 0; posS <= N; posS++){\n vector<int> nDP(dpSize, INF);\n\n for (int posT = 0; posT <= M; posT++){\n for (int i = 63; i >= 0; i--){\n int baseIndex = posT * 64 + i / 4;\n int stateIndex = posT * 64 + i;\n chmin(dp[baseIndex], dp[stateIndex] + 1);\n }\n\n char cS = (posS == N ? '.' : S[posS]);\n char cT = (posT == M ? '.' : T[posT]);\n\n int stateS = 0;\n if (posS != N){\n for (int d = 2; d >= 0; d--){\n if (d < posS && S[posS - 1 - d] == cS)\n stateS |= 1 << (4 - d * 2);\n }\n for (int d = 2; d >= 0; d--){\n if (d < posT && T[posT - 1 - d] == cS)\n stateS |= 2 << (4 - d * 2);\n }\n }\n int stateT = 0;\n if (posT != M){\n for (int d = 2; d >= 0; d--){\n if (d < posS && S[posS-1-d] == cT) stateT |= 1 << (4 - d * 2);\n }\n for (int d = 2; d >= 0; d--){\n if (d < posT && T[posT-1-d] == cT) stateT |= 2 << (4 - d * 2);\n }\n }\n if (posS != N) {\n for (int i = 0; i < 64; i++){\n if ((pc2[i] & stateS) == 0){\n int idx = posT * 64 + i / 4 + 16;\n chmin(nDP[idx], dp[posT * 64 + i] + 1);\n }\n }\n }\n if (posT != M) {\n for (int i = 0; i < 64; i++){\n if ((pc2[i] & stateT) == 0) {\n int idx = posT * 64 + 64 + i / 4 + 32;\n chmin(dp[idx], dp[posT * 64 + i] + 1);\n }\n }\n }\n if (posS != N && posT != M && cS == cT) {\n for (int i = 0; i < 64; i++){\n if ((pc2[i] & (stateT | stateS)) == 0){\n int idx = posT * 64 + 64 + i / 4 + 48;\n chmin(nDP[idx], dp[posT * 64 + i] + 1);\n }\n }\n }\n }\n if (posS != N) dp.swap(nDP);\n }\n\n int ans = INF;\n for (int i = 0; i < 64; i++) chmin(ans, dp[M * 64 + i]);\n cout << ans << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3596,
"score_of_the_acc": -0.1305,
"final_rank": 3
},
{
"submission_id": "aoj_0789_10565215",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconstexpr int INF = 1000000000;\n\n// chmin: aをbで更新する（a > bのときのみ）\ninline void chmin(int &a, int b) { if (a > b) a = b; }\n\nconstexpr array<int, 8> baseVals = {0, 1, 4, 5, 16, 17, 20, 21};\nconstexpr array<int, 8> bitCount = {0, 4, 4, 6, 4, 6, 6, 7};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n ll N, M, K;\n cin >> N >> M >> K;\n string S, T;\n cin >> S >> T;\n\n const int dpSize = (M + 1) * 64;\n vector<int> dp(dpSize, INF);\n\n int mask = (7 << (3 - K)) & 7;\n array<int, 64> pc2{}; // 0初期化\n\n for (int i = 0; i < 8; ++i) {\n for (int j = 0; j < 8; ++j) {\n int idx = baseVals[i] + baseVals[j] * 2;\n pc2[idx] = baseVals[bitCount[i & mask]] + baseVals[bitCount[j & mask]] * 2;\n }\n }\n dp[0] = 0;\n for (int posS = 0; posS <= N; ++posS) {\n vector<int> nDP(dpSize, INF);\n\n for (int posT = 0; posT <= M; ++posT) {\n for (int i = 63; i >= 0; --i) {\n int baseIndex = posT * 64 + i / 4;\n int stateIndex = posT * 64 + i;\n chmin(dp[baseIndex], dp[stateIndex] + 1);\n }\n\n char cS = (posS == N ? '.' : S[posS]);\n char cT = (posT == M ? '.' : T[posT]);\n\n int stateS = 0;\n if (posS != N) {\n for (int d = 2; d >= 0; --d) {\n if (d < posS && S[posS - 1 - d] == cS)\n stateS |= 1 << (4 - d * 2);\n }\n for (int d = 2; d >= 0; --d) {\n if (d < posT && T[posT - 1 - d] == cS)\n stateS |= 2 << (4 - d * 2);\n }\n }\n int stateT = 0;\n if (posT != M) {\n for (int d = 2; d >= 0; --d) {\n if (d < posS && S[posS - 1 - d] == cT)\n stateT |= 1 << (4 - d * 2);\n }\n for (int d = 2; d >= 0; --d) {\n if (d < posT && T[posT - 1 - d] == cT)\n stateT |= 2 << (4 - d * 2);\n }\n }\n if (posS != N) {\n for (int i = 0; i < 64; ++i) {\n if ((pc2[i] & stateS) == 0) {\n int idx = posT * 64 + i / 4 + 16;\n chmin(nDP[idx], dp[posT * 64 + i] + 1);\n }\n }\n }\n if (posT != M) {\n for (int i = 0; i < 64; ++i) {\n if ((pc2[i] & stateT) == 0) {\n int idx = posT * 64 + 64 + i / 4 + 32;\n chmin(dp[idx], dp[posT * 64 + i] + 1);\n }\n }\n }\n if (posS != N && posT != M && cS == cT) {\n for (int i = 0; i < 64; ++i) {\n if ((pc2[i] & (stateT | stateS)) == 0) {\n int idx = posT * 64 + 64 + i / 4 + 48;\n chmin(nDP[idx], dp[posT * 64 + i] + 1);\n }\n }\n }\n }\n if (posS != N) dp.swap(nDP);\n }\n\n int ans = INF;\n for (int i = 0; i < 64; ++i) chmin(ans, dp[M * 64 + i]);\n cout << ans << '\\n';\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3840,
"score_of_the_acc": -0.132,
"final_rank": 4
},
{
"submission_id": "aoj_0789_10565203",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nstatic constexpr ll INF = (ll)1e15;\n\n// a,b のうち小さいほうで a を更新する (戻り値は更新の有無)\nstatic inline bool chmin(ll &a, ll b) {\n if (a > b) { a = b; return true; }\n return false;\n}\n\n// DP[i][j][mask] = S の先頭 i 文字、T の先頭 j 文字をそれぞれ部分列にしつつ、\n// かつ「U の末尾直前３文字の由来」を mask≡[上位２ビット:3番目, 中位２ビット:2番目, 下位２ビット:1番目]で表したときの\n// 「構築可能な最短文字列長」。mask の各 2 ビットは 00=S 由来、01=T 由来、10=その他（ダミー文字 or 初期）を示す。\n// 最終的には DP[N][M][*] の最小値を答とする。\n\nstatic ll DP[505][505][64];\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (true) {\n int N, M, K;\n if (!(cin >> N >> M >> K)) return 0;\n if (N==0 && M==0 && K==0) break;\n string S, T;\n cin >> S >> T;\n\n // DP を無限大で初期化\n for(int i=0;i<=N;i++){\n for(int j=0;j<=M;j++){\n for(int m=0;m<64;m++){\n DP[i][j][m] = INF;\n }\n }\n }\n // (i,j)=(0,0), mask=63 (2進数で 111111_2) → 末尾直前 3 文字すべて「その他」を示す(10 10 10_2)\n DP[0][0][63] = 0;\n\n // (i,j) に対して遷移を全探索\n for(int i=0;i<=N;i++){\n for(int j=0;j<=M;j++){\n if (i==N && j==M) continue;\n for(int mask=0; mask<64; mask++){\n ll cur = DP[i][j][mask];\n if (cur >= INF) continue;\n\n // --- 遷移パターン 1: S[i] だけを U に追加する ---\n if (i < N) {\n // 同時に (i<M && S[i]==T[j]) の場合は「両方同時追加」に回るのでここでは skip\n if (!(j<M && S[i]==T[j])) {\n // 直前１文字の由来を取得 (下位２ビットで判別)\n int prev1 = (mask >> 0) & 0b11; \n bool ok = true;\n // K>0 のとき、直前１文字由来が「S 由来(00)」なら、間隔制約をチェック\n if (K > 0 && prev1 == 0) {\n // U の末尾１文字は S 由来なので、それが S[i-1] ということになる\n // → S[i-1] と S[i] が同一なら間隔不足で NG\n if (i-1 >= 0 && S[i-1] == S[i]) ok = false;\n }\n if (ok) {\n ll nxt = cur + 1;\n int ni = i+1, nj = j;\n // S[i] が T[j] と等しければ T も一緒に進むが、ここは「S だけ」なので、\n // もし T[j]==S[i] なら T の j も進める (ただし、先に分岐で排除しているが念のため)\n if (j < M && S[i] == T[j]) nj = j+1;\n // 新 mask をシフトして下位２ビットを 00 (S由来) に\n int newMask = ((mask << 2) & 0b111111) | 0b00;\n chmin(DP[ni][nj][newMask], nxt);\n }\n }\n }\n\n // --- 遷移パターン 2: T[j] だけを U に追加する ---\n if (j < M) {\n if (!(i<N && S[i]==T[j])) {\n int prev1 = (mask >> 0) & 0b11;\n bool ok = true;\n if (K > 0 && prev1 == 1) {\n if (j-1 >= 0 && T[j-1] == T[j]) ok = false;\n }\n if (ok) {\n ll nxt = cur + 1;\n int ni = i, nj = j+1;\n if (i < N && S[i] == T[j]) ni = i+1;\n int newMask = ((mask << 2) & 0b111111) | 0b01;\n chmin(DP[ni][nj][newMask], nxt);\n }\n }\n }\n\n // --- 遷移パターン 3: S[i]==T[j] のとき、両方を同時に追加 ---\n if (i<N && j<M && S[i] == T[j]) {\n int prev1 = (mask >> 0) & 0b11;\n bool ok = true;\n if (K > 0 && prev1 == 0) {\n if (i-1 >= 0 && S[i-1] == S[i]) ok = false;\n }\n if (ok) {\n ll nxt = cur + 1;\n int ni = i+1, nj = j+1;\n int newMask = ((mask << 2) & 0b111111) | 0b00;\n chmin(DP[ni][nj][newMask], nxt);\n }\n }\n }\n }\n }\n\n // 最終状態 (N,M) の全 mask から最小値を取る\n ll ans = INF;\n for(int m=0; m<64; m++){\n chmin(ans, DP[N][M][m]);\n }\n cout << ans << \"\\n\";\n }\n return 0;\n}",
"accuracy": 0.08163265306122448,
"time_ms": 10,
"memory_kb": 130512,
"score_of_the_acc": -0.7587,
"final_rank": 8
},
{
"submission_id": "aoj_0789_10565198",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nstatic constexpr ll INF = (ll)1e15;\n\n// chmin helper\nstatic inline bool chmin(ll &a, ll b) {\n if (a > b) { a = b; return true; }\n return false;\n}\n\n// DP[i][j][mask] = 最短長さで、S の先頭 i 文字・T の先頭 j 文字をそれぞれ部分列に含み、\n// U の末尾直前 3 文字の「由来状態」を mask (0..63) で表したときの最短名前長。\n// mask の各 2 ビットは末尾直前 3 文字が どこから来たか(00=S由来、01=T由来、10=それ以外)を示す。\n// たとえば、mask の下位 2 ビット=(末尾から3番目)由来、次の 2 ビット=(末尾から2番目)由来、上位 2 ビット=(末尾直前)由来。\nstatic ll DP[505][505][64];\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int N, M, K;\n while ( (cin >> N >> M >> K) ){\n string S, T;\n if (!cin || (N==0 && M==0 && K==0)) break;\n cin >> S >> T;\n\n // 全要素を INF で初期化\n for(int i=0;i<=N;i++){\n for(int j=0;j<=M;j++){\n for(int m=0;m<64;m++){\n DP[i][j][m] = INF;\n }\n }\n }\n // 初期状態: (i,j)=(0,0), mask=0b111111(=63): 末尾直前に文字が無いので \"10\" を３つ並べて「それ以外」を示す\n DP[0][0][63] = 0;\n\n // すべての (i,j) を走査\n for(int i=0;i<=N;i++){\n for(int j=0;j<=M;j++){\n if (i==N && j==M) continue;\n // mask をくるくる回して遷移\n for(int mask=0; mask<64; mask++){\n ll cur = DP[i][j][mask];\n if (cur >= INF) continue;\n\n // (1) S[i] を U に追加する\n if (i < N) {\n // もし S[i]==T[j] の同時追加遷移が行われる場合は飛ばす\n if (!(j < M && S[i]==T[j])) {\n int prev2 = (mask >> 4) & 0b11; // 直前1文字の由来\n bool ok = true;\n if (K>0 && prev2 == 0) {\n // 直前由来が S なら、距離制約\n if (i-1>=0 && S[i-1]==S[i]) ok = false;\n }\n if (ok){\n ll nxt = cur + 1;\n int ni = i+1, nj = j;\n if (j<M && S[i]==T[j]) nj = j+1;\n int newMask = ((mask << 2) & 0b111111) | 0b00; \n chmin(DP[ni][nj][newMask], nxt);\n }\n }\n }\n\n // (2) T[j] を U に追加する\n if (j < M) {\n if (!(i < N && S[i]==T[j])) {\n int prev2 = (mask >> 4) & 0b11;\n bool ok = true;\n if (K>0 && prev2 == 1) {\n if (j-1>=0 && T[j-1]==T[j]) ok = false;\n }\n if (ok){\n ll nxt = cur + 1;\n int ni = i, nj = j+1;\n if (i<N && S[i]==T[j]) ni = i+1;\n int newMask = ((mask << 2) & 0b111111) | 0b01;\n chmin(DP[ni][nj][newMask], nxt);\n }\n }\n }\n\n // (3) S[i] == T[j] のとき、両方を同時に追加\n if (i<N && j<M && S[i]==T[j]) {\n int prev2 = (mask >> 4) & 0b11;\n bool ok = true;\n if (K>0 && prev2 == 0) {\n if (i-1>=0 && S[i-1]==S[i]) ok = false;\n }\n if (ok){\n ll nxt = cur + 1;\n int ni = i+1, nj = j+1;\n int newMask = ((mask << 2) & 0b111111) | 0b00;\n chmin(DP[ni][nj][newMask], nxt);\n }\n }\n }\n }\n }\n\n // 最終状態 (N,M) の全 mask から最小値を取る\n ll answer = INF;\n for(int mask=0; mask<64; mask++){\n chmin(answer, DP[N][M][mask]);\n }\n cout << answer << \"\\n\";\n }\n\n return 0;\n}",
"accuracy": 0.08163265306122448,
"time_ms": 20,
"memory_kb": 130516,
"score_of_the_acc": -0.7805,
"final_rank": 9
},
{
"submission_id": "aoj_0789_10565193",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vvvvll = vector<vvvll>;\n\n// 値を最小化する補助関数\nbool chmin(ll &p, ll q) {\n if (p > q) {\n p = q;\n return true;\n }\n return false;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n ll N, M, K;\n cin >> N >> M >> K;\n string S, T;\n cin >> S >> T;\n\n // DP 配列: DP[n][m][mask] = 名前の長さの最小値\n // mask は 6 ビット (0..63) で末尾直前の 3 文字をエンコードする\n // 下位 2 ビット: 最も古い末尾文字の由来 (00=S, 01=T, 10=その他)\n // 次の 2 ビット: その次の末尾文字の由来\n // 最上位 2 ビット: 直前の末尾文字の由来\n const ll INF = (ll)1e18;\n vector< vector< vector<ll> > > DP(N + 1,\n vector< vector<ll> >(M + 1,\n vector<ll>(64, INF)));\n // 初期状態: S, T の文字をいずれもまだ使っておらず、末尾直前文字は「その他(10ビット)×3」\n DP[0][0][63] = 0;\n\n // 遷移\n for (ll n = 0; n <= N; ++n) {\n for (ll m = 0; m <= M; ++m) {\n // (n,m) = (N,M) は終端なので遷移不要\n if (n == N && m == M) continue;\n\n // mask をループして遷移\n for (int mask = 0; mask < 64; ++mask) {\n ll cur = DP[n][m][mask];\n if (cur >= INF) continue;\n\n // 末尾直前の 3 文字が何由来かを 2 ビットずつ参照\n // bit0-1 = 最も古い末尾文字の由来\n // bit2-3 = その次の末尾文字の由来\n // bit4-5 = 直前の末尾文字の由来\n\n // ■ 1. S[n] を新たに追加する (S の文字を使う)\n if (n < N) {\n // すでに S[n]==T[m] による同時追加をしない場合\n if (!(m < M && S[n] == T[m])) {\n // K 文字以上隔てる制約チェック\n // 直前文字の由来ビット = (mask >> 4) & 0b11\n int prev2 = (mask >> 4) & 0b11;\n bool ok = true;\n if (K > 0 && prev2 == 0) {\n // 直前文字が S由来 なら距離を調べる\n // 末尾直前位置 = n-1\n // 同じ文字かチェック\n if (n - 1 >= 0 && S[n - 1] == S[n]) {\n ok = false;\n }\n }\n if (ok) {\n ll nxt = cur + 1;\n ll nn = n + 1, mm2 = m;\n // もし S[n] == T[m] なら m も同時に進める\n if (m < M && S[n] == T[m]) {\n mm2 = m + 1;\n }\n // mask を 2 ビット左シフトして、下位 2 ビットに \"S由来(00)\" を入れる\n int newMask = ((mask << 2) & 0b111111) | 0b00;\n chmin(DP[nn][mm2][newMask], nxt);\n }\n }\n }\n\n // ■ 2. T[m] を新たに追加する (T の文字を使う)\n if (m < M) {\n if (!(n < N && S[n] == T[m])) {\n int prev2 = (mask >> 4) & 0b11;\n bool ok = true;\n if (K > 0 && prev2 == 1) {\n if (m - 1 >= 0 && T[m - 1] == T[m]) {\n ok = false;\n }\n }\n if (ok) {\n ll nxt = cur + 1;\n ll nn2 = n, mm = m + 1;\n if (n < N && S[n] == T[m]) {\n nn2 = n + 1;\n }\n int newMask = ((mask << 2) & 0b111111) | 0b01;\n chmin(DP[nn2][mm][newMask], nxt);\n }\n }\n }\n\n // ■ 3. S[n] == T[m] のとき、一度に両方を追加\n if (n < N && m < M && S[n] == T[m]) {\n int prev2 = (mask >> 4) & 0b11;\n bool ok = true;\n if (K > 0 && prev2 == 0) {\n if (n - 1 >= 0 && S[n - 1] == S[n]) {\n ok = false;\n }\n }\n if (ok) {\n ll nxt = cur + 1;\n ll nn = n + 1, mm = m + 1;\n int newMask = ((mask << 2) & 0b111111) | 0b00;\n chmin(DP[nn][mm][newMask], nxt);\n }\n }\n } // mask ループ\n }\n }\n\n // 答えは DP[N][M][mask] の最小値\n ll ans = INF;\n for (int mask = 0; mask < 64; ++mask) {\n chmin(ans, DP[N][M][mask]);\n }\n cout << ans << \"\\n\";\n return 0;\n}",
"accuracy": 0.08163265306122448,
"time_ms": 40,
"memory_kb": 139008,
"score_of_the_acc": -0.8747,
"final_rank": 10
},
{
"submission_id": "aoj_0789_10272735",
"code_snippet": "// AOJ #789 Name\n// 2025.3.7\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = 1000000000;\ninline void chmin(int &a, int b) { if (a > b) a = b; }\nint baseVals[8] = {0, 1, 4, 5, 16, 17, 20, 21};\nint bitCount[8] = {0, 4, 4, 6, 4, 6, 6, 7};\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n ll N, M, K;\n cin >> N >> M >> K;\n string S, T;\n cin >> S >> T;\n\n int dpSize = (M + 1) * 64;\n vector<int> dp(dpSize, INF);\n\n int mask = (7 << (3 - K)) & 7;\n int pc2[64] = {};\n for (int i = 0; i < 8; i++) {\n for (int j = 0; j < 8; j++) {\n int idx = baseVals[i] + baseVals[j] * 2;\n pc2[idx] = baseVals[ bitCount[i & mask] ] + baseVals[ bitCount[j & mask] ] * 2;\n }\n }\n dp[0] = 0;\n for (int posS = 0; posS <= N; posS++){\n vector<int> nDP(dpSize, INF);\n\n for (int posT = 0; posT <= M; posT++){\n for (int i = 63; i >= 0; i--){\n int baseIndex = posT * 64 + i / 4;\n int stateIndex = posT * 64 + i;\n chmin(dp[baseIndex], dp[stateIndex] + 1);\n }\n\n char cS = (posS == N ? '.' : S[posS]);\n char cT = (posT == M ? '.' : T[posT]);\n\n int stateS = 0;\n if (posS != N){\n for (int d = 2; d >= 0; d--){\n if (d < posS && S[posS - 1 - d] == cS)\n stateS |= 1 << (4 - d * 2);\n }\n for (int d = 2; d >= 0; d--){\n if (d < posT && T[posT - 1 - d] == cS)\n stateS |= 2 << (4 - d * 2);\n }\n }\n int stateT = 0;\n if (posT != M){\n for (int d = 2; d >= 0; d--){\n if (d < posS && S[posS-1-d] == cT) stateT |= 1 << (4 - d * 2);\n }\n for (int d = 2; d >= 0; d--){\n if (d < posT && T[posT-1-d] == cT) stateT |= 2 << (4 - d * 2);\n }\n }\n if (posS != N) {\n for (int i = 0; i < 64; i++){\n if ((pc2[i] & stateS) == 0){\n int idx = posT * 64 + i / 4 + 16;\n chmin(nDP[idx], dp[posT * 64 + i] + 1);\n }\n }\n }\n if (posT != M) {\n for (int i = 0; i < 64; i++){\n if ((pc2[i] & stateT) == 0) {\n int idx = posT * 64 + 64 + i / 4 + 32;\n chmin(dp[idx], dp[posT * 64 + i] + 1);\n }\n }\n }\n if (posS != N && posT != M && cS == cT) {\n for (int i = 0; i < 64; i++){\n if ((pc2[i] & (stateT | stateS)) == 0){\n int idx = posT * 64 + 64 + i / 4 + 48;\n chmin(nDP[idx], dp[posT * 64 + i] + 1);\n }\n }\n }\n }\n if (posS != N) dp.swap(nDP);\n }\n\n int ans = INF;\n for (int i = 0; i < 64; i++) chmin(ans, dp[M * 64 + i]);\n cout << ans << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3580,
"score_of_the_acc": -0.1304,
"final_rank": 1
},
{
"submission_id": "aoj_0789_10272729",
"code_snippet": "// AOJ #789 Name\n// 2025.3.7\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = 1000000000;\ninline void chmin(int &a, int b) { if (a > b) a = b; }\nint baseVals[8] = {0, 1, 4, 5, 16, 17, 20, 21};\nint bitCount[8] = {0, 4, 4, 6, 4, 6, 6, 7};\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n ll N, M, K;\n cin >> N >> M >> K;\n string S, T;\n cin >> S >> T;\n\n int dpSize = (M + 1) * 64;\n vector<int> dp(dpSize, INF);\n\n int mask = (7 << (3 - K)) & 7;\n int pc2[64] = {};\n for (int i = 0; i < 8; i++) {\n for (int j = 0; j < 8; j++) {\n int idx = baseVals[i] + baseVals[j] * 2;\n pc2[idx] = baseVals[ bitCount[i & mask] ] + baseVals[ bitCount[j & mask] ] * 2;\n }\n }\n dp[0] = 0;\n for (int posS = 0; posS <= N; posS++){\n vector<int> nextDP(dpSize, INF);\n\n for (int posT = 0; posT <= M; posT++){\n for (int state = 63; state >= 0; state--){\n int baseIndex = posT * 64 + state / 4;\n int stateIndex = posT * 64 + state;\n dp[baseIndex] = min(dp[baseIndex], dp[stateIndex] + 1);\n }\n\n char currentCharS = (posS == N ? '.' : S[posS]);\n char currentCharT = (posT == M ? '.' : T[posT]);\n\n int stateS = 0;\n if (posS != N){\n for (int d = 2; d >= 0; d--){\n if (d < posS && S[posS - 1 - d] == currentCharS)\n stateS |= 1 << (4 - d * 2);\n }\n for (int d = 2; d >= 0; d--){\n if (d < posT && T[posT - 1 - d] == currentCharS)\n stateS |= 2 << (4 - d * 2);\n }\n }\n int stateT = 0;\n if (posT != M){\n for (int d = 2; d >= 0; d--){\n if (d < posS && S[posS - 1 - d] == currentCharT)\n stateT |= 1 << (4 - d * 2);\n }\n for (int d = 2; d >= 0; d--){\n if (d < posT && T[posT - 1 - d] == currentCharT)\n stateT |= 2 << (4 - d * 2);\n }\n }\n if (posS != N) {\n for (int state = 0; state < 64; state++){\n if ((pc2[state] & stateS) == 0){\n int idx = posT * 64 + state / 4 + 16;\n chmin(nextDP[idx], dp[posT * 64 + state] + 1);\n }\n }\n }\n if (posT != M) {\n for (int state = 0; state < 64; state++){\n if ((pc2[state] & stateT) == 0) {\n int idx = posT * 64 + 64 + state / 4 + 32;\n chmin(dp[idx], dp[posT * 64 + state] + 1);\n }\n }\n }\n if (posS != N && posT != M && currentCharS == currentCharT) {\n for (int state = 0; state < 64; state++){\n if ((pc2[state] & (stateT | stateS)) == 0){\n int idx = posT * 64 + 64 + state / 4 + 48;\n nextDP[idx] = min(nextDP[idx], dp[posT * 64 + state] + 1);\n }\n }\n }\n }\n if (posS != N) dp.swap(nextDP);\n }\n\n int ans = INF;\n for (int i = 0; i < 64; i++) chmin(ans, dp[M * 64 + i]);\n cout << ans << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3584,
"score_of_the_acc": -0.1305,
"final_rank": 2
},
{
"submission_id": "aoj_0789_10272163",
"code_snippet": "// AOJ #789 Name\n// 2025.3.6\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int slen, tlen, threshold;\n cin >> slen >> tlen >> threshold;\n\n string source, target;\n cin >> source >> target;\n source.push_back('!');\n target.push_back('?');\n\n vector<vector<map<string, int>>> dp(slen + 1, vector<map<string, int>>(tlen + 1));\n dp[0][0][\"...\"] = 0;\n\n int ans = numeric_limits<int>::max();\n\n for (int i = 0; i <= slen; ++i) {\n for (int j = 0; j <= tlen; ++j) {\n for (auto &entry : dp[i][j]) {\n string cur = entry.first;\n int currentCost = entry.second;\n\n if (i < slen) {\n char sourceChar = source[i];\n int foundIndex = find(cur.begin(), cur.end(), sourceChar) - cur.begin();\n int additionalDots = max(threshold - foundIndex, 0);\n\n string newState = cur;\n for (int count = 0; count < additionalDots; ++count) {\n newState = \".\" + newState;\n }\n newState = sourceChar + newState;\n while (newState.size() > 3) newState.pop_back();\n\n int newTargetIndex = j + (sourceChar == target[j] ? 1 : 0);\n if (dp[i+1][newTargetIndex].find(newState) == dp[i+1][newTargetIndex].end())\n dp[i+1][newTargetIndex][newState] = numeric_limits<int>::max();\n dp[i+1][newTargetIndex][newState] = min(dp[i+1][newTargetIndex][newState],\n currentCost + additionalDots + 1);\n }\n\n if (j < tlen) {\n char targetChar = target[j];\n int foundIndex = find(cur.begin(), cur.end(), targetChar) - cur.begin();\n int additionalDots = max(threshold - foundIndex, 0);\n\n string newState = cur;\n for (int count = 0; count < additionalDots; ++count) {\n newState = \".\" + newState;\n }\n newState = targetChar + newState;\n while (newState.size() > 3) newState.pop_back();\n\n int newSourceIndex = i + (source[i] == targetChar ? 1 : 0);\n if (dp[newSourceIndex][j+1].find(newState) == dp[newSourceIndex][j+1].end())\n dp[newSourceIndex][j+1][newState] = numeric_limits<int>::max();\n dp[newSourceIndex][j+1][newState] = min(dp[newSourceIndex][j+1][newState],\n currentCost + additionalDots + 1);\n }\n if (i == slen && j == tlen) ans = min(ans, currentCost);\n }\n }\n }\n cout << ans << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 470,
"memory_kb": 170884,
"score_of_the_acc": -2,
"final_rank": 7
},
{
"submission_id": "aoj_0789_10122698",
"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 dp[505][505][3][3][3];\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n, m, k;\n cin >> n >> m >> k;\n string s, t;\n cin >> s >> t;\n for (int i = 0; i <= n; i++) {\n for (int j = 0; j <= m; j++) {\n for (int k1 = 0; k1 < 3; k1++) {\n for (int k2 = 0; k2 < 3; k2++) {\n for (int k3 = 0; k3 < 3; k3++) {\n dp[i][j][k1][k2][k3] = 1e9;\n }\n }\n }\n }\n }\n dp[0][0][2][2][2] = 0;\n for (int i = 0; i <= n; i++) {\n for (int j = 0; j <= m; j++) {\n if (i + j == n + m) continue;\n for (int k1 = 0; k1 < 3; k1++) {\n for (int k2 = 0; k2 < 3; k2++) {\n for (int k3 = 0; k3 < 3; k3++) {\n int val = dp[i][j][k1][k2][k3];\n if (val == 1e9) continue;\n\n if (i < n) {\n int cost = val + 1;\n int x = i - 1, y = j - 1;\n string str = \"\";\n if (1 <= k) {\n if (k1 == 0) {\n str += s[x];\n if (y >= 0 and s[x] == t[y]) y -= 1;\n x -= 1;\n } else if (k1 == 1) {\n str += t[y];\n if (x >= 0 and s[x] == t[y]) x -= 1;\n y -= 1;\n } else {\n str += '.';\n }\n }\n if (2 <= k) {\n if (k2 == 0) {\n str += s[x];\n if (y >= 0 and s[x] == t[y]) y -= 1;\n x -= 1;\n } else if (k2 == 1) {\n str += t[y];\n if (x >= 0 and s[x] == t[y]) x -= 1;\n y -= 1;\n } else {\n str += '.';\n }\n }\n if (3 <= k) {\n if (k3 == 0) {\n str += s[x];\n if (y >= 0 and s[x] == t[y]) y -= 1;\n x -= 1;\n } else if (k3 == 1) {\n str += t[y];\n if (x >= 0 and s[x] == t[y]) x -= 1;\n y -= 1;\n } else {\n str += '.';\n }\n }\n\n int a = 0, b = k1, c = k2;\n\n for (int ii = 0; ii < str.size(); ii++) {\n if (str[ii] == s[i]) {\n cost += k - ii;\n for (int l = 0; l < k - ii; l++) {\n c = b;\n b = 2;\n }\n break;\n }\n }\n\n dp[i + 1][j + (j < m and s[i] == t[j])][a][b][c] =\n min(dp[i + 1][j + (j < m and s[i] == t[j])][a][b][c], cost);\n }\n\n if (j < m) {\n int cost = val + 1;\n int x = i - 1, y = j - 1;\n string str = \"\";\n if (1 <= k) {\n if (k1 == 0) {\n str += s[x];\n if (y >= 0 and s[x] == t[y]) y -= 1;\n x -= 1;\n } else if (k1 == 1) {\n str += t[y];\n if (x >= 0 and s[x] == t[y]) x -= 1;\n y -= 1;\n } else {\n str += '.';\n }\n }\n if (2 <= k) {\n if (k2 == 0) {\n str += s[x];\n if (y >= 0 and s[x] == t[y]) y -= 1;\n x -= 1;\n } else if (k2 == 1) {\n str += t[y];\n if (x >= 0 and s[x] == t[y]) x -= 1;\n y -= 1;\n } else {\n str += '.';\n }\n }\n if (3 <= k) {\n if (k3 == 0) {\n str += s[x];\n if (y >= 0 and s[x] == t[y]) y -= 1;\n x -= 1;\n } else if (k3 == 1) {\n str += t[y];\n if (x >= 0 and s[x] == t[y]) x -= 1;\n y -= 1;\n } else {\n str += '.';\n }\n }\n\n int a = 1, b = k1, c = k2;\n\n for (int ii = 0; ii < str.size(); ii++) {\n if (str[ii] == t[j]) {\n cost += k - ii;\n for (int l = 0; l < k - ii; l++) {\n c = b;\n b = 2;\n }\n break;\n }\n }\n\n dp[i + (i < n and s[i] == t[j])][j + 1][a][b][c] =\n min(dp[i + (i < n and s[i] == t[j])][j + 1][a][b][c], cost);\n }\n }\n }\n }\n }\n }\n int res = 1e9;\n for (int i = 0; i < 3; i++) {\n for (int j = 0; j < 3; j++) {\n for (int k = 0; k < 3; k++) {\n res = min(res, dp[n][m][i][j][k]);\n }\n }\n }\n cout << res << endl;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 30068,
"score_of_the_acc": -0.2235,
"final_rank": 5
},
{
"submission_id": "aoj_0789_10118925",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vvvvll = vector<vvvll>;\n\nbool chmin(ll& p, ll q) { if(p>q){\n p = min(p, q); \n return 1;\n}\nreturn 0;};\n\nint main() {\n ll N, M, K;\n cin >> N >> M >> K;\n string S, T;\n cin >> S >> T;\n vvvll DP(N + 1, vvll(M + 1, vll(64, 1e18)));\n DP[0][0][63] = 0;\n for (int n = 0; n <= N; n++) {\n for (int m = 0; m <= M; m++) {\n \n for (ll mm = 0; mm < 100; mm++){\n bool C=0;\n for (int b = 0; b < 64; b++) {\n if(chmin(DP[n][m][(b * 4 + 3) % 64], DP[n][m][b] + 1))C=1;\n if (DP[n][m][b] > 1e17)continue;\n\n if (n==3&& m == 3) {\n cout << \"\";\n }\n\n if (n < N && m < M && S[n] == T[m]) {\n int bit = b;\n int c = 5;\n int p = 0;\n for (int k = 0; k < 3; k++) {\n if (bit % 4 <= 1) {\n p++;\n if (S[n - p] == S[n]) {\n c = min(c, k);\n }\n }\n bit /= 4;\n }\n p = 0;\n bit = b;\n for (int k = 0; k < 3; k++) {\n if (bit % 4 == 0 || bit % 4 == 2) {\n p++;\n if (T[m - p] == S[n]) {\n c = min(c, k);\n }\n\n }\n bit /= 4;\n }\n if (c >= K)\n if(chmin(DP[n + 1][m + 1][(b * 4) % 64], DP[n][m][b] + 1))C=1;\n }\n\n if (n < N) {\n if (m < M && S[n] == T[m])continue;\n int bit = b;\n int c = 5;\n int p = 0;\n for (int k = 0; k < 3; k++) {\n if (bit % 4 <= 1) {\n p++;\n if (S[n - p] == S[n]) {\n c = min(c, k);\n }\n }\n bit /= 4;\n }\n p = 0;\n bit = b;\n for (int k = 0; k < 3; k++) {\n if (bit % 4 == 0 || bit % 4 == 2) {\n p++;\n if (T[m - p] == S[n]) {\n c = min(c, k);\n }\n\n }\n bit /= 4;\n }\n if (c >= K)\n if(chmin(DP[n + 1][m][(b * 4 + 1) % 64], DP[n][m][b] + 1))C=1;\n }\n if (m < M) {\n if (n < N && S[n] == T[m])continue;\n int bit = b;\n int c = 5;\n int p = 0;\n for (int k = 0; k < 3; k++) {\n if (bit % 4 <= 1) {\n p++;\n if (S[n - p] == T[m]) {\n c = min(c, k);\n }\n }\n bit /= 4;\n }\n p = 0;\n bit = b;\n for (int k = 0; k < 3; k++) {\n if (bit % 4 == 0 || bit % 4 == 2) {\n p++;\n if (T[m - p] == T[m]) {\n c = min(c, k);\n }\n\n }\n bit /= 4;\n }\n if (c >= K)\n if(chmin(DP[n][m + 1][(b * 4 + 2) % 64], DP[n][m][b] + 1))C=1;\n }\n }\n if(C==0)break;\n }\n }\n }\n ll an = 1e18;\n for (int i = 0; i < 64; i++)chmin(an, DP[N][M][i]);\n cout << an << endl;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 138768,
"score_of_the_acc": -1.4167,
"final_rank": 6
}
] |
aoj_1017_cpp
|
Problem I:
Riffle Shuffle
There are a number of ways to shuffle a deck of cards. Riffle shuffle is one such example. The following is how to perform riffle shuffle.
There is a deck of
n
cards. First, we divide it into two decks; deck A which consists of the top half of it and deck B of the bottom half. Deck A will have one more card when
n
is odd.
Next,
c
cards are pulled from bottom of deck A and are stacked on deck C, which is empty initially. Then
c
cards are pulled from bottom of deck B and stacked on deck C, likewise. This operation is repeated until deck A and B become empty. When the number of cards of deck A(B) is less than
c
, all cards are pulled.
Finally we obtain shuffled deck C. See an example below:
- A single riffle operation where n = 9, c = 3
for given deck [0 1 2 3 4 5 6 7 8] (right is top)
- Step 0
deck A [4 5 6 7 8]
deck B [0 1 2 3]
deck C []
- Step 1
deck A [7 8]
deck B [0 1 2 3]
deck C [4 5 6]
- Step 2
deck A [7 8]
deck B [3]
deck C [4 5 6 0 1 2]
- Step 3
deck A []
deck B [3]
deck C [4 5 6 0 1 2 7 8]
- Step 4
deck A []
deck B []
deck C [4 5 6 0 1 2 7 8 3]
shuffled deck [4 5 6 0 1 2 7 8 3]
This operation, called riffle operation, is repeated several times.
Write a program that simulates Riffle shuffle and answer which card will be finally placed on the top of the deck.
Input
The input consists of multiple data sets. Each data set starts with a line containing two positive integers
n
(1 ≤
n
≤ 50) and
r
(1 ≤
r
≤ 50);
n
and
r
are the number of cards in the deck and the number of riffle operations, respectively.
r
more positive integers follow, each of which represents a riffle operation. These riffle operations are performed in the listed order. Each integer represents
c
, which is explained above.
The end of the input is indicated by EOF. The number of data sets is less than 100.
Output
For each data set in the input, your program should print the number of the top card after the shuffle. Assume that at the beginning the cards are numbered from 0 to
n
-1, from the bottom to the top. Each number should be written in a sparate line without any superfluous characters such as leading or following spaces.
Sample Input
9 1
3
9 4
1 2 3 4
Output for the Sample Input
3
0
|
[
{
"submission_id": "aoj_1017_1912894",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\nqueue<int>Q[3]; int p, q;\nvoid solve(int a) {\n\tfor (int i = 0; i < 1000; i++) {\n\t\tif (Q[i % 2].size() < a) {\n\t\t\twhile (!Q[i % 2].empty()) { Q[2].push(Q[i % 2].front()); Q[i % 2].pop(); }\n\t\t}\n\t\telse {\n\t\t\tfor (int j = 0; j < a;j++){ Q[2].push(Q[i % 2].front()); Q[i % 2].pop(); }\n\t\t}\n\t}\n}\nint main() {\n\twhile (cin >> p >> q) {\n\t\tfor (int i = 0; i < p / 2; i++)Q[1].push(i);\n\t\tfor (int i = p / 2; i < p; i++)Q[0].push(i);\n\t\tfor (int i = 0; i < q; i++) {\n\t\t\tif (i >= 1) {\n\t\t\t\tint V = Q[2].size();\n\t\t\t\tfor (int j = 0; j < V / 2; j++) { Q[1].push(Q[2].front()); Q[2].pop(); }\n\t\t\t\tfor (int j = V / 2; j < V; j++) { Q[0].push(Q[2].front()); Q[2].pop(); }\n\t\t\t}\n\t\t\tint a; cin >> a; solve(a);\n\t\t}\n\t\twhile (Q[2].size() >= 2)Q[2].pop();\n\t\tcout << Q[2].front() << endl; Q[2].pop();\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1216,
"score_of_the_acc": -1,
"final_rank": 2
},
{
"submission_id": "aoj_1017_285644",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nvector<int> inc(vector<int> a,int x,int y){\n\tvector<int> ans;\n\tfor(int i = x ; i <= y ; i++){\n\t\tans.push_back(a[i]);\n\t}\n\treturn ans;\n}\nint main(){\n\tint n,c,p;\n\twhile(cin >> n >> p){\n\t\tvector<int> v(n);\n\t\tfor(int i = 0 ; i< n ; i++) v[i] = i;\n\t\tfor(int q = 0 ; q < p ; q++){\n\t\t\tint c; cin >> c;\n\t\t\tvector<int> A = inc(v,v.size()/2,v.size()-1);\n\t\t\tvector<int> B = inc(v,0,v.size()/2-1);\n\t\t\tvector<int> C;\n\t\t\tint f = 0;\n\t\t\twhile(A.size() || B.size()){\n\t\t\t\tif(!f){\n\t\t\t\t\tvector<int> A_ = inc(A,0,min(c-1,(int)A.size()-1));\n\t\t\t\t\tC.insert(C.end(),A_.begin(),A_.end());\n\t\t\t\t\tA = inc(A,min(c,(int)A.size()),(int)A.size()-1);\n\t\t\t\t}else{\n\t\t\t\t\tvector<int> B_ = inc(B,0,min(c-1,(int)B.size()-1));\n\t\t\t\t\tC.insert(C.end(),B_.begin(),B_.end());\n\t\t\t\t\tB = inc(B,min(c,(int)B.size()),(int)B.size()-1);\n\t\t\t\t}\n\t\t\t\tf ^= 1;\n\t\t\t}\n\t\t\tv = C;\n\t\t}\n\t\tcout << v.back() << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 0,
"score_of_the_acc": -1,
"final_rank": 2
},
{
"submission_id": "aoj_1017_108814",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\nint main()\n{\n while(true){\n int n,r;\n cin >> n >> r;\n if(cin.eof())break;\n vector<int> deck;\n for(int i = 0; i < n; ++i){\n deck.push_back( i );\n }\n for(int i = 0; i < r; ++i){\n int c;\n cin >> c;\n vector<int> deckA;\n vector<int> deckB;\n vector<int> deckC;\n \n for(int j = 0; j < n/2; ++j){\n\tdeckB.push_back( deck[j] );\n }\n for(int j = n/2; j < n; ++j){\n\tdeckA.push_back( deck[j] );\n }\n \n while(true){\n\tif( deckA.size() == 0 && deckB.size() == 0 ) break;\n\tvector<int>::iterator ite;\n\tite = (deckA.size() < c ? deckA.end() : deckA.begin() + c);\n\tdeckC.insert( deckC.end(), deckA.begin(), ite );\n\tdeckA.erase( deckA.begin(), ite );\n\n\t/*\n\tfor(int j = 0; j < deckC.size(); ++j){\n\t cout << deckC[j] << ' ';\n\t}\n\tcout << endl;\n\t*/\n\n\tite = (deckB.size() < c ? deckB.end() : deckB.begin() + c);\n\tdeckC.insert( deckC.end(), deckB.begin(), ite );\n\tdeckB.erase( deckB.begin(), ite );\n\t/*\n\tfor(int j = 0; j < deckC.size(); ++j){\n\t cout << deckC[j] << ' ';\n\t}\n\tcout << endl;\n\t*/\n }\n \n deck = deckC;\n }\n cout << deck.back() << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_1010_cpp
|
Problem B:
Dominoes Arrangement
[0, 0]
[0, 1] [1, 1]
[0, 2] [1, 2] [2, 2]
[0, 3] [1, 3] [2, 3] [3, 3]
[0, 4] [1, 4] [2, 4] [3, 4] [4, 4]
[0, 5] [1, 5] [2, 5] [3, 5] [4, 5] [5, 5]
[0, 6] [1, 6] [2, 6] [3, 6] [4, 6] [5, 6] [6, 6]
Consider the standard set of 28 western dominoes as shown in the above figure. Given a subset of the standard set dominoes, decide whether this subset can be arranged in a straight row in accordance with the familiar playing rule that touching ends must match. For example, the subset [1, 1], [2, 2], [1, 2] can be arranged in a row (as [1, 1] followed by [1, 2] followed by [2, 2]), while the subset [1, 1], [0, 3], [1, 4] can not be arranged in one row. Note that as in usual dominoes playing any pair [i, j] can also be treated as [j, i].
Your task is to write a program that takes as input any subset of the dominoes and output either yes (if the input subset can be arranged in one row) or no (if the input set can not be arranged in one row).
Input
Input file consists of pairs of lines. The first line of each pair is the number of elements N (1 ≤ N ≤ 18) in the subset, and the second line is the elements of the subset separated by blanks, see the input sample below.
The number of pairs (datasets) is less than 30.
Output
For each pair of lines of the input file, the corresponding output is either Yes or No, based on whether the input subset can be arranged in one line or not.
Sample Input
6
13 23 14 24 15 25
10
00 01 11 02 12 22 03 13 23 33
Output for the Sample Input
Yes
No
|
[
{
"submission_id": "aoj_1010_9453300",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef vector<vvi> vvvi;\ntypedef vector<bool> vb;\ntypedef vector<vb> vvb;\ntypedef vector<vvb> vvvb;\ntypedef vector<vvvb> vvvvb;\ntypedef pair<ll,ll> pi;\ntypedef pair<ll,pi> ppi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)\n#define RREP(i,n) RFOR(i,0,n)\n#define sz(A) (ll)(A.size())\n#define ALL(A) A.begin(),A.end()\n#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())\n#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())\n#define COU(A,x) (UB(A,x)-LB(A,x))\n#define F first\n#define S second\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<\" \"<<p.S;return os;}\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\ntemplate<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}\ntemplate<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}\nconst ll mod=998244353;\ntemplate<const long long int mod=998244353>\nstruct modint{\n using mint=modint<mod>;\n long long int x;\n modint(long long int _x=0):x(_x%mod){if(x<0)x+=mod;}\n long long int val(){return x;}\n mint&operator=(const mint&a){x=a.x;return *this;}\n mint&operator+=(const mint&a){x+=a.x;if(x>=mod)x-=mod;return *this;}\n mint&operator-=(const mint&a){x-=a.x;if(x<0)x+=mod;return *this;}\n mint&operator*=(const mint&a){x*=a.x;x%=mod;return *this;}\n friend mint operator+(const mint&a,const mint&b){return mint(a)+=b;}\n friend mint operator-(const mint&a,const mint&b){return mint(a)-=b;}\n friend mint operator*(const mint&a,const mint&b){return mint(a)*=b;}\n mint operator-()const{return mint(0)-*this;}\n mint pow(long long int n){\n if(!n)return 1;\n mint a=1;\n mint _x=x;\n while(n){\n if(n&1)a*=_x;\n _x=_x*_x;n>>=1;\n }\n return a;\n }\n mint inv(){return pow(mod-2);}\n mint&operator/=(mint&a){return *this*=a.inv();}\n friend mint operator/(const mint&a,mint b){return mint(a)/=b;}\n};\nusing mint=modint<998244353>;\nint main(){\n vvb DP(1<<18,vb(36));\n while(1){\n ll N=0;cin>>N;\n if(!N)return 0;\n vi A(N);cin>>A;\n REP(i,1<<N)REP(j,2*N)DP[i][j]=0;\n REP(i,N)DP[1<<i][2*i]=DP[1<<i][2*i+1]=1;\n FOR(i,1,1<<N)REP(j,2*N)if(DP[i][j]){\n if(j%2==0){\n REP(k,N)if((i>>k)%2==0){\n ll b=A[j/2]%10,c=A[k]/10,d=A[k]%10;\n if(b==c)DP[i+(1<<k)][2*k]=1;\n if(b==d)DP[i+(1<<k)][2*k+1]=1;\n }\n }\n else{\n REP(k,N)if((i>>k)%2==0){\n ll b=A[j/2]/10,c=A[k]/10,d=A[k]%10;\n if(b==c)DP[i+(1<<k)][2*k]=1;\n if(b==d)DP[i+(1<<k)][2*k+1]=1;\n }\n }\n }\n bool ans=0;\n REP(i,2*N)if(DP[(1<<N)-1][i])ans=1;\n cout<<(ans?\"Yes\":\"No\")<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 340,
"memory_kb": 21340,
"score_of_the_acc": -0.7552,
"final_rank": 17
},
{
"submission_id": "aoj_1010_7393020",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n\nbool solve(int n){\n vector<array<char,2>> v(n);\n for (int i = 0; i < n; ++i) {\n cin >> v[i][0] >> v[i][1];\n }\n vector<vector<bool>> dp(2*n,vector<bool>(1<<n));\n queue<pair<int,int>> q;\n for (int i = 0; i < n; ++i) {\n dp[2*i][1<<i] = true;\n dp[2*i+1][1<<i] = true;\n q.push({2*i,1<<i});\n q.push({2*i+1,1<<i});\n }\n while (q.size()){\n auto p = q.front(); q.pop();\n int b = p.first/2, c = p.first%2;\n auto last = v[b][1-c];\n for (int i = 0; i < n; ++i) {\n if((1<<i)&p.second) continue;\n int e = p.second+(1<<i);\n if(last == v[i][0]){\n int d = 2*i;\n if(!dp[d][e]){\n dp[d][e] = true; q.push({d,e});\n }\n }\n if(last == v[i][1]){\n int d = 2*i+1;\n if(!dp[d][e]){\n dp[d][e] = true; q.push({d,e});\n }\n }\n }\n }\n for (int i = 0; i < 2*n; ++i) {\n if(dp[i].back()) return true;\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 if(solve(n)) cout << \"Yes\" << \"\\n\";\n else cout << \"No\" << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 5036,
"score_of_the_acc": -0.2601,
"final_rank": 9
},
{
"submission_id": "aoj_1010_6804837",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing PI = vector<pair<int, int>>;\n\nbool dfs(VVI& grid, PI& dominos, int n, int r) {\n if (dominos.size() == n) {\n return true;\n } else {\n for (int i = 0; i < 7; ++i) {\n if (grid[r][i] == 1) {\n grid[r][i] = grid[i][r] = 0;\n dominos.emplace_back(r, i);\n if (dfs(grid, dominos, n, i)) {\n return true;\n }\n grid[r][i] = grid[i][r] = 1;\n dominos.pop_back();\n }\n }\n return false;\n }\n}\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int n;\n while (cin >> n) {\n vector<string> v(n);\n for (int i = 0; i < n; ++i) cin >> v[i];\n VVI grid(7, VI(7, 0));\n PI dominos;\n for (int i = 0; i < n; ++i) {\n int x = v[i][0] - '0';\n int y = v[i][1] - '0';\n grid[x][y] = grid[y][x] = 1;\n }\n bool flg = false;\n for (int i = 0; i < 7; ++i) {\n if (dfs(grid, dominos, n, i)) {\n cout << \"Yes\" << endl;\n flg = true;\n break;\n }\n }\n if (!flg) cout << \"No\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 3452,
"score_of_the_acc": -0.3092,
"final_rank": 11
},
{
"submission_id": "aoj_1010_6557783",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nstruct Card {int l, r;};\nconst int MAX_N = 30;\nint V; bool used[MAX_N]; vector<Card> cards;\n\nint dfs(int v, int num, bool l) {\n used[v] = true;\n auto &card = cards[v];\n int x = l ? card.l : card.r;\n if (++num==V) return true;\n rep(u, cards.size()) {\n auto &card_next = cards[u];\n if (!used[u] && (card_next.l == x || card_next.r == x)) {\n if (dfs(u, num, card_next.l != x)) return true;\n }\n }\n used[v] = false;\n return false;\n}\n\nint main()\n{\n while (cin >> V) {\n cards.clear();\n rep(i, V) {\n string c; cin >> c;\n cards.push_back({c[0]-'0', c[1]-'0'});\n }\n bool ans = false;\n rep(u, V) {\n fill(used, used+MAX_N, false);\n ans |= dfs(u, 0, true);\n }\n printf(\"%s\\n\", ans ? \"Yes\" : \"No\");\n }\n}",
"accuracy": 1,
"time_ms": 900,
"memory_kb": 3208,
"score_of_the_acc": -1.0462,
"final_rank": 19
},
{
"submission_id": "aoj_1010_5916645",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int N;\n while(cin >> N){\n vector<char> l(N), r(N);\n for(int i = 0; i < N; i++) {\n cin >> l[i] >> r[i];\n }\n vector<vector<bool>> dp(10, vector<bool>(1 << N, false));\n for(int i = 0; i < N; i++){\n dp[r[i] - '0'][1 << i] = true;\n dp[l[i] - '0'][1 << i] = true;\n }\n for(int bit = 0; bit < (1 << N); bit++){\n for(int i = 0; i < 10; i++){\n if(!dp[i][bit]) continue;\n for(int j = 0; j < N; j++){\n if(bit & (1 << j)) continue;\n if(i == l[j] - '0'){\n dp[r[j] - '0'][bit ^ (1 << j)] = true;\n }\n if(i == r[j] - '0'){\n dp[l[j] - '0'][bit ^ (1 << j)] = true;\n }\n }\n }\n }\n bool f = false;\n for(int i = 0; i < 10; i++) {\n if(dp[i][(1 << N) - 1]) f = true;\n }\n if(f) cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3240,
"score_of_the_acc": -0.1254,
"final_rank": 5
},
{
"submission_id": "aoj_1010_5891148",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <utility>\n#include <set>\n#include <algorithm>\n\nbool bruteForceSearch(std::vector< std::pair<int, int> > &dominos, std::vector< std::pair<int, int> > &ans);\n\nint main() {\n\tint n;\n\n\twhile (std::cin >> n) {\n\t\t// receive inputs\n\t\tstd::vector< std::pair<int, int> > dominos(n);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint temp;\n\t\t\tstd::cin >> temp;\n\t\t\tdominos[i].first = temp / 10;\n\t\t\tdominos[i].second = temp % 10;\n\t\t}\n\n\t\t// brute force search\n\t\tstd::vector< std::pair<int, int> > ans;\n\t\tif (bruteForceSearch(dominos, ans)) {\n\t\t\tstd::cout << \"Yes\";\n\t\t} else {\n\t\t\tstd::cout << \"No\";\n\t\t}\n\t\tstd::cout << std::endl;\n\t}\n\n\treturn 0;\n}\n\nstd::set< std::vector< std::pair<int, int> > > set;\n\nbool bruteForceSearch(std::vector< std::pair<int, int> > &dominos, std::vector< std::pair<int, int> > &ans) {\n\t// when you set entire dominos\n\tif (dominos.size() == 0) {\n\t\tfor (int i = 0; i < ans.size() - 1; i++) {\n\t\t\tif (ans[i].second != ans[i+1].first) return false;\n\t\t}\n\t\treturn true;\n\t}\n\n\t// search\n\t// first time\n\tif (ans.size() == 0) {\n\t\tfor (int i = 0; i < dominos.size(); i++) {\n\t\t\t// get target domino and remove\n\t\t\tstd::pair<int, int> target = dominos[i];\n\t\t\tdominos.erase(dominos.begin() + i);\n\n\t\t\t// normal order\n\t\t\tstd::vector< std::pair<int, int> > ans1(ans);\n\t\t\tans1.push_back(target);\n\t\t\tif (bruteForceSearch(dominos, ans1)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t\n\t\t\t// reverse order\n\t\t\tstd::vector< std::pair<int, int> > ans2(ans);\n\t\t\tstd::swap(target.first, target.second);\n\t\t\tans2.push_back(target);\n\t\t\tif (bruteForceSearch(dominos, ans2)) {\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\t// revert removed domino\n\t\t\tdominos.insert(dominos.begin() + i, target);\n\t\t}\n\n\t\treturn false;\n\t// not first time\n\t} else {\n\t\tint last = (*(ans.end() - 1)).second;\n\n\t\tfor (int i = 0; i < dominos.size(); i++) {\n\t\t\tif (dominos[i].first == last) {\n\t\t\t\t// get target domino and remove\n\t\t\t\tstd::pair<int, int> target = dominos[i];\n\t\t\t\tdominos.erase(dominos.begin() + i);\n\n\t\t\t\t// normal order\n\t\t\t\tstd::vector< std::pair<int, int> > ans1(ans);\n\t\t\t\tans1.push_back(target);\n\t\t\t\tif (bruteForceSearch(dominos, ans1)) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\n\t\t\t\t// revert removed domino\n\t\t\t\tdominos.insert(dominos.begin() + i, target);\n\t\t\t} else if (dominos[i].second == last) {\n\t\t\t\t// get target domino and remove\n\t\t\t\tstd::pair<int, int> target = dominos[i];\n\t\t\t\tdominos.erase(dominos.begin() + i);\n\n\t\t\t\t// reverse order\n\t\t\t\tstd::vector< std::pair<int, int> > ans2(ans);\n\t\t\t\tstd::swap(target.first, target.second);\n\t\t\t\tans2.push_back(target);\n\t\t\t\tif (bruteForceSearch(dominos, ans2)) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\n\t\t\t\t// revert removed domino\n\t\t\t\tdominos.insert(dominos.begin() + i, target);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn false;\n}",
"accuracy": 1,
"time_ms": 650,
"memory_kb": 3040,
"score_of_the_acc": -0.7622,
"final_rank": 18
},
{
"submission_id": "aoj_1010_3868595",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <array>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <tuple>\n#include <bitset>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\n\nbool search(const int state, const int last, const std::vector<std::string> &dominos, std::vector<std::vector<char>>& memo) {\n\tif (state == memo[last].size() - 1) return true;\n\tif (memo[last][state] >= 0) return memo[last][state] == 1;\n\tmemo[last][state] = 0;\n\tfor (auto i = 0; i < dominos.size(); ++i) if ((state & (1 << i)) == 0) {\n\t\tif (dominos[i].front() - '0' == last) {\n\t\t\tauto res = search(state | (1 << i), dominos[i].back() - '0', dominos, memo);\n\t\t\tif (res) {\n\t\t\t\tmemo[last][state] = 1;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tif (dominos[i].back() - '0' == last) {\n\t\t\tauto res = search(state | (1 << i), dominos[i].front() - '0', dominos, memo);\n\t\t\tif (res) {\n\t\t\t\tmemo[last][state] = 1;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nint main() {\n\tint n;\n\twhile (std::cin >> n) {\n\t\tstd::vector<std::string> dominos(n); for (auto& domino : dominos) std::cin >> domino;\n\t\tstd::vector<std::vector<char>> can_make(10, std::vector<char>(1 << n, -1));\n\t\tauto can = false;\n\t\tfor (auto i = 0; i < n; ++i) {\n\t\t\tif (search(1 << i, dominos[i].back() - '0', dominos, can_make)) {\n\t\t\t\tstd::cout << \"Yes\\n\";\n\t\t\t\tcan = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (search(1 << i, dominos[i].front() - '0', dominos, can_make)) {\n\t\t\t\tstd::cout << \"Yes\\n\";\n\t\t\t\tcan = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (!can) std::cout << \"No\\n\";\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 5692,
"score_of_the_acc": -0.115,
"final_rank": 3
},
{
"submission_id": "aoj_1010_3213748",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cstring>\nusing namespace std;\n\nint main(){\n int n;\n while(cin >> n){\n vector<string> a(n);\n for(int i=0; i<n; i++){\n cin >> a[i];\n }\n bool dp[1<<18][7];\n memset(dp, 0, sizeof(dp));\n for(int i=0; i<7; i++){\n dp[0][i] = true;\n }\n\n for(int i=0; i<(1<<n); i++){\n for(int j=0; j<7; j++){\n if(!dp[i][j]) continue;\n for(int k=0; k<n; k++){\n if((i & 1<<k) != 0) continue;\n if(j == a[k][0]-'0'){\n dp[i | 1<<k][a[k][1]-'0'] = true;\n }\n if(j == a[k][1]-'0'){\n dp[i | 1<<k][a[k][0]-'0'] = true;\n }\n }\n }\n }\n bool ok = false;\n for(int i=0; i<7; i++){\n if(dp[(1<<n)-1][i]){\n ok = true;\n }\n }\n\n if(ok){\n cout << \"Yes\" << endl;\n }else{\n cout << \"No\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 4764,
"score_of_the_acc": -0.1651,
"final_rank": 6
},
{
"submission_id": "aoj_1010_3213550",
"code_snippet": "#include <vector>\n#include <iostream>\n#include <utility>\n#include <bitset>\nusing namespace std;\n\nint dp[1 << 18][10];\nint main() {\n int N;\n while(cin >> N) {\n vector< pair<int, int> > dominoes(N);\n for(int i=0; i<N; i++) {\n int val; cin >> val;\n int A = val / 10, B = val % 10;\n dominoes[i] = make_pair(A, B);\n }\n\n fill(dp[0], dp[1 << N], false);\n dp[0][0] = true;\n for(int bit=0; bit<(1<<N); bit++) {\n for(int pre=0; pre<10; pre++) {\n if(dp[bit][pre] == false) continue;\n for(int i=0; i<N; i++) {\n if(bit >> i & 1) continue;\n\n for(int k=0; k<2; k++) {\n if(bit != 0 and pre != dominoes[i].first) {\n swap(dominoes[i].first, dominoes[i].second);\n continue;\n }\n\n int nbit = bit | (1 << i);\n int npre = dominoes[i].second;\n dp[nbit][npre] |= dp[bit][pre];\n swap(dominoes[i].first, dominoes[i].second);\n }\n }\n }\n }\n\n /*\n for(int bit=0; bit<(1<<N); bit++) {\n bool ok = false;\n for(int pre=0; pre<10; pre++) {\n ok |= dp[bit][pre];\n }\n if(ok) {\n cout << bitset<10>(bit).to_string();\n cout << \":\";\n for(int pre=0; pre<10; pre++) {\n if(dp[bit][pre]) cout << \" \" << pre;\n }\n cout << endl;\n }\n }\n */\n\n bool ans = false;\n for(int i=0; i<10; i++) ans |= dp[(1<<N)-1][i];\n cout << (ans ? \"Yes\" : \"No\") << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 13256,
"score_of_the_acc": -0.3348,
"final_rank": 14
},
{
"submission_id": "aoj_1010_2926734",
"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 solve(bitset<18>bs, vector<vector<int>>&dp,const vector<pair<int,int>>&vs,const int now) {\n\tif(dp[now][bs.to_ulong()]!=-1)return dp[now][bs.to_ulong()];\n\n\tbool ok = false;\n\tif(bs.count()==vs.size())ok=true;\n\telse {\n\t\tfor (int i = 0; i < vs.size(); ++i) {\n\t\t\tif (bs[i]) {\n\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (vs[i].first == now || now == 7) {\n\t\t\t\t\tbs[i] = true;\n\t\t\t\t\tbool aok = solve(bs, dp, vs, vs[i].second);\n\t\t\t\t\tif (aok)ok = true;\n\t\t\t\t\tbs[i] = false;\n\t\t\t\t}\n\t\t\t\tif (vs[i].second == now || now == 7) {\n\t\t\t\t\tbs[i] = true;\n\t\t\t\t\tbool aok = solve(bs, dp, vs, vs[i].first);\n\t\t\t\t\tif(aok)ok=true;\n\t\t\t\t\tbs[i] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\n\t}\n\treturn dp[now][bs.to_ulong()]=ok;\n}\nint main()\n{\n\tint N;\n\twhile (cin >> N) {\n\t\tvector<pair<int,int>>vs;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tstring st;cin>>st;\n\t\t\tvs.push_back(make_pair(st[0]-'0',st[1]-'0'));\n\t\t}\n\n\t\tvector<vector<int>>dp(8,vector<int>(1<<N,-1));\n\n\t\tbitset<18>bs;\n\t\tint ok=solve(bs,dp,vs,7);\n\t\tif(ok)cout<<\"Yes\"<<endl;\n\t\telse cout<<\"No\"<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 12364,
"score_of_the_acc": -0.3294,
"final_rank": 12
},
{
"submission_id": "aoj_1010_2304015",
"code_snippet": "#include<bits/stdc++.h>\n#define N 18\nusing namespace std;\n\nbool dp[(1<<N)][N][2];\n\nint main(){\n \n int n;\n \n while(cin>>n){\n \n string num[N];\n\n for(int i=0;i<n;i++) cin>>num[i];\n \n memset(dp,0,sizeof(dp));\n\n for(int i=0;i<n;i++)\n for(int j=0;j<2;j++) dp[(1<<i)][i][j]=true;\n \n for(int i=0;i<(1<<n);i++)\n \n for(int j=0;j<n;j++)\n\t\n\tfor(int k=0;k<2;k++){\n\t \n\t if(!dp[i][j][k]) continue;\n\n\t for(int l=0;l<n;l++){\n\n\t if(i&(1<<l)) continue;\n\t \n\t for(int m=0;m<2;m++)\n\t \n\t if(num[j][k]==num[l][m]) dp[i|(1<<l)][l][!m]=true;\n\t \n\t }\n\t \n\t}\n\n bool ans=false;\n\n for(int i=0;i<n;i++)\n for(int j=0;j<2;j++) ans|=dp[(1<<n)-1][i][j];\n\n cout<<(ans?\"Yes\":\"No\")<<endl;\n \n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 380,
"memory_kb": 12340,
"score_of_the_acc": -0.6323,
"final_rank": 16
},
{
"submission_id": "aoj_1010_2303864",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nstring A[20];\n\nint n;\nbool used[1<<18][10][10],mem[1<<18][10][10];\nbool dfs(int bit,int l,int r){\n if(bit == (1<<n)-1) return 1;\n if(used[bit][l][r])return mem[bit][l][r];\n used[bit][l][r] = 1;\n \n bool res = 0;\n for(int i=0;i<n;i++){\n if(bit>>i&1) continue;\n int nbit = bit | (1<<i);\n \n if(l == A[i][0]-'0') res |= dfs(nbit,A[i][1]-'0',r);\n if(l == A[i][1]-'0') res |= dfs(nbit,A[i][0]-'0',r);\n if(r == A[i][0]-'0') res |= dfs(nbit,l,A[i][1]-'0');\n if(r == A[i][1]-'0') res |= dfs(nbit,l,A[i][0]-'0');\n if(res) break;\n }\n return mem[bit][l][r] = res; \n}\n\nsigned main(){\n\n while(cin>>n){\n for(int i=0;i<n;i++) cin>>A[i];\n memset(used,0,sizeof(used));\n memset(mem,0,sizeof(mem));\n bool ans = dfs(1,A[0][0]-'0',A[0][1]-'0');\n cout<<(ans? \"Yes\":\"No\") <<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 54336,
"score_of_the_acc": -1.1461,
"final_rank": 20
},
{
"submission_id": "aoj_1010_1686364",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n\n#define rep(i, n) for(int i = 0; i < (n); ++i)\n\nusing namespace std;\n\nint n;\nbool g[7][7];\nint t;\n\nbool dfs(int i){\n\trep(j, 7){\n\t\tif(!g[i][j]){\n\t\t\tg[i][j] = g[j][i] = true;\n\t\t\t++t;\n\t\t\tbool r = dfs(j);\n\t\t\tg[i][j] = g[j][i] = false;\n\t\t\t--t;\n\t\t\tif(r){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn t == n;\n}\n\nint main(){\n\twhile(cin >> n){\n\t\trep(i, 7){\n\t\t\tfill(g[i], g[i] + 7, true);\n\t\t}\n\n\t\trep(i, n){\n\t\t\tint p;\n\t\t\tcin >> p;\n\t\t\tint a = p / 10;\n\t\t\tint b = p % 10;\n\t\t\tg[a][b] = g[b][a] = false;\n\t\t}\n\n\t\tbool a = false;\n\t\trep(i, 7){\n\t\t\tif(dfs(i)){\n\t\t\t\ta = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tcout << (a ? \"Yes\" : \"No\") << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 1152,
"score_of_the_acc": -0.2101,
"final_rank": 8
},
{
"submission_id": "aoj_1010_1647080",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <vector>\nusing namespace std;\n\nstruct Domino\n{\n int id;\n int op;\n Domino(int _id, int _op) { id = _id; op = _op; }\n};\n\nvector<pair<int,int> > Dominos;\nvector<Domino> graph[7];\nbool visited[28];\nint n;\n\nbool dfs(int num, int d)\n{\n if (d == n) { return true; }\n if (d > n) return false;\n if (graph[num].empty()) { return false; }\n for (int i=0;i<graph[num].size();i++)\n {\n int nextid = graph[num][i].id;\n int nextop = graph[num][i].op;\n if (!visited[nextid])\n {\n visited[nextid] = true;\n bool res = dfs(nextop, d+1);\n if (res) { return true; }\n else { visited[nextid] = false; }\n }\n }\n return false;\n}\n\n\nint main()\n{\n while (cin >> n)\n {\n for (int i=0;i<7;i++) graph[i].clear();\n Dominos.clear();\n bool found = false;\n\n for (int i=0;i<n;i++)\n {\n int m, x, y;\n cin >> m;\n x = m / 10; y = m % 10;\n Dominos.push_back(make_pair(x, y));\n\n Domino dx(i, y), dy(i, x);\n if (x == y) graph[x].push_back(dx);\n else\n {\n graph[x].push_back(dx);\n graph[y].push_back(dy);\n }\n }\n\n for (int id=0;id<n;id++)\n {\n for (int i=0;i<n;i++) visited[i] = false;\n int x = Dominos[id].first;\n int y = Dominos[id].second;\n visited[id] = true;\n if (dfs(x, 1)) { found = true; break; }\n if (x != y) if (dfs(y, 1)) { found = true; break; }\n }\n if (found) cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 1192,
"score_of_the_acc": -0.1209,
"final_rank": 4
},
{
"submission_id": "aoj_1010_1573531",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdio>\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 \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\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 \nclass Domino {\nprivate:\n int _head;\n int _tail;\npublic:\n Domino(int head, int tail) {\n _head = head;\n _tail = tail;\n }\n \n int detect_connect_pattern(Domino d) {\n int res = 0;\n if(d.get_head() == _head){\n return (res | (1<<0));\n }\n if(d.get_head() == _tail){\n return (res | (1<<1));\n }\n if(d.get_tail() == _head){\n return (res | (1<<2));\n }\n if(d.get_tail() == _tail){\n return (res | (1<<3));\n }\n return res;\n }\n \n Domino connect(Domino d,int pattern){\n if(pattern == (1<<0)){\n return Domino(d.get_tail(),_tail);\n }\n if(pattern == (1<<1)){\n return Domino(d.get_tail(),_head);\n }\n if(pattern == (1<<2)){\n return Domino(d.get_head(),_tail);\n }\n if(pattern == (1<<3)){\n return Domino(d.get_head(),_head);\n }\n return *this;\n }\n \n int get_head() const{\n return _head;\n }\n \n int get_tail() const{\n return _tail;\n }\n};\n \nbool dp[1<<22];\n \nbool dfs(Domino& current_state,int visited, const vector<Domino>& dominos){\n if(dp[visited]) return false;\n if(visited == (1<<dominos.size()) - 1){\n return true;\n }\n \n int res = false;\n for(int i = 0; i < dominos.size(); i++){\n \n if(visited & (1<<i)) continue;\n int pattern;\n if((pattern = current_state.detect_connect_pattern(dominos[i])) == 0) continue;\n Domino next = current_state.connect(dominos[i],pattern);\n res |= dfs(next,visited | (1<<i),dominos);\n dp[visited | (1<<i)] = true;\n }\n return res;\n}\n \nint main(){\n int n;\n while(~scanf(\"%d\",&n)){\n vector<Domino> dominos;\n memset(dp,false,sizeof(dp));\n \n int same_head_tail = 0;\n for(int i = 0; i < n; i++){\n char domino[8];\n scanf(\"%s\",domino);\n if(domino[0] - '0' == domino[1] - '0'){\n same_head_tail |= (1 << (domino[1] - '0'));\n continue;\n }\n dominos.push_back(Domino(domino[0] - '0',domino[1] - '0'));\n }\n \n bool same_check = true;\n for(int num = 0; num <= 6; num++){\n if(same_head_tail & (1 << num)){\n bool isok = false;\n for(int i = 0; i < dominos.size(); i++){\n if(dominos[i].get_tail() == num\n || dominos[i].get_head() == num){\n isok = true;\n }\n }\n if(!isok){\n same_check = false;\n break;\n }\n }\n }\n \n bool travel_check = false;\n travel_check = dfs(dominos[0],(1<<0),dominos);\n printf(\"%s\\n\",((same_check && travel_check) || (n == 1)) ? \"Yes\" : \"No\");\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5272,
"score_of_the_acc": -0.0847,
"final_rank": 1
},
{
"submission_id": "aoj_1010_1502903",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdio>\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 \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\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\nclass Domino {\nprivate:\n int _head;\n int _tail;\npublic:\n Domino(int head, int tail) {\n _head = head;\n _tail = tail;\n }\n\n int detect_connect_pattern(Domino d) {\n int res = 0;\n if(d.get_head() == _head){\n return (res | (1<<0));\n }\n if(d.get_head() == _tail){\n return (res | (1<<1));\n }\n if(d.get_tail() == _head){\n return (res | (1<<2));\n }\n if(d.get_tail() == _tail){\n return (res | (1<<3));\n }\n return res;\n }\n\n Domino connect(Domino d,int pattern){\n if(pattern == (1<<0)){\n return Domino(d.get_tail(),_tail);\n }\n if(pattern == (1<<1)){\n return Domino(d.get_tail(),_head);\n }\n if(pattern == (1<<2)){\n return Domino(d.get_head(),_tail);\n }\n if(pattern == (1<<3)){\n return Domino(d.get_head(),_head);\n }\n return *this;\n }\n\n int get_head() const{\n return _head;\n }\n\n int get_tail() const{\n return _tail;\n }\n};\n\nbool dp[1<<22];\n\nbool dfs(Domino& current_state,int visited, const vector<Domino>& dominos){\n if(dp[visited]) return false;\n if(visited == (1<<dominos.size()) - 1){\n return true;\n }\n\n int res = false;\n for(int i = 0; i < dominos.size(); i++){\n\n if(visited & (1<<i)) continue;\n int pattern;\n if((pattern = current_state.detect_connect_pattern(dominos[i])) == 0) continue;\n Domino next = current_state.connect(dominos[i],pattern);\n res |= dfs(next,visited | (1<<i),dominos);\n dp[visited | (1<<i)] = true;\n }\n return res;\n}\n\nint main(){\n int n;\n while(~scanf(\"%d\",&n)){\n vector<Domino> dominos;\n memset(dp,false,sizeof(dp));\n\n int same_head_tail = 0;\n for(int i = 0; i < n; i++){\n char domino[8];\n scanf(\"%s\",domino);\n if(domino[0] - '0' == domino[1] - '0'){\n same_head_tail |= (1 << (domino[1] - '0'));\n continue;\n }\n dominos.push_back(Domino(domino[0] - '0',domino[1] - '0'));\n }\n\n bool same_check = true;\n for(int num = 0; num <= 6; num++){\n if(same_head_tail & (1 << num)){\n bool isok = false;\n for(int i = 0; i < dominos.size(); i++){\n if(dominos[i].get_tail() == num\n || dominos[i].get_head() == num){\n isok = true;\n }\n }\n if(!isok){\n same_check = false;\n break;\n }\n }\n }\n\n bool travel_check = false;\n travel_check = dfs(dominos[0],(1<<0),dominos);\n printf(\"%s\\n\",((same_check && travel_check) || (n == 1)) ? \"Yes\" : \"No\");\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5272,
"score_of_the_acc": -0.0847,
"final_rank": 1
},
{
"submission_id": "aoj_1010_663816",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cstdio>\n#include<bitset>\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;\ntypedef pair<int,int> P;\nint n;\nint memo[(1<<25)][10];\n\nbool rec(P *G,int used,int prev)\n{\n if(__builtin_popcount(used) == n)return true;\n if(__builtin_popcount(used) >= n)return false;\n if(memo[used][prev] != -1)return memo[used][prev];\n\n rep(i,n)\n {\n if((used>>i)&1)continue;\n if(prev == G[i].first)if(rec(G,used|(1<<i),G[i].second))\n\t\t\t {\n\t\t\t\tmemo[used|(1<<i)][G[i].second] = true;\n\t\t\t\treturn true;\n\t\t\t }\n if(prev == G[i].second)if(rec(G,used|(1<<i),G[i].first))\n\t\t\t {\n\t\t\t\t memo[used|(1<<i)][G[i].first] = true;\n\t\t\t\t return true;\n\t\t\t }\n }\n memo[used][prev] = false;\n return false;\n}\n\nint main()\n{\n while(cin >> n)\n {\n cin.ignore();\n rep(i,(1<<n))rep(j,10)memo[i][j] = -1;\n P G[n];\n rep(i,n)\n\t{\n\t char a,b,c;\n\t scanf(\"%c%c%c\",&a,&b,&c);\n\t G[i].first = a-'0';\n\t G[i].second = b-'0';\n\t}\n\n rep(i,n)\n\t{\n\t if(rec(G,(1<<i),G[i].second) || rec(G,(1<<i),G[i].first))\n\t {\n\t cout << \"Yes\" << endl;\n\t goto F;\n\t }\n\t}\n cout << \"No\" << endl;\n F:;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 13468,
"score_of_the_acc": -0.2938,
"final_rank": 10
},
{
"submission_id": "aoj_1010_482097",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <utility>\n#include <algorithm>\n\nusing namespace std;\ntypedef pair<int, int> pii;\n\nint main(){\n ios_base::sync_with_stdio(false);\n int N;\n while(cin >> N){\n vector<pii> p(N);\n bool found[10] = { false };\n for(int i = 0; i < N; ++i){\n int x;\n cin >> x;\n p[i] = pii(x / 10, x % 10);\n found[p[i].first] = found[p[i].second] = true;\n }\n bool answer = false;\n vector<int> dp(1 << N);\n for(int begin = 0; !answer && begin < 10; ++begin){\n if(!found[begin]){ continue; }\n fill(dp.begin(), dp.end(), 0);\n dp[0] |= (1 << begin);\n for(int i = 0; i < (1 << N); ++i){\n for(int j = 0; j < 10; ++j){\n if(!(dp[i] & (1 << j))){ continue; }\n for(int k = 0; k < N; ++k){\n if(i & (1 << k)){ continue; }\n int m = i | (1 << k);\n if(p[k].first == j){ dp[m] |= (1 << p[k].second); }\n if(p[k].second == j){ dp[m] |= (1 << p[k].first); }\n }\n }\n }\n if(dp[(1 << N) - 1]){ answer = true; }\n }\n cout << (answer ? \"Yes\" : \"No\") << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 2300,
"score_of_the_acc": -0.1978,
"final_rank": 7
},
{
"submission_id": "aoj_1010_475560",
"code_snippet": "//51\n#include<iostream>\n#include<set>\n\n#define T(a,b,c) (a*1000+b*10+c)\n\nusing namespace std;\n\nint p[28];\nint n;\nset<int> s;\n\nbool dfs(int pr,int u,int r){\n if(r==0){\n return true;\n }else if(s.count(T(u,r,pr))){\n return false;\n }else{\n for(int i=0;i<n;i++){\n if(!(u&1<<i)){\n\tfor(int j=0;j<2;j++){\n\t p[i]=p[i]/10+p[i]%10*10;\n\t if(pr==p[i]/10){\n\t if(dfs(p[i]%10,u|1<<i,r-1))return true;\n\t }\n\t}\n }\n }\n s.insert(T(u,r,pr));\n return false;\n }\n}\n\nint main(){\n while(cin>>n){\n s.clear();\n for(int i=0;i<n;i++){\n cin>>p[i];\n }\n for(int i=0;i<n;i++){\n if(dfs(p[i]%10,1<<i,n-1)||dfs(p[i]/10,1<<i,n-1)){\n\tcout<<\"Yes\"<<endl;\n\tgoto next;\n }\n }\n cout<<\"No\"<<endl;\n next:\n ;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 6452,
"score_of_the_acc": -0.3314,
"final_rank": 13
},
{
"submission_id": "aoj_1010_348021",
"code_snippet": "#include<stdio.h>\n#include<string.h>\n\nconst int max=7;\nint con[max][max];\nint n;\nbool allMoveOK;\n\nvoid saiki(int now,int deep){\nif(deep==n){\n\tallMoveOK=true;\n\treturn;\n}\nfor(int i=0;i<max;i++){\n\tif(con[now][i]>0){\n\t\tcon[now][i]--;\n\t\tcon[i][now]--;\n\t\tsaiki(i,deep+1);\n\t\tif(allMoveOK==true) return;\n\t\tcon[now][i]++;\n\t\tcon[i][now]++;\n\t}\n}\n}\nvoid setData(){\nchar in[3];\nmemset(con,0,sizeof(con));\nallMoveOK=false;\t\nfor(int i=0;i<n;i++){\n\tscanf(\"%s\",in);\n\tin[0]-='0';\n\tin[1]-='0';\n\tcon[in[0]][in[1]]++;\n\tcon[in[1]][in[0]]++;\n}\nfor(int i=0;i<max;i++){\n\tsaiki(i,0);\n\tif(allMoveOK==true)break;\n}\nprintf(\"%s\\n\",allMoveOK?\"Yes\":\"No\");\n}\nint main(){\nwhile(scanf(\"%d\",&n)!=EOF){\n\tsetData();\n}\n}",
"accuracy": 1,
"time_ms": 510,
"memory_kb": 732,
"score_of_the_acc": -0.5618,
"final_rank": 15
}
] |
aoj_1002_cpp
|
Extraordinary Girl (I)
She is an extraordinary girl. She works for a library. Since she is young
and cute, she is forced to do a lot of laborious jobs. The most annoying job
for her is to put returned books into shelves, carrying them by a cart. The
cart is large enough to carry many books, but too heavy for her. Since she
is delicate, she wants to walk as short as possible when doing this job.
The library has 4N shelves (1 <= N <= 10000), three main passages, and
N + 1 sub passages. Each shelf is numbered between 1 to 4N as shown in
Figure 1. Horizontal dashed lines correspond to main passages, while vertical
dashed lines correspond to sub passages. She starts to return books from the
position with white circle in the figure and ends at the position with black
circle. For simplicity, assume she can only stop at either the middle of shelves
or the intersection of passages. At the middle of shelves, she put books with
the same ID as the shelves. For example, when she stops at the middle of
shelf 2 and 3, she can put books with ID 2 and 3.
Since she is so lazy that she doesn’t want to memorize a complicated
route, she only walks main passages in forward direction (see an arrow in
Figure 1). The walk from an intersection to its adjacent intersections takes 1
cost. It means the walk from the middle of shelves to its adjacent intersection,
and vice versa, takes 0.5 cost. You, as only a programmer amoung her friends,
are to help her compute the minimum possible cost she takes to put all books
in the shelves.
Input
The first line of input contains the number of test cases, T . Then T test
cases follow. Each test case consists of two lines. The first line contains the
number N , and the second line contains 4N characters, either Y or N . Y in
n-th position means there are some books with ID n, and N means no book
with ID n.
Output
The output should consists of T lines, each of which contains one integer,
the minimum possible cost, for each test case.
Sample Input
2
2
YNNNNYYY
4
NYNNYYNNNYNYYNNN
Output for the Sample Input
6
9
|
[
{
"submission_id": "aoj_1002_1827294",
"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#include<sstream>\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\tint q;\n\tcin>>q;\n\twhile(q--){\n\t\tint n,N;\n\t\tcin>>n;\n\t\tN=n*2;\n\t\tstring s;cin>>s;\n\t\trep(i,s.size())s[i]=(s[i]=='Y'?1:0);\n\t\tstring t=s.substr(N);\n\t\ts=s.substr(0,N);\n\t\tvvi dp(n+1,vi(2,inf));\n\t\tif(t[0])dp[0][1]=2;\n\t\telse if(s[0]){\n\t\t\tdp[0][1]=1;\n\t\t\tdp[0][0]=1;\n\t\t}else dp[0][0]=0;\n\t\trep(i,n){\n\t\t\tint a,b;\n\t\t\tif(i!=n-1){\n\t\t\t\ta=s[i*2+2]||s[i*2+1];\n\t\t\t\tb=t[i*2+2]||t[i*2+1];\n\t\t\t}else{\n\t\t\t\ta=s[i*2+1];\n\t\t\t\tb=t[i*2+1];\n\t\t\t}\n\t\t\tif(dp[i][0]!=inf){\n\t\t\t\tif(b)dp[i+1][1]=min(dp[i+1][1],dp[i][0]+2);\n\t\t\t\telse if(a){\n\t\t\t\t\tdp[i+1][1]=min(dp[i+1][1],dp[i][0]+1);\n\t\t\t\t\tdp[i+1][0]=min(dp[i+1][0],dp[i][0]+1);\n\t\t\t\t}else dp[i+1][0]=min(dp[i+1][0],dp[i][0]);\n\t\t\t}\n\t\t\tif(dp[i][1]!=inf){\n\t\t\t\tif(a+b==2){\n\t\t\t\t\tdp[i+1][1]=min(dp[i+1][1],dp[i][1]+2);\n\t\t\t\t\tdp[i+1][0]=min(dp[i+1][0],dp[i][1]+2);\n\t\t\t\t}else if(a+b==0)dp[i+1][1]=min(dp[i+1][1],dp[i][1]);\n\t\t\t\telse if(a){\n\t\t\t\t\tdp[i+1][1]=min(dp[i+1][1],dp[i][1]+1);\n\t\t\t\t\tdp[i+1][0]=min(dp[i+1][0],dp[i][1]+1);\n\t\t\t\t}else if(b)dp[i+1][1]=min(dp[i+1][1],dp[i][1]+1);\n\t\t\t}\n\t\t}\n\t\tcout<<min(dp[n][0],dp[n][1]+1)+n<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1552,
"score_of_the_acc": -0.03,
"final_rank": 17
},
{
"submission_id": "aoj_1002_1636645",
"code_snippet": "#include <iostream>\nusing namespace std;\nint mp[2][20010],n;\n\nint solve(){\n int x=0,y=0,cost=0,f=1;\n while(x!=n+1) {\n if(f&&mp[0][x])f=0;\n if(f&&mp[1][x])f=0,cost++;\n\n if(mp[1][x])y=1,mp[1][x]=0;\n else if(mp[0][x])y=mp[0][x]=0;\n else x++;\n cost++;\n }\n if(y==1)cost++;\n return cost-1;\n}\n\nint main(){\n int q;\n cin>> q;\n while(q--){\n cin>>n;\n char a;\n for(int i=0;i<2;i++)\n for(int j=0;j<2*n;j++)cin>> a,mp[i][(j+1)/2] |= a/'Y';\n cout<<solve()<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1240,
"score_of_the_acc": -0.0061,
"final_rank": 2
},
{
"submission_id": "aoj_1002_1636638",
"code_snippet": "#include <iostream>\n#include <cstring>\nusing namespace std;\nint mp[2][20010];\n\nint solve(int goal){\n int x=0,y=0,cost=0,f=1;\n while(x!=goal+1) {\n if(f&&mp[0][x])f=0;\n if(f&&mp[1][x])f=0,cost++;\n\n if(mp[1][x])y=1,mp[1][x]=0;\n else if(mp[0][x])y=mp[0][x]=0;\n else x++;\n cost++;\n }\n if(y==1)cost++;\n return cost-1;\n}\n\nint main(){\n int q;\n cin>> q;\n while(q--){\n int n;\n cin>>n;\n memset(mp,0,sizeof(mp));\n\n char a;\n for(int i=0;i<2;i++)\n for(int j=0;j<2*n;j++)cin>> a,mp[i][(j+1)/2] |= a/'Y';\n cout<<solve(n)<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1324,
"score_of_the_acc": -0.0125,
"final_rank": 6
},
{
"submission_id": "aoj_1002_1636627",
"code_snippet": "#include <iostream>\n#include <cstring>\nusing namespace std;\nint mp[2][20010];\n\nint solve(int goal){\n int x=0,y=0,cost=0,f=1;\n while(x!=goal+1) {\n if(f&&mp[0][x])f=0;\n if(f&&mp[1][x])f=0,cost++;\n\n if(mp[1][x])y=1,mp[1][x]=0;\n else if(mp[0][x])y=mp[0][x]=0;\n else x++;\n cost++;\n }\n if(y==1)cost++;\n return cost-1;\n}\n\nint main(){\n int q;\n cin>> q;\n while(q--){\n int n,pos;\n cin>>n;\n memset(mp,0,sizeof(mp));\n\n for(int i=0;i<2;i++){\n pos=0;\n for(int j=0,cnt=1;j<2*n;j++){\n\tchar a;\n\tcin>> a;\n\tmp[i][pos] |= a/'Y';\n\tcnt++;\n\tif(cnt%2==0)pos++;\n }\n }\n cout<<solve(pos)<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1324,
"score_of_the_acc": -0.0125,
"final_rank": 6
},
{
"submission_id": "aoj_1002_1636608",
"code_snippet": "#include <iostream>\n#include <cstring>\nusing namespace std;\nint mp[2][20010];\n\nint solve(int goal){\n int x=0,f=1,cost=0,y=0;\n while(x!=goal+1) {\n if(f&&mp[0][x])f=0,cost++,y=mp[0][x]=0;\n else if(f&&mp[1][x])cost++,f=y=0;\n else if(mp[1][x]) cost++,y=1,mp[1][x]=0;\n else if(mp[0][x]) cost++,y=mp[0][x]=0;\n else cost++,x++;\n }\n if(y==1)cost++;\n return cost-1;\n}\n\nint main(){\n int q;\n cin>> q;\n while(q--){\n int n,pos,cnt;\n cin>>n;\n memset(mp,0,sizeof(mp));\n\n for(int i=0;i<2;i++){\n pos=0,cnt=1;\n char a;\n for(int j=0;j<2*n;j++){\n\tcin>> a;\n\tif(a=='Y') a=1;\n\telse a=0;\n\tmp[i][pos] |= a;\n\tcnt++;\n\tif(cnt==2)pos++,cnt=0;\n }\n }\n cout<<solve(pos)<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1324,
"score_of_the_acc": -0.0125,
"final_rank": 6
},
{
"submission_id": "aoj_1002_1636606",
"code_snippet": "#include <iostream>\n#include <cstring>\nusing namespace std;\nint mp[2][20010];\nint n;\n\nint solve(int goal){\n int x=0,f=1,cost=0,y=0;\n while(x!=goal+1) {\n if(f&&mp[0][x])f=0,cost++,y=mp[0][x]=0;\n else if(f&&mp[1][x])cost++,f=y=0;\n else if(mp[1][x]) cost++,y=1,mp[1][x]=0;\n else if(mp[0][x]) cost++,y=mp[0][x]=0;\n else cost++,x++;\n }\n if(y==1)cost++;\n return cost-1;\n}\n\nint main(){\n int q;\n cin>> q;\n while(q--){\n cin>>n;\n memset(mp,0,sizeof(mp));\n int pos,cnt;\n for(int i=0;i<2;i++){\n pos=0,cnt=1;\n char a;\n for(int j=0;j<2*n;j++){\n\tcin>> a;\n\tif(a=='Y') a=1;\n\telse a=0;\n\tmp[i][pos] |= a;\n\tcnt++;\n\tif(cnt==2)pos++,cnt=0;\n }\n }\n // for(int i=0;i<2;i++){for(int j=0;j<=pos;j++) cout << mp[i][j]<<\" \";cout <<endl;}\n cout<<solve(pos)<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1324,
"score_of_the_acc": -0.0125,
"final_rank": 6
},
{
"submission_id": "aoj_1002_1634308",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n \nint main() {\n int T;\n cin >> T;\n while(T--) {\n int n;\n string s;\n cin >> n >> s;\n bool a[2][n+1];\n memset(a,0,sizeof(a));\n for(int i=0; i<4*n; i++) {\n if(i<2*n) a[0][(i+1)/2]|=s[i]=='Y';\n else a[1][(i+1-2*n)/2]|=s[i]=='Y';\n }\n int x=1<<29,y=0;\n for(int i=0; i<2; i++) {\n for(int j=0; j<n+1; j++) {\n if(a[i][j]) {\n x=min(x,j);\n y=max(y,j);\n }\n }\n }\n int ans=n;\n for(int j=x+1; j<y; j++) {\n for(int i=0; i<2; i++) {\n if(a[i][j]) ans++;\n }\n }\n if(a[1][x]) ans+=2;\n else if(a[0][x]) ans++;\n if(a[1][y]) ans+=2;\n else if(a[0][y]) ans++;\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1332,
"score_of_the_acc": -0.0132,
"final_rank": 12
},
{
"submission_id": "aoj_1002_1632964",
"code_snippet": "#include<iostream>\nusing namespace std;\nint main(){\n int t;\n cin>>t;\n while(t--){\n int n,e=-1,E=-1,be=1e9,BE=1e9;\n int f=0;\n cin>>n;\n int an=n;\n for(int i=0;i<2;i++){\n char a,b='N';\n for(int j=0;j<n;j++){\n\tcin>>a;\n\tif(a=='Y'||b=='Y'){\n\t an++;\n\t if(i==1)f=2,E=j,BE=min(BE,j);\n\t else e=j,be=min(be,j);\n\t}\n\tcin>>b;\n }\n\tif(b=='Y'){\n\t an++;\n\t if(i==1)f=2,E=n,BE=min(BE,n);\n\t else e=n,be=min(be,n);\n\t}\n b='N';\n }\n if(e>=E&&f>0)f--;\n if(be<=BE&&f>0)f--;\n cout<<an+f<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1002_1632931",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int T;\n cin >> T;\n while(T--) {\n int n;\n string s;\n cin >> n >> s;\n bool a[2][n+1];\n memset(a,0,sizeof(a));\n for(int i=0; i<4*n; i++) {\n if(i<2*n) a[0][(i+1)/2]|=s[i]=='Y';\n else a[1][(i+1-2*n)/2]|=s[i]=='Y';\n }\n int x=1<<29,y=0;\n for(int i=0; i<2; i++) {\n for(int j=0; j<n+1; j++) {\n if(a[i][j]) {\n x=min(x,j);\n y=max(y,j);\n }\n }\n }\n int ans=n;\n for(int j=x+1; j<y; j++) {\n for(int i=0; i<2; i++) {\n if(a[i][j]) ans++;\n }\n }\n if(a[1][x]) ans+=2;\n else if(a[0][x]) ans++;\n if(a[1][y]) ans+=2;\n else if(a[0][y]) ans++;\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1332,
"score_of_the_acc": -0.0132,
"final_rank": 12
},
{
"submission_id": "aoj_1002_1436869",
"code_snippet": "#include<iostream>\n#include <string>\n#include <string.h>\nusing namespace std;\n\nint main(){\n\n\tint T = 0;\n\tint N = 0;\n\tstring str;\n\tint result = 0;\n\n\tbool flag = false;\n\tint pivot = 0;\n\n\tcin >> T;\n\n\tfor (int i = 0; i<T; i++){\n\t\t//?????????\n\t\tN = 0, str = \"\",flag=false,pivot=0,result=0;\n\n\t\t//????????????\n\t\tcin >> N;\n\t\tcin >> str;\n\n\t\tfor (pivot = 0; pivot < (2 * N); pivot++){\n\t\t\t//???????????????\n\t\t\tif (pivot == 0){\n\t\t\t\tif (str[pivot + 2 * N] == 'Y'){\n\t\t\t\t\tresult = result + 2;\n\t\t\t\t\tflag = true;\n\t\t\t\t}\n\t\t\t\telse if (str[pivot] == 'Y'){\n\t\t\t\t\tresult++;\n\t\t\t\t\tflag = true;\n\t\t\t\t}\n\t\t\t}//?????????????????????\n\t\t\telse if (pivot == (2 * N) - 1){\n\t\t\t\tif (flag == false){\n\t\t\t\t\tif (str[pivot + 2 * N] == 'Y'){\n\t\t\t\t\t\tresult = result + 2;\n\t\t\t\t\t\tflag = true;\n\t\t\t\t\t}\n\t\t\t\t\telse if (str[pivot] == 'Y'){\n\t\t\t\t\t\tresult++;\n\t\t\t\t\t\tflag = true;\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tresult--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tif (str[pivot + 2 * N] == 'Y'){\n\t\t\t\t\t\tresult++;\n\t\t\t\t\t}\n\t\t\t\t\telse if (str[pivot] != 'Y'){\n\t\t\t\t\t\tresult--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}//?????????\n\t\t\telse{\n\t\t\t\tif (flag == false){\n\t\t\t\t\tif (str[pivot + 2 * N] == 'Y' || str[pivot + 2 * N + 1] == 'Y'){\n\t\t\t\t\t\tresult = result + 2;\n\t\t\t\t\t\tflag = true;\n\t\t\t\t\t}\n\t\t\t\t\telse if (str[pivot] == 'Y' || str[pivot + 1] == 'Y'){\n\t\t\t\t\t\tresult++;\n\t\t\t\t\t\tflag = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tif (str[pivot] == 'Y' || str[pivot + 1] == 'Y'){\n\t\t\t\t\t\tresult++;\n\t\t\t\t\t}\n\t\t\t\t\tif (str[pivot + 2 * N] == 'Y' || str[pivot + 2 * N + 1] == 'Y'){\n\t\t\t\t\t\tresult++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tresult++;\n\t\t\tif(pivot!=0)pivot++;\n\n\t\t}\n\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1308,
"score_of_the_acc": -0.0113,
"final_rank": 4
},
{
"submission_id": "aoj_1002_1226827",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\n\nint main()\n{\n int T;\n cin>>T;\n while(T--)\n {\n int N;\n cin>>N;\n string s;\n cin>>s;\n vector<bool> done(s.size(),false);\n vector<vector<int> > dp(3,vector<int>(N+2,1000000));\n dp[0][0]=0;\n for(int c=0;c<=N;c++)\n {\n bool b1 = (c != 0 && s[c*2-1]=='Y') || (c != N && s[c*2] == 'Y');\n bool b2 = (c != 0 && s[c*2-1+2*N]=='Y') || (c != N && s[c*2+2*N] == 'Y');\n if(b1 && b2)\n {\n dp[0][c+1] = min(dp[0][c]+4,min(dp[1][c]+3,dp[2][c]+3));\n dp[1][c+1] = min(dp[0][c]+3,min(dp[2][c]+3,dp[1][c]+4));\n dp[2][c+1] = min(dp[0][c]+3,min(dp[2][c]+4,dp[1][c]+3));\n\n }\n else if(!b1 && b2)\n {\n dp[0][c+1] = min(dp[0][c]+4,min(dp[1][c]+3,dp[2][c]+3));\n dp[1][c+1] = min(dp[0][c]+3,min(dp[1][c]+2,dp[2][c]+2));\n dp[2][c+1] = min(dp[0][c]+3,min(dp[1][c]+2,dp[2][c]+2));\n }\n else if(b1 && !b2)\n {\n dp[0][c+1] = min(dp[0][c]+2,min(dp[1][c]+2,dp[2][c]+3));\n dp[1][c+1] = min(dp[0][c]+2,min(dp[1][c]+2,dp[2][c]+3));\n dp[2][c+1] = min(dp[0][c]+3,min(dp[1][c]+3,dp[2][c]+4));\n }\n else if(!b1 && !b2)\n {\n dp[0][c+1] = min(dp[0][c]+1,min(dp[1][c]+2,dp[2][c]+3));\n dp[1][c+1] = min(dp[0][c]+2,min(dp[1][c]+1,dp[2][c]+2));\n dp[2][c+1] = min(dp[0][c]+3,min(dp[1][c]+2,dp[2][c]+1));\n }\n }\n cout<<dp[0][N+1]-1<<endl;\n\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1452,
"score_of_the_acc": -0.0223,
"final_rank": 16
},
{
"submission_id": "aoj_1002_1122811",
"code_snippet": "#include <iostream>\n#include <cstring>\nusing namespace std;\n\nbool put[10001][2];\nint dp[10001][3];\n\nint min(int a, int b, int c) {\n return min(a, min(b, c));\n}\n\nint main() {\n int T; cin >> T;\n while (T--) {\n int N; cin >> N;\n memset(put, 0, sizeof put);\n char c;\n for (int k=1; k<=4*N; ++k) {\n cin >> c;\n if (c == 'Y') {\n if (k <= 2*N) {\n put[k/2][0] = true;\n } else {\n put[(k-2*N)/2][1] = true;\n }\n }\n }\n memset(dp, 0, sizeof dp);\n if (put[0][0] && put[0][1]) {\n dp[0][0] = 3;\n dp[0][1] = 2;\n dp[0][2] = 2;\n } else if (put[0][0] && ! put[0][1]) {\n dp[0][0] = 1;\n dp[0][1] = 1;\n dp[0][2] = 2;\n } else if ( ! put[0][0] && put[0][1]) {\n dp[0][0] = 3;\n dp[0][1] = 2;\n dp[0][2] = 2;\n } else if ( ! put[0][0] && ! put[0][1]) {\n dp[0][0] = 0;\n dp[0][1] = 1;\n dp[0][2] = 2;\n }\n for (int k=1; k<=N; ++k) {\n if (put[k][0] && put[k][1]) {\n dp[k][0] = min(dp[k-1][0] + 4, dp[k-1][1] + 3, dp[k-1][2] + 3);\n dp[k][1] = min(dp[k-1][0] + 3, dp[k-1][1] + 3, dp[k-1][2] + 3);\n dp[k][2] = min(dp[k-1][0] + 3, dp[k-1][1] + 3, dp[k-1][2] + 4);\n } else if (put[k][0] && ! put[k][1]) {\n dp[k][0] = min(dp[k-1][0] + 2, dp[k-1][1] + 2, dp[k-1][2] + 3);\n dp[k][1] = min(dp[k-1][0] + 2, dp[k-1][1] + 2, dp[k-1][2] + 3);\n dp[k][2] = min(dp[k-1][0] + 3, dp[k-1][1] + 3, dp[k-1][2] + 4);\n } else if ( ! put[k][0] && put[k][1]) {\n dp[k][0] = min(dp[k-1][0] + 4, dp[k-1][1] + 3, dp[k-1][2] + 3);\n dp[k][1] = min(dp[k-1][0] + 3, dp[k-1][1] + 2, dp[k-1][2] + 2);\n dp[k][2] = min(dp[k-1][0] + 3, dp[k-1][1] + 2, dp[k-1][2] + 2);\n } else if ( ! put[k][0] && ! put[k][1]) {\n dp[k][0] = min(dp[k-1][0] + 1, dp[k-1][1] + 2, dp[k-1][2] + 3);\n dp[k][1] = min(dp[k-1][0] + 2, dp[k-1][1] + 1, dp[k-1][2] + 2);\n dp[k][2] = min(dp[k-1][0] + 3, dp[k-1][1] + 2, dp[k-1][2] + 1);\n }\n }\n cout << dp[N][0] << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1304,
"score_of_the_acc": -0.011,
"final_rank": 3
},
{
"submission_id": "aoj_1002_1107618",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 100000000\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cstdio>\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 \nconst int tx[] = {+0,+0,+1};\nconst int ty[] = {-1,+1,+0};\n\nint nodes[5][20001];\nint dp[1<<5][20001][5]; //dp[book_state][x][y];\n\nint compute_book_state(int x){\n int res = 0;\n for(int y = 1,i=0; y < 5; y+=2,i++){\n if(nodes[y][x] == 1){\n res |= (1<<y);\n }\n }\n return res;\n}\n\nint shelves_per_line;\n\nstruct State{\n int x;\n int y;\n int cost;\n int book_state;\n State(int x,int y,int cost,int book_state) :\n x(x),y(y),cost(cost),book_state(book_state) {}\n bool operator<(const State& s) const {\n return cost < s.cost;\n }\n bool operator>(const State& s) const {\n return cost > s.cost;\n }\n};\n\nvoid bfs(){\n \n priority_queue<State,vector<State>,greater<State> > que;\n que.push(State(0,0,0,compute_book_state(0)));\n \n while(!que.empty()){\n State s = que.top();\n que.pop();\n int sx = s.x;\n int sy = s.y;\n int cost = s.cost;\n for(int i=0;i<3;i++){\n int dx = sx + tx[i];\n int dy = sy + ty[i];\n if(dy < 0 || dy >= 5 || dx > shelves_per_line) continue;\n \n if(i < 2){\n if(s.book_state & (1<<dy)){\n int next_book_state = (s.book_state & ~(1<<dy));\n if(dp[next_book_state][dx][dy] > cost + abs(sy - dy)){\n dp[next_book_state][dx][dy] = cost + abs(sy - dy);\n que.push(State(dx,dy,cost + abs(sy - dy),next_book_state));\n }\n }\n else{\n if(dp[s.book_state][dx][dy] > cost + abs(sy - dy)){\n dp[s.book_state][dx][dy] = cost + abs(sy - dy);\n que.push(State(dx,dy,cost + abs(sy - dy),s.book_state));\n }\n }\n }\n \n else{\n if(sy % 2 == 1) continue;\n if(s.book_state != 0) continue;\n \n int next_book_state = compute_book_state(dx);\n if(dp[next_book_state][dx][dy] > cost + 2){\n dp[next_book_state][dx][dy] = cost + 2;\n que.push(State(dx,dy,cost + 2,next_book_state));\n }\n }\n }\n }\n}\n\nint main(){\n int num_of_test_cases;\n while(~scanf(\"%d\",&num_of_test_cases)){\n for(int case_i = 0; case_i < num_of_test_cases; case_i++){\n scanf(\"%d\",&shelves_per_line);\n string shelves;\n cin >> shelves;\n\n memset(nodes,0,sizeof(nodes));\n for(int y = 1,i=0; y <= 4; y+=2,i++){\n for(int x = 0; x <= shelves_per_line; x++){\n if(x == 0){\n if(shelves[(i * shelves_per_line * 2)] == 'Y'){\n nodes[y][x] = 1;\n }\n }\n else if(x == shelves_per_line){\n if(shelves[(i * shelves_per_line * 2) + (shelves_per_line * 2 - 1)] == 'Y'){\n nodes[y][x] = 1;\n }\n }\n else{\n if(shelves[(i * shelves_per_line * 2) + 2 * x - 1] == 'Y' \n || shelves[(i * shelves_per_line * 2) + 2 * x] == 'Y'){\n nodes[y][x] = 1;\n }\n }\n }\n }\n\n memset(dp,0x3f,sizeof(dp));\n int book_state = compute_book_state(0);\n dp[book_state][0][0] = 0;\n bfs();\n\n printf(\"%d\\n\",dp[0][shelves_per_line][0]/2);\n }\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 14232,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_1002_1107617",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 100000000\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cstdio>\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 \nconst int tx[] = {+0,+0,+1};\nconst int ty[] = {-1,+1,+0};\n\nint nodes[5][20001];\nint dp[1<<5][20001][5]; //dp[book_state][x][y];\n\nint compute_book_state(int x){\n int res = 0;\n for(int y = 1,i=0; y < 5; y+=2,i++){\n if(nodes[y][x] == 1){\n res |= (1<<y);\n }\n }\n return res;\n}\n\nint shelves_per_line;\n\nstruct State{\n int x;\n int y;\n int cost;\n int book_state;\n State(int x,int y,int cost,int book_state) :\n x(x),y(y),cost(cost),book_state(book_state) {}\n bool operator<(const State& s) const {\n return cost < s.cost;\n }\n bool operator>(const State& s) const {\n return cost > s.cost;\n }\n};\n\nint bfs(){\n \n priority_queue<State,vector<State>,greater<State> > que;\n que.push(State(0,0,0,compute_book_state(0)));\n \n while(!que.empty()){\n State s = que.top();\n que.pop();\n int sx = s.x;\n int sy = s.y;\n int cost = s.cost;\n for(int i=0;i<3;i++){\n int dx = sx + tx[i];\n int dy = sy + ty[i];\n if(dy < 0 || dy >= 5 || dx > shelves_per_line) continue;\n \n if(i < 2){\n if(s.book_state & (1<<dy)){\n int next_book_state = (s.book_state & ~(1<<dy));\n if(dp[next_book_state][dx][dy] > cost + abs(sy - dy)){\n dp[next_book_state][dx][dy] = cost + abs(sy - dy);\n que.push(State(dx,dy,cost + abs(sy - dy),next_book_state));\n }\n }\n else{\n if(dp[s.book_state][dx][dy] > cost + abs(sy - dy)){\n dp[s.book_state][dx][dy] = cost + abs(sy - dy);\n que.push(State(dx,dy,cost + abs(sy - dy),s.book_state));\n }\n }\n }\n \n else{\n if(sy % 2 == 1) continue;\n if(s.book_state != 0) continue;\n \n int next_book_state = compute_book_state(dx);\n if(dp[next_book_state][dx][dy] > cost + 2){\n dp[next_book_state][dx][dy] = cost + 2;\n que.push(State(dx,dy,cost + 2,next_book_state));\n }\n }\n }\n }\n}\n\nint main(){\n int num_of_test_cases;\n while(~scanf(\"%d\",&num_of_test_cases)){\n for(int case_i = 0; case_i < num_of_test_cases; case_i++){\n scanf(\"%d\",&shelves_per_line);\n string shelves;\n cin >> shelves;\n\n memset(nodes,0,sizeof(nodes));\n for(int y = 1,i=0; y <= 4; y+=2,i++){\n for(int x = 0; x <= shelves_per_line; x++){\n if(x == 0){\n if(shelves[(i * shelves_per_line * 2)] == 'Y'){\n nodes[y][x] = 1;\n }\n }\n else if(x == shelves_per_line){\n if(shelves[(i * shelves_per_line * 2) + (shelves_per_line * 2 - 1)] == 'Y'){\n nodes[y][x] = 1;\n }\n }\n else{\n if(shelves[(i * shelves_per_line * 2) + 2 * x - 1] == 'Y' \n || shelves[(i * shelves_per_line * 2) + 2 * x] == 'Y'){\n nodes[y][x] = 1;\n }\n }\n }\n }\n\n memset(dp,0x3f,sizeof(dp));\n int book_state = compute_book_state(0);\n dp[book_state][0][0] = 0;\n bfs();\n\n printf(\"%d\\n\",dp[0][shelves_per_line][0]/2);\n }\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 14232,
"score_of_the_acc": -1.5,
"final_rank": 19
},
{
"submission_id": "aoj_1002_1087795",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n#include <algorithm>\n\nusing namespace std;\n\nclass range {\nprivate:\n struct Iterator {\n int val;\n int operator*() {return val;}\n bool operator!=(Iterator& itr) {return val < itr.val;}\n void operator++() {++val;}\n };\n Iterator i, n;\npublic:\n range(int n) : i({0}), n({n}) {}\n range(int i, int n) : i({i}), n({n}) {}\n Iterator& begin() {return i;}\n Iterator& end() {return n;}\n};\n\ntemplate<class T> inline T at(const vector<T> &v, int i) {return v[(i % (int)v.size() + v.size()) % v.size()];}\n\ntemplate<class T> inline bool is_max(T &a, const T &b) {return a < b ? a = b, true : false;}\ntemplate<class T> inline bool is_min(T &a, const T &b) {return a > b ? a = b, true : false;}\n\nint main() {\n int t;\n cin >> t;\n for (int _ : range(t)) {\n int n;\n string s, s1, s2;\n cin >> n >> s;\n s1 = \"N\" + s.substr(0, n * 2) + \"N\";\n s2 = \"N\" + s.substr(n * 2) + \"N\";\n n = n + 1;\n int res = n + 1;\n for (int i : range(n)) {\n if (s1[2 * i] == 'Y' || s1[2 * i + 1] == 'Y') ++res;\n if (s2[2 * i] == 'Y' || s2[2 * i + 1] == 'Y') ++res;\n }\n for (int i : range(n)) {\n if (s1[2 * i] == 'Y' || s1[2 * i + 1] == 'Y') {\n --res;\n break;\n }\n if (s2[2 * i] == 'Y' || s2[2 * i + 1] == 'Y') break;\n }\n reverse(s1.begin(), s1.end());\n reverse(s2.begin(), s2.end());\n for (int i : range(n)) {\n if (s1[2 * i] == 'Y' || s1[2 * i + 1] == 'Y') {\n --res;\n break;\n }\n if (s2[2 * i] == 'Y' || s2[2 * i + 1] == 'Y') break;\n }\n cout << res << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1328,
"score_of_the_acc": -0.0129,
"final_rank": 11
},
{
"submission_id": "aoj_1002_1049598",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nconst int MAX_N = 10000;\n\nint main(){\n int m, n, i, j;\n cin >> m;\n while(m--){\n cin >> n;\n string t;\n cin >> t;\n int shelf[2][MAX_N+1];\n for(i = 0; i < 2*n+2; i++){\n shelf[i/(n+1)][i%(n+1)] = 0;\n }\n int minc[2]={MAX_N+3,MAX_N+3}, maxc[2]={-1,-1}, count=0;\n for(i = 0; i < 4*n; i++){\n int r = i/2/n, c = (i%(2*n)+1)/2;\n if(t[i]=='Y'){\n shelf[r][c] = 1;\n if(minc[r] > MAX_N) minc[r] = c;\n maxc[r] = c;\n }\n }\n for(i = 0; i < 2; i++){\n for(j = 0; j < n+1; j++){\n count += shelf[i][j];\n }\n }\n count += n;\n if(minc[0] > minc[1]) count++;\n if(maxc[0] < maxc[1]) count++;\n cout << count << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1380,
"score_of_the_acc": -0.0168,
"final_rank": 14
},
{
"submission_id": "aoj_1002_1028983",
"code_snippet": "#include<iostream>\n#include<string>\n#include<cstring>\nusing namespace std;\n#define INF (1<<29)\n\n\nint g[10001];\nint dp[10001][2];\n\n\nint main(){\n\tint t,n;\n\tstring s;\n\tcin>>t;\n\twhile(t--){\n\t\tcin>>n>>s;\n\t\tmemset(g,0,sizeof(g));\n\t\tif(s[0]=='Y')g[0]|=1;\n\t\tfor(int i=1;i<2*n-1;i+=2){\n\t\t\tif(s[i]=='Y'||s[i+1]=='Y')g[1+i/2]|=1;\n\t\t}\n\t\tif(s[2*n-1]=='Y')g[n]|=1;\n\t\t\n\t\tif(s[2*n]=='Y')g[0]|=2;\n\t\tfor(int i=2*n+1;i<4*n-1;i+=2){\n\t\t\tif(s[i]=='Y'||s[i+1]=='Y')g[1+(i-2*n)/2]|=2;\n\t\t}\n\t\tif(s[4*n-1]=='Y')g[n]|=2;\n\n\t\tif(g[0]&2){\n\t\t\tdp[0][0]=3;\n\t\t\tdp[0][1]=2;\n\t\t}else if(g[0]&1){\n\t\t\tdp[0][0]=1;\n\t\t\tdp[0][1]=1;\n\t\t}else{\n\t\t\tdp[0][0]=0;\n\t\t\tdp[0][1]=1;\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(g[i+1]==3){\n\t\t\t\tdp[i+1][0]=min(dp[i][0]+4,dp[i][1]+3);\n\t\t\t\tdp[i+1][1]=min(dp[i][0]+3,dp[i][1]+3);\n\t\t\t}else if(g[i+1]==1){\n\t\t\t\tdp[i+1][0]=min(dp[i][0]+2,dp[i][1]+2);\n\t\t\t\tdp[i+1][1]=min(dp[i][0]+2,dp[i][1]+2);\n\t\t\t}else if(g[i+1]==2){\n\t\t\t\tdp[i+1][0]=min(dp[i][0]+4,dp[i][1]+3);\n\t\t\t\tdp[i+1][1]=min(dp[i][0]+3,dp[i][1]+2);\n\t\t\t}else{\n\t\t\t\tdp[i+1][0]=min(dp[i][0]+1,dp[i][1]+2);\n\t\t\t\tdp[i+1][1]=min(dp[i][0]+2,dp[i][1]+1);\n\t\t\t}\n\t\t}\n\t\tcout<<dp[n][0]<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1432,
"score_of_the_acc": -0.0208,
"final_rank": 15
},
{
"submission_id": "aoj_1002_995838",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <map>\n#include <set>\nusing namespace std;\nint main(){\n int q;\n cin >> q;\n for(int loop = 0;loop < q;loop++){\n\tint n;\n\tstring str;\n\tcin >> n;\n\tcin >> str;\n\tvector<vector<bool> > field(2,vector<bool>(n+1,false));\n\tfor(int i = 0;i < 2*n;i++){\n\t if(str[i] == 'Y'){\n\t\tfield[0][(i+1)/2] = true;\n\t }\n\t if(str[i+2*n] == 'Y'){\n\t\tfield[1][(i+1)/2] = true;\n\t }\n\t}\n\n\tint ans = n;\n\tbool first = true;\n\tint b_s = 0;\n\tfor(int i = 0;i < n+1;i++){\n\t if(first){\n\t\tif(field[1][i]){\n\t\t first = false;\n\t\t ans += 2;\n\t\t b_s = 1;\n\t\t}else if(field[0][i]){\n\t\t first = false;\n\t\t ans++;\n\t\t}\n\t }else{\n\t\tif(field[0][i] && field[1][i]){\n\t\t ans+=2;\n\t\t b_s = 0;\n\t\t}else if(field[0][i]){\n\t\t ans++;\n\t\t b_s = 0;\n\t\t}else if(field[1][i]){\n\t\t ans++;\n\t\t b_s = 1;\n\t\t}\n\t }\n\t}\n\t\n\tif(b_s == 1)ans++;\n\tcout << ans << endl;\n\t\n\t\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1324,
"score_of_the_acc": -0.0125,
"final_rank": 6
},
{
"submission_id": "aoj_1002_959867",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint libgirl();\nint girl(int x, int y, int point);\n\nint main(){\n\tint times;\n\tint i;\n\tcin >> times;\n\tfor(i = 0; i < times; i++){\n\t\tcout << libgirl() << endl;\n\t}\n}\n\nint libgirl(){\n\tstring shelve_input;\n\tint N, i;\n\tvector<vector<int>> shelve;\n\tint upper = 0;\n\tint downer = 0;\n\tint start = 1;\n\tint end = 1;\n\tint walk = 0;\n\t\n\tcin >> N;\n\tcin >> shelve_input;\n\tfor(i = 0; i < 2*N; i++){\n\t\tshelve.push_back({0,0});\n\t}\n\tfor(i = 0; i < 2*N; i++){\n\t\tif(shelve_input[i] == 'Y'){\n\t\t\tshelve[i][0] = 1;\n\t\t\tupper++;\n\t\t}else{\n\t\t\tshelve[i][0] = 0;\n\t\t}\n\t}\n\tfor(i = 2*N; i < 4*N; i++){\n\t\tif(shelve_input[i] == 'Y'){\n\t\t\tshelve[i-2*N][1] = 1;\n\t\t\tdowner++;\n\t\t}else{\n\t\t\tshelve[i-2*N][1] = 0;\n\t\t}\n\t}\n\tfor(i = 0; i < 2*N; i++){\n\t\tif(shelve[i][0] == 1){\n\t\t\tstart = 0;\n\t\t\tbreak;\n\t\t}else if(shelve[i][1] == 1){\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(i = 2*N-1; i >= 0; i--){\n\t\tif(shelve[i][0] == 1){\n\t\t\tend = 0;\n\t\t\tbreak;\n\t\t}else if(shelve[i][1] == 1){\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(i = 2; i < 2*N; i = i + 2){\n\t\tif(shelve[i][0] == 1 && shelve[i-1][0] == 1){\n\t\t\tupper--;\n\t\t}\n\t\tif(shelve[i][1] == 1 && shelve[i-1][1] == 1){\n\t\t\tdowner--;\n\t\t}\n\t}\n\twalk = upper + downer + N + start + end;\n\treturn walk;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2572,
"score_of_the_acc": -0.108,
"final_rank": 18
},
{
"submission_id": "aoj_1002_886828",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <numeric>\n#include <cctype>\n#include <tuple>\n\n#ifdef _MSC_VER\n#include <agents.h>\n#endif\n\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\n#define rep(i, n) FOR(i, 0, n)\n#define ALL(v) begin(v), end(v)\n#define REV(v) rbegin(v), rend(v)\n#define MEMSET(v, s) memset(v, s, sizeof(v))\n#define X first\n#define Y second\n#define ok(x) (0 <= x && x < s.size() && s[x] == 'Y')\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nstruct info{\n\tint left, right, cnt;\n};\n\nint N;\ninfo check(string s){\n\tinfo ret;\n\tret.left = 2 * N;\n\tret.right = 0;\n\tret.cnt = 0;\n\trep(i, N + 1){\n\t\tif (ok(i * 2 - 1) || ok(i * 2)){\n\t\t\tret.left = min(ret.left, i);\n\t\t\tret.right = max(ret.right, i);\n\t\t\t++ret.cnt;\n\t\t}\n\t}\n\treturn ret;\n}\n\nint main(){\n\tint T;\n\tcin >> T;\n\twhile (T--){\n\t\tcin >> N;\n\t\tstring s;\n\t\tcin >> s;\n\t\tinfo up, down;\n\t\tup = check(s.substr(0, 2 * N));\n\t\tdown = check(s.substr(2 * N));\n\n\t\tint total = up.cnt + down.cnt;\n\n\t\tint ans = N;\n\t\tif (total){\n\t\t\tans = N + 2;\n\t\t\tans += total;\n\t\t\tif (up.left <= down.left) --ans;\n\t\t\tif (up.right >= down.right) --ans;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1316,
"score_of_the_acc": -0.0119,
"final_rank": 5
}
] |
aoj_1015_cpp
|
Problem G:
Dominating Set
What you have in your hands is a map of Aizu-Wakamatsu City. The lines on this map represent streets and the dots are street corners. Lion Dor Company is going to build food stores at some street corners where people can go to buy food. It is unnecessary and expensive to build a food store on every corner. Their plan is to build the food stores so that people could get food either right there on the corner where they live, or at the very most, have to walk down only one street to find a corner where there was a food store. Now, all they have to do is figure out where to put the food store.
The problem can be simplified as follows. Let
G
= (
V, E
) be unweighted undirected graph. A dominating set
D
of
G
is a subset of
V
such that every vertex in
V
-
D
is adjacent to at least one vertex in
D
. A minimum dominating set is a dominating set of minimum number of vertices for
G
. In the example graph given below, the black vertices are the members of the minimum dominating sets.
Design and implement an algorithm for the minimum domminating set problem.
Input
Input has several test cases. Each test case consists of the number of nodes
n
and the number of edges
m
in the first line. In the following
m
lines, edges are given by a pair of nodes connected by the edge. The graph nodess are named with the numbers 0, 1,...,
n
- 1 respectively.
The input terminate with a line containing two 0. The number of test cases is less than 20.
Constrants
n
≤ 30
m
≤ 50
Output
Output the size of minimum dominating set for each test case.
Sample Input
5 4
0 1
0 4
1 2
3 4
5 4
0 1
0 4
1 2
3 4
0 0
Output for the Sample Input
2
2
|
[
{
"submission_id": "aoj_1015_2698281",
"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\tUNDEFINED,\n\tD,\n\tNOT_D,\n};\n\nint N,M,ans;\nint min_dist[30];\nvector<int> G[30];\n\n\nbool check(Type array[30]){\n\n\tbool FLG;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tif(array[i] != NOT_D)continue;\n\n\t\tFLG = false;\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\t\t\tif(array[G[i][k]] == UNDEFINED || array[G[i][k]] == D){\n\t\t\t\tFLG = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(!FLG)return false;\n\t}\n\treturn true;\n}\n\n\nvoid recursive(Type array[30],int num,int count){\n\n\tif(count >= ans)return;\n\n\tif(num == N){\n\t\tans = count;\n\t\treturn;\n\t}\n\n\tType next_arrayD[30];\n\tfor(int i = 0; i < N; i++)next_arrayD[i] = array[i];\n\tnext_arrayD[num] = D;\n\trecursive(next_arrayD,num+1,count+1);\n\n\tType next_arrayNOT[30];\n\tfor(int i = 0; i < N; i++)next_arrayNOT[i] = array[i];\n\tnext_arrayNOT[num] = NOT_D;\n\tif(check(next_arrayNOT)){\n\t\trecursive(next_arrayNOT,num+1,count);\n\t}\n}\n\n\nvoid func(){\n\n\tfor(int i = 0; i < N; i++){\n\t\tG[i].clear();\n\t}\n\n\tint from,to;\n\tfor(int loop = 0; loop < M; loop++){\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tG[from].push_back(to);\n\t\tG[to].push_back(from);\n\t}\n\n\tans = N;\n\tType first[30];\n\tfor(int i = 0; i < N; i++)first[i] = UNDEFINED;\n\n\trecursive(first,0,0);\n\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&N,&M);\n\t\tif(N == 0 && M == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3276,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_1015_2696675",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint V,E,ans;\nll edge[64];\nll sum_edge[64];\nvoid MDS(int cur,int cost,ll mask){\n\tif(cost>=ans)return;\n\tif(mask==(1LL<<V)-1){\n\t\tans=cost;\n\t\treturn;\n\t}\n\tif(cur>=V)return;\n\t//if((mask|sum_edge[cur])!=(1LL<<V)-1)return;\n\tMDS(cur+1,cost+1,mask|edge[cur]);\n\tMDS(cur+1,cost,mask);\n}\nint main(){\n\twhile(cin>>V>>E,V){\n\t\tmemset(edge,0,sizeof(edge));\n\t\tmemset(sum_edge,0,sizeof(sum_edge));\n\t\tfor(int i=0;i<V;i++)edge[i]|=(1LL<<i);\n\t\tfor(int i=0;i<E;i++){\n\t\t\tint A,B;\n\t\t\tcin>>A>>B;\n\t\t\tedge[A]|=(1LL<<B);\n\t\t\tedge[B]|=(1LL<<A);\n\t\t}\n\t\tfor(int i=V-1;i>=0;i--) sum_edge[i] |= edge[i];\n\t\tfor(int i=V-2;i>=0;i--) sum_edge[i] |= sum_edge[i+1];\n\t\tans=1e9;\n\t\tMDS(0,0,0);\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3104,
"score_of_the_acc": -0.9257,
"final_rank": 16
},
{
"submission_id": "aoj_1015_2696674",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint V,E,ans;\nll edge[64];\nll sum_edge[64];\nvoid MDS(int cur,int cost,ll mask){\n\tif(cost>=ans)return;\n\tif(mask==(1LL<<V)-1){\n\t\tans=min(ans,cost);\n\t\treturn;\n\t}\n\tif(cur>=V)return;\n\t//if((mask|sum_edge[cur])!=(1LL<<V)-1)return;\n\tMDS(cur+1,cost+1,mask|edge[cur]);\n\tMDS(cur+1,cost,mask);\n}\nint main(){\n\twhile(cin>>V>>E,V){\n\t\tmemset(edge,0,sizeof(edge));\n\t\tmemset(sum_edge,0,sizeof(sum_edge));\n\t\tfor(int i=0;i<V;i++)edge[i]|=(1LL<<i);\n\t\tfor(int i=0;i<E;i++){\n\t\t\tint A,B;\n\t\t\tcin>>A>>B;\n\t\t\tedge[A]|=(1LL<<B);\n\t\t\tedge[B]|=(1LL<<A);\n\t\t}\n\t\tfor(int i=V-1;i>=0;i--) sum_edge[i] |= edge[i];\n\t\tfor(int i=V-2;i>=0;i--) sum_edge[i] |= sum_edge[i+1];\n\t\tans=1e9;\n\t\tMDS(0,0,0);\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3016,
"score_of_the_acc": -0.8911,
"final_rank": 14
},
{
"submission_id": "aoj_1015_2696673",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint V,E,ans;\nll edge[64];\nll sum_edge[64];\nvoid MDS(int cur,int cost,ll mask){\n\tif(cost>=ans)return;\n\tif(mask==(1LL<<V)-1){\n\t\tans=min(ans,cost);\n\t\treturn;\n\t}\n\tif(cur>=V)return;\n\t//if((mask|sum_edge[cur])!=(1LL<<V)-1)return;\n\tMDS(cur+1,cost,mask);\n\tMDS(cur+1,cost+1,mask|edge[cur]);\n}\nint main(){\n\twhile(cin>>V>>E,V){\n\t\tmemset(edge,0,sizeof(edge));\n\t\tmemset(sum_edge,0,sizeof(sum_edge));\n\t\tfor(int i=0;i<V;i++)edge[i]|=(1LL<<i);\n\t\tfor(int i=0;i<E;i++){\n\t\t\tint A,B;\n\t\t\tcin>>A>>B;\n\t\t\tedge[A]|=(1LL<<B);\n\t\t\tedge[B]|=(1LL<<A);\n\t\t}\n\t\tfor(int i=V-1;i>=0;i--) sum_edge[i] |= edge[i];\n\t\tfor(int i=V-2;i>=0;i--) sum_edge[i] |= sum_edge[i+1];\n\t\tans=1e9;\n\t\tMDS(0,0,0);\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3060,
"score_of_the_acc": -0.9309,
"final_rank": 17
},
{
"submission_id": "aoj_1015_2696672",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint V,E,ans;\nll edge[64];\nll sum_edge[64];\nvoid MDS(int cur,int cost,ll mask){\n\tif(cost>=ans)return;\n\tif(mask==(1LL<<V)-1){\n\t\tans=min(ans,cost);\n\t\treturn;\n\t}\n\tif(cur>=V)return;\n\t//if((mask|sum_edge[cur])!=(1LL<<V)-1)return;\n\tMDS(cur+1,cost+1,mask|edge[cur]);\n\tMDS(cur+1,cost,mask);\n\t//MDS(cur+1,cost+1,mask|edge[cur]);\n}\nint main(){\n\twhile(cin>>V>>E,V){\n\t\tmemset(edge,0,sizeof(edge));\n\t\tmemset(sum_edge,0,sizeof(sum_edge));\n\t\tfor(int i=0;i<V;i++)edge[i]|=(1LL<<i);\n\t\tfor(int i=0;i<E;i++){\n\t\t\tint A,B;\n\t\t\tcin>>A>>B;\n\t\t\tedge[A]|=(1LL<<B);\n\t\t\tedge[B]|=(1LL<<A);\n\t\t}\n\t\tfor(int i=V-1;i>=0;i--) sum_edge[i] |= edge[i];\n\t\tfor(int i=V-2;i>=0;i--) sum_edge[i] |= sum_edge[i+1];\n\t\tans=1e9;\n\t\tMDS(0,0,0);\n\t\tcout<<ans<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3076,
"score_of_the_acc": -0.9155,
"final_rank": 15
},
{
"submission_id": "aoj_1015_2101807",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n\n#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)\n\nusing namespace std;\ntypedef long long int ll;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef pair<int, int> PI;\nconst ll mod = 1e9 + 7;\n\nint mi = 10000;\n\nvoid dfs(int x, int v, int vs, int cov, const vector<int> &links) {\n if (v >= x) {\n return;\n }\n if (mi <= __builtin_popcount(vs)) {\n return;\n }\n //cout << \"dfs(\" << x << \",\" << v << \",\" << vs << \")\" << endl;\n // cover without v\n if (links[v] != 0) {\n dfs(x, v + 1, vs, cov, links);\n }\n //cover with v\n vs |= 1 << v;\n cov |= 1 << v;\n cov |= links[v];\n if (cov == (1 << x) - 1) {\n mi = min(mi, __builtin_popcount(vs));\n return;\n }\n REP(i, v + 1, x) {\n if (vs & (1 << i)) {\n continue;\n }\n dfs(x, i, vs, cov, links);\n break;\n }\n return;\n}\n\n\nint solve(int x, const vector<PI> &edges, const VI &links) {\n ll es = 0;\n mi = x;\n dfs(x, 0, 0, 0, links);\n return mi;\n}\n\n\nint main(void){\n int x, y;\n while (cin >> x >> y && (x || y)) {\n vector<PI> edges;\n vector<int> link(x);\n REP(i, 0, y) {\n int a, b;\n cin >> a >> b;\n edges.push_back(PI(a, b));\n link[a] |= 1 << b;\n link[b] |= 1 << a;\n }\n cout << solve(x, edges, link) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 3020,
"score_of_the_acc": -0.9334,
"final_rank": 18
},
{
"submission_id": "aoj_1015_1679266",
"code_snippet": "#include <cstdio>\n#include <algorithm>\n\n#define rep(i, n) for(int i = 0; i < n; ++i)\n\nusing namespace std;\n\nint x, y;\nint g[30][30];\nbool b[30];\n\nbool dfs(int i, int k){\n\tif(i == x){\n\t\tif(k != 0){\n\t\t\treturn false;\n\t\t}\n\n\t\trep(j, x){\n\t\t\tif(b[j]){\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tbool f = false;\n\t\t\trep(k, x){\n\t\t\t\tif(b[k] && g[j][k]){\n\t\t\t\t\tf = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!f){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\telse if(k == 0){\n\t\tb[i] = 0;\n\t\treturn dfs(i + 1, k);\n\t}\n\telse{\n\t\tb[i] = 0;\n\t\tbool f = dfs(i + 1, k);\n\t\tif(f){\n\t\t\treturn true;\n\t\t}\n\t\tb[i] = 1;\n\t\treturn dfs(i + 1, k - 1);\n\t}\n}\n\nint main(){\n\twhile(1){\n\t\tscanf(\"%d%d\", &x, &y);\n\t\tif(x == 0 && y == 0){\n\t\t\tbreak;\n\t\t}\n\n\t\trep(i, y){\n\t\t\tint a, b;\n\t\t\tscanf(\"%d%d\", &a, &b);\n\t\t\tg[a][b] = g[b][a] = 1;\n\t\t}\n\n\t\tfor(int k = 1; k <= x; ++k){\n\t\t\tif(dfs(0, k)){\n\t\t\t\tprintf(\"%d\\n\", k);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\trep(i, 30){\n\t\t\trep(j, 30){\n\t\t\t\tg[i][j] = 0;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 1028,
"score_of_the_acc": -0.0608,
"final_rank": 1
},
{
"submission_id": "aoj_1015_1641286",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint c_neighbor[31]; // c???closed neighbor\n\n// Check whether a set dset of size k is a dominating set of a graph\n// of n vertices.\nbool is_dominating_set(int dset, int n)\n{\n int dominated = 0;\n for (int v=0;v<n;v++)\n {\n if (dset % 2) // v???dset?????????\n {\n dominated |= c_neighbor[v];\n }\n dset = dset >> 1;\n }\n if (dominated == (1<<n)-1) return true;\n else return false;\n}\n\nint main()\n{\n int n, m;\n int u, v;\n while (cin >> n >> m)\n {\n bool found = false;\n\n if (n == 0) return 0;\n for (int i=0;i<n;i++) c_neighbor[i]=1<<i;\n for (int i=0;i<m;i++)\n {\n cin >> u >> v;\n c_neighbor[u] |= (1<<v);\n c_neighbor[v] |= (1<<u);\n }\n\n int dset;\n for (int k=1;k<=n;k++)\n {\n // {0,...,n-1}?????¨???????????§????????????k??§???????????????????????????\n // ????????°???????????°????????????????????£??¬???????????????????????§\n dset = (1 << k) - 1;\n while (dset < 1<<n)\n {\n if (is_dominating_set(dset, n))\n {\n cout << k << endl;\n found = true;\n }\n if (found) break;\n\n int x = dset & -dset;\n int y = dset + x;\n dset = ((dset & ~y) / x >> 1) | y;\n }\n if (found) break;\n }\n }\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 1160,
"score_of_the_acc": -0.1105,
"final_rank": 6
},
{
"submission_id": "aoj_1015_1641166",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nvector<int> adj_list[30];\n\n// Check whether a set dset of size k is a dominating set of a graph\n// of n vertices.\nbool is_dominating_set(int dset, int n)\n{\n bool dominated[30];\n int rem = n; // ??????????????????????????????????????°\n\n for (int i=0;i<n;i++) dominated[i]=false;\n for (int v=0;v<n;v++)\n {\n int vm = 1<<v; // ??????v?????´??°??¨???\n int im;\n if (vm & dset) // v???dset?????????\n {\n for (int i=0;i<adj_list[v].size();i++)\n {\n int w = adj_list[v][i];\n if (!dominated[w]) { dominated[w] = true; rem--; }\n }\n }\n }\n if (rem == 0) return true;\n else return false;\n}\n\nint main()\n{\n int n, m;\n int u, v;\n while (cin >> n >> m)\n {\n bool found = false;\n\n if (n == 0) return 0;\n for (int i=0;i<n;i++) adj_list[i].clear();\n for (int i=0;i<n;i++) adj_list[i].push_back(i);\n for (int i=0;i<m;i++)\n {\n cin >> u >> v;\n adj_list[u].push_back(v);\n adj_list[v].push_back(u);\n }\n int Delta = 0; // ?????§?¬???°\n for (int i=0;i<n;i++) Delta = max(Delta, (int)adj_list[i].size());\n\n int dset;\n for (int k=n/Delta;k<=n;k++)\n {\n // {0,...,n-1}?????¨???????????§????????????k??§???????????????????????????\n // ????????°???????????°????????????????????£??¬???????????????????????§\n dset = (1 << k) - 1;\n while (dset < 1<<n)\n {\n if (is_dominating_set(dset, n))\n {\n cout << k << endl;\n found = true;\n }\n if (found) break;\n\n int x = dset & -dset;\n int y = dset + x;\n dset = ((dset & ~y) / x >> 1) | y;\n }\n if (found) break;\n }\n }\n}",
"accuracy": 1,
"time_ms": 470,
"memory_kb": 1216,
"score_of_the_acc": -0.185,
"final_rank": 8
},
{
"submission_id": "aoj_1015_1641162",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nvector<int> adj_list[30];\n\n// Check whether a set dset of size k is a dominating set of a graph\n// of n vertices.\nbool is_dominating_set(int dset, int n)\n{\n bool dominated[30];\n int rem = n; // ??????????????????????????????????????°\n\n for (int i=0;i<30;i++) dominated[i]=false;\n for (int v=0;v<n;v++)\n {\n int vm = 1<<v; // ??????v?????´??°??¨???\n int im;\n if (vm & dset) // v???dset?????????\n {\n for (int i=0;i<adj_list[v].size();i++)\n {\n int w = adj_list[v][i];\n if (!dominated[w]) { dominated[w] = true; rem--; }\n }\n }\n }\n if (rem == 0) return true;\n else return false;\n}\n\nint main()\n{\n int n, m;\n int u, v;\n while (cin >> n >> m)\n {\n bool found = false;\n\n if (n == 0) return 0;\n for (int i=0;i<n;i++) adj_list[i].clear();\n for (int i=0;i<n;i++) adj_list[i].push_back(i);\n for (int i=0;i<m;i++)\n {\n cin >> u >> v;\n adj_list[u].push_back(v);\n adj_list[v].push_back(u);\n }\n\n int dset;\n for (int k=1;k<=n;k++)\n {\n // {0,...,n-1}?????¨???????????§????????????k??§???????????????????????????\n // ????????°???????????°????????????????????£??¬???????????????????????§\n dset = (1 << k) - 1;\n while (dset < 1<<n)\n {\n if (is_dominating_set(dset, n))\n {\n cout << k << endl;\n found = true;\n }\n if (found) break;\n\n int x = dset & -dset;\n int y = dset + x;\n dset = ((dset & ~y) / x >> 1) | y;\n }\n if (found) break;\n }\n }\n}",
"accuracy": 1,
"time_ms": 470,
"memory_kb": 1216,
"score_of_the_acc": -0.185,
"final_rank": 8
},
{
"submission_id": "aoj_1015_1641103",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nbool matrix[30][30];\n\n// Check whether a set dset of size k is a dominating set of a graph\n// of n vertices.\nbool is_dominating_set(int dset, int n)\n{\n bool dominated[30];\n int rem = n; // ??????????????????????????????????????°\n\n for (int i=0;i<30;i++) dominated[i]=false;\n for (int v=0;v<n;v++)\n {\n int vm = 1<<v; // ??????v?????´??°??¨???\n int im;\n if (vm & dset) // v???dset?????????\n {\n if (!dominated[v]) { dominated[v] = true; rem--; }\n for (int i=0;i<n;i++)\n if (matrix[v][i] && !dominated[i]) { dominated[i] = true; rem--; }\n }\n }\n if (rem == 0) return true;\n else return false;\n}\n\n\nint main()\n{\n int n, m;\n int u, v;\n while (cin >> n >> m)\n {\n bool found = false;\n\n if (n == 0) return 0;\n for (int i=0;i<n;i++) for (int j=0;j<n;j++) matrix[i][j]=false;\n for (int i=0;i<m;i++)\n {\n cin >> u >> v;\n matrix[u][v] = matrix[v][u] = true;\n }\n\n int dset;\n for (int k=1;k<=n;k++)\n {\n // {0,...,n-1}?????¨???????????§????????????k??§???????????????????????????\n // ????????°???????????°????????????????????£??¬???????????????????????§\n dset = (1 << k) - 1;\n while (dset < 1<<n)\n {\n if (is_dominating_set(dset, n))\n {\n cout << k << endl;\n found = true;\n }\n if (found) break;\n\n int x = dset & -dset;\n int y = dset + x;\n dset = ((dset & ~y) / x >> 1) | y;\n }\n if (found) break;\n }\n }\n}",
"accuracy": 1,
"time_ms": 1430,
"memory_kb": 1160,
"score_of_the_acc": -0.3763,
"final_rank": 12
},
{
"submission_id": "aoj_1015_1113142",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nvector<int>g[40];\nint v[40];\nint deg[40];\npair<int,int>pt[40];\nint n;\nint dfs(int a){\n\tif(a==n){\n\t\treturn 0;\n\t}\n\tint ret=999999999;\n\tv[pt[a].second]=-1;\n\tbool ok=true;\n\tfor(int i=0;i<=a;i++){\n\t\tint f=pt[i].second;\n\t\tif(~v[f])continue;\n\t\tbool OK=false;\n\t\tfor(int j=0;j<g[f].size();j++)if(~v[g[f][j]]){OK=true;break;}\n\t\tif(!OK){ok=false;break;}\n\t}\n\tif(ok){\n\t\tret=min(ret,dfs(a+1));\n\t}\n\tv[pt[a].second]=1;\n\tret=min(ret,dfs(a+1)+1);\n\tv[pt[a].second]=0;\n\treturn ret;\n}\nint main(){\n\tint a,b;\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tn=a;\n\t\tfor(int i=0;i<a;i++)g[i].clear();\n\t\tfor(int i=0;i<a;i++)v[i]=0;\n\t\tfor(int i=0;i<b;i++){\n\t\t\tint p,q;scanf(\"%d%d\",&p,&q);\n\t\t\tg[p].push_back(q);g[q].push_back(p);\n\t\t\tdeg[p]++;deg[q]++;\n\t\t}\n\t\tint ret=0;\n\t\tfor(int i=0;i<a;i++)pt[i]=make_pair(deg[i],i);\n\t\tret=dfs(0);\n\t\tprintf(\"%d\\n\",ret);\n\t}\n}",
"accuracy": 1,
"time_ms": 4460,
"memory_kb": 1052,
"score_of_the_acc": -1.0107,
"final_rank": 20
},
{
"submission_id": "aoj_1015_1097397",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n\nusing namespace std;\n\nint b[30];\nvector<vector<int> > G;\n\nint dfs(int x,int u,int n){\n if(x<0)return n;\n int m=dfs(x-1,u|1<<x,n+1);\n bool f=false;\n for(auto e:G[x]){\n f|=!(b[e]&u)&&1<<x==(b[e]&-b[e]);\n }\n if(!f){\n m=min(m,dfs(x-1,u,n));\n }\n return m;\n}\n\nint main(){\n for(int x,y;cin>>x>>y,x|y;){\n G=vector<vector<int> >(x);\n for(int i=0;i<x;i++){\n b[i]=1<<i;\n G[i].push_back(i);\n }\n while(y--){\n int u,v;\n cin>>u>>v;\n b[u]|=1<<v;\n b[v]|=1<<u;\n G[v].push_back(u);\n G[u].push_back(v);\n }\n cout<<dfs(x-1,0,0)<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 680,
"memory_kb": 1216,
"score_of_the_acc": -0.2323,
"final_rank": 10
},
{
"submission_id": "aoj_1015_780678",
"code_snippet": "#include <algorithm>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nconstexpr int MAX_N = 30;\n\nint ans;\nint n, m;\nint cover[30];\nint used;\nint ok;\nvector<vector<int>> edges;\n\nvoid dfs(int idx, int sum) {\n\tif(sum >= ans) return;\n\tif(used == ok) {\n\t\tans = sum;\n\t\treturn;\n\t}\n\tif(idx == n) return;\n\n\tdfs(idx + 1, sum);\n\tconst int tmp = used;\n\tused |= cover[idx];\n\tdfs(idx + 1, sum + 1);\n\tused = tmp;\n}\n\nint solve() {\n\tused = 0;\n\tint cnt = 0;\n\tfor(int i = 0; i < n; ++i) {\n\t\tif(edges[i].size() == 0) {\n\t\t\tused |= (1 << i);\n\t\t\t++cnt;\n\t\t}\n\t\telse if(edges[i].size() == 1) {\n\t\t\tconst int neighbor = edges[i][0];\n\t\t\tif(used & (1 << neighbor)) continue;\n\t\t\tused |= cover[neighbor];\n\t\t\t++cnt;\n\t\t}\n\t}\n\n\tok = (1 << n) - 1;\n\tans = n - __builtin_popcount(used) + cnt;\n\tdfs(0, cnt);\n\treturn ans;\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\twhile(cin >> n >> m && n) {\n\t\tmemset(cover, 0, sizeof(cover));\n\t\tfor(int i = 0; i < n; ++i) {\n\t\t\tcover[i] = (1 << i);\n\t\t}\n\n\t\tedges.assign(n, vector<int>());\n\t\tfor(int i = 0; i < m; ++i) {\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tcover[a] |= (1 << b);\n\t\t\tcover[b] |= (1 << a);\n\t\t\tedges[a].emplace_back(b);\n\t\t\tedges[b].emplace_back(a);\n\t\t}\n\n\t\tcout << solve() << endl;\n\t}\n\n\treturn EXIT_SUCCESS;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 1216,
"score_of_the_acc": -0.0949,
"final_rank": 2
},
{
"submission_id": "aoj_1015_780674",
"code_snippet": "#include <algorithm>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nconstexpr int MAX_N = 30;\n\nint ans;\nint n, m;\nint cover[30];\nint used;\nvector<vector<int>> edges;\n\nvoid dfs(int idx, int sum) {\n\tif(sum >= ans) return;\n\tif(used == (1 << n) - 1) {\n\t\tans = sum;\n\t\treturn;\n\t}\n\tif(idx == n) return;\n\n\tdfs(idx + 1, sum);\n\tconst int tmp = used;\n\tused |= cover[idx];\n\tdfs(idx + 1, sum + 1);\n\tused = tmp;\n}\n\nint solve() {\n\tused = 0;\n\tint cnt = 0;\n\tfor(int i = 0; i < n; ++i) {\n\t\tif(edges[i].size() == 0) {\n\t\t\tused |= (1 << i);\n\t\t\t++cnt;\n\t\t}\n\t\telse if(edges[i].size() == 1) {\n\t\t\tconst int neighbor = edges[i][0];\n\t\t\tif(used & (1 << neighbor)) continue;\n\t\t\tused |= cover[neighbor];\n\t\t\t++cnt;\n\t\t}\n\t}\n\n\tans = n - __builtin_popcount(used) + cnt;\n\tdfs(0, cnt);\n\treturn ans;\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\twhile(cin >> n >> m && n) {\n\t\tmemset(cover, 0, sizeof(cover));\n\t\tfor(int i = 0; i < n; ++i) {\n\t\t\tcover[i] = (1 << i);\n\t\t}\n\n\t\tedges.assign(n, vector<int>());\n\t\tfor(int i = 0; i < m; ++i) {\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tcover[a] |= (1 << b);\n\t\t\tcover[b] |= (1 << a);\n\t\t\tedges[a].emplace_back(b);\n\t\t\tedges[b].emplace_back(a);\n\t\t}\n\n\t\tcout << solve() << endl;\n\t}\n\n\treturn EXIT_SUCCESS;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 1220,
"score_of_the_acc": -0.0967,
"final_rank": 4
},
{
"submission_id": "aoj_1015_780670",
"code_snippet": "#include <algorithm>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nconstexpr int MAX_N = 30;\n\nint ans;\nint n, m;\nint cover[30];\nint used;\nvector<vector<int>> edges;\n\nvoid dfs(int idx, int sum) {\n\tif(sum >= ans) return;\n\tif(used == (1 << n) - 1) {\n\t\tans = sum;\n\t}\n\tif(idx == n) return;\n\n\tdfs(idx + 1, sum);\n\tconst int tmp = used;\n\tused |= cover[idx];\n\tdfs(idx + 1, sum + 1);\n\tused = tmp;\n}\n\nint solve() {\n\tused = 0;\n\tint cnt = 0;\n\tfor(int i = 0; i < n; ++i) {\n\t\tif(edges[i].size() == 0) {\n\t\t\tused |= (1 << i);\n\t\t\t++cnt;\n\t\t}\n\t\telse if(!(used & (1 << i))) {\n\t\t\tfor(int j = 0; j < static_cast<int>(edges[i].size()); ++j) {\n\t\t\t\tif(edges[edges[i][j]].size() == 1) {\n\t\t\t\t\tused |= cover[i];\n\t\t\t\t\t++cnt;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tans = n - __builtin_popcount(used) + cnt;\n\tdfs(0, cnt);\n\treturn ans;\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\twhile(cin >> n >> m && n) {\n\t\tmemset(cover, 0, sizeof(cover));\n\t\tfor(int i = 0; i < n; ++i) {\n\t\t\tcover[i] = (1 << i);\n\t\t}\n\n\t\tedges.assign(n, vector<int>());\n\t\tfor(int i = 0; i < m; ++i) {\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tcover[a] |= (1 << b);\n\t\t\tcover[b] |= (1 << a);\n\t\t\tedges[a].emplace_back(b);\n\t\t\tedges[b].emplace_back(a);\n\t\t}\n\n\t\tcout << solve() << endl;\n\t}\n\n\treturn EXIT_SUCCESS;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 1220,
"score_of_the_acc": -0.0989,
"final_rank": 5
},
{
"submission_id": "aoj_1015_780667",
"code_snippet": "#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iterator>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n#define dump(a) (cerr << (#a) << \" = \" << (a) << endl)\n\ntemplate<class T> inline void chmax(T& a, const T& b) { if(b > a) a = b; }\ntemplate<class T> inline void chmin(T& a, const T& b) { if(b < a) a = b; }\n\ntemplate<typename T, typename U>\nostream& operator<<(ostream& os, const pair<T, U>& p) {\n\tos << '(' << p.first << \", \" << p.second << ')';\n\treturn os;\n}\n\ntemplate<class Tuple, unsigned Index>\nvoid print_tuple(ostream& os, const Tuple& t) {}\n\ntemplate<class Tuple, unsigned Index, class Type, class... Types>\nvoid print_tuple(ostream& os, const Tuple& t) {\n\tif(Index > 0) os << \", \";\n\tos << get<Index>(t);\n\tprint_tuple<Tuple, Index + 1, Types...>(os, t);\n}\n\ntemplate<class... Types>\nostream& operator<<(ostream& os, const tuple<Types...>& t) {\n\tos << '(';\n\tprint_tuple<tuple<Types...>, 0, Types...>(os, t);\n\treturn os << ')';\n}\n\ntemplate<class Iterator>\nostream& dump_range(ostream&, Iterator, const Iterator&);\n\ntemplate<typename T>\nostream& operator<<(ostream& os, vector<T> c) {\n\treturn dump_range(os, c.cbegin(), c.cend());\n}\n\ntemplate<class Iterator>\nostream& dump_range(ostream& os, Iterator first, const Iterator& last) {\n\tos << '[';\n\tfor(int i = 0; first != last; ++i, ++first) {\n\t\tif(i) os << \", \";\n\t\tos << *first;\n\t}\n\treturn os << ']';\n}\n\nint ans;\nint n, m;\nvector<int> cover;\nint used;\nvector<vector<int>> edges;\n\nvoid dfs(int idx, int sum) {\n\tif(sum >= ans) return;\n\n\tif(idx == n) {\n\t\tif(used == (1 << n) - 1) ans = sum;\n\t}\n\telse {\n\t\tdfs(idx + 1, sum);\n\t\tconst int tmp = used;\n\t\tused |= cover[idx];\n\t\tdfs(idx + 1, sum + 1);\n\t\tused = tmp;\n\t}\n}\n\nint solve() {\n\tcover.assign(n, 0);\n\tfor(int i = 0; i < n; ++i) {\n\t\tcover[i] |= (1 << i);\n\t\tfor(int j = 0; j < static_cast<int>(edges[i].size()); ++j) {\n\t\t\tcover[i] |= (1 << edges[i][j]);\n\t\t}\n\t}\n\n\tused = 0;\n\tint cnt = 0;\n\tfor(int i = 0; i < n; ++i) {\n\t\tif(edges[i].size() == 0) {\n\t\t\tused |= (1 << i);\n\t\t\t++cnt;\n\t\t}\n\t\telse if(!(used & (1 << i))) {\n\t\t\tfor(int j = 0; j < static_cast<int>(edges[i].size()); ++j) {\n\t\t\t\tif(edges[edges[i][j]].size() == 1) {\n\t\t\t\t\tused |= cover[i];\n\t\t\t\t\t++cnt;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tans = n - __builtin_popcount(used) + cnt;\n\tdfs(0, cnt);\n\treturn ans;\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\twhile(cin >> n >> m && n) {\n\t\tedges.assign(n, vector<int>());\n\t\tfor(int i = 0; i < m; ++i) {\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tedges[a].emplace_back(b);\n\t\t\tedges[b].emplace_back(a);\n\t\t}\n\n\t\tcout << solve() << endl;\n\t}\n\n\treturn EXIT_SUCCESS;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 1216,
"score_of_the_acc": -0.0949,
"final_rank": 2
},
{
"submission_id": "aoj_1015_780664",
"code_snippet": "#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iterator>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n#define dump(a) (cerr << (#a) << \" = \" << (a) << endl)\n\ntemplate<class T> inline void chmax(T& a, const T& b) { if(b > a) a = b; }\ntemplate<class T> inline void chmin(T& a, const T& b) { if(b < a) a = b; }\n\ntemplate<typename T, typename U>\nostream& operator<<(ostream& os, const pair<T, U>& p) {\n\tos << '(' << p.first << \", \" << p.second << ')';\n\treturn os;\n}\n\ntemplate<class Tuple, unsigned Index>\nvoid print_tuple(ostream& os, const Tuple& t) {}\n\ntemplate<class Tuple, unsigned Index, class Type, class... Types>\nvoid print_tuple(ostream& os, const Tuple& t) {\n\tif(Index > 0) os << \", \";\n\tos << get<Index>(t);\n\tprint_tuple<Tuple, Index + 1, Types...>(os, t);\n}\n\ntemplate<class... Types>\nostream& operator<<(ostream& os, const tuple<Types...>& t) {\n\tos << '(';\n\tprint_tuple<tuple<Types...>, 0, Types...>(os, t);\n\treturn os << ')';\n}\n\ntemplate<class Iterator>\nostream& dump_range(ostream&, Iterator, const Iterator&);\n\ntemplate<typename T>\nostream& operator<<(ostream& os, vector<T> c) {\n\treturn dump_range(os, c.cbegin(), c.cend());\n}\n\ntemplate<class Iterator>\nostream& dump_range(ostream& os, Iterator first, const Iterator& last) {\n\tos << '[';\n\tfor(int i = 0; first != last; ++i, ++first) {\n\t\tif(i) os << \", \";\n\t\tos << *first;\n\t}\n\treturn os << ']';\n}\n\nint ans;\nint n, m;\nvector<int> cover;\nint used;\nvector<vector<int>> edges;\n\nvoid update(int value) {\n\tif(used == (1 << n) - 1) {\n\t\tans = value;\n\t}\n}\n\nvoid dfs(int idx, int sum) {\n\tif(sum >= ans) return;\n\n\tif(idx == n) {\n\t\tupdate(sum);\n\t}\n\telse {\n\t\tdfs(idx + 1, sum);\n\n\t\tint tmp = used;\n\t\tused |= cover[idx];\n\t\tdfs(idx + 1, sum + 1);\n\t\tswap(used, tmp);\n\t}\n}\n\nint solve() {\n\tcover.assign(n, 0);\n\tfor(int i = 0; i < n; ++i) {\n\t\tcover[i] |= (1 << i);\n\t\tfor(int j = 0; j < static_cast<int>(edges[i].size()); ++j) {\n\t\t\tcover[i] |= (1 << edges[i][j]);\n\t\t}\n\t}\n\n\tused = 0;\n\tint cnt = 0;\n\tfor(int i = 0; i < n; ++i) {\n\t\tif(edges[i].size() == 0) {\n\t\t\tused |= (1 << i);\n\t\t\t++cnt;\n\t\t}\n\t}\n\n\tans = n;\n\tdfs(0, cnt);\n\treturn ans;\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\twhile(cin >> n >> m && n) {\n\t\tedges.assign(n, vector<int>());\n\t\tfor(int i = 0; i < m; ++i) {\n\t\t\tint a, b;\n\t\t\tcin >> a >> b;\n\t\t\tedges[a].emplace_back(b);\n\t\t\tedges[b].emplace_back(a);\n\t\t}\n\n\t\tcout << solve() << endl;\n\t}\n\n\treturn EXIT_SUCCESS;\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 1212,
"score_of_the_acc": -0.1179,
"final_rank": 7
},
{
"submission_id": "aoj_1015_652267",
"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};\ntypedef vector<int> Node;\ntypedef vector<Node> Graph;\nint min_ans;\nint N, M;\nGraph G;\nint dfs(int k, int cur, vector<bool> adj){\n if(min_ans <= cur) return INF;\n if(k == N){\n REP(i, N) if(!adj[i]) return INF;\n return min_ans = cur;\n }\n int res = INF;\n res = min(res, dfs(k + 1, cur, adj));\n REP(i, G[k].size()){\n int u = G[k][i];\n adj[u] = true;\n }\n adj[k] = true;\n res = min(res, dfs(k + 1, cur + 1, adj));\n return res;\n}\nint main(){\n while(cin >> N >> M && N){\n G = Graph(N);\n vector<int> perm(N);\n REP(i, N) perm[i] = i;\n random_shuffle(perm.begin(), perm.end());\n REP(i, M){\n int a, b;\n cin >> a >> b;\n a = perm[a];\n b = perm[b];\n G[a].push_back(b);\n G[b].push_back(a);\n }\n min_ans = INF;\n vector<bool> adj(N, false);\n cout << dfs(0, 0, adj) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2480,
"memory_kb": 1236,
"score_of_the_acc": -0.6466,
"final_rank": 13
},
{
"submission_id": "aoj_1015_540377",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nconst int WHITE = 1;\nconst int BLACK = 2;\nconst int MAXV = 31;\nint V;\nvector<int> E[MAXV];\nint numD[MAXV];\nint color[MAXV];\nint ans;\n\nbool isValid() {\n bool flag[MAXV];\n fill(flag, flag+V, false);\n for(int i = 0; i < V; ++i) {\n if(color[i] == BLACK) {\n flag[i] = true;\n for(int j = 0; j < E[i].size(); ++j) {\n\tflag[E[i][j]] = true;\n }\n }\n }\n for(int i = 0; i < V; ++i) {\n if(!flag[i]) return false;\n }\n return true;\n}\n\nvoid rec(int p, int c) {\n if(p == V) {\n if(isValid()) {\n ans = min(ans, c);\n }\n return;\n }\n if(c >= ans) return;\n color[p] = BLACK;\n rec(p+1, c+1);\n color[p] = WHITE;\n rec(p+1, c);\n}\n\nint main() {\n int x, y;\n while(cin >> x >> y && (x|y)) {\n for(int i = 0; i < MAXV; ++i) E[i].clear();\n V = x;\n int a, b;\n while(y--) {\n cin >> a >> b;\n E[a].push_back(b);\n E[b].push_back(a);\n }\n ans = V;\n fill(numD, numD+MAXV, 0);\n rec(0, 0);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 770,
"memory_kb": 1216,
"score_of_the_acc": -0.2525,
"final_rank": 11
}
] |
aoj_1008_cpp
|
What Color Is The Universe?
On a clear night, a boy, Campanella looked up at the sky, there were many stars which have different colors such as red, yellow, green, blue, purple, etc. He was watching the stars and just lost track of time. Presently, he wondered,
"There are many stars in the space. What color is the universe if I look up it from outside?"
Until he found the answer to this question, he couldn't sleep. After a moment's thought, he proposed a hypothesis,
"When I observe the stars in the sky, if more than half of the stars have the same color, that is the color of the universe."
He has collected data of stars in the universe after consistently observing them. However, when he try to count the number of star, he was in bed sick with a cold. You decided to help him by developing a program to identify the color of the universe.
You are given an array
A
. Let |
A
| be the number of element in
A
, and let
N
m
be the number of
m
in
A
. For example, if
A
= {3, 1, 2, 3, 3, 1, 5, 3}, |
A
| = 8,
N
3
= 4,
N
1
= 2,
N
5
= 1. Your program have to find
m
such that:
N
m
> (|
A
| / 2 )
If there is no such
m
, you also have to report the fact. There is no
such
m
for the above example, but for a array
A
= {5, 2, 5, 3, 4, 5, 5}, 5 is the answer.
Input
There are several test cases. For each test case, in the first line |
A
| is given. In the next line, there will be |
A
| integers. The integers are less than 2
31
and |
A
| < 1,000,000. The input terminate with a line which contains single 0.
Output
For each test case, output
m
in a line. If there is no answer, output "NO COLOR" in a line.
Sample Input
8
3 1 2 3 3 1 5 3
7
5 2 5 3 4 5 5
0
Output for the Sample Input
NO COLOR
5
|
[
{
"submission_id": "aoj_1008_10850942",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n for (int t, n, r, i; cin>>n, n; printf(~r ? \"%d\\n\" : \"NO COLOR\\n\", r))\n {\n std::map<int, int> c;\n r = -1;\n for (i = 0; i++<n; r = ++c[t]> n / 2 ? t : r)\n cin >> t;\n }\n}",
"accuracy": 1,
"time_ms": 840,
"memory_kb": 5008,
"score_of_the_acc": -0.6122,
"final_rank": 9
},
{
"submission_id": "aoj_1008_10443938",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nbool isNumber(const string& s) {\n if (s.empty()) return false;\n if (s.size() > 1 && (s[0] == '-' || s[0] == '+')) {\n for (int i = 1; i < s.size(); i++) {\n if (!isdigit(s[i])) return false;\n }\n return true;\n }\n for (char ch : s) {\n if (!isdigit(ch)) return false;\n }\n return true;\n}\n\ndouble evalRPN(vector<string>& tokens) {\n stack<int> st;\n\n for (const string& token : tokens) {\n if (isNumber(token)) {\n st.push(stoi(token));\n } else {\n double b = st.top(); st.pop();\n double a = st.top(); st.pop();\n double result = 0;\n if (token == \"+\") result = a + b;\n else if (token == \"-\") result = a - b;\n else if (token == \"*\") result = a * b;\n else if (token == \"/\") result = a / b;\n st.push(result);\n }\n }\n\n return st.top();\n}\nint main() {\n // string line;\n // while (getline(cin, line) && !line.empty()) {\n // stringstream ss(line);\n // string token;\n // vector<string> tokens;\\\n // while (ss >> token) {\n // tokens.push_back(token);\n // }\n // cout << fixed << setprecision(6) << evalRPN(tokens) << '\\n';\n \n // }\n\n int n;\n\n while (cin >> n)\n {\n if(n == 0) return 0;\n vector<int> v(n);\n for(auto &it : v) cin >> it;\n unordered_map<int, int>mp;\n vector<int> ans;\n for(auto it : v) mp[it]++;\n for(auto it : mp) {\n if(it.second > n / 2) ans.push_back(it.first);\n }\n if(ans.size()) {\n for(auto it : ans) cout << it << '\\n';\n } else cout << \"NO COLOR\" << '\\n';\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 580,
"memory_kb": 9556,
"score_of_the_acc": -0.6897,
"final_rank": 11
},
{
"submission_id": "aoj_1008_10405827",
"code_snippet": "#include<bits/stdc++.h>\n#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);\n#define ll long long\nusing namespace std;\n\nint main() {\n fastio;\n \n int n;\n while (cin >> n && n != 0) {\n vector<int> arr(n);\n map<int, int> freq;\n \n for (int i = 0; i < n; i++) {\n cin >> arr[i];\n freq[arr[i]]++;\n }\n \n bool found = false;\n int result = 0;\n \n for (map<int, int>::iterator it = freq.begin(); it != freq.end(); it++) {\n int color = it->first;\n int count = it->second;\n \n if (count > n / 2) {\n found = true;\n result = color;\n break;\n }\n }\n \n if(found)\n cout << result << \"\\n\";\n\t\telse\n cout << \"NO COLOR\" << \"\\n\";\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 460,
"memory_kb": 10788,
"score_of_the_acc": -0.6669,
"final_rank": 10
},
{
"submission_id": "aoj_1008_10405809",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\nusing namespace std;\nint main() {\n long long n;\n while(cin >> n){\n if(n == 0){\n break;\n }\n map<long long, long long> num;\n long long half = n / 2, result = 0;\n for(long long i = 0 ; i < n ; i++){\n long long temp;\n cin >> temp;\n num[temp]++;\n if(num[temp] > half){\n result = temp;\n }\n }\n if(result == 0){\n cout << \"NO COLOR\\n\";\n }else{\n cout << result << \"\\n\";\n }\n }\n}",
"accuracy": 1,
"time_ms": 970,
"memory_kb": 5384,
"score_of_the_acc": -0.7527,
"final_rank": 13
},
{
"submission_id": "aoj_1008_9737100",
"code_snippet": "#include <bits/stdc++.h>\n\nsigned main() {\n int n;\n while (std::cin >> n) {\n if (!n) {\n return 0;\n }\n std::vector<int> a(n);\n for (int i = 0; i < n; i++) {\n std::cin >> a[i];\n }\n std::sort(a.begin(), a.end());\n if (std::count(a.begin(), a.end(), a[n / 2]) > n / 2) {\n std::cout << a[n / 2] << \"\\n\";\n } else {\n std::cout << \"NO COLOR\\n\";\n }\n }\n}",
"accuracy": 1,
"time_ms": 850,
"memory_kb": 8328,
"score_of_the_acc": -0.8456,
"final_rank": 15
},
{
"submission_id": "aoj_1008_9026226",
"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 map<int, int> mp;\n for (int i = 0; i < n; i++) {\n int a;\n cin >> a;\n mp[a] += 1;\n }\n int res = -1;\n for (auto p : mp)\n if (p.second + p.second > n) res = p.first;\n if (res == -1) {\n cout << \"NO COLOR\" << endl;\n } else {\n cout << res << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 480,
"memory_kb": 4684,
"score_of_the_acc": -0.2717,
"final_rank": 1
},
{
"submission_id": "aoj_1008_6419259",
"code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <deque>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\nusing ll = long long;\nconst double EPS = 1e-8;\nconst ll MAXN = 1e18;\nconst int INF = 0x3f3f3f3f;\nconst int N = 1e6 + 5;\n\nint a[N];\n\n\nint main(int argc, char* argv[]) {\n \n std::ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n int n, x;\nlabel:\n while(~scanf(\"%d\", &n)) {\n if(!n) break;\n map<int, int> m;\n for(int i = 0; i < n; i++) {\n scanf(\"%d\", &x);\n // m[a[i]]++;\n m[x]++;\n }\n double tmp = n / 2.0;\n for (auto i : m) {\n if (i.second > tmp) {\n printf(\"%d\\n\", i.first);\n goto label;\n }\n }\n puts(\"NO COLOR\");\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 500,
"memory_kb": 5060,
"score_of_the_acc": -0.3148,
"final_rank": 3
},
{
"submission_id": "aoj_1008_5916608",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) return 0;\n vector<int> a(n);\n for(int i = 0; i < n; i++){\n cin >> a[i];\n }\n vector<int> temp = a;\n sort(temp.begin(), temp.end());\n temp.erase(unique(temp.begin(), temp.end()), temp.end());\n for(int i = 0; i < n; i++) a[i] = lower_bound(temp.begin(), temp.end(), a[i]) - temp.begin();\n vector<int> cnt(temp.size());\n for(int i = 0; i < n; i++) cnt[a[i]]++;\n int ans = 0;\n for(int i = 0; i < (int)temp.size(); i++){\n if(2 * cnt[i] > n) ans = temp[i];\n }\n if(ans == 0) cout << \"NO COLOR\" << endl;\n else cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 830,
"memory_kb": 14036,
"score_of_the_acc": -1.214,
"final_rank": 19
},
{
"submission_id": "aoj_1008_5895057",
"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 int n;\n while(1){\n cin>>n;\n if(n==0) break;\n map<int,int>c;\n rep(i,n){\n int a;\n cin>>a;\n c[a]++;\n }\n int ans=-1;\n for(auto m:c){\n //cout<<m.second<<endl;\n if(m.second*2>n){\n ans=m.first;\n break;\n }\n }\n if(ans==-1) cout<<\"NO COLOR\"<<endl;\n else cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 840,
"memory_kb": 4880,
"score_of_the_acc": -0.6035,
"final_rank": 8
},
{
"submission_id": "aoj_1008_5585238",
"code_snippet": "#include<cstdio>\n#include<map>\nint main(){for(int t,n,r,i;scanf(\"%d\",&n),n;printf(~r?\"%d\\n\":\"NO COLOR\\n\",r)){std::map<int,int>c;r=-1;for(i=0;i++<n;r=++c[t]>n/2?t:r)scanf(\"%d\",&t);}}",
"accuracy": 1,
"time_ms": 570,
"memory_kb": 4200,
"score_of_the_acc": -0.3186,
"final_rank": 4
},
{
"submission_id": "aoj_1008_3872849",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include<bits/stdc++.h>\nusing namespace std;\n#ifndef FAST_IO\n #define IOS ios_base::sync_with_stdio(false);cin.tie(nullptr);\n#endif\n\n#define int long long\n#define FILE_IO freopen(\"input.txt\",\"r\",stdin)/#define int long long\n#define f first\n#define s second\n#define endl '\\n'\n#define all(c) c.begin(),c.end()\n#define bp __builtin_popcount\n#define debug(x) cerr << #x << \" = \" << x << endl;\n\nconst int MOD = 1e9 + 7;\nconst int INF = 1e18;\n\nmt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\ntemplate <typename T>void print(T t){for (auto &it : t) cout << it << \" \";}\ninline int powerexp(int a, int b, int m = MOD){ int res = 1;while(b){if(b&1)res = res * a % m;a = a * a % m,b >>= 1;}return res % m;}\ninline int modinv(int a){ return powerexp(a,MOD-2,MOD);}\ninline int lcm(int a, int b){ int g = __gcd(a,b);return a/g*b;}\ninline int add(int x, int y){ x += y; if (x >= MOD) x -= MOD; return x;}\ninline int mul(int x, int y){ return (x * 1ll * y) % MOD;}\ninline int sub(int x, int y){ x -= y; if (x<0) x += MOD; return x ;}\n\n//-------------------< start here >-------------------------// \n\nvoid solve(){\n \tint n;\n \twhile (cin >> n, n > 0){\n\t map<int, int> m;\n\t int ret;\n\t for (int i = 0; i < n; i++){\n\t\t int x;\n\t\t cin >> x;\n\t\t m[x]++; \n\t\t}\n\t bool ok = false;\n\t for (auto it : m){\n\t\t if (it.s > n / 2){\n\t\t\tok = true;\n\t\t\tret = it.f;\n\t\t\tbreak; \n\t\t }\n\t\t}\n\t if (ok) cout << ret << endl;\n\t else cout << \"NO COLOR\" << endl;\t\n\t}\n}\n\n//-----------------------------\n//comment from here for TOPCODER \nint32_t main(){\n IOS;\n solve();\n //find();\n #ifdef LOCAL_DEFINE\n cerr << \"time elapsed \" << (double)clock()/CLOCKS_PER_SEC << endl;\n #endif\n}",
"accuracy": 1,
"time_ms": 500,
"memory_kb": 5128,
"score_of_the_acc": -0.3194,
"final_rank": 5
},
{
"submission_id": "aoj_1008_3551881",
"code_snippet": "#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\n\n#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)\n#define DEBUGP(val) cerr << #val << \"=\" << val << \"\\n\"\n\nusing namespace std;\ntypedef long long int ll;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef pair<int, int> PI;\nconst ll mod = 1e9 + 7;\n\n\n\nint main(void) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n;\n while (cin >> n && n) {\n VI a(n);\n REP(i, 0, n) cin >> a[i];\n int cnt = 0;\n int cur = -1;\n REP(i, 0, n) {\n if (cnt == 0) {\n cur = a[i];\n cnt = 1;\n } else if (cur == a[i]) {\n cnt += 1;\n } else {\n cnt -= 1;\n }\n }\n cnt = 0;\n REP(i, 0, n) cnt += a[i] == cur;\n if (2 * cnt > n) {\n cout << cur << endl;\n } else {\n cout << \"NO COLOR\" << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 8260,
"score_of_the_acc": -0.2746,
"final_rank": 2
},
{
"submission_id": "aoj_1008_3379317",
"code_snippet": "#include<iostream>\n#include<map>\nusing namespace std;\n\nint main()\n{\n int n, c;\n map<int,int> m;\n\n while( cin >> n )\n {\n if( !n )\n break;\n\n int id = 0, max = 0;\n for( int i = 0; i < n; i++ )\n {\n cin >> c;\n\n if( m[c] == 0 )\n m[c] = 1;\n else\n m[c]++;\n\n if( m[c] > max )\n {\n max = m[c];\n id = c;\n }\n }\n if( max > n / 2 )\n cout << id << endl;\n else\n cout << \"NO COLOR\" << endl;\n m.clear();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1340,
"memory_kb": 4548,
"score_of_the_acc": -1.0235,
"final_rank": 18
},
{
"submission_id": "aoj_1008_3365780",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint main(){\n int n,f=-1;\n long num;\n cin >> n;\n while(n!=0){\n vector<long> ar;\n f=-1;\n for(int i=0;i<n;i++){\n cin >> num;\n ar.push_back(num);\n }\n sort(ar.begin(),ar.end());\n int i=0;\n while(i<n){\n num=ar[i];\n int j=i+1;\n while(num==ar[j]&&j<n){\n j++;\n }\n if(2*(j-i)>n){\n f=num;\n break;\n }\n i=j;\n }\n if(f==-1) cout<<\"NO COLOR\"<<endl;\n else cout << f<<endl;\n cin >> n;\n }\n}",
"accuracy": 1,
"time_ms": 890,
"memory_kb": 18984,
"score_of_the_acc": -1.6018,
"final_rank": 20
},
{
"submission_id": "aoj_1008_3168298",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\n\nint a[1000000];\n\nsigned main(){\n while(1){\n int n;\n cin>>n;\n if(n==0) break;\n for(int i=0;i<n;i++){\n cin>>a[i];\n }\n sort(a,a+n);\n int count=0,ans=0;\n if(n==1) cout<<a[0]<<endl;\n else{\n for(int i=0;i<n;i++){\n\tif(i==0) continue;\n\tif(a[i]==a[i-1]) count++;\n\tif(a[i]!=a[i-1]||i==n-1){\n\t if(2*(count+1)>n){\n\t cout<<a[i-1]<<endl;\n\t ans=1;\n\t break;\n\t }\n\t count=0;\n\t}\n }\n if(ans==0)\n\tcout<<\"NO COLOR\"<<endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 830,
"memory_kb": 10884,
"score_of_the_acc": -1.0008,
"final_rank": 17
},
{
"submission_id": "aoj_1008_3167876",
"code_snippet": "#include <bits/stdc++.h>\n#define full(c) c.begin(), c.end()\ntypedef signed long long int ll;\ntypedef unsigned long long int ull;\nusing namespace std;\n\nint main(){\n while(1){\n bool end=false;\n int i,n;\n map<int, int> cnt;\n cin>>n;\n if(n==0) break;\n for(i=0; i<n; i++){\n int a;\n cin>>a;\n cnt[a]++;\n if(cnt[a] > n/2){\n cout<<a<<endl;\n end=true;\n break;\n }\n if(end==true) break;\n }\n if(end == true){\n i++;\n while(i < n){\n int a;\n cin>>a;\n i++;\n }\n continue;\n }\n cout<<\"NO COLOR\"<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1230,
"memory_kb": 4596,
"score_of_the_acc": -0.9294,
"final_rank": 16
},
{
"submission_id": "aoj_1008_3167875",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nint main(){\n while(1){\n map<ll,ll> M;\n ll n;\n cin>>n;\n if(n==0){break;}\n for(int i=0;i<n;i++){\n ll a;\n cin>>a;\n M[a]++;\n }\n bool done=false;\n for(auto i=M.begin();i!=M.end();i++){\n if((*i).second>n/2){cout<<(*i).first<<endl; done=true; break;}\n }\n if(!done){cout<<\"NO COLOR\"<<endl;}\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 1070,
"memory_kb": 5144,
"score_of_the_acc": -0.8249,
"final_rank": 14
},
{
"submission_id": "aoj_1008_3120353",
"code_snippet": "#include<iostream>\n#include<map>\nusing namespace std;\n\nint main(){\n int n;\n while(scanf(\"%d\", &n), n){\n map<int,int> m;\n int a;\n for(int i = 0; i < n; i++){\n scanf(\"%d\", &a);\n m[a]++;\n }\n\n string res = \"NO COLOR\";\n for(auto p : m) if(p.second > n/2) res = to_string(p.first);\n printf(\"%s\\n\", res.c_str());\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 560,
"memory_kb": 4660,
"score_of_the_acc": -0.3408,
"final_rank": 6
},
{
"submission_id": "aoj_1008_3120352",
"code_snippet": "#include<iostream>\n#include<map>\nusing namespace std;\n\nint main(){\n int n;\n while(cin >> n, n){\n map<int,int> m;\n int a;\n for(int i = 0; i < n; i++){\n cin >> a;\n m[a]++;\n }\n\n string res = \"NO COLOR\";\n for(auto p : m) if(p.second > n/2) res = to_string(p.first);\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1000,
"memory_kb": 4788,
"score_of_the_acc": -0.7389,
"final_rank": 12
},
{
"submission_id": "aoj_1008_2697551",
"code_snippet": "#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nint main(){\n int n;\n while(cin>>n,n){\n int ans=-1;\n map<int,int>m;\n r(i,n){\n int a;\n scanf(\"%d\",&a);\n m[a]++;\n if(m[a]>n/2)ans=a;\n }\n if(ans==-1)cout<<\"NO COLOR\"<<endl;\n else cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 700,
"memory_kb": 4688,
"score_of_the_acc": -0.4666,
"final_rank": 7
}
] |
aoj_1019_cpp
|
Problem A:
Vampirish Night
There is a vampire family of
N
members. Vampires are also known as extreme gourmets. Of course vampires' foods are human blood. However, not all kinds of blood is acceptable for them. Vampires drink blood that
K
blood types of ones are mixed, and each vampire has his/her favorite amount for each blood type.
You, cook of the family, are looking inside a fridge to prepare dinner. Your first task is to write a program that judges if all family members' dinner can be prepared using blood in the fridge.
Input
Input file consists of a number of data sets.
One data set is given in following format:
N K
S
1
S
2
...
S
K
B
11
B
12
...
B
1
K
B
21
B
22
...
B
2
K
:
B
N
1
B
N
2
...
B
NK
N
and
K
indicate the number of family members and the number of blood types respectively.
S
i
is an integer that indicates the amount of blood of the
i
-th blood type that is in a fridge.
B
ij
is an integer that indicates the amount of blood of the
j
-th blood type that the
i
-th vampire uses.
The end of input is indicated by a case where
N
=
K
= 0. You should print nothing for this data set.
Output
For each set, print "
Yes
" if everyone's dinner can be prepared using blood in a fridge, "
No
" otherwise (without quotes).
Constraints
Judge data includes at most 100 data sets.
1 ≤
N
≤ 100
1 ≤
K
≤ 100
0 ≤
S
i
≤ 100000
0 ≤
B
ij
≤ 1000
Sample Input
2 3
5 4 5
1 2 3
3 2 1
3 5
1 2 3 4 5
0 1 0 1 2
0 1 1 2 2
1 0 3 1 1
0 0
Output for the Sample Input
Yes
No
|
[
{
"submission_id": "aoj_1019_10853907",
"code_snippet": "#include <stdio.h>\nint s[200],b[200][200],sum[200];\nint main()\n{\n int i,j,n,k;\n bool flag;\n while(scanf(\"%d%d\",&n,&k)==2)\n {\n if(n==0&&k==0)break;\n for(i=1;i<=k;i++)\n {\n scanf(\"%d\",&s[i]);\n }\n flag=1;\n for(i=1;i<=k;i++)sum[i]=0;\n for(i=1;i<=n;i++)\n {\n for(j=1;j<=k;j++)\n {\n scanf(\"%d\",&b[i][j]);\n sum[j]+=b[i][j];\n }\n\n }\n for(i=1;i<=k;i++)\n if(sum[i]>s[i]) flag=0;\n if(flag)printf(\"Yes\\n\");\n else printf(\"No\\n\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2940,
"score_of_the_acc": -0.645,
"final_rank": 2
},
{
"submission_id": "aoj_1019_9181189",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n \n int n, k, b, s[110];\n \n while(cin >> n >> k, n){\n vector<int> sum;\n string ans = \"Yes\";\n for(int i=0;i<k;i++) cin >> s[i];\n for(int i=0;i<n;i++){\n for(int j=0;j<k;j++){\n cin >> b;\n s[j] -= b;\n if(s[j]<0) ans = \"No\";\n }\n }\n cout << ans << endl;\n }\n \n return(0);\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3056,
"score_of_the_acc": -1.8166,
"final_rank": 15
},
{
"submission_id": "aoj_1019_8861914",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nconst int MAX_K = 1000;\n\nint main() {\n int N, K, i, j, S[MAX_K], B, a;\n\n while (a = 1, cin >> N >> K, N || K) {\n for (i = K; i--;)\n cin >> S[i];\n for (i = 0; i < N; ++i)\n for (j = K; j--;)\n cin >> B, S[j] -= B, S[j] < 0 ? a = 0 : 0;\n cout << (a ? \"Yes\" : \"No\") << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3000,
"score_of_the_acc": -1.7337,
"final_rank": 9
},
{
"submission_id": "aoj_1019_8861908",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main() {\n ios_base::sync_with_stdio(false);\n int N, K, B;\n while (cin >> N >> K, N || K) {\n vector<int> S(K);\n for (int i = K; i--;)\n cin >> S[i];\n for (int i = 0; i < N; ++i)\n for (int j = K; j--;)\n cin >> B, S[j] -= B;\n cout << (*min_element(S.begin(), S.end()) < 0 ? \"No\" : \"Yes\") << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3164,
"score_of_the_acc": -0.9763,
"final_rank": 6
},
{
"submission_id": "aoj_1019_8837202",
"code_snippet": "#include <iostream>\n#include <vector>\n\nint main() {\n std::ios_base::sync_with_stdio(false);\n\n int N, K, i, j, B;\n bool a;\n\n while (true) {\n std::cin >> N >> K;\n if (N == 0 && K == 0) {\n break;\n }\n\n std::vector<int> S(K);\n for (i = 0; i < K; ++i) {\n std::cin >> S[i];\n }\n\n a = true;\n for (i = 0; i < N; ++i) {\n for (j = 0; j < K; ++j) {\n std::cin >> B;\n S[j] -= B;\n if (S[j] < 0) {\n a = false;\n }\n }\n }\n\n std::cout << (a ? \"Yes\" : \"No\") << std::endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3124,
"score_of_the_acc": -0.9172,
"final_rank": 4
},
{
"submission_id": "aoj_1019_8837198",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n int N, K, i, j, B;\n bool a;\n while (a = true, cin >> N >> K, N || K) {\n vector<int> S(K); // Use std::vector instead of dynamic memory allocation\n\n for (i = 0; i < K; ++i) // Use a range-based for loop to read values into S\n cin >> S[i];\n\n for (i = 0; i < N; ++i) {\n for (j = 0; j < K; ++j) {\n cin >> B;\n S[j] -= B;\n }\n\n // Check if any value in S is negative\n for (j = 0; j < K; ++j) {\n if (S[j] < 0) {\n a = false;\n break;\n }\n }\n }\n\n cout << (a ? \"Yes\" : \"No\") << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3076,
"score_of_the_acc": -1.8462,
"final_rank": 17
},
{
"submission_id": "aoj_1019_8819615",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main() {\n int N, K, i, j, S[1000], B, a = 1;\n while (cin >> N >> K, N || K) {\n for (i = K; i--;)\n cin >> S[i];\n for (i = 0; i < N; ++i)\n for (j = K; j--;)\n cin >> B, S[j] -= B, S[j] < 0 ? a = 0 : 0;\n cout << (a ? \"Yes\" : \"No\") << endl;\n a = 1; // Reset the flag for next iteration\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 2980,
"score_of_the_acc": -1.7041,
"final_rank": 8
},
{
"submission_id": "aoj_1019_8819614",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\nint main() {\n int N, K;\n while (cin >> N >> K, N || K) {\n int a = 1;\n vector<int> S(K);\n for (int i = K; i--;)\n cin >> S[i];\n for (int i = 0; i < N; ++i)\n for (int j = K; j--;) {\n int B;\n cin >> B;\n S[j] -= B;\n if (S[j] < 0) a = 0;\n }\n cout << (a ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3052,
"score_of_the_acc": -1.8107,
"final_rank": 14
},
{
"submission_id": "aoj_1019_8819613",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nconst int MAX_K = 1e6; // assuming K does not exceed 1 million\nint S[MAX_K];\n\nint main() {\n int N, K, B;\n while (cin >> N >> K, N || K) {\n int a = 1;\n for (int i = K; i--;)\n cin >> S[i];\n for (int i = 0; i < N; ++i)\n for (int j = K; j--;) {\n cin >> B;\n S[j] -= B;\n if (S[j] < 0) a = 0;\n }\n cout << (a ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3004,
"score_of_the_acc": -1.7396,
"final_rank": 11
},
{
"submission_id": "aoj_1019_8819610",
"code_snippet": "#include <cstdio>\nconst int MAX_K = 1000; // Replace 1000 with maximum possible K\nint main() {\n int N, K, i, j, S[MAX_K], B, a;\n while (scanf(\"%d %d\", &N, &K), N || K) {\n a = 1;\n for (i = 0; i < K; ++i)\n scanf(\"%d\", &S[i]);\n for (i = 0; i < N; ++i)\n for (j = 0; j < K; ++j) {\n scanf(\"%d\", &B);\n S[j] -= B;\n }\n for (j = 0; j < K; ++j)\n if (S[j] < 0) {\n a = 0;\n break;\n }\n printf(\"%s\\n\", (a ? \"Yes\" : \"No\"));\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2504,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1019_8819606",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n int N, K, i, j, B, a;\n while (a = 1, cin >> N >> K, N || K) {\n vector<int> S(K);\n for (i = K; i--;)\n cin >> S[i];\n for (i = 0; i < N; ++i)\n for (j = K; j--;)\n cin >> B, S[j] -= B, S[j] < 0 ? a = 0 : 0;\n cout << (a ? \"Yes\" : \"No\") << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3076,
"score_of_the_acc": -1.8462,
"final_rank": 17
},
{
"submission_id": "aoj_1019_8807550",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main() {\n int N, K, i, j, *S, B;\n bool result;\n while (cin >> N >> K, N) {\n S = new int[K];\n for (i = K; i--;)\n cin >> S[i];\n result = true;\n for (i = 0; i < N; ++i)\n for (j = K; j--;)\n cin >> B, S[j] -= B, result = result && S[j] >= 0;\n cout << (result ? \"Yes\" : \"No\") << endl;\n delete[] S;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3068,
"score_of_the_acc": -1.8343,
"final_rank": 16
},
{
"submission_id": "aoj_1019_8215224",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int N, K, B, a;\n while (a = 1, cin >> N >> K, N || K) {\n vector<int> S(K);\n for (int i = K; i--;)\n cin >> S[i];\n for (int i = 0; i < N; ++i)\n for (int j = K; j--;)\n cin >> B, S[j] -= B, S[j] < 0 ? a = 0 : 0;\n cout << (a ? \"Yes\" : \"No\") << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3124,
"score_of_the_acc": -0.9172,
"final_rank": 4
},
{
"submission_id": "aoj_1019_8215211",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main() {\n int N, K, i, j, *S, B, a;\n while (a = 1, cin >> N >> K, N || K) {\n S = new int[K];\n for (i = K; i--;)\n cin >> S[i];\n for (i = N; i--;)\n for (j = K; j--;)\n cin >> B, S[j] -= B, S[j] < 0 ? a = 0 : 0;\n cout << (a ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3000,
"score_of_the_acc": -1.7337,
"final_rank": 9
},
{
"submission_id": "aoj_1019_8215210",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main() {\n int N, K, i, j, *S, B, a;\n while (a = 1, cin >> N >> K, N || K) {\n S = new int[K];\n for (i = K; i--;)\n cin >> S[i];\n for (i = 0; i < N; ++i)\n for (j = K; j--;)\n cin >> B, S[j] -= B, S[j] < 0 ? a = 0 : 0;\n cout << (a ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3004,
"score_of_the_acc": -1.7396,
"final_rank": 11
},
{
"submission_id": "aoj_1019_8207793",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int N, K, i, j, *S, B, a;\n while (a = 1, cin >> N >> K, N || K) {\n S = new int[K];\n for (i = K; i--;)\n cin >> S[i];\n for (i = 0; i < N; ++i)\n for (j = K; j--;)\n cin >> B, S[j] -= B, S[j] < 0 ? a = 0 : 0;\n cout << (a ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3084,
"score_of_the_acc": -1.858,
"final_rank": 19
},
{
"submission_id": "aoj_1019_8115615",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main() {\n int N, K, i, j, *S, B, a;\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n while (a = 1, cin >> N >> K, N || K) {\n S = new int[K];\n for (i = K; i--;)\n cin >> S[i];\n for (i = 0; i < N; ++i)\n for (j = K; j--;)\n cin >> B, S[j] -= B, S[j] < 0 ? a = 0 : 0;\n cout << (a ? \"Yes\" : \"No\") << endl;\n delete[] S; // free memory\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3032,
"score_of_the_acc": -0.7811,
"final_rank": 3
},
{
"submission_id": "aoj_1019_8115614",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main() {\n int N, K, i, j, B, a;\n while (a = 1, cin >> N >> K, N || K) {\n int S[K];\n for (i = 0; i < K; ++i)\n cin >> S[i];\n for (i = 0; i < N; ++i)\n for (j = 0; j < K; ++j)\n cin >> B, S[j] -= B, S[j] < 0 ? a = 0 : 0;\n cout << (a ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3092,
"score_of_the_acc": -1.8698,
"final_rank": 20
},
{
"submission_id": "aoj_1019_8115612",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main() {\n int N, K, i, j, B, a;\n while (a = 1, cin >> N >> K, N || K) {\n int S[K];\n for (i = K; i--;)\n cin >> S[i];\n for (i = 0; i < N; ++i)\n for (j = K; j--;)\n cin >> B, S[j] -= B, S[j] < 0 ? a = 0 : 0;\n cout << (a ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3028,
"score_of_the_acc": -1.7751,
"final_rank": 13
},
{
"submission_id": "aoj_1019_8115611",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main() {\n int N, K, i, j, *S, B, a;\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n while (a = 1, cin >> N >> K, N || K) {\n S = new int[K];\n for (i = K; i--;)\n cin >> S[i];\n for (i = 0; i < N; ++i)\n for (j = K; j--;)\n cin >> B, S[j] -= B, S[j] < 0 ? a = 0 : 0;\n cout << (a ? \"Yes\" : \"No\") << endl;\n delete[] S;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3180,
"score_of_the_acc": -1,
"final_rank": 7
}
] |
aoj_1016_cpp
|
Problem H:
Fibonacci Sets
Fibonacci number
f
(
i
) appear in a variety of puzzles in nature and math, including packing problems, family trees or Pythagorean triangles. They obey the rule
f
(
i
) =
f
(
i
- 1) +
f
(
i
- 2), where we set
f
(0) = 1 =
f
(-1).
Let
V
and
d
be two certain positive integers and be
N
≡ 1001 a constant. Consider a set of
V
nodes, each node
i
having a Fibonacci label
F
[
i
] = (
f
(
i
) mod N) assigned for
i
= 1,...,
V
≤ N. If |
F
(
i
) -
F
(
j
)| <
d
, then the nodes
i
and
j
are connected.
Given
V
and
d
, how many connected subsets of nodes will you obtain?
Figure 1: There are 4 connected subsets for
V
= 20 and
d
= 100.
Input
Each data set is defined as one line with two integers as follows:
Line 1
: Number of nodes
V
and the distance
d
.
Input includes several data sets (i.e., several lines). The number of dat sets is less than or equal to 50.
Constraints
1 ≤ V ≤ 1000
1 ≤ d ≤ 150
Output
Output line contains one integer - the number of connected subsets - for each input line.
Sample Input
5 5
50 1
13 13
Output for the Sample Input
2
50
8
|
[
{
"submission_id": "aoj_1016_5581180",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nconst int MAXN = 1001;\n\nint P[MAXN], F[MAXN], V, D;\nvoid init(int N) { // 初期化 はじめは全ての頂点はバラバラ\n for (int i=0; i<=N; ++i) P[i] = i;\n}\nint root(int a) { // a の root(代表元) を求める\n if (P[a] == a) return a; // a は root\n return (root(P[a])); // a の親の root を求め，a の親とする\n}\nvoid unite(int a, int b) { // a と b を同一グループにまとめる\n P[root(a)] = root(b);\n}\nint count() {\n int var = 0;\n for (int i=1; i<=V; i++) {\n if (root(i) == i) var++;\n }\n return var;\n}\nint ft_abs(int a) {\n if (a >= 0) return a;\n return -a;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n F[0] = 1, F[1] = 2;\n for (int i=1; i<1001; i++) {\n F[i+1] = (F[i] + F[i-1]) % 1001; // ... F[i] に i 番目の Fibonacci 数 %1001 をあらかじめ計算, 代入しておく\n }\n while (cin >> V >> D) {\n init(V); // 木を初期化\n for (int i=1; i<=V; ++i) {\n for (int j=i+1; j<=V; ++j) {\n if (ft_abs(F[j]-F[i]) < D) { // (F[j] と F[i] の差の絶対値が D 未満だったら)\n unite(i, j); // グループ i とグループ j を同一化;\n }\n }\n }\n cout << count() << '\\n'; // i∈[1,V] に関して root(i) == i であるような数を数えて出力\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 3200,
"score_of_the_acc": -1.3635,
"final_rank": 20
},
{
"submission_id": "aoj_1016_3944910",
"code_snippet": "#include<algorithm>\n#include<bitset>\n#include<cassert>\n#include<cfloat>\n#include<climits>\n#include<cmath>\n#include<deque>\n#include<functional>\n#include<iomanip>\n#include<iostream>\n#include<map>\n#include<queue>\n#include<set>\n#include<stack>\n#include<string>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<vector>\n\nusing namespace std;\n\nusing lint = long long;\nusing P = pair<int, int>;\nusing LLP = pair<long long, long long>;\n\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 reps(i, n) for(int i = 1, i##_len = (int)(n) ; i <= i##_len ; ++i)\n#define rrep(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)\n#define rreps(i, n) for(int i = (int)(n) ; i > 0 ; --i)\n#define SORT(x) sort((x).begin(), (x).end())\n#define SORT_INV(x) sort((x).rbegin(), (x).rend())\n#define REVERSE(x) reverse((x).begin(), (x).end())\n#define TWINS(x) cout << ((x) ? \"Yay!\" : \":(\") << '\\n'\n#define endl '\\n'\n\nconstexpr int IINF = (1 << 30) - 1;\nconstexpr long long LLINF = 1LL << 61;\nconstexpr double EPS = 1e-10;\n\nconstexpr int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};\nconstexpr int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};\n\nclass UnionFind{\n vector<int> par;\n int groupCount;\n\npublic:\n UnionFind(int n = 0){\n init(n);\n }\n\n void init(int n = 0){\n par.resize(n);\n fill(par.begin(), par.end(), -1);\n\n groupCount = n;\n\n return;\n }\n\n int root(int x){\n if(par[x] < 0){\n return x;\n }\n return par[x] = root(par[x]);\n }\n\n bool same(int x, int y){\n return root(x) == root(y);\n }\n\n int size(int x){\n return -par[root(x)];\n }\n\n bool unite(int x, int y){\n x = root(x);\n y = root(y);\n\n if(x == y){\n return false;\n }\n\n if(par[y] < par[x]){\n swap(x, y);\n }\n\n par[x] += par[y];\n par[y] = x;\n --groupCount;\n\n return true;\n }\n\n int size(void){\n return groupCount;\n }\n};\n\ntemplate<typename T>\nbool chmax(T& a, T b){\n if(a < b){\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<typename T>\nbool chmin(T& a, T b){\n if(b < a){\n a = b;\n return true;\n }\n return false;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n\n constexpr int n = 1001;\n\n int fib[n + 1];\n fib[0] = 1;\n fib[1] = 2;\n REP(i, 2, n + 1){\n fib[i] = (fib[i - 1] + fib[i - 2]) % n;\n }\n\n int v, d;\n while(cin >> v >> d){\n UnionFind uf(v + 1);\n for(int i = 1 ; i <= v ; ++i){\n for(int j = 1 ; j <= v ; ++j){\n if(abs(fib[i] - fib[j]) < d){\n uf.unite(i, j);\n }\n }\n }\n cout << uf.size() - 1 << endl;\n }\n\n cout << flush;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3096,
"score_of_the_acc": -0.345,
"final_rank": 13
},
{
"submission_id": "aoj_1016_3679198",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <unordered_set>\n#include <algorithm>\n#include <cassert>\nusing namespace std;\n\nclass DisjointSet {\nprivate:\n\tconst int vertex_n;\n\tvector<int> P;\t\t//添え字の頂点の根\n\tvector< unordered_set<int> > Set;\t\t//添え字の頂点に子として繋がっている頂点の集合\npublic:\n\tDisjointSet(int n);\n\tvoid unite(int x, int y);\n\tbool same(int x, int y);\n\tint tree_number();\n};\n\nDisjointSet::DisjointSet(int n) : vertex_n(n), P(n), Set(n) {\n\tfor (int i = 0; i<n; ++i) {\n\t\tP[i] = i;\n\t\tSet[i].insert(i);\n\t}\n}\n\nvoid DisjointSet::unite(int x, int y) {\n\tif (P[x] == P[y])\n\t\treturn;\n\tint big, small;\n\tif (Set[P[x]].size() >= Set[P[y]].size()) {\n\t\tbig = P[x];\n\t\tsmall = P[y];\n\t}\n\telse {\n\t\tbig = P[y];\n\t\tsmall = P[x];\n\t}\n\tfor (auto i = Set[small].begin(); i != Set[small].end(); ++i) {\n\t\tP[*i] = big;\n\t\tSet[big].insert(*i);\n\t}\n}\n\nbool DisjointSet::same(int x, int y) {\n\treturn P[x] == P[y];\n}\n\nint DisjointSet::tree_number() {\n\tint sum = 0;\n\tfor (int i = 0; i < vertex_n; i++)\n\t\tif (P[i] == i)\n\t\t\tsum++;\n\treturn sum;\n}\n\nconst int N = 1001;\nint F[1001];\n\nint main() {\n\tint V, d;\n\tF[0] = 1; F[1] = 2;\n\tfor (int i = 2; i < N; i++)\n\t\tF[i] = (F[i - 1] % N + F[i - 2] % N) % N;\n\twhile (cin >> V >> d) {\n\t\tDisjointSet fs(V + 1);\n\t\tfor (int i = 1; i <= V; i++)\n\t\t\tfor (int j = i + 1; j <= V; j++) {\n\t\t\t\tif (max(F[i], F[j]) - min(F[i], F[j]) < d)\n\t\t\t\t\tfs.unite(i, j);\n\t\t\t}\n\t\tcout << fs.tree_number() - 1 << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3228,
"score_of_the_acc": -0.3685,
"final_rank": 14
},
{
"submission_id": "aoj_1016_3317761",
"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\nvoid dfs(int i, const vector<vector<int>> &g, vector<bool> &used) {\n used[i] = true;\n FOE(j, g[i]) {\n if (not used[j]) {\n dfs(j, g, used);\n }\n }\n}\n\nint main() {\n cin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tvector<int> fib(1100);\n\tfib[0] = 1;\n\tfib[1] = 2;\n\tFOR(i, 2, fib.size()) {\n\t fib[i] = (fib[i - 1] + fib[i - 2]) % 1001;\n\t}\n\n\tint V, D;\n while (cin >> V >> D) {\n\n vector<vector<int>> g(V + 1);\n FOR(i, 1, V + 1) {\n FOR(j, 1, V + 1) {\n if (abs(fib[i] - fib[j]) < D) {\n g[i].emplace_back(j);\n g[j].emplace_back(i);\n }\n }\n }\n\n int ans = 0;\n vector<bool> used(V, false);\n FOR(i, 1, V + 1) {\n if (used[i]) {\n continue;\n }\n ans++;\n dfs(i, g, used);\n }\n print(ans);\n\n }\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 6772,
"score_of_the_acc": -1.1111,
"final_rank": 19
},
{
"submission_id": "aoj_1016_3246037",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cstdlib>\n#include <utility>\n#include <algorithm>\n\nusing namespace std;\n\nconst int N = 1001;\nvector<int> F, djset, szset;\n//vector<pair<int, pair<int, int>>> G;\n\nint root(int v)\n{\n int r = djset[v];\n while (r != djset[r]) r = djset[r];\n djset[v] = r;\n return r;\n}\n\nbool same(int v1, int v2)\n{\n return (root(v1) == root(v2));\n}\n\nvoid unite(int v1, int v2)\n{\n int r[2] = {root(v1), root(v2)};\n if (szset[r[1]] > szset[r[0]]) swap(r[0], r[1]);\n djset[r[1]] = r[0];\n szset[r[0]] += szset[r[1]];\n szset[r[1]] = 0;\n}\n\nint main(void)\n{\n int V, D;\n F.resize(N);\n F[0] = 2;\n F[1] = 3;\n for (int i = 2; i < N; i++) F[i] = (F[i - 1] + F[i - 2]) % N;\n while (cin >> V >> D)\n {\n djset.resize(V);\n szset.resize(V, 1);\n for (int i = 0; i < V; i++) djset[i] = i;\n for (int i = 0; i < V; i++)\n {\n for (int j = 0; j < V; j++)\n {\n if (abs(F[i] - F[j]) >= D || same(i, j)) continue;\n unite(i, j);\n }\n }\n int ans = 0;\n for (auto i : szset) if (i) ans++;\n cout << ans << endl;\n djset.clear();\n szset.clear();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3040,
"score_of_the_acc": -0.335,
"final_rank": 12
},
{
"submission_id": "aoj_1016_2192276",
"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\nconst int N = 1001;\nint v, d;\nint f[100100];\n\nstruct UnionFind{\n\tint par[201000];\n\tint rank[201000];\n\n\tvoid init(int n){\n\t\tfor (int i = 0; i < 201000; i++){\n\t\t\tpar[i] = i;\n\t\t\trank[i] = 1;\n\t\t}\n\t}\n\n\tint find(int x){\n\t\tif (par[x] == x) return x;\n\t\treturn par[x] = find(par[x]);\n\t}\n\n\tvoid unite(int x, int y){\n\t\tx = find(x);\n\t\ty = find(y);\n\t\tif (x == y)return;\n\t\tif (rank[x] < rank[y]){\n\t\t\tpar[x] = y;\n\t\t}\n\t\telse{\n\t\t\tpar[y] = x;\n\t\t\tif (rank[y] == rank[x])rank[x]++;\n\t\t}\n\t}\n\n\tbool same(int x, int y){\n\t\treturn find(x) == find(y);\n\t}\n};\n\nUnionFind uf;\n\nint main(){\n\tf[0] = 1, f[1] = 2;\n\tFOR(i,2, 10000){\n\t\tf[i] = f[i - 1] + f[i - 2];\n\t\tf[i] %= N;\n\t}\n\twhile (cin >> v >> d){\n\t\tset<int> si;\n\t\tuf.init(v);\n\t\tREP(i, v){\n\t\t\tREP(j, v){\n\t\t\t\tif (abs(f[i + 1] - f[j + 1]) < d)uf.unite(i + 1, j + 1);\n\t\t\t}\n\t\t}\n\t\tREP(i, v){\n\t\t\tsi.insert(uf.find(i + 1));\n\t\t}\n\t\tcout << si.size() << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4620,
"score_of_the_acc": -0.6721,
"final_rank": 16
},
{
"submission_id": "aoj_1016_1990280",
"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};\nconst int N = 1001;\n\nvector<int> g[N+4];\nll v,d;\nvoid add_edge(int from,int to){\n g[from].push_back(to);\n g[to].push_back(from);\n}\nvector<ll> f(N+4,0);\n\nvoid dfs(int k,int c){\n if(f[k] == c) return ;\n f[k] = c;\n for(auto &&e : g[k]){\n dfs(e,c);\n }\n}\n\nint solve(){\n int res = 0;\n f = vector<ll>(N+4,0);\n REP(i,2,v+2){\n if(f[i] == 0){\n ++res;\n dfs(i,res);\n }\n }\n return res;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int fib[N+4];\n fib[0] = 1,fib[1] = 1;\n REP(i,2,N+4){\n fib[i] = (fib[i-1] + fib[i-2]) % N;\n }\n while(cin >> v >> d){\n rep(i,N+4){\n g[i].clear();\n }\n REP(i,2,v+2){\n REP(j,i+1,v+2){\n if(abs(fib[i] - fib[j]) < d){\n add_edge(i,j);\n }\n }\n }\n cout << solve()<< endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5060,
"score_of_the_acc": -0.6949,
"final_rank": 18
},
{
"submission_id": "aoj_1016_1984825",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define all(v) (v).begin(),(v).end()\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\n\nstruct UF{\n vector<int>par,sz;\n void init(int n){\n par.resize(n);\n sz.resize(n);\n for(int i=0;i<n;i++){\n par[i]=i;\n sz[i]=1;\n }\n }\n int find(int x){\n return x==par[x]?x:par[x]=find(par[x]);\n }\n void unite(int x,int y){\n x=find(x);y=find(y);\n if(x==y)return;\n sz[x]+=sz[y];\n par[y]=x;\n }\n bool same(int x,int y){\n return find(x)==find(y);\n }\n int size(int x){\n return sz[find(x)];\n }\n};\n\nsigned main(){\n int V,d;\n while(cin>>V>>d){\n int a=1,b=1;\n UF uf;uf.init(V);\n int F[1000];\n rep(i,V){\n F[i]=(a+b)%1001;\n\n b=a;a=F[i];\n }\n rep(i,V)rep(j,V)if(abs(F[i]-F[j])<d)uf.unite(i,j);\n int ans=0;\n rep(i,V)if(uf.find(i)==i)ans++;\n cout<<ans<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2984,
"score_of_the_acc": -0.325,
"final_rank": 11
},
{
"submission_id": "aoj_1016_1902974",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nstruct UnionFind{\n vector<int> data;\n UnionFind(int n)\n {\n data.assign(n, -1);\n }\n int find(int k)\n {\n if(data[k] < 0) return k;\n return data[k] = find(data[k]);\n }\n void unite(int x, int y)\n {\n x = find(x), y = find(y);\n if(x == y) return;\n if(x > y) swap(x, y);\n data[x] += data[y];\n data[y] = x;\n }\n int size(int k)\n {\n return -data[find(k)];\n }\n};\n\nint memo[1010];\n\nint fib(int v)\n{\n if(v <= 0) return 1;\n if(~memo[v]) return memo[v];\n return memo[v] = (fib(v-1) + fib(v-2)) % 1001;\n}\n\nint main()\n{\n int V, d;\n int F[1010];\n memset(memo, -1, sizeof(memo));\n for(int i = 0; i < 1000; i++) F[i] = fib(i+1);\n while(cin >> V >> d){\n UnionFind uf(V);\n for(int i = 0; i < V; i++){\n for(int j = i+1; j < V; j++){\n\tif(abs(F[i] - F[j]) < d) uf.unite(i, j);\n }\n }\n int cnt = 0;\n for(int i = 0; i < V; i++){\n if(uf.data[i] < 0) cnt++;\n }\n cout << cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.0086,
"final_rank": 1
},
{
"submission_id": "aoj_1016_1902776",
"code_snippet": "#include <bits/stdc++.h>\n#define N 1001\nusing namespace std;\nint V,d;\nint used[1010];\nint f[1010]={2,3};\n\nvoid dfs(int pos){\n if(used[pos])return;\n used[pos]=1;\n for(int i=0;i<V;i++)if(abs(f[pos]-f[i])<d) dfs(i);\n}\n\n\nint main(){\n\n for(int i=2;i<1010;i++) f[i]=(f[i-2]+f[i-1])%N;\n \n while(cin>>V>>d){\n memset(used,0,sizeof(used));\n int ans=0;\n for(int i=0;i<V;i++) if(!used[i])ans++,dfs(i);\n cout <<ans<<endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1196,
"score_of_the_acc": -0.062,
"final_rank": 4
},
{
"submission_id": "aoj_1016_1792128",
"code_snippet": "#include<iostream>\n#include<set>\nusing namespace std;\n\nint nlist[1010];\n\nint abs(int a){\n return ((a > 0) ?(a) : (-(a)));\n}\n\nint parent(int i){\n if(nlist[i] == i) return i;\n return (nlist[i]=parent(nlist[i]));\n}\n\nint main(){\n int v,d;\n int fib[1010];\n fib[0]=fib[1]=1;\n for(int i=2;i<1010;i++){\n fib[i] = (fib[i-1]+fib[i-2])%1001;\n }\n while(cin>>v>>d){\n set<int> s;\n for(int i=0;i<v;i++) nlist[i]=i;\n for(int i=0;i<v;i++){\n for(int j=i+1;j<v;j++){\n\tif(abs(fib[i+2]-fib[j+2]) < d){\n\t nlist[parent(j)] = parent(nlist[i]);\n\t} \n }\n }\n for(int i=0;i<v;i++) s.insert(parent(i));\n cout<<s.size()<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1204,
"score_of_the_acc": -0.0634,
"final_rank": 5
},
{
"submission_id": "aoj_1016_1653435",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cstdlib>\nusing namespace std;\n\nconst int N = 1001;\nint F[1001];\nint V, d;\n\nvector<int> Alist[1001];\n\nint f(int n)\n{\n if (n == -1) return 1;\n else if (n == 0) return 1;\n else if (n <= 1000) return F[n];\n else return -1;\n}\n\nvoid dfs(int v, bool *visited)\n{\n visited[v] = true;\n for (int i=0;i<Alist[v].size();i++)\n {\n int w = Alist[v][i];\n if (!visited[w]) dfs(w, visited);\n }\n return;\n}\n\n\nint num_components()\n{\n bool visited[1001];\n int n = 0;\n for (int i=1;i<=V;i++) visited[i]=false;\n for (int v=1;v<=V;v++)\n {\n if (!visited[v])\n {\n dfs(v, visited);\n n++;\n }\n }\n return n;\n}\n\nint main()\n{\n while (cin >> V >> d)\n {\n for (int i=1;i<=V;i++)\n F[i] = ((f(i-1) % N)+ (f(i-2) % N)) % N;\n\n for (int i=1;i<=V;i++) Alist[i].clear();\n for (int i=1;i<=V;i++)\n {\n for (int j=i+1;j<=V;j++)\n {\n if (abs(f(i)-f(j)) < d)\n {\n Alist[i].push_back(j);\n Alist[j].push_back(i);\n }\n }\n } // Graph created\n int res = num_components();\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3192,
"score_of_the_acc": -0.4176,
"final_rank": 15
},
{
"submission_id": "aoj_1016_1594214",
"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 V, d;\nvector< vector< int > > adj;\nvector< bool > vis;\nvector< int > F;\n\nvoid dfs(int v) {\n\tvis[v] = true;\n\tfor (int u : adj[v]) if (!vis[u]) dfs(u);\n}\n\nint main() {\n\tvector< int > F(1001);\n\tF[0] = 1; F[1] = 2;\n\t\n\tfor_(i,2,1001) F[i] = (F[i - 1] + F[i - 2]) % 1001;\n\t\n\twhile (cin >> V >> d) {\n\t\tadj.assign(V + 1, vector< int >());\n\t\t\n\t\tfor_(u,1,V+1) for_(v,u+1,V+1) {\n\t\t\tif (abs(F[u] - F[v]) < d) {\n\t\t\t\tadj[u].push_back(v);\n\t\t\t\tadj[v].push_back(u);\n\t\t\t}\n\t\t}\n\t\t\n\t\tvis.assign(V + 1, false);\n\t\t\n\t\tint ans = 0;\n\t\t\n\t\tfor_(v,1,V+1) {\n\t\t\tif (vis[v]) continue;\n\t\t\tdfs(v);\n\t\t\t++ans;\n\t\t}\n\t\t\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4976,
"score_of_the_acc": -0.68,
"final_rank": 17
},
{
"submission_id": "aoj_1016_1590436",
"code_snippet": "#include <iostream>\n#include <cstdlib>\n#include <cmath>\n\nusing namespace std;\n\nlong long F[1001];\n\nint P[10010];\nvoid init(int N){\n for(int i=0;i<=N;i++)\n P[i] = i;\n}\n\nint root(int a){\n if(P[a]==a)\n return a;\n return(P[a] = root(P[a]));\n}\n\nbool is_same_set(int a, int b){\n return root(a) == root(b);\n}\n\nvoid unit(int a, int b){\n P[root(a)] = root(b);\n}\n\nint main(){\n F[0] = 1; F[1]=2;\n for(int i=2;i<=1000;i++){\n F[i] = F[i-1]+F[i-2];\n F[i] %= 1001;\n }\n int V,d;\n while(cin >> V >> d){\n int count=0;\n init(V);\n for(int i=1;i<=V;i++){\n for(int j=i+1; j<=V;j++){\n if(abs(F[j]-F[i])<d){\n unit(i,j);\n }\n }\n }\n for(int i=1;i<=V;i++){\n if(root(i)==i)\n count++;\n }\n cout << count << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1180,
"score_of_the_acc": -0.0591,
"final_rank": 3
},
{
"submission_id": "aoj_1016_1586625",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <stack>\n#include <cstdlib>\n#include <queue>\n#include <vector>\n#include <set>\n#include <stdio.h>\n#include <cstdio>\nusing namespace std;\nint p[1005];\nint root(int a) {\n\tif (p[a] == a) return a;\n\treturn (p[a] = root(p[a]));\n}\nvoid unite(int a,int b){\n\tp[root(a)] = root(b);\n}\nvoid same(int a ,int b){\n\tif (root(a) == root(b)) cout << \"1\" <<endl;\n\telse cout << \"0\" << endl;\n}\nbool rcheck(int a){\n\tif (root(a) == a) return 1;\n\telse return 0;\n}\nlong long int F[1005];\nint main() {\n\tint V,D;\n\tF[0]=1, F[1] =2;\n\tfor (int i = 2;i< 1005;i++ ){\n\t\tF[i] = F[i-1]%1001 + F[i-2]%1001; \n\t\tF[i] = F[i]%1001;\n\t}\n\twhile ( cin >> V >> D) {\n\t\tint cou = 0;\n\t\tfor (int i = 0; i < 1001; i++){\n\t\tp[i] = i;\n\t\t}\n\t\tfor (int i=1;i <= V;i++) {\n\t\t\tfor (int j=i+1;j <= V;j++ ){\n\t\t\t\tif (F[j] - F[i] < D && F[j] - F[i] > - D )\n\t\t\t\t\tunite(i,j);\n\t\t\t}\n\n\t\t\t}\n\t\tfor (int i = 1;i <= V;i++){\n\t\t\tif (rcheck(i) == 1) {\n\t\t\t\tcou += 1;\n\t\t\t}\n\t\t}\n\t\tcout << cou << endl;\n}\n\t}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1172,
"score_of_the_acc": -0.1132,
"final_rank": 8
},
{
"submission_id": "aoj_1016_1581575",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <math.h>\n#include <stdio.h>\n#include <algorithm>\n#include <string>\n#include <map>\n#include <queue>\n#include <memory.h>\nusing namespace std;\n\nint par[1000];\nint Rank[1000];\n\nvoid init(int n) {\n for(int i = 0; i < n; i++) {\n par[i] = i;\n Rank[i] = 0;\n }\n}\n\nint find(int x) {\n if(par[x] == x) {\n return x;\n }\n return par[x] = find(par[x]);\n}\n\nvoid unite(int x, int y) {\n x = find(x);\n y = find(y);\n if(x == y) return;\n\n if(Rank[x] < Rank[y]) {\n par[x] = y;\n } else {\n par[y] = x;\n if(Rank[x] == Rank[y]) Rank[x]++;\n }\n}\n\nbool same(int x, int y) {\n return find(x) == find(y);\n}\n\nint main() {\n int V,d;\n long long fib[1000];\n fib[0] = 2L;\n fib[1] = 3L;\n for(int i = 2; i < 1000; i++) {\n fib[i] = (fib[i-1] + fib[i-2]) % 1001;\n }\n while(cin >> V >> d) {\n init(V);\n for(int i = 0; i < V; i++) {\n for(int j = 0; j < V; j++) {\n if(abs(fib[i] - fib[j]) < d) {\n unite(i,j);\n }\n }\n }\n int count = 0;\n for(int i = 0; i < V; i++) {\n if(find(i) == i) count++;\n }\n printf(\"%d\\n\",count);\n\n }\n\n\n\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1160,
"score_of_the_acc": -0.1111,
"final_rank": 7
},
{
"submission_id": "aoj_1016_1445436",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#define loop(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,a) loop(i,0,a)\n#define N 1001\nusing namespace std;\n\nint main(){\n\tint V,d;\n\twhile(cin>>V){\n\t\tcin>>d;\n\t\tint rank[V+1],parent[V+1],label[V+1];\n\t\tlabel[0]=1;\n\t\tlabel[1]=2;\n\t\trep(i,V+1){\n\t\t\trank[i]=1;\n\t\t\tparent[i]=i;\n\t\t\tif(i>=2)label[i]=(label[i-1]+label[i-2])%N;\n\t\t}\n\t\tloop(i,1,V+1){\n\t\t\tloop(j,1,V+1){\n\t\t\t\tif(abs(label[i]-label[j])<d){\n\t\t\t\t\tint now1=i,now2=j;\n\t\t\t\t\twhile(parent[now1]!=now1){\n\t\t\t\t\t\tnow1=parent[now1];\n\t\t\t\t\t}\n\t\t\t\t\twhile(parent[now2]!=now2){\n\t\t\t\t\t\tnow2=parent[now2];\n\t\t\t\t\t}\n\t\t\t\t\tif(rank[now1]>rank[now2]){\n\t\t\t\t\t\tparent[now2]=now1;\n\t\t\t\t\t}else if(rank[now1]<rank[now2]){\n\t\t\t\t\t\tparent[now1]=now2;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tparent[now2]=now1;\n\t\t\t\t\t\trank[now1]++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint cnt=0;\n\t\tloop(i,1,V+1){\n\t\t\tif(parent[i]==i)cnt++;\n\t\t}\n\t\tcout<<cnt<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1172,
"score_of_the_acc": -0.0577,
"final_rank": 2
},
{
"submission_id": "aoj_1016_1418247",
"code_snippet": "#include<iostream>\n#include<cmath>\n#include<vector>\n#include<string>\ntypedef unsigned long long ull;\n#define rep(i,a) for(int i=0;i<a;i++)\n#define loop(i,a,b) for(int i=a;i<b;i++)\nusing namespace std;\nconst double eps = 1e-10;\nconst double pi = acos(-1);\nconst double inf = (int)1e8;\n\nconst int MAX_N = 1001;\nint f[MAX_N+1] = {2,3};\n\nstruct Union_Find{\n vector<int> par,rank;\n \n void init(int n){\n par.resize(n); rank.resize(n);\n for(int i = 0 ; i < n ; i ++){\n par[i] = i;\n rank[i] = 0;\n }\n }\n \n int find(int s){\n if(par[s] == s)return s;\n return par[s] = find(par[s]);\n }\n\n void unite(int x,int y){\n int a = find(x), b = find(y);\n if(a==b)return ;\n if(rank[a] < rank[b]) par[a] = b;\n else{\n par[a] = b;\n if(rank[a] == rank[b]){\n\trank[b]++;\n }\n }\n }\n bool same(int x,int y){\n return find(x)==find(y);\n }\n\n bool size(int x,int y){\n return par.size();\n }\n};\n\nvoid fib_init(){\n loop(i,2,MAX_N+1){\n f[i] = (f[i-1] + f[i-2])%MAX_N;\n }\n}\n\nvoid solve(){\n fib_init();\n \n int V,D;\n while(cin>>V>>D){\n Union_Find uf;\n uf.init(V);\n int memo[MAX_N+1] = {0};\n rep(i,V){\n loop(j,i+1,V){\n\tif(abs(f[i]-f[j])<D){\n\t uf.unite(i,j);\n\t}\n }\n }\n int ans = 0;\n rep(i,V){\n int root = uf.find(i);\n if(memo[root]==0){\n\tmemo[root]=1;\n\tans ++;\n }\n }\n cout<<ans<<endl;\n \n }\n}\n\nint main(void){\n solve();\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1208,
"score_of_the_acc": -0.0641,
"final_rank": 6
},
{
"submission_id": "aoj_1016_1406978",
"code_snippet": "#ifndef _GLIBCXX_NO_ASSERT\n#include <cassert>\n#endif\n#include <cctype>\n#include <cerrno>\n#include <cfloat>\n#include <ciso646>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <csetjmp>\n#include <csignal>\n#include <cstdarg>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n\n//#ifdef __GXX_EXPERIMENTAL_CXX0X__\n#include <ccomplex>\n#include <cfenv>\n#include <cinttypes>\n#include <cstdbool>\n#include <cstdint>\n#include <ctgmath>\n#include <cwchar>\n#include <cwctype>\n//#endif\n\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n\n#include <array>\n//#include <atomic>\n#include <chrono>\n//#include <condition_variable>\n#include <forward_list>\n//#include <future>\n#include <initializer_list>\n//#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <system_error>\n//#include <thread>\n#include <tuple>\n#include <typeindex>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n\n\nusing namespace std;\n\ntemplate<typename T>\nclass UF\n{\npublic:\n\tUF ()\n\t{\n\t\tcount = 0;\n\t}\n\n\tvoid push ( T a )\n\t{\n\t\tM[a] = count;\n\t\tV.push_back ( count );\n\t\trank.push_back ( 0 );\n\t\tcount++;\n\t}\n\n\tvoid unite ( T a , T b )\n\t{\n\t\tlong long int x = find ( M[a] );\n\t\tlong long int y = find ( M[b] );\n\t\tif( x == y )return;\n\t\tif( rank[x] < rank[y] )\n\t\t{\n\t\t\tV[x] = y;\n\t\t} else\n\t\t{\n\t\t\tV[y] = x;\n\t\t\tif( rank[x] == rank[y] )rank[x]++;\n\t\t}\n\t}\n\tvoid merge ( T a , T b )\n\t{\n\t\tunite ( a , b );\n\t}\n\tbool same ( T a , T b )\n\t{\n\t\treturn find ( M[a] ) == find ( M[b] );\n\t}\n\tlong long int group ()\n\t{\n\t\tset<long long int>S;\n\t\tfor( long long int i = 0; i < V.size (); i++ )\n\t\t{\n\t\t\tS.insert ( find ( V[i] ) );\n\t\t}\n\t\treturn S.size ();\n\t}\n\nprivate:\n\tvector<long long int> V , rank;\n\tmap < T , long long int>M;\n\tlong long int count;\n\n\tlong long int find ( long long int x )\n\t{\n\t\tif( V[x] == x )return x;\n\t\telse return V[x] = find ( V[x] );\n\t}\n};\n\nint main ()\n{\n\tint V , d;\n\tint data[1001] = {};\n\tdata[0] = 2;\n\tdata[1] = 3;\n\tfor( size_t i = 2; i < 1001; i++ )\n\t{\n\t\tdata[i] = data[i - 1] + data[i - 2];\n\t\tdata[i] %= 1001;\n\t}\n\n\twhile( cin >> V >> d )\n\t{\n\t\tUF<int> uf;\n\t\tfor( size_t i = 0; i < V; i++ )\n\t\t{\n\t\t\tuf.push ( i );\n\t\t}\n\t\tfor( size_t i = 0; i < V; i++ )\n\t\t{\n\t\t\tfor( size_t j = i + 1; j < V; j++ )\n\t\t\t{\n\t\t\t\tif( abs ( data[i] - data[j] ) < d )\n\t\t\t\t{\n\t\t\t\t\tuf.merge ( i , j );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << uf.group () << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1304,
"score_of_the_acc": -0.1368,
"final_rank": 9
},
{
"submission_id": "aoj_1016_1406953",
"code_snippet": "#ifndef _GLIBCXX_NO_ASSERT\n#include <cassert>\n#endif\n#include <cctype>\n#include <cerrno>\n#include <cfloat>\n#include <ciso646>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <csetjmp>\n#include <csignal>\n#include <cstdarg>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n\n//#ifdef __GXX_EXPERIMENTAL_CXX0X__\n#include <ccomplex>\n#include <cfenv>\n#include <cinttypes>\n#include <cstdbool>\n#include <cstdint>\n#include <ctgmath>\n#include <cwchar>\n#include <cwctype>\n//#endif\n\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n\n#include <array>\n//#include <atomic>\n#include <chrono>\n//#include <condition_variable>\n#include <forward_list>\n//#include <future>\n#include <initializer_list>\n//#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <system_error>\n//#include <thread>\n#include <tuple>\n#include <typeindex>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n\n\nusing namespace std;\n\ntemplate<typename T>\nclass UF\n{\npublic:\n\tUF ()\n\t{\n\t\tcount = 0;\n\t}\n\tvoid push ( T a )\n\t{\n\t\tM[a] = count;\n\t\tV.push_back ( count );\n\t\trank.push_back ( 0 );\n\t\tcount++;\n\t}\n\n\tvoid unite ( T a , T b )\n\t{\n\t\tlong long int x = find ( M[a] );\n\t\tlong long int y = find ( M[b] );\n\t\tif( x == y )return;\n\t\tif( rank[x] < rank[y] )\n\t\t{\n\t\t\tV[x] = y;\n\t\t} else\n\t\t{\n\t\t\tV[y] = x;\n\t\t\tif( rank[x] == rank[y] )rank[x]++;\n\t\t}\n\t}\n\tvoid merge ( T a , T b )\n\t{\n\t\tunite ( a , b );\n\t}\n\tbool same ( T a , T b )\n\t{\n\t\treturn find ( M[a] ) == find ( M[b] );\n\t}\n\tlong long int group ()\n\t{\n\t\tset < long long int > S;\n\t\tfor( long long int i = 0; i < V.size (); i++ )\n\t\t{\n\t\t\tS.insert ( find ( V[i] ) );\n\t\t}\n\t\treturn S.size ();\n\t}\n\nprivate:\n\tvector<long long int>V , rank;\n\tmap < T , long long int>M;\n\tlong long int count;\n\n\tlong long int find ( long long int x )\n\t{\n\t\tif( V[x] == x )return x;\n\t\telse return V[x] = find ( V[x] );\n\t}\n};\n\nint main ()\n{\n\tint V , d;\n\tint data[1001] = {};\n\tdata[0] = 2;\n\tdata[1] = 3;\n\tfor( size_t i = 2; i < 1001; i++ )\n\t{\n\t\tdata[i] = data[i - 1] + data[i - 2];\n\t\tdata[i] %= 1001;\n\t}\n\n\twhile( cin >> V >> d )\n\t{\n\t\tUF<int>* uf = new UF < int > ;\n\t\tset<int>S;\n\t\tfor( size_t i = 0; i < V; i++ )\n\t\t{\n\t\t\t( *uf ).push ( i );\n\t\t}\n\t\tfor( size_t i = 0; i < V; i++ )\n\t\t{\n\t\t\tfor( size_t j = i + 1; j < V; j++ )\n\t\t\t{\n\t\t\t\tif( abs ( data[i] - data[j] ) < d )\n\t\t\t\t{\n\t\t\t\t\t( *uf ).merge ( i , j );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ( *uf ).group () << endl;\n\t\tdelete uf;\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1304,
"score_of_the_acc": -0.1368,
"final_rank": 9
}
] |
aoj_1025_cpp
|
Problem G:
Building Water Ways
In ancient times, Romans constructed numerous water ways to supply water to cities and industrial sites. These water ways were amongst the greatest engineering feats of the ancient world.
These water ways contributed to social infrastructures which improved people's quality of life. On the other hand, problems related to the water control and the water facilities are still interesting as a lot of games of water ways construction have been developed.
Your task is to write a program which reads a map and computes the minimum possible cost of constructing water ways from sources to all the cities.
As shown in Figure 1, the map is represented by
H
×
W
grid cells, where each cell represents source, city, flatland, or obstacle.
You can construct only one water way from a source, but there are no limitations on the length of that water way and it can provide water to any number of cities located on its path. You can not construct water ways on the obstacles.
Your objective is to bring water to all the city and minimize the number of cells which represent water ways. In the Figure 1, water ways are constructed in 14 cells which is the minimum cost.
The water ways must satisfy the following conditions:
a water way cell is adjacent to at most 2 water way cells in four cardinal points.
a source cell is adjacent to at most 1 water way cell in four cardinal points.
there is no path from a source to other sources through water ways.
Input
The input consists of multiple datasets. Each dataset consists of:
H W
H
×
W
characters
The integers
H
and
W
are the numbers of rows and columns of the map.
H
×
W
characters denote the cells which contain:
'
P
': source
'
*
': city
'
.
': flatland
'
#
': obstacle
The end of input is indicated by a line containing two zeros separated by a space.
Output
For each dataset, print the minimum cost to construct the water ways.
Constraints
Judge data contains at most 60 data sets.
3 ≤
H
,
W
≤ 10
1 ≤ the number of sources, the number of cities ≤ 8
The map is surrounded by obstacles.
Sources are not adjacent each other(on the left, right, top and bottom)
There is a solution.
Sample Input
3 8
########
#P....*#
########
10 10
##########
#P.......#
#..#*....#
#..#*.#.*#
#.....#*.#
#*.......#
#..##....#
#...#.P..#
#P......P#
##########
0 0
Output for the Sample Input
5
14
|
[
{
"submission_id": "aoj_1025_1315022",
"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 _3_ 1\n\nusing namespace std;\n\ntypedef unsigned long long ull;\ntypedef pair<int,int> ii;\n\nstruct Point { int x,y; };\n\nconst int IINF = INT_MAX;\nconst char PATH = '$';\n\nint h,w,s_size,c_size,bitIndex[12][12];\nchar c[12][12];\nPoint source[12],city[12],path[12];\nint dx[] = {0,1,0,-1};\nint dy[] = {1,0,-1,0};\nint mini,blocks;\nint bc[1<<9];\n\nvoid dfs(int sp,int bitmask,int prev,int step,int depth){\n\n if( step+(c_size-bc[bitmask]) >= mini ) return;\n \n if( sp >= s_size ) return;\n\n if( bitmask == ((1<<c_size)-1) ) { mini = step; return; }\n\n bool next = 1;\n rep(dir,4){\n if( prev != -1 && ( prev + 2 ) % 4 == dir ) continue;\n int nx = path[sp].x + dx[dir], ny = path[sp].y + dy[dir];\n\n if( c[ny][nx] == 'P' || c[ny][nx] == '#' || c[ny][nx] == PATH ) continue;\n\n bool success = true;\n int cnt = 0;\n rep(i,4){\n int nx2 = nx + dx[i], ny2 = ny + dy[i];\n if( c[ny2][nx2] == PATH || c[ny2][nx2] == 'P' ) ++cnt;\n }\n if( cnt != 1 ) success = false;\n if( !success ) continue;\n \n Point pp = path[sp];\n char pc = c[ny][nx];\n int nbitmask = bitmask;\n bool fin = false;\n if( c[ny][nx] == '*' ) nbitmask |= (1<<bitIndex[ny][nx]), fin = true;\n\n path[sp] = (Point){nx,ny};\n c[ny][nx] = PATH;\n\n next = 0;\n dfs(sp,nbitmask,dir,step+1,depth+1);\n if( fin )dfs(sp+1,nbitmask,-1,step+1,0);\n\n path[sp] = pp;\n c[ny][nx] = pc;\n\n /*\n '*'?????£??\\??????????????´????????????????????????????????????????????????????????????????????????????????????\n ????????§??¨???????????¨??????'*'????????????????????¨?????????\n */\n if( fin ) return; \n\n }\n\n if( depth == 0 ) dfs(sp+1,bitmask,-1,step,0); \n} \n\nint compute(){\n mini = h*w-s_size - blocks;\n dfs(0,0,-1,0,0);\n return mini;\n}\n\n\n\nint main(){\n rep(i,(1<<9)) bc[i] = __builtin_popcount(i);\n while( scanf(\" %d %d\",&h,&w), h|w ){\n s_size = c_size = 0;\n blocks = 0;\n rep(i,h) rep(j,w) {\n scanf(\" %c\",&c[i][j]);\n if( c[i][j] == 'P' ) { source[s_size] = path[s_size] = (Point){j,i}; s_size++; }\n if( c[i][j] == '*' ) { city[c_size] = (Point){j,i}; bitIndex[i][j] = c_size++; }\n if( c[i][j] == '#' ) ++blocks;\n }\n printf(\"%d\\n\",compute());\n //print_field(); puts(\"\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 1192,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1025_1315000",
"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 _3_ 1\n\nusing namespace std;\n\n/*\n 15:25 - \n ?????????????????????????????????\n ??????????????????\n ??£??????\n ????????????????????¢????¨????\n ?????¨?????????????????????????°???????????????????????¶?????????????\n ---\n \n _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME?\n _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME?\n _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME?\n _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME?\n _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME?\n _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME?\n _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME?\n _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME? _3_ < DO YOU HAVE THE TIME?\n _3_ IT'S A QUATER TO TEN >\n _3_ !!\n \n*/\n\ntypedef unsigned long long ull;\ntypedef pair<int,int> ii;\n\nstruct Point { int x,y; };\n\nconst int IINF = INT_MAX;\nconst char PATH = '$';\n\nint h,w,s_size,c_size,bitIndex[12][12];\nchar c[12][12];\nPoint source[12],city[12],path[12];\nint limit,next_limit;\nint dx[] = {0,1,0,-1};\nint dy[] = {1,0,-1,0};\nint mini;\nint bc[1<<9];\nint mani[12];\n\nint initial_heuristic(){\n int sum = 0;\n rep(i,c_size) {\n mani[i] = IINF;\n rep(j,s_size) mani[i] = min(mani[i],abs(city[i].x-source[j].x)+abs(city[i].y-source[j].y));\n rep(j,c_size) if( j != i ) mani[i] = min(mani[i],abs(city[i].x-city[j].x)+abs(city[i].y-city[j].y));\n sum += mani[i];\n }\n return sum;\n}\n\n\nint get_heuristic(int sp,int bitmask){\n int sum = 0;\n rep(i,c_size) if( !( (bitmask>>i) & 1 ) ) {\n mani[i] = min(mani[i],abs(path[sp].x-city[i].x)+abs(path[sp].y-city[i].y));\n sum += mani[i];\n }\n return sum;\n}\n\n\n//typedef pair<ull,int> ullInt;\n//map<ullInt,int> mincost; \n//unordered_map<ull,int> mincost; \n//map<ull,int> mincost; \nbool head[12][12];\nbool opt[12][12];\n\nint blocks;\n\nvoid print_field(){\n rep(i,h) {\n rep(j,w){\n cout << c[i][j];\n } puts(\"\");\n }\n}\n\nvoid dfs(int sp,int bitmask,int prev,int step,int depth){\n\n /*\n cout << \"sp = \" << sp << \" step = \" << step << endl;\n print_field(); puts(\"\");\n */\n if( step+(c_size-bc[bitmask]) >= mini ) return;\n \n if( sp >= s_size ) return;\n\n if( bitmask == ((1<<c_size)-1) ) { \n //print_field(); puts(\"\"); \n mini = step; return; }\n\n //int h = get_heuristic(sp,bitmask);\n //if( step+h >= mini ) return;\n\n bool next = 1;\n rep(dir,4){\n if( prev != -1 && ( prev + 2 ) % 4 == dir ) continue;\n int nx = path[sp].x + dx[dir], ny = path[sp].y + dy[dir];\n\n if( c[ny][nx] == 'P' || c[ny][nx] == '#' || c[ny][nx] == PATH ) continue;\n\n bool success = true;\n int cnt = 0;\n rep(i,4){\n int nx2 = nx + dx[i], ny2 = ny + dy[i];\n if( c[ny2][nx2] == PATH || c[ny2][nx2] == 'P' ) ++cnt;\n }\n if( cnt != 1 ) success = false;\n if( !success ) continue;\n \n Point pp = path[sp];\n char pc = c[ny][nx];\n int nbitmask = bitmask;\n bool fin = false;\n char prec = c[ny][nx];\n if( c[ny][nx] == '*' ) nbitmask |= (1<<bitIndex[ny][nx]), fin = true;\n\n path[sp] = (Point){nx,ny};\n c[ny][nx] = PATH;\n //short mini_temp[8];\n //rep(i,c_size) mini_temp[i] = mani[i];\n swap(head[path[sp].y][path[sp].x],head[ny][nx]);\n\n next = 0;\n \n dfs(sp,nbitmask,dir,step+1,depth+1);\n if( prec == '*' )dfs(sp+1,nbitmask,-1,step+1,0);\n\n //rep(i,c_size) mani[i] = mini_temp[i];\n swap(head[path[sp].y][path[sp].x],head[ny][nx]);\n path[sp] = pp;\n c[ny][nx] = pc;\n\n //if( c_size-(int)__builtin_popcount(bitmask) == 1 ) return false;\n if( fin ) return;\n }\n //if( c[path[sp].y][path[sp].x] == '*' || current_step == 0 ) dfs(sp+1,bitmask,-1,step,0); \n //dfs(sp+1,bitmask,-1,step); \n if( depth == 0 || c[path[sp].y][path[sp].x] == 'P' || c[path[sp].y][path[sp].x] == '*' ) dfs(sp+1,bitmask,-1,step,0); \n} \n\nint compute(){\n //initial_heuristic();\n mini = h*w-s_size - blocks;\n int csv = 0;\n dfs(0,0,-1,0,0);\n return mini;\n}\n\n\n\nint main(){\n srand((unsigned int)time(NULL));\n rep(i,(1<<9)) bc[i] = __builtin_popcount(i);\n while( scanf(\" %d %d\",&h,&w), h|w ){\n s_size = c_size = 0;\n blocks = 0;\n rep(i,h) rep(j,w) {\n head[i][j] = false;\n scanf(\" %c\",&c[i][j]);\n if( c[i][j] == 'P' ) { source[s_size] = path[s_size] = (Point){j,i}; s_size++; head[i][j] = true; }\n if( c[i][j] == '*' ) { city[c_size] = (Point){j,i}; bitIndex[i][j] = c_size++; }\n if( c[i][j] == '#' ) ++blocks;\n }\n printf(\"%d\\n\",compute());\n //print_field(); puts(\"\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 1200,
"score_of_the_acc": -0.4,
"final_rank": 2
},
{
"submission_id": "aoj_1025_1166605",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nconstexpr int di[]={-1,1,0,0},dj[]={0,0,-1,1};\n\nint count(const vs& grid,int i,int j)\n{\n\tint cnt=0;\n\trep(k,4){\n\t\tint ni=i+di[k],nj=j+dj[k];\n\t\tcnt+=grid[ni][nj]=='P' || grid[ni][nj]=='W' || grid[ni][nj]=='C';\n\t}\n\treturn cnt;\n}\n\nvoid print(const vs& grid)\n{\n\tcout<<\"# grid:\"<<endl;\n\tfor(const auto& line:grid) cout<<line<<endl;\n}\n\nvoid solve(vs& grid,const vector<pii>& ps,int pi,int cnt,int rest,int& res);\n\nvoid dfs(vs& grid,int i,int j,const vector<pii>& ps,int pi,int cnt,int rest,int& res)\n{\n\tif(cnt>=res) return;\n\tint h=grid.size(),w=grid[0].size();\n\tif(rest==0){\n\t\tint tmp=0;\n\t\trep(i,h) rep(j,w) tmp+=grid[i][j]=='W' || grid[i][j]=='C';\n\t\tres=min(res,tmp);\n\t}\n\tif(grid[i][j]=='#' || grid[i][j]=='P' || count(grid,i,j)>=2) return;\n\t\n\tif(grid[i][j]=='*'){\n\t\tgrid[i][j]='C';\n\t\trep(k,4){\n\t\t\tint ni=i+di[k],nj=j+dj[k];\n\t\t\tdfs(grid,ni,nj,ps,pi,cnt+1,rest-1,res);\n\t\t}\n\t\tif(pi+1<ps.size()){\n\t\t\tint ni,nj; tie(ni,nj)=ps[pi+1];\n\t\t\tsolve(grid,ps,pi+1,cnt+1,rest-1,res);\n\t\t}\n\t\tgrid[i][j]='*';\n\t}\n\telse{\n\t\tgrid[i][j]='W';\n\t\trep(k,4){\n\t\t\tint ni=i+di[k],nj=j+dj[k];\n\t\t\tdfs(grid,ni,nj,ps,pi,cnt+1,rest,res);\n\t\t}\n\t\tgrid[i][j]='.';\n\t}\n}\n\nvoid solve(vs& grid,const vector<pii>& ps,int pi,int cnt,int rest,int& res)\n{\n\tif(pi==ps.size()) return;\n\tsolve(grid,ps,pi+1,cnt,rest,res);\n\tint i,j; tie(i,j)=ps[pi];\n\trep(k,4) dfs(grid,i+di[k],j+dj[k],ps,pi,cnt,rest,res);\n}\n\n\nint main()\n{\n\tfor(int h,w;cin>>h>>w && h|w;){\n\t\tvs grid(h);\n\t\trep(i,h) cin>>grid[i];\n\t\t\n\t\tvector<pii> ps;\n\t\trep(i,h) rep(j,w) if(grid[i][j]=='P') ps.emplace_back(i,j);\n\t\t\n\t\tint rest=0; rep(i,h) rep(j,w) rest+=grid[i][j]=='*';\n\t\tint res=INF;\n\t\tsolve(grid,ps,0,0,rest,res);\n\t\tcout<<res<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 350,
"memory_kb": 1212,
"score_of_the_acc": -2,
"final_rank": 3
}
] |
aoj_1022_cpp
|
Problem D:
Indian Puzzle
In the Indian Puzzle, one is intended to fill out blanks with numbers and operators in a
n
by
n
grid in order to make equalities in the grid true (See Figure 1).
Figure 1
A blank cell should be filled out with a number (from 0 to 9 inclusive) or an operator (
+
,
-
,
×
,
÷
,
=
), and black cells split equalities. Initially, some cells are already filled with numbers or operators.
The objective of this puzzle is to fill out all the blank cells with numbers (from 0 to 9 inclusive) and operators (
+
,
-
,
×
,
÷
) in a given list. All the numbers and operators in the list must be used to fill out the blank cells.
A equality is organized by more than 2 consecutive left-to-right or top-to-bottom white cells. You can assume that a equality contains exactly one cell with '
=
' which connects two expressions.
The expressions conform to the order of operations and semantics of conventional four arithmetic operations. First, do all multiplication and division, starting from the left (top). Then, do all addition and subtraction, starting from the left (top). In addition, this puzzle has the following rules:
Division by zero and division leaving a remainder, are not allowed.
Leading zeros are not allowed.
Unary operators like
3×-8=-24
are not allowed.
In a formal description, the equality must conform the syntax in the following BNF:
<Eq> ::= <Ex> = <Ex>
<Ex> ::= <N0> | <Ex> <Op> <N0>
<N0> ::= <N> | 0
<N> ::= <D> | <N> <D> | <N> 0
<Op> ::= + | - | × | ÷
<D> ::= 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
Of course, puzzle creators must make solvable puzzle.
Your task is to write a program which verifies whether given puzzle is solvable or not.
Input
Input consists of several datasets. Each dataset consists of:
H W
H
×
W
characters
n
n
characters
The integers
H
and
W
are the numbers of rows and columns of the grid, respectively.
H
×
W
characters denote the grid which contains '
.
' representing a blank cell, '
#
' representing a black cell, numbers (from
0
to
9
inclusive), operators('
+
','
-
', '
*
', '
/
', '
=
')(
×
is represented by '
*
' and
÷
is represented by '
/
').
The integer
n
is the number of characters in the list. The last line of a dataset contains
n
characters indicating numbers and operators for the blank cells.
The end of input is indicated by a line containing two zeros separated by a space.
Output
For each dataset, print "
Yes
" if the given puzzle is solvable, "
No
" if not.
Constraints
Judge data includes at most 100 data sets.
H
,
W
≤ 10
n
≤ 10
Sample Input
5 5
4=..2
+#=#+
.-2=.
=#*#=
.-.=3
6
7 3 1 4 / 8
1 6
8..3=2
2
2 +
0 0
Output for the Sample Input
Yes
No
|
[
{
"submission_id": "aoj_1022_10853930",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <string>\n#include <queue>\nusing namespace std;\n#define SZ(v) ((int)(v).size())\nconst int maxint = -1u>>1;\nconst int maxn = 10 + 2;\n//const int dx[] = {-1, 1, 0, 0};\n//const int dy[] = {0, 0, -1, 1};\n\nint n, m, k, cnt;\nchar s[maxn][maxn], d[maxn];\npair<int, int> rec[maxn];\nbool used[maxn];\n\nbool out(int x, int y) {\n return x < 0 || y < 0 || x >= n || y >= m;\n}\nbool isop(char c) {\n return c == '+' || c == '-' || c == '*' || c == '/';\n}\nbool calc(int &x1, int x2, char op) {\n if (op == '+') x1 += x2;\n else if (op == '-') x1 -= x2;\n else if (op == '*') x1 *= x2;\n else if (op == '/') {\n if (x2 == 0 || x1 % x2) return false;\n x1 /= x2;\n }\n return true;\n}\nbool calc_exp(char *s, int n, int &val) {\n if (n == 0) return false;\n int now = 0;\n vector<int> num;\n vector<char> op;\n for (int i = 0; i <= n; ++i) {\n if (i == n || s[i] == '+' || s[i] == '-') {\n num.push_back(now);\n now = 0;\n while (num.size() > 1) {\n int x2 = num.back();\n num.pop_back();\n int x1 = num.back();\n num.pop_back();\n if (!calc(x1, x2, op.back())) return false;\n op.pop_back();\n num.push_back(x1);\n }\n if (i != n) op.push_back(s[i]);\n } else if (isdigit(s[i])) {\n now = now * 10 + s[i] - '0';\n } else if (s[i] == '*' || s[i] == '/') {\n num.push_back(now);\n now = 0;\n while (op.size() > 0 && (op.back() == '*' || op.back() == '/')) {\n int x2 = num.back();\n num.pop_back();\n int x1 = num.back();\n num.pop_back();\n if (!calc(x1, x2, op.back())) return false;\n op.pop_back();\n num.push_back(x1);\n }\n op.push_back(s[i]);\n }\n }\n val = num[0];\n return true;\n}\nbool legal_exp(char *s, int n, int &val) {\n //printf(\"%s %d\\n\", s, n);\n for (int i = 0; i < n; ++i) {\n if (i + 1 < n && s[i] == '0' && isdigit(s[i + 1]) && (i == 0 || !isdigit(s[i - 1]))) return false;\n //if ((i == 0 || i == n - 1) && isop(s[i])) return false;\n //if (i + 1 < n && isop(s[i]) && isop(s[i + 1])) return false;\n }\n if (!calc_exp(s, n, val)) return false;\n return true;\n}\nbool legal_equility(char *s, int n) {\n if (n <= 2) return true;\n int x = -1;\n for (int i = 0; i < n; ++i) {\n if (s[i] == '=') {\n if (x >= 0) return false;\n x = i;\n }\n }\n if (x == -1) return false;\n for (int i = 0; i < n; ++i) {\n if ((i == 0 || i == n - 1) && isop(s[i])) return false;\n if (i + 1 < n && isop(s[i]) && isop(s[i + 1])) return false;\n if (i + 1 < n && isop(s[i]) && s[i + 1] == '=') return false;\n if (i - 1 >= 0 && isop(s[i]) && s[i - 1] == '=') return false;\n }\n for (int i = 0; i < n; ++i) {\n if (s[i] == '.') return true;\n }\n int x1, x2;\n //puts(\"ok\");\n if (!legal_exp(s, x, x1) || !legal_exp(s + x + 1, n - x - 1, x2)) return false;\n //printf(\"x1 %d x2 %d\\n\", x1, x2);\n return x1 == x2;\n}\nbool check_ori() {\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) {\n if (s[i][j] == '#') continue;\n int k = j + 1;\n while (k < m && s[i][k] != '#') ++k;\n if (!legal_equility(s[i] + j, k - j)) return false;\n j = k;\n }\n }\n char str[maxn];\n int len;\n for (int j = 0; j < m; ++j) {\n for (int i = 0; i < n; ++i) {\n if (s[i][j] == '#') continue;\n len = 0;\n while (i + len < n && s[i + len][j] != '#') {\n str[len] = s[i + len][j];\n ++len;\n }\n if (!legal_equility(str, len)) return false;\n i += len;\n }\n }\n return true;\n}\n\nbool ok(int x1, int x2) {\n int lf = x2, rt = x2;\n while (lf >= 0 && s[x1][lf] != '#') --lf;\n while (rt < m && s[x1][rt] != '#') ++rt;\n ++lf;\n --rt;\n if (!legal_equility(s[x1] + lf, rt - lf + 1)) return false;\n char str[maxn];\n int len = 0;\n while (x1 >= 0 && s[x1][x2] != '#') --x1;\n ++x1;\n while (x1 < n && s[x1][x2] != '#') {\n str[len++] = s[x1++][x2];\n }\n if (!legal_equility(str, len)) return false;\n return true;\n}\n\nbool dfs(int dep) {\n if (dep == cnt) {\n return true;\n }\n for (int i = 0; i < k; ++i) {\n if (used[i]) continue;\n if (i > 0 && d[i] == d[i - 1] && !used[i - 1]) continue;\n s[rec[dep].first][rec[dep].second] = d[i];\n used[i] = true;\n if (ok(rec[dep].first, rec[dep].second) && dfs(dep + 1)) return true;\n used[i] = false;\n s[rec[dep].first][rec[dep].second] = '.';\n }\n return false;\n}\n\nbool check() {\n if (cnt > k) return false;\n if (!check_ori()) return false;\n memset(used, 0, sizeof(used));\n if (!dfs(0)) return false;\n return true;\n}\nbool cmp(char x1, char x2) {\n return x1 < x2;\n}\nint main() {\n //char st[100];\n //while (scanf(\"%s\", st) && strcmp(st, \"0\")) {\n //bool flag = legal_equility(st, strlen(st));\n //printf(\"%d\\n\", flag);\n //}\n //return 0;\n //int val;\n //bool flag = legal_exp(st, strlen(st), val);\n //printf(\"%d %d\\n\", val, flag);\n //}\n //printf(\"0\\n\");\n //freopen(\"0.out\", \"w\", stdout);\n while (scanf(\"%d%d\", &n, &m) == 2 && (n + m)) {\n cnt = 0;\n for (int i = 0; i < n; ++i) {\n scanf(\"%s\", s[i]);\n for (int j = 0; j < m; ++j) {\n if (s[i][j] == '.') rec[cnt++] = make_pair(i, j);\n }\n }\n scanf(\"%d\", &k);\n if (k > 10) while (1);\n //char str[10];\n for (int i = 0; i < k; ++i) {\n do {\n d[i] = getchar();\n } while (!isdigit(d[i]) && !isop(d[i]));\n }\n sort(d, d + k, cmp);\n //d[k] = 0; printf(\"%s\\n\", d);\n bool flag = check();\n if (flag) printf(\"Yes\\n\");\n else printf(\"No\\n\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3276,
"score_of_the_acc": -0.0665,
"final_rank": 1
},
{
"submission_id": "aoj_1022_10683078",
"code_snippet": "#ifdef _DEBUG\n#define _GLIBCXX_DEBUG\n#endif\n#include <bits/stdc++.h>\nusing namespace std;\n#include <atcoder/all>\nusing namespace atcoder;\n// #include <boost/rational.hpp>\n// using namespace boost;\n// using rat = rational<long long int>;\nusing mint = modint998244353;\n// using mint = modint1000000007;\n// using mint = mint;\nusing ll = long long;\nusing ld = long double;\nusing ull = uint64_t;\nusing pll = pair<ll, ll>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vpll = vector<pll>;\nusing vvpll = vector<vpll>;\nusing vm = vector<mint>;\nusing vvm = vector<vm>;\nusing vvvm = vector<vvm>;\nusing vstr = vector<string>;\n#define v(T) vector<T>\n#define vv(T) vector<vector<T>>\n#define vvv(T) vector<vector<vector<T>>>\n#define vvvv(T) vector<vector<vector<vector<T>>>>\n\nistream &operator>>(istream &is, mint &a){ll tmp; is >> tmp; a = tmp; return is;}\nostream &operator<<(ostream &os, const mint &a){ os << a.val(); return os; }\nstring to_string(const __int128_t &a) { if (a == 0) return \"0\"; string s = \"\"; __int128_t num = a; bool is_negative = false; if (num < 0) { is_negative = true; num = -num; } while (num > 0) { s += '0' + (num % 10); num /= 10; } if (is_negative) s += '-'; reverse(s.begin(), s.end()); return s; }\nistream &operator>>(istream &is, __int128_t &a){ string s; is >> s; a = 0; for(char c : s) { if(isdigit(c)) {a = a*10 + (c - '0'); } } if(s[0]=='-'){ a *= -1; } return is; }\nostream &operator<<(ostream &os, const __int128_t &a){ os << to_string(a); return os; }\ntemplate<class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { is >> p.first >> p.second; return is; }\ntemplate<class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << p.first << \" \" << p.second; return os; }\ntemplate<class T> istream &operator>>(istream &is, vector<T> &vec){ for(T &e : vec){is >> e;} return is; }\ntemplate<class T> ostream &operator<<(ostream &os, const vector<T> &vec) { for(int i = 0; i < (int)vec.size(); i++) { os << vec[i] << (i + 1 != (int)vec.size() ? \" \" : \"\"); } return os; }\n\ntemplate <class... T> constexpr auto min (T... a) { return min(initializer_list<common_type_t<T...>>{a...}); }\ntemplate <class... T> constexpr auto max (T... a) { return max(initializer_list<common_type_t<T...>>{a...}); }\ntemplate<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> T opmin(T x, T y) { return min(x, y); }\ntemplate<class T> T einf() { return numeric_limits<T>::max(); }\ntemplate<class T> T opmax(T x, T y) { return max(x, y); }\ntemplate<class T> T eminf() { return numeric_limits<T>::min(); }\ntemplate<class T> T opsum(T x, T y) { return x + y; }\ntemplate<class T> T ezero() { return (T)0; }\n// #define maxseg(T) segtree<T, [](T x, T y){return max(x, y);}, [](){return (T)(-(1LL << 60));}>\n// #define minseg(T) segtree<T, [](T x, T y){return min(x, y);}, [](){return (T)((1LL << 60));}>\n// #define sumseg(T) segtree<T, [](T x, T y){return x + y;}, [](){return (T)(0);}>\ntemplate<class T> using minseg = segtree<T, opmin<T>, einf<T>>;\ntemplate<class T> using maxseg = segtree<T, opmax<T>, eminf<T>>;\ntemplate<class T> using sumseg = segtree<T, opsum<T>, ezero<T>>;\n// template<class T> struct v : vector<T> { using vector<T> :: vector; };\n// template<class T> struct vv : vector<v<T>> { using vector<v<T>> :: vector; };\n// template<class T> struct vvv : vector<vv<T>> { using vector<vv<T>> :: vector; };\ntemplate<class T> inline bool chmin(T& a, T b) {if(a > b){a = b; return true;} else {return false;}};\ntemplate<class T> inline bool chmax(T& a, T b) {if(a < b){a = b; return true;} else {return false;}};\n#define rep(i,n) for(ll i = 0; i < (ll)(n); i++)\n#define repr(i,n) for(ll i = (ll)(n) - 1; i >= 0; i--)\n#define REP(i, l, r) for(ll i = (ll)l; i <= (ll)(r); i++)\n#define REPR(i, l, r) for(ll i = (ll)r; i >= (ll)(l); i--)\nconst ll inf = (1 << 30);\nconst ll INF = (1LL << 60);\nconst vector<pair<ll, ll>> DIJ = {{1, 0}, {0, -1}, {-1, 0}, {0, 1}};\nvoid out(){cout<<'\\n';}\ntemplate<class T, class... Ts> void out(const T& a, const Ts&... b){ cout<<a; (cout<<... << (cout << ' ', b)); cout << '\\n';}\nvoid outf(){cout<<endl;}\ntemplate<class T, class... Ts> void outf(const T& a, const Ts&... b){ cout<<a; (cout<<... << (cout << ' ', b)); cout << endl;}\ntemplate<class T, class U> void outp(pair<T, U> a){ out((a).first, (a).second); }\ntemplate<class T, class U> void outpf(pair<T, U> a){ outf((a).first, (a).second); }\ntemplate<class T> void outv(T a){rep(i, (a).size()){ cout << (a)[i] << \" \"; } cout << endl;}\ntemplate<class T> void outvL(T a){rep(i, (a).size()){out((a)[i]);} cout << flush; }\n// template<class T> void outvv(T a){rep(i, a.size()){ rep(j, a.at(i).size()){cout << a.at(i).at(j) << \" \"; } cout << endl; }}\n// template<class T> void outvp(T a){rep(i, a.size()){ out2(a.at(i).first, a.at(i).second); }}\nvoid setpre(int a){cout << fixed << setprecision(a);}\n#define outN out(\"No\")\n#define outY out(\"Yes\")\n#define outYN(flag) out(flag ? \"Yes\" : \"No\")\n#define dame(...) {outf(__VA_ARGS__);return 0;}\n\ntemplate<class T> void read(vector<T>& vec){ for(int i = 0; i < (int)vec.size(); i++) { cin >> vec[i]; } }\ntemplate<class... T> void read(T&... a){(cin >> ... >> a);}\n#define readll(...) ll __VA_ARGS__; read(__VA_ARGS__)\n#define readvll(a, n) vector<ll> a(n); read(a)\n#define readvt(type, a, n) vector<type> a(n); read(a)\n#define readvll2(a, b, n) vector<ll> a(n), b(n); for(int lopi = 0; lopi < (int)(n); lopi++) cin >> (a)[lopi] >> (b)[lopi]\n#define readvll3(a, b, c, n) vector<ll> a(n), b(n), c(n); for(int lopi = 0; lopi < (int)(n); lopi++) cin >> (a)[lopi] >> (b)[lopi] >> (c)[lopi]\n#define readstr(...) string __VA_ARGS__; read(__VA_ARGS__)\n#define readundirG(G, N, M) G = vvll(N); rep(lopi, M) {ll a, b; cin >> a >> b; G[a-1].push_back(b-1); G[b-1].push_back(a-1);}\n#define readdirG(G, N, M) G = vvll(N); rep(lopi, M) {ll a, b; cin >> a >> b; G[a-1].push_back(b-1);}\n#define readundirwghG(G, N, M) G = vv(pll)(N); rep(lopi, M) {ll a, b, c; cin >> a >> b >> c; G[a-1].emplace_back(b-1,c); G[b-1].emplace_back(a-1, c);}\n#define readdirwghG (G, N, M) G = vv(pll)(N); rep(lopi, M) {ll a, b, c; cin >> a >> b >> c; G[a-1].emplace_back(b-1, c);}\n\n#define All(a) (a).begin(), (a).end()\ntemplate<class T> inline void sortr(T& a){ sort((a).rbegin(), (a).rend()); }\ntemplate<class T> inline vector<int> argsort(T V, bool rev = false){vector<int> res(V.size()); iota(res.begin(), res.end(), 0); sort(res.begin(), res.end(), [&](int x, int y){if(!rev){return V[x] < V[y];}else{return V[x] > V[y];}}); return res;}\ntemplate<class T, class U> inline void sort_by_idx(T& V, vector<U>& I){assert(V.size() == I.size()); T tmpv = V; for(int loopi = 0; loopi < (int)I.size(); loopi++){V[loopi] = tmpv[I.at(loopi)];}}\ntemplate<class T, class U> inline void sortp(vector<T>& v1, vector<U>& v2, bool rev1 = false, int rev2 = false){assert(v1.size() == v2.size()); vector<int> I(v1.size()); iota(I.begin(), I.end(), 0); sort(I.begin(), I.end(), [&](const int x, const int y){if(v1[x] != v1[y]){return (bool)(rev1 ^ (v1[x] < v1[y]));}else{if(v2[x]==v2[y]){return false;} return (bool)(rev2 ^ (v2[x] < v2[y]));}}); sort_by_idx(v1, I); sort_by_idx(v2, I);}\ntemplate<class T> T POW(T x, ll n) {T ret = 1; while(n > 0){if(n & 1) ret *= x; x *= x; n >>= 1;} return ret;}\nll powll(ll x, ll n){ll ret = 1; while(n > 0){if(n & 1) ret *= x; x *= x; n >>= 1;} return ret;}\ninline ll divceil(ll x, ll y) { if(x >= 0) {return(x / y + (ll)(x % y != 0)); } else { return -((-x) / y); } }\ninline ll divfloor(ll x, ll y) { if(x >= 0) { return x/y; } else { return -((-x)/y + (ll)((-x) % y != 0)); } }\ninline bool inLR(ll x, ll L, ll R){ return (L <= x && x < R); }\ninline bool inRect(ll pos_x, ll pos_y, ll rect_H, ll rect_W, ll rect_h = 0, ll rect_w = 0){ return (rect_h <= pos_x && pos_x < rect_H && rect_w <= pos_y && pos_y < rect_W); }\n\ntemplate<class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v){e++;} return v;}\ntemplate<class T> vector<T> operator++(vector<T> &v, signed) {auto res=v; for(auto &e : v){e++;} return res;}\ntemplate<class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v){e--;} return v;}\ntemplate<class T> vector<T> operator--(vector<T> &v, signed) {auto res=v; for(auto &e : v){e--;} return res;}\ntemplate<class T> vector<T> operator+(const vector<T> &x, const vector<T> &y) { assert(x.size() == y.size()); vector<T> ret(x.size()); for(int i = 0; i < (int)x.size(); i++) {ret[i] = x[i] + y[i];} return ret; }\ntemplate<class T> vector<T> operator-(const vector<T> &x, const vector<T> &y) { assert(x.size() == y.size()); vector<T> ret(x.size()); for(int i = 0; i < (int)x.size(); i++) {ret[i] = x[i] - y[i];} return ret; } \n\ntemplate<class T, class U> pair<T, U> operator+(const pair<T, U> &x, const pair<T, U> &y) { return make_pair(x.first + y.first, x.second + y.second); }\ntemplate<class T, class U> pair<T, U> operator-(const pair<T, U> &x, const pair<T, U> &y) { return make_pair(x.first - y.first, x.second - y.second); }\ntemplate<class T, class U> void operator+=(pair<T, U> &x, pair<T, U> &y) { x = x + y; }\ntemplate<class T, class U> void operator-=(pair<T, U> &x, pair<T, U> &y) { x = x - y; }\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v){ return seed^(std::hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2)); }\ntemplate<class T,class S> struct std::hash<std::pair<T,S>>{ size_t operator()(const std::pair<T,S> &keyval) const noexcept { return HashCombine(std::hash<T>()(keyval.first), keyval.second); } };\ntemplate<class T> struct std::hash<std::vector<T>>{ size_t operator()(const std::vector<T> &keyval) const noexcept { size_t s=0; for (auto&& v: keyval) s=HashCombine(s,v); return s; } };\ntemplate<int N> struct HashTupleCore{ template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ size_t s=HashTupleCore<N-1>()(keyval); return HashCombine(s,std::get<N-1>(keyval)); } };\ntemplate <> struct HashTupleCore<0>{ template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; } };\ntemplate<class... Args> struct std::hash<std::tuple<Args...>>{ size_t operator()(const tuple<Args...> &keyval) const noexcept { return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval); } };\n\n// https://drken1215.hatenablog.com/entry/2023/10/29/235354\n// Parser (T must have constructor T(long long))\ntemplate<class T> struct Parser {\n /* basic settings */\n vector<vector<string>> OPERATORS; // binary operator priority\n function<T(const string&, T, T)> OPERATION; // binary operation\n\n /* optional settings */\n function<T(const string&, int&)> GET_LEAF; // leaf parser\n vector<string> UNARY_OPERATORS; // unary operator (ex: \"-\", \"log\")\n function<T(const string&, T)> UNARY_OPERATION; // unary operation\n const string OPERATOR_NUMBER = \"num\";\n \n /* results */\n string S;\n int root; // vals[root] is the answer\n vector<T> vals; // value of each node\n vector<string> ops; // operator of each node\n vector<int> left, right; // the index of left-node, right-node\n vector<int> ids; // the node-index of i-th value\n \n /* constructor */\n Parser() {}\n Parser(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation) {\n init(operators, operation);\n }\n Parser(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf) {\n init(operators, operation, get_leaf);\n }\n Parser(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf,\n const vector<string> &unary_operators,\n const function<T(const string &op, T)> unary_operation) {\n init(operators, operation, get_leaf, unary_operators, unary_operation);\n }\n void init(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation) {\n OPERATORS = operators, OPERATION = operation;\n }\n void init(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf) {\n OPERATORS = operators, OPERATION = operation;\n GET_LEAF = get_leaf;\n }\n void init(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf,\n const vector<string> &unary_operators,\n const function<T(const string &op, T)> unary_operation) {\n OPERATORS = operators, OPERATION = operation;\n GET_LEAF = get_leaf;\n UNARY_OPERATORS = unary_operators, UNARY_OPERATION = unary_operation;\n }\n void clear() {\n S = \"\";\n vals.clear(), ops.clear(), left.clear(), right.clear(), ids.clear();\n }\n \n /* node generator */\n // value\n int new_leaf(T val, int &id) {\n vals.push_back(val);\n ops.push_back(OPERATOR_NUMBER);\n left.push_back(-1);\n right.push_back(-1);\n ids.push_back(id++);\n return (int)vals.size() - 1;\n }\n // FUNC(lp)\n int new_node_with_left(T val, const string &op, int lp) {\n vals.push_back(val);\n ops.push_back(op);\n left.push_back(lp);\n right.push_back(-1);\n ids.push_back(-1);\n return (int)vals.size() - 1;\n }\n // (lp) op (rp)\n int new_node_with_left_right(const string &op, int lp, int rp) {\n vals.push_back(OPERATION(op, vals[lp], vals[rp]));\n ops.push_back(op);\n left.push_back(lp);\n right.push_back(rp);\n ids.push_back(-1);\n return (int)vals.size() - 1;\n }\n \n /* main parser */\n T parse(const string &str, bool default_parse_numeric = true) {\n clear();\n S = str;\n int p = 0, id = 0;\n root = parse(p, id, default_parse_numeric);\n return vals[root];\n }\n int parse(int &p, int &id, bool default_parse_numeric, int depth = 0) {\n assert(p >= 0 && p < (int)S.size());\n string op;\n if (depth < (int)OPERATORS.size()) {\n // recursive descent\n int lp = parse(p, id, default_parse_numeric, depth + 1);\n bool update = false;\n do {\n update = false;\n if (is_in_the_operators(p, op,\n OPERATORS[(int)OPERATORS.size() - depth - 1])) {\n int rp = parse(p, id, default_parse_numeric, depth + 1);\n lp = new_node_with_left_right(op, lp, rp);\n update = true;\n }\n } while (p < (int)S.size() && update);\n return lp;\n }\n else if (S[p] == '(') {\n return get_bracket(p, id, default_parse_numeric);\n }\n else if (default_parse_numeric && (S[p] == '-' || isdigit(S[p]))) {\n return get_number(p, id);\n }\n else if (is_in_the_operators(p, op, UNARY_OPERATORS)) {\n return get_unary_operation(p, id, op, default_parse_numeric);\n }\n else {\n return new_leaf(GET_LEAF(S, p), id);\n }\n }\n bool is_the_operator(int &p, const string &op) {\n if (op != \"\" && S.substr(p, op.size()) == op) {\n p += op.size();\n return true;\n }\n return false;\n }\n bool is_in_the_operators(int &p, string &res_op, const vector<string> &ops) {\n for (const auto &op : ops) {\n if (is_the_operator(p, op)) {\n res_op = op;\n return true;\n }\n }\n return false;\n }\n int get_number(int &p, int &id) {\n long long val = 0, sign = 1;\n if (S[p] == '-') sign = -1, ++p;\n while (p < (int)S.size() && isdigit(S[p])) {\n val = val * 10 + (int)(S[p++] - '0');\n }\n return new_leaf(T(val * sign), id);\n }\n int get_bracket(int &p, int &id, bool default_parse_numeric) {\n ++p; // skip \"(\"\n int lp = parse(p, id, default_parse_numeric, 0);\n ++p; // skip \")\"\n return lp;\n }\n int get_unary_operation(int &p, int &id, const string &op,\n bool default_parse_numeric) {\n int lp;\n if (S[p] == '(') lp = get_bracket(p, id, default_parse_numeric);\n else lp = parse(p, id, default_parse_numeric, (int)OPERATORS.size());\n return new_node_with_left(UNARY_OPERATION(op, vals[lp]), op, lp);\n }\n \n /* dump */\n void dump() {\n dump_rec(root);\n }\n void dump_rec(int v, string space = \"\") {\n cout << space << v << \": (\" << ops[v] << \", \" << vals[v]\n << \") -> left: \" << left[v] << \", right: \" << right[v] << endl;\n if (left[v] != -1) dump_rec(left[v], space + \" \");\n if (right[v] != -1) dump_rec(right[v], space + \" \");\n }\n};\n\nvector<vector<string>> operator4 = {{\"*\", \"/\"}, {\"+\", \"-\"}};\n\ntemplate<typename T> T op(const string &s, T l, T r)\n{\n if(s == \"*\")\n {\n return l * r;\n }\n else if(s == \"/\")\n {\n return l / r;\n }\n else if(s == \"+\")\n {\n return l + r;\n }\n else if(s == \"-\")\n {\n return l - r;\n }\n else assert(false);\n}\n\nint main()\n{\n std::cin.tie(nullptr), std::ios_base::sync_with_stdio(false);\n Parser<mint> ps(operator4, op<mint>);\n while(true)\n {\n readll(H, W);\n if(!H) break;\n readvt(string, S, H);\n readll(N);\n readvt(char, C, N);\n vpll bl;\n vector<vector<pll>> prb;\n vv(bool) cH(H, v(bool)(W, false)), cW(H, v(bool)(W, false));\n auto check_syn = [&](string &x)\n {\n char bf = '-';\n rep(i, x.size())\n {\n if(isdigit(x[i]))\n {\n if(!isdigit(bf) && x[i] == '0' && (i + 1 < x.size() && isdigit(x[i + 1])))\n {\n return false;\n }\n }\n else if(x[i] == '=') return false;\n else\n {\n if(i - 1 < 0 || i + 1 >= x.size() || !isdigit(x[i-1]) || !isdigit(x[i + 1])) return false;\n if(x[i] == '/' && i + 1 < x.size() && x[i + 1] == '0') return false;\n }\n bf = x[i];\n }\n return true;\n };\n auto check_str = [&](string &x)\n {\n ll eq = x.find('=');\n if(eq == string::npos) return false;\n string L = x.substr(0, eq);\n if(!check_syn(L)) return false;\n string R = x.substr(eq + 1, x.size() - eq - 1);\n if(!check_syn(R)) return false;\n return ps.parse(L, true) == ps.parse(R, true);\n };\n auto check = [&]()\n {\n for(auto &line : prb)\n {\n string tmp;\n for(auto &[x, y] : line) tmp.push_back(S[x][y]);\n if(!check_str(tmp)) return false;\n }\n return true;\n };\n bool ng = false;\n rep(i, H) rep(j, W)\n {\n if(ng)\n {\n i = INF;\n break;\n }\n if(S[i][j] == '.')\n {\n bl.emplace_back(i, j);\n }\n if(S[i][j] == '#') continue;\n if(!cH[i][j] && i + 1 < H && S[i + 1][j] != '#')\n {\n ll x = i, y = j;\n bool have = false;\n vpll tmp;\n string ss;\n while(inRect(x, y, H, W) && S[x][y] != '#')\n {\n if(S[x][y] == '.') have = true;\n tmp.emplace_back(x, y);\n ss.push_back(S[x][y]);\n cH[x][y] = true;\n x++;\n }\n if(!have)\n {\n if(!check_str(ss))\n {\n ng = true;\n break;\n }\n }\n else\n {\n prb.emplace_back(tmp);\n }\n }\n if(!cW[i][j] && j + 1 < W && S[i][j + 1] != '#')\n {\n ll x = i, y = j;\n bool have = false;\n vpll tmp;\n string ss;\n while(inRect(x, y, H, W) && S[x][y] != '#')\n {\n if(S[x][y] == '.') have = true;\n tmp.emplace_back(x, y);\n ss.push_back(S[x][y]);\n cW[x][y] = true;\n y++;\n }\n if(!have)\n {\n if(!check_str(ss))\n {\n ng = true;\n break;\n }\n }\n else\n {\n prb.emplace_back(tmp);\n }\n }\n }\n if(ng)\n {\n outN;\n continue;\n }\n sort(All(C));\n bool ok = false;\n do\n {\n rep(i, N)\n {\n auto [x, y] = bl[i];\n S[x][y] = C[i];\n }\n if(check())\n {\n ok = true;\n break;\n }\n } while (next_permutation(All(C)));\n outYN(ok);\n }\n}",
"accuracy": 1,
"time_ms": 830,
"memory_kb": 3584,
"score_of_the_acc": -1.0746,
"final_rank": 18
},
{
"submission_id": "aoj_1022_9167451",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n#define SIZE 105\n#define SIZE2 12\n\n\n\nint H,W,N;\nint space_IND;\nint hori_IND[SIZE][SIZE],vert_IND[SIZE][SIZE];\nchar buf[SIZE2][SIZE2],CAND[SIZE2];\nchar eq[SIZE];\nbool used[SIZE],check_hori[SIZE][SIZE],check_vert[SIZE][SIZE];\nbool not_zero[SIZE],not_num[SIZE],not_op[SIZE];\nvector<vector<pair<int,int>>> V;\nvector<pair<int,int>> SPACE,COMBI;\nint num_ORD;\nchar ORD[3628800][10],WORK[12];\nbool errorFLG;\nmap<pair<int,int>,int> MAP;\n\n\nll calc_E(char line[SIZE]);\nll calc_T(char line[SIZE]);\nll calc_F(char line[SIZE]);\nll calc_NUM(char line[SIZE]);\n\nbool isOP(char ch){\n\n\treturn (ch == '+' || ch == '-' || ch == '*' || ch == '/');\n}\n\nbool isNUM(char ch){\n\n\treturn ch >= '0' && ch <= '9';\n}\n\nbool isZERO(char ch){\n\n\treturn ch == '0';\n}\n\nvoid dfs(int len){\n\tif(len == N){\n\n\t\tfor(int i = 0; i < len; i++){\n\n\t\t\tORD[num_ORD][i] = WORK[i];\n\t\t}\n\t\tnum_ORD++;\n\t\treturn;\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(used[i])continue;\n\n\t\tchar ch = CAND[i];\n\t\tif((isZERO(ch) && not_zero[len]) || (isOP(ch) && not_op[len]) || (isNUM(ch) && not_num[len]))continue;\n\n\t\tused[i] = true;\n\t\tWORK[len] = '0'+i;\n\t\tdfs(len+1);\n\t\tused[i] = false;\n\t}\n}\n\nint INDEX;\n\nll calc_E(char line[SIZE]){\n\n\tll ret = calc_T(line);\n\n\twhile(true){\n\n\t\tif(line[INDEX] == '+'){\n\n\t\t\tINDEX++;\n\t\t\tret += calc_T(line);\n\n\t\t}else if(line[INDEX] == '-'){\n\n\t\t\tINDEX++;\n\t\t\tret -= calc_T(line);\n\n\t\t}else{\n\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nll calc_T(char line[SIZE]){\n\n\tll ret = calc_F(line);\n\n\twhile(true){\n\n\t\tif(line[INDEX] == '*'){\n\n\t\t\tINDEX++;\n\t\t\tret *= calc_F(line);\n\n\t\t}else if(line[INDEX] == '/'){\n\n\t\t\tINDEX++;\n\t\t\tll tmp = calc_F(line);\n\t\t\tif(tmp == 0 || (ret%tmp != 0)){\n\n\t\t\t\terrorFLG = true;\n\t\t\t\ttmp = HUGE_NUM;\n\t\t\t}\n\t\t\tret /= tmp;\n\n\t\t}else{\n\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nll calc_F(char line[SIZE]){\n\n\tif(line[INDEX] == '('){\n\t\tINDEX++;\n\t\tll ret = calc_E(line);\n\t\tINDEX++;\n\n\t\treturn ret;\n\t}else{\n\n\t\treturn calc_NUM(line);\n\t}\n}\n\nll calc_NUM(char line[SIZE]){\n\n\tll ret = 0;\n\n\tvector<char> vec;\n\n\twhile(line[INDEX] >= '0' && line[INDEX] <= '9'){\n\n\t\tret = 10*ret + line[INDEX]-'0';\n\t\tvec.push_back(line[INDEX]);\n\t\tINDEX++;\n\t}\n\tif(vec.size() == 0){\n\t\terrorFLG = true;\n\t\tret = 1;\n\t}\n\tif(vec.size() >= 2 && vec[0] == '0' && vec[1] == '0'){\n\n\t\terrorFLG = true;\n\t\tret = 1;\n\t}\n\treturn ret;\n}\n\nbool rangeCheck(int row,int col){\n\n\treturn row >= 0 && row <= H-1 && col >= 0 && col <= W-1;\n}\n\nbool checkInvalidEQ(vector<pair<int,int>> vec){\n\n\tvector<char> L;\n\tfor(int i = 0; i < vec.size(); i++){\n\n\t\tL.push_back(buf[vec[i].first][vec[i].second]);\n\t}\n\n\t//OP連続は不可\n\tfor(int i = 0; i < L.size()-1; i++){\n\t\tif(isOP(L[i]) && isOP(L[i+1])){\n\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif(L.size() >= 2 && L[0] == '0' && isNUM(L[1])){\n\n\t\treturn false;\n\t}\n\n\tfor(int i = 1; i < L.size(); i++){\n\t\tif(isOP(L[i-1]) && (i+1) < L.size() && isNUM(L[i+1]) && isZERO(L[i])){\n\n\t\t\treturn false;\n\t\t}\n\t}\n\tif(isOP(L[0])||isOP(L.back())){\n\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nvoid func(){\n\n\tSPACE.clear();\n\tMAP.clear();\n\tV.clear();\n\tCOMBI.clear();\n\n\tspace_IND = 0;\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tcheck_hori[row][col] = false;\n\t\t\tcheck_vert[row][col] = false;\n\t\t}\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\n\t\tscanf(\"%s\",buf[row]);\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(buf[row][col] == '.'){ //空白セル\n\n\t\t\t\tSPACE.push_back(make_pair(row,col));\n\t\t\t\tMAP[make_pair(row,col)] = space_IND++; //空白セルに番号を割り振る\n\t\t\t}\n\t\t}\n\t}\n\n\tscanf(\"%d\",&N);\n\n\tchar input[2];\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%s\",input);\n\t\tCAND[i] = input[0];\n\t}\n\n\t//配列の初期化\n\tfor(int i = 0; i < N; i++){\n\n\t\tnot_zero[i] = false;\n\t\tnot_num[i] = false;\n\t\tnot_op[i] = false;\n\t}\n\n\t//数式の候補を前計算\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(buf[row][col] == '#' || buf[row][col] == '=')continue;\n\n\t\t\tif(!check_hori[row][col]){\n\n\t\t\t\tcheck_hori[row][col] = true;\n\n\t\t\t\t//右へ\n\t\t\t\tvector<pair<int,int>> toR;\n\t\t\t\ttoR.push_back(make_pair(row,col));\n\n\t\t\t\tint last_col = col;\n\n\t\t\t\tfor(int tmp_col = col+1; tmp_col < W; tmp_col++){\n\t\t\t\t\tif(buf[row][tmp_col] == '#' || buf[row][tmp_col] == '='){\n\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tlast_col = tmp_col;\n\n\t\t\t\t\ttoR.push_back(make_pair(row,tmp_col));\n\t\t\t\t\tcheck_hori[row][tmp_col] = true;\n\t\t\t\t}\n\n\t\t\t\tif((col > 0 && buf[row][col-1] == '=')||(last_col+1 < W && buf[row][last_col+1] == '=')){ //式の左か右に'='がある場合\n\n\t\t\t\t\tfor(int i = 0; i < toR.size(); i++){\n\n\t\t\t\t\t\thori_IND[toR[i].first][toR[i].second] = V.size();\n\t\t\t\t\t}\n\t\t\t\t\tif(!checkInvalidEQ(toR)){\n\t\t\t\t\t\tprintf(\"No\\n\");\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\n\t\t\t\t\tV.push_back(toR);\n\t\t\t\t}\n\t\t\t}\n\n\n\t\t\tif(!check_vert[row][col]){\n\n\t\t\t\tcheck_vert[row][col] = true;\n\n\t\t\t\t//下へ\n\t\t\t\tvector<pair<int,int>> toD;\n\t\t\t\ttoD.push_back(make_pair(row,col));\n\n\t\t\t\tint last_row = row;\n\n\t\t\t\tfor(int tmp_row = row+1; tmp_row < H; tmp_row++){\n\t\t\t\t\tif(buf[tmp_row][col] == '#' || buf[tmp_row][col] == '=')break;\n\n\t\t\t\t\tlast_row = tmp_row;\n\n\t\t\t\t\ttoD.push_back(make_pair(tmp_row,col));\n\t\t\t\t\tcheck_vert[tmp_row][col] = true;\n\t\t\t\t}\n\n\t\t\t\tif((row > 0 && buf[row-1][col] == '=') || (last_row+1 < H && buf[last_row+1][col] == '=')){ //式の上か下に'='がある場合\n\n\t\t\t\t\tfor(int i = 0; i < toD.size(); i++){\n\n\t\t\t\t\t\tvert_IND[toD[i].first][toD[i].second] = V.size();\n\t\t\t\t\t}\n\t\t\t\t\tif(!checkInvalidEQ(toD)){\n\t\t\t\t\t\tprintf(\"No\\n\");\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\n\t\t\t\t\tV.push_back(toD);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t//比較する数式を前計算\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(buf[row][col] != '=')continue;\n\n\t\t\tint a,b;\n\n\t\t\tif(col > 0 && col+1 < W && buf[row][col-1] != '#' && buf[row][col+1] != '#'){\n\n\t\t\t\ta = hori_IND[row][col-1];\n\t\t\t\tb = hori_IND[row][col+1];\n\n\t\t\t\tCOMBI.push_back(make_pair(a,b));\n\t\t\t}\n\n\t\t\tif(row > 0 && row+1 < H && buf[row-1][col] != '#' && buf[row+1][col] != '#'){\n\n\t\t\t\ta = vert_IND[row-1][col];\n\t\t\t\tb = vert_IND[row+1][col];\n\n\t\t\t\tCOMBI.push_back(make_pair(a,b));\n\t\t\t}\n\t\t}\n\t}\n\n\t//計算量を落とすための前処理\n\tfor(int i = 0; i < V.size(); i++){\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tpair<int,int> tmp = V[i][k]; //i個の数式の、k番目の場所\n\n\t\t\tif(buf[tmp.first][tmp.second] != '.')continue; //空白セルでないならSKIP\n\n\t\t\tint tmp_ind = MAP[tmp]; //空白セルのインデックスを取得\n\n\t\t\tif(k == 0){\n\n\t\t\t\tnot_op[tmp_ind] = true; //先頭なので演算子不可\n\t\t\t}\n\n\t\t\tif(k == V[i].size()-1){\n\n\t\t\t\tnot_op[tmp_ind] = true; //数式の末尾に演算子を置くのは不可\n\t\t\t}\n\n\t\t\t//左に演算子がある場合\n\t\t\tif(k > 0){\n\t\t\t\tpair<int,int> pre = V[i][k-1];\n\t\t\t\tif(isOP(buf[pre.first][pre.second])){\n\n\t\t\t\t\tnot_op[tmp_ind] = true; //演算子の連続は不可\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//右に演算子があれば不可\n\t\t\tif(k+1 < V[i].size()){\n\t\t\t\tpair<int,int> next = V[i][k+1];\n\t\t\t\tif(isOP(buf[next.first][next.second])){\n\n\t\t\t\t\tnot_op[tmp_ind] = true; //演算子の連続は不可\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//2つ左に演算子があって、1つ左に0があれば、数字は不可\n\t\t\tif(k >= 2){\n\t\t\t\tpair<int,int> pre_pre = V[i][k-2];\n\t\t\t\tpair<int,int> pre = V[i][k-1];\n\t\t\t\tif(isOP(buf[pre_pre.first][pre_pre.second]) && isZERO(buf[pre.first][pre.second])){\n\n\t\t\t\t\tnot_num[tmp_ind] = true;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//左に演算子があって、右に数字があれば、0は不可\n\t\t\tif(k > 0 && k+1 < V[i].size()){\n\t\t\t\tpair<int,int> pre = V[i][k-1];\n\t\t\t\tpair<int,int> next = V[i][k+1];\n\t\t\t\tif(isOP(buf[pre.first][pre.second]) && isNUM(buf[next.first][next.second])){\n\n\t\t\t\t\tnot_zero[tmp_ind] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tnum_ORD = 0;\n\n\n\t//空白セルに候補値を割り当て\n\tfor(int i = 0; i < N; i++){\n\n\t\tchar ch = CAND[i];\n\t\tif((isZERO(ch) && not_zero[0]) || (isOP(ch) && not_op[0]) || (isNUM(ch) && not_num[0]))continue;\n\n\t\tused[i] = true;\n\t\tWORK[0] = '0'+i;\n\t\tdfs(1);\n\t\tused[i] = false;\n\t}\n\n\tfor(int loop = 0; loop < num_ORD; loop++){\n\n\t\t//表を埋める\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tpair<int,int> tmp = SPACE[i];\n\n\t\t\tint tmp_ind = ORD[loop][i]-'0';\n\n\t\t\tbuf[tmp.first][tmp.second] = CAND[tmp_ind];\n\t\t}\n\n\t\terrorFLG = false;\n\t\tbool FLG = true;\n\n\t\tfor(int i = 0; i < COMBI.size(); i++){\n\n\t\t\tint a = COMBI[i].first;\n\n\t\t\tint tmp_ind = 0;\n\t\t\tfor(int k = 0; k < V[a].size(); k++){\n\n\t\t\t\tpair<int,int> pos = V[a][k];\n\t\t\t\teq[tmp_ind] = buf[pos.first][pos.second];\n\t\t\t\teq[tmp_ind+1] = '=';\n\t\t\t\ttmp_ind++;\n\t\t\t}\n\n\t\t\tINDEX = 0;\n\t\t\tll result1 = calc_E(eq);\n\n\t\t\tif(errorFLG)break;\n\n\n\t\t\tint b = COMBI[i].second;\n\t\t\ttmp_ind = 0;\n\t\t\tfor(int k = 0; k < V[b].size(); k++){\n\n\t\t\t\tpair<int,int> pos = V[b][k];\n\t\t\t\teq[tmp_ind] = buf[pos.first][pos.second];\n\t\t\t\teq[tmp_ind+1] = '=';\n\t\t\t\ttmp_ind++;\n\t\t\t}\n\n\t\t\tINDEX = 0;\n\t\t\tll result2 = calc_E(eq);\n\n\t\t\tif(errorFLG)break;\n\n\t\t\tif(result1 != result2){\n\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(errorFLG)continue;\n\t\tif(FLG){\n\n\t\t\tprintf(\"Yes\\n\");\n\t\t\treturn;\n\t\t}\n\t}\n\n\tprintf(\"No\\n\");\n}\n\n\nint main(){\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": 520,
"memory_kb": 38880,
"score_of_the_acc": -1.6125,
"final_rank": 19
},
{
"submission_id": "aoj_1022_9167447",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n#define SIZE 105\n#define SIZE2 12\n\n\nbool DEBUG = false;\n\n\nint H,W,N;\nint space_IND;\nint hori_IND[SIZE][SIZE],vert_IND[SIZE][SIZE];\nchar buf[SIZE2][SIZE2],CAND[SIZE2];\nchar eq[SIZE];\nbool used[SIZE],check_hori[SIZE][SIZE],check_vert[SIZE][SIZE];\nbool not_zero[SIZE],not_num[SIZE],not_op[SIZE];\nvector<vector<pair<int,int>>> V;\nvector<pair<int,int>> SPACE,COMBI;\nint num_ORD;\nchar ORD[3628800][10],WORK[12];\nbool errorFLG;\nmap<pair<int,int>,int> MAP;\n\n\nll calc_E(char line[SIZE]);\nll calc_T(char line[SIZE]);\nll calc_F(char line[SIZE]);\nll calc_NUM(char line[SIZE]);\n\nbool isOP(char ch){\n\n\treturn (ch == '+' || ch == '-' || ch == '*' || ch == '/');\n}\n\nbool isNUM(char ch){\n\n\treturn ch >= '0' && ch <= '9';\n}\n\nbool isZERO(char ch){\n\n\treturn ch == '0';\n}\n\nvoid dfs(int len){\n\tif(len == N){\n\n\t\tfor(int i = 0; i < len; i++){\n\n\t\t\tORD[num_ORD][i] = WORK[i];\n\t\t}\n\t\tnum_ORD++;\n\t\treturn;\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(used[i])continue;\n\n\t\tchar ch = CAND[i];\n\t\tif((isZERO(ch) && not_zero[len]) || (isOP(ch) && not_op[len]) || (isNUM(ch) && not_num[len]))continue;\n\n\t\tused[i] = true;\n\t\tWORK[len] = '0'+i;\n\t\tdfs(len+1);\n\t\tused[i] = false;\n\t}\n}\n\nint INDEX;\n\nll calc_E(char line[SIZE]){\n\n\tll ret = calc_T(line);\n\n\twhile(true){\n\n\t\tif(line[INDEX] == '+'){\n\n\t\t\tINDEX++;\n\t\t\tret += calc_T(line);\n\n\t\t}else if(line[INDEX] == '-'){\n\n\t\t\tINDEX++;\n\t\t\tret -= calc_T(line);\n\n\t\t}else{\n\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nll calc_T(char line[SIZE]){\n\n\tll ret = calc_F(line);\n\n\twhile(true){\n\n\t\tif(line[INDEX] == '*'){\n\n\t\t\tINDEX++;\n\t\t\tret *= calc_F(line);\n\n\t\t}else if(line[INDEX] == '/'){\n\n\t\t\tINDEX++;\n\t\t\tll tmp = calc_F(line);\n\t\t\tif(tmp == 0 || (ret%tmp != 0)){\n\n\t\t\t\terrorFLG = true;\n\t\t\t\ttmp = HUGE_NUM;\n\t\t\t}\n\t\t\tret /= tmp;\n\n\t\t}else{\n\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nll calc_F(char line[SIZE]){\n\n\tif(line[INDEX] == '('){\n\t\tINDEX++;\n\t\tll ret = calc_E(line);\n\t\tINDEX++;\n\n\t\treturn ret;\n\t}else{\n\n\t\treturn calc_NUM(line);\n\t}\n}\n\nll calc_NUM(char line[SIZE]){\n\n\tll ret = 0;\n\n\tvector<char> vec;\n\n\twhile(line[INDEX] >= '0' && line[INDEX] <= '9'){\n\n\t\tret = 10*ret + line[INDEX]-'0';\n\t\tvec.push_back(line[INDEX]);\n\t\tINDEX++;\n\t}\n\tif(vec.size() == 0){\n\t\terrorFLG = true;\n\t\tret = 1;\n\t}\n\tif(vec.size() >= 2 && vec[0] == '0' && vec[1] == '0'){\n\n\t\terrorFLG = true;\n\t\tret = 1;\n\t}\n\treturn ret;\n}\n\nbool rangeCheck(int row,int col){\n\n\treturn row >= 0 && row <= H-1 && col >= 0 && col <= W-1;\n}\n\nbool checkInvalidEQ(vector<pair<int,int>> vec){\n\n\tvector<char> L;\n\tfor(int i = 0; i < vec.size(); i++){\n\n\t\tL.push_back(buf[vec[i].first][vec[i].second]);\n\t}\n\n\t//OP連続は不可\n\tfor(int i = 0; i < L.size()-1; i++){\n\t\tif(isOP(L[i]) && isOP(L[i+1])){\n\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif(L.size() >= 2 && L[0] == '0' && isNUM(L[1])){\n\n\t\treturn false;\n\t}\n\n\tfor(int i = 1; i < L.size(); i++){\n\t\tif(isOP(L[i-1]) && (i+1) < L.size() && isNUM(L[i+1]) && isZERO(L[i])){\n\n\t\t\treturn false;\n\t\t}\n\t}\n\tif(isOP(L[0])||isOP(L.back())){\n\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nvoid func(){\n\n\tSPACE.clear();\n\tMAP.clear();\n\tV.clear();\n\tCOMBI.clear();\n\n\tspace_IND = 0;\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tcheck_hori[row][col] = false;\n\t\t\tcheck_vert[row][col] = false;\n\t\t}\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\n\t\tscanf(\"%s\",buf[row]);\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(buf[row][col] == '.'){ //空白セル\n\n\t\t\t\tSPACE.push_back(make_pair(row,col));\n\t\t\t\tMAP[make_pair(row,col)] = space_IND++; //空白セルに番号を割り振る\n\t\t\t}\n\t\t}\n\t}\n\n\tscanf(\"%d\",&N);\n\n\tchar input[2];\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%s\",input);\n\t\tCAND[i] = input[0];\n\t}\n\n\t//配列の初期化\n\tfor(int i = 0; i < N; i++){\n\n\t\tnot_zero[i] = false;\n\t\tnot_num[i] = false;\n\t\tnot_op[i] = false;\n\t}\n\n\t//数式の候補を前計算\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(buf[row][col] == '#' || buf[row][col] == '=')continue;\n\n\t\t\tif(!check_hori[row][col]){\n\n\t\t\t\tcheck_hori[row][col] = true;\n\n\t\t\t\t//右へ\n\t\t\t\tvector<pair<int,int>> toR;\n\t\t\t\ttoR.push_back(make_pair(row,col));\n\n\t\t\t\tint last_row = row,last_col = col;\n\n\t\t\t\tfor(int tmp_col = col+1; tmp_col < W; tmp_col++){\n\t\t\t\t\tif(buf[row][tmp_col] == '#' || buf[row][tmp_col] == '='){\n\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tlast_col = tmp_col;\n\n\t\t\t\t\ttoR.push_back(make_pair(row,tmp_col));\n\t\t\t\t\tcheck_hori[row][tmp_col] = true;\n\t\t\t\t}\n\n\t\t\t\tif((col > 0 && buf[row][col-1] == '=')||(last_col+1 < W && buf[row][last_col+1] == '=')){ //式の左か右に'='がある場合\n\n\t\t\t\t\tfor(int i = 0; i < toR.size(); i++){\n\n\t\t\t\t\t\thori_IND[toR[i].first][toR[i].second] = V.size();\n\t\t\t\t\t}\n\t\t\t\t\tif(!checkInvalidEQ(toR)){\n\t\t\t\t\t\tprintf(\"No\\n\");\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\n\t\t\t\t\tV.push_back(toR);\n\t\t\t\t}\n\t\t\t}\n\n\n\t\t\tif(!check_vert[row][col]){\n\n\t\t\t\tcheck_vert[row][col] = true;\n\n\t\t\t\t//下へ\n\t\t\t\tvector<pair<int,int>> toD;\n\t\t\t\ttoD.push_back(make_pair(row,col));\n\n\t\t\t\tint last_row = row;\n\n\t\t\t\tfor(int tmp_row = row+1; tmp_row < H; tmp_row++){\n\t\t\t\t\tif(buf[tmp_row][col] == '#' || buf[tmp_row][col] == '=')break;\n\n\t\t\t\t\tlast_row = tmp_row;\n\n\t\t\t\t\ttoD.push_back(make_pair(tmp_row,col));\n\t\t\t\t\tcheck_vert[tmp_row][col] = true;\n\t\t\t\t}\n\n\t\t\t\tif((row > 0 && buf[row-1][col] == '=') || (last_row+1 < H && buf[last_row+1][col] == '=')){ //式の上か下に'='がある場合\n\n\t\t\t\t\tfor(int i = 0; i < toD.size(); i++){\n\n\t\t\t\t\t\tvert_IND[toD[i].first][toD[i].second] = V.size();\n\t\t\t\t\t}\n\t\t\t\t\tif(!checkInvalidEQ(toD)){\n\t\t\t\t\t\tprintf(\"No\\n\");\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\n\t\t\t\t\tV.push_back(toD);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t//比較する数式を前計算\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(buf[row][col] != '=')continue;\n\n\t\t\tint a,b;\n\n\t\t\tif(col > 0 && col+1 < W && buf[row][col-1] != '#' && buf[row][col+1] != '#'){\n\n\t\t\t\ta = hori_IND[row][col-1];\n\t\t\t\tb = hori_IND[row][col+1];\n\n\t\t\t\t//printf(\"hori (%d,%d)\\n\",a,b);\n\n\t\t\t\tCOMBI.push_back(make_pair(a,b));\n\t\t\t}\n\n\t\t\tif(row > 0 && row+1 < H && buf[row-1][col] != '#' && buf[row+1][col] != '#'){\n\n\t\t\t\ta = vert_IND[row-1][col];\n\t\t\t\tb = vert_IND[row+1][col];\n\n\t\t\t\t//printf(\"vert (%d,%d)\\n\",a,b);\n\n\t\t\t\tCOMBI.push_back(make_pair(a,b));\n\t\t\t}\n\t\t}\n\t}\n\n\tif(DEBUG){\n\n\t\tfor(int i = 0; i < COMBI.size(); i++){\n\n\t\t\tprintf(\"COMBI:%d (%d,%d)\\n\",i,COMBI[i].first,COMBI[i].second);\n\t\t}\n\t}\n\n\t//計算量を落とすための前処理\n\tfor(int i = 0; i < V.size(); i++){\n\t\tfor(int k = 0; k < V[i].size(); k++){\n\t\t\tpair<int,int> tmp = V[i][k]; //i個の数式の、k番目の場所\n\n\t\t\tif(buf[tmp.first][tmp.second] != '.')continue; //空白セルでないならSKIP\n\n\t\t\tint tmp_ind = MAP[tmp]; //空白セルのインデックスを取得\n\n\t\t\tif(k == 0){\n\n\t\t\t\tnot_op[tmp_ind] = true; //先頭なので演算子不可\n\t\t\t}\n\n\t\t\tif(k == V[i].size()-1){\n\n\t\t\t\tnot_op[tmp_ind] = true; //数式の末尾に演算子を置くのは不可\n\t\t\t}\n\n\t\t\t//左に演算子がある場合\n\t\t\tif(k > 0){\n\t\t\t\tpair<int,int> pre = V[i][k-1];\n\t\t\t\tif(isOP(buf[pre.first][pre.second])){\n\n\t\t\t\t\tnot_op[tmp_ind] = true; //演算子の連続は不可\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//右に演算子があれば不可\n\t\t\tif(k+1 < V[i].size()){\n\t\t\t\tpair<int,int> next = V[i][k+1];\n\t\t\t\tif(isOP(buf[next.first][next.second])){\n\n\t\t\t\t\tnot_op[tmp_ind] = true; //演算子の連続は不可\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//2つ左に演算子があって、1つ左に0があれば、数字は不可\n\t\t\tif(k >= 2){\n\t\t\t\tpair<int,int> pre_pre = V[i][k-2];\n\t\t\t\tpair<int,int> pre = V[i][k-1];\n\t\t\t\tif(isOP(buf[pre_pre.first][pre_pre.second]) && isZERO(buf[pre.first][pre.second])){\n\n\t\t\t\t\tnot_num[tmp_ind] = true;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//左に演算子があって、右に数字があれば、0は不可\n\t\t\tif(k > 0 && k+1 < V[i].size()){\n\t\t\t\tpair<int,int> pre = V[i][k-1];\n\t\t\t\tpair<int,int> next = V[i][k+1];\n\t\t\t\tif(isOP(buf[pre.first][pre.second]) && isNUM(buf[next.first][next.second])){\n\n\t\t\t\t\tnot_zero[tmp_ind] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tnum_ORD = 0;\n\n\n\t//空白セルに候補値を割り当て\n\tfor(int i = 0; i < N; i++){\n\n\t\tchar ch = CAND[i];\n\t\tif((isZERO(ch) && not_zero[0]) || (isOP(ch) && not_op[0]) || (isNUM(ch) && not_num[0]))continue;\n\n\t\tused[i] = true;\n\t\tWORK[0] = '0'+i;\n\t\tdfs(1);\n\t\tused[i] = false;\n\t}\n\n\tif(DEBUG){\n\n\t\tfor(int i = 0; i < num_ORD; i++){\n\t\t\tfor(int k = 0; k < N; k++){\n\n\t\t\t\tprintf(\"%c\",ORD[i][k]);\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t}\n\t\t//return;\n\t}\n\n\n\tfor(int loop = 0; loop < num_ORD; loop++){\n\n\t\tif(DEBUG){\n\t\tprintf(\"\\nloop:%d\\n\",loop);\n\t\t}\n\n\t\t//表を埋める\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tpair<int,int> tmp = SPACE[i];\n\n\t\t\tint tmp_ind = ORD[loop][i]-'0';\n\t\t\t//printf(\"buf[%d][%d]を埋める \",tmp.first,tmp.second);\n\n\t\t\tbuf[tmp.first][tmp.second] = CAND[tmp_ind];\n\n\t\t\t//printf(\"ch:%c\\n\",buf[tmp.first][tmp.second]);\n\t\t}\n/*\n\t\tif(DEBUG){\n\t\t\tprintf(\"\\n■デバッグ\\n\");\n\t\t\tfor(int row = 0; row < H; row++){\n\t\t\t\tfor(int col = 0; col < W; col++){\n\n\t\t\t\t\tprintf(\"%c\",buf[row][col]);\n\t\t\t\t}\n\t\t\t\tprintf(\"\\n\");\n\t\t\t}\n\t\t}*/\n\t\t//continue;\n\n\t\terrorFLG = false;\n\t\tbool FLG = true;\n\n\t\tfor(int i = 0; i < COMBI.size(); i++){\n\n\t\t\tint a = COMBI[i].first;\n\n\t\t\tint tmp_ind = 0;\n\t\t\tfor(int k = 0; k < V[a].size(); k++){\n\n\t\t\t\tpair<int,int> pos = V[a][k];\n\t\t\t\teq[tmp_ind] = buf[pos.first][pos.second];\n\t\t\t\teq[tmp_ind+1] = '=';\n\t\t\t\ttmp_ind++;\n\t\t\t}\n\n\t\t\tINDEX = 0;\n\t\t\tll result1 = calc_E(eq);\n\n\t\t\tif(errorFLG)break;\n\n\t\t\t/*printf(\"result1:%lld\\n\",result1);\n\t\t\tfor(int k = 0; k < INDEX; k++){\n\n\t\t\t\t\t\t\tprintf(\"%c\",eq[k]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tprintf(\"\\n\");*/\n\n\n\t\t\tint b = COMBI[i].second;\n\t\t\ttmp_ind = 0;\n\t\t\tfor(int k = 0; k < V[b].size(); k++){\n\n\t\t\t\tpair<int,int> pos = V[b][k];\n\t\t\t\teq[tmp_ind] = buf[pos.first][pos.second];\n\t\t\t\teq[tmp_ind+1] = '=';\n\t\t\t\ttmp_ind++;\n\t\t\t}\n\n\t\t\tINDEX = 0;\n\t\t\tll result2 = calc_E(eq);\n\n\t\t\tif(errorFLG)break;\n\n\t\t\t/*printf(\"result2:%lld\\n\",result2);\n\t\t\t\t\t\tfor(int k = 0; k < INDEX; k++){\n\n\t\t\t\t\t\t\t\t\t\tprintf(\"%c\",eq[k]);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tprintf(\"\\n\");*/\n\n\t\t\tif(result1 != result2){\n\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(errorFLG)continue;\n\t\tif(FLG){\n\n\t\t\t/*printf(\"\\n■デバッグ\\n\");\n\t\t\t\t\t\tfor(int row = 0; row < H; row++){\n\t\t\t\t\t\t\tfor(int col = 0; col < W; col++){\n\n\t\t\t\t\t\t\t\tprintf(\"%c\",buf[row][col]);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tprintf(\"\\n\");\n\t\t\t\t\t\t}\n\t\t\tfor(int k = 0; k < INDEX; k++){\n\n\t\t\t\tprintf(\"%c\",eq[k]);\n\t\t\t}\n\t\t\tprintf(\"\\n\");*/\n\n\t\t\tprintf(\"Yes\\n\");\n\t\t\treturn;\n\t\t}\n\t}\n\n\n\tprintf(\"No\\n\");\n}\n\n\nint main(){\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": 530,
"memory_kb": 38660,
"score_of_the_acc": -1.6192,
"final_rank": 20
},
{
"submission_id": "aoj_1022_7841828",
"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\nbool is_op(char c) {\n return (c == '+' or c == '-' or c == '*' or c == '/');\n}\n\npair<int,bool> eval(string s) {\n if (is_op(s[0]) or is_op(s.back())) return {0,false};\n for (int i = 1; i < s.size(); i++) {\n if (is_op(s[i-1]) and is_op(s[i])) return {0,false};\n if ((i-1 == 0 or !isdigit(s[i-2])) and s[i-1] == '0' and isdigit(s[i])) return {0,false};\n }\n vector<int> v;\n vector<char> op;\n int cur = 0;\n for (char c:s) {\n if (isdigit(c)) {\n cur = cur*10+c-'0';\n }\n else {\n v.push_back(cur);\n cur = 0;\n op.push_back(c);\n }\n }\n v.push_back(cur);\n assert(op.size() + 1 == v.size());\n {\n vector<int> nv = {v[0]};\n vector<char> nop;\n for (int i = 0; i < op.size(); i++) {\n if (op[i] == '*') {\n nv.back() *= v[i+1];\n }\n else if (op[i] == '/') {\n if (v[i+1] == 0 or nv.back() % v[i+1]) {\n return {0,false};\n }\n nv.back() /= v[i+1];\n }\n else {\n nv.push_back(v[i+1]);\n nop.push_back(op[i]);\n }\n }\n swap(v, nv); swap(op, nop);\n }\n {\n vector<int> nv = {v[0]};\n vector<char> nop;\n for (int i = 0; i < op.size(); i++) {\n if (op[i] == '+') {\n nv.back() += v[i+1];\n }\n else if (op[i] == '-') {\n nv.back() -= v[i+1];\n }\n }\n swap(v, nv); swap(op, nop);\n }\n return {v[0],true};\n}\n\nbool dfs(int &h, int &w, vector<string> &s, vector<char> &ad, int i, int j, int bit) {\n\n if (i == h) {\n return true;\n }\n if (j == w) {\n return dfs(h,w,s,ad,i+1,0,bit);\n }\n if (s[i][j] == '#') {\n if (j and s[i][j-1] != '#') {\n string eq1 = \"\";\n string eq2 = \"\";\n bool eql = false;\n int idx = j-1;\n while (0 <= idx and s[i][idx] != '#') {\n if (s[i][idx] == '=') {\n if (eql) return false;\n eql = true;\n }\n else {\n if (!eql) eq1 += s[i][idx];\n else eq2 += s[i][idx];\n }\n idx--;\n }\n if (idx+1 != j-1) {\n if (eq2.size() == 0) return false;\n reverse(eq1.begin(), eq1.end());\n reverse(eq2.begin(), eq2.end());\n\n auto r1 = eval(eq1);\n if (!r1.second) return false;\n auto r2 = eval(eq2);\n if (!r2.second) return false;\n if (r1.first != r2.first) return false;\n }\n }\n if (i and s[i-1][j] != '#') {\n string eq1 = \"\";\n string eq2 = \"\";\n bool eql = false;\n int idx = i-1;\n while (0 <= idx and s[idx][j] != '#') {\n if (s[idx][j] == '=') {\n if (eql) return false;\n eql = true;\n }\n else {\n if (!eql) eq1 += s[idx][j];\n else eq2 += s[idx][j];\n }\n idx--;\n }\n if (idx+1 != i-1) {\n if (eq2.size() == 0) return false;\n reverse(eq1.begin(), eq1.end());\n reverse(eq2.begin(), eq2.end());\n\n auto r1 = eval(eq1);\n if (!r1.second) return false;\n auto r2 = eval(eq2);\n if (!r2.second) return false;\n if (r1.first != r2.first) return false;\n }\n }\n }\n if (s[i][j] != '.') {\n return dfs(h,w,s,ad,i,j+1,bit);\n }\n else {\n for (int k = 0; k < ad.size(); k++) {\n if ((1<<k) & bit) continue;\n s[i][j] = ad[k];\n if (dfs(h,w,s,ad,i,j+1,bit+(1<<k))) {\n return true;\n }\n s[i][j] = '.';\n }\n return false;\n }\n}\n\nbool slv(int h, int w) {\n vector<string> s(h);\n for (int i = 0; i < h; i++) {\n cin >> s[i];\n s[i] += '#';\n }\n s.push_back(string(w+1, '#'));\n h++; w++;\n int n; cin >> n;\n vector<char> ad(n);\n for (int i = 0; i < n; i++) {\n cin >> ad[i];\n }\n return dfs(h,w,s,ad,0,0,0);\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int h,w;\n while (cin >> h >> w, h) {\n if (slv(h,w)) {\n cout << \"Yes\" << endl;\n }\n else {\n cout << \"No\" << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 3388,
"score_of_the_acc": -0.2819,
"final_rank": 3
},
{
"submission_id": "aoj_1022_2880767",
"code_snippet": "#include <cstdio>\n#include <cstdint>\n#include <cctype>\n#include <cassert>\n#include <vector>\n#include <string>\n#include <algorithm>\n\nconstexpr int tsurai=123456789;\n\nint parse_int(const std::string &s, size_t &i) {\n assert(isdigit(s[i]));\n int res=s[i]-'0';\n while (++i < s.length() && isdigit(s[i])) {\n res = res*10 + s[i]-'0';\n }\n return res;\n}\n\nint fourt(const std::string &s, size_t &i) {\n int res=0;\n char sgn='+';\n while (i < s.length() && isdigit(s[i])) {\n int cur=parse_int(s, i);\n while (i < s.length() && s[i] != '=') {\n if (s[i] == '*') {\n cur *= parse_int(s, ++i);\n } else if (s[i] == '/') {\n int tmp=parse_int(s, ++i);\n if (tmp == 0 || cur % tmp) return tsurai;\n cur /= tmp;\n } else {\n break;\n }\n }\n if (sgn == '+') {\n res += cur;\n } else {\n res -= cur;\n }\n if (i < s.length() && s[i] != '=') {\n sgn = s[i++];\n }\n }\n return res;\n}\n\nbool valid(const std::vector<std::string> &eqs, const std::vector<char> &cs) {\n for (/* not const */ std::string eq: eqs) {\n for (char &ch: eq)\n if (ch >= 'A' && ch <= 'Z')\n ch = cs[ch-'A'];\n\n if (eq[0] == '=' || !isdigit(eq.back()))\n return false;\n if (std::count(eq.begin(), eq.end(), '=') != 1)\n return false;\n\n for (size_t i=0; i+1<eq.length(); ++i) {\n if (isdigit(eq[i])) continue;\n if (!isdigit(eq[i+1])) return false;\n }\n\n for (size_t i=0; i<eq.length(); ++i) {\n if (!isdigit(eq[i])) continue;\n if (eq[i] != '0') {\n do {\n ++i;\n } while (i < eq.length() && isdigit(eq[i]));\n } else {\n if (i+1 < eq.length() && isdigit(eq[i+1]))\n return false;\n }\n }\n\n size_t i=0;\n if (!isdigit(eq[i])) return false;\n int lhs=fourt(eq, i);\n if (lhs == tsurai) return false;\n assert(eq[i] == '=');\n ++i;\n if (!isdigit(eq[i])) return false;\n int rhs=fourt(eq, i);\n if (rhs == tsurai) return false;\n assert(i == eq.length());\n \n if (lhs != rhs)\n return false;\n }\n return true;\n}\n\nint testcase_ends() {\n size_t H, W;\n scanf(\"%zu %zu\", &H, &W);\n\n if (H == 0 && W == 0)\n return 1;\n\n size_t ph='A'; // placeholder\n std::vector<std::string> s(H);\n for (size_t i=0; i<H; ++i) {\n char buf[16];\n scanf(\"%s\", buf);\n s[i] = buf;\n for (size_t j=0; j<W; ++j) {\n if (s[i][j] == '.')\n s[i][j] = ph++;\n }\n }\n\n std::vector<std::string> eqs;\n for (size_t i=0; i<H; ++i) {\n std::string eq=\"\";\n for (size_t j=0; j<W; ++j) {\n if (s[i][j] != '#') {\n eq += s[i][j];\n } else {\n if (eq.size() >= 3)\n eqs.emplace_back(eq);\n eq = \"\";\n }\n }\n if (eq.size() >= 3)\n eqs.emplace_back(eq);\n }\n\n for (size_t j=0; j<W; ++j) {\n std::string eq=\"\";\n for (size_t i=0; i<H; ++i) {\n if (s[i][j] != '#') {\n eq += s[i][j];\n } else {\n if (eq.size() >= 3)\n eqs.emplace_back(eq);\n eq = \"\";\n }\n }\n if (eq.size() >= 3)\n eqs.emplace_back(eq);\n }\n\n size_t n;\n scanf(\"%zu\", &n);\n std::vector<char> cs(n);\n for (size_t i=0; i<n; ++i)\n scanf(\" %c\", &cs[i]);\n\n std::sort(cs.begin(), cs.end());\n do {\n if (valid(eqs, cs))\n return !printf(\"Yes\\n\");\n } while (std::next_permutation(cs.begin(), cs.end()));\n printf(\"No\\n\");\n return 0;\n}\n\nint main() {\n while (!testcase_ends()) {}\n}",
"accuracy": 1,
"time_ms": 590,
"memory_kb": 2812,
"score_of_the_acc": -0.7543,
"final_rank": 12
},
{
"submission_id": "aoj_1022_2880407",
"code_snippet": "#include <cstdio>\n#include <cctype>\n#include <cassert>\n#include <cstdint>\n#include <string>\n#include <vector>\n#include <algorithm>\n\n#define fprintf(...) (void)0\n\nint parse_int(std::string &s, size_t &i) {\n assert(isdigit(s[i]));\n int res=s[i++]-'0';\n while (isdigit(s[i])) {\n res = res*10 + s[i++]-'0';\n }\n return res;\n}\n\nint parse(std::string &s, size_t &i, bool &succ) {\n if (i == s.length()) {\n succ = false;\n return -1;\n }\n\n if (s[i] == '+' || s[i] == '-') {\n succ = false;\n return -1;\n }\n\n int res=0;\n char sgn='+';\n while (i < s.length()) {\n assert(isdigit(s[i]));\n\n int cur=parse_int(s, i);\n while (true) {\n if (s[i] == '*') {\n cur *= parse_int(s, ++i);\n } else if (s[i] == '/') {\n int tmp=parse_int(s, ++i);\n if (tmp == 0 || cur % tmp != 0) {\n succ = false;\n return -1;\n }\n cur /= tmp;\n } else {\n break;\n }\n }\n\n if (sgn == '+') {\n res += cur;\n } else if (sgn == '-') {\n res -= cur;\n }\n\n if (i == s.length() || s[i] == '=')\n return res;\n\n sgn = s[i++];\n }\n return res;\n}\n\nbool solved(const std::vector<std::string> &eqs, const std::vector<char> &ch) {\n fprintf(stderr, \": \");\n for (size_t i=0; i<ch.size(); ++i)\n fprintf(stderr, \"%c%c\", ch[i], i+1<ch.size()? ' ':'\\n');\n\n for (auto eq: eqs) {\n size_t i=0;\n\n for (char &c: eq)\n if (c >= 'A' && c <= 'Z')\n c = ch[c-'A'];\n\n fprintf(stderr, \"# %s\\n\", eq.c_str());\n\n if (eq[0] == '=' || eq.back() == '=') return false;\n if (!isdigit(eq[0]) || !isdigit(eq.back())) return false;\n for (size_t i=0; i+1<eq.length(); ++i) {\n if (isdigit(eq[i])) continue;\n if (!isdigit(eq[i+1])) return false;\n }\n\n for (size_t i=0; i<eq.length(); ++i) {\n if (!isdigit(eq[i])) continue;\n if (eq[i] == '0') {\n if (i+1 < eq.length() && isdigit(eq[i+1]))\n return false;\n }\n while (i+1 < eq.length() && isdigit(eq[i+1])) {\n ++i;\n }\n }\n\n if (std::count(eq.begin(), eq.end(), '=') != 1)\n return false;\n\n bool succ=true;\n int lhs=parse(eq, i, succ);\n if (!succ) return false;\n assert(eq[i] == '=');\n ++i;\n succ = true;\n int rhs=parse(eq, i, succ);\n if (!succ) return false;\n\n fprintf(stderr, \"%s: %d %d\\n\", eq.c_str(), lhs, rhs);\n\n if (lhs != rhs)\n return false;\n }\n return true;\n}\n\nint testcase_ends() {\n size_t H, W;\n scanf(\"%zu %zu\", &H, &W);\n\n if (H == 0 && W == 0) return 1;\n\n std::vector<std::string> g(H);\n for (size_t i=0; i<H; ++i) {\n char buf[16];\n scanf(\"%s\", buf);\n g[i] = buf;\n }\n\n size_t n;\n scanf(\"%zu\", &n);\n std::vector<char> ch(n);\n for (size_t i=0; i<n; ++i) {\n scanf(\" %c\", &ch[i]);\n }\n\n char ph='A';\n for (size_t i=0; i<H; ++i)\n for (size_t j=0; j<W; ++j)\n if (g[i][j] == '.')\n g[i][j] = ph++;\n\n std::vector<std::string> eqs;\n\n for (size_t i=0; i<H; ++i) {\n std::string eq=\"\";\n for (size_t j=0; j<W; ++j) {\n if (g[i][j] == '#') {\n if (eq.size() >= 3) {\n eqs.emplace_back(eq);\n }\n eq = \"\";\n continue;\n }\n\n eq += g[i][j];\n }\n if (eq.size() >= 3)\n eqs.emplace_back(eq);\n }\n\n for (size_t j=0; j<W; ++j) {\n std::string eq=\"\";\n for (size_t i=0; i<H; ++i) {\n if (g[i][j] == '#') {\n if (eq.size() >= 3) {\n eqs.emplace_back(eq);\n }\n eq = \"\";\n continue;\n }\n\n eq += g[i][j];\n }\n if (eq.size() >= 3)\n eqs.emplace_back(eq);\n }\n\n std::sort(ch.begin(), ch.end());\n do {\n if (solved(eqs, ch)) {\n printf(\"Yes\\n\");\n return 0;\n }\n } while (std::next_permutation(ch.begin(), ch.end()));\n\n printf(\"No\\n\");\n return 0;\n}\n\nint main() {\n while (!testcase_ends()) {}\n}",
"accuracy": 1,
"time_ms": 610,
"memory_kb": 2788,
"score_of_the_acc": -0.7787,
"final_rank": 13
},
{
"submission_id": "aoj_1022_1258431",
"code_snippet": "// AOJ 1022\n#include<iostream>\n#include<string>\n#include<map>\n#include<algorithm>\n#include<vector>\n#define value first\n#define p second\nusing namespace std;\ntypedef pair<int,int> result;\n \nconst int OutOfIntExc = 1,\n NegIntExc = 2,\n NotEquationExc = 3,\n NotNumExc = 4,\n LackNumExc = 5,\n IterExceedExc = 6;\n \nresult equation(const string &s, int p = 0);\nresult expression(const string &s, int p = 0);\nresult factor(const string &s, int p = 0);\nresult term(const string &s, int p = 0);\n \nresult equation(const string &s, int p) {\n// cout << \"? \" << s << \" \";\n if (s[p] == '=') { throw NotEquationExc; }\n result r = expression(s, p);\n if (s[r.p] != '=') { throw NotEquationExc; }\n \n r.p++; // skip '=';\n result t = expression(s, r.p);\n t.value = (int)(r.value == t.value);\n \n// cout << (t.value ? \"T\" : \"F\") << endl;\n \n return t;\n}\n \n \nresult expression(const string &s, int p) {\n result r = factor(s, p);\n while (s[r.p] == '+' or s[r.p] == '-') {\n result r_ = factor(s, r.p+1);\n r.value += (s[r.p] == '+' ? r_.value : - r_.value);\n if (r.value < 0) { throw NegIntExc; }\n r.p = r_.p;\n }\n return r;\n}\n \nresult factor(const string &s, int p) {\n result r = term(s, p);\n while (s[r.p] == '*' or s[r.p] == '/') {\n result r_ = term(s, r.p+1);\n if (s[r.p] == '*') {\n r.value *= r_.value;\n } else {\n if (r_.value == 0 or r.value % r_.value != 0) {\n throw OutOfIntExc;\n }\n r.value /= r_.value;\n }\n r.p = r_.p;\n }\n return r;\n}\n \nresult term(const string &s, int p) {\n if (not isdigit(s[p])) { throw LackNumExc; }\n int value = 0;\n bool flag = false;\n \n while (isdigit(s[p])) {\n if (flag and value == 0) { throw NotNumExc; }\n flag = true;\n value = value * 10 + (s[p++] - '0');\n }\n return result(value, p);\n}\n \n#define REP(i,n) for(int i=0;i<(int)(n);i++)\nint H, W, n;\nconst int HMAX = 200, WMAX = 200, NMAX = 200;\nchar TABLE[HMAX][WMAX];\nbool PRINTED[HMAX][WMAX], HBEGIN[HMAX][WMAX], VBEGIN[HMAX][WMAX];\nchar BLOCK[NMAX];\n \nbool legal(int x, int y) {\n return 0 <= x and x < W and 0 <= y and y < H;\n}\n \nvector<pair<int,int>> blanks;\n \nvoid fill_blank() {\n int i = 0;\n REP(i, n) {\n int x = blanks[i].first, y = blanks[i].second;\n TABLE[x][y] = BLOCK[i];\n }\n}\n \nstring getv(int x, int y) {\n string str;\n while (legal(x, y) and TABLE[x][y] != '#') {\n str.push_back(TABLE[x][y]);\n y++;\n }\n return str;\n}\n \nstring geth(int x, int y) {\n string str;\n while (legal(x, y) and TABLE[x][y] != '#') {\n str.push_back(TABLE[x][y]);\n x++;\n }\n return str;\n}\n \nbool is_operand(char c) {\n return c == '=' or c == '+' or c == '-' or c == '*' or c == '/';\n}\n \nbool is_illegal_operand() {\n REP(y, H) REP(x, W) {\n if (PRINTED[x][y]) continue;\n if (not is_operand(TABLE[x][y])) continue;\n const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};\n REP(i, 4) {\n int nx = x + dx[i], ny = y + dy[i];\n if (legal(nx, ny) and is_operand(TABLE[nx][ny])) {\n return true;\n }\n }\n }\n \n REP(y, H) REP(x,W) {\n if ((VBEGIN[x][y] or HBEGIN[x][y]) and is_operand(TABLE[x][y])) {\n return true;\n }\n }\n return false;\n}\n \nint hbadx, hbady, vbadx, vbady;\nbool hbadflag, vbadflag;\nstring hbadeq, vbadeq;\n \nbool solved() {\n if (hbadflag and geth(hbadx, hbady) == hbadeq) return false;\n if (vbadflag and geth(vbadx, vbady) == vbadeq) return false;\n REP(y, H) REP(x, W) {\n if (not HBEGIN[x][y]) continue;\n string eq = geth(x, y);\n try {\n result e = equation(eq);\n if (e.value == 0) {\n hbadflag = true;\n hbadx = x, hbady = y;\n hbadeq = eq;\n return false;\n }\n } catch (int ex) {\n hbadflag = true;\n hbadx = x, hbady = y;\n hbadeq = eq;\n return false;\n }\n }\n \n REP(y, H) REP(x, W) {\n if (not VBEGIN[x][y]) continue;\n string eq = getv(x, y);\n try {\n result e = equation(eq);\n if (e.value == 0) {\n vbadflag = true;\n vbadx = x, vbady = y;\n vbadeq = eq;\n return false;\n }\n } catch(int ex) {\n vbadflag = true;\n vbadx = x, vbady = y;\n vbadeq = eq;\n return false;\n }\n }\n return true;\n}\n \nbool solve() {\n sort(BLOCK, BLOCK + n);\n do {\n fill_blank();\n if (is_illegal_operand()) continue;\n if (solved()) { return true; }\n } while (next_permutation(BLOCK, BLOCK + n));\n}\n \nvoid init() {\n blanks.clear();\n REP(y, H) REP(x, W) {\n hbadflag = vbadflag = false;\n PRINTED[x][y] = false;\n HBEGIN[x][y] = false;\n VBEGIN[x][y] = false;\n }\n}\n \nint main() {\n while (cin >> H >> W and H + W) {\n init();\n \n REP(y, H) {\n string row;\n cin >> row;\n REP(x, W) {\n TABLE[x][y] = row[x];\n PRINTED[x][y] = row[x] != '.';\n if (row[x] == '.') {\n blanks.push_back(make_pair(x, y));\n }\n }\n }\n \n REP(y, H) REP(x, W) {\n if (TABLE[x][y]!='#' and legal(x+1,y) and TABLE[x+1][y]!='#'\n and (!legal(x-1,y) or TABLE[x-1][y] == '#')) {\n HBEGIN[x][y] = true;\n }\n if (TABLE[x][y]!='#' and legal(x,y+1) and TABLE[x][y+1]!='#'\n and (!legal(x,y-1) or TABLE[x][y-1] == '#')) {\n VBEGIN[x][y] = true;\n }\n }\n \n cin >> n;\n REP(i, n) { cin >> BLOCK[i]; }\n \n cout << (solve() ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 800,
"memory_kb": 1312,
"score_of_the_acc": -0.9775,
"final_rank": 16
},
{
"submission_id": "aoj_1022_1223378",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\nusing namespace std;\n\nconst int inf = 1e9;\n\nint h,w,n;\nstring g[10];\nchar c[10];\nbool use[10];\nint l[10][10], r[10][10], u[10][10], d[10][10];\n\ninline bool valid(const string &s){\n rep(i,s.size()){\n if(s[i]=='0' && (i==0 || !isdigit(s[i-1])) && (i+1<(int)s.size() && isdigit(s[i+1]))){\n return false;\n }\n if(!isdigit(s[i]) && (i==0 || !isdigit(s[i-1]))){\n return false;\n }\n }\n return isdigit(s.back());\n}\n\nint parse(int L, int R, const string &s){\n for(int i=R-1;i>=L;i--){\n if(s[i] == '+' || s[i] == '-'){\n int a = parse(L,i,s), b = parse(i+1,R,s);\n if(a==inf || b==inf)return inf;\n if(s[i] == '+')return a+b;\n if(s[i] == '-')return a-b;\n }\n }\n\n for(int i=R-1;i>=L;i--){\n if(s[i] == '*' || s[i] == '/'){\n int a = parse(L,i,s), b = parse(i+1,R,s);\n if(a==inf || b==inf)return inf;\n if(s[i] == '*')return a*b;\n if(s[i] == '/'){\n\tif(b==0 || a%b)return inf;\n\treturn a/b;\n }\n }\n }\n\n int res = 0;\n for(int i=L;i<R;i++)res = res*10 + (int)(s[i]-'0');\n return res;\n}\n\ninline bool check(const string &s){\n if(!valid(s))return false;\n\n int p = 0;\n while(s[p]!='=')p++;\n assert(p!=(int)s.size());\n int a = parse(0,p,s);\n int b = parse(p+1,s.size(),s);\n if(a==inf || b==inf)return false;\n return a==b;\n}\n\nbool solve(int y, int x){\n if(y==h)return true;\n\n int ny = y, nx = x+1;\n if(nx==w)ny++, nx=0;\n\n if(g[y][x] != '.')return solve(ny,nx);\n\n rep(i,n){\n if(!use[i]){\n use[i] = 1;\n g[y][x] = c[i];\n\n bool f = true;\n if(l[y][x]>=0){\n\tstring s;\n\tfor(int j=l[y][x];j<r[y][x];j++)s += g[y][j];\n\tif(!check(s))f = false;\n }\n\n if(f && u[y][x]>=0){\n\tstring s;\n\tfor(int j=u[y][x];j<d[y][x];j++)s += g[j][x];\n\tif(!check(s))f = false;\n }\n\n if(f && solve(ny,nx))return true;\n\n g[y][x] = '.';\n use[i] = 0;\n }\n }\n return false;\n}\n\nint main(){\n cin.tie(0); ios::sync_with_stdio(0);\n while(cin >> h >> w, h){\n rep(i,h)cin >> g[i];\n cin >> n;\n rep(i,n)cin >> c[i];\n\n memset(l,-1,sizeof(l)); memset(r,-1,sizeof(r));\n memset(u,-1,sizeof(u)); memset(d,-1,sizeof(d));\n rep(i,h)rep(j,w){\n if(g[i][j] == '.'){\n\tint cnt = 0;\n\tfor(int k=j+1;k<w;k++){\n\t if(g[i][k] == '.')cnt++;\n\t if(g[i][k] == '#')break;\n\t}\n\tif(cnt==0){\n\t l[i][j] = 0; r[i][j] = w;\n\t for(int k=j-1;k>=0;k--){\n\t if(g[i][k] == '#'){\n\t l[i][j] = k+1;\n\t break;\n\t }\n\t }\n\t for(int k=j+1;k<w;k++){\n\t if(g[i][k] == '#'){\n\t r[i][j] = k;\n\t break;\n\t }\n\t }\n\t if(r[i][j]-l[i][j]<3)r[i][j] = l[i][j] = -1;\n\t}\n\n\tcnt = 0;\n\tfor(int k=i+1;k<h;k++){\n\t if(g[k][j] == '.')cnt++;\n\t if(g[k][j] == '#')break;\n\t}\n\tif(cnt==0){\n\t u[i][j] = 0; d[i][j] = h;\n\t for(int k=i-1;k>=0;k--){\n\t if(g[k][j] == '#'){\n\t u[i][j] = k+1;\n\t break;\n\t }\n\t }\n\t for(int k=i+1;k<h;k++){\n\t if(g[k][j] == '#'){\n\t d[i][j] = k;\n\t break;\n\t }\n\t }\n\t if(d[i][j]-u[i][j]<3)d[i][j] = u[i][j] = -1;\n\t}\n }\n }\n \n memset(use,0,sizeof(use));\n if(solve(0,0))cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 530,
"memory_kb": 1208,
"score_of_the_acc": -0.6373,
"final_rank": 8
},
{
"submission_id": "aoj_1022_1223369",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\nusing namespace std;\ntypedef long long ll;\n\nconst ll inf = 1e15;\n\nint h,w,n;\nstring g[10];\nchar c[10];\nbool use[10];\nint l[10][10], r[10][10], u[10][10], d[10][10];\n\ninline bool valid(const string &s){\n rep(i,s.size()){\n if( s[i]=='0' && (i==0 || !isdigit(s[i-1])) && (i+1<(int)s.size() && isdigit(s[i+1]))){\n return false;\n }\n if( i>0 && !isdigit(s[i]) && !isdigit(s[i-1])){\n return false;\n }\n }\n if(!isdigit(s[0]) || !isdigit(s.back()))return false;\n return true;\n}\n\nll parse(int L, int R, const string &s){\n assert(R!=L);\n for(int i=R-1;i>=L;i--){\n if(s[i] == '+' || s[i] == '-'){\n ll a = parse(L,i,s), b = parse(i+1,R,s);\n if(a==inf || b==inf)return inf;\n if(s[i] == '+')return a+b;\n if(s[i] == '-')return a-b;\n }\n }\n\n for(int i=R-1;i>=L;i--){\n if(s[i] == '*' || s[i] == '/'){\n ll a = parse(L,i,s), b = parse(i+1,R,s);\n if(a==inf || b==inf)return inf;\n if(s[i] == '*')return a*b;\n if(s[i] == '/'){\n\tif(b==0 || a%b)return inf;\n\treturn a/b;\n }\n }\n }\n\n ll res = 0;\n for(int i=L;i<R;i++)res = res*10LL + (ll)(s[i]-'0');\n return res;\n}\n\ninline bool check(const string &s){\n if(!valid(s))return false;\n\n int p = 0;\n while(s[p]!='=')p++;\n assert(p!=(int)s.size());\n ll a = parse(0,p,s);\n ll b = parse(p+1,s.size(),s);\n if(a==inf || b==inf)return false;\n return a==b;\n}\n\nbool solve(int y, int x){\n if(y==h)return true;\n\n int ny = y, nx = x+1;\n if(nx==w)ny++, nx=0;\n\n if(g[y][x] != '.')return solve(ny,nx);\n\n rep(i,n){\n if(!use[i]){\n use[i] = 1;\n g[y][x] = c[i];\n\n bool f = true;\n if(l[y][x]>=0){\n\tstring s;\n\tfor(int j=l[y][x];j<r[y][x];j++)s += g[y][j];\n\tif(!check(s))f = false;\n }\n\n if(f && u[y][x]>=0){\n\tstring s;\n\tfor(int j=u[y][x];j<d[y][x];j++)s += g[j][x];\n\tif(!check(s))f = false;\n }\n\n if(f && solve(ny,nx))return true;\n\n g[y][x] = '.';\n use[i] = 0;\n }\n }\n return false;\n}\n\nint main(){\n cin.tie(0); ios::sync_with_stdio(0);\n while(cin >> h >> w, h){\n rep(i,h)cin >> g[i];\n cin >> n;\n rep(i,n)cin >> c[i];\n\n bool f = true;\n rep(i,h)rep(j,w){\n if(j==0 || g[i][j-1]=='#'){\n\tstring tmp;\n\trep(k,w){\n\t if(g[i][k] == '#')break;\n\t tmp += g[i][k];\n\t}\n\tif(tmp.size()>=3 && tmp.find('.')==string::npos && !check(tmp))f = false;\n }\n\n if(i==0 || g[i-1][j]=='#'){\n\tstring tmp;\n\trep(k,h){\n\t if(g[k][j] == '#')break;\n\t tmp += g[k][j];\n\t}\n\tif(tmp.size()>=3 && tmp.find('.')==string::npos && !check(tmp))f = false;\n }\n }\n\n if(!f){\n cout << \"No\" << endl;\n continue;\n }\n\n memset(l,-1,sizeof(l)); memset(r,-1,sizeof(r));\n memset(u,-1,sizeof(u)); memset(d,-1,sizeof(d));\n rep(i,h)rep(j,w){\n if(g[i][j] == '.'){\n\tint cnt = 0;\n\tfor(int k=j+1;k<w;k++){\n\t if(g[i][k] == '.')cnt++;\n\t if(g[i][k] == '#')break;\n\t}\n\tif(cnt==0){\n\t l[i][j] = 0; r[i][j] = w;\n\t for(int k=j-1;k>=0;k--){\n\t if(g[i][k] == '#'){\n\t l[i][j] = k+1;\n\t break;\n\t }\n\t }\n\t for(int k=j+1;k<w;k++){\n\t if(g[i][k] == '#'){\n\t r[i][j] = k;\n\t break;\n\t }\n\t }\n\t if(r[i][j]-l[i][j]<3)r[i][j] = l[i][j] = -1;\n\t}\n\n\tcnt = 0;\n\tfor(int k=i+1;k<h;k++){\n\t if(g[k][j] == '.')cnt++;\n\t if(g[k][j] == '#')break;\n\t}\n\tif(cnt==0){\n\t u[i][j] = 0; d[i][j] = h;\n\t for(int k=i-1;k>=0;k--){\n\t if(g[k][j] == '#'){\n\t u[i][j] = k+1;\n\t break;\n\t }\n\t }\n\t for(int k=i+1;k<h;k++){\n\t if(g[k][j] == '#'){\n\t d[i][j] = k;\n\t break;\n\t }\n\t }\n\t if(d[i][j]-u[i][j]<3)d[i][j] = u[i][j] = -1;\n\t}\n }\n }\n \n memset(use,0,sizeof(use));\n if(solve(0,0))cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 510,
"memory_kb": 1216,
"score_of_the_acc": -0.6125,
"final_rank": 6
},
{
"submission_id": "aoj_1022_1174894",
"code_snippet": "// AOJ 1022\n#include<iostream>\n#include<string>\n#include<map>\n#include<algorithm>\n#include<vector>\n#define value first\n#define p second\nusing namespace std;\ntypedef pair<int,int> result;\n\nconst int OutOfIntExc = 1,\n NegIntExc = 2,\n NotEquationExc = 3,\n NotNumExc = 4,\n LackNumExc = 5,\n IterExceedExc = 6;\n\nresult equation(const string &s, int p = 0);\nresult expression(const string &s, int p = 0);\nresult factor(const string &s, int p = 0);\nresult term(const string &s, int p = 0);\n\nresult equation(const string &s, int p) {\n// cout << \"? \" << s << \" \";\n if (s[p] == '=') { throw NotEquationExc; }\n result r = expression(s, p);\n if (s[r.p] != '=') { throw NotEquationExc; }\n \n r.p++; // skip '=';\n result t = expression(s, r.p);\n t.value = (int)(r.value == t.value);\n\n// cout << (t.value ? \"T\" : \"F\") << endl;\n \n return t;\n}\n\n\nresult expression(const string &s, int p) {\n result r = factor(s, p);\n while (s[r.p] == '+' or s[r.p] == '-') {\n result r_ = factor(s, r.p+1);\n r.value += (s[r.p] == '+' ? r_.value : - r_.value);\n if (r.value < 0) { throw NegIntExc; }\n r.p = r_.p;\n }\n return r;\n}\n\nresult factor(const string &s, int p) {\n result r = term(s, p);\n while (s[r.p] == '*' or s[r.p] == '/') {\n result r_ = term(s, r.p+1);\n if (s[r.p] == '*') {\n r.value *= r_.value;\n } else {\n if (r_.value == 0 or r.value % r_.value != 0) { \n throw OutOfIntExc; \n }\n r.value /= r_.value;\n }\n r.p = r_.p;\n }\n return r;\n}\n\nresult term(const string &s, int p) {\n if (not isdigit(s[p])) { throw LackNumExc; }\n int value = 0;\n bool flag = false;\n\n while (isdigit(s[p])) {\n if (flag and value == 0) { throw NotNumExc; }\n flag = true;\n value = value * 10 + (s[p++] - '0');\n }\n return result(value, p);\n}\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\nint H, W, n;\nconst int HMAX = 200, WMAX = 200, NMAX = 200;\nchar TABLE[HMAX][WMAX];\nbool PRINTED[HMAX][WMAX], HBEGIN[HMAX][WMAX], VBEGIN[HMAX][WMAX];\nchar BLOCK[NMAX];\n\nbool legal(int x, int y) {\n return 0 <= x and x < W and 0 <= y and y < H;\n}\n\nvector<pair<int,int>> blanks;\n\nvoid fill_blank() {\n int i = 0;\n REP(i, n) {\n int x = blanks[i].first, y = blanks[i].second;\n TABLE[x][y] = BLOCK[i];\n }\n}\n\nstring getv(int x, int y) {\n string str;\n while (legal(x, y) and TABLE[x][y] != '#') { \n str.push_back(TABLE[x][y]);\n y++; \n }\n return str;\n}\n\nstring geth(int x, int y) {\n string str;\n while (legal(x, y) and TABLE[x][y] != '#') { \n str.push_back(TABLE[x][y]);\n x++; \n }\n return str;\n}\n\nbool is_operand(char c) {\n return c == '=' or c == '+' or c == '-' or c == '*' or c == '/';\n}\n\nbool is_illegal_operand() {\n REP(y, H) REP(x, W) {\n if (PRINTED[x][y]) continue;\n if (not is_operand(TABLE[x][y])) continue;\n const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};\n REP(i, 4) {\n int nx = x + dx[i], ny = y + dy[i];\n if (legal(nx, ny) and is_operand(TABLE[nx][ny])) {\n return true;\n }\n }\n }\n\n REP(y, H) REP(x,W) {\n if ((VBEGIN[x][y] or HBEGIN[x][y]) and is_operand(TABLE[x][y])) {\n return true;\n }\n }\n return false;\n}\n\nint hbadx, hbady, vbadx, vbady;\nbool hbadflag, vbadflag;\nstring hbadeq, vbadeq;\n\nbool solved() {\n if (hbadflag and geth(hbadx, hbady) == hbadeq) return false;\n if (vbadflag and geth(vbadx, vbady) == vbadeq) return false;\n REP(y, H) REP(x, W) {\n if (not HBEGIN[x][y]) continue;\n string eq = geth(x, y);\n try {\n result e = equation(eq);\n if (e.value == 0) {\n hbadflag = true;\n hbadx = x, hbady = y;\n hbadeq = eq;\n return false; \n }\n } catch (int ex) {\n hbadflag = true;\n hbadx = x, hbady = y;\n hbadeq = eq;\n return false;\n }\n }\n\n REP(y, H) REP(x, W) {\n if (not VBEGIN[x][y]) continue;\n string eq = getv(x, y);\n try {\n result e = equation(eq);\n if (e.value == 0) {\n vbadflag = true;\n vbadx = x, vbady = y;\n vbadeq = eq;\n return false; \n }\n } catch(int ex) {\n vbadflag = true;\n vbadx = x, vbady = y;\n vbadeq = eq;\n return false;\n }\n }\n return true;\n}\n\nbool solve() {\n sort(BLOCK, BLOCK + n);\n do {\n fill_blank();\n if (is_illegal_operand()) continue;\n if (solved()) { return true; }\n } while (next_permutation(BLOCK, BLOCK + n));\n}\n\nvoid init() {\n blanks.clear();\n REP(y, H) REP(x, W) {\n hbadflag = vbadflag = false;\n PRINTED[x][y] = false;\n HBEGIN[x][y] = false;\n VBEGIN[x][y] = false;\n }\n}\n\nint main() {\n while (cin >> H >> W and H + W) {\n init();\n\n REP(y, H) {\n string row;\n cin >> row;\n REP(x, W) {\n TABLE[x][y] = row[x];\n PRINTED[x][y] = row[x] != '.';\n if (row[x] == '.') {\n blanks.push_back(make_pair(x, y));\n }\n }\n }\n\n REP(y, H) REP(x, W) {\n if (TABLE[x][y]!='#' and legal(x+1,y) and TABLE[x+1][y]!='#'\n and (!legal(x-1,y) or TABLE[x-1][y] == '#')) {\n HBEGIN[x][y] = true;\n }\n if (TABLE[x][y]!='#' and legal(x,y+1) and TABLE[x][y+1]!='#'\n and (!legal(x,y-1) or TABLE[x][y-1] == '#')) {\n VBEGIN[x][y] = true;\n }\n }\n\n cin >> n;\n REP(i, n) { cin >> BLOCK[i]; }\n\n cout << (solve() ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 810,
"memory_kb": 1312,
"score_of_the_acc": -0.99,
"final_rank": 17
},
{
"submission_id": "aoj_1022_1164555",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\ntuple<int,int> number(const string& s,int i)\n{\n\tint x=0;\n\tif(i>=s.size() || !isdigit(s[i])) return mt(INF,-1);\n\tfor(int len=0;i<s.size() && isdigit(s[i]);i++,len++){\n\t\tif(len==1 && x==0) return mt(INF,-1);\n\t\tx=x*10+s[i]-'0';\n\t}\n\treturn mt(x,i);\n}\ntuple<int,int> term(const string& s,int i)\n{\n\tint x; tie(x,i)=number(s,i);\n\tif(i==-1) return mt(INF,-1);\n\twhile(i<s.size() && (s[i]=='*' || s[i]=='/')){\n\t\tchar op=s[i];\n\t\tint y; if(get<1>(tie(y,i)=number(s,i+1))==-1) return mt(INF,-1);\n\t\tif(op=='*') x*=y;\n\t\tif(op=='/'){\n\t\t\tif(y==0 || x%y>0) return mt(INF,-1);\n\t\t\tx/=y;\n\t\t}\n\t}\n\treturn mt(x,i);\n}\ntuple<int,int> expr(const string& s,int i)\n{\n\tint x; if(get<1>(tie(x,i)=term(s,i))==-1) return mt(INF,-1);\n\twhile(i<s.size()){\n\t\tchar op=s[i];\n\t\tif(op!='+' && op!='-') return mt(INF,-1);\n\t\tint y; if(get<1>(tie(y,i)=term(s,i+1))==-1) return mt(INF,-1);\n\t\tif(op=='+') x+=y;\n\t\tif(op=='-') x-=y;\n\t}\n\treturn mt(x,i);\n}\n\nbool check(const vector<char*>& f)\n{\n\tstring s; for(char* p:f) s+=*p;\n\tif(count(all(s),'=')!=1) return false;\n\tint eq=s.find('=');\n\tif(eq==0 || eq==s.size()-1) return false;\n\tstring a=s.substr(0,eq),b=s.substr(eq+1);\n\tauto x=get<0>(expr(a,0)),y=get<0>(expr(b,0));\n\treturn x!=INF && y!=INF && x==y;\n}\n\nbool solve(int i,vs& grid,string& cs,const vi& is,const vi& js,const vector<vector<char*>>& fs,const vvi& ds)\n{\n\tif(i==cs.size()) return true;\n\t\n\tfor(char& c:cs) if(c!='X'){\n\t\tgrid[is[i]][js[i]]=c; c='X';\n\t\tif(all_of(all(ds[i]),[&](int j){return check(fs[j]);}))\n\t\t\tif(solve(i+1,grid,cs,is,js,fs,ds))\n\t\t\t\treturn true;\n\t\tc=grid[is[i]][js[i]];\n\t}\n\treturn false;\n}\n\nint main()\n{\n\tfor(int h,w;cin>>h>>w && h|w;){\n\t\tvs grid(h);\n\t\trep(i,h) cin>>grid[i];\n\t\tint n; cin>>n;\n\t\tstring cs(n,'~');\n\t\trep(i,n) cin>>cs[i];\n\t\t\n\t\tvi is,js;\n\t\trep(i,h) rep(j,w) if(grid[i][j]=='.'){\n\t\t\tis.push_back(i);\n\t\t\tjs.push_back(j);\n\t\t}\n\t\tvector<vector<char*>> fs;\n\t\trep(i,h) rep(j,w) if(grid[i][j]!='#'){\n\t\t\tif((i==0 || grid[i-1][j]=='#') && i<h-1 && grid[i+1][j]!='#'){\n\t\t\t\tvector<char*> f;\n\t\t\t\tfor(int k=i;k<h && grid[k][j]!='#';k++)\n\t\t\t\t\tf.push_back(&grid[k][j]);\n\t\t\t\tfs.push_back(f);\n\t\t\t}\n\t\t\tif((j==0 || grid[i][j-1]=='#') && j<w-1 && grid[i][j+1]!='#'){\n\t\t\t\tvector<char*> f;\n\t\t\t\tfor(int k=j;k<w && grid[i][k]!='#';k++)\n\t\t\t\t\tf.push_back(&grid[i][k]);\n\t\t\t\tfs.push_back(f);\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(any_of(all(fs),[&](const vector<char*>& f)->bool{\n\t\t\t\tstring s; for(char* p:f) s+=*p;\n\t\t\t\treturn s.find('.')==-1 && !check(f);\n\t\t\t})){\n\t\t\tcout<<\"No!\"<<endl;\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tvvi ds(n);\n\t\t{\n\t\t\tvi vis(fs.size());\n\t\t\trep(i,n){\n\t\t\t\tgrid[is[i]][js[i]]='?';\n\t\t\t\trep(j,fs.size()) if(!vis[j]){\n\t\t\t\t\tstring s; for(char* p:fs[j]) s+=*p;\n\t\t\t\t\tif(s.find('.')==-1)\n\t\t\t\t\t\tds[i].push_back(j),vis[j]=1;\n\t\t\t\t}\n\t\t\t}\n\t\t\trep(i,n) grid[is[i]][js[i]]='.';\n\t\t}\n\t\t\n\t\tcout<<(solve(0,grid,cs,is,js,fs,ds)?\"Yes\":\"No\")<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 620,
"memory_kb": 1240,
"score_of_the_acc": -0.7506,
"final_rank": 10
},
{
"submission_id": "aoj_1022_1164504",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\ninline pii number(const string& s,int i)\n{\n\tint x=0;\n\tif(i>=s.size() || !isdigit(s[i])) return mp(INF,-1);\n\tfor(int len=0;i<s.size() && isdigit(s[i]);i++,len++){\n\t\tif(len==1 && x==0) return mp(INF,-1);\n\t\tx=x*10+s[i]-'0';\n\t}\n\treturn mp(x,i);\n}\ninline pii term(const string& s,int i)\n{\n\tint x; tie(x,i)=number(s,i);\n\tif(i==-1) return mp(INF,-1);\n\twhile(i<s.size() && (s[i]=='*' || s[i]=='/')){\n\t\tchar op=s[i];\n\t\tint y; tie(y,i)=number(s,i+1);\n\t\tif(i==-1) return mp(INF,-1);\n\t\tif(op=='*') x*=y;\n\t\tif(op=='/'){\n\t\t\tif(y==0 || x%y>0) return mp(INF,-1);\n\t\t\tx/=y;\n\t\t}\n\t}\n\treturn mp(x,i);\n}\ninline pii expr(const string& s,int i)\n{\n\tint x; tie(x,i)=term(s,i);\n\tif(i==-1) return mp(INF,-1);\n\twhile(i<s.size()){\n\t\tchar op=s[i];\n\t\tif(op!='+' && op!='-') return mp(INF,-1);\n\t\tint y; tie(y,i)=term(s,i+1);\n\t\tif(i==-1) return mp(INF,-1);\n\t\tif(op=='+') x+=y;\n\t\tif(op=='-') x-=y;\n\t}\n\treturn mp(x,i);\n}\nint expr(const string& s)\n{\n\treturn expr(s,0).first;\n}\n\nbool check(const vs& grid,const vector<pii>& f)\n{\n\tstring s;\n\tfor(auto p:f) s+=grid[p.first][p.second];\n\tif(count(all(s),'=')!=1) return false;\n\tint eq=s.find('=');\n\tif(eq==0 || eq==s.size()-1) return false;\n\tstring a=s.substr(0,eq),b=s.substr(eq+1);\n\t\n\tint x=expr(a),y=expr(b);\n\t//dump(mt(s,x,y));\n\tif(x==INF || y==INF || x!=y)\n\t\treturn false;\n\treturn true;\n}\n\nbool solve(int i,vs& grid,string& cs,vector<pii>& ps,vector<vector<pii>>& fs,vvi& ds)\n{\n\tint n=ps.size();\n\tif(i==n) return true;\n\t\n\tfor(char& c:cs) if(c!='X'){\n\t\tgrid[ps[i].first][ps[i].second]=c; c='X';\n\t\tif(all_of(all(ds[i]),[&](int j){return check(grid,fs[j]);}))\n\t\t\tif(solve(i+1,grid,cs,ps,fs,ds))\n\t\t\t\treturn true;\n\t\tc=grid[ps[i].first][ps[i].second];\n\t}\n\treturn false;\n}\n\nint main()\n{\n\tfor(int h,w;cin>>h>>w && h|w;){\n\t\tvs grid(h);\n\t\trep(i,h) cin>>grid[i];\n\t\tint n; cin>>n;\n\t\tstring cs(n,'~');\n\t\trep(i,n) cin>>cs[i];\n\t\t\n\t\tvector<pii> ps;\n\t\tvector<vector<pii>> fs;\n\t\trep(i,h) rep(j,w){\n\t\t\tif(grid[i][j]=='.') ps.emplace_back(i,j);\n\t\t\tif(grid[i][j]!='#'){\n\t\t\t\tif((i==0 || grid[i-1][j]=='#') && i<h-1 && grid[i+1][j]!='#'){\n\t\t\t\t\tvector<pii> f;\n\t\t\t\t\tfor(int k=i;k<h && grid[k][j]!='#';k++)\n\t\t\t\t\t\tf.emplace_back(k,j);\n\t\t\t\t\tfs.emplace_back(f);\n\t\t\t\t}\n\t\t\t\tif((j==0 || grid[i][j-1]=='#') && j<w-1 && grid[i][j+1]!='#'){\n\t\t\t\t\tvector<pii> f;\n\t\t\t\t\tfor(int k=j;k<w && grid[i][k]!='#';k++)\n\t\t\t\t\t\tf.emplace_back(i,k);\n\t\t\t\t\tfs.emplace_back(f);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tvvi ds(n+1);\n\t\t{\n\t\t\tvi vis(fs.size());\n\t\t\trep(i,n+1){\n\t\t\t\trep(j,fs.size()) if(!vis[j]){\n\t\t\t\t\tstring s;\n\t\t\t\t\tfor(auto p:fs[j]) s+=grid[p.first][p.second];\n\t\t\t\t\tif(count(all(s),'.')==0){\n\t\t\t\t\t\tds[i].push_back(j);\n\t\t\t\t\t\tvis[j]=1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(i<n) grid[ps[i].first][ps[i].second]='?';\n\t\t\t}\n\t\t\trep(i,n)\n\t\t\t\tgrid[ps[i].first][ps[i].second]='.';\n\t\t\trotate(begin(ds),1+all(ds));\n\t\t}\n\t\t\n\t\tif(!all_of(all(ds[n]),[&](int j){return check(grid,fs[j]);})){\n\t\t\tcout<<\"No\"<<endl;\n\t\t\tcontinue;\n\t\t}\n\t\tcout<<(solve(0,grid,cs,ps,fs,ds)?\"Yes\":\"No\")<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 620,
"memory_kb": 1240,
"score_of_the_acc": -0.7506,
"final_rank": 10
},
{
"submission_id": "aoj_1022_1139505",
"code_snippet": "#include <bits/stdc++.h>\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n\nusing namespace std;\n\npair<int,int> num(const string &f, int i) {\n int n = 0;\n if (i >= f.size() || !isdigit(f[i])) throw \"puee\";\n while(i < f.size()) {\n if(!isdigit(f[i])) return make_pair(n,i);\n n *= 10;\n n += f[i] - '0';\n ++i;\n }\n return make_pair(n,i);\n}\n\nbool ispm(char c) { return c == '+' || c == '-'; }\nbool istd(char c) { return c == '*' || c == '/'; }\n\npair<int,int> mult(const string &f, int i) {\n int n;\n tie(n,i) = num(f,i);\n while(i != f.size() && istd(f[i])) {\n auto np = num(f,i+1);\n if(f[i] == '*') {\n n *= np.first;\n }else if(f[i] == '/') {\n if (np.first == 0) throw \"guee\";\n n /= np.first;\n }\n i = np.second;\n }\n return make_pair(n,i);\n}\n\npair<int,int> add(const string &f, int i) {\n int n;\n tie(n,i) = mult(f,i);\n while(i != f.size() && ispm(f[i])) {\n auto np = mult(f,i+1);\n if(f[i] == '+') {\n n += np.first;\n }else if(f[i] == '-') {\n n -= np.first;\n }\n i = np.second;\n }\n return make_pair(n,i);\n}\n\nbool is_valid(const string &f, int st, int ed) {\n int p,q;\n try {\n tie(p,st) = add(f, st);\n if (st >= ed) return false;\n tie(q,st) = add(f, st+1);\n } catch(...) {\n return false;\n }\n return st == ed && p == q;\n}\n\nbool is_invalid(const string &f, int st, int ed) {\n string s = \"+-*/=\";\n bool prev = true;\n for(int i=st;i < ed; ++i) {\n if(s.find(f[i]) != string::npos) {\n if (prev) return true;\n prev = true;\n } else {\n prev = false;\n }\n }\n return prev;\n}\n\nbool is_closed(const string &f, int st, int ed) {\n for(int i=st;i < ed;++i) if (f[i] == '.') return false;\n return true;\n}\n\nbool is_valid_2_impl(const vector<string> &tb) {\n for(auto &line : tb) {\n int old = 0;\n REP(i,line.size()) {\n if(!i) continue;\n if (line[i] == '#') {\n if (i-old-1 >= 3){\n if(is_closed(line,old+1,i)\n && !is_valid(line,old+1,i)) return false;\n }\n old = i;\n }\n }\n }\n return true;\n}\n\nbool is_valid_2(const vector<string> &tb) {\n if(!is_valid_2_impl(tb)) return false;\n vector<string> tr(tb[0].size());\n REP(i,tb.size())\n REP(j,tb[0].size())\n tr[j] += tb[i][j];\n return is_valid_2_impl(tr);\n}\n\nbool is_bad(const string &str, int s, int t) {\n return is_invalid(str,s,t) ||\n (is_closed(str,s,t) && !is_valid(str,s,t));\n}\n\nbool search(vector<string> &tb, vector<tuple<int,int>> op, const vector<string> &v) {\n if (op.empty()) return true;\n int i,j;\n tie(i,j) = op.back();\n op.pop_back();\n int n=v.size();\n REP(k,n) {\n auto cp = v;\n cp.erase(begin(cp)+k);\n tb[i][j] = v[k][0];\n int s,t;\n s=t=i;\n while(tb[s][j] != '#') --s;\n while(tb[t][j] != '#') ++t;\n ++s;\n int l=t-s;\n if (t-s >= 3) {\n string str;\n REP(m,l) str += tb[s+m][j];\n if(is_bad(str,0,l)) continue;\n }\n s=t=j;\n while(tb[i][s] != '#') --s;\n while(tb[i][t] != '#') ++t;\n ++s;\n if(t-s >= 3 && is_bad(tb[i],s,t)) continue;\n if (search(tb,op,cp)){\n tb[i][j] = '.';\n return true;\n }\n }\n tb[i][j] = '.';\n return false;\n}\n\nint main() {\n while(1){\n int h,w;\n cin>>h>>w;\n if(!h) break;\n vector<string> tb(h+2,string(w+2,'#'));\n REP(i,h){\n string l;\n cin>>l;\n tb[i+1] = '#' + l + '#';\n }\n h+=2;w+=2;\n int n;\n cin>>n;\n vector<string> v(n);\n REP(i,n) cin>>v[i];\n vector<tuple<int,int>> op;\n REP(i,h)REP(j,w)if(tb[i][j]=='.')op.emplace_back(i,j);\n if (!is_valid_2(tb)) {\n cout << \"No\" << endl;\n continue;\n }\n bool ans = search(tb,op,v);\n if (ans)\n cout << \"Yes\" << endl;\n else\n cout << \"No\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 650,
"memory_kb": 1228,
"score_of_the_acc": -0.7878,
"final_rank": 14
},
{
"submission_id": "aoj_1022_1139489",
"code_snippet": "#include <bits/stdc++.h>\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n\nusing namespace std;\n\npair<int,int> num(const string &f, int i) {\n int n = 0;\n if (i >= f.size() || f[i] < '0' || f[i] > '9') throw \"puee\";\n while(i < f.size()) {\n if(f[i] < '0' || f[i] > '9') return make_pair(n,i);\n n *= 10;\n n += f[i] - '0';\n ++i;\n }\n return make_pair(n,i);\n}\n\npair<int,int> mult(const string &f, int i) {\n auto p = num(f,i);\n while(p.second != f.size()) {\n if(f[p.second] == '*') {\n auto np = num(f,p.second+1);\n p.first *= np.first;\n p.second = np.second;\n }else if(f[p.second] == '/') {\n auto np = num(f,p.second+1);\n if (np.first == 0) throw \"guee\";\n p.first /= np.first;\n p.second = np.second;\n }else break;\n }\n return p;\n}\n\npair<int,int> add(const string &f, int i) {\n auto p = mult(f,i);\n while(p.second != f.size()) {\n if(f[p.second] == '+') {\n auto np = mult(f,p.second+1);\n p.first += np.first;\n p.second = np.second;\n }else if(f[p.second] == '-') {\n auto np = mult(f,p.second+1);\n p.first -= np.first;\n p.second = np.second;\n }else break;\n }\n return p;\n}\n\nbool is_valid(const string &f, int st, int ed) {\n auto p = add(f, st);\n if (p.second >= ed) return false;\n auto q = add(f, p.second+1);\n return q.second == ed && p.first == q.first;\n}\n\nbool is_invalid(const string &f, int st, int ed) {\n string s = \"+-*/=\";\n bool prev = true;\n for(int i=st;i < ed; ++i) {\n if(s.find(f[i]) != string::npos) {\n if (prev) return true;\n prev = true;\n } else {\n prev = false;\n }\n }\n return prev;\n}\n\nbool is_closed(const string &f, int st, int ed) {\n for(int i=st;i < ed;++i) if (f[i] == '.') return false;\n return true;\n}\n\nbool is_valid_2_impl(const vector<string> &tb) {\n for(auto &line : tb) {\n int old = 0;\n REP(i,line.size()) {\n if(!i) continue;\n if (line[i] == '#') {\n if (i-old-1 >= 3){\n if(is_closed(line,old+1,i)\n && !is_valid(line,old+1,i)) return false;\n }\n old = i;\n }\n }\n }\n return true;\n}\n\nbool is_valid_2(const vector<string> &tb) {\n if(!is_valid_2_impl(tb)) return false;\n vector<string> tr(tb[0].size());\n REP(i,tb.size()){\n REP(j,tb[0].size()){\n tr[j] += tb[i][j];\n }\n }\n return is_valid_2_impl(tr);\n}\n\nbool search(vector<string> &tb, vector<tuple<int,int>> op, const vector<string> &v) {\n if (op.empty()) return true;\n int i,j;\n tie(i,j) = op.back();\n op.pop_back();\n int n=v.size();\n REP(k,n) {\n auto cp = v;\n cp.erase(begin(cp)+k);\n tb[i][j] = v[k][0];\n int s,t;\n s=t=i;\n while(tb[s][j] != '#') --s;\n while(tb[t][j] != '#') ++t;\n ++s;\n if (t-s >= 3) {\n string str;\n REP(l,t-s) str += tb[s+l][j];\n if (is_invalid(str,0,str.size())) continue;\n try {\n if(is_closed(str,0,str.size())\n && !is_valid(str,0,str.size())) continue;\n } catch(...) {\n continue;\n }\n }\n s=t=j;\n while(tb[i][s] != '#') --s;\n while(tb[i][t] != '#') ++t;\n ++s;\n if(t-s >= 3) {\n if (is_invalid(tb[i],s,t)) continue;\n try{\n if(is_closed(tb[i],s,t) && !is_valid(tb[i],s,t)) continue;\n } catch(...) {\n continue;\n }\n }\n if (search(tb,op,cp)){\n tb[i][j] = '.';\n return true;\n }\n }\n tb[i][j] = '.';\n return false;\n}\n\nint main() {\n while(1){\n int h,w;\n cin>>h>>w;\n if(!h) break;\n vector<string> tb(h+2,string(w+2,'#'));\n REP(i,h){\n string l;\n cin>>l;\n tb[i+1] = '#' + l + '#';\n }\n h+=2;w+=2;\n int n;\n cin>>n;\n vector<string> v(n);\n REP(i,n) cin>>v[i];\n vector<tuple<int,int>> op;\n REP(i,h)REP(j,w)if(tb[i][j]=='.')op.emplace_back(i,j);\n if (!is_valid_2(tb)) {\n cout << \"No\" << endl;\n continue;\n }\n bool ans = search(tb,op,v);\n if (ans)\n cout << \"Yes\" << endl;\n else\n cout << \"No\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 670,
"memory_kb": 1232,
"score_of_the_acc": -0.8129,
"final_rank": 15
},
{
"submission_id": "aoj_1022_902037",
"code_snippet": "#include <algorithm>\n#include <array>\n#include <cctype>\n#include <cstdlib>\n#include <iostream>\n#include <utility>\n#include <vector>\n#include <unordered_set>\nusing namespace std;\n\nconstexpr int MAX_SIZE = 10;\nconstexpr int MAX_N = 10;\n\nint h, w;\narray<string, MAX_SIZE> puzzle;\n\nint n;\narray<char, MAX_N> in;\n\narray<bool, MAX_N> used;\narray<char, 128> letters;\narray<bool, 128> is_operator;\narray<bool, MAX_N> not_operator;\narray<bool, MAX_N> not_zero;\narray<unordered_set<int>, MAX_N> left_idx, right_idx;\n\nint number(string::const_iterator &it) {\n\tint res = 0;\n\twhile(isdigit(*it)) {\n\t\tres = res * 10 + (*it - '0');\n\t\t++it;\n\t}\n\treturn res;\n}\n\nint factor(string::const_iterator &it) {\n\tif(isdigit(*it)) return number(it);\n\tthrow \"parse error\";\n}\n\nint term(string::const_iterator &it) {\n\tint res = factor(it);\n\twhile(true) {\n\t\tswitch(*it) {\n\t\tcase '*':\n\t\t{\n\t\t\t++it;\n\t\t\tres *= factor(it);\n\t\t\tbreak;\n\t\t}\n\t\tcase '/':\n\t\t{\n\t\t\t++it;\n\t\t\tconst int tmp = factor(it);\n\t\t\tif(tmp == 0) throw \"division by zero\";\n\t\t\tif(res % tmp) throw \"division leaving a remainder\";\n\t\t\tres /= tmp;\n\t\t\tbreak;\n\t\t}\n\t\tdefault:\n\t\t\treturn res;\n\t\t}\n\t}\n\treturn res;\n}\n\nint expr(string::const_iterator &it) {\n\tint res = term(it);\n\n\twhile(true) {\n\t\tswitch(*it) {\n\t\tcase '+':\n\t\t{\n\t\t\t++it;\n\t\t\tres += term(it);\n\t\t\tbreak;\n\t\t}\n\t\tcase '-':\n\t\t{\n\t\t\t++it;\n\t\t\tres -= term(it);\n\t\t\tbreak;\n\t\t}\n\t\tdefault:\n\t\t\treturn res;\n\t\t}\n\t}\n}\n\nbool valid(const vector<int> &expression) {\n\tconst int n = expression.size();\n\tstring left = \"\", right = \"\";\n\tint i;\n\n\tfor(i = 0; i < n; ++i) {\n\t\tif(expression[i] == '=') break;\n\t\tleft += letters[expression[i]];\n\t}\n\n\tfor(++i; i < n; ++i) {\n\t\tright += letters[expression[i]];\n\t}\n\n\ttry {\n\t\tstring::const_iterator l_it = left.cbegin(), r_it = right.cbegin();\n\t\tif(expr(l_it) != expr(r_it)) return false;\n\t}\n\tcatch(const char *c) {\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nvoid calc(int &x, int &y, int dx, int dy) {\n\twhile(true) {\n\t\tconst int nx = x + dx;\n\t\tconst int ny = y + dy;\n\t\tif(0 <= nx && nx < w && 0 <= ny && ny < h && puzzle[ny][nx] != '#') {\n\t\t\tx = nx;\n\t\t\ty = ny;\n\t\t}\n\t\telse {\n\t\t\treturn;\n\t\t}\n\t}\n}\n\nvoid update(const vector<int> &expression) {\n\tfor(unsigned i = 0; i < expression.size(); ++i) {\n\t\tif(isdigit(expression[i])) {\n\t\t\tif(i && expression[i - 1] < MAX_SIZE) {\n\t\t\t\tnot_zero[expression[i - 1]] = true;\n\t\t\t}\n\t\t}\n\t\telse if(expression[i] < MAX_SIZE) { // space\n\t\t\tif(i) {\n\t\t\t\tif(expression[i - 1] < MAX_SIZE) {\n\t\t\t\t\tleft_idx[expression[i]].insert(expression[i - 1]);\n\t\t\t\t\tright_idx[expression[i - 1]].insert(expression[i]);\n\t\t\t\t}\n\t\t\t\tif(i + 1 == expression.size()) {\n\t\t\t\t\tnot_operator[expression[i]] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tnot_operator[expression[i]] = true;\n\t\t\t}\n\t\t}\n\t\telse { // operator\n\t\t\tif(expression[i - 1] < MAX_SIZE) {\n\t\t\t\tnot_operator[expression[i - 1]] = true;\n\t\t\t}\n\t\t\tif(i + 1 < expression.size() && expression[i + 1] < MAX_SIZE) {\n\t\t\t\tnot_operator[expression[i + 1]] = true;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvector<pair<int, vector<int>>> construct() {\n\tvector<vector<int>> idx(h, vector<int>(w, -1));\n\tint next = 0;\n\n\tvector<pair<int, vector<int>>> expressions;\n\texpressions.reserve(40);\n\tfor(int i = 0; i < h; ++i) {\n\t\tfor(int j = 0; j < w; ++j) {\n\t\t\tif(puzzle[i][j] == '=') {\n\t\t\t\t// vertical\n\t\t\t\tint s = i, g = i;\n\t\t\t\tcalc(j, s, 0, -1);\n\t\t\t\tcalc(j, g, 0, 1);\n\n\t\t\t\tif(s != i && g != i) {\n\t\t\t\t\tvector<int> expression;\n\t\t\t\t\texpression.reserve(g - s + 1);\n\t\t\t\t\tint max_index = -1;\n\t\t\t\t\tfor(int k = s; k <= g; ++k) {\n\t\t\t\t\t\tif(puzzle[k][j] == '.') {\n\t\t\t\t\t\t\tif(idx[k][j] == -1) idx[k][j] = next++;\n\t\t\t\t\t\t\texpression.emplace_back(idx[k][j]);\n\t\t\t\t\t\t\tmax_index = max(max_index, idx[k][j]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\texpression.emplace_back(puzzle[k][j]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tupdate(expression);\n\t\t\t\t\texpressions.emplace_back(max_index, expression);\n\t\t\t\t}\n\n\t\t\t\t// horizontal\n\t\t\t\ts = j, g = j;\n\t\t\t\tcalc(s, i, -1, 0);\n\t\t\t\tcalc(g, i, 1, 0);\n\n\t\t\t\tif(s != j && g != j) {\n\t\t\t\t\tvector<int> expression;\n\t\t\t\t\texpression.reserve(g - s + 1);\n\t\t\t\t\tint max_index = -1;\n\t\t\t\t\tfor(int k = s; k <= g; ++k) {\n\t\t\t\t\t\tif(puzzle[i][k] == '.') {\n\t\t\t\t\t\t\tif(idx[i][k] == -1) idx[i][k] = next++;\n\t\t\t\t\t\t\texpression.emplace_back(idx[i][k]);\n\t\t\t\t\t\t\tmax_index = max(max_index, idx[i][k]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\texpression.emplace_back(puzzle[i][k]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tupdate(expression);\n\t\t\t\t\texpressions.emplace_back(max_index, expression);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tsort(expressions.begin(), expressions.end());\n\treturn expressions;\n}\n\nbool dfs(const vector<pair<int, vector<int>>> &expressions, int next, int idx) {\n\twhile(next < expressions.size() && expressions[next].first < idx) {\n\t\tif(!valid(expressions[next].second)) return false;\n\t\t++next;\n\t}\n\tif(next == expressions.size()) return true;\n\n\tfor(int i = 0; i < n; ++i) {\n\t\tif(used[i]) continue;\n\t\tif(is_operator[in[i]] && not_operator[idx]) continue;\n\t\tif(in[i] == '0' && not_zero[idx]) continue;\n\t\tif(i && !used[i - 1] && in[i] == in[i - 1]) continue;\n\n\t\tletters[idx] = in[i];\n\t\tconst auto t_no = not_operator;\n\t\tconst auto t_nz = not_zero;\n\n\t\tif(is_operator[in[i]]) {\n\t\t\tfor(const auto &e : left_idx[idx]) not_operator[e] = true;\n\t\t\tfor(const auto &e : right_idx[idx]) not_operator[e] = true;\n\t\t}\n\t\telse {\n\t\t\tfor(const auto &e : left_idx[idx]) not_zero[e];\n\t\t}\n\n\t\tused[i] = true;\n\t\tif(dfs(expressions, next, idx + 1)) return true;\n\t\tused[i] = false;\n\n\t\tnot_operator = t_no;\n\t\tnot_zero = t_nz;\n\t}\n\n\treturn false;\n}\n\nint main() {\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tis_operator.fill(false);\n\tis_operator['+'] = true;\n\tis_operator['-'] = true;\n\tis_operator['*'] = true;\n\tis_operator['/'] = true;\n\tiota(begin(letters), end(letters), 0);\n\n\twhile(cin >> h >> w && h) {\n\t\tused.fill(false);\n\t\tnot_operator.fill(false);\n\t\tnot_zero.fill(false);\n\t\tfor(int i = 0; i < n; ++i) {\n\t\t\tleft_idx[i].clear();\n\t\t\tright_idx[i].clear();\n\t\t}\n\n\t\tfor(int i = 0; i < h; ++i) {\n\t\t\tcin >> puzzle[i];\n\t\t}\n\n\t\tcin >> n;\n\t\tfor(int i = 0; i < n; ++i) {\n\t\t\tcin >> in[i];\n\t\t}\n\t\tsort(in.begin(), in.begin() + n);\n\n\t\tconst auto expressions = construct();\n\t\tcout << (dfs(expressions, 0, 0) ? \"Yes\\n\" : \"No\\n\");\n\t}\n\n\treturn EXIT_SUCCESS;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 1304,
"score_of_the_acc": -0.1648,
"final_rank": 2
},
{
"submission_id": "aoj_1022_563425",
"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()\n#define chmax(a,b) (a<b?(a=b,1):0)\n#define chmin(a,b) (a>b?(a=b,1):0)\n#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)\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\nchar str[1010];\ntypedef int Int;\n\nInt term(int &i);\nInt fact(int &i);\n\nInt exp(int &i) {\n Int p = term(i);\n while(str[i]=='+' || str[i]=='-') {\n char c = str[i++];\n if (c == '+') {\n Int a = term(i);\n p += a;\n }\n else p -= term(i);\n }\n return p;\n}\n\nInt term(int &i) {\n Int p = fact(i);\n while(str[i]=='*' || str[i]=='/') {\n if (str[i++] == '*') {\n p *= fact(i);\n } else {\n int r = fact(i);\n if (r == 0) throw 0;\n if (p % r == 0) p /= r;\n else throw 0;\n }\n }\n return p;\n}\n\nInt fact(int &i) {\n Int p = 0;\n if (!isdigit(str[i])) throw 0;\n while(isdigit(str[i])) {\n p *= 10;\n p += str[i]-'0';\n i++;\n }\n return p;\n}\n\nInt parse() {\n int id = 0;\n Int res = exp(id);\n if (str[id]) throw 0;\n return res;\n}\n\ninline bool isoperator(char c) {\n return c=='+'||c=='-'||c=='*'||c=='/'||c=='=';\n}\n\nbool check(char *s) {\n try {\n int n = strlen(s);\n int pos = -1;\n REP(i,strlen(s)) if (s[i]=='=') pos = i;\n if (pos == -1 || pos == 0 || pos == n-1) return 0;\n for (int i=0; i<pos; ++i) str[i] = s[i]; str[pos] = 0;\n Int a = parse();\n for (int i=pos+1; i<n; ++i) str[i-pos-1] = s[i]; str[n-pos-1] = 0;\n Int b = parse();\n if (a == b) return 1;\n else return 0;\n } catch(int a) {\n return 0;\n }\n}\n\n\nchar a[10][10];\nchar b[10];\n\nchar eq[100][11];\n\nint h,w;\n\nbool inserted[10][10];\n\npii pos[100];\nint posNum;\nint eqNum;\nbool visited[10][10][2];\n\nvector<pii> ididx[10][10];\nint dotNum[100];\n\nbool bfs(int y, int x, int dy, int dx) {\n char s[11];\n int idx = 0;\n vector<pii> v;\n vector<int> id;\n while(valid(y,x,h,w)) {\n visited[y][x][dy] = 1;\n if (a[y][x] == '#') break;\n if (a[y][x] == '.') {\n v.push_back(pii(y,x));\n id.push_back(idx);\n }\n s[idx++] = a[y][x];\n y += dy;\n x += dx;\n }\n if (idx >= 3) {\n s[idx] = 0;\n if (v.size() == 0 && !check(s)) return 0;\n dotNum[eqNum] = v.size();\n strcpy(eq[eqNum], s);\n REP(i,v.size()) {\n int y = v[i].first, x = v[i].second;\n ididx[y][x].push_back(pii(eqNum,id[i]));\n if (!inserted[y][x]) {\n pos[posNum++] = pii(y,x);\n inserted[y][x] = 1;\n }\n }\n eqNum++;\n }\n return 1;\n}\n\nbool checkOp(int id, int idx) {\n int n = strlen(eq[id]);\n if (idx==0 || idx==n-1) return 1;\n if (isoperator(eq[id][idx-1])) return 1;\n if (isoperator(eq[id][idx+1])) return 1;\n return 0;\n}\n\nconst int dy[4] = {-1,0,1,0};\nconst int dx[4] = {0,1,0,-1};\n\nbool isNumOnly(int now, int y, int x) {\n FOR(it, ididx[y][x]) {\n int id=it->first;\n int idx=it->second;\n if (checkOp(id,idx)) return 1;\n }\n return 0;\n}\n\nbool isHead(int now, int y, int x) {\n FOR(it, ididx[y][x]) {\n int id=it->first;\n int idx=it->second;\n if (idx==0 || isoperator(eq[id][idx-1]))return 1;\n }\n return 0;\n}\n\nbool numOnly[100];\n\nint n;\n\nbool dfs(int S, int now) {\n if (now == posNum) return 1;\n int y = pos[now].first;\n int x = pos[now].second;\n FOR(it, ididx[y][x]) {\n dotNum[it->first]--;\n }\n \n REP(i,n) {\n if (S>>i&1) continue;\n if (!isdigit(b[i]) && isNumOnly(now,y,x)) continue;\n // cout << y << \" \" << x << \" \" << now << \" \" << b[i] << endl;\n // if (b[i] == '0' && isHead(now,y,x)) continue;\n bool f = 1;\n FOR(it, ididx[y][x]) {\n int id = it->first;\n int idx = it->second;\n eq[id][idx] = b[i];\n if (dotNum[id] == 0) {\n f &= check(eq[id]);\n }\n }\n if (f) {\n if (dfs(S|1<<i,now+1)) return 1;\n }\n }\n FOR(it, ididx[y][x]) {\n eq[it->first][it->second] = '.';\n dotNum[it->first]++;\n }\n return 0;\n}\n\nint main() {\n while(cin>>h>>w,h||w) {\n REP(i,h)REP(j,w) {\n cin>>a[i][j];\n }\n cin >> n;\n REP(i,n)cin>>b[i];\n memset(inserted,0,sizeof(inserted));\n memset(visited,0,sizeof(visited));\n posNum = 0, eqNum = 0;\n REP(i,h)REP(j,w)ididx[i][j].clear();\n memset(dotNum,0,sizeof(dotNum));\n REP(i,h) {\n REP(j,w) {\n if (a[i][j] == '#') continue;\n if (!visited[i][j][1]) bfs(i,j,1,0);\n if (!visited[i][j][0]) bfs(i,j,0,1);\n }\n }\n memset(numOnly,0,sizeof(numOnly));\n REP(i,posNum) {\n FOR(it, ididx[pos[i].first][pos[i].second]) {\n numOnly[i] = checkOp(it->first,it->second);\n }\n }\n // REP(i,eqNum) cout << eq[i] << endl;\n // REP(i,posNum) {\n // cout << numOnly[i] << endl;\n // cout << pos[i].first << \" \" << pos[i].second << endl;\n // FOR(it, ididx[pos[i].first][pos[i].second]) {\n // cout << it->first << \":\" << it->second << endl;\n // }cout << endl;\n // }\n cout << (dfs(0,0)?\"Yes\":\"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 510,
"memory_kb": 1288,
"score_of_the_acc": -0.6144,
"final_rank": 7
},
{
"submission_id": "aoj_1022_561207",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <cctype>\nusing namespace std;\n\n#define INF 999999999\n\nint h, w, n;\nchar t[12][12];\nchar p[12];\n\nvector<int> blankX;\nvector<int> blankY;\n\nbool used[12];\nbool isOperator[128];\n\n//式の開始地点でないなら, -1が入る\n//式の開始地点なら, どの座標の空白が埋まれば式判定できるか\n//空白が埋まらなくても式判定できるなら, -2が入る\nint gx0[12][12], gy0[12][12];\nint gx1[12][12], gy1[12][12];\n\n//構文解析用変数\nint idxX;\nint idxY;\nint dir;\n\n//右 下 左 上\nint dx[] = {1, 0, -1, 0};\nint dy[] = {0, 1, 0, -1};\n\n//w*hの範囲内であるならばtrue\nbool inBoard(int x, int y){\n return 0 <= x && x < w && 0 <= y && y < h;\n}\n\n//#でないマス目であるならばtrue\nbool isWhite(int x, int y){\n if(!inBoard(x, y)) return false;\n return t[y][x] != '#';\n}\n\n//演算子が含まれるマスならばtrue\nbool containsOperator(int x, int y){\n if(!inBoard(x, y)) return false;\n return isOperator[t[y][x]];\n}\n\nint N0(){\n if(!isdigit(t[idxY][idxX])){\n return INF;\n }\n\n string valStr;\n\n while(inBoard(idxX, idxY) && isdigit(t[idxY][idxX])){\n valStr += t[idxY][idxX];\n idxX += dx[dir];\n idxY += dy[dir];\n }\n\n if(valStr.length() == 1 || valStr[0] != '0'){\n return atoi(valStr.c_str());\n }\n return INF;\n}\n\nint Term(){\n int lv = N0();\n if(lv == INF) return INF;\n\n while(inBoard(idxX, idxY) && (t[idxY][idxX] == '*' || t[idxY][idxX] == '/')){\n char op = t[idxY][idxX];\n\n idxX += dx[dir];\n idxY += dy[dir];\n\n int rv = N0();\n if(rv == INF) return INF;\n\n if(op == '*'){\n lv *= rv;\n }\n else{\n if(rv == 0 || lv % rv != 0) return INF;\n lv /= rv;\n }\n }\n\n return lv;\n}\n\nint Ex(){\n int lv = Term();\n if(lv == INF) return INF;\n\n while(inBoard(idxX, idxY) && (t[idxY][idxX] == '+' || t[idxY][idxX] == '-')){\n char op = t[idxY][idxX];\n\n idxX += dx[dir];\n idxY += dy[dir];\n\n int rv = Term();\n if(rv == INF) return INF;\n\n if(op == '+') lv += rv;\n else lv -= rv;\n }\n\n return lv;\n}\n\nbool isCorrectEq(){\n //左辺\n int lv = Ex();\n if(lv == INF) return false;\n\n //イコールがあるかどうか\n if(!inBoard(idxX, idxY) || t[idxY][idxX] != '=') return false;\n idxX += dx[dir];\n idxY += dy[dir];\n\n //右辺\n int rv = Ex();\n if(rv == INF) return false;\n\n if(isWhite(idxX, idxY)){\n return false;\n }\n\n return lv == rv;\n}\n\nbool isCorrectBoard(int x, int y){\n /*\n cout<<x<<\",\"<<y<<endl;\n for(int i = 0; i < h; i++){\n cout << t[i] << endl;\n }\n cout<<\"--\\n\";\n */\n\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n if(gx0[i][j] == x && gy0[i][j] == y){\n idxX = j;\n idxY = i;\n dir = 0;\n\n if(!isCorrectEq()) return false;\n }\n if(gx1[i][j] == x && gy1[i][j] == y){\n idxX = j;\n idxY = i;\n dir = 1;\n\n if(!isCorrectEq()) return false;\n }\n }\n }\n\n return true;\n}\n\nbool dfs(int blankIdx){\n if(blankIdx == n){\n return true;\n }\n\n int x = blankX[blankIdx];\n int y = blankY[blankIdx];\n bool digitFlg = false;\n\n //必ず数字を入れなくてはいけないマスであるかチェック\n for(int i = 0; i < 4; i++){\n if(containsOperator(x + dx[i], y + dy[i])){\n digitFlg = true;\n break;\n }\n }\n if(isWhite(x + dx[0], y + dy[0]) + isWhite(x + dx[2], y + dy[2]) == 1){\n digitFlg = true;\n }\n if(isWhite(x + dx[1], y + dy[1]) + isWhite(x + dx[3], y + dy[3]) == 1){\n digitFlg = true;\n }\n\n //ピースを当てはめる\n for(int i = 0; i < n; i++){\n if(used[i]) continue;\n if(digitFlg && isOperator[p[i]]) continue;\n\n used[i] = true;\n t[y][x] = p[i];\n\n if(isCorrectBoard(x, y) && dfs(blankIdx + 1)) return true;\n\n used[i] = false;\n }\n\n return false;\n}\n\nint main(){\n isOperator['+'] = true;\n isOperator['-'] = true;\n isOperator['*'] = true;\n isOperator['/'] = true;\n isOperator['='] = true;\n\n while(cin >> h >> w, h || w){\n for(int i = 0; i < h; i++){\n cin >> t[i];\n }\n\n cin >> n;\n for(int i = 0; i < n; i++){\n cin >> p[i];\n }\n\n blankX.clear();\n blankY.clear();\n\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n if(t[i][j] != '.') continue;\n blankX.push_back(j);\n blankY.push_back(i);\n }\n }\n\n memset(gx0, -1, sizeof(gx0));\n memset(gy0, -1, sizeof(gy0));\n memset(gx1, -1, sizeof(gx1));\n memset(gy1, -1, sizeof(gy1));\n\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n if(t[i][j] == '#') continue;\n\n if(!isWhite(j + 1 * dx[2], i + 1 * dy[2]) &&\n isWhite(j + 1 * dx[0], i + 1 * dy[0]) &&\n isWhite(j + 2 * dx[0], i + 2 * dy[0])){\n int x = j;\n int y = i;\n\n gx0[i][j] = -2;\n gy0[i][j] = -2;\n\n while(inBoard(x, y) && isWhite(x, y)){\n if(t[y][x] == '.'){\n gx0[i][j] = x;\n gy0[i][j] = y;\n }\n x += dx[0];\n y += dy[0];\n }\n }\n if(!isWhite(j + 1 * dx[3], i + 1 * dy[3]) &&\n isWhite(j + 1 * dx[1], i + 1 * dy[1]) &&\n isWhite(j + 2 * dx[1], i + 2 * dy[1])){\n int x = j;\n int y = i;\n\n gx1[i][j] = -2;\n gy1[i][j] = -2;\n\n while(inBoard(x, y) && isWhite(x, y)){\n if(t[y][x] == '.'){\n gx1[i][j] = x;\n gy1[i][j] = y;\n }\n x += dx[1];\n y += dy[1];\n }\n }\n }\n }\n\n bool flg = isCorrectBoard(-2, -2);\n\n if(!flg){\n cout << \"No\\n\";\n continue;\n }\n\n memset(used, 0, sizeof(used));\n cout << (dfs(0) ? \"Yes\" : \"No\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 1232,
"score_of_the_acc": -0.3629,
"final_rank": 4
},
{
"submission_id": "aoj_1022_450772",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing namespace std;\n\nint n; // 空白の数\nstring p; // リストの文字\nvector<vector<string> > formula; // パズル中の数式\nstring change; // 各空白に入れる文字\nbool error; // 式計算のエラー有無\n\nint calculate(const string& s, int a, int b)\n{\n if(a > b){\n error = true;\n return 0;\n }\n\n int k = b;\n while(k >= a && s[k] != '+' && s[k] != '-')\n -- k;\n if(k >= a){\n int x = calculate(s, a, k-1);\n int y = calculate(s, k+1, b);\n if(s[k] == '+')\n return x + y;\n else\n return x - y;\n }\n\n if(b > a && s[a] == '0'){\n error = true;\n return 0;\n }\n\n k = b;\n while(k >= a && s[k] != '*' && s[k] != '/')\n -- k;\n if(k >= a){\n int x = calculate(s, a, k-1);\n int y = calculate(s, k+1, b);\n if(s[k] == '*'){\n return x * y;\n }else{\n if(y == 0 || x % y != 0){\n error = true;\n return 0;\n }\n return x / y;\n }\n }\n\n int ret = 0;\n for(int i=a; i<=b; ++i){\n ret *= 10;\n ret += s[i] - '0';\n }\n\n return ret;\n}\n\nbool check(const string& s)\n{\n int k = s.find('=');\n if(k == string::npos || s.find('=', k+1) != string::npos)\n return false;\n\n error = false;\n bool ret = calculate(s, 0, k-1) == calculate(s, k+1, s.size()-1);\n return !error && ret;\n}\n\nbool solve(int x, bitset<10> bs)\n{\n if(x == n)\n return true;\n\n for(int i=0; i<n; ++i){\n if(bs[i])\n continue;\n bs[i] = true;\n\n change[x] = p[i];\n bool ok = true;\n for(unsigned j=0; j<formula[x].size(); ++j){\n string t = formula[x][j];\n for(unsigned k=0; k<t.size(); ++k){\n if(isalpha(t[k]))\n t[k] = change[t[k]-'a'];\n }\n if(!check(t))\n ok = false;\n }\n\n if(ok && solve(x+1, bs))\n return true;\n\n bs[i] = false;\n }\n\n return false;\n}\n\nint main()\n{\n for(;;){\n int h, w;\n cin >> h >> w;\n if(h == 0)\n return 0;\n\n vector<string> s(h+2, string(w+2, '#'));\n int tmp = 0;\n for(int i=1; i<=h; ++i){\n for(int j=1; j<=w; ++j){\n cin >> s[i][j];\n if(s[i][j] == '.'){\n s[i][j] = 'a' + tmp;\n ++ tmp;\n }\n }\n }\n\n cin >> n;\n p.assign(n, ' ');\n for(int i=0; i<n; ++i)\n cin >> p[i];\n\n bool ng = false;\n formula.assign(n, vector<string>());\n for(int i=0; i<h+2; ++i){\n char c = 0;\n string t;\n for(int j=0; j<w+2; ++j){\n if(s[i][j] != '#'){\n t += s[i][j];\n if(isalpha(s[i][j]))\n c = s[i][j];\n }else{\n if(t.size() >= 3){\n if(c == 0){\n if(!check(t))\n ng = true;\n }else{\n formula[c-'a'].push_back(t);\n }\n }\n c = 0;\n t = \"\";\n }\n }\n }\n for(int j=0; j<w+2; ++j){\n char c = 0;\n string t;\n for(int i=0; i<h+2; ++i){\n if(s[i][j] != '#'){\n t += s[i][j];\n if(isalpha(s[i][j]))\n c = s[i][j];\n }else{\n if(t.size() > 2){\n if(c == 0){\n if(!check(t))\n ng = true;\n }else{\n formula[c-'a'].push_back(t);\n }\n }\n c = 0;\n t = \"\";\n }\n }\n }\n if(ng){\n cout << \"No\" << endl;\n continue;\n }\n\n change.assign(n, ' ');\n if(solve(0, 0))\n cout << \"Yes\" << endl;\n else\n cout << \"No\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 580,
"memory_kb": 920,
"score_of_the_acc": -0.6922,
"final_rank": 9
},
{
"submission_id": "aoj_1022_337419",
"code_snippet": "#include<cctype>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nint idx;\nchar s[11];\nbool res;\n\n#define ASRT if(!res) return 0\n\nint N(){\n\tif(!('1'<=s[idx] && s[idx]<='9')){ res=false; ASRT; }\n\tint a=0;\n\twhile(isdigit(s[idx])) a=10*a+s[idx++]-'0';\n\treturn a;\n}\n\nint N0(){\n\tint a;\n\tif(s[idx]=='0'){\n\t\tidx++;\n\t\ta=0;\n\t}\n\telse a=N();\n\tASRT;\n\treturn a;\n}\n\nint Ex2(){\n\tint a=N0();\n\tASRT;\n\twhile(s[idx]=='*' || s[idx]=='/'){\n\t\tchar op=s[idx++];\n\t\tint b=N0();\n\t\tASRT;\n\t\tif(op=='/' && (b==0 || a%b!=0)){ res=false; ASRT; }\n\n\t\tif(op=='*') a*=b;\n\t\tif(op=='/') a/=b;\n\t}\n\treturn a;\n}\n\nint Ex1(){\n\tint a=Ex2();\n\tASRT;\n\twhile(s[idx]=='+' || s[idx]=='-'){\n\t\tchar op=s[idx++];\n\t\tint b=Ex2();\n\t\tASRT;\n\n\t\tif(op=='+') a+=b;\n\t\tif(op=='-') a-=b;\n\t}\n\treturn a;\n}\n\nint Eq(){\n\tint a=Ex1();\n\tASRT;\n\tif(s[idx++]!='='){ res=false; ASRT; }\n\tint b=Ex1();\n\tASRT;\n\tif(a!=b || s[idx]) res=false;\n\treturn 0;\n}\n\nbool parse(){\n\tif(strlen(s)<=2) return true;\n\tidx=0;\n\tres=true;\n\tEq();\n\treturn res;\n}\n\nint h,w;\nchar B[10][11];\n\nbool calc_no_space(){\n\trep(i,h){\n\t\tint p=-1;\n\t\trep(j,w+1){\n\t\t\tif(j<w && B[i][j]!='#'){\n\t\t\t\tif(p==-1) p=j;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif(p!=-1){\n\t\t\t\t\trep(k,j-p) s[k]=B[i][p+k];\n\t\t\t\t\ts[j-p]='\\0';\n\t\t\t\t\tif(strchr(s,'.')==0 && !parse()) return false;\n\t\t\t\t\tp=-1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\trep(j,w){\n\t\tint p=-1;\n\t\trep(i,h+1){\n\t\t\tif(i<h && B[i][j]!='#'){\n\t\t\t\tif(p==-1) p=i;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif(p!=-1){\n\t\t\t\t\trep(k,i-p) s[k]=B[p+k][j];\n\t\t\t\t\ts[i-p]='\\0';\n\t\t\t\t\tif(strchr(s,'.')==0 && !parse()) return false;\n\t\t\t\t\tp=-1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\n}\n\nchar key[10];\nint n,qx[10],qy[10];\nbool dfs(int k,bool *used){\n\tif(k==n) return true;\n\n\trep(l,n) if(!used[l]) {\n\t\tused[l]=true;\n\t\tB[qy[k]][qx[k]]=key[l];\n\n\t\tbool ok=true;\n\t\tint x1=qx[k],x2=qx[k];\n\t\twhile(x1>=0 && B[qy[k]][x1]!='#') x1--; x1++;\n\t\twhile(x2< w && B[qy[k]][x2]!='#') x2++;\n\t\trep(j,x2-x1) s[j]=B[qy[k]][x1+j];\n\t\ts[x2-x1]='\\0';\n\t\tif(count(s,s+x2-x1,'.')==0 && !parse()) ok=false;\n\n\t\tint y1=qy[k],y2=qy[k];\n\t\twhile(y1>=0 && B[y1][qx[k]]!='#') y1--; y1++;\n\t\twhile(y2< h && B[y2][qx[k]]!='#') y2++;\n\t\trep(i,y2-y1) s[i]=B[y1+i][qx[k]];\n\t\ts[y2-y1]='\\0';\n\t\tif(count(s,s+y2-y1,'.')==0 && !parse()) ok=false;\n\n\t\tif(ok && dfs(k+1,used)) return true;\n\n\t\tused[l]=false;\n\t\tB[qy[k]][qx[k]]='.';\n\t}\n\n\treturn false;\n}\n\nint main(){\n\tfor(;scanf(\"%d%d\",&h,&w),h;){\n\t\trep(i,h) scanf(\"%s\",B[i]);\n\t\tscanf(\"%d\",&n);\n\t\trep(i,n) scanf(\" %c\",key+i);\n\n\t\tn=0;\n\t\trep(i,h) rep(j,w) if(B[i][j]=='.') qx[n]=j, qy[n]=i, n++;\n\n\t\tbool used[10]={};\n\t\tputs(calc_no_space()&&dfs(0,used)?\"Yes\":\"No\");\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 430,
"memory_kb": 740,
"score_of_the_acc": -0.5,
"final_rank": 5
}
] |
aoj_1004_cpp
|
Pair of Primes
We arrange the numbers between 1 and N (1 <= N <= 10000) in increasing
order and decreasing order like this:
1 2 3 4 5 6 7 8 9 . . . N
N . . . 9 8 7 6 5 4 3 2 1
Two numbers faced each other form a pair. Your task is to compute the number of pairs P such that both
numbers in the pairs are prime.
Input
Input contains several test cases. Each test case consists of an integer N in
one line.
Output
For each line of input, output P .
Sample Input
1
4
7
51
Output for the Sample Input
0
2
2
6
|
[
{
"submission_id": "aoj_1004_10848139",
"code_snippet": "#include <iostream>\n#include <string.h>\n#include <stdio.h>\n#include <vector>\n#include <list>\n#include <math.h>\n#include <algorithm>\nusing namespace std;\n\npair<int, int> pii[10005];\nint N, answer;\nbool isPrime(int n) {\n if (n == 1) return 0;\n if (n == 2) return 1;\n for (int i = 2; i <= sqrt(n); i ++)\n if (n % i == 0) return false;\n return true;\n}\nint main() {\n while (scanf(\"%d\", &N) != EOF) {\n answer = 0;\n for (int i = 1; i <= N; i ++) {\n pii[i].first = i;\n pii[i].second = N - i + 1;\n }\n for (int i = 1; i <= N; i ++) {\n if (isPrime(pii[i].first) && isPrime(pii[i].second))\n answer ++;\n }\n cout << answer << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3312,
"score_of_the_acc": -0.1448,
"final_rank": 10
},
{
"submission_id": "aoj_1004_6921593",
"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 ll N;\n while (cin >> N) {\n ll ANS = 0;\n FOR(x, 1, N + 1) {\n if (primetest(x) && primetest(N + 1 - x)) ++ANS;\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": 100,
"memory_kb": 3188,
"score_of_the_acc": -0.1685,
"final_rank": 12
},
{
"submission_id": "aoj_1004_4395893",
"code_snippet": "#include <iostream>\n#define MAX 10000\nusing namespace std;\n\nint P[MAX];\n\nbool isprime(int n){\n if (n == 2) return true;\n if (n % 2 == 0 || n == 1) return false;\n for ( int i = 3; i * i <= n; i += 2 ) {\n if (n % i == 0) return false;\n }\n return true;\n}\n\nint main(void) {\n int n;\n while(cin >> n){\n int cnt = 0;\n for(int i = 1; i <= n; i++){\n if(isprime(i) && isprime(n + 1 - i)) cnt++;\n }\n cout << cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3076,
"score_of_the_acc": -0.0991,
"final_rank": 7
},
{
"submission_id": "aoj_1004_3810526",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include<bits/stdc++.h>\nusing namespace std;\n#ifndef FAST_IO\n #define IOS ios_base::sync_with_stdio(false);cin.tie(nullptr);\n#endif\n\n#define int long long\n#define FILE_IO freopen(\"input.txt\",\"r\",stdin)/#define int long long\n#define f first\n#define s second\n#define endl '\\n'\n#define all(c) c.begin(),c.end()\n#define bp __builtin_popcount\n#define debug(x) cerr << #x << \" = \" << x << endl;\n\nconst int MOD = 1e9 + 7;\nconst int INF = 1e18;\n\nmt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\ntemplate <typename T>void print(T t){for (auto &it : t) cout << it << \" \";}\ninline int powerexp(int a, int b, int m = MOD){ int res = 1;while(b){if(b&1)res = res * a % m;a = a * a % m,b >>= 1;}return res % m;}\ninline int modinv(int a){ return powerexp(a,MOD-2,MOD);}\ninline int lcm(int a, int b){ int g = __gcd(a,b);return a/g*b;}\ninline int add(int x, int y){ x += y; if (x >= MOD) x -= MOD; return x;}\ninline int mul(int x, int y){ return (x * 1ll * y) % MOD;}\ninline int sub(int x, int y){ x -= y; if (x<0) x += MOD; return x ;}\n\n//-------------------< start here >-------------------------// \n\nconst int N = 1e4 + 11;\nbool isprime[N];\nvector<int> primes;\n\nvoid sieve(){\n fill(isprime + 2, isprime + N, true);\n \n for (int i = 2; i < N; i++){\n\t if (isprime[i]){\n\t\tprimes.push_back(i);\n\t\tfor (int j = 2; i * j < N; j++){\n\t\t isprime[i * j] = false;\t\n\t } \n\t } \n\t}\t\n}\n\nvoid solve(){\n sieve();\n int n;\n while (cin >> n){\n\t vector<int> v1, v2;\n\t int ret = 0;\n\t for (int i = 1; i <= n; i++) v1.push_back(i);\n\t for (int i = n; i >= 1; i--) v2.push_back(i);\n \n\t for (int i = 1; i <= n; i++){\n\t\t ret += isprime[i] && isprime[n - i + 1]; \n\t }\n\t cout << ret << endl; \n\t}\t\n}\n\n//-----------------------------\n//comment from here for TOPCODER \nint32_t main(){\n IOS;\n solve();\n //find();\n #ifdef LOCAL_DEFINE\n cerr << \"time elapsed \" << (double)clock()/CLOCKS_PER_SEC << endl;\n #endif\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3280,
"score_of_the_acc": -0.064,
"final_rank": 4
},
{
"submission_id": "aoj_1004_3326435",
"code_snippet": "#include<iostream>\n#include<cmath>\nusing namespace std;\n\nbool judgePrime( int a )\n{\n for( int i = 2; i <= sqrt(a); i++ )\n {\n if( a % i == 0 )\n return false;\n }\n return true;\n}\n\nint main()\n{\n int n, a[10000], cnt;\n \n while( cin >> n )\n {\n for( int i = 0; i < n; i++ )\n a[i] = i + 1;\n \n cnt = 0;\n\n for( int i = 1; i < n - 1; i++ )\n if( judgePrime( a[i] ) && judgePrime( n - i ) )\n cnt++;\n \n cout << cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3140,
"score_of_the_acc": -0.194,
"final_rank": 14
},
{
"submission_id": "aoj_1004_3185847",
"code_snippet": "#include \"bits/stdc++.h\"\n\nusing namespace std;\ntypedef set<int> sb;\n\nsb criba(sb);\nint main()\n{\n int m,num,contador=0,caso;\n sb normal;\n sb arreglado;\n while(cin>>m)\n {\n contador = 0;\n for(int i = 0; i<m; i++)\n {\n normal.insert(i);\n }\n\n\n arreglado = criba(normal);\n set<int>::iterator it;\n set<int>::iterator am;\n\n for(it = arreglado.begin(); it!=arreglado.end(); it++)\n {\n num = m+1-*it;\n bool condicion = arreglado.find(num) != arreglado.end();\n if(condicion)\n {\n contador++;\n }\n }\n cout<<contador<<endl;\n normal.clear();\n }\n return 0;\n}\n\nsb criba(sb normal)\n{\n int a = normal.size();\n normal.erase(0);\n normal.erase(1);\n\n for(int i = 2; i<a ; i++)\n {\n for(int j=i*i; j<=a; j = j+i)\n {\n normal.erase(j);\n }\n }\n\n return normal;\n}",
"accuracy": 1,
"time_ms": 760,
"memory_kb": 4108,
"score_of_the_acc": -1.0705,
"final_rank": 20
},
{
"submission_id": "aoj_1004_2631028",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nbool isPrime(int n) {\n if (n == 0 || n == 1) return false;\n if (n == 2 || n == 3) return true;\n if (n % 2 == 0) return false;\n for (int i = 3; i * i <= n; i += 2) {\n if (n % i == 0) return false;\n }\n return true;\n}\n\nint main() {\n int n;\n while (cin >> n) {\n int count = 0;\n for (int i = 1; i <= n; i++) {\n if (isPrime(i) && isPrime(n + 1 - i)) {\n count++;\n }\n }\n cout << count << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3016,
"score_of_the_acc": -0.0977,
"final_rank": 6
},
{
"submission_id": "aoj_1004_2438382",
"code_snippet": "#include<iostream>\n#include<cmath>\nusing namespace std;\nbool p(int n) {\n if (n == 2)return true;\n if (n % 2 == 0)return false;\n for (int i = 3; i <= sqrt(n); i += 2) if (n%i == 0)return false;\n return true;\n}\nint main(){\n int n; while (cin >> n){\n if (n < 3)cout << \"0\\n\";\n else {\n int sum = 0;\n for (int i = 2; i < n; i++)\n if (p(i) && p(n - i + 1))sum++;\n cout << sum << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 2980,
"score_of_the_acc": -0.1102,
"final_rank": 8
},
{
"submission_id": "aoj_1004_2327404",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint n;\n\nint isPrime(int a){\n\tif(a <= 1) return 0;\n\tif(a == 2) return 1;\n\tfor(int i = 2; i * i <= a; i++){\n\t\tif(a % i == 0) return 0;\n\t}\n\treturn 1;\n}\n\nint main(){\n\twhile(cin >> n){\n\t\tint cnt = 0;\n\t\tfor(int i = 1; i <= n; i++){\n\t\t\tif(isPrime(i) && isPrime(n - i + 1)) cnt++;\n\t\t}\n\t\tcout << cnt << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 2996,
"score_of_the_acc": -0.1506,
"final_rank": 11
},
{
"submission_id": "aoj_1004_2193675",
"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 \n using namespace std;\n \n bool arr[10000+5];\n \n bool is_prime(int x)\n {\n if(x==1) return false;\n else if(x==2) return true;\n else \n {\n for(int i=2;i<=sqrt(x);i++)\n {\n if(x%i==0) return false; \n } \n return true; \n } \n }\n \n void init()\n {\n for(int i=1;i<=10000;i++)\n {\n if(is_prime(i)) arr[i]=true;\n else arr[i]=false; \n } \n }\n \n int main()\n {\n int N;\n while(cin>>N)\n {\n init();\n int count=0;\n for(int i=1;i<=(N/2);i++)\n {\n if(arr[i]&&arr[N-i+1])\n {\n //cout<<i<<\" \"<<N-i+1<<endl;\n count++;\n } \n }\n if(N%2==0) cout<<(2*count)<<endl;\n else \n {\n if(arr[N/2+1]) count=2*count+1;\n else count*=2;\n cout<<count<<endl; \n }\n }\n //while(1);\n return 0;\n }",
"accuracy": 1,
"time_ms": 500,
"memory_kb": 3080,
"score_of_the_acc": -0.6992,
"final_rank": 17
},
{
"submission_id": "aoj_1004_2170436",
"code_snippet": "#include <iostream>\n#include<math.h>\n\nusing namespace std;\n\nint IsPrime(int a,int b)\n{\n int i,p=0,q=0;\n if(a==1||b==1)\n {\n return 0;\n }\n for(i=2;i<=sqrt(a);i++)\n {\n\n if(a%i==0)\n {\n p=1;\n break;\n }\n }\n\n for(i=2;i<=sqrt(b);i++)\n {\n\n if(b%i==0)\n {\n q=1;\n break;\n }\n\n }\n if(p!=1&&q!=1)\n return 1;\n else\n return 0;\n\n}\nint main()\n{\n int a,b,i,c=0;\n while( cin>>a)\n {\n c=0;\n\n for(i=0;i<a;i++)\n {\n if((b=IsPrime(i+1,a-i))==1)\n c++;\n\n }\n cout<<c<<endl;\n\n}\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 2992,
"score_of_the_acc": -0.2838,
"final_rank": 15
},
{
"submission_id": "aoj_1004_2170295",
"code_snippet": "#include<bits/stdc++.h>\n using namespace std;\n #define ll long long\n int main()\n {\n \n ll n,f,i,j;\n while(cin>>n)\n {\n f=0;\n \n vector<bool>v(n+1);\n \n for(i=0;i<=n;i++)\n v[i]=1;\n \n v[0]=0;\n v[1]=0;\n \n for(i=2;i<=n;i++)\n {\n if(v[i])\n {\n for(j=2*i;j<=n;j+=i)\n v[j]=0;\n }\n }\n \n \n \n v.erase(v.begin());\n vector<bool>a(n);\n copy(v.rbegin(),v.rend(),a.begin());\n \n for(i=0;i<=n;i++)\n {\n if(a[i]&&v[i])\n f++;\n }\n cout<<f<<endl;\n \n }\n \n return 0;\n }",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3060,
"score_of_the_acc": -0.0721,
"final_rank": 5
},
{
"submission_id": "aoj_1004_2165662",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nbool isprime(int a){\n\tfor(int i=2;i*i<=a;i++){\n\t\tif(a%i==0)return false;\n\t\t}\n\t\treturn a!=1;\n\t}\n\nint main(){\n\tint n;\n\twhile(cin>>n){\n\t\tint ans=0;\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tint b=n+1-i;\n\t\t\tif(isprime(b)&&isprime(i))ans++;\n\t\t\t}\n\t\t\tcout<<ans<<endl;\n\t\t}\n\t\treturn 0;\n\t}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3060,
"score_of_the_acc": -0.1388,
"final_rank": 9
},
{
"submission_id": "aoj_1004_2151496",
"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 9999999\nint main(){\n vector<bool>Primecheck(MAX+1,true);\n vector<int>Primenumber(MAX+1,0); //Primearray\n int Primecounter =0; //Primearray counter;\n for(int i = 2; i<MAX+1;i++){\n if(Primecheck[i]){\n for(int j = 2;i*j<MAX;j++)\n Primecheck[i*j] = false;//?´???°??????Primearray???????´??????????????????°?????¨???false???\n Primenumber[Primecounter] = i;\n Primecounter++;\n }\n }\n Primecheck[1]=false;\n int n;\n while(cin>>n){\n if(n==1){cout<<0<<endl; continue;}\n int ans=0;\n for(int i=1;i<=n;i++)\n if(Primecheck[i]&&Primecheck[n-i+1])ans++;\n cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 42992,
"score_of_the_acc": -1.0667,
"final_rank": 19
},
{
"submission_id": "aoj_1004_2026975",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <algorithm>\n#include <sstream>\n#include <cmath>\n#include <set>\n#include <iomanip>\n#include <deque>\n#include <stdio.h>\nusing namespace std;\n\n#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)\n#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)\n#define iREP(i,Itr) for(auto (i)=(Itr).begin();(i)!=(Itr).end();(i)++)\n#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())\n#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())\n#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())\n#define LBOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))\n#define UBOUND(Itr,val) upper_bound((Itr).begin(),(Itr).end(),(val))\ntypedef long long ll;\n\nbool isPrime(int n){\n if(n==1)return false;\n if(n==2)return true;\n for(int i=2;i<sqrt(n)+1;i++){\n if((n%i)==0)return false;\n }\n return true;\n}\n\nint main(){\n \n int n;\n while(cin>>n){\n int cnt=0;\n REP(i,n){\n if(isPrime(i+1)&&isPrime(n-i))cnt++;\n }\n cout<<cnt<<endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 3060,
"score_of_the_acc": -0.1788,
"final_rank": 13
},
{
"submission_id": "aoj_1004_1973765",
"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\" > \"D:\\D_Download\\Visual Studio 2015\\Projects\\programing_contest_c++\\Debug\\b.txt\"\n \nbool isso(long long int a) {\n\tif (a == 1 || a == 0)return false;\n\tfor (long long int i = 2; i*i <= a; ++i) {\n\t\tif ((a%i)) {\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\nint main() {\n\tint N;\n\twhile (cin >> N) {\n\t\tint ans = 0;\n\t\tfor (int i = 1; i <= N; ++i) {\n\t\t\tint j = N + 1 - i;\n\t\t\tif (isso(i) && isso(j))ans++;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 3052,
"score_of_the_acc": -0.3519,
"final_rank": 16
},
{
"submission_id": "aoj_1004_1900102",
"code_snippet": "#include <bits/stdc++.h>\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n\nusing namespace std;\n\nint main() {\n int n;\n while(scanf(\"%d\",&n) != EOF) {\n vector<bool> isp(n+1, true);\n isp[0] = isp[1] = false;\n for (int i = 2; i*i <= n; ++i)\n if (isp[i])\n for (int j = i*i; j <= n; j += i)\n isp[j] = false;\n int cnt = 0;\n for (int i = 1; i <= n; ++i)\n if (isp[i] && isp[n-i+1])\n ++cnt;\n cout << cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3144,
"score_of_the_acc": -0.0474,
"final_rank": 3
},
{
"submission_id": "aoj_1004_1894426",
"code_snippet": "#include<bits/stdc++.h>\n#define range(i,a,b) for(int i = (a); i < (b); i++)\n#define rep(i,b) range(i,0,b)\n#define pb(a) push_back(a)\n#define all(a) (a).begin(), (a).end()\n#define debug(x) cout << \"debug \" << x << endl;\nusing namespace std;\n\n#define N 10005\n\nint main(){\n int n;\n while(cin >> n){\n bool prime[N], pairPrime[N];\n\n n++;\n rep(i,n) prime[i] = 1;\n prime[0] = prime[1] = 0;\n\n int primeSum[N] = {0};\n rep(i,n){\n if(prime[i]){\n for(int j = i + i; j <= n; j+=i) prime[j] = 0;\n }\n }\n\n range(i,1,n) pairPrime[i] = (prime[i] && prime[n - i]);\n\n int count = 0;\n rep(i,n){\n count+=static_cast<int>(pairPrime[i]);\n }\n cout << count << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1180,
"score_of_the_acc": -0.0138,
"final_rank": 2
},
{
"submission_id": "aoj_1004_1800152",
"code_snippet": "#include<iostream>\nusing namespace std;int prime[30];int main(){int count=1;prime[0]=2;for(int i=3;i<100;i+=2){bool t=true;for(int j=1;j<count;j++){if(i%prime[j]==0)t=false;}if(t==true){prime[count]=i;count++;}}int n;while(cin>>n){n++;int ans=0;for(int cut=2;cut<n-1;cut++){bool t=true,f=true;for(int i=0;i<count;i++){if(cut%prime[i]==0&&cut!=prime[i])t=false;}for(int i=0;i<count;i++){if((n-cut)%prime[i]==0&&n-cut!=prime[i])f=false;}if(t==true&&f==true)ans++;}cout<<ans<<endl;}return 0;}",
"accuracy": 1,
"time_ms": 620,
"memory_kb": 1160,
"score_of_the_acc": -0.8133,
"final_rank": 18
},
{
"submission_id": "aoj_1004_1640411",
"code_snippet": "#include <iostream>\n#include <cmath>\nusing namespace std;\n\nvoid sieve(bool *primes, int n)\n{\n int m = ceil(sqrt(n));\n int k = 2;\n\n for (int i=0;i<=n;i++) primes[i]=true;\n primes[0] = primes[1] = false;\n\n for (int i=2;i<=m;i++)\n {\n if (primes[i])\n {\n for (int k=2*i; k<=n; k+=i)\n primes[k] = false;\n }\n }\n}\n\nint main()\n{\n bool primes[10001];\n int ns[10000];\n int num = 0;\n int maxn = 0;\n int n;\n\n while (cin >> n)\n {\n ns[num] = n;\n maxn = max(maxn, n);\n num++;\n }\n\n sieve(primes, maxn);\n\n for (int i=0;i<num;i++)\n {\n int p = 1;\n int q = ns[i];\n int ans = 0;\n for (int j=0;j<ns[i];j++)\n {\n if (primes[p] && primes[q]) ans++;\n p++;\n q--;\n }\n cout << ans << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1180,
"score_of_the_acc": -0.0005,
"final_rank": 1
}
] |
aoj_1023_cpp
|
Problem E:
Amazing Graze
In 2215 A.D., a war between two planets, ACM and ICPC, is being more and more intense.
ACM introduced new combat planes. These planes have a special system that is called Graze, and fighting power of a plane increases when it is close to energy bullets that ICPC combat planes shoot.
Both combat planes and energy bullets have a shape of a sphere with a radius of
R
. Precisely, fighting power of a plane is equivalent to the number of energy bullet where distance from the plane is less than or equals to 2
R
.
You, helper of captain of intelligence units, are asked to analyze a war situation. The information given to you is coordinates of
AN
combat planes and
BN
energy bullets. Additionally, you know following things:
All combat planes and energy bullet has same
z
-coordinates. In other word,
z
-coordinate can be ignored.
No two combat planes, no two energy bullets, and no pair of combat plane and energy bullet collide (i.e. have positive common volume) each other.
Your task is to write a program that outputs total fighting power of all combat planes.
Input
Input file consists of a number of data sets.
One data set is given in following format:
AN BN R
XA
1
YA
1
XA
2
YA
2
:
XA
AN
YA
AN
XB
1
YB
1
XB
2
YB
2
:
XB
BN
YB
BN
AN
,
BN
,
R
are integers that describe the number of combat planes, energy bullets, and their radius respectively.
Following
AN
lines indicate coordinates of the center of combat planes. Each line has two integers that describe
x
-coordinate and
y
-coordinate.
Following
BN
lines indicate coordinates of the center of energy bullets, in the same format as that of combat planes.
Input ends when
AN
=
BN
= 0. You should output nothing for this case.
Output
For each data set, output the total fighting power.
Constraints
Jude data includes at most 20 data sets.
1 ≤
AN
,
BN
≤ 100000
0 <
R
≤ 10
0 ≤ (coordinate values) < 10000
Sample Input
2 2 1
0 0
0 4
2 2
2 8
0 0 0
Output for the Sample Input
2
|
[
{
"submission_id": "aoj_1023_10958610",
"code_snippet": "/*\n * Author: OldY\n * Created Time: 2011/8/31 16:30:04\n * File Name: E.cpp\n */\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <string>\n#include <vector>\n\nusing namespace std;\nconst int maxint = -1u>>1;\nconst double pi = acos(-1.0);\ntypedef long long lint;\n\nconst int maxn = 10000 + 10;\n\nint n,m,r;\nvector <int> point[maxn];\nint cirx[10*maxn] , ciry[10*maxn];\nint tmpx,tmpy;\nlint ans;\nint top,y,nowx,nowy;\n\nint find(const int & x , const int & i){\n int sz = point[i].size();\n int l = 0 , r = sz - 1 , mid;\n while(l <= r){\n mid = ((l+r) >> 1);\n if(mid < 0 || mid >= sz) break;\n if(point[i][mid] <= x)\n l = mid + 1;\n else r = mid - 1;\n }\n return l - 1;\n}\n\nint main() {\n while(scanf(\"%d%d%d\",&n,&m,&r)){\n if(n == 0 && m == 0) break;\n ans = 0;\n top = 16*r*r;\n for(int i = 0 ; i < maxn ; i++)\n point[i].clear();\n for(int i = 0 ; i < n ; i++)\n scanf(\"%d%d\",cirx+i,ciry+i);\n for(int i = 0 ; i < m ; i++){\n scanf(\"%d%d\",&tmpx,&tmpy);\n point[tmpx].push_back(tmpy);\n }\n for(int i = 0 ; i < 10000 ; i++)\n sort(point[i].begin() , point[i].end());\n for(int i = 0 ; i < n ; i++){\n y = 0;\n for(int x = 4*r ; x >= 0 ; x--){\n while(x*x+y*y <= top) y++;\n y--;\n nowx = cirx[i] - x;\n if(nowx >= 0){\n ans += find(ciry[i]+y,nowx) - find(ciry[i]-y-1, nowx);\n }\n if(x == 0) break;\n nowx = cirx[i] + x;\n if(nowx < 10000){\n ans += find(ciry[i]+y,nowx) - find(ciry[i]-y-1 , nowx);\n }\n }\n }\n printf(\"%lld\\n\",ans);\n } \n return 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 5924,
"score_of_the_acc": -0.6293,
"final_rank": 13
},
{
"submission_id": "aoj_1023_9079790",
"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\nvector<int> v[10001];\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n, m, r;\n while (cin >> n >> m >> r, r) {\n for (int i = 0; i <= 10000; i++) {\n v[i].clear();\n }\n for (int i = 0; i < n; i++) {\n int x, y;\n cin >> x >> y;\n v[x].push_back(y);\n }\n for (int i = 0; i <= 10000; i++) {\n sort(v[i].begin(), v[i].end());\n }\n ll res = 0;\n int R = 4 * r;\n for (int i = 0; i < m; i++) {\n int x, y;\n cin >> x >> y;\n for (int j = x - R; j <= x + R; j++) {\n if (j < 0 or j > 10000) continue;\n int sq = sqrt(R * R - abs(j - x) * abs(j - x));\n res += upper_bound(v[j].begin(), v[j].end(), y + sq) - lower_bound(v[j].begin(), v[j].end(), y - sq);\n }\n }\n cout << res << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 5060,
"score_of_the_acc": -0.178,
"final_rank": 3
},
{
"submission_id": "aoj_1023_8860860",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <vector>\nusing namespace std;\nvector<int> v[10000];\nint m[80001]; // to store pre-calculated values of m\nint main() {\n int aN, bN, R;\n while (scanf(\"%d %d %d\", &aN, &bN, &R), aN) {\n for (int i = 0; i < 10000; i++)\n v[i].clear();\n for (int i = 0; i < aN; i++) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n v[y].push_back(x);\n }\n for (int i = 0; i < 10000; i++) {\n if (!v[i].empty()) // avoid sorting empty vectors\n sort(v[i].begin(), v[i].end());\n }\n int D = 4 * R, ans = 0;\n for (int p = -D; p <= D; p++) {\n m[p + D] = sqrt((D - p) * (D + p)); // pre-calculate values of m\n }\n for (int i = 0; i < bN; i++) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n for (int p = -D; p <= D; p++) {\n if (y + p < 0 || y + p >= 10000)\n continue;\n ans += upper_bound(v[y + p].begin(), v[y + p].end(), x + m[p + D]) -\n lower_bound(v[y + p].begin(), v[y + p].end(), x - m[p + D]);\n }\n }\n printf(\"%d\\n\", ans);\n }\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 4064,
"score_of_the_acc": -0.0421,
"final_rank": 1
},
{
"submission_id": "aoj_1023_8860855",
"code_snippet": "#include <algorithm>\n#include <assert.h>\n#include <iostream>\n#include <math.h>\n#include <set>\n#include <stdio.h>\n#include <string.h>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) \\\n for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\nstruct Point {\n int x;\n int y;\n char type;\n Point() { ; }\n Point(double x, double y, int type) : x(x), y(y), type(type) { ; }\n bool operator<(const Point &rhs) const {\n if (y != rhs.y) {\n return y < rhs.y;\n }\n return x < rhs.x;\n }\n};\nstruct Event {\n int x;\n Point p;\n char in;\n Event() { ; }\n Event(int x, Point p, int in) : x(x), p(p), in(in) { ; }\n bool operator<(const Event &rhs) const {\n if (x != rhs.x) {\n return x < rhs.x;\n }\n return in > rhs.in;\n }\n};\ninline int square(int x) { return x * x; }\ninline int dist2(const Point &a, const Point &b) {\n return square(a.x - b.x) + square(a.y - b.y);\n}\nint an, bn, n;\nint r;\nEvent event[500000];\nint PlaneSweep() {\n int ans = 0;\n int maxDist = 16 * r * r; // Precompute 16 * r * r\n set<Point> open[2];\n REP(iter, n) {\n Event &e = event[iter];\n Point &p = e.p;\n if (e.in) {\n set<Point>::iterator lower =\n open[(int)p.type ^ 1].lower_bound(Point(0, p.y - 4 * r - 1, 0));\n set<Point>::iterator upper =\n open[(int)p.type ^ 1].upper_bound(Point(0, p.y + 4 * r + 1, 0));\n for (set<Point>::iterator it = lower; it != upper; it++) {\n if (dist2(*it, p) <= maxDist) { // Use precomputed value\n ans++;\n }\n }\n open[(int)p.type].insert(p);\n } else {\n open[(int)p.type].erase(open[(int)p.type].find(p));\n }\n }\n return ans;\n}\nint main() {\n std::ios_base::sync_with_stdio(false); // Fast IO operations\n cin.tie(NULL);\n while (scanf(\"%d %d %d\", &an, &bn, &r), an | bn) {\n n = (an + bn) * 2;\n REP(i, an) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n event[2 * i + 0] = Event(x - 2 * r, Point(x, y, 0), 1);\n event[2 * i + 1] = Event(x + 2 * r, Point(x, y, 0), 0);\n }\n REP(i, bn) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n event[2 * an + 2 * i + 0] = Event(x - 2 * r, Point(x, y, 1), 1);\n event[2 * an + 2 * i + 1] = Event(x + 2 * r, Point(x, y, 1), 0);\n }\n sort(event, event + n);\n int ans = PlaneSweep();\n printf(\"%d\\n\", ans);\n }\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 11080,
"score_of_the_acc": -1.5333,
"final_rank": 20
},
{
"submission_id": "aoj_1023_8860852",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <set>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\nstruct Point {\n int x;\n int y;\n char type;\n Point() { ; }\n Point(double x, double y, int type) : x(x), y(y), type(type) { ; }\n bool operator<(const Point &rhs) const {\n if (y != rhs.y) {\n return y < rhs.y;\n }\n return x < rhs.x;\n }\n};\nstruct Event {\n int x;\n Point p;\n char in;\n Event() { ; }\n Event(int x, Point p, int in) : x(x), p(p), in(in) { ; }\n bool operator<(const Event &rhs) const {\n if (x != rhs.x) {\n return x < rhs.x;\n }\n return in > rhs.in;\n }\n};\ninline int square(int x) { return x * x; }\ninline int dist2(const Point &a, const Point &b) {\n return square(a.x - b.x) + square(a.y - b.y);\n}\nint an, bn, n;\nint r;\nEvent event[500000];\nint PlaneSweep() {\n int ans = 0;\n set<Point> open[2];\n REP(iter, n) {\n Event &e = event[iter];\n Point &p = e.p;\n int type_xor = (int)p.type ^ 1;\n if (e.in) {\n set<Point>::iterator lower =\n open[type_xor].lower_bound(Point(0, p.y - 4 * r - 1, 0));\n set<Point>::iterator upper =\n open[type_xor].upper_bound(Point(0, p.y + 4 * r + 1, 0));\n for (set<Point>::iterator it = lower; it != upper; it++) {\n if (dist2(*it, p) <= 16 * r * r) {\n ans++;\n }\n }\n open[(int)p.type].insert(p);\n } else {\n open[(int)p.type].erase(open[(int)p.type].find(p));\n }\n }\n return ans;\n}\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n while (cin >> an >> bn >> r, an | bn) {\n n = (an + bn) * 2;\n REP(i, an) {\n int x, y;\n cin >> x >> y;\n event[2 * i + 0] = Event(x - 2 * r, Point(x, y, 0), 1);\n event[2 * i + 1] = Event(x + 2 * r, Point(x, y, 0), 0);\n }\n REP(i, bn) {\n int x, y;\n cin >> x >> y;\n event[2 * an + 2 * i + 0] = Event(x - 2 * r, Point(x, y, 1), 1);\n event[2 * an + 2 * i + 1] = Event(x + 2 * r, Point(x, y, 1), 0);\n }\n sort(event, event + n);\n int ans = PlaneSweep();\n cout << ans << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 10980,
"score_of_the_acc": -1.453,
"final_rank": 15
},
{
"submission_id": "aoj_1023_8860850",
"code_snippet": "#include <algorithm>\n#include <cassert>\n#include <iostream>\n#include <cmath>\n#include <set>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) \\\n for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\nstruct Point {\n int x;\n int y;\n char type;\n Point() { ; }\n Point(double x, double y, int type) : x(x), y(y), type(type) { ; }\n bool operator<(const Point &rhs) const {\n if (y != rhs.y) {\n return y < rhs.y;\n }\n return x < rhs.x;\n }\n};\n\nstruct Event {\n int x;\n Point p;\n char in;\n Event() { ; }\n Event(int x, Point p, int in) : x(x), p(p), in(in) { ; }\n bool operator<(const Event &rhs) const {\n if (x != rhs.x) {\n return x < rhs.x;\n }\n return in > rhs.in;\n }\n};\n\ninline int square(int x) { return x * x; }\ninline int dist2(const Point &a, const Point &b) {\n return square(a.x - b.x) + square(a.y - b.y);\n}\n\nint an, bn, n;\nint r, four_r, sixteen_r_square;\nEvent event[500000];\n\nint PlaneSweep() {\n int ans = 0;\n set<Point> open[2];\n REP(iter, n) {\n Event &e = event[iter];\n Point &p = e.p;\n if (e.in) {\n set<Point>::iterator lower =\n open[(int)p.type ^ 1].lower_bound(Point(0, p.y - four_r - 1, 0));\n set<Point>::iterator upper =\n open[(int)p.type ^ 1].upper_bound(Point(0, p.y + four_r + 1, 0));\n for (set<Point>::iterator it = lower; it != upper; it++) {\n if (dist2(*it, p) <= sixteen_r_square) {\n ans++;\n }\n }\n open[(int)p.type].insert(p);\n } else {\n open[(int)p.type].erase(open[(int)p.type].find(p));\n }\n }\n return ans;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n \n while (cin >> an >> bn >> r, an | bn) {\n four_r = 4 * r;\n sixteen_r_square = 16 * r * r;\n n = (an + bn) * 2;\n REP(i, an) {\n int x, y;\n cin >> x >> y;\n event[2 * i + 0] = Event(x - 2 * r, Point(x, y, 0), 1);\n event[2 * i + 1] = Event(x + 2 * r, Point(x, y, 0), 0);\n }\n REP(i, bn) {\n int x, y;\n cin >> x >> y;\n event[2 * an + 2 * i + 0] = Event(x - 2 * r, Point(x, y, 1), 1);\n event[2 * an + 2 * i + 1] = Event(x + 2 * r, Point(x, y, 1), 0);\n }\n sort(event, event + n);\n int ans = PlaneSweep();\n cout << ans << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 10992,
"score_of_the_acc": -1.4547,
"final_rank": 16
},
{
"submission_id": "aoj_1023_8860849",
"code_snippet": "#include <algorithm>\n#include <assert.h>\n#include <iostream>\n#include <math.h>\n#include <set>\n#include <stdio.h>\n#include <string.h>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) \\\n for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\nstruct Point {\n int x;\n int y;\n char type;\n Point() { ; }\n Point(double x, double y, int type) : x(x), y(y), type(type) { ; }\n bool operator<(const Point &rhs) const {\n if (y != rhs.y) {\n return y < rhs.y;\n }\n return x < rhs.x;\n }\n};\n\nstruct Event {\n int x;\n Point p;\n char in;\n Event() { ; }\n Event(int x, Point p, int in) : x(x), p(p), in(in) { ; }\n bool operator<(const Event &rhs) const {\n if (x != rhs.x) {\n return x < rhs.x;\n }\n return in > rhs.in;\n }\n};\n\ninline int square(int x) { return x * x; }\n\ninline int dist2(const Point &a, const Point &b) {\n return square(a.x - b.x) + square(a.y - b.y);\n}\n\nint an, bn, n;\nint r;\nEvent event[500000];\nint r_square; // Precomputed square of radius\n\nint PlaneSweep() {\n int ans = 0;\n set<Point> open[2];\n REP(iter, n) {\n Event &e = event[iter];\n Point &p = e.p;\n if (e.in) {\n set<Point>::iterator lower =\n open[(int)p.type ^ 1].lower_bound(Point(0, p.y - 4 * r - 1, 0));\n set<Point>::iterator upper =\n open[(int)p.type ^ 1].upper_bound(Point(0, p.y + 4 * r + 1, 0));\n for (set<Point>::iterator it = lower; it != upper; it++) {\n if (dist2(*it, p) <= r_square) { // Use precomputed square of radius\n ans++;\n }\n }\n open[(int)p.type].insert(p);\n } else {\n open[(int)p.type].erase(open[(int)p.type].find(p));\n }\n }\n return ans;\n}\n\nint main() {\n while (scanf(\"%d %d %d\", &an, &bn, &r), an | bn) {\n r_square = 16 * r * r; // Precompute square of radius\n n = (an + bn) * 2;\n REP(i, an) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n event[2 * i + 0] = Event(x - 2 * r, Point(x, y, 0), 1);\n event[2 * i + 1] = Event(x + 2 * r, Point(x, y, 0), 0);\n }\n REP(i, bn) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n event[2 * an + 2 * i + 0] = Event(x - 2 * r, Point(x, y, 1), 1);\n event[2 * an + 2 * i + 1] = Event(x + 2 * r, Point(x, y, 1), 0);\n }\n sort(event, event + n);\n int ans = PlaneSweep();\n printf(\"%d\\n\", ans);\n }\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 11004,
"score_of_the_acc": -1.523,
"final_rank": 18
},
{
"submission_id": "aoj_1023_8822468",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <vector>\nusing namespace std;\nvector<int> v[10000];\nbool used[10000] = {false};\nint main() {\n int aN, bN, R;\n while (scanf(\"%d%d%d\", &aN, &bN, &R) != EOF, aN) {\n int usedCount = 0;\n int usedIndices[10000];\n for (int i = 0; i < aN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n if (!used[y]) {\n used[y] = true;\n usedIndices[usedCount++] = y;\n }\n v[y].push_back(x);\n }\n for (int i = 0; i < usedCount; i++)\n sort(v[usedIndices[i]].begin(), v[usedIndices[i]].end());\n int D = 4 * R, ans = 0;\n for (int i = 0; i < bN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n for (int p = -D; p <= D; p++) {\n if (y + p < 0 || y + p >= 10000)\n continue;\n int m = sqrt((D - p) * (D + p));\n ans += upper_bound(v[y + p].begin(), v[y + p].end(), x + m) -\n lower_bound(v[y + p].begin(), v[y + p].end(), x - m);\n }\n }\n printf(\"%d\\n\", ans);\n for (int i = 0; i < usedCount; i++) {\n v[usedIndices[i]].clear();\n used[usedIndices[i]] = false;\n }\n }\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 4100,
"score_of_the_acc": -0.1803,
"final_rank": 4
},
{
"submission_id": "aoj_1023_8822466",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <vector>\nusing namespace std;\ntypedef pair<int, int> pii;\nvector<int> v[10000];\nint main() {\n int aN, bN, R;\n while (cin >> aN >> bN >> R, aN) {\n for (int i = 0; i < 10000; i++)\n v[i].clear();\n for (int i = 0; i < aN; i++) {\n int x, y;\n cin >> x >> y;\n v[y].push_back(x);\n }\n for (int i = 0; i < 10000; i++)\n if (!v[i].empty())\n sort(v[i].begin(), v[i].end());\n int D = 4 * R, ans = 0;\n for (int i = 0; i < bN; i++) {\n int x, y;\n cin >> x >> y;\n for (int p = -D; p <= D; p++) {\n int yPlusP = y + p;\n if (yPlusP < 0 || yPlusP >= 10000)\n continue;\n int m = sqrt((D - p) * (D + p));\n ans += upper_bound(v[yPlusP].begin(), v[yPlusP].end(), x + m) -\n lower_bound(v[yPlusP].begin(), v[yPlusP].end(), x - m);\n }\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 320,
"memory_kb": 4548,
"score_of_the_acc": -1.1081,
"final_rank": 14
},
{
"submission_id": "aoj_1023_8822459",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <vector>\nusing namespace std;\nvector<int> v[10000];\nint main() {\n ios::sync_with_stdio(false); // to speed up I/O operations\n int aN, bN, R;\n while (cin >> aN >> bN >> R, aN) {\n for (int i = 0; i < 10000; i++)\n v[i].clear(); // clear the vector after using its elements\n for (int i = 0; i < aN; i++) {\n int x, y;\n cin >> x >> y; // use std::cin instead of scanf\n v[y].push_back(x);\n }\n for (int i = 0; i < 10000; i++)\n if (!v[i].empty()) // avoid sorting empty vectors\n sort(v[i].begin(), v[i].end());\n int D = 4 * R, ans = 0;\n for (int i = 0; i < bN; i++) {\n int x, y;\n cin >> x >> y; // use std::cin instead of scanf\n for (int p = -D; p <= D; p++) {\n if (y + p < 0 || y + p >= 10000)\n continue;\n int m = sqrt((D - p) * (D + p));\n ans += upper_bound(v[y + p].begin(), v[y + p].end(), x + m) -\n lower_bound(v[y + p].begin(), v[y + p].end(), x - m);\n }\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 4632,
"score_of_the_acc": -0.2529,
"final_rank": 8
},
{
"submission_id": "aoj_1023_8822457",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <map>\n#include <vector>\nusing namespace std;\ntypedef pair<int, int> pii;\nvector<int> v[10000];\nint main() {\n int aN, bN, R;\n while (scanf(\"%d%d%d\", &aN, &bN, &R), aN) {\n for (int i = 0; i < 10000; i++)\n v[i].clear();\n for (int i = 0; i < aN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n v[y].insert(lower_bound(v[y].begin(), v[y].end(), x), x);\n }\n int D = 4 * R, ans = 0;\n for (int i = 0; i < bN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n for (int p = -D; p <= D; p++) {\n if (y + p < 0 || y + p >= 10000)\n continue;\n int m = sqrt((D - p) * (D + p));\n vector<int>& vp = v[y + p];\n ans += upper_bound(vp.begin(), vp.end(), x + m) -\n lower_bound(vp.begin(), vp.end(), x - m);\n }\n }\n printf(\"%d\\n\", ans);\n }\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 4500,
"score_of_the_acc": -0.3016,
"final_rank": 9
},
{
"submission_id": "aoj_1023_8215245",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <vector>\nusing namespace std;\ntypedef pair<int, int> pii;\nvector<int> v[10000];\n\nint main() {\n int aN, bN, R;\n while (scanf(\"%d%d%d\", &aN, &bN, &R), aN) {\n for (int i = 0; i < 10000; i++)\n v[i].clear();\n for (int i = 0; i < aN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n v[y].push_back(x);\n }\n for (int i = 0; i < 10000; i++)\n sort(v[i].begin(), v[i].end());\n int D = 4 * R, ans = 0;\n for (int i = 0; i < bN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n for (int p = -D; p <= D; p++) {\n if (y + p < 0 || y + p >= 10000)\n continue;\n int m = (int)sqrt((double)(D - p) * (D + p));\n ans += upper_bound(v[y + p].begin(), v[y + p].end(), x + m) -\n lower_bound(v[y + p].begin(), v[y + p].end(), x - m);\n }\n }\n printf(\"%d\\n\", ans);\n }\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 4156,
"score_of_the_acc": -0.1213,
"final_rank": 2
},
{
"submission_id": "aoj_1023_8215241",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <vector>\nusing namespace std;\ntypedef pair<int, int> pii;\nvector<int> v[10000];\nint main() {\n int aN, bN, R;\n while (scanf(\"%d%d%d\", &aN, &bN, &R), aN) {\n for (int i = 0; i < 10000; i++)\n v[i].clear();\n for (int i = 0; i < aN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n v[y].push_back(x);\n }\n for (int i = 0; i < 10000; i++)\n if (!v[i].empty())\n sort(v[i].begin(), v[i].end());\n int D = 4 * R, ans = 0;\n for (int i = 0; i < bN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n for (int p = max(-D, -y); p <= min(D, 9999 - y); p++) {\n int m = sqrt((D - p) * (D + p));\n ans += upper_bound(v[y + p].begin(), v[y + p].end(), x + m) -\n lower_bound(v[y + p].begin(), v[y + p].end(), x - m);\n }\n }\n printf(\"%d\\n\", ans);\n }\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 4144,
"score_of_the_acc": -0.1863,
"final_rank": 5
},
{
"submission_id": "aoj_1023_8215239",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <map>\n#include <vector>\nusing namespace std;\ntypedef pair<int, int> pii;\nint main() {\n int x, y;\n int aN, bN, R;\n while (cin >> aN >> bN >> R, aN) {\n vector<int> v[10000];\n for (int i = 0; i < aN; i++) {\n scanf(\"%d%d\", &x, &y);\n v[y].push_back(x);\n }\n for (int i = 0; i < 10000; i++)\n sort(v[i].begin(), v[i].end());\n int D = 4 * R, ans = 0;\n for (int i = 0; i < bN; i++) {\n scanf(\"%d%d\", &x, &y);\n for (int p = -D; p <= D; p++) {\n if (y + p < 0 || y + p >= 10000)\n continue;\n int m = sqrt(D * D - p * p);\n ans += upper_bound(v[y + p].begin(), v[y + p].end(), x + m) -\n lower_bound(v[y + p].begin(), v[y + p].end(), x - m);\n }\n }\n printf(\"%d\\n\", ans);\n }\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 3756,
"score_of_the_acc": -0.2,
"final_rank": 6
},
{
"submission_id": "aoj_1023_8215238",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <map>\n#include <vector>\nusing namespace std;\ntypedef pair<int, int> pii;\nvector<int> v[10000];\nint main() {\n int aN, bN, R;\n while (cin >> aN >> bN >> R, aN) {\n for (int i = 0; i < 10000; i++)\n v[i].clear();\n for (int i = 0; i < aN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n v[y].push_back(x);\n }\n for (int i = 0; i < 10000; i++)\n sort(v[i].begin(), v[i].end());\n int D = 4 * R, ans = 0;\n for (int i = 0; i < bN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n for (int p = -D; p <= D; p++) {\n if (y + p < 0 || y + p >= 10000)\n continue;\n int m = sqrt((D - p) * (D + p));\n ans += upper_bound(v[y + p].begin(), v[y + p].end(), x + m) -\n lower_bound(v[y + p].begin(), v[y + p].end(), x - m);\n }\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 4608,
"score_of_the_acc": -0.3163,
"final_rank": 12
},
{
"submission_id": "aoj_1023_8215226",
"code_snippet": "#include <algorithm>\n#include <assert.h>\n#include <iostream>\n#include <math.h>\n#include <set>\n#include <stdio.h>\n#include <string.h>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) \\\n for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\nstruct Point {\n int x;\n int y;\n char type;\n Point() { ; }\n Point(double x, double y, int type) : x(x), y(y), type(type) { ; }\n bool operator<(const Point &rhs) const {\n if (y != rhs.y) {\n return y < rhs.y;\n }\n return x < rhs.x;\n }\n};\nstruct Event {\n int x;\n Point p;\n char in;\n Event() { ; }\n Event(int x, Point p, int in) : x(x), p(p), in(in) { ; }\n bool operator<(const Event &rhs) const {\n if (x != rhs.x) {\n return x < rhs.x;\n }\n return in > rhs.in;\n }\n};\ninline int square(int x) { return x * x; }\ninline int dist2(const Point &a, const Point &b) {\n return square(a.x - b.x) + square(a.y - b.y);\n}\nint an, bn, n;\nint r;\nEvent event[500000];\nint PlaneSweep() {\n int ans = 0;\n int r4 = 4 * r;\n int r2 = 16 * r * r;\n set<Point> open[2];\n REP(iter, n) {\n Event &e = event[iter];\n Point &p = e.p;\n if (e.in) {\n set<Point>::iterator lower =\n open[(int)p.type ^ 1].lower_bound(Point(0, p.y - r4 - 1, 0));\n set<Point>::iterator upper =\n open[(int)p.type ^ 1].upper_bound(Point(0, p.y + r4 + 1, 0));\n for (set<Point>::iterator it = lower; it != upper; it++) {\n if (dist2(*it, p) <= r2) {\n ans++;\n }\n }\n open[(int)p.type].insert(p);\n } else {\n open[(int)p.type].erase(open[(int)p.type].find(p));\n }\n }\n return ans;\n}\nint main() {\n while (scanf(\"%d %d %d\", &an, &bn, &r), an | bn) {\n n = (an + bn) * 2;\n REP(i, an) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n event[2 * i + 0] = Event(x - 2 * r, Point(x, y, 0), 1);\n event[2 * i + 1] = Event(x + 2 * r, Point(x, y, 0), 0);\n }\n REP(i, bn) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n event[2 * an + 2 * i + 0] = Event(x - 2 * r, Point(x, y, 1), 1);\n event[2 * an + 2 * i + 1] = Event(x + 2 * r, Point(x, y, 1), 0);\n }\n sort(event, event + n);\n int ans = PlaneSweep();\n printf(\"%d\\n\", ans);\n }\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 10924,
"score_of_the_acc": -1.512,
"final_rank": 17
},
{
"submission_id": "aoj_1023_8215225",
"code_snippet": "#include <algorithm>\n#include <assert.h>\n#include <iostream>\n#include <math.h>\n#include <set>\n#include <stdio.h>\n#include <string.h>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) \\\n for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\nstruct Point {\n int x;\n int y;\n char type;\n Point() { ; }\n Point(double x, double y, int type) : x(x), y(y), type(type) { ; }\n bool operator<(const Point &rhs) const {\n if (y != rhs.y) {\n return y < rhs.y;\n }\n return x < rhs.x;\n }\n};\nstruct Event {\n int x;\n Point p;\n char in;\n Event() { ; }\n Event(int x, Point p, int in) : x(x), p(p), in(in) { ; }\n bool operator<(const Event &rhs) const {\n if (x != rhs.x) {\n return x < rhs.x;\n }\n return in > rhs.in;\n }\n};\ninline int square(int x) { return x * x; }\ninline int dist2(const Point &a, const Point &b) {\n return square(a.x - b.x) + square(a.y - b.y);\n}\nint an, bn, n;\nint r;\nEvent event[500000];\nint PlaneSweep() {\n int ans = 0;\n set<Point> open[2];\n REP(iter, n) {\n Event &e = event[iter];\n Point &p = e.p;\n if (e.in) {\n set<Point>::iterator lower =\n open[(int)p.type ^ 1].lower_bound(Point(0, p.y - 4 * r - 1, 0));\n set<Point>::iterator upper =\n open[(int)p.type ^ 1].upper_bound(Point(0, p.y + 4 * r + 1, 0));\n for (set<Point>::iterator it = lower; it != upper; it++) {\n if (dist2(*it, p) <= 16 * r * r) {\n ans++;\n }\n }\n open[(int)p.type].insert(p);\n } else {\n open[(int)p.type].erase(open[(int)p.type].find(p));\n }\n }\n return ans;\n}\nint main() {\n while (scanf(\"%d %d %d\", &an, &bn, &r), an | bn) {\n n = (an + bn) * 2;\n REP(i, an) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n event[2 * i + 0] = Event(x - 2 * r, Point(x, y, 0), 1);\n event[2 * i + 1] = Event(x + 2 * r, Point(x, y, 0), 0);\n }\n REP(i, bn) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n event[2 * an + 2 * i + 0] = Event(x - 2 * r, Point(x, y, 1), 1);\n event[2 * an + 2 * i + 1] = Event(x + 2 * r, Point(x, y, 1), 0);\n }\n sort(event, event + n);\n int ans = PlaneSweep();\n printf(\"%d\\n\", ans);\n }\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 11044,
"score_of_the_acc": -1.5284,
"final_rank": 19
},
{
"submission_id": "aoj_1023_8207818",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <map>\n#include <vector>\nusing namespace std;\ntypedef pair<int, int> pii;\nvector<int> v[10000];\nint main() {\n int aN, bN, R;\n while (cin >> aN >> bN >> R, aN) {\n for (int i = 0; i < 10000; i++)\n v[i].clear();\n for (int i = 0; i < aN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n v[y].push_back(x);\n }\n for (int i = 0; i < 10000; i++)\n sort(v[i].begin(), v[i].end());\n int D = 4 * R, ans = 0;\n for (int i = 0; i < bN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n for (int p = -D; p <= D; p++) {\n if (y + p < 0 || y + p >= 10000)\n continue;\n int m = sqrt((D - p) * (D + p));\n ans += upper_bound(v[y + p].begin(), v[y + p].end(), x + m) -\n lower_bound(v[y + p].begin(), v[y + p].end(), x - m);\n }\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 4544,
"score_of_the_acc": -0.3076,
"final_rank": 10
},
{
"submission_id": "aoj_1023_8207816",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <map>\n#include <vector>\nusing namespace std;\ntypedef pair<int, int> pii;\nvector<int> v[10000];\nint main() {\n int aN, bN, R;\n while (cin >> aN >> bN >> R, aN) {\n for (int i = 0; i < 10000; i++)\n v[i].clear();\n for (int i = 0; i < aN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n v[y].push_back(x);\n }\n for (int i = 0; i < 10000; i++)\n sort(v[i].begin(), v[i].end());\n int D = 4 * R, ans = 0;\n for (int i = 0; i < bN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n for (int p = -D; p <= D; p++) {\n if (y + p < 0 || y + p >= 10000)\n continue;\n int m = sqrt((D - p) * (D + p));\n ans += upper_bound(v[y + p].begin(), v[y + p].end(), x + m) -\n lower_bound(v[y + p].begin(), v[y + p].end(), x - m);\n }\n }\n printf(\"%d\\n\", ans);\n }\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 4552,
"score_of_the_acc": -0.3087,
"final_rank": 11
},
{
"submission_id": "aoj_1023_8115646",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <map>\n#include <vector>\nusing namespace std;\ntypedef pair<int, int> pii;\nvector<int> v[10000];\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int aN, bN, R;\n while (scanf(\"%d%d%d\", &aN, &bN, &R), aN) {\n for (int i = 0; i < 10000; i++)\n v[i].clear();\n for (int i = 0; i < aN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n v[y].push_back(x);\n }\n for (int i = 0; i < 10000; i++)\n sort(v[i].begin(), v[i].end());\n int D = 4 * R, ans = 0;\n for (int i = 0; i < bN; i++) {\n int x, y;\n scanf(\"%d%d\", &x, &y);\n for (int p = -D; p <= D; p++) {\n if (y + p < 0 || y + p >= 10000)\n continue;\n int m = sqrt((D - p) * (D + p));\n ans += upper_bound(v[y + p].begin(), v[y + p].end(), x + m) -\n lower_bound(v[y + p].begin(), v[y + p].end(), x - m);\n }\n }\n printf(\"%d\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 4568,
"score_of_the_acc": -0.2442,
"final_rank": 7
}
] |
aoj_1027_cpp
|
Problem I:
A Piece of Cake
In the city, there are two pastry shops. One shop was very popular because its cakes are pretty tasty.
However, there was a man who is displeased at the shop. He was an owner of another shop. Although cause of his shop's unpopularity is incredibly awful taste of its cakes, he never improved it. He was just growing hate, ill, envy, and jealousy.
Finally, he decided to vandalize the rival.
His vandalize is to mess up sales record of cakes. The rival shop sells
K
kinds of cakes and sales quantity is recorded for each kind. He calculates sum of sales quantities for all pairs of cakes. Getting
K
(
K
-1)/2 numbers, then he rearranges them randomly, and replace an original sales record with them.
An owner of the rival shop is bothered. Could you write, at least, a program that finds total sales quantity of all cakes for the pitiful owner?
Input
Input file contains several data sets.
A single data set has following format:
K
c
1
c
2
...
c
K
×(
K
-1)/2
K
is an integer that denotes how many kinds of cakes are sold.
c
i
is an integer that denotes a number written on the card.
The end of input is denoted by a case where
K
= 0. You should output nothing for this case.
Output
For each data set, output the total sales quantity in one line.
Constraints
Judge data contains at most 100 data sets.
2 ≤
K
≤ 100
0 ≤
c
i
≤ 100
Sample Input
2
2
3
5 4 3
0
Output for the Sample Input
2
6
|
[
{
"submission_id": "aoj_1027_2004163",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<n;i++)\nusing namespace std;\n\nint main() {\n\tint k;\n\twhile (cin >> k, k) {\n\t\tint sum = 0;\n\t\trep(i, k*(k - 1) / 2) {\n\t\t\tint c; cin >> c; sum += c;\n\t\t}\n\t\tcout << sum / (k - 1) << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3000,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_1027_1908363",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main(){\n int a,b,sum;\n while(1){\n cin>> a;\n if(a==0)break;\n sum=0;\n for(int i=0;i<a*(a-1)/2;i++){\n cin>>b;\n sum+=b;\n }\n cout << sum/(a-1) <<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0086,
"final_rank": 3
},
{
"submission_id": "aoj_1027_1901051",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n int k;\n int c;\n int sum;\n\n while (cin >> k && k != 0){\n int i = (k * (k - 1)) / 2;\n sum = 0;\n while (i--){\n cin >> c;\n sum += c;\n }\n cout << sum / (k - 1) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0086,
"final_rank": 3
},
{
"submission_id": "aoj_1027_1888209",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n int k;\n\n while (cin >> k, k){\n int sum = 0, n;\n n = k * (k - 1) / 2;\n\n for (int i = 0; i < n; i++){\n int num;\n cin >> num;\n sum += num;\n }\n cout << sum / (k - 1) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0086,
"final_rank": 3
},
{
"submission_id": "aoj_1027_1840859",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main() {\n\tint K;\n\twhile (cin >> K, K) {\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < K * (K - 1) / 2; i++) {\n\t\t\tint c;\n\t\t\tcin >> c;\n\t\t\tsum += c;\n\t\t}\n\t\tcout << sum / (K - 1) << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0086,
"final_rank": 3
},
{
"submission_id": "aoj_1027_1813683",
"code_snippet": "#include<iostream>\n#include<sstream>\n#include<iomanip>\n#include<stdlib.h>\n#include<string>\n#include<cstdio>\n#include<cstring>\n#include<cstdlib>\n#include<cmath>\n#include<vector>\n#include<set>\n#include<queue>\n#include<stack>\n#include<map>\n#include<utility>\n#include<algorithm>\n#include<complex>\nusing namespace std;\n#define loop(i,l,r) for(int (i)=(int)(l);(i)<(int)(r);(i)++)\n#define rloop(i,l,r) for(int (i)=(int)(l);(i)>(int)(r);(i)--)\n#define rep(i,n) loop(i,0,n)\n#define rrep(i,n) rloop(i,n-1,-1)\n#define INF 0x3f3f3f3f\n#define mod 1000000007LL\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> P;\ntypedef complex<double> C;\n\nvector<string> split(stringstream& ss){\n\tstring str;\n\tvector<string> res;\n\twhile(ss>>str)res.push_back(str);\n\treturn res;\n}\n\nint main(){\n\t\tint n,d,res;\n\t\twhile(1){\n\t\t\t\tcin>>n;\n\t\t\t\tif(n==0)break;\n\t\t\t\tres=0;\n\t\t\t\trep(i,n*(n-1)/2){\n\t\t\t\t\t\tcin>>d;\n\t\t\t\t\t\tres+=d;\n\t\t\t\t}\n\t\t\t\tcout<<res/(n-1)<<endl;\n\t\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1164,
"score_of_the_acc": -0.0108,
"final_rank": 17
},
{
"submission_id": "aoj_1027_1791604",
"code_snippet": "#include<iostream>\n#include<stdio.h>\nusing namespace std;\n\nint main(){\n\twhile(1){\n\t\tint n,ans=0,a;\n\t\tcin>>n;\n\t\tif(n==0)break;\n\t\tans=0;\n\t\tfor (int i = 0; i < n * (n - 1) / 2; i++) {\n\t\t\t\tcin>>a;\n\t\t\t\tans += a;\n\t\t}\n\t\tcout<<ans/(n-1)<<endl;\n\t}\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0086,
"final_rank": 3
},
{
"submission_id": "aoj_1027_1783385",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nint main(){\n\tint k,c,s;\n\twhile(true){\n\t\tcin>>k;\n\t\tif(k==0)\n\t\t\tbreak;\n\t\ts=0;\n\t\tfor(int i=0;i<k*(k-1)/2;i++){\n\t\t\tcin>>c;\n\t\t\ts+=c;\n\t\t}\n\t\tcout<<s/(k-1)<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0086,
"final_rank": 3
},
{
"submission_id": "aoj_1027_1718117",
"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 \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 fi first\n#define se second\n#define println(X) cout<<X<<endl;\n#define DBG(X) cout<<#X<<\" : \"<<X<<endl;\n \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;\n\n\n\nint main(){\n\tint k;\n\twhile(cin>>k && k){\n\t\tint s = 0, t;\n\t\trep(i, k*(k-1)/2) cin>>t, s += t;\n\t\tcout<<s/(k-1)<<endl;\n\t}\t\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": -0.0065,
"final_rank": 2
},
{
"submission_id": "aoj_1027_1716193",
"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\nusing namespace std;\n\n#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)\n#define REP(i,N) for(long long int i=0;i<(N);i++)\n#define ALL(s) (s).begin(),(s).end()\n\n#define PI 3.14159265358479\n\ntypedef long long ll;\n\nint k;\nint c, s;\n\nint main(){\n\twhile (cin >> k){\n\t\tif (k == 0)break;\n\t\ts = 0;\n\t\tREP(i, k*(k - 1) / 2){\n\t\t\tcin >> c;\n\t\t\ts += c;\n\t\t}\n\t\tcout << s / (k - 1) << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0086,
"final_rank": 3
},
{
"submission_id": "aoj_1027_1715633",
"code_snippet": "#include <iostream>\nusing namespace std;\n \nint main() {\nint k;\nwhile(cin >> k, k) {\nint sum;\nsum = 0;\nfor(int i = 0; i < k*(k-1)/2; i++) {\nint a;\ncin >> a;\nsum += a;\n}\ncout << sum / (k-1) << endl;\n}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0086,
"final_rank": 3
},
{
"submission_id": "aoj_1027_1630115",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(){\n int s,n,t,i;\n while(cin>>n&&n){\n s=0;\n for(i=0;i<n*(n-1)/2;i++){cin>>t;s+=t;}\n cout<<s/(n-1)<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0086,
"final_rank": 3
},
{
"submission_id": "aoj_1027_1630112",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(){\n int s,n,t;\n while(cin>>n&&n){\n s=0;\n for(int i=0;i<n*(n-1)/2;i++){cin>>t;s+=t;}\n cout<<s/(n-1)<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0086,
"final_rank": 3
},
{
"submission_id": "aoj_1027_1630111",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(){\n int n,t;\n while(cin>>n&&n){\n int s=0;\n for(int i=0;i<n*(n-1)/2;i++){cin>>t;s+=t;}\n cout<<s/(n-1)<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1160,
"score_of_the_acc": -1.0086,
"final_rank": 20
},
{
"submission_id": "aoj_1027_1630109",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(){\n int s,n,i,t;\n while(cin>>n&&n){\n s=0;\n for(i=0;i<n*(n-1)/2;i++){cin>>t;s+=t;}\n cout<<s/(n-1)<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0086,
"final_rank": 3
},
{
"submission_id": "aoj_1027_1630108",
"code_snippet": "#include <iostream>\nusing namespace std;\nint s,n,i,t;\nint main(){\n while(cin>>n&&n){\n s=0;\n for(i=0;i<n*(n-1)/2;i++){cin>>t;s+=t;}\n cout<<s/(n-1)<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1164,
"score_of_the_acc": -0.0108,
"final_rank": 17
},
{
"submission_id": "aoj_1027_1623896",
"code_snippet": "#include<iostream>\nusing namespace std;\nint n, a, sum;\nint main() {\n\twhile (true) {\n\t\tcin >> n; sum = 0; if (!n) { break; }\n\t\tfor (int i = 0; i < (n - 1)*n / 2; i++) {\n\t\t\tcin >> a;\n\t\t\tsum += a;\n\t\t}\n\t\tcout << sum / (n - 1) << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0086,
"final_rank": 3
},
{
"submission_id": "aoj_1027_1616889",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n\twhile(true){\n\t\tint k;\tcin>>k;\n\t\tif(k==0)\treturn 0;\n\t\tint n=k*(k-1)/2;\n\t\tint sum=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint c;\tcin>>c;\n\t\t\tsum+=c;\n\t\t}\n\t\tcout<<sum/(k-1)<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0086,
"final_rank": 3
},
{
"submission_id": "aoj_1027_1599249",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n\nusing namespace std;\n\nint main(){\n\t\n\tint K, n, sum;\n\t\n\twhile(true){\n\t\tcin >> K;\n\t\tif(K == 0){\n\t\t\tbreak;\n\t\t}\n\t\tsum = 0;\n\t\tfor(int i = 0; i < K * (K - 1) / 2; i++){\n\t\t\tcin >> n;\n\t\t\tsum += n;\n\t\t}\n\t\tsum /= (K - 1);\n\t\tprintf(\"%d\\n\", sum);\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1144,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1027_1575747",
"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#include <sstream>\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 k, sum = 0;\n\nint main(){\n\twhile (std::cin >> k, k){\n\t\tsum = 0;\n\t\trep(i, k * (k - 1) / 2){\n\t\t\tint c;\n\t\t\tstd::cin >> c;\n\t\t\tsum += c;\n\t\t}\n\t\tstd::cout << sum / (k - 1) << std::endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1160,
"score_of_the_acc": -0.0086,
"final_rank": 3
}
] |
aoj_1029_cpp
|
Problem A:
Traffic Analysis
There are two cameras which observe the up line and the down line respectively on the double lane (please see the following figure). These cameras are located on a line perpendicular to the lane, and we call the line 'monitoring line.' (the red line in the figure)
Monitoring systems are connected to the cameras respectively.
When a car passes through the monitoring line, the corresponding monitoring system records elapsed time (sec) from the start of monitoring.
Your task is to write a program which reads records of the two monitoring systems and prints the maximum time interval where cars did not pass through the monitoring line.
The two monitoring system start monitoring simultaneously. The end of monitoring is indicated by the latest time in the records.
Input
The input consists of multiple datasets. Each dataset consists of:
n m
tl
1
tl
2
...
tl
n
tr
1
tr
2
...
tr
m
n
,
m
are integers which represent the number of cars passed through monitoring line on the up line and the down line respectively.
tl
i
,
tr
i
are integers which denote the elapsed time when
i
-th car passed through the monitoring line for the up line and the down line respectively. You can assume that
tl
1
<
tl
2
< ... <
tl
n
、
tr
1
<
tr
2
< ... <
tr
m
.
You can also assume that
n
,
m
≤ 10000, and 1 ≤
tl
i
,
tr
i
≤ 1,000,000.
The end of input is indicated by a line including two zero.
Output
For each dataset, print the maximum value in a line.
Sample Input
4 5
20 35 60 70
15 30 40 80 90
3 2
10 20 30
42 60
0 1
100
1 1
10
50
0 0
Output for the Sample Input
20
18
100
40
|
[
{
"submission_id": "aoj_1029_6047634",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n{\n int n, m;\n\n while (cin >> n >> m, n || m)\n {\n vector<int> time;\n int tmp, ans = 0;\n for (int i = 0; i < n + m; i++)\n {\n cin >> tmp;\n time.push_back(tmp);\n }\n sort(time.begin(), time.end());\n ans = time[0];\n for (int i = 1; i < time.size(); i++)\n {\n ans = max(ans, time[i] - time[i - 1]);\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3448,
"score_of_the_acc": -0.355,
"final_rank": 16
},
{
"submission_id": "aoj_1029_6047615",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n while (true)\n {\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0)\n {\n break;\n }\n\n set<int> st;\n for (int i = 0; i < n; i++)\n {\n int t;\n cin >> t;\n st.insert(t);\n }\n for (int i = 0; i < m; i++)\n {\n int t;\n cin >> t;\n st.insert(t);\n }\n int ans = 0;\n int pt = 0;\n for (auto u : st)\n {\n if (ans < u - pt)\n {\n ans = u - pt;\n }\n pt = u;\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3912,
"score_of_the_acc": -0.8571,
"final_rank": 18
},
{
"submission_id": "aoj_1029_5782076",
"code_snippet": "#include <cstdio>\n#include <vector>\n#include <queue>\n#include <functional>\n#include <iostream>\n\nint L[10002];\nint R[10002];\nint B[20010];\n\nint main()\n{\n\tint n, m;\n\twhile (1)\n\t{\n\t\tstd::cin >> n >> m;\n\t\tif (n == 0 && m == 0)\n\t\t\tbreak;\n\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tstd::cin >> L[i];\n\t\tfor (int i = 0; i < m; i++)\n\t\t\tstd::cin >> R[i];\n\n\t\tint i = 0;\n\t\tint j = 0;\n\t\tL[n] = R[m] = 1000001;\n\t\tint len = 0;\n\t\tfor (int k = 0; k < m + n; k++)\n\t\t{\n\t\t\tif (L[i] <= R[j])\n\t\t\t{\n\t\t\t\tB[k] = L[i++];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tB[k] = R[j++];\n\t\t\t}\n\n\t\t\tif (k > 0)\n\t\t\t{\n\t\t\t\tif (B[k] - B[k - 1] > len)\n\t\t\t\t\tlen = B[k] - B[k - 1];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlen = B[0];\n\t\t\t}\n\t\t}\n\n\t\tstd::cout << len << std::endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3192,
"score_of_the_acc": -0.0779,
"final_rank": 8
},
{
"submission_id": "aoj_1029_3976073",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint solve(int n,int m){\n vector<int>v1;\n for(int i = 0;i < n;i++){\n int g;\n cin >> g;\n v1.push_back(g);\n }\n vector<int>v2;\n for(int i = 0;i < m;i++){\n int g;\n cin >> g;\n v2.push_back(g);\n }\n copy(v2.begin(),v2.end(),back_inserter(v1));\n sort(v1.begin(),v1.end());\n int max = v1[0];\n for(int i = 1;i < n+m;i++){\n if(max < v1[i] - v1[i - 1]){\n max = v1[i] - v1[i - 1];\n }\n }\n return max;\n}\nint main(){\n vector<int>a;\n while(1){\n int n ,m;\n cin >> n >> m;\n if(n == m && n == 0)break;\n \n a.push_back(solve(n,m));\n }\n for(int i = 0;i < a.size();i++){\n cout << a[i] << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3188,
"score_of_the_acc": -0.0736,
"final_rank": 6
},
{
"submission_id": "aoj_1029_3543552",
"code_snippet": "#include <algorithm>\n#include <cassert>\n#include <iostream>\n#include <vector>\n\n#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)\n\nusing namespace std;\ntypedef vector<int> VI;\n\nint main(void) {\n int n,m;\n for(;cin>>n>>m&&n+m;){\n VI a(n+m+1);\n REP(i,0,n+m)cin>>a[i];\n sort(a.begin(),a.end());\n int k=0;\n REP(i,0,a.size()-1)k=max(k,a[i+1]-a[i]);\n cout<<k<<\"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3192,
"score_of_the_acc": -0.0779,
"final_rank": 8
},
{
"submission_id": "aoj_1029_3377469",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main()\n{\n int n, m;\n\n while( cin >> n >> m )\n {\n if( n + m == 0 )\n break;\n \n int* a = new int[n];\n int* b = new int[m];\n int* c = new int[n+m];\n\n for( int i = 0; i < n; i++ )\n cin >> a[i];\n\n for( int i = 0; i < m; i++ )\n cin >> b[i];\n\n int i = 0, j = 0;\n while( i < n && j < m )\n {\n if( a[i] < b[j] )\n {\n c[i+j] = a[i];\n i++;\n }\n else\n {\n c[i+j] = b[j];\n j++;\n }\n }\n while( i < n )\n {\n c[i+j] = a[i];\n i++;\n }\n while( j < m )\n {\n c[i+j] = b[j];\n j++;\n }\n\n int ma = c[0];\n for( i = 0; i < n + m - 1; i++ )\n ma = ma > c[i+1] - c[i] ? ma : c[i+1] - c[i];\n\n cout << ma << endl;\n\n delete a, b, c;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3364,
"score_of_the_acc": -0.2641,
"final_rank": 15
},
{
"submission_id": "aoj_1029_3324979",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nint main(){\n int n, m;\n while(cin >> n >> m, n+m){\n vector<int> v(n+m);\n for(int i = 0; i < n+m; i++) cin >> v[i];\n sort(v.begin(), v.end());\n int ans = v[0];\n for(int i = 1; i < n+m; i++) ans = max(ans, v[i]-v[i-1]);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3164,
"score_of_the_acc": -0.0476,
"final_rank": 3
},
{
"submission_id": "aoj_1029_3228676",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n,m;\n while(true){\n cin>>n>>m;\n if(n==0&&m==0)break;\n vector<int> v;\n for (int i = 0; i < n; ++i) {\n int t;\n cin>>t;\n v.emplace_back(t);\n }\n for (int i = 0; i < m; ++i) {\n int t;\n cin>>t;\n v.emplace_back(t);\n }\n v.emplace_back(0);\n sort(v.begin(),v.end());\n int ans=0;\n for (size_t i = 1; i < v.size(); ++i) {\n ans=max(ans,v[i]-v[i-1]);\n }\n cout<<ans<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3236,
"score_of_the_acc": -0.1255,
"final_rank": 13
},
{
"submission_id": "aoj_1029_3228670",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef tuple<int, int, int> T;\n\nint MOD=1e9+7;\nll INF=1e18;\n\nint dx[]={1, -1, 0, 0};\nint dy[]={0, 0, 1, -1};\n\nint main(){\n while(1){\n int n, m; cin>>n>>m;\n if(n==0 && m==0) return 0;\n vector<ll> a(n+m);\n for(int i=0; i<n+m; i++) cin>>a[i];\n sort(a.begin(), a.end());\n ll gap=a[0];\n for(int i=0; i<n+m-1; i++){\n gap=max(gap, a[i+1]-a[i]);\n }\n cout << gap << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3168,
"score_of_the_acc": -0.0519,
"final_rank": 5
},
{
"submission_id": "aoj_1029_3228669",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(){\n int n, m;\n while(cin >> n >> m, n or m){\n vector<int> V(n+m+1);\n V[0] = 0;\n for(int i = 0; i < n+m; ++i) cin >> V[i+1];\n sort(V.begin(), V.end());\n int ans = 0;\n for(int i = 0; i < n+m; ++i) ans = max(ans, V[i+1]-V[i]);\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3240,
"score_of_the_acc": -0.1299,
"final_rank": 14
},
{
"submission_id": "aoj_1029_2492777",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<math.h>\n#include<string>\n#include<string.h>\n#include<stack>\n#include<queue>\n#include<vector>\n#include<utility>\n#include<set>\n#include<map>\n#include<stdlib.h>\n#include<iomanip>\n\nusing namespace std;\n\n#define ll long long\n#define ld long double\n#define EPS 0.0000000001\n#define INF 1e9\n#define MOD 1000000007\n#define rep(i,n) for(i=0;i<n;i++)\n#define loop(i,a,n) for(i=a;i<n;i++)\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\n\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\n\nint main(void) {\n int i,j;\n int n,m;\n while(1){\n cin>>n>>m;\n if(n+m==0)break;\n vi a(n+m+1);\n a[0]=0;\n rep(i,n)cin>>a[i+1];\n rep(i,m)cin>>a[n+i+1];\n sort(all(a));\n int ans=0;\n rep(i,n+m)ans=max(ans,a[i+1]-a[i]);\n cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3216,
"score_of_the_acc": -0.1039,
"final_rank": 10
},
{
"submission_id": "aoj_1029_2420844",
"code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main(){\n\tint n, m;\n\twhile (cin >> n >> m){\n\t\tif (!n && !m)return 0;\n\t\tlong long a[20001], ans = 0;\n\t\tfor (int i = 0; i < n + m; i++)cin >> a[i]; sort(a, a + n + m);\n\t\tans = a[0];\n\t\tfor (int i = 1; i < n + m; i++)ans = max(ans, a[i] - a[i - 1]);\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3120,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1029_2388822",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int a,b;\n while(cin>>a>>b,a+b){\n vector<int>v;\n for(int i=0;i<a+b;i++){\n int p;\n cin>>p;\n v.push_back(p);\n }\n sort(v.begin(),v.end());\n int ans=0,p=0;\n for(int i=0;i<a+b;i++){\n ans=max(ans,v[i]-p);\n p=v[i];\n }\n cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3216,
"score_of_the_acc": -0.1039,
"final_rank": 10
},
{
"submission_id": "aoj_1029_2388205",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<string>\n#include<cmath>\n#include<vector>\n#include<functional>\n\nusing namespace std;\n\nint n, m, t[300000];\n\nint main(){\n\t\n\tvector<int> ans;\n\twhile (1) {\n\t\tcin >> n >> m;\n\t\tif (n == 0 && m == 0)break;\n\t\tfor (int i = 0; i < n; i++)cin >> t[i];\n\t\tfor (int i = n; i < m+n; i++)cin >> t[i];\n\t\tsort(t, t + n + m);\n\t\tint Max = t[0];\n\t\tfor (int i = 0; i < n + m - 1; i++)Max = max(Max, t[i + 1] - t[i]);\n\t\tans.push_back(Max);\n\t}\n\tfor (int i = 0; i < ans.size(); i++)cout << ans[i] << endl;\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3164,
"score_of_the_acc": -0.0476,
"final_rank": 3
},
{
"submission_id": "aoj_1029_2388181",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n,m;\n while(cin>>n>>m,n+m){\n int t[20005];\n for(int i=0;i<n+m;++i)\n cin>>t[i];\n sort(t,t+n+m);\n int ans=t[0];\n for(int i=1;i<n+m;++i){\n ans=max(ans,t[i]-t[i-1]);\n }\n cout<<ans<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3220,
"score_of_the_acc": -0.1082,
"final_rank": 12
},
{
"submission_id": "aoj_1029_2231474",
"code_snippet": "#include <iostream>\n#include <set>\n#define MAX(a,b) ((a>b)?(a):(b))\nusing namespace std;\n\nint main(void){\n\tint n,m;\n\tint a;\n\twhile(cin>>n>>m,n||m){\n\t\tstd::set<int> ms;\n\t\tfor(int i=0;i<n+m;i++)cin>>a,ms.insert(a);\n\t\tint m=*(ms.begin());\n\t\tfor(__typeof(ms.begin()) it=++ms.begin(),b=ms.begin();it!=ms.end();it++,b++){\n\t\t\tm=MAX(m,*it-*b);\n\t\t}\n\t\tcout<<m<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3824,
"score_of_the_acc": -0.7619,
"final_rank": 17
},
{
"submission_id": "aoj_1029_2231472",
"code_snippet": "#include <iostream>\n#include <set>\n#define MAX(a,b) ((a>b)?(a):(b))\nusing namespace std;\n\nint main(void){\n\tint n,m;\n\tint a;\n\twhile(cin>>n>>m,n||m){\n\t\tstd::multiset<int> ms;\n\t\tfor(int i=0;i<n+m;i++)cin>>a,ms.insert(a);\n\t\tint m=*(ms.begin());\n\t\tfor(__typeof(ms.begin()) it=++ms.begin(),b=ms.begin();it!=ms.end();it++,b++){\n\t\t\tm=MAX(m,*it-*b);\n\t\t}\n\t\tcout<<m<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3928,
"score_of_the_acc": -0.8745,
"final_rank": 19
},
{
"submission_id": "aoj_1029_2198343",
"code_snippet": "#define _USE_MATH_DEFINES\n#include \"bits/stdc++.h\"\nusing namespace std;\n\n//#define int long long\n#define DBG 1\n#define dump(o) if(DBG){cerr<<#o<<\" \"<<o<<endl;}\n#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<\" \"<<e;cerr<<endl;}\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 each(it,c) for(auto it=(c).begin();it!=(c).end();it++)\n#define all(c) c.begin(),c.end()\nconst int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;\nconst int MOD = (int)(1e9 + 7);\n\nsigned main() {\n\tint n, m;\n\twhile (cin >> n >> m, n || m) {\n\t\tvector<int>v(1,0);\n\t\trep(i, 0, n + m) {\n\t\t\tint a; cin >> a;\n\t\t\tv.push_back(a);\n\t\t}\n\t\tsort(all(v));\n\t\tvector<int>ans;\n\t\trep(i, 0, v.size()-1) {\n\t\t\tans.push_back(v[i + 1] - v[i]);\n\t\t}\n\t\tcout << *max_element(all(ans)) << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3156,
"score_of_the_acc": -0.039,
"final_rank": 2
},
{
"submission_id": "aoj_1029_2154127",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<string>\n#include<set>\nusing namespace std;\nint main() {\n\tint n, m, x;\n\twhile (cin >> n >> m&&(n != 0||m!=0)) {\n\t\tmultiset<int>a;\n\t\ta.insert(0);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> x;\n\t\t\ta.insert(x);\n\t\t}\n\t\tfor (int j = 0; j < m; j++) {\n\t\t\tcin >> x;\n\t\t\ta.insert(x);\n\t\t}\n\t\tmultiset<int>::iterator it = a.begin();\n\t\tit++;\n\t\tint sa = 0;\n\t\tfor (int i = 1; i <= n + m; i++) {\n\t\t\tsa = max(sa, (*it) - (*--it));\n\t\t\tit++;\n\t\t\tit++;\n\t\t}\n\t\tcout << sa << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4044,
"score_of_the_acc": -1,
"final_rank": 20
},
{
"submission_id": "aoj_1029_2152214",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n\nint main() {\n\twhile (1) {\n\n\t\tint N, M; cin >> N >> M;\n\t\tif (!N&&!M)break;\n\t\tvector<int>vs(N + M);\n\t\tfor (int i = 0; i < N + M; ++i) {\n\t\t\tcin >> vs[i];\n\t\t}\n\t\tvs.emplace_back(0);\n\t\tsort(vs.begin(), vs.end());\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < vs.size() - 1; ++i) {\n\t\t\tans = max(ans, vs[i + 1] - vs[i]);\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3188,
"score_of_the_acc": -0.0736,
"final_rank": 6
}
] |
aoj_1026_cpp
|
Problem H:
Hedro's Hexahedron
Dr. Hedro is astonished. According to his theory, we can make sludge that can dissolve almost everything on the earth. Now he's trying to produce the sludge to verify his theory.
The sludge is produced in a rectangular solid shaped tank whose size is
N
×
N
× 2. Let coordinate of two corner points of tank be (-
N
/2, -
N
/2, -1), (
N
/2,
N
/2, 1) as shown in Figure 1.
Figure 1
Doctor pours liquid that is ingredient of the sludge until height of the liquid becomes 1. Next, he get a lid on a tank and rotates slowly, without ruffling, with respect to
z
axis (Figure 2). After rotating enough long time, sludge is produced. Volume of liquid never changes through this operation.
Figure 2
Needless to say, ordinary materials cannot be the tank. According to Doctor's theory, there is only one material that is not dissolved by the sludge on the earth. Doctor named it finaldefenceproblem (for short, FDP). To attach FDP tiles inside the tank allows to produce the sludge.
Since to produce FDP is very difficult, the size of FDP tiles are limited to 1 * 1. At first, doctor tried to cover entire the entire inside of the tank. However, it turned out that to make enough number FDP tiles that can cover completely is impossible because it takes too long time. Therefore, he decided to replace FDP tiles where an area the sludge touches is zero with those of ordinary materials. All tiles are very thin, so never affects height of the sludge.
How many number of FDP tiles does doctor need? He has imposed this tough problem on you, his helper.
Input
Input file contains several data sets.
Each data set has one integer that describes
N
.
Input ends when
N
= 0. You should output nothing for this case.
Output
For each data set, print the number of tiles in a line.
Constraints
Judge data consists of at most 150 datasets.
2 ≤
N
≤ 10
12
N
is even number
Sample Input
2
4
0
Output for the Sample Input
24
64
|
[
{
"submission_id": "aoj_1026_10853956",
"code_snippet": "/*\n * Author: tender\n * Created Time: 2011/9/5 13:02:29\n * File Name: h.cpp\n */\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <map>\n#include <queue>\n#include <string>\n#include <vector>\n\nusing namespace std;\nconst double pi = acos(-1.0);\nint main() {\n long long ans, x, y, n;\n int flag;\n while(scanf(\"%lld\", &n), n) {\n ans = 8 * n + 2 * (4 * n - 4);\n //printf(\"ans = %lld\\n\", ans);\n n /= 2;\n long long tmp = 0;\n long long end = sqrt(double(n));\n for (x = 1; x <= end; x++) {\n tmp += n / x;\n if (n % x == 0) tmp--;\n }\n //printf(\"tmp = %lld\\n\", tmp);\n tmp -= end * end;\n if (end * end == n) {\n flag = 1;\n tmp++;\n }\n else\n flag = 0;\n //printf(\"tmp = %lld\\n\", tmp);\n tmp = tmp * 2 + end * end - flag;\n tmp *= 8;\n //printf(\"tmp = %lld\\n\", tmp);\n ans += tmp;\n printf(\"%lld\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3448,
"score_of_the_acc": -0.4991,
"final_rank": 13
},
{
"submission_id": "aoj_1026_5893784",
"code_snippet": "#include <cmath>\n#include <vector>\n#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <algorithm>\n#include <set>\n#include <queue>\n#include <string>\n#include <map>\n#include <stack>\n#include <climits>\n#include <array>\n#include <unordered_set>\n#include <unordered_map>\n#include <memory>\n#include <functional>\n#include <cfloat>\n#include <numeric>\n#include <random>\n#include <sstream>\n#include <bitset>\n#include <complex>\n#include <chrono>\n#include <cassert>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n\nlong long int solve(const long long int n);\n\nint main() {\n\tlong long int n;\n\twhile (std::cin >> n) {\n\t\tif (n == 0) break;\n\t\tconst auto result = solve(n);\n\t\tstd::cout << result << '\\n';\n\t}\n}\nlong long int solve(const long long int n) {\n\tconst auto half = n / 2;\n\tconst int sqrt = std::sqrt(half);\n\tlong long int result = n - 1;\n\tfor (auto x = 1; x <= sqrt; ++x) {\n\t\tconst auto y = half / x;\n\t\tauto count = y - x;\n\t\tif (x * y != half) {\n\t\t\t++count;\n\t\t}\n\t\tif (count > 0) {\n\t\t\tresult += count * 2 - 1;\n\t\t}\n\t}\n\tresult += n;\n\tresult <<= 3;\n\treturn result;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3328,
"score_of_the_acc": -0.4867,
"final_rank": 12
},
{
"submission_id": "aoj_1026_3176999",
"code_snippet": "#include<iomanip>\n#include<limits>\n#include<thread>\n#include<utility>\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<set>\n#include<map>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<cmath>\n#include<numeric>\n#include<cassert>\n#include<random>\n#include<chrono>\n#include<unordered_map>\n#include<fstream>\n#include<list>\n#include<typeinfo>\n#include<functional>\nusing namespace std;\ntypedef unsigned long long int ull;\ntypedef long long int ll;\ntypedef pair<ll,ll> pll;\ntypedef pair<int,int> pi;\ntypedef pair<double,double> pd;\ntypedef pair<double,ll> pdl;\n#define F first\n#define S second\nconst ll E=1e18+7;\nconst ll MOD=1000000007;\n\n\n\n\n\n\nint main(){\n ll n;\n while(cin>>n && n){\n ll count=n/2;\n ll i;\n for(i=1;i*i<n/2;i++){\n count+=(n/2+i-1)/i;\n }\n cout<<((((count*=2)-=i*i)*=8)+=2*4*n)<<endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3092,
"score_of_the_acc": -0.4623,
"final_rank": 10
},
{
"submission_id": "aoj_1026_3176881",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n//INSERT ABOVE HERE\nsigned main(){\n Int n;\n while(cin>>n,n){\n Int cnt=n/2,i;\n for(i=1;i*i<n/2;i++) cnt+=(n/2+i-1)/i;\n cnt=cnt*2-i*i;\n cout<<(cnt+n)*8<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3012,
"score_of_the_acc": -0.454,
"final_rank": 8
},
{
"submission_id": "aoj_1026_3176873",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n//INSERT ABOVE HERE\nsigned main(){\n Int n;\n while(cin>>n,n){\n Int cnt=n/2,i;\n for(i=1;i*i<n/2;i++) cnt+=(n/2+i-1)/i;\n cnt=cnt*2-i*i;\n cnt+=n;\n cout<<cnt*8<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3072,
"score_of_the_acc": -0.4602,
"final_rank": 9
},
{
"submission_id": "aoj_1026_2942663",
"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\nll N;\n\nvoid func(){\n\n\tll num1 = 4*2*N;\n\tll num2 = 2*(4*N-4);\n\tll num3 = 0;\n\tll x;\n\n\tfor(x = 1; x*x < N/2; x++){\n\t\tnum3 += (N+2*x-1)/(2*x)-1;\n\t}\n\tnum3 = 2*num3-(x-1)*(x-1);\n\tnum3 *= 8;\n\n\tprintf(\"%lld\\n\",num1+num2+num3);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%lld\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3144,
"score_of_the_acc": -0.6105,
"final_rank": 16
},
{
"submission_id": "aoj_1026_2926980",
"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 solve(bitset<18>bs, vector<vector<int>>&dp,const vector<pair<int,int>>&vs,const int now) {\n\tif(dp[now][bs.to_ulong()]!=-1)return dp[now][bs.to_ulong()];\n\n\tbool ok = false;\n\tif(bs.count()==vs.size())ok=true;\n\telse {\n\t\tfor (int i = 0; i < vs.size(); ++i) {\n\t\t\tif (bs[i]) {\n\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (vs[i].first == now || now == 7) {\n\t\t\t\t\tbs[i] = true;\n\t\t\t\t\tbool aok = solve(bs, dp, vs, vs[i].second);\n\t\t\t\t\tif (aok)ok = true;\n\t\t\t\t\tbs[i] = false;\n\t\t\t\t}\n\t\t\t\tif (vs[i].second == now || now == 7) {\n\t\t\t\t\tbs[i] = true;\n\t\t\t\t\tbool aok = solve(bs, dp, vs, vs[i].first);\n\t\t\t\t\tif(aok)ok=true;\n\t\t\t\t\tbs[i] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\n\t}\n\treturn dp[now][bs.to_ulong()]=ok;\n}\nint main()\n{\n\tlong long int N;\n\twhile (cin >> N) {\n\t\tif(!N)break;\n\t\tN/=2;\n\t\tvector<int>v;\n\t\tv.push_back(N);\n\t\tlong long int ans=N;\n\t\tlong long int x=1;\n\t\tfor (; x < sqrt(N); ++x) {\n\t\t\tv.push_back((N+x-1)/x);\n\t\t\tans+=(N+x-1)/x;\n\t\t}\n\n\t\tfor (long long int y = sqrt(N)+1; y >= 2; --y) {\n\t\t\tlong long int l=(N+y-1)/y;\n\t\t\tlong long int r=(N+y-2)/(y-1);\n\t\t\tl=max(l,x);\n\n\t\t\tans+=static_cast<long long int>(y)*(r-l);\n\t\t\t/*for (int k = l; k < r; ++k) {\n\t\t\t\tv.push_back(y);\n\t\t\t}*/\n\t\t}\n\t\tans*=8;\n\t\tans+=4*N*4;\n\t\tcout<<ans<<endl;\n\t\t\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 9680,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_1026_2880298",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath>\n#include <cstdio>\nusing namespace std;\n\nint main(){\n long long int N;\n while(cin >> N, N){\n long long int ans = 0, t = ceil(sqrt(N/2.0));\n for(long long int i = 1; i < t; ++i){\n ans += (long long)ceil((double)N/2/i)*2;\n }\n ans += N;\n ans -= t*t;\n ans *= 8;\n ans += 8*N;\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3064,
"score_of_the_acc": -0.3165,
"final_rank": 1
},
{
"submission_id": "aoj_1026_2880036",
"code_snippet": "#include <iostream>\n#include <cmath>\nusing namespace std;\ntypedef long long int lli;\n\nint main(){\n while(1){\n lli n;\n cin >> n;\n if(n==0) break;\n \n lli ans = 2*n*n +8*n;\n n /= 2;\n lli sqrtn = ceil(sqrt(n));\n ans -= (n-sqrtn)*(n-sqrtn) *8;\n for(lli i=1; i<sqrtn; i++){\n ans -= ( n -(n+i-1)/i ) *16;\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2984,
"score_of_the_acc": -0.4511,
"final_rank": 7
},
{
"submission_id": "aoj_1026_2880006",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\ntypedef long long int lli;\ndouble EPS = 1e-8;\n\nlli solve(lli n){\n lli total = 2*n*n +8*n;\n lli s = n/2;\n lli rem = 0;\n lli sqrts = ceil(sqrt((long double)s));\n rem += (s-sqrts)*(s-sqrts);\n for(lli i=1; i<sqrts; i++){\n rem += ( s - (s+i-1)/i ) *2;\n }\n return total -rem*8;\n}\n\nint main(){\n while(1){\n lli n;\n cin >> n;\n if(n==0) break;\n cout << solve(n) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3136,
"score_of_the_acc": -0.4668,
"final_rank": 11
},
{
"submission_id": "aoj_1026_1619084",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n\twhile(true){\n\t\tll n;\tcin>>n;\n\t\tif(n==0) \treturn 0;\n\t\tll ans=8*n;// 底面積\n\t\tll ans2=n/2;\n\t\tll w=1;\n\t\tfor(;w*w<n/2;w++){\n\t\t\tans2+=(n+2*w-1)/(2*w);\n\t\t}\n\t\tans2=2*ans2-w*w;\n\t\tif(n&1)\tans2++;\n\t\tll s=ans+ans2*8;\n\t\tcout<<s<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1156,
"score_of_the_acc": -0.4051,
"final_rank": 2
},
{
"submission_id": "aoj_1026_1442971",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n__int128 N;\n__int128 f(__int128 x){\n\treturn (N+2*x-1) / (2*x);\n}\n\n__int128 s1(long long N){\n\t__int128 sum = 0;\n\tlong long T= sqrt(N/2) - 1e-10;\n\tT++;\n\t__int128 now = N/2;\n\tfor(long long i = 1 ; i <= T ; i++){\n\t\tsum += N/2 - now;\n\t\tsum += N/2 - now;\n\t\tnow = f(i);\n\t}\n\tsum += (__int128)(N/2-T) * (N/2-T);\n\t\n\treturn sum;\n}\n\nint main(){\n\tlong long N_;\n\twhile( cin >> N_ && N_ ){\n\t\tN = N_;\n\t\t__int128 sum = s1(N);\n\t\t__int128 result = 4*(2*N)+2*N*N-8*sum;\n\t\tstring s;\n\t\twhile( result > 0 ){\n\t\t\ts = string(1,'0'+(int)(result%10)) + s;\n\t\t\tresult /= 10;\n\t\t}\n\t\tcout << s << endl;\n\t\t\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1208,
"score_of_the_acc": -0.6962,
"final_rank": 17
},
{
"submission_id": "aoj_1026_709199",
"code_snippet": "#include<stdio.h>\nint main(){\n\tlong long n;\n\twhile(1){\n\t\tscanf(\"%lld\",&n);\n\t\tif(n==0)break;\n\t\tlong long i;\n\t\tlong long ans=0;\n\t\tlong long k=n/2;\n\t\tfor(i=1;i*i<k;i++){\n\t\t\tans+=((k-1)/i+1)-(i+1);\n\t\t}\n\t\tans=(ans+n/2-1)*2+i;\n\t\tans=(ans+n)*8;\n\t\tprintf(\"%lld\\n\",ans);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1028,
"score_of_the_acc": -0.5348,
"final_rank": 14
},
{
"submission_id": "aoj_1026_553190",
"code_snippet": "#include<cstdio>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint main(){\n\tfor(ll n;scanf(\"%lld\",&n),n;){\n\t\tll ans1=4*2*n; // 奥行き\n\t\tll ans2=4*n-4; // 一番外側の幅 1 の部分\n\n\t\tll ans3=0,x; // 左下 1/4 の ans2 を除いた部分\n\t\tfor(x=1;x*x<n/2;x++) ans3+=(n+2*x-1)/(2*x)-1;\n\t\tans3=2*ans3-(x-1)*(x-1);\n\n\t\tprintf(\"%lld\\n\",ans1+2*(ans2+4*ans3));\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1028,
"score_of_the_acc": -0.5348,
"final_rank": 14
},
{
"submission_id": "aoj_1026_543890",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\ntypedef long long lli;\n\nint main() {\n lli N;\n while(cin >> N && N) {\n lli sq = ceil(sqrt(N*2)/2.0);\n lli sum = 0;\n for(lli x = 1; x < sq; ++x) {\n sum += (lli)ceil((double)N/(2.0*x));\n }\n cout << N*8 + (sum*8 - sq*sq*4 + 4 + N*4-4)*2 << endl;;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1160,
"score_of_the_acc": -0.4055,
"final_rank": 3
},
{
"submission_id": "aoj_1026_540810",
"code_snippet": "#include<iostream>\n#include<cmath>\n\nusing namespace std;\n\ndouble Calculate(double n);\n\nint main(){\n double n, sum;\n while(1){\n cin >> n;\n if(n == 0) break;\n sum = Calculate(n/2);\n cout.setf(ios::fixed, ios::floatfield);\n cout.precision(0);\n cout << sum << endl;\n }\n return 0;\n}\n\ndouble Calculate(double n){\n double i, m, x, y, sum;\n\n if(modf(sqrt(n), &m) != 0) ++m;\n if(m == n){\n m = 2*n;\n return 2*m*m + 8*m;\n }\n for(i=m-1, y=m, sum=0; i>=1; --i){\n if(modf(n/i, &x) != 0) ++x;\n sum += (i+1)*(x-y);\n y=x;\n }\n return 8*(m*m + 2*sum) + 16*n;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1280,
"score_of_the_acc": -0.4179,
"final_rank": 5
},
{
"submission_id": "aoj_1026_511850",
"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 <set>\n#include <map>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\nconst int INF = 1<<29;\n\ntypedef long long ll;\n\nint main() {\n ll n;\n while(scanf(\"%lld\",&n),n) {\n ll corner = 1;\n while(corner*corner<n/2) ++corner;\n ll side = n/2;\n for (ll i=1; i*i<n/2; ++i) side += (n/2+i-1)/i;\n side -= corner*corner;\n //cout << corner << \" \" << side << endl;\n ll ans = side*8+corner*corner*4;\n ans *= 2;\n ans += n*2*4;\n printf(\"%lld\\n\",ans);\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1188,
"score_of_the_acc": -0.4084,
"final_rank": 4
},
{
"submission_id": "aoj_1026_258635",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <string>\n#include <queue>\nusing namespace std;\n#define SZ(v) ((int)(v).size())\nconst int maxint = -1u>>1;\n\nlong long n;\n\nlong long gao(long long x) {\n // find p1 * p2 < x\n long long res = 0;\n for (long long p1 = 1; p1 * p1 < x; ++p1) {\n res += ((x - 1) / p1) * 2;\n //printf (\"add %I64d\\n\", ((x - 1) / p1) * 2);\n }\n long long sres = (long long)sqrt((double)x - 1.0);\n //printf (\"sub %I64d\\n\", sres * sres);\n return (res - sres * sres) * 8;\n}\n\nint main() {\n while (scanf (\"%lld\", &n), n) {\n long long ans = n * 8 + (n - 1) * 8;\n printf (\"%lld\\n\", ans + gao(n >> 1));\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 0,
"score_of_the_acc": -0.4286,
"final_rank": 6
},
{
"submission_id": "aoj_1026_258594",
"code_snippet": "/*\n * Author: Dumbear\n * Created Time: 2011/8/31 14:29:36\n * File Name: H.cpp\n */\n#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n#define out(v) cerr << #v << \": \" << (v) << endl\n#define SZ(v) ((int)(v).size())\nconst int maxint = -1u>>1;\ntemplate <class T> bool get_max(T& a, const T &b) {return b > a? a = b, 1: 0;}\ntemplate <class T> bool get_min(T& a, const T &b) {return b < a? a = b, 1: 0;}\n\nlong long n;\n\nbool solve();\n\nint main() {\n while (solve());\n return 0;\n}\n\nbool solve() {\n scanf(\"%lld\", &n);\n if (n == 0)\n return false;\n long long cnt = n - 1;\n for (long long i = 1; ; ++i) {\n if (i * i * 2 >= n)\n break;\n long long m = n / 2 / i;\n if (m * i * 2 == n)\n --m;\n cnt += (m - i) * 2 + 1;\n //printf(\"-- %I64d\\n\", cnt);\n }\n //printf(\"-- %I64d\\n\", cnt);\n printf(\"%lld\\n\", cnt * 8 + 8 * n);\n return true;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 880,
"score_of_the_acc": -0.9481,
"final_rank": 18
},
{
"submission_id": "aoj_1026_110988",
"code_snippet": "#include<iostream>\n#include<cmath>\nusing namespace std;\nconst double eps = 1.0e-9;\nint main()\n{\n while(true){\n long long int n,r,ans=0;\n scanf(\"%lld\",&n);\n if( n == 0 )break;\n long long int tmp = n>>1;\n long long int rn = (long long int)ceil(sqrt(tmp));\n for(int i = 2; i <=rn; ++i){\n int _2i1 = (i-1)<<1;\n if(n%_2i1==0)tmp+=n/_2i1;\n else tmp+=n/_2i1+1;\n }\n tmp <<= 1;\n tmp -= rn*rn;\n ans = (n+tmp)<<3;\n printf(\"%lld\\n\",ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 888,
"score_of_the_acc": -1.0917,
"final_rank": 19
}
] |
aoj_1030_cpp
|
Problem B:
Cubes Without Holes
There is a cube which consists of
n
×
n
×
n
small cubes. Small cubes have marks on their surfaces. An example where
n
= 4 is shown in the following figure.
Then,
次に、上図（右）に示すように、印のついた表面から、反対の面まで水平または垂直に貫通する穴をあける。
あなたの仕事は、
n
と 印の位置を読み込み、穴の空いていない小さい立方体の個数を数えるプログラムを作成することである。
Input
入力はいくつかのデータセットからなる。各データセットは以下の形式で与えられる：
n h
c
1
a
1
b
1
c
2
a
2
b
2
.
.
.
c
h
a
h
b
h
h
は印の数を示す整数である。これに続く
h
行によって
h
個の印の位置が入力される。印の位置を指定するために下図に示す座標軸を用いることにする。(
x
,
y
,
z
) = (1, 1, 1) が左下奥の立方体、(
x
,
y
,
z
) = (
n
,
n
,
n
) が右上手前の立方体を示す。
c
i
は
i
番目の印がつけられている平面を示す文字列である。
c
i
は "
xy
" 、"
xz
"、 "
yz
" のいづれかであり、それぞれ
i
番目の印が
xy
平面、
xz
平面、
yz
平面上にあることを示す。
a
i
,
b
i
は
c
i
で示された平面上の座標を示す。
xy
平面、
xz
平面、
yz
平面のとき、
a
i
,
b
i
はそれぞれ平面の座標 (
x
,
y
)、(
x
,
z
)、(
y
,
z
) を示す。例えば、上図において、印 A, B, C の
c
i
,
a
i
,
b
i
の値はそれぞれ、"
xy 4 4
", "
xz 1 2
", "
yz 2 3
" となる。
n
,
h
がともに 0 のとき、入力の終わりを示す。
n
≤ 500,
h
≤ 200 と仮定してよい。
Output
各データセットに対して、穴の空いていない立方体の数を１行に出力せよ。
Sample Input
4 3
xy 4 4
xz 1 2
yz 2 3
4 5
xy 1 1
xy 3 3
xz 3 3
yz 2 1
yz 3 3
0 0
Output for the Sample Input
52
46
|
[
{
"submission_id": "aoj_1030_10852651",
"code_snippet": "#include<set>\n#include<cstdio>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n,m;\nset<int> s;\nint Hash(int x,int y,int z)\n{\n return x*n*n+y*n+z;\n}\nint main()\n{\n while(scanf(\"%d%d\",&n,&m)!=EOF&&n)\n {\n s.clear();\n for(int i=0;i<m;i++)\n {\n getchar();\n char st[10];\n int pos1,pos2;\n scanf(\"%s%d%d\",st,&pos1,&pos2);\n if(st[0]=='x')\n {\n if(st[1]=='y')\n {\n for(int i=1;i<=n;i++)\n s.insert(Hash(pos1,pos2,i));\n }\n else if(st[1]=='z')\n {\n for(int i=1;i<=n;i++)\n s.insert(Hash(pos1,i,pos2));\n }\n }\n else\n {\n for(int i=1;i<=n;i++)\n s.insert(Hash(i,pos1,pos2));\n }\n }\n printf(\"%d\\n\",n*n*n-s.size());\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 5796,
"score_of_the_acc": -0.0455,
"final_rank": 3
},
{
"submission_id": "aoj_1030_9166348",
"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// struct Edge {\n// int from, to;\n// int 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\nsigned main() {\n int N, M;\n while (cin >> N >> M, N) {\n vector<tuple<string, int, int>> T(M);\n for (int i = 0; i < M; i++) {\n string a;\n int b, c;\n cin >> a >> b >> c;\n T[i] = make_tuple(a, b, c);\n }\n\n int ans = N*N*N - N*M;\n for (int i = 0; i < M; i++) {\n string s = get<0>(T[i]);\n int a = get<1>(T[i]);\n int b = get<2>(T[i]);\n for (int j = i + 1; j < M; j++) {\n string t = get<0>(T[j]);\n int a2 = get<1>(T[j]);\n int b2 = get<2>(T[j]);\n\n if (s == \"xy\" && t == \"yz\" && b == a2) ans++;\n if (s == \"xy\" && t == \"xz\" && a == a2) ans++;\n\n if (s == \"yz\" && t == \"xy\" && a == b2) ans++;\n if (s == \"yz\" && t == \"xz\" && b == b2) ans++;\n\n if (s == \"xz\" && t == \"xy\" && a == a2) ans++;\n if (s == \"xz\" && t == \"yz\" && b == b2) ans++;\n }\n }\n\n for (int i = 0; i < M; i++) {\n string s = get<0>(T[i]);\n int a = get<1>(T[i]);\n int b = get<2>(T[i]);\n\n for (int j = i + 1; j < M; j++) {\n string t = get<0>(T[j]);\n int a2 = get<1>(T[j]);\n int b2 = get<2>(T[j]);\n\n for (int k = j + 1; k < M; k++) {\n string u = get<0>(T[k]);\n int a3 = get<1>(T[k]);\n int b3 = get<2>(T[k]);\n\n if (s == \"xy\" && t == \"yz\" && u == \"xz\" && b == a2 && a == a3 && b2 == b3) ans--;\n if (s == \"xy\" && t == \"xz\" && u == \"yz\" && a == a2 && b == a3 && b2 == b3) ans--;\n\n if (s == \"yz\" && t == \"xy\" && u == \"xz\" && a == b2 && b == b3 && a2 == a3) ans--;\n if (s == \"yz\" && t == \"xz\" && u == \"xy\" && b == b2 && a == b3 && a2 == a3) ans--;\n\n if (s == \"xz\" && t == \"xy\" && u == \"yz\" && a == a2 && b == b3 && b2 == a3) ans--;\n if (s == \"xz\" && t == \"yz\" && u == \"xy\" && b == b2 && a == a3 && a2 == b3) ans--;\n }\n }\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3188,
"score_of_the_acc": -0.0482,
"final_rank": 4
},
{
"submission_id": "aoj_1030_4624432",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define FOR(i,x,n) for(int i=x; i<(n); i++)\n#define ALL(n) begin(n),end(n)\n#define MOD (1000000007)\n#define INF (1e9)\n#define INFL (1e18)\n\ntypedef long long ll;\ntypedef unsigned int ui;\ntypedef unsigned long long ull;\ntemplate<class T>using arr=vector<vector<T>>;\ntemplate<class T>void pr(T x){cout << x << endl;}\ntemplate<class T>void prvec(vector<T>& a){rep(i, a.size()-1){cout << a[i] << \" \";} cout << a[a.size()-1] << endl;}\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\n\nbool cub[500][500][500];\nvoid solve(int n, int h){\n rep(i, n) rep(j, n) rep(k, n) cub[i][j][k] = true;\n\n string c;\n int a, b;\n rep(i, h){\n cin >> c >> a >> b;\n a--; b--;\n if(c == \"xy\") {\n rep(i, n) cub[a][b][i] = false;\n }else if(c == \"xz\"){\n rep(i, n) cub[a][i][b] = false;\n }else{\n rep(i, n) cub[i][a][b] = false;\n }\n }\n\n int ans = 0;\n rep(i, n) rep(j, n) rep(k, n) ans += cub[i][j][k];\n pr(ans);\n return;\n}\n\nint main()\n{\n int n, h;\n while(cin >> n >> h){\n if(n==0 && h==0) break;\n solve(n, h);\n }\n return 0;}",
"accuracy": 1,
"time_ms": 840,
"memory_kb": 125088,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_1030_3331174",
"code_snippet": "#include<iostream>\n#include<set>\n#include<tuple>\nusing namespace std;\n\nint main(){\n int n, h;\n while(cin >> n >> h, n+h){\n set<tuple<int,int,int>> s;\n string axis;\n int a, b;\n while(h-- > 0){\n cin >> axis >> a >> b;\n for(int i = 1; i <= n; i++){\n if(axis == \"xy\"){\n s.insert(make_tuple(a,b,i));\n }else if(axis == \"xz\"){\n s.insert(make_tuple(a,i,b));\n }else if(axis == \"yz\"){\n s.insert(make_tuple(i,a,b));\n }\n }\n }\n cout << n*n*n - s.size() << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 6260,
"score_of_the_acc": -0.0613,
"final_rank": 13
},
{
"submission_id": "aoj_1030_3331172",
"code_snippet": "#include<iostream>\n#include<set>\nusing namespace std;\n\nint main(){\n int n, h;\n while(cin >> n >> h, n+h){\n set<pair<int,pair<int,int>>> s;\n string axis;\n int a, b;\n while(h-- > 0){\n cin >> axis >> a >> b;\n if(axis == \"xy\"){\n for(int i = 1; i <= n; i++) s.insert({a,{b,i}});\n }else if(axis == \"xz\"){\n for(int i = 1; i <= n; i++) s.insert({a,{i,b}});\n }else if(axis == \"yz\"){\n for(int i = 1; i <= n; i++) s.insert({i,{a,b}});\n }\n }\n cout << n*n*n - s.size() << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 6268,
"score_of_the_acc": -0.0494,
"final_rank": 5
},
{
"submission_id": "aoj_1030_2698653",
"code_snippet": "#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\ntypedef pair<pair<int,int>,int>P;\nint main(){\n\tint n,m;\n\twhile(cin>>n>>m,n){\n\t\tset<P>s;\n\t\tr(j,m){\n\t\t\tstring S;\n\t\t\tint x,y;\n\t\t\tcin>>S>>x>>y;\n\t\t\tx--;y--;\n\t\t\tif(S==\"xy\")r(i,n)s.insert(P(make_pair(x,y),i));\n\t\t\tif(S==\"xz\")r(i,n)s.insert(P(make_pair(x,i),y));\n\t\t\tif(S==\"yz\")r(i,n)s.insert(P(make_pair(i,x),y));\n\t\t}\n\t\tcout<<n*n*n-s.size()<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 6220,
"score_of_the_acc": -0.061,
"final_rank": 12
},
{
"submission_id": "aoj_1030_2190107",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n#ifdef _DEBUG\n#include \"dump.hpp\"\n#else\n#define dump(...)\n#endif\n\n#define int long long\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(c) begin(c),end(c)\nconst int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;\nconst int MOD = (int)(1e9) + 7;\ntemplate<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }\n\nint key(int a, int b, int c) {\n\treturn a * 500 * 500 + b * 500 + c;\n}\n\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tfor (int n, h; cin >> n >> h&&n;) {\n\t\tunordered_set<int> st;\n\t\trep(i, 0, h) {\n\t\t\tstring c;\n\t\t\tint a, b;\n\t\t\tcin >> c >> a >> b; a--, b--;\n\t\t\tif (c == \"xy\") {\n\t\t\t\trep(j, 0, n)st.insert(key(a, b, j));\n\t\t\t}\n\t\t\telse if (c == \"xz\") {\n\t\t\t\trep(j, 0, n)st.insert(key(a, j, b));\n\t\t\t}\n\t\t\telse {\n\t\t\t\trep(j, 0, n)st.insert(key(j, a, b));\n\t\t\t}\n\t\t}\n\t\tcout << n*n*n - st.size() << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 4996,
"score_of_the_acc": -0.0389,
"final_rank": 2
},
{
"submission_id": "aoj_1030_2183773",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n#include <cstdlib>\n#include <cmath>\n#include <iterator>\n#include <cctype>\n#include <sstream>\n#include <string>\n#include <vector>\n#include <set>\n#include <map>\n#include <stack>\n#include <deque>\n#include <queue>\n#include <list>\n#include <functional>\n#include <ctime>\n\n#pragma comment(linker, \"/STACK:102400000, 102400000\")\n#define debug puts(\"++++++++++++++++++++++++++++++++++++++++++++++++++++++++\")\n#define Min(a, b) ( (a < b) ? a : b )\n#define Max(a, b) ( (a > b) ? a : b )\n#define lc o<<1\n#define rc o<<1|1\n#define mem0(x) memset(x, 0, sizeof x)\n#define mem1(x) memset(x, -1, sizeof x)\n#define MAXS 10000 + 8\n#define MAXT 10000 + 8\n#define MAXL 500000 + 8\n#define INF ~0u>>2\n#define EPS 1e-20\n#define PI acos(-1.0)\n\nusing namespace std;\ntypedef long long LL;\ntypedef unsigned long long uLL;\nconst int MOD = 1e9 + 7;\nconst int maxn = 100000 + 8;\n\nset<int> s;\nint n , n1, h, a, b;\nchar c1, c2;\n\nint ha(int x, int y, int z) {\n return x * n * n + y * n + z;\n}\n\nint main() {\n while ( ~scanf(\"%d%d\", &n, &h ) && n + h ) {\n s.clear();\n n1 = n * n * n;\n for (int i = 0; i < h; i++) {\n getchar();\n scanf(\"%c%c\", &c1, &c2); getchar();\n scanf(\"%d%d\", &a, &b);\n if (c1 == 'x' && c2 == 'y') for (int i = 1; i <= n; i++) s.insert( ha(a, b, i) );\n else if ( c1 == 'x' && c2 == 'z' ) for (int i = 1; i <= n; i++) s.insert( ha(a, i, b) );\n else if ( c1 == 'y' && c2 == 'z' ) for (int i = 1; i <= n; i++) s.insert( ha(i, a, b) );\n }\n printf(\"%d\\n\", n1 - s.size() );\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 5504,
"score_of_the_acc": -0.0551,
"final_rank": 8
},
{
"submission_id": "aoj_1030_2152293",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n\nint main() {\n\twhile (1) {\n\t\tint N, H; cin >> N >> H;\n\t\tif (!N&&!H)break;\n\t\tset<tuple<int, int, int>>aset;\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tstring st; int a, b; cin >> st >> a >> b; a--; b--;\n\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\tif (st==\"xy\") {\n\t\t\t\t\taset.insert(make_tuple(a, b, j));\n\t\t\t\t}\n\t\t\t\telse if (st==\"xz\") {\n\t\t\t\t\taset.insert(make_tuple(a,j,b));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\taset.insert(make_tuple(j,a,b));\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tint ans =N*N*N- aset.size();\n\t\tcout <<ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 6212,
"score_of_the_acc": -0.061,
"final_rank": 11
},
{
"submission_id": "aoj_1030_1898187",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n, h;\n while(cin >> n >> h && (n || h)){\n int ans = n * n * n;\n set<pair<int, pair<int, int> > > ps;\n for(int i = 0; i < h; i++){\n string str;\n int p[2];\n cin >> str >> p[0] >> p[1];\n for(int j = 1; j <= n; j++){\n if(str == \"xy\"){\n ps.insert(make_pair(p[0], make_pair(p[1], j)));\n }\n if(str == \"xz\"){\n ps.insert(make_pair(p[0], make_pair(j, p[1])));\n }\n if(str == \"yz\"){\n ps.insert(make_pair(j, make_pair(p[0], p[1])));\n }\n }\n }\n ans -= ps.size(); \n cout << ans << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 4348,
"score_of_the_acc": -0.0698,
"final_rank": 17
},
{
"submission_id": "aoj_1030_1866526",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX 500\ntypedef pair<int,int> P;\ntypedef pair<int,P> Q;\n \nint main(){\n int N,H,a,b;\n string str;\n \n while(cin >> N >> H, (N | H)){\n\tset<Q> st;\n\tfor(int i = 0 ; i < H ; i++){\n\t cin >> str >> a >> b; a--, b--;\n\t if(str == \"xy\"){\n\t\tfor(int j = 0 ; j < N ; j++){\n\t\t st.insert(Q(a,P(b,j)));\n\t\t}\n\t }else if(str == \"yz\"){\n\t\tfor(int j = 0 ; j < N ; j++){\n\t\t st.insert(Q(j,P(a,b)));\n\t\t}\n\t }else{\n\t\tfor(int j = 0 ; j < N ; j++){\n\t\t st.insert(Q(a,P(j,b)));\n\t\t}\n\t }\n\t}\n\tcout << N*N*N-st.size() << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 6284,
"score_of_the_acc": -0.0615,
"final_rank": 14
},
{
"submission_id": "aoj_1030_1843507",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint n, q, a, b; string s;\nint main() {\n\twhile (cin >> n >> q, n | q) {\n\t\tset<int> d;\n\t\tfor (int i = 0; i < q; i++) {\n\t\t\tcin >> s >> a >> b;\n\t\t\tfor (int j = 1; j <= n; j++) {\n\t\t\t\tif (s == \"xy\") d.insert(a * n * n + b * n + j);\n\t\t\t\tif (s == \"xz\") d.insert(a * n * n + j * n + b);\n\t\t\t\tif (s == \"yz\") d.insert(j * n * n + a * n + b);\n\t\t\t}\n\t\t}\n\t\tcout << n * n * n - d.size() << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 5476,
"score_of_the_acc": -0.0549,
"final_rank": 7
},
{
"submission_id": "aoj_1030_1843496",
"code_snippet": "#include <set>\n#include <tuple>\n#include <string>\n#include <iostream>\nusing namespace std;\nint n, q, a, b; string s;\nint main() {\n\twhile (cin >> n >> q, n | q) {\n\t\tset<tuple<int, int, int> > d;\n\t\tfor (int i = 0; i < q; i++) {\n\t\t\tcin >> s >> a >> b;\n\t\t\tfor (int j = 1; j <= n; j++) {\n\t\t\t\tif (s == \"xy\") d.insert(make_tuple(a, b, j));\n\t\t\t\tif (s == \"xz\") d.insert(make_tuple(a, j, b));\n\t\t\t\tif (s == \"yz\") d.insert(make_tuple(j, a, b));\n\t\t\t}\n\t\t}\n\t\tcout << n * n * n - d.size() << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 6264,
"score_of_the_acc": -0.0734,
"final_rank": 18
},
{
"submission_id": "aoj_1030_1843490",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\nusing namespace std;\nint xy[600][600], xz[600][600], yz[600][600];\nint X[600], Y[600];\nint n, q, a, b; string S;\nint main() {\n\twhile (true) {\n\t\tfor (int i = 0; i < 600; i++) {\n\t\t\tX[i] = 0; Y[i] = 0;\n\t\t\tfor (int j = 0; j < 600; j++) {\n\t\t\t\txy[i][j] = 0; xz[i][j] = 0; yz[i][j] = 0;\n\t\t\t}\n\t\t}\n\t\tcin >> n >> q; if (n == 0 && q == 0)break;\n\t\tfor (int i = 0; i < q; i++) {\n\t\t\tcin >> S >> a >> b; a--; b--;\n\t\t\tif (S == \"xy\") { xy[a][b] = 1; }\n\t\t\tif (S == \"xz\") { xz[a][b] = 1; }\n\t\t\tif (S == \"yz\") { yz[a][b] = 1; }\n\t\t}\n\t\tint cnt = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tX[i] += xy[i][j]; Y[j] += xy[i][j]; cnt += xy[i][j];\n\t\t\t}\n\t\t}\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tvector<int>XZ, YZ;\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (xz[j][i] == 1) {\n\t\t\t\t\tXZ.push_back(j); sum += n - X[j];\n\t\t\t\t}\n\t\t\t\tif (yz[j][i] == 1) {\n\t\t\t\t\tYZ.push_back(j); sum += n - Y[j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tsum += cnt;\n\t\t\tfor (int j = 0; j < XZ.size(); j++) {\n\t\t\t\tfor (int k = 0; k < YZ.size(); k++) {\n\t\t\t\t\tsum -= (1 - xy[XZ[j]][YZ[k]]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << n*n*n - sum << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 5452,
"score_of_the_acc": -0.0547,
"final_rank": 6
},
{
"submission_id": "aoj_1030_1831274",
"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#include<sstream>\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)\nconst double PI=acos(-1);\nconst double EPS=1e-8;\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\tint n,h;\n\twhile(cin>>n>>h,n+h){\n\t\tset<pair<int,pii> >in;\n\t\twhile(h--){\n\t\t\tstring s;int a,b;\n\t\t\tcin>>s>>a>>b;a--;b--;\n\t\t\trep(i,n){\n\t\t\t\tif(s==\"xy\")in.insert(pair<int,pii>(a,pii(b,i)));\n\t\t\t\telse if(s==\"xz\")in.insert(pair<int,pii>(a,pii(i,b)));\n\t\t\t\telse if(s==\"yz\")in.insert(pair<int,pii>(i,pii(a,b)));\n\t\t\t}\n\t\t}\n\t\tcout<<n*n*n-in.size()<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 4332,
"score_of_the_acc": -0.0696,
"final_rank": 15
},
{
"submission_id": "aoj_1030_1798406",
"code_snippet": "#include <string>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nint n, q, x, y, a[20000000]; string c;\nint main() {\n\twhile(cin >> n >> q, n + q) {\n\t\tfill(a, a + n * n * n / 32 + 1, 0);\n\t\tfor(int i = 0; i < q; i++) {\n\t\t\tcin >> c >> x >> y; x--, y--;\n\t\t\tif(c == \"xy\") {\n\t\t\t\tfor(int j = 0; j < n; j++) {\n\t\t\t\t\tint w = x * n * n + y * n + j;\n\t\t\t\t\ta[w >> 5] |= (1 << (w & 31));\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(c == \"xz\") {\n\t\t\t\tfor(int j = 0; j < n; j++) {\n\t\t\t\t\tint w = x * n * n + j * n + y;\n\t\t\t\t\ta[w >> 5] |= (1 << (w & 31));\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(c == \"yz\") {\n\t\t\t\tfor(int j = 0; j < n; j++) {\n\t\t\t\t\tint w = j * n * n + x * n + y;\n\t\t\t\t\ta[w >> 5] |= (1 << (w & 31));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ret = 0;\n\t\tfor(int i = 0; i <= n * n * n / 32; i++) ret += __builtin_popcount(a[i]);\n\t\tcout << n * n * n - ret << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 18252,
"score_of_the_acc": -0.2682,
"final_rank": 19
},
{
"submission_id": "aoj_1030_1575454",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <cstring>\n#include <algorithm>\n#include <sstream>\n#include <map>\n#include <set>\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#define INF 1<<30\n#define pb push_back\n#define mp make_pair\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nint main() {\n\tint n, h;\n\twhile(cin >> n >> h) {\n\t\tif(n == 0 && h == 0) break;\n\n\t\tset<pair<pair<int,int>, int> > st;\n\t\trep(i, h) {\n\t\t\tstring s;\n\t\t\tint a, b;\n\t\t\tcin >> s >> a >> b;\n\n\t\t\tif(s == \"xy\") {\n\t\t\t\trep(i,n) {\n\t\t\t\t\tst.insert(mp(mp(a,b),i+1));\n\t\t\t\t}\n\t\t\t} else if(s == \"xz\") {\n\t\t\t\trep(i,n) {\n\t\t\t\t\tst.insert(mp(mp(a,i+1),b));\n\t\t\t\t}\n\t\t\t} else if(s == \"yz\") {\n\t\t\t\trep(i,n) {\n\t\t\t\t\tst.insert(mp(mp(i+1,a),b));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcout << n * n * n - st.size() << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 4332,
"score_of_the_acc": -0.0576,
"final_rank": 9
},
{
"submission_id": "aoj_1030_1545226",
"code_snippet": "#include<iostream>\nusing namespace std;\nint main(){\n while(1){ \n int n,h,an;\n cin>>n>>h;\n if(n==0)break;\n an=n*n*n-n*h;\n int xy[501][501]={},yz[501][501]={},xz[501][501]={}; \n \n for(int i=0;i<h;i++){\n int a,b;\n string c;\n cin>>c>>a>>b;\n if(c==\"xy\"){\n\tfor(int j=1;j<=n;j++){\n\t if(yz[b][j]==1)an++;\n\t else if(xz[a][j]==1)an++;\n\t}\n\txy[a][b]=1;\n }\n \n if(c==\"yz\"){\n\tfor(int j=1;j<=n;j++){\n\t if(xy[j][a]==1)an++;\n\t else if(xz[j][b]==1)an++;\n\t}\n\tyz[a][b]=1;\n } \n \n if(c==\"xz\"){\n\tfor(int j=1;j<=n;j++){\n\t if(xy[a][j]==1)an++;\n\t else if(yz[j][b]==1)an++;\n\t}\t\n\txz[a][b]=1;\n }\n \n }\n cout<<an<<endl;\n \n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4160,
"score_of_the_acc": -0.008,
"final_rank": 1
},
{
"submission_id": "aoj_1030_1262243",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <list>\n#include <set>\n#include <map>\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 INT(a) int((a)+1e-9)\n#define mp make_pair\n\ntypedef pair<int,pair<int,int> > P;\n\nint main(){\n\twhile(true){\n\t\tint N,ql;\n\t\tcin >> N >> ql;\t\t\tif(!N) return 0;\n\t\tset<P> ps;\n\t\tREP(qi,ql){\n\t\t\tstring c; int a,b;\n\t\t\tcin>>c>>a>>b; a--;b--;\n\t\t\tif(c==\"xy\") REP(z,N) ps.insert(mp(a,mp(b,z)));\n\t\t\tif(c==\"xz\") REP(y,N) ps.insert(mp(a,mp(y,b)));\n\t\t\tif(c==\"yz\") REP(x,N) ps.insert(mp(x,mp(a,b)));\n\t\t}\n\t\tcout<< N*N*N - ps.size() <<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 4332,
"score_of_the_acc": -0.0576,
"final_rank": 9
},
{
"submission_id": "aoj_1030_1226917",
"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;\n\nint main() {\n int N, H;\n while(cin >>N >>H && N){\n set<PP> S;\n REP(h, H){\n string s; int a, b; cin >>s >>a >>b;\n FOR(i, 1, N + 1){\n if(s == \"xy\") S.insert(PP(a, P(b, i)));\n if(s == \"xz\") S.insert(PP(a, P(i, b)));\n if(s == \"yz\") S.insert(PP(i, P(a, b)));\n }\n }\n cout <<N * N * N - S.size() <<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 4336,
"score_of_the_acc": -0.0697,
"final_rank": 16
}
] |
aoj_1033_cpp
|
Problem E:
Kuru-Kuru Robot
ロボット工学の研究者であるアシモフ博士は、新しいロボットの開発に成功した。このロボットは、床に張り巡らせた特殊なワイヤーに沿って自由に動くことができる。ロボットは常に現在いるワイヤーに平行な方向を向いて前進する。
すばらしいことに、このロボットはワイヤー上を移動するためにその距離にかかわらずエネルギーを消費しない。しかし、ワイヤーの端点やワイヤーの交点で向きを変えるためにはその点を中心に回転する必要があり、その回転角度だけエネルギーを消費する。
このロボットをスタート地点からゴール地点まで動かしたい。例えば、下図においてロボットを start に東向き（下図
x
軸の正の向き）で配置し goal まで動かしてみよう。start から交点 A 交点 B を経由して goal にたどり着く経路と、交点 A 交点 C を経由する経路があるが、前者の方が移動距離が長いものの回転角度が少ないためエネルギー消費量は少ない。
あなたの仕事は、床にあるワイヤーの位置、スタート地点、ゴール地点を読み込み、スタート地点からゴール地点へ移動するために必要な回転角度の合計の最小値を報告するプログラムを作成することである。
ロボットはスタート地点においてどのような向きに配置してもよく、ゴール地点ではどの方向を向いていてもよい。
Input
入力は複数のデータセットからなる。各データセットの形式は以下のとおり：
n
x
1
1
y
1
1
x
2
1
y
2
1
x
1
2
y
1
2
x
2
2
y
2
2
.
.
.
x
1
n
y
1
n
x
2
n
y
2
n
sx
sy
gx
gy
n
はワイヤーの数を示す整数である。
x
1
i
y
1
i
は
i
番目のワイヤーの一方の端点の座標、
x
2
i
y
2
i
は
i
番目のワイヤーのもう一方の端点の座標を示す。
sx
sy
、
gx
gy
はそれぞれスタート地点とゴール地点の座標を示す。
与えられる座標はすべて整数値であり、
x
軸
y
軸の値は -1000 以上 1000 以下である。また、スタート地点とゴール地点は与えられるワイヤーの端点上にあると仮定してよい。
n
≤ 50 であると仮定してよい。
n
が 0 のとき入力の終了を示す。
Output
各データセットに対して、回転角度の合計の最小値を１行に出力せよ。ロボットがゴール地点にたどり着けない場合は "-1" と出力せよ。出力は 0.00001 以下の誤差を含んでもよい。
Sample Input
8
1 3 11 3
5 3 13 11
10 10 17 10
11 2 11 6
10 5 14 5
13 6 13 2
17 10 17 3
13 3 19 3
1 3 19 3
6
1 3 11 3
5 3 13 11
10 10 17 10
11 2 11 6
10 5 14 5
13 3 19 3
1 3 19 3
2
0 0 7 0
3 0 7 3
0 0 7 3
0
Output for the Sample Input
270.0000
-1
36.86989765
|
[
{
"submission_id": "aoj_1033_2737394",
"code_snippet": "#include<bits/stdc++.h>\n#define f first\n#define s second\n#define mp make_pair\n#define pi M_PI\n#define inf 1e14\n#define eps (1e-8)\n#define MAX 1000\n#define equals(a,b) (fabs((a)-(b))<eps)\nusing namespace std;\n \nclass Point{\npublic:\n double x,y;\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 k){ return Point(x*k,y*k);}\n Point operator/(double k){ return Point(x/k,y/k);}\n bool operator<(Point p)const{ return (x!=p.x ? x<p.x : y<p.y);}\n bool operator==(Point p)const{ return 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 \nclass Segment{\npublic:\n Point p1,p2;\n Segment(Point p1=Point(),Point p2=Point()):p1(p1),p2(p2){}\n};\ntypedef Segment Line;\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 \nbool isParallel(Segment s,Segment t){\n return equals(cross(s.p1-s.p2,t.p1-t.p2),0.0);\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 &&\n 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 \nPoint getCrossPointLL(Line a,Line b){\n double A=cross(a.p2-a.p1,b.p2-b.p1);\n double B=cross(a.p2-a.p1,a.p2-b.p1);\n if(abs(A)<eps || abs(B)<eps)return b.p1;\n return b.p1+(b.p2-b.p1)*(B/A);\n}\n \nbool merge_if_able(Segment &s,Segment t) {\n if(!isParallel(s,t))return false;\n if(ccw(s.p1,t.p1,s.p2)==1 ||\n ccw(s.p1,t.p1,s.p2)==-1)return false;\n if(ccw(s.p1,s.p2,t.p1)==-2 ||\n ccw(t.p1,t.p2,s.p1)==-2)return false;\n s=Segment(min(s.p1,t.p1),max(s.p2,t.p2));\n return true;\n}\n \nvoid merge(vector<Segment>& v) {\n for(int i=0;i<v.size();i++){\n if(v[i].p2<v[i].p1)swap(v[i].p2,v[i].p1);\n }\n for(int i=0;i<v.size();i++)\n for(int j=i+1;j<v.size();j++)\n if(merge_if_able(v[i],v[j]))\n v[j--]=v.back(),v.pop_back();\n}\n \ntypedef vector<vector<int> > Graph;\nGraph SegmentArrangement(vector<Segment> v,vector<Point> &ps){\n for(int i=0;i<v.size();i++){\n ps.push_back(v[i].p1);\n ps.push_back(v[i].p2);\n for(int j=i+1;j<v.size();j++){\n if(intersect(v[i],v[j]))ps.push_back(getCrossPointLL(v[i],v[j]));\n }\n }\n sort(ps.begin(),ps.end());\n ps.erase(unique(ps.begin(),ps.end()),ps.end());\n Graph g(ps.size());\n for(int i=0;i<v.size();i++){\n vector<pair<double,int> > list;\n for(int j=0;j<ps.size();j++)\n if(ccw(v[i].p1,v[i].p2,ps[j])==0)\n list.push_back(mp(norm(v[i].p1-ps[j]),j));\n sort(list.begin(),list.end());\n for(int j=0;j<list.size()-1;j++){\n int a=list[j].s,b=list[j+1].s;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n }\n return g;\n}\nclass State{\n public:\n int n,b;\n double cost;\n State(int n,int b,double cost):n(n),b(b),cost(cost){}\n bool operator<(State s)const{\n return s.cost-cost<-eps;\n }\n};\nGraph e;\nvector<Point> vp;\nPoint a,b;\ndouble getAngle(Vector v1,Vector v2){\n double r=dot(v1,v2)/(abs(v1)*abs(v2));\n if(r<-1.0)r=-1.0;\n if(1.0<r)r=1.0;\n return (acos(r)*180.0/pi);\n}\ndouble dijkstra(){\n int s=0,g=0;\n double d[MAX][MAX];\n priority_queue<State> pq;\n for(int i=0;i<vp.size();i++){\n if(vp[i]==a)s=i;\n if(vp[i]==b)g=i;\n }\n for(int i=0;i<MAX;i++)for(int j=0;j<MAX;j++)d[i][j]=inf;\n for(int i=0;i<e[s].size();i++){\n d[e[s][i]][s]=0;\n pq.push(State(e[s][i],s,0));\n }\n while(pq.size()){\n State u=pq.top();\n pq.pop();\n if(u.n==g)return u.cost;\n if(d[u.n][u.b]-u.cost<-eps)continue;\n for(int i=0;i<e[u.n].size();i++){\n int next=e[u.n][i];\n if(next==u.b)continue;\n double cost=getAngle(vp[u.n]-vp[u.b],vp[next]-vp[u.n]);\n if(u.cost+cost-d[next][u.n]<-eps){\n d[next][u.n]=u.cost+cost;\n pq.push(State(next,u.n,d[next][u.n]));\n }\n }\n }\n return -1;\n}\nint main()\n{\n int n;\n \n while(1){\n cin>>n;\n if(n==0)break;\n vector<Segment> vs;\n for(int i=0;i<n;i++){\n int x1,y1,x2,y2;\n cin>>x1>>y1>>x2>>y2;\n vs.push_back(Segment(Point(x1,y1),Point(x2,y2)));\n }\n cin>>a.x>>a.y>>b.x>>b.y;\n vp.clear();\n vp.push_back(a);\n vp.push_back(b);\n merge(vs);\n e=SegmentArrangement(vs,vp);\n double ans=dijkstra();\n if(ans==-1)cout<<-1<<endl;\n else printf(\"%.10f\\n\",dijkstra());\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 11172,
"score_of_the_acc": -1.1538,
"final_rank": 13
},
{
"submission_id": "aoj_1033_2012526",
"code_snippet": "#include<bits/stdc++.h>\n#define f first\n#define s second\n#define mp make_pair\n#define pi M_PI\n#define inf 1e14\n#define eps (1e-8)\n#define MAX 1000\n#define equals(a,b) (fabs((a)-(b))<eps)\nusing namespace std;\n\nclass Point{\npublic:\n double x,y;\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 k){ return Point(x*k,y*k);}\n Point operator/(double k){ return Point(x/k,y/k);}\n bool operator<(Point p)const{ return (x!=p.x ? x<p.x : y<p.y);}\n bool operator==(Point p)const{ return 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\nclass Segment{\npublic:\n Point p1,p2;\n Segment(Point p1=Point(),Point p2=Point()):p1(p1),p2(p2){}\n};\ntypedef Segment Line;\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\nbool isParallel(Segment s,Segment t){\n return equals(cross(s.p1-s.p2,t.p1-t.p2),0.0);\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 &&\n 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\nPoint getCrossPointLL(Line a,Line b){\n double A=cross(a.p2-a.p1,b.p2-b.p1);\n double B=cross(a.p2-a.p1,a.p2-b.p1);\n if(abs(A)<eps || abs(B)<eps)return b.p1;\n return b.p1+(b.p2-b.p1)*(B/A);\n}\n\nbool merge_if_able(Segment &s,Segment t) {\n if(!isParallel(s,t))return false;\n if(ccw(s.p1,t.p1,s.p2)==1 ||\n ccw(s.p1,t.p1,s.p2)==-1)return false;\n if(ccw(s.p1,s.p2,t.p1)==-2 ||\n ccw(t.p1,t.p2,s.p1)==-2)return false;\n s=Segment(min(s.p1,t.p1),max(s.p2,t.p2));\n return true;\n}\n\nvoid merge(vector<Segment>& v) {\n for(int i=0;i<v.size();i++){\n if(v[i].p2<v[i].p1)swap(v[i].p2,v[i].p1);\n }\n for(int i=0;i<v.size();i++)\n for(int j=i+1;j<v.size();j++)\n if(merge_if_able(v[i],v[j]))\n v[j--]=v.back(),v.pop_back();\n}\n\ntypedef vector<vector<int> > Graph;\n\nGraph SegmentArrangement(vector<Segment> v,vector<Point> &ps){\n for(int i=0;i<v.size();i++){\n ps.push_back(v[i].p1);\n ps.push_back(v[i].p2);\n for(int j=i+1;j<v.size();j++){\n if(intersect(v[i],v[j]))ps.push_back(getCrossPointLL(v[i],v[j]));\n }\n }\n sort(ps.begin(),ps.end());\n ps.erase(unique(ps.begin(),ps.end()),ps.end());\n Graph g(ps.size());\n for(int i=0;i<v.size();i++){\n vector<pair<double,int> > list;\n for(int j=0;j<ps.size();j++)\n if(ccw(v[i].p1,v[i].p2,ps[j])==0)\n list.push_back(mp(norm(v[i].p1-ps[j]),j));\n sort(list.begin(),list.end());\n for(int j=0;j<list.size()-1;j++){\n int a=list[j].s,b=list[j+1].s;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n }\n return g;\n}\n\nclass State{\n public:\n int n,b;\n double cost;\n State(int n,int b,double cost):n(n),b(b),cost(cost){}\n bool operator<(State s)const{\n return s.cost-cost<-eps;\n }\n};\n\nGraph e;\nvector<Point> vp;\nPoint a,b;\n\ndouble getAngle(Vector v1,Vector v2){\n double r=dot(v1,v2)/(abs(v1)*abs(v2));\n if(r<-1.0)r=-1.0;\n if(1.0<r)r=1.0;\n return (acos(r)*180.0/pi);\n}\n\ndouble dijkstra(){\n int s=0,g=0;\n double d[MAX][MAX];\n priority_queue<State> pq;\n for(int i=0;i<vp.size();i++){\n if(vp[i]==a)s=i;\n if(vp[i]==b)g=i;\n }\n for(int i=0;i<MAX;i++)for(int j=0;j<MAX;j++)d[i][j]=inf;\n for(int i=0;i<e[s].size();i++){\n d[e[s][i]][s]=0;\n pq.push(State(e[s][i],s,0));\n }\n\n while(pq.size()){\n State u=pq.top();\n pq.pop();\n\n if(u.n==g)return u.cost;\n if(d[u.n][u.b]-u.cost<-eps)continue;\n\n for(int i=0;i<e[u.n].size();i++){\n int next=e[u.n][i];\n if(next==u.b)continue;\n double cost=getAngle(vp[u.n]-vp[u.b],vp[next]-vp[u.n]);\n if(u.cost+cost-d[next][u.n]<-eps){\n d[next][u.n]=u.cost+cost;\n pq.push(State(next,u.n,d[next][u.n]));\n }\n }\n }\n return -1;\n}\n\nint main()\n{\n int n;\n\n while(1){\n cin>>n;\n if(n==0)break;\n vector<Segment> vs;\n for(int i=0;i<n;i++){\n int x1,y1,x2,y2;\n cin>>x1>>y1>>x2>>y2;\n vs.push_back(Segment(Point(x1,y1),Point(x2,y2)));\n }\n cin>>a.x>>a.y>>b.x>>b.y;\n vp.clear();\n vp.push_back(a);\n vp.push_back(b);\n merge(vs);\n e=SegmentArrangement(vs,vp);\n double ans=dijkstra();\n if(ans==-1)cout<<-1<<endl;\n else printf(\"%.10f\\n\",dijkstra());\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 11156,
"score_of_the_acc": -1.1524,
"final_rank": 12
},
{
"submission_id": "aoj_1033_1151443",
"code_snippet": "#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\nusing namespace std;\ntypedef long long LL;\n\ntypedef complex<double> P;\nconst double EPS = 1e-8;\n\n// 誤差を加味した符号判定\nint sign(double x){ return x > EPS ? 1 : x < -EPS ? -1 : 0; }\n\n// 内積・外積\ndouble dot(P a, P b){return real(conj(a) * b);}\ndouble cross(P a, P b){return imag(conj(a) * b);}\n\n// OAとOBのなす符号付き角度 [-pi, pi]\n// example : (1, 0), (0, 1) -> pi/2\ndouble angle(P a, P b){return arg(conj(a) * b);}\n\n// aをc中心にb[rad]回転\nP rotate(P a, double b, P c = P()){return (a - c) * polar(1.0, b) + c;}\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; // c--a--b の順番で一直線上\n if (norm(b) + EPS < norm(c)) return -2; // a--b--c の順番で一直線上\n return 0; // 点が線分ab上にある\n}\n\nenum{ OUT, ON, IN };\n\n// Pointの比較をしたいときだけ定義する．\nnamespace std{\n bool operator < (const P& a, const P& b) {\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\n }\n};\n\ntypedef vector<P> L;\nP vec(L l){return l[1] - l[0];}\n\n// 線分と点の交差判定(端点の処理に注意)(端点は含むけれども誤差に注意)\n// verify : AOJ1279, AOJ2506\nbool iSP(L s, P p) {return ccw(s[0], s[1], p) == 0;}\n\n// 直線と直線の交点\n// Verified: AOJ2579\n// size()によって場合分け\n// *4 : 直線が重なる *1 : 交点が1つ存在 *0 : 直線が交差しない\nvector<P> pLL(L l, L m){\n double A = cross(vec(l), vec(m));\n double B = cross(vec(l), l[1] - m[0]);\n if(sign(A) == 0 && sign(B) == 0) return {l[0], l[1], m[0], m[1]}; // 二直線が重なっている\n if(sign(A) == 0) return{}; // 直線が交わらない\n return {m[0] + vec(m) * B / A};\n}\n\nvector<P> pSS(L l, L m){\n vector<P> res;\n auto find = [&](P p){ \n for(P r : res) if(sign(abs(r - p)) == 0)\n return true;\n return false;\n };\n for(P p : pLL(l, m))\n if(iSP(l,p) && iSP(m,p) && !find(p)) // 片方が直線の場合は適宜変えること\n res.push_back(p);\n return res;\n}\n\n// 入力\n// ss : 線分のリスト\n//\n// 出力\n// ps : グラフの頂点番号に対応する点が入る\n// 返り値 : 上の説明のグラフ\n//\n// Verified\n// AOJ 2113\ntypedef vector<int> Node;\ntypedef vector<Node> Graph;\nGraph segment_arrangement(const vector<L> &ss, vector<P> &ps) {\n for (int i = 0; i < ss.size(); i++) {\n ps.push_back( ss[i][0] );\n ps.push_back( ss[i][1] );\n for (int j = i+1; j < ss.size(); j++){\n auto cp = pSS(ss[i], ss[j]);\n if (!cp.empty()) {\n assert(cp.size() == 1);\n ps.push_back( cp.back() );\n }\n }\n }\n sort(ps.begin(), ps.end());\n ps.erase(unique(ps.begin(), ps.end()), ps.end());\n\n Graph g(ps.size());\n for (int i = 0; i < ss.size(); i++) {\n vector<int> on;\n for (int j = 0; j < ps.size(); j++){\n if (iSP(ss[i], ps[j])){\n on.push_back(j);\n }\n }\n for (int j = 0; j + 1 < on.size(); j++) {\n for(int k = j + 1; k < on.size(); k++) {\n int a = on[j], b = on[k];\n g[a].push_back( b );\n g[b].push_back( a );\n }\n }\n }\n return g;\n}\n\n// 線分併合\n//\n// 線分のリストからオーバーラップするものたちをまとめ,新しい線分のリストを作る.\n// 元々の線分のリストにおける順番は破壊される．\n//\n// not verified\nvoid merge_segments(vector<L>& segs) {\n auto merge_if_able = [](L& s, L t){\n if (abs(cross(s[1]-s[0], t[1]-t[0])) > EPS) return false;\n //if (sign(cross(vec(s), vec(t))) != 0) return false;\n if (ccw(s[0], t[0], s[1]) == +1 ||\n ccw(s[0], t[0], s[1]) == -1) return false; // not on the same line\n if (ccw(s[0], s[1], t[0]) == -2 ||\n ccw(t[0], t[1], s[0]) == -2) return false; // separated\n s = { min(s[0], t[0]), max(s[1], t[1]) };\n return true;\n };\n for (int i = 0; i < segs.size(); ++i)\n if (segs[i][1] < segs[i][0])\n swap(segs[i][1], segs[i][0]);\n for (int i = 0; i < segs.size(); ++i)\n for (int j = i+1; j < segs.size(); ++j)\n if (merge_if_able(segs[i], segs[j]))\n segs[j--] = segs.back(), segs.pop_back();\n}\nP input() {\n double x, y;\n cin >> x >> y;\n return {x, y};\n}\ntypedef tuple<double, int, int> T;\nconst int MAX = 500;\nconst double INF = 1e64;\n\nint main(){\n int n;\n while(cin >> n && n > 0){\n vector<L> lines(n);\n REP(i, n) {\n P a = input();\n P b = input();\n lines[i] = {a, b};\n }\n\n //merge_segments(lines);\n //assert(size == lines.size());\n\n vector<P> ps;\n Graph G = segment_arrangement(lines, ps);\n /*\n REP(i, G.size()){\n cout << i << \":\";\n for(int v : G[i]) cout << v << \" \";\n cout << endl;\n }\n */\n assert(ps.size() < MAX);\n\n REP(i, ps.size()) REP(j, i) {\n assert(abs(ps[i] - ps[j]) > EPS);\n }\n\n auto find = [](const vector<P>& pv, P p) -> int {\n for(int i = 0; i < pv.size(); i++) {\n auto q = pv[i];\n if(abs(p - q) < EPS) {\n return i;\n }\n }\n return -1;\n };\n \n P sp = input();\n P gp = input();\n int s = find(ps, sp);\n int g = find(ps, gp);\n\n /*\n if(s == g) {\n cout << 0 << endl;\n continue;\n }\n */\n\n assert(s != -1 && g != -1);\n\n priority_queue<T, vector<T>, greater<T>> que;\n double dist[MAX][MAX] = {};\n REP(i, MAX) REP(j, MAX) dist[i][j] = INF;\n for(int u : G[s]) {\n dist[s][u] = 0.0;\n que.push(T(0.0, s, u));\n }\n double ans = INF;\n while(!que.empty()) {\n T t = que.top(); que.pop();\n double d;\n int u, v;\n tie(d, u, v) = t;\n if(v == g) {\n ans = d;\n break;\n }\n for(int w : G[v]) {\n P p = ps[v] - ps[u];\n P q = ps[w] - ps[v];\n double th = abs(angle(p, q)) / M_PI * 180.0;\n double nd = d + th;\n if(dist[v][w] > nd) {\n dist[v][w] = nd;\n que.push(T(nd, v, w));\n }\n }\n }\n if(ans == INF) {\n cout << -1 << endl;\n } else {\n printf(\"%.12f\\n\", ans);\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3368,
"score_of_the_acc": -0.3784,
"final_rank": 7
},
{
"submission_id": "aoj_1033_1151442",
"code_snippet": "#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\nusing namespace std;\ntypedef long long LL;\n\ntypedef complex<double> P;\nconst double EPS = 1e-8;\n\n// 誤差を加味した符号判定\nint sign(double x){ return x > EPS ? 1 : x < -EPS ? -1 : 0; }\n\n// 内積・外積\ndouble dot(P a, P b){return real(conj(a) * b);}\ndouble cross(P a, P b){return imag(conj(a) * b);}\n\n// OAとOBのなす符号付き角度 [-pi, pi]\n// example : (1, 0), (0, 1) -> pi/2\ndouble angle(P a, P b){return arg(conj(a) * b);}\n\n// aをc中心にb[rad]回転\nP rotate(P a, double b, P c = P()){return (a - c) * polar(1.0, b) + c;}\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; // c--a--b の順番で一直線上\n if (norm(b) + EPS < norm(c)) return -2; // a--b--c の順番で一直線上\n return 0; // 点が線分ab上にある\n}\n\nenum{ OUT, ON, IN };\n\n// Pointの比較をしたいときだけ定義する．\nnamespace std{\n bool operator < (const P& a, const P& b) {\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\n }\n};\n\ntypedef vector<P> L;\nP vec(L l){return l[1] - l[0];}\n\n// 線分と点の交差判定(端点の処理に注意)(端点は含むけれども誤差に注意)\n// verify : AOJ1279, AOJ2506\nbool iSP(L s, P p) {return ccw(s[0], s[1], p) == 0;}\n\n// 直線と直線の交点\n// Verified: AOJ2579\n// size()によって場合分け\n// *4 : 直線が重なる *1 : 交点が1つ存在 *0 : 直線が交差しない\nvector<P> pLL(L l, L m){\n double A = cross(vec(l), vec(m));\n double B = cross(vec(l), l[1] - m[0]);\n if(sign(A) == 0 && sign(B) == 0) return {l[0], l[1], m[0], m[1]}; // 二直線が重なっている\n if(sign(A) == 0) return{}; // 直線が交わらない\n return {m[0] + vec(m) * B / A};\n}\n\nvector<P> pSS(L l, L m){\n vector<P> res;\n auto find = [&](P p){ \n for(P r : res) if(sign(abs(r - p)) == 0)\n return true;\n return false;\n };\n for(P p : pLL(l, m))\n if(iSP(l,p) && iSP(m,p) && !find(p)) // 片方が直線の場合は適宜変えること\n res.push_back(p);\n return res;\n}\n\n// 入力\n// ss : 線分のリスト\n//\n// 出力\n// ps : グラフの頂点番号に対応する点が入る\n// 返り値 : 上の説明のグラフ\n//\n// Verified\n// AOJ 2113\ntypedef vector<int> Node;\ntypedef vector<Node> Graph;\nGraph segment_arrangement(const vector<L> &ss, vector<P> &ps) {\n for (int i = 0; i < ss.size(); i++) {\n ps.push_back( ss[i][0] );\n ps.push_back( ss[i][1] );\n for (int j = i+1; j < ss.size(); j++){\n auto cp = pSS(ss[i], ss[j]);\n if (!cp.empty()) {\n assert(cp.size() == 1);\n ps.push_back( cp.back() );\n }\n }\n }\n sort(ps.begin(), ps.end());\n ps.erase(unique(ps.begin(), ps.end()), ps.end());\n\n Graph g(ps.size());\n for (int i = 0; i < ss.size(); i++) {\n vector<int> on;\n for (int j = 0; j < ps.size(); j++){\n if (iSP(ss[i], ps[j])){\n on.push_back(j);\n }\n }\n for (int j = 0; j + 1 < on.size(); j++) {\n for(int k = j + 1; k < on.size(); k++) {\n int a = on[j], b = on[k];\n g[a].push_back( b );\n g[b].push_back( a );\n }\n }\n }\n return g;\n}\n\n// 線分併合\n//\n// 線分のリストからオーバーラップするものたちをまとめ,新しい線分のリストを作る.\n// 元々の線分のリストにおける順番は破壊される．\n//\n// not verified\nvoid merge_segments(vector<L>& segs) {\n auto merge_if_able = [](L& s, L t){\n if (abs(cross(s[1]-s[0], t[1]-t[0])) > EPS) return false;\n //if (sign(cross(vec(s), vec(t))) != 0) return false;\n if (ccw(s[0], t[0], s[1]) == +1 ||\n ccw(s[0], t[0], s[1]) == -1) return false; // not on the same line\n if (ccw(s[0], s[1], t[0]) == -2 ||\n ccw(t[0], t[1], s[0]) == -2) return false; // separated\n s = { min(s[0], t[0]), max(s[1], t[1]) };\n return true;\n };\n for (int i = 0; i < segs.size(); ++i)\n if (segs[i][1] < segs[i][0])\n swap(segs[i][1], segs[i][0]);\n for (int i = 0; i < segs.size(); ++i)\n for (int j = i+1; j < segs.size(); ++j)\n if (merge_if_able(segs[i], segs[j]))\n segs[j--] = segs.back(), segs.pop_back();\n}\nP input() {\n double x, y;\n cin >> x >> y;\n return {x, y};\n}\ntypedef tuple<double, int, int> T;\nconst int MAX = 500;\nconst double INF = 1e64;\n\nint main(){\n int n;\n while(cin >> n && n > 0){\n vector<L> lines(n);\n REP(i, n) {\n P a = input();\n P b = input();\n lines[i] = {a, b};\n }\n\n merge_segments(lines);\n //assert(size == lines.size());\n\n vector<P> ps;\n Graph G = segment_arrangement(lines, ps);\n /*\n REP(i, G.size()){\n cout << i << \":\";\n for(int v : G[i]) cout << v << \" \";\n cout << endl;\n }\n */\n assert(ps.size() < MAX);\n\n REP(i, ps.size()) REP(j, i) {\n assert(abs(ps[i] - ps[j]) > EPS);\n }\n\n auto find = [](const vector<P>& pv, P p) -> int {\n for(int i = 0; i < pv.size(); i++) {\n auto q = pv[i];\n if(abs(p - q) < EPS) {\n return i;\n }\n }\n return -1;\n };\n \n P sp = input();\n P gp = input();\n int s = find(ps, sp);\n int g = find(ps, gp);\n\n /*\n if(s == g) {\n cout << 0 << endl;\n continue;\n }\n */\n\n assert(s != -1 && g != -1);\n\n priority_queue<T, vector<T>, greater<T>> que;\n double dist[MAX][MAX] = {};\n REP(i, MAX) REP(j, MAX) dist[i][j] = INF;\n for(int u : G[s]) {\n dist[s][u] = 0.0;\n que.push(T(0.0, s, u));\n }\n double ans = INF;\n while(!que.empty()) {\n T t = que.top(); que.pop();\n double d;\n int u, v;\n tie(d, u, v) = t;\n if(v == g) {\n ans = d;\n break;\n }\n for(int w : G[v]) {\n P p = ps[v] - ps[u];\n P q = ps[w] - ps[v];\n double th = abs(angle(p, q)) / M_PI * 180.0;\n double nd = d + th;\n if(dist[v][w] > nd) {\n dist[v][w] = nd;\n que.push(T(nd, v, w));\n }\n }\n }\n if(ans == INF) {\n cout << -1 << endl;\n } else {\n printf(\"%.12f\\n\", ans);\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3368,
"score_of_the_acc": -0.3015,
"final_rank": 4
},
{
"submission_id": "aoj_1033_1151441",
"code_snippet": "#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\nusing namespace std;\ntypedef long long LL;\n\ntypedef complex<double> P;\nconst double EPS = 1e-8;\n\n// 誤差を加味した符号判定\nint sign(double x){ return x > EPS ? 1 : x < -EPS ? -1 : 0; }\n\n// 内積・外積\ndouble dot(P a, P b){return real(conj(a) * b);}\ndouble cross(P a, P b){return imag(conj(a) * b);}\n\n// OAとOBのなす符号付き角度 [-pi, pi]\n// example : (1, 0), (0, 1) -> pi/2\ndouble angle(P a, P b){return arg(conj(a) * b);}\n\n// aをc中心にb[rad]回転\nP rotate(P a, double b, P c = P()){return (a - c) * polar(1.0, b) + c;}\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; // c--a--b の順番で一直線上\n if (norm(b) + EPS < norm(c)) return -2; // a--b--c の順番で一直線上\n return 0; // 点が線分ab上にある\n}\n\nenum{ OUT, ON, IN };\n\n// Pointの比較をしたいときだけ定義する．\nnamespace std{\n bool operator < (const P& a, const P& b) {\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\n }\n};\n\ntypedef vector<P> L;\nP vec(L l){return l[1] - l[0];}\n\n// 線分と点の交差判定(端点の処理に注意)(端点は含むけれども誤差に注意)\n// verify : AOJ1279, AOJ2506\nbool iSP(L s, P p) {return ccw(s[0], s[1], p) == 0;}\n\n// 直線と直線の交点\n// Verified: AOJ2579\n// size()によって場合分け\n// *4 : 直線が重なる *1 : 交点が1つ存在 *0 : 直線が交差しない\nvector<P> pLL(L l, L m){\n double A = cross(vec(l), vec(m));\n double B = cross(vec(l), l[1] - m[0]);\n if(sign(A) == 0 && sign(B) == 0) return {l[0], l[1], m[0], m[1]}; // 二直線が重なっている\n if(sign(A) == 0) return{}; // 直線が交わらない\n return {m[0] + vec(m) * B / A};\n}\n\nvector<P> pSS(L l, L m){\n vector<P> res;\n auto find = [&](P p){ \n for(P r : res) if(sign(abs(r - p)) == 0)\n return true;\n return false;\n };\n for(P p : pLL(l, m))\n if(iSP(l,p) && iSP(m,p) && !find(p)) // 片方が直線の場合は適宜変えること\n res.push_back(p);\n return res;\n}\n\n// 入力\n// ss : 線分のリスト\n//\n// 出力\n// ps : グラフの頂点番号に対応する点が入る\n// 返り値 : 上の説明のグラフ\n//\n// Verified\n// AOJ 2113\ntypedef vector<int> Node;\ntypedef vector<Node> Graph;\nGraph segment_arrangement(const vector<L> &ss, vector<P> &ps) {\n for (int i = 0; i < ss.size(); i++) {\n ps.push_back( ss[i][0] );\n ps.push_back( ss[i][1] );\n for (int j = i+1; j < ss.size(); j++){\n auto cp = pSS(ss[i], ss[j]);\n if (!cp.empty()) {\n assert(cp.size() == 1);\n ps.push_back( cp.back() );\n }\n }\n }\n sort(ps.begin(), ps.end());\n ps.erase(unique(ps.begin(), ps.end()), ps.end());\n\n Graph g(ps.size());\n for (int i = 0; i < ss.size(); i++) {\n vector<int> on;\n for (int j = 0; j < ps.size(); j++){\n if (iSP(ss[i], ps[j])){\n on.push_back(j);\n }\n }\n for (int j = 0; j + 1 < on.size(); j++) {\n for(int k = j + 1; k < on.size(); k++) {\n int a = on[j], b = on[k];\n g[a].push_back( b );\n g[b].push_back( a );\n }\n }\n }\n return g;\n}\n\n// 線分併合\n//\n// 線分のリストからオーバーラップするものたちをまとめ,新しい線分のリストを作る.\n// 元々の線分のリストにおける順番は破壊される．\n//\n// not verified\nvoid merge_segments(vector<L>& segs) {\n auto merge_if_able = [](L& s, L t){\n if (abs(cross(s[1]-s[0], t[1]-t[0])) > EPS) return false;\n //if (sign(cross(vec(s), vec(t))) != 0) return false;\n if (ccw(s[0], t[0], s[1]) == +1 ||\n ccw(s[0], t[0], s[1]) == -1) return false; // not on the same line\n if (ccw(s[0], s[1], t[0]) == -2 ||\n ccw(t[0], t[1], s[0]) == -2) return false; // separated\n s = { min(s[0], t[0]), max(s[1], t[1]) };\n return true;\n };\n for (int i = 0; i < segs.size(); ++i)\n if (segs[i][1] < segs[i][0])\n swap(segs[i][1], segs[i][0]);\n for (int i = 0; i < segs.size(); ++i)\n for (int j = i+1; j < segs.size(); ++j)\n if (merge_if_able(segs[i], segs[j]))\n segs[j--] = segs.back(), segs.pop_back();\n}\nP input() {\n double x, y;\n cin >> x >> y;\n return {x, y};\n}\ntypedef tuple<double, int, int> T;\nconst int MAX = 500;\nconst double INF = 1e64;\n\nint main(){\n int n;\n while(cin >> n && n > 0){\n vector<L> lines(n);\n REP(i, n) {\n P a = input();\n P b = input();\n lines[i] = {a, b};\n }\n\n merge_segments(lines);\n //assert(size == lines.size());\n\n vector<P> ps;\n Graph G = segment_arrangement(lines, ps);\n /*\n REP(i, G.size()){\n cout << i << \":\";\n for(int v : G[i]) cout << v << \" \";\n cout << endl;\n }\n */\n assert(ps.size() < MAX);\n\n REP(i, ps.size()) REP(j, i) {\n assert(abs(ps[i] - ps[j]) > EPS);\n }\n\n auto find = [](const vector<P>& pv, P p) -> int {\n for(int i = 0; i < pv.size(); i++) {\n auto q = pv[i];\n if(abs(p - q) < EPS) {\n return i;\n }\n }\n return -1;\n };\n \n P sp = input();\n P gp = input();\n int s = find(ps, sp);\n int g = find(ps, gp);\n\n /*\n if(s == g) {\n cout << 0 << endl;\n continue;\n }\n */\n\n assert(s != -1 && g != -1);\n\n priority_queue<T, vector<T>, greater<T>> que;\n double dist[MAX][MAX] = {};\n REP(i, MAX) REP(j, MAX) dist[i][j] = INF;\n for(int u : G[s]) {\n dist[s][u] = 0.0;\n que.push(T(0.0, s, u));\n }\n double ans = INF;\n while(!que.empty()) {\n T t = que.top(); que.pop();\n double d;\n int u, v;\n tie(d, u, v) = t;\n if(v == g) {\n ans = d;\n break;\n }\n for(int w : G[v]) if(u != w) {\n P p = ps[v] - ps[u];\n P q = ps[w] - ps[v];\n double th = abs(angle(p, q)) / M_PI * 180.0;\n double nd = d + th;\n if(dist[v][w] > nd) {\n dist[v][w] = nd;\n que.push(T(nd, v, w));\n }\n }\n }\n if(ans == INF) {\n cout << -1 << endl;\n } else {\n printf(\"%.12f\\n\", ans);\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3368,
"score_of_the_acc": -0.3015,
"final_rank": 4
},
{
"submission_id": "aoj_1033_1151439",
"code_snippet": "#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\nusing namespace std;\ntypedef long long LL;\n\ntypedef complex<double> P;\nconst double EPS = 1e-8;\n\n// 誤差を加味した符号判定\nint sign(double x){ return x > EPS ? 1 : x < -EPS ? -1 : 0; }\n\n// 内積・外積\ndouble dot(P a, P b){return real(conj(a) * b);}\ndouble cross(P a, P b){return imag(conj(a) * b);}\n\n// OAとOBのなす符号付き角度 [-pi, pi]\n// example : (1, 0), (0, 1) -> pi/2\ndouble angle(P a, P b){return arg(conj(a) * b);}\n\n// aをc中心にb[rad]回転\nP rotate(P a, double b, P c = P()){return (a - c) * polar(1.0, b) + c;}\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; // c--a--b の順番で一直線上\n if (norm(b) + EPS < norm(c)) return -2; // a--b--c の順番で一直線上\n return 0; // 点が線分ab上にある\n}\n\nenum{ OUT, ON, IN };\n\n// Pointの比較をしたいときだけ定義する．\nnamespace std{\n bool operator < (const P& a, const P& b) {\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\n }\n};\n\ntypedef vector<P> L;\nP vec(L l){return l[1] - l[0];}\n\n// 線分と点の交差判定(端点の処理に注意)(端点は含むけれども誤差に注意)\n// verify : AOJ1279, AOJ2506\nbool iSP(L s, P p) {return ccw(s[0], s[1], p) == 0;}\n\n// 直線と直線の交点\n// Verified: AOJ2579\n// size()によって場合分け\n// *4 : 直線が重なる *1 : 交点が1つ存在 *0 : 直線が交差しない\nvector<P> pLL(L l, L m){\n double A = cross(vec(l), vec(m));\n double B = cross(vec(l), l[1] - m[0]);\n if(sign(A) == 0 && sign(B) == 0) return {l[0], l[1], m[0], m[1]}; // 二直線が重なっている\n if(sign(A) == 0) return{}; // 直線が交わらない\n return {m[0] + vec(m) * B / A};\n}\n\nvector<P> pSS(L l, L m){\n vector<P> res;\n auto find = [&](P p){ \n for(P r : res) if(sign(abs(r - p)) == 0)\n return true;\n return false;\n };\n for(P p : pLL(l, m))\n if(iSP(l,p) && iSP(m,p) && !find(p)) // 片方が直線の場合は適宜変えること\n res.push_back(p);\n return res;\n}\n\n// 入力\n// ss : 線分のリスト\n//\n// 出力\n// ps : グラフの頂点番号に対応する点が入る\n// 返り値 : 上の説明のグラフ\n//\n// Verified\n// AOJ 2113\ntypedef vector<int> Node;\ntypedef vector<Node> Graph;\nGraph segment_arrangement(const vector<L> &ss, vector<P> &ps) {\n for (int i = 0; i < ss.size(); i++) {\n ps.push_back( ss[i][0] );\n ps.push_back( ss[i][1] );\n for (int j = i+1; j < ss.size(); j++){\n auto cp = pSS(ss[i], ss[j]);\n if (!cp.empty()) {\n assert(cp.size() == 1);\n ps.push_back( cp.back() );\n }\n }\n }\n sort(ps.begin(), ps.end());\n ps.erase(unique(ps.begin(), ps.end()), ps.end());\n\n Graph g(ps.size());\n for (int i = 0; i < ss.size(); i++) {\n vector<int> on;\n for (int j = 0; j < ps.size(); j++){\n if (iSP(ss[i], ps[j])){\n on.push_back(j);\n }\n }\n for (int j = 0; j + 1 < on.size(); j++) {\n for(int k = j + 1; k < on.size(); k++) {\n int a = on[j], b = on[k];\n g[a].push_back( b );\n g[b].push_back( a );\n }\n }\n }\n return g;\n}\n\n// 線分併合\n//\n// 線分のリストからオーバーラップするものたちをまとめ,新しい線分のリストを作る.\n// 元々の線分のリストにおける順番は破壊される．\n//\n// not verified\nvoid merge_segments(vector<L>& segs) {\n auto merge_if_able = [](L& s, L t){\n if (abs(cross(s[1]-s[0], t[1]-t[0])) > EPS) return false;\n //if (sign(cross(vec(s), vec(t))) != 0) return false;\n if (ccw(s[0], t[0], s[1]) == +1 ||\n ccw(s[0], t[0], s[1]) == -1) return false; // not on the same line\n if (ccw(s[0], s[1], t[0]) == -2 ||\n ccw(t[0], t[1], s[0]) == -2) return false; // separated\n s = { min(s[0], t[0]), max(s[1], t[1]) };\n return true;\n };\n for (int i = 0; i < segs.size(); ++i)\n if (segs[i][1] < segs[i][0])\n swap(segs[i][1], segs[i][0]);\n for (int i = 0; i < segs.size(); ++i)\n for (int j = i+1; j < segs.size(); ++j)\n if (merge_if_able(segs[i], segs[j]))\n segs[j--] = segs.back(), segs.pop_back();\n}\nP input() {\n double x, y;\n cin >> x >> y;\n return {x, y};\n}\ntypedef tuple<double, int, int> T;\nconst int MAX = 500;\nconst double INF = 1e64;\n\nint main(){\n int n;\n while(cin >> n && n > 0){\n vector<L> lines(n);\n REP(i, n) {\n P a = input();\n P b = input();\n lines[i] = {a, b};\n }\n\n merge_segments(lines);\n //assert(size == lines.size());\n\n vector<P> ps;\n Graph G = segment_arrangement(lines, ps);\n /*\n REP(i, G.size()){\n cout << i << \":\";\n for(int v : G[i]) cout << v << \" \";\n cout << endl;\n }\n */\n assert(ps.size() < MAX);\n\n REP(i, ps.size()) REP(j, i) {\n assert(abs(ps[i] - ps[j]) > EPS);\n }\n\n auto find = [](const vector<P>& pv, P p) -> int {\n for(int i = 0; i < pv.size(); i++) {\n auto q = pv[i];\n if(abs(p - q) < EPS) {\n return i;\n }\n }\n return -1;\n };\n \n P sp = input();\n P gp = input();\n int s = find(ps, sp);\n int g = find(ps, gp);\n\n if(s == g) {\n cout << 0 << endl;\n continue;\n }\n\n assert(s != -1 && g != -1);\n\n priority_queue<T, vector<T>, greater<T>> que;\n double dist[MAX][MAX] = {};\n REP(i, MAX) REP(j, MAX) dist[i][j] = INF;\n for(int u : G[s]) {\n dist[s][u] = 0.0;\n que.push(T(0.0, s, u));\n }\n double ans = INF;\n while(!que.empty()) {\n T t = que.top(); que.pop();\n double d;\n int u, v;\n tie(d, u, v) = t;\n if(v == g) {\n ans = d;\n break;\n }\n for(int w : G[v]) if(u != w) {\n P p = ps[v] - ps[u];\n P q = ps[w] - ps[v];\n double th = abs(angle(p, q)) / M_PI * 180.0;\n double nd = d + th;\n if(dist[v][w] > nd) {\n dist[v][w] = nd;\n que.push(T(nd, v, w));\n }\n }\n }\n if(ans == INF) {\n cout << -1 << endl;\n } else {\n printf(\"%.12f\\n\", ans);\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3368,
"score_of_the_acc": -0.3015,
"final_rank": 4
},
{
"submission_id": "aoj_1033_1077832",
"code_snippet": "#include <cstdio>\n#include <map>\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <queue>\nusing namespace std;\n\nstatic const double EPS = 1e-10;\ntypedef complex<double> P;\n \nstd::istream& operator>>(std::istream& is,P& p)\n{\n\tis >> p.real() >> p.imag();\n\treturn is;\n}\nstruct L : public vector<P> {L(const P &a, const P &b) {push_back(a); push_back(b);} L(){push_back(P(0,0)); push_back(P(0,0));}};\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);}\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 intersectSP(const L &s, const P &p) {return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS;}\n\nP crosspoint(const L &l, const L &m) {\n\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\n\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\n\tif (abs(A) < EPS && abs(B) < EPS) return m[0];\n\treturn m[0] + B / A * (m[1] - m[0]);\n}\n\nstruct Node{\n\tint id;\n\tdouble dir;\n\tdouble cost;\n\tNode(int id,double dir,double cost) : id(id),dir(dir),cost(cost){}\n};\nbool operator <(const Node &a,const Node &b){ return a.cost > b.cost;}\n\ndouble PI = acos(-1);\n//fix(x):=角度を[0,2π)の範囲にする\ndouble fix(double x){\n\twhile( x >= 2 * PI ) x -= 2 * PI;\n\twhile( x < 0) x += 2 * PI;\n\treturn x;\n}\nint main(){\n\tint n;\n\twhile(cin >> n && n){\n\t\tL l[n];\n\t\tfor(int i = 0 ; i < n ; i++) cin >> l[i][0] >> l[i][1];\n\t\tP s,g;\n\t\tcin >> s >> g;\n\t\t\n\t\tvector<P> tar,tar_; // tar:=ダイクストラで中継点/ゴール/スタートとなるであろう点の集合\n\t\ttar_.push_back(s);\n\t\ttar_.push_back(g);\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\ttar_.push_back(l[i][0]); \n\t\t\ttar_.push_back(l[i][1]);\n\t\t\tfor(int j = 0 ; j < n ; j++){\n\t\t\t\tif( intersectLL(l[i],l[j]) ) tar_.push_back(crosspoint(l[i],l[j]));\n\t\t\t}\n\t\t}\n\t\t\n\t\t// 重複点を削除する\n\t\tsort(tar_.begin(),tar_.end());\n\t\tfor(int i = 0 ; i < tar_.size() ; i++)\n\t\t\tif( !i || abs(tar_[i-1]-tar_[i]) > EPS ) tar.push_back(tar_[i]);\n\t\t\n\t\t// 点a→点bが可能かどうかのグラフを構築\n\t\tvector< vector<int> > connect(tar.size());\n\t\tfor(int i = 0 ; i < tar.size() ; i++){\n\t\t\tfor(int j = i+1 ; j < tar.size() ; j++){\n\t\t\t\tfor(int k = 0 ; k < n ; k++){\n\t\t\t\t\tif( intersectSP(l[k],tar[i]) && intersectSP(l[k],tar[j]) ){\n\t\t\t\t\t\tconnect[i].push_back(j);\n\t\t\t\t\t\tconnect[j].push_back(i);\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\t\n\t\tdouble res = -1;\n\t\tpriority_queue<Node> Q;\n\t\tmap< pair<int,long long> , int> done;\n\t\tfor(int i = 0 ; i < tar.size() ; i++){\n\t\t\tif( abs(tar[i]-s) < EPS ){\n\t\t\t\tQ.push(Node(i,-114514,0)); // スタート地点を追加\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\twhile( Q.size() ){\n\t\t\tNode q = Q.top(); Q.pop();\n\t\t\t//(位置,角度)で状態を持っているが，角度が誤差で無限に候補が発生するかもしれないので適当に丸めて扱う\n\t\t\tif( done[make_pair(q.id,(long long)(q.dir*10000))]++ ) continue;\n\t\t\tP my = tar[q.id];\n\t\t\tif( abs(my-g) < EPS ){\n\t\t\t\tres = q.cost *180/PI;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfor(int i = 0 ; i < connect[q.id].size() ; i++){\n\t\t\t\tint oid = connect[q.id][i];\n\t\t\t\tP other = tar[oid] - my;\n\t\t\t\tdouble rad = fix(atan2(other.imag(),other.real()));\n\t\t\t\tdouble diff = fabs(q.dir-rad);\n\t\t\t\tdiff = min(2*PI-diff,diff);\n\t\t\t\tif( q.dir == -114514 ) diff = 0;\n\t\t\t\tQ.push(Node(oid,rad,q.cost+diff));\n\t\t\t}\n\t\t}\n\t\tprintf(\"%.10lf\\n\",res);\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 1440,
"score_of_the_acc": -0.7443,
"final_rank": 10
},
{
"submission_id": "aoj_1033_1077831",
"code_snippet": "#include <cstdio>\n#include <map>\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <queue>\nusing namespace std;\n\nstatic const double EPS = 1e-10;\ntypedef complex<double> P;\n \nstd::istream& operator>>(std::istream& is,P& p)\n{\n\tis >> p.real() >> p.imag();\n\treturn is;\n}\nstruct L : public vector<P> {L(const P &a, const P &b) {push_back(a); push_back(b);} L(){push_back(P(0,0)); push_back(P(0,0));}};\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);}\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 intersectSP(const L &s, const P &p) {return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS;}\n\nP crosspoint(const L &l, const L &m) {\n\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\n\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\n\tif (abs(A) < EPS && abs(B) < EPS) return m[0];\n\treturn m[0] + B / A * (m[1] - m[0]);\n}\n\nstruct Node{\n\tint id;\n\tdouble dir;\n\tdouble cost;\n\tNode(int id,double dir,double cost) : id(id),dir(dir),cost(cost){}\n};\nbool operator <(const Node &a,const Node &b){ return a.cost > b.cost;}\n\ndouble PI = acos(-1);\n//fix(x):=角度を[0,2π)の範囲にする\ndouble fix(double x){\n\twhile( x >= 2 * PI ) x -= 2 * PI;\n\twhile( x < 0) x += 2 * PI;\n\treturn x;\n}\nint main(){\n\tint n;\n\twhile(cin >> n && n){\n\t\tL l[n];\n\t\tfor(int i = 0 ; i < n ; i++) cin >> l[i][0] >> l[i][1];\n\t\tP s,g;\n\t\tcin >> s >> g;\n\t\t\n\t\tvector<P> tar,tar_; // tar:=ダイクストラで中継点/ゴール/スタートとなるであろう点の集合\n\t\ttar_.push_back(s);\n\t\ttar_.push_back(g);\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\ttar_.push_back(l[i][0]); \n\t\t\ttar_.push_back(l[i][1]);\n\t\t\tfor(int j = 0 ; j < n ; j++){\n\t\t\t\tif( intersectLL(l[i],l[j]) ) tar_.push_back(crosspoint(l[i],l[j]));\n\t\t\t}\n\t\t}\n\t\t\n\t\t// 重複点を削除する\n\t\tsort(tar_.begin(),tar_.end());\n\t\tfor(int i = 0 ; i < tar_.size() ; i++)\n\t\t\tif( !i || abs(tar_[i-1]-tar_[i]) > EPS ) tar.push_back(tar_[i]);\n\t\t\n\t\t// 点a→点bが可能かどうかのグラフを構築\n\t\tvector< vector<int> > connect(tar.size());\n\t\tfor(int i = 0 ; i < tar.size() ; i++){\n\t\t\tfor(int j = i+1 ; j < tar.size() ; j++){\n\t\t\t\tfor(int k = 0 ; k < n ; k++){\n\t\t\t\t\tif( intersectSP(l[k],tar[i]) && intersectSP(l[k],tar[j]) ){\n\t\t\t\t\t\tconnect[i].push_back(j);\n\t\t\t\t\t\tconnect[j].push_back(i);\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\t\n\t\tdouble res = -1;\n\t\tpriority_queue<Node> Q;\n\t\tmap< pair<int,long long> , int> done;\n\t\tfor(int i = 0 ; i < tar.size() ; i++){\n\t\t\tif( abs(tar[i]-s) < EPS ){\n\t\t\t\tQ.push(Node(i,-114514,0)); // スタート地点を追加\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\twhile( Q.size() ){\n\t\t\tNode q = Q.top(); Q.pop();\n\t\t\t//(位置,角度)で状態を持っているが，角度が誤差で無限に候補が発生するかもしれないので適当に丸めて扱う\n\t\t\tif( done[make_pair(q.id,(long long)(q.dir*10000000))]++ ) continue;\n\t\t\tP my = tar[q.id];\n\t\t\tif( abs(my-g) < EPS ){\n\t\t\t\tres = q.cost *180/PI;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfor(int i = 0 ; i < connect[q.id].size() ; i++){\n\t\t\t\tint oid = connect[q.id][i];\n\t\t\t\tP other = tar[oid] - my;\n\t\t\t\tdouble rad = fix(atan2(other.imag(),other.real()));\n\t\t\t\tdouble diff = fabs(q.dir-rad);\n\t\t\t\tdiff = min(2*PI-diff,diff);\n\t\t\t\tif( q.dir == -114514 ) diff = 0;\n\t\t\t\tQ.push(Node(oid,rad,q.cost+diff));\n\t\t\t}\n\t\t}\n\t\tprintf(\"%.10lf\\n\",res);\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 1440,
"score_of_the_acc": -0.7443,
"final_rank": 10
},
{
"submission_id": "aoj_1033_1077829",
"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;\n\nstatic const double EPS = 1e-10;\nconst double INF = 1e12;\ntypedef complex<double> P,point;\n \nstd::istream& operator>>(std::istream& is,P& p)\n{\n\tis >> p.real() >> p.imag();\n\treturn is;\n}\n\ntypedef vector<P> G,polygon;\nstruct L : public vector<P> {L(const P &a, const P &b) {push_back(a); push_back(b);} L(){push_back(P(0,0)); push_back(P(0,0));}};\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);}\n\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;}\n\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 \n \nP crosspoint(const L &l, const L &m) {\n\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\n\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\n\tif (abs(A) < EPS && abs(B) < EPS) return m[0];\n\treturn m[0] + B / A * (m[1] - m[0]);\n}\nbool intersectSP(const L &s, const P &p) {return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < 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;}\n\nstruct Node{\n\tint id;\n\tdouble dir;\n\tdouble cost;\n\tNode(int id,double dir,double cost) : id(id),dir(dir),cost(cost){}\n};\nbool operator <(const Node &a,const Node &b){\n\treturn a.cost > b.cost;\n}\n\ndouble PI = acos(-1);\ndouble fix(double x){\n\twhile( x >= 2 * PI ) x -= 2 * PI;\n\twhile( x < 0) x += 2 * PI;\n\treturn x;\n}\nint main(){\n\tint n;\n\twhile(cin >> n && n){\n\t\tL l[n];\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\tcin >> l[i][0] >> l[i][1];\n\t\t}\n\t\tvector<P> tar,tar_;\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\ttar.push_back(l[i][0]);\n\t\t\ttar.push_back(l[i][1]);\n\t\t\tfor(int j = 0 ; j < n ; j++){\n\t\t\t\tif( intersectSS(l[i],l[j]) ) tar.push_back(crosspoint(l[i],l[j]));\n\t\t\t}\n\t\t}\n\t\t\n\t\tP s,g;\n\t\tcin >> s >> g;\n\t\ttar.push_back(s);\n\t\ttar.push_back(g);\n\t\tsort(tar.begin(),tar.end());\n\t\tfor(int i = 0 ; i < tar.size() ; i++)\n\t\t\tif( !i || abs(tar[i-1]-tar[i]) > EPS ) tar_.push_back(tar[i]);\n\t\ttar = tar_;\n\t\t\n\t\tvector< vector<int> > connect(tar.size());\n\t\tfor(int i = 0 ; i < tar.size() ; i++){\n\t\t\tfor(int j = i+1 ; j < tar.size() ; j++){\n\t\t\t\tfor(int k = 0 ; k < n ; k++){\n\t\t\t\t\tif( intersectSP(l[k],tar[i]) && intersectSP(l[k],tar[j]) ){\n\t\t\t\t\t\tconnect[i].push_back(j);\n\t\t\t\t\t\tconnect[j].push_back(i);\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\tpriority_queue<Node> Q;\n\t\tfor(int i = 0 ; i < tar.size() ; i++)\n\t\t\tif( abs(tar[i]-s) < EPS ){\n\t\t\t\tQ.push(Node(i,-114514,0));\n\t\t\t}\n\t\t\n\t\tmap< pair<int,long long> , int> done;\n\t\tdouble res = -1;\n\t\twhile( Q.size() ){\n\t\t\tNode q = Q.top(); Q.pop();\n\t\t\tif( done[make_pair(q.id,(long long)(q.dir*10000000))]++ ) continue;\n\t\t\tP my = tar[q.id];\n\t\t\tif( abs(my-g) < EPS ){\n\t\t\t\tres = q.cost;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfor(int i = 0 ; i < connect[q.id].size() ; i++){\n\t\t\t\tint eid = connect[q.id][i];\n\t\t\t\tP ene = tar[eid];\n\t\t\t\tene -= my;\n\t\t\t\tdouble rad = atan2(ene.imag(),ene.real());\n\t\t\t\trad = fix(rad);\n\t\t\t\tdouble diff = fabs(q.dir-rad);\n\t\t\t\tdiff = min(2*PI-diff,diff);\n\t\t\t\t\n\t\t\t\tif( q.dir == -114514 ) diff = 0;\n\t\t\t\tQ.push(Node(eid,rad,q.cost+diff));\n\t\t\t}\n\t\t}\n\t\tif( res < 0 ){\n\t\t\tcout << -1 << endl;\n\t\t}else{\n\t\t\tprintf(\"%.10lf\\n\",res*180/PI);\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1440,
"score_of_the_acc": -0.2058,
"final_rank": 3
},
{
"submission_id": "aoj_1033_642779",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cstdio>\n#include <cmath>\n#include <complex>\n#include <vector>\n#include <set>\n#include <queue>\nusing namespace std;\n\ntypedef complex<double> P;\ntypedef pair<P,P> L;\ntypedef vector<vector<vector<double> > > mat;\n\nconst int INF = 1 << 29;\nconst double EPS = 1e-7;\n\nnamespace std{\n bool operator == (const P &a, const P &b){\n return fabs(real(a-b)) < EPS && fabs(imag(a-b)) < EPS;\n }\n}\n\nstruct data{\n P p;\n set<int> s;\n data(P p):p(p){s.clear();}\n};\n\nstruct state{\n int prev,now;\n double cost;\n state(int p=0, int n=0, double c=0):prev(p),now(n),cost(c){}\n bool operator < (const state &s) const {\n return cost > s.cost;\n }\n};\n\nint n;\nL l[50];\nP s, g;\nvector<data> v;\nmat cost;\n\n\ndouble dot(P a, P b){ return real(conj(a)*b); }\n\ndouble cross(P a, P b){ return imag(conj(a)*b); }\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;\n if(norm(b) < norm(c)) return -2;\n return 0;\n}\n\nbool isIntersect(L s1, L s2){\n return ( ccw(s1.first,s1.second,s2.first) * ccw(s1.first,s1.second,s2.second) <= 0 &&\n ccw(s2.first,s2.second,s1.first) * ccw(s2.first,s2.second,s1.second) <= 0 );\n}\n\nP crossPoint(pair<P,P> l, pair<P,P> 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 makeP(){\n v.clear();\n\n for(int i=0;i<n;i++){\n bool f=false,f2=false;\n for(int j=0;j<v.size();j++){\n if(v[j].p == l[i].first){\n v[j].s.insert(i);\n f = true;\n }\n if(v[j].p == l[i].second){\n v[j].s.insert(i);\n f2 = true;\n }\n }\n if(!f){\n v.push_back(data(l[i].first));\n v[v.size()-1].s.insert(i);\n }\n if(!f2){\n v.push_back(data(l[i].second));\n v[v.size()-1].s.insert(i);\n }\n\n for(int j=i+1;j<n;j++){\n if(!isIntersect(l[i],l[j])) continue;\n P p = crossPoint(l[i],l[j]);\n f = false;\n for(int k=0;k<v.size();k++){\n if(v[k].p == p){\n v[k].s.insert(i);\n v[k].s.insert(j);\n f = true;\n break;\n }\n }\n if(!f){\n v.push_back(data(p));\n v[v.size()-1].s.insert(i);\n v[v.size()-1].s.insert(j);\n }\n }\n }\n}\n\ndouble calcCost(P p1, P p2, P p3){\n double A = abs(p2-p3);\n double B = abs(p3-p1);\n double C = abs(p1-p2);\n return 180.0 - acos((B*B + C*C - A*A) / (2.0 * B * C)) * 180.0 / M_PI;\n};\n\nvoid makeCost(){\n cost.assign(v.size(), vector<vector<double> >(v.size(), vector<double>(v.size(),(double)INF)));\n for(int i=0;i<v.size();i++){\n for(int j=0;j<v.size();j++){\n if(i == j) continue;\n\n bool f = false;\n for(int k=0;k<n;k++){\n if(v[i].s.find(k) != v[i].s.end() && v[j].s.find(k) != v[j].s.end()){\n f = true;\n break;\n }\n }\n if(!f) continue;\n\n for(int k=0;k<v.size();k++){\n if(i == k || j == k) continue;\n\n f = false;\n for(int l=0;l<n;l++){\n if(v[k].s.find(l) != v[k].s.end() && v[j].s.find(l) != v[j].s.end()){\n f = true;\n break;\n }\n }\n if(f) cost[i][j][k] = calcCost(v[j].p, v[i].p, v[k].p);\n }\n }\n }\n}\n\nvoid solve(){\n priority_queue<state> Q;\n state u,u2;\n vector<vector<double> > d(v.size(), vector<double>(v.size(), (double)INF));\n\n if(s == g){\n cout << 0 << endl;\n return;\n }\n\n for(int i=0;i<v.size();i++){\n if(s == v[i].p){\n u.prev = i;\n break;\n }\n }\n for(int i=0;i<v.size();i++){\n for(set<int>::iterator it = v[u.prev].s.begin(); it != v[u.prev].s.end(); it++){\n if(i != u.prev && v[i].s.find(*it) != v[i].s.end()){\n u.now = i;\n d[u.prev][i] = 0;\n Q.push(u);\n }\n }\n }\n\n while(!Q.empty()){\n u = Q.top();\n Q.pop();\n\n if(v[u.now].p == g){\n printf(\"%.7f\\n\",u.cost);\n return;\n }\n\n for(int i=0;i<v.size();i++){\n u2 = state(u.now, i, d[u.prev][u.now] + cost[u.prev][u.now][i]);\n if(u2.cost < d[u.now][i]){\n d[u.now][i] = u2.cost;\n Q.push(u2);\n }\n }\n }\n cout << -1 << endl;\n}\n\nint main(){\n while(cin >> n && n){\n double x,y,x2,y2;\n for(int i=0;i<n;i++){\n double x,y,x2,y2;\n cin >> x >> y >> x2 >> y2;\n l[i] = L(P(x,y),P(x2,y2));\n }\n cin >> x >> y >> x2 >> y2;\n s = P(x,y);\n g = P(x2,y2);\n\n makeP();\n makeCost();\n solve();\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3244,
"score_of_the_acc": -0.4442,
"final_rank": 8
},
{
"submission_id": "aoj_1033_642778",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cstdio>\n#include <cmath>\n#include <complex>\n#include <vector>\n#include <set>\n#include <queue>\nusing namespace std;\n\ntypedef complex<double> P;\ntypedef pair<P,P> L;\ntypedef vector<vector<vector<double> > > mat;\n\nconst int INF = 1 << 29;\nconst double EPS = 1e-7;\n\nnamespace std{\n bool operator == (const P &a, const P &b){\n return fabs(real(a-b)) < EPS && fabs(imag(a-b)) < EPS;\n }\n}\n\nstruct data{\n P p;\n set<int> s;\n data(P p):p(p){s.clear();}\n};\n\nstruct state{\n int prev,now;\n double cost;\n state(int p=0, int n=0, double c=0):prev(p),now(n),cost(c){}\n bool operator < (const state &s) const {\n return cost > s.cost;\n }\n};\n\nint n;\nL l[50];\nP s, g;\nvector<data> v;\nmat cost;\n\n\ndouble dot(P a, P b){ return real(conj(a)*b); }\n\ndouble cross(P a, P b){ return imag(conj(a)*b); }\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;\n if(norm(b) < norm(c)) return -2;\n return 0;\n}\n\nbool isIntersect(L s1, L s2){\n return ( ccw(s1.first,s1.second,s2.first) * ccw(s1.first,s1.second,s2.second) <= 0 &&\n ccw(s2.first,s2.second,s1.first) * ccw(s2.first,s2.second,s1.second) <= 0 );\n}\n\nP crossPoint(pair<P,P> l, pair<P,P> 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 makeP(){\n v.clear();\n\n for(int i=0;i<n;i++){\n bool f=false,f2=false;\n for(int j=0;j<v.size();j++){\n if(v[j].p == l[i].first){\n v[j].s.insert(i);\n f = true;\n }\n if(v[j].p == l[i].second){\n v[j].s.insert(i);\n f2 = true;\n }\n }\n if(!f){\n v.push_back(data(l[i].first));\n v[v.size()-1].s.insert(i);\n }\n if(!f2){\n v.push_back(data(l[i].second));\n v[v.size()-1].s.insert(i);\n }\n\n for(int j=i+1;j<n;j++){\n if(!isIntersect(l[i],l[j])) continue;\n P p = crossPoint(l[i],l[j]);\n f = false;\n for(int k=0;k<v.size();k++){\n if(v[k].p == p){\n v[k].s.insert(i);\n v[k].s.insert(j);\n f = true;\n break;\n }\n }\n if(!f){\n v.push_back(data(p));\n v[v.size()-1].s.insert(i);\n v[v.size()-1].s.insert(j);\n }\n }\n }\n}\n\ndouble calcCost(P p1, P p2, P p3){\n double A = abs(p2-p3);\n double B = abs(p3-p1);\n double C = abs(p1-p2);\n return 180.0 - acos((B*B + C*C - A*A) / (2.0 * B * C)) * 180.0 / M_PI;\n};\n\nvoid makeCost(){\n cost.assign(v.size(), vector<vector<double> >(v.size(), vector<double>(v.size(),(double)INF)));\n for(int i=0;i<v.size();i++){\n for(int j=0;j<v.size();j++){\n if(i == j) continue;\n\n bool f = false;\n for(int k=0;k<n;k++){\n if(v[i].s.find(k) != v[i].s.end() && v[j].s.find(k) != v[j].s.end()){\n f = true;\n break;\n }\n }\n if(!f) continue;\n\n for(int k=0;k<v.size();k++){\n if(i == k || j == k) continue;\n\n f = false;\n for(int l=0;l<n;l++){\n if(v[k].s.find(l) != v[k].s.end() && v[j].s.find(l) != v[j].s.end()){\n f = true;\n break;\n }\n }\n if(f) cost[i][j][k] = calcCost(v[j].p, v[i].p, v[k].p);\n }\n }\n }\n}\n\nvoid solve(){\n priority_queue<state> Q;\n state u,u2;\n vector<vector<double> > d(v.size(), vector<double>(v.size(), (double)INF));\n\n if(s == g){\n //cout << 0 << endl;\n //return;\n }\n\n for(int i=0;i<v.size();i++){\n if(s == v[i].p){\n u.prev = i;\n break;\n }\n }\n for(int i=0;i<v.size();i++){\n for(set<int>::iterator it = v[u.prev].s.begin(); it != v[u.prev].s.end(); it++){\n if(i != u.prev && v[i].s.find(*it) != v[i].s.end()){\n u.now = i;\n d[u.prev][i] = 0;\n Q.push(u);\n }\n }\n }\n\n while(!Q.empty()){\n u = Q.top();\n Q.pop();\n\n if(v[u.now].p == g){\n printf(\"%.7f\\n\",u.cost);\n return;\n }\n\n for(int i=0;i<v.size();i++){\n u2 = state(u.now, i, d[u.prev][u.now] + cost[u.prev][u.now][i]);\n if(u2.cost < d[u.now][i]){\n d[u.now][i] = u2.cost;\n Q.push(u2);\n }\n }\n }\n cout << -1 << endl;\n}\n\nint main(){\n while(cin >> n && n){\n double x,y,x2,y2;\n for(int i=0;i<n;i++){\n double x,y,x2,y2;\n cin >> x >> y >> x2 >> y2;\n l[i] = L(P(x,y),P(x2,y2));\n }\n cin >> x >> y >> x2 >> y2;\n s = P(x,y);\n g = P(x2,y2);\n\n makeP();\n makeCost();\n solve();\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3244,
"score_of_the_acc": -0.4442,
"final_rank": 8
},
{
"submission_id": "aoj_1033_641253",
"code_snippet": "#include<iostream>\n#include<sstream>\n#include<algorithm>\n#include<set>\n#include<map>\n#include<queue>\n#include<complex>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cassert>\n#include<iomanip>\n\n#define rep(i,n) for(int i=0;i<(int)n;i++)\n#define all(c) (c).begin(),(c).end()\n#define mp make_pair\n#define pb push_back\n#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)\n#define dbg(x) cerr<<__LINE__<<\": \"<<#x<<\" = \"<<(x)<<endl\n#define F first\n#define S second\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int,int> pi;\nconst int inf = (int)1e9;\nconst double EPS = 1e-8, 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\tbool operator==(const P &a, const P &b){\n\t\treturn abs(a - b) < EPS;\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;\n\ninline int ccw(P a, P b, P c) {\n\tb -= a; c -= a;\n\tif(cross(b, c) > EPS) return +1;\t\t// counter clockwise\n\tif(cross(b, c) < -EPS) return -1;\t\t// clockwise\n\tif(dot(b, c) < -EPS) return +2;\t\t// c--a--b on line\n\tif(norm(b) + EPS < norm(c)) return -2;\t\t// 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}\nP crosspoint(const L &l, const L &m) {\n long double A = cross(l[1] - l[0], m[1] - m[0]);\n long 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 if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m[0] + B / A * (m[1] - m[0]);\n}\nint n;\nvector<vi> e;\n\nint main(){\n\twhile(cin >> n, n){\n\t\tvector<L> ls;\n\t\tP s, t;\n\t\trep(i, n){\n\t\t\tint x, y, X, Y;\n\t\t\tcin >> x >> y >> X >> Y;\n\t\t\tls.pb(L(P(x, y), P(X, Y)));\n\t\t\tif(ls[i][1] < ls[i][0]) swap(ls[i][0], ls[i][1]);\n\t\t}\n\t\tcin >> s.real() >> s.imag() >> t.real() >> t.imag();\n\t\t\n\t\tbool er[50] = {};\n\t\twhile(1){\n\t\t\tbool update = 0;\n\t\t\trep(i, n) if(!er[i]) rep(j, i) if(!er[j]){\n\t\t\t\tif(abs(cross(ls[i][0] - ls[i][1], ls[j][0] - ls[j][1])) > EPS) continue;\n\t\t\t\tbool ok = 0;\n\t\t\t\trep(k, 2) rep(l, 2){\n\t\t\t\t\tif(ccw(ls[k ? i : j][l], ls[k ? j : i][0], ls[k ? j : i][1]) == 2) ok = 1;\n\t\t\t\t\tif(ls[i][k] == ls[j][l]) ok = 1;\n\t\t\t\t}\n\t\t\t\tif(!ok) continue;\n\t\t\t\t\n\t\t\t\tls[i][0] = min(ls[i][0], ls[j][0]);\n\t\t\t\tls[i][1] = max(ls[i][1], ls[j][1]);\n\t\t\t\ter[j] = 1;\n\t\t\t}\n\t\t\tif(!update) break;\n\t\t}\n\t\tvector<L> tmp;\n\t\trep(i, n) if(!er[i]) tmp.pb(ls[i]);\n\t\tls = tmp;\n\t\t\n\t\tn = ls.size();\n\t\tmap<P, int> id;\n\t\tG ps;\n\t\trep(i, n) rep(j, i) if(intersectSS(ls[i], ls[j])){\n\t\t\tP p = crosspoint(ls[i], ls[j]);\n\t\t\tif(!id.count(p)) id[p] = ps.size(), ps.pb(p);\n\t\t}\n\t\tif(!id.count(s)) id[s] = ps.size(), ps.pb(s);\n\t\tif(!id.count(t)) id[t] = ps.size(), ps.pb(t);\n\t\t\n\t\tint m = ps.size();\n\t\te.clear(); e.resize(m);\n\t\trep(i, n){\n\t\t\tvi v;\n\t\t\trep(j, m) if(ps[j] == ls[i][0] || ps[j] == ls[i][1] ||\n\t\t\t\tccw(ps[j], ls[i][0], ls[i][1]) == 2) v.pb(j);\n\t\t\trep(j, v.size()) rep(k, j) e[v[j]].pb(v[k]), e[v[k]].pb(v[j]);\n\t\t}\n\t\t\n\t\tset<pi> v;\n\t\tpriority_queue<pair<long double, pi> > q;\n\t\teach(i, e[id[s]]){\n\t\t\tq.push(mp(0, mp(*i, id[s])));\n\t\t}\n\t\twhile(!q.empty()){\n\t\t\tint c = q.top().S.F, p = q.top().S.S;\n\t\t\tlong double co = q.top().F;\n\t\t\tq.pop();\n\t\t\tif(v.count(mp(c, p))) continue;\n\t\t\tv.insert(mp(c, p));\n\t\t\tif(ps[c] == t){\n\t\t\t\tcout << fixed << setprecision(20) << -co * 180 / PI << endl;\n\t\t\t\tgoto END;\n\t\t\t}\n\t\t\t\n\t\t\teach(i, e[c]) if(ps[*i] != ps[c] && !v.count(mp(*i, c))){\n\t\t\t\tlong double a = arg((ps[*i] - ps[c]) / (ps[c] - ps[p]));\n\t\t\t\tq.push(mp(co - abs(a), mp(*i, c)));\n\t\t\t}\n\t\t}\n\t\tcout << \"-1\" << endl; END:;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1436,
"score_of_the_acc": -0.1285,
"final_rank": 1
},
{
"submission_id": "aoj_1033_111116",
"code_snippet": "#include<complex>\n#include<vector>\n#include<set>\n#include<iostream>\n#include<stack>\n#include<cmath>\n#include<queue>\n\n#define FRONT 0x01\n#define RIGHT 0x02\n#define BACK 0x04\n#define LEFT 0x08\n#define OVER 0x10\n\n#define CIRCLE_SAME 0x01\n#define CIRCLE_CONTAIN 0x02\n#define CIRCLE_NO_CROSS 0x04\n#define CIRCLE_ONE_CROSS 0x08\n#define CIRCLE_ONE_INSIDE_CROSS 0x10\n#define CIRCLE_TWO_CROSS 0x20\n\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 eps = 1.0e-6;\nconst double pi = acos(-1.0);\nconst double infty = 1e40;\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 lt(elem a, elem b){ return !eq(a,b) && a < b; }\nbool leq(elem a, elem b){ return eq(a,b) || a < b; }\nbool gt(elem a, elem b){ return !eq(a,b) && a > b; }\nbool geq(elem a, elem b){ return eq(a,b) || a > b; }\nbool ltz(elem a){ return lt( a, 0 ); }\nbool gtz(elem a){ return gt( a, 0 ); }\nbool eqv(vec a, vec b){ return eq( abs(b-a),0); }\nbool is_zv(vec v){ return eq(abs(v),0); }\nelem emax(elem a, elem b){ return gt(a,b)?a:b; }\nelem emin(elem a, elem b){ return lt(a,b)?a:b; }\n\n// _Iy[^\nbool far(point a, point b){ return gtz( abs(b-a) ); }\nbool near(point a, point b){ return leq( 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(lt(ret,0))ret+=2*pi;\n if(gt(ret,2*pi))ret-=2*pi;\n if(eq(ret,2*pi))ret=0;\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( ltz( dot(s.sc-s.fr,x-s.fr) ) ) return abs(x-s.fr);\n if( ltz( dot(s.fr-s.sc,x-s.sc) ) ) 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Éæé\nint ccw(point a, point b, point x){\n b -= a;\n x -= a;\n // if( is_zv(b) || is_zv( x ) ) return ERROR;\n if( gtz( cross(b,x) ) ) return LEFT;\n if( ltz( cross(b,x) ) ) return RIGHT;\n if( ltz( dot(b,x) ) ) return BACK;\n if( lt( abs(b), abs(x) ) ) return FRONT;\n return OVER;\n}\n\n// üªÌð·»è\nbool intersectedSS(seg a, seg b)\n{\n if( ccw(a.fr,a.sc,b.fr)&OVER || ccw(a.fr,a.sc,b.sc)&OVER ) return true;\n return\n ( ccw(a.fr,a.sc,b.fr) | ccw(a.fr,a.sc,b.sc) ) == (LEFT|RIGHT) &&\n ( ccw(b.fr,b.sc,a.fr) | ccw(b.fr,b.sc,a.sc) ) == (LEFT|RIGHT) ;\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\nstruct Node{\n point p;\n vector<int> con;\n Node(){}\n Node(point p):p(p){}\n};\n\ntypedef vector<Node> Graph;\n\nstruct State{\n int prev;\n int now;\n double cost;\n State(int prev, int now, double cost):prev(prev),now(now),cost(cost){}\n bool operator>(const State &t)const{\n return cost > t.cost;\n }\n};\n\ndouble weight(int pre, int now, int next, const Graph &G){\n if( now == 0 ) return 0;\n vec a(G[now].p-G[pre].p);\n vec b(G[next].p-G[now].p);\n double ret = varg( a, b );\n // assert(ret>=0);\n return gt(ret,pi)?2*pi-ret:ret;\n}\n\ndouble dijkstra(int st, const Graph &G){\n double ret = infty;\n priority_queue< State, vector<State>, greater<State> > pq;\n bool vis[G.size()+1][G.size()];\n double C[G.size()+1][G.size()];\n for(int i = 0; i < G.size()+1; ++i){\n for(int j = 0; j < G.size(); ++j){\n vis[i][j]=false;\n C[i][j]=infty;\n }\n }\n \n pq.push( State(G.size(),st,0.0) );\n C[G.size()][st]=0;\n while(!pq.empty()){\n State now = pq.top(); pq.pop();\n \n //cout << \" PREV : \" << now.prev << \" NOW : \" << now.now << \" COST : \" << now.cost << endl;\n vis[now.prev][now.now] = false;\n \n /*\n if( vis[ now.prev ][ now.now ] ) continue;\n else{\n vis[ now.prev ][ now.now ] =true;\n if( now.now == 1 ){\n\t//ret = emin( ret, now.cost );\n\tcontinue;\n }\n }\n */\n \n const vector<int> &con = G[now.now].con;\n for(int i = 0; i < con.size(); ++i){\n int nextid = con[i];\n double newcost = now.cost + weight(now.prev, now.now, nextid, G);\n if( lt( newcost, C[now.now][nextid] ) ){\n\tC[now.now][nextid] = newcost;\n\tif( !vis[now.now][nextid] ){\n\t vis[now.now][nextid]=true;\n\t State next( now.now, nextid, newcost );\n\t pq.push( next );\n\t}\n }\n }\n \n }\n\n for(int i = 0; i < G.size()+1; ++i){\n ret = emin( ret, C[i][1] );\n }\n return ret;\n}\n\nstruct Point{\n point p;\n bool operator<(const Point &t)const{\n return eq(p.real(),t.p.real()) ? lt( p.imag(), t.p.imag() ) : lt(p.real(),t.p.real());\n }\n Point ():p(0,0){}\n Point (point p):p(p){}\n};\n\nint main(){\n while(true){\n int n;\n cin >> n;\n if ( n == 0 ) break;\n Graph G;\n set<Point> exist_intersection;\n vector<seg> segs;\n \n for(int i = 0; i < n; ++i){\n elem x1,y1,x2,y2;\n cin >> x1 >> y1 >> x2 >> y2;\n segs.push_back( seg(point(x1,y1),point(x2,y2)) );\n }\n\n elem sx,sy,gx,gy;cin>>sx>>sy>>gx>>gy;\n G.push_back(point(sx,sy));\n exist_intersection.insert( Point(point(sx,sy)) );\n if(exist_intersection.find(Point(point(gx,gy)))==exist_intersection.end()){\n G.push_back(point(gx,gy));\n exist_intersection.insert(Point(point(gx,gy)));\n }else{\n printf(\"0.0\\n\");continue;\n }\n\n for(int i = 0; i < segs.size(); ++i){\n if( exist_intersection.find(Point(segs[i].fr))==exist_intersection.end()){\n\texist_intersection.insert(Point(segs[i].fr));\n\tG.push_back( segs[i].fr );\n }\n if( exist_intersection.find(Point(segs[i].sc))==exist_intersection.end()){\n\texist_intersection.insert(Point(segs[i].sc));\n\tG.push_back( segs[i].sc );\n }\n for(int j = 0; j < segs.size(); ++j){\n\tif( i != j ){\n\t point tmp;\n\t if( intersectionSS( segs[i], segs[j], tmp ) ){\n\t if( exist_intersection.find(Point(tmp)) == exist_intersection.end() ){\n\t exist_intersection.insert( Point(tmp) );\n\t G.push_back( Node(tmp) );\n\t }\n\t }\n\t}\n }\n }\n\n for(int i = 0; i < segs.size(); ++i){\n for(int j = 0; j < G.size(); ++j){\n\tfor(int k = 0; k < G.size(); ++k){\n\t if( j != k ){\n\t if( ccw( segs[i].fr, segs[i].sc, G[j].p ) == OVER &&\n\t\tccw( segs[i].fr, segs[i].sc, G[k].p ) == OVER ){\n\t //cout << G[j].p << ' ' << G[k].p << endl;\n\t G[j].con.push_back( k );\n\t G[k].con.push_back( j );\n\t }\n\t }\n\t}\n }\n }\n \n elem ans = deg( dijkstra( 0, G ) );\n if( geq( ans, infty ) ){\n printf(\"-1\\n\");\n }else{\n printf(\"%.11lf\\n\",ans);\n }\n \n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 0,
"score_of_the_acc": -0.1538,
"final_rank": 2
},
{
"submission_id": "aoj_1033_81069",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<vector>\n#include<algorithm>\n#include<complex>\n#include<cmath>\nusing namespace std;\n\n#define REP(i,N) for(int i=0;i<(int)(N);++i)\n#define ALL(v) (v).begin(),(v).end()\n\ntypedef complex<double> P;\nconst double EPS = 1e-10;\nconst double PI = 4.0 * atan2(1, 1);\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}\n\ninline double dot(P a, P b) {return real( conj(a)*b);}\ninline double cross(P a, P b) {return imag( conj(a)*b);}\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > EPS) return +1; // counter clockwise\n if (cross(b, c) < -EPS) return -1; // clockwise\n if (dot(b, c) < -EPS) return +2; // c--a--b on line\n if (norm(b) + EPS < norm(c)) return -2; // a--b--c on line\n return 0;\n}\n\nbool IsIntersectSS(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 IsIntersectSP(P a, P b, P c) {\n return (abs(a-c) + abs(c-b) < abs(a-b) + EPS);\n}\n\nP IntersectionLL(P a1,P a2,P b1, P b2) {\n double A = cross(b2 - b1, a2 - a1);\n double B = cross(b2 - b1, b2 - a1);\n if (abs(A) < EPS && abs(B) < EPS) return a1; // same line\n// if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return a1 + B / A * (a2 - a1);\n}\n\ntypedef vector<vector<int> > Graph;\n\nGraph Arrangement(const vector<P> &from, const vector<P> &to, vector<P> &ps) {\n REP(i, from.size()) {\n ps.push_back( from[i] );\n ps.push_back( to[i] );\n REP(j, i) {\n if( IsIntersectSS( from[i], to[i], from[j], to[j]) )\n ps.push_back( IntersectionLL(from[i], to[i], from[j], to[j]));\n }\n }\n sort(ALL(ps));\n ps.erase(unique(ALL(ps)), ps.end());\n Graph g(ps.size());\n\n REP(i, from.size()) {\n vector< pair<double, int> > onlines;\n REP(j, ps.size()) {\n if( IsIntersectSP(from[i], to[i], ps[j]) )\n onlines.push_back( make_pair(norm(from[i] - ps[j]), j) );\n }\n sort( ALL(onlines) );\n for(int j = 0; j + 1 < onlines.size(); j++) {\n int a = onlines[j].second;\n int b = onlines[j+1].second;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n }\n return g;\n}\n\ndouble memo[1024][1024];\nstruct State {\n int pos, prev;\n double cost;\n\n bool operator<(const State& t) const {\n return cost > t.cost;\n }\n double &ref() {\n return memo[pos][prev];\n }\n};\n\nint indexOf(const vector<P>& ps, P p) {\n REP(i, ps.size()) {\n if( norm( ps[i] - p ) < EPS )\n return i;\n }\n return -1;\n}\n\ndouble Arg(P a, P b, P c) {\n if( norm(b - a) < EPS ) return 0;\n// if( ccw(a, b, c) == 2 || ccw(a, b, c) == 0 ) {return 0;}\n double theta = arg( (c - b) / (b - a) );\n theta = abs(theta);\n// if( dot( b - a, c - b) < -EPS ) theta += PI / 2;\n return theta;\n}\n\ndouble solve(Graph &g, vector<P> &ps, int si, int gi) {\n REP(i, 1024) REP(j, 1024) memo[i][j] = 1e10;\n\n priority_queue< State > up;\n\n State s = (State){si, si,0};\n up.push(s);\n s.ref() = 0;\n while( !up.empty() ) {\n s = up.top(); up.pop();\n\n if( s.pos == gi )\n return s.cost;\n\n for(int i = 0; i < g[s.pos].size(); i++) {\n State next = s;\n next.pos = g[s.pos][i];\n next.prev = s.pos;\n next.cost += Arg( ps[s.prev], ps[s.pos], ps[next.pos] );\n if( next.ref() > next.cost + EPS ) {\n next.ref() = next.cost;\n up.push( next );\n }\n }\n }\n return -1;\n}\n\nint main() {\n for(;;) {\n int N; scanf(\"%d\", &N);\n if( N == 0 ) break;\n vector<P> from, to;\n REP(i, N) {\n int a, b, c, d;\n scanf(\"%d%d%d%d\", &a, &b, &c, &d);\n from.push_back( P(a, b) );\n to.push_back( P(c, d) );\n }\n int a, b, c, d;\n scanf(\"%d%d%d%d\", &a, &b, &c, &d);\n P start(a, b);\n P goal(c, d);\n\n vector<P> ps;\n Graph g = Arrangement(from, to, ps);\n\n int si = indexOf( ps, start );\n int gi = indexOf( ps, goal );\n \n double rad = solve(g, ps, si, gi);\n if( rad < -0.5 ) {\n cout << -1 << endl;\n } else {\n printf(\"%.8f\\n\", rad * 180 / PI);\n }\n }\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 9228,
"score_of_the_acc": -1.826,
"final_rank": 14
}
] |
aoj_1034_cpp
|
Problem F:
Line Puzzle
プログラミングでパズルを解いてみよう。
n
×
n
の数字が格子状に並んでいる。数字のいくつかは丸で囲まれており、これらを起点と呼ぶことにする。パズルのルールは以下のとおりである：
各起点から縦・横に進む１本の線を引く（斜めには引けない）。
通った数字の和が起点の数字と同じになるように線を伸ばす。
線は枝分かれしてはいけない。
線はすでに引かれた数字を通ることはできない（線は交差してはいけない）。
線は２個以上の起点を通ることはできない。
下図に示すように、パズルのゴールはすべての起点を使い、すべての数字に線を引くことである。
あなたの仕事は、パズルを解くプログラムを作成することである。
ただしこの問題では、与えられたパズルが解けるものかどうかを判定するだけでよい。
Input
入力は複数のデータセットからなる。各データセットの形式は以下のとおりである：
n
n
×
n
の数字
n
×
n
の数字が与えられるパズルを示し、起点の数字は負の数として与えられる。
n
が 0 のとき入力の終わりを示す。
n
は 3 以上 8 以下、起点以外の数字は 1 以上 50 以下、起点は -50 以上 -1 以下であると仮定してよい。また、入力されるパズルの性質として以下のことを仮定してよい：
与えられるパズルの各行、各列には最低でも１つの起点がある。
起点の個数は、全体の数字の個数 (
n
×
n
) の 20 % から 40 % 程度である。
Output
各データセットに対して、パズルが解けるものであれば "YES" を、そうでなければ "NO" と１行に出力せよ。
Sample Input
3
-3 1 1
2 -4 1
2 1 -1
3
-4 1 1
1 1 -6
1 -5 3
4
-8 6 -2 1
2 -7 -2 1
1 -1 1 1
1 1 1 -5
6
2 2 3 -7 3 2
1 -10 1 1 3 2
2 6 5 2 -6 1
3 4 -23 2 2 5
3 3 -6 2 3 7
-7 2 3 2 -5 -13
6
2 2 3 -7 3 2
1 -10 1 1 3 2
2 6 5 2 -6 1
3 4 -23 2 2 5
3 3 -6 2 3 7
-7 2 3 2 -5 -12
0
Output for the Sample Input
YES
NO
NO
YES
NO
|
[
{
"submission_id": "aoj_1034_8051261",
"code_snippet": "#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <stdio.h>\n#include <string>\n#include <vector>\nusing namespace std;\n\ntypedef long long ll;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntypedef pair<int, int> Point;\ntypedef pair<int, Point> SP;\ntypedef vector<vector<int>> Mat;\n\nconst int dx[] = {0, 1, 0, -1};\nconst int dy[] = {-1, 0, 1, 0};\n\nint n;\nMat mat;\nvector<vector<bool>> used;\nvector<SP> starts(0);\n\nbool dfs(int cur, int sum, int x, int y) {\n if (starts[cur].first == sum) {\n cur++;\n sum = 0;\n if (cur >= starts.size()) {\n return true;\n }\n x = starts[cur].second.second;\n y = starts[cur].second.first;\n } else if (starts[cur].first < sum) {\n return false;\n }\n\n for (int i = 0; i < 4; i++) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n\n if (0 <= nx && nx < n && 0 <= ny && ny < n && !used[ny][nx]) {\n used[ny][nx] = true;\n if (dfs(cur, sum + mat[ny][nx], nx, ny))\n return true;\n used[ny][nx] = false;\n }\n }\n return false;\n}\n\nvoid solve() {\n mat = Mat(n, vector<int>(n));\n used = vector<vector<bool>>(n, vector<bool>(n, false));\n starts.clear();\n int sum = 0;\n\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int a;\n cin >> a;\n sum += a;\n if (a < 0) {\n a *= -1;\n used[i][j] = true;\n starts.push_back(SP(a, Point(i, j)));\n }\n mat[i][j] = a;\n }\n }\n\n bool ret = false;\n\n if (sum != 0) {\n ret = false;\n } else if (starts.size() == 1) {\n ret = true;\n } else {\n sort(starts.begin(), starts.end(), greater<SP>());\n ret = dfs(0, 0, starts[0].second.second, starts[0].second.first);\n }\n\n cout << (ret ? \"YES\" : \"NO\") << endl;\n return;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (true) {\n cin >> n;\n if (n == 0)\n break;\n solve();\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3152,
"score_of_the_acc": -0.5051,
"final_rank": 9
},
{
"submission_id": "aoj_1034_8051260",
"code_snippet": "#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <stdio.h>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntypedef pair<int, int> Point;\ntypedef pair<int, Point> SP;\ntypedef vector<vector<int>> Mat;\nint dx[] = {0, 1, 0, -1};\nint dy[] = {-1, 0, 1, 0};\nint n;\nMat mat;\nvector<vector<bool>> used;\nvector<SP> starts(0);\nbool dfs(int cur, int sum, int x, int y) {\n if (starts[cur].first == sum) {\n cur++;\n sum = 0;\n if (cur >= starts.size()) {\n return true;\n }\n x = starts[cur].second.second;\n y = starts[cur].second.first;\n } else if (starts[cur].first < sum) {\n return false;\n }\n for (int i = 0; i < 4; i++) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n if (0 <= nx && nx < n && 0 <= ny && ny < n && !used[ny][nx]) {\n used[ny][nx] = true;\n if (dfs(cur, sum + mat[ny][nx], nx, ny))\n return true;\n used[ny][nx] = false;\n }\n }\n return false;\n}\nvoid solve() {\n mat = Mat(n, vector<int>(n));\n used = vector<vector<bool>>(n, vector<bool>(n, false));\n starts.clear();\n int sum = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int a;\n scanf(\"%d\", &a);\n sum += a;\n if (a < 0) {\n a *= -1;\n used[i][j] = true;\n starts.push_back(SP(a, Point(i, j)));\n }\n mat[i][j] = a;\n }\n }\n bool ret = false;\n if (sum != 0) {\n ret = false;\n } else if (starts.size() == 1) {\n ret = true;\n } else {\n sort(starts.begin(), starts.end(), greater<SP>());\n ret = dfs(0, 0, starts[0].second.second, starts[0].second.first);\n }\n puts(ret ? \"YES\" : \"NO\");\n return;\n}\nint main() {\n while (true) {\n scanf(\"%d\", &n);\n if (n == 0)\n break;\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3516,
"score_of_the_acc": -0.604,
"final_rank": 17
},
{
"submission_id": "aoj_1034_8051259",
"code_snippet": "#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <stdio.h>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntypedef pair<int, int> Point;\ntypedef pair<int, Point> SP;\ntypedef vector<vector<int>> Mat;\nint dx[] = {0, 1, 0, -1};\nint dy[] = {-1, 0, 1, 0};\nint n;\nMat mat;\nvector<vector<bool>> used;\nvector<SP> starts(0);\nbool dfs(int cur, int sum, int x, int y) {\n if (starts[cur].first == sum) {\n cur++;\n sum = 0;\n if (cur >= starts.size()) {\n return true;\n }\n x = starts[cur].second.second;\n y = starts[cur].second.first;\n } else if (starts[cur].first < sum) {\n return false;\n }\n for (int i = 0; i < 4; i++) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n if (0 <= nx && nx < n && 0 <= ny && ny < n && !used[ny][nx]) {\n used[ny][nx] = true;\n if (dfs(cur, sum + mat[ny][nx], nx, ny))\n return true;\n used[ny][nx] = false;\n }\n }\n return false;\n}\nvoid solve() {\n mat = Mat(n, vector<int>(n));\n used = vector<vector<bool>>(n, vector<bool>(n, false));\n starts.clear();\n int sum = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int a;\n scanf(\"%d\", &a);\n sum += a;\n if (a < 0) {\n a *= -1;\n used[i][j] = true;\n starts.push_back(SP(a, Point(i, j)));\n }\n mat[i][j] = a;\n }\n }\n bool ret = false;\n if (sum != 0) {\n ret = false;\n } else if (starts.size() == 1) {\n ret = true;\n } else {\n sort(starts.begin(), starts.end(), greater<SP>());\n ret = dfs(0, 0, starts[0].second.second, starts[0].second.first);\n }\n printf(\"%s\\n\", ret ? \"YES\" : \"NO\");\n return;\n}\nint main() {\n while (true) {\n scanf(\"%d\", &n);\n if (n == 0)\n break;\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3192,
"score_of_the_acc": -0.5159,
"final_rank": 10
},
{
"submission_id": "aoj_1034_8051257",
"code_snippet": "#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <stdio.h>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntypedef pair<int, int> Point;\ntypedef pair<int, Point> SP;\ntypedef vector<vector<int>> Mat;\nint dx[] = {0, 1, 0, -1};\nint dy[] = {-1, 0, 1, 0};\nint n;\nMat mat;\nvector<vector<bool>> used;\nvector<SP> starts(0);\nbool dfs(int cur, int sum, int x, int y) {\n if (starts[cur].first == sum) {\n cur++;\n sum = 0;\n if (cur >= starts.size()) {\n return true;\n }\n x = starts[cur].second.second;\n y = starts[cur].second.first;\n } else if (starts[cur].first < sum) {\n return false;\n }\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 < n && !used[ny][nx]) {\n used[ny][nx] = true;\n if (dfs(cur, sum + mat[ny][nx], nx, ny))\n return true;\n used[ny][nx] = false;\n }\n }\n return false;\n}\nvoid solve() {\n mat = Mat(n, vector<int>(n));\n used = vector<vector<bool>>(n, vector<bool>(n, false));\n starts.clear();\n int sum = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int a;\n cin >> a;\n sum += a;\n if (a < 0) {\n a *= -1;\n used[i][j] = true;\n starts.push_back(SP(a, Point(i, j)));\n }\n mat[i][j] = a;\n }\n }\n bool ret = false;\n if (sum == 0 && starts.size() > 1) {\n sort(starts.begin(), starts.end(), greater<SP>());\n ret = dfs(0, 0, starts[0].second.second, starts[0].second.first);\n } else if (starts.size() == 1) {\n ret = true;\n }\n cout << (ret ? \"YES\" : \"NO\") << endl;\n return;\n}\nint main() {\n while (true) {\n cin >> n;\n if (n == 0)\n break;\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3132,
"score_of_the_acc": -0.4996,
"final_rank": 8
},
{
"submission_id": "aoj_1034_8051256",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> Point;\ntypedef pair<int, Point> SP;\ntypedef vector<vector<int>> Mat;\n\nint dx[] = {0, 1, 0, -1};\nint dy[] = {-1, 0, 1, 0};\n\nint n;\nMat mat;\nvector<vector<bool>> used;\nvector<SP> starts(0);\n\nbool dfs(int cur, int sum, int x, int y) {\n if (starts[cur].first == sum) {\n cur++;\n sum = 0;\n if (cur >= starts.size()) {\n return true;\n }\n x = starts[cur].second.second;\n y = starts[cur].second.first;\n } else if (starts[cur].first < sum) {\n return false;\n }\n\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 < n && !used[ny][nx]) {\n used[ny][nx] = true;\n if (dfs(cur, sum + mat[ny][nx], nx, ny))\n return true;\n used[ny][nx] = false;\n }\n }\n\n return false;\n}\n\nvoid solve() {\n mat = Mat(n, vector<int>(n));\n used = vector<vector<bool>>(n, vector<bool>(n, false));\n starts.clear();\n\n int sum = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int a;\n cin >> a;\n sum += a;\n if (a < 0) {\n a *= -1;\n used[i][j] = true;\n starts.push_back(SP(a, Point(i, j)));\n }\n mat[i][j] = a;\n }\n }\n\n bool ret = false;\n if (sum != 0) {\n ret = false;\n } else if (starts.size() == 1) {\n ret = true;\n } else {\n sort(starts.begin(), starts.end(), greater<SP>());\n ret = dfs(0, 0, starts[0].second.second, starts[0].second.first);\n }\n\n cout << (ret ? \"YES\" : \"NO\") << endl;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n\n while (true) {\n cin >> n;\n if (n == 0) break;\n\n solve();\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3304,
"score_of_the_acc": -0.5464,
"final_rank": 12
},
{
"submission_id": "aoj_1034_8051255",
"code_snippet": "#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <stdio.h>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntypedef pair<int, int> Point;\ntypedef pair<int, Point> SP;\ntypedef vector<vector<int>> Mat;\nint dx[] = {0, 1, 0, -1};\nint dy[] = {-1, 0, 1, 0};\nint n;\nMat mat;\nvector<vector<bool>> used;\nvector<SP> starts(0);\nbool dfs(int cur, int sum, int x, int y) {\n if (starts[cur].first == sum) {\n cur++;\n sum = 0;\n if (cur >= starts.size()) {\n return true;\n }\n x = starts[cur].second.second;\n y = starts[cur].second.first;\n } else if (starts[cur].first < sum) {\n return false;\n }\n for (int i = 0; i < 4; i++) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n if (0 <= nx && nx < n && 0 <= ny && ny < n && !used[ny][nx]) {\n used[ny][nx] = true;\n if (dfs(cur, sum + mat[ny][nx], nx, ny))\n return true;\n used[ny][nx] = false;\n }\n }\n return false;\n}\nvoid solve() {\n mat = Mat(n, vector<int>(n));\n used = vector<vector<bool>>(n, vector<bool>(n, false));\n starts.clear();\n int sum = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int a;\n scanf(\"%d\", &a);\n sum += a;\n if (a < 0) {\n a *= -1;\n used[i][j] = true;\n starts.push_back(SP(a, Point(i, j)));\n }\n mat[i][j] = a;\n }\n }\n bool ret = false;\n if (sum == 0) {\n if (starts.size() == 1) {\n ret = true;\n } else {\n sort(starts.begin(), starts.end(), greater<SP>());\n ret = dfs(0, 0, starts[0].second.second, starts[0].second.first);\n }\n }\n cout << (ret ? \"YES\" : \"NO\") << endl;\n return;\n}\nint main() {\n while (true) {\n scanf(\"%d\", &n);\n if (n == 0)\n break;\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3268,
"score_of_the_acc": -0.5366,
"final_rank": 11
},
{
"submission_id": "aoj_1034_8051253",
"code_snippet": "#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <stdio.h>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntypedef pair<int, int> Point;\ntypedef pair<int, Point> SP;\ntypedef vector<vector<int>> Mat;\nint dx[] = {0, 1, 0, -1};\nint dy[] = {-1, 0, 1, 0};\nint n;\nMat mat;\nvector<vector<bool>> used;\nvector<SP> starts(0);\nbool dfs(int cur, int sum, int x, int y) {\n if (starts[cur].first == sum) {\n cur++;\n sum = 0;\n if (cur >= starts.size()) {\n return true;\n }\n x = starts[cur].second.second;\n y = starts[cur].second.first;\n } else if (starts[cur].first < sum) {\n return false;\n }\n for (int i = 0; i < 4; i++) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n if (0 <= nx && nx < n && 0 <= ny && ny < n && !used[ny][nx]) {\n used[ny][nx] = true;\n if (dfs(cur, sum + mat[ny][nx], nx, ny))\n return true;\n used[ny][nx] = false;\n }\n }\n return false;\n}\nvoid solve() {\n mat = Mat(n, vector<int>(n));\n used = vector<vector<bool>>(n, vector<bool>(n, false));\n starts.clear();\n int sum = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int a;\n scanf(\"%d\", &a);\n sum += a;\n if (a < 0) {\n a *= -1;\n used[i][j] = true;\n starts.push_back(SP(a, Point(i, j)));\n }\n mat[i][j] = a;\n }\n }\n bool ret = false;\n if (sum != 0) {\n ret = false;\n } else if (starts.size() == 1) {\n ret = true;\n } else {\n sort(starts.begin(), starts.end(), greater<SP>());\n ret = dfs(0, 0, starts[0].second.second, starts[0].second.first);\n }\n printf(\"%s\\n\", ret ? \"YES\" : \"NO\");\n return;\n}\nint main() {\n while (true) {\n scanf(\"%d\", &n);\n if (n == 0)\n break;\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3396,
"score_of_the_acc": -0.5714,
"final_rank": 14
},
{
"submission_id": "aoj_1034_8051252",
"code_snippet": "#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <stdio.h>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntypedef pair<int, int> Point;\ntypedef pair<int, Point> SP;\ntypedef vector<vector<int>> Mat;\n\nint dx[] = {0, 1, 0, -1};\nint dy[] = {-1, 0, 1, 0};\nint n;\nMat mat;\nvector<vector<bool>> used;\nvector<SP> starts(0);\n\nbool dfs(int cur, int sum, int x, int y) {\n if (starts[cur].first == sum) {\n cur++;\n sum = 0;\n if (cur >= starts.size()) {\n return true;\n }\n x = starts[cur].second.second;\n y = starts[cur].second.first;\n } else if (starts[cur].first < sum) {\n return false;\n }\n for (int i = 0; i < 4; i++) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n if (0 <= nx && nx < n && 0 <= ny && ny < n && !used[ny][nx]) {\n used[ny][nx] = true;\n if (dfs(cur, sum + mat[ny][nx], nx, ny))\n return true;\n used[ny][nx] = false;\n }\n }\n return false;\n}\n\nvoid solve() {\n mat = Mat(n, vector<int>(n));\n used = vector<vector<bool>>(n, vector<bool>(n, false));\n starts.clear();\n int sum = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int a;\n cin >> a;\n sum += a;\n if (a < 0) {\n a *= -1;\n used[i][j] = true;\n starts.push_back(SP(a, Point(i, j)));\n }\n mat[i][j] = a;\n }\n }\n bool ret = false;\n if (sum != 0) {\n ret = false;\n } else if (starts.size() == 1) {\n ret = true;\n } else {\n sort(starts.begin(), starts.end(), greater<SP>());\n ret = dfs(0, 0, starts[0].second.second, starts[0].second.first);\n }\n cout << (ret ? \"YES\" : \"NO\") << endl;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n\n while (true) {\n cin >> n;\n if (n == 0)\n break;\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3356,
"score_of_the_acc": -0.5605,
"final_rank": 13
},
{
"submission_id": "aoj_1034_8051251",
"code_snippet": "#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <stdio.h>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntypedef pair<int, int> Point;\ntypedef pair<int, Point> SP;\ntypedef vector<vector<int>> Mat;\nint dx[] = {0, 1, 0, -1};\nint dy[] = {-1, 0, 1, 0};\nint n;\nMat mat;\nvector<vector<bool>> used;\nvector<SP> starts(0);\nbool dfs(int cur, int sum, int x, int y) {\n if (starts[cur].first == sum) {\n cur++;\n sum = 0;\n if (cur >= starts.size()) {\n return true;\n }\n x = starts[cur].second.second;\n y = starts[cur].second.first;\n } else if (starts[cur].first < sum) {\n return false;\n }\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 >= n || used[ny][nx]) continue;\n used[ny][nx] = true;\n if (dfs(cur, sum + mat[ny][nx], nx, ny)) return true;\n used[ny][nx] = false;\n }\n return false;\n}\nvoid solve() {\n mat = Mat(n, vector<int>(n));\n used = vector<vector<bool>>(n, vector<bool>(n, false));\n starts.clear();\n int sum = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int a;\n cin >> a;\n sum += a;\n if (a < 0) {\n a *= -1;\n used[i][j] = true;\n starts.push_back(SP(a, Point(i, j)));\n }\n mat[i][j] = a;\n }\n }\n bool ret = false;\n if (sum == 0 && starts.size() != 1) {\n sort(starts.begin(), starts.end(), greater<SP>());\n ret = dfs(0, 0, starts[0].second.second, starts[0].second.first);\n }\n cout << (ret ? \"YES\" : \"NO\") << endl;\n return;\n}\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n while (cin >> n && n) solve();\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3400,
"score_of_the_acc": -0.5725,
"final_rank": 15
},
{
"submission_id": "aoj_1034_8051250",
"code_snippet": "#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <stdio.h>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntypedef pair<int, int> Point;\ntypedef pair<int, Point> SP;\ntypedef vector<vector<int>> Mat;\nint dx[] = {0, 1, 0, -1};\nint dy[] = {-1, 0, 1, 0};\nint n;\nMat mat;\nvector<vector<bool>> used;\nvector<SP> starts(0);\nbool dfs(int cur, int sum, int x, int y) {\n if (starts[cur].first == sum) {\n cur++;\n sum = 0;\n if (cur >= starts.size()) {\n return true;\n }\n x = starts[cur].second.second;\n y = starts[cur].second.first;\n } else if (starts[cur].first < sum) {\n return false;\n }\n for (int i = 0; i < 4; i++) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n if (0 <= nx && nx < n && 0 <= ny && ny < n && !used[ny][nx]) {\n used[ny][nx] = true;\n if (dfs(cur, sum + mat[ny][nx], nx, ny))\n return true;\n used[ny][nx] = false;\n }\n }\n return false;\n}\nvoid solve() {\n mat = Mat(n, vector<int>(n));\n used = vector<vector<bool>>(n, vector<bool>(n, false));\n starts.clear();\n int sum = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int a;\n cin >> a;\n sum += a;\n if (a < 0) {\n a *= -1;\n used[i][j] = true;\n starts.push_back(SP(a, Point(i, j)));\n }\n mat[i][j] = a;\n }\n }\n bool ret = false;\n ;\n if (sum != 0) {\n ret = false;\n } else if (starts.size() == 1) {\n ret = true;\n } else {\n sort(starts.begin(), starts.end(), greater<SP>());\n ret = dfs(0, 0, starts[0].second.second, starts[0].second.first);\n }\n cout << (ret ? \"YES\" : \"NO\") << endl;\n return;\n}\nint main() {\n while (true) {\n cin >> n;\n if (n == 0)\n break;\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3456,
"score_of_the_acc": -0.5877,
"final_rank": 16
},
{
"submission_id": "aoj_1034_8051249",
"code_snippet": "#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <stdio.h>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntypedef pair<int, int> Point;\ntypedef pair<int, Point> SP;\ntypedef vector<vector<int>> Mat;\nint dx[] = {0, 1, 0, -1};\nint dy[] = {-1, 0, 1, 0};\nint n;\nMat mat;\nvector<vector<bool>> used;\nvector<SP> starts(0);\nbool dfs(int cur, int sum, int x, int y) {\n if (starts[cur].first == sum) {\n cur++;\n sum = 0;\n if (cur >= starts.size()) {\n return true;\n }\n x = starts[cur].second.second;\n y = starts[cur].second.first;\n } else if (starts[cur].first < sum) {\n return false;\n }\n for (int i = 0; i < 4; i++) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n if (0 <= nx && nx < n && 0 <= ny && ny < n && !used[ny][nx]) {\n used[ny][nx] = true;\n if (dfs(cur, sum + mat[ny][nx], nx, ny))\n return true;\n used[ny][nx] = false;\n }\n }\n return false;\n}\nvoid solve() {\n mat = Mat(n, vector<int>(n));\n used = vector<vector<bool>>(n, vector<bool>(n, false));\n starts.clear();\n int sum = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int a;\n cin >> a;\n sum += a;\n if (a < 0) {\n a *= -1;\n used[i][j] = true;\n starts.push_back(SP(a, Point(i, j)));\n }\n mat[i][j] = a;\n }\n }\n bool ret = false;\n ;\n if (sum != 0) {\n ret = false;\n } else if (starts.size() == 1) {\n ret = true;\n } else {\n ret = dfs(0, 0, starts[0].second.second, starts[0].second.first);\n }\n cout << (ret ? \"YES\" : \"NO\") << endl;\n return;\n}\nint main() {\n while (true) {\n cin >> n;\n if (n == 0)\n break;\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3376,
"score_of_the_acc": -0.3437,
"final_rank": 6
},
{
"submission_id": "aoj_1034_7936400",
"code_snippet": "#include <iostream>\n#include <map>\n#include <vector>\nusing namespace std;\ntypedef pair<int, int> P;\nint n;\nint t[10][10];\nlong long v;\nmap<long long, bool> m;\nvector<P> can;\nint dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1};\nbool rec(int id);\nbool dfs(int id, int y, int x, int sum) {\n if (sum == 0)\n return rec(id + 1);\n if (sum > 0)\n return false;\n for (int i = 0; i < 4; i++) {\n int ty = y + dy[i], tx = x + dx[i];\n if (ty < 0 || tx < 0 || n <= ty || n <= tx)\n continue;\n if ((v >> (ty * n + tx)) & 1LL || t[ty][tx] < 0)\n continue;\n v |= 1LL << (ty * n + tx);\n if (dfs(id, ty, tx, sum + t[ty][tx]))\n return true;\n v -= 1LL << (ty * n + tx);\n }\n return false;\n}\nbool rec(int id) {\n if (id == can.size())\n return true;\n if (m[v])\n return false;\n m[v] = true;\n int y = can[id].first, x = can[id].second;\n v |= 1LL << y * n + x;\n return dfs(id, y, x, t[y][x]);\n}\nint main() {\n while (cin >> n, n) {\n int sum = 0;\n can.clear();\n m.clear();\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++) {\n cin >> t[i][j];\n sum += t[i][j];\n if (t[i][j] < 0)\n can.push_back(P(i, j));\n }\n v = 0LL;\n cout << ((!sum && rec(0)) ? \"YES\\n\" : \"NO\\n\");\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 6200,
"score_of_the_acc": -1.2222,
"final_rank": 20
},
{
"submission_id": "aoj_1034_7936399",
"code_snippet": "#include <iostream>\n#include <map>\n#include <vector>\nusing namespace std;\ntypedef pair<int, int> P;\nint n;\nint t[10][10];\nlong long v;\nmap<long long, bool> m;\nvector<P> can;\nint dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1};\nbool rec(int id);\nbool dfs(int id, int y, int x, int sum) {\n if (sum == 0)\n return rec(id + 1);\n if (sum > 0)\n return false;\n for (int i = 0; i < 4; i++) {\n int ty = y + dy[i], tx = x + dx[i];\n if (ty < 0 || tx < 0 || n <= ty || n <= tx)\n continue;\n if ((v >> (ty * n + tx)) & 1LL || t[ty][tx] < 0)\n continue;\n v |= 1LL << (ty * n + tx);\n if (dfs(id, ty, tx, sum + t[ty][tx]))\n return true;\n v &= ~(1LL << (ty * n + tx));\n }\n return false;\n}\nbool rec(int id) {\n if (id == can.size())\n return true;\n if (m[v])\n return false;\n m[v] = true;\n int y = can[id].first, x = can[id].second;\n return dfs(id, y, x, t[y][x]);\n}\nint main() {\n while (cin >> n, n) {\n int sum = 0;\n can.clear();\n m.clear();\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++) {\n cin >> t[i][j];\n sum += t[i][j];\n if (t[i][j] < 0) {\n can.push_back(P(i, j));\n v |= 1LL << (i * n + j);\n }\n }\n v = 0LL;\n cout << ((!sum && rec(0)) ? \"YES\\n\" : \"NO\\n\");\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 6168,
"score_of_the_acc": -1.2135,
"final_rank": 19
},
{
"submission_id": "aoj_1034_7936398",
"code_snippet": "#include <cstring>\n#include <iostream>\n#include <vector>\nusing namespace std;\nint dx[] = {+1, -1, 0, 0};\nint dy[] = {0, 0, +1, -1};\nint tb[10][10];\nbool visited[10][10];\nint n, t, sum;\nvector<int> sx, sy;\nbool dfs(int x, int y, int s, int c, int m) {\n int tx, ty, ttx, tty, tc, tm, ts;\n for (int i = 0; i < 4; i++) {\n bool v = false;\n ts = s;\n tc = c;\n tx = x + dx[i];\n ty = y + dy[i];\n ttx = x;\n tty = y;\n tm = m + tb[tx][ty];\n if (tb[tx][ty] <= 0)\n continue;\n if (visited[tx][ty])\n continue;\n if (tm > 0)\n continue;\n if (tm == 0) {\n tc++;\n ts++;\n if (tc == sx.size()) {\n if (ts == n * n) {\n return true;\n } else {\n continue;\n }\n }\n ttx = tx;\n tty = ty;\n tx = sx[tc];\n ty = sy[tc];\n tm = tb[tx][ty];\n }\n visited[ttx][tty] = 1;\n visited[x][y] = 1;\n if (dfs(tx, ty, ts + 1, tc, tm))\n return true;\n visited[x][y] = 0;\n visited[ttx][tty] = 0;\n }\n return false;\n}\nint main() {\n while (cin >> n, n) {\n sum = 0;\n memset(visited, 0, sizeof(visited));\n sx.clear();\n sy.clear();\n for (int i = 0; i < 100; i++) {\n tb[i / 10][i % 10] = 0;\n }\n for (int i = 0; i < n * n; i++) {\n cin >> t;\n sum += t;\n tb[(i / n) + 1][(i % n) + 1] = t;\n if (t < 0) {\n sx.push_back((i / n) + 1);\n sy.push_back((i % n) + 1);\n }\n }\n if (sum != 0) {\n cout << \"NO\\n\";\n continue;\n }\n if (dfs(sx[0], sy[0], 1, 0, tb[sx[0]][sy[0]])) {\n cout << \"YES\\n\";\n } else {\n cout << \"NO\\n\";\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3024,
"score_of_the_acc": -0.2481,
"final_rank": 5
},
{
"submission_id": "aoj_1034_7936396",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\nint dx[] = {+1, -1, 0, 0};\nint dy[] = {0, 0, +1, -1};\nint tb[10][10];\nint tf[10][10];\nint n, t, sum;\nvector<int> sx, sy;\nbool dfs(int x, int y, int s, int c, int m) {\n int tx, ty, ts, tc, tm, f;\n for (int i = 0; i < 4; i++) {\n f = false;\n tc = c;\n ts = s + 1;\n tx = x + dx[i];\n ty = y + dy[i];\n tm = m + tb[tx][ty];\n if (tf[tx][ty] == 0)\n continue;\n if (tb[tx][ty] <= 0)\n continue;\n if (tm > 0)\n continue;\n if (tm == 0) {\n tc++;\n if (tc == sx.size()) {\n if (ts == n * n) {\n return true;\n } else {\n return false;\n }\n }\n ts++;\n tx = sx[tc];\n ty = sy[tc];\n tm = tb[tx][ty];\n f = true;\n tf[x + dx[i]][y + dy[i]] = 0;\n }\n tf[x][y] = 0;\n if (dfs(tx, ty, ts, tc, tm))\n return true;\n tf[x][y] = 1;\n if (f) {\n tf[x + dx[i]][y + dy[i]] = 1;\n }\n }\n return false;\n}\nint main() {\n while (cin >> n, n) {\n sum = 0;\n sx.clear();\n sy.clear();\n for (int i = 0; i < 100; i++) {\n tb[i / 10][i % 10] = 0;\n tf[i / 10][i % 10] = 1;\n }\n for (int i = 0; i < n * n; i++) {\n cin >> t;\n sum += t;\n tb[(i / n) + 1][(i % n) + 1] = t;\n if (t < 0) {\n sx.push_back((i / n) + 1);\n sy.push_back((i % n) + 1);\n }\n }\n if (sum != 0) {\n cout << \"NO\\n\";\n continue;\n }\n if (dfs(sx[0], sy[0], 1, 0, tb[sx[0]][sy[0]])) {\n cout << \"YES\\n\";\n } else {\n cout << \"NO\\n\";\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2944,
"score_of_the_acc": -0.2263,
"final_rank": 3
},
{
"submission_id": "aoj_1034_7936395",
"code_snippet": "#include <iostream>\nusing namespace std;\nconst int dy[] = {0, 1, -1, 0}, dx[] = {1, 0, 0, -1};\nint n, mas[8][8];\nbool used[8][8];\nbool isover(int &y, int &x) { return x < 0 || y < 0 || x >= n || y >= n; }\nbool dfs(int hoge, int y, int x, int sum) {\n if (hoge == 0 && sum == n * n)\n return true;\n bool ret = false;\n if (hoge < 0) {\n for (int i = 0; i < 4; i++) {\n int ny = y + dy[i], nx = x + dx[i];\n if (!isover(ny, nx) && mas[ny][nx] > 0 && !used[ny][nx]) {\n used[ny][nx] = true;\n ret += dfs(hoge + mas[ny][nx], ny, nx, sum + 1);\n used[ny][nx] = false;\n }\n }\n } else if (!hoge) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (mas[i][j] < 0 && !used[i][j]) {\n used[i][j] = true;\n ret += dfs(mas[i][j], i, j, sum + 1);\n used[i][j] = false;\n return ret;\n }\n }\n }\n }\n return ret;\n}\nint main() {\n while (cin >> n, n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n cin >> mas[i][j];\n }\n }\n cout << (dfs(0, 0, 0, 0) ? \"YES\" : \"NO\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3008,
"score_of_the_acc": -0.4659,
"final_rank": 7
},
{
"submission_id": "aoj_1034_7936394",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define Rep(i, n) for (int i = 0; i < n; i++)\nbool dfs(int, int);\nbool dfs2(int, int, const int, const int, int);\nint n, number[8][8];\nconst int dy[] = {0, 1, 0, -1}, dx[] = {1, 0, -1, 0};\nbool dfs2(int x, int y, const int basex, const int basey, int sub) {\n if (sub < 0)\n return false;\n if (sub == 0)\n return dfs(basex + 1, basey);\n Rep(i, 4) {\n int ny = y + dy[i], nx = x + dx[i];\n if (ny < 0 || ny >= n || nx < 0 || nx >= n || number[ny][nx] <= 0)\n continue;\n int next = number[ny][nx];\n number[ny][nx] = 0;\n if (dfs2(nx, ny, basex, basey, sub - next))\n return true;\n number[ny][nx] = next;\n }\n return false;\n}\nbool dfs(int x, int y) {\n if (y == n) {\n Rep(i, n) Rep(j, n) if (number[i][j] != 0) return false;\n return true;\n }\n if (x == n)\n return dfs(0, y + 1);\n if (number[y][x] >= 0)\n return dfs(x + 1, y);\n else {\n int prev = number[y][x];\n number[y][x] = 0;\n if (dfs2(x, y, x, y, -prev))\n return true;\n number[y][x] = prev;\n }\n return false;\n}\nint main() {\n while (cin >> n, n) {\n int ret = 0;\n Rep(i, n) {\n Rep(j, n) {\n cin >> number[i][j];\n ret += number[i][j];\n }\n }\n if (ret == 0 && dfs(0, 0))\n puts(\"YES\");\n else\n puts(\"NO\");\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2920,
"score_of_the_acc": -0.2198,
"final_rank": 2
},
{
"submission_id": "aoj_1034_7936379",
"code_snippet": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <vector>\nstruct P {\n int x, y;\n P(int x, int y) : x(x), y(y) {}\n};\nint num[10][10];\nbool visited[10][10];\nstd::vector<P> v;\nconst int dx[] = {1, 0, -1, 0};\nconst int dy[] = {0, 1, 0, -1};\nbool BackTrack(int x, int y, int index, int rest) {\n if (rest == 0) {\n if (index == v.size() - 1)\n return true;\n ++index;\n x = v[index].x;\n y = v[index].y;\n rest = -num[y][x];\n return BackTrack(x, y, index, rest);\n }\n bool res = false;\n for (int i = 0; i < 4; ++i) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n if (visited[ny][nx])\n continue;\n visited[ny][nx] = true;\n res = res || BackTrack(nx, ny, index, rest - num[ny][nx]);\n visited[ny][nx] = false;\n }\n return res;\n}\nint main() {\n int n, i, j, t;\n while (scanf(\"%d\", &n), n) {\n v.clear();\n memset(visited, 1, sizeof(visited));\n int check = 0;\n for (i = 1; i <= n; ++i) {\n for (j = 1; j <= n; ++j) {\n scanf(\"%d\", &t);\n num[i][j] = t;\n if (t < 0) {\n v.push_back(P(j, i));\n visited[i][j] = true;\n } else {\n visited[i][j] = false;\n }\n check += t;\n }\n }\n int x = v[0].x;\n int y = v[0].y;\n puts(check == 0 && BackTrack(x, y, 0, -num[y][x]) ? \"YES\" : \"NO\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 2588,
"score_of_the_acc": -1.0185,
"final_rank": 18
},
{
"submission_id": "aoj_1034_7936378",
"code_snippet": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <vector>\nstruct P {\n int x, y;\n P(int x, int y) : x(x), y(y) {}\n};\nint num[10][10];\nbool visited[10][10];\nstd::vector<P> v;\nconst int dx[] = {1, 0, -1, 0};\nconst int dy[] = {0, 1, 0, -1};\nbool BackTrack(int x, int y, int index, int rest) {\n if (rest < 0)\n return false;\n if (rest == 0) {\n if (index == v.size() - 1)\n return true;\n ++index;\n x = v[index].x;\n y = v[index].y;\n rest = -num[y][x];\n return BackTrack(x, y, index, rest);\n }\n for (int i = 0; i < 4; ++i) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n if (visited[ny][nx])\n continue;\n visited[ny][nx] = true;\n if (BackTrack(nx, ny, index, rest - num[ny][nx]))\n return true;\n visited[ny][nx] = false;\n }\n return false;\n}\nint main() {\n int n, i, j, t;\n while (scanf(\"%d\", &n), n) {\n v.clear();\n memset(visited, 1, sizeof(visited));\n int check = 0;\n for (i = 1; i <= n; ++i) {\n for (j = 1; j <= n; ++j) {\n scanf(\"%d\", &t);\n num[i][j] = t;\n if (t < 0) {\n v.push_back(P(j, i));\n visited[i][j] = true;\n } else {\n visited[i][j] = false;\n }\n check += t;\n }\n }\n int x = v[0].x;\n int y = v[0].y;\n puts(check == 0 && BackTrack(x, y, 0, -num[y][x]) ? \"YES\" : \"NO\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2520,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1034_2606823",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n\nint N,table[8][8];\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\nbool FLG,check[8][8];\n\nbool rangeCheck(int row,int col){\n\tif(row >= 0 && row <= N-1 && col >= 0 && col <= N-1)return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\nvoid dfs(int sum,int tmp_row,int tmp_col,int rest){\n\n\tif(FLG) return;\n\n\tif(sum == 0 && rest == 0){\n\t\tFLG = true;\n\t\treturn;\n\t}\n\n\tif(sum == 0){\n\n\t\tfor(int row = 0; row < N; row++){\n\t\t\tfor(int col = 0; col < N; col++){\n\t\t\t\tif(check[row][col])continue;\n\t\t\t\tif(table[row][col] < 0){\n\t\t\t\t\tcheck[row][col] = true;\n\t\t\t\t\tdfs(abs(table[row][col]),row,col,rest-1);\n\t\t\t\t\tcheck[row][col] = false;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t }else{\n\n\t\t for(int i = 0; i < 4; i++){\n\t\t\t int adj_row = tmp_row+diff_row[i];\n\t\t\t int adj_col = tmp_col+diff_col[i];\n\n\t\t\t if(rangeCheck(adj_row,adj_col) == false || check[adj_row][adj_col] == true || table[adj_row][adj_col] < 0 || sum < table[adj_row][adj_col])continue;\n\n\t\t\t check[adj_row][adj_col] = true;\n\t\t\t dfs(sum-table[adj_row][adj_col],adj_row,adj_col,rest-1);\n\t\t\t check[adj_row][adj_col] = false;\n\t\t }\n\t }\n}\n\n\nvoid func(){\n\n\tfor(int row = 0; row < N; row++){\n\t\tfor(int col = 0; col < N; col++){\n\t\t\tscanf(\"%d\",&table[row][col]);\n\t\t\tcheck[row][col] = false;\n\t\t}\n\t}\n\n\tFLG = false;\n\n\tdfs(0,0,0,N*N);\n\n\tif(FLG){\n\t\tprintf(\"YES\\n\");\n\t}else{\n\t\tprintf(\"NO\\n\");\n\t}\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3008,
"score_of_the_acc": -0.2437,
"final_rank": 4
}
] |
aoj_1032_cpp
|
Problem D:
Course Planning for Lazy Students
会津大学では2009年度より、授業履修に関する新しい制度を開始した。新制度では必修科目を撤廃し、それぞれの進路を考慮して科目を自由に選択できるようになった。
しかし、どの科目も無条件で履修できるわけではなく、特定の科目を履修するためには、先修条件を満たしている必要がある。下図に履修計画表の一部の例を示す：
図の長方形が１つの科目を表し科目名と単位数を含んでいる。図の矢印が先修条件を表す。矢印の意味は、矢印の終点で指されている科目を履修するためには、その矢印の始点を示す科目を修得している必要がある。例えば、Linear Algebra II (線形代数２)を履修するためには、Linear Algebra I (線形代数１)を修得している必要がある。また、Applied Algebra (応用代数)を履修するためには、Linear Algebra I と Discrete Systems (離散系論)の両方を修得している必要がある。
さて、履修登録計画において卒業に要する最低限の合計単位数
U
を満たす履修科目の組み合わせは、怠慢な学生にとって興味深いものである。
あなたの仕事は、与えられた履修計画表と
U
を読み込み、最低限の履修科目数を報告するプログラムを作成することである。これは計画であるため、履修登録した科目は必ず単位を修得できるものと仮定する。
Input
入力は複数のデータセットからなる。各データセットは以下の形式で与えられる：
n
U
c
0
k
0
r
0
1
r
0
2
...
r
0
k
0
c
1
k
1
r
1
1
r
1
2
...
r
1
k
1
.
.
c
n-1
k
n-1
r(n-1)
1
r(n-1)
2
...
r(n-1)
k
n-1
n
(1 ≤
n
≤ 20) は履修計画表が含む科目の数を示す整数である。科目には 0 から
n
-1 までの番号が割り当てられているものとし、以下
i
番目の科目を科目
i
と呼ぶことにする。
U
(1 ≤
U
≤ 100) は必要な合計単位数を表す整数である。
c
i
(1 ≤
c
i
≤ 10)は科目
i
の単位数を示す。次の
k
i
(0 ≤
k
i
≤ 5) は科目
i
の先修科目の数を示す。それに続く
ri
1
ri
2
...
ri
k
i
は科目
i
の先修科目の科目番号を示す。
ある科目から先修条件を表す矢印を１つ以上たどり、再びその科目に戻るような入力は与えられない。また、
U
を満たす科目の組み合わせが必ず存在すると仮定してよい。
n
と
U
がともに 0 のとき入力の終わりを示す。データセットの数は 100 を超えない。
Output
各データセットについて、最低限必要な科目数を１行に出力せよ。
Sample Input
4 4
1 0
3 2 0 2
2 0
2 0
3 6
1 0
3 2 0 2
2 0
0 0
Output for the Sample Input
2
3
|
[
{
"submission_id": "aoj_1032_3993527",
"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\n\nstruct Subject {\n\tint point{ 0 }, need{ 0 };\n};\n\nint main() {\n\tstd::vector<std::vector<int>> by_digit(21);\n\tfor (auto i = 0; i < (1 << 20); ++i) {\n\t\tint count = 0;\n\t\tfor (auto j = i; j > 0; j >>= 1) {\n\t\t\tcount += j % 2;\n\t\t}\n\t\tby_digit[count].push_back(i);\n\t}\n\twhile (true) {\n\t\tint n, u; std::cin >> n >> u; if (n == 0) break;\n\t\tstd::vector<Subject> subjects(n);\n\t\tfor (auto &s: subjects) {\n\t\t\tint prev;\n\t\t\tstd::cin >> s.point >> prev;\n\t\t\tfor (auto i = 0; i < prev; ++i) {\n\t\t\t\tint a; std::cin >> a;\n\t\t\t\ts.need |= (1 << a);\n\t\t\t}\n\t\t}\n\t\tint min_count = -1;\n\t\tfor (auto d = 1; min_count == -1; ++d) {\n\t\t\tfor (const auto p : by_digit[d]) {\n\t\t\t\tint point = 0;\n\t\t\t\tfor (auto i = 0; i < subjects.size(); ++i) if ((p & (1 << i)) != 0) {\n\t\t\t\t\tif ((p & (subjects[i].need)) != subjects[i].need) {\n\t\t\t\t\t\tpoint = 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tpoint += subjects[i].point;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (point >= u) {\n\t\t\t\t\tmin_count = d;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tstd::cout << min_count << '\\n';\n\t}\n}",
"accuracy": 1,
"time_ms": 460,
"memory_kb": 7572,
"score_of_the_acc": -0.6548,
"final_rank": 6
},
{
"submission_id": "aoj_1032_3410486",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<queue>\nusing namespace std;\n\nint main(){\n int n, u;\n while(cin >> n >> u, n+u){\n vector<int> c(n), p(n);\n for(int i = 0; i < n; i++){\n cin >> c[i];\n int k; cin >> k;\n while(k-- > 0){\n int r; cin >> r;\n p[i] |= (1<<r);\n }\n }\n \n auto popcnt = [](int x)->int{\n int ret = 0;\n while(x > 0){\n ret += x&1;\n x >>= 1;\n }\n return ret;\n };\n\n int ans = 21;\n queue<pair<int,int>> q;\n vector<bool> visit(1<<n, 0);\n q.push({0, 0});\n while(!q.empty()){\n pair<int,int> x = q.front(); q.pop();\n int bit = x.first, score = x.second;\n if(visit[bit]) continue;\n visit[bit] = true;\n if(score >= u){\n ans = min(ans, popcnt(bit));\n continue;\n }\n for(int i = 0; i < n; i++){\n if( ((bit>>i)&1) == 1 || (p[i]&bit) != p[i] || visit[bit|(1<<i)]) continue;\n q.push({bit|(1<<i), score+c[i]});\n }\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 710,
"memory_kb": 19444,
"score_of_the_acc": -1.3742,
"final_rank": 19
},
{
"submission_id": "aoj_1032_2927539",
"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 solve(bitset<18>bs, vector<vector<int>>&dp,const vector<pair<int,int>>&vs,const int now) {\n\tif(dp[now][bs.to_ulong()]!=-1)return dp[now][bs.to_ulong()];\n\n\tbool ok = false;\n\tif(bs.count()==vs.size())ok=true;\n\telse {\n\t\tfor (int i = 0; i < vs.size(); ++i) {\n\t\t\tif (bs[i]) {\n\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (vs[i].first == now || now == 7) {\n\t\t\t\t\tbs[i] = true;\n\t\t\t\t\tbool aok = solve(bs, dp, vs, vs[i].second);\n\t\t\t\t\tif (aok)ok = true;\n\t\t\t\t\tbs[i] = false;\n\t\t\t\t}\n\t\t\t\tif (vs[i].second == now || now == 7) {\n\t\t\t\t\tbs[i] = true;\n\t\t\t\t\tbool aok = solve(bs, dp, vs, vs[i].first);\n\t\t\t\t\tif(aok)ok=true;\n\t\t\t\t\tbs[i] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\n\t}\n\treturn dp[now][bs.to_ulong()]=ok;\n}\n\nvoid solve(vector<int>&memo,const int rest,const vector<int>&values, const vector<vector<int>>&rev_edges, int sum, int now,const vector<int>&perms,int&ans) {\n\tif (rest <= 0) {\n\t\tans=min(ans,sum);\n\t\treturn ;\n\t}\n\telse if (now == values.size()) {\n\t\treturn;\n\t}\n\telse {\n\t\tsolve(memo,rest,values,rev_edges,sum,now+1,perms,ans);\n\n\t\tbool ok=true;\n\t\tfor (auto re : rev_edges[perms[now]]) {\n\t\t\tif(!memo[re])ok=false;\n\t\t}\n\t\tif (ok) {\n\t\t\tmemo[perms[now]]=true;\n\t\t\tsolve(memo,rest-values[perms[now]],values,rev_edges,sum+1,now+1,perms,ans);\n\t\t\tmemo[perms[now]]=false;\n\t\t}\n\t}\n\n}\nint main()\n{\n\twhile (true) {\n\t\tint N,U;cin>>N>>U;\n\t\tif(!N)break;\n\t\tvector<int>values(N);\n\t\tvector<vector<int>>edges(N);\n\t\tvector<vector<int>>rev_edges(N);\n\t\tvector<int>comes(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint c,k;cin>>c>>k;\n\t\t\tvalues[i]=c;\n\t\t\tfor (int j = 0; j < k; ++j) {\n\t\t\t\tint a;cin>>a;\n\t\t\t\tedges[a].push_back(i);\n\t\t\t\trev_edges[i].push_back(a);\n\t\t\t\tcomes[i]++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tqueue<int>que;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tif (comes[i] == 0) {\n\t\t\t\tque.push(i);\n\t\t\t}\n\t\t}\n\t\tvector<int>perms;\n\t\twhile (!que.empty()) {\n\t\t\tint atop(que.front());\n\t\t\tque.pop();\n\t\t\tperms.push_back(atop);\n\t\t\tfor (auto e : edges[atop]) {\n\t\t\t\tcomes[e]--;\n\t\t\t\tif (comes[e] == 0) {\n\t\t\t\t\tque.push(e);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<int>rev_perms(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\trev_perms[perms[i]]=i;\n\t\t}\n\t\tint ans=100;\n\t\tvector<int>memo(N);\n\t\tsolve(memo,U,values,rev_edges,0,0,perms,ans);\n\t\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3140,
"score_of_the_acc": -0.0747,
"final_rank": 1
},
{
"submission_id": "aoj_1032_2586488",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\nstruct Info{\n\tint points;\n\tvector<int> next_SUBJECT;\n};\n\nstruct Data{\n\tint sum_points,number,subj_num;\n\tshort in_num[20];\n};\n\nint N,need_points,POW[21];\nInfo info[20];\nint first_in_num[20];\nbool LOG[1048576];\n\nvoid copyData(Data& to,Data from){\n\tfor(int i = 0; i < N; i++){\n\t\tto.in_num[i] = from.in_num[i];\n\t}\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < N; i++)info[i].next_SUBJECT.clear();\n\tfor(int i = 0; i < POW[N]; i++)LOG[i] = false;\n\n\tint num,tmp;\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d %d\",&info[i].points,&num);\n\t\tfirst_in_num[i] = num;\n\n\t\tfor(int k = 0; k < num; k++){\n\t\t\tscanf(\"%d\",&tmp);\n\t\t\tinfo[tmp].next_SUBJECT.push_back(i);\n\t\t}\n\t}\n\n\tqueue<Data> Q;\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(first_in_num[i] == 0){\n\t\t\tData new_data;\n\t\t\tfor(int k = 0; k < N; k++)new_data.in_num[k] = first_in_num[k];\n\t\t\tnew_data.subj_num = 1;\n\t\t\tnew_data.sum_points = info[i].points;\n\t\t\tnew_data.number = POW[i];\n\t\t\tLOG[POW[i]] = true;\n\t\t\tfor(int k = 0; k < info[i].next_SUBJECT.size(); k++){\n\t\t\t\tnew_data.in_num[info[i].next_SUBJECT[k]]--;\n\t\t\t}\n\t\t\tQ.push(new_data);\n\t\t}\n\t}\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.front().sum_points >= need_points){\n\t\t\tprintf(\"%d\\n\",Q.front().subj_num);\n\t\t\treturn;\n\t\t}else{\n\n\t\t\tfor(int loop = 0; loop < N; loop++){\n\t\t\t\tif(Q.front().number & (1 << loop)){\n\t\t\t\t\t//Do nothing\n\t\t\t\t}else{\n\t\t\t\t\tif(Q.front().in_num[loop] == 0){\n\t\t\t\t\t\tData new_data;\n\t\t\t\t\t\tcopyData(new_data,Q.front());\n\t\t\t\t\t\tnew_data.subj_num = Q.front().subj_num+1;\n\t\t\t\t\t\tnew_data.sum_points = Q.front().sum_points+info[loop].points;\n\t\t\t\t\t\tnew_data.number = Q.front().number+POW[loop];\n\t\t\t\t\t\tif(LOG[new_data.number])continue;\n\t\t\t\t\t\tLOG[new_data.number] = true;\n\t\t\t\t\t\tfor(int k = 0; k < info[loop].next_SUBJECT.size(); k++){\n\t\t\t\t\t\t\tnew_data.in_num[info[loop].next_SUBJECT[k]]--;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tQ.push(new_data);\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\nint main(){\n\n\tfor(int i = 0; i <= 20; i++)POW[i] = pow(2,i);\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&N,&need_points);\n\t\tif(N == 0 && need_points == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 850,
"memory_kb": 14740,
"score_of_the_acc": -1.349,
"final_rank": 18
},
{
"submission_id": "aoj_1032_2146335",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#pragma warning(disable : 4996)\nusing namespace std;\nint n, U, a[20], b[20], c, r[20], popcount[1048588], sum[1048588];\nvector<pair<int, int>>popcnts[21];\nint main() {\n\tfor (int i = 0; i < 20; i++) {\n\t\tfor (int j = 1 << i; j < 2 << i; j++) {\n\t\t\tpopcount[j] = popcount[j - (1 << i)] + 1;\n\t\t}\n\t}\n\tfor (int i = 1; i <= 20; i++) {\n\t\tfor (int j = 0; j < (1 << i); j++)popcnts[i].push_back(make_pair(popcount[j], j));\n\t\tsort(popcnts[i].begin(), popcnts[i].end());\n\t}\n\twhile (scanf(\"%d%d\", &n, &U), n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tscanf(\"%d%d\", &a[i], &b[i]); r[i] = 0;\n\t\t\tfor (int j = 0; j < b[i]; j++) {\n\t\t\t\tscanf(\"%d\", &c);\n\t\t\t\tr[i] |= 1 << c;\n\t\t\t}\n\t\t}\n\t\tsum[0] = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 1 << i; j < 2 << i; j++) {\n\t\t\t\tsum[j] = sum[j - (1 << i)] + a[i];\n\t\t\t}\n\t\t}\n\t\tint minx = 10000000;\n\t\tfor (int h = 0; h < (1 << n); h++) {\n\t\t\tint i = popcnts[n][h].second;\n\t\t\tif (sum[i] < U)continue;\n\t\t\tbool flag = false;\n\t\t\tint G = (1 << n) - i - 1;\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif ((i & (1 << j)) && (G & r[j])) {\n\t\t\t\t\tflag = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!flag) { minx = min(minx, popcount[i]); break; }\n\t\t}\n\t\tcout << minx << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 27680,
"score_of_the_acc": -1.1413,
"final_rank": 14
},
{
"submission_id": "aoj_1032_1866577",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n \nusing namespace std;\n \n#define MAX 20\n#define INF 1e9\n \nvector<int> vec,v[MAX],a[MAX];\n \nvoid init(int N){\n vec.clear();\n for(int i = 0 ; i < MAX ; i++){\n\tv[i].clear();\n }\n for(int i = 1 ; i < 1<<N ; i++){\n\tint idx = __builtin_popcount(i);\n\tv[idx-1].push_back(i);\n }\n for(int i = 0 ; i < N ; i++){\n\tfor(int j = 0 ; j < (int)v[i].size() ; j++){\n\t vec.push_back(v[i][j]);\n\t}\n }\n}\n \nint main(){\n int N,U,c[MAX],k,r;\n bool used[MAX] = {false};\n \n while(cin >> N >> U, (N | U)){\n\tif(!used[N-1]){\n\t init(N);\n\t a[N-1] = vec;\n\t used[N-1] = true;\n\t}else{\n\t vec = a[N-1];\n\t}\n\tint arr[MAX];\n\tfor(int i = 0 ; i < N ; i++){\n\t cin >> c[i] >> k;\n\t int S = 0;\n\t for(int j = 0 ; j < k ; j++){\n\t\tcin >> r;\n\t\tS |= 1<<r;\n\t }\n\t arr[i] = S;\n\t}\n\tint ans = INF;\n\tfor(int i = 0 ; i < (int)vec.size() ; i++){\n\t int S = vec[i];\n\t int cnt = 0, total = 0;\n\t bool flg = true;\n\t for(int j = 0 ; j < N ; j++){\n\t\tif(S >> j & 1){\n\t\t if((S & arr[j]) == arr[j]){\n\t\t\tcnt += c[j]; total++;\n\t\t }else{\n\t\t\tflg = false;\n\t\t\tbreak;\n\t\t }\n\t\t}\n\t }\n\t if(flg && cnt >= U){\n\t\tans = total;\n\t\tbreak;\n\t }\n\t}\n\tcout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 490,
"memory_kb": 16428,
"score_of_the_acc": -1.0214,
"final_rank": 12
},
{
"submission_id": "aoj_1032_1142198",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\ninline int popcount(uint x)\n{\n\tx=(x&0x55555555)+(x>>1&0x55555555);\n\tx=(x&0x33333333)+(x>>2&0x33333333);\n\tx=(x&0x0f0f0f0f)+(x>>4&0x0f0f0f0f);\n\tx=(x&0x00ff00ff)+(x>>8&0x00ff00ff);\n\treturn (x&0x0000ffff)+(x>>16&0x0000ffff);\n}\n\nint dfs(const vvi& g,int u)\n{\n\tint res=1<<u;\n\tfor(int v:g[u]) res|=dfs(g,v);\n\treturn res;\n}\n\nint main()\n{\n\tfor(int n,m;~scanf(\"%d%d\",&n,&m) && n|m;){\n\t\tvi cs(n);\n\t\tvvi g(n);\n\t\trep(i,n){\n\t\t\tscanf(\"%d\",&cs[i]);\n\t\t\tint k; scanf(\"%d\",&k);\n\t\t\trep(j,k){\n\t\t\t\tint r; scanf(\"%d\",&r);\n\t\t\t\tg[i].push_back(r);\n\t\t\t}\n\t\t}\n\t\t\n\t\tvi bs(n);\n\t\trep(i,n) bs[i]=dfs(g,i);\n\t\t\n\t\tvi sums(1<<n);\n\t\trep(i,n) sums[1<<i]=cs[i];\n\t\trep(i,1<<n) sums[i]=sums[i&-i]+sums[i-(i&-i)];\n\t\t\n\t\tint res=INF;\n\t\trep(i,1<<n) if(popcount(i)<res){\n\t\t\tint b=0;\n\t\t\trep(j,n) b|=(i>>j&1)*bs[j];\n\t\t\tif(sums[b]>=m) res=min(res,popcount(b));\n\t\t}\n\t\tprintf(\"%d\\n\",res);\n\t}\n}",
"accuracy": 1,
"time_ms": 680,
"memory_kb": 5292,
"score_of_the_acc": -0.808,
"final_rank": 10
},
{
"submission_id": "aoj_1032_1142186",
"code_snippet": "// 22:45~\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\ninline int popcount(uint x)\n{\n\tx=(x&0x55555555)+(x>>1&0x55555555);\n\tx=(x&0x33333333)+(x>>2&0x33333333);\n\tx=(x&0x0f0f0f0f)+(x>>4&0x0f0f0f0f);\n\tx=(x&0x00ff00ff)+(x>>8&0x00ff00ff);\n\treturn (x&0x0000ffff)+(x>>16&0x0000ffff);\n}\n\nint dfs(const vvi& g,int u)\n{\n\tint res=1<<u;\n\tfor(int v:g[u]) res|=dfs(g,v);\n\treturn res;\n}\n\nint main()\n{\n\t//clock_t t0=clock();\n\tfor(int n,m;~scanf(\"%d%d\",&n,&m) && n|m;){\n\t\tarray<int,20> cs;\n\t\tvvi g(n);\n\t\trep(i,n){\n\t\t\tscanf(\"%d\",&cs[i]);\n\t\t\tint k; scanf(\"%d\",&k);\n\t\t\trep(j,k){\n\t\t\t\tint r; scanf(\"%d\",&r);\n\t\t\t\tg[i].push_back(r);\n\t\t\t}\n\t\t}\n\t\t\n\t\tarray<int,20> bs;\n\t\trep(i,n) bs[i]=dfs(g,i);\n\t\t\n\t\tstatic array<int,1<<20> sums; sums.fill(0);\n\t\t\n\t\trep(i,n) sums[1<<i]=cs[i];\n\t\trep(i,1<<n) sums[i]=sums[i&-i]+sums[i-(i&-i)];\n\t\t\n\t\tint res=INF;\n\t\trep(i,1<<n) if(popcount(i)<res){\n\t\t\tint b=0;\n\t\t\trep(j,n) b|=(i>>j&1)*bs[j];\n\t\t\tif(sums[b]>=m) res=min(res,popcount(b));\n\t\t}\n\t\tprintf(\"%d\\n\",res);\n\t}\n\t//clock_t t1=clock();\n\t//printf(\"%.3f[s]\\n\",1.*(t1-t0)/CLOCKS_PER_SEC);\n}",
"accuracy": 1,
"time_ms": 650,
"memory_kb": 5292,
"score_of_the_acc": -0.7754,
"final_rank": 8
},
{
"submission_id": "aoj_1032_1142180",
"code_snippet": "// 22:45~\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nint dfs(const vvi& g,int u)\n{\n\tint res=1<<u;\n\tfor(int v:g[u]) res|=dfs(g,v);\n\treturn res;\n}\n\nint main()\n{\n\t//clock_t t0=clock();\n\tfor(int n,m;~scanf(\"%d%d\",&n,&m) && n|m;){\n\t\tarray<int,20> cs;\n\t\tvvi g(n);\n\t\trep(i,n){\n\t\t\tscanf(\"%d\",&cs[i]);\n\t\t\tint k; scanf(\"%d\",&k);\n\t\t\trep(j,k){\n\t\t\t\tint r; scanf(\"%d\",&r);\n\t\t\t\tg[i].push_back(r);\n\t\t\t}\n\t\t}\n\t\t\n\t\tarray<int,20> bs;\n\t\trep(i,n) bs[i]=dfs(g,i);\n\t\t\n\t\tstatic array<int,1<<20> sums; sums.fill(0);\n\t\t\n\t\trep(i,n) sums[1<<i]=cs[i];\n\t\trep(i,1<<n) sums[i]=sums[i&-i]+sums[i-(i&-i)];\n\t\t\n\t\tint res=INF;\n\t\tper(i,1<<n) if(__builtin_popcount(i)<res){\n\t\t\tint b=0;\n\t\t\trep(j,n) b|=(i>>j&1)*bs[j];\n\t\t\tif(sums[b]>=m) res=min(res,__builtin_popcount(b));\n\t\t}\n\t\tprintf(\"%d\\n\",res);\n\t}\n\t//clock_t t1=clock();\n\t//printf(\"%.3f[s]\\n\",1.*(t1-t0)/CLOCKS_PER_SEC);\n}",
"accuracy": 1,
"time_ms": 1000,
"memory_kb": 5292,
"score_of_the_acc": -1.1558,
"final_rank": 15
},
{
"submission_id": "aoj_1032_1117304",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdio>\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 \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\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 prior[21];\nint credit[21];\nint dp[1<<20];\nint bitcount[1<<20];\nint total_subjects;\nint credit_requirement;\n\nclass State {\npublic:\n int S;\n int sum;\n State(){}\n bool operator<(const State& s) const {\n return bitcount[S] < bitcount[s.S];\n }\n bool operator>(const State& s) const {\n return bitcount[S] > bitcount[s.S];\n }\n State(int S,int sum) : S(S),sum(sum) {}\n};\n\nint bfs(){\n priority_queue<State,vector<State>,greater<State> > que;\n que.push(State(0,0));\n int next_sum;\n int next_S;\n State s;\n int rest;\n while(!que.empty()){\n s = que.top();\n que.pop();\n for(int i = 0; i < total_subjects; i++){\n if(dp[next_S = (s.S | (1<<i))] != -1) continue;\n if((prior[i] | s.S) == s.S){\n\tnext_sum = s.sum + credit[i];\n\tdp[next_S] = next_sum;\n\n\tif(next_sum >= credit_requirement) {\n\t return bitcount[s.S] + 1;\n\t}\n\tque.push(State(next_S,next_sum));\n }\n }\n }\n return 0;\n}\n\nint main(){\n for(int S = 0; S < (1<<20); S++){\n bitcount[S] = __builtin_popcount(S);\n }\n \n while(~scanf(\"%d %d\",&total_subjects,&credit_requirement)){\n if(total_subjects == 0 && credit_requirement == 0) break;\n memset(dp,-1,sizeof(dp));\n memset(prior,0,sizeof(prior));\n\n for(int subject_i = 0; subject_i < total_subjects; subject_i++){\n int prior_subject_num;\n scanf(\"%d %d\",&credit[subject_i],&prior_subject_num);\n for(int subject_j = 0; subject_j < prior_subject_num; subject_j++){\n\tint subject_code;\n\tscanf(\"%d\",&subject_code);\n\tprior[subject_i] |= (1<<subject_code);\n }\n }\n \n printf(\"%d\\n\",bfs());\n }\n}",
"accuracy": 1,
"time_ms": 890,
"memory_kb": 16292,
"score_of_the_acc": -1.451,
"final_rank": 20
},
{
"submission_id": "aoj_1032_1112044",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint g[21];\nint t[21];\n//pair<pair<int,int>,int>p[21];\n//int conv[];\nint bp[1<<20];\nint main(){\n\tint a,b;\n\tfor(int i=0;i<(1<<20);i++)bp[i]=__builtin_popcount(i);\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tfor(int i=0;i<a;i++)\n\t\t\tg[i]=0;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tint c;scanf(\"%d%d\",t+i,&c);\n\t\t\tfor(int j=0;j<c;j++){\n\t\t\t\tint d;scanf(\"%d\",&d);\n\t\t\t\tg[i]+=1<<d;\n\t\t\t}\n\t\t}\n\t//\tfor(int i=0;i<a;i++)p[i]=make_pair(t[i],g[i]),;\n\t//\tstd::sort(p,p+a);\n\t//\tfor(int i=0;i<a;i++){\n\t//\t\tt[i]=p[a-1-i].first;\n\t//\t\tg[i]=p[a-1-i].second;\n\t//\t}\n\t\tint sum=0;\n\t\tfor(int i=0;i<a;i++)sum+=t[i];\n\t\tint ret=999999999;\n\t\tfor(int i=0;i<(1<<a);i++){\n\t\t\tint q=bp[i];\n\t\t\tif(ret<=q)continue;\n\t\t\tint s=sum;\n\t\t\tbool ok=true;\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tif(i&(1<<j)){\n\t\t\t\t\tif((i&g[j])!=g[j]){ok=false;break;}\n\t\t\t\t}else{\n\t\t\t\t\ts-=t[j];\n\t\t\t\t\tif(s<b){ok=false;break;}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ok)ret=q;\n\t\t}\n\t\tprintf(\"%d\\n\",ret);\n\t}\n}",
"accuracy": 1,
"time_ms": 530,
"memory_kb": 5112,
"score_of_the_acc": -0.6382,
"final_rank": 5
},
{
"submission_id": "aoj_1032_1047868",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nstruct node{\n int bits, cost;\n};\nnode info[20];\nint n, U;\nint dp[1 << 20];\n\nint rec(int used, int sbj){ //used: 修得済みの教科\n if(~dp[used]) return dp[used];\n if(sbj >= U) return __builtin_popcount(used);\n int ret = n;\n for(int i = 0; i < n; i++){\n if(info[i].bits&~used || used >> i & 1) continue;\n ret = min( ret, rec( used|(1 << i), sbj + info[i].cost));\n }\n return dp[used] = ret;\n}\n\nint main(){\n while(cin >> n >> U, n){\n fill_n( dp, 1 << 20, -1);\n for(int i = 0; i < n; i++){\n int k;\n cin >> info[i].cost >> k;\n info[i].bits = 0;\n while(k--){\n int r;\n cin >> r;\n info[i].bits |= 1 << r;\n }\n }\n cout << rec( 0, 0) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 610,
"memory_kb": 5260,
"score_of_the_acc": -0.7307,
"final_rank": 7
},
{
"submission_id": "aoj_1032_1045406",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\n#define MAX 20\n#define INF 1e9\n\nvector<int> vec,v[MAX],a[MAX];\n\nvoid init(int N){\n vec.clear();\n for(int i = 0 ; i < MAX ; i++){\n v[i].clear();\n }\n for(int i = 1 ; i < 1<<N ; i++){\n int idx = __builtin_popcount(i);\n v[idx-1].push_back(i);\n }\n for(int i = 0 ; i < N ; i++){\n for(int j = 0 ; j < (int)v[i].size() ; j++){\n vec.push_back(v[i][j]);\n }\n }\n}\n\nint main(){\n int N,U,c[MAX],k,r;\n bool used[MAX] = {false};\n\n while(cin >> N >> U, (N | U)){\n if(!used[N-1]){\n init(N);\n a[N-1] = vec;\n used[N-1] = true;\n }else{\n vec = a[N-1];\n }\n int arr[MAX];\n for(int i = 0 ; i < N ; i++){\n cin >> c[i] >> k;\n int S = 0;\n for(int j = 0 ; j < k ; j++){\n cin >> r;\n S |= 1<<r;\n }\n arr[i] = S;\n }\n int ans = INF;\n for(int i = 0 ; i < (int)vec.size() ; i++){\n int S = vec[i];\n int cnt = 0, total = 0;\n bool flg = true;\n for(int j = 0 ; j < N ; j++){\n if(S >> j & 1){\n if((S & arr[j]) == arr[j]){\n cnt += c[j]; total++;\n }else{\n flg = false;\n break;\n }\n }\n }\n if(flg && cnt >= U){\n ans = total;\n break;\n }\n }\n cout << ans << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 560,
"memory_kb": 14580,
"score_of_the_acc": -1.0278,
"final_rank": 13
},
{
"submission_id": "aoj_1032_1044114",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<cstring>\nusing namespace std;\n\n\nint popcount32(unsigned int x){\n\tx = (x>>1 & 0x55555555)+(x & 0x55555555);\n\tx = (x>>2 & 0x33333333)+(x & 0x33333333);\n\tx = (x>>4 & 0x0f0f0f0f)+(x & 0x0f0f0f0f);\n\tx = (x>>8 & 0x00ff00ff)+(x & 0x00ff00ff);\n\treturn (x>>16)+(x & 0x0000ffff);\n}\n\nint main(){\n\tint tanni[20];\n\tint prelearn[20];\n\tint n,u;\n\twhile(cin>>n>>u,n|u){\n\t\tmemset(tanni,0,sizeof(tanni));\n\t\tmemset(prelearn,0,sizeof(prelearn));\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint c,k;\n\t\t\tcin>>c>>k;\n\t\t\ttanni[i]=c;\n\t\t\tfor(int j=0;j<k;j++){\n\t\t\t\tint r;\n\t\t\t\tcin>>r;\n\t\t\t\tprelearn[i]|=1<<r;\n\t\t\t}\n\t\t}\n\t\tint ans=n;\n\t\tfor(int i=0;i<(1<<n);i++){\n\t\t\tint pop=popcount32(i);\n\t\t\tif(ans<=pop)continue;\n\t\t\tint pre=0;\n\t\t\tfor(int j=0;j<n;j++){\n\t\t\t\tpre|=(i>>j&1)*prelearn[j];\n\t\t\t}\n\t\t\tif((i&pre)!=pre)continue;\n\t\t\tint s=0;\n\t\t\tfor(int j=0;j<n;j++){\n\t\t\t\ts+=(i>>j&1)*tanni[j];\n\t\t\t}\n\t\t\tif(u<=s)ans=pop;\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n return 0;\n}",
"accuracy": 1,
"time_ms": 820,
"memory_kb": 1160,
"score_of_the_acc": -0.8043,
"final_rank": 9
},
{
"submission_id": "aoj_1032_977006",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <numeric>\n#include <cctype>\n#include <tuple>\n#include <iterator>\n#include <bitset>\n#include <random>\n#include <assert.h>\n#include <unordered_map>\n#include <array>\n#include <ctime>\n\n#ifdef _MSC_VER\n#include <agents.h>\n#endif\n\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\n#define rep(i, n) FOR(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define REV(v) v.rbegin(), v.rend()\n#define MEMSET(v, s) memset(v, s, sizeof(v))\n#define X first\n#define Y second\n#define MP make_pair\n#define umap unordered_map\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef pair<int, int> P;\ntypedef unsigned int uint;\n\nint c[20], v[20];\nint visit[1 << 20];\nint ans;\nint n, U;\n\nvoid dfs(int cnt, int bits, int sum){\n\tif (visit[bits]) return;\n\tvisit[bits] = 1;\n\tif (ans <= cnt) return;\n\tif (sum >= U){\n\t\tans = cnt;\n\t\treturn;\n\t}\n\n\tfor (int i = 0; i < n; ++i){\n\t\tif (bits&(1 << i))continue;\n\t\tif ((bits&v[i]) != v[i]) continue;\n\t\tdfs(cnt + 1, bits | (1 << i), sum + c[i]);\n\t}\n}\n\nint main(){\n\twhile (cin >> n >> U, n|U){\n rep(i, n){\n cin >> c[i];\n int k;\n cin >> k;\n\t\t\tv[i] = 0;\n rep(j, k){\n int x;\n cin >> x;\n v[i] |= 1<<x;\n }\n }\n ans = n;\n\t\tMEMSET(visit, 0);\n\t\tdfs(0, 0, 0);\n cout << ans << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 400,
"memory_kb": 5264,
"score_of_the_acc": -0.5026,
"final_rank": 2
},
{
"submission_id": "aoj_1032_593299",
"code_snippet": "#include<cstdio>\n#include<iostream>\n#include<bitset>\n#include<deque>\n#include<algorithm>\nusing namespace std;\n\nstruct Pox\n{\n int state,cost;\n Pox(int state,int cost):state(state),cost(cost){}\n};\n\nint main()\n{\n while(1)\n {\n int n,U,k,r;\n scanf(\"%d %d\",&n,&U);\n if(n+U == 0)\n\tbreak;\n int mincost[1<<n];\n for(int i=0;i<(1<<n);i++)\n\tmincost[i] = (1<<n);\n deque<Pox> deq;\n int G[n];\n int c[n];\n for(int i = 0;i<n;i++)\n\t{\n\t scanf(\"%d %d\",&c[i],&k);\n\t G[i] = 0;\n\n\t for(int j=0;j<k;j++)\n\t {\n\t scanf(\"%d\",&r);\n\t G[i] |= (1<<r);\n\t }\n\t}\n\n deq.push_back(Pox(0,0));\n mincost[0] = 0; \n int ans = (1<<n);\n while(!deq.empty())\n\t{\n\t Pox pox = deq.front(); deq.pop_front();\n\t int num = __builtin_popcount(pox.state);\n\t if(num >= ans)\n\t continue;\n \n\t if(pox.cost >= U)\n\t {\n\t ans = min(ans,num);\n\t continue;\n\t }\t \n\n\t for(int i=0;i<n;i++)\n\t {\n\t if((pox.state >> i) & 1)\n\t\tcontinue;\n\t int pre = G[i];\n\t pre &= pox.state;\n\t if(pre != G[i])\n\t\tcontinue;\n\t if(mincost[pox.state|(1<<i)] <= num+1)\n\t\tcontinue;\n\t mincost[pox.state|(1<<i)] = num+1;\n\t if(pox.cost + c[i] < U)\n\t\tdeq.push_back(Pox(pox.state|(1<<i),pox.cost+c[i]));\n\t else \n\t\tans = min(ans,num+1);\n\t }\n\t}\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 460,
"memory_kb": 6928,
"score_of_the_acc": -0.6305,
"final_rank": 3
},
{
"submission_id": "aoj_1032_533595",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cstdio>\n#include <queue>\n#include <map>\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\nconst int N = 20;\n\nint n, U, C[N], K[N], R[N];\nbool vis[1<<N];\n\nint solve(){\n queue<P> q;\n q.push(P(0, 0));\n fill(vis, vis+(1<<n), false);\n while(!q.empty()){\n P u = q.front(); q.pop();\n if(u.second >= U){\n int res = 0;\n for(int i=0;i<n;i++) if((u.first >> i) & 1) res++;\n return res;\n }\n if(vis[u.first]) continue;\n vis[u.first] = true;\n for(int i=0;i<n;i++){\n if(!((u.first >> i) & 1) && (u.first & R[i]) == R[i]){\n q.push(P(u.first | (1<<i), u.second + C[i]));\n }\n }\n }\n}\n\nmain(){\n while(scanf(\"%d %d\", &n, &U) && (n|U)){\n for(int i=0;i<n;i++){\n scanf(\"%d %d\", &C[i], &K[i]);\n R[i] = 0;\n for(int j=0;j<K[i];j++){\n int r;\n scanf(\"%d\", &r);\n R[i] |= 1 << r;\n }\n }\n printf(\"%d\\n\", solve());\n }\n}",
"accuracy": 1,
"time_ms": 650,
"memory_kb": 18476,
"score_of_the_acc": -1.2725,
"final_rank": 17
},
{
"submission_id": "aoj_1032_524915",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\n\nstruct Data{\n int used;\n int credit;\n};\n\nint n,U,c,k,r;\nint credit[20],required[20];\n\nint bitcount(int n){return n?(n&1)+bitcount(n>>1):0;}\nint BFS(){\n bool visited[1<<20]={0};\n queue<Data>q;\n Data now={0,0};\n q.push(now);\n while(!q.empty()){\n now=q.front();\n q.pop();\n if(visited[now.used])continue;\n visited[now.used]=true;\n if(now.credit>=U)return bitcount(now.used);\n for(int i=0;i<n;i++){\n if(now.used & (1<<i) || (now.used & required[i]) != required[i])continue;\n Data next=now;\n next.used^=(1<<i);\n next.credit+=credit[i];\n q.push(next);\n }\n }\n return -1;\n}\n\nint main()\n{\n while(cin>>n>>U,n|U){\n for(int i=0;i<n;i++){\n cin>>c>>k;\n credit[i]=c;\n required[i]=0;\n for(int j=0;j<k;j++){\n cin>>r;\n required[i]^=(1<<r);\n }\n }\n cout<<BFS()<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 610,
"memory_kb": 18500,
"score_of_the_acc": -1.2299,
"final_rank": 16
},
{
"submission_id": "aoj_1032_505770",
"code_snippet": "#include <iostream>\n#include <cstring>\nusing namespace std;\n\n#define MAX_N 20\n\nint n, U;\nint cs[MAX_N];\nint rs[MAX_N];\n\ninline bool check(int S) {\n // 履修に必要な単位をすべて取得しているか\n for (int i = 0; i < n; i++) {\n if (S & (1<<i)) {\n if ((S & rs[i]) != rs[i]) {\n return false;\n }\n }\n }\n\n // 総単位数がUを越えているか\n int unit = 0;\n for (int i = 0; i < n; i++) {\n if (S & (1<<i)) {\n unit += cs[i];\n }\n }\n if (unit < U) return false;\n\n return true;\n}\n\nbool checkAllPattern(int k) {\n int c = (1<<k)-1;\n while (c < (1<<n)) {\n if (check(c)) return true;\n int x = c & -c;\n int y = c + x;\n c = ((c & ~y) / x >> 1) | y;\n }\n return false;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n while (cin >> n >> U, n || U) {\n memset(cs, 0, sizeof(cs));\n memset(rs, 0, sizeof(rs));\n for (int i = 0; i < n; i++) {\n int c, k, r;\n cin >> c >> k; r = 0;\n for (int j = 0; j < k; j++) {\n int _r; cin >> _r;\n r |= (1<<_r);\n }\n cs[i] = c;\n rs[i] = r;\n }\n\n for (int i = 1; i <= n; i++) {\n if (checkAllPattern(i)) {\n cout << i << endl;\n break;\n }\n }\n\n //int ans = (1<<28);\n //for (int S = 1; S < (1<<n); S++) {\n // if (check(S)) {\n // ans = min(ans, __builtin_popcount(S));\n // }\n //}\n\n //cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 830,
"memory_kb": 1196,
"score_of_the_acc": -0.8166,
"final_rank": 11
},
{
"submission_id": "aoj_1032_501680",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\n\nusing namespace std;\n\nstruct Tag {\n int pat, value, cost;\n Tag(int p, int v, int c) : pat(p), value(v), cost(c) {}\n};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n while(true) {\n int N, U;\n cin >> N >> U;\n if(!N && !U) break;\n\n vector<int> need_mask(N, 0);\n vector<int> value(N, 0);\n for(int i = 0; i < N; ++i) {\n int K;\n cin >> value[i] >> K;\n int mask = 0;\n while(K--) {\n int R;\n cin >> R;\n mask |= (1<<R);\n }\n need_mask[i] = mask;\n }\n int ans = N;\n vector<int> seen(1<<N, 0);\n queue<Tag> q;\n q.push(Tag(0, 0, 0));\n seen[0] = 1;\n while(!q.empty()) {\n Tag t = q.front();\n if(t.value >= U) {\n ans = t.cost;\n break;\n }\n q.pop();\n for(int i = 0; i < N; ++i) {\n if(!(t.pat & (1<<i)) && (t.pat & need_mask[i]) == need_mask[i]) {\n int next_pat = t.pat | (1<<i);\n if(!seen[next_pat]) {\n seen[next_pat] = 1;\n q.push(Tag(next_pat, t.value + value[i], t.cost + 1));\n }\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 440,
"memory_kb": 7672,
"score_of_the_acc": -0.6369,
"final_rank": 4
}
] |
aoj_1038_cpp
|
Problem D:
Dr. Nakamura's Lab.
Dr.中村は偉大な発明者である, 今日も常人には発想出来ない新たな発明に取り掛かっている. 今発明しているのは新たな防犯システムとコンテナである.
防犯システムの方は上に乗った者を識別して招かれざる客だった場合, 電流を流して気絶させるパネルである. このパネルは踏まないように上を通過しても無駄で, 空中のものに対し放電する. しかし, まだ完成には程遠く, 電流は強すぎて調節が不可能で, 一度放電すると充電しない限り使えない. また, 人と物体の区別ができず, そもそも人自体区別できない等欠点をあげればキリがない.
コンテナの方は謎の力によって常時地面から浮いており, 運ぶのに便利に作ってある. しかし, これも完成には遠く, 一度押すと何かにぶつかるまで止まらない.
Dr.中村は一日の作業を終え, 帰宅しようとしたが未完成のパネルを設置したままだということに気づいた. これを取り外すのは防犯上非常に困難に作ってある上に, これを通らなければ帰れないような位置に設置してしまったのでDr.中村は途方に暮れた. しかし, 素晴らしい頭脳を持つDr.中村は解決案をすぐに思いついた. パネルは一度放電させれば通れるようになるため, コンテナを通過させればパネルの上を通れるようになる, そう考えた. 実際, パネルの上にコンテナを通過させると, コンテナは電流によって消滅してしまう一方でパネルは放電し, 通れるようになる.
しかし, 研究室の中は入り組んでおり, うまくコンテナを動かさないとパネルを通過させられない. Dr.中村は助手であるあなたにメールで助けを求めた. あなたの仕事は研究室の情報が与えられた時にDr.中村が出口までたどり着くためのプログラムを作成することである.
研究室は二次元グリッドで与えられ, Dr.中村は一度の移動で上下左右に隣接するセルに移動することが出来る.ただし, 障害物, コンテナ, 放電していないパネルのセルには移動できない.
Dr.中村は上下左右に隣接するセルにあるコンテナを押すことができ, コンテナはDr.中村がいる方向と逆の方向に別のコンテナか障害物にぶつかる, あるいは放電されていないパネルの上を通過するまで動く. また, 何かにぶつかり止まった場合, ぶつかる直前のセルで静止する.
出口はコンテナもDr.中村も侵入可能である. コンテナは出口を通っても消滅せず、そのまま通過する.
壁にぶつかって出口をふさぐことはある. この場合は出口に進入できない.
あなたのプログラムが要求されていることは, Dr.中村は最少何回の移動で研究室を脱出できるかを出力することのみである. なぜなら, Dr.中村は素晴らしい頭脳の持ち主なのでそれさえわかれば自分で脱出するからである.
Input
入力は複数のデータセットからなり, 一行目に研究室の縦の長さ H と横の長さ W が与えられる.
2行目以降では研究室の状態が H × W 個の文字で表わされる. 各文字が表すものは以下のとおりである:
‘
#
’障害物を表す.
‘
@
’Dr.中村の初期位置を表す.
‘
w
’パネルを表す.
‘
c
’コンテナを表す.
‘
.
’何も置かれていない空白のセルを表す.
‘
E
’脱出口を表す.
縦と横の長さがともに 0 のとき入力の終了を表す. これについて処理をする必要はない.
以下のことを仮定してよい.
3 ≤ H, W ≤ 10
研究室の周囲は障害物で囲まれている.
パネルとコンテナの数はそれぞれ 3 を越えない.
研究室にはただ１つの出口がある.
Output
各データセットについて最少の移動回数を１行に出力せよ. なお、Dr.中村が脱出できない場合、”
-1
”と出力せよ.
Sample Input
5 5
#####
##@##
#wc.#
#Ew.#
#####
5 5
#####
##@.#
#wc.#
#E#.#
#####
3 6
######
#@.wE#
######
0 0
Output for the Sample Input
3
5
-1
|
[
{
"submission_id": "aoj_1038_8051272",
"code_snippet": "#include <algorithm>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n#define REP(i, a, n) for (int i = (a); i < (n); i++)\n#define rep(i, n) REP(i, 0, n)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define foreach(it, x) for (typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)\nconst int dx[] = {0, 1, 0, -1};\nconst int dy[] = {-1, 0, 1, 0};\nint W, H, sx, sy, gx, gy;\nint bfscost[10][10];\nchar csize, wsize, wx[3], wy[3], cx[3], cy[3];\nchar field[16][16];\nchar DP[9][9][9][9][9][9][9][9];\nstruct state {\n char x, y, cx[3], cy[3], Sc;\n state(char _x, char _y, char _cx[], char _cy[], char _Sc) {\n x = _x, y = _y, Sc = _Sc;\n cx[0] = _cx[0], cx[1] = _cx[1], cx[2] = _cx[2];\n cy[0] = _cy[0], cy[1] = _cy[1], cy[2] = _cy[2];\n }\n bool operator<(const state &a) const {\n if (x != a.x) return x < a.x;\n if (y != a.y) return y < a.y;\n if (cx[0] != a.cx[0]) return cx[0] < a.cx[0];\n if (cx[1] != a.cx[1]) return cx[1] < a.cx[1];\n if (cx[2] != a.cx[2]) return cx[2] < a.cx[2];\n if (cy[0] != a.cy[0]) return cy[0] < a.cy[0];\n if (cy[1] != a.cy[1]) return cy[1] < a.cy[1];\n if (cy[2] != a.cy[2]) return cy[2] < a.cy[2];\n return Sc < a.Sc;\n }\n bool operator==(const state &a) const {\n return (x == a.x && y == a.y &&\n (cx[0] == a.cx[0] && cx[1] == a.cx[1] && cx[2] == a.cx[2]) &&\n (cy[0] == a.cy[0] && cy[1] == a.cy[1] && cy[2] == a.cy[2]) &&\n Sc == a.Sc);\n }\n};\nbool isdel(char tx, char ty, char ncx[], char ncy[]) {\n if (field[ty][tx] != 'w') return true;\n rep(i, csize) if (ncx[i] == tx && ncy[i] == ty) return true;\n return false;\n}\nbool iscontena(char tx, char ty, char ncx[], char ncy[], char Sc) {\n rep(i, csize) if (ncx[i] == tx && ncy[i] == ty && !(Sc & (1 << i))) return true;\n return false;\n}\nvoid BFS(char nx, char ny, char ncx[], char ncy[], char Sc) {\n memset(bfscost, -1, sizeof(bfscost));\n bfscost[ny][nx] = 0;\n queue<pair<int, int>> q;\n q.push(make_pair(nx, ny));\n while (!q.empty()) {\n int x = q.front().first, y = q.front().second;\n int cost = bfscost[y][x];\n q.pop();\n rep(k, 4) {\n int tx = x + dx[k];\n int ty = y + dy[k];\n if (field[ty][tx] == '#' || bfscost[ty][tx] != -1 || iscontena(tx, ty, ncx, ncy, Sc))\n continue;\n if (field[ty][tx] == 'w' && !isdel(tx, ty, ncx, ncy)) continue;\n bfscost[ty][tx] = cost + 1;\n q.push(make_pair(tx, ty));\n }\n }\n}\nvoid input() {\n rep(i, H) {\n scanf(\"%s\", field[i]);\n rep(j, W) {\n if (field[i][j] == '@') sx = j, sy = i;\n if (field[i][j] == 'E') gx = j, gy = i;\n if (field[i][j] == 'w') wx[wsize] = j, wy[wsize] = i, wsize++;\n if (field[i][j] == 'c') cx[csize] = j, cy[csize] = i, csize++;\n }\n }\n}\nint main() {\n while (scanf(\"%d%d\", &H, &W), H | W) {\n csize = wsize = 0;\n memset(DP, -1, sizeof(DP));\n rep(i, 3) cx[i] = cy[i] = 0;\n input();\n int res = INT_MAX;\n priority_queue<pair<int, state>, vector<pair<int, state>>, greater<pair<int, state>>> q;\n q.push(make_pair(0, state(sx, sy, cx, cy, 0)));\n DP[cx[0]][cy[0]][cx[1]][cy[1]][cx[2]][cy[2]][sx][sy] = 0;\n while (!q.empty()) {\n int cost = q.top().first;\n char nx = q.top().second.x, ny = q.top().second.y;\n char tSc = q.top().second.Sc;\n char ncx[3], ncy[3];\n rep(i, csize) ncx[i] = q.top().second.cx[i], ncy[i] = q.top().second.cy[i];\n q.pop();\n if (res <= cost) break;\n BFS(nx, ny, ncx, ncy, tSc);\n if (bfscost[gy][gx] != -1) res = min(res, cost + bfscost[gy][gx]);\n rep(i, csize) if (!(tSc & (1 << i))) {\n rep(j, 4) {\n int tx = ncx[i] + dx[j];\n int ty = ncy[i] + dy[j];\n if (bfscost[ty][tx] == -1) continue;\n int ttSc = tSc;\n int dir = (j + 2) % 4;\n int tcx = ncx[i], tcy = ncy[i];\n for (;;) {\n int ay = tcy + dy[dir];\n int ax = tcx + dx[dir];\n if (field[ay][ax] == '#' || iscontena(ax, ay, ncx, ncy, tSc)) break;\n tcx += dx[dir];\n tcy += dy[dir];\n if (field[ay][ax] == 'w' && !isdel(ax, ay, ncx, ncy)) {\n ttSc |= 1 << i;\n break;\n }\n }\n if (tcx == ncx[i] && tcy == ncy[i]) continue;\n char ttcx[3], ttcy[3];\n rep(k, csize) ttcx[k] = ncx[k], ttcy[k] = ncy[k];\n ttcx[i] = tcx, ttcy[i] = tcy;\n char *dpp = &DP[ttcx[0]][ttcy[0]][ttcx[1]][ttcy[1]][ttcx[2]][ttcy[2]][tx][ty];\n if (*dpp == -1 || *dpp > cost + bfscost[ty][tx]) {\n *dpp = cost + bfscost[ty][tx];\n q.push(make_pair(cost + bfscost[ty][tx], state(tx, ty, ttcx, ttcy, ttSc)));\n }\n }\n }\n }\n printf(\"%d\\n\", (res == INT_MAX ? -1 : res));\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 45588,
"score_of_the_acc": -0.8676,
"final_rank": 18
},
{
"submission_id": "aoj_1038_8051263",
"code_snippet": "#include <algorithm>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n#define REP(i, a, n) for (i = a; i < n; i++)\n#define rep(i, n) REP(i, 0, n)\n#define all(x) x.begin(), x.end()\n#define rall(x) x.rbegin(), x.rend()\n#define foreach(it, x) \\\n for (typeof(x.begin()) it = x.begin(); it != x.end(); it++)\nconst int dx[] = {0, 1, 0, -1};\nconst int dy[] = {-1, 0, 1, 0};\nint W, H, sx, sy, gx, gy;\nint bfscost[10][10];\nchar csize, wsize, wx[3], wy[3], cx[3], cy[3];\nchar field[16][16];\nchar DP[9][9][9][9][9][9][9][9];\nstruct state {\n char x, y, cx[3], cy[3], Sc;\n state(char _x, char _y, char _cx[], char _cy[], char _Sc) {\n x = _x, y = _y, Sc = _Sc;\n cx[0] = _cx[0], cx[1] = _cx[1], cx[2] = _cx[2];\n cy[0] = _cy[0], cy[1] = _cy[1], cy[2] = _cy[2];\n }\n bool operator<(const state &a) const {\n if (x != a.x)\n return x < a.x;\n if (y != a.y)\n return y < a.y;\n if (cx[0] != a.cx[0])\n return cx[0] < a.cx[0];\n if (cx[1] != a.cx[1])\n return cx[1] < a.cx[1];\n if (cx[2] != a.cx[2])\n return cx[2] < a.cx[2];\n if (cy[0] != a.cy[0])\n return cy[0] < a.cy[0];\n if (cy[1] != a.cy[1])\n return cy[1] < a.cy[1];\n if (cy[2] != a.cy[2])\n return cy[2] < a.cy[2];\n return Sc < a.Sc;\n }\n bool operator==(const state &a) const {\n return (x == a.x && y == a.y &&\n (cx[0] == a.cx[0] && cx[1] == a.cx[1] && cx[2] == a.cx[2]) &&\n (cy[0] == a.cy[0] && cy[1] == a.cy[1] && cy[2] == a.cy[2]) &&\n Sc == a.Sc);\n }\n};\nbool isdel(char tx, char ty, char ncx[], char ncy[]) {\n int i;\n if (field[ty][tx] != 'w')\n return true;\n rep(i, csize) if (ncx[i] == tx && ncy[i] == ty) return true;\n return false;\n}\nbool iscontena(char tx, char ty, char ncx[], char ncy[], char Sc) {\n int i;\n rep(i,\n csize) if (ncx[i] == tx && ncy[i] == ty && !(Sc & (1 << i))) return true;\n return false;\n}\nvoid BFS(char nx, char ny, char ncx[], char ncy[], char Sc) {\n int i, j, k;\n memset(bfscost, -1, sizeof(bfscost));\n bfscost[ny][nx] = 0;\n queue<pair<int, int>> q;\n q.push(make_pair(nx, ny));\n while (!q.empty()) {\n int x = q.front().first, y = q.front().second;\n int cost = bfscost[y][x];\n q.pop();\n rep(k, 4) {\n int tx = x + dx[k];\n int ty = y + dy[k];\n if (field[ty][tx] == '#' || bfscost[ty][tx] != -1 ||\n iscontena(tx, ty, ncx, ncy, Sc))\n continue;\n if (field[ty][tx] == 'w' && !isdel(tx, ty, ncx, ncy))\n continue;\n bfscost[ty][tx] = cost + 1;\n q.push(make_pair(tx, ty));\n }\n }\n}\nvoid input() {\n int i, j;\n rep(i, H) {\n scanf(\"%s\", field[i]);\n rep(j, W) {\n if (field[i][j] == '@')\n sx = j, sy = i;\n if (field[i][j] == 'E')\n gx = j, gy = i;\n if (field[i][j] == 'w') {\n wx[wsize] = j, wy[wsize] = i;\n wsize++;\n }\n if (field[i][j] == 'c') {\n cx[csize] = j, cy[csize] = i;\n csize++;\n }\n }\n }\n}\nint main() {\n int i, j, k;\n while (scanf(\"%d%d\", &H, &W), H | W) {\n csize = wsize = 0;\n memset(DP, -1, sizeof(DP));\n rep(i, 3) cx[i] = cy[i] = 0;\n input();\n int res = INT_MAX;\n priority_queue<pair<int, state>, vector<pair<int, state>>,\n greater<pair<int, state>>>\n q;\n q.push(make_pair(0, state(sx, sy, cx, cy, 0)));\n DP[cx[0]][cy[0]][cx[1]][cy[1]][cx[2]][cy[2]][sx][sy] = 0;\n while (!q.empty()) {\n int cost = q.top().first;\n char nx = q.top().second.x, ny = q.top().second.y;\n char tSc = q.top().second.Sc;\n char ncx[3], ncy[3];\n rep(i, 3) ncx[i] = ncy[i] = 0;\n rep(i, csize) ncx[i] = q.top().second.cx[i],\n ncy[i] = q.top().second.cy[i];\n q.pop();\n if (res <= cost)\n break;\n BFS(nx, ny, ncx, ncy, tSc);\n if (bfscost[gy][gx] != -1)\n res = min(res, cost + bfscost[gy][gx]);\n rep(i, csize) if (!(tSc & (1 << i))) {\n rep(j, 4) {\n int tx = ncx[i] + dx[j];\n int ty = ncy[i] + dy[j];\n if (bfscost[ty][tx] == -1)\n continue;\n int ttSc = tSc;\n int dir = (j + 2) % 4;\n int tcx = ncx[i], tcy = ncy[i];\n for (;;) {\n int ay = tcy + dy[dir];\n int ax = tcx + dx[dir];\n if (field[ay][ax] == '#' || iscontena(ax, ay, ncx, ncy, tSc))\n break;\n tcx += dx[dir];\n tcy += dy[dir];\n if (field[ay][ax] == 'w' && !isdel(ax, ay, ncx, ncy)) {\n ttSc |= 1 << i;\n break;\n }\n }\n if (tcx == ncx[i] && tcy == ncy[i])\n continue;\n char ttcx[3], ttcy[3];\n rep(k, 3) ttcx[i] = ttcy[i] = 0;\n rep(k, csize) ttcx[k] = ncx[k], ttcy[k] = ncy[k];\n ttcx[i] = tcx, ttcy[i] = tcy;\n char *dpp =\n &DP[ttcx[0]][ttcy[0]][ttcx[1]][ttcy[1]][ttcx[2]][ttcy[2]][tx][ty];\n if (*dpp == -1 || *dpp > cost + bfscost[ty][tx]) {\n *dpp = cost + bfscost[ty][tx];\n q.push(make_pair(cost + bfscost[ty][tx],\n state(tx, ty, ttcx, ttcy, ttSc)));\n }\n }\n }\n }\n printf(\"%d\\n\", res == INT_MAX ? -1 : res);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 45668,
"score_of_the_acc": -0.8692,
"final_rank": 19
},
{
"submission_id": "aoj_1038_8051262",
"code_snippet": "#include <algorithm>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n#define REP(i, a, n) for (i = a; i < n; i++)\n#define rep(i, n) REP(i, 0, n)\n#define all(x) x.begin(), x.end()\n#define rall(x) x.rbegin(), x.rend()\n#define foreach(it, x) \\\n for (typeof(x.begin()) it = x.begin(); it != x.end(); it++)\nconst int dx[] = {0, 1, 0, -1};\nconst int dy[] = {-1, 0, 1, 0};\nint W, H, sx, sy, gx, gy;\nint bfscost[10][10];\nchar csize, wsize, wx[3], wy[3], cx[3], cy[3];\nchar field[16][16];\nstruct state {\n char x, y, cx[3], cy[3], Sc;\n state(char _x, char _y, char _cx[], char _cy[], char _Sc) {\n x = _x, y = _y, Sc = _Sc;\n cx[0] = _cx[0], cx[1] = _cx[1], cx[2] = _cx[2];\n cy[0] = _cy[0], cy[1] = _cy[1], cy[2] = _cy[2];\n }\n bool operator<(const state &a) const {\n if (x != a.x)\n return x < a.x;\n if (y != a.y)\n return y < a.y;\n if (cx[0] != a.cx[0])\n return cx[0] < a.cx[0];\n if (cx[1] != a.cx[1])\n return cx[1] < a.cx[1];\n if (cx[2] != a.cx[2])\n return cx[2] < a.cx[2];\n if (cy[0] != a.cy[0])\n return cy[0] < a.cy[0];\n if (cy[1] != a.cy[1])\n return cy[1] < a.cy[1];\n if (cy[2] != a.cy[2])\n return cy[2] < a.cy[2];\n return Sc < a.Sc;\n }\n bool operator==(const state &a) const {\n return (x == a.x && y == a.y &&\n (cx[0] == a.cx[0] && cx[1] == a.cx[1] && cx[2] == a.cx[2]) &&\n (cy[0] == a.cy[0] && cy[1] == a.cy[1] && cy[2] == a.cy[2]) &&\n Sc == a.Sc);\n }\n};\nbool isdel(char tx, char ty, char ncx[], char ncy[]) {\n int i;\n if (field[ty][tx] != 'w')\n return true;\n rep(i, csize) if (ncx[i] == tx && ncy[i] == ty) return true;\n return false;\n}\nbool iscontena(char tx, char ty, char ncx[], char ncy[], char Sc) {\n int i;\n rep(i,\n csize) if (ncx[i] == tx && ncy[i] == ty && !(Sc & (1 << i))) return true;\n return false;\n}\nvoid BFS(char nx, char ny, char ncx[], char ncy[], char Sc) {\n int i, j, k;\n memset(bfscost, -1, sizeof(bfscost));\n bfscost[ny][nx] = 0;\n queue<pair<int, int>> q;\n q.push(make_pair(nx, ny));\n while (!q.empty()) {\n int x = q.front().first, y = q.front().second;\n int cost = bfscost[y][x];\n q.pop();\n rep(k, 4) {\n int tx = x + dx[k];\n int ty = y + dy[k];\n if (field[ty][tx] == '#' || bfscost[ty][tx] != -1 ||\n iscontena(tx, ty, ncx, ncy, Sc))\n continue;\n if (field[ty][tx] == 'w' && !isdel(tx, ty, ncx, ncy))\n continue;\n bfscost[ty][tx] = cost + 1;\n q.push(make_pair(tx, ty));\n }\n }\n}\nvoid input() {\n int i, j;\n rep(i, H) {\n scanf(\"%s\", field[i]);\n rep(j, W) {\n if (field[i][j] == '@')\n sx = j, sy = i;\n if (field[i][j] == 'E')\n gx = j, gy = i;\n if (field[i][j] == 'w') {\n wx[wsize] = j, wy[wsize] = i;\n wsize++;\n }\n if (field[i][j] == 'c') {\n cx[csize] = j, cy[csize] = i;\n csize++;\n }\n }\n }\n}\nint main() {\n int i, j, k;\n map<state, int> dp;\n while (scanf(\"%d%d\", &H, &W), H | W) {\n dp.clear();\n csize = wsize = 0;\n rep(i, 3) cx[i] = cy[i] = 0;\n input();\n int res = INT_MAX;\n priority_queue<pair<int, state>, vector<pair<int, state>>,\n greater<pair<int, state>>>\n q;\n q.push(make_pair(0, state(sx, sy, cx, cy, 0)));\n while (!q.empty()) {\n int cost = q.top().first;\n char nx = q.top().second.x, ny = q.top().second.y;\n char tSc = q.top().second.Sc;\n char ncx[3], ncy[3];\n rep(i, 3) ncx[i] = ncy[i] = 0;\n rep(i, csize) ncx[i] = q.top().second.cx[i],\n ncy[i] = q.top().second.cy[i];\n q.pop();\n if (res <= cost)\n break;\n BFS(nx, ny, ncx, ncy, tSc);\n if (bfscost[gy][gx] != -1)\n res = min(res, cost + bfscost[gy][gx]);\n rep(i, csize) if (!(tSc & (1 << i))) {\n rep(j, 4) {\n int tx = ncx[i] + dx[j];\n int ty = ncy[i] + dy[j];\n if (bfscost[ty][tx] == -1)\n continue;\n int ttSc = tSc;\n int dir = (j + 2) % 4;\n int tcx = ncx[i], tcy = ncy[i];\n for (;;) {\n int ay = tcy + dy[dir];\n int ax = tcx + dx[dir];\n if (field[ay][ax] == '#' || iscontena(ax, ay, ncx, ncy, tSc))\n break;\n tcx += dx[dir];\n tcy += dy[dir];\n if (field[ay][ax] == 'w' && !isdel(ax, ay, ncx, ncy)) {\n ttSc |= 1 << i;\n break;\n }\n }\n if (tcx == ncx[i] && tcy == ncy[i])\n continue;\n char ttcx[3], ttcy[3];\n rep(k, 3) ttcx[i] = ttcy[i] = 0;\n rep(k, csize) ttcx[k] = ncx[k], ttcy[k] = ncy[k];\n ttcx[i] = tcx, ttcy[i] = tcy;\n if (dp.count(state(tx, ty, ttcx, ttcy, ttSc)) == 0 ||\n dp[state(tx, ty, ttcx, ttcy, ttSc)] > cost + bfscost[ty][tx]) {\n dp[state(tx, ty, ttcx, ttcy, ttSc)] = cost + bfscost[ty][tx];\n q.push(make_pair(cost + bfscost[ty][tx],\n state(tx, ty, ttcx, ttcy, ttSc)));\n }\n }\n }\n }\n printf(\"%d\\n\", res == INT_MAX ? -1 : res);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3600,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1038_2664313",
"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\nstruct Info{\n\tchar table[10][11];\n\tint current_row,current_col,sum_cost;\n};\n\nint H,W,goal_row,goal_col;\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\nmap<ll,bool>MAP;\n\nll makeCode(char table[10][11]){\n\n\tll ret,nakamura_pos,panel[3] = {0,0,0},container[3] = {0,0,0},p_index = 0,c_index = 0;\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tswitch(table[row][col]){\n\t\t\tcase '@':\n\t\t\t\tnakamura_pos = 10*row+col;\n\t\t\t\tbreak;\n\t\t\tcase 'w':\n\t\t\t\tpanel[p_index++] = 10*row+col;\n\t\t\t\tbreak;\n\t\t\tcase 'c':\n\t\t\t\tcontainer[c_index++] = 10*row+col;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\t//Do nothing\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tret = nakamura_pos*1000000000000;\n\tret += panel[0]*10000000000+panel[1]*100000000+panel[2]*1000000;\n\tret += container[0]*10000+container[1]*100+container[2];\n\n\treturn ret;\n}\n\nvoid copyInfo(Info& to,Info from){\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++)to.table[row][col] = from.table[row][col];\n\t}\n\tto.sum_cost = from.sum_cost;\n}\n\nvoid func(){\n\n\tMAP.clear();\n\n\tInfo first;\n\tfirst.sum_cost = 0;\n\n\tfor(int row = 0; row < H; row++){\n\t\tscanf(\"%s\",first.table[row]);\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(first.table[row][col] == '@'){\n\t\t\t\tfirst.current_row = row;\n\t\t\t\tfirst.current_col = col;\n\t\t\t}else if(first.table[row][col] == 'E'){\n\t\t\t\tgoal_row = row;\n\t\t\t\tgoal_col = col;\n\t\t\t}\n\t\t}\n\t}\n\n\tll tmp_code = makeCode(first.table);\n\tMAP[tmp_code] = true;\n\n\tqueue<Info> Q;\n\tQ.push(first);\n\n\tint adj_row,adj_col,next_row,next_col;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.front().current_row == goal_row && Q.front().current_col == goal_col){\n\t\t\tprintf(\"%d\\n\",Q.front().sum_cost);\n\t\t\treturn;\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < 4; i++){\n\t\t\t\tadj_row = Q.front().current_row+diff_row[i];\n\t\t\t\tadj_col = Q.front().current_col+diff_col[i];\n\n\t\t\t\tif(Q.front().table[adj_row][adj_col] == '#' || Q.front().table[adj_row][adj_col] == 'w')continue;\n\n\t\t\t\tif(Q.front().table[adj_row][adj_col] == 'c'){\n\n\t\t\t\t\tnext_row = -1;\n\n\t\t\t\t\tswitch(i){\n\t\t\t\t\tcase 0:\n\t\t\t\t\t\tfor(int row = adj_row; row >= 0; row--){\n\t\t\t\t\t\t\tswitch(Q.front().table[row-1][adj_col]){\n\t\t\t\t\t\t\tcase '.':\n\t\t\t\t\t\t\tcase 'E':\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase '#':\n\t\t\t\t\t\t\t\tnext_row = row;\n\t\t\t\t\t\t\t\tnext_col = adj_col;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'w':\n\t\t\t\t\t\t\t\tnext_row = row-1;\n\t\t\t\t\t\t\t\tnext_col = adj_col;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'c':\n\t\t\t\t\t\t\t\tnext_row = row;\n\t\t\t\t\t\t\t\tnext_col = adj_col;\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(next_row != -1)break;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 1:\n\t\t\t\t\t\tfor(int col = adj_col; col >= 0; col--){\n\t\t\t\t\t\t\tswitch(Q.front().table[adj_row][col-1]){\n\t\t\t\t\t\t\tcase '.':\n\t\t\t\t\t\t\tcase 'E':\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase '#':\n\t\t\t\t\t\t\t\tnext_row = adj_row;\n\t\t\t\t\t\t\t\tnext_col = col;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'w':\n\t\t\t\t\t\t\t\tnext_row = adj_row;\n\t\t\t\t\t\t\t\tnext_col = col-1;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'c':\n\t\t\t\t\t\t\t\tnext_row = adj_row;\n\t\t\t\t\t\t\t\tnext_col = col;\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(next_row != -1)break;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 2:\n\t\t\t\t\t\tfor(int col = adj_col; col <= W-1; col++){\n\t\t\t\t\t\t\tswitch(Q.front().table[adj_row][col+1]){\n\t\t\t\t\t\t\tcase '.':\n\t\t\t\t\t\t\tcase 'E':\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase '#':\n\t\t\t\t\t\t\t\tnext_row = adj_row;\n\t\t\t\t\t\t\t\tnext_col = col;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'w':\n\t\t\t\t\t\t\t\tnext_row = adj_row;\n\t\t\t\t\t\t\t\tnext_col = col+1;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'c':\n\t\t\t\t\t\t\t\tnext_row = adj_row;\n\t\t\t\t\t\t\t\tnext_col = col;\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(next_row != -1)break;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 3:\n\t\t\t\t\t\tfor(int row = adj_row; row <= H-1; row++){\n\t\t\t\t\t\t\tswitch(Q.front().table[row+1][adj_col]){\n\t\t\t\t\t\t\tcase '.':\n\t\t\t\t\t\t\tcase 'E':\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase '#':\n\t\t\t\t\t\t\t\tnext_row = row;\n\t\t\t\t\t\t\t\tnext_col = adj_col;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'w':\n\t\t\t\t\t\t\t\tnext_row = row+1;\n\t\t\t\t\t\t\t\tnext_col = adj_col;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'c':\n\t\t\t\t\t\t\t\tnext_row = row;\n\t\t\t\t\t\t\t\tnext_col = adj_col;\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(next_row != -1)break;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(adj_row == next_row && adj_col == next_col)continue;\n\n\t\t\t\t\tInfo next_info;\n\t\t\t\t\tcopyInfo(next_info,Q.front());\n\n\t\t\t\t\tnext_info.table[adj_row][adj_col] = '.';\n\n\t\t\t\t\tswitch(next_info.table[next_row][next_col]){\n\t\t\t\t\tcase '.':\n\t\t\t\t\tcase 'E':\n\t\t\t\t\t\tnext_info.table[next_row][next_col] = 'c';\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'w':\n\t\t\t\t\t\tnext_info.table[next_row][next_col] = '.';\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\ttmp_code = makeCode(next_info.table);\n\n\t\t\t\t\tauto at = MAP.find(tmp_code);\n\n\t\t\t\t\tif(at != MAP.end())continue;\n\n\t\t\t\t\tnext_info.current_row = Q.front().current_row;\n\t\t\t\t\tnext_info.current_col = Q.front().current_col;\n\n\t\t\t\t\tQ.push(next_info);\n\n\t\t\t\t}else{ //'E'or'.'\n\n\t\t\t\t\tInfo next_info;\n\t\t\t\t\tcopyInfo(next_info,Q.front());\n\t\t\t\t\tnext_info.table[adj_row][adj_col] = '@';\n\t\t\t\t\tnext_info.table[Q.front().current_row][Q.front().current_col] = '.';\n\n\t\t\t\t\ttmp_code = makeCode(next_info.table);\n\n\t\t\t\t\tauto at = MAP.find(tmp_code);\n\t\t\t\t\tif(at != MAP.end())continue;\n\n\t\t\t\t\tMAP[tmp_code] = true;\n\t\t\t\t\tnext_info.sum_cost++;\n\t\t\t\t\tnext_info.current_row = adj_row;\n\t\t\t\t\tnext_info.current_col = adj_col;\n\n\t\t\t\t\tQ.push(next_info);\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n\tprintf(\"-1\\n\");\n}\n\nint main(){\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": 120,
"memory_kb": 6376,
"score_of_the_acc": -0.1763,
"final_rank": 3
},
{
"submission_id": "aoj_1038_2664311",
"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\nstruct Info{\n\tchar table[10][11];\n\tint current_row,current_col,sum_cost;\n};\n\nint H,W,goal_row,goal_col;\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\nmap<ll,bool>MAP;\n\nll makeCode(char table[10][11]){\n\n\tll ret,nakamura_pos,panel[3] = {0,0,0},container[3] = {0,0,0},p_index = 0,c_index = 0;\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tswitch(table[row][col]){\n\t\t\tcase '@':\n\t\t\t\tnakamura_pos = 10*row+col;\n\t\t\t\tbreak;\n\t\t\tcase 'w':\n\t\t\t\tpanel[p_index++] = 10*row+col;\n\t\t\t\tbreak;\n\t\t\tcase 'c':\n\t\t\t\tcontainer[c_index++] = 10*row+col;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\t//Do nothing\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tret = nakamura_pos*1000000000000;\n\tret += panel[0]*10000000000+panel[1]*100000000+panel[2]*1000000;\n\tret += container[0]*10000+container[1]*100+container[2];\n\n\treturn ret;\n}\n\nvoid copyInfo(Info& to,Info from){\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++)to.table[row][col] = from.table[row][col];\n\t}\n\tto.sum_cost = from.sum_cost;\n}\n\nvoid func(){\n\n\tMAP.clear();\n\n\tInfo first;\n\tfirst.sum_cost = 0;\n\n\tfor(int row = 0; row < H; row++){\n\t\tscanf(\"%s\",first.table[row]);\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(first.table[row][col] == '@'){\n\t\t\t\tfirst.current_row = row;\n\t\t\t\tfirst.current_col = col;\n\t\t\t}else if(first.table[row][col] == 'E'){\n\t\t\t\tgoal_row = row;\n\t\t\t\tgoal_col = col;\n\t\t\t}\n\t\t}\n\t}\n\n\tll tmp_code = makeCode(first.table);\n\tMAP[tmp_code] = true;\n\n\tqueue<Info> Q;\n\tQ.push(first);\n\n\tint adj_row,adj_col,next_row,next_col;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.front().current_row == goal_row && Q.front().current_col == goal_col){\n\t\t\tprintf(\"%d\\n\",Q.front().sum_cost);\n\t\t\treturn;\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < 4; i++){\n\t\t\t\tadj_row = Q.front().current_row+diff_row[i];\n\t\t\t\tadj_col = Q.front().current_col+diff_col[i];\n\n\t\t\t\tif(Q.front().table[adj_row][adj_col] == '#' || Q.front().table[adj_row][adj_col] == 'w')continue; //?£???????????????????SKIP\n\n\t\t\t\tif(Q.front().table[adj_row][adj_col] == 'c'){ //?????????????????´???\n\n\t\t\t\t\tnext_row = -1;\n\n\t\t\t\t\tswitch(i){\n\t\t\t\t\tcase 0: //???????????????????????????????????????\n\t\t\t\t\t\tfor(int row = adj_row; row >= 0; row--){\n\t\t\t\t\t\t\tswitch(Q.front().table[row-1][adj_col]){\n\t\t\t\t\t\t\tcase '.':\n\t\t\t\t\t\t\tcase 'E':\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase '#':\n\t\t\t\t\t\t\t\tnext_row = row;\n\t\t\t\t\t\t\t\tnext_col = adj_col;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'w':\n\t\t\t\t\t\t\t\tnext_row = row-1;\n\t\t\t\t\t\t\t\tnext_col = adj_col;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'c':\n\t\t\t\t\t\t\t\tnext_row = row;\n\t\t\t\t\t\t\t\tnext_col = adj_col;\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(next_row != -1)break;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 1: //???????????????????????????????????????\n\n\t\t\t\t\t\tfor(int col = adj_col; col >= 0; col--){\n\t\t\t\t\t\t\tswitch(Q.front().table[adj_row][col-1]){\n\t\t\t\t\t\t\tcase '.':\n\t\t\t\t\t\t\tcase 'E':\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase '#':\n\t\t\t\t\t\t\t\tnext_row = adj_row;\n\t\t\t\t\t\t\t\tnext_col = col;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'w':\n\t\t\t\t\t\t\t\tnext_row = adj_row;\n\t\t\t\t\t\t\t\tnext_col = col-1;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'c':\n\t\t\t\t\t\t\t\tnext_row = adj_row;\n\t\t\t\t\t\t\t\tnext_col = col;\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(next_row != -1)break;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 2: //???????????????????????????????????????\n\n\t\t\t\t\t\tfor(int col = adj_col; col <= W-1; col++){\n\t\t\t\t\t\t\tswitch(Q.front().table[adj_row][col+1]){\n\t\t\t\t\t\t\tcase '.':\n\t\t\t\t\t\t\tcase 'E':\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase '#':\n\t\t\t\t\t\t\t\tnext_row = adj_row;\n\t\t\t\t\t\t\t\tnext_col = col;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'w':\n\t\t\t\t\t\t\t\tnext_row = adj_row;\n\t\t\t\t\t\t\t\tnext_col = col+1;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'c':\n\t\t\t\t\t\t\t\tnext_row = adj_row;\n\t\t\t\t\t\t\t\tnext_col = col;\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(next_row != -1)break;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 3: //???????????????????????????????????????\n\t\t\t\t\t\tfor(int row = adj_row; row <= H-1; row++){\n\t\t\t\t\t\t\tswitch(Q.front().table[row+1][adj_col]){ //1????????????????????????\n\t\t\t\t\t\t\tcase '.':\n\t\t\t\t\t\t\tcase 'E':\n\t\t\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase '#':\n\t\t\t\t\t\t\t\tnext_row = row;\n\t\t\t\t\t\t\t\tnext_col = adj_col;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'w':\n\t\t\t\t\t\t\t\tnext_row = row+1;\n\t\t\t\t\t\t\t\tnext_col = adj_col;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase 'c':\n\t\t\t\t\t\t\t\tnext_row = row;\n\t\t\t\t\t\t\t\tnext_col = adj_col;\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(next_row != -1)break;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(adj_row == next_row && adj_col == next_col)continue; //????????????????§???????????????´??????????§?????????¨??????????????????????????????\n\n\t\t\t\t\tInfo next_info;\n\t\t\t\t\tcopyInfo(next_info,Q.front());\n\n\t\t\t\t\tnext_info.table[adj_row][adj_col] = '.'; //???????????????????¶?????????????\n\n\t\t\t\t\tswitch(next_info.table[next_row][next_col]){\n\t\t\t\t\tcase '.':\n\t\t\t\t\tcase 'E':\n\t\t\t\t\t\tnext_info.table[next_row][next_col] = 'c';\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'w':\n\t\t\t\t\t\tnext_info.table[next_row][next_col] = '.';\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\ttmp_code = makeCode(next_info.table);\n\n\t\t\t\t\tauto at = MAP.find(tmp_code);\n\n\t\t\t\t\tif(at != MAP.end())continue;\n\n\t\t\t\t\tnext_info.current_row = Q.front().current_row;\n\t\t\t\t\tnext_info.current_col = Q.front().current_col;\n\n\t\t\t\t\tQ.push(next_info);\n\n\t\t\t\t}else{ //'E'or'.'\n\n\t\t\t\t\tInfo next_info;\n\t\t\t\t\tcopyInfo(next_info,Q.front());\n\t\t\t\t\tnext_info.table[adj_row][adj_col] = '@';\n\t\t\t\t\tnext_info.table[Q.front().current_row][Q.front().current_col] = '.';\n\n\t\t\t\t\ttmp_code = makeCode(next_info.table);\n\n\t\t\t\t\tauto at = MAP.find(tmp_code);\n\t\t\t\t\tif(at != MAP.end())continue;\n\n\t\t\t\t\tMAP[tmp_code] = true;\n\t\t\t\t\tnext_info.sum_cost++;\n\t\t\t\t\tnext_info.current_row = adj_row;\n\t\t\t\t\tnext_info.current_col = adj_col;\n\n\t\t\t\t\tQ.push(next_info);\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n\tprintf(\"-1\\n\");\n}\n\nint main(){\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": 120,
"memory_kb": 6504,
"score_of_the_acc": -0.1788,
"final_rank": 4
},
{
"submission_id": "aoj_1038_2152579",
"code_snippet": "#include \"bits/stdc++.h\"\n#include <unordered_map>\nusing namespace std;\n\nconst int dx[4] = { -1,0,1,0 };\nconst int dy[4] = { 0,1,0,-1 };\nstruct status {\n\tvector<vector<int>>field;\n\tint drx;\n\tint dry;\n\tvector<int>p_ons;\n\tvector<pair<int, int>>ps;\n\tvector<pair<int, int>>cs;\n};\nstatus mk_sta(const vector<vector<int>>&field,int drx,int dry,const vector<pair<int,int>>&ps) {\n\tvector<int>p_ons(ps.size());\n\tfor (int i = 0; i < ps.size(); ++i) {\n\t\tp_ons[i]=field[ps[i].second][ps[i].first] >= 200;\n\t}\n\tvector<pair<int, int>>cs;\n\tfor (int y = 0; y < field.size(); ++y) {\n\t\tfor (int x = 0; x < field[y].size(); ++x) {\n\t\t\tif (field[y][x] == 100)cs.push_back(make_pair(x, y));\n\t\t}\n\t}\n\treturn status{ field,drx,dry,p_ons,ps,cs };\n}\nclass HashVI { // ???????????\\??¢??°???????????§??????\npublic:\n\tsize_t operator()(const status &x) const {\n\t\tsize_t t = 0;\n\t\tt *= 10;\n\t\tt += x.drx;\n\t\tt *= 10;\n\t\tt += x.dry;\n\t\tfor (int i = 0; i < x.p_ons.size(); ++i) {\n\t\t\tt *= 2;\n\t\t\tt += x.p_ons[i];\n\t\t}\n\t\tfor (int i = 0; i < x.cs.size(); ++i) {\n\t\t\tt *= 10;\n\t\t\tt += x.cs[i].first;\n\t\t\tt *= 10;\n\t\t\tt += x.cs[i].second;\n\t\t}\n\t\treturn t;\n\t}\n};\nclass Equal {\npublic:\n\tbool operator()(const status&l, const status&r)const {\n\t\treturn l.cs == r.cs&&l.p_ons == r.p_ons&&l.drx == r.drx&&l.dry == r.dry;\n\t}\n};\nunordered_map<status, int, HashVI,Equal>mp;\nvector<vector<int>>mov(vector<vector<int>>field, int fromx, int fromy, int way) {\n\tfield[fromy][fromx] = 1;\n\twhile (1) {\n\t\tint nextx = fromx + dx[way];\n\t\tint nexty = fromy + dy[way];\n\t\t\n\t\t if (field[nexty][nextx] >= 200) {\n\t\t\tfield[nexty][nextx] = 1;\n\t\t\tfromx = nextx;\n\t\t\tfromy = nexty;\n\t\t\treturn field;\n\t\t }\n\t\t else if (field[nexty][nextx]!=1) {\n\t\t\t field[fromy][fromx] = 100;\n\t\t\t return field;\n\t\t }\n\t\t else {\n\t\t\t fromx = nextx;\n\t\t\t fromy = nexty;\n\t\t}\n\t}\n\tassert(false);\n}\nstruct aa {\n\tstatus sta;\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};\nint gx, gy;\nint solve(const status&sta) {\n\tqueue<aa>que;\n\tque.push(aa{ sta,0 });\n\twhile (!que.empty()) {\n\t\tauto atop = que.front();\n\t\tque.pop();\n\t\tstatus sta=atop.sta;\n\t\tint turn = atop.time;\n\t\tif (mp.find(sta) == mp.end()) {\n\t\t\tmp[sta] = turn;\n\t\t\tvector<vector<int>>field = sta.field;\n\t\t\tint ans = 1e8;\n\t\t\tconst int nowx = sta.drx;\n\t\t\tconst int nowy = sta.dry;\n\t\t\tfor (int way = 0; way < 4; ++way) {\n\t\t\t\tconst int nextx = nowx + dx[way];\n\t\t\t\tconst int nexty = nowy + dy[way];\n\t\t\t\tvector<int>panel_ons(sta.p_ons);\n\t\t\t\tvector<pair<int, int>>panels(sta.ps);\n\t\t\t\tvector<pair<int, int>>cons(sta.cs);\n\t\t\t\tif (field[nexty][nextx] == 0) {\n\t\t\t\t}\n\t\t\t\telse if (field[nexty][nextx] == 100) {\n\t\t\t\t\tauto next_field = mov(field, nextx, nexty, way);\n\t\t\t\t\tif (next_field[nexty][nextx] == 1) {\n\t\t\t\t\t\tque.push(aa{ mk_sta(next_field,nowx,nowy,sta.ps),turn });\n\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (field[nexty][nextx] == 1) {\n\t\t\t\t\tif (nexty == gy&&nextx == gx) {\n\t\t\t\t\t\treturn turn + 1;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\n\t\t\t\t\t\tque.push(aa{ mk_sta(field,nextx,nexty,sta.ps),turn + 1 });\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\treturn -1;\n}\n\nint main() {\n\twhile (1) {\n\t\tmp.clear();\n\t\tint H, W; cin >> H >> W;\n\t\tif (!H)break;\n\t\tvector<vector<int>>field(H, vector<int>(W));\n\t\tint sx, sy;\n\t\tvector<pair<int, int>>cs;\n\t\tvector<pair<int, int>>ps;\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tstring st; cin >> st;\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tif (st[j] == '#') {\n\t\t\t\t\tfield[i][j] = 0;\n\t\t\t\t}\n\t\t\t\telse if (st[j] == '@') {\n\t\t\t\t\tfield[i][j] = 1;\n\t\t\t\t\tsx = j; sy = i;\n\t\t\t\t}\n\t\t\t\telse if (st[j] == 'w') {\n\t\t\t\t\tfield[i][j] = 200+ps.size();\n\t\t\t\t\tps.emplace_back(j, i);\n\t\t\t\t}\n\t\t\t\telse if (st[j] == 'c') {\n\t\t\t\t\tfield[i][j] = 100;\n\t\t\t\t\tcs.emplace_back(j, i);\n\t\t\t\t}\n\t\t\t\telse if (st[j] == 'E') {\n\t\t\t\t\tfield[i][j]=1;\n\t\t\t\t\tgx = j;\n\t\t\t\t\tgy = i;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tfield[i][j] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans = solve(mk_sta(field, sx, sy, ps));\n\t\tif (ans > 1e7)ans = -1;\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 850,
"memory_kb": 53376,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_1038_1867110",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX_H 15\n#define MAX_W 15\n \nint p,c;\n \nclass State{\npublic:\n int x,y,px[3],py[3],cx[3],cy[3];\n bool operator < (const State &s)const{\n\tif(x != s.x){\n\t return x < s.x;\n\t}else if(y != s.y){\n\t return y < s.y;\n\t}else{\n\t for(int i = 0 ; i < p ; i++){\n\t\tif(px[i] != s.px[i]){\n\t\t return px[i] < s.px[i];\n\t\t}else if(py[i] != s.py[i]){\n\t\t return py[i] < s.py[i];\n\t\t}\n\t }\n\t for(int i = 0 ; i < c ; i++){\n\t\tif(cx[i] != s.cx[i]){\n\t\t return cx[i] < s.cx[i];\n\t\t}else if(cy[i] != s.cy[i]){\n\t\t return cy[i] < s.cy[i];\n\t\t}\n\t }\n\t return false;\n\t}\n }\n};\n \nint H,W,gx,gy;\nset<State> visited;\nchar field[MAX_H][MAX_W];\nState start;\nconst int dx[] = {-1,0,1,0};\nconst int dy[] = {0,-1,0,1};\n \nvoid init(){\n p = c = 0;\n visited.clear();\n}\n \nbool input(){\n cin >> H >> W;\n if(H == 0 && W == 0){\n\treturn false;\n }\n init();\n for(int i = 0 ; i < H ; i++){\n\tfor(int j = 0 ; j < W ; j++){\n\t cin >> field[i][j];\n\t if(field[i][j] == '@'){\n\t\tstart.x = j; start.y = i;\n\t }else if(field[i][j] == 'E'){\n\t\tgx = j; gy = i;\n\t }else if(field[i][j] == 'w'){\n\t\tstart.px[p] = j; start.py[p] = i;\n\t\tp++;\n\t }else if(field[i][j] == 'c'){\n\t\tfield[i][j] = '.';\n\t\tstart.cx[c] = j; start.cy[c] = i;\n\t\tc++;\n\t }\n\t}\n }\n return true;\n}\n \ninline bool valid(const State &s){\n if(field[s.y][s.x] == '#'){\n\treturn false;\n }\n for(int i = 0 ; i < p ; i++){\n\tif(s.x == s.px[i] && s.y == s.py[i]){\n\t return false;\n\t}\n }\n for(int i = 0 ; i < c ; i++){\n\tif(s.x == s.cx[i] && s.y == s.cy[i]){\n\t return false;\n\t}\n }\n return true;\n}\n \ninline bool pushCont(State &s,int dir){\n int idx = -1;\n int nx = s.x + dx[dir], ny = s.y + dy[dir];\n for(int i = 0 ; i < c ; i++){\n\tif(s.cx[i] == nx && s.cy[i] == ny){\n\t idx = i;\n\t break;\n\t}\n }\n if(idx == -1){ return false; }\n while(true){\n\tnx += dx[dir], ny += dy[dir];\n\tif(field[ny][nx] == '#'){\n\t s.cx[idx] = nx-dx[dir];\n\t s.cy[idx] = ny-dy[dir];\n\t return true;\n\t}\n\tfor(int i = 0 ; i < c ; i++){\n\t if(i == idx) continue;\n\t if(s.cx[i] == nx && s.cy[i] == ny){\n\t\ts.cx[idx] = nx-dx[dir];\n\t\ts.cy[idx] = ny-dy[dir];\n\t\treturn true;\n\t }\n\t}\n\tfor(int i = 0 ; i < p ; i++){\n\t if(s.px[i] == nx && s.py[i] == ny){\n\t\ts.px[i] = s.py[i] = -1;\n\t\ts.cx[idx] = s.cy[idx] = -1;\n\t\treturn true;\n\t }\n\t}\n }\n return false;\n}\n \nint solve(){\n deque<State> Q;\n deque<int> move;\n Q.push_front(start);\n move.push_front(0);\n visited.insert(start);\n \n while(!Q.empty()){\n\tState s = Q.front(); Q.pop_front();\n\tint m = move.front(); move.pop_front();\n\tif(s.x == gx && s.y == gy){\n\t return m;\n\t}\n\tfor(int i = 0 ; i < 4 ; i++){\n\t State tmp = s;\n\t s.x += dx[i], s.y += dy[i];\n\t if(valid(s)){\n\t\tif(!visited.count(s)){\n\t\t visited.insert(s);\n\t\t Q.push_back(s);\n\t\t move.push_back(m+1);\n\t\t}\n\t }\n\t s.x -= dx[i], s.y -= dy[i];\n\t if(pushCont(s,i)){\n\t\tif(!visited.count(s)){\n\t\t visited.insert(s);\n\t\t Q.push_front(s);\n\t\t move.push_front(m);\n\t\t}\n\t }\n\t s = tmp;\n\t}\n }\n return -1;\n}\n \nint main(){\n while(input()){\n\tcout << solve() << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 9924,
"score_of_the_acc": -0.2716,
"final_rank": 7
},
{
"submission_id": "aoj_1038_1163871",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX_H 15\n#define MAX_W 15\n\nint p,c;\n\nclass State{\npublic:\n int x,y,px[3],py[3],cx[3],cy[3];\n bool operator < (const State &s)const{\n if(x != s.x){\n return x < s.x;\n }else if(y != s.y){\n return y < s.y;\n }else{\n for(int i = 0 ; i < p ; i++){\n if(px[i] != s.px[i]){\n return px[i] < s.px[i];\n }else if(py[i] != s.py[i]){\n return py[i] < s.py[i];\n }\n }\n for(int i = 0 ; i < c ; i++){\n if(cx[i] != s.cx[i]){\n return cx[i] < s.cx[i];\n }else if(cy[i] != s.cy[i]){\n return cy[i] < s.cy[i];\n }\n }\n return false;\n }\n }\n};\n\nint H,W,gx,gy;\nset<State> visited;\nchar field[MAX_H][MAX_W];\nState start;\nconst int dx[] = {-1,0,1,0};\nconst int dy[] = {0,-1,0,1};\n\nvoid init(){\n p = c = 0;\n visited.clear();\n}\n\nbool input(){\n cin >> H >> W;\n if(H == 0 && W == 0){\n return false;\n }\n init();\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] == '@'){\n start.x = j; start.y = i;\n }else if(field[i][j] == 'E'){\n gx = j; gy = i;\n }else if(field[i][j] == 'w'){\n start.px[p] = j; start.py[p] = i;\n p++;\n }else if(field[i][j] == 'c'){\n field[i][j] = '.';\n start.cx[c] = j; start.cy[c] = i;\n c++;\n }\n }\n }\n return true;\n}\n\ninline bool valid(const State &s){\n if(field[s.y][s.x] == '#'){\n return false;\n }\n for(int i = 0 ; i < p ; i++){\n if(s.x == s.px[i] && s.y == s.py[i]){\n return false;\n }\n }\n for(int i = 0 ; i < c ; i++){\n if(s.x == s.cx[i] && s.y == s.cy[i]){\n return false;\n }\n }\n return true;\n}\n\ninline bool pushCont(State &s,int dir){\n int idx = -1;\n int nx = s.x + dx[dir], ny = s.y + dy[dir];\n for(int i = 0 ; i < c ; i++){\n if(s.cx[i] == nx && s.cy[i] == ny){\n idx = i;\n break;\n }\n }\n if(idx == -1){ return false; }\n while(true){\n nx += dx[dir], ny += dy[dir];\n if(field[ny][nx] == '#'){\n s.cx[idx] = nx-dx[dir];\n s.cy[idx] = ny-dy[dir];\n return true;\n }\n for(int i = 0 ; i < c ; i++){\n if(i == idx) continue;\n if(s.cx[i] == nx && s.cy[i] == ny){\n s.cx[idx] = nx-dx[dir];\n s.cy[idx] = ny-dy[dir];\n return true;\n }\n }\n for(int i = 0 ; i < p ; i++){\n if(s.px[i] == nx && s.py[i] == ny){\n s.px[i] = s.py[i] = -1;\n s.cx[idx] = s.cy[idx] = -1;\n return true;\n }\n }\n }\n return false;\n}\n\nint solve(){\n deque<State> Q;\n deque<int> move;\n Q.push_front(start);\n move.push_front(0);\n visited.insert(start);\n\n while(!Q.empty()){\n State s = Q.front(); Q.pop_front();\n int m = move.front(); move.pop_front();\n if(s.x == gx && s.y == gy){\n return m;\n }\n for(int i = 0 ; i < 4 ; i++){\n State tmp = s;\n s.x += dx[i], s.y += dy[i];\n if(valid(s)){\n if(!visited.count(s)){\n visited.insert(s);\n Q.push_back(s);\n move.push_back(m+1);\n }\n }\n s.x -= dx[i], s.y -= dy[i];\n if(pushCont(s,i)){\n if(!visited.count(s)){\n visited.insert(s);\n Q.push_front(s);\n move.push_front(m);\n }\n }\n s = tmp;\n }\n }\n return -1;\n}\n\nint main(){\n while(input()){\n cout << solve() << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 8044,
"score_of_the_acc": -0.27,
"final_rank": 5
},
{
"submission_id": "aoj_1038_1163869",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX_H 15\n#define MAX_W 15\n\nclass State{\npublic:\n int x,y,px[3],py[3],cx[3],cy[3];\n State(){\n x = y = -1;\n for(int i = 0 ; i < 3 ; i++){\n px[i] = py[i] = cx[i] = cy[i] = -1;\n }\n }\n bool operator < (const State &s)const{\n if(x != s.x){\n return x < s.x;\n }else if(y != s.y){\n return y < s.y;\n }else{\n for(int i = 0 ; i < 3 ; i++){\n if(px[i] != s.px[i]){\n return px[i] < s.px[i];\n }else if(py[i] != s.py[i]){\n return py[i] < s.py[i];\n }\n }\n for(int i = 0 ; i < 3 ; i++){\n if(cx[i] != s.cx[i]){\n return cx[i] < s.cx[i];\n }else if(cy[i] != s.cy[i]){\n return cy[i] < s.cy[i];\n }\n }\n return false;\n }\n }\n};\n\nint H,W,gx,gy,p,c;\nset<State> visited;\nchar field[MAX_H][MAX_W];\nState start;\nconst int dx[] = {-1,0,1,0};\nconst int dy[] = {0,-1,0,1};\n\nvoid init(){\n p = c = 0;\n visited.clear();\n}\n\nbool input(){\n cin >> H >> W;\n if(H == 0 && W == 0){\n return false;\n }\n init();\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] == '@'){\n start.x = j; start.y = i;\n }else if(field[i][j] == 'E'){\n gx = j; gy = i;\n }else if(field[i][j] == 'w'){\n start.px[p] = j; start.py[p] = i;\n p++;\n }else if(field[i][j] == 'c'){\n field[i][j] = '.';\n start.cx[c] = j; start.cy[c] = i;\n c++;\n }\n }\n }\n return true;\n}\n\nbool valid(const State &s){\n if(field[s.y][s.x] == '#'){\n return false;\n }\n for(int i = 0 ; i < p ; i++){\n if(s.x == s.px[i] && s.y == s.py[i]){\n return false;\n }\n }\n for(int i = 0 ; i < c ; i++){\n if(s.x == s.cx[i] && s.y == s.cy[i]){\n return false;\n }\n }\n return true;\n}\n\nbool pushCont(State &s,int dir){\n int idx = -1;\n int nx = s.x + dx[dir], ny = s.y + dy[dir];\n for(int i = 0 ; i < c ; i++){\n if(s.cx[i] == nx && s.cy[i] == ny){\n idx = i;\n break;\n }\n }\n if(idx == -1){ return false; }\n while(true){\n nx += dx[dir], ny += dy[dir];\n if(field[ny][nx] == '#'){\n s.cx[idx] = nx-dx[dir];\n s.cy[idx] = ny-dy[dir];\n return true;\n }\n for(int i = 0 ; i < c ; i++){\n if(i == idx) continue;\n if(s.cx[i] == nx && s.cy[i] == ny){\n s.cx[idx] = nx-dx[dir];\n s.cy[idx] = ny-dy[dir];\n return true;\n }\n }\n for(int i = 0 ; i < p ; i++){\n if(s.px[i] == nx && s.py[i] == ny){\n s.px[i] = s.py[i] = -1;\n s.cx[idx] = s.cy[idx] = -1;\n return true;\n }\n }\n }\n return false;\n}\n\nint solve(){\n deque<State> Q;\n deque<int> move;\n Q.push_front(start);\n move.push_front(0);\n visited.insert(start);\n\n while(!Q.empty()){\n State s = Q.front(); Q.pop_front();\n int m = move.front(); move.pop_front();\n if(s.x == gx && s.y == gy){\n return m;\n }\n for(int i = 0 ; i < 4 ; i++){\n State tmp = s;\n s.x += dx[i], s.y += dy[i];\n if(valid(s)){\n if(!visited.count(s)){\n visited.insert(s);\n Q.push_back(s);\n move.push_back(m+1);\n }\n }\n s = tmp;\n if(pushCont(s,i)){\n if(!visited.count(s)){\n visited.insert(s);\n Q.push_front(s);\n move.push_front(m);\n }\n }\n s = tmp;\n }\n }\n return -1;\n}\n\nint main(){\n while(input()){\n cout << solve() << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 8044,
"score_of_the_acc": -0.27,
"final_rank": 5
},
{
"submission_id": "aoj_1038_1162918",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nenum:char{\n\tWALL='#',ME='@',PANEL='w',CONTAINER='c',EMPTY='.',ESCAPE='E'\n};\nconstexpr int di[]={-1,1,0,0},dj[]={0,0,-1,1};\n\nstring encode(const vs& grid,int i,int j)\n{\n\tint h=grid.size(),w=grid[0].size();\n\tstring res;\n\trepi(k,1,h-1) res+=grid[k].substr(1,w-2);\n\tres[(i-1)*(w-2)+j-1]=ME;\n\treturn res;\n}\n\nint main()\n{\n\tfor(int h,w;cin>>h>>w && h|w;){\n\t\tint gi=-1,gj=-1;\n\t\tdeque<tuple<vs,int,int,int>> dq;\n\t\t{\n\t\t\tvs grid(h);\n\t\t\trep(i,h) cin>>grid[i];\n\t\t\trep(i,h) rep(j,w) if(grid[i][j]==ESCAPE){\n\t\t\t\tgi=i,gj=j;\n\t\t\t\tgrid[i][j]=EMPTY;\n\t\t\t}\n\t\t\trep(i,h) rep(j,w) if(grid[i][j]==ME){\n\t\t\t\tgrid[i][j]=EMPTY;\n\t\t\t\tdq.emplace_back(grid,i,j,0);\n\t\t\t}\n\t\t}\n\t\t\n\t\tint res=-1;\n\t\tset<string> vis;\n\t\twhile(dq.size()){\n\t\t\tvs cur; int ci,cj,ct; tie(cur,ci,cj,ct)=move(dq.front()); dq.pop_front();\n\t\t\tif(!vis.insert(encode(cur,ci,cj)).second) continue;\n\t\t\t\n\t\t\tif(ci==gi && cj==gj){\n\t\t\t\tres=ct;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\trep(k,4){\n\t\t\t\tint ni=ci+di[k],nj=cj+dj[k];\n\t\t\t\tif(cur[ni][nj]==WALL || cur[ni][nj]==PANEL) continue;\n\t\t\t\tif(cur[ni][nj]==CONTAINER){\n\t\t\t\t\tint i=ni+di[k],j=nj+dj[k];\n\t\t\t\t\tfor(;;i+=di[k],j+=dj[k]){\n\t\t\t\t\t\tif(cur[i][j]==EMPTY) continue;\n\t\t\t\t\t\tif(cur[i][j]==PANEL) break;\n\t\t\t\t\t\tif(cur[i][j]==WALL || cur[i][j]==CONTAINER){\n\t\t\t\t\t\t\ti-=di[k],j-=dj[k];\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(i==ni && j==nj) continue;\n\t\t\t\t\tvs next=cur;\n\t\t\t\t\tnext[ni][nj]=EMPTY;\n\t\t\t\t\tnext[i][j]=next[i][j]==PANEL?EMPTY:CONTAINER;\n\t\t\t\t\tdq.emplace_front(move(next),ci,cj,ct);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tdq.emplace_back(cur,ni,nj,ct+1);\n\t\t\t}\n\t\t}\n\t\tcout<<res<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 480,
"memory_kb": 9936,
"score_of_the_acc": -0.6815,
"final_rank": 15
},
{
"submission_id": "aoj_1038_1162915",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nenum:char{\n\tWALL='#',ME='@',PANEL='w',CONTAINER='c',EMPTY='.',ESCAPE='E'\n};\nconstexpr int di[]={-1,1,0,0},dj[]={0,0,-1,1};\n\nstring encode(const vs& grid,int i,int j)\n{\n\tint h=grid.size(),w=grid[0].size();\n\tstring res;\n\trepi(k,1,h-1) res+=grid[k].substr(1,w-2);\n\tres[(i-1)*(w-2)+j-1]=ME;\n\treturn res;\n}\n\nint main()\n{\n\tfor(int h,w;cin>>h>>w && h|w;){\n\t\tint gi=-1,gj=-1;\n\t\tdeque<tuple<vs,int,int,int>> dq;\n\t\t{\n\t\t\tvs grid(h);\n\t\t\trep(i,h) cin>>grid[i];\n\t\t\trep(i,h) rep(j,w) if(grid[i][j]==ESCAPE){\n\t\t\t\tgi=i,gj=j;\n\t\t\t\tgrid[i][j]=EMPTY;\n\t\t\t}\n\t\t\trep(i,h) rep(j,w) if(grid[i][j]==ME){\n\t\t\t\tgrid[i][j]=EMPTY;\n\t\t\t\tdq.emplace_back(grid,i,j,0);\n\t\t\t}\n\t\t}\n\t\t\n\t\tint res=-1;\n\t\tset<string> vis;\n\t\twhile(dq.size()){\n\t\t\tvs cur; int ci,cj,ct; tie(cur,ci,cj,ct)=dq.front(); dq.pop_front();\n\t\t\tif(!vis.insert(encode(cur,ci,cj)).second) continue;\n\t\t\t\n\t\t\tif(ci==gi && cj==gj){\n\t\t\t\tres=ct;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\trep(k,4){\n\t\t\t\tint ni=ci+di[k],nj=cj+dj[k];\n\t\t\t\tif(cur[ni][nj]==WALL || cur[ni][nj]==PANEL) continue;\n\t\t\t\tif(cur[ni][nj]==CONTAINER){\n\t\t\t\t\tint i=ni+di[k],j=nj+dj[k];\n\t\t\t\t\tfor(;;i+=di[k],j+=dj[k]){\n\t\t\t\t\t\tif(cur[i][j]==EMPTY) continue;\n\t\t\t\t\t\tif(cur[i][j]==PANEL) break;\n\t\t\t\t\t\tif(cur[i][j]==WALL || cur[i][j]==CONTAINER){\n\t\t\t\t\t\t\ti-=di[k],j-=dj[k];\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(i==ni && j==nj) continue;\n\t\t\t\t\tvs next=cur;\n\t\t\t\t\tnext[ni][nj]=EMPTY;\n\t\t\t\t\tnext[i][j]=next[i][j]==PANEL?EMPTY:CONTAINER;\n\t\t\t\t\tdq.emplace_front(move(next),ci,cj,ct);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tdq.emplace_back(cur,ni,nj,ct+1);\n\t\t\t}\n\t\t}\n\t\tcout<<res<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 520,
"memory_kb": 10076,
"score_of_the_acc": -0.7325,
"final_rank": 17
},
{
"submission_id": "aoj_1038_1162914",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nenum:char{\n\tWALL='#',ME='@',PANEL='w',CONTAINER='c',EMPTY='.',ESCAPE='E'\n};\nconstexpr int di[]={-1,1,0,0},dj[]={0,0,-1,1};\n\nstring encode(const vs& grid,int i,int j)\n{\n\tint h=grid.size(),w=grid[0].size();\n\tstring res;\n\trepi(k,1,h-1) res+=grid[k].substr(1,w-2);\n\tres[(i-1)*(w-2)+j-1]=ME;\n\treturn res;\n}\n\nint main()\n{\n\tfor(int h,w;cin>>h>>w && h|w;){\n\t\tint gi=-1,gj=-1;\n\t\tdeque<tuple<vs,int,int,int>> dq;\n\t\t{\n\t\t\tvs grid(h);\n\t\t\trep(i,h) cin>>grid[i];\n\t\t\trep(i,h) rep(j,w) if(grid[i][j]==ESCAPE){\n\t\t\t\tgi=i,gj=j;\n\t\t\t\tgrid[i][j]=EMPTY;\n\t\t\t}\n\t\t\trep(i,h) rep(j,w) if(grid[i][j]==ME){\n\t\t\t\tgrid[i][j]=EMPTY;\n\t\t\t\tdq.emplace_back(grid,i,j,0);\n\t\t\t}\n\t\t}\n\t\t\n\t\tint res=-1;\n\t\tset<string> vis;\n\t\twhile(dq.size()){\n\t\t\tvs cur; int ci,cj,ct; tie(cur,ci,cj,ct)=dq.front(); dq.pop_front();\n\t\t\tif(!vis.insert(encode(cur,ci,cj)).second) continue;\n\t\t\t\n\t\t\tif(ci==gi && cj==gj){\n\t\t\t\tres=ct;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\trep(k,4){\n\t\t\t\tint ni=ci+di[k],nj=cj+dj[k];\n\t\t\t\tif(cur[ni][nj]==WALL || cur[ni][nj]==PANEL) continue;\n\t\t\t\tif(cur[ni][nj]==CONTAINER){\n\t\t\t\t\tint i=ni+di[k],j=nj+dj[k];\n\t\t\t\t\tfor(;;i+=di[k],j+=dj[k]){\n\t\t\t\t\t\tif(cur[i][j]==EMPTY) continue;\n\t\t\t\t\t\tif(cur[i][j]==PANEL) break;\n\t\t\t\t\t\tif(cur[i][j]==WALL || cur[i][j]==CONTAINER){\n\t\t\t\t\t\t\ti-=di[k],j-=dj[k];\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(i==ni && j==nj) continue;\n\t\t\t\t\tvs next=cur;\n\t\t\t\t\tnext[ni][nj]=EMPTY;\n\t\t\t\t\tnext[i][j]=next[i][j]==PANEL?EMPTY:CONTAINER;\n\t\t\t\t\tdq.emplace_front(next,ci,cj,ct);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tdq.emplace_back(cur,ni,nj,ct+1);\n\t\t\t}\n\t\t}\n\t\tcout<<res<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 520,
"memory_kb": 9972,
"score_of_the_acc": -0.7304,
"final_rank": 16
},
{
"submission_id": "aoj_1038_1136118",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\n#include<queue>\n#include<set>\n#include<deque>\nusing namespace std;\nchar str[20][20];\nint dx[]={1,0,-1,0};\nint dy[]={0,1,0,-1};\nint main(){\n\tint a,b;\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tfor(int i=0;i<a;i++)scanf(\"%s\",str[i]);\n\t\tint sr,sc;\n\t\tint gr,gc;\n\t\tset<int>v;\n\t\tint m=0;\n\t\tint st=0;\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]=='@'){sr=i;sc=j;}\n\t\t\t\tif(str[i][j]=='E'){gr=i;gc=j;}\n\t\t\t\tif(str[i][j]=='c'){\n\t\t\t\t\tst*=100;\n\t\t\t\t\tst+=i*10+j;\n\t\t\t\t\tm++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tst*=100;\n\t\tst+=sr*10+sc;\n\t\tdeque<pair<int,int> >Q;\n\t\tbool yet=true;\n\t\tQ.push_back(make_pair(0,st));\n\t\twhile(Q.size()){\n\t\t\tint cost=Q.front().first;\n\t\t\tint at=Q.front().second;\n\t\t\tQ.pop_front();\n\t\t\tif(v.count(at))continue;\n\t\t\t\n\t\t//\tprintf(\"%d %d\\n\",cost,at);\n\t\t\tv.insert(at);\n\t\t\tif(at%100==gr*10+gc){\n\t\t\t\tyet=false;\n\t\t\t\tprintf(\"%d\\n\",cost);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tint row=at%100/10;\n\t\t\tint col=at%10;\n\t\t\tint tmp=at;\n\t\t\ttmp/=100;\n\t\t\tint br[5];\n\t\t\tint bc[5];\n\t\t\tfor(int i=0;i<m;i++){\n\t\t\t\tbr[i]=tmp%100/10;\n\t\t\t\tbc[i]=tmp%10;\n\t\t\t\ttmp/=100;\n\t\t\t}\n\t\t\tfor(int i=0;i<4;i++){\n\t\t\t\tif(0<=row+dx[i]&&row+dx[i]<a&&0<=col+dy[i]&&col+dy[i]<b&&str[row+dx[i]][col+dy[i]]!='#'){\n\t\t\t\t\tbool W=false;\n\t\t\t\t\tbool C=false;\n\t\t\t\t\tfor(int j=0;j<m;j++)if(row+dx[i]==br[j]&&col+dy[i]==bc[j])C=true;\n\t\t\t\t\tif(str[row+dx[i]][col+dy[i]]=='w')W=true;\n\t\t\t\t\tif(C&&!W){\n\t\t\t\t\t\tint nr=row+dx[i];\n\t\t\t\t\t\tint nc=col+dy[i];\n\t\t\t\t\t\twhile(str[nr+dx[i]][nc+dy[i]]!='#'){\n\t\t\t\t\t\t\tnr+=dx[i];nc+=dy[i];\n\t\t\t\t\t\t\tbool nk=false;\n\t\t\t\t\t\t\tbool nw=false;\n\t\t\t\t\t\t\tfor(int j=0;j<m;j++)if(nr==br[j]&&nc==bc[j])nk=true;\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tif(str[nr][nc]=='w')nw=true;\n\t\t\t\t\t\t\tif(nw&&!nk)break;\n\t\t\t\t\t\t\tif(nk&&!nw){\n\t\t\t\t\t\t\t\tnr-=dx[i];nc-=dy[i];break;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tint to=at;\n\t\t\t\t\t\tfor(int j=0;j<m;j++)if(row+dx[i]==br[j]&&col+dy[i]==bc[j]){\n\t\t\t\t\t\t\tint ad=1;\n\t\t\t\t\t\t\tfor(int k=0;k<j*2+2;k++)ad*=10;\n\t\t\t\t\t\t\tto-=to%(ad*100)-to%ad;\n\t\t\t\t\t\t\tto+=ad*(nr*10+nc);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(v.count(to))continue;\n\t\t\t\t\t\tQ.push_front(make_pair(cost,to));\n\t\t\t\t\t}\n\t\t\t\t\tif(W&&!C)continue;\n\t\t\t\t\tif(C&&!W)continue;\n\t\t\t\t\tint to=at-at%100+(row+dx[i])*10+col+dy[i];\n\t\t\t\t\tif(v.count(to))continue;\n\t\t\t\t\tQ.push_back(make_pair(cost+1,to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(yet)printf(\"-1\\n\");\n\t}\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 4280,
"score_of_the_acc": -0.11,
"final_rank": 2
},
{
"submission_id": "aoj_1038_840830",
"code_snippet": "#include<iostream>\n#include <cstring>\n#include <map>\n#include <queue>\nusing namespace std;\n\nint dx[] = {-1,0,1,0};\nint dy[] = {0,1,0,-1};\n\nchar lab[10][10];\nstruct NODE{\n\tint x,y;\n\tint px[3],py[3];\n\tint dead;\n\tint cdead;\n\tNODE(){\n\t\tx = y = 0;\n\t\tpx[0] = px[1] = px[2] = 0;\n\t\tpy[0] = py[1] = py[2] = 0;\n\t\tdead = 0;\n\t\tcdead = 0;\n\t}\n};\nbool operator < (const NODE &a,const NODE &b){\n\tif( a.x != b.x ) return a.x < b.x;\n\tif( a.y != b.y ) return a.y < b.y;\n\tif( a.px[0] != b.px[0] ) return a.px[0] < b.px[0];\n\tif( a.px[1] != b.px[1] ) return a.px[1] < b.px[1];\n\tif( a.px[2] != b.px[2] ) return a.px[2] < b.px[2];\n\tif( a.py[0] != b.py[0] ) return a.py[0] < b.py[0];\n\tif( a.py[1] != b.py[1] ) return a.py[1] < b.py[1];\n\tif( a.py[2] != b.py[2] ) return a.py[2] < b.py[2];\n\tif( a.dead != b.dead ) return a.dead < b.dead;\n\tif( a.cdead != b.cdead ) return a.cdead < b.cdead;\n\treturn false;\n}\n\nint main(){\n\tint H,W;\n\twhile( cin >> H >> W && H ){\n\t\tint wx[3],wy[3];\n\t\tmap<NODE,int> done;\n\t\tNODE fst; int cc = 0 , ww = 0;\n\t\tfor(int i = 0 ; i < H ; i++){\n\t\t\tfor(int j = 0 ; j < W ; j++){\n\t\t\t\tcin >> lab[i][j];\n\t\t\t\tif( lab[i][j] == '@' ) fst.x = j , fst.y = i;\n\t\t\t\tif( lab[i][j] == 'c' ){\n\t\t\t\t\tfst.px[cc] = j;\n\t\t\t\t\tfst.py[cc++] = i;\n\t\t\t\t}\n\t\t\t\tif( lab[i][j] == 'w' ){\n\t\t\t\t\twx[ww] = j;\n\t\t\t\t\twy[ww++] = i;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tdeque< pair<int,NODE> > Q;\n\t\tdone[fst] = 0;\n\t\tQ.push_front(make_pair(0,fst));\n\t\t\n\t\twhile( Q.size() ){\n\t\t\tNODE q = Q.front().second;\n\t\t\tint cost = Q.front().first;\n\t\t\tQ.pop_front();\n\t\t\tif( done[q] != cost ) continue;\n\t\t\tif( lab[q.y][q.x] == 'E' ){\n\t\t\t\tcout << cost << endl;\n\t\t\t\tgoto exit;\n\t\t\t}\n\t\t\tfor(int d = 0 ; d < 4 ; d++){\n\t\t\t\tint tx = q.x + dx[d];\n\t\t\t\tint ty = q.y + dy[d];\n\t\t\t\tif( lab[ty][tx] == '#' ) continue;\n\t\t\t\tint fail = 0;\n\t\t\t\tfor(int i = 0 ; i < ww ; i++){\n\t\t\t\t\tif( !(q.dead >> i & 1) && tx == wx[i] && ty == wy[i] ) fail = 1;\n\t\t\t\t}\n\t\t\t\tif(fail) continue;\n\t\t\t\t\n\t\t\t\tNODE next = q;\n\t\t\t\tfor(int i = 0 ; i < cc ; i++){\n\t\t\t\t\tif( !(q.cdead >> i & 1) && tx == q.px[i] && ty == q.py[i] ){\n\t\t\t\t\t\tint mx = tx;\n\t\t\t\t\t\tint my = ty;\n\t\t\t\t\t\twhile( lab[my+dy[d]][mx+dx[d]] != '#' ){\n\t\t\t\t\t\t\tint br = 0;\n\t\t\t\t\t\t\tfor(int j = 0 ; j < cc ; j++){\n\t\t\t\t\t\t\t\tif( !(q.cdead >> j & 1) && mx+dx[d] == q.px[j] && my+dy[d] == q.py[j] )\n\t\t\t\t\t\t\t\t\tbr = 1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif(br) break;\n\t\t\t\t\t\t\tmx += dx[d];\n\t\t\t\t\t\t\tmy += dy[d];\n\t\t\t\t\t\t\tfor(int j = 0 ; j < ww ; j++){\n\t\t\t\t\t\t\t\tif( !(q.dead >> j & 1) && mx == wx[j] && my == wy[j] ){\n\t\t\t\t\t\t\t\t\tbr = 1;\n\t\t\t\t\t\t\t\t\tnext.cdead |= (1<<i);\n\t\t\t\t\t\t\t\t\tnext.dead |= (1<<j);\n\t\t\t\t\t\t\t\t\tmx = 0;\n\t\t\t\t\t\t\t\t\tmy = 0;\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\tif(br) break;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tnext.px[i] = mx;\n\t\t\t\t\t\tnext.py[i] = my;\n\t\t\t\t\t\ttx = q.x;\n\t\t\t\t\t\tty = q.y;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tint diff = q.y != ty || q.x != tx;\n\t\t\t\tnext.x = tx , next.y = ty;\n\t\t\t\tif( !done.count(next) || done[next] > cost+diff ){\n\t\t\t\t\tif( diff ) Q.push_back(make_pair(diff+cost,next));\n\t\t\t\t\telse Q.push_front(make_pair(diff+cost,next));\n\t\t\t\t\t\n\t\t\t\t\tdone[next] = cost+diff;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << -1 << endl;\n\t\texit:;\n\t\t\n\t}\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 7880,
"score_of_the_acc": -0.3631,
"final_rank": 8
},
{
"submission_id": "aoj_1038_840829",
"code_snippet": "#include<iostream>\n#include <cstring>\n#include <map>\n#include <queue>\nusing namespace std;\n\nint dx[] = {-1,0,1,0};\nint dy[] = {0,1,0,-1};\n\nchar lab[10][10];\nstruct NODE{\n\tint x,y;\n\tint px[3],py[3];\n\tint dead;\n\tint cdead;\n\tNODE(){\n\t\tx = y = 0;\n\t\tpx[0] = px[1] = px[2] = 0;\n\t\tpy[0] = py[1] = py[2] = 0;\n\t\tdead = 0;\n\t\tcdead = 0;\n\t}\n};\nbool operator < (const NODE &a,const NODE &b){\n\tif( a.x != b.x ) return a.x < b.x;\n\tif( a.y != b.y ) return a.y < b.y;\n\tif( a.px[0] != b.px[0] ) return a.px[0] < b.px[0];\n\tif( a.px[1] != b.px[1] ) return a.px[1] < b.px[1];\n\tif( a.px[2] != b.px[2] ) return a.px[2] < b.px[2];\n\tif( a.py[0] != b.py[0] ) return a.py[0] < b.py[0];\n\tif( a.py[1] != b.py[1] ) return a.py[1] < b.py[1];\n\tif( a.py[2] != b.py[2] ) return a.py[2] < b.py[2];\n\tif( a.dead != b.dead ) return a.dead < b.dead;\n\tif( a.cdead != b.cdead ) return a.cdead < b.cdead;\n\treturn false;\n}\n\nint main(){\n\tint H,W;\n\twhile( cin >> H >> W && H ){\n\t\tint wx[3],wy[3];\n\t\tmap<NODE,int> done;\n\t\tNODE fst; int cc = 0 , ww = 0;\n\t\tfor(int i = 0 ; i < H ; i++){\n\t\t\tfor(int j = 0 ; j < W ; j++){\n\t\t\t\tcin >> lab[i][j];\n\t\t\t\tif( lab[i][j] == '@' ) fst.x = j , fst.y = i;\n\t\t\t\tif( lab[i][j] == 'c' ){\n\t\t\t\t\tfst.px[cc] = j;\n\t\t\t\t\tfst.py[cc++] = i;\n\t\t\t\t}\n\t\t\t\tif( lab[i][j] == 'w' ){\n\t\t\t\t\twx[ww] = j;\n\t\t\t\t\twy[ww++] = i;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tpriority_queue< pair<int,NODE> , vector< pair<int,NODE> > , greater< pair<int,NODE> > > Q;\n\t\tdone[fst] = 0;\n\t\tQ.push(make_pair(0,fst));\n\t\t\n\t\twhile( Q.size() ){\n\t\t\tNODE q = Q.top().second;\n\t\t\tint cost = Q.top().first;\n\t\t\tQ.pop();\n\t\t\tif( done[q] != cost ) continue;\n\t\t\tif( lab[q.y][q.x] == 'E' ){\n\t\t\t\tcout << cost << endl;\n\t\t\t\tgoto exit;\n\t\t\t}\n\t\t\tfor(int d = 0 ; d < 4 ; d++){\n\t\t\t\tint tx = q.x + dx[d];\n\t\t\t\tint ty = q.y + dy[d];\n\t\t\t\tif( lab[ty][tx] == '#' ) continue;\n\t\t\t\tint fail = 0;\n\t\t\t\tfor(int i = 0 ; i < ww ; i++){\n\t\t\t\t\tif( !(q.dead >> i & 1) && tx == wx[i] && ty == wy[i] ) fail = 1;\n\t\t\t\t}\n\t\t\t\tif(fail) continue;\n\t\t\t\t\n\t\t\t\tNODE next = q;\n\t\t\t\tfor(int i = 0 ; i < cc ; i++){\n\t\t\t\t\tif( !(q.cdead >> i & 1) && tx == q.px[i] && ty == q.py[i] ){\n\t\t\t\t\t\tint mx = tx;\n\t\t\t\t\t\tint my = ty;\n\t\t\t\t\t\twhile( lab[my+dy[d]][mx+dx[d]] != '#' ){\n\t\t\t\t\t\t\tint br = 0;\n\t\t\t\t\t\t\tfor(int j = 0 ; j < cc ; j++){\n\t\t\t\t\t\t\t\tif( !(q.cdead >> j & 1) && mx+dx[d] == q.px[j] && my+dy[d] == q.py[j] )\n\t\t\t\t\t\t\t\t\tbr = 1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif(br) break;\n\t\t\t\t\t\t\tmx += dx[d];\n\t\t\t\t\t\t\tmy += dy[d];\n\t\t\t\t\t\t\tfor(int j = 0 ; j < ww ; j++){\n\t\t\t\t\t\t\t\tif( !(q.dead >> j & 1) && mx == wx[j] && my == wy[j] ){\n\t\t\t\t\t\t\t\t\tbr = 1;\n\t\t\t\t\t\t\t\t\tnext.cdead |= (1<<i);\n\t\t\t\t\t\t\t\t\tnext.dead |= (1<<j);\n\t\t\t\t\t\t\t\t\tmx = 0;\n\t\t\t\t\t\t\t\t\tmy = 0;\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\tif(br) break;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tnext.px[i] = mx;\n\t\t\t\t\t\tnext.py[i] = my;\n\t\t\t\t\t\ttx = q.x;\n\t\t\t\t\t\tty = q.y;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tint diff = q.y != ty || q.x != tx;\n\t\t\t\tnext.x = tx , next.y = ty;\n\t\t\t\tif( !done.count(next) || done[next] > cost+diff ){\n\t\t\t\t\tQ.push(make_pair(diff+cost,next));\n\t\t\t\t\tdone[next] = cost+diff;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << -1 << endl;\n\t\texit:;\n\t\t\n\t}\n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 7912,
"score_of_the_acc": -0.3758,
"final_rank": 11
},
{
"submission_id": "aoj_1038_818382",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\nusing namespace std;\n#define fr first\n#define sc second\n#define rep(i,n) for(int i = 0 ; i < n ; i++ )\ntypedef pair< int , int > Pt;\ntypedef long long ll;\nconst int dx[] = { 0, 1, -1, 0}, dy[] = { 1, 0, 0, -1};\nstruct P{\n Pt nkmr;\n vector< Pt > pnl,cnt;\n};\ntypedef pair< int , P > IP;\nPt Goal;\nint h, w;\nchar mas[10][10];\nint search_cnt(int y,int x,P& n){\n rep(i,n.cnt.size()) if(n.cnt[i] == Pt(y,x)) return i;\n return -1;\n}\nint search_panel(int y,int x,P& n){\n rep(i,n.pnl.size()) if(n.pnl[i] == Pt(y,x)) return i;\n return -1;\n}\nbool isused(map<ll,bool>& used,P& p){\n ll ret = (p.nkmr.fr << 4) + p.nkmr.sc;\n for(int i = 0 ; i < p.pnl.size() ; i++ ){\n ret <<= 4;\n ret += p.pnl[i].fr;\n ret <<= 4;\n ret += p.pnl[i].sc;\n }\n for(int i = 0 ; i < p.cnt.size() ; i++ ){\n ret <<= 4;\n ret += p.cnt[i].fr;\n ret <<= 4;\n ret += p.cnt[i].sc;\n }\n if(used[ret]++) return true;\n return false;\n}\nint bfs(P& St){\n queue<pair< int , P > > que;\n map < ll , bool > used;\n que.push(IP(0,St));\n while(!que.empty()){\n int _cost = que.front().fr;\n P p = que.front().sc;\n que.pop();\n if(p.nkmr == Goal) return _cost;\n if(isused(used,p)) continue;\n rep(i,4){\n P next = p;\n int ny = p.nkmr.fr + dy[i], nx = p.nkmr.sc + dx[i],contena,panel;\n if(mas[ny][nx] == '#' || search_panel(ny,nx,next) != -1) continue;\n if((contena = search_cnt(ny,nx,next)) != -1){ //コンテナあった\n int ty = ny + dy[i], tx = nx + dx[i];\n if(mas[ty][tx] != '.' || search_cnt(ty,tx,next) != -1) continue;\n while(mas[ty][tx] == '.' &&\n search_cnt(ty,tx,next) == -1 && search_panel(ty,tx,next) == -1){\n ty += dy[i], tx += dx[i];\n }\n if((panel = search_panel(ty,tx,next)) != -1){\n next.cnt[contena] = Pt(-1,-1);\n next.pnl[panel] = Pt(-1,-1);\n }else next.cnt[contena] = Pt(ty - dy[i],tx - dx[i]);\n que.push(IP(_cost,next));\n }else que.push(IP(_cost+1,(P){Pt(ny,nx),p.pnl,p.cnt}));\n }\n }\n return -1;\n}\nint main(){\n while(cin >> h >> w , h ){\n P p = (P){Pt(),vector<Pt>(),vector<Pt>()};\n int cpa = 0,ccn = 0;\n rep(i,h) rep(j,w){\n cin >> mas[i][j];\n if(mas[i][j] == '@') p.nkmr = Pt(i,j), mas[i][j] = '.';\n else if(mas[i][j] == 'w'){\n p.pnl.push_back(Pt(i,j)), mas[i][j] = '.';\n }else if(mas[i][j] == 'c'){\n p.cnt.push_back(Pt(i,j)), mas[i][j] = '.';\n }else if(mas[i][j] == 'E') Goal = Pt(i,j), mas[i][j] = '.';\n }\n cout << bfs(p) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 280,
"memory_kb": 6212,
"score_of_the_acc": -0.3657,
"final_rank": 9
},
{
"submission_id": "aoj_1038_818378",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\nusing namespace std;\n#define fr first\n#define sc second\n#define rep(i,n) for(int i = 0 ; i < n ; i++ )\ntypedef pair< int , int > Pt;\ntypedef long long ll;\nconst int dx[] = { 0, 1, -1, 0}, dy[] = { 1, 0, 0, -1};\nstruct P{\n Pt nkmr;\n vector< Pt > pnl,cnt;\n bool operator<(const P& right)const{\n return nkmr < right.nkmr;\n }\n};\ntypedef pair< int , P > IP;\nPt Goal;\nint h, w;\nchar mas[10][10];\nint search_cnt(int y,int x,P& n){\n rep(i,n.cnt.size()) if(n.cnt[i] == Pt(y,x)) return i;\n return -1;\n}\nint search_panel(int y,int x,P& n){\n rep(i,n.pnl.size()) if(n.pnl[i] == Pt(y,x)) return i;\n return -1;\n}\nbool isused(map<ll,bool>& used,P& p){\n ll ret = (p.nkmr.fr << 4) + p.nkmr.sc;\n for(int i = 0 ; i < p.pnl.size() ; i++ ){\n ret <<= 4;\n ret += p.pnl[i].fr;\n ret <<= 4;\n ret += p.pnl[i].sc;\n }\n for(int i = 0 ; i < p.cnt.size() ; i++ ){\n ret <<= 4;\n ret += p.cnt[i].fr;\n ret <<= 4;\n ret += p.cnt[i].sc;\n }\n if(used[ret]++) return true;\n return false;\n}\nint Dijkstra(P& St){\n //priority_queue<pair<int,P>,vector<pair<int,P> >,greater<pair< int,P> > > que;\n queue<pair< int , P > > que;\n map < ll , bool > used;\n que.push(IP(0,St));\n while(!que.empty()){\n int _cost = que.front().fr;\n P p = que.front().sc;\n que.pop();\n if(p.nkmr == Goal) return _cost;\n if(isused(used,p)) continue;\n rep(i,4){\n P next = p;\n int ny = p.nkmr.fr + dy[i], nx = p.nkmr.sc + dx[i],contena,panel;\n if(mas[ny][nx] == '#' || search_panel(ny,nx,next) != -1) continue;\n if((contena = search_cnt(ny,nx,next)) != -1){ //コンテナあった\n int ty = ny + dy[i], tx = nx + dx[i];\n if(mas[ty][tx] != '.' || search_cnt(ty,tx,next) != -1) continue;\n while(mas[ty][tx] == '.' &&\n search_cnt(ty,tx,next) == -1 && search_panel(ty,tx,next) == -1){\n ty += dy[i], tx += dx[i];\n }\n if((panel = search_panel(ty,tx,next)) != -1){\n next.cnt[contena] = Pt(-1,-1);\n next.pnl[panel] = Pt(-1,-1);\n }else next.cnt[contena] = Pt(ty - dy[i],tx - dx[i]);\n que.push(IP(_cost,next));\n }else que.push(IP(_cost+1,(P){Pt(ny,nx),p.pnl,p.cnt}));\n }\n }\n return -1;\n}\nint main(){\n while(cin >> h >> w , h ){\n P p = (P){Pt(),vector<Pt>(),vector<Pt>()};\n int cpa = 0,ccn = 0;\n rep(i,h) rep(j,w){\n cin >> mas[i][j];\n if(mas[i][j] == '@') p.nkmr = Pt(i,j), mas[i][j] = '.';\n else if(mas[i][j] == 'w'){\n p.pnl.push_back(Pt(i,j)), mas[i][j] = '.';\n }else if(mas[i][j] == 'c'){\n p.cnt.push_back(Pt(i,j)), mas[i][j] = '.';\n }else if(mas[i][j] == 'E') Goal = Pt(i,j), mas[i][j] = '.';\n }\n cout << Dijkstra(p) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 280,
"memory_kb": 6212,
"score_of_the_acc": -0.3657,
"final_rank": 9
},
{
"submission_id": "aoj_1038_818376",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\n#include<set>\nusing namespace std;\n#define fr first\n#define sc second\n#define rep(i,n) for(int i = 0 ; i < n ; i++ )\ntypedef pair< int , int > Pt;\ntypedef long long ll;\nconst int dx[] = { 0, 1, -1, 0}, dy[] = { 1, 0, 0, -1};\nstruct P{\n Pt nkmr;\n vector< Pt > pnl,cnt;\n bool operator<(const P& right)const{\n return nkmr < right.nkmr;\n }\n};\ntypedef pair< int , P > IP;\nPt Goal;\nint h, w;\nchar mas[10][10];\nint search_cnt(int y,int x,P& n){\n rep(i,n.cnt.size()) if(n.cnt[i] == Pt(y,x)) return i;\n return -1;\n}\nint search_panel(int y,int x,P& n){\n rep(i,n.pnl.size()) if(n.pnl[i] == Pt(y,x)) return i;\n return -1;\n}\nbool isused(set<ll>& used,P& p){\n ll ret = (p.nkmr.fr << 4) + p.nkmr.sc;\n sort(p.pnl.begin(),p.pnl.end()),sort(p.cnt.begin(),p.cnt.end());\n for(int i = 0 ; i < p.pnl.size() ; i++ ){\n ret <<= 4;\n ret += p.pnl[i].fr;\n ret <<= 4;\n ret += p.pnl[i].sc;\n }\n for(int i = 0 ; i < p.cnt.size() ; i++ ){\n ret <<= 4;\n ret += p.cnt[i].fr;\n ret <<= 4;\n ret += p.cnt[i].sc;\n }\n if(used.find(ret) != used.end()) return true;\n used.insert(ret);\n return false;\n}\nint Dijkstra(P& St){\n int dbk;\n priority_queue<pair<int,P>,vector<pair<int,P> >,greater<pair< int,P> > > que;\n set < ll > used;\n que.push(IP(0,St));\n while(!que.empty()){\n int _cost = que.top().fr;\n P p = que.top().sc;\n que.pop();\n if(p.nkmr == Goal) return _cost;\n if(isused(used,p)) continue;\n rep(i,4){\n P next = p;\n int ny = p.nkmr.fr + dy[i], nx = p.nkmr.sc + dx[i],contena,panel;\n if(mas[ny][nx] == '#' || search_panel(ny,nx,next) != -1) continue;\n if((contena = search_cnt(ny,nx,next)) != -1){ //コンテナあった\n int ty = ny + dy[i], tx = nx + dx[i];\n if(mas[ty][tx] != '.' || search_cnt(ty,tx,next) != -1) continue;\n while(mas[ty][tx] == '.' &&\n search_cnt(ty,tx,next) == -1 && search_panel(ty,tx,next) == -1){\n ty += dy[i], tx += dx[i];\n }\n if((panel = search_panel(ty,tx,next)) != -1){\n next.cnt[contena] = Pt(-1,-1);\n next.pnl[panel] = Pt(-1,-1);\n }else next.cnt[contena] = Pt(ty - dy[i],tx - dx[i]);\n que.push(IP(_cost,next));\n }else{\n que.push(IP(_cost+1,(P){Pt(ny,nx),p.pnl,p.cnt}));\n }\n }\n }\n return -1;\n}\nint main(){\n while(cin >> h >> w , h ){\n P p = (P){Pt(),vector<Pt>(),vector<Pt>()};\n int cpa = 0,ccn = 0;\n rep(i,h) rep(j,w){\n cin >> mas[i][j];\n if(mas[i][j] == '@') p.nkmr = Pt(i,j), mas[i][j] = '.';\n else if(mas[i][j] == 'w'){\n p.pnl.push_back(Pt(i,j)), mas[i][j] = '.';\n }else if(mas[i][j] == 'c'){\n p.cnt.push_back(Pt(i,j)), mas[i][j] = '.';\n }else if(mas[i][j] == 'E') Goal = Pt(i,j), mas[i][j] = '.';\n }\n cout << Dijkstra(p) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 390,
"memory_kb": 4000,
"score_of_the_acc": -0.4538,
"final_rank": 12
},
{
"submission_id": "aoj_1038_818374",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\nusing namespace std;\n#define fr first\n#define sc second\n#define rep(i,n) for(int i = 0 ; i < n ; i++ )\ntypedef pair< int , int > Pt;\ntypedef long long ll;\nconst int dx[] = { 0, 1, -1, 0}, dy[] = { 1, 0, 0, -1};\nstruct P{\n Pt nkmr;\n vector< Pt > pnl,cnt;\n bool operator<(const P& right)const{\n return nkmr < right.nkmr;\n }\n};\ntypedef pair< int , P > IP;\nPt Goal;\nint h, w;\nchar mas[10][10];\nint search_cnt(int y,int x,P& n){\n rep(i,n.cnt.size()) if(n.cnt[i] == Pt(y,x)) return i;\n return -1;\n}\nint search_panel(int y,int x,P& n){\n rep(i,n.pnl.size()) if(n.pnl[i] == Pt(y,x)) return i;\n return -1;\n}\nbool isused(map<ll,bool>& used,P& p){\n ll ret = (p.nkmr.fr << 4) + p.nkmr.sc;\n sort(p.pnl.begin(),p.pnl.end()),sort(p.cnt.begin(),p.cnt.end());\n for(int i = 0 ; i < p.pnl.size() ; i++ ){\n ret <<= 4;\n ret += p.pnl[i].fr;\n ret <<= 4;\n ret += p.pnl[i].sc;\n }\n for(int i = 0 ; i < p.cnt.size() ; i++ ){\n ret <<= 4;\n ret += p.cnt[i].fr;\n ret <<= 4;\n ret += p.cnt[i].sc;\n }\n if(used[ret]) return true;\n used[ret] = true;\n return false;\n}\nint Dijkstra(P& St){\n int dbk;\n priority_queue<pair<int,P>,vector<pair<int,P> >,greater<pair< int,P> > > que;\n map < ll , bool > used;\n que.push(IP(0,St));\n while(!que.empty()){\n int _cost = que.top().fr;\n P p = que.top().sc;\n que.pop();\n if(p.nkmr == Goal) return _cost;\n if(isused(used,p)) continue;\n rep(i,4){\n P next = p;\n int ny = p.nkmr.fr + dy[i], nx = p.nkmr.sc + dx[i],contena,panel;\n if(mas[ny][nx] == '#' || search_panel(ny,nx,next) != -1) continue;\n if((contena = search_cnt(ny,nx,next)) != -1){ //コンテナあった\n int ty = ny + dy[i], tx = nx + dx[i];\n if(mas[ty][tx] != '.' || search_cnt(ty,tx,next) != -1) continue;\n while(mas[ty][tx] == '.' &&\n search_cnt(ty,tx,next) == -1 && search_panel(ty,tx,next) == -1){\n ty += dy[i], tx += dx[i];\n }\n if((panel = search_panel(ty,tx,next)) != -1){\n next.cnt[contena] = Pt(-1,-1);\n next.pnl[panel] = Pt(-1,-1);\n }else next.cnt[contena] = Pt(ty - dy[i],tx - dx[i]);\n que.push(IP(_cost,next));\n }else{\n que.push(IP(_cost+1,(P){Pt(ny,nx),p.pnl,p.cnt}));\n }\n }\n }\n return -1;\n}\nint main(){\n while(cin >> h >> w , h ){\n P p = (P){Pt(),vector<Pt>(),vector<Pt>()};\n int cpa = 0,ccn = 0;\n rep(i,h) rep(j,w){\n cin >> mas[i][j];\n if(mas[i][j] == '@') p.nkmr = Pt(i,j), mas[i][j] = '.';\n else if(mas[i][j] == 'w'){\n p.pnl.push_back(Pt(i,j)), mas[i][j] = '.';\n }else if(mas[i][j] == 'c'){\n p.cnt.push_back(Pt(i,j)), mas[i][j] = '.';\n }else if(mas[i][j] == 'E') Goal = Pt(i,j), mas[i][j] = '.';\n }\n cout << Dijkstra(p) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 380,
"memory_kb": 4656,
"score_of_the_acc": -0.4549,
"final_rank": 13
},
{
"submission_id": "aoj_1038_791596",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cmath>\n#include<map>\n#include<cassert>\n#include<climits>\n#include<queue>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<29)\n#define MAX 10\n\nusing namespace std;\n\nstruct P\n{\n int x,y;\n P(int x=inf,int y=inf):x(x),y(y){}\n bool operator < (const P& a)const\n {\n if(x != a.x)return x < a.x;\n return y < a.y;\n }\n};\n\nstruct Pox\n{\n string field;\n P cur;\n short cost;\n Pox(string field=\"$\",P cur = P(),short cost=SHRT_MAX):field(field),cur(cur),cost(cost){}\n bool operator < (const Pox& a)const\n {\n return cost > a.cost;\n }\n};\n\nmap<string,short> mincost;\nint H,W;\nP st,ed;\nvector<P> stone;\nstring field;\nint dx[] = {-1,+0,+1,+0};\nint dy[] = {+0,-1,+0,+1};\n\nvoid compute()\n{\n priority_queue<Pox> Q;\n Q.push(Pox(field,st,0));\n mincost.clear();\n mincost[field] = 0;\n\n while(!Q.empty())\n {\n Pox pox = Q.top(); Q.pop();\n int x = pox.cur.x;\n int y = pox.cur.y;\n \n if(field[y*W+x] == 'E')\n\t{\n\t cout << pox.cost << endl;\n\t return;\n\t}\n\n rep(i,4)\n\t{\n\t int nx = x + dx[i];\n\t int ny = y + dy[i];\n\t string nfield = pox.field;\n\t if(!(0 <= nx && nx < W && 0 <= ny && ny < H))continue;\n\t if(pox.field[W*ny+nx] == 'c')\n\t {\n\t int sx = nx+dx[i], sy = ny+dy[i];\n\t while(0 <= sx && sx < W && 0 <= sy && sy < H)\n\t\t{\n\t\t if(pox.field[sy*W+sx] == 'c')break;\n\t\t if(pox.field[sy*W+sx] == '#')break;\n\t\t if(pox.field[sy*W+sx] == 'w')break;\n\t\t sx += dx[i];\n\t\t sy += dy[i];\n\t\t}\n\n\t if(0 <= sx && sx < W && 0 <= sy && sy < H)\n\t\t{\n\t\t if(pox.field[sy*W+sx] == 'w')\n\t\t {\n\t\t nfield[ny*W+nx] = '.';\n\t\t nfield[sy*W+sx] = '.';\n\t\t Q.push(Pox(nfield,pox.cur,pox.cost));\n\t\t continue;\n\t\t }\n\t\t}\n\n\t sx -= dx[i],sy -= dy[i];\n\t if(sx == nx && sy == ny)continue;//cannot move the stone\n\n\t nfield[W*ny+nx] = '.';\n\t if(ny == ed.y && nx == ed.x)nfield[W*ed.y+ed.x] = 'E';\n\t nfield[W*sy+sx] = 'c';\n\t Q.push(Pox(nfield,pox.cur,pox.cost));\n\t }\n\t}\n\n \n rep(i,4)\n\t{\n\t int nx = pox.cur.x + dx[i];\n\t int ny = pox.cur.y + dy[i];\n\t string nfield = pox.field;\n\n\t if(!(0 <= nx && nx < W && 0 <= ny && ny < H))continue;\n\t if(pox.field[W*ny+nx] == '#')continue;\n\t if(pox.field[W*ny+nx] == 'w')continue;\n\n\t if(pox.field[W*ny+nx] == 'c')continue;\n\n\t nfield[y*W+x] = '.';\n\n\t assert(nfield[ny*W+nx] == '.' || nfield[ny*W+nx] == 'E');\n\t nfield[ny*W+nx] = '@';\n\n\t if(mincost.find(nfield) == mincost.end())\n\t {\n\t mincost[nfield] = pox.cost + 1;\n\t Q.push(Pox(nfield,P(nx,ny),pox.cost+1));\n\t }\n\t else\n\t {\n\t if(mincost[nfield] > pox.cost + 1)\n\t\t{\n\t\t mincost[nfield] = pox.cost + 1;\n\t\t Q.push(Pox(nfield,P(nx,ny),pox.cost+1));\n\t\t}\n\t }\n\t}\n \n }\n cout << -1 << endl;\n}\n\nint main()\n{\n while(cin >> H >> W,H|W)\n {\n st = P(inf,inf);\n field.clear();\n int dex = 0;\n rep(i,H)\n\t{\n\t string line;\n\t cin >> line;\n\t field += line;\n\t rep(j,W)\n\t {\n\t if(line[j] == '@')st = P(j,i),line[j] = '.';\n\t if(line[j] == 'E')ed = P(j,i);\n\t if(line[j] == 'c')stone.push_back(P(j,i));\n\t }\n\t}\n \n assert(!(st.x == inf && st.y == inf));\n\n compute();\n\n }\n return 0;\n}\n\n/*\n\nテ」ツつウテ」ツδウテ」ツδ?」ツδ甘」ツ?古」ツつエテ」ツδシテ」ツδォテ」ツ?ォテ」ツ?ョテ」ツ?」テ」ツ?淌・ツセツ古・ツ?催・ツコツヲテ」ツ?敕」ツ?ョテ」ツつウテ」ツδウテ」ツδ?」ツδ甘」ツつ津・ツ仰陛」ツ?凝」ツ?療」ツ?淌ゥツ堋崚」ツ?ォテ」ツ?。テ」ツつε」ツつ禿」ツ?ィテ」ツつエテ」ツδシテ」ツδォテ」ツ?古・ツセツゥテ・ツ?ε」ツ?陛」ツつ古」ツつ凝」ツ?凝ッツシツ淌ッツシツ暗・ツョツ淌ィツ」ツ?ヲツャツ。テァツャツャテ」ツ??」ツ?妥」ツ?ゥテッツシツ?\n.c. ... ... \n.E. => .c. => .Ec \n.#. .#. .#.\n\n\nテ」ツつウテ」ツδウテ」ツδ?」ツδ甘」ツ?ョテ・ツ仰陛」ツ?凝」ツ?凖ヲツ鳴ケテヲツウツ陛」ツ?ョティツァツ」テゥツ?暗」ツδ淌」ツつケ\nテ、ツサツ甘」ツ??」ツつ凝・ツ?エテヲツ可?」ツ?ォテゥツ堋」テヲツ篠・テ」ツ?凖」ツつ凝ッツシツ氾」ツ?、テ」ツ?ョテ」ツつサテ」ツδォテ」ツ?ォテ」ツ?づ」ツつ凝」ツつウテ」ツδウテ」ツδ?」ツδ甘」ツ?ッテ、ツサツサテヲツ?湘」ツ?ォテ・ツ仰陛」ツ?凝」ツ?凖、ツコツ凝」ツ?古」ツ?ァテ」ツ?催」ツつ?\n\n\n..... ..c.. ..c..\n..c.. ..... .....\n.c@c. => [email protected] , [email protected] テ」ツ?ィテ」ツ?凝、ツサツサテヲツ?湘」ツ?ォテ・ツ仰陛」ツ?凝」ツ?崚」ツつ?\n..... ..... .....\n..... ..... .....\n\n \n\n10 10\n##########\n#..#@#...#\n#..#c#...#\n#........#\n#..cEc...#\n#...#....#\n#........#\n#........#\n#........#\n##########\n0 0\n\nAns : 7\n\n10 10\n##########\n#........#\n#[email protected]#\n#...c....#\n#...ww.###\n#........#\n##.......#\n#..####..#\n#..wE#...#\n##########\n0 0\n\nAns : 31\n */",
"accuracy": 1,
"time_ms": 390,
"memory_kb": 11820,
"score_of_the_acc": -0.6109,
"final_rank": 14
}
] |
aoj_1037_cpp
|
Problem C:
Midnight Teatime
ICPCの国内予選に備えて問題を解いていた僕は, その日3つ目のAcceptを貰ったところでキーボードを叩く手を止めた. 時計を見れば, もう日付が変わろうかという時刻だ. 紅茶とお菓子で一服して, 今日はもう寝ることにしよう. そう思って僕はキッチンへと向かった.
ダージリンのかぐわしい香りがキッチンを満たした頃, 妹がやってきた. 受験生である彼女は今日もこんな時間まで真面目に勉強していたようだ. 僕は彼女を誘って, 小さな深夜のお茶会を開くことにした.
都合の良いことに, キッチンには4つのお菓子があった. これをただ2人で分けるのもつまらないので, 僕はこのお菓子を賭けて簡単なゲームをしないかと提案した. そのゲームの内容を説明しよう.
まず最初に, 僕はどのノードも0個または2個の子を持つような二分木を書く. 次に, その木の葉に当たる(つまり, 子を持たない)ノードに, それぞれ S = {a, b, c, d} の任意の部分集合を書き込む. 4つのお菓子は, それぞれ a, b, c, d に対応する.
最後に妹は, 木の内部接点(つまり、2つの子を持つ)ノードに 'A', 'O', 'X' のいずれかの文字を書き込む.
妹は, 木の根にあたるノードが示すお菓子を得る. ただし, ノードが示すお菓子とは,
そのノードが葉であれば, そこに書かれているお菓子
そのノードが内部接点であれば,
そのノードに書かれた文字が A のとき、 sl と sr の積集合
そのノードに書かれた文字が O のとき、 sl と sr の和集合
そのノードに書かれた文字が X のとき、 sl と sr の対称差
のことである. ここで、sl はそのノードの左の子ノードが示すお菓子, sr はそのノードの右の子ノードが示すお菓子を指す. 2つの集合の対称差は, どちらか一方の集合にのみ含まれるような元から成る集合である.
このゲームに妹は乗ってきた. それどころか, お菓子を4つとも巻き上げてやろうと目を輝かせている. 出来れば僕の分も残しておいてくれると嬉しいのだけれども.
僕が書いた木に対して, 妹が全てのお菓子を得られるような内部接点の書き込み方は, いったい何通りあるだろうか？
Input
入力ファイルは、複数のデータセットを含む.
データセットの最初の行には, 木の情報が与えられる. 木の記述は,
"(" <左部分木の記述> <一つのスペース> <右部分木の記述> ")"
または,
<一つの数字>
のどちらかの形式を取る. 前者が内部接点の記述, 後者が葉の記述である.
次の行は1つの整数 N (N < 10) を含み, 続く N 行に葉に書き込まれた部分集合の情報が与えられる.
部分集合の情報は, 空白文字で区切られた4つの数字で表される. 4つの文字はそれぞれ, その部分集合が a, b, c, d を含むかどうかを表す. 含むならば 1 が、含まないならば 0 が与えられる.
葉の記述として与えられた数字が n であるとき、その葉に書き込まれた部分集合はこれら N 個のうち n 番目のものである. 1 ≤ n ≤ N と仮定してよい.
与えられる木は、最大 8 個の内部接点を含む.
木の記述の代わりに与えられる "END" という文字列が, 入力の終わりを表す.
Output
各データセットについて, 妹が全てのお菓子を得られるような内部接点の書き込み方の数を、一行に出力せよ.
Sample Input
(1 2)
2
0 1 0 1
1 0 1 0
((1 2) 3)
3
1 1 0 0
1 0 1 0
0 0 0 1
END
Output for the Sample Input
2
2
|
[
{
"submission_id": "aoj_1037_8461531",
"code_snippet": "#include <bits/stdc++.h>\n\nconstexpr int ROOT = 0;\nconstexpr int NONE = -1;\n\nstruct BinaryTree {\n static constexpr int N = 10;\n struct Node {\n int left;\n int right;\n int id = NONE;\n\n bool is_child() {\n return left == NONE && right == NONE;\n }\n\n Node(int left, int right, int id = NONE): left(left), right(right), id(id) {}\n };\n\n std::vector<Node> nodes;\n int internal_count = 0;\n\n BinaryTree() {}\n\n int add_node(bool is_child = false) {\n int size = nodes.size();\n if (is_child) {\n nodes.emplace_back(NONE, NONE);\n } else {\n nodes.emplace_back(NONE, NONE, internal_count++);\n }\n return size;\n }\n\n Node& node(int u) {\n return nodes[u];\n }\n\n int size() {\n return nodes.size();\n }\n};\n\nunsigned root_state(BinaryTree tree, std::vector<unsigned> leaf_state, const std::vector<char>& node_state) {\n auto dfs = [&](auto self, int u) -> unsigned {\n int i = tree.node(u).id;\n if (tree.node(u).is_child()) {\n return leaf_state[i];\n }\n unsigned left = self(self, tree.node(u).left);\n unsigned right = self(self, tree.node(u).right);\n if (node_state[i] == 'A') {\n return left & right;\n } else if (node_state[i] == 'O') {\n return left | right;\n } else {\n return left ^ right;\n }\n };\n\n return dfs(dfs, ROOT);\n}\n\nstruct Parser {\n using CopyIter = std::string::const_iterator;\n using Iter = CopyIter&;\n std::string line;\n BinaryTree tree;\n Parser(std::string s): line(s) {}\n\n void skip(Iter it, char c) {\n ++it;\n }\n\n BinaryTree parse() {\n auto it = line.cbegin();\n binary_tree(it, ROOT);\n return tree;\n }\n\n int binary_tree(Iter it, int u) {\n if (*it != '(') {\n return child(it);\n }\n tree.add_node();\n\n {\n skip(it, '(');\n int left = binary_tree(it, tree.size());\n tree.node(u).left = left;\n }\n skip(it, ' ');\n {\n int right = binary_tree(it, tree.size());\n tree.node(u).right = right;\n skip(it, ')');\n }\n\n return u;\n }\n\n int child(Iter it) {\n int num = number(it) - 1;\n int v = tree.add_node(true);\n\n tree.node(v).id = num;\n return v;\n }\n\n int number(Iter it) {\n int res = 0;\n while (it != line.end() && std::isdigit(*it)) {\n res = 10 * res + *it - '0';\n it++;\n }\n return res;\n }\n};\n\nint main() {\n std::string line;\n while (true) {\n std::getline(std::cin, line);\n if (line == \"END\") break;\n Parser parser(line);\n BinaryTree tree = parser.parse();\n\n int size = tree.size();\n\n int n;\n std::cin >> n;\n std::vector<unsigned> leaf_state(n);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < 4; j++) {\n unsigned v;\n std::cin >> v;\n leaf_state[i] |= (v << j);\n }\n }\n\n int m = 1;\n std::vector<char> node_state(tree.internal_count);\n int ans = 0;\n for (int i = 0; i < tree.internal_count; i++) m *= 3;\n\n for (int i = 0; i < m; i++) {\n int k = i;\n for (int j = 0; j < tree.internal_count; j++) {\n int digit = k % 3;\n k /= 3;\n if (digit == 0)\n node_state[j] = 'A';\n else if (digit == 1)\n node_state[j] = 'O';\n else\n node_state[j] = 'X';\n }\n if (root_state(tree, leaf_state, node_state) == 0b1111) {\n ans++;\n }\n }\n std::cout << ans << std::endl;\n std::cin.ignore();\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3372,
"score_of_the_acc": -0.9601,
"final_rank": 17
},
{
"submission_id": "aoj_1037_6031184",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <bitset>\n#include <climits>\n#include <string>\n#include <cmath>\n#include <bitset>\n#include <complex>\n#include <functional>\n#include <ctime>\n#include <cassert>\n#include <fstream>\n#include <stack>\n#include <random>\n#include <iomanip>\n#include <time.h>\n#include <list>\n#include <unordered_map>\n\n#include <algorithm>\n#include <array>\n\nusing namespace std;\ntypedef long long ll;\ntypedef long double dd;\ntypedef unsigned long long ull;\ntypedef vector<ll> vl;\ntypedef vector<dd> vd;\ntypedef vector<vector<ll>> vvl;\ntypedef vector<vector<dd>> vvd;\n//#define i_7 (ll)(1E9+7)\n#define i_7 998244353\n#define i_5 i_7-2\nll mod(ll a){\n ll c=a%i_7;\n if(c>=0)return c;\n return c+i_7;\n}\ntypedef pair<ll,ll> l_l;\ntypedef pair<dd,dd> d_d;\nll inf=(ll)1E18;\n#define rep(i,l,r) for(ll i=l;i<=r;i++)\n#define pb push_back\nll max(ll a,ll b){if(a<b)return b;else return a;}\nll min(ll a,ll b){if(a>b)return b;else return a;}\ndd EPS=1E-9;\ndd PI=acos(-1);\n#define endl \"\\n\"\n#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);\n\n\n\n\n\nbool is_op(char c){\n vector<char> ops = {'+', '-', '*', '/'};\n rep(i,0,(ll)ops.size()-1){\n if(c == ops[i]){\n return true;\n }\n }\n return false;\n}\nstring sNumber(string &s, ll &cur){\n string res;\n while(isdigit(s[cur])){\n res += s[cur];\n cur++;\n }\n return res;\n}\nll Number(string &s, ll &cur){\n ll res=0;\n while(isdigit(s[cur])){\n res *= 10;\n res += s[cur] - '0';\n cur++;\n }\n return res;\n}\n\n\nll cnt=0;\n\nll exp(string &s, ll &cur, const vl &v, const vl &u){\n if(s[cur] == '('){\n assert(s[cur]=='(');cur++;\n ll le = exp(s, cur, v, u);\n assert(s[cur]==' ');cur++;\n ll ri = exp(s, cur, v, u);\n assert(s[cur]==')');cur++;\n ll res;\n if(u[cnt] == 0){\n res = le&ri;\n }else if(u[cnt] == 1){\n res = le|ri;\n }else{\n res = le^ri;\n }\n cnt++;\n return res;\n }else{\n ll idx = Number(s, cur);\n return v[idx-1];\n }\n}\n\nsigned main(){fastio\n while(true){\n string s;\n getline(cin, s);\n if(s==\"END\")break;\n string sn;\n getline(cin, sn);\n ll n = stoll(sn);\n vl v(n,0);\n rep(i,0,n-1){\n string t;\n getline(cin, t);\n v[i] = 0;\n for(ll j=0;j<8;j+=2){\n v[i] += (1<<(j/2))*(t[j]-'0');\n }\n }\n ll m = 0;\n rep(i,0,s.size()-1){\n if(s[i] == '(')m++;\n }\n ll M = powl(3, m);\n ll ans=0;\n rep(i,0,M-1){\n ll now=i;\n vl u;\n rep(j,0,m-1){\n u.pb(now%3);\n //cout<<now%3<<' ';\n now/=3;\n }\n ll cur=0;\n cnt=0;\n ll res=exp(s, cur, v, u);\n //assert(cnt == m-1);\n //cout<<res<<endl;\n if(res == 15){\n ans++;\n }\n }\n cout<<ans<<endl;\n }\n \n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3512,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_1037_3020921",
"code_snippet": "#include <cstdio>\n#include <cstdint>\n#include <cassert>\n#include <cctype>\n#include <string>\n#include <vector>\n#include <algorithm>\n\nbool next_operation(std::string &s) {\n for (size_t i=s.length(); i--;) {\n if (s[i] == 'A') {\n s[i] = 'O';\n return true;\n } else if (s[i] == 'O') {\n s[i] = 'X';\n return true;\n } else if (s[i] == 'X') {\n s[i] = 'A';\n }\n }\n return false;\n}\n\nint parse(const std::string &s, size_t &i, size_t preced=0) {\n const std::vector<std::string> ops={\"AOX\"};\n\n if (preced == ops.size()) {\n if (s[i] == '(') {\n int res=parse(s, ++i, 0);\n assert(s[i] == ')');\n ++i;\n return res;\n }\n if ('0' <= s[i] && s[i] < '0'+16) {\n return s[i++]-'0';\n }\n assert(false);\n }\n\n int lhs=parse(s, i, preced+1);\n while (i < s.length()) {\n char op=s[i];\n if (!isupper(op)) break;\n int rhs=parse(s, ++i, preced+1);\n if (op == 'A') lhs &= rhs;\n if (op == 'O') lhs |= rhs;\n if (op == 'X') lhs ^= rhs;\n }\n return lhs;\n}\n\nint testcase_ends() {\n char buf[1024];\n scanf(\" %[^\\n]\", buf);\n std::string s=buf;\n if (s == \"END\") return 1;\n\n size_t n;\n scanf(\"%zu\", &n);\n std::vector<int> item(n);\n for (size_t i=0; i<n; ++i) {\n for (int j=0; j<4; ++j) {\n int x;\n scanf(\"%d\", &x);\n item[i] |= x<<j;\n }\n }\n\n {\n for (size_t i=0; i<s.length(); ++i) {\n if (isdigit(s[i])) {\n s[i] = item[s[i]-'1']+'0';\n } else if (s[i] == ' ') {\n s[i] = 'A';\n }\n }\n }\n\n int res=0;\n do {\n size_t i=0;\n if (parse(s, i) == 15) ++res;\n } while (next_operation(s));\n printf(\"%d\\n\", res);\n return 0;\n}\n\nint main() {\n while (!testcase_ends()) {}\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 2724,
"score_of_the_acc": -0.9862,
"final_rank": 18
},
{
"submission_id": "aoj_1037_1979657",
"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\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n \nvector<int>aget(const vector<int>&l, const vector<int>&r,const int type) {\n\tvector<int>v(4);\n\tfor (int i = 0; i < 4; ++i) {\n\t\tif (type == 0)v[i] = l[i] || r[i];\n\t\telse if (type == 1)v[i] = l[i] && r[i];\n\t\telse v[i] = l[i] ^ r[i];\n\t}\n\treturn v;\n}\n\nstruct node {\n\tint type;\n\tnode* l;\n\tnode* r;\n\n\tnode() : l(nullptr), r(nullptr) {\n\t\ttype = -1;\n\t}\n};\n\n\nstring st;\nint a = 0;\nint num = 0;\nvector<vector<int>>cakes;\nnode* make_tree() {\n\tnode* no=new node();\n\tif (st[a] == '(') {\n\t\tnum++;\n\t\tno->type = -num;\n\t\ta++;\n\t\tno->l = make_tree();\n\t\ta++;\n\t\tassert(st[a] == ' ');\n\t\ta++;\n\t\tno->r = make_tree();\n\t\ta++;\n\t\tassert(st[a] == ')');\n\t}\n\telse {\n\t\tno->type = st[a] - '1';\n\t}\n\treturn no;\n}\n\nvector<int>getans(node* now,const vector<int>&types) {\n\tif (now->type <0) {\n\t\treturn aget(getans(now->l, types), getans(now->r, types), types[-now->type - 1]);\n\t}\n\telse {\n\t\treturn cakes[now->type];\n\t}\n}\n\nlong long int powint(long long int a, long long int b) {\n\tassert(b >= 0);\n\tif (b == 0)return 1;\n\tif (b == 1)return a;\n\tlong long int ans = 1;\n\tlong long int aa = powint(a, b / 2);\n\tans *= aa*aa;\n\tif (b % 2)ans *= a;\n\treturn ans;\n}\n\nint main() {\n\twhile (getline(cin, st)) {\n\t\tcakes.clear();\n\t\tif (st == \"END\")break;\n\t\ta = 0;\n\t\tnum = 0;\n\t\tnode* root(make_tree());\n\t\tint M; cin >> M;\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tvector<int>v(4);\n\t\t\tfor (int j = 0; j < 4; ++j)cin >> v[j];\n\t\t\tcakes.emplace_back(v);\n\t\t}\n\t\tint sum = 0;\n\t\tfor (int i = 0; i <powint(3,num); ++i) {\n\t\t\tvector<int>types(num);\n\t\t\t{\n\t\t\t\tint n(i);\n\t\t\t\tfor (int i = 0; i < num; ++i) {\n\t\t\t\t\ttypes[i] = n % 3;\n\t\t\t\t\tn /= 3;\n\t\t\t\t}\n\t\t\t}\n\t\t\tauto ans = getans(root, types);\n\t\t\tif (all_of(ans.begin(), ans.end(), [](const int a) {return a == 1; })) {\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\n\t\tcout << sum << endl;\n\t\tgetline(cin, st);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3132,
"score_of_the_acc": -0.9444,
"final_rank": 16
},
{
"submission_id": "aoj_1037_1834698",
"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#include<sstream>\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-8;\nconst int inf=1e9;\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int,int> pii;\nstring s;\nvvi in;\nvi w;\nint n,m,out;\nint a,b;\nvi f(){\n\tint e=w[b];\n\ta++;\n\tvi ss(4),t(4);\n\tif(s[a]=='('){b++;ss=f();}\n\telse ss=in[s[a]-'1'];\n\ta++;\n\tif(s[a]=='('){b++;t=f();}\n\telse t=in[s[a]-'1'];\n\tvi re(4);\n\trep(i,4)if(e==0)re[i]=(ss[i]&&t[i]);\n\telse if(e==1)re[i]=(ss[i]||t[i]);\n\telse if(e==2)re[i]=(ss[i]^t[i]);\n\ta++;\n\treturn re;\n}\nint main(){\n\twhile(getline(cin,s),s!=\"END\"){\n\t\trep(i,s.size())if(s[i]==' '){\n\t\t\ts.erase(s.begin()+i);\n\t\t\ti--;\n\t\t}\n\t\tm=out=0;\n\t\trep(i,s.size())if(s[i]=='(')m++;\n\t\tcin>>n;\n\t\tin=vvi(n,vi(4));\n\t\tw=vi(m);\n\t\trep(i,n)rep(j,4)cin>>in[i][j];\n\t\t\n\t\tint q=pow(3,m);\n\t\trep(i,q){\n\t\t\tint t=i;\n\t\t\trep(j,m){\n\t\t\t\tw[j]=t%3;\n\t\t\t\tt/=3;\n\t\t\t}\n\t\t\ta=b=0;\n\t\t\tvi tmp=f();\n\t\t\tsort(all(tmp));\n\t\t\tif(tmp[0]==1)out++;\n\t\t}\n\t\tcout<<out<<endl;\n\t\tgetline(cin,s);\n\t}\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 1280,
"score_of_the_acc": -0.4873,
"final_rank": 13
},
{
"submission_id": "aoj_1037_1624656",
"code_snippet": "#include <iostream>\n#include <string>\nusing namespace std;\nstring s;\nint n,b[10],cnt,sum,aox[8],ans,p,k;\nvoid func(int);\nint calc();\n\nint main(){\n int a,len;\n while(1){\n getline(cin,s);\n if(s==\"END\") break;\n cin>>n;\n for(int i=1;i<=n;i++){\n b[i]=0;\n for(int j=0;j<4;j++) cin>>a,b[i]=(b[i]|(a<<j));\n }\n sum=0;\n len=s.size();\n for(int i=0;i<len;i++)\n if(s[i]=='(') sum++;\n ans=0;\n func(0);\n cout<<ans<<endl;\n getline(cin,s);\n }\n return 0;\n}\n\nvoid func(int d){\n if(d==sum){\n p=k=0;\n if(calc()==15) ans++;\n return;\n }\n for(int i=0;i<3;i++) aox[d]=i,func(d+1);\n}\n\nint calc(){\n int r,left,right;\n if(s[p]=='('){\n p++;\n left=calc();\n p++;\n right=calc();\n p++;\n if(aox[k]==0) r=left&right;\n if(aox[k]==1) r=left|right;\n if(aox[k]==2) r=left^right;\n k++;\n }else{\n int x=s[p]-'0';\n r=b[x];\n p++;\n }\n return r;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.344,
"final_rank": 5
},
{
"submission_id": "aoj_1037_1622306",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nstruct P {\n int l,r,d;\n}p[10000];\n\nstring s;\nint k;\nmap<int,int> ma;\nint a[11];\n\nvoid dfs(int x) {\n while(k<s.size()) {\n if(s[k]=='(') {\n k++;\n p[x].l=x*2;\n dfs(x*2);\n }\n if(s[k]==' ') {\n k++;\n p[x].r=x*2+1;\n dfs(x*2+1);\n }\n if(isdigit(s[k])) {\n int y=0;\n while(k<s.size()&&isdigit(s[k])) {\n y*=10;\n y+=s[k]-'0';\n k++;\n }\n p[x].d=y;\n break;\n }\n if(s[k]==')') {\n k++;\n break;\n }\n }\n}\n\nint dfs2(int x) {\n if(p[x].l!=-1) {\n int ll=dfs2(p[x].l);\n int rr=dfs2(p[x].r);\n int r=ma[x];\n if(r==0) return ll&rr;\n else if(r==1) return ll|rr;\n return ll^rr;\n }\n return a[p[x].d-1];\n}\n\nint main() {\n while(1) {\n getline(cin,s);\n if(s==\"END\") break;\n int n;\n cin >> n;\n memset(a,0,sizeof(a));\n for(int i=0; i<n; i++) {\n for(int j=0,c; j<4; j++) {\n cin >> c;\n a[i]|=c<<j;\n }\n }\n for(int i=0; i<10000; i++) p[i]=(P){-1,-1,-1};\n k=0;\n dfs(1);\n vector<int> v;\n for(int i=0; i<10000; i++) {\n if(p[i].l!=-1) v.push_back(i);\n }\n int m=v.size(),ans=0;\n for(int t=0; t<(1<<(2*m)); t++) {\n bool f=1;\n ma.clear();\n for(int i=0; i<m; i++) {\n int b=(t>>(i*2))%4;\n if(b==3) f=0;\n else ma[v[i]]=b;\n }\n if(!f) continue;\n if(dfs2(1)==15) ans++;\n }\n cout << ans << endl;\n getline(cin,s);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 1344,
"score_of_the_acc": -0.7336,
"final_rank": 15
},
{
"submission_id": "aoj_1037_1529703",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint Tree[1<<12],m;\nmap<int,int> mp;\nvector<int> order;\nstring::iterator it;\n\nvector<int> getOrder(int x,int m){\n vector<int> res;\n while(x > 0){\n res.push_back(x%3);\n x /= 3;\n }\n while((int)res.size() != m){\n res.push_back(0);\n }\n return res;\n}\n\nint getBit(int v,vector<int> &bit){\n if(Tree[v] != -1){\n return bit[Tree[v]];\n }\n int S = -1;\n int l = getBit(2*v+1, bit);\n int r = getBit(2*v+2, bit);\n switch(order[mp[v]]){\n case 0:\n S = l & r;\n break;\n case 1:\n S = l | r;\n break;\n case 2:\n S = (l | r) - (l & r);\n break;\n };\n return S;\n}\n\nbool check(vector<int> &bit){\n return (getBit(0,bit) == (1<<4)-1);\n}\n\nint makeTree(int v){\n if(*it == '('){\n ++it;\n char cl = *it;\n int l = makeTree(2*v+1);\n if(isdigit(cl)){\n Tree[2*v+1] = l;\n }\n ++it;\n char cr = *it;\n int r = makeTree(2*v+2);\n if(isdigit(cr)){\n Tree[2*v+2] = r;\n }\n ++it;\n }else if(isdigit(*it)){\n int num = ((*it - '0') - 1);\n ++it;\n return num;\n }\n return -1;\n}\n\nvoid dfs(int v){\n if(Tree[v] == -1){\n mp[v] = m++;\n dfs(2*v+1);\n dfs(2*v+2);\n }\n}\n\nint main(){\n string s;\n while(getline(cin,s), s != \"END\"){\n int N,x;\n cin >> N;\n vector<int> bit(N, 0);\n for(int i = 0 ; i < N ; i++){\n for(int j = 0 ; j < 4 ; j++){\n cin >> x;\n if(x == 1) bit[i] |= 1<<j;\n }\n }\n int res = 0;\n memset(Tree,-1,sizeof(Tree));\n it = s.begin();\n makeTree(0); m = 0; dfs(0);\n int n = pow(3., m);\n for(int i = 0 ; i < n ; i++){\n order = getOrder(i, m);\n if(check(bit)) res++;\n }\n cout << res << endl;\n cin.ignore();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1256,
"score_of_the_acc": -0.3927,
"final_rank": 9
},
{
"submission_id": "aoj_1037_1517025",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdio>\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 \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\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\n// <TREE> := (<LEAF><OPE><LEAF>)\n// <LEAF> := (<TREE>) | <NUMBER>\n\nP tree(const string& expr,int sweets[16],int pos);\nP leaf(const string& expr,int sweets[16],int pos);\n\nP tree(const string& expr,int sweets[16],int pos){\n int set = 0;\n if(expr[pos] == '('){\n P r1 = leaf(expr,sweets,pos + 1);\n pos = r1.first;\n char ope = expr[pos];\n P r2 = leaf(expr,sweets,pos+1);\n if(ope == 'A'){\n set |= (r1.second & r2.second);\n }\n else if(ope == 'O'){\n set |= (r1.second | r2.second);\n }\n else if(ope == 'X'){\n set |= (r1.second ^ r2.second);\n }\n pos = r2.first;\n }\n return P(pos,set);\n}\n\nP leaf(const string& expr,int sweets[16], int pos){\n if(expr[pos] == '('){\n P r = tree(expr,sweets,pos);\n pos = r.first + 1;\n return P(pos,r.second);\n }\n else{\n return P(pos+1,sweets[expr[pos] - '0']);\n }\n}\n\nint dfs(string expr,int sweets[16],int pos,int N){\n if(pos >= expr.size()){\n P r = tree(expr,sweets,0);\n if(r.second == (1<<4) - 1){\n return 1;\n }\n else{\n return 0;\n }\n }\n\n int res = 0;\n const char ope[] = {'A','O','X'};\n if(expr[pos] == ' '){\n for(int i = 0; i < 3; i++){\n expr[pos] = ope[i];\n res += dfs(expr,sweets,pos+1,N);\n }\n }\n else{\n res += dfs(expr,sweets,pos+1,N);\n }\n return res;\n}\n\nint main(){\n string expr;\n while(getline(cin,expr)){\n if(expr == \"END\") break;\n int N;\n string N_str;\n getline(cin,N_str);\n N = atoi(N_str.c_str());\n int sweets[16];\n for(int i = 1; i <= N; i++){\n int bit = 0;\n string flag_str;\n getline(cin,flag_str);\n for(int j = 0; j <= 6; j+=2){\n if(flag_str[j] - '0'){\n bit |= (1<<(j/2));\n }\n }\n sweets[i] = bit;\n }\n printf(\"%d\\n\",dfs(expr,sweets,0,N));\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1220,
"score_of_the_acc": -0.3825,
"final_rank": 8
},
{
"submission_id": "aoj_1037_1108719",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\n#include<string.h>\nusing namespace std;\nchar str[110];\nchar w[5]=\"AOX\";\nint at[20];\nint var[20];\nint pow3[20];\nint cur;\nint expr(){\n\tif(str[cur]=='('){\n\t\tcur++;\n\t\tint L=expr();\n\t\tchar ex=str[cur++];\n\t\tint R=expr();\n\t\tcur++;\n\t\tif(ex=='A')return L&R;\n\t\tif(ex=='X')return L^R;\n\t\treturn L|R;\n\t}else{\n\t\treturn var[str[cur++]-'1'];\n\t}\n}\nint main(){\n\tpow3[0]=1;\n\tfor(int i=1;i<20;i++)pow3[i]=pow3[i-1]*3;\n\twhile(1){\n\t\tgets(str);\n\t\tif(str[0]=='E')return 0;\n\t\tint sz=0;\n\t\tfor(int i=0;str[i];i++)if(str[i]==' '){\n\t\t\tat[sz++]=i;\n\t\t}\n\t\tint n;scanf(\"%d\",&n);\n\t\tfor(int i=0;i<n;i++){\n\t\t\tvar[i]=0;\n\t\t\tfor(int j=0;j<4;j++){\n\t\t\t\tint p;scanf(\"%d\",&p);\n\t\t\t\tif(p)var[i]+=(1<<j);\n\t\t\t}\n\t\t}\n\t\tint ret=0;\n\t\tfor(int i=0;i<pow3[sz];i++){\n\t\t\tfor(int j=0;j<sz;j++){\n\t\t\t\tstr[at[j]]=w[i%pow3[j+1]/pow3[j]];\n\t\t\t}\n\t\t//\tprintf(\"%s\\n\",str);\n\t\t\tcur=0;\n\t\t\tif(expr()==15)ret++;\n\t\t}\n\t\tprintf(\"%d\\n\",ret);gets(str);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1032,
"score_of_the_acc": -0.2938,
"final_rank": 4
},
{
"submission_id": "aoj_1037_904193",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <numeric>\n#include <cctype>\n#include <tuple>\n\n#ifdef _MSC_VER\n#include <agents.h>\n#endif\n\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\n#define rep(i, n) FOR(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define REV(v) v.rbegin(), v.rend()\n#define MEMSET(v, s) memset(v, s, sizeof(v))\n#define X first\n#define Y second\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nint x[15];\nint type[15];\nstring s;\nint num;\n\nint parse(int l, int r){\n\tif (r-l == 1) return x[s[l] - '1'];\n\n\tint sp = -1, nest = 0;\n\tfor (int i = l+1; i < r-1; ++i){\n\t\tif (s[i] == '(') ++nest;\n\t\tif (s[i] == ')') --nest;\n\t\tif (!nest && s[i] == ' ') sp = i;\n\t}\n\n\tint res1 = parse(l + 1, sp);\n\tint res2 = parse(sp + 1, r - 1);\n\n\tint ret = -1;\n\tif (type[num] == 0) ret = res1 | res2;\n\tif (type[num] == 1) ret = res1 & res2;\n\tif (type[num] == 2) ret = res1 ^ res2;\n\t++num;\n\treturn ret;\n}\n\n\nint ans;\nint m;\nvoid rec(int n){\n\tif (n == m){\n\t\tnum = 0;\n\t\t//cout << parse(0, s.size()) << endl;\n\t\tans += parse(0, s.size()) == 15;\n\t\treturn;\n\t}\n\trep(i, 3){\n\t\ttype[n] = i;\n\t\trec(n + 1);\n\t}\n}\n\nint main(){\n\twhile (getline(cin, s), s != \"END\"){\n\t\tint n;\n\t\tcin >> n;\n\n\t\tMEMSET(x, 0);\n\t\trep(i, n) rep(j, 4){\n\t\t\tint t;\n\t\t\tcin >> t;\n\t\t\tx[i] |= (t << j);\n\t\t}\n\t\tans = 0;\n\t\tm = count(ALL(s), ' ');\n\t\trec(0);\n\t\tcout << ans << endl;\n\t\tcin.ignore();\n\t}\n\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1216,
"score_of_the_acc": -0.3638,
"final_rank": 7
},
{
"submission_id": "aoj_1037_825427",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<bitset>\n#include<cstdio>\n#include<cassert>\n#include<set>\n#include<sstream>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<29)\n#define MAX 20\n\nusing namespace std;\n\nstring parse;\nchar cparse[MAX];\nint N,sweets[MAX],n;\n\nset<vector<char> > ans;\nchar opr[] = {'&','|','^'};\n\nint exp(int&,int&,vector<char>&);\n\nint fact(int &cur,int &ocnt,vector<char> &vec)\n{\n int p;\n if(parse[cur] == '(')\n {\n cur++;\n p = exp(cur,ocnt,vec);\n cur++;\n return p;\n }\n else\n {\n p = parse[cur]-'0';\n cur++;\n return sweets[p-1];\n }\n}\n\nint exp(int &cur,int &ocnt,vector<char> &vec)\n{\n int p;\n p = fact(cur,ocnt,vec);\n if(ocnt < vec.size())\n {\n int q = fact(cur,ocnt,vec);\n int ret;\n if(vec[ocnt] == '&')ret = p & q;\n if(vec[ocnt] == '|')ret = p | q;\n if(vec[ocnt] == '^')ret = p ^ q;\n ocnt++;\n return ret;\n }\n return p;\n}\n\n\nbool check(vector<char> &vec)\n{\n int cur = 0;\n int ocnt = 0;\n int res = exp(cur,ocnt,vec);\n return res == (1<<4)-1;\n}\n\nvoid dfs(int cur,vector<char> &vec)\n{\n if(cur >= vec.size())\n {\n if(check(vec))ans.insert(vec);\n return;\n }\n\n rep(i,3)\n {\n vec[cur] = opr[i];\n dfs(cur+1,vec);\n }\n\n}\n\nvoid change()\n{\n stringstream ss;\n ss << parse;\n string content = \"\";\n while(!(ss>>parse).fail())content += parse;\n parse = content;\n}\n\nint main()\n{\n while(getline(cin,parse),parse != \"END\")\n {\n n = 0;\n rep(i,parse.size())if(parse[i] == '(')n++;\n change();\n ans.clear();\n\n\n cin >> N;\n rep(i,N)\n\t{\n\t sweets[i] = 0;\n\t rep(j,4)\n\t {\n\t int bit;\n\t cin >> bit;\n\t if(bit)\n\t\t{\n\t\t sweets[i] |= (1<<j);\n\t\t}\n\t }\n\t}\n\n vector<char> vec(n);\n dfs(0,vec);\n\n cout << ans.size() << endl;\n cin.ignore();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1412,
"score_of_the_acc": -0.4196,
"final_rank": 10
},
{
"submission_id": "aoj_1037_812316",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<algorithm>\n#include<cctype>\n\nusing namespace std;\n\nvector<string> leaf;\n\nvector<string> solve(string s){\n vector<string> a, b;\n if(s.size() == 5){\n a = vector<string>(1, leaf[s[1]-'0']);\n b = vector<string>(1, leaf[s[3]-'0']);\n }else if(isdigit(s[1])){\n a = vector<string>(1, leaf[s[1]-'0']);\n b = solve(string(s.begin()+3, s.end()-1));\n }else if(isdigit(s[s.size()-2])){\n a = solve(string(s.begin()+1, s.end()-3));\n b = vector<string>(1, leaf[s[s.size()-2]-'0']);\n }else{\n int x=0, k;\n for(int i=1; i<s.size(); ++i){\n if(s[i] == '(') ++x;\n if(s[i] == ')') --x;\n if(x == 0){ k=i+1; break; }\n }\n a = solve(string(s.begin()+1, s.begin()+k));\n b = solve(string(s.begin()+k+1, s.end()-1));\n }\n vector<string> data;\n for(int i=0; i<a.size(); ++i){\n for(int j=0; j<b.size(); ++j){\n string A(4,'0'), O(4,'0'), X(4,'0');\n for(int k=0; k<4; ++k){\n\tif(a[i][k]=='1' && b[j][k]=='1') A[k]='1';\n\tif(a[i][k]=='1' || b[j][k]=='1') O[k]='1';\n\tif(a[i][k] != b[j][k]) X[k]='1';\n }\n data.push_back(A);\n data.push_back(O);\n data.push_back(X);\n }\n }\n return data;\n}\n\nint main(){\n int n, x;\n string s;\n while(1){\n s.clear();\n leaf.clear();\n while(s.empty()) getline(cin, s);\n if(s == \"END\") break;\n cin >> n;\n leaf = vector<string>(n+1);\n for(int i=1; i<=n; ++i){\n string t(4,'0');\n for(int j=0; j<4; ++j){\n\tcin >> x;\n\tif(x == 1) t[j] = '1';\n }\n leaf[i] = t;\n }\n vector<string> data = solve(s);\n int ans=0;\n for(int i=0; i<data.size(); ++i){\n if(data[i] == \"1111\") ++ans;\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1464,
"score_of_the_acc": -0.4344,
"final_rank": 11
},
{
"submission_id": "aoj_1037_581339",
"code_snippet": "#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <utility>\n#include <functional>\n#include <sstream>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\n#include <ctime>\n#include <climits>\n#include <cassert>\nusing namespace std;\ninline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}\ntemplate<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef long long ll;\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(),(a).rend()\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n#define EACH(t,i,c) for(t::iterator i=(c).begin(); i!=(c).end(); ++i)\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\n\nint id_cnt=0;\n\nstruct node{\n\tnode *left,*right;\n\tint n,id;\n\tnode(node *left,node *right,int id):left(left),right(right),n(-1),id(id){}\n\tnode(int n,int id):n(n),left(NULL),right(NULL),id(id){}\n\n\tvi search(vvi &masks,string &pattern){\n\t\tif(n!=-1){\n\t\t\treturn masks[n];\n\t\t}\n\t\tvi l_mask=left->search(masks,pattern);\n\t\tvi r_mask=right->search(masks,pattern);\n\t\tvi ret(4);\n\t\tswitch(pattern[id]){\n\t\tcase 'A':\n\t\t\tREP(i,4){\n\t\t\t\tret[i]=l_mask[i]&r_mask[i];\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 'O':\n\t\t\tREP(i,4){\n\t\t\t\tret[i]=l_mask[i]|r_mask[i];\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 'X':\n\t\t\tREP(i,4){\n\t\t\t\tret[i]=l_mask[i]^r_mask[i];\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\treturn ret;\n\t}\n\n\tvoid make_initial_pattern(string &pattern){\n\t\tif(n!=-1){\n\t\t\tpattern[id]='.';\n\t\t}else{\n\t\t\tpattern[id]='A';\n\t\t}\n\t\tif(left){\n\t\t\tleft->make_initial_pattern(pattern);\n\t\t}\n\t\tif(right){\n\t\t\tright->make_initial_pattern(pattern);\n\t\t}\n\t}\n};\n\n\nnode *read(string &s, int &p){\n\tswitch(s[p]){\n\tcase '(':\n\t\t{\n\t\tp++;\n\t\tnode *left=read(s,p);\n\t\tassert(s[p]==' ');\n\t\tp++;\n\t\tnode *right=read(s,p);\n\t\tassert(s[p]==')');\n\t\tp++;\n\t\treturn new node(left,right,id_cnt++);\n\t\t}\n\tdefault:\n\t\tassert(isdigit(s[p]));\n\t\treturn new node(s[p++]-'0'-1,id_cnt++);\n\t}\n}\n\nbool increment(string &pattern,int n){\n\tif(n==pattern.size()){\n\t\treturn false;\n\t}\n\tswitch(pattern[n]){\n\tcase 'A':\n\t\tpattern[n]='O';break;\n\tcase 'O':\n\t\tpattern[n]='X';break;\n\tcase 'X':\n\t\tpattern[n]='A';\n\t\tif(!increment(pattern,n+1)){\n\t\t\treturn false;\t\n\t\t}\n\t\tbreak;\n\tdefault:\n\t\tif(!increment(pattern,n+1)){\n\t\t\treturn false;\t\n\t\t}\n\t}\n\treturn true;\n}\n\nint main(){\n\tstring s;\n\twhile(getline(cin,s),s!=\"END\"){\n\t\tint p=0;\n\t\tnode *root=read(s,p);\n\t\tint n;\n\t\tcin>>n;\n\t\tvvi masks(n);\n\t\tREP(i,n){\n\t\t\tREP(j,4){\n\t\t\t\tint b;\n\t\t\t\tcin>>b;\n\t\t\t\tmasks[i].push_back(b);\n\t\t\t}\n\t\t}\n\t\tstring pattern(id_cnt,' ');\n\t\troot->make_initial_pattern(pattern);\n\t\tint ans=0;\n\t\twhile(1){\n\t\t\tvi m=root->search(masks,pattern);\n\t\t\tbool flag=true;\n\t\t\tREP(i,4){\n\t\t\t\tif(m[i]==0){\n\t\t\t\t\tflag=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag){\n\t\t\t\tans++;\n\t\t\t}\n\t\t\tif(!increment(pattern,0)){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t\tgetline(cin,s);\n\t}\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 1252,
"score_of_the_acc": -0.5319,
"final_rank": 14
},
{
"submission_id": "aoj_1037_480073",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <cctype>\n\nusing namespace std;\n\nvector<int> g_sets;\n\nstruct Result {\n int value, p;\n};\n\n#define PARSER_DECL(name) \\\n Result name (const string &s, int p)\n\nPARSER_DECL(expr);\nPARSER_DECL(factor);\n\nPARSER_DECL(expr){\n Result r = factor(s, p);\n while(isupper(s[r.p])){\n Result q = factor(s, r.p + 1);\n switch(s[r.p]){\n case 'A': r.value &= q.value; break;\n case 'O': r.value |= q.value; break;\n case 'X': r.value ^= q.value; break;\n }\n r.p = q.p;\n }\n return r;\n}\nPARSER_DECL(factor){\n Result r;\n if(s[p] == '('){\n r = expr(s, p + 1);\n ++r.p;\n }else{\n int index = 0;\n while(isdigit(s[p])){\n index = (index * 10) + (s[p] - '0');\n ++p;\n }\n r.value = g_sets[index];\n r.p = p;\n }\n return r;\n}\n\nint solve(string &s, const vector<int> &op, int i){\n int answer = 0;\n if(i == op.size()){\n answer = (expr(s, 0).value == 15 ? 1 : 0);\n }else{\n const char OPERATIONS[] = \"AOX\";\n for(int j = 0; j < 3; ++j){\n s[op[i]] = OPERATIONS[j];\n answer += solve(s, op, i + 1);\n }\n }\n return answer;\n}\n\nint main(){\n while(true){\n string s;\n getline(cin, s);\n if(s == \"END\"){ break; }\n vector<int> op;\n for(int i = 0; i < s.size(); ++i){\n if(s[i] == ' '){ op.push_back(i); }\n }\n int n;\n cin >> n;\n g_sets = vector<int>(n + 1);\n for(int i = 1; i <= n; ++i){\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n g_sets[i] = (a << 3) | (b << 2) | (c << 1) | d;\n }\n cout << solve(s, op, 0) << endl;\n getline(cin, s);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1240,
"score_of_the_acc": -0.3531,
"final_rank": 6
},
{
"submission_id": "aoj_1037_366091",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\nusing namespace std;\n\nint node[10];\nstring str;\nint ans,a,n,cnt;\nvector<int> v[10];\n\nvector<int> parse(string s){\n if('1'<=s[0] && s[0]<= '9'){\n return v[s[0]-'0'-1];\n }\n\n int pos = 0;\n int k=0;\n while(pos<s.size()){\n if(s[pos]=='(')k++;\n if(s[pos]==')')k--;\n \n if(k==1 && s[pos] == ' '){\n vector<int> x = parse(s.substr(1,pos-1));\n vector<int> y = parse(s.substr(pos+1,(int)s.size()-2-pos));\n \n if(node[cnt] == 0){\n\tcnt++;\n\tvector<int> res;\n\tfor(int i=0;i<4;i++)\n\t res.push_back(x[i]&y[i]);\t\n\treturn res;\n }\n \n if(node[cnt] == 1){\n\tcnt++;\n\tvector<int> res;\n\tfor(int i=0;i<4;i++)\n\t res.push_back(x[i]|y[i]);\t\n\treturn res;\n }\n \n if(node[cnt] == 2){\n\tcnt++;\n\tvector<int> res;\n\tfor(int i=0;i<4;i++)\n\t res.push_back(x[i]!=y[i]);\t\n\treturn res;\n }\n }\n pos++;\n }\n}\n\nvoid rec(int s){\n if(s == a){\n cnt = 0;\n vector<int> tmp = parse(str);\n int pop=0;\n \n for(int i=0;i<4;i++)\n if(tmp[i])pop++;\n if(pop==4)ans++;\n \n return;\n }\n for(int i=0;i<3;i++){\n node[s] = i;\n rec(s+1);\n }\n}\n\nint main(){\n int c = 0;\n while(getline(cin,str)){\n if(str==\"END\")break;\n a = 0;\n for(int i=0;i<(int)str.size();i++)\n if(str[i] == ' ')a++;\n\n cin >> n;\n for(int i=0;i<n;i++){\n v[i].clear();\n int hoge;\n for(int j=0;j<4;j++){\n\tcin >> hoge;\n\tv[i].push_back(hoge);\n }\n }\n ans = 0;\n rec(0);\n cout << ans << endl;\n cin.ignore();\n }\n}",
"accuracy": 1,
"time_ms": 580,
"memory_kb": 0,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_1037_326578",
"code_snippet": "#include<stdio.h>\n\n\nint cakeSets[10];//FXvZµÄÅãɺ4rbg¾¯ðg¤\nint mask=15;//ºÊ4rbg}XN\nint ans;\n\nint calcNode(int& p,const char* nodeText,bool modeRe){\n\tint nowSet=0;\n\tp++;\n\twhile(1){\n\t\tchar t=nodeText[p];\n\t\tif('1'<=t && t<='9'){\n\t\t\tnowSet=cakeSets[t-'0'];\n\t\t}else if(t=='A'){\n\t\t\tnowSet&=calcNode(p,nodeText,true);\n\t\t}else if(t=='O'){\n\t\t\tnowSet|=calcNode(p,nodeText,true);\n\t\t}else if(t=='X'){\n\t\t\tnowSet^=calcNode(p,nodeText,true);\n\t\t}else if(t=='('){\n\t\t\tnowSet=calcNode(p,nodeText,false);\n\t\t}else{\n\t\t\treturn nowSet;\n\t\t}\n\t\tif(modeRe==true) return nowSet;\n\t\tp++;\n\t}\n\t\n}\n\n\nvoid setNode(int p,char* nodeText){\n\tchar t=nodeText[p];\n\tif(t=='\\0'){\n\t\tint np=-1;\n\t\t//printf(\"%s=\",nodeText);\n\t\tint k=calcNode(np,nodeText,true);\n\t\t//printf(\"%d %d %d %d\\n\",(k&1)!=0?1:0,(k&2)!=0?1:0,(k&4)!=0?1:0,(k&8)!=0?1:0);\n\t\tif(mask==(mask&k)){\n\t\t\tans++;\n\t\t}\n\t\t\n\t}else if(t==' '){\n\t\tnodeText[p]='A';\n\t\tsetNode(p+1,nodeText);\n\t\tnodeText[p]='O';\n\t\tsetNode(p+1,nodeText);\n\t\tnodeText[p]='X';\n\t\tsetNode(p+1,nodeText);\n\t\tnodeText[p]=' ';\n\t}else {\n\t\tsetNode(p+1,nodeText);\n\t}\n}\n\n\n\n\nbool setData(){\n\tchar nodeText[200],re;\n\tint p;\n\n\tans=0;\n\tscanf(\"%[^\\n]%c\",nodeText,&re);\n\tif(nodeText[0]=='E')return false;\n\tint n,c;\n\tscanf(\"%d\",&n);\n\tfor(int i=1;i<=n;i++){\n\t\tcakeSets[i]=0;\n\t\tfor(int j=0;j<4;j++){\n\t\t\tscanf(\"%d\",&c);\n\t\t\tcakeSets[i]|=(c<<j);\n\t\t}\n\t}\n\tsetNode(0,nodeText);\n\tprintf(\"%d\\n\",ans);\n\tif(scanf(\"%c\",&re)==EOF)return false;\n\treturn true;\n}\n\n\nint main(){\n\twhile(setData()){\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 0,
"score_of_the_acc": -0.0175,
"final_rank": 1
},
{
"submission_id": "aoj_1037_288284",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <cstdlib>\n#include <cctype>\n#include <map>\n\n#define conv(c) (int)(c-'1')\n\nusing namespace std;\n\ntypedef pair<int, string> P; \n\nvector<string> vec;\nstring str;\nmap<P, string> mpp;\n\nstring func(string st)\n{\n string s = \"\";\n for(int i = 0; i < st.size(); ++i)\n if(st[i] != ' ') s += st[i];\n\n return s;\n}\n\nvoid mkMap(string s, int d)\n{\n if(d == 8){\n for(int i = 0; i < 3; ++i){\n string st = \"\";\n for(int j = 0; j < 4; ++j){\n\tif(i == 0){\n\t st += ((s[j] == '1' || s[j+4] == '1')? \"1\" : \"0\"); \n\t} else if(i == 1){\n\t st += ((s[j] == '1' && s[j+4] == '1')? \"1\" : \"0\");\n\t} else {\n\t st += ((s[j] != s[j+4])? \"1\" : \"0\");\n\t}\n }\n mpp[P(i, s)] = st;\n }\n } else {\n for(int i = 0; i < 2; ++i)\n mkMap(s+(char)('0'+i), d+1);\n }\n\n return ;\n}\n\nint p;\nvector<string> rec()\n{\n vector<string> v1, v2, res;\n if(isdigit(str[p])){\n v1.push_back(vec[conv(str[p])]);\n p+=2;\n } else {\n ++p;\n v1 = rec();\n ++p;\n }\n\n if(isdigit(str[p])){\n v2.push_back(vec[conv(str[p])]);\n p+=2;\n } else {\n ++p;\n v2 = rec();\n ++p;\n }\n\n for(int k = 0; k < v1.size(); ++k)\n for(int l = 0; l < v2.size(); ++l)\n for(int i = 0; i < 3; ++i)\n\tres.push_back(mpp[P(i, v1[k]+v2[l])]);\n\n return res;\n}\n\nint solve(string s)\n{\n int cnt = 0;\n p = 1;\n vector<string> res = rec();\n\n for(int i = 0; i < res.size(); ++i)\n if(res[i] == s) cnt++;\n\n return cnt;\n}\n\nint main()\n{\n int n;\n string s1, s2=\"\";\n\n mkMap(\"\", 0);\n for(int i = 0; i < 4; i++) s2 += \"1\";\n while(getline(cin, str) && str != \"END\"){\n getline(cin, s1);\n n = atoi(s1.c_str());\n\n while(n--){\n getline(cin, s1);\n vec.push_back(func(s1));\n }\n\n cout << solve(s2) << endl;\n vec.clear();\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 0,
"score_of_the_acc": -0.0526,
"final_rank": 3
},
{
"submission_id": "aoj_1037_245562",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cstring>\n#include <cstdlib>\n#include <stack>\n#include <set>\n#include <string>\n#include <cmath>\n\nusing namespace std;\n\nint sits[11];\nint n;\n\nmultiset<int> analysis(string str){\n if(str[0]!='('){\n\t multiset<int> si;\n\t si.insert(sits[atoi(str.c_str())]);\n\t return si;\n }\n else{\n\t multiset<int> si;\n stack<char> s;\n\n\tfor(int i = 0; i < str.size(); i++){\n if(str[i]=='('){\n\ts.push('(');\n }\n else if(str[i]==')'){\n\ts.pop();\n }\n else{\n\tif(s.size()==1&&str[i]==' '){\n\t // ツ閉ェツ環つオツづ催帰\n\t\tstring str1=str.substr(1,i-1);\n\t\tstring str2=str.substr(i+1,str.size()-i-2);\n\n\t\tmultiset<int> s1 = analysis(str1);\n\t\tmultiset<int> s2 = analysis(str2);\n\t // union\n\t {\n\t for(multiset<int>::iterator it = s1.begin(); it!=s1.end(); it++){\n\t for(multiset<int>::iterator iit = s2.begin(); iit!=s2.end(); iit++){\n\t\tsi.insert((*it)|(*iit));\n\t }\n\t }\n\t }\n\t // partition\n\t {\n\t for(multiset<int>::iterator it = s1.begin(); it!=s1.end(); it++){\n\t for(multiset<int>::iterator iit = s2.begin(); iit!=s2.end(); iit++){\n\t\tsi.insert((*it)&(*iit));\n\t }\n\t }\n\t }\n\t // diff\n\t {\n\t for(multiset<int>::iterator it = s1.begin(); it!=s1.end(); it++){\n\t for(multiset<int>::iterator iit = s2.begin(); iit!=s2.end(); iit++){\n\t\tsi.insert((*it)^(*iit));\n\t }\n\t }\n\t }\n\t return si;\n\t}\n }\n }\n }\n}\n\nint main(){\n\n string str;\n while(getline(cin,str)&&str!=\"END\"){\n\t cin>>n;\n for(int i = 0; i < n; i++){\n int s=0;\n for(int j = 0; j < 4; j++){\n\tint b;\n\tcin>>b;\n\tif(b==1)\n\t s+=(int)pow(2.0,j);\n }\n sits[i+1]=s;\n }\n\tmultiset<int> ms = analysis(str);\n\tint cnt=0;\n\tfor(multiset<int>::iterator it = ms.begin(); it!= ms.end(); it++){\n\t\tif(*it==15)\n\t\t\tcnt++;\n\t}\n\tcout<<cnt<<endl;\n\tgetline(cin,str);\n }\n \n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 0,
"score_of_the_acc": -0.0175,
"final_rank": 1
},
{
"submission_id": "aoj_1037_241148",
"code_snippet": "#include<algorithm>\n#include<iostream>\n#include<string>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nstruct bt{\n int a,b,c,d;\n int e;\n struct bt* l;\n struct bt* r;\n};\nint f(int a[][4],string s,struct bt* p,int e){\n int i,j;\n if(s[0]=='('){\n p->l=(struct bt*)malloc(sizeof(struct bt));\n p->r=(struct bt*)malloc(sizeof(struct bt));\n p->e=e;\n e++;\n if(s[1]=='('){\n j=1;\n for(i=2;j;i++){\n\tif(0){\n\t}else if(s[i]=='('){\n\t j++;\n\t}else if(s[i]==')'){\n\t j--;\n\t}\n }\n e=f(a,s.substr(1,i-1),p->l,e);\n }else{\n e=f(a,s.substr(1,1),p->l,e);\n }\n if(s[s.length()-2]==')'){\n j=1;\n for(i=s.length()-3;j;i--){\n\tif(0){\n\t}else if(s[i]==')'){\n\t j++;\n\t}else if(s[i]=='('){\n\t j--;\n\t}\n }\n e=f(a,s.substr(i+1,s.length()-i-2),p->r,e);\n }else{\n e=f(a,s.substr(s.length()-2,1),p->r,e);\n }\n }else{\n p->l=NULL;\n p->r=NULL;\n p->a=a[s[0]-'1'][0];\n p->b=a[s[0]-'1'][1];\n p->c=a[s[0]-'1'][2];\n p->d=a[s[0]-'1'][3];\n }\n return e;\n}\nstruct bt g(struct bt* z,int i){\n struct bt a,b,c;\n if(z->l==NULL){\n return *z;\n }else{\n a=g(z->l,i);\n b=g(z->r,i);\n if(0){\n }else if(i/(int)pow(3,z->e)%3==0){\n c.a=a.a&b.a;\n c.b=a.b&b.b;\n c.c=a.c&b.c;\n c.d=a.d&b.d;\n }else if(i/(int)pow(3,z->e)%3==1){\n c.a=a.a|b.a;\n c.b=a.b|b.b;\n c.c=a.c|b.c;\n c.d=a.d|b.d;\n }else if(i/(int)pow(3,z->e)%3==2){\n c.a=a.a^b.a;\n c.b=a.b^b.b;\n c.c=a.c^b.c;\n c.d=a.d^b.d;\n }\n return c;\n }\n}\nint main(){\n int i,j;\n int a[9][4],n,e;\n int sm;\n string s;\n struct bt c;\n struct bt* z;\n while(getline(cin,s)&&s!=\"END\"){\n cin>>n;\n for(i=0;i<n;i++)\n for(j=0;j<4;j++)\n\tcin>>a[i][j];\n z=(struct bt*)malloc(sizeof(struct bt));\n e=f(a,s,z,0); \n sm=0;\n for(i=0;i<(int)pow(3,e);i++){\n\tc=g(z,i);\n\tsm+=c.a&c.b&c.c&c.d;\n }\n cout<<sm<<endl;\n getline(cin,s);\n } \n return 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 964,
"score_of_the_acc": -0.485,
"final_rank": 12
}
] |
aoj_1028_cpp
|
Problem J:
ICPC: Ideal Coin Payment and Change
Taro, a boy who hates any inefficiencies, pays coins so that the number of coins to be returned as change is minimized in order to do smoothly when he buys something.
One day, however, he doubt if this way is really efficient. When he pays more number of coins, a clerk consumes longer time to find the total value. Maybe he should pay with least possible number of coins.
Thinking for a while, he has decided to take the middle course. So he tries to minimize total number of paid coins and returned coins as change.
Now he is going to buy a product of P yen having several coins. Since he is not good at calculation, please write a program that computes the minimal number of coins.
You may assume following things:
There are 6 kinds of coins, 1 yen, 5 yen, 10 yen, 50 yen, 100 yen and 500 yen.
The total value of coins he has is at least
P
yen.
A clerk will return the change with least number of coins.
Input
Input file contains several data sets.
One data set has following format:
P
N
1
N
5
N
10
N
50
N
100
N
500
N
i
is an integer and is the number of coins of
i
yen that he have.
The end of input is denoted by a case where
P
= 0. You should output nothing for this data set.
Output
Output total number of coins that are paid and are returned.
Constraints
Judge data contains at most 100 data sets.
0 ≤
N
i
≤ 1000
Sample Input
123 3 0 2 0 1 1
999 9 9 9 9 9 9
0 0 0 0 0 0 0
Output for the Sample Input
6
3
|
[
{
"submission_id": "aoj_1028_10866035",
"code_snippet": "/*\n * Author: NomadThanatos\n * Created Time: 2011/8/31 13:51:49\n * File Name: J.cpp\n */\n#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\n#define out(v) cerr << #v << \": \" << (v) << endl\n#define SZ(v) ((int)(v).size())\n\nconst int MAXINT = -1u>>1;\nconst int base[] = {1,5,10,50,100,500};\n\nint num[6];\n\nint calcGive(int mo) {\n int res = 0;\n for(int i = 5 ; i >= 0 ; i--) {\n int toGive = mo / base[i];\n if (toGive > num[i]) {\n toGive = num[i];\n }\n res += toGive;\n mo -= toGive * base[i];\n }\n if (mo) return -1;\n return res;\n}\n\nint calcReturn(int mo) {\n int res = 0;\n for(int i = 5 ; i >= 0 ; i--) {\n res += mo / base[i];\n mo %= base[i];\n }\n return res;\n}\n\nint main() {\n int sum,P;\n while(scanf(\"%d\",&P) == 1) {\n sum = 0;\n for(int i = 0 ; i < 6 ; i++) {\n scanf(\"%d\",num + i);\n sum += num[i] * base[i];\n }\n if (P == 0) break;\n int minm = MAXINT;\n //printf(\"%d %d\",P,sum);\n for(int p = P ; p < sum + 1 ; p++) {\n int give = calcGive(p);\n int ret = calcReturn(p - P);\n if (give != -1) {\n minm = min(minm,give + ret);\n }\n }\n printf(\"%d\\n\",minm);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 480,
"memory_kb": 3504,
"score_of_the_acc": -0.6062,
"final_rank": 12
},
{
"submission_id": "aoj_1028_10688522",
"code_snippet": "#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<iostream>\n#include<sstream>\n#include<iomanip>\n#include<cstdio>\n#include<cmath>\n#include<cstdlib>\n#include<cctype>\n#include<string>\n#include<cstring>\n#include<cstdio>\n#include<cmath>\n#include<cstdlib>\n#include<ctime>\n#include<climits>\n#include<complex>\n#define sz(x) (int)((x).size())\n#define rep(i,n) for (int i=0;i<n;i++)\n#define mp make_pair\n#define pb push_back\n#define all(x) x.begin(),x.end()\n#define clr(x) memset((x),0,sizeof(x))\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vpi;\nint a[111111],b[111111];\nint n;\nint c[10];\nint dp[800000];\nint v[6]={1,5,10,50,100,500};\nint greedy(int x)\n{\n\tint s=0;\n\tint i;\n\tfor (i=5;i>=0;i--)\n\t{\n\t\twhile (x>=v[i])\n\t\t{\n\t\t\ts+=x/v[i];\n\t\t\tx-=(x/v[i])*v[i];\n\t\t}\n\t}\n\treturn s;\n}\nint main()\n{\n\tint i,j,k,p;\n\twhile (scanf(\"%d\",&p)!=EOF)\n\t{\n\t\tfor (i=0;i<6;i++)scanf(\"%d\",c+i);\n\t\tif (p==0)break;\n\t\tn=0;\n\t\tfor (i=0;i<6;i++)\n\t\t{\n\t\t\tint t=c[i],x=1,ac=1;\n\t\t\tif (!t)continue;\n\t\t\twhile (1)\n\t\t\t{\n\t\t\t\ta[n]=x;\n\t\t\t\tb[n++]=x*v[i];\n\t\t\t\tif (ac==t)break;\n\t\t\t\tx<<=1;\n\t\t\t\tac+=x;\n\t\t\t\tif (ac>t)\n\t\t\t\t{\n\t\t\t\t\tac-=x;\n\t\t\t\t\ta[n]=t-ac;\n\t\t\t\t\tb[n++]=(t-ac)*v[i];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t/*\n\t\tprintf(\"%d\\n\",n);\n\t\tfor (i=0;i<n;i++)\n\t\t{\n\t\t\tprintf(\"%d %d\\n\",a[i],b[i]);\n\t\t}\n\t\t*/\n\t\tint l=min(799999,p*2);\n\t\tfor (i=0;i<=l;i++)dp[i]=1<<29;\n\t\tdp[0]=0;\n\t\tfor (i=0;i<n;i++)\n\t\t{\n\t\t\tfor (j=l;j>=b[i];j--)\n\t\t\t{\n\t\t\t\tdp[j]=min(dp[j],dp[j-b[i]]+a[i]);\n\t\t\t}\n\t\t}\n\t\tint ans=1<<29;\n\t\tfor (i=p;i<=l;i++)\n\t\t{\n\t\t\tans=min(ans,dp[i]+greedy(i-p));\n\t\t}\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 920,
"memory_kb": 6688,
"score_of_the_acc": -2,
"final_rank": 13
},
{
"submission_id": "aoj_1028_8818901",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vll;\ntypedef pair<ll, ll> pll;\ntypedef vector<pll> vpll;\n\nconst ll T = 10000;\nll C[6] = {1, 5, 10, 50, 100, 500};\nll P;\nll N[6];\nll dp[2][T];\n\nll calc(ll v) {\n ll ans = 0;\n for (ll i = 5; i >= 0; i--) {\n ans += v / C[i];\n v %= C[i];\n }\n return ans;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n \n while (cin >> P) {\n for(ll i = 0; i < 6; i++) \n cin >> N[i];\n if (P == 0)\n break;\n fill_n(*dp, 2 * T, 1001001001);\n ll cnt = 0;\n for (ll i = 5; i >= 0; i--) {\n while (P - C[i] >= 2500 && N[i]) {\n cnt++;\n N[i]--;\n P -= C[i];\n }\n if (N[i])\n break;\n }\n dp[0][0] = 0;\n for(ll i = 0; i < 6; i++) {\n for(ll j = 0; j < C[i]; j++) {\n queue<pll> deq;\n for (ll k = j; k < T; k += C[i]) {\n ll w = T - k / C[i];\n dp[(i + 1) & 1][k % T] = min(dp[(i + 1) & 1][k % T], dp[i & 1][k % T]);\n while (!deq.empty() && deq.front().second + C[i] * N[i] < k)\n deq.pop();\n if (!deq.empty())\n dp[(i + 1) & 1][k % T] = min(dp[(i + 1) & 1][k % T], deq.front().first - w);\n if (!deq.empty() && deq.front().second + N[i] * C[i] <= k)\n deq.pop();\n deq.push(pll(dp[i & 1][k % T] + w, k));\n }\n }\n }\n ll mi = 1001001001;\n for (ll i = P; i < T; i++) {\n mi = min(mi, dp[0][i % T] + calc(i - P));\n }\n cout << mi + cnt << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 3264,
"score_of_the_acc": -0.1451,
"final_rank": 8
},
{
"submission_id": "aoj_1028_8215254",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\ntypedef vector<pint> vpint;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define reps(i, f, n) for (int i = (f); i < (n); i++)\n#define all(v) (v).begin(), (v).end()\n#define each(it, v) \\\n for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate <typename A, typename B> inline void chmin(A &a, B b) {\n if (a > b)\n a = b;\n}\ntemplate <typename A, typename B> inline void chmax(A &a, B b) {\n if (a < b)\n a = b;\n}\nint C[6] = {1, 5, 10, 50, 100, 500};\nint P;\nint N[6];\nconst int T = 5000;\nint dp[2][T];\nint calc(int v) {\n int ans = 0;\n for (int i = 5; i >= 0; i--) {\n ans += v / C[i];\n v %= C[i];\n }\n return ans;\n}\nsigned main() {\n while (cin >> P) {\n rep(i, 6) cin >> N[i];\n if (P == 0)\n break;\n fill_n(*dp, 2 * T, 1001001001);\n int cnt = 0;\n for (int i = 5; i >= 0; i--) {\n while (P - C[i] >= T / 4 && N[i]) {\n cnt++;\n N[i]--;\n P -= C[i];\n }\n if (N[i])\n break;\n }\n dp[0][0] = 0;\n rep(i, 6) {\n rep(j, C[i]) {\n deque<pint> deq;\n for (int k = j; k < T; k += C[i]) {\n int w = T - k / C[i];\n chmin(dp[(i + 1) & 1][k], dp[i & 1][k]);\n while (deq.size() && deq.front().se + C[i] * N[i] < k)\n deq.pop_front();\n if (deq.size())\n chmin(dp[(i + 1) & 1][k], deq.front().fi - w);\n if (deq.size() && deq.front().se + N[i] * C[i] <= k)\n deq.pop_front();\n deq.pb(pint(dp[i & 1][k] + w, k));\n }\n }\n }\n int mi = 1001001001;\n for (int i = P; i < T; i++) {\n chmin(mi, dp[0][i] + calc(i - P));\n }\n cout << mi + cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3148,
"score_of_the_acc": -0.0337,
"final_rank": 2
},
{
"submission_id": "aoj_1028_8215252",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\ntypedef vector<pint> vpint;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define reps(i, f, n) for (int i = (f); i < (n); i++)\n#define all(v) (v).begin(), (v).end()\n#define each(it, v) \\\n for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate <typename A, typename B> inline void chmin(A &a, B b) {\n if (a > b)\n a = b;\n}\ntemplate <typename A, typename B> inline void chmax(A &a, B b) {\n if (a < b)\n a = b;\n}\nint C[6] = {1, 5, 10, 50, 100, 500};\nint P;\nint N[6];\nconst int T = 10000;\nint dp[2][T];\nint calc(int v) {\n int ans = 0;\n for (int i = 5; i >= 0; i--) {\n ans += v / C[i];\n v %= C[i];\n }\n return ans;\n}\nsigned main() {\n while (cin >> P) {\n rep(i, 6) cin >> N[i];\n if (P == 0)\n break;\n fill_n(*dp, 2 * T, 1001001001);\n int cnt = 0;\n for (int i = 5; i >= 0; i--) {\n while (P - C[i] >= 2500 && N[i]) {\n cnt++;\n N[i]--;\n P -= C[i];\n }\n if (N[i])\n break;\n }\n dp[0][0] = 0;\n rep(i, 6) {\n rep(j, C[i]) {\n deque<pint> deq;\n for (int k = j; k < T; k += C[i]) {\n int w = T - k / C[i];\n chmin(dp[(i + 1) & 1][k], dp[i & 1][k]);\n while (deq.size() && deq.front().se + C[i] * N[i] < k)\n deq.pop_front();\n if (deq.size())\n chmin(dp[(i + 1) & 1][k], deq.front().fi - w);\n if (deq.size() && deq.front().se + N[i] * C[i] <= k)\n deq.pop_front();\n deq.pb(pint(dp[i & 1][k] + w, k));\n }\n }\n }\n int mi = 1001001001;\n for (int i = P; i < T; i++) {\n chmin(mi, dp[0][i] + calc(i - P));\n }\n cout << mi + cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3264,
"score_of_the_acc": -0.1339,
"final_rank": 6
},
{
"submission_id": "aoj_1028_8115664",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\ntypedef vector<pint> vpint;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define reps(i, f, n) for (int i = (f); i < (n); i++)\n#define all(v) (v).begin(), (v).end()\n#define each(it, v) \\\n for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate <typename A, typename B> inline void chmin(A &a, B b) {\n if (a > b)\n a = b;\n}\ntemplate <typename A, typename B> inline void chmax(A &a, B b) {\n if (a < b)\n a = b;\n}\nint C[6] = {1, 5, 10, 50, 100, 500};\nint P;\nint N[6];\nconst int T = 10000;\nint dp[2][T];\nint calc(int v) {\n int ans = 0;\n for (int i = 5; i >= 0; i--) {\n ans += v / C[i];\n v %= C[i];\n }\n return ans;\n}\nsigned main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n while (cin >> P) {\n rep(i, 6) cin >> N[i];\n if (P == 0)\n break;\n fill_n(*dp, 2 * T, 1001001001);\n int cnt = 0;\n for (int i = 5; i >= 0; i--) {\n while (P - C[i] >= 2500 && N[i]) {\n cnt++;\n N[i]--;\n P -= C[i];\n }\n if (N[i])\n break;\n }\n dp[0][0] = 0;\n rep(i, 6) {\n rep(j, C[i]) {\n deque<pint> deq;\n for (int k = j; k < T; k += C[i]) {\n int w = T - k / C[i];\n chmin(dp[(i + 1) & 1][k], dp[i & 1][k]);\n while (deq.size() && deq.front().se + C[i] * N[i] < k)\n deq.pop_front();\n if (deq.size())\n chmin(dp[(i + 1) & 1][k], deq.front().fi - w);\n if (deq.size() && deq.front().se + N[i] * C[i] <= k)\n deq.pop_front();\n deq.pb(pint(dp[i & 1][k] + w, k));\n }\n }\n }\n int mi = 1001001001;\n for (int i = P; i < T; i++) {\n chmin(mi, dp[0][i] + calc(i - P));\n }\n cout << mi + cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3316,
"score_of_the_acc": -0.1486,
"final_rank": 9
},
{
"submission_id": "aoj_1028_8115660",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\ntypedef vector<pint> vpint;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define reps(i, f, n) for (int i = (f); i < (n); i++)\n#define all(v) (v).begin(), (v).end()\n#define each(it, v) \\\n for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate <typename A, typename B> inline void chmin(A &a, B b) {\n if (a > b)\n a = b;\n}\ntemplate <typename A, typename B> inline void chmax(A &a, B b) {\n if (a < b)\n a = b;\n}\nint C[6] = {1, 5, 10, 50, 100, 500};\nint P;\nint N[6];\nconst int T = 10000;\nint dp[2][T];\nint calc(int v) {\n int ans = 0;\n for (int i = 5; i >= 0; i--) {\n ans += v / C[i];\n v %= C[i];\n }\n return ans;\n}\nsigned main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n while (cin >> P) {\n rep(i, 6) cin >> N[i];\n if (P == 0)\n break;\n fill_n(*dp, 2 * T, 1001001001);\n int cnt = 0;\n for (int i = 5; i >= 0; i--) {\n while (P - C[i] >= 2500 && N[i]) {\n cnt++;\n N[i]--;\n P -= C[i];\n }\n if (N[i])\n break;\n }\n dp[0][0] = 0;\n rep(i, 6) {\n rep(j, C[i]) {\n deque<pint> deq;\n for (int k = j; k < T; k += C[i]) {\n int w = T - k / C[i];\n chmin(dp[(i + 1) & 1][k], dp[i & 1][k]);\n while (deq.size() && deq.front().se + C[i] * N[i] < k)\n deq.pop_front();\n if (deq.size())\n chmin(dp[(i + 1) & 1][k], deq.front().fi - w);\n if (deq.size() && deq.front().se + N[i] * C[i] <= k)\n deq.pop_front();\n deq.pb(pint(dp[i & 1][k] + w, k));\n }\n }\n }\n int mi = 1001001001;\n for (int i = P; i < T; i++) {\n chmin(mi, dp[0][i] + calc(i - P));\n }\n cout << mi + cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3268,
"score_of_the_acc": -0.135,
"final_rank": 7
},
{
"submission_id": "aoj_1028_8115657",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\ntypedef vector<pint> vpint;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define reps(i, f, n) for (int i = (f); i < (n); i++)\n#define all(v) (v).begin(), (v).end()\n#define each(it, v) for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate <typename A, typename B> inline void chmin(A &a, B b) {\n if (a > b)\n a = b;\n}\ntemplate <typename A, typename B> inline void chmax(A &a, B b) {\n if (a < b)\n a = b;\n}\nint C[6] = {1, 5, 10, 50, 100, 500};\nint P;\nint N[6];\nconst int T = 10000;\nint dp[2][T];\nint calc(int v) {\n int ans = 0;\n for (int i = 5; i >= 0; i--) {\n ans += v / C[i];\n v %= C[i];\n }\n return ans;\n}\nsigned main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n while (cin >> P) {\n rep(i, 6) cin >> N[i];\n if (P == 0)\n break;\n fill_n(*dp, 2 * T, 1001001001);\n int cnt = 0;\n for (int i = 5; i >= 0; i--) {\n while (P - C[i] >= 2500 && N[i]) {\n cnt++;\n N[i]--;\n P -= C[i];\n }\n if (N[i])\n break;\n }\n dp[0][0] = 0;\n rep(i, 6) {\n rep(j, C[i]) {\n deque<pint> deq;\n for (int k = j; k < T; k += C[i]) {\n int w = T - k / C[i];\n chmin(dp[(i + 1) & 1][k], dp[i & 1][k]);\n while (deq.size() && deq.front().se + C[i] * N[i] < k)\n deq.pop_front();\n if (deq.size())\n chmin(dp[(i + 1) & 1][k], deq.front().fi - w);\n if (deq.size() && deq.front().se + N[i] * C[i] <= k)\n deq.pop_front();\n deq.pb(pint(dp[i & 1][k] + w, k));\n }\n }\n }\n int mi = 1001001001;\n for (int i = P; i < T; i++) {\n chmin(mi, dp[0][i] + calc(i - P));\n }\n cout << mi + cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3392,
"score_of_the_acc": -0.1701,
"final_rank": 10
},
{
"submission_id": "aoj_1028_8115654",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\ntypedef vector<pint> vpint;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define reps(i, f, n) for (int i = (f); i < (n); i++)\n#define all(v) (v).begin(), (v).end()\n#define each(it, v) \\\n for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate <typename A, typename B> inline void chmin(A &a, B b) {\n if (a > b)\n a = b;\n}\ntemplate <typename A, typename B> inline void chmax(A &a, B b) {\n if (a < b)\n a = b;\n}\nint C[6] = {1, 5, 10, 50, 100, 500};\nint P;\nint N[6];\nconst int T = 10000;\nint dp[2][T];\nint calc(int v) {\n int ans = 0;\n for (int i = 5; i >= 0; i--) {\n ans += v / C[i];\n v %= C[i];\n }\n return ans;\n}\nsigned main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n while (cin >> P) {\n rep(i, 6) cin >> N[i];\n if (P == 0)\n break;\n fill_n(*dp, 2 * T, 1001001001);\n int cnt = 0;\n for (int i = 5; i >= 0; i--) {\n while (P - C[i] >= 2500 && N[i]) {\n cnt++;\n N[i]--;\n P -= C[i];\n }\n if (N[i])\n break;\n }\n dp[0][0] = 0;\n rep(i, 6) {\n rep(j, C[i]) {\n deque<pint> deq;\n for (int k = j; k < T; k += C[i]) {\n int w = T - k / C[i];\n chmin(dp[(i + 1) & 1][k], dp[i & 1][k]);\n while (deq.size() && deq.front().se + C[i] * N[i] < k)\n deq.pop_front();\n if (deq.size())\n chmin(dp[(i + 1) & 1][k], deq.front().fi - w);\n if (deq.size() && deq.front().se + N[i] * C[i] <= k)\n deq.pop_front();\n deq.pb(pint(dp[i & 1][k] + w, k));\n }\n }\n }\n int mi = 1001001001;\n for (int i = P; i < T; i++) {\n chmin(mi, dp[0][i] + calc(i - P));\n }\n cout << mi + cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3192,
"score_of_the_acc": -0.1136,
"final_rank": 5
},
{
"submission_id": "aoj_1028_8112820",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\ntypedef vector<pint> vpint;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define reps(i, f, n) for (int i = (f); i < (n); i++)\n#define all(v) (v).begin(), (v).end()\n#define each(it, v) \\\n for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate <typename A, typename B> inline void chmin(A &a, B b) {\n if (a > b)\n a = b;\n}\ntemplate <typename A, typename B> inline void chmax(A &a, B b) {\n if (a < b)\n a = b;\n}\nint C[6] = {1, 5, 10, 50, 100, 500};\nint P;\nint N[6];\nconst int T = 5000;\nint dp[2][T];\nint calc(int v) {\n int ans = 0;\n for (int i = 5; i >= 0; i--) {\n ans += v / C[i];\n v %= C[i];\n }\n return ans;\n}\nsigned main() {\n while (cin >> P) {\n rep(i, 6) cin >> N[i];\n if (P == 0)\n break;\n fill_n(*dp, 2 * T, 1001001001);\n int cnt = 0;\n for (int i = 5; i >= 0; i--) {\n while (P - C[i] >= 2500 && N[i]) {\n cnt++;\n N[i]--;\n P -= C[i];\n }\n if (N[i])\n break;\n }\n dp[0][0] = 0;\n rep(i, 6) {\n rep(j, C[i]) {\n deque<pint> deq;\n for (int k = j; k < T; k += C[i]) {\n int w = T - k / C[i];\n chmin(dp[(i + 1) & 1][k], dp[i & 1][k]);\n while (deq.size() && deq.front().se + C[i] * N[i] < k)\n deq.pop_front();\n if (deq.size())\n chmin(dp[(i + 1) & 1][k], deq.front().fi - w);\n if (deq.size() && deq.front().se + N[i] * C[i] <= k)\n deq.pop_front();\n deq.pb(pint(dp[i & 1][k] + w, k));\n }\n }\n }\n int mi = 1001001001;\n for (int i = P; i < T; i++) {\n chmin(mi, dp[0][i] + calc(i - P));\n }\n cout << mi + cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3232,
"score_of_the_acc": -0.0462,
"final_rank": 3
},
{
"submission_id": "aoj_1028_8051241",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing pint = pair<int, int>;\nusing vpint = vector<pint>;\n\nconst int MAX_C = 6;\nconst int INF = 1001001001;\nconst int MAX_T = 10000;\nconst int MAX_N = 10000;\n\nint C[MAX_C] = {1, 5, 10, 50, 100, 500};\nint P;\nint N[MAX_C];\nint dp[2][MAX_T];\n\nint calc(int v) {\n int ans = 0;\n for (int i = 5; i >= 0; i--) {\n ans += v / C[i];\n v %= C[i];\n }\n return ans;\n}\n\nsigned main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n while (cin >> P) {\n for (int i = 0; i < MAX_C; i++) {\n cin >> N[i];\n }\n if (P == 0) {\n break;\n }\n\n fill_n(*dp, 2 * MAX_T, INF);\n int cnt = 0;\n for (int i = 5; i >= 0; i--) {\n while (P - C[i] >= 2500 && N[i] > 0) {\n cnt++;\n N[i]--;\n P -= C[i];\n }\n if (N[i] > 0) {\n break;\n }\n }\n dp[0][0] = 0;\n for (int i = 0; i < MAX_C; i++) {\n int cur = i & 1, nxt = (i + 1) & 1;\n for (int j = 0; j < C[i]; j++) {\n deque<pint> deq;\n for (int k = j; k < MAX_T; k += C[i]) {\n int w = MAX_T - k / C[i];\n dp[nxt][k] = min(dp[nxt][k], dp[cur][k]);\n while (!deq.empty() && deq.front().second + C[i] * N[i] < k) {\n deq.pop_front();\n }\n if (!deq.empty()) {\n dp[nxt][k] = min(dp[nxt][k], deq.front().first - w);\n }\n if (!deq.empty() && deq.front().second + N[i] * C[i] <= k) {\n deq.pop_front();\n }\n deq.emplace_back(dp[cur][k] + w, k);\n }\n }\n }\n int mi = INF;\n for (int i = P; i < MAX_T; i++) {\n mi = min(mi, dp[0][i] + calc(i - P));\n }\n cout << mi + cnt << '\\n';\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3232,
"score_of_the_acc": -0.0237,
"final_rank": 1
},
{
"submission_id": "aoj_1028_8051240",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\ntypedef vector<pint> vpint;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define reps(i, f, n) for (int i = (f); i < (n); i++)\n#define all(v) (v).begin(), (v).end()\n#define each(it, v) \\\n for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate <typename A, typename B> inline void chmin(A &a, B b) {\n if (a > b)\n a = b;\n}\ntemplate <typename A, typename B> inline void chmax(A &a, B b) {\n if (a < b)\n a = b;\n}\nint C[6] = {1, 5, 10, 50, 100, 500};\nint P;\nint N[6];\nconst int T = 10000;\nint dp[2][T];\nint calc(int v) {\n int ans = 0;\n for (int i = 5; i >= 0; i--) {\n ans += v / C[i];\n v %= C[i];\n }\n return ans;\n}\nsigned main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while (cin >> P && P) {\n rep(i, 6) cin >> N[i];\n fill_n(*dp, 2 * T, 1001001001);\n int cnt = 0;\n for (int i = 5; i >= 0; i--) {\n while (P - C[i] >= 2500 && N[i]) {\n cnt++;\n N[i]--;\n P -= C[i];\n }\n if (N[i])\n break;\n }\n dp[0][0] = 0;\n rep(i, 6) {\n rep(j, C[i]) {\n deque<pint> deq;\n for (int k = j; k < T; k += C[i]) {\n int w = T - k / C[i];\n chmin(dp[(i + 1) & 1][k], dp[i & 1][k]);\n while (deq.size() && deq.front().se + C[i] * N[i] < k)\n deq.pop_front();\n if (deq.size())\n chmin(dp[(i + 1) & 1][k], deq.front().fi - w);\n if (deq.size() && deq.front().se + N[i] * C[i] <= k)\n deq.pop_front();\n deq.pb(pint(dp[i & 1][k] + w, k));\n }\n }\n }\n int mi = 1001001001;\n for (int i = P; i < T; i++) {\n chmin(mi, dp[0][i] + calc(i - P));\n }\n cout << mi + cnt << '\\n';\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3312,
"score_of_the_acc": -0.0576,
"final_rank": 4
},
{
"submission_id": "aoj_1028_8051239",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\ntypedef vector<pint> vpint;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define reps(i, f, n) for (int i = (f); i < (n); i++)\n#define all(v) (v).begin(), (v).end()\n#define each(it, v) for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate <typename A, typename B> inline void chmin(A &a, B b) {\n if (a > b)\n a = b;\n}\ntemplate <typename A, typename B> inline void chmax(A &a, B b) {\n if (a < b)\n a = b;\n}\nint C[6] = {1, 5, 10, 50, 100, 500};\nint P;\nint N[6];\nconst int T = 10000;\nint dp[2][T];\nint calc(int v) {\n int ans = 0;\n for (int i = 5; i >= 0; i--) {\n ans += v / C[i];\n v %= C[i];\n }\n return ans;\n}\nsigned main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n while (cin >> P) {\n rep(i, 6) cin >> N[i];\n if (P == 0)\n break;\n fill_n(*dp, 2 * T, 1001001001);\n int cnt = 0;\n for (int i = 5; i >= 0; i--) {\n while (P - C[i] >= 2500 && N[i]) {\n cnt++;\n N[i]--;\n P -= C[i];\n }\n if (N[i])\n break;\n }\n dp[0][0] = 0;\n rep(i, 6) {\n rep(j, C[i]) {\n deque<pint> deq;\n for (int k = j; k < T; k += C[i]) {\n int w = T - k / C[i];\n chmin(dp[(i + 1) & 1][k], dp[i & 1][k]);\n while (deq.size() && deq.front().se + C[i] * N[i] < k)\n deq.pop_front();\n if (deq.size())\n chmin(dp[(i + 1) & 1][k], deq.front().fi - w);\n if (deq.size() && deq.front().se + N[i] * C[i] <= k)\n deq.pop_front();\n deq.pb(pint(dp[i & 1][k] + w, k));\n }\n }\n }\n int mi = 1001001001;\n for (int i = P; i < T; i++) {\n chmin(mi, dp[0][i] + calc(i - P));\n }\n cout << mi + cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3640,
"score_of_the_acc": -0.2064,
"final_rank": 11
}
] |
aoj_1040_cpp
|
Problem F:
Chocolate with Heart Marks
太郎君はチョコレートが大好きで, 学校から帰るとハートマークが描かれたお気に入りの板チョコを食べます, 最近の楽しみは, すべてのハートマークのブロックを最後まで残すように食べることです. 太郎君は, すべてのハートマークのブロックがつながったまま, できるだけ多くのハートマークのないブロックを食べようとします.
しかし太郎君はまだ幼く, 上記のように食べようとしても無駄なブロックが残ってしまいます. そこで太郎君は, すべてのハートマークのブロックをつながったまま残すときに食べられる最大のブロック数を求めるプログラムの作成をあなたに依頼しました.
太郎君は, すべてのハートマークのブロックがつながっている限り、どんな食べ方をしてもかまいません. ブロックのいずれか一辺が他のブロックに接していないと分かれていることになります.
Input
入力は複数のデータセットからなります. 各データセットは以下の形式で与えられます:
H W
H
×
W
個の数字
H
,
W
はそれぞれ板チョコの縦のサイズ, 横のサイズを示す整数です.
H
×
W
個の数字はブロックの情報を表し, ハートマークのないブロックを表す '
0
', ハートマークのブロックを表す '
1
' から構成されます.
入力の終了は,
H
=
W
= 0 であるデータセットによって示されます. このケースに対して出力をしてはいけません.
1 ≤
H
,
W
≤ 12 であり、ハートマークのブロックの数は 6 個以下と仮定してかまいません.
Output
それぞれのデータセットに対して, 太郎君が食べられる最大のブロック数を出力してください.
Sample Input
4 4
1 0 0 0
0 0 1 0
0 1 0 0
1 0 0 1
1 1
1
2 3
1 0 0
0 0 1
0 0
Output for the Sample Input
7
0
2
|
[
{
"submission_id": "aoj_1040_10260991",
"code_snippet": "#line 2 \"template.hpp\"\n// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\nusing namespace std;\n// https://xn--kst.jp/blog/2019/08/29/cpp-comp/\n// debug methods\n// usage: debug(x,y);\n// vector 出力できるように修正\ntemplate <typename T>\nostream& debug_print(ostream& os, const vector<T>& v) {\n os << \"[\";\n for (size_t i = 0; i < v.size(); ++i) {\n os << v[i];\n if (i < v.size() - 1) os << \", \";\n }\n os << \"]\";\n return os;\n}\ntemplate <typename T>\nostream& debug_print(ostream& os, const T& var) {\n os << var;\n return os;\n}\n#define CHOOSE(a) CHOOSE2 a\n#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x\n#define debug_1(x1) { cout << #x1 << \": \"; debug_print(cout, x1) << endl; }\n#define debug_2(x1, x2) { cout << #x1 << \": \"; debug_print(cout, x1) << \", \" << #x2 << \": \"; debug_print(cout, x2) << endl; }\n#define debug_3(x1, x2, x3) { cout << #x1 << \": \"; debug_print(cout, x1) << \", \" << #x2 << \": \"; debug_print(cout, x2) << \", \" << #x3 << \": \"; debug_print(cout, x3) << endl; }\n#define debug_4(x1, x2, x3, x4) { cout << #x1 << \": \"; debug_print(cout, x1) << \", \" << #x2 << \": \"; debug_print(cout, x2) << \", \" << #x3 << \": \"; debug_print(cout, x3) << \", \" << #x4 << \": \"; debug_print(cout, x4) << endl; }\n#define debug_5(x1, x2, x3, x4, x5) { cout << #x1 << \": \"; debug_print(cout, x1) << \", \" << #x2 << \": \"; debug_print(cout, x2) << \", \" << #x3 << \": \"; debug_print(cout, x3) << \", \" << #x4 << \": \"; debug_print(cout, x4) << \", \" << #x5 << \": \"; debug_print(cout, x5) << endl; }\n\n#ifdef LOCAL\n#define debug(...) CHOOSE((__VA_ARGS__, debug_5, debug_4, debug_3, debug_2, debug_1, ~))(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n\nusing ll = long long;\nusing vl = vector<ll>;\nusing vll = vector<vl>;\nusing P = pair<ll, ll>;\n#define all(v) v.begin(), v.end()\ntemplate <typename T> inline bool chmax(T &a, T b) {\n return ((a < b) ? (a = b, true) : (false));\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n return ((a > b) ? (a = b, true) : (false));\n}\n#define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i)\n// https://trap.jp/post/1224/\ntemplate <class... T> constexpr auto min(T... a) {\n return min(initializer_list<common_type_t<T...>>{a...});\n}\ntemplate <class... T> constexpr auto max(T... a) {\n return max(initializer_list<common_type_t<T...>>{a...});\n}\ntemplate <class... T> void input(T &...a) { (cin >> ... >> a); }\ntemplate <class T> void input(vector<T> &a) {\n for(T &x : a)\n cin >> x;\n}\nvoid print() { cout << '\\n'; }\ntemplate <class T, class... Ts> void print(const T &a, const Ts &...b) {\n cout << a;\n (cout << ... << (cout << ' ', b));\n cout << '\\n';\n}\nvoid print(const string &s) {\n cout << s << '\\n';\n}\ntemplate <class Container, typename = void>\nstruct is_container : std::false_type {};\ntemplate <class Container>\nstruct is_container<Container, std::void_t<decltype(std::declval<Container>().begin()), decltype(std::declval<Container>().end())>> : std::true_type {};\ntemplate <class Container>\ntypename enable_if<is_container<Container>::value>::type print(const Container& x) {\n if (!x.empty()) {\n auto it = x.begin();\n for (; it != prev(x.end()); ++it) {\n cout << *it << \" \";\n }\n cout << *it << \"\\n\"; // 最後の要素を出力して改行\n }\n}\n#define INT(...) \\\n int __VA_ARGS__; \\\n input(__VA_ARGS__)\n#define LL(...) \\\n long long __VA_ARGS__; \\\n input(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n input(__VA_ARGS__)\n#define REP1(a) for(ll i = 0; i < a; i++)\n#define REP2(i, a) for(ll i = 0; i < a; i++)\n#define REP3(i, a, b) for(ll i = a; i < b; i++)\n#define REP4(i, a, b, c) for(ll i = a; i < b; i += c)\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)\n\nll inf = 3e18;\nvl dx = {1, -1, 0, 0};\nvl dy = {0, 0, 1, -1};\n#line 3 \"graph/graph-template.hpp\"\n// https://ei1333.github.io/library/graph/graph-template.hpp\ntemplate <class T = ll> struct Edge {\n int from, to;\n T cost;\n int idx;\n Edge() = default;\n Edge(int from, int to, T cost = 1, int idx = -1)\n : from(from), to(to), cost(cost), idx(idx) {}\n};\ntemplate <class T = ll> struct Graph {\n vector<vector<Edge<T>>> g;\n int es; // edge_size\n Graph(int n) : g(n), es(0) {};\n int size() const { return g.size(); }\n void add_directed_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es++);\n }\n void add_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es);\n g[to].emplace_back(to, from, cost, es++);\n }\n vector<Edge<T>> &operator[](const int &k) { return g[k]; }\n const vector<Edge<T>> &operator[](const int &k) const { return g[k]; }\n void read(int m, int padding = -1, bool weighted = false,\n bool directed = false) {\n rep(i, m) {\n int a, b;\n T c(1);\n cin >> a >> b;\n a += padding;\n b += padding;\n if(weighted)\n cin >> c;\n if(directed)\n add_directed_edge(a, b, c);\n else\n add_edge(a, b, c);\n }\n }\n};\n#line 3 \"graph/minimum-steiner-tree.hpp\"\ntemplate <class T = ll> struct MinimumSteinerTree {\n int n, k;\n vector<int> terminal;\n T cost;\n const T infty = numeric_limits<T>::max();\n vector<vector<T>> dp;\n MinimumSteinerTree(const Graph<T> &g, const vector<int> terminal)\n : n(g.size()), k(terminal.size()), terminal(terminal), cost(0),\n dp(1 << k, vector<T>(n, infty)) {\n rep(i, k) {\n dp[1 << i][terminal[i]] = 0;\n }\n rep(bit, 1, 1 << k) {\n rep(i, n) {\n for(int sub = (bit - 1) & bit; sub > 0; sub = (sub - 1) & bit) {\n if(dp[sub][i] != infty and dp[bit ^ sub][i] != infty)\n chmin(dp[bit][i], dp[sub][i] + dp[bit ^ sub][i]);\n }\n }\n using pti = pair<T, int>;\n priority_queue<pti, vector<pti>, greater<pti>> pq;\n rep(i, n) pq.push(pti(dp[bit][i], i));\n while(pq.size()) {\n auto [c, v] = pq.top();\n pq.pop();\n if(c != dp[bit][v] or c == infty)\n continue;\n for(auto &e : g[v]) {\n T nc = c + e.cost;\n if(chmin(dp[bit][e.to], nc))\n pq.push(pti(nc, e.to));\n }\n }\n }\n cost = dp.back()[terminal.front()];\n }\n};\n#line 3 \"/home/y_midori/cp/test3.cpp\"\nll h, w;\nvoid solve() {\n if(h == 0 and w == 0)\n exit(0);\n Graph<ll> g(h * w);\n rep(i, h) rep(j, w) {\n if(i + 1 < h)\n g.add_edge(i * w + j, (i + 1) * w + j);\n if(j + 1 < w)\n g.add_edge(i * w + j, i * w + j + 1);\n }\n vector<int> term;\n rep(i, h) rep(j, w) {\n INT(c);\n if(c)\n term.emplace_back(i * w + j);\n }\n MinimumSteinerTree<ll> mst(g, term);\n print(h * w - mst.cost - 1);\n // 木になるのでコスト(辺数)+1が頂点数\n}\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n // LL(t);\n while(cin >> h >> w)\n solve();\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3576,
"score_of_the_acc": -1,
"final_rank": 17
},
{
"submission_id": "aoj_1040_10258953",
"code_snippet": "/*\n\n Problem F: Chocolate with Heart Marks\n\nTaro loves chocolate, and when he gets home from school he eats his favorite chocolate bar with heart marks,\nand his recent enjoyment is to eat all the heart mark blocks to the end.\nTaro tries to eat as many heart marks as possible, leaving all the heart mark blocks connected.\n\n However, Taro is still young, and if you try to eat it like the one mentioned above,\n you'll end up with unnecessary blocks. So Taro asked you to create a program that will determine\n the maximum number of blocks you can eat when leaving all the heart-marked blocks connected.\n\nTaro does not care how you eat as long as all the heart-marked blocks are connected. \nIf one side of the block is not in contact with the other block, then it is divided.\n\n\nInput\n\nThe input consists of multiple data sets. Each data set is given in the following format: \n\n H and W are integers that represent the vertical and horizontal size of the chocolate bar, respectively. \n H x W numbers represent information about the block, and ' 0 ', which represents a block without a heart mark, and ' 1 consist of ', which represents a block with a heart mark.\n\nThe end of the input is indicated by a dataset where H = W = 0. Do not output for this case.\n\nIt can be assumed that 1 <= H, W <= 12, and the number of heart mark blocks is less than or equal to 6. \n\n*/\n\n// Remove aggressive optimization pragmas that cause conflicts with standard library\n// #pragma GCC optimize(\"-O3,inline,unroll-all-loops,fast-math\")\n// #pragma GCC target(\"tune=native\")\n// #pragma GCC target(\"avx2\")\n\n// Replace bits/stdc++.h with specific standard headers\n#include <algorithm>\n#include <array>\n#include <cassert>\n#include <chrono>\n#include <cmath>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <string>\n#include <tuple>\n#include <type_traits>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n#include <sys/time.h>\nusing namespace std;\n\n// Macros\n\nusing i8 = int8_t;\nusing u8 = uint8_t;\nusing i16 = int16_t;\nusing u16 = uint16_t;\nusing i32 = int32_t;\nusing u32 = uint32_t;\nusing i64 = int64_t;\nusing u64 = uint64_t;\nusing f32 = float;\nusing f64 = double;\n\n#define ALWAYS_INLINE __attribute__((always_inline))\n#define FORCE_INLINE ALWAYS_INLINE inline\n\n#define AS_STRING_IMPL(x) #x\n#define AS_STRING(x) AS_STRING_IMPL(x)\n#define runtime_assert(x) \\\n do { \\\n if (!(x)) { throw runtime_error(__FILE__ \":\" AS_STRING(__LINE__) \" Assertion failed: \" #x); } \\\n } while (0)\n#define impossible() \\\n do { throw runtime_error(__FILE__ \":\" AS_STRING(__LINE__) \" impossible\"); } while (0)\n#define all(x) begin(x), end(x)\n#define pb push_back\n#define eb emplace_back\n\n// Types\n\ntemplate <class T>\nusing min_queue = priority_queue<T, vector<T>, greater<T>>;\ntemplate <class T>\nusing max_queue = priority_queue<T>;\n\n// Printing\n\ntemplate <class T>\nvoid print_collection(ostream& out, T const& x);\n\ntemplate <class T, size_t... I>\nvoid print_tuple(ostream& out, T const& a, index_sequence<I...>);\n\nnamespace std {\n\ntemplate <class... A>\nostream& operator<<(ostream& out, tuple<A...> const& x) {\n print_tuple(out, x, index_sequence_for<A...>{});\n return out;\n}\ntemplate <class... A>\nostream& operator<<(ostream& out, pair<A...> const& x) {\n print_tuple(out, x, index_sequence_for<A...>{});\n return out;\n}\n\ntemplate <class A, size_t N>\nostream& operator<<(ostream& out, array<A, N> const& x) {\n print_collection(out, x);\n return out;\n}\ntemplate <class A>\nostream& operator<<(ostream& out, vector<A> const& x) {\n print_collection(out, x);\n return out;\n}\ntemplate <class A>\nostream& operator<<(ostream& out, deque<A> const& x) {\n print_collection(out, x);\n return out;\n}\ntemplate <class A>\nostream& operator<<(ostream& out, multiset<A> const& x) {\n print_collection(out, x);\n return out;\n}\ntemplate <class A, class B>\nostream& operator<<(ostream& out, multimap<A, B> const& x) {\n print_collection(out, x);\n return out;\n}\ntemplate <class A>\nostream& operator<<(ostream& out, set<A> const& x) {\n print_collection(out, x);\n return out;\n}\ntemplate <class A, class B>\nostream& operator<<(ostream& out, map<A, B> const& x) {\n print_collection(out, x);\n return out;\n}\ntemplate <class A, class B>\nostream& operator<<(ostream& out, unordered_set<A> const& x) {\n print_collection(out, x);\n return out;\n}\n\n} // namespace std\n\ntemplate <class T, size_t... I>\nvoid print_tuple(ostream& out, T const& a, index_sequence<I...>) {\n using swallow = int[];\n out << '(';\n (void)swallow{0, (void(out << (I == 0 ? \"\" : \", \") << get<I>(a)), 0)...};\n out << ')';\n}\n\ntemplate <class T>\nvoid print_collection(ostream& out, T const& x) {\n int f = 0;\n out << '[';\n for (auto const& i : x) {\n out << (f++ ? \",\" : \"\");\n out << i;\n }\n out << \"]\";\n}\n\n// Random\n\nstruct RNG {\n uint64_t s[2]{};\n\n explicit RNG(u64 seed) { reset(seed); }\n\n RNG() { reset(time(0)); }\n\n using result_type = u32;\n static constexpr u32 min() { return numeric_limits<u32>::min(); }\n static constexpr u32 max() { return numeric_limits<u32>::max(); }\n u32 operator()() { return randomInt32(); }\n\n static FORCE_INLINE uint64_t rotl(const uint64_t x, int k) { return (x << k) | (x >> (64 - k)); }\n\n inline void reset(u64 seed = time(nullptr)) {\n struct splitmix64_state {\n u64 s;\n\n u64 splitmix64() {\n u64 result = (s += 0x9E3779B97f4A7C15);\n result = (result ^ (result >> 30)) * 0xBF58476D1CE4E5B9;\n result = (result ^ (result >> 27)) * 0x94D049BB133111EB;\n return result ^ (result >> 31);\n }\n };\n\n splitmix64_state sm{seed};\n\n s[0] = sm.splitmix64();\n s[1] = sm.splitmix64();\n }\n\n uint64_t next() {\n const uint64_t s0 = s[0];\n uint64_t s1 = s[1];\n const uint64_t result = rotl(s0 * 5, 7) * 9;\n\n s1 ^= s0;\n s[0] = rotl(s0, 24) ^ s1 ^ (s1 << 16); // a, b\n s[1] = rotl(s1, 37); // c\n\n return result;\n }\n\n inline u32 randomInt32() { return next(); }\n\n inline u64 randomInt64() { return next(); }\n\n inline u32 random32(u32 r) { return (((u64)randomInt32()) * r) >> 32; }\n\n inline u64 random64(u64 r) { return randomInt64() % r; }\n\n inline u32 randomRange32(u32 l, u32 r) { return l + random32(r - l + 1); }\n\n inline u64 randomRange64(u64 l, u64 r) { return l + random64(r - l + 1); }\n\n inline double randomDouble() { return (double)randomInt32() / 4294967296.0; }\n\n inline float randomFloat() { return (float)randomInt32() / 4294967296.0; }\n\n inline double randomRangeDouble(double l, double r) { return l + randomDouble() * (r - l); }\n\n template <class T>\n void shuffle(vector<T>& v) {\n i32 sz = v.size();\n for (i32 i = sz; i > 1; i--) {\n i32 p = (i32)random32(i);\n swap(v[i - 1], v[p]);\n }\n }\n\n template <class T>\n void shuffle(T* fr, T* to) {\n i32 sz = distance(fr, to);\n for (int i = sz; i > 1; i--) {\n int p = (i32)random32(i);\n swap(fr[i - 1], fr[p]);\n }\n }\n\n template <class T>\n inline int sample_index(vector<T> const& v) {\n return random32(v.size());\n }\n\n template <class T>\n inline T sample(vector<T> const& v) {\n return v[sample_index(v)];\n }\n} rng;\n\n// Timer\n\nstruct timer {\n chrono::high_resolution_clock::time_point t_begin;\n\n timer() : t_begin(chrono::high_resolution_clock::now()) {}\n\n void reset() { t_begin = chrono::high_resolution_clock::now(); }\n\n [[nodiscard]] double elapsed() const { return chrono::duration<double>(chrono::high_resolution_clock::now() - t_begin).count(); }\n};\n\n// Util\n\ntemplate <class T>\nT& smin(T& x, T const& y) {\n x = min(x, y);\n return x;\n}\n\ntemplate <class T>\nT& smax(T& x, T const& y) {\n x = max(x, y);\n return x;\n}\n\ntemplate <typename T>\nint sgn(T val) {\n if (val < 0) return -1;\n if (val > 0) return 1;\n return 0;\n}\n\nstatic inline string int_to_string(int val, int digits = 0) {\n string s = to_string(val);\n reverse(all(s));\n while ((int)s.size() < digits) s.pb('0');\n reverse(all(s));\n return s;\n}\n\n// Debug\n\nstatic inline void debug_impl_seq() { cerr << \"}\"; }\n\ntemplate <class T, class... V>\nvoid debug_impl_seq(T const& t, V const&... v) {\n cerr << t;\n if (sizeof...(v)) { cerr << \", \"; }\n debug_impl_seq(v...);\n}\n\n#define debug(x...) \\\n do { \\\n cerr << __FILE__ \":\" AS_STRING(__LINE__) \" {\" << #x << \"} = {\"; \\\n debug_impl_seq(x); \\\n cerr << endl << flush; \\\n } while (0)\n\n#define nl '\\n'\nusing ll = long long;\n\nconst ll infll = (1LL << 62) - 1;\nconst int inf = (1 << 30) - 1;\n\ninline bool has_bit_set(const i32 x, const i32 id) { return (x & (1 << id)) != 0; }\ninline void set_bit(i32& x, const i32 id) { x |= (1 << id); }\ninline void unset_bit(i32 &x, const i32 id){ x &= ~(1 << id); }\n\ntemplate <typename T1, typename T2>\nistream& operator>>(istream& is, pair<T1, T2>& p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate <typename T>\nistream& operator>>(istream& is, vector<T>& v) {\n for (T& in : v) is >> in;\n return is;\n}\n\ntemplate <typename T = ll>\nvector<T> make_v(size_t a) {\n return vector<T>(a);\n}\n\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}\n\ntemplate <typename T, typename V>\ntypename enable_if<is_class<T>::value == 0>::type fill_v(T& t, const V& v) {\n t = v;\n}\n\ntemplate <typename T, typename V>\ntypename enable_if<is_class<T>::value != 0>::type fill_v(T& t, const V& v) {\n for (auto& e : t) fill_v(e, v);\n}\n\ntemplate <class T>\ninline void remove_one(vector<T>& data, T x) {\n data.erase(find(data.begin(), data.end(), x));\n}\n\ntemplate <typename T>\nstruct Edge {\n int from, to;\n T cost;\n int idx;\n\n Edge() = default;\n\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\n\n operator int() const { return to; }\n};\n\ntemplate <typename T = int>\nstruct Graph {\n vector<vector<Edge<T>>> g;\n int es;\n\n Graph() = default;\n\n explicit Graph(int n) : g(n), es(0) {}\n\n size_t size() const { return g.size(); }\n\n void add_directed_edge(int from, int to, T cost = 1) { g[from].emplace_back(from, to, cost, es++); }\n\n void add_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es);\n g[to].emplace_back(to, from, cost, es++);\n }\n\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\n for (int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n a += padding;\n b += padding;\n T c = T(1);\n if (weighted) cin >> c;\n if (directed)\n add_directed_edge(a, b, c);\n else\n add_edge(a, b, c);\n }\n }\n\n inline vector<Edge<T>>& operator[](const int& k) { return g[k]; }\n\n inline const vector<Edge<T>>& operator[](const int& k) const { return g[k]; }\n};\n\ntemplate <typename T = int>\nusing Edges = vector<Edge<T>>;\n\n\ntemplate <typename T>\nstruct MinimumSteinerTree {\n using pi = pair<int, int>;\n\n const T infty = numeric_limits<T>::max();\n\n vector<vector<T> > dp;\n T cost;\n\n MinimumSteinerTree() = default;\n\n explicit MinimumSteinerTree(const Graph<T> &g, const vector<int> &terminal)\n : g(g),\n terminal(terminal),\n dp(1 << terminal.size(), vector<T>(g.size(), infty)),\n pre(1 << terminal.size(), vector<pi>(g.size(), pi(-1, -1))) {\n assert(not terminal.empty());\n const int n = (int)g.size(), t = (int)terminal.size();\n for (int i = 0; i < t; i++) {\n assert(0 <= terminal[i] and terminal[i] < n);\n dp[1 << i][terminal[i]] = 0;\n }\n using qt = pair<T, int>;\n priority_queue<qt, vector<qt>, greater<> > que;\n for (int i = 1; i < (1 << t); i++) {\n for (int j = 0; j < n; j++) {\n for (int k = i; k > 0; k = (k - 1) & i) {\n if (dp[k][j] != infty and dp[i ^ k][j] != infty) {\n T nxt = dp[k][j] + dp[i ^ k][j];\n if (nxt < dp[i][j]) {\n dp[i][j] = nxt;\n pre[i][j] = {k, -1};\n }\n }\n }\n }\n for (int j = 0; j < n; j++) {\n if (dp[i][j] != infty) {\n que.emplace(dp[i][j], j);\n }\n }\n while (not que.empty()) {\n auto [now, v] = que.top();\n que.pop();\n if (dp[i][v] < now) continue;\n for (int j = 0; j < (int)g[v].size(); j++) {\n const auto &e = g[v][j];\n if (now + e.cost < dp[i][e.to]) {\n dp[i][e.to] = now + e.cost;\n pre[i][e.to] = {v, j};\n que.emplace(dp[i][e.to], e.to);\n }\n }\n }\n }\n cost = dp[(1 << t) - 1][terminal[0]];\n }\n\n Edges<T> restore() const {\n const int t = (int)terminal.size();\n assert(dp[(1 << t) - 1][terminal[0]] != infty);\n Edges<T> tree;\n vector<pair<int, int> > st;\n st.emplace_back((1 << t) - 1, terminal[0]);\n while (not st.empty()) {\n auto [x, y] = st.back();\n st.pop_back();\n if (pre[x][y].second == -1) {\n if (pre[x][y].first != -1) {\n st.emplace_back(pre[x][y].first, y);\n st.emplace_back(x ^ pre[x][y].first, y);\n }\n } else {\n tree.emplace_back(g[pre[x][y].first][pre[x][y].second]);\n st.emplace_back(x, pre[x][y].first);\n }\n }\n return tree;\n }\n\n private:\n const Graph<T> &g;\n const vector<int> &terminal;\n vector<vector<pi> > pre;\n};\n\n\nint main() {\n int H, W;\n while (cin >> H >> W, H) {\n Graph<int> g(H * W);\n vector<int> terminal;\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n int t;\n cin >> t;\n if (i > 0) { g.add_edge(i * W + j, i * W + j - W, 1); }\n if (j > 0) { g.add_edge(i * W + j, i * W + j - 1, 1); }\n if (t == 1) { terminal.emplace_back(i * W + j); }\n }\n }\n cout << H * W - MinimumSteinerTree(g, terminal).cost - 1 << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3512,
"score_of_the_acc": -0.9714,
"final_rank": 11
},
{
"submission_id": "aoj_1040_9505528",
"code_snippet": "#include<bits/stdc++.h>\n#if __has_include(<atcoder/all>)\n#include<atcoder/all>\n#endif\n\nusing namespace std;\nusing int64 = long long;\n\nconst int64 infll = (1LL << 62) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\ntemplate<typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate<typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate<typename T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for (int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate<typename T>\nistream &operator>>(istream &is, vector<T> &v) {\n for (T &in : v) is >> in;\n return is;\n}\n\ntemplate<typename T1, typename T2>\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate<typename T1, typename T2>\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate<typename T = int64>\nvector<T> make_v(size_t a) {\n return vector<T>(a);\n}\n\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}\n\ntemplate<typename T, typename V>\ntypename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate<typename T, typename V>\ntypename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {\n for (auto &e : t) fill_v(e, v);\n}\n\ntemplate<typename F>\nstruct FixPoint : F {\n explicit FixPoint(F &&f) : F(std::forward<F>(f)) {}\n\n template<typename... Args>\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\ntemplate<typename F>\ninline decltype(auto) MFP(F &&f) {\n return FixPoint<F>{std::forward<F>(f)};\n}\n\n#line 2 \"graph/graph-template.hpp\"\n\ntemplate<typename T = int>\nstruct Edge {\n int from, to;\n T cost;\n int idx;\n\n Edge() = default;\n\n Edge(int from, int to, T cost = 1, int idx = -1)\n : from(from), to(to), cost(cost), idx(idx) {}\n\n operator int() const { return to; }\n};\n\ntemplate<typename T = int>\nstruct Graph {\n vector<vector<Edge<T> > > g;\n int es;\n\n Graph() = default;\n\n explicit Graph(int n) : g(n), es(0) {}\n\n size_t size() const { return g.size(); }\n\n void add_directed_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es++);\n }\n\n void add_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es);\n g[to].emplace_back(to, from, cost, es++);\n }\n\n void read(int M, int padding = -1, bool weighted = false,\n bool directed = false) {\n for (int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n a += padding;\n b += padding;\n T c = T(1);\n if (weighted) cin >> c;\n if (directed)\n add_directed_edge(a, b, c);\n else\n add_edge(a, b, c);\n }\n }\n\n inline vector<Edge<T> > &operator[](const int &k) { return g[k]; }\n\n inline const vector<Edge<T> > &operator[](const int &k) const { return g[k]; }\n};\n\ntemplate<typename T = int>\nusing Edges = vector<Edge<T> >;\n\ntemplate<typename T>\nstruct MinimumSteinerTree {\n using pi = pair<int, int>;\n\n const T infty = numeric_limits<T>::max();\n\n vector<vector<T> > dp;\n T cost;\n\n MinimumSteinerTree() = default;\n\n explicit MinimumSteinerTree(const Graph<T> &g, const vector<int> &terminal)\n : g(g),\n terminal(terminal),\n dp(1 << terminal.size(), vector<T>(g.size(), infty)),\n pre(1 << terminal.size(), vector<pi>(g.size(), pi(-1, -1))) {\n assert(not terminal.empty());\n const int n = (int) g.size(), t = (int) terminal.size();\n for (int i = 0; i < t; i++) {\n assert(0 <= terminal[i] and terminal[i] < n);\n dp[1 << i][terminal[i]] = 0;\n }\n using qt = pair<T, int>;\n priority_queue<qt, vector<qt>, greater<> > que;\n for (int i = 1; i < (1 << t); i++) {\n for (int j = 0; j < n; j++) {\n for (int k = i; k > 0; k = (k - 1) & i) {\n if (dp[k][j] != infty and dp[i ^ k][j] != infty) {\n T nxt = dp[k][j] + dp[i ^ k][j];\n if (nxt < dp[i][j]) {\n dp[i][j] = nxt;\n pre[i][j] = {k, -1};\n }\n }\n }\n }\n for (int j = 0; j < n; j++) {\n if (dp[i][j] != infty) {\n que.emplace(dp[i][j], j);\n }\n }\n while (not que.empty()) {\n auto [now, v] = que.top();\n que.pop();\n if (dp[i][v] < now) continue;\n for (int j = 0; j < (int) g[v].size(); j++) {\n const auto &e = g[v][j];\n if (now + e.cost < dp[i][e.to]) {\n dp[i][e.to] = now + e.cost;\n pre[i][e.to] = {v, j};\n que.emplace(dp[i][e.to], e.to);\n }\n }\n }\n }\n cost = dp[(1 << t) - 1][terminal[0]];\n }\n\n Edges<T> restore() const {\n const int t = (int) terminal.size();\n assert(dp[(1 << t) - 1][terminal[0]] != infty);\n Edges<T> tree;\n vector<pair<int, int> > st;\n st.emplace_back((1 << t) - 1, terminal[0]);\n while (not st.empty()) {\n auto [x, y] = st.back();\n st.pop_back();\n if (pre[x][y].second == -1) {\n if (pre[x][y].first != -1) {\n st.emplace_back(pre[x][y].first, y);\n st.emplace_back(x ^ pre[x][y].first, y);\n }\n } else {\n tree.emplace_back(g[pre[x][y].first][pre[x][y].second]);\n st.emplace_back(x, pre[x][y].first);\n }\n }\n return tree;\n }\n\n private:\n const Graph<T> &g;\n const vector<int> &terminal;\n vector<vector<pi> > pre;\n};\n\nint main() {\n int H, W;\n while(cin >> H >> W, H) {\n Graph< int > g(H * W);\n vector< int > terminal;\n for(int i = 0; i < H; i++) {\n for(int j = 0; j < W; j++) {\n int t;\n cin >> t;\n if(i > 0) {\n g.add_edge(i * W + j, i * W + j - W, 1);\n }\n if(j > 0) {\n g.add_edge(i * W + j, i * W + j - 1, 1);\n }\n if(t == 1) {\n terminal.emplace_back(i * W + j);\n }\n }\n }\n cout << H * W - MinimumSteinerTree(g, terminal).cost - 1 << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3560,
"score_of_the_acc": -0.9928,
"final_rank": 16
},
{
"submission_id": "aoj_1040_6756151",
"code_snippet": "#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1040\"\n\n// #include \"../../graph/edge.cpp\"\n// #include \"../../graph/minimum_steiner_tree.hpp\"\n\n#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename T>\nstruct Edge {\n int from, to;\n T weight;\n Edge() = default;\n Edge(int to, T weight) : from(-1), to(to), weight(weight) {}\n Edge(int from, int to, T weight) : from(from), to(to), weight(weight) {}\n};\n\ntemplate <typename T>\nT minimum_steiner_tree(std::vector<std::vector<Edge<T>>>& G, std::vector<int>& terminals) {\n const int n = G.size();\n const int t = terminals.size();\n constexpr T INF = std::numeric_limits<T>::max() / 2;\n using P = std::pair<T, int>;\n\n std::vector<std::vector<T>> dp(1 << t, std::vector<T>(n, INF));\n for (int i = 0; i < t; ++i) dp[1 << i][terminals[i]] = 0;\n\n for (int S = 1; S < (1 << t); ++S) {\n for (int i = 0; i < n; ++i) {\n for (int U = S; U > 0; U = (U - 1) & S) {\n dp[S][i] = std::min(dp[S][i], dp[S ^ U][i] + dp[U][i]);\n }\n }\n if (S == (1 << t) - 1) continue;\n std::priority_queue<P, std::vector<P>, std::greater<>> pq;\n for (int i = 0; i < n; ++i) {\n pq.emplace(dp[S][i], i);\n }\n while (!pq.empty()) {\n auto [d, v] = pq.top();\n pq.pop();\n if (dp[S][v] < d) continue;\n for (auto& e : G[v]) {\n if (dp[S][e.to] > d + e.weight) {\n dp[S][e.to] = d + e.weight;\n pq.emplace(dp[S][e.to], e.to);\n }\n }\n }\n }\n\n return dp.back()[terminals[0]];\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (true) {\n int H, W;\n cin >> H >> W;\n if (H == 0) break;\n vector<vector<Edge<int>>> G(H*W);\n vector<int> terminals;\n for (int i = 0; i < H; ++i) {\n for (int j = 0; j < W; ++j) {\n int s;\n cin >> s;\n if (s) terminals.push_back(i*W+j);\n if (i < H-1) {\n G[i*W+j].push_back({(i+1)*W+j, 1});\n G[(i+1)*W+j].push_back({i*W+j, 1});\n }\n if (j < W-1) {\n G[i*W+j].push_back({i*W+j+1, 1});\n G[i*W+j+1].push_back({i*W+j, 1});\n }\n }\n }\n cout << H*W - minimum_steiner_tree(G, terminals) - 1 << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3432,
"score_of_the_acc": -0.9356,
"final_rank": 7
},
{
"submission_id": "aoj_1040_4325955",
"code_snippet": "#include <algorithm>\n#include <cassert>\n#include <iomanip>\n#include <queue>\n#include <iostream>\n#include <vector>\n\n#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)\n#define DEBUGP(val) cerr << #val << \"=\" << val << \"\\n\"\n\nusing namespace std;\ntypedef long long int ll;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef pair<int, int> PI;\n\n\nconst int inf = 1e9;\n// Dreyfus-Wagner. O(4^k)\n// https://kopricky.github.io/code/Academic/steiner_tree.html\nint steiner_tree(const vector<vector<PI> > &g, const VI &term) {\n int n = g.size();\n int k = term.size();\n vector<vector<int> > dp(n, vector<int>(1 << k, inf));\n // base case: |bits| = 1\n REP(i, 0, k) {\n dp[term[i]][1 << i] = 0;\n }\n REP(bits, 1, 1 << k) {\n REP(i, 0, n) {\n REP(sub, 1, bits) {\n if ((sub & bits) != sub) continue;\n dp[i][bits] = min(dp[i][bits], dp[i][sub] + dp[i][bits - sub]);\n }\n }\n priority_queue<PI, vector<PI>, greater<PI> > que;\n REP(i, 0, n) {\n if (dp[i][bits] < inf) {\n que.push(PI(dp[i][bits], i));\n dp[i][bits] = inf;\n }\n }\n while (not que.empty()) {\n PI dv = que.top(); que.pop();\n int d = dv.first;\n int v = dv.second;\n if (dp[v][bits] <= d) continue;\n dp[v][bits] = d;\n REP(j, 0, g[v].size()) {\n PI wc = g[v][j];\n int w = wc.first;\n int c = wc.second;\n que.push(PI(d + c, w));\n }\n }\n }\n int mi = inf;\n REP(i, 0, n) {\n mi = min(mi, dp[i][(1 << k) - 1]);\n }\n return mi; \n}\n\nint main(void) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int h, w;\n while(cin >> h >> w && h && w) {\n vector<VI> s(h, VI(w));\n REP(i, 0, h) {\n REP(j, 0, w) {\n cin >> s[i][j];\n }\n }\n vector<vector<PI> > g(h * w);\n int dx[4] = {1, 0, -1, 0};\n int dy[4] = {0, 1, 0, -1};\n VI term;\n REP(i, 0, h) {\n REP(j, 0, w) {\n int v = i * w + j;\n if (s[i][j] == 1) term.push_back(v);\n REP(d, 0, 4) {\n int nx = i + dx[d];\n int ny = j + dy[d];\n if (nx < 0 || nx >= h || ny < 0 || ny >= w) continue;\n int u = nx * w + ny;\n g[v].push_back(PI(u, 1));\n }\n }\n }\n cout << h * w - 1 - steiner_tree(g, term) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3184,
"score_of_the_acc": -0.9423,
"final_rank": 8
},
{
"submission_id": "aoj_1040_4325841",
"code_snippet": "#include <algorithm>\n#include <cassert>\n#include <iomanip>\n#include <iostream>\n#include <vector>\n\n#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)\n#define DEBUGP(val) cerr << #val << \"=\" << val << \"\\n\"\n\nusing namespace std;\ntypedef long long int ll;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef pair<int, int> PI;\n\n\nconst int inf = 1e9;\n// Dreyfus-Wagner. O(4^k)\nint steiner_tree(const vector<vector<PI> > &g, const VI &term) {\n int n = g.size();\n int k = term.size();\n vector<vector<int> > dist(n, vector<int>(n, inf));\n REP(i, 0, n) {\n REP(j, 0, g[i].size()) {\n PI wc = g[i][j];\n int w = wc.first, c = wc.second;\n dist[i][w] = min(dist[i][w], c);\n }\n }\n REP(i, 0, n) dist[i][i] = 0;\n REP(l, 0, n) {\n REP(i, 0, n) {\n REP(j, 0, n) {\n dist[i][j] = min(dist[i][j], dist[i][l] + dist[l][j]);\n }\n }\n }\n vector<vector<int> > dp(n, vector<int>(1 << k, inf));\n // base case: |bits| = 1\n REP(i, 0, k) {\n REP(j, 0, n) {\n dp[j][1 << i] = min(dp[j][1 << i], dist[term[i]][j]);\n }\n }\n REP(bits, 1, 1 << k) {\n // if popcount(bits) == 1 then skip\n if ((bits & -bits) == bits) continue;\n REP(i, 0, n) {\n REP(sub, 1, bits) {\n if ((sub & bits) != sub) continue;\n dp[i][bits] = min(dp[i][bits], dp[i][sub] + dp[i][bits - sub]);\n }\n }\n REP(i, 0, n) {\n REP(j, 0, n) {\n dp[i][bits] = min(dp[i][bits], dp[j][bits] + dist[i][j]);\n }\n }\n }\n int mi = inf;\n REP(i, 0, n) {\n mi = min(mi, dp[i][(1 << k) - 1]);\n }\n return mi; \n}\n\nint main(void) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int h, w;\n while(cin >> h >> w && h && w) {\n vector<VI> s(h, VI(w));\n REP(i, 0, h) {\n REP(j, 0, w) {\n cin >> s[i][j];\n }\n }\n vector<vector<PI> > g(h * w);\n int dx[4] = {1, 0, -1, 0};\n int dy[4] = {0, 1, 0, -1};\n VI term;\n REP(i, 0, h) {\n REP(j, 0, w) {\n int v = i * w + j;\n if (s[i][j] == 1) term.push_back(v);\n REP(d, 0, 4) {\n int nx = i + dx[d];\n int ny = j + dy[d];\n if (nx < 0 || nx >= h || ny < 0 || ny >= h) continue;\n int u = nx * w + ny;\n g[v].push_back(PI(u, 1));\n g[u].push_back(PI(v, 1));\n }\n }\n }\n cout << h * w - 1 - steiner_tree(g, term) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3272,
"score_of_the_acc": -0.9817,
"final_rank": 13
},
{
"submission_id": "aoj_1040_3856494",
"code_snippet": "// includes\n#include <bits/stdc++.h>\nusing namespace std;\n\n// macros\n#define pb emplace_back\n#define mk make_pair\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\n#define rep(i, n) FOR(i, 0, n)\n#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)\n#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)\n#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)\n#define all(x) (x).begin(),(x).end()\n#define sz(x) ((int)(x).size())\n#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())\n#define bit(n) (1LL<<(n))\n// functions\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(a > b){a = b; return 1;} return 0;}\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << \" \";} return os;}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \" \";} return os;}\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \" \";} return os;}\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \" \";} return os;}\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \" \";} return os;}\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << \" \" << p.second; return os;}\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << \":\" << itr->second; auto titr = itr; if(++titr != mp.end())os << \" \"; } return os;}\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << \":\" << itr->second; auto titr = itr; if(++titr != mp.end())os << \" \"; } return os;}\n// types\nusing ll = long long int;\nusing P = pair<int, int>;\n// constants\nconst int inf = 1e9;\nconst ll linf = 1LL << 50;\nconst double EPS = 1e-10;\nconst int mod = 1000000007;\nconst int dx[4] = {-1, 0, 1, 0};\nconst int dy[4] = {0, -1, 0, 1};\n// io\nstruct fast_io{\n fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}\n} fast_io_;\n\ntemplate <typename T>\nstruct Graph {\n int n;\n vector<vector<T> > d;\n vector<vector<int> > path;\n Graph(int n): n(n) {\n d = vector<vector<T>>(n, vector<T>(n, numeric_limits<T>::max() / 10));\n path = vector<vector<int>>(n, vector<int>(n, -1));\n for(int i = 0; i < n; i++)d[i][i] = 0;\n }\n void 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 if(d[i][j] > d[i][k] + d[k][j]){\n d[i][j] = d[i][k] + d[k][j];\n path[i][j] = k;\n }\n }\n }\n }\n }\n void adde(int at, int to, T cost){\n d[at][to] = cost;\n }\n vector<T>& operator[](size_t i){\n return d[i];\n }\n};\n\nusing GraphI = Graph<int>;\nusing GraphL = Graph<ll>;\n\ntemplate <typename T>\nstruct SteinerTree{\n int n;\n vector<vector<T>> d;\n T inf = numeric_limits<T>::max() / 10;\n explicit SteinerTree(int n): n(n){\n d.resize(n, vector<T>(n, inf));\n for(int i = 0; i < n; i++)d[i][i] = 0;\n }\n void adde(int from, int to, T cost){\n d[from][to] = min(d[from][to], cost);\n }\n T steiner_tree(const vector<int> &v){\n if(v.size() == 1)return 0;\n // warshall floyd\n Graph<T> g(n);\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n if(i != j && d[i][j] != inf)g.adde(i, j, d[i][j]);\n }\n }\n g.warshall_floyd();\n\n int t = v.size();\n vector<vector<T>> opt(1 << t, vector<T>(n, inf));\n for(int i = 0; i < t; i++){\n for(int j = 0; j < n; j++){\n opt[1 << i][j] = g.d[v[i]][j];\n }\n }\n\n for(int s = 0; s < (1 << t); s++){\n if(!(s & (s - 1)))continue;\n for(int p = 0; p < n; p++){\n for(int u = s; ; u = (u - 1) & s){\n opt[s][p] = min(opt[s][p], opt[u][p] + opt[s - u][p]);\n if(u == 0)break;\n }\n }\n for(int p = 0; p < n; p++){\n for(int q = 0; q < n; q++){\n opt[s][p] = min(opt[s][p], opt[s][q] + g.d[p][q]);\n }\n }\n }\n T res = inf;\n for(int s = 0; s < (1 << t); s++){\n for(int p = 0; p < n; p++){\n res = min(res, opt[s][p] + opt[(1<<t)-1-s][p]);\n }\n }\n return res;\n }\n};\n\nint c[12][12];\n\nint main(int argc, char const* argv[])\n{\n int h, w;\n while(true){\n cin >> h >> w;\n if(h == 0 && w == 0)break;\n SteinerTree<int> st(h * w);\n vector<int> v;\n rep(i, h){\n rep(j, w){\n cin >> c[i][j];\n if(c[i][j] == 1)v.pb(i * w + j);\n }\n }\n rep(i, h){\n rep(j, w){\n rep(k, 4){\n int nx = i + dx[k];\n int ny = j + dy[k];\n if(nx >= 0 && nx < h && ny >= 0 && ny < w){\n st.adde(i * w + j, nx * w + ny, 1);\n }\n }\n }\n }\n int res = h * w - st.steiner_tree(v) - 1;\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3280,
"score_of_the_acc": -0.9853,
"final_rank": 14
},
{
"submission_id": "aoj_1040_3230871",
"code_snippet": "#include \"bits/stdc++.h\"\n\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\n\nnamespace shniter {\n\tusing Value=int;\n\tusing Edge=pair<int,Value>;\n\tusing Graph=vector<vector<Edge>>;\n\tconst Value inf = 1<<20;\n\n\tvector<vector<Value>>w_h(const Graph&g) {\n\t\tvector<vector<Value>>asps(g.size(),vector<Value>(g.size(),1e9));\n\t\tfor (int i = 0; i < g.size(); ++i) {\n\t\t\tfor (auto e : g[i]) {\n\t\t\t\tasps[i][e.first]=e.second;\n\t\t\t}\n\t\t\tasps[i][i]=0;\n\t\t}\n\n\t\tfor (int k = 0; k < g.size(); ++k) {\n\t\t\tfor (int i = 0; i < g.size(); ++i) {\n\t\t\t\tfor (int j = 0; j < g.size(); ++j) {\n\t\t\t\t\tasps[i][j]=min(asps[i][k]+asps[k][j],asps[i][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn asps;\n\t}\n\n\t//最小シュナイター木\n\tValue solve(const Graph&g, const vector<int>shs) {\n\t\t//全点対最短経路(APSP : all pair shortest paths)\n\t\tauto asps = w_h(g);\n\t\tvector<vector<Value>>OPT(1 << shs.size(), vector<Value>(g.size(), inf));\n\n\n\t\tfor (int p = 0; p < shs.size(); ++p) // trivial case\n\t\t\tfor (int q = 0; q < g.size(); ++q){\n\t\t\t\tOPT[1 << p][q] = asps[shs[p]][q];\n\t\t\t\tOPT[0][q] = 0;\n\t\t\t}\n\n\n\t\tfor (int k = 1; k < (1 << shs.size()); ++k) {\n\t\t\tfor (int root = 0; root < g.size(); ++root) {\n\t\t\t\tif(!(k&(k-1)))continue;\n\n\t\t\t\tfor (int e = 0; e < k; ++e) {\n\t\t\t\t\tif ((e | k) == k) {\n\t\t\t\t\t\tOPT[k][root] = min(OPT[k][root], OPT[e][root] + OPT[e^k][root]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\n\t\t\tfor (int p = 0; p < g.size(); ++p) {\n\t\t\t\tfor (int q = 0; q < g.size(); ++q) {\n\t\t\t\t\tOPT[k][p] = min(OPT[k][p],\n\t\t\t\t\t\tOPT[k][q] + asps[p][q]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tValue ans = inf;\n\t\tfor (int S = 0; S < (1 << shs.size()); ++S)\n\t\t\tfor (int q = 0; q < g.size(); ++q)\n\t\t\t\tans = min(ans, OPT[S][q] + OPT[((1 <<shs.size())-1 - S)][q]);\n\n\t\treturn ans;\n\t}\n}\nint H,W;\nint get_id(int x, int y) {\n\tif(x<0||W<=x||y<0||y>=H)return -1;\n\telse return y*W+x;\n}\n\nint main() {\n\twhile (true) {\n\t\tcin>>H>>W;\n\t\tif(!H)break;\n\t\tvector<vector<int>>field(H,vector<int>(W));\n\t\tvector<int>storoberry_ids;\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tcin>>field[i][j];\n\t\t\t\tif (field[i][j]) {\n\t\t\t\t\tstoroberry_ids.push_back(get_id(j,i));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tusing namespace shniter;\n\t\tGraph g(H*W);\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 way = 0; way < 4; ++way) {\n\t\t\t\t\tint dx[] = { -1,0,1,0 };\n\t\t\t\t\tint dy[] = { 0,1,0,-1 };\n\t\t\t\t\tint nx=x+dx[way];\n\t\t\t\t\tint ny=y+dy[way];\n\t\t\t\t\tint nid=get_id(nx,ny);\n\t\t\t\t\tint id=get_id(x,y);\n\t\t\t\t\tif (nid != -1) {\n\t\t\t\t\t\tg[id].push_back(Edge(nid,1));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tValue answer=solve(g,storoberry_ids);\n\t\tcout<<H*W-(answer+1)<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3212,
"score_of_the_acc": -0.9549,
"final_rank": 10
},
{
"submission_id": "aoj_1040_2698621",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i,a,n) for(int i=a;i<n;i++)\n#define mat vector<vector<int> >\nstruct Minimum_Steiner_Tree{\n\tmat V;\n\tvector<int>T;\n\tint n,numT,Inf=1e8;\n\tMinimum_Steiner_Tree(int sz):n(sz),numT(0),V(sz,vector<int>(sz)){\n\t\tREP(i,0,sz)REP(j,0,sz)V[i][j]=(i==j?0:Inf);\n\t}\n\tvoid add_edge(int a,int b,int c){ V[a][b]=V[b][a]=c; }\n\tvoid add_vertex(int a){ T.push_back(a); numT++;}\n\tint build(){\n\t\tif(numT<=1)return 0;\n\t\tmat d(V);\n\t\tREP(k,0,n)REP(i,0,n)REP(j,0,n)d[i][j]=min( d[i][j], d[i][k] + d[k][j] );\n\t\tint OPT[(1<<numT)][n];\n\t\tREP(i,0,(1<<numT))REP(j,0,n)OPT[i][j]=Inf;\n\t\tREP(i,0,numT)REP(j,0,n)OPT[1<<i][j]=d[T[i]][j];\n\t\tREP(S,1,(1<<numT))if(S&(S-1)){\n\t\t\tREP(i,0,n)REP(j,0,S)if((S|j)==S) OPT[S][i] = min( OPT[S][i], OPT[j][i] + OPT[S-j][i] );\n\t\t\tREP(i,0,n)REP(j,0,n) OPT[S][i] = min( OPT[S][i], OPT[S][j] + d[i][j] );\n\t\t}\n\t\tint ans=Inf;\n\t\tREP(i,0,(1<<numT))REP(j,0,n)ans = min(ans, OPT[i][j] + OPT[((1 << numT)-1)-i][j]);\n\t\treturn n-ans-1;\n\t}\n};\nint dx[]={1,-1,0,0};\nint dy[]={0,0,1,-1};\nint main(){\n\tint h,w,t;\n\twhile(cin>>h>>w,h){\n\t\tMinimum_Steiner_Tree M(h*w);\n\t\tREP(i,0,h)REP(j,0,w){\n\t\t\tcin>>t;\n\t\t\tif(t)M.add_vertex(i*w+j);\n\t\t\tREP(k,0,4){\n\t\t\t\tint y=i+dy[k];\n\t\t\t\tint x=j+dx[k];\n\t\t\t\tif(y<0||x<0||y>=h||x>=w)continue;\n\t\t\t\tM.add_edge(i*w+j,y*w+x,1);\n\t\t\t}\n\t\t}\n\t\tcout<<M.build()<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3328,
"score_of_the_acc": -1.1244,
"final_rank": 19
},
{
"submission_id": "aoj_1040_2043566",
"code_snippet": "#include <bits/stdc++.h>\n\n#define _overload(_1,_2,_3,name,...) name\n#define _rep(i,n) _range(i,0,n)\n#define _range(i,a,b) for(int i=int(a);i<int(b);++i)\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\n\nusing namespace std;\n\ntemplate<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}\ntemplate<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}\n\nusing G=vector<vector<int>>;\n\nint Dreyfus_wagner(const G &graph,const auto &term){\n\tusing W=int; W inf=1<<28;\n\tconst int n=int(graph.size()),t=int(term.size());\n\tif(t<=1) return 0;\n\tauto dist=graph;\n\tvector<vector<W>> opt(1<<t,vector<W>(n,inf));\n\n\trep(k,n)rep(i,n)rep(j,n) chmin(dist[i][j],dist[i][k]+dist[k][j]);\n\t\n\tmap<int,int> dict;\n\trep(i,t){\n\t\tdict[term[i]]=1<<i;\n\t\trep(j,n) opt[1<<i][j]=dist[term[i]][j];\n\t\trep(j,t) opt[(1<<i)|(1<<j)][term[j]]=dist[term[i]][term[j]];\n\t}\n\n\tauto next_combination=[&](int s){\n\t\tint x=s&-s,y=s+x;\n\t\treturn ((s&~y)/x>>1)|y;\n };\n\n\trep(k,2,t){\n\t\tfor(int s=(1<<k)-1;s<(1<<t);s=next_combination(s)){\n\t\t\trep(i,n){\n\t\t\t\tint ns=s|dict[i];\n\t\t\t\tif(dict[i] and s==ns) continue;\n\t\t\t\tfor(int u=(s-1)&s;u!=0;u=(u-1)&s){\n\t\t\t\t\tint c=s&(~u);\n\t\t\t\t\tchmin(opt[ns][i],opt[u][i]+opt[c][i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int s=(1<<k)-1;s<(1<<t);s=next_combination(s)){\n\t\t\trep(i,n){\n\t\t\t\tint ns=s|dict[i];\n\t\t\t\tif(dict[i] and s==ns) continue;\n\t\t\t\trep(j,n) chmin(opt[ns][i],opt[s][j]+dist[j][i]);\n\t\t\t}\n\t\t}\n\t}\n\n\tconst int mask=(1<<t)-1;\n\tW ans=opt[mask][0];\n\trep(i,n) chmin(ans,opt[mask][i]);\n\treturn ans;\n}\n\nint main(void){\n\tint h,w;\n\twhile(cin >> h >> w){\n\t\tif(h==0) break;\n\t\tconst int inf=1<<28;\n\n\t\tG graph(h*w,vector<int>(h*w,inf));\n\t\trep(i,h*w) graph[i][i]=0;\n\t\tvector<int> term;\n\n\t\trep(i,h*w){\n\t\t\tint in;\n\t\t\tcin >> in;\n\t\t\tif(in) term.push_back(i);\n\t\t}\n\t\t\n\t\trep(i,h)rep(j,w){\n\t\t\tconst int cur=w*i+j;\n\t\t\tif(i+1<h) graph[cur][cur+w]=graph[cur+w][cur]=1;\n\t\t\tif(j+1<w) graph[cur][cur+1]=graph[cur+1][cur]=1;\n\t\t}\n\t\tint res=Dreyfus_wagner(graph,term);\n\t\tcout << h*w-1-res << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3260,
"score_of_the_acc": -1.0351,
"final_rank": 18
},
{
"submission_id": "aoj_1040_2043565",
"code_snippet": "#include <bits/stdc++.h>\n\n#define _overload(_1,_2,_3,name,...) name\n#define _rep(i,n) _range(i,0,n)\n#define _range(i,a,b) for(int i=int(a);i<int(b);++i)\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\n\n#define _rrep(i,n) _rrange(i,n,0)\n#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)\n#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)\n\n#define _all(arg) begin(arg),end(arg)\n#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))\n#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)\n#define clr(a,b) memset((a),(b),sizeof(a))\n#define bit(n) (1LL<<(n))\n#define popcount(n) (__builtin_popcountll(n))\n\nusing namespace std;\n\ntemplate<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}\ntemplate<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}\n\nusing ll=long long;\nusing R=long double;\nconst R EPS=1e-9; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7\ninline int sgn(const R& r){return(r > EPS)-(r < -EPS);}\ninline R sq(R x){return sqrt(max<R>(x,0.0));}\n\nconst int dx[8]={1,0,-1,0,1,-1,-1,1};\nconst int dy[8]={0,1,0,-1,1,1,-1,-1};\n\n// Problem Specific Parameter:\n\nusing G=vector<vector<int>>;\n\nint Dreyfus_wagner(const G &graph,const auto &term){\n\tusing W=int; W inf=1<<28;\n\tconst int n=int(graph.size()),t=int(term.size());\n\tif(t<=1) return 0;\n\tauto dist=graph;\n\tvector<vector<W>> opt(1<<t,vector<W>(n,inf));\n\n\trep(k,n)rep(i,n)rep(j,n) chmin(dist[i][j],dist[i][k]+dist[k][j]);\n\t\n\tmap<int,int> dict;\n\trep(i,t){\n\t\tdict[term[i]]=1<<i;\n\t\trep(j,n) opt[1<<i][j]=dist[term[i]][j];\n\t\trep(j,t) opt[(1<<i)|(1<<j)][term[j]]=dist[term[i]][term[j]];\n\t}\n\n\tauto next_combination=[&](int s){\n\t\tint x=s&-s,y=s+x;\n\t\treturn ((s&~y)/x>>1)|y;\n };\n\n\trep(k,2,t){\n\t\tfor(int s=(1<<k)-1;s<(1<<t);s=next_combination(s)){\n\t\t\trep(i,n){\n\t\t\t\tint ns=s|dict[i];\n\t\t\t\tif(dict[i] and s==ns) continue;\n\t\t\t\tfor(int u=(s-1)&s;u!=0;u=(u-1)&s){\n\t\t\t\t\tint c=s&(~u);\n\t\t\t\t\tchmin(opt[ns][i],opt[u][i]+opt[c][i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int s=(1<<k)-1;s<(1<<t);s=next_combination(s)){\n\t\t\trep(i,n){\n\t\t\t\tint ns=s|dict[i];\n\t\t\t\tif(dict[i] and s==ns) continue;\n\t\t\t\trep(j,n) chmin(opt[ns][i],opt[s][j]+dist[j][i]);\n\t\t\t}\n\t\t}\n\t}\n\n\tconst int mask=(1<<t)-1;\n\tW ans=opt[mask][0];\n\trep(i,n) chmin(ans,opt[mask][i]);\n\treturn ans;\n}\n\nint main(void){\n\tint h,w;\n\twhile(cin >> h >> w){\n\t\tif(h==0) break;\n\t\tconst int inf=1<<28;\n\n\t\tG graph(h*w,vector<int>(h*w,inf));\n\t\trep(i,h*w) graph[i][i]=0;\n\t\tvector<int> term;\n\n\t\trep(i,h*w){\n\t\t\tint in;\n\t\t\tcin >> in;\n\t\t\tif(in) term.push_back(i);\n\t\t}\n\t\t\n\t\trep(i,h)rep(j,w){\n\t\t\tconst int cur=w*i+j;\n\t\t\tif(i+1<h) graph[cur][cur+w]=graph[cur+w][cur]=1;\n\t\t\tif(j+1<w) graph[cur][cur+1]=graph[cur+1][cur]=1;\n\t\t}\n\t\tint res=Dreyfus_wagner(graph,term);\n\t\tcout << h*w-1-res << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3260,
"score_of_the_acc": -0.9763,
"final_rank": 12
},
{
"submission_id": "aoj_1040_1936324",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\nusing namespace std;\ntypedef int Weight;\ntypedef vector<Weight> Array;\ntypedef vector<Array> Matrix;\nconst int MAX_T = 6;\nconst int MAX_N = 12 * 12;\nconst int INF = 1 << 25;\n\nWeight minimum_steiner_tree(const vector<int>& T, const Matrix& g) {\n\tconst int n = g.size();\n\tconst int numT = T.size();\n\tif (numT <= 1) return 0;\n\n\tMatrix d(g); // all-pair shortest\n\tfor (int k = 0; k < n; ++k)\n\t\tfor (int i = 0; i < n; ++i)\n\t\t\tfor (int j = 0; j < n; ++j)\n\t\t\t\td[i][j] = min(d[i][j], d[i][k] + d[k][j]);\n\n\tWeight OPT[(1 << MAX_T)][MAX_N];\n\tfor (int S = 0; S < (1 << numT); ++S)\n\t\tfor (int x = 0; x < n; ++x)\n\t\t\tOPT[S][x] = INF;\n\n\tfor (int p = 0; p < numT; ++p) // trivial case\n\t\tfor (int q = 0; q < n; ++q)\n\t\t\tOPT[1 << p][q] = d[T[p]][q];\n\n\tfor (int S = 1; S < (1 << numT); ++S) { // DP step\n\t\tif (!(S & (S - 1))) continue;\n\t\tfor (int p = 0; p < n; ++p)\n\t\t\tfor (int E = 0; E < S; ++E)\n\t\t\t\tif ((E | S) == S)\n\t\t\t\t\tOPT[S][p] = min(OPT[S][p], OPT[E][p] + OPT[S - E][p]);\n\t\tfor (int p = 0; p < n; ++p)\n\t\t\tfor (int q = 0; q < n; ++q)\n\t\t\t\tOPT[S][p] = min(OPT[S][p], OPT[S][q] + d[p][q]);\n\t}\n\tWeight ans = INF;\n\tfor (int S = 0; S < (1 << numT); ++S)\n\t\tfor (int q = 0; q < n; ++q)\n\t\t\tans = min(ans, OPT[S][q] + OPT[((1 << numT) - 1) - S][q]);\n\treturn ans;\n}\n\nint H, W;\n\nint toV(int x, int y) {\n\treturn y * W + x;\n};\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\twhile (cin >> H >> W , H) {\n\t\tvector<int> T;\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tint b;\n\t\t\t\tcin >> b;\n\t\t\t\tif (b == 1) T.push_back(toV(j, i));\n\t\t\t}\n\t\t}\n\n\t\tMatrix g(H * W, Array(H * W, INF));\n\t\tfor (int i = 0; i < H * W; i++) {\n\t\t\tg[i][i] = 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\tif (i != H - 1) {\n\t\t\t\t\tg[toV(j, i)][toV(j, i + 1)] = g[toV(j, i + 1)][toV(j, i)] = 1;\n\t\t\t\t}\n\t\t\t\tif (j != W - 1) {\n\t\t\t\t\tg[toV(j, i)][toV(j + 1, i)] = g[toV(j + 1, i)][toV(j, i)] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint res = minimum_steiner_tree(T, g);\n\t\tcout << H * W - res - 1 << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1428,
"score_of_the_acc": -0.2747,
"final_rank": 2
},
{
"submission_id": "aoj_1040_1929384",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef int weight;\ntypedef vector<int> vec;\ntypedef vector<vec> matrix;\nconst int inf = (1<<29);\nweight OPT[(1<<7)][200];\nweight minimum_steiner_tree(const vector<int>& T, const matrix &g) {\n memset( OPT,0,sizeof( OPT ) );\n const int n = g.size();\n const int numT = T.size();\n if (numT <= 1) return 0;\n\n matrix d(g); // all-pair shortest\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 d[i][j] = min( d[i][j], d[i][k] + d[k][j] );\n \n for (int S = 0; S < (1 << numT); ++S)\n for (int x = 0; x < n; ++x)\n OPT[S][x] = inf;\n\n for (int p = 0; p < numT; ++p) // trivial case\n for (int q = 0; q < n; ++q)\n OPT[1 << p][q] = d[T[p]][q];\n\n for (int S = 1; S < (1 << numT); ++S) { // DP step\n if (!(S & (S-1))) continue;\n for (int p = 0; p < n; ++p)\n for (int E = 0; E < S; ++E)\n if ((E | S) == S)\n OPT[S][p] = min( OPT[S][p], OPT[E][p] + OPT[S-E][p] );\n for (int p = 0; p < n; ++p)\n for (int q = 0; q < n; ++q)\n OPT[S][p] = min( OPT[S][p], OPT[S][q] + d[p][q] );\n }\n weight ans = inf;\n for (int S = 0; S < (1 << numT); ++S)\n for (int q = 0; q < n; ++q)\n ans = min(ans, OPT[S][q] + OPT[((1 << numT)-1)-S][q]);\n return ans;\n}\n\nint main(){\n int H,W;\n while( cin >> H >> W && (H||W) ){\n vector<int> T;\n matrix G;\n G.resize( H*W, vec( H*W, inf ) );\n int dx[]={1,0,-1,0};\n int dy[]={0,1,0,-1};\n for(int i=0;i<H;i++){\n for(int j=0;j<W;j++){\n G[ i*W + j ][ i*W + j] = 0;\n int c; cin >> c;\n if( c == 1 ) T.push_back( i*W+j );\n for(int k=0;k<4;k++){\n int nx = j + dx[k] , ny = i + dy[k];\n if( nx < 0 || ny < 0 || nx >= W || ny >= H ) continue;\n G[ i*W + j ][ ny*W + nx ] = 1;\n }\n }\n }\n cout << H*W - 1 - minimum_steiner_tree( T, G ) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3292,
"score_of_the_acc": -0.9906,
"final_rank": 15
},
{
"submission_id": "aoj_1040_1929167",
"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)\n#define watch(a) { cout << #a << \" = \" << a << endl; }\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\ntypedef vector<int> vec;\ntypedef vector<vec> matrix;\n\ntypedef int weight;\n\nweight OPT[1 << 7][12*12+10];\n\nweight minimum_steiner_tree(const vector<int>& T, const matrix &g) {\n const int n = g.size();\n const int numT = T.size();\n if (numT <= 1) return 0;\n\n matrix d(g); // all-pair shortest\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 for (int S = 0; S < (1 << numT); ++S)\n for (int x = 0; x < n; ++x)\n OPT[S][x] = inf;\n\n for (int p = 0; p < numT; ++p) // trivial case\n for (int q = 0; q < n; ++q)\n OPT[1 << p][q] = d[T[p]][q];\n\n for (int S = 1; S < (1 << numT); ++S) { // DP step\n if (!(S & (S-1))) continue;\n for (int p = 0; p < n; ++p)\n for (int E = 0; E < S; ++E)\n if ((E | S) == S)\n OPT[S][p] = min( OPT[S][p], OPT[E][p] + OPT[S-E][p] );\n for (int p = 0; p < n; ++p)\n for (int q = 0; q < n; ++q)\n OPT[S][p] = min( OPT[S][p], OPT[S][q] + d[p][q] );\n }\n weight ans = inf;\n for (int S = 0; S < (1 << numT); ++S)\n for (int q = 0; q < n; ++q)\n ans = min(ans, OPT[S][q] + OPT[((1 << numT)-1)-S][q]);\n return ans;\n}\n\nint dx[4] = {-1,0,1,0};\nint dy[4] = {0,-1,0,1};\n\ntemplate<class T> constexpr bool in_range(T y, T x, T H, T W) { return 0<=y&&y<H&&0<=x&&x<W; }\n\nint main() {\n\n for(int H, W; cin >> H >> W && (H|W);) {\n zero(OPT);\n matrix mat(H, vec(W));\n rep(i, H) rep(j, W)\n cin >> mat[i][j];\n\n vector<int> T;\n rep(i, H) rep(j, W)\n if(mat[i][j])\n T.push_back(i * W + j);\n\n matrix mat2(H*W, vec(H*W, inf));\n\n rep(i, H) {\n rep(j, W) {\n mat2[i*W+j][i*W+j] = 0;\n rep(k, 4) {\n const int ni = i + dy[k], nj = j + dx[k];\n if(in_range(ni, nj, H, W)) {\n mat2[i*W+j][ni*W+nj] /*= mat2[ni*W+nj][i*W+j]*/ = 1;\n }\n }\n }\n }\n\n// rep(i, H*W) rep(j, W) printf(\"%10d%c\", mat2[i][j], j < W-1 ? ' ' : '\\n');\n\n int ms = minimum_steiner_tree(T, mat2);\n cout << H * W - (1 + ms) << endl;\n\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3204,
"score_of_the_acc": -0.9513,
"final_rank": 9
},
{
"submission_id": "aoj_1040_1866608",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define INF (1<<29)\ntypedef vector<int> Vec;\ntypedef vector<Vec> Graph;\n\nint minimum_steiner_tree(Graph &d, Vec &heart)\n{\n int N = d.size(), T = heart.size();\n if (T <= 1) return T; \n \n int dp[1<<T][N];\n for (int i = 0; i < (1<<T); i++) {\n for (int j = 0; j < N; j++) {\n dp[i][j] = INF;\n }\n }\n\n for (int i = 0; i < T; i++) {\n for (int j = 0; j < N; j++) {\n dp[1<<i][j] = d[heart[i]][j];\n }\n }\n\n for (int i = 1; i < (1<<T); i++) {\n if (!(i & (i - 1))) continue;\n for (int j = 0; j < N; j++) {\n for (int k = 0; k < i; k++) {\n if ((i | k) == i) {\n dp[i][j] = min(dp[i][j], dp[k][j] + dp[i-k][j]);\n }\n }\n }\n for (int j = 0; j < N; j++) {\n for (int k = 0; k < N; k++) {\n dp[i][j] = min(dp[i][j], dp[i][k] + d[j][k]);\n }\n }\n }\n int res = INF;\n for (int i = 0; i < (1<<T); i++) {\n for (int j = 0; j < N; j++) {\n res = min(res, dp[i][j] + dp[((1<<T)-1)-i][j]);\n }\n }\n return res + 1;\n}\n\nint get_dist(int y1, int x1, int y2, int x2)\n{\n return abs(x1 - x2) + abs(y1 - y2);\n}\n\nint main()\n{\n int H, W, x;\n while (cin >> H >> W, H) {\n Vec heart;\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n cin >> x; \n if (x == 1) {\n heart.push_back(i * W + j);\n }\n }\n }\n\n Graph G(H*W, Vec(H*W));\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n for (int k = 0; k < H; k++) {\n for (int l = 0; l < W; l++) {\n G[i*W+j][k*W+l] = get_dist(i, j, k, l);\n }\n }\n }\n }\n cout << H*W - minimum_steiner_tree(G, heart) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3164,
"score_of_the_acc": -0.8157,
"final_rank": 6
},
{
"submission_id": "aoj_1040_1806064",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define INF (1<<29)\ntypedef vector<int> Vec;\ntypedef vector<Vec> Graph;\n\nint minimum_steiner_tree(Graph &d, Vec &heart)\n{\n int N = d.size(), T = heart.size();\n if (T <= 1) return T;\n \n int dp[1<<T][N];\n for (int i = 0; i < (1<<T); i++) {\n for (int j = 0; j < N; j++) {\n dp[i][j] = INF;\n }\n }\n\n for (int i = 0; i < T; i++) {\n for (int j = 0; j < N; j++) {\n dp[1<<i][j] = d[heart[i]][j];\n }\n }\n\n for (int i = 1; i < (1<<T); i++) {\n if (!(i & (i - 1))) continue;\n for (int j = 0; j < N; j++) {\n for (int k = 0; k < i; k++) {\n if ((i | k) == i) {\n dp[i][j] = min(dp[i][j], dp[k][j] + dp[i-k][j]);\n }\n }\n }\n for (int j = 0; j < N; j++) {\n for (int k = 0; k < N; k++) {\n dp[i][j] = min(dp[i][j], dp[i][k] + d[j][k]);\n }\n }\n }\n int res = INF;\n for (int i = 0; i < (1<<T); i++) {\n for (int j = 0; j < N; j++) {\n res = min(res, dp[i][j] + dp[((1<<T)-1)-i][j]);\n }\n }\n return res + 1;\n}\n\nint get_dist(int y1, int x1, int y2, int x2)\n{\n return abs(x1 - x2) + abs(y1 - y2);\n}\n\nint main()\n{\n int H, W, x;\n while (cin >> H >> W, H) {\n Vec heart;\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n cin >> x; \n if (x == 1) {\n heart.push_back(i * W + j);\n }\n }\n }\n\n Graph G(H*W, Vec(H*W));\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n for (int k = 0; k < H; k++) {\n for (int l = 0; l < W; l++) {\n G[i*W+j][k*W+l] = get_dist(i, j, k, l);\n }\n }\n }\n }\n cout << H*W - minimum_steiner_tree(G, heart) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1340,
"score_of_the_acc": -0.1765,
"final_rank": 1
},
{
"submission_id": "aoj_1040_1262125",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint c[15][15];\nint g[200][200];\ntypedef int weight;\nint n;\nint d[200][200];\nint ABS(int a){return max(a,-a);}\nweight minimum_steiner_tree(const vector<int>& T) {\n const int numT = T.size();\n if (numT <= 1) return 0;\nfor(int i=0;i<n;i++)for(int j=0;j<n;j++)d[i][j]=99999999;\n\nfor(int i=0;i<n;i++)for(int j=0;j<n;j++)if(g[i][j])d[i][j]=1;\nfor(int i=0;i<n;i++)d[i][i]=0;\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 weight OPT[(1 << numT)][n];\n for (int S = 0; S < (1 << numT); ++S)\n for (int x = 0; x < n; ++x)\n OPT[S][x] = 99999999;\n\n for (int p = 0; p < numT; ++p) // trivial case\n for (int q = 0; q < n; ++q)\n OPT[1 << p][q] = d[T[p]][q];\n\n for (int S = 1; S < (1 << numT); ++S) { // DP step\n if (!(S & (S-1))) continue;\n for (int p = 0; p < n; ++p)\n for (int E = 0; E < S; ++E)\n if ((E | S) == S)\n OPT[S][p] = min( OPT[S][p], OPT[E][p] + OPT[S-E][p] );\n for (int p = 0; p < n; ++p)\n for (int q = 0; q < n; ++q)\n OPT[S][p] = min( OPT[S][p], OPT[S][q] + d[p][q] );\n }\n weight ans = 99999999;\n for (int S = 0; S < (1 << numT); ++S)\n for (int q = 0; q < n; ++q)\n ans = min(ans, OPT[S][q] + OPT[((1 << numT)-1)-S][q]);\nreturn ans;\n}\nint main(){\n\tint a,b;\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++)scanf(\"%d\",&c[i][j]);\n\t\tfor(int i=0;i<200;i++)for(int j=0;j<200;j++)g[i][j]=0;\n\t\tvector<int>t;\n\t\tfor(int i=0;i<a*b;i++){\n\t\t\tif(c[i/b][i%b])t.push_back(i);\n\t\t\tfor(int j=0;j<a*b;j++){\n\t\t\t\tif(ABS(i/b-j/b)+ABS(i%b-j%b)==1)g[i][j]=1;\n\t\t\t}\n\t\t}\n\t\tn=a*b;\n\t\tint ret=minimum_steiner_tree(t);\n\t\tprintf(\"%d\\n\",a*b-ret-1);\n\t}\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1356,
"score_of_the_acc": -0.3013,
"final_rank": 3
},
{
"submission_id": "aoj_1040_1228656",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\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();}\ntemplate<class T> inline T sqr(T x) {return x*x;}\n\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef long long ll;\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 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 range(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) range(i,0,n)\n#define clr(a,b) memset((a), (b) ,sizeof(a))\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n\nconst double eps = 1e-10;\nconst double pi = acos(-1.0);\nconst ll INF =1LL << 62;\nconst int inf =1 << 29;\n\nconst int tmax=11;\nconst int vmax=150;\n\nint V,T;\nint d[vmax][vmax];\nint t[tmax];\nint p[1<<tmax][vmax];\n\n\nint minimum_steiner_tree(){\n\tif(T<=1)\n\t\treturn 0;\n\n\trep(k,vmax)rep(i,vmax)rep(j,vmax) d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\n\trep(i,1<<tmax)rep(j,vmax) p[i][j]=inf;\n\n\trep(i,T){\n\t\trep(j,V) p[1<<i][j]=d[t[i]][j];\n\t\trep(j,T) p[1<<i|1<<j][t[j]]=d[t[i]][t[j]];\n\t}\n\n\tfor(int k=2;k<T;++k){\n\t\tfor(int s=(1<<k)-1;(s<(1<<T));){\n\t\t\trep(x,V){\n\t\t\t\tint ns=s;\n\t\t\t\tint cur=-1;\n\t\t\t\trep(i,T) if(t[i]==x) cur=i;\n\t\t\t\tif(cur!=-1) ns|=(1<<cur);\n\t\t\t\tif(cur!=-1&&s==ns) continue;\n\t\t\t\tfor(int u=(s-1)&s;u!=0;u=(u-1)&s){\n\t\t\t\t\tint c=(s&(~u));\n\t\t\t\t\tp[ns][x]=min(p[ns][x],p[u][x]+p[c][x]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tint x=s&-s,y=s+x;\n\t\t\ts=((s&~y)/x>>1)|y;\n\t\t}\n\t\tfor(int s=(1<<k)-1;(s<(1<<T));){\n\t\t\trep(x,V){\n\t\t\t\tint ns=s;\n\t\t\t\tint next=-1;\n\t\t\t\trep(i,T) if(t[i]==x) next=i;\n\t\t\t\tif(next!=-1) ns|=(1<<next);\n\t\t\t\tif(next!=-1&&s==ns) continue;\n\t\t\t\trep(y,V) p[ns][x]=min(p[ns][x],p[s][y]+d[y][x]);\n\t\t\t}\n\t\t\tint x=s&-s,y=s+x;\n\t\t\ts=((s&~y)/x>>1)|y;\n\t\t}\n\t}\n\n\tconst int mask=(1<<T)-1;\n\tint ans=p[mask][0];\n\trep(i,vmax) ans=min(ans,p[mask][i]);\n\treturn ans;\n}\n\nint main(void){\n\tint h,w;\n\twhile(cin >> h >> w){\n\t\tif(h==0)\n\t\t\tbreak;\n\t\trep(i,vmax)rep(j,vmax) d[i][j]=(i==j)?0:inf;\n\t\tV=h*w,T=0;\n\n\t\trep(i,h*w){\n\t\t\tint in;\n\t\t\tcin >> in;\n\t\t\tif(in) t[T++]=i;\n\t\t}\n\t\trep(i,h)rep(j,w){\n\t\t\tint cur=w*i+j;\n\t\t\tif(i+1<h) d[cur][cur+w]=d[cur+w][cur]=1;\n\t\t\tif(j+1<w) d[cur][cur+1]=d[cur+1][cur]=1;\n\t\t}\n\t\tint res=minimum_steiner_tree();\n\t\tcout << V-1-res << endl;\n\t}\n\treturn 0;\n}\n\n\n\n// q[s|c][x]=min(q[s|c],p[s][x]+p[c][x]);\n\n// p[s][x]=min(p[s][x],p[s][y]+d[y][x]) y∊s\n// p[s][x]=min(p[s][x],q[s][y]+d[y][x]) y∊v/s",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 2448,
"score_of_the_acc": -1.4955,
"final_rank": 20
},
{
"submission_id": "aoj_1040_1172009",
"code_snippet": "#include <sstream>\n#include <string>\n#include <vector>\n#include <map>\n#include <algorithm>\n#include <iostream>\n#include <utility>\n#include <set>\n#include <cctype>\n#include <queue>\n#include <stack>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\nusing namespace std;\n#define INF 100000000\n\ntypedef long long ll;\nconst int dx[] = {1, 0, -1, 0};\nconst int dy[] = {0, 1, 0, -1};\n\nint minimum_steiner_tree(const vector<int>& T, const vector<vector<int> >& g) {\n const int n = g.size();\n const int numT = T.size();\n if (numT <= 1) return 0;\n\n vector<vector<int> > 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\n int OPT[(1<<numT)][n];\n for (int S = 0; S < (1<<numT); S++) {\n for (int x = 0; x < n; x++) {\n OPT[S][x] = INF;\n }\n }\n for (int p = 0; p < numT; p++) {\n for (int q = 0; q < n; q++) {\n OPT[1<<p][q] = d[T[p]][q];\n }\n }\n for (int S = 1; S < (1 << numT); S++) {\n if (!S & (S-1)) continue;\n for (int p = 0; p < n; p++) {\n for (int E = 0; E < S; E++) {\n if ((E|S) == S) {\n OPT[S][p] = min(OPT[S][p], OPT[E][p] + OPT[S-E][p]);\n }\n }\n }\n for (int p = 0; p < n; p++) {\n for (int q = 0; q < n; q++) {\n OPT[S][p] = min(OPT[S][p], OPT[S][q] + d[p][q]);\n }\n }\n }\n int ans = INF;\n for (int S = 0; S < (1<<numT); S++) {\n for (int q = 0; q < n; q++) {\n ans = min(ans, OPT[S][q] + OPT[(1<<numT)-1-S][q]);\n }\n }\n return ans;\n}\n\nint main(void) {\n int H, W;\n while (cin >> H >> W) {\n if (H == 0 && W == 0) break;\n vector<int> T;\n vector<vector<int> > g(H*W, vector<int>(H*W));\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n int a;\n cin >> a;\n if (a == 1) T.push_back(i*W+j);\n }\n }\n if (T.size() <= 0) {\n cout << H*W << endl;\n continue;\n }\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n for (int k = 0; k < H; k++) {\n for (int l = 0; l < W; l++) {\n g[i*W+j][k*W+l] = INF;\n }\n }\n g[i*W+j][i*W+j] = 0;\n }\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 int nx = x+dx[i];\n int ny = y+dy[i];\n if (0 <= nx && nx < W && 0 <= ny && ny < H) {\n g[y*W+x][ny*W+nx] = 1;\n }\n }\n }\n }\n// for (int i = 0; i < H*W; i++) {\n// for (int j = 0; j < H*W; j++) {\n// if (g[i][j] == INF) cout << \"inf\\t\";\n// else cout << g[i][j] << \"\\t\";\n// }\n// cout << endl;\n// }\n cout << H*W - (minimum_steiner_tree(T, g) + 1) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1416,
"score_of_the_acc": -0.3281,
"final_rank": 4
},
{
"submission_id": "aoj_1040_1171838",
"code_snippet": "#include <cassert>// c\n#include <iostream>// io\n#include <iomanip>\n#include <fstream>\n#include <sstream>\n#include <vector>// container\n#include <map>\n#include <set>\n#include <queue>\n#include <bitset>\n#include <stack>\n#include <algorithm>// other\n#include <complex>\n#include <numeric>\n#include <functional>\n#include <random>\n#include <regex>\nusing namespace std;\n\ntypedef long long ll;\n\n#define ALL(c) (begin(c)),(end(c))\n#define REP(i,n) FOR(i,0,n)\n#define REPr(i,n) FORr(i,0,n)\n#define FOR(i,l,r) for(int i=(int)(l);i<(int)(r);++i)\n#define FORr(i,l,r) for(int i=(int)(r)-1;i>=(int)(l);--i)\n#define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)\n#define IN(l,v,r) ((l)<=(v) && (v)<(r))\n#define UNIQUE(v) v.erase(unique(ALL(v)),v.end())\n//debug\n#define DUMP(x) cerr << #x << \" = \" << (x)\n#define LINE() cerr<< \" (L\" << __LINE__ << \")\"\n\nclass range {\nprivate:\n\tstruct Iter{\n\t\tint v;\n\t\tint operator*(){return v;}\n\t\tbool operator!=(Iter& itr) {return v < itr.v;}\n\t\tvoid operator++() {++v;}\n\t};\n\tIter i, n;\npublic:\n\trange(int n) : i({0}), n({n}) {}\n\trange(int i, int n) : i({i}), n({n}) {}\n\tIter& begin() {return i;}\n\tIter& end() {return n;}\n};\n\n//output\ntemplate<typename T> ostream& operator << (ostream& os, const vector<T>& as){REP(i,as.size()){if(i!=0)os<<\" \"; os<<as[i];}return os;}\ntemplate<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){REP(i,as.size()){if(i!=0)os<<endl; os<<as[i];}return os;}\ntemplate<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<\" \"; os<<a;}return os;}\ntemplate<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){os<<p.first<<\" \"<<p.second;return os;}\ntemplate<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}\ntemplate<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){os << get<0>(t);return os;}\ntemplate<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){os << get<0>(t)<<\" \"<<get<1>(t);return os;}\ntemplate<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){os << get<0>(t)<<\" \"<<get<1>(t)<<\" \"<<get<2>(t);return os;}\ntemplate<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){os << get<0>(t)<<\" \"<<get<1>(t)<<\" \"<<get<2>(t)<<\" \"<<get<3>(t);return os;}\ntemplate<typename T1,typename T2,typename T3,typename T4,typename T5> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5>& t){os << get<0>(t)<<\" \"<<get<1>(t)<<\" \"<<get<2>(t)<<\" \"<<get<3>(t)<<\" \"<<get<4>(t);return os;}\ntemplate<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6>& t){os << get<0>(t)<<\" \"<<get<1>(t)<<\" \"<<get<2>(t)<<\" \"<<get<3>(t)<<\" \"<<get<4>(t)<<\" \"<<get<5>(t);return os;}\ntemplate<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){os << get<0>(t)<<\" \"<<get<1>(t)<<\" \"<<get<2>(t)<<\" \"<<get<3>(t)<<\" \"<<get<4>(t)<<\" \"<<get<5>(t)<<\" \"<<get<6>(t);return os;}\n\n//input\nchar tmp[1000];\n#define nextInt(n) scanf(\"%d\",&n)\n#define nextLong(n) scanf(\"%lld\",&n) //I64d\n#define nextDouble(n) scanf(\"%lf\",&n) \n#define nextChar(n) scanf(\"%c\",&n)\n#define nextString(n) scanf(\"%s\",tmp);n=tmp\n\n// values\ntemplate<typename T> T INF(){assert(false);};\ntemplate<> int INF<int>(){return 1<<28;};\ntemplate<> ll INF<ll>(){return 1LL<<58;};\ntemplate<> double INF<double>(){return 1e16;};\n\ntemplate<class T> T EPS(){assert(false);};\ntemplate<> int EPS<int>(){return 1;};\ntemplate<> ll EPS<ll>(){return 1LL;};\ntemplate<> double EPS<double>(){return 1e-8;};\ntemplate<> long double EPS<long double>(){return 1e-8;};\n\ntemplate<typename T,typename U> T pfmod(T v,U M){return fmod(fmod(v,M)+M,M);}\n\nll gcd_positive(ll a,ll b) { return b == 0 ? a : gcd_positive(b,a%b); }\nll gcd(ll a,ll b) { return gcd_positive(abs(a), abs(b)); }\nll lcm(ll a,ll b){return a/gcd(a,b)*b;}\n\nnamespace EGraph{\n\ttypedef ll Cost;Cost CINF=INF<Cost>();\n\tstruct Edge{\n\t\tint from,to;Cost cost;\n\t\tEdge(int from,int to,Cost cost)\n\t\t: from(from),to(to),cost(cost) {};\n\t\tbool operator<(Edge r) const{ return cost<r.cost;}\n\t\tbool operator>(Edge r) const{ return cost>r.cost;}\n\t};\n\ttypedef vector<vector<Edge> > Graph;\n}\nusing namespace EGraph;\n\n\nint dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\n\n\n// |S| <= 31\nclass subset{\n\tprivate:\n\tstruct Iter{\n\t\tint v,bit;\n\t\tint operator*(){\n\t\t\tint res=0,vi=0;\n\t\t\tREP(bi,32)if(bit & (1<<bi)){\n\t\t\t\tif(v&(1<<vi))res+=1<<bi;\n\t\t\t\tvi++;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t\tbool operator!=(Iter& itr) {return v < itr.v;}\n\t\tvoid operator++(){++v;}\n\t};\n\tIter i, n;\n\tpublic:\n\tsubset(int bit){\n\t\ti={0,bit};n={1<<(__builtin_popcount(bit)),bit};\n\t}\n\tIter& begin() {return i;}\n\tIter& end() {return n;}\n};\n \nclass Main{\n\ttypedef ll Cost;\n\n\tCost minimum_steiner_tree(const vector<int>& ts, const vector<vector<Cost>> &g) {\n\t\tconst int n = g.size();\n\t\tif (ts.size() <= 1) return 0;\n\n\t\t// all-pair shortest\n\t\tvector<vector<Cost>> ds=g;REP(k,n)REP(i,n)REP(j,n) ds[i][j] = min(ds[i][j], ds[i][k] + ds[k][j]);\n\n\t\tvector<vector<Cost>> dp(1<<ts.size(),vector<ll>(n,INF<Cost>()));\n\t\tREP(i,ts.size())REP(q,n) dp[1 << i][q] = ds[ts[i]][q];\n\t\t\n\t\tREP(S,1<<ts.size()){\n\t\t\tREP(p,n)for(int E :subset(S)) dp[S][p]=min(dp[S][p],dp[E][p] + dp[S-E][p]);\n\t\t\tREP(p,n)REP(q,n) dp[S][p] = min(dp[S][p], dp[S][q] + ds[p][q] );\n\t\t}\n\t\tCost res =INF<Cost>();REP(q,n)res = min(res,dp[((1 << ts.size())-1)][q]);\n\t\treturn res;\n\t}\n\n\tpublic:\n\tvoid run(){\n\t\twhile(true){\n\t\t\tint H,W;cin >> H >>W;if(H==0 && W==0)break;\n\t\t\tvector<vector<int>> board(H,vector<int>(W));\n\t\t\tREP(y,H)REP(x,W)cin >> board[y][x];\n\n\t\t\tvector<vector<ll>> mat(H*W,vector<ll>(H*W,INF<ll>()));\n\t\t\tREP(i,H*W)mat[i][i]=0;\n\n\t\t\tvector<int> vs;\n\t\t\tREP(y,H)REP(x,W)if(board[y][x])vs.push_back(y*W+x);\n\t\t\t\n\t\t\tREP(y,H)REP(x,W){\n\t\t\t\tREP(d,4){\n\t\t\t\t\tint ny=y+dy[d],nx=x+dx[d];\n\t\t\t\t\tif(!IN(0,nx,W) || !IN(0,ny,H))continue;\n\t\t\t\t\tmat[y*W+x][ny*W+nx]=1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << H*W - (1+minimum_steiner_tree(vs,mat)) <<endl;\n\n\t\t}\n\t}\n};\n\nint main(){\n\tcout <<fixed<<setprecision(20);\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tMain().run();\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 1636,
"score_of_the_acc": -0.6618,
"final_rank": 5
}
] |
aoj_1045_cpp
|
Problem 05:
Split Up!
勇者ポン太とその親友同じく勇者ゴン太は、これから壮大な冒険へと出発するために、それぞれ仲間を求めてルイーダの酒場へやって来ました。酒場には、冒険に出たくてうずうずしている武闘家や僧侶、魔法使いがたくさん居ます。
心やさしいゴン太はポン太を気遣い、「先に仲間を選んでいいよ。」と言いました。
一方、ポン太もゴン太が心配でなりません。「いや、君が先に選んでいいよ。」と言い返しました。
お互い譲り合いが続き、ついにルイーダがこう提案しました。「じゃあ、ここにいる
n
人の登録者をそれぞれのパーティの合計戦闘力がなるべく均等になるように、この"パーティ分けマシン"で分けてあげるわ。」
あなたに与えられた仕事は、パーティ分けマシンに組み込まれているプログラムを作成することです。
このプログラムは
n
個の整数を入力し、それらを２つのグループ
A
,
B
に分けたときの、
A
に含まれる整数の合計値と
B
に含まれる整数の合計値の差の最小値を出力しなければなりません。
このマシンのおかげで、ポン太とゴン太は仲良く仲間を見つけ、壮大な冒険へと出かけて行きました・・。
Input
入力として複数のデータセットが与えられます。各データセットは以下の形式で与えられます：
n
(登録者の数： 整数)
a
1
a
2
...
a
n
（各登録者の戦闘力： 空白区切りの整数）
n
は 20 以下であり、各登録者の戦闘力は 100 万を越えません。
n
が 0 のとき入力の終わりとします。
Output
各データセットに対して、最小値を1行に出力して下さい。
Sample Input
5
1 2 3 4 5
4
2 3 5 7
0
Output for the Sample Input
1
1
|
[
{
"submission_id": "aoj_1045_10397112",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n/*\n 与えられた n 個の整数を 2 つのグループに分け，\n グループ A の合計とグループ B の合計の差の最小値を求める\n ブールマスク全探索による典型的な部分和分割問題の解法。\n*/\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while(true){\n int n;\n cin >> n;\n if(!cin || n == 0) break;\n\n vector<long long> a(n);\n long long S = 0;\n for(int i = 0; i < n; i++){\n cin >> a[i];\n S += a[i];\n }\n\n long long best = LLONG_MAX;\n // 全ての部分集合をビットマスクで列挙\n // A に入れる要素を 1、B に入れる要素を 0 とする\n int total = 1 << n;\n for(int mask = 0; mask < total; mask++){\n long long sumA = 0;\n // mask のビットごとに A の合計を計算\n for(int i = 0; i < n; i++){\n if(mask & (1 << i)) sumA += a[i];\n }\n long long sumB = S - sumA;\n long long diff = llabs(sumA - sumB);\n best = min(best, diff);\n }\n\n cout << best << \"\\n\";\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 480,
"memory_kb": 3344,
"score_of_the_acc": -0.8212,
"final_rank": 9
},
{
"submission_id": "aoj_1045_9073804",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath>\n#include <limits>\n\nint main() {\n int n;\n while (std::cin >> n && n != 0) {\n std::vector<int> powers(n);\n for (int i = 0; i < n; ++i) {\n std::cin >> powers[i];\n }\n\n int minDiff = std::numeric_limits<int>::max();\n\n // 全ての可能な分割を試す\n for (int mask = 0; mask < (1 << n); ++mask) {\n int groupA = 0, groupB = 0;\n\n // 各ビットをチェックしてグループに分ける\n for (int i = 0; i < n; ++i) {\n if (mask & (1 << i)) {\n groupA += powers[i];\n } else {\n groupB += powers[i];\n }\n }\n\n // 2つのグループの合計値の差を計算し、最小値を更新\n int diff = std::abs(groupA - groupB);\n minDiff = std::min(minDiff, diff);\n }\n\n std::cout << minDiff << std::endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 3316,
"score_of_the_acc": -0.9383,
"final_rank": 16
},
{
"submission_id": "aoj_1045_8832315",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#ifdef DEBUG_\n#include <compe/debug.hpp>\n#else\n#define dump(...)\n#endif\n\n#define FastIO cin.tie(nullptr), ios_base::sync_with_stdio(false);\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n#define output(msg) cout << (msg) << '\\n'\n#define die(msg) \\\n do { \\\n cout << msg << endl; \\\n exit(0); \\\n } while (0)\n#define all(k) k.begin(), k.end()\n#define INFi 1 << 30\n#define INFll 1LL << 60\n\ntemplate <typename T> bool chmax(T& a, const T& b) {\n return ((a < b) ? (a = b, true) : (false));\n}\ntemplate <typename T> bool chmin(T& a, const T& b) {\n return ((a > b) ? (a = b, true) : false);\n}\n\nusing llint = long long int;\n\nvoid solve(int n) {\n vector<llint> ai(n);\n rep(i, n) cin >> ai[i];\n\n llint ans{INFll};\n for (int bit = 0; bit < (1 << n); ++bit) {\n llint left{}, right{};\n rep(i, n) {\n if (bit & (1 << i)) {\n left += ai[i];\n } else {\n right += ai[i];\n }\n }\n chmin(ans, abs(left - right));\n }\n output(ans);\n}\n\nint main() {\n FastIO;\n int n;\n while (cin >> n) {\n if (n == 0) break;\n solve(n);\n }\n}",
"accuracy": 1,
"time_ms": 570,
"memory_kb": 3212,
"score_of_the_acc": -0.9594,
"final_rank": 17
},
{
"submission_id": "aoj_1045_7948398",
"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> a(n);\n int sum = 0;\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n sum += a[i];\n }\n int res = sum;\n for (int i = 0; i < (1<<n); i++) {\n int s = 0;\n for (int j = 0; j < n; j++) {\n if ((1<<j) & i) {\n s += a[j];\n }\n }\n res = min(res, abs(sum-s-s));\n }\n cout << res << endl;\n }\n}",
"accuracy": 1,
"time_ms": 470,
"memory_kb": 3216,
"score_of_the_acc": -0.7875,
"final_rank": 6
},
{
"submission_id": "aoj_1045_7026700",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nconst int INF = 10000000;\n\nint n;\nvector<int> v;\n\nint ans = INF;\n\nvoid calc(int i, int s, int t)\n{\n\tif (i == n)\n\t{\n\t\tans = min(ans, abs(s - t));\n\t\treturn;\n\t}\n\tcalc(i + 1, s + v[i], t);\n\tcalc(i + 1, s, t + v[i]);\n}\n\nint main()\n{\n\tint s = 0, t = 0;\n\twhile (cin >> n && n > 0)\n\t{\n\t\tv = vector<int>(n, 0);\n\t\tans = INF;\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tcin >> v[i];\n\t\t}\n\t\tcalc(0, 0, 0);\n\t\tcout << ans << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3424,
"score_of_the_acc": -0.0557,
"final_rank": 2
},
{
"submission_id": "aoj_1045_6985228",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n;\n while(cin >> n, n){\n vector<int> a(n);\n int v, ans = 1 << 30, s = 0;\n for(int i = 0; i < n; i++){\n cin >> a[i];\n s += a[i];\n }\n for(int i = 0; i < (1 << n); i++){\n v = 0;\n for(int j = 0; j < n; j++){\n if(i >> j & 1)v += a[j];\n }\n ans = min(ans, abs(2 * v - s));\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 470,
"memory_kb": 3428,
"score_of_the_acc": -0.8148,
"final_rank": 8
},
{
"submission_id": "aoj_1045_6899708",
"code_snippet": "#include <bits/stdc++.h>\n#define FastIO cin.tie(nullptr), ios_base::sync_with_stdio(false);\n#define REP(i, start, end) for (int i = start; i < (int)(end); i++)\n#define rep(i, n) REP(i, 0, n)\nusing namespace std;\n\nvoid solve(int n) {\n vector<long long int> score(n);\n for (auto &s : score) cin >> s;\n\n long long int diff = LLONG_MAX;\n\n for (int bit = 0; bit < (1 << n); bit++) {\n long long int a = 0, b = 0;\n\n for (int i = 0; i < n; i++) {\n if (bit & (1 << i)) {\n a += score[i];\n } else {\n b += score[i];\n }\n }\n diff = min(diff, abs(a - b));\n }\n cout << diff << '\\n';\n}\n\nint main() {\n FastIO;\n\n int t;\n while (cin >> t) {\n if (t == 0) break;\n solve(t);\n }\n}",
"accuracy": 1,
"time_ms": 570,
"memory_kb": 3444,
"score_of_the_acc": -0.9893,
"final_rank": 18
},
{
"submission_id": "aoj_1045_6648124",
"code_snippet": "#line 1 \"library/template/template.hpp\"\n//#pragma GCC target(\"avx\")\n//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n#include<bits/stdc++.h>\n#define overload4(a,b,c,d,e,...) e\n#define overload3(a,b,c,d,...) d\n#define rep1(a) for(ll i=0;i<(ll)(a);i++)\n#define rep2(i,a) for(ll i=0;i<(ll)(a);i++)\n#define rep3(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep4(i,a,b,c) for(ll i=(ll)(a);i<(ll)(b);i+=(ll)(c))\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep1(a) for(ll i=(ll)(a)-1;i>=0;i--)\n#define rrep2(i,a) for(ll i=(ll)(a)-1;i>=0;i--)\n#define rrep3(i,a,b) for(ll i=(ll)(b)-1;i>=(ll)(a);i--)\n#define rrep(...) overload3(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__)\n#define fore(...) for (auto&& __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 rall(n) (n).rbegin(),(n).rend()\n#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)\n#define pb push_back\n#define eb emplace_back\n#define END(...) {print(__VA_ARGS__);return;}\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing ld=long double;\nusing vl=vector<ll>;\nusing vi=vector<int>;\nusing vs=vector<string>;\nusing vc=vector<char>;\nusing vvl=vector<vl>;\nusing pi=pair<int,int>;\nusing pl=pair<ll,ll>;\nusing vvc=vector<vc>;\nusing vd=vector<double>;\nusing vp=vector<pl>;\nusing vb=vector<bool>;\nconst int dx[8]={1,0,-1,0,1,-1,-1,1};\nconst int dy[8]={0,1,0,-1,1,1,-1,-1};\nconst ll MOD=1000000007;\nconst ll mod=998244353;\nconst ld EPS=1e-8;\nconst ld PI=3.1415926535897932384626;\ntemplate<typename T,typename U>\nostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<\" \"<<p.second;return os;}\ntemplate<typename T,typename U>\nistream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}\ntemplate<typename T>\nostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?\" \":\"\");}return os;}\ntemplate<typename T>\nistream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}\nvoid scan(){}\ntemplate<class Head,class... Tail>\nvoid scan(Head&head,Tail&... tail){cin>>head;scan(tail...);}\ntemplate<class T>\nvoid print(const T &t){cout<<t<<'\\n';}\ntemplate<class Head, class... Tail>\nvoid print(const Head &head, const Tail &... tail){cout<<head<<' ';print(tail...);}\ntemplate<class... T>\nvoid fin(const T &... a){print(a...);exit(0);}\ntemplate<typename T,typename U>\ninline bool chmax(T&a,U b){return a<b&&(a=b,true);}\ntemplate<typename T,typename U>\ninline bool chmin(T&a,U b){return a>b&&(a=b,true);}\ntemplate<typename T>\nclass infinity{\n public:\n static const T MAX=numeric_limits<T>::max();\n static const T MIN=numeric_limits<T>::min();\n static const T value=numeric_limits<T>::max()/2;\n static const T mvalue=numeric_limits<T>::min()/2;\n};\n#if __cplusplus <= 201402L\ntemplate<class T>const T infinity<T>::value;\ntemplate<class T>const T infinity<T>::mvalue;\ntemplate<class T>const T infinity<T>::MAX;\ntemplate<class T>const T infinity<T>::MIN;\n#endif\ntemplate<typename T>const T INF=infinity<T>::value;\nconst long long inf=INF<ll>;\ninline int popcnt(ull x){\n#if __cplusplus>=202002L\nreturn popcount(x);\n#endif\nx=(x&0x5555555555555555)+((x>>1)&0x5555555555555555);x=(x&0x3333333333333333)+((x>>2)&0x3333333333333333);x=(x&0x0f0f0f0f0f0f0f0f)+((x>>4)&0x0f0f0f0f0f0f0f0f);x=(x&0x00ff00ff00ff00ff)+((x>>8)&0x00ff00ff00ff00ff);x=(x&0x0000ffff0000ffff)+((x>>16)&0x0000ffff0000ffff);return (x&0x00000000ffffffff)+((x>>32)&0x00000000ffffffff);\n}\ntemplate<typename T,typename=void>\nstruct is_specialize:false_type{};\ntemplate<typename T>\nstruct is_specialize<T,typename conditional<false,typename T::iterator, void>::type>:true_type{};\ntemplate<typename T>\nstruct is_specialize<T,typename conditional<false,decltype(T::first),void>::type>:true_type{};\ntemplate<typename T>\nstruct is_specialize<T,enable_if_t<is_integral<T>::value,void>>:true_type{};\nvoid dump(const char&t){cerr<<t;}\nvoid dump(const string&t){cerr<<t;}\nvoid dump(const bool&t){cerr<<(t?\"true\":\"false\");}\ntemplate <typename T,enable_if_t<!is_specialize<T>::value,nullptr_t> =nullptr>\nvoid dump(const T&t){cerr<<t;}\ntemplate<typename T>\nvoid dump(const T&t,enable_if_t<is_integral<T>::value>* =nullptr){string tmp;if(t==infinity<T>::value||t==infinity<T>::MAX)tmp=\"inf\";if(t==infinity<T>::mvalue||t==infinity<T>::MIN)tmp=\"-inf\";if(tmp.empty())tmp=to_string(t);cerr<<tmp;}\ntemplate <typename T>\nvoid dump(const T&t,enable_if_t<!is_void<typename T::iterator>::value>* =nullptr){cerr<<\"{\";for(auto it=t.begin();it!=t.end();){dump(*it);cerr<<(++it==t.end()?\"\":\",\");}cerr<<\"}\";}\ntemplate<typename T,typename U>\nvoid dump(const pair<T,U>&t){cerr<<\"(\";dump(t.first);cerr<<\",\";dump(t.second);cerr<<\")\";}\nvoid trace(){cerr<<endl;}\ntemplate<typename Head,typename... Tail>\nvoid trace(Head&&head,Tail&&... tail){dump(head);if(sizeof...(tail))cerr<<\",\";trace(forward<Tail>(tail)...);}\n#ifdef ONLINE_JUDGE\n#define debug(...) (void(0))\n#else\n#define debug(...) do{cerr<<#__VA_ARGS__<<\"=\";trace(__VA_ARGS__);}while(0)\n#endif\nstruct IOSetup{IOSetup(){cin.tie(nullptr);ios::sync_with_stdio(false);cout.tie(0);cout<<fixed<<setprecision(12);cerr<<fixed<<setprecision(12);}};\n/**\n * @brief Template(テンプレート)\n*/\n#line 2 \"code.cpp\"\nvoid solve(){\n LL(n);\n if(!n)exit(0);\n vl a(n);\n cin>>a;\n bitset<20000001>bit;\n bit[0]=1;\n rep(i,n)bit|=(bit<<a[i]);\n ll sum=accumulate(all(a),0LL);\n ll aim=sum/2;\n while(bit[aim]==0){\n aim--;\n }\n print((sum-aim*2));\n}\nint main(){\n while(true)solve();\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 10748,
"score_of_the_acc": -1.3448,
"final_rank": 20
},
{
"submission_id": "aoj_1045_6285220",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(A) A.begin(),A.end()\nusing vll = vector<ll>;\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\n\n\nint main() {\n while(1){\n ll N;\n cin>>N;\n if(N==0)return 0;\n vll A(N);\n rep(i,N)cin>>A[i];\n ll an=1e18;\n rep(bit,(1<<N)){\n ll S=0,D=0;\n rep(i,N){\n if(bit&(1<<i))S+=A[i];\n else S-=A[i];\n }\n an=min(an,abs(S));\n }\n cout<<an<<endl;\n }\n \n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 3340,
"score_of_the_acc": -0.4069,
"final_rank": 3
},
{
"submission_id": "aoj_1045_5825563",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\n//イテレーション\n#define REP(i, n) for (ll i = 0; i < ll(n); i++)\n#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)\n#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)\n#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)\n#define FORA(i, I) for (const auto& i : I)\n// x:コンテナ\n#define ALL(x) x.begin(), x.end()\n#define SIZE(x) ll(x.size())\n//定数\n#define INF32 2147483647 // 2.147483647×10^{9}:32bit整数のinf\n#define INF64 9223372036854775807 // 9.223372036854775807×10^{18}:64bit整数のinf\n#define MOD 1000000007 //問題による\n//略記\n#define F first\n#define S second\n//出力(空白区切りで昇順に)\n#define coutALL(x) \\\n for (auto i = x.begin(); i != --x.end(); i++) cout << *i << \" \"; \\\n cout << *--x.end() << endl;\n\n// aをbで割る時の繰上げ,繰り下げ\nll myceil(ll a, ll b) { return (a + (b - 1)) / b; }\nll myfloor(ll a, ll b) { return a / b; }\n\nll search(ll n, vector<ll> as, ll l, ll asum, ll bsum) {\n if(l == n) {\n return abs(asum-bsum);\n } \n ll tmp1 = search(n,as,l+1,asum+as[l],bsum); \n ll tmp2 = search(n,as,l+1,asum,bsum+as[l]);\n return min(tmp1, tmp2);\n}\n\nint main() {\n //小数の桁数の出力指定\n // cout<<fixed<<setprecision(10);\n //入力の高速化用のコード\n // ios::sync_with_stdio(false);\n // cin.tie(nullptr);\n ll n;\n cin >> n;\n while(n != 0) {\n vector<ll> as(n, 0);\n REP(i, n) {\n cin >> as[i];\n }\n ll ans = search(n,as,0,0,0);\n cout << ans << endl;\n cin >> n;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 410,
"memory_kb": 3144,
"score_of_the_acc": -0.6748,
"final_rank": 4
},
{
"submission_id": "aoj_1045_5825556",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nconst int inf = 1e9 + 7;\n\nint main(void) {\n int n;\n while(true){\n cin >> n;\n if(n == 0) return 0;\n\n int a[n];\n for(int i = 0; i < n; i++) cin >> a[i];\n int sum = 0;\n for(int i = 0; i < n; i++) sum += a[i];\n\n int mini = inf;\n int max_bit = pow(2,n);\n\n for (int bit = 0; bit < max_bit; ++bit) {\n int A = 0;\n for(int i = 0; i < n; i++)\n if((bit & (1 << i))) A+= a[i];\n\n mini = min(mini, abs(A - (sum - A)));\n }\n cout << mini << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 540,
"memory_kb": 3280,
"score_of_the_acc": -0.9164,
"final_rank": 13
},
{
"submission_id": "aoj_1045_5825516",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nint main(){\n int N;\n while(true){\n cin >> N;\n if(N == 0)break;\n vector<int>v(N);\n Int ans = 1e9;\n for(auto& e : v) cin >> e;\n Int bit = (1LL << N);\n for(int i = 0; i <= bit; ++i){\n Int p = 0, g = 0;\n for(int j = 0; j < N; ++j){\n (((1LL << j) & i) > 0 ? p : g) += v[j];\n \n }\n ans = min(ans,abs(p - g));\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 540,
"memory_kb": 3372,
"score_of_the_acc": -0.9283,
"final_rank": 15
},
{
"submission_id": "aoj_1045_5825514",
"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\n\n\nsigned main(){\n int n;\n while(cin>>n){\n if(n==0)break;\n vector<int> v(n);\n int sum = 0;\n rep(i,0,n){\n cin>>v[i];\n sum += v[i];\n }\n int ans = 1e9;\n for(int i=0;i<(1<<n);i++){\n int s = 0;\n for(int j=0;j<n;j++){\n if(i>>j & 1)s += v[j];\n }\n // cout<<s<<endl;\n ans = min(ans, abs(s-(sum-s)));\n\n }\n cout<<ans<<endl;\n\n \n }\n}\n/*\n\n*/",
"accuracy": 1,
"time_ms": 610,
"memory_kb": 3324,
"score_of_the_acc": -1.0428,
"final_rank": 19
},
{
"submission_id": "aoj_1045_5825504",
"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 add(int a, T x){\n for(int i=a; i<(int)node.size(); i += i & -i) node[i] += x;\n }\n\n /* [1, a] */\n T sum(int a){\n T res = 0;\n for(int x=a; x>0; x -= x & -x) res += node[x];\n return res;\n }\n\n /* [l, r] */\n T rangesum(int l, int r){\n return sum(r) - sum(l-1);\n }\n\n /* \n a1+a2+...+aw >= valとなるような最小のwを返す\n @verify https://codeforces.com/contest/992/problem/E\n */\n int lower_bound(T val) {\n if(val < 0) return 0;\n\n int res = 0;\n int n = 1; \n while (n < N) n *= 2;\n\n T tv=0;\n for (int k = n; k > 0; k /= 2) {\n if(res + k < N && node[res + k] < val){\n val -= node[res+k];\n res += k;\n }\n }\n return res+1; \n }\n};\nstruct UnionFind{\n std::vector<int> par;\n std::vector<int> siz;\n\n UnionFind(int sz_): par(sz_), siz(sz_) {\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n void init(int sz_){\n par.resize(sz_);\n siz.resize(sz_);\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n int root(int x){\n if(x == par[x]) return x;\n return par[x] = root(par[x]);\n }\n\n bool merge(int x, int y){\n x = root(x), y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) std::swap(x, y);\n siz[x] += siz[y];\n par[y] = x;\n return true;\n }\n\n bool issame(int x, int y){\n return root(x) == root(y);\n }\n\n int size(int x){\n return siz[root(x)];\n }\n};\nstruct RollingHash {\n 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};\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 vector<int> a(n);\n REP(i,n) cin >> a[i];\n int ans = 1e9;\n int t = accumulate(all(a), 0);\n REP(bit, (1<<n)) {\n int sum = 0;\n REP(j,n) if(bit >> j & 1) sum += a[j];\n\n ans = min(ans, abs((t-sum)-sum));\n }\n cout << ans << '\\n';\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 470,
"memory_kb": 3328,
"score_of_the_acc": -0.8019,
"final_rank": 7
},
{
"submission_id": "aoj_1045_5619086",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long Long;\n\nint main() {\n while (true) {\n int n;\n cin >> n;\n if (n == 0) break;\n vector<Long> a(n);\n for (int i = 0; i < n; ++i) {\n cin >> a[i];\n }\n Long cp = accumulate(a.begin(), a.end(), 0LL);\n Long diff = 1000001 * 20;\n\n for (int i = 0; i < (1 << n); ++i) {\n Long p = 0;\n for (int j = 0; j < n; ++j) {\n if (i & (1 << j)) {\n p += a[j];\n }\n }\n diff = min(diff, abs(cp - p - p));\n }\n cout << diff << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 530,
"memory_kb": 3000,
"score_of_the_acc": -0.8631,
"final_rank": 10
},
{
"submission_id": "aoj_1045_5201471",
"code_snippet": "#include <iostream>\n#include <vector>\n#include<iomanip>\n#include<functional>\n#include<algorithm>\n#include<deque>\n#include<set>\n#include<queue>\n#include<map>\nusing namespace std;\n#define rep(i,n) for(int i = 0;i<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(a) a.begin(),a.end()\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; }\ntypedef long long ll;\ntypedef double d;\ntypedef pair<int, int> P;\nconst int inf = 1 << 30;\nint main() {\n\tint n; vector<int> A;\n\twhile (cin >> n, n) {\n\t\tint n2 = n / 2,num=0;\n\t\tvector<int> a(n);\n\t\trep(i, n) cin >> a[i],num += a[i];\n\t\tint ans = num;\n\t\trep(bit, 1 << n) {\n\t\t\tint sum = 0;\n\t\t\trep(i, n) if (bit & (1 << i)) sum += a[i];\n\t\t\tchmin(ans, abs(sum - num + sum));\n\t\t}cout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 530,
"memory_kb": 3084,
"score_of_the_acc": -0.8739,
"final_rank": 11
},
{
"submission_id": "aoj_1045_4876549",
"code_snippet": "#include <bits/stdc++.h>\n#ifdef _DEBUG\n#include \"debug.hpp\"\n#else\n#define debug(...)\n#endif\n#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))\n#define precise(i) fixed << setprecision(i)\n#define rep(z, n) for (int z = 0; z < (int)(n); z++)\n#define llint long long int\nusing namespace std;\n\nint main() {\n fastIO;\n int tt;\n\n while (cin >> tt) {\n if (tt == 0) break;\n\n vector<int> A(tt);\n for (auto &a : A) cin >> a;\n\n llint diff = LLONG_MAX;\n for (int bit = 0; bit < (1 << tt); bit++) {\n llint a = 0, b = 0;\n\n for (int i = 0; i < tt; i++) {\n if (bit & (1 << i)) {\n a += A[i];\n } else {\n b += A[i];\n }\n }\n diff = min(diff, abs(a - b));\n }\n cout << diff << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 540,
"memory_kb": 3324,
"score_of_the_acc": -0.9221,
"final_rank": 14
},
{
"submission_id": "aoj_1045_4799792",
"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<int> a(n);\n for (int i = 0; i < n; i++) cin >> a.at(i);\n int ans = 1e9;\n for (int bit = 0; bit < (1 << n); bit++) {\n int x = 0, y = 0;\n for (int i = 0; i < n; i++) {\n if (bit & (1 << i)) x += a.at(i);\n else y += a.at(i);\n }\n ans = min(ans, abs(x - y));\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 480,
"memory_kb": 3024,
"score_of_the_acc": -0.78,
"final_rank": 5
},
{
"submission_id": "aoj_1045_4189307",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <climits>\n#include <cmath>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n\tint n;\n\twhile (cin >> n, n) {\n\t\tvector<int> a(n);\n\t\tfor (int& i : a) cin >> i;\n\t\tint ans = INT_MAX, b = pow(2.0, n);\n\t\tfor (int i = 0; i < b; i++) {\n\t\t\tbitset<20> c = i;\n\t\t\tint d = 0;\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (c[j]) d += a[j];\n\t\t\t\telse d -= a[j];\n\t\t\t}\n\t\t\tans = min(abs(d), ans);\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 520,
"memory_kb": 3260,
"score_of_the_acc": -0.8794,
"final_rank": 12
},
{
"submission_id": "aoj_1045_4156874",
"code_snippet": "#include <iostream>\n#include <cmath>\nusing namespace std;\n#define rep(i, n) for(int (i) = 0; (i) < (n); i++)\n\nint n; //登録者数\nint w[30]; //各登録者の戦闘力\n\nint dfs(int A, int B, int m){//AはグループAの総力、BはグループBの総力、mは登録者の順番\n int a, b;\n if(m >= n) return abs(A - B); \n a = dfs(A + w[m], B, m + 1);\n b = dfs(A, B + w[m], m + 1); \n return min(a, b);\n}\n\nint main(void){\n while(true){\n cin >> n;\n if(n == 0) break;\n rep(i, n) cin >> w[i];\n\n cout << dfs(0, 0, 0) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 2992,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_1046_cpp
|
Problem 06:
Ghost Buster!
一般人には知る由も無いことだが、この街は幽霊で溢れている。そのほとんどは無害なのだが、困ったことに、人を呪う悪霊も少なからずいるのだ。
あるところに、そんな悪霊と戦う少女がいた。彼女は昼間は何食わぬ顔で高校に通いながらも、夜になると街中を歩き回り、彷徨える魂を見付けては成仏させるのだ。
幽霊を成仏させるためにはまずその幽霊に接近する必要があるのだが、それは簡単なことではない。幽霊は物をすり抜けられるからだ。幽霊は民家に壁から侵入して勝手口から出て行ったり、信号の無い大通りを悠々と横断したりする。人間である彼女にはそんなことはできないので、幽霊を追跡するのはとても難しいのだ。
彼女は経験上、幽霊が規則的な動きをすることを知っていた。そこで彼女は、この情報を活用して幽霊を追跡することを考えた。
彼女のいる街は、(
H
×
W
)マスのグリッドとして表される。彼女も幽霊も、1分間に1回、次の5つの行動
東へ1マス進む
西へ1マス進む
南へ1マス進む
北へ1マス進む
その場に留まる
のうちどれか1つを行うことができる。ただし、彼女は街の周囲に結界を張ったので、彼女も幽霊も街の外に出ることはできない。また、そのような行動をしようとした場合、代わりにその場に留まる。
それぞれのマスは '
#
' または '
.
' という文字によって表され、前者は幽霊だけが進入できるマスを、後者は両者が進入できるマスを表す。
幽霊の行動パターンは、L個の行動の列として与えられる。幽霊はこれらの行動を最初から順番に実行していき、全ての行動を実行し終わるとまた最初の行動に戻り、順に実行し続ける。
彼女と幽霊が N 分後に同じマスにいたならば、彼女と幽霊は時刻 N で遭遇したと言うことが出来る。幽霊は放っておくとどんな被害をもたらすか分からないので、彼女は出来るだけ早い時刻に幽霊を捕まえたい。なので、彼女は頼れる先輩であるあなたに、彼女と幽霊が遭遇できる最も早い時刻とその遭遇場所を求めるプログラムを書いてほしいと思っている。
さあ、彼女を助けて、彼女のありがたい言葉で彷徨える魂を極楽浄土へと導くのだ！
Input
複数のデータセットが与えられる。
各データセットの形式を以下に示す。
H W
（グリッドの南北方向のマスの数、グリッドの東西方向のマスの数： 空白区切りの２つの整数）
H × W
の文字 （マスの種類：'
.
', '
#
', '
A
', または '
B
'）
pattern
（幽霊の行動パタン：文字列）
'
A
' は少女の初期位置、'
B
' は幽霊の初期位置を示す。両者の初期位置は、 '
.
' のマスの上にある。
pattern
は '
5
', '
2
', '
4
', '
6
', '
8
' から成る文字列で、各文字の意味は以下の通りである：
'
5
'
その場に留まる
'
8
'
北に1マス進む
'
6
'
東に1マス進む
'
4
'
西に1マス進む
'
2
'
南に1マス進む
例えば、
pattern
が "
8544
" の場合、幽霊は「北に1マス進む」「その場に留まる」「西に1マス進む」「西に1マス進む」の行動パタンを繰り返す。
H
,
W
は 1 以上 20 以下であり、
pattern
の長さは 10 以下である。
H
,
W
がともに 0 のとき、入力は終了する。
Output
もし少女が幽霊と遭遇できるならば、最も早い遭遇時刻と、その遭遇場所の南北方向の座標、東西方向の座標を空白で区切って1行に出力せよ。グリッドの最北西を座標(0, 0)とし、最南東を座標(
H
-1,
W
-1) とする。
どのように行動しても絶対に遭遇できない場合は、 "
impossible
" と出力せよ。
Sample Input
4 7
A#...#B
.#.#.#.
.#.#.#.
...#...
5
4 7
A#...#B
.#.#.#.
.#.#.#.
...#...
2
4 7
A#...#B
.#.#.#.
.#.#.#.
...#...
4
4 7
A#...#B
.#.#.#.
.#.#.#.
...#...
442668
1 10
A#.......B
55555554
1 10
A#.......B
55555555
0 0
Output for the Sample Input
18 0 6
15 3 6
6 0 0
14 0 4
72 0 0
impossible
|
[
{
"submission_id": "aoj_1046_9523805",
"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 dp[20][20][20][20][10];\nint dx[] = {-1, 0, 0, 1, 0};\nint dy[] = {0, 1, -1, 0, 0};\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 vector<string> s(h);\n pair<int, int> S, T;\n for (int i = 0; i < h; ++i) {\n cin >> s[i];\n for (int j = 0; j < w; ++j) {\n if (s[i][j] == 'A') {\n S = {i, j};\n s[i][j] = '.';\n }\n if (s[i][j] == 'B') {\n T = {i, j};\n s[i][j] = '.';\n }\n }\n }\n string op;\n cin >> op;\n int m = op.size();\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n for (int k = 0; k < h; ++k) {\n for (int l = 0; l < w; ++l) {\n for (int n = 0; n < m; ++n) {\n dp[i][j][k][l][n] = 1e9;\n }\n }\n }\n }\n }\n using P = pair<int, int>;\n queue<pair<pair<P, P>, int>> q;\n dp[S.first][S.second][T.first][T.second][0] = 0;\n q.push({{S, T}, 0});\n auto mv = [&](P pos, int dx, int dy, bool b) -> P {\n auto [x, y] = pos;\n x += dx, y += dy;\n if (0 <= x and x < h and 0 <= y and y < w and (s[x][y] == '.' or b)) {\n return {x, y};\n } else {\n return {x - dx, y - dy};\n }\n };\n while (q.size()) {\n auto p = q.front();\n q.pop();\n auto a = p.first.first;\n auto b = p.first.second;\n int j = p.second;\n int cost = dp[a.first][a.second][b.first][b.second][j];\n int nj = (j + 1 == m ? 0 : j + 1);\n int k;\n if (op[j] == '5') k = 4;\n else k = (8 - (op[j] - '0')) / 2;\n for (int i = 0; i < 5; ++i) {\n auto na = mv(a, dx[i], dy[i], false);\n auto nb = mv(b, dx[k], dy[k], true);\n if (dp[na.first][na.second][nb.first][nb.second][nj] > cost + 1) {\n dp[na.first][na.second][nb.first][nb.second][nj] = cost + 1;\n q.push({{na, nb}, nj});\n }\n }\n }\n int res = 1e9;\n P pos;\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n for (int k = 0; k < m; ++k) {\n if (res > dp[i][j][i][j][k]) {\n res = dp[i][j][i][j][k];\n pos = {i, j};\n }\n }\n }\n }\n if (res == 1e9) cout << \"impossible\\n\";\n else cout << res << \" \" << pos.first << \" \" << pos.second << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 9652,
"score_of_the_acc": -0.5017,
"final_rank": 14
},
{
"submission_id": "aoj_1046_5827263",
"code_snippet": "// 幅優先全ルート探索\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing Pos = pair<int, int>;\nusing VI = vector<int>;\nusing Deq = deque<pair<Pos, int>>;\n\n// 幽霊の次の位置を返す\nint NextB(int pos, char d, int h, int w) {\n switch (d) {\n case '8':\n if (pos / w - 1 >= 0) pos -= w;\n break;\n case '4':\n if (pos % w - 1 >= 0) pos--;\n break;\n case '2':\n if (pos / w + 1 < h) pos += w;\n break;\n case '6':\n if (pos % w + 1 < w) pos++;\n break;\n default:\n break;\n }\n return pos;\n}\n// 少女の次の位置を返す\nint NextA(int pos, VI& grid, char d, int h, int w) {\n switch (d) {\n case '8':\n if (pos / w - 1 >= 0 && grid[pos - w] == 1) pos -= w;\n break;\n case '4':\n if (pos % w - 1 >= 0 && grid[pos - 1] == 1) pos--;\n break;\n case '2':\n if (pos / w + 1 < h && grid[pos + w] == 1) pos += w;\n break;\n case '6':\n if (pos % w + 1 < w && grid[pos + 1] == 1) pos++;\n break;\n default:\n break;\n }\n return pos;\n}\nint main() {\n while (true) {\n int h, w;\n cin >> h >> w;\n if (h == 0 && w == 0) break;\n VI grid(h * w);\n int a_pos, b_pos;\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') {\n a_pos = i * w + j;\n grid[i * w + j] = 1;\n } else if (c == 'B') {\n b_pos = i * w + j;\n grid[i * w + j] = 1;\n } else if (c == '.') {\n grid[i * w + j] = 1;\n } else if (c == '#') {\n grid[i * w + j] = 0;\n }\n }\n }\n string pattern;\n cin >> pattern;\n\n // マスの訪問時間を管理するテーブル(未訪問:-1)\n vector<vector<vector<int>>> visited(h * w,\n vector<vector<int>>(h * w, vector<int>(pattern.length(), -1)));\n char direction[] = {'5', '8', '6', '4', '2'}; // 少女の移動方向\n Deq dq;\n dq.push_back(make_pair(make_pair(a_pos, b_pos), -1));\n bool flg = true;\n while (!dq.empty()) {\n pair<Pos, int> p = dq.front();\n dq.pop_front();\n if (p.first.first == p.first.second) {\n cout << visited[p.first.first][p.first.second][p.second] << \" \"\n << p.first.first / w << \" \" << p.first.first % w << endl;\n flg = false;\n break;\n } else {\n // 幽霊の次の行動パターン\n int turn = (p.second + 1) % pattern.length();\n // 幽霊の次の位置\n b_pos = NextB(p.first.second, pattern[turn], h, w);\n // 少女の次の位置\n for (int i = 0; i < 5; ++i) {\n a_pos = NextA(p.first.first, grid, direction[i], h, w);\n if (visited[a_pos][b_pos][turn] == -1) {\n dq.push_back(make_pair(make_pair(a_pos, b_pos), turn));\n visited[a_pos][b_pos][turn] =\n visited[p.first.first][p.first.second][p.second] +\n 1;\n }\n }\n }\n }\n if (flg) cout << \"impossible\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 14516,
"score_of_the_acc": -1.5913,
"final_rank": 20
},
{
"submission_id": "aoj_1046_2458649",
"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;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000001\nusing namespace std;\n\nint H,W;\n\nint diff_row[5] = {-1,0,0,1,0},diff_col[5] = {0,-1,1,0,0};\nchar map[20][21],pattern[11];\nbool***** check;\n\nstruct Info{\n\tint my_row,my_col,my_time,enemy_row,enemy_col;\n};\n\nbool rangeCheck(int row,int col){\n\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1)return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\n\nint main(){\n\n\tbool FLG;\n\tint ans_row,ans_col,ans_time,next_my_row,next_my_col,next_enemy_row,next_enemy_col,pattern_length,tmp;\n\tcheck = new bool****[20];\n\tfor(int i = 0; i < 20; i++){\n\t\tcheck[i] = new bool***[20];\n\t\tfor(int a = 0; a < 20; a++){\n\t\t\tcheck[i][a] = new bool**[20];\n\t\t\tfor(int b = 0; b < 20; b++){\n\t\t\t\tcheck[i][a][b] = new bool*[20];\n\t\t\t\tfor(int c = 0; c < 20; c++)check[i][a][b][c] = new bool[10];\n\t\t\t}\n\t\t}\n\t}\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&H,&W);\n\t\tif(H == 0 && W == 0)break;\n\n\t\tFLG = false;\n\t\tInfo first;\n\n\t\tfirst.my_time = 0;\n\n\t\tfor(int a = 0; a < H; a++){\n\t\t\tfor(int b = 0; b < W; b++){\n\t\t\t\tfor(int c = 0; c < H; c++){\n\t\t\t\t\tfor(int d = 0; d < W; d++){\n\t\t\t\t\t\tfor(int e = 0; e < 10;e++)check[a][b][c][d][e] = false;\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 < H; i++){\n\t\t\tscanf(\"%s\",map[i]);\n\t\t\tfor(int k = 0; k < W; k++){\n\t\t\t\tswitch(map[i][k]){\n\t\t\t\tcase 'A':\n\t\t\t\t\tfirst.my_row = i;\n\t\t\t\t\tfirst.my_col = k;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'B':\n\t\t\t\t\tfirst.enemy_row = i;\n\t\t\t\t\tfirst.enemy_col = k;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:break;\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tscanf(\"%s\",pattern);\n\t\tfor(pattern_length = 0; pattern[pattern_length] != '\\0';pattern_length++);\n\n\t\tqueue<Info> Q;\n\n\t\tQ.push(first);\n\n\t\twhile(!Q.empty()){\n\n\t\t\tif(Q.front().my_row == Q.front().enemy_row && Q.front().my_col == Q.front().enemy_col){\n\t\t\t\tFLG = true;\n\t\t\t\tans_row = Q.front().my_row;\n\t\t\t\tans_col = Q.front().my_col;\n\t\t\t\tans_time = Q.front().my_time;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tQ.front().my_time++;\n\n\t\t\ttmp = (Q.front().my_time-1+pattern_length)%pattern_length;\n\t\t\tswitch(pattern[tmp]){\n\t\t\tcase '5':\n\t\t\t\tnext_enemy_row = Q.front().enemy_row;\n\t\t\t\tnext_enemy_col = Q.front().enemy_col;\n\t\t\t\tbreak;\n\t\t\tcase '2':\n\t\t\t\tif(rangeCheck(Q.front().enemy_row+1,Q.front().enemy_col)){\n\t\t\t\t\tnext_enemy_row = Q.front().enemy_row+1;\n\t\t\t\t\tnext_enemy_col = Q.front().enemy_col;\n\t\t\t\t}else{\n\t\t\t\t\tnext_enemy_row = Q.front().enemy_row;\n\t\t\t\t\tnext_enemy_col = Q.front().enemy_col;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase '4':\n\t\t\t\tif(rangeCheck(Q.front().enemy_row,Q.front().enemy_col-1)){\n\t\t\t\t\tnext_enemy_row = Q.front().enemy_row;\n\t\t\t\t\tnext_enemy_col = Q.front().enemy_col-1;\n\t\t\t\t}else{\n\t\t\t\t\tnext_enemy_row = Q.front().enemy_row;\n\t\t\t\t\tnext_enemy_col = Q.front().enemy_col;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase '6':\n\t\t\t\tif(rangeCheck(Q.front().enemy_row,Q.front().enemy_col+1)){\n\t\t\t\t\tnext_enemy_row = Q.front().enemy_row;\n\t\t\t\t\tnext_enemy_col = Q.front().enemy_col+1;\n\t\t\t\t}else{\n\t\t\t\t\tnext_enemy_row = Q.front().enemy_row;\n\t\t\t\t\tnext_enemy_col = Q.front().enemy_col;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase '8':\n\t\t\t\tif(rangeCheck(Q.front().enemy_row-1,Q.front().enemy_col)){\n\t\t\t\t\tnext_enemy_row = Q.front().enemy_row-1;\n\t\t\t\t\tnext_enemy_col = Q.front().enemy_col;\n\t\t\t\t}else{\n\t\t\t\t\tnext_enemy_row = Q.front().enemy_row;\n\t\t\t\t\tnext_enemy_col = Q.front().enemy_col;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tfor(int i = 0; i < 5; i++){\n\t\t\t\tnext_my_row = Q.front().my_row + diff_row[i];\n\t\t\t\tnext_my_col = Q.front().my_col + diff_col[i];\n\n\t\t\t\tif(rangeCheck(next_my_row,next_my_col) == true && map[next_my_row][next_my_col] != '#' &&\n\t\t\t\t\t\tcheck[next_my_row][next_my_col][next_enemy_row][next_enemy_col][tmp] == false){\n\t\t\t\t\tcheck[next_my_row][next_my_col][next_enemy_row][next_enemy_col][tmp] = true;\n\t\t\t\t\tInfo next;\n\t\t\t\t\tnext.enemy_row = next_enemy_row;\n\t\t\t\t\tnext.enemy_col = next_enemy_col;\n\t\t\t\t\tnext.my_row = next_my_row;\n\t\t\t\t\tnext.my_col = next_my_col;\n\t\t\t\t\tnext.my_time = Q.front().my_time;\n\t\t\t\t\tQ.push(next);\n\t\t\t\t}else{\n\t\t\t\t\tif(check[Q.front().my_row][Q.front().my_col][next_enemy_row][next_enemy_col][tmp] == false){\n\t\t\t\t\t\tcheck[Q.front().my_row][Q.front().my_col][next_enemy_row][next_enemy_col][tmp] = true;\n\t\t\t\t\t\tInfo next;\n\t\t\t\t\t\tnext.enemy_row = next_enemy_row;\n\t\t\t\t\t\tnext.enemy_col = next_enemy_col;\n\t\t\t\t\t\tnext.my_row = Q.front().my_row;\n\t\t\t\t\t\tnext.my_col = Q.front().my_col;\n\t\t\t\t\t\tnext.my_time = Q.front().my_time;\n\t\t\t\t\t\tQ.push(next);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\n\t\tif(!FLG){\n\t\t\tprintf(\"impossible\\n\");\n\t\t}else{\n\t\t\tprintf(\"%d %d %d\\n\",ans_time,ans_row,ans_col);\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 9188,
"score_of_the_acc": -0.474,
"final_rank": 13
},
{
"submission_id": "aoj_1046_2077072",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n\nstruct Place{ int x,y; };\nstruct State\n{\n Place h,g;\n int p;\n};\n\nconst int INF=123456789;\nint z[20][20][20][20][10];\ninline void init()\n{\n rep(a,20)rep(b,20)rep(c,20)rep(d,20)rep(e,10) z[a][b][c][d][e]=INF;\n}\n\nint dx[5]={1,-1,0,0,0}, dy[5]={0,0,1,-1,0};\n\nint main()\n{\n int h,w;\n while(cin >>h >>w,h)\n {\n vector<string> s(h);\n rep(i,h) cin >>s[i];\n\n string pattern;\n cin >>pattern;\n int P=pattern.size();\n vector<int> pat(P);\n rep(i,P)\n {\n if(pattern[i]=='6') pat[i]=0;\n else if(pattern[i]=='4') pat[i]=1;\n else if(pattern[i]=='2') pat[i]=2;\n else if(pattern[i]=='8') pat[i]=3;\n else if(pattern[i]=='5') pat[i]=4;\n }\n\n Place a,b;\n rep(i,h)rep(j,w)\n {\n if(s[i][j]=='A') a=Place{j,i};\n if(s[i][j]=='B') b=Place{j,i};\n }\n\n init();\n z[a.y][a.x][b.y][b.x][0]=0;\n queue<State> que;\n que.push(State{a,b,0});\n #define IN(x,y) (0<=x && x<w && 0<=y && y<h)\n while(!que.empty())\n {\n State now=que.front(); que.pop();\n a=now.h;\n b=now.g;\n int idx=now.p;\n int nowZ=z[a.y][a.x][b.y][b.x][idx];\n\n // ???????????????\n int nbx=b.x+dx[pat[idx]], nby=b.y+dy[pat[idx]];\n if(!IN(nbx,nby))\n {\n nbx=b.x;\n nby=b.y;\n }\n Place nb=Place{nbx,nby};\n int nidx=(idx+1)%P;\n\n // ????????????\n rep(i,5)\n {\n int nax=a.x+dx[i], nay=a.y+dy[i];\n if(IN(nax,nay) && s[nay][nax]!='#' && z[nay][nax][nby][nbx][nidx] > nowZ+1)\n {\n z[nay][nax][nby][nbx][nidx] = nowZ+1;\n Place na=Place{nax,nay};\n que.push(State{na,nb,nidx});\n }\n }\n }\n\n int ans=INF,ax=-1,ay=-1;\n rep(i,h)rep(j,w)rep(k,P)\n {\n if(ans>z[i][j][i][j][k])\n {\n ans=z[i][j][i][j][k];\n ax=j;\n ay=i;\n }\n }\n\n if(ans==INF) printf(\"impossible\\n\");\n else printf(\"%d %d %d\\n\", ans,ay,ax);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 9488,
"score_of_the_acc": -0.8919,
"final_rank": 15
},
{
"submission_id": "aoj_1046_1982508",
"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\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n \n\nconst int dx[] = { -1,0,1,0,0 };\nconst int dy[] = { 0,1,0,-1,0 };\n\nint memo[22][22][22][22][10];\n\nstruct aa{\n\tint mx;\n\tint my;\n\tint gx;\n\tint gy;\n\tint num;\n\tint time;\n};\n\nclass Compare {\npublic:\n\tbool operator()(const aa&l, const aa&r) {\n\t\treturn l.time> r.time;\n\t}\n};\t//aa?????????????????¶\n\n\npair<int, int>amove(const vector<vector<int>>&field, const int nx, const int ny,const int move,bool gh) {\n\n\tconst int nexty = ny +dy[move];\n\tconst int nextx =nx + dx[move];\n\tif (gh) {\n\n\t\tif (field[nexty][nextx]!=2)return make_pair(nextx, nexty);\n\t\telse return make_pair(nx, ny);\n\t}\n\telse {\n\n\t\tif (!field[nexty][nextx])return make_pair(nextx, nexty);\n\t\telse return make_pair(nx, ny);\n\t}\n}\nint main() {\n\twhile (1) {\n\t\tint H, W; cin >> H >> W;\n\t\tif (!H)break;\n\t\tfor (int i = 0; i < 22; ++i) {\n\t\t\tfor (int j = 0; j < 22; ++j) {\n\t\t\t\tfor (int k = 0; k < 22; ++k) {\n\t\t\t\t\tfor (int l = 0; l < 22; ++l) {\n\t\t\t\t\t\tfor (int m = 0; m < 10; ++m) {\n\t\t\t\t\t\t\tmemo[i][j][k][l][m] = 1e8;\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\tint mx, my, gx, gy;\n\t\tvector<vector<int>>field(H + 2, vector<int>(W + 2,2));\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tstring st; cin >> st;\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tif (st[j] == 'A') {\n\t\t\t\t\tmx = j + 1; my = i + 1;\n\t\t\t\t\tfield[i+1][j+1] = false;\n\t\t\t\t}\n\t\t\t\telse if (st[j] == 'B') {\n\t\t\t\t\tgx = j + 1; gy = i + 1;\n\t\t\t\t\tfield[i + 1][j + 1] = false;\n\n\t\t\t\t}\n\t\t\t\telse if (st[j] == '#') {\n\t\t\t\t\tfield[i + 1][j + 1] =true;\n\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tfield[i + 1][j + 1] = false;\n\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tstring pattern; cin >> pattern;\n\t\tvector<int>moves(pattern.size());\n\t\tfor (int i = 0; i < pattern.size(); ++i) {\n\t\t\tif (pattern[i] == '8')moves[i] = 3;\n\t\t\telse if (pattern[i] == '6')moves[i] = 2;\n\t\t\telse if (pattern[i] == '4')moves[i] = 0;\n\t\t\telse if (pattern[i] == '2')moves[i] = 1;\n\t\t\telse moves[i] = 4;\n\t\t}\n\t\tmemo[mx][my][gx][gy][0] = 0;\n\t\tpriority_queue<aa, vector<aa>, Compare>que;\n\t\tque.push(aa{ mx,my,gx,gy,0,0 });\n\t\tint ans = -1;\n\t\tint ansx, ansy;\n\t\twhile (!que.empty()) {\n\t\t\taa atop(que.top());\n\t\t\tque.pop();\n\t\t\tif (atop.gx == atop.mx&&atop.gy == atop.my) {\n\t\t\t\tans = atop.time;\n\t\t\t\tansx = atop.gx;\n\t\t\t\tansy = atop.gy;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tauto gp(amove(field, atop.gx, atop.gy, moves[atop.num],true));\n\t\t\tconst int nextgx = gp.first;\n\t\t\tconst int nextgy = gp.second;\n\t\t\tconst int nextnum = (atop.num + 1) % moves.size();\n\t\t\tfor (int way = 0; way < 5; ++way) {\n\t\t\t\tauto amp(amove(field, atop.mx, atop.my, way,false));\n\n\t\t\t\tconst int nextmx = amp.first;\n\t\t\t\tconst int nextmy = amp.second;\n\t\t\t\tif (memo[nextmx][nextmy][nextgx][nextgy][nextnum]>atop.time + 1) {\n\t\t\t\t\tmemo[nextmx][nextmy][nextgx][nextgy][nextnum] = atop.time + 1;\n\t\t\t\t\tque.push(aa{ nextmx,nextmy,nextgx,nextgy,nextnum,atop.time + 1 });\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (ans == -1)cout << \"impossible\" << endl;\n\t\telse {\n\t\t\tcout << ans<<\" \"<<ansy-1<<\" \"<<ansx -1<< endl;\n\t\t}\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 12300,
"score_of_the_acc": -1.1594,
"final_rank": 17
},
{
"submission_id": "aoj_1046_1867208",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <cstring>\n \nusing namespace std;\n \n#define MAX 20\n#define INF 1e9\n \nint H,W,ax,ay,bx,by;\nchar field[MAX][MAX];\nstring str;\nconst int dx[] = {-1,0,0,1,0};\nconst int dy[] = {0,-1,1,0,0};\n \nstruct State{\n int sx,sy,gx,gy;\n State(int sx,int sy,int gx,int gy) : sx(sx),sy(sy),gx(gx),gy(gy) {}\n};\n \nbool inField(int y,int x){\n return 0 <= y && y < H && 0 <= x && x < W;\n}\n \nint getDir(char ch){\n if(ch == '4') return 0;\n if(ch == '8') return 1;\n if(ch == '2') return 2;\n if(ch == '6') return 3;\n return 4;\n}\n \nvoid bfs(){\n int size = str.size();\n bool visited[MAX][MAX][MAX][MAX][MAX];\n memset(visited,0,sizeof(visited));\n visited[ay][ax][by][bx][0] = true;\n queue<State> Q;\n queue<int> Count;\n Q.push(State(ax,ay,bx,by));\n Count.push(0);\n while(!Q.empty()){\n\tState s = Q.front(); Q.pop();\n\tint cnt = Count.front(); Count.pop();\n \n\tif(s.sx == s.gx && s.sy == s.gy){\n\t cout << cnt << \" \" << s.sy << \" \" << s.sx << endl;\n\t return;\n\t}\n \n\tint dir = getDir(str[cnt%size]);\n\tint Gx = s.gx + dx[dir], Gy = s.gy + dy[dir];\n\tif(!inField(Gy,Gx)) Gx = s.gx, Gy = s.gy;\n \n\tfor(int i = 0 ; i < 5 ; i++){\n\t int nx = s.sx + dx[i], ny = s.sy + dy[i];\n\t if(!inField(ny,nx)) continue;\n\t if(field[ny][nx] == '#') continue;\n\t if(visited[ny][nx][Gy][Gx][(cnt+1)%size]) continue;\n\t visited[ny][nx][Gy][Gx][(cnt+1)%size] = true;\n\t Q.push(State(nx,ny,Gx,Gy));\n\t Count.push(cnt+1);\n\t}\n }\n cout << \"impossible\" << endl;\n}\n \nint main(){\n while(cin >> H >> W, (H|W)){\n\tfor(int i = 0 ; i < H ; i++){\n\t for(int j = 0 ; j < W ; j++){\n\t\tcin >> field[i][j];\n\t\tif(field[i][j] == 'A'){\n\t\t ax = j, ay = i;\n\t\t}else if(field[i][j] == 'B'){\n\t\t bx = j, by = i;\n\t\t}\n\t }\n\t}\n\tcin >> str;\n\tbfs();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6288,
"score_of_the_acc": -0.3013,
"final_rank": 11
},
{
"submission_id": "aoj_1046_1828776",
"code_snippet": "#include<iostream>\n#include<queue>\nusing namespace std;\ntypedef pair<pair<int,int>,int> pa;\n#define ff first.first\n#define fs first.second\n\nint h,w,sx,sy,gx,gy;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,-1,0,1};\nint co[21][21];\nchar ma[21][21];\nbool visited[21][21];\nstring pat;\nint m = 999999;\n\nint main(){\n while(cin>>h>>w,h){\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n co[i][j]=m;\n cin>>ma[i][j];\n if(ma[i][j]=='A')\n sx=j,sy=i;\n else if(ma[i][j]=='B')\n gx=j,gy=i;\n }\n }\n queue<pa>q;\n q.push(make_pair(make_pair(sx, sy), 0));\n while(q.size()){\n pa p = q.front();\n q.pop();\n if(co[p.fs][p.ff]!=m)\n continue;\n co[p.fs][p.ff]=p.second;\n for(int i=0;i<4;i++){\n int nx=p.ff+dx[i];\n int ny=p.fs+dy[i];\n if(nx>=0&&nx<w&&ny>=0&ny<h&&ma[ny][nx]!='#'&&co[ny][nx]==m)\n q.push(make_pair(make_pair(nx, ny), p.second+1));\n }\n }\n cin>>pat;\n for(int j=0,go=0;;j++,go++){\n int i=j%pat.length();\n if(co[gy][gx]<=go){\n cout<<go<<\" \"<<gy<<\" \"<<gx<<endl;\n break;\n }\n if(go>100000){\n cout<<\"impossible\"<<endl;\n break;\n }\n if(pat[i]=='8')\n gy--;\n else if(pat[i]=='6')\n gx++;\n else if(pat[i]=='4')\n gx--;\n else if(pat[i]=='2')\n gy++;\n gy=max(0,min(h-1,gy));\n gx=max(0,min(w-1,gx));\n }\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1228,
"score_of_the_acc": -0.1,
"final_rank": 6
},
{
"submission_id": "aoj_1046_1828694",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<climits>\n#include<vector>\n#include<queue>\n#include<stack>\n#include<cmath>\n#include<string.h>\n\nusing namespace std;\n\nint h,w,sx,sy,gx,gy;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,-1,0,1};\n\nchar ma[21][21];\nint co[21][21];\nbool visited[21][21];\n\nint main(){\n while(cin>>h>>w,h){\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n co[i][j]=INT_MAX;\n cin>>ma[i][j];\n if(ma[i][j]=='A'){\n sx=j,sy=i;\n } else if(ma[i][j]=='B'){\n gx=j,gy=i;\n }\n }\n }\n queue<pair<pair<int,int>,int> >q;\n q.push(make_pair(make_pair(sx, sy), 0));\n while(q.size()){\n // cout<<q.size()<<endl;\n pair<pair<int,int>,int> p = q.front();\n q.pop();\n if(co[p.first.second][p.first.first]!=INT_MAX){\n continue;\n }\n // cout<<p.first.second<<\" \"<<p.first.first<<endl;\n co[p.first.second][p.first.first]=p.second;\n for(int i=0;i<4;i++){\n int nx=p.first.first+dx[i];\n int ny=p.first.second+dy[i];\n if(nx>=0&&nx<w&&ny>=0&ny<h&&ma[ny][nx]!='#'&&co[ny][nx]==INT_MAX){\n q.push(make_pair(make_pair(nx, ny), p.second+1));\n }\n }\n // cout<<q.size()<<endl;\n }\n string pat;\n cin>>pat;\n int go=0;\n for(int j=0;;j++){\n int i=j%pat.length();\n // cout<<gy<<\" \"<<gx<<\" \"<<co[gy][gx]<<\" \"<<INT_MAX<<endl;\n if(co[gy][gx]<=go){\n cout<<go<<\" \"<<gy<<\" \"<<gx<<endl;\n break;\n }\n if(go>100000){\n cout<<\"impossible\"<<endl;\n break;\n }\n if(pat[i]=='5'){\n \n } else if(pat[i]=='8'){\n gy--;\n } else if(pat[i]=='6'){\n gx++;\n } else if(pat[i]=='4'){\n gx--;\n } else if(pat[i]=='2'){\n gy++;\n }\n gy=max(0,gy);\n gy=min(h-1,gy);\n gx=max(0,gx);\n gx=min(w-1,gx);\n go++;\n }\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1228,
"score_of_the_acc": -0.1,
"final_rank": 6
},
{
"submission_id": "aoj_1046_1718432",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef pair<P,P> Pi;\ntypedef pair<P,Pi> Pii;\nint H,W;\nchar mas[22][22];\nstring pat;\nint ax,ay,bx,by;\nint dx[] = {0,1,-1,0,0};\nint dy[] = {0,0,0,-1,1};\n\nint solved(){\n bool used[10][20][20][20][20];\n memset(used,false,sizeof(used));\n queue<Pii> que;\n int len = pat.size();\n que.push(Pii(P(0,0),Pi(P(ax,ay),P(bx,by))));\n used[0][ax][ay][bx][by] = true;\n while(!que.empty()){\n Pii p = que.front(); que.pop();\n int cnt = p.first.first;\n int idx = p.first.second;\n int Ax = p.second.first.first;\n int Ay = p.second.first.second;\n int Bx = p.second.second.first;\n int By = p.second.second.second;\n if(Ax == Bx && Ay == By) {\n cout << cnt << \" \" << Ay << \" \" << Ax << endl;\n return 1;\n }\n int nBx = Bx;\n int nBy = By;\n if(pat[idx] == '8') nBy = max(0,nBy-1);\n else if(pat[idx] == '6') nBx = min(W-1,nBx+1);\n else if(pat[idx] == '4') nBx = max(0,nBx-1);\n else if(pat[idx] == '2') nBy = min(H-1,nBy+1);\n for(int i=0;i<5;i++){\n int nAx = Ax+dx[i];\n int nAy = Ay+dy[i];\n if(nAx >= W || nAx < 0) nAx = Ax;\n if(nAy >= H || nAy < 0) nAy = Ay;\n if(mas[nAy][nAx] != '#'){\n\tint next = (idx+1)%len;\n\tif(used[next][nAx][nAy][nBx][nBy] == false){\n\t used[next][nAx][nAy][nBx][nBy] = true;\n\t que.push(Pii(P(cnt+1,next),Pi(P(nAx,nAy),P(nBx,nBy))));\n\t}\t\n }\n }\n }\n return 0;\n}\n\nint main(){\n while(1){\n cin >> H >> W;\n if(H == 0 && W == 0) break;\n for(int i=0;i<H;i++){\n for(int j=0;j<W;j++){\n\tcin >> mas[i][j];\n\tif(mas[i][j] == 'A'){\n\t ax = j;\n\t ay = i;\n\t}\n\tif(mas[i][j] == 'B'){\n\t bx = j;\n\t by = i;\n\t}\n }\n }\n cin >> pat;\n if(solved() == 0){\n cout << \"impossible\" << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2800,
"score_of_the_acc": -0.1936,
"final_rank": 8
},
{
"submission_id": "aoj_1046_1622296",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <queue>\n#define m make_pair\n#define INF (1e9)\n#define N 20\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef pair<int,P> P1;\nvoid bfs();\nint h,w,sx,sy,gy,gx,p,d[N][N],anst,ansy,ansx;\nstring str[N],pat;\n\nint main(){\n while(1){\n cin>>h>>w;\n if(!h&&!w) break;\n for(int i=0;i<h;i++) cin>>str[i];\n cin>>pat;\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++){\n\tif(str[i][j]=='A') sx=j,sy=i;\n\tif(str[i][j]=='B') gx=j,gy=i;\n }\n bfs();\n int len=pat.size(),t=0,eflag=0;\n p=0;\n while(1){\n int cy=gy,cx=gx;\n if(pat[p]=='8') gy--;\n if(pat[p]=='6') gx++;\n if(pat[p]=='4') gx--;\n if(pat[p]=='2') gy++;\n p++;\n t++;\n if(p==len) p=0;\n if(gy<0||h<=gy||gx<0||w<=gx) gy=cy,gx=cx;\n if(d[gy][gx]!=INF&&d[gy][gx]<=t){\n\tanst=max(d[gy][gx],t);\n\tansy=gy;\n\tansx=gx;\n\tbreak;\n }\n if(t==100000){\n\teflag=1;\n\tbreak;\n }\n }\n if(!eflag) cout<<anst<<' '<<ansy<<' '<<ansx<<endl;\n else cout<<\"impossible\"<<endl;\n }\n return 0;\n}\n\nvoid bfs(){\n int dy[4]={-1,0,1,0};\n int dx[4]={0,1,0,-1};\n queue<P1> q;\n for(int i=0;i<N;i++)\n for(int j=0;j<N;j++) d[i][j]=INF;\n d[sy][sx]=0;\n q.push(m(0,m(sy,sx)));\n while(!q.empty()){\n P1 t=q.front(); q.pop();\n int c=t.first,uy=t.second.first,ux=t.second.second;\n for(int i=0;i<4;i++){\n int ny=uy+dy[i],nx=ux+dx[i];\n if(ny<0||h<=ny||nx<0||w<=nx) continue;\n if(str[ny][nx]=='#') continue;\n if(d[ny][nx]>c+1){\n\td[ny][nx]=c+1;\n\tq.push(m(d[ny][nx],m(ny,nx)));\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1228,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1046_1622273",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define F first\n#define S second\n#define INF 1<<29\ntypedef pair<int,int> P;\nstruct PP {\n P a,b;\n int kk;\n};\n\nint dx[5]={-1,0,1,0,0},dy[5]={0,1,0,-1,0};\nbool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}\n\nint main() {\n int n,m;\n while(cin >> n >> m && n) {\n string s[n],t;\n for(int i=0; i<n; i++) cin >> s[i];\n cin >> t;\n for(int i=0; i<t.size(); i++) {\n if(t[i]=='5') t[i]='4';\n else if(t[i]=='8') t[i]='0';\n else if(t[i]=='6') t[i]='1';\n else if(t[i]=='2') t[i]='2';\n else t[i]='3';\n }\n P p1,p2;\n for(int i=0; i<n; i++) {\n for(int j=0; j<m; j++) {\n if(s[i][j]=='A') p1=P(i,j);\n if(s[i][j]=='B') p2=P(i,j);\n }\n }\n int d[n][m][n][m][t.size()];\n for(int i=0;i<n;i++)for(int i2=0;i2<m;i2++)for(int i3=0;i3<n;i3++)for(int i4=0;i4<m;i4++)for(int i5=0;i5<t.size();i5++)d[i][i2][i3][i4][i5]=INF;\n d[p1.F][p1.S][p2.F][p2.S][t.size()-1]=0;\n queue<PP> que;\n que.push((PP){p1,p2,t.size()-1});\n while(!que.empty()) {\n PP p=que.front();que.pop();\n int nx=p.a.F,ny=p.a.S,k=p.kk;\n P q=p.b;\n int cost=d[nx][ny][p.b.F][p.b.S][p.kk];\n if(p.a==p.b) {\n cout << cost << \" \" << nx << \" \" << ny << endl;\n goto end;\n }\n k=(k+1)%t.size();\n int r=t[k]-'0';\n q.F+=dx[r],q.S+=dy[r];\n if(!check(n,m,q.F,q.S)) q=p.b;\n for(int i=0; i<5; i++) {\n int x=nx+dx[i],y=ny+dy[i];\n if(!check(n,m,x,y)||s[x][y]=='#') continue;\n if(d[x][y][q.F][q.S][k]>cost+1) {\n d[x][y][q.F][q.S][k]=cost+1;\n que.push((PP){P(x,y),q,k});\n }\n }\n }\n cout << \"impossible\" << endl;\n end:;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 7492,
"score_of_the_acc": -0.473,
"final_rank": 12
},
{
"submission_id": "aoj_1046_1542302",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nconst int INF=1001001001;\ntypedef pair<int,int>P;\nconst int dx[]={-1,0,1,0,0};\nconst int dy[]={0,-1,0,1,0};\nint H,W;\nchar fld[50][50];\nint sy,sx,gy,gx;\nint dist[50][50];\nint ord[10],N;\nbool ok(int y,int x){\n if(y<0||y>=H||x<0||x>=W)return false;\n return true;\n}\n\nvoid bfs(){\n for(int i=0;i<H;i++)for(int j=0;j<W;j++)dist[i][j]=INF;\n dist[sy][sx]=0;\n\n queue<P>que;que.push(P(sy,sx));\n\n while(que.size()){\n P p=que.front();que.pop();\n\n for(int i=0;i<4;i++){\n int ny=p.first+dy[i],nx=p.second+dx[i];\n if(!ok(ny,nx)||fld[ny][nx]=='#'||dist[ny][nx]!=INF)continue;\n dist[ny][nx]=dist[p.first][p.second]+1;\n que.push(P(ny,nx));\n }\n }\n}\n\nvoid solve(){\n for(int i=0;i<H;i++){\n cin>>fld[i];\n for(int j=0;j<W;j++){\n if(fld[i][j]=='A')sy=i,sx=j;\n if(fld[i][j]=='B')gy=i,gx=j;\n }\n }\n\n bfs();\n\n string str;cin>>str;\n N=str.size();\n for(int i=0;i<N;i++){\n switch(str[i]){\n case '5':ord[i]=4;break;\n case '8':ord[i]=1;break;\n case '4':ord[i]=0;break;\n case '2':ord[i]=3;break;\n case '6':ord[i]=2;break;\n }\n }\n\n for(int i=0;i<100000;i++){\n int ny=gy+dy[ord[i%N]],nx=gx+dx[ord[i%N]];\n if(ok(ny,nx)){\n gy=ny;gx=nx;\n }\n\n if(dist[gy][gx]<=i+1){\n cout<<i+1<<\" \"<<gy<<\" \"<<gx<<endl;\n return;\n }\n }\n\n cout<<\"impossible\"<<endl;\n}\n\nint main(){\n while(cin>>H>>W,H||W)solve();\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1232,
"score_of_the_acc": -0.0002,
"final_rank": 2
},
{
"submission_id": "aoj_1046_1444824",
"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=1<<24;\nint h,w;\nint dd[]={0,1,0,-1,0};\nbool check(int a,int b){\n\tif(0<=a&&a<h&&0<=b&&b<w) return true;\n\treturn false;\n}\nvoid bfs(pii p,int x,vector<string> &v,vvint &vv){\n\tif(vv[p.F][p.S]<=x) return;\n\tvv[p.F][p.S]=x;\n\trep(i,4){\n\t\tpii ne=pii(p.F+dd[i],p.S+dd[i+1]);\n\t\tif(!check(ne.F,ne.S)||v[ne.F][ne.S]=='#') continue;\n\t\tbfs(ne,x+1,v,vv);\n\t}\n}\nvoid mainmain(){\n\tvector<pii> vec(10);\n\tvec[2]=pii(1,0);\n\tvec[4]=pii(0,-1);\n\tvec[5]=pii(0,0);\n\tvec[6]=pii(0,1);\n\tvec[8]=pii(-1,0);\n\twhile(cin>>h>>w,h||w){\n\t\tvector<string> v(h);\n\t\trep(i,h) cin>>v[i];\n\t\tstring s;\n\t\tcin>>s;\n\t\tvvint vv;\n\t\tinitvv(vv,h,w,-1);\n\t\tpii A,B;\n\t\trep(i,h){\n\t\t\trep(j,w){\n\t\t\t\tif(v[i][j]=='A'){\n\t\t\t\t\tA=pii(i,j);\n\t\t\t\t\tv[i][j]='.';\n\t\t\t\t}\n\t\t\t\tif(v[i][j]=='B'){\n\t\t\t\t\tB=pii(i,j);\n\t\t\t\t\tv[i][j]='.';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// bfs(A,0,v,vv);\n\t\tqueue<pair<pii,int>> q;\n\t\tq.push(mkp(A,0));\n\t\tvv[A.F][A.S]=0;\n\t\twhile(q.size()){\n\t\t\tauto top=q.front();\n\t\t\tq.pop();\n\t\t\trep(i,4){\n\t\t\t\tpii ne(top.F.F+dd[i],top.F.S+dd[i+1]);\n\t\t\t\tif(!check(ne.F,ne.S)||v[ne.F][ne.S]=='#'||vv[ne.F][ne.S]>=0) continue;\n\t\t\t\tvv[ne.F][ne.S]=top.S+1;\n\t\t\t\tq.push(mkp(ne,top.S+1));\n\t\t\t}\n\t\t}\n\t\tint ans=-1;\n\t\tpii pos;\n\t\trep(i,h){\n\t\t\trep(j,w){\n\t\t\t\t// printf(\"%2d \",vv[i][j]);\n\t\t\t\tif(vv[i][j]==-1) vv[i][j]=INF;\n\t\t\t}\n\t\t\t// cout<<endl;\n\t\t}\n\t\trep(i,1e5){\n\t\t\t// cout<<i<<\" \"<<B.F<<\" \"<<B.S<<endl;\n\t\t\tif(vv[B.F][B.S]<=i){\n\t\t\t\tans=i;\n\t\t\t\tpos=B;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tint t=s[i%s.size()]-'0';\n\t\t\tpii ne=pii(B.F+vec[t].F,B.S+vec[t].S);\n\t\t\tif(check(ne.F,ne.S)){\n\t\t\t\tB=ne;\n\t\t\t}\n\t\t}\n\t\tif(ans==-1){\n\t\t\tcout<<\"impossible\"<<endl;\n\t\t}\n\t\telse{\n\t\t\tcout<<ans<<\" \"<<pos.F<<\" \"<<pos.S<<endl;\n\t\t}\n\t\t// return;\n\t}\n}\n\n\nsigned main() {\n\t// ios_base::sync_with_stdio(false);\n \tcout<<fixed<<setprecision(20);\n mainmain();\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1236,
"score_of_the_acc": -0.0005,
"final_rank": 3
},
{
"submission_id": "aoj_1046_1226885",
"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 = 1e5;\n\nint H, W;\nint my[] = {0, 0, 1, -1};\nint mx[] = {1, -1, 0, 0};\n\nvoid dfsA(int t, int y, int x, vector<string> &v, vector< vector<int> > &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 && v[ny][nx] != '#' && cnt[ny][nx] > t + 1){\n cnt[ny][nx] = t + 1;\n dfsA(t + 1, ny, nx, v, cnt);\n }\n }\n}\n\nint main() {\n while(cin >>H >>W && H){\n vector<string> v(H); REP(i, H) cin >>v[i];\n vector< vector<int> > cntA(H, vector<int>(W, INF));\n REP(i, H) REP(j, W) if(v[i][j] == 'A') { cntA[i][j] = 0; dfsA(0, i, j, v, cntA); }\n string pattern; cin >>pattern;\n int y, x, ay, ax, ans = INF, pl = pattern.length();\n REP(i, H) REP(j, W) if(v[i][j] == 'B') { y = i; x = j; }\n REP(i, INF){\n if(cntA[y][x] <= i) { ans = i; ay = y; ax = x; break; }\n //cout <<y <<\", \" <<x <<\", \" <<cntA[y][x] <<\", \" <<i <<endl;\n if(pattern[i % pl] == '8') { y = max(0, y - 1); }\n else if(pattern[i % pl] == '6') { x = min(W - 1, x + 1); }\n else if(pattern[i % pl] == '4') { x = max(0, x - 1); }\n else if(pattern[i % pl] == '2') { y = min(H - 1, y + 1); }\n }\n if(ans == INF) cout <<\"impossible\" <<endl;\n else cout <<ans <<\" \" <<ay <<\" \" <<ax <<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1264,
"score_of_the_acc": -0.0021,
"final_rank": 4
},
{
"submission_id": "aoj_1046_1178382",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int dx[] = {-1, 0, 1, 0, 0};\nconst int dy[] = {0, -1, 0, 1, 0};\n\nstruct STATE { int ax, ay, bx, by, d; };\n\nchar grid[32][32];\nbool done[32][32][32][32][16];\n\nint main()\n{\n\tint h, w;\n\twhile (scanf(\"%d %d\", &h, &w), h + w){\n\t\tmemset(grid, '*', sizeof(grid));\n\t\tmemset(done, false, sizeof(done));\n\t\tSTATE s = {0, 0, 0, 0, 0};\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] == 'A'){\n\t\t\t\t\ts.ax = i;\n\t\t\t\t\ts.ay = j;\n\t\t\t\t\tgrid[i][j] = '.';\n\t\t\t\t}\n\t\t\t\telse if (grid[i][j] == 'B'){\n\t\t\t\t\ts.bx = i;\n\t\t\t\t\ts.by = 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\t/*\n\t\tfor (int i = 1; i <= h; i++){\n\t\t\tfor (int j = 1; j <= w; j++){\n\t\t\t\tprintf(\"%c\", grid[i][j]);\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\t*/\n\t\t\n\t\tstring pa;\n\t\tcin >> pa;\n\t\tfor (int i = 0; i < pa.size(); i++){\n\t\t\tif (pa[i] == '5') pa[i] = 4;\n\t\t\telse if (pa[i] == '8') pa[i] = 0;\n\t\t\telse if (pa[i] == '6') pa[i] = 3;\n\t\t\telse if (pa[i] == '4') pa[i] = 1;\n\t\t\telse if (pa[i] == '2') pa[i] = 2;\n\t\t}\n\t\t\n\t\tSTATE res = {0, 0, 0, 0, -1};\n\t\tqueue<STATE> que;\n\t\tfor (que.push(s); que.size(); que.pop()){\n\t\t\tSTATE st = que.front();\n\t\t\t\n\t\t\t//printf(\"%d %d %d %d\\n\", st.ax, st.ay, st.bx, st.by);\n\t\t\t\n\t\t\tif (done[st.ax][st.ay][st.bx][st.by][st.d % pa.size()]){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tdone[st.ax][st.ay][st.bx][st.by][st.d % pa.size()] = true;\n\t\t\tif (st.ax == st.bx && st.ay == st.by){\n\t\t\t\tres = st;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tint tbx = st.bx + dx[pa[st.d % pa.size()]];\n\t\t\tint tby = st.by + dy[pa[st.d % pa.size()]];\n\t\t\tif (grid[tbx][tby] == '*'){\n\t\t\t\ttbx = st.bx;\n\t\t\t\ttby = st.by;\n\t\t\t}\n\t\t\tfor (int dir = 0; dir < 5; dir++){\n\t\t\t\tint tax = st.ax + dx[dir];\n\t\t\t\tint tay = st.ay + dy[dir];\n\t\t\t\tif (grid[tax][tay] != '.') continue;\n\t\t\t\tque.push({tax, tay, tbx, tby, st.d + 1});\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (res.d == -1) cout << \"impossible\" << endl;\n\t\telse cout << res.d << \" \" << res.ax - 1 << \" \" << res.ay - 1 << endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 17680,
"score_of_the_acc": -1.5798,
"final_rank": 19
},
{
"submission_id": "aoj_1046_1100615",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdio>\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 \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\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 H,W;\nchar stage[20][20];\nstring ghost;\nbool visited[20][20][20][20][10];\nint gTime = 0;\nint rx,ry;\n\nclass State {\npublic:\n int _sx,_sy,_gx,_gy,_time;\n State(int sx,int sy,int gx,int gy,int time) : \n _sx(sx),_sy(sy),_gx(gx),_gy(gy),_time(time) {}\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};\n\nvoid bfs(int sx,int sy,int gx,int gy){\n State init(sx,sy,gx,gy,0);\n \n priority_queue<State,vector<State>,greater<State> > que;\n que.push(init);\n\n while(!que.empty()){\n State s = que.top();\n que.pop();\n\n int pattern_i = s._time % ghost.size();\n if(ghost[pattern_i] == '5'){\n //nothing to do\n }\n else if(ghost[pattern_i] == '8' && s._gy - 1 >= 0){\n s._gy--;\n }\n else if(ghost[pattern_i] == '6' && s._gx + 1 < W){\n s._gx++;\n }\n else if(ghost[pattern_i] == '4' && s._gx - 1 >= 0){\n s._gx--;\n }\n else if(ghost[pattern_i] == '2' && s._gy + 1 < H){\n s._gy++;\n }\n\n if(!visited[s._sx][s._sy][s._gx][s._gy][pattern_i]){\n visited[s._sx][s._sy][s._gx][s._gy][pattern_i] = true;\n if(s._sx == s._gx && s._sy == s._gy && gTime > s._time){\n gTime = s._time;\n rx = s._gx;\n ry = s._gy;\n return;\n }\n que.push(State(sx,sy,s._gx,s._gy,s._time+1));\n }\n for(int i = 0; i < 4; i++){\n int dx = tx[i] + s._sx;\n int dy = ty[i] + s._sy;\n if(dx < 0 || dx >= W || dy < 0 || dy >= H) continue;\n if(stage[dy][dx] == '#') continue;\n if(visited[dx][dy][s._gx][s._gy][pattern_i]) continue;\n \n visited[dx][dy][s._gx][s._gy][pattern_i] = true;\n if(dx == s._gx && dy == s._gy && gTime > s._time){\n gTime = s._time;\n rx = s._gx;\n ry = s._gy;\n return;\n }\n que.push(State(dx,dy,s._gx,s._gy,s._time+1));\n }\n }\n}\n\nint main(){\n while(~scanf(\"%d %d\",&H,&W)){\n if(H == 0 && W == 0) break;\n\n int sx,sy,gx,gy;\n memset(visited,false,sizeof(visited));\n gTime = INF;\n\n for(int y = 0; y < H; y++){\n char line[32];\n scanf(\"%s\",line);\n for(int x = 0; x < W; x++){\n stage[y][x] = line[x];\n if(stage[y][x] == 'A'){\n sx = x;\n sy = y;\n }\n if(stage[y][x] == 'B'){\n gx = x;\n gy = y;\n }\n }\n }\n cin >> ghost;\n rx = -1;\n ry = -1;\n bfs(sx,sy,gx,gy);\n \n if(gTime == INF){\n printf(\"impossible\\n\");\n }\n else{\n printf(\"%d %d %d\\n\",gTime + 1,ry,rx);\n }\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2832,
"score_of_the_acc": -0.1955,
"final_rank": 9
},
{
"submission_id": "aoj_1046_1093861",
"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\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) \n{ return s << P.first << \" \" << P.second; }\n\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\n\nint n, m;\nchar fi[25][25];\nstring pat;\n\nint dist[25][25][25][25][11];\n\npair<int,pint> solve() {\n pint s, t;\n for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) {\n cin >> fi[i][j];\n if (fi[i][j] == 'A') s = pint(i,j);\n if (fi[i][j] == 'B') t = pint(i,j);\n }\n cin >> pat;\n memset(dist, -1, sizeof(dist));\n dist[s.first][s.second][t.first][t.second][0] = 0;\n queue< pair<pair<pint,pint>,int> > que;\n que.push( MP(MP(s,t),0) );\n while (!que.empty()) {\n pint girl = que.front().first.first;\n pint goast = que.front().first.second;\n int p = que.front().second;\n //cout << girl << \", \" << goast << \" : \" << dist[girl.first][girl.second][goast.first][goast.second] << endl;\n que.pop();\n if (girl == goast) { \n return MP(dist[girl.first][girl.second][goast.first][goast.second][p], girl); \n }\n \n pint ngoast = goast;\n char c = pat[p];\n if (c == '8') ngoast = pint(goast.first-1, goast.second);\n if (c == '6') ngoast = pint(goast.first, goast.second+1);\n if (c == '4') ngoast = pint(goast.first, goast.second-1);\n if (c == '2') ngoast = pint(goast.first+1, goast.second);\n if (ngoast.first < 0 || ngoast.first >= n || ngoast.second < 0 || ngoast.second >= m) ngoast = goast;\n int np = (p+1)%pat.size();\n \n for (int i = 0; i < 5; ++i) {\n pint ngirl = girl;\n if (i < 4) ngirl = pint( girl.first + dx[i], girl.second + dy[i] );\n if (ngirl.first < 0 || ngirl.first >= n || ngirl.second < 0 || ngirl.second >= m) continue;\n if (fi[ngirl.first][ngirl.second] == '#') continue;\n if ( dist[ngirl.first][ngirl.second][ngoast.first][ngoast.second][np] == -1 ) {\n dist[ngirl.first][ngirl.second][ngoast.first][ngoast.second][np] \n = dist[girl.first][girl.second][goast.first][goast.second][p] + 1;\n que.push( MP(MP(ngirl, ngoast),np) );\n }\n }\n }\n return MP(-1,pint(-1,-1));\n}\n\nint main() {\n while (cin >> n >> m) {\n if (n == 0) break;\n pair<int,pint> res = solve();\n if (res.first == -1) puts(\"impossible\");\n else cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 18020,
"score_of_the_acc": -1.5,
"final_rank": 18
},
{
"submission_id": "aoj_1046_1057773",
"code_snippet": "#include <stdio.h>\n#include <cctype>\n#include <limits.h>\n#include <math.h>\n#include <complex>\n#include <bitset>\n#include <vector>\n#include <map>\n#include <set>\n#include <stack>\n#include <queue>\n#include <cstring>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <iomanip>\n#include <iostream>\n\n#define VARIABLE(x) cerr << #x << \"=\" << x << endl\n#define BINARY(x) static_cast<bitset<16> >(x);\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define REP(i,m,n) for (int i=m;i<(int)(n);i++)\n#define if_range(x, y, w, h) if (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))\n\nconst int INF = 1000000000;\nconst double EPS = 1e-8;\nconst double PI = 3.14159;\n//int dx[4]={-1, 0, 1, 0}, dy[4]={0, -1, 0, 1};\nusing namespace std;\n//typedef pair<int, int> P;\n\n/** Problem1046 : Ghost Buster! **/\nint dx[]={-1, 0, 1, 0, 0}, dy[]={0, -1, 0, 1, 0};\n\nint W, H;\nstring s;\n\nstruct P {\n\tint x, y;\n\tP(){}\n\tP(int _x, int _y) : x(_x), y(_y) {}\n};\n\nstruct S {\n\tP p;\n\tint time;\n\tS(){}\n\tS(P _p, int _time) : p(_p), time(_time) {}\n};\n\ntypedef pair<S, S> SS;\n\nint main()\n{\n\t\n\twhile (cin>>H>>W, W||H) {\n\t\tchar field[20][20];\n\t\t\n\t\tS A, B;\n\t\t\n\t\trep(i, H) rep(j, W) {\n\t\t\tcin>>field[i][j];\n\t\t\tif (field[i][j] == 'A')\n\t\t\t\tA = S(P(j, i), 0);\n\t\t\telse if (field[i][j] == 'B')\n\t\t\t\tB = S(P(j, i), 0);\n\t\t}\n\t\tcin>>s;\n\t\tint N = (int)s.size();\n\t\t\n\t\tqueue<SS> Q;\n\t\tbool vis[H][W][H][W][10];\n\t\tmemset(vis, 0, sizeof(vis));\n\t\t\n\t\tQ.push(SS(A, B));\n\t\tvis[A.p.y][A.p.x][B.p.y][B.p.x][0] = true;\n\t\t\n\t\twhile (Q.size()) {\n\t\t\tSS ss = Q.front(); Q.pop();\n\t\t\tS a = ss.first, b = ss.second;\n\n\t\t\t//cerr << \"(\" << a.p.x << \", \" << a.p.y << \")\" << \" \";\n\t\t\t//cerr << \"(\" << b.p.x << \", \" << b.p.y << \")\" << \" \" << a.time << endl;\n\t\t\t\n\t\t\tif (a.p.x == b.p.x && a.p.y == b.p.y) {\n\t\t\t\tcout << a.time << \" \" << a.p.y << \" \" << a.p.x << endl;\n\t\t\t\tgoto end;\n\t\t\t}\n\t\t\t\t\t\t\n\t\t\t// Move Ghost\n\t\t\tif (s[b.time%N] == '8' && b.p.y>0)\n\t\t\t\tb.p.y--;\n\t\t\telse if (s[b.time%N] == '6' && b.p.x<W-1)\n\t\t\t\tb.p.x++;\n\t\t\telse if (s[b.time%N] == '4' && b.p.x>0)\n\t\t\t\tb.p.x--;\n\t\t\telse if (s[b.time%N] == '2' && b.p.y<H-1)\n\t\t\t\tb.p.y++;\n\t\t\tb.time++;\n\t\t\t\n\t\t\t// Move Girl\n\t\t\ta.time++;\n\t\t\trep(i, 5) {\n\t\t\t\tint nx = a.p.x + dx[i], ny = a.p.y + dy[i];\n\t\t\t\tif_range(nx, ny, W, H) {\n\t\t\t\t\tif (!vis[ny][nx][b.p.y][b.p.x][a.time%N] && field[ny][nx] != '#') {\n\t\t\t\t\t\tQ.push(SS(S(P(nx, ny), a.time), b));\n\t\t\t\t\t\tvis[ny][nx][b.p.y][b.p.x][a.time%N] = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif (!vis[a.p.y][a.p.x][b.p.y][b.p.x][b.time%N]) {\n\t\t\t\tQ.push(SS(a, b));\n\t\t\t\tvis[a.p.y][a.p.x][b.p.y][b.p.x][b.time%N] = true;\n\t\t\t}\n\t\t}\n\t\tcout << \"impossible\" << endl;\n\tend:;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2804,
"score_of_the_acc": -0.0939,
"final_rank": 5
},
{
"submission_id": "aoj_1046_1024079",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <cstring>\n\nusing namespace std;\n\n#define MAX 20\n#define INF 1e9\n\nint H,W,ax,ay,bx,by;\nchar field[MAX][MAX];\nstring str;\nconst int dx[] = {-1,0,0,1,0};\nconst int dy[] = {0,-1,1,0,0};\n\nstruct State{\n int sx,sy,gx,gy;\n State(int sx,int sy,int gx,int gy) : sx(sx),sy(sy),gx(gx),gy(gy) {}\n};\n\nbool inField(int y,int x){\n return 0 <= y && y < H && 0 <= x && x < W;\n}\n\nint getDir(char ch){\n if(ch == '4') return 0;\n if(ch == '8') return 1;\n if(ch == '2') return 2;\n if(ch == '6') return 3;\n return 4;\n}\n\nvoid bfs(){\n int size = str.size();\n bool visited[MAX][MAX][MAX][MAX][MAX];\n memset(visited,0,sizeof(visited));\n visited[ay][ax][by][bx][0] = true;\n queue<State> Q;\n queue<int> Count;\n Q.push(State(ax,ay,bx,by));\n Count.push(0);\n while(!Q.empty()){\n State s = Q.front(); Q.pop();\n int cnt = Count.front(); Count.pop();\n\n if(s.sx == s.gx && s.sy == s.gy){\n cout << cnt << \" \" << s.sy << \" \" << s.sx << endl;\n return;\n }\n\n int dir = getDir(str[cnt%size]);\n int Gx = s.gx + dx[dir], Gy = s.gy + dy[dir];\n if(!inField(Gy,Gx)) Gx = s.gx, Gy = s.gy;\n\n for(int i = 0 ; i < 5 ; i++){\n int nx = s.sx + dx[i], ny = s.sy + dy[i];\n if(!inField(ny,nx)) continue;\n if(field[ny][nx] == '#') continue;\n if(visited[ny][nx][Gy][Gx][(cnt+1)%size]) continue;\n visited[ny][nx][Gy][Gx][(cnt+1)%size] = true;\n Q.push(State(nx,ny,Gx,Gy));\n Count.push(cnt+1);\n }\n }\n cout << \"impossible\" << endl;\n}\n\nint main(){\n while(cin >> H >> 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] == 'A'){\n ax = j, ay = i;\n }else if(field[i][j] == 'B'){\n bx = j, by = i;\n }\n }\n }\n cin >> str;\n bfs();\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4368,
"score_of_the_acc": -0.287,
"final_rank": 10
},
{
"submission_id": "aoj_1046_1018274",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <algorithm>\n\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 MP make_pair\n#define PB push_back\n#define F first\n#define S second\n#define AY second.first.first\n#define AX second.first.second\n#define BY second.second.first\n#define BX second.second.second\n#define INF 1 << 30\n#define EPS 1e-10\n\ntypedef pair<int, int> P;\ntypedef pair<int, P> pii;\ntypedef pair<P, P>pipi;\ntypedef vector<int> vi;\ntypedef queue<int> qi;\ntypedef long long ll;\n\nint dy[] = {0, -1,0,1,0}, dx[] = {0, 0,-1,0,1};\nint gdy[] = {0, 0, 1, 0, 0, 0, 0, 0, -1}, gdx[] = {0, 0, 0, 0, -1, 0, 1, 0, 0};\nint H, W;\nchar field[32][32], pattern[16];\n\nP nexta(int y, int x, int d){\n int ny = y+dy[d], nx = x+dx[d];\n ny = max(0, min(H-1, ny));\n nx = max(0, min(W-1, nx));\n if(field[ny][nx] == '#'){\n ny = y;\n nx = x;\n }\n return MP(ny, nx);\n}\n\nP nextb(int y, int x, int c){\n int L = strlen(pattern);\n int ny = y+gdy[pattern[c%L]-'0'], nx = x+gdx[pattern[c%L]-'0'];\n ny = max(0, min(H-1, ny));\n nx = max(0, min(W-1, nx));\n return MP(ny, nx);\n}\n\nint main(){\n while(scanf(\"%d%d\", &H, &W) && H+W){\n rep(i, H) scanf(\"%s\", field[i]);\n scanf(\"%s\", pattern);\n int ay, ax, by, bx;\n rep(i, H) rep(j, W){\n if(field[i][j] == 'A'){ ay = i; ax = j;}\n else if(field[i][j] == 'B'){ by = i; bx = j;}\n }\n\n queue<pair<int, pipi> >q;\n map<pair<pipi, int>, int>m;\n q.push(MP(0, MP(MP(ay, ax), MP( by, bx))));\n m[MP(MP(MP(ay, ax), MP(by, bx)), -1)] = 1;\n\n while(!q.empty()){\n pair<int, pipi> now = q.front(); q.pop();\n if(now.AY == now.BY && now.AX == now.BX){\n\tprintf(\"%d %d %d\\n\", now.F, now.AY, now.AX);\n\tgoto e;\n }\n // printf(\"%d %d %d %d %d\\n\", now.F, now.AY, now.AX, now.BY, now.BX);\n rep(d, 5){\n\tP na = nexta(now.AY, now.AX, d);\n\tP nb = nextb(now.BY, now.BX, now.F);\n\t//\tint any = now.AY+dy[d], anx = now.AX+dx[d];\n\t//\tint bny = now.BY+gdy[pattern[(now.F%strlen(pattern))]-'0'], bnx = now.BX+gdx[pattern[(now.F%strlen(pattern))]-'0'];\n\t//\tprintf(\"%d %d %d %d\\n\", any, anx, bny, bnx);\n\t//\tif(any < 0 || any >= H || anx < 0 || anx >= W || bny < 0 || bny >= H || bnx < 0 || bnx >= W ||\n\t//\t field[any][anx] == '#' || m.count(MP(MP(any, anx), MP(bny, bnx)))) continue;\n\tif(m.count(MP(MP(na, nb), (now.F%strlen(pattern))))) continue;\n\n\tm[MP(MP(na, nb), now.F%strlen(pattern))] = 1;\n\tq.push(MP(now.F+1, MP(na, nb)));\n }\n }\n puts(\"impossible\");\n e:;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 3332,
"score_of_the_acc": -1.1253,
"final_rank": 16
}
] |
aoj_1047_cpp
|
Problem 07:
Crop Circle
アルゼンチンの広大な農地に突如ミステリーサークルが出没した。ミステリーサークルは重なっているもの、ポツンとあるもの、大きいもの、小さいものと合計
n
個確認された。
あるミステリーハンターが空中からミステリーサークルの全体像を撮影しようと試みたところ、各円の輪郭がはっきりしていなかったため、映像にその美しい模様を映し出すことが難しいことが分かった。
そこで、そのミステリーハンターは輪郭に沿って特殊素材の紐を設置し、輪郭を強調する提案をした。
紐を設置する部分は、あるミステリーサークルの円周上で、他のどのミステリーサークルにも含まれない部分である。
撮影隊は必要な紐の長さを計測するために、プログラムの作成をあなたに依頼した。各ミステリーサークルの中心座標と半径を入力し、設置する紐の長さを報告するプログラムを作成せよ。
参考として入出力例の１つ目と２つ目のケースをそれぞれ図１、図２に示す。紐の部分が太い線で示されている。
図１
図２
Input
入力として複数のデータセットが与えられる。各データセットは以下の形式で与えられる：
n
（ミステリーサークルの数：整数）
x
1
y
1
r
1
（1 個目のサークルの中心座標と半径：空白区切りの実数）
x
2
y
2
r
2
（2 個目のサークルの中心座標と半径：空白区切りの実数）
.
.
x
n
y
n
r
n
（
n
個目のサークルの中心座標と半径：空白区切りの実数）
n
が 0 のとき、入力の終わりを示す。
Output
各データセットに対して、紐の長さを１行に出力せよ。出力は 0.000001 以下の誤差を含んでもよい。
Constraints
n
≤ 100
-1000 ≤
x
i
,
y
i
≤ 1000
0 <
r
i
≤ 100
Sample Input
4
6 4 2
4 7 3
7 10 3
13 6 1
4
7 4 2
4 7 3
7 10 3
11 6 3
0
Output for the Sample Input
39.664699289572
45.627024663706
|
[
{
"submission_id": "aoj_1047_6012531",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <utility>\n#include <queue>\n#include <map>\n#include <set>\n#include <cmath>\n#include <deque>\n#include <algorithm>\n#include <stack>\n#include <sstream>\n#include <cstdlib>\n#include <ctime>\n#include <iomanip>\n#include <complex>\n#include <cassert>\n\n/*-----------------------*/\n//#define int long long\n#define INF 0x3f3f3f3f\n#define INF2 0x7f7f7f7f\nusing namespace std;\n/*-----------------------*/\n\nconst double pi = acos(-1.);\n\n//double squ(double x){\n// return x*x;\n//}\n//\n//struct Point{\n// double x, y;\n// Point(double x=0, double y=0) :x(x), y(y){ }\n//};\n//\n//typedef Point Vector;\n//\n//Vector operator + (Vector A, Vector B){ return Vector(A.x+B.x, A.y+B.y);}\n//\n//Vector operator - (Point A, Point B) { return Vector(A.x-B.x, A.y-B.y);}\n//\n//Vector operator * (Vector A, double p) { return Vector(A.x*p, A.y*p);}\n//\n//Vector operator / (Vector A, double p) { return Vector(A.x/p, A.y/p);}\n//\n//bool operator < (const Point& a, const Point& b){\n// return a.x < b.x || (a.x == b.x && a.y < b.y);\n//}\n//\nconst double eps = 1e-10;\nint dcmp(double x){\n if(fabs(x) < eps) return 0; else return x < 0 ? -1 : 1;\n}\n//\n//bool operator == (const Point& a, const Point& b){\n// return dcmp(a.x-b.x) == 0 && dcmp(a.y-b.y) == 0;\n//}\n//\n\n\n\n//\n//double Cross(Vector A, Vector B) { return A.x*B.y - A.y*B.x;}\n//double Area2(Point A, Point B, Point C) { return Cross(B-A, C-A);}\n//\n//Vector Rotate(Vector A, double rad){\n// return Vector(A.x*cos(rad)-A.y*sin(rad), A.x*sin(rad)+A.y*cos(rad));\n//}\n//\n////计算向量的单位法线。即左转90度，再把长度归一化。\n//Vector Normal(Vector A){\n// double L = Length(A);\n// return Vector(-A.y/L, A.x/L);\n//}\n\n\n\n\n\nusing int64 = long long;\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\nconst int64 infll = (1LL << 62) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\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}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\nnamespace geometry {\n using Real = double;\n const Real EPS = 1e-8;\n const Real PI = acos(static_cast< Real >(-1));\n\n inline int sign(const Real &r) {\n return r <= -EPS ? -1 : r >= EPS ? 1 : 0;\n }\n\n inline bool equals(const Real &a, const Real &b) {\n return sign(a - b) == 0;\n }\n}\n\nnamespace geometry {\n using Point = complex< Real >;\n\n istream &operator>>(istream &is, Point &p) {\n Real a, b;\n is >> a >> b;\n p = Point(a, b);\n return is;\n }\n\n ostream &operator<<(ostream &os, const Point &p) {\n return os << real(p) << \" \" << imag(p);\n }\n\n Point operator*(const Point &p, const Real &d) {\n return Point(real(p) * d, imag(p) * d);\n }\n\n // rotate point p counterclockwise by theta rad\n Point rotate(Real theta, const Point &p) {\n return Point(cos(theta) * real(p) - sin(theta) * imag(p), sin(theta) * real(p) + cos(theta) * imag(p));\n }\n\n Real cross(const Point &a, const Point &b) {\n return real(a) * imag(b) - imag(a) * real(b);\n }\n\n Real dot(const Point &a, const Point &b) {\n return real(a) * real(b) + imag(a) * imag(b);\n }\n\n bool compare_x(const Point &a, const Point &b) {\n return equals(real(a), real(b)) ? imag(a) < imag(b) : real(a) < real(b);\n }\n\n bool compare_y(const Point &a, const Point &b) {\n return equals(imag(a), imag(b)) ? real(a) < real(b) : imag(a) < imag(b);\n }\n\n using Points = vector< Point >;\n}\n\nnamespace geometry {\n struct Line {\n Point a, b;\n\n Line() = default;\n\n Line(const Point &a, const Point &b) : a(a), b(b) {}\n\n Line(const Real &A, const Real &B, const Real &C) { // Ax+By=C\n if(equals(A, 0)) {\n assert(!equals(B, 0));\n a = Point(0, C / B);\n b = Point(1, C / B);\n } else if(equals(B, 0)) {\n a = Point(C / A, 0);\n b = Point(C / A, 1);\n } else {\n a = Point(0, C / B);\n b = Point(C / A, 0);\n }\n }\n\n friend ostream &operator<<(ostream &os, Line &l) {\n return os << l.a << \" to \" << l.b;\n }\n\n friend istream &operator>>(istream &is, Line &l) {\n return is >> l.a >> l.b;\n }\n };\n\n using Lines = vector< Line >;\n}\n\nnamespace geometry {\n struct Segment : Line {\n Segment() = default;\n\n using Line::Line;\n };\n\n using Segments = vector< Segment >;\n}\n\nnamespace geometry {\n // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\n constexpr int COUNTER_CLOCKWISE = +1;\n constexpr int CLOCKWISE = -1;\n constexpr int ONLINE_BACK = +2; // c-a-b\n constexpr int ONLINE_FRONT = -2; // a-b-c\n constexpr int ON_SEGMENT = 0; // a-c-b\n int ccw(const Point &a, Point b, Point c) {\n b = b - a, c = c - a;\n if(sign(cross(b, c)) == +1) return COUNTER_CLOCKWISE;\n if(sign(cross(b, c)) == -1) return CLOCKWISE;\n if(sign(dot(b, c)) == -1) return ONLINE_BACK;\n if(norm(b) < norm(c)) return ONLINE_FRONT;\n return ON_SEGMENT;\n }\n}\n\nnamespace geometry {\n // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\n Point projection(const Line &l, const Point &p) {\n auto t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n }\n}\n\nnamespace geometry {\n Real distance_lp(const Line &l, const Point &p) {\n return abs(p - projection(l, p));\n }\n}\n\nnamespace geometry {\n // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n bool is_parallel(const Line &a, const Line &b) {\n return equals(cross(a.b - a.a, b.b - b.a), 0.0);\n }\n}\n\nnamespace geometry {\n bool is_intersect_ll(const Line &l, const Line &m) {\n Real A = cross(l.b - l.a, m.b - m.a);\n Real B = cross(l.b - l.a, l.b - m.a);\n if(equals(abs(A), 0) && equals(abs(B), 0)) return true;\n return !is_parallel(l, m);\n }\n}\n\nnamespace geometry {\n bool is_intersect_sp(const Segment &s, const Point &p) {\n return ccw(s.a, s.b, p) == ON_SEGMENT;\n }\n}\n\n\nnamespace geometry {\n Real distance_ll(const Line &l, const Line &m) {\n return is_intersect_ll(l, m) ? 0 : distance_lp(l, m.a);\n }\n}\n\nnamespace geometry {\n Real distance_sp(const Segment &s, const Point &p) {\n Point r = projection(s, p);\n if(is_intersect_sp(s, r)) return abs(r - p);\n return min(abs(s.a - p), abs(s.b - p));\n }\n}\n\nnamespace geometry {\n bool is_intersect_ss(const Segment &s, const Segment &t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n }\n}\n\n\nnamespace geometry {\n Real distance_ss(const Segment &a, const Segment &b) {\n if(is_intersect_ss(a, b)) return 0;\n return min({distance_sp(a, b.a), distance_sp(a, b.b), distance_sp(b, a.a), distance_sp(b, a.b)});\n }\n}\n\nusing namespace geometry;\n\nstruct Leg{\n double ang;\n int id;\n\n bool operator < (const Leg& o) const{\n return ang < o.ang;\n }\n};\n\ndouble squ(double x){\n return x*x;\n}\n\nstruct Circle{\n double x, y, r;\n double valid_ang;\n vector<Leg> v;\n};\nvector<Circle> circles;\nint top = 0;\nbool vis[1000050];\nint tot_vis;\npair<Point, Point> inter(Circle a, Circle b){\n\n double R = sqrt(squ(a.x-b.x) + squ(a.y-b.y));\n Point ans1 = Point(a.x+b.x, a.y+b.y)*0.5 + Point(b.x-a.x, b.y-a.y)*(squ(a.r) - squ(b.r))/(2*squ(R))\n + Point(b.y-a.y, a.x - b.x) *0.5 * sqrt(2*((squ(a.r)+squ(b.r))/squ(R)) - squ(squ(a.r) - squ(b.r))/squ(squ(R)) - 1);\n Point ans2 = Point(a.x+b.x, a.y+b.y)*0.5 + Point(b.x-a.x, b.y-a.y)*(squ(a.r) - squ(b.r))/(2*squ(R))\n - Point(b.y-a.y, a.x - b.x) *0.5 * sqrt(2*((squ(a.r)+squ(b.r))/squ(R)) - squ(squ(a.r) - squ(b.r))/squ(squ(R)) - 1);\n return make_pair(ans1, ans2);\n}\ndouble Dot(Point A, Point B) {return A.real()*B.real() + A.imag()*B.imag();}\ndouble Length(Point A) { return sqrt(Dot(A, A));}\ndouble Angle(Point A, Point B) { return acos(Dot(A, B) / Length(A) / Length(B));}\n\ndouble dir(Point A){\n if(A.imag() >= 0) return Angle(Point(1, 0), A);\n return 2*pi- Angle(Point(1, 0), A);\n}\n\n\n\nsigned main() {\n\n#ifdef LOCAL\n freopen(\"input.txt\", \"r\", stdin);\n freopen(\"output.txt\", \"w\", stdout);\n#endif\n\n\n int n;\n while(~scanf(\"%d\", &n) && n){\n circles.clear();\n top = 0;\n\n for(int i = 0; i<n; i++){\n double x, y, r; scanf(\"%lf%lf%lf\", &x, &y, &r);\n circles.push_back({x, y, r, 2 * pi});\n }\n\n for(int i = 0; i<n; i++){\n for(int j = 0; j<n; j++){\n if(i == j)continue;\n Circle& c1 = circles[i];\n Circle& c2 = circles[j];\n if(dcmp(squ(c1.x-c2.x)+squ(c1.y-c2.y) -squ(c1.r+c2.r)) >= 0) continue;\n if(dcmp(squ(c1.x-c2.x)+squ(c1.y-c2.y) -squ(c1.r-c2.r)) <= 0){\n if(dcmp(c1.r - c2.r) > 0){\n c2.valid_ang = 0;\n }else{\n c1.valid_ang = 0;\n }\n continue;\n }\n\n Point o1(c1.x, c1.y);\n Point o2(c2.x, c2.y);\n\n pair<Point, Point> ppp = inter(c1, c2);\n\n Point p1 = ppp.first;\n Point p2 = ppp.second;\n\n\n Point A = o1 + Point(o2.real()-o1.real(), o2.imag()-o1.imag()) / sqrt(squ(o2.real()-o1.real()) + squ(o2.imag()-o1.imag())) * c1.r;\n Point B = o1 - Point(o2.real()-o1.real(), o2.imag()-o1.imag()) / sqrt(squ(o2.real()-o1.real()) + squ(o2.imag()-o1.imag())) * c1.r;\n double len1 = squ(A.real()-o2.real()) + squ(A.imag()-o2.imag());\n double len2 = squ(B.real()-o2.real()) + squ(B.imag()-o2.imag());\n if(dcmp(len1 - len2) < 0){\n swap(len1,len2);\n swap(A, B);\n }\n Point v1 = B-o1;\n Point v2 = p1-o1;\n bool flag = dcmp(Angle(v1, v2) - pi/2.) <= 0;\n\n\n double big_dir = dir(p1 - o1);\n double small_dir = dir(p2 - o1);\n if(dcmp(big_dir-small_dir) < 0) swap(big_dir, small_dir);\n double small_diff = abs(big_dir - small_dir);\n double big_diff = 2*pi-small_diff;\n if(dcmp(small_diff - big_diff) > 0) swap(small_diff, big_diff);\n\n bool flag_zero = dcmp(2*pi-big_dir+small_dir - pi) < 0;\n\n if(flag && flag_zero || !flag && !flag_zero){\n c1.v.push_back(Leg{big_dir, top});\n c1.v.push_back(Leg{2*pi-1e-10, top});\n top++;\n c1.v.push_back(Leg{0+1e-10, top});\n c1.v.push_back(Leg{small_dir, top});\n top++;\n }else{\n c1.v.push_back(Leg{small_dir, top});\n c1.v.push_back(Leg{big_dir, top});\n top++;\n }\n\n\n }\n }\n\n for(int i = 0; i<n; i++){\n memset(vis, 0, sizeof(vis));\n tot_vis = 0;\n\n sort(circles[i].v.begin(), circles[i].v.end());\n\n double last_ang = -1.;\n for(Leg const& leg : circles[i].v){\n if(vis[leg.id]){\n vis[leg.id] = false;\n tot_vis--;\n if(tot_vis == 0){\n circles[i].valid_ang -= leg.ang-last_ang;\n }\n }else{\n if(tot_vis == 0){\n last_ang = leg.ang;\n }\n vis[leg.id] = true;\n tot_vis++;\n }\n }\n\n }\n\n double ans = 0;\n for(int i = 0; i<n; i++){\n Circle &c = circles[i];\n if(dcmp(c.valid_ang) <= 0) continue;\n// cout << \"eq\" << i+1 << \": \" << \"rad= \" << c.valid_ang << \" \" << \"c= \" << c.r*c.valid_ang << endl;\n ans += c.r*c.valid_ang;\n }\n printf(\"%.12lf\\n\", ans);\n\n\n\n }\n\n\n return 0;\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4800,
"score_of_the_acc": -0.0753,
"final_rank": 12
},
{
"submission_id": "aoj_1047_3706429",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n// #define int ll\nusing PII = pair<ll, ll>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n\ntemplate<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\ntemplate<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\n\ntemplate<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }\ntemplate<typename T,typename... Ts>\nauto make_v(size_t a,Ts... ts) {\n return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\n}\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value==0>::type\nfill_v(T &t, const V &v) { t=v; }\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type\nfill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }\n\ntemplate<class S,class T>\nostream &operator <<(ostream& out,const pair<S,T>& a) {\n out<<'('<<a.first<<','<<a.second<<')'; return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out,const vector<T>& a){\n out<<'[';\n for(const T &i: a) out<<i<<',';\n out<<']';\n return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out, const set<T>& a) {\n out<<'{';\n for(const T &i: a) out<<i<<',';\n out<<'}';\n return out;\n}\ntemplate<class T, class S>\nostream &operator <<(ostream& out, const map<T,S>& a) {\n out<<'{';\n for(auto &i: a) out<<i<<',';\n out<<'}';\n return out;\n}\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL\nconst int INF = 1<<30;\nconst ll LLINF = 1LL<<60;\nconst ll MOD = 1000000007;\n\nusing R = long double; // Rにmint渡せるようにする\nusing P = complex<R>;\nusing L = pair<P,P>;\nusing G = vector<P>;\nstruct C {\n P c; R r;\n C() {}\n C(const P &a, const R &b) : c(a), r(b) {}\n};\nstruct S : public L {\n S() {}\n S(const P &a, const P &b) : L(a,b) {}\n};\n\nconst R EPS = 1e-8;\nconst R PI = atan(1)*4;\n\ninline int sgn(const R& r) { return (r>EPS) - (r<-EPS); }\ninline R dot(const P& a, const P& b) {\n return real(a)*real(b) + imag(a)*imag(b);\n}\ninline R det(const P& a, const P& b) {\n return real(a)*imag(b) - imag(a)*real(b);\n}\ninline P vec(const L& l) {return l.second - l.first;}\nnamespace std {\n\tbool operator < (const P& a, const P& b) {\n\t\treturn sgn(real(a-b)) ? real(a-b) < 0 : sgn(imag(a-b)) < 0;\n\t}\n\tbool operator == (const P& a, const P& b) {\n\t\treturn sgn(real(a-b)) == 0 && sgn(imag(a-b)) == 0;\n\t}\n bool cmp_y (const P& a, const P& b) {\n return sgn(imag(a-b)) ? imag(a-b) < 0 : sgn(real(a-b)) < 0;\n }\n}\n\n// P,L,Sについて入力\ninline istream& operator>>(istream& is, P& p) {\n R x, y;\n is >> x >> y;\n p = P(x, y);\n return is;\n}\ninline istream& operator>>(istream& is, L& l) {\n P a, b;\n is >> a >> b;\n l = L(a, b);\n return is;\n}\ninline istream& operator>>(istream& is, S& s) {\n P a, b;\n is >> a >> b;\n s = S(a, b);\n return is;\n}\n\n// 線分abから見たcの位置\nenum CCW{LEFT=1, RIGHT=2, BACK=4, FRONT=8, ON_SEG=16};\nint ccw(P a, P b, P c) {\n\tP p = (c-a)/(b-a);\n\tif(sgn(imag(p)) > 0) return LEFT;\n\tif(sgn(imag(p)) < 0) return RIGHT;\n\tif(sgn(real(p)) < 0) return BACK;\n\tif(sgn(real(p)-1) > 0) return FRONT;\n\treturn ON_SEG;\n}\n\nint intersect(const C& a, const C& b) {\n\tR dist = sqrt(norm(a.c-b.c)), r1 = a.r + b.r, r2 = abs(a.r - b.r);\n\tif(sgn(r1-dist) < 0) return 4;\t// 円が離れている\n\tif(sgn(r1-dist) == 0) return 3;\t// 外接\n\tif(sgn(r2-dist) < 0 && sgn(dist-r1) < 0) return 2; // 交差\n\tif(sgn(dist-r2) == 0) return 1; // 内接\n\treturn 0;\t// 内部に含む\n}\n\nvector<P> crosspoint(C a, C b) {\n\tR d = abs(a.c-b.c);\n\tR t = (a.r*a.r-b.r*b.r+d*d)/2/d, h = sqrt(a.r*a.r-t*t);\n\tP m = t/abs(b.c-a.c)*(b.c-a.c)+a.c;\n auto n_vector = [&](P p) -> P { return P(-p.imag(), p.real())/abs(p); };\n\tP n = n_vector(a.c-b.c);\n\tvector<P> ret(2, m);\n\tret[0] -= h*n; ret[1] += h*n;\n\tif(ret[1] < ret[0]) swap(ret[0], ret[1]);\n\treturn ret;\n}\n\nsigned main(void)\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while(1) {\n ll n;\n cin >> n;\n if(!n) break;\n vector<C> cir(n);\n REP(i, n) cin >> cir[i].c >> cir[i].r;\n\n R ans = 0;\n REP(i, n) {\n bool flag = true;\n vector<pair<R,P>> v;\n REP(j, n) {\n if(i == j) continue;\n if(intersect(cir[i], cir[j]) <= 1 && cir[i].r < cir[j].r) {\n flag = false;\n break;\n } else if(intersect(cir[i], cir[j]) == 2) {\n auto vp = crosspoint(cir[i], cir[j]);\n for(auto p: vp) {\n R ang = atan2(cir[i].c.imag()-p.imag(), cir[i].c.real()-p.real());\n v.push_back({ang, p});\n }\n }\n }\n if(!flag) continue;\n sort(ALL(v));\n // cout << \"i=\" << i << \" \" << v << endl;\n if(v.size() == 0) ans += 2*PI*cir[i].r;\n REP(j, v.size()) {\n // 弧v[j],v[j+1]が他の円に含まれているか\n R diff;\n if(j+1 == (ll)v.size()) diff = v[0].first-v[j].first+2*PI;\n else diff = v[j+1].first-v[j].first;\n R arg = v[j].first + diff/2;\n P m = {cir[i].c.real() + cos(arg+PI) * cir[i].r,\n cir[i].c.imag() + sin(arg+PI) * cir[i].r};\n // cout << arg << \" \" << cos(arg+PI) << \" \" << sin(arg+PI) << endl;\n bool flag = true;\n REP(k, n) {\n if(i == k) continue;\n if(sgn(abs(cir[k].c - m) - cir[k].r) < 0) {\n flag = false;\n break;\n }\n }\n // cout << a << \" \" << b << \" \" << diff << \" \" << arg << \" \" << m << \" \" << flag << endl;\n if(flag) ans += cir[i].r * diff;\n }\n }\n\n cout << fixed << setprecision(9) << ans << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3596,
"score_of_the_acc": -0.0564,
"final_rank": 11
},
{
"submission_id": "aoj_1047_3680006",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(int i=0,i##_cond=(n);i<i##_cond;++i)\n#define all(a) (a).begin(),(a).end()\n\nconst double EPS = 1e-8;\n// 点\ntypedef complex<double> P;\nnamespace std {\n bool isnan(const P&p){\n return isnan(p.real()) or isnan(p.imag());\n }\n}\n\n// 円\nstruct C {\n P p; double r;\n C(const P &p_, double r_) : p(p_), r(r_) { }\n};\n\n// 点同士\ndouble distancePP(const P &p, const P &q){\n return abs(p-q);\n}\n// 円同士の交点\n// 1点または2点で交わることを要求する\n// 交わらない時はnanを返す\npair<P, P> crosspointCC(const C& c1, const C& c2) {\n double d = abs(c1.p - c2.p);\n double rc = (d*d + c1.r*c1.r - c2.r*c2.r) / (2*d);\n double rs = sqrt(c1.r*c1.r - rc*rc);\n P diff = (c2.p - c1.p) / d;\n return make_pair(c1.p + diff * P(rc, rs), c1.p + diff * P(rc, -rs));\n}\n\n// 入力\nint n;\nvector<C> cs;\n\n// 点が全ての円に含まれないか\nbool notInclude(const P &p){\n bool f = true;\n rep(j,n)\n if(distancePP(cs[j].p,p) + EPS < cs[j].r) // 内部にある\n f = false;\n return f;\n}\n\n// i番目の円について\ndouble calc(int i){\n double res = 0;\n\n // 交点を列挙\n vector<P> ps; // 交点\n rep(j,n){\n if(i == j) continue;\n\n auto pp = crosspointCC(cs[i],cs[j]);\n if(not isnan(pp.first))\n ps.push_back(pp.first);\n if((not isnan(pp.second)) and pp.first != pp.second)\n ps.push_back(pp.second);\n }\n\n // 半時計回りにソート\n auto g = [&](const P &p, const P &q){\n P tmpp = p - cs[i].p, tmpq = q - cs[i].p;\n return arg(tmpp) < arg(tmpq);\n };\n sort(all(ps),g);\n\n // 各区間がカウントされるかチェック\n if(ps.size() == 0){\n // 交点がなければどこでもいい\n P tmp{cs[i].p.real(), cs[i].p.imag()+cs[i].r};\n if(notInclude(tmp))\n res += 2 * M_PI * cs[i].r;\n \n }else if(ps.size() == 1){\n // どこかで接していたら反対側をとる\n P op = ps[0] - P(2,0)*(ps[0]-cs[i].p);\n if(notInclude(op))\n res += 2 * M_PI * cs[i].r;\n \n }else{\n rep(k,ps.size()){\n P a = ps[k]-cs[i].p, b = ps[(k+1)%ps.size()]-cs[i].p;\n\n double midd = (arg(a)+arg(b))/2;\n P midp = cs[i].p + P(cs[i].r*cos(midd),cs[i].r*sin(midd));\n if(arg(a) > arg(b)) \n\tmidp = midp - P(2,0)*(midp-cs[i].p);\n\n if(notInclude(midp)){\n\tif(arg(a) < arg(b)){\n\t double tmp = (arg(b)-arg(a)) * cs[i].r;\n\t res += tmp;\n\t}else{\n\t double tmp = (2*M_PI + arg(b)-arg(a)) * cs[i].r;\n\t res += tmp;\n\t}\n }\n }\n }\n \n return res;\n}\n\nsigned main(){\n while(cin >> n, n){\n cs.clear();\n rep(i,n){\n double x,y,r; cin >> x >> y >> r;\n P tmp(x,y);\n cs.emplace_back(tmp,r);\n }\n double ans = 0;\n rep(i,n){\n double tmp = calc(i);\n ans += tmp;\n }\n printf(\"%.10lf\\n\",ans);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3524,
"score_of_the_acc": -0.0553,
"final_rank": 10
},
{
"submission_id": "aoj_1047_1974953",
"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\n/* ??????????????¬ */\n\n#include <complex>\n\ntypedef complex<ld> Point;\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define all(x) (x).begin(),(x).end()\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 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\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:??????\n//c:????????§??????\n//???????????´?????????????????¢?????????????±??????????\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* ??? */\n\n// ?????¨????????????\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n//???????????????????????????\n/* 0 => out\n1 => on\n2 => in*/\nint is_in_Circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n//???lc??????rc??????????????????\n/*0 => out\n1 => on\n2 => in*/\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// ?????¨??´????????????\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// ?????¨??????????????¢\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), 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//??????????????????????????¢???\nld two_Circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* ????§???¢ */\n\ntypedef vector<Point> Polygon;\n\n// ??¢???\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/*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\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//??????????????????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\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) != 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\n/* ??¢??¬??????????????? */\nvoid add_Point(vector<Point> &ps, const Point p) {\n\tfor (Point q : ps) if (abs(q - p) < eps) return;\n\tps.push_back(p);\n}\n\ntypedef int Weight;\nstruct edge {\n\tint src, dst;\n\tWeight weight;\n\tedge(int src, int dst, Weight weight) :\n\t\tsrc(src), dst(dst), weight(weight) { }\n};\n\ntypedef vector<edge> edges;\ntypedef vector<edges> graph;\n\nvoid add_edge(graph &g, const int from, const int to, const Weight& weight) {\n\tg[from].push_back(edge{ from, to, weight });\n}\n\ngraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\n\tint n = p.size(), m = s.size();\n\tgraph g(n);\n\trep(i, m) {\n\t\tvector<pair<ld, int>> vec;\n\t\trep(j, n) if (isis_sp(s[i], p[j]))\n\t\t\tvec.emplace_back(abs(s[i].a - p[j]), j);\n\t\tsort(all(vec));\n\t\trep(j, vec.size() - 1) {\n\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n\t\t\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\n\t\t}\n\t}\n\treturn g;\n}\ngraph sennbunn_arrangement(const vector<Line>&s) {\n\tvector<Point>crss;\n\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\n\t\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\n\t\t\tif (isis_ss(s[i], s[j])) {\n\t\t\t\tcrss.push_back(is_ll2(s[i], s[j])[0]);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\n\t\tcrss.push_back(s[i][0]);\n\t\tcrss.push_back(s[i][1]);\n\t}\nsort(crss.begin(), crss.end());\ncrss.erase(unique(crss.begin(), crss.end()), crss.end());\n\treturn segment_arrangement(s, crss);\n}\n\ngraph Circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\n\tint n = p.size(), m = c.size();\n\tgraph g(n);\n\trep(i, m) {\n\t\tvector<pair<ld, int>> vec;\n\t\trep(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\n\t\t\tvec.emplace_back(arg(c[i].p - p[j]), j);\n\t\tsort(all(vec));\n\t\trep(j, vec.size() - 1) {\n\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n\t\t\tld angle = vec[j + 1].first - vec[j].first;\n\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n\t\t}\n\t\tif (vec.size() >= 2) {\n\t\t\tint from = vec.back().second, to = vec.front().first;\n\t\t\tld angle = vec.front().first - vec.back().first;\n\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n\t\t}\n\t}\n\treturn g;\n}\n\nint main() {\n\tcout << setprecision(11) << fixed;\n\twhile (1) {\n\t\tint N; cin >> N;\n\t\tif (!N)break;\n\t\tvector<Circle>cs;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld x, y, r; cin >> x >> y >> r;\n\t\t\tcs.push_back(Circle(Point(x, y), r));\n\t\t}\n\t\tvector<vector<ld>>contacts(N);\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)continue;\n\t\t\t\telse {\n\t\t\t\t\tvector<Point>cons = is_cc(cs[i], cs[j]);\n\t\t\t\t\tfor (auto con : cons) {\n\t\t\t\t\t\tPoint avec = con - cs[i].p;\n\t\t\t\t\t\tcontacts[i].push_back(arg(avec));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (auto &contact : contacts) {\n\t\t\tsort(contact.begin(), contact.end());\n\t\t}\n\n\n\t\tld ans = 0;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tvector<ld>contact = contacts[i];\n\t\t\tif(contact.empty()||contact.size()==1){\n\t\t\t\tbool flag = true;\n\t\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\t\tif (i == j)continue;\n\t\t\t\t\telse {\n\t\t\t\t\t\tif (Circle_in_Circle(cs[i], cs[j]))flag = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (flag)ans += cs[i].r*2*pi;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tfor (int j = 0; j < contact.size(); ++j) {\n\t\t\t\t\tld amid = j == contact.size() - 1 ? (2*pi+contact[0] + contact[contact.size() - 1])/2 : (contact[j + 1] + contact[j])/2;\n\t\t\t\t\tld sa= j == contact.size() - 1 ? 2*pi+contact[0] - contact[contact.size() - 1] : contact[j + 1] - contact[j];\n\t\t\t\t\tPoint avec(cs[i].p.real() + cs[i].r*cos(amid), cs[i].p.imag() + cs[i].r*sin(amid));\n\t\t\t\t\t\n\t\t\t\t\tbool flag = true;\n\t\t\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\t\t\tif (i == j)continue;\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tif (Circle_in_Circle(cs[i], cs[j]))flag = false;\n\t\t\t\t\t\t\tif (is_in_Circle(cs[j], avec))flag = false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (flag)ans += cs[i].r*sa;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3584,
"score_of_the_acc": -1.0562,
"final_rank": 15
},
{
"submission_id": "aoj_1047_1833262",
"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()\n#define shosu(x) fixed<<setprecision(x)\nconst double PI=acos(-1);\nconst double EPS=1e-10;\nconst double inf=1e8;\nusing namespace std;\n#define shosu(x) fixed<<setprecision(x)\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}\nP turn2(P p,double t){\n\treturn p*exp(P(.0,t));\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}\nint main(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tvector<C>c;\n\t\trep(i,n){\n\t\t\tdouble a,b,d;\n\t\t\tcin>>a>>b>>d;\n\t\t\tc.pb(C(P(a,b),d));\n\t\t}\n\t\tvector<C>tmp;\n\t\trep(i,n){\n\t\t\tbool h=true;\n\t\t\trep(j,n)if(i!=j&&abs(c[i].c-c[j].c)<c[j].r-c[i].r)\n\t\t\t\th=false;\n\t\t\tif(h)tmp.pb(c[i]);\n\t\t}\n\t\tc=tmp;\n\t\tn=c.size();\n\t\tdouble out=0;\n\t\trep(i,n){\n\t\t\tG g;\n\t\t\trep(j,n)if(i!=j&&abs(c[i].c-c[j].c)<c[i].r+c[j].r){\n\t\t\t\tL l=crosspointCC(c[i],c[j]);\n\t\t\t\tg.pb(l[0]);\n\t\t\t\tif(l[0]!=l[1])g.pb(l[1]);\n\t\t\t}\n\t\t\tif(g.size()==0){\n\t\t\t\tout+=2*PI*c[i].r;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\trep(j,g.size()-1)rep(k,g.size()-j-1)if(arg(g[k]-c[i].c)>arg(g[k+1]-c[i].c)){\n\t\t\t\tswap(g[k+1],g[k]);\n\t\t\t}\n\t\t\trep(j,g.size()){\n\t\t\t\tdouble t=arg(g[(j+1)%g.size()]-c[i].c)+arg(g[j]-c[i].c);\n\t\t\t\tP p=c[i].c+turn2(P(c[i].r,0),t/2+(j==g.size()-1?PI:0));\n\t\t\t\tbool h=true;\n\t\t\t\trep(k,n)if(i!=k&&abs(c[k].c-p)<c[k].r){\n\t\t\t\t\th=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tt=abs(arg(g[(j+1)%g.size()]-c[i].c)-arg(g[j]-c[i].c));\n\t\t\t\tif(j==g.size()-1)t=2*PI-t;\n\t\t\t\tif(h)out+=2*c[i].r*t/2;\n//\t\t\t\tcout<<i<<\" \"<<j<<\" \"<<h<<endl;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%.9f\\n\",out);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1364,
"score_of_the_acc": -0.0214,
"final_rank": 6
},
{
"submission_id": "aoj_1047_1018429",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<complex>\n#include<algorithm>\n\nusing namespace std;\n\ntypedef complex<double> P;\nconst double PI=acos(0)*2;\n\ndouble normalize(double d,double M=2*PI){\n return fmod(fmod(d,M)+M,M);\n}\n\nbool contains(P a,double ra,P b,double rb=0){\n return abs(a-b)+rb<ra+1e-9;\n}\n \n//circle,circle\nvector<P> intersection(P a,double ra,P b,double rb){\n double c=abs(b-a);\n double costheta=-(rb*rb-ra*ra-c*c)/2/ra/c;\n if(-1<=costheta&&costheta<=1){\n double theta=acos(costheta);\n double ang=arg(b-a);\n return {a+polar(ra,ang+theta),a+polar(ra,ang-theta)};\n }else{\n return {};\n }\n}\n\n\nint main(){\n for(int n;cin>>n,n;){\n P p[100];\n double r[100];\n for(int i=0;i<n;i++){\n double x,y;\n cin>>x>>y>>r[i];\n p[i]=P(x,y);\n }\n double ans=0;\n for(int i=0;i<n;i++){\n vector<double> angs;\n // cout<<\"---\"<<i<<endl;\n for(int j=0;j<n;j++){\n\tif(i!=j){\n\t if(contains(p[j],r[j],p[i],r[i]))goto next;\n\t auto is=intersection(p[i],r[i],p[j],r[j]);\n\t for(auto e:is){\n\t angs.push_back(arg(e-p[i]));\n\t }\n\t}\n }\n {\n\tsort(begin(angs),end(angs));\n\tangs.erase(unique(begin(angs),end(angs)),end(angs));\n\tdouble c=r[i]*4*acos(0);\n\tif(angs.size()<2){\n\t ans+=c;\n\t}else{\n\t for(int j=0;j<angs.size();j++){\n\t double rng=normalize(angs[(j+1)%angs.size()]-angs[j]);\n\t P m=p[i]+polar(r[i],angs[j]+rng/2);\n\t bool f=false;\n\t for(int k=0;k<n;k++){\n\t f|=i!=k&&contains(p[k],r[k],m);\n\t }\n\t if(!f){\n\t ans+=rng*r[i];\n\t }\n\t }\n\t}\n }\n next:\n ;\n }\n cout.precision(9);\n cout<<fixed<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1396,
"score_of_the_acc": -0.0219,
"final_rank": 9
},
{
"submission_id": "aoj_1047_902250",
"code_snippet": "#include<cstdio>\n#include<complex>\n#include<vector>\n#include<algorithm>\n#include<cmath>\n#include<map>\n\n#define EPS (1e-8)\n#define EQ(a,b) (abs((a)-(b)) < EPS)\n#define fs first\n#define sc second\n#define pb push_back\n#define sz size()\n#define all(a) (a).begin(),(a).end()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n\nusing namespace std;\n\ntypedef complex<double> P;\ntypedef pair<P,P> L;\ntypedef pair<P,double> C;\n\nconst double PI = acos(-1);\n\nP unit(P p){return p / abs(p);}\ndouble dot(P x,P y){return real(conj(x)*y);}\ndouble cross(P x,P y){return imag(conj(x)*y);}\n\nP rotate(P v,double s){\n return P(real(v)*cos(s) - imag(v)*sin(s), real(v)*sin(s) + imag(v)*cos(s) );\n}\n\ndouble arg(P a,P b,P c){return acos(dot(b-a,c-a)/(abs(b-a)*abs(c-a)));}\ndouble arg(double a,double b,double c){return acos( (b*b+c*c-a*a)/(2*b*c) );}\n\nbool in_cir(C c,P x){return (abs(x-c.fs) +EPS < c.sc);}\nbool on_cir(C c,P x){return EQ(abs(x-c.fs),c.sc);}\n\nint cpr(C a,C b){\n double d = abs(a.fs-b.fs);\n if(a.sc+b.sc + EPS < d)return -1;\n if(b.sc+d + EPS < a.sc)return 1;\n if(a.sc+d + EPS < b.sc)return 2;\n if(abs(a.sc+b.sc - d) < EPS)return -3;\n if(abs(b.sc+d - a.sc) < EPS)return 3;\n if(abs(a.sc+d - b.sc) < EPS)return 4;\n return 0;\n}\n\nvector<P> cp_cir_to_cir(C a, C b){\n vector<P> v;\n int pos = cpr(a,b);\n if(pos==0){\n double s = arg(b.sc,abs(b.fs-a.fs),a.sc);\n P x = a.sc * unit(b.fs - a.fs);\n v.pb(a.fs + rotate(x,s));\n v.pb(a.fs + rotate(x,-s));\n }else if(abs(pos) >= 3){\n v.pb(a.fs + a.sc * unit(b.fs-a.fs));\n }\n return v;\n}\n\ndouble angle(P p, C c){\n P O = c.fs, A = P(c.fs.real(),c.fs.imag()+c.sc), B = p;\n double res = arg(O,A,B);\n if(cross(A-O,B-O)<-EPS)res = 2*PI-res;\n return res;\n}\n\nint n;\nC c[110];\ndouble x,y,r;\n\nint main(){\n while(scanf(\"%d\",&n),n){\n rep(i,n){\n scanf(\"%lf%lf%lf\",&x,&y,&r);\n c[i] = C(P(x,y),r);\n }\n\n vector<double> cp_list[110];\n rep(i,n){\n FOR(j,i+1,n){\n\tvector<P> p = cp_cir_to_cir(c[i],c[j]);\n\tif((int)p.sz==2){\n\t rep(k,2)cp_list[i].pb(angle(p[k],c[i]));\n\t rep(k,2)cp_list[j].pb(angle(p[k],c[j]));\n\t}\n }\n }\n\n rep(i,n){\n sort(all(cp_list[i]));\n rep(j,(int)cp_list[i].sz-1){\n\tif(EQ(cp_list[i][j],cp_list[i][j+1])){\n\t cp_list[i].erase(cp_list[i].begin()+j);\n\t j--;\n\t}\n }\n }\n\n double ans = 0;\n rep(i,n){\n if(cp_list[i].empty()){\n\tbool f = true;\n\trep(j,n){\n\t if(i==j)continue;\n\t if(in_cir(c[j],c[i].fs) && c[i].sc < c[j].sc)f = false;\n\t}\n\tif(f)ans += 2*PI*c[i].sc;\n }else{\n\trep(j,cp_list[i].sz){\n\t double s;\n\t if(j+1<(int)cp_list[i].sz)s = (cp_list[i][j]+cp_list[i][j+1])/2;\n\t else s = (cp_list[i][j]+cp_list[i][0]+2*PI)/2;\n\n\t P p = rotate(P(0,c[i].sc),s) + c[i].fs;\n\t bool f = true;\n\t rep(k,n){\n\t if(i==k)continue;\n\t if(in_cir(c[k],p))f = false;\n\t }\n\t double seta = cp_list[i][(j+1)%cp_list[i].sz]-cp_list[i][j];\n\t if(seta<0)seta += 2*PI;\n\t if(f)ans += seta*c[i].sc;\n\t}\n }\n }\n printf(\"%.9lf\\n\",ans);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.0186,
"final_rank": 4
},
{
"submission_id": "aoj_1047_902249",
"code_snippet": "#include<iostream>\n#include<complex>\n#include<vector>\n#include<algorithm>\n#include<cmath>\n#include<map>\n#include<iomanip>\n\n#define EPS (1e-8)\n#define EQ(a,b) (abs((a)-(b)) < EPS)\n#define fs first\n#define sc second\n#define pb push_back\n#define sz size()\n#define all(a) (a).begin(),(a).end()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n\nusing namespace std;\n\ntypedef complex<double> P;\ntypedef pair<P,P> L;\ntypedef pair<P,double> C;\n\nconst double PI = acos(-1);\n\nP unit(P p){return p / abs(p);}\ndouble dot(P x,P y){return real(conj(x)*y);}\ndouble cross(P x,P y){return imag(conj(x)*y);}\n\nP rotate(P v,double s){\n return P(real(v)*cos(s) - imag(v)*sin(s), real(v)*sin(s) + imag(v)*cos(s) );\n}\n\ndouble arg(P a,P b,P c){return acos(dot(b-a,c-a)/(abs(b-a)*abs(c-a)));}\ndouble arg(double a,double b,double c){return acos( (b*b+c*c-a*a)/(2*b*c) );}\n\nbool in_cir(C c,P x){return (abs(x-c.fs) +EPS < c.sc);}\nbool on_cir(C c,P x){return EQ(abs(x-c.fs),c.sc);}\n\nint cpr(C a,C b){\n double d = abs(a.fs-b.fs);\n if(a.sc+b.sc + EPS < d)return -1;\n if(b.sc+d + EPS < a.sc)return 1;\n if(a.sc+d + EPS < b.sc)return 2;\n if(abs(a.sc+b.sc - d) < EPS)return -3;\n if(abs(b.sc+d - a.sc) < EPS)return 3;\n if(abs(a.sc+d - b.sc) < EPS)return 4;\n return 0;\n}\n\nvector<P> cp_cir_to_cir(C a, C b){\n vector<P> v;\n int pos = cpr(a,b);\n if(pos==0){\n double s = arg(b.sc,abs(b.fs-a.fs),a.sc);\n P x = a.sc * unit(b.fs - a.fs);\n v.pb(a.fs + rotate(x,s));\n v.pb(a.fs + rotate(x,-s));\n }else if(abs(pos) >= 3){\n v.pb(a.fs + a.sc * unit(b.fs-a.fs));\n }\n return v;\n}\n\ndouble angle(P p, C c){\n P O = c.fs, A = P(c.fs.real(),c.fs.imag()+c.sc), B = p;\n double res = arg(O,A,B);\n if(cross(A-O,B-O)<-EPS)res = 2*PI-res;\n return res;\n}\n\nint n;\nC c[110];\ndouble x,y,r;\n\nint main(){\n while(cin>>n,n){\n rep(i,n){\n cin >> x >> y >> r;\n c[i] = C(P(x,y),r);\n }\n\n vector<double> cp_list[110];\n rep(i,n){\n FOR(j,i+1,n){\n\tvector<P> p = cp_cir_to_cir(c[i],c[j]);\n\tif((int)p.sz==2){\n\t rep(k,2)cp_list[i].pb(angle(p[k],c[i]));\n\t rep(k,2)cp_list[j].pb(angle(p[k],c[j]));\n\t}\n }\n }\n\n rep(i,n){\n sort(all(cp_list[i]));\n rep(j,(int)cp_list[i].sz-1){\n\tif(EQ(cp_list[i][j],cp_list[i][j+1])){\n\t cp_list[i].erase(cp_list[i].begin()+j);\n\t j--;\n\t}\n }\n }\n\n double ans = 0;\n rep(i,n){\n if(cp_list[i].empty()){\n\tbool f = true;\n\trep(j,n){\n\t if(i==j)continue;\n\t if(in_cir(c[j],c[i].fs) && c[i].sc < c[j].sc)f = false;\n\t}\n\tif(f)ans += 2*PI*c[i].sc;\n }else{\n\trep(j,cp_list[i].sz){\n\t double s;\n\t if(j+1<(int)cp_list[i].sz)s = (cp_list[i][j]+cp_list[i][j+1])/2;\n\t else s = (cp_list[i][j]+cp_list[i][0]+2*PI)/2;\n\n\t P p = rotate(P(0,c[i].sc),s) + c[i].fs;\n\t bool f = true;\n\t rep(k,n){\n\t if(i==k)continue;\n\t if(in_cir(c[k],p))f = false;\n\t }\n\t double seta = cp_list[i][(j+1)%cp_list[i].sz]-cp_list[i][j];\n\t if(seta<0)seta += 2*PI;\n\t if(f)ans += seta*c[i].sc;\n\t}\n }\n }\n cout << fixed << setprecision(9) << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1388,
"score_of_the_acc": -0.0218,
"final_rank": 7
},
{
"submission_id": "aoj_1047_902243",
"code_snippet": "#include<iostream>\n#include<complex>\n#include<vector>\n#include<algorithm>\n#include<cmath>\n#include<map>\n#include<list>\n#include<iomanip>\n\n#define EPS (1e-8)\n#define EQ(a,b) (abs((a)-(b)) < EPS)\n#define fs first\n#define sc second\n#define pb push_back\n#define sz size()\n#define all(a) (a).begin(),(a).end()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n\nusing namespace std;\n\ntypedef complex<double> P;\ntypedef pair<P,P> L;\ntypedef pair<P,double> C;\n\nconst double PI = acos(-1);\n\n//for vector\nP unit(P p){return p / abs(p);}\n\npair<P,P> norm(P p){return make_pair(p*P(0,1),p*P(0,-1));}\n\ndouble dot(P x,P y){return real(conj(x)*y);}\n\ndouble cross(P x,P y){return imag(conj(x)*y);}\n\n//rotate a point counter-clockwise on the origin\nP rotate(P v,double s){\n return P(real(v)*cos(s) - imag(v)*sin(s), real(v)*sin(s) + imag(v)*cos(s) );\n}\n\n//return seta A\ndouble arg(P a,P b,P c){return acos(dot(b-a,c-a)/(abs(b-a)*abs(c-a)));}\ndouble arg(double a,double b,double c){return acos( (b*b+c*c-a*a)/(2*b*c) );}\n\n//for circle\n\nbool in_cir(C c,P x){return (abs(x-c.fs) +EPS < c.sc);}\nbool on_cir(C c,P x){return EQ(abs(x-c.fs),c.sc);}\n\n//circle position relation\nint cpr(C a,C b){\n double d = abs(a.fs-b.fs);\n if(a.sc+b.sc + EPS < d)return -1; //no cross point (outside)\n if(b.sc+d + EPS < a.sc)return 1; //no cross point (inside,B in A)\n if(a.sc+d + EPS < b.sc)return 2; //no cross point (inside,A in B)\n if(abs(a.sc+b.sc - d) < EPS)return -3; //one cross point (outside)\n if(abs(b.sc+d - a.sc) < EPS)return 3; //one cross point (inside,B in A)\n if(abs(a.sc+d - b.sc) < EPS)return 4; //one cross point (inside,A in B)\n return 0; //two cross point\n}\n\nvector<P> cp_cir_to_cir(C a, C b){\n vector<P> v;\n int pos = cpr(a,b);\n if(pos==0){\n double s = arg(b.sc,abs(b.fs-a.fs),a.sc);\n P x = a.sc * unit(b.fs - a.fs);\n v.pb(a.fs + rotate(x,s));\n v.pb(a.fs + rotate(x,-s));\n }else if(abs(pos) >= 3){\n v.pb(a.fs + a.sc * unit(b.fs-a.fs));\n }\n return v;\n}\n\ndouble angle(P p, C c){\n P O = c.fs, A = P(c.fs.real(),c.fs.imag()+c.sc), B = p;\n double res = arg(O,A,B);\n if(cross(A-O,B-O)<-EPS)res = 2*PI-res;\n return res;\n}\n\nint n;\nC c[110];\ndouble x,y,r;\n\nint main(){\n while(cin>>n,n){\n rep(i,n){\n cin >> x >> y >> r;\n c[i] = C(P(x,y),r);\n }\n\n vector<double> cp_list[110];\n rep(i,n){\n FOR(j,i+1,n){\n\tvector<P> p = cp_cir_to_cir(c[i],c[j]);\n\tif((int)p.sz==2){\n\t rep(k,2)cp_list[i].pb(angle(p[k],c[i]));\n\t rep(k,2)cp_list[j].pb(angle(p[k],c[j]));\n\t}\n }\n }\n\n rep(i,n){\n sort(all(cp_list[i]));\n rep(j,(int)cp_list[i].sz-1){\n\tif(EQ(cp_list[i][j],cp_list[i][j+1])){\n\t cp_list[i].erase(cp_list[i].begin()+j);\n\t j--;\n\t}\n }\n }\n\n double ans = 0;\n rep(i,n){\n if(cp_list[i].empty()){\n\tbool f = true;\n\trep(j,n){\n\t if(i==j)continue;\n\t if(in_cir(c[j],c[i].fs) && c[i].sc < c[j].sc)f = false;\n\t}\n\tif(f)ans += 2*PI*c[i].sc;\n }else{\n\trep(j,cp_list[i].sz){\n\t double s;\n\t if(j+1<(int)cp_list[i].sz)s = (cp_list[i][j]+cp_list[i][j+1])/2;\n\t else s = (cp_list[i][j]+cp_list[i][0]+2*PI)/2;\n\n\t P p = rotate(P(0,c[i].sc),s) + c[i].fs;\n\t bool f = true;\n\t rep(k,n){\n\t if(i==k)continue;\n\t if(in_cir(c[k],p))f = false;\n\t }\n\t double seta = cp_list[i][(j+1)%cp_list[i].sz]-cp_list[i][j];\n\t if(seta<0)seta += 2*PI;\n\t if(f)ans += seta*c[i].sc;\n\t}\n }\n }\n cout << fixed << setprecision(10) << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1388,
"score_of_the_acc": -0.0218,
"final_rank": 7
},
{
"submission_id": "aoj_1047_698312",
"code_snippet": "#include<stdio.h>\n#include<math.h>\n#include<algorithm>\nusing namespace std;\ndouble x[100],y[100],r[100];\nint size[100];\npair<double,int> e[100][40000];\nint d[100];\ndouble DIST[100][100];\ninline double HYP(double a,double b){\n\treturn sqrt(a*a+b*b);\n}\ndouble PI=3.14159265359;\ndouble EPS=1e-5;\nint main(){\n\tint a;\n\twhile(scanf(\"%d\",&a),a){\n\t\tfor(int i=0;i<a;i++)scanf(\"%lf%lf%lf\",x+i,y+i,r+i);\n\t\tfor(int i=0;i<a;i++){\n\t\t\tsize[i]=0;\n\t\t\td[i]=1;\n\t\t}\n\t\tfor(int i=0;i<a;i++)\n\t\t\tfor(int j=0;j<a;j++)\n\t\t\t\tDIST[i][j]=HYP(x[i]-x[j],y[i]-y[j]);\n\t\tfor(int i=0;i<a;i++){\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tif(i==j)continue;\n\t\t\t\tif(DIST[i][j]<(double)r[j]-r[i]+EPS)d[i]=0;\n\t\t\t\telse if(DIST[i][j]<(double)r[i]-r[j]+EPS);\n\t\t\t\telse if(DIST[i][j]+EPS<(double)r[i]+r[j]){\n\t\t\t\t\tdouble c=atan2(y[j]-y[i],x[j]-x[i]);\n\t\t\t\t\tdouble p=acos(0.5*(DIST[i][j]*DIST[i][j]+r[i]*r[i]-r[j]*r[j])/DIST[i][j]/r[i]);\n\t\t\t\t\tdouble t1=c-p;\n\t\t\t\t\tdouble t2=c+p;\n\t\t\t\t\tif(t2<0){\n\t\t\t\t\t\tt1+=PI*2;\n\t\t\t\t\t\tt2+=PI*2;\n\t\t\t\t\t}\n\t\t\t\t\tif(t2>PI*2){\n\t\t\t\t\t\tt1-=PI*2;\n\t\t\t\t\t\tt2-=PI*2;\n\t\t\t\t\t}\n\t\t\t\t\tif(t1<0){\n\t\t\t\t\t\te[i][size[i]++]=make_pair(t1+PI*2,1);\n\t\t\t\t\t\te[i][size[i]++]=make_pair(PI*2,2);\n\t\t\t\t\t\tt1=0;\n\t\t\t\t\t}\n\t\t\t\t\te[i][size[i]++]=(make_pair(t1,1));\n\t\t\t\t\te[i][size[i]++]=(make_pair(t2,2));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<a;i++)std::sort(e[i],e[i]+size[i]);\n\t\tdouble ret=0;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tif(d[i]){\n\t\t\t\tint now=0;\n\t\t\t\tdouble at=0;\n\t\t\t\tfor(int j=0;j<size[i];j++){\n\t\t\t\t\tif(!now)ret+=(e[i][j].first-at)*r[i];\n\t\t\t\t\tif(e[i][j].second==1)now++;\n\t\t\t\t\telse now--;\n\t\t\t\t\tat=e[i][j].first;\n\t\t\t\t}\n\t\t\t\tret+=(PI*2-at)*r[i];\n\t\t\t}\n\t\t}\n\t\tprintf(\"%.9f\\n\",ret);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 63752,
"score_of_the_acc": -1,
"final_rank": 13
},
{
"submission_id": "aoj_1047_589223",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <fstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing namespace std;\n\nconst double EPS = 1.0e-10;\nconst double PI = acos(-1.0);\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(double theta){\n y = sin(theta);\n x = cos(theta);\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 double angle() const{\n return atan2(y, x);\n }\n};\n\nint circlesIntersection(const Point& p1, double r1, const Point& p2, double r2, vector<Point>& intersection)\n{\n double y = p2.y - p1.y;\n double x = p2.x - p1.x;\n double a = (y*y + x*x + r1*r1 - r2*r2) / 2;\n double b = (y*y + x*x) * r1*r1 - a*a;\n\n if(y*y + x*x < EPS || b < -EPS){\n intersection.resize(0);\n return 0;\n }\n if(b < EPS){\n intersection.assign(1, Point(y, x) * (a / (y*y + x*x)) + p1);\n return 1;\n }\n\n intersection.assign(2, Point(x, -y) * sqrt(b));\n intersection[1] = intersection[1] * -1;\n for(int i=0; i<2; ++i)\n intersection[i] = (intersection[i] + Point(y, x) * a) / (y*y + x*x) + p1;\n return 2;\n}\n\nint main()\n{\n for(;;){\n int n;\n cin >> n;\n if(n == 0)\n return 0;\n\n vector<Point> p(n);\n vector<double> r(n);\n for(int i=0; i<n; ++i)\n cin >> p[i].x >> p[i].y >> r[i];\n\n double ret = 0.0;\n for(int i=0; i<n; ++i){\n vector<double> theta;\n for(int j=0; j<n; ++j){\n if(i == j)\n continue;\n\n vector<Point> q;\n circlesIntersection(p[i], r[i], p[j], r[j], q);\n for(unsigned k=0; k<q.size(); ++k)\n theta.push_back((q[k] - p[i]).angle());\n }\n\n if(theta.empty()){\n Point q = p[i] + Point(r[i], 0);\n bool ok = true;\n for(int j=0; j<n; ++j){\n if(i != j && q.dist(p[j]) < r[j])\n ok = false;\n }\n if(ok)\n ret += r[i] * 2 * PI;\n }else{\n sort(theta.begin(), theta.end());\n theta.push_back(theta[0] + 2 * PI);\n for(unsigned j=1; j<theta.size(); ++j){\n double a = (theta[j] + theta[j-1]) / 2;\n Point q = p[i] + Point(a) * r[i];\n bool ok = true;\n for(int k=0; k<n; ++k){\n if(p[k].dist(q) < r[k] - EPS)\n ok = false;\n }\n if(ok)\n ret += r[i] * (theta[j] - theta[j-1]);\n }\n }\n }\n\n printf(\"%.10f\\n\", ret);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1332,
"score_of_the_acc": -0.0209,
"final_rank": 5
},
{
"submission_id": "aoj_1047_269055",
"code_snippet": "#include<cstdio>\n#include<vector>\n#include<complex>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\ntypedef complex<double> Point;\n\nconst double EPS=1e-9;\nconst double PI=acos(-1);\n\nclass Line:public vector<Point>{\npublic:\n\tLine(const Point &a,const Point &b){ push_back(a), push_back(b); }\n};\n\nclass Segment:public Line{\npublic:\n\tSegment(const Point &a,const Point &b):Line(a,b){}\n};\n\nclass Circle{\npublic:\n\tPoint c;\n\tdouble r;\n\tCircle(){}\n\tCircle(const Point &C,double R):c(C),r(R){}\n};\n\ninline double dot(const Point &a,const Point &b){\n\treturn a.real()*b.real()+a.imag()*b.imag();\n}\n\ninline double cross(const Point &a,const Point &b){\n\treturn a.real()*b.imag()-a.imag()*b.real();\n}\n\ninline void calc_abc(const Line &l,double &a,double &b,double &c){\n\ta=l[0].imag()-l[1].imag();\n\tb=l[1].real()-l[0].real();\n\tc=cross(l[0],l[1]);\n}\n\nPoint PerpFoot(const Point &p,const Line &l){\n\tdouble a,b,c;\n\tcalc_abc(l,a,b,c);\n\tPoint v(a,b);\n\treturn p-(dot(p,v)+c)*v/norm(v);\n}\n\nbool cover(const Segment &s,const Point &p){\n\treturn dot(s[0]-p,s[1]-p)<EPS;\n}\n\nbool cover(const Circle &c,const Point &p){\n\treturn abs(p-c.c)<c.r+EPS;\n}\n\nbool cover(const Circle &c1,const Circle &c2){\n\treturn abs(c1.c-c2.c)+c2.r<c1.r+EPS;\n}\n\nint intersect(const Circle &c,const Line &l,Point &p,Point &q){\n\tPoint m=PerpFoot(c.c,l);\n\tdouble d2=norm(c.c-m);\n\tif(c.r*c.r+EPS<d2) return 0;\n\telse if(abs(c.r*c.r-d2)<EPS){\n\t\tp=q=m;\n\t\treturn 1;\n\t}\n\telse{\n\t\tPoint v;\n\t\tdouble n0=norm(l[0]-m),n1=norm(l[1]-m);\n\t\tif(n0<n1) v=l[1]-m, n0=n1;\n\t\telse v=l[0]-m;\n\t\tv*=sqrt((c.r*c.r-d2)/n0);\n\t\tp=m+v, q=m-v;\n\t\treturn 2;\n\t}\n}\n\nint intersect(const Circle &c,const Segment &s,Point &p,Point &q){\n\tPoint pp,qq;\n\tint n=intersect(c,Line(s),pp,qq);\n\tif(n==0) return 0;\n\telse if(n==1){\n\t\tif(cover(s,pp)){\n\t\t\tp=q=pp;\n\t\t\treturn 1;\n\t\t}\n\t\treturn 0;\n\t}\n\telse{\n\t\tbool bp=cover(s,pp),bq=cover(s,qq);\n\t\tif(bp&&bq){\n\t\t\tp=pp, q=qq;\n\t\t\treturn 2;\n\t\t}\n\t\tif(bp||bq){\n\t\t\tp=q=(bp?pp:qq);\n\t\t\treturn 1;\n\t\t}\n\t\treturn 0;\n\t}\n}\n\nint intersect(const Circle &c1,const Circle &c2,Point &p,Point &q){\n\tdouble d2=norm(c1.c-c2.c);\n\tif(d2<EPS && abs(c1.r-c2.r)<EPS) return -1; // c1==c2\n\tif((c1.r+c2.r)*(c1.r+c2.r)+EPS<d2 || d2+EPS<(c1.r-c2.r)*(c1.r-c2.r)) return 0;\n\n\tdouble d=sqrt(d2);\n\tif(abs(c1.r+c2.r-d)<EPS){\n\t\tintersect(c1,Segment(c1.c,c2.c),p,q);\n\t\treturn 1;\n\t}\n\n\tdouble a=(c1.r*c1.r-c2.r*c2.r+d2)/(2*d);\n\tdouble h=sqrt(c1.r*c1.r-a*a);\n\tp=q=c1.c+a/d*(c2.c-c1.c);\n\tPoint tmp=h*(c2.c-c1.c)/d;\n\tp+=tmp*Point(0,-1);\n\tq+=tmp*Point(0,+1);\n\treturn 2;\n}\n\nPoint c_cmp;\nbool cmp_arg(const Point &p,const Point &q){ return arg(p-c_cmp)<arg(q-c_cmp); }\n\nint main(){\n\tfor(int n;scanf(\"%d\",&n),n;){\n\t\tCircle C[100];\n\t\trep(i,n){\n\t\t\tdouble x,y; scanf(\"%lf%lf%lf\",&x,&y,&C[i].r);\n\t\t\tC[i].c=Point(x,y);\n\t\t}\n\n\t\tvector<Point> P[100];\n\t\trep(j,n) rep(i,j) {\n\t\t\tPoint p,q;\n\t\t\tif(intersect(C[i],C[j],p,q)==2){\n\t\t\t\tP[i].push_back(p); P[i].push_back(q);\n\t\t\t\tP[j].push_back(p); P[j].push_back(q);\n\t\t\t}\n\t\t}\n\n\t\tdouble ans=0;\n\t\trep(i,n){\n\t\t\tbool cov=false;\n\t\t\trep(j,n) if(j!=i && cover(C[j],C[i])) cov=true;\n\t\t\tif(cov) continue;\n\n\t\t\tint m=P[i].size();\n\t\t\tc_cmp=C[i].c;\n\t\t\tsort(P[i].begin(),P[i].end(),cmp_arg);\n\n\t\t\tif(m==0) ans+=2*PI*C[i].r;\n\n\t\t\trep(j,m){\n\t\t\t\tconst Point &a=P[i][j],&b=P[i][(j+1)%m];\n\t\t\t\tdouble theta=arg(b-C[i].c)-arg(a-C[i].c);\n\t\t\t\tif(theta<0) theta+=2*PI;\n\t\t\t\tPoint c=C[i].c+(a-C[i].c)*exp(Point(0,theta/2));\n\n\t\t\t\tbool ok=true;\n\t\t\t\trep(k,n) if(k!=i && cover(C[k],c)) ok=false;\n\t\t\t\tif(ok) ans+=C[i].r*theta;\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%.9f\\n\",ans);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1047_55902",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<complex>\n#include<vector>\n#include<algorithm>\n\n#define EPS 1.0e-12\n#define PI acos(-1.0)\n\nusing namespace std;\n\ntypedef double elem;\ntypedef complex<elem> point, vec;\n\ninline elem sq(elem a){ return a * a; }\ninline elem dist(const point &p1, const point &p2){ return abs(p2-p1); }\ninline bool eq(elem a, elem b){ return abs(a-b)<EPS; }\ninline bool eqv(const vec &a, const vec &b){ return eq( a.real(), b.real() ) && eq( a.imag(), b.imag() ); }\ninline elem dot(const vec &a, const vec &b){ return a.real() * b.real() + a.imag() * b.imag(); } \ninline elem cross(const vec &a, const vec &b){ return a.real() * b.imag() - a.imag() * b.real(); }\ninline elem rad(const vec &a, const vec &b){ return acos( dot(a,b) / ( abs(a) * abs(b) ) ); }\ninline vec uvec(const vec &a){ return a / abs(a); }\ninline vec normr(const vec &a){ return a * vec(0,-1); }\ninline vec norml(const vec &a){ return a * vec(0,1); }\ninline vec unormr(const vec &a){ return uvec( normr( a ) ); }\ninline vec unorml(const vec &a){ return uvec( norml( a ) ); }\n\nstruct circle{\n\telem r; point c;\n\telem Perimeter()const{ return 2 * r * PI; }\n\tbool Inside(const point &p)const{ return dist(p,c) < r; }\n\tbool Wrap(const circle &t)const{ elem d = dist(c,t.c); return d + t.r <= r; }\n};\n\nint CircleCross(const circle &c1, const circle &c2, pair<point,point> &p)\n{\n\telem d = dist( c1.c, c2.c );\n\t\n\tif( eqv( c1.c, c2.c ) && eq( c1.r, c2.r ) ){ /* ñÂÌ~ªêv */ return -1; }\n\tif( eqv( c1.c, c2.c ) ){ /* S¾¯êvµÄ¢é */ return 0; }\n\tif( d > c1.r + c2.r ){ /* ~ªÝ¢ÉðíçÈ¢ */ return 0; }\n\n\tvec ab = c2.c - c1.c;\n\telem k = ( sq( c1.r ) - sq( c2.r ) + sq( d ) ) / ( 2 * sq( d ) );\n\tpoint t = k * ab + c1.c;\n\telem x = sqrt( sq(c1.r) - sq( d * k ) );\n\n\tif( eq( x, 0 ) ){ /* ð_ð꾯 */ p.first = t; return 1;\n\t}else{ /* ð_ðñ */\n\t\tvec abr = unormr( ab ); vec abl = unorml( ab );\n\t\tvec vp1 = x * abr; vec vp2 = x * abl;\n\t\tp.first = vp1 + t; p.second = vp2 + t;\n\t\treturn 2;\n\t}\n}\n\nstruct point_on_circle{\n\tpoint p;\n\tcircle c; // ð_pª®·é~\n};\n\nstruct circle_info{\n\tcircle c;\n\tvector< point_on_circle > cross_points;\n};\n\nvoid center_point( const point_on_circle &p1, const point_on_circle &p2, pair<elem,elem> &p_arc, pair<point,point> &p_center )\n{\n\tvec v1(p1.p - p1.c.c);\n\tvec v2(p2.p - p2.c.c);\n\n\tvec c_p = p1.c.r * uvec( v1 + v2 ) + p1.c.c;\n\tp_center.first = c_p;\n\tp_arc.first = p1.c.r * rad( v1, v2 );\n\n\tvec c_n = p1.c.r * (-uvec( v1 + v2 ) ) + p1.c.c;\n\tp_center.second = c_n;\n\tp_arc.second = p1.c.Perimeter() - p_arc.first;\n\n\tif( 0 < cross( v1, v2 ) ){\n\t\tswap(p_arc.first, p_arc.second);\n\t\tswap(p_center.first, p_center.second);\n\t}\n}\n\nbool PointsClkws(const point_on_circle &p1, const point_on_circle &p2)\n{\n\tvec t(0,1);\n\tvec v1(p1.p-p1.c.c);\n\tvec v2(p2.p-p2.c.c);\n\telem rad1 = rad( v1, t );\n\telem rad2 = rad( v2, t );\n\tif( cross(v1,t) < 0 )\n\t\trad1 = 2 * PI - rad1;\n\tif( cross(v2,t) < 0 )\n\t\trad2 = 2 * PI - rad2;\n\n\treturn rad1 < rad2;\n}\n\nint main()\n{\n\twhile(true){\n\t\tint n;\n\t\telem ans = 0;\n\t\tvector<circle_info> vc;\n\t\t\n\t\tscanf(\"%d\", &n);\n\t\tif( n == 0 )\n\t\t\tbreak;\n\t\t\n\t\tvc.resize(n);\n\t\tfor(int i = 0; i < n; ++i){\n\t\t\tdouble x,y,r;\n\t\t\tscanf(\"%lf%lf%lf\", &x, &y, &r);\n\t\t\tvc[i].c.c = complex<elem>(x,y);\n\t\t\tvc[i].c.r = r;\n\t\t}\n\n\t\t// ¼Ì~Éàï³êé~ðí\n\t\tfor(unsigned int i = 0; i < vc.size(); ++i){\n\t\t\tfor(unsigned int j = 0; j < vc.size(); ++j){\n\t\t\t\tif( i != j ){\n\t\t\t\t\tif( vc[j].c.Wrap( vc[i].c ) ){\n\t\t\t\t\t\tvc.erase( vc.begin() + i );\n\t\t\t\t\t\ti = -1;\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\t\n\t\t// ~¯mÌð_ðßé\n\t\tfor(unsigned int i = 0; i < vc.size(); ++i){\n\t\t\tfor(unsigned int j = 0; j < vc.size(); ++j){\n\t\t\t\tif( i != j ){\n\t\t\t\t\tpair<point,point> p;\n\t\t\t\t\tint t = CircleCross( vc[i].c, vc[j].c, p );\n\t\t\t\t\tpoint_on_circle p1, p2;\n\t\t\t\t\t\n\t\t\t\t\tp1.c = vc[i].c;\n\t\t\t\t\tp1.p = p.first;\n\t\t\t\t\tp2.c = vc[i].c;\n\t\t\t\t\tp2.p = p.second;\n\t\t\t\t\t\n\t\t\t\t\tif( t <= 1 ){\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tvc[i].cross_points.push_back( p1 );\n\t\t\t\t\t\tvc[i].cross_points.push_back( p2 );\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// d¡·é¤L_ðí\n\t\tfor(unsigned int i = 0; i < vc.size(); ++i){\n\t\t\tfor(unsigned int j = 0; j < vc[i].cross_points.size(); ++j){\n\t\t\t\tfor(unsigned int k = j + 1; k < vc[i].cross_points.size(); ++k){\n\t\t\t\t\tif( eqv( vc[i].cross_points[j].p, vc[i].cross_points[k].p ) ){\n\t\t\t\t\t\tvc[i].cross_points.erase( vc[i].cross_points.begin() + k );\n\t\t\t\t\t\t--k;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t// ¤L_ðvñèÉ®ñ\n\t\tfor(unsigned int i = 0; i < vc.size(); ++i){\n\t\t\tsort( vc[i].cross_points.begin(), vc[i].cross_points.end(), PointsClkws );\n\t\t}\n\n\t\t// solve\n\t\tfor(unsigned int i = 0; i < vc.size(); ++i){\n\t\t\tans += vc[i].c.Perimeter();\n\t\t\tif( vc[i].cross_points.size() > 1 ){\n\t\t\t\tfor(unsigned int j = 0; j < vc[i].cross_points.size(); ++j){\n\t\t\t\t\tunsigned int mod = vc[i].cross_points.size();\n\t\t\t\t\tpair<elem, elem> p_arc;\n\t\t\t\t\tpair<point, point> p_center;\n\t\t\t\t\t\n\t\t\t\t\tcenter_point( vc[i].cross_points[j % mod], vc[i].cross_points[(j+1) % mod], p_arc, p_center );\n\n\t\t\t\t\tfor(unsigned int k = 0; k < vc.size(); ++k){\n\t\t\t\t\t\tif( i != k ){\n\t\t\t\t\t\t\tif( vc[k].c.Inside( p_center.first ) ){\n\t\t\t\t\t\t\t\tans -= p_arc.first;\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}\n\n\t\tprintf(\"%.12lf\\n\", ans);\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_1047_31331",
"code_snippet": "#include<iostream>\n#include<complex>\n#include<cmath>\n#include<vector>\n#include<algorithm>\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)\ntypedef complex<double> P;\n#define eps 0\n\n//~ÌSÀWða,b,¼aðr1,r2Æ·éB\n//r1Ær2ÌÔÌ£ðßÄ]·èÉæèr1Æ»ÌÓÌÈ·pðßéB\n// ÆÍpolarðgÁÄÀW𶬷éB\n//ñ_ÌÀWðÔ·B\npair<double,double> CC_intersection(P a,P b,double r1,double r2){//~Æ~Ìð_\n double r3 = abs(a-b);\n double theta = acos( (r1*r1 + r3*r3 -r2*r2)/(2*r1*r3) ); \n return make_pair(theta+arg(b-a),arg(b-a)-theta);\n}\n\nbool cmp(const P &a,const P&b){\n return arg(a)<arg(b);\n}\nclass Circle{\npublic:\n vector<double> data;\n};\n\ndouble solve(int n,P *in,double *r){\n Circle data[n];\n double ret =0;\n rep(i,n){ \n //data[i].data.push_back(asin(1));data[i].data.push_back(asin(-1));\n data[i].data.push_back(0);data[i].data.push_back(0.1);\n rep(j,n){\n if ( i==j)continue;\n if ( r[i]+r[j] <eps+abs(in[i]-in[j]))continue;\n if ( abs(in[i]-in[j])+r[i] <r[j]+eps||abs(in[i]-in[j])+r[j]<r[i]+eps)continue;\n \n pair<double,double> a=CC_intersection(in[i],in[j],r[i],r[j]);\n data[i].data.push_back(a.first);\n data[i].data.push_back(a.second);\n }\n }\n \n rep(i,n)sort(data[i].data.begin(),data[i].data.end());\n \n\n\n rep(i,n){\n int size=data[i].data.size();\n rep(j,size){\n double now = data[i].data[j],nex=data[i].data[(j+1)%size];\n \n double theta = (nex-now)/2+now;\n if (nex-now<0)theta=(acos(-1)*2+nex-now)/2+now;\n \n P mid = polar(r[i],theta)+in[i];\n \n bool flag=true;\n rep(k,n){\n\tif ( i == k)continue;\n\tif (abs(in[k]-mid)<eps+r[k]){flag=false;break;}\n }\n\n double test =nex-now;\n if ( test <0)test=acos(-1)*2+nex-now;\n if ( flag){\n\tret+=r[i]*abs(test);\n }\n \n }\n }\n return ret;\n}\n\nmain(){\n int n;\n while(cin>>n&&n){\n P in[n];double r[n];\n rep(i,n)cin>>in[i].real()>>in[i].imag()>>r[i];\n printf(\"%.10lf\\n\",solve(n,in,r));\n }\n return false;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1047_29846",
"code_snippet": "#include<iostream>\n#include<cfloat>\n#include<cassert>\n#include<cmath>\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n\nusing namespace std;\n\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS )\n#define dle(a, b) (equals(a, b) || a < b )\nstatic const double PI = acos(-1);\n\nclass Point{\n public:\n double x, y;\n \n Point ( double x = 0, double y = 0): x(x), y(y){}\n \n Point operator + ( Point p ){ return Point(x + p.x, y + p.y); }\n Point operator - ( Point p ){ return Point(x - p.x, y - p.y); }\n Point operator * ( double a ){ return Point(x*a, y*a); }\n\n double abs() { return sqrt(norm());}\n double norm() { return x*x + y*y; }\n\n bool operator < ( const Point &p ) const {\n\treturn x != p.x ? x < p.x : y < p.y;\n }\n\n bool operator == ( const Point &p ) const {\n\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n }\n};\n\ntypedef Point Vector;\n\nclass Segment{\n public:\n Point p1, p2;\n Segment(Point s = Point(), Point t = Point()): p1(s), p2(t){}\n};\n\ntypedef Segment Line;\n\nstatic const int CIRCLE_NON = 0;\nstatic const int CIRCLE_OUT = 1;\nstatic const int CIRCLE_IN = 2;\nstatic const int CIRCLE_CROSS = 3;\n\nclass Circle{\n public:\n Point c;\n double r;\n Circle(Point c = Point(), double r = 0.0): c(c), r(r){}\n};\n\ndouble norm( Vector a ){ return a.x*a.x + a.y*a.y; }\ndouble abs( Vector a ){ return sqrt(norm(a)); }\nPoint polar( double a, double r ){ return Point(cos(r)*a, sin(r)*a);}\ndouble getDistance( Vector a, Vector b ){ return abs(a - b); }\ndouble dot( Vector a, Vector b ){ return a.x*b.x + a.y*b.y; }\ndouble cross( Vector a, Vector b ){ return a.x*b.y - a.y*b.x; }\n\ndouble getAngle(Point p){\n double polar = atan2(p.y, p.x);\n return (dle(0, polar))? polar : 2.0*acos(-1)+polar;\n}\n\nint isIntersect(Circle c1, Circle c2){\n double d = abs(c1.c - c2.c);\n if ( c1.r + c2.r < d ) return CIRCLE_NON; // no overlap\n if ( d + c2.r < c1.r ) return CIRCLE_IN; // c1 includes c2\n if ( d + c1.r < c2.r ) return CIRCLE_OUT; // c2 includes c1\n return CIRCLE_CROSS;\n}\n\ndouble arg(Vector p){\n return atan2(p.y, p.x);\n}\n\npair<Point, Point> getCrossPoints(Circle c1, Circle c2){\n assert( isIntersect( c1, c2 ) );\n double d = abs(c1.c - c2.c);\n double a = acos((c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d));\n double t = arg(c2.c - c1.c);\n return make_pair(c1.c+polar(c1.r, t+a), c1.c+polar(c1.r, t-a));\n}\n\n\nCircle C[100];\nint n;\n\nvoid compute(){\n double len = 0.0;\n\n for ( int i = 0; i < n; i++ ){\n\tvector<double> angles;\n\tfor ( int j = 0; j < n; j++ ){\n\t if ( i == j ) continue;\n\t if ( isIntersect(C[i], C[j]) != CIRCLE_CROSS ) continue;\n\t pair<Point, Point> pp = getCrossPoints(C[i], C[j]);\n\t angles.push_back(getAngle(pp.first - C[i].c));\n\t angles.push_back(getAngle(pp.second - C[i].c));\n\t}\n\tangles.push_back(0.0);\n\tangles.push_back(2*PI);\n\n\tsort( angles.begin(), angles.end() );\n\n\tfor ( int a = 1; a < angles.size(); a++ ) {\n\t Point m = C[i].c + polar(C[i].r, (angles[a]+angles[a-1])/2.0);\n\t bool included = false;\n\t for ( int t = 0; t < n; t++ ){\n\t\tif ( t == i ) continue;\n\t\tif ( dle(getDistance(m, C[t].c), C[t].r) ) included = true;\n\t }\n\n\t if ( !included ){\n\t\tlen += (angles[a] - angles[a-1])*C[i].r;\n\t }\n\t}\n }\n\n printf(\"%.12lf\\n\", len);\n}\n\nint main(){\n double x, y, r;\n while( cin >> n ){\n\tif ( n == 0 ) break;\n\tfor ( int i = 0; i < n; i++ ){\n\t cin >> x >> y >> r; C[i] = Circle( Point(x, y), r);\n\t}\n\tcompute();\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 996,
"score_of_the_acc": -1.0156,
"final_rank": 14
}
] |
aoj_1048_cpp
|
Problem 08:
Provident Housewife
主婦の琴子はこの不況のさなか食費を抑えることに闘志を燃やしていました。毎朝新聞広告を必ずチェック。買う物リストと最も安く売られているお店をしっかりリストアップして、お店をはしごしながら、エプロン・サンダルという戦闘スタイルで自転車をこぎこぎ買い物に行きます。
そこで夫のあなたは少しでも琴子の役に立とうと、得意のプログラミングで家計簿プログラムを作成することにしました。プログラムは、各スーパーに売っている品物の名前と値段（円）、琴子が必要な品物を入力し、全ての品物を集めるための最小金額を出力します。
琴子は家を出て必要な品物を集め、家に戻ってこなければなりません。
そこで、琴子を気遣ったあなたは、最小金額が同じになる買い物ルートが複数ある場合も考慮して、より距離が短くなるルートの距離を報告する機能を追加することにしました。従って、プログラムはスーパー・家間を繋ぐ道の情報も入力します。
スーパーの数を
n
とし、各スーパーにはそれぞれ 1 から
n
までの番号が割り当てられます。さらに琴子の家を 0 番とします。道の情報はこれらの番号のペアとその距離（整数）で与えられます。
Input
入力として複数のデータセットが与えられます。各データセットの形式は以下の通りです：
n
（スーパーの数：整数）
k
1
name
1
value
1
name
2
value
2
. . .
name
k
1
value
k
1
（1 番目のスーパーにある品物の種類の数、1つ目の品物名と値段、2つ目の品物名と値段,,,：整数と文字列の空白区切り）
k
2
name
1
value
1
name
2
value
2
. . .
name
k
2
value
k
2
（2 番目のスーパーにある品物の種類の数、1つ目の品物名と値段、2つ目の品物名と値段,,,：整数と文字列の空白区切り）
.
.
k
n
name
1
value
1
name
2
value
2
. . .
name
k
n
value
k
n
（
n
番目のスーパーにある品物の種類の数、1つ目の品物名と値段、2つ目の品物名と値段,,,：整数と文字列の空白区切り）
q
（必要な品物の数：整数）
name
1
（1 つ目の必要な品物の名前：文字列）
name
2
（2 つ目の必要な品物の名前：文字列）
.
.
name
q
（
q
つ目の必要な品物の名前：文字列）
m
（道の数：整数）
s
1
t
1
d
1
（1 本目の道の情報：空白区切りの整数）
s
2
t
2
d
2
（2 本目の道の情報：空白区切りの整数）
.
.
s
m
t
m
d
m
（
m
本目の道の情報：空白区切りの整数）
s
i
t
i
d
i
は
s
i
番目のスーパー（または家）と
t
i
番目のスーパー（または家）が双方向に行き来することができ、その距離が
d
i
であることを示します。
家から（スーパーを経由して）全てのスーパーへ行くことができるような道が与えられます。
n
は 10 以下であり、
q
は 15 以下とします。
k
i
は 100 以下であり、
品物名の文字列は 20文字を越ず、品物の値段は 10000 を越えません。
また、道の長さは 1000 を越えません。
n
が 0 のとき、入力の終わりとします。
Output
各データセットについて、最小の金額と距離を１つの空白で区切って１行に出力して下さい。ただし、必要な品物を全て集められない場合は "
impossible
" と出力して下さい。
Sample Input
3
3 apple 100 banana 200 egg 300
3 apple 150 banana 100 cola 200
3 apple 100 banana 150 cola 200
3
apple
banana
cola
5
0 2 4
0 1 3
0 3 3
1 2 3
2 3 5
3
3 apple 100 banana 200 egg 300
3 apple 150 banana 100 cola 200
3 apple 100 banana 150 cola 200
4
apple
banana
cola
jump
5
0 2 4
0 1 3
0 3 3
1 2 3
2 3 5
0
Output for the Sample Input
400 10
impossible
|
[
{
"submission_id": "aoj_1048_10397141",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n// 大きな値として INF を定義\nstatic const int INF = 1e9;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (true) {\n int n;\n cin >> n;\n if (!cin || n == 0) break; // n==0 で終了\n\n // スーパー 1..n, 家を 0 としてグラフのノードは 0..n\n // 先に各スーパーが売る品物情報を読み取るプレースホルダ\n vector<unordered_map<string,int>> price(n+1);\n for (int i = 1; i <= n; i++){\n int ki;\n cin >> ki;\n // ki 個の (name, value) ペアをマップに格納\n while (ki--){\n string name;\n int value;\n cin >> name >> value;\n price[i][name] = value;\n }\n }\n\n // 必要な品物 q とその名前を読み込み\n int q;\n cin >> q;\n vector<string> need(q);\n for (int i = 0; i < q; i++){\n cin >> need[i];\n }\n\n // グラフの辺情報を読み込む\n int m;\n cin >> m;\n // 隣接行列 dist[u][v]: 最短距離\n int N = n + 1;\n vector<vector<int>> dist(N, vector<int>(N, INF));\n for (int i = 0; i < N; i++){\n dist[i][i] = 0;\n }\n // m 本の道路\n for (int i = 0; i < m; i++){\n int s, t, d;\n cin >> s >> t >> d;\n // 双方向\n dist[s][t] = min(dist[s][t], d);\n dist[t][s] = min(dist[t][s], d);\n }\n\n // Floyd-Warshall で全点対最短路を計算\n for (int k = 0; k < N; k++){\n for (int i = 0; i < N; i++){\n if (dist[i][k] == INF) continue;\n for (int j = 0; j < N; j++){\n dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n }\n }\n\n // 各スーパー i(1..n) が必要品目を何番目に売っているかをインデックス化\n // priceShop[i][j] = スーパー i が need[j] を売る時の価格、売らないなら INF\n vector<vector<int>> priceShop(n+1, vector<int>(q, INF));\n bool impossible = false;\n for (int j = 0; j < q; j++){\n const string &item = need[j];\n bool found = false;\n for (int i = 1; i <= n; i++){\n auto it = price[i].find(item);\n if (it != price[i].end()){\n priceShop[i][j] = it->second;\n found = true;\n }\n }\n if (!found){\n // ある必要品がどの店にもない → impossible\n impossible = true;\n }\n }\n if (impossible){\n cout << \"impossible\\n\";\n continue;\n }\n\n // ビットマスクでショップの部分集合を横断\n // 全品目をカバーする最良 (money, distance)\n long long bestMoney = LLONG_MAX;\n int bestDist = INF;\n\n int fullMask = (q==0?0: (1<<q) - 1);\n\n // subsets: 1..(1<<n)-1\n for (int s = 1; s < (1<<n); s++){\n // まずこの店群 s が全品目をカバーしているかチェックしつつ、\n // 各品目の最安価格を集めて money を計算\n long long money = 0;\n bool ok = true;\n for (int j = 0; j < q; j++){\n int cheapest = INF;\n // s の各ビット i が立っていたら店 i+1 をチェック\n for (int i = 0; i < n; i++){\n if (s & (1<<i)){\n cheapest = min(cheapest, priceShop[i+1][j]);\n }\n }\n if (cheapest == INF){\n ok = false;\n break;\n }\n money += cheapest;\n }\n if (!ok) continue;\n // money がすでに最良を超えていれば旅行距離計算不要\n if (money > bestMoney) continue;\n\n // この集合 s の店を巡る最短の往復距離を TSP で求める\n // shops: s に入る店リスト\n vector<int> shops;\n for (int i = 0; i < n; i++){\n if (s & (1<<i)) shops.push_back(i+1);\n }\n int k = shops.size();\n // DP[mask][i]: mask ビット集合の店を訪問済で最後が shops[i]\n static int dp[1<<10][10];\n const int INF2 = 1e9;\n for (int mask = 0; mask < (1<<k); mask++){\n for (int i = 0; i < k; i++){\n dp[mask][i] = INF2;\n }\n }\n // 初期状態：家(0)→shops[i]\n for (int i = 0; i < k; i++){\n int node = shops[i];\n if (dist[0][node] < INF)\n dp[1<<i][i] = dist[0][node];\n }\n // TSP ビット DP\n for (int mask = 1; mask < (1<<k); mask++){\n for (int last = 0; last < k; last++){\n if (!(mask & (1<<last))) continue;\n int cur = dp[mask][last];\n if (cur == INF2) continue;\n // 次に訪れる店 nxt\n for (int nxt = 0; nxt < k; nxt++){\n if (mask & (1<<nxt)) continue;\n int d2 = dist[ shops[last] ][ shops[nxt] ];\n if (d2 == INF) continue;\n int nm = mask | (1<<nxt);\n dp[nm][nxt] = min(dp[nm][nxt], cur + d2);\n }\n }\n }\n // 完全訪問 mask_end = (1<<k)-1 から家(0)へ戻る\n int mask_end = (1<<k) - 1;\n int tourDist = INF2;\n for (int i = 0; i < k; i++){\n int d2 = dist[ shops[i] ][ 0 ];\n if (d2 == INF) continue;\n tourDist = min(tourDist, dp[mask_end][i] + d2);\n }\n if (tourDist == INF2) continue;\n\n // (money, tourDist) で比較・更新\n if (money < bestMoney || (money == bestMoney && tourDist < bestDist)){\n bestMoney = money;\n bestDist = tourDist;\n }\n }\n\n if (bestMoney == LLONG_MAX){\n cout << \"impossible\\n\";\n } else {\n cout << bestMoney << \" \" << bestDist << \"\\n\";\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3448,
"score_of_the_acc": -0.3649,
"final_rank": 7
},
{
"submission_id": "aoj_1048_9529685",
"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 n;\n while (cin >> n, n) {\n vector<map<string, int>> v(n);\n for (int i = 0; i < n; ++i) {\n int k, val;\n cin >> k;\n for (int j = 0; j < k; ++j) {\n string s;\n cin >> s >> val;\n v[i][s] = val;\n }\n }\n int r;\n cin >> r;\n vector<string> need(r);\n for (int i = 0; i < r; ++i) {\n cin >> need[i];\n }\n int m;\n cin >> m;\n vector<vector<int>> dist(n + 1, vector<int>(n + 1, 1e9));\n for (int i = 0; i < m; ++i) {\n int s, t, d;\n cin >> s >> t >> d;\n dist[s][t] = dist[t][s] = d;\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 dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n }\n }\n vector<vector<int>> dp(1 << (n + 1), vector<int>(n + 1, 1e9));\n dp[0][0] = 0;\n for (int i = 0; i < (1 << (n + 1)); ++i) {\n for (int j = 0; j <= n; ++j) {\n if (dp[i][j] == 1e9) continue;\n for (int k = 0; k <= n; ++k) {\n if ((1 << k) & i) continue;\n dp[i + (1 << k)][k] = min(dp[i + (1 << k)][k], dp[i][j] + dist[j][k]);\n }\n }\n }\n pair<int, int> res = {1e9, 1e9};\n for (int i = 0; i < (1 << (n + 1)); ++i) {\n vector<int> a(r, 1e9);\n for (int j = 1; j <= n; ++j) {\n if (i & (1 << j)) {\n for (int k = 0; k < r; ++k) {\n if (v[j - 1].find(need[k]) != v[j - 1].end()) {\n a[k] = min(a[k], v[j - 1][need[k]]);\n }\n }\n }\n }\n int sum = 0;\n bool ok = true;\n for (int j = 0; j < r; ++j) {\n if (a[j] == 1e9) {\n ok = false;\n break;\n }\n sum += a[j];\n }\n if (ok) res = min(res, {sum, dp[i][0]});\n }\n if (res.first == 1e9) cout << \"impossible\\n\";\n else cout << res.first << \" \" << res.second << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3664,
"score_of_the_acc": -0.4128,
"final_rank": 11
},
{
"submission_id": "aoj_1048_2874036",
"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\nint N,num_need,E;\nint POW[17];\nint num_item[10];\nint first_value[10][100],value[10][15];\nint min_dist[11][11];\nint TSP[1024][10];\nchar name[10][100][21],need[15][21];\n\n\nbool strCmp(char* base, char* comp){\n\tint length1,length2;\n\tfor(length1=0;base[length1] != '\\0';length1++);\n\tfor(length2=0;comp[length2] != '\\0';length2++);\n\tif(length1 != length2)return false;\n\n\tfor(int i=0;base[i] != '\\0'; i++){\n\t\tif(base[i] != comp[i])return false;\n\t}\n\treturn true;\n}\n\nvoid func(){\n\n\t//各スーパーの販売品情報を取得\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d\",&num_item[i]);\n\t\tfor(int k = 0; k < num_item[i]; k++){\n\t\t\tscanf(\"%s %d\",name[i][k],&first_value[i][k]);\n\t\t}\n\t}\n\n\tscanf(\"%d\",&num_need);\n\n\tfor(int i = 0; i < num_need; i++){\n\t\tscanf(\"%s\",need[i]);\n\t}\n\n\t//各店の販売品情報を、必要な商品情報で更新する\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < num_need; k++){\n\t\t\tvalue[i][k] = -1; //-1:該当商品なし\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_need; i++){ //必要な商品のループ\n\t\tfor(int k = 0; k < N; k++){ //店のループ\n\t\t\tfor(int p = 0; p < num_item[k]; p++){ //店の商品のループ\n\t\t\t\tif(!strCmp(name[k][p],need[i]))continue;\n\n\t\t\t\tvalue[k][i] = first_value[k][p]; //i番目の商品の値段を記録\n\n\t\t\t\tbreak;\n\t\t\t}\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){\n\t\t\t\tmin_dist[i][k] = BIG_NUM;\n\t\t\t}else{\n\t\t\t\tmin_dist[i][k] = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tscanf(\"%d\",&E);\n\n\t//★グラフでは、各店を1オリジンで扱う★\n\tint from,to,dist;\n\tfor(int loop = 0; loop < E; loop++){\n\t\tscanf(\"%d %d %d\",&from,&to,&dist);\n\t\tmin_dist[from][to] = dist;\n\t\tmin_dist[to][from] = dist;\n\t}\n\n\t//ワーシャルフロイド\n\tfor(int mid = 0; mid <= N; mid++){\n\t\tfor(int start = 0; start <= N; start++){\n\t\t\tif(min_dist[start][mid] == BIG_NUM)continue;\n\t\t\tfor(int goal = 0; goal <= N; goal++){\n\t\t\t\tif(min_dist[mid][goal] == BIG_NUM)continue;\n\n\t\t\t\tmin_dist[start][goal] = min(min_dist[start][goal],min_dist[start][mid]+min_dist[mid][goal]);\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans_dist = BIG_NUM,ans_cost = BIG_NUM,tmp_dist,tmp_cost;\n\tint my_house = 0,next_state,next_cost;\n\n\tbool is_visit_store[N];\n\tint min_item[num_need];\n\n\tfor(int state = 1; state < POW[N]; state++){ //訪れる店の集合のループ\n\t\t//今回のTSPで訪れる店を計算する\n\t\tfor(int loop = 0; loop < N; loop++){\n\t\t\tif(state & (1 << loop)){\n\t\t\t\tis_visit_store[loop] = true;\n\t\t\t}else{\n\t\t\t\tis_visit_store[loop] = false;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < num_need; i++)min_item[i] = BIG_NUM;\n\n\t\t//最小価格を求めつつ、今回訪れる店の組合せで欲しい商品が揃うか調べる\n\t\tfor(int i = 0; i < num_need; i++){\n\t\t\tfor(int k = 0; k < N; k++){\n\t\t\t\tif(!is_visit_store[k])continue;\n\n\t\t\t\tif(value[k][i] != -1){\n\t\t\t\t\tmin_item[i] = min(min_item[i],value[k][i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\ttmp_cost = 0;\n\t\tfor(int i = 0; i < num_need; i++){\n\t\t\tif(min_item[i] == BIG_NUM){\n\t\t\t\ttmp_cost = BIG_NUM;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\ttmp_cost += min_item[i];\n\t\t}\n\n\t\tif(tmp_cost == BIG_NUM || tmp_cost > ans_cost)continue;\n\n\t\tfor(int i = 0; i <= state; i++){\n\t\t\tfor(int k = 0; k < N; k++)TSP[i][k] = BIG_NUM;\n\t\t}\n\n\t\tfor(int first_store = 0; first_store < N; first_store++){\n\t\t\tif(!is_visit_store[first_store])continue;\n\t\t\tTSP[POW[first_store]][first_store] = min_dist[my_house][first_store+1];\n\t\t}\n\n\t\tfor(int tmp_state = 1; tmp_state < state; tmp_state++){\n\t\t\tfor(int last_store = 0; last_store < N; last_store++){\n\t\t\t\tif(TSP[tmp_state][last_store] == BIG_NUM)continue;\n\n\t\t\t\t//次の店へ\n\t\t\t\tfor(int next_store = 0; next_store < N; next_store++){\n\t\t\t\t\tif(!is_visit_store[next_store])continue;\n\t\t\t\t\tif(tmp_state & (1 << next_store))continue; //訪問済ならSKIP\n\n\t\t\t\t\tnext_state = tmp_state+POW[next_store];\n\t\t\t\t\tnext_cost = TSP[tmp_state][last_store]+min_dist[last_store+1][next_store+1]; //★グラフは1オリジン\n\t\t\t\t\tTSP[next_state][next_store] = min(TSP[next_state][next_store],next_cost);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\ttmp_dist = BIG_NUM;\n\t\tfor(int last_store = 0; last_store < N; last_store++){\n\t\t\tif(!is_visit_store[last_store])continue;\n\n\t\t\ttmp_dist = min(tmp_dist,TSP[state][last_store]+min_dist[my_house][last_store+1]);\n\t\t}\n\n\t\tif(ans_cost == tmp_cost){\n\n\t\t\tans_dist = min(ans_dist,tmp_dist);\n\n\t\t}else if(ans_cost > tmp_cost){\n\t\t\tans_cost = tmp_cost;\n\t\t\tans_dist = tmp_dist;\n\t\t}\n\t}\n\n\tif(ans_dist == BIG_NUM){\n\t\tprintf(\"impossible\\n\");\n\t}else{\n\t\tprintf(\"%d %d\\n\",ans_cost,ans_dist);\n\t}\n}\n\n\n\nint main(){\n\n\tfor(int i = 0; i < 17; i++)POW[i] = pow(2,i);\n\n\twhile(true){\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3308,
"score_of_the_acc": -0.3751,
"final_rank": 10
},
{
"submission_id": "aoj_1048_2198626",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\ntypedef pair<int, int> P; // <val, dist>\nP dp[11][1 << 15];\n\nstruct S {\n\tint v, buy;\n\tP d;\n\n\tbool operator <(const S& x) const {\n\t\treturn d > x.d;\n\t}\n};\n\nP rec(S s) {\n\treturn dp[s.v][s.buy];\n}\n\nvoid save(S s) {\n\tdp[s.v][s.buy] = s.d;\n}\n\nstruct edge {\n\tint to, d;\n};\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint N, Q, M;\n\twhile(cin >> N, N) {\n\t\tmap<string, int> store[10];\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tint k;\n\t\t\tcin >> k;\n\t\t\tfor(int j = 0; j < k; j++) {\n\t\t\t\tstring name;\n\t\t\t\tint val;\n\t\t\t\tcin >> name >> val;\n\t\t\t\tstore[i][name] = val;\n\t\t\t}\n\t\t}\n\t\tcin >> Q;\n\t\tvector<string> need(Q);\n\t\tfor(int i = 0; i < Q; i++) {\n\t\t\tcin >> need[i];\n\t\t}\n\t\tcin >> M;\n\t\tvector<edge> G[11];\n\t\tfor(int i = 0; i < M; i++) {\n\t\t\tint a, b, d;\n\t\t\tcin >> a >> b >> d;\n\t\t\ta--, b--;\n\t\t\tif(a == -1) a = N;\n\t\t\tif(b == -1) b = N;\n\t\t\tG[a].push_back({ b, d });\n\t\t\tG[b].push_back({ a, d });\n\t\t}\n\n\t\tpriority_queue<S> q;\n\t\tS s = { N, 0, { 0, 0 } };\n\t\tq.push(s);\n\t\tconst int INF = 1 << 25;\n\t\tfill((P*)begin(dp), (P*)end(dp), P{ INF, INF });\n\t\tsave(s);\n\n\t\twhile(q.size()) {\n\t\t\ts = q.top();\n\t\t\tq.pop();\n\t\t\tif(rec(s) < s.d) continue;\n\t\t\tif(s.v != N) {\n\t\t\t\tfor(int i = 0; i < Q; i++) {\n\t\t\t\t\tif(s.buy >> i & 1) continue;\n\t\t\t\t\tif(store[s.v].count(need[i]) == 0) continue;\n\t\t\t\t\tS ns = s;\n\t\t\t\t\tns.buy |= 1 << i;\n\t\t\t\t\tns.d.first += store[s.v][need[i]];\n\t\t\t\t\tif(rec(ns) > ns.d) {\n\t\t\t\t\t\tsave(ns);\n\t\t\t\t\t\tq.push(ns);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(auto e : G[s.v]) {\n\t\t\t\tS ns = s;\n\t\t\t\tns.v = e.to;\n\t\t\t\tns.d.second += e.d;\n\t\t\t\tif(rec(ns) > ns.d) {\n\t\t\t\t\tsave(ns);\n\t\t\t\t\tq.push(ns);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tP ans = dp[N][(1 << Q) - 1];\n\t\tif(ans.first == INF) {\n\t\t\tcout << \"impossible\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << ans.first << \" \" << ans.second << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 6708,
"score_of_the_acc": -1.16,
"final_rank": 17
},
{
"submission_id": "aoj_1048_2152990",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n\nstruct shop {\n\tint id;\n\tvector<int>prices;\n};\nstruct Edge {\n\tint from;\n\tint to;\n\tint cost;\n};\nstruct aa {\n\tint now;\n\tbitset<11>came;\n\tint cost;\n};\n\nclass Compare {\npublic:\n\tbool operator()(const aa&l, const aa&r) {\n\t\treturn l.cost > r.cost;\n\t}\n};\nint N, Q;\nint solve(const vector<vector<Edge>>&edges, const bitset<11>&fst_came) {\n\tvector<vector<int>>memo(N + 1, vector<int>(1 << (N + 1), 1e9));\n\tpriority_queue<aa, vector<aa>, Compare>que;\n\tque.push(aa{ 0,fst_came,0 });\n\twhile (!que.empty()) {\n\t\taa atop(que.top());\n\t\tque.pop();\n\t\tif (atop.now == 0 && atop.came.count() == N + 1)return atop.cost;\n\t\telse {\n\t\t\tfor (auto e : edges[atop.now]) {\n\t\t\t\tbitset<11>nextcame(atop.came);\n\t\t\t\tnextcame[e.to] = true;\n\t\t\t\tconst int nextcost = atop.cost + e.cost;\n\t\t\t\tif (memo[e.to][nextcame.to_ulong()] > nextcost) {\n\t\t\t\t\tmemo[e.to][nextcame.to_ulong()] = nextcost;\n\t\t\t\t\tque.push(aa{ e.to,nextcame,nextcost });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn 1e9;\n}\n\nint main() {\n\twhile (1) { cin >> N;\n\t\tif (!N)break;\n\t\tvector<shop>shops;\n\t\t{\n\t\t\tmap<string, int>mp;\n\t\t\tint num = 0;\n\t\t\tvector<vector<int>>sells(N,vector<int>(2000,1e7));\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tint k; cin >> k;\n\t\t\t\tshop ash;\n\t\t\t\tash.id = i;\n\t\t\t\tfor (int j = 0; j < k; ++j) {\n\t\t\t\t\tstring st; cin >> st;\n\t\t\t\t\tint price; cin >> price;\n\t\t\t\t\tif (mp.find(st) == mp.end())mp[st] = num++;\n\t\t\t\t\tsells[i][mp[st]] = min(sells[i][mp[st]],price);\n\t\t\t\t}\n\t\t\t}\n\t\t\t cin >> Q;\n\t\t\tvector<int>needs(Q);\n\t\t\tfor (int i = 0; i < Q; ++i) {\n\t\t\t\tstring st; cin >> st;\n\t\t\t\tif (mp.find(st) == mp.end())mp[st] = num++;\n\t\t\t\tneeds[i] = mp[st];\n\t\t\t}\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tshop sh;\n\t\t\t\tsh.id = i;\n\t\t\t\tfor (int j = 0; j < Q; ++j) {\n\t\t\t\t\tsh.prices.push_back(sells[i][needs[j]]);\n\t\t\t\t}\n\t\t\t\tshops.push_back(sh);\n\t\t\t}\n\t\t}\n\t\tvector<vector<Edge>>edges(N+1);\n\t\t{\n\t\t\tint M; cin >> M;\n\t\t\tfor (int i = 0; i < M; ++i) {\n\t\t\t\tint s, t, d; cin >> s >> t >> d;\n\t\t\t\tedges[s].push_back(Edge{ s,t,d });\n\t\t\t\tedges[t].push_back(Edge{ t,s,d });\n\t\t\t}\n\t\t}\n\t\tpair<int, int>ans(1e7,1e8);\n\t\tfor (int b = 0; b < (1 << N); ++b) {\n\t\t\tbitset<10>bs(b);\n\t\t\tint price_sum = 0;\n\t\t\tint aprice = 1e8;\n\t\t\tfor (int j = 0; j < Q; ++j) {\n\t\t\t\tint aprice = 1e8;\n\t\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\t\tif (bs[i])aprice = min(aprice, shops[i].prices[j]);\n\t\t\t\t}\n\t\t\t\tprice_sum += aprice;\n\t\t\t}\n\t\t\tif (ans.first < price_sum)continue;\n\t\t\telse {\n\t\t\t\tbitset<11>came;\n\t\t\t\tcame[0] = true;\n\t\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\t\tif (!bs[i])came[i + 1] = true;\n\t\t\t\t}\n\t\t\t\tint cost = solve(edges, came);\n\t\t\t\tif (cost > 5e8)continue;\n\t\t\t\telse {\n\t\t\t\t\tans = min(ans, make_pair(price_sum, cost));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (ans.first > 6e6) {\n\t\t\tcout << \"impossible\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << ans.first << \" \" << ans.second << endl;\n\t\t}\n\t\t\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3276,
"score_of_the_acc": -0.3717,
"final_rank": 9
},
{
"submission_id": "aoj_1048_2146054",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int INF = 1 << 29;\n\nint main()\n{\n int N, Q, M;\n int graph[11][11];\n int dp[1 << 11][11];\n\n while(cin >> N, N) {\n\n vector< map< string, int > > value(N);\n for(int i = 0; i < N; i++) {\n int k;\n cin >> k;\n while(k--) {\n string name;\n int v;\n cin >> name >> v;\n value[i][name] = v;\n }\n }\n\n cin >> Q;\n vector< string > need(Q);\n for(int i = 0; i < Q; i++) {\n cin >> need[i];\n }\n\n cin >> M;\n fill_n(*graph, 11 * 11, INF);\n for(int i = 0; i < M; i++) {\n int s, t, d;\n cin >> s >> t >> d;\n graph[s][t] = graph[t][s] = d;\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 graph[i][j] = min(graph[i][j], graph[i][k] + graph[k][j]);\n }\n }\n }\n\n fill_n(*dp, 11 * (1 << 11), INF);\n dp[0][0] = 0;\n for(int i = 0; i < (1 << N); i++) {\n for(int j = 0; j < N; j++) {\n if(dp[i][j] == INF) 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] + graph[j][k]);\n }\n }\n }\n\n pair< int, int > ret(INF, INF);\n for(int i = 0; i < (1 << N); i++) {\n vector< int > vv(Q, INF);\n for(int j = 1; j < N; j++) {\n if((i >> j) & 1) {\n for(int k = 0; k < Q; k++) {\n if(value[j - 1].count(need[k])) {\n vv[k] = min(vv[k], value[j - 1][need[k]]);\n }\n }\n }\n }\n if(count(begin(vv), end(vv), INF) > 0) continue;\n ret = min(ret, {accumulate(begin(vv), end(vv), 0), dp[i][0]});\n }\n\n if(ret.first == INF) cout << \"impossible\" << endl;\n else cout << ret.first << \" \" << ret.second << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3140,
"score_of_the_acc": -0.3573,
"final_rank": 6
},
{
"submission_id": "aoj_1048_1867374",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX_N 10\n#define INF 1e9\ntypedef pair<int,int> pii;\ntypedef pair<string,int> psi;\n \nstruct Edge{\n int to,dist;\n Edge(int t,int d) : to(t),dist(d) {}\n};\n \nstruct State{\n int cost,dist,v,S;\n State(int c,int d,int v,int S) \n\t: cost(c),dist(d),v(v),S(S) {}\n bool operator < (const State &s)const{\n\tif(cost != s.cost){\n\t return cost > s.cost;\n\t}else{\n\t return dist > s.dist;\n\t}\n }\n};\n \nint V,E,K[MAX_N],q;\nstring shopping_list[15];\nvector<psi> items[MAX_N];\nvector<Edge> G[MAX_N+1];\n \nvoid solve(){\n priority_queue<State> Q;\n Q.push(State(0,0,0,0));\n pii d[MAX_N+1][1<<15];\n for(int i = 0 ; i <= V ; i++){\n\tfor(int j = 0 ; j < (1<<q) ; j++){\n\t d[i][j] = pii(INF,INF);\n\t}\n }\n d[0][0] = pii(0,0);\n \n while(!Q.empty()){\n\tState s = Q.top(); Q.pop();\n\tint v = s.v,S = s.S;\n\tif(d[v][S] < pii(s.cost,s.dist)) continue;\n\tif(v == 0 && S == (1<<q)-1){\n\t cout << s.cost << \" \" << s.dist << endl;\n\t return;\n\t} \n\tfor(int i = 0 ; i < (int)G[v].size() ; i++){\n\t Edge e = G[v][i];\n\t pii next = pii(d[v][S].first,d[v][S].second+e.dist);\n\t if(next < d[e.to][S]){\n\t\td[e.to][S] = next;\n\t\tQ.push(State(d[e.to][S].first,d[e.to][S].second,e.to,S));\n\t }\n\t if(v == 0) continue;\n\t for(int j = 0 ; j < q ; j++){\n\t\tif((S >> j) & 1) continue;\n\t\tfor(int k = 0 ; k < K[v-1] ; k++){\n\t\t if(shopping_list[j] == items[v-1][k].first){\n\t\t\tpii next = pii(s.cost + items[v-1][k].second,\n\t\t\t\t s.dist + e.dist);\n\t\t\tint nS = S|(1<<j);\n\t\t\tif(next < d[e.to][nS]){\n\t\t\t d[e.to][nS] = next;\n\t\t\t Q.push(State(d[e.to][nS].first,d[e.to][nS].second,e.to,nS));\n\t\t\t}\n\t\t\tnext.second -= e.dist;\n\t\t\tif(next < d[v][nS]){\n\t\t\t d[v][nS] = next;\n\t\t\t Q.push(State(d[v][nS].first,d[v][nS].second,v,nS));\n\t\t\t}\n\t\t }\n\t\t}\n\t }\n\t}\n }\n cout << \"impossible\" << endl;\n}\n \nint main(){\n while(cin >> V, V){\n\tstring name;\n\tint value,a,b,d;\n\tfor(int i = 0 ; i <= V ; i++){\n\t G[i].clear();\n\t}\n\tfor(int i = 0 ; i < V ; i++){\n\t cin >> K[i];\n\t items[i].clear();\n\t for(int j = 0 ; j < K[i] ; j++){\n\t\tcin >> name >> value;\n\t\titems[i].push_back(psi(name,value));\n\t }\n\t}\n\tcin >> q;\n\tfor(int i = 0 ; i < q ; i++){\n\t cin >> shopping_list[i];\n\t}\n\tcin >> E;\n\tfor(int i = 0 ; i < E ; i++){\n\t cin >> a >> b >> d;\n\t G[a].push_back(Edge(b,d));\n\t G[b].push_back(Edge(a,d));\n\t}\n\tsolve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 350,
"memory_kb": 7736,
"score_of_the_acc": -1.6688,
"final_rank": 20
},
{
"submission_id": "aoj_1048_1162590",
"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 size_of(a) (int)a.size()\n#define minit(a,b) memset(a,b,sizeof(a))\n\ntypedef pair< int, int > pii;\n\nconst int iINF = (int)1e9;\n\nstruct Edge {\n\tint t, d, c, s;\n\tEdge(int _t, int _d, int _c, int _s) : t(_t), d(_d), c(_c), s(_s) {}\n\n\tbool operator > (const Edge& a) const {\n\t\treturn (this->c == a.c) ? this->d > a.d : this->c > a.c;\n\t}\n};\n\nint n, q, m;\nvector< map< string, int > > store;\nstring need[15];\n\nvector< vector< Edge > > edges;\n\npii cost[1 << 16][11];\n\nvoid solve() {\n\tfor_(i,0,1<<16) for_(j,0,11) cost[i][j] = pii(iINF, iINF);\n\t\n\tpriority_queue< Edge, vector< Edge >, greater< Edge > > que;\n\tque.push(Edge(0, 0, 0, 0));\n\tcost[0][0] = pii(0, 0);\n\t\n\twhile (!que.empty()) {\n\t\tEdge e = que.top(); que.pop();\n\t\t\n\t\tif (cost[e.s][e.t] < pii(e.c, e.d)) continue;\n\t\t\n\t\tif (e.t > 0) {\n\t\t\tfor_(i,0,q) {\n\t\t\t\tif (e.s >> i & 1) continue;\n\t\t\t\tif (store[e.t - 1].find(need[i]) == store[e.t - 1].end()) continue;\n\t\t\t\t\n\t\t\t\tint val = store[e.t - 1][need[i]];\n\t\t\t\tint ss = e.s | (1 << i);\n\t\t\t\t\n\t\t\t\tif (cost[ss][e.t] > pii(e.c + val, e.d)) {\n\t\t\t\t\tcost[ss][e.t] = pii(e.c + val, e.d);\n\t\t\t\t\tque.push(Edge(e.t, e.d, e.c + val, ss));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint e_size = size_of(edges[e.t]);\n\t\tfor_(i,0,e_size) {\n\t\t\tEdge ei = edges[e.t][i];\n\t\t\t\n\t\t\tif (cost[e.s][ei.t] > pii(e.c, e.d + ei.d)) {\n\t\t\t\tcost[e.s][ei.t] = pii(e.c, e.d + ei.d);\n\t\t\t\tque.push(Edge(ei.t, e.d + ei.d, e.c, e.s));\n\t\t\t}\n\t\t}\n\t}\n\t\n\tpii ans = cost[(1 << q) - 1][0];\n\tif (ans.first == iINF && ans.second == iINF) cout << \"impossible\" << endl;\n\telse cout << ans.first << \" \" << ans.second << endl;\n}\n\nint main() {\n\twhile (cin >> n, n) {\n\t\tstore.assign(n, map< string, int >());\n\t\t\n\t\tfor_(i,0,n) {\n\t\t\tint k; cin >> k;\n\t\t\t\n\t\t\tfor_(j,0,k) {\n\t\t\t\tstring name; int val;\n\t\t\t\tcin >> name >> val;\n\t\t\t\tstore[i][name] = val;\n\t\t\t}\n\t\t}\n\t\t\n\t\tcin >> q;\n\t\tfor_(i,0,q) cin >> need[i];\n\t\t\n\t\tcin >> m;\n\t\tedges.assign(n + 1, vector< Edge >());\n\t\t\n\t\tfor_(i,0,m) {\n\t\t\tint s, t, d; cin >> s >> t >> d;\n\t\t\tedges[s].push_back(Edge(t, d, 0, 0));\n\t\t\tedges[t].push_back(Edge(s, d, 0, 0));\n\t\t}\n\t\t\n\t\tsolve();\n\t}\n\t\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 7772,
"score_of_the_acc": -1.3476,
"final_rank": 18
},
{
"submission_id": "aoj_1048_1157430",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define repi(i,a,b) for(int i=int(a);i<int(b);i++)\n#define rep(i,n) repi(i,0,n)\n#define all(c) begin(c),end(c)\n\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\n\nconstexpr int INF=1e9;\n\nint main()\n{\n\tfor(int n;cin>>n && n;){\n\t\tvector<map<string,int>> ss(n);\n\t\trep(i,n){\n\t\t\tint k; cin>>k;\n\t\t\trep(j,k){\n\t\t\t\tstring name; int value; cin>>name>>value;\n\t\t\t\tss[i][name]=value;\n\t\t\t}\n\t\t}\n\t\tint q; cin>>q;\n\t\tvs ns(q);\n\t\trep(i,q) cin>>ns[i];\n\t\tint m; cin>>m;\n\t\tvvi d(n+1,vi(n+1,INF));\n\t\trep(i,n+1) d[i][i]=0;\n\t\trep(i,m){\n\t\t\tint u,v,w; cin>>u>>v>>w;\n\t\t\t(u+=n)%=n+1; (v+=n)%=n+1;\n\t\t\td[u][v]=d[v][u]=w;\n\t\t}\n\t\t\n\t\trep(k,n+1) rep(i,n+1) rep(j,n+1)\n\t\t\td[i][j]=min(d[i][j],d[i][k]+d[k][j]);\n\t\t\n\t\tvvi dp(1<<n+1,vi(n+1,INF));\n\t\trep(i,n) dp[1<<i][i]=d[n][i];\n\t\trep(i,1<<n+1) rep(j,n+1) if(i>>j&1) rep(k,n+1) if(!(i>>k&1))\n\t\t\tdp[i|1<<k][k]=min(dp[i|1<<k][k],dp[i][j]+d[j][k]);\n\t\t\n\t\ttuple<int,int> res(INF,INF);\n\t\trep(i,1<<n){\n\t\t\tvi ps(q,INF);\n\t\t\trep(j,n) if(i>>j&1)\n\t\t\t\trep(k,q) if(ss[j].count(ns[k]))\n\t\t\t\t\tps[k]=min(ps[k],ss[j][ns[k]]);\n\t\t\tif(count(all(ps),INF)) continue;\n\t\t\tres=min(res,make_tuple(accumulate(all(ps),0),dp[i|1<<n][n]));\n\t\t}\n\t\t\n\t\tif(res==make_tuple(INF,INF))\n\t\t\tcout<<\"impossible\"<<endl;\n\t\telse\n\t\t\tcout<<get<0>(res)<<' '<<get<1>(res)<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1428,
"score_of_the_acc": -0.1761,
"final_rank": 3
},
{
"submission_id": "aoj_1048_1157428",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nint main()\n{\n\tfor(int n;cin>>n && n;){\n\t\tvector<map<string,int>> ss(n);\n\t\trep(i,n){\n\t\t\tint k; cin>>k;\n\t\t\trep(j,k){\n\t\t\t\tstring name; int value; cin>>name>>value;\n\t\t\t\tss[i][name]=value;\n\t\t\t}\n\t\t}\n\t\tint q; cin>>q;\n\t\tvs ns(q);\n\t\trep(i,q) cin>>ns[i];\n\t\tint m; cin>>m;\n\t\tvvi d(n+1,vi(n+1,INF));\n\t\trep(i,n+1) d[i][i]=0;\n\t\trep(i,m){\n\t\t\tint u,v,w; cin>>u>>v>>w;\n\t\t\t(u+=n)%=n+1; (v+=n)%=n+1;\n\t\t\td[u][v]=d[v][u]=w;\n\t\t}\n\t\t\n\t\trep(k,n+1) rep(i,n+1) rep(j,n+1)\n\t\t\td[i][j]=min(d[i][j],d[i][k]+d[k][j]);\n\t\t\n\t\tvvi dp(1<<(n+1),vi(n+1,INF));\n\t\trep(i,n) dp[1<<i][i]=d[n][i];\n\t\trep(i,1<<(n+1)) rep(j,n+1) if(i>>j&1) rep(k,n+1) if(!(i>>k&1))\n\t\t\tdp[i|1<<k][k]=min(dp[i|1<<k][k],dp[i][j]+d[j][k]);\n\t\t\n\t\tpii res(INF,INF);\n\t\trep(i,1<<n){\n\t\t\tvi ps(q,INF);\n\t\t\trep(j,n) if(i>>j&1)\n\t\t\t\trep(k,q) if(ss[j].count(ns[k]))\n\t\t\t\t\tps[k]=min(ps[k],ss[j][ns[k]]);\n\t\t\tif(count(all(ps),INF)) continue;\n\t\t\tres=min(res,mp(accumulate(all(ps),0),dp[i|1<<n][n]));\n\t\t}\n\t\t\n\t\tif(res==mp(INF,INF))\n\t\t\tputs(\"impossible\");\n\t\telse\n\t\t\tprintf(\"%d %d\\n\",res.first,res.second);\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1432,
"score_of_the_acc": -0.1766,
"final_rank": 4
},
{
"submission_id": "aoj_1048_1096128",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX_N 10\n#define INF 1e9\ntypedef pair<int,int> pii;\ntypedef pair<string,int> psi;\n\nstruct Edge{\n int to,dist;\n Edge(int t,int d) : to(t),dist(d) {}\n};\n\nstruct State{\n int cost,dist,v,S;\n State(int c,int d,int v,int S) \n : cost(c),dist(d),v(v),S(S) {}\n bool operator < (const State &s)const{\n if(cost != s.cost){\n return cost > s.cost;\n }else{\n return dist > s.dist;\n }\n }\n};\n\nint V,E,K[MAX_N],q;\nstring shopping_list[15];\nvector<psi> items[MAX_N];\nvector<Edge> G[MAX_N+1];\n\nvoid solve(){\n priority_queue<State> Q;\n Q.push(State(0,0,0,0));\n pii d[MAX_N+1][1<<15];\n for(int i = 0 ; i <= V ; i++){\n for(int j = 0 ; j < (1<<q) ; j++){\n d[i][j] = pii(INF,INF);\n }\n }\n d[0][0] = pii(0,0);\n \n while(!Q.empty()){\n State s = Q.top(); Q.pop();\n int v = s.v,S = s.S;\n if(d[v][S] < pii(s.cost,s.dist)) continue;\n if(v == 0 && S == (1<<q)-1){\n cout << s.cost << \" \" << s.dist << endl;\n return;\n } \n for(int i = 0 ; i < (int)G[v].size() ; i++){\n Edge e = G[v][i];\n pii next = pii(d[v][S].first,d[v][S].second+e.dist);\n if(next < d[e.to][S]){\n d[e.to][S] = next;\n Q.push(State(d[e.to][S].first,d[e.to][S].second,e.to,S));\n }\n if(v == 0) continue;\n for(int j = 0 ; j < q ; j++){\n if((S >> j) & 1) continue;\n for(int k = 0 ; k < K[v-1] ; k++){\n if(shopping_list[j] == items[v-1][k].first){\n pii next = pii(s.cost + items[v-1][k].second,\n s.dist + e.dist);\n int nS = S|(1<<j);\n if(next < d[e.to][nS]){\n d[e.to][nS] = next;\n Q.push(State(d[e.to][nS].first,d[e.to][nS].second,e.to,nS));\n }\n next.second -= e.dist;\n if(next < d[v][nS]){\n d[v][nS] = next;\n Q.push(State(d[v][nS].first,d[v][nS].second,v,nS));\n }\n }\n }\n }\n }\n }\n cout << \"impossible\" << endl;\n}\n\nint main(){\n while(cin >> V, V){\n string name;\n int value,a,b,d;\n for(int i = 0 ; i <= V ; i++){\n G[i].clear();\n }\n for(int i = 0 ; i < V ; i++){\n cin >> K[i];\n items[i].clear();\n for(int j = 0 ; j < K[i] ; j++){\n cin >> name >> value;\n items[i].push_back(psi(name,value));\n }\n }\n cin >> q;\n for(int i = 0 ; i < q ; i++){\n cin >> shopping_list[i];\n }\n cin >> E;\n for(int i = 0 ; i < E ; i++){\n cin >> a >> b >> d;\n G[a].push_back(Edge(b,d));\n G[b].push_back(Edge(a,d));\n }\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 410,
"memory_kb": 5988,
"score_of_the_acc": -1.6338,
"final_rank": 19
},
{
"submission_id": "aoj_1048_881317",
"code_snippet": "#include <cstdlib>\n#include <iostream>\n#include <numeric>\n#include <unordered_map>\n#include <vector>\nusing namespace std;\n\ntemplate<class T> inline void chmin(T &a, const T &b) { if(a > b) a = b; }\n\nint main() {\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tconstexpr int INF = (1 << 25);\n\n\tfor(int n; cin >> n && n;) {\n\t\tvector<vector<pair<string, int>>> supers(n);\n\t\tfor(int i = 0; i < n; ++i) {\n\t\t\tint k;\n\t\t\tcin >> k;\n\n\t\t\tsupers[i].reserve(k);\n\t\t\twhile(k--) {\n\t\t\t\tstring name;\n\t\t\t\tint value;\n\t\t\t\tcin >> name >> value;\n\t\t\t\tsupers[i].emplace_back(name, value);\n\t\t\t}\n\t\t}\n\n\t\tint q;\n\t\tcin >> q;\n\t\tunordered_map<string, int> conv;\n\n\t\tfor(int i = 0; i < q; ++i) {\n\t\t\tstring name;\n\t\t\tcin >> name;\n\t\t\tconv.insert({name, i});\n\t\t}\n\n\t\tvector<vector<int>> costs(n, vector<int>(q, INF));\n\t\tfor(int i = 0; i < n; ++i) {\n\t\t\tfor(const auto &e : supers[i]) {\n\t\t\t\tif(conv.count(e.first)) {\n\t\t\t\t\tcosts[i][conv[e.first]] = e.second;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint m;\n\t\tcin >> m;\n\n\t\tvector<vector<int>> mat(n + 1, vector<int>(n + 1, INF));\n\t\twhile(m--) {\n\t\t\tint s, t, d;\n\t\t\tcin >> s >> t >> d;\n\t\t\ts = (s + n) % (n + 1);\n\t\t\tt = (t + n) % (n + 1);\n\t\t\tmat[s][t] = mat[t][s] = d;\n\t\t}\n\n\t\tfor(int i = 0; i <= n; ++i) mat[i][i] = 0;\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\tchmin(mat[i][j], mat[i][k] + mat[k][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint min_cost = INF, min_dist = INF;\n\t\tfor(int i = 0; i < (1 << n); ++i) {\n\t\t\tvector<int> c(q, INF);\n\t\t\tfor(int j = 0; j < n; ++j) {\n\t\t\t\tif(!(i & (1 << j))) continue;\n\t\t\t\tfor(int k = 0; k < q; ++k) {\n\t\t\t\t\tchmin(c[k], costs[j][k]);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst int sum_cost = accumulate(c.begin(), c.end(), 0);\n\t\t\tif(sum_cost <= min_cost) {\n\t\t\t\tif(sum_cost < min_cost) {\n\t\t\t\t\tmin_cost = sum_cost;\n\t\t\t\t\tmin_dist = INF;\n\t\t\t\t}\n\n\t\t\t\tvector<vector<int>> dp(n, vector<int>(i + 1, INF));\n\t\t\t\tfor(int j = 0; j < n; ++j) {\n\t\t\t\t\tif(i & (1 << j)) {\n\t\t\t\t\t\tdp[j][1 << j] = mat[n][j];\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tfor(int k = 1; k < i; ++k) {\n\t\t\t\t\tif(!(i & k) || (~i & k)) continue;\n\t\t\t\t\tfor(int j = 0; j < n; ++j) {\n\t\t\t\t\t\tif(dp[j][k] == INF) continue;\n\t\t\t\t\t\tfor(int l = 0; l < n; ++l) {\n\t\t\t\t\t\t\tconst int next_visited = (k | (1 << l));\n\t\t\t\t\t\t\tif(k == next_visited || (~i & next_visited)) continue;\n\t\t\t\t\t\t\tchmin(dp[l][next_visited], dp[j][k] + mat[j][l]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tint sum_dist = INF;\n\t\t\t\tfor(int j = 0; j < n; ++j) {\n\t\t\t\t\tchmin(sum_dist, dp[j][i] + mat[j][n]);\n\t\t\t\t}\n\t\t\t\tchmin(min_dist, sum_dist);\n\t\t\t}\n\t\t}\n\n\t\tif(min_cost == INF) {\n\t\t\tcout << \"impossible\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << min_cost << \" \" << min_dist << endl;\n\t\t}\n\t}\n\n\treturn EXIT_SUCCESS;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1308,
"score_of_the_acc": -0.1634,
"final_rank": 2
},
{
"submission_id": "aoj_1048_863740",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\n#include<cstring>\n#include<map>\n\nusing namespace std;\n\nconst int INF = (1<<28);\nconst int MAX = 16;\n\ntypedef pair<string,int> P;\ntypedef pair<int,int> Pii;\n\nstruct edge{int to, cost;};\nstruct State{\n Pii t;\n int pos, need;\n bool operator < (const State& st) const {\n return t > st.t;\n }\n};\n\nmap<string, int> idx;\nint val[MAX];\nvector<edge> E[MAX];\nPii T[MAX][(1<<MAX)];\nint shop[MAX];\nint N,wanted;\n\nvoid init(){\n fill(T[0], T[0]+MAX*(1<<MAX), Pii(INF,INF));\n idx.clear();\n memset(val, -1, sizeof(val));\n wanted = 0;\n for(int i = 0; i < MAX; i++){\n E[i].clear();\n shop[i] = 0;\n }\n}\n\nvoid input(){\n vector<P> v[N];\n int cnt = 0;\n for(int i = 0; i < N; i++){\n int q;\n cin >> q;\n v[i].resize(q);\n for(int j = 0; j < q; j++){\n cin >> v[i][j].first >> v[i][j].second;\n if(!idx.count(v[i][j].first)) idx[v[i][j].first] = cnt++; \n if(val[idx[v[i][j].first]] == -1) val[idx[v[i][j].first]] = v[i][j].second;\n else val[idx[v[i][j].first]] = min(val[idx[v[i][j].first]], v[i][j].second);\n }\n }\n\n\n for(int i = 0; i < N; i++)\n for(int j = 0; j < (int)v[i].size(); j++)\n if(val[idx[v[i][j].first]] == v[i][j].second) shop[i+1] |= (1<<idx[v[i][j].first]);\n \n int q;\n cin >> q;\n while(q--){\n string name;\n cin >> name;\n if(!idx.count(name)) idx[name] = cnt++;\n wanted |= (1<<idx[name]);\n }\n\n\n int m;\n cin >> m;\n while(m--){\n int a,b,c;\n cin >> a >> b >> c;\n E[a].push_back((edge){b,c});\n E[b].push_back((edge){a,c});\n }\n}\n\nvoid solve(){\n\n T[0][wanted] = Pii(0,0);\n priority_queue<State> Q;\n Q.push((State){Pii(0,0),0,wanted});\n\n while(!Q.empty()){\n const State st = Q.top();\n Q.pop();\n\n if(T[st.pos][st.need] < st.t) continue;\n\n for(int i = 0; i < (int)E[st.pos].size(); i++){\n State nex = st;\n nex.t.first = st.t.first;\n nex.t.second += E[st.pos][i].cost;\n nex.pos = E[st.pos][i].to;\n nex.need = st.need;\n\n int canbuy = shop[nex.pos]&nex.need;\n for(int i = 0; i < MAX; i++)\n\tif(canbuy & (1<<i)){\n\t nex.need -= (1<<i);\n\t nex.t.first += val[i];\n\t}\n \n if(T[nex.pos][nex.need] > nex.t){\n\tT[nex.pos][nex.need] = nex.t;\n\tQ.push(nex);\n }\n }\n }\n \n if(T[0][0].first == INF) cout << \"impossible\" << endl;\n else cout << T[0][0].first << \" \" << T[0][0].second << endl;\n}\n\nint main(){\n \n while(cin >> N && N){\n init();\n input();\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 9448,
"score_of_the_acc": -1,
"final_rank": 16
},
{
"submission_id": "aoj_1048_479177",
"code_snippet": "#include<cstdio>\n#include<string>\n#include<vector>\n#include<iostream>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nconst int INF=1<<29;\n\nint main(){\n\tfor(int n;cin>>n,n;){\n\t\tvector<string> name[10];\n\t\tvector<int> price[10];\n\t\trep(i,n){\n\t\t\tint m; cin>>m;\n\t\t\tname[i].resize(m);\n\t\t\tprice[i].resize(m);\n\t\t\trep(j,m) cin>>name[i][j]>>price[i][j];\n\t\t}\n\n\t\tint q; cin>>q;\n\t\tstring want[15];\n\t\trep(i,q) cin>>want[i];\n\n\t\tint m; cin>>m;\n\t\tint d[11][11];\n\t\trep(u,n+1) rep(v,n+1) d[u][v]=(u==v?0:INF);\n\t\trep(i,m){\n\t\t\tint u,v,dd; cin>>u>>v>>dd;\n\t\t\td[u][v]=d[v][u]=min(d[u][v],dd);\n\t\t}\n\t\trep(k,n+1) rep(i,n+1) rep(j,n+1) d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\n\n\t\tint p[10][15];\n\t\trep(i,n) rep(j,q) p[i][j]=INF;\n\t\trep(i,n) rep(j,name[i].size()) rep(k,q) if(name[i][j]==want[k]) p[i][k]=min(p[i][k],price[i][j]);\n\t\tint p_ans=0;\n\t\t// 一番安い店のみ興味がある\n\t\trep(j,q){\n\t\t\tint p_min=INF;\n\t\t\trep(i,n) p_min=min(p_min,p[i][j]);\n\t\t\trep(i,n) if(p[i][j]>p_min) p[i][j]=INF;\n\t\t\tp_ans=min(p_ans+p_min,INF);\n\t\t}\n\t\tif(p_ans==INF){ cout<<\"impossible\"<<endl; continue; }\n\n\t\tif(q==0){ cout<<\"0 0\"<<endl; continue; }\n\n\t\t// TSP\n\t\tint mask[11]={};\n\t\trep(i,n) rep(j,q) if(p[i][j]<INF) mask[i+1]|=1<<j;\n\n\t\tint d_ans=INF;\n\t\tint perm[10]={1,2,3,4,5,6,7,8,9,10};\n\t\tdo{\n\t\t\tint S=0,pos=0,d_now=d[0][perm[0]];\n\t\t\trep(i,n){\n\t\t\t\tpos=perm[i];\n\t\t\t\tS|=mask[pos];\n\t\t\t\tif(S==(1<<q)-1){ d_now+=d[pos][0]; break; }\n\t\t\t\td_now+=d[pos][perm[i+1]];\n\t\t\t}\n\t\t\td_ans=min(d_ans,d_now);\n\t\t}while(next_permutation(perm,perm+n));\n\n\t\tcout<<p_ans<<\" \"<<d_ans<<endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 1224,
"score_of_the_acc": -0.5296,
"final_rank": 14
},
{
"submission_id": "aoj_1048_478109",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <map>\n#include <queue>\n#include <functional>\n#include <cstdio>\nusing namespace std;\n\ntypedef pair<int,int> pii;\n\nconst int INF = 1e9;\n\n\nvoid func(vector<pii> &dp, const vector<pii> &item, int S, int j){\n\tif( j < item.size() ){\n\t\tint x = 1 << item[j].first;\n\t\tif( !(x & S) ){\n\t\t\tpii p(dp[S].first + item[j].second, dp[S].second);\n\t\t\tif( dp[x | S] > p){\n\t\t\t\tdp[x | S] = p;\n\t\t\t\tfunc(dp, item, x | S, j + 1);\n\t\t\t}\n\t\t}\n\t\t\n\t\tfunc(dp, item, S, j + 1);\n\t}\n}\n\n\nvoid dijkstra(\n\tvector<vector<pii> > &dp,\n\tconst vector<vector<pii> > &road,\n\tint n, int S\n){\n\n\n\ttypedef pair<pii,int> piii;\n\n\tpriority_queue<piii,vector<piii>,greater<piii> > pq;\n\tfor(int i = 0; i <= n; ++i){\n\t\tif( dp[i][S].first != INF ){\n\t\t\tpq.push( piii(dp[i][S], i) );\n\t\t}\n\t}\n\n\twhile( !pq.empty() ){\n\t\tpiii p = pq.top();\n\t\tpq.pop();\n\n\t\tint x = p.second;\n\t\tif( dp[x][S] != p.first ) continue;\n\n\t\tfor(int j = 0; j < road[x].size(); ++j){\n\t\t\tint t = road[x][j].first;\n\t\t\tpii next(p.first.first, p.first.second + road[x][j].second);\n\n\t\t\tif(dp[t][S] > next){\n\t\t\t\tdp[t][S] = next;\n\t\t\t\tpq.push( piii(next, t) );\n\t\t\t}\n\t\t}\n\t}\n\n}\n\n\nint main(){\n\tint n;\n\twhile(cin >> n, n != 0){\n\t\tvector<vector<string> > name(n + 1);\n\t\tvector<vector<int> > value(n + 1);\n\t\tstring str;\n\t\tint v, k;\n\t\t\n\t\tfor(int i = 1; i <= n; ++i){\n\t\t\tcin >> k;\n\t\t\tname[i].reserve(k);\n\t\t\tvalue[i].reserve(k);\n\n\t\t\tfor(int j = 0; j < k; ++j){\n\t\t\t\tcin >> str >> v;\n\t\t\t\tname[i].push_back(str);\n\t\t\t\tvalue[i].push_back(v);\n\t\t\t}\n\t\t}\n\t\t\n\t\tint q;\n\t\tcin >> q;\n\t\tmap<string,int> itemtable;\n\t\tfor(int i = 0; i < q; ++i){\n\t\t\tcin >> str;\n\t\t\titemtable[str] = i;\n\t\t}\n\t\t\n\t\tvector<vector<pii> > shop(n + 1);\n\t\tfor(int i = 1; i <= n; ++i){\n\t\t\tfor(int j = 0; j < name[i].size(); ++j){\n\t\t\t\tmap<string,int>::iterator it = itemtable.find(name[i][j]);\n\t\t\t\tif( it != itemtable.end() ){\n\t\t\t\t\tshop[i].push_back( pii(it->second, value[i][j]) );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tvector<vector<pii> > road(n + 1);\n\t\tint m, s, t, d;\n\t\t\n\t\tcin >> m;\n\t\tfor(int i = 0; i < m; ++i){\n\t\t\tcin >> s >> t >> d;\n\t\t\troad[s].push_back( pii(t, d) );\n\t\t\troad[t].push_back( pii(s, d) );\n\t\t}\n\t\t\n\t\tint last = 1 << q;\n\t\tvector<vector<pii> > dp(n + 1, vector<pii>(last, pii(INF, INF) ) );\n\t\tdp[0][0] = pii(0, 0);\n\n\t\tfor(int S = 0; S < last; ++S){\n\t\t\tdijkstra(dp, road, n, S);\n\n\t\t\tfor(int i = 1; i <= n; ++i){\n\t\t\t\tfunc(dp[i], shop[i], S, 0);\n\t\t\t}\n\t\t}\n\t\t\n\t\tint cost = dp[0].back().first;\n\t\tint dist = dp[0].back().second;\n\t\t\n\t\tif( cost == INF ){\n\t\t\tcout << \"impossible\\n\";\n\t\t}\n\t\telse{\n\t\t\tcout << cost << ' ' << dist << '\\n';\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3644,
"score_of_the_acc": -0.5357,
"final_rank": 15
},
{
"submission_id": "aoj_1048_478057",
"code_snippet": "#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <iomanip> \n#include <complex> \n#include <string>\n#include <vector> \n#include <list>\n#include <deque> \n#include <stack> \n#include <queue> \n#include <set>\n#include <map>\n#include <bitset>\n#include <functional>\n#include <utility>\n#include <algorithm> \n#include <numeric> \n#include <typeinfo> \n#include <cstdio>\n#include <cstdlib> \n#include <cstring>\n#include <cmath>\n#include <climits> \n#include <ctime>\nusing namespace std;\n\ntypedef pair<string,int> P;\nint n,q,m;\n\nvector<P> v[11];\nvector<string> name;\nmap<string,int> sale;\nint root[11][11];\nconst int INF=10000000;\nint dpc[11][1<<15];\nint dpd[11][1<<15];\nint ac;\nint ad;\n\nvoid rec(int x,int bit,int c,int d){\n\tif(dpc[x][bit]<c)return;\n\tif(dpc[x][bit]==c && dpd[x][bit]<d)return;\n\tdpc[x][bit]=c;\n\tdpd[x][bit]=d;\n\tint nbit=bit;\n\tint nc=c;\n\tfor(int i=0;i<v[x].size();i++){\n\t\tfor(int j=0;j<name.size();j++){\n\t\t\tif(name[j]==v[x][i].first && !(bit >> j & 1) && sale[name[j]]==v[x][i].second){\n\t\t\t\tnbit |= 1<<j;\n\t\t\t\tnc+=v[x][i].second;\n\t\t\t}\n\t\t}\n\t}\n\tif(nbit==(1<<q)-1){\n\t\tif(nc<ac || (nc==ac && d+root[0][x]<ad)){\n\t\t\tac=nc;\n\t\t\tad=d+root[0][x];\n\t\t}\n\t}else{\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tint nd=d+root[i][x];\n\t\t\tif(dpc[i][nbit]>nc || (dpc[i][nbit]==nc && dpd[i][nbit]>nd)){\n\t\t\t\tdpc[i][nbit]=nc;\n\t\t\t\tdpd[i][nbit]=nd;\n\t\t\t\trec(i,nbit,nc,nd);\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nint main(void){\n\twhile(1){\n\t\tac=INF;\n\t\tad=INF;\n\t\tbool ch=true;\n\t\tfor(int i=0;i<=10;i++){\n\t\t\tfor(int j=0;j<=10;j++){\n\t\t\t\troot[i][j]=INF;\n\t\t\t}\n\t\t\troot[i][i]=0;\n\t\t\tv[i].clear();\n\t\t}\n\t\tfor(int i=0;i<=10;i++){\n\t\t\tfor(int j=0;j<=(1<<15)-1;j++){\n\t\t\t\tdpc[i][j]=INF;\n\t\t\t\tdpd[i][j]=INF;\n\t\t\t}\n\t\t}\n\t\tname.clear();\n\t\tsale.clear();\n\t\tcin >> n;\n\t\tif(n==0)break;\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tint k;\n\t\t\tcin >> k;\n\t\t\tfor(int j=0;j<k;j++){\n\t\t\t\tstring str;\n\t\t\t\tint cost;\n\t\t\t\tcin >> str >> cost;\n\t\t\t\tv[i].push_back(P(str,cost));\n\t\t\t\tif(sale[str]==0)sale[str]=cost;\n\t\t\t\telse sale[str]=min(cost,sale[str]);\n\t\t\t}\n\t\t}\n\t\tcin >> q;\n\t\tfor(int i=0;i<q;i++){\n\t\t\tstring str;\n\t\t\tcin >> str;\n\t\t\tname.push_back(str);\n\t\t\tif(sale[str]==0)ch=false;\n\t\t}\n\t\tcin >> m;\n\t\tfor(int i=0;i<m;i++){\n\t\t\tint s,t,d;\n\t\t\tcin >> s >> t >> d;\n\t\t\troot[s][t]=min(d,root[s][t]);\n\t\t\troot[t][s]=min(d,root[t][s]);\n\t\t}\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\troot[i][j]=min(root[i][j],root[i][k]+root[k][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(ch)rec(0,0,0,0);\n\t\tif(ac>=INF || ch==false)cout << \"impossible\" << endl;\n\t\telse cout << ac << \" \" << ad << endl;\n\t}\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4052,
"score_of_the_acc": -0.4289,
"final_rank": 12
},
{
"submission_id": "aoj_1048_477586",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <set>\n#include <map>\n#include <algorithm>\n#include <cstdio>\n#include <queue>\nusing namespace std;\n\nint main(){\n\tint n;\n\twhile(cin >> n && n){\n\t\tn++;\n\t\tvector< pair<string,int> > shop[16];\n\t\tfor(int i = 1 ; i <= n-1 ; i++){\n\t\t\tint k;\n\t\t\tcin >> k;\n\t\t\tfor(int j = 0 ; j < k ; j++){\n\t\t\t\tstring name;\n\t\t\t\tint value;\n\t\t\t\tcin >> name >> value;\n\t\t\t\tshop[i].push_back( make_pair(name,value) );\n\t\t\t}\n\t\t}\n\t\tset<string> want;\n\t\tvector<string> lst;\n\t\tint q;\n\t\tcin >> q;\n\t\tfor(int i = 0 ; i < q ; i++){\n\t\t\tstring t; cin >> t;\n\t\t\twant.insert(t);\n\t\t\tlst.push_back(t);\n\t\t}\n\t\tvector< pair<int,int> > con;\n\t\t\n\t\tfor(int i = 0 ; i < (1<<n) ; i++){\n\t\t\tset<string> w = want;\n\t\t\tmap<string,int> mini;\n\t\t\tfor(int j = 0 ; j < n ; j++){\n\t\t\t\tif( !(i>>j&1) ) continue;\n\t\t\t\tfor(int k = 0 ; k < shop[j].size() ; k++){\n\t\t\t\t\tw.erase(shop[j][k].first);\n\t\t\t\t\tif( mini.count(shop[j][k].first) == 0 ) mini[shop[j][k].first] = shop[j][k].second;\n\t\t\t\t\telse mini[shop[j][k].first] = min( mini[shop[j][k].first] , shop[j][k].second);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif( w.size() != 0 ) continue;\n\t\t\t\n\t\t\tint sum = 0;\n\t\t\tfor(int j = 0 ; j < q ; j++){\n\t\t\t\tsum += mini[lst[j]];\n\t\t\t}\n\t\t\tcon.push_back(make_pair(sum,i));\n\t\t}\n\t\tint m;\n\t\tcin >> m;\n\t\tint wf[11][11] = {};\n\t\tfor(int i = 0 ; i < n ; i++)\n\t\t\tfor(int j = 0 ; j < n ; j++)\n\t\t\t\twf[i][j] = 1e9;\n\t\tfor(int i = 0 ; i < n ; i++)\n\t\t\twf[i][i] = 0;\n\t\tfor(int i = 0 ; i < m ; i++){\n\t\t\tint s,t,d;\n\t\t\tcin >> s >> t >> d;\n\t\t\twf[s][t] = wf[t][s] = min(wf[s][t],d);\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] = min(wf[j][k],wf[j][i]+wf[i][k]);\n\t\tint dp[1<<11][11] = {};\n\t\tfor(int i = 0 ; i < (1<<11) ; i++)\n\t\t\tfor(int j = 0 ; j < 11 ; j++)\n\t\t\t\tdp[i][j] = 1e9;\n\t\tdp[1][0] = 0;\n\t\tif( con.size() == 0 ){\n\t\t\tcout << \"impossible\" << endl;\n\t\t}else{\n\t\t\tsort(con.begin(),con.end());\n\t\t\tfor(int i = 0 ; i < (1<<n) ; i++){\n\t\t\t\tfor(int j = 0 ; j < n ; j++){\n\t\t\t\t\tif( i >> j & 1 ) {\n\t\t\t\t\t\tfor(int k = 0 ; k < n ; k++){\n\t\t\t\t\t\t\tdp[i|(1<<k)][k] = min(dp[i|(1<<k)][k],dp[i][j]+wf[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\tint distance = 1e9;\n\t\t\tint firstCost = con[0].first;\n\t\t\tfor(int i = 0 ; i < con.size() ; i++){\n\t\t\t\tif( con[0].first != con[i].first ) break;\n\t\t\t\tint bit = con[i].second | 1;\n\t\t\t\tfor(int j = 0 ; j < n ; j++){\n\t\t\t\t\tdistance = min(distance,dp[bit][j]+wf[j][0]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << firstCost << \" \" << distance << endl;\n\t\t\t\n\t\t}\n\t}\n\t\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1352,
"score_of_the_acc": -0.2431,
"final_rank": 5
},
{
"submission_id": "aoj_1048_357296",
"code_snippet": "#include<cstdio>\n#include<cstring>\n#include<string>\n#include<map>\n#include<algorithm>\nusing namespace std;\ntypedef map<string,int>M;\nM shop[10];\nstring name[15];\nint INF=0x3f3f3f3f,edge[11][11],n,q;\nint minCost,minLength;\nvoid F(int s)\n{\n\tint i,j,k;\n\tint cost=0,tempCost;\n\tfor(i=0;i<q;++i)\n\t{\n\t\ttempCost=INF;\n\t\tfor(j=0;j<n;++j)\n\t\t{\n\t\t\tif(!(s&(1<<j)))continue;\n\t\t\tM::iterator ite=shop[j].find(name[i]);\n\t\t\tif(ite!=shop[j].end())\n\t\t\t{\n\t\t\t\ttempCost=min(tempCost,ite->second);\n\t\t\t}\n\t\t}\n\t\tif(tempCost==INF)return;\n\t\tcost+=tempCost;\n\t}\n\tif(minCost<cost)return;\n\tif(minCost>cost)\n\t{\n\t\tminCost=cost;\n\t\tminLength=INF;\n\t}\n\n\ts=(s<<1)+1;\n\tint dp[1<<11][11];\n\tmemset(dp,INF,sizeof(dp));\n\tdp[1][0]=0;\n\tfor(i=1;i<(1<<(n+1));++i)\n\t{\n\t\tif(i&~s)continue;\n\t\tfor(j=0;j<n+1;++j)\n\t\t{\n\t\t\tfor(k=0;k<n+1;++k)\n\t\t\t{\n\t\t\t\tint&r=dp[i|(1<<k)][k];\n\t\t\t\tr=min(r,dp[i][j]+edge[j][k]);\n\t\t\t}\n\t\t}\n\t}\n\tminLength=min(minLength,dp[s][0]);\n}\nint main()\n{\n\tint i,j,k,v,m,a,b,d;\n\tchar str[256];\n\twhile(scanf(\"%d\",&n),n)\n\t{\n\t\tmemset(edge,INF,sizeof(edge));\n\t\tminCost=minLength=INF;\n\t\tfor(i=0;i<n;++i)\n\t\t{\n\t\t\tshop[i].clear();\n\t\t\tfor(scanf(\"%d\",&k);k--;)scanf(\"%s%d\",str,&v),shop[i][str]=v;\n\t\t}\n\t\tfor(i=!scanf(\"%d\",&q);i<q;++i)\n\t\t{\n\t\t\tscanf(\"%s\",str);\n\t\t\tname[i]=str;\n\t\t}\n\t\tfor(scanf(\"%d\",&m);m--;)\n\t\t{\n\t\t\tscanf(\"%d%d%d\",&a,&b,&d);\n\t\t\tedge[a][b]=edge[b][a]=d;\n\t\t}\n\t\tfor(k=0;k<n+1;++k)for(i=0;i<n+1;++i)for(j=0;j<n+1;++j)edge[i][j]=min(edge[i][j],edge[i][k]+edge[k][j]);\n\t\tfor(i=1;i<(1<<n);++i)F(i);\n\t\tif(minCost>=INF)puts(\"impossible\");\n\t\telse printf(\"%d %d\\n\",minCost,minLength);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 936,
"score_of_the_acc": -0.4741,
"final_rank": 13
},
{
"submission_id": "aoj_1048_338291",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <queue>\n#include <map>\n#include <set>\n#include <cstring>\n#include <cstdlib>\n#include <string>\n#include <cmath>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\nconst int INF = 1<<29;\ntypedef int Weight;\ntypedef vector<Weight> Array;\ntypedef vector<Array> Matrix;\n// ツ経ツ路ツつ「ツづァツづ按つ「ツづつォ\nconst int M = 20;\nWeight best[1<<M][M];\n\nWeight shortestHamiltonPath(Matrix w, int s) {\n int n = w.size();\n int N = 1 << n;\n REP(S,N) REP(i,n) best[S][i] = INF;\n best[1<<s][s] = 0;\n REP(S,N) REP(k,n) REP(i,n) if (S&(1<<i))\n REP(j,n)\n best[S|(1<<j)][j] = min(best[S|(1<<j)][j], best[S][i] + w[i][j]);\n Weight res = INF;\n REP(i, n) {\n res = min(res, best[N-1][i] + w[i][s]);\n }\n return res;\n}\n\nint main() {\n int n;\n while(cin>>n,n) {\n map<string, int> mp[n];\n map<string, int> mi;\n REP(i, n) {\n int k;\n cin >> k;\n REP(j, k) {\n string s; int v;\n cin >> s >> v;\n mp[i][s] = v;\n if (mi.count(s) == 0) mi[s] = v;\n else if (mi[s] > v) mi[s] = v;\n }\n }\n int q;cin >> q;\n int mask[n];\n memset(mask, 0, sizeof(mask));\n int ans1 = 0;\n bool dame = 0;\n REP(i, q) {\n string s;\n cin >> s;\n if (mi.count(s) == 0) {\n dame = 1;\n continue;\n }\n ans1 += mi[s];\n REP(j, n) {\n if (mp[j][s] == mi[s]) mask[j] |= 1<<i;\n }\n }\n int m;\n cin >> m;\n Matrix g(n+1, Array(n+1, INF));\n REP(i, m) {\n int s, t, d;\n cin >> s >> t >> d;\n g[s][t] = d;\n g[t][s] = d;\n }\n \n if (dame) {\n cout << \"impossible\" << endl;\n continue;\n }\n // REP(i, n+1) {\n // REP(j, n+1) {\n // cout << g[i][j] << \" \";\n // }\n // cout << endl;\n // }cout << endl;\n int res = INF;\n REP(S, 1<<n) {\n int buy = 0;\n int num = 0;\n REP(i, n) {\n if (S>>i&1) {\n buy |= mask[i];\n num++;\n }\n }\n if (buy != (1<<q)-1) continue;\n Matrix sub(num+1, Array(num+1, INF));\n int y = 0;\n REP(i, n) {\n if (!(S>>i&1)) continue;\n sub[y+1][0] = g[i+1][0];\n sub[0][y+1] = g[0][i+1];\n int x = 0;\n REP(j, n) {\n if (!(S>>j&1)) continue;\n sub[y+1][x+1] = g[i+1][j+1];\n x++;\n }\n y++;\n }\n \n // REP(i, num+1) {\n // REP(j, num+1) {\n // cout << sub[i][j] << \" \";\n // }\n // cout << endl;\n // }cout << endl;\n res = min(res, shortestHamiltonPath(sub, 0));\n }\n if (res == INF) {\n cout << \"impossible\" << endl;\n } else {\n cout << ans1 << \" \" << res << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 1100,
"score_of_the_acc": -0.3664,
"final_rank": 8
},
{
"submission_id": "aoj_1048_312998",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<map>\n#include<numeric>\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)\nconst int N = 11;\nconst int inf = (1<<20);\n\ntemplate <class T> int getindex(T &a,map<T,int> & M){\n int index = M.size();\n if (M.find(a) == M.end())M[a]=index;\n return M[a];\n}\n\nint g[N][N];\nint dp[(1<<N)][N];\nvoid tsp(int n){\n rep(k,n)rep(i,n)rep(j,n)g[i][j]=min(g[i][j],g[i][k]+g[k][j]);\n rep(i,(1<<n))rep(j,n)dp[i][j]=inf;\n dp[1<<0][0]=0;\n rep(i,(1<<n)){\n rep(j,n){//visited\n if (((1<<j)&i) == 0)continue;\n rep(k,n){//unvisited\n\tif ((1<<k)&i)continue;\n\tint next=(1<<k)|i;\n\tdp[next][k]=min(dp[next][k],dp[i][j]+g[j][k]);\n }\n }\n }\n}\n\nvoid solve(int n,map<int,int> *c,vector<int> &req){\n int ac=inf,aw=inf;\n rep(i,(1<<n)){\n if ((1&i) == 0)continue;\n int tc=inf,tw=inf;\n vector<int> mini(req.size(),inf);\n rep(j,n){\n if (((1<<j)&i) == 0)continue;\n tw=min(tw,dp[i][j]+g[j][0]);\n rep(k,(int)req.size()){\n\tif (c[j].find(req[k]) != c[j].end())mini[k]=min(mini[k],c[j][req[k]]);\n }\n tc = accumulate(mini.begin(),mini.end(),0);\n }\n if (tc < ac || (tc == ac && tw < aw))ac=tc,aw=tw;\n }\n if (ac == inf)cout <<\"impossible\"<<endl;\n else cout << ac <<\" \" << aw << endl;\n}\n\nmain(){\n int n;\n while(cin>>n && n){\n rep(i,n+1){rep(j,n+1)g[i][j]=inf;g[i][i]=0;}\n map<string,int> M;\n map<int,int> c[n+1];\n rep(i,n){\n int num;cin>>num;\n rep(j,num){\n\tstring name;int cost,ind;\n\tcin>>name>>cost;\n\tind=getindex(name,M);\n\tc[i+1][ind]=cost;\n }\n }\n\n int req;\n cin>>req;\n vector<int> in(req);\n rep(i,req){\n string tmp;\n cin>>tmp;\n in[i]=getindex(tmp,M);\n }\n \n int m;\n cin>>m;\n rep(i,m){\n int f,t,c;cin>>f>>t>>c;\n g[f][t]=g[t][f]=c;\n }\n tsp(n+1);\n\n solve(n+1,c,in);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_1039_cpp
|
Problem E:
Frisbee Dogs
クレインは, 彼女の愛犬である Jack をフリスビードッグ大会に出場させようとしている. しかし, 彼女は Jack がよい成績を取れるか自信が無い. 彼女のために, 大会をシミュレートして Jack の成績を見積もるプログラムを作成してほしい.
この大会は, 2次元平面上にいる N 匹の犬によって行われる. 大会の開始時点において,
i
番目の犬は (
D
i
x
,
D
i
y
) の位置にいる.
i
番目の犬は
V
i
[m/s] で走ることができ, 全ての犬は十分小さいので点とみなせる. ある時刻に, 2 匹以上の犬が同じ位置にいても構わない.
1枚目のフリスビーの発射をもって大会は開始し, この瞬間から犬たちは動くことを許される. フリスビーもまた点とみなすことができ,
i
枚目のフリスビーは (
FP
i
x
,
FP
i
y
) の位置から (
FV
i
x
,
FV
i
y
) [m/s] の速度ベクトルで発射され, 等速直線運動を続ける. ある犬の位置とフリスビーの位置が等しくなったとき, その犬はフリスビーを取得することができる.
1枚目のフリスビーがいずれかの犬に取得された瞬間, 2枚目のフリスビーが発射される. 2枚目のフリスビーが取得された瞬間3枚目が発射され, 以下同様にフリスビーが取得された直後に次のフリスビーが発射される. M 枚目のフリスビーが取得されると大会は終了する.
言うまでもなく, 犬たちの目標はより多くのフリスビーを取得することである. 犬たちは, 以下のような戦略をとる.
フリスビーが発射されたとき, 犬は可能な限り早い時刻にそれを取得できるように移動し, フリスビーを取得する. ただし, フリスビーを取得できないときは現在いる場所に待機する.
ある犬がフリスビーを取得できるかどうかの判断は, 他の犬の行動に関係なく行われる. つまり, ある犬がフリスビーを取得するために移動したものの, 他の犬に先に取得されてしまうことも有りえる. いずれかの犬がフリスビーを取得し新たなフリスビーが発射された瞬間, 犬たちは新しいフリスビーに対して上記の戦略をとる.
あなたの作成するプログラムは、それぞれの犬が取得したフリスビーの数を出力しなければならない.
Input
入力ファイルは, 複数のデータセットから構成される.
データセットの1行目には, 犬の数 N (1 ≤ N ≤ 10) とフリスビーの数 M (1 ≤ M ≤ 1000)が与えられる.
続く N 行には, 犬の初期位置と速度
D
i
x
,
D
i
y
,
V
i
が1つの空白区切りで与えられる.
続く M 行には, フリスビーの発射位置と速度
FP
i
x
,
FP
i
y
,
FV
i
x
,
FV
i
y
が1つの空白文字区切りで与えられる.
与えられる座標値は実数であり、その絶対値は 1000 を越えない. 与えられる速度は実数であり 1 ≤
DV
i
≤ 100, -25 ≤
FV
i
x
,
FV
i
y
≤ 25 である. どの犬にも取得できないフリスビーはないと仮定してよい.
任意のフリスビーがある犬に時刻
t
で取得されたとき、時刻
t
+ 1e-6 以前にそれを取得できる犬はいない.
シミュレーションの間, 犬の
x
座標,
y
座標の絶対値は 1e+8 を越えない.
N, M がともに 0 のとき入力の終わりを示す.
Output
それぞれの犬が取得したフリスビーの数を, 空白文字で区切って1行に出力せよ. 出力する順番は, 入力で与えられた順番と等しくなければならない.
Sample Input
2 1
12 5 3
0 17 3
0 0 2 2
2 3
2 0 2
100 100 2
0 0 -1 0
-2 -5 0 3
100 100 1 1
0 0
Output for the Sample Input
1 0
2 1
|
[
{
"submission_id": "aoj_1039_7077749",
"code_snippet": "#ifndef HIDDEN_IN_VS // 折りたたみ用\n\n// 警告の抑制\n#define _CRT_SECURE_NO_WARNINGS\n\n// ライブラリの読み込み\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型名の短縮\nusing ll = long long; // -2^63 ～ 2^63 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）\nusing pii = pair<int, int>;\tusing pll = pair<ll, ll>;\tusing pil = pair<int, ll>;\tusing pli = pair<ll, int>;\nusing vi = vector<int>;\t\tusing vvi = vector<vi>;\t\tusing vvvi = vector<vvi>;\nusing vl = vector<ll>;\t\tusing vvl = vector<vl>;\t\tusing vvvl = vector<vvl>;\nusing vb = vector<bool>;\tusing vvb = vector<vb>;\t\tusing vvvb = vector<vvb>;\nusing vc = vector<char>;\tusing vvc = vector<vc>;\t\tusing vvvc = vector<vvc>;\nusing vd = vector<double>;\tusing vvd = vector<vd>;\t\tusing vvvd = vector<vvd>;\ntemplate <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\nusing Graph = vvi;\n\n// 定数の定義\nconst double PI = acos(-1);\nconst vi DX = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\nconst vi DY = { 0, 1, 0, -1 };\nint INF = 1001001001; ll INFL = 4004004004004004004LL;\ndouble EPS = 1e-12;\n\n// 入出力高速化\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;\n\n// 汎用マクロの定義\n#define all(a) (a).begin(), (a).end()\n#define sz(x) ((int)(x).size())\n#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))\n#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))\n#define Yes(b) {cout << ((b) ? \"Yes\\n\" : \"No\\n\");}\n#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順\n#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順\n#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順\n#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）\n#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）\n#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d ビット全探索（昇順）\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\n#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\n\n// 汎用関数の定義\ntemplate <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\n\n// 演算子オーバーロード\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 istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }\n\n// 手元環境（Visual Studio）\n#ifdef _MSC_VER\n#include \"local.hpp\"\n// 提出用（gcc）\n#else\ninline int popcount(int n) { return __builtin_popcount(n); }\ninline int popcount(ll n) { return __builtin_popcountll(n); }\ninline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\n#define gcd __gcd\n#define dump(...)\n#define dumpel(v)\n#define dump_list(v)\n#define input_from_file(f)\n#define output_to_file(f)\n#define Assert(b) { if (!(b)) while (1) cout << \"OLE\"; }\n#endif\n\n#endif // 折りたたみ用\n\n\n////--------------AtCoder 専用--------------\n//#include <atcoder/all>\n//using namespace atcoder;\n//\n////using mint = modint1000000007;\n//using mint = modint998244353;\n////using mint = modint; // mint::set_mod(m);\n//\n//istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\n//ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\n//using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;\n////----------------------------------------\n\n\n//【平面上の点，二次元ベクトル】\n/*\n* 平面における点／二次元ベクトルを表す構造体\n*\n* Point<T>() : O(1)\n*\t(0, 0) で初期化する．\n*\n* Point<T>(T x, T y) : O(1)\n*\t(x, y) で初期化する．\n*\n* p1 == p2, p1 != p2, p1 < p2, p1 > p2, p1 <= p2, p1 >= p2 : O(1)\n*\tx 座標優先，次いで y 座標の大小比較を行う．\n*\n* p1 + p2, p1 - p2, c * p, p * c, p / c : O(1)\n*\tベクトルとみなした加算，減算，スカラー倍，スカラー除算を行う．複合代入演算子も使用可．\n*\n* T sqnorm() : O(1)\n*\t自身の 2 乗ノルムを返す．\n*\n* double norm() : O(1)\n*\t自身のノルムを返す．\n*\n* Point<double> normalize() : O(1)\n*\t自身を正規化したベクトルを返す．\n*\n* T dot(Point<T> p) : O(1)\n*\t自身と p との内積を返す．\n*\n* T cross(Point<T> p) : O(1)\n*\t自身と p との外積を返す．\n*\n* double angle(Point<T> p) : O(1)\n*\t自身から p までの成す角度を返す．\n*/\ntemplate <class T> struct Point {\n\t// 点の x 座標，y 座標\n\tT x, y;\n\n\t// コンストラクタ\n\tPoint() : x(0), y(0) {}\n\tPoint(T x_, T y_) : x(x_), y(y_) {}\n\n\t// 代入\n\tPoint(const Point& old) = default;\n\tPoint& operator=(const Point& other) = default;\n\n\t// キャスト\n\toperator Point<ll>() const { return Point<ll>((ll)x, (ll)y); }\n\toperator Point<double>() const { return Point<double>((double)x, (double)y); }\n\n\t// 入出力\n\tfriend istream& operator>>(istream& is, Point& p) { is >> p.x >> p.y; return is; }\n\tfriend ostream& operator<<(ostream& os, const Point& p) { os << '(' << p.x << ',' << p.y << ')'; return os; }\n\n\t// 比較（x 座標優先）\n\tbool operator==(const Point& p) const { return x == p.x && y == p.y; }\n\tbool operator!=(const Point& p) const { return !(*this == p); }\n\tbool operator<(const Point& p) const { return x == p.x ? y < p.y : x < p.x; }\n\tbool operator>=(const Point& p) const { return !(*this < p); }\n\tbool operator>(const Point& p) const { return x == p.x ? y > p.y : x > p.x; }\n\tbool operator<=(const Point& p) const { return !(*this > p); }\n\n\t// 加算，減算，スカラー倍，スカラー除算\n\tPoint& operator+=(const Point& p) { x += p.x; y += p.y;\treturn *this; }\n\tPoint operator+(const Point& p) const { Point q(*this); return q += p; }\n\tPoint& operator-=(const Point& p) { x -= p.x; y -= p.y;\treturn *this; }\n\tPoint operator-(const Point& p) const { Point q(*this); return q -= p; }\n\tPoint& operator*=(const T& c) { x *= c; y *= c;\treturn *this; }\n\tPoint operator*(const T& c) const { Point q(*this); return q *= c; }\n\tPoint& operator/=(const T& c) { x /= c; y /= c;\treturn *this; }\n\tPoint operator/(const T& c) const { Point q(*this); return q /= c; }\n\tfriend Point operator*(const T& sc, const Point& p) { return p * sc; }\n\tPoint operator-() const { Point a = *this; return a *= -1; }\n\n\t// 二乗ノルム，ノルム，正規化\n\tT sqnorm() const { return x * x + y * y; }\n\tdouble norm() const { return sqrt((double)x * x + (double)y * y); }\n\tPoint<double> normalize() const { return Point<double>(*this) / norm(); }\n\n\t// 内積，外積，成す角度\n\tT dot(const Point& other) const { return x * other.x + y * other.y; }\n\tT cross(const Point& other) const { return x * other.y - y * other.x; }\n\tdouble angle(const Point& other) const {\n\t\treturn atan2(this->cross(other), this->dot(other));\n\t}\n};\n\n\n//【黄金分割探索（実数，下に凸）】O(log((right - left) / EPS))\n/*\n* 全域で狭義に下に凸な関数 f(x) の開区間 (left, right) における最小値を与える x を返す．\n*/\ndouble golden_search_lc(double left, double right, function<double(double)>& f) {\n\t// verify : https://atcoder.jp/contests/arc049/tasks/arc049_b\n\n\tconst double phi = (1 + sqrt(5)) / 2;\n\n\t// l, m1, m2, r の順で区間を φ: 1 :φ に内分する点\n\tdouble l = left;\n\tdouble r = right;\n\tdouble m1 = (l * (1 + phi) + r * phi) / (2 * phi + 1);\n\tdouble m2 = (l * phi + r * (1 + phi)) / (2 * phi + 1);\n\n\t// 内分点における関数値の計算\n\tdouble v1 = f(m1);\n\tdouble v2 = f(m2);\n\n\t// 絶対誤差か相対誤差が EPS 以下になるまで\n\twhile (r - l > EPS && r - l > EPS * (r + l) / 2) {\n\t\t// 左の内分点での値の方が小さければ，次の区間は左側をとる．\n\t\tif (v1 < v2) {\n\t\t\t// 右の内分点を新たに右端とする．\n\t\t\tr = m2;\n\n\t\t\t// 左の内分点を新たに右の内分点とする．\n\t\t\tm2 = m1;\n\t\t\tv2 = v1;\n\n\t\t\t// 左の内分点を新たに計算する．\n\t\t\tm1 = (l * (1 + phi) + r * phi) / (2 * phi + 1);\n\t\t\tv1 = f(m1);\n\t\t}\n\t\t// 右の内分点での値の方が小さければ，次の区間は右側をとる．\n\t\telse {\n\t\t\t// 左の内分点を新たに左端とする．\n\t\t\tl = m1;\n\n\t\t\t// 右の内分点を新たに左の内分点とする．\n\t\t\tm1 = m2;\n\t\t\tv1 = v2;\n\n\t\t\t// 右の内分点を新たに計算する．\n\t\t\tm2 = (l * phi + r * (1 + phi)) / (2 * phi + 1);\n\t\t\tv2 = f(m2);\n\t\t}\n\t}\n\n\t// 最後の候補を比較し，小さかった方の x を返す．\n\treturn (v1 < v2) ? m1 : m2;\n\n\t/* f の定義の雛形\n\tfunction<double(double)> f = [&](double x) {\n\t\treturn x;\n\t};\n\t*/\n}\n\n\n//【二分探索（実数）】O(log(|ok - ng| / EPS))\n/*\n* 条件 okQ() を満たす要素 ok と満たさない要素 ng との境界を二分探索する．\n*/\ntemplate <typename T> T binary_search(T ok, T ng, function<bool(T)>& okQ) {\n\t// verify : https://atcoder.jp/contests/abc189/tasks/abc189_f\n\n\t// 誤差 EPS で境界が決定するまで\n\twhile (true) {\n\t\t// 区間の中間\n\t\tT mid = (ok + ng) / 2;\n\t\t//double mid = sqrt(ok * ng); // 相対誤差を小さくする場合\n\n\t\t// 絶対誤差か相対誤差が EPS 以下なら終了する．\n\t\tT err = abs(ok - ng);\n\t\tif (err <= EPS || err <= abs(mid) * EPS) {\n\t\t\tbreak;\n\t\t}\n\n\t\t// 中間が OK かどうかに応じて区間を縮小する．\n\t\tif (okQ(mid)) ok = mid;\n\t\telse ng = mid;\n\t}\n\treturn (ok + ng) / 2;\n\n\t/* okQ の定義の雛形\n\tfunction<bool(double)> okQ = [&](double x) {\n\t\treturn true || false;\n\t};\n\t*/\n}\n\n\nvoid solve() {\n\tint n, m;\n\tcin >> n >> m;\n\n\tif (n == 0) exit(0);\n\n\tvector<Point<double>> dp(n); vd dv(n);\n\trep(i, n) cin >> dp[i] >> dv[i];\n\n\tvector<Point<double>> fp(m), fv(m);\n\trep(j, m) cin >> fp[j] >> fv[j];\n\n\tdump(dp); dump(dv); dump(fp); dump(fv);\n\n\tvi res(n);\n\n\trep(j, m) {\n\t\tdump(\"----\", j, \"----\");\n\t\tvb moveQ(n);\n\t\tvector<Point<double>> d_dir(n);\n\t\tdouble t_min = (double)INF; int i_min = -1;\n\n\t\trep(i, n) {\n\t\t\tfunction<double(double)> f = [&](double t) {\n\t\t\t\tauto nfp = fp[j] + t * fv[j];\n\t\t\t\tdouble f_dist = (nfp - dp[i]).norm();\n\t\t\t\treturn f_dist / dv[i] - t;\n\t\t\t};\n\n\t\t\tdouble t_ub = golden_search_lc(0., (double)INF, f);\n\t\t\tdump(t_ub);\n\n\t\t\tauto nfp = fp[j] + t_ub * fv[j];\n\t\t\tdouble f_dist = (nfp - dp[i]).norm();\n\n\t\t\tif (f_dist / dv[i] - t_ub <= 1e-6) {\n\t\t\t\tfunction<bool(double)> okQ = [&](double t) {\n\t\t\t\t\tauto nfp = fp[j] + t * fv[j];\n\t\t\t\t\tdouble f_dist = (nfp - dp[i]).norm();\n\t\t\t\t\treturn f_dist / dv[i] - t >= 0;\n\t\t\t\t};\n\n\t\t\t\tdouble t0 = binary_search(0., t_ub, okQ);\n\t\t\t\tdump(t0);\n\n\t\t\t\tauto nfp = fp[j] + t0 * fv[j];\n\n\t\t\t\tmoveQ[i] = true;\n\t\t\t\td_dir[i] = (nfp - dp[i]).normalize();\n\t\t\t\tif (chmin(t_min, t0)) i_min = i;\n\t\t\t}\n\t\t}\n\t\tdump(moveQ); dump(d_dir); dump(t_min); dump(i_min);\n\n\t\trep(i, n) {\n\t\t\tif (!moveQ[i]) continue;\n\n\t\t\tdp[i] += d_dir[i] * dv[i] * t_min;\n\t\t}\n\n\t\tres[i_min]++;\n\t}\n\n\trep(i, n) cout << res[i] << (i < n - 1 ? \" \" : \"\\n\");\n}\n\n\nint main() {\n//\tinput_from_file(\"input.txt\");\n//\toutput_to_file(\"output.txt\");\n\t\n\twhile (true) {\n\t\tsolve();\n\t}\n}",
"accuracy": 1,
"time_ms": 770,
"memory_kb": 3544,
"score_of_the_acc": -1.2732,
"final_rank": 19
},
{
"submission_id": "aoj_1039_4855808",
"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 12\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 \t/*\n\tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}*/\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\n\nstruct Info{\n\n\tdouble dx,dy;\n};\n\nint num_dog,M;\nint ans[SIZE];\ndouble V[SIZE],need_time[SIZE];\nPoint point[SIZE];\nVector vec[SIZE];\n\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\n\nvoid func(){\n\n\tfor(int i = 0; i < num_dog; i++){\n\n\t\tscanf(\"%lf %lf %lf\",&point[i].x,&point[i].y,&V[i]);\n\t\tans[i] = 0;\n\t}\n\n\tPoint loc;\n\tVector tmp_v;\n\n\tdouble A,B,C,D;\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf\",&loc.x,&loc.y,&tmp_v.x,&tmp_v.y);\n\n\t\tfor(int k = 0; k < num_dog; k++){\n\n\t\t\tif(point[k] == loc){\n\n\t\t\t\tneed_time[k] = 0;\n\t\t\t\tvec[k] = Vector(0,0);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tneed_time[k] = DBL_MAX;\n\n\t\t\tA = norm(tmp_v)-V[k]*V[k];\n\t\t\tB = 2*dot(tmp_v,loc-point[k]);\n\t\t\tC = norm(loc-point[k]);\n\n\t\t\tif(fabs(A) > EPS){\n\n\t\t\t\tD = B*B-4*A*C;\n\n\t\t\t\tif(D >= 0){\n\n\t\t\t\t\tif((-B+sqrt(D))/(2*A) >= 0){ //★★負の時間は不可★★\n\n\t\t\t\t\t\tneed_time[k] = (-B+sqrt(D))/(2*A);\n\t\t\t\t\t}\n\t\t\t\t\tif((-B-sqrt(D))/(2*A) >= 0){\n\n\t\t\t\t\t\tneed_time[k] = min(need_time[k],(-B-sqrt(D))/(2*A));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}else if(fabs(B) > EPS){\n\n\t\t\t\tif(-C/(2*B) >= 0){\n\n\t\t\t\t\tneed_time[k] = -C/(2*B);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(fabs(need_time[k]-DBL_MAX) < EPS){ //その場にとどまる\n\n\t\t\t\tvec[k] = Vector(0,0);\n\n\t\t\t}else{\n\n\t\t\t\tPoint tmp_p = loc+tmp_v*need_time[k];\n\t\t\t\tvec[k] = tmp_p - point[k];\n\t\t\t\tvec[k] = vec[k]/abs(vec[k]); //★★単位ベクトルにする★★\n\t\t\t}\n\t\t}\n\n\t\tdouble min_T = DBL_MAX;\n\t\tint min_index;\n\n\t\tfor(int k = 0; k < num_dog; k++){\n\n\t\t\tif(need_time[k]+EPS < min_T){\n\t\t\t\tmin_T = need_time[k];\n\t\t\t\tmin_index = k;\n\t\t\t}\n\t\t}\n\n\t\tans[min_index]++;\n\n\t\tfor(int k = 0; k < num_dog; k++){\n\n\t\t\tpoint[k] = point[k]+vec[k]*min_T*V[k]; //★★注意★★\n\t\t}\n\t}\n\n\tprintf(\"%d\",ans[0]);\n\tfor(int i = 1; i < num_dog; i++){\n\n\t\tprintf(\" %d\",ans[i]);\n\t}\n\tprintf(\"\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d %d\",&num_dog,&M);\n\t\tif(num_dog == 0 && M == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3216,
"score_of_the_acc": -0.8166,
"final_rank": 6
},
{
"submission_id": "aoj_1039_4498113",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <set>\n#include <tuple>\n#include <vector>\n\nusing namespace std;\n\n#define rep(i, n) for (int64_t i = 0; i < (n); i++)\n#define irep(i, n) for (int64_t i = 0; i <= (n); i++)\n#define rrep(i, n) for (int64_t i = (n)-1; i >= 0; i--)\n#define rirep(i, n) for (int64_t i = n; i >= 0; i--)\n\nclass Vec;\nVec operator/(const Vec& v, const double& divisor);\nVec operator*(const double& scale, const Vec& v);\n\nclass Vec {\n using F = double;\n vector<F> container;\n\n public:\n explicit Vec(size_t size) : container(size) {}\n explicit Vec(initializer_list<F> elements)\n : container(elements.begin(), elements.end()) {}\n size_t dim() const { return container.size(); }\n F& operator[](const size_t size) { return container.at(size); }\n const F& operator[](const size_t size) const { return container.at(size); }\n Vec operator+(const Vec& other) const {\n Vec ret(*this);\n for (size_t i = 0; i < dim(); i++) ret[i] += other[i];\n return ret;\n }\n Vec operator-(const Vec& other) const { return (*this) + (-other); }\n Vec operator-() const { return -1.0 * (*this); }\n F inner(const Vec& other) const {\n F acc = 0;\n for (size_t i = 0; i < dim(); i++) {\n acc += (*this)[i] * other[i];\n }\n return acc;\n }\n Vec& operator+=(const Vec& other) {\n for (size_t i = 0; i < dim(); i++) {\n (*this)[i] += other[i];\n }\n return *this;\n }\n F norm() const { return sqrt(inner(*this)); }\n Vec unit() const { return (*this) / this->norm(); }\n F ccw(const Vec& other) const {\n return (*this)[0] * other[1] - other[0] * (*this)[1];\n }\n Vec normal() const { return Vec({-(*this)[1], (*this)[0]}); }\n};\nVec operator/(const Vec& v, const double& divisor) { return 1.0 / divisor * v; }\nVec operator*(const double& scale, const Vec& v) {\n Vec ret(v);\n for (size_t i = 0; i < ret.dim(); i++) ret[i] *= scale;\n return ret;\n}\n\npair<vector<double>, bool> solve_linear(double a, double b, double eps);\npair<vector<double>, bool> solve_quad(double a, double b, double c, double eps);\nvector<double> solve_quad(double a, double b, double eps);\n\n/// solve ax+b=0\npair<vector<double>, bool> solve_linear(double a, double b, double eps) {\n vector<double> sol;\n if (abs(a) > eps) {\n sol.push_back(-b / a);\n return make_pair(sol, false);\n } else if (abs(b) > eps) {\n return make_pair(sol, false);\n } else {\n return make_pair(sol, true);\n }\n}\n\n/// solve ax^2+bx+c=0\npair<vector<double>, bool> solve_quad(double a, double b, double c,\n double eps) {\n if (abs(a) > eps) {\n return make_pair(solve_quad(b / a, c / a, eps), false);\n } else {\n return solve_linear(b, c, eps);\n }\n}\n\n/// solve x^2+ax+b=0\nvector<double> solve_quad(double a, double b, double eps) {\n double det = a * a - 4 * b;\n vector<double> result;\n if (!(det < 0)) {\n if (det < eps) {\n result.push_back(-a / 2);\n } else {\n const double r = sqrt(det) / 2;\n result.push_back(-a / 2 - r);\n result.push_back(-a / 2 + r);\n }\n }\n\n return result;\n}\n\nvoid solve(int N, int M) {\n vector<Vec> dog;\n vector<double> dogv;\n rep(i, N) {\n double x, y, v;\n cin >> x >> y >> v;\n dog.push_back(Vec({x, y}));\n dogv.push_back(v);\n }\n\n vector<int> cnt(N, 0);\n rep(i, M) {\n double x, y, ux, uy;\n cin >> x >> y >> ux >> uy;\n Vec p({x, y}), u({ux, uy});\n\n int j;\n double t = numeric_limits<double>::max();\n\n vector<Vec> v;\n rep(i, N) {\n const Vec d = p - dog[i];\n const double EPS = 1e-9;\n vector<double> sol;\n bool eq;\n tie(sol, eq) = solve_quad(u.norm() * u.norm() - dogv[i] * dogv[i],\n 2 * d.inner(u), d.norm() * d.norm(), EPS);\n if (eq) {\n t = 0;\n j = i;\n v.push_back(Vec({0, 0}));\n } else {\n sol.push_back(numeric_limits<double>::max());\n sort(sol.begin(), sol.end());\n double s =\n *min_element(lower_bound(sol.begin(), sol.end(), 0), sol.end());\n\n const double INF = 1e9;\n if (s < EPS) {\n v.push_back(Vec({0, 0}));\n } else if (s > INF) {\n v.push_back(Vec({0, 0}));\n } else {\n v.push_back(u + d / s);\n }\n if (t > s) {\n t = s;\n j = i;\n }\n }\n }\n cnt[j]++;\n rep(i, N) { dog[i] += t * v[i]; }\n }\n\n rep(i, N) {\n cout << cnt[i];\n if (i < N - 1) cout << \" \";\n }\n cout << \"\\n\";\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int N, M;\n cin >> N >> M;\n while (N != 0 || M != 0) {\n solve(N, M);\n cin >> N >> M;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 3324,
"score_of_the_acc": -0.9224,
"final_rank": 12
},
{
"submission_id": "aoj_1039_4338571",
"code_snippet": "#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\nusing ll = long long;\nconst int INF = 0x3f3f3f3f;\nconst ll LINF = 0x3f3f3f3f3f3f3f3fLL;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n// const int MOD = 998244353;\nconst int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\nconst int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};\ntemplate <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }\ntemplate <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }\nstruct IOSetup {\n IOSetup() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n }\n} iosetup;\n\nnamespace Geometry {\n using Real = double;\n\n int sgn(Real x) { return x > EPS ? 1 : x < -EPS ? -1 : 0; }\n\n Real degree_to_radian(Real d) { return d * M_PI / 180; }\n Real radian_to_degree(Real r) { return r * 180 / M_PI; }\n\n struct Point {\n Real x, y;\n Point(Real x = 0, Real y = 0) : x(x), y(y) {}\n Real abs() const { return sqrt(norm()); }\n Real arg() const { Real res = atan2(y, x); return res < 0 ? res + M_PI * 2 : res; }\n Real norm() const { return x * x + y * y; }\n Point rotate(Real angle) const { Real cs = cos(angle), sn = sin(angle); return Point(x * cs - y * sn, x * sn + y * cs); }\n Point unit_vector() const { Real a = abs(); return Point(x / a, y / a); }\n pair<Point, Point> normal_unit_vector() const { Point p = unit_vector(); return {Point(-p.y, p.x), Point(p.y, -p.x)}; }\n Point &operator+=(const Point &p) { x += p.x; y += p.y; return *this; }\n Point &operator-=(const Point &p) { x -= p.x; y -= p.y; return *this; }\n Point &operator*=(Real k) { x *= k; y *= k; return *this; }\n Point &operator/=(Real k) { x /= k; y /= k; return *this; }\n bool operator<(const Point &p) const { int x_sgn = sgn(p.x - x); return x_sgn != 0 ? x_sgn == 1 : sgn(p.y - y) == 1; }\n bool operator<=(const Point &p) const { return !(p < *this); }\n bool operator>(const Point &p) const { return p < *this; }\n bool operator>=(const Point &p) const { return !(*this < p); }\n Point operator+() const { return *this; }\n Point operator-() const { return Point(-x, -y); }\n Point operator+(const Point &p) const { return Point(*this) += p; }\n Point operator-(const Point &p) const { return Point(*this) -= p; }\n Point operator*(Real k) const { return Point(*this) *= k; }\n Point operator/(Real k) const { return Point(*this) /= k; }\n friend ostream &operator<<(ostream &os, const Point &p) { return os << '(' << p.x << \", \" << p.y << ')'; }\n friend istream &operator>>(istream &is, Point &p) { Real x, y; is >> x >> y; p = Point(x, y); return is; }\n };\n\n struct Segment {\n Point s, t;\n Segment(const Point &s = {0, 0}, const Point &t = {0, 0}) : s(s), t(t) {}\n };\n struct Line : Segment {\n using Segment::Segment;\n Line(Real a, Real b, Real c) {\n if (sgn(a) == 0) {\n s = Point(0, -c / b); t = Point(1, s.y);\n } else if (sgn(b) == 0) {\n s = Point(-c / a, 0); t = Point(s.x, 1);\n } else if (sgn(c) == 0) {\n s = Point(0, 0); t = Point(1, -a / b);\n } else {\n s = Point(0, -c / b); t = Point(-c / a, 0);\n }\n }\n };\n\n struct Circle {\n Point p; Real r;\n Circle(const Point &p = {0, 0}, Real r = 0) : p(p), r(r) {}\n };\n\n Real cross(const Point &a, const Point &b) { return a.x * b.y - a.y * b.x; }\n Real dot(const Point &a, const Point &b) { return a.x * b.x + a.y * b.y; }\n\n int ccw(const Point &a, const Point &b, const Point &c) {\n Point ab = b - a, ac = c - a;\n int sign = sgn(cross(ab, ac));\n if (sign == 0) {\n if (sgn(dot(ab, ac)) == -1) return 2;\n if (sgn(ac.norm() - ab.norm()) == 1) return -2;\n }\n return sign;\n }\n\n Real get_angle(const Point &a, const Point &b, const Point &c) {\n Real ba_arg = (a - b).arg(), bc_arg = (c - b).arg();\n if (ba_arg > bc_arg) swap(ba_arg, bc_arg);\n return min(bc_arg - ba_arg, M_PI * 2 - (bc_arg - ba_arg));\n }\n\n Real closest_pair(vector<Point> ps) {\n int n = ps.size();\n assert(n > 1);\n sort(ALL(ps));\n function<Real(int, int)> rec = [&](int left, int right) {\n int mid = (left + right) >> 1;\n Real x_mid = ps[mid].x, d = LINF;\n if (left + 1 < mid) chmin(d, rec(left, mid));\n if (mid + 1 < right) chmin(d, rec(mid, right));\n inplace_merge(ps.begin() + left, ps.begin() + mid, ps.begin() + right, [&](const Point &a, const Point &b) { return sgn(b.y - a.y) == 1; });\n vector<Point> tmp;\n FOR(i, left, right) {\n if (sgn(abs(ps[i].x - x_mid) - d) == 1) continue;\n for (int j = static_cast<int>(tmp.size()) - 1; j >= 0; --j) {\n Point now = ps[i] - tmp[j];\n if (sgn(now.y - d) == 1) break;\n chmin(d, now.abs());\n }\n tmp.emplace_back(ps[i]);\n }\n return d;\n };\n return rec(0, n);\n }\n\n Point projection(const Segment &a, const Point &b) { return a.s + (a.t - a.s) * dot(a.t - a.s, b - a.s) / (a.t - a.s).norm(); }\n Point reflection(const Segment &a, const Point &b) { return projection(a, b) * 2 - b; }\n\n bool is_parallel(const Segment &a, const Segment &b) { return sgn(cross(a.t - a.s, b.t - b.s)) == 0; }\n bool is_orthogonal(const Segment &a, const Segment &b) { return sgn(dot(a.t - a.s, b.t - b.s)) == 0; }\n\n Real distance(const Point&, const Point&);\n Real distance(const Segment&, const Point&);\n Real distance(const Line&, const Point&);\n int sizeof_common_tangent(const Circle&, const Circle&);\n bool has_intersected(const Segment &a, const Point &b) { return ccw(a.s, a.t, b) == 0; }\n bool has_intersected(const Segment &a, const Segment &b) { return ccw(a.s, a.t, b.s) * ccw(a.s, a.t, b.t) <= 0 && ccw(b.s, b.t, a.s) * ccw(b.s, b.t, a.t) <= 0; }\n bool has_intersected(const Line &a, const Point &b) { int c = ccw(a.s, a.t, b); return c != 1 && c != -1; }\n bool has_intersected(const Line &a, const Segment &b) { return ccw(a.s, a.t, b.s) * ccw(a.s, a.t, b.t) != 1; }\n bool has_intersected(const Line &a, const Line &b) { return sgn(cross(a.t - a.s, b.t - b.s)) != 0 || sgn(cross(a.t - a.s, b.s - a.s)) == 0; }\n bool has_intersected(const Circle &a, const Point &b) { return sgn(distance(a.p, b) - a.r) == 0; }\n bool has_intersected(const Circle &a, const Segment &b) { return sgn(a.r - distance(b, a.p)) != -1 && sgn(max(distance(a.p, b.s), distance(a.p, b.t)) - a.r) != -1; }\n bool has_intersected(const Circle &a, const Line &b) { return sgn(a.r - distance(b, a.p)) != -1; }\n bool has_intersected(const Circle &a, const Circle &b) { return sizeof_common_tangent(a, b) > 0; }\n\n Point intersection(const Line &a, const Line &b) {\n assert(has_intersected(a, b) && !is_parallel(a, b));\n return a.s + (a.t - a.s) * cross(b.t - b.s, b.s - a.s) / cross(b.t - b.s, a.t - a.s);\n }\n Point intersection(const Segment &a, const Segment &b) {\n assert(has_intersected(a, b));\n if (is_parallel(a, b)) {\n if (sgn(distance(a.s, b.s)) == 0) {\n assert(sgn(dot(a.t - a.s, b.t - a.s)) == -1);\n return a.s;\n } else if (sgn(distance(a.s, b.t)) == 0) {\n assert(sgn(dot(a.t - a.s, b.s - a.s)) == -1);\n return a.s;\n } else if (sgn(distance(a.t, b.s)) == 0) {\n assert(sgn(dot(a.s - a.t, b.t - a.t)) == -1);\n return a.t;\n } else if (sgn(distance(a.t, b.t)) == 0) {\n assert(sgn(dot(a.s - a.t, b.s - a.t)) == -1);\n return a.t;\n } else {\n assert(false);\n }\n } else {\n return intersection(Line(a.s, a.t), Line(b.s, b.t));\n }\n }\n Point intersection(const Line &a, const Segment &b) {\n assert(has_intersected(a, b));\n return intersection(a, Line(b.s, b.t));\n }\n vector<Point> intersection(const Circle &a, const Line &b) {\n Point pro = projection(b, a.p);\n Real nor = (a.p - pro).norm();\n int sign = sgn(a.r - sqrt(nor));\n if (sign == -1) return {};\n if (sign == 0) return {pro};\n Point v = (b.t - b.s).unit_vector() * sqrt(a.r * a.r - nor);\n return {pro + v, pro - v};\n }\n vector<Point> intersection(const Circle &a, const Segment &b) {\n if (!has_intersected(a, b)) return {};\n vector<Point> res = intersection(a, Line(b.s, b.t));\n if (sgn(distance(a.p, b.s) - a.r) != -1 && sgn(distance(a.p, b.t) - a.r) != -1) return res;\n return {sgn(dot(res[0] - b.s, res[0] - b.t)) == 1 ? res[1] : res[0]};\n }\n vector<Point> intersection(const Circle &a, const Circle &b) {\n int sz = sizeof_common_tangent(a, b);\n if (sz == 0 || sz == 4) return {};\n Real alpha = (b.p - a.p).arg();\n if (sz == 1 || sz == 3) return {Point(a.p.x + a.r * cos(alpha), a.p.y + a.r * sin(alpha))};\n Real dist = (b.p - a.p).norm(), beta = acos((dist + a.r * a.r - b.r * b.r) / (2 * sqrt(dist) * a.r));\n return {a.p + Point(a.r * cos(alpha + beta), a.r * sin(alpha + beta)), a.p + Point(a.r * cos(alpha - beta), a.r * sin(alpha - beta))};\n }\n\n Real distance(const Point &a, const Point &b) { return (b - a).abs(); }\n Real distance(const Segment &a, const Point &b) {\n Point foot = projection(a, b);\n return has_intersected(a, foot) ? distance(foot, b) : min(distance(a.s, b), distance(a.t, b));\n }\n Real distance(const Segment &a, const Segment &b) { return has_intersected(a, b) ? 0 : min({distance(a, b.s), distance(a, b.t), distance(b, a.s), distance(b, a.t)}); }\n Real distance(const Line &a, const Point &b) { return distance(projection(a, b), b); }\n Real distance(const Line &a, const Segment &b) { return has_intersected(a, b) ? 0 : min(distance(a, b.s), distance(a, b.t)); }\n Real distance(const Line &a, const Line &b) { return has_intersected(a, b) ? 0 : distance(a, b.s); }\n\n vector<Point> tangency(const Circle &a, const Point &b) {\n Real dist = distance(a.p, b);\n int sign = sgn(dist - a.r);\n if (sign == -1) return {};\n if (sign == 0) return {b};\n Real alpha = (b - a.p).arg(), beta = acos(a.r / dist);\n return {a.p + Point(a.r * cos(alpha + beta), a.r * sin(alpha + beta)), a.p + Point(a.r * cos(alpha - beta), a.r * sin(alpha - beta))};\n }\n int sizeof_common_tangent(const Circle &a, const Circle &b) {\n Real dist = distance(a.p, b.p);\n int sign = sgn(a.r + b.r - dist);\n if (sign == -1) return 4;\n if (sign == 0) return 3;\n sign = sgn((sgn(a.r - b.r) == -1 ? b.r - a.r : a.r - b.r) - dist);\n if (sign == -1) return 2;\n if (sign == 0) return 1;\n return 0;\n }\n vector<Line> common_tangent(const Circle &a, const Circle &b) {\n vector<Line> tangents;\n Real dist = distance(a.p, b.p), argument = (b.p - a.p).arg();\n int sign = sgn(a.r + b.r - dist);\n if (sign == -1) {\n Real ac = acos((a.r + b.r) / dist), alpha = argument + ac, cs = cos(alpha), sn = sin(alpha);\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\n alpha = argument - ac; cs = cos(alpha); sn = sin(alpha);\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\n } else if (sign == 0) {\n Point s = a.p + Point(a.r * cos(argument), a.r * sin(argument));\n tangents.emplace_back(s, s + (b.p - a.p).normal_unit_vector().first);\n }\n if (sgn(b.r - a.r) == -1) {\n sign = sgn(a.r - b.r - dist);\n if (sign == -1) {\n Real at = acos((a.r - b.r) / dist), alpha = argument + at, cs = cos(alpha), sn = sin(alpha);\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(b.r * cs, b.r * sn));\n alpha = argument - at; cs = cos(alpha); sn = sin(alpha);\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(b.r * cs, b.r * sn));\n } else if (sign == 0) {\n Point s = a.p + Point(a.r * cos(argument), a.r * sin(argument));\n tangents.emplace_back(s, s + (b.p - a.p).normal_unit_vector().first);\n }\n } else {\n sign = sgn(b.r - a.r - dist);\n if (sign == -1) {\n Real at = acos((b.r - a.r) / dist), alpha = argument - at, cs = cos(alpha), sn = sin(alpha);\n tangents.emplace_back(a.p + Point(-a.r * cs, -a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\n alpha = argument + at; cs = cos(alpha); sn = sin(alpha);\n tangents.emplace_back(a.p + Point(-a.r * cs, -a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\n } else if (sign == 0) {\n Point s = b.p + Point(-b.r * cos(argument), -b.r * sin(argument));\n tangents.emplace_back(s, s + (a.p - b.p).normal_unit_vector().first);\n }\n }\n return tangents;\n }\n\n Real intersection_area(const Circle &a, const Circle &b) {\n Real nor = (b.p - a.p).norm(), dist = sqrt(nor);\n if (sgn(a.r + b.r - dist) != 1) return 0;\n if (sgn(abs(a.r - b.r) - dist) != -1) return min(a.r, b.r) * min(a.r, b.r) * M_PI;\n Real alpha = acos((nor + a.r * a.r - b.r * b.r) / (2 * dist * a.r)), beta = acos((nor + b.r * b.r - a.r * a.r) / (2 * dist * b.r));\n return (alpha - sin(alpha + alpha) * 0.5) * a.r * a.r + (beta - sin(beta + beta) * 0.5) * b.r * b.r;\n }\n\n using Polygon = vector<Point>;\n\n Real area(const Polygon &a) {\n int n = a.size();\n Real res = 0;\n REP(i, n) res += cross(a[i], a[(i + 1) % n]);\n return res * 0.5;\n }\n\n Point centroid(const Polygon &a) {\n Point res(0, 0);\n int n = a.size();\n Real den = 0;\n REP(i, n) {\n Real cro = cross(a[i], a[(i + 1) % n]);\n res += (a[i] + a[(i + 1) % n]) / 3 * cro;\n den += cro;\n }\n return res / den;\n }\n\n int is_contained(const Polygon &a, const Point &b) {\n int n = a.size();\n bool is_in = false;\n REP(i, n) {\n Point p = a[i] - b, q = a[(i + 1) % n] - b;\n if (sgn(q.y - p.y) == -1) swap(p, q);\n int sign = sgn(cross(p, q));\n if (sign == 1 && sgn(p.y) != 1 && sgn(q.y) == 1) is_in = !is_in;\n if (sign == 0 && sgn(dot(p, q)) != 1) return 1;\n }\n return is_in ? 2 : 0;\n }\n\n bool is_convex(const Polygon &a) {\n int n = a.size();\n REP(i, n) {\n if (ccw(a[(i - 1 + n) % n], a[i], a[(i + 1) % n]) == -1) return false;\n }\n return true;\n }\n\n Polygon monotone_chain(vector<Point> ps, bool tight = true) {\n sort(ALL(ps));\n int n = ps.size(), idx = 0;\n Polygon convex_hull(n << 1);\n for (int i = 0; i < n; convex_hull[idx++] = ps[i++]) {\n while (idx >= 2 && sgn(cross(convex_hull[idx - 1] - convex_hull[idx - 2], ps[i] - convex_hull[idx - 1])) < tight) --idx;\n }\n for (int i = n - 2, border = idx + 1; i >= 0; convex_hull[idx++] = ps[i--]) {\n while (idx >= border && sgn(cross(convex_hull[idx - 1] - convex_hull[idx - 2], ps[i] - convex_hull[idx - 1])) < tight) --idx;\n }\n convex_hull.resize(idx - 1);\n return convex_hull;\n }\n\n Polygon cut_convex(const Polygon &a, const Line &b) {\n int n = a.size();\n Polygon res;\n REP(i, n) {\n int c = ccw(b.s, b.t, a[i]);\n if (c != -1) res.emplace_back(a[i]);\n if (c * ccw(b.s, b.t, a[(i + 1) % n]) == -1) res.emplace_back(intersection(Line(a[i], a[(i + 1) % n]), b));\n }\n if (res.size() < 3) res.clear();\n return res;\n }\n\n pair<Point, Point> rotating_calipers(const Polygon &a) {\n int n = a.size(), high = 0, low = 0;\n if (n <= 2) {\n assert(n == 2);\n return {a[0], a[1]};\n }\n FOR(i, 1, n) {\n if (a[i].y > a[high].y) high = i;\n if (a[i].y < a[low].y) low = i;\n }\n Real max_norm = (a[high] - a[low]).norm();\n int i = high, j = low, max_i = i, max_j = j;\n do {\n ((sgn(cross(a[(i + 1) % n] - a[i], a[(j + 1) % n] - a[j])) != -1 ? j : i) += 1) %= n;\n Real tmp = (a[j] - a[i]).norm();\n if (sgn(tmp - max_norm) == 1) {\n max_norm = tmp;\n max_i = i; max_j = j;\n }\n } while (i != high || j != low);\n return {a[max_i], a[max_j]};\n }\n}\n\nvector<double> quadratic_equation(double a, double b, double c) {\n if (abs(a) < EPS) {\n if (abs(b) < EPS) {\n assert(abs(c) >= EPS);\n return {};\n }\n return {-c / b};\n }\n double d = b * b - 4 * a * c;\n if (abs(d) < EPS) return {-0.5 * b / a};\n if (d <= -EPS) return {};\n d = sqrt(d);\n double x1 = -0.5 * (b >= 0 ? b + d : b - d) / a, x2 = c / (x1 * a);\n if (x1 > x2) swap(x1, x2);\n return {x1, x2};\n}\n\nusing namespace Geometry;\n\nint main() {\n while (true) {\n int n, m; cin >> n >> m;\n if (n == 0 && m == 0) break;\n vector<pair<Point, double>> dog;\n REP(_, n) {\n Point d; double v; cin >> d >> v;\n dog.emplace_back(d, v);\n }\n vector<int> ans(n, 0);\n while (m--) {\n Point fp, fv; cin >> fp >> fv;\n vector<double> t(n, INF);\n REP(i, n) {\n Point d; double v; tie(d, v) = dog[i];\n vector<double> ans = quadratic_equation(fv.norm() - v * v, dot(fp - d, fv) * 2, (fp - d).norm());\n while (!ans.empty()) {\n if (ans.back() >= 0) t[i] = ans.back();\n ans.pop_back();\n }\n }\n double frisbee = *min_element(ALL(t));\n // cout << frisbee << '\\n';\n REP(i, n) {\n if (abs(t[i] - INF) < EPS) continue;\n if (abs(frisbee - t[i]) < EPS) ++ans[i];\n Point cat = fp + fv * t[i];\n dog[i].first += (cat - dog[i].first) * frisbee / t[i];\n }\n // REP(i, n) cout << dog[i].first << \" \\n\"[i + 1 == n];\n }\n REP(i, n) cout << ans[i] << \" \\n\"[i + 1 == n];\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3216,
"score_of_the_acc": -0.8258,
"final_rank": 8
},
{
"submission_id": "aoj_1039_3908226",
"code_snippet": "#include <bits/stdc++.h>\n#ifdef LOCAL\n#include \"../cxx-prettyprint/prettyprint.hpp\"\n#endif\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\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#define ALL(x) x.begin(), x.end()\n\n#define INF ((1 << 29)-1)\n#define MOD (1000000007)\n\n#define print2D(h, w, arr) REP(i, h) { REP(j, w) cout << arr[i][j] << \" \"; cout << endl; }\ntemplate<class T> void print(const T& x){cout << x << endl;}\ntemplate<class T, class... A> void print(const T& first, const A&... rest) { cout << first << \" \"; print(rest...); }\nstruct PreMain {PreMain(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} premain;\n\n// ベクトル\nnamespace Geom {\n\n const double eps = 1e-9;\n\n struct Point {\n double x, y;\n explicit Point(double x=0, double y=0): x(x), y(y) {}\n Point& operator+=(const Point& v){ x += v.x; y+= v.y; return *this;}\n Point operator+(const Point& v) const{return Point(*this) += v;}\n Point& operator-=(const Point& v){x -= v.x; y-= v.y; return *this;}\n Point operator-(const Point& v) const{return Point(*this) -= v;}\n Point& operator*=(double s){x *= s; y *= s; return *this;}\n Point operator*(double s) const{return Point(*this) *= s;}\n Point& operator/=(double s){x /= s; y /= s; return *this;}\n Point operator/(double s) const{return Point(*this) /= s;}\n double dot(const Point& v) const {return x*v.x + y*v.y;} /* 内積 */\n double cross(const Point& v) const {return x*v.y - v.x*y;} /* 外積 */\n double norm2() const {return x*x + y*y;} /* ノルムの二乗*/\n double norm() const {return sqrt(norm2());} /* ノルム */\n int quadrant() const { if(y > 0) return x>0 ? 1:2; else return x>0 ? 4:3;} /* 象限判定 */\n Point rot(double theta) {return Point(cos(theta) * x - sin(theta) * y, sin(theta) * x + cos(theta) * y);} // 回転\n Point rot90() {return Point(-y, x);} // 90度回転\n };\n\n ostream& operator<<(ostream& os, const Point& v) {os<<\"(\"<<v.x<<\",\"<<v.y<<\")\"; return os;}\n istream& operator>>(istream& is, Point& v){ is >> v.x >> v.y; return is;}\n\n // 点a, b, cからなる三角形の面積\n double calc_triangle_area(Point a, Point b, Point c) {\n Point v1 = b - a;\n Point v2 = c - a;\n return abs(v1.cross(v2)) / 2;\n }\n\n // 点a, bを通る直線と点cとの距離\n double calc_distance_between_point_and_line(Point a, Point b, Point c) {\n return abs((b-a).cross(c-a)) / (b-a).norm();\n }\n\n // 点a, bを端点とする線分と点cとの距離\n double calc_distance_between_point_and_segment(Point a, Point b, Point c) {\n if ((b-a).dot(c-a) < eps) return (c-a).norm();\n if ((a-b).dot(c-b) < eps) return (c-b).norm();\n return calc_distance_between_point_and_line(a, b, c);\n }\n\n // 点a, bを端点とする線分と点cと点dを端点とする線分の距離\n double calc_distance_between_segments(Point a, Point b, Point c, Point d) {\n double d0 = calc_distance_between_point_and_segment(a, b, c);\n double d1 = calc_distance_between_point_and_segment(a, b, d);\n double d2 = calc_distance_between_point_and_segment(c, d, a);\n double d3 = calc_distance_between_point_and_segment(c, d, b);\n return min(min(d0, d1), min(d2, d3));\n }\n\n enum RELATION_BETWEEN_SEGMENT_AND_POINT {\n COUNTER_CLOCKWISE = 1, // p1とp2のp0を挟んだ位置関係が反時計回り\n CLOCKWISE = -1, // 時計回り\n ONLINE_BACK = 2, // p1とp2がp0を挟んで直線状にある\n ONLINE_FRONT = -2, // p0とp2の間にp1がある\n ON_SEGMENT = 0, // p0とp1の間にp2がある\n };\n\n // 点cが点a, bを端点とする線分のどちら側にあるか、enumで返す\n RELATION_BETWEEN_SEGMENT_AND_POINT ccw_ex(Point p0, Point p1, Point p2) {\n Point v1 = p1 - p0;\n Point v2 = p2 - p0;\n if(v1.cross(v2) > eps) return COUNTER_CLOCKWISE; // 1\n if(v1.cross(v2) < -eps) return CLOCKWISE; // -1\n if(v1.dot(v2) < -eps) return ONLINE_BACK; // 2\n if(v1.norm() < v2.norm()) return ONLINE_FRONT; // -2\n return ON_SEGMENT; // 0\n }\n\n // 点cが点a, bを端点とする線分のどちら側にあるか\n int ccw(Point p0, Point p1, Point p2) {\n Point v1 = p1 - p0;\n Point v2 = p2 - p0;\n if(v1.cross(v2) > eps) return 1;\n if(v1.cross(v2) < -eps) return -1;\n return 0;\n }\n\n // p1,p2を端点とする線分Aとp3,p4を端点とする線分Bの交差判定\n // include_end=trueなら端点が重なっていても交差しているとみなす\n bool intersect(Point p1, Point p2, Point p3, Point p4, bool include_end=true) {\n\n bool is_otherside;\n bool is_inside;\n\n if (include_end){\n is_otherside = ccw(p1,p2,p3) * ccw(p1,p2,p4) <= 0; // Aの両側にBの端点があるかどうか。どちらかがAの直線状にいてもOK\n is_inside = ccw(p3,p4,p1) * ccw(p3,p4,p2) <= 0; // Aの端点の内側にBがいるかどうか。\n } else {\n is_otherside = ccw(p1,p2,p3) * ccw(p1,p2,p4) < 0; // Aの両側にBの端点があるかどうか\n is_inside = ccw(p3,p4,p1) * ccw(p3,p4,p2) < 0; // Aの端点の内側にBがいるかどうか\n }\n return is_otherside && is_inside;\n }\n\n\n // 円\n struct Circle {\n Point c;\n double r;\n Circle(){}\n Circle(Point c, double r):c(c),r(r){}\n\n // 円が点pを含むかどうか include_circumは円周上を含むとするかどうか\n bool does_include_point(Point p, bool include_circum = true){\n double d = (p - c).norm();\n if (include_circum){\n return d < r + eps;\n } else {\n return d < r - eps;\n }\n }\n };\n\n // 点p1, p2を通る半径rの円を返す\n vector<Circle> calc_circle_on_two_points(Point p1, Point p2, double r){\n\n Point p12_half = (p2 - p1) / 2.0;\n\n double n_vec_norm2 = r*r - p12_half.norm2();\n if (n_vec_norm2 < 0) return vector<Circle>();\n\n double n_vec_norm = sqrt(n_vec_norm2);\n Point n_vec = p12_half.rot90() * n_vec_norm / p12_half.norm();\n\n vector<Circle> ret;\n ret.emplace_back(p1 + p12_half + n_vec, 1.0);\n ret.emplace_back(p1 + p12_half - n_vec, 1.0);\n return ret;\n }\n}\n\n\nint main(){\n#ifdef LOCAL\n ifstream in(\"../in.txt\"); cin.rdbuf(in.rdbuf());\n#endif\n using namespace Geom;\n\n while(1){\n int n, m;\n cin >> n >> m;\n if(n == 0 && m == 0){\n break;\n }\n\n vector<int> ans(n, 0);\n double time;\n\n vector<Point> d_pos(n);\n vector<Point> d_dst(n);\n vector<double> d_speed(n);\n\n vector<Point> f_pos(m);\n vector<Point> f_dst(m);\n \n REP(i, n) cin >> d_pos[i] >> d_speed[i];\n REP(i, m) cin >> f_pos[i] >> f_dst[i];\n\n for(int i=0; i<m; i++){\n double min_t = INF;\n int min_dog = n;\n\n time = INF;\n\n /* 最小の時間を求める */\n for(int j=0; j<n; j++){\n double ds = d_speed[j];\n Point dd = f_pos[i] - d_pos[j];\n double a = f_dst[i].norm2() - ds*ds;\n double b = 2 * dd.dot(f_dst[i]);\n double c = dd.norm2();\n if(abs(a) < eps){\n time = -c/b;\n if(time < 0) time = INF;\n //print(\"asdf\");\n } else {\n double D = b*b - 4*a*c;\n if(D < 0) {\n time = INF;\n }else{\n double ans_t1 = (-b + sqrt(D)) / (2*a);\n double ans_t2 = (-b - sqrt(D)) / (2*a);\n if(ans_t1 < 0) ans_t1 = INF;\n if(ans_t2 < 0) ans_t2 = INF;\n time = min(ans_t1, ans_t2); \n }\n }\n\n\n if(time < min_t){\n min_t = time;\n min_dog = j;\n }\n\n d_dst[j] = (f_pos[i] + f_dst[i] * time - d_pos[j]) / time; \n if(time == INF) d_dst[j] = Point(0, 0);\n }\n\n /* 犬の座標を更新する */\n for(int j=0; j<n; j++){\n d_pos[j] += d_dst[j] * min_t;\n }\n\n ans[min_dog]++;\n }\n\n for(int i=0; i<n-1; i++){\n cout << ans[i] <<\" \";\n }\n print(ans[n-1]);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3224,
"score_of_the_acc": -0.8197,
"final_rank": 7
},
{
"submission_id": "aoj_1039_3899618",
"code_snippet": "#pragma GCC optimize (\"O3\")\n\nusing namespace std;\n\n#include <bits/stdc++.h>\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+100)\n#define DOUBLE_EPS (1.0e-12)\n#define MIN_DOUBLE_N (-1.0e+100)\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\nstatic inline DOUBLE ABS(DOUBLE a) { return 0.0 < (a) ? (a) : -(a); };\n\n#define BYTE_BITS (8)\n#define WORD_BITS (16)\n#define DWORD_BITS (32)\n#define QWORD_BITS (64)\n\nstatic const DOUBLE d_PI = 3.14159265357989;\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\n/*----------------------------------------------*/\n\n\nstruct VECTOR_2D {\n DOUBLE dX;\n DOUBLE dY;\n VECTOR_2D(DOUBLE x, DOUBLE y) : dX(x), dY(y) {};\n VECTOR_2D() : dX(0), dY(0) {};\n\n /* 加算 */\n\tVECTOR_2D& operator+= (const VECTOR_2D a)\n { \n dX = dX + a.dX;\n dY = dY + a.dY;\n return *this;\n };\n const VECTOR_2D operator+ (const VECTOR_2D a) const {\n\t\treturn VECTOR_2D(dX + a.dX, dY + a.dY); \n };\n\n /* 減算 */\n\tVECTOR_2D& operator-= (const VECTOR_2D a)\n { \n dX = dX - a.dX;\n dY = dY - a.dY;\n return *this;\n };\n const VECTOR_2D operator- (const VECTOR_2D a) const {\n\t\treturn VECTOR_2D(dX - a.dX, dY - a.dY);\n };\n\n /* 定数倍 */\n\tVECTOR_2D& operator*= (const DOUBLE a)\n { \n dX = dX * a;\n dY = dY * a;\n return *this;\n };\n const VECTOR_2D operator* (const DOUBLE a) const {\n\t\treturn VECTOR_2D(dX * a, dY * a); \n };\n\n DOUBLE norm(void) const {\n return (dX * dX + dY * dY);\n }\n\n DOUBLE dist(void) const {\n return sqrt(norm());\n }\n\n DOUBLE angle(void) const {\n return atan2(dY, dX);\n }\n};\n\n/*----------------------------------------------*/\n\nstruct FRESBEE_ST {\n VECTOR_2D stStrtPos;\n VECTOR_2D stVel;\n\n FRESBEE_ST(const VECTOR_2D &p, const VECTOR_2D &v) : stStrtPos(p), stVel(v) {};\n};\n\n\nstatic bool solve2DEquation(\n DOUBLE dA, DOUBLE dB, DOUBLE dC, DOUBLE &dAns1, DOUBLE &dAns2)\n{\n if (abs(dA) < DOUBLE_EPS) {\n /* 1d equation */\n if (abs(dB) < DOUBLE_EPS) {\n return false;\n } else {\n dAns1 = - dC / dB;\n dAns2 = dAns1;\n return true;\n }\n }\n\n DOUBLE dSq = dB * dB - 4.0 * dA * dC;\n\n if (dSq < 0) {\n return false;\n }\n DOUBLE dAns_a = (-dB + sqrt(dSq)) / (2.0 * dA);\n DOUBLE dAns_b = (-dB - sqrt(dSq)) / (2.0 * dA);\n \n dAns1 = max(dAns_a, dAns_b);\n dAns2 = min(dAns_a, dAns_b);\n return true;\n}\n\n\nstatic DOUBLE getCatchTime(\n DOUBLE dTheta, \n DOUBLE dDist,\n DOUBLE dVelFres,\n DOUBLE dVelDog,\n DOUBLE &dTime)\n{\n DOUBLE dA = (dVelFres * dVelFres - dVelDog * dVelDog);\n DOUBLE dB = -2.0 * dDist * cos(dTheta) * dVelFres;\n DOUBLE dC = dDist * dDist;\n\n DOUBLE dAns1, dAns2;\n\n if (!solve2DEquation(dA, dB, dC, dAns1, dAns2)) {\n// printf(\"2d equation false1\\n\");\n return false;\n }\n\n if (dAns2 < 0) {\n if (dAns1 < 0) {\n// printf(\"2d equation false2\\n\");\n dTime = MAX_DOUBLE;\n return false;\n } else {\n dTime = dAns1;\n }\n } else {\n dTime = dAns2;\n }\n\n// printf(\"2d equation -> time %f\\n\", dTime);\n return true;\n}\n\n\nstatic bool getCatchTimeOneDog(\n SQWORD sqDogIdx,\n DOUBLE dVelDog,\n const vector<VECTOR_2D> &vecstDogPos,\n const FRESBEE_ST &stFresbee,\n DOUBLE &dCatchTime)\n{\n VECTOR_2D stDogPos = vecstDogPos[sqDogIdx];\n VECTOR_2D stFtoD;\n stFtoD = stDogPos - stFresbee.stStrtPos;\n DOUBLE dAngleDog = atan2(stFtoD.dY, stFtoD.dX);\n DOUBLE dAngleFresbee = atan2(stFresbee.stVel.dY, stFresbee.stVel.dX);\n DOUBLE dTheta = min(abs(dAngleDog - dAngleFresbee), (2.0 * d_PI - abs(dAngleDog - dAngleFresbee)));\n\n DOUBLE dDist = stFtoD.dist();\n DOUBLE dVelFres = sqrt(stFresbee.stVel.norm());\n// printf(\"theta = %lf dist = %lf, dVel = %lf\\n\", dTheta, dDist, dVelFres);\n DOUBLE dTime = MAX_DOUBLE;\n\n bool bCatchable = getCatchTime(dTheta, dDist, dVelFres, dVelDog, dTime);\n dCatchTime = dTime;\n\n return bCatchable;\n}\n\nstatic bool solve()\n{\n SQWORD sqN = inputSQWORD();\n SQWORD sqM = inputSQWORD();\n\n// printf(\"solve ---> %d %d\\n\", sqN, sqM);\n\n if ((0 == sqN) && (0 == sqM)) {\n return false;\n }\n\n vector<VECTOR_2D> vecPosDogs;\n vector<DOUBLE> vecdVelDogs;\n vector<FRESBEE_ST> vecstFresbee;\n\n for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {\n DOUBLE dX = inputFP();\n DOUBLE dY = inputFP();\n DOUBLE dV = inputFP();\n vecPosDogs.emplace_back(dX, dY);\n vecdVelDogs.emplace_back(dV);\n }\n for (SQWORD sqIdx = 0; sqIdx < sqM; sqIdx++) {\n DOUBLE dFx = inputFP();\n DOUBLE dFy = inputFP();\n DOUBLE dFvx = inputFP();\n DOUBLE dFvy = inputFP();\n vecstFresbee.emplace_back(VECTOR_2D(dFx, dFy), VECTOR_2D(dFvx, dFvy));\n }\n\n vector<SQWORD> vecCatchCnt(sqN, 0);\n for (SQWORD sqIter = 0; sqIter < sqM; sqIter++) {\n vector<DOUBLE> vecdCatchTime(sqN, MAX_DOUBLE);\n for (SQWORD sqDogIdx = 0; sqDogIdx < sqN; sqDogIdx++) {\n bool bCatchable = getCatchTimeOneDog(sqDogIdx, vecdVelDogs[sqDogIdx], vecPosDogs, \n vecstFresbee[sqIter], vecdCatchTime[sqDogIdx]);\n#if 0\n if (bCatchable) {\n printf(\">>> %llf\\n\", vecdCatchTime[sqDogIdx]);\n } else {\n printf(\">>> NG\\n\");\n }\n#endif\n }\n\n auto min_iter = min_element(vecdCatchTime.begin(), vecdCatchTime.end());\n vecCatchCnt[min_iter - vecdCatchTime.begin()] ++;\n\n DOUBLE dMinCatchTime = *min_iter;\n// printf(\"time [%llf]\\n\", dMinCatchTime);\n\n /* 犬の位置を更新する */\n for (SQWORD sqDogIdx = 0; sqDogIdx < sqN; sqDogIdx++) {\n DOUBLE dCatchTime = vecdCatchTime[sqDogIdx];\n if (dCatchTime != MAX_DOUBLE) {\n VECTOR_2D stInitPos = vecPosDogs[sqDogIdx];\n VECTOR_2D stTargetPos = vecstFresbee[sqIter].stStrtPos + vecstFresbee[sqIter].stVel * dCatchTime;\n VECTOR_2D stNextPos = stInitPos + ((stTargetPos - stInitPos) * (dMinCatchTime / dCatchTime));\n// printf(\"catch [%llf %llf] tgt[%llf %llf]\\n\", dCatchTime, dMinCatchTime, stTargetPos.dX, stTargetPos.dY);\n\n vecPosDogs[sqDogIdx] = stNextPos;\n }\n// printf(\"iter[%d] dog[%d] %llf %llf\\n\", sqIter, sqDogIdx, vecPosDogs[sqDogIdx].dX, vecPosDogs[sqDogIdx].dY);\n }\n }\n for (SDWORD lIdx = 0; lIdx < sqN; lIdx++) {\n printf(\"%lld\", vecCatchCnt[lIdx]);\n if (lIdx != sqN - 1) {\n printf(\" \");\n } else {\n printf(\"\\n\");\n }\n }\n\n return true;\n}\n\nint main(void)\n{\n while(1) {\n if (!solve()) {\n break;\n }\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3624,
"score_of_the_acc": -0.9875,
"final_rank": 14
},
{
"submission_id": "aoj_1039_3899616",
"code_snippet": "#pragma GCC optimize (\"O3\")\n\nusing namespace std;\n\n#include <bits/stdc++.h>\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+100)\n#define DOUBLE_EPS (1.0e-12)\n#define MIN_DOUBLE_N (-1.0e+100)\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\nstatic inline DOUBLE ABS(DOUBLE a) { return 0.0 < (a) ? (a) : -(a); };\n\n#define BYTE_BITS (8)\n#define WORD_BITS (16)\n#define DWORD_BITS (32)\n#define QWORD_BITS (64)\n\nstatic const DOUBLE d_PI = 3.14159265357989;\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\n/*----------------------------------------------*/\n\n\nstruct VECTOR_2D {\n DOUBLE dX;\n DOUBLE dY;\n VECTOR_2D(DOUBLE x, DOUBLE y) : dX(x), dY(y) {};\n VECTOR_2D() : dX(0), dY(0) {};\n\n /* 加算 */\n\tVECTOR_2D& operator+= (const VECTOR_2D a)\n { \n dX = dX + a.dX;\n dY = dY + a.dY;\n return *this;\n };\n const VECTOR_2D operator+ (const VECTOR_2D a) const {\n\t\treturn VECTOR_2D(dX + a.dX, dY + a.dY); \n };\n\n /* 減算 */\n\tVECTOR_2D& operator-= (const VECTOR_2D a)\n { \n dX = dX - a.dX;\n dY = dY - a.dY;\n return *this;\n };\n const VECTOR_2D operator- (const VECTOR_2D a) const {\n\t\treturn VECTOR_2D(dX - a.dX, dY - a.dY);\n };\n\n /* 定数倍 */\n\tVECTOR_2D& operator*= (const DOUBLE a)\n { \n dX = dX * a;\n dY = dY * a;\n return *this;\n };\n const VECTOR_2D operator* (const DOUBLE a) const {\n\t\treturn VECTOR_2D(dX * a, dY * a); \n };\n\n DOUBLE norm(void) const {\n return (dX * dX + dY * dY);\n }\n\n DOUBLE dist(void) const {\n return sqrt(norm());\n }\n\n DOUBLE angle(void) const {\n return atan2(dY, dX);\n }\n};\n\n/*----------------------------------------------*/\n\nstruct FRESBEE_ST {\n VECTOR_2D stStrtPos;\n VECTOR_2D stVel;\n\n FRESBEE_ST(const VECTOR_2D &p, const VECTOR_2D &v) : stStrtPos(p), stVel(v) {};\n};\n\n\nstatic bool solve2DEquation(\n DOUBLE dA, DOUBLE dB, DOUBLE dC, DOUBLE &dAns1, DOUBLE &dAns2)\n{\n if (abs(dA) < DOUBLE_EPS) {\n /* 1d equation */\n if (abs(dB) < DOUBLE_EPS) {\n return false;\n } else {\n dAns1 = - dC / dB;\n dAns2 = dAns1;\n return true;\n }\n }\n\n DOUBLE dSq = dB * dB - 4.0 * dA * dC;\n\n if (dSq < 0) {\n return false;\n }\n DOUBLE dAns_a = (-dB + sqrt(dSq)) / (2.0 * dA);\n DOUBLE dAns_b = (-dB - sqrt(dSq)) / (2.0 * dA);\n \n dAns1 = max(dAns_a, dAns_b);\n dAns2 = min(dAns_a, dAns_b);\n return true;\n}\n\n\nstatic DOUBLE getCatchTime(\n DOUBLE dTheta, \n DOUBLE dDist,\n DOUBLE dVelFres,\n DOUBLE dVelDog,\n DOUBLE &dTime)\n{\n DOUBLE dA = (dVelFres * dVelFres - dVelDog * dVelDog);\n DOUBLE dB = -2.0 * dDist * cos(dTheta) * dVelFres;\n DOUBLE dC = dDist * dDist;\n\n DOUBLE dAns1, dAns2;\n\n if (!solve2DEquation(dA, dB, dC, dAns1, dAns2)) {\n// printf(\"2d equation false1\\n\");\n return false;\n }\n\n if (dAns2 < 0) {\n if (dAns1 < 0) {\n// printf(\"2d equation false2\\n\");\n dTime = MAX_DOUBLE;\n return false;\n } else {\n dTime = dAns1;\n }\n } else {\n dTime = dAns2;\n }\n\n// printf(\"2d equation -> time %f\\n\", dTime);\n return true;\n}\n\n\nstatic bool getCatchTimeOneDog(\n SQWORD sqDogIdx,\n DOUBLE dVelDog,\n const vector<VECTOR_2D> &vecstDogPos,\n const FRESBEE_ST &stFresbee,\n DOUBLE &dCatchTime)\n{\n VECTOR_2D stDogPos = vecstDogPos[sqDogIdx];\n VECTOR_2D stFtoD;\n stFtoD = stDogPos - stFresbee.stStrtPos;\n DOUBLE dAngleDog = atan2(stFtoD.dY, stFtoD.dX);\n DOUBLE dAngleFresbee = atan2(stFresbee.stVel.dY, stFresbee.stVel.dX);\n DOUBLE dTheta = min(ABS(dAngleDog - dAngleFresbee), (2.0 * d_PI - ABS(dAngleDog - dAngleFresbee)));\n\n DOUBLE dDist = stFtoD.dist();\n DOUBLE dVelFres = sqrt(stFresbee.stVel.norm());\n// printf(\"theta = %lf dist = %lf, dVel = %lf\\n\", dTheta, dDist, dVelFres);\n DOUBLE dTime = MAX_DOUBLE;\n\n bool bCatchable = getCatchTime(dTheta, dDist, dVelFres, dVelDog, dTime);\n dCatchTime = dTime;\n\n return bCatchable;\n}\n\nstatic bool solve()\n{\n SQWORD sqN = inputSQWORD();\n SQWORD sqM = inputSQWORD();\n\n// printf(\"solve ---> %d %d\\n\", sqN, sqM);\n\n if ((0 == sqN) && (0 == sqM)) {\n return false;\n }\n\n vector<VECTOR_2D> vecPosDogs;\n vector<DOUBLE> vecdVelDogs;\n vector<FRESBEE_ST> vecstFresbee;\n\n for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {\n DOUBLE dX = inputFP();\n DOUBLE dY = inputFP();\n DOUBLE dV = inputFP();\n vecPosDogs.emplace_back(dX, dY);\n vecdVelDogs.emplace_back(dV);\n }\n for (SQWORD sqIdx = 0; sqIdx < sqM; sqIdx++) {\n DOUBLE dFx = inputFP();\n DOUBLE dFy = inputFP();\n DOUBLE dFvx = inputFP();\n DOUBLE dFvy = inputFP();\n vecstFresbee.emplace_back(VECTOR_2D(dFx, dFy), VECTOR_2D(dFvx, dFvy));\n }\n\n vector<SQWORD> vecCatchCnt(sqN, 0);\n for (SQWORD sqIter = 0; sqIter < sqM; sqIter++) {\n vector<DOUBLE> vecdCatchTime(sqN, MAX_DOUBLE);\n for (SQWORD sqDogIdx = 0; sqDogIdx < sqN; sqDogIdx++) {\n bool bCatchable = getCatchTimeOneDog(sqDogIdx, vecdVelDogs[sqDogIdx], vecPosDogs, \n vecstFresbee[sqIter], vecdCatchTime[sqDogIdx]);\n#if 0\n if (bCatchable) {\n printf(\">>> %llf\\n\", vecdCatchTime[sqDogIdx]);\n } else {\n printf(\">>> NG\\n\");\n }\n#endif\n }\n\n auto min_iter = min_element(vecdCatchTime.begin(), vecdCatchTime.end());\n vecCatchCnt[min_iter - vecdCatchTime.begin()] ++;\n\n DOUBLE dMinCatchTime = *min_iter;\n// printf(\"time [%llf]\\n\", dMinCatchTime);\n\n /* 犬の位置を更新する */\n for (SQWORD sqDogIdx = 0; sqDogIdx < sqN; sqDogIdx++) {\n DOUBLE dCatchTime = vecdCatchTime[sqDogIdx];\n if (dCatchTime != MAX_DOUBLE) {\n VECTOR_2D stInitPos = vecPosDogs[sqDogIdx];\n VECTOR_2D stTargetPos = vecstFresbee[sqIter].stStrtPos + vecstFresbee[sqIter].stVel * dCatchTime;\n VECTOR_2D stNextPos = stInitPos + ((stTargetPos - stInitPos) * (dMinCatchTime / dCatchTime));\n// printf(\"catch [%llf %llf] tgt[%llf %llf]\\n\", dCatchTime, dMinCatchTime, stTargetPos.dX, stTargetPos.dY);\n\n vecPosDogs[sqDogIdx] = stNextPos;\n }\n// printf(\"iter[%d] dog[%d] %llf %llf\\n\", sqIter, sqDogIdx, vecPosDogs[sqDogIdx].dX, vecPosDogs[sqDogIdx].dY);\n }\n }\n for (SDWORD lIdx = 0; lIdx < sqN; lIdx++) {\n printf(\"%lld\", vecCatchCnt[lIdx]);\n if (lIdx != sqN - 1) {\n printf(\" \");\n } else {\n printf(\"\\n\");\n }\n }\n\n return true;\n}\n\nint main(void)\n{\n while(1) {\n if (!solve()) {\n break;\n }\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3704,
"score_of_the_acc": -1.0183,
"final_rank": 16
},
{
"submission_id": "aoj_1039_3897653",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <cmath>\n#include <numeric>\n#include <tuple>\n#include <assert.h>\n\n#define sqr(x) std::pow(x, 2.0)\n#define INF 1e10\n#define REP(i, n) for (int i = 0; i < n; i++)\n#define POS_OR_INF(x) (x > 0 ? x : INF)\n\nusing namespace std;\n\nstruct Point {\n\tdouble x;\n\tdouble y;\n};\n\ninline istream& operator >> (istream& is, Point& p) {\n\treturn is >> p.x >> p.y;\n}\n\ntypedef Point Vector;\n\nstruct Dog {\n\tPoint position;\n\tdouble speed;\n};\n\ninline std::pair<double, double> solve(const Dog& dog, const Point& fp, const Vector& fv) {\n\tVector d = { fp.x - dog.position.x, fp.y - dog.position.y };\n\n\tdouble a = fv.x * fv.x + fv.y * fv.y - dog.speed * dog.speed;\n\tdouble b = d.x * fv.x + d.y * fv.y;\n\tdouble c = d.x * d.x + d.y * d.y;\n\tdouble det = b * b - a * c;\n\n\tif (det < 0) return make_pair(INF, INF);\n\n\tdouble t1 = (-b + sqrt(det)) / a;\n\tdouble t2 = (-b - sqrt(det)) / a;\n\tdouble t = min(POS_OR_INF(t1), POS_OR_INF(t2));\n\n\tif (t < 0 || t == INF) return make_pair(INF, INF);\n\n\tdouble rad = atan2(d.y + fv.y * t, d.x + fv.x * t);\n\n\t// check\n\t//double xf = fp.x + fv.x * t; double xd = d.position.x + d.speed * t * cos(rad);\n\t//double yf = fp.y + fv.y * t; double yd = d.position.y + d.speed * t * sin(rad);\n\n\treturn make_pair(t, rad);\n}\n\n\nint main(int argc, char** argv) {\n\twhile (1) {\n\t\tint N, M;\n\t\tcin >> N >> M;\n\n\t\tif (N == 0 && M == 0) break;\n\n\t\tvector<Dog> dogs(N);\n\t\tvector<int> frisbees(N);\n\n\t\tREP(i, N)\n\t\t\tcin >> dogs[i].position >> dogs[i].speed;\n\n\t\tREP(i, M) {\n\t\t\tPoint fp, fv;\n\t\t\tvector<double> t(N), rad(N);\n\n\t\t\tcin >> fp >> fv;\n\n\t\t\tREP(j, N)\n\t\t\t\ttie(t[j], rad[j]) = solve(dogs[j], fp, fv);\n\n\t\t\tauto best = min_element(t.begin(), t.end());\n\n\t\t\tfrisbees[best - t.begin()]++;\n\n\t\t\t// move dogs\n\t\t\tREP(j, N) {\n\t\t\t\tif (t[j] == INF) continue;\n\t\t\t\tdogs[j].position.x += dogs[j].speed * cos(rad[j]) * *best;\n\t\t\t\tdogs[j].position.y += dogs[j].speed * sin(rad[j]) * *best;\n\t\t\t}\n\t\t}\n\n\t\tREP(i, N)\n\t\t\tcout << frisbees[i] << (i == N - 1 ? \"\\n\" : \" \");\n\t}\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3548,
"score_of_the_acc": -0.9858,
"final_rank": 13
},
{
"submission_id": "aoj_1039_3897646",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <cmath>\n#include <numeric>\n#include <tuple>\n#include <assert.h>\n\n#define sqr(x) std::pow(x, 2.0)\n#define INF 1e10\n#define REP(i, n) for (int i = 0; i < n; i++)\n#define POS_OR_INF(x) (x > 0 ? x : INF)\n\nusing namespace std;\n\nstruct Point {\n\tdouble x;\n\tdouble y;\n};\n\ninline istream& operator >> (istream& is, Point& p) {\n\treturn is >> p.x >> p.y;\n}\n\ntypedef Point Vector;\n\nstruct Dog {\n\tPoint position;\n\tdouble speed;\n\tint n_frisbees;\n};\n\ninline std::pair<double, double> solve(const Dog& dog, const Point& fp, const Vector& fv) {\n\tVector d = { fp.x - dog.position.x, fp.y - dog.position.y };\n\n\tdouble a = fv.x * fv.x + fv.y * fv.y - dog.speed * dog.speed;\n\tdouble b = d.x * fv.x + d.y * fv.y;\n\tdouble c = d.x * d.x + d.y * d.y;\n\tdouble det = b * b - a * c;\n\n\tif (det < 0) return make_pair(INF, INF);\n\n\tdouble t1 = (-b + sqrt(det)) / a;\n\tdouble t2 = (-b - sqrt(det)) / a;\n\tdouble t = min(POS_OR_INF(t1), POS_OR_INF(t2));\n\n\tif (t < 0 || t == INF) return make_pair(INF, INF);\n\n\tdouble rad = atan2(d.y + fv.y * t, d.x + fv.x * t);\n\n\t// check\n\t//double xf = fp.x + fv.x * t; double xd = d.position.x + d.speed * t * cos(rad);\n\t//double yf = fp.y + fv.y * t; double yd = d.position.y + d.speed * t * sin(rad);\n\n\treturn make_pair(t, rad);\n}\n\n\nint main(int argc, char** argv) {\n\twhile (1) {\n\t\tint N, M;\n\t\tcin >> N >> M;\n\n\t\tif (N == 0 && M == 0) break;\n\n\t\tvector<Dog> dogs(N);\n\n\t\tREP(i, N) {\n\t\t\tcin >> dogs[i].position >> dogs[i].speed;\n\t\t\tdogs[i].n_frisbees = 0;\n\t\t}\n\n\t\tREP(i, M) {\n\t\t\tPoint fp, fv;\n\t\t\tvector<double> t(N), rad(N);\n\n\t\t\tcin >> fp >> fv;\n\n\t\t\tREP(j, N)\n\t\t\t\ttie(t[j], rad[j]) = solve(dogs[j], fp, fv);\n\n\t\t\tauto best = min_element(t.begin(), t.end());\n\n\t\t\tdogs[best - t.begin()].n_frisbees++;\n\n\t\t\t// move dogs\n\t\t\tREP(j, N) {\n\t\t\t\tif (t[j] == INF) continue;\n\t\t\t\tdogs[j].position.x += dogs[j].speed * cos(rad[j]) * *best;\n\t\t\t\tdogs[j].position.y += dogs[j].speed * sin(rad[j]) * *best;\n\t\t\t}\n\t\t}\n\n\t\tREP(i, N)\n\t\t\tcout << dogs[i].n_frisbees << (i == N - 1 ? \"\\n\" : \" \");\n\t}\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3676,
"score_of_the_acc": -1.0351,
"final_rank": 17
},
{
"submission_id": "aoj_1039_3897631",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <cmath>\n#include <numeric>\n#include <tuple>\n#include <assert.h>\n\nusing namespace std;\n\nstruct Point {\n\tdouble x;\n\tdouble y;\n};\n\ninline istream& operator >> (istream& is, Point& p) {\n\treturn is >> p.x >> p.y;\n}\n\ntypedef Point Vector;\n\nstruct Dog {\n\tPoint position;\n\tdouble speed;\n\tint n_frisbees;\n};\n\n#define sqr(x) std::pow(x, 2.0)\n#define INF 1e10\n#define REP(i, n) for (int i = 0; i < n; i++)\n\ninline std::pair<double, double> solve(const Dog& d, const Point& fp, const Vector& fv) {\n\tdouble delta_x = fp.x - d.position.x;\n\tdouble delta_y = fp.y - d.position.y;\n\n\tdouble a = sqr(fv.x) + sqr(fv.y) - sqr(d.speed);\n\tdouble b = delta_x * fv.x + delta_y * fv.y;\n\tdouble c = sqr(delta_x) + sqr(delta_y);\n\tdouble det = sqr(b) - a * c;\n\n\tif (det < 0) {\n\t\treturn make_pair(INF, INF);\n\t}\n\tdouble t1 = (-b + sqrt(sqr(b) - a * c)) / a;\n\tdouble t2 = (-b - sqrt(sqr(b) - a * c)) / a;\n\n\tt1 = t1 > 0 ? t1 : INF;\n\tt2 = t2 > 0 ? t2 : INF;\n\n\tdouble t = min(t1, t2);\n\n\tif (t < 0 || t == INF) {\n\t\treturn make_pair(INF, INF);\n\t}\n\n\tdouble rad = atan2(delta_y + fv.y * t, delta_x + fv.x * t);\n\n\t// check\n\t//double xf = fp.x + fv.x * t; double xd = d.position.x + d.speed * t * cos(rad);\n\t//double yf = fp.y + fv.y * t; double yd = d.position.y + d.speed * t * sin(rad);\n\n\treturn make_pair(t, rad);\n}\n\n\nint main(int argc, char** argv) {\n\twhile (1) {\n\t\tint N, M;\n\t\tcin >> N >> M;\n\n\t\tif (N == 0 && M == 0) break;\n\n\t\tvector<Dog> dogs(N);\n\n\t\tREP(i, N) {\n\t\t\tcin >> dogs[i].position >> dogs[i].speed;\n\t\t\tdogs[i].n_frisbees = 0;\n\t\t}\n\n\t\tREP(i, M) {\n\t\t\tPoint fp, fv;\n\t\t\tvector<double> t(N), rad(N);\n\n\t\t\tcin >> fp >> fv;\n\n\t\t\tREP(j, N)\n\t\t\t\ttie(t[j], rad[j]) = solve(dogs[j], fp, fv);\n\n\t\t\tauto best = min_element(t.begin(), t.end());\n\n\t\t\tdogs[best - t.begin()].n_frisbees++;\n\n\t\t\t// move dogs\n\t\t\tREP(j, N) {\n\t\t\t\tif (t[j] == INF)\n\t\t\t\t\tcontinue;\n\t\t\t\tdogs[j].position.x += dogs[j].speed * cos(rad[j]) * *best;\n\t\t\t\tdogs[j].position.y += dogs[j].speed * sin(rad[j]) * *best;\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tcout << dogs[i].n_frisbees << (i == N - 1 ? \"\\n\" : \" \");\n\t}\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3608,
"score_of_the_acc": -1.0089,
"final_rank": 15
},
{
"submission_id": "aoj_1039_3888798",
"code_snippet": "// aribon3-6_e\n#include <bits/stdc++.h>\n#ifdef LOCAL\n#include \"../cxx-prettyprint/prettyprint.hpp\"\n#endif\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\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#define ALL(x) x.begin(), x.end()\n\n#define INF ((1 << 29)-1)\n#define MOD (1000000007)\n\n#define print2D(h, w, arr) REP(i, h) { REP(j, w) cout << arr[i][j] << \" \"; cout << endl; }\ntemplate<class T> void print(const T& x){cout << x << endl;}\ntemplate<class T, class... A> void print(const T& first, const A&... rest) { cout << first << \" \"; print(rest...); }\nstruct PreMain {PreMain(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} premain;\n\n// ベクトル\nstruct Point {\n constexpr static double eps = 1e-9;\n double x, y;\n explicit Point(double x=0, double y=0): x(x), y(y) {}\n Point& operator+=(const Point& v){ x += v.x; y+= v.y; return *this;}\n Point operator+(const Point& v) const{return Point(*this) += v;}\n Point& operator-=(const Point& v){x -= v.x; y-= v.y; return *this;}\n Point operator-(const Point& v) const{return Point(*this) -= v;}\n Point& operator*=(double s){x *= s; y *= s; return *this;}\n Point operator*(double s) const{return Point(*this) *= s;}\n Point& operator/=(double s){x /= s; y /= s; return *this;}\n Point operator/(double s) const{return Point(*this) /= s;}\n double dot(const Point& v) const {return x*v.x + y*v.y;} /* 内積 */\n double cross(const Point& v) const {return x*v.y - v.x*y;} /* 外積 */\n double norm2() const {return x*x + y*y;} /* ノルムの二乗*/\n double norm() const {return sqrt(norm2());} /* ノルム */\n int quadrant() const { if(y > 0) return x>0 ? 1:2; else return x>0 ? 4:3;} /* 象限判定 */\n\n friend ostream& operator<<(ostream& os, const Point& v) {os<<\"(\"<<v.x<<\",\"<<v.y<<\")\"; return os;}\n friend istream& operator>>(istream& is, Point& v){ is >> v.x >> v.y; return is;}\n\n // 点a, b, cからなる三角形の面積\n friend double calc_triangle_area(Point a, Point b, Point c) {\n Point v1 = b - a;\n Point v2 = c - a;\n return abs(v1.cross(v2)) / 2;\n }\n\n // 点a, bを通る直線と点cとの距離\n friend double calc_distance_between_point_and_line(Point a, Point b, Point c) {\n return abs((b-a).cross(c-a)) / (b-a).norm();\n }\n\n // 点a, bを端点とする線分と点cとの距離\n friend double calc_distance_between_point_and_segment(Point a, Point b, Point c) {\n if ((b-a).dot(c-a) < eps) return (c-a).norm();\n if ((a-b).dot(c-b) < eps) return (c-b).norm();\n return calc_distance_between_point_and_line(a, b, c);\n }\n\n // 点a, bを端点とする線分と点cと点dを端点とする線分の距離\n friend double calc_distance_between_segments(Point a, Point b, Point c, Point d) {\n double d0 = calc_distance_between_point_and_segment(a, b, c);\n double d1 = calc_distance_between_point_and_segment(a, b, d);\n double d2 = calc_distance_between_point_and_segment(c, d, a);\n double d3 = calc_distance_between_point_and_segment(c, d, b);\n return min(min(d0, d1), min(d2, d3));\n }\n\n enum RELATION_BETWEEN_SEGMENT_AND_POINT {\n COUNTER_CLOCKWISE = 1, // p1とp2のp0を挟んだ位置関係が反時計回り\n CLOCKWISE = -1, // 時計回り\n ONLINE_BACK = 2, // p1とp2がp0を挟んで直線状にある\n ONLINE_FRONT = -2, // p0とp2の間にp1がある\n ON_SEGMENT = 0, // p0とp1の間にp2がある\n };\n\n // 点cが点a, bを端点とする線分のどちら側にあるか、enumで返す\n friend RELATION_BETWEEN_SEGMENT_AND_POINT ccw_ex(Point p0, Point p1, Point p2) {\n Point v1 = p1 - p0;\n Point v2 = p2 - p0;\n if(v1.cross(v2) > eps) return COUNTER_CLOCKWISE; // 1\n if(v1.cross(v2) < -eps) return CLOCKWISE; // -1\n if(v1.dot(v2) < -eps) return ONLINE_BACK; // 2\n if(v1.norm() < v2.norm()) return ONLINE_FRONT; // -2\n return ON_SEGMENT; // 0\n }\n\n // 点cが点a, bを端点とする線分のどちら側にあるか\n friend int ccw(Point p0, Point p1, Point p2) {\n Point v1 = p1 - p0;\n Point v2 = p2 - p0;\n if(v1.cross(v2) > eps) return 1;\n if(v1.cross(v2) < -eps) return -1;\n return 0;\n }\n\n // p1,p2を端点とする線分Aとp3,p4を端点とする線分Bの交差判定\n // include_end=trueなら端点が重なっていても交差しているとみなす\n friend bool intersect(Point p1, Point p2, Point p3, Point p4, bool include_end=true) {\n\n bool is_otherside;\n bool is_inside;\n\n if (include_end){\n is_otherside = ccw(p1,p2,p3) * ccw(p1,p2,p4) <= 0; // Aの両側にBの端点があるかどうか。どちらかがAの直線状にいてもOK\n is_inside = ccw(p3,p4,p1) * ccw(p3,p4,p2) <= 0; // Aの端点の内側にBがいるかどうか。\n } else {\n is_otherside = ccw(p1,p2,p3) * ccw(p1,p2,p4) < 0; // Aの両側にBの端点があるかどうか\n is_inside = ccw(p3,p4,p1) * ccw(p3,p4,p2) < 0; // Aの端点の内側にBがいるかどうか\n }\n return is_otherside && is_inside;\n }\n\n};\n\n// 円\nstruct Circle {\n Point c;\n double r;\n Circle(){}\n Circle(Point c, double r):c(c),r(r){}\n};\n\n\nint main() {\n#ifdef LOCAL\n ifstream in(\"../in.txt\"); cin.rdbuf(in.rdbuf());\n#endif\n\n while (true) {\n int N, M;\n cin >> N >> M;\n if (N == 0 && M == 0) break;\n\n vector<Point> dog_pos(N);\n vector<double> dog_speed(N);\n vector<Point> frisbee_pos(M);\n vector<Point> frisbee_V(M);\n\n REP(i, N) cin >> dog_pos[i] >> dog_speed[i];\n REP(i, M) cin >> frisbee_pos[i] >> frisbee_V[i];\n\n vector<int> dog_score(N);\n REP(fid, M) {\n\n vector<Point> dog_V(N);\n double min_t = numeric_limits<double>::max();\n int min_did = -1;\n REP(did, N) {\n\n Point rel_pos = dog_pos[did] - frisbee_pos[fid];\n double p_2 = rel_pos.norm2();\n double p_dot_vf = rel_pos.dot(frisbee_V[fid]);\n\n double Vf_2 = frisbee_V[fid].norm2();\n double Vd_2 = dog_speed[did] * dog_speed[did];\n\n double a = Vf_2 - Vd_2;\n double b = - 2 * p_dot_vf;\n double c = p_2;\n\n double t;\n if (abs(a) < Point::eps) {\n t = - c / b;\n } else {\n double D = b * b - 4 * a * c;\n if (D < 0){\n t = numeric_limits<double>::max();\n } else {\n D = sqrt(D);\n double t1 = (-b - D) / (2 * a);\n double t2 = (-b + D) / (2 * a);\n if (t1 > t2) swap(t1, t2);\n t = t1 > Point::eps ? t1 : t2 > Point::eps ? t2 : numeric_limits<double>::max();\n }\n }\n\n if (t < min_t) {\n min_t = t;\n min_did = did;\n }\n\n Point intersection = frisbee_pos[fid] + frisbee_V[fid] * t;\n dog_V[did] = (intersection - dog_pos[did]) / t;\n if (t == numeric_limits<double>::max()) dog_V[did] = Point(0, 0);\n\n }\n\n dog_score[min_did]++;\n\n REP(did, N){\n dog_pos[did] += dog_V[did] * min_t;\n }\n }\n\n REP(did, N-1) {\n cout << dog_score[did] << \" \";\n }\n print(dog_score[N-1]);\n\n }\n\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3200,
"score_of_the_acc": -0.815,
"final_rank": 5
},
{
"submission_id": "aoj_1039_3819016",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\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()\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 vector<ll> VL;\ntypedef vector<VL> VVL;\ntypedef pair<ll, ll> PL;\n\nconst int INF = 1e9;\nconst int MOD = 1e9 + 7;\nconst double PI = atan(1.0) * 4.0;\n// const int MOD = 998244353;\nconst ll LINF = 1e18;\nconst ll dx[] = {1, 0, -1, 0};\nconst ll dy[] = {0, 1, 0, -1};\n\nvoid cinfast() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n}\n\n/* 基本要素 */\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\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\n// 内積 dot(a,b) = |a||b|cosθ\nD dot(P a, P b) { return (conj(a) * b).X; }\n// 外積 cross(a,b) = |a||b|sinθ\nD cross(P a, P b) { return (conj(a) * b).Y; }\n\n// 点の進行方向\nint ccw(P a, P b, P c) {\n b -= a;\n c -= a;\n if(cross(b, c) > EPS) return +1; // counter clockwise\n if(cross(b, c) < -EPS) return -1; // clockwise\n if(dot(b, c) < -EPS) return +2; // c--a--b on line\n if(norm(b) < norm(c)) return -2; // a--b--c on line or a==b\n return 0; // a--c--b on line or a==c or b==c\n}\n\n/* 交差判定 直線・線分は縮退してはならない。接する場合は交差するとみなす。isecはintersectの略\n */\n\n// 直線と点\nbool isecLP(P a1, P a2, P b) {\n return abs(ccw(a1, a2, b)) != 1; // return EQ(cross(a2-a1, b-a1), 0); と等価\n}\n\n// 直線と直線\nbool isecLL(P a1, P a2, P b1, P b2) {\n return !isecLP(a2 - a1, b2 - b1, 0) || isecLP(a1, b1, b2);\n}\n\n// 直線と線分\nbool isecLS(P a1, P a2, P b1, P b2) {\n return cross(a2 - a1, b1 - a1) * cross(a2 - a1, b2 - a1) < EPS;\n}\n\n// 線分と線分\nbool isecSS(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\n// 線分と点\nbool isecSP(P a1, P a2, P b) { return !ccw(a1, a2, b); }\n\n/* 距離 各直線・線分は縮退してはならない */\n\n// 点pの直線aへの射影点を返す\nP proj(P a1, P a2, P p) {\n if(a1 == a2) eputs(\"same points\");\n return a1 + dot(a2 - a1, p - a1) / norm(a2 - a1) * (a2 - a1);\n}\n\n// 点pの直線aへの反射点を返す\nP reflection(P a1, P a2, P p) { return 2.0 * proj(a1, a2, p) - p; }\n\nD distLP(P a1, P a2, P p) { return abs(proj(a1, a2, p) - p); }\n\nD distLL(P a1, P a2, P b1, P b2) {\n return isecLL(a1, a2, b1, b2) ? 0 : distLP(a1, a2, b1);\n}\n\nD distLS(P a1, P a2, P b1, P b2) {\n return isecLS(a1, a2, b1, b2) ? 0\n : min(distLP(a1, a2, b1), distLP(a1, a2, b2));\n}\n\nD distSP(P a1, P a2, P p) {\n P r = proj(a1, a2, p);\n if(isecSP(a1, a2, r)) return abs(r - p);\n return min(abs(a1 - p), abs(a2 - p));\n}\n\nD distSS(P a1, P a2, P b1, P b2) {\n if(isecSS(a1, a2, b1, b2)) return 0;\n return min(min(distSP(a1, a2, b1), distSP(a1, a2, b2)),\n min(distSP(b1, b2, a1), distSP(b1, b2, a2)));\n}\n\n// 2直線の交点\nP crosspointLL(P a1, P a2, P b1, P b2) {\n D d1 = cross(b2 - b1, b1 - a1);\n D d2 = cross(b2 - b1, a2 - a1);\n if(EQ(d1, 0) && EQ(d2, 0)) return a1; // same line\n if(EQ(d2, 0)) throw \"kouten ga nai\"; // 交点がない\n return a1 + d1 / d2 * (a2 - a1);\n}\n\n/* 円 */\n\nD distLC(P a1, P a2, P c, D r) { return max(distLP(a1, a2, c) - r, 0.0); }\n\nD distSC(P a1, P a2, P c, D r) {\n D dSqr1 = norm(c - a1), dSqr2 = norm(c - a2);\n if(dSqr1 < r * r ^ dSqr2 < r * r)\n return 0; // 円が線分を包含するとき距離0ならここをORに変える\n if(dSqr1 < r * r & dSqr2 < r * r) return r - sqrt(max(dSqr1, dSqr2));\n return max(distSP(a1, a2, c) - r, 0.0);\n}\n\nVP crosspointLC(P a1, P a2, P c, D r) {\n VP ps;\n P ft = proj(a1, a2, c);\n if(!GE(r * r, norm(ft - c))) return ps;\n\n P dir = sqrt(max(r * r - norm(ft - c), 0.0)) / abs(a2 - a1) * (a2 - a1);\n ps.push_back(ft + dir);\n if(!EQ(r * r, norm(ft - c))) ps.push_back(ft - dir);\n return ps;\n}\n\nD distCC(P a, D ar, P b, D br) {\n D d = abs(a - b);\n return GE(d, abs(ar - br)) ? max(d - ar - br, 0.0) : abs(ar - br) - d;\n}\n\n// 2円の交点\nVP crosspointCC(P a, D ar, P b, D br) {\n VP ps;\n P ab = b - a;\n D d = abs(ab);\n D crL = (norm(ab) + ar * ar - br * br) / (2 * d);\n if(EQ(d, 0) || ar < abs(crL)) return ps;\n\n P abN = ab * P(0, sqrt(ar * ar - crL * crL) / d);\n P cp = a + crL / d * ab;\n ps.push_back(cp + abN);\n if(!EQ(norm(abN), 0)) ps.push_back(cp - abN);\n return ps;\n}\n\n// 点pから円aへの接線の接点\nVP tangentPoints(P a, D ar, P p) {\n VP ps;\n D sin = ar / abs(p - a);\n if(!LE(sin, 1)) return ps; // ここでNaNも弾かれる\n D t = 2 * PI - asin(min(sin, 1.0));\n ps.push_back(a + (p - a) * polar(sin, t));\n if(!EQ(sin, 1)) ps.push_back(a + (p - a) * polar(sin, -t));\n return ps;\n}\n\n// 2円の共通接線。返される各直線に含まれる頂点は円との接点となる\nvector<L> tangentLines(P a, D ar, P b, D br) {\n vector<L> ls;\n D d = abs(b - a);\n REP(i, 2) {\n D sin = (ar - (1 - i * 2) * br) / d;\n if(!LE(sin * sin, 1)) break;\n D cos = sqrt(max(1 - sin * sin, 0.0));\n REP(j, 2) {\n P n = (b - a) * P(sin, (1 - j * 2) * cos) / d;\n ls.push_back(L(a + ar * n, b + (1 - i * 2) * br * n));\n if(cos < EPS)\n break; // 重複する接線を無視（重複していいならこの行不要）\n }\n }\n return ls;\n}\n\n// 三角形の外心。点a,b,cは同一線上にあってはならない\nP circumcenter(P a, P b, P c) {\n a = (a - c) * 0.5;\n b = (b - c) * 0.5;\n return c + crosspointLL(a, a * P(1, 1), b, b * P(1, 1));\n}\n\n// 点aと点bを通り、半径がrの円の中心を返す\nVP circlesPointsRadius(P a, P b, D r) {\n VP cs;\n P abH = (b - a) * 0.5;\n D d = abs(abH);\n if(d == 0 || d > r)\n return cs; // 必要なら !LE(d,r) として円1つになる側へ丸める\n D dN = sqrt(r * r - d * d); // 必要なら max(r*r - d*d, 0) とする\n P n = abH * P(0, 1) * (dN / d);\n cs.push_back(a + abH + n);\n if(dN > 0) cs.push_back(a + abH - n);\n return cs;\n}\n\n// 点aと点bを通り、直線lに接する円の中心\nVP circlesPointsTangent(P a, P b, P l1, P l2) {\n P n = (l2 - l1) * P(0, 1);\n P m = (b - a) * P(0, 0.5);\n D rC = dot((a + b) * 0.5 - l1, n);\n D qa = norm(n) * norm(m) - dot(n, m) * dot(n, m);\n D qb = -rC * dot(n, m);\n D qc = norm(n) * norm(m) - rC * rC;\n D qd = qb * qb - qa * qc; // qa*k^2 + 2*qb*k + qc = 0\n\n VP cs;\n if(qd < -EPS) return cs;\n if(EQ(qa, 0)) {\n if(!EQ(qb, 0)) cs.push_back((a + b) * 0.5 - m * (qc / qb / 2));\n return cs;\n }\n D t = -qb / qa;\n cs.push_back((a + b) * 0.5 + m * (t + sqrt(max(qd, 0.0)) / qa));\n if(qd > EPS)\n cs.push_back((a + b) * 0.5 + m * (t - sqrt(max(qd, 0.0)) / qa));\n return cs;\n}\n\n// 点集合を含む最小の円の中心\nP minEnclosingCircle(const VP &ps) {\n P c;\n double move = 0.5;\n REP(i, 39) { // 2^(-39-1) \\approx 0.9e-12\n REP(t, 50) {\n D max = 0;\n int k = 0;\n REP(j, ps.size()) if(max < norm(ps[j] - c)) {\n max = norm(ps[j] - c);\n k = j;\n }\n c += (ps[k] - c) * move;\n }\n move /= 2;\n }\n return c;\n}\n\n/* 多角形 */\n\n// 頂点の順序（sortやmax_elementに必要）\nnamespace std {\nbool operator<(const P a, const P b) {\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\n}\n} // namespace std\n\n// 凸包\nVP convexHull(VP ps) { // 元の点集合がソートされていいならVP&に\n int n = ps.size(), k = 0;\n sort(ps.begin(), ps.end());\n VP 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)\n --k; // 余計な点も含むなら == -1 とする\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}\n\n// 凸判定。縮退を認めないならccwの判定部分を != 1 とする\nbool isCcwConvex(const VP &ps) {\n int n = ps.size();\n REP(i, n)\n if(ccw(ps[i], ps[(i + 1) % n], ps[(i + 2) % n]) == -1) return false;\n return true;\n}\n\n// 凸多角形の内部判定 O(n)\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\nint inConvex(P p, const VP &ps) {\n int n = ps.size();\n int dir = ccw(ps[0], ps[1], p);\n REP(i, n) {\n int ccwc = ccw(ps[i], ps[(i + 1) % n], p);\n if(!ccwc) return 2; // 線分上に存在\n if(ccwc != dir) return 0;\n }\n return 1;\n}\n\n// 凸多角形の内部判定 O(logn)\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\nint inCcwConvex(const VP &ps, P p) {\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)\n r = mid;\n else\n l = mid;\n } else {\n if(cross(gl, gp) <= 0 && cross(gm, gp) >= 0)\n l = mid;\n else\n r = mid;\n }\n }\n r %= n;\n D cr = cross(ps[l] - p, ps[r] - p);\n return EQ(cr, 0) ? 2 : cr < 0 ? 0 : 1;\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)) &&\n LE(cross(a, b), 0))\n in = !in;\n }\n return in;\n}\n\n// 凸多角形クリッピング\nVP convexCut(const VP &ps, P a1, P a2) {\n int n = ps.size();\n VP ret;\n REP(i, n) {\n int ccwc = ccw(a1, a2, ps[i]);\n if(ccwc != -1) ret.push_back(ps[i]);\n int ccwn = ccw(a1, a2, ps[(i + 1) % n]);\n if(ccwc * ccwn == -1)\n ret.push_back(crosspointLL(a1, a2, ps[i], ps[(i + 1) % n]));\n }\n return ret;\n}\n\n// 凸多角形の直径（最遠点対）\npair<int, int> convexDiameter(const VP &ps) {\n int n = ps.size();\n int i = min_element(ps.begin(), ps.end()) - ps.begin();\n int j = max_element(ps.begin(), ps.end()) - ps.begin();\n int maxI, maxJ;\n D maxD = 0;\n REP(_, 2 * n) {\n if(maxD < norm(ps[i] - ps[j])) {\n maxD = norm(ps[i] - ps[j]);\n maxI = i;\n maxJ = j;\n }\n if(cross(ps[i] - ps[(i + 1) % n], ps[(j + 1) % n] - ps[j]) <= 0)\n j = (j + 1) % n;\n else\n i = (i + 1) % n;\n }\n return make_pair(maxI, maxJ);\n}\n\n// 多角形の符号付面積\nD area(const VP &ps) {\n D a = 0;\n REP(i, ps.size()) a += cross(ps[i], ps[(i + 1) % ps.size()]);\n return a / 2;\n}\n\n// 多角形の幾何学的重心\nP centroid(const VP &ps) {\n int n = ps.size();\n D aSum = 0;\n P c;\n REP(i, n) {\n D a = cross(ps[i], ps[(i + 1) % n]);\n aSum += a;\n c += (ps[i] + ps[(i + 1) % n]) * a;\n }\n return 1 / aSum / 3 * c;\n}\n\n// ボロノイ領域\nVP voronoiCell(P p, const VP &ps, const VP &outer) {\n VP cl = outer;\n REP(i, ps.size()) {\n if(EQ(norm(ps[i] - p), 0)) continue;\n P h = (p + ps[i]) * 0.5;\n cl = convexCut(cl, h, h + (ps[i] - h) * P(0, 1));\n }\n return cl;\n}\n\n/* 幾何グラフ */\n\nstruct Edge {\n int from, to;\n D cost;\n Edge(int from, int to, D cost) : from(from), to(to), cost(cost) {}\n};\nstruct Graph {\n int n;\n vector<vector<Edge>> edges;\n Graph(int n) : n(n), edges(n) {}\n void addEdge(Edge e) {\n edges[e.from].push_back(e);\n edges[e.to].push_back(Edge(e.to, e.from, e.cost));\n }\n};\n\n// 線分アレンジメント（線分の位置関係からグラフを作成）\nGraph segmentArrangement(const vector<L> &segs, VP &ps) {\n int n = segs.size();\n REP(i, n) {\n ps.push_back(segs[i].first);\n ps.push_back(segs[i].second);\n REP(j, i) {\n if(isecSS(segs[i].first, segs[i].second, segs[j].first,\n segs[j].second))\n ps.push_back(crosspointLL(segs[i].first, segs[i].second,\n segs[j].first, segs[j].second));\n }\n }\n sort(ps.begin(), ps.end());\n ps.erase(unique(ps.begin(), ps.end()), ps.end());\n\n int m = ps.size();\n Graph gr(m);\n vector<pair<D, int>> list;\n REP(i, n) {\n list.clear();\n REP(j, m) {\n if(isecSP(segs[i].first, segs[i].second, ps[j]))\n list.push_back(make_pair(norm(segs[i].first - ps[j]), j));\n }\n sort(list.begin(), list.end());\n REP(j, list.size() - 1) {\n int a = list[j].second;\n int b = list[j + 1].second;\n gr.addEdge(Edge(a, b, abs(ps[a] - ps[b])));\n }\n }\n return gr;\n}\n\n// 可視グラフ（点集合から見える位置へ辺を張ったグラフ）\nGraph visibilityGraph(const VP &ps, const vector<VP> &objs) {\n int n = ps.size();\n Graph gr(n);\n REP(i, n) REP(j, i) {\n P a = ps[i], b = ps[j];\n if(!EQ(norm(a - b), 0)) REP(k, objs.size()) {\n const VP &obj = objs[k];\n int inStA = inConvex(a, obj);\n int inStB = inConvex(b, obj);\n if((inStA ^ inStB) % 2 ||\n inStA * inStB != 1 && inConvex((a + b) * 0.5, obj) == 1)\n goto skip;\n REP(l, obj.size()) {\n P cur = obj[l];\n P next = obj[(l + 1) % obj.size()];\n if(isecSS(a, b, cur, next) && !isecSP(cur, next, a) &&\n !isecSP(cur, next, b))\n goto skip;\n }\n }\n gr.addEdge(Edge(i, j, abs(a - b)));\n skip : {}\n }\n return gr;\n}\n\n/* その他 */\n\n// 重複する線分を併合する\nvector<L> mergeSegments(vector<L> segs) {\n int n = segs.size();\n REP(i, n)\n if(segs[i].second < segs[i].first) swap(segs[i].second, segs[i].first);\n\n REP(i, n) REP(j, i) {\n L &l1 = segs[i], &l2 = segs[j];\n if(EQ(cross(l1.second - l1.first, l2.second - l2.first), 0) &&\n isecLP(l1.first, l1.second, l2.first) &&\n ccw(l1.first, l1.second, l2.second) != 2 &&\n ccw(l2.first, l2.second, l1.second) != 2) {\n segs[j] = L(min(l1.first, l2.first), max(l1.second, l2.second));\n segs[i--] = segs[--n];\n break;\n }\n }\n segs.resize(n);\n return segs;\n}\n\ninline double pp2(P a) { return a.X * a.X + a.Y * a.Y; }\ninline double p2(double a) { return a * a; }\ndouble pow2(double a) { return a * a; }\n\nsigned main() {\n for(;;) {\n int n, m;\n cin >> n >> m;\n if(n == 0) return 0;\n\n vector<double> x(n), y(n), v(n);\n for(int i = 0; i < n; ++i) cin >> x[i] >> y[i] >> v[i];\n\n vector<int> num(n, 0);\n while(--m >= 0) {\n double fpx, fpy, fvx, fvy;\n cin >> fpx >> fpy >> fvx >> fvy;\n\n vector<double> vy(n, 0.0), vx(n, 0.0);\n double minT = DBL_MAX;\n int getDog;\n for(int i = 0; i < n; ++i) {\n double a = pow2(fvx) + pow2(fvy) - pow2(v[i]);\n double b = 2 * (fvx * (fpx - x[i]) + fvy * (fpy - y[i]));\n double c = pow2(fpx - x[i]) + pow2(fpy - y[i]);\n double d = pow2(b) - 4 * a * c;\n if(d >= 0.0) {\n double t;\n if(fabs(a) < EPS) {\n t = -c / b;\n if(t < 0.0) continue;\n } else {\n double tmp = (-b - sqrt(d)) / (2 * a);\n if(tmp >= 0.0)\n t = tmp;\n else {\n tmp = (-b + sqrt(d)) / (2 * a);\n if(tmp >= 0.0)\n t = tmp;\n else\n continue;\n }\n }\n vx[i] = (fpx - x[i] + fvx * t) / t;\n vy[i] = (fpy - y[i] + fvy * t) / t;\n if(t < minT) {\n minT = t;\n getDog = i;\n }\n }\n }\n\n ++num[getDog];\n for(int i = 0; i < n; ++i) {\n x[i] += vx[i] * minT;\n y[i] += vy[i] * minT;\n }\n }\n\n Printv(num)\n }\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 3100,
"score_of_the_acc": -0.7949,
"final_rank": 4
},
{
"submission_id": "aoj_1039_3531414",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <cmath>\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}\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\n// 負なら追い付ける\ndouble Dist(double dx, double dy, double fx, double fy, double v) {\n return hypot(dx - fx, dy - fy) - v;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n const double inf = 1e+15;\n const double eps = 1e-6;\n int n, m;\n while (cin >> n >> m, n + m) {\n vector<double> Dx(n), Dy(n), V(n);\n REP(i, 0, n) {\n cin >> Dx[i] >> Dy[i] >> V[i];\n }\n vector<int> ans(n, 0);\n REP(_, 0, m) {\n double fx, fy, fvx, fvy;\n cin >> fx >> fy >> fvx >> fvy;\n double minT = inf;\n int minI = 0;\n vector<bool> get(n, false);\n vector<double> T(n, inf);\n vector<double> X(n, inf), Y(n, inf);\n REP(i, 0, n) {\n // 3分探索\n {\n double l = 0, r = inf, t = 0;\n REP (__, 0, 100) {\n double m1 = (2 * l + r) / 3, m2 = (l + 2 * r) / 3;\n double dist1 = Dist(Dx[i], Dy[i], fx + fvx * m1, fy + fvy * m1, V[i] * m1);\n double dist2 = Dist(Dx[i], Dy[i], fx + fvx * m2, fy + fvy * m2, V[i] * m2);\n if (dist1 > dist2) {\n l = m1;\n t = min(t, dist2);\n T[i] = m2;\n } else {\n r = m2;\n t = min(t, dist1);\n T[i] = m1;\n }\n //cerr << T[i] << endl;\n }\n get[i] = (t < 0);\n }\n\n //2分探索\n if (get[i]) {\n double l = 0, r = T[i];\n REP (__, 0, 100) {\n double mid = (l + r) / 2;\n double dist = Dist(Dx[i], Dy[i], fx + fvx * mid, fy + fvy * mid, V[i] * mid);\n //cerr << \"?\" << dist << endl;\n if (dist < eps) {\n get[i] = true;\n T[i] = mid;\n r = mid;\n X[i] = fx + fvx * mid - Dx[i];\n Y[i] = fy + fvy * mid - Dy[i];\n } else {\n l = mid;\n }\n }\n\n //cerr << \"!\" << get[i] << \" \" << t << endl;\n if (get[i] && T[i] + eps < minT) {\n minT = T[i];\n minI = i;\n }\n }\n }\n\n //cerr << \"!\" << minT << \" \" << minI << endl;\n\n ans[minI]++;\n REP(i, 0, n) {\n if (get[i]) {\n Dx[i] += minT / T[i] * X[i];\n Dy[i] += minT / T[i] * Y[i];\n }\n //cerr << \"ps\" << Dx[i] << \" \" << Dy[i] << endl;\n }\n }\n REP(i, 0, n) {\n cout << ans[i] << \" \\n\"[i + 1 == n];\n }\n cout << flush;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2220,
"memory_kb": 3284,
"score_of_the_acc": -1.8382,
"final_rank": 20
},
{
"submission_id": "aoj_1039_3420203",
"code_snippet": "#include<cstdio>\n#include<vector>\n#include<queue>\n#include<map>\n#include<unordered_map>\n#include<stack>\n#include<string>\n#include<algorithm>\n#include<functional>\n#include<cstring>\n#include<complex>\nusing namespace std;\n\n/**** Type Define ****/\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef pair<ll, P> Q;\ntypedef complex<double> C;\n\n/**** Macro Define ****/\n\n#define cx real()\n#define cy imag()\n\n/**** Const List ****/\n\nconst ll INF = 1LL << 60;\nconst ll mod = 1000000007;\nconst ll MAX_FLOW_MAX_V = 10000;\nconst ll MIN_COST_FLOW_MAX_V = 10000;\nconst ll BIPARTITE_MATCHING_MAX_V = 10000;\nconst ll dx[4] = {1, 0, -1, 0};\nconst ll dy[4] = {0, -1, 0, 1};\nconst C I = C(0, 1);\nconst double EPS = 1e-10;\n\n/**** General Functions ****/\n\ntemplate <typename T>\nT tmin(T a, T b) { return a > b ? b : a; };\n\ntemplate <typename T>\nT tmax(T a, T b) { return a > b ? a : b; };\n\ntemplate <typename T>\nT tadd(T a, T b) { return a + b; };\n\ntemplate <typename T>\nT tmul(T a, T b) { return a * b; };\n\ntemplate <typename T>\nT tpow(T a, T b) { return a * b; };\n\nll gcd(ll a, ll b) {\n if (b == 0) return a;\n return gcd(b, a % b);\n}\n\nll extgcd(ll a, ll b, ll& x, ll& y) {\n if (b == 0) {\n x = 1, y = 0; return a;\n }\n ll q = a/b, g = extgcd(b, a - q*b, x, y);\n ll z = x - q * y;\n x = y;\n y = z;\n return g;\n}\n\nll invmod (ll a, ll m) { // a^-1 mod m\n ll x, y;\n extgcd(a, m, x, y);\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\nll nCk(ll n, ll k, ll mod) {\n ll ans = 1;\n for (ll i = n, j = 1; j <= k; i--, j++) ans = (((ans * i) % mod) * invmod(j, mod)) % mod;\n return ans;\n}\n\nll lmin(ll a, ll b) { return a > b ? b : a; };\n\nll lmax(ll a, ll b) { return a > b ? a : b; };\n\nll lsum(ll a, ll b) { return a + b; };\n\n/**** Matrix ****/\n\ntemplate <typename T>\nstruct Matrix {\n typedef vector<T> vec;\n typedef vector<vec> mat;\n ll x, y; // x: horizon y: vertical\n mat d;\n\n Matrix(ll _y, ll _x = -1) {\n if (_x == -1) _x = _y;\n x = _x, y = _y;\n for (int i = 0; i < y; i++) for (int j = 0; j < x; j++) d[i][j] = 0;\n }\n void unit() {\n for (int i = 0; i < y; i++) for (int j = 0; j < x; j++) d[i][j] = i == j ? 1 : 0;\n }\n Matrix copy() {\n Matrix m(y, x);\n for (int i = 0; i < y; i++) for (int j = 0; j < x; j++) m.d[i][j] = d[i][j];\n return m;\n }\n Matrix<T> operator + (Matrix<T>& t) { // No error check! Don't forget to check Matrix size!!\n Matrix<T> m(y, x);\n for (int i = 0; i < y; i++) for (int j = 0; j < x; j++) m.d[i][j] = d[i][j] + t.d[i][j];\n return m;\n }\n Matrix<T> operator - (Matrix<T>& t) {\n Matrix<T> m(y, x);\n for (int i = 0; i < y; i++) for (int j = 0; j < x; j++) m.d[i][j] = d[i][j] - t.d[i][j];\n return m;\n }\n Matrix<T> operator * (T t) {\n Matrix<T> m(y, x);\n for (int i = 0; i < y; i++) for (int j = 0; j < x; j++) m.d[i][j] = d[i][j] * t;\n return m;\n }\n Matrix<T> det(Matrix<T>& t) { // x need to correspond to t.y\n Matrix<T> m(y, x);\n for (int i = 0; i < y; i++)\n for (int j = 0; j < x; j++)\n for (int k = 0; k < t.x; k++) m.d[i][j] += d[i][k] * t.d[k][j]; ////////////// mod???\n return m;\n }\n};\n\n/**** Zip ****/\n\ntemplate <typename T>\nclass Zip {\n vector<T> d;\n bool flag;\npublic:\n Zip() {\n flag = false;\n }\n void add(T x) {\n d.push_back(x);\n flag = true;\n }\n ll getNum(T x) { // T need to have operator < !!\n if (flag) {\n sort(d.begin(), d.end());\n d.erase(unique(d.begin(), d.end()), d.end());\n flag = false;\n }\n return lower_bound(d.begin(), d.end(), x) - d.begin();\n }\n ll size() {\n if (flag) {\n sort(d.begin(), d.end());\n d.erase(unique(d.begin(), d.end()), d.end());\n flag = false;\n }\n return (ll)d.size();\n }\n};\n\n/**** Union Find ****/\n\nclass UnionFind {\n vector<ll> par, rank; // par > 0: number, par < 0: -par\npublic:\n void init(ll n) {\n par.resize(n, 1); rank.resize(n, 0);\n }\n ll getSize(ll x) {\n return par[find(x)];\n }\n ll find(ll x) {\n if (par[x] > 0) return x;\n return -(par[x] = -find(-par[x]));\n }\n void merge(ll x, ll y) {\n x = find(x);\n y = find(y);\n if (x == y) return;\n if (rank[x] < rank[y]) {\n par[y] += par[x];\n par[x] = -y;\n } else {\n par[x] += par[y];\n par[y] = -x;\n if (rank[x] == rank[y]) rank[x]++;\n }\n }\n bool isSame(ll x, ll y) {\n return find(x) == find(y);\n }\n};\n\ntemplate <typename T>\nstruct UnionFindT {\n vector<ll> par;\n vector<ll> rank;\n vector<T> diff_weight;\n\n UnionFindT(ll n = 1, T SUM_UNITY = 0) {\n init(n, SUM_UNITY);\n }\n\n void init(ll n = 1, T SUM_UNITY = 0) {\n par.resize(n); rank.resize(n); diff_weight.resize(n);\n for (ll i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;\n }\n\n ll find(ll x) {\n if (par[x] == x) {\n return x;\n }\n else {\n ll r = find(par[x]);\n diff_weight[x] += diff_weight[par[x]];\n return par[x] = r;\n }\n }\n\n T weight(ll x) {\n find(x);\n return diff_weight[x];\n }\n\n bool isSame(ll x, ll y) {\n return find(x) == find(y);\n }\n\n bool merge(ll x, ll y, T w) {\n w += weight(x); w -= weight(y);\n x = find(x); y = find(y);\n if (x == y) return false;\n if (rank[x] < rank[y]) swap(x, y), w = -w;\n if (rank[x] == rank[y]) ++rank[x];\n par[y] = x;\n diff_weight[y] = w;\n return true;\n }\n\n T diff(ll x, ll y) {\n return weight(y) - weight(x);\n }\n};\n\nclass PersistentUnionFind {\n vector<ll> rank, fin, par;\n ll index;\npublic:\n void init(ll n) {\n index = 0;\n par.resize(n); rank.resize(n, 1); fin.resize(n, 0);\n for (ll i = 0; i < n; i++) par[i] = i;\n }\n ll find(ll x, ll t) {\n if (t >= fin[x] && par[x] != x) return find(par[x], t);\n return x;\n }\n void merge(ll x, ll y) {\n x = find(x, index);\n y = find(y, index);\n index++;\n if (x == y) return;\n if (rank[x] < rank[y]) par[x] = y, fin[x] = index;\n else {\n par[y] = x, fin[y] = index;\n if (rank[x] == rank[y]) rank[x]++;\n }\n }\n bool isSame(ll x, ll y, ll t) { return find(x, t) == find(y, t); }\n};\n\n/**** Segment Tree ****/\n\ntemplate <typename T>\nclass SegmentTree {\n ll n;\n vector<T> node;\n function<T(T, T)> fun, fun2;\n bool customChange;\n T outValue, initValue;\npublic:\n void init(ll num, function<T(T, T)> resultFunction, T init, T out, function<T(T, T)> changeFunction = NULL) {\n // changeFunction: (input, beforevalue) => newvalue\n fun = resultFunction;\n fun2 = changeFunction;\n customChange = changeFunction != NULL;\n n = 1;\n while (n < num) n *= 2;\n node.resize(2 * n - 1, init);\n outValue = out;\n initValue = init;\n }\n void valueChange(ll num, T value) {\n num += n-1;\n if (customChange) node[num] = fun2(value, node[num]);\n else node[num] = value;\n while (num > 0) num = (num - 1) / 2, node[num] = fun(node[num * 2 + 1], node[num * 2 + 2]);\n }\n T rangeQuery(ll a, ll b, ll l = 0, ll r = -1, ll k = 0) { // [a, b)\n if (r == -1) r = n;\n if (a <= l && r <= b) return node[k];\n if (b <= l || r <= a) return outValue;\n ll mid = (l + r) / 2;\n return fun(rangeQuery(a, b, l, mid, 2*k+1), rangeQuery(a, b, mid, r, 2*k+2));\n }\n};\n\ntemplate <typename T>\nclass LazySegmentTree {\n ll n;\n vector<T> node;\n vector<T> lazyNode;\n function<T(T, T)> fun, fun2;\n function<T(T, ll)> fun3;\n T outValue, initValue;\n T substitution(T a, T b) { return a; }\n void eval(ll k, ll l, ll r) {\n if (lazyNode[k] == 0) return;\n node[k] = fun2(fun3(lazyNode[k], r - l), node[k]);\n if (r - l > 1) {\n lazyNode[2 * k + 1] = fun2(lazyNode[k], lazyNode[2 * k + 1]);\n lazyNode[2 * k + 2] = fun2(lazyNode[k], lazyNode[2 * k + 2]);\n }\n lazyNode[k] = initValue;\n }\npublic:\n void init(ll num, function<T(T, T)> resultFunction, function<T(T, T)> changeFunction, function<T(T, ll)> lazyFunction, T init, T out) {\n // changeFunction: (input, beforevalue) => newvalue\n // lazyFunction: (lazyNode, diff) => newvalue\n fun = resultFunction;\n fun2 = changeFunction;\n fun3 = lazyFunction;\n n = 1;\n while (n < num) n *= 2;\n node.resize(2 * n - 1, init);\n lazyNode.resize(2 * n - 1, init);\n outValue = out;\n initValue = init;\n }\n void rangeChange(ll a, ll b, T value, ll l = 0, ll r = -1, ll k = 0) {\n if (r == -1) r = n;\n eval(k, l, r);\n if (b <= l || r <= a) return;\n if (a <= l && r <= b) {\n lazyNode[k] = fun2(value, lazyNode[k]);\n eval(k, l, r);\n } else {\n ll mid = (l + r) / 2;\n rangeChange(a, b, value, l, mid, 2*k+1);\n rangeChange(a, b, value, mid, r, 2*k+2);\n node[k] = fun(node[2*k+1], node[2*k+2]);\n }\n }\n T rangeQuery(ll a, ll b, ll l = 0, ll r = -1, ll k = 0) { // [a, b)\n if (r == -1) r = n;\n if (b <= l || r <= a) return outValue;\n eval(k, l, r);\n if (a <= l && r <= b) return node[k];\n ll mid = (l + r) / 2;\n return fun(rangeQuery(a, b, l, mid, 2*k+1), rangeQuery(a, b, mid, r, 2*k+2));\n }\n};\n\n/**** Network Flow ****/\n\nclass MaxFlow {\npublic:\n struct edge { ll to, cap, rev; };\n\n vector<edge> G[MAX_FLOW_MAX_V];\n bool used[MAX_FLOW_MAX_V];\n ll level[MAX_FLOW_MAX_V];\n ll iter[MAX_FLOW_MAX_V];\n \n void init() {\n for (ll i = 0; i < MAX_FLOW_MAX_V; i++) {\n G[i].clear();\n }\n }\n void add_edge(ll from, ll to, ll cap) {\n G[from].push_back((edge){to, cap, (ll)G[to].size()});\n G[to].push_back((edge){from, 0, (ll)G[from].size() - 1});\n }\n void add_undirected_edge(ll e1, ll e2, ll cap) {\n G[e1].push_back((edge){e2, cap, (ll)G[e2].size()});\n G[e2].push_back((edge){e1, cap, (ll)G[e1].size() - 1});\n }\n ll dfs(ll v, ll t, ll f) {\n if (v == t) return f;\n used[v] = true;\n for (ll i = 0; i < (ll)G[v].size(); i++) {\n edge &e = G[v][i];\n if (!used[e.to]&& e.cap > 0) {\n ll d = dfs(e.to, t, min(f, e.cap));\n if (d > 0) {\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n ll max_flow(ll s, ll t) {\n ll flow = 0;\n while (1) {\n memset(used, 0, sizeof(used));\n ll f = dfs(s, t, INF);\n if (f == 0) return flow;\n flow += f;\n }\n }\n void bfs(ll s) {\n memset(level, -1, sizeof(level));\n queue<ll> que;\n level[s] = 0;\n que.push(s);\n while (!que.empty()) {\n ll v = que.front(); que.pop();\n for (ll i = 0; i < (ll)G[v].size(); i++) {\n edge &e = G[v][i];\n if (e.cap > 0 && level[e.to] < 0) {\n level[e.to] = level[v] + 1;\n que.push(e.to);\n }\n }\n }\n }\n ll dinic_dfs(ll v, ll t, ll f) {\n if (v == t) return f;\n for (ll &i= iter[v]; i < (ll)G[v].size(); i++) {\n edge &e = G[v][i];\n if (e.cap > 0 && level[v] < level[e.to]) {\n ll d = dinic_dfs(e.to, t, min(f, e.cap));\n if (d > 0) {\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n ll dinic(ll s, ll t) {\n ll flow = 0;\n while (1) {\n bfs(s);\n if (level[t] < 0) return flow;\n memset(iter, 0, sizeof(iter));\n ll f;\n while ((f = dinic_dfs(s, t, INF)) > 0) {\n flow += f;\n }\n }\n }\n};\n\n/**** bipartite matching ****/\n\nclass BipartiteMatching {\npublic:\n ll V;\n vector<ll> G[BIPARTITE_MATCHING_MAX_V];\n ll match[BIPARTITE_MATCHING_MAX_V];\n bool used[BIPARTITE_MATCHING_MAX_V];\n \n BipartiteMatching(ll v) {\n V = v;\n }\n void init(ll v) {\n V = v;\n for (ll i = 0; i < BIPARTITE_MATCHING_MAX_V; i++) {\n G[i].clear();\n }\n }\n void add_edge(ll u, ll v) {\n G[u].push_back(v);\n G[v].push_back(u);\n }\n bool dfs(ll v) {\n used[v] = true;\n for (ll i = 0; i < (ll)G[v].size(); i++) {\n ll u = G[v][i], w = match[u];\n if (w < 0 || !used[w] && dfs(w)) {\n match[v] = u;\n match[u] = v;\n return true;\n }\n }\n return false;\n }\n ll max_matching() {\n ll res = 0;\n memset(match, -1, sizeof(match));\n for (ll v = 0; v < V;v++) {\n if (match[v] < 0) {\n memset(used, 0, sizeof(used));\n if (dfs(v)) {\n res++;\n }\n }\n }\n return res;\n }\n};\n\nclass MinCostFlow {\npublic:\n struct edge { ll to, cap, cost, rev; };\n\n ll V;\n vector<edge> G[MIN_COST_FLOW_MAX_V];\n ll dist[MIN_COST_FLOW_MAX_V];\n ll prevv[MIN_COST_FLOW_MAX_V];\n ll preve[MIN_COST_FLOW_MAX_V];\n ll h[MIN_COST_FLOW_MAX_V];\n\n MinCostFlow(ll v) {\n V = v;\n }\n void init() {\n for (ll i = 0; i < MAX_FLOW_MAX_V; i++) {\n G[i].clear();\n }\n }\n void add_edge(ll from, ll to, ll cap, ll cost) {\n G[from].push_back((edge){to, cap, cost, (ll)G[to].size()});\n G[to].push_back((edge){from, 0, -cost, (ll)G[from].size() - 1});\n }\n void add_undirected_edge(ll e1, ll e2, ll cap, ll cost) {\n add_edge(e1, e2, cap, cost);\n add_edge(e2, e1, cap, cost);\n }\n ll min_cost_flow(ll s, ll t, ll f) { // minas\n ll res = 0;\n while (f > 0) {\n fill(dist, dist + V, INF);\n dist[s] = 0;\n bool update = true;\n while (update) {\n update = false;\n for (ll v = 0; v < V; v++) {\n if (dist[v] == INF) continue;\n for (ll i = 0; i < (ll)G[v].size(); i++) {\n edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n update = true;\n }\n }\n }\n }\n if (dist[t] == INF) {\n return -1;\n }\n ll d = f;\n for (ll v = t; v != s; v = prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * dist[t];\n for (ll v = t; v != s; v = prevv[v]) {\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n }\n ll min_cost_flow_dijkstra(ll s, ll t, ll f) {\n ll res = 0;\n fill(h, h + V, 0);\n while (f > 0) {\n priority_queue<P, vector<P>, greater<P> > que;\n fill(dist, dist + V, 0);\n dist[s] = 0;\n que.push(P(0, s));\n while (!que.empty()) {\n P p = que.top(); que.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n for (int i = 0; i < G[v].size(); i++) {\n edge &e = G[v][i];\n if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(P(dist[e.to], e.to));\n }\n }\n }\n if (dist[t] == INF) {\n return -1;\n }\n for (int v = 0; v < V; v++) h[v] += dist[v];\n int d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = tmin<ll>(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for (int v = t; v != s; v = prevv[v]) {\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n return res;\n }\n return 0;\n }\n};\n\n/**** LIS ****/\nll lis(ll* a, ll n, ll* dp) {\n fill(dp, dp + n, INF);\n for (ll i = 0; i < n; i++) *lower_bound(dp, dp + n, a[i]) = a[i];\n return (ll)(lower_bound(dp, dp + n, INF) - dp);\n}\n\n/**** Geometry ****/\n\nbool isEqual(double a, double b) { return abs(a - b) < EPS; }\nbool isCEqual(C a, C b) { return isEqual(a.cx, a.cy) && isEqual(a.cy, a.cy); }\nbool isZero(double a) { return abs(a) < EPS; } // a == 0\nbool isUZero(double a) { return a > EPS; } // a > 0\nbool isUEZero(double a) { return a > -EPS; } // a >= 0\nbool isLZero(double a) { return a < -EPS; } // a < 0\nbool isLEZero(double a) { return a < EPS; } // a <= 0\nC getUnitVector(C a) { double len = abs(a); return isZero(len) ? C(0.0, 0.0) : a / len; }\ndouble dot(C a, C b) { return a.cx * b.cx + a.cy * b.cy; } // |a||b|cosθ\ndouble det(C a, C b) { return a.cx * b.cy - a.cy * b.cx; } // |a||b|sinθ\nbool isLineOrthogonal(C a1, C a2, C b1, C b2) { return isZero(dot(a1 - a2, b1 - b2)); } // a1-a2, b1-b2\nbool isLineParallel(C a1, C a2, C b1, C b2) { return isZero(det(a1 - a2, b1 - b2)); } // a1-a2, b1-b2\nbool isPointOnLine(C a, C b, C c) { return isZero(det(b - a, c - a)); } // a-b <- c\nbool isPointOnLineSegment(C a, C b, C c) { // a-b <- c\n return isZero(det(b - a, c - a)) && isUEZero(dot(b - a, c - a)) && isUEZero(dot(a - b, c - b));\n}\n// bool isPointOnLineSegment(C a, C b, C c) { return isZero(abs(a-c) + abs(c-b) - abs(a-b)); }\ndouble distanceLineAndPoint(C a, C b, C c) { return abs(det(b-a, c-a)) / abs(b-a); } // a-b <- c\ndouble distanceLineSegmentAndPoint(C a, C b, C c) { // a-b <- c\n if (isLEZero(dot(b-a, c-a))) return abs(c-a);\n if (isLEZero(dot(a-b, c-b))) return abs(c-b);\n return abs(det(b-a, c-a)) / abs(b-a);\n}\nbool isIntersectedLine(C a1, C a2, C b1, C b2) { // a1-a2, b1-b2\n return !isLineParallel(a1, a2, b1, b2);\n}\nC intersectionLine(C a1, C a2, C b1, C b2) { // isIntersectedLine-> true\n C a = a2 - a1, b = b2 - b1;\n return a1 + a * det(b, b1 - a1) / det(b, a);\n}\n\n/**** NG Words ****/\n// cx cy P Q C\n// Warning: EPS\n\n/**** main function ****/\n\ndouble DINF = 1e30;\nll n, m, ans[10];\ndouble x, y, v[10], t[10];\nC d[10], fp, fv;\n\nint main() {\n while (scanf(\"%lld%lld\", &n, &m), n) {\n for (ll i = 0; i < n; i++) scanf(\"%lf%lf%lf\", &x, &y, &v[i]), d[i] = C(x, y), ans[i] = 0;\n for (ll i = 0; i < m; i++) {\n scanf(\"%lf%lf\", &x, &y), fp = C(x, y);\n scanf(\"%lf%lf\", &x, &y), fv = C(x, y);\n double mint = DINF;\n for (ll j = 0; j < n; j++) {\n double ax = fp.cx - d[j].cx;\n double ay = fp.cy - d[j].cy;\n double bx = fv.cx;\n double by = fv.cy;\n double A = bx * bx + by * by - v[j] * v[j];\n double B = ax * bx + ay * by;\n double C = ax * ax + ay * ay;\n // At^2 + 2Bt + C = 0\n if (isZero(A)) {\n if (isZero(B)) t[j] = DINF;\n else {\n double temp = C / (2 * B);\n if (isLZero(temp)) t[j] = DINF;\n else t[j] = temp, mint = min(mint, temp);\n }\n } else {\n double D = B * B - A * C;\n if (isLZero(D)) t[j] = DINF;\n else if (isZero(D)) {\n double temp = -B / A;\n if (isLZero(temp)) t[j] = DINF;\n else t[j] = temp, mint = min(mint, temp);\n } else {\n double t2 = sqrt(D);\n double temp = (-B - t2) / A;\n if (isLZero(temp)) temp = (-B + t2) / A;\n if (isLZero(temp)) t[j] = DINF;\n else t[j] = temp, mint = min(mint, temp);\n }\n }\n }\n for (ll j = 0; j < n; j++) {\n if (isZero(t[j] - DINF)) continue;\n d[j] = (fp + fv * t[j] - d[j]) * mint / t[j] + d[j];\n if (isZero(t[j] - mint)) ans[j]++;\n }\n }\n for (ll i = 0; i < n; i++) printf(\"%lld%c\", ans[i], i==n-1 ? '\\n' : ' ');\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 2584,
"score_of_the_acc": -0.5686,
"final_rank": 3
},
{
"submission_id": "aoj_1039_3052329",
"code_snippet": "#include <iostream>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\nconst double EPS = 1e-10;\nconst double INF = 1e12;\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\ntypedef complex<double> P;\ntypedef vector<P> VP;\n\nint main(){\n while(1){\n int n,m;\n cin >> n >> m;\n if(n == 0) break;\n\n VP dog(n);\n vector<double> v(n);\n for(int i=0; i<n; i++){\n double x,y;\n cin >> x >> y >> v[i];\n dog[i] = P(x, y);\n }\n\n VP fp(m), dir(m);\n for(int i=0; i<m; i++){\n double xp,yp,xd,yd;\n cin >> xp >> yp >> xd >> yd;\n fp[i] = P(xp, yp);\n dir[i] = P(xd, yd);\n }\n\n vector<int> ans(n, 0);\n for(int i=0; i<m; i++){\n //座標変換(フリスビー位置を原点、投げる方向をx軸方向に)\n P bpos = fp[i];\n P bdir = dir[i]/abs(dir[i]);\n for(int j=0; j<n; j++){\n dog[j] -= bpos;\n dog[j] /= bdir;\n }\n for(int j=0; j<m; j++){\n fp[j] -= bpos;\n fp[j] /= bdir;\n dir[j] /= bdir;\n }\n\n vector<bool> run(n, false);\n VP rdir(n);\n double tmin = INF;\n int minidx = -1;\n //2次方程式を解く\n for(int j=0; j<n; j++){\n double a,b,c;\n a = 1 -(v[j]*v[j] /norm(dir[i]));\n b = -2 *dog[j].X;\n c = norm(dog[j]);\n double sol = INF;\n if(abs(a) < EPS){\n if(abs(b) > EPS && -c/b > 0){\n sol = -c/b;\n }\n }else{\n double d = b*b -4*a*c;\n if(abs(d) < EPS) d = 0;\n if(d >= 0){\n double tmp[2] = {(-b+sqrt(d))/(2*a), (-b-sqrt(d))/(2*a)};\n if(tmp[0] > 0) sol = min(sol, tmp[0]);\n if(tmp[1] > 0) sol = min(sol, tmp[1]);\n }\n }\n\n if(sol == INF) continue;\n run[j] = true;\n rdir[j] = P(sol, 0) -dog[j];\n rdir[j] *= v[j] /abs(rdir[j]);\n double time = sol/dir[i].X;\n if(time < tmin){\n tmin = time;\n minidx = j;\n }\n }\n for(int j=0; j<n; j++){\n if(run[j]){\n dog[j] += tmin *rdir[j];\n }\n }\n if(minidx != -1){\n ans[minidx]++;\n }\n }\n\n for(int i=0; i<n-1; i++){\n cout << ans[i] << \" \";\n }\n cout << ans[n-1] << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 880,
"memory_kb": 3112,
"score_of_the_acc": -1.1573,
"final_rank": 18
},
{
"submission_id": "aoj_1039_2295803",
"code_snippet": "#include <bits/stdc++.h>\n#define double long double\nusing namespace std;\ntypedef complex<double> P;\nconst int INF = 1e9;\n\ndouble calc_time(P s,P t,P dog,double v){\n dog -= s;\n double a = abs(t*t)-v*v;\n double b = -2*(t.real()*dog.real()+t.imag()*dog.imag());\n double c = abs(dog*dog);\n\n if(a<0) a*=-1,b*=-1,c*=-1;\n double d = b*b-4*a*c;\n if(d < 0)return -1;\n \n if(-b-sqrt(d)>= 0) return (-b-sqrt(d))/(2*a);\n if(-b+sqrt(d)>= 0) return (-b+sqrt(d))/(2*a);\n return -1;\n}\n\nP Go(P s,P t,P dog,double v,double x,double T){\n t*=T;\n dog -= s;\n P res = (t - dog)/abs(t - dog);\n return (res*v*x)+dog+s;\n}\n\nint main(){\n \n while(1){\n int n,m;\n cin>>n>>m;\n if(!n&&!m)break;\n\n P dog[11];\n double v[11];\n for(int i=0;i<n;i++){\n double x,y;\n cin>>x>>y>>v[i];\n dog[i] = P(x,y);\n }\n\n int ans[11]={};\n while(m--){\n P s,t;\n double x,y;\n cin>>x>>y; s = P(x,y);\n cin>>x>>y; t = P(x,y);\n\n double mnt = INF ,time[11] = {};\n for(int i=0;i<n;i++){\n\ttime[i] = calc_time(s,t,dog[i],v[i]);\n\tif(time[i]>=0)mnt = min(mnt,time[i]);\n }\n for(int i=0;i<n;i++){\n\tif(time[i]>0)dog[i] = Go(s,t,dog[i],v[i],mnt,time[i]);\n\tans[i] += time[i] == mnt;\n }\n\n\n }\n\n for(int i=0;i<n;i++){if(i)cout<<\" \";cout<<ans[i];}\n cout<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 3228,
"score_of_the_acc": -0.8809,
"final_rank": 11
},
{
"submission_id": "aoj_1039_2293577",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nconst double eps=1e-8;\n#define MAX_N 10\n#define MAX_M 1000\n\ndouble Sqrt(double x){\n if(x<0)return 0;\n return sqrt(x);\n}\n\nint n,m;\ndouble dx[MAX_N],dy[MAX_N],dv[MAX_N];\ndouble fpx[MAX_M],fpy[MAX_M],fvx[MAX_M],fvy[MAX_M];\n\ndouble ddx[MAX_N],ddy[MAX_N];\ndouble gett[MAX_N];\n\ndouble calcdir(int id){\n double res=1e20;\n \n for(int i=0;i<n;i++){\n ddx[i]=ddy[i]=0;\n gett[i]=1e20;\n \n double cx = fpx[id]-dx[i];\n double cy = fpy[id]-dy[i];\n double A=fvx[id]*fvx[id]+fvy[id]*fvy[id]-dv[i]*dv[i];\n double B=2.0*(fvx[id]*cx+fvy[id]*cy);\n double C=cx*cx+cy*cy;\n if( B*B-4.0*A*C < -eps )continue;\n double t0 = ( -B + Sqrt(B*B-4.0*A*C) ) / ( 2.0*A );\n double t1 = ( -B - Sqrt(B*B-4.0*A*C) ) / ( 2.0*A );\n double mini=1e20;\n if( -eps < t0 )mini=min(mini,t0);\n if( -eps < t1 )mini=min(mini,t1);\n if(mini==1e20)continue;\n res=min(res,mini);\n gett[i]=mini;\n \n double nfx = fpx[id]+fvx[id]*mini;\n double nfy = fpy[id]+fvy[id]*mini;\n ddx[i] = nfx - dx[i];\n ddy[i] = nfy - dy[i];\n\n double len= Sqrt(ddx[i]*ddx[i] + ddy[i]*ddy[i]);\n if(len>eps){\n ddx[i]/=len;\n ddy[i]/=len;\n }\n\n }\n return res;\n}\n\nint ans[MAX_N];\n\nvoid solve(){\n memset( ans , 0 , sizeof(ans) );\n for(int i=0;i<m;i++){\n double t=calcdir(i);\n for(int j=0;j<n;j++){\n if( gett[j] == t )ans[j]++;\n dx[j]=dx[j]+t*ddx[j]*dv[j];\n dy[j]=dy[j]+t*ddy[j]*dv[j];\n }\n }\n\n for(int i=0;i<n;i++){\n if(i)cout<<' ';\n cout<<ans[i];\n }\n cout<<endl;\n}\n\nint main(){\n while(1){\n cin>>n>>m;\n if(n==0&&m==0)break;\n for(int i=0;i<n;i++){\n cin>>dx[i]>>dy[i]>>dv[i];\n }\n for(int i=0;i<m;i++){\n cin>>fpx[i]>>fpy[i]>>fvx[i]>>fvy[i];\n }\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 3228,
"score_of_the_acc": -0.8442,
"final_rank": 9
},
{
"submission_id": "aoj_1039_2152673",
"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;\nusing Point = complex<ld>;\nconst ld eps = 1e-9;\n\nvector<ld>quad_equa(ld a, ld b, ld c) {\n\tld root = b*b - 4 * a*c;\n\tif (abs(root) < eps) {\n\t\tld ans = -b / (2 * a);\n\t\treturn vector<ld>(2, ans);\n\t}\n\telse if (root > 0) {\n\t\tld ans = -b / (2 * a);\n\t\tvector<ld>anss(2);\n\t\tanss[0] = ans + sqrt(root) / (2 * a);\n\t\tanss[1] = ans - sqrt(root) / (2 * a);\n\t\tif (anss[0] > anss[1])swap(anss[0], anss[1]);\n\t\treturn anss;\n\t}\n\telse {\n\t\treturn vector<ld>();\n\t}\n}\n\npair<ld, Point> getway(Point dp,const ld dv, Point fp, Point fv) {\n\tfp -= dp;\n\tauto ts= quad_equa(norm(fv)-dv*dv, 2 * fv.real()*fp.real() + 2 * fv.imag()*fp.imag(), norm(fp));\n\tif (ts.empty()) {\n\t\treturn make_pair(1e18, Point(0.l, 0.l));\n\t}\n\telse {\n\t\tld t;\n\t\tif (ts[0] < -eps) {\n\t\t\tif (ts.size()>1) {\n\n\t\t\t\tt = ts[1];\n\t\t\t}\n\t\t\telse {\n\t\t\t\tt = ts[0];\n\t\t\t}\n\t\t}\n\t\telse t = ts[0];\n\t\tif (t < -eps)return make_pair(1e18, Point(0.l, 0.l));\n\t\tPoint catp = fp + fv*t;\n\t\treturn make_pair(t, catp / ld(t));\n\t}\n}\n\nint main() {\n\twhile (1) {\n\t\tint N; cin >> N;\n\t\tint M; cin >> M;\n\t\tif (!N)break;\n\t\tvector<Point>dps;\n\t\tvector<ld>dvs;\n\t\tvector<int>nums(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld dx, dy, v; cin >> dx >> dy >> v;\n\t\t\tdps.push_back(Point(dx, dy));\n\t\t\tdvs.push_back(v);\n\t\t}\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tvector<pair<ld, Point>>ways(N);\n\t\t\tld fpx, fpy, fvx, fvy; cin >> fpx >> fpy >> fvx >> fvy;\n\t\t\tPoint fp(fpx, fpy);\n\t\t\tPoint fv(fvx, fvy);\n\t\t\tld mint = 1e19;\n\t\t\tint minid = -1;\n\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\tways[j] = getway(dps[j], dvs[j], fp, fv);\n\t\t\t\tif (mint > ways[j].first) {\n\t\t\t\t\tmint = ways[j].first;\n\t\t\t\t\tminid = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tnums[minid]++;\n\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\tdps[j] += ways[j].second*mint;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcout << nums[i];\n\t\t\tif (i == N - 1)cout << endl;\n\t\t\telse cout << \" \";\n\t\t}\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 3152,
"score_of_the_acc": -0.847,
"final_rank": 10
},
{
"submission_id": "aoj_1039_1345123",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<utility>\n#include<complex>\n\nusing namespace std;\n\n\n\n\ntypedef complex<double> P;\n\nconst double eps = 1e-8;\n\nint calc(double a, double b, double c,pair<double,double>& ans){\n\t//cout << a <<\" \"<< b <<\" \"<< c << endl;\n\tdouble rt;\n\tif ((rt=b*b - 4 * a*c) < 0)return 0;\n\trt = sqrt(rt);\n\tans.first = (-b - rt) / (2 * a);\n\tans.second = (-b + rt) / (2 * a);\n\tif (ans.first < 0 && ans.second < 0)return 0;\n\telse if (ans.first < 0){\n\t\tswap(ans.first, ans.second);\n\t\treturn 1;\n\t}\n\telse if (ans.second < 0)return 1;\n\treturn 2;\n\n}\n\nstruct Dog{\n\tP pos;\n\tP v;\n\tdouble max_v;\n\tint cnt;\n\tDog(double x,double y,double s){\n\t\tpos.real(x); pos.imag(y); max_v = s; cnt = 0;;\n\t}\n};\nconst double INF = 1e9;\nint main(){\n\tint N, M;\n\tdouble x, y, v;\n\twhile (true){\n\t\tcin >> N >> M;\n\t\tif (N == 0 && M == 0)return 0;\n\n\t\tvector<Dog> dog;\n\t\tfor (int i = 0; i < N; i++){\n\t\t\tcin >> x >> y >> v;\n\t\t\tdog.push_back(Dog(x, y, v));\n\t\t}\n\t\tfor (int i = 0; i < M; i++){\n\t\t\tcin >> x >> y;\n\t\t\tP FP(x, y);\n\t\t\tcin >> x >> y;\n\t\t\tP FU(x, y);\n\t\t\tdouble res = INF;\n\t\t\tint index = -1;\n\t\t\tfor (int j = 0; j < N; j++){\n\t\t\t\tpair<double, double> T;\n\t\t\t\tint num = calc(FU.real()*FU.real() + FU.imag()*FU.imag() - dog[j].max_v*dog[j].max_v,\n\t\t\t\t\t2*(FP.real() - dog[j].pos.real())*FU.real() + 2*(FP.imag() - dog[j].pos.imag())*FU.imag(),\n\t\t\t\t\t(FP.real() - dog[j].pos.real())*(FP.real() - dog[j].pos.real()) + (FP.imag() - dog[j].pos.imag())*(FP.imag() - dog[j].pos.imag()), T);\n\t\t//\t\tcout << T.first << \" \" << T.second << endl;\n\t\t\t\tif (num == 2){\n\t\t\t\t\tdouble t = min(T.first, T.second);\n\t\t\t\t\tif (t < eps)dog[j].v.real(0), dog[j].v.imag(0);\n\t\t\t\t\tdog[j].v = (FP - dog[j].pos) / t + FU;\n\t\t\t\t\tif (t < res){\n\t\t\t\t\t\tres = t;\n\t\t\t\t\t\tindex = j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (num == 1){\n\t\t\t\t\tdouble t = T.first;\n\t\t\t\t\tif (t < eps)dog[j].v.real(0), dog[j].v.imag(0);\n\t\t\t\t\tdog[j].v = (FP - dog[j].pos) / t + FU;\n\t\t\t\t\tif (t < res){\n\t\t\t\t\t\tres = t;\n\t\t\t\t\t\tindex = j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tdog[j].v.real(0), dog[j].v.imag(0);\n\t\t\t\t}\n\t\t//\t\tcout << res << endl;\n\t\t\t}\n\t\t\tdog[index].cnt++;\n\t\t\tfor (int j = 0; j < N; j++){\n\t\t\t\tdog[j].pos = dog[j].pos + dog[j].v*res;\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < N-1; i++){\n\t\t\tcout << dog[i].cnt << \" \";\n\t\t}\n\t\tcout << dog[N - 1].cnt << endl;\n\n\t}\n\n\n\n\treturn(0);\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 1248,
"score_of_the_acc": -0.0906,
"final_rank": 2
},
{
"submission_id": "aoj_1039_1133312",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\n#include<math.h>\nusing namespace std;\ndouble dx[11];\ndouble dy[11];\ndouble dv[11];\nint ret[11];\ndouble eps=1e-7;\ndouble fx[1100];\ndouble fy[1100];\ndouble vx[1100];\ndouble vy[1100];\ndouble tx[11];\ndouble ty[11];\ndouble ABS(double a){return max(a,-a);}\nint main(){\n\tint a,b;\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tfor(int i=0;i<a;i++){\n\t\t\tscanf(\"%lf%lf%lf\",dx+i,dy+i,dv+i);\n\t\t}\n\t\tfor(int i=0;i<a;i++)ret[i]=0;\n\t\tfor(int i=0;i<b;i++){\n\t\t\tscanf(\"%lf%lf%lf%lf\",fx+i,fy+i,vx+i,vy+i);\n\t\t}\n\t\tfor(int i=0;i<b;i++){\n\t\t\tdouble val=999999999;\n\t\t\tint at=-1;\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tif((dx[j]-fx[i])*(dx[j]-fx[i])+(dy[j]-fy[i])*(dy[j]-fy[i])<eps)at=j;\n\t\t\t}\n\t\t\tif(~at){\n\t\t\t\tret[at]++;continue;\n\t\t\t}\n\t\t\tfor(int j=0;j<a;j++)tx[j]=ty[j]=0;\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tdouble A=vx[i]*vx[i]+vy[i]*vy[i]-dv[j]*dv[j];\n\t\t\t\tdouble B=2.0*((fx[i]-dx[j])*vx[i]+(fy[i]-dy[j])*vy[i]);\n\t\t\t\tdouble C=(fx[i]-dx[j])*(fx[i]-dx[j])+(fy[i]-dy[j])*(fy[i]-dy[j]);\n\t\t\t\tdouble t;\n\t\t\t\tif(ABS(A)<eps){\n\t\t\t\t\tif(ABS(B)<eps)continue;\n\t\t\t\t\tt=-C/B;\n\t\t\t\t}else if(B*B-A*C*4>-eps){\n\t\t\t\t\tt=(-B-sqrt(max(0.0,B*B-A*C*4)))/A/2;\n\t\t\t\t\tif(t<0)t=(-B+sqrt(max(0.0,B*B-A*C*4)))/A/2;\n\t\t\t\t}else continue;\n\t\t\t\tif(t<0)continue;\n\t\t\t\tif(val>t){\n\t\t\t\t\tval=t;at=j;\n\t\t\t\t}\n\t\t\t\tdouble sx=fx[i]+vx[i]*t;\n\t\t\t\tdouble sy=fy[i]+vy[i]*t;\n\t\t\t\ttx[j]=(sx-dx[j])/t;\n\t\t\t\tty[j]=(sy-dy[j])/t;\n\t\t\t}\n\t\t\tret[at]++;\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tdx[j]+=val*tx[j];\n\t\t\t\tdy[j]+=val*ty[j];\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<a;i++){\n\t\t\tif(i)printf(\" \");\n\t\t\tprintf(\"%d\",ret[i]);\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1108,
"score_of_the_acc": -0.0092,
"final_rank": 1
}
] |
aoj_1049_cpp
|
Problem 09:
Building Houses
この秋、割火ハウスは最近開拓が進んでいる松短地区の神暗通り沿いの土地を分譲することにした。
先日募集をかけ、今日は購入者に分譲説明会を開催する。
購入者が説明会場に集まりだしたところ、なんだか空気がとても凍り付いていた。不思議に思った担当者は開催前に
「皆さん新天地を求めてきたというのに、ちょっと表情が暗いですが大丈夫ですか？」
と聞いてみた。そこで思わぬ事実が判明した。実は、購入者全員が現在隣町の集合団地の住人で、あまりにも周辺の人たちと折り合いが合わないため今回引越しをしようと検討していたのだった。
購入者たちはすでに費用を支払済みで以前の住まいを引き払っている。従って、今回分譲した松短地区の神暗通りに家を立てる他方法はない。
しかしながら、少しでも快適な新居ライフを送ってもらおうと担当者は頭を悩ませた。よくよく話を聞いてみると、仲の悪さにはバラツキがあったので、聞き込みを行い図１のような仲の悪い度チェック表を作成した：
図１：仲の悪い度チェック表
購入者の数を
n
とすると、表は
n
×
n
の行列となり、要素
a
i,j
は、購入者
i
が自分の家から購入者
j
の家を最低でも何 m 離したいかを示す。例えば、図１の表において、購入者 A は自分の家と購入者 B の家の距離が 2 m 以上離れていないと納得しない。さらに、購入者 B は自分の家と購入者 A の家の距離が 4 m 以上離れていないと納得しない。従って A と B の距離は 4 m 以上離す必要がある。
担当者はこの表に基づき隣の家との間隔を設け土地のレイアウトを設計することにした。
あなたの仕事は、仲の悪い度チェック表を入力し、購入者の家を神暗通り（一直線上）に建てるために最低限必要な通りの長さ（m）を出力するプログラムを作成することである。
なお簡単のために、家は点として扱い、その幅は 0 m と仮定する。
Input
入力として複数のデータセットが与えられる。各データセットは以下の形式で与えられる：
n
（購入者の数：整数）
a
1,1
a
1,2
...
a
1,
n
（
a
1,
j
：整数）
a
2,1
a
2,2
...
a
2,
n
（
a
2,
j
：整数）
.
.
a
n
,1
a
n
,2
...
a
n
,
n
（
a
n
,
j
：整数）
n
は 10 以下とする。
a
i
,
i
は 0 であり、
a
i
,
j
(
i
≠
j
) は 1 以上である。
n
が 0 のとき入力の終わりとする。
Output
各データセットについて、最低限必要な通りの長さを１行に出力せよ。
Sample Input
4
0 2 3 1
4 0 4 2
1 1 0 3
3 1 5 0
2
0 3
3 0
0
Output for the Sample Input
8
3
|
[
{
"submission_id": "aoj_1049_10397151",
"code_snippet": "#include <cstdio>\n#include <algorithm>\n#include <vector>\n#include <climits>\n#include <numeric>\nusing namespace std;\n\n// i を [a,b) の範囲で動かすループマクロ\n#define repi(i,a,b) for(int i=int(a); i<int(b); i++)\n// i を [0,n) の範囲で動かすループマクロ\n#define rep(i,n) repi(i,0,n)\n// コンテナ c の begin/end\n#define all(c) (c).begin(), (c).end()\n\nint ans;\n\n// 再帰的に perm[0..cur-1] までを配置済みとし、perm[cur..n-1] の順番を試す。\n// a[i][j]: i と j の間に必要な最小距離（対称化済み）\n// perm: 現在の順列\n// pos: perm[k] の家を置いた座標\n// cur: これから配置する順列のインデックス\nint solve(const vector<vector<int>>& a,\n vector<int>& perm,\n vector<int>& pos,\n int cur)\n{\n int n = a.size();\n // ベースケース: 全員配置したら、必要な通りの長さ = max_i pos[i]\n if(cur == n){\n // グローバル ans を更新\n ans = min(ans, *max_element(all(pos)));\n return ans;\n }\n int res = INT_MAX;\n // すでに配置済みの右端を求める\n int right = 0;\n rep(t, cur){\n right = max(right, pos[ perm[t] ]);\n }\n // cur 以降の要素を cur に持ってきて試す\n repi(i, cur, n){\n swap(perm[cur], perm[i]);\n int id = perm[cur];\n // この家を置く最小座標を求める\n int best = right;\n rep(j, cur){\n int prev = perm[j];\n // prev と id の距離制約を満たすには\n best = max(best, pos[prev] + a[id][prev]);\n }\n // これ以上 ans を超えるなら枝刈り\n if(best < ans){\n pos[id] = best;\n res = min(res, solve(a, perm, pos, cur+1));\n }\n swap(perm[cur], perm[i]);\n }\n return res;\n}\n\nint main(){\n while(true){\n int n;\n if(scanf(\"%d\",&n)!=1 || n==0) break;\n // 入力行列 a[i][j]\n vector<vector<int>> a(n, vector<int>(n));\n rep(i,n) rep(j,n){\n scanf(\"%d\",&a[i][j]);\n }\n // 対称化：両者の希望距離の大きい方を採用\n rep(i,n) rep(j,n){\n a[i][j] = max(a[i][j], a[j][i]);\n }\n // 初期の順列と配置座標\n vector<int> perm(n), pos(n,0);\n iota(all(perm), 0);\n // ans を大きな値で初期化\n ans = INT_MAX;\n // 再帰探索スタート\n int answer = solve(a, perm, pos, 0);\n printf(\"%d\\n\", answer);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 2728,
"score_of_the_acc": -0.8442,
"final_rank": 11
},
{
"submission_id": "aoj_1049_9090513",
"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 vector<vector<ll>> a(n, vector<ll>(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 for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n a[i][j] = max(a[i][j], a[j][i]);\n }\n }\n ll res = 1e18;\n vector<bool> done(n);\n vector<int> v(n);\n vector<ll> d(n);\n auto dfs = [&](auto dfs, int i) -> void {\n if (i == n) {\n res = min(res, d.back());\n return;\n }\n // cout << i << endl;\n for (int j = 0; j < n; j++) {\n if (done[j]) continue;\n ll mx = 0;\n for (int k = 0; k < i; k++) {\n mx = max(mx, d[k] + a[v[k]][j]);\n }\n if (mx >= res) break;\n done[j] = true;\n d[i] = mx;\n v[i] = j;\n dfs(dfs, i + 1);\n done[j] = false;\n }\n };\n dfs(dfs, 0);\n cout << res << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3376,
"score_of_the_acc": -1,
"final_rank": 13
},
{
"submission_id": "aoj_1049_2875549",
"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\nint N;\nint ans;\nbool used[10];\nint table[10][10],position[10];\n\nvoid recursive(int loc,int count){\n\n\tif(count == N){\n\t\tans = min(ans,loc);\n\t\treturn;\n\t}\n\n\tint next_loc;\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(used[i])continue;\n\n\t\t//既に配置済の人物から、次の配置場所を特定する\n\n\t\tnext_loc = loc;\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tif(!used[k])continue;\n\t\t\tif(loc-position[k] >= table[i][k])continue; //必要以上離れていればSKIP\n\n\t\t\tnext_loc = max(next_loc,position[k]+table[i][k]);\n\t\t}\n\n\t\tif(next_loc >= ans)continue; //次の場所がans以上ならskip\n\n\t\tused[i] = true;\n\t\tposition[i] = next_loc;\n\t\trecursive(next_loc,count+1);\n\t\tused[i] = false;\n\t\tposition[i] = -1;\n\t}\n}\n\nvoid func(){\n\n\tfor(int row = 0; row < N; row++){\n\t\tfor(int col = 0; col < N; col++)scanf(\"%d\",&table[row][col]);\n\t}\n\n\tfor(int row = 0; row < N; row++){\n\t\tfor(int col = 0; col < N; col++){\n\t\t\ttable[row][col] = max(table[row][col],table[col][row]);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tused[i] = false;\n\t\tposition[i] = -1;\n\t}\n\n\tans = BIG_NUM;\n\n\tfor(int first = 0; first < N; first++){\n\t\tposition[first] = 0;\n\t\tused[first] = true;\n\t\trecursive(0,1);\n\t\tposition[first] = -1;\n\t\tused[first] = false;\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 770,
"memory_kb": 3092,
"score_of_the_acc": -1.6749,
"final_rank": 19
},
{
"submission_id": "aoj_1049_2146068",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int INF = 1 << 30;\n\nint main()\n{\n int N, A[10][10];\n while(cin >> N, 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 for(int i = 0; i < N; i++) {\n for(int j = 0; j < N; j++) {\n A[i][j] = max(A[i][j], A[j][i]);\n }\n }\n\n int ret = INF;\n vector< int > s(N), p(N, 0);\n iota(begin(s), end(s), 0);\n int loop = 0;\n do {\n if(loop++ >= 3000000) break;\n int i = 1;\n while(i < s.size()) {\n p[i] = 0;\n for(int j = i - 1; j >= 0; j--) {\n p[i] = max(p[i], A[s[j]][s[i]] + p[j]);\n }\n if(p[i++] >= ret) break;\n }\n ret = min(ret, p.back());\n } while(next_permutation(begin(s), end(s)));\n\n cout << ret << endl;\n }\n}",
"accuracy": 1,
"time_ms": 970,
"memory_kb": 3056,
"score_of_the_acc": -1.9052,
"final_rank": 20
},
{
"submission_id": "aoj_1049_2010610",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define INF (1<<29)\n\nint a[10][10], res;\n\nvoid dfs(int n, int S, int cost,\n vector<int> &p, vector<int> &pos)\n{\n if (S == (1<<n)-1) {\n res = min(res, cost);\n return; \n }\n\n if (res <= cost) return;\n \n for (int i = 0; i < n; i++) {\n if (S >> i & 1) continue;\n int npos = 0;\n for (int j = 0; j < (int)pos.size(); j++) {\n npos = max(npos, pos[j] + a[p[j]][i]);\n }\n p.push_back(i);\n pos.push_back(npos);\n\n dfs(n, S|(1<<i), npos, p, pos);\n \n p.pop_back();\n pos.pop_back();\n }\n\n}\n\nint main()\n{\n int n;\n while (cin >> n, 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\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n a[i][j] = max(a[i][j], a[j][i]);\n }\n }\n \n res = INF;\n vector<int> p, pos; \n dfs(n, 0, 0, p, pos);\n cout << res << endl;\n } \n return 0;\n}",
"accuracy": 1,
"time_ms": 410,
"memory_kb": 3092,
"score_of_the_acc": -1.2412,
"final_rank": 17
},
{
"submission_id": "aoj_1049_1660674",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\nusing namespace std;\n\nint n;\nint d[10][10];\n\nbool bound(int k, long long *length, bool used[], int home[], long long c[], const int n)\n{\n bool res = false;\n long long lb; // ??????????????¢?´¢?????????\n int t = home[k-1];\n lb = c[k-1];\n\n int m = 0;\n for (int i=0;i<n;i++)\n {\n if (!used[i])\n {\n m = max(m, d[t][i]);\n }\n }\n // ????????????????????§??????????§£??????????????´???\n if (lb + max(m, n-k+1) >= *length && *length > 0) res = true;\n return res;\n}\n\nvoid dfs(int k, long long *length, bool used[], int home[], long long c[], const int n)\n{\n if (k == n)\n {\n if (*length > c[n-1] || *length == 0) *length = c[n-1];\n return;\n }\n else if (k > 0 && *length > 0 && bound(k, length, used, home, c, n)) return;\n else\n {\n for (int i=0;i<n;i++)\n {\n if (!used[i])\n {\n used[i] = true;\n home[k] = i;\n if (k == 0) c[k] = 0;\n else\n {\n c[k] = c[k-1] + d[home[k]][home[k-1]];\n for (int j=k-2;j>=0;j--) c[k] = max(c[k], c[j] + d[home[k]][home[j]]);\n }\n dfs(k+1, length, used, home, c, n);\n used[i] = false;\n }\n }\n }\n return ;\n}\n\nint main()\n{\n while (1)\n {\n cin >> n;\n if (n == 0) return 0;\n\n for (int i=0;i<n;i++) for (int j=0;j<n;j++) cin >> d[i][j];\n for (int i=0;i<n;i++) for (int j=0;j<n;j++) d[i][j] = max(d[i][j], d[j][i]);\n\n long long length = 0;\n bool used[10] = {false, false, false, false, false, false, false, false, false, false};\n int home[10];\n long long c[10];\n\n dfs(0, &length, used, home, c, n);\n cout << length << endl;\n }\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 1156,
"score_of_the_acc": -0.4147,
"final_rank": 1
},
{
"submission_id": "aoj_1049_1660673",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\nusing namespace std;\n\nint n;\nint d[10][10];\n\nbool bound(int k, long long *length, bool used[], int home[], long long c[], const int n)\n{\n bool res = false;\n long long lb; // ??????????????¢?´¢?????????\n int t = home[k-1];\n lb = c[k-1];\n\n int m = 0, mm = 99999;\n for (int i=0;i<n;i++)\n {\n if (!used[i])\n {\n m = max(m, d[t][i]);\n //mm = min(mm, d[t][i]);\n }\n }\n if (lb + max(m, n-k+1) >= *length && *length > 0) res = true; // ????????????????????§??????????§£??????????????´???\n return res;\n}\n\nvoid dfs(int k, long long *length, bool used[], int home[], long long c[], const int n)\n{\n if (k == n)\n {\n //for (int i=0;i<n;i++) cout << home[i]; cout << ' ' << c[n-1] << endl;\n if (*length > c[n-1] || *length == 0) *length = c[n-1];\n return;\n }\n else if (k > 0 && *length > 0 && bound(k, length, used, home, c, n)) return;\n else\n {\n for (int i=0;i<n;i++)\n {\n if (!used[i])\n {\n used[i] = true;\n home[k] = i;\n if (k == 0) c[k] = 0;\n else\n {\n c[k] = c[k-1] + d[home[k]][home[k-1]];\n for (int j=k-2;j>=0;j--) c[k] = max(c[k], c[j] + d[home[k]][home[j]]);\n }\n dfs(k+1, length, used, home, c, n);\n used[i] = false;\n }\n }\n }\n return ;\n}\n\nint main()\n{\n while (1)\n {\n cin >> n;\n if (n == 0) return 0;\n\n for (int i=0;i<n;i++) for (int j=0;j<n;j++) cin >> d[i][j];\n for (int i=0;i<n;i++) for (int j=0;j<n;j++) d[i][j] = max(d[i][j], d[j][i]);\n\n long long length = 0;\n bool used[10] = {false, false, false, false, false, false, false, false, false, false};\n int home[10];\n long long c[10];\n\n dfs(0, &length, used, home, c, n);\n cout << length << endl;\n }\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 1156,
"score_of_the_acc": -0.4268,
"final_rank": 2
},
{
"submission_id": "aoj_1049_1162294",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint n,ans;\nint a[10][10], use[10], perm[10], pos[10];\n\nvoid dfs(int d, int r){\n if(d==n){\n ans = r; return;\n }\n\n for(int i=0;i<n;i++){\n if(!use[i]){\n use[i] = 1;\n\n perm[d] = i; pos[d] = 0;\n for(int j=0;j<d;j++){\n\tpos[d] = max(pos[d], pos[j] + a[i][perm[j]]);\n }\n if(pos[d]<ans)dfs(d+1,pos[d]);\n\n use[i] = 0;\n }\n } \n}\n\nint main(){\n while(cin >> n,n){\n for(int i=0;i<n;i++)for(int j=0;j<n;j++){\n\tcin >> a[i][j];\n\tif(j<i)a[i][j] = a[j][i] = max(a[i][j],a[j][i]);\n }\n\n memset(use,0,sizeof(use));\n ans = 1e9;\n dfs(0,0);\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 360,
"memory_kb": 1160,
"score_of_the_acc": -0.6087,
"final_rank": 6
},
{
"submission_id": "aoj_1049_1132914",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint perm[11];\nint g[11][11];\nint d[11];\nint v[11];\nint ret;\nint n;\nvoid solve(int a){\n\tif(a==n){ret=d[n-1];return;}\n\tfor(int i=0;i<n;i++){\n\t\tif(v[i])continue;\n\t\tint at=0;\n\t\tfor(int j=0;j<a;j++)at=max(at,d[j]+g[i][perm[j]]);\n\t\tif(at<ret){\n\t\t\tv[i]=1;\n\t\t\tperm[a]=i;\n\t\t\td[a]=at;\n\t\t\tsolve(a+1);\n\t\t\tv[i]=0;\n\t\t}\n\t}\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++){\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tscanf(\"%d\",&g[i][j]);\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<a;i++)for(int j=i+1;j<a;j++){\n\t\t\tg[i][j]=g[j][i]=max(g[i][j],g[j][i]);\n\t\t}\n\t\tfor(int i=0;i<a;i++)perm[i]=i;\n\t\tret=999999999;\n\t\tfor(int i=0;i<a;i++)v[i]=0;\n\t\tsolve(0);\n\t\tprintf(\"%d\\n\",ret);\n\t}\n}",
"accuracy": 1,
"time_ms": 350,
"memory_kb": 1012,
"score_of_the_acc": -0.5528,
"final_rank": 5
},
{
"submission_id": "aoj_1049_1025384",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<utility>\n#include<algorithm>\n\nusing namespace std;\n\nint n;\nint a[10][10];\n\nint dfs(const vector<pair<int,int> > &v,int b,int m){\n if(b+1==1<<n)return v.back().second;\n for(int i=0;i<n;i++){\n if(!(b>>i&1)){\n int p=0;\n for(auto e:v){\n\tp=max(p,e.second+a[e.first][i]);\n }\n if(m<=p)continue;\n auto nv=v;\n nv.emplace_back(i,p);\n m=min(m,dfs(nv,b|1<<i,m));\n }\n }\n return m;\n}\n\nint main(){\n while(cin>>n,n){\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n\tcin>>a[i][j];\n }\n }\n for(int i=0;i<n;i++){\n for(int j=0;j<i;j++){\n\ta[i][j]=a[j][i]=max(a[i][j],a[j][i]);\n }\n }\n cout<<dfs(vector<pair<int,int> >(),0,1<<29)<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 750,
"memory_kb": 1200,
"score_of_the_acc": -1.0904,
"final_rank": 14
},
{
"submission_id": "aoj_1049_881548",
"code_snippet": "#include <algorithm>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\nusing namespace std;\n\ntemplate<class T> inline void chmax(T &a, const T &b) { if(a < b) a = b; }\n\nconstexpr int MAX_N = 10;\nconstexpr int INF = (1 << 29);\n\nint n;\nint a[MAX_N][MAX_N];\n\nint ans;\nint dist[MAX_N];\n\nvoid dfs(int index) {\n\tfor(int i = 0; i < n; ++i) {\n\t\tif(dist[i] != INF) continue;\n\n\t\tint max_dist = 0;\n\t\tfor(int j = 0; j < n; ++j) {\n\t\t\tif(dist[j] != INF) {\n\t\t\t\tchmax(max_dist, dist[j] + a[i][j]);\n\t\t\t}\n\t\t}\n\n\t\tif(max_dist >= ans) continue;\n\t\tif(index == n - 1) {\n\t\t\tans = max_dist;\n\t\t\treturn;\n\t\t}\n\n\t\tdist[i] = max_dist;\n\t\tdfs(index + 1);\n\t\tdist[i] = INF;\n\t}\n}\n\nint main() {\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tfill(dist, dist + MAX_N, INF);\n\twhile(cin >> n && 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 >> a[i][j];\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 < n; ++j) {\n\t\t\t\ta[i][j] = a[j][i] = max(a[i][j], a[j][i]);\n\t\t\t}\n\t\t}\n\n\t\tans = INF;\n\t\tdfs(0);\n\t\tcout << ans << endl;\n\t}\n\n\treturn EXIT_SUCCESS;\n}",
"accuracy": 1,
"time_ms": 640,
"memory_kb": 1196,
"score_of_the_acc": -0.9567,
"final_rank": 12
},
{
"submission_id": "aoj_1049_607703",
"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<<\" \"; }\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};\nbool used[10];\nint parm[10];\nint N;\nint a[10][10];\nint dist[10];\nint ans;\nvoid dfs(int idx){\n if(idx == N){\n ans = dist[idx - 1];\n return;\n }\n for(int i = 0; i < N; i++) if(!used[i]){\n parm[idx] = i;\n used[i] = true;\n dist[idx] = 0;\n for(int j = 0; j < idx; j++){\n dist[idx] = max(dist[idx], dist[j] + a[parm[j]][parm[idx]]);\n }\n if(dist[idx] < ans) dfs(idx + 1);\n used[i] = false;\n }\n}\n\nint main(){\n while(cin >> N && N){\n REP(i, N){\n REP(j, N){\n cin >> a[i][j];\n }\n }\n REP(i, N)REP(j, N) a[i][j] = max(a[i][j], a[j][i]);\n memset(used, 0, sizeof(used));\n ans = INF;\n dfs(0);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 390,
"memory_kb": 1160,
"score_of_the_acc": -0.6448,
"final_rank": 8
},
{
"submission_id": "aoj_1049_468617",
"code_snippet": "#include <cstdio>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\n#define repi(i,a,b) for(int i=int(a);i<int(b);i++)\n#define rep(i,n) repi(i,0,n)\n#define all(c) begin(c),end(c)\n\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\n\nint ans;\n\nint solve(const vvi& a,vi& perm,vi& pos,int cur)\n{\n\tint n=a.size();\n\tif(cur==a.size())\n\t\treturn ans=min(ans,*max_element(all(pos)));\n\t\n\tint res=1<<29,right=0;\n\trep(i,cur)\n\t\tright=max(right,pos[perm[i]]);\n\trepi(i,cur,n){\n\t\tswap(perm[cur],perm[i]);\n\t\tint mx=0;\n\t\trep(j,cur){\n\t\t\tint x=perm[cur],y=perm[j];\n\t\t\tmx=max(mx,pos[y]+a[x][y]);\n\t\t}\n\t\tif(mx<ans){\n\t\t\tpos[perm[cur]]=mx;\n\t\t\tres=min(res,solve(a,perm,pos,cur+1));\n\t\t}\n\t\tswap(perm[cur],perm[i]);\n\t}\n\treturn res;\n}\n\nint main()\n{\n\tfor(int n;scanf(\"%d\",&n),n;){\n\t\tvvi a(n,vi(n));\n\t\trep(i,n) rep(j,n)\n\t\t\tscanf(\"%d\",&a[i][j]);\n\t\trep(i,n) rep(j,n)\n\t\t\ta[i][j]=max(a[i][j],a[j][i]);\n\t\t\n\t\tvi perm(n),pos(n); iota(all(perm),0);\n\t\tans=1<<29;\n\t\tprintf(\"%d\\n\",solve(a,perm,pos,0));\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 280,
"memory_kb": 1052,
"score_of_the_acc": -0.4803,
"final_rank": 3
},
{
"submission_id": "aoj_1049_451688",
"code_snippet": "#include<stdio.h>\n#include<string.h>\n#include<algorithm>\nint ans,lens[11],data[11][11];\nbool spents[11];\n\nint n;\n\nvoid saiki(int deep,int l){\n\tif(deep==n){\n\t\tif(ans==-1)ans=l;\n\t\tans=std::min(ans,l);\n\t}else{\n\t\tint back[11];\n\t\tbool out=false;\n\t\tmemcpy(back,lens,sizeof(lens));\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(spents[i]==false){\n\t\t\t\tspents[i]=true;\n\t\t\t\tint len=lens[i];\n\t\t\t\tfor(int j=0;j<n;j++){\n\t\t\t\t\tif(spents[j]==false)lens[j]=std::max(len+data[i][j],lens[j]);\n\t\t\t\t\tif(ans>-1&&ans<=lens[j]&&spents[j]==false)out=true;\n\t\t\t\t}\n\t\t\t\tif(out==false)saiki(deep+1,len);\n\t\t\t\tout=false;\n\t\t\t\tmemcpy(lens,back,sizeof(back));\n\t\t\t\tspents[i]=false;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid setData(){\n\t\n\tans=-1;\n\tmemset(data,0,sizeof(data));\n\tfor(int i=0;i<n;i++){\n\t\tspents[i]=false;\n\t\tlens[i]=0;\n\t\tfor(int j=0;j<n;j++){\n\t\t\tscanf(\"%d\",&data[i][j]);\n\t\t\tdata[i][j]=data[j][i]=std::max(data[i][j],data[j][i]);\n\t\t}\n\t}\n\tsaiki(0,0);\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\twhile(1){\n\t\tscanf(\"%d\",&n);\n\t\tif(n==0)break;\n\t\tsetData();\n\t}\n}",
"accuracy": 1,
"time_ms": 370,
"memory_kb": 764,
"score_of_the_acc": -0.5034,
"final_rank": 4
},
{
"submission_id": "aoj_1049_434901",
"code_snippet": "#include <vector>\n#include <algorithm>\n#include <iostream>\n#include <cstring>\n\nusing namespace std;\n\nint n;\nint g[10][10];\nint dist[10] = {};\nint maxHate[10] = {};\nint minHate[10] = {};\nint ord[10];\nint maxRest[10][1<<10];\n\nint solve(){\n\tif (n == 1) return 0;\n\tord[1] = 0;\n\tint minD = 1 << 30;\n\tint sumMinHate = 0;\n\tfor (int i = 0; i < n; ++i) sumMinHate += minHate[i];\n\tdo{\n\t\tint pOne = -1;\n\t\tint used = (1 << ord[0]);\n\t\tint rest = sumMinHate - minHate[ord[0]];\n\t\tbool one = ord[0] == 0;\n\t\tfor (int i = 1; i < n; ++i) {\n\t\t\tint p = ord[i];\n\t\t\tif (ord[i] == 0) {\n\t\t\t\tif (one) {\n\t\t\t\t\tpOne = i;\n\t\t\t\t\tp = ord[i] = 1;\n\t\t\t\t}\n\t\t\t\tone = !one;\n\t\t\t}\n\t\t\trest -= minHate[p];\n\t\t\tdist[i] = dist[i-1];\n\t\t\tfor (int j = i-1; j >= 0; --j) {\n\t\t\t\tif (dist[i] - dist[j] >= maxRest[p][used]) break;\n\t\t\t\tdist[i] = max(dist[i], dist[j] + g[p][ord[j]]);\n\t\t\t}\n\t\t\tif (dist[i] + rest >= minD) {\n\t\t\t\tdist[n-1] = 1 << 30;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tused += 1 << p;\n\t\t}\n\t\tminD = min(minD, dist[n-1]);\n\t\tif (pOne != -1) ord[pOne] = 0;\n\t} while (next_permutation(ord, ord+n));\n\treturn minD;\n}\n\nint main(){\n\tint trailZero[1024] = {};\n\tfor (int i = 0; i < 10; ++i) {\n\t\ttrailZero[(1 << (i+1)) - 1] = i;\n\t}\n\twhile(true) {\n\t\tcin >> n;\n\t\tif (n == 0 || cin.eof()) break;\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tord[i] = i;\n\t\t\tminHate[i] = 1 << 30;\n\t\t\tmaxHate[i] = 0;\n\t\t\tfor (int j = 0; j < n; ++j) {\n\t\t\t\tscanf(\"%d\", g[i] + j);\n\t\t\t}\n\t\t}\n\t\tmemset(maxRest, 0, sizeof(maxRest));\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tfor (int j = i+1; j < n; ++j) {\n\t\t\t\tg[i][j] = g[j][i] = max(g[i][j], g[j][i]);\n\t\t\t\tmaxHate[i] = max(maxHate[i], g[i][j]);\n\t\t\t\tmaxHate[j] = max(maxHate[j], g[i][j]);\n\t\t\t\tminHate[i] = min(minHate[i], g[i][j]);\n\t\t\t\tminHate[j] = min(minHate[j], g[i][j]);\n\t\t\t}\n\t\t}\n\t\tfor (int j = 1; j < (1 << n); ++j) {\n\t\t\tfor (int k = 0; k < n; ++k) {\n\t\t\t\tif ((j & (1 << k)) == 0 || j == (1 << k)) continue;\n\t\t\t\tint st = j - (1 << k);\n\t\t\t\tint prev = st & (st-1);\n\t\t\t\tint pos = trailZero[st ^ (st-1)];\n\t\t\t\tmaxRest[k][st] = max(maxRest[k][prev], g[k][pos]);\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", solve());\n\t}\n}",
"accuracy": 1,
"time_ms": 940,
"memory_kb": 960,
"score_of_the_acc": -1.2482,
"final_rank": 18
},
{
"submission_id": "aoj_1049_390007",
"code_snippet": "#include<cstdio>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nconst int INF=1<<29;\n\nint n,d[10][10];\n\nint pos[10],ans;\nbool used[10];\nvoid dfs(int right){\n\tif(right>=ans) return;\n\n\tint na=0,a[10],nb=0,b[10];\n\trep(i,n){\n\t\tif(!used[i]) a[na++]=i;\n\t\telse b[nb++]=i;\n\t}\n\n\tif(na==0){ ans=right; return; }\n\n\tint lb=right;\n\trep(i,na) rep(j,nb) {\n\t\tint u=a[i],v=b[j];\n\t\tlb=max(lb,pos[v]+d[v][u]);\n\t}\n\tif(lb>=ans) return;\n\n\trep(i,na){\n\t\tint u=a[i],v;\n\t\trep(j,nb) v=b[j], pos[u]=max(pos[u],pos[v]+d[v][u]);\n\t\tused[u]=true;\n\n\t\tdfs(pos[u]);\n\n\t\tpos[u]=0;\n\t\tused[u]=false;\n\t}\n}\n\nint main(){\n\tfor(;scanf(\"%d\",&n),n;){\n\t\trep(i,n) rep(j,n) scanf(\"%d\",d[i]+j);\n\t\trep(i,n) rep(j,n) d[i][j]=max(d[i][j],d[j][i]);\n\n\t\tans=INF;\n\t\tdfs(0);\n\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 640,
"memory_kb": 764,
"score_of_the_acc": -0.8287,
"final_rank": 10
},
{
"submission_id": "aoj_1049_287710",
"code_snippet": "#include<iostream>\n#include<climits>\n#include<cstdio>\n#include<algorithm>\n#include<cstring>\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n\nint g[10][10];\nint n;\nint ans;\nint m[10];\nint flag[10];\nint p[10];\n\nvoid solve(int pos, int nn){\n int now = p[nn - 1];\n if(nn == n){\n ans = min(ans, now);\n }else if(now < ans){\n REP(i,n) if(!flag[i]){\n int dst = 0;\n flag[i] = 1;\n m[nn] = i;\n REP(j, nn) dst = max(dst, p[j] + g[i][m[j]]);\n p[nn] = dst;\n solve(i, nn + 1);\n flag[i] = 0;\n }\n }\n}\n\nint main(){\n while(scanf(\"%d\", &n), n){\n REP(i,n) REP(j,n)\n scanf(\"%d\", &g[i][j]);\n REP(i,n) REP(j,n)\n g[i][j] = max(g[i][j], g[j][i]);\n\n ans = INT_MAX;\n\n REP(i,n){\n m[0] = i;\n flag[i] = 1;\n solve(i, 1);\n flag[i] = 0;\n }\n printf(\"%d\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 690,
"memory_kb": 0,
"score_of_the_acc": -0.6627,
"final_rank": 9
},
{
"submission_id": "aoj_1049_285882",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nint p[10];\nint field[10][10];\nint a[10];\n\nint main(){\n const int INF=1000000000;\n int n;\n while(scanf(\"%d\",&n),n!=0){\n for(int i = 0; i < n; i++)\n for(int j = 0; j < n; j++)\n scanf(\"%d\",&field[i][j]);\n for(int i = 0; i < n; i++)\n for(int j = 0; j < n; j++)\n field[i][j]=max(field[i][j],field[j][i]);\n for(int i = 0; i < 10; i++)\n a[i]=i;\n int minLength=INF;\n do{\n // »ÝÌÔÅÅáÀKvÈ·³\n int least=0;\n for(int i = 1; i < n; i++)\n least+=field[a[i]][a[i-1]];\n if(least>=minLength)\n continue;\n // aÌÔɨ¢Ä¢\n for(int i = 0; i < n; i++){\n int rightPlace=0;\n if(i==0)\n rightPlace=0;\n else{\n // ±±ðǤüP·é©H\n for(int j = 0; j < i; j++)\n rightPlace=max(rightPlace,field[a[i]][a[j]]+p[j]);\n }\n p[i]=rightPlace;\n if(p[i]>=minLength)\n break;\n }\n if(minLength>p[n-1])\n minLength=p[n-1];\n }while(next_permutation(a,a+n));\n printf(\"%d\\n\",minLength);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 830,
"memory_kb": 876,
"score_of_the_acc": -1.0908,
"final_rank": 15
},
{
"submission_id": "aoj_1049_285073",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <queue>\n#include <set>\nusing namespace std;\n\nint n;\n\nstruct NODE{\n\tint v[10],o[10];\n\tint depth;\n\tNODE(){};\n};\nint sz;\nint dist[10][10];\nNODE q;\nint ans;\nvoid f(int cur){\n\tif(cur >= ans) return;\n\tif(sz == n){\n\t\tans = cur;\n\t\treturn;\n\t}\n\tfor(int i = 0 ; i < n ; i++){\n\t\tif(q.o[i] == -1){\n\t\t\tint mx = 0;\n\t\t\tfor(int j = 0 ; j < sz ; j++){\n\t\t\t\tmx = max(q.o[q.v[j]]+dist[q.v[j]][i],mx);\n\t\t\t}\n\t\t\tq.v[sz] = i;\n\t\t\tq.o[i] = mx;\n\t\t\tint t = q.depth;\n\t\t\tq.depth = mx;\n\t\t\tsz++;\n\t\t\tf(mx);\n\t\t\tsz--;\n\t\t\tq.depth = t;\n\t\t\tq.o[i] = -1;\n\t\t}\n\t}\n}\nint main(){\n\twhile(cin >> n && n){\n\t\tfor(int i = 0 ; i < n ; i++)\n\t\t\tfor(int j = 0 ; j < n ; j++)\n\t\t\t\tdist[i][j] = -1;\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\tfor(int j = 0 ; j < n ; j++){\n\t\t\t\tscanf(\"%d\",&dist[i][j]);\n\t\t\t\tdist[i][j] = dist[j][i] = max(dist[i][j],dist[j][i]);\n\t\t\t}\n\t\t}\n\t\tans = (1<<30);\n\t\tsz = 0;\n\t\tfor(int i = 0 ; i < 10 ; i++) q.o[i] = -1;\n\t\tf(0); \n\t\t\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 660,
"memory_kb": 0,
"score_of_the_acc": -0.6265,
"final_rank": 7
},
{
"submission_id": "aoj_1049_211145",
"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\nvector<bool> check;\n\nvoid dfs(vector<vector<int> >& a, vector<int> pos, int& ret)\n{\n int n = a.size();\n\n if(count(pos.begin(), pos.end(), -1) == n - 1){\n ret = min(ret, *(max_element(pos.begin(), pos.end())));\n return;\n }\n\n for(int i=0; i<n; ++i){\n if(pos[i] == -1)\n continue;\n\n vector<int> pos2 = pos;\n int maxPos = 0;\n for(int j=0; j<n; ++j){\n if(pos2[j] != -1){\n pos2[j] = max(pos2[j], pos2[i] + a[i][j]);\n maxPos = max(maxPos, pos2[j]);\n }\n }\n pos2[i] = -1;\n\n if(maxPos >= ret)\n continue;\n dfs(a, pos2, ret);\n }\n}\n\nint solve(vector<vector<int> >& a)\n{\n int n = a.size();\n vector<int> pos(n, 0);\n int ret = INT_MAX;\n dfs(a, pos, ret);\n return ret;\n}\n\nint main()\n{\n for(;;){\n int n;\n cin >> n;\n if(n == 0)\n return 0;\n\n vector<vector<int> > a(n, vector<int>(n, 0));\n for(int i=0; i<n; ++i){\n for(int j=0; j<n; ++j){\n int tmp;\n cin >> tmp;\n a[i][j] = a[j][i] = max(a[i][j], max(a[j][i], tmp));\n }\n }\n cout << solve(a) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 920,
"memory_kb": 908,
"score_of_the_acc": -1.2087,
"final_rank": 16
}
] |
aoj_1054_cpp
|
Problem D:
Distorted Love
Saying that it is not surprising that people want to know about their love, she has checked up his address, name, age, phone number, hometown, medical history, political party and even his sleeping position, every piece of his personal information. The word "privacy" is not in her dictionary. A person like her is called "stoker" or "
yandere
", but it doesn't mean much to her.
To know about him, she set up spyware to his PC. This spyware can record his mouse operations while he is browsing websites. After a while, she could successfully obtain the record from the spyware in absolute secrecy.
Well, we want you to write a program which extracts web pages he visited from the records.
All pages have the same size
H
×
W
where upper-left corner is (0, 0) and lower right corner is (
W
,
H
). A page includes several (or many) rectangular buttons (parallel to the page). Each button has a link to another page, and when a button is clicked the browser leads you to the corresponding page.
His browser manages history and the current page in the following way:
The browser has a buffer of 1-dimensional array with enough capacity to store pages, and a pointer to indicate a page in the buffer. A page indicated by the pointer is shown on the browser. At first, a predetermined page is stored and the pointer indicates that page. When the link button is clicked, all pages recorded in the right side from the pointer are removed from the buffer. Then, the page indicated by the link button is stored into the right-most position of the buffer, and the pointer moves to right. As a result, the user browse the page indicated by the button.
The browser also has special buttons 'back to the previous page' (back button) and 'forward to the next page' (forward button). When the user clicks the back button, the pointer moves to left, and the user clicks the forward button, the pointer moves to right. But in both cases, if there are no such pages in the buffer, nothing happen.
The record consists of the following operations:
click x y
It means to click (
x
,
y
). If there is a button on the point (
x
,
y
), he moved to the corresponding page. If there is nothing in the point, nothing happen. The button is clicked if
x
1 ≤
x
≤
x
2 and
y
1 ≤
y
≤
y
2 where
x
1,
x
2 means the leftmost and rightmost coordinate and
y
1,
y
2 means the topmost and bottommost coordinate of the corresponding button respectively.
back
It means to click the Back button.
forward
It means to click the Forward button.
In addition, there is a special operation
show
. Your program should print the name of current page for each
show
operation.
By the way, setting spyware into computers of others may conflict with the law. Do not attempt, or you will be reprimanded by great men.
Input
Input consists of several datasets.
Each dataset starts with an integer
n
which represents the number of pages in the dataset.
Next line contains two integers
W
and
H
.
Next, information of each page are give
...(truncated)
|
[
{
"submission_id": "aoj_1054_710257",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <cstring>\n#include <cstdlib>\n#include <cstdio>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <bitset>\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 all(v) (v).begin(), (v).end()\n#define rev(s) (s).rbegin(), (s).rend()\n#define MP make_pair\n#define X first\n#define Y second\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef vector<int> vi;\n\nvoid fin(){\n\tfreopen(\"test.txt\", \"r\", stdin);\n}\n\nstruct button{\n\tint left, top, right, bottom;\n\tstring link;\n\tbutton(int l, int t, int r, int b, string li){\n\t\tleft = l, top = t, right = r, bottom = b, link = li;\n\t}\n};\n\nint main(){\n\t//fin();\n\tint n;\n\twhile(cin >> n, n){\n\t\tint w, h;\n\t\tcin >> w >> h;\n\t\tmap<string, vector<button> > pages;\n\t\tstring current;\n\t\trep(i, n){\n\t\t\tstring s;\n\t\t\tint bn;\n\t\t\tcin >> s >> bn;\n\t\t\tif(!i) current = s;\n\t\t\trep(i, bn){\n\t\t\t\tint left, top, right, bottom;\n\t\t\t\tstring link;\n\t\t\t\tcin >> left >> top >> right >> bottom >> link;\n\t\t\t\tpages[s].push_back(button(left, top, right, bottom, link));\n\t\t\t}\n\t\t}\n\t\tstack<string> back;\n\t\tstack<string> forward;\n\t\tint m;\n\t\tcin >> m;\n\t\trep(i, m){\n\t\t\tstring com;\n\t\t\tcin >> com;\n\t\t\tif(com == \"click\"){\n\t\t\t\tint x, y;\n\t\t\t\tcin >> x >> y;\n\t\t\t\trep(i, pages[current].size()){\n\t\t\t\t\tbutton b = pages[current][i];\n\t\t\t\t\tif(x < b.left || x > b.right || y < b.top || y > b.bottom) continue;\n\t\t\t\t\tback.push(current);\n\t\t\t\t\tforward = stack<string>();\n\t\t\t\t\tcurrent = b.link;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(com == \"back\"){\n\t\t\t\tif(back.empty())continue;\n\t\t\t\tforward.push(current);\n\t\t\t\tcurrent = back.top();\n\t\t\t\tback.pop();\n\t\t\t}\n\t\t\telse if(com == \"forward\"){\n\t\t\t\tif(forward.empty())continue;\n\t\t\t\tback.push(current);\n\t\t\t\tcurrent = forward.top();\n\t\t\t\tforward.pop();\n\t\t\t}\n\t\t\telse if(com == \"show\"){\n\t\t\t\tcout << current << endl;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1276,
"score_of_the_acc": -0.0672,
"final_rank": 13
},
{
"submission_id": "aoj_1054_551713",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <map>\nusing namespace std;\n\nstruct Button {\n int x1, y1, x2, y2;\n string to;\n};\n\nstruct Page {\n vector<Button> bs;\n};\n\nint main() {\n int n;\n while (cin >> n, n) {\n int w, h;\n cin >> w >> h;\n map<string, Page> ps;\n vector<string> buf;\n for (int i = 0; i < n; i++) {\n string name;\n int b;\n cin >> name >> b;\n Page p;\n for (int j = 0; j < b; j++) {\n Button l;\n cin >> l.x1 >> l.y1 >> l.x2 >> l.y2 >> l.to;\n p.bs.push_back(l);\n }\n ps[name] = p;\n if (i == 0) {\n buf.push_back(name);\n }\n }\n int m;\n cin >> m;\n int idx = 0;\n for (int i = 0; i < m; i++) {\n string cmd;\n cin >> cmd;\n if (cmd == \"click\") {\n int x, y;\n cin >> x >> y;\n Page p = ps[buf[idx]];\n for (vector<Button>::iterator it = p.bs.begin(); it != p.bs.end(); it++) {\n if (it->x1 <= x && x <= it->x2 && it->y1 <= y && y <= it->y2) {\n buf.erase(buf.begin() + idx + 1, buf.end());\n buf.push_back(it->to);\n idx++;\n break;\n }\n }\n } else if (cmd == \"back\") {\n if (idx > 0) {\n idx--;\n }\n } else if (cmd == \"forward\") {\n if (idx < (int) buf.size() - 1) {\n idx++;\n }\n } else if (cmd == \"show\") {\n cout << buf[idx] << endl;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1256,
"score_of_the_acc": -0.143,
"final_rank": 15
},
{
"submission_id": "aoj_1054_516027",
"code_snippet": "#include<iostream>\n#include<string>\n#include<map>\n#include<vector>\n#include<algorithm>\n\nusing namespace std;\n\nstruct POINT{\n int x1, y1;\n int x2, y2;\n};\n\nmultimap<string, POINT> MakeButton(int);\nvoid Click(map< string, multimap<string, POINT> >,\n\t vector<string>&, int&, int, int);\n\nint main(){\n int i, n, m, w, h, now;\n string str;\n vector<string> logdata;\n map< string, multimap<string, POINT> > webpage;\n\n while(1){\n cin >> n;\n if(n == 0) break;\n cin >> w >> h;\n\n for(i=0; i<n; ++i){\n cin >> str >> m;\n if(i == 0) logdata.push_back(str);\n webpage.insert(make_pair(str, MakeButton(m)));\n }\n\n cin >> m;\n for(i=0, now=0; i<m; ++i){\n cin >> str;\n if(str == \"click\") Click(webpage, logdata, now, w, h);\n else if(str == \"back\" && now > 0) --now;\n else if(str == \"forward\" && now < logdata.size()-1) ++now;\n else if(str == \"show\") cout << logdata[now] << endl;\n }\n\n logdata.clear();\n webpage.clear();\n }\n return 0;\n}\n\nmultimap<string, POINT> MakeButton(int n){\n int i, x1, y1, x2, y2;\n string str;\n POINT p;\n multimap<string, POINT> button;\n\n for(i=0; i<n; ++i){\n cin >> p.x1 >> p.y1 >> p.x2 >> p.y2 >> str;\n button.insert(make_pair(str, p));\n }\n return button;\n}\n\nvoid Click(map< string, multimap<string, POINT> > webpage,\n\t vector<string>& logdata, int& now, int w, int h){\n int x, y;\n cin >> x >> y;\n if(x < 0 || w < x || y < 0 || h < y) return;\n\n POINT p;\n multimap<string, POINT> button;\n multimap<string, POINT>::iterator i;\n map< string, multimap<string, POINT> >::iterator j;\n\n j = webpage.find(logdata[now]);\n if(j == webpage.end()) return;\n button = j->second;\n\n for(i=button.begin(); i!=button.end(); ++i){\n p = i->second;\n if(p.x1 <= x && x <= p.x2 && p.y1 <= y && y <= p.y2){\n ++now;\n logdata.erase(logdata.begin()+now, logdata.end());\n logdata.push_back(i->first);\n return;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1276,
"score_of_the_acc": -0.0672,
"final_rank": 13
},
{
"submission_id": "aoj_1054_462742",
"code_snippet": "#include<cmath>\n#include<algorithm>\n#include<iostream>\n#include<vector>\n#include<climits>\n#include<cfloat>\n\nusing namespace std;\n\nstruct point{\n double x, y;\n};\n\nstruct button{\n point ld,ru;\n string name;\n};\n\nstruct page{\n string name;\n vector<button>btn; \n}; \n\nint main(void){\n int n;\n int w,h,b;\n point l,r;\n page in;\n vector<page> a;\n button tmp;\n\n while(cin >> n,n){\n \n a.clear();\n\n cin >> w >> h;\n \n for(int j=0;j<n;j++){\n in.btn.clear();\n cin >> in.name >> b; \n \n for(int i=0;i<b;i++){\n\tcin >> tmp.ld.x >> tmp.ld.y >> tmp.ru.x >> tmp.ru.y >> tmp.name;\n\tin.btn.push_back(tmp);\n }\n a.push_back(in);\n }\n\n int m,now=0,fg=0;\n static page buf[1000000];\n\n cin >> m;\n buf[0]=a[0];\n\n for(int k=0;k<m;k++){\n string s;\n cin >> s;\n \n if(s==\"click\"){\n\tint c,d;\n\tcin >> c >> d;\n\t\n\tfor(int i=0;i<buf[now].btn.size();i++){\n\t int fg2=0;\n\t if(buf[now].btn[i].ld.x <=c &&\n\t buf[now].btn[i].ld.y <=d &&\n\t buf[now].btn[i].ru.x >=c &&\n\t buf[now].btn[i].ru.y >=d){\n\t for(int j=0;j<a.size();j++){\n\t if(buf[now].btn[i].name==a[j].name){\n\t\tbuf[++now]=a[j];\n\t\tfg=0;\n\t\tfg2=1;\n\t\tbreak;\n\t }\n\t }\n\t if(fg2)break;\n\t }\n\t}\n }\n else if(s==\"back\" && now>0){\n\tnow--;\n\tfg++;\n }\n else if(s==\"forward\" && fg>0 && now < 1000000)now++,fg--;\n else if(s==\"show\")cout << buf[now].name << endl;\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 19000,
"score_of_the_acc": -1.0385,
"final_rank": 18
},
{
"submission_id": "aoj_1054_462733",
"code_snippet": "#include<cmath>\n#include<algorithm>\n#include<iostream>\n#include<vector>\n#include<climits>\n#include<cfloat>\n\nusing namespace std;\n\nstruct point{\n int x, y;\n};\n\nstruct button{\n point l,r;\n string name;\n};\n\nstruct page{\n string name;\n vector<button>btn; \n}; \n\nint m,now;\nvector<page> a;\npage nowpage;\nstring buf[10001];\n\nvoid func(void){\n for(int i=0;i<a.size();i++){\n if(buf[now]==a[i].name){\n nowpage=a[i];\n return ;\n }\n }\n}\n\nvoid click(int c,int d){\n \n for(int i=0;i<nowpage.btn.size();i++){\n if(nowpage.btn[i].l.x <=c && c<=nowpage.btn[i].r.x &&\n nowpage.btn[i].l.y <=d && d<=nowpage.btn[i].r.y ){\n fill(buf+now+1,buf+10001,\"\");\n buf[++now]=nowpage.btn[i].name;\n return ;\n }\n }\n}\n\n\nint main(void){\n int n;\n int w,h,b;\n page in;\n button tmp;\n\n while(cin >> n,n){\n \n a.clear();\n fill(buf,buf+10001,\"\");\n\n cin >> w >> h;\n \n for(int i=0;i<n;i++){\n in.btn.clear();\n cin >> in.name >> b; \n if(i==0)buf[0]=in.name;\n\n for(int j=0;j<b;j++){\n\tcin >> tmp.l.x >> tmp.l.y >> tmp.r.x >> tmp.r.y >> tmp.name;\n\tin.btn.push_back(tmp);\n }\n a.push_back(in);\n }\n\n now=0;\n\n cin >> m;\n\n while(m--){\n string s;\n cin >> s;\n\n func();\n\n if(s==\"click\"){\n\tint c,d;\n\tcin >> c >> d;\n\tclick(c,d);\n }\n else if(s==\"back\" && now>0)now--;\n else if(s==\"forward\" && buf[now+1]!=\"\")now++;\n else if(s==\"show\")cout << buf[now] << endl;\n\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 992,
"score_of_the_acc": -0.9368,
"final_rank": 17
},
{
"submission_id": "aoj_1054_462313",
"code_snippet": "#include<iostream>\n#include<map>\n#include<vector>\n#include<algorithm>\n\nusing namespace std;\n\nconst int MAX = 10001;\n\nstring data[MAX];\nint W,H,N;\n\nstruct Button{\n int lx,rx,ly,ry;\n string name;\n};\n\nmap<string,vector<Button> > M;\n\n\nvoid init(){\n M.clear();\n fill(data,data+MAX,\"\");\n}\n\nvoid input(){\n cin >> W >> H;\n for(int i = 0; i < N; i++){\n string s;\n int num;\n cin >> s >> num;\n if(i == 0) data[0] = s;\n\n for(int j = 0; j < num; j++){\n Button B;\n cin >> B.lx >> B.ly >> B.rx >> B.ry >> B.name;\n M[s].push_back(B);\t\n }\n\n }\n}\n\nvoid solve(){\n int num;\n cin >> num;\n int index = 0;\n\n\n while(num--){\n string op;\n cin >> op;\n if(op == \"click\"){\n int x,y;\n cin >> x >> y;\n string now = data[index];\n\n for(int i = 0; i < M[now].size(); i++){\n\tif(M[now][i].lx <= x && x <= M[now][i].rx && M[now][i].ly <= y && y <= M[now][i].ry){\n\t data[++index] = M[now][i].name;\n\t fill(data+index+1,data+MAX,\"\");\n\t break;\n\t}\n\n }\n\n }else if(op == \"back\" && index > 0) index--;\n else if(op == \"forward\" && data[index+1] != \"\") index++;\n else if(op == \"show\") cout << data[index] << endl;\n }\n}\n\nint main(){\n\n while(cin >> N && N){\n input();\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 270,
"memory_kb": 984,
"score_of_the_acc": -1.0518,
"final_rank": 19
},
{
"submission_id": "aoj_1054_427721",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 100000000\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n\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\nconst int tx[] = {0,1,0,-1};\nconst int ty[] = {-1,0,1,0};\n\nclass Button{\npublic:\n\tint lu_x,lu_y,rl_x,rl_y;\n\tstring name;\n\tButton() : lu_x(0),lu_y(0),rl_x(0),rl_y(0),name(\"\"){}\n\tButton(int lu_x,int lu_y,int rl_x,int rl_y,string name): lu_x(lu_x),lu_y(lu_y),rl_x(rl_x),rl_y(rl_y),name(name){}\n};\n\nint main(){\n\tint n;\n\tint W,H;\n\t\n\twhile(~scanf(\"%d\",&n)){\n\t\tif(n==0) break;\n\t\tmap<string,vector<Button> > page;\n\t\tvector<string> browsed;\n\t\tscanf(\"%d %d\",&W,&H);\n\t\tfor(int i=0;i<n;i++){\n\t\t\tstring name;\n\t\t\tint num;\n\t\t\tcin >> name >> num;\n\t\t\tfor(int j=0;j<num;j++){\n\t\t\t\tstring next;\n\t\t\t\tint lu_x,lu_y,rl_x,rl_y;\n\t\t\t\tcin >> lu_x >> lu_y >> rl_x >> rl_y >> next;\n\t\t\t\tpage[name].push_back(Button(lu_x,lu_y,rl_x,rl_y,next));\n\t\t\t\tif(browsed.size()==0) browsed.push_back(name);\n\t\t\t}\n\t\t}\n\n\t\tint m;\n\t\tint pos = 0;\n\t\tscanf(\"%d\",&m);\n\t\tfor(int i=0;i<m;i++){\n\t\t\tstring act;\n\t\t\tcin >> act;\n\t\t\tif(act==\"click\"){\n\t\t\t\tint x,y;\n\t\t\t\tcin >> x >> y;\n\t\t\t\tstring now = browsed[pos];\n\t\t\t\tfor(int j=0;j<page[now].size();j++){\n\t\t\t\t\tif((page[now][j].lu_x <= x && x <= page[now][j].rl_x)\n\t\t\t\t\t\t&& (page[now][j].lu_y <= y && y <= page[now][j].rl_y)){\n\t\t\t\t\t\t\t//printf(\"to %s\\n\",page[now][j].name.c_str());\n\n\t\t\t\t\t\t\tbrowsed.erase(browsed.begin()+pos+1,browsed.end());\n\t\t\t\t\t\t\tbrowsed.push_back(page[now][j].name);\n\t\t\t\t\t\t\tpos++;\n\t\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 if(act==\"back\"){\n\n\t\t\t\tif(pos>0){\n\t\t\t\t\tpos--;\n\t\t\t\t\t//printf(\"back\\n\");\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(act==\"forward\"){\n\t\t\t\tif(pos<browsed.size()-1){\n\t\t\t\t\tpos++;\n\t\t\t\t\t//printf(\"forwardk\\n\");\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(act==\"show\"){\n\t\t\t\tcout << browsed[pos] << \"\\n\";\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1054_390818",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\" \"; cout<<endl; }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\nstruct Page{\n string name;\n vector<int> bx;\n vector<int> by;\n vector<int> ex;\n vector<int> ey;\n vector<string> to;\n Page(string n){\n name = n;\n }\n void add(int x1, int y1, int x2, int y2, string s){\n bx.push_back(x1);\n by.push_back(y1);\n ex.push_back(x2);\n ey.push_back(y2);\n to.push_back(s);\n }\n string link(int x, int y){\n REP(i,bx.size()){\n if(bx[i] <= x && x <= ex[i] && by[i] <= y && y <= ey[i]){\n return to[i];\n }\n }\n return \"\";\n }\n};\n\n\nint main(){\n int N;\n while(cin>>N, N){\n int W,H; cin>>W>>H;\n vector<Page> pages;\n map<string, int> id;\n REP(i,N){\n string s; int n;\n cin>>s>>n;\n id[s] = i;\n Page p(s);\n while(n--){\n int a,b,c,d; string nm;\n cin>>a>>b>>c>>d>>nm;\n p.add(a,b,c,d,nm);\n }\n pages.push_back(p);\n }\n int O; cin>>O;\n vector<Page> bf;\n bf.push_back(pages[0]);\n int p = 0;\n while(O--){\n string ope; cin>>ope;\n int x,y;\n if(ope == \"show\"){\n cout<<bf[p].name<<endl;\n }\n if(ope == \"forward\"){\n if(p + 1 < bf.size()) p += 1;\n }\n if(ope == \"back\"){\n if(p - 1 >= 0) p -= 1;\n }\n if(ope == \"click\"){\n cin>>x>>y;\n string linkname = bf[p].link(x,y);\n int toidx = -1;\n if(id.count(linkname)) toidx = id[linkname];\n if(toidx != -1) {\n Page nextpage = pages[toidx];\n bf.erase(bf.begin() + p + 1, bf.end());\n bf.push_back(nextpage);\n p++;\n }\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1054_374681",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <map>\nusing namespace std;\n\ntypedef struct\n{\n string name;\n int x1, x2, y1, y2;\n} Button;\n\nint main()\n{\n int n;\n while (cin >> n) {\n if (n == 0)\n break;\n\n int W, H;\n cin >> W >> H;\n\n vector<string > buf;\n map<string, vector<Button> > button;\n for (int i = 0; i < n; ++i) {\n string name;\n int b;\n cin >> name >> b;\n for (int j = 0; j < b; ++j) {\n\tButton tmp;\n\tcin >> tmp.x1 >> tmp.y1 >> tmp.x2 >> tmp.y2 >> tmp.name;\n\tbutton[name].push_back(tmp);\n }\n\n if (i == 0)\n\tbuf.push_back(name);\n }\n\n int m, p = 0;\n cin >> m;\n while (m--) {\n string cmd;\n cin >> cmd;\n\n if (cmd == \"click\") {\n\tint x, y;\n\tcin >> x >> y;\n\tconst vector<Button>& link = button[buf[p]];\n\tfor (int i = 0; i < link.size(); ++i) {\n\t if (link[i].x1 <= x && x <= link[i].x2 &&\n\t link[i].y1 <= y && y <= link[i].y2) {\n\t buf.erase(buf.begin()+p+1, buf.end());\n\t buf.push_back(link[i].name);\n\t ++p;\n\t break;\n\t }\n\t}\n } else if (cmd == \"show\") {\n\tcout << buf[p] << endl;\n } else if (cmd == \"back\") {\n\tif (p != 0)\n\t --p;\n } else {\n\tif (p+1 < buf.size())\n\t ++p;\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1054_326305",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <ctime>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <numeric>\n#include <list>\n\nusing namespace std;\n\n#ifdef _MSC_VER\n#define __typeof__ decltype\ntemplate <class T> int __builtin_popcount(T n) { return n ? 1 + __builtin_popcount(n & (n - 1)) : 0; }\n#endif\n\n#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)\n#define all(c) (c).begin(), (c).end()\n#define rall(c) (c).rbegin(), (c).rend()\n#define popcount __builtin_popcount\n\n#define rep(i, n) for (int i = 0; i < n; ++i)\n\ntemplate <class T> void max_swap(T& a, const T& b) { a = max(a, b); }\ntemplate <class T> void min_swap(T& a, const T& b) { a = min(a, b); }\n\ntypedef long long ll;\ntypedef pair<int, int> pint;\n\n\nstruct Button\n{\n\tint x1, y1, x2, y2;\n\tstring name;\n\tbool include(int x, int y)\n\t{\n\t\treturn x1 <= x && x <= x2\n\t\t\t&& y1 <= y && y <= y2;\n\t}\n\tvoid input()\n\t{\n\t\tcin >> x1 >> y1 >> x2 >> y2 >> name;\n\t}\n};\nint main()\n{\n\tint n, m, w, h;\n\twhile (cin >> n, n)\n\t{\n\t\tcin >> w >> h;\n\n\t\tmap<string, vector<Button> > page;\n\t\tvector<string> buffer;\n\t\trep (i, n)\n\t\t{\n\t\t\tstring name;\n\t\t\tint b;\n\t\t\tcin >> name >> b;\n\t\t\tif (i == 0)\n\t\t\t\tbuffer.push_back(name);\n\n\t\t\twhile (b--)\n\t\t\t{\n\t\t\t\tpage[name].push_back(Button());\n\t\t\t\tpage[name].back().input();\n\t\t\t}\n\t\t}\n\n\t\tcin >> m;\n\t\tint pointer = 0;\n\t\twhile (m--)\n\t\t{\n\t\t\tstring& b = buffer[pointer];\n\n\t\t\tstring c;\n\t\t\tcin >> c;\n\t\t\tif (c[0] == 'c')\n\t\t\t{\n\t\t\t\tint x, y;\n\t\t\t\tcin >> x >> y;\n\t\t\t\tfor (int i = 0; i < page[b].size(); ++i)\n\t\t\t\t{\n\t\t\t\t\tif (page[b][i].include(x, y))\n\t\t\t\t\t{\n\t\t\t\t\t\t++pointer;\n\t\t\t\t\t\tbuffer.erase(buffer.begin() + pointer, buffer.end());\n\t\t\t\t\t\tbuffer.push_back(page[b][i].name);\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 if (c[0] == 'b')\n\t\t\t\tpointer = max(0, --pointer);\n\t\t\telse if (c[0] == 'f')\n\t\t\t\tpointer = min((int)buffer.size() - 1, ++pointer);\n\t\t\telse if (c[0] == 's')\n\t\t\t\tcout << b << endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1054_247792",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <string>\n\nusing namespace std;\n\nstruct button{\n\tstring toName;\n\tint minx;\n\tint maxx;\n\tint miny;\n\tint maxy;\n};\n\nint page;\nvector<string> history;\nint n;\nint h,w;\nmap<string,vector<button> > pageInfo;\n\nint main(){\n\n\twhile(cin>>n&&n!=0){\n\t\thistory.clear();\n\t\tpageInfo.clear();\n\t\tpage=0;\n\t\thistory.clear();\n\t\tcin>>w>>h;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tstring str;\n\t\t\tint bn;\n\t\t\tcin>>str>>bn;\n\t\t\tif(i==0){\n\t\t\t\thistory.push_back(str);\n\t\t\t}\n\t\t\tvector<button> vb;\n\t\t\tfor(int j = 0; j < bn; j++){\n\t\t\t\tbutton b;\n\t\t\t\tcin>>b.minx>>b.miny>>b.maxx>>b.maxy>>b.toName;\n\t\t\t\tvb.push_back(b);\n\t\t\t}\n\t\t\tpageInfo[str]=vb;\n\t\t}\n\t\tint m;\n\t\tcin>>m;\n\t\t// operation start\n\t\tfor(int i = 0; i < m; i++){\n\t\t\tstring op;\n\t\t\tcin>>op;\n\t\t\tif(op==\"click\"){\n\t\t\t\tint x,y;\n\t\t\t\tcin>>x>>y;\n\t\t\t\t// buttonÌÊuðcheck\n\t\t\t\tfor(int j = 0; j < pageInfo[history[page]].size(); j++){\n\t\t\t\t\t// ڮūéÌÈçÎA»ÝÌêÌ¨É éhistoryðíµA»ÝÌę̂ÉÚ®æy[WðÇÁµApageðCNg\n\t\t\t\t\tbutton &b = pageInfo[history[page]][j];\n\t\t\t\t\tif(b.minx<=x&&b.maxx>=x&&b.miny<=y&&b.maxy>=y){\n\t\t\t\t\t\t// »ÝÌêÌEÉ éhistoryðí\n\t\t\t\t\t\tint t=history.size();\n\t\t\t\t\t\tfor(int k = page+1; k < t; k++){\n\t\t\t\t\t\t\thistory.erase(history.begin()+history.size()-1);\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// »ÝÌêÌEÉÚ®æy[WðÇÁ\n\t\t\t\t\t\thistory.push_back(b.toName);\n\t\t\t\t\t\tpage++;\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 if(op==\"show\"){\n\t\t\t\tcout<<history[page]<<endl;\n\t\t\t}\n\t\t\telse if(op==\"back\"){\n\t\t\t\tpage=max(0,page-1);\n\t\t\t}\n\t\t\telse if(op==\"forward\"){\n\t\t\t\tpage=min((int)history.size()-1,page+1);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1054_215828",
"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 <map>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\nconst int INF = 1<<29;\n\nstruct P {\n int x1,y1,x2,y2;\n string s;\n P(int x1,int y1,int x2,int y2, string s) : x1(x1),y1(y1),x2(x2),y2(y2),s(s) {}\n};\n\nint main() {\n int n;\n while(cin>>n,n) {\n int w,h;\n cin >> w>>h;\n string title[n];\n vector<P> button[n];;\n map<string, int> rid;\n REP(i,n) {\n cin >> title[i];\n rid[title[i]] = i;\n int m;\n cin >> m;\n REP(j,m) {\n int ax,ay,bx,by;\n cin>>ax>>ay>>bx>>by;\n string s;\n cin >> s;\n button[i].push_back(P(ax,ay,bx,by,s));\n }\n }\n int m;\n cin >> m;\n int now = 0;\n int page[100000] = {};\n int maxpage = 0;\n while(m--) {\n string s;\n cin >> s;\n if (s == \"click\") {\n int x, y;\n cin >> x >> y;\n FOR(it, button[page[now]]) {\n if (it->x1<=x && x<=it->x2 && it->y1<=y && y<=it->y2) {\n page[++now] = rid[it->s];\n maxpage = now;\n break;\n }\n }\n } else if (s == \"show\"){\n cout << title[page[now]] << endl;\n } else if (s == \"back\") {\n if (now>0)\n now--;\n } else if (s == \"forward\") {\n if (now<maxpage)\n now++;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1054_215798",
"code_snippet": "#include <iostream>\n#include <fstream>\n#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <complex>\n#include <cstdio>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n\nint n,W,H,a[100001],c,po,m;\nstruct page{\n\tint b,x1[100],y1[100],x2[100],y2[100];\n\tstring name,link[100];\n};\n\nint main(){\n\twhile(cin>>n&&n){\n\t\tfill(a,a+100001,-1);\n\t\ta[0]=0;c=0;po=0;\n\t\tcin>>W>>H;\n\t\tpage p[100];\n\t\trep(i,n){\n\t\t\tcin>>p[i].name>>p[i].b;\n\t\t\trep(j,p[i].b)cin>>p[i].x1[j]>>p[i].y1[j]>>p[i].x2[j]>>p[i].y2[j]>>p[i].link[j];\n\t\t}\n\t\tcin>>m;\n\t\trep(i,m){\n\t\t\tstring s;\n\t\t\tcin>>s;\n\t\t\tif(s==\"click\"){\n\t\t\t\tint x,y;\n\t\t\t\tcin>>x>>y;\n\t\t\t\trep(j,p[c].b)if(p[c].x1[j]<=x&&x<=p[c].x2[j]&&p[c].y1[j]<=y&&y<=p[c].y2[j]){\n\t\t\t\t\tstring st=p[c].link[j];\n\t\t\t\t\trep(k,n)if(st==p[k].name)c=(a[++po]=k);\n\t\t\t\t\tfill(a+po+1,a+100001,-1);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(s==\"back\"&&po)c=a[--po];\n\t\t\tif(s==\"forward\"&&a[po+1]!=-1)c=a[++po];\n\t\t\tif(s==\"show\")cout<<p[c].name<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1504,
"score_of_the_acc": -0.233,
"final_rank": 16
},
{
"submission_id": "aoj_1054_214737",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <algorithm>\t// require sort next_permutation count etc.\n#include <cstdlib>\t// require abs\n#include <cstdio>\t// require printf\n#include <functional>\n#include <numeric>\t// require accumulate\n#include <cmath>\n#include <climits>\n#include <limits>\n#include <cfloat>\n#include <iomanip>\t// require setw\n#include <sstream>\t// require stringstream \n#include <cstring>\t// require memset\n#include <cctype>\t// require tolower, toupper\n#include <fstream>\t// require freopen\n\nusing namespace std;\n\ntypedef pair<int, int> P;\n\nstruct BUTTON{\n\tP start, end;\n\tstring link_name;\n};\t\n\nstruct PAGE{\n\tstring name;\n\tint link_num;\n\tvector <BUTTON> link;\n};\t\t\n\t\n\nint main()\n{\n\tconst string action[] = { \"click\", \"show\", \"back\", \"forward\" };\n//\tcut here before submit \n//\tfreopen (\"testcase.distortedlove\", \"r\", stdin );\n\tint n;\n\n\twhile (cin >> n && n ){\n\t\tint W, H;\n\t\tcin >> W >> H;\n\t\tvector<PAGE> page(n);\n\n\t\tfor (int i = 0; i < n; ++i ){\n\t\t\tint num = 0;\n\t\t\tcin >> page[i].name >> num;\n\t\t\tpage[i].link_num = num;\n\t\t\tpage[i].link.resize(num );\n\t\t\tfor (int j = 0; j < num; ++j ){\n\t\t\t\tcin >> page[i].link[j].start.first;\n\t\t\t\tcin >> page[i].link[j].start.second;\n\t\t\t\tcin >> page[i].link[j].end.first;\n\t\t\t\tcin >> page[i].link[j].end.second;\n\t\t\t\tcin >> page[i].link[j].link_name;\n\t\t\t} // end for\n\t\t} // end for\n\n\t\tvector <int> buffer (10500, -1 );\n\t\tint curr_page = 0;\t// ツ個サツ催敖づ個ペツーツジ\n\t\tint pointer = 0;\n\t\tbuffer[pointer] = curr_page;\n\t\tint m;\n\t\tcin >> m;\n\n\t\tfor (int i = 0; i < m; ++i ){\n\t\t\tstring com = \"\";\n\t\t\tcin >> com;\n\t\t\tint cw, ch;\n\t\t\tif (com == action[0] ){\t// \"click\"\n\t\t\t\tcin >> cw >> ch;\n\t\t\t\tint curr = buffer[pointer];\n\t\t\t\tstring next_page = \"\";\t\n\t\t\t\tfor (int j = 0; j < page[curr].link_num; ++j ){\n\t\t\t\t\tif ( page[curr].link[j].start.first <= cw \n\t\t\t\t\t&& cw <= page[curr].link[j].end.first\n\t\t\t\t\t&& page[curr].link[j].start.second <= ch \n\t\t\t\t\t&& ch <= page[curr].link[j].end.second ){\n\t\t\t\t\t\tnext_page = page[curr].link[j].link_name;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} // end if\n\t\t\t\t} // end for\n\t\t\t\tif (!next_page.empty() ){\n\t\t\t\t\tfor (int j = pointer + 1; j < buffer.size(); ++j ){\n\t\t\t\t\t\tbuffer[j] = -1;\n\t\t\t\t\t} // end for\n\t\t\t\t\tfor (int j = 0; j < n; ++j ){\n\t\t\t\t\t\tif (next_page == page[j].name ){\n\t\t\t\t\t\t\t++pointer;\n\t\t\t\t\t\t\tbuffer[pointer] = j;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t} // end fi\n\t\t\t\t\t} // end for\n\t\t\t\t} // end if\n\t\t\t}else\n\t\t\tif (com == action[1] ){\t// \"show\"\n\t\t\t\tcout << page[buffer[pointer]].name << endl;\n\t\t\t}else\n\t\t\tif (com == action[2] ){\t// \"back\"\n\t\t\t\tif (pointer > 0 ){\n\t\t\t\t\t--pointer;\n\t\t\t\t} // end if\n\t\t\t}else{\t\t\t\t// \"forward\"\n\t\t\t\tif (buffer[pointer+1] != -1 ){\n\t\t\t\t\t++pointer;\n\t\t\t\t} // end if\n\t\t\t} // end if\n\t\t} // end for\n\t} // end loop\n\t\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1054_189778",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\nusing namespace std;\nstruct S{int x1,x2,y1,y2;string s;}_;\nint main()\n{\n\tint n,m,b,h,w,i,j,x,y;\n\tstring s;\n\twhile(cin>>n>>w>>h)\n\t{\n\t\tmap<string,vector<S> >M;\n\t\tvector<string> V;\n\t\tvector<string>::iterator ite;\n\t\tfor(i=0;i<n;++i)\n\t\t{\n\t\t\tcin>>s>>b;\n\t\t\tif(!i)V.push_back(s);\n\t\t\tfor(j=0;j<b;++j)cin>>_.x1>>_.y1>>_.x2>>_.y2>>_.s, M[s].push_back(_);\n\t\t}\n\t\tcin>>m;\n\t\tite=V.begin();\n\t\tfor(i=0;i<m;++i)\n\t\t{\n\t\t\tcin>>s;\n\t\t\tif(s==\"click\")\n\t\t\t{\n\t\t\t\tcin>>x>>y;for(j=0;j<M[*ite].size();++j)\n\t\t\t\t{\n\t\t\t\t\t_=M[*ite][j];\n\t\t\t\t\tif(x>=_.x1&&x<=_.x2&&y>=_.y1&&y<=_.y2)\n\t\t\t\t\t{\tV.erase(ite+1,V.end());\n\t\t\t\t\t\tV.push_back(_.s);\n\t\t\t\t\t\tite=V.end()-1;\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(s==\"back\") if(ite!=V.begin())--ite;\n\t\t\tif(s==\"forward\") if(ite!=V.end()-1)++ite;\n\t\t\tif(s==\"show\") cout<<*ite<<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_1054_143795",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstring>\nusing namespace std;\nstatic const double EPS = 1e-5;\ntypedef long long ll;\n\ntypedef struct _button{\n\tint xl,yu,xr,yl;\n\tstring name;\n}button;\n\n\nmap<string, vector<button> > page;\nvector<string> rireki;\n\n\nmain(){\n\tint n;\n\twhile(cin>>n){\n\t\tif(n==0)break;\n\t\t\n\t\tpage.clear();\n\t\trireki.clear();\n\t\t\n\t\tint W,H;\n\t\tcin>>W>>H;\n\t\t\n\t\tfor(int i=0;i<n;i++){\n\t\t\tstring name;\n\t\t\tint b;\n\t\t\tcin>>name>>b;\n\t\t\tif(i==0)rireki.push_back(name);\n\t\t\tfor(int j=0;j<b;j++){\n\t\t\t\tint xl,xr,yu,yl;\n\t\t\t\tstring tname;\n\t\t\t\tcin>>xl>>yu>>xr>>yl>>tname;\n\t\t\t\tbutton tbutton={xl,yu,xr,yl,tname};\n\t\t\t\t\n\t\t\t\tpage[name].push_back(tbutton);\n\t\t\t}\n\t\t}\n\t\t\n\t\tint m;\n\t\tcin>>m;\n\t\tint p=0;\n\t\t\n\t\tfor(int i=0;i<m;i++){\n\t\t\tstring com;\n\t\t\tcin>>com;\n\t\t\tif(com==\"click\"){\n\t\t\t\t\n\t\t\t\tint x,y;\n\t\t\t\tcin>>x>>y;\n\t\t\t\t\n\t\t\t\tstring target=\"\";\n\t\t\t\t\n\t\t\t\tfor(vector<button>::iterator vp=page[rireki[p]].begin();vp!=page[rireki[p]].end();++vp){\n\t\t\t\t\tif(vp->xr>=x && vp->xl<=x && vp->yu<=y && vp->yl>=y)target=vp->name;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(target==\"\")continue;\n\t\t\t\t\n\t\t\t\tif(p==rireki.size()-1){\n\t\t\t\t\trireki.push_back(target);\n\t\t\t\t\t++p;\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t}else{\n\t\t\t\t\t++p;\n\t\t\t\t\trireki[p]=target;\n\t\t\t\t\twhile(p+1<rireki.size())rireki.pop_back();\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\n\t\t\t}else if(com==\"show\"){\n\t\t\t\tcout<<rireki[p]<<endl;\n\t\t\t}else if(com==\"back\"){\n\t\t\t\tif(p)--p;\n\t\t\t}else if(com==\"forward\"){\n\t\t\t\tif(p<rireki.size()-1)++p;\n\t\t\t}\n\t\t}\n\t\t\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1054_142494",
"code_snippet": "#include<map>\n#include<deque>\n#include<string>\n#include<vector>\n#include<iostream>\n\n#define\tpb\tpush_back\n\nusing namespace std;\n\nstruct Rect{\n\tint l,r,u,b;\n\tbool isInside(int x,int y){\n\t\treturn (l<=x && x<=r && u<=y && y<=b);\n\t}\n};\n\nstruct Button:Rect{\n\tstring link;\n};\n\nstruct Page{\n\tstring title;\n\tint bnum;\n\tvector<Button> btn;\n};\n\nint main(){\n\tfor(int n;cin>>n,n;){\n\t\tint w,h;\tcin>>w>>h;\n\t\tPage pg[100];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>pg[i].title>>pg[i].bnum;\n\t\t\tpg[i].btn=vector<Button>(pg[i].bnum);\n\t\t\tfor(int j=0;j<pg[i].bnum;j++){\n\t\t\t\tcin>>pg[i].btn[j].l>>pg[i].btn[j].u\n\t\t\t\t >>pg[i].btn[j].r>>pg[i].btn[j].b>>pg[i].btn[j].link;\n\t\t\t}\n\t\t}\n\n\t\tmap<string,int> f;\n\t\tfor(int i=0;i<n;i++)\tf[pg[i].title]=i;\n\n\t\tint m;\tcin>>m;\n\t\tdeque<Page> dq;\tdq.pb(pg[0]);\n\t\tint ptr=0;\n\t\twhile(m--){\n\t\t\tstring cmd;\tcin>>cmd;\n\t\t\tif(cmd==\"click\"){\n\t\t\t\tint x,y;\tcin>>x>>y;\n\t\t\t\tint on=-1;\n\t\t\t\tfor(int i=0;i<dq[ptr].bnum;i++){\n\t\t\t\t\tif(dq[ptr].btn[i].isInside(x,y)){\n\t\t\t\t\t\ton=f[dq[ptr].btn[i].link];\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(~on){\n\t\t\t\t\tdq.erase(dq.begin()+ptr+1,dq.end());\n\t\t\t\t\tdq.pb(pg[on]);\n\t\t\t\t\tptr++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(cmd==\"back\"){\n\t\t\t\tif(ptr>0)\tptr--;\n\t\t\t}\n\t\t\telse if(cmd==\"forward\"){\n\t\t\t\tif(ptr<dq.size()-1)\tptr++;\n\t\t\t}\n\t\t\telse\tcout<<dq[ptr].title<<endl;\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1054_136308",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\n\nstruct B{int x1,y1,x2,y2;string name;};\nint W,H,n;\n\nstruct SITE{\n\tstring myname;\n\tvector<B> co;\n};\n\nint pos;\nmap<string,int> to;\nvector<SITE>info;\n\nvector< vector<SITE>::iterator > lst;\nvector<SITE>::iterator cur;\n\n\nvector<SITE>::iterator find(string name){\n\tint lp = to[name];\n\tvector<SITE>::iterator it = info.begin();\n\trep(i,lp){++it;}\n\treturn it;\n}\n\nvoid move(string name){\n\tvector< vector<SITE>::iterator > newList;\n\trep(i,pos+1){\n\t\tnewList.push_back(lst[i]);\n\t}\n\tlst = newList;\n\n\tlst.push_back(find(name));\n\tcur = lst.back();\n\tpos = lst.size()-1;\n}\n\nmain(){\n\n\twhile(cin >> n , n ){\n\t\tto.clear();\n\t\tinfo.clear(),info.resize(n);\n\t\tcin >> W >> H;\n\t\trep(i,n){\n\t\t\tstring s;int d;\n\t\t\tcin >> s >> d;\n\t\t\tto[s] = i;\n\t\t\t\n\t\t\tinfo[i].myname = s;\n\t\t\t\n\t\t\trep(j,d){\n\t\t\t\tB t;\n\t\t\t\tcin >> t.x1 >> t.y1 >> t.x2 >> t.y2 >> t.name;\t\n\t\t\t\tinfo[i].co.push_back(t);\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tint m;\n\n\t\tlst.clear();\t\t\n\t\tlst.push_back(info.begin());\n\t\tcur = info.begin();\n\t\tpos = 0;\n\t\t\n\t\tcin >> m;\n\t\t\n\t\trep(i,m){\n\t\t\tstring s; cin >> s;\n\t\t\tif( s == \"click\" ){\t\n\t\t\t\tint x,y;\n\t\t\t\tcin >> x >> y;\n\t\t\t\tSITE t= *cur;\n\t\t\t\trep(i,t.co.size()){\n\t\t\t\t\tif(t.co[i].x1 <= x && x <= t.co[i].x2 &&\n\t\t\t\t\t t.co[i].y1 <= y && y <= t.co[i].y2\n\t\t\t\t\t){\n\t\t\t\t\t\tmove( t.co[i].name );\t\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif( s == \"show\"){\n\t\t\t\tcout << (*cur).myname << endl;\n\t\t\t}\n\t\t\t\n\t\t\tif( s == \"back\"){\n\t\t\t\tif(pos==0)continue;\n\t\t\t\t\n\t\t\t\tpos--;\n\t\t\t\tcur = lst[pos];\n\t\t\t}\n\t\t\t\n\t\t\tif( s == \"forward\"){\n\t\t\t\tif(pos == lst.size()-1)continue;\n\t\t\t\tpos++;\n\t\t\t\tcur = lst[pos];\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1054_85995",
"code_snippet": "#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <iomanip>\n#include <complex>\n#include <string>\n#include <vector>\n#include <list>\n#include <deque>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <bitset>\n#include <functional>\n#include <utility>\n#include <algorithm>\n#include <numeric>\n#include <typeinfo>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\n#include <ctime>\n\nusing namespace std;\n\n#define dump(n) cout<<\"# \"<<#n<<\"=\"<<(n)<<endl\n#define debug(n) cout<<__FILE__<<\",\"<<__LINE__<<\": #\"<<#n<<\"=\"<<(n)<<endl\n#define repi(i,a,b) for(int i=int(a);i<int(b);i++)\n#define rep(i,n) repi(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 allof(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<string> vs;\ntypedef pair<int,int> pii;\n\nstruct Button{\n\tstring name;\n\tint x1,y1,x2,y2;\n\tButton(){}\n\tButton(string name,int x1,int y1,int x2,int y2):name(name),x1(x1),y1(y1),x2(x2),y2(y2){}\n};\n\nstruct Page{\n\tstring name;\n\tvector<Button> buttons;\n\tPage(){}\n\tPage(string name):name(name){}\n};\n\nbool input(vector<Page>& pages,vs& cmds)\n{\n\tint n;\n\tcin>>n;\n\tif(!n)\n\t\treturn false;\n\t\n\tpages.resize(n);\n\tint h,w;\n\tcin>>h>>w;\n\trep(i,n){\n\t\tstring name;\n\t\tcin>>pages[i].name;\n\t\tint b;\n\t\tcin>>b;\n\t\trep(j,b){\n\t\t\tint x1,y1,x2,y2;\n\t\t\tstring name;\n\t\t\tcin>>x1>>y1>>x2>>y2>>name;\n\t\t\tpages[i].buttons.push_back(Button(name,x1,y1,x2,y2));\n\t\t}\n\t}\n\tint m;\n\tcin>>m;\n\tcmds.resize(m);\n\tcin.get();\n\trep(i,m)\n\t\tgetline(cin,cmds[i]);\n\t\n\treturn true;\n}\n\nbool clicked(const Button& b,int x,int y)\n{\n\t//printf(\"%d %d %d %d (%d,%d)\\n\",b.x1,b.y1,b.x2,b.y2,x,y);\n\t//dump(b.x1<=x && x<=b.x2 && b.y1<=y && y<=b.y2);\n\treturn b.x1<=x && x<=b.x2 && b.y1<=y && y<=b.y2;\n}\n\nvoid solve(vector<Page>& pages,vs& cmds)\n{\n\tmap<string,int> nameToId;\n\trep(i,pages.size())\n\t\tnameToId[pages[i].name]=i;\n\t\n\tvi buffer(1,0);\n\tint pos=0;\n\trep(i,cmds.size()){\n\t\tif(cmds[i].substr(0,4)==\"show\")\n\t\t\t//dump(pages[buffer[pos]].name);\n\t\t\tcout<<pages[buffer[pos]].name<<endl;\n\t\tif(cmds[i].substr(0,4)==\"back\")\n\t\t\tpos=max(pos-1,0);\n\t\tif(cmds[i].substr(0,7)==\"forward\")\n\t\t\tpos=min(pos+1,(int)buffer.size()-1);\n\t\tif(cmds[i].substr(0,5)==\"click\"){\n\t\t\tbuffer.resize(pos+1);\n\t\t\tistringstream iss(cmds[i].substr(5));\n\t\t\tint x,y;\n\t\t\tiss>>x>>y;\n\t\t\tPage& page=pages[buffer[pos]];\n\t\t\trep(j,page.buttons.size()){\n\t\t\t\tif(clicked(page.buttons[j],x,y)){\n\t\t\t\t\tbuffer.push_back(nameToId[page.buttons[j].name]);\n\t\t\t\t\tpos++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//dump(pos);\n\t}\n}\n\nint main()\n{\n\tfor(;;){\n\t\tvector<Page> pages;\n\t\tvs cmds;\n\t\tif(!input(pages,cmds))\n\t\t\tbreak;\n\t\tsolve(pages,cmds);\n\t\t//puts(\"--\");\n\t\t//rep(i,pages.size()){\n\t\t//\tdump(pages[i].name);\n\t\t//\trep(j,pages[i].buttons.size()){\n\t\t//\t\tButton& b=pages[i].buttons[j];\n\t\t//\t\tprintf(\"%s %d %d %d %d\\n\",b.name.c_str(),b.x,b.y,b.w,b.h);\n\t\t//\t}\n\t\t//}\n\t\t//rep(i,cmds.size())\n\t\t//\tdump(cmds[i]);\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_1055_cpp
|
Problem E:
Huge Family
Mr. Dango's family has extremely huge number of members. Once it had about 100 members, and now it has as many as population of a city. It is jokingly guessed that the member might fill this planet in near future. They all have warm and gracious personality and are close each other.
They usually communicate by a phone. Of course, They are all taking a family plan. This family plan is such a thing: when
a
choose
b
, and
b
choose
a
as a partner, a family plan can be applied between them and then the calling fee per unit time between them discounted to
f
(
a
,
b
), which is cheaper than a default fee. Each person can apply a family plan at most 2 times, but no same pair of persons can apply twice. Now, choosing their partner appropriately, all members of Mr. Dango's family applied twice.
Since there are huge number of people, it is very difficult to send a message to all family members by a phone call. Mr. Dang have decided to make a phone calling network that is named '
clan
' using the family plan. Let us present a definition of
clan
.
Let
S
be an any subset of all phone calls that family plan is applied.
Clan
is
S
such that:
For any two persons (let them be
i
and
j
), if
i
can send a message to
j
through phone calls that family plan is applied (directly or indirectly), then
i
can send a message to
j
through only phone calls in
S
(directly or indirectly).
Meets condition 1 and a sum of the calling fee per unit time in
S
is minimized.
Clan
allows to send a message efficiently. For example, we suppose that one have sent a message through all calls related to him in the clan. Additionaly we suppose that every people follow a rule, "when he/she receives a message through a call in clan, he/she relays the message all other neibors in respect to clan." Then, we can prove that this message will surely be derivered to every people that is connected by all discounted calls, and that the message will never be derivered two or more times to same person.
By the way, you are given information about application of family plan of Mr. Dango's family. Please write a program that calculates that in how many ways a different clan can be constructed. You should output the answer modulo 10007 because it may be very big.
Input
The input consists of several datasets.
The first line of each dataset contains an integer
n
, which indicates the number of members in the family.
Next
n
lines represents information of the
i
-th member with four integers. The first two integers respectively represent
b
[0] (the partner of
i
) and f(
i
,
b
[0]) (the calling fee per unit time between
i
and
b
[0]). The following two integers represent
b
[1] and
f
(
i
,
b
[1]) in the same manner.
Input terminates with a dataset where n = 0.
Output
For each dataset, output the number of
clan
modulo 10007.
Constraints
3 ≤
n
≤ 100,000
Sample Input
3
1 1 2 3
0 1 2 2
1 2 0 3
7
1 2 2 1
0 2 3 2
0 1 3 1
2 1 1 2
5 3 6 2
4 3 6 1
4 2 5 1
0
Output for the Sample Input
1
2
|
[
{
"submission_id": "aoj_1055_2254609",
"code_snippet": "#include<bits/stdc++.h>\n#define N 100005\nusing namespace std;\n\ntypedef pair<int,int> P;\n\nvector<P> G[N];\nbool used[N],used2[N];\n\nmap<int,int> cnt;\nset<P> usedP;\n\nvoid dfs(int x){\n \n if(used2[x])return;\n used2[x]=1;\n used[x]=1;\n \n for(int i=0;i<G[x].size();i++){\n\n int nx=G[x][i].first,cost=G[x][i].second;\n \n if(!usedP.count(P(min(x,nx),max(x,nx)))){\n usedP.insert(P(min(x,nx),max(x,nx)));\n if(cnt.count(cost))cnt[cost]++;\n else cnt[cost]=1;\n }\n\n dfs(nx);\n \n }\n \n}\n\nint main(){\n\n int n;\n \n while(1){\n \n cin>>n;\n if(!n)break;\n\n for(int i=0;i<n;i++)G[i].clear();\n \n for(int i=0;i<n;i++){\n int a,b;\n cin>>a>>b;\n G[i].push_back(P(a,b));\n cin>>a>>b;\n G[i].push_back(P(a,b));\n }\n \n memset(used,0,sizeof(used));\n \n int ans=1;\n \n for(int i=0;i<n;i++){\n if(used[i])continue;\n \n memset(used2,0,sizeof(used2));\n cnt.clear();\n usedP.clear();\n \n dfs(i);\n \n if(cnt.size()){\n\tmap<int,int>::iterator ite=cnt.end();\n\tite--;\n\tans=(ans*(*ite).second)%10007;\n }\n \n }\n \n cout<<ans<<endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 7644,
"score_of_the_acc": -1,
"final_rank": 15
},
{
"submission_id": "aoj_1055_2254524",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\n\nint b[2][114514], f[2][114514];\n\nbool used[114514];\n\nsigned main(){\n int n;\n int mod = 10007;\n while(cin >> n, n) {\n memset(b, -1, sizeof(b));\n memset(f, -1, sizeof(f));\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < 2; j++) cin >> b[j][i] >> f[j][i];\n }\n memset(used, false, sizeof(used));\n int ans = 1;\n for(int i = 0; i < n; i++) {\n if(used[i]) continue;\n set<int> st;\n queue<int> que; \n que.push(i);\n while(!que.empty()) {\n\tint u = que.front(); que.pop();\n\tif(used[u]) continue;\n\tused[u] = true;\n\tst.insert(u);\n\tque.push(b[0][u]);\t\n\tque.push(b[1][u]);\n }\n map<int, int> m;\n for(int j : st) {\n\tm[f[0][j]]++;\n\tm[f[1][j]]++;\n }\n auto it = m.end(); it--;\n (ans *= it->second/2) %= mod;\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 7252,
"score_of_the_acc": -0.9487,
"final_rank": 14
},
{
"submission_id": "aoj_1055_2108233",
"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<stack>\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 vector<string> vs;\ntypedef vector<double> vd;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nclass SCC{//cmp(0 - kk-1) is scc's return. Same number is group. The number is no relatoin.\n\tpublic:\n\tint n;\n\tvvi G,rG;\n\tvector<bool>used;\n\tvi vs,cmp;\n\tvvp cost;\n\tvoid init(int size){\n\t\tn=size;\n\t\tG=rG=vvi(n);\n\t\tused=vector<bool>(n);\n\t\tcmp=vi(n);\n\t\tcost=vvp(n);\n\t\tvs=vi(0);\n\t}\n\tvoid add_edge(int s,int t,int c){\n\t\tcost[s].pb(pii(t,c));\n\t\tG[s].pb(t);\n\t\trG[t].pb(s);\n\t}\n\tvoid rdfs(int v,int k){\n\t\tused[v]=true;\n\t\tcmp[v]=k;\n\t\trep(i,rG[v].size())if(!used[rG[v][i]])rdfs(rG[v][i],k);\n\t}\n\tvoid dfs(int v){\n\t\tused[v]=true;\n\t\trep(i,G[v].size())if(!used[G[v][i]])dfs(G[v][i]);\n\t\tvs.pb(v);\n\t}\n\tint scc(){\n\t\trep(i,n)used[i]=false;\n\t\trep(v,n)if(!used[v])dfs(v);\n\t\trep(i,n)used[i]=false;\n\t\tint kk=0;\n\t\tfor(int i=vs.size()-1;i>=0;i--)if(!used[vs[i]])rdfs(vs[i],kk++);\n\t\treturn kk; \n\t}\n\tvoid solve(){\n\t\tint N=scc();\n\t\tvi ma(N),co(N);\n\t\trep(i,n)rep(j,cost[i].size()){\n\t\t\tint t=cost[i][j].first;\n\t\t\tif(cmp[t]==cmp[i]){\n\t\t\t\tma[cmp[t]]=max(ma[cmp[t]],cost[i][j].second);\n\t\t\t}\n\t\t}\n\t\trep(i,n)rep(j,cost[i].size()){\n\t\t\tint t=cost[i][j].first;\n\t\t\tif(cmp[t]==cmp[i]&&ma[cmp[t]]==cost[i][j].second){\n\t\t\t\tco[cmp[t]]++;\n\t\t\t}\n\t\t}\n\t\tint out=1;\n\t\trep(i,N)(out*=co[i]/2)%=10007;\n\t\tcout<<out<<endl;\n\t}\n};\nint main(){\n\tint n;\n\tSCC scc;\n\twhile(cin>>n,n){\n\t\tscc.init(n);\n\t\trep(i,n){\n\t\t\tint a,b,c,d;\n\t\t\tcin>>a>>b>>c>>d;\n\t\t\tscc.add_edge(i,a,b);\n\t\t\tscc.add_edge(i,c,d);\n\t\t}\n\t\tscc.solve();\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4744,
"score_of_the_acc": -0.6206,
"final_rank": 13
},
{
"submission_id": "aoj_1055_1164690",
"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 Edge { int src,dst,weight; };\nconst int MAX_V = 100100;\nconst int mod = 10007;\nvector<Edge> G[MAX_V];\nint V;\nint group[MAX_V];\nint maxi[MAX_V];\n\nvoid dfs(int cur,int index){\n rep(i,(int)G[cur].size()) {\n int next = G[cur][i].dst;\n if( group[next] == -1 ) {\n group[next] = index;\n dfs(next,index);\n }\n }\n}\n\nint main(){\n while( cin >> V, V ){\n rep(i,V) G[i].clear();\n rep(i,V) {\n rep(_,2){\n int dst,weight;\n cin >> dst >> weight;\n G[i].push_back((Edge){i,dst,weight});\n }\n }\n memset(group,-1,sizeof(group));\n memset(maxi,0,sizeof(maxi));\n int size_ = 0;\n rep(i,V) if( group[i] == -1 ) {\n group[i] = size_;\n dfs(i,size_);\n ++size_;\n }\n\n rep(i,V) rep(j,(int)G[i].size()) maxi[group[i]] = max(maxi[group[i]],G[i][j].weight);\n vector<int> counter(size_,0);\n rep(i,V) rep(j,(int)G[i].size()) if( maxi[group[i]] == G[i][j].weight ) ++counter[group[i]];\n int answer = 1;\n rep(i,size_) ( answer *= int(counter[i]/2) ) %= mod;\n cout << answer << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 5120,
"score_of_the_acc": -1.6698,
"final_rank": 20
},
{
"submission_id": "aoj_1055_1164286",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int mod=10007;\ntypedef pair<int,int> P;\n \nint M,cnt;\nvector<P> v[100001];\nbool u[100001];\nvector<int> a;\n \nvoid dfs(int x) {\n u[x]=true;\n a.push_back(x);\n for(int i=0; i<v[x].size(); i++) {\n if(!u[v[x][i].first]) {\n M=max(M,v[x][i].second);\n dfs(v[x][i].first);\n }\n }\n}\n \nvoid solve() {\n cnt=0;\n for(int i=0; i<a.size(); i++) {\n for(int j=0; j<v[a[i]].size(); j++) {\n if(M==v[a[i]][j].second) cnt++;\n }\n }\n}\n \nint main() {\n int n;\n while(cin >> n && n) {\n for(int i=0; i<n; i++) {\n v[i].clear();\n int x,y;\n cin >> x >> y;\n v[i].push_back(P(x,y));\n cin >> x >> y;\n v[i].push_back(P(x,y));\n }\n int ans=1;\n memset(u,false,sizeof(u));\n for(int i=0; i<n; i++) {\n if(!u[i]) {\n M=0;\n a.clear();\n dfs(i);\n solve();\n ans*=cnt/2;\n ans%=mod;\n }\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4388,
"score_of_the_acc": -0.574,
"final_rank": 12
},
{
"submission_id": "aoj_1055_1144416",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Edge{\n\tint src,dst,weight;\n\tEdge(){}\n\tEdge(int s,int d,int w):src(s),dst(d),weight(w){}\n};\ntypedef vector<vector<Edge>> Graph;\n\nint main()\n{\n\tfor(int n;cin>>n && n;){\n\t\tGraph g(n);\n\t\tfor(int u=0;u<n;u++)\n\t\t\tfor(int j=0;j<2;j++){\n\t\t\t\tint v,w; cin>>v>>w;\n\t\t\t\tg[u].emplace_back(u,v,w);\n\t\t\t}\n\t\t\n\t\tint res=1;\n\t\tvector<int> vis(n);\n\t\tfor(int i=0;i<n;i++) if(!vis[i]){\n\t\t\tvector<int> ws;\n\t\t\tint p=-1,u=i;\n\t\t\tdo{\n\t\t\t\tvis[u]=1;\n\t\t\t\tfor(auto e:g[u]) if(e.dst!=p){\n\t\t\t\t\tws.push_back(e.weight);\n\t\t\t\t\tp=u,u=e.dst;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}while(u!=i);\n\t\t\t(res*=count(begin(ws),end(ws),*max_element(begin(ws),end(ws))))%=10007;\n\t\t}\n\t\tcout<<res<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1900,
"score_of_the_acc": -0.2486,
"final_rank": 6
},
{
"submission_id": "aoj_1055_1109523",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint UF[110000];\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 c[110000];\nint d[110000];\nint e[110000];\nint f[110000];\nint mod=10007;\nint m[110000];\nint num[110000];\nint main(){\n\tint a;\n\twhile(scanf(\"%d\",&a),a){\n\t\tfor(int i=0;i<a;i++)UF[i]=-1;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tscanf(\"%d%d%d%d\",c+i,d+i,e+i,f+i);\n\t\t\tUNION(c[i],i);\n\t\t\tUNION(e[i],i);\n\t\t}\n\t\tfor(int i=0;i<110000;i++)m[i]=num[i]=0;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tint at=FIND(i);\n\t\t\tif(m[at]<d[i]){\n\t\t\t\tm[at]=d[i];num[at]=1;\n\t\t\t}else if(m[at]==d[i])num[at]++;\n\t\t\tif(m[at]<f[i]){\n\t\t\t\tm[at]=f[i];num[at]=1;\n\t\t\t}else if(m[at]==f[i])num[at]++;\n\t\t}\n\t\tint ret=1;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tif(FIND(i)==i){\n\t\t\t\tret=ret*(num[i]/2)%mod;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",ret);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2176,
"score_of_the_acc": -0.2847,
"final_rank": 7
},
{
"submission_id": "aoj_1055_941400",
"code_snippet": "#include<iostream>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\n\nint main() {\n while (true) {\n int n;\n cin >> n;\n if (n == 0) break;\n int edge[n][4];\n rep (i, n) rep (j, 4) cin >> edge[i][j];\n bool used[n];\n fill(used, used + n, false);\n long long res = 1;\n rep (i, n) if (!used[i]) {\n int mx = edge[i][1];\n int cnt = 1;\n int pp = i;\n used[i] = true;\n for (int p = edge[i][0]; p != i; ) {\n\tused[p] = true;\n\tif (edge[p][0] == pp) {\n\t if (mx == edge[p][3]) {\n\t ++cnt;\n\t } else if (mx < edge[p][3]) {\n\t cnt = 1;\n\t mx = edge[p][3];\n\t }\n\t pp = p;\n\t p = edge[p][2];\n\t} else {\n\t if (mx == edge[p][1]) {\n\t ++cnt;\n\t } else if (mx < edge[p][1]) {\n\t cnt = 1;\n\t mx = edge[p][1];\n\t }\n\t pp = p;\n\t p = edge[p][0];\n\t}\n }\n res *= cnt;\n res %= 10007;\n }\n cout << res << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1316,
"score_of_the_acc": -0.1722,
"final_rank": 3
},
{
"submission_id": "aoj_1055_676500",
"code_snippet": "/*\nテ」ツ?敕」ツつ古」ツ?榲」ツつ古」ツ?ョテゥツ?」テァツオツ静ヲツ按静・ツ按?」ツ?ョテヲツ慊?・ツ、ツァテ」ツ?ョティツセツコテ」ツ?ョテヲツ閉ーテ」ツつ津ヲツ閉ーテ」ツ?暗」ツ?ヲテヲツ篠崚」ツ?妥・ツ青暗」ツつ湘」ツ?崚」ツつ凝」ツ??\n*/\n\n#include<iostream>\n#include<vector>\n#include<algorithm>\n\n#define to first\n#define cnt first\n#define cost second\n#define MAX_N 100001\n#define MOD 10007\n\nusing namespace std;\n\ntypedef pair<int,int> P;\n\nvector<P>G[MAX_N];\nbool vis[MAX_N];\n\nP dfs(int n,P x){\n vis[n]=true;\n\n for(int i=0;i<G[n].size();i++){\n P e=G[n][i];\n if(x.cost<e.cost)x.cost=e.cost,x.cnt=1;\n else if(x.cost==e.cost)x.cnt++;\n if(!vis[e.to])x=dfs(e.to,x);\n }\n\n return x;\n}\n\nint main(void){\n\n int n,b,fb;\n\n while(cin >> n,n){\n\n for(int i=0;i<MAX_N;i++)G[i].clear();\n\n for(int i=0;i<n;i++){\n for(int j=0;j<2;j++){\n\tcin >> b >> fb;\n\tG[i].push_back(make_pair(b,fb));\n }\n }\n\n fill(vis,vis+MAX_N,false);\n int ans=1;\n for(int i=0;i<n;i++){\n if(!vis[i]){\n\tP x(0,0);\n\tx=dfs(i,x);\n\tans=ans%MOD*x.cnt/2%MOD;\n }\n }\n cout << ans << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4252,
"score_of_the_acc": -0.5563,
"final_rank": 10
},
{
"submission_id": "aoj_1055_676496",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n\n#define to first\n#define cnt first\n#define cost second\n#define MAX_N 100001\n#define MOD 10007\n\nusing namespace std;\n\ntypedef pair<int,int> P;\n\nvector<P>G[MAX_N];\nbool vis[MAX_N];\n\nP dfs(int n,P x){\n vis[n]=true;\n\n for(int i=0;i<G[n].size();i++){\n P e=G[n][i];\n if(x.cost<e.cost)x.cost=e.cost,x.cnt=1;\n else if(x.cost==e.cost)x.cnt++;\n if(!vis[e.to])x=dfs(e.to,x);\n }\n\n return x;\n}\n\nint main(void){\n\n int n,b,fb;\n\n while(cin >> n,n){\n\n for(int i=0;i<MAX_N;i++)G[i].clear();\n\n for(int i=0;i<n;i++){\n for(int j=0;j<2;j++){\n\tcin >> b >> fb;\n\tG[i].push_back(make_pair(b,fb));\n }\n }\n\n fill(vis,vis+MAX_N,false);\n int ans=1;\n for(int i=0;i<n;i++){\n if(!vis[i]){\n\tP x(0,0);\n\tx=dfs(i,x);\n\tans=ans%MOD*x.cnt/2%MOD;\n }\n }\n cout << ans << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4256,
"score_of_the_acc": -0.5568,
"final_rank": 11
},
{
"submission_id": "aoj_1055_554896",
"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 = 10007;\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\nstruct edge{\n int v, c;\n edge(int v, int c) : v(v), c(c) {}\n};\ntypedef vector<edge> node;\n\nint main(){\n int N;\n while(cin>>N && N){\n vector<node> G(N);\n REP(i, N){\n REP(iter, 2){\n int v, c;\n cin>>v>>c;\n G[i].push_back(edge(v, c));\n }\n }\n int s = 0;\n vector<int> color(N, -1);\n REP(i, N) if(color[i] == -1){\n queue<int> que;\n que.push(i);\n color[i] = s;\n while(!que.empty()){\n int u = que.front(); que.pop();\n REP(i, G[u].size()){\n edge e = G[u][i];\n if(color[e.v] == -1){\n que.push(e.v);\n color[e.v] = s;\n }\n }\n }\n s += 1;\n }\n ll ans = 1;\n REP(c, s){\n int max_c = -INF;\n REP(i, N) if(color[i] == c) REP(j, G[i].size()) max_c = max(max_c, G[i][j].c);\n int cnt = 0;\n REP(i, N) if(color[i] == c) REP(j, G[i].size()) if(G[i][j].c == max_c) cnt++;\n cnt /= 2;\n ans = (ans * cnt) % MOD;\n }\n cout<<ans<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1564,
"score_of_the_acc": -0.2046,
"final_rank": 5
},
{
"submission_id": "aoj_1055_483209",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint done[100000];\nvector< vector<int> > g;\nvector< vector<int> > g_c;\nint bfs(int x){\n\tqueue<int> Q;\n\tvector<int> vec;\n\tQ.push(x);\n\twhile(Q.size()){\n\t\tint q = Q.front(); Q.pop();\n\t\tif( done[q] ) continue;\n\t\telse done[q] = true;\n\t\tfor(int i = 0 ; i < g[q].size() ; i++){\n\t\t\tQ.push(g[q][i]);\n\t\t\tvec.push_back(g_c[q][i]);\n\t\t}\n\t}\n\t//cout << x << \" \" << vec.size() << endl;\n\tsort(vec.begin(),vec.end());\n\tint answer = 0;\n\tfor(int i = 0 ; i < vec.size() ; i++){\n\t\tif( vec[i] == vec.back() ) answer++;\n\t}\n\treturn answer/2;\n}\n\n\nint main(){\n\tint n;\n\twhile(cin >> n && n){\n\t\tfor(int i = 0 ; i < 100000 ; i++)\n\t\t\tdone[i] = 0;\n\t\tg.clear();\n\t\tg_c.clear();\n\t\tg.resize(n);\n\t\tg_c.resize(n);\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\t\n\t\t\tfor(int j = 0 ; j < 2 ; j++){\n\t\t\t\tint a,b;\n\t\t\t\tcin >> a >> b;\n\t\t\t\tg[i].push_back(a);\n\t\t\t\tg_c[i].push_back(b);\n\t\t\t}\n\t\t}\n\t\tlong long ans = 1;\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\tif( done[i] == 0 ){\n\t\t\t\tans *= bfs(i);\n\t\t\t\tans %= 10007;\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t\t\n\t\t\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2892,
"score_of_the_acc": -0.3783,
"final_rank": 8
},
{
"submission_id": "aoj_1055_482778",
"code_snippet": "//06\n#include<iostream>\n#include<map>\n#include<algorithm>\n\nusing namespace std;\n\nint p[100000];\n\nint find(int x){\n return (x==p[x])?x:(p[x]=find(p[x]));\n}\n\nvoid unite(int a,int b){\n p[find(a)]=find(b);\n}\n\nint main(){\n for(int n;cin>>n,n;){\n int o[100000][2],f[100000][2];\n for(int i=0;i<n;i++){\n p[i]=i;\n }\n for(int i=0;i<n;i++){\n for(int j=0;j<2;j++){\n\tcin>>o[i][j]>>f[i][j];\n\tunite(i,o[i][j]);\n }\n }\n map<int,int> m;\n for(int i=0;i<n;i++){\n for(int j=0;j<2;j++){\n\tm[find(i)]=max(m[find(i)],f[i][j]);\n }\n }\n map<int,int> mm;\n for(int i=0;i<n;i++){\n for(int j=0;j<2;j++){\n\tmm[find(i)]+=m[find(i)]==f[i][j];\n }\n }\n int r=1;\n for(map<int,int>::iterator it=mm.begin();it!=mm.end();it++){\n r=r*it->second/2%10007;\n }\n cout<<r<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1480,
"score_of_the_acc": -0.1936,
"final_rank": 4
},
{
"submission_id": "aoj_1055_435638",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint n,b[2][100100],f[2][100100];\nbool v[100100];\n\nint dfs(int s, int now, int maxi, int num){\n v[now] = true;\n \n for(int i=0;i<2;i++){\n if(!v[b[i][now]]){\n if(maxi == f[i][now])num++;\n else if(maxi < f[i][now]){\n\tmaxi = f[i][now];\n\tnum = 1;\n }\n if(b[i][now] == s)return num;\n return dfs(s,b[i][now],maxi,num);\n }\n }\n if(maxi == f[1][s])return num+1;\n else if(maxi < f[1][s])return 1;\n else return num;\n}\n\nint main(){\n while(cin >> n,n){\n for(int i=0;i<n;i++){\n cin >> b[0][i] >> f[0][i] >> b[1][i] >> f[1][i];\n v[i] = false;\n }\n\n int ans = 1;\n for(int i=0;i<n;i++){\n if(!v[i]){\n\tv[i] = true;\n\tans = (ans * dfs(i,b[0][i],f[0][i],1) ) % 10007;\n }\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1055_397115",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <stack>\n#include <map>\nusing namespace std;\n\ntypedef vector <int> VI;\ntypedef vector <VI> VVI;\ntypedef pair <int, int> PII;\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()\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;\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}\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\nint main() {\n int n;\n while ( cin >> n && n ) {\n Graph G(n);\n for ( int i = 0; i < n; ++ i ) {\n for ( int j = 0; j < 2; ++ j ) {\n int b, f;\n cin >> b >> f;\n G[i].push_back( Edge( i, b, f ) );\n }\n }\n VVI scc;\n int res = 1;\n stronglyConnectedComponents( G, scc );\n for ( auto it = scc.begin(); it != scc.end(); ++ it ) {\n VI V = *it;\n int m = V.size();\n int maxf = 0;\n for ( int i = 0; i < m; ++ i ) {\n for ( int j = 0; j < 2; ++ j ) {\n maxf = max( maxf, G[V[i]][j].weight );\n }\n }\n int cnt = 0;\n for ( int i = 0; i < m; ++ i ) {\n for ( int j = 0; j < 2; ++ j ) {\n if ( maxf == G[V[i]][j].weight ) {\n cnt ++;\n }\n }\n }\n res = ( res * ( cnt / 2 ) ) % 10007;\n }\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3456,
"score_of_the_acc": -0.4521,
"final_rank": 9
},
{
"submission_id": "aoj_1055_326426",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nstruct Edge {\n int to, cost;\n};\n\nconst int MAX_N = 100002;\nconst int MOD = 10007;\nint N;\nEdge E[MAX_N][2];\nbool vis[MAX_N];\n\nint getMaxCostNum(int p) {\n int num = 0;\n int maxCost = 0;\n int pp = -1;\n while(1) {\n int d = (E[p][0].to == pp);\n bool flag = false;\n for(int i = 0; i < 2; ++i) {\n Edge &e = E[p][(i+d)%2];\n if(vis[e.to]) continue;\n\n vis[e.to] = true;\n pp = p;\n p = e.to;\n if(e.cost == maxCost) {\n\t++num;\n } else if(e.cost > maxCost) {\n\tnum = 1;\n\tmaxCost = e.cost;\n }\n flag = true;\n break;\n }\n if(!flag) return num;\n }\n}\n\nint solve() {\n int res = 1;\n fill(vis, vis+MAX_N, false);\n for(int i = 0; i < N; ++i) {\n if(vis[i]) continue;\n int tmp = getMaxCostNum(i);\n res = (res*tmp)%MOD;\n }\n return res;\n}\n\nint main() {\n while(cin >> N && N) {\n for(int i = 0; i < N; ++i) {\n for(int j = 0; j < 2; ++j) {\n\tcin >> E[i][j].to >> E[i][j].cost;\n }\n }\n cout << solve() << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 0,
"score_of_the_acc": -1,
"final_rank": 15
},
{
"submission_id": "aoj_1055_322942",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<cassert>\nusing namespace std;\n#define rep(i, n) for ( int i = 0; i < n; i++ )\n#define MAX 100000\n#define M 10007\n\nclass Edge{\npublic:\n int target, cost;\n Edge(int target, int cost):target(target), cost(cost){}\n};\n\nvector<Edge> G[MAX];\nbool V[MAX];\nint n;\nint ncomp;\n\nvoid dfs(int u, vector<int> &maxv){\n V[u] = true;\n ncomp++;\n\n rep(i, G[u].size()){\n int c = G[u][i].cost;\n if ( maxv[0] < c ){ maxv.clear(); maxv.push_back(c); }\n else if ( maxv[0] == c ) maxv.push_back(c);\n }\n\n rep(i, G[u].size()){\n int v = G[u][i].target;\n if ( V[v] ) continue;\n dfs(v, maxv);\n }\n}\n\nint component(int u){\n vector<int> maxv;\n maxv.push_back(-1);\n ncomp = 0;\n dfs(u, maxv);\n assert( ncomp >= 3 );\n assert( maxv.size()%2 == 0 );\n return maxv.size()/2;\n}\n\nvoid compute(){\n rep(i, n) V[i] = false;\n int p = 1;\n rep(u, n){\n if ( !V[u] ){\n p = (p*component(u))%M;\n }\n }\n cout << p << endl;\n}\n\n\nmain(){\n int m, s, t1, t2, b1, b2, c;\n while(1){\n cin >> n;\n if ( n == 0 ) break;\n assert( 3 <= n && n <= 100000);\n\n rep(i, n) G[i].clear();\n rep(i, n){\n cin >> t1 >> b1 >> t2 >> b2;\n G[i].push_back(Edge(t1, b1));\n G[i].push_back(Edge(t2, b2));\n assert( 0 < b1 );\n assert( 0 < b2 );\n }\n\n rep(i, n) assert( G[i].size() == 2 );\n rep(i, n) assert( G[i][0].target != G[i][1].target );\n\n rep(i, n){\n t1 = G[i][0].target;\n t2 = G[i][1].target;\n int c1 = G[i][0].cost;\n int c2 = G[i][1].cost;\n\n assert( G[t1][0].target == i || G[t1][1].target == i );\n assert( G[t2][0].target == i || G[t2][1].target == i );\n\n if ( G[t1][0].target == i ) assert( G[t1][0].cost == c1 );\n if ( G[t1][1].target == i ) assert( G[t1][1].cost == c1 );\n\n if ( G[t2][0].target == i ) assert( G[t2][0].cost == c2 );\n if ( G[t2][1].target == i ) assert( G[t2][1].cost == c2 );\n }\n\n\n\n compute();\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1055_271979",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nstruct edge{\npublic:\n int to,cost;\n};\n\nvector<edge> G[100001];\nint n;\nbool passed[100001];\nconst int mod=10007;\nint maxCost;\nint sumCost;\nint cnt;\n\nvoid dfs(int s,bool first,int from){\n if(!first)\n passed[s]=true;\n for(int i = 0; i < G[s].size(); i++){\n edge &e=G[s][i];\n if(passed[e.to]||e.to==from)\n continue;\n sumCost+=e.cost;\n if(maxCost<e.cost){\n cnt=1;maxCost=e.cost;\n }\n else if(maxCost==e.cost)\n cnt++;\n dfs(e.to,false,s);\n break;\n }\n}\n\nint main(){\n while(cin>>n&&n!=0){\n maxCost=0;\n for(int i = 0; i < n; i++)\n G[i].clear();\n fill(passed,passed+n,false);\n for(int i = 0; i < n; i++){\n for(int j = 0; j < 2; j++){\n int to,cost;\n cin>>to>>cost;\n edge e;\n e.to=to;e.cost=cost;\n G[i].push_back(e);\n }\n }\n int mul=1;\n for(int i = 0; i < n; i++){\n if(passed[i])\n continue;\n maxCost=0;\n sumCost=0;\n cnt=0;\n dfs(i,true,-1);\n mul*=cnt;\n mul%=mod;\n }\n cout<<mul%mod<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2300,
"score_of_the_acc": -1.3009,
"final_rank": 18
},
{
"submission_id": "aoj_1055_271978",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nstruct edge{\npublic:\n int to,cost;\n};\n\nvector<edge> G[100001];\nint n;\nbool passed[100001];\nconst int mod=10007;\nint maxCost;\nint sumCost;\nint cnt;\n\n//vector<int> p;\nvoid dfs(int s,bool first,int from){\n if(!first)\n passed[s]=true;\n for(int i = 0; i < G[s].size(); i++){\n edge &e=G[s][i];\n if(passed[e.to]||e.to==from)\n continue;\n sumCost+=e.cost;\n if(maxCost<e.cost){\n cnt=1;maxCost=e.cost;\n }\n else if(maxCost==e.cost)\n cnt++;\n dfs(e.to,false,s);\n break;\n }\n}\n\nint main(){\n while(cin>>n&&n!=0){\n maxCost=0;\n for(int i = 0; i < n; i++)\n G[i].clear();\n fill(passed,passed+n,false);\n for(int i = 0; i < n; i++){\n for(int j = 0; j < 2; j++){\n int to,cost;\n cin>>to>>cost;\n edge e;\n e.to=to;e.cost=cost;\n G[i].push_back(e);\n }\n }\n int mul=1;\n for(int i = 0; i < n; i++){\n if(passed[i])\n continue;\n maxCost=0;\n sumCost=0;\n cnt=0;\n dfs(i,true,-1);\n // ツづづ個陛督づーツ催ュツづゥツつゥ\n // int maxNum=-1;\n// int sum=0;\n// int cnt=0;\n //for(int j = 0; j < p.size(); j++){\n // if(maxNum==-1||maxNum<p[j]){\n // maxNum=p[j];\n // cnt=1;\n // }\n // else if(maxNum==p[j])\n // cnt++;\n //}\n mul*=cnt;\n mul%=mod;\n }\n cout<<mul%mod<<endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2320,
"score_of_the_acc": -1.3035,
"final_rank": 19
},
{
"submission_id": "aoj_1055_271972",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nstruct edge{\npublic:\n int to,cost;\n};\n\nvector<edge> G[100001];\nint n;\nbool passed[100001];\nconst int mod=10007;\n\nvector<int> p;\nvoid dfs(int s,bool first,int from){\n if(!first)\n passed[s]=true;\n for(int i = 0; i < G[s].size(); i++){\n edge &e=G[s][i];\n if(passed[e.to]||e.to==from)\n continue;\n p.push_back(e.cost);\n dfs(e.to,false,s);\n break;\n }\n}\n\nint main(){\n while(cin>>n&&n!=0){\n for(int i = 0; i < n; i++)\n G[i].clear();\n fill(passed,passed+n,false);\n for(int i = 0; i < n; i++){\n for(int j = 0; j < 2; j++){\n int to,cost;\n cin>>to>>cost;\n edge e;\n e.to=to;e.cost=cost;\n G[i].push_back(e);\n }\n }\n int mul=1;\n for(int i = 0; i < n; i++){\n if(passed[i])\n continue;\n p.clear();\n dfs(i,true,-1);\n // ツづづ個陛督づーツ催ュツづゥツつゥ\n int maxNum=-1;\n int sum=0;\n int cnt=0;\n for(int j = 0; j < p.size(); j++){\n if(maxNum==-1||maxNum<p[j]){\n maxNum=p[j];\n cnt=1;\n }\n else if(maxNum==p[j])\n cnt++;\n }\n mul*=cnt;\n mul%=mod;\n }\n cout<<mul%mod<<endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 0,
"score_of_the_acc": -1,
"final_rank": 15
}
] |
aoj_1056_cpp
|
Problem F:
Ben Toh
As usual, those who called wolves get together on 8 p.m. at the supermarket. The thing they want is only one, a box lunch that is labeled half price. Scrambling for a few discounted box lunch, they fiercely fight every day. And those who are blessed by hunger and appetite the best can acquire the box lunch, while others have to have cup ramen or something with tear in their eyes.
A senior high school student, Sato, is one of wolves. A dormitry he lives doesn't serve a dinner, and his parents don't send so much money. Therefore he absolutely acquire the half-priced box lunch and save his money. Otherwise he have to give up comic books and video games, or begin part-time job.
Since Sato is an excellent wolf, he can acquire the discounted box lunch in 100% probability on the first day. But on the next day, many other wolves cooperate to block him and the probability to get a box lunch will be 50%. Even though he can get, the probability to get will be 25% on the next day of the day. Likewise, if he gets a box lunch on a certain day, the probability to get on the next day will be half. Once he failed to get a box lunch, probability to get would be back to 100%.
He continue to go to supermaket and try to get the discounted box lunch for
n
days. Please write a program to computes the expected value of the number of the discounted box lunches he can acquire.
Input
Input consists of several datasets.
Input for a single dataset is given as a single integer
n
.
Input terminates with a dataset where
n
= 0.
Output
For each dataset, write a line that contains an expected value. You may print any number of digits after the decimal point. Answers that have an error less than 1.0e-2 will be accepted.
Constraints
1 ≤
n
≤ 100,000
Sample Input
1
2
3
0
Output for the Sample Input
1.00000000
1.50000000
2.12500000
|
[
{
"submission_id": "aoj_1056_10848503",
"code_snippet": "#include<stdio.h>\n#define stepn 70\ndouble f[100001],g[100001];\n\nint max(int o,int p) {return o>p?o:p;}\nint min(int o,int p) {return o<p?o:p;}\n\ndouble pow1(int o)\n{\n if (o==0) return 1.0;\n if (o==1) return 0.5;\n double ans=pow1(o/2);\n ans*=ans;\n if (o&1) ans*=0.5;\n return ans;\n}\n\nint main()\n{\n f[1]=1.0,g[1]=1.0;\n double u=1,v=1;\n for (int i=2;i<=100000;i++)\n {\n u*=0.5;\n v*=u;\n g[i]=i;\n f[i]+=g[i]*v;\n for (int j=2;j<=i;j++)\n if (j>stepn) {break;} else\n {\n f[i]+=(pow1((j-1)*(j-2)/2)*(1-pow1(j-1))*(f[i-j]+g[j-1]));\n }\n //f[i]=1.0+0.5*(f[i-2]+g[i-1]);\n //g[i]=0.5*(g[i-1]+f[i]);\n }\n\n int n;\n while (true)\n {\n scanf(\"%d\",&n);\n if (n==0) break;\n printf(\"%.3f\\n\",f[n]);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 4428,
"score_of_the_acc": -0.2377,
"final_rank": 6
},
{
"submission_id": "aoj_1056_10322722",
"code_snippet": "#include<bits/stdc++.h> \nusing namespace std;\nusing ll=long long;\n\nvoid solve(ll N){\n\tvector<double> DP(N+1,0.0);\n\tDP[1]=1.0;\n\tcout<<fixed<<setprecision(15);\n\tfor(int n=2;n<=N;n++){\n\t\tdouble p=0.5;\n\t\tdouble q=1.0;\n\t\tfor(int j=1;j<min(70,n);j++){\n\t\t\tDP[n]+=q*(1.0-p)*(j+DP[n-j-1]);\n\t\t\tq*=p;\n\t\t\tp*=0.5;\n\t\t}\n\t\tDP[n]+=q*n;\n\t}\n\tcout<<DP[N]<<endl;\n}\n\nint main(){\n\t\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\t\n\tll N;\n\twhile(cin>>N,N!=0)solve(N);\n\t\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 4532,
"score_of_the_acc": -0.0923,
"final_rank": 4
},
{
"submission_id": "aoj_1056_9333636",
"code_snippet": "#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing P = pair<ll,ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\n#define ALL(x) (x).begin(),(x).end()\n#define sz(c) ((ll)(c).size())\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\n// #define MOD 1000000007\n#define MOD 998244353\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\" \"<<p.second;return os;}\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\n\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n cout << fixed << setprecision(20);\n while(1){\n int n;cin >> n;\n if(n == 0)break;\n vector<long double> dp(50);\n vector<long double> p(50);\n p[0] = 1;\n rep(i,n){\n vector<long double> DP(50);\n vector<long double> P(50);\n rep(j,50){\n if(dp[j] < 0)continue;\n if(j+1 < 50){\n DP[j+1] = (dp[j]+p[j])/(1ll << j);\n P[j+1] = p[j]/(1ll << j);\n }\n DP[0] += (1-1.0l/(1ll << j))*dp[j];\n P[0] += (1-1.0l/(1ll << j))*p[j];\n }\n swap(dp,DP);\n swap(p,P);\n }\n long double res = 0;\n rep(i,50)if(dp[i] >= 0)res += dp[i];\n cout << res << \"\\n\";\n }\n \n \n\n return 0;\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 3512,
"score_of_the_acc": -0.2933,
"final_rank": 7
},
{
"submission_id": "aoj_1056_8580348",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cassert>\n#include <chrono>\n#include <random>\n#include <set>\n#include <utility>\n#include <array>\n#include <bitset>\n#include <unordered_set>\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<vector<double>> dp(n+1, vector<double>(50, -1));\n vector<double> p(50); p[0] = 1;\n for (int i = 1; i < 50; ++i) {\n p[i] = p[i-1]/2;\n }\n auto cal = [&](auto cal, int i, int j) -> double {\n if (j >= 50) return cal(cal,i+1,0);\n if (i >= n) return 0;\n if (dp[i][j] != -1) return dp[i][j];\n double P = p[j];\n dp[i][j] = P*(1+cal(cal,i+1,j+1))+(1-P)*(cal(cal,i+1,0));\n return dp[i][j];\n };\n printf(\"%.9f\\n\", cal(cal,0,0));\n }\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 55336,
"score_of_the_acc": -0.9437,
"final_rank": 14
},
{
"submission_id": "aoj_1056_7359329",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll; typedef unsigned long long ull;\nconst int inf = 1e9; const ll llnf = 4e18;\n\ntemplate< class Tp > void chkmax( Tp &x , Tp y ) { x = max( x , y ); }\ntemplate< class Tp > void chkmin( Tp &x , Tp y ) { x = min( x , y ); }\n\nvoid solve( ) {\n\tconst int V = 1e5 , U = 100;\n\tvector< double > invpow2( V + 1 ); invpow2[0] = 1; for( int i = 1; i <= V; i ++ ) invpow2[i] = invpow2[i - 1] * 0.5;\n\n\tvector< vector< double > > f( V + 1 , vector< double >( U + 1 ) ); f[1][1] = 1;\n\tfor( int i = 2; i <= V; i ++ ) for( int j = 0; j <= U; j ++ ) {\n\t\tif( j + 1 <= U ) f[i][j + 1] += f[i - 1][j] * ( invpow2[j] );\n\t\tf[i][0] += f[i - 1][j] * ( 1 - invpow2[j] );\n\t}\n\n\tvector< double > g( V + 1 );\n\tfor( int i = 1; i <= V; i ++ ) { g[i] = g[i - 1]; for( int j = 1; j <= U; j ++ ) g[i] += f[i][j]; }\n\n\tint n; while( cin >> n && n ) cout << fixed << setprecision( 10 ) << g[n] << \"\\n\";\n}\n\nint main( ) {\n\tios::sync_with_stdio( 0 ), cin.tie( 0 ), cout.tie( 0 );\n\tint T = 1; while( T -- ) solve( ); return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 86604,
"score_of_the_acc": -1.0667,
"final_rank": 16
},
{
"submission_id": "aoj_1056_7340641",
"code_snippet": "/**\n * 百夜の悲しき、常闇に。\n * カヒコの来世を、統神に祷む。\n*/\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define inl inline\ntemplate <typename T> inl bool read (T &x) {\n\tx = 0; int f = 1; char c = getchar ();\n\tfor (; c != EOF && !isdigit (c); c = getchar ())\n\t\tif (c == '-') f = -1;\n\tif (c == EOF) return 0;\n\tfor (; c != EOF && isdigit (c); c = getchar ())\n\t\tx = (x<<1) + (x<<3) + (c^48);\n\tx *= f; return 1;\n}\ntemplate <typename T, typename... Targs>\ninl bool read (T &x, Targs&... args) {\n\treturn read (x) && read (args...); }\ntemplate <typename T> void print (T x) {\n\tif (x < 0) putchar ('-'), x = -x;\n\tif (x > 9) print (x / 10);\n\tputchar ('0' + x % 10);\n}\ntemplate <typename T, typename... Targs>\ninl void print (T x, Targs... args) {\n\tprint (x), putchar (' '), print (args...); }\n\n#define newl putchar('\\n')\ntypedef long long ll;\n// typedef unsigned long long ull;\n// typedef __int128 lll;\n// typedef long double llf;\ntypedef pair <int, int> pint;\n#define fst first\n#define scd second\n#define all(p) begin (p), end (p)\n#define empb emplace_back\nusing comp = complex <double>;\nusing vcomp = vector <comp>;\n\nconstexpr int N = 1e5 + 10, G = 1<<18;\nint n; double h[G], g[G]; vcomp f;\n\ninl void butterfly (vcomp &f, int l) {\n\tstatic int tr[G], last;\n\tif (last != l) { last = l;\n\t\tfor (int i = 1; i < 1<<l; ++i)\n\t\t\ttr[i] = tr[i>>1]>>1|(i & 1)*(1<<l-1);\n\t}\n\tfor (int i = 1; i < 1<<l; ++i)\n\t\tif (tr[i] < i) swap (f[i], f[tr[i]]);\n}\ntemplate <bool rev>\ninl void FFT (vcomp &f, int l) {\n\tf.resize (1<<l, 0); butterfly (f, l);\n\tfor (int len = 2; len <= 1<<l; len <<= 1) {\n\t\tconst comp w_n = exp (M_PI/len*2i);\n\t\tcomp g, h, w = 1;\n\t\tfor (int st = 0; st < 1<<l; st += len, w = 1)\n\t\t\tfor (int i = st; i < st+len/2; ++i, w *= w_n)\n\t\t\t\tg = f[i], h = f[i + len/2] * w,\n\t\t\t\tf[i] = g + h, f[i + len/2] = g - h;\n\t}\n\tif (!rev) return;\n\treverse (begin (f) + 1, end (f));\n\tfor (auto &x : f) x /= 1<<l;\n}\n#define clog2(x) (int) ceil (log2 (x))\n\ninl vcomp imple () {\n\tvcomp f { 0 }, _g, invg { -1 }, _h;\n\tfor (int w = 1; (1<<w-1) < 1e5; ++w) {\n\t\t_g = vcomp (g, g + (1<<w)),\n\t\t_h = vcomp (h, h + (1<<w));\n\t\tFFT <0> (f, w + 1); FFT <0> (_g, w + 1);\n\t\tFFT <0> (_h, w + 1); FFT <0> (invg, w + 1);\n\t\tfor (int i = 0; i < 1<<w+1; ++i)\n\t\t\tf[i] = f[i] - (f[i] * _g[i] + _h[i]) * invg[i],\n\t\t\tinvg[i] = 2.0 * invg[i] - invg[i] * invg[i] * _g[i];\n\t\tFFT <1> (f, w + 1);\n\t\tFFT <1> (invg, w + 1);\n\t\tfill (begin (f) + (1<<w), end (f), 0);\n\t\tfill (begin (invg) + (1<<w), end (invg), 0);\n\t}\n\treturn f.resize (1e5 + 1), f;\n}\n\nint main () {\n\t/* */\n\tdouble co, pre = 0;\n\tfor (int i = 1; i <= 1e5; ++i)\n\t\tg[i] = co = pow (2, (i - 1) * (1-i/2.0))\n\t\t\t- pow (2, i * (1.0 - i) / 2),\n\t\th[i] = (pre += co * (i-1)) + i * pow (2, (1.0-i)*i/2);\n\tg[0] = -1; f = imple ();\n\n\twhile (read (n), n)\n\t\tprintf (\"%.8lf\\n\", real (f[n]));\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 27472,
"score_of_the_acc": -0.5017,
"final_rank": 10
},
{
"submission_id": "aoj_1056_7340421",
"code_snippet": "/**\n * 百夜の悲しき、常闇に。\n * カヒコの来世を、統神に祷む。\n*/\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define inl inline\ntemplate <typename T> inl bool read (T &x) {\n\tx = 0; int f = 1; char c = getchar ();\n\tfor (; c != EOF && !isdigit (c); c = getchar ())\n\t\tif (c == '-') f = -1;\n\tif (c == EOF) return 0;\n\tfor (; c != EOF && isdigit (c); c = getchar ())\n\t\tx = (x<<1) + (x<<3) + (c^48);\n\tx *= f; return 1;\n}\ntemplate <typename T, typename... Targs>\ninl bool read (T &x, Targs&... args) {\n\treturn read (x) && read (args...); }\ntemplate <typename T> void print (T x) {\n\tif (x < 0) putchar ('-'), x = -x;\n\tif (x > 9) print (x / 10);\n\tputchar ('0' + x % 10);\n}\ntemplate <typename T, typename... Targs>\ninl void print (T x, Targs... args) {\n\tprint (x), putchar (' '), print (args...); }\n\n#define newl putchar('\\n')\ntypedef long long ll;\n// typedef unsigned long long ull;\n// typedef __int128 lll;\n// typedef long double llf;\ntypedef pair <int, int> pint;\n#define fst first\n#define scd second\n#define all(p) begin (p), end (p)\n#define empb emplace_back\nusing comp = complex <double>;\nusing vcomp = vector <comp>;\n\nconstexpr int N = 1e5 + 10, G = 1<<17;\nint n; comp f[N], g[N]; double h[N];\n\ninl void butterfly (vcomp &f, int l) {\n\tstatic int tr[G], last;\n\tif (last != l) { last = l;\n\t\tfor (int i = 1; i < 1<<l; ++i)\n\t\t\ttr[i] = tr[i>>1]>>1|(i & 1)*(1<<l-1);\n\t}\n\tfor (int i = 1; i < 1<<l; ++i)\n\t\tif (tr[i] < i) swap (f[i], f[tr[i]]);\n}\ntemplate <bool rev>\ninl void FFT (vcomp &f, int l) {\n\tf.resize (1<<l, 0); butterfly (f, l);\n\tfor (int len = 2; len <= 1<<l; len <<= 1) {\n\t\tconst comp w_n = exp (M_PI/len*2i);\n\t\tcomp g, h, w = 1;\n\t\tfor (int st = 0; st < 1<<l; st += len, w = 1)\n\t\t\tfor (int i = st; i < st+len/2; ++i, w *= w_n)\n\t\t\t\tg = f[i], h = f[i + len/2] * w,\n\t\t\t\tf[i] = g + h, f[i + len/2] = g - h;\n\t}\n\tif (!rev) return;\n\treverse (begin (f) + 1, end (f));\n\tfor (auto &x : f) x /= 1<<l;\n}\n#define clog2(x) (int) ceil (log2 (x))\n\ninl vcomp cyc_convo (const vcomp &f, const vcomp &g) {\n\tint n = max (f.size (), g.size ()), l = clog2 (n);\n\tvcomp _f = f, _g = g;\n\tFFT <0> (_f, l), FFT <0> (_g, l);\n\tfor (int i = 0; i < 1<<l; ++i) _f[i] *= _g[i];\n\tFFT <1> (_f, l);\n\treturn _f.resize (n), _f;\n}\n\nvoid cdq_dac (int l, int r) {\n\tif (l == r) { f[l] += h[l]; return; }\n\tint mid = l + r >> 1;\n\tcdq_dac (l, mid);\n\tvcomp _f (f + l, f + mid + 1),\n\t\t_g (g + 1, g + r-l+1);\n\t_g = cyc_convo (_f, _g);\n\tfor (int i = mid + 1; i <= r; ++i)\n\t\tf[i] += _g[i-l-1];\n\tcdq_dac (mid + 1, r);\n}\n\nint main () {\n\t/* */\n\tdouble co, pre = 0;\n\tfor (int i = 1; i <= 1e5; ++i)\n\t\tg[i] = co = pow (2, (i - 1) * (1-i/2.0))\n\t\t\t- pow (2, i * (1.0 - i) / 2),\n\t\th[i] = (pre += co * (i-1)) + i * pow (2, (1.0-i)*i/2);\n\tcdq_dac (0, 1e5);\n\twhile (read (n), n)\n\t\tprintf (\"%.8lf\\n\", real (f[n]));\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 16392,
"score_of_the_acc": -0.4217,
"final_rank": 9
},
{
"submission_id": "aoj_1056_6840163",
"code_snippet": "#ifndef HIDDEN_IN_VS // 折りたたみ用\n\n// 警告の抑制\n#define _CRT_SECURE_NO_WARNINGS\n\n// ライブラリの読み込み\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型名の短縮\nusing ll = long long; // -2^63 ～ 2^63 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）\nusing pii = pair<int, int>;\tusing pll = pair<ll, ll>;\tusing pil = pair<int, ll>;\tusing pli = pair<ll, int>;\nusing vi = vector<int>;\t\tusing vvi = vector<vi>;\t\tusing vvvi = vector<vvi>;\nusing vl = vector<ll>;\t\tusing vvl = vector<vl>;\t\tusing vvvl = vector<vvl>;\nusing vb = vector<bool>;\tusing vvb = vector<vb>;\t\tusing vvvb = vector<vvb>;\nusing vc = vector<char>;\tusing vvc = vector<vc>;\t\tusing vvvc = vector<vvc>;\nusing vd = vector<double>;\tusing vvd = vector<vd>;\t\tusing vvvd = vector<vvd>;\ntemplate <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\nusing Graph = vvi;\n\n// 定数の定義\nconst double PI = acos(-1);\nconst vi DX = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\nconst vi DY = { 0, 1, 0, -1 };\nint INF = 1001001001; ll INFL = 4004004004004004004LL;\ndouble EPS = 1e-16;\n\n// 入出力高速化\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;\n\n// 汎用マクロの定義\n#define all(a) (a).begin(), (a).end()\n#define sz(x) ((int)(x).size())\n#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))\n#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))\n#define Yes(b) {cout << ((b) ? \"Yes\\n\" : \"No\\n\");}\n#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順\n#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順\n#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順\n#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）\n#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）\n#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d ビット全探索（昇順）\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\n#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\n\n// 汎用関数の定義\ntemplate <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\n\n// 演算子オーバーロード\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 istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }\n\n// 手元環境（Visual Studio）\n#ifdef _MSC_VER\n#include \"local.hpp\"\n// 提出用（gcc）\n#else\ninline int popcount(int n) { return __builtin_popcount(n); }\ninline int popcount(ll n) { return __builtin_popcountll(n); }\ninline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\n#define gcd __gcd\n#define dump(...)\n#define dumpel(v)\n#define dump_list(v)\n#define input_from_file(f)\n#define output_to_file(f)\n#define Assert(b) { if (!(b)) while (1) cout << \"OLE\"; }\n#endif\n\n#endif // 折りたたみ用\n\n\n////--------------AtCoder 専用--------------\n//#include <atcoder/all>\n//using namespace atcoder;\n//\n//using mint = modint1000000007;\n////using mint = modint998244353;\n////using mint = modint; // mint::set_mod(m);\n//\n//istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\n//ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\n//using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;\n////----------------------------------------\n\n\nint main() {\n//\tinput_from_file(\"input.txt\");\n//\toutput_to_file(\"output.txt\");\n\n\twhile (true) {\n\t\tint n;\n\t\tcin >> n;\n\n\t\tif (n == 0) exit(0);\n\n\t\t// dp[i][j] : あと i 日で，いま j 日連続弁当を入手しているときの期待値\n\t\tvvd dp(n + 1 , vd(30));\n\n\t\trepi(i, 1, n) rep(j, 30) {\n\t\t\tdouble p = 1 / pow(2, 1. * j);\n\n\t\t\t// 弁当を入手出来る場合\n\t\t\tif (j < 29) dp[i][j] += (dp[i - 1][j + 1] + 1) * p;\n\n\t\t\t// 弁当を入手出来ない場合\n\t\t\tdp[i][j] += dp[i - 1][0] * (1 - p);\n\t\t}\n\t\tdumpel(dp);\n\n\t\tcout << dp[n][0] << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 490,
"memory_kb": 31032,
"score_of_the_acc": -0.9712,
"final_rank": 15
},
{
"submission_id": "aoj_1056_3931723",
"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\nlong double power(const long double base, const int exp) {\n\tswitch (exp) {\n\tcase 0: return 1;\n\tcase 1: return base;\n\tdefault: return power(base * base, exp / 2) * power(base, exp % 2);\n\t}\n}\nlong double cal_estimated(const int current, const int success, std::vector<std::vector<long double>>& memo) {\n\tif (current == memo.size()) return 0;\n\tif (success >= 30) return cal_estimated(current + 1, 0, memo);\n\tif (memo[current][success] >= 0) return memo[current][success];\n\treturn memo[current][success] = power(0.5, success) * (cal_estimated(current + 1, success + 1, memo) + 1) + (1 - power(0.5, success)) * cal_estimated(current + 1, 0, memo);\n}\n\nint main() {\n\tconstexpr int max_day = 100000;\n\tstd::vector<std::vector<long double>> memo(max_day, std::vector<long double>(30, -1));\n\tfor (auto i = 1; i < memo.size(); i += 100) cal_estimated(max_day - i, 0, memo);\n\twhile (true) {\n\t\tint n; std::cin >> n; if (n == 0) break;\n\t\tstd::cout << std::setprecision(5) << std::fixed << cal_estimated(max_day - n, 0, memo) << '\\n';\n\t}\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 53380,
"score_of_the_acc": -0.9202,
"final_rank": 13
},
{
"submission_id": "aoj_1056_3835969",
"code_snippet": "#include <iostream>\n#include <math.h>\n#include <stdio.h>\n\nusing namespace std;\n\nint n;\ndouble dp[100005][35];\n\nint main(void)\n{\n\twhile(1){\n\t\tcin >> n;\n\t\tif(n == 0) break;\n\t\t\n\t\tfor(int i = n-1; i >= 0; i--){\n\t\t\tfor(int j = 0; j < 35; j++){\n\t\t\t\tdouble p = pow(2, -j);\n\t\t\t\tdp[i][j] = (1-p) * dp[i+1][0];\n\t\t\t\tif(j+1 < 35) dp[i][j] += p * (dp[i+1][j+1]+1);\n\t\t\t}\n\t\t}\n\t\tprintf(\"%.11f\\n\", dp[0][0]);\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 720,
"memory_kb": 30592,
"score_of_the_acc": -1.2726,
"final_rank": 18
},
{
"submission_id": "aoj_1056_3802884",
"code_snippet": "#include <bits/stdc++.h>\n\nconst int maxn = 1e5 + 3, maxm = 12;\n\nint n;\ndouble dp[maxn][maxm], pr[maxn][maxm];\n\nint main() {\n while(scanf(\"%d\", &n) != EOF) {\n if(n == 0)\n return 0;\n memset(dp, 0, sizeof(dp[0]) * (n + 1));\n memset(pr, 0, sizeof(pr[0]) * (n + 1));\n pr[0][0] = 1.0;\n for(int i = 0; i < n; ++i) {\n for(int j = 0; j < maxm - 1; ++j) {\n dp[i + 1][j + 1] += (dp[i][j] + pr[i][j]) * pow(0.5, j);\n pr[i + 1][j + 1] += pr[i][j] * pow(0.5, j);\n }\n for(int j = 0; j < maxm; ++j) {\n dp[i + 1][0] += dp[i][j] * (1.0 - pow(0.5, j));\n pr[i + 1][0] += pr[i][j] * (1.0 - pow(0.5, j));\n }\n }\n printf(\"%.8f\\n\", std::accumulate(dp[n], dp[n] + maxm, 0.0));\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 760,
"memory_kb": 22088,
"score_of_the_acc": -1.2236,
"final_rank": 17
},
{
"submission_id": "aoj_1056_3321454",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\n\nconst int M = 20;\ndouble p[M];\ndouble pp[M];\n\nconst int N = 100010;\ndouble dp[N];\nbool vis[N];\n\nint n;\ndouble dfs(int d){\n if(vis[d]) return dp[d];\n if(d==n) return 0;\n\n double ret = 0;\n for(int j=1; j<M-1; ++j){\n if(d+j+1<=n) ret += p[j]*(1-pp[j+1])*(j + dfs(d+j+1));\n if(d+j==n) ret += p[j]*(j+ dfs(d+j));\n }\n\n vis[d] = true;\n return dp[d] = ret;\n}\n\nint main(){\n p[1] = 1;\n pp[1] = 1;\n for(int i=2; i<M; ++i){\n pp[i] = pp[i-1]/2;\n p[i] = p[i-1]*pp[i];\n }\n\n while(cin >>n,n){\n fill(vis,vis+N,false);\n printf(\"%.10f\\n\", dfs(0));\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 8716,
"score_of_the_acc": -0.076,
"final_rank": 2
},
{
"submission_id": "aoj_1056_3296060",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);i++)\n#define MOD 1000000007\n#define INF 0x3f3f3f3f\n#define INFL 0x3f3f3f3f3f3f3f3f\n#define EPS (1e-10)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int>P;\n\ndouble dp[300000][20];\ndouble ans[300000];\n\nint main(){\n\tdp[0][0]=1;\n\tdouble sum=0;\n\trep(i,200000){\n\t\tans[i]=sum;\n\t\trep(j,15){\n\t\t\tif(dp[i][j]==0)continue;\n\t\t\tdouble p=1;rep(k,j)p*=0.5;\n\t\t\tsum+=p*dp[i][j];\n\t\t\tdp[i+1][j+1]+=dp[i][j]*p;\n\t\t\tdp[i+1][0]+=dp[i][j]*(1-p);\n\t\t}\n\t}\n\tint n;\n\twhile(cin>>n,n){\n\t\tprintf(\"%.12lf\\n\",ans[n]);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 35820,
"score_of_the_acc": -0.3888,
"final_rank": 8
},
{
"submission_id": "aoj_1056_3283923",
"code_snippet": "// includes {{{\n#include<iostream>\n#include<iomanip>\n#include<algorithm>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<deque>\n#include<map>\n#include<set>\n#include<tuple>\n#include<cmath>\n#include<random>\n#include<cassert>\n// }}}\n// #include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nconst int N = 1e5;\nconst int C = 70;\n\ndouble dp[N + 1]; // i日目が「食べていない日」の最終日であるときのそれ\ndouble p[N + 1];\ndouble ans[N + 1];\n\nint main() {\n std::ios::sync_with_stdio(false), std::cin.tie(0);\n double p2[C], p2s[C];\n p2s[0] = p2[0] = 1;\n for(int i = 1; i < C; i++) p2[i] = p2[i-1] * .5;\n for(int i = 1; i < C; i++) p2s[i] = p2[i] * p2s[i-1];\n\n p[0] = 1;\n\n for(int i = 1; i <= N; i++) {\n for(int j = 1; j < C && i-j-1 >= 0; j++) if(p[i-j-1] > 0) {\n // j日間食べ続け，最後に食べない\n p[i] += p[i-j-1] * p2s[j-1] * (1 - p2[j]);\n dp[i] += (dp[i-j-1] / p[i-j-1] + j) * p[i-j-1] * p2s[j-1] * (1 - p2[j]);\n // j日間食べ続け，最後に食べない\n ans[i] += (dp[i-j-1] / p[i-j-1] + j + 1) * p[i-j-1] * p2s[j];\n }\n ans[i] += dp[i];\n if(p[i-1] > 0) ans[i] += (dp[i-1] / p[i-1] + 1) * p[i-1];\n }\n\n int n;\n cout << fixed << setprecision(10);\n while(cin >> n, n) {\n cout << ans[n] << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 5568,
"score_of_the_acc": -0.0914,
"final_rank": 3
},
{
"submission_id": "aoj_1056_2975103",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <map>\n#include <set>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <bitset>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <cassert>\n#include <iomanip>\nusing namespace std;\n\n#define Rep(b, e, i) for(int i = b; i <= e; i++)\n#define Repr(e, b, i) for(int i = e; i >= b; i--)\n#define rep(n, i) Rep(0, n-1, i)\n#define repr(n, i) Repr(n-1, 0, i)\n#define all(v) (v).begin(), (v).end()\n#define pb(v) push_back(v)\n#define uniq(v) (v).erase(unique(all(v)),(v).end())\n#define bitcnt(x) __builtin_popcount(x)\n#define fst first\n#define snd second\n#define Pqaz(T) priority_queue<T,vector<T>,greater<T>>\n#define Pqza(T) priority_queue<T>\n#define put(x) cout << x;\n#define putsp(x) cout << x << ' ';\n#define putln(x) cout << x << endl;\n#define ENJYU std::ios::sync_with_stdio(false);std::cin.tie(0);\n\ntypedef long long ll;\ntypedef pair<ll, ll> llP;\ntypedef pair<int, int> intP;\ntypedef complex<double> comp;\ntypedef vector <int> vec;\ntypedef vector <ll> vecll;\ntypedef vector <double> vecd;\ntypedef vector <vec> mat;\ntypedef vector <vecll> matll;\ntypedef vector <vecd> matd;\n\n//vector の中身を出力\ntemplate <class T>ostream &operator<<(ostream &o,const vector<T>&v)\n{o<<\"{\";for(int i=0;i<(int)v.size();i++)o<<(i>0?\", \":\"\")<<v[i];o<<\"}\";return o;}\n\nconst int MAX = 100010;\nconst double PI = 3.14159265358979323846;\nconst double EPS = 1e-12;\nconst int INF = 1<<29;\nconst ll INFL = 1e18;\nconst ll MOD = 1000000007;\n\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nint dx8[8]={1,0,-1,1,-1,1,0,-1};\nint dy8[8]={1,1,1,0,0,-1,-1,-1};\n\n//********************************template END****************************************//\n\nvoid solve(void){\n\n\n\tint M = 100, N;\n\tvecd ps(M, 1);\n\n\trep(M-1, i)\n\t{\n\t\tps[i+1] = ps[i] / 2;\n\t}\n\n\t//cout << ps << endl;\n\n\twhile(cin >> N && N)\n\t{\n\t\tmatd dp(N+1, vecd (M, 0));\n\n\t\tdp[0][0] = 1;\n\n\t\tdouble ans = 0;\n\n\t\trep(N, n) rep(M, m)\n\t\t{\n\t\t\tif (m == M-1)\n\t\t\t{\n\t\t\t\tdp[n+1][0] += dp[n][m];\n\t\t\t\tans += dp[n][m] * m;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tdouble p = ps[m];\n\n\t\t\tdp[n+1][m+1] += dp[n][m] * p;\n\t\t\tdp[n+1][0] += dp[n][m] * (1-p);\n\t\t\tans += dp[n][m] * (1-p) * m;\n\t\t}\n\n\t\trep(M, m)\n\t\t{\n\t\t\tans += dp[N][m] * m;\n\t\t}\n\n\t\tcout << fixed << setprecision(3) << ans << endl;\n\n\t}\n\n\n}\n\nint main(void){\n\tsolve();\n\t//cout << \"yui(*-v・)yui\" << endl;\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 84996,
"score_of_the_acc": -1.354,
"final_rank": 19
},
{
"submission_id": "aoj_1056_2692673",
"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};\nconst ll INF = 1001001001001001LL;\nconst ll MOD = 1000000007LL;\n\nconst int MAX_K = 15;\ndouble dp[2][MAX_K], ans[100010];\n\nsigned main() {\n dp[0][1] = ans[1] = 1.0;\n\n rep(i,0,100000) {\n int cur = i%2, nxt = cur^1;\n rep(j,0,MAX_K) {\n double P = pow(0.5, j);\n if(j+1 < MAX_K) dp[nxt][j+1] += P * dp[cur][j];\n dp[nxt][0] += (1 - P) * dp[cur][j];\n }\n fill(dp[cur], dp[cur] + MAX_K, 0.0);\n ans[i+2] = ans[i+1] + (1 - dp[nxt][0]);\n }\n \n while(1) {\n int N; scanf(\"%lld\", &N);\n if(N == 0) break;\n printf(\"%.12f\\n\", ans[N]);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 4132,
"score_of_the_acc": -0.0741,
"final_rank": 1
},
{
"submission_id": "aoj_1056_2686587",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cmath>\n#define rep(i, a, n) for(int i = a;i < n;i++)\nusing namespace std;\n \n \ndouble dp[100010][50];\ndouble ans[100010];\n \n \ndouble pow2(int i){\n return pow(2, -i);\n}\n \n \nvoid makeDP(){\n dp[1][1] = 1;\n ans[1] = 1;\n \n rep(i, 1, 100005){\n rep(j, 0, 49){\n dp[i+1][j+1] = dp[i][j]*pow2(j);\n ans[i+1] += dp[i+1][j+1];\n dp[i+1][0] += dp[i][j]-dp[i+1][j+1];\n }\n ans[i+1] += ans[i];\n }\n}\n \n \nint main(){\n int n;\n \n makeDP();\n \n while(cin >> n, n) cout << fixed << ans[n] << endl;\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 43220,
"score_of_the_acc": -0.7845,
"final_rank": 11
},
{
"submission_id": "aoj_1056_2686585",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cmath>\n#define rep(i, a, n) for(int i = a;i < n;i++)\nusing namespace std;\n \n \ndouble dp[100010][50]; //DPテーブル(dp[日数][確率の指数]) 多分指数は100も必要ない\ndouble ans[100010]; //n日間の間に弁当を獲得できる回数の期待値\n \n \ndouble pow2(int i){ //2^(-i)\n return pow(2, -i);\n}\n \n \nvoid makeDP(){ //DPテーブルを作成しansへ期待値を書き込む\n dp[1][1] = 1;\n ans[1] = 1;\n \n rep(i, 1, 100005){\n rep(j, 0, 49){\n dp[i+1][j+1] = dp[i][j]*pow2(j);\n ans[i+1] += dp[i+1][j+1]; //i+1日目に獲得できる期待値を足しておく\n dp[i+1][0] += dp[i][j]-dp[i+1][j+1];\n }\n ans[i+1] += ans[i]; //前日の期待値を足す\n }\n}\n \n \nint main(){\n int n;\n \n makeDP();\n \n while(cin >> n, n) cout << fixed << ans[n] << endl;\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 43084,
"score_of_the_acc": -0.7962,
"final_rank": 12
},
{
"submission_id": "aoj_1056_2678992",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cmath>\n#define rep(i, a, n) for(int i = a;i < n;i++)\nusing namespace std;\n\n\ndouble dp[100010][100];\ndouble ans[100010];\n\n\ndouble pow2(int i){\n\treturn pow(2, -i);\n}\n\n\nvoid makeDP(){\n\tdp[1][1] = 1;\n\tans[1] = 1;\n\n\trep(i, 1, 100005){\n\t\trep(j, 0, 99){\n\t\t\tdouble e = dp[i][j]*pow2(j);\n\t\t\tdp[i+1][j+1] += e;\n\t\t\tans[i+1] += e;\n\t\t\tdp[i+1][0] += dp[i][j]-e;\n\t\t}\n\t\tans[i+1] += ans[i];\n\t}\n}\n\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint n;\n\n\tmakeDP();\n\t\n\twhile(cin >> n, n) cout << fixed << ans[n] << endl;\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 510,
"memory_kb": 82308,
"score_of_the_acc": -1.615,
"final_rank": 20
},
{
"submission_id": "aoj_1056_2500533",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <algorithm>\n#include <string>\n#include <cstring>\n#include <vector>\n#include <queue>\n#include <set>\n#include <map>\n#include <cmath>\n#include <iomanip>\n#include <cassert>\n#include <bitset>\nusing namespace std;\n\ntypedef pair<int, int> P;\n#define rep(i, n) for (int i=0; i<(n); i++)\n#define all(c) (c).begin(), (c).end()\n#define uniq(c) c.erase(unique(all(c)), (c).end())\n#define _1 first\n#define _2 second\n#define pb push_back\n#define INF 1145141919\n#define MOD 1000000007\n\nint N;\ndouble dp[2][200];\ndouble ans[200000];\ndouble p[200];\n\nsigned main() {\n ios::sync_with_stdio(false); cin.tie(0);\n p[0] = 1;\n rep(i, 100-1) p[i+1] = p[i]*0.5;\n int L = 150000;\n int T = 150;\n dp[0][0] = 1;\n ans[0] = 0;\n double base = 0;\n rep(i, L) {\n rep(j, T) dp[1][j] = 0;\n dp[1][1] = dp[0][0];\n for (int j=1; j<T-1; j++) {\n // succ\n dp[1][j+1] += dp[0][j] * p[j];\n // fail\n dp[1][0] += (dp[0][j] * (1.0-p[j]));\n base += (dp[0][j] * (1.0-p[j])) * j;\n }\n ans[i+1] = base;\n rep(j, T) ans[i+1] += dp[1][j]*j;\n swap(dp[0], dp[1]);\n }\n\n while (cin >> N) {\n if (N == 0) break;\n cout << fixed << setprecision(20) << ans[N] << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 4420,
"score_of_the_acc": -0.1443,
"final_rank": 5
}
] |
aoj_1059_cpp
|
Problem I:
Mysterious Onslaught
In 2012, human beings have been exposed to fierce onslaught of unidentified mysterious extra-terrestrial creatures. We have exhaused because of the long war and can't regist against them any longer. Only you, an excellent wizard, can save us. Yes, it's time to stand up!
The enemies are dispatched to the earth with being aligned like an
n
*
n
square. Appearently some of them have already lost their fighting capabilities for some unexpected reason. You have invented a highest grade magic spell 'MYON' to defeat them all. An attack of this magic covers any rectangles (which is parallel to axis). Once you cast a spell "myon," then all the enemies which the magic covers will lose their fighting capabilities because of tremendous power of the magic. However, the magic seems to activate enemies' self-repairing circuit. Therefore if any enemy which have already lost its fighting capability is exposed to the magic, the enemy repossesses its fighting capability. You will win the war when all the enemies will lose their fighting capabilities.
Let me show an example. An array of enemies below have dispatched:
1 1 1 1 1
1 0 0 0 1
1 0 1 0 1
1 0 0 0 1
1 1 1 1 1
Here, '
0
' means an enemy that doesn't possess fighting capability, and '
1
' means an enemy that possesses.
First, you cast a spell "
myon
" with covering all the enemies, which results in;
0 0 0 0 0
0 1 1 1 0
0 1 0 1 0
0 1 1 1 0
0 0 0 0 0
Next, cast once again with covering central 3 * 3 enemies.
0 0 0 0 0
0 0 0 0 0
0 0 1 0 0
0 0 0 0 0
0 0 0 0 0
Now you can defeat them all by casting a spell covers remaining one. Therefore you can cast "
myonmyonmyon
," which is the shortest spell for this case.
You are given the information of the array. Please write a program that generates the shortest spell that can defeat them all.
Input
The first line of each test case has an integer
n
. Following
n
lines are information of an array of enemies. The format is same as described in the problem statement.
Input terminates when n = 0.
You may assume that one or more enemy have fighting capability.
Output
For each dataset, output the shortest spell.
Constraints
1 ≤
n
≤ 5
Sample Input
5
1 1 1 1 1
1 0 0 0 1
1 0 1 0 1
1 0 0 0 1
1 1 1 1 1
3
1 1 1
1 1 1
1 1 1
5
1 1 1 1 0
1 1 1 1 0
1 0 0 0 1
0 1 1 1 1
0 1 1 1 1
0
Output for the Sample Input
myonmyonmyon
myon
myonmyon
|
[
{
"submission_id": "aoj_1059_10852685",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <queue>\n#include <map>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\nstruct Node{\n int val, step;\n};\n\nmap<int, bool> flag;\nqueue<Node> q;\nint n;\n\nvoid getxy(int i, int &x, int &y) {\n x = i/n+1;\n y = i%n+1;\n}\n\nint getbin(int now, int sx, int sy, int ex, int ey) {\n for (int i=sx; i<=ex; ++i) {\n for (int j=sy; j<=ey; ++j) {\n int nochan = (i-1)*n+j-1;\n now = (now ^ (1<<nochan));\n }\n }\n return now;\n}\n\nvoid bfs(int x) {\n if (x==0) {\n printf(\"\\n\");\n return;\n }\n flag.clear();\n while (!q.empty()) q.pop();\n Node fir;\n flag[fir.val] = true;\n fir.val = x;\n fir.step = 0;\n q.push(fir);\n while (!q.empty()) {\n Node now = q.front();\n q.pop();\n for (int i=0; i<n*n; ++i) {\n if ((1<<i)&now.val) {\n int sx, sy;\n getxy(i, sx, sy);\n for (int ex = sx; ex<=n; ++ex) {\n for (int ey = sy; ey<=n; ++ey) {\n Node next;\n next.val = getbin(now.val, sx, sy, ex, ey);\n if (next.val == 0) {\n for (int j=1; j<=now.step+1; ++j) {\n printf(\"myon\");\n }\n printf(\"\\n\");\n return;\n }\n if (flag.count(next.val)==0) {\n flag[next.val] = true;\n next.step = now.step+1;\n q.push(next);\n }\n }\n }\n break;\n }\n }\n }\n}\n\nvoid doit() {\n int fir = 0;\n scanf(\"%d\", &n);\n if (n==0) exit(0);\n for (int i=1; i<=n; ++i) {\n for (int j=1; j<=n; ++j) {\n int temp;\n scanf(\"%d\", &temp);\n fir<<=1;\n fir+=temp;\n }\n }\n bfs(fir);\n}\n\nint main() {\n while (1) {\n doit();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1400,
"memory_kb": 13268,
"score_of_the_acc": -0.4516,
"final_rank": 9
},
{
"submission_id": "aoj_1059_10580535",
"code_snippet": "#pragma GCC optimize(\"O2\")\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ld = long double;\nusing pii = pair<int, int>;\n\nconst int N = 5;\nconst int M = 5;\nconst int AREA = N * M;\nconst int SIZE = 1 << AREA;\n\nchar dp[SIZE];\nvector<int> masks;\n\nvoid precalc() {\n for (int li = 0; li < N; ++li) {\n for (int ri = li; ri < N; ++ri) {\n for (int lj = 0; lj < M; ++lj) {\n for (int rj = lj; rj < M; ++rj) {\n int mask = 0;\n for (int i = li; i <= ri; ++i) {\n for (int j = lj; j <= rj; ++j) {\n mask |= 1 << (i * M + j);\n }\n }\n masks.push_back(mask);\n }\n }\n }\n }\n fill(dp, dp + SIZE, char(AREA));\n dp[0] = 0;\n for (int mask : masks) {\n for (int x = 0; x < SIZE; ++x) {\n int y = x ^ mask;\n if (x < y) {\n char ny = min<char>(dp[y], dp[x] + 1);\n char nx = min<char>(dp[x], dp[y] + 1);\n dp[x] = nx;\n dp[y] = ny;\n }\n }\n }\n}\n\nsigned main() {\n\n#ifdef LOCAL\n freopen(\"input.txt\", \"r\", stdin);\n#endif\n\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n\n precalc();\n\n for (int n; cin >> n;) {\n if (n == 0) break;\n int mask = 0;\n for (int i = 0; i < n; ++i) {\n for (int x, j = 0; j < n; ++j) {\n cin >> x;\n if (x) mask |= 1 << (i * M + j);\n }\n }\n char res = dp[mask];\n string s;\n for (int it = 0; it < res; ++it) s += \"myon\";\n cout << s << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 7410,
"memory_kb": 36128,
"score_of_the_acc": -1.8367,
"final_rank": 20
},
{
"submission_id": "aoj_1059_10580533",
"code_snippet": "#pragma GCC optimize(\"O3\")\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ld = long double;\nusing pii = pair<int, int>;\n\nconst int N = 5;\nconst int M = 5;\nconst int AREA = N * M;\nconst int SIZE = 1 << AREA;\n\nchar dp[SIZE];\nvector<int> masks;\n\nvoid precalc() {\n for (int li = 0; li < N; ++li) {\n for (int ri = li; ri < N; ++ri) {\n for (int lj = 0; lj < M; ++lj) {\n for (int rj = lj; rj < M; ++rj) {\n int mask = 0;\n for (int i = li; i <= ri; ++i) {\n for (int j = lj; j <= rj; ++j) {\n mask |= 1 << (i * M + j);\n }\n }\n masks.push_back(mask);\n }\n }\n }\n }\n fill(dp, dp + SIZE, char(AREA));\n dp[0] = 0;\n for (int mask : masks) {\n for (int x = 0; x < SIZE; ++x) {\n int y = x ^ mask;\n if (x < y) {\n char ny = min<char>(dp[y], dp[x] + 1);\n char nx = min<char>(dp[x], dp[y] + 1);\n dp[x] = nx;\n dp[y] = ny;\n }\n }\n }\n}\n\nsigned main() {\n\n#ifdef LOCAL\n freopen(\"input.txt\", \"r\", stdin);\n#endif\n\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n\n precalc();\n\n for (int n; cin >> n;) {\n if (n == 0) break;\n int mask = 0;\n for (int i = 0; i < n; ++i) {\n for (int x, j = 0; j < n; ++j) {\n cin >> x;\n if (x) mask |= 1 << (i * M + j);\n }\n }\n char res = dp[mask];\n string s;\n for (int it = 0; it < res; ++it) s += \"myon\";\n cout << s << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 7420,
"memory_kb": 35920,
"score_of_the_acc": -1.8332,
"final_rank": 19
},
{
"submission_id": "aoj_1059_5974152",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\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\n\n\n#define NUM 30\n#define MAX 20\n#define MAX2 26\n#define MAX_DEPTH 3\n\nstruct Info{\n\tInfo(){\n\n\t\tstate = count = 0;\n\t}\n\tInfo(int arg_state,char arg_count){\n\t\tstate = arg_state;\n\t\tcount = arg_count;\n\t}\n\tbool operator<(const struct Info& arg) const{\n\n\t\treturn count > arg.count; //昇順(PQ)\n\t}\n\tint state;\n\tchar count;\n};\n\n\nint POW[MAX2+1];\nchar D[5][1 << 17];\nchar min_dist[1 << 21];\nchar dp[1 << 26];\nchar ANS;\n\n\nvoid dfs(int state,char depth){\n\tif(ANS <= depth)return;\n\n\tint table[5][5];\n\n\tfor(int loop = 0; loop < 5*5; loop++){\n\t\tint row = loop/5;\n\t\tint col = loop%5;\n\t\tif(state&POW[loop]){\n\n\t\t\ttable[row][col] = 1;\n\n\t\t}else{\n\n\t\t\ttable[row][col] = 0;\n\t\t}\n\t}\n\n\tbool FLG = false;\n\tint pos;\n\n\tfor(int col = 0; col < 5; col++){\n\t\tif(table[0][col] == 1){\n\t\t\tpos = col;\n\t\t\tFLG = true;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(!FLG){ //1行目に1がない\n\n\t\tint tmp_state = 0;\n\t\tfor(int row = 1; row < 5; row++){\n\t\t\tfor(int col = 0; col < 5; col++){\n\t\t\t\tif(table[row][col] == 1){\n\n\t\t\t\t\ttmp_state += POW[5*(row-1)+col];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\n\t\tif(ANS > depth+min_dist[tmp_state]){\n\t\t\tANS = depth+min_dist[tmp_state];\n\t\t}\n\t\treturn;\n\t}\n\n\tif(depth == MAX_DEPTH)return;\n\n\tfor(int base_row = 0; base_row <= 0; base_row++){ //長方形の上端は1行目で固定\n\t\tfor(int base_col = 0; base_col <= pos; base_col++){ //一番左上の1を必ず含むとする\n\t\t\tfor(int h = 1; h <= 5; h++){\n\t\t\t\tfor(int w = pos-base_col+1; base_col+w-1 < 5;w++){ //★★★-1するのに注意★★★\n\t\t\t\t\tint next_state = state;\n\t\t\t\t\tfor(int row = 0; row < h; row++){\n\t\t\t\t\t\tfor(int col = base_col; col < base_col+w; col++){\n\t\t\t\t\t\t\tif(table[row][col] == 1){\n\n\t\t\t\t\t\t\t\tnext_state -= POW[5*row+col];\n\t\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\t\tnext_state += POW[5*row+col];\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\tdfs(next_state,depth+1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n}\n\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i <= MAX2; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\t//■2*2～4*4\n\t{\n\n\t\tfor(int len = 2; len <= 4; len++){\n\n\t\t\tint H = len;\n\t\t\tint W = len;\n\n\t\t\tD[len][0] = 0;\n\t\t\tfor(int state = 1; state < POW[H*W]; state++){\n\n\t\t\t\tD[len][state] = NUM;\n\t\t\t}\n\n\t\t\tpriority_queue<Info> Q;\n\t\t\tQ.push(Info(0,0));\n\n\t\t\twhile(!Q.empty()){\n\n\t\t\t\tInfo info = Q.top();\n\t\t\t\tQ.pop();\n\n\t\t\t\tif(info.count > D[len][info.state])continue;\n\n\t\t\t\tint table[H][W];\n\n\t\t\t\tfor(int loop = 0; loop < H*W; loop++){\n\t\t\t\t\tint row = loop/W;\n\t\t\t\t\tint col = loop%W;\n\t\t\t\t\tif(info.state&POW[loop]){\n\n\t\t\t\t\t\ttable[row][col] = 1;\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\ttable[row][col] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tfor(int base_row = 0; base_row < H; base_row++){\n\t\t\t\t\tfor(int base_col = 0; base_col < W; base_col++){\n\t\t\t\t\t\tfor(int h = 1; base_row+h-1 < H; h++){\n\t\t\t\t\t\t\tfor(int w = 1; base_col+w-1 < W; w++){\n\n\t\t\t\t\t\t\t\tint next_state = info.state;\n\t\t\t\t\t\t\t\tfor(int row = base_row; row < base_row+h; row++){\n\t\t\t\t\t\t\t\t\tfor(int col = base_col; col < base_col+w; col++){\n\t\t\t\t\t\t\t\t\t\tif(table[row][col] == 1){\n\n\t\t\t\t\t\t\t\t\t\t\tnext_state -= POW[W*row+col];\n\t\t\t\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\t\t\t\tnext_state += POW[W*row+col];\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\n\t\t\t\t\t\t\t\tif(D[len][next_state] > info.count+1){\n\t\t\t\t\t\t\t\t\tD[len][next_state] = info.count+1;\n\t\t\t\t\t\t\t\t\tQ.push(Info(next_state,info.count+1));\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\n\t//■5*5\n\t{\n\n\t\tfor(int state = 0; state < POW[4*5]; state++){\n\n\t\t\tmin_dist[state] = NUM; //状態0から、その状態になるまでの最短距離\n\t\t}\n\t\tmin_dist[0] = 0;\n\n\t\tpriority_queue<Info> Q;\n\t\tQ.push(Info(0,0));\n\n\t\t//2行目以上の状態を前計算\n\t\twhile(!Q.empty()){\n\n\t\t\tInfo info = Q.top();\n\t\t\tQ.pop();\n\n\t\t\tif(info.count > min_dist[info.state])continue;\n\n\t\t\t/*■■下4行を前計算■■*/\n\t\t\tint table[4][5];\n\n\t\t\tfor(int loop = 0; loop < 4*5; loop++){\n\t\t\t\tint row = loop/5;\n\t\t\t\tint col = loop%5;\n\t\t\t\tif(info.state&POW[loop]){\n\n\t\t\t\t\ttable[row][col] = 1;\n\n\t\t\t\t}else{\n\n\t\t\t\t\ttable[row][col] = 0;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(int base_row = 0; base_row < 4; base_row++){\n\t\t\t\tfor(int base_col = 0; base_col < 5; base_col++){\n\t\t\t\t\tfor(int h = 1; base_row+h-1 < 4; h++){\n\t\t\t\t\t\tfor(int w = 1; base_col+w-1 < 5; w++){\n\n\t\t\t\t\t\t\tint next_state = info.state;\n\t\t\t\t\t\t\tfor(int row = base_row; row < base_row+h; row++){\n\t\t\t\t\t\t\t\tfor(int col = base_col; col < base_col+w; col++){\n\t\t\t\t\t\t\t\t\tif(table[row][col] == 1){\n\n\t\t\t\t\t\t\t\t\t\tnext_state -= POW[5*row+col];\n\t\t\t\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\t\t\t\tnext_state += POW[5*row+col];\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\n\t\t\t\t\t\t\tif(min_dist[next_state] > info.count+1){\n\t\t\t\t\t\t\t\tmin_dist[next_state] = info.count+1;\n\t\t\t\t\t\t\t\tQ.push(Info(next_state,info.count+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}\n\n\t\tfor(int state = 0; state < POW[5*5]; state++){\n\n\t\t\tdp[state] = 30;\n\t\t}\n\n\t\tdp[0] = 0;\n\t\tfor(int state = 1; state < POW[4*5]; state++){\n\n\t\t\tdp[state*POW[5]] = min_dist[state];\n\t\t}\n\t}\n\n\tint N;\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tif(N == 1){\n\n\t\t\tint tmp;\n\t\t\tscanf(\"%d\",&tmp);\n\n\t\t\tprintf(\"myon\\n\");\n\n\t\t}else{\n\n\t\t\tint input[N][N];\n\t\t\tint state = 0;\n\n\t\t\tfor(int row = 0; row < N; row++){\n\t\t\t\tfor(int col = 0; col < N; col++){\n\n\t\t\t\t\tscanf(\"%d\",&input[row][col]);\n\t\t\t\t\tif(input[row][col] == 1){\n\n\t\t\t\t\t\tstate += POW[N*row+col];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint count;\n\n\t\t\tif(N >= 2 && N<=4){\n\n\t\t\t\tcount = D[N][state];\n\n\t\t\t}else{\n\n\t\t\t\tANS = NUM;\n\n\t\t\t\tdfs(state,0);\n\t\t\t\tcount = ANS;\n\t\t\t}\n\n\t\t\tfor(int a = 0; a < count; a++){\n\n\t\t\t\tprintf(\"myon\");\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 3400,
"memory_kb": 42908,
"score_of_the_acc": -1.4385,
"final_rank": 16
},
{
"submission_id": "aoj_1059_5974148",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\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\n\n\n#define NUM 30\n#define MAX 20\n#define MAX2 26\n#define MAX_DEPTH 3\n\nstruct Info{\n\tInfo(){\n\n\t\tstate = count = 0;\n\t}\n\tInfo(int arg_state,char arg_count){\n\t\tstate = arg_state;\n\t\tcount = arg_count;\n\t}\n\tbool operator<(const struct Info& arg) const{\n\n\t\treturn count > arg.count; //昇順(PQ)\n\t}\n\tint state;\n\tchar count;\n};\n\n\nint POW[MAX2+1];\nchar D[5][1 << 17];\nchar min_dist[1 << 21];\nchar dp[1 << 26];\nchar ANS;\n\n\nvoid dfs(int state,char depth){\n\tif(ANS <= depth)return;\n\n\tint table[5][5];\n\n\tfor(int loop = 0; loop < 5*5; loop++){\n\t\tint row = loop/5;\n\t\tint col = loop%5;\n\t\tif(state&POW[loop]){\n\n\t\t\ttable[row][col] = 1;\n\n\t\t}else{\n\n\t\t\ttable[row][col] = 0;\n\t\t}\n\t}\n\n\tbool FLG = false;\n\tint pos;\n\n\tfor(int col = 0; col < 5; col++){\n\t\tif(table[0][col] == 1){\n\t\t\tpos = col;\n\t\t\tFLG = true;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(!FLG){ //1行目に1がない\n\n\t\tint tmp_state = 0;\n\t\tfor(int row = 1; row < 5; row++){\n\t\t\tfor(int col = 0; col < 5; col++){\n\t\t\t\tif(table[row][col] == 1){\n\n\t\t\t\t\ttmp_state += POW[5*(row-1)+col];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\n\t\tif(ANS > depth+min_dist[tmp_state]){\n\t\t\tANS = depth+min_dist[tmp_state];\n\t\t}\n\t\treturn;\n\t}\n\n\tif(depth == MAX_DEPTH)return;\n\n\tfor(int base_row = 0; base_row <= 0; base_row++){\n\t\tfor(int base_col = 0; base_col <= pos; base_col++){\n\t\t//for(int base_col = 0; base_col < 5; base_col++){\n\t\t\tfor(int h = 1; h <= 5; h++){\n\t\t\t\tfor(int w = pos-base_col+1; base_col+w-1 < 5;w++){\n\t\t\t\t//for(int w = 1; base_col+w-1 < 5; w++){\n\t\t\t\t\tint next_state = state;\n\t\t\t\t\tfor(int row = 0; row < h; row++){\n\t\t\t\t\t\tfor(int col = base_col; col < base_col+w; col++){\n\t\t\t\t\t\t\tif(table[row][col] == 1){\n\n\t\t\t\t\t\t\t\tnext_state -= POW[5*row+col];\n\t\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\t\tnext_state += POW[5*row+col];\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\tdfs(next_state,depth+1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n}\n\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i <= MAX2; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\t//■2*2～4*4\n\t{\n\n\t\tfor(int len = 2; len <= 4; len++){\n\n\t\t\tint H = len;\n\t\t\tint W = len;\n\n\t\t\tD[len][0] = 0;\n\t\t\tfor(int state = 1; state < POW[H*W]; state++){\n\n\t\t\t\tD[len][state] = NUM;\n\t\t\t}\n\n\t\t\tpriority_queue<Info> Q;\n\t\t\tQ.push(Info(0,0));\n\n\t\t\twhile(!Q.empty()){\n\n\t\t\t\tInfo info = Q.top();\n\t\t\t\tQ.pop();\n\n\t\t\t\tif(info.count > D[len][info.state])continue;\n\n\t\t\t\tint table[H][W];\n\n\t\t\t\tfor(int loop = 0; loop < H*W; loop++){\n\t\t\t\t\tint row = loop/W;\n\t\t\t\t\tint col = loop%W;\n\t\t\t\t\tif(info.state&POW[loop]){\n\n\t\t\t\t\t\ttable[row][col] = 1;\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\ttable[row][col] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tfor(int base_row = 0; base_row < H; base_row++){\n\t\t\t\t\tfor(int base_col = 0; base_col < W; base_col++){\n\t\t\t\t\t\tfor(int h = 1; base_row+h-1 < H; h++){\n\t\t\t\t\t\t\tfor(int w = 1; base_col+w-1 < W; w++){\n\n\t\t\t\t\t\t\t\tint next_state = info.state;\n\t\t\t\t\t\t\t\tfor(int row = base_row; row < base_row+h; row++){\n\t\t\t\t\t\t\t\t\tfor(int col = base_col; col < base_col+w; col++){\n\t\t\t\t\t\t\t\t\t\tif(table[row][col] == 1){\n\n\t\t\t\t\t\t\t\t\t\t\tnext_state -= POW[W*row+col];\n\t\t\t\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\t\t\t\tnext_state += POW[W*row+col];\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\n\t\t\t\t\t\t\t\tif(D[len][next_state] > info.count+1){\n\t\t\t\t\t\t\t\t\tD[len][next_state] = info.count+1;\n\t\t\t\t\t\t\t\t\tQ.push(Info(next_state,info.count+1));\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\n\t//■5*5\n\t{\n\n\t\tfor(int state = 0; state < POW[4*5]; state++){\n\n\t\t\tmin_dist[state] = NUM; //状態0から、その状態になるまでの最短きょり\n\t\t}\n\t\tmin_dist[0] = 0;\n\n\t\tpriority_queue<Info> Q;\n\t\tQ.push(Info(0,0));\n\n\t\t//2行目以上の状態を前計算\n\t\twhile(!Q.empty()){\n\n\t\t\tInfo info = Q.top();\n\t\t\tQ.pop();\n\n\t\t\tif(info.count > min_dist[info.state])continue;\n\n\t\t\t/*■■下4行を前計算■■*/\n\t\t\tint table[4][5];\n\n\t\t\tfor(int loop = 0; loop < 4*5; loop++){\n\t\t\t\tint row = loop/5;\n\t\t\t\tint col = loop%5;\n\t\t\t\tif(info.state&POW[loop]){\n\n\t\t\t\t\ttable[row][col] = 1;\n\n\t\t\t\t}else{\n\n\t\t\t\t\ttable[row][col] = 0;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(int base_row = 0; base_row < 4; base_row++){\n\t\t\t\tfor(int base_col = 0; base_col < 5; base_col++){\n\t\t\t\t\tfor(int h = 1; base_row+h-1 < 4; h++){\n\t\t\t\t\t\tfor(int w = 1; base_col+w-1 < 5; w++){\n\n\t\t\t\t\t\t\tint next_state = info.state;\n\t\t\t\t\t\t\tfor(int row = base_row; row < base_row+h; row++){\n\t\t\t\t\t\t\t\tfor(int col = base_col; col < base_col+w; col++){\n\t\t\t\t\t\t\t\t\tif(table[row][col] == 1){\n\n\t\t\t\t\t\t\t\t\t\tnext_state -= POW[5*row+col];\n\t\t\t\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\t\t\t\tnext_state += POW[5*row+col];\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\n\t\t\t\t\t\t\tif(min_dist[next_state] > info.count+1){\n\t\t\t\t\t\t\t\tmin_dist[next_state] = info.count+1;\n\t\t\t\t\t\t\t\tQ.push(Info(next_state,info.count+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}\n\n\t\tfor(int state = 0; state < POW[5*5]; state++){\n\n\t\t\tdp[state] = 30;\n\t\t}\n\n\t\tdp[0] = 0;\n\t\tfor(int state = 1; state < POW[4*5]; state++){\n\n\t\t\tdp[state*POW[5]] = min_dist[state];\n\t\t}\n\t}\n\n\tint N;\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tif(N == 1){\n\n\t\t\tint tmp;\n\t\t\tscanf(\"%d\",&tmp);\n\n\t\t\tprintf(\"myon\\n\");\n\n\t\t}else{\n\n\t\t\tint input[N][N];\n\t\t\tint state = 0;\n\n\t\t\tfor(int row = 0; row < N; row++){\n\t\t\t\tfor(int col = 0; col < N; col++){\n\n\t\t\t\t\tscanf(\"%d\",&input[row][col]);\n\t\t\t\t\tif(input[row][col] == 1){\n\n\t\t\t\t\t\tstate += POW[N*row+col];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint count;\n\n\t\t\tif(N >= 2 && N<=4){\n\n\t\t\t\tcount = D[N][state];\n\t\t\t\t//printf(\"count:%d\\n\",count);\n\n\t\t\t}else{\n\n\t\t\t\tANS = NUM;\n\n\t\t\t\tdfs(state,0);\n\t\t\t\tcount = ANS;\n\t\t\t}\n\n\t\t\tfor(int a = 0; a < count; a++){\n\n\t\t\t\tprintf(\"myon\");\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t}\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 3410,
"memory_kb": 42856,
"score_of_the_acc": -1.4387,
"final_rank": 17
},
{
"submission_id": "aoj_1059_2400997",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef vector<vector<int>> vii;\n//\n\n int h(const vector<vector<int>> &x) {\n const int C = 997; // ???f??????\n size_t t = 0;\n for (int i = 0; i != x.size(); ++i) {\n for (int j = 0; j < x[i].size(); ++j) {\n t = t * 2 + x[i][j];\n }\n }\n return t;\n }\n\nvector<map<int,int>>memo(6);\n \nint N; \nint solve(const vii &field){\n if(memo[field.size()].find(h(field))==memo[field.size()].end()){\n for(int y=0;y<field.size();++y){\n for(int x=0;x<field[y].size();++x){\n if(field[y][x]){\n int ans=100;\n for(int xsz=1;xsz<=N-x;++xsz){\n for(int ysz=1;ysz<=N-y;++ysz){\n vii nextfield(field);\n for(int dy=0;dy<ysz;++dy){\n for(int dx=0;dx<xsz;++dx){\n int nexty=y+dy;\n int nextx=x+dx;\n nextfield[nexty][nextx]=!nextfield[nexty][nextx];\n }\n }\n ans=min(ans,1+solve(nextfield));\n }\n }\n return memo[field.size()][h(field)]=ans;\n }\n }\n }\n return memo[field.size()][h(field)]=0;\n }\n return memo[field.size()][h(field)];\n}\nint main(){\n while(true){\n cin>>N;\n if(!N)break;\n vii field(N,vector<int>(N));\n for(int i=0;i<N;++i){\n for(int j=0;j<N;++j){\n cin>>field[i][j];\n }\n }\n int ans=solve(field);\n for(int i=0;i<ans;++i){\n cout<<\"myon\";\n }\n cout<<endl;\n \n }\n return 0;\n \n}",
"accuracy": 1,
"time_ms": 4230,
"memory_kb": 39212,
"score_of_the_acc": -1.4662,
"final_rank": 18
},
{
"submission_id": "aoj_1059_1160180",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nint solve(int x,const vi& ms,vector<int8_t>& memo)\n{\n\tif(memo[x]!=-1) return memo[x];\n\t\n\tif(x==0) return memo[x]=0;\n\tint res=INF;\n\tfor(int m:ms) if(__builtin_ctz(x)==__builtin_ctz(m))\n\t\tres=min(res,solve(x^m,ms,memo));\n\treturn memo[x]=res+1;\n}\n\nint main()\n{\n\tvi ms;\n\trep(t,5) repi(b,t,5) rep(l,5) repi(r,l,5){\n\t\tint m=0;\n\t\trepi(i,t,b+1) repi(j,l,r+1) m|=1<<(i*5+j);\n\t\tms.push_back(m);\n\t}\n\tvector<int8_t> memo(1<<25,-1);\n\t\n\tfor(int n;cin>>n && n;){\n\t\tint x=0;\n\t\trep(i,n) rep(j,n){\n\t\t\tint b; cin>>b;\n\t\t\tx|=b<<(i*5+j);\n\t\t}\n\t\t\n\t\tint res=solve(x,ms,memo);\n\t\trep(i,res) cout<<string(\"myon\"); cout<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 410,
"memory_kb": 33772,
"score_of_the_acc": -0.8028,
"final_rank": 12
},
{
"submission_id": "aoj_1059_1160173",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nint solve(int x,const vi& ms,unordered_map<int,int>& memo)\n{\n\tauto i=memo.find(x);\n\tif(i!=end(memo)) return i->second;\n\t\n\tif(x==0) return memo[x]=0;\n\tint res=INF;\n\tfor(int m:ms) if(__builtin_ctz(x)==__builtin_ctz(m))\n\t\tres=min(res,solve(x^m,ms,memo));\n\treturn memo[x]=res+1;\n}\n\nint main()\n{\n\tvi ms;\n\trep(t,5) repi(b,t,5) rep(l,5) repi(r,l,5){\n\t\tint m=0;\n\t\trepi(i,t,b+1) repi(j,l,r+1) m|=1<<(i*5+j);\n\t\tms.push_back(m);\n\t}\n\tunordered_map<int,int> memo;\n\t\n\tfor(int n;cin>>n && n;){\n\t\tint x=0;\n\t\trep(i,n) rep(j,n){\n\t\t\tint b; cin>>b;\n\t\t\tx|=b<<(i*5+j);\n\t\t}\n\t\t\n\t\tint res=solve(x,ms,memo);\n\t\trep(i,res) cout<<string(\"myon\"); cout<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 860,
"memory_kb": 42364,
"score_of_the_acc": -1.0708,
"final_rank": 14
},
{
"submission_id": "aoj_1059_1160160",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconst int INF=1e9;\nconst int MOD=1e9+7;\nconst double EPS=1e-9;\n\ninline int ctz(uint x)\n{\n\tint i=0;\n\tif(!(x&0x0000ffff)) i+=16,x>>=16;\n\tif(!(x&0x000000ff)) i+=8,x>>=8;\n\tif(!(x&0x0000000f)) i+=4,x>>=4;\n\tif(!(x&0x00000003)) i+=2,x>>=2;\n\tif(!(x&0x00000001)) i+=1,x>>=1;\n\treturn i+!x;\n}\n\nint solve(int x0)\n{\n\tstatic array<int,225> ms;\n\t{\n\t\tint k=0;\n\t\trep(t,5) repi(b,t,5) rep(l,5) repi(r,l,5){\n\t\t\tint m=0;\n\t\t\trepi(i,t,b+1) repi(j,l,r+1) m|=1<<(i*5+j);\n\t\t\tms[k++]=m;\n\t\t}\n\t}\n\t\n\tqueue<tuple<int,int>> q; q.emplace(x0,0);\n\tunordered_set<int> vis;\n\twhile(q.size()){\n\t\tint x,c; tie(x,c)=q.front(); q.pop();\n\t\tif(x==0) return c;\n\t\tif(!vis.insert(x).second) continue;\n\t\tfor(int m:ms) if(ctz(x)==ctz(m))\n\t\t\tq.emplace(x^m,c+1);\n\t}\n\treturn -1;\n}\n\nint main()\n{\n\tfor(int n;cin>>n && n;){\n\t\tint x0=0;\n\t\trep(i,n) rep(j,n){\n\t\t\tint b; cin>>b;\n\t\t\tx0|=b<<(i*5+j);\n\t\t}\n\t\tstring res;\n\t\tper(_,solve(x0)) res+=\"myon\";\n\t\tcout<<res<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 3430,
"memory_kb": 18776,
"score_of_the_acc": -0.8666,
"final_rank": 13
},
{
"submission_id": "aoj_1059_1136151",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint b[6][6];\nint rec[6][6][6][6];\nint n;\nint solve(int p,int q,int t,int c){\n\tif(t==0){\n\t\tif(c)return 0;\n\t\treturn 1;\n\t}\n\tif(p==n)return 0;\n\tif(q==n)return solve(p+1,0,t,c);\n\tif(!(c&(1<<(p*n+q))))return solve(p,q+1,t,c);\n\tfor(int h=q;h<n;h++){\n\t\tfor(int i=p;i<n;i++){\n\t\t\tif(solve(p,q+1,t-1,c^rec[p][q][i][h]))return 1;\n\t\t}\n\t}\n\treturn 0;\n}\nint main(){\n\tint a;\n\twhile(scanf(\"%d\",&a),a){\n\t\tn=a;\n\t\tfor(int i=0;i<6;i++)for(int j=0;j<6;j++)for(int k=0;k<6;k++)for(int l=0;l<6;l++)\n\t\t\trec[i][j][k][l]=0;\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<a;j++){\n\t\t\tfor(int k=i;k<a;k++)for(int l=j;l<a;l++){\n\t\t\t\tfor(int x=i;x<=k;x++)for(int y=j;y<=l;y++)\n\t\t\t\t\trec[i][j][k][l]+=(1<<(x*a+y));\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<a;j++)scanf(\"%d\",&b[i][j]);\n\t\tint st=0;\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<a;j++)if(b[i][j])st+=(1<<(i*a+j));\n\t\tfor(int i=1;;i++){\n\t\t\tif(solve(0,0,i,st)){\n\t\t\t\tfor(int j=0;j<i;j++)printf(\"myon\");\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": 3940,
"memory_kb": 1020,
"score_of_the_acc": -0.514,
"final_rank": 10
},
{
"submission_id": "aoj_1059_779883",
"code_snippet": "#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<bitset>\n#include<queue>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<29)\n#define MAX (1<<20)\nusing namespace std;\n\nstruct P\n{\n int state,cost;\n P(int state=inf,int cost=inf):state(state),cost(cost){}\n bool operator < (const P& a)const\n {\n return cost > a.cost;\n }\n};\n\nshort mincost[MAX];\nshort mincost5[1<<5];\nint rect[5][5][5][5];\n\n\nvoid init()\n{\n rep(i,MAX)mincost[i] = 25;\n rep(i,5)rep(j,5)rep(k,5)rep(l,5)rect[i][j][k][l] = 0;\n}\n\nvoid makeRect()\n{\n rep(y1,5)rep(x1,5)//top-left\n REP(y2,y1,5)REP(x2,x1,5)//bottom-right\n REP(y,y1,y2+1)REP(x,x1,x2+1)\n rect[y1][x1][y2][x2] |= (1<<(y*5+x));\n}\n\nvoid makeMincost()\n{\n mincost[0] = 0;\n priority_queue<P> que;\n que.push(P(0,0));\n\n while(!que.empty())\n {\n P p = que.top(); que.pop();\n\n rep(y1,4)rep(x1,5)\n\tREP(y2,y1,4)REP(x2,x1,5)\n\t{\n\t int nstate = p.state ^ rect[y1][x1][y2][x2];\n\t if(mincost[nstate] > p.cost + 1)\n\t {\n\t mincost[nstate] = p.cost + 1;\n\t que.push(P(nstate,p.cost+1));\n\t }\n\t}\n }\n\n}\n\nvoid print(int f)\n{\n bitset<25> ff(f);\n rep(i,5)\n {\n cout << i << \" : \";\n rep(j,5)\n\t{\n\t cout << ff[i*5+j] << \" \";\n\t}\n cout << endl;\n }\n cout << endl;\n}\n\nvoid dfs(int state,int cur,int cost,int &ans)\n{\n if(state < (1<<20))ans = min(ans,cost + mincost[state]);\n if(cost >= ans)return;\n if(cur >= 3)return;\n\n rep(y1,5)rep(x1,5)REP(x,x1,5)\n {\n int nstate = state ^ rect[y1][x1][4][x];\n int nstate5 = (nstate>>20); \n\n //cout << \"ns = \" << endl;\n //print(nstate);\n\n dfs(nstate,cur+1,cost+1,ans);\n\t\n }\n \n}\n\nint compute(int field)\n{\n int bf = (field>>20);\n int nfield = field & (1<<20)-1;\n int ret = __builtin_popcount(bf) + mincost[nfield];\n\n //cout << \"start dfs\" << endl;\n dfs(field,0,0,ret);\n //cout << \"end dfs\" << endl;\n //cout << \"ret = \" << ret << endl;\n return ret;\n}\n\nint main()\n{\n int n,field;\n init();\n makeRect();\n /*\n rep(y,3)\n rep(x,3)\n {\n bitset<20> b(rect[0][0][y][x]);\n cout << \"(\" << x << \",\" << y << \") \" << b << endl;\n }\n */\n //cout << \"finish -- makeRect\" << endl;\n makeMincost();\n //cout << \"finish -- makeMincost\" <<endl;\n\n while(cin >> n,n)\n {\n field = 0;\n {\n\tchar c;\n\trep(y,n)rep(x,n)\n\t {\n\t cin >> c;\n\t if(c == '1')field |= (1<<(y*5+x));\n\t }\n\tint cnt = (n<=4?mincost[field]:compute(field));\n\trep(i,cnt)cout << \"myon\";\n\tcout << endl;\n\n }\n\n }\n return 0;\n}\n\n\n/*\nstruct P\n{\n int state,cost;\n P(int state = inf,int cost = inf):state(state),cost(cost){}\n bool operator < (const P& a)const\n {\n return cost > a.cost;\n }\n};\n\nint n;\nshort mincost[5][MAX];\nint rect[5][5][5][5][5];\nint lim;\n\nvoid makeRect()\n{\n rep(i,5)rep(j,5)rep(k,5)rep(l,5)rep(m,5)rect[i][j][k][l][m] = 0;\n\n rep(depth,5)\n {\n rep(y1,depth+1)rep(x1,depth+1)\n\tREP(y2,y1,depth+1)REP(x2,x1,depth+1)\n\t REP(y,y1,y2+1)REP(x,x1,x2+1)\n\t {\n rect[depth][y1][x1][y2][x2] |= (1<<(y*(depth+1)+x));\n\t }\n }\n\n}\n\n\n\nvoid compute(int N)\n{\n rep(i,(1<<(N*N)))mincost[N-1][i] = N*N+1;\n mincost[N-1][0] = 0;\n cout << \"N = \"<< N << endl;\n rep(state,(1<<(N*N)))\n {\n if(mincost[N-1][state] == N*N+1)continue;\n rep(y1,N)rep(x1,N)\n\tREP(y2,y1,N)REP(x2,x1,N)\n\t{ \n\t int nstate = state ^ rect[N-1][y1][x1][y2][x2];\n\t mincost[N-1][nstate] = min(mincost[N-1][nstate],\n\t\t\t\t (short)(mincost[N-1][state]+1));\n\t}\n }\n}\n\nint main()\n{\n\n makeRect();\n cout << \"finish --- make rectangle\" << endl;\n \n compute(1);\n compute(2);\n compute(3);\n compute(4);\n //compute(5);\n cout << \"-------------\" << endl;\n while(cin >> n,n)\n {\n lim = (1<<n);\n\n int field = 0,c;\n rep(y,n)rep(x,n)\n\t{\n\t cin >> c;\n\t if(c)field |= (1<<(n*y + x));\n\t}\n bitset<25> bi(field);\n cout << \"field \" << bi << endl;\n\n cout << mincost[n-1][field] << endl;\n\n }\n return 0;\n}\n*/\n\n /*\n REP(y,1,3)\n {\n REP(x,1,3)\n\t{\n\t cout << \"y = \" << y << \" x = \" << x << endl;\n\t bitset<10> bit(rect[2][1][1][y][x]);\n\t cout << \"***\" << bit << \"***\" << endl;\n\t}\n }\n */\n\n/*\nvoid compute(int N)\n{\n rep(j,(1<<(N*N)))mincost[N-1][j] = N*N+1;\n mincost[N-1][0] = 0;\n //queue<P> que;\n priority_queue<P> que;\n que.push(P(0,0));\n\n cout << \"N = \" << N << endl;\n while(!que.empty())\n {\n //P p = que.front(); que.pop();\n P p = que.top(); que.pop();\n //bitset<5> bb(p.state);\n //cout << \"cur = \" << bb << \" cost = \" << p.cost << endl;\n\n rep(y1,N)\n\t{\n\t rep(x1,N)\n\t {\n\t REP(y2,y1,N)\n\t\t{\n\t\t REP(x2,x1,N)\n\t\t {\n\t\t //bitset<5> re(rect[N-1][y1][x1][y2][x2]);\n\t\t //cout << \"rect[\"<<y1<<\"][\"<<x1<<\"][\"<<y2<<\"][\"<<x2<<\"] = \" << re << endl;\n\t\t int nstate = p.state ^ rect[N-1][y1][x1][y2][x2];\n\t\t if(mincost[N-1][nstate] > p.cost + 1)\n\t\t\t{\n\t\t\t bitset<5> nex(nstate);\n\t\t\t //cout << \"go to next = \" << nex << \" cost = \" << p.cost+1 << endl;\n\t\t\t //cout << endl;\n\t\t\t mincost[N-1][nstate] = p.cost + 1;\n\t\t\t que.push(P(nstate,p.cost+1));\n\t\t\t}\n\t\t //else cout << re << \" is bad case because \" << mincost[N-1][nstate] << \" !> \" << p.cost+1<< endl << endl;\n\t\t }\n\t\t}\n\t }\n\t}\n\n }\n\n}\n*/",
"accuracy": 1,
"time_ms": 460,
"memory_kb": 11472,
"score_of_the_acc": -0.2775,
"final_rank": 6
},
{
"submission_id": "aoj_1059_772024",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <queue>\n\nusing namespace std;\n\nunsigned char memo[1<<20];\nint mask[5][5][6][6];\n\nvoid printS(int s){\n int tmp[5][5];\n fill(tmp[0], tmp[5], 0);\n for(int i=0;i<5;i++){\n for(int j=0;j<5;j++){\n tmp[i][j] = s >> (i*5+j) & 1;\n }\n }\n for(int i=0;i<5;i++){\n for(int j=0;j<5;j++){\n cout << tmp[i][j];\n }\n cout << endl;\n }\n cout << endl;\n}\n\nvoid init(){\n fill(memo, memo + (1<<20), -1);\n fill(mask[0][0][0], mask[5][0][0], 0);\n for(int i=0;i<5;i++){\n for(int j=0;j<5;j++){\n for(int h=1;i+h<=5;h++){\n for(int w=1;j+w<=5;w++){\n int tmp = (1 << w) - 1 << j;\n for(int k=0;k<h;k++){\n mask[i][j][h][w] |= tmp << (i+k) * 5;\n }\n }\n }\n }\n }\n queue<int> q;\n memo[0] = 0;\n q.push(0);\n while(!q.empty()){\n int u = q.front();\n q.pop();\n for(int i=0;i<4;i++){\n for(int j=0;j<5;j++){\n for(int h=1;i+h<=4;h++){\n for(int w=1;j+w<=5;w++){\n int v = u ^ mask[i][j][h][w];\n if(memo[v] > memo[u] + 1){\n memo[v] = memo[u] + 1;\n /*if((int)memo[v] == 2 && 0){\n cout << \"cost = \" << (int)memo[v] << endl;\n printS(v);\n }*/\n q.push(v);\n }\n }\n }\n }\n }\n }\n}\n\nconst int INF = 1 << 28;\n\nvoid rec(int t, int x, int cnt, int &res){\n if((t >> 20) == 0){\n //printS(t);\n //cout << (int)memo[t&(1<<20)-1] << endl;\n res = min(res, memo[t] + cnt);\n }\n if(x >= 5) return;\n for(int i=0;i<5;i++){\n for(int j=x;j<5;j++){\n int nt = t ^ mask[i][x][5-i][j-x+1];\n if(!(nt&1<<20+x)) rec(nt, x+1, cnt+1, res);\n }\n }\n if(!(t&1<<20+x)) rec(t, x+1, cnt, res);\n}\n\nint solve(int s){\n int cnt = 0;\n for(int i=0;i<5;i++){\n if(s >> (20 + i) & 1) cnt++;\n }\n int res = memo[s&(1<<20)-1] + min(cnt, 6-cnt);\n //cout << res << ' ';\n rec(s, 0, 0, res);\n //cout << res << endl;\n return res;\n}\n\nmain(){\n init();\n int n;\n while(cin >> n && n){\n int m = 0;\n for(int i=0;i<n;i++){\n int t = 0, c;\n for(int j=0;j<n;j++){\n cin >> c;\n t |= c << j;\n }\n m |= t << i * 5;\n }\n int ans = n < 5 ? memo[m] : solve(m);\n for(int i=0;i<ans;i++){\n cout << \"myon\";\n }\n cout << endl;\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 4704,
"score_of_the_acc": -0.0949,
"final_rank": 1
},
{
"submission_id": "aoj_1059_526623",
"code_snippet": "//57\n#include<iostream>\n#include<vector>\n#include<bitset>\n#include<queue>\n\nusing namespace std;\n\nstruct S{\n int t,v;\n};\n\nint main(){\n for(int n;cin>>n,n;){\n int v=0;\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n\tint b;\n\tcin>>b;\n\tv|=b<<i*n+j;\n }\n }\n queue<S> que;\n S is={0,v};\n que.push(is);\n static bitset<1<<25> s;\n s.reset();\n s.set(v);\n for(;;){\n S c=que.front();\n if(c.v==0)break;\n que.pop();\n int j,k;\n for(j=0;j<n;j++){\n\tfor(k=0;k<n;k++){\n\t if(c.v>>j*n+k&1)goto next;\n\t}\n }\n next:\n for(int l=j;l<n;l++){\n\tfor(int m=k;m<n;m++){\n\t int nv=c.v;\n\t for(int o=j;o<=l;o++){\n\t for(int p=k;p<=m;p++){\n\t nv^=1<<o*n+p;\n\t }\n\t }\n\t if(s.test(nv))continue;\n\t s.set(nv);\n\t S ns={c.t+1,nv};\n\t que.push(ns);\n\t}\n }\n }\n for(int i=0;i<que.front().t;i++){\n cout<<\"myon\";\n }\n cout<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 390,
"memory_kb": 5960,
"score_of_the_acc": -0.1361,
"final_rank": 2
},
{
"submission_id": "aoj_1059_526204",
"code_snippet": "//57\n#include<iostream>\n#include<vector>\n#include<set>\n\nusing namespace std;\n\nstruct S{\n int t,v;\n bool operator<(S a)const{\n if(t!=a.t){\n return t<a.t;\n }else{\n return v<a.v;\n }\n }\n};\n\nint main(){\n for(int n;cin>>n,n;){\n int v=0;\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n\tint b;\n\tcin>>b;\n\tv|=b<<i*n+j;\n }\n }\n set<S> que;\n S is={0,v};\n que.insert(is);\n set<int> s;\n for(;;){\n S c=*que.begin();\n if(c.v==0)break;\n que.erase(que.begin());\n if(!s.insert(c.v).second)continue;\n int j,k;\n for(j=0;j<n;j++){\n\tfor(k=0;k<n;k++){\n\t if(c.v>>j*n+k&1)goto next;\n\t}\n }\n next:\n for(int l=j;l<n;l++){\n\tfor(int m=k;m<n;m++){\n\t int nv=c.v;\n\t for(int o=j;o<=l;o++){\n\t for(int p=k;p<=m;p++){\n\t nv^=1<<o*n+p;\n\t }\n\t }\n\t if(s.count(nv))continue;\n\t S ns={c.t+1,nv};\n\t que.insert(ns);\n\t}\n }\n }\n for(int i=0;i<que.begin()->t;i++){\n cout<<\"myon\";\n }\n cout<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 5500,
"memory_kb": 16348,
"score_of_the_acc": -1.0978,
"final_rank": 15
},
{
"submission_id": "aoj_1059_517936",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\n#include <map>\nusing namespace std;\n\nint N;\n\nvector<int> mem;\nvector<int> mas;\n\nvector<int> item[25];\n\n\nint w[16];\nint h[16];\nint a[4][4];\nint memo[(1<<25)/6+10];\n\nchar dfs(int bit){\n\n\tif( bit == 0 ) return 0;\n\tint idx = bit/6;\n\tint pos = (bit%6)*5;\n\t//cout << pos << endl;\n\tchar val = memo[idx] >> pos & ((1<<5)-1);\n\t//cout << (int)val << endl;\n\tif( val != ((1<<5)-1) ) return val;\n\t\n\tchar ans = 30;\n\tfor(int p = 0 ; p < 25 ; p++){\n\t\tif( bit >> p & 1 ){\n\t\t\tfor(int i = 0 ; i < item[p].size() ; i++)\n\t\t\t\tans = min(ans,(char)(dfs(bit^item[p][i])+1));\n\t\t\tbreak;\n\t\t}\n\t}\n\tmemo[idx] &= ~(((1<<5)-1) << pos);\n\tmemo[idx] |= ((int)ans << pos );\n\treturn ans;\n}\n\nint main(){\n\tmemset(memo,-1,sizeof(memo));\n\t\n\tfor(int w = 1 ; w <= 5 ; w++){\n\t\tfor(int h = 1 ; h <= 5 ; h++){\n\t\t\tfor(int i = 0 ; i <= 5 - h ; i++){\n\t\t\t\tfor(int j = 0 ; j <= 5 - w ; j++){\n\t\t\t\t\tint mask = 0;\n\t\t\t\t\tfor(int k = 0 ; k < h ; k++)\n\t\t\t\t\t\tfor(int l = 0 ; l < w ; l++)\n\t\t\t\t\t\t\tmask |= (1<<((i+k)*5+j+l));\n\t\t\t\t\t//cout << init << \" \" << mask << endl;\n\t\t\t\t\titem[i*5+j].push_back(mask);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\twhile(cin >> N && N){\n\t\tint init = 0;\n\t\tfor(int i = 0 ; i < N ; i++){\n\t\t\tfor(int j = 0 ; j < N ; j++){\n\t\t\t\tint c = 0;\n\t\t\t\tcin >> c;\n\t\t\t\tinit |= (c<<(i*5+j));\n\t\t\t}\n\t\t}\n\t\t//cout << init << endl;\n\t\tint x = (int)dfs(init);\n\t\tfor(int i = 0 ; i < x ; i++) cout << \"myon\";\n\t\tcout << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 23060,
"score_of_the_acc": -0.5262,
"final_rank": 11
},
{
"submission_id": "aoj_1059_508070",
"code_snippet": "//Name: Mysterious Onslaught\n//Level: 4\n//Category: DP,ビット演算\n//Note:\n\n/*\n * 状態数は全部で 2^25 だが，これはちょうどメモリ制限の値と等しいため\n * 愚直な探索では解を求められない．\n * この手の問題だと上の行の状態を覚えておいて下の行に伝搬させるのが常套手段だが，\n * この問題でもその手法が使える．\n *\n * この問題で上の行から下の行へ伝搬する状態は，上の行でどのように矩形が置かれていたかである．\n * たとえばある行 r で 1〜3 列目を埋めるように矩形が置かれていた場合，その下の行 r+1 でも\n * 同じように 1〜3 列目を埋めるようにすると，これらはまとめて1個の矩形で表現できるため\n * コストが下がる．\n *\n * ある行について，列 x から右に矩形を伸ばしたとき，その幅は N-x 通り存在する．\n * これを各列について合計すると N=5 のときでも 15 通りであるから，1行を覆う矩形の取り方は\n * 高々 2^15 通り．\n * このうちその行を全滅させる置き方は更に少ないと予測できるので，そのような置き方だけを覚えて\n * 直前の状態として使うと計算量が抑えられる．\n * 実際には N=5 の時で 1024 通りになるので，1行の更新は 2^25 ループ程度で完了できる．\n *\n * 以下のコードではビット演算を使って，矩形の正当性(ちゃんと全てのビットを0にできるか)の判定を高速化している．\n * オーダーは O(2^(N^2)) ．\n */\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nconst int INF = 30;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n while(true) {\n int N;\n cin >> N;\n if(!N) break;\n vector<int> field(N);\n for(int i = 0; i < N; ++i) {\n int pat = 0;\n for(int j = 0; j < N; ++j) {\n int v;\n cin >> v;\n pat <<= 1;\n pat |= v;\n }\n field[i] = pat;\n }\n // ビット演算で扱いやすくするため，右端を座標 0 として扱う．\n vector<int> myons; // 行にかかるmyon\n for(int c = 0; c < N; ++c) { // 右端の位置\n for(int w = 1; w <= N-c; ++w) {\n int mask = ((1<<w)-1) << c;\n myons.push_back(mask);\n //cout << mask << endl;\n }\n }\n const int M = myons.size();\n // 0: prev\n // 1: cur\n vector<int> valid_pats[2];\n vector<int> dp[2];\n dp[0].resize(1<<M, INF);\n dp[1].resize(1<<M, INF);\n for(int r = 0; r < N; ++r) {\n valid_pats[1].clear();\n fill(dp[1].begin(), dp[1].end(), INF);\n for(int pat = 0; pat < (1<<M); ++pat) {\n int mask = 0;\n for(int i = 0, ord = 1; i < M; ++i, ord <<= 1) {\n if(pat & ord) mask ^= myons[i];\n }\n if(mask == field[r]) {\n // Valid pattern\n int cost = INF;\n const int bits = __builtin_popcount(pat);\n if(r != 0) {\n // コストは\n // 直前で有効な状態のコスト + 現在のパターンのコスト - 直前と合成する矩形のコスト\n for(vector<int>::iterator it = valid_pats[0].begin(); it != valid_pats[0].end(); ++it) {\n cost = min(cost, dp[0][*it] + bits - __builtin_popcount(pat & *it));\n }\n } else {\n cost = bits;\n }\n //cout << r << ' ' << pat << ' ' << cost << endl;\n dp[1][pat] = cost;\n valid_pats[1].push_back(pat);\n }\n }\n valid_pats[0].swap(valid_pats[1]);\n dp[0].swap(dp[1]);\n }\n int ans = INF;\n for(vector<int>::iterator it = valid_pats[0].begin(); it != valid_pats[0].end(); ++it) {\n ans = min(ans, dp[0][*it]);\n }\n for(int i = 0; i < ans; ++i) {\n cout << \"myon\";\n }\n cout << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2430,
"memory_kb": 1364,
"score_of_the_acc": -0.3113,
"final_rank": 8
},
{
"submission_id": "aoj_1059_508065",
"code_snippet": "#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nconst int INF = 30;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n while(true) {\n int N;\n cin >> N;\n if(!N) break;\n vector<int> field(N);\n for(int i = 0; i < N; ++i) {\n int pat = 0;\n for(int j = 0; j < N; ++j) {\n int v;\n cin >> v;\n pat <<= 1;\n pat |= v;\n }\n field[i] = pat;\n }\n vector<int> myons; // ティツ。ツ古」ツ?ォテ」ツ?凝」ツ?凝」ツつ砧yon\n for(int c = 0; c < N; ++c) { // テ・ツ渉ウテァツォツッテ」ツ?ョテ、ツスツ催ァツスツョ\n for(int w = 1; w <= N-c; ++w) {\n int mask = ((1<<w)-1) << c;\n myons.push_back(mask);\n //cout << mask << endl;\n }\n }\n const int M = myons.size();\n // 0: prev\n // 1: cur\n vector<int> valid_pats[2];\n vector<int> dp[2];\n dp[0].resize(1<<M, INF);\n dp[1].resize(1<<M, INF);\n for(int r = 0; r < N; ++r) {\n valid_pats[1].clear();\n fill(dp[1].begin(), dp[1].end(), INF);\n for(int pat = 0; pat < (1<<M); ++pat) {\n int mask = 0;\n for(int i = 0, ord = 1; i < M; ++i, ord <<= 1) {\n if(pat & ord) mask ^= myons[i];\n }\n if(mask == field[r]) {\n // Valid pattern\n int cost = INF;\n const int bits = __builtin_popcount(pat);\n if(r != 0) {\n for(vector<int>::iterator it = valid_pats[0].begin(); it != valid_pats[0].end(); ++it) {\n cost = min(cost, dp[0][*it] + bits - __builtin_popcount(pat & *it));\n }\n } else {\n cost = bits;\n }\n //cout << r << ' ' << pat << ' ' << cost << endl;\n dp[1][pat] = cost;\n valid_pats[1].push_back(pat);\n }\n }\n valid_pats[0].swap(valid_pats[1]);\n dp[0].swap(dp[1]);\n }\n int ans = INF;\n for(vector<int>::iterator it = valid_pats[0].begin(); it != valid_pats[0].end(); ++it) {\n ans = min(ans, dp[0][*it]);\n }\n for(int i = 0; i < ans; ++i) {\n cout << \"myon\";\n }\n cout << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2430,
"memory_kb": 1360,
"score_of_the_acc": -0.3112,
"final_rank": 7
},
{
"submission_id": "aoj_1059_507222",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<queue>\n#include<algorithm>\nusing namespace std;\n\n#define REP(i,a,b) for(int i=a;i<b;i++)\n\nint n,g,a,b;\nint d[1<<20];\nvector<int> m[5][5];\n\nint rec(int g, int t){\n if(t == 5){\n if( (g & 31) )return 1000000;\n return d[g>>5];\n }\n int r = rec(g,t+1);\n for(int i=0;i<m[0][t].size();i++)r = min(r,rec(g^m[0][t][i],t+1)+1);\n return r;\n}\n \nint main(){\n REP(i,0,5)REP(j,0,5)REP(k,i,5)REP(l,j,5){\n int tmp = 0;\n REP(y,i,k+1)REP(x,j,l+1)tmp |= 1<<(y*5+x);\n m[i][j].push_back(tmp);\n }\n\n for(int i=0;i<(1<<20);i++)d[i] = -1; d[0] = 0;\n queue<int> q; q.push(0);\n while(q.size()){\n int p = q.front(); q.pop();\n REP(i,0,4)REP(j,0,5)REP(k,0,m[i][j].size()){\n if(m[i][j][k]>=1<<20)continue;\n int nxt = p^m[i][j][k];\n if(d[nxt]<0){\n\td[nxt] = d[p] + 1;\n\tq.push(nxt);\n }\n }\n }\n\n while(cin >> n,n){\n g = 0;\n REP(i,0,5)REP(j,0,5)\n if(i<n && j<n){\n\tcin >> b;\n\tg |= b<<(i*5+j);\n }\n \n if(n<5)a = d[g];\n else a = rec(g,0);\n \n REP(i,0,a)cout << \"myon\";\n cout << endl;\n }\n}",
"accuracy": 1,
"time_ms": 570,
"memory_kb": 7804,
"score_of_the_acc": -0.2053,
"final_rank": 4
},
{
"submission_id": "aoj_1059_507218",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<queue>\n#include<algorithm>\nusing namespace std;\n\n#define REP(i,a,b) for(int i=a;i<b;i++)\n\nint n,g,bit,res;\nint dis[1<<20];\nvector<int> mask[5][5];\n\nint rec(int g, int t){\n if(t == 5){\n if( (g & 31) )return 1000000;\n return dis[g>>5];\n }\n int res = rec(g,t+1);\n for(int i=0;i<mask[0][t].size();i++)res = min(res,rec(g^mask[0][t][i],t+1)+1);\n return res;\n}\n \nint main(){\n REP(i,0,5)REP(j,0,5)REP(k,i,5)REP(l,j,5){\n int tmp = 0;\n REP(y,i,k+1)REP(x,j,l+1)tmp |= 1<<(y*5+x);\n mask[i][j].push_back(tmp);\n }\n\n for(int i=0;i<(1<<20);i++)dis[i] = -1;\n dis[0] = 0;\n queue<int> q; q.push(0);\n while(q.size()){\n int p = q.front(); q.pop();\n REP(i,0,4)REP(j,0,5)REP(k,0,mask[i][j].size()){\n if(mask[i][j][k]>=1<<20)continue;\n int nxt = p^mask[i][j][k];\n if(dis[nxt]<0){\n\tdis[nxt] = dis[p] + 1;\n\tq.push(nxt);\n }\n }\n }\n\n while(cin >> n,n){\n g = 0;\n REP(i,0,5)REP(j,0,5)\n if(i<n && j<n){\n\tcin >> bit;\n\tg |= bit<<(i*5+j);\n }\n \n if(n<5)res = dis[g];\n else res = rec(g,0);\n \n for(int i=0;i<res;i++)cout << \"myon\";\n cout << endl;\n }\n}",
"accuracy": 1,
"time_ms": 560,
"memory_kb": 7804,
"score_of_the_acc": -0.2039,
"final_rank": 3
},
{
"submission_id": "aoj_1059_507206",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<queue>\n#include<algorithm>\nusing namespace std;\n\nint n,g,bit;\nint dis[1<<20];\nvector<int> mask[5][5];\n\nint rec(int g, int t){\n if(t == 5){\n if( (g & 31) )return 1000000;\n return dis[g>>5];\n }\n\n int res = rec(g,t+1);\n for(int i=0;i<mask[0][t].size();i++){\n res = min(res,rec(g^mask[0][t][i],t+1)+1);\n }\n return res;\n}\n \nint main(){\n for(int i=0;i<5;i++){\n for(int j=0;j<5;j++){\n for(int k=i;k<5;k++){\n\tfor(int l=j;l<5;l++){\n\t int tmp = 0;\n\t for(int y=i;y<=k;y++){\n\t for(int x=j;x<=l;x++){\n\t tmp |= 1<<(y*5+x);\n\t }\n\t }\n\t mask[i][j].push_back(tmp);\n\t}\n }\n }\n }\n\n for(int i=0;i<(1<<20);i++)dis[i] = -1;\n dis[0] = 0;\n queue<int> q; q.push(0);\n while(q.size()){\n int p = q.front(); q.pop();\n for(int i=0;i<4;i++)\n for(int j=0;j<5;j++){\n\tfor(int k=0;k<mask[i][j].size();k++){\n\t if(mask[i][j][k]>=1<<20)continue;\n\t int nxt = p^mask[i][j][k];\n\t if(dis[nxt]<0){\n\t dis[nxt] = dis[p] + 1;\n\t q.push(nxt);\n\t }\n\t}\n }\n }\n\n while(cin >> n,n){\n g = 0;\n for(int i=0;i<5;i++){\n for(int j=0;j<5;j++){\n\tif(i<n && j<n){\n\t cin >> bit;\n\t g |= bit<<(i*5+j);\n\t}\n }\n }\n if(n<5){\n for(int i=0;i<dis[g];i++)cout << \"myon\";\n cout << endl;\n }else{\n int tmp = rec(g,0);\n for(int i=0;i<tmp;i++)cout << \"myon\";\n cout << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 570,
"memory_kb": 7804,
"score_of_the_acc": -0.2053,
"final_rank": 4
}
] |
aoj_1064_cpp
|
Problem C: Yanagi's Comic
Yanagi is a high school student, and she is called "Hime" by her boyfriend who is a ninja fanboy. She likes picture books very much, so she often writes picture books by herself.
She always asks you to make her picture book as an assistant.
Today, you got asked to help her with making a comic.
She sometimes reads her picture books for children in kindergartens.
Since Yanagi wants to let the children read,
she wants to insert numbers to frames in order.
Of course, such a task should be done by the assistant, you.
You want to do the task easily and fast, so you decide to write a program to output the order of reading frames based on the positions of the frames.
Write a program to print the number of order for each frame.
The comics in this problem satisfy the following rules.
The each comic is drawn on a sheet of rectangle paper.
You can assume that the top side of the paper is on the x-axis.
And you can assume that the right-hand side of the paper is on the y-axis.
The positive direction of the x-axis is leftward.
The positive direction of the y-axis is down direction.
The paper is large enough to include all frames of the comic.
In other words, no area in a frame is out of the paper.
The area of each frame is at least one.
All sides of each frame are parallel to the x-axis or the y-axis.
The frames can't overlap one another.
However the frames may share the line of side.
You must decide the order to read
K
, where
K
is a set of frames, with the following steps.
Step 1
:You must choose an unread frame at the right-most position in
K
.
If you find such frames multiple, you must choose the frame at the top position among them.
If you can't find any unread frames, you stop reading
K
.
The frame you chose is "Starting Frame".
In step 1, you assume that the position of a frame is the top-right point of the frame.
Step 2
:You should draw a line from the right-bottom point of "Starting Frame" to leftward horizontally.
If the line touch the right-hand side of other frame, you should stop drawing.
If the line is on the side of other frame, you should not stop drawing.
If the line touch the edge of paper, you should stop drawing.
Step 3
:The set of the unread frames which are above the line ( they may be the bottom-side on the line ) drawn at Step 2 is
L
.
And you should read
L
.
Step 4
: Go back to Step 1.
Input
The input consists of multiple datasets.
The last dataset is followed by a line containing one zero.
You don't have to process this data.
Each datasets is in the following format.
n
x
01
y
01
x
11
y
11
x
02
y
02
x
12
y
12
....
x
0n
y
0n
x
1n
y
1n
All numbers of the datasets are integer.
They are separated by a space.
The first line of a dataset contains one integer.
n
is the number of frames of the comic.
x
0i
,
y
0i
,
x
1i
,
y
1i
are two non-neighboring points of
i
th frame in the line.
Constraints
0 <
n
< 10
(
x
0i
!=
x
1i
) and (
y
0i
!=
y
1i
)
0 ≤
x
0i
,
y
...(truncated)
|
[
{
"submission_id": "aoj_1064_3722385",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\n#include<cstring>\n#include<iomanip>\n#include<algorithm>\n\nusing namespace std;\n\n#define debug(x) cout<< #x <<\" : \"<< x << endl;\n#define repi(i, x, n) for(int i = x; i < n; i++)\n#define rep(i, n) repi(i, 0, n);\n#define int long long\n\nconst int INF = (1<<30);\nconst int MOD = (int)1e9 + 7;\n\nconst int MAX = 510;\n\n#define x0 first.first.first\n#define y0 first.first.second\n#define x1 first.second.first\n#define y1 first.second.second\n\nint con;\nvector<vector<int>> field;\nvector<int> ans;\n\nvoid solve(vector<pair<pair<pair<int,int>,pair<int,int>>,int>> p){\n if(p.size() == 0) return;\n \n sort(p.begin(), p.end());\n\n ans.push_back(p[0].second);\n\n // cout<<\"id = \"<<p[0].second<<\" size\"<<p.size()<<\" \"<<p[0].x0<<\" \"<<p[0].y0<<\" \"<<p[0].x1<<\" \"<<p[0].y1<<endl;\n\n int num1 = p[0].x0, num2 = p[0].x1;\n \n for(int i = p[0].x1+1; i < MAX; i++){\n if(i == 501 || field[p[0].y1][i] != 0 && field[p[0].y1-1][i] != 0 && field[p[0].y1][i] == field[p[0].y1-1][i]){\n // cout<<\"i = \"<<i<<\" \"<<p[0].y1<<\" [][] \"<<field[p[0].y1+1][i]<<\" \"<<field[p[0].y1][i]<<endl;\n num2 = i-1;\n break;\n }\n }\n\n vector<pair<pair<pair<int,int>,pair<int,int>>,int>> b, c;\n for(int i = 1; i < p.size(); i++){\n // cout<<\"i = \"<<i<<\" \"<<num1<<\" \"<< p[i].x0<<\" \"<<p[i].x1<<\" \"<<num2<<\" <><> \"<<p[i].y1<<\" <= \"<<p[0].y1<<endl;\n if(num1 <= p[i].x0 && p[i].x1 <= num2 &&p[i].y1 <= p[0].y1) b.push_back(p[i]);\n else c.push_back(p[i]);\n }\n\n solve(b);\n solve(c);\n \n}\n\nsigned main(){\n int t = 0;\n\n while(true){\n vector<pair<pair<pair<int,int>,pair<int,int>>,int>> p;\n int n;\n\n \n\n cin>>n;\n\n if(!n) break;\n\n if(t++) cout<<endl;\n p.resize(n);\n \n ans.clear();\n //ns.resize(n+1);\n \n field.clear();\n field.resize(MAX, vector<int>(MAX, 0));\n \n for(int i = 0; i < n; i++){\n cin>>p[i].x0>>p[i].y0>>p[i].x1>>p[i].y1;\n\n p[i].second = i+1;\n if(p[i].x0 > p[i].x1){\n swap(p[i].first.first, p[i].first.second);\n }\n\n if(p[i].y0 > p[i].y1){\n swap(p[i].y0, p[i].y1);\n }\n\n \n for(int j = p[i].y0; j < p[i].y1; j++){\n for(int k = p[i].x0; k < p[i].x1; k++){\n field[j][k] = i+1;\n }\n }\n }\n\n solve(p);\n\n vector<int> test(ans);\n\n for(int i = 0; i < ans.size(); i++){\n test[ans[i]-1] = i;\n }\n for(int i = 0; i < ans.size(); i++){\n cout<<test[i]+1<<endl;\n }\n //cout<<endl;\n }\n \n\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 4916,
"score_of_the_acc": -1.9959,
"final_rank": 5
},
{
"submission_id": "aoj_1064_3720520",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\n#include<cstring>\n#include<iomanip>\n#include<algorithm>\n\nusing namespace std;\n\n#define debug(x) cout<< #x <<\" : \"<< x << endl;\n#define repi(i, x, n) for(int i = x; i < n; i++)\n#define rep(i, n) repi(i, 0, n);\n#define int long long\n\nconst int INF = (1<<30);\nconst int MOD = (int)1e9 + 7;\n\nconst int MAX = 510;\n\n#define x0 first.first.first\n#define y0 first.first.second\n#define x1 first.second.first\n#define y1 first.second.second\n\nint con;\nvector<vector<int>> field;\nvector<int> ans;\n\nvoid solve(vector<pair<pair<pair<int,int>,pair<int,int>>,int>> p){\n if(p.size() == 0) return;\n \n sort(p.begin(), p.end());\n\n ans.push_back(p[0].second);\n\n // cout<<\"id = \"<<p[0].second<<\" size\"<<p.size()<<\" \"<<p[0].x0<<\" \"<<p[0].y0<<\" \"<<p[0].x1<<\" \"<<p[0].y1<<endl;\n\n int num1 = p[0].x0, num2 = p[0].x1;\n \n for(int i = p[0].x1+1; i < MAX; i++){\n if(i == 501 || field[p[0].y1][i] != 0 && field[p[0].y1-1][i] != 0 && field[p[0].y1][i] == field[p[0].y1-1][i]){\n // cout<<\"i = \"<<i<<\" \"<<p[0].y1<<\" [][] \"<<field[p[0].y1+1][i]<<\" \"<<field[p[0].y1][i]<<endl;\n num2 = i-1;\n break;\n }\n }\n\n vector<pair<pair<pair<int,int>,pair<int,int>>,int>> b, c;\n for(int i = 1; i < p.size(); i++){\n // cout<<\"i = \"<<i<<\" \"<<num1<<\" \"<< p[i].x0<<\" \"<<p[i].x1<<\" \"<<num2<<\" <><> \"<<p[i].y1<<\" <= \"<<p[0].y1<<endl;\n if(num1 <= p[i].x0 && p[i].x1 <= num2 &&p[i].y1 <= p[0].y1) b.push_back(p[i]);\n else c.push_back(p[i]);\n }\n\n solve(b);\n solve(c);\n \n}\n\nsigned main(){\n int t = 0;\n\n while(true){\n vector<pair<pair<pair<int,int>,pair<int,int>>,int>> p;\n int n;\n\n \n\n cin>>n;\n\n if(!n) break;\n\n if(t++) cout<<endl;\n p.resize(n);\n \n ans.clear();\n //ns.resize(n+1);\n \n field.clear();\n field.resize(MAX, vector<int>(MAX, 0));\n \n for(int i = 0; i < n; i++){\n cin>>p[i].x0>>p[i].y0>>p[i].x1>>p[i].y1;\n\n p[i].second = i+1;\n if(p[i].x0 > p[i].x1){\n swap(p[i].first.first, p[i].first.second);\n }\n\n if(p[i].y0 > p[i].y1){\n swap(p[i].y0, p[i].y1);\n }\n\n \n for(int j = p[i].y0; j < p[i].y1; j++){\n for(int k = p[i].x0; k < p[i].x1; k++){\n field[j][k] = i+1;\n }\n }\n }\n\n solve(p);\n\n vector<int> test(ans);\n\n for(int i = 0; i < ans.size(); i++){\n test[ans[i]-1] = i;\n }\n for(int i = 0; i < ans.size(); i++){\n cout<<test[i]+1<<endl;\n }\n //cout<<endl;\n }\n \n\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 4936,
"score_of_the_acc": -1.8333,
"final_rank": 4
},
{
"submission_id": "aoj_1064_495093",
"code_snippet": "//08\n#include<iostream>\n#include<algorithm>\n#include<vector>\n\nusing namespace std;\n\nint o[10],r;\nint g[502][501];\n\nstruct K{\n int l,r,t,b,n;\n bool operator<(K a)const{\n if(l!=a.l){\n return l<a.l;\n }else{\n return t<a.t;\n }\n }\n};\n\n\nvoid dfs(vector<K> v){\n if(v.empty())return ;\n int x=min_element(v.begin(),v.end())-v.begin();\n o[v[x].n]=++r;\n int y=v[x].b;\n int b;\n for(b=v[x].r;b<500;b++){\n if(g[y][b]==g[y-1][b]&&g[y][b]!=-1)break;\n }\n vector<K> n[2];\n for(int i=0;i<v.size();i++){\n if(i!=x){\n n[v[i].b<=y&&v[i].r<=b].push_back(v[i]);\n }\n }\n dfs(n[1]);\n dfs(n[0]);\n}\n \nint main(){\n bool ns=false;\n for(int n;cin>>n,n;){\n vector<K> v(n);\n fill(g[0],g[502],-1);\n for(int i=0;i<n;i++){\n v[i].n=i;\n cin>>v[i].l>>v[i].t>>v[i].r>>v[i].b;\n if(v[i].l>v[i].r){\n\tswap(v[i].l,v[i].r);\n }\n if(v[i].t>v[i].b){\n\tswap(v[i].t,v[i].b);\n }\n for(int k=v[i].t;k<v[i].b;k++){\n\tfor(int j=v[i].l;j<v[i].r;j++){\n\t g[k][j]=i;\n\t}\n }\n }\n r=0;\n dfs(v);\n if(ns){\n cout<<endl;\n }\n ns=true;\n for(int i=0;i<n;i++){\n cout<<o[i]<<endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2200,
"score_of_the_acc": -0.6124,
"final_rank": 3
},
{
"submission_id": "aoj_1064_235612",
"code_snippet": "#include <iostream>\n#include <complex>\n#include <set>\n#include <vector>\n#define x(p) p.real()\n#define y(p) p.imag() \n\nnamespace std{\n\tbool operator < (const complex<int> &a,const complex<int> &b){\n\t\treturn x(a) != x(b) ? x(a) < x(b) : y(a) < y(b);\n\t}\n};\nusing namespace std;\ntypedef complex<int> P;\ntypedef pair<P,int> node;\n\nP size[10];\nP pos[10];\n\nvector<int> used;\n\nvoid search(set<node> K){\n\twhile(!K.empty()){\n\t\tnode get = *K.begin();\n\t\tK.erase(get);\n\t\tused.push_back(get.second);\n\t\ty(get.first) += y(size[get.second]);\n\t\twhile(x(get.first) != 501){\n\t\t\tbool f = false;\n\t\t\tfor(set<node>::iterator it = K.begin(); it != K.end() ; ++it){\n\t\t\t\tif( y((*it).first) < y(get.first) && y(get.first) < y((*it).first) + y(size[(*it).second]) && x((*it).first) == x(get.first) ){\n\t\t\t\t\tf = true; break;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f) break;\n\t\t\tx(get.first)++;\n\t\t}\n\t\tset<node> R;\n\t\tfor(set<node>::iterator it = K.begin(); it != K.end() ; ++it){\n\t\t\tif( y(get.first) >= y((*it).first) + y(size[(*it).second]) && x((*it).first)+x(size[(*it).second]) <= x(get.first) ){\n\t\t\t\tR.insert(*it);\n\t\t\t}\n\t\t}\n\t\tfor(set<node>::iterator it = R.begin(); it != R.end() ; ++it)\n\t\t\tK.erase(*it);\n\t\tsearch(R);\n\t}\n}\nint main(){\n\tint n;\n\tint cnt = 0;\n\twhile(cin >> n , n){\n\t\tused.clear();\n\t\tif(cnt++)cout << endl;\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\tint x1 , x2 , y1 , y2;\n\t\t\tcin >> x1 >> y1 >> x2 >> y2;\n\t\t\tif(x1 > x2) swap(x1,x2);\n\t\t\tif(y1 > y2) swap(y1,y2);\n\t\t\tpos[i] = P(x1,y1);\n\t\t\tsize[i] = P(x2-x1,y2-y1);\n\t\t}\n\t\tset<node> L;\n\t\t\n\t\tfor(int i = 0 ; i < n ; i++)\n\t\t\tL.insert(make_pair(pos[i],i));\n\t\t\n\t\tsearch(L);\n\t\t\n\t\tint view[10] = {0};\n\t\tfor(int i = 0 ; i < n ; i++)\n\t\t\tview[used[i]] = i+1;\n\t\tfor(int i = 0 ; i < n ; i++)\n\t\t\tcout << view[i] << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1064_235611",
"code_snippet": "#include <iostream>\n#include <complex>\n#include <set>\n#include <vector>\n#define x(p) p.real()\n#define y(p) p.imag() \n\nnamespace std{\n\tbool operator < (const complex<int> &a,const complex<int> &b){\n\t\treturn x(a) != x(b) ? x(a) < x(b) : y(a) < y(b);\n\t}\n};\nusing namespace std;\ntypedef complex<int> P;\ntypedef pair<P,int> node;\n\nP size[10];\nP pos[10];\n\nvector<int> used;\n\nset<node> search(set<node> K){\n\tif(K.empty()) return K;\n\tnode get = *K.begin();\n\tK.erase(get);\n\tused.push_back(get.second);\n\ty(get.first) += y(size[get.second]);\n\twhile(x(get.first) != 501){\n\t\tbool f = false;\n\t\tfor(set<node>::iterator it = K.begin(); it != K.end() ; ++it){\n\t\t\tif( y((*it).first) < y(get.first) && y(get.first) < y((*it).first) + y(size[(*it).second]) && x((*it).first) == x(get.first) ){\n\t\t\t\tf = true; break;\n\t\t\t}\n\t\t}\n\t\tif(f) break;\n\t\tx(get.first)++;\n\t}\n\tset<node> R;\n\tfor(set<node>::iterator it = K.begin(); it != K.end() ; ++it){\n\t\tif( y(get.first) >= y((*it).first) + y(size[(*it).second]) && x((*it).first)+x(size[(*it).second]) <= x(get.first) ){\n\t\t\tR.insert(*it);\n\t\t}\n\t}\n\tfor(set<node>::iterator it = R.begin(); it != R.end() ; ++it){\n\t\tK.erase(*it);\n\t}\n\twhile(R.size() != 0){\n\t\tR = search(R);\n\t}\n\treturn K;\n}\nint main(){\n\tint n;\n\tint cnt = 0;\n\twhile(cin >> n , n){\n\t\tused.clear();\n\t\tif(cnt++)cout << endl;\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\tint x1 , x2 , y1 , y2;\n\t\t\tcin >> x1 >> y1 >> x2 >> y2;\n\t\t\tif(x1 > x2) swap(x1,x2);\n\t\t\tif(y1 > y2) swap(y1,y2);\n\t\t\tpos[i] = P(x1,y1);\n\t\t\tsize[i] = P(x2-x1,y2-y1);\n\t\t}\n\t\tset<node> L;\n\t\tfor(int i = 0 ; i < n ; i++)\n\t\t\tL.insert(make_pair(pos[i],i));\n\t\twhile(L.size() != 0){\n\t\t\tL = search(L);\n\t\t}\n\t\tint view[10] = {0};\n\t\tfor(int i = 0 ; i < n ; i++)\n\t\t\tview[used[i]] = i+1;\n\t\tfor(int i = 0 ; i < n ; i++)\n\t\t\tcout << view[i] << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_1060_cpp
|
Problem J:
No Story
Since I got tired to write long problem statements, I decided to make this problem statement short. For given positive integer
L
, how many pairs of positive integers
a
,
b
(
a
≤
b
) such that LCM(
a
,
b
) =
L
are there? Here, LCM(
a
,
b
) stands for the least common multiple of
a
and
b
.
Input
For each dataset, an integer
L
is given in a line. Input terminates when
L
= 0.
Output
For each dataset, output the number of pairs of
a
and
b
.
Constraints
1 ≤
L
≤ 10
12
Sample Input
12
9
2
0
Output for the Sample Input
8
3
2
|
[
{
"submission_id": "aoj_1060_10848273",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <vector>\nusing namespace std;\nlong long s;\nint main()\n{\n\twhile(cin>>s&&s)\n\t{\n\t\tvector<int> a;\n\t\tfor(int i=2;i<=s/i;i++)\n\t\t{\n\t\t\tint z=0;\n\t\t\twhile(s%i==0)\n\t\t\t\tz++,s/=i;\n\t\t\tif(z)a.push_back(z);\n\t\t}\n\t\tif(s!=1)a.push_back(1);\n\t\tlong long da=1;\n\t\tfor(int i=0;i<a.size();i++)\n\t\t{\n\t\t\tda*=2*(a[i]+1)-1;\n\t\t}\n\t\tda++;\n\t\tda/=2;\n\t\tcout<<da<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 3440,
"score_of_the_acc": -0.334,
"final_rank": 6
},
{
"submission_id": "aoj_1060_10843811",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <vector>\nusing namespace std;\nlong long s;\nint main()\n{\n\twhile(cin>>s&&s)\n\t{\n\t\tvector<int> a;\n\t\tfor(int i=2;i<=s/i;i++)\n\t\t{\n\t\t\tint z=0;\n\t\t\twhile(s%i==0)\n\t\t\t\tz++,s/=i;\n\t\t\tif(z)a.push_back(z);\n\t\t}\n\t\tif(s!=1)a.push_back(1);\n\t\tlong long da=1;\n\t\tfor(int i=0;i<a.size();i++)\n\t\t{\n\t\t\tda*=2*(a[i]+1)-1;\n\t\t}\n\t\tda++;\n\t\tda/=2;\n\t\tcout<<da<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 3056,
"score_of_the_acc": -0.1112,
"final_rank": 5
},
{
"submission_id": "aoj_1060_9287045",
"code_snippet": "#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\nusing f64 = long double;\n\ntemplate < class T > vector< T >& operator++(vector< T >& a) { for(T& x : a) x++; return a; }\ntemplate < class T > vector< T >& operator--(vector< T >& a) { for(T& x : a) x--; return a; }\ntemplate < class T > vector< T > operator++(vector< T >& a, signed) { vector< T > res = a; for(T& x : a) x++; return res; }\ntemplate < class T > vector< T > operator--(vector< T >& a, signed) { vector< T > res = a; for(T& x : a) x--; return res; }\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\nint main() {\n while(true) {\n i64 L = in();\n if(L == 0) return 0;\n\n i64 ans = 1;\n const i64 N = L;\n for(i64 x = 2; x * x <= N; x++) {\n i64 cnt = 0;\n while(L % x == 0) { L /= x; cnt += 1; }\n ans *= cnt * 2 + 1;\n }\n \n if(L != 1) ans *= 1 * 2 + 1;\n print((ans + 1) / 2);\n }\n}",
"accuracy": 1,
"time_ms": 610,
"memory_kb": 3156,
"score_of_the_acc": -0.7187,
"final_rank": 7
},
{
"submission_id": "aoj_1060_9280190",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nclass Number {\n private:\n long long num;\n\n public:\n Number(long long x = 0) { num = x; }\n // 素数判定\n // O(√N)で判定\n bool is_prime() {\n if (num == 1) {\n return false;\n }\n for (long long i = 2; i * i <= num; i++) {\n if (num % i == 0) {\n return false;\n }\n }\n return true;\n }\n // 約数列挙\n // O(√N)で列挙\n vector<long long> divisor() {\n vector<long long> res;\n for (long long i = 1; i * i <= num; i++) {\n if (num % i == 0) {\n res.push_back(i);\n if (i * i != num) {\n res.push_back(num / i);\n }\n }\n }\n sort(res.begin(), res.end());\n return res;\n }\n // 素因数分解\n // O(√N)で列挙\n vector<pair<long long, long long>> prime_factor() {\n vector<pair<long long, long long>> res;\n for (long long i = 2; i * i <= num; i++) {\n if (num % i != 0) {\n continue;\n }\n long long tmp = 0;\n while (num % i == 0) {\n tmp++;\n num /= i;\n }\n res.push_back({i, tmp});\n }\n if (num != 1) {\n res.push_back({num, 1});\n }\n return res;\n }\n};\n\nvoid solve() {\n long long l;\n cin >> l;\n if (l == 0) {\n exit(0);\n }\n auto vec = Number(l).divisor();\n int ans = 0;\n for (int i = 0; i < vec.size(); i++) {\n for (int j = i; j < vec.size(); j++) {\n if (lcm(vec[i], vec[j]) == l) {\n ans++;\n }\n }\n }\n cout << ans << endl;\n}\n\nint main() {\n while (1) {\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 770,
"memory_kb": 3384,
"score_of_the_acc": -1.0268,
"final_rank": 10
},
{
"submission_id": "aoj_1060_9280020",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(a) a.begin(),a.end()\n#define reps(i, a, n) for (int i = (a); i < (int)(n); i++)\n#define rep(i, n) reps(i, 0, n)\n#define rreps(i, a, n) for (int i = (a); i > (int)(n); i--)\nconst long long mod = 1000000007;\n\nll n;\n\nvector<pair<ll,ll>> pf(ll N) {\n vector<pair<ll,ll>> res;\n for (ll a = 2; a * a <= N; ++a) {\n if (N % a != 0) continue;\n ll ex = 0;\n\n while (N % a == 0) {\n ++ex;\n N /= a;\n }\n\n res.push_back({a, ex});\n }\n\n if (N != 1) res.push_back({N, 1});\n return res;\n}\n\nvector<ll> divisors(ll N) {\n vector<ll> res;\n for (ll i = 1; i * i <= N; ++i) {\n if (N % i == 0) {\n res.push_back(i);\n if (N/i != i) res.push_back(N/i);\n }\n }\n sort(res.begin(), res.end());\n return res;\n}\n\n\nvoid solve() {\n vector<pair<ll,ll>> v = pf(n);\n vector<ll> rr = divisors(n);\n ll ans= 0;\n rep(i,rr.size()) {\n int now = 1;\n rep(j,v.size()) {\n if (rr[i]%(ll)(pow(v[j].first,v[j].second)) == 0) {\n now *= v[j].second+1;\n }\n }\n ans += now;\n }\n cout << (ans-1)/2 + 1 << endl;\n return;\n}\n\nint main() {\n while (true) {\n cin >> n;\n if (n == 0) {\n return 0;\n }\n solve();\n }\n}",
"accuracy": 1,
"time_ms": 650,
"memory_kb": 3836,
"score_of_the_acc": -1.1571,
"final_rank": 19
},
{
"submission_id": "aoj_1060_9279864",
"code_snippet": "// (◕ᴗ◕✿)\n\n#include <bits/stdc++.h>\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\n#define len(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\nusing namespace std;\ntemplate<typename T> using vc = vector<T>;\ntemplate<typename T> using vv = vc<vc<T>>;\ntemplate<typename T> using vvv = vv<vc<T>>;\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nconst ld pi = acos(-1.0);\nconst int inf = 0x3f3f3f3f;\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\n// const ll mod = 1000000007;\nconst ll mod = 998244353;\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\n\n#define debug(var) do{std::cout << #var << \" : \\n\";view(var);}while(0)\ntemplate<typename T> void view(T e){cout << e << endl;}\ntemplate<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << \" \"; } cout << endl;}\ntemplate<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }\n\nvc<pair<ll, ll>> factorization(ll &N){\n vc<pair<ll, ll>> factors;\n ll tmp = N;\n for (ll i = 2; i * i <= N + 1; i++){\n if (tmp % i == 0){\n int cnt = 0;\n while (tmp % i == 0){\n tmp /= i;\n cnt += 1;\n }\n factors.push_back({i, cnt});\n }\n }\n if (tmp != 1){\n factors.push_back({tmp, 1});\n }\n if (len(factors) == 0){\n factors.push_back({N, 1});\n }\n return factors;\n}\n\nll solve(ll L){\n if (L == 1) return 1;\n auto factor = factorization(L);\n int N = len(factor);\n ll ans = 0;\n vl pw(16, 1); rep(i, 15) pw[i + 1] = pw[i] * 3;\n rep(cmb, pw[N]){ // 0 -> a, 1 -> b, 2 -> a & b\n ll a = 1, b = 1;\n rep(i, N){\n if (cmb / pw[i] % 3 == 0){\n b *= factor[i].second;\n }\n if (cmb / pw[i] % 3 == 1){\n a *= factor[i].second;\n }\n }\n ans += a * b;\n }\n ans++; // same case\n ans /= 2;\n return ans;\n}\n\nint main(){\n vl ans;\n while (true){\n ll L; cin >> L;\n if (L == 0) break;\n ans.push_back(solve(L));\n }\n for (auto x : ans) cout << x << endl;\n}",
"accuracy": 1,
"time_ms": 600,
"memory_kb": 3560,
"score_of_the_acc": -0.942,
"final_rank": 8
},
{
"submission_id": "aoj_1060_3410425",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n ll n;\n while(cin >> n, n){\n vector<int> num;\n for(ll i = 2; i*i <= n; i++){\n int t = 0;\n while(n%i == 0) n /= i, t++;\n if(t) num.push_back(t);\n }\n if(n != 1) num.push_back(1);\n ll ans = 1;\n for(int t : num){\n ans *= 2*t+1;\n }\n cout << (ans+1)/2 << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3100,
"score_of_the_acc": -0.0928,
"final_rank": 4
},
{
"submission_id": "aoj_1060_3409505",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing i64 = int64_t;\n\nmap<i64, i64> prime_factor(i64 n) {\n map<i64, i64> res;\n for (i64 i = 2; i * i <= n; i++) {\n while (n % i == 0) {\n res[i]++;\n n /= i;\n }\n }\n if (n != 1)\n res[n] = 1;\n return res;\n}\n\nint main(){\n i64 l;\n while(cin >> l, l != 0){\n auto mp = prime_factor(l);\n i64 n = 1;\n for(auto e: mp){\n n *= 2*e.second + 1;\n }\n cout << (n+1) / 2 << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 2940,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1060_3409298",
"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\n\nint main() {\n ll L, ans;\n while(cin >> L,L){\n ans = 1;\n for(ll i=2; i*i<=L; i++){\n if(L%i==0){\n ll cnt = 0;\n while(L%i==0){\n L /= i;\n cnt++;\n }\n ans *= 2*cnt+1;\n }\n }\n if(L!=1) ans *= 3;\n ans = (ans+1)/2;\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 2988,
"score_of_the_acc": -0.0278,
"final_rank": 2
},
{
"submission_id": "aoj_1060_3166494",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nint main() {\n while (1) {\n ll L, ans = 1;\n cin >> L;\n if(L == 0) break;\n for (ll i = 2; i * i <= L; ++i) {\n ll cnt = 0;\n while (L % i == 0) {\n ++cnt;\n L /= i;\n }\n ans *= 2 * cnt + 1;\n }\n if (L != 1) {\n ans *= 3;\n }\n ans = (ans + 1) / 2;\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3080,
"score_of_the_acc": -0.0922,
"final_rank": 3
},
{
"submission_id": "aoj_1060_2583063",
"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\nll L;\n\nll calc(ll x,ll y){\n\tif(y == 0){\n\t\treturn x;\n\t}else{\n\t\treturn calc(y,x%y);\n\t}\n}\n\nvoid func(){\n\n\tif(L == 1){\n\t\tprintf(\"1\\n\");\n\t\treturn;\n\t}\n\n\tvector<ll> DIVISOR;\n\n\tfor(ll i = 1; i <= sqrt(L); i++){\n\t\tif(L%i == 0){\n\t\t\tDIVISOR.push_back(i);\n\t\t\tif(i*i != L)DIVISOR.push_back(L/i);\n\t\t}\n\t}\n\n\tsort(DIVISOR.begin(),DIVISOR.end());\n\n\tll small,big,common;\n\n\tint ans = 0;\n\n\tfor(int i = 0; i < DIVISOR.size(); i++){\n\t\tfor(int k = i; k < DIVISOR.size(); k++){\n\t\t\tsmall = DIVISOR[i];\n\t\t\tbig = DIVISOR[k];\n\n\t\t\tcommon = calc(big,small);\n\n\t\t\tsmall /= common;\n\t\t\tbig /= common;\n\n\t\t\tif(small*big*common == L)ans++;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%lld\",&L);\n\t\tif(L == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 980,
"memory_kb": 3136,
"score_of_the_acc": -1.1137,
"final_rank": 15
},
{
"submission_id": "aoj_1060_2378933",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\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 SORT(c) sort((c).begin(),(c).end())\n#define IINF INT_MAX\n#define LLINF LLONG_MAX\n \ntypedef long long ll;\ntypedef pair<int, int> ii;\n \n#define DEBUG false\n \n#define MAXI 1000001\n \nvector<ll> prime;\n \nint main(){\n \n ll l;\n bool used[MAXI] = {false};\n REP(i, 2, MAXI){\n if(!used[i]) prime.push_back(i);\n for(int j = 2; i * j < MAXI; j++) used[i*j] = true;\n }\n \n while(cin >> l, l){\n ll tmp = l;\n ll ans = 1;\n ll mul = 1;\n rep(i, prime.size()){\n \tll cnt = 0;\n while(tmp != 1 && tmp % prime[i] == 0) {\n cnt++;\n tmp /= prime[i];\n }\n mul *= (cnt * 2 + 1);\n }\n if(tmp >= MAXI) mul *= 3;\n ans += mul;\n cout << ans / 2 << endl;\n }\n \n \n \n return 0;\n}",
"accuracy": 1,
"time_ms": 660,
"memory_kb": 4664,
"score_of_the_acc": -1.6484,
"final_rank": 20
},
{
"submission_id": "aoj_1060_2223442",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<queue>\n#include<vector>\n#include<string>\n#include<functional>\n#define int long long\nusing namespace std;\n\nint gcd(int a, int b) {\n\tif (b == 0)return a;\n\treturn gcd(b, a%b);\n}\nsigned main() {\n\tint a;\n\twhile(scanf(\"%lld\", &a),a){\n\tvector<int>V;\n\tfor (int b = 1; b*b <= a; b++) {\n\t\tif (a%b == 0) {\n\t\t\tV.push_back(b);\n\t\t\tif (b != a / b) {\n\t\t\t\tV.push_back(a / b);\n\t\t\t}\n\t\t}\n\t}\n\tsort(V.begin(), V.end());\n\tint sum = 0;\n\tfor (int i = 0; i < V.size(); i++) {\n\t\tfor (int j = i; j < V.size(); j++) {\n\t\t\tif (V[i] / gcd(V[i], V[j])*V[j] == a)sum++;\n\t\t}\n\t}\n\tprintf(\"%lld\\n\", sum);}\n}",
"accuracy": 1,
"time_ms": 950,
"memory_kb": 3236,
"score_of_the_acc": -1.1387,
"final_rank": 17
},
{
"submission_id": "aoj_1060_2196596",
"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\nll gcd(ll a, ll b) { if (!b)return a; return gcd(b, a%b); }\nll lcm(ll a, ll b) { return a / gcd(a, b)*b; }\nll v[3000], len;\nint main() {\n\tll a;\n\twhile (scanf(\"%lld\", &a), a) {\n\t\tlen = 0;\n\t\tfor (ll i = 1; i*i <= a; i++) {\n\t\t\tif (a%i == 0) {\n\t\t\t\tv[len++] = i;\n\t\t\t\tif (i != a / i)v[len++] = a / i;\n\t\t\t}\n\t\t}\n\t\tsort(v, v + len);\n\t\tint cnt = 0;\n\t\trep(i, len)for (int j = i; j < len; j++) {\n\t\t\tif (lcm(v[i], v[j]) == a)cnt++;\n\t\t}\n\t\tprintf(\"%d\\n\", cnt);\n\t}\n}",
"accuracy": 1,
"time_ms": 890,
"memory_kb": 3248,
"score_of_the_acc": -1.0798,
"final_rank": 12
},
{
"submission_id": "aoj_1060_2196590",
"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\nll gcd(ll a, ll b) { if (!b)return a; return gcd(b, a%b); }\nll lcm(ll a, ll b) { return a / gcd(a, b)*b; }\nint main() {\n\tll a;\n\twhile (scanf(\"%lld\", &a), a) {\n\t\tvector<ll>v;\n\t\tfor (ll i = 1; i*i <= a; i++) {\n\t\t\tif (a%i == 0) {\n\t\t\t\tv.push_back(i);\n\t\t\t\tif (i != a / i)v.push_back(a / i);\n\t\t\t}\n\t\t}\n\t\tif (v.size() > 3000)abort();\n\t\tsort(v.begin(), v.end());\n\t\tint cnt = 0;\n\t\trep(i, v.size())for (int j = i; j < v.size(); j++) {\n\t\t\tif (lcm(v[i], v[j]) == a)cnt++;\n\t\t}\n\t\tprintf(\"%d\\n\", cnt);\n\t}\n}",
"accuracy": 1,
"time_ms": 950,
"memory_kb": 3260,
"score_of_the_acc": -1.1526,
"final_rank": 18
},
{
"submission_id": "aoj_1060_2196588",
"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\nll gcd(ll a, ll b) { if (!b)return a; return gcd(b, a%b); }\nll lcm(ll a, ll b) { return a / gcd(a, b)*b; }\nint main() {\n\tll a;\n\twhile (scanf(\"%lld\", &a), a) {\n\t\tvector<ll>v;\n\t\tfor (ll i = 1; i*i <= a; i++) {\n\t\t\tif (a%i == 0) {\n\t\t\t\tv.push_back(i);\n\t\t\t\tif (i != a / i)v.push_back(a / i);\n\t\t\t}\n\t\t}\n\t\tif (v.size() > 6000)abort();\n\t\tsort(v.begin(), v.end());\n\t\tint cnt = 0;\n\t\trep(i, v.size())for (int j = i; j < v.size(); j++) {\n\t\t\tif (lcm(v[i], v[j]) == a)cnt++;\n\t\t}\n\t\tprintf(\"%d\\n\", cnt);\n\t}\n}",
"accuracy": 1,
"time_ms": 960,
"memory_kb": 3116,
"score_of_the_acc": -1.0801,
"final_rank": 13
},
{
"submission_id": "aoj_1060_2196587",
"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\nll gcd(ll a, ll b) { if (!b)return a; return gcd(b, a%b); }\nll lcm(ll a, ll b) { return a / gcd(a, b)*b; }\nint main() {\n\tll a;\n\twhile (scanf(\"%lld\", &a), a) {\n\t\tvector<ll>v;\n\t\tfor (ll i = 1; i*i <= a; i++) {\n\t\t\tif (a%i == 0) {\n\t\t\t\tv.push_back(i);\n\t\t\t\tif (i != a / i)v.push_back(a / i);\n\t\t\t}\n\t\t}\n\t\tif (v.size() > 10000)abort();\n\t\tsort(v.begin(), v.end());\n\t\tint cnt = 0;\n\t\trep(i, v.size())for (int j = i; j < v.size(); j++) {\n\t\t\tif (lcm(v[i], v[j]) == a)cnt++;\n\t\t}\n\t\tprintf(\"%d\\n\", cnt);\n\t}\n}",
"accuracy": 1,
"time_ms": 950,
"memory_kb": 3188,
"score_of_the_acc": -1.1109,
"final_rank": 14
},
{
"submission_id": "aoj_1060_2196585",
"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\nll gcd(ll a, ll b) { if (!b)return a; return gcd(b, a%b); }\nll lcm(ll a, ll b) { return a / gcd(a, b)*b; }\nint main() {\n\tll a;\n\twhile (scanf(\"%lld\", &a), a) {\n\t\tvector<ll>v;\n\t\tfor (ll i = 1; i*i <= a; i++) {\n\t\t\tif (a%i == 0) {\n\t\t\t\tv.push_back(i);\n\t\t\t\tif (i != a / i)v.push_back(a / i);\n\t\t\t}\n\t\t}\n\t\tsort(v.begin(), v.end());\n\t\tint cnt = 0;\n\t\trep(i, v.size())for (int j = i; j < v.size(); j++) {\n\t\t\tif (lcm(v[i], v[j]) == a)cnt++;\n\t\t}\n\t\tprintf(\"%d\\n\", cnt);\n\t}\n}",
"accuracy": 1,
"time_ms": 950,
"memory_kb": 3220,
"score_of_the_acc": -1.1294,
"final_rank": 16
},
{
"submission_id": "aoj_1060_2196582",
"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\nll gcd(ll a, ll b) { if (a < b)swap(a, b); if (!b)return a; return gcd(b, a%b); }\nll lcm(ll a, ll b) { return a / gcd(a, b)*b; }\nint main() {\n\tll a;\n\twhile (scanf(\"%lld\", &a), a) {\n\t\tvector<ll>v;\n\t\tfor (ll i = 1; i*i <= a; i++) {\n\t\t\tif (a%i == 0) {\n\t\t\t\tv.push_back(i);\n\t\t\t\tif (i != a / i)v.push_back(a / i);\n\t\t\t}\n\t\t}\n\t\tsort(v.begin(), v.end());\n\t\tint cnt = 0;\n\t\trep(i, v.size())for (int j = i; j < v.size(); j++) {\n\t\t\tif (lcm(v[i], v[j]) == a)cnt++;\n\t\t}\n\t\tprintf(\"%d\\n\", cnt);\n\t}\n}",
"accuracy": 1,
"time_ms": 920,
"memory_kb": 3132,
"score_of_the_acc": -1.0454,
"final_rank": 11
},
{
"submission_id": "aoj_1060_2137609",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\n#define int long long\n#define PB push_back\n\nint gcd(int a, int b)\n{\n int tmp;\n while (b) {\n tmp = a;\n a = b;\n b = tmp % b;\n }\n return a;\n}\n\ninline int lcm(int a, int b)\n{\n return a / gcd(a, b) * b;\n}\n\nsigned main()\n{\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n int L;\n \n while (cin >> L, L) {\n vector<int> divisors;\n\n for (int i = 1; i * i <= L; ++i) {\n if (L % i == 0) {\n divisors.PB(i);\n if (i * i != L) divisors.PB(L / i);\n }\n }\n\n sort(begin(divisors), end(divisors));\n\n int ans = 0;\n\n for (int i = 0; i < (int)divisors.size(); ++i) {\n for (int j = 0; j <= i; ++j) {\n int ii = divisors[i], jj = divisors[j];\n\n if (lcm(ii, jj) == L) {\n ans++;\n }\n }\n }\n\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 900,
"memory_kb": 3084,
"score_of_the_acc": -0.9956,
"final_rank": 9
}
] |
aoj_1057_cpp
|
Problem G:
Rolling Dice
The north country is conquered by the great shogun-sama (which means
king). Recently many beautiful dice which were made by order of the
great shogun-sama were given to all citizens of the country. All
citizens received the beautiful dice with a tear of delight. Now they
are enthusiastically playing a game with the dice.
The game is played on grid of
h
*
w
cells that each of which has a
number, which is designed by the great shogun-sama's noble philosophy.
A player put his die on a starting cell and move it to a destination
cell with rolling the die. After rolling the die once, he takes a
penalty which is multiple of the number written on current cell and
the number printed on a bottom face of the die, because of malicious
conspiracy of an enemy country. Since the great shogun-sama strongly
wishes, it is decided that the beautiful dice are initially put so
that 1 faces top, 2 faces south, and 3 faces east. You will find that
the number initially faces north is 5, as sum of numbers on opposite
faces of a die is always 7. Needless to say, idiots those who move his
die outside the grid are punished immediately.
The great shogun-sama is pleased if some citizens can move the
beautiful dice with the least penalty when a grid and a starting cell
and a destination cell is given. Other citizens should be sent to coal
mine (which may imply labor as slaves). Write a program so that
citizens can deal with the great shogun-sama's expectations.
Input
The first line of each data set has two numbers
h
and
w
, which stands
for the number of rows and columns of the grid.
Next
h
line has
w
integers, which stands for the number printed on the
grid. Top-left corner corresponds to northwest corner.
Row number and column number of the starting cell are given in the
following line, and those of the destination cell are given in the next
line. Rows and columns are numbered 0 to
h
-1, 0 to
w
-1, respectively.
Input terminates when
h
=
w
= 0.
Output
For each dataset, output the least penalty.
Constraints
1 ≤
h
,
w
≤ 10
0 ≤ number assinged to a cell ≤ 9
the start point and the goal point are different.
Sample Input
1 2
8 8
0 0
0 1
3 3
1 2 5
2 8 3
0 1 2
0 0
2 2
3 3
1 2 5
2 8 3
0 1 2
0 0
1 2
2 2
1 2
3 4
0 0
0 1
2 3
1 2 3
4 5 6
0 0
1 2
0 0
Output for the Sample Input
24
19
17
6
21
|
[
{
"submission_id": "aoj_1057_6000290",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <map>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\nint dx[]={-1,1,0,0},dy[]={0,0,-1,1};\nclass DICE{\npublic:\n\tvector<int> dice;\n\tDICE(){\n\t\tdice.resize(6);\n\t\trep(i,6)dice[i]=i+1;\n\t}\n\t// top/front/right/left/back/bottom \n\tvoid back(){\n\t\tint to[] = {4,0,2,3,5,1};\n\t\tvector<int> tmp(6);\n\t\trep(i,6)tmp[to[i]] = dice[i];\n\t\tdice = tmp;\n\t}\n\tvoid left(){\n\t\tint to[] = {3,1,0,5,4,2};\n\t\tvector<int> tmp(6);\n\t\trep(i,6)tmp[to[i]] = dice[i];\n\t\tdice = tmp;\n\t}\n\tvoid rotate(){\n\t\tint to[] = {0,3,1,4,2,5};\n\t\tvector<int> tmp(6);\n\t\trep(i,6)tmp[to[i]] = dice[i];\n\t\tdice = tmp;\n\t}\n\tvoid select(int n){\n\t\tif(n==0)left();\n\t\telse if(n==1)left(),left(),left();\n\t\telse if(n==2)back();\n\t\telse if(n==3)back(),back(),back();\n\t}\n};\nstruct NODE{\n\tint cost,x,y;\n\tDICE dice;\n\tNODE(int a,int b,int c,DICE d){cost = a , x = b , y = c , dice = d;}\n};\nbool operator<(const NODE &a,const NODE &b){\n\tif(a.x != b.x)return a.x < b.x;\n\tif(a.y != b.y)return a.y < b.y;\n\tif(a.dice.dice != b.dice.dice)return a.dice.dice < b.dice.dice;\n\treturn false;\n}\nbool operator>(const NODE &a,const NODE &b){\n\treturn a.cost > b.cost;\n}\nint main(){\n\tint W,H;\n\tint data[10][10];\n\twhile(cin >> H >> W , H){\n\t\tmap<NODE,bool> done;\n\t\tpriority_queue<NODE,vector<NODE>,greater<NODE> > Q;\n\t\trep(i,H)rep(j,W)\n\t\t\tcin >> data[i][j];\n\t\tint sx,sy,gx,gy;\n\t\tcin >> sy >> sx >> gy >> gx;\n\t\tQ.push(NODE(0,sx,sy,DICE()));\n\t\twhile(Q.size()){\n\t\t\tNODE q = Q.top(); Q.pop();\n\t\t\tif(done[q])continue;\n\t\t\telse done[q] = true;\n\t\t\tif(q.x == gx && q.y == gy){\n\t\t\t\tcout << q.cost << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\trep(i,4){\n\t\t\t\tNODE next = q;\n\t\t\t\tnext.x = dx[i] + q.x;\n\t\t\t\tnext.y = dy[i] + q.y;\n\t\t\t\tnext.dice.select(i);\n\t\t\t\tif(next.x < 0 || next.y < 0 || next.y >= H || next.x >= W) continue;\n\t\t\t\tnext.cost = q.cost + next.dice.dice[5] * data[next.y][next.x] ;\n\t\t\t\tQ.push(next);\n\t\t\t}\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 3304,
"score_of_the_acc": -0.2486,
"final_rank": 13
},
{
"submission_id": "aoj_1057_6000265",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <map>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\nint dx[]={-1,1,0,0},dy[]={0,0,-1,1};\nclass DICE{\npublic:\n\tvector<int> dice;\n\tDICE(){\n\t\tdice.resize(6);\n\t\trep(i,6)dice[i]=i+1;\n\t}\n\t// top/front/right/left/back/bottom \n\tvoid back(){\n\t\tint to[] = {4,0,2,3,5,1};\n\t\tvector<int> tmp(6);\n\t\trep(i,6)tmp[to[i]] = dice[i];\n\t\tdice = tmp;\n\t}\n\tvoid left(){\n\t\tint to[] = {3,1,0,5,4,2};\n\t\tvector<int> tmp(6);\n\t\trep(i,6)tmp[to[i]] = dice[i];\n\t\tdice = tmp;\n\t}\n\tvoid rotate(){\n\t\tint to[] = {0,3,1,4,2,5};\n\t\tvector<int> tmp(6);\n\t\trep(i,6)tmp[to[i]] = dice[i];\n\t\tdice = tmp;\n\t}\n\tvoid select(int n){\n\t\tif(n==0)left();\n\t\telse if(n==1)left(),left(),left();\n\t\telse if(n==2)back();\n\t\telse if(n==3)back(),back(),back();\n\t}\n};\nstruct NODE{\n\tint cost,x,y;\n\tDICE dice;\n\tNODE(int a,int b,int c,DICE d){cost = a , x = b , y = c , dice = d;}\n};\nbool operator<(const NODE &a,const NODE &b){\n\tif(a.x != b.x)return a.x < b.x;\n\tif(a.y != b.y)return a.y < b.y;\n\tif(a.dice.dice != b.dice.dice)return a.dice.dice < b.dice.dice;\n\treturn false;\n}\nbool operator>(const NODE &a,const NODE &b){\n\treturn a.cost > b.cost;\n}\nint main(){\n\tint W,H;\n\tint data[10][10];\n\twhile(cin >> H >> W , H){\n\t\tmap<NODE,bool> done;\n\t\tpriority_queue<NODE,vector<NODE>,greater<NODE> > Q;\n\t\trep(i,H)rep(j,W)\n\t\t\tcin >> data[i][j];\n\t\tint sx,sy,gx,gy;\n\t\tcin >> sy >> sx >> gy >> gx;\n\t\tQ.push(NODE(0,sx,sy,DICE()));\n\t\twhile(Q.size()){\n\t\t\tNODE q = Q.top(); Q.pop();\n\t\t\tif(done[q])continue;\n\t\t\telse done[q] = true;\n\t\t\tif(q.x == gx && q.y == gy){\n\t\t\t\tcout << q.cost << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\trep(i,4){\n\t\t\t\tNODE next = q;\n\t\t\t\tnext.x = dx[i] + q.x;\n\t\t\t\tnext.y = dy[i] + q.y;\n\t\t\t\tnext.dice.select(i);\n\t\t\t\tif(next.x < 0 || next.y < 0 || next.y >= H || next.x >= W) continue;\n\t\t\t\tnext.cost = q.cost + next.dice.dice[5] * data[next.y][next.x] ;\n\t\t\t\tQ.push(next);\n\t\t\t}\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 3392,
"score_of_the_acc": -0.2612,
"final_rank": 14
},
{
"submission_id": "aoj_1057_2459719",
"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;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000001\nusing namespace std;\n\nclass Dice{\npublic:\n\tDice(){\n\t\tnumber = new int[6];\n\t\twork = new int[6];\n\t};\n\n\tvoid roll(char dst){\n\t\tfor(int i = 0; i < 6; i++) work[i] = number[i];\n\t\tswitch(dst){\n\t\tcase 'E':\n\t\t\tsetNumber(work[3],work[1],work[0],work[5],work[4],work[2]);\n\t\t\tbreak;\n\t\tcase 'S':\n\t\t\tsetNumber(work[1],work[5],work[2],work[3],work[0],work[4]);\n\t\t\tbreak;\n\t\tcase 'N':\n\t\t\tsetNumber(work[4],work[0],work[2],work[3],work[5],work[1]);\n\t\t\tbreak;\n\t\tcase 'W':\n\t\t\tsetNumber(work[2],work[1],work[5],work[0],work[4],work[3]);\n\t\t\tbreak;\n\t\t}\n\t};\n\n\tint getBottom(){\n\t\treturn number[5];\n\t}\n\n\tint getEast(){\n\t\treturn number[2];\n\t}\n\n\tvoid setNumber(int n0,int n1,int n2,int n3,int n4,int n5){\n\t\tnumber[0] = n0;\n\t\tnumber[1] = n1;\n\t\tnumber[2] = n2;\n\t\tnumber[3] = n3;\n\t\tnumber[4] = n4;\n\t\tnumber[5] = n5;\n\t}\n\n\tvoid init(){\n\t\tsetNumber(1,5,3,4,2,6);\n\t}\n\n\tvoid set(Dice arg){\n\t\tfor(int i = 0; i < 6; i++){\n\t\t\tnumber[i] = arg.number[i];\n\t\t}\n\t}\n\n\tint* number;\n\tint* work;\n};\n\nint H,W,diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\n\nstruct Info{\n\tInfo(){\n\t\trow = col = penalty = 0;\n\t\tdice.init();\n\t}\n\n\tvoid set(int arg_row,int arg_col,int arg_penalty){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\tpenalty = arg_penalty;\n\t}\n\tint row,col,penalty;\n\tDice dice;\n};\n\nbool rangeCheck(int row,int col){\n\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1)return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\nint main(){\n\n\tint dp[10][10][7][7];\n\tint map[10][10],start_row,start_col,goal_row,goal_col,minimum,next_row,next_col;\n\tqueue<Info> Q;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&H,&W);\n\t\tif(H == 0 && W == 0)break;\n\n\t\tfor(int i = 0; i < H; i++){\n\t\t\tfor(int k = 0; k < W; k++)scanf(\"%d\",&map[i][k]);\n\t\t}\n\n\t\tscanf(\"%d %d\",&start_row,&start_col);\n\t\tscanf(\"%d %d\",&goal_row,&goal_col);\n\n\t\tfor(int i = 0; i < H; i++){\n\t\t\tfor(int k = 0; k < W; k++){\n\t\t\t\tfor(int p = 1; p <= 6; p++){\n\t\t\t\t\tfor(int q = 1; q <= 6; q++)dp[i][k][p][q] = BIG_NUM;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tInfo first;\n\t\tfirst.set(start_row,start_col,0);\n\t\tdp[start_row][start_col][first.dice.getBottom()][first.dice.getEast()] = 0;\n\n\t\twhile(!Q.empty())Q.pop();\n\t\tQ.push(first);\n\n\t\tminimum = BIG_NUM;\n\n\t\twhile(!Q.empty()){\n\n\t\t\tif(Q.front().row == goal_row && Q.front().col == goal_col){\n\t\t\t\tminimum = min(minimum,Q.front().penalty);\n\t\t\t\tQ.pop();\n\t\t\t}else if(Q.front().penalty >= minimum ||\n\t\t\t\t\tQ.front().penalty > dp[Q.front().row][Q.front().col][Q.front().dice.getBottom()][Q.front().dice.getEast()]){\n\t\t\t\tQ.pop();\n\t\t\t}else{\n\n\t\t\t\tfor(int i = 0; i < 4; 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)){\n\t\t\t\t\t\tInfo next;\n\t\t\t\t\t\tnext.set(next_row,next_col,Q.front().penalty);\n\t\t\t\t\t\tnext.dice.set(Q.front().dice);\n\t\t\t\t\t\tswitch(i){\n\t\t\t\t\t\tcase 0:\n\t\t\t\t\t\t\tnext.dice.roll('N');\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 1:\n\t\t\t\t\t\t\tnext.dice.roll('W');\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 2:\n\t\t\t\t\t\t\tnext.dice.roll('E');\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 3:\n\t\t\t\t\t\t\tnext.dice.roll('S');\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(dp[next_row][next_col][next.dice.getBottom()][next.dice.getEast()] > dp[Q.front().row][Q.front().col][Q.front().dice.getBottom()][Q.front().dice.getEast()]+\n\t\t\t\t\t\t\t\tmap[next_row][next_col]*next.dice.getBottom()){\n\t\t\t\t\t\t\tdp[next_row][next_col][next.dice.getBottom()][next.dice.getEast()] =\n\t\t\t\t\t\t\t\t\tdp[Q.front().row][Q.front().col][Q.front().dice.getBottom()][Q.front().dice.getEast()]+map[next_row][next_col]*next.dice.getBottom();\n\t\t\t\t\t\t\tnext.penalty += map[next_row][next_col]*next.dice.getBottom();\n\t\t\t\t\t\t\tQ.push(next);\n\t\t\t\t\t\t}\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\tprintf(\"%d\\n\",minimum);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 50224,
"score_of_the_acc": -1.0326,
"final_rank": 19
},
{
"submission_id": "aoj_1057_2102934",
"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<stack>\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<ll> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef vector<string> vs;\ntypedef vector<double> vd;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nint dx[]={0,1,0,-1};\nint dy[]={1,0,-1,0};\nint rol[4][4]={\n\t{4,5,2,0},\n\t{1,0,3,5},\n\t{0,2,5,4},\n\t{5,3,0,1}\n};\nvi a;\nvoid roll(int b){\n\tint tmp=a[2+rol[b][0]];\n\trep(i,3)a[2+rol[b][i]]=a[2+rol[b][i+1]];\n\ta[2+rol[b][3]]=tmp;\n}\nint main(){\n\tint n,m;\n\twhile(cin>>n>>m,n+m){\n\t\tvvi in(n,vi(m));\n\t\trep(i,n)rep(j,m)cin>>in[i][j];\n\t\tint sx,sy,gx,gy;\n\t\tcin>>sx>>sy>>gx>>gy;\n\t\tvi q(8);\n\t\tq[0]=sx;q[1]=sy;q[2]=1;q[3]=2;\n\t\tq[4]=3;q[5]=5;q[6]=4;q[7]=6;\n\t\tint ma[11][11][666];\n\t\trep(i,11)rep(j,11)rep(k,666)ma[i][j][k]=inf;\n\t\tma[sx][sy][123]=0;\n\t\tint out=inf;\n\t\tpriority_queue<pair<int,vi> >que;\n\t\tque.push(pair<int,vi>(0,q));\n\t\twhile(!que.empty()){\n\t\t\tvi w=que.top().second;\n\t\t\tint t=-que.top().first;\n\t\t\tque.pop();\n\t\t\tif(ma[w[0]][w[1]][w[2]*100+w[3]*10+w[4]]<t)continue;\n\t\t\trep(i,4){\n\t\t\t\ta=w;\n\t\t\t\ta[0]+=dx[i];\n\t\t\t\ta[1]+=dy[i];\n\t\t\t\tif(a[0]<0||a[1]<0||a[0]>=n||a[1]>=m)continue;\n\t\t\t\troll(i);\n\t\t\t\tint cost=t+a[7]*in[a[0]][a[1]];\n\t\t\t\tif(ma[a[0]][a[1]][a[2]*100+a[3]*10+a[4]]>cost){\n\t\t\t\t\tma[a[0]][a[1]][a[2]*100+a[3]*10+a[4]]=cost;\n\t\t\t\t\tque.push(pair<int,vi>(-cost,a));\n\t\t\t\t\tif(a[0]==gx&&a[1]==gy)out=min(out,cost);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<out<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3388,
"score_of_the_acc": -0.0981,
"final_rank": 8
},
{
"submission_id": "aoj_1057_1982525",
"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\nenum R_Way {\n\tR_Left,\n\tR_Front,\n\tR_Right,\n\tR_Back,\n\n\tR_Dummy,\n};\nstruct Dice {\n\tint tp;\n\tint bo;\n\tint no;\n\tint so;\n\tint ea;\n\tint we;\n\tDice(int tp_, int bo_, int no_, int so_, int ea_, int we_) :\n\t\ttp(tp_), bo(bo_), no(no_), so(so_), ea(ea_), we(we_) {\n\n\t}\n\tDice(vector<int>pips_) {\n\n\t}\n\n\tDice() {\n\t\ttp = 1;\n\t\tbo = 6;\n\t\tno = 5;\n\t\tso = 2;\n\t\tea = 3;\n\t\twe = 4;\n\t}\n\n\tint rotate(const R_Way way) {\n\t\tswitch (way) {\n\t\tcase R_Right: {\n\t\t\tint c = tp;\n\t\t\ttp = we;\n\t\t\twe = bo;\n\t\t\tbo = ea;\n\t\t\tea = c;\n\t\t}\n\t\t\t\t\t break;\n\t\tcase R_Back: {\n\t\t\tint c = tp;\n\t\t\ttp = so;\n\t\t\tso = bo;\n\t\t\tbo = no;\n\t\t\tno = c;\n\t\t}\n\t\t\t\t\t break;\n\t\tcase R_Left: {\n\t\t\tint c = tp;\n\t\t\ttp = ea;\n\t\t\tea = bo;\n\t\t\tbo = we;\n\t\t\twe = c;\n\t\t}\n\t\t\t\t\t break;\n\t\tcase R_Front: {\n\t\t\tint c = tp;\n\t\t\ttp = no;\n\t\t\tno = bo;\n\t\t\tbo = so;\n\t\t\tso = c;\n\t\t}\n\t\t\t\t\t break;\n\t\tdefault:\n\t\t\tassert(false);\n\t\t}\n\t\treturn tp;\n\t}\n\tint rotate(const int way) {\n\t\treturn rotate(static_cast<R_Way>(way));\n\t}\n\tvoid spin(const int clockwise) {\n\t\tif (!clockwise) {\n\n\t\t\trotate(R_Way::R_Left);\n\t\t\trotate(R_Way::R_Back);\n\t\t\trotate(R_Way::R_Right);\n\t\t}\n\t\telse {\n\n\t\t\trotate(R_Way::R_Left);\n\t\t\trotate(R_Way::R_Front);\n\t\t\trotate(R_Way::R_Right);\n\t\t}\n\t}\n\tint hash()const {\n\t\treturn tp + we * 6 + no * 36;\n\t}\n};\nint geteast(int top, int south) {\n\tmap<pair<int, int>, int>mp;\n\tmp[make_pair(1, 2)] = 3;\n\tmp[make_pair(1, 3)] = 5;\n\tmp[make_pair(2, 3)] = 1;\n\tmp[make_pair(2, 4)] = 6;\n\tbool rev = false;\n\tif (top >= 4) {\n\t\trev = !rev; top = 7 - top;\n\t}\n\tif (south >= 4) {\n\t\trev = !rev; south = 7 - south;\n\t}\n\tif (top > south) {\n\t\trev = !rev; swap(top, south);\n\t}\n\treturn mp[make_pair(top, south)];\n}\n\nint gettop(int south, int east) {\n\treturn geteast(south, east);\n}\nint getsouth(int east, int top) {\n\treturn 7 - geteast(top, east);\n}\nbool operator==(const Dice&l, const Dice&r) {\n\treturn l.hash() == r.hash();\n}\n\nint H, W;\nbool check(const int y, const int x) {\n\treturn y >= 0 && y < H&&x >= 0 && x < W;\n}\nstruct aa {\n\tint x;\n\tint y;\n\tint tp;\n\tint bo;\n\tint no;\n\tint so;\n\tint ea;\n\tint we;\n\tint hash;\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};\t//aa?????????????????¶\n\nconst int dx[4] = { -1,0,1,0 };\nconst int dy[4] = { 0,1,0,-1 };\n\nint memo[101][101][1000];\nint main() {\n\tmap<int, int>mp;\n\tint num = 0;\n\twhile (1) {\n\t\tfor (int i = 0; i < 100; ++i) {\n\t\t\tfor (int j = 0; j < 100; ++j) {\n\t\t\t\tfor (int k = 0; k < 1000; ++k) {\n\t\t\t\t\tmemo[i][j][k] = 1e8;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcin >> H >> W;\n\t\tif (!H)break;\n\t\tvector<vector<int>>field(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 >> field[i][j];\n\t\t\t}\n\t\t}\n\t\tint sx, sy, gx, gy; cin >> sy >> sx >> gy >> gx;\n\t\t\n\n\t\tpriority_queue<aa, vector<aa>, Compare>que;\n\t\tDice ini_di;\n\t\tque.push(aa{ sx,sy,ini_di.tp,ini_di.bo,ini_di.no,ini_di.so,ini_di.ea,ini_di.we,ini_di.hash(),0 });\n\t\tint ans = -1;\n\t\twhile (!que.empty()) {\n\t\t\taa atop(que.top());\n\t\t\tque.pop(); if (atop.x == gx&&atop.y == gy) {\n\t\t\t\tans = atop.time;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfor (int way = 0; way < 4; ++way) {\n\t\t\t\tconst int nextx = atop.x + dx[way];\n\t\t\t\tconst int nexty = atop.y + dy[way];\n\t\t\t\t\n\t\t\t\tDice di = Dice(atop.tp, atop.bo, atop.no, atop.so, atop.ea, atop.we);\n\t\t\t\tif (check(nexty, nextx)) {\n\t\t\t\t\tdi.rotate(way);\n\t\t\t\t\tconst int nexttime= atop.time + di.bo*field[nexty][nextx];\n\t\t\t\t\tif (mp.find(di.hash()) == mp.end()) {\n\t\t\t\t\t\tmp[di.hash()] = num++;\n\t\t\t\t\t}\n\t\t\t\t\tif (memo[nextx][nexty][mp[di.hash()]]>nexttime) {\n\t\t\t\t\t\tmemo[nextx][nexty][mp[di.hash()]] = nexttime;\n\t\t\t\t\t\tque.push(aa{ nextx,nexty,di.tp,di.bo,di.no,di.so,di.ea,di.we,di.hash(),nexttime });\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 900,
"memory_kb": 42628,
"score_of_the_acc": -1.8123,
"final_rank": 20
},
{
"submission_id": "aoj_1057_1867796",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX_H 10\n#define MAX_W 10\n \nstruct Dice{\n int tmp,d[6];\n Dice(){\n\tfor(int i = 0 ; i < 6 ; i++){\n\t d[i] = i;\n\t}\n }\n void rollN(){\n\ttmp = d[0];\n\td[0] = d[1];\n\td[1] = d[5];\n\td[5] = d[4];\n\td[4] = tmp;\n }\n void rollE(){\n\ttmp = d[0];\n\td[0] = d[3];\n\td[3] = d[5];\n\td[5] = d[2];\n\td[2] = tmp;\n }\n void rollS(){\n\ttmp = d[0];\n\td[0] = d[4];\n\td[4] = d[5];\n\td[5] = d[1];\n\td[1] = tmp;\n }\n void rollW(){\n\ttmp = d[0];\n\td[0] = d[2];\n\td[2] = d[5];\n\td[5] = d[3];\n\td[3] = tmp;\n }\n};\n \nstruct State{\n int cost,x,y;\n Dice d;\n bool operator < (const State &s)const{\n\treturn cost > s.cost;\n }\n};\n \nint main(){\n int H,W;\n while(cin >> H >> W, H){\n\tint field[MAX_H][MAX_W];\n\tint sx,sy,gx,gy;\n\tfor(int i = 0 ; i < H ; i++){\n\t for(int j = 0 ; j < W ; j++){\n\t\tcin >> field[i][j];\n\t }\n\t}\n\tcin >> sy >> sx >> gy >> gx;\n\tint cost[MAX_H][MAX_W][6][6][6];\n\tfor(int i = 0 ; i < H ; i++){\n\t for(int j = 0 ; j < W ; j++){\n\t\tfor(int k = 0 ; k < 6 ; k++){\n\t\t for(int l = 0 ; l < 6 ; l++){\n\t\t\tfor(int m = 0 ; m < 6 ; m++){\n\t\t\t cost[i][j][k][l][m] = 1e9;\n\t\t\t}\n\t\t }\n\t\t}\n\t }\n\t}\n\tDice die;\n\tcost[sy][sx][die.d[0]][die.d[1]][die.d[2]] = 0;\n\tpriority_queue<State> Q;\n\tQ.push((State){0,sx,sy,die});\n\tconst int dx[] = {-1,0,1,0};\n\tconst int dy[] = {0,-1,0,1};\n\twhile(!Q.empty()){\n\t State s = Q.top(); Q.pop();\n\t int x = s.x, y = s.y;\n\t int ncost = cost[y][x][s.d.d[0]][s.d.d[1]][s.d.d[2]];\n\t if(ncost < s.cost){ continue; }\n\t if(x == gx && y == gy){\n\t\tcout << s.cost << endl;\n\t\tbreak;\n\t }\n\t for(int i = 0 ; i < 4 ; i++){\n\t\tint nx = x + dx[i], ny = y + dy[i];\n\t\tDice d = s.d;\n\t\tif(0 > nx || nx >= W || 0 > ny || ny >= H){\n\t\t continue;\n\t\t}\n\t\tswitch(i){\n\t\tcase 0:\n\t\t d.rollW();\n\t\t break;\n\t\tcase 1:\n\t\t d.rollN();\n\t\t break;\n\t\tcase 2:\n\t\t d.rollE();\n\t\t break;\n\t\tcase 3:\n\t\t d.rollS();\n\t\t break;\n\t\t}\n\t\tint p = (d.d[5]+1)*field[ny][nx];\n\t\tif(s.cost + p < cost[ny][nx][d.d[0]][d.d[1]][d.d[2]]){\n\t\t cost[ny][nx][d.d[0]][d.d[1]][d.d[2]] = s.cost + p;\n\t\t Q.push((State){cost[ny][nx][d.d[0]][d.d[1]][d.d[2]],nx,ny,d});\n\t\t}\n\t }\n\t}\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3204,
"score_of_the_acc": -0.04,
"final_rank": 6
},
{
"submission_id": "aoj_1057_1841541",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cstring>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include <functional>\n#include <queue>\nusing namespace std;\n\nint field[10][10];\n\ntypedef long long W;\n\nconst W INF = 1LL << 50;\n\nstruct edge {\n\tint to;\n\tW cost;\n};\ntypedef pair<W, int> P;\ntypedef vector<vector <edge > > Graph;\n\nvoid dijkstra(int s, const Graph& G, vector<W>& d) {\n\tpriority_queue< P, vector<P>, greater<P> > que;\n\tfill(d.begin(), d.end(), INF);\n\td[s] = 0;\n\tque.push(P(0, s));\n\twhile(!que.empty()) {\n\t\tP p = que.top();\n\t\tque.pop();\n\t\tint v = p.second;\n\t\tif(d[v] < p.first) continue;\n\t\tfor(int i = 0; i < G[v].size(); i++) {\n\t\t\tedge e = G[v][i];\n\t\t\tif(d[e.to] > d[v] + e.cost) {\n\t\t\t\td[e.to] = d[v] + e.cost;\n\t\t\t\tque.push(P(d[e.to], e.to));\n\t\t\t}\n\t\t}\n\t}\n}\n\nint toV(int x, int y, int a, int b, int c) {\n\treturn x * 10 * 7 * 7 * 7 + y * 7 * 7 * 7 + a * 7 * 7 + b * 7 + c;\n}\n\nint dx[] = { 0, 1, 0, -1 }, dy[] = { -1, 0, 1, 0 };\n\nvoid rot(int k, int a, int b, int c, int& na, int& nb, int& nc) {\n\tif(k == 0) {\n\t\tna = 7 - b;\n\t\tnb = a;\n\t\tnc = c;\n\t}\n\tif(k == 1) {\n\t\tna = a;\n\t\tnb = 7 - c;\n\t\tnc = b;\n\t}\n\tif(k == 2) {\n\t\tna = b;\n\t\tnb = 7 - a;\n\t\tnc = c;\n\t}\n\tif(k == 3) {\n\t\tna = a;\n\t\tnb = c;\n\t\tnc = 7 - b;\n\t}\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint h, w, sx, sy, gx, gy;\n\twhile(cin >> h >> w, h) {\n\t\tfor(int y = 0; y < h; y++) {\n\t\t\tfor(int x = 0; x < w; x++) {\n\t\t\t\tcin >> field[y][x];\n\t\t\t}\n\t\t}\n\n\t\tcin >> sy >> sx >> gy >> gx;\n\n\t\tGraph G(10 * 10 * 7 * 7 * 7);\n\t\tvector<W> d(10 * 10 * 7 * 7 * 7);\n\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 k = 0; k < 4; k++) {\n\t\t\t\t\tint nx = x + dx[k], ny = y + dy[k];\n\t\t\t\t\tif(nx < 0 || w <= nx || ny < 0 || h <= ny) continue;\n\t\t\t\t\tfor(int a = 1; a <= 6; a++) {\n\t\t\t\t\t\tfor(int b = 1; b <= 6; b++) {\n\t\t\t\t\t\t\tfor(int c = 1; c <= 6; c++) {\n\t\t\t\t\t\t\t\tint v1 = toV(x, y, a, b, c);\n\t\t\t\t\t\t\t\tint na, nb, nc;\n\t\t\t\t\t\t\t\trot(k, a, b, c, na, nb, nc);\n\t\t\t\t\t\t\t\tint v2 = toV(nx, ny, na, nb, nc);\n\t\t\t\t\t\t\t\tG[v1].push_back(edge{ v2, field[ny][nx] * (7 - nb) });\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\n\t\tdijkstra(toV(sx, sy, 2, 1, 3), G, d);\n\t\tW ans = INF;\n\t\tfor(int a = 1; a <= 6; a++) {\n\t\t\tfor(int b = 1; b <= 6; b++) {\n\t\t\t\tfor(int c = 1; c <= 6; c++) {\n\t\t\t\t\tans = min(ans, d[toV(gx, gy, a, b, c)]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 320,
"memory_kb": 5484,
"score_of_the_acc": -0.4235,
"final_rank": 15
},
{
"submission_id": "aoj_1057_1841064",
"code_snippet": "#include <iostream>\n#include <queue>\n#include <vector>\n#include <tuple>\n#include <algorithm>\nusing namespace std;\n\ntypedef tuple<int,int,int,int,int,int> T;//<cost,A,B,C,y,x>\n#define INF 1e8\n\nint main(){\n int h,w;\n int map[10][10];//[y][x]\n int minimum[6][6][6][10][10];//[テ、ツクツ甘ゥツ敖「テ」ツ?ョテァツ崢ョ][テ・ツ債療・ツ青妥」ツ?江[テヲツ敖アテ・ツ青妥」ツ?江[][y][x]\n priority_queue<T,vector<T>,greater<T>> que;\n while(cin>>h>>w,h){\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n cin>>map[i][j];\n }\n }\n int start_y,start_x,end_y,end_x;\n cin>>start_y>>start_x>>end_y>>end_x;\n while(!que.empty())que.pop();\n que.push(T(0,1,2,3,start_y,start_x));\n fill(minimum[0][0][0][0],minimum[6][0][0][0],INF);\n while(!que.empty()){\n T t = que.top(); que.pop();\n int cost=get<0>(t), A=get<1>(t),B=get<2>(t),C=get<3>(t), y=get<4>(t), x=get<5>(t);\n if(cost>minimum[A-1][B-1][C-1][y][x]) continue;\n int penalty;\n //テ・ツ個?\n if(y){\n int newA=B,newB=7-A,newC=C;\n penalty=cost+(7-newA)*map[y-1][x];\n if(penalty<minimum[newA-1][newB-1][newC-1][y-1][x]){\n minimum[newA-1][newB-1][newC-1][y-1][x]=penalty;\n que.emplace(penalty,newA,newB,newC,y-1,x);\n }\n }\n //テ・ツ債?\n if(y!=h-1){\n int newA=7-B,newB=A,newC=C;\n penalty=cost+(7-newA)*map[y+1][x];\n if(penalty<minimum[newA-1][newB-1][newC-1][y+1][x]){\n minimum[newA-1][newB-1][newC-1][y+1][x]=penalty;\n que.emplace(penalty,newA,newB,newC,y+1,x);\n }\n }\n //テヲツ敖ア\n if(x!=w-1){\n int newA=7-C,newB=B,newC=A;\n penalty=cost+(7-newA)*map[y][x+1];\n if(penalty<minimum[newA-1][newB-1][newC-1][y][x+1]){\n minimum[newA-1][newB-1][newC-1][y][x+1]=penalty;\n que.emplace(penalty,newA,newB,newC,y,x+1);\n }\n }\n //ティツ・ツソ\n if(x){\n int newA=C,newB=B,newC=7-A;\n penalty=cost+(7-newA)*map[y][x-1];\n if(penalty<minimum[newA-1][newB-1][newC-1][y][x-1]){\n minimum[newA-1][newB-1][newC-1][y][x-1]=penalty;\n que.emplace(penalty,newA,newB,newC,y,x-1);\n }\n }\n }\n int ans=INF;\n for(int i=0;i<6;i++)for(int j=0;j<6;j++)for(int k=0;k<6;k++)ans=min(ans,minimum[i][j][k][end_y][end_x]);\n cout<<ans<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3096,
"score_of_the_acc": -0.0378,
"final_rank": 5
},
{
"submission_id": "aoj_1057_1170746",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX_H 10\n#define MAX_W 10\n\nstruct Dice{\n int tmp,d[6];\n Dice(){\n for(int i = 0 ; i < 6 ; i++){\n d[i] = i;\n }\n }\n void rollN(){\n tmp = d[0];\n d[0] = d[1];\n d[1] = d[5];\n d[5] = d[4];\n d[4] = tmp;\n }\n void rollE(){\n tmp = d[0];\n d[0] = d[3];\n d[3] = d[5];\n d[5] = d[2];\n d[2] = tmp;\n }\n void rollS(){\n tmp = d[0];\n d[0] = d[4];\n d[4] = d[5];\n d[5] = d[1];\n d[1] = tmp;\n }\n void rollW(){\n tmp = d[0];\n d[0] = d[2];\n d[2] = d[5];\n d[5] = d[3];\n d[3] = tmp;\n }\n};\n\nstruct State{\n int cost,x,y;\n Dice d;\n bool operator < (const State &s)const{\n return cost > s.cost;\n }\n};\n\nint main(){\n int H,W;\n while(cin >> H >> W, H){\n int field[MAX_H][MAX_W];\n int sx,sy,gx,gy;\n for(int i = 0 ; i < H ; i++){\n for(int j = 0 ; j < W ; j++){\n cin >> field[i][j];\n }\n }\n cin >> sy >> sx >> gy >> gx;\n int cost[MAX_H][MAX_W][6][6][6];\n for(int i = 0 ; i < H ; i++){\n for(int j = 0 ; j < W ; j++){\n for(int k = 0 ; k < 6 ; k++){\n for(int l = 0 ; l < 6 ; l++){\n for(int m = 0 ; m < 6 ; m++){\n cost[i][j][k][l][m] = 1e9;\n }\n }\n }\n }\n }\n Dice die;\n cost[sy][sx][die.d[0]][die.d[1]][die.d[2]] = 0;\n priority_queue<State> Q;\n Q.push((State){0,sx,sy,die});\n const int dx[] = {-1,0,1,0};\n const int dy[] = {0,-1,0,1};\n while(!Q.empty()){\n State s = Q.top(); Q.pop();\n int x = s.x, y = s.y;\n int ncost = cost[y][x][s.d.d[0]][s.d.d[1]][s.d.d[2]];\n if(ncost < s.cost){ continue; }\n if(x == gx && y == gy){\n cout << s.cost << endl;\n break;\n }\n for(int i = 0 ; i < 4 ; i++){\n int nx = x + dx[i], ny = y + dy[i];\n Dice d = s.d;\n if(0 > nx || nx >= W || 0 > ny || ny >= H){\n continue;\n }\n switch(i){\n case 0:\n d.rollW();\n break;\n case 1:\n d.rollN();\n break;\n case 2:\n d.rollE();\n break;\n case 3:\n d.rollS();\n break;\n }\n int p = (d.d[5]+1)*field[ny][nx];\n if(s.cost + p < cost[ny][nx][d.d[0]][d.d[1]][d.d[2]]){\n cost[ny][nx][d.d[0]][d.d[1]][d.d[2]] = s.cost + p;\n Q.push((State){cost[ny][nx][d.d[0]][d.d[1]][d.d[2]],nx,ny,d});\n }\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1320,
"score_of_the_acc": -0.0124,
"final_rank": 2
},
{
"submission_id": "aoj_1057_1168460",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<cstring>\nusing namespace std;\nstruct state{\n int y,x,a,b,c,d,e,f,cost;\n bool operator < (const state&p)const{\n return cost > p.cost;\n }\n};\n\nint h,w;\nint t[10][10];\n\nint d[10][10][6][6][6][6][6][6];\n\nvoid solve(){\n int ay,ax,by,bx;\n cin>>ay>>ax>>by>>bx;\n //memset(d,sizeof(d),0); \n for(int i=0;i<10;i++)\n for(int j=0;j<10;j++)\n for(int k=0;k<6;k++)\n for(int l=0;l<6;l++)\n for(int m=0;m<6;m++)\n for(int n=0;n<6;n++)\n for(int o=0;o<6;o++)\n for(int p=0;p<6;p++)\n d[i][j][k][l][m][n][o][p]=0;\n d[ay][ax][0][1][2][3][4][5]=1;\n priority_queue< state > Q;\n Q.push((state){ay,ax,0,1,2,3,4,5,1});\n while(!Q.empty()){\n state s=Q.top();Q.pop();\n if(s.cost>d[s.y][s.x][s.a][s.b][s.c][s.d][s.e][s.f])continue;\n if(s.y==by&&s.x==bx){cout<<s.cost-1<<endl;return;}\n if(s.y>0){\n int* k=&d[s.y-1][s.x][s.b][s.f][s.c][s.d][s.a][s.e];\n int ncost=s.cost+(s.e+1)*t[s.y-1][s.x];\n if( *k==0 || ncost < *k){\n\t*k=ncost;\n\tQ.push((state){s.y-1,s.x,s.b,s.f,s.c,s.d,s.a,s.e,ncost});\n }\n }\n if(s.y+1<h){\n int* k=&d[s.y+1][s.x][s.e][s.a][s.c][s.d][s.f][s.b];\n int ncost=s.cost+(s.b+1)*t[s.y+1][s.x];\n if( *k==0 || ncost < *k){\n\t*k=ncost;\n\tQ.push((state){s.y+1,s.x,s.e,s.a,s.c,s.d,s.f,s.b,ncost});\n }\n }\n if(s.x>0){\n int* k=&d[s.y][s.x-1][s.c][s.b][s.f][s.a][s.e][s.d];\n int ncost=s.cost+(s.d+1)*t[s.y][s.x-1];\n if( *k==0 || ncost < *k){\n\t*k=ncost;\n\tQ.push((state){s.y,s.x-1,s.c,s.b,s.f,s.a,s.e,s.d,ncost});\n } \n }\n if(s.x+1<w){\n int* k=&d[s.y][s.x+1][s.d][s.b][s.a][s.f][s.e][s.c];\n int ncost=s.cost+(s.c+1)*t[s.y][s.x+1];\n if( *k==0 || ncost < *k){\n\t*k=ncost;\n\tQ.push((state){s.y,s.x+1,s.d,s.b,s.a,s.f,s.e,s.c,ncost});\n } \n }\n }\n cout<<\"NA\"<<endl;\n}\n\nint main(){\n while(1){\n cin>>h>>w;\n if(h==0&&w==0)break;\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++)\n\tcin>>t[i][j];\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 19480,
"score_of_the_acc": -0.6875,
"final_rank": 17
},
{
"submission_id": "aoj_1057_1168425",
"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\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\n\n#define roll_swap(x, a, b, c, d) swap(x.a, x.b), swap(x.b, x.c), swap(x.c, x.d);\nstruct Dice {\n int top, front, right, left, back, bottom;\n \n Dice(int to = 1, int fr = 2, int ri = 3, int le = 4, int ba = 5, int bo = 6) \n : top(to), front(fr), right(ri), left(le), back(ba), bottom(bo) { }\n void roll_right() { roll_swap((*this), top, left, bottom, right); }\n void roll_left() { roll_swap((*this), top, right, bottom, left); }\n void roll_front() { roll_swap((*this), top, back, bottom, front); }\n void roll_back() { roll_swap((*this), top, front, bottom, back); }\n void roll_cw() { roll_swap((*this), back, left, front, right); }\n void roll_ccw() { roll_swap((*this), back, right, front, left); }\n void roll(int dir) {\n if (dir == 0) (*this).roll_front();\n if (dir == 1) (*this).roll_right();\n if (dir == 2) (*this).roll_back();\n if (dir == 3) (*this).roll_left();\n }\n friend bool operator < (const Dice &d1, const Dice &d2) {\n int vd1[] = {d1.top, d1.front, d1.right, d1.left, d1.back, d1.bottom};\n int vd2[] = {d2.top, d2.front, d2.right, d2.left, d2.back, d2.bottom};\n return vector<int>(vd1, vd1 + 6) < vector<int>(vd2, vd2 + 6);\n }\n friend ostream& operator << (ostream& s, const Dice& d) { \n return s << '<' << d.top << ',' << d.front << ',' << d.right << '>'; \n }\n};\n\nvector<Dice> all_rotate() {\n vector<Dice> res(24);\n Dice d;\n for (int i = 0; i < 6; ++i) {\n for (int j = 0; j < 4; j++) {\n res[i * 4 + j] = d;\n d.roll_cw();\n }\n if (i & 1) d.roll_front();\n else d.roll_right();\n }\n return res; \n}\n\nconst int INF = 1<<29;\n\nint n, m;\nint fi[15][15];\nint sx, sy, tx, ty;\n\nint main() {\n //freopen( \"/Users/macuser/Dropbox/Contest/input.in\", \"r\", stdin );\n \n vector<Dice> vd = all_rotate();\n map<Dice,int> ma;\n for (int i = 0; i < vd.size(); ++i) ma[vd[i]] = i;\n \n// COUT(vd);\n// COUT(ma);\n \n while (cin >> n >> m) {\n if (n == 0) break;\n for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) cin >> fi[i][j];\n cin >> sx >> sy >> tx >> ty;\n \n int dp[15][15][31];\n for (int i = 0; i < 15; ++i) for (int j = 0; j < 15; ++j) for (int k = 0; k < 31; ++k) dp[i][j][k] = INF;\n dp[sx][sy][0] = 0;\n priority_queue< pair<int,pair<pint,int> >, vector<pair<int,pair<pint,int> > >, greater<pair<int,pair<pint,int> > > > que;\n que.push( MP(0, MP(pint(sx,sy), 0)) );\n while (!que.empty()) {\n //cout << que.top() << endl;\n \n int dist = que.top().first;\n int x = que.top().second.first.first;\n int y = que.top().second.first.second;\n int id = que.top().second.second;\n Dice d = vd[id];\n que.pop();\n \n if (dist > dp[x][y][id]) continue;\n \n for (int i = 0; i < 4; ++i) {\n int nx = x + dx[i], ny = y + dy[i];\n if (nx < 0 || nx >= n || ny < 0 || ny >= m) continue;\n Dice nd = d;\n nd.roll(i);\n int nid = ma[nd];\n \n int add = nd.bottom * fi[nx][ny];\n int ndist = dist + add;\n if (chmin(dp[nx][ny][nid], ndist)) {\n que.push( MP(ndist, MP(pint(nx,ny),nid)) );\n }\n }\n }\n \n int Min = INF;\n for (int i = 0; i < 24; ++i) chmin(Min, dp[tx][ty][i]);\n \n cout << Min << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 1244,
"score_of_the_acc": -0.1848,
"final_rank": 10
},
{
"submission_id": "aoj_1057_1140478",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<'L'<<__LINE__<<\": \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<endl\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tos<<'(';\n\tprint_tuple<Args...>(os,t);\n\treturn os<<')';\n}\n\nstruct Die{\n\tarray<int,6> faces;\n\tDie(){\n\t\tfaces[0]=2; faces[1]=5;\n\t\tfaces[2]=3; faces[3]=4;\n\t\tfaces[4]=1; faces[5]=6;\n\t}\n\tvoid Rotate(int a,int b,int c,int d){\n\t\tswap(faces[a],faces[b]);\n\t\tswap(faces[b],faces[c]);\n\t\tswap(faces[c],faces[d]);\n\t}\n\tvoid TurnU(){Rotate(4,0,5,1);}\n\tvoid TurnD(){Rotate(4,1,5,0);}\n\tvoid TurnL(){Rotate(4,2,5,3);}\n\tvoid TurnR(){Rotate(4,3,5,2);}\n};\nbool operator<(const Die& a,const Die& b){\n\treturn lexicographical_compare(begin(a.faces),end(a.faces),begin(b.faces),end(b.faces));\n}\nbool operator>(const Die& a,const Die& b){\n\treturn lexicographical_compare(begin(b.faces),end(b.faces),begin(a.faces),end(a.faces));\n}\n\ntemplate<typename Functor>\nstruct functor_traits{\n\ttemplate<typename C,typename Ret,typename Arg,typename... Args>\n\tstatic Arg helper(Ret(C::*)(Arg,Args...));\n\ttemplate<typename C,typename Ret,typename Arg,typename... Args>\n\tstatic Arg helper(Ret(C::*)(Arg,Args...)const);\n\ttypedef decltype(helper(&Functor::operator())) first_argument_type;\n};\ntemplate<typename Compare,typename T=typename functor_traits<Compare>::first_argument_type>\npriority_queue<T,vector<T>,Compare> make_priority_queue(Compare comp){\n\treturn priority_queue<T,vector<T>,Compare>(move(comp));\n}\n\nint main()\n{\n\tfor(int h,w;cin>>h>>w && h|w;){\n\t\tvector<vector<int>> grid(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>>grid[i][j];\n\t\tint si,sj,gi,gj; cin>>si>>sj>>gi>>gj;\n\t\t\n\t\tauto pq=make_priority_queue([](tuple<Die,int,int,int> a,tuple<Die,int,int,int> b){\n\t\t\treturn get<3>(a)>get<3>(b);\n\t\t});\n\t\tpq.emplace(Die(),si,sj,0);\n\t\tset<tuple<Die,int,int>> vis;\n\t\twhile(pq.size()){\n\t\t\tDie d; int i,j,c; tie(d,i,j,c)=pq.top(); pq.pop();\n\t\t\tif(vis.count(make_tuple(d,i,j))) continue;\n\t\t\tvis.insert(make_tuple(d,i,j));\n\t\t\tif(i==gi && j==gj){\n\t\t\t\tcout<<c<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfunction<void(Die&)> turns[]={&Die::TurnU,&Die::TurnD,&Die::TurnL,&Die::TurnR};\n\t\t\tfor(int k=0;k<4;k++){\n\t\t\t\tint ni=i+\"\\xff\\x1\\0\\0\"[k],nj=j+\"\\0\\0\\xff\\x1\"[k];\n\t\t\t\tif(0<=ni && ni<h && 0<=nj && nj<w){\n\t\t\t\t\tDie t=d;\n\t\t\t\t\tturns[k](t);\n\t\t\t\t\tpq.emplace(t,ni,nj,c+t.faces[5]*grid[ni][nj]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 1356,
"score_of_the_acc": -0.111,
"final_rank": 9
},
{
"submission_id": "aoj_1057_1131823",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\n#include<map>\n#include<queue>\nusing namespace std;\nint ijk[11][11][800];\nint v[11][11][800];\nint c[12][12];\nstruct wolf{\n\tint t[6];\n\twolf(){\n\t\tfor(int i=0;i<6;i++)t[i]=i;\n\t}\n};\ninline bool operator<(const wolf&a,const wolf&b){\n\tfor(int i=0;i<6;i++)if(a.t[i]!=b.t[i])return a.t[i]<b.t[i];\n\treturn false;\n}\nmap<wolf,int>m;\nvector<wolf>rev;\nvoid rN(wolf &a){int tmp=a.t[0];a.t[0]=a.t[1];a.t[1]=a.t[5];a.t[5]=a.t[4];a.t[4]=tmp;}\nvoid rS(wolf &a){int tmp=a.t[0];a.t[0]=a.t[4];a.t[4]=a.t[5];a.t[5]=a.t[1];a.t[1]=tmp;}\nvoid rE(wolf &a){int tmp=a.t[0];a.t[0]=a.t[3];a.t[3]=a.t[5];a.t[5]=a.t[2];a.t[2]=tmp;}\nvoid rW(wolf &a){int tmp=a.t[0];a.t[0]=a.t[2];a.t[2]=a.t[5];a.t[5]=a.t[3];a.t[3]=tmp;}\nint main(){\n\tint a,b;\n\twolf test;\n\tint sz=0;\n\tdo{\n\t\trev.push_back(test);\n\t\tm[test]=sz++;\n\t}while(next_permutation(test.t,test.t+6));\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++)scanf(\"%d\",&c[i][j]);\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++)for(int k=0;k<sz;k++){\n\t\t\tijk[i][j][k]=999999999;v[i][j][k]=0;\n\t\t}\n\t\tint sr,sc,gr,gc;scanf(\"%d%d%d%d\",&sr,&sc,&gr,&gc);\n\t\tijk[sr][sc][0]=0;\n\t\tpriority_queue<pair<pair<int,int>,pair<int,int> > >Q;\n\t\tQ.push(make_pair(make_pair(0,0),make_pair(sr,sc)));\n\t\twhile(Q.size()){\n\t\t\tint cost=-Q.top().first.first;\n\t\t\tint st=Q.top().first.second;\n\t\t\twolf now=rev[st];\n\t\t\tint row=Q.top().second.first;\n\t\t\tint col=Q.top().second.second;\n\t\t\tQ.pop();\n\t\t\tif(v[row][col][st])continue;\n\t\t\tv[row][col][st]=1;\n\t\t\tint to;\n\t\t\trN(now);to=m[now];\n\t\t\tif(row&&!v[row-1][col][to]&&ijk[row-1][col][to]>cost+(now.t[5]+1)*c[row-1][col]){\n\t\t\t\tijk[row-1][col][to]=cost+(now.t[5]+1)*c[row-1][col];\n\t\t\t\tQ.push(make_pair(make_pair(-ijk[row-1][col][to],to),make_pair(row-1,col)));\n\t\t\t}rS(now);\n\t\t\trS(now);to=m[now];\n\t\t\tif(row<a-1&&!v[row+1][col][to]&&ijk[row+1][col][to]>cost+(now.t[5]+1)*c[row+1][col]){\n\t\t\t\tijk[row+1][col][to]=cost+(now.t[5]+1)*c[row+1][col];\n\t\t\t\tQ.push(make_pair(make_pair(-ijk[row+1][col][to],to),make_pair(row+1,col)));\n\t\t\t}rN(now);\n\t\t\trW(now);to=m[now];\n\t\t\tif(col&&!v[row][col-1][to]&&ijk[row][col-1][to]>cost+(now.t[5]+1)*c[row][col-1]){\n\t\t\t\tijk[row][col-1][to]=cost+(now.t[5]+1)*c[row][col-1];\n\t\t\t\tQ.push(make_pair(make_pair(-ijk[row][col-1][to],to),make_pair(row,col-1)));\n\t\t\t}rE(now);\n\t\t\trE(now);to=m[now];\n\t\t\tif(col<b-1&&!v[row][col+1][to]&&ijk[row][col+1][to]>cost+(now.t[5]+1)*c[row][col+1]){\n\t\t\t\tijk[row][col+1][to]=cost+(now.t[5]+1)*c[row][col+1];\n\t\t\t\tQ.push(make_pair(make_pair(-ijk[row][col+1][to],to),make_pair(row,col+1)));\n\t\t\t}rW(now);\n\t\t}\n\t\tint ret=99999999;\n\t\tfor(int i=0;i<sz;i++)ret=min(ret,ijk[gr][gc][i]);\n\t\tprintf(\"%d\\n\",ret);\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1812,
"score_of_the_acc": -0.0442,
"final_rank": 7
},
{
"submission_id": "aoj_1057_952094",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<cstring>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\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);}\n\nstruct Status {\n int x, y, cost;\n Dice d;\n bool operator<(const Status &s) const {return cost > s.cost;}\n};\n\nint main() {\n while (true) {\n int h, w;\n cin >> h >> w;\n if (h == 0) break;\n int board[h][w];\n rep (i, h) rep (j, w) cin >> board[i][j];\n int x1, y1, x2, y2;\n cin >> y1 >> x1 >> y2 >> x2;\n int dis[h][w][6][6][6];\n memset(dis, -1, sizeof(dis));\n priority_queue<Status> que;\n Dice d(6);\n rep (i, 6) d[i] = i + 1;\n que.push((Status){x1, y1, 0, d});\n while (!que.empty()) {\n Status now = que.top();\n que.pop();\n if (now.y == y2 && now.x == x2) {\n\tcout << now.cost << endl;\n\tbreak;\n }\n if (now.x < 0 || w <= now.x || now.y < 0 || h <= now.y) continue;\n if (dis[now.y][now.x][now.d[TOP]][now.d[FRONT]][now.d[RIGHT]] != -1) continue;\n dis[now.y][now.x][now.d[TOP]][now.d[FRONT]][now.d[RIGHT]] = now.cost;\n Dice d1 = now.d, d2 = now.d, d3 = now.d, d4 = now.d;\n rotate_r(d1);\n rotate_l(d2);\n rotate_f(d3);\n rotate_b(d4);\n if (now.x < w - 1) que.push((Status){now.x + 1, now.y, now.cost + d1[BOTTOM] * board[now.y][now.x + 1], d1});\n if (0 < now.x) que.push((Status){now.x - 1, now.y, now.cost + d2[BOTTOM] * board[now.y][now.x - 1], d2});\n if (now.y < h - 1) que.push((Status){now.x, now.y + 1, now.cost + d3[BOTTOM] * board[now.y + 1][now.x], d3});\n if (0 < now.y) que.push((Status){now.x, now.y - 1, now.cost + d4[BOTTOM] * board[now.y - 1][now.x], d4});\n }\n }\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 1448,
"score_of_the_acc": -0.1998,
"final_rank": 12
},
{
"submission_id": "aoj_1057_904269",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <numeric>\n#include <cctype>\n#include <tuple>\n\n#ifdef _MSC_VER\n#include <agents.h>\n#endif\n\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\n#define rep(i, n) FOR(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define REV(v) v.rbegin(), v.rend()\n#define MEMSET(v, s) memset(v, s, sizeof(v))\n#define X first\n#define Y second\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nstd::istream &operator>>(std::istream &is, P &p){\n\treturn is >> p.first >> p.second;\n}\n\nstruct Dice{\nprivate:\n\tstatic const int _roll[4][6], _turn[2][6];\npublic:\n\tvector<int> value;\n\t// 1-6 : top, near, right, left, far, bottom \n\n\tDice(){\n\t\tvalue.resize(6);\n\t\tfor (int i = 0; i < 6; ++i) value[i] = i+1;\n\t}\n\tDice(initializer_list<int> il){\n\t\tvalue.resize(6, -1);\n\t\tint cnt = 0;\n\t\tfor (auto &e : il){\n\t\t\tvalue[cnt++] = e;\n\t\t\tif (cnt >= 6) break;\n\t\t}\n\t\tfor (int i = 0; i < 6; ++i) if (value[i] < 0) value[i] = 5 - value[5 - i];\n\t}\n\n\tvoid roll(int dir){ // N, E, W, S\n\t\tvector<int> nxt(6);\n\t\tfor (int i = 0; i < 6; ++i){\n\t\t\tnxt[i] = value[_roll[dir][i]];\n\t\t}\n\t\tvalue = nxt;\n\t}\n\n\tvoid turn(int dir){ // L, R\n\t\tvector<int> nxt(6);\n\t\tfor (int i = 0; i < 6; ++i){\n\t\t\tnxt[i] = value[_turn[dir][i]];\n\t\t}\n\t\tvalue = nxt;\n\t}\n\n\tint &operator[](int i){\n\t\treturn value[i];\n\t}\n};\n\nconst int Dice::_roll[4][6] = {\n\t{ 1, 5, 2, 3, 0, 4 }, // North\n\t{ 3, 1, 0, 5, 4, 2 }, // East\n\t{ 2, 1, 5, 0, 4, 3 }, // West\n\t{ 4, 0, 2, 3, 5, 1 }, // South\n};\n\nconst int Dice::_turn[2][6] = {\n\t{ 0, 3, 1, 4, 2, 5 }, // Left\n\t{ 0, 2, 4, 1, 3, 5 }, // Right\n};\n\nint board[10][10];\n\nstruct state{\n\tP first;\n\tDice second;\n\tbool operator<(const state &r)const{\n\t\tif(first != r.first) return first < r.first;\n\t\trep(i, 6) if (second.value[i] != r.second.value[i]) return second.value[i] < r.second.value[i];\n\t\treturn false;\n\t}\n};\n\nint dx[] = {0, 1, -1, 0};\nint dy[] = {-1, 0, 0, 1};\n\nint main(){\n\tint h, w;\n\twhile (cin >> h >> w, h | w){\n\t\trep(i, h) rep(j, w) cin >> board[i][j];\n\t\tP s, g;\n\t\tcin >> s >> g;\n\n\t\tmap<state, int> m;\n\n\t\tpriority_queue<pair<int, state>, vector<pair<int, state>>, greater<pair<int, state>>> q;\n\t\tq.push(make_pair(0, state{ s, Dice() }));\n\t\tint ans = -1;\n\t\twhile (!q.empty()){\n\t\t\tint dist = q.top().first;\n\t\t\tstate s = q.top().second;\n\t\t\tP &pos = s.first;\n\t\t\tDice &d = s.second;\n\t\t\tq.pop();\n\t\t\t\n\t\t\tif (m[s] < dist) continue;\n\t\t\tif (s.first == g){\n\t\t\t\tans = dist;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\trep(i, 4){\n\t\t\t\tint nx = pos.second + dx[i], ny = pos.first + dy[i];\n\t\t\t\tif (nx < 0 || nx >= w || ny < 0 || ny >= h) continue;\n\t\t\t\tstate nxt = s;\n\t\t\t\tnxt.second.roll(i);\n\t\t\t\tnxt.first = make_pair(ny, nx);\n\t\t\t\tif (m.count(nxt) && m[nxt] <= dist + nxt.second[5] * board[ny][nx]) continue;\n\t\t\t\tm[nxt] = dist + nxt.second[5] * board[ny][nx];\n\t\t\t\tq.push(make_pair(dist + nxt.second[5] * board[ny][nx], nxt));\n\t\t\t}\n\t\t}\n\t\t//cout << \"+++\";\n\t\tcout << ans << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 1392,
"score_of_the_acc": -0.1878,
"final_rank": 11
},
{
"submission_id": "aoj_1057_786686",
"code_snippet": "#include <algorithm>\n#include <cassert>\n#include <cstdlib>\n#include <functional>\n#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n\nconstexpr int NUMBER_OF_FACES = 6;\nenum FACE { TOP, BOTTOM, NORTH, SOUTH, WEST, EAST };\n\nclass dice {\nprivate:\n\tint num[NUMBER_OF_FACES];\n\npublic:\n\tinline void roll(FACE a, FACE b, FACE c, FACE d) {\n\t\tswap(num[a], num[b]);\n\t\tswap(num[b], num[c]);\n\t\tswap(num[c], num[d]);\n\t}\n\n\tdice() {\n\t\tnum[TOP] = 1;\n\t\tnum[BOTTOM] = 6;\n\t\tnum[NORTH] = 5;\n\t\tnum[SOUTH] = 2;\n\t\tnum[EAST] = 3;\n\t\tnum[WEST] = 4;\n\t}\n\n\tdice(const dice& d) {\n\t\tnum[TOP] = d[TOP];\n\t\tnum[BOTTOM] = d[BOTTOM];\n\t\tnum[NORTH] = d[NORTH];\n\t\tnum[SOUTH] = d[SOUTH];\n\t\tnum[EAST] = d[EAST];\n\t\tnum[WEST] = d[WEST];\n\t}\n\n\tinline int encode() const {\n\t\treturn (num[TOP] - 1) * NUMBER_OF_FACES * NUMBER_OF_FACES + (num[NORTH] - 1) * NUMBER_OF_FACES + (num[EAST] - 1);\n\t}\n\n\tconst int& operator[] (FACE f) const { return num[f]; }\n};\n\nvoid north(dice& d) { d.roll(TOP, SOUTH, BOTTOM, NORTH); }\nvoid east(dice& d) { d.roll(TOP, WEST, BOTTOM, EAST); }\nvoid west(dice& d) { d.roll(TOP, EAST, BOTTOM, WEST); }\nvoid south(dice& d) { d.roll(TOP, NORTH, BOTTOM, SOUTH); }\n\n\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nvoid (*rotate_dice[4])(dice& d) = {east, south, west, north};\n\nconstexpr int MAX_SIZE = 10;\nconstexpr int INF = 0xfffffff;\n\nint h, w;\nint gx, gy;\nint field[MAX_SIZE][MAX_SIZE];\n\ntypedef int weight;\nstruct state {\n\tint x, y;\n\tdice d;\n\tweight dist;\n\tstate(int x, int y, const dice& d, weight dist):x(x), y(y), d(d), dist(dist){}\n\n\tbool operator>(const state& s) const {\n\t\treturn dist > s.dist;\n\t}\n};\n\ninline bool out(int x, int y) {\n\treturn x < 0 || x >= w || y < 0 || y >= h;\n}\n\nweight dijkstra(int sx, int sy, dice d) {\n\tpriority_queue<state, vector<state>, greater<state> > que;\n\tvector<vector<vector<weight>>> dist(h, vector<vector<weight>>(w, vector<weight>(NUMBER_OF_FACES*NUMBER_OF_FACES*NUMBER_OF_FACES, INF)));\n\tdist[sy][sx][d.encode()] = 0;\n\tque.push(state(sx, sy, d, 0));\n\n\twhile(!que.empty()) {\n\t\tconst state s = que.top();\n\t\tque.pop();\n\n\t\tif(dist[s.y][s.x][s.d.encode()] < s.dist)\n\t\t\tcontinue;\n\n\t\tif(s.x == gx && s.y == gy)\n\t\t\treturn s.dist;\n\n\t\tfor(int i = 0; i < 4; ++i) {\n\t\t\tconst int nx = s.x + dx[i];\n\t\t\tconst int ny = s.y + dy[i];\n\t\t\tif(out(nx, ny)) continue;\n\t\t\tdice next_d(s.d);\n\t\t\trotate_dice[i](next_d);\n\n\t\t\tconst int next_dist = s.dist + next_d[BOTTOM] * field[ny][nx];\n\t\t\tconst int value = next_d.encode();\n\t\t\tif(dist[ny][nx][value] > next_dist) {\n\t\t\t\tdist[ny][nx][value] = next_dist;\n\t\t\t\tque.push(state(nx, ny, next_d, next_dist));\n\t\t\t}\n\t\t}\n\t}\n\n\tassert(false);\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\twhile(cin >> h >> w && h) {\n\t\tfor(int i = 0; i < h; ++i) {\n\t\t\tfor(int j = 0; j < w; ++j) {\n\t\t\t\tcin >> field[i][j];\n\t\t\t}\n\t\t}\n\n\t\tint sx, sy;\n\t\tcin >> sy >> sx >> gy >> gx;\n\n\t\tcout << dijkstra(sx, sy, dice()) << endl;\n\t}\n\n\treturn EXIT_SUCCESS;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1356,
"score_of_the_acc": -0.0132,
"final_rank": 4
},
{
"submission_id": "aoj_1057_786679",
"code_snippet": "#include <algorithm>\n#include <cassert>\n#include <cstdlib>\n#include <functional>\n#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n\nenum FACE { TOP, BOTTOM, NORTH, SOUTH, WEST, EAST };\n\nclass dice {\nprivate:\n\tint num[6];\n\npublic:\n\tinline void roll(FACE a, FACE b, FACE c, FACE d) {\n\t\tswap(num[a], num[b]);\n\t\tswap(num[b], num[c]);\n\t\tswap(num[c], num[d]);\n\t}\n\n\tdice() {\n\t\tnum[TOP] = 1;\n\t\tnum[BOTTOM] = 6;\n\t\tnum[NORTH] = 5;\n\t\tnum[SOUTH] = 2;\n\t\tnum[EAST] = 3;\n\t\tnum[WEST] = 4;\n\t}\n\n\tdice(const dice& d) {\n\t\tnum[TOP] = d[TOP];\n\t\tnum[BOTTOM] = d[BOTTOM];\n\t\tnum[NORTH] = d[NORTH];\n\t\tnum[SOUTH] = d[SOUTH];\n\t\tnum[EAST] = d[EAST];\n\t\tnum[WEST] = d[WEST];\n\t}\n\n\tint encode() const {\n\t\treturn (num[TOP] - 1) * 6 * 6 + (num[NORTH] - 1) * 6 + (num[EAST] - 1);\n\t}\n\n\tconst int& operator[] (FACE f) const { return num[f]; }\n};\n\nvoid north(dice& d) { d.roll(TOP, SOUTH, BOTTOM, NORTH); }\nvoid east(dice& d) { d.roll(TOP, WEST, BOTTOM, EAST); }\nvoid west(dice& d) { d.roll(TOP, EAST, BOTTOM, WEST); }\nvoid south(dice& d) { d.roll(TOP, NORTH, BOTTOM, SOUTH); }\n\n\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nvoid (*func[4])(dice& d) = {east, south, west, north};\n\nconstexpr int MAX_SIZE = 10;\nconstexpr int INF = 0xfffffff;\n\nint h, w;\nint gx, gy;\nint field[MAX_SIZE][MAX_SIZE];\n\ntypedef int weight;\nvector<weight> dist;\nstruct state {\n\tint x, y;\n\tdice d;\n\tweight dist;\n\tstate(int x, int y, const dice& d, weight dist):x(x), y(y), d(d), dist(dist){}\n\n\tbool operator>(const state& s) const {\n\t\treturn dist > s.dist;\n\t}\n};\n\ninline bool out(int x, int y) {\n\treturn x < 0 || x >= w || y < 0 || y >= h;\n}\n\nweight dijkstra(int sx, int sy, dice d) {\n\tpriority_queue<state, vector<state>, greater<state> > que;\n\tvector<vector<vector<weight>>> dist(h, vector<vector<weight>>(w, vector<weight>(6*6*6, INF)));\n\tdist[sy][sx][d.encode()] = 0;\n\tque.push(state(sx, sy, d, 0));\n\n\twhile(!que.empty()) {\n\t\tconst state s = que.top();\n\t\tque.pop();\n\n\t\tif(dist[s.y][s.x][s.d.encode()] < s.dist)\n\t\t\tcontinue;\n\n\t\tif(s.x == gx && s.y == gy)\n\t\t\treturn s.dist;\n\n\t\tfor(int i = 0; i < 4; ++i) {\n\t\t\tconst int nx = s.x + dx[i];\n\t\t\tconst int ny = s.y + dy[i];\n\t\t\tif(out(nx, ny)) continue;\n\t\t\tdice next_d(s.d);\n\t\t\tfunc[i](next_d);\n\n\t\t\tconst int next_dist = s.dist + next_d[BOTTOM] * field[ny][nx];\n\t\t\tconst int value = next_d.encode();\n\t\t\tif(dist[ny][nx][value] > next_dist) {\n\t\t\t\tdist[ny][nx][value] = next_dist;\n\t\t\t\tque.push(state(nx, ny, next_d, next_dist));\n\t\t\t}\n\t\t}\n\t}\n\n\tassert(false);\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\twhile(cin >> h >> w && h) {\n\t\tfor(int i = 0; i < h; ++i) {\n\t\t\tfor(int j = 0; j < w; ++j) {\n\t\t\t\tcin >> field[i][j];\n\t\t\t}\n\t\t}\n\n\t\tint sx, sy;\n\t\tcin >> sy >> sx >> gy >> gx;\n\n\t\tcout << dijkstra(sx, sy, dice()) << endl;\n\t}\n\n\treturn EXIT_SUCCESS;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1352,
"score_of_the_acc": -0.0022,
"final_rank": 1
},
{
"submission_id": "aoj_1057_786671",
"code_snippet": "#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iterator>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n#define dump(a) (cerr << (#a) << \" = \" << (a) << endl)\n\ntemplate<class T> inline void chmax(T& a, const T& b) { if(b > a) a = b; }\ntemplate<class T> inline void chmin(T& a, const T& b) { if(b < a) a = b; }\n\ntemplate<typename T, typename U>\nostream& operator<<(ostream& os, const pair<T, U>& p) {\n\tos << '(' << p.first << \", \" << p.second << ')';\n\treturn os;\n}\n\ntemplate<class Tuple, unsigned Index>\nvoid print_tuple(ostream& os, const Tuple& t) {}\n\ntemplate<class Tuple, unsigned Index, class Type, class... Types>\nvoid print_tuple(ostream& os, const Tuple& t) {\n\tif(Index > 0) os << \", \";\n\tos << get<Index>(t);\n\tprint_tuple<Tuple, Index + 1, Types...>(os, t);\n}\n\ntemplate<class... Types>\nostream& operator<<(ostream& os, const tuple<Types...>& t) {\n\tos << '(';\n\tprint_tuple<tuple<Types...>, 0, Types...>(os, t);\n\treturn os << ')';\n}\n\ntemplate<class Iterator>\nostream& dump_range(ostream&, Iterator, const Iterator&);\n\ntemplate<typename T>\nostream& operator<<(ostream& os, vector<T> c) {\n\treturn dump_range(os, c.cbegin(), c.cend());\n}\n\ntemplate<class Iterator>\nostream& dump_range(ostream& os, Iterator first, const Iterator& last) {\n\tos << '[';\n\tfor(int i = 0; first != last; ++i, ++first) {\n\t\tif(i) os << \", \";\n\t\tos << *first;\n\t}\n\treturn os << ']';\n}\n\nenum FACE { TOP, BOTTOM, NORTH, SOUTH, WEST, EAST };\n\nclass dice {\nprivate:\n\tint num[6];\n\npublic:\n\tinline void roll(FACE a, FACE b, FACE c, FACE d) {\n\t\tswap(num[a], num[b]);\n\t\tswap(num[b], num[c]);\n\t\tswap(num[c], num[d]);\n\t}\n\n\tdice() {\n\t\tnum[TOP] = 1;\n\t\tnum[BOTTOM] = 6;\n\t\tnum[NORTH] = 5;\n\t\tnum[SOUTH] = 2;\n\t\tnum[EAST] = 3;\n\t\tnum[WEST] = 4;\n\t}\n\n\tdice(const dice& d) {\n\t\tnum[TOP] = d[TOP];\n\t\tnum[BOTTOM] = d[BOTTOM];\n\t\tnum[NORTH] = d[NORTH];\n\t\tnum[SOUTH] = d[SOUTH];\n\t\tnum[EAST] = d[EAST];\n\t\tnum[WEST] = d[WEST];\n\t}\n\n\tint encode() const {\n\t\treturn (num[TOP] - 1) * 6 * 6 + (num[NORTH] - 1) * 6 + (num[EAST] - 1);\n\t}\n\n\tconst int& operator[] (FACE f) const { return num[f]; }\n};\n\nvoid north(dice& d) { d.roll(TOP, SOUTH, BOTTOM, NORTH); }\nvoid east(dice& d) { d.roll(TOP, WEST, BOTTOM, EAST); }\nvoid west(dice& d) { d.roll(TOP, EAST, BOTTOM, WEST); }\nvoid south(dice& d) { d.roll(TOP, NORTH, BOTTOM, SOUTH); }\n\nconstexpr int MAX_SIZE = 10;\nconstexpr int INF = 0xfffffff;\nint h, w;\nint gx, gy;\nint field[MAX_SIZE][MAX_SIZE];\n\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nvoid (*func[4])(dice& d) = { east, south, west, north};\n\nbool visited[MAX_SIZE][MAX_SIZE][6];\n\nbool out(int x, int y) {\n\treturn x < 0 || x >= w || y < 0 || y >= h;\n}\n\ntypedef int weight;\nvector<weight> dist;\nstruct state {\n\tint x, y;\n\tdice d;\n\tweight dist;\n\tstate(int x, int y, const dice& d, weight dist):x(x), y(y), d(d), dist(dist){}\n\n\tbool operator>(const state& s) const {\n\t\treturn dist > s.dist;\n\t}\n};\n\nweight dijkstra(int sx, int sy, dice d) {\n\tpriority_queue<state, vector<state>, greater<state> > que;\n\tvector<vector<vector<weight>>> dist(h, vector<vector<weight>>(w, vector<weight>(6*6*6, INF)));\n\tdist[sy][sx][d.encode()] = 0;\n\tque.push(state(sx, sy, d, 0));\n\n\twhile(!que.empty()) {\n\t\tconst state s = que.top();\n\t\tque.pop();\n\n\t\tif(dist[s.y][s.x][s.d.encode()] < s.dist)\n\t\t\tcontinue;\n\n\t\tif(s.x == gx && s.y == gy)\n\t\t\treturn s.dist;\n\n\t\tfor(int i = 0; i < 4; ++i) {\n\t\t\tconst int nx = s.x + dx[i];\n\t\t\tconst int ny = s.y + dy[i];\n\t\t\tif(out(nx, ny)) continue;\n\t\t\tdice next_d(s.d);\n\t\t\tfunc[i](next_d);\n\t\t\tconst int next_dist = s.dist + next_d[BOTTOM] * field[ny][nx];\n\t\t\tif(dist[ny][nx][next_d.encode()] > next_dist) {\n\t\t\t\tdist[ny][nx][next_d.encode()] = next_dist;\n\t\t\t\tque.push(state(nx, ny, next_d, next_dist));\n\t\t\t}\n\t\t}\n\t}\n\n\treturn -1;\n}\n\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tmemset(visited, false, sizeof(visited));\n\n\twhile(cin >> h >> w && h) {\n\t\tfor(int i = 0; i < h; ++i) {\n\t\t\tfor(int j = 0; j < w; ++j) {\n\t\t\t\tcin >> field[i][j];\n\t\t\t}\n\t\t}\n\n\t\tint sx, sy;\n\t\tcin >> sy >> sx >> gy >> gx;\n\n\t\tcout << dijkstra(sx, sy, dice()) << endl;\n\t}\n\n\treturn EXIT_SUCCESS;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1352,
"score_of_the_acc": -0.0131,
"final_rank": 3
},
{
"submission_id": "aoj_1057_670114",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <sstream>\n#include <string>\n#include <map>\n#include <queue>\n#include <vector>\n\n#define X first\n#define Y second\n#define P first\n#define S second\n#define C first\n#define D second\n#define mp(x, y) make_pair(x, y)\n\nusing namespace std;\ntypedef ostringstream OSS;\ntypedef pair<int, int> PII;\ntypedef pair<PII, string> PIIS;\ntypedef pair<int, PIIS> PIIIS;\n\nstruct die_t {\n\tint top, front, right, left, back, bottom;\n\tdie_t ( int t, int f, int r, int l, int bk, int b )\n\t\t: top(t), front(f), right(r), left(l), back(bk), bottom(b) { }\n\tdie_t ( string dice ) {\n\t\ttop = dice[0] - '0'; front = dice[1] - '0'; right = dice[2] - '0';\n\t\tleft = dice[3] - '0'; back = dice[4] - '0'; bottom = dice[5] - '0';\n\t}\n\tvoid rotate_swap ( int &a, int &b, int &c, int &d ) {\n\t\tswap(a, b); swap(b, c); swap(c, d);\n\t}\n\tvoid rotate_right ( void ) { rotate_swap(top,left,bottom,right); }\n\tvoid rotate_left ( void ) { rotate_swap(top,right,bottom,left); }\n\tvoid rotate_front ( void ) { rotate_swap(top,back,bottom,front); }\n\tvoid rotate_back ( void ) { rotate_swap(top,front,bottom,back); }\n\tvoid rotate_cw ( void ) { rotate_swap(back,left,front,right); }\n\tvoid rotate_cc ( void ) { rotate_swap(back,right,front,left); }\n\tbool rotate_set ( int n, int t, int f, int r, int l, int bk, int b ) {\n\t\tfor (int i = 0; i < 6; ++i) {\n\t\t\tfor (int j = 0; j < 4; ++j) {\n\t\t\t\tif (n == equal_num(t, f, r, l, bk, b)) { return true; }\n\t\t\t\trotate_cw();\n\t\t\t}\n\t\t\t(i&1 ? rotate_front() : rotate_right());\n\t\t}\n\t\treturn false;\n\t}\n\tint equal_num ( int t, int f, int r, int l, int bk, int b ) {\n\t\treturn (top==t) + (front==f) + (right==r) + (left==l) + (back==bk) + (bottom==b);\n\t}\n\tstring toString ( void ) {\n\t\tOSS os; os << top << front << right << left << back << bottom;\n\t\treturn os.str();\n\t}\n};\n\nconst int INF = 1 << 29;\nconst int MAX_WH = 10;\n\nint main ( void )\n{\n\tvector<string> vs;\n\tdie_t dd(\"123456\");\n\tfor (int i = 0; i < 6; ++i) {\n\t\tfor (int j = 0; j < 4; ++j) {\n\t\t\tvs.push_back(dd.toString());\n\t\t\tdd.rotate_cw();\n\t\t}\n\t\tif (i&1) { dd.rotate_front(); }\n\t\telse { dd.rotate_right(); }\n\t}\n\n\tint h, w, mat[MAX_WH][MAX_WH];\n\n\twhile (cin >> h >> w, h | w) {\n\t\tmap<string, int> M[MAX_WH][MAX_WH];\n\t\tfor (int y = 0; y < h; ++y) {\n\t\t\tfor (int x = 0; x < w; ++x) {\n\t\t\t\tcin >> mat[y][x];\n\t\t\t\tfor (int i = 0, I = vs.size(); i < I; ++i) {\n\t\t\t\t\tM[y][x].insert(mp(vs[i], INF));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tPII s, g;\n\t\tcin >> s.Y >> s.X;\n\t\tcin >> g.Y >> g.X;\n\n\t\tdie_t dice(\"123456\");\n\t\tpriority_queue<PIIIS, vector<PIIIS>, greater<PIIIS> > Q;\n\t\tM[s.Y][s.X][\"123456\"] = 0;\n\t\tQ.push(mp(0, mp(mp(s.X, s.Y), dice.toString())));\n\n\t\twhile (!Q.empty()) {\n\t\t\tPIIIS piiis = Q.top(); Q.pop();\n\t\t\tPIIS piis = piiis.D;\n\t\t\tPII p = piis.P;\n\n\t\t\tif (M[p.Y][p.X][piis.S] < piiis.C) { continue; }\n\n\t\t\tstring s = piis.S, s1, s2, s3, s4;\n\t\t\tdie_t d1(s), d2(s), d3(s), d4(s);\n\t\t\td1.rotate_right(); s1 = d1.toString();\n\t\t\td2.rotate_left(); s2 = d2.toString();\n\t\t\td3.rotate_front(); s3 = d3.toString();\n\t\t\td4.rotate_back(); s4 = d4.toString();\n\n\t\t\tif (p.X + 1 < w\n\t\t\t&& M[p.Y][p.X+1][s1] > M[p.Y][p.X][s] + mat[p.Y][p.X+1] * d1.bottom) {\n\t\t\t\tM[p.Y][p.X+1][s1] = M[p.Y][p.X][s] + mat[p.Y][p.X+1] * d1.bottom;\n\t\t\t\tQ.push(mp(M[p.Y][p.X+1][s1], mp(mp(p.X+1, p.Y), s1)));\n\t\t\t}\n\t\t\tif (p.X - 1 >=0\n\t\t\t&& M[p.Y][p.X-1][s2] > M[p.Y][p.X][s] + mat[p.Y][p.X-1] * d2.bottom) {\n\t\t\t\tM[p.Y][p.X-1][s2] = M[p.Y][p.X][s] + mat[p.Y][p.X-1] * d2.bottom;\n\t\t\t\tQ.push(mp(M[p.Y][p.X-1][s2], mp(mp(p.X-1, p.Y), s2)));\n\t\t\t}\n\t\t\tif (p.Y + 1 < h\n\t\t\t&& M[p.Y+1][p.X][s3] > M[p.Y][p.X][s] + mat[p.Y+1][p.X] * d3.bottom) {\n\t\t\t\tM[p.Y+1][p.X][s3] = M[p.Y][p.X][s] + mat[p.Y+1][p.X] * d3.bottom;\n\t\t\t\tQ.push(mp(M[p.Y+1][p.X][s3], mp(mp(p.X, p.Y+1), s3)));\n\t\t\t}\n\t\t\tif (p.Y - 1 >=0\n\t\t\t&& M[p.Y-1][p.X][s4] > M[p.Y][p.X][s] + mat[p.Y-1][p.X] * d4.bottom) {\n\t\t\t\tM[p.Y-1][p.X][s4] = M[p.Y][p.X][s] + mat[p.Y-1][p.X] * d4.bottom;\n\t\t\t\tQ.push(mp(M[p.Y-1][p.X][s4], mp(mp(p.X, p.Y-1), s4)));\n\t\t\t}\n\t\t}\n\n\t\tint ans = INF;\n\t\tfor (int i = 0, I = vs.size(); i < I; ++i) {\n\t\t\tans = min(ans, M[g.Y][g.X][vs[i]]);\n\t\t}\n\t\tcout << ans << endl;\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 1436,
"score_of_the_acc": -0.5909,
"final_rank": 16
},
{
"submission_id": "aoj_1057_670111",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <sstream>\n#include <string>\n#include <map>\n#include <queue>\n#include <vector>\n\n#define X first\n#define Y second\n#define P first\n#define S second\n#define mp(x, y) make_pair(x, y)\n\nusing namespace std;\ntypedef ostringstream OSS;\ntypedef pair<int, int> PII;\ntypedef pair<PII, string> PIIS;\n\nstruct die_t {\n\tint top, front, right, left, back, bottom;\n\tdie_t ( int t, int f, int r, int l, int bk, int b )\n\t\t: top(t), front(f), right(r), left(l), back(bk), bottom(b) { }\n\tdie_t ( string dice ) {\n\t\ttop = dice[0] - '0'; front = dice[1] - '0'; right = dice[2] - '0';\n\t\tleft = dice[3] - '0'; back = dice[4] - '0'; bottom = dice[5] - '0';\n\t}\n\tvoid rotate_swap ( int &a, int &b, int &c, int &d ) {\n\t\tswap(a, b); swap(b, c); swap(c, d);\n\t}\n\tvoid rotate_right ( void ) { rotate_swap(top,left,bottom,right); }\n\tvoid rotate_left ( void ) { rotate_swap(top,right,bottom,left); }\n\tvoid rotate_front ( void ) { rotate_swap(top,back,bottom,front); }\n\tvoid rotate_back ( void ) { rotate_swap(top,front,bottom,back); }\n\tvoid rotate_cw ( void ) { rotate_swap(back,left,front,right); }\n\tvoid rotate_cc ( void ) { rotate_swap(back,right,front,left); }\n\tbool rotate_set ( int n, int t, int f, int r, int l, int bk, int b ) {\n\t\tfor (int i = 0; i < 6; ++i) {\n\t\t\tfor (int j = 0; j < 4; ++j) {\n\t\t\t\tif (n == equal_num(t, f, r, l, bk, b)) { return true; }\n\t\t\t\trotate_cw();\n\t\t\t}\n\t\t\t(i&1 ? rotate_front() : rotate_right());\n\t\t}\n\t\treturn false;\n\t}\n\tint equal_num ( int t, int f, int r, int l, int bk, int b ) {\n\t\treturn (top==t) + (front==f) + (right==r) + (left==l) + (back==bk) + (bottom==b);\n\t}\n\tstring toString ( void ) {\n\t\tOSS os; os << top << front << right << left << back << bottom;\n\t\treturn os.str();\n\t}\n};\n\nconst int INF = 1 << 29;\nconst int MAX_WH = 10;\n\nint main ( void )\n{\n\tvector<string> vs;\n\tdie_t dd(\"123456\");\n\tfor (int i = 0; i < 6; ++i) {\n\t\tfor (int j = 0; j < 4; ++j) {\n\t\t\tvs.push_back(dd.toString());\n\t\t\tdd.rotate_cw();\n\t\t}\n\t\tif (i&1) { dd.rotate_front(); }\n\t\telse { dd.rotate_right(); }\n\t}\n\n\tint h, w, mat[MAX_WH][MAX_WH];\n\n\twhile (cin >> h >> w, h | w) {\n\t\tmap<string, int> M[MAX_WH][MAX_WH];\n\t\tfor (int y = 0; y < h; ++y) {\n\t\t\tfor (int x = 0; x < w; ++x) {\n\t\t\t\tcin >> mat[y][x];\n\t\t\t\tfor (int i = 0, I = vs.size(); i < I; ++i) {\n\t\t\t\t\tM[y][x].insert(mp(vs[i], INF));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tPII s, g;\n\t\tcin >> s.Y >> s.X;\n\t\tcin >> g.Y >> g.X;\n\n\t\tdie_t dice(\"123456\");\n\t\tqueue<PIIS> Q;\n\t\tM[s.Y][s.X][\"123456\"] = 0;\n\t\tQ.push(mp(mp(s.X, s.Y), dice.toString()));\n\n\t\twhile (!Q.empty()) {\n\t\t\tPIIS piis = Q.front(); Q.pop();\n\t\t\tPII p = piis.P;\n\t\t\tstring s = piis.S, s1, s2, s3, s4;\n\t\t\tdie_t d1(s), d2(s), d3(s), d4(s);\n\t\t\td1.rotate_right(); s1 = d1.toString();\n\t\t\td2.rotate_left(); s2 = d2.toString();\n\t\t\td3.rotate_front(); s3 = d3.toString();\n\t\t\td4.rotate_back(); s4 = d4.toString();\n\t\t\tint now = M[p.Y][p.X][s];\n\n\t\t\tif (p.X + 1 < w\n\t\t\t&& M[p.Y][p.X+1][s1] > now + mat[p.Y][p.X+1] * d1.bottom) {\n\t\t\t\tM[p.Y][p.X+1][s1] = now + mat[p.Y][p.X+1] * d1.bottom;\n\t\t\t\tQ.push(mp(mp(p.X+1, p.Y), s1));\n\t\t\t}\n\t\t\tif (p.X - 1 >=0\n\t\t\t&& M[p.Y][p.X-1][s2] > now + mat[p.Y][p.X-1] * d2.bottom) {\n\t\t\t\tM[p.Y][p.X-1][s2] = now + mat[p.Y][p.X-1] * d2.bottom;\n\t\t\t\tQ.push(mp(mp(p.X-1, p.Y), s2));\n\t\t\t}\n\t\t\tif (p.Y + 1 < h\n\t\t\t&& M[p.Y+1][p.X][s3] > now + mat[p.Y+1][p.X] * d3.bottom) {\n\t\t\t\tM[p.Y+1][p.X][s3] = now + mat[p.Y+1][p.X] * d3.bottom;\n\t\t\t\tQ.push(mp(mp(p.X, p.Y+1), s3));\n\t\t\t}\n\t\t\tif (p.Y - 1 >=0\n\t\t\t&& M[p.Y-1][p.X][s4] > now + mat[p.Y-1][p.X] * d4.bottom) {\n\t\t\t\tM[p.Y-1][p.X][s4] = now + mat[p.Y-1][p.X] * d4.bottom;\n\t\t\t\tQ.push(mp(mp(p.X, p.Y-1), s4));\n\t\t\t}\n\t\t}\n\n\t\tint ans = INF;\n\t\tfor (int i = 0, I = vs.size(); i < I; ++i) {\n\t\t\tans = min(ans, M[g.Y][g.X][vs[i]]);\n\t\t}\n\t\tcout << ans << endl;\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 930,
"memory_kb": 1452,
"score_of_the_acc": -1.0042,
"final_rank": 18
}
] |
aoj_1058_cpp
|
Problem H:
Winter Bells
The best night ever in the world has come! It's 8 p.m. of December 24th, yes, the night of Cristmas Eve. Santa Clause comes to a silent city with ringing bells. Overtaking north wind, from a sleigh a reindeer pulls she shoot presents to soxes hanged near windows for children.
The sleigh she is on departs from a big christmas tree on the fringe of the city. Miracle power that the christmas tree spread over the sky like a web and form a paths that the sleigh can go on. Since the paths with thicker miracle power is easier to go, these paths can be expressed as undirected weighted graph.
Derivering the present is very strict about time. When it begins dawning the miracle power rapidly weakens and Santa Clause can not continue derivering any more. Her pride as a Santa Clause never excuses such a thing, so she have to finish derivering before dawning.
The sleigh a reindeer pulls departs from christmas tree (which corresponds to 0th node), and go across the city to the opposite fringe (
n
-1 th node) along the shortest path. Santa Clause create presents from the miracle power and shoot them from the sleigh the reindeer pulls at his full power. If there are two or more shortest paths, the reindeer selects one of all shortest paths with equal probability and go along it.
By the way, in this city there are
p
children that wish to see Santa Clause and are looking up the starlit sky from their home. Above the
i
-th child's home there is a cross point of the miracle power that corresponds to
c
[
i
]-th node of the graph. The child can see Santa Clause if (and only if) Santa Clause go through the node.
Please find the probability that each child can see Santa Clause.
Input
Input consists of several datasets.
The first line of each dataset contains three integers
n
,
m
,
p
, which means the number of nodes and edges of the graph, and the number of the children. Each node are numbered 0 to
n
-1.
Following
m
lines contains information about edges. Each line has three integers. The first two integers means nodes on two endpoints of the edge. The third one is weight of the edge.
Next
p
lines represent
c
[
i
] respectively.
Input terminates when
n
=
m
=
p
= 0.
Output
For each dataset, output
p
decimal values in same order as input. Write a blank line after that.
You may output any number of digit and may contain an error less than 1.0e-6.
Constraints
3 ≤
n
≤ 100
There are no parallel edges and a edge whose end points are identical.
0 < weight of the edge < 10000
Sample Input
3 2 1
0 1 2
1 2 3
1
4 5 2
0 1 1
0 2 1
1 2 1
1 3 1
2 3 1
1
2
0 0 0
Output for the Sample Input
1.00000000
0.50000000
0.50000000
|
[
{
"submission_id": "aoj_1058_9644503",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nvoid fastIO() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n}\n\n\nconst int oo = 1e9;\nvector<vector<pair<long long, long long>>> adj;\nint n, m;\n\nint getShortestPath(int src, int target){\n vector<int> dist(n, oo);\n dist[src] = 0;\n\n priority_queue<pair<long long, long long>> pq;\n pq.push({0, src});\n\n while (!pq.empty())\n {\n long long u = pq.top().second;\n long long cost = -pq.top().first;\n pq.pop();\n\n if(dist[u] < cost) continue;\n\n for(auto [v, w] : adj[u])\n {\n if(dist[v] > dist[u] + w)\n {\n dist[v] = dist[u] + w;\n pq.push({-dist[v], v});\n }\n }\n }\n return dist[target];\n}\n\nlong double getPathsCnt(long long src, long long target)\n{\n vector<int> dist(n, oo);\n vector<long double > cnt(n, 0);\n dist[src] = 0; cnt[src] = 1;\n\n priority_queue<pair<long long, long long>> pq;\n pq.push({0, src});\n\n while (!pq.empty())\n {\n long long u = pq.top().second;\n long long cost = -pq.top().first;\n pq.pop();\n\n if(dist[u] < cost) continue;\n for(auto [v, w] : adj[u])\n {\n if(dist[v] > dist[u] + w)\n {\n cnt[v] = cnt[u];\n dist[v] = dist[u] + w;\n pq.push({-dist[v], v});\n }\n else if(dist[v] == dist[u] + w){\n cnt[v] += cnt[u];\n }\n }\n }\n return cnt[target];\n}\n\nsigned main() {\n fastIO();\n\n int p;\n while(cin >> n >> m >> p){\n if(!n) break;\n\n adj.assign(n, {});\n for (int i = 0; i < m; ++i) {\n int u, v, w; cin >> u >> v >> w;\n adj[u].push_back({v, w});\n adj[v].push_back({u, w});\n }\n\n vector<int> childs(p);\n for (int i = 0; i < p; ++i) {\n cin >> childs[i];\n }\n\n long double total = getPathsCnt(0, n - 1);\n for (int i = 0; i < childs.size(); ++i) {\n if(getShortestPath(0, childs[i]) + getShortestPath(childs[i], n - 1) == getShortestPath(0, n - 1)){\n cout << fixed << setprecision(7) << 1.0 * getPathsCnt(0, childs[i]) * getPathsCnt(childs[i], n - 1) / total << \"\\n\";\n }\n else{\n cout << \"0\\n\";\n }\n }\n cout << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3656,
"score_of_the_acc": -1,
"final_rank": 18
},
{
"submission_id": "aoj_1058_1314895",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef vector<int> vi;\ntypedef pair<int,int> edge;\ntypedef vector<edge> ve;\ntypedef vector<ve> graph;\n\nint main(){\n int n,m,p;\n while(cin >> n >> m >> p, n){\n graph g(n);\n for(int i=0;i<m;i++){\n int a,b,c;\n cin >> a >> b >> c;\n g[a].push_back(edge(c,b));\n g[b].push_back(edge(c,a));\n }\n\n vi c(p);\n for(int i=0;i<p;i++)cin >> c[i];\n\n vi d(n,1e9), order;\n d[0] = 0;\n priority_queue< edge,vector<edge>,greater<edge> > pq;\n pq.push(edge(0,0));\n\n while(pq.size()){\n int dis = pq.top().first, v = pq.top().second; pq.pop();\n if(d[v] < dis)continue;\n order.push_back(v);\n\n for(edge e : g[v]){\n\tint nxtd = dis + e.first, u = e.second;\n\tif(d[u] > nxtd){\n\t d[u] = nxtd;\n\t pq.push(edge(nxtd,u));\n\t}\n }\n }\n\n vector<double> cnt(n,0);\n cnt[n-1] = 1;\n for(int i=order.size()-1;i>=0;i--){\n int v = order[i];\n for(edge e : g[v]){\n\tint dis = e.first, u = e.second;\n\tif(d[v] == d[u] + dis)cnt[u] += cnt[v];\n }\n }\n\n vector<double> prob(n,0);\n prob[0] = 1;\n for(int i=0;i<n;i++){\n int v = order[i];\n\n for(edge e : g[v]){\n\tint nxtd = d[v] + e.first, u = e.second;\n\tif(d[u] == nxtd){\n\t prob[u] += prob[v] * cnt[u] / cnt[v];\n\t}\n }\n }\n\n for(int i=0;i<p;i++){\n cout << fixed << setprecision(9) << prob[c[i]] << endl;\n }\n cout << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1384,
"score_of_the_acc": -0.3786,
"final_rank": 10
},
{
"submission_id": "aoj_1058_1314892",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef vector<int> vi;\ntypedef pair<int,int> edge;\ntypedef vector<edge> ve;\ntypedef vector<ve> graph;\n\nint main(){\n int n,m,p;\n while(cin >> n >> m >> p, n){\n graph g(n);\n for(int i=0;i<m;i++){\n int a,b,c;\n cin >> a >> b >> c;\n g[a].push_back(edge(c,b));\n g[b].push_back(edge(c,a));\n }\n\n vi c(p);\n for(int i=0;i<p;i++)cin >> c[i];\n\n vi d(n,1e9), order;\n d[0] = 0;\n priority_queue< edge,vector<edge>,greater<edge> > pq;\n pq.push(edge(0,0));\n\n while(pq.size()){\n int dis = pq.top().first, v = pq.top().second; pq.pop();\n if(d[v] < dis)continue;\n order.push_back(v);\n\n for(edge e : g[v]){\n\tint nxtd = dis + e.first, u = e.second;\n\tif(d[u] > nxtd){\n\t d[u] = nxtd;\n\t pq.push(edge(nxtd,u));\n\t}\n }\n }\n\n vector<long double> cnt(n,0);\n cnt[n-1] = 1;\n for(int i=order.size()-1;i>=0;i--){\n int v = order[i];\n for(edge e : g[v]){\n\tint dis = e.first, u = e.second;\n\tif(d[v] == d[u] + dis)cnt[u] += cnt[v];\n }\n }\n\n vector<long double> prob(n,0);\n prob[0] = 1;\n for(int i=0;i<n;i++){\n int v = order[i];\n\n for(edge e : g[v]){\n\tint nxtd = d[v] + e.first, u = e.second;\n\tif(d[u] == nxtd){\n\t prob[u] += cnt[u] / cnt[v] * prob[v];\n\t}\n }\n }\n\n for(int i=0;i<p;i++){\n cout << fixed << setprecision(9) << prob[c[i]] << endl;\n }\n cout << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1388,
"score_of_the_acc": -0.3796,
"final_rank": 11
},
{
"submission_id": "aoj_1058_1174060",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<queue>\n#include<algorithm>\n#include<vector>\nusing namespace std;\n#define INF (1<<28)\n#define MAX 105\nstruct edge{int to,cost;};\nstruct state{\n int pos,cost;\n bool operator < (const state &p)const{\n return cost > p.cost;\n }\n};\n \nvector<edge> G[MAX];\nint n,m,p;\n \nvoid init(){\n for(int i=0;i<MAX;i++){\n G[i].clear();\n }\n}\n \nlong long d[MAX][MAX];\ndouble cnt[MAX][MAX];\nvoid dijkstra(int si){\n for(int i=0;i<MAX;i++)d[si][i]=INF,cnt[si][i]=0;\n priority_queue<state> Q;\n d[si][si]=0;\n cnt[si][si]=1;\n Q.push((state){si,0});\n while(!Q.empty()){\n state s=Q.top();Q.pop();\n if(s.cost>d[si][s.pos])continue;\n for(int i=0;i<(int)G[s.pos].size();i++){\n edge e=G[s.pos][i];\n if(d[si][e.to]<s.cost+e.cost)continue;\n else if(d[si][e.to]==s.cost+e.cost){\n cnt[si][e.to]+=cnt[si][s.pos];\n }else{\n cnt[si][e.to]=cnt[si][s.pos];\n d[si][e.to]=s.cost+e.cost;\n Q.push((state){e.to,d[si][e.to]});\n }\n }\n }\n}\n \nint main(){\n while(1){\n cin>>n>>m>>p;\n if(n==0&&m==0&&p==0)break;\n init();\n for(int i=0;i<m;i++){\n int a,b,c;\n scanf(\"%d%d%d\",&a,&b,&c);\n G[a].push_back((edge){b,c});\n G[b].push_back((edge){a,c});\n }\n for(int i=0;i<n;i++)\n dijkstra(i);\n \n for(int i=0;i<p;i++){\n int a;\n scanf(\"%d\",&a);\n if(d[0][a]+d[a][n-1]!=d[0][n-1]){\n cout<<\"0.0\"<<endl;\n }else{\n double x=cnt[0][a],x2=cnt[a][n-1],y=cnt[0][n-1];\n printf(\"%.8f\\n\",x/y*x2);\n }\n \n \n }\n cout<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1600,
"score_of_the_acc": -0.4376,
"final_rank": 15
},
{
"submission_id": "aoj_1058_1166656",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\n#define rep(i,n) REP(i,0,n)\n\nint N, M, C;\n\ntypedef long long ll;\n\nstruct Edge {\n int to; ll cost;\n};\n\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nGraph g;\n\ndouble cntpath[110][110];\n\nstruct state {\n int curr; ll cost;\n bool operator < (state const& s) const {\n return cost > s.cost;\n }\n};\n\nstruct ST {\n int curr; double prob;\n};\n\nll const INF = 1LL<<40;\n\nint main() {\n \n while(cin >> N >> M >> C && (N|M|C)) {\n g.clear(); g.resize(N);\n \n rep(i, M) {\n int a, b; ll c; cin >> a >> b >> c;\n g[a].push_back((Edge){b, c});\n g[b].push_back((Edge){a, c});\n }\n \n ll dist[N][N];\n fill(dist[0], dist[0]+N*N, INF);\n \n rep(S, N) {\n dist[S][S] = 0;\n cntpath[S][S] = 1;\n priority_queue<state> pq;\n pq.push((state){S, dist[S][S]});\n while(!pq.empty()) {\n int curr = pq.top().curr;\n ll cost = pq.top().cost;\n pq.pop();\n \n rep(i, g[curr].size()) {\n Edge& e = g[curr][i];\n if(dist[S][e.to] == cost+e.cost) {\n cntpath[S][e.to] += cntpath[S][curr];\n }\n if(dist[S][e.to] <= cost+e.cost) { continue; }\n cntpath[S][e.to] = cntpath[S][curr];\n dist[S][e.to] = cost+e.cost;\n pq.push((state){e.to, dist[S][e.to]});\n }\n }\n }\n \n rep(i, C) {\n int q; cin >> q;\n if(dist[0][q]+dist[q][N-1] == dist[0][N-1]) {\n printf(\"%.10f\\n\", cntpath[0][q]/cntpath[0][N-1]*cntpath[q][N-1]);\n }\n else {\n printf(\"%.10f\\n\", 0.);\n }\n }\n cout << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1652,
"score_of_the_acc": -0.4519,
"final_rank": 17
},
{
"submission_id": "aoj_1058_1165249",
"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 long long ll;\n\nstruct Edge {\n int src,dst;\n ll w;\n};\n\nstruct Data {\n int cur;\n ll w;\n bool operator < ( const Data &data ) const {\n if( w != data.w ) return w < data.w;\n return cur < data.cur;\n }\n};\n\nconst ll LLINF = LLONG_MAX;\nconst int MAX_V = 110;\nint V,E,Q;\nvector<Edge> G[MAX_V];\nll fw[MAX_V][MAX_V];\ndouble dp[MAX_V][2];\n\nvoid compute(int type,int sp,int ep){\n vector<Data> vec;\n rep(i,V) vec.push_back((Data){i,fw[sp][i]});\n sort(vec.begin(),vec.end());\n rep(i,(int)vec.size()){\n int cur = vec[i].cur;\n rep(j,(int)G[cur].size()){\n int next = G[cur][j].dst;\n if( fw[sp][cur] + G[cur][j].w + fw[next][ep] == fw[sp][ep] ) {\n dp[next][type] += dp[cur][type];\n }\n }\n }\n}\n\nint main(){\n while( cin >> V >> E >> Q, V|E|Q ){\n rep(i,V) G[i].clear();\n rep(i,V) rep(j,V) fw[i][j] = ((i==j)?0:LLINF);\n rep(i,E) {\n int src,dst;\n ll w;\n cin >> src >> dst >> w;\n fw[src][dst] = fw[dst][src] = w;\n G[src].push_back((Edge){src,dst,w});\n G[dst].push_back((Edge){dst,src,w});\n }\n\n rep(k,V) rep(i,V) rep(j,V) if( fw[i][k] != LLINF && fw[k][j] != LLINF ) fw[i][j] = min(fw[i][j],\n fw[i][k]+fw[k][j]);\n \n rep(i,MAX_V) rep(j,2) dp[i][j] = 0;\n dp[0][0] = dp[V-1][1] = 1;\n compute(0,0,V-1);\n compute(1,V-1,0);\n rep(i,Q){\n int pos;\n cin >> pos;\n printf(\"%.10f\\n\",dp[pos][0]*dp[pos][1]/dp[V-1][0]);\n } puts(\"\");\n \n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1548,
"score_of_the_acc": -0.4234,
"final_rank": 14
},
{
"submission_id": "aoj_1058_1164098",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<queue>\n#include<algorithm>\n#include<vector>\nusing namespace std;\n#define INF (1<<28)\n#define MAX 105\nstruct edge{int to,cost;};\nstruct state{\n int pos,cost;\n bool operator < (const state &p)const{\n return cost > p.cost;\n }\n};\n\nvector<edge> G[MAX];\nint n,m,p;\n\nvoid init(){\n for(int i=0;i<MAX;i++){\n G[i].clear();\n }\n}\n\nlong long d[MAX][MAX];\ndouble cnt[MAX][MAX];\nvoid dijkstra(int si){\n for(int i=0;i<MAX;i++)d[si][i]=INF,cnt[si][i]=0;\n priority_queue<state> Q;\n d[si][si]=0;\n cnt[si][si]=1;\n Q.push((state){si,0});\n while(!Q.empty()){\n state s=Q.top();Q.pop();\n if(s.cost>d[si][s.pos])continue;\n for(int i=0;i<(int)G[s.pos].size();i++){\n edge e=G[s.pos][i];\n if(d[si][e.to]<s.cost+e.cost)continue;\n else if(d[si][e.to]==s.cost+e.cost){\n\tcnt[si][e.to]+=cnt[si][s.pos];\n }else{\n\tcnt[si][e.to]=cnt[si][s.pos];\n\td[si][e.to]=s.cost+e.cost;\n\tQ.push((state){e.to,d[si][e.to]});\n }\n }\n }\n}\n\nint main(){\n while(1){\n cin>>n>>m>>p;\n if(n==0&&m==0&&p==0)break;\n init();\n for(int i=0;i<m;i++){\n int a,b,c;\n scanf(\"%d%d%d\",&a,&b,&c);\n G[a].push_back((edge){b,c});\n G[b].push_back((edge){a,c});\n }\n for(int i=0;i<n;i++)\n dijkstra(i);\n\n for(int i=0;i<p;i++){\n int a;\n scanf(\"%d\",&a);\n if(d[0][a]+d[a][n-1]!=d[0][n-1]){\n\tcout<<\"0.0\"<<endl;\n }else{\n\tdouble x=cnt[0][a],x2=cnt[a][n-1],y=cnt[0][n-1];\n\tprintf(\"%.8f\\n\",x/y*x2);\n }\n\n\n }\n cout<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1600,
"score_of_the_acc": -0.4376,
"final_rank": 15
},
{
"submission_id": "aoj_1058_1159273",
"code_snippet": "// 20:47~\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nstruct Edge{\n\tint src,dst,weight;\n\tEdge(){}\n\tEdge(int s,int d,int w):src(s),dst(d),weight(w){}\n};\ntypedef vector<vector<Edge>> Graph;\n\nint main()\n{\n\tfor(int n,m,p;cin>>n>>m>>p && n|m|p;){\n\t\tGraph g(n);\n\t\trep(i,m){\n\t\t\tint u,v,w; cin>>u>>v>>w;\n\t\t\tg[u].emplace_back(u,v,w);\n\t\t\tg[v].emplace_back(v,u,w);\n\t\t}\n\t\t\n\t\tvvi d(n,vi(n,INF));\n\t\trep(i,n) d[i][i]=0;\n\t\trep(i,n) for(auto e:g[i]) d[e.src][e.dst]=e.weight;\n\t\trep(k,n) rep(i,n) rep(j,n) d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\n\t\t\n\t\tvvd cnt(n,vd(n));\n\t\trep(i,n) for(auto e:g[i])\n\t\t\tif(d[0][e.src]+e.weight+d[e.dst][n-1]==d[0][n-1])\n\t\t\t\tcnt[e.src][e.dst]=1;\n\t\trep(k,n) rep(i,n) rep(j,n)\n\t\t\tcnt[i][j]+=cnt[i][k]*cnt[k][j];\n\t\t\n\t\trep(_,p){\n\t\t\tint c; cin>>c;\n\t\t\tprintf(\"%.9f\\n\",cnt[0][c]*cnt[c][n-1]/cnt[0][n-1]);\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1500,
"score_of_the_acc": -0.4103,
"final_rank": 12
},
{
"submission_id": "aoj_1058_1159075",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nstruct Edge{\n\tint src,dst,weight;\n\tEdge(){}\n\tEdge(int s,int d,int w):src(s),dst(d),weight(w){}\n};\ntypedef vector<vector<Edge>> Graph;\n\nvoid chmin(int& a,int b)\n{\n\ta=min(a,b);\n}\n\nint main()\n{\n\tfor(int n,m,s;cin>>n>>m>>s && n|m|s;){\n\t\tGraph g(n);\n\t\trep(i,m){\n\t\t\tint u,v,w; cin>>u>>v>>w;\n\t\t\tg[u].emplace_back(u,v,w);\n\t\t\tg[v].emplace_back(v,u,w);\n\t\t}\n\t\tvi cs(s);\n\t\trep(i,s) cin>>cs[i];\n\t\t\n\t\tvvi dp(n,vi(n,INF));\n\t\trep(i,n) dp[i][i]=0;\n\t\trep(i,n) for(auto e:g[i]) chmin(dp[e.src][e.dst],e.weight);\n\t\trep(k,n) rep(i,n) rep(j,n) chmin(dp[i][j],dp[i][k]+dp[k][j]);\n\t\t\n\t\tvd cnt1(n,0); cnt1[0]=1;\n\t\t{\n\t\t\tGraph gg(n);\n\t\t\trep(i,n) for(auto e:g[i]) if(dp[0][e.src]+e.weight+dp[e.dst][n-1]==dp[0][n-1])\n\t\t\t\tgg[e.src].push_back(e);\n\t\t\tvi is(n); iota(all(is),0);\n\t\t\tsort(all(is),[&](int i,int j){return dp[0][i]<dp[0][j];});\n\t\t\tfor(auto u:is) for(auto e:gg[u]) cnt1[e.dst]+=cnt1[u];\n\t\t}\n\t\tvd cnt2(n,0); cnt2[n-1]=1;\n\t\t{\n\t\t\tGraph gg(n);\n\t\t\trep(i,n) for(auto e:g[i]) if(dp[0][e.src]+e.weight+dp[e.dst][n-1]==dp[0][n-1])\n\t\t\t\tgg[e.dst].emplace_back(e.dst,e.src,e.weight);\n\t\t\tvi is(n); iota(all(is),0);\n\t\t\tsort(all(is),[&](int i,int j){return dp[n-1][i]<dp[n-1][j];});\n\t\t\tfor(auto u:is) for(auto e:gg[u]) cnt2[e.dst]+=cnt2[u];\n\t\t}\n\t\t\n\t\tfor(auto i:cs) printf(\"%.9f\\n\",cnt1[i]*cnt2[i]/cnt1[n-1]); puts(\"\");\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1520,
"score_of_the_acc": -0.4158,
"final_rank": 13
},
{
"submission_id": "aoj_1058_1131814",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\n#include<vector>\n#include<queue>\nusing namespace std;\nint g[110][110];\nvector<int>g2[110];\nint p[11000];\nint q[11000];\nint r[11000];\npair<int,int> pt[110];\ndouble dp[110];\ndouble dp2[110];\nint main(){\n int a,b,c;\n while(scanf(\"%d%d%d\",&a,&b,&c),a){\n for(int i=0;i<a;i++)for(int j=0;j<a;j++)g[i][j]=999999999;\n for(int i=0;i<a;i++)g[i][i]=0;\n for(int i=0;i<a;i++){g2[i].clear();}\n for(int i=0;i<b;i++){\n scanf(\"%d%d%d\",p+i,q+i,r+i);\n g[p[i]][q[i]]=g[q[i]][p[i]]=r[i];\n }\n for(int k=0;k<a;k++)for(int i=0;i<a;i++)for(int j=0;j<a;j++)\n g[i][j]=min(g[i][j],g[i][k]+g[k][j]);\n for(int i=0;i<b;i++){\n int P=p[i];\n int Q=q[i];\n int R=r[i];\n if(g[0][P]+R==g[0][Q]&&g[Q][a-1]+R==g[P][a-1]){\n g2[P].push_back(Q);\n }\n swap(P,Q);\n if(g[0][P]+R==g[0][Q]&&g[Q][a-1]+R==g[P][a-1]){\n g2[P].push_back(Q);\n }\n }\n for(int i=0;i<110;i++)dp[i]=0;\n dp[0]=1;\n for(int i=0;i<a;i++)pt[i]=make_pair(g[0][i],i);\n std::sort(pt,pt+a);\n for(int i=0;i<a;i++){\n int at=pt[i].second;\n for(int j=0;j<g2[at].size();j++){\n dp[g2[at][j]]+=dp[at];\n }\n }\n\t\tdouble tot=dp[a-1];\n\t\t\n for(int i=0;i<c;i++){\n int t;scanf(\"%d\",&t);\n\t\t\tfor(int j=0;j<a;j++)dp2[j]=0;\n\t\t\tdp2[t]=1;\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tint at=pt[j].second;\n\t\t\t\tfor(int k=0;k<g2[at].size();k++){\n\t\t\t\t\tdp2[g2[at][k]]+=dp2[at];\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"%.12f\\n\",dp2[a-1]/tot*dp[t]);\n }\n printf(\"\\n\");\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1240,
"score_of_the_acc": -0.3392,
"final_rank": 8
},
{
"submission_id": "aoj_1058_1024983",
"code_snippet": "#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint main(){\n for(int n,m,p;cin>>n>>m>>p,n;){\n double nr[100][100]={};\n int d[100][100];\n const int INF=1<<29;\n fill(d[0],d[100],INF);\n for(int i=0;i<n;i++){\n d[i][i]=0;\n }\n while(m--){\n int s,t,u;\n cin>>s>>t>>u;\n d[s][t]=d[t][s]=u;\n nr[s][t]=nr[t][s]=1;\n }\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n\tfor(int k=0;k<n;k++){\n\t int nd=d[j][i]+d[i][k];\n\t if(nd<=d[j][k]){\n\t if(nd<d[j][k]){\n\t nr[j][k]=0;\n\t }\n\t d[j][k]=nd;\n\t nr[j][k]+=nr[j][i]*nr[i][k];\n\t }\n\t}\n }\n }\n while(p--){\n int c;\n cin>>c;\n cout.precision(9);\n cout<<fixed<<((c==0||c==n-1)?1:(d[0][c]+d[c][n-1]!=d[0][n-1])?0:nr[0][c]*nr[c][n-1]/nr[0][n-1])<<endl;\n }\n cout<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1356,
"score_of_the_acc": -0.3709,
"final_rank": 9
},
{
"submission_id": "aoj_1058_462908",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <vector>\n#include <cstdio>\nusing namespace std;\n\nstruct NODE{\n\tint to,cost;\n\tNODE(int to,int cost) : to(to) , cost(cost) {}\n\tNODE(){}\n};\nbool operator < (const NODE &a,const NODE &b){\n\treturn a.cost > b.cost;\n}\nint done[110] = {};\ndouble dp[110] = {} , rdp[110] = {};\n\nvector<NODE> g[100];\nint n,m,p;\n\ndouble dfs(int x,int cst){\n\tif( done[x] != cst ) return 0;\n\tif( x == n - 1 ) return 1;\n\tif( dp[x] != -1 ) return dp[x];\n\tdouble ans = 0;\n\tfor(int i = 0 ; i < g[x].size() ; i++)\n\t\tans += dfs(g[x][i].to,cst+g[x][i].cost);\n\treturn dp[x] = ans;\n}\n\ndouble rdfs(int x,int cst){\n\tif( done[n-1] - done[x] != cst ) return 0;\n\tif( x == 0 ) return 1;\n\tif( rdp[x] != -1 ) return rdp[x];\n\tdouble ans = 0;\n\tfor(int i = 0 ; i < g[x].size() ; i++)\n\t\tans += rdfs(g[x][i].to,cst+g[x][i].cost);\n\treturn rdp[x] = ans;\n}\nint main(){\n\twhile(cin >> n >> m >> p && (n||m||p) ){\n\t\tfor(int i = 0 ; i < n ; i++) g[i].clear();\n\t\tfor(int i = 0 ; i < m ; i++){\n\t\t\tint a,b,c;\n\t\t\tcin >> a >> b >> c;\n\t\t\tg[a].push_back( NODE(b,c) );\n\t\t\tg[b].push_back( NODE(a,c) );\n\t\t}\n\t\tfor(int i = 0 ; i < 110 ; i++) done[i] = -1;\n\t\tfor(int i = 0 ; i < 110 ; i++)\n\t\t\t\tdp[i] = rdp[i] = -1;\n\t\tpriority_queue<NODE> Q;\n\t\tQ.push(NODE(0,0));\n\t\twhile(Q.size()){\n\t\t\tNODE q = Q.top(); Q.pop();\n\t\t\tif( done[q.to] != -1 ) continue;\n\t\t\telse done[q.to] = q.cost;\n\t\t\tfor(int i = 0 ; i < g[q.to].size() ; i++)\n\t\t\t\tQ.push(NODE(g[q.to][i].to,q.cost+g[q.to][i].cost));\n\t\t}\n\t\tdouble all = dfs(0,0);\n\t\t//cout << all << endl;\n\t\tfor(int i = 0 ; i < p ; i++){\n\t\t\tint a;\n\t\t\tcin >> a;\n\t\t\tif( done[a] == -1 ){\n\t\t\t\tprintf(\"%.8lf\\n\",0.0);\n\t\t\t}else{\n\t\t\t\tdouble A = dfs(a,done[a]);\n\t\t\t\tdouble B = rdfs(a,done[n-1] - done[a]);\n\t\t\t\tprintf(\"%.8lf\\n\",1.0 * A*B / all);\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1058_347683",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <ctime>\n#include <cassert>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <numeric>\n#include <list>\n\n\nusing namespace std;\n\n#ifdef _MSC_VER\n#define __typeof__ decltype\ntemplate <class T> int __builtin_popcount(T n) { return n ? 1 + __builtin_popcount(n & (n - 1)) : 0; }\n#endif\n\n#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)\n#define all(c) (c).begin(), (c).end()\n#define rall(c) (c).rbegin(), (c).rend()\n#define CLEAR(arr, val) memset(arr, val, sizeof(arr))\n\n#define rep(i, n) for (int i = 0; i < n; ++i)\n\ntemplate <class T> void max_swap(T& a, const T& b) { a = max(a, b); }\ntemplate <class T> void min_swap(T& a, const T& b) { a = min(a, b); }\n\ntypedef long long ll;\ntypedef pair<int, int> pint;\n\nconst double EPS = 1e-8;\nconst double PI = acos(-1.0);\nconst int dx[] = { 0, 1, 0, -1 };\nconst int dy[] = { 1, 0, -1, 0 };\n\n\nstruct Edge\n{\n\tint to, cost;\n\tEdge(int to, int cost)\n\t\t: to(to), cost(cost) {}\n};\n\nvector<vector<int> > clean(const vector<vector<int> >& e)\n{\n\tint n = e.size();\n\tvector<bool> on_min_path(n);\n\tqueue<int> q;\n\ton_min_path[n - 1] = true;\n\tq.push(n - 1);\n\twhile (!q.empty())\n\t{\n\t\tint cur = q.front(); q.pop();\n\t\tfor (int i = 0; i < e[cur].size(); ++i)\n\t\t{\n\t\t\tint to = e[cur][i];\n\t\t\tif (!on_min_path[to])\n\t\t\t{\n\t\t\t\ton_min_path[to] = true;\n\t\t\t\tq.push(to);\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<vector<int> > res(n);\n\tfor (int i = 0; i < n; ++i)\n\t\tfor (int j = 0; j < e[i].size(); ++j)\n\t\t\tif (on_min_path[i] && on_min_path[e[i][j]])\n\t\t\t\tres[i].push_back(e[i][j]);\n\treturn res;\n}\nvector<vector<int> > prev_nodes(const vector<vector<Edge> >& edges)\n{\n\tint n = edges.size();\n\n\tconst int INF = 1e7;\n\tvector<int> dis(n, INF);\n\tvector<vector<int> > prevv(n);\n\tpriority_queue<pint, vector<pint>, greater<pint> > q;\n\tdis[0] = 0;\n\tq.push(pint(0, 0));\n\twhile (!q.empty())\n\t{\n\t\tpint tt = q.top(); q.pop();\n\t\tint cur = tt.second, cost = tt.first;\n\n\t\tif (cost > dis[cur])\n\t\t\tcontinue;\n\n\t\tforeach (e, edges[cur])\n\t\t{\n\t\t\tint to = e->to, nc = cost + e->cost;\n\t\t\tif (nc < dis[to])\n\t\t\t{\n\t\t\t\tdis[to] = nc;\n\t\t\t\tprevv[to].clear();\n\t\t\t\tprevv[to].push_back(cur);\n\t\t\t\tq.push(pint(nc, to));\n\t\t\t}\n\t\t\telse if (nc == dis[to])\n\t\t\t\tprevv[to].push_back(cur);\n\t\t}\n\t}\n\n\treturn clean(prevv);\n}\n\nvector<vector<int> > rev(const vector<vector<int> >& e)\n{\n\tvector<vector<int> > res(e.size());\n\tfor (int i = 0; i < e.size(); ++i)\n\t\tfor (int j = 0; j < e[i].size(); ++j)\n\t\t\tres[e[i][j]].push_back(i);\n\treturn res;\n}\n\ndouble in_paths(vector<double>& dp, const vector<vector<int> >& e, int v)\n{\n\tif (dp[v] != -1)\n\t\treturn dp[v];\n\telse if (e[v].empty())\n\t\treturn dp[v] = 1;\n\n\tdouble res = 0;\n\tfor (int i = 0; i < e[v].size(); ++i)\n\t\tres += in_paths(dp, e, e[v][i]);\n\treturn dp[v] = res;\n}\nint main()\n{\n\tint n, m, p;\n\twhile (cin >> n >> m >> p, n)\n\t{\n\t\tvector<vector<Edge> > edges(n);\n\t\tfor (int i = 0; i < m; ++i)\n\t\t{\n\t\t\tint a, b, c;\n\t\t\tcin >> a >> b >> c;\n\t\t\tedges[a].push_back(Edge(b, c));\n\t\t\tedges[b].push_back(Edge(a, c));\n\t\t}\n\t\tvector<vector<int> > prevv = prev_nodes(edges);\n\t\t//for (int i = 0; i < n; ++i)\n\t\t//{\n\t\t//\tprintf(\"%d: \", i);\n\t\t//\tfor (int j = 0; j < prevv[i].size(); ++j)\n\t\t//\t\tprintf(\"%d \", prevv[i][j]);\n\t\t//\tputs(\"\");\n\t\t//}puts(\"\");\n\n\t\tvector<double> in(n, -1), out(n, -1);\n\t\tin_paths(in, prevv, n - 1);\n\t\tin_paths(out, rev(prevv), 0);\n\n\t\tvector<double> paths(n);\n\t\tfor (int i = 0; i < n; ++i)\n\t\t\tif (in[i] != -1)\n\t\t\t\tpaths[i] = in[i] * out[i];\n\t\tdouble total_paths = paths[0];\n\n\t\t//for (int i = 0; i < n; ++i)\n\t\t//{\n\t\t//\tprintf(\"%d: %f %f\\n\", i, in[i], out[i]);\n\t\t//}\n\n\t\twhile (p--)\n\t\t{\n\t\t\tint c;\n\t\t\tcin >> c;\n\t\t\t\n\t\t\tprintf(\"%.8f\\n\", paths[c] / total_paths);\n\t\t}\n\t\tputs(\"\");\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1058_331524",
"code_snippet": "#include <string> \n#include <algorithm> \n#include <cfloat> \n#include <climits> \n#include <cmath> \n#include <complex> \n#include <cstdio> \n#include <cstdlib> \n#include <cstring> \n#include <functional> \n#include <iostream> \n#include <map> \n#include <memory> \n#include <queue> \n#include <set> \n#include <sstream> \n#include <stack> \n#include <utility> \n#include <vector> \n\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define ALL(x) (x).begin(),(x).end() \ntypedef long long ll;\nusing namespace std; \nconst double eps = 1e-10;\n\nconst int INF = 1000;\n\ntypedef int Weight;\nstruct Edge{\n int from, to;\n Weight weight;\n Edge(int from, int to, Weight weight) :\n from(from), to(to), weight(weight) { }\n};\nbool operator < (const Edge &a, const Edge &b){\n if(a.weight != b.weight) return a.weight > b.weight;\n if(a.from != b.from) return a.from > b.from;\n return a.to > b.to;\n}\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nint n, m, p;\n\nvoid dijkstra(const Graph &g, int s, vector<Weight> &dist, vector<int> &prev, vector<double> &cnt){\n int n = g.size();\n dist.assign(n, INF);\n dist[s] = 0;\n prev.assign(n, -1);\n cnt.assign(n, 0);\n cnt[s] = 1;\n priority_queue<Edge> Q; // a < b <-> a.weight > b.weight\n Q.push(Edge(-2, s, 0));\n while(!Q.empty()){\n Edge e = Q.top(); Q.pop();\n if(prev[e.to] != -1) continue;\n prev[e.to] = e.from;\n for(Edges::const_iterator i=g[e.to].begin(); i!=g[e.to].end(); ++i){ //ツマツクツδ債つェツ使ツつヲツづ按つ「ツづつォ\n if(dist[i -> to] == dist[i -> from] + i -> weight)\n cnt[i -> to] += cnt[i -> from];\n if(dist[i -> to] > dist[i -> from] + i -> weight){\n dist[i -> to] = dist[i -> from] + i -> weight;\n cnt[i -> to] = cnt[i -> from];\n Q.push(Edge(i -> from, i -> to, dist[i -> to]));\n }\n }\n }\n}\n\nvoid solve(Graph &g, vector<int> &c){\n vector<Weight> df, di;\n vector<int> pf, pi;\n vector<double> tf, ti;\n dijkstra(g, 0, df, pf, tf);\n dijkstra(g, n - 1, di, pi, ti);\n\n for(int i = 0; i < p; ++i){\n double res = 0.0;\n if(df[c[i]] + di[c[i]] == df[n - 1]){\n res = (double)tf[c[i]] * ti[c[i]] / tf[n - 1];\n }\n printf(\"%.9lf\\n\", res);\n }\n cout << endl;\n}\n\nint main(){\n while(cin >> n >> m >> p, n || m || p){\n Graph g(n);\n for(int i = 0; i < m; ++i){\n int x, y, z;\n cin >> x >> y >> z;\n g[x].push_back(Edge(x, y, z));\n g[y].push_back(Edge(y, x, z));\n }\n vector<int> c;\n for(int i = 0; i < p; ++i){\n int t;\n cin >> t;\n c.push_back(t);\n }\n solve(g, c);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1058_322946",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<cassert>\n#include<algorithm>\nusing namespace std;\n#define rep(i, n) for ( int i = 0; i < n; i++ )\n#define MAX 100\n#define INFTY (1<<21)\n\nvoid dijkstra( int n, int G[MAX][MAX], vector<int> p[MAX] ){\n int d[MAX];\n bool visited[MAX];\n\n rep(i, n) p[i].clear();\n\n rep(i, n){\n d[i] = INFTY;\n visited[i] = false;\n }\n\n d[0] = 0;\n\n int cnt = 0;\n while(1){\n int minv = INFTY;\n int u = -1;\n rep(i, n){\n if ( !visited[i] && minv > d[i] ) {\n\tu = i;\n\tminv = d[i];\n }\n }\n if ( u == -1 ) break;\n visited[u] = true;\n cnt++;\n\n rep(v, n){\n if ( !visited[v] && G[u][v] != INFTY ){\n\tint cost = d[u] + G[u][v];\n\tif ( cost == d[v] ){\n\t p[v].push_back(u);\n\t} else if ( cost < d[v] ){\n\t p[v].clear();\n\t p[v].push_back(u);\n\t d[v] = cost;\n\t}\n }\n }\n }\n\n assert( cnt == n );\n}\n\nvoid tsort( int n, int u, bool T[MAX][MAX], vector<int> &order, bool visited[MAX], vector<int> p[MAX] ){\n visited[u] = true;\n rep(v, n) if ( T[u][v] && !visited[v]) tsort(n, v, T, order, visited, p);\n\n if ( u == 0 || u == n-1 || p[u].size() > 0 ){\n order.push_back(u);\n }\n}\n\nvoid parse( int n, int u, vector<int> p[MAX], bool inpath[MAX]){\n inpath[u] = true;\n for ( int i = 0; i < p[u].size(); i++ ){\n int v = p[u][i];\n if ( !inpath[v] )parse(n, v, p, inpath);\n // parse(n, v, p, inpath);\n }\n}\n\nvoid makeTree(int n, bool T[MAX][MAX], vector<int> p[MAX], int q){\n bool inpath[MAX];\n rep(i, n) inpath[i] = false;\n parse(n, n-1, p, inpath);\n\n rep(i, n) rep(j, n) T[i][j] = false;\n rep(v, n){\n rep(i, p[v].size()){\n int u = p[v][i];\n if ( inpath[u] && inpath[v] ) T[u][v] = true;\n }\n }\n\n vector<int> order;\n bool visited[MAX]; \n\n rep(i, n) visited[i] = false;\n order.clear();\n tsort(n, 0, T, order, visited, p);\n reverse(order.begin(), order.end());\n\n double forward[MAX], back[MAX];\n rep(i, n) forward[i] = back[i] = 0.0;\n\n //rep(i,n) cout << order[i] << \" \";\n //cout << endl;\n\n assert( order[0] == 0 );\n assert( order[order.size()-1] == n-1 );\n forward[order[0]] = 1;\n for ( int i = 0; i < order.size(); i++ ){\n int u = order[i];\n rep(v, n){\n if ( T[u][v] ) forward[v] += forward[u];\n }\n }\n for ( int i = 0; i < n; i++ ){\n if ( 0 == i ) continue;\n forward[i] /= forward[n-1];\n }\n \n rep(i, n) visited[i] = false;\n order.clear();\n // Tt\n bool tmp[MAX][MAX];\n /*\n rep(i, n){\n rep(j, n) cout << T[i][j] << \" \";\n cout << endl;\n }*/\n rep(i, n) rep(j, n) tmp[j][i] = T[i][j];\n rep(i, n) rep(j, n) T[i][j] = tmp[i][j];\n\n /*\n rep(i, n){\n rep(j, n) cout << T[i][j] << \" \";\n cout << endl;\n }\n cout << endl;\n */\n\n\n tsort(n, n-1, T, order, visited, p);\n reverse(order.begin(), order.end());\n\n // rep(i, n) cout << order[i] << \" \";\n // cout << endl;\n\n assert( order[0] == n-1 );\n assert( order[order.size()-1] == 0 );\n back[order[0]] = 1.0;\n for ( int i = 0; i < order.size(); i++ ){\n int u = order[i];\n rep(v, n){\n if ( T[u][v] ) back[v] += back[u];\n }\n }\n\n double base = 1.0; // back[0];\n for ( int i = 0; i < n; i++ ){\n if ( i == n-1 ) continue;\n // back[i] = back[i]/back[0];\n back[i] = back[i]/base;\n\n }\n\n\n /*\n rep(i, n){\n //printf(\"%.4lf %.4lf %.4lf\\n\", forward[i], back[i], forward[i]*back[i]);\n printf(\"%.8lf\\n\", forward[i]*back[i]);\n }\n cout << endl;\n */\n\n int req;\n\n rep(i, q){\n cin >> req;\n assert( 0 < req && req < n-1 );\n printf(\"%.12lf\\n\", forward[req]*back[req]);\n \n\t//printf(\"%.12lf * %.2lf = %.12lf\\n\", forward[req], back[req], forward[req]*back[req]);\n }\n\n \n cout << endl;\n\n}\n\n\nmain(){\n int n, m, q, G[MAX][MAX], s, t, c;\n bool T[MAX][MAX];\n vector<int> p[MAX];\n while(1){\n cin >> n >> m >> q;\n if ( n == 0 && m == 0 && q == 0) break;\n\n rep(i, n) rep(j, n) G[i][j] = INFTY;\n rep(i, m){\n cin >> s >> t >> c;\n G[s][t] = G[t][s] = c;\n }\n dijkstra(n, G, p);\n makeTree(n, T, p, q);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1058_256520",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\nconst int N = 110;\nconst int M = 1000010;\nconst int inf = 1000000000;\n\nstruct Edge\n{\n int f, t, d;\n}e[M];\n\nint point[N], next[M], ne;\nint dis[2][N], q[N];\nbool u[N];\n\nvoid add_edge(int f, int t, int d)\n{\n e[ne].f = f, e[ne].t = t, e[ne].d = d;\n next[ne] = point[f], point[f] = ne++;\n}\n\nvoid spfa(int s, int n, int k)\n{\n int i, tmp, f, r;\n for(i = 0; i < n; ++i) {\n dis[k][i] = inf;\n u[i] = false;\n }\n dis[k][s] = 0;\n u[s] = true;\n f = 0, r = 1;\n q[f] = s;\n while(f != r) {\n tmp = q[f];\n f = (f + 1) % n;\n u[tmp] = false;\n for(i = point[tmp]; i != -1; i = next[i]) {\n if(dis[k][e[i].t] > dis[k][tmp] + e[i].d) {\n dis[k][e[i].t] = dis[k][tmp] + e[i].d;\n if(!u[e[i].t]) {\n u[e[i].t] = true;\n q[r] = e[i].t;\n r = (r + 1) % n;\n }\n }\n }\n }\n}\n\nstruct Node\n{\n int d, id;\n double cnt;\n bool operator < (const Node &x) const {\n return d < x.d;\n }\n}qi[N];\n\nbool cmp(const Node &x, const Node &y)\n{\n return x.id < y.id;\n}\n\nint qid[N];\ndouble cnt[N];\n\nvoid update(int s, int n)\n{\n for(int i = 0; i < n; ++i)\n qid[qi[i].id] = i;\n qi[0].cnt = 1;\n for(int i = 0; i < n; ++i) {\n int f = qi[i].id;\n for(int j = point[f]; j != -1; j = next[j]) {\n int t = e[j].t;\n if(!u[t]) continue;\n if(dis[0][f] + e[j].d == dis[0][t])\n qi[qid[t]].cnt += qi[i].cnt;\n }\n }\n qi[0].cnt = qi[qid[n - 1]].cnt;\n\n for(int k = 1; k < n; ++k) {\n memset(cnt, 0, sizeof(cnt));\n cnt[0] = 1;\n for(int i = 0; i < n; ++i) {\n if(i == k) continue;\n int f = qi[i].id;\n for(int j = point[f]; j != -1; j = next[j]) {\n int t = e[j].t;\n if(!u[t]) continue;\n if(dis[0][f] + e[j].d == dis[0][t])\n cnt[qid[t]] += cnt[i];\n }\n }\n if(k != qid[n - 1])\n qi[k].cnt = qi[qid[n - 1]].cnt - cnt[qid[n - 1]];\n }\n}\n\nint main()\n{\n int i, n, m, p, a, b, d, iid;\n while(scanf(\"%d%d%d\", &n, &m, &p) && n + m + p) {\n ne = 0;\n memset(point, -1, sizeof(point));\n for(i = 0; i < m; ++i) {\n scanf(\"%d%d%d\", &a, &b, &d);\n add_edge(a, b, d);\n add_edge(b, a, d);\n }\n spfa(0, n, 0);\n spfa(n - 1, n, 1);\n /*for(int j = 0; j < 2; ++j) {\n printf(\"********\\n\");\n for(i = 0; i < n; ++i) {\n printf(\"%d: %d\\n\", i, dis[j][i]);\n }\n }*/\n memset(u, false, sizeof(u));\n for(i = 0; i < n; ++i) {\n qi[i].d = dis[0][i];\n qi[i].cnt = 0, qi[i].id = i;\n if(dis[0][i] + dis[1][i] == dis[0][n - 1])\n u[i] = true;\n }\n sort(qi, qi + n);\n update(0, n);\n sort(qi, qi + n, cmp);\n while(p--) {\n scanf(\"%d\", &iid);\n if(qi[n - 1].cnt == 0) {\n printf(\"0.00000000\\n\");\n }\n else {\n printf(\"%.14f\\n\", qi[iid].cnt * 1.0 / qi[n - 1].cnt);\n }\n }\n printf(\"\\n\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1058_205244",
"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 shortestPath(const vector<vector<int> >& graph, int start, vector<int>& dist)\n{\n int n = graph.size();\n dist.assign(n, INT_MAX);\n dist[start] = 0;\n priority_queue<pair<int,int> ,vector<pair<int,int> >, greater<pair<int,int> > > q;\n q.push(make_pair(0, start));\n\n while(!q.empty()){\n pair<int, int> p = q.top();\n q.pop();\n int v = p.second;\n if(dist[v] < p.first)\n continue;\n for(int i=0; i<n; ++i){\n if(graph[v][i] >= 0 && dist[v] + graph[v][i] < dist[i]){\n dist[i] = dist[v] + graph[v][i];\n q.push(make_pair(dist[i], i));\n }\n }\n }\n\n replace(dist.begin(), dist.end(), INT_MAX, -1);\n}\n\ndouble dfs1(vector<vector<int> >& graph, vector<int>& dist, vector<double>& num, int pos){\n if(num[pos] != -1)\n return num[pos];\n\n int n = graph.size();\n if(pos == n-1)\n return num[pos] = 1;\n\n double tmp = 0;\n for(int i=0; i<n; ++i){\n if(graph[pos][i] != -1 && dist[pos] + graph[pos][i] == dist[i])\n tmp += dfs1(graph, dist, num, i);\n }\n return num[pos] = tmp;\n}\n\ndouble dfs2(vector<vector<int> >& graph, vector<int>& dist, vector<double>& num, int pos){\n if(num[pos] != -1)\n return num[pos];\n\n int n = graph.size();\n if(pos == 0)\n return num[pos] = 1;\n\n double tmp = 0;\n for(int i=0; i<n; ++i){\n if(graph[i][pos] != -1 && dist[pos] == dist[i] + graph[i][pos])\n tmp += dfs2(graph, dist, num, i);\n }\n return num[pos] = tmp;\n}\n\nvoid solve(vector<vector<int> >& graph, vector<double>& p)\n{\n int n = graph.size();\n vector<int> dist;\n shortestPath(graph, 0, dist);\n\n vector<double> num1(n, -1.0), num2(n, -1.0);\n dfs1(graph, dist, num1, 0);\n dfs2(graph, dist, num2, n-1);\n\n p.resize(n, 0.0);\n for(int i=0; i<n; ++i){\n if(num2[i] > -0.5)\n p[i] = num1[i] * num2[i] / num1[0];\n }\n}\n\nint main()\n{\n for(;;){\n int n, m, p;\n cin >> n >> m >> p;\n if(n == 0)\n return 0;\n\n vector<vector<int> > graph(n, vector<int>(n, -1));\n for(int i=0; i<m; ++i){\n int a, b, c;\n cin >> a >> b >> c;\n graph[a][b] = graph[b][a] = c;\n }\n\n vector<double> prob;\n solve(graph, prob);\n for(int i=0; i<p; ++i){\n int a;\n cin >> a;\n printf(\"%.10f\\n\", prob[a]);\n }\n cout << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1058_158701",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n#include<cmath>\n#include<cstring>\n#include<vector>\n#include<sstream>\n#include<set>\n#include<queue>\n#include<algorithm>\n#include<cassert>\n\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define fr(i,c) for(__typeof(c.begin()) i=c.begin();i!=c.end();i++)\n#define pb push_back\n#define mp make_pair\n\nint n,m,p,C[100];\nvector<vector<pair<int,int> > > e;\nint d[100];\nbool v[100],u[100];\ndouble togoal[100],prob[100];\n\nint main(){\n\twhile(cin>>n>>m>>p,n){\n\t\te.clear(); e.resize(n);\n\t\trep(i,m){\n\t\t\tint a,b,c; cin>>a>>b>>c;\n\t\t\te[a].pb(mp(b,c)); e[b].pb(mp(a,c));\n\t\t}\n\t\trep(i,p)cin>>C[i];\n\t\t\n\t\trep(i,n)d[i]=1<<28; d[0]=0;\n\t\tpriority_queue<pair<int,int> > Q; Q.push(mp(0,0));\n\t\twhile(!Q.empty()){\n\t\t\tint c=Q.top().second,cc=Q.top().first; Q.pop();\n\t\t\tif(c==n-1)break;\n\t\t\tif(d[c]<-cc)continue;\n\t\t\tfr(i,e[c])if(d[i->first]>-cc+i->second)\n\t\t\td[i->first]=-cc+i->second,Q.push(mp(cc-i->second,i->first));\n\t\t}\n\t\t\n\t\trep(i,n)u[i]=v[i]=0;\n\t\trep(i,n)prob[i]=0,togoal[i]=0;\n\t\ttogoal[n-1]=1; v[n-1]=1;\n\t\tQ=priority_queue<pair<int,int> >(); Q.push(mp(d[n-1],n-1));\n\t\twhile(!Q.empty()){\n\t\t\tint c=Q.top().second; Q.pop();\n\t\t\tfr(i,e[c])if(d[i->first]+i->second==d[c]){\n\t\t\t\ttogoal[i->first]+=togoal[c];\n\t\t\t\tif(!v[i->first])v[i->first]=1,Q.push(mp(d[i->first],i->first));\n\t\t\t}\n\t\t}\n\t\tQ=priority_queue<pair<int,int> >(); Q.push(mp(0,0));\n\t\tprob[0]=1; u[0]=1;\n\t\twhile(!Q.empty()){\n\t\t\tint c=Q.top().second; Q.pop();\n\t\t\tfr(i,e[c])if(v[i->first]&&d[i->first]==d[c]+i->second)\n\t\t\t{\n\t\t\t\tprob[i->first]+=prob[c]*togoal[i->first]/togoal[c];\n\t\t\t\tif(!u[i->first])u[i->first]=1,Q.push(mp(-d[i->first],i->first));\n\t\t\t}\n\t\t}\n\t\trep(i,p)printf(\"%.7f\\n\",prob[C[i]]); puts(\"\");\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_1058_119233",
"code_snippet": "#include<iostream>\n#include<cmath>\n#include<vector>\n#include<queue>\n\nusing namespace std;\nconst int infty = 1<<28;\n\nstruct Node{\n vector<int> con;\n vector<int> in;\n vector<int> cost;\n};\n\ntypedef vector<Node> Graph;\n\ndouble topologicalSort(const Graph &G, int n, int s, int g)\n{\n double numPath[n];\n int invis[n];\n bool vis[n];\n queue<int> q;\n for(int i = 0; i < n; ++i){\n invis[i] = 0;\n numPath[i] = 0.0;\n vis[i] = false;\n }\n numPath[s]=1.0;\n \n q.push(s);\n vis[s]=true;\n while(!q.empty()){\n int now = q.front();\n q.pop();\n \n for(int i = 0; i < G[now].con.size(); ++i){\n int nid = G[now].con[i];\n invis[nid]++;\n numPath[nid] += numPath[now];\n if( invis[nid] == G[nid].in.size() ){\n\tif( !vis[nid] ){\n\t vis[nid]=true;\n\t q.push( nid );\n\t}\n }\n }\n }\n \n return numPath[g];\n}\n\nint main()\n{\n while(true){\n int n,m,p;\n cin >> n >> m >> p;\n if( n == 0 && m == 0 && p == 0 ) break;\n int c[p];\n double cPath[n];\n Graph G(n);\n Graph DAG(n);\n Graph rDAG(n);\n int d[n][n];\n \n for(int i = 0; i < n; ++i){\n for(int j = 0; j < n; ++j){\n\tif( i == j ) d[i][j] = 0;\n\telse d[i][j] = infty;\n }\n }\n\n for(int i = 0; i < m; ++i){\n int a,b,c;\n cin >> a >> b >> c;\n G[a].con.push_back(b);\n G[a].cost.push_back(c);\n G[b].con.push_back(a);\n G[b].cost.push_back(c);\n d[a][b]=min(d[a][b],c);\n d[b][a]=min(d[b][a],c);\n }\n for(int i = 0; i < p; ++i){\n cin >> c[i];\n }\n \n for(int k = 0; k < n; ++k){\n for(int i = 0; i < n; ++i){\n\tfor(int j = 0; j < n; ++j){\n\t d[i][j] = min( d[i][j], d[i][k]+d[k][j] );\n\t}\n }\n }\n \n for(int i = 0; i < n; ++i){\n for(int j = 0; j < G[i].con.size(); ++j){\n\tint u = i;\n\tint v = G[i].con[j];\n\tint w = G[i].cost[j];\n\tif( d[0][u]+w+d[v][n-1] == d[0][n-1] ){\n\t DAG[u].con.push_back(v);\n\t rDAG[v].con.push_back(u);\n\t DAG[v].in.push_back(u);\n\t rDAG[u].in.push_back(v);\n\t}\n }\n }\n\n double sgPath = topologicalSort( DAG, n, 0, n-1 );\n for(int i = 0; i < p; ++i){\n cPath[i] = topologicalSort( DAG, n, 0, c[i] );\n //cout << cPath[i] << ' ';\n cPath[i] *= topologicalSort( rDAG, n, n-1, c[i] );\n //cout << cPath[i] << endl;\n printf(\"%.12lf\\n\", cPath[i]/sgPath );\n }\n putchar('\\n');\n \n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1124,
"score_of_the_acc": -1.3074,
"final_rank": 19
}
] |
aoj_1063_cpp
|
Problem B: Watchin' TVA
Animation is one of methods for making movies and in Japan, it is popular to broadcast as a television program or perform as a movie. Many people, especially the young, love one. And here is an anime lover called Jack. We say he is an mysterious guy with uncertain age. He likes anime which are broadcasted in midnight and early morning especially.
In his room, there is a huge piece of paper on the wall. He writes a timetable of TV anime on it. In his house, he can watch all Japanese TV anime programs that are broadcasted in Japan using a secret and countrywide live system. However he can not watch all anime and must give up to watch some programs because they are "broadcasted at the same time" in a season. Here, programs are "broadcasted at the same time" means that two or more programs have one or more common minutes in broadcasting time. Increasing the number of anime programs in recent makes him nervous. Actually, some people buy DVDs after the program series ends or visit a web site called vhefoo. Anyway, he loves to watch programs on his live system. Of course, he is not able to watch two or more programs at the same time. However, as described above, he must give up some programs broadcasted at the same time. Therefore, he has a set of programs
F
and he watches programs in a set
F
absolutely.
Your task is to write a program that reads a timetable and outputs the maximum number of watchable programs, keeping that Jack watches all programs in the set
F
. Of course, there are multiple choices of programs, so we want the number of programs he can watch. If two or more programs in a set
F
are broadcasted at the same time, you must give Jack an unfortunate announcement. In this case, your program outputs -1. In addition, each anime program is a program of 30 minutes.
Input
Input consists of multiple datasets.
A dataset is given in a following format.
N
PROGRAM
1
PROGRAM
2
...
PROGRAM
N
P
FAV
1
FAV
2
...
FAV
P
N
is the number of programs in a season.
PROGRAM
i
(1≤
i
≤
N
)is a string which has the following format.
name
weekday
start
name
is a program name. This is a a string having between 1 and 32 characters and these names do not overlap each other program. A name consists of alphanumeric characters and '_'(underscore).
weekday
is a broadcasting weekday about the corresponding program. This is an integer. 0 means Sunday and 1 is Monday and so on (2:Tuesday, 3:Wednesday, 4:Thursday, 5:Friday, 6:Saturday).
start
is a starting time of the program broadcasting. This is an integer between 600 and 2929. First one or two digits represent hour and the last two digits represent minute. If the hour has one digit it will be a representation "900" for example. Note: a program may have an integer more than or equal to 2400 as
start
, if the program begins the next day. For example, a program begins from 2500 on Monday should be interpreted as a program begins from 0100 on Tuesday.
There are no input the minute of
start
exceeds 59. And
...(truncated)
|
[
{
"submission_id": "aoj_1063_10851284",
"code_snippet": "/*\n * Author: 8mao\n * Created Time: 2014/3/16 21:55:53\n * File Name: 2155.cpp\n */\n# include<map>\n# include<set>\n# include<cmath>\n# include<queue>\n# include<stack>\n# include<vector>\n# include<string>\n# include<cstdio>\n# include<cstring>\n# include<iostream>\n# include<algorithm>\n# include<functional>\nusing namespace std;\n\ntypedef pair<int,int> PII;\n# define INF 1<<30\n# define LL long long\n# define MOD 1000000007\n# define VI vector<int>\n# define VLL vector<LL>\n# define VS vector<string>\n# define PII pair<int,int>\n\n# define F first\n# define S second\n# define mp make_pair\n# define pb push_back\n# define lb lower_bound\n# define up upper_bound\n# define lowbit(x)(x&-x)\n# define lson l,m,rt<<1\n# define rson m+1,r,rt<<1|1\n# define clr(x) (x).clear()\n# define sz(x) ((int)(x).size())\n# define all(x) (x).begin(),(x).end()\n# define mem(x,y) memset(x,y,sizeof(x))\n# define forall(it,c) for(typeof((c).begin())it=(c).begin();it!=(c).end();it++)\n\n# define N 505\n\nstruct Seg\n{\n int l, r;\n Seg() {};\n Seg(int ll, int rr) : l(ll), r(rr) {};\n bool operator < (const Seg &b)const\n {\n return l < b.l;\n }\n}seg[N];\n\nbool Jireh(Seg &a, Seg &b)\n{\n int d = abs(a.r - b.r);\n return d < 30;\n}\n\nint solve(vector<Seg> &v)\n{\n int i, r = -1, ans = 0;\n sort (all (v));\n for (i = 0; i < sz(v); i++)\n if (v[i].l >= r)\n {\n r = v[i].r;\n ans++;\n }\n return ans;\n}\n\nint calc(int x, int y)\n{\n return x * 24 * 60 + y % 100 + y / 100 * 60;\n}\n\nint main()\n{\n //freopen(\"in.txt\",\"r\",stdin);\n int i, j, n, m, x, y, flag, p;\n char s[105];\n vector<Seg> v, u;\n map<string, int> Hash;\n while (scanf (\"%d\", &n) != EOF && n)\n {\n flag = 0;\n clr (u);\n clr (v);\n clr (Hash);\n for (i = 1; i <= n; i++)\n {\n scanf (\"%s %d %d\", s, &x, &y);\n Hash[s] = i;\n seg[i] = Seg(calc(x, y), calc(x, y) + 30);\n }\n scanf (\"%d\", &m);\n for (i = 1; i <= m; i++)\n {\n scanf (\"%s\", s);\n p = Hash[s];\n u.pb(seg[p]);\n }\n for (i = 0; i < sz(u); i++)\n for (j = 0; j < i; j++)\n if(Jireh(u[i], u[j]))\n flag = 1;\n if (flag)\n {\n printf (\"-1\\n\");\n continue;\n }\n for (i = 1; i <= n; i++)\n {\n for (j = 0; j < sz(u); j++)\n if (Jireh(seg[i], u[j]))\n break;\n if (j == sz(u)) v.pb(seg[i]);\n }\n int ans = solve(v) + sz(u);\n printf (\"%d\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3612,
"score_of_the_acc": -0.0555,
"final_rank": 8
},
{
"submission_id": "aoj_1063_10726002",
"code_snippet": "/*\n * Author: 8mao\n * Created Time: 2014/3/16 13:31:26\n * File Name: 1331.cpp\n */\n# include<map>\n# include<set>\n# include<cmath>\n# include<queue>\n# include<stack>\n# include<vector>\n# include<string>\n# include<cstdio>\n# include<cstring>\n# include<iostream>\n# include<algorithm>\n# include<functional>\nusing namespace std;\n\ntypedef pair<int,int> PII;\n# define INF 1<<30\n# define LL long long\n# define MOD 1000000007\n# define VI vector<int>\n# define VLL vector<LL>\n# define VS vector<string>\n# define PII pair<int,int>\n\n# define F first\n# define S second\n# define mp make_pair\n# define pb push_back\n# define lb lower_bound\n# define up upper_bound\n# define lowbit(x)(x&-x)\n# define lson l,m,rt<<1\n# define rson m+1,r,rt<<1|1\n# define clr(x) (x).clear()\n# define sz(x) ((int)(x).size())\n# define all(x) (x).begin(),(x).end()\n# define mem(x,y) memset(x,y,sizeof(x))\n# define forall(it,c) for(typeof((c).begin())it=(c).begin();it!=(c).end();it++)\n\n# define N 505\n# define M 20005\nPII a[N];\nint dp[N][M], n;\n\nstruct node\n{\n char s[105];\n int t, must, del;\n}e[N];\n\nint calc(int week, int time)\n{\n int ans = week * 24 * 60;\n ans += time % 100 + (time / 100 * 60);\n return ans;\n}\n\nint dfs(int pos, int end)\n{\n int ans = 0;\n if (pos == n + 1)\n return 0;\n if (dp[pos][end] != -1)\n return dp[pos][end];\n if (a[pos].S || a[pos].F >= end) //must 有可能会出错\n ans = max (ans, 1 + dfs(pos + 1, a[pos].F + 30));\n ans = max (ans, dfs(pos + 1, end));\n return dp[pos][end] = ans;\n}\n\nint Jireh(int m)\n{\n int i, j;\n for (i = 1; i <= m; i++)\n if (e[i].must)\n for (j = 1; j <= m; j++)\n if (j != i && abs(e[j].t - e[i].t) < 30) //注意点,有可能会出错\n e[j].del = 1;\n for (i = 1; i <= m; i++)\n if (e[i].must && e[i].del)\n return 0;\n n = 0;\n for (i = 1; i <= m; i++)\n if (!e[i].del)\n {\n ++n;\n a[n].F = e[i].t;\n a[n].S = e[i].must;\n }\n sort (a + 1, a + n + 1);\n return 1;\n}\n\nint cmp(const node &a, const node &b)\n{\n return a.t < b.t;\n}\n\nint main()\n{\n int i, j, n, m, x, y;\n char s[105];\n while (scanf (\"%d\", &n) != EOF && n)\n {\n mem (dp, -1);\n for (i = 1; i <= n; i++)\n {\n scanf (\"%s\", e[i].s);\n scanf (\"%d %d\", &x, &y);\n e[i].t = calc(x, y);\n e[i].must = e[i].del = 0;\n }\n scanf (\"%d\", &m);\n for (i = 1; i <= m; i++)\n {\n scanf (\"%s\", s);\n for (j = 1; j <= n; j++)\n if (strcmp(e[j].s, s) == 0)\n {\n e[j].must = 1;\n break;\n }\n }\n sort (e + 1, e + n + 1, cmp);\n if (!Jireh(n))\n {\n printf (\"-1\\n\");\n continue;\n }\n int ans = dfs(1, 0);\n printf (\"%d\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 43048,
"score_of_the_acc": -1.1949,
"final_rank": 20
},
{
"submission_id": "aoj_1063_6448625",
"code_snippet": "#include<iostream>\n#include<string>\n#include<map>\n#include<cstring>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint n,p;\nmap<string,int>mp;\nint vis[1000005];\nint ans;\n\nint main() {\n\twhile(cin>>n && n) {\n\t\tmp.clear();\n\t\tmemset(vis,0,sizeof(vis));\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tstring name;\n\t\t\tint d,t;\n\t\t\tcin>>name>>d>>t;\n\t\t\tt = t % 100 + (t-600)/100*60+d*1440;\n\t\t\tmp[name] = t;\n\t\t}\n\t\tcin>>p;\n\t\tans = p;\n\t\tfor(int i=0;i<p;i++) {\n\t\t\tstring name;\n\t\t\tcin>>name;\n\t\t\tauto it = mp.find(name);\n\t\t\tint t = it->second;\n\t\t\tfor(int j=0;j<30;j++) {\n\t\t\t\tif(vis[t+j])\n\t\t\t\t\tans = -1;\n\t\t\t\tvis[t+j]++;\n\t\t\t}\n\t\t}\n\t\tif(ans >= 0) {\n\t\t\tvector<int>v;\n\t\t\tfor(auto it=mp.begin();it!=mp.end();it++) \n\t\t\t\tv.push_back(it->second);\n\t\t\tsort(v.begin(),v.end());\n\t\t\tfor(int i=0;i<v.size();i++) {\n\t\t\t\tif(!vis[v[i]]&&!vis[v[i]+29]) {\n\t\t\t\t\tans++;\n\t\t\t\t\tfor(int j=0;j<30;j++)\n\t\t\t\t\t\tvis[v[i]+j] = 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": 80,
"memory_kb": 7256,
"score_of_the_acc": -0.1648,
"final_rank": 16
},
{
"submission_id": "aoj_1063_6448319",
"code_snippet": "#include <bits/stdc++.h>\n\n#define pb push_back\n#define mp make_pair\n#define X first\n#define Y second\nusing namespace std;\n\ntypedef long long int ll;\ntypedef vector <int> vi;\ntypedef pair <int,int> pii;\nconst int Size=1e6+10;\nconst int INF=0x3f3f3f3f;\n\ninline int read()\n{\n int x=0, f=1; char ch=getchar();\n while(ch<'0' || ch>'9') {if(ch=='-') f=-1; ch=getchar();}\n while(ch>='0' && ch<='9') {x=x*10+ch-'0'; ch=getchar();}\n return x*f;\n}\n\nmap<string,int> mmap;\nvi fav;\nvi unfav;\n\n//给出两个开始时间，若相交返回true\nbool check(int x,int y)\n{\n return (y<=x && x<y+30) || (x<=y && y<x+30);\n}\n\nint main()\n{\n while (1)\n {\n int n=read();\n if (!n) break;\n\n mmap.clear();\n fav.clear();\n unfav.clear();\n\n string name;\n int w,s,h,m,t;\n while (n--)\n {\n cin>>name>>w>>s;\n m=s%100;\n h=s/100;\n t=w*24*60+h*60+m;\n mmap[name]=t;\n }\n\n int p=read();\n while (p--)\n {\n cin>>name;\n fav.pb(mmap[name]);\n mmap.erase(name);\n }\n\n for (pair<string,int> p:mmap)\n unfav.pb(p.Y);\n\n sort(fav.begin(),fav.end());\n sort(unfav.begin(),unfav.end());\n\n int siz=fav.size();\n bool flag=true;\n for (int i=1;i<siz;++i)\n if (fav[i]-fav[i-1]<30) {flag=false; break;}\n if (!flag) {puts(\"-1\"); continue;}\n int res=siz;\n\n siz=unfav.size();\n int pre_end=-1;\n for (int i=0;i<siz;++i)\n {\n bool flag=true;\n for (int j:fav)\n if (check(unfav[i],j)) {flag=false; break;}\n if (!flag) continue;\n if (pre_end!=-1 && pre_end>unfav[i]) continue;\n res++;\n pre_end=unfav[i]+30;\n }\n\n printf(\"%d\\n\",res);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3552,
"score_of_the_acc": -0.0687,
"final_rank": 10
},
{
"submission_id": "aoj_1063_5983559",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <string>\n#include <queue>\n#include <vector>\n#include <stack>\n#include <map>\n#include <utility>\n#define cs cout << \"Wish You AC!\" << endl;\n#define js ios::sync_with_stdio(false); cin.tie(0);\n#define MEM(a,x) memset(a,x,sizeof(a))\n#define lowbit(x) (x&-x)\n#define lson(x) x*2\n#define rson(x) x*2 + 1\n#define ll long long\n#define ull unsigned long long\n#define debug(x) std::cout << #x << \" is \" << (x) << '\\n'\n#define INF 1e14\n#define pb push_back\nusing namespace std;\ninline void read(ll &x){\n char c; int flag=0;\n while(!isdigit(c=getchar()))\n if(c=='-') flag=1;\n x=c-'0';\n while(isdigit(c=getchar()))\n x=x*10+c-'0';\n if(flag) x=-x;\n}\nconst int N = 5e2 + 10;\nll n;\nint main()\n{\n while(cin >> n && n)\n {\n ll i, j;\n ll ans = 0;\n vector<pair<ll, string> > v(n);\n for(i = 0; i < n; i++)\n {\n string a;\n ll b, c;\n cin >> a >> b >> c;\n v[i] = make_pair(b*24*60 + c/100*60 + c%100, a);\n }\n sort(v.begin(), v.end());\n ll p; cin >> p;\n for(i = 1; i <= p; i++)\n {\n string str;\n bool ok = 0;\n cin >> str;\n for(j = 0; j < v.size(); j++)\n {\n if(v[j].second == str){\n ok = 1;\n pair<ll, string> l = make_pair(v[j].first-29, \"0\"), r = make_pair(v[j].first+30, \"0\");\n v.erase(lower_bound(v.begin(), v.end(), l), lower_bound(v.begin(), v.end(), r));\n break;\n }\n }\n if(!ok) ans = -INF;\n }\n ll now = 0;\n for(i = 0; i < v.size(); i++)\n {\n if(v[i].first >= now){\n now = v[i].first+30;\n ans++;\n }\n }\n cout << max((ll)-1, ans+p) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3228,
"score_of_the_acc": -0.072,
"final_rank": 12
},
{
"submission_id": "aoj_1063_3533187",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\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;\ntypedef pair<int, string> P;\n\ntemplate<typename T>\nvector<T> make_v(size_t a, T b) {\n return vector<T>(a, b);\n}\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<P> anime(n);\n REP(i, 0, n) {\n string s;\n cin >> s;\n int w, d;\n cin >> w >> d;\n int t = w * 24 * 60 + d / 100 * 60 + d % 100;\n anime[i] = {t, s};\n }\n const int size = 24 * 60 * 7;\n\n int m;\n cin >> m;\n vector<int> used(size, 0);\n {\n REP(i, 0, m) {\n string s;\n cin >> s;\n for (auto it = anime.begin(); it != anime.end(); it++) {\n if ((*it).second == s) {\n REP(j, 0, 30) {\n used[((*it).first + j) % size]++;\n }\n anime.erase(it);\n break;\n }\n }\n }\n bool check = true;\n REP(i, 0, size) {\n if (used[i] > 1) {\n check = false;\n }\n }\n if (!check) {\n cout << -1 << endl;\n continue;\n }\n }\n sort(anime.begin(), anime.end());\n\n int ans = m;\n for (auto &A : anime) {\n bool check = true;\n REP(j, 0, 30) {\n if (used[(A.first + j) % size] != 0) {\n check = false;\n }\n }\n if (check) {\n REP(j, 0, 30) {\n used[(A.first + j) % size]++;\n }\n ans++;\n }\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3184,
"score_of_the_acc": -0.0489,
"final_rank": 4
},
{
"submission_id": "aoj_1063_3329316",
"code_snippet": "#include<iostream>\n#include<map>\n#include<algorithm>\nusing namespace std;\n\nstruct data{\n data(){}\n string name;\n int start;\n bool operator<(const data other) const{\n return start < other.start;\n }\n};\n\nint main(){\n int n;\n while(cin >> n, n){\n bool t[60*24*8] = {};\n data d[n];\n int a, b;\n for(int i = 0; i < n; i++){\n cin >> d[i].name >> a >> b;\n d[i].start = 60*24*a + b/100*60 + b%100;\n }\n sort(d, d+n);\n \n map<string,int> m;\n for(int i = 0; i < n; i++) m[d[i].name] = i;\n\n int p;\n cin >> p;\n \n string imp;\n bool valid = true;\n \n for(int i = 0; i < p; i++){\n cin >> imp;\n for(int j = 0; j < 30; j++){\n if(t[d[m[imp]].start+j]) valid = false;\n t[d[m[imp]].start+j] = true;\n }\n }\n\n if(!valid){\n cout << -1 << endl;\n continue;\n }\n\n int ans = p;\n for(int i = 0; i < n; i++){\n bool judge = true;\n for(int j = 0; j < 30; j++){\n if(t[d[i].start+j]) judge = false;\n }\n if(!judge) continue;\n for(int j = 0; j < 30; j++){\n t[d[i].start+j] = true;\n }\n ans++;\n }\n\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3160,
"score_of_the_acc": -0.0814,
"final_rank": 15
},
{
"submission_id": "aoj_1063_3062034",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nstruct hoge{\n string name;\n int start;\n hoge(string name, int start) : name(name), start(start){ }\n};\nbool operator < (const hoge &a, const hoge &b){\n return a.start < b.start;\n}\n\nint main(void){\n while(true){\n int n;\n cin >> n;\n if(n==0) break;\n vector<hoge> v;\n for(int i=0; i<n; i++){\n string name;\n int start, weekday, s;\n cin >> name >> weekday >> start;\n s=weekday*24*60+start/100*60+start%100;\n v.push_back(hoge(name, s));\n }\n sort(v.begin(), v.end());\n int p;\n cin >> p;\n bool timezone[12000], tf=true;\n fill(timezone, timezone+12000, false);\n \n for(int i=0; i<p; i++){\n string str;\n cin >> str;\n for(int j=0; j<n; j++){\n if(tf){\n if(v[j].name==str){\n if(!timezone[v[j].start] && !timezone[v[j].start+29]){\n for(int t=v[j].start; t<v[j].start+30; t++){\n timezone[t]=true;\n }\n }else{\n tf=false;\n break;\n }\n }\n }\n }\n }\n int count=p;\n if(! tf) cout << -1 << \"\\n\";\n else{\n for(int i=0; i<n; i++){\n //cout << v[i].name << \" time=\" << v[i].start << \"\\n\";\n if(! timezone[v[i].start] && !timezone[v[i].start+29]){\n //cout << \"OK=\" << v[i].name << \"\\n\";\n for(int j=v[i].start; j<v[i].start+30; j++){\n timezone[j]=true;\n }\n count++;\n }\n }\n cout << count << \"\\n\";\n }\n \n \n }\n \n \n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3076,
"score_of_the_acc": -0.0684,
"final_rank": 9
},
{
"submission_id": "aoj_1063_2650807",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define all(c) (c).begin(), (c).end()\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\n\nint N;\nvector<string> names;\nvector<int> starts;\nint P;\nvector<string> favs;\nmap<string, int> to_id;\nbool cross_impl(int s1, int s2) {\n if (s1 <= s2 && s2 < s1 + 30) return true;\n return false;\n}\nbool cross(int s1, int s2) { return cross_impl(s1, s2) || cross_impl(s2, s1); }\nvoid solve() {\n rep(i, P) rep(j, P) if (i != j) {\n int a = to_id[favs[i]];\n int b = to_id[favs[j]];\n if (cross(starts[a], starts[b])) {\n // cout << \"muri: \" << favs[i] << \", \" << favs[j] << endl;\n // cout << a << \", \" << b << endl;\n // cout << starts[a] << \", \" << starts[b] << endl;\n cout << \"-1\" << endl;\n return;\n }\n }\n vector<int> used;\n rep(i, P) {\n int a = to_id[favs[i]];\n used.push_back(starts[a]);\n }\n rep(_, N) {\n int mini = 1e8;\n for (auto s : starts) {\n bool ok = true;\n for (auto x : used) ok &= !cross(x, s);\n if (ok && mini > s) mini = s;\n }\n if (mini != 1e8) used.push_back(mini);\n }\n cout << used.size() << endl;\n}\nint main() {\n while (cin >> N, N) {\n rep(i, N) {\n string n;\n int w, s;\n cin >> n >> w >> s;\n s = s / 100 * 60 + s % 100;\n s += w * 86400;\n names.push_back(n);\n starts.push_back(s);\n // cout << i << \": \" << s << endl;\n int t = to_id.size();\n to_id[n] = t;\n }\n cin >> P;\n rep(i, P) {\n string n;\n cin >> n;\n favs.push_back(n);\n }\n solve();\n favs.clear();\n starts.clear();\n to_id.clear();\n names.clear();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1260,
"memory_kb": 3292,
"score_of_the_acc": -0.5037,
"final_rank": 17
},
{
"submission_id": "aoj_1063_2586739",
"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\tbool operator<(const struct Info &arg) const{\n\t\tif(weekday != arg.weekday){\n\t\t\treturn weekday < arg.weekday;\n\t\t}else{\n\t\t\treturn start < arg.start;\n\t\t}\n\t}\n\tint weekday,start,end;\n\tchar name[33];\n};\n\nint N;\nInfo info[500];\nbool check[7][1440];\nbool used[500];\n\nbool strCmp(char* base, char* comp){\n\tint length1,length2;\n\tfor(length1=0;base[length1] != '\\0';length1++);\n\tfor(length2=0;comp[length2] != '\\0';length2++);\n\tif(length1 != length2)return false;\n\n\tfor(int i=0;base[i] != '\\0'; i++){\n\t\tif(base[i] != comp[i])return false;\n\t}\n\treturn true;\n}\n\nint translate_TIME(char buf[5]){\n\tint length;\n\tfor(length = 0; buf[length] != '\\0'; length++);\n\n\tint hour,minute;\n\n\tif(length == 3){\n\t\thour = buf[0]-'0';\n\t\tminute = 10*(buf[1]-'0')+(buf[2]-'0');\n\t}else{\n\t\thour = 10*(buf[0]-'0')+(buf[1]-'0');\n\t\tminute = 10*(buf[2]-'0')+(buf[3]-'0');\n\t}\n\thour -= 6;\n\treturn 60*hour+minute;\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < 7; i++){\n\t\tfor(int k = 0; k < 1440; k++)check[i][k] = false;\n\t}\n\n\tfor(int i = 0; i < N; i++)used[i] = false;\n\n\tchar start[5];\n\tint tmp;\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%s %d %s\",info[i].name,&info[i].weekday,start);\n\n\t\ttmp = translate_TIME(start);\n\n\t\tinfo[i].start = tmp;\n\t\tinfo[i].end = tmp+29;\n\t}\n\n\tsort(info,info+N);\n\n\tvector<int> MUST;\n\n\tint P;\n\tscanf(\"%d\",&P);\n\n\tchar tmp_name[33];\n\n\tfor(int loop = 0; loop < P; loop++){\n\t\tscanf(\"%s\",tmp_name);\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(strCmp(info[i].name,tmp_name)){\n\t\t\t\tMUST.push_back(i);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tbool FLG = true;\n\n\tfor(int i = 0; i < P-1; i++){\n\t\tfor(int k = i+1; k < P; k++){\n\t\t\tif((info[MUST[i]].weekday != info[MUST[k]].weekday) || (info[MUST[i]].start > info[MUST[k]].end || info[MUST[i]].end < info[MUST[k]].start)){\n\t\t\t\t//Do nothing\n\t\t\t}else{\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif(!FLG){\n\t\tprintf(\"-1\\n\");\n\t\treturn;\n\t}\n\n\tfor(int i = 0; i < P; i++){\n\t\tused[MUST[i]] = true;\n\t\tfor(int k = info[MUST[i]].start; k <= info[MUST[i]].end; k++){\n\t\t\tcheck[info[MUST[i]].weekday][k] = true;\n\t\t}\n\t}\n\n\tvector<int> V;\n\tfor(int i = 0; i < N; i++){\n\t\tif(used[i] == false){\n\t\t\tV.push_back(i);\n\t\t}\n\t}\n\n\tint ans = P;\n\tint right,V_index = 0;\n\tbool Found;\n\n\tif(V.size() == 0){\n\t\tprintf(\"%d\\n\",P);\n\t\treturn;\n\t}\n\n\tfor(int w_day = 0; w_day < 7; w_day++){\n\t\tfor(int time = 0; time < 1440;){\n\n\t\t\tif(V_index == V.size()){\n\t\t\t\tprintf(\"%d\\n\",ans);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif(check[w_day][time]){\n\t\t\t\ttime++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor(right = time; right+1 < 1440 && check[w_day][right+1] == false; right++);\n\n\t\t\tif(right-time+1 < 30){\n\n\t\t\t\tfor(; V_index < V.size();){\n\t\t\t\t\tif((info[V[V_index]].weekday < w_day) || (info[V[V_index]].weekday == w_day && info[V[V_index]].start <= right)){\n\t\t\t\t\t\t V_index++;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\ttime = right+1;\n\t\t\t}else{\n\n\t\t\t\tFound = false;\n\n\t\t\t\tfor(; V_index < V.size();){\n\t\t\t\t\tif((info[V[V_index]].weekday < w_day) || (info[V[V_index]].weekday == w_day && info[V[V_index]].start < time)){\n\t\t\t\t\t\tV_index++;\n\t\t\t\t\t}else if(info[V[V_index]].weekday == w_day && info[V[V_index]].start >= time && info[V[V_index]].end <= right){\n\t\t\t\t\t\tans++;\n\t\t\t\t\t\ttime = info[V[V_index]].end+1;\n\t\t\t\t\t\tFound = true;\n\t\t\t\t\t\tV_index++;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(!Found){\n\t\t\t\t\ttime = right+1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3140,
"score_of_the_acc": -0.0552,
"final_rank": 7
},
{
"submission_id": "aoj_1063_2586736",
"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\tbool operator<(const struct Info &arg) const{\n\t\tif(weekday != arg.weekday){\n\t\t\treturn weekday < arg.weekday;\n\t\t}else{\n\t\t\treturn start < arg.start;\n\t\t}\n\t}\n\tint weekday,start,end;\n\tchar name[33];\n};\n\nint N;\nInfo info[500];\nbool check[7][1440];\nbool used[500];\n\nbool strCmp(char* base, char* comp){\n\tint length1,length2;\n\tfor(length1=0;base[length1] != '\\0';length1++);\n\tfor(length2=0;comp[length2] != '\\0';length2++);\n\tif(length1 != length2)return false;\n\n\tfor(int i=0;base[i] != '\\0'; i++){\n\t\tif(base[i] != comp[i])return false;\n\t}\n\treturn true;\n}\n\nint translate_TIME(char buf[5]){\n\tint length;\n\tfor(length = 0; buf[length] != '\\0'; length++);\n\n\tint hour,minute;\n\n\tif(length == 3){\n\t\thour = buf[0]-'0';\n\t\tminute = 10*(buf[1]-'0')+(buf[2]-'0');\n\t}else{\n\t\thour = 10*(buf[0]-'0')+(buf[1]-'0');\n\t\tminute = 10*(buf[2]-'0')+(buf[3]-'0');\n\t}\n\thour -= 6;\n\treturn 60*hour+minute;\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < 7; i++){\n\t\tfor(int k = 0; k < 1440; k++)check[i][k] = false;\n\t}\n\n\tfor(int i = 0; i < N; i++)used[i] = false;\n\n\tchar start[5];\n\tint tmp;\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%s %d %s\",info[i].name,&info[i].weekday,start);\n\n\t\ttmp = translate_TIME(start);\n\n\t\tinfo[i].start = tmp;\n\t\tinfo[i].end = tmp+29;\n\t}\n\n\tsort(info,info+N);\n\n\tvector<int> MUST;\n\n\tint P;\n\tscanf(\"%d\",&P);\n\n\tchar tmp_name[33];\n\n\tfor(int loop = 0; loop < P; loop++){\n\t\tscanf(\"%s\",tmp_name);\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(strCmp(info[i].name,tmp_name)){\n\t\t\t\tMUST.push_back(i);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tbool FLG = true;\n\n\tfor(int i = 0; i < P-1; i++){\n\t\tfor(int k = i+1; k < P; k++){\n\t\t\tif((info[MUST[i]].weekday != info[MUST[k]].weekday) || (info[MUST[i]].start > info[MUST[k]].end || info[MUST[i]].end < info[MUST[k]].start)){\n\t\t\t\t//Do nothing\n\t\t\t}else{\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif(!FLG){\n\t\tprintf(\"-1\\n\");\n\t\treturn;\n\t}\n\n\tfor(int i = 0; i < P; i++){\n\t\tused[MUST[i]] = true;\n\t\tfor(int k = info[MUST[i]].start; k <= info[MUST[i]].end; k++){\n\t\t\tcheck[info[MUST[i]].weekday][k] = true;\n\t\t}\n\t}\n\n\tvector<int> V;\n\tfor(int i = 0; i < N; i++){\n\t\tif(used[i] == false){\n\t\t\tV.push_back(i);\n\t\t}\n\t}\n\n\tint ans = P;\n\tint right,V_index = 0;\n\tbool Found;\n\n\tif(V.size() == 0){\n\t\tprintf(\"%d\\n\",P);\n\t\treturn;\n\t}\n\n\tfor(int w_day = 0; w_day < 7; w_day++){\n\t\tfor(int time = 0; time < 1440;){\n\t\t\tif(check[w_day][time]){\n\t\t\t\ttime++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor(right = time; right+1 < 1440 && check[w_day][right+1] == false; right++);\n\n\t\t\tif(right-time+1 < 30){\n\n\t\t\t\tfor(; V_index < V.size();){\n\t\t\t\t\tif((info[V[V_index]].weekday < w_day) || (info[V[V_index]].weekday == w_day && info[V[V_index]].start <= right)){\n\t\t\t\t\t\t V_index++;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\ttime = right+1;\n\t\t\t}else{\n\n\t\t\t\tFound = false;\n\n\t\t\t\tfor(; V_index < V.size();){\n\t\t\t\t\tif((info[V[V_index]].weekday < w_day) || (info[V[V_index]].weekday == w_day && info[V[V_index]].start < time)){\n\t\t\t\t\t\tV_index++;\n\t\t\t\t\t}else if(info[V[V_index]].weekday == w_day && info[V[V_index]].start >= time && info[V[V_index]].end <= right){\n\t\t\t\t\t\tans++;\n\t\t\t\t\t\ttime = info[V[V_index]].end+1;\n\t\t\t\t\t\tFound = true;\n\t\t\t\t\t\tV_index++;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(!Found){\n\t\t\t\t\ttime = right+1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3208,
"score_of_the_acc": -0.0531,
"final_rank": 6
},
{
"submission_id": "aoj_1063_2438608",
"code_snippet": "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<complex>\n#include<vector>\n#include<map>\nusing namespace std;\n\n/*struct anime{\n string name;\n int weekday;\n int start;\n long int minutes;\n bool favorite;\n void setup(string n,int w,int s){\n name = n;\n weekday = w;\n start = s;\n favorite = false;\n int h = start / 100;\n int m = start % 100;\n if(h >= 24){\n h -= 24;\n w++;\n }\n minutes = h*60 + m + weekday * 60 * 24;\n }\n};*/\n\nint setup(int w,int s){\n int h = s / 100;\n int m = s % 100;\n if(h >= 24){\n h -= 24;\n w++;\n }\n return h*60 + m + w * 60 * 24;\n\n}\n/*\nbool operator<(anime a1,anime a2){\n return a1.minutes < a2.minutes;\n}*/\n\nint main(){\n\n int n,f,we,st,count;\n string na;\n\n while(1){\n cin >> n;\n if(n == 0){\n break;\n }\n\n vector<int> table;\n vector<int> favoritetable;\n map<string,int> amap;\n\n for(int i=0; i<n; i++){\n cin >> na >> we >> st;\n int t;\n t = setup(we,st);\n table.push_back(t);\n amap[na] = t;\n }\n\n cin >> f;\n\n for(int i=0; i<f; i++){\n cin >> na;\n favoritetable.push_back(amap[na]);\n }\n\n sort(table.begin() , table.end());\n sort(favoritetable.begin(), favoritetable.end());\n\n // int first=0,last=1,beforelast;\n bool flag,cansee = true,changelast;\n count = 0;\n\n for(int i=1; i<favoritetable.size(); ++i){\n if(abs(favoritetable[i] - favoritetable[i-1]) < 30){\n cansee = false;\n }\n }\n\n for(int i=0; i<table.size(); i++){\n for(int j=0; j<favoritetable.size(); j++){\n if(abs(table[i] - favoritetable[j]) < 30){\n table.erase(table.begin() + i);\n i--;\n break;\n }\n }\n }\n\n int ans = table.size() + f;\n long int tmp = 0;\n\n for(int i=0; i<table.size(); i++){\n if(abs(table[i] - tmp) < 30){\n ans--;\n }\n else{\n tmp = table[i];\n }\n }\n\n if(!cansee){\n cout << -1 << endl;\n }\n else{\n cout << ans << endl;\n }\n\n /*\n\n while(last != n){\n\n while(1){\n if(abs(table[last].minutes - table[first].minutes) >= 30){\n break;\n }\n last++;\n if(last == n){\n last--;\n break;\n }\n }\n\n beforelast = last;\n\n flag = false;\n\n changelast = false;\n\n for(int i=first; i<last; i++){\n if(!flag && table[i].favorite){\n flag = true;\n if(i != first){\n last = i;\n changelast = true;\n }\n }\n else if(flag && table[i].favorite){\n cansee = false;\n break;\n }\n }\n\n if(!cansee){\n break;\n }\n\n if(!flag || (flag && !changelast) ){//???????????????????????£??????????????????????????´???????????????count++????????????\n count++;\n }\n\n first = last;\n last++;\n\n }\n\n if(abs(table[n-1].minutes - table[n-2].minutes) >= 30){\n count++;\n }\n\n\n\n if(!cansee){\n cout << -1 << endl;\n }\n else{\n cout << count << endl;\n }\n\n */\n\n }\n\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3092,
"score_of_the_acc": -0.0798,
"final_rank": 13
},
{
"submission_id": "aoj_1063_2104080",
"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<stack>\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<ll> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef vector<string> vs;\ntypedef vector<double> vd;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nint main(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tmap<string,int>ma;\n\t\tvi in(n);\n\t\trep(i,n){\n\t\t\tstring s;int a,b;\n\t\t\tcin>>s>>a>>b;\n\t\t\tin[i]=(a*24*60)+(b/100*60+b%100)-6*60;\n\t\t\tma[s]=i;\n\t\t}\n\t\tint m;\n\t\tcin>>m;\n\t\tint out=m;\n\t\tvi dp(7*24*60+100);\n\t\tbool h=true;\n\t\trep(i,m){\n\t\t\tstring s;\n\t\t\tcin>>s;\n\t\t\tint t=ma[s];\n\t\t\tloop(j,in[t],in[t]+30){\n\t\t\t\tif(dp[j])h=false;\n\t\t\t\tdp[j]=true;\n\t\t\t}\n\t\t}\n\t\tif(!h){\n\t\t\tcout<<-1<<endl;\n\t\t\tcontinue;\n\t\t}\n\t\tsort(all(in));\n\t\tint t=-1;\n\t\trep(i,n){\n\t\t\tif(dp[in[i]]||dp[in[i]+29])continue;\n\t\t\tif(in[i]<t)continue;\n\t\t\tt=in[i]+30;\n\t\t\tout++;\n\t\t}\n\t\tcout<<out<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 3252,
"score_of_the_acc": -0.0799,
"final_rank": 14
},
{
"submission_id": "aoj_1063_2054630",
"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\"\nstruct tv {\n\tstring name;\n\tint time;\n};\nint main() {\n\twhile (1) {\n\t\tint N; cin >> N; \n\t\tif (!N)break;\n\t\tvector<tv>tvs;\n\t\tvector<int>needs;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tstring name; int w, s; cin >> name >> w >> s;\n\t\t\tint time = w * 1440 + (s / 100) * 60 + s % 100;\n\t\t\ttvs.push_back(tv{ name,time });\n\t\t}\n\t\tsort(tvs.begin(), tvs.end(), [](const tv&l, const tv&r) {\n\t\t\treturn l.time < r.time;\n\t\t});\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\ttv atv{ tvs[i].name,tvs[i].time + 1440 * 7 };\n\t\t\ttvs.emplace_back(atv);\n\t\t}\n\t\tint P; cin >> P;\n\t\tfor (int i = 0; i < P; ++i) {\n\t\t\tstring target; cin >> target;\n\t\t\tauto it = find_if(tvs.begin(), tvs.end(), [=](const tv&t) {\n\t\t\t\treturn t.name == target;\n\t\t\t});\n\t\t\tneeds.push_back(it - tvs.begin());\n\t\t}\n\t\tsort(needs.begin(), needs.end());\n\t\tneeds.push_back((*needs.begin())+N);\n\t\tbool ok = true;\n\t\tint ans = P;\n\t\tfor (int i = 0; i < needs.size()-1; ++i) {\n\t\t\tint from = tvs[needs[i]].time + 30;\n\t\t\tint to = tvs[needs[i + 1]].time;\n\t\t\tif (to < from)ok = false;\n\t\t\telse {\n\t\t\t\tint sum = 0;\n\t\t\t\tfor (int p = needs[i] + 1; p < needs[i + 1]; ++p) {\n\t\t\t\t\tif (from <= tvs[p].time&&tvs[p].time + 30 <= to) {\n\t\t\t\t\t\tsum++;\n\t\t\t\t\t\tfrom = tvs[p].time + 30;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tans += sum;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif (!ok)cout << -1 << endl;\n\t\telse {\n\n\t\t\tcout << ans << endl;\n\t\t}\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3128,
"score_of_the_acc": -0.0696,
"final_rank": 11
},
{
"submission_id": "aoj_1063_1743619",
"code_snippet": "#include<stdio.h>\n#include<stdlib.h>\n#include<iostream>\n#include<math.h>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\n#include<string>\n#include<cmath>\n#include<set>\n#include<stack>\n\nusing namespace std;\ntypedef unsigned long long ll;\n\nmap<string, int>ma;\nvector<pair<int, string> >vec;\n\nstruct sortVec{\n bool operator()(string m1, string m2){\n return ma[m1]<ma[m2];\n }\n}sv;\n\nint main(){\n int n,p;\n while(cin>>n,n){\n ma.clear();\n vec.clear();\n string s;\n for(int i=0;i<n;i++){\n int day,time;\n cin>>s>>day>>time;\n if(time>=2400){\n day=(day+1);\n time-=2400;\n }\n time=(time/100)*60+time%100+day*24*60;\n ma[s]=time;\n vec.push_back(make_pair(time,s));\n }\n sort(vec.begin(),vec.end());\n cin>>p;\n vector<string>fav;\n for(int i=0;i<p;i++){\n cin>>s;\n fav.push_back(s);\n }\n sort(fav.begin(),fav.end(),sv);\n vector<string>res;\n res.push_back(fav[0]);\n bool nex=false;\n for(int i=1;i<fav.size();i++){\n if(ma[fav[i]]<ma[fav[i-1]]+30){\n cout<<-1<<endl;\n nex=true;\n break;\n }\n res.push_back(fav[i]);\n sort(res.begin(),res.end(),sv);\n }\n if(nex){\n continue;\n }\n for(int i=0;i<vec.size();i++){\n int start=vec[i].first;\n int resi=0;\n while(resi<res.size()&&ma[res[resi]]+30<=start){\n resi++;\n }\n if(resi==res.size()||start+30<=ma[res[resi]]){\n if(resi>0&&ma[res[resi-1]]+30>start){\n continue;\n }\n res.push_back(vec[i].second);\n sort(res.begin(),res.end(),sv);\n }\n }\n cout<<res.size()<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2740,
"memory_kb": 1324,
"score_of_the_acc": -1.0007,
"final_rank": 19
},
{
"submission_id": "aoj_1063_1743507",
"code_snippet": "#include<stdio.h>\n#include<stdlib.h>\n#include<iostream>\n#include<math.h>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\n#include<string>\n#include<cmath>\n#include<set>\n#include<stack>\n\nusing namespace std;\ntypedef unsigned long long ll;\n\nmap<string, int>ma;\nvector<pair<int, string> >vec;\n\nstruct sortVec{\n bool operator()(string m1, string m2){\n return ma[m1]<ma[m2];\n }\n}sv;\n\nint main(){\n int n,p;\n while(cin>>n,n){\n ma.clear();\n vec.clear();\n string s;\n for(int i=0;i<n;i++){\n int day,time;\n cin>>s>>day>>time;\n time=(time/100)*60+time%100+day*24*60;\n ma[s]=time;\n vec.push_back(make_pair(time,s));\n }\n sort(vec.begin(),vec.end());\n cin>>p;\n// set<string>fav;\n// for(int i=0;i<p;i++){\n// cin>>s;\n// fav.insert(s);\n// }\n// int p=-100000;\n// bool m=false;\n// int c=0;\n// for(int i=0;i<n;i++){\n// if(p+30>vec[i].first){\n// if(fav.count(vec[i].second)){\n// if(m){\n// c=-1;\n// break;\n// }else{\n// m=true;\n// p=vec[i].first;\n// }\n// }\n// }else{\n// c++;\n// p=vec[i].first;\n// m=fav.count(vec[i].second);\n// }\n// }\n// cout<<c<<endl;\n vector<string>fav;\n for(int i=0;i<p;i++){\n cin>>s;\n fav.push_back(s);\n }\n sort(fav.begin(),fav.end(),sv);\n vector<string>res;\n res.push_back(fav[0]);\n bool nex=false;\n for(int i=1;i<fav.size();i++){\n if(ma[fav[i]]<ma[fav[i-1]]+30){\n cout<<-1<<endl;\n nex=true;\n break;\n }\n res.push_back(fav[i]);\n sort(res.begin(),res.end(),sv);\n }\n if(nex){\n continue;\n }\n for(int i=0;i<vec.size();i++){\n int start=vec[i].first;\n int resi=0;\n while(resi<res.size()&&ma[res[resi]]+30<=start){\n resi++;\n }\n if(resi==res.size()||start+30<=ma[res[resi]]){\n if(resi>0&&ma[res[resi-1]]+30>start){\n continue;\n }\n res.push_back(vec[i].second);\n sort(res.begin(),res.end(),sv);\n }\n }\n cout<<res.size()<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2730,
"memory_kb": 1324,
"score_of_the_acc": -0.997,
"final_rank": 18
},
{
"submission_id": "aoj_1063_1743428",
"code_snippet": "#include<stdio.h>\n#include<stdlib.h>\n#include<iostream>\n#include<math.h>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\n#include<string>\n#include<cmath>\n#include<set>\n#include<stack>\n\nusing namespace std;\ntypedef unsigned long long ll;\n\nmap<string, int>ma;\nvector<pair<int, string> >vec;\n\nstruct sortVec{\n bool operator()(string m1, string m2){\n return ma[m1]<ma[m2];\n }\n}sv;\n\nint main(){\n int n,p;\n while(cin>>n,n){\n ma.clear();\n vec.clear();\n string s;\n for(int i=0;i<n;i++){\n int day,time;\n cin>>s>>day>>time;\n time=(time/100)*60+time%100+day*24*60;\n ma[s]=time;\n vec.push_back(make_pair(time,s));\n }\n sort(vec.begin(),vec.end());\n cin>>p;\n set<string>fav;\n for(int i=0;i<p;i++){\n cin>>s;\n fav.insert(s);\n }\n int p=-100000;\n bool m=false;\n int c=0;\n for(int i=0;i<n;i++){\n if(p+30>vec[i].first){\n if(fav.count(vec[i].second)){\n if(m){\n c=-1;\n break;\n }else{\n m=true;\n p=vec[i].first;\n }\n }\n }else{\n c++;\n p=vec[i].first;\n m=fav.count(vec[i].second);\n }\n }\n cout<<c<<endl;\n// vector<string>fav;\n// for(int i=0;i<p;i++){\n// cin>>s;\n// fav.push_back(s);\n// }\n// sort(fav.begin(),fav.end(),sv);\n// vector<string>res;\n// res.push_back(fav[0]);\n// bool nex=false;\n// for(int i=1;i<fav.size();i++){\n// if(ma[fav[i]]%10080<(ma[fav[i-1]]+30)%10080){\n// cout<<-1<<endl;\n// nex=true;\n// break;\n// }\n// res.push_back(fav[i]);\n// }\n// if(nex){\n// continue;\n// }\n// for(int i=0;i<vec.size();i++){\n// int start=vec[i].first;\n// int resi=0;\n// while(resi<res.size()&&(ma[res[resi]]+30)%10080<=start%10080){\n// resi++;\n// }\n// if(resi==res.size()||(start+30)%10080<=ma[res[resi]]){\n// if(resi>0&&ma[res[resi-1]]+30>start){\n// continue;\n// }\n// res.push_back(vec[i].second);\n// sort(res.begin(),res.end(),sv);\n// }\n// }\n// cout<<res.size()<<endl;\n ne:;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 1304,
"score_of_the_acc": -0.048,
"final_rank": 3
},
{
"submission_id": "aoj_1063_1743389",
"code_snippet": "#include<stdio.h>\n#include<stdlib.h>\n#include<iostream>\n#include<math.h>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\n#include<string>\n#include<cmath>\n#include<set>\n#include<stack>\n\nusing namespace std;\ntypedef unsigned long long ll;\n\nmap<string, int>ma;\nvector<pair<int, string> >vec;\n\nstruct sortVec{\n bool operator()(string m1, string m2){\n return ma[m1]<ma[m2];\n }\n}sv;\n\nint main(){\n int n,p;\n while(cin>>n,n){\n ma.clear();\n vec.clear();\n string s;\n for(int i=0;i<n;i++){\n int day,time;\n cin>>s>>day>>time;\n// if(time>=2400){\n// day=(day+1)%7;\n// time-=2400;\n// }\n time=(time/100)*60+time%100+day*24*60;\n ma[s]=time;\n vec.push_back(make_pair(time,s));\n }\n sort(vec.begin(),vec.end());\n cin>>p;\n set<string>fav;\n for(int i=0;i<p;i++){\n cin>>s;\n fav.insert(s);\n }\n int p=-100000;\n bool m=false;\n int c=0;\n for(int i=0;i<n;i++){\n if(p+30>vec[i].first){\n if(fav.count(vec[i].second)){\n if(m){\n c=-1;\n break;\n }else{\n m=true;\n p=vec[i].first;\n }\n }\n }else{\n c++;\n p=vec[i].first;\n m=fav.count(vec[i].second);\n }\n }\n cout<<c<<endl;\n ne:;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 1304,
"score_of_the_acc": -0.0517,
"final_rank": 5
},
{
"submission_id": "aoj_1063_1501883",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <set>\n#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\nint n,p;\nstruct data{\n\tstring name;\n\tint h,m;\n\tdata(){}\n\tdata(string s,int hh,int mm){\n\t\tname=s;\n\t\th=hh;\n\t\tm=mm;\n\t}\n};\n\nbool comp(const data& d1,const data& d2){\n\tif(d1.h==d2.h)return d1.m<d2.m;\n\treturn d1.h<d2.h;\n}\n\ndata d[7][501];\nint dcnt[7];\nset<string> fav;\nbool used[7][30][61];\n\nbool check(){\n\tfor(int i=0;i<7;i++){\n\t\tfor(int j=0;j<dcnt[i];j++){\n\t\t\tif(fav.find(d[i][j].name)!=fav.end()){\n\t\t\t\tint k=0,nh=d[i][j].h,nm=d[i][j].m;\n\t\t\t\twhile(k<30){\n\t\t\t\t\tif(used[i][nh][nm])return false;\n\t\t\t\t\tused[i][nh][nm]=true;\n\t\t\t\t\tk++;\n\t\t\t\t\tnm++;\n\t\t\t\t\tif(nm==60){\n\t\t\t\t\t\tnm=0;\n\t\t\t\t\t\tnh++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\nint main(void){\n\twhile(1){\n\t\tscanf(\"%d\",&n);\n\t\tif(n==0)break;\n\t\tmemset(dcnt,0,sizeof(dcnt));\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint w,s;\n\t\t\tstring str;\n\t\t\tcin >> str >> w >> s;\n\t\t\td[w][dcnt[w]]=data(str,s/100,s%100);\n\t\t\tdcnt[w]++;\n\t\t}\n\t\tfav.clear();\n\t\tscanf(\"%d\",&p);\n\t\tfor(int i=0;i<p;i++){\n\t\t\tstring str;\n\t\t\tcin >> str;\n\t\t\tfav.insert(str);\n\t\t}\n\t\tmemset(used,false,sizeof(used));\n\t\tif(!check()){\n\t\t\tprintf(\"-1\\n\");\n\t\t\tcontinue;\n\t\t}\n\t\tint cnt=0;\n\t\tfor(int i=0;i<7;i++){\n\t\t\tsort(d[i],d[i]+dcnt[i],comp);\n\t\t\tfor(int j=0;j<dcnt[i];j++){\n\t\t\t\tif(fav.find(d[i][j].name)!=fav.end())continue;\n\t\t\t\tint k=0,nh=d[i][j].h,nm=d[i][j].m;\n\t\t\t\twhile(k<30){\n\t\t\t\t\tif(used[i][nh][nm])break;\n\t\t\t\t\tk++;\n\t\t\t\t\tnm++;\n\t\t\t\t\tif(nm==60){\n\t\t\t\t\t\tnm=0;\n\t\t\t\t\t\tnh++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(k==30){\n\t\t\t\t\tk=0,nh=d[i][j].h,nm=d[i][j].m;\n\t\t\t\t\tcnt++;\n\t\t\t\t\twhile(k<30){\n\t\t\t\t\t\tif(used[i][nh][nm])return false;\n\t\t\t\t\t\tused[i][nh][nm]=true;\n\t\t\t\t\t\tk++;\n\t\t\t\t\t\tnm++;\n\t\t\t\t\t\tif(nm==60){\n\t\t\t\t\t\t\tnm=0;\n\t\t\t\t\t\t\tnh++;\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\tprintf(\"%d\\n\",cnt+p);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 1408,
"score_of_the_acc": -0.0431,
"final_rank": 1
},
{
"submission_id": "aoj_1063_1500774",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <map>\n#include <string>\n#include <vector>\n#include <algorithm>\n#define MAX_T 1440\nusing namespace std;\n \ntypedef pair<int, string> pis;\n \nint main()\n{\n while(1){\n int N;\n cin >> N;\n if(N == 0){\n break;\n }else{\n multimap<int, string> m;\n multimap<int, string>::iterator ite;\n vector<string> f;\n int P, ans = 0;\n bool flag = false;\n for(int i = 0; i < N; i++){\n string n, s;\n int w, x;\n cin >> n >> w >> s;\n if(s.size() == 3)\n x = (s[0] - '0') * 60 + (s[1] - '0') * 10 + (s[2] - '0');\n else\n x = ((s[0] - '0') * 10 + (s[1] - '0')) * 60 + (s[2] - '0') * 10 + (s[3] - '0');\n m.insert(pis(w * MAX_T + x, n));\n }\n cin >> P;\n for(int i = 0; i < P; i++){\n string s;\n cin >> s;\n f.push_back(s);\n }\n sort(f.begin(), f.end());\n int n = f.size();\n for(int i = 0; i < n; i++){\n if(f.empty() || flag)\n break;\n for(ite = m.begin(); ite != m.end(); ++ite){\n if(ite->second == f[i]){\n int x = ite->first;\n multimap<int, string>::iterator start;\n multimap<int, string>::iterator end;\n start = m.upper_bound(x - 30);\n end = m.lower_bound(x + 30);\n //if(start == m.end())\n //start = ite;\n m.erase(start, end);\n f.erase(f.begin());\n ans++;\n i = -1;\n break;\n }\n ite++;\n if(ite == m.end())\n flag = true;\n ite--;\n }\n }\n if(flag){\n cout << \"-1\" << endl;\n }else{ \n while(!m.empty()){\n multimap<int, string>::iterator start;\n multimap<int, string>::iterator end;\n start = m.begin();\n end = m.lower_bound(start->first + 30);\n m.erase(start, end);\n ans++;\n }\n cout << ans << endl;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 1296,
"score_of_the_acc": -0.0478,
"final_rank": 2
}
] |
aoj_1065_cpp
|
Problem D: The House of Huge Family
Mr. Dango's family has an extremely huge number of members.
Once it had about 100 members, and now it has as many as population of a city.
It is jokingly guessed that the member might fill this planet in the near future.
Mr. Dango's family, the huge family, is getting their new house.
Scale of the house is as large as that of town.
They all had warm and gracious personality and were close each other.
However, in this year the two members of them became to hate each other.
Since the two members had enormous influence in the family, they were split into two groups.
They hope that the two groups don't meet each other in the new house.
Though they are in the same building, they can avoid to meet each other by adjusting passageways.
Now, you have a figure of room layout. Your task is written below.
You have to decide the two groups each room should belong to.
Besides you must make it impossible that they move from any rooms belonging to one group to any rooms belonging to the other group.
All of the rooms need to belong to exactly one group.
And any group has at least one room.
To do the task, you can cancel building passageway.
Because the house is under construction, to cancel causes some cost.
You'll be given the number of rooms and information of passageway.
You have to do the task by the lowest cost.
Please answer the lowest cost.
By characteristics of Mr. Dango's family, they move very slowly.
So all passageways are escalators.
Because of it, the passageways are one-way.
Input
The input consists of multiple datasets.
Each dataset is given in the following format.
n
m
X
1
Y
1
C
1
...
X
m
Y
m
C
m
All numbers in each datasets are integers.
The integers in each line are separated by a space.
The first line of each datasets contains two integers.
n
is the number of rooms in the house, m is the number of passageways in the house.
Each room is indexed from 0 to
n
-1.
Each of following
m
lines gives the details of the passageways in the house.
Each line contains three integers.
The first integer
X
i
is an index of the room, the starting point of the passageway.
The second integer
Y
i
is an index of the room, the end point of the passageway.
The third integer
C
i
is the cost to cancel construction of the passageway.
The passageways, they are escalators, are one-way.
The last dataset is followed by a line containing two zeros (separated by a space).
Constraints
2 ≤
n
≤ 100
-10,000 ≤
C
i
≤ 10,000
Y
1
...
Y
m
can't be duplicated integer by each other.
Output
For each dataset, print the lowest cost in a line. You may assume that the all of integers of both the answers and the input can be represented by 32 bits signed integers.
Sample input
3 2
0 1 2
1 2 1
2 1
0 1 100
2 1
0 1 0
2 1
0 1 -1
0 0
Sample output
1
100
0
-1
|
[
{
"submission_id": "aoj_1065_10915073",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <numeric>\n#include <limits>\nusing namespace std;\n\nlong long stoer_wagner(vector<vector<long long>>& W) {\n int n = (int)W.size();\n vector<int> v(n);\n iota(v.begin(), v.end(), 0);\n long long best = numeric_limits<long long>::max();\n while (n > 1) {\n vector<long long> w(n, 0);\n vector<char> added(n, 0);\n int prev = -1, sel = -1;\n for (int it = 0; it < n; ++it) {\n sel = -1;\n for (int i = 0; i < n; ++i)\n if (!added[i] && (sel == -1 || w[i] > w[sel])) sel = i;\n if (added[sel]) break;\n added[sel] = 1;\n if (it == n - 1) {\n best = min(best, w[sel]);\n int a = sel, b = prev;\n if (b == -1) return best;\n for (int i = 0; i < n; ++i) if (i != a && i != b) {\n W[v[b]][v[i]] += W[v[a]][v[i]];\n W[v[i]][v[b]] = W[v[b]][v[i]];\n }\n v[sel] = v[n - 1];\n --n;\n break;\n }\n prev = sel;\n for (int i = 0; i < n; ++i) if (!added[i]) w[i] += W[v[sel]][v[i]];\n }\n }\n if (best == numeric_limits<long long>::max()) best = 0;\n return best;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n, m;\n while (cin >> n >> m) {\n if (n == 0 && m == 0) break;\n vector<vector<long long>> W(n, vector<long long>(n, 0));\n long long base = 0;\n for (int i = 0; i < m; ++i) {\n int x, y, c;\n cin >> x >> y >> c;\n if (c < 0) base += c;\n else if (x != y) {\n W[x][y] += c;\n W[y][x] += c;\n }\n }\n long long res = base + stoer_wagner(W);\n cout << res << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3480,
"score_of_the_acc": -0.3509,
"final_rank": 11
},
{
"submission_id": "aoj_1065_10852710",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <list>\n#include <algorithm>\n\nusing namespace std;\n\n#define typec long long\n#define V 111\ntypec g[V][V], w[V];\ntypec a[V], v[V], na[V];\n\ntypec Stoer_Wagner(int n)\n{\n typec i, j, pv, zj,I=1;\n typec best = I<<32;\n for (i = 0; i < n; i++) v[i] = i; // vertex: 0 ~ n-1\n while (n > 1)\n {\n for (a[v[0]] = 1, i = 1; i < n; i++)\n {\n a[v[i]] = 0;\n na[i - 1] = i;\n w[i] = g[v[0]][v[i]];\n\n }\n for (pv = v[0], i = 1; i < n; i++ )\n {\n for (zj = -1, j = 1; j < n; j++ )\n if (!a[v[j]] && (zj < 0 || w[j] > w[zj]))\n\n zj = j;\n a[v[zj]] = 1;\n if (i == n - 1)\n {\n if (best > w[zj]) best = w[zj];\n for (i = 0; i < n; i++)\n g[v[i]][pv] = g[pv][v[i]] += g[v[zj]][v[i]];\n v[zj] = v[--n];\n break;\n }\n pv = v[zj];\n for (j = 1; j < n; j++)\n if(!a[v[j]])\n w[j] += g[v[zj]][v[j]];\n }\n }\n return best;\n}\nbool vis[111];\nvoid dfs(int u,int n)\n{\n for(int v=0;v<n;++v)\n if(g[u][v]!=0&&vis[v]==0)\n {\n vis[v]=1;\n dfs(v,n);\n }\n}\nbool ok(int n)\n{\n for(int i=0;i<n;++i)\n if(vis[i]==0)return 1;\n return 0;\n}\nint main()\n{\n //freopen(\"G:\\\\in.txt\",\"r\",stdin);\n int n, m, u, v, w;\n while(scanf(\"%d%d\", &n, &m),n+m)\n {\n memset(g, 0, sizeof(g));\n typec ans=0;\n while(m --)\n {\n scanf(\"%d%d%d\", &u, &v, &w);\n if(w<=0)ans+=w;\n else g[v][u]= g[u][v] = w;\n\n }\n // memset(vis,0,sizeof(vis));\n //dfs(0,n);\n //if(ok(n))puts(\"0\");\n printf(\"%lld\\n\", ans+Stoer_Wagner(n));\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3584,
"score_of_the_acc": -0.2303,
"final_rank": 9
},
{
"submission_id": "aoj_1065_2644975",
"code_snippet": "#include<bits/stdc++.h>\n#define N 105\nusing namespace std;\n\nstruct edge{\n int to, num;\n};\n\nint n, m;\nvector<edge> G[N];\nint A, B, minuscost;\n\nint used[N], cost[N];\n\nint dfs(int x){\n \n if(used[x]) return 0;\n used[x]=1;\n \n int res=0;\n \n for(int i=0;i<G[x].size();i++){\n if(A==G[x][i].num) continue;\n if(B==G[x][i].num) continue;\n res+=dfs(G[x][i].to);\n }\n \n return res+1;\n}\n\nvoid solve(){\n \n memset(used,0,sizeof(used));\n \n A=-1, B=-1;\n \n int nodesum=dfs(0);\n \n if(nodesum!=n){\n cout<<minuscost<<endl;\n return ;\n }\n \n int ans=(1e9);\n \n for(int i=0;i<m;i++){\n A=i;\n for(int j=i+1;j<m;j++){\n B=j;\n memset(used,0,sizeof(used));\n int r=dfs(0);\n if(r!=n) ans=min(ans, cost[A]+cost[B]+minuscost);\n }\n B=-1;\n memset(used,0,sizeof(used));\n int r=dfs(0);\n if(r!=n) ans=min(ans, cost[A]+minuscost);\n }\n \n cout<<ans<<endl;\n}\n\nint main(){\n\n while(1){\n \n cin>>n>>m;\n if(!n&&!m) break;\n \n minuscost=0;\n \n int cnt=0;\n \n for(int i=0;i<m;i++){\n int x, y, c;\n cin>>x>>y>>c;\n if(c<=0){\n\tminuscost+=c;\n\tcontinue;\n }\n cost[cnt]=c;\n G[x].push_back((edge){y,cnt});\n G[y].push_back((edge){x,cnt++});\n }\n\n m=cnt;\n \n solve();\n\n for(int i=0;i<n;i++) G[i].clear();\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3144,
"score_of_the_acc": -0.0868,
"final_rank": 5
},
{
"submission_id": "aoj_1065_2618997",
"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\n#define NUM 100\n\nstruct Info{\n\tInfo(int arg_from,int arg_to,int arg_cost){\n\t\tfrom = arg_from;\n\t\tto = arg_to;\n\t\tcost = arg_cost;\n\t}\n\tint from,to,cost;\n};\n\nint N,M;\n\nint boss[100],height[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\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\nvoid init(){\n\tfor(int i = 0; i < N; i++){\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t}\n}\n\nvector<Info> V;\n\nvoid func(){\n\n\tinit();\n\tV.clear();\n\n\tint from,to,cost;\n\tint ans = 0;\n\n\tfor(int i = 0; i < M; i++){\n\t\tscanf(\"%d %d %d\",&from,&to,&cost);\n\t\tif(cost < 0){\n\t\t\tans += cost;\n\t\t}else{\n\t\t\tunite(from,to);\n\t\t\tV.push_back(Info(from,to,cost));\n\t\t}\n\t}\n\n\tint group_num = 0;\n\tfor(int i = 0; i < N; i++){\n\t\tif(get_boss(i) == i)group_num++;\n\t}\n\tif(group_num >= 2){\n\t\tprintf(\"%d\\n\",ans);\n\t\treturn;\n\t}\n\n\tint ans_1 = BIG_NUM;\n\tfor(int i = 0; i < V.size(); i++){\n\t\tinit();\n\t\tfor(int k = 0; k < V.size(); k++){\n\t\t\tif(i == k)continue;\n\t\t\tunite(V[k].from,V[k].to);\n\t\t}\n\t\tgroup_num = 0;\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tif(get_boss(k) == k)group_num++;\n\t\t}\n\t\tif(group_num >= 2){\n\t\t\tans_1 = min(ans_1,ans+V[i].cost);\n\t\t}\n\t}\n\n\tint ans_2 = BIG_NUM;\n\n\tfor(int i = 0; i < V.size()-1; i++){\n\t\tfor(int k = i+1; k < V.size(); k++){\n\t\t\tinit();\n\t\t\tfor(int p = 0; p < V.size(); p++){\n\t\t\t\tif(p == i || p == k)continue;\n\t\t\t\tunite(V[p].from,V[p].to);\n\t\t\t}\n\t\t\tgroup_num = 0;\n\t\t\tfor(int p = 0; p < N; p++){\n\t\t\t\tif(get_boss(p) == p)group_num++;\n\t\t\t}\n\t\t\tif(group_num >= 2){\n\t\t\t\tans_2 = min(ans_2,ans+V[i].cost+V[k].cost);\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d\\n\",min(ans_1,ans_2));\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&N,&M);\n\t\tif(N == 0 && M == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3144,
"score_of_the_acc": -0.2118,
"final_rank": 8
},
{
"submission_id": "aoj_1065_2173637",
"code_snippet": "#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 <iostream>\nusing namespace std;\nint n, m, x[109], y[109]; long long c[109]; bool used[109];\nbool solve() {\n\tunionfind uf(n);\n\tfor (int i = 0; i < m; i++) {\n\t\tif (used[i]) uf.unite(x[i], y[i]);\n\t}\n\tint s = uf.root(0);\n\tfor (int i = 1; i < n; i++) {\n\t\tif (s != uf.root(i)) return true;\n\t}\n\treturn false;\n}\nint main() {\n\twhile (cin >> n >> m, n) {\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> x[i] >> y[i] >> c[i];\n\t\t\tif (c[i] > 0) used[i] = true;\n\t\t\telse used[i] = false, sum += c[i];\n\t\t}\n\t\tlong long ret = 1LL << 60;\n\t\tif (solve()) ret = sum;\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tif (!used[i]) continue;\n\t\t\tused[i] = false;\n\t\t\tif (solve()) ret = min(ret, sum + c[i]);\n\t\t\tused[i] = true;\n\t\t}\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tif (!used[i]) continue;\n\t\t\tused[i] = false;\n\t\t\tfor (int j = i + 1; j < m; j++) {\n\t\t\t\tif (!used[j]) continue;\n\t\t\t\tused[j] = false;\n\t\t\t\tif (solve()) ret = min(ret, sum + c[i] + c[j]);\n\t\t\t\tused[j] = true;\n\t\t\t}\n\t\t\tused[i] = true;\n\t\t}\n\t\tcout << ret << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 2932,
"score_of_the_acc": -0.4529,
"final_rank": 15
},
{
"submission_id": "aoj_1065_1436132",
"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=1<<24;\n//max flow (dinic)\ntemplate<class V> class MaxFlow_dinic{\npublic:\n struct edge{int to,reve;V cap;};\n static const int MV = 1100;\n vector<edge> E[MV];\n int itr[MV],lev[MV];\n\n void add_edge(int x,int y,V cap,bool undir=false){\n E[x].push_back((edge){y,(int)E[y].size(),cap});\n E[y].push_back((edge){x,(int)E[x].size()-1,undir?cap:0});\n }\n\n void bfs(int cur){\n memset(lev,0xff,sizeof(lev));\n queue<int> q;\n lev[cur]=0;\n q.push(cur);\n while(q.size()){\n int v=q.front();\n q.pop();\n for(__typeof(E[v].begin()) e=E[v].begin();e!=E[v].end();e++) if(e->cap>0&&lev[e->to]<0) lev[e->to]=lev[v]+1,q.push(e->to);\n }\n }\n\n V dfs(int from,int to,V cf){\n if(from==to){\n return cf;\n }\n for(;itr[from]<E[from].size();itr[from]++){\n edge* e=&E[from][itr[from]];\n if(e->cap>0&&lev[from]<lev[e->to]){\n V f=dfs(e->to,to,min(cf,e->cap));\n if(f>0){\n e->cap-=f;\n E[e->to][e->reve].cap += f;\n return f;\n }\n }\n }\n return 0;\n }\n\n V maxflow(int from,int to){\n V fl=0,tf;\n while(1){\n bfs(from);\n if(lev[to]<0) return fl;\n memset(itr,0,sizeof(itr));\n while((tf=dfs(from,to,numeric_limits<V>::max()))>0) fl+=tf;\n }\n }\n};\nvoid mainmain(){\n\tint n,m;\n\twhile(cin>>n>>m,n||m){\n\t\tll ans=INT_MAX;\n\t\tvint a(m),b(m),c(m);\n\t\trep(i,m) cin>>a[i]>>b[i]>>c[i];\n\t\treep(i,1,n){\n\t\t\tMaxFlow_dinic<ll> mf;\n\t\t\tint tmp=0;\n\t\t\trep(j,m){\n\t\t\t\tif(c[j]<0) tmp+=c[j];\n\t\t\t\telse mf.add_edge(a[j],b[j],(ll)c[j],true);\n\t\t\t}\n\t\t\tans=min(ans,tmp+mf.maxflow(0,i));\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": 20,
"memory_kb": 1268,
"score_of_the_acc": -0.1331,
"final_rank": 7
},
{
"submission_id": "aoj_1065_1149692",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nstruct UnionFind{\n\tvi data;\n\tUnionFind(int n):data(n,-1){}\n\tint Find(int i){\n\t\treturn data[i]<0?i:(data[i]=Find(data[i]));\n\t}\n\tbool Unite(int a,int b){\n\t\ta=Find(a),b=Find(b);\n\t\tif(a==b) return false;\n\t\tif(-data[a]<-data[b]) swap(a,b);\n\t\tdata[a]+=data[b];\n\t\tdata[b]=a;\n\t\treturn true;\n\t}\n\tint Size(int i){\n\t\treturn -data[Find(i)];\n\t}\n};\n\nstruct Edge{\n\tint src,dst,weight;\n\tEdge(){}\n\tEdge(int s,int d,int w):src(s),dst(d),weight(w){}\n};\ntypedef vector<vector<Edge>> Graph;\n\nint main()\n{\n\tfor(int n,m;cin>>n>>m && n|m;){\n\t\tvector<Edge> es;\n\t\tint neg=0;\n\t\trep(i,m){\n\t\t\tint u,v,w; cin>>u>>v>>w;\n\t\t\tif(w<=0) neg+=w;\n\t\t\telse es.emplace_back(u,v,w);\n\t\t}\n\t\tm=es.size();\n\t\t\n\t\tint res=INF;\n\t\t{\n\t\t\tUnionFind uf(n);\n\t\t\tint cc=n;\n\t\t\trep(i,m)\n\t\t\t\tcc-=uf.Unite(es[i].src,es[i].dst);\n\t\t\tif(cc>=2) res=0;\n\t\t}\n\t\t{\n\t\t\trep(i,m){\n\t\t\t\tvi use(m,1); use[i]=0;\n\t\t\t\tUnionFind uf(n);\n\t\t\t\tint cc=n;\n\t\t\t\trep(j,m) if(use[j])\n\t\t\t\t\tcc-=uf.Unite(es[j].src,es[j].dst);\n\t\t\t\tif(cc>=2) res=min(res,es[i].weight);\n\t\t\t}\n\t\t}\n\t\t{\n\t\t\trep(i,m) repi(j,i+1,m){\n\t\t\t\tvi use(m,1); use[i]=use[j]=0;\n\t\t\t\tUnionFind uf(n);\n\t\t\t\tint cc=n;\n\t\t\t\trep(k,m) if(use[k])\n\t\t\t\t\tcc-=uf.Unite(es[k].src,es[k].dst);\n\t\t\t\tif(cc>=2) res=min(res,es[i].weight+es[j].weight);\n\t\t\t}\n\t\t}\n\t\tcout<<neg+res<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1200,
"score_of_the_acc": -0.6302,
"final_rank": 17
},
{
"submission_id": "aoj_1065_1120330",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 100000000\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cstdio>\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\nconst int tx[] = {0,1,0,-1};\nconst int ty[] = {-1,0,1,0};\n\nstruct Node {\n int to;\n int idx;\n int flow;\n Node(int to,int idx,int flow) :\n to(to),idx(idx),flow(flow) {}\n};\n\nclass FordFulkerson {\nprivate:\n vector<Node>* _graph;\n bool* _used;\n int _size;\n\n int dfs(int src,int flow,int sink){\n if(src == sink) return flow;\n\n _used[src] = true;\n for(int i= 0;i < _graph[src].size();i++){\n Node& e = _graph[src][i];\n if(_used[e.to]) continue;\n if(e.flow <= 0) continue;\n int d = dfs(e.to,min(flow,e.flow),sink);\n if(d <= 0) continue;\n\n Node& rev_e = _graph[e.to][e.idx];\n e.flow -= d;\n rev_e.flow += d;\n return d;\n }\n return 0;\n }\n\npublic: \n FordFulkerson(int n) {\n _size = n;\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n }\n\n ~FordFulkerson(){\n delete[] _graph;\n delete[] _used;\n }\n\n FordFulkerson(const FordFulkerson& f){\n _size = f.size();\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n fill((bool*)_used,(bool*)_used + _size,false);\n\n for(int i = 0; i < f.size(); i++){\n for(int j = 0; j < f.graph()[i].size(); j++){\n _graph[i].push_back(f.graph()[i][j]);\n }\n }\n }\n\n void add_edge(int from,int to,int flow) {\n _graph[from].push_back(Node(to,_graph[to].size(),flow));\n _graph[to].push_back(Node(from,_graph[from].size()-1,flow));\n }\n\n int compute_maxflow(int src,int sink){\n int res = 0;\n\n while(true){\n fill((bool*)_used,(bool*)_used + _size,false);\n int tmp = dfs(src,numeric_limits<int>::max(),sink);\n if(tmp == 0) break;\n res += tmp;\n }\n return res;\n }\n\n int size() const{\n return _size;\n }\n vector<Node>* graph() const{\n return _graph;\n }\n};\n\nint main(){\n int num_of_houses;\n int num_of_paths;\n while(~scanf(\"%d %d\",&num_of_houses,&num_of_paths)){\n if(num_of_houses == 0 && num_of_paths == 0) break;\n\n FordFulkerson ff(num_of_houses);\n int bonus = 0;\n\n for(int path_i = 0; path_i < num_of_paths; path_i++){\n int from,to;\n int cost;\n scanf(\"%d %d %d\",&from,&to,&cost);\n if(cost < 0) bonus += cost; \n ff.add_edge(from,to,max(0,cost));\n }\n\n int res = numeric_limits<int>::max();\n\n for(int house_i = 1; house_i< num_of_houses; house_i++){\n FordFulkerson tmp(ff);\n res = min(res,tmp.compute_maxflow(0,house_i));\n }\n printf(\"%d\\n\",bonus + res);\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1208,
"score_of_the_acc": -0.2555,
"final_rank": 10
},
{
"submission_id": "aoj_1065_1120309",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 100000000\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cstdio>\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\nconst int tx[] = {0,1,0,-1};\nconst int ty[] = {-1,0,1,0};\n\nstruct Node {\n int to;\n int idx;\n int flow;\n Node(int to,int idx,int flow) :\n to(to),idx(idx),flow(flow) {}\n};\n\nclass FordFulkerson {\nprivate:\n vector<Node>* _graph;\n bool* _used;\n int _size;\n\n int dfs(int src,int flow,int sink){\n if(src == sink) return flow;\n\n _used[src] = true;\n for(int i= 0;i < _graph[src].size();i++){\n Node& e = _graph[src][i];\n if(_used[e.to]) continue;\n if(e.flow <= 0) continue;\n int d = dfs(e.to,min(flow,e.flow),sink);\n if(d <= 0) continue;\n\n Node& rev_e = _graph[e.to][e.idx];\n e.flow -= d;\n rev_e.flow += d;\n return d;\n }\n return 0;\n }\n\npublic: \n FordFulkerson(int n) {\n _size = n;\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n }\n FordFulkerson(const FordFulkerson& f){\n _size = f.size();\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n fill((bool*)_used,(bool*)_used + _size,false);\n\n for(int i = 0; i < f.size(); i++){\n for(int j = 0; j < f.graph()[i].size(); j++){\n _graph[i].push_back(f.graph()[i][j]);\n }\n }\n }\n\n void add_edge(int from,int to,int flow) {\n _graph[from].push_back(Node(to,_graph[to].size(),flow));\n _graph[to].push_back(Node(from,_graph[from].size()-1,flow));\n }\n\n int compute_maxflow(int src,int sink){\n int res = 0;\n\n while(true){\n fill((bool*)_used,(bool*)_used + _size,false);\n int tmp = dfs(src,numeric_limits<int>::max(),sink);\n if(tmp == 0) break;\n res += tmp;\n }\n return res;\n }\n\n int size() const{\n return _size;\n }\n vector<Node>* graph() const{\n return _graph;\n }\n};\n\nint main(){\n int num_of_houses;\n int num_of_paths;\n while(~scanf(\"%d %d\",&num_of_houses,&num_of_paths)){\n if(num_of_houses == 0 && num_of_paths == 0) break;\n\n FordFulkerson ff(num_of_houses);\n int bonus = 0;\n\n for(int path_i = 0; path_i < num_of_paths; path_i++){\n int from,to;\n int cost;\n scanf(\"%d %d %d\",&from,&to,&cost);\n if(cost < 0) bonus += cost; \n ff.add_edge(from,to,max(0,cost));\n }\n\n int res = numeric_limits<int>::max();\n\n for(int house_i = 1; house_i< num_of_houses; house_i++){\n FordFulkerson tmp(ff);\n res = min(res,tmp.compute_maxflow(0,house_i));\n }\n printf(\"%d\\n\",bonus + res);\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 24904,
"score_of_the_acc": -1.25,
"final_rank": 20
},
{
"submission_id": "aoj_1065_1120308",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 100000000\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cstdio>\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\nconst int tx[] = {0,1,0,-1};\nconst int ty[] = {-1,0,1,0};\n\nstruct Node {\n int to;\n int idx;\n int flow;\n Node(int to,int idx,int flow) :\n to(to),idx(idx),flow(flow) {}\n};\n\nclass FordFulkerson {\nprivate:\n vector<Node>* _graph;\n bool* _used;\n int _size;\n\n int dfs(int src,int flow,int sink){\n if(src == sink) return flow;\n\n _used[src] = true;\n for(int i= 0;i < _graph[src].size();i++){\n Node& e = _graph[src][i];\n if(_used[e.to]) continue;\n if(e.flow <= 0) continue;\n int d = dfs(e.to,min(flow,e.flow),sink);\n if(d <= 0) continue;\n\n Node& rev_e = _graph[e.to][e.idx];\n e.flow -= d;\n rev_e.flow += d;\n return d;\n }\n return 0;\n }\n\npublic: \n FordFulkerson(int n) {\n _size = n;\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n }\n FordFulkerson(const FordFulkerson& f){\n _size = f.size();\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n fill((bool*)_used,(bool*)_used + _size,false);\n\n for(int i = 0; i < f.size(); i++){\n for(int j = 0; j < f.graph()[i].size(); j++){\n _graph[i].push_back(f.graph()[i][j]);\n }\n }\n }\n\n void add_edge(int from,int to,int flow) {\n _graph[from].push_back(Node(to,_graph[to].size(),flow));\n _graph[to].push_back(Node(from,_graph[from].size()-1,flow));\n }\n\n int compute_maxflow(int src,int sink){\n int res = 0;\n\n while(true){\n fill((bool*)_used,(bool*)_used + _size,false);\n int tmp = dfs(src,numeric_limits<int>::max(),sink);\n if(tmp == 0) break;\n res += tmp;\n }\n return res;\n }\n\n int size() const{\n return _size;\n }\n vector<Node>* graph() const{\n return _graph;\n }\n};\n\nclass UnionFindTree {\nprivate:\n int* par;\n int* rank;\npublic:\n UnionFindTree(int n){\n par = new int[n]();\n rank = new int[n]();\n for(int i=0;i<n;i++){\n par[i] = i;\n rank[i] = 0;\n }\n }\n\n ~UnionFindTree(){\n delete[] rank;\n delete[] par;\n }\n\n int find(int x){\n if(par[x] == x){\n return x;\n } else {\n return par[x] = find(par[x]);\n }\n }\n\n void unite(int x,int y){\n x = find(x);\n y = find(y);\n if (x == y) return;\n par[x] = y;\n }\n\n bool same(int x,int y){\n return find(x) == find(y);\n }\n};\n\nint main(){\n int num_of_houses;\n int num_of_paths;\n while(~scanf(\"%d %d\",&num_of_houses,&num_of_paths)){\n if(num_of_houses == 0 && num_of_paths == 0) break;\n\n FordFulkerson ff(num_of_houses);\n UnionFindTree uft(num_of_houses);\n\n int bonus = 0;\n\n for(int path_i = 0; path_i < num_of_paths; path_i++){\n int from,to;\n int cost;\n scanf(\"%d %d %d\",&from,&to,&cost);\n if(cost < 0) bonus += cost; \n ff.add_edge(from,to,max(0,cost));\n uft.unite(from,to);\n }\n\n int tree_count = 0;\n bool visited[101];\n memset(visited,false,sizeof(visited));\n for(int house_i = 0; house_i< num_of_houses; house_i++){\n if(!visited[uft.find(house_i)]) tree_count++;\n visited[uft.find(house_i)] = true;\n }\n\n int res = numeric_limits<int>::max();\n\n if(tree_count >= 2){\n res = 0;\n }\n else{\n for(int house_i = 0; house_i< num_of_houses; house_i++){\n int house_j = uft.find(house_i);\n if(house_i == house_j) continue;\n FordFulkerson tmp(ff);\n res = min(res,tmp.compute_maxflow(house_i,house_j));\n }\n }\n printf(\"%d\\n\",bonus + res);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 10764,
"score_of_the_acc": -0.4066,
"final_rank": 13
},
{
"submission_id": "aoj_1065_1120307",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 100000000\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cstdio>\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\nconst int tx[] = {0,1,0,-1};\nconst int ty[] = {-1,0,1,0};\n\nstruct Node {\n int to;\n int idx;\n int flow;\n Node(int to,int idx,int flow) :\n to(to),idx(idx),flow(flow) {}\n};\n\nclass FordFulkerson {\nprivate:\n vector<Node>* _graph;\n bool* _used;\n int _size;\n\n int dfs(int src,int flow,int sink){\n if(src == sink) return flow;\n\n _used[src] = true;\n for(int i= 0;i < _graph[src].size();i++){\n Node& e = _graph[src][i];\n if(_used[e.to]) continue;\n if(e.flow <= 0) continue;\n int next_flow = min(flow,e.flow);\n int d = dfs(e.to,next_flow,sink);\n if(d <= 0) continue;\n\n Node& rev_e = _graph[e.to][e.idx];\n e.flow -= d;\n rev_e.flow += d;\n return d;\n }\n return 0;\n }\n\npublic: \n FordFulkerson(int n) {\n _size = n;\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n }\n FordFulkerson(const FordFulkerson& f){\n _size = f.size();\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n fill((bool*)_used,(bool*)_used + _size,false);\n\n for(int i = 0; i < f.size(); i++){\n for(int j = 0; j < f.graph()[i].size(); j++){\n _graph[i].push_back(f.graph()[i][j]);\n }\n }\n }\n\n void add_edge(int from,int to,int flow) {\n _graph[from].push_back(Node(to,_graph[to].size(),flow));\n _graph[to].push_back(Node(from,_graph[from].size()-1,flow));\n }\n\n int compute_maxflow(int src,int sink){\n int res = 0;\n\n while(true){\n fill((bool*)_used,(bool*)_used + _size,false);\n int tmp = dfs(src,numeric_limits<int>::max(),sink);\n if(tmp == 0) break;\n res += tmp;\n }\n return res;\n }\n\n int size() const{\n return _size;\n }\n vector<Node>* graph() const{\n return _graph;\n }\n};\n\nclass UnionFindTree {\nprivate:\n int* par;\n int* rank;\npublic:\n UnionFindTree(int n){\n par = new int[n]();\n rank = new int[n]();\n for(int i=0;i<n;i++){\n par[i] = i;\n rank[i] = 0;\n }\n }\n\n ~UnionFindTree(){\n delete[] rank;\n delete[] par;\n }\n\n int find(int x){\n if(par[x] == x){\n return x;\n } else {\n return par[x] = find(par[x]);\n }\n }\n\n void unite(int x,int y){\n x = find(x);\n y = find(y);\n if (x == y) return;\n par[x] = y;\n }\n\n bool same(int x,int y){\n return find(x) == find(y);\n }\n};\n\nint main(){\n int num_of_houses;\n int num_of_paths;\n while(~scanf(\"%d %d\",&num_of_houses,&num_of_paths)){\n if(num_of_houses == 0 && num_of_paths == 0) break;\n\n FordFulkerson ff(num_of_houses);\n UnionFindTree uft(num_of_houses);\n\n int bonus = 0;\n\n for(int path_i = 0; path_i < num_of_paths; path_i++){\n int from,to;\n int cost;\n scanf(\"%d %d %d\",&from,&to,&cost);\n if(cost < 0) bonus += cost; \n ff.add_edge(from,to,max(0,cost));\n uft.unite(from,to);\n }\n\n int tree_count = 0;\n bool visited[101];\n memset(visited,false,sizeof(visited));\n for(int house_i = 0; house_i< num_of_houses; house_i++){\n if(!visited[uft.find(house_i)]) tree_count++;\n visited[uft.find(house_i)] = true;\n }\n\n int res = numeric_limits<int>::max();\n\n if(tree_count >= 2){\n res = 0;\n }\n else{\n for(int house_i = 0; house_i< num_of_houses; house_i++){\n int house_j = uft.find(house_i);\n if(house_i == house_j) continue;\n FordFulkerson tmp(ff);\n res = min(res,tmp.compute_maxflow(house_i,house_j));\n }\n }\n printf(\"%d\\n\",bonus + res);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 10764,
"score_of_the_acc": -0.4066,
"final_rank": 13
},
{
"submission_id": "aoj_1065_1120300",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 100000000\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cstdio>\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\nconst int tx[] = {0,1,0,-1};\nconst int ty[] = {-1,0,1,0};\n\nstruct Node {\n int to;\n int idx;\n int flow;\n Node(int to,int idx,int flow) :\n to(to),idx(idx),flow(flow) {}\n};\n\nclass FordFulkerson {\nprivate:\n vector<Node>* _graph;\n bool* _used;\n int _size;\n\n int dfs(int src,int flow,int sink){\n if(src == sink) return flow;\n\n int res = 0;\n _used[src] = true;\n for(int i= 0;i < _graph[src].size();i++){\n Node& e = _graph[src][i];\n if(_used[e.to]) continue;\n if(e.flow <= 0) continue;\n int d = dfs(e.to,min(flow,e.flow),sink);\n if(d > 0){\n Node& rev_e = _graph[e.to][e.idx];\n e.flow -= d;\n rev_e.flow += d;\n return d;\n }\n }\n return 0;\n }\n\npublic: \n FordFulkerson(int n) {\n _size = n;\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n }\n FordFulkerson(const FordFulkerson& f){\n _size = f.size();\n _graph = new vector<Node>[_size];\n _used = new bool[_size];\n fill((bool*)_used,(bool*)_used + _size,false);\n\n for(int i = 0; i < f.size(); i++){\n for(int j = 0; j < f.graph()[i].size(); j++){\n _graph[i].push_back(f.graph()[i][j]);\n }\n }\n }\n\n void add_edge(int from,int to,int flow) {\n _graph[from].push_back(Node(to,_graph[to].size(),flow));\n _graph[to].push_back(Node(from,_graph[from].size()-1,flow));\n }\n\n int compute_maxflow(int src,int sink){\n int res = 0;\n\n while(true){\n fill((bool*)_used,(bool*)_used + _size,false);\n int tmp = dfs(src,numeric_limits<int>::max(),sink);\n if(tmp == 0) break;\n res += tmp;\n }\n return res;\n }\n\n int size() const{\n return _size;\n }\n vector<Node>* graph() const{\n return _graph;\n }\n};\n\nclass UnionFindTree {\nprivate:\n int* par;\n int* rank;\npublic:\n UnionFindTree(int n){\n par = new int[n]();\n rank = new int[n]();\n for(int i=0;i<n;i++){\n par[i] = i;\n rank[i] = 0;\n }\n }\n\n ~UnionFindTree(){\n delete[] rank;\n delete[] par;\n }\n\n int find(int x){\n if(par[x] == x){\n return x;\n } else {\n return par[x] = find(par[x]);\n }\n }\n\n void unite(int x,int y){\n x = find(x);\n y = find(y);\n if (x == y) return;\n par[x] = y;\n }\n\n bool same(int x,int y){\n return find(x) == find(y);\n }\n};\n\nint main(){\n int num_of_houses;\n int num_of_paths;\n while(~scanf(\"%d %d\",&num_of_houses,&num_of_paths)){\n if(num_of_houses == 0 && num_of_paths == 0) break;\n\n FordFulkerson ff(num_of_houses);\n UnionFindTree uft(num_of_houses);\n\n int bonus = 0;\n\n for(int path_i = 0; path_i < num_of_paths; path_i++){\n int from,to;\n int cost;\n scanf(\"%d %d %d\",&from,&to,&cost);\n if(cost < 0) bonus += cost; \n ff.add_edge(from,to,max(0,cost));\n uft.unite(from,to);\n }\n\n int tree_count = 0;\n bool visited[101];\n memset(visited,false,sizeof(visited));\n for(int house_i = 0; house_i< num_of_houses; house_i++){\n if(!visited[uft.find(house_i)]) tree_count++;\n visited[uft.find(house_i)] = true;\n }\n\n int res = numeric_limits<int>::max();\n\n if(tree_count >= 2){\n res = 0;\n }\n else{\n for(int house_i = 0; house_i< num_of_houses; house_i++){\n int house_j = uft.find(house_i);\n if(house_i == house_j) continue;\n FordFulkerson tmp(ff);\n res = min(res,tmp.compute_maxflow(house_i,house_j));\n }\n }\n printf(\"%d\\n\",bonus + res);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 10760,
"score_of_the_acc": -0.4064,
"final_rank": 12
},
{
"submission_id": "aoj_1065_1110232",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\n#include<vector>\n#include<queue>\nusing namespace std;\nconst int D_MAX_V=210;\nconst int D_v_size=210;\nstruct D_wolf{\n\tint t,r;\n\tlong long c;\n\tD_wolf(){t=c=r=0;}\n\tD_wolf(int t1,long long c1,int r1){\n\t\tt=t1;c=c1;r=r1;\n\t}\n};\nvector<D_wolf>D_G[D_MAX_V];\nint D_level[D_MAX_V];\nint D_iter[D_MAX_V];\n\nvoid add_edge(int from,int to,long long cap){\n\tD_G[from].push_back(D_wolf(to,cap,D_G[to].size()));\n\tD_G[to].push_back(D_wolf(from,0,D_G[from].size()-1));\n}\nvoid D_bfs(int s){\n\tfor(int i=0;i<D_v_size;i++)D_level[i]=-1;\n\tqueue<int> Q;\n\tD_level[s]=0;\n\tQ.push(s);\n\twhile(Q.size()){\n\t\tint v=Q.front();\n\t\tQ.pop();\n\t\tfor(int i=0;i<D_G[v].size();i++){\n\t\t\tif(D_G[v][i].c>0&&D_level[D_G[v][i].t]<0){\n\t\t\t\tD_level[D_G[v][i].t]=D_level[v]+1;\n\t\t\t\tQ.push(D_G[v][i].t);\n\t\t\t}\n\t\t}\n\t}\n}\nlong long D_dfs(int v,int t,long long f){\n\tif(v==t)return f;\n\tfor(;D_iter[v]<D_G[v].size();D_iter[v]++){\n\t\tint i=D_iter[v];\n\t\tif(D_G[v][i].c>0&&D_level[v]<D_level[D_G[v][i].t]){\n\t\t\tlong long d=D_dfs(D_G[v][i].t,t,min(f,D_G[v][i].c));\n\t\t\tif(d>0){\n\t\t\t\tD_G[v][i].c-=d;\n\t\t\t\tD_G[D_G[v][i].t][D_G[v][i].r].c+=d;\n\t\t\t\treturn d;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\nlong long max_flow(int s,int t){\n\tlong long flow=0;\n\tfor(;;){\n\t\tD_bfs(s);\n\t\tif(D_level[t]<0)return flow;\n\t\tfor(int i=0;i<D_v_size;i++)D_iter[i]=0;\n\t\tlong long f;\n\t\twhile((f=D_dfs(s,t,9999999999999LL))>0){flow+=f;}\n\t}\n\treturn 0;\n}\nlong long INF=9999999999999LL;\nint p[30000];\nint q[30000];\nint r[30000];\nint main(){\n\tint a,b;\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tfor(int i=0;i<b;i++){\n\t\t\tscanf(\"%d%d%d\",p+i,q+i,r+i);\n\t\t}\n\t\tlong long ret=999999999999999LL;\n\t\tfor(int i=1;i<a;i++){\n\t\t\tfor(int j=0;j<D_MAX_V;j++){\n\t\t\t\tD_G[j].clear();\n\t\t\t\tD_iter[j]=D_level[j]=0;\n\t\t\t}\n\t\t\tlong long tmp=0;\n\t\t/*\tfor(int j=0;j<a;j++){\n\t\t\t\tadd_edge(j,j+a,INF);\n\t\t\t\tif(j==0)add_edge(s,j,INF);\n\t\t\t\telse add_edge(s,j,0);\n\t\t\t\tif(j==i)add_edge(j+a,t,INF);\n\t\t\t\telse add_edge(j+a,t,0);\n\t\t\t}*/\n\t\t\tfor(int j=0;j<b;j++){\n\t\t\t\tif(r[j]<=0){\n\t\t\t\t\ttmp+=r[j];continue;\n\t\t\t\t}\n\t\t\t\tadd_edge(p[j],q[j],r[j]);\n\t\t\t\tadd_edge(q[j],p[j],r[j]);\n\t\t\t}\n\t\t\tret=min(ret,tmp+max_flow(0,i));\n\t\t}\n\t\tprintf(\"%lld\\n\",ret);\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1092,
"score_of_the_acc": -0.1257,
"final_rank": 6
},
{
"submission_id": "aoj_1065_888149",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\n\nconst int inf = 0x3f3f3f3f ;\nconst int maxw = 1000 ;\nint g[105][105] , w[105] ;\nint a[105] , v[105] , na[105] ;\nint n , m ;\nint mincut( int n ) {\n\tint i , j, pv , zj ;\n\tint best = inf ;\n\tfor( i = 0 ; i < n; i ++ ) {\n\t\tv[i] = i ;\n\t}\n\twhile( n > 1 ) {\n\t\tfor( a[v[0]] = 1 , i = 1 ; i < n; i ++ ) {\n\t\t\ta[v[i]] = 0 ; na[i-1] = i ;\n\t\t\tw[i] = g[v[0]][v[i]] ;\n\t\t}\n\t\tfor( pv = v[0] ,i = 1 ; i < n ; i ++ ) {\n\t\t\tfor( zj = -1 , j = 1 ; j < n ; j ++ ) \n\t\t\t\tif( !a[v[j]] && (zj<0||w[j]>w[zj]))\n\t\t\t\t\tzj = j ;\n\t\t\t\ta[v[zj]] = 1 ;\n\t\t\t\tif( i == n - 1 ) {\n\t\t\t\t\tif( best > w[zj] ) best = w[zj] ;\n\t\t\t\t\tfor( i = 0 ; i < n; i++ ) {\n\t\t\t\t\t\tg[v[i]][pv] = g[pv][v[i]] +=g[v[zj]][v[i]] ;\n\t\t\t\t\t}\n\t\t\t\t\tv[zj] = v[--n] ;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tpv = v[zj] ;\n\t\t\t\tfor( j = 1 ; j < n; j ++ ) if( !a[v[j]])\n\t\t\t\t\tw[j] += g[v[zj]][v[j]] ;\n\t\t}\n\t}\n\treturn best ;\n}\n\nint main(){\n\twhile( scanf( \"%d%d\" , &n , &m ) != EOF ) {\n\t\tif( n == 0 && m == 0 ) break;\n\t\tmemset( g , 0 , sizeof(g) ) ;\n\t\tint ans = 0 ;\n\t\tint i ;\n\t\tfor( i = 1 ; i <= m ;i ++ ) {\n\t\t\tint from , to ,val ;\n\t\t\tscanf( \"%d%d%d\" , &from , &to , &val ) ;\n\t\t\tif( val < 0 ) {\n\t\t\t\tans += val ;\n\t\t\t\tcontinue ;\n\t\t\t}\n\t\t\tif( g[from][to] == inf ) {\n\t\t\t\tg[from][to] = val ;\n\t\t\t}else{\n\t\t\t\tg[from][to] += val ;\n\t\t\t}\n\t\t\tg[to][from] = g[from][to] ;\n\t\t}\n\t\tprintf( \"%d\\n\" , ans + mincut(n) ) ;\n\t}\n\treturn 0 ;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1076,
"score_of_the_acc": -0.625,
"final_rank": 16
},
{
"submission_id": "aoj_1065_881449",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<climits>\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 IINF (INT_MAX)\n#define MAX 200\n\nusing namespace std;\n\nstruct Data{\n int from,to,cost,index;\n Data(int from=-1,int to=-1,int cost=-1,int index=-1):from(from),to(to),cost(cost),index(index){}\n};\n\nint V,E;\nvector<Data> G[MAX];\nbool visited[MAX];\n\nvoid isconnect(int cur,int &counter,int *ban){\n if(visited[cur])return;\n visited[cur] = true;\n counter++;\n rep(i,G[cur].size()){\n if( ban[0] == G[cur][i].index || ban[1] == G[cur][i].index ) continue;\n isconnect(G[cur][i].to,counter,ban);\n }\n}\n\nint main(){\n while(cin >> V >> E,V|E){\n Data *input = new Data[E];\n int mincost = IINF,coef = 0;\n rep(i,V)G[i].clear();\n rep(i,E){\n cin >> input[i].from >> input[i].to >> input[i].cost;\n input[i].index = i;\n if( input[i].cost < 0 ) coef += input[i].cost;\n else {\n\tG[input[i].from].push_back(input[i]);\n\tG[input[i].to].push_back(Data(input[i].to,input[i].from,input[i].cost,input[i].index));\n }\n }\n\n int counter = 0;\n int ban[2] = {-1,-1};\n rep(i,V)visited[i] = false;\n isconnect(0,counter,ban);\n if(counter != V)mincost = min(mincost,coef);\n\n rep(i,E){\n if( input[i].cost < 0 ) continue;\n rep(j,E){\n\tif( input[j].cost < 0 ) continue;\n\trep(k,V)visited[k] = false;\n\tban[0] = i, ban[1] = j;\n\tcounter = 0;\n\tisconnect(0,counter,ban);\n\tif( counter != V )mincost = min(mincost,coef+input[i].cost+((i==j)?0:input[j].cost));\n }\n }\n cout << mincost << endl;\n\n delete [] input;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 1228,
"score_of_the_acc": -1.0064,
"final_rank": 19
},
{
"submission_id": "aoj_1065_881448",
"code_snippet": "#include<iostream>\n#include<cmath>\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<climits>\n#include<map>\n#include<set>\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 IINF (INT_MAX)\n#define MAX 200\n\nusing namespace std;\n\nstruct Data{\n int from,to,cost,index;\n Data(int from=-1,int to=-1,int cost=-1,int index=-1):from(from),to(to),cost(cost),index(index){}\n};\n\nint V,E;\nvector<Data> G[MAX];\nbool visited[MAX];\n\nvoid isconnect(int cur,int &counter,int *ban){\n if(visited[cur])return;\n visited[cur] = true;\n counter++;\n rep(i,G[cur].size()){\n if( ban[0] == G[cur][i].index || ban[1] == G[cur][i].index ) continue;\n isconnect(G[cur][i].to,counter,ban);\n }\n}\n\nint main(){\n while(cin >> V >> E,V|E){\n Data *input = new Data[E];\n int mincost = IINF,coef = 0;\n rep(i,V)G[i].clear();\n rep(i,E){\n cin >> input[i].from >> input[i].to >> input[i].cost;\n input[i].index = i;\n if( input[i].cost < 0 ) coef += input[i].cost;\n else {\n\tG[input[i].from].push_back(input[i]);\n\tG[input[i].to].push_back(Data(input[i].to,input[i].from,input[i].cost,input[i].index));\n }\n }\n\n int counter = 0;\n int ban[2] = {-1,-1};\n rep(i,V)visited[i] = false;\n isconnect(0,counter,ban);\n if(counter != V)mincost = min(mincost,coef);\n\n rep(i,E){\n if( input[i].cost < 0 ) continue;\n rep(j,E){\n\tif( input[j].cost < 0 ) continue;\n\trep(k,V)visited[k] = false;\n\tban[0] = i, ban[1] = j;\n\tcounter = 0;\n\tisconnect(0,counter,ban);\n\tif( counter != V )mincost = min(mincost,coef+input[i].cost+((i==j)?0:input[j].cost));\n }\n }\n cout << mincost << endl;\n\n delete [] input;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 1224,
"score_of_the_acc": -1.0062,
"final_rank": 18
},
{
"submission_id": "aoj_1065_881218",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cstring>\n#include <cctype>\n#include <algorithm>\n#include <string>\n#include <complex>\n#include <list>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <sstream>\n#include <numeric>\n#include <functional>\n#include <bitset>\n#include <iomanip>\n \nusing namespace std;\n \n \n#define INF (1<<29)\n \n// math\n#define Sq(x) ((x)*(x))\n \n// container utility\n#define ALL(x) (x).begin(), (x).end()\n#define MP make_pair\n#define PB push_back\n#define EACH(it,c) for(__typeof((c).begin())it=(c).begin();it!=(c).end();it++)\n \n// rep\n#define REP(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,n) REP(i,0,n)\n \n// debug\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n \n// typedef\ntypedef pair<int, int> PII;\ntypedef vector<int> VI;\ntypedef vector<PII> VII;\ntypedef vector<VI> VVI;\n \ntypedef long long ll;\n \n// conversion\ntemplate<class T> inline string toStr(T a) { ostringstream oss; oss << a; return oss.str(); }\ninline int toInt(string s) { return atoi(s.c_str()); }\n \n// prime\nbool isPrime(int a) { for(int i=2; i*i <=a; i++) if(a%i == 0) return false; return true; }\n \n// !!! set MAX_L number !!!\n#define MAX_L (1000001)\n#define MAX_SQRT_B ((int)sqrt(INT_MAX)+1)\n \nbool is_prime[MAX_L];\nvector<bool> is_prime_small(MAX_SQRT_B);\n \nvoid segment_sieve(ll a, ll b) {\n \n for(int i=0; (ll)i*i < b; i++) is_prime_small[i] = true;\n for(int i=0; i < b-a; i++) is_prime[i] = true;\n \n if(a == 1) {\n is_prime[0] = false;\n }\n \n is_prime_small[0] = is_prime_small[1] = false;\n \n for(int i=2; (ll)i*i<b; i++) {\n if(is_prime_small[i]) {\n for(int j=2*i; (ll)j*j<b; j+=i) is_prime_small[j] = false;\n for(ll j = max(2LL, (a+i-1)/i)*i; j<b; j+=i) is_prime[j-a] = false;\n }\n }\n}\n \n//////////////////////////////////////////////////////////////\n \n \nstruct Edge {\n int to, cost, id;\n Edge(int t, int c, int i)\n : to(t), cost(c), id(i) {}\n};\n \n#define MAX_E (99)\n \nvector<Edge> es[MAX_E];\nint N, M;\n \nbool isConnected(int x) {\n \n vector<bool> used(N);\n vector<int> VEC;\n VEC.PB(0); used[0] = 1;\n \n int v = 0;\n while(!VEC.empty()) {\n vector<int> NEXT;\n \n EACH(i, VEC) {\n EACH(e, es[*i]) {\n if(e->id != x && !used[e->to]) {\n used[e->to] = 1;\n NEXT.PB(e->to);\n }\n }\n v ++;\n }\n VEC = NEXT;\n }\n return N == v;\n}\n \nint main() {\n \n while( cin >> N >> M && (N|M) ) {\n for(int i=0; i<MAX_E; i++) {\n es[i].clear();\n }\n \n int base = 0;\n int id = 0;\n \n vector<int> cost;\n \n for(int i=0; i<M; i++) {\n int s, t, c;\n cin >> s >> t >> c;\n \n if(c <= 0) base += c;\n else {\n es[s].PB(Edge(t, c, id));\n es[t].PB(Edge(s, c, id));\n cost.PB(c);\n id ++;\n }\n }\n \n int E = id;\n int ans = INF;\n \n if(!isConnected(-1)) ans = 0;\n \n for(int i=0; i<E; i++) {\n if(!isConnected(i)) ans = min(ans, cost[i]);\n }\n \n for(int i=0; i<E-1; i++)\n for(int j=i+1; j<E; j++)\n ans = min(ans, cost[i]+cost[j]);\n \n cout << base + ans << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1244,
"score_of_the_acc": -0.0071,
"final_rank": 2
},
{
"submission_id": "aoj_1065_881216",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cstring>\n#include <cctype>\n#include <algorithm>\n#include <string>\n#include <complex>\n#include <list>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <sstream>\n#include <numeric>\n#include <functional>\n#include <bitset>\n#include <iomanip>\n \nusing namespace std;\n \n \n#define INF (1<<29)\n \n// math\n#define Sq(x) ((x)*(x))\n \n// container utility\n#define ALL(x) (x).begin(), (x).end()\n#define MP make_pair\n#define PB push_back\n#define EACH(it,c) for(__typeof((c).begin())it=(c).begin();it!=(c).end();it++)\n \n// rep\n#define REP(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,n) REP(i,0,n)\n \n// debug\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n \n// typedef\ntypedef pair<int, int> PII;\ntypedef vector<int> VI;\ntypedef vector<PII> VII;\ntypedef vector<VI> VVI;\n \ntypedef long long ll;\n \n// conversion\ntemplate<class T> inline string toStr(T a) { ostringstream oss; oss << a; return oss.str(); }\ninline int toInt(string s) { return atoi(s.c_str()); }\n \n// prime\nbool isPrime(int a) { for(int i=2; i*i <=a; i++) if(a%i == 0) return false; return true; }\n \n// !!! set MAX_L number !!!\n#define MAX_L (1000001)\n#define MAX_SQRT_B ((int)sqrt(INT_MAX)+1)\n \nbool is_prime[MAX_L];\nvector<bool> is_prime_small(MAX_SQRT_B);\n \nvoid segment_sieve(ll a, ll b) {\n \n for(int i=0; (ll)i*i < b; i++) is_prime_small[i] = true;\n for(int i=0; i < b-a; i++) is_prime[i] = true;\n \n if(a == 1) {\n is_prime[0] = false;\n }\n \n is_prime_small[0] = is_prime_small[1] = false;\n \n for(int i=2; (ll)i*i<b; i++) {\n if(is_prime_small[i]) {\n for(int j=2*i; (ll)j*j<b; j+=i) is_prime_small[j] = false;\n for(ll j = max(2LL, (a+i-1)/i)*i; j<b; j+=i) is_prime[j-a] = false;\n }\n }\n}\n \n//////////////////////////////////////////////////////////////\n \n \nstruct Edge {\n int to, cost, id;\n Edge(int t, int c, int i)\n : to(t), cost(c), id(i) {}\n};\n \n#define MAX_E (100)\n \nvector<Edge> es[MAX_E];\nint N, M;\n \nbool isConnected(int x) {\n \n vector<bool> used(N);\n vector<int> VEC;\n VEC.PB(0); used[0] = 1;\n \n int v = 0;\n while(!VEC.empty()) {\n vector<int> NEXT;\n \n EACH(i, VEC) {\n EACH(e, es[*i]) {\n if(e->id != x && !used[e->to]) {\n used[e->to] = 1;\n NEXT.PB(e->to);\n }\n }\n v ++;\n }\n VEC = NEXT;\n }\n return N == v;\n}\n \nint main() {\n \n while( cin >> N >> M && (N|M) ) {\n for(int i=0; i<MAX_E; i++) {\n es[i].clear();\n }\n \n int base = 0;\n int id = 0;\n \n vector<int> cost;\n \n for(int i=0; i<M; i++) {\n int s, t, c;\n cin >> s >> t >> c;\n \n if(c <= 0) base += c;\n else {\n es[s].PB(Edge(t, c, id));\n es[t].PB(Edge(s, c, id));\n cost.PB(c);\n id ++;\n }\n }\n \n int E = id;\n int ans = INF;\n \n if(!isConnected(-1)) ans = 0;\n \n for(int i=0; i<E; i++) {\n if(!isConnected(i)) ans = min(ans, cost[i]);\n }\n \n for(int i=0; i<E-1; i++)\n for(int j=i+1; j<E; j++)\n ans = min(ans, cost[i]+cost[j]);\n \n cout << base + ans << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1244,
"score_of_the_acc": -0.0071,
"final_rank": 2
},
{
"submission_id": "aoj_1065_881214",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cstring>\n#include <cctype>\n#include <algorithm>\n#include <string>\n#include <complex>\n#include <list>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <sstream>\n#include <numeric>\n#include <functional>\n#include <bitset>\n#include <iomanip>\n \nusing namespace std;\n \n \n#define INF (1<<29)\n \n// math\n#define Sq(x) ((x)*(x))\n \n// container utility\n#define ALL(x) (x).begin(), (x).end()\n#define MP make_pair\n#define PB push_back\n#define EACH(it,c) for(__typeof((c).begin())it=(c).begin();it!=(c).end();it++)\n \n// rep\n#define REP(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,n) REP(i,0,n)\n \n// debug\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n \n// typedef\ntypedef pair<int, int> PII;\ntypedef vector<int> VI;\ntypedef vector<PII> VII;\ntypedef vector<VI> VVI;\n \ntypedef long long ll;\n \n// conversion\ntemplate<class T> inline string toStr(T a) { ostringstream oss; oss << a; return oss.str(); }\ninline int toInt(string s) { return atoi(s.c_str()); }\n \n// prime\nbool isPrime(int a) { for(int i=2; i*i <=a; i++) if(a%i == 0) return false; return true; }\n \n// !!! set MAX_L number !!!\n#define MAX_L (1000001)\n#define MAX_SQRT_B ((int)sqrt(INT_MAX)+1)\n \nbool is_prime[MAX_L];\nvector<bool> is_prime_small(MAX_SQRT_B);\n \nvoid segment_sieve(ll a, ll b) {\n \n for(int i=0; (ll)i*i < b; i++) is_prime_small[i] = true;\n for(int i=0; i < b-a; i++) is_prime[i] = true;\n \n if(a == 1) {\n is_prime[0] = false;\n }\n \n is_prime_small[0] = is_prime_small[1] = false;\n \n for(int i=2; (ll)i*i<b; i++) {\n if(is_prime_small[i]) {\n for(int j=2*i; (ll)j*j<b; j+=i) is_prime_small[j] = false;\n for(ll j = max(2LL, (a+i-1)/i)*i; j<b; j+=i) is_prime[j-a] = false;\n }\n }\n}\n \n//////////////////////////////////////////////////////////////\n \n \nstruct Edge {\n int to, cost, id;\n Edge(int t, int c, int i)\n : to(t), cost(c), id(i) {}\n};\n \n#define MAX_E (200)\n \nvector<Edge> es[MAX_E];\nint N, M;\n \nbool isConnected(int x) {\n \n vector<bool> used(N);\n vector<int> VEC;\n VEC.PB(0); used[0] = 1;\n \n int v = 0;\n while(!VEC.empty()) {\n vector<int> NEXT;\n \n EACH(i, VEC) {\n EACH(e, es[*i]) {\n if(e->id != x && !used[e->to]) {\n used[e->to] = 1;\n NEXT.PB(e->to);\n }\n }\n v ++;\n }\n VEC = NEXT;\n }\n return N == v;\n}\n \nint main() {\n \n while( cin >> N >> M && (N|M) ) {\n for(int i=0; i<MAX_E; i++) {\n es[i].clear();\n }\n \n int base = 0;\n int id = 0;\n \n vector<int> cost;\n \n for(int i=0; i<M; i++) {\n int s, t, c;\n cin >> s >> t >> c;\n \n if(c <= 0) base += c;\n else {\n es[s].PB(Edge(t, c, id));\n es[t].PB(Edge(s, c, id));\n cost.PB(c);\n id ++;\n }\n }\n \n int E = id;\n int ans = INF;\n \n if(!isConnected(-1)) ans = 0;\n \n for(int i=0; i<E; i++) {\n if(!isConnected(i)) ans = min(ans, cost[i]);\n }\n \n for(int i=0; i<E-1; i++)\n for(int j=i+1; j<E; j++)\n ans = min(ans, cost[i]+cost[j]);\n \n cout << base + ans << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1240,
"score_of_the_acc": -0.0069,
"final_rank": 1
},
{
"submission_id": "aoj_1065_881195",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cstring>\n#include <cctype>\n#include <algorithm>\n#include <string>\n#include <complex>\n#include <list>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <sstream>\n#include <numeric>\n#include <functional>\n#include <bitset>\n#include <iomanip>\n\nusing namespace std;\n\n\n#define INF (1<<29)\n\n// math\n#define Sq(x) ((x)*(x))\n\n// container utility\n#define ALL(x) (x).begin(), (x).end()\n#define MP make_pair\n#define PB push_back\n#define EACH(it,c) for(__typeof((c).begin())it=(c).begin();it!=(c).end();it++)\n\n// rep\n#define REP(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,n) REP(i,0,n)\n\n// debug\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n\n// typedef\ntypedef pair<int, int> PII;\ntypedef vector<int> VI;\ntypedef vector<PII> VII;\ntypedef vector<VI> VVI;\n\ntypedef long long ll;\n\n// conversion\ntemplate<class T> inline string toStr(T a) { ostringstream oss; oss << a; return oss.str(); }\ninline int toInt(string s) { return atoi(s.c_str()); }\n\n// prime\nbool isPrime(int a) { for(int i=2; i*i <=a; i++) if(a%i == 0) return false; return true; }\n\n// !!! set MAX_L number !!!\n#define MAX_L (1000001)\n#define MAX_SQRT_B ((int)sqrt(INT_MAX)+1)\n \nbool is_prime[MAX_L];\nvector<bool> is_prime_small(MAX_SQRT_B);\n \nvoid segment_sieve(ll a, ll b) {\n \n for(int i=0; (ll)i*i < b; i++) is_prime_small[i] = true;\n for(int i=0; i < b-a; i++) is_prime[i] = true;\n \n if(a == 1) {\n is_prime[0] = false;\n }\n \n is_prime_small[0] = is_prime_small[1] = false;\n \n for(int i=2; (ll)i*i<b; i++) {\n if(is_prime_small[i]) {\n for(int j=2*i; (ll)j*j<b; j+=i) is_prime_small[j] = false;\n for(ll j = max(2LL, (a+i-1)/i)*i; j<b; j+=i) is_prime[j-a] = false;\n }\n }\n}\n\n//////////////////////////////////////////////////////////////\n\n\nstruct Edge {\n int to, cost, id;\n Edge(int t, int c, int i)\n : to(t), cost(c), id(i) {}\n};\n\n#define MAX_E (300)\n\nvector<Edge> es[MAX_E];\nint N, M;\n\nbool isConnected(int x) {\n \n vector<bool> used(N);\n vector<int> VEC;\n VEC.PB(0); used[0] = 1;\n \n int v = 0;\n while(!VEC.empty()) {\n vector<int> NEXT;\n \n EACH(i, VEC) {\n EACH(e, es[*i]) {\n\tif(e->id != x && !used[e->to]) {\n\t used[e->to] = 1;\n\t NEXT.PB(e->to);\n\t}\n }\n v ++;\n }\n VEC = NEXT;\n }\n return N == v;\n}\n\nint main() {\n \n while( cin >> N >> M && (N|M) ) {\n for(int i=0; i<MAX_E; i++) {\n es[i].clear();\n }\n \n int base = 0;\n int id = 0;\n \n vector<int> cost;\n \n for(int i=0; i<M; i++) {\n int s, t, c;\n cin >> s >> t >> c;\n \n if(c <= 0) base += c;\n else {\n\tes[s].PB(Edge(t, c, id));\n\tes[t].PB(Edge(s, c, id));\n\tcost.PB(c);\n\tid ++;\n }\n }\n \n int E = id;\n int ans = INF;\n \n if(!isConnected(-1)) ans = 0;\n \n for(int i=0; i<E; i++) {\n if(!isConnected(i)) ans = min(ans, cost[i]);\n }\n \n for(int i=0; i<E-1; i++)\n for(int j=i+1; j<E; j++)\n\tans = min(ans, cost[i]+cost[j]);\n \n cout << base + ans << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1248,
"score_of_the_acc": -0.0072,
"final_rank": 4
}
] |
aoj_1074_cpp
|
Problem A: Popularity Estimation
あなたはとあるアニメーション制作会社の企画部長である。昨今のアニメーション制作会社が制作するものは、アニメーションそのものにとどまらない。関連商品、例えば登場キャラクターのフィギュアやキャラクターソングCDなども、重要な収益源なのである。この収益をどれだけ伸ばせるかは、ひとえに企画部長のあなたにかかっているのであった。
当たり前のことだが、こういった関連商品は闇雲に発売すればいいというものではない。商品の開発には多くの時間と予算が必要なためだ。アニメの登場キャラクターのフィギュアを発売するにしても、多くの売上が見込まれる、人気があるキャラクターのものに限らなければならない。
キャラクターの人気度を測る手段の一つが、人気投票である。あなたも今までいくつかの人気投票を企画してきたが、どうやら視聴者はこの企画に不満を抱きつつあるようだ。人気度を測る他の手法の確立が急務である。
そこであなたは、ひとつの仮説を立てた。あるキャラクターの人気度は、そのアニメ本編中における登場時間の総和に比例する、というものだ。あなたはこの仮説を検証するため、それぞれのキャラクターの登場時間を集計するプログラムを書くことにした。
Input
入力は複数のケースからなる。
各ケースは以下のフォーマットで与えられる。
n
name
0
m
0
d
0,0
...
d
0,m
0
-1
name
1
m
1
d
1,0
...
d
1,m
1
-1
.
.
.
name
n-1
m
n-1
d
n-1,0
...
d
n-1,m
n-1
-1
n
はキャラクターの人数を表す。
name
i
はキャラクターの名前を表す。
m
i
はキャラクターが映っていた時刻の種類を表す。
m
i
の後には
m
i
個の整数
d
i,j
が与えられる。
d
i,j
はキャラクターが映っていた時刻を表す。
入力の終わりは
n=0
からなる行によって与えられる
ある時刻に1人のキャラクターのみが画面に映っていた場合、そのキャラクターはnポイントを得ることが出来る。
同時刻に映るキャラクターが1人増える毎に、その時刻に映っていたキャラクターが得られるポイントは1減る。
n人のキャラクターが同時刻に映っていた場合、n人の人それぞれに1ポイントが加算される。
入力は以下の制約を満たす。
2 ≤
n
≤ 20
0 ≤
m
i
≤ 30
0 ≤
d
i,j
< 30
i
番目のキャラクターについて
d
i,j
はすべて異なる。
name
i
はアルファベットの大文字または小文字のみを含み、長さは10以下である。
Output
最小のポイントを持つキャラクターのポイントとその名前を1つの空白で区切って出力せよ。
最小のポイントを持つキャラクターが複数いる場合は名前が辞書順で最小の人を選ぶこと。
Sample input
4
akzakr 2 1 8
fnmyi 5 2 3 4 6 9
tsnukk 5 2 3 4 7 9
yskwcnt 6 3 4 7 8 9 10
4
akzakr 1 2
fnmyi 3 10 11 12
tsnukk 2 1 8
yskwcnt 2 1 8
5
knmmdk 2 13 19
akmhmr 4 13 15 19 22
mksyk 6 3 7 12 13 15 19
skrkyk 3 1 4 8
tmemm 3 1 17 24
5
knmmdk 5 5 6 16 18 26
akmhmr 9 3 4 7 11 14 15 17 18 20
mksyk 5 6 13 25 27 28
skrkyk 4 3 16 23 24
tmemm 3 6 12 20
14
hrkamm 6 4 6 8 10 20 22
mkhsi 6 1 10 12 15 22 27
hbkgnh 2 4 9
chyksrg 8 3 4 12 15 16 20 25 28
mktkkc 6 0 1 8 15 17 20
tknsj 6 6 8 18 19 25 26
yyitktk 3 3 12 18
ykhhgwr 5 3 9 10 11 24
amftm 7 2 6 8 12 13 14 17
mmftm 4 6 12 16 18
rtkakzk 3 14 15 21
azsmur 7 1 2 4 12 15 18 20
iormns 2 4 20
ktrotns 6 7 12 14 17 20 25
14
hrkamm 2 4 21
mkhsi 6 2 3 8 11 18 20
hbkgnh 4 4 16 28 29
chyksrg 5 0 3 9 17 22
mktkkc 2 7 18
tknsj 3 3 9 23
yyitktk 3 10 13 25
ykhhgwr 2 18 26
amftm 3 13 18 22
mmftm 4 1 20 24 27
rtkakzk 2 1 10
azsmur 5 2 5 10 14 17
iormns 3 9 15 16
ktrotns 5 7 12 16 17 20
0
Sample output
7 akzakr
4 akzakr
6 knmmdk
12 tmemm
19 iormns
24 mktkkc
The University of Aizu Programming Contest 2011 Summer
原案: Tomoya Sakai
問題文: Takashi Tayama
|
[
{
"submission_id": "aoj_1074_1713165",
"code_snippet": "#include<bits/stdc++.h>\n#define N 20\n#define M 31\nusing namespace std;\ntypedef pair<string,int> P;\n\nint n,cnt[M],point[N],k,m,tim,minp;\nvector<P> t[N];\nstring s;\n\nint main(){\n while(1){\n cin>>n;\n if(!n)break;\n for(int i=0;i<M;i++)cnt[i]=0;\n for(int i=0;i<n;i++){\n cin>>s;\n cin>>m;\n for(int j=0;j<m;j++){\n\tcin>>tim;\n\tt[i].push_back(P(s,tim));\n\tcnt[tim]++;\n }\n point[i]=0;\n }\n minp=(1e9);\n sort(t,t+n);\n for(int i=0;i<n;i++){\n for(int j=0;j<t[i].size();j++){\n\tint idx=t[i][j].second;\n\tpoint[i]+=n-cnt[idx]+1;\n }\n minp=min(minp,point[i]);\n }\n vector<string> v;\n for(int i=0;i<n;i++){\n if(minp==point[i]){\n\tv.push_back(t[i][0].first);\n\tbreak;\n }\n }\n sort(v.begin(),v.end());\n cout<<minp<<' '<<v[0]<<endl;\n for(int i=0;i<n;i++)t[i].clear();\n }\n return 0;\n}",
"accuracy": 0.5,
"time_ms": 10,
"memory_kb": 1244,
"score_of_the_acc": -1,
"final_rank": 2
},
{
"submission_id": "aoj_1074_909248",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <map>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n int n;\n while(cin >> n,n){\n map<string,vector<int> > d;\n map<string,vector<int> >::iterator itr;\n for(int i=0;i<n;i++){\n string s; int m; cin >> s >> m;\n for(int j=0;j<m;j++){\n\tint t; cin >> t;\n\td[s].push_back(t);\n }\n }\n int mini = (2 << 20); string name;\n for(itr=d.begin();itr!=d.end();itr++){\n int sum = 0;\n for(int i=0;i<(itr->second).size();i++){\n\tint cnt = 0;\n\tfor(map<string,vector<int> >::iterator it=d.begin();it!=d.end();it++){\n\t if(it == itr) continue;\n\t for(int j=0;j<(it->second).size();j++){\n\t if((itr->second)[i] == (it->second)[j]) cnt++;\n\t }\n\t}\n\tsum = sum + (cnt == n ? 1 : (n - cnt));\n }\n if(mini > sum){\n\tmini = sum; name = itr->first;\n }\n }\n cout << mini << \" \" << name << endl;\n }\n}",
"accuracy": 0.5,
"time_ms": 10,
"memory_kb": 1244,
"score_of_the_acc": -1,
"final_rank": 2
},
{
"submission_id": "aoj_1074_774511",
"code_snippet": "#include <iostream>\n#include <map>\nusing namespace std;\ntypedef pair<string,int>P;\nint main(){\n int n;\n while(cin >> n,n){\n int m,point[100];\n map< P, int>ve;\n fill(point,point+31,n+1);\n for(int k = 0 ; k < n ; k++ ){\n string name;\n cin >> name >> m;\n for(int i = 0 ; i < m ; i++ ){\n\tint a;\n\tcin >> a;\n\tve[P(name,a)]=1;\n\tpoint[a]--; \n }\n }\n map<string,int>ans;\n ans.clear();\n for(map< P,int >::iterator it = ve.begin() ; it != ve.end() ; it++ ){\n for(int j = 0 ; j < 30 ; j++ ){\n\tif((*it).second == 1 &&\n\t point[j] <= n &&\n\t (*it).first.second == j)ans[(*it).first.first]+=point[j];\n }\n }\n int mn = 100000000;\n string ansname; \n for(map<string,int>::iterator it = ans.begin() ; it != ans.end() ; it++ ){\n if(mn > (*it).second){\n\tmn = (*it).second;\n\tansname = (*it).first;\n }\n } \n cout << mn << ' ' << ansname << endl;\n }\n}",
"accuracy": 0.5,
"time_ms": 10,
"memory_kb": 1240,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_1066_cpp
|
Problem E: Legend of Storia
In Storia Kingdom, there is an artifact called "Perfect Sphere" made by a great meister Es. This is handed down for generations in the royal palace as a treasure. Es left a memo and filled mysterious values in it. Within achievements of researches, it has been revealed that the values denote coordinate values. However it is still unknown the definition of the coordinate system.
By the way, you are a person who lived in age of Es lived. The values which meister Es left are defined by following. Es set an moving object in the artifact sphere. Surprisingly, that is rigid body and perpetual organization. The object rotates inside the sphere and it is always touching the inside surface of the sphere. This value is a coordinate of the tangent point by the object and the sphere, but it is not a three dimensional value. The object is a plate and this is a simple polygon. Here, "simple" means "non self-intersected". This rotates while touching a great circle of the sphere. Here, assume that the great circle is a circle
O
centered in the origin in the xy plane. (It is two-dimensional Cartesian coordinate system, the direction of positive x-value is right and the direction of positive y-value is up). This plate touches the circle
O
with a single point at the beginning of the movement. And it rotates in counterclockwise as the current touching point is the rotation fulcrum. When another point
X
of the plate touches the circle
O
newly, the plate continue to rotate as described above, but in the next rotation, the rotation fulcrum point is changed. This will be the point
X
. If two or more points can be interpreted as the point
X
, the point
X
is a most distant point from the currently touching point
X'
. Here, that distance is the length of the arc of the circle
O
from the point
X'
to the point
X
in clockwise.
Es asked you, an excellent assistant, to write a program that enumerates
Q
tangent points (fulcrum points while the movement) by the plate and the circle
O
while the movement of the plate described above in the chronological order. Of course, one and the previous one must be distinct points. Following figures show you examples of the movement of the plate inside the circle
O
.
1
2
3
4
Input
Input consists of multiple datasets.
A dataset is given in a following format.
N
R
Q
x
1
y
1
x
2
y
2
...
x
N
y
N
N
,
R
,
Q
are integers that represent the number of points of the plate, the radius of the circle, and the number of points Es needs respectively.
Following
N
lines contain 2
N
integers that represent coordinates of the plate's points (
x
k
,
y
k
) in the circle.(1≤
k
≤
N
)
You can assume following conditions.
Points of the plate are given in counterclockwise.
No three points are co-linear.
N
-1 points of the plate are given inside of the circle (distances between the center of the circle and these points are less than
R
). And 1 point is on the circle edge.
N
=
R
=
Q
=0 shows the end of input.
Constraints
The number of dataset
...(truncated)
|
[
{
"submission_id": "aoj_1066_10851205",
"code_snippet": "#include<stdio.h>\n#include<string.h>\n#include<algorithm>\n#include<math.h>\n#define eps 1e-9\n#define PI acos(-1.0)\n#define M 100\nusing namespace std;\n\ntypedef struct N{\n\tdouble x,y;\n\tN(){;}\n\tN(double tx,double ty){\n\t\tx=tx; y=ty;\n\t}\n}Node;\n\nclass Geometry{\n\tpublic:\n\t\tint cort(double x){\n\t\t\tif(fabs(x)<=eps) return 0;\n\t\t\telse if(x>eps) return 1;\n\t\t\telse return -1;\n\t\t}\n\t\tdouble dist(Node a,Node b){//两点距离 \n\t\t\treturn sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));\n\t\t}\n\t\tdouble xmul(Node a,Node b,Node o){//(o,a),(o,b)叉积 \n\t\t\treturn (a.x-o.x)*(b.y-o.y)-(b.x-o.x)*(a.y-o.y);\n\t\t}\n\t\tdouble pmul(Node a,Node b,Node o){//(o,a),(o,b)点积 \n\t\t\treturn (a.x-o.x)*(b.x-o.x)+(a.y-o.y)*(b.y-o.y);\n\t\t}\n\t\tNode rotate(Node p,Node o,double alpha){//p绕o逆时针旋转alpha\n\t\t\tNode ans;\n\t\t\tp.x-=o.x; p.y-=o.y;\n\t\t\tans.x=p.x*cos(alpha)-p.y*sin(alpha)+o.x;\n\t\t\tans.y=p.y*cos(alpha)+p.x*sin(alpha)+o.y;\n\t\t\treturn ans;\n\t\t}\n\t\tdouble angle(Node a,Node b,Node o){//(o,a),(o,b)夹角 \n\t\t\tdouble cf,fi,norm;\n\t\t\tcf=pmul(a,b,o)/(dist(a,o)*dist(b,o));\n\t\t\t\n\t\t\tif(cf>=1.0) return 0;\n\t\t\telse if(cf<=-1.0) return PI;\n\t\t\telse return acos(cf);\n\t\t}\n};\n\nGeometry method;\nNode point[M+10];\ndouble calu(Node s,Node t,double r){\n\tNode ori(0.0,0.0);\n\tdouble dis=method.dist(s,t),alpha=2*asin(dis/(2*r));\n\tNode cross=method.rotate(s,ori,-alpha);\n\treturn method.angle(cross,t,s);\n}\nvoid solve(int &cur,int n,double r){\n\tint ct=(cur+1)%n;\n\tint nt=-1;\n\tdouble alpha;\n\twhile(ct!=cur){\n\t\tif(nt==-1||method.cort(alpha-calu(point[cur],point[ct],r))>0){\n\t\t\tnt=ct;\n\t\t\talpha=calu(point[cur],point[ct],r);\n\t\t}\n\t\tct=(ct+1)%n;\n\t}\n\tfor(int i=0;i<n;i++) point[i]=method.rotate(point[i],point[cur],alpha);\n\tcur=nt;\n}\n\nint main(){\n\tint n,q;\n\tdouble r;\n\twhile(scanf(\"%d%lf%d\",&n,&r,&q),n||r||q){\n\t\tfor(int i=0;i<n;i++) scanf(\"%lf%lf\",&point[i].x,&point[i].y);\n\t\t\n\t\tint cur;\n\t\tfor(int i=0;i<n;i++)\n\t\t\tif(method.cort(method.dist(point[i],Node(0.0,0.0))-r)>=0)\n\t\t\t\tcur=i;\n\t\t\n\t\twhile(q--){\n\t\t\tsolve(cur,n,r);\n\t\t\tprintf(\"%.12f %.12f\\n\",point[cur].x,point[cur].y);\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3360,
"score_of_the_acc": -0.8907,
"final_rank": 8
},
{
"submission_id": "aoj_1066_7937239",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)n; i++)\nusing namespace std;\ntypedef double D;\ntypedef complex<D> P;\nconst D EPS = 1e-8;\nint n, r, q, r2;\nP p[30];\nint cur;\nD min_s[30], SIN[30], COS[30], x, y;\ninline P rotate(const P &v, const D &s) {\n return P(real(v) * cos(s) - imag(v) * sin(s),\n real(v) * sin(s) + imag(v) * cos(s));\n}\ninline D arg(const P &a, const P &b, const P &c) {\n return real(conj(b - a) * (c - a)) / (abs(b - a) * abs(c - a));\n}\ninline D rot_seta(const int &end) {\n D seta = acos(1 - norm(p[end] - p[cur]) / r2);\n P nxt = rotate(p[cur], -seta);\n return arg(p[cur], p[end], nxt);\n}\nint main() {\n while (scanf(\"%d%d%d\", &n, &r, &q), n) {\n r2 = 2 * r * r;\n rep(i, n) {\n scanf(\"%lf%lf\", &x, &y);\n p[i] = P(x, y);\n if (abs(abs(p[i]) - r) < EPS)\n cur = i;\n }\n vector<int> nxt(n, -1);\n bool f = false;\n rep(i, q) {\n if (nxt[cur] >= 0)\n f = true;\n if (!f) {\n min_s[cur] = 5;\n rep(j, n) {\n if (cur == j)\n continue;\n D s = rot_seta(j);\n if (nxt[cur] < 0 || s > min_s[cur] + EPS)\n nxt[cur] = j, min_s[cur] = s;\n }\n min_s[cur] = acos(min_s[cur]);\n SIN[cur] = sin(min_s[cur]);\n COS[cur] = cos(min_s[cur]);\n }\n rep(j, n) {\n if (j == cur || (f && nxt[cur] < 0))\n continue;\n x = p[j].real() - p[cur].real();\n y = p[j].imag() - p[cur].imag();\n p[j] = P(x * COS[cur] - y * SIN[cur], x * SIN[cur] + y * COS[cur]) +\n p[cur];\n }\n printf(\"%.9lf %.9lf\\n\", p[nxt[cur]].real(), p[nxt[cur]].imag());\n if (!i) {\n int tmp = nxt[cur];\n nxt[cur] = -1;\n cur = tmp;\n } else {\n cur = nxt[cur];\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3540,
"score_of_the_acc": -0.943,
"final_rank": 11
},
{
"submission_id": "aoj_1066_7937238",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)n; i++)\nusing namespace std;\ntypedef double D;\ntypedef complex<D> P;\nconst D EPS = 1e-8;\nint n, r, q, r2;\nP p[30];\nint cur;\nD min_s[30], SIN[30], COS[30], x, y;\ninline P rotate(const P &v, const D &s) {\n return P(real(v) * cos(s) - imag(v) * sin(s),\n real(v) * sin(s) + imag(v) * cos(s));\n}\ninline D arg(const P &a, const P &b, const P &c) {\n return real(conj(b - a) * (c - a)) / (abs(b - a) * abs(c - a));\n}\ninline D rot_seta(const int &end) {\n D seta = acos(1 - norm(p[end] - p[cur]) / r2);\n P nxt = rotate(p[cur], -seta);\n return arg(p[cur], p[end], nxt);\n}\nint main() {\n while (scanf(\"%d%d%d\", &n, &r, &q), n) {\n r2 = 2 * r * r;\n rep(i, n) {\n scanf(\"%lf%lf\", &x, &y);\n p[i] = P(x, y);\n if (abs(abs(p[i]) - r) < EPS)\n cur = i;\n }\n vector<int> nxt(n, -1);\n bool f = false;\n rep(i, q) {\n if (nxt[cur] >= 0)\n f = true;\n if (!f) {\n min_s[cur] = 5;\n rep(j, n) {\n if (cur == j)\n continue;\n D s = rot_seta(j);\n if (nxt[cur] < 0 || s > min_s[cur] + EPS)\n nxt[cur] = j, min_s[cur] = s;\n }\n min_s[cur] = acos(min_s[cur]);\n SIN[cur] = sin(min_s[cur]);\n COS[cur] = cos(min_s[cur]);\n }\n rep(j, n) {\n if ((f && nxt[j] < 0) || j == cur)\n continue;\n x = p[j].real() - p[cur].real();\n y = p[j].imag() - p[cur].imag();\n p[j] = P(x * COS[cur] - y * SIN[cur], x * SIN[cur] + y * COS[cur]) +\n p[cur];\n }\n printf(\"%.9lf %.9lf\\n\", p[nxt[cur]].real(), p[nxt[cur]].imag());\n if (!i) {\n int tmp = nxt[cur];\n nxt[cur] = -1;\n cur = tmp;\n } else {\n cur = nxt[cur];\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3508,
"score_of_the_acc": -0.9295,
"final_rank": 9
},
{
"submission_id": "aoj_1066_7937237",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)n; i++)\nusing namespace std;\ntypedef double D;\ntypedef complex<D> P;\nconst D EPS = 1e-8;\nconst D PI = acos(-1);\nint n, r, q, r2;\nP p[30];\nint cur;\nD min_s[30], x, y;\ninline D dot(const P &x, const P &y) { return real(conj(x) * y); }\ninline P rotate(const P &v, const D &s) {\n return P(real(v) * cos(s) - imag(v) * sin(s),\n real(v) * sin(s) + imag(v) * cos(s));\n}\ninline D arg(const P &a, const P &b, const P &c) {\n return dot(b - a, c - a) / (abs(b - a) * abs(c - a));\n}\ninline D rot_seta(const int &end) {\n D seta = acos(1 - norm(p[end] - p[cur]) / r2);\n P nxt = rotate(p[cur], -seta);\n return arg(p[cur], p[end], nxt);\n}\nint main() {\n while (scanf(\"%d%d%d\", &n, &r, &q), n) {\n r2 = 2 * r * r;\n rep(i, n) {\n scanf(\"%lf%lf\", &x, &y);\n p[i] = P(x, y);\n if (abs(abs(p[i]) - r) < EPS)\n cur = i;\n }\n vector<int> nxt(n, -1);\n rep(i, q) {\n if (nxt[cur] < 0) {\n min_s[cur] = PI;\n rep(j, n) {\n if (cur == j)\n continue;\n D s = rot_seta(j);\n if (nxt[cur] < 0 || s > min_s[cur] + EPS)\n nxt[cur] = j, min_s[cur] = s;\n }\n min_s[cur] = acos(min_s[cur]);\n }\n rep(j, n) {\n if (j == cur)\n continue;\n p[j] = rotate(p[j] - p[cur], min_s[cur]) + p[cur];\n }\n printf(\"%.9lf %.9lf\\n\", p[nxt[cur]].real(), p[nxt[cur]].imag());\n if (i == 0) {\n int tmp = nxt[cur];\n nxt[cur] = -1;\n cur = tmp;\n } else {\n cur = nxt[cur];\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3584,
"score_of_the_acc": -0.9672,
"final_rank": 12
},
{
"submission_id": "aoj_1066_7937236",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)n; i++)\nusing namespace std;\ntypedef double D;\ntypedef complex<D> P;\nconst D EPS = 1e-8;\nint n, r, q, r2;\nP p[30];\nint cur;\nD min_s[30], x, y;\ninline D dot(const P &x, const P &y) { return real(conj(x) * y); }\ninline P rotate(const P &v, const D &s) {\n return P(real(v) * cos(s) - imag(v) * sin(s),\n real(v) * sin(s) + imag(v) * cos(s));\n}\ninline D arg(const P &a, const P &b, const P &c) {\n return dot(b - a, c - a) / (abs(b - a) * abs(c - a));\n}\ninline D rot_seta(const int &end) {\n D seta = acos(1 - norm(p[end] - p[cur]) / r2);\n P nxt = rotate(p[cur], -seta);\n return arg(p[cur], p[end], nxt);\n}\nint main() {\n while (scanf(\"%d%d%d\", &n, &r, &q), n) {\n r2 = 2 * r * r;\n rep(i, n) {\n scanf(\"%lf%lf\", &x, &y);\n p[i] = P(x, y);\n if (abs(abs(p[i]) - r) < EPS)\n cur = i;\n }\n vector<int> nxt(n, -1);\n bool f = false;\n rep(i, q) {\n if (nxt[cur] >= 0)\n f = true;\n if (!f) {\n min_s[cur] = 5;\n rep(j, n) {\n if (cur == j)\n continue;\n D s = rot_seta(j);\n if (nxt[cur] < 0 || s > min_s[cur] + EPS)\n nxt[cur] = j, min_s[cur] = s;\n }\n min_s[cur] = acos(min_s[cur]);\n }\n rep(j, n) {\n if (j == cur || (f && nxt[cur] < 0))\n continue;\n p[j] = rotate(p[j] - p[cur], min_s[cur]) + p[cur];\n }\n printf(\"%.9lf %.9lf\\n\", p[nxt[cur]].real(), p[nxt[cur]].imag());\n if (i == 0) {\n int tmp = nxt[cur];\n nxt[cur] = -1;\n cur = tmp;\n } else {\n cur = nxt[cur];\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3504,
"score_of_the_acc": -0.9395,
"final_rank": 10
},
{
"submission_id": "aoj_1066_7937235",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)n; i++)\n#define EQ(a, b) (abs((a) - (b)) < EPS)\nusing namespace std;\ntypedef double D;\ntypedef complex<D> P;\nconst D EPS = 1e-8;\nconst D PI = acos(-1);\nint n, r, q;\nP p[30];\nint cur;\ninline D dot(const P &x, const P &y) { return real(conj(x) * y); }\ninline P rotate(const P &v, const D &s) {\n return P(real(v) * cos(s) - imag(v) * sin(s),\n real(v) * sin(s) + imag(v) * cos(s));\n}\ninline D arg(const P &a, const P &b, const P &c) {\n return acos(dot(b - a, c - a) / (abs(b - a) * abs(c - a)));\n}\ninline D rot_seta(const int &end) {\n D dis = abs(p[end] - p[cur]);\n D seta = acos((2 * r * r - dis * dis) / (2 * r * r));\n P nxt = rotate(p[cur], -seta);\n return arg(p[cur], p[end], nxt);\n}\nint main() {\n while (cin >> n >> r >> q, n) {\n rep(i, n) {\n D x, y;\n cin >> x >> y;\n p[i] = P(x, y);\n if (EQ(abs(p[i]), r))\n cur = i;\n }\n vector<int> nxt(n, -1);\n rep(i, q) {\n int id = -1;\n D min_s = PI;\n if (nxt[cur] >= 0)\n id = nxt[cur];\n else {\n rep(j, n) {\n if (cur == j)\n continue;\n D s = rot_seta(j);\n if (id < 0 || s + EPS < min_s)\n id = j, min_s = s;\n }\n nxt[cur] = id;\n }\n D seta = rot_seta(id);\n rep(i, n) {\n if (i == cur)\n continue;\n p[i] = rotate(p[i] - p[cur], seta) + p[cur];\n }\n cout << fixed << setprecision(10) << p[id].real() << \" \" << p[id].imag()\n << endl;\n cur = id;\n }\n }\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3592,
"score_of_the_acc": -0.988,
"final_rank": 15
},
{
"submission_id": "aoj_1066_7937212",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)n; i++)\nusing namespace std;\ntypedef double D;\ntypedef complex<D> P;\nconst D EPS = 1e-8;\nconst D PI = acos(-1);\nint n, r, q, r2;\nP p[30];\nint cur;\ninline D dot(const P &x, const P &y) { return real(conj(x) * y); }\ninline P rotate(const P &v, const D &s) {\n return P(real(v) * cos(s) - imag(v) * sin(s),\n real(v) * sin(s) + imag(v) * cos(s));\n}\ninline D arg(const P &a, const P &b, const P &c) {\n return acos(dot(b - a, c - a) / (abs(b - a) * abs(c - a)));\n}\ninline D rot_seta(const int &end) {\n D dis = norm(p[end] - p[cur]);\n D seta = acos((r2 - dis) / (r2));\n P nxt = rotate(p[cur], -seta);\n return arg(p[cur], p[end], nxt);\n}\nint main() {\n while (scanf(\"%d%d%d\", &n, &r, &q), n) {\n r2 = 2 * r * r;\n rep(i, n) {\n D x, y;\n scanf(\"%lf%lf\", &x, &y);\n p[i] = P(x, y);\n if (abs(abs(p[i]) - r) < EPS)\n cur = i;\n }\n vector<int> nxt(n, -1);\n rep(i, q) {\n int id = -1;\n D min_s = PI;\n if (nxt[cur] >= 0)\n id = nxt[cur];\n else {\n rep(j, n) {\n if (cur == j)\n continue;\n D s = rot_seta(j);\n if (id < 0 || s + EPS < min_s)\n id = j, min_s = s;\n }\n nxt[cur] = id;\n }\n D seta = rot_seta(id);\n rep(i, n) {\n if (i == cur)\n continue;\n p[i] = rotate(p[i] - p[cur], seta) + p[cur];\n }\n printf(\"%.9lf %.9lf\\n\", p[id].real(), p[id].imag());\n cur = id;\n }\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3588,
"score_of_the_acc": -0.9747,
"final_rank": 13
},
{
"submission_id": "aoj_1066_7937211",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)n; i++)\nusing namespace std;\ntypedef double D;\ntypedef complex<D> P;\nconst D EPS = 1e-8;\nint n, r, q, r2;\nP p[30];\nint cur;\nD min_s[30], x, y;\ninline D dot(const P &x, const P &y) { return real(conj(x) * y); }\ninline P rotate(const P &v, const D &s) {\n return P(real(v) * cos(s) - imag(v) * sin(s),\n real(v) * sin(s) + imag(v) * cos(s));\n}\ninline D arg(const P &a, const P &b, const P &c) {\n return dot(b - a, c - a) / (abs(b - a) * abs(c - a));\n}\ninline D rot_seta(const int &end) {\n D seta = acos(1 - norm(p[end] - p[cur]) / r2);\n P nxt = rotate(p[cur], -seta);\n return arg(p[cur], p[end], nxt);\n}\nint main() {\n while (scanf(\"%d%d%d\", &n, &r, &q), n) {\n r2 = 2 * r * r;\n rep(i, n) {\n scanf(\"%lf%lf\", &x, &y);\n p[i] = P(x, y);\n if (abs(abs(p[i]) - r) < EPS)\n cur = i;\n }\n vector<int> nxt(n, -1);\n bool f = false;\n rep(i, q) {\n if (nxt[cur] >= 0)\n f = true;\n if (!f) {\n min_s[cur] = 5;\n rep(j, n) {\n if (cur == j)\n continue;\n D s = rot_seta(j);\n if (nxt[cur] < 0 || s > min_s[cur] + EPS)\n nxt[cur] = j, min_s[cur] = s;\n }\n min_s[cur] = acos(min_s[cur]);\n }\n rep(j, n) {\n if (j == cur || (f && nxt[cur] < 0))\n continue;\n p[j] = rotate(p[j] - p[cur], min_s[cur]) + p[cur];\n }\n printf(\"%.4lf %.4lf\\n\", p[nxt[cur]].real(), p[nxt[cur]].imag());\n if (i == 0) {\n int tmp = nxt[cur];\n nxt[cur] = -1;\n cur = tmp;\n } else {\n cur = nxt[cur];\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3604,
"score_of_the_acc": -0.9756,
"final_rank": 14
},
{
"submission_id": "aoj_1066_5921274",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\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\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\n\t/*void 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\n\nstruct Circle{\n\tPoint center;\n\tdouble r;\n};\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,num_Q;\ndouble R;\nCircle C;\nPoint point[30],work[30];\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\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 arg(Vector p){\n\treturn atan2(p.y,p.x);\n}\n\nVector polar(double a,double r){\n\treturn Point(cos(r)*a,sin(r)*a);\n}\n\n//円と円の交点\nvector<Point> getCrossPoints(Circle c1,Circle c2){\n\n\tvector<Point> res;\n\n\tdouble d = abs(c1.center-c2.center);\n\tdouble a = acos((c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d));\n\tdouble t = arg(c2.center-c1.center);\n\n\tres.push_back(Point(c1.center+polar(c1.r,t+a)));\n\tres.push_back(Point(c1.center+polar(c1.r,t-a)));\n\n\treturn res;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\n\n\n//2つのvectorがなすラジアンを求める関数\ndouble calc_rad(Vector vec1,Vector vec2){\n\n\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\ndouble calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\n/*点moveをbaseを中心にradラジアン回転させる\nrad > 0なら反時計回り、rad < 0なら時計周り\n*/\nPoint rotate(Point base,Point move,double rad){\n\n\tPoint ret;\n\tmove = move-base;\n\n\tret.x = move.x*cos(rad)-move.y*sin(rad);\n\tret.y = move.x*sin(rad)+move.y*cos(rad);\n\n\tret = ret+base;\n\n\treturn ret;\n}\n\nvoid func(){\n\n\tC.r = R;\n\n\tvector<Point> ANS;\n\n\tint base = -1;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&point[i].x,&point[i].y);\n\t\tdouble tmp_dist = calc_dist(C.center,point[i]);\n\n\t\tif(fabs(tmp_dist-R) < EPS){\n\n\t\t\tbase = i;\n\t\t}\n\t}\n\n\tCircle TMP;\n\n\tfor(int loop = 0; loop < num_Q; loop++){\n\n\t\tTMP.center = point[base];\n\n\t\tdouble mini = 3*M_PI;\n\t\tint next_base = -1;\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(i == base)continue;\n\n\t\t\tTMP.r = calc_dist(point[base],point[i]);\n\n\t\t\tvector<Point> vec = getCrossPoints(C,TMP);\n\n\t\t\tdouble tmp_rad;\n\n\t\t\t//★point[i] == vec[0]の場合に注意★\n\t\t\tif(calc_dist(point[i],vec[0]) > EPS && ccw(point[base],point[i],vec[0]) == COUNTER_CLOCKWISE){\n\n\t\t\t\ttmp_rad = calc_rad(point[base],point[i],vec[0]);\n\n\t\t\t}else{\n\n\t\t\t\ttmp_rad = calc_rad(point[base],point[i],vec[1]);\n\t\t\t}\n\n\t\t\tif(mini > tmp_rad+EPS){\n\n\t\t\t\tmini = tmp_rad;\n\t\t\t\tnext_base = i;\n\t\t\t}\n\t\t}\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(i == base){\n\n\t\t\t\twork[i] = point[i];\n\t\t\t}else{\n\n\t\t\t\twork[i] = rotate(point[base],point[i],mini);\n\t\t\t}\n\t\t}\n\n\t\tbase = next_base;\n\n\t\tprintf(\"%.10lf %.10lf\\n\",work[base].x,work[base].y);\n\t\tfor(int i = 0; i < N; i++){\n\n\t\t\tpoint[i] = work[i];\n\t\t}\n\t}\n}\n\n\nint main(){\n\n\tC.center = Point(0,0);\n\n\twhile(true){\n\n\t\tscanf(\"%d %lf %d\",&N,&R,&num_Q);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 3600,
"score_of_the_acc": -1.0611,
"final_rank": 17
},
{
"submission_id": "aoj_1066_5921273",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\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\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\n\t/*void 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\n\nstruct Circle{\n\tPoint center;\n\tdouble r;\n};\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,num_Q;\ndouble R;\nCircle C;\nPoint point[30],work[30];\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\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 arg(Vector p){\n\treturn atan2(p.y,p.x);\n}\n\nVector polar(double a,double r){\n\treturn Point(cos(r)*a,sin(r)*a);\n}\n\n//円と円の交点\nvector<Point> getCrossPoints(Circle c1,Circle c2){\n\n\tvector<Point> res;\n\n\tdouble d = abs(c1.center-c2.center);\n\tdouble a = acos((c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d));\n\tdouble t = arg(c2.center-c1.center);\n\n\tres.push_back(Point(c1.center+polar(c1.r,t+a)));\n\tres.push_back(Point(c1.center+polar(c1.r,t-a)));\n\n\treturn res;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\n\n\n//2つのvectorがなすラジアンを求める関数\ndouble calc_rad(Vector vec1,Vector vec2){\n\n\tdouble tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\ndouble calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\n/*点moveをbaseを中心にradラジアン回転させる\nrad > 0なら反時計回り、rad < 0なら時計周り\n*/\nPoint rotate(Point base,Point move,double rad){\n\n\tPoint ret;\n\tmove = move-base;\n\n\tret.x = move.x*cos(rad)-move.y*sin(rad);\n\tret.y = move.x*sin(rad)+move.y*cos(rad);\n\n\tret = ret+base;\n\n\treturn ret;\n}\n\nvoid func(){\n\n\tC.r = R;\n\n\tvector<Point> ANS;\n\n\tint base = -1;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&point[i].x,&point[i].y);\n\t\tdouble tmp_dist = calc_dist(C.center,point[i]);\n\n\t\tif(fabs(tmp_dist-R) < EPS){\n\n\t\t\tbase = i;\n\t\t\t//printf(\"最初の base:%d\\n\",base);\n\t\t}\n\t}\n\n\tCircle TMP;\n\n\tfor(int loop = 0; loop < num_Q; loop++){\n\n\t\tTMP.center = point[base];\n\t\t//printf(\"\\nloop:%d center:%.3lf %.3lf\\n\",loop,point[base].x,point[base].y);\n\n\t\tdouble mini = 3*M_PI;\n\t\tint next_base = -1;\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(i == base)continue;\n\n\t\t\tTMP.r = calc_dist(point[base],point[i]);\n\n\t\t\tvector<Point> vec = getCrossPoints(C,TMP);\n\n\t\t\t/*//printf(\"\\n点:%d\\n\",i);\n\t\t\t//point[i].debug();\n\t\t\tprintf(\"vec[0]:\");\n\t\t\tvec[0].debug();\n\t\t\tprintf(\"vec[1]:\");\n\t\t\tvec[1].debug();*/\n\n\t\t\tdouble tmp_rad;\n\n\t\t\tif(calc_dist(point[i],vec[0]) > EPS && ccw(point[base],point[i],vec[0]) == COUNTER_CLOCKWISE){\n\n\t\t\t\t//printf(\"vec[0]を選んだ\\n\");\n\t\t\t\ttmp_rad = calc_rad(point[base],point[i],vec[0]);\n\n\t\t\t}else{\n\t\t\t\t//printf(\"vec[1]を選んだ\\n\");\n\t\t\t\ttmp_rad = calc_rad(point[base],point[i],vec[1]);\n\t\t\t}\n\t\t\t//printf(\"tmp_rad:%.3lf\\n\",tmp_rad);\n\n\t\t\tif(mini > tmp_rad+EPS){\n\n\t\t\t\tmini = tmp_rad;\n\t\t\t\tnext_base = i;\n\t\t\t}\n\t\t}\n\n\t\t//printf(\"mini:%.3lf\\n\",mini);\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(i == base){\n\n\t\t\t\twork[i] = point[i];\n\t\t\t}else{\n\n\t\t\t\twork[i] = rotate(point[base],point[i],mini);\n\t\t\t}\n\t\t}\n\n\t\t//反時計回りで最も近い点\n\t\t/*for(int i = 1; i <= N-1; i++){\n\n\t\t\tint k = (base+i)%N;\n\t\t\tdouble tmp_dist = calc_dist(C.center,work[k]);\n\n\t\t\t//printf(\"k:%d tmp_dist:%.3lf\\n\",k,tmp_dist);\n\n\t\t\tif(fabs(tmp_dist-R) < EPS){\n\n\t\t\t\tbase = k;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}*/\n\n\t\tbase = next_base;\n\n\t\tprintf(\"%.10lf %.10lf\\n\",work[base].x,work[base].y);\n\t\tfor(int i = 0; i < N; i++){\n\n\t\t\tpoint[i] = work[i];\n\t\t}\n\t}\n}\n\n\nint main(){\n\n\tC.center = Point(0,0);\n\n\twhile(true){\n\n\t\tscanf(\"%d %lf %d\",&N,&R,&num_Q);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 3640,
"score_of_the_acc": -1.0721,
"final_rank": 19
},
{
"submission_id": "aoj_1066_3057105",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\nconst double EPS = 1e-10;\nconst double INF = 1e12;\nconst double PI = acos(-1);\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\n\ntypedef complex<double> P;\ntypedef vector<P> VP;\nstruct C{\n P p;\n double r;\n C(const P& p, const double& r) : p(p), r(r) {}\n C(){}\n};\n\nP unit(const P &a){\n return a/abs(a);\n}\ndouble getangle(P a, P b){\n return abs(arg(a/b));\n}\nVP crosspointCC(C a, C b){\n VP ret;\n double dist = abs(b.p-a.p);\n P dir = a.r*unit(b.p-a.p);\n double cos = (a.r*a.r +dist*dist -b.r*b.r)/(2*a.r*dist);\n double sin = sqrt(1 -cos*cos);\n ret.push_back(a.p +dir*P(cos, sin));\n ret.push_back(a.p +dir*P(cos, -sin));\n return ret;\n}\n\nint main(){\n while(1){\n int n,q;\n double r;\n cin >> n >> r >> q;\n if(n==0) break;\n\n VP p(n);\n for(int i=0; i<n; i++){\n double x,y;\n cin >> x >> y;\n p[i] = P(x, y);\n }\n int st=-1;\n for(int i=0; i<n; i++){\n if(EQ(abs(p[i]), r)){\n st = i;\n break;\n }\n }\n\n for(int i=0; i<q; i++){\n double minangle = INF;\n int minidx = -1;\n P center = p[st];\n for(int j=0; j<n; j++){\n if(j == st) continue;\n VP cp = crosspointCC(C(center, abs(p[j] -center)), C(P(0,0), r));\n double angle = getangle(cp[0] -center, p[j] -center);\n if(angle < minangle){\n minangle = angle;\n minidx = j;\n }\n }\n P rot = P(cos(minangle), sin(minangle));\n st = minidx;\n for(int j=0; j<n; j++){\n p[j] -= center;\n p[j] *= rot;\n p[j] += center;\n }\n cout << fixed << setprecision(10);\n cout << p[st].X << \" \" << p[st].Y << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3676,
"score_of_the_acc": -1.064,
"final_rank": 18
},
{
"submission_id": "aoj_1066_2645154",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define r(i,n) for(int i=0;i<n;i++)\ntypedef double D;\ntypedef complex<D> P;\ntypedef vector<P>VP;\nconst D EPS = 1e-9;\n#define X real()\n#define Y imag()\n#define EQ(n,m) (abs(n-m)<EPS)\nD dot(P a,P b){return (conj(a)*b).X;}\nD cross(P a,P b){return (conj(a)*b).Y;}\nint ccw(P a,P b,P c){\n b-=a;c-=a;\n if(cross(b,c)>EPS)return 1;\n if(cross(b,c)< -EPS)return -1;\n if(dot(b,c)< -EPS)return 2;\n if(norm(b)<norm(c))return -2;\n}\nVP crosspointCC(P a, D ar, P b, D br) {\n VP ps;\n P ab=b-a;\n D d=abs(ab);\n D crL=(norm(ab)+ar*ar-br*br)/(2*d);\n if(EQ(d,0)||ar<abs(crL))return ps;\n P abN=ab*P(0,sqrt(ar*ar-crL*crL)/d);\n P cp=a+crL/d*ab;\n ps.push_back(cp + abN);\n if(!EQ(norm(abN),0)) ps.push_back(cp-abN);\n return ps;\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}\nVP convexHull(VP ps){\n int n=ps.size(),k=0;\n sort(ps.begin(),ps.end());\n VP ch(2*n);\n for(int i=0;i<n;ch[k++]=ps[i++])\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--])\n while(k>=t&&ccw(ch[k-2],ch[k-1],ps[i])<=0)--k;\n ch.resize(k-1);\n return ch;\n}\n\nP rot(P p, double a,double x,double y){\n a=a*M_PI/180.0;\n P p1=P(x,y);\n p-=p1;\n return P(p.X*cos(a)+p.Y*(-sin(a))+x,p.X*sin(a)+p.Y*cos(a)+y);\n}\n\nint n,q;\nD r;\n\nint main(){\n //cout<<acos(cos(M_PI))/M_PI*180<<endl;\n while(cin>>n>>r>>q,n){\n VP v;\n r(i,n){\n double x,y;\n cin>>x>>y;\n v.push_back(P(x,y));\n }\n v=convexHull(v);\n int p;\n double t=1e9;\n double y,x;\n r(i,v.size()){\n if(v[i].Y<t){\n x=v[i].X;\n y=v[i].Y;\n t=v[i].Y;\n p=i;\n }\n }\n //for(int i=p,c=0;c<4;i=(i+1)%4,c++){\n //cout<<v[i].X<<' '<<v[i].Y<<endl;\n //}\n r(i,q){//cout<<p<<endl;\n int ppp=p;\n for(;;p=(p-1+v.size())%v.size()){//cout<<p<<endl;\n VP p1=crosspointCC( P(0,0) ,r , P(x,y) , abs(v[ppp]-v[(p-1+v.size())%v.size()]) );\n P pt;\n if(ccw(p1[0],P(x,y),P(0,0))==1)pt=p1[0];\n else pt=p1[1];\n // r(k,2){\n //cout<<pt.X<<' '<<pt.Y<<endl;\n //cout<<v[(p-1+v.size())%v.size()].X<<' '<<v[(p-1+v.size())%v.size()].Y<<endl;\n //}//cou\n D a=abs(v[ppp]-v[(p-1+v.size())%v.size()]);\n // D b=abs(v[p]-v[(p+1)%v.size()]);\n D c=abs(v[(p-1+v.size())%v.size()]-pt)*abs(v[(p-1+v.size())%v.size()]-pt);\n\n //cout<<sqrt(c)<<endl;\n //return 0;\n \n double radi=acos((a*a+a*a-c)/(2*a*a));\n\n // cout<<a<<endl;\n \n radi=radi/M_PI*180;\n //cout<<radi<<endl;\n \n VP vt=v;\n\n r(k,vt.size()){\n\tvt[k]=rot(vt[k],radi,x,y);\n }\n \n int flag=0;\n r(k,vt.size()){\n\tif(abs(vt[k]-P(0,0))-EPS>r)flag++;\n }\n if(flag)continue;\n v=vt;\n y=v[(p-1+v.size())%v.size()].Y;\n x=v[(p-1+v.size())%v.size()].X;\n printf(\"%.12f %.12f\\n\",x,y);\n p=(p-1+v.size())%v.size();\n break;\n }\n }\n}\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3616,
"score_of_the_acc": -0.9923,
"final_rank": 16
},
{
"submission_id": "aoj_1066_1982566",
"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-7;\n\n\n/* ??????????????¬ */\n\n#include <complex>\n\ntypedef complex<ld> Point;\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define all(x) (x).begin(),(x).end()\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 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\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:??????\n//c:????????§??????\n//???????????´?????????????????¢?????????????±??????????\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* ??? */\n\n// ?????¨????????????\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n//???????????????????????????\n/* 0 => out\n1 => on\n2 => in*/\nint is_in_Circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n//???lc??????rc??????????????????\n/*0 => out\n1 => on\n2 => in*/\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// ?????¨??´????????????\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// ?????¨??????????????¢\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), 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//??????????????????????????¢???\nld two_Circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* ????§???¢ */\n\ntypedef vector<Point> Polygon;\n\n// ??¢???\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/*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\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//??????????????????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\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) != 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\n/* ??¢??¬??????????????? */\nvoid add_Point(vector<Point> &ps, const Point p) {\n\tfor (Point q : ps) if (abs(q - p) < eps) return;\n\tps.push_back(p);\n}\n\ntypedef int Weight;\nstruct edge {\n\tint src, dst;\n\tWeight weight;\n\tedge(int src, int dst, Weight weight) :\n\t\tsrc(src), dst(dst), weight(weight) { }\n};\n\ntypedef vector<edge> edges;\ntypedef vector<edges> graph;\n\nvoid add_edge(graph &g, const int from, const int to, const Weight& weight) {\n\tg[from].push_back(edge{ from, to, weight });\n}\n\ngraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\n\tint n = p.size(), m = s.size();\n\tgraph g(n);\n\trep(i, m) {\n\t\tvector<pair<ld, int>> vec;\n\t\trep(j, n) if (isis_sp(s[i], p[j]))\n\t\t\tvec.emplace_back(abs(s[i].a - p[j]), j);\n\t\tsort(all(vec));\n\t\trep(j, vec.size() - 1) {\n\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n\t\t\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\n\t\t}\n\t}\n\treturn g;\n}\ngraph sennbunn_arrangement(const vector<Line>&s) {\n\tvector<Point>crss;\n\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\n\t\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\n\t\t\tif (isis_ss(s[i], s[j])) {\n\t\t\t\tcrss.push_back(is_ll2(s[i], s[j])[0]);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\n\t\tcrss.push_back(s[i][0]);\n\t\tcrss.push_back(s[i][1]);\n\t}\nsort(crss.begin(), crss.end());\ncrss.erase(unique(crss.begin(), crss.end()), crss.end());\n\treturn segment_arrangement(s, crss);\n}\n\ngraph Circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\n\tint n = p.size(), m = c.size();\n\tgraph g(n);\n\trep(i, m) {\n\t\tvector<pair<ld, int>> vec;\n\t\trep(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\n\t\t\tvec.emplace_back(arg(c[i].p - p[j]), j);\n\t\tsort(all(vec));\n\t\trep(j, vec.size() - 1) {\n\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n\t\t\tld angle = vec[j + 1].first - vec[j].first;\n\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n\t\t}\n\t\tif (vec.size() >= 2) {\n\t\t\tint from = vec.back().second, to = vec.front().first;\n\t\t\tld angle = vec.front().first - vec.back().first;\n\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n\t\t}\n\t}\n\treturn g;\n} \n\nbool check(const int cen_id, const vector<Point>&poly,const Circle&c,const ld theta) {\n\tvector<Point> nextpoly(poly);\n\tfor (auto& c : nextpoly) {\n\t\tc = poly[cen_id]+ (c - poly[cen_id])*Point(cos(theta), sin(theta));\n\t}\n\tfor (int i = 0; i < nextpoly.size(); ++i) {\n\t\tif (abs(nextpoly[i])>c.r+eps/10) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main() {\n\tcout << fixed << setprecision(12);\n\twhile (1) {\n\t\tint N, R, Q; cin >> N >> R >> Q;\n\t\tif (!N)break;\n\t\tCircle c(Point(0, 0), R);\n\t\tvector<Point>poly;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint x, y; cin >> x >> y;\n\t\t\tpoly.emplace_back(x, y);\n\t\t}\n\t\tQ++;\n\t\tvector<Point>anss;\n\t\tint from = -1;\n\n\t\twhile (Q--) {\n\t\t\tint s = -1;\n\t\t\tld dis = 0;\n\t\t\tfor (int i = 0; i < N;++i) {\n\t\t\t\tPoint p(poly[i]);\n\t\t\t\tld aa = abs(abs(p) - R);\n\t\t\t\tif (abs(abs(p) - R)<eps&&from != i) {\n\t\t\t\t\tif (from != -1) {\n\t\t\t\t\t\tld adis = abs(poly[from] - p);\n\t\t\t\t\t\tif (dis + eps < adis) {\n\t\t\t\t\t\t\ts = i;\n\t\t\t\t\t\t\tdis = adis;\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 = i;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tPoint center = poly[s];\n\t\t\tanss.emplace_back(center);\n\t\t\t\n\n\t\t\tld amin = 0;\n\t\t\tld amax = pi;\n\n\t\t\tint num =51;\n\t\t\twhile (num--) {\n\t\t\t\tld amid = (amin + amax) / 2;\n\t\t\t\tif (check(s, poly, c, amid)) {\n\t\t\t\t\tamin = amid;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamax = amid;\n\t\t\t\t}\n\t\t\t}\n\n\n\t\t\tvector<Point> nextpoly(poly);\n\t\t\tfor (auto& c : nextpoly) {\n\t\t\t\tc = poly[s] + (c - poly[s])*Point(cos(amin), sin(amin));\n\t\t\t}\n\t\t\tpoly = nextpoly;\n\t\t\tfrom = s;\n\t\t}\n\t\tfor (int i = 1; i < anss.size(); ++i) {\n\t\t\tcout << anss[i].real() << \" \" << anss[i].imag() << endl;\n\t\t}\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 1750,
"memory_kb": 3496,
"score_of_the_acc": -1.9245,
"final_rank": 20
},
{
"submission_id": "aoj_1066_1148012",
"code_snippet": "#include <string> \n#include <algorithm> \n#include <cfloat> \n#include <climits> \n#include <cmath> \n#include <complex> \n#include <cstdio> \n#include <cstdlib> \n#include <cstring> \n#include <functional> \n#include <iostream> \n#include <map> \n#include <memory> \n#include <queue> \n#include <set> \n#include <sstream> \n#include <stack> \n#include <utility> \n#include <vector> \n\n#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define ALL(x) (x).begin(),(x).end() \ntypedef long long ll;\nusing namespace std; \nconst double eps = 1e-10;\n\ntypedef complex<double> P;\nnamespace std{\n bool operator<(const P &a, const P &b){\n if(a.real() == b.real()) return a.imag() < b.imag();\n else return a.real() < b.real();\n }\n}\ninline double dot(const P &a, const P &b){\n return real(conj(a) * b);\n}\ninline double cross(const P &a, const P &b){\n return imag(conj(a) * b);\n}\nint ccw(const P &a, P b, P c){\n b -= a; 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) < 0) return +2; // c-a-b\n if (norm(b) < norm(c)) return -2; // a-b-c\n return 0; // a-c-b\n}\nstruct Line : public vector<P> {\n Line() { }\n Line(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n};\ninline bool parallel(const Line &s, const Line &t){\n return abs(cross(s[1]-s[0], t[1]-t[0])) < eps;\n}\ninline bool orthogonal(const Line &s, const Line &t){\n return abs(dot(s[1]-s[0], t[1]-t[0])) < eps;\n}\nP projection(const Line &s, const P &a){\n P v = s[1] - s[0];\n return s[0] + dot(v, a - s[0]) / abs(v) / abs(v) * v;\n}\nP reflection(const Line &s, const P &a){\n P p = projection(s, a);\n return 2.0 * p - a;\n}\nstruct Segment : public Line {\n Segment(const P &a, const P &b) : Line(a,b) { }\n};\nstruct Circle{\n P o;\n double r;\n Circle() { }\n Circle(const P &o, double r) : o(o), r(r) { }\n Circle(double x, double y, double r) : o(x,y), r(r) { }\n inline bool contains(const P &p) const{\n return abs(p-o) < r + eps;\n }\n inline bool inside(const P &p) const{\n return abs(p-o) < r - eps;\n }\n pair<Line,Line> tangent(const P &p) const{\n vector<Line> res;\n double d = abs(p - o), s = r*r / d, t = sqrt(r*r-s*s);\n P q = o + s/d * (p - o), e = (p - o) * P(0, 1/d); \n return make_pair(Line(p,q+e*t), Line(p,q-e*t));\n }\n};\ntypedef vector<P> Polygon;\n#define curr(p,i) p[i]\n#define next(p,i) p[(i+1)%p.size()]\n\npair<P,P> crosspointCC(const Circle &a, const Circle &b){\n double d = abs(b.o - a.o);\n double x = (a.r * a.r - b.r * b.r + d * d) / (d * 2);\n P v = (b.o - a.o) * (1.0 / d);\n P n = P(0,1) * v;\n double h = sqrt(a.r * a.r - x * x);\n return make_pair(a.o + v * x + n * h,\n a.o + v * x - n * h);\n}\n\nPolygon convex_hull(vector<P> &ps){\n int n = ps.size(), k = 0;\n sort(ALL(ps));\n vector<P> qs(n*2);\n for(int i = 0; i < n; qs[k++] = ps[i++])\n while(k > 1 && ccw(qs[k-2], qs[k-1], ps[i]) <= 0) --k;\n for(int i = n-2, t=k; i >= 0; qs[k++] = ps[i--])\n while(k>t && ccw(qs[k-2],qs[k-1], ps[i]) <= 0) --k;\n qs.resize(k-1);\n return qs;\n}\n\nP rotate(P &p, P &o, double theta){\n return o + (p - o) * polar(1.0, theta);\n}\n\nint N, R, Q;\nvoid solve(Polygon &pol){\n Circle O(P(0,0), R);\n Polygon p = convex_hull(pol);\n N = p.size();\n\n int idx = 0;\n for(int i = 1; i < N; ++i) if(abs(p[i]) > abs(p[idx])) idx = i;\n // for(int i = 0; i < N; ++i) printf(\"(%.10f %.10f\\n\", p[i].real(), p[i].imag());\n for(int _ = 0; _ < Q; ++_){\n int nidx = idx;\n double ph = -1;\n for(int i = (idx + N-1) % N; i != idx; i = (i+N-1)%N){\n pair<P, P> pp = crosspointCC(Circle(p[idx], abs(p[i]-p[idx])), O);\n double t = dot(pp.first-p[idx], p[i]-p[idx]) / abs(p[i]-p[idx]) / abs(p[i]-p[idx]);\n // cout << \"[\" << pp.first.real() << \",\" << pp.second.imag() << \",\" << t << endl;\n if(t > ph-eps){ nidx = i; ph = t; }\n }\n for(int i = 0; i < N; ++i) p[i] = rotate(p[i], p[idx], acos(ph));\n // cout << \">\" << nidx << endl;\n // cout << abs(p[nidx]) << endl;\n idx = nidx;\n printf(\"%.10f %.10f\\n\", p[idx].real(), p[idx].imag());\n // for(int i = 0; i < N; ++i) printf(\"(%.10f %.10f\\n\", p[i].real(), p[i].imag());\n }\n}\nint main(){\n for(;;){\n cin >> N >> R >> Q;\n if(N == 0) return 0;\n Polygon p;\n for(int i = 0; i < N; ++i){\n int x, y;\n cin >> x >> y;\n p.push_back(P(x,y));\n }\n solve(p);\n }\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1316,
"score_of_the_acc": -0.0275,
"final_rank": 3
},
{
"submission_id": "aoj_1066_990715",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\n\n#define X real()\n#define Y imag()\n\ntypedef long double D;\ntypedef complex<D> P;\nstruct L{P a, b;};\ntypedef vector<P> Pol;\n\nconst D EPS = 1e-8;\n\nint sig(D a, D b = 0) {return a < b - EPS ? -1 : a > b + EPS ? 1 : 0;}\n\nD arg(P base, P a, P b) {return arg((b - base) / (a - base));}\n\nint main() {\n while (true) {\n int n, q;\n D r;\n cin >> n >> r >> q;\n if (n == 0) break;\n Pol pol;\n rep (i, n) {\n D x, y;\n cin >> x >> y;\n pol.push_back(P(x, y));\n }\n int pre = -1;\n rep (_, q) {\n int k = -1;\n rep (i, n) if (i != pre && sig(abs(pol[i]), r) == 0) {\n\tk = i;\n\tbreak;\n }\n rep (i, n) if (i != k) {\n\tD theta = asin(abs(pol[k] - pol[i]) / 2 / r);\n\tP p = polar(r, arg(pol[k]) - theta * 2);\n\ttheta = arg(pol[k], pol[i], p);\n\tPol pol2;\n\trep (j, n) pol2.push_back(pol[k] + (pol[j] - pol[k]) * polar((D)1, theta));\n\trep (j, n) if (sig(abs(pol2[j]), r) > 0) goto next;\n\tprintf(\"%.12Lf %.12Lf\\n\", p.X, p.Y);\n\tpol = pol2;\n\tpre = k;\n\tbreak;\n next:;\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 510,
"memory_kb": 1292,
"score_of_the_acc": -0.2791,
"final_rank": 7
},
{
"submission_id": "aoj_1066_952067",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)n;i++)\nusing namespace std;\ntypedef double D;\ntypedef complex<D> P;\nconst D EPS = 1e-8;\n\nint n,r,q,r2;\nP p[30];\nint cur;\nD min_s[30],SIN[30],COS[30],x,y;\n\ninline P rotate(const P &v, const D &s){\n return P(real(v)*cos(s) - imag(v)*sin(s), real(v)*sin(s) + imag(v)*cos(s) );\n}\n\ninline D arg(const P &a,const P &b,const P &c){return real(conj(b-a)*(c-a))/(abs(b-a)*abs(c-a));}\n\ninline D rot_seta(const int &end){\n D seta = acos( 1 - norm(p[end]-p[cur])/r2 );\n P nxt = rotate(p[cur],-seta);\n return arg(p[cur],p[end],nxt);\n}\n\nint main(){\n while(scanf(\"%d%d%d\",&n,&r,&q), n){\n r2 = 2*r*r;\n rep(i,n){\n scanf(\"%lf%lf\",&x,&y);\n p[i] = P(x,y);\n if(abs(abs(p[i])-r)<EPS)cur = i;\n }\n \n vector<int> nxt(n,-1);\n bool f = false;\n\n rep(i,q){\n if(nxt[cur]>=0)f = true;\n\n if(!f){\n\tmin_s[cur] = 5;\n\trep(j,n){\n\t if(cur==j)continue;\n\t D s = rot_seta(j);\n\t if(nxt[cur]<0 || s > min_s[cur]+EPS)nxt[cur] = j, min_s[cur] = s;\n\t}\n\tmin_s[cur] = acos(min_s[cur]);\n\tSIN[cur] = sin(min_s[cur]); COS[cur] = cos(min_s[cur]);\n }\n\n rep(j,n){\n\tif( (!f || nxt[j]>=0) && j!=cur){\n\t x = p[j].real()-p[cur].real(); y = p[j].imag()-p[cur].imag();\n\t p[j] = P(x*COS[cur] - y*SIN[cur] + p[cur].real(), x*SIN[cur] + y*COS[cur] + p[cur].imag());\n\t}\n }\n printf(\"%.9lf %.9lf\\n\",p[nxt[cur]].real(), p[nxt[cur]].imag());\n\n if(!i){\n\tint tmp = nxt[cur];\n\tnxt[cur] = -1;\n\tcur = tmp;\n }else{\n\tcur = nxt[cur];\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1336,
"score_of_the_acc": -0.0243,
"final_rank": 1
},
{
"submission_id": "aoj_1066_952066",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)n;i++)\nusing namespace std;\ntypedef double D;\ntypedef complex<D> P;\nconst D EPS = 1e-8;\n\nint n,r,q,r2;\nP p[30];\nint cur;\nD min_s[30],SIN[30],COS[30],x,y;\n\ninline P rotate(const P &v, const D &s){\n return P(real(v)*cos(s) - imag(v)*sin(s), real(v)*sin(s) + imag(v)*cos(s) );\n}\n\ninline D arg(const P &a,const P &b,const P &c){return real(conj(b-a)*(c-a))/(abs(b-a)*abs(c-a));}\n\ninline D rot_seta(const int &end){\n D seta = acos( 1 - norm(p[end]-p[cur])/r2 );\n P nxt = rotate(p[cur],-seta);\n return arg(p[cur],p[end],nxt);\n}\n\nint main(){\n while(scanf(\"%d%d%d\",&n,&r,&q), n){\n r2 = 2*r*r;\n rep(i,n){\n scanf(\"%lf%lf\",&x,&y);\n p[i] = P(x,y);\n if(abs(abs(p[i])-r)<EPS)cur = i;\n }\n \n vector<int> nxt(n,-1);\n bool f = false;\n\n rep(i,q){\n if(nxt[cur]>=0)f = true;\n\n if(!f){\n\tmin_s[cur] = 5;\n\trep(j,n){\n\t if(cur==j)continue;\n\t D s = rot_seta(j);\n\t if(nxt[cur]<0 || s > min_s[cur]+EPS)nxt[cur] = j, min_s[cur] = s;\n\t}\n\tmin_s[cur] = acos(min_s[cur]);\n\tSIN[cur] = sin(min_s[cur]); COS[cur] = cos(min_s[cur]);\n }\n\n rep(j,n){\n\tif((f&&nxt[j]<0) || j==cur)continue;\n\tx = p[j].real()-p[cur].real(); y = p[j].imag()-p[cur].imag();\n\tp[j] = P(x*COS[cur] - y*SIN[cur], x*SIN[cur] + y*COS[cur]) + p[cur];\n }\n printf(\"%.9lf %.9lf\\n\",p[nxt[cur]].real(), p[nxt[cur]].imag());\n\n if(!i){\n\tint tmp = nxt[cur];\n\tnxt[cur] = -1;\n\tcur = tmp;\n }else{\n\tcur = nxt[cur];\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1336,
"score_of_the_acc": -0.0243,
"final_rank": 1
},
{
"submission_id": "aoj_1066_952065",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)n;i++)\nusing namespace std;\ntypedef double D;\ntypedef complex<D> P;\nconst D EPS = 1e-8;\n\nint n,r,q,r2;\nP p[30];\nint cur;\nD min_s[30],SIN[30],COS[30],x,y;\n\ninline P rotate(const P &v, const D &s){\n return P(real(v)*cos(s) - imag(v)*sin(s), real(v)*sin(s) + imag(v)*cos(s) );\n}\n\ninline D arg(const P &a,const P &b,const P &c){return real(conj(b-a)*(c-a))/(abs(b-a)*abs(c-a));}\n\ninline D rot_seta(const int &end){\n D seta = acos( 1 - norm(p[end]-p[cur])/r2 );\n P nxt = rotate(p[cur],-seta);\n return arg(p[cur],p[end],nxt);\n}\n\nint main(){\n while(scanf(\"%d%d%d\",&n,&r,&q), n){\n r2 = 2*r*r;\n rep(i,n){\n scanf(\"%lf%lf\",&x,&y);\n p[i] = P(x,y);\n if(abs(abs(p[i])-r)<EPS)cur = i;\n }\n \n vector<int> nxt(n,-1);\n bool f = false;\n\n rep(i,q){\n if(nxt[cur]>=0)f = true;\n\n if(!f){\n\tmin_s[cur] = 5;\n\trep(j,n){\n\t if(cur==j)continue;\n\t D s = rot_seta(j);\n\t if(nxt[cur]<0 || s > min_s[cur]+EPS)nxt[cur] = j, min_s[cur] = s;\n\t}\n\tmin_s[cur] = acos(min_s[cur]);\n\tSIN[cur] = sin(min_s[cur]); COS[cur] = cos(min_s[cur]);\n }\n\n rep(j,n){\n\tif(j==cur || (f&&nxt[cur]<0))continue;\n\tx = p[j].real()-p[cur].real(); y = p[j].imag()-p[cur].imag();\n\tp[j] = P(x*COS[cur] - y*SIN[cur], x*SIN[cur] + y*COS[cur]) + p[cur];\n }\n printf(\"%.9lf %.9lf\\n\",p[nxt[cur]].real(), p[nxt[cur]].imag());\n\n if(!i){\n\tint tmp = nxt[cur];\n\tnxt[cur] = -1;\n\tcur = tmp;\n }else{\n\tcur = nxt[cur];\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1336,
"score_of_the_acc": -0.0301,
"final_rank": 4
},
{
"submission_id": "aoj_1066_952063",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)n;i++)\nusing namespace std;\ntypedef double D;\ntypedef complex<D> P;\nconst D EPS = 1e-8;\n\nint n,r,q,r2;\nP p[30];\nint cur;\nD min_s[30],x,y;\n\ninline D dot(const P &x, const P &y){return real(conj(x)*y);}\n\ninline P rotate(const P &v, const D &s){\n return P(real(v)*cos(s) - imag(v)*sin(s), real(v)*sin(s) + imag(v)*cos(s) );\n}\n\ninline D arg(const P &a,const P &b,const P &c){return dot(b-a,c-a)/(abs(b-a)*abs(c-a));}\n\ninline D rot_seta(const int &end){\n D seta = acos( 1 - norm(p[end]-p[cur])/r2 );\n P nxt = rotate(p[cur],-seta);\n return arg(p[cur],p[end],nxt);\n}\n\nint main(){\n while(scanf(\"%d%d%d\",&n,&r,&q), n){\n r2 = 2*r*r;\n rep(i,n){\n scanf(\"%lf%lf\",&x,&y);\n p[i] = P(x,y);\n if(abs(abs(p[i])-r)<EPS)cur = i;\n }\n \n vector<int> nxt(n,-1);\n bool f = false;\n\n rep(i,q){\n if(nxt[cur]>=0)f = true;\n\n if(!f){\n\tmin_s[cur] = 5;\n\trep(j,n){\n\t if(cur==j)continue;\n\t D s = rot_seta(j);\n\t if(nxt[cur]<0 || s > min_s[cur]+EPS)nxt[cur] = j, min_s[cur] = s;\n\t}\n\tmin_s[cur] = acos(min_s[cur]);\n }\n\n rep(j,n){\n\tif(j==cur || (f&&nxt[cur]<0))continue;\n\tp[j] = rotate(p[j]-p[cur],min_s[cur]) + p[cur];\n }\n printf(\"%.4lf %.4lf\\n\",p[nxt[cur]].real(), p[nxt[cur]].imag());\n\n if(i==0){\n\tint tmp = nxt[cur];\n\tnxt[cur] = -1;\n\tcur = tmp;\n }else{\n\tcur = nxt[cur];\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1336,
"score_of_the_acc": -0.0359,
"final_rank": 6
},
{
"submission_id": "aoj_1066_952062",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)n;i++)\nusing namespace std;\ntypedef double D;\ntypedef complex<D> P;\nconst D EPS = 1e-8;\n\nint n,r,q,r2;\nP p[30];\nint cur;\nD min_s[30],x,y;\n\ninline D dot(const P &x, const P &y){return real(conj(x)*y);}\n\ninline P rotate(const P &v, const D &s){\n return P(real(v)*cos(s) - imag(v)*sin(s), real(v)*sin(s) + imag(v)*cos(s) );\n}\n\ninline D arg(const P &a,const P &b,const P &c){return dot(b-a,c-a)/(abs(b-a)*abs(c-a));}\n\ninline D rot_seta(const int &end){\n D seta = acos( 1 - norm(p[end]-p[cur])/r2 );\n P nxt = rotate(p[cur],-seta);\n return arg(p[cur],p[end],nxt);\n}\n\nint main(){\n while(scanf(\"%d%d%d\",&n,&r,&q), n){\n r2 = 2*r*r;\n rep(i,n){\n scanf(\"%lf%lf\",&x,&y);\n p[i] = P(x,y);\n if(abs(abs(p[i])-r)<EPS)cur = i;\n }\n \n vector<int> nxt(n,-1);\n bool f = false;\n\n rep(i,q){\n if(nxt[cur]>=0)f = true;\n\n if(!f){\n\tmin_s[cur] = 5;\n\trep(j,n){\n\t if(cur==j)continue;\n\t D s = rot_seta(j);\n\t if(nxt[cur]<0 || s > min_s[cur]+EPS)nxt[cur] = j, min_s[cur] = s;\n\t}\n\tmin_s[cur] = acos(min_s[cur]);\n }\n\n rep(j,n){\n\tif(j==cur || (f&&nxt[cur]<0))continue;\n\tp[j] = rotate(p[j]-p[cur],min_s[cur]) + p[cur];\n }\n printf(\"%.9lf %.9lf\\n\",p[nxt[cur]].real(), p[nxt[cur]].imag());\n\n if(i==0){\n\tint tmp = nxt[cur];\n\tnxt[cur] = -1;\n\tcur = tmp;\n }else{\n\tcur = nxt[cur];\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1332,
"score_of_the_acc": -0.0342,
"final_rank": 5
}
] |
aoj_1067_cpp
|
Problem F: Cutting a Chocolate
Turtle Shi-ta and turtle Be-ko decided to divide a chocolate.
The shape of the chocolate is rectangle. The corners of the chocolate are put on (0,0), (
w
,0), (
w
,
h
) and (0,
h
).
The chocolate has lines for cutting.
They cut the chocolate only along some of these lines.
The lines are expressed as follows.
There are
m
points on the line connected between (0,0) and (0,
h
), and between (
w
,0) and (
w
,
h
).
Each
i
-th point, ordered by
y
value (
i
= 0 then
y
=0), is connected as cutting line.
These lines do not share any point where 0 <
x
<
w
.
They can share points where
x
= 0 or
x
=
w
.
However, (0,
l
i
) = (0,
l
j
) and (
w
,
r
i
) = (
w
,
r
j
) implies
i
=
j
.
The following figure shows the example of the chocolate.
There are
n
special almonds, so delicious but high in calories on the chocolate.
Almonds are circle but their radius is too small. You can ignore radius of almonds.
The position of almond is expressed as (
x
,
y
) coordinate.
Two turtles are so selfish. Both of them have requirement for cutting.
Shi-ta's requirement is that the piece for her is continuous.
It is possible for her that she cannot get any chocolate.
Assume that the minimum index of the piece is
i
and the maximum is
k
.
She must have all pieces between
i
and
k
.
For example, chocolate piece 1,2,3 is continuous but 1,3 or 0,2,4 is not continuous.
Be-ko requires that the area of her chocolate is at least
S
.
She is worry about her weight. So she wants the number of almond on her chocolate is as few as possible.
They doesn't want to make remainder of the chocolate because the chocolate is expensive.
Your task is to compute the minumum number of Beko's almonds if both of their requirment are satisfied.
Input
Input consists of multiple test cases.
Each dataset is given in the following format.
n
m
w
h
S
l
0
r
0
...
l
m-1
r
m-1
x
0
y
0
...
x
n-1
y
n-1
The last line contains five 0s.
n
is the number of almonds.
m
is the number of lines.
w
is the width of the chocolate.
h
is the height of the chocolate.
S
is the area that Be-ko wants to eat.
Input is integer except
x
i
y
i
.
Input satisfies following constraints.
1 ≤
n
≤ 30000
1 ≤
m
≤ 30000
1 ≤
w
≤ 200
1 ≤
h
≤ 1000000
0 ≤
S
≤
w*h
If
i
<
j
then
l
i
≤
l
j
and
r
i
≤
r
j
and then
i
-th lines and
j
-th lines share at most 1 point.
It is assured that
l
m-1
and
r
m-1
are
h
.
x
i
y
i
is floating point number with ten digits.
It is assured that they are inside of the chocolate.
It is assured that the distance between points and any lines is at least 0.00001.
Output
You should output the minumum number of almonds for Be-ko.
Sample input
2 3 10 10 50
3 3
6 6
10 10
4.0000000000 4.0000000000
7.0000000000 7.0000000000
2 3 10 10 70
3 3
6 6
10 10
4.0000000000 4.0000000000
7.0000000000 7.0000000000
2 3 10 10 30
3 3
6 6
10 10
4.0000000000 4.0000000000
7.0000000000 7.0000000000
2 3 10 10 40
3 3
6 6
10 10
4.0000000000 4.0000000000
7.0000000000 7.0000000000
2 3 10 10 100
3 3
6 6
10 10
4.0000000000 4.00
...(truncated)
|
[
{
"submission_id": "aoj_1067_10853288",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#define MAXN 30050\n#define eps 1e-8\ntypedef struct point {\n double x,y;\n\tpoint (){\n \n\t}\n\tpoint (double xx,double yy){\n x = xx;\n\t\t y = yy;\n\t}\n\tvoid setxy(double xx,double yy){\n\t\tx = xx;\n\t\ty = yy;\n\t}\n\tpoint operator-(point aa){\n return point (x-aa.x,y-aa.y);\n\t}\n\tvoid read(){\n\t\tscanf(\"%lf%lf\",&x,&y);\n\t}\n};\ntypedef struct Lines{\n point st,ed;\n\tvoid setp(point aa,point bb){\n\t\tst = aa;\n\t\ted = bb;\n\t}\n};\ntypedef point Vector;\ntypedef struct node{\n double s,pres;\n\tint chm,prechm;\n\tdouble lh,rh;\n\tpoint LP,RP;\n\tvoid init(){\n s = pres = 0.0;\n\t chm = prechm = 0;\n\t}\n\tvoid read(){\n scanf(\"%lf%lf\",&lh,&rh);\n\t}\n\tvoid setlr(double Lx,double Rx){\n\t\tLP.setxy(Lx,lh);\n\t\tRP.setxy(Rx,rh);\n\t}\n};\nnode no[MAXN];\npoint chmo[MAXN];\nLines LL[MAXN];\ndouble Cross(point aa,point bb){\n return aa.x*bb.y-aa.y*bb.x;\n}\nint dcmp(double x){\n if(fabs(x)<eps) return 0;\n return x<0?-1:1;\n}\ndouble prearea(point aa,point bb,point cc,point dd){\n double area1 = fabs(Cross(aa-bb,dd-bb));\n\t double area2 = fabs(Cross(dd-bb,cc-bb));\n\t return (area1+area2)/2;\n}\nvoid presoch(int n,int m,int k){\n\t int L,R,Mid;\n\t for(int i=0;i<n;++i){\n\t\t L = 1;R = m;\n\t\t while(L<R){\n\t\t\t Mid = (L+R)>>1;\n\t\t\t if(dcmp(Cross(LL[Mid].st - chmo[i],LL[Mid].ed-chmo[i]))<=0)\n\t\t\t\t R = Mid;\n\t\t\t else L = Mid+1;\n\t\t }\n\t\t while(1){\n\t\t\t if(dcmp(Cross(LL[L].st - chmo[i],LL[L].ed-chmo[i]))>0)\n\t\t\t\t --L;\n\t\t\t else break;\n\t\t }\n\t\t no[L-1].chm++;\n\t }\n\t no[0].prechm = no[0].chm;\n\t for(int i=1;i<=k;++i){\n no[i].prechm = no[i].chm+no[i-1].prechm;\n\t }\n\t// return L;\n}\ndouble gets(int ind1,int ind2){\n\n if(!ind1){\n\t\t return no[ind2].pres;\n\t }\n\t return (no[ind2].pres - no[ind1-1].pres); \n}\nint getch(int L,int R){\n if(!L){\n\t\t\treturn no[R].prechm;\n\t\t}\n\t\treturn no[R].prechm - no[L-1].prechm;\n}\nint solve(int n,int m,double S){\n\n\tint ans = n;\n\tint L,R,Mid;\n\tdouble AS = no[m].pres - S;\n\tdouble ALLS = no[m].pres;\n\tint Chms = no[m].prechm;\n\tdouble tmps;\n\tint tmpch;\n\tfor(int i=0;i<=m;++i){\n\t\tL = i;\n\t\tR = m;\n\t\twhile(L<R){\n\t\t\tMid = (L+R)>>1;\n\t\t\ttmps = gets(i,Mid);\n\t\t\tif(dcmp(tmps-AS)>0){\n\t\t\t\tR = Mid;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tL = Mid+1;\n\t\t\t}\n\t\t}\n\t\t//找到了\n\n\t\twhile(L>=i){\n\t\ttmps = gets(i,L);\n\t\ttmps = ALLS -tmps;\n\t\tif(dcmp(tmps-S)>=0){\n\t\t\ttmpch = Chms - getch(i,L);\n\t\t\tif(tmpch<ans){ans = tmpch;}\n\t\t\tbreak;\n\t\t}\n\t\t--L;\n\t\t}\n\t}\n\treturn ans;\n}\nint main(){\n\tint n,m;\n\tdouble w,h,S;\n\tpoint dwL,dwR,upL,upR;\n\twhile(scanf(\"%d%d\",&n,&m)!=EOF){\n\t\tscanf(\"%lf%lf%lf\",&w,&h,&S);\n\t\tif(!n&&!m&&!w&&!h&&!S)break;\n\t\tdwL.setxy(0,0);\n\t\tdwR.setxy(w,0);\n\t\tLL[0].setp(dwL,dwR);\n\t\tupL.setxy(0,h);\n\t\tupR.setxy(w,h);\n\t\tLL[m+1].setp(upL,upR);\n\t\tfor(int i=0;i<m;++i){\n\t\t\tno[i].read();\n\t\t\tno[i].setlr(0,w);\n\t\t\tno[i].init();\n\t\t\tLL[i+1].setp(no[i].LP,no[i].RP);\n\t\t}\n\t\tno[m].init();\n\t\tfor(int i=0;i<n;++i){\n\t\t\tchmo[i].read();\n\t\t}\n\t\tdouble area = prearea(no[0].LP,dwL,dwR,no[0].RP);\n\t\tno[0].s = area;\n\t\tno[0].pres = area;\n\t\tint tmpup = m-1;\n\t\tfor(int i=1;i<=tmpup;++i){\n\t\t no[i].s = prearea(no[i].LP,no[i-1].LP,no[i-1].RP,no[i].RP);\n\t\t no[i].pres = no[i].s+no[i-1].pres;\n\t\t}\n\t\tif(m>=1){\n\t\tno[m].s = prearea(upL,no[m-1].LP,no[m-1].RP,upR);\n\t\tno[m].pres=no[m].s+no[m-1].pres;\n\t\t}\n\t\t//杏仁数\n\t\tpresoch(n,m+2,m);\n\t\tint ans = solve(n,m,S);\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 6384,
"score_of_the_acc": -0.7154,
"final_rank": 17
},
{
"submission_id": "aoj_1067_8464550",
"code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 1067.cc: Problem F: Cutting a Chocolate\n */\n\n#include<cstdio>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 30000;\nconst int MAX_M = 30000;\nconst int INF = 1 << 30;\n\n/* typedef */\n\n/* global variables */\n\nint ls[MAX_M + 1], rs[MAX_M + 1], cs[MAX_M], css[MAX_M + 1];\ndouble xs[MAX_N], ys[MAX_N], ss[MAX_M + 1];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, m, w, h, s;\n while (scanf(\"%d%d%d%d%d\", &n, &m, &w, &h, &s), n > 0) {\n ls[0] = rs[0] = 0;\n for (int i = 1; i <= m; i++) scanf(\"%d%d\", ls + i, rs + i);\n for (int i = 0; i < n; i++) scanf(\"%lf%lf\", xs + i, ys + i);\n\n ss[0] = 0.0;\n for (int i = 0; i < m; i++) {\n double si = 0.5 * (ls[i + 1] - ls[i] + rs[i + 1] - rs[i]) * w;\n ss[i + 1] = ss[i] + si;\n }\n\n fill(cs, cs + m, 0);\n for (int i = 0; i < n; i++) {\n int j0 = 0, j1 = m;\n while (j0 + 1 < j1) {\n\tint j = (j0 + j1) / 2;\n\tdouble lyi = ls[j] + (double)(rs[j] - ls[j]) / w * xs[i];\n\tif (lyi > ys[i]) j1 = j;\n\telse j0 = j;\n }\n cs[j0]++;\n }\n for (int i = 0; i < m; i++) css[i + 1] = css[i] + cs[i];\n //for (int i = 0; i < m; i++) printf(\"%d \", cs[i]); putchar('\\n');\n\n int mina = INF;\n for (int i = 0, j = 0; i < m; i++) {\n j = max(i, j);\n while (j < m && ss[m] - (ss[j + 1] - ss[i]) >= s) j++;\n\n if (ss[m] - (ss[j] - ss[i]) >= s)\n\tmina = min(mina, css[i] + (css[m] - css[j]));\n }\n\n printf(\"%d\\n\", mina);\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3996,
"score_of_the_acc": -0.2423,
"final_rank": 7
},
{
"submission_id": "aoj_1067_6589241",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\n// #define DEBUG_PRINTF\n// #define DEBUG_PRINT_ERROR\n\nstatic long n, m, w, h, S;\n\n// �_�������̏㑤���ǂ���\nbool bIsUpper( long l, long r, double x, double y ) {\n double dirL[2] = { (double)w, (double)r-l };\n double dirP[2] = { (double)x, (double)y-l };\n return ( dirL[0]*dirP[1] - dirL[1]*dirP[0] > 0.0 );\n}\n\n// �_���܂܂�Ă����Ԃ̔ԍ�\nlong FindSegment( const vector< pair<long, long> >& vSeg, double x, double y )\n{\n long max = m-1;\n long min = 0;\n long i = (max-min)/2 + min;\n while ( max > min ) {\n if ( bIsUpper( vSeg[i].first, vSeg[i].second, x, y ) ) {\n min = i;\n } else {\n max = i;\n }\n if ( max-min == 1 ) {\n if ( min == 0 ) {\n if ( bIsUpper( vSeg[0].first, vSeg[0].second, x, y ) ) {\n return 1;\n }\n return 0;\n }\n return max;\n }\n i = (max-min)/2 + min;\n }\n\n // for ( long i = 0; i < m; ++i ) {\n // if ( !bIsUpper( vSeg[i].first, vSeg[i].second, x, y ) ) {\n // return i;\n // }\n // }\n // error\n#ifdef DEBUG_PRINT_ERROR\n cout << \"error\" << endl;\n#endif\n return m-1;\n}\n\ndouble CalcArea( const vector<double>& vS, long min, long max )\n{\n if ( min > 0 ) {\n return w*h - ( vS[max] - vS[min-1] );\n }\n return w*h - vS[max];\n // double s = 0.0;\n // for ( long i = min; i <= max; ++i ) {\n // s += vS[i];\n // }\n // return w*h - s;\n}\n\nlong FindMaxArea( const vector<double>& vS, const long Min )\n{\n long max = m-1;\n long min = Min;\n double a0 = CalcArea( vS, min, min );\n if ( a0 < S ) {\n return -1;\n }\n double a1 = CalcArea( vS, min, max );\n if ( a1 >= S ) {\n return max;\n }\n\n long i = (max-min)/2 + min;\n while ( max != min ) {\n double a = CalcArea( vS, Min, i );\n if ( a < S ) {\n max = i;\n } else {\n min = i;\n }\n if ( max-min == 1 ) {\n return min;\n }\n i = (max-min)/2 + min;\n }\n\n // for ( long i = 0; i < m; ++i ) {\n // if ( !bIsUpper( vSeg[i].first, vSeg[i].second, x, y ) ) {\n // return i;\n // }\n // }\n // error\n // cout << \"error\" << endl;\n return -1;\n}\n\n\nlong CountAlmond( const vector<long>& vAd, long min, long max )\n{\n long nn = 0;\n if ( max == m-1 ) {\n return n - vAd[min];\n }\n return n - ( vAd[min] - vAd[max+1] );\n // long nn = 0;\n // for ( long i = min; i <= max; ++i ) {\n // nn += vAd[i];\n // }\n // return n - nn;\n}\n\n\nint main()\n{\n while ( 1 ) {\n cin >> n;\n cin >> m;\n cin >> w;\n cin >> h;\n cin >> S;\n\n if ( n == 0 ) {\n break;\n }\n vector< pair<long, long> > vSeg(m);\n for ( long i = 0; i < m; ++i ) {\n cin >> vSeg[i].first;\n cin >> vSeg[i].second;\n // cout << vSeg[i].first << \" \" << vSeg[i].second << endl;\n }\n vector<long> vAdCount(m, 0);\n for ( long i = 0; i < n; ++i ) {\n double x, y;\n cin >> x;\n cin >> y;\n#ifdef DEBUG_PRINTF\n cout << \"i=\" << i << \" \" << x << \" \" << y << endl;\n#endif\n vAdCount[ FindSegment( vSeg, x, y ) ] += 1;\n#ifdef DEBUG_PRINTF\n cout << x << \" \" << y << \" index : \" << FindSegment( vSeg, x, y ) << endl;\n#endif\n }\n for ( long i = m-2; i >= 0; --i ) {\n vAdCount[i] += vAdCount[i+1];\n }\n vector<double> vS(m);\n for ( long i =0; i < m; ++i ) {\n if ( i == 0 ) {\n vS[i] = ( vSeg[0].first + vSeg[0].second ) * w / 2.0;\n } else {\n vS[i] = ( vSeg[i].first + vSeg[i].second - vSeg[i-1].first - vSeg[i-1].second ) * w / 2.0;\n }\n }\n for ( long i =1; i < m; ++i ) {\n vS[i] += vS[i-1];\n }\n double dTol = w*h - S;\n\n long nAns = n;\n for ( long min = 0; min < m; ++min ) {\n long max;\n // cout << \"min \" << min << endl;\n for ( max = min; max < m; ++max ) {\n // cout << \"max \" << max << endl;\n double s = CalcArea( vS, min, max );\n if ( s < S ) {\n break;\n }\n }\n --max;\n if ( min > max ) {\n continue;\n }\n#ifdef DEBUG_PRINTF\n cout << \"max- \" << max << endl;\n#endif\n // long max = FindMaxArea( vS, min );\n max = FindMaxArea( vS, min );\n if ( max < 0 ) {\n continue;\n }\n#ifdef DEBUG_PRINTF\n cout << \"max \" << max << endl;\n#endif\n long nAlmond = CountAlmond( vAdCount, min, max );\n // cout << \"nAr \" << nAlmond << endl;\n if ( nAlmond < nAns ) {\n nAns = nAlmond;\n }\n }\n\n#ifdef DEBUG_PRINTF\n cout << \"---------------\" << endl;\n#endif\n cout << nAns << endl;\n#ifdef DEBUG_PRINTF\n cout << \"---------------\" << endl;\n#endif\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 3080,
"memory_kb": 4040,
"score_of_the_acc": -1.251,
"final_rank": 20
},
{
"submission_id": "aoj_1067_6588775",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <set>\n#include <map>\n#include <queue>\n#pragma warning(disable : 4996)\n\nusing ll = long long;\nusing namespace std;\n\nconst int INF = 2140000000;\nconst long long LINF = 9223300000000000000;\nconst long long MOD = 1000000007;\n\n\nvoid solve()\n{\n while (1) {\n int n, m, w, h, S;\n scanf(\"%d%d%d%d%d\", &n, &m, &w, &h, &S);\n if (n + m + w + h + S == 0) break;\n S *= 2;\n int S2 = h * w *2- S;\n\n vector<int> L(m), R(m);\n vector<double> X(n), Y(n);\n for (int i = 0; i < m; i++) {\n scanf(\"%d%d\", &L[i], &R[i]);\n }\n for (int i = 0; i < n; i++) {\n scanf(\"%lf%lf\", &X[i], &Y[i]);\n }\n\n vector<int> nn(m), snn(m+1);\n for (int i = 0; i < n; i++) {\n int l = -1, r = m;\n while (r - l > 1) {\n int mm = (l + r) / 2;\n\n double x0 = w, y0 = R[mm] - L[mm];\n double x1 = X[i], y1 = Y[i] - L[mm];\n double chk = x0*y1 - x1*y0;\n if (chk < 0) {\n r = mm;\n }\n else {\n l = mm;\n }\n }\n //printf(\"[%d]%d\\n\", i, r);\n nn[r]++;\n }\n for (int i = 0; i < m; i++) {\n snn[i + 1] = snn[i] + nn[i];\n }\n\n vector<int> vs(m), svs(m + 1);\n for (int i = 0; i < m; i++) {\n if (i == 0) {\n vs[i] = (L[i] + R[i])*w;\n }\n else {\n vs[i] = (L[i] - L[i - 1] + R[i] - R[i - 1])*w;\n }\n svs[i + 1] = svs[i] + vs[i];\n }\n\n int ans = 0;\n for (int i = 0; i <= m; i++) {\n int tmp = svs[i] + S2 + 1;\n int k = lower_bound(svs.begin(), svs.end(), tmp) - svs.begin();\n k--;\n if (k >= i) {\n int ss = svs[k] - svs[i];\n assert(ss >= 0 && ss <= S2);\n int ans0=snn[k] - snn[i];\n ans = max(ans, ans0);\n }\n }\n printf(\"%d\\n\", n-ans);\n }\n\n return;\n}\n\nint main()\n{\n solve();\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3856,
"score_of_the_acc": -0.2148,
"final_rank": 5
},
{
"submission_id": "aoj_1067_6588586",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <list>\n#include <deque>\n#include <set>\n#include <map>\n#include <queue>\n#include <stack>\n#include <string>\n#include <algorithm>\n#include <numeric>\n#include <tuple>\n\nusing namespace std;\n\ntypedef long long ll;\n\nconstexpr int INF = 1 << 30;\nconstexpr ll INFLL = 1LL << 60;\nconstexpr ll MOD = 1'000'000'007;\n\nint main()\n{\n while (1) {\n int N;\n cin >> N;\n if (N == 0) break;\n int M, W, H, S;\n cin >> M >> W >> H >> S;\n\n vector<int> L(M), R(M);\n for (int m = 0; m < M; ++m) cin >> L[m] >> R[m];\n\n vector<int> A(M + 1); // Accumultated area\n for (int m = 1; m <= M; ++m) {\n A[m] = W * (L[m - 1] + R[m - 1]);\n }\n\n vector<int> C(M);\n for (int n = 0; n < N; ++n) {\n double X, Y;\n cin >> X >> Y;\n int l = -1, r = M;\n while (r - l > 1) {\n int m = l + (r - l) / 2;\n if (Y < double(R[m] - L[m]) / W * X + L[m]) r = m;\n else l = m;\n }\n ++C[r];\n }\n vector<int> AC(M + 1);\n for (int m = 0; m < M; ++m) {\n AC[m + 1] = AC[m] + C[m];\n }\n\n int Ans = INF;\n for (int l = 0; l <= M; ++l) {\n int r = upper_bound(A.begin(), A.end(), A[l] + 2 * (W * H - S)) - A.begin() - 1;\n Ans = min(Ans, N - AC[r] + AC[l]);\n }\n cout << Ans << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 410,
"memory_kb": 3648,
"score_of_the_acc": -0.2657,
"final_rank": 8
},
{
"submission_id": "aoj_1067_6582060",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint l[31000];\nint r[31000];\ndouble x[31000];\ndouble y[31000];\nint h[31000];\nint s[31000];\nint sum[31000];\nint hsum[31000];\nint main(){\n\twhile(true){\n// ll n,m,h,w,s;\n// cin >> n >> m >> h >> w >> s;\n ll a,b,c,d,e;\n cin >> a >> b >> c >> d >> e;\n if(a==0){\n return 0;\n }\n \n\t\tfor(int i=0;i<b;i++){\n\t\t\tscanf(\"%d%d\",l+i,r+i);\n\t\t}\n\t\tfor(int i=0;i<b;i++)h[i]=0;\n\t\tfor(int i=0;i<b;i++){\n\t\t\tif(i)s[i]=(l[i]+r[i]-l[i-1]-r[i-1])*c;\n\t\t\telse s[i]=(l[0]+r[0])*c;\n\t\t}\n\t\tsum[0]=s[0];\n\t\tfor(int i=1;i<b;i++){\n\t\t\tsum[i]=sum[i-1]+s[i];\n\t\t}\n\t\tfor(int i=0;i<a;i++)scanf(\"%lf%lf\",x+i,y+i);\n\t\te*=2;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tint L=0;\n\t\t\tint R=b;\n\t\t\twhile(L+1<R){\n\t\t\t\tint M=(L+R)/2;\n\t\t\t\tdouble at=(double)l[M-1]+(double)(r[M-1]-l[M-1])/c*x[i];\n\t\t\t\tif(at>y[i])R=M;\n\t\t\t\telse L=M;\n\t\t\t}\n\t\t\th[L]++;\n\t\t}\n\t\tfor(int i=0;i<=b;i++)hsum[i]=0;\n\t\tfor(int i=0;i<b;i++)hsum[i+1]=hsum[i]+h[i];\n\t\tint ret=999999999;\n\t\tint now=0;\n\t\tfor(int i=0;i<b;i++){\n\t\t\t//if(c*d*2-now<e)break;\n\t\t\tint to=upper_bound(sum,sum+b,now+c*d*2-e)-sum;\n\t\t\tret=min(ll(ret),ll(a-(hsum[to]-hsum[i])));\n\t\t\tnow+=s[i];\n\t\t}\n\t\tprintf(\"%d\\n\",ret);\n\t}\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 4380,
"score_of_the_acc": -0.3315,
"final_rank": 10
},
{
"submission_id": "aoj_1067_6582031",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint l[31000];\nint r[31000];\ndouble x[31000];\ndouble y[31000];\nint h[31000];\nint s[31000];\nint sum[31000];\nint hsum[31000];\nint main(){\n\tint a,b,c,d,e;\n\twhile(scanf(\"%d%d%d%d%d\",&a,&b,&c,&d,&e),a){\n\t\tfor(int i=0;i<b;i++){\n\t\t\tscanf(\"%d%d\",l+i,r+i);\n\t\t}\n\t\tfor(int i=0;i<b;i++)h[i]=0;\n\t\tfor(int i=0;i<b;i++){\n\t\t\tif(i)s[i]=(l[i]+r[i]-l[i-1]-r[i-1])*c;\n\t\t\telse s[i]=(l[0]+r[0])*c;\n\t\t}\n\t\tsum[0]=s[0];\n\t\tfor(int i=1;i<b;i++){\n\t\t\tsum[i]=sum[i-1]+s[i];\n\t\t}\n\t\tfor(int i=0;i<a;i++)scanf(\"%lf%lf\",x+i,y+i);\n\t\te*=2;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tint L=0;\n\t\t\tint R=b;\n\t\t\twhile(L+1<R){\n\t\t\t\tint M=(L+R)/2;\n\t\t\t\tdouble at=(double)l[M-1]+(double)(r[M-1]-l[M-1])/c*x[i];\n\t\t\t\tif(at>y[i])R=M;\n\t\t\t\telse L=M;\n\t\t\t}\n\t\t\th[L]++;\n\t\t}\n\t\tfor(int i=0;i<=b;i++)hsum[i]=0;\n\t\tfor(int i=0;i<b;i++)hsum[i+1]=hsum[i]+h[i];\n\t\tint ret=999999999;\n\t\tint now=0;\n\t\tfor(int i=0;i<b;i++){\n\t\t\t//if(c*d*2-now<e)break;\n\t\t\tint to=upper_bound(sum,sum+b,now+c*d*2-e)-sum;\n\t\t\tret=min(ret,a-(hsum[to]-hsum[i]));\n\t\t\tnow+=s[i];\n\t\t}\n\t\tprintf(\"%d\\n\",ret);\n\t}\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 3892,
"score_of_the_acc": -0.2355,
"final_rank": 6
},
{
"submission_id": "aoj_1067_3737700",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef pair<ll,ll> mp;\nll inf = 1e9;\n#define EPS 1e-12\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 void make(){ cin>>x>>y; }\n};\n\ndouble cross(point a,point b){return a.x*b.y - a.y*b.x; }\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 1;\n else return -1;\n}\nstruct line{\n point s,t;\n line(){}\n line(point s,point t):s(s),t(t){}\n};\nint main(){\n while(1){\n\tint n,m,w,h,S;\n\tcin>>n>>m>>w>>h>>S;\n\tif(n==0)break;\n\tpoint p0 = point(0,0);\n\tpoint p1 = point(w,0);\n\tpoint p2 = point(0,h);\n\tpoint p3 = point(w,h);\n\tvector<line> ls(m+2);\n\tvector<double> l(m),r(m),s(m+1);\n\tls[0] = line(p0,p1);\n\ts[0] = 0;\n\tfor(int i=0;i<m;i++){\n\t cin>>l[i]>>r[i];\n\t s[i+1] = (((double)(l[i]+r[i]))*w)/2.0;\n\t ls[i+1] = line( point(0,l[i]),point(w,r[i]) );\n\t}\n\tls[m+1] = line(p2,p3);\n\t//s[m+1] = w*h;\n\tvector<int> cnt(m+1,0);\n\tfor(int i=0;i<n;i++){\n\t point p;\n\t p.make();\n\t int upper = m+1,low = 0;\n\t while(upper-low>1){\n\t\tint mid = (upper+low)/2;\n\t\tif( ccw(ls[mid].s,ls[mid].t,p) * ccw(ls[mid+1].s,ls[mid+1].t,p) <= -1 )break;\n\t\tif( ccw(ls[mid].s,ls[mid].t,p) > 0 ) low =mid;\n\t\telse upper= mid;\n\t }\n\t int mid = (upper+low)/2;\n\t // if( ccw(ls[mid].s,ls[mid].t,p) * ccw(ls[mid+1].s,ls[mid+1].t,p) <= -1 ) cnt[mid]++;\n\t cnt[ mid+1 ]++;\n\t //if( mid< m+1&&ccw(ls[mid].s,ls[mid].t,p) * ccw(ls[mid+1].s,ls[mid+1].t,p) <= -1 ) cnt[mid]++;\n\t}\n\tfor(int i=0;i<m;i++) cnt[i+1] +=cnt[i];\n\tint res = 0;\n\t//for(int i=0;i<=m+1;i++){\n\t // cout<<cnt[i]<<' '<<s[i]<<endl;\n\t//}\n\tfor(int i=0;i<m;i++){\n\t double ss = s[i];\n\t int cc = cnt[i];\n\t auto it = upper_bound(s.begin(),s.end(),w*h - S+ss );\n\t //if(it == s.end() ) continue;\n\t it--;\n\t int index = it-s.begin();\n\t res = max(res, cnt[index]-cc);\n\t}\n\tcout<<n-res<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 530,
"memory_kb": 4932,
"score_of_the_acc": -0.5591,
"final_rank": 15
},
{
"submission_id": "aoj_1067_3737696",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef pair<ll,ll> mp;\nll inf = 1e9;\n#define EPS 1e-12\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 void make(){ cin>>x>>y; }\n};\n\ndouble cross(point a,point b){return a.x*b.y - a.y*b.x; }\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 1;\n else return -1;\n}\nstruct line{\n point s,t;\n line(){}\n line(point s,point t):s(s),t(t){}\n};\nint main(){\n while(1){\n\tint n,m,w,h,S;\n\tcin>>n>>m>>w>>h>>S;\n\tif(n==0)break;\n\tpoint p0 = point(0,0);\n\tpoint p1 = point(w,0);\n\tpoint p2 = point(0,h);\n\tpoint p3 = point(w,h);\n\tvector<line> ls(m+2);\n\tvector<double> l(m),r(m),s(m+2);\n\tls[0] = line(p0,p1);\n\ts[0] = 0;\n\tfor(int i=0;i<m;i++){\n\t cin>>l[i]>>r[i];\n\t s[i+1] = (((double)(l[i]+r[i]))*w)/2.0;\n\t ls[i+1] = line( point(0,l[i]),point(w,r[i]) );\n\t}\n\tls[m+1] = line(p2,p3);\n\ts[m+1] = w*h;\n\tvector<int> cnt(m+2,0);\n\tfor(int i=0;i<n;i++){\n\t point p;\n\t p.make();\n\t int upper = m+1,low = 0;\n\t while(upper-low>1){\n\t\tint mid = (upper+low)/2;\n\t\tif( ccw(ls[mid].s,ls[mid].t,p) * ccw(ls[mid+1].s,ls[mid+1].t,p) <= -1 )break;\n\t\tif( ccw(ls[mid].s,ls[mid].t,p) > 0 ) low =mid;\n\t\telse upper= mid;\n\t }\n\t int mid = (upper+low)/2;\n\t // if( ccw(ls[mid].s,ls[mid].t,p) * ccw(ls[mid+1].s,ls[mid+1].t,p) <= -1 ) cnt[mid]++;\n\t cnt[ mid +1]++;\n\t //if( mid< m+1&&ccw(ls[mid].s,ls[mid].t,p) * ccw(ls[mid+1].s,ls[mid+1].t,p) <= -1 ) cnt[mid]++;\n\t}\n\tfor(int i=0;i<=m;i++) cnt[i+1] +=cnt[i];\n\tint res = 0;\n\t//for(int i=0;i<=m+1;i++){\n\t // cout<<cnt[i]<<' '<<s[i]<<endl;\n\t//}\n\tfor(int i=0;i<m+1;i++){\n\t double ss = s[i];\n\t int cc = cnt[i];\n\t auto it = upper_bound(s.begin(),s.end(),w*h - S+ss );\n\t //if(it == s.end() ) continue;\n\t it--;\n\t int index = it-s.begin();\n\t res = max(res, cnt[index]-cc);\n\t}\n\tcout<<n-res<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 530,
"memory_kb": 5000,
"score_of_the_acc": -0.5725,
"final_rank": 16
},
{
"submission_id": "aoj_1067_3737326",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <tuple>\n\nusing namespace std;\n\nclass Solver {\n};\n\n\nint main() {\n\twhile (true) {\n\t\tint n, m, w, h, s;\n\t\tcin >> n >> m >> w >> h >> s;\n\t\tif (n == 0)break;\n\n\t\tvector<int> ls(m);\n\t\tvector<int> rs(m);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> ls[i] >> rs[i];\n\t\t}\n\n\t\tvector<tuple<double, double>> xys;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tdouble x, y;\n\t\t\tcin >> x >> y;\n\t\t\txys.emplace_back(x, y);\n\t\t}\n\n\t\tvector<double> range_s(m);\n\t\tvector<int> range_cnt(m, 0);\n\t\tdouble s_sum = 0;\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tdouble s_tmp = (ls[i] + rs[i]) * 0.5 * w;\n\t\t\trange_s[i] = s_tmp - s_sum;\n\t\t\ts_sum = s_tmp;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint bottom = -1;\n\t\t\tint top = m - 1;\n\t\t\tdouble x, y;\n\t\t\ttie(x, y) = xys[i];\n\t\t\twhile (bottom + 1 < top) {\n\t\t\t\tint mid = (bottom + top + 1) / 2;\n\n\t\t\t\tdouble yy = (rs[mid] - ls[mid]) * x / w + ls[mid];\n\t\t\t\tif (yy >= y)top = mid;\n\t\t\t\telse bottom = mid;\n\t\t\t}\n\n\t\t\trange_cnt[top]++;\n\t\t}\n\n\t\tvector<int> sums(m, 0);\n\t\tsums[0] = range_cnt[0];\n\t\tfor (int i = 1; i < m; i++) {\n\t\t\tsums[i] = sums[i - 1] + range_cnt[i];\n\t\t}\n\n\t\tint res = n;\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint bottom = i;\n\t\t\tint top = m;\n\t\t\twhile (bottom + 1 < top) {\n\t\t\t\tint mid = (bottom + top) / 2;\n\t\t\t\tint l_delta = ls[mid];\n\t\t\t\tint r_delta = rs[mid];\n\t\t\t\tif (i > 0) {\n\t\t\t\t\tl_delta -= ls[i - 1];\n\t\t\t\t\tr_delta -= rs[i - 1];\n\t\t\t\t}\n\t\t\t\tdouble sum_tmp = (l_delta + r_delta) * 0.5 * w;\n\t\t\t\tdouble remain_s = h * w - sum_tmp;\n\n\t\t\t\tif (remain_s >= s)bottom = mid;\n\t\t\t\telse top = mid;\n\t\t\t}\n\n\t\t\tdouble l_d = ls[bottom];\n\t\t\tdouble r_d = rs[bottom];\n\t\t\tif (i > 0) {\n\t\t\t\tl_d -= ls[i - 1];\n\t\t\t\tr_d -= rs[i - 1];\n\t\t\t}\n\t\t\tdouble sum = (l_d + r_d) * 0.5 * w;\n\t\t\tif (w * h - sum < s)continue;\n\n\t\t\tint tmp = sums[m - 1] - sums[bottom];\n\t\t\tif (i > 0)tmp += sums[i - 1];\n\t\t\tres = min(res, tmp);\n\t\t}\n\n\t\tcout << res << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 480,
"memory_kb": 4096,
"score_of_the_acc": -0.3776,
"final_rank": 11
},
{
"submission_id": "aoj_1067_3737280",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <utility>\n#include <complex>\nusing namespace std;\nusing W = double;\nusing P = complex<W>;\nusing L = pair<P,P>;\n\n#define X real()\n#define Y imag()\n\nconstexpr W EPS = 1e-8;\n\nW cross(const P& a, const P& b){\n return a.X*b.Y - a.Y*b.X;\n}\n\nbool is_below(const L &l, const P &p){\n P d = l.second - l.first;\n P q = p - l.first;\n return cross(d,q) < EPS;\n}\n\nint main(){\n int n, m;\n W w, h, s;\n while(cin >> n >> m >> w >> h >> s, n){\n vector<L> lines;\n lines.emplace_back(P(0,0),P(w,0));\n\n vector<W> S(m+2,0);\n for(int i = 0; i < m; ++i){\n W l, r;\n cin >> l >> r;\n lines.emplace_back(P(0,l),P(w,r));\n S[i+1] = (l+r)/2*w;\n }\n\n lines.emplace_back(P(0,h),P(w,h));\n S[m+1] = w*h;\n\n for(int i = m+1; i > 0; --i) S[i] -= S[i-1];\n\n vector<int> C(m+2,0);\n for(int i = 0; i < n; ++i){\n W x, y;\n cin >> x >> y;\n P a(x,y);\n int ng = 0, ok = m+1;\n while(ok - ng > 1){\n\tint m = (ok+ng)/2;\n\tif(is_below(lines[m],a)){\n\t ok = m;\n\t}else{\n\t ng = m;\n\t}\n }\n ++C[ok];\n // cerr << i << \" \" << ok << endl;\n }\n\n double curS = 0, lim = h * w - s;\n int curA = 0, ub = 0, ans = n;\n for(int lb=0; lb<m+2; lb++) {\n while(ub < m+2 and (curS + S[ub] <= lim + EPS)) {\n\tcurS += S[ub]; curA += C[ub];\n\tub++;\n }\n // fprintf(stderr, \"[%d, %d): curS = %.12f, curA = %d\\n\", lb, ub, curS, curA);\n ans = min(ans, n - curA);\n\n if(lb == ub) {\n\tub++;\n }\n else {\n\tcurS -= S[lb];\n\tcurA -= C[lb];\n }\n }\n\n /*\n cerr << \"S\" << endl;\n for(auto s : S) cerr << s << \" \" ;\n cerr << endl;\n\n cerr << \"C\" << endl;\n for(auto c : C) cerr << c << \" \" ;\n cerr << endl;\n */\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 520,
"memory_kb": 4904,
"score_of_the_acc": -0.5502,
"final_rank": 14
},
{
"submission_id": "aoj_1067_3040615",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\nconst double EPS = 1e-10;\nconst double INF = 1e12;\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\ntypedef complex<double> P;\ntypedef vector<P> VP;\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}\ndouble getarea(const VP &poly){\n double ret = 0;\n for (int i=0; i<(int)poly.size(); i++){ \n ret += cross(poly[i], poly[(i+1)%poly.size()]);\n }\n return ret*0.5;\n}\n\nint main(){\n while(1){\n int n,m,w,h,s;\n cin >> n >> m >> w >> h >> s;\n if(n==0) break;\n\n vector<double> l(m+1, 0), r(m+1, 0);\n for(int i=1; i<=m; i++){\n cin >> l[i] >> r[i];\n }\n VP p(n);\n for(int i=0; i<n; i++){\n double x,y;\n cin >> x >> y;\n p[i] = P(x, y);\n }\n\n vector<double> area(m+1, 0);\n for(int i=1; i<=m; i++){\n VP poly = {P(0, l[i-1]), P(w, r[i-1]), P(w, r[i]), P(0, l[i])};\n area[i] = getarea(poly);\n area[i] += area[i-1];\n }\n vector<int> num(m+1, 0);\n for(int i=0; i<n; i++){\n int ub=m, lb=0;\n while(lb +1 < ub){\n int mid = (lb +ub)/2;\n if(ccw(P(0, l[mid]), P(w, r[mid]), p[i]) == 1){\n lb = mid;\n }else{\n ub = mid;\n }\n }\n num[ub]++;\n }\n for(int i=0; i<m; i++){\n num[i+1] += num[i];\n }\n\n int ans = 1e9;\n for(int i=0; i<m; i++){\n if(area[i] +EPS >= s){\n ans = min(ans, num[i]);\n break;\n }\n int lb=i, ub=m;\n while(lb +1 < ub){\n int mid = (lb +ub)/2;\n if(h*w -(area[mid] -area[i]) +EPS > s){\n lb = mid;\n }else{\n ub = mid;\n }\n }\n ans = min(ans, n-(num[lb] -num[i]));\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 540,
"memory_kb": 4272,
"score_of_the_acc": -0.4327,
"final_rank": 13
},
{
"submission_id": "aoj_1067_3000316",
"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 30005\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\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nstruct Info{\n\tint value;\n\tPolygon polygon;\n\tdouble min_y,max_y,S;\n};\n\nint num_almond,num_section;\nint ruiseki_value[NUM];\ndouble W,H,total_S,need_S;\ndouble ruiseki_S[NUM];\nInfo info[NUM];\nPoint pre_L,pre_R,L,R;\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\n//ベクトルaとbの外積を求める関数\ndouble cross(Vector a,Vector b){\n\treturn a.x*b.y-a.y*b.x;\n}\n\n//ベクトルaとbの内積を求める関数\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\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\nvoid func(){\n\n\tfor(int i = 0; i < num_section; i++){\n\t\tinfo[i].value = 0; //断片内のアーモンドの個数\n\t\tinfo[i].polygon.clear();\n\t}\n\n\tpre_L.x = 0;\n\tpre_R.x = W;\n\n\tpre_L.y = 0;\n\tpre_R.y = 0;\n\n\tL.x = 0;\n\tR.x = W;\n\n\tfor(int i = 0; i < num_section; i++){\n\n\t\tscanf(\"%lf %lf\",&L.y,&R.y);\n\n\t\t//左下から反時計回りに点を記録\n\t\tinfo[i].polygon.push_back(pre_L);\n\t\tinfo[i].polygon.push_back(pre_R);\n\t\tinfo[i].polygon.push_back(R);\n\t\tinfo[i].polygon.push_back(L);\n\n\t\tinfo[i].min_y = min(pre_L.y,pre_R.y);\n\t\tinfo[i].max_y = max(L.y,R.y);\n\n\t\tinfo[i].S = (((L.y-pre_L.y)+(R.y-pre_R.y))*W)/2.0; //台形の面積\n\n\t\tpre_L = L;\n\t\tpre_R = R;\n\t}\n\n\t//アーモンドの処理\n\tPoint tmp;\n\tint left,right,m;\n\tint min_index,max_index;\n\n\tfor(int loop = 0; loop < num_almond; loop++){\n\n\t\tscanf(\"%lf %lf\",&tmp.x,&tmp.y);\n\n\t\t//アーモンドが所属し得る最小のインデックスを求める\n\t\tleft = 0,right = num_section-1,m = (left+right)/2;\n\t\tmin_index = num_section-1;\n\n\t\twhile(left <= right){\n\t\t\tif(info[m].max_y > tmp.y){\n\n\t\t\t\tmin_index = m;\n\t\t\t\tright = m-1;\n\n\t\t\t}else{\n\n\t\t\t\tleft = m+1;\n\n\t\t\t}\n\t\t\tm = (left+right)/2;\n\t\t}\n\n\t\t//アーモンドが所属し得る最大のインデックスを求める\n\t\tleft = 0,right = num_section-1,m = (left+right)/2;\n\t\tmax_index = 0;\n\n\t\twhile(left <= right){\n\n\t\t\tif(info[m].min_y < tmp.y){\n\n\t\t\t\tmax_index = m;\n\t\t\t\tleft = m+1;\n\n\t\t\t}else{\n\n\t\t\t\tright = m-1;\n\t\t\t}\n\t\t\tm = (left+right)/2;\n\t\t}\n\n\t\tif(min_index > max_index)continue;\n\n\t\tfor(int i = min_index; i <= max_index; i++){\n\n\t\t\tif(contains(info[i].polygon,tmp) == 2){ //問題仕様上、ONは無いはず\n\t\t\t\tinfo[i].value++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\t//累積和テーブルを作成する\n\truiseki_S[0] = info[0].S;\n\truiseki_value[0] = info[0].value;\n\n\tfor(int i = 1; i < num_section; i++){\n\t\truiseki_S[i] = info[i].S;\n\t\truiseki_S[i] += ruiseki_S[i-1];\n\t\truiseki_value[i] = info[i].value;\n\t\truiseki_value[i] += ruiseki_value[i-1];\n\t}\n\n\ttotal_S = H*W;\n\tint ans = num_almond;\n\n\tdouble tmp_S;\n\tint tmp_almond;\n\n\tfor(int i = 0; i < num_section; i++){\n\t\t/*★シータの面積は大きいほど良い★*/\n\n\t\t//2分探索で、残チョコの面積がS以上となる、最大の上端を求める\n\t\tleft = 0,right = num_section-1,m = (left+right)/2;\n\n\t\twhile(left <= right){\n\t\t\t//シータの面積を求める\n\t\t\tif(i != 0){\n\n\t\t\t\ttmp_S = ruiseki_S[m]-ruiseki_S[i-1];\n\n\t\t\t}else{\n\n\t\t\t\ttmp_S = ruiseki_S[m];\n\t\t\t}\n\n\t\t\tif(total_S-tmp_S >= need_S){ //残りがneed_S以上\n\n\t\t\t\tif(i != 0){\n\n\t\t\t\t\ttmp_almond = ruiseki_value[m]-ruiseki_value[i-1];\n\n\t\t\t\t}else{\n\n\t\t\t\t\ttmp_almond = ruiseki_value[m];\n\t\t\t\t}\n\n\t\t\t\tans = min(ans,num_almond-tmp_almond);\n\n\t\t\t\tleft = m+1;\n\n\t\t\t}else{\n\t\t\t\tright = m-1;\n\t\t\t}\n\t\t\tm = (left+right)/2;\n\t\t}\n\t}\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d %lf %lf %lf\",&num_almond,&num_section,&W,&H,&need_S);\n\t\tif(num_almond == 0 && num_section == 0)break;\n\n\t\tfunc();\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 490,
"memory_kb": 7540,
"score_of_the_acc": -1.0585,
"final_rank": 18
},
{
"submission_id": "aoj_1067_1982597",
"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\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n \nvoid getnum(const int l, const int r, const vector<pair<ld, ld>>&armonds, const vector<pair<ld, ld>>&lines,vector<pair<int,ld>>&areas) {\n\tif (l + 1 == r) {\n\t\tareas[l].first = armonds.size();\n\t}\n\telse {\n\t\tint m = (l + r) / 2;\n\t\tpair<ld, ld>line(lines[m]);\n\t\tvector<pair<ld, ld>>larmonds, rarmonds;\n\t\tfor (auto armond : armonds) {\n\t\t\tld ay = line.first + line.second*armond.first;\n\t\t\tif (ay > armond.second) {\n\t\t\t\tlarmonds.emplace_back(armond);\n\t\t\t}\n\t\t\telse {\n\t\t\t\trarmonds.emplace_back(armond);\n\t\t\t}\n\t\t}\n\t\tgetnum(l, m, larmonds, lines, areas);\n\t\tgetnum(m, r, rarmonds, lines, areas);\n\t}\n}\n\nint main() {\n\twhile (1) {\n\t\tint N, M, W, H, S; cin >> N >> M >> W >> H >> S;\n\t\tif (!N)break;\n\t\tvector<pair<ld, ld>>lines;\n\t\tlines.emplace_back(0, 0);\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tld l, r; cin >> l >> r;\n\t\t\tlines.emplace_back(l, (r - l) / W);\n\t\t}\n\t\tvector<pair<ld, ld>>armonds;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld x, y; cin >> x >> y;\n\t\t\tarmonds.emplace_back(x, y);\n\t\t}\n\t\tvector<pair<int, ld>>areas(M);\n\t\t{\n\t\t\tld asum = 0;\n\t\t\tfor (int i = 0; i < M; ++i) {\n\t\t\t\tld sum= (2 * lines[i + 1].first + W*lines[i + 1].second)*W / 2;\n\t\t\t\tareas[i].second = sum - asum;\n\t\t\t\tasum = sum;\n\t\t\t\n\t\t\t}\n\t\t}\n\t\tgetnum(0, M, armonds, lines, areas);\n\t\tint l = 0;\n\t\tint r = 0;\n\t\tld needarea = W*H - S + eps;\n\t\tld sum = 0;\n\t\tint num = 0;\n\t\tint ans = 0;\n\t\tbool flag = true;\n\t\twhile (1) {\n\t\t\twhile (sum < needarea) {\n\t\t\t\tans = max(ans, num);\n\t\t\t\tif (r == M) {\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tsum += areas[r].second;\n\t\t\t\t\tnum += areas[r].first;\n\t\t\t\t}\n\t\t\t\tr++;\n\t\t\t}\n\t\t\tif (!flag)break;\n\t\t\twhile (sum > needarea) {\n\t\t\t\tsum -= areas[l].second;\n\t\t\t\tnum -= areas[l].first;\n\t\t\t\tl++;\n\t\t\t}\n\t\t}\n\t\tcout << N-ans << endl;\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 580,
"memory_kb": 7848,
"score_of_the_acc": -1.1497,
"final_rank": 19
},
{
"submission_id": "aoj_1067_1876094",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n,m,w,h,S;\n\nstruct Line{\n double a;\n double b;\n double l;\n double r;\n\n double gety(double x){\n return a*x+b;\n }\n};\nstruct Point{\n double x;\n double y;\n\n bool operator < (const Point &a)const{\n return y < a.y;\n }\n};\n\n\nvector <Line> lr;\nvector <Point> ar;\n\nint main(){\n\n while(cin>>n>>m>>w>>h>>S, n|m|w|h|S){\n m += 2;\n lr.clear();\n lr = vector<Line>(m);\n ar.clear();\n ar = vector<Point>(n);\n lr[0].l = lr[0].b = lr[0].a = lr[0].r = 0;\n\n for(int i = 1; i < m-1; i++){\n double l,r;\n cin>>l>>r;\n lr[i].a = (r-l)/(double)w;\n lr[i].b = l;\n lr[i].l = l;\n lr[i].r = r;\n }\n lr[m-1].l = lr[m-1].b = lr[m-1].r = h;\n lr[m-1].a = 0;\n for(int i = 0; i < n; i++){\n double x, y; cin >> x >> y;\n ar[i].x = x; ar[i].y = y;\n }\n sort(ar.begin(), ar.end());\n vector< pair<int, double> > area(m-1, make_pair(0, 0));\n\n for(int i = 0; i < n; i++){\n int l = 0, r = m;\n while(l + 1 < r){\n int mid = (l+r)/2;\n if(ar[i].y >= lr[mid].gety(ar[i].x)){\n l = mid;\n }else{\n r = mid;\n }\n }\n area[l].first++;\n }\n for(int i = 0; i < m-1; i++){\n area[i].second = (lr[i+1].l - lr[i].l + lr[i+1].r - lr[i].r)*w/2.0;\n }\n\n /*\n for(int i = 0; i < area.size(); i++){\n cout << i+1 << \". \" << area[i].first << \" amds, \" << area[i].second << \" sqs\" << endl;\n }\n */\n\n vector<double> areasum(area.size()+1, 0);\n vector<int> amsum(area.size()+1, 0);\n double totalarea = h*w;\n for(size_t i = 1; i < areasum.size(); i++){\n areasum[i] += areasum[i-1] + area[i-1].second;\n }\n for(size_t i = 1; i < amsum.size(); i++){\n amsum[i] += amsum[i-1] + area[i-1].first;\n }\n\n\n int ans =0;\n for(size_t bottom = 0; bottom < area.size(); bottom++){\n int l = bottom, r = amsum.size();\n while(l+1 < r){\n int mid = (l+r)/2;\n if(areasum[mid] - areasum[bottom] > totalarea - S){\n r = mid;\n }else{\n l = mid;\n }\n }\n ans = max(ans, amsum[l] - amsum[bottom]);\n }\n cout << n - ans << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 670,
"memory_kb": 3772,
"score_of_the_acc": -0.3785,
"final_rank": 12
},
{
"submission_id": "aoj_1067_1875057",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define EPS (1e-8)\n#define INF 101010\n\nstruct Point {\n double x, y;\n \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\ndouble cross(const Point &a, const Point &b)\n{\n return a.x * b.y - a.y * b.x;\n}\n\nint ccw(const Point &p0, const Point &p1, const Point &p2)\n{\n Point a = p1 - p0, b = p2 - p0;\n if (cross(a, b) > EPS) return -1; // COUNTER CLOCK WISE\n return +0;\n}\n\n#define next(G,i) (G[(i+1)%G.size()])\n\ndouble get_area(double l, double r, int W)\n{\n vector<Point> pg(4);\n pg[0] = Point(0, 0);\n pg[1] = Point(W, 0);\n pg[2] = Point(W, r);\n pg[3] = Point(0, l);\n \n double res = 0;\n for (int i = 0; i < (int)pg.size(); i++) {\n\tres += cross(pg[i], next(pg, i));\n }\n return abs(res)/2.0;\n}\n\n\nint main()\n{\n int N, M, W, H, S;\n while (cin >> N >> M >> W >> H >> S, N) {\n vector<double> l(M+1), r(M+1);\n l[0] = r[0] = 0;\n \n vector<int> s(M+1, 0);\n for (int i = 1; i <= M; i++) {\n scanf(\"%lf %lf\", &l[i], &r[i]);\n s[i] = get_area(l[i], r[i], W);\n } \n\n vector<int> choco(M+1, 0);\n \n Point p;\n for (int i = 0; i < N; i++) {\n scanf(\"%lf %lf\", &p.x, &p.y);\n int lb = 0, ub = M+1;\n while (ub - lb > 1) {\n int mid = (lb + ub) / 2;\n if (ccw(Point(0, l[mid]), Point(W, r[mid]), p) == -1) {\n lb = mid;\n } else {\n ub = mid;\n }\n }\n choco[ub]++;\n }\n\n for (int i = 1; i <= M; i++) {\n choco[i] += choco[i-1];\n }\n int res = INF;\n for (int i = 0; i <= M; i++) {\n int lb = i, ub = M+1;\n int ns = s[i];\n while (ub - lb > 1) {\n int mid = (lb + ub) / 2;\n if (ns + (s[M] - s[mid]) < S) {\n ub = mid;\n } else {\n lb = mid;\n }\n }\n\n if (ns + (s[M] - s[lb]) >= S) {\n res = min(res, choco[M] - (choco[lb] - choco[i]));\n }\n }\n cout << res << endl;\n } \n return 0;\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 3728,
"score_of_the_acc": -0.2134,
"final_rank": 4
},
{
"submission_id": "aoj_1067_1875055",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define EPS (1e-8)\n#define INF 101010\n\nstruct Point {\n double x, y;\n \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\ndouble cross(const Point &a, const Point &b)\n{\n return a.x * b.y - a.y * b.x;\n}\n\nint ccw(const Point &p0, const Point &p1, const Point &p2)\n{\n Point a = p1 - p0, b = p2 - p0;\n if (cross(a, b) > EPS) return -1; // COUNTER CLOCK WISE\n return +0;\n}\n\n#define next(G,i) (G[(i+1)%G.size()])\n\ndouble get_area(double l, double r, int W)\n{\n vector<Point> pg(4);\n pg[0] = Point(0, 0);\n pg[1] = Point(W, 0);\n pg[2] = Point(W, r);\n pg[3] = Point(0, l);\n \n double res = 0;\n for (int i = 0; i < (int)pg.size(); i++) {\n\tres += cross(pg[i], next(pg, i));\n }\n return abs(res)/2.0;\n}\n\n\nint main()\n{\n int N, M, W, H, S;\n while (cin >> N >> M >> W >> H >> S, N) {\n vector<double> l(M+1), r(M+1);\n l[0] = r[0] = 0;\n \n vector<int> s(M+1, 0);\n for (int i = 1; i <= M; i++) {\n cin >> l[i] >> r[i];\n s[i] = get_area(l[i], r[i], W);\n } \n\n vector<int> choco(M+1, 0);\n \n Point p;\n for (int i = 0; i < N; i++) {\n cin >> p.x >> p.y;\n int lb = 0, ub = M+1;\n while (ub - lb > 1) {\n int mid = (lb + ub) / 2;\n if (ccw(Point(0, l[mid]), Point(W, r[mid]), p) == -1) {\n lb = mid;\n } else {\n ub = mid;\n }\n }\n choco[ub]++;\n }\n\n for (int i = 1; i <= M; i++) {\n choco[i] += choco[i-1];\n }\n int res = INF;\n for (int i = 0; i <= M; i++) {\n int lb = i, ub = M+1;\n int ns = s[i];\n while (ub - lb > 1) {\n int mid = (lb + ub) / 2;\n if (ns + (s[M] - s[mid]) < S) {\n ub = mid;\n } else {\n lb = mid;\n }\n }\n\n if (ns + (s[M] - s[lb]) >= S) {\n res = min(res, choco[M] - (choco[lb] - choco[i]));\n }\n }\n cout << res << endl;\n } \n return 0;\n}",
"accuracy": 1,
"time_ms": 540,
"memory_kb": 3684,
"score_of_the_acc": -0.317,
"final_rank": 9
},
{
"submission_id": "aoj_1067_1874769",
"code_snippet": "#include <bits/stdc++.h>\n#define f first\n#define s second\n#define x real()\n#define y imag()\nusing namespace std;\ntypedef complex <double> point;\ntypedef pair <int,int> P;\nint n,m,w,h,S;\npoint L[30001][2];\npoint A[30001];\nlong long arm[30001];\n \nbool ccw(point a,point b,point c){\n b-=a,c-=a;\n c*=conj(b);\n return (c.y>0);\n}\n \nvoid mk_arm(){\n memset(arm,0,sizeof(arm));\n for(int i=0;i<n;i++){\n int low=0,mid,up=m+1;\n while(low<up){\n mid=(low+up)/2;\n if(!ccw(L[mid][0],L[mid][1],A[i]))up=mid;\n else low=mid+1;\n }\n arm[low]++;\n }\n \n for(int i=1;i<=m;i++)arm[i]+=arm[i-1];\n arm[m+1]=n;\n}\n \nint solve(){\n long long res=0;\n for(int i=0;i<m;i++){\n int low=i,mid,up=m+1;\n while(low<up){\n mid=(low+up)/2;\n double sss=(L[mid][0].y-L[i][0].y+L[mid][1].y-L[i][1].y)*w/2.0;\n if(w*h-(sss)<S) up=mid;\n else low=mid+1; \n }\n res=max(res,(arm[low-1]-arm[i]));\n }\n assert(n-res>=0);\n return n-res;\n}\n \nint main(){\n \n while(1){\n cin>>n>>m>>w>>h>>S;\n if(!n&&!m&&!w&&!h&&!S)break;\n \n L[0][0]=point(0,0),L[0][1]=point(w,0);\n for(int i=1,a,b;i<=m;i++){\n cin>>a>>b;\n L[i][0]=point(0,a);\n L[i][1]=point(w,b);\n }\n \n double a,b;\n for(int i=0;i<n;i++)cin>>a>>b,A[i]=point(a,b);\n mk_arm();\n cout << solve()<<endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 630,
"memory_kb": 2888,
"score_of_the_acc": -0.1911,
"final_rank": 3
},
{
"submission_id": "aoj_1067_1874629",
"code_snippet": "#include <bits/stdc++.h>\n#define f first\n#define s second\n#define x real()\n#define y imag()\nusing namespace std;\ntypedef complex <double> point;\nint n,m,w,h,S;\npoint L[30001][2];\npoint A[30001];\nint arm[30001];\n \nbool ccw(point a,point b,point c){\n b-=a,c-=a;\n c*=conj(b); \n return (c.y>0);\n}\n \nvoid mk_arm(){\n memset(arm,0,sizeof(arm));\n for(int i=0;i<n;i++){\n int low=0,mid,up=m+1;\n while(low<up){\n mid=(low+up)/2;\n if(!ccw(L[mid][0],L[mid][1],A[i])) up=mid;\n else low=mid+1;\n }\n arm[low]++;\n }\n for(int i=1;i<=m;i++)arm[i]+=arm[i-1];\n}\n \nint solve(){\n int res=0;\n for(int i=0;i<m;i++){\n int low=i,mid,up=m+1;\n while(low<up){\n mid=(low+up)/2;\n double sss=((L[mid][0].y-L[i][0].y)+(L[mid][1].y-L[i][1].y))*w/2.0;\n if(w*h-(sss)<S) up=mid;\n else low=mid+1; \n }\n res=max(res,(arm[low-1]-arm[i]));\n }\n return n-res;\n}\n \nint main(){\n while(1){\n cin>>n>>m>>w>>h>>S;\n if(!n&&!m&&!w&&!h&&!S)break;\n L[0][0]=point(0,0);\n L[0][1]=point(w,0);\n for(int i=1,a,b;i<=m;i++){\n cin>>a>>b;\n L[i][0]=point(0,a);\n L[i][1]=point(w,b);\n }\n \n double a,b;\n for(int i=0;i<n;i++)cin>>a>>b,A[i]=point(a,b);\n mk_arm();\n cout << solve()<<endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 630,
"memory_kb": 2772,
"score_of_the_acc": -0.1682,
"final_rank": 2
},
{
"submission_id": "aoj_1067_1874620",
"code_snippet": "#include <bits/stdc++.h>\n#define f first\n#define s second\n#define x real()\n#define y imag()\nusing namespace std;\ntypedef complex <double> point;\nint n,m,w,h,S;\npoint L[30001][2];\npoint A[30001];\nint arm[30001];\n \nbool ccw(point a,point b,point c){\n b-=a,c-=a;\n // c*=b;\n \n return (b.x*c.y-b.y*c.x>0);\n}\n \nvoid mk_arm(){\n memset(arm,0,sizeof(arm));\n for(int i=0;i<n;i++){\n int low=0,mid,up=m+1;\n while(low<up){\n mid=(low+up)/2;\n if(!ccw(L[mid][0],L[mid][1],A[i])) up=mid;\n else low=mid+1;\n }\n arm[low]++;\n }\n for(int i=1;i<=m;i++)arm[i]+=arm[i-1];\n}\n \nint solve(){\n int res=0;\n for(int i=0;i<m;i++){\n int low=i,mid,up=m+1;\n while(low<up){\n mid=(low+up)/2;\n double sss=((L[mid][0].y-L[i][0].y)+(L[mid][1].y-L[i][1].y))*w/2.0;\n if(w*h-(sss)<S) up=mid;\n else low=mid+1; \n }\n res=max(res,(arm[low-1]-arm[i]));\n }\n return n-res;\n}\n \nint main(){\n while(1){\n cin>>n>>m>>w>>h>>S;\n if(!n&&!m&&!w&&!h&&!S)break;\n L[0][0]=point(0,0);\n L[0][1]=point(w,0);\n for(int i=1,a,b;i<=m;i++){\n cin>>a>>b;\n L[i][0]=point(0,a);\n L[i][1]=point(w,b);\n }\n \n double a,b;\n for(int i=0;i<n;i++)cin>>a>>b,A[i]=point(a,b);\n mk_arm();\n cout << solve()<<endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 620,
"memory_kb": 2764,
"score_of_the_acc": -0.1633,
"final_rank": 1
}
] |
aoj_1069_cpp
|
Problem H: Squid Multiplication
Squid Eiko loves mathematics.
Especially she loves to think about integer.
One day, Eiko found a math problem from a website.
"A sequence
b
={
a
i
+
a
j
|
i
<
j
} is generated from a sequence
a
={
a
0
, ... ,
a
n
|
a
i
is even if
i
is 0, otherwise
a
i
is odd}. Given the sequence
b
, find the sequence
a
."
This problem is easy for Eiko and she feels boring. So, she made a new problem by modifying this problem .
"A sequence
b
={
a
i
*
a
j
|
i
<
j
} is generated from a sequence
a
={
a
0
, ... ,
a
n
|
a
i
is even if
i
is 0, otherwise
a
i
is odd}. Given the sequence
b
, find the sequence
a
."
Your task is to solve the problem made by Eiko.
Input
Input consists of multiple datasets.
Each dataset is given by following formats.
n
b
0
b
1
...
b
n*(n+1)/2-1
n
is the number of odd integers in the sequence
a
. The range of
n
is 2 ≤
n
≤ 250.
b
i
is separated by a space.
Each
b
i
is 1 ≤
b
i
≤ 2
63
-1.
The end of the input consists of a single 0.
Output
For each dataset, you should output two lines.
First line contains
a
0
, an even number in the sequence
a
.
The second line contains
n
odd elements separated by a space. The odd elements are sorted by increasing order.
You can assume that the result is greater than or equal to 1 and less than or equal to 2
31
-1.
Sample input
3
6 10 14 15 21 35
2
30 42 35
0
Sample output
2
3 5 7
6
5 7
|
[
{
"submission_id": "aoj_1069_10946367",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <stdio.h>\n#include <math.h>\n#include <algorithm>\nusing namespace std;\n#define MAXN 450000\ntypedef long long LL;\nLL b[MAXN];\nLL a[MAXN];\nLL gcd(LL aa,LL bb){\n if(!bb){\n\t\treturn aa;\n\t}\n return gcd(bb,aa%bb);\n}\nLL solve(LL &X,LL &Y,LL up,int n){\n\t LL tmp0 = gcd(b[0],b[n]);\n X = b[0]/tmp0;\n\t Y = b[n]/tmp0;\n\t LL tmp1;\n\t tmp1 = b[1];\n\t tmp1/=X;\n\t tmp1/=Y;\n\t LL g = (LL)sqrt(tmp1*1.0);\n\t return g;\n}\nvoid output(int n){\n\tprintf(\"%lld\\n\",a[0]);\n\tsort(a+1,a+1+n);\n\tprintf(\"%lld\",a[1]);\n\tfor(int i=2;i<=n;++i)\n\t\tprintf(\" %lld\",a[i]); \n\tprintf(\"\\n\");\n}\nint main(){\n\t int n;\n\t while(scanf(\"%d\",&n)!=EOF){\n\t\t if(!n)break;\n\t\t int up = (n+1)*n/2;\n\t\t for(int i=0;i<up;++i){\n\t\t\tscanf(\"%lld\",&b[i]);\n\t\t }\n\t\t LL X,Y;\n\t\t LL g = solve(X,Y,up,n);\n\t\t a[0] = X*g;\n\t\t for(int i=1;i<=n;++i){\n\t\t\t a[i] = b[i-1]/a[0];\n\t\t }\n\t\t output(n);\n\t }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 5004,
"score_of_the_acc": -0.4875,
"final_rank": 8
},
{
"submission_id": "aoj_1069_10688901",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#define eps 1e-8\n#define MAXN 260\nusing namespace std;\nlong long odd[MAXN * MAXN], even[MAXN * MAXN];\nint p1, p2;\n\nint n;\n\nlong long gcd(long long a, long long b)\n{\n\tlong long c;\n\twhile (a % b > 0)\n\t{\n\t\tc = a % b;\n\t\ta = b;\n\t\tb = c;\n\t}\n\treturn b;\n}\n\nint main()\n{\n\tint i;\n\tlong long d;\n\tdouble tmp;\n\tlong long a0, a1, g, p, q, r;\n\twhile (scanf(\"%d\", &n) && n != 0)\n\t{\n\t\tfor (i = p1 = p2 = 0; i < (n + 1) * n / 2; i++)\n\t\t{\n\t\t\tcin >> d;\n\t\t\tif (d % 2 == 0)\n\t\t\t\teven[p2++] = d;\n\t\t\telse\n\t\t\t\todd[p1++] = d;\n\t\t}\n\t\tsort (odd, odd + p1);\n\t\tsort (even, even + p2);\n\t\tg = gcd(even[0], even[1]);\n\t\t// cout << g << \" \" << even[0] << \" \" << even[1] << endl;\n\t\tp = even[0] / g;\n\t\tq = even[1] / g;\n\t\tr = odd[0];\n\t\t// cout << p << endl;\n\t\t// cout << q << endl;\n\t\t// cout << r << endl;\n\t\ttmp = 1.0 * r / q * p;\n\t\ta1 = (long long)(sqrt(tmp) + eps);\n\t\t//a1 = (long long)(sqrt((r / q) * p) + eps);\n\t\t// printf(\"a1: %lld\\n\", a1);\n\t\ta0 = even[0] / a1;\n\t\tcout << a0 << endl;\n\t\tfor (i = 0; i < p2; i++)\n\t\t{\n\t\t\tcout << even[i] / a0;\n\t\t\tif (i == p2 - 1)\n\t\t\t\tcout << endl;\n\t\t\telse\n\t\t\t\tcout << \" \";\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 3748,
"score_of_the_acc": -0.5953,
"final_rank": 15
},
{
"submission_id": "aoj_1069_6450200",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define _max(a, b) ((a) > (b) ? (a) : (b))\n#define R register\nll n, m;\nll x[10000010], odd;\nvoid _Init() {\n m = n * (n + 1) / 2;\n ll cnt = 0;\n odd = 0x7fffffffffffffffLL;\n for(int i = 0; i < m; i++) {\n ll t;\n cin >> t;\n if((t % 2) == 0)\n x[cnt++] = t;\n else\n odd = min(odd, t);\n }\n}\n\nvoid solve() {\n sort(x, x + n);\n ll base = round(sqrt((double)x[0] * x[1] / odd));\n cout << base << endl;\n for(int i = 0; i < n; i++) {\n if(i)\n cout << \" \";\n cout << x[i] / base;\n }\n cout << endl;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"data.in\", \"r\", stdin);\n freopen(\"data.out\", \"w\", stdout);\n#endif\n while(cin >> n) {\n if(n == 0)\n break;\n _Init();\n solve();\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 3224,
"score_of_the_acc": -0.4808,
"final_rank": 7
},
{
"submission_id": "aoj_1069_6450152",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define _max(a, b) ((a) > (b) ? (a) : (b))\n#define R register\nll n, m;\nll x[10000010], odd;\nvoid _Init() {\n m = n * (n + 1) / 2;\n ll cnt = 0;\n odd = 0x7fffffffffffffffLL;\n for(int i = 0; i < m; i++) {\n ll t;\n cin >> t;\n if((t % 2) == 0)\n x[cnt++] = t;\n else\n odd = min(odd, t);\n }\n}\n\nvoid solve() {\n sort(x, x + n);\n ll base = (ll)(sqrt(x[0] * 1.0 * x[1] / odd) + 0.5);\n cout << base << endl;\n for(int i = 0; i < n; i++) {\n if(i)\n cout << \" \";\n cout << x[i] / base;\n }\n cout << endl;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"data.in\", \"r\", stdin);\n freopen(\"data.out\", \"w\", stdout);\n#endif\n while(cin >> n) {\n if(n == 0)\n break;\n _Init();\n solve();\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 3064,
"score_of_the_acc": -0.4459,
"final_rank": 5
},
{
"submission_id": "aoj_1069_6450144",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define _max(a, b) ((a) > (b) ? (a) : (b))\n#define R register\nll n, m;\nll x[10000010], odd;\nvoid _Init() {\n m = n * (n + 1) / 2;\n ll cnt = 0;\n odd = 0x7fffffffffffffffLL;\n for(int i = 0; i < m; i++) {\n ll t;\n cin >> t;\n if((t % 2) == 0)\n x[cnt++] = t;\n else\n odd = min(odd, t);\n }\n}\n\nvoid solve() {\n sort(x, x + n);\n ll base = (ll)(sqrtl(x[0] * 1.0 * x[1] / odd) + 0.5);\n cout << base << endl;\n for(int i = 0; i < n; i++) {\n if(i)\n cout << \" \";\n cout << x[i] / base;\n }\n cout << endl;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"data.in\", \"r\", stdin);\n freopen(\"data.out\", \"w\", stdout);\n#endif\n while(cin >> n) {\n if(n == 0)\n break;\n _Init();\n solve();\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 3112,
"score_of_the_acc": -0.4563,
"final_rank": 6
},
{
"submission_id": "aoj_1069_6448701",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nconst int N = 500;\nint n;\nvector<long long> even;\nvector<long long> odd;\nlong long x;\n\nint main() {\n\twhile(cin>>n && n) {\n\t\teven.clear();\n\t\todd.clear();\n\t\tfor(int i=0;i<n*(n+1)/2;i++) {\n\t\t\tcin>>x;\n\t\t\tif(x&1)\n\t\t\t\todd.push_back(x);\n\t\t\telse \n\t\t\t\teven.push_back(x);\n\t\t}\n\t\tsort(even.begin(),even.end());\n\t\tsort(odd.begin(),odd.end());\n\n\t\tlong long a0 = sqrt((double)even[0]/(double)odd[0]*(double)even[1])+0.5;\n\t\tcout<<a0<<endl;\n\t\tfor(int i=0;i<even.size();i++) {\n\t\t\tif(i) cout<<\" \";\n\t\t\tcout<<even[i] / a0;\n\t\t}\n\t\tcout<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 3284,
"score_of_the_acc": -0.5822,
"final_rank": 14
},
{
"submission_id": "aoj_1069_6448370",
"code_snippet": "#include <bits/stdc++.h>\n\n#define pb push_back\n#define mp make_pair\n#define X first\n#define Y second\nusing namespace std;\n\ntypedef long long int ll;\ntypedef vector <int> vi;\ntypedef pair <int,int> pii;\nconst int Size=1e6+10;\nconst int INF=0x3f3f3f3f;\n\ninline ll read()\n{\n ll x=0, f=1; char ch=getchar();\n while(ch<'0' || ch>'9') {if(ch=='-') f=-1; ch=getchar();}\n while(ch>='0' && ch<='9') {x=x*10+ch-'0'; ch=getchar();}\n return x*f;\n}\n\n\nll gcd(ll a,ll b)\n{\n if (b==0) return a;\n return gcd(b,a%b);\n}\n\nll n_gcd(vector<ll> a)\n{\n ll res=a[0];\n int siz=a.size();\n for (int i=1;i<siz;++i) res=gcd(res,a[i]);\n return res;\n}\n\nint main()\n{\n while (1)\n {\n int n=read();\n if (!n) break;\n\n vector<ll> odd,even;\n int N=n*(n+1)/2;\n ll t;\n for (int i=0;i<N;++i)\n {\n t=read();\n if (t%2==0) even.pb(t);\n else odd.pb(t);\n }\n sort(even.begin(),even.end());\n sort(odd.begin(),odd.end());\n\n ll gcd=n_gcd(even),gcd_odd;\n int siz=even.size();\n for (int i=0;i<siz;++i)\n even[i]/=gcd;\n gcd_odd=sqrt(odd[0]/even[0]/even[1]);\n\n ll e=gcd/gcd_odd;\n printf(\"%lld\\n\",e);\n for (int i=0;i<siz;++i)\n {\n if (i) printf(\" \");\n printf(\"%lld\",even[i]*gcd_odd);\n }\n puts(\"\");\n }\n\n\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3692,
"score_of_the_acc": -0.1713,
"final_rank": 2
},
{
"submission_id": "aoj_1069_6448342",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\n\nint main(){\n ll n;\n while(cin>>n,n){\n vector<ll> e,o;\n for(ll i=0,x;i<n*(n+1)/2;i++){\n cin>>x;\n if(x%2)o.push_back(x);\n else e.push_back(x);\n }\n sort(e.begin(),e.end());\n sort(o.begin(),o.end());\n ll x=e[0],y=e[1],z=o[0];\n ll tp=__gcd(x,z);\n x/=tp,z/=tp,y/=z;\n ll an=sqrt(x*y+0.1);\n cout<<an<<endl;\n for(ll i=0;i<e.size();i++){\n if(i)cout<<' ';\n cout<<e[i]/an;\n }\n cout<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 3356,
"score_of_the_acc": -0.5979,
"final_rank": 16
},
{
"submission_id": "aoj_1069_6448312",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <string>\n#include <queue>\n#include <vector>\n#include <stack>\n#include <map>\n#include <set>\n#include <utility>\n#define cs cout << \"Wish You AC!\" << endl;\n#define js ios::sync_with_stdio(false); cin.tie(0);\n#define MEM(a,x) memset(a,x,sizeof(a))\n#define lowbit(x) (x&-x)\n#define lson(x) x*2\n#define rson(x) x*2 + 1\n#define ll long long\n#define ull unsigned long long\n#define debug(x) std::cout << #x << \" is \" << (x) << '\\n'\n#define INF 1e8\n#define pb push_back\n#define pii pair<ll, ll>\nusing namespace std;\ninline void read(ll &x){\n char c; int flag=0;\n while(!isdigit(c=getchar()))\n if(c=='-') flag=1;\n x=c-'0';\n while(isdigit(c=getchar()))\n x=x*10+c-'0';\n if(flag) x=-x;\n}\nconst int N = 2e6 + 10;\nll a[N];\nll b[N];\nint main()\n{\n ll n;\n while(cin >> n)\n {\n if(!n) break;\n double t = 1;\n ll nn = n*(n+1)/2 - 1;\n for(ll i = 0; i <= nn; i++){\n cin >> b[i];\n if(b[i] % 2 == 0){\n t *= pow((double)b[i], 1.0/n);\n }\n else t *= pow((double)b[i], -1.0/n/(n-1));\n }\n ll aa = (ll)(t+0.5);\n ll cnt = 0;\n for(ll i = 0; i <= nn; i++){\n if(b[i] % 2 == 0){\n a[++cnt] = b[i] / aa;\n }\n }\n sort(a+1, a+cnt+1);\n cout << aa << endl;\n for(ll i = 1; i <= cnt; i++){\n if(i > 1) cout << ' ';\n cout << a[i];\n }\n cout << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 3604,
"score_of_the_acc": -0.6815,
"final_rank": 17
},
{
"submission_id": "aoj_1069_5998163",
"code_snippet": "#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<cmath>\n\n#define MAXX 65555\n\nunsigned long long gcd(const unsigned long long &a,const unsigned long long &b)\n{\n return b?gcd(b,a%b):a;\n}\n\nunsigned long long n,i,j,k,m;\nunsigned long long num[MAXX],g;\nstd::vector<unsigned long long>ev,od;\n\nint main()\n{\n ev.reserve(MAXX);\n od.reserve(MAXX);\n while(scanf(\"%llu\",&n),n)\n {\n m=n*(n+1)/2;\n ev.resize(0);\n od.resize(0);\n for(i=0;i<m;++i)\n {\n scanf(\"%llu\",num+i);\n if(!(num[i]&1))\n ev.push_back(num[i]);\n else\n od.push_back(num[i]);\n }\n std::sort(ev.begin(),ev.end());\n std::sort(od.begin(),od.end());\n g=ev[0];\n for(i=1;i<ev.size();++i)\n g=gcd(g,ev[i]);\n k=od[0]/(ev[0]/g)/(ev[1]/g);\n g/=sqrt(k);\n printf(\"%llu\\n%llu\",g,ev[0]/g);\n for(i=1;i<ev.size();++i)\n printf(\" %llu\",ev[i]/g);\n puts(\"\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 2908,
"score_of_the_acc": -0.1176,
"final_rank": 1
},
{
"submission_id": "aoj_1069_4055262",
"code_snippet": "#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1069\"\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\nstruct FastIO{\n FastIO(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n}fastio_beet;\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n/*\n multiprecision:\n #include <boost/multiprecision/cpp_int.hpp>\n using Int = boost::multiprecision::cpp_int;\n*/\n#endif\n//BEGIN CUT HERE\n__int128_t abs128(__int128_t val){return val<0?-val:val;}\n\nostream &operator<<(ostream &os,__int128_t val){\n if(ostream::sentry(os)){\n __uint128_t tmp=abs128(val);\n char buf[64];\n char *d=end(buf);\n do{\n --d;\n *d=char(tmp%10+'0');\n tmp/=10;\n }while(tmp);\n if(val<0) *--d='-';\n int len=end(buf)-d;\n if(os.rdbuf()->sputn(d,len)!=len){\n os.setstate(ios_base::badbit);\n }\n }\n return os;\n}\n\nistream &operator>>(istream &is,__int128_t &val){\n string s;\n is>>s;\n val=0;\n for(int i=0;i<(int)s.size();i++)\n if(isdigit(s[i])) val=val*10+s[i]-'0';\n if(s[0]=='-') val*=-1;\n return is;\n}\n//END CUT HERE\n#ifndef call_from_test\n//INSERT ABOVE HERE\nsigned main(){\n return 0;\n}\n#endif\n\n#undef call_from_test\n\nusing ll = __int128_t;\n\nll sqrt(ll x){\n assert(x>=0);\n if(x<=1) return x;\n ll l=0,r=x;\n while(l+1<r){\n ll m=(l+r)>>1;\n if(m<=x/m&&m*m<=x) l=m;\n else r=m;\n }\n return l;\n}\n\nsigned main(){\n int n;\n while(cin>>n,n){\n int m=n*(n+1)/2;\n\n vector<ll> bs(m),es,os;\n for(int i=0;i<m;i++) cin>>bs[i];\n for(ll b:bs)\n ((b&1)?os:es).emplace_back(b);\n\n sort(es.begin(),es.end());\n sort(os.begin(),os.end());\n\n ll a=sqrt(es[0]*es[1]/os[0]);\n cout<<a<<endl;\n for(int i=0;i<n;i++){\n if(i) cout<<\" \";\n cout<<es[i]/a;\n }\n cout<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 4560,
"score_of_the_acc": -0.5669,
"final_rank": 13
},
{
"submission_id": "aoj_1069_4044033",
"code_snippet": "#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1069\"\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\nstruct FastIO{\n FastIO(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n}fastio_beet;\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n/*\n multiprecision:\n #include <boost/multiprecision/cpp_int.hpp>\n using Int = boost::multiprecision::cpp_int;\n*/\n#endif\n//BEGIN CUT HERE\nusing ll = __int128_t;\nll abs128(ll val){return val<0?-val:val;}\n\nostream &operator<<(ostream &os,ll val){\n if(ostream::sentry(os)){\n __uint128_t tmp=abs128(val);\n char buf[64];\n char *d=end(buf);\n do{\n --d;\n *d=char(tmp%10+'0');\n tmp/=10;\n }while(tmp);\n if(val<0) *--d='-';\n int len=end(buf)-d;\n if(os.rdbuf()->sputn(d,len)!=len){\n os.setstate(ios_base::badbit);\n }\n }\n return os;\n}\n\nistream &operator>>(istream &is,ll &val){\n string s;\n is>>s;\n val=0;\n for(int i=0;i<(int)s.size();i++)\n if(isdigit(s[i])) val=val*10+s[i]-'0';\n if(s[0]=='-') val*=-1;\n return is;\n}\n//END CUT HERE\n#ifndef call_from_test\n\ntemplate<typename T>\nT extgcd(T a,T b,T& x,T& y){\n T d=a;\n if(b!=0){\n d=extgcd(b,a%b,y,x);\n y-=(a/b)*x;\n }else{\n x=1;y=0;\n }\n return d;\n}\n\ntemplate<typename T>\nT mod_inverse(T a,T mod){\n T x,y;\n extgcd(a,mod,x,y);\n return (x%mod+mod)%mod;\n}\n\n//INSERT ABOVE HERE\nsigned main(){\n ll n,R;\n ll cnt=0;\n while(cin>>n>>R,n){\n cout<<\"Case #\"<<++cnt<<\":\";\n ll r=R;\n vector<ll> v(n);\n for(ll i=0;i<n;i++){\n ll k;\n cin>>k;\n v[i]=k;\n }\n ll g=v[0];\n for(ll i=0;i<n;i++) g=__gcd(g,v[i]);\n if(abs128(r)%g){\n cout<<\" Stupid keypad!\"<<endl;\n continue;\n }\n vector<ll> ans(n,0);\n auto print=\n [&](){\n ll tmp=0;\n for(ll i=0;i<n;i++) tmp+=v[i]*ans[i];\n assert(tmp==r);\n for(ll i=0;i<n;i++) cout<<\" \"<<ans[i];\n cout<<endl;\n };\n\n bool f=0;\n for(ll i=0;i<n;i++){\n if(abs128(r)%v[i]==0){\n ans[i]=r/v[i];\n f=1;\n break;\n }\n }\n\n if(f){\n print();\n continue;\n }\n\n ll res=v[0];\n ans[0]=1;\n for(ll i=1;i<n;i++){\n ll k=__gcd(res,v[i]);\n if(k==res) continue;\n ll x,y;\n extgcd(res,v[i],x,y);\n for(ll j=0;j<i;j++) ans[j]*=x;\n ans[i]=y;\n res=k;\n }\n for(ll i=0;i<n;i++) ans[i]*=(r/res);\n print();\n }\n\n return 0;\n}\n\n/*\n verified on 2019/10/22\n https://vjudge.net/problem/UVA-12980\n*/\n#endif\n\n#undef call_from_test\n\nll sqrt(ll x){\n assert(x>=0);\n if(x<=1) return x;\n ll l=0,r=x;\n while(l+1<r){\n ll m=(l+r)>>1;\n if(m<=x/m&&m*m<=x) l=m;\n else r=m;\n }\n return l;\n}\n\nsigned main(){\n int n;\n while(cin>>n,n){\n int m=n*(n+1)/2;\n\n vector<ll> bs(m),es,os;\n for(int i=0;i<m;i++) cin>>bs[i];\n for(ll b:bs)\n ((b&1)?os:es).emplace_back(b);\n\n sort(es.begin(),es.end());\n sort(os.begin(),os.end());\n\n ll a=sqrt(es[0]*es[1]/os[0]);\n cout<<a<<endl;\n for(int i=0;i<n;i++){\n if(i) cout<<\" \";\n cout<<es[i]/a;\n }\n cout<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 4508,
"score_of_the_acc": -0.5555,
"final_rank": 12
},
{
"submission_id": "aoj_1069_4044031",
"code_snippet": "#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1069\"\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n/*\n multiprecision:\n #include <boost/multiprecision/cpp_int.hpp>\n using Int = boost::multiprecision::cpp_int;\n*/\n#endif\n//BEGIN CUT HERE\nusing ll = __int128_t;\nll abs128(ll val){return val<0?-val:val;}\n\nostream &operator<<(ostream &os,ll val){\n if(ostream::sentry(os)){\n __uint128_t tmp=abs128(val);\n char buf[64];\n char *d=end(buf);\n do{\n --d;\n *d=char(tmp%10+'0');\n tmp/=10;\n }while(tmp);\n if(val<0) *--d='-';\n int len=end(buf)-d;\n if(os.rdbuf()->sputn(d,len)!=len){\n os.setstate(ios_base::badbit);\n }\n }\n return os;\n}\n\nistream &operator>>(istream &is,ll &val){\n string s;\n is>>s;\n val=0;\n for(int i=0;i<(int)s.size();i++)\n if(isdigit(s[i])) val=val*10+s[i]-'0';\n if(s[0]=='-') val*=-1;\n return is;\n}\n//END CUT HERE\n#ifndef call_from_test\n\ntemplate<typename T>\nT extgcd(T a,T b,T& x,T& y){\n T d=a;\n if(b!=0){\n d=extgcd(b,a%b,y,x);\n y-=(a/b)*x;\n }else{\n x=1;y=0;\n }\n return d;\n}\n\ntemplate<typename T>\nT mod_inverse(T a,T mod){\n T x,y;\n extgcd(a,mod,x,y);\n return (x%mod+mod)%mod;\n}\n\n//INSERT ABOVE HERE\nsigned main(){\n ll n,R;\n ll cnt=0;\n while(cin>>n>>R,n){\n cout<<\"Case #\"<<++cnt<<\":\";\n ll r=R;\n vector<ll> v(n);\n for(ll i=0;i<n;i++){\n ll k;\n cin>>k;\n v[i]=k;\n }\n ll g=v[0];\n for(ll i=0;i<n;i++) g=__gcd(g,v[i]);\n if(abs128(r)%g){\n cout<<\" Stupid keypad!\"<<endl;\n continue;\n }\n vector<ll> ans(n,0);\n auto print=\n [&](){\n ll tmp=0;\n for(ll i=0;i<n;i++) tmp+=v[i]*ans[i];\n assert(tmp==r);\n for(ll i=0;i<n;i++) cout<<\" \"<<ans[i];\n cout<<endl;\n };\n\n bool f=0;\n for(ll i=0;i<n;i++){\n if(abs128(r)%v[i]==0){\n ans[i]=r/v[i];\n f=1;\n break;\n }\n }\n\n if(f){\n print();\n continue;\n }\n\n ll res=v[0];\n ans[0]=1;\n for(ll i=1;i<n;i++){\n ll k=__gcd(res,v[i]);\n if(k==res) continue;\n ll x,y;\n extgcd(res,v[i],x,y);\n for(ll j=0;j<i;j++) ans[j]*=x;\n ans[i]=y;\n res=k;\n }\n for(ll i=0;i<n;i++) ans[i]*=(r/res);\n print();\n }\n\n return 0;\n}\n\n/*\n verified on 2019/10/22\n https://vjudge.net/problem/UVA-12980\n*/\n#endif\n\n#undef call_from_test\n\nll sqrt(ll x){\n assert(x>=0);\n if(x<=1) return x;\n ll l=0,r=x;\n while(l+1<r){\n ll m=(l+r)>>1;\n if(m<=x/m&&m*m<=x) l=m;\n else r=m;\n }\n return l;\n}\n\nsigned main(){\n int n;\n while(cin>>n,n){\n int m=n*(n+1)/2;\n\n vector<ll> bs(m),es,os;\n for(int i=0;i<m;i++) cin>>bs[i];\n for(ll b:bs)\n ((b&1)?os:es).emplace_back(b);\n\n sort(es.begin(),es.end());\n sort(os.begin(),os.end());\n\n ll a=sqrt(es[0]*es[1]/os[0]);\n cout<<a<<endl;\n for(int i=0;i<n;i++){\n if(i) cout<<\" \";\n cout<<es[i]/a;\n }\n cout<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 330,
"memory_kb": 4448,
"score_of_the_acc": -1.2189,
"final_rank": 19
},
{
"submission_id": "aoj_1069_3958796",
"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>\n\nlong long int gcd(const long long int a, const long long int b) {\n\treturn (b == 0) ? a : gcd(b, a % b);\n}\nint main() {\n\twhile (true) {\n\t\tint n; std::cin >> n; if (n == 0) break;\n\t\tstd::vector<long long int> numbers(n * (n + 1) / 2), even; for (auto& b : numbers) std::cin >> b;\n\t\tstd::copy_if(numbers.begin(), numbers.end(), std::back_inserter(even), [](const long long int n) {return n % 2 == 0; });\n\t\tstd::sort(even.begin(), even.end());\n\t\tlong long int odd_min = LLONG_MAX;\n\t\tfor (const auto& b : numbers) if (b % 2 == 1) odd_min = std::min(odd_min, b);\n\t\tconst auto a0g = gcd(even[0], even[1]);\n\t\tconst auto ab = (even[0] / a0g) * (even[1] / a0g);\n\t\tconst auto gcd_square = odd_min / ab;\n\t\tconst auto gcd = static_cast<int>(std::sqrt(gcd_square));\n\t\tconst auto a0 = a0g / gcd;\n\t\tstd::cout << a0 << '\\n';\n\t\tfor (auto i = 0; i < even.size(); ++i) {\n\t\t\tif (i != 0) std::cout << ' ';\n\t\t\tstd::cout << even[i] / a0;\n\t\t}\n\t\tstd::cout << '\\n';\n\t}\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 3356,
"score_of_the_acc": -0.5391,
"final_rank": 10
},
{
"submission_id": "aoj_1069_3544236",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nusing L = __int128;\n\nint main(){\n int n;\n while(scanf(\" %d\", &n),n){\n vector<vector<ll>> b(n+1, vector<ll>(n+1));\n rep(i,n+1){\n for(int j=i+1; j<n+1; ++j) scanf(\" %lld\", &b[i][j]);\n }\n\n L sq_a0 = (L)b[0][1]*b[0][2];\n sq_a0 /= b[1][2];\n\n ll ng=0, ok=(1LL<<31)-1;\n while(ok-ng>1){\n ll mid = (ng+ok)/2;\n if(sq_a0 <= mid*mid) ok = mid;\n else ng = mid;\n }\n\n ll a0 = ok;\n printf(\"%lld\\n\", a0);\n\n vector<ll> a;\n for(int i=1; i<=n; ++i) a.pb(b[0][i]/a0);\n sort(all(a));\n rep(i,n) printf(\"%lld%c\", a[i], \" \\n\"[i==n-1]);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3488,
"score_of_the_acc": -0.1856,
"final_rank": 3
},
{
"submission_id": "aoj_1069_3349842",
"code_snippet": "#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\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\tint N;\n\twhile (cin >> N, N) {\n\t\tint S = N * (N + 1) / 2;\n\t\tvector<long long> v(S);\n\t\tfor (int i = 0; i < S; ++i) cin >> v[i];\n\t\tlong long G = -1;\n\t\tvector<long long> evens;\n\t\tlong long oddmin = ~(1LL << 63);\n\t\tfor (int i = 0; i < S; ++i) {\n\t\t\tif (v[i] % 2 == 0) {\n\t\t\t\tif (G == -1) G = v[i];\n\t\t\t\telse G = gcd(G, v[i]);\n\t\t\t\tevens.push_back(v[i]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\toddmin = min(oddmin, v[i]);\n\t\t\t}\n\t\t}\n\t\tsort(evens.begin(), evens.end());\n\t\tfor (int i = 0; i < N; ++i) evens[i] /= G;\n\t\tlong long coeff = oddmin / evens[0] / evens[1];\n\t\tlong long sqcoeff = sqrt(coeff + 0.5);\n\t\tcout << G / sqcoeff << endl;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tif (i) cout << ' ';\n\t\t\tcout << evens[i] * sqcoeff;\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 3320,
"score_of_the_acc": -0.5018,
"final_rank": 9
},
{
"submission_id": "aoj_1069_3078398",
"code_snippet": "#include \"bits/stdc++.h\"\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n#include<unordered_map>\n\n\n\nconst int mod = 998244353;\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}\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 10240\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\nvector<vector<int>>flag(1001,vector<int>(1001));\n\nMod solve(int rest, int now,vector<vector<Mod>>&memo,const vector<int>&nums) {\n\tif (!flag[rest][now]) {\n\t\tflag[rest][now]=true;\n\t\tif (now == 1) {\n\t\t\treturn memo[rest][now] = 1;\n\t\t}\n\t\telse {\n\n\t\t\tMod ans = 0;\n\t\t\tMod mo = 1;\n\t\t\tfor (int k = 0; k <= rest / now; ++k) {\n\n\t\t\t\tans += solve(rest - k*now + nums[now - 1], now - 1, memo, nums)*mo;\n\t\t\t\tmo = mo*comb(rest - k*now, now);\n\t\t\t\tmo = mo / Mod(k + 1);\n\t\t\t}\n\n\t\t\treturn memo[rest][now] = ans;\n\t\t}\n\t}\n\telse {\n\t\treturn memo[rest][now];\n\t}\n}\nint main() {\n\twhile (true) {\n\n\t\tint N; cin >> N;\n\t\tif(!N)break;\n\t\tvector<long long int>odds, as;\n\t\tfor (int i = 0; i < N*(N + 1)/2; ++i) {\n\t\t\tlong long int a; cin >> a;\n\t\t\tif (a % 2)odds.push_back(a);\n\t\t\telse as.push_back(a);\n\t\t}\n\t\tsort(odds.begin(), odds.end());\n\t\tsort(as.begin(), as.end());\n\n\t\tlong long int ans = round(sqrt(ld(as[as.size() - 1])*as[as.size() - 2] / odds.back()) + eps);\n\n\t\tvector<long long int>ans2;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tans2.push_back(as[i] / ans);\n\t\t}\n\t\tcout << ans << endl;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcout << ans2[i];\n\t\t\tif(i==N-1)cout<<endl;\n\t\t\telse cout<<\" \";\n\t\t}\n\t}\n\t\n\treturn 0;\n\n}",
"accuracy": 1,
"time_ms": 210,
"memory_kb": 7484,
"score_of_the_acc": -1.5294,
"final_rank": 20
},
{
"submission_id": "aoj_1069_2648231",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n#define pb push_back \n#define pf push_front \n#define mp make_pair\n#define fr first\n#define sc second\n#define Rep(i, n) for ( int i = 0 ; i < (n); i++ )\n#define All(v) v.begin(), v.end()\n\ntypedef pair<int, int> Pii; typedef pair<int, Pii> Pip;\nconst int INF = 1107110711071107;\n\nint n, N;\nvector<int> even_b, odd_b;\n\nbool check(double x) {\n vector<double> a(2);\n Rep(i, 2) a[i] = (double)even_b[i] / x;\n if ( a[0]*a[1] > (double)odd_b[0] ) return false; \n else return true;\n}\n\nsigned main() { \n while ( cin >> n, n ) {\n N = n * (n+1) / 2;\n even_b.clear();\n odd_b.clear();\n \n Rep(i, N) {\n int b;\n cin >> b;\n if ( b % 2 ) odd_b.pb(b);\n else even_b.pb(b);\n }\n\n sort(All(even_b));\n sort(All(odd_b));\n \n double l = 1.0, r = (1 << 31)-1;\n int cnt = 100;\n while ( cnt-- ) {\n double mid = (r + l) / 2.0; \n if ( check(mid) ) r = mid;\n else l = mid;\n }\n \n int ans = (double)r;\n \n cout << ans << endl;\n Rep(i, n) {\n if ( i ) cout << \" \";\n cout << even_b[i] / ans;\n }\n cout << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 3148,
"score_of_the_acc": -0.5524,
"final_rank": 11
},
{
"submission_id": "aoj_1069_2648187",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n#define pb push_back \n#define pf push_front \n#define mp make_pair\n#define fr first\n#define sc second\n#define Rep(i, n) for ( int i = 0 ; i < (n); i++ )\n#define All(v) v.begin(), v.end()\n\ntypedef pair<int, int> Pii; typedef pair<int, Pii> Pip;\nconst int INF = 1107110711071107;\n\nint n, N;\nvector<int> even_b, odd_b;\n\nbool check(double x) {\n vector<double> a(2);\n Rep(i, 2) a[i] = (double)even_b[i] / x;\n if ( a[0]*a[1] > (double)odd_b[0] ) return false; \n else return true;\n}\n\nbool check_last(int x) {\n vector<int> a(2);\n Rep(i, 2) {\n if ( even_b[i] % x ) return false;\n a[i] = even_b[i] / x;\n }\n if ( a[0]*a[1] == odd_b[0] ) return true; \n else return false;\n}\n\nsigned main() { \n while ( cin >> n, n ) {\n N = n * (n+1) / 2;\n even_b.clear();\n odd_b.clear();\n \n Rep(i, N) {\n int b;\n cin >> b;\n if ( b % 2 ) odd_b.pb(b);\n else even_b.pb(b);\n }\n\n sort(All(even_b));\n sort(All(odd_b));\n \n double l = 1.0, r = (1 << 31)-1;\n int cnt = 100;\n while ( cnt-- ) {\n double mid = (r + l) / 2.0; \n if ( check(mid) ) r = mid;\n else l = mid;\n }\n\n //cout << r << endl;\n int ans = (double)r-1;\n while ( 1 ) {\n if ( ans % 2 ) ans++;\n if ( check_last(ans) ) break;\n }\n \n cout << ans << endl;\n Rep(i, n) {\n if ( i ) cout << \" \";\n cout << even_b[i] / ans;\n }\n cout << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 370,
"memory_kb": 3228,
"score_of_the_acc": -1.0699,
"final_rank": 18
},
{
"submission_id": "aoj_1069_2646314",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nusing Int2 = __int128_t;\nsigned main(){ \n cin.tie(0);\n ios::sync_with_stdio(0);\n Int n;\n while(cin>>n,n){\n vector<Int> b(n*(n+1)/2),e,o;\n for(Int i=0;i<(Int)b.size();i++) cin>>b[i];\n for(Int i=0;i<(Int)b.size();i++)\n if(b[i]%2==0) e.push_back(b[i]);\n else o.push_back(b[i]);\n sort(e.begin(),e.end());\n sort(o.begin(),o.end());\n Int a=sqrt((Int)((Int2)e[0]*e[1]/o[0]));\n cout<<a<<endl;\n for(Int i=0;i<n;i++){\n if(i) cout<<\" \";\n cout<<e[i]/a;\n }\n cout<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3580,
"score_of_the_acc": -0.2645,
"final_rank": 4
}
] |
aoj_1073_cpp
|
Problem L: The Tower
Your task is to write a program that reads some lines of command for the following game and simulates operations until the player reaches the game over. We call following 2-dimensional grid of
m
by
n
characters Tower. The objective of this game is to move blocks in the tower to climb to a goal block. In the following grid, the bottom line is the first row and the top one is the
n
-th row. The leftmost column is the first column and the rightmost one is the
m
-th column.
.................... (
n
=13 th row)
.....#.....G........
....##.....##.....##
...####...IIII...###
..####.....##.....##
...####B..####....##
....###....#33##..##
.....####...#33#3.##
.##CCCC#####2##.####
..#####..###.#...###
...###....###.....#1
....####..##.......#
S..###..#.####.....# (1st row)
Explanation of cell marks:
'#' : Normal block
Normal block.
'I' : Ice block
Block made of the ice. This has different features from the normal one.
'G' : Goal block
If the player climbs to this, game is over and clear.
'C' : Fixed block
The player can not move this directly.
'B' : Different dimensional block
If the player climbs to this, game is over and lose.
'.' : Space
Empty place.
'3' : Fragile block(3)
A fragile block of count 3.
'2' : Fragile block(2)
A fragile block of count 2.
'1' : Fragile block(1)
A fragile block of count 1. If the count is zero, this block will be broken and become a space.
'S' : Player
The player.
Explanation of relative positions:
123
4S5
678
In the following description, assume that left up is the position of 1, up(over S) is 2, right up is 3, left is 4, right is 5, left down is 6, down(under S) is 7, right down is 8 for S.
Movements of the player
The player must not go out of the tower. The outside of the tower is considered as space cells.
Move
The player can move everywhere in the current row as long as some of the following conditions are satisfied.
The player is in the first row and the target cell is a space.
There are blocks under the route connecting the current cell and the target cell (horizontal segment) and the target cell is a space. It is OK that some blocks in the horizontal segment. And the case that some of blocks under the segment are different dimensional ones, it is also OK.
Climb
If the player at the row below the n-th row (from 1st to n-1 th row) and there is a block in the right(left) and both of a cell over the player (up cell) and a right up(left up) cell are space, the player can move to the right up(left up) cell.
Get down
If the player at the row above the 1st row (from 2nd to n-th row), he can get down to right(left) down. If the direction for getting down is right(left) and if there is no blocks in the right down (left down) cell and the right (left) cell, the player can move to the right down (left down) cell.
Push
If there is a block or continuous blocks in the right or left of the player, he can push the blocks to the direction one cell. Here, blocks are "continuous" if there are two or more block
...(truncated)
|
[
{
"submission_id": "aoj_1073_3474912",
"code_snippet": "#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\n#define int long long\nusing namespace std;\ntypedef pair<int,int>P;\n#define F first\n#define S second\n\nvoid INPUT();\nint s_to_i(string z);\n\nstring s[55],com[1000],DIR[1000];\nint x,y,gx,gy,n,h,w,ppp=1;\n\nvoid GO(int Y,int X){\n\tif(s[y-1][x]=='3')s[y-1][x]='2';\n\telse if(s[y-1][x]=='2')s[y-1][x]='1';\n\telse if(s[y-1][x]=='1')s[y-1][x]='.';\n\ty = Y;\n\tx = X;\n}\n\nvoid Moveto(int t){\n\tif(s[y][t]!='.'||x==t||y==h-1)return;\n\n\tint off=(x<t?1:-1);\n\tint nx=x;\n\n\tif(y==1){\n\t\tGO(y,t);\n\t\treturn;\n\t}\n\n\tint f=0;\n\n\twhile(0<=nx&&nx<w&&nx!=t){\n\t\tif(s[y-1][nx+off]=='.')return;\n\t\tnx+=off;\n\t}\n\n\tGO(y,nx);\n\treturn;\n}\n\nvoid Climb(string z){\n\tint ty=1;\n\tint tx=(z==\"LEFT\"?-1:1);\n\tif(y>=h-2)return;\n\tif( y+ty<0 || h<=y+ty || x+tx<0 || w<=x+tx )return;\n\tif( s[y][x+tx] == '.' )return;\n\tif( s[y+1][x+tx] == '.' && s[y+1][x] == '.' ){\n\t\tGO(y+ty,x+tx);\n\t}\n\treturn;\n}\n\nvoid Getdown(string z){\n\tint ty=-1;\n\tint tx=(z==\"LEFT\"?-1:1);\n\tif( y+ty<0 || h<=y+ty || x+tx<0 || w<=x+tx )return;\n\tif( s[y][x+tx] == '.' && s[y-1][x+tx] == '.' ){\n\t\tGO(y+ty,x+tx);\n\t}\n\treturn;\n}\n\nvoid Pull(string z){\n\tint tx=(z==\"LEFT\"?1:-1);\n\tif( x+tx<0 || w<=x+tx )return;\n\tif( x-tx<0 || w<=x-tx )return;\n\tif( s[y][x+tx] == 'C' )return;\n\tif( s[y][x+tx] == '.' )return;\n\tif( s[y][x-tx] != '.' )return;\n\ts[y][x]=s[y][x+tx];\n\ts[y][x+tx]='.';\n\tGO(y,x-tx);\n\treturn;\n}\n\nvoid Push(string z){\n\tint tx=(z==\"LEFT\"?-1:1);\n\tif( x+tx<0 || w<=x+tx )return;\n\tint nx=x+tx;\n\twhile(0<=nx&&nx<w&&s[y][nx]!='.'){\n\t\tif(s[y][nx]=='C')return;\n\t\tnx+=tx;\n\t}\n\t//r(i,h)cout<<s[h-1-i]<<endl;\n\tnx-=tx;\n\tfor(int i=nx;i!=x;i-=tx){\n\t\tint p=i;\n\t\twhile(1){\n\t\t\tif(p+tx<0 || w<=p+tx){\n\t\t\t\ts[y][p]='.';\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(s[y][p+tx]!='.')break;\n\t\t\ts[y][p+tx]=s[y][p];\n\t\t\ts[y][p]='.';\n\t\t\tif(!((s[y][p+tx]=='I'&&s[y-1][p+tx]!='.')||(s[y-1][p+tx]=='I')))break;\n\t\t\tp+=tx;\n\t\t}\n\t}\n\t//r(i,h)cout<<s[h-1-i]<<endl;\n}\n\nint RAKKA(){\n//if(ppp==1920){s[y][x]='S';r(i,h)cout<<s[h-1-i]<<endl;s[y][x]='.';}\n//cout<<y<<' '<<x<<endl;\n\tL:;\n\tr(i,h-1)r(j,w){\n\t//\tcout<<i<<' '<<j<<endl;\n\t\tif(s[i][j]=='B'){\n\t//\t\tcout<<i<<' '<<j<<endl;\n\t\t\tif(i+1==y&&j==x)return 2;\n\t\t\tif(ppp>=1900&&s[i+1][j]=='G')continue;\n\t\t\ts[i+1][j]='.';\n\t\t}\n\t}\n\tint T=0;\n\twhile(s[y-1][x]=='.')y--,T++;\n\tif(T)goto L;\n\tint XXX=0;\n\t//s[y][x]='S';r(i,h)cout<<s[h-1-i]<<endl;s[y][x]='.';\n\tr(i,h-1)r(j,w){\n\t//\tcout<<i<<' '<<j<<endl;\n\t\tif(s[i][j]=='G'){\n\t\t\tif(i!=gy||j!=gx)return 4;\n\t\t\tif(i+1==y&&j==x)return 1;\n\t\t\tXXX++;\n\t\t}\n\t// cout<<i<<' '<<j<<endl;\n\t}\n\tif(!XXX)return 4;\n\t//cout<<y<<' '<<x<<endl;\n\tLL:;\n\tfor(int i=2;i<h;i++){\n\t\tfor(int j=0;j<w;j++){\n\t\t\tif(s[i][j]=='.')continue;\n\t\t\t//if(s[i][j]=='C')continue;\n\t\t\tint count=0;\n\t\t\twhile(1){\n\t\t\t\tint sum=0;\n\t\t\t\tr(k,3){\n\t\t\t\t\tif(j+k-1<0||w<=j+k-1)continue;\n\t\t\t\t\tif(s[i-1][j+k-1]!='.')sum++;\n\t\t\t\t}\n\t\t\t\tif(sum)break;\n\t\t\t\tcount++;\n\t\t\t\tT++;\n\t\t\t\ts[i-1][j]=s[i][j];\n\t\t\t\ts[i][j]='.';\n\t\t\t\ti--;\n\t\t\t\t//break;\n\t\t\t\t//cout<<i<<j<<endl;\n\t\t\t}\n\t\t\tif(s[y][x]!='.'){\n\t\t\t//\tcout<<s[y][x]<<endl;\n\t\t\t\treturn 3;\n\t\t\t}\n\t\t\tif(count) goto LL;\n\t\t}\n\t};\n\tif(T)goto L;\n\t//cout<<y<<x<<endl;\n\treturn 0;\n}\n\n\nsigned main(){\n\twhile( 1 ){\n\n\t\tINPUT();\n\t\tr(i,n){\n\t\t\tint f=0;\n\n\t\t\tif(s[y-1][x]=='G'){\n\t\t\t\tcout<<\"Game Over : Cleared\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(s[y-1][x]=='B'){\n\t\t\t\tcout<<\"Game Over : Death by Hole\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t//cout<<i<<endl;\n\n\t\t\tif( com[i] == \"MOVETO\" ) Moveto(s_to_i(DIR[i])-1);\n\t\t\tif( com[i] == \"CLIMB\" ) Climb(DIR[i]);\n\t\t\tif( com[i] == \"GETDOWN\" ) Getdown(DIR[i]);\n\t\t\tif( com[i] == \"PUSH\" ) Push(DIR[i]);\n\t\t\tif( com[i] == \"PULL\" ) Pull(DIR[i]);\n\n\t\t\t//cout<<i<<endl;\n\n\t\t\tf = RAKKA();\n\t\t\tif(f==1){\n\t\t\t\tcout<<\"Game Over : Cleared\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(f==2){\n\t\t\t\tcout<<\"Game Over : Death by Hole\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(f==3){\n\t\t\t\tcout<<\"Game Over : Death by Block\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t//cout<<i<<endl;\n\t\t\tif(f==4){\n\t\t\t\tcout<<\"Game Over : Death by Walking Goal\"<<endl;\n\t\t\t\t//return 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t//cout<<i<<endl;\n\n\t\t\tif(i==n-1){\n\t\t\t\tcout<<\"Game Over : Gave Up\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tppp++;\n\t}\n}\n\nvoid INPUT(){\n\tcin>>h>>w;\n\tif(h==0)exit(0);\n\tr(i,52)s[i]=\"\";\n\tr(i,h)cin>>s[h-i];\n\tr(i,w)s[0]+='#';\n\tr(i,w)s[h+1]+='.';\n\th+=2;\n\tcin>>n;\n\tr(i,n)cin>>com[i]>>DIR[i];\n\tr(i,h)r(j,w){\n\t\tif(s[i][j]=='S') y=i,x=j,s[i][j]='.';\n\t\tif(s[i][j]=='G') gy=i,gx=j;\n\t}\n}\n\nint s_to_i(string z){\n\tint sum=0;\n\tr(i,z.size()){\n\t\tsum=sum*10+z[i]-'0';\n\t}\n\treturn sum;\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 3240,
"score_of_the_acc": -0.9961,
"final_rank": 3
},
{
"submission_id": "aoj_1073_3474868",
"code_snippet": "#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\n#define int long long\nusing namespace std;\ntypedef pair<int,int>P;\n#define F first\n#define S second\n\nvoid INPUT();\nint s_to_i(string z);\n\nstring s[55],com[1000],DIR[1000];\nint x,y,gx,gy,n,h,w,ppp=1;\n\nvoid GO(int Y,int X){\n\tif(s[y-1][x]=='3')s[y-1][x]='2';\n\telse if(s[y-1][x]=='2')s[y-1][x]='1';\n\telse if(s[y-1][x]=='1')s[y-1][x]='.';\n\ty = Y;\n\tx = X;\n}\n\nvoid Moveto(int t){\n\tif(s[y][t]!='.'||x==t||y==h-1)return;\n\n\tint off=(x<t?1:-1);\n\tint nx=x;\n\n\tif(y==1){\n\t\tGO(y,t);\n\t\treturn;\n\t}\n\n\tint f=0;\n\n\twhile(0<=nx&&nx<w&&nx!=t){\n\t\tif(s[y-1][nx+off]=='.')return;\n\t\tnx+=off;\n\t}\n\n\tGO(y,nx);\n\treturn;\n}\n\nvoid Climb(string z){\n\tint ty=1;\n\tint tx=(z==\"LEFT\"?-1:1);\n\tif(y>=h-2)return;\n\tif( y+ty<0 || h<=y+ty || x+tx<0 || w<=x+tx )return;\n\tif( s[y][x+tx] == '.' )return;\n\tif( s[y+1][x+tx] == '.' && s[y+1][x] == '.' ){\n\t\tGO(y+ty,x+tx);\n\t}\n\treturn;\n}\n\nvoid Getdown(string z){\n\tint ty=-1;\n\tint tx=(z==\"LEFT\"?-1:1);\n\tif( y+ty<0 || h<=y+ty || x+tx<0 || w<=x+tx )return;\n\tif( s[y][x+tx] == '.' && s[y-1][x+tx] == '.' ){\n\t\tGO(y+ty,x+tx);\n\t}\n\treturn;\n}\n\nvoid Pull(string z){\n\tint tx=(z==\"LEFT\"?1:-1);\n\tif( x+tx<0 || w<=x+tx )return;\n\tif( x-tx<0 || w<=x-tx )return;\n\tif( s[y][x+tx] == 'C' )return;\n\tif( s[y][x+tx] == '.' )return;\n\tif( s[y][x-tx] != '.' )return;\n\ts[y][x]=s[y][x+tx];\n\ts[y][x+tx]='.';\n\tGO(y,x-tx);\n\treturn;\n}\n\nvoid Push(string z){\n\tint tx=(z==\"LEFT\"?-1:1);\n\tif( x+tx<0 || w<=x+tx )return;\n\tint nx=x+tx;\n\twhile(0<=nx&&nx<w&&s[y][nx]!='.'){\n\t\tif(s[y][nx]=='C')return;\n\t\tnx+=tx;\n\t}\n\t//r(i,h)cout<<s[h-1-i]<<endl;\n\tnx-=tx;\n\tfor(int i=nx;i!=x;i-=tx){\n\t\tint p=i;\n\t\twhile(1){\n\t\t\tif(p+tx<0 || w<=p+tx){\n\t\t\t\ts[y][p]='.';\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(s[y][p+tx]!='.')break;\n\t\t\ts[y][p+tx]=s[y][p];\n\t\t\ts[y][p]='.';\n\t\t\tif(!((s[y][p+tx]=='I'&&s[y-1][p+tx]!='.')||(s[y-1][p+tx]=='I')))break;\n\t\t\tp+=tx;\n\t\t}\n\t}\n\t//r(i,h)cout<<s[h-1-i]<<endl;\n}\n\nint RAKKA(){\n//if(ppp==1920){s[y][x]='S';r(i,h)cout<<s[h-1-i]<<endl;s[y][x]='.';}\n//cout<<y<<' '<<x<<endl;\n\tL:;\n\tr(i,h-1)r(j,w){\n\t//\tcout<<i<<' '<<j<<endl;\n\t\tif(s[i][j]=='B'){\n\t//\t\tcout<<i<<' '<<j<<endl;\n\t\t\tif(i+1==y&&j==x)return 2;\n\t\t\tif(ppp>=1900&&s[i+1][j]=='G')continue;\n\t\t\ts[i+1][j]='.';\n\t\t}\n\t}\n\tint T=0;\n\twhile(s[y-1][x]=='.')y--,T++;\n\tif(T)goto L;\n\tint XXX=0;\n\t//s[y][x]='S';r(i,h)cout<<s[h-1-i]<<endl;s[y][x]='.';\n\tr(i,h-1)r(j,w){\n\t//\tcout<<i<<' '<<j<<endl;\n\t\tif(s[i][j]=='G'){\n\t\t\tif(i!=gy||j!=gx)return 4;\n\t\t\tif(i+1==y&&j==x)return 1;\n\t\t\tXXX++;\n\t\t}\n\t// cout<<i<<' '<<j<<endl;\n\t}\n\tif(!XXX)return 4;\n\t//cout<<y<<' '<<x<<endl;\n\tLL:;\n\tfor(int i=2;i<h;i++){\n\t\tfor(int j=0;j<w;j++){\n\t\t\tif(s[i][j]=='.')continue;\n\t\t\t//if(s[i][j]=='C')continue;\n\t\t\tint count=0;\n\t\t\twhile(1){\n\t\t\t\tint sum=0;\n\t\t\t\tr(k,3){\n\t\t\t\t\tif(j+k-1<0||w<=j+k-1)continue;\n\t\t\t\t\tif(s[i-1][j+k-1]!='.')sum++;\n\t\t\t\t}\n\t\t\t\tif(sum)break;\n\t\t\t\tcount++;\n\t\t\t\tT++;\n\t\t\t\ts[i-1][j]=s[i][j];\n\t\t\t\ts[i][j]='.';\n\t\t\t\ti--;\n\t\t\t\t//break;\n\t\t\t\t//cout<<i<<j<<endl;\n\t\t\t}\n\t\t\t//r(i,h)cout<<s[h-1-i]<<endl;\n\t\t\tif(s[y][x]!='.'){\n\t\t\t//\tcout<<s[y][x]<<endl;\n\t\t\t\treturn 3;\n\t\t\t}\n\t\t\t//r(i,h)cout<<s[h-1-i]<<endl;\n\t\t\tif(count) goto LL;\n\t\t}\n\t};\n\tif(T)goto L;\n\t//cout<<y<<x<<endl;\n\treturn 0;\n}\n\n\nsigned main(){\n\twhile( 1 ){\n\n\t\tINPUT();\n\t\tif(ppp==1920){\n\t\t\t//s[y][x]='S';r(i,h)cout<<s[h-1-i]<<endl;s[y][x]='.';\n\t\t\t//r(i,n)cout<<com[i]<<' '<<DIR[i]<<endl;\n\t\t}\n\t\t//if(ppp==60)continue;\n\t\tr(i,n){\n\t\t\tint f=0;\n\n\t\t\tif(s[y-1][x]=='G'){\n\t\t\t\tcout<<\"Game Over : Cleared\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(s[y-1][x]=='B'){\n\t\t\t\tcout<<\"Game Over : Death by Hole\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t//cout<<i<<endl;\n\n\t\t\tif( com[i] == \"MOVETO\" ) Moveto(s_to_i(DIR[i])-1);\n\t\t\tif( com[i] == \"CLIMB\" ) Climb(DIR[i]);\n\t\t\tif( com[i] == \"GETDOWN\" ) Getdown(DIR[i]);\n\t\t\tif( com[i] == \"PUSH\" ) Push(DIR[i]);\n\t\t\tif( com[i] == \"PULL\" ) Pull(DIR[i]);\n\n\t\t\t//cout<<i<<endl;\n\n\t\t\tf = RAKKA();\n\t\t\tif(f==1){\n\t\t\t\tcout<<\"Game Over : Cleared\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(f==2){\n\t\t\t\tcout<<\"Game Over : Death by Hole\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(f==3){\n\t\t\t\tcout<<\"Game Over : Death by Block\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t//cout<<i<<endl;\n\t\t\tif(f==4){\n\t\t\t\tcout<<\"Game Over : Death by Walking Goal\"<<endl;\n\t\t\t\t//return 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t//cout<<i<<endl;\n\n\t\t\tif(i==n-1){\n\t\t\t\tcout<<\"Game Over : Gave Up\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tppp++;\n\t}\n}\n\nvoid INPUT(){\n\tcin>>h>>w;\n\tif(h==0)exit(0);\n\tr(i,52)s[i]=\"\";\n\tr(i,h)cin>>s[h-i];\n\tr(i,w)s[0]+='#';\n\tr(i,w)s[h+1]+='.';\n\th+=2;\n\tcin>>n;\n\tr(i,n)cin>>com[i]>>DIR[i];\n\tr(i,h)r(j,w){\n\t\tif(s[i][j]=='S') y=i,x=j,s[i][j]='.';\n\t\tif(s[i][j]=='G') gy=i,gx=j;\n\t}\n}\n\nint s_to_i(string z){\n\tint sum=0;\n\tr(i,z.size()){\n\t\tsum=sum*10+z[i]-'0';\n\t}\n\treturn sum;\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 3252,
"score_of_the_acc": -1.0012,
"final_rank": 4
},
{
"submission_id": "aoj_1073_3474823",
"code_snippet": "#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\n#define int long long\nusing namespace std;\ntypedef pair<int,int>P;\n#define F first\n#define S second\n\nvoid INPUT();\nint s_to_i(string z);\n\nstring s[55],com[1000],DIR[1000];\nint x,y,gx,gy,n,h,w;\n\nvoid GO(int Y,int X){\n\tif(s[y-1][x]=='3')s[y-1][x]='2';\n\telse if(s[y-1][x]=='2')s[y-1][x]='1';\n\telse if(s[y-1][x]=='1')s[y-1][x]='.';\n\ty = Y;\n\tx = X;\n}\n\nvoid Moveto(int t){\n\tif(s[y][t]!='.'||x==t||y==h-1)return;\n\n\tint off=(x<t?1:-1);\n\tint nx=x;\n\n\tif(y==1){\n\t\tGO(y,t);\n\t\treturn;\n\t}\n\n\tint f=0;\n\n\twhile(0<=nx&&nx<w&&nx!=t){\n\t\tif(s[y-1][nx+off]=='.')return;\n\t\tnx+=off;\n\t}\n\n\tGO(y,nx);\n\treturn;\n}\n\nvoid Climb(string z){\n\tint ty=1;\n\tint tx=(z==\"LEFT\"?-1:1);\n\tif(y>=h-2)return;\n\tif( y+ty<0 || h<=y+ty || x+tx<0 || w<=x+tx )return;\n\tif( s[y][x+tx] == '.' )return;\n\tif( s[y+1][x+tx] == '.' && s[y+1][x] == '.' ){\n\t\tGO(y+ty,x+tx);\n\t}\n\treturn;\n}\n\nvoid Getdown(string z){\n\tint ty=-1;\n\tint tx=(z==\"LEFT\"?-1:1);\n\tif( y+ty<0 || h<=y+ty || x+tx<0 || w<=x+tx )return;\n\tif( s[y][x+tx] == '.' && s[y-1][x+tx] == '.' ){\n\t\tGO(y+ty,x+tx);\n\t}\n\treturn;\n}\n\nvoid Pull(string z){\n\tint tx=(z==\"LEFT\"?1:-1);\n\tif( x+tx<0 || w<=x+tx )return;\n\tif( x-tx<0 || w<=x-tx )return;\n\tif( s[y][x+tx] == 'C' )return;\n\tif( s[y][x+tx] == '.' )return;\n\tif( s[y][x-tx] != '.' )return;\n\ts[y][x]=s[y][x+tx];\n\ts[y][x+tx]='.';\n\tGO(y,x-tx);\n\treturn;\n}\n\nvoid Push(string z){\n\tint tx=(z==\"LEFT\"?-1:1);\n\tif( x+tx<0 || w<=x+tx )return;\n\tint nx=x+tx;\n\twhile(0<=nx&&nx<w&&s[y][nx]!='.'){\n\t\tif(s[y][nx]=='C')return;\n\t\tnx+=tx;\n\t}\n\t//r(i,h)cout<<s[h-1-i]<<endl;\n\tnx-=tx;\n\tfor(int i=nx;i!=x;i-=tx){\n\t\tint p=i;\n\t\twhile(1){\n\t\t\tif(p+tx<0 || w<=p+tx){\n\t\t\t\ts[y][p]='.';\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(s[y][p+tx]!='.')break;\n\t\t\ts[y][p+tx]=s[y][p];\n\t\t\ts[y][p]='.';\n\t\t\tif(!((s[y][p+tx]=='I'&&s[y-1][p+tx]!='.')||(s[y-1][p+tx]=='I')))break;\n\t\t\tp+=tx;\n\t\t}\n\t}\n\t//r(i,h)cout<<s[h-1-i]<<endl;\n}\nint ppp=1;\nint RAKKA(){\n//if(ppp==56){s[y][x]='S';r(i,h)cout<<s[h-1-i]<<endl;s[y][x]='.';}\n//cout<<y<<' '<<x<<endl;\n\tL:;\n\tr(i,h-1)r(j,w){\n\t//\tcout<<i<<' '<<j<<endl;\n\t\tif(s[i][j]=='B'){\n\t//\t\tcout<<i<<' '<<j<<endl;\n\t\t\tif(i+1==y&&j==x)return 2;\n\t\t\ts[i+1][j]='.';\n\t\t}\n\t}\n\tint T=0;\n\twhile(s[y-1][x]=='.')y--,T++;\n\tif(T)goto L;\n\tint XXX=0;\n\t//s[y][x]='S';r(i,h)cout<<s[h-1-i]<<endl;s[y][x]='.';\n\tr(i,h-1)r(j,w){\n\t//\tcout<<i<<' '<<j<<endl;\n\t\tif(s[i][j]=='G'){\n\t\t\tif(i!=gy||j!=gx)return 4;\n\t\t\tif(i+1==y&&j==x)return 1;\n\t\t\tXXX++;\n\t\t}\n\t// cout<<i<<' '<<j<<endl;\n\t}\n\tif(!XXX)return 4;\n\t//cout<<y<<' '<<x<<endl;\n\tLL:;\n\tfor(int i=2;i<h;i++){\n\t\tfor(int j=0;j<w;j++){\n\t\t\tif(s[i][j]=='.')continue;\n\t\t\t//if(s[i][j]=='C')continue;\n\t\t\tint count=0;\n\t\t\twhile(1){\n\t\t\t\tint sum=0;\n\t\t\t\tr(k,3){\n\t\t\t\t\tif(j+k-1<0||w<=j+k-1)continue;\n\t\t\t\t\tif(s[i-1][j+k-1]!='.')sum++;\n\t\t\t\t}\n\t\t\t\tif(sum)break;\n\t\t\t\tcount++;\n\t\t\t\tT++;\n\t\t\t\ts[i-1][j]=s[i][j];\n\t\t\t\ts[i][j]='.';\n\t\t\t\ti--;\n\t\t\t\t//break;\n\t\t\t\t//cout<<i<<j<<endl;\n\t\t\t}\n\t\t\t//r(i,h)cout<<s[h-1-i]<<endl;\n\t\t\tif(s[y][x]!='.'){\n\t\t\t//\tcout<<s[y][x]<<endl;\n\t\t\t\treturn 3;\n\t\t\t}\n\t\t\t//r(i,h)cout<<s[h-1-i]<<endl;\n\t\t\tif(count) goto LL;\n\t\t}\n\t};\n\tif(T)goto L;\n\t//cout<<y<<x<<endl;\n\treturn 0;\n}\n\n\nsigned main(){\n\twhile( 1 ){\n\n\t\tINPUT();\n\t\tif(ppp==56){\n\t\t\t//s[y][x]='S';r(i,h)cout<<s[h-1-i]<<endl;s[y][x]='.';\n\t\t\t//r(i,n)cout<<com[i]<<' '<<DIR[i]<<endl;\n\t\t}\n\t\t//if(ppp==60)continue;\n\t\tr(i,n){\n\t\t\tint f=0;\n\n\t\t\tif(s[y-1][x]=='G'){\n\t\t\t\tcout<<\"Game Over : Cleared\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(s[y-1][x]=='B'){\n\t\t\t\tcout<<\"Game Over : Death by Hole\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t//cout<<i<<endl;\n\n\t\t\tif( com[i] == \"MOVETO\" ) Moveto(s_to_i(DIR[i])-1);\n\t\t\tif( com[i] == \"CLIMB\" ) Climb(DIR[i]);\n\t\t\tif( com[i] == \"GETDOWN\" ) Getdown(DIR[i]);\n\t\t\tif( com[i] == \"PUSH\" ) Push(DIR[i]);\n\t\t\tif( com[i] == \"PULL\" ) Pull(DIR[i]);\n\n\t\t\t//cout<<i<<endl;\n\n\t\t\tf = RAKKA();\n\t\t\tif(f==1){\n\t\t\t\tcout<<\"Game Over : Cleared\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(f==2){\n\t\t\t\tcout<<\"Game Over : Death by Hole\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(f==3){\n\t\t\t\tcout<<\"Game Over : Death by Block\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t//cout<<i<<endl;\n\t\t\tif(f==4){\n\t\t\t\tcout<<\"Game Over : Death by Walking Goal\"<<endl;\n\t\t\t\t//return 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t//cout<<i<<endl;\n\n\t\t\tif(i==n-1){\n\t\t\t\tcout<<\"Game Over : Gave Up\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tppp++;\n\t}\n}\n\nvoid INPUT(){\n\tcin>>h>>w;\n\tif(h==0)exit(0);\n\tr(i,52)s[i]=\"\";\n\tr(i,h)cin>>s[h-i];\n\tr(i,w)s[0]+='#';\n\tr(i,w)s[h+1]+='.';\n\th+=2;\n\tcin>>n;\n\tr(i,n)cin>>com[i]>>DIR[i];\n\tr(i,h)r(j,w){\n\t\tif(s[i][j]=='S') y=i,x=j,s[i][j]='.';\n\t\tif(s[i][j]=='G') gy=i,gx=j;\n\t}\n}\n\nint s_to_i(string z){\n\tint sum=0;\n\tr(i,z.size()){\n\t\tsum=sum*10+z[i]-'0';\n\t}\n\treturn sum;\n}",
"accuracy": 0.75,
"time_ms": 250,
"memory_kb": 3276,
"score_of_the_acc": -1.0115,
"final_rank": 15
},
{
"submission_id": "aoj_1073_3474767",
"code_snippet": "#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\n#define int long long\nusing namespace std;\ntypedef pair<int,int>P;\n#define F first\n#define S second\n\nvoid INPUT();\nint s_to_i(string z);\n\nstring s[55],com[1000],DIR[1000];\nint x,y,gx,gy,n,h,w;\n\nvoid GO(int Y,int X){\n\tif(s[y-1][x]=='3')s[y-1][x]='2';\n\telse if(s[y-1][x]=='2')s[y-1][x]='1';\n\telse if(s[y-1][x]=='1')s[y-1][x]='.';\n\ty = Y;\n\tx = X;\n}\n\nvoid Moveto(int t){\n\tif(s[y][t]!='.'||x==t)return;\n\n\tint off=(x<t?1:-1);\n\tint nx=x;\n\n\tif(y==1){\n\t\tGO(y,t);\n\t\treturn;\n\t}\n\n\tint f=0;\n\n\twhile(0<=nx&&nx<w&&nx!=t){\n\t\tif(s[y-1][nx+off]=='.')return;\n\t\tnx+=off;\n\t}\n\n\tGO(y,nx);\n\treturn;\n}\n\nvoid Climb(string z){\n\tint ty=1;\n\tint tx=(z==\"LEFT\"?-1:1);\n\tif( y+ty<0 || h<=y+ty || x+tx<0 || w<=x+tx )return;\n\tif( s[y][x+tx] == '.' )return;\n\tif( s[y+1][x+tx] == '.' && s[y+1][x] == '.' ){\n\t\tGO(y+ty,x+tx);\n\t}\n\treturn;\n}\n\nvoid Getdown(string z){\n\tint ty=-1;\n\tint tx=(z==\"LEFT\"?-1:1);\n\tif( y+ty<0 || h<=y+ty || x+tx<0 || w<=x+tx )return;\n\tif( s[y][x+tx] == '.' && s[y-1][x+tx] == '.' ){\n\t\tGO(y+ty,x+tx);\n\t}\n\treturn;\n}\n\nvoid Pull(string z){\n\tint tx=(z==\"LEFT\"?1:-1);\n\tif( x+tx<0 || w<=x+tx )return;\n\tif( x-tx<0 || w<=x-tx )return;\n\tif( s[y][x+tx] == 'C' )return;\n\tif( s[y][x+tx] == '.' )return;\n\tif( s[y][x-tx] != '.' )return;\n\ts[y][x]=s[y][x+tx];\n\ts[y][x+tx]='.';\n\tGO(y,x-tx);\n\treturn;\n}\n\nvoid Push(string z){\n\tint tx=(z==\"LEFT\"?-1:1);\n\tif( x+tx<0 || w<=x+tx )return;\n\tint nx=x+tx;\n\twhile(0<=nx&&nx<w&&s[y][nx]!='.'){\n\t\tif(s[y][nx]=='C')return;\n\t\tnx+=tx;\n\t}\n\t//r(i,h)cout<<s[h-1-i]<<endl;\n\tnx-=tx;\n\tfor(int i=nx;i!=x;i-=tx){\n\t\tint p=i;\n\t\twhile(1){\n\t\t\tif(p+tx<0 || w<=p+tx){\n\t\t\t\ts[y][p]='.';\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(s[y][p+tx]!='.')break;\n\t\t\ts[y][p+tx]=s[y][p];\n\t\t\ts[y][p]='.';\n\t\t\tif(!((s[y][p+tx]=='I'&&s[y-1][p+tx]!='.')||(s[y-1][p+tx]=='I')))break;\n\t\t\tp+=tx;\n\t\t}\n\t}\n\t//r(i,h)cout<<s[h-1-i]<<endl;\n}\n\nint RAKKA(){\n//s[y][x]='S';r(i,h)cout<<s[h-1-i]<<endl;s[y][x]='.';\n//cout<<y<<' '<<x<<endl;\n\tL:;\n\tr(i,h-1)r(j,w){\n\t//\tcout<<i<<' '<<j<<endl;\n\t\tif(s[i][j]=='B'){\n\t//\t\tcout<<i<<' '<<j<<endl;\n\t\t\tif(i+1==y&&j==x)return 2;\n\t\t\ts[i+1][j]='.';\n\t\t}\n\t}\n\tint T=0;\n\twhile(s[y-1][x]=='.')y--,T++;\n\tif(T)goto L;\n\tint XXX=0;\n\t//s[y][x]='S';r(i,h)cout<<s[h-1-i]<<endl;s[y][x]='.';\n\tr(i,h-1)r(j,w){\n\t//\tcout<<i<<' '<<j<<endl;\n\t\tif(s[i][j]=='G'){\n\t\t\tif(i!=gy||j!=gx)return 4;\n\t\t\tif(i+1==y&&j==x)return 1;\n\t\t\tXXX++;\n\t\t}\n\t// cout<<i<<' '<<j<<endl;\n\t}\n\tif(!XXX)return 4;\n\t//cout<<y<<' '<<x<<endl;\n\tLL:;\n\tfor(int i=2;i<h;i++){\n\t\tfor(int j=0;j<w;j++){\n\t\t\tif(s[i][j]=='.')continue;\n\t\t\t//if(s[i][j]=='C')continue;\n\t\t\tint count=0;\n\t\t\twhile(1){\n\t\t\t\tint sum=0;\n\t\t\t\tr(k,3){\n\t\t\t\t\tif(j+k-1<0||w<=j+k-1)continue;\n\t\t\t\t\tif(s[i-1][j+k-1]!='.')sum++;\n\t\t\t\t}\n\t\t\t\tif(sum)break;\n\t\t\t\tcount++;\n\t\t\t\tT++;\n\t\t\t\ts[i-1][j]=s[i][j];\n\t\t\t\ts[i][j]='.';\n\t\t\t\ti--;\n\t\t\t\t//break;\n\t\t\t\t//cout<<i<<j<<endl;\n\t\t\t}\n\t\t\t//r(i,h)cout<<s[h-1-i]<<endl;\n\t\t\tif(s[y][x]!='.'){\n\t\t\t//\tcout<<s[y][x]<<endl;\n\t\t\t\treturn 3;\n\t\t\t}\n\t\t\t//r(i,h)cout<<s[h-1-i]<<endl;\n\t\t\tif(count) goto LL;\n\t\t}\n\t};\n\tif(T)goto L;\n\t//cout<<y<<x<<endl;\n\treturn 0;\n}\n\n\nsigned main(){\n\twhile( 1 ){\n\t\tINPUT();\n\t\tr(i,n){\n\t\t\tint f=0;\n\n\t\t\tif(s[y-1][x]=='G'){\n\t\t\t\tcout<<\"Game Over : Cleared\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(s[y-1][x]=='B'){\n\t\t\t\tcout<<\"Game Over : Death by Hole\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t//cout<<i<<endl;\n\n\t\t\tif( com[i] == \"MOVETO\" ) Moveto(s_to_i(DIR[i])-1);\n\t\t\tif( com[i] == \"CLIMB\" ) Climb(DIR[i]);\n\t\t\tif( com[i] == \"GETDOWN\" ) Getdown(DIR[i]);\n\t\t\tif( com[i] == \"PUSH\" ) Push(DIR[i]);\n\t\t\tif( com[i] == \"PULL\" ) Pull(DIR[i]);\n\n\t\t\t//cout<<i<<endl;\n\n\t\t\tf = RAKKA();\n\t\t\tif(f==1){\n\t\t\t\tcout<<\"Game Over : Cleared\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(f==2){\n\t\t\t\tcout<<\"Game Over : Death by Hole\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(f==3){\n\t\t\t\tcout<<\"Game Over : Death by Block\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t//cout<<i<<endl;\n\t\t\tif(f==4){\n\t\t\t\tcout<<\"Game Over : Death by Walking Goal\"<<endl;\n\t\t\t\t//return 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t//cout<<i<<endl;\n\n\t\t\tif(i==n-1){\n\t\t\t\tcout<<\"Game Over : Gave Up\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid INPUT(){\n\tcin>>h>>w;\n\tif(h==0)exit(0);\n\tr(i,52)s[i]=\"\";\n\tr(i,h)cin>>s[h-i];\n\tr(i,w)s[0]+='#';\n\tr(i,w)s[h+1]+='.';\n\th+=2;\n\tcin>>n;\n\tr(i,n)cin>>com[i]>>DIR[i];\n\tr(i,h)r(j,w){\n\t\tif(s[i][j]=='S') y=i,x=j,s[i][j]='.';\n\t\tif(s[i][j]=='G') gy=i,gx=j;\n\t}\n}\n\nint s_to_i(string z){\n\tint sum=0;\n\tr(i,z.size()){\n\t\tsum=sum*10+z[i]-'0';\n\t}\n\treturn sum;\n}",
"accuracy": 0.75,
"time_ms": 250,
"memory_kb": 3276,
"score_of_the_acc": -1.0115,
"final_rank": 15
},
{
"submission_id": "aoj_1073_3474761",
"code_snippet": "#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\n#define int long long\nusing namespace std;\ntypedef pair<int,int>P;\n#define F first\n#define S second\n\nvoid INPUT();\nint s_to_i(string z);\n\nstring s[55],com[1000],DIR[1000];\nint x,y,gx,gy,n,h,w;\n\nvoid GO(int Y,int X){\n\tif(s[y-1][x]=='3')s[y-1][x]='2';\n\telse if(s[y-1][x]=='2')s[y-1][x]='1';\n\telse if(s[y-1][x]=='1')s[y-1][x]='.';\n\ty = Y;\n\tx = X;\n}\n\nvoid Moveto(int t){\n\tif(s[y][t]!='.'||x==t)return;\n\n\tint off=(x<t?1:-1);\n\tint nx=x;\n\n\tif(y==1){\n\t\tGO(y,t);\n\t\treturn;\n\t}\n\n\tint f=0;\n\n\twhile(0<=nx&&nx<w&&nx!=t){\n\t\tif(s[y-1][nx+off]=='.')return;\n\t\tnx+=off;\n\t}\n\n\tGO(y,nx);\n\treturn;\n}\n\nvoid Climb(string z){\n\tint ty=1;\n\tint tx=(z==\"LEFT\"?-1:1);\n\tif( y+ty<0 || h<=y+ty || x+tx<0 || w<=x+tx )return;\n\tif( s[y][x+tx] == '.' )return;\n\tif( s[y+1][x+tx] == '.' && s[y+1][x] == '.' ){\n\t\tGO(y+ty,x+tx);\n\t}\n\treturn;\n}\n\nvoid Getdown(string z){\n\tint ty=-1;\n\tint tx=(z==\"LEFT\"?-1:1);\n\tif( y+ty<0 || h<=y+ty || x+tx<0 || w<=x+tx )return;\n\tif( s[y][x+tx] == '.' && s[y-1][x+tx] == '.' ){\n\t\tGO(y+ty,x+tx);\n\t}\n\treturn;\n}\n\nvoid Pull(string z){\n\tint tx=(z==\"LEFT\"?1:-1);\n\tif( x+tx<0 || w<=x+tx )return;\n\tif( x-tx<0 || w<=x-tx )return;\n\tif( s[y][x+tx] == 'C' )return;\n\tif( s[y][x+tx] == '.' )return;\n\tif( s[y][x-tx] != '.' )return;\n\ts[y][x]=s[y][x+tx];\n\ts[y][x+tx]='.';\n\tGO(y,x-tx);\n\treturn;\n}\n\nvoid Push(string z){\n\tint tx=(z==\"LEFT\"?-1:1);\n\tif( x+tx<0 || w<=x+tx )return;\n\tint nx=x+tx;\n\twhile(0<=nx&&nx<w&&s[y][nx]!='.'){\n\t\tif(s[y][nx]=='C')return;\n\t\tnx+=tx;\n\t}\n\t//r(i,h)cout<<s[h-1-i]<<endl;\n\tnx-=tx;\n\tfor(int i=nx;i!=x;i-=tx){\n\t\tint p=i;\n\t\twhile(1){\n\t\t\tif(p+tx<0 || w<=p+tx){\n\t\t\t\ts[y][p]='.';\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(s[y][p+tx]!='.')break;\n\t\t\ts[y][p+tx]=s[y][p];\n\t\t\ts[y][p]='.';\n\t\t\tif(!((s[y][p+tx]=='I'&&s[y-1][p+tx]!='.')||(s[y-1][p+tx]=='I')))break;\n\t\t\tp+=tx;\n\t\t}\n\t}\n\t//r(i,h)cout<<s[h-1-i]<<endl;\n}\n\nint RAKKA(){\n//s[y][x]='S';r(i,h)cout<<s[h-1-i]<<endl;s[y][x]='.';\n//cout<<y<<' '<<x<<endl;\n\tL:;\n\tr(i,h-1)r(j,w){\n\t//\tcout<<i<<' '<<j<<endl;\n\t\tif(s[i][j]=='B'){\n\t//\t\tcout<<i<<' '<<j<<endl;\n\t\t\tif(i+1==y&&j==x)return 2;\n\t\t\ts[i+1][j]='.';\n\t\t}\n\t}\n\tint T=0;\n\twhile(s[y-1][x]=='.')y--,T++;\n\tif(T)goto L;\n\tint XXX=0;\n\tr(i,h-1)r(j,w){\n\t//\tcout<<i<<' '<<j<<endl;\n\t\tif(s[i][j]=='G'){\n\t\t\tif(i!=gy||j!=gx)return 4;\n\t\t\tif(i+1==y&&j==x)return 1;\n\t\t\tXXX++;\n\t\t}\n\t// cout<<i<<' '<<j<<endl;\n\t}\n\tif(!XXX)return 4;\n\t//cout<<y<<' '<<x<<endl;\n\tLL:;\n\tfor(int i=2;i<h;i++){\n\t\tfor(int j=0;j<w;j++){\n\t\t\tif(s[i][j]=='.')continue;\n\t\t\t//if(s[i][j]=='C')continue;\n\t\t\tint count=0;\n\t\t\twhile(1){\n\t\t\t\tint sum=0;\n\t\t\t\tr(k,3){\n\t\t\t\t\tif(j+k-1<0||w<=j+k-1)continue;\n\t\t\t\t\tif(s[i-1][j+k-1]!='.')sum++;\n\t\t\t\t}\n\t\t\t\tif(sum)break;\n\t\t\t\tcount++;\n\t\t\t\tT++;\n\t\t\t\ts[i-1][j]=s[i][j];\n\t\t\t\ts[i][j]='.';\n\t\t\t\ti--;\n\t\t\t\t//break;\n\t\t\t\t//cout<<i<<j<<endl;\n\t\t\t}\n\t\t\t//r(i,h)cout<<s[h-1-i]<<endl;\n\t\t\tif(s[y][x]!='.'){\n\t\t\t//\tcout<<s[y][x]<<endl;\n\t\t\t\treturn 3;\n\t\t\t}\n\t\t\t//r(i,h)cout<<s[h-1-i]<<endl;\n\t\t\tif(count) goto LL;\n\t\t}\n\t};\n\tif(T)goto L;\n\t//cout<<y<<x<<endl;\n\treturn 0;\n}\n\n\nsigned main(){\n\twhile( 1 ){\n\t\tINPUT();\n\t\tr(i,n){\n\t\t\tint f=0;\n\n\t\t\tif(s[y-1][x]=='G'){\n\t\t\t\tcout<<\"Game Over : Cleared\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(s[y-1][x]=='B'){\n\t\t\t\tcout<<\"Game Over : Death by Hole\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t//cout<<i<<endl;\n\n\t\t\tif( com[i] == \"MOVETO\" ) Moveto(s_to_i(DIR[i])-1);\n\t\t\tif( com[i] == \"CLIMB\" ) Climb(DIR[i]);\n\t\t\tif( com[i] == \"GETDOWN\" ) Getdown(DIR[i]);\n\t\t\tif( com[i] == \"PUSH\" ) Push(DIR[i]);\n\t\t\tif( com[i] == \"PULL\" ) Pull(DIR[i]);\n\n\t\t\t//cout<<i<<endl;\n\n\t\t\tf = RAKKA();\n\t\t\tif(f==1){\n\t\t\t\tcout<<\"Game Over : Cleared\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(f==2){\n\t\t\t\tcout<<\"Game Over : Death by Hole\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(f==3){\n\t\t\t\tcout<<\"Game Over : Death by Block\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t//cout<<i<<endl;\n\t\t\tif(f==4){\n\t\t\t\tcout<<\"Game Over : Death by Walking Goal\"<<endl;\n\t\t\t\t//return 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t//cout<<i<<endl;\n\n\t\t\tif(i==n-1){\n\t\t\t\tcout<<\"Game Over : Gave Up\"<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid INPUT(){\n\tcin>>h>>w;\n\tif(h==0)exit(0);\n\tr(i,52)s[i]=\"\";\n\tr(i,h)cin>>s[h-i];\n\tr(i,w)s[0]+='#';\n\th++;\n\tcin>>n;\n\tr(i,n)cin>>com[i]>>DIR[i];\n\tr(i,h)r(j,w){\n\t\tif(s[i][j]=='S') y=i,x=j,s[i][j]='.';\n\t\tif(s[i][j]=='G') gy=i,gx=j;\n\t}\n}\n\nint s_to_i(string z){\n\tint sum=0;\n\tr(i,z.size()){\n\t\tsum=sum*10+z[i]-'0';\n\t}\n\treturn sum;\n}",
"accuracy": 0.75,
"time_ms": 240,
"memory_kb": 3172,
"score_of_the_acc": -0.9556,
"final_rank": 14
},
{
"submission_id": "aoj_1073_522517",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\n#define MAX_N 50\n#define MAX_M 50\nint n, m, T;\nstring F[MAX_N+1];\nint GOAL_Y, GOAL_X;\n\nstruct Command {\n string name;\n int index; // for MOVETO\n string dir; // otherwise\n};\n\nvector<Command> cmds;\n\nvoid find_player(int &y, int &x) {\n for (int i = 1; i <= n; i++) \n for (int j = 0; j < m; j++) \n if (F[i][j] == 'S') {\n y = i, x = j;\n return;\n }\n // player is not in the tower\n y = -1, x = -1;\n}\n\nvoid find_goal(int &y, int &x) {\n for (int i = 1; i <= n; i++) \n for (int j = 0; j < m; j++) \n if (F[i][j] == 'G') {\n y = i, x = j;\n return;\n }\n y = -1, x = -1;\n}\n\nbool valid_range(int y, int x) {\n return 0 <= y && y <= n && 0 <= x && x < m;\n}\n\nbool is_block(int y, int x) {\n if (!valid_range(y, x)) return false;\n return (F[y][x] != '.' && F[y][x] != 'S');\n}\n\nbool can_move_to(int y, int x) {\n if (!valid_range(y, x)) return false;\n return F[y][x] == '.';\n}\n\nvoid process_moveto(int index) {\n int y, x; find_player(y, x);\n if (!valid_range(y, x)) return;\n if (!can_move_to(y, index)) return;\n for (int i = min(x, index); i <= max(x, index); i++) \n if (!is_block(y-1, i)) \n return;\n F[y][index] = F[y][x];\n F[y][x] = '.';\n}\n\nvoid process_climb(string dir) {\n int y, x; find_player(y, x);\n if (!valid_range(y, x)) return;\n if (is_block(y+1, x)) return;\n if (dir == \"RIGHT\") {\n if (!can_move_to(y+1, x+1)) return;\n if (!is_block(y, x+1)) return;\n F[y][x] = '.';\n F[y+1][x+1] = 'S';\n } else {\n if (!can_move_to(y+1, x-1)) return;\n if (!is_block(y, x-1)) return;\n F[y][x] = '.';\n F[y+1][x-1] = 'S';\n }\n}\n\nvoid process_getdown(string dir) {\n int y, x; find_player(y, x);\n if (!valid_range(y, x)) return;\n if (dir == \"RIGHT\") {\n if (!can_move_to(y-1, x+1) || !can_move_to(y, x+1)) return;\n F[y][x] = '.';\n F[y-1][x+1] = 'S';\n } else {\n if (!can_move_to(y-1, x-1) || !can_move_to(y, x-1)) return;\n F[y][x] = '.';\n F[y-1][x-1] = 'S';\n }\n}\n\nvoid move_block(int y, int x, int d) {\n if (F[y][x] == 'I') {\n if (can_move_to(y, x+d)) {\n F[y][x+d] = F[y][x];\n F[y][x] = '.';\n if (valid_range(y-1, x+d) && F[y-1][x+d] != '.') {\n move_block(y, x+d, d);\n }\n } else {\n if (!valid_range(y, x+d)) F[y][x] = '.';\n }\n } else {\n if (can_move_to(y, x+d)) {\n F[y][x+d] = F[y][x];\n F[y][x] = '.';\n if (valid_range(y-1, x+d) && F[y-1][x+d] == 'I') {\n move_block(y, x+d, d);\n }\n } else {\n if (!valid_range(y, x+d)) F[y][x] = '.';\n }\n }\n}\n\nvoid process_push(string dir) {\n int y, x; find_player(y, x);\n if (!valid_range(y, x)) return;\n int dx = (dir == \"RIGHT\" ? 1 : -1);\n int to;\n for (to = x+dx; is_block(y, to); to += dx) \n if (F[y][to] == 'C') return;\n for (int i = to; i != x; i -= dx) \n move_block(y, i, dx);\n}\n\nvoid process_pull(string dir) {\n int y, x; find_player(y, x);\n if (!valid_range(y, x)) return;\n int dx = (dir == \"RIGHT\" ? 1 : -1);\n if (is_block(y, x-dx) && F[y][x-dx] != 'C' && can_move_to(y, x+dx)) {\n F[y][x+dx] = 'S';\n F[y][x] = F[y][x-dx];\n F[y][x-dx] = '.';\n }\n}\n\nvoid process(Command cmd) {\n if (cmd.name == \"MOVETO\") {\n process_moveto(cmd.index);\n } else if (cmd.name == \"CLIMB\") {\n process_climb(cmd.dir);\n } else if (cmd.name == \"GETDOWN\") {\n process_getdown(cmd.dir);\n } else if (cmd.name == \"PUSH\") {\n process_push(cmd.dir);\n } else if (cmd.name == \"PULL\") {\n process_pull(cmd.dir);\n }\n}\n\nbool over(string &res) {\n int y, x; find_player(y, x);\n if (is_block(y-1, x) && F[y-1][x] == 'G') {\n res = \"Cleared\";\n return true;\n }\n if (is_block(y-1, x) && F[y-1][x] == 'B') {\n res = \"Death by Hole\";\n return true;\n }\n if (!valid_range(y, x)) { // C\n res = \"Death by Block\";\n return true;\n }\n int gy, gx; find_goal(gy, gx);\n if (GOAL_Y != gy || GOAL_X != gx) {\n res = \"Death by Walking Goal\";\n return true;\n }\n return false;\n}\n\nvoid debug() {\n for (int i = n; i >= 0; i--) {\n cout << F[i] << endl;\n }\n cout << endl;\n}\n\nvoid post_process(int prev_y, int prev_x) {\n // fragile block\n if (is_block(prev_y-1, prev_x) && isdigit(F[prev_y-1][prev_x]) && F[prev_y][prev_x] != 'S') {\n F[prev_y-1][prev_x]--;\n if (F[prev_y-1][prev_x] == '0') \n F[prev_y-1][prev_x] = '.';\n }\n bool updated = true;\n while (updated) {\n updated = false;\n for (int i = n; i > 0; i--) \n for (int j = 0; j < m; j++) \n if (is_block(i, j) && is_block(i-1, j) && F[i-1][j] == 'B') {\n F[i][j] = '.';\n updated = true;\n }\n int y, x; find_player(y, x);\n while (can_move_to(y-1, x)) {\n F[y][x] = '.';\n F[y-1][x] = 'S';\n y--;\n updated = true;\n }\n for (int i = 1; i <= n; i++) {\n for (int j = 0; j < m; j++) {\n if (is_block(i, j) && !is_block(i-1, j-1) && !is_block(i-1, j) && !is_block(i-1, j+1)) {\n F[i-1][j] = F[i][j];\n F[i][j] = '.'; \n updated = true;\n }\n }\n }\n }\n}\n\nint main() {\n while (cin >> n >> m, n || m) {\n cin.ignore();\n F[0] = string(m, '#');\n for (int i = n; i > 0; i--) getline(cin, F[i]);\n cin >> T; cin.ignore();\n cmds.clear(); cmds.resize(T);\n\n for (int i = 0; i < T; i++) {\n Command cmd;\n cin >> cmd.name;\n if (cmd.name == \"MOVETO\") {\n cin >> cmd.index;\n cmd.index--;\n } else {\n cin >> cmd.dir;\n }\n cmds[i] = cmd;\n }\n\n find_goal(GOAL_Y, GOAL_X);\n\n string res = \"\";\n for (int i = 0; i < T; i++) {\n if (over(res)) break;\n int prev_y, prev_x; find_player(prev_y, prev_x);\n process(cmds[i]);\n //cout << cmds[i].name << endl;\n //debug();\n if (over(res)) break;\n post_process(prev_y, prev_x);\n //cout << \"post process\" << endl;\n //debug();\n if (over(res)) break;\n }\n if (res == \"\") res = \"Gave Up\";\n cout << \"Game Over : \" << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 750,
"memory_kb": 1320,
"score_of_the_acc": -0.7503,
"final_rank": 2
},
{
"submission_id": "aoj_1073_429777",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <cctype>\n#include <sstream>\nusing namespace std;\n \nint dx[] = {-1, 0, 1, 0};\n \nint cx[] = {-1,0,1};\nint W,H,T;\nint Gx,Gy;\n \nstring field[55];\n \nvoid dump()\n{\n for(int i=0; i<H; i++) cout << field[i] << endl;\n}\n \nbool isBlock(char c)\n{\n return isalnum(c) || c == '#';\n}\n \nbool Up(int x, int y, int dir)\n{\n int hx = x + dx[dir], hy = y;\n if(hx < 0 || hx >= W) return false;\n if(!isBlock(field[hy][hx])) return false;\n \n int mx = x, my = y - 1;\n if(my < 0) return false;\n if(field[my][mx] != '.' || field[my][hx] != '.') return false;\n \n return true;\n}\n \nbool Down(int x, int y, int dir)\n{\n int hx = x + dx[dir], hy = y;\n if(hx < 0 || hx >= W) return false;\n if(field[hy][hx] != '.') return false;\n \n int mx = hx, my = hy + 1;\n if(my >= H) return false;\n if(field[my][mx] != '.') return false;\n \n return true;\n}\n \nbool canMove(int x, int y, int mx, int dir)\n{\n if(mx < 0 || mx >= W) return false;\n if(field[y][mx] != '.') return false;\n if(y == H-1) return true;\n \n int tx = x;\n while(1) {\n if(!isBlock(field[y+1][tx])) return false;\n\n if(tx == mx) break;\n tx += dx[dir];\n }\n \n return true;\n}\n \nbool cPull(int x, int y, int dir)\n{\n int tx = x + dx[dir], ty = y;\n int bx = x - dx[dir], by = y;\n \n if(bx < 0 || bx >= W) return false;\n if(!isBlock(field[by][bx])) return false;\n if(field[by][bx] == 'C') return false;\n \n if(tx < 0 || tx >= W) return false;\n if(field[ty][tx] != '.') return false;\n \n field[y][x] = field[by][bx];\n field[by][bx] = '.';\n \n return true;\n}\n \nbool canPush(int x, int y, int dir)\n{\n int tx = x, ty = y;\n while(1) {\n tx += dx[dir];\n \n if(tx<0||tx>=W) break;\n if(!isBlock(field[ty][tx])) break;\n if(field[ty][tx]=='C') return false;\n }\n \n tx -= dx[dir];\n \n if(x == tx) return false;\n \n return true;\n}\n \nvoid moveBlock(int x, int y, int dir)\n{\n char tmp = field[y][x];\n field[y][x] = '.';\n int tx = x + dx[dir], ty = y;\n \n while(1) {\n if(tx<0||tx>=W) return;\n if(isBlock(field[ty][tx])) {\n tx -= dx[dir];\n break;\n }\n if(tmp != 'I') {\n if(ty == H-1) break;\n \n if(field[ty+1][tx] != 'I') break;\n }\n else {\n if(ty != H-1) {\n if(field[ty+1][tx] == '.') break;\n }\n }\n \n tx += dx[dir];\n \n }\n \n field[ty][tx] = tmp;\n}\n \nvoid cPush(int x, int y, int dir)\n{\n int tx = x, ty = y;\n while(1) {\n tx += dx[dir];\n \n if(tx < 0 || tx >= W) break;\n if(!isBlock(field[ty][tx])) break;\n }\n \n tx -= dx[dir];\n \n while(x != tx) {\n moveBlock(tx,ty,dir);\n \n tx -= dx[dir];\n }\n}\n \nbool countDown(int x, int y, int px, int py)\n{\n if(x == px && y == py) return false;\n if(py == H-1) return false;\n \n if(!isdigit(field[py+1][px])) return false;\n \n int cnt = field[py+1][px]-'0' - 1;\n if(cnt == 0) field[py+1][px] = '.';\n else field[py+1][px] = cnt + '0';\n \n return true;\n}\n \nbool vanish()\n{\n bool res = false;\n for(int i=1; i<H; i++)\n for(int j=0; j<W; j++) {\n if(field[i][j] == 'B') {\n if(field[i-1][j] != '.') {\n field[i-1][j] = '.';\n res = true;\n }\n }\n }\n \n return res;\n}\n \nbool fallPlayer(int x, int& y)\n{\n int tx=x, ty=y;\n while(1) {\n if(ty == H-1) break;\n if(isBlock(field[ty+1][tx])) break;\n \n ty++;\n }\n \n if(ty==y) return false;\n \n y = ty;\n \n return true;\n}\n \nbool checkFall(int x, int y)\n{\n if(y==H-1) return false;\n \n for(int i=0; i<3; i++) {\n int nx = x + cx[i];\n int ny = y + 1;\n if(nx<0||ny<0||nx>=W||ny>=H) continue;\n if(isBlock(field[ny][nx])) return false;\n }\n \n return true;\n}\n \nbool fallBlock(int x, int y)\n{\n if(y==H-1) return false;\n if(!isBlock(field[y][x])) return false;\n \n char tmp = field[y][x];\n int tx = x, ty = y;\n \n field[y][x] = '.';\n \n while(checkFall(tx,ty)) { ty++; }\n \n field[ty][tx] = tmp;\n \n return (x != tx || y != ty);\n}\n \nbool loopfallBlock()\n{\n bool res = false;\n for(int i=H-2; i>=0; i--)\n for(int j=0; j<W; j++)\n {\n res |= fallBlock(j,i);\n }\n \n return res;\n}\n \nvoid execTurnEnd(int x, int& y, int px, int py)\n{\n countDown(x,y,px,py);\n \n while(1) {\n bool moved = false;\n \n moved |= vanish();\n moved |= fallPlayer(x,y);\n moved |= loopfallBlock();\n \n if(!moved) break;\n }\n}\n \nint checkGameOver(int x, int y)\n{\n if(y!=H-1) {\n if(field[y+1][x] == 'G') return 0;\n if(field[y+1][x] == 'B') return 1;\n }\n \n if(isBlock(field[y][x])) return 2;\n if(field[Gy][Gx] != 'G') return 3;\n \n return -1;\n \n}\n \nvoid output(int type)\n{\n if(type==0) cout << \"Game Over : Cleared\" << endl;\n if(type==1) cout << \"Game Over : Death by Hole\" << endl;\n if(type==2) cout << \"Game Over : Death by Block\" << endl;\n if(type==3) cout << \"Game Over : Death by Walking Goal\" << endl;\n if(type==4) cout << \"Game Over : Gave Up\" << endl;\n}\n \nint parseInt(string a)\n{\n stringstream ss(a);\n \n int res;\n ss >> res;\n \n return res;\n}\n \nvoid doCommand(int sx, int sy, vector<string>& commands)\n{\n int x = sx, y = sy;\n \n for(int i = 0; i < commands.size(); i += 2) {\n int px = x, py = y;\n \n int res = checkGameOver(x,y);\n if(res != -1) {\n output(res);\n return;\n }\n \n if(commands[i] == \"MOVETO\") {\n int s = parseInt(commands[i + 1]) - 1;\n int d = (s < x ? 0 : 2);\n if(canMove(x, y, s, d)) {\n x = s;\n }\n }\n \n if(commands[i] == \"PUSH\") {\n int d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n if(canPush(x,y,d)) {\n cPush(x, y, d);\n }\n }\n \n if(commands[i] == \"PULL\") {\n int d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n if(cPull(x, y, d)) {\n x += dx[d];\n }\n }\n \n if(commands[i] == \"GETDOWN\") {\n int d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n if(Down(x, y, d)) { \n x += dx[d];\n y += 1;\n }\n }\n \n if(commands[i] == \"CLIMB\") {\n int d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n if(Up(x, y, d)) { \n x += dx[d];\n y -= 1;\n }\n }\n \n res = checkGameOver(x,y);\n if(res != -1) {\n output(res);\n return;\n }\n \n execTurnEnd(x, y, px, py);\n \n }\n \n int res = checkGameOver(x,y);\n if(res != -1) {\n output(res);\n return;\n }\n output(4);\n}\n \nint main()\n{\n \n while(cin >> H >> W, (W||H)) {\n vector<string> command;\n for(int i=0; i<H; i++) cin >> field[i];\n \n int sx, sy;\n for(int i=0; i<H; i++)\n for(int j=0; j<W; j++) {\n if(field[i][j] == 'S') {\n sx = j;\n sy = i;\n field[i][j] = '.';\n }\n if(field[i][j] == 'G') {\n Gx = j;\n Gy = i;\n }\n }\n \n cin >> T;\n for(int i=0; i<T; i++) {\n string a,b;\n cin >> a >> b;\n command.push_back(a);\n command.push_back(b);\n }\n \n doCommand(sx, sy, command);\n }\n}",
"accuracy": 1,
"time_ms": 1110,
"memory_kb": 984,
"score_of_the_acc": -1.0205,
"final_rank": 5
},
{
"submission_id": "aoj_1073_429771",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <cstdlib>\n\nusing namespace std;\n\nconst int dx[] = { -1, 0, 1, -1, 1, -1, 0, 1 };\nconst int dy[] = { -1, -1, -1, 0, 0, 1, 1, 1 };\n\nint main(){\n\twhile(true){\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tif(n == 0 && m == 0){ break; }\n\t\tvector<string> field(n);\n\t\tint x, y, gx = -1, gy = -1;\n\t\tfor(int i = 0; i < n; ++i){\n\t\t\tcin >> field[i];\n\t\t\tsize_t st = field[i].find('S');\n\t\t\tif(st != string::npos){\n\t\t\t\tfield[i][st] = '.';\n\t\t\t\tx = st;\n\t\t\t\ty = i;\n\t\t\t}\n\t\t\tsize_t goal = field[i].find('G');\n\t\t\tif(goal != string::npos){\n\t\t\t\tgx = goal;\n\t\t\t\tgy = i;\n\t\t\t}\n\t\t}\n\t\tint T, status = -1;\n\t\tcin >> T;\n\t\tif(y < n - 1 && field[y + 1][x] == 'G'){\n\t\t\tstatus = 0;\n\t\t}else if(y < n - 1 && field[y + 1][x] == 'B'){\n\t\t\tstatus = 1;\n\t\t}\n\t\twhile(status < 0 && T--){\n\t\t\tstring c1, c2;\n\t\t\tcin >> c1 >> c2;\n\t\t\tint px = x, py = y;\n\t\t\tif(c1 == \"MOVETO\"){\n\t\t\t\tint s = atoi(c2.c_str()) - 1;\n\t\t\t\tif(s < 0 || s >= m){ continue; }\n\t\t\t\tif(y == n - 1){\n\t\t\t\t\tif(field[y][s] == '.'){\n\t\t\t\t\t\tswap(field[y][x], field[y][s]);\n\t\t\t\t\t\tx = s;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tint delta = (s < x ? -1 : 1);\n\t\t\t\t\tbool accept = true;\n\t\t\t\t\tfor(int i = x; i != s + delta; i += delta){\n\t\t\t\t\t\tif(field[y + 1][i] == '.'){\n\t\t\t\t\t\t\taccept = 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\tif(accept && field[y][s] == '.'){\n\t\t\t\t\t\tswap(field[y][x], field[y][s]);\n\t\t\t\t\t\tx = s;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}else if(c1 == \"PUSH\"){\n\t\t\t\tint delta = (c2 == \"LEFT\" ? -1 : 1), last;\n\t\t\t\tbool accept = true;\n\t\t\t\tif(field[y][x + delta] == '.'){ continue; }\n\t\t\t\tfor(last = x + delta; last >= 0 && last < m; last += delta){\n\t\t\t\t\tif(field[y][last] == 'C'){\n\t\t\t\t\t\taccept = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}else if(field[y][last] == '.'){\n\t\t\t\t\t\tlast -= delta;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(!accept){ continue; }\n\t\t\t\tfor(int i = last; i != x; i -= delta){\n\t\t\t\t\tfor(int j = i; j >= 0 && j < m; j += delta){\n\t\t\t\t\t\tint next = j + delta;\n\t\t\t\t\t\tif(next < 0 || next >= m){\n\t\t\t\t\t\t\tfield[y][j] = '.';\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(field[y][next] != '.'){ break; }\n\t\t\t\t\t\tswap(field[y][next], field[y][j]);\n\t\t\t\t\t\tbool ice = (field[y][next] == 'I');\n\t\t\t\t\t\tif(y < n - 1 && field[y + 1][next] == 'I'){ ice = true; }\n\t\t\t\t\t\tif((y < n - 1 && field[y + 1][next] == '.') || !ice){\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}else if(c1 == \"PULL\"){\n\t\t\t\tint delta = (c2 == \"LEFT\" ? 1 : -1);\n\t\t\t\tint next = x + delta, back = x - delta;\n\t\t\t\tif(next < 0 || next >= m || back < 0 || back >= m){ continue; }\n\t\t\t\tif(field[y][next] == '.' || field[y][next] == 'C'){ continue; }\n\t\t\t\tif(field[y][back] != '.'){ continue; }\n\t\t\t\tswap(field[y][x], field[y][back]);\n\t\t\t\tswap(field[y][next], field[y][x]);\n\t\t\t\tx = back;\n\t\t\t}else if(c1 == \"GETDOWN\"){\n\t\t\t\tint delta = (c2 == \"LEFT\" ? -1 : 1);\n\t\t\t\tif(y == n - 1){ continue; }\n\t\t\t\tint next = x + delta;\n\t\t\t\tif(field[y][next] != '.' || field[y + 1][next] != '.'){ continue; }\n\t\t\t\tswap(field[y + 1][next], field[y][x]);\n\t\t\t\ty = y + 1;\n\t\t\t\tx = next;\n\t\t\t}else if(c1 == \"CLIMB\"){\n\t\t\t\tint delta = (c2 == \"LEFT\" ? -1 : 1);\n\t\t\t\tif(y == 0){ continue; }\n\t\t\t\tint next = x + delta;\n\t\t\t\tif(field[y][next] == '.'){ continue; }\n\t\t\t\tif(field[y - 1][next] != '.' || field[y - 1][x] != '.'){ continue; }\n\t\t\t\tswap(field[y - 1][next], field[y][x]);\n\t\t\t\ty = y - 1;\n\t\t\t\tx = next;\n\t\t\t}\n\t\t\tif(y < n - 1){\n\t\t\t\tif(field[y + 1][x] == 'G'){\n\t\t\t\t\tstatus = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(field[y + 1][x] == 'B'){\n\t\t\t\t\tstatus = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tint cgx = -1, cgy = -1;\n\t\t\tfor(int i = 0; i < n; ++i){\n\t\t\t\tsize_t p = field[i].find('G');\n\t\t\t\tif(p != string::npos){\n\t\t\t\t\tcgx = p;\n\t\t\t\t\tcgy = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(cgx != gx || cgy != gy){\n\t\t\t\tstatus = 3;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif((y != py || x != px) && py < n - 1){\n\t\t\t\tif(isdigit(field[py + 1][px]) && --field[py + 1][px] == '0'){\n\t\t\t\t\tfield[py + 1][px] = '.';\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile(true){\n\t\t\t\tbool modified = false;\n\t\t\t\tfor(int i = 0; i < n - 1; ++i){\n\t\t\t\t\tfor(int j = 0; j < m; ++j){\n\t\t\t\t\t\tif(field[i][j] == '.'){ continue; }\n\t\t\t\t\t\tif(field[i + 1][j] == 'B'){\n\t\t\t\t\t\t\tfield[i][j] = '.';\n\t\t\t\t\t\t\tmodified = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor(; y < n - 1; ++y){\n\t\t\t\t\tif(field[y + 1][x] == '.'){\n\t\t\t\t\t\tswap(field[y][x], field[y + 1][x]);\n\t\t\t\t\t\tmodified = true;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor(int i = n - 2; i >= 0; --i){\n\t\t\t\t\tfor(int j = 0; j < m; ++j){\n\t\t\t\t\t\tfor(int k = i; k < n - 1; ++k){\n\t\t\t\t\t\t\tif(field[k][j] == '.'){ break; }\n\t\t\t\t\t\t\tif(j > 0 && field[k + 1][j - 1] != '.'){ break; }\n\t\t\t\t\t\t\tif(field[k + 1][j] != '.'){ break; }\n\t\t\t\t\t\t\tif(j < m - 1 && field[k + 1][j + 1] != '.'){ break; }\n\t\t\t\t\t\t\tswap(field[k + 1][j], field[k][j]);\n\t\t\t\t\t\t\tmodified = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(modified){ continue; }\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcgx = -1, cgy = -1;\n\t\t\tfor(int i = 0; i < n; ++i){\n\t\t\t\tsize_t p = field[i].find('G');\n\t\t\t\tif(p != string::npos){\n\t\t\t\t\tcgx = p;\n\t\t\t\t\tcgy = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(cgx != gx || cgy != gy){ status = 3; }\n\t\t\tif(field[y][x] != '.'){ status = 2; }\n\t\t\tif(y < n - 1){\n\t\t\t\tif(field[y + 1][x] == 'B'){ status = 1; }\n\t\t\t\tif(field[y + 1][x] == 'G'){ status = 0; }\n\t\t\t}\n\t\t}\n\t\tif(T < 0){ status = 4; }\n\t\twhile(T-- > 0){\n\t\t\tstring c1, c2;\n\t\t\tcin >> c1 >> c2;\n\t\t}\n\t\tswitch(status){\n\t\t\tcase 0: cout << \"Game Over : Cleared\"; break;\n\t\t\tcase 1: cout << \"Game Over : Death by Hole\"; break;\n\t\t\tcase 2: cout << \"Game Over : Death by Block\"; break;\n\t\t\tcase 3: cout << \"Game Over : Death by Walking Goal\"; break;\n\t\t\tcase 4: cout << \"Game Over : Gave Up\"; break;\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 936,
"score_of_the_acc": -0.069,
"final_rank": 1
},
{
"submission_id": "aoj_1073_429766",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <cstdlib>\n\nusing namespace std;\n\nconst int dx[] = { -1, 0, 1, -1, 1, -1, 0, 1 };\nconst int dy[] = { -1, -1, -1, 0, 0, 1, 1, 1 };\n\nint main(){\n\twhile(true){\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tif(n == 0 && m == 0){ break; }\n\t\tvector<string> field(n);\n\t\tint x, y, gx = -1, gy = -1;\n\t\tfor(int i = 0; i < n; ++i){\n\t\t\tcin >> field[i];\n\t\t\tsize_t st = field[i].find('S');\n\t\t\tif(st != string::npos){\n\t\t\t\tfield[i][st] = '.';\n\t\t\t\tx = st;\n\t\t\t\ty = i;\n\t\t\t}\n\t\t\tsize_t goal = field[i].find('G');\n\t\t\tif(goal != string::npos){\n\t\t\t\tgx = goal;\n\t\t\t\tgy = i;\n\t\t\t}\n\t\t}\n\t\tint T, status = -1;\n\t\tcin >> T;\n\t\tif(y < n - 1 && field[y + 1][x] == 'G'){\n\t\t\tstatus = 0;\n\t\t}else if(y < n - 1 && field[y + 1][x] == 'B'){\n\t\t\tstatus = 1;\n\t\t}\n\t\twhile(status < 0 && T--){\n\t\t\tstring c1, c2;\n\t\t\tcin >> c1 >> c2;\n\t\t\tint px = x, py = y;\n\t\t\tif(c1 == \"MOVETO\"){\n\t\t\t\tint s = atoi(c2.c_str()) - 1;\n\t\t\t\tif(s < 0 || s >= m){ continue; }\n\t\t\t\tif(y == n - 1){\n\t\t\t\t\tif(field[y][s] == '.'){\n\t\t\t\t\t\tswap(field[y][x], field[y][s]);\n\t\t\t\t\t\tx = s;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}else if(s != x){\n\t\t\t\t\tint delta = (s < x ? -1 : 1);\n\t\t\t\t\tbool accept = true;\n\t\t\t\t\tfor(int i = x + delta; i != s; i += delta){\n\t\t\t\t\t\tif(field[y + 1][i] == '.'){\n\t\t\t\t\t\t\taccept = 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\tif(accept && field[y][s] == '.'){\n\t\t\t\t\t\tswap(field[y][x], field[y][s]);\n\t\t\t\t\t\tx = s;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}else if(c1 == \"PUSH\"){\n\t\t\t\tint delta = (c2 == \"LEFT\" ? -1 : 1), last;\n\t\t\t\tbool accept = true;\n\t\t\t\tif(field[y][x + delta] == '.'){ continue; }\n\t\t\t\tfor(last = x + delta; last >= 0 && last < m; last += delta){\n\t\t\t\t\tif(field[y][last] == 'C'){\n\t\t\t\t\t\taccept = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}else if(field[y][last] == '.'){\n\t\t\t\t\t\tlast -= delta;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(!accept){ continue; }\n\t\t\t\tfor(int i = last; i != x; i -= delta){\n\t\t\t\t\tfor(int j = i; j >= 0 && j < m; j += delta){\n\t\t\t\t\t\tint next = j + delta;\n\t\t\t\t\t\tif(next < 0 || next >= m){\n\t\t\t\t\t\t\tfield[y][j] = '.';\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(field[y][next] != '.'){ break; }\n\t\t\t\t\t\tswap(field[y][next], field[y][j]);\n\t\t\t\t\t\tbool ice = (field[y][next] == 'I');\n\t\t\t\t\t\tif(y < n - 1 && field[y + 1][next] == 'I'){ ice = true; }\n\t\t\t\t\t\tif((y < n - 1 && field[y + 1][next] == '.') || !ice){\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}else if(c1 == \"PULL\"){\n\t\t\t\tint delta = (c2 == \"LEFT\" ? 1 : -1);\n\t\t\t\tint next = x + delta, back = x - delta;\n\t\t\t\tif(next < 0 || next >= m || back < 0 || back >= m){ continue; }\n\t\t\t\tif(field[y][next] == '.' || field[y][next] == 'C'){ continue; }\n\t\t\t\tif(field[y][back] != '.'){ continue; }\n\t\t\t\tswap(field[y][x], field[y][back]);\n\t\t\t\tswap(field[y][next], field[y][x]);\n\t\t\t\tx = back;\n\t\t\t}else if(c1 == \"GETDOWN\"){\n\t\t\t\tint delta = (c2 == \"LEFT\" ? -1 : 1);\n\t\t\t\tif(y == n - 1){ continue; }\n\t\t\t\tint next = x + delta;\n\t\t\t\tif(field[y][next] != '.' || field[y + 1][next] != '.'){ continue; }\n\t\t\t\tswap(field[y + 1][next], field[y][x]);\n\t\t\t\ty = y + 1;\n\t\t\t\tx = next;\n\t\t\t}else if(c1 == \"CLIMB\"){\n\t\t\t\tint delta = (c2 == \"LEFT\" ? -1 : 1);\n\t\t\t\tif(y == 0){ continue; }\n\t\t\t\tint next = x + delta;\n\t\t\t\tif(field[y][next] == '.' || field[y - 1][next] != '.'){ continue; }\n\t\t\t\tswap(field[y - 1][next], field[y][x]);\n\t\t\t\ty = y - 1;\n\t\t\t\tx = next;\n\t\t\t}\n\t\t\tif(y < n - 1){\n\t\t\t\tif(field[y + 1][x] == 'G'){\n\t\t\t\t\tstatus = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}else if(field[y + 1][x] == 'B'){\n\t\t\t\t\tstatus = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tint cgx = -1, cgy = -1;\n\t\t\tfor(int i = 0; i < n; ++i){\n\t\t\t\tsize_t p = field[i].find('G');\n\t\t\t\tif(p != string::npos){\n\t\t\t\t\tcgx = p;\n\t\t\t\t\tcgy = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(cgx != gx || cgy != gy){\n\t\t\t\tstatus = 3;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif((y != py || x != px) && py < n - 1){\n\t\t\t\tif(isdigit(field[py + 1][px]) && --field[py + 1][px] == '0'){\n\t\t\t\t\tfield[py + 1][px] = '.';\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile(true){\n\t\t\t\tbool modified = false;\n\t\t\t\tfor(int i = 0; i < n - 1; ++i){\n\t\t\t\t\tfor(int j = 0; j < m; ++j){\n\t\t\t\t\t\tif(field[i][j] == '.'){ continue; }\n\t\t\t\t\t\tif(field[i + 1][j] == 'B'){\n\t\t\t\t\t\t\tfield[i][j] = '.';\n\t\t\t\t\t\t\tmodified = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor(; y < n - 1; ++y){\n\t\t\t\t\tif(field[y + 1][x] == '.'){\n\t\t\t\t\t\tswap(field[y][x], field[y + 1][x]);\n\t\t\t\t\t\tmodified = true;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor(int i = n - 2; i >= 0; --i){\n\t\t\t\t\tfor(int j = 0; j < m; ++j){\n\t\t\t\t\t\tfor(int k = i; k < n - 1; ++k){\n\t\t\t\t\t\t\tif(field[k][j] == '.'){ break; }\n\t\t\t\t\t\t\tif(j > 0 && field[k + 1][j - 1] != '.'){ break; }\n\t\t\t\t\t\t\tif(field[k + 1][j] != '.'){ break; }\n\t\t\t\t\t\t\tif(j < m - 1 && field[k + 1][j + 1] != '.'){ break; }\n\t\t\t\t\t\t\tswap(field[k + 1][j], field[k][j]);\n\t\t\t\t\t\t\tmodified = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(modified){ continue; }\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcgx = -1, cgy = -1;\n\t\t\tfor(int i = 0; i < n; ++i){\n\t\t\t\tsize_t p = field[i].find('G');\n\t\t\t\tif(p != string::npos){\n\t\t\t\t\tcgx = p;\n\t\t\t\t\tcgy = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(cgx != gx || cgy != gy){ status = 3; }\n\t\t\tif(field[y][x] != '.'){ status = 2; }\n\t\t\tif(y < n - 1){\n\t\t\t\tif(field[y + 1][x] == 'B'){ status = 1; }\n\t\t\t\tif(field[y + 1][x] == 'G'){ status = 0; }\n\t\t\t}\n\t\t}\n\t\tif(T < 0){ status = 4; }\n\t\twhile(T-- > 0){\n\t\t\tstring c1, c2;\n\t\t\tcin >> c1 >> c2;\n\t\t}\n\t\tswitch(status){\n\t\t\tcase 0: cout << \"Game Over : Cleared\"; break;\n\t\t\tcase 1: cout << \"Game Over : Death by Hole\"; break;\n\t\t\tcase 2: cout << \"Game Over : Death by Block\"; break;\n\t\t\tcase 3: cout << \"Game Over : Death by Walking Goal\"; break;\n\t\t\tcase 4: cout << \"Game Over : Gave Up\"; break;\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 0.75,
"time_ms": 350,
"memory_kb": 936,
"score_of_the_acc": -0.1264,
"final_rank": 7
},
{
"submission_id": "aoj_1073_429763",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <cstdlib>\n\nusing namespace std;\n\nconst int dx[] = { -1, 0, 1, -1, 1, -1, 0, 1 };\nconst int dy[] = { -1, -1, -1, 0, 0, 1, 1, 1 };\n\nint main(){\n\twhile(true){\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tif(n == 0 && m == 0){ break; }\n\t\tvector<string> field(n);\n\t\tint x, y, gx = -1, gy = -1;\n\t\tfor(int i = 0; i < n; ++i){\n\t\t\tcin >> field[i];\n\t\t\tsize_t st = field[i].find('S');\n\t\t\tif(st != string::npos){\n\t\t\t\tfield[i][st] = '.';\n\t\t\t\tx = st;\n\t\t\t\ty = i;\n\t\t\t}\n\t\t\tsize_t goal = field[i].find('G');\n\t\t\tif(goal != string::npos){\n\t\t\t\tgx = goal;\n\t\t\t\tgy = i;\n\t\t\t}\n\t\t}\n\t\tint T, status = -1;\n\t\tcin >> T;\n\t\tif(y < n - 1 && field[y + 1][x] == 'G'){\n\t\t\tstatus = 0;\n\t\t}else if(y < n - 1 && field[y + 1][x] == 'B'){\n\t\t\tstatus = 1;\n\t\t}\n\t\twhile(status < 0 && T--){\n\t\t\tstring c1, c2;\n\t\t\tcin >> c1 >> c2;\n\t\t\tint px = x, py = y;\n\t\t\tif(c1 == \"MOVETO\"){\n\t\t\t\tint s = atoi(c2.c_str()) - 1;\n\t\t\t\tif(s < 0 || s >= m){ continue; }\n\t\t\t\tif(y == n - 1){\n\t\t\t\t\tif(field[y][s] == '.'){\n\t\t\t\t\t\tswap(field[y][x], field[y][s]);\n\t\t\t\t\t\tx = s;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tint delta = (s < x ? -1 : 1);\n\t\t\t\t\tbool accept = true;\n\t\t\t\t\tfor(int i = x; i != s + delta; i += delta){\n\t\t\t\t\t\tif(field[y + 1][i] == '.'){\n\t\t\t\t\t\t\taccept = 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\tif(accept && field[y][s] == '.'){\n\t\t\t\t\t\tswap(field[y][x], field[y][s]);\n\t\t\t\t\t\tx = s;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}else if(c1 == \"PUSH\"){\n\t\t\t\tint delta = (c2 == \"LEFT\" ? -1 : 1), last;\n\t\t\t\tbool accept = true;\n\t\t\t\tif(field[y][x + delta] == '.'){ continue; }\n\t\t\t\tfor(last = x + delta; last >= 0 && last < m; last += delta){\n\t\t\t\t\tif(field[y][last] == 'C'){\n\t\t\t\t\t\taccept = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}else if(field[y][last] == '.'){\n\t\t\t\t\t\tlast -= delta;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(!accept){ continue; }\n\t\t\t\tfor(int i = last; i != x; i -= delta){\n\t\t\t\t\tfor(int j = i; j >= 0 && j < m; j += delta){\n\t\t\t\t\t\tint next = j + delta;\n\t\t\t\t\t\tif(next < 0 || next >= m){\n\t\t\t\t\t\t\tfield[y][j] = '.';\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(field[y][next] != '.'){ break; }\n\t\t\t\t\t\tswap(field[y][next], field[y][j]);\n\t\t\t\t\t\tbool ice = (field[y][next] == 'I');\n\t\t\t\t\t\tif(y < n - 1 && field[y + 1][next] == 'I'){ ice = true; }\n\t\t\t\t\t\tif((y < n - 1 && field[y + 1][next] == '.') || !ice){\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}else if(c1 == \"PULL\"){\n\t\t\t\tint delta = (c2 == \"LEFT\" ? 1 : -1);\n\t\t\t\tint next = x + delta, back = x - delta;\n\t\t\t\tif(next < 0 || next >= m || back < 0 || back >= m){ continue; }\n\t\t\t\tif(field[y][next] == '.' || field[y][next] == 'C'){ continue; }\n\t\t\t\tif(field[y][back] != '.'){ continue; }\n\t\t\t\tswap(field[y][x], field[y][back]);\n\t\t\t\tswap(field[y][next], field[y][x]);\n\t\t\t\tx = back;\n\t\t\t}else if(c1 == \"GETDOWN\"){\n\t\t\t\tint delta = (c2 == \"LEFT\" ? -1 : 1);\n\t\t\t\tif(y == n - 1){ continue; }\n\t\t\t\tint next = x + delta;\n\t\t\t\tif(field[y][next] != '.' || field[y + 1][next] != '.'){ continue; }\n\t\t\t\tswap(field[y + 1][next], field[y][x]);\n\t\t\t\ty = y + 1;\n\t\t\t\tx = next;\n\t\t\t}else if(c1 == \"CLIMB\"){\n\t\t\t\tint delta = (c2 == \"LEFT\" ? -1 : 1);\n\t\t\t\tif(y == 0){ continue; }\n\t\t\t\tint next = x + delta;\n\t\t\t\tif(field[y][next] == '.' || field[y - 1][next] != '.'){ continue; }\n\t\t\t\tswap(field[y - 1][next], field[y][x]);\n\t\t\t\ty = y - 1;\n\t\t\t\tx = next;\n\t\t\t}\n\t\t\tif(y != py || x != px){\n\t\t\t\tif(y < n - 1){\n\t\t\t\t\tif(field[y + 1][x] == 'G'){\n\t\t\t\t\t\tstatus = 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}else if(field[y + 1][x] == 'B'){\n\t\t\t\t\t\tstatus = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\t\n\t\t\t\t}\n\t\t\t}\n\t\t\tint cgx = -1, cgy = -1;\n\t\t\tfor(int i = 0; i < n; ++i){\n\t\t\t\tsize_t p = field[i].find('G');\n\t\t\t\tif(p != string::npos){\n\t\t\t\t\tcgx = p;\n\t\t\t\t\tcgy = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(cgx != gx || cgy != gy){\n\t\t\t\tstatus = 3;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif((y != py || x != px) && py < n - 1){\n\t\t\t\tif(isdigit(field[py + 1][px]) && --field[py + 1][px] == '0'){\n\t\t\t\t\tfield[py + 1][px] = '.';\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile(true){\n\t\t\t\tbool modified = false;\n\t\t\t\tfor(int i = 0; i < n - 1; ++i){\n\t\t\t\t\tfor(int j = 0; j < m; ++j){\n\t\t\t\t\t\tif(field[i][j] == '.'){ continue; }\n\t\t\t\t\t\tif(field[i + 1][j] == 'B'){\n\t\t\t\t\t\t\tfield[i][j] = '.';\n\t\t\t\t\t\t\tmodified = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor(; y < n - 1; ++y){\n\t\t\t\t\tif(field[y + 1][x] == '.'){\n\t\t\t\t\t\tswap(field[y][x], field[y + 1][x]);\n\t\t\t\t\t\tmodified = true;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor(int i = n - 2; i >= 0; --i){\n\t\t\t\t\tfor(int j = 0; j < m; ++j){\n\t\t\t\t\t\tfor(int k = i; k < n - 1; ++k){\n\t\t\t\t\t\t\tif(field[k][j] == '.'){ break; }\n\t\t\t\t\t\t\tif(j > 0 && field[k + 1][j - 1] != '.'){ break; }\n\t\t\t\t\t\t\tif(field[k + 1][j] != '.'){ break; }\n\t\t\t\t\t\t\tif(j < m - 1 && field[k + 1][j + 1] != '.'){ break; }\n\t\t\t\t\t\t\tswap(field[k + 1][j], field[k][j]);\n\t\t\t\t\t\t\tmodified = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(modified){ continue; }\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcgx = -1, cgy = -1;\n\t\t\tfor(int i = 0; i < n; ++i){\n\t\t\t\tsize_t p = field[i].find('G');\n\t\t\t\tif(p != string::npos){\n\t\t\t\t\tcgx = p;\n\t\t\t\t\tcgy = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(cgx != gx || cgy != gy){ status = 3; }\n\t\t\tif(field[y][x] != '.'){ status = 2; }\n\t\t\tif(y < n - 1){\n\t\t\t\tif(field[y + 1][x] == 'B'){ status = 1; }\n\t\t\t\tif(field[y + 1][x] == 'G'){ status = 0; }\n\t\t\t}\n\t\t}\n\t\tif(T < 0){ status = 4; }\n\t\twhile(T-- > 0){\n\t\t\tstring c1, c2;\n\t\t\tcin >> c1 >> c2;\n\t\t}\n\t\tswitch(status){\n\t\t\tcase 0: cout << \"Game Over : Cleared\"; break;\n\t\t\tcase 1: cout << \"Game Over : Death by Hole\"; break;\n\t\t\tcase 2: cout << \"Game Over : Death by Block\"; break;\n\t\t\tcase 3: cout << \"Game Over : Death by Walking Goal\"; break;\n\t\t\tcase 4: cout << \"Game Over : Gave Up\"; break;\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 0.75,
"time_ms": 310,
"memory_kb": 936,
"score_of_the_acc": -0.0805,
"final_rank": 6
},
{
"submission_id": "aoj_1073_429654",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <cctype>\n#include <sstream>\nusing namespace std;\n \nint dx[] = {-1, 0, 1, 0};\nint dy[] = {0, -1, 0, 1};\n \nint cx[] = {-1,0,1};\nint W,H,T;\nint Gx,Gy;\n \nstring field[55];\n \nvoid dump()\n{\n for(int i=0; i<H; i++) cout << field[i] << endl;\n}\n \nbool isBlock(char c)\n{\n return isalnum(c) || c == '#';\n}\n \nbool Up(int x, int y, int dir)\n{\n int hx = x + dx[dir], hy = y;\n if(hx < 0 || hx >= W) return false;\n if(!isBlock(field[hy][hx])) return false;\n \n int mx = x, my = y - 1;\n if(my < 0) return false;\n if(field[my][mx] != '.') return false;\n \n mx += dx[dir];\n if(field[my][mx] != '.') return false;\n \n return true;\n}\n \nbool Down(int x, int y, int dir)\n{\n int hx = x + dx[dir], hy = y;\n if(hx < 0 || hx >= W) return false;\n if(field[hy][hx] != '.') return false;\n \n int mx = hx, my = hy + 1;\n if(my >= H) return false;\n if(field[my][mx] != '.') return false;\n \n return true;\n}\n \nbool canMove(int x, int y, int mx, int dir)\n{\n if(mx < 0 || mx >= W) return false;\n if(field[y][mx] != '.') return false;\n if(y == H-1) return true;\n\tif(x == mx) return true;\n \n int tx = x + dx[dir];\n while(1) {\n if(tx == mx) break;\n if(!isBlock(field[y+1][tx])) return false;\n \n tx += dx[dir];\n }\n \n return true;\n}\n \nbool cPull(int x, int y, int dir)\n{\n int tx = x + dx[dir], ty = y;\n int bx = x - dx[dir], by = y;\n \n if(bx < 0 || bx >= W) return false;\n if(!isBlock(field[by][bx])) return false;\n if(field[by][bx] == 'C') return false;\n \n if(tx < 0 || tx >= W) return false;\n if(field[ty][tx] != '.') return false;\n \n field[y][x] = field[by][bx];\n field[by][bx] = '.';\n \n return true;\n}\n \nbool canPush(int x, int y, int dir)\n{\n int tx = x, ty = y;\n while(1) {\n tx += dx[dir];\n \n if(tx<0||tx>=W) break;\n if(!isBlock(field[ty][tx])) break;\n if(field[ty][tx]=='C') return false;\n }\n \n tx -= dx[dir];\n \n if(x == tx) return false;\n \n return true;\n}\n \nvoid moveBlock(int x, int y, int dir)\n{\n char tmp = field[y][x];\n field[y][x] = '.';\n int tx = x + dx[dir], ty = y;\n \n while(1) {\n if(tx<0||tx>=W) return;\n if(isBlock(field[ty][tx])) {\n tx -= dx[dir];\n break;\n }\n if(tmp != 'I') {\n if(ty == H-1) break;\n \n if(field[ty+1][tx] != 'I') break;\n }\n else {\n if(ty != H-1) {\n if(field[ty+1][tx] == '.') break;\n }\n }\n \n tx += dx[dir];\n \n }\n \n field[ty][tx] = tmp;\n}\n \nvoid cPush(int x, int y, int dir)\n{\n int tx = x, ty = y;\n while(1) {\n tx += dx[dir];\n \n if(tx < 0 || tx >= W) break;\n if(!isBlock(field[ty][tx])) break;\n }\n \n tx -= dx[dir];\n \n while(x != tx) {\n moveBlock(tx,ty,dir);\n \n tx -= dx[dir];\n }\n}\n \nbool countDown(int x, int y, int px, int py)\n{\n if(x == px && y == py) return false;\n if(py == H-1) return false;\n \n if(!isdigit(field[py+1][px])) return false;\n \n int cnt = field[py+1][px]-'0' - 1;\n if(cnt == 0) field[py+1][px] = '.';\n else field[py+1][px] = cnt + '0';\n \n return true;\n}\n \nbool vanish()\n{\n bool res = false;\n for(int i=1; i<H; i++)\n for(int j=0; j<W; j++) {\n if(field[i][j] == 'B') {\n if(field[i-1][j] != '.') {\n field[i-1][j] = '.';\n res = true;\n }\n }\n }\n \n return res;\n}\n \nbool fallPlayer(int x, int& y)\n{\n int tx=x, ty=y;\n while(1) {\n if(ty == H-1) break;\n if(isBlock(field[ty+1][tx])) break;\n \n ty++;\n }\n \n if(ty==y) return false;\n \n y = ty;\n \n return true;\n}\n \nbool checkFall(int x, int y)\n{\n if(y==H-1) return false;\n \n for(int i=0; i<3; i++) {\n int nx = x + cx[i];\n int ny = y + 1;\n if(nx<0||ny<0||nx>=W||ny>=H) continue;\n if(isBlock(field[ny][nx])) return false;\n }\n \n return true;\n}\n \nbool fallBlock(int x, int y)\n{\n if(y==H-1) return false;\n if(!isBlock(field[y][x])) return false;\n \n char tmp = field[y][x];\n int tx = x, ty = y;\n \n field[y][x] = '.';\n \n while(checkFall(tx,ty)) { ty++; }\n \n field[ty][tx] = tmp;\n \n return (x != tx || y != ty);\n}\n \nbool loopfallBlock()\n{\n bool res = false;\n for(int i=H-2; i>=0; i--)\n for(int j=0; j<W; j++)\n {\n res |= fallBlock(j,i);\n }\n \n return res;\n}\n \nvoid execTurnEnd(int x, int& y, int px, int py)\n{\n countDown(x,y,px,py);\n \n while(1) {\n bool moved = false;\n \n moved |= vanish();\n moved |= fallPlayer(x,y);\n moved |= loopfallBlock();\n \n if(!moved) break;\n }\n}\n \nint checkGameOver(int x, int y)\n{\n if(y!=H-1) {\n if(field[y+1][x] == 'G') return 0;\n if(field[y+1][x] == 'B') return 1;\n }\n \n if(isBlock(field[y][x])) return 2;\n if(field[Gy][Gx] != 'G') return 3;\n \n return -1;\n \n}\n \nvoid output(int type)\n{\n if(type==0) cout << \"Game Over : Cleared\" << endl;\n if(type==1) cout << \"Game Over : Death by Hole\" << endl;\n if(type==2) cout << \"Game Over : Death by Block\" << endl;\n if(type==3) cout << \"Game Over : Death by Walking Goal\" << endl;\n if(type==4) cout << \"Game Over : Gave Up\" << endl;\n}\n \nint parseInt(string a)\n{\n stringstream ss(a);\n \n int res;\n ss >> res;\n \n return res;\n}\n \nvoid doCommand(int sx, int sy, vector<string>& commands)\n{\n int x = sx, y = sy;\n \n for(int i = 0; i < commands.size(); i+=2) {\n int px = x, py = y;\n \n int res = checkGameOver(x,y);\n if(res != -1) {\n output(res);\n return;\n }\n \n if(commands[i] == \"MOVETO\") {\n int s = parseInt(commands[i + 1]) - 1;\n int d = (s < x ? 0 : 2);\n if(canMove(x, y, s, d)) {\n x = s;\n }\n }\n \n if(commands[i] == \"PUSH\") {\n int d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n if(canPush(x,y,d)) {\n cPush(x, y, d);\n }\n }\n \n if(commands[i] == \"PULL\") {\n int d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n if(cPull(x, y, d)) {\n x += dx[d];\n }\n }\n \n if(commands[i] == \"GETDOWN\") {\n int d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n if(Down(x, y, d)) { \n x += dx[d];\n y += 1;\n }\n }\n \n if(commands[i] == \"CLIMB\") {\n int d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n if(Up(x, y, d)) { \n x += dx[d];\n y -= 1;\n }\n }\n \n res = checkGameOver(x,y);\n if(res != -1) {\n output(res);\n return;\n }\n \n execTurnEnd(x, y, px, py);\n \n }\n \n int res = checkGameOver(x,y);\n if(res != -1) {\n output(res);\n return;\n }\n output(4);\n}\n \nint main()\n{\n \n while(cin >> H >> W, (W||H)) {\n vector<string> command;\n for(int i=0; i<H; i++) cin >> field[i];\n \n int sx, sy;\n for(int i=0; i<H; i++)\n for(int j=0; j<W; j++) {\n if(field[i][j] == 'S') {\n sx = j;\n sy = i;\n field[i][j] = '.';\n }\n if(field[i][j] == 'G') {\n Gx = j;\n Gy = i;\n }\n }\n \n cin >> T;\n for(int i=0; i<T; i++) {\n string a,b;\n cin >> a >> b;\n command.push_back(a);\n command.push_back(b);\n }\n \n doCommand(sx, sy, command);\n }\n}",
"accuracy": 0.75,
"time_ms": 1010,
"memory_kb": 984,
"score_of_the_acc": -0.9056,
"final_rank": 12
},
{
"submission_id": "aoj_1073_429651",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <cctype>\n#include <sstream>\nusing namespace std;\n \nint dx[] = {-1, 0, 1, 0};\nint dy[] = {0, -1, 0, 1};\n \nint cx[] = {-1,0,1};\nint W,H,T;\nint Gx,Gy;\n \nstring field[55];\n \nvoid dump()\n{\n for(int i=0; i<H; i++) cout << field[i] << endl;\n}\n \nbool isBlock(char c)\n{\n return isalnum(c) || c == '#';\n}\n \nbool Up(int x, int y, int dir)\n{\n int hx = x + dx[dir], hy = y;\n if(hx < 0 || hx >= W) return false;\n if(!isBlock(field[hy][hx])) return false;\n \n int mx = x, my = y - 1;\n if(my < 0) return false;\n if(field[my][mx] != '.') return false;\n \n mx += dx[dir];\n if(field[my][mx] != '.') return false;\n \n return true;\n}\n \nbool Down(int x, int y, int dir)\n{\n int hx = x + dx[dir], hy = y;\n if(hx < 0 || hx >= W) return false;\n if(field[hy][hx] != '.') return false;\n \n int mx = hx, my = hy + 1;\n if(my >= H) return false;\n if(field[my][mx] != '.') return false;\n \n return true;\n}\n \nbool canMove(int x, int y, int mx, int dir)\n{\n if(mx < 0 || mx >= W) return false;\n if(field[y][mx] != '.') return false;\n if(y == H-1) return true;\n \n int tx = x;\n while(1) {\n if(tx == mx) break;\n if(!isBlock(field[y+1][tx])) return false;\n \n tx += dx[dir];\n }\n \n return true;\n}\n \nbool cPull(int x, int y, int dir)\n{\n int tx = x + dx[dir], ty = y;\n int bx = x - dx[dir], by = y;\n \n if(bx < 0 || bx >= W) return false;\n if(!isBlock(field[by][bx])) return false;\n if(field[by][bx] == 'C') return false;\n \n if(tx < 0 || tx >= W) return false;\n if(field[ty][tx] != '.') return false;\n \n field[y][x] = field[by][bx];\n field[by][bx] = '.';\n \n return true;\n}\n \nbool canPush(int x, int y, int dir)\n{\n int tx = x, ty = y;\n while(1) {\n tx += dx[dir];\n \n if(tx<0||tx>=W) break;\n if(!isBlock(field[ty][tx])) break;\n if(field[ty][tx]=='C') return false;\n }\n \n tx -= dx[dir];\n \n if(x == tx) return false;\n \n return true;\n}\n \nvoid moveBlock(int x, int y, int dir)\n{\n char tmp = field[y][x];\n field[y][x] = '.';\n int tx = x + dx[dir], ty = y;\n \n while(1) {\n if(tx<0||tx>=W) return;\n if(isBlock(field[ty][tx])) {\n tx -= dx[dir];\n break;\n }\n if(tmp != 'I') {\n if(ty == H-1) break;\n \n if(field[ty+1][tx] != 'I') break;\n }\n else {\n if(ty != H-1) {\n if(field[ty+1][tx] == '.') break;\n }\n }\n \n tx += dx[dir];\n \n }\n \n field[ty][tx] = tmp;\n}\n \nvoid cPush(int x, int y, int dir)\n{\n int tx = x, ty = y;\n while(1) {\n tx += dx[dir];\n \n if(tx < 0 || tx >= W) break;\n if(!isBlock(field[ty][tx])) break;\n }\n \n tx -= dx[dir];\n \n while(x != tx) {\n moveBlock(tx,ty,dir);\n \n tx -= dx[dir];\n }\n}\n \nbool countDown(int x, int y, int px, int py)\n{\n if(x == px && y == py) return false;\n if(py == H-1) return false;\n \n if(!isdigit(field[py+1][px])) return false;\n \n int cnt = field[py+1][px]-'0' - 1;\n if(cnt == 0) field[py+1][px] = '.';\n else field[py+1][px] = cnt + '0';\n \n return true;\n}\n \nbool vanish()\n{\n bool res = false;\n for(int i=1; i<H; i++)\n for(int j=0; j<W; j++) {\n if(field[i][j] == 'B') {\n if(field[i-1][j] != '.') {\n field[i-1][j] = '.';\n res = true;\n }\n }\n }\n \n return res;\n}\n \nbool fallPlayer(int x, int& y)\n{\n int tx=x, ty=y;\n while(1) {\n if(ty == H-1) break;\n if(isBlock(field[ty+1][tx])) break;\n \n ty++;\n }\n \n if(ty==y) return false;\n \n y = ty;\n \n return true;\n}\n \nbool checkFall(int x, int y)\n{\n if(y==H-1) return false;\n \n for(int i=0; i<3; i++) {\n int nx = x + cx[i];\n int ny = y + 1;\n if(nx<0||ny<0||nx>=W||ny>=H) continue;\n if(isBlock(field[ny][nx])) return false;\n }\n \n return true;\n}\n \nbool fallBlock(int x, int y)\n{\n if(y==H-1) return false;\n if(!isBlock(field[y][x])) return false;\n \n char tmp = field[y][x];\n int tx = x, ty = y;\n \n field[y][x] = '.';\n \n while(checkFall(tx,ty)) { ty++; }\n \n field[ty][tx] = tmp;\n \n return (x != tx || y != ty);\n}\n \nbool loopfallBlock()\n{\n bool res = false;\n for(int i=H-2; i>=0; i--)\n for(int j=0; j<W; j++)\n {\n res |= fallBlock(j,i);\n }\n \n return res;\n}\n \nvoid execTurnEnd(int x, int& y, int px, int py)\n{\n countDown(x,y,px,py);\n \n while(1) {\n bool moved = false;\n \n moved |= vanish();\n moved |= fallPlayer(x,y);\n moved |= loopfallBlock();\n \n if(!moved) break;\n }\n}\n \nint checkGameOver(int x, int y)\n{\n if(y!=H-1) {\n if(field[y+1][x] == 'G') return 0;\n if(field[y+1][x] == 'B') return 1;\n }\n \n if(isBlock(field[y][x])) return 2;\n if(field[Gy][Gx] != 'G') return 3;\n \n return -1;\n \n}\n \nvoid output(int type)\n{\n if(type==0) cout << \"Game Over : Cleared\" << endl;\n if(type==1) cout << \"Game Over : Death by Hole\" << endl;\n if(type==2) cout << \"Game Over : Death by Block\" << endl;\n if(type==3) cout << \"Game Over : Death by Walking Goal\" << endl;\n if(type==4) cout << \"Game Over : Gave Up\" << endl;\n}\n \nint parseInt(string a)\n{\n stringstream ss(a);\n \n int res;\n ss >> res;\n \n return res;\n}\n \nvoid doCommand(int sx, int sy, vector<string>& commands)\n{\n int x = sx, y = sy;\n \n for(int i = 0; i < commands.size(); i+=2) {\n int px = x, py = y;\n \n int res = checkGameOver(x,y);\n if(res != -1) {\n output(res);\n return;\n }\n \n if(commands[i] == \"MOVETO\") {\n int s = parseInt(commands[i + 1]) - 1;\n int d = (s < x ? 0 : 2);\n if(canMove(x, y, s, d)) {\n x = s;\n }\n }\n \n if(commands[i] == \"PUSH\") {\n int d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n if(canPush(x,y,d)) {\n cPush(x, y, d);\n }\n }\n \n if(commands[i] == \"PULL\") {\n int d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n if(cPull(x, y, d)) {\n x += dx[d];\n }\n }\n \n if(commands[i] == \"GETDOWN\") {\n int d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n if(Down(x, y, d)) { \n x += dx[d];\n y += 1;\n }\n }\n \n if(commands[i] == \"CLIMB\") {\n int d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n if(Up(x, y, d)) { \n x += dx[d];\n y -= 1;\n }\n }\n \n res = checkGameOver(x,y);\n if(res != -1) {\n output(res);\n return;\n }\n \n execTurnEnd(x, y, px, py);\n \n }\n \n int res = checkGameOver(x,y);\n if(res != -1) {\n output(res);\n return;\n }\n output(4);\n}\n \nint main()\n{\n \n while(cin >> H >> W, (W||H)) {\n vector<string> command;\n for(int i=0; i<H; i++) cin >> field[i];\n \n int sx, sy;\n for(int i=0; i<H; i++)\n for(int j=0; j<W; j++) {\n if(field[i][j] == 'S') {\n sx = j;\n sy = i;\n field[i][j] = '.';\n }\n if(field[i][j] == 'G') {\n Gx = j;\n Gy = i;\n }\n }\n \n cin >> T;\n for(int i=0; i<T; i++) {\n string a,b;\n cin >> a >> b;\n command.push_back(a);\n command.push_back(b);\n }\n \n doCommand(sx, sy, command);\n }\n}",
"accuracy": 0.75,
"time_ms": 1040,
"memory_kb": 988,
"score_of_the_acc": -0.9418,
"final_rank": 13
},
{
"submission_id": "aoj_1073_429595",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <cctype>\n#include <sstream>\nusing namespace std;\n\nint dx[] = {-1, 0, 1, 0};\nint dy[] = {0, -1, 0, 1};\n\nint cx[] = {-1,0,1};\nint W,H,T;\nint Gx,Gy;\n\nstring field[55];\n\nvoid dump()\n{\n\tfor(int i=0; i<H; i++) cout << field[i] << endl;\n}\n\nbool isBlock(char c)\n{\n\treturn isalnum(c) || c == '#';\n}\n\nbool Up(int x, int y, int dir)\n{\n\tint hx = x + dx[dir], hy = y;\n\tif(hx < 0 || hx >= W) return false;\n\tif(!isBlock(field[hy][hx])) return false;\n\n\tint mx = x, my = y - 1;\n\tif(my < 0) return false;\n\tif(field[my][mx] != '.') return false;\n\n\tmx += dx[dir];\n\tif(field[my][mx] != '.') return false;\n\n\treturn true;\n}\n\nbool Down(int x, int y, int dir)\n{\n\tint hx = x + dx[dir], hy = y;\n\tif(hx < 0 || hx >= W) return false;\n\tif(field[hy][hx] != '.') return false;\n\n\tint mx = hx, my = hy + 1;\n\tif(my >= H) return false;\n\tif(field[my][mx] != '.') return false;\n\n\treturn true;\n}\n\nbool canMove(int x, int y, int mx, int dir)\n{\n\tif(mx < 0 || mx >= W) return false;\n\tif(field[y][mx] != '.') return false;\n\tif(y == H-1) return true;\n\n\tint tx = x;\n\twhile(1) {\n\t\tif(tx == mx) break;\n\t\tif(!isBlock(field[y+1][x])) return false;\n\t\t\n\t\ttx += dx[dir];\n\t}\n\n\treturn true;\n}\n\nbool cPull(int x, int y, int dir)\n{\n\tint tx = x + dx[dir], ty = y;\n\tint bx = x - dx[dir], by = y;\n\n\tif(bx < 0 || bx >= W) return false;\n\tif(!isBlock(field[by][bx])) return false;\n\tif(field[by][bx] == 'C') return false;\n\n\tif(tx < 0 || tx >= W) return false;\n\tif(field[ty][tx] != '.') return false;\n\n\tfield[y][x] = field[by][bx];\n\tfield[by][bx] = '.';\n\n\treturn true;\n}\n\nbool canPush(int x, int y, int dir)\n{\n\tint tx = x, ty = y;\n\twhile(1) {\n\t\ttx += dx[dir];\n\n\t\tif(tx<0||tx>=W) break;\n\t\tif(!isBlock(field[ty][tx])) break;\n\t\tif(field[ty][tx]=='C') return false;\n\t}\n\n\ttx -= dx[dir];\n\n\tif(x == tx) return false;\n\n\treturn true;\n}\n\nvoid moveBlock(int x, int y, int dir)\n{\n\tchar tmp = field[y][x];\n\tfield[y][x] = '.';\n\tint tx = x + dx[dir], ty = y;\n\n\twhile(1) {\n\t\tif(tx<0||tx>=W) return;\n\t\tif(isBlock(field[ty][tx])) {\n\t\t\ttx -= dx[dir];\n\t\t\tbreak;\n\t\t}\n\t\tif(tmp != 'I') {\n\t\t\tif(ty == H-1) break;\n\n\t\t\tif(field[ty+1][tx] != 'I') break;\n\t\t}\n\t\telse {\n\t\t\tif(ty != H-1) {\n\t\t\t\tif(field[ty+1][tx] == '.') break;\n\t\t\t}\n\t\t}\n\n\t\ttx += dx[dir];\n\t\t\n\t}\n\n\tfield[ty][tx] = tmp;\n}\n\nvoid cPush(int x, int y, int dir)\n{\n\tint tx = x, ty = y;\n\twhile(1) {\n\t\ttx += dx[dir];\n\n\t\tif(tx < 0 || tx >= W) break;\n\t\tif(!isBlock(field[ty][tx])) break;\n\t}\n\n\ttx -= dx[dir];\n\n\twhile(x != tx) {\n\t\tmoveBlock(tx,ty,dir);\n\n\t\ttx -= dx[dir];\n\t}\n}\n\nbool countDown(int x, int y, int px, int py)\n{\n\tif(x == px && y == py) return false;\n\tif(py == H-1) return false;\n\n\tif(!isdigit(field[py+1][px])) return false;\n\n\tint cnt = field[py+1][px]-'0' - 1;\n\tif(cnt == 0) field[py+1][px] = '.';\n\telse field[py+1][px] = cnt + '0';\n\n\treturn true;\n}\n\nbool extinct()\n{\n\tbool res = false;\n\tfor(int i=1; i<H; i++)\n\tfor(int j=0; j<W; j++) {\n\t\tif(field[i][j] == 'B') {\n\t\t\tif(field[i-1][j] != '.') {\n\t\t\t\tfield[i-1][j] = '.';\n\t\t\t\tres = true;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn res;\n}\n\nbool fallPlayer(int x, int& y)\n{\n\tint tx=x, ty=y;\n\twhile(1) {\n\t\tif(ty == H-1) break;\n\t\tif(isBlock(field[ty+1][tx])) break;\n\n\t\tty++;\n\t}\n\n\tif(ty==y) return false;\n\n\ty = ty;\n\n\treturn true;\n}\n\nbool checkFall(int x, int y)\n{\n\tif(y==H-1) return false;\n\n\tfor(int i=0; i<3; i++) {\n\t\tint nx = x + cx[i];\n\t\tint ny = y + 1;\n\t\tif(nx<0||ny<0||nx>=W||ny>=H) continue;\n\t\tif(isBlock(field[ny][nx])) return false;\n\t}\n\n\treturn true;\n}\n\nbool fallBlock(int x, int y)\n{\n\tif(y==H-1) return false;\n\tif(!isBlock(field[y][x])) return false;\n\n\tchar tmp = field[y][x];\n\tint tx = x, ty = y;\n\n\tfield[y][x] = '.';\n\n\twhile(checkFall(tx,ty)) { ty++; }\n\n\tfield[ty][tx] = tmp;\n\n\treturn (x != tx || y != ty);\n}\n\nbool loopfallBlock()\n{\n\tbool res = false;\n\tfor(int i=H-2; i>=0; i--)\n\tfor(int j=0; j<W; j++)\n\t{\n\t\tres |= fallBlock(j,i);\n\t}\n\n\treturn res;\n}\n\nvoid execTurnEnd(int x, int& y, int px, int py)\n{\n\tcountDown(x,y,px,py);\n\t\n\twhile(1) {\n\t\tbool moved = false;\n\n\t\tmoved |= extinct();\n\t\tmoved |= fallPlayer(x,y);\n\t\tmoved |= loopfallBlock();\n\n\t\tif(!moved) break;\n\t}\n}\n\nint checkGameOver(int x, int y)\n{\n\tif(y!=H-1) {\n\t\tif(field[y+1][x] == 'G') return 0;\n\t\tif(field[y+1][x] == 'B') return 1;\n\t}\n\n\tif(isBlock(field[y][x])) return 2;\n\tif(field[Gy][Gx] != 'G') return 3;\n\n\treturn -1;\n\n}\n\nvoid output(int type)\n{\n\tif(type==0) cout << \"Game Over : Cleared\" << endl;\n\tif(type==1) cout << \"Game Over : Death by Hole\" << endl;\n\tif(type==2) cout << \"Game Over : Death by Block\" << endl;\n\tif(type==3) cout << \"Game Over : Death by Walking Goal\" << endl;\n\tif(type==4) cout << \"Game Over : Gave Up\" << endl;\n}\n\nint parseInt(string a)\n{\n\tstringstream ss(a);\n\n\tint res;\n\tss >> res;\n\n\treturn res;\n}\n\nvoid doCommand(int sx, int sy, vector<string>& commands)\n{\n\tint x = sx, y = sy;\n\n\tfor(int i = 0; i < commands.size(); i+=2) {\n\t\tint px = x, py = y;\n\n\t\tint res = checkGameOver(x,y);\n\t\tif(res != -1) {\n\t\t\toutput(res);\n\t\t\treturn;\n\t\t}\n\n\t\tif(commands[i] == \"MOVETO\") {\n\t\t\tint s = parseInt(commands[i + 1]) - 1;\n\t\t\tint d = (s < x ? 0 : 2);\n\t\t\tif(canMove(x, y, s, d)) {\n\t\t\t\tx = s;\n\t\t\t}\n\t\t}\n\n\t\tif(commands[i] == \"PUSH\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tif(canPush(x,y,d)) {\n\t\t\t\tcPush(x, y, d);\n\t\t\t}\n\t\t}\n\n\t\tif(commands[i] == \"PULL\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tif(cPull(x, y, d)) {\n\t\t\t\tx += dx[d];\n\t\t\t}\n\t\t}\n\n\t\tif(commands[i] == \"GETDOWN\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tif(Down(x, y, d)) { \n\t\t\t\tx += dx[d];\n\t\t\t\ty += 1;\n\t\t\t}\n\t\t}\n\n\t\tif(commands[i] == \"CLIMB\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tif(Up(x, y, d)) { \n\t\t\t\tx += dx[d];\n\t\t\t\ty -= 1;\n\t\t\t}\n\t\t}\n\n\t\tres = checkGameOver(x,y);\n\t\tif(res != -1) {\n\t\t\toutput(res);\n\t\t\treturn;\n\t\t}\n\n\t\texecTurnEnd(x, y, px, py);\n\n\t}\n\n\tint res = checkGameOver(x,y);\n\tif(res != -1) {\n\t\toutput(res);\n\t\treturn;\n\t}\n\toutput(4);\n}\n\nint main()\n{\n\n\twhile(cin >> H >> W, (W||H)) {\n\t\tvector<string> command;\n\t\tfor(int i=0; i<H; i++) cin >> field[i];\n\n\t\tint sx, sy;\n\t\tfor(int i=0; i<H; i++)\n\t\tfor(int j=0; j<W; j++) {\n\t\t\tif(field[i][j] == 'S') {\n\t\t\t\tsx = j;\n\t\t\t\tsy = i;\n\t\t\t\tfield[i][j] = '.';\n\t\t\t}\n\t\t\tif(field[i][j] == 'G') {\n\t\t\t\tGx = j;\n\t\t\t\tGy = i;\n\t\t\t}\n\t\t}\n\n\t\tcin >> T;\n\t\tfor(int i=0; i<T; i++) {\n\t\t\tstring a,b;\n\t\t\tcin >> a >> b;\n\t\t\tcommand.push_back(a);\n\t\t\tcommand.push_back(b);\n\t\t}\n\n\t\tdoCommand(sx, sy, command);\n\t}\n}",
"accuracy": 0.75,
"time_ms": 590,
"memory_kb": 984,
"score_of_the_acc": -0.4228,
"final_rank": 10
},
{
"submission_id": "aoj_1073_429524",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <cctype>\n#include <sstream>\nusing namespace std;\n\nint dx[] = {-1, 0, 1, 0};\nint dy[] = {0, -1, 0, 1};\n\nint cx[] = {-1,0,1};\nint W,H,T;\nint Gx,Gy;\n\nstring field[55];\n\nvoid dump()\n{\n\tfor(int i=0; i<H; i++) cout << field[i] << endl;\n}\n\nbool isBlock(char c)\n{\n\treturn isalnum(c) || c == '#';\n}\n\nbool Up(int x, int y, int dir)\n{\n\tint hx = x + dx[dir], hy = y;\n\tif(hx < 0 || hx >= W) return false;\n\tif(!isBlock(field[hy][hx])) return false;\n\n\tint mx = x, my = y - 1;\n\tif(my < 0) return false;\n\tif(field[my][mx] != '.') return false;\n\n\tmx += dx[dir];\n\tif(field[my][mx] != '.') return false;\n\n\treturn true;\n}\n\nbool Down(int x, int y, int dir)\n{\n\tint hx = x + dx[dir], hy = y;\n\tif(hx < 0 || hx >= W) return false;\n\tif(field[hy][hx] != '.') return false;\n\n\tint mx = hx, my = hy + 1;\n\tif(my >= H) return false;\n\tif(field[my][mx] != '.') return false;\n\n\treturn true;\n}\n\nbool canMove(int x, int y, int mx, int dir)\n{\n\tif(mx < 0 || mx >= W) return false;\n\tif(field[y][mx] != '.') return false;\n\tif(y == H-1) return true;\n\n\tint tx = x;\n\twhile(1) {\n\t\tif(tx == mx) break;\n\t\tif(!isBlock(field[y+1][x])) return false;\n\t\t\n\t\ttx += dx[dir];\n\t}\n\n\treturn true;\n}\n\nbool cPull(int x, int y, int dir)\n{\n\tint tx = x + dx[dir], ty = y + dy[dir];\n\tint bx = x - dx[dir], by = y - dy[dir];\n\n\tif(bx < 0 || bx >= W) return false;\n\tif(!isBlock(field[by][bx])) return false;\n\tif(field[by][bx] == 'C') return false;\n\n\tif(tx < 0 || tx >= W) return false;\n\tif(field[ty][tx] != '.') return false;\n\n\tfield[y][x] = field[by][bx];\n\tfield[by][bx] = '.';\n\n\treturn true;\n}\n\nbool canPush(int x, int y, int dir)\n{\n\tint tx = x, ty = y;\n\twhile(1) {\n\t\ttx += dx[dir];\n\n\t\tif(tx<0||tx>=W) break;\n\t\tif(!isBlock(field[ty][tx])) break;\n\t\tif(field[ty][tx]=='C') return false;\n\t}\n\n\ttx -= dx[dir];\n\n\tif(x == tx) return false;\n\n\treturn true;\n}\n\nvoid moveBlock(int x, int y, int dir)\n{\n\tchar tmp = field[y][x];\n\tfield[y][x] = '.';\n\tint tx = x + dx[dir], ty = y;\n\n\twhile(1) {\n\t\tif(tx<0||tx>=W) return;\n\t\tif(isBlock(field[ty][tx])) {\n\t\t\ttx -= dx[dir];\n\t\t\tbreak;\n\t\t}\n\t\tif(tmp != 'I') {\n\t\t\tif(ty != H-1) {\n\t\t\t\tif(field[ty+1][tx] != 'I') break;\n\t\t\t}\n\t\t\telse break;\n\t\t}\n\n\t\tif(ty != H-1) {\n\t\t\tif(field[ty+1][tx] == '.') break;\n\t\t}\n\n\t\ttx += dx[dir];\n\t\t\n\t}\n\n\tfield[ty][tx] = tmp;\n}\n\nvoid Push(int x, int y, int dir)\n{\n\tint tx = x, ty = y;\n\twhile(1) {\n\t\ttx += dx[dir];\n\t\tif(tx < 0 || tx >= W) break;\n\n\t\tif(!isBlock(field[ty][tx])) break;\n\t}\n\n\ttx -= dx[dir];\n\n\twhile(1) {\n\t\tif(x == tx) break;\n\t\tmoveBlock(tx,ty,dir);\n\n\t\ttx -= dx[dir];\n\t}\n}\n\nbool cPush(int x, int y, int dir)\n{\n\tif(!canPush(x,y,dir)) return false;\n\n\tPush(x,y,dir);\n\n\treturn true;\n}\n\nbool countDown(int x, int y, int px, int py)\n{\n\tif(x==px && y==py) return false;\n\tif(py==H-1) return false;\n\n\tif(!isdigit(field[py+1][px])) return false;\n\n\tint cnt = field[py+1][px]-'0' - 1;\n\tif(cnt == 0) field[py+1][px] = '.';\n\telse field[py+1][px] = cnt + '0';\n\n\treturn true;\n}\n\nbool extinct()\n{\n\tfor(int i=1; i<H; i++)\n\tfor(int j=0; j<W; j++) {\n\t\tif(field[i][j] == 'B') {\n\t\t\tif(field[i-1][j] != '.') {\n\t\t\t\tfield[i-1][j] = '.';\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn false;\n}\n\nbool fallPlayer(int x, int& y)\n{\n\tint tx=x, ty=y;\n\twhile(1) {\n\t\tif(ty == H-1) break;\n\t\tif(isBlock(field[ty+1][tx])) break;\n\n\t\tty++;\n\t}\n\n\tif(ty==y) return false;\n\n\ty = ty;\n\n\treturn true;\n}\n\nbool checkFall(int x, int y)\n{\n\tif(y==H-1) return false;\n\n\tfor(int i=0; i<3; i++) {\n\t\tint nx = x + cx[i];\n\t\tint ny = y + 1;\n\t\tif(nx<0||ny<0||nx>=W||ny>=H) continue;\n\t\tif(isBlock(field[ny][nx])) return false;\n\t}\n\n\treturn true;\n}\n\nbool fallBlock(int x, int y)\n{\n\tif(y==H-1) return false;\n\tif(!isBlock(field[y][x])) return false;\n\n\tchar tmp = field[y][x];\n\tint tx = x, ty = y;\n\n\tfield[y][x] = '.';\n\n\twhile(checkFall(tx,ty)) { ty++; }\n\n\tfield[ty][tx] = tmp;\n\n\treturn x != tx || y != ty;\n}\n\nbool loopfallBlock()\n{\n\tbool res = false;\n\tfor(int i=H-2; i>=0; i--)\n\tfor(int j=0; j<W; j++)\n\t{\n\t\tres |= fallBlock(j,i);\n\t}\n\n\treturn res;\n}\n\nvoid execTurnEnd(int x, int& y, int px, int py)\n{\n\tcountDown(x,y,px,py);\n\t\n\twhile(1) {\n\t\tbool moved = false;\n\n\t\tmoved |= extinct();\n\t\tmoved |= fallPlayer(x,y);\n\t\tmoved |= loopfallBlock();\n\n\t\tif(!moved) break;\n\t}\n}\n\nint checkGameOver(int x, int y)\n{\n\tif(y!=H-1) {\n\t\tif(field[y+1][x] == 'G') return 0;\n\t\tif(field[y+1][x] == 'B') return 1;\n\t}\n\n\tif(isBlock(field[y][x])) return 2;\n\tif(field[Gy][Gx] != 'G') return 3;\n\n\treturn -1;\n\n}\n\nvoid output(int type)\n{\n\tif(type==0) cout << \"Game Over : Cleared\" << endl;\n\tif(type==1) cout << \"Game Over : Death by Hole\" << endl;\n\tif(type==2) cout << \"Game Over : Death by Block\" << endl;\n\tif(type==3) cout << \"Game Over : Death by Walking Goal\" << endl;\n\tif(type==4) cout << \"Game Over : Gave Up\" << endl;\n}\n\nint parseInt(string a)\n{\n\tstringstream ss(a);\n\n\tint res;\n\tss >> res;\n\n\treturn res;\n}\n\nvoid doCommand(int sx, int sy, vector<string>& commands)\n{\n\tint x = sx, y = sy;\n\n\tfor(int i=0; i<commands.size(); i+=2) {\n\t\tint px = x, py = y;\n\n\t\tint res = checkGameOver(x,y);\n\t\tif(res != -1) {\n\t\t\toutput(res);\n\t\t\treturn;\n\t\t}\n\n\t\tif(commands[i] == \"MOVETO\") {\n\t\t\tint s = parseInt(commands[i + 1]) - 1;\n\t\t\tint d = (s < x ? 0 : 2);\n\n\t\t\tif(canMove(x, y, s, d)) x = s;\n\t\t}\n\n\t\tif(commands[i] == \"PUSH\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tcPush(x, y, d);\n\t\t}\n\n\t\tif(commands[i] == \"PULL\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tif(cPull(x, y, d)) {\n\t\t\t\tx += dx[d];\n\t\t\t\ty += dy[d];\n\t\t\t}\n\t\t}\n\n\t\tif(commands[i] == \"GETDOWN\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tif(Down(x, y, d)) { \n\t\t\t\tx += dx[d];\n\t\t\t\ty += 1;\n\t\t\t}\n\t\t}\n\n\t\tif(commands[i] == \"CLIMB\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tif(Up(x, y, d)) { \n\t\t\t\tx += dx[d];\n\t\t\t\ty -= 1;\n\t\t\t}\n\t\t}\n\n\t\tres = checkGameOver(x,y);\n\t\tif(res != -1) {\n\t\t\toutput(res);\n\t\t\treturn;\n\t\t}\n\n\t\texecTurnEnd(x, y, px, py);\n\n\t}\n\n\tint res = checkGameOver(x,y);\n\tif(res != -1) {\n\t\toutput(res);\n\t\treturn;\n\t}\n\toutput(4);\n}\n\nint main()\n{\n\n\twhile(cin >> H >> W, (W||H)) {\n\t\tvector<string> command;\n\t\tfor(int i=0; i<H; i++) cin >> field[i];\n\n\t\tint sx, sy;\n\t\tfor(int i=0; i<H; i++)\n\t\tfor(int j=0; j<W; j++) {\n\t\t\tif(field[i][j] == 'S') {\n\t\t\t\tsx = j;\n\t\t\t\tsy = i;\n\t\t\t\tfield[i][j] = '.';\n\t\t\t}\n\t\t\tif(field[i][j] == 'G') {\n\t\t\t\tGx = j;\n\t\t\t\tGy = i;\n\t\t\t}\n\t\t}\n\n\t\tcin >> T;\n\t\tfor(int i=0; i<T; i++) {\n\t\t\tstring a,b;\n\t\t\tcin >> a >> b;\n\t\t\tcommand.push_back(a);\n\t\t\tcommand.push_back(b);\n\t\t}\n\n\t\tdoCommand(sx, sy, command);\n\t}\n}\n\n/*\n10 2\nB.\nB#\nB.\nB.\nB.\nB.\nB.\nBS\nB#\nBG\n1\nPUSH LEFT\n*/\n\n/*\n2 4\n.IIS\nG..#\n1\nPUSH LEFT\n*/",
"accuracy": 0.75,
"time_ms": 600,
"memory_kb": 988,
"score_of_the_acc": -0.436,
"final_rank": 11
},
{
"submission_id": "aoj_1073_429472",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <cctype>\nusing namespace std;\n\nint dx[] = {-1, 0, 1, 0};\nint dy[] = {0, -1, 0, 1};\n\nint cx[] = {-1,0,1};\nint W,H,T;\nint Gx,Gy;\n\nstring field[55];\n\nvoid dump()\n{\n\tfor(int i=0; i<H; i++) cout << field[i] << endl;\n}\n\nbool isBlock(char c)\n{\n\treturn isalnum(c) || c == '#';\n}\n\nbool Up(int x, int y, int dir)\n{\n\tint hx = x + dx[dir], hy = y;\n\tif(hx < 0 || hx >= W) return false;\n\tif(!isBlock(field[hy][hx])) return false;\n\n\tint mx = x, my = y - 1;\n\tif(my < 0) return false;\n\tif(field[my][mx] != '.') return false;\n\n\tmx += dx[dir];\n\tif(field[my][mx] != '.') return false;\n\n\treturn true;\n}\n\nbool Down(int x, int y, int dir)\n{\n\tint hx = x + dx[dir], hy = y;\n\tif(hx < 0 || hx >= W) return false;\n\tif(field[hy][hx] != '.') return false;\n\n\tint mx = hx, my = hy + 1;\n\tif(my >= H) return false;\n\tif(field[my][mx] != '.') return false;\n\n\treturn true;\n}\n\nbool canMove(int x, int y, int mx, int dir)\n{\n\tif(field[y][mx] != '.') return false;\n\tif(y == H-1) return true;\n\n\tint tx = x;\n\twhile(1) {\n\t\tif(tx == mx) break;\n\t\tif(!isBlock(field[y+1][x])) return false;\n\t\t\n\t\ttx += dx[dir];\n\t}\n\n\treturn true;\n}\n\nbool cPull(int x, int y, int dir)\n{\n\tint tx = x + dx[dir], ty = y + dy[dir];\n\tint bx = x - dx[dir], by = y - dy[dir];\n\n\tif(bx < 0 || bx >= W) return false;\n\tif(!isBlock(field[by][bx])) return false;\n\tif(field[by][bx] == 'C') return false;\n\n\tif(tx < 0 || tx >= W) return false;\n\tif(field[ty][tx] != '.') return false;\n\n\tfield[y][x] = field[by][bx];\n\tfield[by][bx] = '.';\n\n\treturn true;\n}\n\nbool canPush(int x, int y, int dir)\n{\n\tint tx = x, ty = y;\n\twhile(1) {\n\t\ttx += dx[dir];\n\n\t\tif(tx<0||tx>=W) break;\n\t\tif(!isBlock(field[ty][tx])) break;\n\t\tif(field[ty][tx]=='C') return false;\n\t}\n\n\ttx -= dx[dir];\n\n\tif(x == tx) return false;\n\n\treturn true;\n}\n\nvoid moveBlock(int x, int y, int dir)\n{\n\tchar tmp = field[y][x];\n\tfield[y][x] = '.';\n\tint tx = x + dx[dir], ty = y;\n\n\twhile(1) {\n\t\tif(tx<0||tx>=W) return;\n\t\tif(isBlock(field[ty][tx])) {\n\t\t\ttx -= dx[dir];\n\t\t\tbreak;\n\t\t}\n\t\tif(tmp != 'I') {\n\t\t\tif(ty != H-1) {\n\t\t\t\tif(field[ty+1][tx] != 'I') break;\n\t\t\t}\n\t\t\telse break;\n\t\t}\n\n\t\tif(ty != H-1) {\n\t\t\tif(tx!=x && field[ty+1][tx] == '.') break;\n\t\t}\n\n\t\ttx += dx[dir];\n\t\t\n\t}\n\n\tfield[ty][tx] = tmp;\n}\n\nvoid Push(int x, int y, int dir)\n{\n\tint tx = x, ty = y;\n\twhile(1) {\n\t\ttx += dx[dir];\n\t\tif(tx < 0 || tx >= W) break;\n\n\t\tif(!isBlock(field[ty][tx])) break;\n\t}\n\n\ttx -= dx[dir];\n\n\twhile(1) {\n\t\tif(x == tx) break;\n\t\tmoveBlock(tx,ty,dir);\n\n\t\ttx -= dx[dir];\n\t}\n}\n\nbool cPush(int x, int y, int dir)\n{\n\tif(!canPush(x,y,dir)) return false;\n\n\tPush(x,y,dir);\n\n\treturn true;\n}\n\nbool countDown(int x, int y, int px, int py)\n{\n\tif(x==px && y==py) return false;\n\tif(py==H-1) return false;\n\n\tif(!isdigit(field[py+1][px])) return false;\n\n\tint cnt = field[py+1][px]-'0' - 1;\n\tif(cnt == 0) field[py+1][px] = '.';\n\telse field[py+1][px] = cnt + '0';\n\n\treturn true;\n}\n\nbool extinct()\n{\n\tfor(int i=1; i<H; i++)\n\tfor(int j=0; j<W; j++) {\n\t\tif(field[i][j] == 'B') {\n\t\t\tif(field[i-1][j] != '.') {\n\t\t\t\tfield[i-1][j] = '.';\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn false;\n}\n\nbool fallPlayer(int x, int& y)\n{\n\tint tx=x, ty=y;\n\twhile(1) {\n\t\tif(ty == H-1) break;\n\t\tif(isBlock(field[ty+1][tx])) break;\n\n\t\tty++;\n\t}\n\n\tif(ty==y) return false;\n\n\ty = ty;\n\n\treturn true;\n}\n\nbool checkFall(int x, int y)\n{\n\tif(y==H-1) return false;\n\n\tfor(int i=0; i<3; i++) {\n\t\tint nx = x + cx[i];\n\t\tint ny = y + 1;\n\t\tif(nx<0||ny<0||nx>=W||ny>=H) continue;\n\t\tif(isBlock(field[ny][nx])) return false;\n\t}\n\n\treturn true;\n}\n\nbool fallBlock(int x, int y)\n{\n\tif(y==H-1) return false;\n\tif(!isBlock(field[y][x])) return false;\n\n\tchar tmp = field[y][x];\n\tint tx = x, ty = y;\n\n\tfield[y][x] = '.';\n\n\twhile(checkFall(tx,ty)) { ty++; }\n\n\tfield[ty][tx] = tmp;\n\n\treturn x != tx || y != ty;\n}\n\nbool loopfallBlock()\n{\n\tbool res = false;\n\tfor(int i=H-1; i>=0; i--)\n\tfor(int j=0; j<W; j++)\n\t{\n\t\tres |= fallBlock(j,i);\n\t}\n\n\treturn res;\n}\n\nvoid execTurnEnd(int x, int& y, int px, int py)\n{\n\tcountDown(x,y,px,py);\n\t\n\twhile(1) {\n\t\tbool moved = false;\n\n\t\tmoved |= extinct();\n\t\tmoved |= fallPlayer(x,y);\n\t\tmoved |= loopfallBlock();\n\n\t\tif(!moved) break;\n\t}\n}\n\nint checkGameOver(int x, int y)\n{\n\tif(y!=H-1) {\n\t\tif(field[y+1][x] == 'G') return 0;\n\t\tif(field[y+1][x] == 'B') return 1;\n\t}\n\n\tif(isBlock(field[y][x])) return 2;\n\tif(field[Gy][Gx] != 'G') return 3;\n\n\treturn -1;\n\n}\n\nvoid output(int type)\n{\n\tif(type==0) cout << \"Game Over : Cleared\" << endl;\n\tif(type==1) cout << \"Game Over : Death by Hole\" << endl;\n\tif(type==2) cout << \"Game Over : Death by Block\" << endl;\n\tif(type==3) cout << \"Game Over : Death by Walking Goal\" << endl;\n\tif(type==4) cout << \"Game Over : Gave Up\" << endl;\n}\n\nint parseInt(string a)\n{\n\tint res = 0;\n\tfor(int i = 0; i < a.size(); i++) {\n\t\tres *= 10;\n\t\tres += a[i] - '0';\n\t}\n\n\treturn res;\n}\n\nvoid doCommand(int sx, int sy, vector<string>& commands)\n{\n\tint x = sx, y = sy;\n\n\tfor(int i=0; i<commands.size(); i+=2) {\n\t\tint px = x, py = y;\n\n\t\tint res = checkGameOver(x,y);\n\t\tif(res != -1) {\n\t\t\toutput(res);\n\t\t\treturn;\n\t\t}\n\n\t\tif(commands[i] == \"MOVETO\") {\n\t\t\tint s = parseInt(commands[i + 1]) - 1;\n\t\t\tint d = (s < x ? 0 : 2);\n\n\t\t\tif(canMove(x, y, s, d)) x = s;\n\t\t}\n\n\t\tif(commands[i] == \"PUSH\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tcPush(x, y, d);\n\t\t}\n\n\t\tif(commands[i] == \"PULL\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tif(cPull(x, y, d)) {\n\t\t\t\tx += dx[d];\n\t\t\t\ty += dy[d];\n\t\t\t}\n\t\t}\n\n\t\tif(commands[i] == \"GETDOWN\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tif(Down(x, y, d)) { \n\t\t\t\tx += dx[d];\n\t\t\t\ty += 1;\n\t\t\t}\n\t\t}\n\n\t\tif(commands[i] == \"CLIMB\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tif(Up(x, y, d)) { \n\t\t\t\tx += dx[d];\n\t\t\t\ty -= 1;\n\t\t\t}\n\t\t}\n\n\t\tres = checkGameOver(x,y);\n\t\tif(res != -1) {\n\t\t\toutput(res);\n\t\t\treturn;\n\t\t}\n\n\t\texecTurnEnd(x, y, px, py);\n\n\t}\n\n\tint res = checkGameOver(x,y);\n\tif(res != -1) {\n\t\toutput(res);\n\t\treturn;\n\t}\n\toutput(4);\n}\n\nint main()\n{\n\n\twhile(cin >> H >> W, (W||H)) {\n\t\tvector<string> command;\n\t\tfor(int i=0; i<H; i++) cin >> field[i];\n\n\t\tint sx, sy;\n\t\tfor(int i=0; i<H; i++)\n\t\tfor(int j=0; j<W; j++) {\n\t\t\tif(field[i][j] == 'S') {\n\t\t\t\tsx = j;\n\t\t\t\tsy = i;\n\t\t\t\tfield[i][j] = '.';\n\t\t\t}\n\t\t\tif(field[i][j] == 'G') {\n\t\t\t\tGx = j;\n\t\t\t\tGy = i;\n\t\t\t}\n\t\t}\n\n\t\tcin >> T;\n\t\tfor(int i=0; i<T; i++) {\n\t\t\tstring a,b;\n\t\t\tcin >> a >> b;\n\t\t\tcommand.push_back(a);\n\t\t\tcommand.push_back(b);\n\t\t}\n\n\t\tdoCommand(sx, sy, command);\n\t}\n}",
"accuracy": 0.75,
"time_ms": 580,
"memory_kb": 976,
"score_of_the_acc": -0.4079,
"final_rank": 8
},
{
"submission_id": "aoj_1073_429470",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <cctype>\nusing namespace std;\n\nint dx[] = {-1, 0, 1, 0};\nint dy[] = {0, -1, 0, 1};\n\nint cx[] = {-1,0,1};\nint W,H,T;\nint Gx,Gy;\n\nstring field[55];\n\nvoid dump()\n{\n\tfor(int i=0; i<H; i++) cout << field[i] << endl;\n}\n\nbool isBlock(char c)\n{\n\treturn isalnum(c) || c == '#';\n}\n\nbool Up(int x, int y, int dir)\n{\n\tint hx = x + dx[dir], hy = y;\n\tif(hx < 0 || hx >= W) return false;\n\tif(!isBlock(field[hy][hx])) return false;\n\n\tint mx = x, my = y - 1;\n\tif(my < 0) return false;\n\tif(field[my][mx] != '.') return false;\n\n\tmx += dx[dir];\n\tif(field[my][mx] != '.') return false;\n\n\treturn true;\n}\n\nbool Down(int x, int y, int dir)\n{\n\tint hx = x + dx[dir], hy = y;\n\tif(hx < 0 || hx >= W) return false;\n\tif(field[hy][hx] != '.') return false;\n\n\tint mx = hx, my = hy + 1;\n\tif(my >= H) return false;\n\tif(field[my][mx] != '.') return false;\n\n\treturn true;\n}\n\nbool canMove(int x, int y, int mx, int dir)\n{\n\tif(field[y][mx] != '.') return false;\n\tif(y == H-1) return true;\n\n\tint tx = x;\n\twhile(1) {\n\t\tif(!isBlock(field[y+1][x])) return false;\n\t\tif(tx == mx) break;\n\t\ttx += dx[dir];\n\t}\n\n\treturn true;\n}\n\nbool cPull(int x, int y, int dir)\n{\n\tint tx = x + dx[dir], ty = y + dy[dir];\n\tint bx = x - dx[dir], by = y - dy[dir];\n\n\tif(bx < 0 || bx >= W) return false;\n\tif(!isBlock(field[by][bx])) return false;\n\tif(field[by][bx] == 'C') return false;\n\n\tif(tx < 0 || tx >= W) return false;\n\tif(field[ty][tx] != '.') return false;\n\n\tfield[y][x] = field[by][bx];\n\tfield[by][bx] = '.';\n\n\treturn true;\n}\n\nbool canPush(int x, int y, int dir)\n{\n\tint tx = x, ty = y;\n\twhile(1) {\n\t\ttx += dx[dir];\n\n\t\tif(tx<0||tx>=W) break;\n\t\tif(!isBlock(field[ty][tx])) break;\n\t\tif(field[ty][tx]=='C') return false;\n\t}\n\n\ttx -= dx[dir];\n\n\tif(x == tx) return false;\n\n\treturn true;\n}\n\nvoid moveBlock(int x, int y, int dir)\n{\n\tchar tmp = field[y][x];\n\tfield[y][x] = '.';\n\tint tx = x + dx[dir], ty = y;\n\n\twhile(1) {\n\t\tif(tx<0||tx>=W) return;\n\t\tif(isBlock(field[ty][tx])) {\n\t\t\ttx -= dx[dir];\n\t\t\tbreak;\n\t\t}\n\t\tif(tmp != 'I') {\n\t\t\tif(ty != H-1) {\n\t\t\t\tif(field[ty+1][tx] != 'I') break;\n\t\t\t}\n\t\t\telse break;\n\t\t}\n\n\t\tif(ty != H-1) {\n\t\t\tif(tx!=x && field[ty+1][tx] == '.') break;\n\t\t}\n\n\t\ttx += dx[dir];\n\t\t\n\t}\n\n\tfield[ty][tx] = tmp;\n}\n\nvoid Push(int x, int y, int dir)\n{\n\tint tx = x, ty = y;\n\twhile(1) {\n\t\ttx += dx[dir];\n\t\tif(tx < 0 || tx >= W) break;\n\n\t\tif(!isBlock(field[ty][tx])) break;\n\t}\n\n\ttx -= dx[dir];\n\n\twhile(1) {\n\t\tif(x == tx) break;\n\t\tmoveBlock(tx,ty,dir);\n\n\t\ttx -= dx[dir];\n\t}\n}\n\nbool cPush(int x, int y, int dir)\n{\n\tif(!canPush(x,y,dir)) return false;\n\n\tPush(x,y,dir);\n\n\treturn true;\n}\n\nbool countDown(int x, int y, int px, int py)\n{\n\tif(x==px && y==py) return false;\n\tif(py==H-1) return false;\n\n\tif(!isdigit(field[py+1][px])) return false;\n\n\tint cnt = field[py+1][px]-'0' - 1;\n\tif(cnt == 0) field[py+1][px] = '.';\n\telse field[py+1][px] = cnt + '0';\n\n\treturn true;\n}\n\nbool extinct()\n{\n\tfor(int i=1; i<H; i++)\n\tfor(int j=0; j<W; j++) {\n\t\tif(field[i][j] == 'B') {\n\t\t\tif(field[i-1][j] != '.') {\n\t\t\t\tfield[i-1][j] = '.';\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn false;\n}\n\nbool fallPlayer(int x, int& y)\n{\n\tint tx=x, ty=y;\n\twhile(1) {\n\t\tif(ty == H-1) break;\n\t\tif(isBlock(field[ty+1][tx])) break;\n\n\t\tty++;\n\t}\n\n\tif(ty==y) return false;\n\n\ty = ty;\n\n\treturn true;\n}\n\nbool checkFall(int x, int y)\n{\n\tif(y==H-1) return false;\n\n\tfor(int i=0; i<3; i++) {\n\t\tint nx = x + cx[i];\n\t\tint ny = y + 1;\n\t\tif(nx<0||ny<0||nx>=W||ny>=H) continue;\n\t\tif(isBlock(field[ny][nx])) return false;\n\t}\n\n\treturn true;\n}\n\nbool fallBlock(int x, int y)\n{\n\tif(y==H-1) return false;\n\tif(!isBlock(field[y][x])) return false;\n\n\tchar tmp = field[y][x];\n\tint tx = x, ty = y;\n\n\tfield[y][x] = '.';\n\n\twhile(checkFall(tx,ty)) { ty++; }\n\n\tfield[ty][tx] = tmp;\n\n\treturn x != tx || y != ty;\n}\n\nbool loopfallBlock()\n{\n\tbool res = false;\n\tfor(int i=H-1; i>=0; i--)\n\tfor(int j=0; j<W; j++)\n\t{\n\t\tres |= fallBlock(j,i);\n\t}\n\n\treturn res;\n}\n\nvoid execTurnEnd(int x, int& y, int px, int py)\n{\n\tcountDown(x,y,px,py);\n\t\n\twhile(1) {\n\t\tbool moved = false;\n\n\t\tmoved |= extinct();\n\t\tmoved |= fallPlayer(x,y);\n\t\tmoved |= loopfallBlock();\n\n\t\tif(!moved) break;\n\t}\n}\n\nint checkGameOver(int x, int y)\n{\n\tif(y!=H-1) {\n\t\tif(field[y+1][x] == 'G') return 0;\n\t\tif(field[y+1][x] == 'B') return 1;\n\t}\n\n\tif(isBlock(field[y][x])) return 2;\n\tif(field[Gy][Gx] != 'G') return 3;\n\n\treturn -1;\n\n}\n\nvoid output(int type)\n{\n\tif(type==0) cout << \"Game Over : Cleared\" << endl;\n\tif(type==1) cout << \"Game Over : Death by Hole\" << endl;\n\tif(type==2) cout << \"Game Over : Death by Block\" << endl;\n\tif(type==3) cout << \"Game Over : Death by Walking Goal\" << endl;\n\tif(type==4) cout << \"Game Over : Gave Up\" << endl;\n}\n\nint parseInt(string a)\n{\n\tint res = 0;\n\tfor(int i = 0; i < a.size(); i++) {\n\t\tres *= 10;\n\t\tres += a[i] - '0';\n\t}\n\n\treturn res;\n}\n\nvoid doCommand(int sx, int sy, vector<string>& commands)\n{\n\tint x = sx, y = sy;\n\n\tfor(int i=0; i<commands.size(); i+=2) {\n\t\tint px = x, py = y;\n\n\t\tint res = checkGameOver(x,y);\n\t\tif(res != -1) {\n\t\t\toutput(res);\n\t\t\treturn;\n\t\t}\n\n\t\tif(commands[i] == \"MOVETO\") {\n\t\t\tint s = parseInt(commands[i + 1]) - 1;\n\t\t\tint d = (s < x ? 0 : 2);\n\n\t\t\tif(canMove(x, y, s, d)) x = s;\n\t\t}\n\n\t\tif(commands[i] == \"PUSH\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tcPush(x, y, d);\n\t\t}\n\n\t\tif(commands[i] == \"PULL\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tif(cPull(x, y, d)) {\n\t\t\t\tx += dx[d];\n\t\t\t\ty += dy[d];\n\t\t\t}\n\t\t}\n\n\t\tif(commands[i] == \"GETDOWN\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tif(Down(x, y, d)) { \n\t\t\t\tx += dx[d];\n\t\t\t\ty += 1;\n\t\t\t}\n\t\t}\n\n\t\tif(commands[i] == \"CLIMB\") {\n\t\t\tint d = (commands[i + 1] == \"LEFT\" ? 0 : 2);\n\t\t\tif(Up(x, y, d)) { \n\t\t\t\tx += dx[d];\n\t\t\t\ty -= 1;\n\t\t\t}\n\t\t}\n\n\t\tres = checkGameOver(x,y);\n\t\tif(res != -1) {\n\t\t\toutput(res);\n\t\t\treturn;\n\t\t}\n\n\t\texecTurnEnd(x, y, px, py);\n\n\t}\n\n\tint res = checkGameOver(x,y);\n\tif(res != -1) {\n\t\toutput(res);\n\t\treturn;\n\t}\n\toutput(4);\n}\n\nint main()\n{\n\n\twhile(cin >> H >> W, (W||H)) {\n\t\tvector<string> command;\n\t\tfor(int i=0; i<H; i++) cin >> field[i];\n\n\t\tint sx, sy;\n\t\tfor(int i=0; i<H; i++)\n\t\tfor(int j=0; j<W; j++) {\n\t\t\tif(field[i][j] == 'S') {\n\t\t\t\tsx = j;\n\t\t\t\tsy = i;\n\t\t\t\tfield[i][j] = '.';\n\t\t\t}\n\t\t\tif(field[i][j] == 'G') {\n\t\t\t\tGx = j;\n\t\t\t\tGy = i;\n\t\t\t}\n\t\t}\n\n\t\tcin >> T;\n\t\tfor(int i=0; i<T; i++) {\n\t\t\tstring a,b;\n\t\t\tcin >> a >> b;\n\t\t\tcommand.push_back(a);\n\t\t\tcommand.push_back(b);\n\t\t}\n\n\t\tdoCommand(sx, sy, command);\n\t}\n}",
"accuracy": 0.75,
"time_ms": 580,
"memory_kb": 980,
"score_of_the_acc": -0.4096,
"final_rank": 9
}
] |
aoj_1070_cpp
|
Problem I: FIMO sequence
Your task is to simulate the sequence defined in the remaining part of the problem description.
This sequence is empty at first.
i
-th element of this sequence is expressed as
a
i
.
The first element of this sequence is
a
1
if the sequence is not empty.
The operation is given by integer from 0 to 9.
The operation is described below.
0:
This query is given with some integer
x
.
If this query is given, the integer x is inserted into the sequence.
If the sequence is empty,
a
1
=
x
.
If the sequence has
n
elements,
a
n+1
=
x
.
Same integer will not appear more than once as
x
.
1:
If this query is given, one element in the sequence is deleted.
The value in the middle of the sequence is deleted.
If the sequence has
n
elements and
n
is even,
a
n/2
will be deleted.
If
n
is odd,
a
⌈n/2⌉
will be deleted.
This query is not given when the sequence is empty.
Assume that the sequence has
a
1
=1,
a
2
=2,
a
3
=3,
a
4
=4 and
a
5
=5.
In this case,
a
3
will be deleted.
After deletion, the sequence will be
a
1
=1,
a
2
=2,
a
3
=4,
a
4
=5.
Assume that the sequence has
a
1
=1,
a
2
=2,
a
3
=3 and
a
4
=4,
In this case,
a
2
will be deleted.
After deletion, the sequence will be
a
1
=1,
a
2
=3,
a
3
=4.
2:
The first half of the sequence is defined by the index from 1 to ⌈
n
/2⌉ .
If this query is given, you should compute the minimum element of the first half of the sequence.
This query is not given when the sequence is empty.
Let me show an example.
Assume that the sequence is {6,2,3,4,5,1,8}.
In this case, the minimum element of the first half of the sequence, {6,2,3,4} is 2.
3:
The latter half of the sequence is elements that do not belong to the first half of the sequence.
If this query is given, you should compute the minimum element of the latter half of the sequence.
This query is not given when the sequence is empty.
Let me show an example.
Assume that the sequence is {6,2,3,4,5,1,8}.
In this case the answer for this query is 1 from {5,1,8}.
4:
This query is given with an integer
i
.
Assume that deletion is repeated until the sequence is empty.
Some elements in the first half of the sequence will become the answer for query 2.
You should compute the
i
-th minimum element from the answers.
This query is not given when the sequence is empty.
You can assume that
i
-th minimum element exists when this query is given.
Let me show an example.
Assume that deletion will be repeated to the sequence {6,2,3,4,5,1,8}.
{6,2,3,4,5,1,8} The minimum element in the first half of the sequence is 2.
{6,2,3,5,1,8} The minimum element in the first half of the sequence is 2.
{6,2,5,1,8} The minimum element in the first half of the sequence is 2.
{6,2,1,8} The minimum element in the first half of the sequence is 2.
{6,1,8} The minimum element in the first half of the sequence is 1.
{6,8} The minimum element in the first half of the sequence is 6.
{8} The minimum element in the first half of the sequence is 8.
{}
...(truncated)
|
[
{
"submission_id": "aoj_1070_10853989",
"code_snippet": "/*************************************************************************\nAuthor: ziki\nCreated Time: 2012-10-5 15:32:35\nFile Name: I.cpp\nDescription: \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 <string.h>\n\n\nusing namespace std;\n\ntypedef long long int64;\ntypedef unsigned long long uint64;\n#define two(X) (1<<(X))\n#define twoL(X) (((int64)(1))<<(X))\n#define contain(S,X) (((S)&two(X))!=0)\n#define containL(S,X) (((S)&twoL(X))!=0)\nconst double pi=acos(-1.0);\nconst double eps=1e-11;\nconst int inf=0x7FFFFFFF;\ntemplate<class T> inline void checkmin(T &a,T b){if(b<a) a=b;}\ntemplate<class T> inline void checkmax(T &a,T b){if(b>a) a=b;}\ntemplate<class T> inline T sqr(T x){return x*x;}\ntypedef pair<int,int> ipair;\n#define SIZE(A) ((int)A.size())\n#define LENGTH(A) ((int)A.length())\n#define MP(A,B) make_pair(A,B)\n#define PB(X) push_back(X)\n#define zero(a) memset(a, 0, sizeof(a))\n#define out(x) (cout<<#x<<\": \"<<x<<endl)\ntemplate<class T>void show(T a, int n){for(int i=0; i<n; ++i) cout<<a[i]<<' '; cout<<endl;}\ntemplate<class T>void show(T a, int r, int l){for(int i=0; i<r; ++i)show(a[i],l);cout<<endl;}\n\nconst int N = 2e5+10;\nint stk[N],sz, mid;\nset<pair<int,int> > head,back;\nset<pair<int,int> > poshead,posback;\nset<pair<int,int> >:: iterator it, it2;\ndeque<pair<int,int> > headmax, headmin, backmax, backmin;\nvoid addhead(pair<int,int> add) {\n\tif (headmax.empty() || headmax[0].first < add.first ) headmax.push_front(add);\n\tif (headmin.empty() || headmin[0].first > add.first ) headmin.push_front(add);\n}\nvoid delhead(pair<int,int> del) {\n\tif (!headmax.empty() && headmax[0] == del ) headmax.pop_front();\n\tif (!headmin.empty() && headmin[0] == del ) headmin.pop_front();\n}\nvoid addback(pair<int,int> add) {\n\twhile( !backmax.empty() && backmax[backmax.size()-1].first < add.first ) backmax.pop_back();\n\tbackmax.push_back(add);\n\twhile( !backmin.empty() && backmin[backmin.size()-1].first > add.first ) backmin.pop_back();\n\tbackmin.push_back(add);\n}\nvoid delback(pair<int,int> del) {\n\tif (!backmax.empty() && backmax[0] == del ) backmax.pop_front();\n\tif (!backmin.empty() && backmin[0] == del ) backmin.pop_front();\n}\nvoid modify() {\n\tif(back.size() > head.size()) {\n\t\tmid = (sz+1)/2;\n\t\tit2 = posback.begin();\n\t\tint idx = it2->first, val = it2->second;\n\t\tposhead.insert(*it2);\n\t\tposback.erase(it2);\n\t\tit = back.lower_bound(MP(val,idx));\n\t\thead.insert(*it);\n\n\t\taddhead(*it);\n\t\tdelback(*it);\n\t\t\n\t\tback.erase(it);\n\t}\n}\n\nvoid ins(int v) {\n\taddback(MP(v,sz));\n\tback.insert(MP(v,sz));\n\tposback.insert(MP(sz,v));\n\tsz++;\n\tmodify();\n}\n\nint del() {\n\tit2 = poshead.end();\n\tif( it2 != poshead.begin() ) it2--;\n\telse return -1;\n\tint idx = it->first, val = it->second;\n\tit = head.lower_bound(MP(val,idx));\n\tposhead.erase(it2);\n\n\tdelhead(*it);\n\thead.erase(it);\n\tmodify();\n\treturn idx;\n}\n\nvoid showset(set<pair<int,int> > & s) {\n\tfor(it = s.begin(); it!=s.end(); it++) \n\t\tcout<<\" (\"<<it->first <<' '<<it->second<<\")\";\n\tcout<<endl;\n}\n//int s[N];\nint main()\n{\n\tint q;\n\twhile (~scanf(\"%d\",&q)) {\n\t\tif(!q) break;\n\t\theadmax.clear(), headmin.clear(), backmax.clear(), backmin.clear();\n\t\tsz = 0;\n\t\thead.clear(), back.clear();\n\t\tfor (int i=0; i<q; i++ ) {\n\t\t\tint tp, v, ans;\n\t\t\tscanf(\"%d\",&tp);\n\t\t\tif(tp == 0 || tp == 4 || tp == 5 || tp == 8 || tp == 9) \n\t\t\t\tscanf(\"%d\",&v);\n\t\t\tswitch(tp){\n\t\t\t\tcase 0: \n\t\t\t\t\tins(v);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 1:\n\t\t\t\t\tit = poshead.end(); it--;\n\t\t\t\t\tans = it->second;\n\t\t\t\t \tdel();\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\tans = head.begin()->first;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 3:\n\t\t\t\t\tans = back.begin()->first;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 6:\n\t\t\t\t\tit = head.end(); it--;\n\t\t\t\t\tans = it->first;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 7:\n\t\t\t\t\tit = back.end(); it--;\n\t\t\t\t\tans = it->first;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\t/*\n\t\t\t\t\tint tot = head.size() + back.size();\n\t\t\t\t\tint cnt = 0;\n\t\t\t\t\tfor (int i=0; i<tot; i++) {\n\t\t\t\t\t\tif( tp == 4 )\n\t\t\t\t\t\t\ts[cnt++] = head.begin()->first;\n\t\t\t\t\t\telse if(tp == 5)\n\t\t\t\t\t\t\ts[cnt++] = back.begin()->first;\n\t\t\t\t\t\telse if(tp == 8) {\n\t\t\t\t\t\t\tit = head.end(); it--;\n\t\t\t\t\t\t\ts[cnt++] = it->first;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tit = back.end(); it--;\n\t\t\t\t\t\t\ts[cnt++] = it->first;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdel();\n\t\t\t\t\t}\n\t\t\t\t\tsort(s,s+cnt);\n\t\t\t\t\tcnt = unique(s,s+cnt) - s;\n\t\t\t\t\tans = s[v-1];\n\t\t\t\t\t*/\n\t\t\t\t\tif( tp == 4 )\n\t\t\t\t\t\tans = headmin[v-1].first;\n\t\t\t\t\telse if(tp == 5)\n\t\t\t\t\t\tans = backmin[v-1].first;\n\t\t\t\t\telse if(tp == 8) {\n\t\t\t\t\t\tans = headmax[v-1].first;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tans = backmax[v-1].first;\n\t\t\t\t\t}\n\t\t\t}\n\t\t\t//showset(poshead);\n\t\t\t//showset(posback);\n\t\t\tif(tp) {\n\t\t\t\tprintf(\"%d\\n\",ans);\n\t\t\t}\n\t\t}\n\t\tputs(\"end\");\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 5508,
"score_of_the_acc": -1.0323,
"final_rank": 10
},
{
"submission_id": "aoj_1070_8456465",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 998244353\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\ndeque<int> L,min_L,max_L;\ndeque<int> R,min_R,max_R;\n\n\nvoid addL(int x){\n\n\tL.push_front(x);\n\tif(min_L.size() == 0 || min_L.front() > x){\n\n\t\tmin_L.push_front(x);\n\t}\n\tif(max_L.size() == 0 || max_L.front() < x){\n\n\t\tmax_L.push_front(x);\n\t}\n}\n\nvoid addR(int x){\n\n\tR.push_back(x);\n\twhile(!min_R.empty() && min_R.back() > x){\n\n\t\tmin_R.pop_back();\n\t}\n\tmin_R.push_back(x);\n\n\twhile(!max_R.empty() && max_R.back() < x){\n\n\t\tmax_R.pop_back();\n\t}\n\tmax_R.push_back(x);\n}\n\nvoid RtoL(){\n\n\tint r = R.front();\n\tR.pop_front();\n\n\tif(min_R.front() == r){\n\n\t\tmin_R.pop_front();\n\t}\n\tif(max_R.front() == r){\n\n\t\tmax_R.pop_front();\n\t}\n\taddL(r);\n}\n\n\nvoid func(int numQ){\n\n\tL.clear();\n\tmin_L.clear();\n\tmax_L.clear();\n\n\tR.clear();\n\tmin_R.clear();\n\tmax_R.clear();\n\n\n\tint command,x;\n\n\tfor(int loop = 0; loop < numQ; loop++){\n\n\t\tscanf(\"%d\",&command);\n\n\t\tif(command == 0){\n\n\t\t\tscanf(\"%d\",&x);\n\n\t\t\tif(L.size() == 0){\n\n\t\t\t\taddL(x);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif(L.size() == R.size()){ //R.frontがLに移動する\n\n\t\t\t\tRtoL();\n\t\t\t}\n\n\t\t\taddR(x);\n\n\t\t}else if(command == 1){\n\n\t\t\tx = L.front();\n\t\t\tL.pop_front();\n\n\t\t\tprintf(\"%d\\n\",x);\n\n\t\t\tif(min_L.front() == x){\n\n\t\t\t\tmin_L.pop_front();\n\t\t\t}\n\t\t\tif(max_L.front() == x){\n\n\t\t\t\tmax_L.pop_front();\n\t\t\t}\n\n\t\t\tif(L.size() < R.size()){ //R.frontがLに移動する\n\n\t\t\t\tRtoL();\n\t\t\t}\n\n\t\t}else if(command == 2){\n\n\t\t\tprintf(\"%d\\n\",min_L.front());\n\n\t\t}else if(command == 3){\n\n\t\t\tprintf(\"%d\\n\",min_R.front());\n\n\t\t}else if(command == 4){\n\n\t\t\tscanf(\"%d\",&x);\n\t\t\tx--;\n\t\t\tprintf(\"%d\\n\",min_L[x]);\n\n\t\t}else if(command == 5){\n\n\t\t\tscanf(\"%d\",&x);\n\t\t\tx--;\n\t\t\tprintf(\"%d\\n\",min_R[x]);\n\n\t\t}else if(command == 6){\n\n\t\t\tprintf(\"%d\\n\",max_L.front());\n\n\t\t}else if(command == 7){\n\n\t\t\tprintf(\"%d\\n\",max_R.front());\n\n\t\t}else if(command == 8){\n\n\t\t\tscanf(\"%d\",&x);\n\t\t\tx--;\n\t\t\tprintf(\"%d\\n\",max_L[x]);\n\n\t\t}else{ //command == 9\n\n\t\t\tscanf(\"%d\",&x);\n\t\t\tx--;\n\t\t\tprintf(\"%d\\n\",max_R[x]);\n\t\t}\n\t}\n\tprintf(\"end\\n\");\n}\n\n\nint main(){\n\n\tint numQ;\n\twhile(true){\n\n\t\tscanf(\"%d\",&numQ);\n\t\tif(numQ == 0)break;\n\n\t\tfunc(numQ);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3364,
"score_of_the_acc": -0.643,
"final_rank": 6
},
{
"submission_id": "aoj_1070_8041188",
"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 q;\n while (cin >> q, q) {\n deque<int> pre, bac;\n deque<int> pmi, pmx, bmi, bmx;\n while (q--) {\n int t; cin >> t;\n if (t == 0) {\n int x; cin >> x;\n bac.push_front(x); // 前が後ろ\n // 末尾からの累積min\n while (bmi.size() and bmi.front() > x) bmi.pop_front();\n bmi.push_front(x);\n // 末尾からの累積max\n while (bmx.size() and bmx.front() < x) bmx.pop_front();\n bmx.push_front(x);\n }\n else if (t == 1) {\n if (pmi.size() and pmi.back() == pre.back()) pmi.pop_back();\n if (pmx.size() and pmx.back() == pre.back()) pmx.pop_back();\n cout << pre.back() << \"\\n\";\n pre.pop_back();\n }\n else if (t == 2) {\n cout << pmi.back() << \"\\n\";\n }\n else if (t == 3) {\n cout << bmi.back() << \"\\n\";\n }\n else if (t == 4) {\n int x; cin >> x;\n cout << pmi[pmi.size()-x] << \"\\n\";\n }\n else if (t == 5) {\n int x; cin >> x;\n cout << bmi[bmi.size()-x] << \"\\n\";\n }\n else if (t == 6) {\n cout << pmx.back() << \"\\n\";\n }\n else if (t == 7) {\n cout << bmx.back() << \"\\n\";\n }\n else if (t == 8) {\n int x; cin >> x;\n cout << pmx[pmx.size()-x] << \"\\n\";\n }\n else if (t == 9) {\n int x; cin >> x;\n cout << bmx[bmx.size()-x] << \"\\n\";\n }\n\n while (pre.size() < bac.size()) {\n if (bmi.size() and bmi.back() == bac.back()) bmi.pop_back();\n if (bmx.size() and bmx.back() == bac.back()) bmx.pop_back();\n pre.push_back(bac.back());\n bac.pop_back();\n // 先頭からの累積min\n if (!pmi.size() or pmi.back() > pre.back()) pmi.push_back(pre.back());\n // 先頭からの累積max\n if (!pmx.size() or pmx.back() < pre.back()) pmx.push_back(pre.back());\n }\n }\n cout << \"end\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3644,
"score_of_the_acc": -0.6777,
"final_rank": 8
},
{
"submission_id": "aoj_1070_3396287",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <utility>\n\nusing namespace std;\ntypedef long long ll;\ninline int getint(){\n char c; int res = 0;\n for(c = getchar();c < '0' || c > '9';c = getchar());\n for(;c >= '0' && c <= '9';c = getchar()) res = res * 10 + (c - '0');\n return res;\n}\ndeque <int> deq1,deq2,min1,min2,max1,max2;\nint q;\nvoid pushb2(int x){\n deq2.push_back(x);\n while(!min2.empty() && min2.back() > x) min2.pop_back();\n min2.push_back(x);\n while(!max2.empty() && max2.back() < x) max2.pop_back();\n max2.push_back(x);\n}\nint popf2(){\n int tmp = deq2.front();\n deq2.pop_front();\n if(!min2.empty() && min2.front() == tmp) min2.pop_front();\n if(!max2.empty() && max2.front() == tmp) max2.pop_front();\n return tmp;\n}\nvoid pushb1(int x){\n deq1.push_back(x);\n if(min1.empty() || min1.back() > x) min1.push_back(x);\n if(max1.empty() || max1.back() < x) max1.push_back(x);\n}\nint popb1(){\n int tmp = deq1.back();\n deq1.pop_back();\n if(!min1.empty() && min1.back() == tmp) min1.pop_back();\n if(!max1.empty() && max1.back() == tmp) max1.pop_back();\n return tmp;\n}\n\n//void print(deque <int> q){\n// for(int i = 0;i < (int)q.size();i++){\n// cout << q[i] << \" \";\n// }\n// cout << endl;\n//}\n\nint main(){\n while((q = getint()) && q){\n deq1.clear(); min1.clear(); max1.clear();\n deq2.clear(); min2.clear(); max2.clear();\n int len = 0;\n while(q--){\n int fl = getint(), x = 0;\n if(fl == 0 || fl == 4 || fl == 5 || fl == 8 || fl == 9) x = getint();\n if(fl == 0){\n pushb2(x);\n len++;\n if(len & 1){\n int tmp = popf2();\n pushb1(tmp);\n }\n }else if(fl == 1){\n int tmp = popb1();\n printf(\"%d\\n\",tmp);\n len--;\n if(len & 1){\n tmp = popf2();\n pushb1(tmp);\n }\n }else if(fl == 2){\n printf(\"%d\\n\",min1.back());\n }else if(fl == 3){\n printf(\"%d\\n\",min2.front());\n }else if(fl == 4){\n printf(\"%d\\n\",min1.at(min1.size() - x));\n }else if(fl == 5){\n printf(\"%d\\n\",min2.at(x - 1));\n }else if(fl == 6){\n printf(\"%d\\n\",max1.back());\n }else if(fl == 7){\n printf(\"%d\\n\",max2.front());\n }else if(fl == 8){\n printf(\"%d\\n\",max1.at(max1.size() - x));\n }else if(fl == 9){\n printf(\"%d\\n\",max2.at(x - 1));\n }\n }\n puts(\"end\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3416,
"score_of_the_acc": -0.6202,
"final_rank": 5
},
{
"submission_id": "aoj_1070_3178118",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n\nstruct FastIO{\n FastIO(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n}fastio_beet;\n\n//INSERT ABOVE HERE\nsigned main(){\n int q;\n while(cin>>q,q){\n using D = deque<int>;\n auto mv=\n [&](D &a,D &b,D &ax,D &ay,D &bx,D &by){\n\tif(!bx.empty()&&bx.back()==b.back()) bx.pop_back();\n\tif(!by.empty()&&by.back()==b.back()) by.pop_back();\t \n\t\n\ta.emplace_back(b.back());\n\tb.pop_back();\n\t\n\tif(ax.empty()||ax.back()>a.back()) ax.emplace_back(a.back());\n\tif(ay.empty()||ay.back()<a.back()) ay.emplace_back(a.back());\n };\n\n D a,b;\n D ax,ay,bx,by;\n \n while(q--){\n int t,x=-1;\n cin>>t;\n if(t==0||t==4||t==5||t==8||t==9) cin>>x; \n\n if(t==0){\t\n\twhile(!bx.empty()&&bx.front()>x) bx.pop_front();\n\twhile(!by.empty()&&by.front()<x) by.pop_front();\n\tb.emplace_front(x);\n\tbx.emplace_front(x);\n\tby.emplace_front(x);\n }\n \n if(t==1){\n\tif(!ax.empty()&&ax.back()==a.back()) ax.pop_back();\n\tif(!ay.empty()&&ay.back()==a.back()) ay.pop_back();\n\tcout<<a.back()<<endl;\n\ta.pop_back();\n }\n\n if(t==2) cout<<ax.back()<<endl;\n if(t==3) cout<<bx.back()<<endl;\n\n if(t==4) cout<<ax[ax.size()-x]<<endl;\n if(t==5) cout<<bx[bx.size()-x]<<endl;\n \n if(t==6) cout<<ay.back()<<endl;\n if(t==7) cout<<by.back()<<endl;\n \n if(t==8) cout<<ay[ay.size()-x]<<endl;\n if(t==9) cout<<by[by.size()-x]<<endl;\n \n while(a.size()<b.size()) mv(a,b,ax,ay,bx,by);\n while(a.size()>b.size()+1) mv(b,a,bx,by,ax,ay);\n\n }\n cout<<\"end\"<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 3360,
"score_of_the_acc": -0.852,
"final_rank": 9
},
{
"submission_id": "aoj_1070_3114999",
"code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <deque>\n#include <vector>\nusing namespace std;\n\nstruct FimoSeq\n{\n struct FirstHalf\n {\n deque< int > data;\n deque< int > MAX, MIN;\n\n void add(int x)\n {\n data.push_back(x);\n\n if (data.size() == 1)\n {\n MAX.push_back(x);\n MIN.push_back(x);\n }\n else\n {\n if (MAX.back() < x)\n MAX.push_back(x);\n if (MIN.back() > x)\n MIN.push_back(x);\n }\n }\n\n int remove()\n {\n int x = data.back();\n data.pop_back();\n\n if (MIN.back() == x)\n MIN.pop_back();\n if (MAX.back() == x)\n MAX.pop_back();\n\n return x;\n }\n\n int size() const { return data.size(); }\n } fh;\n\n struct LatterHalf\n {\n deque< int > data;\n deque< int > MAX, MIN;\n\n void add(int x)\n {\n data.push_back(x);\n\n if (data.size() == 1)\n {\n MAX.push_back(x);\n MIN.push_back(x);\n }\n else\n {\n while (!MAX.empty() && MAX.back() < x)\n MAX.pop_back();\n while (!MIN.empty() && MIN.back() > x)\n MIN.pop_back();\n\n MAX.push_back(x);\n MIN.push_back(x);\n }\n }\n\n int remove()\n {\n int x = data.front();\n data.pop_front();\n\n if (MIN.front() == x)\n MIN.pop_front();\n if (MAX.front() == x)\n MAX.pop_front();\n\n return x;\n }\n\n int size() const { return data.size(); }\n } lh;\n\n int size() { return fh.size() + lh.size(); }\n\n void add(int x)\n {\n lh.add(x);\n if (lh.size() > fh.size())\n fh.add(lh.remove());\n }\n\n int remove()\n {\n int r = fh.remove();\n if (lh.size() > fh.size())\n fh.add(lh.remove());\n\n return r;\n }\n\n int min_first_half(int i) { return *(fh.MIN.end() - i); }\n\n int min_latter_half(int i) { return *(lh.MIN.begin() + i - 1); }\n\n int max_first_half(int i) { return *(fh.MAX.end() - i); }\n\n int max_latter_half(int i) { return *(lh.MAX.begin() + i - 1); }\n};\n\nint main()\n{\n while (true)\n {\n int Q;\n scanf(\"%d\", &Q);\n if (Q == 0)\n break;\n\n FimoSeq fimo;\n\n for (int i = 0; i < Q; i++)\n {\n int q, x;\n scanf(\"%d\", &q);\n\n switch (q)\n {\n case 0:\n scanf(\"%d\", &x);\n fimo.add(x);\n break;\n case 1:\n printf(\"%d\\n\", fimo.remove());\n break;\n case 2:\n printf(\"%d\\n\", fimo.min_first_half(1));\n break;\n case 3:\n printf(\"%d\\n\", fimo.min_latter_half(1));\n break;\n case 4:\n scanf(\"%d\", &x);\n printf(\"%d\\n\", fimo.min_first_half(x));\n break;\n case 5:\n scanf(\"%d\", &x);\n printf(\"%d\\n\", fimo.min_latter_half(x));\n break;\n case 6:\n printf(\"%d\\n\", fimo.max_first_half(1));\n break;\n case 7:\n printf(\"%d\\n\", fimo.max_latter_half(1));\n break;\n case 8:\n scanf(\"%d\", &x);\n printf(\"%d\\n\", fimo.max_first_half(x));\n break;\n case 9:\n scanf(\"%d\", &x);\n printf(\"%d\\n\", fimo.max_latter_half(x));\n break;\n }\n }\n\n printf(\"end\\n\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 2908,
"score_of_the_acc": -0.5602,
"final_rank": 3
},
{
"submission_id": "aoj_1070_2736923",
"code_snippet": "#include <iostream>\n#include <list>\n#include <deque>\n\nusing namespace std;\n\nint Q;\ndeque<int> dqmin1, dqmin2;\ndeque<int> dqmax1, dqmax2;\nlist<int> all;\n\nint main(void)\n{\n\t\n\twhile(1){\n\t\tcin >> Q;\n\t\tif(Q == 0) break;\n\t\t\n\t\tint type, x;\n\t\t\n\t\tall.clear(); all.push_back(0);\n\t\tdqmin1.clear(), dqmin2.clear();\n\t\tdqmax1.clear(), dqmax2.clear();\n\t\tauto center = all.begin();\n\t\t\n\t\tfor(int q = 0; q < Q; q++){\n\t\t\tcin >> type;\n\t\t\t\n\t\t\tif(type == 0){\n\t\t\t\tcin >> x;\n\t\t\t\tall.push_back(x);\n\t\t\t\t\n\t\t\t\twhile(dqmin2.size() && dqmin2.back() > x) dqmin2.pop_back();\n\t\t\t\tdqmin2.push_back(x);\n\t\t\t\twhile(dqmax2.size() && dqmax2.back() < x) dqmax2.pop_back();\n\t\t\t\tdqmax2.push_back(x);\n\t\t\t\t\n\t\t\t\tif(all.size() % 2 == 0){\n\t\t\t\t\tcenter++;\n\t\t\t\t\tif(dqmin2.size() && dqmin2.front() == *center) dqmin2.pop_front();\n\t\t\t\t\tif(dqmin1.empty() || dqmin1.back() > *center) dqmin1.push_back(*center);\n\t\t\t\t\tif(dqmax2.size() && dqmax2.front() == *center) dqmax2.pop_front();\n\t\t\t\t\tif(dqmax1.empty() || dqmax1.back() < *center) dqmax1.push_back(*center);\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(type == 1){\n\t\t\t\tcout << *center << endl;\n\t\t\t\t\n\t\t\t\tif(dqmin1.size() && dqmin1.back() == *center) dqmin1.pop_back();\n\t\t\t\tif(dqmax1.size() && dqmax1.back() == *center) dqmax1.pop_back();\n\t\t\t\t\n\t\t\t\tauto tmp = center; tmp++;\n\t\t\t\tall.erase(center);\n\t\t\t\tcenter = tmp;\n\t\t\t\t\n\t\t\t\tif(all.size() % 2) center--;\n\t\t\t\telse{\n\t\t\t\t\tif(dqmin2.size() && dqmin2.front() == *center) dqmin2.pop_front();\n\t\t\t\t\tif(dqmin1.empty() || dqmin1.back() > *center) dqmin1.push_back(*center);\n\t\t\t\t\tif(dqmax2.size() && dqmax2.front() == *center) dqmax2.pop_front();\n\t\t\t\t\tif(dqmax1.empty() || dqmax1.back() < *center) dqmax1.push_back(*center);\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(type == 2){\n\t\t\t\tcout << dqmin1.back() << endl;\n\t\t\t}\n\t\t\t\n\t\t\tif(type == 3){\n\t\t\t\tcout << dqmin2.front() << endl;\n\t\t\t}\n\t\t\t\n\t\t\tif(type == 4){\n\t\t\t\tcin >> x;\n\t\t\t\tcout << dqmin1[dqmin1.size()-x] << endl;\n\t\t\t}\n\t\t\t\n\t\t\tif(type == 5){\n\t\t\t\tcin >> x;\n\t\t\t\tcout << dqmin2[x-1] << endl;\n\t\t\t}\n\t\t\t\n\t\t\tif(type == 6){\n\t\t\t\tcout << dqmax1.back() << endl;\n\t\t\t}\n\t\t\t\n\t\t\tif(type == 7){\n\t\t\t\tcout << dqmax2.front() << endl;\n\t\t\t}\n\t\t\t\n\t\t\tif(type == 8){\n\t\t\t\tcin >> x;\n\t\t\t\tcout << dqmax1[dqmax1.size()-x] << endl;\n\t\t\t}\n\t\t\t\n\t\t\tif(type == 9){\n\t\t\t\tcin >> x;\n\t\t\t\tcout << dqmax2[x-1] << endl;\n\t\t\t}\n\t\t}\n\t\t\n\t\tcout << \"end\" << endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 590,
"memory_kb": 3896,
"score_of_the_acc": -1.6428,
"final_rank": 12
},
{
"submission_id": "aoj_1070_2254569",
"code_snippet": "/*\n * AOJ 1070: FIMO sequence\n * ?¢???????????§???????????????????10?§??????????????°??????\\???????????°????????°???????????°??????????±?????????????????????§????°??????????????????????????????°?????????????¬????????????????????????????????????§????°??????°????±???¶????¬¬i??§??????\n * ?±???????????????????\n * ???????????´???6???????????????????????????????????°??????????°???????????°?????????????????????????????????????????????°??????????°±?????´?°??????\\?????´?°?????????????????????????\n */\n\n#include <cstdio>\n\nconst int MAXN = 200010;\n\nint la[MAXN], ls[MAXN], lb[MAXN], ra[MAXN], rs[MAXN], rb[MAXN];\nint la1, la2, ls1, ls2, lb1, lb2, ra1, ra2, rs1, rs2, rb1, rb2, m;\n\nvoid outall() {\n printf(\"----outall----\\n\");\n for (int i = la1; i < la2; ++i) {\n printf(\"%d \", la[i]);\n }\n printf(\"\\n\");\n for (int i = ls1; i < ls2; ++i) {\n printf(\"%d \", ls[i]);\n }\n printf(\"\\n\");\n for (int i = lb1; i < lb2; ++i) {\n printf(\"%d \", lb[i]);\n }\n printf(\"\\n\");\n for (int i = ra1; i < ra2; ++i) {\n printf(\"%d \", ra[i]);\n }\n printf(\"\\n\");\n for (int i = rs1; i < rs2; ++i) {\n printf(\"%d \", rs[i]);\n }\n printf(\"\\n\");\n for (int i = rb1; i < rb2; ++i) {\n printf(\"%d \", rb[i]);\n }\n printf(\"\\n\");\n printf(\"\\n\");\n}\n\nvoid left_push_back(int x) {\n la[la2++] = x;\n if (ls2 == ls1 || ls[ls2 - 1] > x) {\n ls[ls2++] = x;\n }\n if (lb2 == lb1 || lb[lb2 - 1] < x) {\n lb[lb2++] = x;\n }\n}\n\nvoid right_push_back(int x) {\n ra[ra2++] = x;\n while (rs2 > rs1 && rs[rs2 - 1] > x) {\n --rs2;\n }\n rs[rs2++] = x;\n while (rb2 > rb1 && rb[rb2 - 1] < x) {\n --rb2;\n }\n rb[rb2++] = x;\n}\n\nint right_pop_front() {\n if (ra[ra1] == rs[rs1]) ++rs1;\n if (ra[ra1] == rb[rb1]) ++rb1;\n ++ra1;\n return ra[ra1 - 1];\n}\n\nint left_pop_back() {\n if (la[la2 - 1] == ls[ls2 - 1]) --ls2;\n if (la[la2 - 1] == lb[lb2 - 1]) --lb2;\n --la2;\n return la[la2];\n}\n\nvoid f0_add() {\n int x;\n scanf(\"%d\", &x);\n if (m == 0) {\n left_push_back(x);\n } else {\n right_push_back(x);\n if (!(m & 1)) {\n int y = right_pop_front();\n left_push_back(y);\n }\n }\n ++m;\n// outall();\n}\n\nvoid f1_del() {\n int x = left_pop_back();\n printf(\"%d\\n\", x);\n if (!(m & 1)) {\n int y = right_pop_front();\n left_push_back(y);\n }\n --m;\n}\n\nvoid f2_ls() {\n int x = ls[ls2 - 1];\n printf(\"%d\\n\", x);\n}\n\nvoid f3_rs() {\n int x = rs[rs1];\n printf(\"%d\\n\", x);\n}\n\nvoid f4_ls_() {\n int i, x;\n scanf(\"%d\", &i);\n x = ls[ls2 - i];\n printf(\"%d\\n\", x);\n}\n\nvoid f5_rs_() {\n int i, x;\n scanf(\"%d\", &i);\n x = rs[rs1 + i - 1];\n printf(\"%d\\n\", x);\n}\n\nvoid f6_lb() {\n int x = lb[lb2 - 1];\n printf(\"%d\\n\", x);\n}\n\nvoid f7_rb() {\n int x = rb[rb1];\n printf(\"%d\\n\", x);\n}\n\nvoid f8_lb_() {\n int i, x;\n scanf(\"%d\", &i);\n x = lb[lb2 - i];\n printf(\"%d\\n\", x);\n}\n\nvoid f9_rb_() {\n int i, x;\n scanf(\"%d\", &i);\n x = rb[rb1 + i - 1];\n printf(\"%d\\n\", x);\n}\n\nint main() {\n// freopen(\"/Users/yogy/acm-challenge-workbook/db.in\", \"r\", stdin);\n int n;\n while (scanf(\"%d\", &n) != EOF && n) {\n m = la1 = la2 = ls1 = ls2 = lb1 = lb2 = ra1 = ra2 = rs1 = rs2 = rb1 = rb2 = 0;\n while (n--) {\n int t;\n scanf(\"%d\", &t);\n// printf(\"type = %d\\n\", t);\n switch (t) {\n case 0:\n f0_add();\n break;\n case 1:\n f1_del();\n break;\n case 2:\n f2_ls();\n break;\n case 3:\n f3_rs();\n break;\n case 4:\n f4_ls_();\n break;\n case 5:\n f5_rs_();\n break;\n case 6:\n f6_lb();\n break;\n case 7:\n f7_rb();\n break;\n case 8:\n f8_lb_();\n break;\n case 9:\n f9_rb_();\n break;\n }\n }\n printf(\"end\\n\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 2988,
"score_of_the_acc": -0.5747,
"final_rank": 4
},
{
"submission_id": "aoj_1070_1164913",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\ntemplate<typename T,template<typename>class Compare>\nstruct Queue{\n\tCompare<T> Comp;\n\tdeque<T> a1,a2,b1,b2;\n\tvoid Push(int x){\n\t\ta2.push_back(x);\n\t\twhile(b2.size() && Comp(x,b2.back())) b2.pop_back();\n\t\tb2.push_back(x);\n\t\tif(a1.size()<a2.size()){\n\t\t\tint y=a2.front();\n\t\t\ta1.push_back(y);\n\t\t\tif(b1.empty() || Comp(y,b1.back())) b1.push_back(y);\n\t\t\ta2.pop_front();\n\t\t\tif(b2.size() && b2.front()==y) b2.pop_front();\n\t\t}\n\t}\n\tint Pop(){\n\t\tint x=a1.back();\n\t\ta1.pop_back();\n\t\tif(b1.size() && x==b1.back()) b1.pop_back();\n\t\tif(a1.size()<a2.size()){\n\t\t\tint y=a2.front();\n\t\t\ta1.push_back(y);\n\t\t\tif(b1.empty() || Comp(y,b1.back())) b1.push_back(y);\n\t\t\ta2.pop_front();\n\t\t\tif(b2.size() && b2.front()==y) b2.pop_front();\n\t\t}\n\t\treturn x;\n\t}\n\tint PriorLeft(){\n\t\treturn KthLeft(0);\n\t}\n\tint PriorRight(){\n\t\treturn KthRight(0);\n\t}\n\tint KthLeft(int k){\n\t\treturn b1[b1.size()-1-k];\n\t}\n\tint KthRight(int k){\n\t\treturn b2[k];\n\t}\n};\n\nint main()\n{\n\tios_base::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tconstexpr char endl='\\n';\n\t\n\tfor(int q;cin>>q && q;){\n\t\tQueue<int,less> qmin;\n\t\tQueue<int,greater> qmax;\n\t\trep(_,q){\n\t\t\tint t; cin>>t;\n\t\t\tif(t==0){ // push\n\t\t\t\tint x; cin>>x;\n\t\t\t\tqmin.Push(x),qmax.Push(x);\n\t\t\t}\n\t\t\tif(t==1) // del\n\t\t\t\tcout<<(qmin.Pop(),qmax.Pop())<<endl;\n\t\t\tif(t==2) // minl\n\t\t\t\tcout<<qmin.PriorLeft()<<endl;\n\t\t\tif(t==3) // minr\n\t\t\t\tcout<<qmin.PriorRight()<<endl;\n\t\t\tif(t==4){ // minl kth\n\t\t\t\tint k; cin>>k;\n\t\t\t\tcout<<qmin.KthLeft(k-1)<<endl;\n\t\t\t}\n\t\t\tif(t==5){ // maxl kth\n\t\t\t\tint k; cin>>k;\n\t\t\t\tcout<<qmin.KthRight(k-1)<<endl;\n\t\t\t}\n\t\t\tif(t==6) // maxl\n\t\t\t\tcout<<qmax.PriorLeft()<<endl;\n\t\t\tif(t==7) // maxr\n\t\t\t\tcout<<qmax.PriorRight()<<endl;\n\t\t\tif(t==8){ // maxl kth\n\t\t\t\tint k; cin>>k;\n\t\t\t\tcout<<qmax.KthLeft(k-1)<<endl;\n\t\t\t}\n\t\t\tif(t==9){ // maxr kth\n\t\t\t\tint k; cin>>k;\n\t\t\t\tcout<<qmax.KthRight(k-1)<<endl;\n\t\t\t}\n\t\t}\n\t\tcout<<\"end\"<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1372,
"score_of_the_acc": -0.2975,
"final_rank": 2
},
{
"submission_id": "aoj_1070_1164901",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\ntemplate<typename T,template<typename>class Compare>\nstruct Queue{\n\tCompare<T> Comp;\n\tdeque<T> a1,a2;\n\tdeque<T> b1,b2;\n\tvoid Push(int x){\n\t\ta2.push_back(x);\n\t\twhile(b2.size() && Comp(x,b2.back())) b2.pop_back();\n\t\tb2.push_back(x);\n\t\tif(a1.size()<a2.size()){\n\t\t\tint y=a2.front();\n\t\t\ta1.push_back(y);\n\t\t\tif(b1.empty() || Comp(y,b1.back())) b1.push_back(y);\n\t\t\ta2.pop_front();\n\t\t\tif(b2.size() && b2.front()==y) b2.pop_front();\n\t\t}\n\t}\n\tint Pop(){\n\t\tint x=a1.back();\n\t\ta1.pop_back();\n\t\tif(b1.size() && x==b1.back()) b1.pop_back();\n\t\tif(a1.size()<a2.size()){\n\t\t\tint y=a2.front();\n\t\t\ta1.push_back(y);\n\t\t\tif(b1.empty() || Comp(y,b1.back())) b1.push_back(y);\n\t\t\ta2.pop_front();\n\t\t\tif(b2.size() && b2.front()==y) b2.pop_front();\n\t\t}\n\t\treturn x;\n\t}\n\tint PriorLeft(){\n\t\treturn KthLeft(0);\n\t}\n\tint PriorRight(){\n\t\treturn KthRight(0);\n\t}\n\tint KthLeft(int k){\n\t\treturn b1[b1.size()-1-k];\n\t}\n\tint KthRight(int k){\n\t\treturn b2[k];\n\t}\n};\ntemplate<typename T,template<typename>class Compare>\nostream& operator<<(ostream& os,const Queue<T,Compare>& q){\n\treturn os<<q.a1<<q.a2<<','<<q.b1<<q.b2;\n}\n\nint main()\n{\n\tfor(int q;cin>>q && q;){\n\t\tQueue<int,less> qmin;\n\t\tQueue<int,greater> qmax;\n\t\trep(_,q){\n\t\t\tint t; cin>>t;\n\t\t\tif(t==0){ // push\n\t\t\t\tint x; cin>>x;\n\t\t\t\tqmin.Push(x);\n\t\t\t\tqmax.Push(x);\n\t\t\t}\n\t\t\tif(t==1){ // del\n\t\t\t\tcout<<qmin.Pop()<<endl;\n\t\t\t\tqmax.Pop();\n\t\t\t}\n\t\t\tif(t==2){ // minl\n\t\t\t\tcout<<qmin.PriorLeft()<<endl;\n\t\t\t}\n\t\t\tif(t==3){ // minr\n\t\t\t\tcout<<qmin.PriorRight()<<endl;\n\t\t\t}\n\t\t\tif(t==4){ // minl kth\n\t\t\t\tint k; cin>>k;\n\t\t\t\tcout<<qmin.KthLeft(k-1)<<endl;\n\t\t\t}\n\t\t\tif(t==5){ // maxl kth\n\t\t\t\tint k; cin>>k;\n\t\t\t\tcout<<qmin.KthRight(k-1)<<endl;\n\t\t\t}\n\t\t\tif(t==6){ // maxl\n\t\t\t\tcout<<qmax.PriorLeft()<<endl;\n\t\t\t}\n\t\t\tif(t==7){ // maxr\n\t\t\t\tcout<<qmax.PriorRight()<<endl;\n\t\t\t}\n\t\t\tif(t==8){ // maxl kth\n\t\t\t\tint k; cin>>k;\n\t\t\t\tcout<<qmax.KthLeft(k-1)<<endl;\n\t\t\t}\n\t\t\tif(t==9){ // maxr kth\n\t\t\t\tint k; cin>>k;\n\t\t\t\tcout<<qmax.KthRight(k-1)<<endl;\n\t\t\t}\n\t\t}\n\t\tcout<<\"end\"<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 1360,
"score_of_the_acc": -0.6501,
"final_rank": 7
},
{
"submission_id": "aoj_1070_363350",
"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\nint main() {\n int n;\n while(cin>>n,n) {\n deque<int> a; // O¼ªðO©ç©½ñ\n deque<int> b; // 㼪ðãë©ç©½ñ\n deque<int> min1; // min1[i] = NG4̦\n deque<int> min2; // min2[i] = NG5̦\n deque<int> max1; // max1[i] = NG8̦\n deque<int> max2; // max2[i] = NG9̦\n int m = 0;\n REP(i, n) {\n int q, x;\n cin >> q;\n if (q == 0) {\n cin >> x;\n if (m % 2) {\n b.push_front(x);\n while(min2.size() && min2[min2.size()-1] > x) min2.pop_back();\n min2.push_back(x);\n while(max2.size() && max2[max2.size()-1] < x) max2.pop_back();\n max2.push_back(x);\n } else {\n int y;\n if (m == 0) {\n a.push_back(x);\n y = x; x = -1;\n } else {\n b.push_front(x);\n y = b[b.size()-1];\n a.push_back(y);\n b.pop_back();\n if (min2.size() && min2[0] == y)\n min2.pop_front();\n if (max2.size() && max2[0] == y)\n max2.pop_front();\n while(min2.size() && min2[min2.size()-1] > x) min2.pop_back();\n min2.push_back(x);\n while(max2.size() && max2[max2.size()-1] < x) max2.pop_back();\n max2.push_back(x);\n }\n if (min1.empty() || y < min1[0])\n min1.push_front(y);\n if (max1.empty() || y > max1[0])\n max1.push_front(y);\n }\n m++;\n } else if (q == 1) {\n x = a[a.size()-1];\n a.pop_back();\n if (min1.size() && min1[0] == x)\n min1.pop_front();\n if (max1.size() && max1[0] == x)\n max1.pop_front();\n cout << x << endl;\n if (m % 2 == 0) {\n int y = b[b.size()-1];\n a.push_back(y);\n b.pop_back();\n if (min2.size() && min2[0] == y)\n min2.pop_front();\n if (max2.size() && max2[0] == y)\n max2.pop_front();\n if (min1.empty() || y < min1[0])\n min1.push_front(y);\n if (max1.empty() || y > max1[0])\n max1.push_front(y);\n }\n m--;\n } else if (q == 2) {\n cout << min1[0] << endl;\n } else if (q == 3) {\n cout << min2[0] << endl;\n } else if (q == 4) {\n cin >> x;x--;\n cout << min1[x] << endl;\n } else if (q == 5) {\n cin >> x;x--;\n cout << min2[x] << endl;\n } else if (q == 6) {\n cout << max1[0] << endl;\n } else if (q == 7) {\n cout << max2[0] << endl;\n } else if (q == 8) {\n cin >> x;x--;\n cout << max1[x] << endl;\n } else {\n cin >> x;x--;\n cout << max2[x] << endl;\n }\n\n // cout << \"a = \"; FOR(it, a) cout << *it << \" \"; cout << endl;\n // cout << \"b = \"; FOR(it, b) cout << *it << \" \";cout << endl;\n // // cout << \"min1 = \"; FOR(it, min1) cout << *it << \" \";cout << endl;\n // // cout << \"min2 = \"; FOR(it, min2) cout << *it << \" \";cout << endl;\n // // cout << \"max1 = \"; FOR(it, max1) cout << *it << \" \";cout << endl;\n // cout << \"max2 = \"; FOR(it, max2) cout << *it << \" \";cout << endl;\n \n }\n cout << \"end\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 630,
"memory_kb": 1080,
"score_of_the_acc": -1.1961,
"final_rank": 11
},
{
"submission_id": "aoj_1070_269287",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <deque>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\ndeque<int> deq[2];\ndeque<int> minDeq[2][2];\nint q;\n\nvoid Erase(int lr) {\n assert(!minDeq[0][lr].empty());\n assert(!minDeq[1][lr].empty());\n if (minDeq[0][lr].front() == deq[lr][0]) {\n minDeq[0][lr].pop_front();\n }\n if (minDeq[1][lr].front() == -deq[lr][0]) {\n minDeq[1][lr].pop_front();\n }\n deq[lr].pop_front();\n}\n\nvoid Insert(int lr, int tb, int v) {\n if (tb == 1) {\n assert(lr == 1);\n while (!minDeq[0][lr].empty() && v < minDeq[0][lr].back()) {\n minDeq[0][lr].pop_back();\n }\n while (!minDeq[1][lr].empty() && -v < minDeq[1][lr].back()) {\n minDeq[1][lr].pop_back();\n }\n minDeq[0][lr].push_back(v);\n minDeq[1][lr].push_back(-v);\n deq[lr].push_back(v);\n } else {\n if (minDeq[0][lr].empty() || v < minDeq[0][lr].front()) {\n minDeq[0][lr].push_front(v);\n }\n if (minDeq[1][lr].empty() || -v < minDeq[1][lr].front()) {\n minDeq[1][lr].push_front(-v);\n }\n deq[lr].push_front(v);\n }\n}\n\nint main() {\n while (scanf(\"%d\", &q), q) {\n REP(i, 2) {\n deq[i].clear();\n REP(j, 2){\n minDeq[i][j].clear();\n }\n }\n REP(iter, q) {\n int type;\n int v = 0xdeadbeaf;\n scanf(\"%d\", &type);\n if (type == 0 || type == 4 || type == 5 || type == 8 || type == 9) {\n scanf(\"%d\", &v);\n if (type != 0) { v--; }\n }\n switch (type) {\ncase 0:\n Insert(1, 1, v);\n break;\ncase 1:\n printf(\"%d\\n\", deq[0][0]);\n Erase(0);\n break;\ncase 2:\n printf(\"%d\\n\", minDeq[0][0][0]);\n break;\ncase 3:\n printf(\"%d\\n\", minDeq[0][1][0]);\n break;\ncase 4:\n printf(\"%d\\n\", minDeq[0][0][v]);\n break;\ncase 5:\n printf(\"%d\\n\", minDeq[0][1][v]);\n break;\ncase 6:\n printf(\"%d\\n\", -minDeq[1][0][0]);\n break;\ncase 7:\n printf(\"%d\\n\", -minDeq[1][1][0]);\n break;\ncase 8:\n printf(\"%d\\n\", -minDeq[1][0][v]);\n break;\ncase 9:\n printf(\"%d\\n\", -minDeq[1][1][v]);\n break;\ndefault:\n assert(false);\n break;\n }\n if (deq[0].size() < deq[1].size()) {\n Insert(0, 0, deq[1][0]);\n Erase(1);\n }\n }\n puts(\"end\");\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 0,
"score_of_the_acc": -0.1129,
"final_rank": 1
}
] |
aoj_1068_cpp
|
Problem G: School of Killifish
Jon is the leader of killifish.
Jon have a problem in these days.
Jon has a plan to built new town in a pond.
Of course new towns should have a school for children. But there are some natural enemies in a pond.
Jon thinks that the place of a school should be the safest place in a pond for children.
Jon has asked by some construction companies to make construction plans and Jon has
q
construction plans now.
The plan is selected by voting. But for each plan, the safest place for the school should be decided before voting.
A pond is expressed by a 2D grid whose size is
r*c
.
The grid has
r
rows and
c
columns. The coordinate of the top-left cell is (0,0). The coordinate of the bottom-right cell is expressed as (
r
-1,
c
-1).
Each cell has an integer which implies a dangerousness.
The lower value implies safer than the higher value.
q
plans are given by four integer
r1
,
c1
,
r2
and
c2
which represent the subgrid.
The top-left corner is (
r1
,
c1
) and the bottom-right corner is (
r2
,
c2
).
You have the
r*c
grid and
q
plans. Your task is to find the safest point for each plan.
You should find the lowest value in the subgrid.
Input
Input consists of multiple datasets.
Each dataset is given in the following format.
r
c
q
grid
0,0
grid
0,1
...
grid
0,c-1
...
grid
r-1,0
...
grid
r-1,c-1
r1
c1
r2
c2
...
r1
c1
r2
c2
The first line consists of 3 integers,
r
,
c
, and
q
.
Next
r
lines have
c
integers.
grid
i,j
means a dangerousness of the grid.
And you can assume 0 ≤
grid
i,j
≤ 2
31
-1.
After that,
q
queries,
r1
,
c1
,
r2
and
c2
, are given.
The dataset satisfies following constraints.
r*c
≤ 10
6
q
≤ 10
4
For each query, you can assume that
r1
≤
r2
and
c1
≤
c2
.
If
r * c
≤ 250000,
q
≤ 100 is assured.
If
r * c
> 250000, Input consists of only that case.
Output
For each query you should print the lowest value in the subgrid in a line.
Sample input
3 3 4
1 2 3
4 2 2
2 1 1
0 0 2 2
0 0 1 1
1 0 1 0
0 1 1 2
1 10 4
1 2 3 4 5 6 7 8 9 10
0 0 0 9
0 0 0 4
0 5 0 9
0 4 0 5
0 0 0
Sample output
1
1
4
2
1
1
6
5
|
[
{
"submission_id": "aoj_1068_10848919",
"code_snippet": "/*\n * Author: 8mao\n * Created Time: 2014/3/16 20:09:19\n * File Name: 2009.cpp\n */\n# include<map>\n# include<set>\n# include<cmath>\n# include<queue>\n# include<stack>\n# include<vector>\n# include<string>\n# include<cstdio>\n# include<climits>\n# include<cstring>\n# include<iostream>\n# include<algorithm>\n# include<functional>\nusing namespace std;\n\ntypedef pair<int,int> PII;\n# define INF 1<<30\n# define LL long long\n# define MOD 1000000007\n# define VI vector<int>\n# define VLL vector<LL>\n# define VS vector<string>\n# define PII pair<int,int>\n\n# define F first\n# define S second\n# define mp make_pair\n# define pb push_back\n# define lb lower_bound\n# define up upper_bound\n# define lowbit(x)(x&-x)\n# define lson l,m,rt<<1\n# define rson m+1,r,rt<<1|1\n# define clr(x) (x).clear()\n# define sz(x) ((int)(x).size())\n# define all(x) (x).begin(),(x).end()\n# define mem(x,y) memset(x,y,sizeof(x))\n# define forall(it,c) for(typeof((c).begin())it=(c).begin();it!=(c).end();it++)\n\n\nstruct SegTree\n{\n VI Min, a;\n int n;\n \n \n void init(vector<int> v)\n {\n n = sz(v);\n a = v;\n Min.resize(n << 2);\n Build(0, n - 1, 1);\n }\n \n void PushUp(int rt)\n {\n Min[rt] = min (Min[rt << 1], Min[rt << 1 | 1]);\n }\n\n void Build(int l, int r, int rt)\n {\n int m;\n if (l == r)\n {\n Min[rt] = a[l];\n return ; \n }\n m = (l + r) >> 1;\n Build(lson);\n Build(rson);\n PushUp(rt);\n }\n\n int Query(int L, int R, int l, int r, int rt)\n {\n int m, ans = INT_MAX;\n if (L <= l && R >= r)\n return Min[rt];\n m = (l + r) >> 1;\n if (L <= m) ans = min (ans, Query(L, R, lson));\n if (R > m) ans = min (ans, Query(L, R, rson));\n return ans; \n } \n \n int getMin(int l, int r)\n {\n return Query(l, r, 0, n - 1, 1); \n }\n};\n\n\nint main()\n{\n //freopen(\"in.txt\",\"r\",stdin);\n int i, j, n, m, q, l, r, ans, x1, y1, x2, y2, limit;\n vector<SegTree> seg;\n while (scanf (\"%d %d %d\", &n, &m, &q) != EOF && (n + m + q))\n {\n vector<VI> v(min (n, m), VI (max (n, m)));\n seg.resize(min (n, m));\n for (i = 0; i < n; i++)\n for (j = 0; j < m; j++)\n {\n if (n <= m) scanf (\"%d\", &v[i][j]);\n else scanf (\"%d\", &v[j][i]);\n }\n limit = min (n, m);\n for (i = 0; i < limit; i++)\n seg[i].init(v[i]);\n while (q--)\n {\n ans = INT_MAX;\n scanf (\"%d %d %d %d\", &x1, &y1, &x2, &y2);\n if (n <= m)\n {\n for (i = x1; i <= x2; i++)\n ans = min (ans, seg[i].getMin(y1, y2));\n }\n else\n {\n for (i = y1; i <= y2; i++)\n ans = min (ans, seg[i].getMin(x1, x2));\n }\n printf (\"%d\\n\", ans);\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 610,
"memory_kb": 30536,
"score_of_the_acc": -0.4078,
"final_rank": 2
},
{
"submission_id": "aoj_1068_10755284",
"code_snippet": "#include <iostream>\n#include <iomanip>//小数点出力用\n//cout << fixed << setprecision(10) << ans;\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <unordered_map>\nusing ll = long long;\nusing namespace std;\n#define modPHash (ll)((1LL<<61)-1)\n#define modP (ll)998244353\nbool chkrng0idx(int pos, int sup) { return (0 <= pos && pos < sup); }\nint clk4(int num) { return (num - 2) * (num % 2); }\nvoid yn(bool tf) { cout << (tf ? \"Yes\\n\" : \"No\\n\"); }\n#include <iostream>\n#include <iomanip>//小数点出力用\n//cout << fixed << setprecision(10) << ans;\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\nusing ll = long long;\nusing namespace std;\n#define modP 998244353\nint segLenH, segLenW;\nvector<vector<ll>>segT;\n\nvoid init(int hei, int wei) {\n segLenH = 1;\n hei--;\n while (hei >= 1) {\n segLenH <<= 1;\n hei >>= 1;\n }\n segLenW = 1;\n wei--;\n while (wei >= 1) {\n segLenW <<= 1;\n wei >>= 1;\n }\n vector<ll>initW(segLenW * 2, (ll)1e15);\n segT = vector<vector<ll>>(segLenH * 2, initW);\n}\n\nint c2(int X) {\n int res = 0;\n int t = X;\n if (t == 0)t = max(segLenH, segLenW);\n while (1) {\n if (t % 2 == 0) {\n t /= 2;\n res++;\n }\n else {\n break;\n }\n }\n return res;\n}\n\nvoid update(int X, int Y, ll obj) {\n segT[X + segLenH][Y + segLenW] = obj;\n int i = X + segLenH;\n while (i >= 1) {\n if (i != X + segLenH) {\n segT[i][Y + segLenW] = min(segT[i << 1][Y + segLenW], segT[(i << 1) + 1][Y + segLenW]);\n }\n int j = ((Y + segLenW) >> 1);\n while (j >= 1) {\n segT[i][j] = min(segT[i][j << 1], segT[i][(j << 1) + 1]);\n j >>= 1;\n }\n i >>= 1;\n }\n}\n\nll getM(int XL, int XR, int YL, int YR) {\n int tL = XL;\n vector<int>interX;\n while (tL != XR) {\n int b = c2(tL);\n for (;b >= 0;b--) {\n if (tL + (1 << b) <= XR) {\n int segIdx = (tL + segLenH) >> b;\n interX.push_back(segIdx);\n //res = max(res, segT[segIdx]);\n tL += (1 << b);\n break;\n }\n }\n }\n tL = YL;\n vector<int>interY;\n while (tL != YR) {\n int b = c2(tL);\n for (;b >= 0;b--) {\n if (tL + (1 << b) <= YR) {\n int segIdx = (tL + segLenW) >> b;\n interY.push_back(segIdx);\n //res = max(res, segT[segIdx]);\n tL += (1 << b);\n break;\n }\n }\n }\n ll res = 1e15;\n for (int i = 0;i < interX.size();i++) {\n for (int j = 0;j < interY.size();j++) {\n res = min(res, segT[interX[i]][interY[j]]);\n }\n }\n return res;\n}\n\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while (1) {\n int H, W, Q;\n cin >> H >> W >> Q;\n if (!H)break;\n init(H, W);\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n int a;\n cin >> a;\n update(i, j, a);\n }\n }\n while (Q--) {\n int xm, ym, XM, YM;\n cin >> xm >> ym >> XM >> YM;\n cout << getM(xm, XM + 1, ym, YM + 1) << \"\\n\";\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 117564,
"score_of_the_acc": -0.9526,
"final_rank": 14
},
{
"submission_id": "aoj_1068_10688945",
"code_snippet": "#include<stdio.h>\n#define la (tr[rt].a)\n#define lb (tr[rt].b)\n#define lc (tr[rt].c)\n#define ld (tr[rt].d)\n#define MIN(A,B) ((A)>(B)?(B):(A))\nusing namespace std;\nstruct seg{\n int x1,y1,x2,y2;\n int v;\n int a,b,c,d;\n int midx(){\n return (x1+x2)>>1;\n }\n int midy(){\n return (y1+y2)>>1;\n }\n}tr[20000010];\nint matrix[10000010];\nint tot;\nint r,c,q;\nvoid build(int rt,int x1,int y1,int x2,int y2)\n{\n //printf(\"%d %d %d %d %d\\n\",rt,x1,y1,x2,y2);\n tr[rt].x1 = x1;\n tr[rt].y1 = y1;\n tr[rt].x2 = x2;\n tr[rt].y2 = y2;\n if(x1>=x2&&y1>=y2){\n tr[rt].v = matrix[x1*c+y1];\n return;\n }\n int mx = tr[rt].midx();\n int my = tr[rt].midy();\n if(x1 == x2){\n tr[rt].a = ++tot;\n tr[rt].b = ++tot;\n build(la,x1,y1,mx,my);\n build(lb,x1,my+1,mx,y2);\n tr[rt].v = MIN(tr[la].v,tr[lb].v);\n return;\n }\n else if(y1 == y2){\n tr[rt].a = ++tot;\n tr[rt].c = ++tot;\n build(la,x1,y1,mx,my);\n build(lc,mx+1,y1,x2,my);\n tr[rt].v = MIN(tr[la].v,tr[lc].v);\n return;\n }\n else{\n tr[rt].a = ++tot;\n tr[rt].b = ++tot;\n tr[rt].c = ++tot;\n tr[rt].d = ++tot;\n build(la,x1,y1,mx,my);\n build(lb,x1,my+1,mx,y2);\n build(lc,mx+1,y1,x2,my);\n build(ld,mx+1,my+1,x2,y2);\n tr[rt].v = MIN(tr[la].v,tr[lb].v);\n tr[rt].v = MIN(tr[rt].v,tr[lc].v);\n tr[rt].v = MIN(tr[rt].v,tr[ld].v);\n return;\n }\n}\nint query(int rt,int x1,int y1,int x2,int y2)\n{\n if(x1==tr[rt].x1&&x2==tr[rt].x2&&y2==tr[rt].y2&&y1==tr[rt].y1){\n return tr[rt].v;\n }\n int mx = tr[rt].midx();\n int my = tr[rt].midy();\n //1\n if(x2<=mx&&y2<=my)\n return query(la,x1,y1,x2,y2);\n if(y1>my&&x2<=mx)\n return query(lb,x1,y1,x2,y2);\n if(x1>mx&&y2<=my)\n return query(lc,x1,y1,x2,y2);\n if(mx<x1&&my<y1)\n return query(ld,x1,y1,x2,y2);\n //2\n if(x2<=mx){\n int a = query(la,x1,y1,x2,my);\n int b = query(lb,x1,my+1,x2,y2);\n return MIN(a,b);\n }\n if(y2<=my){\n int a = query(la,x1,y1,mx,y2);\n int b = query(lc,mx+1,y1,x2,y2);\n return MIN(a,b);\n }\n if(x1>mx){\n int a = query(lc,x1,y1,x2,my);\n int b = query(ld,x1,my+1,x2,y2);\n return MIN(a,b);\n }\n if(y1>my){\n int a = query(lb,x1,y1,mx,y2);\n int b = query(ld,mx+1,y1,x2,y2);\n return MIN(a,b);\n }\n //3\n int a = query(la,x1,y1,mx,my);\n int b = query(lb,x1,my+1,mx,y2);\n int c = query(lc,mx+1,y1,x2,my);\n int d = query(ld,mx+1,my+1,x2,y2);\n int e = MIN(a,b);\n e = MIN(e,c);\n e = MIN(e,d);\n return e;\n}\nint main()\n{\n //freopen(\"d:\\\\in.txt\",\"r\",stdin);\n while(scanf(\"%d%d%d\",&r,&c,&q),r||c||q){\n tot = 0;\n for(int i = 0; i < r; ++i){\n for(int j = 0; j < c; ++j){\n scanf(\"%d\",matrix+i*c+j);\n }\n }\n build(0,0,0,r-1,c-1);\n for(int i = 0; i < q; ++i){\n int a,b,c,d;\n scanf(\"%d%d%d%d\",&a,&b,&c,&d);\n printf(\"%d\\n\",query(0,a,b,c,d));\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 340,
"memory_kb": 78720,
"score_of_the_acc": -0.6865,
"final_rank": 8
},
{
"submission_id": "aoj_1068_10688921",
"code_snippet": "#include<stdio.h>\n#include<string.h>\n#include<limits.h>\n#include<vector>\nusing namespace std;\n\n\nconst int maxn = 1000000*3;\n\nvector<int> A[ 1000009 ];\nint n;\nstruct node\n{\n int x1,x2,y1,y2;\n int min;\n int ch[4];\n};\nnode tree[maxn];\n \nint tol;\n \nvoid maketree(int x1,int x2,int y1,int y2)\n{\n int k = ++tol;\n tree[k].x1 = x1;\n tree[k].x2 = x2;\n tree[k].y1 = y1;\n tree[k].y2 = y2;\n tree[k].min = 0;\n if(x1 == x2 && y1==y2)\n {\n tree[k].min = A[x1][y1];\n memset(tree[k].ch,0,sizeof(tree[k].ch));\n return ;\n }\n \n int midx = (x1+x2)>>1;\n int midy = (y1+y2)>>1;\n \n tree[k].ch[0] = tol+1;\n maketree(x1,midx,y1,midy); \n \n if(midx+1 <= x2 && midy+1 <= y2) \n {\n tree[k].ch[1] = tol+1;\n maketree(midx+1,x2,midy+1,y2);\n }\n else\n tree[k].ch[1] = 0;\n \n if(midy+1 <= y2) \n {\n tree[k].ch[2] = tol+1;\n maketree(x1,midx,midy+1,y2);\n }\n else\n tree[k].ch[2] = 0;\n \n \n if(midx+1 <= x2)\n {\n tree[k].ch[3] = tol+1;\n maketree(midx+1,x2,y1,midy);\n }\n else\n tree[k].ch[3] = 0;\n \n tree[k].min = tree[tree[k].ch[0]].min;\n for(int i=1; i<4; i++) \n if(tree[k].ch[i])\n tree[k].min = min(tree[k].min,tree[tree[k].ch[i]].min);\n}\n \ninline bool cross(int x1,int x2,int y1,int y2,int k)\n{\n if(x2 < tree[k].x1 || tree[k].x2 < x1 || y2 < tree[k].y1 || tree[k].y2 < y1)\n return false;\n return true;\n}\n \nint Query(int x1,int x2,int y1,int y2,int k) \n{\n if(cross(x1,x2,y1,y2,k) == 0) \n return INT_MAX;\n \n if(x1 <= tree[k].x1 && tree[k].x2 <= x2 && y1<= tree[k].y1 && tree[k].y2 <= y2) \n return tree[k].min;\n int minx = Query(x1,x2,y1,y2,tree[k].ch[0]);\n \n for(int i=1; i<4; i++)\n minx = min(minx,Query(x1,x2,y1,y2,tree[k].ch[i]));\n return minx;\n}\n\nint main()\n{\n int r,c,q,temp;\n int x1,y1,x2,y2;\n while(( scanf( \"%d%d%d\",&r,&c,&q ),r ))\n {\n for( int i=1;i<=r;i++ ){\n if( A[ i ].size( )<=1 )\n A[ i ].push_back( 0 );\n for( int j=1;j<=c;j++ ){\n scanf( \"%d\",&temp );\n if( j>=A[ i ].size( ) ){\n A[ i ].push_back( temp );\n }\n else{\n A[ i ][ j ]=temp;\n }\n }\n }\n tol=0;\n maketree(1,r,1,c); \n while(q--)\n {\n scanf(\"%d%d%d%d\",&x1,&y1,&x2,&y2);\n x1++,y1++,x2++,y2++;\n printf(\"%d\\n\",Query(x1,x2,y1,y2,1));\n }\n }\n}",
"accuracy": 1,
"time_ms": 460,
"memory_kb": 130312,
"score_of_the_acc": -1.1423,
"final_rank": 17
},
{
"submission_id": "aoj_1068_10688885",
"code_snippet": "#include <iostream>\n#include <map>\n#include <algorithm>\n#include <stdio.h>\n\n\nusing namespace std;\n\nconst int maxn = 5000700;\n\nstruct Node\n{\n //int lx,ly,rx,ry;\n int lc,rc;\n int mini;\n} tree[maxn];\n\nint last,R,C,Q;\nint a[1000007];\n\nvoid build(int lx,int ly,int rx,int ry,int &now)\n{\n now = last++;\n if (ry-ly > rx-lx)\n {\n int mid = (ry+ly) >> 1;\n build(lx,ly,rx,mid,tree[now].lc);\n build(lx,mid+1,rx,ry,tree[now].rc);\n tree[now].mini = min(tree[tree[now].lc].mini,tree[tree[now].rc].mini);\n }\n else\n {\n if (rx > lx)\n {\n int mid = (rx+lx) >> 1;\n build(lx,ly,mid,ry,tree[now].lc);\n build(mid+1,ly,rx,ry,tree[now].rc);\n tree[now].mini = min(tree[tree[now].lc].mini,tree[tree[now].rc].mini);\n }\n else\n {\n tree[now].mini = a[lx*C+ly];\n }\n }\n}\n\nvoid quary(int Lx,int Ly,int Rx,int Ry,int lx,int ly,int rx,int ry,int now,int &mini)\n{\n if (Lx <= lx && Ly <= ly && Rx >= rx && Ry >= ry)\n {\n mini = min(mini,tree[now].mini);\n return;\n }\n if (ry-ly > rx-lx)\n {\n int mid = (ry+ly) >> 1;\n if (Ly <= mid) quary(Lx,Ly,Rx,Ry,lx,ly,rx,mid,tree[now].lc,mini);\n if (Ry > mid) quary(Lx,Ly,Rx,Ry,lx,mid+1,rx,ry,tree[now].rc,mini);\n }\n else\n {\n if (rx > lx)\n {\n int mid = (rx+lx) >> 1;\n if (Lx <= mid) quary(Lx,Ly,Rx,Ry,lx,ly,mid,ry,tree[now].lc,mini);\n if (Rx > mid) quary(Lx,Ly,Rx,Ry,mid+1,ly,rx,ry,tree[now].rc,mini);\n }\n }\n\n}\n\nint main()\n{\n while (1)\n {\n cin >> R;\n if (0 == R) break;\n cin >> C >> Q;\n for (int i = 0;i < R*C;++i) scanf(\"%d\",&a[i]);\n int root;\n last = 0;\n build(0,0,R-1,C-1,root);\n while (Q--)\n {\n int r1,c1,r2,c2;\n scanf(\"%d%d%d%d\",&r1,&c1,&r2,&c2);\n int mini = 0x7fffffff;\n quary(r1,c1,r2,c2,0,0,R-1,C-1,root,mini);\n printf(\"%d\\n\",mini);\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2690,
"memory_kb": 32196,
"score_of_the_acc": -1.221,
"final_rank": 19
},
{
"submission_id": "aoj_1068_10688878",
"code_snippet": "#include <iostream>\n#include <map>\n#include <algorithm>\n#include <stdio.h>\n\n\nusing namespace std;\n\nconst int maxn = 4000700;\n\nstruct Node\n{\n //int lx,ly,rx,ry;\n int lc,rc;\n int mini;\n} tree[maxn];\n\nint last,R,C,Q;\nint a[1000007];\n\nvoid build(int lx,int ly,int rx,int ry,int &now)\n{\n now = last++;\n if (ry-ly > rx-lx)\n {\n int mid = (ry+ly) >> 1;\n build(lx,ly,rx,mid,tree[now].lc);\n build(lx,mid+1,rx,ry,tree[now].rc);\n tree[now].mini = min(tree[tree[now].lc].mini,tree[tree[now].rc].mini);\n }\n else\n {\n if (rx > lx)\n {\n int mid = (rx+lx) >> 1;\n build(lx,ly,mid,ry,tree[now].lc);\n build(mid+1,ly,rx,ry,tree[now].rc);\n tree[now].mini = min(tree[tree[now].lc].mini,tree[tree[now].rc].mini);\n }\n else\n {\n tree[now].mini = a[lx*C+ly];\n }\n }\n}\n\nvoid quary(int Lx,int Ly,int Rx,int Ry,int lx,int ly,int rx,int ry,int now,int &mini)\n{\n if (Lx <= lx && Ly <= ly && Rx >= rx && Ry >= ry)\n {\n mini = min(mini,tree[now].mini);\n return;\n }\n if (ry-ly > rx-lx)\n {\n int mid = (ry+ly) >> 1;\n if (Ly <= mid) quary(Lx,Ly,Rx,Ry,lx,ly,rx,mid,tree[now].lc,mini);\n if (Ry > mid) quary(Lx,Ly,Rx,Ry,lx,mid+1,rx,ry,tree[now].rc,mini);\n }\n else\n {\n if (rx > lx)\n {\n int mid = (rx+lx) >> 1;\n if (Lx <= mid) quary(Lx,Ly,Rx,Ry,lx,ly,mid,ry,tree[now].lc,mini);\n if (Rx > mid) quary(Lx,Ly,Rx,Ry,mid+1,ly,rx,ry,tree[now].rc,mini);\n }\n }\n\n}\n\nint main()\n{\n while (cin >> R >> C >> Q)\n {\n if (!R && !C && !Q) break;\n for (int i = 0;i < R*C;++i) scanf(\"%d\",&a[i]);\n int root;\n last = 0;\n build(0,0,R-1,C-1,root);\n while (Q--)\n {\n int r1,c1,r2,c2;\n scanf(\"%d%d%d%d\",&r1,&c1,&r2,&c2);\n int mini = 0x7fffffff;\n quary(r1,c1,r2,c2,0,0,R-1,C-1,root,mini);\n printf(\"%d\\n\",mini);\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2640,
"memory_kb": 32188,
"score_of_the_acc": -1.2017,
"final_rank": 18
},
{
"submission_id": "aoj_1068_10239751",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n// 二次元セグメント木\ntemplate <class S, auto op, auto e>\nstruct segtree2d\n{\n static_assert(std::is_convertible_v<decltype(op), std::function<S(S, S)>>,\n \"op must work as S(S, S)\");\n static_assert(std::is_convertible_v<decltype(e), std::function<S()>>,\n \"e must work as S()\");\n\npublic:\n segtree2d() : segtree2d(0) {}\n explicit segtree2d(int h, int w)\n {\n init(h, w);\n }\n\n explicit segtree2d(const std::vector<std::vector<S>> &v)\n {\n init(v.size(), v[0].size());\n\n for (int i = 0; i < _h; i++)\n {\n for (int j = 0; j < _w; j++)\n {\n values[id(size_h + i, size_w + j)] = v[id(i, j)];\n }\n }\n\n for (int w = size_w; w < size_w * 2; w++)\n {\n for (int h = size_h - 1; h >= 1; h--)\n {\n update_h(h, w);\n }\n }\n\n for (int h = 0; h < size_h * 2; h++)\n {\n for (int w = size_w - 1; w >= 1; w--)\n {\n update_w(h, w);\n }\n }\n }\n\n void set(int p_h, int p_w, S x)\n {\n assert(0 <= p_h && p_h < _h);\n assert(0 <= p_w && p_w < _w);\n\n p_h += size_h;\n p_w += size_w;\n\n values[id(p_h, p_w)] = x;\n\n for (int i = p_h >> 1; i; i >>= 1)\n {\n update_h(i, p_w);\n }\n\n for (; p_h; p_h >>= 1)\n {\n for (int j = p_w >> 1; j; j >>= 1)\n {\n update_w(p_h, j);\n }\n }\n }\n\n S get(int p_h, int p_w) const\n {\n assert(0 <= p_h && p_h < _h);\n assert(0 <= p_w && p_w < _w);\n\n return values[id(p_h + size_h, p_w + size_w)];\n }\n\n S prod(int t, int l, int d, int r) const\n {\n assert(0 <= t && t <= d && t <= _h);\n assert(0 <= l && l <= r && r <= _w);\n\n S smt = e(), smd = e();\n t += size_h;\n d += size_h;\n l += size_w;\n r += size_w;\n\n for (; t < d; t >>= 1, d >>= 1)\n {\n if (t & 1)\n smt = op(smt, inner_prod(t++, l, r));\n if (d & 1)\n smd = op(inner_prod(--d, l, r), smd);\n }\n\n return op(smt, smd);\n }\n\nprivate:\n int _n, size_h, size_w;\n int _h, _w;\n std::vector<S> values;\n\n void init(int h, int w)\n {\n _h = h;\n _w = w;\n size_h = (int)std::bit_ceil((unsigned int)(_h));\n size_w = (int)std::bit_ceil((unsigned int)(_w));\n\n values = std::vector<S>(size_h * size_w * 4, e());\n }\n\n int id(int h, int w) const\n {\n return h * 2 * size_w + w;\n }\n\n void update_h(int h, int w)\n {\n values[id(h, w)] = op(values[id(2 * h, w)], values[id(2 * h + 1, w)]);\n }\n\n void update_w(int h, int w)\n {\n values[id(h, w)] = op(values[id(h, 2 * w)], values[id(h, 2 * w + 1)]);\n }\n\n S inner_prod(int h, int l, int r) const\n {\n S sml = e(), smr = e();\n\n for (; l < r; l >>= 1, r >>= 1)\n {\n if (l & 1)\n sml = op(sml, values[id(h, l++)]);\n if (r & 1)\n smr = op(values[id(h, --r)], smr);\n }\n\n return op(sml, smr);\n }\n};\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nlong long op(long long a, long long b)\n{\n return min(a, b);\n}\n\nlong long e()\n{\n return INT32_MAX;\n}\n\nvoid solve(int r, int c, int q)\n{\n segtree2d<long long, op, e> seg(r, c);\n for (int h = 0; h < r; h++)\n {\n for (int w = 0; w < c; w++)\n {\n long long grid;\n cin >> grid;\n seg.set(h, w, grid);\n }\n }\n\n for (int Q = 0; Q < q; Q++)\n {\n int r1, c1, r2, c2;\n cin >> r1 >> c1 >> r2 >> c2;\n\n int ans = seg.prod(r1, c1, r2 + 1, c2 + 1);\n cout << ans << endl;\n }\n}\n\nint main()\n{\n\n while (true)\n {\n int r, c, q;\n cin >> r >> c >> q;\n if (r == 0 && c == 0 && q == 0)\n {\n break;\n }\n\n solve(r, c, q);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 330,
"memory_kb": 68944,
"score_of_the_acc": -0.6051,
"final_rank": 7
},
{
"submission_id": "aoj_1068_9524956",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 2e+18;\n\ntemplate <typename T> struct SegmentTree2D {\n int H, W;\n vector<T> data;\n T identity = INF; // TODO: Set identity value.\n T op(T l, T r) {return min(l, r);} // TODO: Set op function.\n\n SegmentTree2D(int h, int w) {\n H = 1; W = 1;\n while (H < h) H *= 2;\n while (W < w) W *= 2;\n data.assign(4*H*W, identity);\n }\n\n int id(int h, int w) {return h*2*W + w;}\n\n void initialize(int h, int w, T x) {\n data[id(h+H, w+W)] = x;\n }\n\n void build() {\n for (int w = W; w < 2*W; w++) {\n for (int h = H-1; h > 0; h--) {\n data[id(h, w)] = op(data[id(2*h, w)], data[id(2*h+1, w)]);\n }\n }\n for (int h = 0; h < 2*H; h++) {\n for (int w = W-1; w > 0; w--) {\n data[id(h, w)] = op(data[id(h, 2*w)], data[id(h, 2*w+1)]);\n }\n }\n }\n\n void update(int h, int w, T x) {\n h += H; w += W;\n data[id(h, w)] = x;\n for (int i = (h >> 1); i > 0; i >>= 1) {\n data[id(i,w)] = op(data[id(2*i, w)], data[id(2*i+1, w)]);\n }\n for (; h > 0; h >>= 1) {\n for (int j = (w >> 1); j > 0; j >>= 1) {\n data[id(h,j)] = op(data[id(h, 2*j)], data[id(h, 2*j+1)]);\n }\n }\n }\n\n T _sub_query(int h, int w1, int w2) {\n T res = identity;\n for (; w1 < w2; w1 >>= 1, w2 >>= 1) {\n if (w1 & 1) {\n res = op(res, data[id(h, w1)]);\n w1++;\n }\n if (w2 & 1) {\n w2--;\n res = op(res, data[id(h, w2)]);\n }\n }\n return res;\n }\n\n T query(int h1, int w1, int h2, int w2) {\n // Return the answer to the query of [h1, h2) * [w1, w2)\n if (h1 >= h2 || w1 >= w2) return identity;\n T res = identity;\n h1 += H; h2 += H; w1 += W; w2 += W;\n for (; h1 < h2; h1 >>= 1, h2 >>= 1) {\n if (h1 & 1) {\n res = op(res, _sub_query(h1, w1, w2));\n h1++;\n }\n if (h2 & 1) {\n h2--;\n res = op(res, _sub_query(h2, w1, w2));\n }\n }\n return res;\n }\n};\n\nbool solve() {\n ll R, C, Q;\n cin >> R >> C >> Q;\n if (R == 0 && C == 0 && Q == 0) return true;\n\n SegmentTree2D<ll> st(R, C);\n for (int r = 0; r < R; r++) {\n for (int c = 0; c < C; c++) {\n ll x;\n cin >> x;\n st.update(r, c, x);\n }\n }\n\n while (Q--) {\n ll r1, c1, r2, c2;\n cin >> r1 >> c1 >> r2 >> c2;\n r2++; c2++;\n cout << st.query(r1, c1, r2, c2) << \"\\n\";\n }\n\n return false;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n bool done = false;\n while (!done) done = solve();\n}",
"accuracy": 1,
"time_ms": 270,
"memory_kb": 68448,
"score_of_the_acc": -0.578,
"final_rank": 6
},
{
"submission_id": "aoj_1068_9524955",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 2e+18;\n\ntemplate <typename T> struct SegmentTree2D {\n int H, W;\n vector<T> data;\n T identity = INF; // TODO: Set identity value.\n T op(T l, T r) {return min(l, r);} // TODO: Set op function.\n\n SegmentTree2D(int h, int w) {\n H = 1; W = 1;\n while (H < h) H *= 2;\n while (W < w) W *= 2;\n data.assign(4*H*W, identity);\n }\n\n int id(int h, int w) {return h*2*W + w;}\n\n void initialize(int h, int w, T x) {\n data[id(h+H, w+W)] = x;\n }\n\n void build() {\n for (int w = W; w < 2*W; w++) {\n for (int h = H-1; h > 0; h--) {\n data[id(h, w)] = op(data[id(2*h, w)], data[id(2*h+1, w)]);\n }\n }\n for (int h = 0; h < 2*H; h++) {\n for (int w = W-1; w > 0; w--) {\n data[id(h, w)] = op(data[id(h, 2*w)], data[id(h, 2*w+1)]);\n }\n }\n }\n\n void update(int h, int w, T x) {\n h += H; w += W;\n data[id(h, w)] = x;\n for (int i = (h >> 1); i > 0; i >>= 1) {\n data[id(i,w)] = op(data[id(2*i, w)], data[id(2*i+1, w)]);\n }\n for (; h > 0; h >>= 1) {\n for (int j = (w >> 1); j > 0; j >>= 1) {\n data[id(h,j)] = op(data[id(h, 2*j)], data[id(h, 2*j+1)]);\n }\n }\n }\n\n T _sub_query(int h, int w1, int w2) {\n T res = identity;\n for (; w1 < w2; w1 >>= 1, w2 >>= 1) {\n if (w1 & 1) {\n res = op(res, data[id(h, w1)]);\n w1++;\n }\n if (w2 & 1) {\n w2--;\n res = op(res, data[id(h, w2)]);\n }\n }\n return res;\n }\n\n T query(int h1, int w1, int h2, int w2) {\n // Return the answer to the query of [h1, h2) * [w1, w2)\n if (h1 >= h2 || w1 >= w2) return identity;\n T res = identity;\n h1 += H; h2 += H; w1 += W; w2 += W;\n for (; h1 < h2; h1 >>= 1, h2 >>= 1) {\n if (h1 & 1) {\n res = op(res, _sub_query(h1, w1, w2));\n h1++;\n }\n if (h2 & 1) {\n h2--;\n res = op(res, _sub_query(h2, w1, w2));\n }\n }\n return res;\n }\n};\n\nbool solve() {\n ll R, C, Q;\n cin >> R >> C >> Q;\n if (R == 0 && C == 0 && Q == 0) return true;\n\n SegmentTree2D<ll> st(R, C);\n for (int r = 0; r < R; r++) {\n for (int c = 0; c < C; c++) {\n ll x;\n cin >> x;\n st.initialize(r, c, x);\n }\n }\n st.build();\n\n while (Q--) {\n ll r1, c1, r2, c2;\n cin >> r1 >> c1 >> r2 >> c2;\n r2++; c2++;\n cout << st.query(r1, c1, r2, c2) << \"\\n\";\n }\n\n return false;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n bool done = false;\n while (!done) done = solve();\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 68548,
"score_of_the_acc": -0.5211,
"final_rank": 3
},
{
"submission_id": "aoj_1068_9276001",
"code_snippet": "/*#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/1068\"\n#include \"../Utility/template.hpp\"\n#include \"../Datastructure/2dsegtree.hpp\"*/\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)\n#define rrep(i, s, t) for(ll i = (ll)(t) - 1; i >= (ll)(s); i--)\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n\n#define TT template<typename T>\nTT using vec = vector<T>;\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nstruct io_setup {\n io_setup() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n int n;\n int sz;\n vector<S> d;\n\n segtree(int n) : segtree(vector<S>(n, e())) {}\n\n segtree(const vector<S> &v) : n((int)v.size()), sz(1) {\n while(sz < n) sz <<= 1;\n d.resize(2*sz, e());\n rep(i, 0, n) {\n d[sz+i] = v[i];\n }\n rrep(i, 1, sz) d[i] = op(d[i<<1], d[i<<1|1]);\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < n);\n p += sz;\n d[p] = x;\n while(p > 1) {\n p >>= 1;\n d[p] = op(d[p<<1], d[p<<1|1]);\n }\n }\n\n S get(int p) const {\n assert(0 <= p && p < n);\n return d[p + sz];\n }\n\n S prod(int l, int r) const {\n assert(0 <= l && l <= r && r <= n);\n S sml = e(), smr = e();\n l += sz;\n r += sz;\n\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n return op(sml, smr);\n }\n};\n\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree2d {\n int id(int y, int x) {return y * 2 * W + x;} //= y番目のセグ木の、ノードxに対応する添字\n int H, W;\n vec<S> dat;\n bool f;\n\n\n segtree2d(int h, int w) {\n f = true;\n H = W = 1;\n while(H < h) H <<= 1;\n while(W < w) W <<= 1;\n dat.resize(4 * H * W, e());\n }\n\n\n void preset(int y, int x, S v) {f = false, dat[id(y + H, x + W)] = v; }\n\n void build() {\n f = true;\n rep(h, H, 2 * H) {\n rrep(w, 1, W) {\n dat[id(h, w)] = op(dat[id(h, 2 * w)], dat[id(h, 2 * w + 1)]);\n }\n }\n \n rrep(h, 0, H) {\n rrep(w, 1, 2 * W) {\n dat[id(h, w)] = op(dat[id(h * 2, w)], dat[id(h * 2 + 1, w)]);\n } \n }\n }\n\n \n void set(int y, int x, S v) {\n assert(f);\n\n y += H, x += W;\n dat[id(y, x)] = v;\n rrep(w, 1, W) {\n dat[id(y, w)] = op(dat[id(y, 2 * w)], dat[id(y, 2 * w + 1)]);\n }\n\n while(y > 1) {\n y >>= 1;\n for(int j = x; j >= 1; j >>= 1) {\n dat[id(y, j)] = op(dat[id(y * 2, j)] , dat[id(y * 2 + 1, j)]);\n }\n }\n }\n\n S inner(int h, int l, int r) {\n S sml = e(), smr = e();\n l += W, r += W;\n while(l < r) {\n if(l & 1) sml = op(sml, dat[id(h, l++)]);\n if(r & 1) smr = op(dat[id(h, --r)], smr);\n l >>= 1, r >>= 1;\n }\n return op(sml, smr);\n }\n\n S prod(int sy, int ty, int sx, int tx) {\n assert(f);\n\n S sml = e(), smr = e();\n sy += H, ty += H;\n while(sy < ty) {\n if(sy & 1) sml = op(sml, inner(sy++, sx, tx));\n if(ty & 1) smr = op(inner(--ty, sx, tx), smr);\n sy >>= 1, ty >>= 1;\n }\n return op(sml, smr);\n }\n\n S get(int y, int x) {\n return dat[id(y + H, x + W)];\n }\n\n \n};\n\nusing S = int;\nS op(S l, S r) {\n return min(l, r);\n}\n\nS e() {\n return INT_MAX;\n}\n\nint main() {\n int r, c, q;\n //std::ifstream ifs(\"in.txt\");\n //std::ofstream ofs(\"test.txt\");\n while(cin >> r >> c >> q) {\n if(r==0) break;\n\n vec<vec<int>> grid(r, vec<int>(c));\n rep(i, 0, r) rep(j, 0, c) cin >> grid[i][j];\n \n segtree2d<S, op, e> seg(r, c);\n rep(i, 0, r) rep(j, 0, c) seg.preset(i, j, grid[i][j]);\n seg.build();\n while(q--) {\n int sy, sx, ty, tx;\n cin >> sy >> sx >> ty >> tx;\n cout << seg.prod(sy, ty+1, sx, tx+1) << '\\n';\n }\n }\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 74092,
"score_of_the_acc": -0.5536,
"final_rank": 5
},
{
"submission_id": "aoj_1068_9098298",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing uint = unsigned int;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pdd = pair<double, double>;\nusing tuplis = array<ll, 3>;\ntemplate<class T> using vc = vector<T>;\ntemplate<class T> using vvc = vc<vc<T>>;\ntemplate<class T> using vvvc = vc<vvc<T>>;\ntemplate<class T> using vvvvc = vc<vvvc<T>>;\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\nconst int INF = 0x3fffffff;\nconst ll MINF = 0x7fffffffffff;\nconst ll LINF = 0x1fffffffffffffff;\nconst ld DINF = numeric_limits<ld>::infinity();\nconst int MOD7 = 1000000007;\nconst int MOD9 = 998244353;\nconst ld EPS = 1e-9;\nconst ld PI = 3.1415926535897932;\nconst ll four[] = {0, 1, 0, -1, 0};\nconst ll eight[] = {0, 1, 1, 0, -1, -1, 1, -1, 0};\n#define overload4(_1, _2, _3, _4, name, ...) name\n#define rep1(n) for(ll i = 0; i < (n); ++i)\n#define rep2(i, n) for(ll i = 0; i < (n); ++i)\n#define rep3(i, a, 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); i --> 0; )\n#define rrep2(i, n) for(ll i = (n); i --> 0; )\n#define rrep3(i, a, b) for(ll i = (b); i --> (a); )\n#define rrep4(i, a, b, c) for(ll i = (b); (i -= (c)) >= (a); )\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n#define all(...) begin(__VA_ARGS__), end(__VA_ARGS__)\n#define So(...) sort(begin(__VA_ARGS__), end(__VA_ARGS__))\n#define vec(type,name,...) vector<type> name(__VA_ARGS__)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\n#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__; in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)\n#define VEC(type,name,size) vector<type> name(size); in(name)\n#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)\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> constexpr auto min(T... a) { return min(initializer_list<common_type_t<T...>>{a...}); }\ntemplate<class... T> constexpr auto max(T... a) { return max(initializer_list<common_type_t<T...>>{a...}); }\nint scan(){ return getchar(); }\nvoid scan(int& a){ scanf(\"%d\", &a); }\nvoid scan(unsigned& a){ scanf(\"%u\", &a); }\nvoid scan(long long& a){ scanf(\"%lld\", &a); }\nvoid scan(unsigned long long& a){ scanf(\"%llu\", &a); }\nvoid scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\\n'); }\nvoid scan(float& a){ scanf(\"%f\", &a); }\nvoid scan(double& a){ scanf(\"%lf\", &a); }\nvoid scan(long double& a){ scanf(\"%Lf\", &a); }\nvoid scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++) { int b; scan(b); a[i] = b; } }\nvoid scan(char a[]){ scanf(\"%s\", a); }\nvoid scan(string& a){ cin >> a; }\ntemplate<class T> void scan(vector<T>&);\ntemplate<class T> void scan(deque<T>&);\ntemplate<class T, size_t size> void scan(array<T, size>&);\ntemplate<class T, class L> void scan(pair<T, L>&);\ntemplate<class T, size_t size> void scan(T(&)[size]);\ntemplate<class T> void scan(vector<T>& a){ for(auto& i : a) scan(i); }\ntemplate<class T> void scan(deque<T>& a){ for(auto& i : a) scan(i); }\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto& i : a) scan(i); }\ntemplate<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }\ntemplate<class T, size_t size> void scan(T (&a)[size]){ for(auto& i : a) scan(i); }\ntemplate<class T> void scan(T& a){ cin >> a; }\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(unsigned a){ printf(\"%u\", a); }\nvoid print(long long a){ printf(\"%lld\", a); }\nvoid print(unsigned long long a){ printf(\"%llu\", a); }\nvoid print(char a){ printf(\"%c\", a); }\nvoid print(char a[]){ printf(\"%s\", a); }\nvoid print(float a){ printf(\"%.15f\", a); }\nvoid print(double a){ printf(\"%.15f\", a); }\nvoid print(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) print(i); }\ntemplate<class T> void print(const vector<T>&);\ntemplate<class T, size_t size> void print(const array<T, size>&);\ntemplate<class T, class L> void print(const pair<T, L>& p);\ntemplate<class T, size_t size> void print(const T (&)[size]);\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }\ntemplate<size_t size> void print(const char (&a)[size]){ for(auto&& i : a) if(i!=EOF)print(i); } //\ntemplate<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const T& a){ cout << a; }\nint out(){ putchar('\\n'); return 0; }\ntemplate<class T> int out(const T& t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\n\ntemplate<typename T>\nstruct segment_tree_2d {\n using F = function<T(T, T)>;\n int n, m;\n vector<vector<T>> node;\n F combine;\n T identity;\n segment_tree_2d(int n, int m, F combine, T identity) \n : n(n), m(m), node(n<<1, vector<T>(m<<1, identity)), combine(combine), identity(identity) {}\n segment_tree_2d(vector<vector<T>> &v, F combine, T identity) : n(v.size()), m(v[0].size()), node(n<<1, vector<T>(m<<1, identity)), combine(combine), identity(identity) {\n for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) node[i+n][j+m] = v[i][j];\n for (int i = n; i < n<<1; i++) for (int j = m-1; j > 0; j--) node[i][j] = combine(node[i][j<<1|0], node[i][j<<1|1]);\n for (int i = n-1; i > 0; i--) for (int j = 1; j < m<<1; j++) node[i][j] = combine(node[i<<1|0][j], node[i<<1|1][j]);\n }\n T val(int i, int j) {\n assert(0 <= i && i < n);\n assert(0 <= j && j < m);\n return node[i+n][j+m];\n }\n void set(int i, int j, T x) {\n assert(0 <= i && i < n);\n assert(0 <= j && j < m);\n node[i += n][j += m] = x;\n int j2 = j;\n while (j >>= 1) node[i][j] = combine(node[i][j<<1|0], node[i][j<<1|1]);\n j = j2;\n while (i >>= 1) {\n node[i][j] = combine(node[i<<1|0][j], node[i<<1|1][j]);\n while (j >>= 1) {\n node[i][j] = combine(node[i<<1|0][j], node[i<<1|1][j]);\n }\n j = j2;\n }\n }\n // [l1, r1) * [l2, r2)\n T fold(int l1, int r1, int l2, int r2) {\n assert(0 <= l1 && l1 <= r1 && r1<= n);\n assert(0 <= l2 && l2 <= r2 && r2 <= m);\n T vl, vr;\n vl = vr = identity;\n for (l1 += n, r1 += n; l1 < r1; l1 >>= 1, r1 >>= 1) {\n if (l1 & 1) vl = combine(vl, fold_w(l1++, l2, r2));\n if (r1 & 1) vr = combine(fold_w(--r1, l2, r2), vr);\n }\n return combine(vl, vr);\n }\n T fold_w(int i, int l, int r) {\n assert(0 <= l && l <= r && r <= m);\n T vl, vr;\n vl = vr = identity;\n for (l += m, r += m; l < r; l >>= 1, r >>= 1) {\n if (l & 1) vl = combine(vl, node[i][l++]);\n if (r & 1) vr = combine(node[i][--r], vr);\n }\n return combine(vl, vr);\n }\n};\n\nint combine(int a, int b) { return min(a, b); }\nint identity = INT_MAX;\n\nint main() {\n while(1) {\n INT(r,c,q);\n if((ll)r*c > 250000) return 1;\n if(r+c+q == 0) return 0;\n VV(int,grid,r,c);\n segment_tree_2d<int> seg(grid, combine, identity);\n grid.clear();\n while(q--) {\n INT(r1,c1,r2,c2);\n cout << seg.fold(r1,r2+1,c1,c2+1) << endl;\n }\n }\n}",
"accuracy": 0.125,
"time_ms": 100,
"memory_kb": 4364,
"score_of_the_acc": -0.0038,
"final_rank": 20
},
{
"submission_id": "aoj_1068_9067005",
"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 rrep(i,start,end) for (long long i = start;i >= (long long)(end);i--)\n#define repn(i,end) for(long long i = 0; i <= (long long)(end); i++)\n#define reps(i,start,end) for(long long i = start; i < (long long)(end); i++)\n#define repsn(i,start,end) for(long long i = start; i <= (long long)(end); i++)\n#define each(p,a) for(auto &p:a)\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef vector<long long> vll;\ntypedef vector<pair<long long ,long long>> vpll;\ntypedef vector<vector<long long>> vvll;\ntypedef set<ll> sll;\ntypedef map<long long , long long> mpll;\ntypedef pair<long long ,long long> pll;\ntypedef tuple<long long , long long , long long> tpl3;\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\n#define all(a) (a).begin(),(a).end()\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n#define sz(x) (int)x.size()\n// << std::fixed << std::setprecision(10)\nconst ll INF = 1LL << 60;\nconst ld EPS = 1e-9;\n \ninline ll lfloor(ll x,ll m){return (x - ((x % m+ m)%m))/m;}\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\ntemplate<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}\ntemplate<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\ntemplate<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\" \":\"\");}return os;}\ntemplate<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << \"{\" << p.first << \",\" << p.second << \"}\";return os;}\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\nvoid print(){cout << endl;}\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\nvoid perr(){cerr << endl;}\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\nvoid yes(bool i = true){ return print(i?\"yes\":\"no\"); }\nvoid Yes(bool i = true){ return print(i?\"Yes\":\"No\"); }\nvoid YES(bool i = true){ return print(i?\"YES\":\"NO\"); }\ntemplate <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}\ntemplate <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}\ntemplate <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}\ntemplate <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}\n//grid探索用\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\n \nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \nconst ll MOD9 = 998244353LL;\nconst ll MOD10 = 1000000007LL;\n\n//verify(update & query) https://atcoder.jp/contests/abc106/submissions/52135955\n//参考 https://drken1215.hatenablog.com/entry/2024/03/31/132815\n\ntemplate<class T>\nclass SegmentTree2D{\n public:\n vector<T> tree;\n ll h,w;//配列のサイズに使う\n ll hsiz,wsiz; \n T e; //単位元 初期化に使われるやつ\n function<T(T,T)> op;\n \n SegmentTree2D(){}\n\n SegmentTree2D(ll _h,ll _w,function<T(T,T)> _op,T _e){\n init(_h,_w,_op,_e);\n }\n\n void init(ll _h,ll _w,function<T(T,T)> _op, T _e){\n h = _h;w = _w;\n op = _op;\n e = _e;\n ll i = 0;\n while((1 << i) < h){i++;}\n hsiz = 1 << i;\n\n ll j = 0;\n while((1 << j) < w){j++;}\n wsiz = 1 << j;\n tree.assign(hsiz * wsiz * 4,e);\n }\n\n ll id(ll y,ll x) const{\n return y * 2 * wsiz + x;\n }\n\n void build(const vector<vector<T>> &v){\n assert(h == (ll)v.size() && w == (ll)v[0].size());\n rep(i,h){\n rep(j,w){\n tree[id(i + hsiz,j + wsiz)] = v[i][j];\n }\n }\n for(ll j = wsiz;j < wsiz * 2;j++){\n for(ll i = hsiz-1;i;i--){\n tree[id(i,j)] = op(tree[id(i*2,j)],tree[id(i*2 +1,j)]);\n }\n }\n for(ll i = 0;i <hsiz * 2;i++){\n for(ll j = wsiz-1;j;j--){\n tree[id(i,j)] = op(tree[id(i,j*2)],tree[id(i,j*2+1)]);\n }\n }\n }\n\n void update(ll y,ll x,T v){\n assert(y >= 0 && y < h && x >= 0 && x < w);\n y += hsiz;x += wsiz;\n tree[id(y,x)] = v;\n for(ll i = y >> 1;i;i >>= 1){\n tree[id(i,x)] = op(tree[id(i * 2,x)],tree[id(i * 2 + 1,x)]);\n }\n for(;y;y >>= 1){\n for(ll j = x >> 1;j;j>>= 1){\n tree[id(y,j)] = op(tree[id(y,j * 2)],tree[id(y,j * 2 + 1)]);\n }\n }\n }\n\n T _query(ll y, ll xl,ll xr){\n T ret = e;\n while(xl < xr){\n if(xl & 1)ret = op(ret,tree[id(y,xl++)]);\n if(xr & 1)ret = op(tree[id(y,--xr)],ret);\n xl >>= 1;xr >>= 1;\n }\n return ret;\n }\n\n T query(ll yl,ll yr,ll xl,ll xr){\n assert(0 <= yl && yl <= yr && yr <= h);\n assert(0 <= xl && xl <= xr && xr <= w);\n T ret = e;\n yl += hsiz; yr += hsiz; xl += wsiz; xr += wsiz;\n while(yl < yr){\n if(yl & 1)ret = op(ret,_query(yl++,xl,xr));\n if(yr & 1)ret = op(_query(--yr,xl,xr),ret);\n yl >>= 1;yr >>= 1;\n }\n return ret;\n }\n\n T operator () (ll y,ll x){\n return tree[id(y + hsiz,x + wsiz)];\n }\n};\n \nint main(){\n ios::sync_with_stdio(false);cin.tie(nullptr);\n auto op = [](ll a,ll b){\n return min(a,b);\n };\n while(true){\n\n LL(r,c,q);\n if(r == 0 && c == 0 && q == 0)break;\n vvll a(r,vll(c));\n rep(i,r){\n rep(j,c){\n cin >> a[i][j];\n }\n }\n SegmentTree2D<ll> seg(r,c,op,INF);\n seg.build(a);\n rep(i,q){\n LL(r1,c1,r2,c2);\n cout << seg.query(r1,r2+1,c1,c2+1) << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 90544,
"score_of_the_acc": -0.7035,
"final_rank": 13
},
{
"submission_id": "aoj_1068_9066704",
"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 rrep(i,start,end) for (long long i = start;i >= (long long)(end);i--)\n#define repn(i,end) for(long long i = 0; i <= (long long)(end); i++)\n#define reps(i,start,end) for(long long i = start; i < (long long)(end); i++)\n#define repsn(i,start,end) for(long long i = start; i <= (long long)(end); i++)\n#define each(p,a) for(auto &p:a)\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef vector<long long> vll;\ntypedef vector<pair<long long ,long long>> vpll;\ntypedef vector<vector<long long>> vvll;\ntypedef set<ll> sll;\ntypedef map<long long , long long> mpll;\ntypedef pair<long long ,long long> pll;\ntypedef tuple<long long , long long , long long> tpl3;\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\n#define all(a) (a).begin(),(a).end()\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n#define sz(x) (int)x.size()\n// << std::fixed << std::setprecision(10)\nconst ll INF = 1LL << 60;\nconst ld EPS = 1e-9;\n \ninline ll lfloor(ll x,ll m){return (x - ((x % m+ m)%m))/m;}\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\ntemplate<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}\ntemplate<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\ntemplate<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\" \":\"\");}return os;}\ntemplate<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << \"{\" << p.first << \",\" << p.second << \"}\";return os;}\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\nvoid print(){cout << endl;}\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\nvoid perr(){cerr << endl;}\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\nvoid yes(bool i = true){ return print(i?\"yes\":\"no\"); }\nvoid Yes(bool i = true){ return print(i?\"Yes\":\"No\"); }\nvoid YES(bool i = true){ return print(i?\"YES\":\"NO\"); }\ntemplate <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}\ntemplate <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}\ntemplate <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}\ntemplate <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}\n//grid探索用\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\n \nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \nconst ll MOD9 = 998244353LL;\nconst ll MOD10 = 1000000007LL;\n\n//参考 https://drken1215.hatenablog.com/entry/2024/03/31/132815\n\ntemplate<class T>\nclass SegmentTree2D{\n public:\n vector<T> tree;\n ll h,w;//配列のサイズに使う\n ll hsiz,wsiz; \n T e; //単位元 初期化に使われるやつ\n function<T(T,T)> op;\n \n SegmentTree2D(){}\n\n SegmentTree2D(ll _h,ll _w,function<T(T,T)> _op,T _e){\n init(_h,_w,_op,_e);\n }\n\n void init(ll _h,ll _w,function<T(T,T)> _op, T _e){\n h = _h;w = _w;\n op = _op;\n e = _e;\n ll i = 0;\n while((1 << i) < h){i++;}\n hsiz = 1 << i;\n\n ll j = 0;\n while((1 << j) < w){j++;}\n wsiz = 1 << j;\n tree.assign(hsiz * wsiz * 4,e);\n }\n\n ll id(ll y,ll x) const{\n return y * 2 * wsiz + x;\n }\n\n void build(const vector<vector<T>> &v){\n assert(h == (ll)v.size() && w == (ll)v[0].size());\n rep(i,h){\n rep(j,w){\n tree[id(i + hsiz,j + wsiz)] = v[i][j];\n }\n }\n for(ll j = wsiz;j < wsiz * 2;j++){\n for(ll i = hsiz-1;i;i--){\n tree[id(i,j)] = op(tree[id(i*2,j)],tree[id(i*2 +1,j)]);\n }\n }\n for(ll i = 0;i <hsiz * 2;i++){\n for(ll j = wsiz-1;j;j--){\n tree[id(i,j)] = op(tree[id(i,j*2)],tree[id(i,j*2+1)]);\n }\n }\n }\n\n void update(ll y,ll x,T v){\n assert(y >= 0 && y < h && x >= 0 && x < w);\n y += hsiz;x += wsiz;\n tree[id(y,x)] = v;\n for(ll i = y >> 1;i;i >>= 1){\n tree[id(i,x)] = op(tree[id(i * 2,x)],tree[id(i * 2 + 1,x)]);\n }\n for(;y;y >>= 1){\n for(ll j = x >> 1;x;x>>= 1){\n tree[id(y,j)] = op(tree[id(y,j * 2)],tree[id(y,j * 2 + 1)]);\n }\n }\n }\n\n T _query(ll y, ll xl,ll xr){\n T ret = e;\n while(xl < xr){\n if(xl & 1)ret = op(ret,tree[id(y,xl++)]);\n if(xr & 1)ret = op(tree[id(y,--xr)],ret);\n xl >>= 1;xr >>= 1;\n }\n return ret;\n }\n\n T query(ll yl,ll yr,ll xl,ll xr){\n assert(0 <= yl && yl <= yr && yr <= h);\n assert(0 <= xl && xl <= xr && xr <= w);\n T ret = e;\n yl += hsiz; yr += hsiz; xl += wsiz; xr += wsiz;\n while(yl < yr){\n if(yl & 1)ret = op(ret,_query(yl++,xl,xr));\n if(yr & 1)ret = op(_query(--yr,xl,xr),ret);\n yl >>= 1;yr >>= 1;\n }\n return ret;\n }\n\n T operator () (ll y,ll x){\n return tree[id(y + hsiz,x + wsiz)];\n }\n};\n \nint main(){\n ios::sync_with_stdio(false);cin.tie(nullptr);\n auto op = [](ll a,ll b){\n return min(a,b);\n };\n while(true){\n\n LL(r,c,q);\n if(r == 0 && c == 0 && q == 0)break;\n vvll a(r,vll(c));\n rep(i,r){\n rep(j,c){\n cin >> a[i][j];\n }\n }\n SegmentTree2D<ll> seg(r,c,op,INF);\n seg.build(a);\n rep(i,q){\n LL(r1,c1,r2,c2);\n cout << seg.query(r1,r2+1,c1,c2+1) << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 90344,
"score_of_the_acc": -0.7019,
"final_rank": 10
},
{
"submission_id": "aoj_1068_9066701",
"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 rrep(i,start,end) for (long long i = start;i >= (long long)(end);i--)\n#define repn(i,end) for(long long i = 0; i <= (long long)(end); i++)\n#define reps(i,start,end) for(long long i = start; i < (long long)(end); i++)\n#define repsn(i,start,end) for(long long i = start; i <= (long long)(end); i++)\n#define each(p,a) for(auto &p:a)\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef vector<long long> vll;\ntypedef vector<pair<long long ,long long>> vpll;\ntypedef vector<vector<long long>> vvll;\ntypedef set<ll> sll;\ntypedef map<long long , long long> mpll;\ntypedef pair<long long ,long long> pll;\ntypedef tuple<long long , long long , long long> tpl3;\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\n#define all(a) (a).begin(),(a).end()\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n#define sz(x) (int)x.size()\n// << std::fixed << std::setprecision(10)\nconst ll INF = 1LL << 60;\nconst ld EPS = 1e-9;\n \ninline ll lfloor(ll x,ll m){return (x - ((x % m+ m)%m))/m;}\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\ntemplate<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}\ntemplate<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\ntemplate<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\" \":\"\");}return os;}\ntemplate<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << \"{\" << p.first << \",\" << p.second << \"}\";return os;}\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\nvoid print(){cout << endl;}\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\nvoid perr(){cerr << endl;}\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\nvoid yes(bool i = true){ return print(i?\"yes\":\"no\"); }\nvoid Yes(bool i = true){ return print(i?\"Yes\":\"No\"); }\nvoid YES(bool i = true){ return print(i?\"YES\":\"NO\"); }\ntemplate <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}\ntemplate <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}\ntemplate <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}\ntemplate <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}\n//grid探索用\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\n \nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \nconst ll MOD9 = 998244353LL;\nconst ll MOD10 = 1000000007LL;\n\n//参考 https://drken1215.hatenablog.com/entry/2024/03/31/132815\n\ntemplate<class T>\nclass SegmentTree2D{\n public:\n vector<T> tree;\n ll h,w;//配列のサイズに使う\n ll hsiz,wsiz; \n T e; //単位元 初期化に使われるやつ\n function<T(T,T)> op;\n \n SegmentTree2D(){}\n\n SegmentTree2D(ll _h,ll _w,function<T(T,T)> _op,T _e){\n init(_h,_w,_op,_e);\n }\n\n void init(ll _h,ll _w,function<T(T,T)> _op, T _e){\n h = _h;w = _w;\n op = _op;\n e = _e;\n ll i = 0;\n while((1 << i) < h){i++;}\n hsiz = 1 << i;\n\n ll j = 0;\n while((1 << j) < w){j++;}\n wsiz = 1 << j;\n tree.assign(hsiz * wsiz * 4,e);\n }\n\n ll id(ll y,ll x) const{\n return y * 2 * wsiz + x;\n }\n\n void build(const vector<vector<T>> &v){\n assert(h == (ll)v.size() && w == (ll)v[0].size());\n rep(i,h){\n rep(j,w){\n tree[id(i + hsiz,j + wsiz)] = v[i][j];\n }\n }\n for(ll j = wsiz;j < wsiz * 2;j++){\n for(ll i = hsiz-1;i >= 1;i--){\n tree[id(i,j)] = op(tree[id(i*2,j)],tree[id(i*2 +1,j)]);\n }\n }\n for(ll i = 0;i <hsiz * 2;i++){\n for(ll j = wsiz-1;j >= 1;j--){\n tree[id(i,j)] = op(tree[id(i,j*2)],tree[id(i,j*2+1)]);\n }\n }\n }\n\n void update(ll y,ll x,T v){\n assert(y >= 0 && y < h && x >= 0 && x < w);\n y += hsiz;x += wsiz;\n tree[id(y,x)] = v;\n for(ll i = y >> 1;i >= 1;i >>= 1){\n tree[id(i,x)] = op(tree[id(i * 2,x)],tree[id(i * 2 + 1,x)]);\n }\n for(;y>= 1;y >>= 1){\n for(ll j = x >> 1;x >= 1;x>>= 1){\n tree[id(y,j)] = op(tree[id(y,j * 2)],tree[id(y,j * 2 + 1)]);\n }\n }\n }\n\n T _query(ll y, ll xl,ll xr){\n T ret = e;\n while(xl < xr){\n if(xl & 1)ret = op(ret,tree[id(y,xl++)]);\n if(xr & 1)ret = op(tree[id(y,--xr)],ret);\n xl >>= 1;xr >>= 1;\n }\n return ret;\n }\n\n T query(ll yl,ll yr,ll xl,ll xr){\n assert(0 <= yl && yl <= yr && yr <= h);\n assert(0 <= xl && xl <= xr && xr <= w);\n T ret = e;\n yl += hsiz; yr += hsiz; xl += wsiz; xr += wsiz;\n while(yl < yr){\n if(yl & 1)ret = op(ret,_query(yl++,xl,xr));\n if(yr & 1)ret = op(_query(--yr,xl,xr),ret);\n yl >>= 1;yr >>= 1;\n }\n return ret;\n }\n\n T operator () (ll y,ll x){\n return tree[id(y + hsiz,x + wsiz)];\n }\n};\n \nint main(){\n ios::sync_with_stdio(false);cin.tie(nullptr);\n auto op = [](ll a,ll b){\n return min(a,b);\n };\n while(true){\n\n LL(r,c,q);\n if(r == 0 && c == 0 && q == 0)break;\n vvll a(r,vll(c));\n rep(i,r){\n rep(j,c){\n cin >> a[i][j];\n }\n }\n SegmentTree2D<ll> seg(r,c,op,INF);\n seg.build(a);\n // rep(i,r){\n // rep(j,c){\n // pspace(seg(i,j));\n // }\n // print();\n // }\n rep(i,q){\n LL(r1,c1,r2,c2);\n cout << seg.query(r1,r2+1,c1,c2+1) << endl;\n }\n }\n\n \n // SegmentTree2D<ll> seg(1001,1001,op,0);\n // rep(i,n){\n // LL(x1,y1,x2,y2);\n // seg.update(y1,x1,seg(y1,x1) +1);\n // seg.update(y1,x2+1,seg(y1,x2+1) -1);\n // seg.update(y2+1,x1,seg(y2+1,x1) -1);\n // seg.update(y2+1,x2+1,seg(y2+1,x2+1) +1);\n // }\n // ll ans =0;\n // rep(i,1001){\n // rep(j,1001){\n // if(i <= 5 && j <= 5){\n // perr(i,j,seg.query(0,i+1,0,j+1));\n\n // }\n // chmax(ans,seg.query(0,i+1,0,j+1));\n // }\n\n // }\n // cout << ans << endl;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 90372,
"score_of_the_acc": -0.7021,
"final_rank": 11
},
{
"submission_id": "aoj_1068_9064451",
"code_snippet": "/**\n* author: shu8Cream\n* created: 2024/04/06 13:39:53\n**/\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\ntemplate<class S, S(*op)(S,S), S(*e)()>\nstruct segtree2d {\nprivate:\n int h,w;\n int hsize,wsize;\n vector<S> data;\n\n unsigned int bit_ceil(unsigned int n){\n unsigned int x = 1;\n while(x < (unsigned int)(n)) x*=2;\n return x;\n }\n\n int id(int r, int c) const { return r*2*wsize+c; }\n\n S _inner_prod(int l, int r1, int r2){\n S res = e();\n for(; r1<r2; r1>>=1, r2>>=1){\n if(r1&1) res = op(res, data[id(l,r1)]), r1++;\n if(r2&1) --r2, res = op(res, data[id(l,r2)]);\n }\n return res;\n }\n\npublic:\n segtree2d(): segtree2d(0,0){}\n segtree2d(int h, int w): h(h),w(w) {\n hsize = (int)bit_ceil((unsigned int)(h));\n wsize = (int)bit_ceil((unsigned int)(w));\n data.assign(4*hsize*wsize,e());\n }\n segtree2d(const vector<vector<S>> &v): h(int(v.size())), w(int(v[0].size())) {\n hsize = (int)bit_ceil((unsigned int)(h));\n wsize = (int)bit_ceil((unsigned int)(w));\n data = vector<S>(4*hsize*wsize,e());\n for(int i=0; i<h; i++)for(int j=0; j<w; j++) set(i,j,v[i][j]);\n build();\n }\n\n void set(int r, int c, S x){\n assert(0<=r&&r<h);\n assert(0<=c&&c<w);\n data[id(r+hsize,c+wsize)] = x;\n }\n\n void build(){\n for(int c=wsize; c<2*wsize; c++){\n for(int r=hsize-1; r; r--){\n data[id(r,c)] = op(data[id(2*r,c)], data[id(2*r+1,c)]);\n }\n }\n for(int r=0; r<2*hsize; r++){\n for(int c=wsize-1; c; c--){\n data[id(r,c)] = op(data[id(r,2*c)], data[id(r,2*c+1)]);\n }\n }\n }\n\n S get(int r, int c){\n assert(0<=r&&r<h);\n assert(0<=c&&c<w);\n return data[id(r+hsize,c+wsize)];\n }\n\n S prod(int i1, int j1, int i2, int j2) {\n assert(0<=i1 && i1<h && 0<=i2 && i2<=h);\n assert(0<=j1 && j1<w && 0<=j2 && j2<=w);\n if(i1>=i2 || j1>=j2) return e();\n S res = e();\n i1 += hsize; i2 += hsize;\n j1 += wsize; j2 += wsize;\n for(;i1<i2; i1>>=1, i2>>=1){\n if(i1&1) res = op(res,_inner_prod(i1,j1,j2)), i1++;\n if(i2&1) --i2, res = op(res,_inner_prod(i2,j1,j2));\n }\n return res;\n }\n\n void update(int r, int c, S x){\n r+=hsize; c+=wsize;\n data[id(r,c)] = x;\n for(int i=r>>1; r; r>>=1){\n data[id(i,c)] = op(data[id(2*i,c)], data[id(2*i+1,c)]);\n }\n for(; r; r>>=1){\n for(int j=c>>1; c; c>>=1){\n data[id(r,j)] = op(data[id(r,2*j)], data[id(r,2*j+1)]);\n }\n }\n }\n\n void _print(int i1, int j1, int i2, int j2){\n assert(0<=i1 && i1<h && 0<=i2 && i2<=h);\n assert(0<=j1 && j1<w && 0<=j2 && j2<=w);\n if(i1==i2 || j1==j2){\n cerr << \"Area is 0\" << endl;\n return;\n }\n for(int i=i1; i<i2; i++){\n for(int j=j1; j<j2; j++) cerr << data[id(i+hsize,j+wsize)] << \" \";\n cerr << endl;\n }\n }\n};\nusing S = ll;\nconst ll INF = 8e18;\n\nS op(S a, S b){ return min(a,b); };\nS e() { return INF; }\n\nvoid AOJ1068(){\n while(1){\n int r,c,q; cin >> r >> c >> q;\n if(r==0) break;\n vector g(r,vector<S>(c));\n for(int i=0; i<r; i++)for(int j=0; j<c; j++){\n cin >> g[i][j];\n }\n segtree2d<S,op,e> seg(g);\n for(;q--;){\n int r1,c1,r2,c2;\n cin >> r1 >> c1 >> r2 >> c2;\n cout << seg.prod(r1,c1,r2+1,c2+1) << endl;\n }\n }\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n AOJ1068();\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 90448,
"score_of_the_acc": -0.7027,
"final_rank": 12
},
{
"submission_id": "aoj_1068_9059216",
"code_snippet": "#ifdef t9unkubj\n#define _GLIBCXX_DEBUG\n#include \"debug.cpp\"\n#else\n#define dbg(...) 199958\n#endif\n\nusing namespace std;\n#include<bits/stdc++.h>\nusing uint=unsigned;\nusing ll=long long;\nusing ull=unsigned long long;\nusing ld=long double;\nusing pii=pair<int,int>;\nusing pll=pair<ll,ll>;\ntemplate<class T>using vc=vector<T>;\ntemplate<class T>using vvc=vc<vc<T>>;\ntemplate<class T>using vvvc=vvc<vc<T>>;\nusing vi=vc<int>;\nusing vvi=vc<vi>;\nusing vvvi=vc<vvi>;\nusing vl=vc<ll>;\nusing vvl=vc<vl>;\nusing vvvl=vc<vvl>;\ntemplate<class T>using smpq=priority_queue<T,vector<T>,greater<T>>;\ntemplate<class T>using bipq=priority_queue<T>;\n#define rep(i,n) for(ll i=0;i<(ll)n;i++)\n#define REP(i,j,n) for(ll i=j;i<(ll)n;i++)\n#define DREP(i,n,m) for(ll i=n;i>=m;i--)\n#define drep(i,n) for(ll i=n-1;i>=0;i--)\n#define all(x) x.begin(),x.end()\n#define rall(x) x.rbegin(),x.rend()\n#define mp make_pair\n#define mt make_tuple\n#define pb push_back\n#define eb emplace_back\n#define fi first\n#define se second\n#define is insert\nvoid readvi(vi&a,int off=0){for(auto&x:a)cin>>x,x+=off;}\nvi readvi(int n,int off=0){vi b(n);for(auto&x:b)cin>>x,x+=off;return b;}\nvoid readvl(vl&a,int off=0){for(auto&x:a)cin>>x,x+=off;}\nvl readvl(int n,int off=0){vl b(n);for(auto&x:b)cin>>x,x+=off;return b;}\ntemplate<class T,class F>bool chmin(T&x,F y){if(x>y){x=y;return 1;}return 0;}\ntemplate<class T,class F>bool chmax(T&x,F y){if(x<y){x=y;return 1;}return 0;}\nvoid YesNo(bool b){cout<<(b?\"Yes\":\"No\")<<endl;}\ntemplate<class T>int popcount(T n){return __builtin_popcount(n);}\ntemplate<class T>T sum(vc<T>&a){return accumulate(all(a),T(0));}\ntemplate<class T>T max(vc<T>&a){return *max_element(all(a));}\ntemplate<class T>T min(vc<T>&a){return *min_element(all(a));}\nvvi readgraph(int n,int m,int off=1){vvi g(n);rep(i,m){int u,v;cin>>u>>v;u-=off,v-=off;g[u].push_back(v);g[v].push_back(u);} return g;}\nvvi readtree(int n,int off=1){return readgraph(n,n-1,off);}\ntemplate<class T>vc<T>presum(vc<T>&a){vc<T>ret(a.size()+1);rep(i,a.size())ret[i+1]=ret[i]+a[i];return ret;}\ntemplate<class T,class F> pair<T,F> operator+(pair<T,F>&a,pair<T,F>&b){return mp(a.fi+b.fi,a.se+b.se);}\ntemplate<class T,class F> pair<T,F> operator-(pair<T,F>&a,pair<T,F>&b){return mp(a.fi-b.fi,a.se-b.se);}\ntemplate<class T,class F,class G> pair<T,F>& operator+=(pair<T,F>&a,G&b){a.fi+=b,b.se+=b;return a;}\ntemplate<class T,class F,class G> pair<T,F>& operator-=(pair<T,F>&a,G&b){a.fi-=b,b.se-=b;return a;}\ntemplate<class T,class F,class G> pair<T,F>& operator*=(pair<T,F>&a,G&b){a.fi*=b,b.se*=b;return a;}\ntemplate<class T,class F,class G> pair<T,F> operator+(pair<T,F>&a,G&b){return mp(a.fi+b,a.se+b);}\ntemplate<class T,class F,class G> pair<T,F> operator-(pair<T,F>&a,G&b){return mp(a.fi-b,a.se-b);}\ntemplate<class T,class F,class G> pair<T,F> operator*(pair<T,F>&a,G&b){return mp(a.fi*b,a.se*b);}\ntemplate<class T,class F>vc<T>& operator+=(vc<T>&a,F b){for(auto&v:a)v+=b;return a;}\ntemplate<class T,class F>vc<T>& operator-=(vc<T>&a,F b){for(auto&v:a)v-=b;return a;}\ntemplate<class T,class F>vc<T>& operator*=(vc<T>&a,F b){for(auto&v:a)v*=b;return a;}\ntemplate<class T>\nstruct seg2d{\n int h,w;\n using F=function<T(T,T)>;\n F op;\n T e;\n T**node;\n seg2d(int h,int w,F op,T e):h(h),w(w),op(op),e(e){\n h*=2,w*=2;\n node=new T*[h];\n for(int i=0;i<h;i++)node[i]=new T[w];\n for(int i=0;i<h;i++)for(int j=0;j<w;j++)node[i][j]=e;\n }\n void set(int i,int j,T x){\n node[i+=h][j+=w]=x;\n for(int j_=j>>1;j_>0;j_>>=1){\n node[i][j_]=op(node[i][j_<<1],node[i][j_<<1|1]);\n }\n while(i>>=1){\n node[i][j]=op(node[i<<1][j],node[i<<1|1][j]);\n for(int j_=j>>1;j_>0;j_>>=1){\n node[i][j_]=op(node[i<<1][j_],node[i<<1|1][j_]);\n }\n }\n }\n T prod(int h1,int w1,int h2,int w2){//[h1,w1)*[h2,w2)\n h1+=h,h2+=h,w1+=w,w2+=w;\n T res=e;\n while(h1<h2){\n if(h1&1){\n int W1=w1,W2=w2;\n while(w1<w2){\n if(w1&1)res=op(res,node[h1][w1++]);\n if(w2&1)res=op(res,node[h1][--w2]);\n w1>>=1,w2>>=1;\n }\n w1=W1,w2=W2;\n h1++;\n }\n if(h2&1){\n --h2;\n int W1=w1,W2=w2;\n while(w1<w2){\n if(w1&1)res=op(res,node[h2][w1++]);\n if(w2&1)res=op(res,node[h2][--w2]);\n w1>>=1,w2>>=1;\n }\n w1=W1,w2=W2;\n }\n h1>>=1,h2>>=1;\n }\n return res;\n }\n T operator()(int i,int j){\n return node[i+w][j+h];\n }\n ~seg2d(){\n for(int i=0;i<h;i++){\n delete[] node[i];\n }\n delete[] node;\n }\n};\nvoid solve(){\n cin.tie(0)->sync_with_stdio(0);\n while(1){\n int r,c,q;\n cin>>r>>c>>q;\n if(r==0&&c==0&&q==0)break;\n auto op=[](int a,int b){return min(a,b);};\n seg2d<int>seg(r,c,op,(1ll<<31)-1);\n rep(i,r)rep(j,c){\n int a;\n cin>>a;\n seg.set(i,j,a);\n }\n while(q--){\n int a,b,c,d;\n cin>>a>>b>>c>>d;\n cout<<seg.prod(a,b,c+1,d+1)<<endl;\n }\n }\n}\nsigned main(){\n cin.tie(0)->sync_with_stdio(0);\n#ifdef t9unkubj\nfreopen(\"input.txt\", \"r\", stdin);\nfreopen(\"output.txt\", \"w\", stdout);\n#endif\n int t=1;\n //cin>>t;\n while(t--)solve();\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 81116,
"score_of_the_acc": -0.694,
"final_rank": 9
},
{
"submission_id": "aoj_1068_9052757",
"code_snippet": "#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iomanip>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <optional>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n#if __cplusplus >= 202002L\n#include <bit>\n#else\n#ifdef _MSC_VER\n#define countl_zero __lzcnt64\n#else\n#define countl_zero __builtin_clzll\n#endif\n#endif\n\n#pragma warning (disable : 26451 6297 6385 4244 4267)\n#ifdef _MSC_VER\n#define __builtin_popcount __popcnt\n#define __builtin_popcountll __popcnt64\n#endif\n\nusing namespace std;\nusing lint = long long;\nusing P = pair<lint, lint>;\nusing Pii = pair<int, int>;\n\nstruct FastIO { FastIO() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(12);} }aaaAAAaaaAAA;\n\n#define rep(i, n) for (remove_const<decltype(n)>::type i = 0; i < (n); ++i)\n#define repe(i, n) for (remove_const<decltype(n)>::type i = 0; i <= (n); ++i)\n#define rep1(i, n) for (remove_const<decltype(n)>::type i = 1; i < (n); ++i)\n#define rep1e(i, n) for (remove_const<decltype(n)>::type i = 1; i <= (n); ++i)\n#define repn(i, a, b) for (remove_const<decltype(a)>::type i = (a); i < (b); ++i)\n#define repne(i, a, b) for (remove_const<decltype(a)>::type i = (a); i <= (b); ++i)\n#define rrep(i, n) for (remove_const<decltype(n)>::type i = (n); i >= 0; --i)\n#define all(vec) begin(vec), end(vec)\n#define rall(vec) rbegin(vec), rend(vec)\n\nconstexpr long long Mod = /** 1000'000'007LL /*/ 998244353LL /**/;\nconstexpr long long Inf = 1'000'000'000'000'000'010LL;\nconstexpr int IntInf = 1000'000'010;\nconstexpr double Pi = 3.141592653589793238;\nconstexpr double InvPi = 0.318309886183790671;\n\nconst int di[] = { 0,1,0,-1,0 }, dj[] = { 1,0,-1,0,0 };\n\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\n\nusing namespace atcoder;\nusing mint = static_modint<Mod>;\n\ntemplate<int MOD>\ninline istream& operator>>(istream& is, static_modint<MOD>& rhs) {\n\tlong long tmp;\n\tis >> tmp;\n\trhs = tmp;\n\treturn is;\n}\ntemplate<int ID>\ninline istream& operator>>(istream& is, dynamic_modint<ID>& rhs) {\n\tlong long tmp;\n\tis >> tmp;\n\trhs = tmp;\n\treturn is;\n}\ntemplate<int MOD>\ninline ostream& operator<<(ostream& os, const static_modint<MOD>& rhs) { return os << rhs.val(); }\ntemplate<int ID>\ninline ostream& operator<<(ostream& os, const dynamic_modint<ID>& rhs) { return os << rhs.val(); }\n\nmint lagrange_interpolation(const vector<mint>& y, mint t) {\n\tconst int n = (int)y.size();\n\n\tmint res = 0;\n\n\tvector<mint> inv(n), fact_inv(n);\n\n\tinv[1] = 1;\n\tfact_inv[0] = 1;\n\tfact_inv[1] = 1;\n\tfor (int i = 2; i < n; ++i) {\n\t\tinv[i] = -Mod / i * inv[Mod % i];\n\t\tfact_inv[i] = fact_inv[i - 1] * inv[i];\n\t}\n\n\tvector<mint> prod2(n);\n\tprod2.back() = 1;\n\tfor (int i = n - 1; i > 0; --i) {\n\t\tprod2[i - 1] = (t - i) * prod2[i];\n\t}\n\n\tmint prod1 = 1;\n\tfor (int i = 0; i < n; ++i) {\n\t\tmint a = y[i];\n\t\ta *= fact_inv[i] * fact_inv[n - 1 - i];\n\t\tif ((n - 1 - i) & 1) a = -a;\n\n\t\tres += a * prod1 * prod2[i];\n\n\t\tprod1 *= (t - i);\n\t}\n\n\treturn res;\n}\n\ntemplate<typename T>\nlint inversion_number(const vector<T> vec) {\n\tvector<T> v = vec;\n\tsort(v.begin(), v.end());\n\tv.erase(unique(v.begin(), v.end()), v.end());\n\n\tconst int n = vec.size();\n\n\tlint res = 0;\n\n\tfenwick_tree<int> b(n);\n\tfor (int i = 0; i < n; ++i) {\n\t\tconst int j = lower_bound(v.begin(), v.end(), vec[i]) - v.begin();\n\t\tres += b.sum(j + 1, n);\n\t\tb.add(j, 1);\n\t}\n\n\treturn res;\n}\n\n// prod (a_i x + b_i)\ntemplate<typename T>\nvector<mint> prod(const vector<T>& a, const vector<T>& b) {\n\tconst size_t n = a.size();\n\n\tvector<vector<mint>> fs(n);\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tfs[i].resize(2);\n\t\tfs[i][0] = b[i];\n\t\tfs[i][1] = a[i];\n\t}\n\tfor (size_t i = n; i > 1; i = (i + 1) >> 1) {\n\t\tfor (size_t j = 0; j + 1 < i; j += 2) {\n\t\t\tfs[j >> 1] = convolution(fs[j], fs[j + 1]);\n\t\t}\n\t\tif (i & 1) fs[(i - 1) >> 1] = fs[i - 1];\n\t}\n\n\treturn fs[0];\n}\n#endif\n\ntemplate<typename T> using prique = priority_queue<T>;\ntemplate<typename T> using prique_inv = priority_queue<T, vector<T>, greater<T>>;\ntemplate<typename T> inline istream& operator>>(istream& is, vector<T>& v) { for (auto&& e : v) is >> e; return is; }\ntemplate<typename T> inline istream& operator>>(istream& is, complex<T>& c) {\n\tdouble real, imag;\n\tis >> real >> imag;\n\tc.real(real);\n\tc.imag(imag);\n\treturn is;\n}\ntemplate<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) {\n\tfor (auto itr = v.begin(), end_itr = v.end(); itr != end_itr;) {\n\t\tos << *itr;\n\t\tif (++itr != end_itr) os << \" \";\n\t}\n\treturn os;\n}\ntemplate<typename T, typename U> inline bool chmin(T& a, const U b) { return a > b ? a = b, true : false; }\ntemplate<typename T, typename U> inline bool chmax(T& a, const U b) { return a < b ? a = b, true : false; }\ntemplate<typename T, typename U> inline istream& operator>>(istream& is, pair<T, U>& rhs) { return is >> rhs.first >> rhs.second; }\ntemplate<typename T, typename U> inline ostream& operator<<(ostream& os, const pair<T, U>& rhs) { return os << \"{\" << rhs.first << \", \" << rhs.second << \"}\"; }\ntemplate<typename T, typename U, class Pr> inline int getid(const vector<T>& v, const U& value, Pr pred) { return lower_bound(v.begin(), v.end(), value, pred) - v.begin(); }\ntemplate<typename T, typename U> inline int getid(const vector<T>& v, const U& value) { return getid(v, value, less<>{}); }\n\ntemplate<typename T> T gcd(const vector<T>& vec) {\n\tT res = vec.front();\n\tfor (T e : vec) {\n\t\tres = gcd(res, e);\n\t\tif (res == 1) return 1;\n\t}\n\treturn res;\n}\ntemplate<typename T> T gcd(initializer_list<T> init) {\n\tauto first = init.begin(), last = init.end();\n\tT res = *(first++);\n\tfor (auto itr = first; itr != last; ++itr) {\n\t\tres = gcd(res, *itr);\n\t\tif (res == 1) return 1;\n\t}\n\treturn res;\n}\ntemplate<typename T> T lcm(const vector<T>& vec) {\n\tT res = vec.front();\n\tfor (T e : vec) res = lcm(res, e);\n\treturn res;\n}\ntemplate<typename T> T lcm(initializer_list<T> init) {\n\tauto first = init.begin(), last = init.end();\n\tT res = *(first++);\n\tfor (auto itr = first; itr != last; ++itr) {\n\t\tres = lcm(res, *itr);\n\t}\n\treturn res;\n}\n\ninline void YesNo(bool b) { printf(b ? \"Yes\\n\" : \"No\\n\"); }\n\ntemplate<typename T>\nT rand(T l, T r) {\n\tstatic mt19937 mt(random_device{}());\n\tif constexpr (is_integral_v<T>) {\n\t\tuniform_int_distribution<T> dist(l, r);\n\t\treturn dist(mt);\n\t}\n\telse if constexpr (is_floating_point_v<T>) {\n\t\tuniform_real_distribution<T> dist(l, r);\n\t\treturn dist(mt);\n\t}\n}\n\nbool is_prime(lint x) {\n\tfor (lint i = 2; i * i <= x; ++i) {\n\t\tif (x % i == 0) return false;\n\t}\n\treturn 1 < x;\n}\n\nvector<lint> divisors(lint n) {\n\tvector<lint> res;\n\tfor (lint x = 1; x * x <= n; ++x) {\n\t\tif (n % x == 0) {\n\t\t\tres.push_back(x);\n\t\t\tif (x * x != n) res.push_back(n / x);\n\t\t}\n\t}\n\treturn res;\n}\n\nlint phi(lint n) {\n\tlint r = n;\n\tfor (lint i = 2; i * i <= n; ++i) {\n\t\tif (n % i == 0) {\n\t\t\tr -= r / i;\n\t\t\twhile (n % i == 0) n /= i;\n\t\t}\n\t}\n\tif (n > 1) r -= r / n;\n\treturn r;\n}\n\nlint floor_sqrt(lint n) {\n\tif (n == 0 || n == 1) return n;\n\tlint x0 = 1LL << ((65 - countl_zero(static_cast<uint64_t>(n))) >> 1);\n\tlint x1 = (x0 + n / x0) >> 1;\n\twhile (x1 < x0) {\n\t\tx0 = x1;\n\t\tx1 = (x0 + n / x0) >> 1;\n\t}\n\treturn x0;\n}\nlint ceil_sqrt(lint n) {\n\tconst lint f = floor_sqrt(n);\n\tif (f * f == n) return f;\n\treturn f + 1;\n}\n\ntemplate<typename T>\nconstexpr bool is_intersect(T l1, T r1, T l2, T r2) {\n\treturn l1 <= r2 && l2 <= r1;\n}\n\nlint modinv(lint a, lint m = Mod) {\n\tlint b = m, u = 1, v = 0;\n\twhile (b != 0) {\n\t\tlint t = a / b;\n\t\ta -= t * b; swap(a, b);\n\t\tu -= t * v; swap(u, v);\n\t}\n\tu %= m;\n\tif (u < 0) u += m;\n\treturn u;\n}\nlint modpow(lint x, lint n, lint m = Mod) {\n\tif (m == 1) return 0;\n\tlint res = 1;\n\tx %= m;\n\twhile (n > 0) {\n\t\tif (n & 1) res = res * x % m;\n\t\tx = x * x % m;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\nlint intpow(lint x, lint n) {\n\tlint res = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) res *= x;\n\t\tx *= x;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\ntemplate<typename T>\nclass Binomial {\nprivate:\n\tvector<T> fact, inv, fact_inv;\n\npublic:\n\texplicit Binomial() = default;\n\n\tvoid build(int n) {\n\t\tfact.resize(n + 1);\n\t\tinv.resize(n + 1);\n\t\tfact_inv.resize(n + 1);\n\n\t\tfact[0] = fact[1] = 1;\n\t\tfact_inv[0] = fact_inv[1] = 1;\n\t\tinv[1] = 1;\n\n\t\tfor (int i = 2; i <= n; ++i) {\n\t\t\tfact[i] = i * fact[i - 1];\n\t\t\tinv[i] = Mod - Mod / i * inv[Mod % i];\n\t\t\tfact_inv[i] = fact_inv[i - 1] * inv[i];\n\t\t}\n\t}\n\n\tT comb(int n, int r) const {\n\t\tif (n < 0 || r < 0 || n < r) return 0;\n\t\tif (r == 0 || r == n) return 1;\n\t\treturn fact[n] * fact_inv[n - r] * fact_inv[r];\n\t}\n\n\tT perm(int n, int r) const {\n\t\tif (n < 0 || r < 0 || n < r) return 0;\n\t\treturn fact[n] * fact_inv[n - r];\n\t}\n\n\tT multi(int n, int r) const {\n\t\tif (n == 0 && r == 0) return 1;\n\t\tif (n < 0 || r < 0) return 0;\n\t\treturn r == 0 ? 1 : comb(n + r - 1, r);\n\t}\n};\n\ntemplate<typename T>\nvector<T> compressed(vector<T> v) {\n\tsort(v.begin(), v.end());\n\tv.erase(unique(v.begin(), v.end()), v.end());\n\treturn v;\n}\n\ntemplate<typename T>\nvector<int> compressed_index(vector<T> v) {\n\tconst int n = v.size();\n\tconst auto c = compressed(v);\n\tvector<int> res(n);\n\tfor (int i = 0; i < n; ++i) {\n\t\tres[i] = lower_bound(all(c), v[i]) - c.begin();\n\t}\n\treturn res;\n}\n\n// { value, count }\ntemplate<typename T>\npair<vector<T>, vector<int>> compressed_pair(vector<T> v) {\n\tsize_t n = v.size();\n\tsort(all(v));\n\tvector<T> cnt, val;\n\tcnt.reserve(n); val.reserve(n);\n\tint now_cnt = 1;\n\tfor (size_t i = 1; i < n; ++i) {\n\t\tif (v[i - 1] != v[i]) {\n\t\t\tcnt.push_back(now_cnt);\n\t\t\tval.push_back(v[i - 1]);\n\t\t\tnow_cnt = 1;\n\t\t}\n\t\telse ++now_cnt;\n\t}\n\tcnt.push_back(now_cnt);\n\tval.push_back(v.back());\n\n\treturn { val, cnt };\n}\n\nclass Factring {\nprivate:\n\n\tconst lint max_n;\n\tvector<lint> sieve;\n\npublic:\n\n\texplicit Factring(lint max_n)\n\t\t: max_n(max_n)\n\t\t, sieve(max_n + 1)\n\t{\n\t\tiota(sieve.begin(), sieve.end(), 0);\n\n\t\tfor (lint i = 2; i * i <= max_n; ++i) {\n\t\t\tif (sieve[i] < i) continue;\n\n\t\t\tfor (lint j = i * i; j <= max_n; j += i) {\n\t\t\t\tif (sieve[j] == j) sieve[j] = i;\n\t\t\t}\n\t\t}\n\t}\n\n\tunordered_map<lint, int> calc(lint x) const {\n\t\tunordered_map<lint, int> res;\n\t\twhile (x > 1) {\n\t\t\t++res[sieve[x]];\n\t\t\tx /= sieve[x];\n\t\t}\n\t\treturn res;\n\t}\n};\n\nstruct UnionFind {\n\tint n;\n\tvector<int> par, rank, siz, es;\n\tint c;\n\n\tUnionFind() = default;\n\n\texplicit UnionFind(int _n)\n\t\t: n(_n)\n\t\t, par(_n)\n\t\t, rank(_n)\n\t\t, siz(_n, 1)\n\t\t, es(_n)\n\t\t, c(_n)\n\t{\n\t\tiota(par.begin(), par.end(), 0);\n\t}\n\n\tint root(int x) {\n\t\twhile (par[x] != x) {\n\t\t\tx = par[x] = par[par[x]];\n\t\t}\n\n\t\treturn x;\n\t}\n\n\tbool same(int x, int y) { return root(x) == root(y); }\n\n\tvoid unite(int x, int y) {\n\t\tx = root(x); y = root(y);\n\t\tif (x == y) ++es[x];\n\t\telse {\n\t\t\tc--;\n\t\t\tif (rank[x] < rank[y]) {\n\t\t\t\tpar[x] = y;\n\t\t\t\tsiz[y] += siz[x];\n\t\t\t\tes[y] += es[x] + 1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tpar[y] = x;\n\t\t\t\tif (rank[x] == rank[y]) ++rank[x];\n\t\t\t\tsiz[x] += siz[y];\n\t\t\t\tes[x] += es[y] + 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tint count(int x) { return siz[root(x)]; }\n\n\tvector<vector<int>> groups() {\n\t\tvector<int> roots(n), group_size(n);\n\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\troots[i] = root(i);\n\t\t\t++group_size[roots[i]];\n\t\t}\n\n\t\tvector<vector<int>> res(n);\n\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tres.reserve(group_size[i]);\n\t\t}\n\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tres[roots[i]].push_back(i);\n\t\t}\n\n\t\tres.erase(\n\t\t\tremove_if(res.begin(), res.end(),\n\t\t\t\t[](const vector<int>& v) { return v.empty(); }),\n\t\t\tres.end()\n\t\t);\n\n\t\treturn res;\n\t}\n};\n\ntemplate<typename T>\nclass CumulativeSum2D {\nprivate:\n\n\tvector<vector<T>> dat;\n\npublic:\n\n\tCumulativeSum2D() = default;\n\n\texplicit CumulativeSum2D(size_t n) : dat(n + 1, vector<T>(n + 1)) {}\n\n\tCumulativeSum2D(size_t h, size_t w) : dat(h + 1, vector<T>(w + 1)) {}\n\n\tCumulativeSum2D(const vector<vector<T>>& vec) {\n\t\tconst size_t h = vec.size(), w = vec.front().size();\n\n\t\tdat.resize(h + 1, vector<T>(w + 1));\n\n\t\tfor (size_t i = 0; i < h; ++i) {\n\t\t\tfor (size_t j = 0; j < w; ++j) {\n\t\t\t\tdat[i + 1][j + 1] = dat[i][j + 1] + dat[i + 1][j] - dat[i][j] + vec[i][j];\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid add(int h, int w, int v) {\n\t\tdat[h + 1][w + 1] += v;\n\t}\n\n\tvoid build() {\n\t\tconst size_t h = dat.size() - 1, w = dat.front().size() - 1;\n\t\tfor (size_t i = 0; i < h; ++i) {\n\t\t\tfor (size_t j = 0; j < w; ++j) {\n\t\t\t\tdat[i + 1][j + 1] = dat[i][j + 1] + dat[i + 1][j] - dat[i][j];\n\t\t\t}\n\t\t}\n\t}\n\n\t// [0, h) x [0, w)\n\tT sum(int h, int w) const {\n\t\treturn sum(0, 0, h, w);\n\t}\n\n\t// [h1, h2) x [w1, w2)\n\tT sum(int h1, int w1, int h2, int w2) const {\n\t\treturn dat[h2][w2] - dat[h1][w2] - dat[h2][w1] + dat[h1][w1];\n\t}\n};\n\ntemplate<typename T>\nclass BinaryIndexedTree {\nprivate:\n\n\tint n;\n\tvector<T> dat;\n\npublic:\n\tBinaryIndexedTree() = default;\n\n\texplicit BinaryIndexedTree(const int size)\n\t\t: n(size)\n\t\t, dat(size + 1) {}\n\n\texplicit BinaryIndexedTree(const vector<T>& vec)\n\t\t: n(vec.size())\n\t\t, dat(n + 1)\n\t{\n\t\tfor (int i = 0; i < n; ++i) dat[i + 1] = vec[i];\n\t\tfor (int i = 1; i <= n; ++i) {\n\t\t\tconst int j = i + (i & -i);\n\t\t\tif (j <= n) dat[j] += dat[i];\n\t\t}\n\t}\n\n\t// 0-indexed\n\tvoid add(const int a, const T v) {\n\t\tfor (int x = a + 1; x <= n; x += (x & -x)) dat[x] += v;\n\t}\n\n\t// 0-indexed\n\tvoid set(const int a, const T v) {\n\t\tadd(a, v - get(a));\n\t}\n\n\tvoid reset() { fill(dat.begin(), dat.end(), T(0)); }\n\n\t// [0, a)\n\tT sum(const int a) const {\n\t\tT res = 0;\n\t\tfor (int x = a; x > 0; x -= x & -x) res += dat[x];\n\t\treturn res;\n\t}\n\n\t// [a, b)\n\tT sum(const int a, const int b) const { return sum(b) - sum(a); }\n\n\tT get(const int i) const { return sum(i, i + 1); }\n\n\t// min i s.t. sum(i) >= w\n\tint lower_bound(T w) const {\n\t\tint x = 0, r = 1;\n\t\twhile (r < n) r <<= 1;\n\t\tfor (int i = r; i > 0; i >>= 1) {\n\t\t\tif (x + i <= n && dat[x + i] < w) {\n\t\t\t\tw -= dat[x + i];\n\t\t\t\tx += i;\n\t\t\t}\n\t\t}\n\t\treturn x + 1;\n\t}\n\t// min i s.t. sum(i) > w\n\tint upper_bound(T w) const {\n\t\tint x = 0, r = 1;\n\t\twhile (r < n) r <<= 1;\n\t\tfor (int i = r; i > 0; i >>= 1) {\n\t\t\tif (x + i <= n && dat[x + i] <= w) {\n\t\t\t\tw -= dat[x + i];\n\t\t\t\tx += i;\n\t\t\t}\n\t\t}\n\t\treturn x + 1;\n\t}\n};\n\nstruct Point {\n\tlint x, y;\n\n\tPoint() = default;\n\tconstexpr Point(lint x_, lint y_) : x(x_), y(y_) {}\n\n\tconstexpr bool operator==(const Point& p) const { return x == p.x && y == p.y; }\n\tconstexpr bool operator<(const Point& p) const {\n\t\tif (x != p.x) return x < p.x;\n\t\treturn y < p.y;\n\t}\n\n\tconstexpr Point operator+() const { return *this; }\n\tconstexpr Point operator-() const { return { -x, -y }; }\n\tconstexpr Point operator+(const Point& p) const { return { x + p.x, y + p.y }; }\n\tconstexpr Point operator-(const Point& p) const { return { x - p.x, y - p.y }; }\n\tconstexpr Point operator*(lint s) const { return { x * s, y * s }; }\n\tconstexpr Point& operator+=(const Point& p) {\n\t\tx += p.x; y += p.y;\n\t\treturn *this;\n\t}\n\tconstexpr Point& operator-=(const Point& p) {\n\t\tx -= p.x; y -= p.y;\n\t\treturn *this;\n\t}\n\n\tconstexpr lint dot(const Point& p) const { return x * p.x + y * p.y; }\n\tconstexpr lint cross(const Point& p) const { return x * p.y - y * p.x; }\n\n\tconstexpr lint lengthSq() const { return x * x + y * y; }\n\tdouble length() const { return hypot(x, y); }\n\tconstexpr lint distanceSq(const Point& p) const { return (*this - p).lengthSq(); }\n\tdouble distance(const Point& p) const { return (*this - p).length(); }\n\n\tfriend constexpr Point operator*(lint s, const Point& p) { return p * s; }\n\tfriend istream& operator>>(istream& is, Point& p) { return is >> p.x >> p.y; }\n\tfriend ostream& operator<<(ostream& os, const Point& p) { return os << \"(\" << p.x << \",\" << p.y << \")\"; }\n};\n\ntemplate<typename T, typename U>\nT nearest_value(const vector<T>& v, const U& value) {\n\tauto itr = lower_bound(v.begin(), v.end(), value);\n\tif (itr == v.begin()) return *itr;\n\tif (itr == v.end()) return *prev(itr);\n\treturn min(*itr - value, value - *prev(itr)) + value;\n}\n\ntemplate<class S, S (*op)(S, S), S (*e)()>\nclass SegmentTree2D {\npublic:\n\tSegmentTree2D(int _h, int _w) : SegmentTree2D(vector(_h, vector(_w, e()))) {}\n\n\tSegmentTree2D(vector<vector<S>> a) {\n\t\tint sizH = (int)(a.size()), sizW = (int)(a[0].size());\n\t\tlogH = ceil_log2(sizH), logW = ceil_log2(sizW);\n\t\th = (1 << logH), w = (1 << logW);\n\n\t\tdat.resize((2 * w) * (2 * h), e());\n\t\tfor (int i = 0; i < sizH; ++i) {\n\t\t\tfor (int j = 0; j < sizW; ++j) {\n\t\t\t\tget(i + h, j + w) = a[i][j];\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < h; ++i) {\n\t\t\tfor (int j = w - 1; j > 0; --j) {\n\t\t\t\tupdateW(i + h, j);\n\t\t\t}\n\t\t}\n\t\tfor (int j = 1; j < 2 * w; ++j) {\n\t\t\tfor (int k = h - 1; k > 0; --k) {\n\t\t\t\tupdateH(j, k);\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid set(int i, int j, S x) {\n\t\ti += h; j += w;\n\t\tget(i, j) = x;\n\t\tfor (j >>= 1; j > 0; j >>= 1) {\n\t\t\tupdateW(i, j);\n\t\t\tfor (int k = (i >>= 1); k > 0; k >>= 1) {\n\t\t\t\tupdateH(j, k);\n\t\t\t}\n\t\t}\n\t}\n\n\tS prod(int i0, int j0, int i1, int j1) {\n\t\ti0 += h; i1 += h;\n\t\tS sl = e(), sr = e();\n\t\twhile (i0 < i1) {\n\t\t\tif (i0 & 1) sl = op(sl, prodW(i0++, j0, j1));\n\t\t\tif (i1 & 1) sr = op(prodW(--i1, j0, j1), sr);\n\t\t\ti0 >>= 1; i1 >>= 1;\n\t\t}\n\t\treturn op(sl, sr);\n\t}\n\n\tS at(int i, int j) { return get(i + h, j + w); }\n\nprivate:\n\tint h, w, logH, logW;\n\tvector<S> dat;\n\n\tint ceil_log2(int x) {\n\t\tint res = 0;\n\t\twhile ((1 << res) < x) ++res;\n\t\treturn res;\n\t}\n\n\tS& get(int i, int j) { return dat[(2 * w) * i + j]; }\n\n\tvoid updateW(int i, int j) {\n\t\tget(i, j) = op(get(i, 2 * j), get(i, 2 * j + 1));\n\t}\n\tvoid updateH(int j, int k) {\n\t\tget(k, j) = op(get(2 * k, j), get(2 * k + 1, j));\n\t}\n\n\tS prodW(int k, int l, int r) {\n\t\tl += w; r += w;\n\t\tS sl = e(), sr = e();\n\t\twhile (l < r) {\n\t\t\tif (l & 1) sl = op(sl, get(k, l++));\n\t\t\tif (r & 1) sr = op(get(k, --r), sr);\n\t\t\tl >>= 1; r >>= 1;\n\t\t}\n\t\treturn op(sl, sr);\n\t}\n};\n\nint op(int x, int y) { return min(x, y); }\nint e() { return INT_MAX; }\n\nint main() {\n\twhile (true) {\n\t\tint r, c, q;\n\t\tcin >> r >> c >> q;\n\n\t\tif (r == 0 && c == 0 && q == 0) break;\n\n\t\tvector a(r, vector<int>(c));\n\t\trep(i, r) {\n\t\t\trep(j, c) {\n\t\t\t\tcin >> a[i][j];\n\t\t\t}\n\t\t}\n\n\t\tSegmentTree2D<int, op, e> seg2d(a);\n\n\t\twhile (q--) {\n\t\t\tint r1, c1, r2, c2;\n\t\t\tcin >> r1 >> c1 >> r2 >> c2;\n\t\t\tcout << seg2d.prod(r1, c1, r2 + 1, c2 + 1) << \"\\n\";\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 128792,
"score_of_the_acc": -1.0072,
"final_rank": 15
},
{
"submission_id": "aoj_1068_9044879",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\n#include <iomanip>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\ntemplate<class T>\nstruct tdsegtree {\n int n, m;\n vector<vector<T>> d;\n const T e = 1e18;\n\n tdsegtree(int n_ = 1, int m_ = 1) {\n n = 1, m = 1;\n while (n < n_) n <<= 1;\n while (m < m_) m <<= 1;\n d.resize(2 * n - 1, vector<T>(2 * m - 1));\n }\n\n T op(T x, T y) { return min(x, y); }\n\n void add(int i, int j, T x) {\n int idxi = i + n - 1;\n int idxj = j + m - 1;\n d[idxi][idxj] += x;\n\n while (idxi) {\n idxi = (idxi - 1) / 2;\n d[idxi][idxj] = op(d[2 * idxi + 1][idxj], d[2 * idxi + 2][idxj]);\n }\n\n idxi = i + n - 1;\n while (idxj) {\n idxj = (idxj - 1) / 2;\n d[idxi][idxj] = op(d[idxi][2 * idxj + 1], d[idxi][2 * idxj + 2]);\n }\n\n while (idxi) {\n idxi = (idxi - 1) / 2;\n idxj = j + m - 1;\n while (idxj) {\n idxj = (idxj - 1) / 2;\n d[idxi][idxj] = op(d[idxi][2 * idxj + 1], d[idxi][2 * idxj + 2]);\n }\n }\n }\n\n void update(int i, int j, T x) {\n int idxi = i + n - 1;\n int idxj = j + m - 1;\n d[idxi][idxj] = x;\n \n while (idxi) {\n idxi = (idxi - 1) / 2;\n d[idxi][idxj] = op(d[2 * idxi + 1][idxj], d[2 * idxi + 2][idxj]);\n }\n\n idxi = i + n - 1;\n while (idxj) {\n idxj = (idxj - 1) / 2;\n d[idxi][idxj] = op(d[idxi][2 * idxj + 1], d[idxi][2 * idxj + 2]);\n }\n\n while (idxi) {\n idxi = (idxi - 1) / 2;\n idxj = j + m - 1;\n while (idxj) {\n idxj = (idxj - 1) / 2;\n d[idxi][idxj] = op(d[idxi][2 * idxj + 1], d[idxi][2 * idxj + 2]);\n } \n }\n }\n\n T get(int x1, int y1, int x2, int y2) {\n return get_sub(x1, x2, y1, y2, 0, 0, n, 0, 0, m);\n }\n\n T get_sub(int li, int ri, int lj, int rj, int idxi, int oki, int ngi, int idxj, int okj, int ngj) {\n if (ngi <= li || ri <= oki || ngj <= lj || rj <= okj) return e;\n if (li <= oki && ngi <= ri) {\n if (lj <= okj && ngj <= rj) return d[idxi][idxj];\n int midj = (okj + ngj) / 2;\n T vl = get_sub(li, ri, lj, rj, idxi, oki, ngi, 2 * idxj + 1, okj, midj);\n T vr = get_sub(li, ri, lj, rj, idxi, oki, ngi, 2 * idxj + 2, midj, ngj);\n return op(vl, vr);\n }\n int midi = (oki + ngi) / 2;\n T vl = get_sub(li, ri, lj, rj, 2 * idxi + 1, oki, midi, idxj, okj, ngj);\n T vr = get_sub(li, ri, lj, rj, 2 * idxi + 2, midi, ngi, idxj, okj, ngj);\n return op(vl, vr);\n }\n};\n\n\nvoid solve() {\n\n}\n\nint main()\n{\n int r, c, q;\n int r1, c1, r2, c2;\n ll g;\n while (cin >> r >> c >> q) {\n if ((ll)r * c * q == 0) break;\n\n tdsegtree<ll> tdseg(r, c);\n rep(i, r) rep(j, c) {\n cin >> g;\n tdseg.update(i, j, g);\n }\n while (q--) {\n cin >> r1 >> c1 >> r2 >> c2;\n cout << tdseg.get(r1, c1, r2 + 1, c2 + 1) << endl;;\n }\n }\n \n \n return 0;\n}",
"accuracy": 1,
"time_ms": 460,
"memory_kb": 117636,
"score_of_the_acc": -1.0417,
"final_rank": 16
},
{
"submission_id": "aoj_1068_8230946",
"code_snippet": "#line 2 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\nusing namespace std;\n\n#include<bits/stdc++.h>\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp\"\nnamespace noya2 {\n\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const pair<T, U> &p){\n os << p.first << \" \" << p.second;\n return os;\n}\ntemplate <typename T, typename U>\nistream &operator>>(istream &is, pair<T, U> &p){\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<T> &v){\n int s = (int)v.size();\n for (int i = 0; i < s; i++) os << (i ? \" \" : \"\") << v[i];\n return os;\n}\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v){\n for (auto &x : v) is >> x;\n return is;\n}\n\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &...u){\n cin >> t;\n in(u...);\n}\n\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U, char sep = ' '>\nvoid out(const T &t, const U &...u){\n cout << t;\n if (sizeof...(u)) cout << sep;\n out(u...);\n}\n\ntemplate<typename T>\nvoid out(const vector<vector<T>> &vv){\n int s = (int)vv.size();\n for (int i = 0; i < s; i++) out(vv[i]);\n}\n\nstruct IoSetup {\n IoSetup(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetup_noya2;\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/const.hpp\"\nnamespace noya2{\n\nconst int iinf = 1'000'000'007;\nconst long long linf = 2'000'000'000'000'000'000LL;\nconst long long mod998 = 998244353;\nconst long long mod107 = 1000000007;\nconst long double pi = 3.14159265358979323;\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\n\nvoid yes(){ cout << \"Yes\\n\"; }\nvoid no(){ cout << \"No\\n\"; }\nvoid YES(){ cout << \"YES\\n\"; }\nvoid NO(){ cout << \"NO\\n\"; }\nvoid yn(bool t){ t ? yes() : no(); }\nvoid YN(bool t){ t ? YES() : NO(); }\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\nnamespace noya2{\n\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\n if (a == 0 || b == 0) return a + b;\n int n = __builtin_ctzll(a); a >>= n;\n int m = __builtin_ctzll(b); b >>= m;\n while (a != b) {\n int mm = __builtin_ctzll(a - b);\n bool f = a > b;\n unsigned long long c = f ? a : b;\n b = f ? b : a;\n a = (c - b) >> mm;\n }\n return a << min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\n\nlong long sqrt_fast(long long n) {\n if (n <= 0) return 0;\n long long x = sqrt(n);\n while ((x + 1) * (x + 1) <= n) x++;\n while (x * x > n) x--;\n return x;\n}\n\ntemplate<typename T> T floor_div(const T n, const T d) {\n assert(d != 0);\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\n}\n\ntemplate<typename T> T ceil_div(const T n, const T d) {\n assert(d != 0);\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\n}\n\ntemplate<typename T> void uniq(vector<T> &v){\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\n\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\n\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\n\n} // namespace noya2\n#line 8 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\n\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\n#define all(v) (v).begin(),(v).end()\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\n\n\n#line 2 \"c.cpp\"\n\n#line 2 \"/Users/noya2/Desktop/Noya2_library/data_structure/segment_tree_2d.hpp\"\n\n#line 4 \"/Users/noya2/Desktop/Noya2_library/data_structure/segment_tree_2d.hpp\"\n\nnamespace noya2{\n\ntemplate<class S, S(*op)(S, S), S(*e)()>\nstruct segtree_2d {\n int h, w;\n segtree_2d (int h_ = 0, int w_ = 0) : segtree_2d(std::vector<std::vector<S>>(h_,vector<S>(w_,e()))) {}\n segtree_2d (const std::vector<std::vector<S>> &vec){\n assert(!vec.empty());\n int h_ = vec.size(); h = 1; while(h < h_) h <<= 1;\n int w_ = vec[0].size(); w = 1; while(w < w_) w <<= 1;\n d.assign(h*w*4,e());\n for (int i = 0; i < (int)(vec.size()); i++) for (int j = 0; j < (int)(vec[i].size()); j++) d[id(i+h,j+w)] = vec[i][j];\n for (int i = 0; i < h; i++) for (int j = w-1; j > 0; j--) update_y(i+h,j);\n for (int i = h-1; i > 0; i--) for (int j = 1; j < 2*w; j++) update_x(i,j);\n }\n void assign(int p, int q, S v){\n d[id(p+h,q+w)] = v;\n }\n void set(int p, int q, S v){\n p += h, q += w;\n d[id(p,q)] = v;\n for (int j = q>>1; j > 0; j >>= 1) update_y(p,j);\n for ( ; q > 0; q >>= 1) for (int i = p>>1; i > 0; i >>= 1) update_x(i,q);\n }\n S prod(int lp, int rp, int lq, int rq){\n if (lp >= rp || lq >= rq) return e();\n S res = e();\n lp += h, rp += h, lq += w, rq += w;\n for ( ; lp < rp; lp >>= 1, rp >>= 1){\n if (lp & 1) res = op(res,inner_prod(lp++,lq,rq));\n if (rp & 1) res = op(res,inner_prod(--rp,lq,rq));\n }\n return res;\n }\n S get(int p, int q){\n p += h, q += w;\n return d[id(p,q)];\n }\n int id(int p, int q){ return p * 2 * w + q; }\n void update_x(int p, int q){ d[id(p,q)] = op(d[id(2*p,q)],d[id(2*p+1,q)]); }\n void update_y(int p, int q){ d[id(p,q)] = op(d[id(p,2*q)],d[id(p,2*q+1)]); }\n S inner_prod(int p, int lq, int rq){\n S res = e();\n for ( ; lq < rq; lq >>= 1, rq >>= 1){\n if (lq & 1) res = op(res,d[id(p,lq++)]);\n if (rq & 1) res = op(res,d[id(p,--rq)]);\n }\n return res;\n }\n std::vector<S> d;\n};\n\n} // namespace noya2\n#line 4 \"c.cpp\"\n\nint op(int a, int b){\n return min(a,b);\n}\nint e(){\n return numeric_limits<int>::max();\n}\n\nvoid solve1(int h, int w, int q){\n vector<vector<int>> a(h,vector<int>(w)); in(a);\n segtree_2d<int,op,e> seg(a);\n while (q--){\n int lx, rx, ly, ry; in(lx,ly,rx,ry); rx++, ry++;\n out(seg.prod(lx,rx,ly,ry));\n }\n}\n\nvoid solve(){\n while(true){\n int h, w, q; in(h,w,q);\n if (h == 0) break;\n solve1(h,w,q);\n }\n}\n\nint main(){\n int t = 1; //in(t);\n while (t--) { solve(); }\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 73992,
"score_of_the_acc": -0.5528,
"final_rank": 4
},
{
"submission_id": "aoj_1068_7990011",
"code_snippet": "#line 1 \"a.cpp\"\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstddef>\n#include <cstdint>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <optional>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\n/* macro */\n\n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\n#define rrep(i, a, n) for (int i = ((int)(n)-1); i >= (int)(a); i--)\n#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)\n#define RRep(i, a, n) for (i64 i = ((i64)(n)-i64(1)); i >= (i64)(a); i--)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n\n/* macro end */\n\n/* template */\n\nnamespace ebi {\n\n#ifdef LOCAL\n#define debug(...) \\\n std::cerr << \"LINE: \" << __LINE__ << \" [\" << #__VA_ARGS__ << \"]:\", \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n\nvoid debug_out() {\n std::cerr << std::endl;\n}\n\ntemplate <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {\n std::cerr << \" \" << h;\n if (sizeof...(t) > 0) std::cerr << \" :\";\n debug_out(t...);\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {\n return os << pa.first << \" \" << pa.second;\n}\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {\n return os >> pa.first >> pa.second;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {\n for (std::size_t i = 0; i < vec.size(); i++)\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n return os;\n}\n\ntemplate <typename T>\nstd::istream &operator>>(std::istream &os, std::vector<T> &vec) {\n for (T &e : vec) std::cin >> e;\n return os;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {\n if (opt) {\n os << opt.value();\n } else {\n os << \"invalid value\";\n }\n return os;\n}\n\nusing std::size_t;\nusing i32 = std::int32_t;\nusing u32 = std::uint32_t;\nusing i64 = std::int64_t;\nusing u64 = std::uint64_t;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\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}\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T> T pow(T x, i64 n) {\n T res = 1;\n while (n > 0) {\n if (n & 1) res = res * x;\n x = x * x;\n n >>= 1;\n }\n return res;\n}\n\ntemplate <class T> struct Edge {\n int to;\n T cost;\n Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}\n};\n\ntemplate <class T> struct Graph : std::vector<std::vector<Edge<T>>> {\n using std::vector<std::vector<Edge<T>>>::vector;\n void add_edge(int u, int v, T w, bool directed = false) {\n (*this)[u].emplace_back(v, w);\n if (directed) return;\n (*this)[v].emplace_back(u, w);\n }\n};\n\nstruct graph : std::vector<std::vector<int>> {\n using std::vector<std::vector<int>>::vector;\n void add_edge(int u, int v, bool directed = false) {\n (*this)[u].emplace_back(v);\n if (directed) return;\n (*this)[v].emplace_back(u);\n }\n};\n\nconstexpr i64 LNF = std::numeric_limits<i64>::max() / 4;\n\nconstexpr int INF = std::numeric_limits<int>::max() / 2;\n\nconst std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};\nconst std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};\n\n} // namespace ebi\n\n#line 2 \"data_structure/segtree.hpp\"\n\n#line 5 \"data_structure/segtree.hpp\"\n\nnamespace ebi {\n\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n private:\n int n;\n int sz;\n std::vector<S> data;\n\n void update(int i) {\n data[i] = op(data[2 * i], data[2 * i + 1]);\n }\n\n public:\n segtree(int n) : segtree(std::vector<S>(n, e())) {}\n segtree(const std::vector<S> &v) : n((int)v.size()), sz(1) {\n while (sz < n) sz *= 2;\n data = std::vector<S>(2 * sz, e());\n for (int i = 0; i < n; i++) {\n data[sz + i] = v[i];\n }\n for (int i = sz - 1; i >= 1; i--) update(i);\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < n);\n p += sz;\n data[p] = x;\n while (p > 1) {\n p >>= 1;\n update(p);\n }\n }\n\n S get(int p) const {\n assert(0 <= p && p < n);\n return data[p + sz];\n }\n\n S prod(int l, int r) const {\n assert(0 <= l && l <= r && r <= n);\n S sml = e(), smr = e();\n l += sz;\n r += sz;\n while (l < r) {\n if (l & 1) sml = op(sml, data[l++]);\n if (r & 1) smr = op(data[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n return op(sml, smr);\n }\n\n S all_prod() const {\n return data[1];\n }\n\n template <class F> int max_right(int l, F f) const {\n assert(0 <= l && l < n);\n assert(f(e()));\n if (l == n) return n;\n l += sz;\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!f(op(sm, data[l]))) {\n while (l < sz) {\n l = 2 * l;\n if (f(op(sm, data[l]))) {\n sm = op(sm, data[l]);\n l++;\n }\n }\n return l - sz;\n }\n sm = op(sm, data[l]);\n l++;\n } while ((l & -l) != l);\n return n;\n }\n\n template <class F> int min_left(int r, F f) const {\n assert(0 <= r && r <= n);\n assert(f(e()));\n if (r == 0) return 0;\n r += sz;\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!f(op(data[r], sm))) {\n while (r < sz) {\n r = 2 * r + 1;\n if (f(op(data[r], sm))) {\n sm = op(data[r], sm);\n r--;\n }\n }\n return r + 1 - sz;\n }\n sm = op(data[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n S operator[](int p) const {\n return data[sz + p];\n }\n};\n\n} // namespace ebi\n#line 166 \"a.cpp\"\n\nnamespace ebi {\n\ntemplate <class S, S (*op)(S, S), S (*e)(), class data_structure>\nstruct segtree_2d {\n private:\n public:\n segtree_2d(int h, int w) : h(h), w(w), sz(1) {\n while (sz < h) sz <<= 1;\n data = std::vector<data_structure>(2 * sz, data_structure(w));\n }\n\n void set(int i, int j, S x) {\n i += sz;\n data[i].set(j, x);\n while (i > 1) {\n i >>= 1;\n S val = op(data[2 * i].get(j), data[2 * i + 1].get(j));\n data[i].set(j, val);\n }\n }\n\n S get(int i, int j) const {\n assert(0 <= i && i < h && 0 <= j && j < w);\n return data[i + sz].get(j);\n }\n\n S prod(int l, int r, int d, int u) const {\n assert(0 <= l && l <= r && r <= h);\n assert(0 <= d && d <= u && u <= w);\n l += sz;\n r += sz;\n S res = e();\n while (l < r) {\n if (l & 1) res = op(res, data[l++].prod(d, u));\n if (r & 1) res = op(data[--r].prod(d, u), res);\n l >>= 1;\n r >>= 1;\n }\n return res;\n }\n\n private:\n int h, w;\n int sz;\n std::vector<data_structure> data;\n};\n\n} // namespace ebi\n\nnamespace ebi {\n\nint op(int a, int b) {\n return a < b ? a : b;\n}\n\nint e() {\n return std::numeric_limits<int>::max();\n}\n\nvoid main_() {\n int r, c, q;\n while (std::cin >> r >> c >> q, !(r == 0 && c == 0 && q == 0)) {\n if (c == 1) {\n segtree<int, op, e> seg(r);\n rep(i, 0, r) {\n int grid;\n std::cin >> grid;\n seg.set(i, grid);\n }\n while (q--) {\n int l, d, r, u;\n std::cin >> l >> d >> r >> u;\n r++;\n u++;\n int ans = e();\n if(d < u) {\n ans = seg.prod(l, r);\n }\n std::cout << ans << '\\n';\n }\n continue;\n }\n segtree_2d<int, op, e, segtree<int, op, e>> seg2d(r, c);\n rep(i, 0, r) {\n rep(j, 0, c) {\n int grid;\n std::cin >> grid;\n seg2d.set(i, j, grid);\n }\n }\n while (q--) {\n int l, d, r, u;\n std::cin >> l >> d >> r >> u;\n r++;\n u++;\n std::cout << seg2d.prod(l, r, d, u) << '\\n';\n }\n }\n}\n\n} // namespace ebi\n\nint main() {\n std::cout << std::fixed << std::setprecision(15);\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int t = 1;\n // std::cin >> t;\n while (t--) {\n ebi::main_();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 48136,
"score_of_the_acc": -0.3975,
"final_rank": 1
}
] |
aoj_1076_cpp
|
Problem C: Time Manipulation
彼女は見習いの魔法使いだ。
彼女はまず最初に時間を操る魔法を覚えた。
そして彼女は生計を立たせるために酒屋を開くことにした。
彼女の住んでいる国の住人達はみんなお酒が大好き、ということが関係している。
住人達は長い年数をかけて熟成させたお酒が特に好きで、熟成させた年数に応じてその価値も比例して上がる。
50年熟成させたお酒より100年熟成させたお酒のほうが価値が高いのは簡単に想像がつくはずだ。
そして手に入れるのが難しいということも。
彼女は自分の魔法を使って、長い年月熟成させたお酒を一瞬で作って、それを売って収入を得ようとしているのであった。
彼女はお酒を熟成させる年数に応じて値段を決めた。
例えば5年の熟成が必要なら5エメル、100年の熟成なら100エメルを払ってもらうことにした。
彼女にとってはどちらを作るのも同じ魔法を使うだけなので差は無い。
長い年数の熟成の注文の方が彼女にとっては得なのである。
彼女はまだ未熟なので今使える魔法には制約が2つある。
お酒を
n
年より長く熟成させることは今の彼女には出来ない。
また
m
個の整数が存在して、それらとその倍数の年数だけお酒を熟成させることも彼女には無理なのだ。
彼女は酒屋の経営だけ生活が出来るか不安に思っている。
どのくらいの収入を得ることが出来るか彼女には予想できない。
そこで1日の収入の期待値をもとにして、他の仕事をする必要があるかの判断を行うことにした。
幸い彼女は、野菜の栽培、ペットの世話、料理、裁縫、大工仕事など何でもできるので、酒屋での収入が少なくても困ることは無さそうだ。
彼女の1日の収入の期待値を計算するのがあなたの仕事だ。
なお期待値を計算する際に以下の3つを仮定してよい。
1日に引き受ける注文は必ず1つである。
住人は彼女に作れない年数のお酒は注文はしてこない。
住人の注文の年数は一様に分布している。
Input
入力は複数のケースからなる。
各ケースは以下のフォーマットで与えられる。
n
m
p
0
...
p
m-1
住人は
1
以上
n
以下の整数の値の年数だけ熟成させたお酒を依頼してくる。
ただしm個の整数
p
i
とその倍数を依頼してくる人はいない。
入力の終わりは
n
= 0 かつ
m
=0 で与えられる。
各値は以下の条件を満たす
2 ≤
n
≤ 2,000,000,000
1 ≤
m
≤ 20
また
p
i
は
n
を割り切ることが保証されている。
テストケースの数は200以下を超えない。
Output
彼女の一日の収入の期待値を出力せよ。
住人の注文として可能な年数が一つも存在しない場合は0を答えの期待値として出力せよ。
ジャッジが用意した正解の値と1e-5以下の誤差までが正答として許容される。
Sample input
12 3
2 3 6
12 4
1 2 3 6
0 0
Sample output
6.0000000000
0.0000000000
The University of Aizu Programming Contest 2011 Summer
原案、問題文: Tomoya Sakai
|
[
{
"submission_id": "aoj_1076_4079650",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nunsigned long long popcount(unsigned long long x) {\n x = ((x & 0xaaaaaaaaaaaaaaaaUL) >> 1) +\n (x & 0x5555555555555555UL);\n x = ((x & 0xccccccccccccccccUL) >> 2) +\n (x & 0x3333333333333333UL);\n x = ((x & 0xf0f0f0f0f0f0f0f0UL) >> 4) +\n (x & 0x0f0f0f0f0f0f0f0fUL);\n x = ((x & 0xff00ff00ff00ff00UL) >> 8) +\n (x & 0x00ff00ff00ff00ffUL);\n x = ((x & 0xffff0000ffff0000UL) >> 16) +\n (x & 0x0000ffff0000ffffUL);\n x = ((x & 0xffffffff00000000UL) >> 32) +\n (x & 0x00000000ffffffffUL);\n return x;\n}\n\n// calculate |gcd|.\n// if ether num is 0, return 0\nlong long GCD(long long left, long long right) {\n if(left == 0 || right == 0) return 0;\n if(left < 0) left *= -1;\n if(right < 0) right *= -1;\n if(left < right) swap(left, right);\n long long nextnum, ansgcd = -1;\n while(ansgcd == -1) {\n nextnum = left % right;\n if(nextnum == 0) ansgcd = right;\n left = right;\n right = nextnum;\n }\n return ansgcd;\n}\n\nlong long LCM(long long left, long long right) {\n return left / GCD(left, right) * right;\n}\n\nstruct div_moebius {\n long long n, m;\n map<long long, long long> res;\n vector<long long> primes;\n div_moebius() {\n n = m = 0;\n res.clear();\n primes.clear();\n }\n div_moebius(long long newn) {\n div_moebius();\n n = newn;\n for(long long i = 2; i * i <= newn; ++i)\n if(newn % i == 0) {\n primes.push_back(i);\n while(newn % i == 0) newn /= i;\n }\n if(newn != 1) primes.push_back(newn);\n m = primes.size();\n for(long long i = 0; i < (1 << m); ++i) {\n long long mu = 1, d = 1;\n for(long long j = 0; j < m; ++j)\n if(i >> j & 1) {\n mu *= -1;\n d *= primes[j];\n }\n res[d] = mu;\n }\n }\n};\n\nlong long n, m;\nvector<long long> p;\ndiv_moebius dm;\n\nlong double solve();\n\nint main() {\n cout << fixed << setprecision(10);\n while(1) {\n cin >> n >> m;\n if(n + m == 0) break;\n p.resize(m);\n for(int i = 0; i < m; ++i) cin >> p[i];\n cout << solve() << endl;\n }\n return 0;\n}\n\nlong double solve() {\n long double res = (n + 1) * n / 2, cnt = n;\n for(int i = 1; i < (1 << m); ++i) {\n long long now = 1, nowcnt = 0;\n for(int j = 0; j < m; ++j)\n if(i >> j & 1) now = LCM(now, p[j]);\n nowcnt = n / now;\n now *= nowcnt * (nowcnt + 1) / 2;\n if(popcount(i) % 2) {\n cnt -= nowcnt;\n res -= now;\n }\n else {\n cnt += nowcnt;\n res += now;\n }\n }\n if(cnt == 0) return 0;\n return res / cnt;\n}",
"accuracy": 1,
"time_ms": 400,
"memory_kb": 3296,
"score_of_the_acc": -0.4445,
"final_rank": 8
},
{
"submission_id": "aoj_1076_3911768",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <map>\n#include <set>\n#include <math.h>\nusing namespace std;\ntypedef long long int ll;\n\nlong long GCD(long long a, long long b) { return b ? GCD(b, a%b) : a; }\n\nlong long LCM(long long a, long long b) {return a/GCD(a,b)*b;}\n\nint main(){\n\twhile(1){\n\t\tll n,m; cin >> n >> m;\n\t\tif(n==0&&m==0)break;\n\t\tvector<ll>a(m);\n\t\tfor(int i=0;i<m;i++){\n\t\t\tcin >> a[i];\n\t\t}\n\t\tdouble ans=0;\n\t\tll sum=(1+n)*n/2;\n\t\tll cnt=n;\n\t\tfor(int i=1;i<(1<<m);i++){\n\t\t\tint bit_count=0;\n\t\t\tll lc=1;\n\t\t\tfor(int j=0;j<m;j++){\n\t\t\t\tif(i&(1<<j)){\n\t\t\t\t\tbit_count++;\n\t\t\t\t\tlc=LCM(lc,a[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(bit_count%2==1){\n\t\t\t\tsum-=(n/lc+1)*(n/lc)/2*lc;\n\t\t\t\tcnt-=n/lc;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tsum+=(n/lc+1)*(n/lc)/2*lc;\n\t\t\t\tcnt+=n/lc;\n\t\t\t}\n\t\t}\n\t\tif(cnt==0){\n\t\t\tcout << 0 << endl;\n\t\t}\n\t\telse{\n\t\t\tans=(double)sum/cnt;\n\t\t\tprintf(\"%.8f\\n\",ans );\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 380,
"memory_kb": 3196,
"score_of_the_acc": -0.421,
"final_rank": 5
},
{
"submission_id": "aoj_1076_3911642",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#define _GLIBCXX_DEBUG\n#include<bits/stdc++.h>\nusing namespace::std;\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\n// random_device rd;\n// mt19937 mt(rd());\n// #include <boost/numeric/interval.hpp>\n// #include <boost/numeric/interval/io.hpp>\n// #include <boost/intrusive/rbtree.hpp>\n// #include <boost/geometry.hpp>\n// #include <boost/geometry/geometries/linestring.hpp>\n// #include <boost/geometry/geometries/polygon.hpp>\n// #include <boost/geometry/geometries/point_xy.hpp>\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// typedef mp::number<mp::cpp_dec_float<0>> cfloat;\n// typedef mp::cpp_int cint;\n\n#include<ext/pb_ds/assoc_container.hpp>\n#include<ext/pb_ds/tree_policy.hpp>\n#include <ext/pb_ds/priority_queue.hpp>\n#include<ext/pb_ds/tag_and_trait.hpp>\nusing namespace __gnu_pbds;\ntemplate<typename T=long long>using pbds=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;\ntemplate<typename T=long long>using pqueue =__gnu_pbds::priority_queue<T, less<T>,rc_binomial_heap_tag>;\ntypedef long long lint;\ntypedef long long ll;\ntypedef long double ldouble;\ntypedef vector<lint> vec;\ntypedef vector<vector<lint>> mat;\ntypedef vector<vector<vector<lint>>> mat3;\ntypedef vector<double> dvec;\ntypedef vector<vector<double>> dmat;\ntypedef vector<vector<vector<double>>> dmat3;\ntypedef vector<string> svec;\ntypedef vector<vector<string>> smat;\ntypedef vector<vector<vector<string>>> smat3;\ntypedef vector<pair<lint,lint>> pvec;\ntypedef vector<vector<pair<lint,lint>>> pmat;\ntypedef vector<vector<vector<pair<lint,lint>>>> pmat3;\n#define rep(i, n) for(lint i = 0; i < (lint)(n); i++)\n#define irep(i) for(lint i = 0;; i++)\n#define irep1(i) for(lint i = 1;; i++)\n#define irep2(i) for(lint i = 2;; i++)\n#define rrep(i, n) for(lint i = (lint)(n-1); i >-1; i--)\n#define rrepi(i,a,b) for(lint i = (lint)(b-1); i >a-1; i--)\n#define repi(i,a,b) for(lint i=lint(a);i<lint(b);i++)\n#define rep2(i,a,b,c) for(lint i=lint(a);i>lint(b);i+=c)\n#define all(x) (x).begin(),(x).end()\n//#define PI 3.141592653589793\n#define dist(x1,y1,x2,y2) (pow(pow(x2-x1,2)+pow(y2-y1,2),0.5))\n#define output(v) do{bool f=0;for(auto i:v){cout<<(f?\" \":\"\");if(i>INF/2)cout<<\"INF\";else cout<<i;f=1;}cout<<\"\\n\";}while(0)\n#define output2(v) for(auto j:v)output(j);\n#define _output(v) do{bool f=0;rep(i,v.size()){cout<<(f?\" \":\"\");if(v[i]>INF/2)cout<<\"INF\";else cout<<v[i];f=1;}cout<<\"\\n\";}while(0)\n#define _output2(v) rep(j,v.size()){_output(v[j]);}\n#define input(a,n) lint n;cin>>n;vector<lint>a(n);rep(i,n)cin>>a[i];\n#define SUM(v) accumulate(all(v),0LL)\n#define INF (1LL<<60)\n#define IINF (1<<30)\n#define EPS (1e-10)\n#define LINF 9223372036854775807\n#define MOD 998244353\n#define endl \"\\n\"\ntemplate<typename T=lint>T in(){return *istream_iterator<T>(cin);}\ninline lint gcd(lint a,lint b){return b?gcd(b,a%b):a;}\ntemplate<typename T=lint>inline T lcm(T a,T b){return a/gcd(a,b)*b;}\ntemplate<typename T=lint>inline T add(T a,T b){return a+b;}\ntemplate<typename T=lint>inline T minq(T a,T b){return min(a,b);}\ninline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}\ninline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}\nvector<lint> dx={-1,1,0,0,1,1,-1,-1};\nvector<lint> dy={0,0,-1,1,1,-1,1,-1};\n\n\n\nint main(){\n while(1){\n double n;\n lint m;\n cin>>n>>m;\n if(n==0&&m==0)break;\n vec a(m);\n rep(i,m)cin>>a[i];\n double s=n*(n+1)/2,t=n;\n rep(i,1LL<<m){\n lint cnt=0,val=0;\n rep(j,m){\n if(i&1<<j){\n cnt++;\n if(val==0)val=a[j];\n else val=lcm(val,a[j]);\n }\n }\n if(cnt==0)continue;\n if(cnt%2)t-=n/val;\n else t+=n/val;\n if(cnt%2)s-=val*(n/val)*(n/val+1)/2;\n else s+=val*(n/val)*(n/val+1)/2;\n }\n if(t==0)cout<<0<<endl;\n else cout<<s/t<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 350,
"memory_kb": 3260,
"score_of_the_acc": -0.3957,
"final_rank": 4
},
{
"submission_id": "aoj_1076_3911576",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcountll\n\n#define INF 1e16\n#define mod 1000000007\n\n//// gcd\nll gcd(ll a,ll b){\n return b?gcd(b,a%b):a;\n}\n\n//// lcm\nll lcm(ll a,ll b){\n return a*b/gcd(a,b);\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while(1){\n ll n,m;\n vector<ll> a;\n cin>>n>>m;\n if(n==0&&m==0)break;\n a.resize(m);\n rep(i,m)cin>>a[i];\n\n ll num=0,sum=0;\n rep(S,(1<<m)){\n ll p=1;\n rep(i,m){\n if((S>>i)&1){\n p=lcm(p,a[i]);\n }\n }\n ll cnt=n/p;\n ll cnts=cnt*(cnt+1)/2;\n if(bcnt(S)%2==0){\n num+=cnt;\n sum+=p*cnts;\n }else{\n num-=cnt;\n sum-=p*cnts;\n }\n }\n\n if(num>0)printf(\"%.10f\\n\", (double)sum/(double)num);\n else printf(\"0\\n\");\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 380,
"memory_kb": 3228,
"score_of_the_acc": -0.4225,
"final_rank": 6
},
{
"submission_id": "aoj_1076_3814791",
"code_snippet": "#include<iostream>\n#include<iomanip>\n#include<vector>\n#include<climits>\nusing namespace std;\ntypedef long long ll;\n\nll gcd(ll a, ll b){\n return b == 0 ? a : gcd(b, a%b);\n}\n\nll lcm(ll a, ll b){\n return a / gcd(a,b) * b;\n}\n\nint main(){\n ll n, m;\n while(cin >> n >> m, n+m){\n ll cnt = 0, sum = 0, p[m];\n for(int i = 0; i < m; i++) cin >> p[i];\n for(int i = 1; i < 1<<m; i++){\n vector<ll> v;\n for(int j = 0; j < m; j++){\n if((i>>j)&1) v.push_back(p[j]);\n }\n ll val = v[0];\n for(ll j : v){\n val = lcm(val, j);\n }\n int num = v.size();\n if(num%2 == 0) cnt -= n/val, sum -= n/val*(n/val+1)/2*val;\n else if(num%2 == 1) cnt += n/val, sum += n/val*(n/val+1)/2*val;\n }\n cnt = n-cnt;\n sum = n*(n+1)/2-sum;\n if(cnt == 0) sum = 0, cnt = 1;\n cout << fixed << setprecision(12) << (double)sum/cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 700,
"memory_kb": 3260,
"score_of_the_acc": -0.7259,
"final_rank": 11
},
{
"submission_id": "aoj_1076_3814790",
"code_snippet": "#include<iostream>\n#include<iomanip>\n#include<vector>\n#include<climits>\nusing namespace std;\ntypedef long long ll;\n\nll gcd(ll a, ll b){\n return b == 0 ? a : gcd(b, a%b);\n}\n\nll lcm(ll a, ll b){\n ll tmp = a/gcd(a,b);\n // if(b > LLONG_MAX/tmp) return -1;\n return a / gcd(a,b) * b;\n}\n\nint main(){\n ll n, m;\n while(cin >> n >> m, n+m){\n ll cnt = 0, sum = 0, p[m];\n for(int i = 0; i < m; i++) cin >> p[i];\n for(int i = 1; i < 1<<m; i++){\n vector<ll> v;\n for(int j = 0; j < m; j++){\n if((i>>j)&1) v.push_back(p[j]);\n }\n ll val = v[0];\n for(ll j : v){\n if(val == -1) break;\n val = lcm(val, j);\n }\n if(val == -1) continue;\n int num = v.size();\n if(num%2 == 0) cnt -= n/val, sum -= n/val*(n/val+1)/2*val;\n else if(num%2 == 1) cnt += n/val, sum += n/val*(n/val+1)/2*val;\n }\n cnt = n-cnt;\n sum = n*(n+1)/2-sum;\n if(cnt == 0) sum = 0, cnt = 1;\n cout << fixed << setprecision(12) << (double)sum/cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 870,
"memory_kb": 3212,
"score_of_the_acc": -0.884,
"final_rank": 12
},
{
"submission_id": "aoj_1076_3814775",
"code_snippet": "#include<iostream>\n#include<iomanip>\n#include<vector>\n#include<climits>\nusing namespace std;\ntypedef long long ll;\n\nll gcd(ll a, ll b){\n return b == 0 ? a : gcd(b, a%b);\n}\n\nll lcm(ll a, ll b){\n ll tmp = a/gcd(a,b);\n if(b > LLONG_MAX/tmp) return -1;\n return a / gcd(a,b) * b;\n}\n\nint main(){\n ll n, m;\n while(cin >> n >> m, n+m){\n ll cnt = 0, sum = 0, p[m];\n for(int i = 0; i < m; i++) cin >> p[i];\n for(int i = 1; i < 1<<m; i++){\n vector<ll> v;\n for(int j = 0; j < m; j++){\n if((i>>j)&1) v.push_back(p[j]);\n }\n ll val = v[0];\n for(ll j : v){\n if(val == -1) break;\n val = lcm(val, j);\n }\n if(val == -1) continue;\n int num = v.size();\n if(num%2 == 0) cnt -= n/val, sum -= n/val*(n/val+1)/2*val;\n else if(num%2 == 1) cnt += n/val, sum += n/val*(n/val+1)/2*val;\n }\n cnt = n-cnt;\n sum = n*(n+1)/2-sum;\n if(cnt == 0) sum = 0, cnt = 1;\n cout << fixed << setprecision(12) << (double)sum/cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1090,
"memory_kb": 3228,
"score_of_the_acc": -1.0923,
"final_rank": 13
},
{
"submission_id": "aoj_1076_2514748",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nconst ll INF = 2000000001;\n\nll lcm(ll x, ll y)\n{\n ll ret = x/__gcd(x,y)*y;\n return min(INF,ret);\n}\n\nll s(ll a, ll n)\n{\n return n*(n+1)/2*a;\n}\n\ndouble solve(ll n, int m)\n{\n vector<ll> p(m);\n rep(i,m) cin >>p[i];\n\n ll num = 0;\n rep(mask,1<<m)\n {\n ll L = 1;\n rep(i,m)if(mask>>i&1) L = lcm(L,p[i]);\n\n ll x = n/L;\n if(__builtin_popcount(mask)%2==1) num-=x;\n else num+=x;\n }\n\n if(num==0) return 0;\n\n double d = num;\n double ret = 0;\n rep(mask,1<<m)\n {\n ll L = 1;\n rep(i,m)if(mask>>i&1) L = lcm(L,p[i]);\n\n if(L>n) continue;\n\n ll x = n/L;\n if(__builtin_popcount(mask)%2==1) ret -= s(L,x)/d;\n else ret += s(L,x)/d;\n }\n\n return ret;\n}\n\nint main()\n{\n int n,m;\n while(cin >>n >>m,n) printf(\"%.10f\\n\", solve(n,m));\n return 0;\n}",
"accuracy": 1,
"time_ms": 570,
"memory_kb": 3212,
"score_of_the_acc": -0.601,
"final_rank": 10
},
{
"submission_id": "aoj_1076_2016125",
"code_snippet": "#include <bits/stdc++.h>\n#define N 50000\nusing namespace std;\ntypedef long long ll;\nbool used[N];\n\nll SumD(ll a,ll d,ll n){return (n*(2*a+(n-1)*d))/2;}\n\nbool mark(ll n){\n bool res=1;\n for(ll i=1;i*i<=n;i++){\n if(n%i)continue;\n if(i<N)res&=!used[i],used[i]=1;\n if(i!=n/i&&n/i<N)res&=!used[n/i],used[n/i]=1;\n }\n return res;\n}\n\nint main(){\n while(1){\n ll n,m,p[21];\n cin>>n>>m;\n if(!n&&!m)break;\n for(int i=0;i<m;i++)cin>>p[i];\n sort(p,p+m);\n \n ll sum=0,cnt=0;\n for(int i=0;i<m;i++){\n sum+=SumD(p[i],p[i],n/p[i]);\n cnt+=n/p[i];\n memset(used,0,sizeof(used));\n for(int j=0;j<i;j++){\n\tll lcm=(p[i]/__gcd(p[i],p[j]))*p[j];\n\tif(!mark(lcm))continue;\n\tsum-=SumD(lcm,lcm,n/lcm);\n\tcnt-=(n/lcm);\n }\n }\n\n printf(\"%.8f\\n\",(p[0]!=1)*(1.0*SumD(1,1,n)-sum)/max(1LL,(n-cnt)));\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3308,
"score_of_the_acc": -0.096,
"final_rank": 1
},
{
"submission_id": "aoj_1076_2016124",
"code_snippet": "#include <bits/stdc++.h>\n#define N 100000\nusing namespace std;\ntypedef long long ll;\nbool used[N];\n\nll SumD(ll a,ll d,ll n){return (n*(2*a+(n-1)*d))/2;}\n\nbool mark(ll n){\n bool res=1;\n for(ll i=1;i*i<=n;i++){\n if(n%i)continue;\n if(i<N)res&=!used[i],used[i]=1;\n if(i!=n/i&&n/i<N)res&=!used[n/i],used[n/i]=1;\n }\n return res;\n}\n\nint main(){\n while(1){\n ll n,m,p[21];\n cin>>n>>m;\n if(!n&&!m)break;\n for(int i=0;i<m;i++)cin>>p[i];\n sort(p,p+m);\n \n ll sum=0,cnt=0;\n for(int i=0;i<m;i++){\n sum+=SumD(p[i],p[i],n/p[i]);\n cnt+=n/p[i];\n memset(used,0,sizeof(used));\n for(int j=0;j<i;j++){\n\tll lcm=(p[i]/__gcd(p[i],p[j]))*p[j];\n\tif(!mark(lcm))continue;\n\tsum-=SumD(lcm,lcm,n/lcm);\n\tcnt-=(n/lcm);\n }\n }\n\n printf(\"%.8f\\n\",(p[0]!=1)*(1.0*SumD(1,1,n)-sum)/max(1LL,(n-cnt)));\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3380,
"score_of_the_acc": -0.0994,
"final_rank": 2
},
{
"submission_id": "aoj_1076_2016116",
"code_snippet": "#include <bits/stdc++.h>\n#define N 20000000\nusing namespace std;\ntypedef long long ll;\nbool used[N];\n\nll SumD(ll a,ll d,ll n){return (n*(2*a+(n-1)*d))/2;}\n\nbool mark(ll n){\n bool res=1;\n for(ll i=1;i*i<=n;i++){\n if(n%i)continue;\n if(i<N)res&=!used[i],used[i]=1;\n if(i!=n/i&&n/i<N)res&=!used[n/i],used[n/i]=1;\n }\n return res;\n}\n\nint main(){\n while(1){\n ll n,m,p[21];\n cin>>n>>m;\n if(!n&&!m)break;\n for(int i=0;i<m;i++)cin>>p[i];\n sort(p,p+m);\n \n ll sum=0,cnt=0;\n for(int i=0;i<m;i++){\n sum+=SumD(p[i],p[i],n/p[i]);\n cnt+=n/p[i];\n memset(used,0,sizeof(used));\n for(int j=0;j<i;j++){\n\tll gcd=__gcd(p[i],p[j]);\n\tll lcm=(p[i]/gcd)*p[j];\n\tif(!mark(lcm))continue;\n\tsum-=SumD(lcm,lcm,n/lcm);\n\tcnt-=n/lcm;\n }\n }\n double ans=1.0*(SumD(1,1,n)-sum)/max(1LL,(n-cnt));\n if(p[0]==1)ans=0;\n printf(\"%.8f\\n\",ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 730,
"memory_kb": 22748,
"score_of_the_acc": -1.6574,
"final_rank": 16
},
{
"submission_id": "aoj_1076_2016115",
"code_snippet": "#include <bits/stdc++.h>\n#define N 20000000\nusing namespace std;\ntypedef long long ll;\nbool used[N];\n\nll SumD(ll a,ll d,ll n){return (n*(2*a+(n-1)*d))/2;}\n\nbool mark(ll n){\n bool res=1;\n used[1]=0;\n for(ll i=1;i*i<=n;i++){\n if(n%i)continue;\n if(i<N)res&=!used[i],used[i]=1;\n if(i!=n/i&&n/i<N)res&=!used[n/i],used[n/i]=1;\n }\n return res;\n}\n\nint main(){\n while(1){\n ll n,m,p[21];\n cin>>n>>m;\n if(!n&&!m)break;\n for(int i=0;i<m;i++)cin>>p[i];\n sort(p,p+m);\n\n \n ll sum=0,cnt=0;\n for(int i=0;i<m;i++){\n sum+=SumD(p[i],p[i],n/p[i]);\n cnt+=n/p[i];\n memset(used,0,sizeof(used));\n for(int j=0;j<i;j++){\n\tll gcd=__gcd(p[i],p[j]);\n\tll lcm=(p[i]/gcd)*p[j];\n\tif(!mark(lcm))continue;\n\tsum-=SumD(lcm,lcm,n/lcm);\n\tcnt-=n/lcm;\n }\n }\n double ans=1.0*(SumD(1,1,n)-sum)/max(1LL,(n-cnt));\n if(p[0]==1)ans=0;\n printf(\"%.8f\\n\",ans);\n }\n return 0;\n}",
"accuracy": 0.3333333333333333,
"time_ms": 740,
"memory_kb": 22800,
"score_of_the_acc": -1.6693,
"final_rank": 19
},
{
"submission_id": "aoj_1076_2016114",
"code_snippet": "#include <bits/stdc++.h>\n#define N 20000000\nusing namespace std;\ntypedef long long ll;\nbool used[N];\n\nll SumD(ll a,ll d,ll n){return (n*(2*a+(n-1)*d))/2;}\n\nbool mark(ll n){\n bool res=1;\n for(ll i=1;i*i<=n;i++){\n if(n%i)continue;\n if(i<N)res&=!used[i],used[i]=1;\n if(i!=n/i&&n/i<N)res&=!used[n/i],used[n/i]=1;\n }\n return res;\n}\n\nint main(){\n while(1){\n ll n,m,p[21];\n cin>>n>>m;\n if(!n&&!m)break;\n for(int i=0;i<m;i++)cin>>p[i];\n sort(p,p+m);\n\n \n ll sum=0,cnt=0;\n for(int i=0;i<m;i++){\n sum+=SumD(p[i],p[i],n/p[i]);\n cnt+=n/p[i];\n memset(used,0,sizeof(used));\n for(int j=0;j<i;j++){\n\tll gcd=__gcd(p[i],p[j]);\n\tll lcm=(p[i]/gcd)*p[j];\n\tif(!mark(lcm))continue;\n\tsum-=SumD(lcm,lcm,n/lcm);\n\tcnt-=n/lcm;\n }\n }\n double ans=1.0*(SumD(1,1,n)-sum)/max(1LL,(n-cnt));\n if(p[0]==1)ans=0;\n printf(\"%.8f\\n\",ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 730,
"memory_kb": 22664,
"score_of_the_acc": -1.6535,
"final_rank": 15
},
{
"submission_id": "aoj_1076_2016112",
"code_snippet": "#include <bits/stdc++.h>\n#define N 20000000\nusing namespace std;\ntypedef long long ll;\nbool used[N];\n\nll SumD(ll a,ll d,ll n){return (n*(2*a+(n-1)*d))/2;}\n\nbool mark(ll n){\n bool res=1;\n for(ll i=1;i*i<=n;i++){\n if(n%i)continue;\n if(i<N)res&=!used[i],used[i]=1;\n if(i!=n/i&&n/i<N)res&=!used[n/i],used[n/i]=1;\n }\n return res;\n}\n\nint main(){\n while(1){\n ll n,m,p[21];\n cin>>n>>m;\n if(!n&&!m)break;\n for(int i=0;i<m;i++)cin>>p[i];\n sort(p,p+m);\n\n \n ll sum=0,cnt=0;\n for(int i=0;i<m;i++){\n sum+=SumD(p[i],p[i],n/p[i]);\n cnt+=n/p[i];\n memset(used,0,sizeof(used));\n for(int j=0;j<i;j++){\n\tll gcd=__gcd(p[i],p[j]);\n\tll lcm=(p[i]/gcd)*p[j];\n\tif(!mark(lcm))continue;\n\tsum-=SumD(lcm,lcm,n/lcm);\n\tcnt-=n/lcm;\n }\n }\n double ans=1.0*(SumD(1,1,n)-sum)/max(1,(int)(n-cnt));\n if(p[0]==1)ans=0;\n printf(\"%.8f\\n\",ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 730,
"memory_kb": 22800,
"score_of_the_acc": -1.6598,
"final_rank": 17
},
{
"submission_id": "aoj_1076_2016111",
"code_snippet": "#include <bits/stdc++.h>\n#define N 20000000\nusing namespace std;\ntypedef unsigned long long ll;\nbool used[N];\n\nll SumD(ll a,ll d,ll n){return (n*(2*a+(n-1)*d))/2;}\n\nbool mark(ll n){\n bool res=1;\n for(ll i=1;i*i<=n;i++){\n if(n%i)continue;\n if(i<N)res&=!used[i],used[i]=1;\n if(i!=n/i&&n/i<N)res&=!used[n/i],used[n/i]=1;\n }\n return res;\n}\n\nint main(){\n while(1){\n ll n,m,p[21];\n cin>>n>>m;\n if(!n&&!m)break;\n for(int i=0;i<m;i++)cin>>p[i];\n sort(p,p+m);\n\n \n ll sum=0,cnt=0;\n for(int i=0;i<m;i++){\n sum+=SumD(p[i],p[i],n/p[i]);\n cnt+=n/p[i];\n memset(used,0,sizeof(used));\n for(int j=0;j<i;j++){\n\tll gcd=__gcd(p[i],p[j]);\n\tll lcm=(p[i]/gcd)*p[j];\n\tif(!mark(lcm))continue;\n\tsum-=SumD(lcm,lcm,n/lcm);\n\tcnt-=n/lcm;\n }\n }\n double ans=1.0*(SumD(1,1,n)-sum)/max(1,(int)(n-cnt));\n if(p[0]==1)ans=0;\n printf(\"%.8f\\n\",ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 730,
"memory_kb": 22660,
"score_of_the_acc": -1.6533,
"final_rank": 14
},
{
"submission_id": "aoj_1076_2016105",
"code_snippet": "#include <bits/stdc++.h>\n#define N 20000000\nusing namespace std;\ntypedef long long ll;\nbool used[N];\n\nll SumD(ll a,ll d,ll n){return (n*(2*a+(n-1)*d))/2;}\n\nbool mark(ll n){\n int res=1;\n used[1]=0;\n for(ll i=1;i*i<=n;i++){\n if(n%i)continue;\n if(i<N)res*=!used[i],used[i]|=1;\n if(i!=n/i&&n/i<N)res*=!used[n/i],used[n/i]|=1;\n }\n return res;\n}\n\nint main(){\n while(1){\n ll n,m,p[21];\n cin>>n>>m;\n if(!n&&!m)break;\n for(int i=0;i<m;i++)cin>>p[i];\n sort(p,p+m);\n\n \n ll sum=0,cnt=0;\n for(int i=0;i<m;i++){\n sum+=SumD(p[i],p[i],n/p[i]);\n cnt+=n/p[i];\n memset(used,0,sizeof(used));\n for(int j=0;j<i;j++){\n\tll gcd=__gcd(p[i],p[j]);\n\tll lcm=(p[i]/gcd)*p[j];\n\tif(!mark(lcm))continue;\n\tsum-=SumD(lcm,lcm,n/lcm);\n\tcnt-=n/lcm;\n }\n }\n\n double ans=1.0*(SumD(1,1,n)-sum)/max(1LL,(n-cnt));\n if(p[0]==1)ans=0;\n printf(\"%.8f\\n\",ans);\n }\n return 0;\n}",
"accuracy": 0.3333333333333333,
"time_ms": 740,
"memory_kb": 22812,
"score_of_the_acc": -1.6698,
"final_rank": 20
},
{
"submission_id": "aoj_1076_2016101",
"code_snippet": "#include <bits/stdc++.h>\n#define N 20000000\nusing namespace std;\ntypedef long long ll;\nbool used[N];\n\nll SumD(ll a,ll d,ll n){return (n*(2*a+(n-1)*d))/2;}\nbool mark(ll n){\n int res=1;\n used[1]=0;\n for(ll i=1;i*i<=n;i++){\n if(n%i)continue;\n if(i<N)res*=!used[i],used[i]|=1;\n if(i!=n/i&&n/i<N)res*=!used[n/i],used[n/i]|=1;\n }\n return res;\n}\n\nint main(){\n while(1){\n ll n,m;\n cin>>n>>m;\n if(!n&&!m)break;\n int p[21];\n for(int i=0;i<m;i++)cin>>p[i];\n sort(p,p+m);\n\n \n ll sum=0,cnt=0;\n for(int i=0;i<m;i++){\n sum+=SumD(p[i],p[i],n/p[i]);\n cnt+=n/p[i];\n memset(used,0,sizeof(used));\n for(int j=0;j<i;j++){\n ll gcd=__gcd(p[i],p[j]);\n ll lcm=(p[i]/gcd)*p[j];\n if(!mark(lcm))continue;\n sum-=SumD(lcm,lcm,n/lcm);\n cnt-=n/lcm;\n }\n }\n double ans=1.0*(SumD(1,1,n)-sum)/max(1LL,(n-cnt));\n if(p[0]==1)ans=0;\n printf(\"%.8f\\n\",ans);\n }\n return 0;\n}",
"accuracy": 0.3333333333333333,
"time_ms": 720,
"memory_kb": 22700,
"score_of_the_acc": -1.6458,
"final_rank": 18
},
{
"submission_id": "aoj_1076_1984628",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define all(v) (v).begin(),(v).end()\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\n\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\nint N,M;\nint P[20];\n\nsigned main(){\n while(cin>>N>>M,N||M){\n rep(i,M)cin>>P[i];\n\n int cnt=0;\n int sum=0;\n reps(i,1,1<<M){\n int a=1;\n rep(j,M)if(i>>j&1){\n a=lcm(a,P[j]);\n if(a>N)break;\n }\n int popcnt=__builtin_popcountll(i);\n int tmp=(a+N)*(N/a)/2;\n if(popcnt&1){\n sum+=tmp;\n cnt+=N/a;\n }\n else{\n sum-=tmp;\n cnt-=N/a;\n }\n }\n sum=N*(N+1)/2-sum;\n cnt=N-cnt;\n\n if(cnt==0)printf(\"%.20f\\n\",0.0);\n else printf(\"%.20f\\n\",1.0*sum/cnt);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 390,
"memory_kb": 3212,
"score_of_the_acc": -0.4312,
"final_rank": 7
},
{
"submission_id": "aoj_1076_1983370",
"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\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n \nlong long int gcd(long long int l, long long int r) {\n\tif (l > r)return gcd(r, l);\n\telse {\n\t\tif (r%l) {\n\t\t\treturn gcd(l, r%l);\n\n\t\t}\n\t\telse {\n\t\t\treturn l;\n\t\t}\n\t}\n}\n\nint main() {\n\tcout << setprecision(11) << fixed;\n\twhile (1) {\n\t\tint N, M; cin >> N >> M;\n\t\tld sum = 0;\n\t\tld year = 0;\n\t\tif (!N)break;\n\t\tvector<long long int>nums(M);\n\t\tfor (int i = 0; i < M; ++i)cin >> nums[i];\n\t\tfor (int i = 0; i < (1 << M); ++i) {\n\t\t\tbitset<20>bs(i);\n\t\t\tlong long int anum = 1;\n\t\t\tfor (int j = 0; j < M; ++j) {\n\t\t\t\tif (bs[j]) {\n\t\t\t\t\tanum = anum*nums[j] / gcd(anum, nums[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tld asum = N / anum;\n\t\t\tld ayear= (anum + N)*(N / anum) / 2;\n\t\t\tif (bs.count() % 2) {\n\n\t\t\t\tsum -= asum;\n\t\t\t\tyear -= ayear;\n\t\t\t}\n\t\t\telse {\n\n\t\t\t\tsum += asum;\n\t\t\t\tyear+= ayear;\n\t\t\t}\n\t\t}\n\t\tif (sum < eps)cout << 0 << endl;\n\t\telse \tcout << year/ sum << endl;\n\t\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 430,
"memory_kb": 3288,
"score_of_the_acc": -0.4725,
"final_rank": 9
},
{
"submission_id": "aoj_1076_1814287",
"code_snippet": "#include<iostream>\n#include<iomanip>\nusing namespace std;\nlong long n, m, a[20];\nint gcd(int a, int b) {\n\tif (b == 0)return a;\n\treturn gcd(b, a%b);\n}\nint main() {\n\twhile (true) {\n\t\tcin >> n >> m;\n\t\tif (n == 0 && m == 0)break;\n\t\tfor (int i = 0; i < m; i++)cin >> a[i];\n\t\tlong long S = 0, L = 0;\n\t\tfor (int i = 0; i < (1 << m); i++) {\n\t\t\tlong long bit[20], cnt = 0, lcm = 1;\n\t\t\tfor (int j = 0; j < m; j++) { bit[j] = (i / (1 << j)) % 2; }\n\t\t\tfor (int j = 0; j < m; j++) { cnt += bit[j]; }\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tif (bit[j] == 1) {\n\t\t\t\t\tlcm *= (a[j] / gcd(lcm, a[j]));\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong long K = ((n / lcm) + 1) *(n / lcm) / 2 * lcm;\n\t\t\tif (cnt % 2 == 0) { S += K; L += n / lcm; }\n\t\t\tif (cnt % 2 == 1) { S -= K; L -= n / lcm; }\n\t\t}\n\t\tif (L == 0)L = 1;\n\t\tcout << fixed << setprecision(15) << 1.0l*S / L << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 420,
"memory_kb": 1236,
"score_of_the_acc": -0.3679,
"final_rank": 3
}
] |
aoj_1075_cpp
|
Problem B: High & Low Cube
僕は近所の小学生たちと一緒に夏祭りに来ていた。有り体に言えば保護者役だが、出店の焼きそばやたこ焼きなんかが焼ける匂い、時折聞こえる打ち上げ花火の音などは、この歳になっても心が踊るものがある。が、好奇心旺盛な子供たちがはぐれないように、今日はしっかり見守っていないと。
子供たちはとある出店に興味を持ったようだった。覗き込んでみると、そこでは出店のおじさんとサイコロを使ったゲームをして、勝てば景品が貰えることになっていた。そのゲームは、 High & Low と呼ばれる単純なものだ。参加者とおじさんは1個ずつサイコロを振るが、その前に参加者は、自分の出目がおじさんの出目より大きいか小さいかを予想する。予想が当たれば勝利であり、同じ目が出た場合はどちらもサイコロを振り直す。
このゲームの少し厄介なところは、参加者のサイコロとおじさんのサイコロが違うものであるかもしれない、という点だ。参加者はあらかじめ両者のサイコロの展開図を見ることができるので、それをヒントに予想することになる。
つまり、簡単な確率の計算だ。とはいえ確率は高校数学の範囲で、小学生にはちょっと荷が重いかもしれない。子供たちの中で一番利発そうな子でさえ、三つ編みにした髪を揺らしながら考え込んでいる。もうすぐ僕に助けを求めてくることだろう。さて、たまにはオトナらしいところを見せてあげようではないか。
Input
入力は複数のケースからなる。
各ケースでは、サイコロの展開図が21×57のグリッドで与えられる。
最初の21×28（(0,0)が左上,(20,27)が右下）のグリッドが参加者のサイコロを表す。
最後の21×28（(0,29)が左上,(20,56)が右下）がおじさんのサイコロを表す。
参加者のサイコロの各面は(0,7)、(7,0)、(7,7)、(7,14)、(7,21)、(14,7)を左上とする7×7のサブグリッドで与えられている。
展開図に書かれている数字は、それぞれ元の数字を
左右反転
左右反転、そのあとで反時計回りに90度回転
左右反転
左右反転、そのあとで反時計回りに270度回転
左右反転
上下反転、そのあとで左右反転
させたものである。
おじさんのサイコロの各面は(0,36)、(7,29)、(7,36)、(7,43)、(7,50)、(14,36)を左上とする７×７のサブグリッドで与えられている。
おじさんのサイコロの展開図に書かれている数字は参加者のサイコロと同じ規則で描かれている。
サイコロの各面には1から9までの中のどれかが書かれている。
数字は以下のような7x7のグリッドで与えられる。
#######
#.....#
#...|.#
#.....#
#...|.#
#..-..#
#######
#######
#..-..#
#...|.#
#..-..#
#.|...#
#..-..#
#######
#######
#..-..#
#...|.#
#..-..#
#...|.#
#..-..#
#######
#######
#.....#
#.|.|.#
#..-..#
#...|.#
#.....#
#######
#######
#..-..#
#.|...#
#..-..#
#...|.#
#..-..#
#######
#######
#..-..#
#.|...#
#..-..#
#.|.|.#
#..-..#
#######
#######
#..-..#
#...|.#
#.....#
#...|.#
#.....#
#######
#######
#..-..#
#.|.|.#
#..-..#
#.|.|.#
#..-..#
#######
#######
#..-..#
#.|.|.#
#..-..#
#...|.#
#..-..#
#######
ただし上記の数字を90度、または270度回転させた時、"|"と"-"は入れ替わっている。
入力の終わりは1つの0からなる行によって与えられる
入力として与えられるサイコロは必ず正しい物である。
また決着がつかないようなサイコロは与えられない。
Output
"HIGH"になる場合と"LOW"になる場合で確率が高いほうを1行に出力せよ。
両者の確率が同じ場合は"HIGH"を出力せよ。
Sample input
.......#######......................#######..............
.......#.....#......................#..-..#..............
.......#.|...#......................#.|.|.#..............
.......#.....#......................#..-..#..............
.......#.|...#......................#.|...#..............
.......#..-..#......................#..-..#..............
.......#######......................#######..............
############################.############################
#.....##..-..##.....##..-..#.#.....##..-..##.....##..-..#
#.-.-.##...|.##.-.-.##.|.|.#.#.....##.|.|.##.-.-.##.|.|.#
#|.|.|##..-..##|.|.|##..-..#.#....|##..-..##|.|.|##..-..#
#...-.##.|...##...-.##.|.|.#.#.-.-.##.|...##...-.##.|...#
#.....##..-..##.....##..-..#.#.....##..-..##.....##..-..#
############################.############################
.......#######......................#######..............
.......#..-..#......................#..-..#..............
.......#.|...#......................#.|...#..............
.......#..-..#......................#..-..#..............
.......#.|.|.#......................#...|.#..............
.......#..-..#......................#..-..#.........
...(truncated)
|
[
{
"submission_id": "aoj_1075_1635615",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <string>\n#define N 21\n#define T 7\nusing namespace std;\nvoid Change(int);\nvoid Rot_Left();\nint stoi();\nstring s[N],t[T];\n\nint main(){\n int a[2][6],coma,comb,d[2][6][2]={\n {{0,7},{7,0},{7,7},{7,14},{7,21},{14,7}},\n {{0,36},{7,29},{7,36},{7,43},{7,50},{14,36}}\n };\n while(1){\n cin>>s[0];\n if(s[0]==\"0\") break;\n for(int i=1;i<N;i++) cin>>s[i];\n for(int i=0;i<2;i++){\n for(int j=0;j<6;j++){\n\tfor(int k=0;k<T;k++) t[k]=s[k+d[i][j][0]].substr(d[i][j][1],7);\n\tChange(j);\n\ta[i][j]=stoi();\n }\n }\n coma=comb=0;\n for(int i=0;i<6;i++){\n for(int j=0;j<6;j++){\n\tif(a[0][i]>a[1][j]) coma++;\n\telse if(a[0][i]<a[1][j]) comb++;\n }\n }\n if(coma>=comb) cout<<\"HIGH\"<<endl;\n else cout<<\"LOW\"<<endl;\n }\n return 0;\n}\n\nvoid Change(int x){\n for(int i=0;i<T;i++) reverse(t[i].begin(),t[i].end());\n if(x==1) Rot_Left();\n if(x==3)\n for(int i=0;i<3;i++) Rot_Left();\n if(x==5) swap(t[1],t[5]),swap(t[2],t[4]);\n}\n\nvoid Rot_Left(){\n string temp[T];\n for(int i=0;i<T;i++) temp[i]=t[i];\n for(int i=0;i<T;i++)\n for(int j=0;j<T;j++){\n temp[i][j]=t[j][T-i-1];\n if(temp[i][j]=='-') temp[i][j]='|';\n else if(temp[i][j]=='|') temp[i][j]='-';\n }\n for(int i=0;i<T;i++) t[i]=temp[i];\n}\n\nint stoi(){\n string data[9][T]={\n {\"#######\",\"#.....#\",\"#...|.#\",\"#.....#\",\"#...|.#\",\"#..-..#\",\"#######\"},\n {\"#######\",\"#..-..#\",\"#...|.#\",\"#..-..#\",\"#.|...#\",\"#..-..#\",\"#######\"},\n {\"#######\",\"#..-..#\",\"#...|.#\",\"#..-..#\",\"#...|.#\",\"#..-..#\",\"#######\"},\n {\"#######\",\"#.....#\",\"#.|.|.#\",\"#..-..#\",\"#...|.#\",\"#.....#\",\"#######\"},\n {\"#######\",\"#..-..#\",\"#.|...#\",\"#..-..#\",\"#...|.#\",\"#..-..#\",\"#######\"},\n {\"#######\",\"#..-..#\",\"#.|...#\",\"#..-..#\",\"#.|.|.#\",\"#..-..#\",\"#######\"},\n {\"#######\",\"#..-..#\",\"#...|.#\",\"#.....#\",\"#...|.#\",\"#.....#\",\"#######\"},\n {\"#######\",\"#..-..#\",\"#.|.|.#\",\"#..-..#\",\"#.|.|.#\",\"#..-..#\",\"#######\"},\n {\"#######\",\"#..-..#\",\"#.|.|.#\",\"#..-..#\",\"#...|.#\",\"#..-..#\",\"#######\"},\n };\n for(int i=0;i<9;i++){\n int flag=0;\n for(int j=0;j<T;j++)\n if(t[j]!=data[i][j]) flag=1;\n if(!flag) return i+1;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1200,
"score_of_the_acc": -0.3807,
"final_rank": 9
},
{
"submission_id": "aoj_1075_1635609",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cstdlib>\n#include <cassert>\n#include <random>\nusing namespace std;\nint dicea[6],diceb[6];\nstring str[21];\nint mk_num(string *);\n\nvoid lr_hanten(string a[]){\n for(int i=0;i<7;i++)\n for(int j=0;j<7/2;j++) swap(a[i][j],a[i][6-j]);\n}\n\nvoid ud_hanten(string a[]){\n for(int i=0;i<7;i++) \n for(int j=0;j<7/2;j++) swap(a[j][i],a[6-j][i]);\n}\n\nvoid rol_90(string a[]){\n string b[7];\n for(int i=0;i<7;i++)\n for(int j=0;j<7;j++) {\n b[i] += a[j][6-i];\n if(b[i][j] == '-') b[i][j] = '|';\n else if(b[i][j] =='|') b[i][j] = '-';\n }\n for(int i=0;i<7;i++) a[i] = b[i];\n}\n\nvoid choice(string num[],int x,int y){\n for(int i=0;i<7;i++){\n num[i]=\"\";\n for(int j=0;j<7;j++) num[i]+=str[y+i][x+j];\n }\n}\n\nvoid mk_dice(){\n string num[2][7];\n //ue\n choice(num[0],7,0),choice(num[1],36,0);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[0] = mk_num(num[0]),diceb[0]=mk_num(num[1]);\n \n //hidari\n choice(num[0],0,7),choice(num[1],29,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n rol_90(num[0]),rol_90(num[1]);\n dicea[1] = mk_num(num[0]),diceb[1] = mk_num(num[1]);\n\n //mid_hidari\n choice(num[0],7,7),choice(num[1],36,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[2] = mk_num(num[0]),diceb[2] = mk_num(num[1]);\n\n //mid_migi\n choice(num[0],14,7),choice(num[1],43,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n for(int i=0;i<3;i++)rol_90(num[0]),rol_90(num[1]);\n dicea[3] = mk_num(num[0]),diceb[3] = mk_num(num[1]);\n\n //migi\n choice(num[0],21,7),choice(num[1],50,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[4] = mk_num(num[0]),diceb[4] = mk_num(num[1]);\n\n\n //sita\n choice(num[0],7,14),choice(num[1],36,14);\n ud_hanten(num[0]),ud_hanten(num[1]);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[5] = mk_num(num[0]),diceb[5] = mk_num(num[1]);\n}\n\nint main(){\n srand((unsigned)time(NULL));\n while(1) {\n for(int i=0;i<21;i++){\n cin >> str[i];\n if(str[i]==\"0\")break;\n }\n if(str[0]==\"0\")break;\n mk_dice();\n int a=0,b=0;\n for(int i=0;i<6;i++) assert(dicea[i]!=-1 && diceb[i]!=-1);\n\n int arr[6]={};\n std::random_device rnd; \n for(int i=0;i<10000;i++){\n arr[rnd()%6]++;\n if(dicea[rnd()%6] > diceb[rnd()%6]) a++;\n else if(dicea[rnd()%6]<diceb[rnd()%6])b++;\n }\n // for(int i=0;i<6;i++) cout <<arr[i]<<\" \";cout<<endl;\n if(a>b-100) cout<<\"HIGH\"<<endl;\n else cout <<\"LOW\"<<endl;\n }\n\n}\n\nint mk_num(string a[]){\n if(a[1]==\"#.....#\" &&\n a[2]==\"#...|.#\") return 1;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#.|...#\" &&\n a[5]==\"#..-..#\") return 2;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 3;\n\n if(a[1]==\"#.....#\" &&\n a[5]==\"#.....#\") return 4;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 5;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 6;\n\n if(a[3]==\"#.....#\" &&\n a[5]==\"#.....#\") return 7;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 8;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 9;\n return -1;\n}",
"accuracy": 0.5,
"time_ms": 430,
"memory_kb": 3028,
"score_of_the_acc": -1.9374,
"final_rank": 19
},
{
"submission_id": "aoj_1075_1635606",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cstdlib>\n#include <cassert>\n#include <random>\nusing namespace std;\nint dicea[6],diceb[6];\nstring str[21];\nint mk_num(string *);\n\nvoid lr_hanten(string a[]){\n for(int i=0;i<7;i++)\n for(int j=0;j<7/2;j++) swap(a[i][j],a[i][6-j]);\n}\n\nvoid ud_hanten(string a[]){\n for(int i=0;i<7;i++) \n for(int j=0;j<7/2;j++) swap(a[j][i],a[6-j][i]);\n}\n\nvoid rol_90(string a[]){\n string b[7];\n for(int i=0;i<7;i++)\n for(int j=0;j<7;j++) {\n b[i] += a[j][6-i];\n if(b[i][j] == '-') b[i][j] = '|';\n else if(b[i][j] =='|') b[i][j] = '-';\n }\n for(int i=0;i<7;i++) a[i] = b[i];\n}\n\nvoid choice(string num[],int x,int y){\n for(int i=0;i<7;i++){\n num[i]=\"\";\n for(int j=0;j<7;j++) num[i]+=str[y+i][x+j];\n }\n}\n\nvoid mk_dice(){\n string num[2][7];\n //ue\n choice(num[0],7,0),choice(num[1],36,0);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[0] = mk_num(num[0]),diceb[0]=mk_num(num[1]);\n \n //hidari\n choice(num[0],0,7),choice(num[1],29,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n rol_90(num[0]),rol_90(num[1]);\n dicea[1] = mk_num(num[0]),diceb[1] = mk_num(num[1]);\n\n //mid_hidari\n choice(num[0],7,7),choice(num[1],36,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[2] = mk_num(num[0]),diceb[2] = mk_num(num[1]);\n\n //mid_migi\n choice(num[0],14,7),choice(num[1],43,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n for(int i=0;i<3;i++)rol_90(num[0]),rol_90(num[1]);\n dicea[3] = mk_num(num[0]),diceb[3] = mk_num(num[1]);\n\n //migi\n choice(num[0],21,7),choice(num[1],50,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[4] = mk_num(num[0]),diceb[4] = mk_num(num[1]);\n\n\n //sita\n choice(num[0],7,14),choice(num[1],36,14);\n ud_hanten(num[0]),ud_hanten(num[1]);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[5] = mk_num(num[0]),diceb[5] = mk_num(num[1]);\n}\n\nint main(){\n srand((unsigned)time(NULL));\n while(1) {\n for(int i=0;i<21;i++){\n cin >> str[i];\n if(str[i]==\"0\")break;\n }\n if(str[0]==\"0\")break;\n mk_dice();\n int a=0,b=0;\n for(int i=0;i<6;i++) assert(dicea[i]!=-1 && diceb[i]!=-1);\n\n int arr[6]={};\n std::random_device rnd; \n for(int i=0;i<10000;i++){\n arr[rnd()%6]++;\n if(dicea[rnd()%6] > diceb[rnd()%6]) a++;\n else if(dicea[rnd()%6]<diceb[rnd()%6])b++;\n }\n // for(int i=0;i<6;i++) cout <<arr[i]<<\" \";cout<<endl;\n if(a>b-500) cout<<\"HIGH\"<<endl;\n else cout <<\"LOW\"<<endl;\n }\n\n}\n\nint mk_num(string a[]){\n if(a[1]==\"#.....#\" &&\n a[2]==\"#...|.#\") return 1;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#.|...#\" &&\n a[5]==\"#..-..#\") return 2;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 3;\n\n if(a[1]==\"#.....#\" &&\n a[5]==\"#.....#\") return 4;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 5;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 6;\n\n if(a[3]==\"#.....#\" &&\n a[5]==\"#.....#\") return 7;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 8;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 9;\n return -1;\n}",
"accuracy": 0.5,
"time_ms": 440,
"memory_kb": 3152,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_1075_1635603",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cstdlib>\n#include <cassert>\nusing namespace std;\nint dicea[6],diceb[6];\nstring str[21];\nint mk_num(string *);\n\nvoid lr_hanten(string a[]){\n for(int i=0;i<7;i++)\n for(int j=0;j<7/2;j++) swap(a[i][j],a[i][6-j]);\n}\n\nvoid ud_hanten(string a[]){\n for(int i=0;i<7;i++) \n for(int j=0;j<7/2;j++) swap(a[j][i],a[6-j][i]);\n}\n\nvoid rol_90(string a[]){\n string b[7];\n for(int i=0;i<7;i++)\n for(int j=0;j<7;j++) {\n b[i] += a[j][6-i];\n if(b[i][j] == '-') b[i][j] = '|';\n else if(b[i][j] =='|') b[i][j] = '-';\n }\n for(int i=0;i<7;i++) a[i] = b[i];\n}\n\nvoid choice(string num[],int x,int y){\n for(int i=0;i<7;i++){\n num[i]=\"\";\n for(int j=0;j<7;j++) num[i]+=str[y+i][x+j];\n }\n}\n\nvoid mk_dice(){\n string num[2][7];\n //ue\n choice(num[0],7,0),choice(num[1],36,0);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[0] = mk_num(num[0]),diceb[0]=mk_num(num[1]);\n \n //hidari\n choice(num[0],0,7),choice(num[1],29,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n rol_90(num[0]),rol_90(num[1]);\n dicea[1] = mk_num(num[0]),diceb[1] = mk_num(num[1]);\n\n //mid_hidari\n choice(num[0],7,7),choice(num[1],36,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[2] = mk_num(num[0]),diceb[2] = mk_num(num[1]);\n\n //mid_migi\n choice(num[0],14,7),choice(num[1],43,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n for(int i=0;i<3;i++)rol_90(num[0]),rol_90(num[1]);\n dicea[3] = mk_num(num[0]),diceb[3] = mk_num(num[1]);\n\n //migi\n choice(num[0],21,7),choice(num[1],50,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[4] = mk_num(num[0]),diceb[4] = mk_num(num[1]);\n\n\n //sita\n choice(num[0],7,14),choice(num[1],36,14);\n ud_hanten(num[0]),ud_hanten(num[1]);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[5] = mk_num(num[0]),diceb[5] = mk_num(num[1]);\n}\n\nint main(){\n srand((unsigned)time(NULL));\n while(1) {\n for(int i=0;i<21;i++){\n cin >> str[i];\n if(str[i]==\"0\")break;\n }\n if(str[0]==\"0\")break;\n mk_dice();\n int a=0,b=0;\n for(int i=0;i<6;i++) assert(dicea[i]!=-1 && diceb[i]!=-1);\n\n int arr[6]={};\n for(int i=0;i<100000;i++){\n arr[rand()%6]++;\n if(dicea[rand()%6] > diceb[rand()%6]) a++;\n else if(dicea[rand()%6]<diceb[rand()%6])b++;\n }\n // for(int i=0;i<6;i++) cout <<arr[i]<<\" \";cout<<endl;\n if(a>b-5000) cout<<\"HIGH\"<<endl;\n else cout <<\"LOW\"<<endl;\n }\n\n}\n\nint mk_num(string a[]){\n if(a[1]==\"#.....#\" &&\n a[2]==\"#...|.#\") return 1;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#.|...#\" &&\n a[5]==\"#..-..#\") return 2;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 3;\n\n if(a[1]==\"#.....#\" &&\n a[5]==\"#.....#\") return 4;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 5;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 6;\n\n if(a[3]==\"#.....#\" &&\n a[5]==\"#.....#\") return 7;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 8;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 9;\n return -1;\n}",
"accuracy": 0.5,
"time_ms": 430,
"memory_kb": 1196,
"score_of_the_acc": -1.3562,
"final_rank": 16
},
{
"submission_id": "aoj_1075_1635601",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cstdlib>\n#include <cassert>\nusing namespace std;\nint dicea[6],diceb[6];\nstring str[21];\nint mk_num(string *);\n\nvoid lr_hanten(string a[]){\n for(int i=0;i<7;i++)\n for(int j=0;j<7/2;j++) swap(a[i][j],a[i][6-j]);\n}\n\nvoid ud_hanten(string a[]){\n for(int i=0;i<7;i++) \n for(int j=0;j<7/2;j++) swap(a[j][i],a[6-j][i]);\n}\n\nvoid rol_90(string a[]){\n string b[7];\n for(int i=0;i<7;i++)\n for(int j=0;j<7;j++) {\n b[i] += a[j][6-i];\n if(b[i][j] == '-') b[i][j] = '|';\n else if(b[i][j] =='|') b[i][j] = '-';\n }\n for(int i=0;i<7;i++) a[i] = b[i];\n}\n\nvoid choice(string num[],int x,int y){\n for(int i=0;i<7;i++){\n num[i]=\"\";\n for(int j=0;j<7;j++) num[i]+=str[y+i][x+j];\n }\n}\n\nvoid mk_dice(){\n string num[2][7];\n //ue\n choice(num[0],7,0),choice(num[1],36,0);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[0] = mk_num(num[0]),diceb[0]=mk_num(num[1]);\n \n //hidari\n choice(num[0],0,7),choice(num[1],29,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n rol_90(num[0]),rol_90(num[1]);\n dicea[1] = mk_num(num[0]),diceb[1] = mk_num(num[1]);\n\n //mid_hidari\n choice(num[0],7,7),choice(num[1],36,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[2] = mk_num(num[0]),diceb[2] = mk_num(num[1]);\n\n //mid_migi\n choice(num[0],14,7),choice(num[1],43,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n for(int i=0;i<3;i++)rol_90(num[0]),rol_90(num[1]);\n dicea[3] = mk_num(num[0]),diceb[3] = mk_num(num[1]);\n\n //migi\n choice(num[0],21,7),choice(num[1],50,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[4] = mk_num(num[0]),diceb[4] = mk_num(num[1]);\n\n\n //sita\n choice(num[0],7,14),choice(num[1],36,14);\n ud_hanten(num[0]),ud_hanten(num[1]);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[5] = mk_num(num[0]),diceb[5] = mk_num(num[1]);\n}\n\nint main(){\n srand((unsigned)time(NULL));\n while(1) {\n for(int i=0;i<21;i++){\n cin >> str[i];\n if(str[i]==\"0\")break;\n }\n if(str[0]==\"0\")break;\n mk_dice();\n int a=0,b=0;\n for(int i=0;i<6;i++) assert(dicea[i]!=-1 && diceb[i]!=-1);\n\n int arr[6]={};\n for(int i=0;i<100000;i++){\n arr[rand()%6]++;\n if(dicea[rand()%6] > diceb[rand()%6]) a++;\n else if(dicea[rand()%6]<diceb[rand()%6])b++;\n }\n // for(int i=0;i<6;i++) cout <<arr[i]<<\" \";cout<<endl;\n if(a>b-500) cout<<\"HIGH\"<<endl;\n else cout <<\"LOW\"<<endl;\n }\n\n}\n\nint mk_num(string a[]){\n if(a[1]==\"#.....#\" &&\n a[2]==\"#...|.#\") return 1;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#.|...#\" &&\n a[5]==\"#..-..#\") return 2;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 3;\n\n if(a[1]==\"#.....#\" &&\n a[5]==\"#.....#\") return 4;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 5;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 6;\n\n if(a[3]==\"#.....#\" &&\n a[5]==\"#.....#\") return 7;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 8;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 9;\n return -1;\n}",
"accuracy": 0.5,
"time_ms": 430,
"memory_kb": 1196,
"score_of_the_acc": -1.3562,
"final_rank": 16
},
{
"submission_id": "aoj_1075_1635600",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cstdlib>\n#include <cassert>\nusing namespace std;\nint dicea[6],diceb[6];\nstring str[21];\nint mk_num(string *);\n\nvoid lr_hanten(string a[]){\n for(int i=0;i<7;i++)\n for(int j=0;j<7/2;j++) swap(a[i][j],a[i][6-j]);\n}\n\nvoid ud_hanten(string a[]){\n for(int i=0;i<7;i++) \n for(int j=0;j<7/2;j++) swap(a[j][i],a[6-j][i]);\n}\n\nvoid rol_90(string a[]){\n string b[7];\n for(int i=0;i<7;i++)\n for(int j=0;j<7;j++) {\n b[i] += a[j][6-i];\n if(b[i][j] == '-') b[i][j] = '|';\n else if(b[i][j] =='|') b[i][j] = '-';\n }\n for(int i=0;i<7;i++) a[i] = b[i];\n}\n\nvoid choice(string num[],int x,int y){\n for(int i=0;i<7;i++){\n num[i]=\"\";\n for(int j=0;j<7;j++) num[i]+=str[y+i][x+j];\n }\n}\n\nvoid mk_dice(){\n string num[2][7];\n //ue\n choice(num[0],7,0),choice(num[1],36,0);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[0] = mk_num(num[0]),diceb[0]=mk_num(num[1]);\n \n //hidari\n choice(num[0],0,7),choice(num[1],29,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n rol_90(num[0]),rol_90(num[1]);\n dicea[1] = mk_num(num[0]),diceb[1] = mk_num(num[1]);\n\n //mid_hidari\n choice(num[0],7,7),choice(num[1],36,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[2] = mk_num(num[0]),diceb[2] = mk_num(num[1]);\n\n //mid_migi\n choice(num[0],14,7),choice(num[1],43,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n for(int i=0;i<3;i++)rol_90(num[0]),rol_90(num[1]);\n dicea[3] = mk_num(num[0]),diceb[3] = mk_num(num[1]);\n\n //migi\n choice(num[0],21,7),choice(num[1],50,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[4] = mk_num(num[0]),diceb[4] = mk_num(num[1]);\n\n\n //sita\n choice(num[0],7,14),choice(num[1],36,14);\n ud_hanten(num[0]),ud_hanten(num[1]);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[5] = mk_num(num[0]),diceb[5] = mk_num(num[1]);\n}\n\nint main(){\n srand((unsigned)time(NULL));\n while(1) {\n for(int i=0;i<21;i++){\n cin >> str[i];\n if(str[i]==\"0\")break;\n }\n if(str[0]==\"0\")break;\n mk_dice();\n int a=0,b=0;\n for(int i=0;i<6;i++) assert(dicea[i]!=-1 && diceb[i]!=-1);\n\n int arr[6]={};\n for(int i=0;i<100000;i++){\n arr[rand()%6]++;\n if(dicea[rand()%6] > diceb[rand()%6]) a++;\n else if(dicea[rand()%6]<diceb[rand()%6])b++;\n }\n // for(int i=0;i<6;i++) cout <<arr[i]<<\" \";cout<<endl;\n if(a>=b) cout<<\"HIGH\"<<endl;\n else cout <<\"LOW\"<<endl;\n }\n\n}\n\nint mk_num(string a[]){\n if(a[1]==\"#.....#\" &&\n a[2]==\"#...|.#\") return 1;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#.|...#\" &&\n a[5]==\"#..-..#\") return 2;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 3;\n\n if(a[1]==\"#.....#\" &&\n a[5]==\"#.....#\") return 4;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 5;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 6;\n\n if(a[3]==\"#.....#\" &&\n a[5]==\"#.....#\") return 7;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 8;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 9;\n return -1;\n}",
"accuracy": 0.5,
"time_ms": 430,
"memory_kb": 1196,
"score_of_the_acc": -1.3562,
"final_rank": 16
},
{
"submission_id": "aoj_1075_1635596",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cstdlib>\n#include <cassert>\nusing namespace std;\nint dicea[6],diceb[6];\nstring str[21];\nint mk_num(string *);\n\nvoid lr_hanten(string a[]){\n for(int i=0;i<7;i++)\n for(int j=0;j<7/2;j++) swap(a[i][j],a[i][6-j]);\n}\n\nvoid ud_hanten(string a[]){\n for(int i=0;i<7;i++) \n for(int j=0;j<7/2;j++) swap(a[j][i],a[6-j][i]);\n}\n\nvoid rol_90(string a[]){\n string b[7];\n for(int i=0;i<7;i++)\n for(int j=0;j<7;j++) {\n b[i] += a[j][6-i];\n if(b[i][j] == '-') b[i][j] = '|';\n else if(b[i][j] =='|') b[i][j] = '-';\n }\n for(int i=0;i<7;i++) a[i] = b[i];\n}\n\nvoid choice(string num[],int x,int y){\n for(int i=0;i<7;i++){\n num[i]=\"\";\n for(int j=0;j<7;j++) num[i]+=str[y+i][x+j];\n }\n}\n\nvoid mk_dice(){\n string num[2][7];\n //ue\n choice(num[0],7,0),choice(num[1],36,0);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[0] = mk_num(num[0]),diceb[0]=mk_num(num[1]);\n \n //hidari\n choice(num[0],0,7),choice(num[1],29,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n rol_90(num[0]),rol_90(num[1]);\n dicea[1] = mk_num(num[0]),diceb[1] = mk_num(num[1]);\n\n //mid_hidari\n choice(num[0],7,7),choice(num[1],36,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[2] = mk_num(num[0]),diceb[2] = mk_num(num[1]);\n\n //mid_migi\n choice(num[0],14,7),choice(num[1],43,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n for(int i=0;i<3;i++)rol_90(num[0]),rol_90(num[1]);\n dicea[3] = mk_num(num[0]),diceb[3] = mk_num(num[1]);\n\n //migi\n choice(num[0],21,7),choice(num[1],50,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[4] = mk_num(num[0]),diceb[4] = mk_num(num[1]);\n\n\n //sita\n choice(num[0],7,14),choice(num[1],36,14);\n ud_hanten(num[0]),ud_hanten(num[1]);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[5] = mk_num(num[0]),diceb[5] = mk_num(num[1]);\n}\n\nint main(){\n srand((unsigned)time(NULL));\n while(1) {\n for(int i=0;i<21;i++){\n cin >> str[i];\n if(str[i]==\"0\")break;\n }\n if(str[0]==\"0\")break;\n mk_dice();\n int a=0,b=0;\n for(int i=0;i<6;i++) assert(dicea[i]!=-1 && diceb[i]!=-1);\n\n for(int i=0;i<1000;i++)\n if(dicea[rand()%6] > diceb[rand()%6]) a++;\n else if(dicea[rand()%6]<diceb[rand()%6])b++;\n\n if(a>=b) cout<<\"HIGH\"<<endl;\n else cout <<\"LOW\"<<endl;\n }\n\n}\n\nint mk_num(string a[]){\n if(a[1]==\"#.....#\" &&\n a[2]==\"#...|.#\") return 1;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#.|...#\" &&\n a[5]==\"#..-..#\") return 2;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 3;\n\n if(a[1]==\"#.....#\" &&\n a[5]==\"#.....#\") return 4;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 5;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 6;\n\n if(a[3]==\"#.....#\" &&\n a[5]==\"#.....#\") return 7;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 8;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 9;\n return -1;\n}",
"accuracy": 0.5,
"time_ms": 10,
"memory_kb": 1196,
"score_of_the_acc": -0.3794,
"final_rank": 12
},
{
"submission_id": "aoj_1075_1635589",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cstdlib>\n#include <cassert>\nusing namespace std;\nint dicea[6],diceb[6];\nstring str[21];\nint mk_num(string *);\n\nvoid lr_hanten(string a[]){\n for(int i=0;i<7;i++)\n for(int j=0;j<7/2;j++) swap(a[i][j],a[i][6-j]);\n}\n\nvoid ud_hanten(string a[]){\n for(int i=0;i<7;i++) \n for(int j=0;j<7/2;j++) swap(a[j][i],a[6-j][i]);\n}\n\nvoid rol_90(string a[]){\n string b[7];\n for(int i=0;i<7;i++)\n for(int j=0;j<7;j++) {\n b[i] += a[j][6-i];\n if(b[i][j] == '-') b[i][j] = '|';\n else if(b[i][j] =='|') b[i][j] = '-';\n }\n for(int i=0;i<7;i++) a[i] = b[i];\n}\n\nvoid choice(string num[],int x,int y){\n for(int i=0;i<7;i++){\n num[i]=\"\";\n for(int j=0;j<7;j++) num[i]+=str[y+i][x+j];\n }\n}\n\nvoid mk_dice(){\n string num[2][7];\n //ue\n choice(num[0],7,0),choice(num[1],36,0);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[0] = mk_num(num[0]),diceb[0]=mk_num(num[1]);\n \n //hidari\n choice(num[0],0,7),choice(num[1],29,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n rol_90(num[0]),rol_90(num[1]);\n dicea[1] = mk_num(num[0]),diceb[1] = mk_num(num[1]);\n\n //mid_hidari\n choice(num[0],7,7),choice(num[1],36,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[2] = mk_num(num[0]),diceb[2] = mk_num(num[1]);\n\n //mid_migi\n choice(num[0],14,7),choice(num[1],43,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n for(int i=0;i<3;i++)rol_90(num[0]),rol_90(num[1]);\n dicea[3] = mk_num(num[0]),diceb[3] = mk_num(num[1]);\n\n //migi\n choice(num[0],21,7),choice(num[1],50,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[4] = mk_num(num[0]),diceb[4] = mk_num(num[1]);\n\n\n //sita\n choice(num[0],7,14),choice(num[1],36,14);\n ud_hanten(num[0]),ud_hanten(num[1]);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[5] = mk_num(num[0]),diceb[5] = mk_num(num[1]);\n}\n\nint main(){\n while(1) {\n for(int i=0;i<21;i++){\n cin >> str[i];\n if(str[i]==\"0\")break;\n }\n if(str[0]==\"0\")break;\n mk_dice();\n sort(dicea,dicea+6);\n sort(diceb,diceb+6);\n int a=0,b=0;\n for(int i=0;i<6;i++) assert(dicea[i]!=-1 && diceb[i]!=-1);\n\n for(int i=0;i<6;i++) \n for(int j=0;j<6;j++) \n\tif(dicea[i] > diceb[i]) a++;\n\telse if(dicea[i]<diceb[i])b++;\n\n if(a>=b) cout<<\"HIGH\"<<endl;\n else cout <<\"LOW\"<<endl;\n }\n\n}\n\nint mk_num(string a[]){\n if(a[1]==\"#.....#\" &&\n a[2]==\"#...|.#\") return 1;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#.|...#\" &&\n a[5]==\"#..-..#\") return 2;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 3;\n\n if(a[1]==\"#.....#\" &&\n a[5]==\"#.....#\") return 4;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 5;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 6;\n\n if(a[3]==\"#.....#\" &&\n a[5]==\"#.....#\") return 7;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 8;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 9;\n return -1;\n}",
"accuracy": 0.5,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.3832,
"final_rank": 13
},
{
"submission_id": "aoj_1075_1635586",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cstdlib>\n#include <cassert>\nusing namespace std;\nint dicea[6],diceb[6];\nstring str[21];\nint mk_num(string *);\n\nvoid lr_hanten(string a[]){\n for(int i=0;i<7;i++)\n for(int j=0;j<7/2;j++) swap(a[i][j],a[i][6-j]);\n}\n\nvoid ud_hanten(string a[]){\n for(int i=0;i<7;i++) \n for(int j=0;j<7/2;j++) swap(a[j][i],a[6-j][i]);\n}\n\nvoid rol_90(string a[]){\n string b[7];\n for(int i=0;i<7;i++)\n for(int j=0;j<7;j++) {\n b[i] += a[j][6-i];\n if(b[i][j] == '-') b[i][j] = '|';\n else if(b[i][j] =='|') b[i][j] = '-';\n }\n for(int i=0;i<7;i++) a[i] = b[i];\n}\n\nvoid choice(string num[],int x,int y){\n for(int i=0;i<7;i++){\n num[i]=\"\";\n for(int j=0;j<7;j++) num[i]+=str[y+i][x+j];\n }\n}\n\nvoid mk_dice(){\n string num[2][7];\n //ue\n choice(num[0],7,0),choice(num[1],36,0);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[0] = mk_num(num[0]),diceb[0]=mk_num(num[1]);\n \n //hidari\n choice(num[0],0,7),choice(num[1],29,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n rol_90(num[0]),rol_90(num[1]);\n dicea[1] = mk_num(num[0]),diceb[1] = mk_num(num[1]);\n\n //mid_hidari\n choice(num[0],7,7),choice(num[1],36,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[2] = mk_num(num[0]),diceb[2] = mk_num(num[1]);\n\n //mid_migi\n choice(num[0],14,7),choice(num[1],43,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n for(int i=0;i<3;i++)rol_90(num[0]),rol_90(num[1]);\n dicea[3] = mk_num(num[0]),diceb[3] = mk_num(num[1]);\n\n //migi\n choice(num[0],21,7),choice(num[1],50,7);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[4] = mk_num(num[0]),diceb[4] = mk_num(num[1]);\n\n\n //sita\n choice(num[0],7,14),choice(num[1],36,14);\n ud_hanten(num[0]),ud_hanten(num[1]);\n lr_hanten(num[0]),lr_hanten(num[1]);\n dicea[5] = mk_num(num[0]),diceb[5] = mk_num(num[1]);\n}\n\nint main(){\n while(1) {\n for(int i=0;i<21;i++){\n cin >> str[i];\n if(str[i]==\"0\")break;\n }\n if(str[0]==\"0\")break;\n mk_dice();\n sort(dicea,dicea+6);\n sort(diceb,diceb+6);\n int a=0,b=0;\n for(int i=0;i<6;i++) assert(dicea[i]!=-1 && diceb[i]!=-1);\n\n for(int i=0;i<1000;i++){\n if(dicea[rand()%6]>diceb[rand()%6]) a++;\n else if(dicea[rand()%6]<diceb[rand()%6])b++;\n }\n if(a>=b) cout<<\"HIGH\"<<endl;\n else cout <<\"LOW\"<<endl;\n }\n\n}\n\nint mk_num(string a[]){\n if(a[1]==\"#.....#\" &&\n a[2]==\"#...|.#\") return 1;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#.|...#\" &&\n a[5]==\"#..-..#\") return 2;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#...|.#\" && \n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 3;\n\n if(a[1]==\"#.....#\" &&\n a[5]==\"#.....#\") return 4;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 5;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|...#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 6;\n\n if(a[3]==\"#.....#\" &&\n a[5]==\"#.....#\") return 7;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#.|.|.#\" &&\n a[5]==\"#..-..#\") return 8;\n\n if(a[1]==\"#..-..#\" && \n a[2]==\"#.|.|.#\" &&\n a[3]==\"#..-..#\" &&\n a[4]==\"#...|.#\" &&\n a[5]==\"#..-..#\") return 9;\n return -1;\n}",
"accuracy": 0.5,
"time_ms": 10,
"memory_kb": 1216,
"score_of_the_acc": -0.3858,
"final_rank": 14
},
{
"submission_id": "aoj_1075_1130729",
"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\nstring face[10][7] = {\n { \"#######\",\n \"#.....#\",\n \"#...|.#\",\n \"#.....#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\" },\n\n { \"#######\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#.|...#\",\n \"#..-..#\",\n \"#######\" },\n\n { \"#######\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\" },\n\n { \"#######\",\n \"#.....#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#.....#\",\n \"#######\" },\n\n { \"#######\",\n \"#..-..#\",\n \"#.|...#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\" },\n\n { \"#######\",\n \"#..-..#\",\n \"#.|...#\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#######\" },\n\n { \"#######\",\n \"#..-..#\",\n \"#...|.#\",\n \"#.....#\",\n \"#...|.#\",\n \"#.....#\",\n \"#######\" },\n\n { \"#######\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#######\" },\n\n { \"#######\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\" }\n\n};\n\nstring input[100];\n\nvector<string> rotate90(const vector<string>& piece){\n vector<string> ret;\n int h = piece[0].size(), w = piece.size();\n ret.resize(h);\n for(int i=0;i<h;i++)ret[i].resize(w);\n for(int y=0;y<ret.size();y++){\n for(int x=0;x<ret[0].size();x++){\n ret[y][x] = piece[ret[0].size()-1-x][y];\n }\n }\n return ret;\n}\n\nint x[] = {7,0,7,14,21, 7};\nint y[] = {0,7,7, 7, 7,14};\n\ninline void vec_reverse(vector<string> &vec){ rep(i,vec.size()) reverse(vec[i].begin(),vec[i].end()); }\n\nvector<string> upper_change(vector<string> &vec){\n vector<string> ret = vec;\n rep(X,7) rep(Y,7) ret[Y][X] = vec[6-Y][X];\n return ret;\n}\n\nvoid rotate_prepare(vector<string> &vec) {\n rep(i,vec.size()) rep(j,vec[i].size()) {\n if( vec[i][j] == '|' ) vec[i][j] = '-';\n else if( vec[i][j] == '-' ) vec[i][j] = '|';\n }\n}\n\nint change(vector<string> &vec){\n rep(i,10) {\n bool failed = false;\n rep(j,7) if( face[i][j] != vec[j] ) { failed = true; break; }\n if( failed ) continue;\n return i + 1;\n }\n assert(false);\n}\n\nvector<int> getValue(vector<string> vec){\n vector<int> ret;\n rep(i,6){\n vector<string> block;\n rep(j,7) block.push_back(vec[y[i]+j].substr(x[i],7));\n if( i == 1 || i == 3 ) rotate_prepare(block);\n if( i == 1 ) block = rotate90(block);\n if( i == 3 ) rep(j,3) block = rotate90(block);\n vec_reverse(block);\n if( i == 5 ) block = upper_change(block);\n ret.push_back(change(block));\n }\n return ret;\n}\n\nvoid compute(){\n vector<string> term(21);\n rep(i,21) term[i] = input[i].substr(0,28);\n vector<int> dice[2];\n\n\n\n dice[0] = getValue(term);\n rep(i,21) term[i] = input[i].substr(29,28);\n dice[1] = getValue(term);\n int score[2] = {0,0};\n rep(i,6) rep(j,6) {\n if( dice[0][i] < dice[1][j] ) ++score[1];\n else if( dice[0][i] > dice[1][j] ) ++score[0];\n }\n if( score[0] >= score[1] ) puts(\"HIGH\");\n else puts(\"LOW\");\n}\n\nint main(){\n while(1){\n cin >> input[0];\n if( input[0] == \"0\" ) break;\n REP(i,1,21) cin >> input[i];\n compute();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1220,
"score_of_the_acc": -0.3871,
"final_rank": 10
},
{
"submission_id": "aoj_1075_609076",
"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};\nvoid rev_x(vector<string>& v){\n for(int y = 0; y < v.size(); y++){\n reverse(v[y].begin(), v[y].end());\n }\n}\nvoid rev_y(vector<string>& v){\n reverse(v.begin(), v.end());\n}\nvoid rotate90(vector<string>& v){\n vector<string> memo = v;\n for(int y = 0; y < 7; y ++){\n for(int x = 0; x < 7; x++){\n if(memo[y][x] == '|') memo[y][x] = '-';\n else if(memo[y][x] == '-') memo[y][x] = '|';\n v[6 - x][y] = memo[y][x];\n }\n }\n}\nvector<string> cye;\nint check(vector<string> die, int r){\n if(r == 6) rev_y(die);\n rev_x(die);\n if(r == 2) rotate90(die);\n if(r == 4) rotate90(die);\n if(r == 4) rotate90(die);\n if(r == 4) rotate90(die);\n for(int i = 0; i < 9; i++){\n vector<string> v(7);\n for(int y = 0; y < 7; y++){\n v[y] = cye[i * 7 + y];\n }\n if(v == die){\n return i + 1;\n }\n }\n assert(false);\n return 0;\n}\nvoid init(){\n cye.push_back(\"#######\");\n cye.push_back(\"#.....#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#.....#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#.|...#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#.....#\");\n cye.push_back(\"#.|.|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#.....#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#.|...#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#.|...#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#.|.|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#.....#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#.....#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#.|.|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#.|.|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#.|.|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#######\");\n}\n\nint main(){\n init();\n while(true){\n vector<string> grid(21);\n REP(i, 21) cin >> grid[i];\n if(cin.eof()) break;\n int bx[6] = {7, 0, 7, 14, 21, 7};\n int by[6] = {0, 7, 7, 7, 7, 14};\n vector<int> c1, c2;\n for(int i = 0; i < 6; i++){\n vector<string> die(7);\n REP(y, 7){\n die[y] = grid[y + by[i]].substr(bx[i], 7);\n }\n c1.push_back(check(die, i + 1));\n }\n for(int i = 0; i < 6; i++){\n vector<string> die(7);\n REP(y, 7){\n die[y] = grid[y + by[i]].substr(bx[i] + 29, 7);\n }\n c2.push_back(check(die, i + 1));\n }\n int ans = 0;\n REP(i, 6)REP(j, 6){\n if(c1[i] > c2[j]) ans++;\n if(c1[i] < c2[j]) ans--;\n }\n if(ans >= 0) cout << \"HIGH\" << endl;\n else cout << \"LOW\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1240,
"score_of_the_acc": -0.3934,
"final_rank": 11
},
{
"submission_id": "aoj_1075_609074",
"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};\nvoid rev_x(vector<string>& v){\n for(int y = 0; y < v.size(); y++){\n reverse(v[y].begin(), v[y].end());\n }\n}\nvoid rev_y(vector<string>& v){\n reverse(v.begin(), v.end());\n}\nvoid rotate90(vector<string>& v){\n vector<string> memo = v;\n for(int y = 0; y < 7; y ++){\n for(int x = 0; x < 7; x++){\n if(memo[y][x] == '|') memo[y][x] = '-';\n else if(memo[y][x] == '-') memo[y][x] = '|';\n v[6 - x][y] = memo[y][x];\n }\n }\n}\nvector<string> cye;\nint check(vector<string> die, int r){\n if(r == 6) rev_y(die);\n rev_x(die);\n if(r == 2) rotate90(die);\n if(r == 4) rotate90(die);\n if(r == 4) rotate90(die);\n if(r == 4) rotate90(die);\n for(int i = 0; i < 9; i++){\n vector<string> v(7);\n for(int y = 0; y < 7; y++){\n v[y] = cye[i * 7 + y];\n }\n if(v == die) return i + 1;\n }\n assert(false);\n return 0;\n}\nvoid init(){\n cye.push_back(\"#######\");\n cye.push_back(\"#.....#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#.....#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#.|...#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#.....#\");\n cye.push_back(\"#.|.|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#.....#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#.|...#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#.|...#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#.|.|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#.....#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#.....#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#.|.|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#.|.|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#######\");\n cye.push_back(\"#######\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#.|.|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#...|.#\");\n cye.push_back(\"#..-..#\");\n cye.push_back(\"#######\");\n}\n\nint main(){\n init();\n while(true){\n vector<string> grid(21);\n REP(i, 21) cin >> grid[i];\n if(cin.eof()) break;\n int bx[6] = {7, 0, 7, 14, 21, 7};\n int by[6] = {0, 7, 7, 7, 7, 14};\n int sum0 = 0;\n int sum1 = 0;\n for(int i = 0; i < 6; i++){\n vector<string> die(7);\n REP(y, 7){\n die[y] = grid[y + by[i]].substr(bx[i], 7);\n }\n sum0 += check(die, i + 1);\n }\n for(int i = 0; i < 6; i++){\n vector<string> die(7);\n REP(y, 7){\n die[y] = grid[y + by[i]].substr(bx[i] + 29, 7);\n }\n sum1 += check(die, i + 1);\n }\n if(sum0 >= sum1) cout << \"HIGH\" << endl;\n else cout << \"LOW\" << endl;\n }\n return 0;\n}",
"accuracy": 0.5,
"time_ms": 10,
"memory_kb": 1216,
"score_of_the_acc": -0.3858,
"final_rank": 14
},
{
"submission_id": "aoj_1075_568485",
"code_snippet": "#include<iostream>\n#include<string>\n#include<map>\n#include<vector>\n#include<algorithm>\n#define all(c) c.begin(),c.end()\n#define H 21\nusing namespace std;\ntypedef pair<int,int> P;\nint y[2][6]={{0,7,7,7,7,14},{0,7,7,7,7,14}},x[2][6]={{7,0,7,14,21,7},{36,29,36,43,50,36}};\nvector<string> s;\nvector<string> rot(vector<string> t){\n\tvector<string> u(7,\"\");\n\t//285992\n\t//626685\n\t\n\t\n\t\n\tfor(int i=0;i<7;i++){\n\t\tfor(int j=0;j<7;j++){\n\t\t\tu[i]+=t[j][6-i];\n\t\t\tif(u[i][j]=='|'){\n\t\t\t\tu[i][j]='-';\n\t\t\t}else if(u[i][j]=='-'){\n\t\t\t\tu[i][j]='|';\n\t\t\t}\n\t\t}\n\t}\n\t\n\treturn u;\n}\nint dig(vector<string> f){\n\tint a=0,b=0;\n\tfor(int i=0;i<7;i++){\n\t\tfor(int j=0;j<7;j++){\n\t\t\tif(f[i][j]=='|'){\n\t\t\t\ta++;\n\t\t\t}else if(f[i][j]=='-'){\n\t\t\t\tb++;\n\t\t\t}\n\t\t}\n\t}\n\tif(a==2&&b==1){//1 7\n\t\tif(f[1][3]=='-'){\n\t\t\treturn 7;\n\t\t}else{\n\t\t\treturn 1;\n\t\t}\n\t}else if(a==2&&b==3){//2 3 5\n\t\tif(f[4][2]=='|'){\n\t\t\treturn 2;\n\t\t}else if(f[2][2]=='|'){\n\t\t\treturn 5;\n\t\t}else{\n\t\t\treturn 3;\n\t\t}\n\t}else if(a==3&&b==1){\n\t\treturn 4;\n\t}else if(a==3&&b==3){//6 9\n\t\tif(f[2][4]=='|'){\n\t\t\treturn 9;\n\t\t}else{\n\t\t\treturn 6;\n\t\t}\n\t}else{\n\t\treturn 8;\n\t}\n\t\n}\nint cal(P a,int num){\n\tvector<string> f(7);\n\tfor(int i=0;i<7;i++){\n\t\tf[i]=s[a.second+i].substr(a.first,7);\n\t\treverse(all(f[i]));\n\t\t\n\t\t\n\t}\n\tif(num==1){\n\t\tf=rot(f);\n\t}else if(num==3){\n\t\tf=rot(f);f=rot(f);f=rot(f);\n\t}else if(num==5){\n\t\tvector<string> t=f;\n\t\tfor(int j=0;j<7;j++){\n\t\t\tf[j]=t[6-j];\n\t\t}\n\t}\n\t/*for(int i=0;i<7;i++){\n\t\tcout<<f[i]<<endl;\n\t}*/\n\t//cout<<dig(f)<<endl;\n\t\n\treturn dig(f);\n}\nint main(){\n\ts.resize(H);\n\twhile(cin>>s[0],s[0][0]!='0'){\n\t\tfor(int i=1;i<H;i++){\n\t\t\tcin>>s[i];\n\t\t}\n\t\tvector<int> m(6),o(6);\n\t\tfor(int i=0;i<6;i++){\n\t\t\tm[i]=cal(P(x[0][i],y[0][i]),i);\n\t\t}\n\t\tfor(int i=0;i<6;i++){\n\t\t\to[i]=cal(P(x[1][i],y[1][i]),i);\n\t\t}\n\t\tint win=0,lose=0;\n\t\tfor(int i=0;i<6;i++){\n\t\t\tfor(int j=0;j<6;j++){\n\t\t\t\tif(m[i]>o[j]){\n\t\t\t\t\twin++;\n\t\t\t\t}else if(m[i]<o[j]){\n\t\t\t\t\tlose++;\n\t\t\t\t}\n\t\t\t\t//cout<<m[i]<<\" \"<<o[j]<<\" \"<<win<<\" \"<<lose<<endl;\n\t\t\t}\n\t\t}\n\t\t//cout<<win<<\" \"<<lose<<endl;\n\t\tif(win>=lose)\n\t\t\tcout<<\"HIGH\"<<endl;\n\t\telse\n\t\t\tcout<<\"LOW\"<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1196,
"score_of_the_acc": -0.3794,
"final_rank": 8
},
{
"submission_id": "aoj_1075_373291",
"code_snippet": "#include <cstdio>\n#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\nstring pip[9][7] = \n{\n {\"#######\",\n \"#.....#\",\n \"#...|.#\",\n \"#.....#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\"},\n {\"#######\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#.|...#\",\n \"#..-..#\",\n \"#######\"},\n {\"#######\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\"},\n {\"#######\",\n \"#.....#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#.....#\",\n \"#######\"},\n {\"#######\",\n \"#..-..#\",\n \"#.|...#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\"},\n {\"#######\",\n \"#..-..#\",\n \"#.|...#\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#######\"},\n {\"#######\",\n \"#..-..#\",\n \"#...|.#\",\n \"#.....#\",\n \"#...|.#\",\n \"#.....#\",\n \"#######\"},\n {\"#######\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#######\"},\n {\"#######\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\"}\n};\n\nvoid rotate(vector<string>& s)\n{\n vector<string> t(7, string(7, ' '));\n for(int i=0; i<7; ++i){\n for(int j=0; j<7; ++j){\n t[i][j] = s[j][6-i];\n if(t[i][j] == '-')\n t[i][j] = '|';\n else if(t[i][j] == '|')\n t[i][j] = '-';\n }\n }\n s.swap(t);\n}\n\nvoid turnX(vector<string>& s)\n{\n for(int i=0; i<7; ++i){\n for(int j=0; j<3; ++j){\n swap(s[i][j], s[i][6-j]);\n }\n }\n}\n\nvoid turnY(vector<string>& s)\n{\n for(int i=0; i<7; ++i){\n for(int j=0; j<3; ++j){\n swap(s[j][i], s[6-j][i]);\n }\n }\n}\n\nint y[6] = {0, 7, 7, 7, 7, 14};\nint x[6] = {7, 0, 7, 14, 21, 7};\n\nint main()\n{\n for(;;){\n vector<string> s(21);\n for(int i=0; i<21; ++i)\n cin >> s[i];\n if(s[0] == \"0\")\n return 0;\n\n vector<vector<int> > n(2, vector<int>(6, 0));\n for(int i=0; i<2; ++i){\n for(int j=0; j<6; ++j){\n vector<string> t(7);\n for(int k=0; k<7; ++k)\n t[k] = s[y[j]+k].substr(x[j]+29*i, 7);\n\n if(j == 3)\n rotate(t);\n if(j == 1){\n rotate(t);\n rotate(t);\n rotate(t);\n }\n turnX(t);\n if(j == 5)\n turnY(t);\n \n while(t != vector<string>(pip[n[i][j]], pip[n[i][j]]+7))\n ++ n[i][j];\n }\n }\n\n int ret = 0;\n for(int i=0; i<6; ++i){\n for(int j=0; j<6; ++j){\n if(n[0][i] > n[1][j])\n ++ ret;\n if(n[0][i] < n[1][j])\n -- ret;\n }\n }\n\n if(ret >= 0)\n cout << \"HIGH\" << endl;\n else\n cout << \"LOW\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1075_366488",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\nint ty[2][6] = {{0, 7, 7, 7, 7, 14}, {0, 7, 7, 7, 7, 14}};\nint tx[2][6] = {{7, 0, 7, 14, 21, 7}, {36, 29, 36, 43, 50, 36}};\nchar input[21][57];\nstring tmp[7];\nstring data[9][7] = {\n {\"#######\",\n \"#.....#\",\n \"#...|.#\",\n \"#.....#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\",},\n {\"#######\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#.|...#\",\n \"#..-..#\",\n \"#######\",},\n {\"#######\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\",},\n {\"#######\",\n \"#.....#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#.....#\",\n \"#######\",},\n {\"#######\",\n \"#..-..#\",\n \"#.|...#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\",},\n {\"#######\",\n \"#..-..#\",\n \"#.|...#\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#######\",},\n {\"#######\",\n \"#..-..#\",\n \"#...|.#\",\n \"#.....#\",\n \"#...|.#\",\n \"#.....#\",\n \"#######\",},\n {\"#######\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#######\",},\n {\"#######\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\",\n }\n};\n\nint judge(){\n for(int i=0;i<9;i++){\n bool f = true;\n for(int j=0;j<7;j++){\n if(tmp[j] != data[i][j]){\n f = false;\n break;\n }\n }\n if(f) return i+1;\n }\n return -1;\n}\n\nint calc1(int y, int x, int d){\n for(int i=0;i<7;i++){\n tmp[i] = \"\";\n for(int j=0;j<7;j++){\n tmp[i] += input[i+y][j+x];\n }\n }\n for(int i=0;i<7;i++) reverse(tmp[i].begin(), tmp[i].end());\n if(d != 0){\n string tmp2[7];\n for(int i=0;i<7;i++) tmp2[i] = tmp[i];\n if(d == 270){\n for(int i=0;i<7;i++){\n for(int j=0;j<7;j++){\n tmp[i][j] = tmp2[6-j][i];\n if(tmp[i][j] == '-') tmp[i][j] = '|';\n else if(tmp[i][j] == '|') tmp[i][j] = '-';\n }\n }\n }else{\n for(int i=0;i<7;i++){\n for(int j=0;j<7;j++){\n tmp[i][j] = tmp2[j][6-i];\n if(tmp[i][j] == '-') tmp[i][j] = '|';\n else if(tmp[i][j] == '|') tmp[i][j] = '-';\n }\n }\n }\n }\n return judge();\n}\n\nint calc2(int y, int x){\n for(int i=0;i<7;i++){\n tmp[i] = \"\";\n for(int j=0;j<7;j++){\n tmp[i] += input[i+y][j+x];\n }\n }\n reverse(tmp, tmp+7);\n for(int i=0;i<7;i++) reverse(tmp[i].begin(), tmp[i].end());\n return judge();\n}\n\nmain(){\n while(cin >> input[0][0]){\n if(input[0][0] == '0') break;\n for(int i=0;i<21;i++){\n for(int j=0;j<57;j++){\n if(i == 0 && j == 0) continue;\n cin >> input[i][j];\n }\n }\n int point[2][6];\n for(int i=0;i<2;i++){\n for(int j=0;j<6;j++){\n if(j == 5) point[i][j] = calc2(ty[i][j], tx[i][j]);\n else{\n int d = 0;\n if(j == 1) d = 90;\n if(j == 3) d = 270;\n point[i][j] = calc1(ty[i][j], tx[i][j], d);\n }\n }\n }\n int ans1 = 0, ans2 = 0;\n for(int i=0;i<6;i++){\n for(int j=0;j<6;j++){\n if(point[0][i] > point[1][j]) ans1++;\n else if(point[0][i] < point[1][j]) ans2++;\n }\n }\n cout << (ans1<ans2 ? \"LOW\" : \"HIGH\") << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1075_338382",
"code_snippet": "#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<cassert>\n#include<iostream>\n#include<sstream>\n#include<string>\n#include<vector>\n#include<queue>\n#include<set>\n#include<map>\n#include<utility>\n#include<numeric>\n#include<algorithm>\n#include<bitset>\n#include<complex>\n#include<stack>\n\nusing namespace std;\n\ntypedef long long Int;\ntypedef vector<int> vint;\ntypedef pair<int,int> pint;\ntypedef vector<string> vstring;\ntypedef vector<pint> vpint;\n\nstruct Edge{int to,from,cost;};\n\n#ifdef DEBUGLOCAL\n#define debug cout\n#else\nstringstream __ss__;\n#define debug __ss__\n#endif\n\ntemplate<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) debug << *i << \" \"; debug << endl; }\ntemplate<class T> void chmin(T &t, T f) { if (t > f) t = f; }\ntemplate<class T> void chmax(T &t, T f) { if (t < f) t = f; }\nint in() { int x; scanf(\"%d\", &x); return x; }\n\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define repd(i,n) for(int i=(n)-1;i>=0;+--)\n#define repn(i,m,n) for(int i=(m);i<=(n);++i)\n#define repnd(i,m,n) for(int i=(n)-1;i>=(m);+--)\n#define rep0(i,n) for(i=0;i<(n);++i)\n#define all(n) n.begin(),n.end()\n#define sz(n) ((int)(n).size())\n#define MP make_pair\n#define PB push_back\n#define SS stringstream\n#define PUTLINE debug<<\"LINE:\"<<__LINE__<<endl;\n\nconst int INF = 2147483647;\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\n\nconst int dx[]={1,-1,0,0,1,-1,1,-1,0};\nconst int dy[]={0,0,1,-1,1,-1,-1,1,0};\n\nstring str[21];\nstring num[10][7]={\n{\n\"#######\",\n\"#.....#\",\n\"#...|.#\",\n\"#.....#\",\n\"#...|.#\",\n\"#..-..#\",\n\"#######\"\n},{\n\"#######\",\n\"#..-..#\",\n\"#...|.#\",\n\"#..-..#\",\n\"#.|...#\",\n\"#..-..#\",\n\"#######\"\n},{\n\"#######\",\n\"#..-..#\",\n\"#...|.#\",\n\"#..-..#\",\n\"#...|.#\",\n\"#..-..#\",\n\"#######\"\n},{\n\"#######\",\n\"#.....#\",\n\"#.|.|.#\",\n\"#..-..#\",\n\"#...|.#\",\n\"#.....#\",\n\"#######\"\n},{\n\"#######\",\n\"#..-..#\",\n\"#.|...#\",\n\"#..-..#\",\n\"#...|.#\",\n\"#..-..#\",\n\"#######\"\n},{\n\"#######\",\n\"#..-..#\",\n\"#.|...#\",\n\"#..-..#\",\n\"#.|.|.#\",\n\"#..-..#\",\n\"#######\"\n},{\n\"#######\",\n\"#..-..#\",\n\"#...|.#\",\n\"#.....#\",\n\"#...|.#\",\n\"#.....#\",\n\"#######\"\n},{\n\"#######\",\n\"#..-..#\",\n\"#.|.|.#\",\n\"#..-..#\",\n\"#.|.|.#\",\n\"#..-..#\",\n\"#######\"\n},{\n\"#######\",\n\"#..-..#\",\n\"#.|.|.#\",\n\"#..-..#\",\n\"#...|.#\",\n\"#..-..#\",\n\"#######\"\n}\n};\n\nvstring rotate(vstring vs){\n\tvstring res;\n\trep(i,7){\n\t\tstring st;\n\t\trep(j,7){\n\t\t\tst+=vs[6-j][i]=='-'?'|':vs[6-j][i]=='|'?'-':vs[6-j][i];\n\t\t}\n\t\tres.PB(st);\n\t}\n\treturn res;\n}\n\nint saikoro(vstring men){\n\trep(j,9){\n\t\tint i;\n\t\trep0(i,7)if(num[j][i]!=men[i])break;\n\t\tif(i==7)return j+1;\n\t}\n//rep(i,7)cout<<men[i]<<endl;\nassert(0);\n\treturn 0;\n}\n\nvstring cut(int y,int x){\n\tvstring res;\n\trep(i,7){\n\t\tres.PB(str[y+i].substr(x,7));\n\t}\n\treturn res;\n}\n\nvstring lr(vstring vs){\n\tvstring res;\n\trep(i,7){\n\t\tstring rev=vs[i];\n\t\treverse(all(rev));\n\t\tres.PB(rev);\n\t}\n\treturn res;\n}\n\nvstring ud(vstring vs){\n\tvstring res;\n\trep(i,7){\n\t\tres.PB(vs[6-i]);\n\t}\n\treturn res;\n}\n\nint main() {\n\tfor(;;){\n\t\tcin>>str[0];\n\t\tif(str[0]==\"0\")break;\n\t\trepn(i,1,20)cin>>str[i];\n\t\tint m[6],s[6];\n\t\ts[0]=saikoro(lr(cut(0,7)));\n\t\ts[1]=saikoro(lr(rotate(cut(7,0))));\n\t\ts[2]=saikoro(lr(cut(7,7)));\n\t\ts[3]=saikoro(lr(rotate(rotate(rotate(cut(7,14))))));\n\t\ts[4]=saikoro(lr(cut(7,21)));\n\t\ts[5]=saikoro(ud(lr(cut(14,7))));\n\t\tm[0]=saikoro(lr(cut(0,36)));\n\t\tm[1]=saikoro(lr(rotate(cut(7,29))));\n\t\tm[2]=saikoro(lr(cut(7,36)));\n\t\tm[3]=saikoro(lr(rotate(rotate(rotate(cut(7,43))))));\n\t\tm[4]=saikoro(lr(cut(7,50)));\n\t\tm[5]=saikoro(ud(lr(cut(14,36))));\n\t\tint aa=0,bb=0;\n\t\trep(i,6)rep(j,6){\n\t\t\tif(s[i]>m[j])++aa;\n\t\t\tif(s[i]<m[j])++bb;\n\t\t}\n\t\tif(aa>=bb)cout<<\"HIGH\\n\";\n\t\telse cout<<\"LOW\\n\";\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_1075_272721",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <climits>\n#include <cmath>\n#include <ctime>\n#include <cassert>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <iomanip>\n#include <complex>\n#include <string>\n#include <vector>\n#include <list>\n#include <deque>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <bitset>\n#include <iterator>\n#include <functional>\n#include <utility>\n#include <algorithm>\n#include <numeric>\n#include <typeinfo>\n\nusing namespace std;\n\n#define dump(n) cerr<<\"# \"<<#n<<\"=\"<<(n)<<endl\n#define repi(i,a,b) for(int i=int(a);i<int(b);i++)\n#define rep(i,n) repi(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 allof(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<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\n\nvoid turn(vs& grid)\n{\n\tvs temp(5,string(5,'#'));\n\trep(i,5) rep(j,5){\n\t\tchar c='#';\n\t\tif(grid[i][j]=='|') c='-';\n\t\tif(grid[i][j]=='-') c='|';\n\t\tif(grid[i][j]=='.') c='.';\n\t\ttemp[j][4-i]=c;\n\t}\n\tgrid=temp;\n}\n\nvoid reverse(vs& grid)\n{\n\trep(i,5)\n\t\treverse(allof(grid[i]));\n}\n\nint getval(vs& lines,int oi,int oj,bool isrev,int tcount)\n{\n\tvs grid(5);\n\trep(i,5)\n\t\tgrid[i]=lines[oi+1+i].substr(oj+1,5);\n\trep(i,tcount)\n\t\tturn(grid);\n\tif(isrev)\n\t\treverse(grid);\n\t\n\tstring _ss[10][5]={\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\t{\"..-..\",\".|.|.\",\"..-..\",\".|.|.\",\"..-..\"},\n\t\t{\"..-..\",\".|.|.\",\"..-..\",\"...|.\",\"..-..\"},\n\t};\n\tvector<vs> ss(10,vs(5));\n\trepi(i,1,10)\n\t\tss[i]=vs(_ss[i],_ss[i]+5);\n\t\n\trepi(i,1,10)\n\t\tif(ss[i]==grid)\n\t\t\treturn i;\n\treturn -1;\n}\n\nint main()\n{\n\tfor(;;){\n\t\tvs lines(21);\n\t\trep(i,21) cin>>lines[i];\n\t\tif(lines[0]==\"0\") break;\n\t\tvvi a(2,vi(6));\n\t\trep(i,2){\n\t\t\tint oj=i*29;\n\t\t\ta[i][0]=getval(lines,0,oj+7,true,0);\n\t\t\ta[i][1]=getval(lines,7,oj+0,true,1);\n\t\t\ta[i][2]=getval(lines,7,oj+7,true,0);\n\t\t\ta[i][3]=getval(lines,7,oj+14,true,3);\n\t\t\ta[i][4]=getval(lines,7,oj+21,true,0);\n\t\t\ta[i][5]=getval(lines,14,oj+7,false,2);\n\t\t}\n\t\tint hi=0,lo=0;\n\t\trep(i,6) rep(j,6){\n\t\t\tif(a[0][i]>a[1][j]) hi++;\n\t\t\tif(a[0][i]<a[1][j]) lo++;\n\t\t}\n\t\tif(hi>=lo)\n\t\t\tputs(\"HIGH\");\n\t\telse\n\t\t\tputs(\"LOW\");\n\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_1075_271439",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <queue>\n#include <map>\n#include <set>\n#include <cstring>\n#include <cstdlib>\n#include <string>\n#include <cmath>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\nconst int INF = 1<<29;\n\nbool dice[9][7][7];\n\nint equal(bool d[7][7], int flag) {\n // REP(y, 7) {\n // REP(x, 7) {\n // cout << d[x][y];\n // }\n // cout << endl;\n // }\n // cout << endl;\n REP(i, 9) {\n bool f = 1;\n if (flag == 0) {\n REP(y, 7)\n REP(x, 7)\n if (d[x][y] != dice[i][6-x][y])\n f = 0;\n if (f) return i;\n } else if (flag == 1) {\n REP(y, 7)\n REP(x, 7)\n if (d[x][y] != dice[i][y][x])\n f = 0;\n if (f) return i;\n } else if (flag == 2) {\n REP(y, 7)\n REP(x, 7)\n if (d[x][y] != dice[i][6-y][6-x])\n f = 0;\n if (f) return i;\n } else {\n REP(y, 7)\n REP(x, 7)\n if (d[x][y] != dice[i][6-x][6-y])\n f = 0;\n if (f) return i;\n }\n }\n return -2;\n}\n\nvector<int> hoge(bool table[21][28]) {\n // REP(y, 21) {\n // REP(x, 28) {\n // cout << table[y][x];\n // }\n // cout << endl;\n // }\n // cout << endl;\n vector<int> v;\n bool tmp[7][7];\n REP(i, 2) {\n REP(y,7)\n REP(x,7)\n tmp[x][y] = table[i*7+y][x+7];\n v.push_back(equal(tmp, 0)+1); // ツ債カツ右ツ板スツ転\n }\n REP(y, 7) {\n REP(x, 7) {\n tmp[x][y] = table[7+y][21+x];\n }\n }\n v.push_back(equal(tmp, 0)+1); // ツ債カツ右ツ板スツ転\n REP(y, 7) {\n REP(x, 7) {\n tmp[x][y] = table[y+7][x];\n }\n }\n v.push_back(equal(tmp, 1)+1); //\n REP(y, 7) {\n REP(x, 7) {\n tmp[x][y] = table[y+7][14+x];\n }\n }\n v.push_back(equal(tmp, 2)+1); //\n REP(y, 7) {\n REP(x, 7) {\n tmp[x][y] = table[y+14][7+x];\n }\n }\n v.push_back(equal(tmp, 3)+1); //\n\n \n // FOR(it, v) {\n // cout<< *it << \" \";\n // }\n // cout << endl;\n return v;\n}\n\nint main() {\n dice[0][4][2]=dice[0][4][4]=dice[0][3][5] = 1;\n dice[1][3][1]=dice[1][4][2]=dice[1][3][3]=dice[1][2][4]=dice[1][3][5] = 1;\n dice[2][3][1]=dice[2][4][2]=dice[2][3][3]=dice[2][4][4]=dice[2][3][5] = 1;\n dice[3][2][2]=dice[3][4][2]=dice[3][3][3]=dice[3][4][4] = 1;\n dice[4][3][1]=dice[4][2][2]=dice[4][3][3]=dice[4][4][4]=dice[4][3][5] = 1;\n dice[5][3][1]=dice[5][2][2]=dice[5][3][3]=dice[5][2][4]=dice[5][4][4]=dice[5][3][5] = 1;\n dice[6][3][1]=dice[6][4][2]=dice[6][4][4] = 1;\n dice[7][3][1]=dice[7][2][2]=dice[7][4][2]=dice[7][3][3]=dice[7][2][4]=dice[7][4][4]=dice[7][3][5] = 1;\n dice[8][3][1]=dice[8][2][2]=dice[8][4][2]=dice[8][3][3]=dice[8][4][4]=dice[8][3][5] = 1;\n\n\n // REP(i, 9) {\n // REP(y, 7) {\n // REP(x, 7) {\n // cout << dice[i][x][y];\n // }\n // cout << endl;\n // }\n // cout << endl;\n // }\n bool table[21][57];\n char c;\n while(cin>>c,c!='0') {\n REP(i,21) {\n REP(j,57) {\n if (i||j)\n cin >> c;\n if (c=='-'||c=='|') {\n table[i][j] = 1;\n }\n else table[i][j] = 0;\n }\n }\n vector<int> v[2];\n bool table1[21][28];\n REP(i,2) {\n REP(y, 21) {\n REP(x, 28) {\n table1[y][x] = table[y][i*29+x];\n }\n }\n v[i] = hoge(table1);\n }\n\n int low=0, high=0;\n REP(i, 6) {\n REP(j, 6) {\n if (v[0][i] < v[1][j]) {\n low++;\n } else if (v[0][i] > v[1][j])\n high++;\n }\n }\n if (low>high) {\n cout << \"LOW\" << endl;\n } else {\n cout << \"HIGH\" << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1075_271296",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nconst string num[9][7] = {\n {\n\"#######\",\n\"#.....#\",\n\"#...|.#\",\n\"#.....#\",\n\"#...|.#\",\n\"#..-..#\",\n\"#######\"\n },\n {\n\"#######\",\n\"#..-..#\",\n\"#...|.#\",\n\"#..-..#\",\n\"#.|...#\",\n\"#..-..#\",\n\"#######\"\n },\n {\n\"#######\",\n\"#..-..#\",\n\"#...|.#\",\n\"#..-..#\",\n\"#...|.#\",\n\"#..-..#\",\n\"#######\"\n },\n {\n\"#######\",\n\"#.....#\",\n\"#.|.|.#\",\n\"#..-..#\",\n\"#...|.#\",\n\"#.....#\",\n\"#######\"\n },\n {\n\"#######\",\n\"#..-..#\",\n\"#.|...#\",\n\"#..-..#\",\n\"#...|.#\",\n\"#..-..#\",\n\"#######\"\n },\n {\n\"#######\",\n\"#..-..#\",\n\"#.|...#\",\n\"#..-..#\",\n\"#.|.|.#\",\n\"#..-..#\",\n\"#######\"\n },\n {\n\"#######\",\n\"#..-..#\",\n\"#...|.#\",\n\"#.....#\",\n\"#...|.#\",\n\"#.....#\",\n\"#######\"\n },\n {\n\"#######\",\n\"#..-..#\",\n\"#.|.|.#\",\n\"#..-..#\",\n\"#.|.|.#\",\n\"#..-..#\",\n\"#######\"\n },\n {\n\"#######\",\n\"#..-..#\",\n\"#.|.|.#\",\n\"#..-..#\",\n\"#...|.#\",\n\"#..-..#\",\n\"#######\"\n }\n};\n\nstring A[28], B[28];\n\nbool equals(vector<string> &s, const string t[7]) {\n for(int i = 0; i < 7; ++i) {\n for(int j = 0; j < 7; ++j) {\n if((s[i][j] == '-' || s[i][j] == '|') &&\n\t (t[i][j] == '-' || t[i][j] == '|')) continue;\n if(s[i][j] != t[i][j]) return false;\n }\n }\n return true;\n}\n\nint getNum(vector<string> &s) {\n for(int i = 0; i < 9; ++i) {\n if(equals(s, num[i])) return i+1;\n }\n return 0;\n}\n\nvoid reverseLR(vector<string> &s) {\n for(int i = 0; i < 7; ++i) reverse(s[i].begin(), s[i].end());\n}\n\nvoid reverseTD(vector<string> &s) {\n for(int i = 0; i < 7/2; ++i) {\n for(int j = 0; j < 7; ++j) {\n swap(s[i][j], s[6-i][j]);\n }\n }\n}\n\nvector<string> rotate90(vector<string> s) {\n vector<string> t(7, \" \");\n for(int i = 0; i < 7; ++i) {\n for(int j = 0; j < 7; ++j) {\n t[i][j] = s[j][6-i];\n }\n }\n return t;\n}\n\nvector<string> rotate270(vector<string> s) {\n vector<string> t(7, \" \");\n for(int i = 0; i < 7; ++i) {\n for(int j = 0; j < 7; ++j) {\n t[i][j] = s[6-j][i];\n }\n }\n return t;\n}\n\n\nvector<string> getFace(int x, int y, string u[28]) {\n vector<string> v;\n for(int i = 0; i < 7; ++i) {\n v.push_back(u[y+i].substr(x,7));\n }\n return v;\n}\n\nvoid show(vector<string> &v) {\n for(int i = 0; i < v.size(); ++i) cout << v[i] << endl;\n}\n\nvoid calcPoint(string u[28], vector<int> &v) {\n vector< vector<string> > face;\n face.push_back(getFace(7,0,u));\n face.push_back(getFace(0,7,u));\n face.push_back(getFace(7,7,u));\n face.push_back(getFace(14,7,u));\n face.push_back(getFace(21,7,u));\n face.push_back(getFace(7,14,u));\n reverseLR(face[0]);\n face[1] = rotate270(face[1]);\n reverseLR(face[1]);\n reverseLR(face[2]);\n face[3] = rotate90(face[3]);\n reverseLR(face[3]);\n reverseLR(face[4]);\n reverseLR(face[5]);\n reverseTD(face[5]);\n int point = 0;\n for(int i = 0; i < 6; ++i) {\n v.push_back(getNum(face[i]));\n }\n}\n\nstring solve() {\n vector<int> v[2];\n calcPoint(A, v[0]);\n calcPoint(B, v[1]);\n int a, b;\n a = b = 0;\n for(int i = 0; i < v[0].size(); ++i) {\n for(int j = 0; j < v[1].size(); ++j) {\n if(v[0][i] > v[1][j]) ++a;\n else if(v[0][i] < v[1][j]) ++b;\n }\n }\n if(a >= b) return \"HIGH\";\n else return \"LOW\";\n}\n\nint main() {\n while(true) {\n string line;\n for(int i = 0; i < 21; ++i) {\n getline(cin, line);\n if(line[0] == '0') return 0;\n A[i] = line.substr(0,28);\n B[i] = line.substr(29);\n }\n cout << solve() << 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_1075_271258",
"code_snippet": "#include<iostream>\n#include<cassert>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\nusing namespace std;\nstring digit[9][7]={\n \"#######\",\n \"#.....#\",\n \"#...|.#\",\n \"#.....#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\",\n \"#######\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#.|...#\",\n \"#..-..#\",\n \"#######\",\n \"#######\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\",\n \"#######\",\n \"#.....#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#.....#\",\n \"#######\",\n \"#######\",\n \"#..-..#\",\n \"#.|...#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\",\n \"#######\",\n \"#..-..#\",\n \"#.|...#\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#######\",\n \"#######\",\n \"#..-..#\",\n \"#...|.#\",\n \"#.....#\",\n \"#...|.#\",\n \"#.....#\",\n \"#######\",\n \"#######\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#######\",\n \"#######\",\n \"#..-..#\",\n \"#.|.|.#\",\n \"#..-..#\",\n \"#...|.#\",\n \"#..-..#\",\n \"#######\"\n};\n\nvector<string> rotate(vector<string> in){\n int r=in.size(),c=in[0].size();\n vector<string> ret(r,string(c,' '));\n for(int i=0;i<r;i++){\n for(int j=0;j<c;j++){\n ret[i][j]=in[c-j-1][i];\n if (ret[i][j] == '-')ret[i][j]='|';\n else if (ret[i][j] == '|')ret[i][j]='-';\n }\n }\n return ret;\n}\n\nvector<string> lrReverse(vector<string> in){\n int r=in.size(),c=in[0].size();\n for(int i=0;i<r;i++){\n for(int j=0;j<c/2;j++){\n swap(in[i][j],in[i][c-1-j]);\n }\n }\n return in;\n}\n\nvector<string> udReverse(vector<string> in){\n int r=in.size(),c=in[0].size();\n for(int j=0;j<c;j++){\n for(int i=0;i<r/2;i++){\n swap(in[i][j],in[r-1-i][j]);\n }\n }\n return in;\n}\n\nvector<string> getcube(string *in,int y,int x){\n vector<string> ret;\n for(int i=0;i<7;i++){\n string tmp = in[y+i].substr(x,7);\n ret.push_back(tmp);\n }\n return ret;\n}\n\nint getdata(vector<string> &in,int pos){\n for(int i=0;i<9;i++){\n vector<string> tmp;\n for(int j=0;j<7;j++)tmp.push_back(digit[i][j]);\n if (pos == 1){\n tmp=rotate(tmp);\n }else if (pos == 3){\n for(int i=0;i<3;i++)tmp=rotate(tmp);\n }else if (pos == 5){\n tmp=udReverse(tmp);\n }\n tmp=lrReverse(tmp);\n if (tmp == in)return i+1;\n }\n assert(false);\n}\n\nmain(){\n const int py[3]={0,7,14};\n const int px[3][4]={\n {7,-1,-1,-1},\n {0,7,14,21},\n {7,-1,-1,-1}\n };\n const int p[3]={1,4,1};\n string in[21];\n while(cin>>in[0]){\n if (in[0] == \"0\")break;\n for(int i=1;i<21;i++)cin>>in[i];\n vector<int> d[2];\n for(int l=0;l<2;l++){\n int basex=l*29;\n int cnt=0;\n for(int i=0;i<3;i++){\n\tfor(int j=0;j<p[i];j++){\n\t vector<string> tmp = getcube(in,py[i],basex+px[i][j]);\n\t d[l].push_back(getdata(tmp,cnt++));\n\t}\n }\n }\n assert(d[0] != d[1]);\n int high=0,low=0;\n for(int i=0;i<6;i++){\n for(int j=0;j<6;j++){\n\tif (d[0][i] > d[1][j])high++;\n\telse if (d[0][i] < d[1][j])low++;\n }\n }\n cout << (high>=low?\"HIGH\":\"LOW\") << endl;\n }\n return false;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 912,
"score_of_the_acc": -0.3359,
"final_rank": 7
}
] |
aoj_1077_cpp
|
Problem D: The Great Summer Contest
現在、人々の娯楽はプログラミングコンテストに限られている。彼女が所属しているとある中学校の娯楽部の活動内容は、プログラミングコンテストを企画し運営することだ。彼女の仕事は問題を作成することではない。多くの人から問題を募り、審判団を組織し、またコンテストの宣伝を行う、いわば裏方のお仕事だ。カリスマ作題者や著名なアルゴリズマーと違い、そういった仕事をする人に光が当たることはほとんどない。存在感はないけれども欠かすことのできないその仕事に、彼女は誇りを持って取り組んでいた。
娯楽部は常に問題を募集しているが、それらの問題は以下の 6 種類に分類される。
Math
Greedy
Geometry
DP
Graph
Other
幸いにも多くの問題が集まったので、彼女はたくさんコンテストを開こうと考えた。コンテストは 3 問の問題からなるが、彼女はコンテストがより教育的になるようにと、以下の 4 種類のコンテストを開くことに決めた。
数学ゲーコンテスト: Math の問題と DP の問題合わせて3問の問題セット
アルゴリズムゲーコンテスト: Greedy の問題と Graph の問題合わせて3問の問題セット
実装ゲーコンテスト: Geometry の問題と Other の問題合わせて3問の問題セット
バランスの良いコンテスト: Math または DP から 1 問、Greedy または Graph から 1 問、Geometry または Other から 1 問、合わせて3問の問題セット
もちろん、あるコンテストに出題した問題は他のコンテストに出題することはできない。彼女の望みは、できるだけ多くのコンテストを開くことだ。6 種類の問題のストック数は分かっているが、さて、最大何回コンテストを開けるだろうか。彼女にとってこれは難しい問題だが、カリスマアルゴリズマーであるあなたなら解決できるはずだ。
Input
入力は複数のケースからなる。
各ケースは以下のフォーマットで与えられる。
n
Math
n
Greedy
n
Geometry
n
DP
n
Graph
n
Other
各入力の値はそれぞれの種類の問題のストックの数を表す。
入力の終わりは
0 0 0 0 0 0
からなる行によって与えられる。
各値は以下の条件を満たす。
n
Math
+
n
Greedy
+
n
Geometry
+
n
DP
+
n
Graph
+
n
Other
≤ 100,000,000
またテストケースの数は20,000個を超えない。
Output
開催可能なコンテストの最大数を1行に出力せよ。
Sample input
1 1 1 1 1 1
1 1 1 0 0 0
1 0 0 0 1 1
3 0 0 3 0 0
3 1 0 1 3 1
1 2 0 2 0 1
0 0 1 1 0 3
1 0 0 1 1 0
0 0 0 0 0 0
Sample output
2
1
1
2
3
1
1
0
The University of Aizu Programming Contest 2011 Summer
原案: Tomoya Sakai
問題文: Takashi Tayama
|
[
{
"submission_id": "aoj_1077_3911814",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <ctime>\n#include <cctype>\n#include <cstring>\n#include <utility>\n#include <map>\n#include <queue>\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef long long ll;\n\nint main()\n{\n ll a,b,c,d,e,f;\n cin>>a>>b>>c>>d>>e>>f;\n while(a||b||c||d||e||f)\n {\n a=a+d;\n b=b+e;\n c=c+f;\n vector<int>m;\n m.push_back(a%3);\n m.push_back(b%3);\n m.push_back(c%3);\n ll sum=0;\n int cnt=0;\n int cnt1=0;\n for(int i=0;i<3;i++)\n {\n if(m[i]==2)\n cnt++;\n else if(m[i]==0)\n cnt1++;\n }\n if(cnt==2&&cnt1==1&&(a>=2||b>=2||c>=2))\n {\n a-=2;\n b-=2;\n c-=2;\n sum+=2;\n }\n sum+=a/3+b/3+c/3;\n sum+=min(min(a%3,b%3),c%3);\n \n \n \n cout<<sum<<endl;\n \n cin>>a>>b>>c>>d>>e>>f;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3124,
"score_of_the_acc": -1.045,
"final_rank": 18
},
{
"submission_id": "aoj_1077_3911809",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#define _GLIBCXX_DEBUG\n#include<bits/stdc++.h>\nusing namespace::std;\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\n// random_device rd;\n// mt19937 mt(rd());\n// #include <boost/numeric/interval.hpp>\n// #include <boost/numeric/interval/io.hpp>\n// #include <boost/intrusive/rbtree.hpp>\n// #include <boost/geometry.hpp>\n// #include <boost/geometry/geometries/linestring.hpp>\n// #include <boost/geometry/geometries/polygon.hpp>\n// #include <boost/geometry/geometries/point_xy.hpp>\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// typedef mp::number<mp::cpp_dec_float<0>> cfloat;\n// typedef mp::cpp_int cint;\n\n#include<ext/pb_ds/assoc_container.hpp>\n#include<ext/pb_ds/tree_policy.hpp>\n#include <ext/pb_ds/priority_queue.hpp>\n#include<ext/pb_ds/tag_and_trait.hpp>\nusing namespace __gnu_pbds;\ntemplate<typename T=long long>using pbds=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;\ntemplate<typename T=long long>using pqueue =__gnu_pbds::priority_queue<T, less<T>,rc_binomial_heap_tag>;\ntypedef long long lint;\ntypedef long long ll;\ntypedef long double ldouble;\ntypedef vector<lint> vec;\ntypedef vector<vector<lint>> mat;\ntypedef vector<vector<vector<lint>>> mat3;\ntypedef vector<double> dvec;\ntypedef vector<vector<double>> dmat;\ntypedef vector<vector<vector<double>>> dmat3;\ntypedef vector<string> svec;\ntypedef vector<vector<string>> smat;\ntypedef vector<vector<vector<string>>> smat3;\ntypedef vector<pair<lint,lint>> pvec;\ntypedef vector<vector<pair<lint,lint>>> pmat;\ntypedef vector<vector<vector<pair<lint,lint>>>> pmat3;\n#define rep(i, n) for(lint i = 0; i < (lint)(n); i++)\n#define irep(i) for(lint i = 0;; i++)\n#define irep1(i) for(lint i = 1;; i++)\n#define irep2(i) for(lint i = 2;; i++)\n#define rrep(i, n) for(lint i = (lint)(n-1); i >-1; i--)\n#define rrepi(i,a,b) for(lint i = (lint)(b-1); i >a-1; i--)\n#define repi(i,a,b) for(lint i=lint(a);i<lint(b);i++)\n#define rep2(i,a,b,c) for(lint i=lint(a);i>lint(b);i+=c)\n#define all(x) (x).begin(),(x).end()\n//#define PI 3.141592653589793\n#define dist(x1,y1,x2,y2) (pow(pow(x2-x1,2)+pow(y2-y1,2),0.5))\n#define output(v) do{bool f=0;for(auto i:v){cout<<(f?\" \":\"\");if(i>INF/2)cout<<\"INF\";else cout<<i;f=1;}cout<<\"\\n\";}while(0)\n#define output2(v) for(auto j:v)output(j);\n#define _output(v) do{bool f=0;rep(i,v.size()){cout<<(f?\" \":\"\");if(v[i]>INF/2)cout<<\"INF\";else cout<<v[i];f=1;}cout<<\"\\n\";}while(0)\n#define _output2(v) rep(j,v.size()){_output(v[j]);}\n#define input(a,n) lint n;cin>>n;vector<lint>a(n);rep(i,n)cin>>a[i];\n#define SUM(v) accumulate(all(v),0LL)\n#define INF (1LL<<60)\n#define IINF (1<<30)\n#define EPS (1e-10)\n#define LINF 9223372036854775807\n#define MOD 100000007\n#define endl \"\\n\"\ntemplate<typename T=lint>T in(){return *istream_iterator<T>(cin);}\ninline lint gcd(lint a,lint b){return b?gcd(b,a%b):a;}\ntemplate<typename T=lint>inline T lcm(T a,T b){return a/gcd(a,b)*b;}\ntemplate<typename T=lint>inline T add(T a,T b){return a+b;}\ntemplate<typename T=lint>inline T minq(T a,T b){return min(a,b);}\ninline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}\ninline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}\nvector<lint> dx={-1,1,0,0,1,1,-1,-1};\nvector<lint> dy={0,0,-1,1,1,-1,1,-1};\n\n\n\nint main(){\n while(1){\n lint a,b,c,d,e,f;\n cin>>a>>b>>c>>d>>e>>f;\n if(a==0&&b==0&&c==0&&d==0&&e==0&&f==0)break;\n lint s=min({(a+d)/3});\n lint t=min({(b+e)/3});\n lint u=min({(c+f)/3});\n vec tmp={a+d-s*3,b+e-t*3,c+f-u*3};\n sort(all(tmp));\n if(tmp==vec{0,2,2}&&a+d-s*3==0&&a+d>0)cout<<s+t+u+min({a+d-s*3,b+e-t*3,c+f-u*3})+1<<endl;\n else if(tmp==vec{0,2,2}&&b+e-t*3==0&&b+e>0)cout<<s+t+u+min({a+d-s*3,b+e-t*3,c+f-u*3})+1<<endl;\n else if(tmp==vec{0,2,2}&&c+f-u*3==0&&c+f>0)cout<<s+t+u+min({a+d-s*3,b+e-t*3,c+f-u*3})+1<<endl;\n else cout<<s+t+u+min({a+d-s*3,b+e-t*3,c+f-u*3})<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3100,
"score_of_the_acc": -0.9858,
"final_rank": 7
},
{
"submission_id": "aoj_1077_3911774",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcountll\n\n#define INF 1e16\n#define mod 1000000007\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while(1){\n ll n=6;\n vector<ll> a(n);\n rep(i,n)cin>>a[i];\n {\n bool done=true;\n rep(i,n)if(a[i]>0)done=false;\n if(done)break;\n }\n\n ll A=a[0]+a[3],B=a[1]+a[4],C=a[2]+a[5];\n ll res=0;\n rep(i,min(3LL,min({A+1,B+1,C+1}))){\n maxch(res,(((A-i)/3)+((B-i)/3)+((C-i)/3))+i);\n }\n cout<<res<<endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3124,
"score_of_the_acc": -0.9498,
"final_rank": 5
},
{
"submission_id": "aoj_1077_3911555",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long cnt[3] = {0};\n\nlong long solve();\n\nint main() {\n while(1) {\n bool allzero = 1;\n for(int i = 0; i < 3; ++i) cnt[i] = 0;\n for(int i = 0; i < 6; ++i) {\n long long a;\n cin >> a;\n if(a != 0) allzero = 0;\n cnt[i % 3] += a;\n }\n if(allzero) break;\n cout << solve() << endl;\n }\n return 0;\n}\n\nlong long solve() {\n long long ans = 0;\n for(int i = 0; i < 3; ++i) {\n long long now = i;\n bool ch = 1;\n for(int j = 0; j < 3; ++j) {\n if(cnt[j] - i < 0) {\n ch = 0;\n break;\n }\n now += (cnt[j] - i) / 3;\n }\n if(ch) ans = max(ans, now);\n }\n return ans;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3088,
"score_of_the_acc": -1.0277,
"final_rank": 16
},
{
"submission_id": "aoj_1077_3396295",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(){\n int a, b, c, d, e, f;\n while(cin>>a>>b>>c>>d>>e>>f, a+b+c+d+e+f){\n a += d, b += e, c += f;\n int x = 0;\n for(int t = 0; t < 3; t++){\n if(a < t || b < t || c < t) break;\n x = max(x, t + (a-t)/3 + (b-t)/3 + (c-t)/3);\n }\n cout << x << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3080,
"score_of_the_acc": -1.0238,
"final_rank": 13
},
{
"submission_id": "aoj_1077_3396284",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(){\n int a, b, c, d, e, f;\n while(cin>>a>>b>>c>>d>>e>>f, a+b+c+d+e+f){\n a += d, b += e, c += f;\n int ans = 0;\n for(int bal = 0; bal < 3; bal++){\n if(a < bal || b < bal || c < bal) break;\n ans = max(ans, bal + (a-bal)/3 + (b-bal)/3 + (c-bal)/3);\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3084,
"score_of_the_acc": -1.0257,
"final_rank": 15
},
{
"submission_id": "aoj_1077_2527686",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define DUMP(x) cerr << #x << \"=\" << x << endl\n#define DUMP2(x, y) cerr<<\"(\"<<#x<<\", \"<<#y<<\") = (\"<<x<<\", \"<<y<<\")\"<< endl\n#define BINARY(x) static_cast<bitset<16> >(x)\n\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define REP(i,m,n) for (int i=m;i<(int)(n);i++)\n\n#define in_range(x, y, w, h) (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))\n#define ALL(a) (a).begin(),(a).end()\n\ntypedef long long ll;\nconst int INF = 1e9;\nconst ll INFLL = 1e18;\ntypedef pair<int, int> PII;\nint dx[4]={0, -1, 1, 0}, dy[4]={-1, 0, 0, 1};\n\nint main()\n{\n ios::sync_with_stdio(false);\n\n int M, GRE, GEO, DP, GRA, O;\n while (cin >> M >> GRE >> GEO >> DP >> GRA >> O) {\n if (!M && !GRE && !GEO && !DP && !GRA && !O) break;\n\n int G1 = M + DP;\n int G2 = GRE + GRA;\n int G3 = GEO + O;\n\n int ans = 0;\n int mn = min({G1, G2, G3});\n\n /*\n {\n int tmp = mn;\n tmp += (G1 - mn) / 3;\n tmp += (G2 - mn) / 3;\n tmp += (G3 - mn) / 3;\n tmp += min({(G1 - mn)%3, (G2 - mn)%3, (G3 - mn)%3});\n ans = max(ans, tmp);\n }\n\n {\n int tmp = 0;\n tmp += G1/3; G1%=3;\n tmp += G2/3; G2%=3;\n tmp += G3/3; G3%=3;\n tmp += min({G1, G2, G3});\n ans = max(ans, tmp);\n }\n */\n\n // cerr << \"------------\" << endl;\n for (int m=max(0, mn-100); m<=mn; m++) {\n int tmp = m;\n tmp += (G1 - m) / 3;\n tmp += (G2 - m) / 3;\n tmp += (G3 - m) / 3;\n ans = max(ans, tmp);\n // DUMP(tmp);\n }\n\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3228,
"score_of_the_acc": -1,
"final_rank": 8
},
{
"submission_id": "aoj_1077_2514692",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nint main()\n{\n while(1)\n {\n int x[6];\n rep(i,6) cin >>x[i];\n\n int s = 0;\n rep(i,6) s += x[i];\n if(s==0) break;\n\n int a = x[0] + x[3];\n int b = x[1] + x[4];\n int c = x[2] + x[5];\n\n int m = min({a,b,c});\n\n int ans = 0;\n for(int i=m; i>=max(0,m-3); --i) ans = max(ans, i+(a-i)/3+(b-i)/3+(c-i)/3);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3064,
"score_of_the_acc": -1.0161,
"final_rank": 9
},
{
"submission_id": "aoj_1077_2458765",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main(){\n\tint a,b,c,d,e,f;\n\twhile(1){\n\t\tcin >> a >> b >> c >> d >> e >> f;\n\t\tif(a + b + c + d + e + f == 0) break;\n\t\ta += d;\n\t\tb += e;\n\t\tc += f;\n\t\tint ma = 0;\n\t\tfor(int i = 0;i < 3;i++){\n\t\t\tma = max(ma,i + a / 3 + b / 3 + c / 3);\n\t\t\ta--;\n\t\t\tb--;\n\t\t\tc--;\n\t\t\tif(a < 0 || b < 0 || c < 0) break;\n\t\t}\n\t\tcout << ma << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 2984,
"score_of_the_acc": -0.9775,
"final_rank": 6
},
{
"submission_id": "aoj_1077_2386701",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n\nusing namespace std;\n\nint main(){\n\t\n\tint a[6];\n\t\n\twhile(true){\n\t\t\n\t\tint hoge = 0;\n\t\t\n\t\tfor(int i = 0; i < 6; i++){\n\t\t\tcin >> a[i];\n\t\t\thoge += a[i];\n\t\t}\n\t\t\n\t\tif(hoge == 0){\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\ta[0] += a[3];\n\t\ta[1] += a[4];\n\t\ta[2] += a[5];\n\t\t\n\t\tint ans = 0;\n\t\t\n\t\tans = max(ans, a[0] / 3 + a[1] / 3 + a[2] / 3);\n\t\ta[0]--;\n\t\ta[1]--;\n\t\ta[2]--;\n\t\tif(a[0] >= 0 && a[1] >= 0 && a[2] >= 0){\n\t\t\tans = max(ans, a[0] / 3 + a[1] / 3 + a[2] / 3 + 1);\n\t\t}\n\t\ta[0]--;\n\t\ta[1]--;\n\t\ta[2]--;\n\t\tif(a[0] >= 0 && a[1] >= 0 && a[2] >= 0){\n\t\t\tans = max(ans, a[0] / 3 + a[1] / 3 + a[2] / 3 + 2);\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": 30,
"memory_kb": 3080,
"score_of_the_acc": -1.0238,
"final_rank": 13
},
{
"submission_id": "aoj_1077_2169126",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\n\nint main() {\n\tint a, b, c, d, e, f;\n\twhile (cin >> a >> b >> c >> d >> e >> f, a || b || c || d || e || f) {\n\t\ta += d; b += e; c += f;\n\t\tint Max = 0;\n\t\tfor (int i = 0; i <= min(2, min(a, min(b, c))); i++)\n\t\t\tMax = max(Max, (a - i) / 3 + (b - i) / 3 + (c - i) / 3 + i);\n\t\tcout << Max << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3088,
"score_of_the_acc": -1.0277,
"final_rank": 16
},
{
"submission_id": "aoj_1077_2054790",
"code_snippet": "#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n//// < \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\a.txt\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n\n\nint main() {\n\twhile(1){\n\t\tint a, b, c, d, e, f; cin >> a >> b >> c >> d >> e >> f;\n\t\tint x = a + d, y = b + e, z = c+ f;\n\t\tif (!x&&!y&&!z)break;\n\t\tint ans = 0;\n\t\tint amin = min(min(x, y), z);\n\t\tfor (int i = 0; i <= min(2,amin); ++i) {\n\t\t\tint sum = i;\n\t\t\tsum += (x - i) / 3 + (y - i) / 3 + (z - i) / 3;\n\t\t\tans = max(ans, sum);\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3064,
"score_of_the_acc": -1.0161,
"final_rank": 9
},
{
"submission_id": "aoj_1077_1984609",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define all(v) (v).begin(),(v).end()\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\n\n\nsigned main(){\n int a,b,c,d,e,f;\n while(cin>>a>>b>>c>>d>>e>>f,a||b||c||d||e||f){\n a+=d;b+=e;c+=f;\n\n int t=min(min(a,b),c);\n int ma=0;\n for(int i=max(t-2,0ll);i<=t;i++){\n chmax(ma,i+(a-i)/3+(b-i)/3+(c-i)/3);\n }\n cout<<ma<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3068,
"score_of_the_acc": -1.018,
"final_rank": 11
},
{
"submission_id": "aoj_1077_1954268",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i, s, e) for(int i = (int)s; i < (int) e; i++)\n#define rep(i, n) REP(i, 0 ,n)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n\n#define fi first\n#define se second\n#define pb push_back\n#define mp nake_pair\n\ntypedef long long ll;\n\ntypedef vector<int> vi;\n\nint calc(int m, const vi& d){\n int ret = m;\n rep(i, 3) if(m > d[i]) return -1e9;\n rep(i, 3) ret += (d[i]-m)/3;\n return ret;\n}\n\nint main(){\n vi v(6);\n while(1){\n rep(i, 6) cin>>v[i];\n if(v[0]==0 && v[1] == 0 && v[2] == 0 && v[3] == 0 && v[4] == 0 && v[5] == 0) break;\n vi d(3);\n rep(i, 6) d[i%3] += v[i];\n double l = 0, r = 1e9;\n rep(i, 1000){\n double m1 = l + (r - l) / 3.0, m2 = l + (r - l) * 2.0/ 3.0;\n int f1 = calc(m1, d), f2 = calc(m2, d);\n if(f1 < f2) l = m1;\n else r = m2;\n }\n cout<<calc(r, d)<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 3012,
"score_of_the_acc": -1.8958,
"final_rank": 20
},
{
"submission_id": "aoj_1077_1867954",
"code_snippet": "#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n \nint main(){\n int Math,Greedy,Geometry,DP,Graph,Other;\n \n while(cin >> Math >> Greedy >> Geometry >> \n\t DP >> Graph >> Other){\n \n\tif(!Math && !Greedy && !Geometry && !DP &&\n\t !Graph && !Other) break;\n \n\tint MD = Math + DP , GG = Greedy + Graph;\n\tint GO = Geometry + Other;\n \n\tint ans = 0;\n\tif(MD >= 0 && GG >= 0 && GO >= 0){\n\t ans = max(ans, MD/3 + GG/3 + GO/3);\n\t}\n\tif(MD >= 1 && GG >= 1 && GO >= 1){\n\t ans = max(ans, ((MD-1)/3 + (GG-1)/3 + (GO-1)/3) + 1);\n\t}\n\tif(MD >= 2 && GG >= 2 && GO >= 2){\n\t ans = max(ans, ((MD-2)/3 + (GG-2)/3 + (GO-2)/3) + 2);\n\t}\n\tcout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3076,
"score_of_the_acc": -1.0219,
"final_rank": 12
},
{
"submission_id": "aoj_1077_1859566",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#ifdef _MSC_VER\n#define __builtin_popcount(x) (__popcnt(x))\n#endif\nusing namespace std;\nint a, b, c, d, e, f;\nint main() {\n\twhile (cin >> a >> b >> c >> d >> e >> f, a | b | c | d | e | f) {\n\t\tint x[3] = { a + d, b + e, c + f }, r = 0;\n\t\tfor (int i = 0; i < 8; i++) {\n\t\t\tint ok = 1;\n\t\t\tfor (int j = 0; j < 3; j++) {\n\t\t\t\tif ((i & (1 << j)) && x[j] < 3) ok = 0;\n\t\t\t}\n\t\t\tif (!ok) continue;\n\t\t\tint y[3] = { x[0], x[1], x[2] };\n\t\t\tint z = y[0] / 3 + y[1] / 3 + y[2] / 3 - __builtin_popcount(i), w = 999999999;\n\t\t\tfor (int j = 0; j < 3; j++) w = min(w, y[j] % 3 + ((i & (1 << j)) ? 3 : 0));\n\t\t\tr = max(r, z + w);\n\t\t}\n\t\tcout << r << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3080,
"score_of_the_acc": -1.0714,
"final_rank": 19
},
{
"submission_id": "aoj_1077_1830155",
"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#include<sstream>\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\tint a,b,c,d,e,f;\n\twhile(cin>>a>>b>>c>>d>>e>>f,a+b+c+d+e+f){\n\t\tvi in(3);\n\t\tvector<pii>tmp(3);\n\t\tin[0]=a+d;in[1]=b+e;in[2]=c+f;\n\t\tint out=0;\n\t\trep(i,3){\n\t\t\tout+=in[i]/3;\n\t\t\ttmp[i]=pii(in[i]%3,in[i]);\n\t\t}\n\t\tsort(all(tmp));\n\t\tif(tmp[0].first>0)out+=tmp[0].first;\n\t\telse if(tmp[1].first==2&&tmp[0].second>2)out++;\n\t\tcout<<out<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1196,
"score_of_the_acc": -0.2098,
"final_rank": 3
},
{
"submission_id": "aoj_1077_1793669",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <cstring>\n#include <algorithm>\n#include <sstream>\n#include <map>\n#include <set>\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#define INF 1<<30\n#define pb push_back\n#define mp make_pair\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nint main() {\n\tll a, b, c, d, e, f;\n\twhile(cin >> a >> c >> e >> b >> d >> f) {\n\t\tif(a == 0 && b == 0 && c == 0 && d == 0 && e == 0 && f == 0) break;\n\n\t\tll ans = 0, A = 0, B = 0, C = 0;\n\t\tll res = min(a + b, min(c + d, e + f));\n\n\t\tA = (a + b) - res;\n\t\tB = (c + d) - res;\n\t\tC = (e + f) - res;\n\t\tans = res + (A / 3) + (B / 3) + (C / 3);\n\n\t\tif(res >= 1) {\n\t\t\tA++; B++; C++;\n\t\t\tres--;\n\t\t}\n\t\telse if(res >= 2) {\n\t\t\tA += 2; B += 2; C += 2;\n\t\t\tres -= 2;\n\t\t}\n\n\t\tcout << max(ans, res + (A / 3) + (B / 3) + (C / 3)) << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1156,
"score_of_the_acc": -0.1905,
"final_rank": 1
},
{
"submission_id": "aoj_1077_1760748",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n \nint main(){\n int a,b,c,d,e,f;\n int A,B,C,mins,ans,ans2;\n while(1){\n cin>>a>>b>>c>>d>>e>>f;\n if(!a&&!b&&!c&&!d&&!e&&!f)break;\n A=a+d;\n B=b+e;\n C=c+f;\n mins=min(A,min(B,C));\n ans2=0;\n for(int i=0;i<2;i++){\n ans=0;\n ans+=(A-mins)/3;\n ans+=(B-mins)/3;\n ans+=(C-mins)/3;\n A=A-((A-mins)/3)*3;\n B=B-((B-mins)/3)*3;\n C=C-((C-mins)/3)*3;\n ans=max(ans+A/3+B/3+C/3,ans+mins);\n ans2=max(ans2,ans);\n if(mins>=1)mins--;\n else break;\n A=a+d;\n B=b+e;\n C=c+f;\n }\n cout<<ans2<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1160,
"score_of_the_acc": -0.1924,
"final_rank": 2
},
{
"submission_id": "aoj_1077_1760621",
"code_snippet": "#include <iostream>\n#include <stdio.h>\n#include <math.h>\nusing namespace std;\n\nint main(){\n int a,b,c,d,e,f;\n int g,h,i,sum;\n \n cin >> a >> b >> c >> d >> e >> f;\n while(a!=0||b!=0||c!=0||d!=0||e!=0||f!=0){\n g=a+d;\n h=b+e;\n i=c+f;\n sum=0;\n if((g>1&&h>1&&i>1)&&((g%3==2&&h%3==2&&i%3==0)||(g%3==2&&h%3==0&&i%3==2)||(g%3==0&&h%3==2&&i%3==2))) sum++;\n sum+=g/3;\n g=g%3;\n sum+=h/3;\n h=h%3;\n sum+=i/3;\n i=i%3;\n while(g>0&&h>0&&i>0){\n g--;h--;i--;\n sum++;\n }\n \n cout << sum << endl;\n \n cin >> a >> b >> c >> d >> e >> f;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1160,
"score_of_the_acc": -0.24,
"final_rank": 4
}
] |
aoj_1078_cpp
|
Problem E: SAT-EN-3
彼女は悩んでいた。成績が良くないのだ。両親に無理を言って全寮制の学校に入学したものの、彼女の才能は一向に開花することはなかった。あるいは才能など元々なかったのかもしれないが、それはできるだけ考えたくない可能性だった。
そこで彼女が頼ったのは、インターネット上で見つけた怪しげな脳力トレーニングの教材だった。SAT-EN-3 (SATisifiability problem for Enhancement of Neuron: version 3) と銘打つその学習メソッドによると、充足可能性問題のようなもののインスタンスをひたすら手で解くことによって、計算力が向上し、引いては論理的思考力・直感力・想像力も豊かになり、部活動でも活躍できて恋愛もうまくいくのだという。さすがに最後の2つは眉唾ものじゃないかな、と彼女は思ったが、ソロバンや百マス計算のような例もあることだ。暗算が得意になったら儲けものかな、ぐらいの気楽さで、彼女はこの教材に取り組んでみることにした。
SAT-EN-3では、加法標準形で表される論理式の各変数に適切に割り当て、論理式の値を真にすることができるかどうか判定しなければならない。ちなみに、1つ以上の変数 (または、その否定) の論理積を 節 (clause) と呼び、いくつかの節の論理和で表される論理式のみが加法標準形に従っている。一般に充足可能性問題といえば論理式は乗法標準形で表されるが、SAT-EN-3では加法標準形であることに注意せよ。
彼女はしばらく SAT-EN-3 の問題集に取り組もうとして、ふと思い直した。問題集にお金を払うぐらいなら、プログラミングが得意な親友にパフェでもご馳走して、 SAT-EN-3 の問題を生成し、解くプログラムを書いてもらおう。そうすれば問題も解答もいくらでも手にはいるじゃないか。
こうして彼女の親友であるあなたは、SAT-EN-3を解くプログラムを書くことになったのである。
Input
入力は複数のケースからなる。
各ケースは以下のフォーマットで与えられる。
expression
入力の終わりは
"#"
からなる行によって与えられる
expression
は以下のBNFに従う。
ここでは文字列リテラルを""を用いて囲んでいる。
実際の入力に""は含まれない。
また入力には余計な空白は含まれていない。
<expression> ::= "("<clause>")" | "("<clause>")|("<expression>")"
<clause> ::= <literal>"&"<literal>"&"<literal>
<literal> ::= <variable> | "~"<variable>
<variable> ::= [a-z]|[A-z]
expression
の長さは500文字を超えない。
テストケースの数は1100個を超えない。
Output
与えられた式を満たす変数の割り当てが存在するのならばyesを、そうでなければnoを出力せよ。
Sample input
(B&B&f)|(~d&~i&i)|(~v&i&~V)|(~g&~e&o)|(~f&d&~v)|(d&~i&o)|(g&i&~B)|(~i&f&d)|(e&~i&~V)|(~v&f&~d)
(S&X&~X)
#
Sample output
yes
no
The University of Aizu Programming Contest 2011 Summer
原案: Tomoya Sakai
問題文: Takashi Tayama
|
[
{
"submission_id": "aoj_1078_8461558",
"code_snippet": "#include <bits/stdc++.h>\n\nstd::map<std::string, std::string> anti_literal;\n\nstruct Parser {\n using CopyIter = std::string::const_iterator;\n using Iter = CopyIter&;\n std::string line;\n Parser(std::string s): line(s) {}\n void skip(Iter it, char c) {\n ++it;\n }\n std::vector<std::array<std::string, 3>> parse() {\n auto it = line.cbegin();\n return expr(it);\n }\n\n std::vector<std::array<std::string, 3>> expr(Iter it) {\n std::vector<std::array<std::string, 3>> res;\n res.push_back(clause(it));\n while (it != line.end()) {\n skip(it, '|');\n res.push_back(clause(it));\n }\n return res;\n }\n\n std::array<std::string, 3> clause(Iter it) {\n skip(it, '(');\n auto l = literal(it);\n skip(it, '&');\n auto m = literal(it);\n skip(it, '&');\n auto r = literal(it);\n skip(it, ')');\n return {l, m, r};\n }\n\n std::string literal(Iter it) {\n if (*it == '~') {\n std::string s(it, it + 2);\n it++;\n it++;\n return s;\n } else {\n std::string s(it, it + 1);\n it++;\n return s;\n }\n }\n};\n\nint main() {\n constexpr int N = 26;\n for (int i = 0; i < N; i++) {\n {\n std::string s(1, (char)('a') + i);\n std::string t = \"~\" + s;\n anti_literal[s] = t;\n anti_literal[t] = s;\n }\n\n {\n std::string s(1, (char)('A') + i);\n std::string t = \"~\" + s;\n anti_literal[s] = t;\n anti_literal[t] = s;\n }\n }\n\n while (true) {\n std::string line;\n std::getline(std::cin, line);\n if (line == \"#\") break;\n Parser parser(line);\n auto clauses = parser.parse();\n\n bool ok = false;\n for (auto clause: clauses) {\n bool flag = true;\n for (int i = 0; i < 3; i++) {\n for (int j = 0; j < 3; j++) {\n if (clause[i] == anti_literal[clause[j]]) {\n flag = false;\n break;\n }\n }\n }\n ok |= flag;\n }\n\n std::cout << (ok ? \"yes\" : \"no\") << std::endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3456,
"score_of_the_acc": -1,
"final_rank": 18
},
{
"submission_id": "aoj_1078_3911658",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#define _GLIBCXX_DEBUG\n#include<bits/stdc++.h>\nusing namespace::std;\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\n// random_device rd;\n// mt19937 mt(rd());\n// #include <boost/numeric/interval.hpp>\n// #include <boost/numeric/interval/io.hpp>\n// #include <boost/intrusive/rbtree.hpp>\n// #include <boost/geometry.hpp>\n// #include <boost/geometry/geometries/linestring.hpp>\n// #include <boost/geometry/geometries/polygon.hpp>\n// #include <boost/geometry/geometries/point_xy.hpp>\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// typedef mp::number<mp::cpp_dec_float<0>> cfloat;\n// typedef mp::cpp_int cint;\n\n#include<ext/pb_ds/assoc_container.hpp>\n#include<ext/pb_ds/tree_policy.hpp>\n#include <ext/pb_ds/priority_queue.hpp>\n#include<ext/pb_ds/tag_and_trait.hpp>\nusing namespace __gnu_pbds;\ntemplate<typename T=long long>using pbds=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;\ntemplate<typename T=long long>using pqueue =__gnu_pbds::priority_queue<T, less<T>,rc_binomial_heap_tag>;\ntypedef long long lint;\ntypedef long long ll;\ntypedef long double ldouble;\ntypedef vector<lint> vec;\ntypedef vector<vector<lint>> mat;\ntypedef vector<vector<vector<lint>>> mat3;\ntypedef vector<double> dvec;\ntypedef vector<vector<double>> dmat;\ntypedef vector<vector<vector<double>>> dmat3;\ntypedef vector<string> svec;\ntypedef vector<vector<string>> smat;\ntypedef vector<vector<vector<string>>> smat3;\ntypedef vector<pair<lint,lint>> pvec;\ntypedef vector<vector<pair<lint,lint>>> pmat;\ntypedef vector<vector<vector<pair<lint,lint>>>> pmat3;\n#define rep(i, n) for(lint i = 0; i < (lint)(n); i++)\n#define irep(i) for(lint i = 0;; i++)\n#define irep1(i) for(lint i = 1;; i++)\n#define irep2(i) for(lint i = 2;; i++)\n#define rrep(i, n) for(lint i = (lint)(n-1); i >-1; i--)\n#define rrepi(i,a,b) for(lint i = (lint)(b-1); i >a-1; i--)\n#define repi(i,a,b) for(lint i=lint(a);i<lint(b);i++)\n#define rep2(i,a,b,c) for(lint i=lint(a);i>lint(b);i+=c)\n#define all(x) (x).begin(),(x).end()\n//#define PI 3.141592653589793\n#define dist(x1,y1,x2,y2) (pow(pow(x2-x1,2)+pow(y2-y1,2),0.5))\n#define output(v) do{bool f=0;for(auto i:v){cout<<(f?\" \":\"\");if(i>INF/2)cout<<\"INF\";else cout<<i;f=1;}cout<<\"\\n\";}while(0)\n#define output2(v) for(auto j:v)output(j);\n#define _output(v) do{bool f=0;rep(i,v.size()){cout<<(f?\" \":\"\");if(v[i]>INF/2)cout<<\"INF\";else cout<<v[i];f=1;}cout<<\"\\n\";}while(0)\n#define _output2(v) rep(j,v.size()){_output(v[j]);}\n#define input(a,n) lint n;cin>>n;vector<lint>a(n);rep(i,n)cin>>a[i];\n#define SUM(v) accumulate(all(v),0LL)\n#define INF (1LL<<60)\n#define IINF (1<<30)\n#define EPS (1e-10)\n#define LINF 9223372036854775807\n#define MOD 998244353\n#define endl \"\\n\"\ntemplate<typename T=lint>T in(){return *istream_iterator<T>(cin);}\ninline lint gcd(lint a,lint b){return b?gcd(b,a%b):a;}\ntemplate<typename T=lint>inline T lcm(T a,T b){return a/gcd(a,b)*b;}\ntemplate<typename T=lint>inline T add(T a,T b){return a+b;}\ntemplate<typename T=lint>inline T minq(T a,T b){return min(a,b);}\ninline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}\ninline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}\nvector<lint> dx={-1,1,0,0,1,1,-1,-1};\nvector<lint> dy={0,0,-1,1,1,-1,1,-1};\n\nvector<string> split(const string &s, char delim) {\n vector<string> elems;\n stringstream ss(s);\n string item;\n while (getline(ss, item, delim)) {\n if (!item.empty()) {\n elems.push_back(item);\n }\n }\n return elems;\n}\n\nbool j(string s){\n auto d=split(s,'&');\n set<string>v(all(d));\n for(string t:v){\n if(v.count(\"~\"+t))return 0;\n }\n return 1;\n}\nint main(){\n while(1){\n bool f=0;\n string s;\n cin>>s;\n if(s==\"#\")break;\n svec d=split(s,'|');\n for(string l:d){\n if(j(l.substr(1,l.size()-2)))f=1;\n }\n if(f)cout<<\"yes\"<<endl;\n else cout<<\"no\"<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3228,
"score_of_the_acc": -1.0663,
"final_rank": 19
},
{
"submission_id": "aoj_1078_3911586",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstring s;\n\nbool solve();\n\nint main() {\n while(1) {\n cin >> s;\n if(s == \"#\") break;\n if(solve())\n cout << \"yes\" << endl;\n else\n cout << \"no\" << endl;\n }\n return 0;\n}\n\nbool solve() {\n long long ssize = s.size();\n for(int i = 0; i < ssize; ++i) {\n vector<bool> large[2], small[2];\n for(int i = 0; i < 2; ++i) {\n large[i].assign(26, 0);\n small[i].assign(26, 0);\n }\n assert(s[i] == '(');\n ++i;\n for(int j = 0; j < 3; ++j) {\n bool ch = 0;\n if(s[i] == '~') ch = 1, ++i;\n if(s[i] >= 'a' && s[i] <= 'z')\n small[ch][s[i++] - 'a'] = 1;\n else\n large[ch][s[i++] - 'A'] = 1;\n if(j != 2)\n assert(s[i] == '&');\n else\n assert(s[i] == ')');\n ++i;\n }\n bool isok = 1;\n for(int j = 0; j < 26; ++j) {\n if(small[0][j] && small[1][j]) isok = 0;\n if(large[0][j] && large[1][j]) isok = 0;\n }\n if(isok) return 1;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3172,
"score_of_the_acc": -0.875,
"final_rank": 12
},
{
"submission_id": "aoj_1078_3564418",
"code_snippet": "#pragma warning(disable:4996)\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define ALL(a) begin(a), end(a)\n#define TPL template\n#define TNM typename\n\nusing ll = long long;\nusing ull = unsigned long long;\nTPL<TNM T> using vec = vector<T>;\nTPL<TNM T> using vec2 = vec<vec<T>>;\nTPL<TNM T> using vec3 = vec<vec2<T>>;\n\nTPL<TNM T> inline bool chmin(T&a, T&b) { if (a > b) { a = b; return true; } return false; }\nTPL<TNM T> inline bool chmax(T&a, T&b) { if (a < b) { a = b; return true; } return false; }\nTPL<TNM V, TNM H> void resize(vector<V>& _v, const H _h) { _v.resize(_h); }\nTPL<TNM V, TNM H, TNM ... T> void resize(vector<V>& _v, const H& _h, const T& ... _t) { _v.resize(_h); for (auto& __v : _v) resize(__v, _t ...); }\nTPL<TNM V, TNM T> TNM enable_if<!is_class<V>::value, void>::type fill(vector<V>& _v, const T &_t) { std::fill(ALL(_v), _t); }\nTPL<TNM V, TNM T> TNM enable_if<is_class<V>::value, void>::type fill(vector<V>& _v, const T &_t) { for (auto &_e : _v) fill(_e, _t); }\nTPL<TNM T> inline void UNIQUE(vector<T>& _v) { sort(ALL(_v)); _v.erase(unique(ALL(_v)), _v.end()); }\nstruct pre_ { pre_() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(6); } } pre__;\n\nvector<string> split(const string &s, char delim) {\n\tvector<string> elems;\n\tstringstream ss(s);\n\tstring item;\n\twhile (getline(ss, item, delim)) {\n\t\tif (!item.empty()) {\n\t\t\telems.push_back(item);\n\t\t}\n\t}\n\treturn elems;\n}\n\nset<char> alphabets(string s) {\n\tset<char> st;\n\tfor (char c : s) {\n\t\tif (isalpha(c)) {\n\t\t\tst.insert(c);\n\t\t}\n\t}\n\treturn st;\n}\n\nbool solve(string s, set<char> st) {\n\tmap<string, int> cnt;\n\tbool n = false;\n\tchar v;\n\tfor (char c : s) {\n\t\tif (c == '~') {\n\t\t\tn = true;\n\t\t}\n\t\telse if (c == '&' || c == ')') {\n\t\t\t//not?\n\t\t\tif (n) {\n\t\t\t\tcnt[\"~\" + string{ v }]++;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcnt[string{ v }]++;\n\t\t\t}\n\t\t\tn = false;\n\t\t}\n\t\telse {\n\t\t\tv = c;\n\t\t}\n\t}\n\tfor (char c : st) {\n\t\tif (cnt[string{ c }] && cnt[\"~\" + string{ c }]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid solve2(vector<string>& vs) {\n\tfor (int i = 0; i < vs.size(); ++i) {\n\t\tset<char> st = alphabets(vs[i]);\n\t\tif (solve(vs[i], st)) {\n\t\t\tcout << \"yes\" << endl;\n\t\t\treturn;\n\t\t}\n\t}\n\tcout << \"no\" << endl;\n\treturn;\n}\nint main(void) {\n\twhile (1) {\n\t\tstring S;\n\t\tcin >> S;\n\t\tif (S == \"#\")break;\n\t\tvector<string> vs = split(S, '|');\n\t\tsolve2(vs);\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3236,
"score_of_the_acc": -0.9032,
"final_rank": 15
},
{
"submission_id": "aoj_1078_3538812",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <set>\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\nvector<string> parse(string &s, char dec) {\n int pos = 0;\n vector<string> res;\n s += dec;\n REP(i, 0, s.size()) {\n if (s[i] == dec) {\n res.push_back(s.substr(pos, i - pos));\n pos = i + 1;\n }\n }\n return res;\n}\n\nbool check(vector<int> &var) {\n set<int> s;\n for (auto &n : var) {\n if(s.count(-n)) {\n return false;\n }\n s.insert(n);\n }\n return true;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n string s;\n while (cin >> s, s != \"#\") {\n vector<string> clauses = parse(s, '|');\n bool ans = false;\n for (auto clause : clauses) {\n clause = clause.substr(1, clause.size() - 2);\n vector<string> literals = parse(clause, '&');\n vector<int> var;\n for (auto literal : literals) {\n int sign = 2 * (literal[0] != '~') - 1;\n int num = literal[literal.size() - 1];\n var.push_back(sign * num);\n }\n ans |= check(var);\n }\n cout << (ans ? \"yes\" : \"no\") << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3196,
"score_of_the_acc": -0.8856,
"final_rank": 14
},
{
"submission_id": "aoj_1078_2568842",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nvector<string> split(const string &s, char delim){\n\tvector<string> ret;\n\tstringstream ss(s);\n\tstring x;\n\twhile(getline(ss, x, delim)) if(!x.empty()) ret.push_back(x);\n\treturn ret;\n};\n\nbool f(string s){\n\twhile(s.front() == '(') s = s.substr(1);\n\twhile(s.back() == ')') s.pop_back();\n\tauto s1 = split(s, '&');\n\tbool check[256][2] = { 0 };\n\tfor(auto t : s1){\n\t\tint j = 0;\n\t\tif(t.size() == 2) j = 1;\n\t\tif(check[t.back()][1 - j]) return false;\n\t\tcheck[t.back()][j] = 1;\n\t}\n\treturn true;\n}\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n#ifdef LOCAL\n\tstd::ifstream in(\"in\");\n\tstd::cin.rdbuf(in.rdbuf());\n#endif\n\n\tstring s;\n\twhile(cin >> s, s != \"#\"){\n\t\tauto s1 = split(s, '|');\n\t\tbool ok = false;\n\t\tfor(auto v : s1){\n\t\t\tif(f(v)){\n\t\t\t\tok = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(ok) cout << \"yes\" << endl;\n\t\telse cout << \"no\" << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3176,
"score_of_the_acc": -0.8768,
"final_rank": 13
},
{
"submission_id": "aoj_1078_2514715",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nvector<string> e(string s)\n{\n int S = s.size();\n vector<string> ret;\n\n int st = 0;\n while(st<S)\n {\n int idx = st;\n while(idx<S && s[idx]!='|') ++idx;\n ret.pb(s.substr(st,idx-st));\n st = idx+1;\n }\n return ret;\n}\n\nint cv(char c)\n{\n if('a'<=c && c<='z') return c-'a';\n return 26+c-'A';\n}\n\nbool c(string s)\n{\n s = s.substr(1,s.size()-2);\n int S = s.size();\n\n vector<string> v;\n int st = 0;\n while(st<S)\n {\n int idx = st;\n while(idx<S && s[idx]!='&') ++idx;\n v.pb(s.substr(st,idx-st));\n st = idx+1;\n }\n\n bool t[52]={}, f[52]={};\n for(string a:v)\n {\n if(a[0]=='~') f[cv(a[1])] = true;\n else t[cv(a[0])] = true;\n }\n\n rep(i,52)if(t[i]&&f[i]) return false;\n return true;\n}\n\nstring solve(string s)\n{\n for(string a:e(s))if(c(a)) return \"yes\";\n return \"no\";\n}\n\nint main()\n{\n string s;\n while(cin >>s,s!=\"#\") cout << solve(s) << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3160,
"score_of_the_acc": -0.8697,
"final_rank": 10
},
{
"submission_id": "aoj_1078_2386836",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <string>\n#include <sstream>\n\nusing namespace std;\n\n// ?????????????????????????????§????????£???????????????\nvector<string> split(const string &str, char sep)\n{\n vector<string> v;\n stringstream ss(str);\n string buffer;\n\t\n while(getline(ss, buffer, sep)){\n v.push_back(buffer);\n }\n\t\n return v;\n}\n\nint main(){\n\t\n\tstring str;\n\t\n\twhile(true){\n\t\t\n\t\tcin >> str;\n\t\t\n\t\tif(str.size() == 1){\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tvector<string> v;\n\t\t\n\t\tv = split(str, '|');\n\t\t\n\t\tbool flag = false;\n\t\t\n\t\tfor(int i = 0; i < v.size(); i++){\n\t\t\tstring str_c = v[i];\n\t\t\t//cout << str_c << endl;\n\t\t\tbool flag2 = true;\n\t\t\tfor(int j = 0; j < 26; j++){\n\t\t\t\tstring str11 = \"&A\";\n\t\t\t\tstring str12 = \"(A\";\n\t\t\t\tstring str2 = \"~A\";\n\t\t\t\tstr11[1] = str12[1] = str2[1] = 'A' + j;\n\t\t\t\tif(((int)str_c.find(str11) != string::npos || (int)str_c.find(str12) != string::npos) && (int)str_c.find(str2) != string::npos){\n\t\t\t\t\t//cout << str11 << endl;\n\t\t\t\t\tflag2 = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int j = 0; j < 26; j++){\n\t\t\t\tstring str11 = \"&A\";\n\t\t\t\tstring str12 = \"(A\";\n\t\t\t\tstring str2 = \"~A\";\n\t\t\t\tstr11[1] = str12[1] = str2[1] = 'a' + j;\n\t\t\t\tif(((int)str_c.find(str11) != string::npos || (int)str_c.find(str12) != string::npos) && (int)str_c.find(str2) != string::npos){\n\t\t\t\t\t//cout << str11 << endl;\n\t\t\t\t\tflag2 = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tflag = flag || flag2;\n\t\t}\n\t\t\n\t\t\t\tif(flag){\n\t\t\t\t\tcout << \"yes\" << endl;\n\t\t\t\t}else{\n\t\t\t\t\tcout << \"no\" << endl;\n\t\t\t\t}\n\t\t\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 3068,
"score_of_the_acc": -1.8292,
"final_rank": 20
},
{
"submission_id": "aoj_1078_2347909",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <vector>\n\nint main()\n{\n std::string s;\n while (1) {\n std::cin >> s;\n if (s == \"#\") {\n break;\n }\n\n bool ok = 0;\n std::stringstream ss{s}; \n while (std::getline(ss, s, '|')) {\n std::string t = s.substr(1, s.size() - 2);\n std::stringstream tt{t};\n \n std::vector<int> v(256, 0);\n while (std::getline(tt, s, '&')) {\n if (s[0] == '~') {\n v[s[1]] |= 2;\n } else {\n v[s[0]] |= 1;\n }\n }\n \n bool f = 1;\n for (int i = 0; i < 256; i++) {\n if (v[i] == 3) {\n f = 0;\n }\n }\n ok |= f;\n }\n std::cout << (ok ? \"yes\" : \"no\") << std::endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3176,
"score_of_the_acc": -0.9323,
"final_rank": 17
},
{
"submission_id": "aoj_1078_2103008",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nstring S;\nbool search(string F) {\n\tstring U[3]; F += '&'; string G = \"\"; int cnt = 0;\n\tfor (int i = 0; i<F.size(); i++) {\n\t\tif (F[i] == '&') { U[cnt] = G; cnt++; G = \"\"; }\n\t\telse G += F[i];\n\t}\n\tif (U[0].size() == 1 && U[1].size() == 2 && U[0][0] == U[1][1])return false;\n\tif (U[0].size() == 1 && U[2].size() == 2 && U[0][0] == U[2][1])return false;\n\tif (U[1].size() == 1 && U[2].size() == 2 && U[1][0] == U[2][1])return false;\n\tif (U[0].size() == 2 && U[1].size() == 1 && U[0][1] == U[1][0])return false;\n\tif (U[0].size() == 2 && U[2].size() == 1 && U[0][1] == U[2][0])return false;\n\tif (U[1].size() == 2 && U[2].size() == 1 && U[1][1] == U[2][0])return false;\n\treturn true;\n}\nint main() {\n\twhile (true) {\n\t\tcin >> S; if (S == \"#\")break;\n\t\tS += '|'; string T = \"\"; bool OK = false;\n\t\tfor (int i = 0; i<S.size(); i++) {\n\t\t\tif (S[i] == '|') { if (search(T) == true)OK = true; T = \"\"; }\n\t\t\tif (S[i] != '|' && S[i] != '(' && S[i] != ')')T += S[i];\n\t\t}\n\t\tif (OK == true)cout << \"yes\" << endl;\n\t\telse cout << \"no\" << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3072,
"score_of_the_acc": -0.831,
"final_rank": 9
},
{
"submission_id": "aoj_1078_2102334",
"code_snippet": "#include <string>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nstring s;\nint main() {\n\twhile (cin >> s, s != \"#\") {\n\t\ts += '|';\n\t\tint pre = -1; vector<string> v;\n\t\tfor (int i = 1; i < s.size(); i++) {\n\t\t\tif (s[i] == '|') {\n\t\t\t\tv.push_back(s.substr(pre + 2, i - pre - 3));\n\t\t\t\tpre = i;\n\t\t\t}\n\t\t}\n\t\tbool flag = false;\n\t\tfor (int i = 0; i < v.size(); i++) {\n\t\t\tv[i] += '&';\n\t\t\tint pre2 = -1; vector<bool> c(256, false);\n\t\t\tfor (int j = 1; j < v[i].size(); j++) {\n\t\t\t\tif (v[i][j] == '&') {\n\t\t\t\t\tstring w = v[i].substr(pre2 + 1, j - pre2 - 1);\n\t\t\t\t\tif (w[0] == '~') c[w[1] + 128] = true;\n\t\t\t\t\telse c[w[0]] = true;\n\t\t\t\t\tpre2 = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbool ok = true;\n\t\t\tfor (int j = 0; j < 128; j++) {\n\t\t\t\tif (c[j] && c[j + 128]) ok = false;\n\t\t\t}\n\t\t\tif (ok) flag = true;\n\t\t}\n\t\tcout << (flag ? \"yes\" : \"no\") << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3164,
"score_of_the_acc": -0.8715,
"final_rank": 11
},
{
"submission_id": "aoj_1078_2054810",
"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\"\nvector<string> split(const string &str, char delim) {\n\tvector<string> res;\n\tsize_t current = 0, found;\n\twhile ((found = str.find_first_of(delim, current)) != string::npos) {\n\t\tres.push_back(string(str, current, found - current));\n\t\tcurrent = found + 1;\n\t}\n\tres.push_back(string(str, current, str.size() - current));\n\treturn res;\n}\n\nint main() {\n\twhile(1){\n\t\tstring st; cin >> st;\n\t\tif (st == \"#\")break;\n\t\tvector<string>exprs(split(st,'|'));\n\t\tbool ans = false;\n\t\tfor (auto expr:exprs) {\n\t\t\texpr = expr.substr(1, expr.size() - 2);\n\t\t\tvector<string>lites(split(expr, '&'));\n\t\t\tset<char>trues, falses;\n\t\t\tfor (auto lite : lites) {\n\t\t\t\tif (lite[0] == '~')falses.emplace(lite[1]);\n\t\t\t\telse trues.emplace(lite[0]);\n\t\t\t}\n\t\t\tbool ok = true;\n\t\t\tfor (auto t : trues) {\n\t\t\t\tfor (auto f : falses) {\n\t\t\t\t\tif (t == f)ok = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (ok)ans = true;\n\t\t}\n\t\tif (ans)cout << \"yes\" << endl;\n\t\telse cout << \"no\" << endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3112,
"score_of_the_acc": -0.9041,
"final_rank": 16
},
{
"submission_id": "aoj_1078_1404705",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nvector<string> split(const string &str, const string &delim){\n vector<string> res;\n size_t current = 0, found, delimlen = delim.size();\n while((found = str.find(delim, current)) != string::npos){\n res.push_back(string(str, current, found - current));\n current = found + delimlen;\n }\n res.push_back(string(str, current, str.size() - current));\n return res;\n}\n\n\nvoid solve(string expr)\n{\n bool answer = false;\n\n vector<string> strings = split(expr, \"|\");\n\n for (int i = 0; i < strings.size(); i++) {\n strings[i] = strings[i].substr(1, strings[i].size() - 2);\n // cout << strings[i] << endl;\n vector<string> sstrings = split(strings[i], \"&\");\n\n bool t[3];\n char c[3];\n for (int i = 0; i < 3; i++)\n {\n if (sstrings[i].size() == 1)\n {\n c[i] = sstrings[i][0];\n t[i] = false;\n }\n else\n {\n c[i] = sstrings[i][1];\n t[i] = true;\n }\n\n // cout << c[i] << t[i] << endl;\n }\n\n if (!((c[0] == c[1] && t[0] != t[1]) || (c[0] == c[2] && t[0] != t[2]) || (c[1] == c[2] && t[1] != t[2])))\n {\n answer = true;\n // cout << \"false\" << endl;\n break;\n }\n }\n\n cout << (answer ? \"yes\" : \"no\") << endl;\n}\n\nint main()\n{\n while (true)\n {\n string input;\n cin >> input;\n\n if (input == \"#\") { break; }\n solve(input);\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1192,
"score_of_the_acc": -0.0591,
"final_rank": 5
},
{
"submission_id": "aoj_1078_1404646",
"code_snippet": "#include<iostream>\n#include<set>\n#include<vector>\n#include<algorithm>\n#include<set>\n\nusing namespace std;\n\ntypedef pair<int,char> P;\n\nint main()\n{\n\tstring s;\n\twhile(cin>>s,s!=\"#\"){\n\t\n\t\t//notじゃないのを入れる,notのを入れる\n\t\tset<char> sc1,sc2;\n\t\tbool ok=true;\n\t\tfor(int i=0;i<s.size();i++){\n\t\t\tif(s[i]=='('){ok=true; sc1.clear(); sc2.clear();}\n\t\t\tif(s[i]==')' && ok) break;\n\t\t\tif('a'<=s[i] && s[i]<='z' || 'A'<=s[i] && s[i]<='Z'){\n\t\t\t\tif(s[i-1]=='~'){\n\t\t\t\t if(sc1.find(s[i])!=sc1.end()) ok=false;\n\t\t\t\t else sc2.insert(s[i]);\n\t\t\t\t}else{\n\t\t\t\t\tif(sc2.find(s[i])!=sc2.end()) ok=false;\n\t\t\t\t\telse sc1.insert(s[i]);\n\t\t\t\t}\n\n\t\t\t}\n\t\t\t\n\t\t}\n\t\n\t\tif(ok) cout<<\"yes\"<<endl;\n\t\telse cout<<\"no\"<<endl;\n\t\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.0018,
"final_rank": 2
},
{
"submission_id": "aoj_1078_1404623",
"code_snippet": "#include<iostream>\n#include<set>\n#include<vector>\n#include<algorithm>\n#include<set>\n\nusing namespace std;\n\ntypedef pair<int,char> P;\n\nint main()\n{\n\tstring s;\n\twhile(cin>>s,s!=\"#\"){\n\t\n\t\t//notテ」ツ?佚」ツつε」ツ?ェテ」ツ??」ツ?ョテ」ツつ津・ツ?・テ」ツつ古」ツつ?notテ」ツ?ョテ」ツつ津・ツ?・テ」ツつ古」ツつ?\n\t\tset<char> sc1,sc2;\n\t\tbool ok=true;\n\t\tfor(int i=0;i<s.size();i++){\n\t\t\tif(s[i]=='('){ok=true; sc1.clear(); sc2.clear();}\n\t\t\tif(s[i]==')' && ok) break;\n\t\t\tif('a'<=s[i] && s[i]<='z' || 'A'<=s[i] && s[i]<='Z'){\n\t\t\t\tif(s[i-1]=='~'){\n\t\t\t\t if(sc1.find(s[i])!=sc1.end()) ok=false;\n\t\t\t\t else sc2.insert(s[i]);\n\t\t\t\t}else{\n\t\t\t\t\tif(sc2.find(s[i])!=sc2.end()) ok=false;\n\t\t\t\t\telse sc1.insert(s[i]);\n\t\t\t\t}\n\n\t\t\t}\n\t\t\t\n\t\t}\n\t\n\t\tif(ok) cout<<\"yes\"<<endl;\n\t\telse cout<<\"no\"<<endl;\n\t\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1184,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1078_1404618",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <cstring>\n#include <cmath>\n#include <queue>\n#include <map>\n#include <set>\nusing namespace std;\n\n#define rep(i,n) for(int i=0; i<n; i++)\n#define FOR(i,s,n) for(int i=s; i<n; i++)\n#define ALL(x) x.begin(), x.end()\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\n\nbool expr(string str) {\n\tvector<string> cls;\n\tstring s=\"\";\n\trep(i, str.length()) {\n\t\tif(str[i] == '|') {\n\t\t\tcls.push_back(s);\n\t\t\ts = \"\";\n\t\t}\n\t\telse {\n\t\t\ts += str[i];\n\t\t}\n\t}\n\tcls.push_back(s);\n\trep(i, cls.size()) {\n\t\tvector<string> lit;\n\t\tstring s=\"\";\n\t\tfor(int j=1; cls[i][j]!=')'; j++) {\n\t\t\tif( cls[i][j] == '&' ) {\n\t\t\t\tlit.push_back(s);\n\t\t\t\ts = \"\";\n\t\t\t} else {\n\t\t\t\ts += cls[i][j];\n\t\t\t}\n\t\t}\n\t\tlit.push_back(s);\n\t\tbool ok = true;\n\t\trep(j, lit.size()) {\n\t\t\tfor(int k=j+1; k<lit.size(); k++) {\n\t\t\t\tif(lit[j][lit[j].length()-1] == lit[k][lit[k].length()-1] &&\n\t\t\t\t\tlit[j].length() != lit[k].length() ) {\n\t\t\t\t\tok = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(ok) return true;\n\t}\n\treturn false;\n}\n\nint main() {\n\tstring in;\n\twhile(cin >> in, in!=\"#\") {\n\t\tif( expr(in) ) {\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": 20,
"memory_kb": 1196,
"score_of_the_acc": -0.0608,
"final_rank": 7
},
{
"submission_id": "aoj_1078_1364946",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nvector<string> split(string s, char sp){\n vector<string> res;\n int prev_split_point = 0;\n for (int i = 0; i < s.length(); i++) {\n while(s[i] != sp && i < s.length())i++;\n res.push_back(s.substr(prev_split_point, i - prev_split_point));\n prev_split_point = i + 1;\n }\n return res;\n}\n\n\nint main(int argc, char *argv[]){\n string s;\n while(cin >> s){\n if(s == \"#\")break;\n bool ans = false;\n vector<string> clous = split(s, '|');\n for (int i = 0; i < clous.size(); i++) {\n clous[i] = clous[i].substr(1, clous[i].length() - 2);\n for (int j = 0; j < clous[i].length() - 1; j++) {\n if(clous[i][j + 1] == '~' &&\n clous[i][j] == '~') {\n clous[i].erase(clous[i].begin() + j);\n clous[i].erase(clous[i].begin() + j);\n j--;\n }\n }\n }\n for (int i = 0; i < clous.size() && ans == false; i++) {\n bool flag = true;\n vector<string> litral = split(clous[i], '&');\n for (int j = 0; j < litral.size(); j++) {\n for (int k = 0; k < litral.size(); k++) {\n if(litral[j] == '~' + litral[k]){\n flag = false;\n j = litral.size(), k = litral.size();\n }\n }\n }\n if(flag)ans = true;\n }\n if(ans) std::cout << \"yes\" << std::endl;\n else std::cout << \"no\" << std::endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1192,
"score_of_the_acc": -0.0591,
"final_rank": 5
},
{
"submission_id": "aoj_1078_1360208",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<cctype>\n#include<algorithm>\n#define rep(i,n) for(int i=0;i<(int)n;i++)\nusing namespace std;\n\nint main(){\n string s;\n while(cin >> s){\n if(s == \"#\")break;\n\n bool SAT = false;\n rep(i,s.size()){\n if(s[i] == '('){\n\ti++;\n\tstring clause;\n\twhile(s[i]!=')')clause += s[i++];\n\n\tvector<char> pos, neg;\n\trep(j,clause.size()){\n\t if(isalpha(clause[j]))pos.push_back(clause[j]);\n\t else neg.push_back(clause[++j]);\n\t j++;\n\t}\n\n\tbool f = true;\n\trep(x,pos.size()){\n\t rep(y,neg.size()){\n\t if(pos[x] == neg[y])f = false;\n\t }\n\t}\n\tSAT |= f;\n }\n if(SAT)break;\n }\n\n if(SAT)cout << \"yes\" << endl;\n else cout << \"no\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1208,
"score_of_the_acc": -0.0106,
"final_rank": 4
},
{
"submission_id": "aoj_1078_1130777",
"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\nbool check(string s){\n rep(i,s.size()) if( s[i] == '&' ) s[i] = ' ';\n stringstream ss;\n ss << s;\n vector<string> vec;\n while( !( ss >> s ).fail() ) vec.push_back(s);\n set<char> S;\n rep(i,vec.size()) REP(j,i+1,vec.size()){\n char a = ( (vec[i].size() == 2 ) ? vec[i][1] : vec[i][0] );\n char b = ( (vec[j].size() == 2 ) ? vec[j][1] : vec[j][0] );\n if( a == b ) {\n if( min(vec[i].size(),vec[j].size()) == 1 && max(vec[i].size(),vec[j].size()) == 2 ) return false;\n }\n }\n return true;\n}\n\nbool compute(string s){\n rep(i,s.size()) if( s[i] == '|' || s[i] == '(' || s[i] == ')' ) s[i] = ' ';\n stringstream ss;\n ss << s;\n vector<string> vec;\n while( !( ss >> s ).fail() ) vec.push_back(s);\n rep(i,vec.size()) if( check(vec[i]) ) return true;\n return false;\n}\n\nint main(){\n string s;\n while( cin >> s, s != \"#\" ){\n puts(compute(s)?\"yes\":\"no\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1204,
"score_of_the_acc": -0.1755,
"final_rank": 8
},
{
"submission_id": "aoj_1078_698483",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <vector>\n\n#define rep(i,a) for(int i = 0;i < (a); i++)\n#define repi(i,a,b) for(int i = (a); i < (b); i++)\n#define repd(i,a,b) for(int i = (a); i >= (b); i--)\n#define repit(i,a) for(__typeof((a).begin()) i = (a).begin(); i != (a).end(); i++)\n#define all(u) (u).begin(),(u).end()\n#define rall(u) (u).rbegin(),(u).rend()\n#define UNIQUE(u) (u).erase(unique(all(u)),(u).end())\n#define pb push_back\n#define mp make_pair\n#define INF 1e9\n#define EPS 1e-9\n#define PI acos(-1.0)\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\nbool check(string s){\n int nf = 0;\n// cout << s << endl;\n map<char, int> table;\n rep(i, s.size()){\n if(s[i] == '~') nf = 1;\n if((s[i] >= 'a' && s[i] <= 'z')||(s[i] >= 'A' && s[i] <= 'Z')){\n if(table.find(s[i]) != table.end() && table[s[i]] != nf) return false;\n table[s[i]] = nf;\n nf = 0;\n }\n }\n return true;\n}\n\nint main() {\n string s;\n while(cin >> s, s != \"#\"){\n int bf = -1;\n bool ans = false;\n rep(i, s.size()){\n if(s[i] == '|'){\n ans |= check(s.substr(bf+2, i-bf-3));\n bf = i;\n }\n }\n ans |= check(s.substr(bf+2, s.size()-bf-3));\n cout << (ans?\"yes\":\"no\") << endl; \n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1188,
"score_of_the_acc": -0.0018,
"final_rank": 2
}
] |
aoj_1079_cpp
|
Problem F: Cosmic Market
Cosmic market(コズミック・マーケット)、通称コズミケ、は全宇宙最大規模の同人即売会だ。
コズミケにはあらゆるジャンルの同人愛好家達が集う。
近年、コズミケへの来場者は増加傾向にある。
最初から全ての人が入場できると大変混雑して危険なので、開場直後は入場規制を行っている。
ある一定人数の人だけが開場と同時に入場することが出来るのだ。
それ以外の人たちはしばらく待ってからの入場となっている。
しかし先着順に会場に入ることにすると、徹夜で前日から並ぶ人が出てしまう。
コズミケの参加者には未成年も多く、治安上の問題もあるので先着順という決め方はとても良くない。
そういう理由があって、コズミケでは参加者の中である種のゲームを行い、そのゲームで勝ち残った人が最初に入場する権利を手にできる。
公平を期すために毎年ランダム性の高いゲームを採用している。
僕は今回もコズミケに参加する予定だ。
僕は今回のコズミケでどうしても手に入れたい同人誌がある。
とある人気サークルが頒布する同人誌で、今年の春に話題になった魔法少女のアニメを取り扱っている。
しかし、このサークルはとても人気で毎回すぐに頒布が終了してしまう。
開場と同時に入場できなかった場合に手に入れることはほぼ不可能だろう。
もちろん後日同人ショップなどでも手に入るようになるのは間違いない。しかしそれまで我慢することなど僕には出来ない。
僕はどんな手を使ってでもコズミケ当日に手に入れなくてはいけないのだ。
不幸なことに僕は今までのコズミケで最初に入場できたことは一度もない。
コズミケのカタログによると、今回は以下のようなゲームで最初に入場できる人を選ぶらしい。
まず参加者のうち先着
r
×
c
人の人が、
r
×
c
のグリッドのように配置された座席の好きな場所に座る。
先着順で場所を選べるので早く行った方が選択肢が沢山ある。
r
×
c
人の人が座ったらゲームが始まる。
このゲームはある一定の回数、ある1つの列（行）の座席にいる全ての人に対して、着席、あるいは起立が指示される。
すでに着席している人に着席の指示が出された場合はそのまま待機すれば。起立している人も同様である。
この指示が出される対象の列（行）と指示の内容はランダムにルーレットで決められる。
ある一定の回数の指示が終わった時点で起立している人だけが最初に開場に入れるのだ。
指示の回数は参加者には知らされていないので、いつゲームが終わるか分からない。
なのである時点で立っている人も座っている人も自分が最初に入場できるかは分からない。
だからスリルを味わうことが出来る、とカタログでは強調されている。
コズミケ前日の午後1時、僕は今年のゲームに関するデータをすべて手に入れた。
僕が手に入れた情報によると、この指示の回数、
q
はすでに決まっている。
それどころか
q
回の指示内容が全てがすでに決まっている。
ランダム性が高いなどといわれているがそれは嘘だったのだ。
どういう理由があって事前に決まっているのかは分からない。
しかしこの情報は僕にとっては天の恵みのようだ。
もしこのデータどおりにゲームが行われれるのであれば、最初に入場することが出来る座席の場所が全て分かる。
最悪の場合、僕以外の参加者全員がこの情報を得ていたとしてみよう。
そんな場合でも遅くとも何番目に開場に到着すれば最初に会場に入ることが出来るかわかるはずだ。
しかしこの指示内容を今から手計算で解析するのは量が多すぎるので無理そうだ。
どんなに頑張ってもコズミケには間に合わない。
そこで、僕は君にこの計算を任せることにした。
君はプログラミングコンテストによく参加しており、このようなの計算プログラムを書くのは得意なはずだ。
もちろんただでやってくれとは言わない。
カタログによると、今年のコズミケにはプログラミングコンテストに関する同人誌を出しているサークルが参加する予定のはずだ。
もし僕が開場と同時に入場できたら報酬としてその同人誌を手に入れて君にプレゼントするよ。
さて、僕はこれから5時間ぐらい仮眠をとることにしよう。その間に君ならきっと答えを出してくれると僕は信じている。
Input
入力は複数のケースからなる。
各ケースは以下のフォーマットで与えられる。
r
c
q
A
0
B
0
order
0
A
1
B
1
order
1
.
.
.
A
q-1
B
q-1
order
q-1
A
i
= 0 の時,
B
i
行目に対して
order
i
の指示が実行される。
A
i
= 1 の時,
B
i
列目に対して
order
i
の指示が実行される。
order
i
= 0の時は指定された行または列の人全員を座らせる。
order
i
= 1の時は指定された行または列を人全員を立たせる。
入力の終わりは
r
=0
c
=0
q
=0 で与えられる。
入力の値は以下の条件を満たす。
1 ≤
r
≤ 50,000
1 ≤
c
≤ 50,000
1 ≤
q
≤ 50,000
order
i
= 0 または 1
A
i
= 0 の時
0 ≤
B
i
<
r
A
i
= 1 の時
0 ≤
B
i
<
c
テストケースの数は100を超えない
Output
最悪の場合に、何番目までに到着すれば最初に会場に入れる権利を得ることが出来るかを一行で出力せよ。
Sample input
5 5 5
0 0 1
0 0 0
0 2 0
1 2 1
0 0 0
5 5 5
1 4 0
0 1 1
0 4 1
1 3 0
0 3 1
5 5 5
1 0 0
0 3 0
1 2 1
0 4 0
0 1 1
0 0 0
Sample output
4
13
8
The University of Aizu Programming Contest 2011 Summer
原案、問題文: Tomoya Sakai
|
[
{
"submission_id": "aoj_1079_3911787",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcountll\n\n#define INF 1e16\n#define mod 1000000007\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while(1){\n ll R,C,Q;\n cin>>R>>C>>Q;\n if(R==0&&C==0&&Q==0){\n break;\n }\n\n vector<ll> A(Q),B(Q),Ca(Q);\n rep(i,Q){\n cin>>A[i]>>B[i]>>Ca[i];\n }\n\n vector<bool> usedR(R,false),usedC(C,false);\n ll cntr=0,cntc=0;\n ll cnt=0;\n for(ll i=Q-1;i>=0;i--){\n ll a,b,c;\n a=A[i]; b=B[i]; c=Ca[i];\n\n if(a==0){\n if(c==0){\n if(usedR[b])continue;\n usedR[b]=true;\n cntr++;\n }else{\n if(usedR[b])continue;\n usedR[b]=true;\n cnt+=(C-cntc);\n cntr++;\n }\n }else{\n if(c==0){\n if(usedC[b])continue;\n usedC[b]=true;\n cntc++;\n }else{\n if(usedC[b])continue;\n usedC[b]=true;\n cnt+=(R-cntr);\n cntc++;\n }\n }\n\n }\n cout<<cnt<<endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 4208,
"score_of_the_acc": -0.5366,
"final_rank": 6
},
{
"submission_id": "aoj_1079_3911606",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing db = double;\nusing ld = long double;\n#define fs first\n#define sc second\n#define pb push_back\n#define mp make_pair\n#define mt make_tuple\n#define eb emplace_back\n#define all(v) (v).begin(), (v).end()\n#define siz(v) (ll)(v).size()\n#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)\n#define repr(i, a, n) for (ll i = n - 1; (ll)a <= i; i--)\n#define lb lower_bound\n#define ub upper_bound\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> PL;\nconst ll mod = 1000000007;\nconst ll INF = 1000000099;\nconst ll LINF = (ll)(1e18 + 99);\nvector<ll> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};\ntemplate <typename T>\nT gcd(T a, T b) { return b ? gcd(b, a % b) : a; }\ntemplate <typename T>\nT mpow(T a, T n)\n{\n T res = 1;\n for (; n; n >>= 1)\n {\n if (n & 1)\n res = res * a;\n a = a * a;\n }\n return res;\n}\n\n//cin.tie(0);ios::sync_with_stdio(false);\n\nvector<vector<bool>> fl(2, vector<bool>());\n\nsigned main()\n{\n\n while (1)\n {\n\n ll r, c, q, ans = 0;\n cin >> r >> c >> q;\n if (!r && !c && !q)\n return 0;\n\n \n fl[0] = vector<bool>(r, false);\n fl[1] = vector<bool>(c, false);\n\n vector<ll> a(q), b(q), o(q);\n rep(i, 0, q)\n {\n cin >> a[i] >> b[i] >> o[i];\n }\n\n for (int i = q - 1; 0 <= i; i--)\n {\n if (fl[a[i]][b[i]])\n continue; //指示済みは無視\n\n fl[a[i]][b[i]] = true;\n\n if (o[i])\n {\n if (!a[i])\n {\n ans += c;\n r--;\n }\n else\n {\n ans += r;\n c--;\n }\n }\n else\n {\n if (!a[i])\n {\n r--;\n }\n else\n {\n c--;\n }\n }\n }\n\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 410,
"memory_kb": 4156,
"score_of_the_acc": -1.0439,
"final_rank": 10
},
{
"submission_id": "aoj_1079_3911578",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#define _GLIBCXX_DEBUG\n#include<bits/stdc++.h>\nusing namespace::std;\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\n// random_device rd;\n// mt19937 mt(rd());\n// #include <boost/numeric/interval.hpp>\n// #include <boost/numeric/interval/io.hpp>\n// #include <boost/intrusive/rbtree.hpp>\n// #include <boost/geometry.hpp>\n// #include <boost/geometry/geometries/linestring.hpp>\n// #include <boost/geometry/geometries/polygon.hpp>\n// #include <boost/geometry/geometries/point_xy.hpp>\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// typedef mp::number<mp::cpp_dec_float<0>> cfloat;\n// typedef mp::cpp_int cint;\n\n#include<ext/pb_ds/assoc_container.hpp>\n#include<ext/pb_ds/tree_policy.hpp>\n#include <ext/pb_ds/priority_queue.hpp>\n#include<ext/pb_ds/tag_and_trait.hpp>\nusing namespace __gnu_pbds;\ntemplate<typename T=long long>using pbds=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;\ntemplate<typename T=long long>using pqueue =__gnu_pbds::priority_queue<T, less<T>,rc_binomial_heap_tag>;\ntypedef long long lint;\ntypedef long long ll;\ntypedef long double ldouble;\ntypedef vector<lint> vec;\ntypedef vector<vector<lint>> mat;\ntypedef vector<vector<vector<lint>>> mat3;\ntypedef vector<double> dvec;\ntypedef vector<vector<double>> dmat;\ntypedef vector<vector<vector<double>>> dmat3;\ntypedef vector<string> svec;\ntypedef vector<vector<string>> smat;\ntypedef vector<vector<vector<string>>> smat3;\ntypedef vector<pair<lint,lint>> pvec;\ntypedef vector<vector<pair<lint,lint>>> pmat;\ntypedef vector<vector<vector<pair<lint,lint>>>> pmat3;\n#define rep(i, n) for(lint i = 0; i < (lint)(n); i++)\n#define irep(i) for(lint i = 0;; i++)\n#define irep1(i) for(lint i = 1;; i++)\n#define irep2(i) for(lint i = 2;; i++)\n#define rrep(i, n) for(lint i = (lint)(n-1); i >-1; i--)\n#define rrepi(i,a,b) for(lint i = (lint)(b-1); i >a-1; i--)\n#define repi(i,a,b) for(lint i=lint(a);i<lint(b);i++)\n#define rep2(i,a,b,c) for(lint i=lint(a);i>lint(b);i+=c)\n#define all(x) (x).begin(),(x).end()\n//#define PI 3.141592653589793\n#define dist(x1,y1,x2,y2) (pow(pow(x2-x1,2)+pow(y2-y1,2),0.5))\n#define output(v) do{bool f=0;for(auto i:v){cout<<(f?\" \":\"\");if(i>INF/2)cout<<\"INF\";else cout<<i;f=1;}cout<<\"\\n\";}while(0)\n#define output2(v) for(auto j:v)output(j);\n#define _output(v) do{bool f=0;rep(i,v.size()){cout<<(f?\" \":\"\");if(v[i]>INF/2)cout<<\"INF\";else cout<<v[i];f=1;}cout<<\"\\n\";}while(0)\n#define _output2(v) rep(j,v.size()){_output(v[j]);}\n#define input(a,n) lint n;cin>>n;vector<lint>a(n);rep(i,n)cin>>a[i];\n#define SUM(v) accumulate(all(v),0LL)\n#define INF (1LL<<60)\n#define IINF (1<<30)\n#define EPS (1e-10)\n#define LINF 9223372036854775807\n#define MOD 998244353\n#define endl \"\\n\"\ntemplate<typename T=lint>T in(){return *istream_iterator<T>(cin);}\ninline lint gcd(lint a,lint b){return b?gcd(b,a%b):a;}\ntemplate<typename T=lint>inline T lcm(T a,T b){return a/gcd(a,b)*b;}\ntemplate<typename T=lint>inline T add(T a,T b){return a+b;}\ntemplate<typename T=lint>inline T minq(T a,T b){return min(a,b);}\ninline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}\ninline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}\nvector<lint> dx={-1,1,0,0,1,1,-1,-1};\nvector<lint> dy={0,0,-1,1,1,-1,1,-1};\n\n\n\nint main(){\n while(1){\n lint r,c,q;\n cin>>r>>c>>q;\n if(r==0&&c==0&&q==0)break;\n vec a(q),b(q),o(q);\n rep(i,q){\n cin>>a[i]>>b[i]>>o[i];\n }\n reverse(all(a));\n reverse(all(b));\n reverse(all(o));\n set<lint>dr,dc;\n lint ans=0;\n rep(i,q){\n if(a[i]){\n if(dc.count(b[i]))continue;\n dc.insert(b[i]);\n if(o[i])ans+=r-dr.size();\n }else{\n if(dr.count(b[i]))continue;\n dr.insert(b[i]);\n if(o[i])ans+=c-dc.size();\n }\n }\n cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 450,
"memory_kb": 6316,
"score_of_the_acc": -1.5831,
"final_rank": 17
},
{
"submission_id": "aoj_1079_3911518",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct data {\n bool a, o;\n long long b;\n};\n\nlong long r, c, q;\nvector<data> query;\n\nlong long solve();\n\nint main() {\n while(1) {\n cin >> r >> c >> q;\n if(r + c + q == 0) break;\n query.resize(q);\n for(int i = 0; i < q; ++i)\n cin >> query[q - 1 - i].a >> query[q - 1 - i].b >>\n query[q - 1 - i].o;\n cout << solve() << endl;\n }\n return 0;\n}\n\nlong long solve() {\n long long ans = 0;\n set<long long> st[2];\n for(int i = 0; i < q; ++i) {\n data now = query[i];\n if(st[now.a].find(now.b) != st[now.a].end()) continue;\n if(now.o) {\n if(now.a)\n ans += r;\n else\n ans += c;\n }\n if(now.a)\n --c;\n else\n --r;\n st[now.a].insert(now.b);\n }\n return ans;\n}",
"accuracy": 1,
"time_ms": 580,
"memory_kb": 6124,
"score_of_the_acc": -1.7825,
"final_rank": 19
},
{
"submission_id": "aoj_1079_3321310",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nint main(){\n int r,c,q;\n while(scanf(\" %d %d %d\", &r, &c, &q),r){\n vector<int> a(q),b(q),o(q);\n rep(i,q) scanf(\" %d %d %d\", &a[i], &b[i], &o[i]);\n\n ll ans = 0;\n int R = r, C = c;\n vector<int> y(r,-1), x(c,-1);\n for(int i=q-1; i>=0; --i){\n if(a[i]==0){\n if(y[b[i]] != -1) continue;\n if(o[i]==1) ans += C;\n --R;\n y[b[i]] = o[i];\n }\n else{\n if(x[b[i]] != -1) continue;\n if(o[i]==1) ans += R;\n --C;\n x[b[i]] = o[i];\n }\n }\n printf(\"%lld\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3872,
"score_of_the_acc": -0.4828,
"final_rank": 5
},
{
"submission_id": "aoj_1079_2583471",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\nenum Type{\n\tsit_down,\n\tstand_up,\n};\n\nstruct Info{\n\tbool operator<(const Info &arg) const{\n\t\treturn time > arg.time;\n\t}\n\tint row_or_col,loc,time;\n\tType order;\n};\n\nint Q;\nll R,C;\nInfo order_row[50000],order_col[50000];\n\nvoid func(){\n\n\tfor(int i = 0; i < R; i++){\n\t\torder_row[i].row_or_col = -1;\n\t}\n\tfor(int i = 0; i < C; i++){\n\t\torder_col[i].row_or_col = -1;\n\t}\n\n\tint row_or_col,loc,order;\n\n\tfor(int loop = 0; loop < Q; loop++){\n\t\tscanf(\"%d %d %d\",&row_or_col,&loc,&order);\n\t\tif(row_or_col == 0){\n\t\t\torder_row[loc].row_or_col = 0;\n\t\t\torder_row[loc].loc = loc;\n\t\t\torder_row[loc].time = loop;\n\t\t\tif(order == 0){\n\t\t\t\torder_row[loc].order = sit_down;\n\t\t\t}else{\n\t\t\t\torder_row[loc].order = stand_up;\n\t\t\t}\n\t\t}else{\n\t\t\torder_col[loc].row_or_col = 1;\n\t\t\torder_col[loc].loc = loc;\n\t\t\torder_col[loc].time = loop;\n\t\t\tif(order == 0){\n\t\t\t\torder_col[loc].order = sit_down;\n\t\t\t}else{\n\t\t\t\torder_col[loc].order = stand_up;\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<Info> V;\n\n\tfor(int i = 0; i < R; i++){\n\t\tif(order_row[i].row_or_col != -1){\n\t\t\tV.push_back(order_row[i]);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < C; i++){\n\t\tif(order_col[i].row_or_col != -1){\n\t\t\tV.push_back(order_col[i]);\n\t\t}\n\t}\n\n\tsort(V.begin(),V.end());\n\n\tll ans = 0;\n\tll sit_row_num = 0,sit_col_num = 0,stand_row_num = 0,stand_col_num = 0;\n\n\tfor(int i = 0; i < V.size(); i++){\n\n\t\tif(V[i].row_or_col == 0){\n\t\t\tif(V[i].order == stand_up){\n\t\t\t\tans += C-(sit_col_num+stand_col_num);\n\t\t\t\tstand_row_num++;\n\t\t\t}else{\n\t\t\t\tsit_row_num++;\n\t\t\t}\n\t\t}else{\n\t\t\tif(V[i].order == stand_up){\n\t\t\t\tans += R-(sit_row_num+stand_row_num);\n\t\t\t\tstand_col_num++;\n\t\t\t}else{\n\t\t\t\tsit_col_num++;\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%lld %lld %d\",&R,&C,&Q);\n\t\tif(R == 0 && C == 0 && Q == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 6360,
"score_of_the_acc": -1.1296,
"final_rank": 11
},
{
"submission_id": "aoj_1079_2386933",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <string>\n#include <sstream>\n\nusing namespace std;\n\nint order[100000][3];\n\nbool check_r[100000];\nbool check_c[100000];\n\nint main(){\n\t\n\tint r, c, q;\n\t\n\twhile(true){\n\t\t\n\t\tcin >> r >> c >> q;\n\t\t\n\t\tif(r == 0 && c == 0 && q == 0){\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < 100000; i++){\n\t\t\tcheck_r[i] = false;\n\t\t\tcheck_c[i] = false;\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < q; i++){\n\t\t\tcin >> order[i][0] >> order[i][1] >> order[i][2];\n\t\t}\n\t\t\n\t\tlong long int r_rest = c;\n\t\tlong long int c_rest = r;\n\t\t\n\t\tlong long int ans = 0;\n\t\t\n\t\tfor(int i = q - 1; i >= 0; i--){\n\t\t\tif(order[i][0] == 0){\n\t\t\t\tif(!check_c[order[i][1]]){\n\t\t\t\t\tif(order[i][2] == 1){\n\t\t\t\t\t\tans += r_rest;\n\t\t\t\t\t}\n\t\t\t\t\tcheck_c[order[i][1]] = true;\n\t\t\t\t\tc_rest--;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(!check_r[order[i][1]]){\n\t\t\t\t\tif(order[i][2] == 1){\n\t\t\t\t\t\tans += c_rest;\n\t\t\t\t\t}\n\t\t\t\t\tcheck_r[order[i][1]] = true;\n\t\t\t\t\tr_rest--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tcout << ans << endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 410,
"memory_kb": 3828,
"score_of_the_acc": -0.9733,
"final_rank": 8
},
{
"submission_id": "aoj_1079_2178500",
"code_snippet": "#include <cstdio>\n#include <algorithm>\nusing namespace std;\nint H, W, Q, a[50009], b[50009], x[50009]; bool used1[50009], used2[50009];\nint main() {\n\twhile (scanf(\"%d%d%d\", &H, &W, &Q), H) {\n\t\tfor (int i = 0; i < Q; i++) scanf(\"%d%d%d\", &a[i], &b[i], &x[i]);\n\t\tfill(used1, used1 + H, false);\n\t\tfill(used2, used2 + W, false);\n\t\tint cnt1 = H, cnt2 = W;\n\t\tlong long ret = 0;\n\t\twhile (Q--) {\n\t\t\tif (a[Q] == 0 && !used1[b[Q]]) {\n\t\t\t\tused1[b[Q]] = true; cnt1--;\n\t\t\t\tif (x[Q] == 1) ret += cnt2;\n\t\t\t}\n\t\t\tif (a[Q] == 1 && !used2[b[Q]]) {\n\t\t\t\tused2[b[Q]] = true; cnt2--;\n\t\t\t\tif (x[Q] == 1) ret += cnt1;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%lld\\n\", ret);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 3332,
"score_of_the_acc": -0.348,
"final_rank": 3
},
{
"submission_id": "aoj_1079_2168149",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<tuple>\nusing namespace std;\n#pragma warning(disable:4996)\nint H, W, Q, a[60000], b[60000], c[60000], d[60000], e, f, g;\nint main() {\n\twhile (true) {\n\t\tcin >> H >> W >> Q; if (H == 0)break;\n\t\tfor (int i = 0; i < H; i++) { a[i] = -1; c[i] = 0; }\n\t\tfor (int i = 0; i < W; i++) { b[i] = -1; d[i] = 0; }\n\t\tfor (int i = 0; i < Q; i++) {\n\t\t\tscanf(\"%d%d%d\", &e, &f, &g);\n\t\t\tif (e == 0) { a[f] = i; c[f] = g; }\n\t\t\tif (e == 1) { b[f] = i; d[f] = g; }\n\t\t}\n\t\tlong long R1 = 0, R2 = 0, M = 0, cnt = 0;\n\t\tvector<tuple<int, int, int>>tup;\n\t\tfor (int i = 0; i < H; i++)tup.push_back(make_tuple(a[i], 0, c[i]));\n\t\tfor (int i = 0; i < W; i++)tup.push_back(make_tuple(b[i], 1, d[i]));\n\t\tsort(tup.begin(), tup.end());\n\t\tfor (int i = 0; i < tup.size(); i++) {\n\t\t\tint a1 = get<0>(tup[i]), a2 = get<1>(tup[i]), a3 = get<2>(tup[i]);\n\t\t\tif (a2 == 0)R1++; if (a2 == 1)R2++;\n\t\t\tif (a3 == 1)cnt += R1*R2 - M; M = R1*R2;\n\t\t}\n\t\tcout << cnt << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 6324,
"score_of_the_acc": -1.1774,
"final_rank": 12
},
{
"submission_id": "aoj_1079_2108316",
"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<stack>\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 vector<string> vs;\ntypedef vector<double> vd;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nint main(){\n\tint n,m,q;\n\twhile(cin>>n>>m>>q,n+m+q){\n\t\tvi h(n),w(m);\n\t\tint coh=0,cow=0;\n\t\tvvi in(q,vi(3));\n\t\trep(i,q)rep(j,3)cin>>in[q-1-i][j];\n\t\tint out=0;\n\t\trep(i,q){\n\t\t\tif(in[i][0]&&w[in[i][1]]==0){\n\t\t\t\tif(in[i][2])out+=n-coh;\n\t\t\t\tcow++;\n\t\t\t\tw[in[i][1]]=true;\n\t\t\t}else if(in[i][0]==0&&h[in[i][1]]==0){\n\t\t\t\tif(in[i][2])out+=m-cow;\n\t\t\t\tcoh++;\n\t\t\t\th[in[i][1]]=true;\n\t\t\t}\n\t\t}\n\t\tcout<<out<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 670,
"memory_kb": 5936,
"score_of_the_acc": -1.9087,
"final_rank": 20
},
{
"submission_id": "aoj_1079_2054835",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n\nstruct query{\n\tint a;\n\tint b;\n\tint o;\n};\n\nint main() {\n\twhile (1) {\n\t\tint R, C, Q; cin >> R >> C >> Q;\n\t\tif (!R)break;\n\t\tvector<query>qs;\n\t\tfor (int i = 0; i < Q; ++i) {\n\t\t\tint a, b, o; cin >> a >> b >> o;\n\t\t\tqs.push_back(query{ a,b,o });\n\t\t}\n\t\tvector<int>rstatus(R), cstatus(C);\n\t\tint rvalid = R, cvalid = C;\n\t\tint ans = 0;\n\t\tfor (int i = Q - 1; i >= 0;--i) {\n\t\t\tquery q(qs[i]);\n\t\t\tif (q.o == 1) {\n\t\t\t\tif (q.a == 0) {\n\t\t\t\t\tif (!rstatus[q.b]) {\n\t\t\t\t\t\trstatus[q.b] = 1;\n\t\t\t\t\t\tans += cvalid;\n\t\t\t\t\t\trvalid--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tif (!cstatus[q.b]) {\n\t\t\t\t\t\tcstatus[q.b] = 1;\n\t\t\t\t\t\tans += rvalid;\n\t\t\t\t\t\tcvalid--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (q.a == 0) {\n\t\t\t\t\tif (!rstatus[q.b]) {\n\t\t\t\t\t\trstatus[q.b] = -1;\n\t\t\t\t\t\trvalid--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tif (!cstatus[q.b]) {\n\t\t\t\t\t\tcstatus[q.b] = -1;\n\t\t\t\t\t\tcvalid--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 570,
"memory_kb": 4060,
"score_of_the_acc": -1.3196,
"final_rank": 16
},
{
"submission_id": "aoj_1079_2054827",
"code_snippet": "#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n//// < \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\a.txt\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n\nstruct query{\n\tint a;\n\tint b;\n\tint o;\n};\n\nint main() {\n\twhile (1) {\n\t\tint R, C, Q; cin >> R >> C >> Q;\n\t\tif (!R)break;\n\t\tvector<query>qs;\n\t\tfor (int i = 0; i < Q; ++i) {\n\t\t\tint a, b, o; cin >> a >> b >> o;\n\t\t\tqs.push_back(query{ a,b,o });\n\t\t}\n\t\treverse(qs.begin(), qs.end());\n\t\tvector<int>rstatus(R), cstatus(C);\n\t\tint rvalid = R, cvalid = C;\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < Q; ++i) {\n\t\t\tquery q(qs[i]);\n\t\t\tif (q.o == 1) {\n\t\t\t\tif (q.a == 0) {\n\t\t\t\t\tif (!rstatus[q.b]) {\n\t\t\t\t\t\trstatus[q.b] = 1;\n\t\t\t\t\t\tans += cvalid;\n\t\t\t\t\t\trvalid--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tif (!cstatus[q.b]) {\n\t\t\t\t\t\tcstatus[q.b] = 1;\n\t\t\t\t\t\tans += rvalid;\n\t\t\t\t\t\tcvalid--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (q.a == 0) {\n\t\t\t\t\tif (!rstatus[q.b]) {\n\t\t\t\t\t\trstatus[q.b] = -1;\n\t\t\t\t\t\trvalid--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tif (!cstatus[q.b]) {\n\t\t\t\t\t\tcstatus[q.b] = -1;\n\t\t\t\t\t\tcvalid--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 510,
"memory_kb": 4204,
"score_of_the_acc": -1.2394,
"final_rank": 15
},
{
"submission_id": "aoj_1079_2029331",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\n#define rep(i,n) REP(i,0,n)\n#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)\n#define watch(a) { cout << #a << \" = \" << a << endl; }\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\nint A[50001], B[50001], O[50001];\n\nint main() {\n\n for(int R, C, Q; cin >> R >> C >> Q && R && C && Q;) {\n rep(i, Q) {\n cin >> A[i] >> B[i] >> O[i];\n }\n\n set<int> vis[2];\n int rcnt = 0, ccnt = 0;\n ll sum = 0;\n\n for(int i=Q-1; i>=0; i--) {\n if(vis[A[i]].count(B[i])) continue;\n vis[A[i]].insert(B[i]);\n if(O[i]) {\n if(A[i]) sum += R - rcnt;\n else sum += C - ccnt;\n }\n if(A[i]) ccnt ++;\n else rcnt ++;\n }\n cout << sum << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 590,
"memory_kb": 5908,
"score_of_the_acc": -1.7545,
"final_rank": 18
},
{
"submission_id": "aoj_1079_2028208",
"code_snippet": "#include <bits/stdc++.h>\n#define N 50001\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n while(1){\n ll r,c,q;\n cin>>r>>c>>q;\n if(!r&&!c&&!q)return 0;\n\n ll A[N],B[N],O[N];\n for(int i=0;i<q;i++)cin>>A[i]>>B[i]>>O[i];\n \n ll ans=0,cnt[2]={},rc[]={r,c},used[2][N]={};\n for(int i=q-1;i>=0;i--){\n bool f=A[i];\n if(used[f][B[i]]++)continue;\n cnt[f]++;\n ans+=(rc[!f]-cnt[!f])*O[i];\n }\n cout <<ans<<endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 410,
"memory_kb": 4904,
"score_of_the_acc": -1.205,
"final_rank": 14
},
{
"submission_id": "aoj_1079_2028207",
"code_snippet": "#include <bits/stdc++.h>\n#define N 50001\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n while(1){\n ll r,c,q;\n cin>>r>>c>>q;\n if(!r&&!c&&!q)return 0;\n\n ll A[N],B[N],O[N];\n for(int i=0;i<q;i++)cin>>A[i]>>B[i]>>O[i];\n \n ll ans=0,cnt[2]={},rc[]={r,c},used[2][N]={};\n for(int i=q-1;i>=0;i--){\n ll f=A[i],RC=B[i];\n if(used[f][RC]++)continue;\n cnt[f]++;\n ans+=(rc[!f]-cnt[!f])*O[i];\n }\n cout <<ans<<endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 400,
"memory_kb": 4932,
"score_of_the_acc": -1.1925,
"final_rank": 13
},
{
"submission_id": "aoj_1079_1867997",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint main()\n{\n ll R, C, Q;\n while (cin >> R >> C >> Q, R) {\n vector<ll> a(Q), b(Q), order(Q);\n for (int i = 0; i < Q; i++) {\n cin >> a[i] >> b[i] >> order[i];\n }\n vector<bool> used_a(R, 0), used_b(C, 0);\n ll r = 0, c = 0, res = 0;\n for (int i = Q-1; i >= 0; i--) {\n if (a[i] == 0) { // ???\n if (!used_a[b[i]]) {\n used_a[b[i]] = 1;\n r++;\n if (order[i] == 1) {\n res += C - c;\n }\n }\n } else { // ???\n if (!used_b[b[i]]) {\n used_b[b[i]] = 1;\n c++;\n if (order[i] == 1) {\n res += R - r;\n }\n }\n }\n }\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 420,
"memory_kb": 4056,
"score_of_the_acc": -1.0409,
"final_rank": 9
},
{
"submission_id": "aoj_1079_1804083",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint main()\n{\n ll R, C, Q;\n while (cin >> R >> C >> Q, R) {\n vector<ll> a(Q), b(Q), order(Q);\n for (int i = 0; i < Q; i++) {\n cin >> a[i] >> b[i] >> order[i];\n }\n vector<bool> used_a(R, 0), used_b(C, 0);\n ll r = 0, c = 0, res = 0;\n for (int i = Q-1; i >= 0; i--) {\n if (a[i] == 0) { // ティツ。ツ?\n if (!used_a[b[i]]) {\n used_a[b[i]] = 1;\n r++;\n if (order[i] == 1) {\n res += C - c;\n }\n }\n } else { // テ・ツ按?\n if (!used_b[b[i]]) {\n used_b[b[i]] = 1;\n c++;\n if (order[i] == 1) {\n res += R - r;\n }\n }\n }\n }\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 540,
"memory_kb": 2368,
"score_of_the_acc": -0.8997,
"final_rank": 7
},
{
"submission_id": "aoj_1079_1110212",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint d[51000];\nint e[51000];\nint f[51000];\nint row[51000];\nint col[51000];\nint main(){\n\tint a,b,c;\n\twhile(scanf(\"%d%d%d\",&a,&b,&c),a){\n\t\tfor(int i=0;i<a;i++)row[i]=1;\n\t\tfor(int j=0;j<b;j++)col[j]=1;\n\t\tfor(int i=0;i<c;i++)scanf(\"%d%d%d\",d+i,e+i,f+i);\n\t\tint R=a;\n\t\tint C=b;\n\t\tlong long ret=0;\n\t\tfor(int i=c-1;i>=0;i--){\n\t\t\tif(d[i]){\n\t\t\t\tif(!col[e[i]])continue;\n\t\t\t\tcol[e[i]]=0;\n\t\t\t\tC--;\n\t\t\t\tif(f[i])ret+=R;\n\t\t\t}else{\n\t\t\t\tif(!row[e[i]])continue;\n\t\t\t\trow[e[i]]=0;\n\t\t\t\tR--;\n\t\t\t\tif(f[i])ret+=C;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%lld\\n\",ret);\n\t}\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 2020,
"score_of_the_acc": -0.2506,
"final_rank": 2
},
{
"submission_id": "aoj_1079_955162",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdio>\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 \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\n \nstatic const double EPS = 1e-8;\n\nstruct Order{\n int type;\n int pos;\n int action;\n Order(int _t,int _p,int _a) : type(_t),pos(_p),action(_a) {}\n};\n\nbool is_used_row[50001];\nbool is_used_col[50001];\n\nint main(){\n int total_rows,total_cols,total_queries;\n\n while(~scanf(\"%d %d %d\",&total_rows,&total_cols,&total_queries)){\n if(total_rows == 0 && total_cols == 0 && total_queries == 0) break;\n\n vector<Order> orders;\n memset(is_used_row,false,sizeof(is_used_row));\n memset(is_used_col,false,sizeof(is_used_col));\n\n ll remaining_row = total_rows;\n ll remaining_col = total_cols;\n\n for(int query_idx = 0; query_idx < total_queries; query_idx++){\n\n int order_type;\n int pos;\n int action;\n scanf(\"%d %d %d\",&order_type,&pos,&action);\n orders.push_back(Order(order_type,pos,action));\n }\n\n ll occupied_seats = 0;\n for(int query_idx = total_queries -1; query_idx >= 0; query_idx--){\n \n //row\n if(orders[query_idx].type == 0){\n if(is_used_row[orders[query_idx].pos]) continue;\n\n is_used_row[orders[query_idx].pos] = true;\n\n //0:sit 1:stand up\n if(orders[query_idx].action == 1) {\n occupied_seats += remaining_col;\n }\n remaining_row--;\n }\n\n //col\n else if(orders[query_idx].type == 1){\n if(is_used_col[orders[query_idx].pos]) continue;\n\n is_used_col[orders[query_idx].pos] = true;\n\n //0:sit 1:stand up\n if(orders[query_idx].action == 1) {\n occupied_seats += remaining_row;\n }\n remaining_col--;\n }\n }\n printf(\"%lld\\n\",occupied_seats);\n }\n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 2448,
"score_of_the_acc": -0.3984,
"final_rank": 4
},
{
"submission_id": "aoj_1079_804381",
"code_snippet": "#include <cstdio>\n\nusing namespace std;\n\nint main()\n{\n for (;;) {\n int r, c, q;\n\n scanf(\"%d %d %d\", &r, &c, &q);\n if (r == 0 && c == 0 && q == 0)\n break;\n\n int a[50000], b[50000], o[50000];\n for (int i = 0; i < q; ++i)\n scanf(\"%d %d %d\", &a[i], &b[i], &o[i]);\n\n int e = 0, nr = r, nc = c;\n bool f[2][50000] = {};\n for (int i = q - 1; i >= 0; --i) {\n if (!f[a[i]][b[i]]) {\n f[a[i]][b[i]] = true;\n\n if (a[i] == 0) {\n --nr;\n if (o[i] == 1)\n e += nc;\n } else {\n --nc;\n if (o[i] == 1)\n e += nr;\n }\n }\n }\n\n printf(\"%d\\n\", e);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 1716,
"score_of_the_acc": -0.1852,
"final_rank": 1
}
] |
aoj_1082_cpp
|
Problem I: 11224111122411
腕が引っかかって抜けない。
机の裏に転がり込んでしまったものを拾おうとして、懐中電灯代わりに携帯の画面で照らしながら腕を挿し込んでみたが、うっかり何かに引っかかって抜けなくなってしまった。無理に動かすと痛い。
どうしよう。どうすれば脱出できるのだろう。大声で助けを呼ぶか。恥ずかしいので却下したいが、独力で脱出するのは難しそうだ。いや、声の届く範囲には誰もいなかったはずだ。焦る気持ちを押さえて辺りを見渡す。あのパソコンに手が届けばメールで助けを呼べるのだが、あいにく遠すぎる。やはり偶然誰かが通りかかるのを待つしかないのか。
いや待て、メールを送る機械ならあるじゃないか。手の届くところというよりも、既にこの手の中に。深く伸ばした手の先の画面はぼやけてよく見えないが、長年使っている携帯だ。画面が見えなくてもメールぐらいは送れるはずだ。
慎重に、頭の中に画面を描きながらボタンを押す。指の感触だけを頼りに、タイプミスだけはしないように、数字キーを何度も押してメッセージを打ち込む。漢字変換はしない、平仮名でもきっと伝わるはずだ。つくづくタッチパネルが主流のスマートフォンに乗り換えていなくてよかったと思う。
深呼吸をして、送信ボタンに指をかける。しばらくして、携帯が軽く震えた。送信完了の合図だ。溜息。しばらくすれば友人が助けに来るに違いない。
友人は賢いので適切に解釈してくれると思うのだが、今送ったメッセージは、本当に送りたかったメッセージとは違うものになっているかもしれない。この携帯の文字入力メソッドは広く使われているものと同じで、例えば「あ」行の平仮名を入力するのに "1" のボタンを使う。 "1" は「あ」を、 "11" は「い」を、以下同様に "11111" が「お」を表す。平仮名はループする、つまり "111111" もまた「あ」となる。「か」行は "2" 、「さ」行は "3" 、 ... を使い、同じボタンを続けて押したときの挙動は "1" の例と同様である。
ただし、この文字入力メソッドにはちょっと厄介な挙動がある。数字ボタンを押した後しばらく操作しないでいると、平仮名への変換が強制的に行われてしまうのだ。つまり、３回続けて "1" を押せば 「う」 になるが、時間を置いて３回 "1" を押すと「あああ」になる。別の例をあげると、 "111111" と押したとき、その押す間隔によって入力された文字列は「あ」にも「ああああああ」にもなる。"111111111111"は「い」かもしれないし、「ええいああ」かもしれないし、１２個の「あ」になるかもしれない。なお、違う数字ボタンを押したときにも平仮名への変換はおこなわれるので、 "12345" は「あかさたな」という文字列にしかなりえない。
さて、慎重にタイプしたので間違ったボタンを押したつもりはないのだが、適切な間隔でボタンを押せた自信はない。本当に送りたかったメッセージとは違うものを送ってしまった可能性は大いにあるのだ。さて、送られたかもしれない文字列の数は何通りだろうか。ああ、これは友人が助けに来るまでの暇つぶしにいいかもしれない。遅くても５時間以内に助けに来てくれるだろう。それまでに解けるといいのだけど。
Input
入力は複数のケースからなる。
各ケースは以下のフォーマットで与えられる。
string
入力の終わりは,入力が"#"からなる行によって与えられる
string
は0から9の間の数字を最大100,000個含む。
string
の長さが10,000を越える入力は50個を超えない。
テストケースのファイルサイズは5MB以下であることが保証される。
またテストケースの数は100を超えない。
各数字キーで入力可能な文字は以下の表のとおりである。
数字
入力可能な文字
1
あいうえお
2
かきくけこ
3
さしすせそ
4
たちつてと
5
なにぬねの
6
はひふへほ
7
まみむめも
8
やゆよ
9
らりるれろ
0
わをん
Output
文章の解釈の仕方を100000007で割った余りを1行に出力せよ。
Sample input
1
11
111111
111111111111
12345
11111111119999999999
11111111113333333333
11111111118888888888
11111111112222222222111111111
11111111110000000000444444444
11224111122411
888888888888999999999999888888888888999999999999999999
666666666666666777333333333338888888888
1111114444441111111444499999931111111222222222222888111111115555
#
Sample output
1
2
32
1856
1
230400
230400
156480
56217600
38181120
128
26681431
61684293
40046720
The University of Aizu Programming Contest 2011 Summer
原案: Tomoya Sakai
問題文: Takashi Tayama
|
[
{
"submission_id": "aoj_1082_3911751",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#define _GLIBCXX_DEBUG\n#include<bits/stdc++.h>\nusing namespace::std;\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\n// random_device rd;\n// mt19937 mt(rd());\n// #include <boost/numeric/interval.hpp>\n// #include <boost/numeric/interval/io.hpp>\n// #include <boost/intrusive/rbtree.hpp>\n// #include <boost/geometry.hpp>\n// #include <boost/geometry/geometries/linestring.hpp>\n// #include <boost/geometry/geometries/polygon.hpp>\n// #include <boost/geometry/geometries/point_xy.hpp>\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// typedef mp::number<mp::cpp_dec_float<0>> cfloat;\n// typedef mp::cpp_int cint;\n\n#include<ext/pb_ds/assoc_container.hpp>\n#include<ext/pb_ds/tree_policy.hpp>\n#include <ext/pb_ds/priority_queue.hpp>\n#include<ext/pb_ds/tag_and_trait.hpp>\nusing namespace __gnu_pbds;\ntemplate<typename T=long long>using pbds=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;\ntemplate<typename T=long long>using pqueue =__gnu_pbds::priority_queue<T, less<T>,rc_binomial_heap_tag>;\ntypedef long long lint;\ntypedef long long ll;\ntypedef long double ldouble;\ntypedef vector<lint> vec;\ntypedef vector<vector<lint>> mat;\ntypedef vector<vector<vector<lint>>> mat3;\ntypedef vector<double> dvec;\ntypedef vector<vector<double>> dmat;\ntypedef vector<vector<vector<double>>> dmat3;\ntypedef vector<string> svec;\ntypedef vector<vector<string>> smat;\ntypedef vector<vector<vector<string>>> smat3;\ntypedef vector<pair<lint,lint>> pvec;\ntypedef vector<vector<pair<lint,lint>>> pmat;\ntypedef vector<vector<vector<pair<lint,lint>>>> pmat3;\n#define rep(i, n) for(lint i = 0; i < (lint)(n); i++)\n#define irep(i) for(lint i = 0;; i++)\n#define irep1(i) for(lint i = 1;; i++)\n#define irep2(i) for(lint i = 2;; i++)\n#define rrep(i, n) for(lint i = (lint)(n-1); i >-1; i--)\n#define rrepi(i,a,b) for(lint i = (lint)(b-1); i >a-1; i--)\n#define repi(i,a,b) for(lint i=lint(a);i<lint(b);i++)\n#define rep2(i,a,b,c) for(lint i=lint(a);i>lint(b);i+=c)\n#define all(x) (x).begin(),(x).end()\n//#define PI 3.141592653589793\n#define dist(x1,y1,x2,y2) (pow(pow(x2-x1,2)+pow(y2-y1,2),0.5))\n#define output(v) do{bool f=0;for(auto i:v){cout<<(f?\" \":\"\");if(i>INF/2)cout<<\"INF\";else cout<<i;f=1;}cout<<\"\\n\";}while(0)\n#define output2(v) for(auto j:v)output(j);\n#define _output(v) do{bool f=0;rep(i,v.size()){cout<<(f?\" \":\"\");if(v[i]>INF/2)cout<<\"INF\";else cout<<v[i];f=1;}cout<<\"\\n\";}while(0)\n#define _output2(v) rep(j,v.size()){_output(v[j]);}\n#define input(a,n) lint n;cin>>n;vector<lint>a(n);rep(i,n)cin>>a[i];\n#define SUM(v) accumulate(all(v),0LL)\n#define INF (1LL<<60)\n#define IINF (1<<30)\n#define EPS (1e-10)\n#define LINF 9223372036854775807\n#define MOD 100000007\n#define endl \"\\n\"\ntemplate<typename T=lint>T in(){return *istream_iterator<T>(cin);}\ninline lint gcd(lint a,lint b){return b?gcd(b,a%b):a;}\ntemplate<typename T=lint>inline T lcm(T a,T b){return a/gcd(a,b)*b;}\ntemplate<typename T=lint>inline T add(T a,T b){return a+b;}\ntemplate<typename T=lint>inline T minq(T a,T b){return min(a,b);}\ninline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}\ninline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}\nvector<lint> dx={-1,1,0,0,1,1,-1,-1};\nvector<lint> dy={0,0,-1,1,1,-1,1,-1};\n\nclass mint {\n using u64 = std::uint_fast64_t;\n public:\n u64 a;\n constexpr mint(const u64 x = 0) noexcept : a(x % MOD) {}\n constexpr u64 &value() noexcept { return a; }\n constexpr const u64 &value() const noexcept { return a; }\n constexpr mint operator+(const mint rhs) const noexcept {\n return mint(*this) += rhs;\n }\n constexpr mint operator-(const mint rhs) const noexcept {\n return mint(*this) -= rhs;\n }\n constexpr mint operator*(const mint rhs) const noexcept {\n return mint(*this) *= rhs;\n }\n constexpr mint operator/(const mint rhs) const noexcept {\n return mint(*this) /= rhs;\n }\n constexpr mint &operator+=(const mint rhs) noexcept {\n a += rhs.a;\n if (a >= MOD) {\n a -= MOD;\n }\n return *this;\n }\n constexpr mint &operator-=(const mint rhs) noexcept {\n if (a < rhs.a) {\n a += MOD;\n }\n a -= rhs.a;\n return *this;\n }\n constexpr mint &operator*=(const mint rhs) noexcept {\n a = a * rhs.a % MOD;\n return *this;\n }\n constexpr mint operator++(int n) const noexcept {\n return mint(*this) +=1;\n }\n constexpr mint operator--(int n) const noexcept {\n return mint(*this) -=1;\n }\n constexpr mint &operator/=(mint rhs) noexcept {\n u64 exp = MOD - 2;\n while (exp) {\n if (exp % 2) {\n *this *= rhs;\n }\n rhs *= rhs;\n exp /= 2;\n }\n return *this;\n }\n};\nostream& operator<<(ostream& lhs, const mint& rhs) noexcept {\n lhs << rhs.a;\n return lhs;\n}\nistream& operator>>(istream& lhs, const mint& rhs) noexcept {\n lhs >> rhs.a;\n return lhs;\n}\ninline mint pow(mint m,lint n){\n if(n==0)return 1;\n else if(n%2==0){\n mint x=pow(m,n/2);\n return x*x;\n }else{\n return m*pow(m,n-1);\n }\n}\ninline mint fact(lint a){\n return a?fact(a-1)*a:1;\n}\nclass Comb{\n public:\n vector<lint> fac,ifac;\n Comb(){\n fac.resize(300001);\n ifac.resize(300001);\n fac[0] = 1;\n ifac[0] = 1;\n rep(i,300000){\n fac[i+1] = fac[i]*(i+1) % MOD;\n ifac[i+1] = ifac[i]*mpow(i+1, MOD-2) % MOD;\n }\n }\n lint mpow(lint x, lint n){\n lint ans = 1;\n while(n != 0){\n if(n&1) ans = ans*x % MOD;\n x = x*x % MOD;\n n = n >> 1;\n }\n return ans;\n }\n lint comb(lint a, lint b){\n if(a == 0 && b == 0)return 1;\n if(a < b || a < 0)return 0;\n lint tmp = ifac[a-b]* ifac[b] % MOD;\n return tmp * fac[a] % MOD;\n }\n};\nComb c;\nmint f(lint n,lint m){\n vector<vector<mint>> dp(n+1,vector<mint>(m,0));\n dp[0][0]=0;\n dp[1][0]=1;\n repi(i,2,n+1)rep(j,m){\n dp[i][0]+=dp[i-1][j];\n if(j!=0)dp[i][j]=dp[i-1][j-1];\n }\n mint res=0;\n for(lint i=0;n-i*m>=0;i++)rep(j,m){\n res+=dp[n-i*m][j];\n }\n return res;\n}\nint main(){\n while(1){\n string s;\n cin>>s;\n if(s==\"#\")break;\n lint cnt=1;\n mint ans=1;\n rep(i,s.size()-1){\n if(s[i]==s[i+1])cnt++;\n else {\n lint m=5;\n if(s[i]=='8'||s[i]=='0')m=3;\n ans*=f(cnt,m);\n cnt=1;\n }\n }\n lint m=5;\n if(s[s.size()-1]=='8'||s[s.size()-1]=='0')m=3;\n ans*=f(cnt,m);\n cout<<ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 17964,
"score_of_the_acc": -1.1661,
"final_rank": 16
},
{
"submission_id": "aoj_1082_3911692",
"code_snippet": "#include <bits/stdc++.h>\n#define MOD (long long)(1e8 + 7)\nusing namespace std;\n\nstring s;\n\nlong long solve();\nlong long calc(long long len, long long msize);\n\nint main() {\n while(1) {\n cin >> s;\n if(s == \"#\") break;\n cout << solve() << endl;\n }\n return 0;\n}\n\nlong long solve() {\n long long ans = 1, ssize = s.size();\n for(int i = 0; i < ssize; ++i) {\n char now = s[i];\n long long cnt = 0, nowsize = 3;\n if(now != '0' && now != '8') nowsize += 2;\n while(i < ssize && s[i] == now) ++i, ++cnt;\n (ans *= calc(cnt, nowsize)) %= MOD;\n --i;\n }\n return ans;\n}\n\nlong long calc(long long len, long long msize) {\n long long ans = 0;\n vector<long long> dp;\n dp.assign(msize, 0);\n dp[len % msize] = 1;\n for(int i = 0; i < len; ++i) {\n long long sum = 0;\n for(int j = 0; j < msize; ++j) (sum += dp[j]) %= MOD;\n if((len - 1 - i) % msize == 0) (ans += sum) %= MOD;\n dp[(len - 1 - i) % msize] = sum;\n }\n return ans;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3272,
"score_of_the_acc": -0.3622,
"final_rank": 11
},
{
"submission_id": "aoj_1082_3911680",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcountll\n\n#define INF 1e16\n#define mod 100000007\n\nconst ll M=100000;\nll dp5[100001],dp3[100001];\n\nll calc(bool is5, ll len){\n ll res=0;\n if(is5){\n repl(l,1,len+1){\n if((len-l)%5==0){\n (res+=dp5[l])%=mod;\n }\n }\n }else{\n repl(l,1,len+1){\n if((len-l)%3==0){\n (res+=dp3[l])%=mod;\n }\n }\n }\n return res;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n dp5[0]=1;\n repl(i,1,M+1){\n repl(j,1,5+1){\n if(i-j>=0)(dp5[i]+=dp5[i-j])%=mod;\n }\n }\n dp3[0]=1;\n repl(i,1,M+1){\n repl(j,1,3+1){\n if(i-j>=0)(dp3[i]+=dp3[i-j])%=mod;\n }\n }\n\n while(1){\n string S;\n cin>>S;\n if(S==\"#\")break;\n ll N=S.size();\n ll res=1;\n ll i=0;\n while(i<N){\n ll j=i;\n while(j<N&&S[i]==S[j]){\n j++;\n }\n if(S[i]=='8'||S[i]=='0') (res*=calc(false,j-i))%=mod;\n else (res*=calc(true,j-i))%=mod;\n i=j;\n }\n cout<<res<<endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5016,
"score_of_the_acc": -0.0922,
"final_rank": 4
},
{
"submission_id": "aoj_1082_3911618",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <map>\n#include <set>\n#include <math.h>\nusing namespace std;\ntypedef long long int ll;\n\nll mod=1e8+7;\nll dp[100100];\nll dp1[100100];\n\nint main(){\n\tfor(int i=1;i<=6;i++){\n\t\tdp[i]=pow(2,i-1);\n\t}\n\tfor(int i=7;i<=100000;i++){\n\t\t(dp[i]+=dp[i-1]+dp[i-2]+dp[i-3]+dp[i-4]+dp[i-5]+1)%=mod;\n\t}\n\tfor(int i=1;i<=4;i++){\n\t\tdp1[i]=pow(2,i-1);\n\t}\n\tfor(int i=5;i<=100000;i++){\n\t\t(dp1[i]+=dp1[i-1]+dp1[i-2]+dp1[i-3]+1)%=mod;\n\t}\n\twhile(1){\n\t\tstring s; cin >> s;\n\t\tif(s==\"#\")break;\n\t\tint n=s.size();\n\t\tll ans=1;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tchar c=s[i];\n\t\t\tint cnt=0;\n\t\t\twhile(i<n&&s[i]==c){\n\t\t\t\ti++;\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t\ti--;\n\t\t\tif(c=='8'||c=='0')(ans*=dp1[cnt])%=mod;\n\t\t\telse (ans*=dp[cnt])%=mod;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 5040,
"score_of_the_acc": -0.2694,
"final_rank": 8
},
{
"submission_id": "aoj_1082_3535523",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\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}\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\ntemplate<ll MOD = 1000000007>\nclass ModInt {\n ll n;\n static ModInt pow(ModInt x, ll p) {\n if (p == 0) {\n return 1;\n } else if (p % 2) {\n return x * pow(x, p - 1);\n } else {\n auto t = ModInt::pow(x, p / 2);\n return t * t;\n }\n }\n ModInt reverse() const {\n return ModInt::pow(*this, MOD - 2);\n }\n\npublic:\n ModInt()\n : n(0) {}\n ModInt(ll _n)\n : n(_n % MOD) {}\n ModInt operator+=(const ModInt &m) {\n n += m.n;\n if (n >= MOD) {\n n -= MOD;\n }\n return *this;\n }\n ModInt operator-=(const ModInt &m) {\n n -= m.n;\n if (n < 0) {\n n += MOD;\n }\n return *this;\n }\n ModInt operator*=(const ModInt &m) {\n n *= m.n;\n if (n >= MOD) {\n n %= MOD;\n }\n return *this;\n }\n ModInt operator/=(const ModInt &m) {\n return n = (m.reverse() * n).n;\n }\n\n ModInt operator+=(const ll l) {\n return (*this) += ModInt(l);\n }\n ModInt operator-=(const ll l) {\n return (*this) -= ModInt(l);\n }\n ModInt operator*=(const ll l) {\n return (*this) *= ModInt(l);\n }\n ModInt operator/=(const ll l) {\n return (*this) /= ModInt(l);\n }\n ModInt operator+(const ModInt &m) {\n auto t = *this;\n return t += m;\n }\n ModInt operator-(const ModInt &m) {\n auto t = *this;\n return t -= m;\n }\n ModInt operator*(const ModInt &m) {\n auto t = *this;\n return t *= m;\n }\n ModInt operator/(const ModInt &m) {\n auto t = *this;\n return t /= m;\n }\n ModInt operator+(const ll l) {\n auto t = *this;\n return t += l;\n }\n ModInt operator-(const ll l) {\n auto t = *this;\n return t -= l;\n }\n ModInt operator*(const ll l) {\n auto t = *this;\n return t *= l;\n }\n ModInt operator/(const ll l) {\n auto t = *this;\n return t /= l;\n }\n ModInt operator=(const ll l) {\n n = l % MOD;\n if (n < 0) {\n n += MOD;\n }\n return *this;\n }\n friend ostream &operator<<(ostream &out, const ModInt &m) {\n out << m.n;\n return out;\n }\n friend istream &operator>>(istream &in, ModInt &m) {\n ll l;\n in >> l;\n m = l;\n return in;\n }\n};\n\nusing mint = ModInt<100000007>;\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int size = 100010;\n vector<mint> dp1(size + 1, 1), dp2(size + 1, 1);\n REP(i, 1, size + 1) {\n REP(j, 1, 6) {\n if (i - j > 0) {\n dp1[i] += dp1[i - j];\n }\n }\n REP(j, 1, 4) {\n if (i - j > 0) {\n dp2[i] += dp2[i - j];\n }\n }\n }\n\n string s;\n while (cin >> s, s != \"#\") {\n mint ans = 1;\n s += \"#\";\n int prev = 0;\n REP(i, 1, s.size()) {\n if (s[i - 1] != s[i]) {\n if (s[prev] == '8' || s[prev] == '0') {\n ans *= dp2[i - prev];\n } else {\n ans *= dp1[i - prev];\n }\n prev = i;\n }\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4760,
"score_of_the_acc": -0.0843,
"final_rank": 3
},
{
"submission_id": "aoj_1082_3359520",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nconst ll mod = 100000007;\n\nconst int N = 100010;\nll x[N], y[N];\n\nint main(){\n x[0] = 1;\n rep(i,N){\n for(int j=1; j<=5; ++j)if(i+j<N) (x[i+j] += x[i]) %= mod;\n if(i-5>0) (x[i] += x[i-5]) %= mod;\n }\n y[0] = 1;\n rep(i,N){\n for(int j=1; j<=3; ++j)if(i+j<N) (y[i+j] += y[i]) %= mod;\n if(i-3>0) (y[i] += y[i-3]) %= mod;\n }\n\n string s;\n while(cin >>s,(s!=\"#\")){\n int n = s.size();\n\n ll ans = 1;\n int i = 0;\n while(i<n){\n int nx = i;\n while(nx<n && s[nx]==s[i]) ++nx;\n\n int w = nx-i;\n if(s[i]=='8' || s[i]=='0') (ans *= y[w]) %= mod;\n else (ans *= x[w]) %= mod;\n\n i = nx;\n }\n\n cout << ans << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 4896,
"score_of_the_acc": -0.2944,
"final_rank": 9
},
{
"submission_id": "aoj_1082_3082936",
"code_snippet": "#define _USE_MATH_DEFINES\n\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <map>\n#include <list>\n\nusing namespace std;\n\ntypedef pair<long long int, long long int> P;\n\nlong long int INF = 1e18;\nlong long int MOD = 1e8 + 7;\n\nint main(){\n\t\n\twhile(true){\n\t\tstring str;\n\t\tcin >> str;\n\t\tchar pre = str[0];\n\t\t\n\t\tif(pre == '#'){\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tstr += \" \";\n\t\t\n\t\tint cnt = 0;\n\t\t\n\t\tvector<P> v;\n\t\t\n\t\tfor(int i = 0; i < str.size(); i++){\n\t\t\tif(str[i] == pre){\n\t\t\t\tcnt += 1;\n\t\t\t}else{\n\t\t\t\tif(pre == '8' || pre == '0'){\n\t\t\t\t\tv.push_back(make_pair(cnt, 3));\n\t\t\t\t}else{\n\t\t\t\t\tv.push_back(make_pair(cnt, 5));\n\t\t\t\t}\n\t\t\t\tcnt = 1;\n\t\t\t}\n\t\t\tpre = str[i];\n\t\t}\n\t\t\n\t\tlong long int ans = 1;\n\t\t\n\t\tfor(int i = 0; i < v.size(); i++){\n\t\t\tint num = v[i].first;\n\t\t\tint tp = v[i].second;\n\t\t\tlong long int S = 0;\n\t\t\tlong long int DP[5] = {1};\n\t\t\t\n\t\t\tfor(int j = 1; j <= num + 1; j++){\n\t\t\t\tif((num - j) % tp == 0){\n\t\t\t\t\tfor(int k = 0; k < tp; k++){\n\t\t\t\t\t\tS += DP[k];\n\t\t\t\t\t\tS %= MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tlong long int DP2[5] = {};\n\t\t\t\tfor(int k = 0; k < tp; k++){\n\t\t\t\t\tDP2[0] += DP[k];\n\t\t\t\t\tDP2[0] %= MOD;\n\t\t\t\t}\n\t\t\t\tfor(int k = 1; k < tp; k++){\n\t\t\t\t\tDP2[k] = DP[k - 1];\n\t\t\t\t\tDP2[k] %= MOD;\n\t\t\t\t}\n\t\t\t\tswap(DP, DP2);\n\t\t\t}\n\t\t\tans *= S;\n\t\t\tans %= MOD;\n\t\t}\n\t\t\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 350,
"memory_kb": 3288,
"score_of_the_acc": -1.0392,
"final_rank": 15
},
{
"submission_id": "aoj_1082_3082932",
"code_snippet": "#define _USE_MATH_DEFINES\n\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <map>\n#include <list>\n\nusing namespace std;\n\ntypedef pair<long long int, long long int> P;\n\nlong long int INF = 1e18;\nlong long int MOD = 1e8 + 7;\n\nint main(){\n\t\n\twhile(true){\n\t\tstring str;\n\t\tcin >> str;\n\t\tchar pre = str[0];\n\t\t\n\t\tif(pre == '#'){\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tstr += \" \";\n\t\t\n\t\tint cnt = 0;\n\t\t\n\t\tvector<P> v;\n\t\t\n\t\tfor(int i = 0; i < str.size(); i++){\n\t\t\tif(str[i] == pre){\n\t\t\t\tcnt += 1;\n\t\t\t}else{\n\t\t\t\tif(pre == '8' || pre == '0'){\n\t\t\t\t\tv.push_back(make_pair(cnt, 3));\n\t\t\t\t}else{\n\t\t\t\t\tv.push_back(make_pair(cnt, 5));\n\t\t\t\t}\n\t\t\t\tcnt = 1;\n\t\t\t}\n\t\t\tpre = str[i];\n\t\t}\n\t\t\n\t\tlong long int ans = 1;\n\t\t\n\t\tfor(int i = 0; i < v.size(); i++){\n\t\t\tint num = v[i].first;\n\t\t\tint tp = v[i].second;\n\t\t\tlong long int S = 0;\n\t\t\tlong long int DP[5] = {1};\n\t\t\t\n\t\t\tfor(int j = 1; j <= num + 1; j++){\n\t\t\t\tif((num - j) % tp == 0){\n\t\t\t\t\tfor(int k = 0; k < tp; k++){\n\t\t\t\t\t\tS += DP[k];\n\t\t\t\t\t\tS %= MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tlong long int DP2[5] = {};\n\t\t\t\tfor(int k = 0; k < tp; k++){\n\t\t\t\t\tDP2[0] += DP[k];\n\t\t\t\t}\n\t\t\t\tfor(int k = 1; k < tp; k++){\n\t\t\t\t\tDP2[k] = DP[k - 1];\n\t\t\t\t}\n\t\t\t\tswap(DP, DP2);\n\t\t\t}\n\t\t\tans *= S;\n\t\t\tans %= MOD;\n\t\t}\n\t\t\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 0.3333333333333333,
"time_ms": 120,
"memory_kb": 3316,
"score_of_the_acc": -0.3636,
"final_rank": 20
},
{
"submission_id": "aoj_1082_2635603",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <math.h>\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\n#define NUM 100000007\n\nll dp_5[100001],dp_3[100001];\nchar buf[100001];\n\n\nvoid func(){\n\n\tll ans = 1;\n\tint left = 0,right;\n\n\twhile(buf[left] != '\\0'){\n\t\tfor(right = left; buf[right] != '\\0' && buf[right] == buf[left]; right++);\n\t\tright--;\n\n\t\tif(buf[left] == '8' || buf[left] == '0'){\n\t\t\tans *= dp_3[right-left+1];\n\t\t\tans %= NUM;\n\t\t}else{\n\t\t\tans *= dp_5[right-left+1];\n\t\t\tans %= NUM;\n\t\t}\n\t\tleft = right+1;\n\t}\n\n\tprintf(\"%lld\\n\",ans%NUM);\n}\n\nint main(){\n\n\tfor(int length = 1; length <= 6; length++){\n\t\tdp_5[length] = pow(2,length-1);\n\t}\n\tfor(int length = 7; length <= 100000; length++){\n\t\tdp_5[length] = (1+dp_5[length-1]+dp_5[length-2]+dp_5[length-3]+dp_5[length-4]+dp_5[length-5])%NUM;\n\t}\n\n\tfor(int length = 1; length <= 4; length++){\n\t\tdp_3[length] = pow(2,length-1);\n\t}\n\tfor(int length = 5; length <= 100000; length++){\n\t\tdp_3[length] = (1+dp_3[length-1]+dp_3[length-2]+dp_3[length-3])%NUM;\n\t}\n\n\twhile(true){\n\t\tscanf(\"%s\",buf);\n\t\tif(buf[0] == '#')break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5048,
"score_of_the_acc": -0.0932,
"final_rank": 5
},
{
"submission_id": "aoj_1082_2054889",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n\n\nconst int mod = 100000007;\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\nint main() {\n\tvector<vector<Mod>>dp5(2e5, vector<Mod>(5));\n\tdp5[1][0] = 1;\n\tfor (int i = 1; i < 1e5 + 3; ++i) {\n\t\tfor (int j = 0; j < 5; ++j) {\n\t\t\tdp5[i + 1][0] += dp5[i][j];\n\t\t\tif (j != 4) {\n\t\t\t\tdp5[i + 1][j + 1] += dp5[i][j];\n\t\t\t}\n\t\t}\n\t}\n\tvector<vector<Mod>>dp3(2e5, vector<Mod>(3));\n\tdp3[1][0] = 1;\n\tfor (int i = 1; i < 1e5 + 3; ++i) {\n\t\tfor (int j = 0; j < 3; ++j) {\n\t\t\tdp3[i + 1][0] += dp3[i][j];\n\t\t\tif (j != 2) {\n\t\t\t\tdp3[i + 1][j + 1] += dp3[i][j];\n\t\t\t}\n\t\t}\n\t}\n\tvector<Mod>sums3(2e5), sums5(2e5);\n\tsums3[0] = 0;\n\tsums5[0] = 0;\n\tfor (int i = 0; i < 1e5 + 3; ++i) {\n\t\tfor (int j = 0; j < 3; ++j) {\n\t\t\tsums3[i] += dp3[i][j];\n\t\t}\n\t\tfor (int j = 0; j < 5; ++j) {\n\t\t\tsums5[i] += dp5[i][j];\n\t\t}\n\t\tif (i >= 3)sums3[i + 1] += sums3[i - 2];\n\t\tif (i >= 5)sums5[i + 1] += sums5[i - 4];\n\t}\n\twhile (1) {\n\t\tstring st; cin >> st;\n\t\tif (st == \"#\")break;\n\t\telse {\n\t\t\tvector<pair<int,int>>nums;\n\t\t\tchar pre = ' ';\n\t\t\tint num = 0;\n\t\t\tfor (int i = 0; i < st.size(); ++i) {\n\t\t\t\tchar c(st[i]);\n\t\t\t\tif (!num || (pre == c)) {\n\t\t\t\t\tnum++;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\t\n\t\t\t\t\tnums.emplace_back(pre,num);\n\t\t\t\t\tnum = 1;\n\t\t\t\t}\n\t\t\t\tpre = c;\n\t\t\t}\n\t\t\tnums.emplace_back(pre,num);\n\t\t\tMod ans = 1;\n\t\t\tfor (auto n : nums) {\n\t\t\t\tif (n.first == '0' || n.first == '8') {\n\t\t\t\t\tans *= sums3[n.second];\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tans *= sums5[n.second];\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << ans << endl;\n\t\t\t\n\t\t}\n\t}\n\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 34592,
"score_of_the_acc": -1.2647,
"final_rank": 17
},
{
"submission_id": "aoj_1082_1459948",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P > PP;\n \nint tx[] = {0,1,0,-1};\nint ty[] = {-1,0,1,0};\n \nstatic const double EPS = 1e-8;\n\nll dp[6][100001]; //dp[pos][buffered char][hidden or not]\n\nconst static ll MOD = 100000007;\n\nint main(){\n string text;\n\n memset(dp,0,sizeof(dp));\n dp[3][0] = 0;\n dp[3][1] = 1;\n dp[3][2] = 2;\n\n dp[5][0] = 0;\n dp[5][1] = 1;\n dp[5][2] = 2;\n dp[5][3] = 4;\n dp[5][4] = 8;\n\n for(int text_i = 0; text_i < 100000; text_i++){\n dp[3][text_i + 3] += 1;\n for(int offset = 0; offset <= 2; offset++){\n dp[3][text_i + 3] += dp[3][text_i + offset];\n dp[3][text_i + 3] %= MOD;\n }\n\n dp[5][text_i + 5] += 1;\n for(int offset = 0; offset <= 4; offset++){\n dp[5][text_i + 5] += dp[5][text_i + offset];\n dp[5][text_i + 5] %= MOD;\n }\n }\n\n while(cin >> text){\n if(text == \"#\") break;\n\n ll res = 1;\n int length = 1;\n for(int text_i = 0; text_i + 1 < text.size(); text_i++){\n if(text[text_i] == text[text_i + 1]){\n length++;\n }\n else{\n if(text[text_i] == '8' || text[text_i] == '0'){\n res = (res * dp[3][length]) % MOD;\n res %= MOD;\n }\n else{\n res = (res * dp[5][length]) % MOD;\n res %= MOD;\n }\n length = 1;\n }\n }\n\n if(length > 0){\n if(text[text.size() - 1] == '8' || text[text.size() - 1] == '0'){\n res = (res * dp[3][length]) % MOD;\n res %= MOD;\n }\n else{\n res = (res * dp[5][length]) % MOD;\n res %= MOD;\n }\n }\n printf(\"%lld\\n\",res % MOD);\n }\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 6024,
"score_of_the_acc": -0.3878,
"final_rank": 12
},
{
"submission_id": "aoj_1082_1087815",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nlong long mod=100000007;\nchar str[110000];\nlong long dp1[110000];\nlong long dp2[110000];\nint main(){\n\tdp1[0]=dp2[0]=1;\n\tfor(int i=0;i<101000;i++){\n\t\tfor(int j=1;j<=5;j++)dp1[i+j]=(dp1[i+j]+dp1[i])%mod;\n\t\tfor(int j=1;j<=3;j++)dp2[i+j]=(dp2[i+j]+dp2[i])%mod;\n\t}\n\tfor(int i=4;i<101000;i++){\n\t\tif(i-5>0)dp1[i]=(dp1[i]+dp1[i-5])%mod;\n\t\tdp2[i]=(dp2[i]+dp2[i-3])%mod;\n\t}\n\twhile(1){\n\t\tscanf(\"%s\",str);\n\t\tif(str[0]=='#')return 0;\n\t\tlong long ret=1;\n\t\tint val=0;\n\t\tint now=str[0]-'0';\n\t\tfor(int i=0;str[i];i++){\n\t\t\tif(now!=str[i]-'0'){\n\t\t\t\tif(now==8||now==0)ret=ret*dp2[val]%mod;\n\t\t\t\telse ret=ret*dp1[val]%mod;\n\t\t\t\tnow=str[i]-'0';\n\t\t\t\tval=1;\n\t\t\t}else val++;\n\t\t}\n\t\tif(now==8||now==0)ret=ret*dp2[val]%mod;\n\t\telse ret=ret*dp1[val]%mod;\n\t\tprintf(\"%lld\\n\",ret);\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 2644,
"score_of_the_acc": -0.0782,
"final_rank": 2
},
{
"submission_id": "aoj_1082_1025034",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <algorithm>\n\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 MP make_pair\n#define PB push_back\n#define F first\n#define S second\n#define INF 1 << 30\n#define EPS 1e-10\n#define M 100000007\n#define N 100000\n\ntypedef pair<int, int> pi;\ntypedef pair<int, pi> pii;\ntypedef vector<int> vi;\ntypedef queue<int> qi;\ntypedef long long ll;\n\nchar str[N+1];\nint dp1[N+1], dp2[N+1];\n\nint main(){\n dp1[1] = 1; dp1[2] = 2; dp1[3] = 4; dp1[4] = 8; dp1[5] = 16;\n REP(i, 6, N+1){\n dp1[i] = 1;\n REP(j, 1, 6) dp1[i] = (dp1[i] + dp1[i-j])%M;\n }\n\n dp2[1] = 1; dp2[2] = 2; dp2[3] = 4;\n REP(i, 4, N+2){\n dp2[i] = 1;\n REP(j, 1, 4) dp2[i] = (dp2[i] + dp2[i-j])%M;\n }\n\n while(scanf(\"%s\", str) && str[0] != '#'){\n int c = 0;\n ll res = 1;\n char now = str[0];\n rep(i, strlen(str)){\n if(str[i] == now) c++;\n else{\n\t//\tprintf(\"%d\\n\", c);\n\tif(now == '1' || now == '2' || now == '3' || now == '4' || now == '5' || now == '6' || \n\t now == '7' || now == '9') res = (res * dp1[c])%M;\n\telse res = (res * dp2[c])%M;\n\tc = 1;\n\tnow = str[i];\n }\n }\n // printf(\"%d\\n\", c);\n if(now == '8' || now == '0') res = (res * dp2[c])%M;\n else res = (res * dp1[c])%M;\n\n printf(\"%lld\\n\", res);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2012,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1082_940217",
"code_snippet": "#include <iostream>\n#include <string.h>\n#include <string>\n\nusing namespace std;\n\n#define MOD 100000007\n\nvoid solve()\n{\n\tint dp1[100001], dp2[100001];\n\tmemset(dp1,0,sizeof(dp1));\n\tmemset(dp2,0,sizeof(dp2));\n\tdp1[1] = 1; dp1[2] = 2; dp1[3] = 4; dp1[4] = 8; dp1[5] = 16;\n\tdp2[1] = 1; dp2[2] = 2; dp2[3] = 4;\n\t\n\tfor(int i = 6; i < 100001; ++i)\n\t{\n\t\tdp1[i] = (1 + dp1[i - 1] % MOD + dp1[i - 2] % MOD + dp1[i - 3] % MOD + dp1[i - 4] % MOD + dp1[i - 5] % MOD) % MOD;\n\t}\n\tfor(int i = 4; i < 100001; ++i)\n\t{\n\t\tdp2[i] = (1 + dp2[i - 1] % MOD + dp2[i - 2] % MOD + dp2[i - 3] % MOD) % MOD;\n\t}\n\t\n\tstring str;\n\twhile(cin >> str)\n\t{\n\t\tif(str == \"#\")\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\tlong long ret = 1;\n\t\tchar c;\n\t\tc = str[0];\n\t\tint num;\n\t\tnum = 1;\n\t\tif(str.size() == 1)\n\t\t{\n\t\t\tcout << 1 << endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor(int i = 1; i < str.size(); ++i)\n\t\t\t{\n\t\t\t\tif(str[i] == c)\n\t\t\t\t{\n\t\t\t\t\t++num;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif(c == '0' || c == '8')\n\t\t\t\t\t{\n\t\t\t\t\t\tret = ((long long)ret * dp2[num]) % MOD;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tret = ((long long)ret * dp1[num]) % MOD;\n\t\t\t\t\t}\n\t\t\t\t\tc = str[i];\n\t\t\t\t\tnum = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(c == '0' || c == '8')\n\t\t\t{\n\t\t\t\tret = ((long long)ret * dp2[num]) % MOD;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tret = ((long long)ret * dp1[num]) % MOD;\n\t\t\t}\n\t\t\tcout << ret << endl;\n\t\t}\n\t}\n}\n\nint main(void)\n{\n\tsolve();\n\treturn(0);\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 2112,
"score_of_the_acc": -0.2678,
"final_rank": 7
},
{
"submission_id": "aoj_1082_825592",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cmath>\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 MOD (100000007LL)\n\nusing namespace std;\n\ntypedef unsigned long long ull;\ntypedef pair<int,int> ii;\n\nstring message;\n\ntypedef long long ll;\n/*\nll my_pow(ll a,ll e)\n{\n return !e?1:\n (e%2?(a*my_pow(a,e-1))%MOD:(my_pow(a*a,e/2))%MOD);\n}\n\nvoid calc(ull &v,char c,int pw)\n{\n if(pw == 0)return;\n if(c == '8' || c == '0')\n {\n if(pw == 3)v = ((v * 2LL)%MOD - 1 ) % MOD;\n else if(pw > 3)v = ((v * 2LL)%MOD - my_pow(2LL,(pw-4))) % MOD;\n else v = (v * 2LL) % MOD;\n }\n else\n {\n if(pw > 5)v = ((v * 2LL)%MOD - my_pow(2LL,pw-6) ) % MOD;\n else v = (v * 2LL) % MOD;\n }\n}\nvoid compute()\n{\n ull ans = 1;\n ull value = 1;\n char cur = message[0];\n int seq = -1;\n rep(i,message.size())\n {\n seq++;\n calc(value,message[i],seq);\n if((i+1 < message.size() && cur != message[i+1]) || i == message.size()-1)\n\t{\n\t ans = ( ans * value ) % MOD;\n\t value = 1;\n\t seq = -1; \n\t if(i != message.size()-1)cur = message[i+1];\n\t continue;\n\t}\n }\n cout << ans << endl;\n}\n*/\n\nvoid compute()\n{\n vector<ii> vec;\n char cur = message[0];\n int cnt = 0,max_length = 0;\n rep(i,message.size())\n {\n cnt++;\n if((i+1<message.size() && cur != message[i+1]) || i == message.size()-1)\n\t{\n\t vec.push_back(ii(cur-'0',cnt));\n\t max_length = max(max_length,cnt);\n\t cnt = 0;\n\t cur = message[i+1];\n\t}\n }\n\n max_length++;\n ull dp[2][max_length];//dp[0] : 3, dp[1] : 5\n rep(i,3)dp[0][i] = (ull)pow(2.0,i);\n rep(i,6)dp[1][i] = (ull)pow(2.0,i);\n\n REP(i,3,max_length)dp[0][i] = (((dp[0][i-1] + dp[0][i-2]) % MOD + dp[0][i-3]) % MOD + 1ULL) % MOD;\n REP(i,6,max_length)dp[1][i] = (((((dp[1][i-1] + dp[1][i-2])%MOD + dp[1][i-3])%MOD + dp[1][i-4])%MOD + dp[1][i-5])%MOD + 1ULL) % MOD;\n\n ull ans = 1;\n rep(i,vec.size())\n {\n int type = ((vec[i].first == 8 || vec[i].first == 0)?0:1);\n ans = ( ans * dp[type][vec[i].second-1] ) % MOD;\n }\n\n cout << ans << endl;\n\n}\n\nint main()\n{\n while(cin >> message,message != \"#\")\n {\n compute();\n\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 2880,
"score_of_the_acc": -0.4972,
"final_rank": 14
},
{
"submission_id": "aoj_1082_825583",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cmath>\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 MOD (100000007LL)\n\nusing namespace std;\n\ntypedef unsigned long long ull;\ntypedef pair<int,int> ii;\n\nstring message;\n\ntypedef long long ll;\n/*\nll my_pow(ll a,ll e)\n{\n return !e?1:\n (e%2?(a*my_pow(a,e-1))%MOD:(my_pow(a*a,e/2))%MOD);\n}\n\nvoid calc(ull &v,char c,int pw)\n{\n if(pw == 0)return;\n if(c == '8' || c == '0')\n {\n if(pw == 3)v = ((v * 2LL)%MOD - 1 ) % MOD;\n else if(pw > 3)v = ((v * 2LL)%MOD - my_pow(2LL,(pw-4))) % MOD;\n else v = (v * 2LL) % MOD;\n }\n else\n {\n if(pw > 5)v = ((v * 2LL)%MOD - my_pow(2LL,pw-6) ) % MOD;\n else v = (v * 2LL) % MOD;\n }\n}\nvoid compute()\n{\n ull ans = 1;\n ull value = 1;\n char cur = message[0];\n int seq = -1;\n rep(i,message.size())\n {\n seq++;\n calc(value,message[i],seq);\n if((i+1 < message.size() && cur != message[i+1]) || i == message.size()-1)\n\t{\n\t ans = ( ans * value ) % MOD;\n\t value = 1;\n\t seq = -1; \n\t if(i != message.size()-1)cur = message[i+1];\n\t continue;\n\t}\n }\n cout << ans << endl;\n}\n*/\n\nvoid compute()\n{\n vector<ii> vec;\n char cur = message[0];\n int cnt = 0,max_length = 0;\n rep(i,message.size())\n {\n cnt++;\n if((i+1<message.size() && cur != message[i+1]) || i == message.size()-1)\n\t{\n\t vec.push_back(ii(cur-'0',cnt));\n\t max_length = max(max_length,cnt);\n\t cnt = 0;\n\t cur = message[i+1];\n\t}\n }\n\n max_length++;\n ull dp[2][max_length];//dp[0] : 3, dp[1] : 5\n rep(i,3)dp[0][i] = (ull)pow(2.0,i);\n rep(i,6)dp[1][i] = (ull)pow(2.0,i);\n\n REP(i,3,max_length)dp[0][i] = dp[0][i-1] + dp[0][i-2] + dp[0][i-3] + 1;\n REP(i,6,max_length)dp[1][i] = dp[1][i-1] + dp[1][i-2] + dp[1][i-3] + dp[1][i-4] + dp[1][i-5] + 1;\n\n ull ans = 1;\n rep(i,vec.size())\n {\n int type = ((vec[i].first == 8 || vec[i].first == 0)?0:1);\n ans = ( ans * dp[type][vec[i].second-1] ) % MOD;\n }\n\n cout << ans << endl;\n\n}\n\nint main()\n{\n while(cin >> message,message != \"#\")\n {\n compute();\n\n }\n return 0;\n}",
"accuracy": 0.3333333333333333,
"time_ms": 100,
"memory_kb": 2876,
"score_of_the_acc": -0.2912,
"final_rank": 19
},
{
"submission_id": "aoj_1082_603882",
"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 = 100000007;\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\nconst int MAX = 100000;\nvoid fill_dp(int dp[MAX + 1], int len){\n int dp_[MAX + 1][6] = {};\n dp_[1][0] = 1;\n for(int i = 1; i < MAX; i++){\n for(int j = 0; j < len; j++){\n dp_[i + 1][0] = (dp_[i + 1][0] + dp_[i][j]) % MOD;\n dp_[i + 1][j + 1] = (dp_[i + 1][j + 1] + dp_[i][j]) % MOD;\n }\n }\n for(int i = 1; i <= MAX; i++){\n for(int j = 0; j < len; j++){\n dp[i] = (dp[i] + dp_[i][j]) % MOD;\n }\n }\n for(int i = len; i <= MAX; i++){\n dp[i] = (dp[i] + dp[i - len]) % MOD;\n }\n}\n\nint main(){\n int dp3[MAX + 1] = {};\n int dp5[MAX + 1] = {};\n fill_dp(dp3, 3);\n fill_dp(dp5, 5);\n string s;\n while(cin >> s && s != \"#\"){\n int N = s.size();\n s += \"#\";\n int cur = 1;\n int ans = 1;\n REP(i, N){\n if(s[i] != s[i + 1]){\n if(s[i] == '8' || s[i] == '0'){\n ans = ((ll)ans * dp3[cur]) % MOD;\n }else{\n ans = ((ll)ans * dp5[cur]) % MOD;\n }\n cur = 1;\n }else{\n cur ++;\n }\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 4452,
"score_of_the_acc": -0.3984,
"final_rank": 13
},
{
"submission_id": "aoj_1082_561091",
"code_snippet": "#include<stdio.h>\n#include<iostream>\n#include<string.h>\n\nlong long int memo5[100001][6];\nlong long int memo3[100001][4];\nlong long int perm5[100001],perm3[100001];\nlong long int mod=100000007;\n\n\nint main(){\n\tmemset(memo5,0,sizeof(memo5));\n\tmemset(memo3,0,sizeof(memo3));\n\tmemo5[1][1]=1;\n\tmemo3[1][1]=1;\n\tperm5[1]=perm3[1]=1;\n\tfor(int n=2;n<=100000;n++){\n\t\tint i=n-1;\n\t\tmemo5[n][1]=(memo5[i][1]+memo5[i][2]+memo5[i][3]+memo5[i][4]+memo5[i][5]+(n%5==1))%mod;\n\t\tmemo5[n][2]=memo5[i][1];\n\t\tmemo5[n][3]=memo5[i][2];\n\t\tmemo5[n][4]=memo5[i][3];\n\t\tmemo5[n][5]=memo5[i][4];\n\t\tperm5[n]=(memo5[n][1]+memo5[n][2]+memo5[n][3]+memo5[n][4]+memo5[n][5])%mod;\n\t\t\n\t\tmemo3[n][1]=(memo3[i][1]+memo3[i][2]+memo3[i][3]+(n%3==1))%mod;\n\t\tmemo3[n][2]=memo3[i][1];\n\t\tmemo3[n][3]=memo3[i][2];\n\t\tperm3[n]=(memo3[n][1]+memo3[n][2]+memo3[n][3])%mod;\n\t}\n\t\n\tchar text[100001];\n\twhile(1){\n\t\tscanf(\"%s\",text);\n\t\tif(text[0]=='#')break;\n\t\tint count=0;\n\t\tchar c=text[0];\n\t\tlong long int ans=1;\n\t\tfor(int i=0;i<strlen(text)+1;i++){\n\t\t\tif(text[i]==c){\n\t\t\t\tcount++;\n\t\t\t}else{\n\t\t\t\tif(c=='8'||c=='0')ans=(ans*perm3[count])%mod;\n\t\t\t\telse ans=(ans*perm5[count])%mod;\n\t\t\t\tc=text[i];\n\t\t\t\tcount=1;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tstd::cout<<ans<<\"\\n\";\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 10632,
"score_of_the_acc": -0.2646,
"final_rank": 6
},
{
"submission_id": "aoj_1082_561086",
"code_snippet": "#include<stdio.h>\n#include<iostream>\n#include<string.h>\n\nlong long int memo5[100001][6];\nlong long int memo3[100001][4];\nlong long int perm5[100001],perm3[100001];\nlong long int mod=100000007;\n\n\nint main(){\n\tmemset(memo5,0,sizeof(memo5));\n\tmemset(memo3,0,sizeof(memo3));\n\tmemo5[1][1]=1;\n\tmemo3[1][1]=1;\n\tperm5[1]=perm3[1]=1;\n\tfor(int n=2;n<=100000;n++){\n\t\tint i=n-1;\n\t\tmemo5[n][1]=(memo5[i][1]+memo5[i][2]+memo5[i][3]+memo5[i][4]+memo5[i][5]+(n%5==1))%mod;\n\t\tmemo5[n][2]=memo5[i][1];\n\t\tmemo5[n][3]=memo5[i][2];\n\t\tmemo5[n][4]=memo5[i][3];\n\t\tmemo5[n][5]=memo5[i][4];\n\t\tperm5[n]=(memo5[n][1]+memo5[n][2]+memo5[n][3]+memo5[n][4]+memo5[n][5])%mod;\n\t\t\n\t\tmemo3[n][1]=memo3[i][1]+memo3[i][2]+memo3[i][3]+(n%3==1);\n\t\tmemo3[n][2]=memo3[i][1];\n\t\tmemo3[n][3]=memo3[i][2];\n\t\tperm3[n]=(memo3[n][1]+memo3[n][2]+memo3[n][3])%mod;\n\t}\n\t\n\tchar text[100001];\n\twhile(1){\n\t\tscanf(\"%s\",text);\n\t\tif(text[0]=='#')break;\n\t\tint count=0;\n\t\tchar c=text[0];\n\t\tlong long int ans=1;\n\t\tfor(int i=0;i<strlen(text)+1;i++){\n\t\t\tif(text[i]==c){\n\t\t\t\tcount++;\n\t\t\t}else{\n\t\t\t\tif(c=='8'||c=='0')ans=(ans*perm3[count])%mod;\n\t\t\t\telse ans=(ans*perm5[count])%mod;\n\t\t\t\tc=text[i];\n\t\t\t\tcount=1;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tstd::cout<<ans<<\"\\n\";\n\t}\n}",
"accuracy": 0.3333333333333333,
"time_ms": 10,
"memory_kb": 10632,
"score_of_the_acc": -0.2646,
"final_rank": 18
},
{
"submission_id": "aoj_1082_513378",
"code_snippet": "//34\n#include<iostream>\n\nusing namespace std;\n\nconst int M=100000007;\n\nint main(){\n int nnl[2][100001]={{}};\n int nlp[2][100001]={{}};\n for(int i=0;i<2;i++){\n int s=3+i*2;\n nnl[i][0]=nlp[i][0]=1;\n for(int j=1;j<=100000;j++){\n for(int k=1;k<=s;k++){\n\tif(j-k<0)break;\n\tnnl[i][j]=(nnl[i][j]+nnl[i][j-k])%M;\n }\n nlp[i][j]=(nnl[i][j]+((j-s<1)?0:nlp[i][j-s]))%M;\n }\n }\n for(char c;cin>>c,c!='#';){\n char p=0;\n int cc=0;\n long long a=1;\n for(;;cin.get(c)){\n if(c==p){\n\tcc++;\n }else{\n\ta=(a*nlp[p!='8'&&p!='0'][cc])%M;\n\tp=c;\n\tcc=1;\n }\n if(c=='\\n')break;\n }\n cout<<a<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 2712,
"score_of_the_acc": -0.3156,
"final_rank": 10
}
] |
aoj_1084_cpp
|
Problem A: K Cards
ある日、先生は次のようなゲームを思いついた。
ゲームは 1 から 10 までの数がひとつ書かれたカードを n 枚使用し、以下のように進む。
先生が n 枚のカードを数が見えるようにして横一列に黒板に貼り付け、ある整数 k (k ≥ 1) を生徒に宣言する。横一列に並べられた n 枚のカードについて、連続した k 枚のカードの積の最大値を C
k
とする。また、先生が並べた時点での C
k
を C
k
' とおく。
生徒は 1. で貼られたカードの列を見て C
k
を大きくすることを考える。ある 2 枚を入れ替えることで C
k
をより大きくすることができた場合、生徒の成績は C
k
- C
k
' 点上がる。誰かが成績点を得たらゲームを終了する。
あなたの仕事は先生が並べたカードの列を入力し、生徒が得られる最大の成績点を出力するプログラムを書くことである。ただし、そこからどの 2 枚を選んで交換してもC
k
を下げることしかできない (C
k
- C
k
' < 0) 場合、文字列 "NO GAME" (引用符を含まない)を出力せよ。
先生が並べたカードが7, 2, 3, 5の場合。このとき 7 と 3 を交換することで生徒は最大で 35 - 15 = 20 成績点を得る。
Input
入力は複数のテストケースからなる。ひとつのテストケースは以下の形式に従う。
n k
c
1
c
2
c
3
…
c
n
n は先生が並べるカードの枚数、k は宣言する整数である。
また c
i
(1 ≤ i ≤ n) はカードに書かれた数を示す。また、この順で先生が横に黒板に貼り付けるとする。入力の終わりは、ふたつの0が一文字の空白で区切られる一行で示される。
Constraints
入力はすべて整数
2 ≤n ≤ 100
1 ≤k ≤ 5
k ≤ n
1 ≤ c
i
≤ 10 (1 ≤ i ≤ n)
テストケースの数は 100 を超えない。
Output
生徒が得られる成績点の最大値あるいは文字列 "NO GAME" (引用符を含まない)を各テストケースに付き 1 行で出力せよ。
Sample Input
4 2
2
3
7
5
0 0
Sample Output
0
Hint
サンプルにおいて C
2
' = 35 であり、ここからどの 2 枚を並び替えても C
2
の最大値は 35 より大きくならない。したがって生徒が得られる成績点は最大 0 点である。
|
[
{
"submission_id": "aoj_1084_10486236",
"code_snippet": "#include \"bits/stdc++.h\"\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\n#include <ext/pb_ds/tag_and_trait.hpp>\nusing namespace __gnu_pbds;\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\ntemplate <typename T>\nusing ordered_set = tree<T, null_type, std::less<T>, rb_tree_tag, tree_order_statistics_node_update>;\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/* vector用 */\ntemplate <class T>\nstruct std::hash<std::vector<T>>\n{\n size_t operator()(const std::vector<T> &keyval) const noexcept\n {\n size_t s = 0;\n for (auto &&v : keyval)\n s = HashCombine(s, v);\n return s;\n }\n};\n/* tuple用 */\ntemplate <int N>\nstruct HashTupleCore\n{\n template <class Tuple>\n size_t operator()(const Tuple &keyval) const noexcept\n {\n size_t s = HashTupleCore<N - 1>()(keyval);\n return HashCombine(s, std::get<N - 1>(keyval));\n }\n};\ntemplate <>\nstruct HashTupleCore<0>\n{\n template <class Tuple>\n size_t operator()(const Tuple &keyval) const noexcept { return 0; }\n};\ntemplate <class... Args>\nstruct std::hash<std::tuple<Args...>>\n{\n size_t operator()(const tuple<Args...> &keyval) const noexcept\n {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n////////////////////////////////////////////\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while (true)\n {\n ll n, K;\n cin >> n >> K;\n if (n == 0)\n {\n break;\n }\n vector<ll> c(n);\n rep(i, 0, n)\n {\n cin >> c[i];\n }\n ll now = -inf;\n rep(i, 0, n - K + 1)\n {\n ll sub = 1;\n rep(j, 0, K)\n {\n sub *= c[i + j];\n }\n chmax(now, sub);\n }\n ll ans = -inf;\n rep(i, 0, n)\n {\n rep(j, i + 1, n)\n {\n swap(c[i], c[j]);\n ll nxt = -inf;\n rep(k, 0, n - K + 1)\n {\n ll sub = 1;\n rep(l, 0, K)\n {\n sub *= c[k + l];\n }\n chmax(nxt, sub);\n }\n chmax(ans, nxt);\n swap(c[i], c[j]);\n }\n }\n if (ans < now)\n {\n cout << \"NO GAME\" << endl;\n }\n else\n {\n cout << ans - now << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3456,
"score_of_the_acc": -0.9525,
"final_rank": 10
},
{
"submission_id": "aoj_1084_9083542",
"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, k;\n while (cin >> n >> k, n) {\n vector<int> c(n);\n for (int i = 0; i < n; ++i) {\n cin >> c[i];\n }\n int base = 0;\n for (int i = 0; i <= n - k; ++i) {\n int u = 1;\n for (int j = 0; j < k; ++j) {\n u *= c[i + j];\n }\n base = max(base, u);\n }\n int res = 0;\n for (int i = 0; i < n; ++i) {\n for (int j = i + 1; j < n; ++j) {\n swap(c[i], c[j]);\n for (int l = 0; l <= n - k; ++l) {\n int r = 1;\n for (int m = 0; m < k; ++m) {\n r *= c[l + m];\n }\n res = max(res, r);\n }\n swap(c[i], c[j]);\n }\n }\n if (res < base) cout << \"NO GAME\\n\";\n else cout << res - base << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3380,
"score_of_the_acc": -0.9686,
"final_rank": 11
},
{
"submission_id": "aoj_1084_6456042",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n#include <algorithm>\n#include <set>\n#include <stack>\n#include <queue>\n#include <cmath>\n#include <iomanip>\n#include <numeric>\nusing namespace std;\nusing ll = long long;\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\n\nbool solve() {\n int n, k; cin >> n >> k;\n if (n == 0 && k == 0) return false;\n vector<int> a(n);\n for(int i=0; i<n; ++i) cin >> a[i];\n\n int CK = 0;\n for(int i=0; i<=n-k; ++i) {\n int tmp = 1;\n for(int j=0; j<k; ++j) tmp *= a[i+j];\n chmax(CK, tmp);\n }\n\n int ans = -1;\n for(int i=0; i<n; ++i) for(int j=i+1; j<n; ++j) {\n swap(a[i], a[j]);\n int tmp = 1;\n for(int p=0; p<k; ++p) tmp *= a[p];\n int cmax = tmp;\n for(int p=k; p<n; ++p) {\n tmp /= a[p-k];\n tmp *= a[p];\n chmax(cmax, tmp);\n }\n chmax(ans, cmax - CK);\n swap(a[i], a[j]);\n }\n if (ans < 0) printf(\"NO GAME\\n\");\n else printf(\"%d\\n\", ans);\n return true;\n}\n\n\nint main() {\n while(solve()) continue;\n return 0;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 3568,
"score_of_the_acc": -1.371,
"final_rank": 19
},
{
"submission_id": "aoj_1084_6024794",
"code_snippet": "#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\n\n#define _overload(_1, _2, _3, _4, name, ...) name\n#define _rep1(Itr, N) _rep3(Itr, 0, N, 1)\n#define _rep2(Itr, a, b) _rep3(Itr, a, b, 1)\n#define _rep3(Itr, a, b, step) for (i64 Itr = a; Itr < b; Itr += step)\n#define repeat(...) _overload(__VA_ARGS__, _rep3, _rep2, _rep1)(__VA_ARGS__)\n#define rep(...) repeat(__VA_ARGS__)\n\n#define ALL(X) begin(X), end(X)\n\nusing namespace std;\nusing i64 = long long;\nusing u64 = unsigned long long;\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n i64 n, k;\n while (cin >> n >> k, n > 0) {\n vector<i64> c(n);\n for (auto &vs : c) cin >> vs;\n\n auto get_ck = [&]() {\n i64 ans = 0;\n i64 st = 1;\n rep(i, k) st *= c[i];\n ans = st;\n rep(i, k, n) {\n st /= c[i - k];\n st *= c[i];\n ans = max(ans, st);\n }\n return ans;\n };\n\n i64 sck = get_ck();\n i64 maxck = 0;\n rep(i, n) {\n rep(j, i + 1, n) {\n swap(c[i], c[j]);\n maxck = max(maxck, get_ck());\n swap(c[i], c[j]);\n }\n }\n\n if (maxck >= sck) {\n cout << maxck - sck << endl;\n } else {\n cout << \"NO GAME\" << endl;\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 450,
"memory_kb": 3348,
"score_of_the_acc": -1.5357,
"final_rank": 20
},
{
"submission_id": "aoj_1084_6024770",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n// template {{{\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\n\n#define range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)\n#define rrange(i, l, r) for (i64 i = (i64)(r) - 1; i >= (i64)(l); (i) -= 1)\n\n#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## __VA_ARGS__); })(x)\n#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)\n\n#define debug(x) cerr << \"(\" << __LINE__ << \")\" << #x << \": \" << (x) << endl\n\nconstexpr i32 inf = 1001001001;\nconstexpr i64 infll = 1001001001001001001ll;\n\nconstexpr i32 dx[] = {0, -1, 1, 0, -1, 1, -1, 1}; \nconstexpr i32 dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};\n\nstruct IoSetup { IoSetup(i32 x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;\n\ntemplate <typename T = i64> T input() { T x; cin >> x; return x; }\n\ntemplate <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != (int)v.size() ? \" \" : \"\"); } return os; } \ntemplate <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }\n\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << \"(\" << p.first << \", \" << p.second << \")\"; return os; }\ntemplate <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }\n\ntemplate <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }\ntemplate <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }\n\ntemplate <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\ntemplate <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n// }}}\n\ni64 C(const vector<int> &cs, int k) {\n i64 res = -1;\n range(l, 0, cs.size() - k + 1) {\n i64 s = 1;\n range(i, l, l + k) {\n s *= cs[i];\n }\n chmax(res, s);\n }\n return res;\n}\n \nvoid solve(int n, int k) {\n vector< int > cs(n);\n cin >> cs;\n \n i64 cp = C(cs, k);\n i64 c = -1;\n range(i, 0, n) range(j, 0, i) {\n swap(cs[i], cs[j]);\n chmax(c, C(cs, k));\n swap(cs[i], cs[j]);\n }\n\n if (c < cp) {\n cout << \"NO GAME\" << endl;\n } else {\n cout << c - cp << endl;\n }\n}\n\nsigned main() {\n int n, k;\n\n while (cin >> n >> k, n) {\n solve(n, k);\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3140,
"score_of_the_acc": -0.8506,
"final_rank": 5
},
{
"submission_id": "aoj_1084_6024766",
"code_snippet": "#include<bits/stdc++.h>\n\n#define int ll\n#define rep(i, N) for(int i = 0; i < (int)N; i++)\n#define rep1(i, N) for(int i = 1; i <= (int)N; i++)\n#define per(i, N) for(int i = N-1; i >= 0; i--)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define TakAo(ans) ans ? cout << \"Takahashi\\n\" : cout << \"Aoki\\n\"\n#define YesNo(ans) ans ? cout << \"Yes\\n\" : cout << \"No\\n\"\n#define yesno(ans) ans ? cout << \"yes\\n\" : cout << \"no\\n\"\n#define YESNO(ans) ans ? cout << \"YES\\n\" : cout << \"NO\\n\"\n#define equal(f1, f2) (abs(f1 - f2) <= EPS)\n#define endl '\\n'\n#define fi first\n#define se second\n#define pb push_back\n#define mkpr make_pair\n#define mktpl make_tuple\n\nusing namespace std;\nusing ll = int64_t;\nusing ld = long double;\nusing Pii = pair<int, int>;\nusing Tpl = tuple<int, int, int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vvc = vector<vector<char>>;\n\nconst ld EPS = 1e-8;\nconst ld Pi = acos(-1);\nconst ll INF = 1e9+10;\nconst int MOD = 998244353;\n//const int MOD = 1e9+7;\nconst int NIL = -1;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, -1, 0, 1};\n\nll cel(ll a, ll b){ return b ? (a + b - 1) / b : 1; }\nll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : a; }\nll Lcm(ll a, ll b){ return a / Gcd(a, b) * b; }\nll sq(ll a){ return a * a; }\nll cube(ll a){ return a * a * a; }\nll powi(ll a, ll b){ ll res = 1; rep(i, b) res *= a; return res; }\ntemplate<class T> bool chmin(T &a, T b){ if(a >= b){ a = b; return 1;} return 0; }\ntemplate<class T> bool chmax(T &a, T b){ if(a <= b){ a = b; return 1;} return 0; }\n\nvoid Main(){\n\twhile(1){\n\t\tint n, k; cin >> n >> k;\n\t\tif(!(n | k)) break;\n\n\t\tvector<int> c(n);\n\t\trep(i, n) cin >> c[i];\n\n\t\tint mx = 0, val;\n\t\tfor(int i = 0; i + k - 1 < n; i++){\n\t\t\tval = 1;\n\t\t\trep(j, k) val *= c[i + j];\n\t\t\tchmax(mx, val);\n\t\t}\n\n\t\tint ans = 0, stumx;\n\n\t\trep(i, n){\n\t\t\tfor(int j = i + 1; j < n; j++){\n\t\t\t\tswap(c[i], c[j]);\n\t\t\t\tval = 1, stumx = 0;\n\t\t\t\tfor(int l = 0; l + k - 1 < n; l++){\n\t\t\t\t\tval = 1;\n\t\t\t\t\trep(m, k) val *= c[l + m];\n\t\t\t\t\tchmax(stumx, val);\n\t\t\t\t}\n\t\t\t\tchmax(ans, stumx - mx);\n\t\t\t\tswap(c[i], c[j]);\n\t\t\t}\n\t\t}\n\n\t\tif(ans < 0) cout << \"NO GAME\" << endl;\n\t\telse cout << ans << endl;\n\t}\n}\n\nsigned main(){\n cin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\tcout << fixed << setprecision(15);\n\tMain();\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3508,
"score_of_the_acc": -0.9745,
"final_rank": 12
},
{
"submission_id": "aoj_1084_6007948",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\nconst int maxn=100010;\nint a[105];\nint n,k;\nint now()\n{\n int mx=0;\n for(int i=0;i<=n-k;i++){\n int chen=1;\n for(int j=i;j<i+k;j++){\n chen*=a[j];\n }\n mx=max(mx,chen);\n }\n return mx;\n}\nint main()\n{\n while(cin>>n>>k&&n){\n for(int i=0;i<n;i++){\n cin>>a[i];\n }\n int no=now();\n int mx=no;\n for(int i=0;i<n;i++){\n for(int j=i+1;j<n;j++){\n swap(a[i],a[j]);\n mx=max(mx,now());\n swap(a[i],a[j]);\n }\n }\n cout<<mx-no<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3088,
"score_of_the_acc": -0.8285,
"final_rank": 3
},
{
"submission_id": "aoj_1084_3325464",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(){\n int n, k;\n while(cin >> n >> k, n+k){\n // O(n^3)\n int c[n];\n for(int i = 0; i < n; i++) cin >> c[i];\n \n auto func = [&]() -> int {\n int t = 1;\n for(int i = 0; i < k; i++) t *= c[i];\n int tmp = t;\n for(int i = k; i < n; i++){\n tmp /= c[i-k];\n tmp *= c[i];\n t = max(t, tmp);\n }\n return t;\n };\n\n int t = func();\n int s = 0;\n for(int i = 0; i < n; i++){\n for(int j = i+1; j < n; j++){\n swap(c[i], c[j]);\n s = max(s, func());\n swap(c[i], c[j]);\n }\n }\n\n if(s >= t) cout << s-t << endl;\n else cout << \"NO GAME\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 320,
"memory_kb": 3076,
"score_of_the_acc": -1.2105,
"final_rank": 15
},
{
"submission_id": "aoj_1084_3082964",
"code_snippet": "#define _USE_MATH_DEFINES\n\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <map>\n#include <list>\n\nusing namespace std;\n\ntypedef pair<long long int, long long int> P;\n\nlong long int INF = 1e18;\nlong long int MOD = 1e8 + 7;\n\nint main(){\n\t\n\twhile(true){\n\t\tint n, k;\n\t\tcin >> n >> k;\n\t\tif(n == 0){\n\t\t\tbreak;\n\t\t}\n\t\tint c[110];\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tcin >> c[i];\n\t\t}\n\t\tlong long int S1 = 0, S2 = 0;\n\t\tfor(int i = 0; i <= n - k; i++){\n\t\t\tlong long int num = 1;\n\t\t\tfor(int j = 0; j < k; j++){\n\t\t\t\tnum *= c[i + j];\n\t\t\t}\n\t\t\tS1 = max(S1, num);\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\tswap(c[i], c[j]);\n\t\t\t\t\n\t\t\t\tfor(int p = 0; p <= n - k; p++){\n\t\t\t\t\tlong long int num = 1;\n\t\t\t\t\tfor(int q = 0; q < k; q++){\n\t\t\t\t\t\tnum *= c[p + q];\n\t\t\t\t\t}\n\t\t\t\t\tS2 = max(S2, num);\n\t\t\t\t}\n\t\t\t\tswap(c[i], c[j]);\n\t\t\t}\n\t\t}\n\t\tcout << S2 - S1 << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3060,
"score_of_the_acc": -0.8166,
"final_rank": 2
},
{
"submission_id": "aoj_1084_2647054",
"code_snippet": "#include <iostream>\nusing namespace std;\nint main(){\n int n,f;\n for(;cin>>n>>f&&n;){\n int c[100],r0=1,r1;\n for(int i=0;i<n;i++) cin>>c[i];\n for(int i=0;i<n-f+1;i++){\n int t=1;\n for(int j=0;j<f;j++) t*=c[i+j];\n r0=max(r0,t);\n }\n r1=r0;\n for(int k=0;k<n-1;k++){\n for(int l=k+1;l<n;l++){\n swap(c[k],c[l]);\n for(int i=0;i<n-f+1;i++){\n int t=1;\n for(int j=0;j<f;j++) t*=c[i+j];\n r1=max(r1,t);\n }\n swap(c[k],c[l]);\n }\n }\n cout<<r1-r0<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3068,
"score_of_the_acc": -0.8039,
"final_rank": 1
},
{
"submission_id": "aoj_1084_2372823",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint n,k,a[101];\nint main(){\n while(cin>>n>>k,n){\n for(int i=0;i<n;i++)cin>>a[i];\n int t=0,s=0;\n for(int i=0;i<n;i++){\n int x=1;\n for(int j=i,p=0;p<k&&j<n;p++,j++)\n x*=a[j];\n t=max(t,x);\n }\n for(int i=0;i<n;i++)\n for(int j=0;j<n;j++){\n swap(a[i],a[j]);\n for(int q=0;q<n;q++){\n int y=1;\n for(int w=q,p=0;p<k&&w<n;w++,p++)\n y*=a[w];\n s=max(s,y);\n }\n swap(a[j],a[i]);\n }\n if(t<s)cout<<s-t<<endl;\n else cout<<0<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 3088,
"score_of_the_acc": -1.0543,
"final_rank": 14
},
{
"submission_id": "aoj_1084_2171704",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <iostream>\n#include <set>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define PRIME1 99999883\n#define PRIME2 99999893\n#define EPS 0.00000001\nusing namespace std;\n\nint N,K;\n\nvoid func(){\n\n\tint baseTable[N],baseValue = 0;\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d\",&baseTable[i]);\n\t}\n\n\tint tmp = 1,pre;\n\tfor(int p = 0; p < K; p++){\n\t\ttmp *= baseTable[p];\n\t}\n\tbaseValue = tmp;\n\tpre = tmp;\n\n\tfor(int i = 1; i <= N-K; i++){\n\t\ttmp = (pre/baseTable[i-1])*baseTable[i+K-1];\n\t\tbaseValue = max(baseValue,tmp);\n\t\tpre = tmp;\n\t}\n\n\tint nextValue = 0,tmpValue;\n\t//???????????§??§??????????????§????????????????????£???????????§?????????????????¨?????????????????¨??¢?´¢\n\tfor(int a = 0; a < N-1; a++){\n\t\tfor(int b = a+1; b < N; b++){\n\t\t\tswap(baseTable[a],baseTable[b]);\n\n\t\t\ttmp = 1;\n\t\t\tfor(int p = 0; p < K; p++){\n\t\t\t\ttmp *= baseTable[p];\n\t\t\t}\n\t\t\ttmpValue = tmp;\n\t\t\tpre = tmp;\n\n\t\t\tfor(int i = 1; i <= N-K; i++){\n\t\t\t\ttmp = (pre/baseTable[i-1])*baseTable[i+K-1];\n\t\t\t\ttmpValue = max(tmpValue,tmp);\n\t\t\t\tpre = tmp;\n\t\t\t}\n\n\t\t\tnextValue = max(nextValue,tmpValue);\n\t\t\tswap(baseTable[a],baseTable[b]); //????????????\n\t\t}\n\t}\n\n\tif(nextValue < baseValue){\n\t\tprintf(\"NO GAME\\n\");\n\t}else{\n\t\tprintf(\"%d\\n\",nextValue - baseValue);\n\t}\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&N,&K);\n\t\tif(N == 0 && K == 0)break;\n\n\t\tfunc();\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 320,
"memory_kb": 3200,
"score_of_the_acc": -1.2632,
"final_rank": 17
},
{
"submission_id": "aoj_1084_2171702",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <iostream>\n#include <set>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define PRIME1 99999883\n#define PRIME2 99999893\n#define EPS 0.00000001\nusing namespace std;\n\nint N,K;\n\nvoid func(){\n\n\tint baseTable[N],baseValue = 0,work[N];\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d\",&baseTable[i]);\n\t}\n\n\tint tmp = 1,pre;\n\tfor(int p = 0; p < K; p++){\n\t\ttmp *= baseTable[p];\n\t}\n\tbaseValue = tmp;\n\tpre = tmp;\n\n\tfor(int i = 1; i <= N-K; i++){\n\t\ttmp = (pre/baseTable[i-1])*baseTable[i+K-1];\n\t\tbaseValue = max(baseValue,tmp);\n\t\tpre = tmp;\n\t}\n\n\tint nextValue = 0,tmpValue;\n\t//???????????§??§??????????????§????????????????????£???????????§?????????????????¨?????????????????¨??¢?´¢\n\tfor(int a = 0; a < N-1; a++){\n\t\tfor(int b = a+1; b < N; b++){\n\t\t\tfor(int p = 0; p < N; p++)work[p] = baseTable[p];\n\t\t\tswap(work[a],work[b]);\n\n\t\t\ttmp = 1;\n\t\t\tfor(int p = 0; p < K; p++){\n\t\t\t\ttmp *= work[p];\n\t\t\t}\n\t\t\ttmpValue = tmp;\n\t\t\tpre = tmp;\n\n\t\t\tfor(int i = 1; i <= N-K; i++){\n\t\t\t\ttmp = (pre/work[i-1])*work[i+K-1];\n\t\t\t\ttmpValue = max(tmpValue,tmp);\n\t\t\t\tpre = tmp;\n\t\t\t}\n\n\t\t\tnextValue = max(nextValue,tmpValue);\n\t\t}\n\t}\n\n\tif(nextValue < baseValue){\n\t\tprintf(\"NO GAME\\n\");\n\t}else{\n\t\tprintf(\"%d\\n\",nextValue - baseValue);\n\t}\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&N,&K);\n\t\tif(N == 0 && K == 0)break;\n\n\t\tfunc();\n\t}\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 340,
"memory_kb": 3140,
"score_of_the_acc": -1.2699,
"final_rank": 18
},
{
"submission_id": "aoj_1084_2169104",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\n\nint c[100];\nint main() {\n\tint n, k;\n\twhile (scanf(\"%d%d\", &n, &k), n) {\n\t\trep(i, n)scanf(\"%d\", &c[i]);\n\t\tint a = 0, b = 0;\n\t\tint r = 1;\n\t\trep(i, n) {\n\t\t\tif (i - k >= 0)r /= c[i - k];\n\t\t\tr *= c[i];\n\t\t\ta = max(a, r);\n\t\t}\n\t\trep(i, n)for (int j = i + 1; j < n; j++) {\n\t\t\tswap(c[i], c[j]);\n\t\t\tr = 1;\n\t\t\trep(i, n) {\n\t\t\t\tif (i - k >= 0)r /= c[i - k];\n\t\t\t\tr *= c[i];\n\t\t\t\tb = max(b, r);\n\t\t\t}\n\t\t\tswap(c[i], c[j]);\n\t\t}\n\t\tif (b < a)puts(\"NO GAME\");\n\t\telse printf(\"%d\\n\", b - a);\n\t}\n}",
"accuracy": 1,
"time_ms": 320,
"memory_kb": 3164,
"score_of_the_acc": -1.2479,
"final_rank": 16
},
{
"submission_id": "aoj_1084_2169092",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\n\nint c[100];\nint main() {\n\tint n, k;\n\twhile (scanf(\"%d%d\", &n, &k), n) {\n\t\trep(i, n)scanf(\"%d\", &c[i]);\n\t\tint a = 0, b = 0;\n\t\tfor (int i = 0; i <= n - k; i++) {\n\t\t\tint r = 1; rep(j, k)r *= c[i + j];\n\t\t\ta = max(a, r);\n\t\t}\n\t\trep(i, n)for (int j = i + 1; j < n; j++) {\n\t\t\tswap(c[i], c[j]);\n\t\t\tfor (int i = 0; i <= n - k; i++) {\n\t\t\t\tint r = 1; rep(j, k)r *= c[i + j];\n\t\t\t\tb = max(b, r);\n\t\t\t}\n\t\t\tswap(c[i], c[j]);\n\t\t}\n\t\tif (b < a)puts(\"NO GAME\");\n\t\telse printf(\"%d\\n\", b - a);\n\t}\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3192,
"score_of_the_acc": -0.8727,
"final_rank": 7
},
{
"submission_id": "aoj_1084_2076716",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n\nint main()\n{\n int n,k;\n while(scanf(\" %d %d\", &n, &k),n)\n {\n vector<int> c(n);\n rep(i,n) scanf(\" %d\", &c[i]);\n\n int t=0;\n for(int i=0; i+k-1<n; ++i)\n {\n int tmp=1;\n rep(j,k) tmp*=c[i+j];\n t=max(t,tmp);\n }\n\n int ans=-1;\n rep(x,n)rep(y,x)\n {\n swap(c[x],c[y]);\n\n int m=0;\n for(int i=0; i+k-1<n; ++i)\n {\n int tmp=1;\n rep(j,k) tmp*=c[i+j];\n m=max(m,tmp);\n }\n ans=max(ans,m-t);\n\n swap(c[x],c[y]);\n }\n\n if(ans<0) printf(\"NO GAME\\n\");\n else printf(\"%d\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3216,
"score_of_the_acc": -0.8506,
"final_rank": 6
},
{
"submission_id": "aoj_1084_1915435",
"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\" > \"D:\\D_Download\\Visual Studio 2015\\Projects\\programing_contest_c++\\Debug\\b.answer\"\n\nint getnum(const vector<int>&as, int K) {\n\tint ans = 0;\n\tfor (int l = 0; l <= as.size() - K; ++l) {\n\t\tint num = 1;\n\t\tfor (int i = l; i < l + K; ++i) {\n\t\t\tnum *= as[i];\n\t\t}\n\t\tans = max(ans, num);\n\t}\n\treturn ans;\n}\n\nint main() {\n\twhile (1) {\n\t\tint N, K; cin >> N >> K;\n\t\tif (!N)break;\n\t\tvector<int>as(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcin >> as[i];\n\t\t}\n\t\tint fst = getnum(as, K);\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tfor (int j = 1; j < N; ++j) {\n\t\t\t\tswap(as[i], as[j]);\n\t\t\t\tint n = getnum(as, K);\n\t\t\t\tans = max(ans, n - fst);\n\t\t\t\tswap(as[i], as[j]);\n\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 3040,
"score_of_the_acc": -0.9372,
"final_rank": 9
},
{
"submission_id": "aoj_1084_1868001",
"code_snippet": "#include <iostream>\n#include <vector>\n \nusing namespace std;\n \nint getPoint(int n,int k,vector<int> &v){\n int res = 0;\n for(int i = 0 ; i < n ; i++){\n\tif(i+k > n) break;\n\tint mul = 1;\n\tfor(int j = i ; j < i+k ; j++){\n\t mul *= v[j];\n\t}\n\tres = max(res,mul);\n }\n return res;\n}\n \nint main(){\n int n,k;\n while(true){\n\tcin >> n >> k;\n\tif(n == 0 && k == 0) break;\n\tvector<int> v(n);\n\tfor(int i = 0 ; i < n ; i++){\n\t cin >> v[i];\n\t}\n\tint Cb = getPoint(n,k,v),Ca = 0;\n\tfor(int i = 0 ; i < n ; i++){\n\t for(int j = i+1 ; j < n ; j++){\n\t\tswap(v[i],v[j]);\n\t\tCa = max(Ca,getPoint(n,k,v));\n\t\tswap(v[i],v[j]);\n\t }\n\t}\n\tif(Ca-Cb < 0){\n\t cout << \"NO GAME\" << endl;\n\t}else{\n\t cout << Ca-Cb << endl;\n\t}\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3064,
"score_of_the_acc": -0.8345,
"final_rank": 4
},
{
"submission_id": "aoj_1084_1834908",
"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#include<sstream>\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-8;\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 n,m;\nvi in;\nint ma(){\n\tint t=1;\n\trep(i,m)t*=in[i];\n\tint a=t;\n\trep(i,n-m){\n\t\tt=t/in[i]*in[i+m];\n\t\ta=max(a,t);\n\t}\n\treturn a;\n}\nint main(){\n\twhile(cin>>n>>m,n+m){\n\t\tin=vi(n);\n\t\trep(i,n)cin>>in[i];\n\t\tint a=ma(),b=0;\n\t\trep(i,n)rep(j,n)if(i!=j){\n\t\t\tswap(in[i],in[j]);\n\t\t\tb=max(b,ma());\n\t\t\tswap(in[i],in[j]);\n\t\t}\n\t\tif(a>b)cout<<\"NO GAME\"<<endl;\n\t\telse cout<<b-a<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 680,
"memory_kb": 1216,
"score_of_the_acc": -1.0017,
"final_rank": 13
},
{
"submission_id": "aoj_1084_1789115",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <cstring>\n#include <algorithm>\n#include <sstream>\n#include <map>\n#include <set>\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#define INF 1<<30\n#define pb push_back\n#define mp make_pair\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nint n, k;\n\nll f(vector<int> v) {\n\tll ret = 0, res = 1;\n\tint i;\n\tfor(i = 0; i < k; i++) {\n\t\tres *= v[i];\n\t}\n\tret = res;\n\n\tfor(; i < n; i++) {\n\t\tres *= v[i];\n\t\tres /= v[i-k];\n\t\tret = max(ret, res);\n\t}\n\treturn ret;\n}\n\nint main() {\n\twhile(cin >> n >> k) {\n\t\tif(n == 0 && k == 0) break;\n\n\t\tvector<int> v(n);\n\t\trep(i, n) cin >> v[i];\n\n\t\tll x = f(v);\n\t\tll ans = -INF;\n\n\t\trep(i, n) {\n\t\t\tREP(j, i+1, n) {\n\t\t\t\tswap(v[i], v[j]);\n\t\t\t\tans = max(ans, f(v) - x);\n\t\t\t\tswap(v[i], v[j]);\n\t\t\t}\n\t\t}\n\n\t\tif(ans >= 0) cout << ans << endl;\n\t\telse cout << \"NO GAME\" << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 620,
"memory_kb": 1212,
"score_of_the_acc": -0.9032,
"final_rank": 8
}
] |
aoj_1081_cpp
|
Problem H: World domination
世界征服を企む悪の組織、なんてものは、古今東西フィクションノンフィクションを問わず、いろんな所にいるものだが、一体彼らは何のために世界征服をしようとしたのだろうか。そんなことをふと考えてしまうのは、私もまた、世界征服を企てているからであった。私が世界征服を目論む理由はただ一つ、私がロボット工学の分野で世界一優秀であることを世界に示すためである。征服したあとの世界になど興味はない、そこらへんの犬にでもくれてやっても構わないのだ。
誠に遺憾だが、それはつまり、私よりも優秀であるとされている研究者がいる、ということだ。その人物には心当たりがある。誰あろう、私の学生時代の同期 R 博士である。彼の実績は認めるが、しかし私のそれより優れていたとは思わない。ただ彼は、平和のためのロボット利用などという甘っちょろいことを言っていたがために、教授連中の受けが良かったのだ。主席こそ逃したものの、本当は私の方がずっと優秀なのだ。
その優秀さを示す端的な例が、この世界征服のために用意した戦闘ロボットである。戦闘ロボットはその特性に応じた専用の武器を持ち、その武器はチップに収められているが、このチップは強力な互換性を持つ。ただ開発者自身の他の戦闘ロボットと互換性をもつだけではない (その程度のことは、他ならぬ R 博士が既に達成している) 。私のチップのすごいところは、その R 博士の家事手伝いロボットとも互換性があるのだ。その家事手伝いロボットは非売品のワンオフモデルなので、私はそのロボットの設計を知らないで互換チップを開発したのだ。我ながら神業と言わざるを得ない。この仕様を敵が利するだけの無駄な仕様と言う人もいるが、それは愚かな考え方だ。私は私の優秀さを示すために戦闘ロボットを開発しているのだ。ただ勝てばいいというものではないのである。
世界征服計画に話を戻そう。私は n 機の戦闘ロボットを製作し、それぞれに異なる武器チップを 1 つずつインストールした。これを用いて世界の主要施設を奪取するつもりだが、この計画を阻むために R 博士は彼の家事手伝いロボットを送り込んでくることだろう。家事手伝いロボットは自身の武器で私の戦闘ロボットに戦闘を挑んでくるが、1 回の戦闘には 1 単位時間かかり、戦闘の結果どちらか片方のロボットが敗北し破壊される。
戦闘の結果私のロボットが破壊された場合、そのロボットの武器チップは相手に奪われることになる。ある私のロボットの武器チップは他の私のロボットのうちの 1 機の弱点になっていて、またどの私のロボットも弱点となる武器チップをただ 1 つだけ持つ。私は私の各ロボットについて、相手がそのロボットの弱点武器を持っていた場合の敗北確率・持っていなかった場合の敗北確率をそれぞれ見積もることができる。
戦闘の結果相手の家事手伝いロボットが破壊された場合、R 博士はスペアボディ転送システムによって同じ家事手伝いロボットを送り込んでくる。このとき、相手のロボットが既に得ていた武器チップは失われることがない。R 博士は無制限にスペアボディ転送システムを使用してくるが、その隙に私は私の戦闘ロボットを修理することができるので、何度戦っても先に説明した敗北確率は変化することはない。また、スペアボディ転送システムは家事手伝いロボットが破壊されたときに破壊された場所でしか使えないので、家事手伝いロボットは敗北した直後に別の私の戦闘ロボットに挑むことはできない。
R 博士は無制限にスペアボディ転送システムを使えるのだから、悔しいが n 機の戦闘ロボットが全て破壊されるのは時間の問題だ。そこで私は戦闘ロボットを戦わせている裏で、スペアボディ転送システムごと破壊できるようなさらなるロボットの開発に勤しむつもりだ。しかし、私には一体どれだけの時間が残されているのだろうか。R 博士のロボットが最も早く私の n 機のロボットを撃破するような戦略を取ったとき、どれだけの時間がかかるだろうか。まずはそれを計算しなければなるまい。ついでに、そのようなロボットの撃破順序が何通りあるかも確認しておきたい。
Input
入力は複数のケースからなる。
各ケースは以下のフォーマットで与えられる。
n
p
0
id
0
w
0
p
1
id
1
w
1
.
.
.
p
1
id
n-1
w
n-1
p
i
は弱点の武器を相手が持っていない時に
i
番目の戦闘ロボットが敗北する確率を表す。
id
i
は
i
番目の戦闘ロボットの弱点となる武器を持っている戦闘ロボットを表す。
w
i
は弱点の武器を相手が持っている時に
i
番目の戦闘ロボットが敗北する確率を表す。
入力の終わりは
n
= 0によって与えられる。
各値は以下の条件を満たす
2 ≤ n ≤ 100
p
i
と
w
i
は小数点以下3桁の数で表される。
0.001 ≤
p
i
<
w
i
≤ 1.000
id
i
!=
i
テストケースの数は500を超えない。
Output
n体の戦闘ロボットが撃破されるまでの時間の期待値と、その撃破順序の組み合わせの数を100000007で割った余りを空白で区切って出力せよ。
期待値の値はジャッジの用意した回答との誤差1e-9までが認められる。
Sample input
4
0.200 3 0.500
0.100 0 0.400
0.900 1 1.000
0.400 2 0.600
2
0.600 1 0.800
0.500 0 1.000
9
0.200 7 0.600
0.400 0 0.500
0.700 8 1.000
0.100 4 0.400
0.200 2 0.600
0.100 6 0.400
0.100 5 0.400
0.600 3 0.900
0.500 1 0.900
9
0.300 8 0.900
0.700 3 0.800
0.300 0 0.900
0.700 6 0.800
0.200 5 0.700
0.200 2 0.700
0.700 4 0.800
0.700 1 0.800
0.300 7 0.900
0
Sample output
7.27777777778 1
2.66666666667 1
23.98412698413 72
11.36904761905 4
The University of Aizu Programming Contest 2011 Summer
原案: Tomoya Sakai
問題文: Takashi Tayama
|
[
{
"submission_id": "aoj_1081_1983733",
"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-10;\n\n// < \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\a.txt\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n \nstruct robot {\n\tld n_loss;\n\tint id;\n\tld s_loss;\n};\n\nstruct Dscc {\npublic:\n\n\t//fst:belongs , scd:newedges\n\tpair<vector<vector<int>>, vector<vector<int>>>get(const vector<vector<int>>&edges) {\n\t\tnums.resize(edges.size());\n\t\tfill(nums.begin(), nums.end(), -1);\n\t\tvector<vector<int>>revedges(edges.size());\n\t\tfor (int i = 0; i < edges.size(); ++i) {\n\t\t\tfor (auto j : edges[i]) {\n\t\t\t\trevedges[j].push_back(i);\n\t\t\t}\n\t\t}\n\t\tint num = 0;\n\t\tfor (int i = 0; i < edges.size(); ++i) {\n\t\t\tdfs(i, num, edges);\n\t\t}\n\t\tvector<int>big(nums.size());\n\t\tfor (int i = 0; i < nums.size(); ++i) {\n\t\t\tbig[nums[i]] = i;\n\t\t}\n\t\treverse(big.begin(), big.end());\n\t\tunis.resize(edges.size());\n\t\tfill(unis.begin(), unis.end(), -1);\n\t\tnum = 0;\n\t\tfor (int i = 0; i < big.size(); ++i) {\n\n\t\t\tdfs2(big[i], num, revedges);\n\t\t\tnum++;\n\t\t}\n\t\tvector<int>nums;\n\t\tfor (int i = 0; i < unis.size(); ++i) {\n\t\t\tnums.push_back(unis[i]);\n\t\t}\n\t\tsort(nums.begin(), nums.end());\n\t\tnums.erase(unique(nums.begin(), nums.end()), nums.end());\n\n\n\t\tmap<int, int>mp;\n\t\tfor (int i = 0; i < nums.size(); ++i) {\n\t\t\tmp[nums[i]] = i;\n\t\t}\n\t\tfor (int i = 0; i < unis.size(); ++i) {\n\t\t\tunis[i] = mp[unis[i]];\n\t\t}\n\n\t\tvector<vector<int>>belongs(nums.size());\n\t\tfor (int i = 0; i < unis.size(); ++i) {\n\t\t\tbelongs[unis[i]].push_back(i);\n\t\t}\n\t\tvector<vector<int>>newedges(nums.size());\n\t\tfor (int i = 0; i < edges.size(); ++i) {\n\t\t\tfor (auto j : edges[i]) {\n\t\t\t\tif (unis[i] != unis[j]) {\n\t\t\t\t\tnewedges[unis[i]].push_back(unis[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn make_pair(belongs, newedges);\n\t}\nprivate:\n\tvector<int>nums;\n\tvector<int>unis;\n\n\n\tvoid dfs(const int id, int &num, const vector<vector<int>>&edges) {\n\t\tif (nums[id] != -1)return;\n\t\telse {\n\t\t\tnums[id] = -2;\n\t\t\tfor (auto i : edges[id]) {\n\t\t\t\tdfs(i, num, edges);\n\t\t\t}\n\t\t}\n\t\tnums[id] = num++;\n\t\treturn;\n\t}\n\tvoid dfs2(const int id, const int &num, const vector<vector<int>>&edges) {\n\t\tif (unis[id] != -1)return;\n\t\telse {\n\t\t\tunis[id] = -2;\n\t\t\tfor (auto i : edges[id])\n\t\t\t\tdfs2(i, num, edges);\n\t\t}\n\t\tunis[id] = num;\n\t\treturn;\n\t}\n\n}dscc;\n\n\n\nconst int mod = 100000007;\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 10240\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\nint main() {\n\tcout << setprecision(11) << fixed;\n\tinit();\n\twhile (1) {\n\t\tint N; cin >> N;\n\n\t\tif (!N)break;\n\t\tvector<robot>robs;\n\t\tvector<vector<int>>edges(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld a, c; int b; cin >> a >> b >> c;\n\t\t\trobs.push_back(robot{ a,b,c });\n\t\t\tedges[i].push_back(b);\n\t\t}\n\n\t\tauto p = dscc.get(edges);\n\t\tld totalans = 0;\n\t\tMod totalsum = 1;\n\t\tint anum = N;\n\t\tfor (int k = 0;k < p.first.size(); ++k) {\n\t\t\tld ans = 1e8;\n\t\t\tMod sum =1;\n\t\t\tfor (int astart = 0; astart < p.first[k].size(); ++astart) {\n\t\t\t\tint start = p.first[k][astart];\n\t\t\t\tld nans = 1 / (robs[start].n_loss);\n\t\t\t\tint next = robs[start].id;\n\t\t\t\tfor (int j = 0; j < p.first[k].size() - 1; ++j) {\n\t\t\t\t\tnans += 1 / (robs[next].s_loss);\n\t\t\t\t\tnext = robs[next].id;\n\t\t\t\t}\n\t\t\t\tif (nans + eps < ans) {\n\t\t\t\t\tans = nans; sum = 1;\n\t\t\t\t}\n\t\t\t\telse if (abs(nans - ans) < eps) {\n\t\t\t\t\tsum+=1;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttotalans += ans;\n\t\t\ttotalsum *= sum;\n\n\t\t\ttotalsum *= comb(anum, p.first[k].size());\n\t\t\tanum -= p.first[k].size();\n\t\t}\n\t\t\n\t\tcout << totalans << \" \" << totalsum << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3320,
"score_of_the_acc": -0.313,
"final_rank": 12
},
{
"submission_id": "aoj_1081_1983423",
"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-10;\n\n// < \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\a.txt\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n \nstruct robot {\n\tld n_loss;\n\tint id;\n\tld s_loss;\n};\n\nstruct Dscc {\npublic:\n\n\t//fst:belongs , scd:newedges\n\tpair<vector<vector<int>>, vector<vector<int>>>get(const vector<vector<int>>&edges) {\n\t\tnums.resize(edges.size());\n\t\tfill(nums.begin(), nums.end(), -1);\n\t\tvector<vector<int>>revedges(edges.size());\n\t\tfor (int i = 0; i < edges.size(); ++i) {\n\t\t\tfor (auto j : edges[i]) {\n\t\t\t\trevedges[j].push_back(i);\n\t\t\t}\n\t\t}\n\t\tint num = 0;\n\t\tfor (int i = 0; i < edges.size(); ++i) {\n\t\t\tdfs(i, num, edges);\n\t\t}\n\t\tvector<int>big(nums.size());\n\t\tfor (int i = 0; i < nums.size(); ++i) {\n\t\t\tbig[nums[i]] = i;\n\t\t}\n\t\treverse(big.begin(), big.end());\n\t\tunis.resize(edges.size());\n\t\tfill(unis.begin(), unis.end(), -1);\n\t\tnum = 0;\n\t\tfor (int i = 0; i < big.size(); ++i) {\n\n\t\t\tdfs2(big[i], num, revedges);\n\t\t\tnum++;\n\t\t}\n\t\tvector<int>nums;\n\t\tfor (int i = 0; i < unis.size(); ++i) {\n\t\t\tnums.push_back(unis[i]);\n\t\t}\n\t\tsort(nums.begin(), nums.end());\n\t\tnums.erase(unique(nums.begin(), nums.end()), nums.end());\n\n\n\t\tmap<int, int>mp;\n\t\tfor (int i = 0; i < nums.size(); ++i) {\n\t\t\tmp[nums[i]] = i;\n\t\t}\n\t\tfor (int i = 0; i < unis.size(); ++i) {\n\t\t\tunis[i] = mp[unis[i]];\n\t\t}\n\n\t\tvector<vector<int>>belongs(nums.size());\n\t\tfor (int i = 0; i < unis.size(); ++i) {\n\t\t\tbelongs[unis[i]].push_back(i);\n\t\t}\n\t\tvector<vector<int>>newedges(nums.size());\n\t\tfor (int i = 0; i < edges.size(); ++i) {\n\t\t\tfor (auto j : edges[i]) {\n\t\t\t\tif (unis[i] != unis[j]) {\n\t\t\t\t\tnewedges[unis[i]].push_back(unis[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn make_pair(belongs, newedges);\n\t}\nprivate:\n\tvector<int>nums;\n\tvector<int>unis;\n\n\n\tvoid dfs(const int id, int &num, const vector<vector<int>>&edges) {\n\t\tif (nums[id] != -1)return;\n\t\telse {\n\t\t\tnums[id] = -2;\n\t\t\tfor (auto i : edges[id]) {\n\t\t\t\tdfs(i, num, edges);\n\t\t\t}\n\t\t}\n\t\tnums[id] = num++;\n\t\treturn;\n\t}\n\tvoid dfs2(const int id, const int &num, const vector<vector<int>>&edges) {\n\t\tif (unis[id] != -1)return;\n\t\telse {\n\t\t\tunis[id] = -2;\n\t\t\tfor (auto i : edges[id])\n\t\t\t\tdfs2(i, num, edges);\n\t\t}\n\t\tunis[id] = num;\n\t\treturn;\n\t}\n\n}dscc;\n\n\n\nconst int mod = 1000000007;\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\nint main() {\n\tcout << setprecision(11) << fixed;\n\tinit();\n\twhile (1) {\n\t\tint N; cin >> N;\n\n\t\tif (!N)break;\n\t\tvector<robot>robs;\n\t\tvector<vector<int>>edges(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld a, c; int b; cin >> a >> b >> c;\n\t\t\trobs.push_back(robot{ a,b,c });\n\t\t\tedges[i].push_back(b);\n\t\t}\n\n\t\tauto p = dscc.get(edges);\n\t\tld totalans = 0;\n\t\tMod totalsum = 1;\n\t\tint anum = N;\n\t\tfor (int k = 0;k < p.first.size(); ++k) {\n\t\t\tld ans = 1e8;\n\t\t\tMod sum =1;\n\t\t\tfor (int astart = 0; astart < p.first[k].size(); ++astart) {\n\t\t\t\tint start = p.first[k][astart];\n\t\t\t\tld nans = 1 / (robs[start].n_loss);\n\t\t\t\tint next = robs[start].id;\n\t\t\t\tfor (int j = 0; j < p.first[k].size() - 1; ++j) {\n\t\t\t\t\tnans += 1 / (robs[next].s_loss);\n\t\t\t\t\tnext = robs[next].id;\n\t\t\t\t}\n\t\t\t\tif (nans + eps < ans) {\n\t\t\t\t\tans = nans; sum = 1;\n\t\t\t\t}\n\t\t\t\telse if (abs(nans - ans) < eps) {\n\t\t\t\t\tsum+=1;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttotalans += ans;\n\t\t\ttotalsum *= sum;\n\n\t\t\ttotalsum *= comb(anum, p.first[k].size());\n\t\t\tanum -= p.first[k].size();\n\t\t}\n\t\t\n\t\tcout << totalans << \" \" << totalsum << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 0.6666666666666666,
"time_ms": 320,
"memory_kb": 11272,
"score_of_the_acc": -1.604,
"final_rank": 17
},
{
"submission_id": "aoj_1081_1983422",
"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-6;\n\n// < \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\a.txt\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n \nstruct robot {\n\tld n_loss;\n\tint id;\n\tld s_loss;\n};\n\nstruct Dscc {\npublic:\n\n\t//fst:belongs , scd:newedges\n\tpair<vector<vector<int>>, vector<vector<int>>>get(const vector<vector<int>>&edges) {\n\t\tnums.resize(edges.size());\n\t\tfill(nums.begin(), nums.end(), -1);\n\t\tvector<vector<int>>revedges(edges.size());\n\t\tfor (int i = 0; i < edges.size(); ++i) {\n\t\t\tfor (auto j : edges[i]) {\n\t\t\t\trevedges[j].push_back(i);\n\t\t\t}\n\t\t}\n\t\tint num = 0;\n\t\tfor (int i = 0; i < edges.size(); ++i) {\n\t\t\tdfs(i, num, edges);\n\t\t}\n\t\tvector<int>big(nums.size());\n\t\tfor (int i = 0; i < nums.size(); ++i) {\n\t\t\tbig[nums[i]] = i;\n\t\t}\n\t\treverse(big.begin(), big.end());\n\t\tunis.resize(edges.size());\n\t\tfill(unis.begin(), unis.end(), -1);\n\t\tnum = 0;\n\t\tfor (int i = 0; i < big.size(); ++i) {\n\n\t\t\tdfs2(big[i], num, revedges);\n\t\t\tnum++;\n\t\t}\n\t\tvector<int>nums;\n\t\tfor (int i = 0; i < unis.size(); ++i) {\n\t\t\tnums.push_back(unis[i]);\n\t\t}\n\t\tsort(nums.begin(), nums.end());\n\t\tnums.erase(unique(nums.begin(), nums.end()), nums.end());\n\n\n\t\tmap<int, int>mp;\n\t\tfor (int i = 0; i < nums.size(); ++i) {\n\t\t\tmp[nums[i]] = i;\n\t\t}\n\t\tfor (int i = 0; i < unis.size(); ++i) {\n\t\t\tunis[i] = mp[unis[i]];\n\t\t}\n\n\t\tvector<vector<int>>belongs(nums.size());\n\t\tfor (int i = 0; i < unis.size(); ++i) {\n\t\t\tbelongs[unis[i]].push_back(i);\n\t\t}\n\t\tvector<vector<int>>newedges(nums.size());\n\t\tfor (int i = 0; i < edges.size(); ++i) {\n\t\t\tfor (auto j : edges[i]) {\n\t\t\t\tif (unis[i] != unis[j]) {\n\t\t\t\t\tnewedges[unis[i]].push_back(unis[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn make_pair(belongs, newedges);\n\t}\nprivate:\n\tvector<int>nums;\n\tvector<int>unis;\n\n\n\tvoid dfs(const int id, int &num, const vector<vector<int>>&edges) {\n\t\tif (nums[id] != -1)return;\n\t\telse {\n\t\t\tnums[id] = -2;\n\t\t\tfor (auto i : edges[id]) {\n\t\t\t\tdfs(i, num, edges);\n\t\t\t}\n\t\t}\n\t\tnums[id] = num++;\n\t\treturn;\n\t}\n\tvoid dfs2(const int id, const int &num, const vector<vector<int>>&edges) {\n\t\tif (unis[id] != -1)return;\n\t\telse {\n\t\t\tunis[id] = -2;\n\t\t\tfor (auto i : edges[id])\n\t\t\t\tdfs2(i, num, edges);\n\t\t}\n\t\tunis[id] = num;\n\t\treturn;\n\t}\n\n}dscc;\n\n\n\nconst int mod = 1000000007;\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\nint main() {\n\tcout << setprecision(11) << fixed;\n\tinit();\n\twhile (1) {\n\t\tint N; cin >> N;\n\n\t\tif (!N)break;\n\t\tvector<robot>robs;\n\t\tvector<vector<int>>edges(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld a, c; int b; cin >> a >> b >> c;\n\t\t\trobs.push_back(robot{ a,b,c });\n\t\t\tedges[i].push_back(b);\n\t\t}\n\n\t\tauto p = dscc.get(edges);\n\t\tld totalans = 0;\n\t\tMod totalsum = 1;\n\t\tint anum = N;\n\t\tfor (int k = 0;k < p.first.size(); ++k) {\n\t\t\tld ans = 1e8;\n\t\t\tMod sum =1;\n\t\t\tfor (int astart = 0; astart < p.first[k].size(); ++astart) {\n\t\t\t\tint start = p.first[k][astart];\n\t\t\t\tld nans = 1 / (robs[start].n_loss);\n\t\t\t\tint next = robs[start].id;\n\t\t\t\tfor (int j = 0; j < p.first[k].size() - 1; ++j) {\n\t\t\t\t\tnans += 1 / (robs[next].s_loss);\n\t\t\t\t\tnext = robs[next].id;\n\t\t\t\t}\n\t\t\t\tif (nans + eps < ans) {\n\t\t\t\t\tans = nans; sum = 1;\n\t\t\t\t}\n\t\t\t\telse if (abs(nans - ans) < eps) {\n\t\t\t\t\tsum+=1;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttotalans += ans;\n\t\t\ttotalsum *= sum;\n\n\t\t\ttotalsum *= comb(anum, p.first[k].size());\n\t\t\tanum -= p.first[k].size();\n\t\t}\n\t\t\n\t\tcout << totalans << \" \" << totalsum << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 0.6666666666666666,
"time_ms": 330,
"memory_kb": 11296,
"score_of_the_acc": -1.6257,
"final_rank": 20
},
{
"submission_id": "aoj_1081_1983420",
"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-6;\n\n// < \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\a.txt\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n \nstruct robot {\n\tld n_loss;\n\tint id;\n\tld s_loss;\n};\n\nstruct Dscc {\npublic:\n\n\t//fst:belongs , scd:newedges\n\tpair<vector<vector<int>>, vector<vector<int>>>get(const vector<vector<int>>&edges) {\n\t\tnums.resize(edges.size());\n\t\tfill(nums.begin(), nums.end(), -1);\n\t\tvector<vector<int>>revedges(edges.size());\n\t\tfor (int i = 0; i < edges.size(); ++i) {\n\t\t\tfor (auto j : edges[i]) {\n\t\t\t\trevedges[j].push_back(i);\n\t\t\t}\n\t\t}\n\t\tint num = 0;\n\t\tfor (int i = 0; i < edges.size(); ++i) {\n\t\t\tdfs(i, num, edges);\n\t\t}\n\t\tvector<int>big(nums.size());\n\t\tfor (int i = 0; i < nums.size(); ++i) {\n\t\t\tbig[nums[i]] = i;\n\t\t}\n\t\treverse(big.begin(), big.end());\n\t\tunis.resize(edges.size());\n\t\tfill(unis.begin(), unis.end(), -1);\n\t\tnum = 0;\n\t\tfor (int i = 0; i < big.size(); ++i) {\n\n\t\t\tdfs2(big[i], num, revedges);\n\t\t\tnum++;\n\t\t}\n\t\tvector<int>nums;\n\t\tfor (int i = 0; i < unis.size(); ++i) {\n\t\t\tnums.push_back(unis[i]);\n\t\t}\n\t\tsort(nums.begin(), nums.end());\n\t\tnums.erase(unique(nums.begin(), nums.end()), nums.end());\n\n\n\t\tmap<int, int>mp;\n\t\tfor (int i = 0; i < nums.size(); ++i) {\n\t\t\tmp[nums[i]] = i;\n\t\t}\n\t\tfor (int i = 0; i < unis.size(); ++i) {\n\t\t\tunis[i] = mp[unis[i]];\n\t\t}\n\n\t\tvector<vector<int>>belongs(nums.size());\n\t\tfor (int i = 0; i < unis.size(); ++i) {\n\t\t\tbelongs[unis[i]].push_back(i);\n\t\t}\n\t\tvector<vector<int>>newedges(nums.size());\n\t\tfor (int i = 0; i < edges.size(); ++i) {\n\t\t\tfor (auto j : edges[i]) {\n\t\t\t\tif (unis[i] != unis[j]) {\n\t\t\t\t\tnewedges[unis[i]].push_back(unis[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn make_pair(belongs, newedges);\n\t}\nprivate:\n\tvector<int>nums;\n\tvector<int>unis;\n\n\n\tvoid dfs(const int id, int &num, const vector<vector<int>>&edges) {\n\t\tif (nums[id] != -1)return;\n\t\telse {\n\t\t\tnums[id] = -2;\n\t\t\tfor (auto i : edges[id]) {\n\t\t\t\tdfs(i, num, edges);\n\t\t\t}\n\t\t}\n\t\tnums[id] = num++;\n\t\treturn;\n\t}\n\tvoid dfs2(const int id, const int &num, const vector<vector<int>>&edges) {\n\t\tif (unis[id] != -1)return;\n\t\telse {\n\t\t\tunis[id] = -2;\n\t\t\tfor (auto i : edges[id])\n\t\t\t\tdfs2(i, num, edges);\n\t\t}\n\t\tunis[id] = num;\n\t\treturn;\n\t}\n\n}dscc;\n\n\n\nconst int mod = 1000000007;\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\nint main() {\n\tcout << setprecision(11) << fixed;\n\tinit();\n\twhile (1) {\n\t\tint N; cin >> N;\n\n\t\tif (!N)break;\n\t\tvector<robot>robs;\n\t\tvector<vector<int>>edges(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld a, c; int b; cin >> a >> b >> c;\n\t\t\trobs.push_back(robot{ a,b,c });\n\t\t\tedges[i].push_back(b);\n\t\t}\n\n\t\tauto p = dscc.get(edges);\n\t\tld totalans = 0;\n\t\tMod totalsum = 1;\n\t\tint anum = N;\n\t\tfor (int k = 0;k < p.first.size(); ++k) {\n\t\t\tld ans = 1e8;\n\t\t\tMod sum = 0;\n\t\t\tfor (int astart = 0; astart < p.first[k].size(); ++astart) {\n\t\t\t\tint start = p.first[k][astart];\n\t\t\t\tld nans = 1 / (robs[start].n_loss);\n\t\t\t\tint next = robs[start].id;\n\t\t\t\tfor (int j = 0; j < p.first[k].size() - 1; ++j) {\n\t\t\t\t\tnans += 1 / (robs[next].s_loss);\n\t\t\t\t\tnext = robs[next].id;\n\t\t\t\t}\n\t\t\t\tif (nans + eps < ans) {\n\t\t\t\t\tans = nans; sum = 1;\n\t\t\t\t}\n\t\t\t\telse if (abs(nans - ans) < eps) {\n\t\t\t\t\tsum+=1;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttotalans += ans;\n\t\t\ttotalsum *= sum;\n\n\t\t\ttotalsum *= comb(anum, p.first[k].size());\n\t\t\tanum -= p.first[k].size();\n\t\t}\n\t\t\n\t\tcout << totalans << \" \" << totalsum << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 0.6666666666666666,
"time_ms": 320,
"memory_kb": 11304,
"score_of_the_acc": -1.6068,
"final_rank": 18
},
{
"submission_id": "aoj_1081_1983419",
"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-7;\n\n// < \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\a.txt\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n \nstruct robot {\n\tld n_loss;\n\tint id;\n\tld s_loss;\n};\n\nstruct Dscc {\npublic:\n\n\t//fst:belongs , scd:newedges\n\tpair<vector<vector<int>>, vector<vector<int>>>get(const vector<vector<int>>&edges) {\n\t\tnums.resize(edges.size());\n\t\tfill(nums.begin(), nums.end(), -1);\n\t\tvector<vector<int>>revedges(edges.size());\n\t\tfor (int i = 0; i < edges.size(); ++i) {\n\t\t\tfor (auto j : edges[i]) {\n\t\t\t\trevedges[j].push_back(i);\n\t\t\t}\n\t\t}\n\t\tint num = 0;\n\t\tfor (int i = 0; i < edges.size(); ++i) {\n\t\t\tdfs(i, num, edges);\n\t\t}\n\t\tvector<int>big(nums.size());\n\t\tfor (int i = 0; i < nums.size(); ++i) {\n\t\t\tbig[nums[i]] = i;\n\t\t}\n\t\treverse(big.begin(), big.end());\n\t\tunis.resize(edges.size());\n\t\tfill(unis.begin(), unis.end(), -1);\n\t\tnum = 0;\n\t\tfor (int i = 0; i < big.size(); ++i) {\n\n\t\t\tdfs2(big[i], num, revedges);\n\t\t\tnum++;\n\t\t}\n\t\tvector<int>nums;\n\t\tfor (int i = 0; i < unis.size(); ++i) {\n\t\t\tnums.push_back(unis[i]);\n\t\t}\n\t\tsort(nums.begin(), nums.end());\n\t\tnums.erase(unique(nums.begin(), nums.end()), nums.end());\n\n\n\t\tmap<int, int>mp;\n\t\tfor (int i = 0; i < nums.size(); ++i) {\n\t\t\tmp[nums[i]] = i;\n\t\t}\n\t\tfor (int i = 0; i < unis.size(); ++i) {\n\t\t\tunis[i] = mp[unis[i]];\n\t\t}\n\n\t\tvector<vector<int>>belongs(nums.size());\n\t\tfor (int i = 0; i < unis.size(); ++i) {\n\t\t\tbelongs[unis[i]].push_back(i);\n\t\t}\n\t\tvector<vector<int>>newedges(nums.size());\n\t\tfor (int i = 0; i < edges.size(); ++i) {\n\t\t\tfor (auto j : edges[i]) {\n\t\t\t\tif (unis[i] != unis[j]) {\n\t\t\t\t\tnewedges[unis[i]].push_back(unis[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn make_pair(belongs, newedges);\n\t}\nprivate:\n\tvector<int>nums;\n\tvector<int>unis;\n\n\n\tvoid dfs(const int id, int &num, const vector<vector<int>>&edges) {\n\t\tif (nums[id] != -1)return;\n\t\telse {\n\t\t\tnums[id] = -2;\n\t\t\tfor (auto i : edges[id]) {\n\t\t\t\tdfs(i, num, edges);\n\t\t\t}\n\t\t}\n\t\tnums[id] = num++;\n\t\treturn;\n\t}\n\tvoid dfs2(const int id, const int &num, const vector<vector<int>>&edges) {\n\t\tif (unis[id] != -1)return;\n\t\telse {\n\t\t\tunis[id] = -2;\n\t\t\tfor (auto i : edges[id])\n\t\t\t\tdfs2(i, num, edges);\n\t\t}\n\t\tunis[id] = num;\n\t\treturn;\n\t}\n\n}dscc;\n\n\n\nconst int mod = 1000000007;\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\nint main() {\n\tcout << setprecision(11) << fixed;\n\tinit();\n\twhile (1) {\n\t\tint N; cin >> N;\n\n\t\tif (!N)break;\n\t\tvector<robot>robs;\n\t\tvector<vector<int>>edges(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld a, c; int b; cin >> a >> b >> c;\n\t\t\trobs.push_back(robot{ a,b,c });\n\t\t\tedges[i].push_back(b);\n\t\t}\n\n\t\tauto p = dscc.get(edges);\n\t\tld totalans = 0;\n\t\tMod totalsum = 1;\n\t\tint anum = N;\n\t\tfor (int k = 0;k < p.first.size(); ++k) {\n\t\t\tld ans = 1e8;\n\t\t\tMod sum = 0;\n\t\t\tfor (int astart = 0; astart < p.first[k].size(); ++astart) {\n\t\t\t\tint start = p.first[k][astart];\n\t\t\t\tld nans = 1 / (robs[start].n_loss);\n\t\t\t\tint next = robs[start].id;\n\t\t\t\tfor (int j = 0; j < p.first[k].size() - 1; ++j) {\n\t\t\t\t\tnans += 1 / (robs[next].s_loss);\n\t\t\t\t\tnext = robs[next].id;\n\t\t\t\t}\n\t\t\t\tif (nans + eps < ans) {\n\t\t\t\t\tans = nans; sum = 1;\n\t\t\t\t}\n\t\t\t\telse if (abs(nans - ans) < eps) {\n\t\t\t\t\tsum+=1;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttotalans += ans;\n\t\t\ttotalsum *= sum;\n\n\t\t\ttotalsum *= comb(anum, p.first[k].size());\n\t\t\tanum -= p.first[k].size();\n\t\t}\n\t\t\n\t\tcout << totalans << \" \" << totalsum << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 0.6666666666666666,
"time_ms": 320,
"memory_kb": 11316,
"score_of_the_acc": -1.6078,
"final_rank": 19
},
{
"submission_id": "aoj_1081_1131769",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\ndouble p[110];\nint q[110];\ndouble r[110];\nlong long mod=100000007;\nint v[110];\ndouble eps=1e-9;\nint C[110][110];\nint main(){\n\tint a;\n\tC[0][0]=1;\n\tfor(int i=0;i<106;i++){\n\t\tfor(int j=0;j<=i;j++){\n\t\t\tC[i+1][j]=(C[i+1][j]+C[i][j])%mod;\n\t\t\tC[i+1][j+1]=(C[i+1][j+1]+C[i][j])%mod;\n\t\t}\n\t}\n\twhile(scanf(\"%d\",&a),a){\n\t\tfor(int i=0;i<a;i++)scanf(\"%lf%d%lf\",p+i,q+i,r+i);\n\t\tfor(int i=0;i<a;i++)v[i]=0;\n\t\tlong long ret=1;\n\t\tdouble val=0;\n\t\tint rem=a;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tif(v[i])continue;\n\t\t\tint at=i;\n\t\t\tdouble m=999999999;\n\t\t\tint cnt=0;\n\t\t\tint sz=0;\n\t\t\twhile(!v[at]){\n\t\t\t\tv[at]=1;\n\t\t\t\tval+=1.0/r[at];\n\t\t\t\tif(m-eps>1.0/p[at]-1.0/r[at]){\n\t\t\t\t\tm=1.0/p[at]-1.0/r[at];\n\t\t\t\t\tcnt=1;\n\t\t\t\t}else if(m>1.0/p[at]-1.0/r[at]-eps){\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tat=q[at];\n\t\t\t\tsz++;\n\t\t\t}\n\t\t\tret=ret*cnt%mod;\n\t\t\tval+=m;\n\t\t\tret=ret*C[rem][sz]%mod;\n\t\t\trem-=sz;\n\t\t}\n\t\tprintf(\"%.12f %lld\\n\",val,ret);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1136,
"score_of_the_acc": -0.1004,
"final_rank": 6
},
{
"submission_id": "aoj_1081_1131767",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\ndouble p[110];\nint q[110];\ndouble r[110];\nlong long mod=1000000007;\nint v[110];\ndouble eps=1e-9;\nint C[110][110];\nint main(){\n\tint a;\n\tC[0][0]=1;\n\tfor(int i=0;i<106;i++){\n\t\tfor(int j=0;j<=i;j++){\n\t\t\tC[i+1][j]=(C[i+1][j]+C[i][j])%mod;\n\t\t\tC[i+1][j+1]=(C[i+1][j+1]+C[i][j])%mod;\n\t\t}\n\t}\n\twhile(scanf(\"%d\",&a),a){\n\t\tfor(int i=0;i<a;i++)scanf(\"%lf%d%lf\",p+i,q+i,r+i);\n\t\tfor(int i=0;i<a;i++)v[i]=0;\n\t\tlong long ret=1;\n\t\tdouble val=0;\n\t\tint rem=a;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tif(v[i])continue;\n\t\t\tint at=i;\n\t\t\tdouble m=999999999;\n\t\t\tint cnt=0;\n\t\t\tint sz=0;\n\t\t\twhile(!v[at]){\n\t\t\t\tv[at]=1;\n\t\t\t\tval+=1.0/r[at];\n\t\t\t\tif(m-eps>1.0/p[at]-1.0/r[at]){\n\t\t\t\t\tm=1.0/p[at]-1.0/r[at];\n\t\t\t\t\tcnt=1;\n\t\t\t\t}else if(m>1.0/p[at]-1.0/r[at]-eps){\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t\tat=q[at];\n\t\t\t\tsz++;\n\t\t\t}\n\t\t\tret=ret*cnt%mod;\n\t\t\tval+=m;\n\t\t\tret=ret*C[rem][sz]%mod;\n\t\t\trem-=sz;\n\t\t}\n\t\tprintf(\"%.12f %lld\\n\",val,ret);\n\t}\n}",
"accuracy": 0.6666666666666666,
"time_ms": 10,
"memory_kb": 1136,
"score_of_the_acc": -0.1004,
"final_rank": 13
},
{
"submission_id": "aoj_1081_451831",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing namespace std;\n\nconst double EPS = 1.0e-10;\nconst int MOD = 100000007;\n\nvoid combination(int n, vector<vector<int> >& comb)\n{\n comb.assign(n+1, vector<int>(n+1, 0));\n for(int i=0; i<=n; ++i){\n comb[i][0] = 1;\n for(int j=1; j<=i; ++j){\n comb[i][j] = comb[i-1][j-1] + comb[i-1][j];\n comb[i][j] %= MOD;\n }\n }\n}\n\nvector<double> destroy(1001, 0.0); // 破壊されるまでの時間の期待値\n\ndouble solve(vector<double>& p, vector<double>& q, int& pattern)\n{\n int n = p.size();\n\n double t = 0.0;\n for(int i=0; i<n; ++i)\n t += destroy[q[i]*1000+EPS];\n\n double ret = DBL_MAX;\n pattern = 0;\n for(int i=0; i<n; ++i){\n double t2 = t - destroy[q[i]*1000+EPS] + destroy[p[i]*1000+EPS];\n if(t2 < ret - EPS){\n ret = t2;\n pattern = 1;\n }else if(t2 < ret + EPS){\n ++ pattern;\n }\n }\n\n return ret;\n}\n\nint main()\n{\n for(int i=1; i<=1000; ++i){\n double p = i / 1000.0;\n double a = 1.0;\n for(int j=1; ; ++j){\n if(a * p * j < EPS / 1000)\n break;\n destroy[i] += a * p * j;\n a *= 1.0 - p;\n }\n }\n\n vector<vector<int> > comb;\n combination(100, comb);\n\n for(;;){\n int n;\n cin >> n;\n if(n == 0)\n return 0;\n\n vector<double> p(n), q(n);\n vector<int> id(n);\n for(int i=0; i<n; ++i)\n cin >> p[i] >> id[i] >> q[i];\n\n vector<bool> check(n, false);\n double ret = 0.0;\n long long pattern = 1;\n int tmp = n;\n for(int i=0; i<n; ++i){\n if(check[i])\n continue;\n\n int j = i;\n vector<double> p2, q2;\n while(!check[j]){\n p2.push_back(p[j]);\n q2.push_back(q[j]);\n check[j] = true;\n j = id[j];\n }\n\n int pattern2;\n ret += solve(p2, q2, pattern2);\n pattern *= pattern2;\n pattern %= MOD;\n\n pattern *= comb[tmp][p2.size()];\n pattern %= MOD;\n tmp -= p2.size();\n }\n\n printf(\"%.10f %d\\n\", ret, (int)pattern);\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 0,
"score_of_the_acc": -0.0392,
"final_rank": 5
},
{
"submission_id": "aoj_1081_451817",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing namespace std;\n\nconst double EPS = 1.0e-10;\nconst int MOD = 100000007;\n\nvoid combination(int n, vector<vector<int> >& comb)\n{\n comb.assign(n+1, vector<int>(n+1, 0));\n for(int i=0; i<=n; ++i){\n comb[i][0] = 1;\n for(int j=1; j<=i; ++j){\n comb[i][j] = comb[i-1][j-1] + comb[i-1][j];\n comb[i][j] %= MOD;\n }\n }\n}\n\nvector<double> destroy(1001, 0.0); // 破壊されるまでの時間の期待値\n\ndouble solve(vector<double>& p, vector<double>& q, int& pattern)\n{\n int n = p.size();\n\n double t = 0.0;\n for(int i=0; i<n; ++i)\n t += destroy[q[i]*1000+EPS];\n\n double ret = DBL_MAX;\n pattern = 0;\n for(int i=0; i<n; ++i){\n double t2 = t - destroy[q[i]*1000+EPS] + destroy[p[i]*1000+EPS];\n if(t2 < ret - EPS){\n ret = t2;\n pattern = 1;\n }else if(t2 < ret + EPS){\n ++ pattern;\n }\n }\n\n return ret;\n}\n\nint main()\n{\n for(int i=1; i<=1000; ++i){\n double p = i / 1000.0;\n double a = 1.0;\n for(int j=1; j<=30000; ++j){\n destroy[i] += a * p * j;\n a *= 1.0 - p;\n }\n }\n\n vector<vector<int> > comb;\n combination(100, comb);\n\n for(;;){\n int n;\n cin >> n;\n if(n == 0)\n return 0;\n\n vector<double> p(n), q(n);\n vector<int> id(n);\n for(int i=0; i<n; ++i)\n cin >> p[i] >> id[i] >> q[i];\n\n vector<bool> check(n, false);\n double ret = 0.0;\n long long pattern = 1;\n int tmp = n;\n for(int i=0; i<n; ++i){\n if(check[i])\n continue;\n\n int j = i;\n vector<double> p2, q2;\n while(!check[j]){\n p2.push_back(p[j]);\n q2.push_back(q[j]);\n check[j] = true;\n j = id[j];\n }\n\n int pattern2;\n ret += solve(p2, q2, pattern2);\n pattern *= pattern2;\n pattern %= MOD;\n\n pattern *= comb[tmp][p2.size()];\n pattern %= MOD;\n tmp -= p2.size();\n }\n\n printf(\"%.10f %d\\n\", ret, (int)pattern);\n }\n}",
"accuracy": 0.6666666666666666,
"time_ms": 520,
"memory_kb": 1040,
"score_of_the_acc": -1.0919,
"final_rank": 15
},
{
"submission_id": "aoj_1081_451771",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing namespace std;\n\nconst double EPS = 1.0e-10;\nconst int MOD = 100000007;\n\nvoid combination(int n, vector<vector<int> >& comb)\n{\n comb.assign(n+1, vector<int>(n+1, 0));\n for(int i=0; i<=n; ++i){\n comb[i][0] = 1;\n for(int j=1; j<=i; ++j){\n comb[i][j] = comb[i-1][j-1] + comb[i-1][j];\n comb[i][j] %= MOD;\n }\n }\n}\n\nvector<double> destroy(1001, 0.0); // 破壊されるまでの時間の期待値\n\ndouble solve(vector<double>& p, vector<double>& q, int& pattern)\n{\n int n = p.size();\n\n double t = 0.0;\n for(int i=0; i<n; ++i)\n t += destroy[q[i]*1000+EPS];\n\n double ret = DBL_MAX;\n pattern = 0;\n for(int i=0; i<n; ++i){\n double t2 = t - destroy[q[i]*1000+EPS] + destroy[p[i]*1000+EPS];\n if(t2 < ret - EPS){\n ret = t2;\n pattern = 1;\n }else if(t2 < ret + EPS){\n ++ pattern;\n }\n }\n\n return ret;\n}\n\nint main()\n{\n for(int i=1; i<=1000; ++i){\n double p = i / 1000.0;\n double a = 1.0;\n for(int j=1; j<=30000; ++j){\n destroy[i] += a * p * j;\n a *= 1.0 - p;\n }\n }\n\n vector<vector<int> > comb;\n combination(100, comb);\n\n for(;;){\n int n;\n cin >> n;\n if(n == 0)\n return 0;\n\n vector<double> p(n), q(n);\n vector<int> id(n);\n for(int i=0; i<n; ++i)\n cin >> p[i] >> id[i] >> q[i];\n\n vector<bool> check(n, false);\n double ret = 0.0;\n long long pattern = 1;\n int tmp = n;\n for(int i=0; i<n; ++i){\n if(check[i])\n continue;\n\n int j = i;\n vector<double> p2, q2;\n while(!check[j]){\n p2.push_back(p[j]);\n q2.push_back(q[j]);\n check[j] = true;\n j = id[j];\n }\n\n int pattern2;\n ret += solve(p2, q2, pattern2);\n pattern *= pattern2;\n pattern %= MOD;\n\n pattern *= comb[tmp][p2.size()];\n pattern %= MOD;\n tmp -= p2.size();\n }\n\n printf(\"%.10f %d\\n\", ret, pattern);\n }\n}",
"accuracy": 0.6666666666666666,
"time_ms": 520,
"memory_kb": 1040,
"score_of_the_acc": -1.0919,
"final_rank": 15
},
{
"submission_id": "aoj_1081_451768",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing namespace std;\n\nconst double EPS = 1.0e-10;\nconst int MOD = 100000007;\n\nvoid combination(int n, vector<vector<int> >& comb)\n{\n comb.assign(n+1, vector<int>(n+1, 0));\n for(int i=0; i<=n; ++i){\n comb[i][0] = 1;\n for(int j=1; j<=i; ++j){\n comb[i][j] = comb[i-1][j-1] + comb[i-1][j];\n comb[i][j] %= MOD;\n }\n }\n}\n\nvector<double> destroy(1001, 0.0); // 破壊されるまでの時間の期待値\n\ndouble solve(vector<double>& p, vector<double>& q, int& pattern)\n{\n int n = p.size();\n\n double t = 0.0;\n for(int i=0; i<n; ++i)\n t += destroy[q[i]*1000+EPS];\n\n double ret = DBL_MAX;\n pattern = 0;\n for(int i=0; i<n; ++i){\n double t2 = t - destroy[q[i]*1000+EPS] + destroy[p[i]*1000+EPS];\n if(t2 < ret - EPS){\n ret = t2;\n pattern = 1;\n }else if(t2 < ret + EPS){\n ++ pattern;\n }\n }\n\n return ret;\n}\n\nint main()\n{\n for(int i=1; i<=1000; ++i){\n double p = i / 1000.0;\n double a = 1.0;\n for(int j=1; j<=30000; ++j){\n destroy[i] += a * p * j;\n a *= 1.0 - p;\n }\n }\n\n vector<vector<int> > comb;\n combination(100, comb);\n\n for(;;){\n int n;\n cin >> n;\n if(n == 0)\n return 0;\n\n vector<double> p(n), q(n);\n vector<int> id(n);\n for(int i=0; i<n; ++i)\n cin >> p[i] >> id[i] >> q[i];\n\n vector<bool> check(n, false);\n double ret = 0.0;\n long long pattern = 1;\n int tmp = n;\n for(int i=0; i<n; ++i){\n if(check[i])\n continue;\n\n int j = i;\n vector<double> p2, q2;\n while(!check[j]){\n p2.push_back(p[j]);\n q2.push_back(q[j]);\n check[j] = true;\n j = id[j];\n }\n\n int pattern2;\n ret += solve(p2, q2, pattern2);\n pattern *= pattern2 * comb[tmp][p2.size()];\n pattern %= MOD;\n tmp -= p2.size();\n }\n\n printf(\"%.10f %d\\n\", ret, pattern);\n }\n}",
"accuracy": 0.6666666666666666,
"time_ms": 520,
"memory_kb": 1036,
"score_of_the_acc": -1.0916,
"final_rank": 14
},
{
"submission_id": "aoj_1081_339198",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\n#include <string>\n#include <cmath>\n#include <cassert>\n#include <queue>\n#include <set>\n#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;\nconst int INF = 1<<29;\nconst double PI = acos(-1);\nconst double EPS = 1e-8;\nconst int M = 100000007;\n\nint combi[500][500];\n\nll func(vector<int> v) {\n ll res = 1;\n int now = v[0];\n for (int i=1; i<v.size(); ++i) {\n res = (res * combi[v[i]+now][v[i]]) % M;\n now += v[i];\n }\n return res;\n}\n\nint main() {\n REP(i,500) combi[i][0] = 1;\n REP(i,500-1) REP(j,500-1) combi[i+1][j+1] = (combi[i][j+1]+combi[i][j]) % M;\n int n;\n while(cin>>n,n) {\n double p[n],q[n];\n int a[n], b[n]; \n REP(i,n) {\n cin>>p[i]>>a[i]>>q[i];\n b[a[i]] = i;\n }\n bool visited[n];\n memset(visited,0,sizeof(visited));\n vector<vector<int> > cycle;\n REP(i, n) {\n if (visited[i]) continue;\n int now = i;\n vector<int> tmp;\n do {\n tmp.push_back(now);\n visited[now] = 1;\n now = b[now];\n } while(now!=i);\n cycle.push_back(tmp);\n }\n double ans = 0;\n ll sub = 1;\n REP(i, cycle.size()) {\n int start;\n double mi = INF;\n int tmp = 0;\n REP(j, cycle[i].size()) {\n //cout << mi << \" \" << q[cycle[i][j]] - p[cycle[i][j]] << endl;\n int cc = cycle[i][j];\n if (abs(mi - (1/p[cc] - 1/q[cc])) < EPS) {\n tmp++;\n } else if (mi > 1/p[cc] - 1/q[cc]) {\n mi = 1/p[cc] - 1/q[cc];\n start = j;\n tmp = 1;\n }\n }\n sub = (sub*tmp)%M;\n //cout << \"start = \" << start << endl;\n REP(j, cycle[i].size()) {\n //cout << cycle[i][j] << \" \";\n if (start == j) {\n ans += 1.0/p[cycle[i][j]];\n } else {\n ans += 1.0/q[cycle[i][j]];\n }\n }\n }\n vector<int> v;\n REP(i, cycle.size()) {\n v.push_back(cycle[i].size());\n }\n printf(\"%.12f %lld\\n\", ans, (sub*func(v)) % M);\n //cout << ans << \" \" << (sub*func(v)) % M << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1964,
"score_of_the_acc": -0.2128,
"final_rank": 11
},
{
"submission_id": "aoj_1081_332376",
"code_snippet": "#include <string> \n#include <algorithm> \n#include <cfloat> \n#include <climits> \n#include <cmath> \n#include <complex> \n#include <cstdio> \n#include <cstdlib> \n#include <cstring> \n#include <functional> \n#include <iostream> \n#include <map> \n#include <memory> \n#include <queue> \n#include <set> \n#include <sstream> \n#include <stack> \n#include <utility> \n#include <vector> \n\n#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define ALL(x) (x).begin(),(x).end() \ntypedef long long ll;\nusing namespace std; \nconst double eps = 1e-12;\n\nconst int MAX_N = 110;\nconst ll DIV = 100000007;\n\nint n, id[MAX_N];\ndouble p[MAX_N], w[MAX_N];\nbool visited[MAX_N];\nint comb[MAX_N][MAX_N];\n\nvoid label(int v, vector<int> &t){\n if(visited[v]) return;\n visited[v] = true;\n t.push_back(v);\n label(id[v], t);\n}\nvoid solve(){\n for(int i = 0; i < n; ++i){\n p[i] = 1 / p[i]; w[i] = 1 / w[i];\n }\n double ex = 0.0;\n ll way = 1;\n int m = 0;\n memset(visited, 0, sizeof(visited));\n vector<vector<int> > v;\n for(int i = 0; i < n; ++i){\n if(visited[i]) continue;\n vector<int> tv;\n label(i, tv);\n v.push_back(tv);\n way = (way * comb[m + tv.size()][m]) % DIV;\n m += tv.size();\n }\n EACH(i, v){\n double sum = 0.0;\n double diff = DBL_MAX;\n int cnt = 0;\n EACH(j, *i){\n int idx = *j;\n sum += w[idx];\n if(p[idx] - w[idx] < diff - eps){\n diff = p[idx] - w[idx];\n cnt = 1;\n }\n else if(abs(p[idx] - w[idx] - diff) < eps){\n ++cnt;\n }\n }\n ex += sum + diff;\n way = (way * cnt) % DIV;\n }\n printf(\"%.11lf %d\\n\", ex, way);\n}\nint init(){\n memset(comb, 0, sizeof(comb));\n for(int i = 0; i < MAX_N; ++i){\n comb[i][0] = 1;\n for(int j = 1; j <= i; ++j)\n comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) % DIV;\n }\n}\nint main(){\n init();\n while(scanf(\"%d\", &n), n){\n for(int i = 0; i < n; ++i){\n scanf(\"%lf%d%lf\", &p[i], &id[i], &w[i]);\n }\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1081_279637",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<stack>\n#include<map>\n#include<set>\n#include<queue>\n#include<cstdio>\n#include<climits>\n#include<cmath>\n#include<cstring>\n#include<string>\n#include<sstream>\n#include<numeric>\n#include<cassert>\n\n#define f first\n#define s second\n#define mp make_pair\n\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n#define rep(i,s,n) for(int i=(s); i<(int)(n); i++)\n#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)\n#define ALL(c) (c).begin(), (c).end()\n#define IN(x,s,g) ((x) >= (s) && (x) < (g))\n#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))\n#define print(x) printf(\"%d\\n\",x)\n\nusing namespace std;\n\ntypedef unsigned int uint;\ntypedef long long ll;\n\nconst int _dx[] = {0,1,0,-1};\nconst int _dy[] = {-1,0,1,0};\n\nint getInt(){\n int ret = 0,c;\n c = getchar();\n while(!isdigit(c)) c = getchar();\n while(isdigit(c)){\n ret *= 10;\n ret += c - '0';\n c = getchar();\n }\n return ret;\n}\n\nint id[100];\nlong double p[100];\nlong double w[100];\nbool flag[100];\nint cmb[101][101];\n\nlong double kitai(long double prob){\n if(prob == 1.0) return 1.0;\n return 1.0 / prob;\n}\n\nint main(){\n int n;\n\n REP(i, 101){\n cmb[i][0] = cmb[i][i] = 1;\n for(int j = 1; j < i; j++)\n cmb[i][j] = (cmb[i-1][j-1] + cmb[i-1][j]) % 100000007;\n }\n\n while(scanf(\"%d\", &n), n){\n int cnt = 1;\n int sum = 0;\n long double ans = 0.0;\n\n REP(i,n) cin >> p[i] >> id[i] >> w[i];\n REP(i,n) flag[i] = false;\n REP(i,n) if(!flag[i]){\n int ii = i;\n int c = 0;\n\n long double maxp = 0.0;\n int pcnt = 0;\n\n while(!flag[ii]){\n long double tmp = 0.0;\n for(int now = ii; ; now = id[now]){\n if(id[now] == ii){\n tmp += kitai(p[now]);\n break;\n }else{\n tmp += kitai(w[now]);\n }\n }\n#define ABS(x) ((x) < 0 ? -(x) : (x))\n if(maxp == 0.0 || maxp - 1e-11 > tmp){\n maxp = tmp;\n pcnt = 1;\n }else if(ABS(maxp - tmp) < 1e-11){\n pcnt++;\n }\n\n flag[ii] = true;\n ii = id[ii];\n c++;\n }\n cnt = (cnt * (long long)cmb[sum + c][c]) % 100000007;\n cnt = (cnt * (long long)pcnt) % 100000007;\n sum = sum + c;\n ans += maxp;\n }\n printf(\"%.11f %d\\n\", (double)ans, cnt);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1060,
"score_of_the_acc": -0.1329,
"final_rank": 8
},
{
"submission_id": "aoj_1081_276034",
"code_snippet": "#include<cmath>\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst ll M=100000007;\nconst double EPS=1e-9;\n\nll xgcd(ll a,ll b,ll &x,ll &y){\n\tif(b==0){ x=1; y=0; return a; }\n\tll g=xgcd(b,a%b,y,x); y-=a/b*x;\n\treturn g;\n}\n\nll modinv(ll a,ll m){\n\tll x,y;\n\tif(xgcd(a,m,x,y)==1) return (x+m)%m;\n\treturn -1;\n}\n\nint n,id[100];\ndouble p[100],w[100];\n\nbool vis[100];\n\nvoid dfs1(int u,vector<int> &cyc){\n\tif(vis[u]) return;\n\tvis[u]=true;\n\tcyc.push_back(u);\n\tdfs1(id[u],cyc);\n}\n\ndouble dfs2(int u,bool first){\n\tif(vis[u]) return 0;\n\tvis[u]=true;\n\treturn 1/(first?p[u]:w[u])+dfs2(id[u],false);\n}\n\nint main(){\n\tll fact[101]={1},factinv[101]={1};\n\trep(i,100){\n\t\tfact[i+1]=(i+1)*fact[i]%M;\n\t\tfactinv[i+1]=modinv(i+1,M)*factinv[i]%M;\n\t}\n\n\tfor(;scanf(\"%d\",&n),n;){\n\t\trep(u,n) scanf(\"%lf%d%lf\",p+u,id+u,w+u);\n\n\t\tint m=0;\n\t\tvector<int> cyc[100];\n\t\tfill(vis,vis+n,false);\n\t\trep(u,n) if(!vis[u]) dfs1(u,cyc[m++]);\n\n\t\tdouble ans=0;\n\t\tll ans2=fact[n];\n\t\trep(i,m){\n\t\t\tdouble ex=1e70;\n\t\t\tll cnt=0;\n\t\t\trep(j,cyc[i].size()){\n\t\t\t\tfill(vis,vis+n,false);\n\t\t\t\tdouble tmp=dfs2(cyc[i][j],true);\n\t\t\t\tif(tmp<ex-EPS){\n\t\t\t\t\tex=tmp;\n\t\t\t\t\tcnt=1;\n\t\t\t\t}\n\t\t\t\telse if(abs(ex-tmp)<EPS){\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans+=ex;\n\t\t\tans2=ans2*cnt%M;\n\t\t\tans2=ans2*factinv[cyc[i].size()]%M;\n\t\t}\n\t\tprintf(\"%.11f %ld\\n\",ans,ans2);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1081_272564",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <climits>\n#include <cmath>\n#include <ctime>\n#include <cassert>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <iomanip>\n#include <complex>\n#include <string>\n#include <vector>\n#include <list>\n#include <deque>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <bitset>\n#include <iterator>\n#include <functional>\n#include <utility>\n#include <algorithm>\n#include <numeric>\n#include <typeinfo>\n\nusing namespace std;\n\n#define dump(n) cerr<<\"# \"<<#n<<\"=\"<<(n)<<endl\n#define repi(i,a,b) for(int i=int(a);i<int(b);i++)\n#define rep(i,n) repi(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 allof(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<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\n\nconst int MOD=100000007;\n\nint memo[200][200];\nint combi(int n,int r)\n{\n\tif(memo[n][r]!=-1) return memo[n][r];\n\tif(r==0 || r==n) return memo[n][r]=1;\n\telse return memo[n][r]=(combi(n-1,r-1)+combi(n-1,r))%MOD;\n}\n\nvoid solve(vd& ps,vi& ids,vd& ws)\n{\n\tint n=ps.size();\n\tvi flg(n);\n\tvvi loops;\n\trep(i,n){\n\t\tif(flg[i]) continue;\n\t\tflg[i]=1;\n\t\tloops.push_back(vi(1,i));\n\t\tfor(int j=ids[i];j!=i;j=ids[j]){\n\t\t\tflg[j]=1;\n\t\t\tloops.back().push_back(j);\n\t\t}\n\t}\n\t\n\tvd es(loops.size(),INT_MAX);\n\tvi cands(loops.size());\n\trep(i,loops.size()){\n\t\tdouble temp=0;\n\t\trep(j,loops[i].size())\n\t\t\ttemp+=1.0/ws[loops[i][j]];\n\t\tvd diffs(loops[i].size());\n\t\trep(j,loops[i].size())\n\t\t\tdiffs[j]=-1/ws[loops[i][j]]+1/ps[loops[i][j]];\n\t\trep(j,loops[i].size())\n\t\t\tes[i]=min(es[i],temp+diffs[j]);\n\t\t\n\t\tsort(allof(diffs));\n\t\trep(j,diffs.size())\n\t\t\tcands[i]+=abs(diffs[j]-diffs[0])<1e-10;\n\t}\n\t\n\tdouble rese=accumulate(allof(es),0.0);\n\tint resp=1;\n\tfor(int i=n,j=0;j<loops.size();i-=loops[j].size(),j++)\n\t\tresp=((ll)resp*combi(i,loops[j].size())*cands[j])%MOD;\n\tprintf(\"%.10f %d\\n\",rese,resp);\n}\n\nint main()\n{\n\tmemset(memo,-1,sizeof(memo));\n\t\n\tfor(int n;cin>>n,n;){\n\t\tvi ids(n);\n\t\tvd ps(n),ws(n);\n\t\trep(i,n)\n\t\t\tcin>>ps[i]>>ids[i]>>ws[i];\n\t\tsolve(ps,ids,ws);\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1148,
"score_of_the_acc": -0.1407,
"final_rank": 9
},
{
"submission_id": "aoj_1081_271858",
"code_snippet": "#include<cstdio>\n#include<cmath>\n#include<vector>\nusing namespace std;\n\nint main(){\n int n;\n int id[100];\n double p[100],w[100];\n bool use[100];\n long long int pas[101][101];\n \n for(int i=0;i<=100;i++){\n pas[i][0] = 1;\n pas[0][i] = 1;\n }\n\n for(int i=1;i<=100;i++){\n for(int j=1;j<=100;j++)pas[i][j] = (pas[i-1][j] + pas[i][j-1]) % 100000007;\n }\n \n for(;;){\n scanf(\"%d\",&n);\n if(!n)break;\n\n for(int i=0;i<n;i++){\n scanf(\"%lf %d %lf\",&p[i],&id[i],&w[i]);\n use[i] = false;\n }\n\n double ans = 0.0;\n int rem = n;\n long long int t = 1;\n for(int i=0;i<n;i++){\n if(!use[i]){\n\tuse[i] = true;\n\tint tmp = i;\n\tvector<int> l;\n\n\tl.push_back(tmp);\n\tfor(;;){\n\t tmp = id[tmp];\n\t if(tmp==i)break;\n\t use[tmp] = true;\n\t l.push_back(tmp);\n\t}\n\n\tint num = 1;\n\tdouble m = 1.0/p[l[0]] - 1.0/w[l[0]];\n\tans += 1.0/w[l[0]];\n\tfor(int j=1;j<(int)l.size();j++){\n\t ans += 1.0/w[l[j]];\n\t double tmp = 1.0/p[l[j]] - 1.0/w[l[j]];\n\t if(abs(m-tmp)<1e-10){\n\t num++;\n\t }else if(m > tmp){\n\t m = tmp;\n\t num = 1;\n\t }\n\t}\n\tans += m;\n\tt = (t * num) % 100000007;\n\trem -= l.size();\n\tt = (t * pas[rem][(int)l.size()]) % 100000007;\n }\n }\n printf(\"%.11lf %lld\\n\",ans,t);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1081_271857",
"code_snippet": "#include<cstdio>\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nint main(){\n int n;\n int id[100];\n double p[100],w[100];\n bool use[100];\n long long int pascal[101][101];\n\n for(int i=0;i<=100;i++){\n pascal[i][0] = 1;\n pascal[0][i] = 1;\n }\n\n for(int i=1;i<=100;i++){\n for(int j=1;j<=100;j++)pascal[i][j] = (pascal[i-1][j] + pascal[i][j-1]) % 100000007;\n }\n \n for(;;){\n scanf(\"%d\",&n);\n if(!n)break;\n\n for(int i=0;i<n;i++){\n scanf(\"%lf %d %lf\",&p[i],&id[i],&w[i]);\n use[i] = false;\n }\n\n double ans = 0.0;\n int rem = n;\n long long int pattern = 1;\n for(int i=0;i<n;i++){\n if(!use[i]){\n\tuse[i] = true;\n\tint tmp = i;\n\tvector<int> loop;\n\n\tloop.push_back(tmp);\n\tfor(;;){\n\t tmp = id[tmp];\n\t if(tmp==i)break;\n\t use[tmp] = true;\n\t loop.push_back(tmp);\n\t}\n\n\tint num = 1;\n\tdouble m = 1.0/p[loop[0]] - 1.0/w[loop[0]];\n\tans += 1.0/w[loop[0]];\n\tfor(int j=1;j<(int)loop.size();j++){\n\t ans += 1.0/w[loop[j]];\n\t if(abs(m-1.0/p[loop[j]] + 1.0/w[loop[j]])<1e-10){\n\t num++;\n\t }else if(m > 1.0/p[loop[j]] - 1.0/w[loop[j]]){\n\t m = 1.0/p[loop[j]] - 1.0/w[loop[j]];\n\t num = 1;\n\t }\n\t}\n\tans += m;\n\tpattern = (pattern * num) % 100000007;\n\t//cout << rem << \" \" << loop.size() << \" \" << pascal[rem-(int)loop.size()][loop.size()] << endl;\n\trem -= loop.size();\n\tpattern = (pattern * pascal[rem][(int)loop.size()]) % 100000007;\n }\n }\n printf(\"%.11lf %lld\\n\",ans,pattern);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1081_271763",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <cstdio>\n#include <cmath>\n#include <map>\nusing namespace std;\n\ntypedef long long lli;\nconst int MAX_N = 101;\nconst int M = 100000007;\nconst double eps = 1e-9;\nint N;\ndouble P[MAX_N], W[MAX_N];\nint G[MAX_N];\nbool vis[MAX_N];\nvector<vector<int> > Grp;\nint comb[101][101];\n\nbool equals(double a, double b) {\n return fabs(a-b) < eps;\n}\n\nvoid dfs(int p, vector<int> &v) {\n v.push_back(p);\n vis[p] = true;\n if(vis[G[p]]) return;\n dfs(G[p],v);\n}\n\nvoid makeComb() {\n comb[0][0] = 1;\n for(int i = 1; i <= 100; ++i) {\n comb[i][0] = 1;\n for(int j = 1; j < i; ++j) {\n comb[i][j] = (comb[i-1][j-1] + comb[i-1][j])%M;\n }\n comb[i][i] = 1;\n }\n}\n\nvoid make() {\n fill(vis, vis+N, false);\n Grp.clear();\n for(int i = 0; i < N; ++i) {\n if(vis[i]) continue;\n vector<int> v;\n dfs(i, v);\n Grp.push_back(v);\n }\n}\n\npair<double, int> calc(int g) {\n vector<int> &v = Grp[g];\n double minCost = -1;\n int cnt = 0;\n for(int i = 0; i < v.size(); ++i) {\n double cost = 1.0/P[v[i]];\n int p = G[v[i]];\n while(p != v[i]) {\n cost += 1.0/W[p];\n p = G[p];\n }\n if(equals(minCost, cost)) {\n ++cnt;\n } else if(minCost == -1 || cost < minCost) {\n cnt = 1;\n minCost = cost;\n }\n }\n return make_pair(minCost, cnt);\n}\n\nvoid solve() {\n make();\n int c = 1;\n int u = N;\n for(int i = 0; i < Grp.size(); ++i) {\n c = (lli)c*comb[u][Grp[i].size()]%M;\n u -= Grp[i].size();\n }\n double time = 0;\n for(int i = 0; i < Grp.size(); ++i) {\n pair<double, int> p = calc(i);\n time += p.first;\n c = (lli)c*p.second%M;\n }\n printf(\"%.12f %d\\n\", time, c);\n}\n\nint main() {\n makeComb();\n while(cin >> N && N) {\n for(int i = 0; i < N; ++i) {\n int p;\n cin >> P[i] >> p >> W[i];\n G[p] = i;\n }\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1028,
"score_of_the_acc": -0.1301,
"final_rank": 7
},
{
"submission_id": "aoj_1081_271457",
"code_snippet": "#include <stdio.h>\n#include <iostream>\n#include <vector>\n#include <list>\n#include <cmath>\n#include <fstream>\n#include <algorithm>\n#include <string>\n#include <queue>\n#include <set>\n#include <map>\n#include <complex>\n#include <iterator>\n#include <cstdlib>\n#include <cstring>\n#include <sstream>\n\nusing namespace std;\n\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()))\n\ntypedef complex<double> P;\ntypedef long long ll;\n\nconst double INF=10000000000.0;\n// »ê¼êÌm[hÔÉJÚÅ«éGbWª é©Ç¤©\ndouble p[101][101],w[101][101];\nbool passed[101];\nvector<int> d[101];\n\nint thisNode;\nint cnt;\ndouble minCost=INF;\n\nconst ll MOD=100000007;\n\nll dp[101][101];\nll cmb(int a,int b){\n if(dp[a][b]!=INF)\n return dp[a][b];\n if(a==b)\n return 1;\n if(b==1)\n return dp[a][b]=a;\n return dp[a][b]=((cmb(a-1,b)+cmb(a-1,b-1))%MOD);\n}\n\n// AÈOtð쬵A»ÌOtÅÇÌ|µûªàÁÆàø¦ªÇ¢©ðvZ·é\nvoid dfs(int s,bool start,vector<pair<double,double> > costs){\n // êüµÄ«½çAvZ\n if(passed[s]){\n thisNode=costs.size();\n // DZÌêðÅÉÆé©Åêí¯\n double sum=0;\n for(int i = 0; i < costs.size(); i++)\n sum+=costs[i].second;\n for(int i = 0; i < costs.size(); i++){\n // ÅÌêðè\n double ss=sum-costs[i].second+costs[i].first;\n // ±ÌRXgªÅ¬RXgðXVÅ«é©Ç¤©\n if(!EQ(minCost,ss)&&minCost>ss){\n minCost=ss;\n cnt=1;\n }\n else if(EQ(minCost,ss))\n cnt++;\n }\n return;\n }\n passed[s]=true;\n for(int i = 0; i < d[s].size(); i++){\n int to=d[s][i];\n costs.push_back(make_pair(p[s][to],w[s][to]));\n dfs(to,false,costs);\n }\n}\n\nvoid solve(){\n\n int n;\n for(int i=0;i<101;i++)\n for(int j=0;j<101;j++)\n dp[i][j]=INF;\n // ll tmp=(ll)(cmb(100,50)+EPS)%MOD;\n\n while(cin>>n&&n!=0){\n for(int i = 0; i < 101; i++){\n d[i].clear();\n for(int j = 0; j < 101; j++)\n p[i][j]=w[i][j]=INF;\n }\n\n for(int i = 0; i < n; i++){\n double pp,ww;\n int id;\n cin>>pp>>id>>ww;\n p[id][i]=1.0/pp;w[id][i]=1.0/ww;\n // ¹ðÇÁ\n d[id].push_back(i);\n }\n // OtðAÈà̲Æɵ¤\n // »ê¼êªÉεÄàÁÆàúÒl̬³¢|µûðvZ·é\n // ൯¶lðÂà̪ êÎAL¯µÄ¨\n memset(passed,0,sizeof(passed));\n int leftNode=n;\n ll mul=1;\n double SumOfminCost=0;\n for(int i = 0; i < n; i++){\n cnt=0;\n if(passed[i])\n continue;\n minCost=INF;\n thisNode=0;\n dfs(i,true,vector<pair<double,double> >());\n // cntÉÅRXgÌæèûªAüÁÄ¢éÌÅA»ê੯é\n ll tmp=cmb(leftNode,thisNode);\n leftNode-=thisNode;\n mul*=cnt*tmp;\n mul%=MOD;\n SumOfminCost+=minCost;\n }\n mul%=MOD;\n //cout<<SumOfminCost<<\" \"<<mul<<endl;\n printf(\"%.10f %d\\n\",SumOfminCost,(int)mul);\n }\n}\nint main(){\n\n solve();\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1360,
"score_of_the_acc": -0.1986,
"final_rank": 10
}
] |
aoj_1083_cpp
|
Problem J: The Incubator
サラリーマンの朝は早い。エリートコースを進み一流企業に入社して新人という肩書きからも卒業する頃、僕に下った辞令は未開の惑星における営業活動だった。辺鄙な土地での不便な生活を強いられているが、一応は左遷でなく栄転であり、その証拠に給料もぐんと上がっている - こんな場所では金なんて使いようもないのだけど。近年僕たちが直面している宇宙規模のエネルギー不足に対応するため、特定の生物種の個体から莫大なエネルギーを生成するテクノロジーが開発された。その特定の生物種というのが、この辺鄙な惑星の固有種なのだ。この生物が絶滅しないように保護しつつ、適度にエネルギーを回収していくのが僕の仕事だ。
エネルギーの回収は、いくつかのステップからなる。まずは、エネルギーの回収に使用する個体を選別する。個体によって得られるエネルギーの量は大きく異なるのだ。次に、選別された見込みのある個体に、インキュベーションという特別な処理を行う。インキュベートされた個体は膨大なエネルギーの源となる何かをを絶えず蓄えたり吐き出したりするので、個体にできるだけ多くのエネルギーの源となる何かが蓄えられている瞬間を狙って、円環の理に導く。するとお待ちかねのエネルギーが手に入る、という仕組みだ。
エリートサラリーマンに課せられるノルマは厳しい。しかし、僕にとって数十万のインキュベートされた個体を管理するのは朝飯前だ。今日は月末なので本社に月報を提出しなければならないが、今月はとても良い個体に遭遇したこともあって、過去最高の成績になりそうだ。
と喜んでいたのも束の間、最後の最後でひどいミスをやらかしてしまった。SQL文を打ち間違えて、今月の成果を記録しているデータベースのテーブル 1 つをまるごとふっ飛ばしてしまったのだ。あれがなければ、今月の成果は全く無しということになってしまう。降格、左遷、あるいは解雇もありえるかもしれない。
最後の頼みの綱は、作業のたびにこまめにつけていたログファイルだ。僕はいつも、個体をインキュベートするたびに一意な整数の番号を振り、インキュベートされた個体たちの番号を 1 つの配列に保存している。僕の営業活動は、次のような行動からなる。
個体をインキュベートし、その個体に番号 x を割り当て、その個体の番号を配列の末尾に追加する。
配列の n 番目の番号が示す個体を円環の理に導く。
番号 x の個体を円環の理に導く。
残念ながら僕は最大
lim
体の個体しか管理できない。個体をインキュベートしたとき、もしインキュベート済みの個体が
lim
を超えたならば、昔にインキュベートした個体から順に
lim
以下になるまで円環の理に導く。
僕はこれら 4 つの営業活動を行うたびに、欠かさずログファイルに記入している。しかし、4 の活動だけはログファイルに一切記入していない。そうしても特に曖昧なところは残らないためだ。
いつも僕は、個体の番号の配列の操作を愚直に行なっている。しかし今度ばかりは、愚直に操作しながらログファイルを走査していては間に合いそうにない。月報の提出期限は 5 時間後に迫っている。
そこで、君たちにお願いがあるんだ。ログファイルから僕の営業活動を再現するプログラムを書いてほしい。もし書いてくれたら、お礼に君たちの願い事を何でも 1 つ叶えてあげよう。何だって構わない。どんな願いことだって叶えてあげられるよ。
Input
入力は複数のケースからなる。
各ケースは以下のフォーマットで与えられる。
ここには入力のフォーマットを書く。
q
lim
query
0
x
0
.
.
.
query
q-1
x
q-1
query
i
が0の時、インキュベートした個体に
x
i
の番号を割り当てたことを表す。
query
i
が1の時、配列の
x
i
番目の番号が示す個体を円環の理に導く。
query
i
が2の時、その時点で配列に含まれている中で
x
i
番目の個体の番号を出力する
query
i
が3の時、番号が
x
i
の個体を円環の理に導く。
q
= 0 かつ
lim
= 0の時入力の終わりを表す。
lim
は32bit signed integerで表すことができる正の整数である。
すべてのクエリーについて、
x
i
は0以上の整数で32bit signed integerで表すことができる。
0のクエリーについて、
x
i
は32bit signed integerの範囲に収まる非負整数で表される。
1,2のクエリーについて、
x
i
の値は1以上の整数である。また存在しない配列の番号が指定されることはない
3のクエリーについて、存在しない個体番号が入力に含まれることはない。
また一度消去された個体の番号が値が同じテストケース内で、別の個体に割り当てられることはない。
ジャッジデータは次の2つのうち少なくとも片方を満たす。
1 ≤ q ≤ 400,000 かつテストケースの数が5個以下
1 ≤ q ≤ 10,000 かつテストケースの数は50個以下
Output
入力のクエリーが2の場合、x番目の個体番号を出力する
各ケースの最後には"end"を出力する
Sample input
22 5
0 0
0 1
0 2
0 3
0 4
2 1
2 2
2 3
2 4
2 5
0 5
2 1
0 6
2 2
3 3
2 2
2 2
1 2
2 2
2 1
2 2
2 3
30 5
0 383594529
1 1
0 868094164
0 708344471
0 4102559
0 944076771
0 320398558
1 1
0 949521499
0 1035499529
0 585547493
0 915496840
0 721553343
0 405934659
0 814301872
1 1
2 3
0 919753364
1 1
0 69231610
2 2
0 373477673
0 842917649
0 961543702
0 907959899
2 1
2 2
2 3
2 4
2 5
30 5
0 726736645
0 1
0 344304573
0 241734870
3 726736645
1 3
2 1
0 586879203
2 3
0 511883046
0 481344051
0 154183395
0 435126242
0 185906768
1 1
0 383123551
0 20253038
1 5
2 1
2 2
0 163044554
3 435126242
0 105612613
0 725050544
0 559442328
2 1
2 2
2 3
2 4
2 5
0 0
Sample output
0
1
2
3
4
1
3
4
4
5
2
5
6
end
405934659
405934659
69231610
373477673
842917649
961543702
907959899
end
1
586879203
154183395
435126242
383123551
163044554
105
...(truncated)
|
[
{
"submission_id": "aoj_1083_3911977",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include<bits/stdc++.h>\nusing namespace::std;\nstruct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;\n// random_device rd;\n// mt19937 mt(rd());\n// #include <boost/numeric/interval.hpp>\n// #include <boost/numeric/interval/io.hpp>\n// #include <boost/intrusive/rbtree.hpp>\n// #include <boost/geometry.hpp>\n// #include <boost/geometry/geometries/linestring.hpp>\n// #include <boost/geometry/geometries/polygon.hpp>\n// #include <boost/geometry/geometries/point_xy.hpp>\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// typedef mp::number<mp::cpp_dec_float<0>> cfloat;\n// typedef mp::cpp_int cint;\n\n#include<ext/pb_ds/assoc_container.hpp>\n#include<ext/pb_ds/tree_policy.hpp>\n#include <ext/pb_ds/priority_queue.hpp>\n#include<ext/pb_ds/tag_and_trait.hpp>\nusing namespace __gnu_pbds;\ntemplate<typename T=long long>using pbds=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;\ntemplate<typename T=long long>using pqueue =__gnu_pbds::priority_queue<T, less<T>,rc_binomial_heap_tag>;\ntypedef long long lint;\ntypedef long long ll;\ntypedef long double ldouble;\ntypedef vector<lint> vec;\ntypedef vector<vector<lint>> mat;\ntypedef vector<vector<vector<lint>>> mat3;\ntypedef vector<double> dvec;\ntypedef vector<vector<double>> dmat;\ntypedef vector<vector<vector<double>>> dmat3;\ntypedef vector<string> svec;\ntypedef vector<vector<string>> smat;\ntypedef vector<vector<vector<string>>> smat3;\ntypedef vector<pair<lint,lint>> pvec;\ntypedef vector<vector<pair<lint,lint>>> pmat;\ntypedef vector<vector<vector<pair<lint,lint>>>> pmat3;\n#define rep(i, n) for(lint i = 0; i < (lint)(n); i++)\n#define irep(i) for(lint i = 0;; i++)\n#define irep1(i) for(lint i = 1;; i++)\n#define irep2(i) for(lint i = 2;; i++)\n#define rrep(i, n) for(lint i = (lint)(n-1); i >-1; i--)\n#define rrepi(i,a,b) for(lint i = (lint)(b-1); i >a-1; i--)\n#define repi(i,a,b) for(lint i=lint(a);i<lint(b);i++)\n#define rep2(i,a,b,c) for(lint i=lint(a);i>lint(b);i+=c)\n#define all(x) (x).begin(),(x).end()\n//#define PI 3.141592653589793\n#define dist(x1,y1,x2,y2) (pow(pow(x2-x1,2)+pow(y2-y1,2),0.5))\n#define output(v) do{bool f=0;for(auto i:v){cout<<(f?\" \":\"\");if(i>INF/2)cout<<\"INF\";else cout<<i;f=1;}cout<<\"\\n\";}while(0)\n#define output2(v) for(auto j:v)output(j);\n#define _output(v) do{bool f=0;rep(i,v.size()){cout<<(f?\" \":\"\");if(v[i]>INF/2)cout<<\"INF\";else cout<<v[i];f=1;}cout<<\"\\n\";}while(0)\n#define _output2(v) rep(j,v.size()){_output(v[j]);}\n#define input(a,n) lint n;cin>>n;vector<lint>a(n);rep(i,n)cin>>a[i];\n#define SUM(v) accumulate(all(v),0LL)\n#define INF (1LL<<60)\n#define IINF (1<<30)\n#define EPS (1e-10)\n#define LINF 9223372036854775807\n#define MOD 100000007\n#define endl \"\\n\"\ntemplate<typename T=lint>T in(){return *istream_iterator<T>(cin);}\ninline lint gcd(lint a,lint b){return b?gcd(b,a%b):a;}\ntemplate<typename T=lint>inline T lcm(T a,T b){return a/gcd(a,b)*b;}\ntemplate<typename T=lint>inline T add(T a,T b){return a+b;}\ntemplate<typename T=lint>inline T minq(T a,T b){return min(a,b);}\ninline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}\ninline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}\nvector<lint> dx={-1,1,0,0,1,1,-1,-1};\nvector<lint> dy={0,0,-1,1,1,-1,1,-1};\n\n\n\nint main(){\n while(1){\n pbds<pair<lint,lint>>t;\n lint q,lim;\n cin>>q>>lim;\n if(q==0&&lim==0)break;\n map<lint,lint>log;\n rep(i,q){\n lint que,x;\n cin>>que>>x;\n if(que==0){\n t.insert(make_pair(i,x));\n log.emplace(x,i);\n if((lint)t.size()==lim+1)t.erase(t.begin());\n }\n if(que==1){\n t.erase(t.find_by_order(x-1));\n }\n if(que==2){\n cout<<(*t.find_by_order(x-1)).second<<endl;\n }\n if(que==3){\n t.erase(make_pair(log.at(x),x));\n }\n }\n cout<<\"end\"<<endl;\n }\n\n}",
"accuracy": 1,
"time_ms": 490,
"memory_kb": 32244,
"score_of_the_acc": -0.9461,
"final_rank": 6
},
{
"submission_id": "aoj_1083_3911803",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n// 1-indexed\ntemplate <class T>\nstruct BIT {\n vector<T> lst;\n int treesize;\n // constructor\n BIT(int newn = 0) {\n treesize = newn;\n lst.resize(treesize + 1);\n for(int i = 0; i <= treesize; ++i) lst[i] = 0;\n }\n // a_place += num\n bool add(int place, T num) {\n while(place <= treesize) {\n lst[place] += num;\n place += place & -place;\n }\n return 1;\n }\n // add wide ver.(add num between l and r)\n bool addw(int left, int right, T num) {\n while(left <= right && left >= 1 && right <= treesize)\n add(left++, num);\n return 1;\n }\n // sum between [1,place]\n T calcsum(int place) {\n T answer = 0;\n while(place > 0) {\n answer += lst[place];\n place -= place & -place;\n }\n return answer;\n }\n // sum [l,r]\n T calcsumw(int left, int right) {\n return calcsum(right) - calcsum(left - 1);\n }\n};\n\nstruct data {\n int q, x;\n};\n\nint q, lim;\nvector<int> v;\nBIT<int> bit;\nmap<int, int> mp;\nvector<data> query;\n\nvoid solve();\nint bsearch(int x);\n\nint main() {\n while(1) {\n cin >> q >> lim;\n if(q + lim == 0) break;\n query.resize(q);\n v.assign(1, -1);\n for(int i = 0; i < q; ++i) {\n cin >> query[i].q >> query[i].x;\n if(query[i].q == 0) {\n mp[query[i].x] = v.size();\n v.push_back(query[i].x);\n }\n }\n solve();\n }\n return 0;\n}\n\nvoid solve() {\n int sum = 0;\n bit = BIT<int>(v.size());\n for(int i = 0; i < q; ++i) {\n if(query[i].q == 0) {\n bit.add(mp[query[i].x], 1);\n if(bit.calcsum(v.size()) > lim + sum) ++sum;\n }\n else if(query[i].q == 1)\n bit.add(bsearch(query[i].x + sum), -1);\n else if(query[i].q == 2)\n cout << v[bsearch(query[i].x + sum)] << endl;\n else\n bit.add(mp[query[i].x], -1);\n }\n cout << \"end\" << endl;\n}\n\nint bsearch(int x) {\n int l = 0, r = v.size();\n while(r - l > 1) {\n int now = (l + r) / 2;\n if(bit.calcsum(now) >= x)\n r = now;\n else\n l = now;\n }\n return r;\n}",
"accuracy": 1,
"time_ms": 600,
"memory_kb": 39492,
"score_of_the_acc": -1.1992,
"final_rank": 9
},
{
"submission_id": "aoj_1083_3555663",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define MAX_N (1<<19)+1\n\nclass BIT {\npublic:\n int limit;\n int last;\n map<int, int> m, mrev;\n vector<int> t;\n \n BIT(int l): limit(l), last(0), t(MAX_N, 0) {}\n\n void incubate(int rid) {\n if (t[MAX_N-1] == limit) {\n add(find(1), -1);\n }\n last ++;\n m[last] = rid;\n mrev[rid] = last;\n _add(last, 1);\n }\n\n void add(int rid, int x) {\n _add(mrev[rid], x);\n }\n\n void _add(int id, int x) {\n for (int i=id; i<MAX_N; i+=(i&-i)) {\n t[i] += x;\n }\n }\n\n int sum(int num) {\n int res = 0;\n for (int i=num; i>0; i-=(i&-i)) {\n res += t[i];\n }\n return res;\n }\n\n int find(int num) {\n if (sum(1) == num) {\n return m[1];\n }\n int l = 1, r = MAX_N;\n while (abs(r-l) > 1) {\n int mi = (l+r) / 2;\n if (sum(mi) < num) {\n l = mi;\n } else {\n r = mi;\n }\n }\n return m[l+1];\n }\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n int q, lim;\n while (cin >> q >> lim, (q || lim)) {\n int query, x;\n BIT bit(lim);\n\n for (int i=0; i<q; ++i) {\n cin >> query >> x;\n if (query == 0) {\n bit.incubate(x);\n } else if (query == 1) {\n bit.add(bit.find(x), -1);\n } else if (query == 2) {\n cout << bit.find(x) << endl;\n } else if (query == 3) {\n bit.add(x, -1);\n }\n }\n cout << \"end\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 640,
"memory_kb": 42564,
"score_of_the_acc": -1.3018,
"final_rank": 10
},
{
"submission_id": "aoj_1083_3322354",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n\nstruct SegTree{\n int n;\n vector<int> dat;\n //初期化\n SegTree(int _n){\n n=1;\n while(n<_n) n*=2;\n dat=vector<int>(2*n-1,0);\n }\n\n //k番目(0-indexed)の値をaに変更\n void update(int k, int a){\n k+=n-1;\n dat[k]=a;\n //更新\n while(k>0){\n k=(k-1)/2;\n dat[k]= dat[2*k+1]+dat[2*k+2];\n }\n }\n\n int find(int x){\n int now = 0;\n while(now<n-1){\n if(dat[2*now+1] < x){\n x -= dat[2*now+1];\n now = 2*now + 2;\n }\n else{\n now = 2*now + 1;\n }\n }\n return now - (n-1);\n }\n};\n\nint main(){\n int q,lim;\n while(scanf(\" %d %d\", &q, &lim),q){\n SegTree st(q);\n int idx = 0, num = 0;\n unordered_map<int,int> id2idx;\n vector<int> a;\n\n auto DEL = [&](int p){\n st.update(p,0);\n --num;\n };\n\n rep(i,q){\n int t,x;\n scanf(\" %d %d\", &t, &x);\n\n if(t==0){\n id2idx[x] = idx;\n st.update(idx,1);\n a.pb(x);\n ++idx;\n ++num;\n\n if(num == lim+1) DEL(st.find(1));\n }\n else if(t==1) DEL(st.find(x));\n else if(t==2) printf(\"%d\\n\",a[st.find(x)]);\n else DEL(id2idx[x]);\n }\n printf(\"end\\n\");\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 25296,
"score_of_the_acc": -0.5744,
"final_rank": 2
},
{
"submission_id": "aoj_1083_2826200",
"code_snippet": "#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = double;\nconst ld eps = 1e-9;\n//\n//using Graph = vector<vector<int>>;\n//\n//int dfs(const Graph&g, const int now, vector<int>&ch_cnts) {\n// ch_cnts[now]++;\n// for (auto&& e : g[now]) {\n// ch_cnts[now] += dfs(g, e, ch_cnts);\n// }\n// return ch_cnts[now];\n//}\n//\n//struct HL_Edge {\n// int from;\n// int to;\n// bool heavy;\n//};\n//\n//void dfs2(const Graph&g, vector<vector<HL_Edge>>&hl_tree, const int now, const vector<int>&ch_cnts) {\n//\n// int max_ch_id = 1;\n// {\n// int max_ch_num = -1;\n// for (auto&&e : g[now]) {\n// if (max_ch_num < ch_cnts[e]) {\n// max_ch_num = ch_cnts[e];\n// max_ch_id = e;\n// }\n// }\n// }\n// for (auto e : g[now]) {\n// bool heavy = (e == max_ch_id);\n//\n// hl_tree[now].push_back(HL_Edge{ now,e,heavy });\n// }\n// return;\n//}\n//\n//void HL(const vector<vector<int>>&ro_tree) {\n// vector<int>ch_cnts(ro_tree.size());\n//\n// dfs(ro_tree, 0, ch_cnts);\n//\n// vector<vector<HL_Edge>>hl_tree(ro_tree.size());\n//\n// dfs2(ro_tree, hl_tree, 0, ch_cnts);\n//}\n//\n//namespace FastFourierTransform\n//{\n// using C = complex< double >;\n//\n// void DiscreteFourierTransform(vector< C > &F, bool rev)\n// {\n// const int N = (int)F.size();\n// const double PI = (rev ? -1 : 1) * acos(-1);\n// for (int i = 0, j = 1; j + 1 < N; j++) {\n// for (int k = N >> 1; k > (i ^= k); k >>= 1);\n// if (i > j) swap(F[i], F[j]);\n// }\n// C w, s, t;\n// for (int i = 1; i < N; i <<= 1) {\n// for (int k = 0; k < i; k++) {\n// w = polar(1.0, PI / i * k);\n// for (int j = 0; j < N; j += i * 2) {\n// s = F[j + k];\n// t = C(F[j + k + i].real() * w.real() - F[j + k + i].imag() * w.imag(),\n// F[j + k + i].real() * w.imag() + F[j + k + i].imag() * w.real());\n// F[j + k] = s + t, F[j + k + i] = s - t;\n// }\n// }\n// }\n// if (rev) for (int i = 0; i < N; i++) F[i] /= N;\n// }\n//\n// vector< int> Multiply(const vector<int > &A, const vector<int > &B)\n// {\n// int sz = 1;\n// while (sz <= A.size() + B.size()) sz <<= 1;\n// vector< C > F(sz), G(sz);\n// for (int i = 0; i < A.size(); i++) F[i] = A[i];\n// for (int i = 0; i < B.size(); i++) G[i] = B[i];\n// DiscreteFourierTransform(F, false);\n// DiscreteFourierTransform(G, false);\n// for (int i = 0; i < sz; i++) F[i] *= G[i];\n// DiscreteFourierTransform(F, true);\n// vector< int > X(A.size() + B.size() - 1);\n// for (int i = 0; i < A.size() + B.size() - 1; i++) X[i] = F[i].real() + 0.5;\n// return (X);\n// }\n//};\n\n#define Seg_Max_N (1<<19) \n\nusing Value = int;\nconst Value ini = 0;\nstruct segtree {\n\tint N;\n\tvector<Value>dat;\n\n\tsegtree() {}\n\tsegtree(int n) :dat(2 * Seg_Max_N) {\n\t\tN = 1;\n\t\twhile (N < n) N *= 2;\n\t\tfor (int i = 0; i < 2 * N - 1; i++) {\n\t\t\tdat[i] = ini;\n\t\t}\n\t}\n\tValue connect(const Value&l, const Value&r) {\n\t\treturn l+r;\n\t}\n\t// update k th element\n\tvoid update(int k, Value a) {\n\t\tk += N - 1;\n\t\tdat[k] = a;\n\n\t\twhile (k > 0) {\n\t\t\tk = (k - 1) / 2;\n\t\t\tconst Value al(dat[k * 2 + 1]);\n\t\t\tconst Value ar(dat[k * 2 + 2]);\n\t\t\tdat[k] = connect(al, ar);\n\t\t}\n\t}\n\t// min [a, b)\n\tValue query(int a, int b) { return query(a, b, 0, 0, N); }\n\tValue query(int a, int b, int k, int l, int r) {\n\t\tif (r <= a or b <= l) return ini;\n\t\tif (a <= l and r <= b) return dat[k];\n\t\tconst int m = (l + r) / 2;\n\t\tconst Value al(query(a, b, k * 2 + 1, l, m));\n\t\tconst Value ar(query(a, b, k * 2 + 2, m, r));\n\t\treturn connect(al, ar);\n\t}\n};\n\n\nint main() {\n\twhile (true) {\n\t\tint Q,LIM;cin>>Q>>LIM;\n\t\tif(!Q)break;\n\n\t\tvector<int>nums;\n\t\tmap<int,int>mp;\n\t\tsegtree tree(4e5);\n\n\t\tint nl=0;\n\t\tint sum=0;\n\t\twhile (Q--) {\n\t\t\tint a,x;cin>>a>>x;\n\t\t\tif (a == 0) {\n\t\t\t\tnums.push_back(x);\n\t\t\t\ttree.update(nums.size()-1,1);\n\t\t\t\tmp[x]=nums.size()-1;\n\n\t\t\t\tsum++;\n\n\t\t\t\tif (sum > LIM) {\n\t\t\t\t\twhile (true) {\n\t\t\t\t\t\tif (tree.query(nl, nl + 1) == 1) {\n\t\t\t\t\t\t\ttree.update(nl, 0);\n\t\t\t\t\t\t\tnl++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tnl++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tsum--;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\telse if (a == 1) {\n\t\t\t\tint minr=0;\n\t\t\t\tint maxr=nums.size();\n\n\t\t\t\twhile (minr + 1 != maxr) {\n\t\t\t\t\tint midr((minr+maxr+1)/2);\n\t\t\t\t\tif (tree.query(0, midr) >= x) {\n\t\t\t\t\t\tmaxr=midr;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tminr=midr;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttree.update(maxr-1,0);\n\t\t\t\tsum--;\n\t\t\t}\n\t\t\telse if (a == 3) {\n\t\t\t\tassert(tree.query(mp[x],mp[x]+1)==1);\n\t\t\t\ttree.update(mp[x],0);\n\t\t\t\tsum--;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tint minr = 0;\n\t\t\t\tint maxr = nums.size();\n\n\t\t\t\twhile (minr + 1 != maxr) {\n\t\t\t\t\tint midr((minr + maxr + 1) / 2);\n\t\t\t\t\tif (tree.query(0, midr) >= x) {\n\t\t\t\t\t\tmaxr = midr;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tminr = midr;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcout<<nums[maxr-1]<<endl;\n\t\t\t}\n\t\t}\n\t\tcout<<\"end\"<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 680,
"memory_kb": 27260,
"score_of_the_acc": -0.9578,
"final_rank": 7
},
{
"submission_id": "aoj_1083_2714119",
"code_snippet": "#include <algorithm>\n#include <cassert>\n#include <climits>\n#include <cmath>\n#include <iostream>\n#include <unordered_map>\n#include <queue>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef pair<int, int> ipair;\ntypedef tuple<int, int, int> ituple;\n\n// const int INF = INT_MAX;\n// const ll INF = LLONG_MAX;\n// const int MOD = ((int)1e9 + 7);\n// const ld EPS = (1e-10);\n#define PI acosl(-1)\n#define MAX_N (500000)\n\nclass BitSum{\nprotected:\n static const int max_value = 500000 + 2;\n ll bit[max_value + 1];\n\npublic:\n BitSum(int size) {\n assert(size < max_value);\n init();\n }\n void init(){\n for (int i = 0; i < max_value; i++){\n bit[i] = 0;\n }\n }\n void add(int idx, ll val){\n int p = idx+1;\n while(p < max_value){\n bit[p] += val;\n p += p & -p;\n }\n }\n /**\n * [0, idx]のsumを求める\n */\n ll calc(int idx){\n ll res = 0;\n int p = idx+1;\n while(0 < p){\n res += bit[p];\n p -= p & -p;\n }\n return res;\n }\n /**\n * [idx1, idx2]のsumを求める\n */\n ll range(int idx1, int idx2) {\n return calc(idx2) - calc(idx1 - 1);\n }\n};\n\nll getNth(BitSum &bs, int index, int max_size){\n ll l = 1, h = max_size;\n\n while (l < h) {\n ll m = (l + h) / 2;\n ll res = bs.calc(m);\n // printf(\"l = %lld, h = %lld: calc(%lld) = %lld\\n\", l, h, m, res);\n if (res < index) {\n l = m + 1;\n }\n else {\n h = m;\n }\n }\n\n return (l + h) / 2;\n}\n\nvoid exec(int q, int lim){\n unordered_map<int, int> number2index;\n unordered_map<int, int> index2number;\n VI incubated;\n BitSum bs = BitSum(MAX_N);\n int index;\n int count = 0;\n\n for (int i = 0; i < q; i++){\n int query, x;\n scanf(\"%d%d\", &query, &x);\n // printf(\"query = (%d, %d)\\n\", query, x);\n\n switch (query) {\n case 0:\n incubated.push_back(x);\n bs.add(incubated.size(), 1);\n number2index[x] = incubated.size();\n index2number[incubated.size()] = x;\n count++;\n\n if (count > lim) {\n index = getNth(bs, 1, incubated.size());\n // printf(\"0: overflow. delete (%d, %d)\\n\", index, index2number[index]);\n bs.add(index, -1);\n count--;\n }\n break;\n case 1:\n index = getNth(bs, x, incubated.size());\n // printf(\"1: delete by index = (%d, %d)\\n\", index, index2number[index]);\n bs.add(index, -1);\n count--;\n break;\n case 2:\n index = getNth(bs, x, incubated.size());\n // printf(\"DEBUG 2: index = %d\\n\", index);\n // printf(\"DEBUG 2: range = %lld\\n\", bs.range(index, index));\n printf(\"%d\\n\", index2number[index]);\n break;\n case 3:\n bs.add(number2index[x], -1);\n // printf(\"3: delete by number = (%d, %d)\\n\", x, number2index[x]);\n count--;\n break;\n }\n }\n\n printf(\"end\\n\");\n\n}\n\nvoid solve(){\n while (true){\n int q, lim;\n scanf(\"%d%d\", &q, &lim);\n\n if (q + lim == 0) {\n break;\n }\n\n exec(q, lim);\n }\n}\n\nint main(){\n solve();\n return 0;\n}",
"accuracy": 1,
"time_ms": 330,
"memory_kb": 41688,
"score_of_the_acc": -1.0637,
"final_rank": 8
},
{
"submission_id": "aoj_1083_2714079",
"code_snippet": "#include <algorithm>\n#include <cassert>\n#include <climits>\n#include <cmath>\n#include <iostream>\n#include <unordered_map>\n#include <queue>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef pair<int, int> ipair;\ntypedef tuple<int, int, int> ituple;\n\n// const int INF = INT_MAX;\n// const ll INF = LLONG_MAX;\n// const int MOD = ((int)1e9 + 7);\n// const ld EPS = (1e-10);\n#define PI acosl(-1)\n#define MAX_N (500000)\n\nclass BitSum{\nprotected:\n static const int max_value = 500000 + 2;\n ll bit[max_value + 1];\n\npublic:\n BitSum(int size) {\n assert(size < max_value);\n init();\n }\n void init(){\n for (int i = 0; i < max_value; i++){\n bit[i] = 0;\n }\n }\n void add(int idx, ll val){\n int p = idx+1;\n while(p < max_value){\n bit[p] += val;\n p += p & -p;\n }\n }\n /**\n * [0, idx]のsumを求める\n */\n ll calc(int idx){\n ll res = 0;\n int p = idx+1;\n while(0 < p){\n res += bit[p];\n p -= p & -p;\n }\n return res;\n }\n /**\n * [idx1, idx2]のsumを求める\n */\n ll range(int idx1, int idx2) {\n return calc(idx2) - calc(idx1 - 1);\n }\n};\n\nll getNth(BitSum &bs, int index, int max_size){\n ll l = 1, h = max_size;\n ll prev = max_size;\n\n // printf(\"getNth; index = %d\\n\", index);\n\n while (l < h) {\n ll m = (l + h) / 2 + (l + h) % 2;\n ll res = bs.calc(m);\n // printf(\"l = %lld, h = %lld: calc(%lld) = %lld\\n\", l, h, m, res);\n if (res == index) {\n h = m;\n }\n else if (res < index) {\n l = m + 1;\n }\n else {\n h = m - 1;\n }\n\n if (abs(h - l) == prev) {\n break;\n }\n prev = abs(h - l);\n }\n\n return (l + h) / 2 + (l + h) % 2;\n}\n\nvoid exec(int q, int lim){\n unordered_map<int, int> number2index;\n unordered_map<int, int> index2number;\n VI incubated;\n BitSum bs = BitSum(MAX_N);\n int index;\n int count = 0;\n\n for (int i = 0; i < q; i++){\n int query, x;\n scanf(\"%d%d\", &query, &x);\n // printf(\"query = (%d, %d)\\n\", query, x);\n\n switch (query) {\n case 0:\n incubated.push_back(x);\n bs.add(incubated.size(), 1);\n number2index[x] = incubated.size();\n index2number[incubated.size()] = x;\n count++;\n\n if (count > lim) {\n index = getNth(bs, 1, incubated.size());\n // printf(\"0: overflow. delete (%d, %d)\\n\", index, index2number[index]);\n bs.add(index, -1);\n count--;\n }\n break;\n case 1:\n index = getNth(bs, x, incubated.size());\n // printf(\"1: delete by index = (%d, %d)\\n\", index, index2number[index]);\n bs.add(index, -1);\n count--;\n break;\n case 2:\n index = getNth(bs, x, incubated.size());\n // printf(\"DEBUG: index = %d\\n\", index);\n printf(\"%d\\n\", index2number[index]);\n break;\n case 3:\n bs.add(number2index[x], -1);\n // printf(\"1: delete by number = (%d, %d)\\n\", x, number2index[x]);\n count--;\n break;\n }\n }\n\n printf(\"end\\n\");\n\n}\n\nvoid solve(){\n while (true){\n int q, lim;\n scanf(\"%d%d\", &q, &lim);\n\n if (q + lim == 0) {\n break;\n }\n\n exec(q, lim);\n }\n}\n\nint main(){\n solve();\n return 0;\n}",
"accuracy": 0.3333333333333333,
"time_ms": 130,
"memory_kb": 7336,
"score_of_the_acc": -0.089,
"final_rank": 18
},
{
"submission_id": "aoj_1083_2632623",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <math.h>\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\nint Q,limit,N;\nint current_pos;\nint BIT[500000],number[500000];\n\nmap<int,int> MAP;\n\nvoid add(int loc,int value){\n\n\tBIT[loc] += value;\n\n\tloc += loc & -loc;\n\n\twhile(loc <= N){\n\t\tBIT[loc] += value;\n\t\tloc += loc & -loc;\n\t}\n}\n\nint getSum(int loc){\n\n\tint sum = BIT[loc];\n\n\tloc -= loc & -loc;\n\n\twhile(loc > 0){\n\t\tsum += BIT[loc];\n\t\tloc -= loc & -loc;\n\t}\n\treturn sum;\n}\n\nint getLoc(int sum){\n\n\tint left = 1,right = current_pos-1,m = (left+right)/2;\n\tint ret;\n\n\twhile(left <= right){\n\t\tif(getSum(m) >= sum){\n\t\t\tret = m;\n\t\t\tright = m-1;\n\t\t}else{\n\t\t\tleft = m+1;\n\t\t}\n\t\tm = (left+right)/2;\n\t}\n\treturn ret;\n}\n\nvoid func(){\n\n\tN = Q;\n\n\tfor(int i = 0; i <= N; i++)BIT[i] = 0;\n\tMAP.clear();\n\n\tint command,num = 0,del_pos,print_pos;\n\tcurrent_pos = 1;\n\tint x;\n\n\tfor(int loop = 0; loop < Q; loop++){\n\t\tscanf(\"%d %d\",&command,&x);\n\n\t\tswitch(command){\n\t\tcase 0:\n\t\t\tadd(current_pos,1);\n\t\t\tnumber[current_pos] = x;\n\t\t\tMAP[x] = current_pos;\n\t\t\tnum++;\n\t\t\tcurrent_pos++;\n\t\t\tif(num > limit){\n\t\t\t\tdel_pos = getLoc(1);\n\t\t\t\tadd(del_pos,-1);\n\t\t\t\tnum--;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tdel_pos = getLoc(x);\n\t\t\tadd(del_pos,-1);\n\t\t\tnum--;\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tprint_pos = getLoc(x);\n\t\t\tprintf(\"%d\\n\",number[print_pos]);\n\t\t\tbreak;\n\t\tcase 3:\n\t\t\tdel_pos = MAP[x];\n\t\t\tadd(del_pos,-1);\n\t\t\tnum--;\n\t\t\tbreak;\n\t\t}\n\t}\n\tprintf(\"end\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&Q,&limit);\n\t\tif(Q == 0 && limit == 0)break;\n\n\t\tfunc();\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 330,
"memory_kb": 25064,
"score_of_the_acc": -0.6597,
"final_rank": 5
},
{
"submission_id": "aoj_1083_2557947",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename T>\nclass fenwick_tree {\npublic:\n fenwick_tree(int n) : n(n), dat(n, 0) {}\n\n void add(int i, T value) {\n for(; i<n; i |= i + 1) {\n dat[i] += value;\n }\n }\n\n // [0..r]\n T sum(int i) const {\n T res = 0;\n for(; i>=0; i = (i & (i+1)) - 1) {\n res += dat[i];\n }\n return res;\n }\n // [l, r)\n T sum(int l, int r) const {\n return sum(r-1) - sum(l-1);\n }\n\nprivate:\n const int n;\n std::vector<T> dat;\n};\n\nint main() {\n int q, lim;\n while(cin >> q >> lim, q) {\n vector<int> query(q), x(q);\n map<int, int> pos;\n map<int, int> unzip;\n for(int i = 0; i < q; ++i) {\n cin >> query[i] >> x[i];\n if(query[i] == 0 && pos.count(x[i]) == 0) {\n int idx = pos.size();\n pos[x[i]] = idx;\n unzip[idx] = x[i];\n }\n }\n\n fenwick_tree<int> bit(pos.size());\n auto get_idx = [&](int cnt) {\n int lb = -1, ub = pos.size() - 1;\n while(ub - lb > 1) {\n int m = (ub + lb) / 2;\n if(bit.sum(m) >= cnt) {\n ub = m;\n } else {\n lb = m;\n }\n }\n return ub;\n };\n for(int i = 0; i < q; ++i) {\n if(query[i] == 0) {\n bit.add(pos[x[i]], 1);\n if(bit.sum(pos.size() - 1) > lim) {\n bit.add(get_idx(1), -1);\n }\n } else if(query[i] == 1) {\n bit.add(get_idx(x[i]), -1);\n } else if(query[i] == 2) {\n cout << unzip[get_idx(x[i])] << endl;\n } else {\n bit.add(pos[x[i]], -1);\n }\n }\n cout << \"end\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 910,
"memory_kb": 44820,
"score_of_the_acc": -1.5455,
"final_rank": 12
},
{
"submission_id": "aoj_1083_2557944",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename T>\nclass fenwick_tree {\npublic:\n fenwick_tree(int n) : n(n), dat(n, 0) {}\n\n void add(int i, T value) {\n for(; i<n; i |= i + 1) {\n dat[i] += value;\n }\n }\n\n // [0..r]\n T sum(int i) const {\n T res = 0;\n for(; i>=0; i = (i & (i+1)) - 1) {\n res += dat[i];\n }\n return res;\n }\n // [l, r)\n T sum(int l, int r) const {\n return sum(r-1) - sum(l-1);\n }\n\nprivate:\n const int n;\n std::vector<T> dat;\n};\n\nint main() {\n int q, lim;\n while(cin >> q >> lim, q) {\n vector<int> query(q), x(q);\n map<int, int> pos;\n map<int, int> unzip;\n for(int i = 0; i < q; ++i) {\n cin >> query[i] >> x[i];\n if(pos.count(x[i]) == 0) {\n int idx = pos.size();\n pos[x[i]] = idx;\n unzip[idx] = x[i];\n }\n }\n\n fenwick_tree<int> bit(pos.size());\n auto get_idx = [&](int cnt) {\n int lb = -1, ub = pos.size() - 1;\n while(ub - lb > 1) {\n int m = (ub + lb) / 2;\n if(bit.sum(m) >= cnt) {\n ub = m;\n } else {\n lb = m;\n }\n }\n return ub;\n };\n for(int i = 0; i < q; ++i) {\n if(query[i] == 0) {\n bit.add(pos[x[i]], 1);\n if(bit.sum(pos.size() - 1) > lim) {\n bit.add(get_idx(1), -1);\n }\n } else if(query[i] == 1) {\n bit.add(get_idx(x[i]), -1);\n } else if(query[i] == 2) {\n cout << unzip[get_idx(x[i])] << endl;\n } else {\n bit.add(pos[x[i]], -1);\n }\n }\n cout << \"end\" << endl;\n }\n}",
"accuracy": 0.3333333333333333,
"time_ms": 330,
"memory_kb": 3756,
"score_of_the_acc": -0.1418,
"final_rank": 19
},
{
"submission_id": "aoj_1083_2557942",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename T>\nclass fenwick_tree {\npublic:\n fenwick_tree(int n) : n(n), dat(n, 0) {}\n\n void add(int i, T value) {\n for(; i<n; i |= i + 1) {\n dat[i] += value;\n }\n }\n\n // [0..r]\n T sum(int i) const {\n T res = 0;\n for(; i>=0; i = (i & (i+1)) - 1) {\n res += dat[i];\n }\n return res;\n }\n // [l, r)\n T sum(int l, int r) const {\n return sum(r-1) - sum(l-1);\n }\n\nprivate:\n const int n;\n std::vector<T> dat;\n};\n\nint main() {\n int q, lim;\n while(cin >> q >> lim, q) {\n vector<int> query(q), x(q);\n map<int, int> pos;\n map<int, int> unzip;\n for(int i = 0; i < q; ++i) {\n cin >> query[i] >> x[i];\n if(pos.count(x[i]) == 0) {\n int idx = pos.size();\n pos[x[i]] = idx;\n unzip[idx] = x[i];\n }\n }\n\n fenwick_tree<int> bit(pos.size());\n auto get_idx = [&](int cnt) {\n int lb = -1, ub = pos.size();\n while(ub - lb > 1) {\n int m = (ub + lb) / 2;\n if(bit.sum(m) >= cnt) {\n ub = m;\n } else {\n lb = m;\n }\n }\n return ub;\n };\n for(int i = 0; i < q; ++i) {\n if(query[i] == 0) {\n bit.add(pos[x[i]], 1);\n if(bit.sum(pos.size() - 1) > lim) {\n bit.add(get_idx(1), -1);\n }\n } else if(query[i] == 1) {\n bit.add(get_idx(x[i]), -1);\n } else if(query[i] == 2) {\n cout << unzip[get_idx(x[i])] << endl;\n } else {\n bit.add(pos[x[i]], -1);\n }\n }\n cout << \"end\" << endl;\n }\n}",
"accuracy": 0.3333333333333333,
"time_ms": 340,
"memory_kb": 3756,
"score_of_the_acc": -0.1488,
"final_rank": 20
},
{
"submission_id": "aoj_1083_2514623",
"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\nconst int MAX_N = 400010;\n\nclass segTree{\n public:\n int n, dat[4 * MAX_N];\n void init(int n_, int value, int dat_b[4 * MAX_N] = NULL){\n n = 1;\n while(n <= n_) n *= 2;\n rep(i,2 * n){\n dat[i] = value;\n if(dat_b != NULL) dat_b[i] = value;\n }\n }\n void initArray(int n_, int a[MAX_N]){ //??????a??§????????????\n n = 1;\n while(n <= n_) n *= 2;\n for(int i = n; i < n + n_; i++){\n dat[i] = a[i - n];\n }\n for(int i = n - 1; i >= 1; i--){\n dat[i] = min(dat[i * 2], dat[i * 2 + 1]);\n //dat[i] = dat[i * 2] + dat[i * 2 + 1];\n }\n }\n void output(int a[4 * MAX_N]){\n show(\"print\");\n range(i,1,n * 2) cout << (a[i] == INT_MAX ? 0 : a[i]) << ' ';\n cout << endl;\n }\n};\n\nclass rangeAddQuery : public segTree{\n //dat : ???????????????????§???????????????????????????????\n //dat_add : ????§???§?????????????????????????????????\n private:\n int dat_add[4 * MAX_N];\n int query(int a, int b, int k, int l, int r){\n if(b <= l || r <= a) return 0;\n if(a <= l && r <= b) return dat[k] * (r - l) + dat_add[k];\n\n int res = (min(b, r) - max(a, l)) * dat[k];\n res += query(a, b, k * 2, l, (l + r) / 2);\n res += query(a, b, k * 2 + 1, (l + r) / 2, r);\n return res;\n }\n void add(int a, int b, int k, int l, int r, int x){\n if(a <= l && r <= b){\n dat[k] += x;\n }else if(l < b && a < r){\n dat_add[k] += (min(b, r) - max(a, l)) * x;\n add(a, b, k * 2, l, (l + r) / 2, x);\n add(a, b, k * 2 + 1, (l + r) / 2, r, x);\n }\n }\n public:\n rangeAddQuery(int n){ init(n); }\n void init(int n_){ segTree::init(n_, 0, dat_add); }\n int query(int a, int b){ return query(a,b,1,0,n); }\n void add(int s, int t, int x){ add(s, t, 1, 0, n, x); }\n void add(int i, int x){ add(i, i + 1, 1, 0, n, x); }\n int get(int a){ return query(a, a + 1); }\n};\n\nclass rangeSumQuery : public segTree{\n private:\n int query(int a, int b, int k, int l, int r){\n if(r <= a || b <= l) return 0;\n if(a <= l && r <= b) return dat[k];\n\n int vl = query(a, b, k * 2, l, ( l + r) / 2);\n int vr = query(a, b, k * 2 + 1, (l + r) / 2, r);\n return vl + vr;\n }\n public:\n rangeSumQuery(int n){ init(n); }\n void init(int n_){ segTree::init(n_, 0); }\n void update(int i, int x){\n i += n; //????????????\n dat[i] += x;\n while(i > 0){ //?????????????????´??°\n dat[i / 2] = dat[i] + dat[i^1];\n i = i / 2;\n }\n }\n int query(int a, int b){ return query(a,b,1,0,n); }\n int get(int a){ return query(a, a + 1); }\n bool C(int mid, int x){\n return query(0, mid) < x;\n }\n int pos(int x){\n //show(x)\n int right = n, left = 0;\n rep(i,25){\n int mid = (right + left ) / 2;\n if(C(mid,x)) left = mid;\n else right = mid;\n }\n return left;\n }\n};\n\nclass rangeMinimumQuery : public segTree{\n private:\n int query(int a, int b, int k, int l, int r){\n //[a, b) ??¨[l, r)???????????????????????°???INT_MAX\n if(r <= a || b <= l) return INT_MAX;\n //[a,b)???[l,r)????????¨???????????§????????°?????????????????????\n if(a <= l && r <= b) return dat[k];\n\n //????????§???????????°??????????????????????°????\n int vl = query(a, b, k * 2, l, ( l + r) / 2);\n int vr = query(a, b, k * 2 + 1, (l + r) / 2, r);\n return min(vl, vr);\n }\n public:\n rangeMinimumQuery(int n){ init(n); }\n void init(int n_){ segTree::init(n_,INT_MAX); }\n void update(int i, int x){\n i += n; //????????????\n dat[i] = x;\n while(i > 0){ //?????????????????´??°\n dat[i / 2] = min(dat[i], dat[i^1]);\n i = i / 2;\n }\n }\n //[a, b)???????°????????±???????\n int query(int a, int b){ return query(a,b,1,0,n); }\n};\n\nclass rangeUpdateQuery : public segTree{ //??????????????????update??§?????????min??¨???sum???????????????\n private:\n int dat_lazy[4 * MAX_N]; //?????¶???????????????????????????\n int query(int a, int b, int k, int l, int r){\n //???????£?\n evaluate(k);\n\n if(b <= l || r <= a) return INT_MAX;\n else if(a <= l && r <= b) return dat[k];\n\n int vl = query(a, b, k * 2, l, (l + r) / 2);\n int vr = query(a, b, k * 2 + 1, (l + r) / 2, r);\n return min(vl, vr);\n }\n inline void evaluate(int k){\n if(dat_lazy[k] == INT_MAX) return;\n dat[k] = dat_lazy[k];\n if(k < n){\n dat_lazy[2 * k] = dat_lazy[k]; //?????¶????????¬????????¨???\n dat_lazy[2 * k + 1] = dat_lazy[k];\n }\n dat_lazy[k] = INT_MAX;\n }\n void update(int a, int b, int k, int l, int r, int x){\n evaluate(k);\n\n if(b <= l || r <= a ) return;\n\n if(a <= l && r <= b){\n dat_lazy[k] = x;\n }else{\n evaluate(k);\n update(a, b, k * 2, l, (l + r) / 2, x);\n update(a, b, k * 2 + 1, (l + r) / 2, r, x);\n }\n }\n public:\n rangeUpdateQuery(int n){ init(n); }\n void init(int n_){ segTree::init(n_,INT_MAX,dat_lazy); }\n int query(int a, int b){ return query(a,b,1,0,n); }\n void update(int s, int t, int x){ update(s, t, 1, 0, n, x); }\n void update(int i, int x){ update(i, i + 1, 1, 0, n, x); }\n int get(int a){ return query(a, a + 1); };\n};\n\nclass starrySky : public segTree{\n private:\n int query(int a, int b, int k, int l, int r){\n if(b <= l || r <= a) return 0;\n if(a <= l && r <= b) return dat[k] + dat_add[k];\n\n int vl = query(a, b, k * 2, l, (l + r) / 2);\n int vr = query(a, b, k * 2 + 1, (l + r) / 2, r);\n return max(vl, vr) + dat_add[k];\n }\n void add(int a, int b, int k, int l, int r, int x){\n if(b <= l || r <= a) return;\n if(a <= l && r <= b){\n dat_add[k] += x;\n }else{\n add(a, b, k * 2, l, (l + r) / 2, x);\n add(a, b, k * 2 + 1, (l + r) / 2, r, x);\n dat[k] = max(dat[k * 2] + dat_add[k * 2], dat[k * 2 + 1] + dat_add[k * 2 + 1]);\n }\n }\n void init(int n_){ segTree::init(n_,0,dat_add); }\n public:\n int dat_add[4 * MAX_N];\n starrySky(int n){ init(n); }\n int query(int a, int b){ return query(a, b, 1, 0, n); }\n void add(int s, int t, int x){ add(s, t, 1, 0, n, x); }\n void add(int i, int x){ add(i, i + 1, 1, 0, n, x); }\n};\n\nmap<int,int> m, s; //id, pos / pos, id\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int q, lim;\n while(cin >> q >> lim, q){\n //show(q)\n rangeSumQuery seg(q + 1);\n m.clear(); s.clear();\n int total = 0;\n rep(i,q){\n int com, x;\n cin >> com >> x;\n\n switch (com) {\n int pos;\n case 0:\n pos = m.size();\n m[x] = pos;\n s[pos] = x;\n seg.update(pos, 1);\n total++;\n if(total > lim){\n seg.update(seg.pos(0), -1);\n total--;\n }\n break;\n case 1:\n pos = seg.pos(x);\n seg.update(pos, -1);\n total--;\n break;\n case 2:\n //show(seg.pos(x));\n cout << s[seg.pos(x)] << endl;\n break;\n case 3:\n seg.update(m[x], -1);\n total--;\n break;\n }\n }\n cout << \"end\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 970,
"memory_kb": 44720,
"score_of_the_acc": -1.585,
"final_rank": 13
},
{
"submission_id": "aoj_1083_2514611",
"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\nconst int MAX_N = 200010;\n\nclass segTree{\n public:\n int n, dat[4 * MAX_N];\n void init(int n_, int value, int dat_b[4 * MAX_N] = NULL){\n n = 1;\n while(n <= n_) n *= 2;\n rep(i,2 * n){\n dat[i] = value;\n if(dat_b != NULL) dat_b[i] = value;\n }\n }\n void initArray(int n_, int a[MAX_N]){ //??????a??§????????????\n n = 1;\n while(n <= n_) n *= 2;\n for(int i = n; i < n + n_; i++){\n dat[i] = a[i - n];\n }\n for(int i = n - 1; i >= 1; i--){\n dat[i] = min(dat[i * 2], dat[i * 2 + 1]);\n //dat[i] = dat[i * 2] + dat[i * 2 + 1];\n }\n }\n void output(int a[4 * MAX_N]){\n show(\"print\");\n range(i,1,n * 2) cout << (a[i] == INT_MAX ? 0 : a[i]) << ' ';\n cout << endl;\n }\n};\n\nclass rangeAddQuery : public segTree{\n //dat : ???????????????????§???????????????????????????????\n //dat_add : ????§???§?????????????????????????????????\n private:\n int dat_add[4 * MAX_N];\n int query(int a, int b, int k, int l, int r){\n if(b <= l || r <= a) return 0;\n if(a <= l && r <= b) return dat[k] * (r - l) + dat_add[k];\n\n int res = (min(b, r) - max(a, l)) * dat[k];\n res += query(a, b, k * 2, l, (l + r) / 2);\n res += query(a, b, k * 2 + 1, (l + r) / 2, r);\n return res;\n }\n void add(int a, int b, int k, int l, int r, int x){\n if(a <= l && r <= b){\n dat[k] += x;\n }else if(l < b && a < r){\n dat_add[k] += (min(b, r) - max(a, l)) * x;\n add(a, b, k * 2, l, (l + r) / 2, x);\n add(a, b, k * 2 + 1, (l + r) / 2, r, x);\n }\n }\n public:\n rangeAddQuery(int n){ init(n); }\n void init(int n_){ segTree::init(n_, 0, dat_add); }\n int query(int a, int b){ return query(a,b,1,0,n); }\n void add(int s, int t, int x){ add(s, t, 1, 0, n, x); }\n void add(int i, int x){ add(i, i + 1, 1, 0, n, x); }\n int get(int a){ return query(a, a + 1); }\n};\n\nclass rangeSumQuery : public segTree{\n private:\n int query(int a, int b, int k, int l, int r){\n if(r <= a || b <= l) return 0;\n if(a <= l && r <= b) return dat[k];\n\n int vl = query(a, b, k * 2, l, ( l + r) / 2);\n int vr = query(a, b, k * 2 + 1, (l + r) / 2, r);\n return vl + vr;\n }\n public:\n rangeSumQuery(int n){ init(n); }\n void init(int n_){ segTree::init(n_, 0); }\n void update(int i, int x){\n i += n; //????????????\n dat[i] += x;\n while(i > 0){ //?????????????????´??°\n dat[i / 2] = dat[i] + dat[i^1];\n i = i / 2;\n }\n }\n int query(int a, int b){ return query(a,b,1,0,n); }\n int get(int a){ return query(a, a + 1); }\n bool C(int mid, int x){\n return query(0, mid) < x;\n }\n int pos(int x){\n //show(x)\n int right = n, left = 0;\n rep(i,25){\n int mid = (right + left ) / 2;\n if(C(mid,x)) left = mid;\n else right = mid;\n }\n return left;\n }\n};\n\nclass rangeMinimumQuery : public segTree{\n private:\n int query(int a, int b, int k, int l, int r){\n //[a, b) ??¨[l, r)???????????????????????°???INT_MAX\n if(r <= a || b <= l) return INT_MAX;\n //[a,b)???[l,r)????????¨???????????§????????°?????????????????????\n if(a <= l && r <= b) return dat[k];\n\n //????????§???????????°??????????????????????°????\n int vl = query(a, b, k * 2, l, ( l + r) / 2);\n int vr = query(a, b, k * 2 + 1, (l + r) / 2, r);\n return min(vl, vr);\n }\n public:\n rangeMinimumQuery(int n){ init(n); }\n void init(int n_){ segTree::init(n_,INT_MAX); }\n void update(int i, int x){\n i += n; //????????????\n dat[i] = x;\n while(i > 0){ //?????????????????´??°\n dat[i / 2] = min(dat[i], dat[i^1]);\n i = i / 2;\n }\n }\n //[a, b)???????°????????±???????\n int query(int a, int b){ return query(a,b,1,0,n); }\n};\n\nclass rangeUpdateQuery : public segTree{ //??????????????????update??§?????????min??¨???sum???????????????\n private:\n int dat_lazy[4 * MAX_N]; //?????¶???????????????????????????\n int query(int a, int b, int k, int l, int r){\n //???????£?\n evaluate(k);\n\n if(b <= l || r <= a) return INT_MAX;\n else if(a <= l && r <= b) return dat[k];\n\n int vl = query(a, b, k * 2, l, (l + r) / 2);\n int vr = query(a, b, k * 2 + 1, (l + r) / 2, r);\n return min(vl, vr);\n }\n inline void evaluate(int k){\n if(dat_lazy[k] == INT_MAX) return;\n dat[k] = dat_lazy[k];\n if(k < n){\n dat_lazy[2 * k] = dat_lazy[k]; //?????¶????????¬????????¨???\n dat_lazy[2 * k + 1] = dat_lazy[k];\n }\n dat_lazy[k] = INT_MAX;\n }\n void update(int a, int b, int k, int l, int r, int x){\n evaluate(k);\n\n if(b <= l || r <= a ) return;\n\n if(a <= l && r <= b){\n dat_lazy[k] = x;\n }else{\n evaluate(k);\n update(a, b, k * 2, l, (l + r) / 2, x);\n update(a, b, k * 2 + 1, (l + r) / 2, r, x);\n }\n }\n public:\n rangeUpdateQuery(int n){ init(n); }\n void init(int n_){ segTree::init(n_,INT_MAX,dat_lazy); }\n int query(int a, int b){ return query(a,b,1,0,n); }\n void update(int s, int t, int x){ update(s, t, 1, 0, n, x); }\n void update(int i, int x){ update(i, i + 1, 1, 0, n, x); }\n int get(int a){ return query(a, a + 1); };\n};\n\nclass starrySky : public segTree{\n private:\n int query(int a, int b, int k, int l, int r){\n if(b <= l || r <= a) return 0;\n if(a <= l && r <= b) return dat[k] + dat_add[k];\n\n int vl = query(a, b, k * 2, l, (l + r) / 2);\n int vr = query(a, b, k * 2 + 1, (l + r) / 2, r);\n return max(vl, vr) + dat_add[k];\n }\n void add(int a, int b, int k, int l, int r, int x){\n if(b <= l || r <= a) return;\n if(a <= l && r <= b){\n dat_add[k] += x;\n }else{\n add(a, b, k * 2, l, (l + r) / 2, x);\n add(a, b, k * 2 + 1, (l + r) / 2, r, x);\n dat[k] = max(dat[k * 2] + dat_add[k * 2], dat[k * 2 + 1] + dat_add[k * 2 + 1]);\n }\n }\n void init(int n_){ segTree::init(n_,0,dat_add); }\n public:\n int dat_add[4 * MAX_N];\n starrySky(int n){ init(n); }\n int query(int a, int b){ return query(a, b, 1, 0, n); }\n void add(int s, int t, int x){ add(s, t, 1, 0, n, x); }\n void add(int i, int x){ add(i, i + 1, 1, 0, n, x); }\n};\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int q, lim;\n while(cin >> q >> lim, q){\n //show(q)\n rangeSumQuery seg(q);\n map<int,int> m, s; //id, pos / pos, id\n int total = 0;\n rep(i,q){\n int com, x;\n cin >> com >> x;\n\n switch (com) {\n int pos;\n case 0:\n pos = m.size();\n m[x] = pos;\n s[pos] = x;\n seg.update(pos, 1);\n total++;\n if(total > lim){\n seg.update(seg.pos(0), -1);\n total--;\n }\n break;\n case 1:\n pos = seg.pos(x);\n seg.update(pos, -1);\n total--;\n break;\n case 2:\n //show(seg.pos(x));\n cout << s[seg.pos(x)] << endl;\n break;\n case 3:\n seg.update(m[x], -1);\n total--;\n break;\n }\n }\n cout << \"end\" << endl;\n }\n}",
"accuracy": 0.6666666666666666,
"time_ms": 390,
"memory_kb": 11856,
"score_of_the_acc": -0.3806,
"final_rank": 14
},
{
"submission_id": "aoj_1083_2514597",
"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\nconst int MAX_N = 200010;\n\nclass segTree{\n public:\n int n, dat[4 * MAX_N];\n void init(int n_, int value, int dat_b[4 * MAX_N] = NULL){\n n = 1;\n while(n <= n_) n *= 2;\n rep(i,2 * n){\n dat[i] = value;\n if(dat_b != NULL) dat_b[i] = value;\n }\n }\n void initArray(int n_, int a[MAX_N]){ //??????a??§????????????\n n = 1;\n while(n <= n_) n *= 2;\n for(int i = n; i < n + n_; i++){\n dat[i] = a[i - n];\n }\n for(int i = n - 1; i >= 1; i--){\n dat[i] = min(dat[i * 2], dat[i * 2 + 1]);\n //dat[i] = dat[i * 2] + dat[i * 2 + 1];\n }\n }\n void output(int a[4 * MAX_N]){\n show(\"print\");\n range(i,1,n * 2) cout << (a[i] == INT_MAX ? 0 : a[i]) << ' ';\n cout << endl;\n }\n};\n\nclass rangeAddQuery : public segTree{\n //dat : ???????????????????§???????????????????????????????\n //dat_add : ????§???§?????????????????????????????????\n private:\n int dat_add[4 * MAX_N];\n int query(int a, int b, int k, int l, int r){\n if(b <= l || r <= a) return 0;\n if(a <= l && r <= b) return dat[k] * (r - l) + dat_add[k];\n\n int res = (min(b, r) - max(a, l)) * dat[k];\n res += query(a, b, k * 2, l, (l + r) / 2);\n res += query(a, b, k * 2 + 1, (l + r) / 2, r);\n return res;\n }\n void add(int a, int b, int k, int l, int r, int x){\n if(a <= l && r <= b){\n dat[k] += x;\n }else if(l < b && a < r){\n dat_add[k] += (min(b, r) - max(a, l)) * x;\n add(a, b, k * 2, l, (l + r) / 2, x);\n add(a, b, k * 2 + 1, (l + r) / 2, r, x);\n }\n }\n public:\n rangeAddQuery(int n){ init(n); }\n void init(int n_){ segTree::init(n_, 0, dat_add); }\n int query(int a, int b){ return query(a,b,1,0,n); }\n void add(int s, int t, int x){ add(s, t, 1, 0, n, x); }\n void add(int i, int x){ add(i, i + 1, 1, 0, n, x); }\n int get(int a){ return query(a, a + 1); }\n};\n\nclass rangeSumQuery : public segTree{\n private:\n int query(int a, int b, int k, int l, int r){\n if(r <= a || b <= l) return 0;\n if(a <= l && r <= b) return dat[k];\n\n int vl = query(a, b, k * 2, l, ( l + r) / 2);\n int vr = query(a, b, k * 2 + 1, (l + r) / 2, r);\n return vl + vr;\n }\n public:\n rangeSumQuery(int n){ init(n); }\n void init(int n_){ segTree::init(n_, 0); }\n void update(int i, int x){\n i += n; //????????????\n dat[i] += x;\n while(i > 0){ //?????????????????´??°\n dat[i / 2] = dat[i] + dat[i^1];\n i = i / 2;\n }\n }\n int query(int a, int b){ return query(a,b,1,0,n); }\n int get(int a){ return query(a, a + 1); }\n bool C(int mid, int x){\n return query(1, mid) < x;\n }\n int pos(int x){\n //show(x)\n int right = n, left = 0;\n rep(i,50){\n int mid = (right + left ) / 2;\n if(C(mid,x)) left = mid;\n else right = mid;\n }\n return left;\n }\n};\n\nclass rangeMinimumQuery : public segTree{\n private:\n int query(int a, int b, int k, int l, int r){\n //[a, b) ??¨[l, r)???????????????????????°???INT_MAX\n if(r <= a || b <= l) return INT_MAX;\n //[a,b)???[l,r)????????¨???????????§????????°?????????????????????\n if(a <= l && r <= b) return dat[k];\n\n //????????§???????????°??????????????????????°????\n int vl = query(a, b, k * 2, l, ( l + r) / 2);\n int vr = query(a, b, k * 2 + 1, (l + r) / 2, r);\n return min(vl, vr);\n }\n public:\n rangeMinimumQuery(int n){ init(n); }\n void init(int n_){ segTree::init(n_,INT_MAX); }\n void update(int i, int x){\n i += n; //????????????\n dat[i] = x;\n while(i > 0){ //?????????????????´??°\n dat[i / 2] = min(dat[i], dat[i^1]);\n i = i / 2;\n }\n }\n //[a, b)???????°????????±???????\n int query(int a, int b){ return query(a,b,1,0,n); }\n};\n\nclass rangeUpdateQuery : public segTree{ //??????????????????update??§?????????min??¨???sum???????????????\n private:\n int dat_lazy[4 * MAX_N]; //?????¶???????????????????????????\n int query(int a, int b, int k, int l, int r){\n //???????£?\n evaluate(k);\n\n if(b <= l || r <= a) return INT_MAX;\n else if(a <= l && r <= b) return dat[k];\n\n int vl = query(a, b, k * 2, l, (l + r) / 2);\n int vr = query(a, b, k * 2 + 1, (l + r) / 2, r);\n return min(vl, vr);\n }\n inline void evaluate(int k){\n if(dat_lazy[k] == INT_MAX) return;\n dat[k] = dat_lazy[k];\n if(k < n){\n dat_lazy[2 * k] = dat_lazy[k]; //?????¶????????¬????????¨???\n dat_lazy[2 * k + 1] = dat_lazy[k];\n }\n dat_lazy[k] = INT_MAX;\n }\n void update(int a, int b, int k, int l, int r, int x){\n evaluate(k);\n\n if(b <= l || r <= a ) return;\n\n if(a <= l && r <= b){\n dat_lazy[k] = x;\n }else{\n evaluate(k);\n update(a, b, k * 2, l, (l + r) / 2, x);\n update(a, b, k * 2 + 1, (l + r) / 2, r, x);\n }\n }\n public:\n rangeUpdateQuery(int n){ init(n); }\n void init(int n_){ segTree::init(n_,INT_MAX,dat_lazy); }\n int query(int a, int b){ return query(a,b,1,0,n); }\n void update(int s, int t, int x){ update(s, t, 1, 0, n, x); }\n void update(int i, int x){ update(i, i + 1, 1, 0, n, x); }\n int get(int a){ return query(a, a + 1); };\n};\n\nclass starrySky : public segTree{\n private:\n int query(int a, int b, int k, int l, int r){\n if(b <= l || r <= a) return 0;\n if(a <= l && r <= b) return dat[k] + dat_add[k];\n\n int vl = query(a, b, k * 2, l, (l + r) / 2);\n int vr = query(a, b, k * 2 + 1, (l + r) / 2, r);\n return max(vl, vr) + dat_add[k];\n }\n void add(int a, int b, int k, int l, int r, int x){\n if(b <= l || r <= a) return;\n if(a <= l && r <= b){\n dat_add[k] += x;\n }else{\n add(a, b, k * 2, l, (l + r) / 2, x);\n add(a, b, k * 2 + 1, (l + r) / 2, r, x);\n dat[k] = max(dat[k * 2] + dat_add[k * 2], dat[k * 2 + 1] + dat_add[k * 2 + 1]);\n }\n }\n void init(int n_){ segTree::init(n_,0,dat_add); }\n public:\n int dat_add[4 * MAX_N];\n starrySky(int n){ init(n); }\n int query(int a, int b){ return query(a, b, 1, 0, n); }\n void add(int s, int t, int x){ add(s, t, 1, 0, n, x); }\n void add(int i, int x){ add(i, i + 1, 1, 0, n, x); }\n};\n\nint main(){\n int q, lim;\n\n while(cin >> q >> lim, q){\n //show(q)\n assert(q <= 100000);\n rangeSumQuery seg(q);\n vector<int> v;\n v.emplace_back(-1);\n map<int,int> m; //id, pos\n set<pair<int, int>> s; //pos, id\n int total = 0;\n rep(i,q){\n int com, x;\n cin >> com >> x;\n\n switch (com) {\n int pos;\n case 0:\n pos = v.size();\n v.emplace_back(x);\n m[x] = pos;\n s.insert(make_pair(pos, x));\n seg.update(pos, 1);\n total++;\n break;\n case 1:\n pos = seg.pos(x);\n seg.update(pos, -1);\n s.erase(*lower_bound(all(s), make_pair(pos,0)));\n total--;\n break;\n case 2:\n //show(seg.pos(x));\n cout << v[seg.pos(x)] << endl;\n break;\n case 3:\n pos = m[x];\n seg.update(pos, -1);\n s.erase(make_pair(pos, x));\n total--;\n break;\n }\n if(total > lim){\n pair<int, int> old = *s.begin();\n //show(old.first)\n seg.update(old.first, -1);\n s.erase(old);\n total--;\n }\n }\n cout << \"end\" << endl;\n }\n}",
"accuracy": 0.6666666666666666,
"time_ms": 1560,
"memory_kb": 3676,
"score_of_the_acc": -1,
"final_rank": 17
},
{
"submission_id": "aoj_1083_2387335",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <string>\n#include <map>\n#include <sstream>\n\nusing namespace std;\n\nint N; // ???????????°???????????§??????2^n???????????§????????°?????\\????????¨??????\nint BIT[1000000];\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\nvoid init(){\n\tfor(int i = 0; i < N; i++){\n\t\tBIT[i] = 0;\n\t}\n}\n\n// BIT ??????????¢?????????????????????????????´???????????????§????????¨???????????????\nint lowerBound(int w){\n\tif(w <= 0){\n\t\treturn 0;\n\t}\n\tint x = 0;\n\tfor (int k = 262144; k > 0; k /= 2) { // k ??????????????? N ??\\???????????§??? 2 ????????¨????????¨??????????°??????§?????????????????????\n\t\tif (x + k <= N && BIT[x + k] < w) {\n\t\t\tw -= BIT[x + k];\n\t\t\tx += k;\n\t\t}\n\t}\n\treturn x + 1;\n}\n\nint main(){\n\t\n\tint q, lim;\n\t\n\twhile(true){\n\t\t\n\t\tcin >> q >> lim;\n\t\t\n\t\tif(q == 0 && lim == 0){\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tN = 1000000 - 1;\n\t\t\n\t\tinit();\n\t\t\n\t\tmap<int, int> m1; // ID -> index\n\t\tmap<int, int> m2; // index -> ID\n\t\t\n\t\tint index_ref = 1;\n\t\tint count = 0;\n\t\t\n\t\tfor(int loop = 0; loop < q; loop++){\n\t\t\tint query, x;\n\t\t\tcin >> query >> x;\n\t\t\tif(query == 0){\n\t\t\t\tadd(index_ref, 1);\n\t\t\t\tm1[x] = index_ref;\n\t\t\t\tm2[index_ref] = x;\n\t\t\t\tindex_ref++;\n\t\t\t\tcount++;\n\t\t\t}else if(query == 1){\n\t\t\t\tint index = lowerBound(x);\n\t\t\t\tadd(index, -1);\n\t\t\t\tcount--;\n\t\t\t}else if(query == 2){\n\t\t\t\tint index = lowerBound(x);\n\t\t\t\tcout << m2[index] << endl;\n\t\t\t}else{\n\t\t\t\tadd(m1[x], -1);\n\t\t\t\tcount--;\n\t\t\t}\n\t\t\tif(count > lim){\n\t\t\t\tint index = lowerBound(1);\n\t\t\t\tadd(index, -1);\n\t\t\t\tcount--;\n\t\t\t}\n\t\t}\n\t\tcout << \"end\" << endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 680,
"memory_kb": 44488,
"score_of_the_acc": -1.3765,
"final_rank": 11
},
{
"submission_id": "aoj_1083_2182844",
"code_snippet": "/*\n\tFor the part of BIT's binary search see below.\n\thttp://hos.ac/slides/20140319_bit.pdf\n*/\n#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define ALL(A) A.begin(), A.end()\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\ntemplate<class T> class bit{\npublic:\n\tvector<T> dat;\n\tint N, M;\n\t\n\tbit(){}\n\tbit(int _N): N(_N){\n\t\tdat.assign(_N,0);\n\t\tM = 0;\n\t\tint p = 0;\n\t\twhile(_N >= (1<<p)){\n\t\t\tM = (1<<p);\n\t\t\t++p;\n\t\t} // end while\n\t}\n\t\n\t// sum [0,i)\n\tT sum(int i){\n\t\tT ret = 0;\n\t\tfor (--i; i >= 0; i = (i & (i + 1)) - 1){\n\t\t\tret += dat[i];\n\t\t} // end for\n\t\treturn ret;\n\t}\n\n\t// sum [i,j)\n\tT sum(int i, int j){\n\t\treturn sum(j) - sum(i);\n\t}\n\n\t// add x to i\n\tvoid add(int i, T x){\n\t\tfor (; i < N; i |= i + 1) dat[i] += x;\n\t}\n\n\t// return w-th smallest index (0-indexed)\n\tint lowerBound(int w){\n\t\tif (w < 0) return -1;\n\t\tint x = 0;\n\t\tfor (int k = M; k > 0; k /= 2){\n\t\t\tif (x + k < N && dat[x + k - 1] <= w){\n\t\t\t\tw -= dat[x + k - 1];\n\t\t\t\tx += k;\n\t\t\t} // end if\n\t\t} // end for\n\t\treturn x;\n\t}\n};\n\nbit<int> bs;\nmap<int,int> id;\nint q, lim, l, r, vs[400010];\nbool done[400010];\n\nvoid normalize(void){\n\tif (bs.sum(r) > lim){\n\t\twhile(done[l]) ++l;\n\t\tdone[l] = 1;\n\t\tbs.add(l++, -1);\n\t} // end if\n}\n\nvoid solve(void){\n\tmemset(vs, 0, sizeof(vs));\n\tmemset(done, false, sizeof(done));\n\n\tid.clear();\n\tl = r = 0;\n\n\tbs = bit<int>(q);\n\twhile(q--){\n\t\tint v, x, p;\n\t\tcin >> v >> x;\n\t\tswitch(v){\n\t\t\tcase 0:\n\t\t\t\tid[x] = r;\n\t\t\t\tvs[r] = x;\n\t\t\t\tbs.add(r++, 1);\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tp = bs.lowerBound(x-1);\n\t\t\t\tbs.add(p, -1);\n\t\t\t\tdone[p] = true;\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tp = bs.lowerBound(x-1);\n\t\t\t\tcout << vs[p] << endl;\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tp = id[x];\n\t\t\t\tbs.add(p, -1);\n\t\t\t\tdone[p] = true;\n\t\t\t\tbreak;\n\t\t} // end switch\n\t\tnormalize();\n\t} // end while \n}\n\nbool input(void){\n\tcin >> q >> lim;\n\treturn (q || lim);\n}\n\nint main()\n{\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\t\n\tfor(; input(); ){\n\t\tsolve();\n\t\tcout << \"end\" << endl;\n\t} // end for\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 25168,
"score_of_the_acc": -0.6482,
"final_rank": 4
},
{
"submission_id": "aoj_1083_2182824",
"code_snippet": "/*\n\tBIT ???????????¢?´¢?????¨??????\n\thttp://hos.ac/slides/20140319_bit.pdf\n\t????????§???\n*/\n#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define ALL(A) A.begin(), A.end()\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\ntemplate<class T> class bit{\npublic:\n\tvector<T> dat;\n\tint N, M;\n\t\n\tbit(){}\n\tbit(int _N): N(_N){\n\t\tdat.assign(_N,0);\n\t\tM = 0;\n\t\tint p = 0;\n\t\twhile(_N >= (1<<p)){\n\t\t\tM = (1<<p);\n\t\t\t++p;\n\t\t} // end while\n\t}\n\t\n\t// sum [0,i)\n\tT sum(int i){\n\t\tT ret = 0;\n\t\tfor (--i; i >= 0; i = (i & (i + 1)) - 1){\n\t\t\tret += dat[i];\n\t\t} // end for\n\t\treturn ret;\n\t}\n\n\t// sum [i,j)\n\tT sum(int i, int j){\n\t\treturn sum(j) - sum(i);\n\t}\n\n\t// add x to i\n\tvoid add(int i, T x){\n\t\tfor (; i < N; i |= i + 1) dat[i] += x;\n\t}\n\n\t// w ??????????°????????????????????????????0-indexed????????????\n\tint lowerBound(int w){\n\t\tif (w < 0) return -1;\n\t\tint x = 0;\n\t\tfor (int k = M; k > 0; k /= 2){\n\t\t\tif (x + k < N && dat[x + k - 1] <= w){\n\t\t\t\tw -= dat[x + k - 1];\n\t\t\t\tx += k;\n\t\t\t} // end if\n\t\t} // end for\n\t\treturn x;\n\t}\n};\n\nbit<int> bs;\nmap<int,int> id;\nint q, lim, l, r, vs[400010];\nbool done[400010];\n\nvoid normalize(void){\n\tif (bs.sum(r) > lim){\n\t\twhile(done[l]) ++l;\n\t\tdone[l] = 1;\n\t\tbs.add(l++, -1);\n\t} // end if\n}\n\nvoid solve(void){\n\tmemset(vs, 0, sizeof(vs));\n\tmemset(done, false, sizeof(done));\n\n\tid.clear();\n\tl = r = 0;\n\n\tbs = bit<int>(q);\n\twhile(q--){\n\t\tint v, x, p;\n\t\tcin >> v >> x;\n\t\tswitch(v){\n\t\t\tcase 0:\n\t\t\t\tid[x] = r;\n\t\t\t\tvs[r] = x;\n\t\t\t\tbs.add(r++, 1);\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tp = bs.lowerBound(x-1);\n\t\t\t\tbs.add(p, -1);\n\t\t\t\tdone[p] = true;\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tp = bs.lowerBound(x-1);\n\t\t\t\tcout << vs[p] << endl;\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tp = id[x];\n\t\t\t\tbs.add(p, -1);\n\t\t\t\tdone[p] = true;\n\t\t\t\tbreak;\n\t\t} // end switch\n\t\tnormalize();\n\t} // end while \n}\n\nbool input(void){\n\tcin >> q >> lim;\n\treturn (q || lim);\n}\n\nint main()\n{\n\tios_base::sync_with_stdio(0);\n\tcin.tie(0);\n\t\n\tfor(; input(); ){\n\t\tsolve();\n\t\tcout << \"end\" << endl;\n\t} // end for\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 25232,
"score_of_the_acc": -0.6428,
"final_rank": 3
},
{
"submission_id": "aoj_1083_2152687",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\ntemplate <class T>\nstruct BIT {\n\tint n;\n\tvector<T> x;\n\tBIT(int n_ = 0) : n(n_), x(n + 1, 0) {}\n\tint size() const { return n; }\n\tT sum(int r) const {\n\t\tT S = 0;\n\t\tfor(r = r - 1; r >= 0; r = (r & (r + 1)) - 1) S += x[r];\n\t\treturn S;\n\t}\n\tT sum(int l, int r) const { return sum(r) - sum(l); }\n\tvoid add(int k, const T &a) {\n\t\tfor(; k < n; k |= k + 1) x[k] += a;\n\t}\n\tvoid set(int k, const T &a) { add(k, a - sum(k, k + 1)); }\n};\n\ntypedef pair<int, int> P;\n\nint x[500000];\nint q, lim;\n\nint f(BIT<int>& b, int x) {\n\tint ng = -1, ok = q - 1;\n\twhile(abs(ng - ok) > 1) {\n\t\tint mid = (ng + ok) / 2;\n\t\tif(b.sum(0, mid + 1) >= x) ok = mid;\n\t\telse ng = mid;\n\t}\n\treturn ok;\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\twhile(cin >> q >> lim, q | lim) {\n\t\tBIT<int> b(q + 10);\n\t\tset<P> s;\n\t\tmap<int, int> tmap;\n\t\tfor(int i = 0; i < q; i++) {\n\t\t\tint type;\n\t\t\tcin >> type >> x[i];\n\t\t\t//cerr << \"type : \" << type << \", x : \" << x[i] << endl;\n\t\t\tif(type == 0) {\n\t\t\t\tif(s.size() == lim) {\n\t\t\t\t\tb.add(s.begin()->first, -1);\n\t\t\t\t\ttmap.erase(s.begin()->second);\n\t\t\t\t\ts.erase(s.begin());\n\t\t\t\t}\n\t\t\t\tb.add(i, 1);\n\t\t\t\ttmap[x[i]] = i;\n\t\t\t\ts.insert({ i, x[i] });\n\t\t\t}\n\t\t\telse if(type == 1) {\n\t\t\t\tint t = f(b, x[i]);\n\t\t\t\t//assert(b.sum(t, t + 1) == 1);\n\t\t\t\tb.add(t, -1);\n\t\t\t\ts.erase({ t, x[t] });\n\t\t\t\ttmap.erase(x[t]);\n\t\t\t}\n\t\t\telse if(type == 2) {\n\t\t\t\tint t = f(b, x[i]);\n\t\t\t\t//assert(b.sum(t, t + 1) == 1);\n\t\t\t\tcout << x[t] << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tb.add(tmap[x[i]], -1);\n\t\t\t\ts.erase({ tmap[x[i]], x[i] });\n\t\t\t\ttmap.erase(x[i]);\n\t\t\t}\n\t\t}\n\t\tcout << \"end\" << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 470,
"memory_kb": 12128,
"score_of_the_acc": -0.4432,
"final_rank": 1
},
{
"submission_id": "aoj_1083_2152683",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\ntemplate <class T>\nstruct BIT {\n\tint n;\n\tvector<T> x;\n\tBIT(int n_ = 0) : n(n_), x(n + 1, 0) {}\n\tint size() const { return n; }\n\tT sum(int r) const {\n\t\tT S = 0;\n\t\tfor(r = r - 1; r >= 0; r = (r & (r + 1)) - 1) S += x[r];\n\t\treturn S;\n\t}\n\tT sum(int l, int r) const { return sum(r) - sum(l); }\n\tvoid add(int k, const T &a) {\n\t\tfor(; k < n; k |= k + 1) x[k] += a;\n\t}\n\tvoid set(int k, const T &a) { add(k, a - sum(k, k + 1)); }\n};\n\ntypedef pair<int, int> P;\n\nint x[500000];\nint q, lim;\n\nint f(BIT<int>& b, int x) {\n\tint ng = -1, ok = q - 1;\n\twhile(abs(ng - ok) > 1) {\n\t\tint mid = (ng + ok) / 2;\n\t\tif(b.sum(0, mid + 1) >= x) ok = mid;\n\t\telse ng = mid;\n\t}\n\treturn ok;\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\twhile(cin >> q >> lim, q | lim) {\n\t\tBIT<int> b(q + 10);\n\t\tset<P> s;\n\t\tmap<int, int> tmap;\n\t\tfor(int i = 0; i < q; i++) {\n\t\t\tint type;\n\t\t\tcin >> type >> x[i];\n\t\t\t//cerr << \"type : \" << type << \", x : \" << x[i] << endl;\n\t\t\tif(type == 0) {\n\t\t\t\tif(s.size() == lim) {\n\t\t\t\t\tb.add(s.begin()->first, -1);\n\t\t\t\t\ttmap.erase(s.begin()->first);\n\t\t\t\t\ts.erase(s.begin());\n\t\t\t\t}\n\t\t\t\tb.add(i, 1);\n\t\t\t\ttmap[x[i]] = i;\n\t\t\t\ts.insert({ i, x[i] });\n\t\t\t}\n\t\t\telse if(type == 1) {\n\t\t\t\tint t = f(b, x[i]);\n\t\t\t\t//assert(b.sum(t, t + 1) == 1);\n\t\t\t\tb.add(t, -1);\n\t\t\t\ts.erase({ t, x[t] });\n\t\t\t\ttmap.erase(x[t]);\n\t\t\t}\n\t\t\telse if(type == 2) {\n\t\t\t\tint t = f(b, x[i]);\n\t\t\t\t//assert(b.sum(t, t + 1) == 1);\n\t\t\t\tcout << x[t] << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tb.add(tmap[x[i]], -1);\n\t\t\t\ts.erase({ tmap[x[i]], x[i] });\n\t\t\t\ttmap.erase(x[i]);\n\t\t\t}\n\t\t}\n\t\tcout << \"end\" << endl;\n\t}\n}",
"accuracy": 0.6666666666666666,
"time_ms": 470,
"memory_kb": 23020,
"score_of_the_acc": -0.7079,
"final_rank": 16
},
{
"submission_id": "aoj_1083_2152682",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\ntemplate <class T>\nstruct BIT {\n\tint n;\n\tvector<T> x;\n\tBIT(int n_ = 0) : n(n_), x(n + 1, 0) {}\n\tint size() const { return n; }\n\tT sum(int r) const {\n\t\tT S = 0;\n\t\tfor(r = r - 1; r >= 0; r = (r & (r + 1)) - 1) S += x[r];\n\t\treturn S;\n\t}\n\tT sum(int l, int r) const { return sum(r) - sum(l); }\n\tvoid add(int k, const T &a) {\n\t\tfor(; k < n; k |= k + 1) x[k] += a;\n\t}\n\tvoid set(int k, const T &a) { add(k, a - sum(k, k + 1)); }\n};\n\ntypedef pair<int, int> P;\n\nint x[400000];\nint q, lim;\n\nint f(BIT<int>& b, int x) {\n\tint ng = -1, ok = q - 1;\n\twhile(abs(ng - ok) > 1) {\n\t\tint mid = (ng + ok) / 2;\n\t\tif(b.sum(0, mid + 1) >= x) ok = mid;\n\t\telse ng = mid;\n\t}\n\treturn ok;\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\twhile(cin >> q >> lim, q | lim) {\n\t\tBIT<int> b(q);\n\t\tset<P> s;\n\t\tmap<int, int> tmap;\n\t\tfor(int i = 0; i < q; i++) {\n\t\t\tint type;\n\t\t\tcin >> type >> x[i];\n\t\t\t//cerr << \"type : \" << type << \", x : \" << x[i] << endl;\n\t\t\tif(type == 0) {\n\t\t\t\tif(s.size() == lim) {\n\t\t\t\t\tb.add(s.begin()->first, -1);\n\t\t\t\t\ttmap.erase(s.begin()->first);\n\t\t\t\t\ts.erase(s.begin());\n\t\t\t\t}\n\t\t\t\tb.add(i, 1);\n\t\t\t\ttmap[x[i]] = i;\n\t\t\t\ts.insert({ i, x[i] });\n\t\t\t}\n\t\t\telse if(type == 1) {\n\t\t\t\tint t = f(b, x[i]);\n\t\t\t\t//assert(b.sum(t, t + 1) == 1);\n\t\t\t\tb.add(t, -1);\n\t\t\t\ts.erase({ t, x[t] });\n\t\t\t\ttmap.erase(x[t]);\n\t\t\t}\n\t\t\telse if(type == 2) {\n\t\t\t\tint t = f(b, x[i]);\n\t\t\t\t//assert(b.sum(t, t + 1) == 1);\n\t\t\t\tcout << x[t] << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tb.add(tmap[x[i]], -1);\n\t\t\t\ts.erase({ tmap[x[i]], x[i] });\n\t\t\t\ttmap.erase(x[i]);\n\t\t\t}\n\t\t}\n\t\tcout << \"end\" << endl;\n\t}\n}",
"accuracy": 0.6666666666666666,
"time_ms": 470,
"memory_kb": 22948,
"score_of_the_acc": -0.7062,
"final_rank": 15
}
] |
aoj_1086_cpp
|
Problem C: Live Schedule
YOKARI TAMURAは全国的に有名なアーティストである。今月YOKARIは D 日間にわたってライブツアーを行う。ツアーのスケジュールの決定においてこの国を C 種類の地域でわける。YOKARIがある地域でライブを行うことにより利益を得られ、これは正の整数で表される。YOKARIは原則として 1 日に最大 1 つまでライブを行う。ただし、ある地域でライブを行った後、隣接する地域でライブを行える場合はその地域で同じ日に再びライブを行うことができる。この条件を満たす限り、地域を移動しながら何度もライブを行うことができる。また、同じ日に同じ地域でライブを 2 度以上行うことはできない。さらに、同じ日に 2 回以上のライブを行う日の数はツアー期間中合計 X 以下でなければならない。
あなたはYOKARIの関係者であり、彼女のライブツアーのスケジュールを仮決めしなくてはならない。どの日にどの地域でライブを行えばもっとも有益だろうか。ただし 1 回のライブごとにYOKARIには非負の整数で表される負担がかかり、ツアー期間中の合計負担は W 以内でなければならない。あなたの仕事は各ライブでYOKARIにかかる負担と期待される利益を読み込み、スケジュールを仮決めして、利益合計の最大値を出力することである。
Input
入力は複数のテストケースからなる。
ひとつのテストケースは以下の形式に従う。
C D W X
E
1,1
E
1,1
… E
1,D
E
2,1
E
2,1
… E
2,D
…
E
C,1
E
C,2
… E
C,D
F
1,1
F
1,1
… F
1,D
F
2,1
F
2,1
… F
2,D
…
F
C,1
F
C,2
… F
C,D
C は地域の種類数、D はツアー期間の長さ、W はこのツアーでYOKARIに許容される負担の合計の最大値、X はツアー期間中にライブを同じ日に 2 度以上行える合計日数の上限である。
E
i,j
( 1 ≤ i ≤ C かつ 1 ≤ j ≤ D ) は地域 i で j 日目にライブを行うことで期待される利益である。E
i,j
が 0 のとき地域 i で j 日目にライブを行えないことを示す。
F
i,j
( 1 ≤ i ≤ C かつ 1 ≤ j ≤ D ) は地域 i で j 日目にライブを行うことでYOKARIにかかる負担である。E
i,j
が 0 のとき、この値は0である。
地域 i は地域 i + 1 と i - 1 それぞれに隣接する。ただし地域 1 と地域 C ( C > 2 ) は隣接しない。
入力の終わりは、4個の0がそれぞれ一文字の空白で区切られる一行で示される。
Constraints
入力はすべて整数
1 ≤ C ≤ 15
1 ≤ D ≤ 30
0 ≤ W ≤ 50
0 ≤ X ≤ 5
0 ≤ E
i,j
≤ 1,000
0 ≤ F
i,j
≤ 10
テストケースの数は 100 を超えない。
Output
各ケースに付き、スケジュールを仮決めして期待される利益合計の最大値を 1 行に出力せよ。
Sample Input
5 5 10 2
1 1 0 1 1
0 9 1 0 1
1 1 1 9 1
1 1 9 0 1
1 1 1 1 0
1 1 0 1 1
0 9 1 0 1
1 1 1 9 1
1 1 1 0 1
1 1 1 1 0
1 1 10 0
3
7
1 1 5 0
3
6
1 2 10 1
6 7
5 6
2 1 10 1
4
8
3
7
2 1 10 0
4
8
3
7
2 1 5 0
4
8
3
6
0 0 0 0
Sample Output
18
3
0
7
12
8
4
|
[
{
"submission_id": "aoj_1086_2630538",
"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 C,D,W,X;\nint E_table[16][30],F_table[16][30],G_table[16][30];\nint dp[31][51][6];\n\nbool rangeCheck(int area){\n\tif(area >= 0 && area <= C-1){\n\t\treturn true;\n\t}else{\n\t\treturn false;\n\t}\n}\n\n\nvoid func(){\n\n\tfor(int area = 1; area <= C; area++){\n\t\tfor(int day = 0; day < D; day++){\n\t\t\tscanf(\"%d\",&E_table[area][day]);\n\t\t\tif(E_table[area][day] == 0){\n\t\t\t\tG_table[area][day] = 0;\n\t\t\t}else{\n\t\t\t\tG_table[area][day] = 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int area = 1; area <= C; area++){\n\t\tfor(int day = 0; day < D; day++)scanf(\"%d\",&F_table[area][day]);\n\t}\n\n\tfor(int day = 0; day <= D-1; day++){\n\t\tfor(int area = 1; area <= C; area++){\n\t\t\tE_table[area][day] += E_table[area-1][day];\n\t\t\tF_table[area][day] += F_table[area-1][day];\n\t\t\tG_table[area][day] += G_table[area-1][day];\n\t\t}\n\t}\n\n\tfor(int day = 0; day <= D; day++){\n\t\tfor(int futan = 0; futan <= W; futan++){\n\t\t\tfor(int num = 0; num <= X; num++){\n\t\t\t\tdp[day][futan][num] = -1;\n\t\t\t}\n\t\t}\n\t}\n\n\tdp[0][0][0] = 0;\n\n\tint ans = 0;\n\tint tmp_futan,tmp_E,tmp_G;\n\n\tfor(int day = 0; day <= D-1; day++){\n\t\tfor(int futan = 0; futan <= W; futan++){\n\t\t\tfor(int num = 0; num <= X; num++){\n\t\t\t\tif(dp[day][futan][num] == -1)continue;\n\n\t\t\t\tdp[day+1][futan][num] = max(dp[day+1][futan][num],dp[day][futan][num]);\n\n\t\t\t\tfor(int area = 1; area <= C; area++){\n\t\t\t\t\ttmp_E = E_table[area][day]-E_table[area-1][day];\n\t\t\t\t\ttmp_futan = F_table[area][day]-F_table[area-1][day];\n\n\t\t\t\t\tif(tmp_E == 0 || futan+tmp_futan > W)continue;\n\n\t\t\t\t\tdp[day+1][futan+tmp_futan][num] = max(dp[day+1][futan+tmp_futan][num],dp[day][futan][num]+tmp_E);\n\t\t\t\t\tans = max(ans,dp[day+1][futan+tmp_futan][num]);\n\n\t\t\t\t\tif(num == X)continue;\n\n\t\t\t\t\tfor(int count = 2; area+count <= C+1; count++){\n\t\t\t\t\t\ttmp_G = G_table[area+count-1][day]-G_table[area-1][day];\n\t\t\t\t\t\tif(tmp_G != count)break;\n\n\t\t\t\t\t\ttmp_futan = F_table[area+count-1][day]-F_table[area-1][day];\n\t\t\t\t\t\tif(futan+tmp_futan > W)break;;\n\n\t\t\t\t\t\ttmp_E = E_table[area+count-1][day]-E_table[area-1][day];\n\n\t\t\t\t\t\tdp[day+1][futan+tmp_futan][num+1] = max(dp[day+1][futan+tmp_futan][num+1],dp[day][futan][num]+tmp_E);\n\t\t\t\t\t\tans = max(ans,dp[day+1][futan+tmp_futan][num+1]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\tfor(int day = 0; day <= 29; day++){\n\t\tE_table[0][day] = 0;\n\t\tF_table[0][day] = 0;\n\t\tG_table[0][day] = 0;\n\t}\n\n\twhile(true){\n\t\tscanf(\"%d %d %d %d\",&C,&D,&W,&X);\n\t\tif(C == 0 && D == 0 && W == 0 && X == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3172,
"score_of_the_acc": -0.7844,
"final_rank": 9
},
{
"submission_id": "aoj_1086_2630523",
"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 C,D,W,X;\nint E_table[15][30],F_table[15][30];\nint dp[31][51][6];\n\nbool rangeCheck(int area){\n\tif(area >= 0 && area <= C-1){\n\t\treturn true;\n\t}else{\n\t\treturn false;\n\t}\n}\n\n\nvoid func(){\n\n\tfor(int area = 0; area < C; area++){\n\t\tfor(int day = 0; day < D; day++)scanf(\"%d\",&E_table[area][day]);\n\t}\n\n\tfor(int area = 0; area < C; area++){\n\t\tfor(int day = 0; day < D; day++)scanf(\"%d\",&F_table[area][day]);\n\t}\n\n\tfor(int day = 0; day <= D; day++){\n\t\tfor(int futan = 0; futan <= W; futan++){\n\t\t\tfor(int num = 0; num <= X; num++){\n\t\t\t\tdp[day][futan][num] = -1;\n\t\t\t}\n\t\t}\n\t}\n\n\tdp[0][0][0] = 0;\n\n\tint ans = 0;\n\tbool FLG;\n\tint tmp_futan,tmp_E;\n\n\tfor(int day = 0; day <= D-1; day++){\n\t\tfor(int futan = 0; futan <= W; futan++){\n\t\t\tfor(int num = 0; num <= X; num++){\n\t\t\t\tif(dp[day][futan][num] == -1)continue;\n\n\t\t\t\tdp[day+1][futan][num] = max(dp[day+1][futan][num],dp[day][futan][num]);\n\n\t\t\t\tfor(int area = 0; area <= C-1; area++){\n\t\t\t\t\tif(E_table[area][day] == 0 || futan+F_table[area][day] > W)continue;\n\n\t\t\t\t\tdp[day+1][futan+F_table[area][day]][num] = max(dp[day+1][futan+F_table[area][day]][num],dp[day][futan][num]+E_table[area][day]);\n\t\t\t\t\tans = max(ans,dp[day+1][futan+F_table[area][day]][num]);\n\n\t\t\t\t\tif(num == X)continue;\n\n\t\t\t\t\tfor(int count = 2; area+count <= C; count++){\n\t\t\t\t\t\tFLG = true;\n\t\t\t\t\t\ttmp_futan = 0;\n\t\t\t\t\t\ttmp_E = 0;\n\t\t\t\t\t\tfor(int i = 0; i < count; i++){\n\t\t\t\t\t\t\tif(rangeCheck(area+i) == false || E_table[area+i][day] == 0){\n\t\t\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttmp_futan += F_table[area+i][day];\n\t\t\t\t\t\t\ttmp_E += E_table[area+i][day];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(FLG == false || futan+tmp_futan > W)continue;\n\n\t\t\t\t\t\tdp[day+1][futan+tmp_futan][num+1] = max(dp[day+1][futan+tmp_futan][num+1],dp[day][futan][num]+tmp_E);\n\t\t\t\t\t\tans = max(ans,dp[day+1][futan+tmp_futan][num+1]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d %d %d\",&C,&D,&W,&X);\n\t\tif(C == 0 && D == 0 && W == 0 && X == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 370,
"memory_kb": 3172,
"score_of_the_acc": -0.8904,
"final_rank": 14
},
{
"submission_id": "aoj_1086_2178251",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\nint C, D, W, X, a[33][17], b[33][17], dp[33][55][7];\nint solve(int d, int s, int x) {\n\tif (d == D) return 0;\n\tif (dp[d][s][x]) return dp[d][s][x] - 1;\n\tint ret = solve(d + 1, s, x);\n\tfor (int i = 0; i < C; i++) {\n\t\tif (s + b[d][i] <= W && a[d][i] != 0) {\n\t\t\tint res = solve(d + 1, s + b[d][i], x);\n\t\t\tret = max(ret, res + a[d][i]);\n\t\t}\n\t}\n\tif (x != X) {\n\t\tfor (int i = 0; i < C; i++) {\n\t\t\tint sum = 0, prof = 0;\n\t\t\tfor (int j = i; j < C; j++) {\n\t\t\t\tprof += a[d][j];\n\t\t\t\tsum += b[d][j];\n\t\t\t\tif (a[d][j] == 0 || s + sum > W) break;\n\t\t\t\tint res = solve(d + 1, s + sum, x + 1);\n\t\t\t\tret = max(ret, res + prof);\n\t\t\t}\n\t\t}\n\t}\n\tdp[d][s][x] = ret + 1;\n\treturn ret;\n}\nint main() {\n\twhile (cin >> C >> D >> W >> X, C) {\n\t\tfor (int i = 0; i < C; i++) {\n\t\t\tfor (int j = 0; j < D; j++) {\n\t\t\t\tcin >> a[j][i];\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < C; i++) {\n\t\t\tfor (int j = 0; j < D; j++) {\n\t\t\t\tcin >> b[j][i];\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i <= D; i++) {\n\t\t\tfor (int j = 0; j <= W; j++) {\n\t\t\t\tfor (int k = 0; k <= X; k++) {\n\t\t\t\t\tdp[i][j][k] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ret = solve(0, 0, 0);\n\t\tcout << ret << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 160,
"memory_kb": 3064,
"score_of_the_acc": -0.7513,
"final_rank": 7
},
{
"submission_id": "aoj_1086_2173601",
"code_snippet": "#include<iostream>\nusing namespace std;\nint dp[32][52][10],C,D,W,X,e[16][32],f[16][32];\nint solve(int d,int w,int p){\n\tif(w>W)return -999999999;\n\tif(p>X)return -999999999;\n\tif(d==D)return 0;\n\tif(dp[d][w][p]>=0)return dp[d][w][p];\n\tint maxn=solve(d+1,w,p);\n\tfor(int i=0;i<C;i++){\n\t\tfor(int j=i;j<C;j++){\n\t\t\tbool OK=false;for(int k=i;k<=j;k++){if(e[k][d]==0)OK=true;}\n\t\t\tif(OK==true)continue;\n\t\t\tint s=0;for(int k=i;k<=j;k++)s+=e[k][d];\n\t\t\tint t=0;for(int k=i;k<=j;k++)t+=f[k][d];\n\t\t\tint u=0;if(j-i>=1)u=1;\n\t\t\tmaxn=max(maxn,solve(d+1,w+t,p+u)+s);\n\t\t}\n\t}\n\tdp[d][w][p]=maxn;\n\treturn maxn;\n}\nint main(){\n\twhile(true){\n\t\tcin>>C>>D>>W>>X;if(C+D+W+X==0)break;\n\t\tfor(int i=0;i<=D;i++){for(int j=0;j<=W;j++){for(int k=0;k<=X;k++)dp[i][j][k]=(-1LL<<30);}}\n\t\tfor(int i=0;i<C;i++){for(int j=0;j<D;j++)cin>>e[i][j];}\n\t\tfor(int i=0;i<C;i++){for(int j=0;j<D;j++)cin>>f[i][j];}\n\t\tcout<<solve(0,0,0)<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 800,
"memory_kb": 3060,
"score_of_the_acc": -1.0446,
"final_rank": 19
},
{
"submission_id": "aoj_1086_2107089",
"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<stack>\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 vector<string> vs;\ntypedef vector<double> vd;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nint main(){\n\tint c,d,w,x;\n\twhile(cin>>c>>d>>w>>x,c+d+w+x){\n\t\tvvi dp(x+1,vi(w+1,-inf));\n\t\tdp[0][0]=0;\n\t\tvvi e(c,vi(d));\n\t\tvvi f(c,vi(d));\n\t\trep(i,c)rep(j,d)cin>>e[i][j];\n\t\trep(i,c)rep(j,d)cin>>f[i][j];\n\t\trep(i,d){\n\t\t\tvvi ndp=dp;\n\t\t\trep(j,c)if(e[j][i]){\n\t\t\t\tint sume=0,sumf=0;\n\t\t\t\tloop(k,j,c){\n\t\t\t\t\tif(e[k][i]==0)break;\n\t\t\t\t\tsume+=e[k][i];\n\t\t\t\t\tsumf+=f[k][i];\n\t\t\t\t\trep(l,x+1)rep(q,w+1)if(dp[l][q]!=-inf){\n\t\t\t\t\t\tint L=(j==k?l:l+1);\n\t\t\t\t\t\tif(L>=x+1||q+sumf>=w+1)continue;\n\t\t\t\t\t\tndp[L][q+sumf]=max(ndp[L][q+sumf],dp[l][q]+sume);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tdp=ndp;\n//\t\t\trep(j,x+1){\n//\t\t\t\trep(k,w+1)cout<<\" \"<<(dp[j][k]==-inf?0:dp[j][k]);cout<<endl;\n//\t\t\t}\n//\t\t\tcout<<endl;\n\t\t}\n\t\tint out=0;\n\t\trep(i,x+1)rep(j,w+1)out=max(out,dp[i][j]);\n\t\tcout<<out<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3176,
"score_of_the_acc": -0.763,
"final_rank": 8
},
{
"submission_id": "aoj_1086_2076745",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n\nint C,D,W,X;\nint E[15][30],F[15][30];\n\nint dp[31][51][6];\nint dfs(int day, int cost, int x)\n{\n if(dp[day][cost][x]>=0) return dp[day][cost][x];\n if(day==D) return 0;\n\n int ret=0;\n\n // ??????????????????\n ret=max(ret,dfs(day+1,cost,x));\n\n rep(place,C)\n {\n if(E[place][day]==0) continue;\n\n // 1????????????\n if(cost+F[place][day]<=W) ret=max(ret,dfs(day+1,cost+F[place][day],x)+E[place][day]);\n\n // ?????°????????????\n if(x==X) continue;\n\n int tcost=cost+F[place][day];\n int tE=E[place][day];\n int now=place-1;\n while(now>=0)\n {\n if(E[now][day]==0) break;\n if(tcost+F[now][day]>W) break;\n\n tcost+=F[now][day];\n tE+=E[now][day];\n ret=max(ret,dfs(day+1,tcost,x+1)+tE);\n --now;\n }\n\n tcost=cost+F[place][day];\n tE=E[place][day];\n now=place+1;\n while(now<C)\n {\n if(E[now][day]==0) break;\n if(tcost+F[now][day]>W) break;\n\n tcost+=F[now][day];\n tE+=E[now][day];\n ret=max(ret,dfs(day+1,tcost,x+1)+tE);\n ++now;\n }\n }\n\n return dp[day][cost][x]=ret;\n}\n\nint main()\n{\n while(scanf(\" %d %d %d %d\",&C,&D,&W,&X),C)\n {\n rep(i,C)rep(j,D) scanf(\" %d\", &E[i][j]);\n rep(i,C)rep(j,D) scanf(\" %d\", &F[i][j]);\n memset(dp,-1,sizeof(dp));\n printf(\"%d\\n\", dfs(0,0,0));\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 3124,
"score_of_the_acc": -0.8117,
"final_rank": 11
},
{
"submission_id": "aoj_1086_2076740",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n\nint C,D,W,X;\nint E[15][30],F[15][30];\n\nint dp[31][51][6];\nint dfs(int day, int cost, int x)\n{\n if(dp[day][cost][x]>=0) return dp[day][cost][x];\n if(day==D) return 0;\n\n int ret=0;\n\n // ??????????????????\n ret=max(ret,dfs(day+1,cost,x));\n\n rep(place,C)\n {\n if(E[place][day]==0) continue;\n\n // 1????????????\n if(cost+F[place][day]<=W) ret=max(ret,dfs(day+1,cost+F[place][day],x)+E[place][day]);\n\n // ?????°????????????\n if(x==X) continue;\n\n int tcost=cost+F[place][day];\n int tE=E[place][day];\n int now=place-1;\n while(now>=0)\n {\n if(E[now][day]==0) break;\n if(tcost+F[now][day]>W) break;\n\n tcost+=F[now][day];\n tE+=E[now][day];\n ret=max(ret,dfs(day+1,tcost,x+1)+tE);\n\n --now;\n }\n\n tcost=cost+F[place][day];\n tE=E[place][day];\n now=place+1;\n while(now<C)\n {\n if(E[now][day]==0) break;\n if(tcost+F[now][day]>W) break;\n\n tcost+=F[now][day];\n tE+=E[now][day];\n ret=max(ret,dfs(day+1,tcost,x+1)+tE);\n ++now;\n }\n }\n\n dp[day][cost][x]=ret;\n return ret;\n}\n\nint main()\n{\n while(scanf(\" %d %d %d %d\",&C,&D,&W,&X),C)\n {\n rep(i,C)rep(j,D) scanf(\" %d\", &E[i][j]);\n rep(i,C)rep(j,D) scanf(\" %d\", &F[i][j]);\n memset(dp,-1,sizeof(dp));\n printf(\"%d\\n\", dfs(0,0,0));\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 3232,
"score_of_the_acc": -0.8541,
"final_rank": 12
},
{
"submission_id": "aoj_1086_2076738",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n\nint C,D,W,X;\nint E[15][30],F[15][30];\n\nint dp[31][51][6];\nint dfs(int day, int cost, int x)\n{\n if(dp[day][cost][x]>=0) return dp[day][cost][x];\n if(day==D) return 0;\n\n int ret=0;\n\n // ??????????????????\n ret=max(ret,dfs(day+1,cost,x));\n\n rep(place,C)\n {\n if(E[place][day]==0) continue;\n\n // 1????????????\n if(cost+F[place][day]<=W) ret=max(ret,dfs(day+1,cost+F[place][day],x)+E[place][day]);\n\n // ?????°????????????\n if(x==X) continue;\n\n int tcost=cost+F[place][day];\n int tE=E[place][day];\n int now=place-1;\n while(now>=0)\n {\n if(E[now][day]==0) break;\n if(tcost+F[now][day]>W) break;\n\n tcost+=F[now][day];\n tE+=E[now][day];\n ret=max(ret,dfs(day+1,tcost,x+1)+tE);\n\n --now;\n }\n\n tcost=cost+F[place][day];\n tE=E[place][day];\n now=place+1;\n while(now<C)\n {\n if(E[now][day]==0) break;\n if(tcost+F[now][day]>W) break;\n\n tcost+=F[now][day];\n tE+=E[now][day];\n ret=max(ret,dfs(day+1,tcost,x+1)+tE);\n ++now;\n }\n }\n\n dp[day][cost][x]=ret;\n return ret;\n}\n\nint main()\n{\n while(scanf(\" %d %d %d %d\",&C,&D,&W,&X),C)\n {\n rep(i,C)rep(j,D) scanf(\" %d\", &E[i][j]);\n rep(i,C)rep(j,D) scanf(\" %d\", &F[i][j]);\n\n memset(dp,-1,sizeof(dp));\n int ans=0;\n ans=max(ans,dfs(0,0,0));\n printf(\"%d\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 3244,
"score_of_the_acc": -0.8634,
"final_rank": 13
},
{
"submission_id": "aoj_1086_2076729",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n\nint C,D,W,X;\nint E[15][30],F[15][30];\n\nint dp[31][51][15][6];\nint dfs(int day, int cost, int place, int two)\n{\n if(dp[day][cost][place][two]>=0) return dp[day][cost][place][two];\n if(day==D) return 0;\n\n int ret=0;\n\n // ??????????????????\n rep(i,C) ret=max(ret,dfs(day+1,cost,i,two));\n\n if(E[place][day]>0)\n {\n // 1????????????\n if(cost+F[place][day]<=W)\n {\n rep(i,C) ret=max(ret,dfs(day+1,cost+F[place][day],i,two)+E[place][day]);\n }\n\n // ?????°????????????\n if(two<X)\n {\n int tcost=cost+F[place][day];\n int tE=E[place][day];\n int now=place-1;\n while(now>=0)\n {\n if(E[now][day]==0) break;\n if(tcost+F[now][day]>W) break;\n\n tcost+=F[now][day];\n tE+=E[now][day];\n rep(i,C) ret=max(ret,dfs(day+1,tcost,i,two+1)+tE);\n\n --now;\n }\n\n tcost=cost+F[place][day];\n tE=E[place][day];\n now=place+1;\n while(now<C)\n {\n if(E[now][day]==0) break;\n if(tcost+F[now][day]>W) break;\n\n tcost+=F[now][day];\n tE+=E[now][day];\n rep(i,C) ret=max(ret,dfs(day+1,tcost,i,two+1)+tE);\n ++now;\n }\n }\n }\n\n dp[day][cost][place][two]=ret;\n return ret;\n}\n\nint main()\n{\n while(scanf(\" %d %d %d %d\",&C,&D,&W,&X),C)\n {\n rep(i,C)rep(j,D) scanf(\" %d\", &E[i][j]);\n rep(i,C)rep(j,D) scanf(\" %d\", &F[i][j]);\n\n memset(dp,-1,sizeof(dp));\n int ans=0;\n rep(i,C) ans=max(ans,dfs(0,0,i,0));\n printf(\"%d\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2260,
"memory_kb": 3780,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_1086_1915538",
"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\" > \"D:\\D_Download\\Visual Studio 2015\\Projects\\programing_contest_c++\\Debug\\b.answer\"\nint dp[31][51][6];\nint main() {\n\twhile (1) {\n\t\tfor (int i = 0; i < 31; ++i) {\n\t\t\tfor (int j = 0; j < 51; ++j) {\n\t\t\t\tfor (int k = 0; k < 6; ++k) {\n\t\t\t\t\tdp[i][j][k] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint C, D, W, X; cin >> C >> D >> W >> X;\n\t\tif (!C)break;\n\t\tvector<vector<int>>es(C, vector<int>(D));\n\t\tfor (int i = 0; i < C; ++i) {\n\t\t\tfor (int j = 0; j < D; ++j) {\n\t\t\t\tcin >> es[i][j];\n\t\t\t}\n\t\t}\n\t\tvector<vector<int>>fs(C, vector<int>(D));\n\t\tfor (int i = 0; i < C; ++i) {\n\t\t\tfor (int j = 0; j < D; ++j) {\n\t\t\t\tcin >> fs[i][j];\n\t\t\t}\n\t\t}\n\t\tfor (int d = 0; d < D; ++d) {\n\t\t\tfor (int w = 0; w <= W; ++w) {\n\t\t\t\tfor (int k = 0; k <= X; ++k) {\n\t\t\t\t\tdp[d + 1][w][k] = max(dp[d + 1][w][k], dp[d][w][k]);\n\t\t\t\t\tfor (int l = 0; l < C; ++l) {\n\t\t\t\t\t\tint esum = 0;\n\t\t\t\t\t\tint fsum = 0;\n\t\t\t\t\t\tfor (int r = l; r < C; ++r) {\n\t\t\t\t\t\t\tif (es[r][d]) {\n\t\t\t\t\t\t\t\tesum += es[r][d];\n\t\t\t\t\t\t\t\tfsum += fs[r][d];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tconst int nextw = w + fsum;\n\t\t\t\t\t\t\tconst int nexte = dp[d][w][k] + esum;\n\t\t\t\t\t\t\tconst int nextk = k + (l == r ? 0 : 1);\n\t\t\t\t\t\t\tif (nextw <= W&&nextk <= X) {\n\t\t\t\t\t\t\t\tdp[d + 1][nextw][nextk] = max(dp[d + 1][nextw][nextk], nexte);\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\tint ans = 0;\n\t\tfor (int w = 0; w <= W; ++w) {\n\t\t\tfor (int k = 0; k <= X; ++k) {\n\t\t\t\tans = max(dp[D][w][k], ans);\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 3164,
"score_of_the_acc": -0.7951,
"final_rank": 10
},
{
"submission_id": "aoj_1086_1876755",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint E[50][50],F[50][50],mem[31][51][6],used[31][51][6];\nint D,c,X,W;\n\nint dfs(int d,int cost,int x){\n if(D==d)return 0;\n if(used[d][cost][x]) return mem[d][cost][x];\n used[d][cost][x]=1;\n \n int res=dfs(d+1,cost,x); \n\n for(int i=0;i<c;i++){\n int ncost=cost+F[i][d];\n if(ncost>W)continue;\n if(!E[i][d]||ncost>W)continue;\n res=max(res,dfs(d+1,ncost,x)+E[i][d]);\n \n if(x>=X)continue;\n int ee=E[i][d],cc=ncost;\n for(int j=i+1;j<c;j++){\n ee+=E[j][d],cc+=F[j][d];\n if(!E[j][d]||cc>W)break;\n res=max(res,dfs(d+1,cc,x+1)+ee);\n }\n \n ee=E[i][d],cc=ncost;\n for(int j=i-1;j>=0;j--){\n ee+=E[j][d],cc+=F[j][d];\n if(!E[j][d]||cc>W)break;\n res=max(res,dfs(d+1,cc,x+1)+ee); \n }\n }\n return mem[d][cost][x]=res;\n}\n\nint main(){\n while(1){\n cin>>c>>D>>W>>X;\n if(!c&&!D&&!W&&!X) break;\n memset(used,0,sizeof(used)), memset(mem,0,sizeof(mem));\n for(int i=0;i<c;i++)for(int j=0;j<D;j++) cin>>E[i][j];\n for(int i=0;i<c;i++)for(int j=0;j<D;j++) cin>>F[i][j];\n cout << dfs(0,0,0)<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 460,
"memory_kb": 1252,
"score_of_the_acc": -0.1784,
"final_rank": 3
},
{
"submission_id": "aoj_1086_1876739",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint E[50][50],F[50][50],mem[31][51][6],used[31][51][6];\nint D,c,X,W;\n\nint dfs(int d,int cost,int x){\n if(D==d)return 0;\n if(used[d][cost][x]) return mem[d][cost][x];\n used[d][cost][x]=1;\n \n int res=dfs(d+1,cost,x); \n\n for(int i=0;i<c;i++){\n int ncost=cost+F[i][d];\n if(ncost>W)continue;\n if(!E[i][d]||ncost>W)continue;\n res=max(res,dfs(d+1,ncost,x)+E[i][d]);\n \n if(x>=X)continue;\n int ee=E[i][d],cc=cost+F[i][d];\n for(int j=i+1;j<c;j++){\n ee+=E[j][d],cc+=F[j][d];\n if(!E[j][d]||cc>W)break;\n res=max(res,dfs(d+1,cc,x+1)+ee);\n }\n \n ee=E[i][d],cc=cost+F[i][d];\n for(int j=i-1;j>=0;j--){\n ee+=E[j][d],cc+=F[j][d];\n if(!E[j][d]||cc>W)break;\n res=max(res,dfs(d+1,cc,x+1)+ee); \n }\n }\n return mem[d][cost][x]=res;\n}\n\nint main(){\n while(1){\n cin>>c>>D>>W>>X;\n if(!c&&!D&&!W&&!X) break;\n memset(used,0,sizeof(used)), memset(mem,0,sizeof(mem));\n for(int i=0;i<c;i++)for(int j=0;j<D;j++) cin>>E[i][j];\n for(int i=0;i<c;i++)for(int j=0;j<D;j++) cin>>F[i][j];\n cout << dfs(0,0,0)<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 490,
"memory_kb": 1252,
"score_of_the_acc": -0.1922,
"final_rank": 4
},
{
"submission_id": "aoj_1086_1876426",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int inf = (1 << 25);\n\nint C, D, W, X;\nint E[16][32], F[16][32];\n\nint dp[32][64][8];\n\nint solve(int d, int w, int x)\n{\n if(w > W || x > X) return -inf;\n if(d == D) return 0; \n if(~dp[d][w][x]) return dp[d][w][x];\n int ret = solve(d+1, w, x);\n for(int i = 0; i < C; i++){\n int le = 0, lf = 0, re = 0, rf = 0;\n for(int j = 0; j < C; j++){\n if(i - j >= 0 && le >= 0){\n\tle += E[i-j][d], lf += F[i-j][d];\n\tret = max(ret, solve(d+1, w+lf, x+(j!=0)) + le);\n }\n if(i + j < C && re >= 0){\n\tre += E[i+j][d], rf += F[i+j][d];\n\tret = max(ret, solve(d+1, w+rf, x+(j!=0)) + re);\n }\n }\n }\n return dp[d][w][x] = ret;\n}\n\nint main()\n{\n while(cin >> C >> D >> W >> X, C || D || W || X){\n memset(E, 0, sizeof(E));\n memset(F, 0, sizeof(F));\n for(int i = 0; i < C; i++){\n for(int j = 0; j < D; j++) cin >> E[i][j], E[i][j] = (E[i][j] == 0 ? -inf : E[i][j]);\n }\n for(int i = 0; i < C; i++){\n for(int j = 0; j < D; j++) cin >> F[i][j], F[i][j] = (E[i][j] == -inf ? inf : F[i][j]);\n }\n memset(dp, -1, sizeof(dp));\n cout << solve(0, 0, 0) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 900,
"memory_kb": 1236,
"score_of_the_acc": -0.3748,
"final_rank": 6
},
{
"submission_id": "aoj_1086_1876267",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \nint C, D, W, X;\nint E[16][31], F[16][31];\nint memo[31][51][6];\nconst int dx[] = {-1, 1};\n \nint solve(int d, int w, int x)\n{\n if (d == D) return 0;\n \n int &res = memo[d][w][x];\n if (res != -1) return res;\n \n res = solve(d+1, w, x);\n \n for (int i = 0; i < C; i++) {\n if (E[i][d] == 0) continue;\n if (w + F[i][d] <= W) {\n res = max(res, solve(d+1, w + F[i][d], x) + E[i][d]); \n } \n if (x + 1 > X) continue;\n for (int j = 0; j < 2; j++) {\n int nx = i, cost = 0, f = 0;\n while (1) {\n if (nx < 0 || nx >= C || E[nx][d] == 0) break;\n f += F[nx][d];\n cost += E[nx][d];\n if (w + f <= W) {\n res = max(res, solve(d+1, w + f, x+1) + cost);\n }\n nx += dx[j];\n }\n } \n }\n return res;\n}\n \nint main()\n{\n while (cin >> C >> D >> W >> X, C) {\n for (int i = 0; i < C; i++) {\n for (int j = 0; j < D; j++) {\n cin >> E[i][j];\n }\n }\n \n for (int i = 0; i < C; i++) {\n for (int j = 0; j < D; j++) {\n cin >> F[i][j];\n }\n }\n \n memset(memo, -1, sizeof(memo));\n \n int res = solve(0, 0, 0);\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 530,
"memory_kb": 3116,
"score_of_the_acc": -0.9422,
"final_rank": 17
},
{
"submission_id": "aoj_1086_1876262",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \nint C, D, W, X;\nint E[16][31], F[16][31];\nint memo[31][51][6];\nconst int dx[] = {-1, 1};\n \nint solve(int d, int w, int x)\n{\n if (d == D) return 0;\n \n int &res = memo[d][w][x];\n if (res != -1) return res;\n \n res = solve(d+1, w, x);\n \n for (int i = 0; i < C; i++) {\n if (w + F[i][d] <= W && E[i][d] != 0) {\n res = max(res, solve(d+1, w + F[i][d], x) + E[i][d]); \n } \n if (x + 1 > X) continue;\n for (int j = 0; j < 2; j++) {\n int nx = i, cost = 0, f = 0;\n while (1) {\n if (nx < 0 || nx >= C || E[nx][d] == 0) break;\n f += F[nx][d];\n cost += E[nx][d];\n if (w + f <= W) {\n res = max(res, solve(d+1, w + f, x+1) + cost);\n }\n nx += dx[j];\n }\n } \n }\n return res;\n}\n \nint main()\n{\n while (cin >> C >> D >> W >> X, C) {\n for (int i = 0; i < C; i++) {\n for (int j = 0; j < D; j++) {\n cin >> E[i][j];\n }\n }\n \n for (int i = 0; i < C; i++) {\n for (int j = 0; j < D; j++) {\n cin >> F[i][j];\n }\n }\n \n memset(memo, -1, sizeof(memo));\n \n int res = solve(0, 0, 0);\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 560,
"memory_kb": 3116,
"score_of_the_acc": -0.956,
"final_rank": 18
},
{
"submission_id": "aoj_1086_1876250",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \nint C, D, W, X;\nint E[16][31], F[16][31];\nint memo[31][51][6];\nconst int dx[] = {-1, 1};\n \nint solve(int d, int w, int x)\n{\n if (d == D) return 0;\n \n int &res = memo[d][w][x];\n if (res != -1) return res;\n \n res = solve(d+1, w, x);\n \n for (int i = 0; i < C; i++) {\n if (w + F[i][d] <= W && E[i][d] != 0) {\n res = max(res, solve(d+1, w + F[i][d], x) + E[i][d]); \n } \n }\n \n if (x+1 <= X) {\n for (int i = 0; i < C; i++) {\n for (int j = 0; j < 2; j++) {\n int nx = i, cost = 0, f = 0;\n while (1) {\n if (nx < 0 || nx >= C || E[nx][d] == 0) break;\n f += F[nx][d];\n cost += E[nx][d];\n if (w + f <= W) {\n res = max(res, solve(d+1, w + f, x+1) + cost);\n }\n nx += dx[j];\n }\n } \n }\n }\n return res;\n}\n \nint main()\n{\n while (cin >> C >> D >> W >> X, C) {\n for (int i = 0; i < C; i++) {\n for (int j = 0; j < D; j++) {\n cin >> E[i][j];\n }\n }\n \n for (int i = 0; i < C; i++) {\n for (int j = 0; j < D; j++) {\n cin >> F[i][j];\n }\n }\n \n memset(memo, -1, sizeof(memo));\n \n int res = solve(0, 0, 0);\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 520,
"memory_kb": 3028,
"score_of_the_acc": -0.903,
"final_rank": 15
},
{
"submission_id": "aoj_1086_1874727",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \ntypedef long long ll;\n \nll C, D, W, X;\nll E[16][31], F[16][31];\nll memo[31][51][6];\nconst int dx[] = {-1, 1};\n \nll solve(ll d, ll w, ll x)\n{\n if (d == D) return 0;\n \n ll &res = memo[d][w][x];\n if (res != -1) return res;\n \n res = 0;\n res = max(res, solve(d+1, w, x));\n \n for (int i = 0; i < C; i++) {\n if (w + F[i][d] <= W && E[i][d] != 0) {\n res = max(res, solve(d+1, w + F[i][d], x) + E[i][d]); \n } \n }\n \n if (x+1 <= X) {\n for (int i = 0; i < C; i++) {\n for (int j = 0; j < 2; j++) {\n ll nx = i, cost = 0, f = 0;\n while (1) {\n if (nx < 0 || nx >= C || E[nx][d] == 0) break;\n f += F[nx][d];\n cost += E[nx][d];\n if (w + f <= W) {\n res = max(res, solve(d+1, w + f, x+1) + cost);\n }\n nx += dx[j];\n }\n } \n }\n }\n return res;\n}\n \nint main()\n{\n while (cin >> C >> D >> W >> X, C) {\n for (int i = 0; i < C; i++) {\n for (int j = 0; j < D; j++) {\n cin >> E[i][j];\n }\n }\n \n for (int i = 0; i < C; i++) {\n for (int j = 0; j < D; j++) {\n cin >> F[i][j];\n }\n }\n \n memset(memo, -1, sizeof(memo));\n \n ll res = solve(0, 0, 0);\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 510,
"memory_kb": 3100,
"score_of_the_acc": -0.9267,
"final_rank": 16
},
{
"submission_id": "aoj_1086_1874677",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n \nint main() {\n ll n,m,w,x;\n while(cin >> m >> n >> w >> x && n) {\n ll e[n][m],f[n][m];\n for(int i=0; i<m; i++) {\n for(int j=0; j<n; j++) cin >> e[j][i];\n }\n for(int i=0; i<m; i++) {\n for(int j=0; j<n; j++) cin >> f[j][i];\n }\n ll dp[n+1][w+1][x+1],ans=0;\n for(int i=0;i<=n;i++)for(int j=0;j<=w;j++)for(int k=0;k<=x;k++)dp[i][j][k]=-1;\n dp[0][0][0]=0;\n for(int t=0; t<n; t++) {\n for(int l=0; l<=w; l++) {\n for(int k=0; k<=x; k++) {\n if(dp[t][l][k]==-1) continue;\n dp[t+1][l][k]=max(dp[t+1][l][k],dp[t][l][k]);\n for(int i=0; i<m; i++) {\n ll z=0,y=0,xx=0;\n for(int j=i; j<m; j++) {\n if(!e[t][j]) break;\n if(j!=i) y=1;\n xx+=e[t][j];\n z+=f[t][j];\n if(z+l<=w&&k+y<=x) dp[t+1][z+l][k+y]=max(dp[t+1][z+l][k+y],dp[t][l][k]+xx);\n }\n }\n }\n }\n }\n for(int l=0;l<=w;l++)for(int k=0;k<=x;k++)ans=max(ans,dp[n][l][k]);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 1232,
"score_of_the_acc": -0.0599,
"final_rank": 1
},
{
"submission_id": "aoj_1086_1874228",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nll C, D, W, X;\nll E[16][31], F[16][31];\nll memo[31][51][6];\nconst int dx[] = {-1, 1};\n\nll solve(ll d, ll w, ll x)\n{\n if (d == D) return 0;\n\n ll &res = memo[d][w][x];\n if (res != -1) return res;\n \n res = 0;\n res = max(res, solve(d+1, w, x));\n\n for (int i = 0; i < C; i++) {\n if (w + F[i][d] <= W && E[i][d] != 0) {\n res = max(res, solve(d+1, w + F[i][d], x) + E[i][d]); \n } \n }\n\n if (x+1 <= X) {\n for (int i = 0; i < C; i++) {\n for (int j = 0; j < 2; j++) {\n\tll nx = i, cost = 0, f = 0;\n\twhile (1) {\n\t if (nx < 0 || nx >= C || E[nx][d] == 0) break;\n\t f += F[nx][d];\n\t cost += E[nx][d];\n\t if (w + f <= W) {\n\t res = max(res, solve(d+1, w + f, x+1) + cost);\n\t }\n\t nx += dx[j];\n\t}\n } \n }\n }\n return res;\n}\n\nint main()\n{\n while (cin >> C >> D >> W >> X, C) {\n for (int i = 0; i < C; i++) {\n for (int j = 0; j < D; j++) {\n\tcin >> E[i][j];\n }\n }\n\n for (int i = 0; i < C; i++) {\n for (int j = 0; j < D; j++) {\n\tcin >> F[i][j];\n }\n }\n\n memset(memo, -1, sizeof(memo));\n \n ll res = solve(0, 0, 0);\n cout << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 690,
"memory_kb": 1244,
"score_of_the_acc": -0.2812,
"final_rank": 5
},
{
"submission_id": "aoj_1086_1874220",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll n,m,w,x;\n while(cin >> m >> n >> w >> x && n) {\n ll e[n][m],f[n][m];\n for(int i=0; i<m; i++) {\n for(int j=0; j<n; j++) cin >> e[j][i];\n }\n for(int i=0; i<m; i++) {\n for(int j=0; j<n; j++) cin >> f[j][i];\n }\n ll dp[n+1][w+1][x+1],ans=0;\n for(int i=0;i<=n;i++)for(int j=0;j<=w;j++)for(int k=0;k<=x;k++)dp[i][j][k]=-1;\n dp[0][0][0]=0;\n for(int t=0; t<n; t++) {\n for(int l=0; l<=w; l++) {\n for(int k=0; k<=x; k++) {\n if(dp[t][l][k]==-1) continue;\n dp[t+1][l][k]=max(dp[t+1][l][k],dp[t][l][k]);\n for(int i=0; i<m; i++) {\n ll z=0,y=0,xx=0;\n for(int j=i; j<m; j++) {\n if(!e[t][j]) break;\n if(j!=i) y=1;\n xx+=e[t][j];\n z+=f[t][j];\n if(z+l<=w&&k+y<=x) dp[t+1][z+l][k+y]=max(dp[t+1][z+l][k+y],dp[t][l][k]+xx);\n }\n }\n }\n }\n }\n for(int l=0;l<=w;l++)for(int k=0;k<=x;k++)ans=max(ans,dp[n][l][k]);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 1236,
"score_of_the_acc": -0.0615,
"final_rank": 2
}
] |
aoj_1085_cpp
|
Problem B: Spellcasters
n 人の魔法使いがいる。彼らには 1 から n までの番号があり、i 番目の魔法使いは魔力 r
i
( 1 ≤ i ≤ n ) を持っている。いま彼らは強力な魔法使いと対峙しており、その敵の魔力は S である。n 人の魔法使いは協力して戦うのが得意で、特に 2 人で協力して戦うことを好む。2 人の魔法使いが協力した場合、魔力は単純にその和となり、強力な魔法などを駆使してある程度強い敵にも勝てるようになる。あなたの仕事は魔力 S を持つ敵に対して勝つことができる魔法使いのペア (i, j) ( i ≠ j かつ 1 ≤ i ≤ n かつ 1 ≤ j ≤ n ) の総数を出力することである。ただし (i, j) と (j, i) は同じ組として数える。一方の魔力が他方の魔力よりも大きいとき、大きい魔力を持っている側が勝つ。等しい場合は相打ちで勝ったことにならない。
Input
入力は複数のテストケースからなる。 各テストケースは以下の形式に従う。
n S
r
1
r
2
…
r
n
各変数の意味は問題文中の通りである。
入力の終わりは、ふたつの0が一文字の空白で区切られる一行で示される。
Constraints
入力はすべて整数
1 ≤ n ≤ 20,000
1 ≤ r
i
≤ 100 ( 1 ≤ i ≤ n )
1 ≤ S ≤ 100
テストケースの数は 100 を超えない。
Output
条件を満たす組 (i, j) (i ≠ j) の総数を各ケースに付き 1 行に出力せよ。
Sample Input
3 7
1
3
10
0 0
Sample Output
2
|
[
{
"submission_id": "aoj_1085_9796673",
"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\nvoid func(int N,int S){\n\n\tint table[N],index = N-1,tmp;\n\n\tpriority_queue<int> Q;\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d\",&tmp);\n\t\tQ.push(tmp);\n\t}\n\n\twhile(!Q.empty()){\n\t\ttable[index--] = Q.top();\n\t\tQ.pop();\n\t}\n\n\tint sum = 0,left,right,m,tmp_min;\n\n\tfor(int i = 0; i < N-1; i++){\n\t\tleft = i+1,right = N-1,m = (left+right)/2;\n\n\t\ttmp_min = N;\n\n\t\twhile(left <= right){\n\t\t\tif(table[i] + table[m] > S){\n\t\t\t\ttmp_min = m;\n\t\t\t\tright = m-1;\n\t\t\t}else{\n\t\t\t\tleft = m+1;\n\t\t\t}\n\t\t\tm = (left+right)/2;\n\t\t}\n\t\tif(tmp_min != N){\n\t\t\tsum += N - tmp_min;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",sum);\n}\n\nint main(){\n\n\tint N,S;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&N,&S);\n\t\tif(N == 0 && S == 0)break;\n\n\t\tfunc(N,S);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 2908,
"score_of_the_acc": -0.2719,
"final_rank": 4
},
{
"submission_id": "aoj_1085_9083588",
"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, k;\n while (cin >> n >> k, 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 ll res = 0;\n for (int i = 0; i < n; ++i) {\n res += upper_bound(c.begin(), c.end(), 2e9) - lower_bound(c.begin(), c.end(), k - c[i] + 1);\n }\n for (int i = 0; i < n; ++i) {\n if (c[i] + c[i] > k) res -= 1;\n }\n cout << res / 2 << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3356,
"score_of_the_acc": -0.8525,
"final_rank": 13
},
{
"submission_id": "aoj_1085_6001305",
"code_snippet": "// AIOJ1.0.cpp : 此文件包含 \"main\" 函数。程序执行将在此处开始并结束。\n//\n\n#include <iostream>\n#include<string.h>\n#include<algorithm>\n#include<cstring>\ntypedef long long ll;\nusing namespace std;\nint main() {\n\twhile (true) {\n\t\tint n, k;\n\t\tcin >> n >> k;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tint c[20110];\n\t\tint nk = n;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> c[i];\n\t\t}\n\t\tsort(c, c + n);\n\t\tll sum = 0;\n\t\tfor (int i = 0; i < n; i++){\n\t\t\tif (c[i] > k) {\n\t\t\t\tnk = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfor (int j = i+1; j < n; j++) {\n\t\t\t\tif (c[i] + c[j] > k) {\n\t\t\t\t\tsum += (n- j);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (nk != n) {\n\t\t\tsum += (n - nk) * (n - nk - 1) / 2;\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\treturn 0;\n}\n// 运行程序: Ctrl + F5 或调试 >“开始执行(不调试)”菜单\n// 调试程序: F5 或调试 >“开始调试”菜单\n\n// 入门使用技巧: \n// 1. 使用解决方案资源管理器窗口添加/管理文件\n// 2. 使用团队资源管理器窗口连接到源代码管理\n// 3. 使用输出窗口查看生成输出和其他消息\n// 4. 使用错误列表窗口查看错误\n// 5. 转到“项目”>“添加新项”以创建新的代码文件，或转到“项目”>“添加现有项”以将现有代码文件添加到项目\n// 6. 将来，若要再次打开此项目，请转到“文件”>“打开”>“项目”并选择 .sln 文件",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 3132,
"score_of_the_acc": -0.682,
"final_rank": 11
},
{
"submission_id": "aoj_1085_5825789",
"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\n// map<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_yaku(int n){\n int ct = 0;\n rep(i,1,n+1)if(n%i==0){\n ct++;\n // cout<<i<<\" \";\n }\n // cout<<endl<<ct<<endl;\n return ct;\n}\n\nsigned main(){\n int n, S;\n while(cin>>n>>S){\n if(n+S==0)break;\n vector<int> v(n);\n map<int,int> freq;\n rep(i,0,n){\n cin>>v[i];\n freq[v[i]]++;\n }\n sort(all(v));\n int ans = 0;\n rep(i,0,n){\n int t = S - v[i]+1;\n if(v[i]>S){\n ans += n-1;\n continue;\n }\n ans += (v.end() - lower_bound(v.begin(), v.end(), t));\n if(v[i]*2 > S)ans--;\n }\n cout<<ans/2<<endl;\n }\n \n}\n/*\n*/",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3312,
"score_of_the_acc": -0.8123,
"final_rank": 12
},
{
"submission_id": "aoj_1085_5825620",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nconst int inf = 1e9 + 7;\n\nint main(void) {\n int n, S;\n\n while(true){\n cin >> n >> S;\n if(n + S == 0) return 0;\n\n int r[n];\n for(int i = 0; i < n; i++) cin >> r[i];\n\n int ans = 0;\n for(int i = 0; i < n; i++)\n for(int j = i + 1; j < n; j++) if(S < r[i] + r[j]) ans++;\n\n cout << ans << \"\\n\";\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1690,
"memory_kb": 3040,
"score_of_the_acc": -1.4226,
"final_rank": 20
},
{
"submission_id": "aoj_1085_5825592",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\n//イテレーション\n#define REP(i, n) for (ll i = 0; i < ll(n); i++)\n#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)\n#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)\n#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)\n#define FORA(i, I) for (const auto& i : I)\n// x:コンテナ\n#define ALL(x) x.begin(), x.end()\n#define SIZE(x) ll(x.size())\n//定数\n#define INF32 2147483647 // 2.147483647×10^{9}:32bit整数のinf\n#define INF64 9223372036854775807 // 9.223372036854775807×10^{18}:64bit整数のinf\n#define MOD 1000000007 //問題による\n//略記\n#define F first\n#define S second\n//出力(空白区切りで昇順に)\n#define coutALL(x) \\\n for (auto i = x.begin(); i != --x.end(); i++) cout << *i << \" \"; \\\n cout << *--x.end() << endl;\n\n// aをbで割る時の繰上げ,繰り下げ\nll myceil(ll a, ll b) { return (a + (b - 1)) / b; }\nll myfloor(ll a, ll b) { return a / b; }\n\nint main() {\n //小数の桁数の出力指定\n // cout<<fixed<<setprecision(10);\n //入力の高速化用のコード\n // ios::sync_with_stdio(false);\n // cin.tie(nullptr);\n ll n, S;\n cin >> n >> S;\n while(n+S != 0) {\n vector<ll> rs(n, 0);\n REP(i, n) {\n cin >> rs[i];\n }\n sort(rs.begin(), rs.end());\n ll ans = 0;\n REP(i, n) {\n ll ng = i;\n ll ok = n;\n ll r = rs[i];\n while(ng + 1 != ok) {\n ll mid = (ng + ok) / 2;\n if(r + rs[mid] > S) {\n ok = mid;\n }else {\n ng = mid;\n }\n }\n ans += n - ok;\n }\n cout << ans << endl;\n cin >> n >> S;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3208,
"score_of_the_acc": -0.6688,
"final_rank": 10
},
{
"submission_id": "aoj_1085_5825544",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nint main(){\n while(true){\n Int N,s;\n cin >> N >> s;\n if(N == s and N == 0) break;\n vector<Int>S;\n for(int i = 0; i < N; ++i){\n Int r; cin >> r;\n S.push_back(r);\n }\n Int ans = 0;\n sort(S.begin(),S.end());\n for(auto i = S.begin(); i != S.end(); ++i){\n auto itr = upper_bound(i + 1, S.end(), s - *i);\n ans += distance(itr,S.end());\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3472,
"score_of_the_acc": -1.018,
"final_rank": 15
},
{
"submission_id": "aoj_1085_5825515",
"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 add(int a, T x){\n for(int i=a; i<(int)node.size(); i += i & -i) node[i] += x;\n }\n\n /* [1, a] */\n T sum(int a){\n T res = 0;\n for(int x=a; x>0; x -= x & -x) res += node[x];\n return res;\n }\n\n /* [l, r] */\n T rangesum(int l, int r){\n return sum(r) - sum(l-1);\n }\n\n /* \n a1+a2+...+aw >= valとなるような最小のwを返す\n @verify https://codeforces.com/contest/992/problem/E\n */\n int lower_bound(T val) {\n if(val < 0) return 0;\n\n int res = 0;\n int n = 1; \n while (n < N) n *= 2;\n\n T tv=0;\n for (int k = n; k > 0; k /= 2) {\n if(res + k < N && node[res + k] < val){\n val -= node[res+k];\n res += k;\n }\n }\n return res+1; \n }\n};\nstruct UnionFind{\n std::vector<int> par;\n std::vector<int> siz;\n\n UnionFind(int sz_): par(sz_), siz(sz_) {\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n void init(int sz_){\n par.resize(sz_);\n siz.resize(sz_);\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n int root(int x){\n if(x == par[x]) return x;\n return par[x] = root(par[x]);\n }\n\n bool merge(int x, int y){\n x = root(x), y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) std::swap(x, y);\n siz[x] += siz[y];\n par[y] = x;\n return true;\n }\n\n bool issame(int x, int y){\n return root(x) == root(y);\n }\n\n int size(int x){\n return siz[root(x)];\n }\n};\nstruct RollingHash {\n 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};\n\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n\n int n, S;\n while(cin >> n >> S, n) {\n vector<ll> r(n);\n REP(i,n) cin >> r[i];\n BIT<int> bit(110);\n sort(all(r));\n ll ans = 0;\n for(int i=0; i<n; i++) {\n ll t = S - r[i];\n \n ans += bit.rangesum(max(0LL, t+1), 105);\n bit.add(r[i], 1);\n }\n cout << ans << '\\n';\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3460,
"score_of_the_acc": -0.9841,
"final_rank": 14
},
{
"submission_id": "aoj_1085_5680910",
"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\nint a[20000];\n\nvoid func(int N, int S) {\n\n\n\tint tmp = 0;\n\tint index = N - 1;\n\tstd::priority_queue<int> Q;\n\tfor (int i = 0; i < N; i++) {\n\t\tscanf(\"%d\", &tmp);\n\t\tQ.push(tmp);\n\t}\n\n\twhile (!Q.empty()) {\n\t\ta[index--] = Q.top();\n\t\tQ.pop();\n\t}\n\n\n\tint sum = 0, left, right, m, tmp_min;\n\n\tfor (int i = 0; i < N - 1; i++) {\n\t\tleft = i + 1, right = N - 1, m = (left + right) / 2;\n\n\t\ttmp_min = N;\n\n\t\twhile (left <= right) {\n\t\t\tif (a[i] + a[m] > S) {\n\t\t\t\ttmp_min = m;\n\t\t\t\tright = m - 1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tleft = m + 1;\n\t\t\t}\n\t\t\tm = (left + right) / 2;\n\t\t}\n\t\tif (tmp_min != N) {\n\t\t\tsum += N - tmp_min;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\", sum);\n}\n\n\nint main()\n{\n\tint n, s;\n\n\twhile (1)\n\t{\n\t\tscanf(\"%d %d\", &n, &s);\n\t\tif (n == 0 && s == 0)break;\n\t\tfunc(n, s);\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 2864,
"score_of_the_acc": -0.2137,
"final_rank": 2
},
{
"submission_id": "aoj_1085_5680897",
"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//int table[2000];\n\nvoid func(int N, int S) {\n\n\tint index = N - 1, tmp;\n\tint table[N];\n\tstd::priority_queue<int> Q;\n\n\tfor (int i = 0; i < N; i++) {\n\t\tscanf(\"%d\", &tmp);\n\t\tQ.push(tmp);\n\t}\n\n\twhile (!Q.empty()) {\n\t\ttable[index--] = Q.top();\n\t\tQ.pop();\n\t}\n\n\tint sum = 0, left, right, m, tmp_min;\n\n\tfor (int i = 0; i < N - 1; i++) {\n\t\tleft = i + 1, right = N - 1, m = (left + right) / 2;\n\n\t\ttmp_min = N;\n\n\t\twhile (left <= right) {\n\t\t\tif (table[i] + table[m] > S) {\n\t\t\t\ttmp_min = m;\n\t\t\t\tright = m - 1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tleft = m + 1;\n\t\t\t}\n\t\t\tm = (left + right) / 2;\n\t\t}\n\t\tif (tmp_min != N) {\n\t\t\tsum += N - tmp_min;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\", sum);\n}\n\nint main() {\n\n\tint N, S;\n\n\twhile (true) {\n\t\tscanf(\"%d %d\", &N, &S);\n\t\tif (N == 0 && S == 0)break;\n\n\t\tfunc(N, S);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 2892,
"score_of_the_acc": -0.2508,
"final_rank": 3
},
{
"submission_id": "aoj_1085_5011408",
"code_snippet": "#include <iostream>\n#include <vector>\n#include<iomanip>\n#include<algorithm>\nusing namespace std;\n#define rep(i,n) for(int i = 0;i<n;i++)\n#define ALL(a) a.begin(),a.end()\ntypedef long long ll;\ntypedef long double ld;\nint main(){\n int n, s;\n while (cin >> n >> s, n, s) {\n vector<int> r(n);\n rep(i, n) cin >> r[i];\n sort(ALL(r));\n int sum = 0;\n rep(i, n) {\n sum += r.end() - upper_bound(ALL(r), s - r[i]);\n if (r[i] + r[i] > s)sum--;\n }cout << sum/2 << endl;\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3040,
"score_of_the_acc": -0.4585,
"final_rank": 6
},
{
"submission_id": "aoj_1085_3380689",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint calc( int a )\n{\n if( a == 0 )\n return 0;\n return a - 1 + calc( a - 1 );\n}\n\nint main()\n{\n int n, s, r, a[101];\n\n while( cin >> n >> s )\n {\n if( n + s == 0 )\n break;\n\n for( int i = 0; i < 101; i++ )\n a[i] = 0;\n\n for( int i = 0; i < n; i++ )\n {\n cin >> r;\n a[r]++;\n }\n\n int cnt = 0;\n for( int i = 1; i < 100; i++ )\n for( int j = i + 1; j < 101; j++ )\n if( i + j > s )\n cnt += a[i] * a[j];\n\n for( int i = 1; i < 101; i++ )\n if( i + i > s )\n cnt += calc(a[i]);\n\n cout << cnt << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3084,
"score_of_the_acc": -0.5047,
"final_rank": 7
},
{
"submission_id": "aoj_1085_3325478",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\n\nint main(){\n int n, s;\n while(cin >> n >> s, n+s){\n vector<int> r(n);\n for(int i = 0; i < n; i++) cin >> r[i];\n sort(r.begin(), r.end());\n int ans = 0;\n for(int i = 0; i < n; i++){\n ans += (int)(r.end()-upper_bound(r.begin(), r.end(), s-r[i]));\n if(r[i]+r[i] > s) ans--;\n }\n cout << ans/2 << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3132,
"score_of_the_acc": -0.5802,
"final_rank": 8
},
{
"submission_id": "aoj_1085_3082980",
"code_snippet": "#define _USE_MATH_DEFINES\n\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <map>\n#include <list>\n\nusing namespace std;\n\ntypedef pair<long long int, long long int> P;\n\nlong long int INF = 1e18;\nlong long int MOD = 1e8 + 7;\n\nint main(){\n\t\n\twhile(true){\n\t\tint n, S;\n\t\tcin >> n >> S;\n\t\tif(n == 0){\n\t\t\tbreak;\n\t\t}\n\t\tlong long int ans = 0;\n\t\tlong long int cnt[110] = {};\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tint num;\n\t\t\tcin >> num;\n\t\t\tcnt[num] += 1;\n\t\t}\n\t\tfor(int i = 1; i <= 100; i++){\n\t\t\tfor(int j = i + 1; j <= 100; j++){\n\t\t\t\tif(i + j > S){\n\t\t\t\t\tans += cnt[i] * cnt[j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(i * 2 > S){\n\t\t\t\tans += cnt[i] * (cnt[i] - 1) / 2;\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": 2956,
"score_of_the_acc": -0.3354,
"final_rank": 5
},
{
"submission_id": "aoj_1085_2460213",
"code_snippet": "#include<iostream>\nusing namespace std;\nint main() {\n\tint n, s; \n\twhile (cin >> n >> s) {\n\t\tif (!n && !s)return 0;\n\t\tint a[20001]; for (int i = 0; i < n; i++)cin >> a[i];\n\t\tlong long sum = 0;\n\t\tfor (int i = 0; i < n - 1; i++) {\n\t\t\tfor (int j = i + 1; j < n; j++) {\n\t\t\t\tif (a[i] + a[j] > s)sum++;\n\t\t\t}\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\tchar c; cin >> c;\n}",
"accuracy": 1,
"time_ms": 1700,
"memory_kb": 2992,
"score_of_the_acc": -1.3651,
"final_rank": 18
},
{
"submission_id": "aoj_1085_2330485",
"code_snippet": "//#define LOCAL\n\n#include <fstream>\n#include <iostream>\n#include <cmath>\n#include <algorithm>\n#include <string>\n\n#define rep(i,n) for(int i=0; i<n; i++)\n\nusing namespace std;\n\n\n\nint main()\n{\n#ifdef LOCAL\n ifstream in(\"input.txt\");\n cin.rdbuf(in.rdbuf());\n#endif\n\n int n, S;\n int r[20010];\n\n while (true) {\n cin >> n >> S;\n if (n == 0 && S == 0) break;\n\n rep(i,n) cin >> r[i];\n\n sort(r, r + n);\n\n int ans = 0;\n rep(i,n) {\n int needle = S + 1 - r[i];\n int* pos = lower_bound(r + i + 1, r + n, needle);\n ans += (int)((r + n) - pos);\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3168,
"score_of_the_acc": -0.6278,
"final_rank": 9
},
{
"submission_id": "aoj_1085_2164713",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main() {\n\tint n, s;\n\twhile (cin >> n >> s, n, s) {\n\t\tint a[22000];\n\t\tfor (int i = 0;i < n;i++)cin >> a[i];\n\t\tint ans = 0;\n\t\tfor (int i = 0;i < n;i++)\n\t\tfor (int j = i + 1;j < n;j++)\n\t\tif (s < a[i] + a[j])ans++;\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 1690,
"memory_kb": 3004,
"score_of_the_acc": -1.375,
"final_rank": 19
},
{
"submission_id": "aoj_1085_2164483",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<list>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<cmath>\n#include<set>\nusing namespace std;\nint main() {\n\tint n, s;\n\twhile (cin >> n >> s&&n != 0 && s != 0) {\n\t\tint r[20000];\n\t\tfor (int i = 0; i < n; i++) cin >> r[i];\n\t\tsort(r, r + n);\n\t\treverse(r, r + n);\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (r[i]*2<=s) break;\n\t\t\tfor (int j = i+1; j < n; j++) {\n\t\t\t\tif (r[i] + r[j] > s) {\n\t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\t\telse break;\n\t\t\t}\n\t\t}\n\t\tcout << sum << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 1240,
"memory_kb": 3172,
"score_of_the_acc": -1.3277,
"final_rank": 17
},
{
"submission_id": "aoj_1085_2158708",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<list>\n#include<cstdio>\n#include<algorithm>\n#include<functional>\nusing namespace std;\nint r[20000];\nint main() {\n\tint n, s;\n\twhile (cin >> n >> s&&n != 0 && s != 0) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> r[i];\n\t\t}\n\t\tsort(r,r+n);\n\t\treverse(r, r + n);\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = i + 1; j < n; j++) {\n\t\t\t\tif (r[i] + r[j] > s) sum++;\n\t\t\t\telse break;\n\t\t\t}\n\t\t\tif (r[i] + r[i] <= s) break;\n\t\t}\n\t\tcout << sum << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 1140,
"memory_kb": 3124,
"score_of_the_acc": -1.2044,
"final_rank": 16
},
{
"submission_id": "aoj_1085_2145429",
"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\nvoid func(int N,int S){\n\n\tint table[N],index = N-1,tmp;\n\n\tpriority_queue<int> Q;\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d\",&tmp);\n\t\tQ.push(tmp);\n\t}\n\n\twhile(!Q.empty()){\n\t\ttable[index--] = Q.top();\n\t\tQ.pop();\n\t}\n\n\tint sum = 0,left,right,m,tmp_min;\n\n\tfor(int i = 0; i < N-1; i++){\n\t\tleft = i+1,right = N-1,m = (left+right)/2;\n\n\t\ttmp_min = N;\n\n\t\twhile(left <= right){\n\t\t\tif(table[i] + table[m] > S){\n\t\t\t\ttmp_min = m;\n\t\t\t\tright = m-1;\n\t\t\t}else{\n\t\t\t\tleft = m+1;\n\t\t\t}\n\t\t\tm = (left+right)/2;\n\t\t}\n\t\tif(tmp_min != N){\n\t\t\tsum += N - tmp_min;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",sum);\n}\n\nint main(){\n\n\tint N,S;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&N,&S);\n\t\tif(N == 0 && S == 0)break;\n\n\t\tfunc(N,S);\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 2716,
"score_of_the_acc": -0.018,
"final_rank": 1
}
] |
aoj_1080_cpp
|
Problem G : Everything Starts With Your Vote
ヒューリスティクスという言葉がある。確実にうまくいくという保証はないけれども大抵の場合はうまくいく、比較的単純なアプローチのことだ。単純にして強力であるがゆえに、この世の中は多くのヒューリスティクスで満ち溢れている。
ヒューリスティクスの一例として、こんなものが挙げられる。アニメ番組において、あるキャラクターの人気度は、そのアニメ本編中における登場時間の総和に比例する。確かにこれは多くの場合に成り立っているようだ。しかし、どうやら僕は少数派に属するらしい。影の薄いキャラ、背景にちらりと映るモブキャラなんかに限って可愛く見えたりするのだ。
自分の好きなキャラのことを、他人がどう思っていようがいいじゃないか。とは言ってられない事情が、残念ながらある。関連商品、フィギュアやキャラクターソングCDなどは、人気のあるキャラのものから優先的に発売される傾向にあるのだ。商業的には当然の選択だとはいえ、不人気キャラのファンの肩身は狭い。
そこで重要となってくるのが、アニメ番組の制作会社によって行われる人気投票である。実際の人気がどうであれ、ここで多くの票を獲得すれば、関連商品への道が開かれるのだ。どんな手段を使っても票を集めねばなるまい。
厳正なる投票のために、ある関連商品を1つ購入するたびに1票の投票権が与えられる。この仕組を厳正と呼ぶべきかどうかは今大きく議論されているが、とにかく僕は
L
票の投票権を得た。投票の対象となるキャラは全部で
N
人いて、より多くの票を獲得した
K
人のキャラ (同票の場合は名前の辞書順) の関連商品が企画されることになる。僕の好きなキャラは全部で
M
人いて、その中からできるだけ多くのキャラを上位
K
人に入れたいと思っている。
僕はまず、それぞれのキャラがどれだけの票を獲得するかを予測した(難しいことではない。あるキャラクターの人気度は、その登場時間の総和に比例すると仮定しただけだ)。この予測が正しいとして、より多くの僕の好きなキャラの関連商品が発売されるようにするためには、僕はこの
L
票を誰にどれだけ投じればいいだろうか。
Input
入力は複数のケースからなる。
各ケースは以下のフォーマットで与えられる。
N
M
K
L
name
0
x
0
.
.
.
name
N-1
x
N-1
fav
0
.
.
.
fav
M-1
N
、
M
、
K
、
L
の意味は問題文に記されているとおりである。
name
i
はキャラクターの名前、
x
i
は
i
番目のキャラクターの票の総数を表す。
fav
i
はあなたがひいきしているキャラクターの名前を表す。これらの名前は必ず異なり、また必ずキャラクターの名前の入力の中に含まれる。
入力の終わりは
N
= 0 かつ
M
= 0 かつ
K
= 0 かつ
L
= 0からなる行によって与えられる
また各値は以下の条件を満たす
1 ≤
N
≤ 100,000
1 ≤
M
≤
N
1 ≤
K
≤
N
1 ≤
L
≤ 100,000,000
0 ≤
x
i
≤ 100,000,000
name
i
はアルファベットのみを含み、長さは10文字以下である。
テストケースの数は150を超えない。
また20,000 ≤
N
となるケースの数は20を超えないことが保証されている。
ジャッジデータは大きいので、速い入力を使うことを推奨する。
Output
M
人のキャラの中から最大で何人を上位
K
人に入れることが出来るかを1行で出力せよ。
Sample input
4 1 3 4
yskwcnt 16
akzakr 7
tsnukk 12
fnmyi 13
akzakr
4 1 3 5
akzakr 7
tsnukk 12
fnmyi 13
yskwcnt 16
akzakr
4 2 2 1
akzakr 4
tsnukk 6
yskwcnt 6
fnmyi 12
akzakr
fnmyi
5 2 3 28
knmmdk 6
skrkyk 14
tmemm 14
akmhmr 15
mksyk 25
knmmdk
skrkyk
5 2 3 11
tmemm 12
skrkyk 18
knmmdk 21
mksyk 23
akmhmr 42
skrkyk
tmemm
14 5 10 38
iormns 19
hbkgnh 23
yyitktk 31
rtkakzk 36
mmftm 43
ykhhgwr 65
hrkamm 66
ktrotns 67
mktkkc 68
mkhsi 69
azsmur 73
tknsj 73
amftm 81
chyksrg 88
mkhsi
hbkgnh
mktkkc
yyitktk
tknsj
14 5 10 38
mktkkc 24
rtkakzk 25
ykhhgwr 25
hrkamm 27
amftm 37
iormns 38
tknsj 38
yyitktk 39
hbkgnh 53
mmftm 53
chyksrg 63
ktrotns 63
azsmur 65
mkhsi 76
mkhsi
hbkgnh
mktkkc
yyitktk
tknsj
0 0 0 0
Sample output
0
1
1
2
1
4
5
The University of Aizu Programming Contest 2011 Summer
原案: Tomoya Sakai
問題文: Takashi Tayama
|
[
{
"submission_id": "aoj_1080_6372130",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ull;\ntypedef pair<int, int> pil;\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\nconst ll ll_MAX = 0x7fffffffffffffff;\nconst int int_INF = 0x3f3f3f3f;\nconst int int_MAX = 0x7fffffff;\nconst double EPS = 1e-7;\nconst double PI = acos(-1.0);\nconst int dy[8] = {-1, 0, 1, 0, 1, -1, 1, -1};\nconst int dx[8] = {0, -1, 0, 1, 1, -1, -1, 1};\n#define R register\n#define _max(a, b) ((a) > (b) ? (a) : (b))\n#define _min(a, b) ((a) < (b) ? (a) : (b))\n#define _abs(a) ((a) > 0 ? (a) : -(a))\n#define _swap(a, b) ((a) ^= (b) ^= (a) ^= (b))\n#define _eql(x, y) (_abs((x) - (y)) < EPS)\nconst int MOD = 1e9 + 7;\nconst int MX = 1000010;\nll _r() {\n ll x = 0, f = 1;\n char c = getchar();\n while(c > '9' || c < '0') {\n if(c == '-')\n f = -1;\n c = getchar();\n }\n while(c >= '0' && c <= '9')\n x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\n return f == -1 ? -x : x;\n}\nmap<string, int> mp;\nstruct Node {\n string name;\n int tick;\n int want;\n} person[100010];\nstruct Idol {\n int ID;\n int tick;\n} my[100010], enemy[100010];\nint cnt1 = 0, cnt2 = 0;\nint n, m, k, l;\nbool cmp(Node a, Node b) {\n if(a.tick == b.tick)\n return a.name < b.name;\n return a.tick > b.tick;\n}\nbool Init() {\n mp.clear();\n cnt1 = cnt2 = 0;\n\n cin >> n >> m >> k >> l;\n if(n == 0 && m == 0 && k == 0 && l == 0)\n return 0;\n for(int i = 0; i < n; i++) {\n cin >> person[i].name >> person[i].tick;\n mp[person[i].name] = i;\n person[i].want = 0;\n }\n\n string name;\n for(int i = 0; i < m; i++) {\n cin >> name;\n person[mp[name]].want = 1;\n }\n return 1;\n}\nbool check(int x) { //进入人数\n ll need = 0;\n for(int i = 0; i < x; i++) {\n if(my[i].tick > enemy[k - x].tick)\n continue;\n else {\n need += enemy[k - x].tick - my[i].tick;\n if(enemy[k - x].ID < my[i].ID)\n need++;\n }\n }\n return need <= l;\n}\nvoid solve() {\n sort(person, person + n, cmp);\n\n for(int i = 0; i < n; i++) {\n if(person[i].want) {\n my[cnt1].tick = person[i].tick;\n my[cnt1].ID = mp[person[i].name];\n cnt1++;\n }\n else {\n enemy[cnt2].tick = person[i].tick;\n enemy[cnt2].ID = mp[person[i].name];\n cnt2++;\n }\n }\n\n int mn = min(m - n + k, 0);\n int mx = min(k, m);\n int l = 1, r = n;\n while(l < r) {\n int mid = (l + r) >> 1;\n if(mid > mx)\n r = mid;\n else if(mid < mn)\n l = mid + 1;\n else if(check(mid)) {\n l = mid + 1;\n }\n else {\n r = mid;\n }\n }\n printf(\"%lld\\n\", l - 1);\n}\nint main() {\n std::ios::sync_with_stdio(false);\n#ifdef LOCAL\n freopen(\"data.in\", \"r\", stdin);\n freopen(\"data.out\", \"w\", stdout);\n#endif\n int t = 1;\n // cin>> t;\n while(Init()) {\n solve();\n }\n return 0;\n}",
"accuracy": 0.25,
"time_ms": 1200,
"memory_kb": 17252,
"score_of_the_acc": -0.5213,
"final_rank": 19
},
{
"submission_id": "aoj_1080_3911918",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing db = double;\nusing ld = long double;\n#define fs first\n#define sc second\n#define pb push_back\n#define mp make_pair\n#define mt make_tuple\n#define eb emplace_back\n#define all(v) (v).begin(), (v).end()\n#define siz(v) (ll)(v).size()\n#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)\n#define repr(i, a, n) for (ll i = n - 1; (ll)a <= i; i--)\n#define lb lower_bound\n#define ub upper_bound\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> PL;\nconst ll mod = 1000000007;\nconst ll INF = 1000000099;\nconst ll LINF = (ll)(1e18 + 99);\nvector<ll> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};\ntemplate <typename T>\nT gcd(T a, T b) { return b ? gcd(b, a % b) : a; }\ntemplate <typename T>\nT mpow(T a, T n)\n{\n T res = 1;\n for (; n; n >>= 1)\n {\n if (n & 1)\n res = res * a;\n a = a * a;\n }\n return res;\n}\n\n//cin.tie(0);ios::sync_with_stdio(false);\n\nsigned main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while (1)\n {\n ll n, m, k, l;\n cin >> n >> m >> k >> l;\n if (!n && !m && !k && !l)\n return 0;\n\n vector<pair<ll, string>> v(n);\n vector<pair<ll, string>> flist(0);\n\n rep(i, 0, n) cin >> v[i].sc >> v[i].fs;\n\n sort(all(v));\n reverse(all(v));\n\n\n set<string> fav;\n rep(i, 0, m)\n {\n string in;\n cin >> in;\n fav.insert(in);\n }\n\n for (int i = n - 1; 0 <= i; i--)\n {\n if (fav.count(v[i].sc))\n {\n flist.pb(v[i]);\n if (i + 1 < n)\n v[i] = v[i + 1];\n else\n v[i].fs = -1;\n }\n }\n sort(all(flist));\n reverse(all(flist));\n\n\n ll ok = 0, ng = min(m, k) + 1; //\n while (abs(ok - ng) > 1)\n {\n ll mid = (ok + ng) / 2;\n\n ll cost = 0;\n rep(i, 0, mid)\n {\n if (v[k - mid].fs - flist[i].fs > 0)\n {\n cost += v[k - mid].fs - flist[i].fs;\n\n if (v[k - mid].sc < flist[i].sc)\n cost++;\n }\n }\n\n if (cost <= l)\n ok = mid;\n else\n ng = mid;\n }\n\n cout << ok << endl;\n }\n}",
"accuracy": 0.25,
"time_ms": 650,
"memory_kb": 21384,
"score_of_the_acc": -0.122,
"final_rank": 12
},
{
"submission_id": "aoj_1080_3911844",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct data {\n string name;\n long long x;\n};\nbool operator<(const data &l, const data &r) {\n if(l.x != r.x) return l.x > r.x;\n return l.name < r.name;\n}\n\nlong long n, m, k, l;\nvector<data> v;\nset<string> fav;\nvector<long long> lst;\n\nlong long solve();\nbool ch(long long top);\n\nint main() {\n while(1) {\n cin >> n >> m >> k >> l;\n if(n + m + k + l == 0) break;\n v.resize(n);\n lst.clear();\n fav.clear();\n for(int i = 0; i < n; ++i) cin >> v[i].name >> v[i].x;\n for(int i = 0; i < m; ++i) {\n string s;\n cin >> s;\n fav.insert(s);\n }\n cout << solve() << endl;\n }\n return 0;\n}\n\nlong long solve() {\n sort(v.begin(), v.end());\n for(int i = 0; i < n; ++i)\n if(fav.find(v[i].name) != fav.end()) lst.push_back(i);\n long long l = 0, r = min(k, m) + 1;\n while(r - l > 1) {\n long long now = (l + r) / 2;\n if(ch(now))\n l = now;\n else\n r = now;\n }\n return l;\n}\n\nbool ch(long long top) {\n long long remain = l, under = top;\n for(int i = 0; i < top; ++i) {\n long long nowid = lst[i];\n if(nowid <= k - under) {\n --under;\n continue;\n }\n remain -= v[k - under].x - v[nowid].x +\n (v[nowid].name > v[k - under].name);\n }\n return remain >= 0;\n}",
"accuracy": 1,
"time_ms": 950,
"memory_kb": 18500,
"score_of_the_acc": -0.3271,
"final_rank": 7
},
{
"submission_id": "aoj_1080_3911770",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, string> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcountll\n\n#define INF 1e16\n#define mod 1000000007\n\nll N,M,K,L;\nbool isfav[100010];\nvector<ll> A,fav;\nvector<string> S;\nmap<string,ll> id;\nvector<ll> ord;\n\nbool ok(ll X){\n if(X>K)return false;\n\n ll cnt=0;\n rep(i,K){\n if(isfav[ord[i]])cnt++;\n }\n if(X<=cnt)return true;\n\n ll add=X;\n ll rest=X-cnt;\n ll sum=0;\n for(ll i=K-1;i>=0;i--){\n if(!isfav[ord[i]]){\n rest--;\n if(rest==0){\n rep(j,N){\n if(isfav[ord[j]]){\n if(j>i){\n if(S[ord[i]]<S[ord[j]]) sum+=A[ord[i]]-A[ord[j]]+1;\n else sum+=A[ord[i]]-A[ord[j]];\n }\n add--;\n if(add==0)break;\n }\n }\n break;\n }\n }\n }\n return sum<=L;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while(1){\n A.clear(); S.clear(); fav.clear(); ord.clear();\n id.clear();\n cin>>N>>M>>K>>L;\n if(N==0)break;\n rep(i,N)isfav[i]=false;\n A.resize(N);\n S.resize(N);\n rep(i,N){\n string name;\n cin>>S[i]>>A[i];\n id[S[i]]=i;\n }\n rep(i,M){\n string name;\n cin>>name;\n fav.push_back(id[name]);\n isfav[id[name]]=true;\n }\n\n rep(i,N){\n ord.push_back(i);\n }\n sort(all(ord),[=](const ll& a,const ll& b){\n if(A[a]==A[b])return S[a]<S[b];\n else return A[a]>A[b];\n });\n\n //rep(i,N){\n //dbg(S[ord[i]]);\n //}\n\n ll lb=0,ub=M+1;\n while(ub-lb>1){\n ll mid=(ub+lb)/2;\n if(ok(mid)) lb=mid;\n else ub=mid;\n }\n cout<<lb<<endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 780,
"memory_kb": 17524,
"score_of_the_acc": -0.1583,
"final_rank": 4
},
{
"submission_id": "aoj_1080_3911735",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, string> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcountll\n\n#define INF 1e16\n#define mod 1000000007\n\nll N,M,K,L;\nbool isfav[100010];\nvector<ll> A,fav;\nvector<string> S;\nmap<string,ll> id;\nvector<ll> ord;\n\nbool ok(ll X){\n if(X>K)return false;\n\n ll cnt=0;\n rep(i,K){\n if(isfav[ord[i]])cnt++;\n }\n if(X<=cnt)return true;\n\n ll add=X-cnt;\n ll rest=X-cnt;\n ll sum=0;\n for(ll i=K-1;i>=0;i--){\n if(!isfav[ord[i]]){\n rest--;\n if(rest==0){\n repl(j,K,N){\n if(isfav[ord[j]]){\n if(S[ord[i]]<S[ord[j]]) sum+=A[ord[i]]-A[ord[j]]+1;\n else sum+=A[ord[i]]-A[ord[j]];\n add--;\n if(add==0)break;\n }\n }\n break;\n }\n }\n }\n return sum<=L;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while(1){\n A.clear(); S.clear(); fav.clear(); ord.clear();\n id.clear();\n cin>>N>>M>>K>>L;\n if(N==0)break;\n rep(i,N)isfav[i]=false;\n A.resize(N);\n S.resize(N);\n rep(i,N){\n string name;\n cin>>S[i]>>A[i];\n id[S[i]]=i;\n }\n rep(i,M){\n string name;\n cin>>name;\n fav.push_back(id[name]);\n isfav[id[name]]=true;\n }\n\n rep(i,N){\n ord.push_back(i);\n }\n sort(all(ord),[=](const ll& a,const ll& b){\n if(A[a]==A[b])return S[a]<S[b];\n else return A[a]>A[b];\n });\n\n //rep(i,N){\n //dbg(S[ord[i]]);\n //}\n\n ll lb=-1,ub=M+1;\n while(ub-lb>1){\n ll mid=(ub+lb)/2;\n if(ok(mid)) lb=mid;\n else ub=mid;\n }\n cout<<lb<<endl;\n }\n\n return 0;\n}",
"accuracy": 0.25,
"time_ms": 770,
"memory_kb": 17352,
"score_of_the_acc": -0.1461,
"final_rank": 13
},
{
"submission_id": "aoj_1080_3564614",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconst double PI = acos(-1);\nconst double EPS = 1e-15;\nusing ll = long long;\nusing ull = unsigned long long;\nconst int inf = 2e9;\nconst ll INF = 2e18;\nconst ll MOD = 1e9+7;\nconst 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\nstruct H {\n ll vote;\n string name;\n H(){vote = 0; name = \"\";}\n H(ll t, string c) {\n vote = t;\n name = c;\n }\n bool operator<(H e) const {\n if (vote == e.vote) return name > e.name;\n else return vote < e.vote;\n }\n};\n\nll n,m,k,l;\nvector<H> a;\nvector<H> other, me;\nset<string> st;\n\nbool ok(ll K) {\n if (k < K) return 0;\n if (k - K >= sz(other)) return 1;\n H line = other[k - K];\n ll cnt = 0;\n REP(i,K) {\n ll vote = me[i].vote;\n string name = me[i].name;\n if (vote > line.vote) continue;\n else if (vote == line.vote) {\n if (name < line.name) continue;\n else cnt++;\n } else {\n cnt += line.vote - vote;\n if (name > line.name) cnt++;\n }\n }\n// cout << endl;\n// cout << \"*\" << line.vote << \" \" << line.name << endl;\n// cout << K << \" \" << cnt << \" \" << (cnt <= l? \"ok\":\"no\") <<endl;\n return cnt <= l;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n while (cin >> n >> m >> k >> l, n) {\n other.clear();\n me.clear();\n st.clear();\n a.clear();\n\n REP(i,n) {\n string s;\n ll v;\n cin >> s >> v;\n a.pb(H(v,s));\n }\n sort(a.rbegin(),a.rend());\n//\n// REP(i,n) {\n// cout << a[i].vote << \" \" << a[i].name << endl;\n// }\n\n REP(i,m) {\n string s;\n cin >> s;\n st.insert(s);\n }\n\n REP(i,n) {\n if (st.count(a[i].name)) {\n me.pb(a[i]);\n } else {\n other.pb(a[i]);\n }\n }\n\n other.pb({0,\"zzz\"});\n\n ll left = 0, r = m;\n while (left < r) {\n ll mid = (left + r + 1) / 2;\n if (ok(mid)) {\n left = mid;\n } else {\n r = mid - 1;\n }\n }\n cout << left << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 770,
"memory_kb": 21104,
"score_of_the_acc": -0.2216,
"final_rank": 6
},
{
"submission_id": "aoj_1080_3533616",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <map>\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;\ntypedef pair<ll, string> P;\n\ntemplate<typename T>\nvector<T> make_v(size_t a, T b) {\n return vector<T>(a, b);\n}\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\nbool cmp(const P &p1, const P &p2) {\n if (p1.first != p2.first) {\n return p1.first > p2.first;\n } else {\n return p1.second < p2.second;\n }\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int N, M, K, L;\n while (cin >> N >> M >> K >> L, N) {\n\n vector<P> anime(N);\n vector<P> fav(M);\n {\n map<string, ll> mp;\n REP(i, 0, N) {\n cin >> anime[i].second >> anime[i].first;\n mp[anime[i].second] = anime[i].first;\n }\n\n REP(i, 0, M) {\n cin >> fav[i].second;\n fav[i].first = mp[fav[i].second];\n }\n }\n sort(anime.begin(), anime.end(), cmp);\n sort(fav.begin(), fav.end(), cmp);\n if (N == K) {\n cout << M << endl;\n continue;\n }\n\n int l = 0, r = min(K, M);\n int ans = 0;\n while (l <= r) {\n auto cp = anime;\n int mid = (l + r) / 2;\n ll sum = 0;\n REP (i, 0, mid) {\n int p1 = i, p2 = K - mid + i;\n if (cmp(cp[p2], fav[p1])) {\n sum += cp[p2].first - fav[p1].first;\n sum += (cp[p2].second < fav[p1].second);\n swap(cp[p2], cp[p2 + 1]);\n } \n }\n if (sum <= L) {\n ans = mid;\n l = mid + 1;\n } else {\n r = mid - 1;\n }\n }\n cout << ans << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 1070,
"memory_kb": 22708,
"score_of_the_acc": -0.5171,
"final_rank": 9
},
{
"submission_id": "aoj_1080_3533541",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <map>\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;\ntypedef pair<ll, string> P;\n\ntemplate<typename T>\nvector<T> make_v(size_t a, T b) {\n return vector<T>(a, b);\n}\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\nbool cmp(const P &p1, const P &p2) {\n if (p1.first != p2.first) {\n return p1.first > p2.first;\n } else {\n return p1.second < p2.second;\n }\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int N, M, K, L;\n while (cin >> N >> M >> K >> L, N) {\n\n vector<P> anime(N);\n vector<P> fav(M);\n {\n map<string, ll> mp;\n REP(i, 0, N) {\n cin >> anime[i].second >> anime[i].first;\n mp[anime[i].second] = anime[i].first;\n }\n\n REP(i, 0, M) {\n cin >> fav[i].second;\n fav[i].first = mp[fav[i].second];\n }\n }\n sort(anime.begin(), anime.end(), cmp);\n sort(fav.begin(), fav.end(), cmp);\n int l = 0, r = min(K, M);\n int ans = 0;\n while (l <= r) {\n int mid = (l + r) / 2;\n ll sum = 0;\n REP (i, 0, mid) {\n int p1 = mid - i - 1, p2 = K - 1 - i;\n if (anime[p2].first >= fav[p1].first) {\n sum += anime[p2].first - fav[p1].first;\n sum += (anime[p2].second < fav[p1].second);\n } else {\n break;\n }\n }\n if (sum <= L) {\n ans = mid;\n l = mid + 1;\n } else {\n r = mid - 1;\n }\n }\n cout << ans << endl;\n }\n\n return 0;\n}",
"accuracy": 0.25,
"time_ms": 830,
"memory_kb": 21052,
"score_of_the_acc": -0.2732,
"final_rank": 18
},
{
"submission_id": "aoj_1080_3294327",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <functional>\n#include <map>\n#include <climits>\n#include <stack>\n#include <string>\n#include <random>\n#include<set>\nstruct Vote {\n\tstd::string name;\n\tint vote;\n\tbool operator<(const Vote &that) const {\n\t\treturn (vote == that.vote) ? name > that.name : vote < that.vote;\n\t}\n\tbool operator==(const Vote &that) const {\n\t\treturn vote == that.vote && name == that.name;\n\t}\n\tbool operator>(const Vote &that) const {\n\t\treturn (vote == that.vote) ? name < that.name : vote > that.vote;\n\t}\n};\nbool can_take(const std::vector<Vote> &favorite, const Vote vote, int rest_vote, const int count) {\n\tfor (auto i = favorite.size() - count; i < favorite.size(); ++i) {\n\t\tif (favorite[i] < vote) {\n\t\t\tif (favorite[i].name < vote.name) {\n\t\t\t\trest_vote -= vote.vote - favorite[i].vote;\n\t\t\t}\n\t\t\telse {\n\t\t\t\trest_vote -= vote.vote - favorite[i].vote + 1;\n\t\t\t}\n\t\t\tif (rest_vote < 0) return false;\n\t\t}\n\t\telse {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn true;\n}\nbool can_take(const std::vector<Vote> &fav, const std::vector<Vote> &no_chara, const int k, const int l, const int count) {\n\tauto else_count = k - count;\n\tif (else_count >= no_chara.size()) return true;\n\telse {\n\t\treturn can_take(fav, no_chara[no_chara.size() - else_count - 1], l, count);\n\t}\n}\n\nvoid solve() {\n\tint n, m, k, l;\n\tstd::cin >> n >> m >> k >> l;\n\tif (n == 0) return;\n\tstd::vector<Vote> elseC;\n\tstd::vector<Vote> favC;\n\t{\n\t\tstd::map<std::string, int> estimated;\n\t\tstd::string name; int vote;\n\t\tfor (auto i = 0; i < n; ++i) {\n\t\t\tstd::cin >> name >> vote;\n\t\t\testimated.insert(std::make_pair(name, vote));\n\t\t}\n\t\tfor (auto i = 0; i < m; ++i) {\n\t\t\tstd::cin >> name;\n\t\t\tfavC.push_back(Vote{ name, estimated[name] });\n\t\t\testimated.erase(name);\n\t\t}\n\t\tfor (const auto &pair : estimated) {\n\t\t\telseC.push_back(Vote{ pair.first, pair.second });\n\t\t}\n\t\tstd::sort(elseC.begin(), elseC.end());\n\t\tstd::sort(favC.begin(), favC.end());\n\t}\n\tint left = 0;\n\tint right = std::min(m, k);\n\twhile (left < right) {\n\t\tauto mid = (left + right + 1) / 2;\n\t\tif (can_take(favC, elseC, k, l, mid)) {\n\t\t\tleft = mid;\n\t\t}\n\t\telse {\n\t\t\tright = mid - 1;\n\t\t}\n\t}\n\tstd::cout << right << std::endl;\n\tsolve();\n\n}\n\nint main() {\n\tsolve();\n}\n/*\n\n\n\n*/",
"accuracy": 1,
"time_ms": 1780,
"memory_kb": 65424,
"score_of_the_acc": -2,
"final_rank": 11
},
{
"submission_id": "aoj_1080_2856986",
"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\n#define NUM 100001\n\nmap<string,int> MAP;\n\nstruct Info{\n\tbool operator<(const struct Info &arg) const{\n\t\treturn value > arg.value;\n\t}\n\tint value;\n\tstring name;\n\tbool is_favorite;\n};\n\nint N,M,K,L;\nint ally[NUM],enemy[NUM];\nInfo info[NUM];\n\n\n\nbool strCmp(char* base, char* comp){\n\tint length1,length2;\n\tfor(length1=0;base[length1] != '\\0';length1++);\n\tfor(length2=0;comp[length2] != '\\0';length2++);\n\tif(length1 != length2)return false;\n\n\tfor(int i=0;base[i] != '\\0'; i++){\n\t\tif(base[i] != comp[i])return false;\n\t}\n\treturn true;\n}\n\nbool is_OK(int num){\n\n\tint sum = 0;\n\n\tif(ally[num-1] <= K-1)return true;\n\n\tint base_loc = enemy[K-num];\n\n\tfor(int i = 0; i < num; i++){\n\t\tif(info[ally[i]].value > info[base_loc].value){\n\t\t\tsum += 0;\n\t\t}else if(info[ally[i]].value == info[base_loc].value){\n\t\t\tif(info[ally[i]].name < info[base_loc].name){\n\t\t\t\tsum += 0;\n\t\t\t}else{\n\t\t\t\tsum += 1;\n\t\t\t}\n\t\t}else{\n\t\t\tif(info[ally[i]].name < info[base_loc].name){\n\t\t\t\tsum += info[base_loc].value-info[ally[i]].value;\n\t\t\t}else{\n\t\t\t\tsum += info[base_loc].value-info[ally[i]].value+1;\n\t\t\t}\n\t\t}\n\t\tif(sum > L)return false;\n\t}\n\treturn true;\n}\n\n\nvoid func(){\n\n\tMAP.clear();\n\n\tchar buf[11];\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%s %d\",buf,&info[i].value);\n\t\tinfo[i].name = buf;\n\t\tinfo[i].is_favorite = false;\n\t\tMAP[info[i].name] = i;\n\t}\n\n\tstring name;\n\tfor(int loop = 0; loop < M; loop++){\n\t\tscanf(\"%s\",buf);\n\t\tname = buf;\n\t\tinfo[MAP[name]].is_favorite = true;\n\t}\n\n\tsort(info,info+N);\n\n\tfor(int i = 0; i < NUM; i++){\n\t\tally[i] = BIG_NUM;\n\t\tenemy[i] = BIG_NUM;\n\t}\n\n\tint ally_index = 0,enemy_index = 0;\n\n\tfor(int i = 0; i < N;i++){\n\t\tif(info[i].is_favorite){\n\t\t\tally[ally_index++] = i;\n\t\t}else{\n\t\t\tenemy[enemy_index++] = i;\n\t\t}\n\t}\n\n\n\tint left = 0,right = min(K,M),m = (left+right)/2;\n\tint ans = 0;\n\n\twhile(left <= right){\n\t\tif(is_OK(m)){\n\t\t\tans = m;\n\t\t\tleft = m+1;\n\t\t}else{\n\t\t\tright = m-1;\n\t\t}\n\t\tm = (left+right)/2;\n\t}\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d %d %d\",&N,&M,&K,&L);\n\t\tif(N == 0 && M == 0 && K == 0 && L == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 760,
"memory_kb": 17336,
"score_of_the_acc": -0.137,
"final_rank": 1
},
{
"submission_id": "aoj_1080_2733898",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <climits>\n#include <cmath>\n#include <ctime>\n#include <cassert>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <iomanip>\n#include <complex>\n#include <string>\n#include <vector>\n#include <list>\n#include <deque>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <bitset>\n#include <iterator>\n#include <functional>\n#include <utility>\n#include <algorithm>\n#include <numeric>\n#include <typeinfo>\n \nusing namespace std;\n \n#define dump(n) cerr<<\"# \"<<#n<<\"=\"<<(n)<<endl\n#define repi(i,a,b) for(int i=int(a);i<int(b);i++)\n#define rep(i,n) repi(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 allof(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<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\n \ntypedef pair<int,string> pis;\n \nbool cmp(const pii& a,const pii& b)\n{\n return a.first==b.first?a.second<b.second:a.first>b.first;\n}\n \nbool ok(vector<pii>& favs,vector<pii>& oths,int k,int l,int num)\n{\n if(oths.size()<=k-num)\n return true;\n \n ll need=0;\n rep(i,num){\n if(favs[i].first>oths[k-num].first)\n continue;\n else{\n int diff=oths[k-num].first-favs[i].first;\n bool after=favs[i].second>oths[k-num].second;\n need+=diff+after;\n }\n }\n return need<=l;\n}\n \nvoid solve(vs& names,vi& votes,vs& fnames,int k,int l)\n{\n int n=names.size(),m=fnames.size();\n \n vector<pii> favs,oths; // vote,id\n {\n map<string,int> ma;\n rep(i,n)\n ma[names[i]]=0;\n {int i=0; foreach(it,ma)\n it->second=i++;\n }\n vi isfav(n);\n rep(i,m)\n isfav[ma[fnames[i]]]=1;\n rep(i,n){\n vector<pii>& chrs=isfav[ma[names[i]]]?favs:oths;\n chrs.push_back(mp(votes[i],ma[names[i]]));\n }\n }\n \n sort(allof(favs),cmp);\n sort(allof(oths),cmp);\n \n int left=0,right=1+min(m,k);\n while(right-left>1){\n int mid=(left+right)/2;\n if(ok(favs,oths,k,l,mid))\n left=mid;\n else\n right=mid;\n }\n \n cout<<left<<endl;\n}\n \nint main()\n{\n for(int n,m,k,l;scanf(\"%d%d%d%d\",&n,&m,&k,&l),n|m|k|l;){\n vs names(n);\n vi votes(n);\n for(int i=0;i<n;i++){\n char tmp[11];\n scanf(\"%s%d\",tmp,&votes[i]);\n names[i]=tmp;\n }\n vs favs(m);\n rep(i,m){\n char tmp[11];\n scanf(\"%s\",tmp);\n favs[i]=tmp;\n }\n solve(names,votes,favs,k,l);\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 1160,
"memory_kb": 22272,
"score_of_the_acc": -0.5873,
"final_rank": 10
},
{
"submission_id": "aoj_1080_2144992",
"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 rall(v) (v).rbegin(), (v).rend()\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, string> P;\n\nstruct Chara\n{\n string name; \n int x;\n Chara(){}\n Chara(string name, int x):name(name), x(x){}\n bool operator < (const Chara& c) const {\n return x != c.x ? x > c.x : name < c.name;\n }\n};\n\nconst int inf = 1LL << 55;\nconst int mod = 1e9 + 7;\n\nint N, M, K, L;\nset<string> favname;\nvector<Chara> dic, fav, unf;\n\nbool check(int k)\n{\n if(unf.size() < K-k+1) return true;\n int l = 0;\n for(int i = 0; i < k; i++) {\n l += max(0LL, unf[K-k].x - fav[i].x + (fav[i].name > unf[K-k].name));\n }\n return l <= L;\n}\n\nsigned main()\n{\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n while(cin >> N >> M >> K >> L, N) {\n dic.clear();\n for(int i = 0; i < N; i++) {\n string name; int x; \n cin >> name >> x;\n dic.push_back(Chara(name, x));\n }\n favname.clear();\n for(int i = 0; i < M; i++) {\n string name; cin >> name;\n favname.insert(name);\n }\n fav.clear();\n unf.clear();\n for(auto a : dic) {\n if(favname.find(a.name) != favname.end()) fav.push_back(a);\n else unf.push_back(a);\n }\n sort(all(fav));\n sort(all(unf));\n int lb = 0, ub = min(M, K) + 1;\n while(lb + 1 < ub) {\n int mb = (lb + ub) / 2;\n if(check(mb)) lb = mb;\n else ub = mb;\n }\n cout << lb << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 790,
"memory_kb": 26200,
"score_of_the_acc": -0.3418,
"final_rank": 8
},
{
"submission_id": "aoj_1080_2144991",
"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 rall(v) (v).rbegin(), (v).rend()\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, string> P;\n\nstruct Chara\n{\n string name; \n int x;\n Chara(){}\n Chara(string name, int x):name(name), x(x){}\n bool operator < (const Chara& c) const {\n return x != c.x ? x > c.x : name < c.name;\n }\n};\n\nconst int inf = 1LL << 55;\nconst int mod = 1e9 + 7;\n\nint N, M, K, L;\nset<string> favname;\nvector<Chara> dic, fav, unf;\n\n\n\nbool check(int k)\n{\n if(unf.size() < K-k+1) return true;\n int l = 0;\n for(int i = 0; i < k; i++) {\n l += max(0LL, unf[K-k].x - fav[i].x);\n if(fav[i].name > unf[K-k].name) l++; \n }\n return l <= L;\n}\n\nsigned main()\n{\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n while(cin >> N >> M >> K >> L, N) {\n dic.clear();\n for(int i = 0; i < N; i++) {\n string name; int x; \n cin >> name >> x;\n dic.push_back(Chara(name, x));\n }\n favname.clear();\n for(int i = 0; i < M; i++) {\n string name; cin >> name;\n favname.insert(name);\n }\n fav.clear();\n unf.clear();\n for(auto a : dic) {\n if(favname.find(a.name) != favname.end()) fav.push_back(a);\n else unf.push_back(a);\n }\n sort(all(fav));\n sort(all(unf));\n int lb = 0, ub = min(M, K) + 1;\n while(lb + 1 < ub) {\n int mb = (lb + ub) / 2;\n if(check(mb)) lb = mb;\n else ub = mb;\n }\n cout << lb << endl;\n }\n \n return 0;\n}",
"accuracy": 0.25,
"time_ms": 650,
"memory_kb": 26200,
"score_of_the_acc": -0.219,
"final_rank": 17
},
{
"submission_id": "aoj_1080_2144989",
"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 rall(v) (v).rbegin(), (v).rend()\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, string> P;\n\nconst int inf = 1LL << 55;\nconst int mod = 1e9 + 7;\n\nint N, M, K, L;\nset<string> favname;\nvector<P> dic, fav, unf;\n\nbool check(int k)\n{\n if(unf.size() < K-k+1) return true;\n int l = 0;\n for(int i = 0; i < k; i++) {\n l += max(0LL, fav[i].first - unf[K-k].first);\n if(fav[i].second > unf[K-k].second) l++; \n }\n return l <= L;\n}\n\nsigned main()\n{\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n while(cin >> N >> M >> K >> L, N) {\n dic.clear();\n for(int i = 0; i < N; i++) {\n string name; int x; \n cin >> name >> x;\n dic.push_back(P(-x, name));\n }\n favname.clear();\n for(int i = 0; i < M; i++) {\n string name; cin >> name;\n favname.insert(name);\n }\n fav.clear();\n unf.clear();\n for(auto a : dic) {\n if(favname.find(a.second) != favname.end()) fav.push_back(a);\n else unf.push_back(a);\n }\n sort(all(fav));\n sort(all(unf));\n int lb = 0, ub = min(M, K) + 1;\n while(lb + 1 < ub) {\n int mb = (lb + ub) / 2;\n if(check(mb)) lb = mb;\n else ub = mb;\n }\n cout << lb << endl;\n }\n \n return 0;\n}",
"accuracy": 0.25,
"time_ms": 640,
"memory_kb": 26296,
"score_of_the_acc": -0.2121,
"final_rank": 16
},
{
"submission_id": "aoj_1080_2144985",
"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 rall(v) (v).rbegin(), (v).rend()\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, string> P;\n\n//const int inf = 1LL << 55;\nconst int mod = 1e9 + 7;\n\nint N, M, K, L;\nset<string> favname;\nvector<P> dic, fav, unf;\n\nbool check(int k)\n{\n if(unf.size() < K-k+1) return true;\n int l = 0;\n for(int i = 0; i < k; i++) {\n l += max(0, fav[i].first - unf[K-k].first);\n if(fav[i].second > unf[K-k].second) l++; \n }\n return l <= L;\n}\n\nsigned main()\n{\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n while(cin >> N >> M >> K >> L, N) {\n dic.clear();\n for(int i = 0; i < N; i++) {\n string name; int x; \n cin >> name >> x;\n dic.push_back(P(-x, name));\n }\n favname.clear();\n for(int i = 0; i < M; i++) {\n string name; cin >> name;\n favname.insert(name);\n }\n fav.clear();\n unf.clear();\n for(auto a : dic) {\n if(favname.find(a.second) != favname.end()) fav.push_back(a);\n else unf.push_back(a);\n }\n sort(all(fav));\n sort(all(unf));\n int lb = 0, ub = min(M, K) + 1;\n while(lb + 1 < ub) {\n int mb = (lb + ub) / 2;\n if(check(mb)) lb = mb;\n else ub = mb;\n }\n cout << lb << endl;\n }\n \n return 0;\n}",
"accuracy": 0.25,
"time_ms": 640,
"memory_kb": 26232,
"score_of_the_acc": -0.2109,
"final_rank": 15
},
{
"submission_id": "aoj_1080_2144966",
"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 rall(v) (v).rbegin(), (v).rend()\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, string> P;\n\nconst int inf = 1LL << 55;\nconst int mod = 1e9 + 7;\n\nint N, M, K, L;\nvector<P> fav;\nvector<P> unf;\n\nbool check(int k)\n{\n if(unf.size() < K-k+1) return true;\n int l = 0;\n for(int i = 0; i < k; i++) {\n if(fav[i].first != unf[K-k].first) {\n l += max(0LL, fav[i].first - unf[K-k].first);\n } else if(fav[i].second > unf[K-k].second) {\n l++;\n }\n }\n return l <= L;\n}\n\nsigned main()\n{\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n while(cin >> N >> M >> K >> L, N) {\n unordered_map<string, int> dic;\n for(int i = 0; i < N; i++) {\n string name; int x; \n cin >> name >> x;\n dic[name] = -x;\n }\n set<string> favname;\n for(int i = 0; i < M; i++) {\n string name; cin >> name;\n favname.insert(name);\n }\n fav.clear();\n unf.clear();\n for(auto a : dic) {\n if(favname.find(a.first) != favname.end()) fav.push_back(P(a.second, a.first));\n else unf.push_back(P(a.second, a.first));\n }\n sort(all(fav));\n sort(all(unf));\n int lb = 0, ub = M+1;\n while(lb + 1 < ub) {\n int mb = (lb + ub) / 2;\n if(check(mb)) lb = mb;\n else ub = mb;\n }\n cout << lb << endl;\n }\n \n return 0;\n}",
"accuracy": 0.25,
"time_ms": 980,
"memory_kb": 29580,
"score_of_the_acc": -0.5765,
"final_rank": 20
},
{
"submission_id": "aoj_1080_2134308",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nstruct BinaryIndexedTree\n{\n vector< int > data;\n\n BinaryIndexedTree(int sz)\n {\n data.assign(++sz, 0);\n }\n\n int sum(int k)\n {\n int ret = 0;\n for(++k; k > 0; k -= k & -k) ret += data[k];\n return (ret);\n }\n\n void add(int k, int x)\n {\n for(++k; k < data.size(); k += k & -k) data[k] += x;\n }\n};\n\nint main()\n{\n long long N, M, K, L;\n char buff[12];\n\n while(scanf(\"%lld %lld %lld %lld\", &N, &M, &K, &L), N) {\n\n vector< pair< int, string > > data(N);\n vector< int > toint(N);\n vector< string > priority(N);\n unordered_map< string, int > vv;\n vector< bool > like(N, false);\n\n for(int i = 0; i < N; i++) {\n int x;\n scanf(\" %s %d\", buff, &x);\n data[i] = make_pair(-x, buff);\n priority[i] = data[i].second;\n }\n sort(begin(priority), end(priority));\n sort(begin(data), end(data));\n\n\n for(int i = 0; i < N; i++) {\n toint[i] = lower_bound(begin(priority), end(priority), data[i].second) - begin(priority);\n vv[data[i].second] = i;\n data[i].first *= -1;\n }\n\n for(int i = 0; i < M; i++) {\n scanf(\"%s\", buff);\n like[vv[buff]] = true;\n }\n\n BinaryIndexedTree bit(N);\n\n long long right = K, bottom = 0, up = 0;\n long long sz = 0, ret = 0, pre = -1;\n\n for(int i = 0; i < K; i++) {\n ret += like[i];\n }\n\n for(int i = K - 1; i >= 0; i--) {\n if(!like[i]) {\n while(right < N && !like[right]) ++right;\n if(right == N) break;\n L -= data[i].first - data[right].first;\n if(~pre) {\n L -= bottom * (data[i].first - pre);\n L -= up * (data[i].first - pre - 1); // kore sugoi\n }\n bit.add(toint[right], 1);\n bottom = bit.sum(toint[i]);\n up = bit.sum(N - 1) - bottom;\n pre = data[i].first;\n sz = 0;\n L -= up;\n if(L < 0) break;\n ++ret;\n ++right;\n } else {\n if(i == 0) break;\n bit.add(toint[i], 1);\n L -= ++sz * (data[i - 1].first - data[i].first);\n }\n }\n\n printf(\"%lld\\n\", ret);\n }\n\n}",
"accuracy": 1,
"time_ms": 810,
"memory_kb": 16472,
"score_of_the_acc": -0.1635,
"final_rank": 5
},
{
"submission_id": "aoj_1080_2134295",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nstruct BinaryIndexedTree\n{\n vector< int > data;\n\n BinaryIndexedTree(int sz)\n {\n data.assign(++sz, 0);\n }\n\n int sum(int k)\n {\n int ret = 0;\n for(++k; k > 0; k -= k & -k) ret += data[k];\n return (ret);\n }\n\n void add(int k, int x)\n {\n for(++k; k < data.size(); k += k & -k) data[k] += x;\n }\n};\n\nint main()\n{\n long long N, M, K, L;\n char buff[12];\n\n while(scanf(\"%lld %lld %lld %lld\", &N, &M, &K, &L), N) {\n\n vector< pair< int, string > > data(N);\n vector< int > toint(N);\n vector< string > priority(N);\n unordered_map< string, int > vv;\n vector< bool > like(N, false);\n\n for(int i = 0; i < N; i++) {\n int x;\n scanf(\" %s %d\", buff, &x);\n data[i] = make_pair(-x, buff);\n priority[i] = data[i].second;\n }\n sort(begin(priority), end(priority));\n sort(begin(data), end(data));\n\n\n for(int i = 0; i < N; i++) {\n toint[i] = lower_bound(begin(priority), end(priority), data[i].second) - begin(priority);\n vv[data[i].second] = i;\n data[i].first *= -1;\n }\n\n for(int i = 0; i < M; i++) {\n scanf(\"%s\", buff);\n like[vv[buff]] = true;\n }\n\n BinaryIndexedTree bit(N);\n\n long long right = K, bottom = 0, up = 0;\n long long sz = 0, ret = 0, pre = -1;\n\n for(int i = 0; i < K; i++) {\n ret += like[i];\n }\n\n for(int i = K - 1; i >= 0; i--) {\n if(!like[i]) {\n while(right < N && !like[right]) ++right;\n if(right == N) break;\n\n if(data[i].first == data[pre].first) {\n// cerr << \"foo\" << endl;\n// ???????????¨???????????????????????????\n\n }\n L -= data[i].first - data[right].first;\n if(~pre) {\n L -= bottom * (data[i].first - data[pre].first);\n L -= up * (data[i].first - data[pre].first - 1);\n }\n// assert(bottom * (data[i].first - data[pre].first) >= 0);\n// assert(up * (data[i].first - data[pre].first - 1) >= 0);\n\n bit.add(toint[right], 1);\n\n bottom = bit.sum(toint[i]);\n up = bit.sum(N - 1) - bottom;\n pre = i;\n sz = 0;\n\n L -= up;\n\n\n if(L < 0) break;\n ++ret;\n ++right;\n } else {\n if(i == 0) break;\n bit.add(toint[i], 1);\n L -= ++sz * (data[i - 1].first - data[i].first);\n }\n }\n\n printf(\"%lld\\n\", ret);\n }\n\n}",
"accuracy": 1,
"time_ms": 800,
"memory_kb": 16544,
"score_of_the_acc": -0.1561,
"final_rank": 2
},
{
"submission_id": "aoj_1080_2134253",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nstruct BinaryIndexedTree\n{\n vector< int > data;\n\n BinaryIndexedTree(int sz)\n {\n data.assign(++sz, 0);\n }\n\n int sum(int k)\n {\n int ret = 0;\n for(++k; k > 0; k -= k & -k) ret += data[k];\n return (ret);\n }\n\n void add(int k, int x)\n {\n for(++k; k < data.size(); k += k & -k) data[k] += x;\n }\n};\n\nint main()\n{\n long long N, M, K, L;\n char buff[12];\n\n while(scanf(\"%lld %lld %lld %lld\", &N, &M, &K, &L), N) {\n\n vector< pair< int, string > > data(N);\n vector< int > toint(N);\n vector< string > priority(N);\n unordered_map< string, int > vv;\n vector< bool > like(N, false);\n\n for(int i = 0; i < N; i++) {\n int x;\n scanf(\" %s %d\", buff, &x);\n data[i] = make_pair(-x, buff);\n priority[i] = data[i].second;\n }\n sort(begin(priority), end(priority));\n sort(begin(data), end(data));\n\n\n for(int i = 0; i < N; i++) {\n toint[i] = lower_bound(begin(priority), end(priority), data[i].second) - begin(priority);\n vv[data[i].second] = i;\n data[i].first *= -1;\n }\n\n for(int i = 0; i < M; i++) {\n scanf(\"%s\", buff);\n like[vv[buff]] = true;\n }\n\n BinaryIndexedTree bit(N);\n\n long long right = K, bottom = 0, up = 0;\n long long sz = 0, ret = 0, pre = 0;\n\n for(int i = 0; i < K; i++) {\n ret += like[i];\n }\n\n for(int i = K - 1; i >= 0; i--) {\n if(!like[i]) {\n while(right < N && !like[right]) ++right;\n if(right == N) break;\n bit.add(toint[right], 1);\n\n L -= data[i].first - data[right].first;\n L -= bottom * (data[i].first - pre);\n L -= up * (data[i].first - pre - 1);\n\n bottom = bit.sum(toint[i]);\n up = bit.sum(N - 1) - bottom;\n pre = data[right].first;\n sz = 0;\n\n L -= up;\n if(L < 0) break;\n ++ret;\n } else {\n if(i == 0) break;\n bit.add(toint[i], 1);\n L -= ++sz * (data[i - 1].first - data[i].first);\n }\n }\n\n printf(\"%lld\\n\", ret);\n }\n\n}",
"accuracy": 0.25,
"time_ms": 810,
"memory_kb": 16488,
"score_of_the_acc": -0.1638,
"final_rank": 14
},
{
"submission_id": "aoj_1080_2060735",
"code_snippet": "#include <iostream>\n#include <map>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nstruct P {\n int point;\n string name;\n\n P() {}\n P(int point, string name) : point{point}, name{name} {}\n\n bool operator < (const P& p) const {\n if (point != p.point) {\n return point > p.point; \n }\n return name < p.name;\n }\n};\n\nbool c(int X, int K, int L, const vector<P>& info, const vector<int>& p)\n{\n int sum = 0;\n int rnk = K - X;\n for (int i = 0; i < X; i++) {\n if (p[i] <= rnk) {\n rnk = min(rnk + 1, K);\n continue;\n }\n\n if (info[p[i]].name < info[rnk].name) { \n sum += info[rnk].point - info[p[i]].point;\n } else {\n sum += info[rnk].point - info[p[i]].point + 1;\n }\n if (sum > L) return 0;\n }\n return (sum <= L);\n}\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n int N, M, K, L;\n while (cin >> N >> M >> K >> L, N > 0) {\n string name;\n int point;\n vector<P> info;\n for (int i = 0; i < N; i++) {\n cin >> name >> point;\n info.emplace_back(point, name);\n }\n\n sort(info.begin(), info.end());\n \n map<string, int> num;\n for (int i = 0; i < N; i++) {\n num[info[i].name] = i;\n }\n \n vector<int> p(M);\n string fav;\n for (int i = 0; i < M; i++) {\n cin >> fav;\n p[i] = num[fav];\n }\n\n sort(p.begin(), p.end());\n\n int l = 0, r = min(K, M);\n while (r - l > 1) {\n int mid = (l + r) / 2;\n if (c(mid, K, L, info, p)) {\n l = mid;\n } else {\n r = mid;\n }\n }\n\n if (c(r, K, L, info, p)) {\n cout << r << endl;\n } else {\n cout << l << endl;\n }\n } \n return 0;\n}",
"accuracy": 1,
"time_ms": 820,
"memory_kb": 15760,
"score_of_the_acc": -0.1579,
"final_rank": 3
}
] |
aoj_1087_cpp
|
Problem D: Dimensional Analysis
量の次元とは、相異なる量の間の関係式から具体的数値を無視して量の種類とそのべき乗だけに着目した概念である。具体的には定数係数を無視した等式として、次元の関係式を表す。すなわち、量 q の次元を[ q ]と表せば、以下のようないくつかの次元の関係式が例示できる。
[面積] = [長さ]
2
[体積] = [長さ]
3
[速さ] = [長さ][時間]
-1
[加速度] = [長さ][時間]
-2
[力] = [質量][長さ][時間]
-2
[仕事] = [質量][長さ]
2
[時間]
-2
(Wikipedia 「量」より抜粋 URL http://ja.wikipedia.org/wiki/%E9%87%8F)
量は基本量と組み立て量に分類される。
この問題ではn個の基本量とm個の組立量が与えられる。
与えられたm個の組立量の次元はすべてn個の基本量の次元の積で表すことができる。
また基本量の次元の積で２つの次元を表したとき、各基本量の指数がすべて一致すればその二つの次元は等しいと言える。
式と変数の量と量の次元についての情報が与えられるので、
式を解析しその次元が表す量の名称を出力せよ。
名称が定義されてない場合はundefinedと出力せよ。
また、計算過程で異なる二つの次元の加算もしくは減算するような演算のことを”不正な演算”の定義する。
”不正な演算”があればerrorと出力せよ。
与えられる式は以下を満たす。
すべての変数は組立量の次元に割り当てられている。
式は四則演算+, -, /, *とカッコ（）と変数のみを含む。
四則演算はよく知られているもので、正しく記述されているものとする。厳密には以下のBNFに従う。 また単項演算子は使用されない。(x * (-a))などは存在しない。
<formula>::=<term>|<formula>+<term>|<formula>-<term>
<term>::=<factor>|<term>*<factor>|<term>/<factor>
<factor>::=<variable>|(<formula>)
<variable>::=<string>
<string>::=<char>|<string><char>
<char>::=a~z|A~Z
<formula>が式を表し、<variable>が変数名を表す。
Input
入力は複数のデータセットで構成されている。
データセットの数は1,000個を超えない。
データセットは以下の形式で与えられる。
n m p
derived
1
d
1,1
d
1,2
d
1,3
.... d
1,n
derived
2
d
2,1
d
2,2
d
2,3
.... d
2,n
...
derived
m
d
m,1
d
m,2
d
m,3
.... d
m,n
formula
v
1
D
1
v
2
D
2
...
v
p
D
p
n(1≤n≤5)は基本量の数 m(1≤m≤10) は組立量の数 p(1≤p≤15)は変数の種類数を示す。
derived
i
はi番目の組立量の名前である。アルファベット大文字や小文字から構成され長さは20文字を超えない。
d
i,j
(-10≤d
i,j
≤10)はi番目の組立量のj番目の基本量の次元を表す(1≤i≤m, 1≤j≤n)。
同じ組立量の名称は複数回現れない。
同じ次元の組立量が複数回現れることがあるが、その場合は最後に定義された名称がその組立量の名称となる。
formulaは解析を行う数式を表す。長さは100文字を超えない。
v
i
は変数名を表す。アルファベット大文字や小文字から構成され長さは20文字を超えない。
D
i
はv
i
の次元の名称を表す。すでに与えられた組立量の名称であることが保証されている。
入力中の数（n, m, p, d）はすべて整数である。
入力の終わりは、3個の0がそれぞれ一文字の空白で区切られる一行で示される。
Output
一行に式を解析しその次元の名称を出力せよ。
名称が定義されてない場合はundefinedと出力せよ。
また、不正な演算が含まれる場合はerrorと出力せよ。
Sample Input
2 3 2
length
1 0
time
0 1
speed
1 -1
a/b
a length
b time
2 3 3
length
1 0
time
0 1
speed
1 -1
a/b+c
a length
b time
c speed
2 3 3
length
1 0
time
0 1
speed
1 -1
a/b+c
a length
b time
c time
2 3 2
length
1 0
time
0 1
speed
1 -1
a/b/b
a length
b time
3 6 6
speed
1 -1 0
acceleration
1 -2 0
force
1 -2 1
length
1 0 0
time
0 1 0
weight
0 0 1
((v+l/t)+a*t)/(t*t)*w*t+f+w*a
v speed
l length
a acceleration
t time
w weight
f force
0 0 0
Sample Output
speed
speed
error
undefined
force
|
[
{
"submission_id": "aoj_1087_6074337",
"code_snippet": "#include<map>\n#include<cctype>\n#include<string>\n#include<vector>\n#include<iostream>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nvoid operator*=(vector<int> &a,const vector<int> &b){ rep(i,a.size()) a[i]+=b[i]; }\nvoid operator/=(vector<int> &a,const vector<int> &b){ rep(i,a.size()) a[i]-=b[i]; }\n\nmap< string,vector<int> > f,g; // f : ツ組ツ猟ァツ療環づ個鳴シツ前 -> ツ甘ョツ本ツ療環づ個療ア, g : ツ陛渉青板づ個鳴シツ前 -> ツ甘ョツ本ツ療環づ個療ア\nmap< vector<int>,string > f_inv;\n\nint idx;\nstring s;\nbool error;\n\nvector<int> expr();\n\nvector<int> variable(){\n\tstring a;\n\twhile(idx<s.length() && isalpha(s[idx])) a+=s[idx++];\n\treturn g[a];\n}\n\nvector<int> factor(){\n\tif(idx<s.length() && s[idx]=='('){\n\t\tidx++;\n\t\tvector<int> a=expr();\n\t\tidx++;\n\t\treturn a;\n\t}\n\telse return variable();\n}\n\nvector<int> term(){\n\tvector<int> a=factor();\n\twhile(idx<s.length() && (s[idx]=='*' || s[idx]=='/')){\n\t\tchar op=s[idx++];\n\t\tvector<int> b=factor();\n\t\tif(op=='*') a*=b;\n\t\telse a/=b;\n\t}\n\treturn a;\n}\n\nvector<int> expr(){\n\tvector<int> a=term();\n\twhile(idx<s.length() && (s[idx]=='+' || s[idx]=='-')){\n\t\tidx++;\n\t\tvector<int> b=term();\n\t\tif(a!=b){ error=true; break; }\n\t}\n\treturn a;\n}\n\nstring parse(string formula){\n\tidx=0;\n\ts=formula;\n\terror=false;\n\n\tvector<int> res=expr();\n\tif(error) return \"error\";\n\tif(f_inv.count(res)==0) return \"undefined\";\n\treturn f_inv[res];\n}\n\nint main(){\n\tfor(int n,m,p;cin>>n>>m>>p,n;){\n\t\tf.clear();\n\t\tg.clear();\n\t\tf_inv.clear();\n\n\t\trep(i,m){\n\t\t\tstring s; cin>>s;\n\t\t\tvector<int> a(n);\n\t\t\trep(j,n) cin>>a[j];\n\t\t\tf[s]=a;\n\t\t\tf_inv[a]=s;\n\t\t}\n\n\t\tstring formula; cin>>formula;\n\t\trep(i,p){\n\t\t\tstring s,t; cin>>s>>t;\n\t\t\tg[s]=f[t];\n\t\t}\n\n\t\tcout<<parse(formula)<<endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3204,
"score_of_the_acc": -0.6204,
"final_rank": 4
},
{
"submission_id": "aoj_1087_6074148",
"code_snippet": "//just test\n\n#include<map>\n#include<cctype>\n#include<string>\n#include<vector>\n#include<iostream>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nvoid operator*=(vector<int> &a,const vector<int> &b){ rep(i,a.size()) a[i]+=b[i]; }\nvoid operator/=(vector<int> &a,const vector<int> &b){ rep(i,a.size()) a[i]-=b[i]; }\n\nmap< string,vector<int> > f,g; // f : ツ組ツ猟ァツ療環づ個鳴シツ前 -> ツ甘ョツ本ツ療環づ個療ア, g : ツ陛渉青板づ個鳴シツ前 -> ツ甘ョツ本ツ療環づ個療ア\nmap< vector<int>,string > f_inv;\n\nint idx;\nstring s;\nbool error;\n\nvector<int> expr();\n\nvector<int> variable(){\n\tstring a;\n\twhile(idx<s.length() && isalpha(s[idx])) a+=s[idx++];\n\treturn g[a];\n}\n\nvector<int> factor(){\n\tif(idx<s.length() && s[idx]=='('){\n\t\tidx++;\n\t\tvector<int> a=expr();\n\t\tidx++;\n\t\treturn a;\n\t}\n\telse return variable();\n}\n\nvector<int> term(){\n\tvector<int> a=factor();\n\twhile(idx<s.length() && (s[idx]=='*' || s[idx]=='/')){\n\t\tchar op=s[idx++];\n\t\tvector<int> b=factor();\n\t\tif(op=='*') a*=b;\n\t\telse a/=b;\n\t}\n\treturn a;\n}\n\nvector<int> expr(){\n\tvector<int> a=term();\n\twhile(idx<s.length() && (s[idx]=='+' || s[idx]=='-')){\n\t\tidx++;\n\t\tvector<int> b=term();\n\t\tif(a!=b){ error=true; break; }\n\t}\n\treturn a;\n}\n\nstring parse(string formula){\n\tidx=0;\n\ts=formula;\n\terror=false;\n\n\tvector<int> res=expr();\n\tif(error) return \"error\";\n\tif(f_inv.count(res)==0) return \"undefined\";\n\treturn f_inv[res];\n}\n\nint main(){\n\tfor(int n,m,p;cin>>n>>m>>p,n;){\n\t\tf.clear();\n\t\tg.clear();\n\t\tf_inv.clear();\n\n\t\trep(i,m){\n\t\t\tstring s; cin>>s;\n\t\t\tvector<int> a(n);\n\t\t\trep(j,n) cin>>a[j];\n\t\t\tf[s]=a;\n\t\t\tf_inv[a]=s;\n\t\t}\n\n\t\tstring formula; cin>>formula;\n\t\trep(i,p){\n\t\t\tstring s,t; cin>>s>>t;\n\t\t\tg[s]=f[t];\n\t\t}\n\n\t\tcout<<parse(formula)<<endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3196,
"score_of_the_acc": -0.6178,
"final_rank": 3
},
{
"submission_id": "aoj_1087_4270031",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing State = string::const_iterator;\nusing D = vector<int>;\n\nint n, m, p;\nmap<string,D> s2d, table;\nmap<D,string> d2s;\nbool error;\n\nD expr(State &itr);\nD term(State &itr);\nD factor(State &itr);\nD variable(State &itr);\n\nvoid print(D d){\n for(auto x : d){\n cout << x << \" \";\n }\n cout << endl;\n}\n\nvoid next_char(State &itr, char expected){\n if(*itr == expected){\n itr++;\n }else{\n // error\n cout << \"expected \" << expected << \" but\" << *itr << endl;\n while(*itr){\n cout << *itr;\n }\n cout << endl;\n }\n}\n\nD expr(State &itr){\n D res = term(itr);\n while(1){\n if(*itr == '+' || *itr == '-'){\n itr++;\n D tmp = term(itr);\n if(res != tmp){\n error = true;\n }\n }else{\n break;\n }\n }\n return res;\n}\n\nD term(State &itr){\n D res = factor(itr);\n while(1){\n if(*itr == '*'){\n next_char(itr, '*');\n D tmp = factor(itr);\n for(int i=0;i<n;i++){\n res[i] += tmp[i];\n }\n }else if(*itr == '/'){\n next_char(itr, '/');\n D tmp = factor(itr);\n for(int i=0;i<n;i++){\n res[i] -= tmp[i];\n }\n }else{\n break;\n }\n }\n return res;\n}\n\nD factor(State &itr){\n D res;\n if(*itr == '('){\n next_char(itr, '(');\n res = expr(itr);\n next_char(itr, ')');\n }else{\n res = variable(itr);\n }\n return res;\n}\n\nD variable(State &itr){\n string name = \"\";\n while(isalpha(*itr)){\n name.push_back(*itr);\n itr++;\n }\n if(!name.empty() && table.find(name) != table.end()){\n return table[name];\n }else{\n // error\n cout << \"this is not variable\" << endl;\n exit(1);\n }\n}\n\nint main(){\n while(cin >> n >> m >> p){\n if(n == 0) break;\n s2d.clear();\n d2s.clear();\n table.clear();\n for(int i=0;i<m;i++){\n string derived;\n cin >> derived;\n D d(n);\n for(int j=0;j<n;j++){\n cin >> d[j];\n }\n s2d[derived] = d;\n d2s[d] = derived;\n }\n string formula;\n cin >> formula;\n\n for(int i=0;i<p;i++){\n string v, d;\n cin >> v >> d;\n table[v] = s2d[d];\n }\n error = false;\n State begin = formula.begin();\n D ans = expr(begin);\n\n if(error){\n cout << \"error\" << endl;\n }else if(d2s.find(ans)!=d2s.end()){\n cout << d2s[ans] << endl;\n }else{\n cout << \"undefined\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3236,
"score_of_the_acc": -0.6309,
"final_rank": 6
},
{
"submission_id": "aoj_1087_4269984",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing State = string::const_iterator;\nusing D = vector<int>;\n\nint n, m, p;\nmap<string,D> s2d, table;\nmap<D,string> d2s;\nbool error;\n\nD expr(State &itr);\nD term(State &itr);\nD factor(State &itr);\nD variable(State &itr);\n\nvoid print(D d){\n for(auto x : d){\n cout << x << \" \";\n }\n cout << endl;\n}\n\nvoid next_char(State &itr, char expected){\n if(*itr == expected){\n itr++;\n }else{\n // error\n cout << \"expected \" << expected << \" but\" << *itr << endl;\n while(*itr){\n cout << *itr;\n }\n cout << endl;\n }\n}\n\nD expr(State &itr){\n D res = term(itr);\n while(1){\n if(*itr == '+' || *itr == '-'){\n itr++;\n D tmp = term(itr);\n if(res != tmp){\n error = true;\n }\n }else{\n break;\n }\n }\n return res;\n}\n\nD term(State &itr){\n D res = factor(itr);\n while(1){\n if(*itr == '*'){\n next_char(itr, '*');\n D tmp = factor(itr);\n for(int i=0;i<n;i++){\n res[i] += tmp[i];\n }\n }else if(*itr == '/'){\n next_char(itr, '/');\n D tmp = factor(itr);\n for(int i=0;i<n;i++){\n res[i] -= tmp[i];\n }\n }else{\n break;\n }\n }\n return res;\n}\n\nD factor(State &itr){\n D res;\n if(*itr == '('){\n next_char(itr, '(');\n res = expr(itr);\n next_char(itr, ')');\n }else{\n res = variable(itr);\n }\n return res;\n}\n\nD variable(State &itr){\n string name = \"\";\n while(isalpha(*itr)){\n name.push_back(*itr);\n itr++;\n }\n if(!name.empty() && table.find(name) != table.end()){\n return table[name];\n }else{\n // error\n cout << \"this is not variable\" << endl;\n exit(1);\n }\n}\n\nint main(){\n while(cin >> n >> m >> p){\n if(n == 0) break;\n for(int i=0;i<m;i++){\n string derived;\n cin >> derived;\n D d(n);\n for(int j=0;j<n;j++){\n cin >> d[j];\n }\n s2d[derived] = d;\n d2s[d] = derived;\n }\n string formula;\n cin >> formula;\n\n for(int i=0;i<p;i++){\n string v, d;\n cin >> v >> d;\n table[v] = s2d[d];\n }\n error = false;\n State begin = formula.begin();\n D ans = expr(begin);\n\n if(error){\n cout << \"error\" << endl;\n }else if(d2s.find(ans)!=d2s.end()){\n cout << d2s[ans] << endl;\n }else{\n cout << \"undefined\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 0.5714285714285714,
"time_ms": 10,
"memory_kb": 4364,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_1087_3020939",
"code_snippet": "#include <cstdio>\n#include <cstdint>\n#include <cassert>\n#include <cctype>\n#include <vector>\n#include <string>\n#include <map>\n#include <algorithm>\n#include <stdexcept>\n\nstruct Dimension: std::vector<int> {\n Dimension(size_t n=0): std::vector<int>(n) {}\n Dimension &operator +=(const Dimension &oth) {\n if (*this != oth) throw std::logic_error(\"mismatch\");\n return *this;\n }\n Dimension &operator -=(const Dimension &oth) {\n if (*this != oth) throw std::logic_error(\"mismatch\");\n return *this;\n }\n Dimension &operator *=(const Dimension &oth) {\n for (size_t i=0; i<size(); ++i)\n (*this)[i] += oth[i];\n\n return *this;\n }\n Dimension &operator /=(const Dimension &oth) {\n for (size_t i=0; i<size(); ++i)\n (*this)[i] -= oth[i];\n\n return *this;\n }\n};\n\nDimension parse(\n const std::string &s, size_t &i,\n const std::map<std::string, Dimension> expr, size_t preced=0) {\n\n const std::vector<std::string> ops={\"+-\", \"*/\"};\n\n if (preced == ops.size()) {\n if (s[i] == '(') {\n Dimension res=parse(s, ++i, expr, 0);\n assert(s[i] == ')');\n ++i;\n return res;\n }\n if (isalpha(s[i])) {\n std::string name(1, s[i]);\n while (++i < s.length() && isalpha(s[i]))\n name += s[i];\n\n return expr.at(name);\n }\n assert(false);\n }\n\n Dimension lhs=parse(s, i, expr, preced+1);\n while (i < s.length()) {\n char op=s[i];\n if (!std::count(ops[preced].begin(), ops[preced].end(), op)) break;\n Dimension rhs=parse(s, ++i, expr, preced+1);\n if (op == '+') lhs += rhs;\n if (op == '-') lhs -= rhs;\n if (op == '*') lhs *= rhs;\n if (op == '/') lhs /= rhs;\n }\n return lhs;\n}\n\nint testcase_ends() {\n size_t n, m, p;\n scanf(\"%zu %zu %zu\", &n, &m, &p);\n if (n == 0 && m == 0 && p == 0) return 1;\n\n std::map<std::string, Dimension> stod;\n std::map<Dimension, std::string> dtos;\n for (size_t i=0; i<m; ++i) {\n char buf[32];\n scanf(\"%s\", buf);\n std::string s=buf;\n Dimension d(n);\n for (size_t j=0; j<n; ++j)\n scanf(\"%d\", &d[j]);\n\n stod[s] = d;\n dtos[d] = s;\n }\n\n std::string s;\n {\n char buf[128];\n scanf(\"%s\", buf);\n s = buf;\n }\n\n std::map<std::string, Dimension> expr;\n for (size_t i=0; i<p; ++i) {\n char buf[128];\n scanf(\"%s\", buf);\n std::string lhs=buf;\n scanf(\"%s\", buf);\n std::string rhs=buf;\n expr[lhs] = stod[rhs];\n }\n\n size_t i=0;\n try {\n Dimension res=parse(s, i, expr);\n printf(\"%s\\n\", dtos.at(res).c_str());\n } catch (std::out_of_range &e) {\n printf(\"undefined\\n\");\n } catch (std::logic_error &e) {\n printf(\"error\\n\");\n }\n\n return 0;\n}\n \nint main() {\n while (!testcase_ends()) {}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3028,
"score_of_the_acc": -1.5628,
"final_rank": 8
},
{
"submission_id": "aoj_1087_3005595",
"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\nstruct Info{\n\tchar name[21];\n\tint table[5];\n};\n\nstruct Data{\n\tchar name[21];\n\tint info_index;\n};\n\nint num_base,num_assembly,num_variable;\nchar formula[101];\nInfo info[10];\nData data[15];\nbool error_FLG;\n\n\nbool is_alpha(char ch){\n\n\tif(ch >= 'a' && ch <= 'z')return true;\n\tif(ch >= 'A' && ch <= 'Z')return true;\n\n\treturn false;\n}\n\n//baseとcompが等しいか比べる関数\nbool strCmp(char* base, char* comp){\n\tint length1,length2;\n\tfor(length1=0;base[length1] != '\\0';length1++);\n\tfor(length2=0;comp[length2] != '\\0';length2++);\n\tif(length1 != length2)return false;\n\n\tfor(int i=0;base[i] != '\\0'; i++){\n\t\tif(base[i] != comp[i])return false;\n\t}\n\treturn true;\n}\n\nvoid strcpy(char* to,char* str){\n\tfor(int i=0;str[i] != '\\0';i++){\n\t\tto[i] = str[i];\n\t\tto[i+1] = '\\0';\n\t}\n}\n\nvector<int> calc_Formula(int,int);\n\nvector<int> calc_string(int left,int right){\n\n\tchar work[21];\n\tint index = 0;\n\n\tfor(int i = left; i <= right; i++){\n\t\twork[index++] = formula[i];\n\t}\n\twork[index] = '\\0';\n\n\tvector<int> ret;\n\n\t//該当する変数があるか調べる\n\tfor(int i = 0; i < num_variable; i++){\n\t\tif(strCmp(work,data[i].name)){\n\t\t\tfor(int k = 0; k < num_base; k++){\n\t\t\t\tret.push_back(info[data[i].info_index].table[k]);\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\t//該当する変数がないならエラー\n\terror_FLG = true;\n\treturn ret;\n}\n\nvector<int> calc_variable(int left,int right){\n\treturn calc_string(left,right);\n}\n\nvector<int> calc_Factor(int left,int right){\n\n\tif(formula[left] == '('){\n\t\treturn calc_Formula(left+1,right-1);\n\t}\n\n\treturn calc_variable(left,right);\n}\n\nvector<int> calc_Term(int left,int right){\n\n\tint depth = 0;\n\tqueue<int> Q;\n\n\t//深さ0の*,/を探す\n\tfor(int i = left; i <= right; i++){\n\n\t\tif(formula[i] == '('){\n\t\t\tdepth++;\n\t\t}else if(formula[i] == ')'){\n\t\t\tdepth--;\n\t\t}else if(depth == 0 && (formula[i] == '*' || formula[i] == '/')){\n\t\t\tQ.push(i);\n\t\t}\n\t}\n\n\tif(Q.size() == 0){\n\t\treturn calc_Factor(left,right);\n\t}\n\n\tvector<int> ret,tmp;\n\n\tret = calc_Term(left,Q.front()-1);\n\tif(error_FLG)return ret;\n\n\n\twhile(!Q.empty()){\n\n\t\tint loc = Q.front();\n\t\tQ.pop();\n\n\t\tif(Q.empty()){\n\t\t\ttmp = calc_Factor(loc+1,right);\n\t\t}else{\n\t\t\ttmp = calc_Factor(loc+1,Q.front()-1);\n\t\t}\n\n\t\tif(error_FLG)return ret;\n\n\t\t//次元の計算を行う(指数の加減算)\n\t\tif(formula[loc] == '*'){\n\n\t\t\tfor(int i = 0; i < num_base; i++){\n\t\t\t\tret[i] += tmp[i];\n\t\t\t}\n\n\t\t}else{ //割り算\n\n\t\t\tfor(int i = 0; i < num_base; i++){\n\n\t\t\t\tret[i] -= tmp[i];\n\t\t\t}\n\t\t}\n\t}\n\n\treturn ret;\n\n}\n\nvector<int> calc_Formula(int left,int right){\n\n\tint depth = 0;\n\tqueue<int> Q;\n\n\t//深さ0の+,-を探す\n\tfor(int i = left; i <= right; ){\n\n\t\tif(formula[i] == '('){\n\t\t\tdepth++;\n\t\t}else if(formula[i] == ')'){\n\t\t\tdepth--;\n\t\t}\n\n\t\tif(depth != 0){\n\t\t\ti++;\n\t\t}else if(formula[i] != '+' && formula[i] != '-'){\n\t\t\ti++;\n\t\t}else{\n\t\t\tif(formula[i] == '+'){\n\t\t\t\tQ.push(i);\n\t\t\t\ti++;\n\t\t\t}else{ //line[i] == '-'\n\t\t\t\tif((i != left) && (is_alpha(formula[i-1]) == true || formula[i-1] == ')')){ //-は、depthが0でもnegの場合あり\n\t\t\t\t\tQ.push(i);\n\t\t\t\t}\n\t\t\t\twhile(i <=right && formula[i] == '-')i++; //negの-が続いている場合があるので、読み飛ばす\n\t\t\t}\n\t\t}\n\n\t}\n\n\tif(Q.size() == 0){\n\t\treturn calc_Term(left,right);\n\t}\n\n\tvector<int> ret,tmp;\n\n\tret = calc_Formula(left,Q.front()-1);\n\tif(error_FLG)return ret;\n\n\n\twhile(!Q.empty()){\n\n\t\tint loc = Q.front();\n\t\tQ.pop();\n\n\t\tif(Q.empty()){\n\t\t\ttmp = calc_Term(loc+1,right);\n\t\t}else{\n\t\t\ttmp = calc_Term(loc+1,Q.front()-1);\n\t\t}\n\n\t\tif(error_FLG)return ret;\n\n\t\t//2つの次元が違うなら終了\n\t\tfor(int i = 0; i < num_base; i++){\n\t\t\tif(ret[i] != tmp[i]){\n\t\t\t\terror_FLG = true;\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t}\n\t\t//★係数は無視するので演算は行わない★\n\t}\n\n\treturn ret;\n}\n\nvoid func(){\n\n\t//組み立て量の取得\n\tfor(int i = 0; i < num_assembly; i++){\n\n\t\tscanf(\"%s\",info[i].name);\n\t\tfor(int k = 0; k < num_base; k++){\n\t\t\tscanf(\"%d\",&info[i].table[k]);\n\t\t}\n\t}\n\n\tint length;\n\n\tscanf(\"%s\",formula);\n\n\tfor(length = 0; formula[length] != '\\0'; length++);\n\n\tchar buf[21];\n\n\tfor(int i = 0; i < num_variable; i++){\n\n\t\tscanf(\"%s %s\",data[i].name,buf);\n\t\tfor(int k = 0; k < num_assembly; k++){ //組み立て量を探す\n\t\t\tif(strCmp(buf,info[k].name)){\n\t\t\t\tdata[i].info_index = k;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\terror_FLG = false;\n\n\tvector<int> ret = calc_Formula(0,length-1);\n\n\tif(error_FLG){\n\t\tprintf(\"error\\n\");\n\t\treturn;\n\t}\n\n\tbool FLG;\n\t//該当する次元があるか探す\n\tfor(int i = num_assembly-1; i >= 0; i--){\n\t\tFLG = true;\n\t\tfor(int k = 0; k < num_base; k++){\n\t\t\tif(ret[k] != info[i].table[k]){\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(FLG){\n\t\t\tprintf(\"%s\\n\",info[i].name);\n\t\t\treturn;\n\t\t}\n\t}\n\n\tprintf(\"undefined\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d %d %d\",&num_base,&num_assembly,&num_variable);\n\t\tif(num_base == 0 && num_assembly == 0 && num_variable == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3244,
"score_of_the_acc": -1.6335,
"final_rank": 10
},
{
"submission_id": "aoj_1087_2025426",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nmap<string,vector<int> > sv;\nmap<vector<int>,string > vs;\nmap<string,string> ss;\nvector<int> dfs();\nint n,m,inp,d,p,f;\nstring s,t,t2;\nbool ans;\n\nvector<int> get(){\n vector<int> res(n);\n res[0]=(1e9);\n if(s[p]=='(')p++,res=dfs(),p++;\n else{\n string str;\n while(('a'<=s[p]&&s[p]<='z')||('A'<=s[p]&&s[p]<='Z'))str+=s[p++];\n res=sv[ss[str]];\n }\n return res;\n}\n\nvector<int> cal(){\n vector<int> res=get(),r;\n while(s[p]!=')'){\n if(s[p]=='*'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]+=r[i];\n }\n else if(s[p]=='/'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]-=r[i];\n }else break;\n }\n return res;\n}\n\nvector<int> dfs(){\n vector<int> res=cal(),r(n);\n r[0]=(1e9);\n while(p<s.size()&&s[p]!=')'){\n if(s[p]=='+'||s[p]=='-')p++;\n else r=cal();\n if(r[0]!=(1e9)&&res!=r)ans=false;\n }\n return res;\n}\n\nint main(){\n while(1){\n cin>>n>>m>>inp;\n if(!n&&!m&&!inp)break;\n for(int i=0;i<m;i++){\n cin>>t;\n for(int j=0;j<n;j++){\n\tcin>>d;\n\tsv[t].push_back(d);\n }\n vs[sv[t]]=t;\n }\n cin>>s;\n for(int i=0;i<inp;i++){\n cin>>t>>t2;\n ss[t]=t2;\n }\n s='('+s+')'; p=0;\n ans=true;\n vector<int> r=dfs();\n if(!ans)cout<<\"error\"<<endl;\n else if(vs.count(r))cout<<vs[r]<<endl;\n else cout<<\"undefined\"<<endl;\n sv.clear();\n vs.clear();\n ss.clear();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3160,
"score_of_the_acc": -0.606,
"final_rank": 1
},
{
"submission_id": "aoj_1087_2025424",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nmap<string,vector<int> > sv;\nmap<vector<int>,string > vs;\nmap<string,string> ss;\nvector<int> dfs();\nint n,m,inp,d,p,f;\nstring s,t,t2;\nbool ans;\n\nvector<int> get(){\n vector<int> res(n);\n res[0]=(1e9);\n if(s[p]=='(')p++,res=dfs(),p++;\n else{\n string str;\n while(('a'<=s[p]&&s[p]<='z')||('A'<=s[p]&&s[p]<='Z'))str+=s[p++];\n res=sv[ss[str]];\n }\n return res;\n}\n\nvector<int> cal(){\n vector<int> res=get(),r;\n while(s[p]!=')'){\n if(s[p]=='*'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]+=r[i];\n }\n else if(s[p]=='/'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]-=r[i];\n }else break;\n }\n return res;\n}\n\nvector<int> dfs(){\n vector<int> res=cal(),r(n);\n r[0]=(1e9);\n while(p<s.size()&&s[p]!=')'){\n if(s[p]=='('){\n p++;\n r=dfs();\n p++;\n }\n else if(s[p]=='+'||s[p]=='-')p++;\n else r=cal();\n if(r[0]!=(1e9)&&res!=r)ans=false;\n }\n return res;\n}\n\nint main(){\n while(1){\n cin>>n>>m>>inp;\n if(!n&&!m&&!inp)break;\n for(int i=0;i<m;i++){\n cin>>t;\n for(int j=0;j<n;j++){\n\tcin>>d;\n\tsv[t].push_back(d);\n }\n vs[sv[t]]=t;\n }\n cin>>s;\n for(int i=0;i<inp;i++){\n cin>>t>>t2;\n ss[t]=t2;\n }\n s='('+s+')'; p=0;\n ans=true;\n vector<int> r=dfs();\n if(!ans)cout<<\"error\"<<endl;\n else if(vs.count(r))cout<<vs[r]<<endl;\n else cout<<\"undefined\"<<endl;\n sv.clear();\n vs.clear();\n ss.clear();\n }\n return 0;\n}",
"accuracy": 0.5714285714285714,
"time_ms": 10,
"memory_kb": 3188,
"score_of_the_acc": -0.6152,
"final_rank": 12
},
{
"submission_id": "aoj_1087_2025422",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nmap<string,vector<int> > sv;\nmap<vector<int>,string > vs;\nmap<string,string> ss;\nvector<int> dfs();\nint n,m,inp,d,p,f;\nstring s,t,t2;\nbool ans;\n\nvector<int> get(){\n vector<int> res(n);\n res[0]=(1e9);\n if(s[p]=='(')p++,res=dfs(),p++;\n else{\n string str;\n while(('a'<=s[p]&&s[p]<='z')||('A'<=s[p]&&s[p]<='Z'))str+=s[p++];\n res=sv[ss[str]];\n }\n return res;\n}\n\nvector<int> cal(){\n vector<int> res=get(),r;\n while(s[p]!=')'){\n if(s[p]=='*'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]+=r[i];\n }\n else if(s[p]=='/'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]-=r[i];\n }else break;\n }\n return res;\n}\n\nvector<int> dfs(){\n vector<int> res=cal(),r(n);\n r[0]=(1e9);\n while(p<s.size()&&s[p]!=')'){\n if(s[p]=='('){\n p++;\n r=dfs();\n p++;\n }\n else if(s[p]=='+'||s[p]=='-')p++;\n else r=cal();\n if(res[0]!=(1e9)&&r[0]!=(1e9)&&res!=r)ans=false;\n //if(r[0]!=(1e9))res=r;\n }\n return res;\n}\n\nint main(){\n while(1){\n cin>>n>>m>>inp;\n if(!n&&!m&&!inp)break;\n for(int i=0;i<m;i++){\n cin>>t;\n for(int j=0;j<n;j++){\n\tcin>>d;\n\tsv[t].push_back(d);\n }\n vs[sv[t]]=t;\n }\n cin>>s;\n for(int i=0;i<inp;i++){\n cin>>t>>t2;\n ss[t]=t2;\n }\n s='('+s+')'; p=0;\n ans=true;\n vector<int> r=dfs();\n if(!ans)cout<<\"error\"<<endl;\n else if(vs.count(r))cout<<vs[r]<<endl;\n else cout<<\"undefined\"<<endl;\n sv.clear();\n vs.clear();\n ss.clear();\n }\n return 0;\n}",
"accuracy": 0.5714285714285714,
"time_ms": 20,
"memory_kb": 3232,
"score_of_the_acc": -1.6296,
"final_rank": 20
},
{
"submission_id": "aoj_1087_2025394",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nmap<string,vector<int> > sv;\nmap<vector<int>,string > vs;\nmap<string,string> ss;\nvector<int> dfs();\nint n,m,inp,d,p,f;\nstring s,t,t2;\nbool ans;\n\nvector<int> get(){\n vector<int> res(n);\n res[0]=(1e9);\n if(s[p]=='(')p++,res=dfs(),p++;\n else{\n string str;\n while(('a'<=s[p]&&s[p]<='z')||('A'<=s[p]&&s[p]<='Z'))str+=s[p++];\n res=sv[ss[str]];\n }\n return res;\n}\n\nvector<int> cal(){\n vector<int> res=get(),r;\n while(s[p]!=')'){\n if(s[p]=='*'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]+=r[i];\n }\n else if(s[p]=='/'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]-=r[i];\n }else break;\n }\n return res;\n}\n\nvector<int> dfs(){\n vector<int> res=cal(),r(n);\n r[0]=(1e9);\n while(p<s.size()&&s[p]!=')'){\n if(s[p]=='('){\n p++;\n r=dfs();\n p++;\n }\n else if(s[p]=='+'||s[p]=='-')p++;\n else r=cal();\n if(res[0]!=(1e9)&&r[0]!=(1e9)&&res!=r)ans=false;\n if(r[0]!=(1e9))res=r;\n }\n return res;\n}\n\nint main(){\n while(1){\n cin>>n>>m>>inp;\n if(!n&&!m&&!inp)break;\n for(int i=0;i<m;i++){\n cin>>t;\n for(int j=0;j<n;j++){\n\tcin>>d;\n\tsv[t].push_back(d);\n }\n vs[sv[t]]=t;\n }\n cin>>s;\n for(int i=0;i<inp;i++){\n cin>>t>>t2;\n ss[t]=t2;\n }\n s='('+s+')'; p=0;\n ans=true;\n vector<int> r=dfs();\n if(!ans)cout<<\"error\"<<endl;\n else if(vs.count(r))cout<<vs[r]<<endl;\n else cout<<\"undefined\"<<endl;\n sv.clear();\n vs.clear();\n ss.clear();\n }\n return 0;\n}",
"accuracy": 0.5714285714285714,
"time_ms": 10,
"memory_kb": 3204,
"score_of_the_acc": -0.6204,
"final_rank": 13
},
{
"submission_id": "aoj_1087_2024977",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nmap<string,vector<int> > sv;\nmap<vector<int>,string > vs;\nmap<string,string> ss;\nvector<int> dfs();\nint n,m,inp,d,p,f;\nstring s,t,t2;\nbool ans;\n\nvector<int> get(){\n vector<int> res(n);\n res[0]=(1e9);\n if(p>=s.size())return res;\n if(s[p]=='(')p++,res=dfs();\n else{\n string str;\n while(('a'<=s[p]&&s[p]<='z')||('A'<=s[p]&&s[p]<='Z'))str+=s[p++];\n res=sv[ss[str]];\n }\n return res;\n}\n\nvector<int> cal(){\n vector<int> res=get(),r;\n while(p<s.size()&&s[p]!=')'){\n if(s[p]=='*'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]+=r[i];\n }\n else if(s[p]=='/'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]-=r[i];\n }else break;\n }\n return res;\n}\n\nvector<int> dfs(){\n vector<int> res=cal(),r(n);\n r[0]=(1e9);\n while(p<s.size()&&s[p]!=')'){\n if(s[p]=='('){\n p++;\n r=dfs();\n p++;\n }\n else if(s[p]=='+'||s[p]=='-')p++;\n else r=cal();\n if(res[0]!=(1e9)&&r[0]!=(1e9)&&res!=r)ans=false;\n if(r[0]!=(1e9))res=r;\n }\n return res;\n}\n\nint main(){\n while(1){\n cin>>n>>m>>inp;\n if(!n&&!m&&!inp)break;\n for(int i=0;i<m;i++){\n cin>>t;\n for(int j=0;j<n;j++){\n\tcin>>d;\n\tsv[t].push_back(d);\n }\n vs[sv[t]]=t;\n }\n cin>>s;\n for(int i=0;i<inp;i++){\n cin>>t>>t2;\n ss[t]=t2;\n }\n s='('+s+')'; p=0;\n ans=true;\n vector<int> r=dfs();\n if(!ans)cout<<\"error\"<<endl;\n else if(vs.count(r))cout<<vs[r]<<endl;\n else cout<<\"undefined\"<<endl;\n sv.clear();\n vs.clear();\n ss.clear();\n }\n return 0;\n}",
"accuracy": 0.5714285714285714,
"time_ms": 10,
"memory_kb": 3228,
"score_of_the_acc": -0.6283,
"final_rank": 15
},
{
"submission_id": "aoj_1087_2024974",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nmap<string,vector<int> > sv;\nmap<vector<int>,string > vs;\nmap<string,string> ss;\nvector<int> dfs();\nint n,m,inp,d,p,f;\nstring s,t,t2;\nbool ans;\n\nvector<int> get(){\n vector<int> res(n);\n res[0]=(1e9);\n if(s[p]=='(')p++,res=dfs();\n else{\n string str;\n while(('a'<=s[p]&&s[p]<='z')||('A'<=s[p]&&s[p]<='Z'))str+=s[p++];\n res=sv[ss[str]];\n }\n return res;\n}\n\nvector<int> cal(){\n vector<int> res=get(),r;\n while(s[p]!=')'){\n if(s[p]=='*'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]+=r[i];\n }\n else if(s[p]=='/'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]-=r[i];\n }else break;\n }\n return res;\n}\n\nvector<int> dfs(){\n vector<int> res=cal(),r(n);\n r[0]=(1e9);\n while(p<s.size()&&s[p]!=')'){\n if(s[p]=='('){\n p++;\n r=dfs();\n p++;\n }\n else if(s[p]=='+'||s[p]=='-')p++;\n else r=cal();\n if(res[0]!=(1e9)&&r[0]!=(1e9)&&res!=r)ans=false;\n if(r[0]!=(1e9))res=r;\n }\n return res;\n}\n\nint main(){\n while(1){\n cin>>n>>m>>inp;\n if(!n&&!m&&!inp)break;\n for(int i=0;i<m;i++){\n cin>>t;\n for(int j=0;j<n;j++){\n\tcin>>d;\n\tsv[t].push_back(d);\n }\n vs[sv[t]]=t;\n }\n cin>>s;\n for(int i=0;i<inp;i++){\n cin>>t>>t2;\n ss[t]=t2;\n }\n s='('+s+')'; p=0;\n ans=true;\n vector<int> r=dfs();\n if(!ans)cout<<\"error\"<<endl;\n else if(vs.count(r))cout<<vs[r]<<endl;\n else cout<<\"undefined\"<<endl;\n sv.clear();\n vs.clear();\n ss.clear();\n }\n return 0;\n}",
"accuracy": 0.5714285714285714,
"time_ms": 10,
"memory_kb": 3252,
"score_of_the_acc": -0.6361,
"final_rank": 18
},
{
"submission_id": "aoj_1087_2024562",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nmap<string,vector<int> > sv;\nmap<vector<int>,string > vs;\nmap<string,string> ss;\nvector<int> dfs();\nint n,m,inp,d,p,f;\nstring s,t,t2;\nbool ans;\n\nvector<int> get(){\n vector<int> res(n);\n res[0]=(1e9);\n if(s[p]=='(')p++,res=dfs(),p++;\n else{\n string str;\n while(('a'<=s[p]&&s[p]<='z')||('A'<=s[p]&&s[p]<='Z'))str+=s[p++];\n res=sv[ss[str]];\n }\n return res;\n}\n\nvector<int> cal(){\n vector<int> res=get(),r;\n while(p<s.size()&&s[p]!=')'){\n if(s[p]=='*'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]+=r[i];\n }\n else if(s[p]=='/'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]-=r[i];\n }else break;\n }\n return res;\n}\n\nvector<int> dfs(){\n vector<int> res=cal(),r(n);\n r[0]=(1e9);\n while(p<s.size()&&s[p]!=')'){\n if(s[p]=='('){\n p++;\n r=dfs();\n p++;\n }\n else if(s[p]=='+'||s[p]=='-')p++;\n else r=cal();\n if(res[0]!=(1e9)&&r[0]!=(1e9)&&res!=r)ans=false;\n if(r[0]!=(1e9))res=r;\n }\n return res;\n}\n\nint main(){\n while(1){\n cin>>n>>m>>inp;\n if(!n&&!m&&!inp)break;\n for(int i=0;i<m;i++){\n cin>>t;\n for(int j=0;j<n;j++){\n\tcin>>d;\n\tsv[t].push_back(d);\n }\n vs[sv[t]]=t;\n }\n cin>>s;\n for(int i=0;i<inp;i++){\n cin>>t>>t2;\n ss[t]=t2;\n }\n s='('+s+\"))\"; p=0;\n ans=true;\n vector<int> r=dfs();\n if(!ans)cout<<\"error\"<<endl;\n else if(vs.count(r))cout<<vs[r]<<endl;\n else cout<<\"undefined\"<<endl;\n sv.clear();\n vs.clear();\n ss.clear();\n }\n return 0;\n}",
"accuracy": 0.5714285714285714,
"time_ms": 10,
"memory_kb": 3076,
"score_of_the_acc": -0.5785,
"final_rank": 11
},
{
"submission_id": "aoj_1087_2024561",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nmap<string,vector<int> > sv;\nmap<vector<int>,string > vs;\nmap<string,string> ss;\nvector<int> dfs();\nint n,m,inp,d,p,f;\nstring s,t,t2;\nbool ans;\n\nvector<int> get(){\n vector<int> res(n);\n res[0]=(1e9);\n if(s[p]=='(')p++,res=dfs(),p++;\n else{\n string str;\n while(('a'<=s[p]&&s[p]<='z')||('A'<=s[p]&&s[p]<='Z'))str+=s[p++];\n res=sv[ss[str]];\n }\n return res;\n}\n\nvector<int> cal(){\n vector<int> res=get(),r;\n while(p<s.size()&&s[p]!=')'){\n if(s[p]=='*'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]+=r[i];\n }\n else if(s[p]=='/'){\n p++;\n r=get();\n for(int i=0;i<n;i++)res[i]-=r[i];\n }else break;\n }\n return res;\n}\n\nvector<int> dfs(){\n vector<int> res=cal(),r(n);\n r[0]=(1e9);\n while(p<s.size()&&s[p]!=')'){\n if(s[p]=='('){\n p++;\n r=dfs();\n p++;\n }\n else if(s[p]=='+'||s[p]=='-')p++;\n else r=cal();\n if(res[0]!=(1e9)&&r[0]!=(1e9)&&res!=r)ans=false;\n if(r[0]!=(1e9))res=r;\n }\n return res;\n}\n\nint main(){\n while(1){\n cin>>n>>m>>inp;\n if(!n&&!m&&!inp)break;\n for(int i=0;i<m;i++){\n cin>>t;\n for(int j=0;j<n;j++){\n\tcin>>d;\n\tsv[t].push_back(d);\n }\n vs[sv[t]]=t;\n }\n cin>>s;\n for(int i=0;i<inp;i++){\n cin>>t>>t2;\n ss[t]=t2;\n }\n s='('+s+')'; p=0;\n ans=true;\n vector<int> r=dfs();\n if(!ans)cout<<\"error\"<<endl;\n else if(vs.count(r))cout<<vs[r]<<endl;\n else cout<<\"undefined\"<<endl;\n sv.clear();\n vs.clear();\n ss.clear();\n }\n return 0;\n}",
"accuracy": 0.5714285714285714,
"time_ms": 10,
"memory_kb": 3228,
"score_of_the_acc": -0.6283,
"final_rank": 15
},
{
"submission_id": "aoj_1087_2021259",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint N,M,P;\ntypedef vector<int> vec;\nint cnt = 0;\nchar S[200];\nmap<string,vec> mp;\nmap<string,string> mmp;\nmap<vec,string> vp;\nvoid init(){\n cnt = 0;\n mp.clear(); mmp.clear(); vp.clear();\n}\n \nbool asset(char c){\n if( S[cnt] == c ) {\n cnt++; return true;\n }\n return false;\n}\n \nvec variable();\nvec factor();\nvec term();\nvec formula();\nvec operator*( const vec& a, const vec& b ) {\n if( a.empty() || b.empty() ) return vec();\n vec x = vec( N );\n for(int i=0;i<N;i++) x[i] = a[i] + b[i];\n return x;\n}\nvec operator/(const vec& a, const vec& b) {\n if( a.empty() || b.empty() ) return vec();\n vec x = vec( N );\n for(int i=0;i<N;i++) x[i] = a[i] - b[i];\n return x;\n}\nbool check( const vec &a, const vec &b ){\n if( a.empty() || b.empty() ) return false;\n for(int i=0;i<N;i++)\n if( a[i] != b[i] ) return false;\n return true;\n}\nvec variable(){\n string s = \"\";\n while( ( 'a' <= S[cnt] && S[cnt] <= 'z' ) ||\n ( 'A' <= S[cnt] && S[cnt] <= 'Z' ) ){\n s += S[cnt];\n asset( S[cnt] );\n }\n return mp[ mmp[s] ]; \n}\nvec factor(){\n if( asset( '(' ) ){\n vec v = formula();\n asset(')');\n return v;\n } else\n return variable();\n}\nvec term(){\n vec v = factor();\n while( true ){\n if( asset( '*' ) ){\n vec nv = factor();\n v = v * nv;\n } else if( asset( '/' ) ){\n vec nv = factor();\n v = v / nv;\n } else\n break;\n }\n return v;\n}\nvec formula(){\n vec v = term();\n while( true ){\n if( asset( '+' ) ) {}\n else if( asset( '-' ) ){}\n else break;\n vec nv = term();\n if( !check( v, nv ) ) return vec();\n }\n return v;\n}\n \nint main(){\n while( cin >> N >> M >> P && (N|M|P) ){\n init();\n for(int i=0;i<M;i++){\n string a;\n cin >> a;\n vec v = vec( N );\n for(int j=0;j<N;j++){\n int d; cin >> d;\n v[j] = d;\n }\n mp[a] = v;\n vp[v] = a;\n }\n cin >> S;\n for(int i=0;i<P;i++){\n string a,b; cin >> a >> b;\n mmp[a] = b;\n }\n vec v = formula();\n \n \n if( v.empty() ){\n cout << \"error\" << endl;\n } else if( vp.count( v ) ){\n cout << vp[v] << endl;\n } else {\n cout << \"undefined\" << endl;\n }\n } \n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3180,
"score_of_the_acc": -1.6126,
"final_rank": 9
},
{
"submission_id": "aoj_1087_2020765",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint N,M,P;\ntypedef vector<int> vec;\nint cnt = 0;\nchar S[200];\nmap<string,vec> mp;\nmap<string,string> mmp;\nmap<vec,string> vp;\nvoid init(){\n cnt = 0;\n mp.clear(); mmp.clear(); vp.clear();\n}\n\nbool asset(char c){\n if( S[cnt] == c ) {\n cnt++; return true;\n }\n return false;\n}\n\nvec variable();\nvec factor();\nvec term();\nvec formula();\nvec operator*( const vec& a, const vec& b ) {\n if( a.empty() || b.empty() ) return vec();\n vec x = vec( N );\n for(int i=0;i<N;i++) x[i] = a[i] + b[i];\n return x;\n}\nvec operator/(const vec& a, const vec& b) {\n if( a.empty() || b.empty() ) return vec();\n vec x = vec( N );\n for(int i=0;i<N;i++) x[i] = a[i] - b[i];\n return x;\n}\nbool check( const vec &a, const vec &b ){\n if( a.empty() || b.empty() ) return false;\n for(int i=0;i<N;i++)\n if( a[i] != b[i] ) return false;\n return true;\n}\nvec variable(){\n string s = \"\";\n while( ( 'a' <= S[cnt] && S[cnt] <= 'z' ) ||\n ( 'A' <= S[cnt] && S[cnt] <= 'Z' ) ){\n s += S[cnt];\n asset( S[cnt] );\n }\n return mp[ mmp[s] ]; \n}\nvec factor(){\n if( asset( '(' ) ){\n vec v = formula();\n asset(')');\n return v;\n } else\n return variable();\n}\nvec term(){\n vec v = factor();\n while( true ){\n if( asset( '*' ) ){\n vec nv = factor();\n v = v * nv;\n } else if( asset( '/' ) ){\n vec nv = factor();\n v = v / nv;\n } else\n break;\n }\n return v;\n}\nvec formula(){\n vec v = term();\n while( true ){\n if( asset( '+' ) ) {}\n else if( asset( '-' ) ){}\n else break;\n vec nv = term();\n if( !check( v, nv ) ) return vec();\n }\n return v;\n}\n\nint main(){\n while( cin >> N >> M >> P && (N|M|P) ){\n init();\n for(int i=0;i<M;i++){\n string a;\n cin >> a;\n vec v = vec( N );\n for(int j=0;j<N;j++){\n int d; cin >> d;\n v[j] = d;\n }\n mp[a] = v;\n vp[v] = a;\n }\n cin >> S;\n for(int i=0;i<P;i++){\n string a,b; cin >> a >> b;\n mmp[a] = b;\n }\n vec v = formula();\n\n\n if( v.empty() ){\n cout << \"error\" << endl;\n } else if( vp.count( v ) ){\n cout << vp[v] << endl;\n } else {\n cout << \"undefined\" << endl;\n }\n } \n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3180,
"score_of_the_acc": -0.6126,
"final_rank": 2
},
{
"submission_id": "aoj_1087_1935828",
"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\" > \"D:\\D_Download\\Visual Studio 2015\\Projects\\programing_contest_c++\\Debug\\b.txt\"\n\nstring ast;\nmap<string, vector<int>>avars;\nint a;\nvector<int>getform();\nvector<int>getst() {\n\tstring name;\n\twhile( ('a' <= ast[a] && 'z' >= ast[a]) || ('A' <= ast[a] && 'Z' >= ast[a])){\n\t\tname.push_back(ast[a]);\n\t\ta++;\n\t}\n\tif (avars.find(name) == avars.end()) {\n\t\tassert(false);\n\t}\n\telse {\n\t\treturn avars[name];\n\t}\n}\nvector<int>getfact() {\n\tif (ast[a] == '(') {\n\t\ta++;\n\t\tvector<int>v = getform();\n\t\tassert(ast[a] == ')');\n\t\ta++;\n\t\treturn v;\n\t}\n\telse {\n\t\treturn getst();\n\t}\n}\nvector<int>getterm() {\n\tauto v = getfact();\n\twhile (a != ast.size()&&ast[a]!=')') {\n\t\tif (ast[a] == '*') {\n\t\t\ta++;\n\t\t\tauto nv = getfact();\n\t\t\tassert(v.size() == nv.size());\n\t\t\tfor (int i = 0; i < v.size(); ++i) {\n\t\t\t\tv[i] += nv[i];\n\t\t\t}\n\t\t}\n\t\telse if (ast[a] == '/') {\n\t\t\ta++;\n\t\t\tauto nv = getfact();\n\t\t\tassert(v.size() == nv.size());\n\t\t\tfor (int i = 0; i < v.size(); ++i) {\n\t\t\t\tv[i] -= nv[i];\n\t\t\t}\n\t\t}\n\t\telse if (ast[a] =='+'||ast[a]=='-'){\n\t\t\tbreak;\n\t\t}\n\t\telse {\n\t\t\tassert(false);\n\t\t}\n\t}\n\treturn v;\n}\nvector<int>getform() {\n\tauto v = getterm();\n\twhile (a!=ast.size() && ast[a] != ')') {\n\t\tif (ast[a] == '+'||ast[a]=='-') {\n\t\t\ta++;\n\t\t\tauto nv = getterm();\n\t\t\tif (v == nv) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tthrow(false);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tassert(false);\n\t\t}\n\t}\n\treturn v;\n}\n\nvector<int>getans(const string st,const map<string,vector<int>>&vars) {\n\tast = st;\n\tavars = vars;\n\ta = 0;\n\treturn getform();\n}\n\nint main() {\n\twhile (1) {\n\t\tint N, M, P; cin >> N >> M >> P;\n\t\tif (!N)break;\n\t\tmap<string,vector<int>>dim;\n\t\tmap<vector<int>, string>revdim;\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tstring name; cin >> name;\n\t\t\tvector<int>dims(N);\n\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\tcin >> dims[j];\n\t\t\t}\n\t\t\tdim[name] = dims;\n\t\t\trevdim[dims] = name;\n\t\t}\n\t\tstring st; cin >> st;\n\t\tmap<string,vector<int>>vars;\n\t\tfor (int i = 0; i < P; ++i) {\n\t\t\tstring v; string n; cin >> v >> n;\n\t\t\tvars[v] = dim[n];\n\t\t}\n\t\ttry {\n\t\t\tvector<int>ans = getans(st, vars);\n\t\t\tif (revdim.find(ans) == revdim.end()) {\n\t\t\t\tcout << \"undefined\" << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << revdim[ans] << endl;\n\t\t\t}\n\t\t}\n\t\tcatch (...) {\n\t\t\tcout << \"error\" << endl;\n\t\t}\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3208,
"score_of_the_acc": -0.6217,
"final_rank": 5
},
{
"submission_id": "aoj_1087_1935827",
"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\" > \"D:\\D_Download\\Visual Studio 2015\\Projects\\programing_contest_c++\\Debug\\b.txt\"\n\nstring ast;\nmap<string, vector<int>>avars;\nint a;\nvector<int>getform();\nvector<int>getst() {\n\tstring name;\n\twhile( ('a' <= ast[a] && 'z' >= ast[a]) || ('A' <= ast[a] && 'Z' >= ast[a])){\n\t\tname.push_back(ast[a]);\n\t\ta++;\n\t}\n\tif (avars.find(name) == avars.end()) {\n\t\tassert(false);\n\t}\n\telse {\n\t\treturn avars[name];\n\t}\n}\nvector<int>getfact() {\n\tif (ast[a] == '(') {\n\t\ta++;\n\t\tvector<int>v = getform();\n\t\tassert(ast[a] == ')');\n\t\ta++;\n\t\treturn v;\n\t}\n\telse {\n\t\treturn getst();\n\t}\n}\nvector<int>getterm() {\n\tauto v = getfact();\n\twhile (a != ast.size()&&ast[a]!=')') {\n\t\tif (ast[a] == '*' || ast[a] == '-') {\n\t\t\ta++;\n\t\t\tauto nv = getfact();\n\t\t\tassert(v.size() == nv.size());\n\t\t\tfor (int i = 0; i < v.size(); ++i) {\n\t\t\t\tv[i] += nv[i];\n\t\t\t}\n\t\t}\n\t\telse if (ast[a] == '/') {\n\t\t\ta++;\n\t\t\tauto nv = getfact();\n\t\t\tassert(v.size() == nv.size());\n\t\t\tfor (int i = 0; i < v.size(); ++i) {\n\t\t\t\tv[i] -= nv[i];\n\t\t\t}\n\t\t}\n\t\telse if (ast[a] =='+'||ast[a]=='-'){\n\t\t\tbreak;\n\t\t}\n\t\telse {\n\t\t\tassert(false);\n\t\t}\n\t}\n\treturn v;\n}\nvector<int>getform() {\n\tauto v = getterm();\n\twhile (a!=ast.size() && ast[a] != ')') {\n\t\tif (ast[a] == '+'||ast[a]=='-') {\n\t\t\ta++;\n\t\t\tauto nv = getterm();\n\t\t\tif (v == nv) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tthrow(false);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tassert(false);\n\t\t}\n\t}\n\treturn v;\n}\n\nvector<int>getans(const string st,const map<string,vector<int>>&vars) {\n\tast = st;\n\tavars = vars;\n\ta = 0;\n\treturn getform();\n}\n\nint main() {\n\twhile (1) {\n\t\tint N, M, P; cin >> N >> M >> P;\n\t\tif (!N)break;\n\t\tmap<string,vector<int>>dim;\n\t\tmap<vector<int>, string>revdim;\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tstring name; cin >> name;\n\t\t\tvector<int>dims(N);\n\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\tcin >> dims[j];\n\t\t\t}\n\t\t\tdim[name] = dims;\n\t\t\trevdim[dims] = name;\n\t\t}\n\t\tstring st; cin >> st;\n\t\tmap<string,vector<int>>vars;\n\t\tfor (int i = 0; i < P; ++i) {\n\t\t\tstring v; string n; cin >> v >> n;\n\t\t\tvars[v] = dim[n];\n\t\t}\n\t\ttry {\n\t\t\tvector<int>ans = getans(st, vars);\n\t\t\tif (revdim.find(ans) == revdim.end()) {\n\t\t\t\tcout << \"undefined\" << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << revdim[ans] << endl;\n\t\t\t}\n\t\t}\n\t\tcatch (...) {\n\t\t\tcout << \"error\" << endl;\n\t\t}\n\n\t}\n\treturn 0;\n}",
"accuracy": 0.5714285714285714,
"time_ms": 10,
"memory_kb": 3244,
"score_of_the_acc": -0.6335,
"final_rank": 17
},
{
"submission_id": "aoj_1087_1935826",
"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\" > \"D:\\D_Download\\Visual Studio 2015\\Projects\\programing_contest_c++\\Debug\\b.txt\"\n\nstring ast;\nmap<string, vector<int>>avars;\nint a;\nvector<int>getform();\nvector<int>getst() {\n\tstring name;\n\twhile( ('a' <= ast[a] && 'z' >= ast[a]) || ('A' <= ast[a] && 'Z' >= ast[a])){\n\t\tname.push_back(ast[a]);\n\t\ta++;\n\t}\n\tif (avars.find(name) == avars.end()) {\n\t\tassert(false);\n\t}\n\telse {\n\t\treturn avars[name];\n\t}\n}\nvector<int>getfact() {\n\tif (ast[a] == '(') {\n\t\ta++;\n\t\tvector<int>v = getform();\n\t\ta++;\n\t\treturn v;\n\t}\n\telse {\n\t\treturn getst();\n\t}\n}\nvector<int>getterm() {\n\tauto v = getfact();\n\twhile (a != ast.size()&&ast[a]!=')') {\n\t\tif (ast[a] == '*' || ast[a] == '-') {\n\t\t\ta++;\n\t\t\tauto nv = getfact();\n\t\t\tfor (int i = 0; i < v.size(); ++i) {\n\t\t\t\tv[i] += nv[i];\n\t\t\t}\n\t\t}\n\t\telse if (ast[a] == '/') {\n\t\t\ta++;\n\t\t\tauto nv = getfact();\n\t\t\tfor (int i = 0; i < v.size(); ++i) {\n\t\t\t\tv[i] -= nv[i];\n\t\t\t}\n\t\t}\n\t\telse if (ast[a] =='+'||ast[a]=='-'){\n\t\t\tbreak;\n\t\t}\n\t\telse {\n\t\t\tassert(false);\n\t\t}\n\t}\n\treturn v;\n}\nvector<int>getform() {\n\tauto v = getterm();\n\twhile (a!=ast.size() && ast[a] != ')') {\n\t\tif (ast[a] == '+'||ast[a]=='-') {\n\t\t\ta++;\n\t\t\tauto nv = getterm();\n\t\t\tif (v == nv) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tthrow(false);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tassert(false);\n\t\t}\n\t}\n\treturn v;\n}\n\nvector<int>getans(const string st,const map<string,vector<int>>&vars) {\n\tast = st;\n\tavars = vars;\n\ta = 0;\n\treturn getform();\n}\n\nint main() {\n\twhile (1) {\n\t\tint N, M, P; cin >> N >> M >> P;\n\t\tif (!N)break;\n\t\tmap<string,vector<int>>dim;\n\t\tmap<vector<int>, string>revdim;\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tstring name; cin >> name;\n\t\t\tvector<int>dims(N);\n\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\tcin >> dims[j];\n\t\t\t}\n\t\t\tdim[name] = dims;\n\t\t\trevdim[dims] = name;\n\t\t}\n\t\tstring st; cin >> st;\n\t\tmap<string,vector<int>>vars;\n\t\tfor (int i = 0; i < P; ++i) {\n\t\t\tstring v; string n; cin >> v >> n;\n\t\t\tvars[v] = dim[n];\n\t\t}\n\t\ttry {\n\t\t\tvector<int>ans = getans(st, vars);\n\t\t\tif (revdim.find(ans) == revdim.end()) {\n\t\t\t\tcout << \"undefined\" << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << revdim[ans] << endl;\n\t\t\t}\n\t\t}\n\t\tcatch (...) {\n\t\t\tcout << \"error\" << endl;\n\t\t}\n\n\t}\n\treturn 0;\n}",
"accuracy": 0.5714285714285714,
"time_ms": 10,
"memory_kb": 3216,
"score_of_the_acc": -0.6243,
"final_rank": 14
},
{
"submission_id": "aoj_1087_1156118",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\ntuple<vi,int> expr(const string& s,int i,const map<string,vi>& utod,const map<string,string>& vtou);\n\t\ntuple<vi,int> fact(const string& s,int i,const map<string,vi>& utod,const map<string,string>& vtou)\n{\n\tif(s[i]=='('){\n\t\tvi ds; tie(ds,i)=expr(s,i+1,utod,vtou);\n\t\treturn mt(ds,i+1);\n\t}\n\telse{\n\t\tstring var;\n\t\tfor(;i<s.size() && isalpha(s[i]);i++)\n\t\t\tvar+=s[i];\n\t\treturn mt(utod.at(vtou.at(var)),i);\n\t}\n}\ntuple<vi,int> term(const string& s,int i,const map<string,vi>& utod,const map<string,string>& vtou)\n{\n\tvi ds; tie(ds,i)=fact(s,i,utod,vtou);\n\twhile(i<s.size() && (s[i]=='*' || s[i]=='/')){\n\t\t//dump(mt(__func__,i,s[i]));\n\t\tassert(s[i]=='*' || s[i]=='/');\n\t\tchar op=s[i];\n\t\tvi ds2; tie(ds2,i)=fact(s,i+1,utod,vtou);\n\t\tif(op=='*')\n\t\t\trep(j,ds.size()) ds[j]+=ds2[j];\n\t\telse\n\t\t\trep(j,ds.size()) ds[j]-=ds2[j];\n\t}\n\treturn mt(ds,i);\n}\ntuple<vi,int> expr(const string& s,int i,const map<string,vi>& utod,const map<string,string>& vtou)\n{\n\tvi ds; tie(ds,i)=term(s,i,utod,vtou);\n\twhile(i<s.size() && s[i]!=')'){\n\t\t//dump(mt(__func__,i,s[i]));\n\t\tassert(s[i]=='+' || s[i]=='-');\n\t\tvi ds2; tie(ds2,i)=term(s,i+1,utod,vtou);\n\t\tif(ds!=ds2) throw \"error\";\n\t}\n\treturn mt(ds,i);\n}\n\nint main()\n{\n\tfor(int n,m,p;cin>>n>>m>>p && n|m|p;){\n\t\tmap<string,vi> utod; // unit -> dimension\n\t\trep(i,m){\n\t\t\tstring unit; cin>>unit;\n\t\t\tvi ds(n);\n\t\t\trep(j,n) cin>>ds[j];\n\t\t\tutod[unit]=ds;\n\t\t}\n\t\tstring s; cin>>s;\n\t\tmap<string,string> vtou; // variable -> unit\n\t\trep(i,p){\n\t\t\tstring var,unit; cin>>var>>unit;\n\t\t\tvtou[var]=unit;\n\t\t}\n\t\t//dump(mt(n,m,p)); dump(s); dump(utod); dump(vtou);\n\t\t\n\t\ttry{\n\t\t\tvi ds; tie(ds,ignore)=expr(s,0,utod,vtou);\n\t\t\tstring res=\"undefined\";\n\t\t\tfor(auto p:utod)\n\t\t\t\tif(ds==p.second)\n\t\t\t\t\tres=p.first;\n\t\t\tcout<<res<<endl;\n\t\t}\n\t\tcatch(const char* msg){\n\t\t\tcout<<msg<<endl;\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1308,
"score_of_the_acc": -1,
"final_rank": 7
}
] |
aoj_1088_cpp
|
Problem E: School Excursion
春、それは修学旅行の時期である。
会津大学附属小学校（会津大小）でも、来年度の修学旅行の計画が建てられていた。
修学旅行は電車で移動することが伝統になっている。
会津若松市内では電車を利用する機会が少ないためだ。
しかし、学校に届いたある苦情により教員たちは頭を悩ませていた。
それは、「ある駅で大人数で乗り換えを行っていたので、その駅を利用する他の乗客に迷惑であった」という内容だった。
とくに、電車を降りたあとホームからの通路で大混雑してしまったという。
それは近年、会津大小の生徒数が急上昇しているからであった。
その原因は日本において競技プログラミングが大流行し、
小学校から競技プログラマーを養成するための訓練を行っている会津大小に生徒が集まったからである。
会津大小競技プログラミング部長であるあなたは、修学旅行を楽しみにしている。
修学旅行を成功させたいあなたは教員たちに提案をした。
「クラスごとに行動して、同じ駅に同時に到着しないようにしましょう！！ 競技プログラミングの知識を応用すれば簡単です！！」
複数のクラスが同時に同じ駅に到着することがないように移動するとき（同じ駅に複数のクラスが滞在することは可能）、
出発する駅から目的地まで到達できる最大のクラス数を求め、そのときの最小の運賃を求めるプログラムをつくりなさい。
ただし、ある駅で同時に到着する電車と発車する電車が存在する場合、乗り継ぎが可能である。つまり、乗り継ぎに要する時間は無視して良い。
Input
入力は複数のデータセットから構成される。
データセットの数は20個以下である。
各データセットの形式は次に示す通りである。
n
m
1
x
1,1
y
1,1
c
1,1
x
1,2
y
1,2
c
1,2
...
x
1,m1
y
1,m1
c
1,m1
m
2
x
2,1
y
2,1
c
2,1
x
2,2
y
2,2
c
2,2
...
x
2,m2
y
2,m2
c
2,m2
...
m
n-1
x
n-1,1
y
n-1,1
c
n-1,1
x
n-1,2
y
n-1,2
c
n-1,2
...
x
n-1,m2
y
n-1,m2
c
n-1,m2
g
n( 2 ≤ n ≤ 100)は駅の数を表す。
駅の数は出発する駅と目的地の駅、乗り換えする駅を含む。
駅は出発する駅を1番目、最初に乗り換える駅を2番目の駅と数え、目的地をn番目の駅とする。
m
i
はi番目の駅からi+1番目の駅への電車の数を表す。
m
i
(1 ≤ m ≤ 20)個の電車の情報が続く。
x
i,j
y
i,j
c
i,j
はi番目の駅からi+1番目の駅に向かう電車の出発時刻(x
i,j
)到着時刻(y
i,j
)運賃(c
i,j
)を表す。
(0 ≤ x
i,j
, y
i,j
≤ 200000 かつ x
i,j
≤ y
i,j
)
(1 ≤ c
i,j
≤ 1000)
その後g(1≤ g ≤ 10)が続く。
gは修学旅行に参加するクラス数を表す。
与えられる数（n,m,x,y,c,g)はすべて整数である。
入力の終了はひとつの0を含む１行で示される。
Output
一行に到着可能なクラス数とそのときの最小運賃をこの順に出力せよ。
もし、ただ一つのクラスも到着できない場合は0 0を出力せよ。
Sample Input
2
4
1 2 10
2 2 5
1 3 20
2 3 10
10
3
2
1 2 5
0 3 4
3
10 11 100
2 12 2
12 12 3
10
0
Sample Output
2 15
2 111
|
[
{
"submission_id": "aoj_1088_10929739",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing pll = pair<ll, ll>;\n#define vc vector\nusing vl = vc<ll>;\n\n#define ov(a, b, c, name, ...) name\n#define rep2(i, l, r) for(ll i = (l); i < ll(r); i++)\n#define rep1(i, n) rep2(i, 0, n)\n#define rep(...) ov(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)\n#define fec(...) for(const auto& __VA_ARGS__)\n#define per(i, a, b) for(ll i = ll(a) - 1; i >= ll(b); i--)\n\n#define ALL(x) begin(x), end(x)\n#define SZ(x) (ll) size(x)\n#define LB(v, x) (lower_bound(ALL(v), x) - begin(v))\n#define eb emplace_back\n\nbool chmin(auto& a, auto b) { return a > b ? a = b, 1 : 0; }\nbool chmax(auto& a, auto b) { return a < b ? a = b, 1 : 0; }\nconst ll INF = ll(4e18) + 100;\n\nvoid printvec(const auto& v) {\n for(auto it = begin(v); it != end(v); it++) cout << *it << \" \";\n cout << endl;\n}\n\n#ifdef LOCAL\n#define local(...) __VA_ARGS__\n#else\n#define local(...)\n#endif\n\nstruct MCF {\n struct edge {\n int to;\n ll cap, cost;\n int rev;\n bool isrev;\n };\n vc<vc<edge>> g;\n vl pot, cost;\n vc<int> pv, pe;\n MCF(int n) : g(n) {}\n void add(int u, int v, ll cap, ll cost) {\n g[u].eb(v, cap, cost, SZ(g[v]), false);\n g[v].eb(u, 0, -cost, SZ(g[u]) - 1, true);\n }\n // (flow, cost) f は流量制限\n pll flow(int s, int t, ll f) {\n int n = g.size();\n ll F = 0, C = 0;\n using P = pair<ll, int>;\n priority_queue<P, vc<P>, greater<P>> pq;\n pot.assign(n, 0), pe.assign(n, -1), pv.assign(n, -1);\n while(f) {\n cost.assign(n, INF);\n pq.emplace(0, s);\n cost[s] = 0;\n while(!pq.empty()) {\n auto [c, x] = pq.top();\n pq.pop();\n if(cost[x] < c) continue;\n rep(i, g[x].size()) {\n edge& e = g[x][i];\n ll ncost = cost[x] + e.cost + pot[x] - pot[e.to];\n if(e.cap and chmin(cost[e.to], ncost)) {\n pv[e.to] = x, pe[e.to] = i;\n pq.emplace(cost[e.to], e.to);\n }\n }\n }\n if(cost[t] == INF) return {F, C};\n rep(i, n) pot[i] += cost[i];\n ll df = f;\n for(int v = t; v != s; v = pv[v]) chmin(df, g[pv[v]][pe[v]].cap);\n f -= df, F += df, C += df * pot[t];\n for(int v = t; v != s; v = pv[v]) {\n auto& e = g[pv[v]][pe[v]];\n e.cap -= df, g[v][e.rev].cap += df;\n }\n }\n return {F, C};\n }\n};\n\nint main() {\n#ifndef LOCAL\n cin.tie(0)->sync_with_stdio(0);\n#endif\n\n while(true) {\n ll N;\n cin >> N;\n if(N == 0) break;\n vc<array<ll, 6>> E; // from_i, from_t, to_i, to_t, cap, cost\n vc<pll> V;\n rep(i, N - 1) {\n ll M;\n cin >> M;\n rep(j, M) {\n ll x, y, c;\n cin >> x >> y >> c;\n E.push_back({i, x, i + 1, y, 1, c});\n V.eb(i, x), V.eb(i + 1, y);\n }\n }\n ll g;\n cin >> g;\n sort(ALL(V)), V.erase(unique(ALL(V)), V.end());\n MCF G(2 * SZ(V) + 2);\n ll S = 2 * SZ(V), T = 2 * SZ(V) + 1;\n fec([ fi, ft, ti, tt, cap, cost ] : E) {\n ll u = LB(V, (pll{fi, ft}));\n ll v = LB(V, (pll{ti, tt}));\n G.add(2 * u + 1, 2 * v, cap, cost);\n }\n rep(u, SZ(V) - 1) {\n auto [i1, t1] = V.at(u);\n auto [i2, t2] = V.at(u + 1);\n if(i1 == i2) {\n G.add(2 * u + 1, 2 * (u + 1) + 1, g, 0);\n }\n }\n rep(u, SZ(V)) {\n auto [i, t] = V.at(u);\n G.add(2 * u, 2 * u + 1, 1, 0);\n if(i == 0) { G.add(S, 2 * u + 1, g, 0); }\n if(i == N - 1) { G.add(2 * u + 1, T, g, 0); }\n }\n auto [flow, cost] = G.flow(S, T, g);\n cout << flow << \" \" << cost << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 4480,
"score_of_the_acc": -0.0133,
"final_rank": 2
},
{
"submission_id": "aoj_1088_9321489",
"code_snippet": "// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n\n#define CONSTANTS\n#pragma GCC diagnostic ignored \"-Wunused-parameter\"\n#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr long long INF = 1e18;\n// constexpr long long INF = LONG_LONG_MAX;\n// constexpr int MOD = 1000000007;\nconstexpr int MOD = 998244353;\nconstexpr long double EPS = 1e-10;\nconstexpr long double PI = M_PI;\n\nusing ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll, ll>; using pii = pair<int, int>; using pli = pair<ll, int>; using pil = pair<int, ll>; template<typename T> using vv = vector<vector<T>>; using vvl = vv<ll>; using vvi = vv<int>; using vvpll = vv<pll>; using vvpli = vv<pli>; using vvpil = vv<pil>;\n#define name4(i, a, b, c, d, e, ...) e\n#define rep(...) name4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rep1(i, a) for (ll i = 0, _aa = a; i < _aa; i++)\n#define rep2(i, a, b) for (ll i = a, _bb = b; i < _bb; i++)\n#define rep3(i, a, b, c) for (ll i = a, _bb = b; (c > 0 && a <= i && i < _bb) or (c < 0 && a >= i && i > _bb); i += c)\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\n#define pb push_back\n#define eb emplace_back\n#define mkp make_pair\n#define ALL(A) begin(A), end(A)\n#define UNIQUE(A) sort(ALL(A)), A.erase(unique(ALL(A)), A.end())\n#define elif else if\n#define tostr to_string\n#ifndef CONSTANTS\nconstexpr ll INF = 1e18; constexpr int MOD = 1000000007; constexpr ld EPS = 1e-10; constexpr ld PI = M_PI;\n#endif\ntemplate<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; } template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; } template<typename T = ll> vector<T> LIST(int N) { vector<T> A(N); rep(i, N) { cin >> A[i]; } return A; }\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\ntemplate<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second; } template<class T, size_t... Is> void print_tuple(ostream &os, const T &arg, index_sequence<Is...>) { static_cast<void>(((os << (Is == 0 ? \"\" : \" \"), os << get<Is>(arg)), ...)); } template<class... Ts> ostream &operator<<(ostream &os, const tuple<Ts...> &arg) { print_tuple(os, arg, make_index_sequence<sizeof...(Ts)>()); return os; } template<typename T, size_t N> ostream &operator<<(ostream &os, const array<T, N> &arr) { rep(i, N) { os << arr[i]; if (i != (int)N - 1) { os << ' '; } } return os; } template<typename T, size_t N> void print(const array<T, N> &arr, string sep = \" \") { rep(i, N) { cout << arr[i]; if (i != (int)N - 1) cout << sep; } cout << '\\n'; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { rep(i, vec.size()) { os << vec[i]; if (i != (int)vec.size() - 1) { os << ' '; } } return os; } template<typename T> void print(const vector<T> &vec, string sep = \" \") { rep(i, vec.size()) { cout << vec[i]; if (i != (int)vec.size() - 1) cout << sep; } cout << '\\n'; } template<typename T> void print(const deque<T> &que, string sep = \" \") { vector<T> vec(ALL(que)); print(vec, sep); } template<typename T> void print(const set<T> &se, string sep = \" \") { vector<T> vec(ALL(se)); print(vec, sep); } template<typename T> void print(const initializer_list<T> &li, string sep = \" \") { vector<T> V(ALL(li)); print(V, sep); } void print() { cout << '\\n'; } template<typename T> void print(T out) { cout << out << '\\n'; }\n#define debug(...) multi_debug(#__VA_ARGS__, __VA_ARGS__)\ntemplate<typename T> void multi_debug(string name, const vv<T> &grid) { cerr << name << \":\" << endl; int H = grid.size(); int W = grid[0].size(); vector<int> mxlen(W); rep(h, H) { rep(w, W) { chmax(mxlen[w], (int)tostr(grid[h][w]).size()); } } rep(h, H) { rep(w, W) { int pad = mxlen[w] - (int)tostr(grid[h][w]).size(); cerr << string(pad, ' ') << grid[h][w]; if (w == W - 1) { cerr << endl; } else { cerr << ' '; } } } } template<class Tp, class... Ts> void multi_debug(string names, Tp arg, Ts... args) { if constexpr (sizeof...(Ts) == 0) { while (names.back() == ' ') { names.pop_back(); } cerr << names << \": \" << arg << endl; } else { int n = names.size(), comma_pos = -1, paren_depth = 0, inside_quote = false; rep(i, n) { if (not inside_quote and paren_depth == 0 and names[i] == ',') { comma_pos = i; break; } if (names[i] == '\\\"' or names[i] == '\\'') { if (i > 0 and names[i - 1] == '\\\\') continue; inside_quote ^= true; } if (not inside_quote and names[i] == '(') { paren_depth++; } if (not inside_quote and names[i] == ')') { paren_depth--; } } assert(comma_pos != -1); string name = names.substr(0, comma_pos); while (name.back() == ' ') { name.pop_back(); } cerr << name << \": \" << arg << endl; int next_begin_at = comma_pos + 1; while (names[next_begin_at] == ' ') { next_begin_at++; } names = names.substr(next_begin_at); multi_debug(names, args...); } } template<typename T> void print(const vector<T> &V, char sep) { print(V, string{sep}); } template<typename T, size_t N> void print(const array<T, N> &arr, char sep) { print(arr, string{sep}); }\n\ntemplate<typename T> int bisect_left(const vector<T> &A, T val, int lo = 0) { return lower_bound(A.begin() + lo, A.end(), val) - A.begin(); } template<typename T> int bisect_right(const vector<T> &A, T val, int lo = 0) { return upper_bound(A.begin() + lo, A.end(), val) - A.begin(); }\ntemplate<typename T> struct Compress { int N; vector<T> dat; bool built = false; Compress() {} Compress(const vector<T> &A) : dat(A) { build(); } void build() { sort(dat.begin(), dat.end()); dat.erase(unique(dat.begin(), dat.end()), dat.end()); N = dat.size(); built = true; } void add(T x) { assert(not built); dat.emplace_back(x); } template<typename... Ts> void add(const T val, Ts... ts) { dat.emplace_back(val); if constexpr (sizeof...(Ts) > 0) { add(ts...); } } void add(const vector<T> &A) { for (auto a : A) { add(a); } } int zip(T x) { assert(built); return bisect_left(dat, x); } T unzip(int x) { assert(built); return dat[x]; } int operator[](T x) { return zip(x); } int size() { assert(built); return dat.size(); } T size(int i) { assert(built and 0 <= i and i < N); if (i == N - 1) { return 1; } else { return unzip(i + 1) - unzip(i); } } vector<T> zip(const vector<T> &A) { int M = A.size(); vector<T> res(M); for (int i = 0; i < M; i++) { res[i] = zip(A[i]); } return res; } };\nnamespace atcoder { namespace internal { template <class E> struct csr { std::vector<int> start; std::vector<E> elist; explicit csr(int n, const std::vector<std::pair<int, E>>& edges) : start(n + 1), elist(edges.size()) { for (auto e : edges) { start[e.first + 1]++; } for (int i = 1; i <= n; i++) { start[i] += start[i - 1]; } auto counter = start; for (auto e : edges) { elist[counter[e.first]++] = e.second; } } }; } }\nnamespace atcoder { namespace internal { template <class T> struct simple_queue { std::vector<T> payload; int pos = 0; void reserve(int n) { payload.reserve(n); } int size() const { return int(payload.size()) - pos; } bool empty() const { return pos == int(payload.size()); } void push(const T& t) { payload.push_back(t); } T& front() { return payload[pos]; } void clear() { payload.clear(); pos = 0; } void pop() { pos++; } }; } }\nnamespace atcoder { template <class Cap, class Cost> struct mcf_graph { public: mcf_graph() {} explicit mcf_graph(int n) : _n(n) {} int add_edge(int from, int to, Cap cap, Cost cost) { assert(0 <= from && from < _n); assert(0 <= to && to < _n); assert(0 <= cap); assert(0 <= cost); int m = int(_edges.size()); _edges.push_back({from, to, cap, 0, cost}); return m; } struct edge { int from, to; Cap cap, flow; Cost cost; }; edge get_edge(int i) { int m = int(_edges.size()); assert(0 <= i && i < m); return _edges[i]; } std::vector<edge> edges() { return _edges; } std::pair<Cap, Cost> flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); } std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) { return slope(s, t, flow_limit).back(); } std::vector<std::pair<Cap, Cost>> slope(int s, int t) { return slope(s, t, std::numeric_limits<Cap>::max()); } std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) { assert(0 <= s && s < _n); assert(0 <= t && t < _n); assert(s != t); int m = int(_edges.size()); std::vector<int> edge_idx(m); auto g = [&]() { std::vector<int> degree(_n), redge_idx(m); std::vector<std::pair<int, _edge>> elist; elist.reserve(2 * m); for (int i = 0; i < m; i++) { auto e = _edges[i]; edge_idx[i] = degree[e.from]++; redge_idx[i] = degree[e.to]++; elist.push_back({e.from, {e.to, -1, e.cap - e.flow, e.cost}}); elist.push_back({e.to, {e.from, -1, e.flow, -e.cost}}); } auto _g = internal::csr<_edge>(_n, elist); for (int i = 0; i < m; i++) { auto e = _edges[i]; edge_idx[i] += _g.start[e.from]; redge_idx[i] += _g.start[e.to]; _g.elist[edge_idx[i]].rev = redge_idx[i]; _g.elist[redge_idx[i]].rev = edge_idx[i]; } return _g; }(); auto result = slope(g, s, t, flow_limit); for (int i = 0; i < m; i++) { auto e = g.elist[edge_idx[i]]; _edges[i].flow = _edges[i].cap - e.cap; } return result; } private: int _n; std::vector<edge> _edges; struct _edge { int to, rev; Cap cap; Cost cost; }; std::vector<std::pair<Cap, Cost>> slope(internal::csr<_edge>& g, int s, int t, Cap flow_limit) { std::vector<std::pair<Cost, Cost>> dual_dist(_n); std::vector<int> prev_e(_n); std::vector<bool> vis(_n); struct Q { Cost key; int to; bool operator<(Q r) const { return key > r.key; } }; std::vector<int> que_min; std::vector<Q> que; auto dual_ref = [&]() { for (int i = 0; i < _n; i++) { dual_dist[i].second = std::numeric_limits<Cost>::max(); } std::fill(vis.begin(), vis.end(), false); que_min.clear(); que.clear(); size_t heap_r = 0; dual_dist[s].second = 0; que_min.push_back(s); while (!que_min.empty() || !que.empty()) { int v; if (!que_min.empty()) { v = que_min.back(); que_min.pop_back(); } else { while (heap_r < que.size()) { heap_r++; std::push_heap(que.begin(), que.begin() + heap_r); } v = que.front().to; std::pop_heap(que.begin(), que.end()); que.pop_back(); heap_r--; } if (vis[v]) continue; vis[v] = true; if (v == t) break; Cost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second; for (int i = g.start[v]; i < g.start[v + 1]; i++) { auto e = g.elist[i]; if (!e.cap) continue; Cost cost = e.cost - dual_dist[e.to].first + dual_v; if (dual_dist[e.to].second - dist_v > cost) { Cost dist_to = dist_v + cost; dual_dist[e.to].second = dist_to; prev_e[e.to] = e.rev; if (dist_to == dist_v) { que_min.push_back(e.to); } else { que.push_back(Q{dist_to, e.to}); } } } } if (!vis[t]) { return false; } for (int v = 0; v < _n; v++) { if (!vis[v]) continue; dual_dist[v].first -= dual_dist[t].second - dual_dist[v].second; } return true; }; Cap flow = 0; Cost cost = 0, prev_cost_per_flow = -1; std::vector<std::pair<Cap, Cost>> result = {{Cap(0), Cost(0)}}; while (flow < flow_limit) { if (!dual_ref()) break; Cap c = flow_limit - flow; for (int v = t; v != s; v = g.elist[prev_e[v]].to) { c = std::min(c, g.elist[g.elist[prev_e[v]].rev].cap); } for (int v = t; v != s; v = g.elist[prev_e[v]].to) { auto& e = g.elist[prev_e[v]]; e.cap += c; g.elist[e.rev].cap -= c; } Cost d = -dual_dist[s].first; flow += c; cost += c * d; if (prev_cost_per_flow == d) { result.pop_back(); } result.push_back({flow, cost}); prev_cost_per_flow = d; } return result; } }; }\ntemplate<typename T> bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; }\ntemplate<typename T> vector<T> bellman_ford(int N, const vector<tuple<int, int, T>> &edges, int src) { vector<T> res(N, INF); res[src] = 0; rep(_, N - 1) { for (auto [u, v, cost] : edges) { if (res[u] == INF) { continue; } chmin(res[v], res[u] + cost); } } auto tmp = res; rep(_, N - 1) { for (auto [u, v, cost] : edges) { if (res[u] == INF) { continue; } if (res[v] > res[u] + cost) { res[v] = -INF; } } } rep(i, N) { if (tmp[i] != res[i]) { res[i] = -INF; } } return res; }\ntemplate<typename Cap, typename Cost> struct MinCostFlow : atcoder::mcf_graph<Cap, Cost> { using base_type = atcoder::mcf_graph<Cap, Cost>; int N; bool has_negative = false; vector<tuple<int, int, Cost>> temp_edges; vector<Cap> caps; vector<Cost> potential; MinCostFlow(int N) : base_type(N), N(N), has_negative(false) { potential.assign(N, 0); } int add_edge(int from, int to, Cap cap, Cost cost) { if (cost < 0) { has_negative = true; } int m = temp_edges.size(); temp_edges.emplace_back(from, to, cost); caps.emplace_back(cap); return m; } void build(int s) { if (has_negative) { potential = bellman_ford(N, temp_edges, s); for (int i = 0; i < N; i++) { if (potential[i] >= INF) { potential[i] = 0; } assert(potential[i] > -INF); } } for (int i = 0; i < temp_edges.size(); i++) { auto [from, to, cost] = temp_edges[i]; base_type::add_edge(from, to, caps[i], cost + potential[from] - potential[to]); } } pair<Cap, Cost> flow(int s, int t) { return flow(s, t, numeric_limits<Cap>::max()); } pair<Cap, Cost> flow(int s, int t, Cap flow_limit) { return slope(s, t, flow_limit).back(); } vector<pair<Cap, Cost>> slope(int s, int t) { return slope(s, t, numeric_limits<Cap>::max()); } vector<pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) { build(s); auto result = base_type::slope(s, t, flow_limit); if (has_negative) { for (auto &[flow, cost] : result) { cost += (potential[t] - potential[s]) * flow; } } return result; } };\nll gridtoid(ll i, ll j, ll W) { return i * W + j; }\n\nvoid solve() {\n ll N;\n cin >> N;\n if (N == 0) exit(0);\n Compress<ll> cp;\n vv<array<ll, 3>> XYC(N);\n rep(i, N - 1) {\n ll m;\n cin >> m;\n rep(_, m) {\n ll x, y, c;\n cin >> x >> y >> c;\n XYC[i].pb({x, y, c});\n cp.add(x, y);\n }\n }\n cp.build();\n ll cpsz = cp.size();\n ll g;\n cin >> g;\n\n // 頂点はV[駅][経過時間]\n ll L = N * cpsz;\n // 始点は頂点(0, 0)のout\n ll s = L;\n // 終点は頂点(N - 1, cpsz - 1)のout\n ll t = L * 2 - 1;\n MinCostFlow<ll, ll> mcf(L * 2);\n // in -> out\n rep(i, L) {\n // 流量1にして同時到着を防ぐ\n mcf.add_edge(i, L + i, 1, 0);\n }\n rep(i, N - 1) {\n for (auto [x, y, c] : XYC[i]) {\n // 頂点(i, cp[x])のout\n ll u = L + gridtoid(i, cp[x], cpsz);\n // 頂点(i + 1, cp[y])のin\n ll v = gridtoid(i + 1, cp[y], cpsz);\n mcf.add_edge(u, v, 1, c);\n }\n }\n rep(i, N) {\n rep(j, cpsz - 1) {\n // 同じ駅に留まることに当たる辺(流量は無制限)\n mcf.add_edge(L + gridtoid(i, j, cpsz), L + gridtoid(i, j + 1, cpsz), g, 0);\n }\n }\n auto [flow, cost] = mcf.flow(s, t);\n print({flow, cost});\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n\n // single test case\n // solve();\n\n // multi test cases\n while(1) solve();\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 890,
"memory_kb": 89560,
"score_of_the_acc": -1.735,
"final_rank": 16
},
{
"submission_id": "aoj_1088_9320843",
"code_snippet": "// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n\n#define CONSTANTS\n#pragma GCC diagnostic ignored \"-Wunused-parameter\"\n#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr long long INF = 1e18;\n// constexpr long long INF = LONG_LONG_MAX;\n// constexpr int MOD = 1000000007;\nconstexpr int MOD = 998244353;\nconstexpr long double EPS = 1e-10;\nconstexpr long double PI = M_PI;\n\nusing ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll, ll>; using pii = pair<int, int>; using pli = pair<ll, int>; using pil = pair<int, ll>; template<typename T> using vv = vector<vector<T>>; using vvl = vv<ll>; using vvi = vv<int>; using vvpll = vv<pll>; using vvpli = vv<pli>; using vvpil = vv<pil>;\n#define name4(i, a, b, c, d, e, ...) e\n#define rep(...) name4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rep1(i, a) for (ll i = 0, _aa = a; i < _aa; i++)\n#define rep2(i, a, b) for (ll i = a, _bb = b; i < _bb; i++)\n#define rep3(i, a, b, c) for (ll i = a, _bb = b; (c > 0 && a <= i && i < _bb) or (c < 0 && a >= i && i > _bb); i += c)\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\n#define pb push_back\n#define eb emplace_back\n#define mkp make_pair\n#define ALL(A) begin(A), end(A)\n#define UNIQUE(A) sort(ALL(A)), A.erase(unique(ALL(A)), A.end())\n#define elif else if\n#define tostr to_string\n#ifndef CONSTANTS\nconstexpr ll INF = 1e18; constexpr int MOD = 1000000007; constexpr ld EPS = 1e-10; constexpr ld PI = M_PI;\n#endif\ntemplate<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; } template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; } template<typename T = ll> vector<T> LIST(int N) { vector<T> A(N); rep(i, N) { cin >> A[i]; } return A; }\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\ntemplate<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second; } template<class T, size_t... Is> void print_tuple(ostream &os, const T &arg, index_sequence<Is...>) { static_cast<void>(((os << (Is == 0 ? \"\" : \" \"), os << get<Is>(arg)), ...)); } template<class... Ts> ostream &operator<<(ostream &os, const tuple<Ts...> &arg) { print_tuple(os, arg, make_index_sequence<sizeof...(Ts)>()); return os; } template<typename T, size_t N> ostream &operator<<(ostream &os, const array<T, N> &arr) { rep(i, N) { os << arr[i]; if (i != (int)N - 1) { os << ' '; } } return os; } template<typename T, size_t N> void print(const array<T, N> &arr, string sep = \" \") { rep(i, N) { cout << arr[i]; if (i != (int)N - 1) cout << sep; } cout << '\\n'; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { rep(i, vec.size()) { os << vec[i]; if (i != (int)vec.size() - 1) { os << ' '; } } return os; } template<typename T> void print(const vector<T> &vec, string sep = \" \") { rep(i, vec.size()) { cout << vec[i]; if (i != (int)vec.size() - 1) cout << sep; } cout << '\\n'; } template<typename T> void print(const deque<T> &que, string sep = \" \") { vector<T> vec(ALL(que)); print(vec, sep); } template<typename T> void print(const set<T> &se, string sep = \" \") { vector<T> vec(ALL(se)); print(vec, sep); } template<typename T> void print(const initializer_list<T> &li, string sep = \" \") { vector<T> V(ALL(li)); print(V, sep); } void print() { cout << '\\n'; } template<typename T> void print(T out) { cout << out << '\\n'; }\n#define debug(...) multi_debug(#__VA_ARGS__, __VA_ARGS__)\ntemplate<typename T> void multi_debug(string name, const vv<T> &grid) { cerr << name << \":\" << endl; int H = grid.size(); int W = grid[0].size(); vector<int> mxlen(W); rep(h, H) { rep(w, W) { chmax(mxlen[w], (int)tostr(grid[h][w]).size()); } } rep(h, H) { rep(w, W) { int pad = mxlen[w] - (int)tostr(grid[h][w]).size(); cerr << string(pad, ' ') << grid[h][w]; if (w == W - 1) { cerr << endl; } else { cerr << ' '; } } } } template<class Tp, class... Ts> void multi_debug(string names, Tp arg, Ts... args) { if constexpr (sizeof...(Ts) == 0) { while (names.back() == ' ') { names.pop_back(); } cerr << names << \": \" << arg << endl; } else { int n = names.size(), comma_pos = -1, paren_depth = 0, inside_quote = false; rep(i, n) { if (not inside_quote and paren_depth == 0 and names[i] == ',') { comma_pos = i; break; } if (names[i] == '\\\"' or names[i] == '\\'') { if (i > 0 and names[i - 1] == '\\\\') continue; inside_quote ^= true; } if (not inside_quote and names[i] == '(') { paren_depth++; } if (not inside_quote and names[i] == ')') { paren_depth--; } } assert(comma_pos != -1); string name = names.substr(0, comma_pos); while (name.back() == ' ') { name.pop_back(); } cerr << name << \": \" << arg << endl; int next_begin_at = comma_pos + 1; while (names[next_begin_at] == ' ') { next_begin_at++; } names = names.substr(next_begin_at); multi_debug(names, args...); } } template<typename T> void print(const vector<T> &V, char sep) { print(V, string{sep}); } template<typename T, size_t N> void print(const array<T, N> &arr, char sep) { print(arr, string{sep}); }\n\ntemplate<typename T> int bisect_left(const vector<T> &A, T val, int lo = 0) { return lower_bound(A.begin() + lo, A.end(), val) - A.begin(); } template<typename T> int bisect_right(const vector<T> &A, T val, int lo = 0) { return upper_bound(A.begin() + lo, A.end(), val) - A.begin(); }\ntemplate<typename T> struct Compress { int N; vector<T> dat; bool built = false; Compress() {} Compress(const vector<T> &A) : dat(A) { build(); } void build() { sort(dat.begin(), dat.end()); dat.erase(unique(dat.begin(), dat.end()), dat.end()); N = dat.size(); built = true; } void add(T x) { assert(not built); dat.emplace_back(x); } template<typename... Ts> void add(const T val, Ts... ts) { dat.emplace_back(val); if constexpr (sizeof...(Ts) > 0) { add(ts...); } } void add(const vector<T> &A) { for (auto a : A) { add(a); } } int zip(T x) { assert(built); return bisect_left(dat, x); } T unzip(int x) { assert(built); return dat[x]; } int operator[](T x) { return zip(x); } int size() { assert(built); return dat.size(); } T size(int i) { assert(built and 0 <= i and i < N); if (i == N - 1) { return 1; } else { return unzip(i + 1) - unzip(i); } } vector<T> zip(const vector<T> &A) { int M = A.size(); vector<T> res(M); for (int i = 0; i < M; i++) { res[i] = zip(A[i]); } return res; } };\nnamespace atcoder { namespace internal { template <class E> struct csr { std::vector<int> start; std::vector<E> elist; explicit csr(int n, const std::vector<std::pair<int, E>>& edges) : start(n + 1), elist(edges.size()) { for (auto e : edges) { start[e.first + 1]++; } for (int i = 1; i <= n; i++) { start[i] += start[i - 1]; } auto counter = start; for (auto e : edges) { elist[counter[e.first]++] = e.second; } } }; } }\nnamespace atcoder { namespace internal { template <class T> struct simple_queue { std::vector<T> payload; int pos = 0; void reserve(int n) { payload.reserve(n); } int size() const { return int(payload.size()) - pos; } bool empty() const { return pos == int(payload.size()); } void push(const T& t) { payload.push_back(t); } T& front() { return payload[pos]; } void clear() { payload.clear(); pos = 0; } void pop() { pos++; } }; } }\nnamespace atcoder { template <class Cap, class Cost> struct mcf_graph { public: mcf_graph() {} explicit mcf_graph(int n) : _n(n) {} int add_edge(int from, int to, Cap cap, Cost cost) { assert(0 <= from && from < _n); assert(0 <= to && to < _n); assert(0 <= cap); assert(0 <= cost); int m = int(_edges.size()); _edges.push_back({from, to, cap, 0, cost}); return m; } struct edge { int from, to; Cap cap, flow; Cost cost; }; edge get_edge(int i) { int m = int(_edges.size()); assert(0 <= i && i < m); return _edges[i]; } std::vector<edge> edges() { return _edges; } std::pair<Cap, Cost> flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); } std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) { return slope(s, t, flow_limit).back(); } std::vector<std::pair<Cap, Cost>> slope(int s, int t) { return slope(s, t, std::numeric_limits<Cap>::max()); } std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) { assert(0 <= s && s < _n); assert(0 <= t && t < _n); assert(s != t); int m = int(_edges.size()); std::vector<int> edge_idx(m); auto g = [&]() { std::vector<int> degree(_n), redge_idx(m); std::vector<std::pair<int, _edge>> elist; elist.reserve(2 * m); for (int i = 0; i < m; i++) { auto e = _edges[i]; edge_idx[i] = degree[e.from]++; redge_idx[i] = degree[e.to]++; elist.push_back({e.from, {e.to, -1, e.cap - e.flow, e.cost}}); elist.push_back({e.to, {e.from, -1, e.flow, -e.cost}}); } auto _g = internal::csr<_edge>(_n, elist); for (int i = 0; i < m; i++) { auto e = _edges[i]; edge_idx[i] += _g.start[e.from]; redge_idx[i] += _g.start[e.to]; _g.elist[edge_idx[i]].rev = redge_idx[i]; _g.elist[redge_idx[i]].rev = edge_idx[i]; } return _g; }(); auto result = slope(g, s, t, flow_limit); for (int i = 0; i < m; i++) { auto e = g.elist[edge_idx[i]]; _edges[i].flow = _edges[i].cap - e.cap; } return result; } private: int _n; std::vector<edge> _edges; struct _edge { int to, rev; Cap cap; Cost cost; }; std::vector<std::pair<Cap, Cost>> slope(internal::csr<_edge>& g, int s, int t, Cap flow_limit) { std::vector<std::pair<Cost, Cost>> dual_dist(_n); std::vector<int> prev_e(_n); std::vector<bool> vis(_n); struct Q { Cost key; int to; bool operator<(Q r) const { return key > r.key; } }; std::vector<int> que_min; std::vector<Q> que; auto dual_ref = [&]() { for (int i = 0; i < _n; i++) { dual_dist[i].second = std::numeric_limits<Cost>::max(); } std::fill(vis.begin(), vis.end(), false); que_min.clear(); que.clear(); size_t heap_r = 0; dual_dist[s].second = 0; que_min.push_back(s); while (!que_min.empty() || !que.empty()) { int v; if (!que_min.empty()) { v = que_min.back(); que_min.pop_back(); } else { while (heap_r < que.size()) { heap_r++; std::push_heap(que.begin(), que.begin() + heap_r); } v = que.front().to; std::pop_heap(que.begin(), que.end()); que.pop_back(); heap_r--; } if (vis[v]) continue; vis[v] = true; if (v == t) break; Cost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second; for (int i = g.start[v]; i < g.start[v + 1]; i++) { auto e = g.elist[i]; if (!e.cap) continue; Cost cost = e.cost - dual_dist[e.to].first + dual_v; if (dual_dist[e.to].second - dist_v > cost) { Cost dist_to = dist_v + cost; dual_dist[e.to].second = dist_to; prev_e[e.to] = e.rev; if (dist_to == dist_v) { que_min.push_back(e.to); } else { que.push_back(Q{dist_to, e.to}); } } } } if (!vis[t]) { return false; } for (int v = 0; v < _n; v++) { if (!vis[v]) continue; dual_dist[v].first -= dual_dist[t].second - dual_dist[v].second; } return true; }; Cap flow = 0; Cost cost = 0, prev_cost_per_flow = -1; std::vector<std::pair<Cap, Cost>> result = {{Cap(0), Cost(0)}}; while (flow < flow_limit) { if (!dual_ref()) break; Cap c = flow_limit - flow; for (int v = t; v != s; v = g.elist[prev_e[v]].to) { c = std::min(c, g.elist[g.elist[prev_e[v]].rev].cap); } for (int v = t; v != s; v = g.elist[prev_e[v]].to) { auto& e = g.elist[prev_e[v]]; e.cap += c; g.elist[e.rev].cap -= c; } Cost d = -dual_dist[s].first; flow += c; cost += c * d; if (prev_cost_per_flow == d) { result.pop_back(); } result.push_back({flow, cost}); prev_cost_per_flow = d; } return result; } }; }\ntemplate<typename T> bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; }\ntemplate<typename T> vector<T> bellman_ford(int N, const vector<tuple<int, int, T>> &edges, int src) { vector<T> res(N, INF); res[src] = 0; rep(_, N - 1) { for (auto [u, v, cost] : edges) { if (res[u] == INF) { continue; } chmin(res[v], res[u] + cost); } } auto tmp = res; rep(_, N - 1) { for (auto [u, v, cost] : edges) { if (res[u] == INF) { continue; } if (res[v] > res[u] + cost) { res[v] = -INF; } } } rep(i, N) { if (tmp[i] != res[i]) { res[i] = -INF; } } return res; }\ntemplate<typename Cap, typename Cost> struct MinCostFlow : atcoder::mcf_graph<Cap, Cost> { using base_type = atcoder::mcf_graph<Cap, Cost>; int N; bool has_negative = false; vector<tuple<int, int, Cost>> temp_edges; vector<Cap> caps; vector<Cost> potential; MinCostFlow(int N) : base_type(N), N(N), has_negative(false) { potential.assign(N, 0); } int add_edge(int from, int to, Cap cap, Cost cost) { if (cost < 0) { has_negative = true; } int m = temp_edges.size(); temp_edges.emplace_back(from, to, cost); caps.emplace_back(cap); return m; } void build(int s) { if (has_negative) { potential = bellman_ford(N, temp_edges, s); for (int i = 0; i < temp_edges.size(); i++) { if (potential[i] >= INF) { potential[i] = 0; } assert(potential[i] > -INF); } } for (int i = 0; i < temp_edges.size(); i++) { auto [from, to, cost] = temp_edges[i]; base_type::add_edge(from, to, caps[i], cost + potential[from] - potential[to]); } } pair<Cap, Cost> flow(int s, int t) { return flow(s, t, numeric_limits<Cap>::max()); } pair<Cap, Cost> flow(int s, int t, Cap flow_limit) { return slope(s, t, flow_limit).back(); } vector<pair<Cap, Cost>> slope(int s, int t) { return slope(s, t, numeric_limits<Cap>::max()); } vector<pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) { build(s); auto result = base_type::slope(s, t, flow_limit); if (has_negative) { for (auto &[flow, cost] : result) { cost += (potential[t] - potential[s]) * flow; } } return result; } };\nll gridtoid(ll i, ll j, ll W) { return i * W + j; }\n\nvoid solve() {\n ll N;\n cin >> N;\n if (N == 0) exit(0);\n Compress<ll> cp;\n vv<array<ll, 3>> XYC(N);\n rep(i, N - 1) {\n ll m;\n cin >> m;\n rep(_, m) {\n ll x, y, c;\n cin >> x >> y >> c;\n XYC[i].pb({x, y, c});\n cp.add(x, y);\n }\n }\n cp.build();\n ll cpsz = cp.size();\n ll g;\n cin >> g;\n\n // 頂点はV[駅][経過時間]\n ll L = N * cpsz;\n // 始点は頂点(0, 0)のout\n ll s = L;\n // 終点は頂点(N - 1, cpsz - 1)のout\n ll t = L * 2 - 1;\n MinCostFlow<ll, ll> mcf(L * 2);\n // in -> out\n rep(i, L) {\n // 流量1にして同時到着を防ぐ\n mcf.add_edge(i, L + i, 1, 0);\n }\n rep(i, N - 1) {\n for (auto [x, y, c] : XYC[i]) {\n // 頂点(i, cp[x])のout\n ll u = L + gridtoid(i, cp[x], cpsz);\n // 頂点(i + 1, cp[y])のin\n ll v = gridtoid(i + 1, cp[y], cpsz);\n mcf.add_edge(u, v, 1, c);\n }\n }\n rep(i, N) {\n rep(j, cpsz - 1) {\n // 同じ駅に留まることに当たる辺(流量は無制限)\n mcf.add_edge(L + gridtoid(i, j, cpsz), L + gridtoid(i, j + 1, cpsz), g, 0);\n }\n }\n auto [flow, cost] = mcf.flow(s, t, g);\n print({flow, cost});\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n\n // single test case\n // solve();\n\n // multi test cases\n while(1) solve();\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 900,
"memory_kb": 89308,
"score_of_the_acc": -1.7406,
"final_rank": 17
},
{
"submission_id": "aoj_1088_9279451",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\nstruct MCF {\nprivate:\n const long long inf = 1e18;\n vector<long long> dist; //最短距離(費用)\n vector<int> pv, pe; //直前の頂点、辺 \n\npublic:\n struct edge {\n int to, rev; long long cap, cost;\n edge(int t = 0, int r = 0, long long ca = 0, long long co = 0)\n : to(t), rev(r), cap(ca), cost(co) {}\n };\n\n struct pii {\n long long d; int v; //最短距離(費用)、頂点番号\n pii(long long d_ = 0, int v_ = 0) : d(d_), v(v_) {}\n\n bool operator<(const pii& other) const {\n if (d != other.d) return d < other.d;\n return v < other.v;\n }\n\n bool operator>(const pii& other) const {\n if (d != other.d) return d > other.d;\n return v > other.v;\n }\n };\n\n int n;\n vector<vector<edge>> to;\n vector<long long> pot; //ポテンシャル\n\n MCF(int n_ = 1) : n(n_), to(n_), pot(n_), dist(n_), pv(n_), pe(n_) {}\n\n void addedge(int u, int v, long long cap, long long cost) {\n int su = (int)to[u].size();\n int sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap, cost });\n to[v].push_back({ u, su, 0, -cost });\n }\n\n //s->tへ流量fの最小費用流、流せないときは費用と流せなかった流量のペア\n pair<long long, long long> mincostflow(int s, int t, long long f) {\n long long res = 0;\n pot.assign(n, 0);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return { res, f }; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n long long nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf;\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return { res, f };\n }\n};\n\nint main()\n{\n int n;\n while (cin >> n, n) {\n vi<int> m(n - 1);\n vii<int> x(n - 1), y(n - 1), c(n - 1);\n int sm = 0;\n rep(i, n - 1) {\n cin >> m[i];\n sm += m[i];\n rep(j, m[i]) {\n int tx, ty, tc;\n cin >> tx >> ty >> tc;\n x[i].push_back(tx);\n y[i].push_back(ty);\n c[i].push_back(tc);\n }\n }\n int g;\n cin >> g;\n\n MCF mcf(4 * sm + 2);\n int S = 4 * sm, T = S + 1;\n const ll inf = 100; //クラスは最大10個\n\n map<int, int> mp;\n int idx = 0;\n rep(i, n) {\n mp.clear();\n if (i > 0) rep(j, m[i - 1]) mp[y[i - 1][j]];\n if (i < n - 1) rep(j, m[i]) mp[x[i][j]];\n\n for (auto& elem : mp) elem.second = idx++;\n\n set<int> st;\n if (i > 0) rep(j, m[i - 1]) {\n y[i - 1][j] = mp[y[i - 1][j]];\n if (st.count(y[i - 1][j])) continue;\n st.insert(y[i - 1][j]);\n mcf.addedge(y[i - 1][j] + 2 * sm, y[i - 1][j], 1, 0);\n }\n if (i < n - 1) rep(j, m[i]) x[i][j] = mp[x[i][j]];\n\n auto itr = mp.begin();\n while (next(itr) != mp.end()) {\n mcf.addedge(itr->second, next(itr)->second, inf, 0);\n itr++;\n }\n }\n\n rep(i, n - 1) {\n if (i == 0) rep(j, m[i]) mcf.addedge(S, x[i][j], 1, 0); \n if (i == n - 2) rep(j, m[i]) mcf.addedge(y[i][j], T, 1, 0);\n\n //xからy(倍加頂点側)への辺\n rep(j, m[i]) mcf.addedge(x[i][j], y[i][j] + 2 * sm, 1, c[i][j]);\n }\n\n pair<ll, ll> ans;\n ans = mcf.mincostflow(S, T, g);\n cout << g - ans.second << \" \" << ans.first << endl;\n\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 4072,
"score_of_the_acc": -0.0342,
"final_rank": 5
},
{
"submission_id": "aoj_1088_9279322",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\nstruct MCF {\nprivate:\n const long long inf = 1e18;\n vector<long long> dist; //最短距離(費用)\n vector<int> pv, pe; //直前の頂点、辺 \n\npublic:\n struct edge {\n int to, rev; long long cap, cost;\n edge(int t = 0, int r = 0, long long ca = 0, long long co = 0)\n : to(t), rev(r), cap(ca), cost(co) {}\n };\n\n struct pii {\n long long d; int v; //最短距離(費用)、頂点番号\n pii(long long d_ = 0, int v_ = 0) : d(d_), v(v_) {}\n\n bool operator<(const pii& other) const {\n if (d != other.d) return d < other.d;\n return v < other.v;\n }\n\n bool operator>(const pii& other) const {\n if (d != other.d) return d > other.d;\n return v > other.v;\n }\n };\n\n int n;\n vector<vector<edge>> to;\n vector<long long> pot; //ポテンシャル\n\n MCF(int n_ = 1) : n(n_), to(n_), pot(n_), dist(n_), pv(n_), pe(n_) {}\n\n void addedge(int u, int v, long long cap, long long cost) {\n int su = (int)to[u].size();\n int sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap, cost });\n to[v].push_back({ u, su, 0, -cost });\n }\n\n //s->tへ流量fの最小費用流、流せないときは-1\n long long mincostflow(int s, int t, long long f) {\n long long res = 0;\n pot.assign(n, 0);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return -1; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n long long nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf;\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return res;\n }\n};\n\nint main()\n{\n int n;\n while (cin >> n, n) {\n vi<int> m(n - 1);\n vii<int> x(n - 1), y(n - 1), c(n - 1);\n int sm = 0;\n rep(i, n - 1) {\n cin >> m[i];\n sm += m[i];\n rep(j, m[i]) {\n int tx, ty, tc;\n cin >> tx >> ty >> tc;\n x[i].push_back(tx);\n y[i].push_back(ty);\n c[i].push_back(tc);\n }\n }\n int g;\n cin >> g;\n\n MCF mcf(4 * sm + 2);\n int S = 4 * sm, T = S + 1;\n const ll inf = 100; //クラスは最大10個\n\n map<int, int> mp;\n int idx = 0;\n rep(i, n) {\n mp.clear();\n if (i > 0) rep(j, m[i - 1]) mp[y[i - 1][j]];\n if (i < n - 1) rep(j, m[i]) mp[x[i][j]];\n\n for (auto& elem : mp) elem.second = idx++;\n\n set<int> st;\n if (i > 0) rep(j, m[i - 1]) {\n y[i - 1][j] = mp[y[i - 1][j]];\n if (st.count(y[i - 1][j])) continue;\n st.insert(y[i - 1][j]);\n mcf.addedge(y[i - 1][j] + 2 * sm, y[i - 1][j], 1, 0);\n }\n if (i < n - 1) rep(j, m[i]) x[i][j] = mp[x[i][j]];\n\n auto itr = mp.begin();\n while (next(itr) != mp.end()) {\n mcf.addedge(itr->second, next(itr)->second, inf, 0);\n itr++;\n }\n }\n\n rep(i, n - 1) {\n set<int> st;\n if (i == 0) rep(j, m[i]) mcf.addedge(S, x[i][j], 1, 0); \n if (i == n - 2) rep(j, m[i]) mcf.addedge(y[i][j], T, 1, 0);\n\n //xからy(倍加頂点側)への辺\n rep(j, m[i]) mcf.addedge(x[i][j], y[i][j] + 2 * sm, 1, c[i][j]);\n }\n\n ll cost = 0;\n for (int flow = 1; flow <= g; flow++) {\n ll tc = mcf.mincostflow(S, T, 1);\n if (tc < 0) {\n cout << flow - 1 << \" \" << cost << endl;\n break;\n }\n cost += tc;\n if (flow == g) cout << flow << \" \" << cost << endl; //here?\n }\n\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 4360,
"score_of_the_acc": -0.029,
"final_rank": 4
},
{
"submission_id": "aoj_1088_9279317",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\nstruct MCF {\nprivate:\n const long long inf = 1e18;\n vector<long long> dist; //最短距離(費用)\n vector<int> pv, pe; //直前の頂点、辺 \n\npublic:\n struct edge {\n int to, rev; long long cap, cost;\n edge(int t = 0, int r = 0, long long ca = 0, long long co = 0)\n : to(t), rev(r), cap(ca), cost(co) {}\n };\n\n struct pii {\n long long d; int v; //最短距離(費用)、頂点番号\n pii(long long d_ = 0, int v_ = 0) : d(d_), v(v_) {}\n\n bool operator<(const pii& other) const {\n if (d != other.d) return d < other.d;\n return v < other.v;\n }\n\n bool operator>(const pii& other) const {\n if (d != other.d) return d > other.d;\n return v > other.v;\n }\n };\n\n int n;\n vector<vector<edge>> to;\n vector<long long> pot; //ポテンシャル\n\n MCF(int n_ = 1) : n(n_), to(n_), pot(n_), dist(n_), pv(n_), pe(n_) {}\n\n void addedge(int u, int v, long long cap, long long cost) {\n int su = (int)to[u].size();\n int sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap, cost });\n to[v].push_back({ u, su, 0, -cost });\n }\n\n //s->tへ流量fの最小費用流、流せないときは-1\n long long mincostflow(int s, int t, long long f) {\n long long res = 0;\n pot.assign(n, 0);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return -1; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n long long nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf;\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return res;\n }\n};\n\nint main()\n{\n int n;\n while (cin >> n, n) {\n vi<int> m(n - 1);\n vii<int> x(n - 1), y(n - 1), c(n - 1);\n int sm = 0;\n rep(i, n - 1) {\n cin >> m[i];\n sm += m[i];\n rep(j, m[i]) {\n int tx, ty, tc;\n cin >> tx >> ty >> tc;\n x[i].push_back(tx);\n y[i].push_back(ty);\n c[i].push_back(tc);\n }\n }\n int g;\n cin >> g;\n\n MCF mcf(4 * sm + 2);\n int S = 4 * sm, T = S + 1;\n const ll inf = 100; //クラスは最大10個\n\n map<int, int> mp;\n int idx = 0;\n rep(i, n) {\n mp.clear();\n if (i > 0) rep(j, m[i - 1]) mp[y[i - 1][j]];\n if (i < n - 1) rep(j, m[i]) mp[x[i][j]];\n\n for (auto& elem : mp) elem.second = idx++;\n\n set<int> st;\n if (i > 0) rep(j, m[i - 1]) {\n y[i - 1][j] = mp[y[i - 1][j]];\n if (st.count(y[i - 1][j])) continue;\n st.insert(y[i - 1][j]);\n mcf.addedge(y[i - 1][j] + 2 * sm, y[i - 1][j], 1, 0);\n }\n if (i < n - 1) rep(j, m[i]) x[i][j] = mp[x[i][j]];\n\n auto itr = mp.begin();\n while (next(itr) != mp.end()) {\n mcf.addedge(itr->second, next(itr)->second, inf, 0);\n itr++;\n }\n }\n\n rep(i, n - 1) {\n set<int> st;\n if (i == 0) rep(j, m[i]) mcf.addedge(S, x[i][j], 1, 0); \n if (i == n - 2) rep(j, m[i]) {\n if(st.count(y[i][j])) continue;\n st.insert(y[i][j]);\n mcf.addedge(y[i][j], T, 1, 0);\n }\n\n //xからy(倍加頂点側)への辺\n rep(j, m[i]) mcf.addedge(x[i][j], y[i][j] + 2 * sm, 1, c[i][j]);\n }\n\n ll cost = 0;\n for (int flow = 1; flow <= g; flow++) {\n ll tc = mcf.mincostflow(S, T, 1);\n if (tc < 0) {\n cout << flow - 1 << \" \" << cost << endl;\n break;\n }\n cost += tc;\n if (flow == g) cout << flow << \" \" << cost << endl; //here?\n }\n\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 4292,
"score_of_the_acc": -0.0197,
"final_rank": 3
},
{
"submission_id": "aoj_1088_9279287",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\nstruct MCF {\nprivate:\n const long long inf = 1e18;\n vector<long long> dist; //最短距離(費用)\n vector<int> pv, pe; //直前の頂点、辺 \n\npublic:\n struct edge {\n int to, rev; long long cap, cost;\n edge(int t = 0, int r = 0, long long ca = 0, long long co = 0)\n : to(t), rev(r), cap(ca), cost(co) {}\n };\n\n struct pii {\n long long d; int v; //最短距離(費用)、頂点番号\n pii(long long d_ = 0, int v_ = 0) : d(d_), v(v_) {}\n\n bool operator<(const pii& other) const {\n if (d != other.d) return d < other.d;\n return v < other.v;\n }\n\n bool operator>(const pii& other) const {\n if (d != other.d) return d > other.d;\n return v > other.v;\n }\n };\n\n int n;\n vector<vector<edge>> to;\n vector<long long> pot; //ポテンシャル\n\n MCF(int n_ = 1) : n(n_), to(n_), pot(n_), dist(n_), pv(n_), pe(n_) {}\n\n void addedge(int u, int v, long long cap, long long cost) {\n int su = (int)to[u].size();\n int sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap, cost });\n to[v].push_back({ u, su, 0, -cost });\n }\n\n //s->tへ流量fの最小費用流、流せないときは-1\n long long mincostflow(int s, int t, long long f) {\n long long res = 0;\n pot.assign(n, 0);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return -1; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n long long nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf;\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return res;\n }\n};\n\nint main()\n{\n int n;\n while (cin >> n, n) {\n vi<int> m(n - 1);\n vii<int> x(n - 1), y(n - 1), c(n - 1);\n int sm = 0;\n rep(i, n - 1) {\n cin >> m[i];\n sm += m[i];\n rep(j, m[i]) {\n int tx, ty, tc;\n cin >> tx >> ty >> tc;\n x[i].push_back(tx);\n y[i].push_back(ty);\n c[i].push_back(tc);\n }\n }\n int g;\n cin >> g;\n\n MCF mcf(4 * sm + 2);\n int S = 4 * sm, T = S + 1;\n const ll inf = 100; //クラスは最大10個\n\n map<int, int> mp;\n int idx = 0;\n rep(i, n) {\n mp.clear();\n if (i > 0) rep(j, m[i - 1]) mp[y[i - 1][j]];\n if (i < n - 1) rep(j, m[i]) mp[x[i][j]];\n\n for (auto& elem : mp) elem.second = idx++;\n\n set<int> st;\n if (i > 0) rep(j, m[i - 1]) {\n y[i - 1][j] = mp[y[i - 1][j]];\n if (st.count(y[i - 1][j])) continue;\n st.insert(y[i - 1][j]);\n mcf.addedge(y[i - 1][j] + 2 * sm, y[i - 1][j], 1, 0);\n }\n if (i < n - 1) rep(j, m[i]) x[i][j] = mp[x[i][j]];\n\n auto itr = mp.begin();\n while (next(itr) != mp.end()) {\n mcf.addedge(itr->second, next(itr)->second, inf, 0);\n itr++;\n }\n }\n\n rep(i, n - 1) {\n set<int> st;\n if (i == 0) rep(j, m[i]) mcf.addedge(S, x[i][j], 1, 0); \n if (i == n - 2) rep(j, m[i]) {\n if(st.count(y[i][j])) continue;\n st.insert(y[i][j]);\n mcf.addedge(y[i][j], T, 1, 0);\n }\n\n //xからy(倍加頂点側)への辺\n rep(j, m[i]) mcf.addedge(x[i][j], y[i][j] + 2 * sm, 1, c[i][j]);\n }\n\n ll cost = 0;\n for (int flow = 1; flow <= g; flow++) {\n ll tc = mcf.mincostflow(S, T, 1);\n if (tc < 0) {\n cout << flow - 1 << \" \" << cost << endl;\n break;\n }\n cost += tc;\n }\n\n }\n\n return 0;\n}",
"accuracy": 0.3333333333333333,
"time_ms": 40,
"memory_kb": 4184,
"score_of_the_acc": -0.0099,
"final_rank": 19
},
{
"submission_id": "aoj_1088_9279286",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\nstruct MCF {\nprivate:\n const long long inf = 1e18;\n vector<long long> dist; //最短距離(費用)\n vector<int> pv, pe; //直前の頂点、辺 \n\npublic:\n struct edge {\n int to, rev; long long cap, cost;\n edge(int t = 0, int r = 0, long long ca = 0, long long co = 0)\n : to(t), rev(r), cap(ca), cost(co) {}\n };\n\n struct pii {\n long long d; int v; //最短距離(費用)、頂点番号\n pii(long long d_ = 0, int v_ = 0) : d(d_), v(v_) {}\n\n bool operator<(const pii& other) const {\n if (d != other.d) return d < other.d;\n return v < other.v;\n }\n\n bool operator>(const pii& other) const {\n if (d != other.d) return d > other.d;\n return v > other.v;\n }\n };\n\n int n;\n vector<vector<edge>> to;\n vector<long long> pot; //ポテンシャル\n\n MCF(int n_ = 1) : n(n_), to(n_), pot(n_), dist(n_), pv(n_), pe(n_) {}\n\n void addedge(int u, int v, long long cap, long long cost) {\n int su = (int)to[u].size();\n int sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap, cost });\n to[v].push_back({ u, su, 0, -cost });\n }\n\n //s->tへ流量fの最小費用流、流せないときは-1\n long long mincostflow(int s, int t, long long f) {\n long long res = 0;\n pot.assign(n, 0);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return -1; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n long long nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf;\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return res;\n }\n};\n\nint main()\n{\n int n;\n while (cin >> n, n) {\n vi<int> m(n - 1);\n vii<int> x(n - 1), y(n - 1), c(n - 1);\n int sm = 0;\n rep(i, n - 1) {\n cin >> m[i];\n sm += m[i];\n rep(j, m[i]) {\n int tx, ty, tc;\n cin >> tx >> ty >> tc;\n x[i].push_back(tx);\n y[i].push_back(ty);\n c[i].push_back(tc);\n }\n }\n int g;\n cin >> g;\n\n MCF mcf(4 * sm + 2);\n int S = 4 * sm, T = S + 1;\n const ll inf = 100; //クラスは最大10個\n\n map<int, int> mp;\n int idx = 0;\n rep(i, n) {\n mp.clear();\n if (i > 0) rep(j, m[i - 1]) mp[y[i - 1][j]];\n if (i < n - 1) rep(j, m[i]) mp[x[i][j]];\n\n for (auto& elem : mp) elem.second = idx++;\n\n set<int> st;\n if (i > 0) rep(j, m[i - 1]) {\n y[i - 1][j] = mp[y[i - 1][j]];\n if (st.count(y[i - 1][j])) continue;\n st.insert(y[i - 1][j]);\n mcf.addedge(y[i - 1][j] + 2 * sm, y[i - 1][j], 1, 0);\n }\n if (i < n - 1) rep(j, m[i]) x[i][j] = mp[x[i][j]];\n\n auto itr = mp.begin();\n while (next(itr) != mp.end()) {\n mcf.addedge(itr->second, next(itr)->second, inf, 0);\n itr++;\n }\n }\n\n rep(i, n - 1) {\n set<int> st;\n if (i == 0) rep(j, m[i]) mcf.addedge(S, x[i][j], 1, 0); \n if (i == n - 2) rep(j, m[i]) {\n //if(st.count(y[i][j])) continue;\n //st.insert(y[i][j]);\n mcf.addedge(y[i][j], T, 1, 0);\n }\n\n //xからy(倍加頂点側)への辺\n rep(j, m[i]) mcf.addedge(x[i][j], y[i][j] + 2 * sm, 1, c[i][j]);\n }\n\n ll cost = 0;\n for (int flow = 1; flow <= g; flow++) {\n ll tc = mcf.mincostflow(S, T, 1);\n if (tc < 0) {\n cout << flow - 1 << \" \" << cost << endl;\n break;\n }\n cost += tc;\n }\n\n }\n\n return 0;\n}",
"accuracy": 0.3333333333333333,
"time_ms": 40,
"memory_kb": 4196,
"score_of_the_acc": -0.01,
"final_rank": 20
},
{
"submission_id": "aoj_1088_8463726",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define repd(i,a,b) for (ll i=(a);i<(b);i++)\n#define rep(i,n) repd(i,0,n)\n#define all(x) (x).begin(),(x).end()\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; }\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef vector<ll> vec;\ntypedef vector<vec> Graph;\nconst long long INF = 1LL<<60;\nconst long long MOD = 1000000007;\n\n//https://github.com/atcoder/ac-library\n#ifndef ATCODER_INTERNAL_CSR_HPP\n#define ATCODER_INTERNAL_CSR_HPP 1\n\n#include <algorithm>\n#include <utility>\n#include <vector>\n\nnamespace atcoder {\nnamespace internal {\n\ntemplate <class E> struct csr {\n std::vector<int> start;\n std::vector<E> elist;\n explicit csr(int n, const std::vector<std::pair<int, E>>& edges)\n : start(n + 1), elist(edges.size()) {\n for (auto e : edges) {\n start[e.first + 1]++;\n }\n for (int i = 1; i <= n; i++) {\n start[i] += start[i - 1];\n }\n auto counter = start;\n for (auto e : edges) {\n elist[counter[e.first]++] = e.second;\n }\n }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n#endif // ATCODER_INTERNAL_CSR_HPP\n\n#ifndef ATCODER_INTERNAL_QUEUE_HPP\n#define ATCODER_INTERNAL_QUEUE_HPP 1\n\n#include <vector>\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n#endif // ATCODER_INTERNAL_QUEUE_HPP\n\n#ifndef ATCODER_MINCOSTFLOW_HPP\n#define ATCODER_MINCOSTFLOW_HPP 1\n\n#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\nnamespace atcoder {\n\ntemplate <class Cap, class Cost> struct mcf_graph {\n public:\n mcf_graph() {}\n explicit mcf_graph(int n) : _n(n) {}\n\n int add_edge(int from, int to, Cap cap, Cost cost) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n assert(0 <= cost);\n int m = int(_edges.size());\n _edges.push_back({from, to, cap, 0, cost});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n Cost cost;\n };\n\n edge get_edge(int i) {\n int m = int(_edges.size());\n assert(0 <= i && i < m);\n return _edges[i];\n }\n std::vector<edge> edges() { return _edges; }\n\n std::pair<Cap, Cost> flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {\n return slope(s, t, flow_limit).back();\n }\n std::vector<std::pair<Cap, Cost>> slope(int s, int t) {\n return slope(s, t, std::numeric_limits<Cap>::max());\n }\n std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n int m = int(_edges.size());\n std::vector<int> edge_idx(m);\n\n auto g = [&]() {\n std::vector<int> degree(_n), redge_idx(m);\n std::vector<std::pair<int, _edge>> elist;\n elist.reserve(2 * m);\n for (int i = 0; i < m; i++) {\n auto e = _edges[i];\n edge_idx[i] = degree[e.from]++;\n redge_idx[i] = degree[e.to]++;\n elist.push_back({e.from, {e.to, -1, e.cap - e.flow, e.cost}});\n elist.push_back({e.to, {e.from, -1, e.flow, -e.cost}});\n }\n auto _g = internal::csr<_edge>(_n, elist);\n for (int i = 0; i < m; i++) {\n auto e = _edges[i];\n edge_idx[i] += _g.start[e.from];\n redge_idx[i] += _g.start[e.to];\n _g.elist[edge_idx[i]].rev = redge_idx[i];\n _g.elist[redge_idx[i]].rev = edge_idx[i];\n }\n return _g;\n }();\n\n auto result = slope(g, s, t, flow_limit);\n\n for (int i = 0; i < m; i++) {\n auto e = g.elist[edge_idx[i]];\n _edges[i].flow = _edges[i].cap - e.cap;\n }\n\n return result;\n }\n\n private:\n int _n;\n std::vector<edge> _edges;\n\n // inside edge\n struct _edge {\n int to, rev;\n Cap cap;\n Cost cost;\n };\n\n std::vector<std::pair<Cap, Cost>> slope(internal::csr<_edge>& g,\n int s,\n int t,\n Cap flow_limit) {\n // variants (C = maxcost):\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\n\n // dual_dist[i] = (dual[i], dist[i])\n std::vector<std::pair<Cost, Cost>> dual_dist(_n);\n std::vector<int> prev_e(_n);\n std::vector<bool> vis(_n);\n struct Q {\n Cost key;\n int to;\n bool operator<(Q r) const { return key > r.key; }\n };\n std::vector<int> que_min;\n std::vector<Q> que;\n auto dual_ref = [&]() {\n for (int i = 0; i < _n; i++) {\n dual_dist[i].second = std::numeric_limits<Cost>::max();\n }\n std::fill(vis.begin(), vis.end(), false);\n que_min.clear();\n que.clear();\n\n // que[0..heap_r) was heapified\n size_t heap_r = 0;\n\n dual_dist[s].second = 0;\n que_min.push_back(s);\n while (!que_min.empty() || !que.empty()) {\n int v;\n if (!que_min.empty()) {\n v = que_min.back();\n que_min.pop_back();\n } else {\n while (heap_r < que.size()) {\n heap_r++;\n std::push_heap(que.begin(), que.begin() + heap_r);\n }\n v = que.front().to;\n std::pop_heap(que.begin(), que.end());\n que.pop_back();\n heap_r--;\n }\n if (vis[v]) continue;\n vis[v] = true;\n if (v == t) break;\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\n // dist[v] >= 0 (all reduced cost are positive)\n // dist[v] <= (n-1)C\n Cost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second;\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\n auto e = g.elist[i];\n if (!e.cap) continue;\n // |-dual[e.to] + dual[v]| <= (n-1)C\n // cost <= C - -(n-1)C + 0 = nC\n Cost cost = e.cost - dual_dist[e.to].first + dual_v;\n if (dual_dist[e.to].second - dist_v > cost) {\n Cost dist_to = dist_v + cost;\n dual_dist[e.to].second = dist_to;\n prev_e[e.to] = e.rev;\n if (dist_to == dist_v) {\n que_min.push_back(e.to);\n } else {\n que.push_back(Q{dist_to, e.to});\n }\n }\n }\n }\n if (!vis[t]) {\n return false;\n }\n\n for (int v = 0; v < _n; v++) {\n if (!vis[v]) continue;\n // dual[v] = dual[v] - dist[t] + dist[v]\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) +\n // (shortest(s, v) + dual[s] - dual[v]) = - shortest(s,\n // t) + dual[t] + shortest(s, v) = shortest(s, v) -\n // shortest(s, t) >= 0 - (n-1)C\n dual_dist[v].first -= dual_dist[t].second - dual_dist[v].second;\n }\n return true;\n };\n Cap flow = 0;\n Cost cost = 0, prev_cost_per_flow = -1;\n std::vector<std::pair<Cap, Cost>> result = {{Cap(0), Cost(0)}};\n while (flow < flow_limit) {\n if (!dual_ref()) break;\n Cap c = flow_limit - flow;\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\n c = std::min(c, g.elist[g.elist[prev_e[v]].rev].cap);\n }\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\n auto& e = g.elist[prev_e[v]];\n e.cap += c;\n g.elist[e.rev].cap -= c;\n }\n Cost d = -dual_dist[s].first;\n flow += c;\n cost += c * d;\n if (prev_cost_per_flow == d) {\n result.pop_back();\n }\n result.push_back({flow, cost});\n prev_cost_per_flow = d;\n }\n return result;\n }\n};\n\n} // namespace atcoder\n\n#endif // ATCODER_MINCOSTFLOW_HPP\n\nusing namespace atcoder;\n\nint main()\n{ \n ios::sync_with_stdio(false);\n cin.tie(0);\n ll n;\n while(cin>>n){\n if(n==0)break;\n mcf_graph<ll,ll> g(n*40+1);\n vector<ll> memo={0};\n rep(i,n-1){\n ll m;cin>>m;\n vector<ll> old;\n swap(old,memo);\n map<ll,ll> mp;\n rep(j,m){\n ll a,b,c;\n cin>>a>>b>>c;\n ll cj=j;\n if(mp.count(b)){\n cj=mp[b];\n }\n else{\n mp[b]=j;\n }\n rep(k,old.size()){\n ll x=old[k];\n if(x<=a){\n g.add_edge(20+40*i+k,40*(i+1)+cj,1,c);\n }\n }\n if(cj==j)g.add_edge(40*(i+1)+j,40*(i+1)+j+20,1,0);\n memo.push_back(b);\n }\n }\n rep(i,20){\n g.add_edge(40*(n-1)+20+i,40*n,1,0);\n }\n ll G;cin>>G;\n auto[x,y]=g.flow(20,40*n,G);\n cout<<x<<\" \"<<y<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 10916,
"score_of_the_acc": -0.157,
"final_rank": 11
},
{
"submission_id": "aoj_1088_8448179",
"code_snippet": "#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\n\n#include <algorithm>\n#include <utility>\n#include <vector>\n\nnamespace atcoder {\nnamespace internal {\n\ntemplate <class E> struct csr {\n std::vector<int> start;\n std::vector<E> elist;\n explicit csr(int n, const std::vector<std::pair<int, E>>& edges)\n : start(n + 1), elist(edges.size()) {\n for (auto e : edges) {\n start[e.first + 1]++;\n }\n for (int i = 1; i <= n; i++) {\n start[i] += start[i - 1];\n }\n auto counter = start;\n for (auto e : edges) {\n elist[counter[e.first]++] = e.second;\n }\n }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <vector>\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace atcoder {\n\ntemplate <class Cap, class Cost> struct mcf_graph {\n public:\n mcf_graph() {}\n explicit mcf_graph(int n) : _n(n) {}\n\n int add_edge(int from, int to, Cap cap, Cost cost) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n assert(0 <= cost);\n int m = int(_edges.size());\n _edges.push_back({from, to, cap, 0, cost});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n Cost cost;\n };\n\n edge get_edge(int i) {\n int m = int(_edges.size());\n assert(0 <= i && i < m);\n return _edges[i];\n }\n std::vector<edge> edges() { return _edges; }\n\n std::pair<Cap, Cost> flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {\n return slope(s, t, flow_limit).back();\n }\n std::vector<std::pair<Cap, Cost>> slope(int s, int t) {\n return slope(s, t, std::numeric_limits<Cap>::max());\n }\n std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n int m = int(_edges.size());\n std::vector<int> edge_idx(m);\n\n auto g = [&]() {\n std::vector<int> degree(_n), redge_idx(m);\n std::vector<std::pair<int, _edge>> elist;\n elist.reserve(2 * m);\n for (int i = 0; i < m; i++) {\n auto e = _edges[i];\n edge_idx[i] = degree[e.from]++;\n redge_idx[i] = degree[e.to]++;\n elist.push_back({e.from, {e.to, -1, e.cap - e.flow, e.cost}});\n elist.push_back({e.to, {e.from, -1, e.flow, -e.cost}});\n }\n auto _g = internal::csr<_edge>(_n, elist);\n for (int i = 0; i < m; i++) {\n auto e = _edges[i];\n edge_idx[i] += _g.start[e.from];\n redge_idx[i] += _g.start[e.to];\n _g.elist[edge_idx[i]].rev = redge_idx[i];\n _g.elist[redge_idx[i]].rev = edge_idx[i];\n }\n return _g;\n }();\n\n auto result = slope(g, s, t, flow_limit);\n\n for (int i = 0; i < m; i++) {\n auto e = g.elist[edge_idx[i]];\n _edges[i].flow = _edges[i].cap - e.cap;\n }\n\n return result;\n }\n\n private:\n int _n;\n std::vector<edge> _edges;\n\n struct _edge {\n int to, rev;\n Cap cap;\n Cost cost;\n };\n\n std::vector<std::pair<Cap, Cost>> slope(internal::csr<_edge>& g,\n int s,\n int t,\n Cap flow_limit) {\n\n std::vector<std::pair<Cost, Cost>> dual_dist(_n);\n std::vector<int> prev_e(_n);\n std::vector<bool> vis(_n);\n struct Q {\n Cost key;\n int to;\n bool operator<(Q r) const { return key > r.key; }\n };\n std::vector<int> que_min;\n std::vector<Q> que;\n auto dual_ref = [&]() {\n for (int i = 0; i < _n; i++) {\n dual_dist[i].second = std::numeric_limits<Cost>::max();\n }\n std::fill(vis.begin(), vis.end(), false);\n que_min.clear();\n que.clear();\n\n size_t heap_r = 0;\n\n dual_dist[s].second = 0;\n que_min.push_back(s);\n while (!que_min.empty() || !que.empty()) {\n int v;\n if (!que_min.empty()) {\n v = que_min.back();\n que_min.pop_back();\n } else {\n while (heap_r < que.size()) {\n heap_r++;\n std::push_heap(que.begin(), que.begin() + heap_r);\n }\n v = que.front().to;\n std::pop_heap(que.begin(), que.end());\n que.pop_back();\n heap_r--;\n }\n if (vis[v]) continue;\n vis[v] = true;\n if (v == t) break;\n Cost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second;\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\n auto e = g.elist[i];\n if (!e.cap) continue;\n Cost cost = e.cost - dual_dist[e.to].first + dual_v;\n if (dual_dist[e.to].second - dist_v > cost) {\n Cost dist_to = dist_v + cost;\n dual_dist[e.to].second = dist_to;\n prev_e[e.to] = e.rev;\n if (dist_to == dist_v) {\n que_min.push_back(e.to);\n } else {\n que.push_back(Q{dist_to, e.to});\n }\n }\n }\n }\n if (!vis[t]) {\n return false;\n }\n\n for (int v = 0; v < _n; v++) {\n if (!vis[v]) continue;\n dual_dist[v].first -= dual_dist[t].second - dual_dist[v].second;\n }\n return true;\n };\n Cap flow = 0;\n Cost cost = 0, prev_cost_per_flow = -1;\n std::vector<std::pair<Cap, Cost>> result = {{Cap(0), Cost(0)}};\n while (flow < flow_limit) {\n if (!dual_ref()) break;\n Cap c = flow_limit - flow;\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\n c = std::min(c, g.elist[g.elist[prev_e[v]].rev].cap);\n }\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\n auto& e = g.elist[prev_e[v]];\n e.cap += c;\n g.elist[e.rev].cap -= c;\n }\n Cost d = -dual_dist[s].first;\n flow += c;\n cost += c * d;\n if (prev_cost_per_flow == d) {\n result.pop_back();\n }\n result.push_back({flow, cost});\n prev_cost_per_flow = d;\n }\n return result;\n }\n};\n\n} // namespace atcoder\n\n#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < n; ++i)\ntypedef long long ll;\nusing namespace atcoder;\nusing namespace std;\nconst int INF = 1e9;\n\nint id() {\n static int id = -2;\n id += 2;\n return id;\n}\n\nvoid solve(int N) {\n vector<set<int>> st(N);\n vector edges(N - 1, vector<tuple<int, int, int>>());\n rep(i, N - 1) {\n int M;\n cin >> M;\n rep(j, M) {\n int x, y, c;\n cin >> x >> y >> c;\n st[i].insert(x);\n st[i + 1].insert(y);\n edges[i].emplace_back(x, y, c);\n }\n }\n\n // [駅, 時間] -> id\n map<pair<int, int>, int> toid;\n rep(i, N) {\n for (int x : st[i]) {\n toid[{i, x}] = id();\n }\n }\n\n int s = id(), t = id();\n int id_size = id();\n mcf_graph<int, int> G(id_size);\n\n // 駅のinout\n for (int i = 0; i < id_size; i += 2) G.add_edge(i, i + 1, 1, 0);\n\n // s -> 0番目の駅\n for (int x : st[0]) G.add_edge(s, toid[{0, x}] + 1, INF, 0);\n\n // 駅間\n rep(i, N - 1) {\n for (auto &[x, y, c] : edges[i]) {\n G.add_edge(toid[{i, x}] + 1, toid[{i + 1, y}], 1, c);\n }\n }\n\n // 最後の駅 -> t\n for (int x : st[N - 1]) G.add_edge(toid[{N - 1, x}] + 1, t, INF, 0);\n\n // 駅で待機\n rep(i, N) {\n for (int x : st[i]) {\n for (int y : st[i]) {\n if (x <= y)\n G.add_edge(toid[{i, x}] + 1, toid[{i, y}] + 1, INF, 0);\n }\n }\n }\n\n int g;\n cin >> g;\n auto [max_flow, min_cost] = G.flow(s, t, g);\n cout << max_flow << \" \" << min_cost << endl;\n}\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n\n int N;\n while (cin >> N, N) solve(N);\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 10932,
"score_of_the_acc": -0.1572,
"final_rank": 12
},
{
"submission_id": "aoj_1088_8447998",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nstruct mcf{\n\tstruct edge{\n\t\tint from;\n\t\tint to;\n\t\tint rev;\n\t\tint cap;\n\t\tint cost;\n\t};\n\tint n;\n\tvector<edge> e;\n\tvector<vector<int>> ikeru;\n\n\tmcf(int _n) : n(_n) {\n\t\tikeru.resize(n);\n\t}\n\n\tvoid add_edge(int from, int to, int cap, int cost){\n\t\tint x = e.size();\n\t\te.push_back({from, to, x + 1, cap, cost});\n\t\te.push_back({to, from, x, 0, -cost});\n\t\tikeru[from].push_back(x);\n\t\tikeru[to].push_back(x + 1);\n\t}\n\n\tpair<int,int> flow(int st, int gl, int flw){\n\t\tvector<int> p(n, 0);\n\t\tint ans1 = 0;\n\t\tint ans2 = 0;\n\t\twhile(flw > 0){\n\t\t\tvector<int> d(n, 1e9);\n\t\t\tvector<int> c(n, -1);\n\t\t\td[st] = 0;\n\t\t\tpriority_queue<pair<int,int>> pq;\n\t\t\tpq.push(pair(0, st));\n\t\t\twhile(!pq.empty()){\n\t\t\t\tauto [tmp, i] = pq.top();\n\t\t\t\tpq.pop();\n\t\t\t\ttmp = -tmp;\n\t\t\t\tif (tmp > d[i]) continue;\n\t\t\t\tfor (int x: ikeru[i]){\n\t\t\t\t\tif (e[x].cap == 0) continue;\n\t\t\t\t\tint j = e[x].to;\n\t\t\t\t\tint targ = tmp + e[x].cost + p[i] - p[j];\n\t\t\t\t\tif (targ < d[j]){\n\t\t\t\t\t\td[j] = targ;\n\t\t\t\t\t\tc[j] = x;\n\t\t\t\t\t\tpq.push(pair(-d[j], j));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (d[gl] >= 1e9) break;\n\t\t\tfor (int i=0; i<n; i++){\n\t\t\t\tp[i] += d[i];\n\t\t\t}\n\t\t\tint nw = gl;\n\t\t\tint f = flw;\n\t\t\twhile(nw != st){\n\t\t\t\tf = min(f, e[c[nw]].cap);\n\t\t\t\tnw = e[c[nw]].from;\n\t\t\t}\n\t\t\tans1 += f;\n\t\t\tflw -= f;\n\t\t\tans2 += f * p[gl];\n\t\t\tnw = gl;\n\t\t\twhile(nw != st){\n\t\t\t\te[c[nw]].cap -= f;\n\t\t\t\te[e[c[nw]].rev].cap += f;\n\t\t\t\tnw = e[c[nw]].from;\n\t\t\t}\n\t\t}\n\t\treturn pair(ans1, ans2);\n\t}\n\n};\n\nvoid solve(int n){\n\tvector<vector<tuple<int,int,int>>> g(n-1, vector<tuple<int,int,int>>(0));\n\tvector<int> times;\n\n\tfor (int i=0; i<n-1; i++){\n\t\tint m; cin >> m;\n\t\tfor (int j=0; j<m; j++){\n\t\t\tint x, y, z; cin >> x >> y >> z;\n\t\t\tg[i].push_back(make_tuple(x, y, z));\n\t\t\ttimes.push_back(x);\n\t\t\ttimes.push_back(y);\n\t\t}\n\t}\n\n\tint f; cin >> f;\n\tsort(times.begin(), times.end());\n\ttimes.erase(unique(times.begin(), times.end()), times.end());\n\tint k = times.size();\n\n\n\tmcf flow(k*n*2 + 2);\n\n\tfor (int i=0; i<n; i++){\n\t\tfor (int j=0; j<k-1; j++){\n\t\t\tflow.add_edge(n*k+i*k+j, n*k+i*k+j+1, f, 0);\n\t\t}\n\t}\n\n\tfor (int i=0; i<n-1; i++){\n\t\tfor (int j=0; j<(int)g[i].size(); j++){\n\t\t\tflow.add_edge(\n\t\t\t\tn*k+i*k + lower_bound(times.begin(), times.end(), get<0>(g[i][j])) - times.begin(),\n\t\t\t\t(i+1)*k + lower_bound(times.begin(), times.end(), get<1>(g[i][j])) - times.begin(),\n\t\t\t\t1,\n\t\t\t\tget<2>(g[i][j])\n\t\t\t);\n\t\t}\n\t}\n\n\tfor (int i=0; i<n*k; i++){\n\t\tflow.add_edge(i, n*k+i, 1, 0);\n\t}\n\t\n\n\tflow.add_edge(2*k*n, k*n, f, 0);\n\tflow.add_edge(2*k*n-1, 2*k*n+1, f, 0);\n\t\n\tauto [ans1, ans2] = flow.flow(2*k*n, 2*k*n+1, f);\n\tcout << ans1 << ' ' << ans2 << '\\n';\n\n}\n\nint main(){\n\twhile(true){\n\t\tint n; cin >> n;\n\t\tif (n == 0) return 0;\n\t\tsolve(n);\n\t}\n}",
"accuracy": 1,
"time_ms": 1200,
"memory_kb": 60020,
"score_of_the_acc": -1.6545,
"final_rank": 15
},
{
"submission_id": "aoj_1088_8407469",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> pr;\ntypedef pair<pr, ll> prpl;\ntypedef pair<ll, pr> prlp;\ntypedef tuple<ll, ll, ll> tri;\ntypedef tuple<ll, ll, ll, ll, ll> cinq;\n\n\nconst ll INF = (ll)1e18;\n\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++) // for文の省略\n#define all(v) v.begin(), v.end() // 配列範囲の指定の省略。reverse()やsort()に入れる時便利\n#define pb push_back\n\n// 変数を宣言して入力を代入する所の省略\ntemplate<class... T>\nvoid input(T&... a){\n (cin >> ... >> a);\n}\n#define llin(...) ll __VA_ARGS__; input(__VA_ARGS__)\nvoid input_vector(vector<ll>& v, ll N){\n rep(i, N){\n cin >> v[i];\n }\n}\n#define vectin(v, N) vector<ll> v(N); input_vector(v, N)\ntemplate<class U>\nvoid input_graph(vector<vector<U>>& G, ll M, bool directed = false, bool weighted = false){\n rep(i, M){\n if(!weighted){\n ll A, B; cin >> A >> B;\n if(!directed){\n G[A].push_back(B);\n G[B].push_back(A);\n } else {\n G[A].push_back(B);\n }\n } else {\n ll A, B, cost; cin >> A >> B >> cost;\n if(!directed){\n G[A].push_back({B, cost});\n G[B].push_back({A, cost});\n } else {\n G[A].push_back({B, cost});\n }\n }\n }\n}\n#define graphin(G, N, M) vector<vector<ll>> G(N); input_graph(G, M)\n#define graphin_directed(G, N, M) vector<vector<ll>> G(N); input_graph(G, M, directed = true)\n#define graphin_weighted(G, N, M) vector<vector<pr>> G(N); input_graph(G, M, weighted = true)\n#define graphin_directed_weighted(G, N, M) vector<vector<pr>> G(N); input_graph(G, M, directed = true, weighted = true)\ntemplate<class U>\nvoid input_edge(vector<U> E, ll M, bool weighted = false){\n rep(i, M){\n if(!weighted){\n ll A, B; cin >> A >> B;\n E[i] = {A, B};\n } else {\n ll A, B, cost; cin >> A >> B >> cost;\n E[i] = {cost, {A, B}};\n }\n }\n if(weighted){\n sort(all(E));\n }\n}\n#define edgein(E, M) vector<pr> E(M); input_edge(E, M)\n#define edgein_weighted(E, M) vector<prlp> E(M); input_edge(E, M, weighted = true)\n\n\n// デバッグ処理の簡略化。「#define _DEBUG」行をコメントアウトするかどうかで処理を行うかどうか変えられる\nvoid debug_out() { cout << endl; }\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n cout << H << \" \";\n debug_out(T...);\n}\n#define _DEBUG\n#ifdef _DEBUG\n#define debug(...) debug_out(__VA_ARGS__)\n#else\n#define debug(...) \n#endif\n\n#ifndef H_make_vector\n#define H_make_vector\n\n/**\n * @brief 多次元 vector の作成\n * @author えびちゃん\n */\n\n#include <cstddef>\n#include <type_traits>\n#include <vector>\n\nnamespace detail {\n template <typename Tp, ll Nb>\n auto make_vector(std::vector<ll>& sizes, Tp const& x) {\n if constexpr (Nb == 1) {\n return vector(sizes[0], x);\n } else {\n ll size = sizes[Nb-1];\n sizes.pop_back();\n return vector(size, make_vector<Tp, Nb-1>(sizes, x));\n }\n }\n} // detail::\n\ntemplate <typename Tp, ll Nb>\nauto make_vector(ll const(&sizes)[Nb], Tp const& x = Tp()) {\n vector<ll> s(Nb);\n for (ll i = 0; i < Nb; ++i) s[i] = sizes[Nb-i-1];\n return detail::make_vector<Tp, Nb>(s, x);\n}\n\n#endif /* !defined(H_make_vector) */\n\ntemplate <typename S, typename T>\npair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {\n return make_pair(p.first + q.first, p.second + q.second);\n}\n \ntemplate <typename S, typename T>\npair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {\n return make_pair(p.first - q.first, p.second - q.second);\n}\n\nll Max_V = 6000;\n\nstruct edge{\n ll to, cap, cost, rev;\n};\nvector<vector<edge>> G(Max_V);\n\nvoid add_edge(ll from, ll to, ll cap, ll cost){\n G[from].pb((edge){to, cap, cost, (ll)G[to].size()});\n G[to].pb((edge){from, 0, -cost, (ll)G[from].size() - 1});\n}\n\nll min_cost_flow(vector<vector<edge>> G, ll s, ll t, ll f){\n vector<ll> h(Max_V), dist(Max_V), prevv(Max_V), preve(Max_V);\n ll res = 0;\n while(f > 0){\n priority_queue<pr, vector<pr>, greater<pr>> que;\n rep(i, Max_V){\n dist[i] = INF;\n }\n dist[s] = 0;\n que.push({0, s});\n while(!que.empty()){\n pr p = que.top(); que.pop();\n ll v = p.second;\n if(dist[v] < p.first) continue;\n rep(i, G[v].size()){\n edge &e = G[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]){\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v; preve[e.to] = i;\n que.push({dist[e.to], e.to});\n }\n }\n }\n if(dist[t] == INF){\n return -1;\n }\n rep(v, Max_V){\n h[v] += dist[v];\n }\n ll d = f;\n for(ll v = t; v != s; v = prevv[v]){\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for(ll v = t; v != s; v = prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nll find_aug_path_DFS(vector<bool> &used, vector<vector<edge>> &G, ll v, ll t, ll f){\n if(v == t) return f;\n used[v] = true;\n rep(i, G[v].size()){\n edge& e = G[v][i];\n if(!used[e.to] && e.cap > 0){\n ll d = find_aug_path_DFS(used, G, e.to, t, min(f, e.cap));\n if(d > 0){\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n}\n\nll max_flow_FF(vector<vector<edge>> G, ll s, ll t){\n vector<bool> used(Max_V, false);\n ll flow = 0;\n while(true){\n rep(i, Max_V){\n used[i] = false;\n }\n ll f = find_aug_path_DFS(used, G, s, t, INF);\n if(f == 0) return flow;\n flow += f;\n }\n}\n\nvector<ll> compress(vector<ll>& A){\n vector<ll> B = A;\n sort(B.begin(), B.end());\n B.erase(unique(B.begin(), B.end()), B.end());\n vector<ll> res(A.size());\n rep(i, A.size()){\n res[i] = lower_bound(B.begin(), B.end(), A[i]) - B.begin();\n }\n return res;\n}\n\nvoid solve(ll N){\n rep(i, Max_V){\n G[i] = {};\n }\n vector<vector<ll>> dia(N);\n vector<vector<cinq>> data(N - 1);\n rep(i, N - 1){\n ll M; cin >> M;\n rep(j, M){\n ll x, y, c; cin >> x >> y >> c;\n data[i].pb({x, y, c, (ll)dia[i].size(), (ll)dia[i + 1].size()});\n dia[i].pb(x);\n dia[i + 1].pb(y);\n }\n }\n rep(i, N){\n dia[i] = compress(dia[i]);\n }\n rep(i, N - 1){\n vector<bool> added(40);\n rep(j, data[i].size()){\n ll c = get<2>(data[i][j]), k = dia[i][get<3>(data[i][j])], l = dia[i + 1][get<4>(data[i][j])];\n add_edge(k + 60 * i, l + 60 * (i + 1) + 40, 1, c);\n if(!added[l]){\n add_edge(l + 60 * (i + 1) + 40, l + 60 * (i + 1), 1, 0);\n added[l] = true;\n }\n }\n }\n rep(i, N){\n rep(j, dia[i].size() - 1){\n add_edge(j + 60 * i, j + 1 + 60 * i, INF, 0);\n }\n }\n ll g; cin >> g;\n ll s = 0, t = dia[N - 1].size() - 1 + 60 * (N - 1);\n ll ff = max_flow_FF(G, s, t);\n ff = min(ff, g);\n ll cost = min_cost_flow(G, s, t, ff);\n cout << ff << \" \" << cost << endl;\n}\n\n\nint main(void){\n while(true){\n llin(N);\n if(N == 0) break;\n solve(N);\n }\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 5368,
"score_of_the_acc": -0.0835,
"final_rank": 9
},
{
"submission_id": "aoj_1088_8407289",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> pr;\ntypedef pair<pr, ll> prpl;\ntypedef pair<ll, pr> prlp;\ntypedef tuple<ll, ll, ll> tri;\ntypedef tuple<ll, ll, ll, ll, ll> cinq;\n\n\nconst ll INF = (ll)1e18;\n\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++) // for文の省略\n#define all(v) v.begin(), v.end() // 配列範囲の指定の省略。reverse()やsort()に入れる時便利\n#define pb push_back\n\n// 変数を宣言して入力を代入する所の省略\ntemplate<class... T>\nvoid input(T&... a){\n (cin >> ... >> a);\n}\n#define llin(...) ll __VA_ARGS__; input(__VA_ARGS__)\nvoid input_vector(vector<ll>& v, ll N){\n rep(i, N){\n cin >> v[i];\n }\n}\n#define vectin(v, N) vector<ll> v(N); input_vector(v, N)\ntemplate<class U>\nvoid input_graph(vector<vector<U>>& G, ll M, bool directed = false, bool weighted = false){\n rep(i, M){\n if(!weighted){\n ll A, B; cin >> A >> B;\n if(!directed){\n G[A].push_back(B);\n G[B].push_back(A);\n } else {\n G[A].push_back(B);\n }\n } else {\n ll A, B, cost; cin >> A >> B >> cost;\n if(!directed){\n G[A].push_back({B, cost});\n G[B].push_back({A, cost});\n } else {\n G[A].push_back({B, cost});\n }\n }\n }\n}\n#define graphin(G, N, M) vector<vector<ll>> G(N); input_graph(G, M)\n#define graphin_directed(G, N, M) vector<vector<ll>> G(N); input_graph(G, M, directed = true)\n#define graphin_weighted(G, N, M) vector<vector<pr>> G(N); input_graph(G, M, weighted = true)\n#define graphin_directed_weighted(G, N, M) vector<vector<pr>> G(N); input_graph(G, M, directed = true, weighted = true)\ntemplate<class U>\nvoid input_edge(vector<U> E, ll M, bool weighted = false){\n rep(i, M){\n if(!weighted){\n ll A, B; cin >> A >> B;\n E[i] = {A, B};\n } else {\n ll A, B, cost; cin >> A >> B >> cost;\n E[i] = {cost, {A, B}};\n }\n }\n if(weighted){\n sort(all(E));\n }\n}\n#define edgein(E, M) vector<pr> E(M); input_edge(E, M)\n#define edgein_weighted(E, M) vector<prlp> E(M); input_edge(E, M, weighted = true)\n\n\n// デバッグ処理の簡略化。「#define _DEBUG」行をコメントアウトするかどうかで処理を行うかどうか変えられる\nvoid debug_out() { cout << endl; }\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n cout << H << \" \";\n debug_out(T...);\n}\n#define _DEBUG\n#ifdef _DEBUG\n#define debug(...) debug_out(__VA_ARGS__)\n#else\n#define debug(...) \n#endif\n\n#ifndef H_make_vector\n#define H_make_vector\n\n/**\n * @brief 多次元 vector の作成\n * @author えびちゃん\n */\n\n#include <cstddef>\n#include <type_traits>\n#include <vector>\n\nnamespace detail {\n template <typename Tp, ll Nb>\n auto make_vector(std::vector<ll>& sizes, Tp const& x) {\n if constexpr (Nb == 1) {\n return vector(sizes[0], x);\n } else {\n ll size = sizes[Nb-1];\n sizes.pop_back();\n return vector(size, make_vector<Tp, Nb-1>(sizes, x));\n }\n }\n} // detail::\n\ntemplate <typename Tp, ll Nb>\nauto make_vector(ll const(&sizes)[Nb], Tp const& x = Tp()) {\n vector<ll> s(Nb);\n for (ll i = 0; i < Nb; ++i) s[i] = sizes[Nb-i-1];\n return detail::make_vector<Tp, Nb>(s, x);\n}\n\n#endif /* !defined(H_make_vector) */\n\ntemplate <typename S, typename T>\npair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {\n return make_pair(p.first + q.first, p.second + q.second);\n}\n \ntemplate <typename S, typename T>\npair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {\n return make_pair(p.first - q.first, p.second - q.second);\n}\n\nll Max_V = 6000;\n\nstruct edge{\n ll to, cap, cost, rev;\n};\n\nvector<vector<edge>> G1(Max_V), G2(Max_V);\nvector<ll> h(Max_V);\nvector<ll> dist(Max_V);\nvector<ll> prevv(Max_V), preve(Max_V);\n\nvoid add_edge(ll from, ll to, ll cap, ll cost){\n G1[from].pb((edge){to, cap, cost, (ll)G1[to].size()});\n G1[to].pb((edge){from, 0, -cost, (ll)G1[from].size() - 1});\n}\n\n\nll min_cost_flow(ll s, ll t, ll f){\n ll res = 0;\n rep(i, Max_V){\n h[i] = 0;\n }\n while(f > 0){\n priority_queue<pr, vector<pr>, greater<pr>> que;\n rep(i, Max_V){\n dist[i] = INF;\n }\n dist[s] = 0;\n que.push({0, s});\n while(!que.empty()){\n pr p = que.top(); que.pop();\n ll v = p.second;\n if(dist[v] < p.first) continue;\n rep(i, G2[v].size()){\n edge &e = G2[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]){\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v; preve[e.to] = i;\n que.push({dist[e.to], e.to});\n }\n }\n }\n if(dist[t] == INF){\n return -1;\n }\n rep(v, Max_V){\n h[v] += dist[v];\n }\n ll d = f;\n for(ll v = t; v != s; v = prevv[v]){\n d = min(d, G2[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for(ll v = t; v != s; v = prevv[v]){\n edge &e = G2[prevv[v]][preve[v]];\n e.cap -= d;\n G2[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\n\nvector<bool> used(Max_V, false);\n\nll find_aug_path_DFS(ll v, ll t, ll f){\n if(v == t) return f;\n used[v] = true;\n rep(i, G1[v].size()){\n edge& e = G1[v][i];\n if(!used[e.to] && e.cap > 0){\n ll d = find_aug_path_DFS(e.to, t, min(f, e.cap));\n if(d > 0){\n e.cap -= d;\n G1[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n}\n\nll max_flow_FF(ll s, ll t){\n ll flow = 0;\n while(true){\n rep(i, Max_V){\n used[i] = false;\n }\n ll f = find_aug_path_DFS(s, t, INF);\n if(f == 0) return flow;\n flow += f;\n }\n}\n\nvector<ll> compress(vector<ll>& A){\n vector<ll> B = A;\n sort(B.begin(), B.end());\n B.erase(unique(B.begin(), B.end()), B.end());\n vector<ll> res(A.size());\n rep(i, A.size()){\n res[i] = lower_bound(B.begin(), B.end(), A[i]) - B.begin();\n }\n return res;\n}\n\nvoid solve(ll N){\n rep(i, Max_V){\n G1[i] = {}; G2[i] = {};\n }\n vector<vector<ll>> dia(N);\n vector<vector<cinq>> data(N - 1);\n rep(i, N - 1){\n ll M; cin >> M;\n rep(j, M){\n ll x, y, c; cin >> x >> y >> c;\n data[i].pb({x, y, c, (ll)dia[i].size(), (ll)dia[i + 1].size()});\n dia[i].pb(x);\n dia[i + 1].pb(y);\n }\n }\n rep(i, N){\n dia[i] = compress(dia[i]);\n }\n rep(i, N - 1){\n vector<bool> added(40);\n rep(j, data[i].size()){\n ll c = get<2>(data[i][j]), k = dia[i][get<3>(data[i][j])], l = dia[i + 1][get<4>(data[i][j])];\n add_edge(k + 60 * i, l + 60 * (i + 1) + 40, 1, c);\n if(!added[l]){\n add_edge(l + 60 * (i + 1) + 40, l + 60 * (i + 1), 1, 0);\n added[l] = true;\n }\n }\n }\n rep(i, N){\n rep(j, dia[i].size() - 1){\n add_edge(j + 60 * i, j + 1 + 60 * i, INF, 0);\n }\n }\n G2 = G1;\n ll g; cin >> g;\n ll s = 0, t = dia[N - 1].size() - 1 + 60 * (N - 1);\n ll ff = max_flow_FF(s, t);\n ff = min(ff, g);\n ll cost = min_cost_flow(s, t, ff);\n cout << ff << \" \" << cost << endl;\n}\n\n\nint main(void){\n while(true){\n llin(N);\n if(N == 0) break;\n solve(N);\n }\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 5804,
"score_of_the_acc": -0.0886,
"final_rank": 10
},
{
"submission_id": "aoj_1088_8067000",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing pint = pair<int, int>;\nusing pll = pair<long long, long long>;\n\n// edge class (for network-flow)\ntemplate<class FLOWTYPE, class COSTTYPE> struct FlowCostEdge {\n // core members\n int rev, from, to;\n FLOWTYPE cap, icap, flow;\n COSTTYPE cost;\n \n // constructor\n FlowCostEdge(int rev, int from, int to, FLOWTYPE cap, COSTTYPE cost)\n : rev(rev), from(from), to(to), cap(cap), icap(cap), flow(0), cost(cost) {}\n void reset() { cap = icap, flow = 0; }\n \n // debug\n friend ostream& operator << (ostream& s, const FlowCostEdge& e) {\n return s << e.from << \" -> \" << e.to\n << \" (\" << e.flow << \"/\" << e.icap << \", \" << e.cost << \")\";\n }\n};\n\n// graph class (for network-flow)\ntemplate<class FLOWTYPE, class COSTTYPE> struct FlowCostGraph {\n // core members\n vector<vector<FlowCostEdge<FLOWTYPE, COSTTYPE>>> list;\n vector<pair<int,int>> pos; // pos[i] := {vertex, order of list[vertex]} of i-th edge\n \n // constructor\n FlowCostGraph(int n = 0) : list(n) { }\n void init(int n = 0) {\n list.assign(n, FlowCostEdge<FLOWTYPE, COSTTYPE>());\n pos.clear();\n }\n \n // getter\n vector<FlowCostEdge<FLOWTYPE, COSTTYPE>> &operator [] (int i) {\n return list[i];\n }\n const vector<FlowCostEdge<FLOWTYPE, COSTTYPE>> &operator [] (int i) const {\n return list[i];\n }\n size_t size() const {\n return list.size();\n }\n FlowCostEdge<FLOWTYPE, COSTTYPE> &get_rev_edge\n (const FlowCostEdge<FLOWTYPE, COSTTYPE> &e) {\n if (e.from != e.to) return list[e.to][e.rev];\n else return list[e.to][e.rev + 1];\n }\n FlowCostEdge<FLOWTYPE, COSTTYPE> &get_edge(int i) {\n return list[pos[i].first][pos[i].second];\n }\n const FlowCostEdge<FLOWTYPE, COSTTYPE> &get_edge(int i) const {\n return list[pos[i].first][pos[i].second];\n }\n vector<FlowCostEdge<FLOWTYPE, COSTTYPE>> get_edges() const {\n vector<FlowCostEdge<FLOWTYPE, COSTTYPE>> edges;\n for (int i = 0; i < (int)pos.size(); ++i) {\n edges.push_back(get_edge(i));\n }\n return edges;\n }\n \n // change edges\n void reset() {\n for (int i = 0; i < (int)list.size(); ++i) {\n for (FlowCostEdge<FLOWTYPE, COSTTYPE> &e : list[i]) e.reset();\n }\n }\n \n // add_edge\n void add_edge(int from, int to, FLOWTYPE cap, COSTTYPE cost) {\n pos.emplace_back(from, (int)list[from].size());\n list[from].push_back(FlowCostEdge<FLOWTYPE, COSTTYPE>\n ((int)list[to].size(), from, to, cap, cost));\n list[to].push_back(FlowCostEdge<FLOWTYPE, COSTTYPE>\n ((int)list[from].size() - 1, to, from, 0, -cost));\n }\n\n // debug\n friend ostream& operator << (ostream& s, const FlowCostGraph &G) {\n const auto &edges = G.get_edges();\n for (const auto &e : edges) s << e << endl;\n return s;\n }\n};\n\n// min-cost max-flow (<= limit_flow), slope ver.\ntemplate<class FLOWTYPE, class COSTTYPE> vector<pair<FLOWTYPE, COSTTYPE>>\nMinCostFlowSlope(FlowCostGraph<FLOWTYPE, COSTTYPE> &G, int S, int T, FLOWTYPE limit_flow)\n{\n // result values\n FLOWTYPE cur_flow = 0;\n COSTTYPE cur_cost = 0, pre_cost = -1;\n vector<pair<FLOWTYPE, COSTTYPE>> res;\n res.emplace_back(cur_flow, cur_cost);\n \n // intermediate values\n vector<COSTTYPE> dual((int)G.size(), 0), dist((int)G.size());\n vector<int> prevv((int)G.size(), -1), preve((int)G.size(), -1);\n \n // dual\n auto dual_step = [&]() -> bool {\n priority_queue<pair<COSTTYPE,int>, vector<pair<COSTTYPE,int>>, greater<pair<COSTTYPE,int>>> que;\n que.push({0, S});\n dist.assign((int)G.size(), numeric_limits<COSTTYPE>::max());\n dist[S] = 0;\n while (!que.empty()) {\n auto [cur_cost, v] = que.top();\n que.pop();\n if (dist[v] < cur_cost) continue;\n for (int i = 0; i < (int)G[v].size(); ++i) {\n const auto &e = G[v][i];\n COSTTYPE new_cost = e.cost + dual[v] - dual[e.to];\n if (e.cap > 0 && dist[e.to] > dist[v] + new_cost) {\n dist[e.to] = dist[v] + new_cost;\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push({dist[e.to], e.to});\n }\n }\n }\n if (dist[T] == numeric_limits<COSTTYPE>::max()) return false;\n for (int v = 0; v < (int)G.size(); ++v) {\n if (dist[T] == numeric_limits<COSTTYPE>::max()) continue;\n dual[v] -= dist[T] - dist[v];\n }\n return true;\n };\n \n // primal\n auto primal_step = [&]() -> void {\n FLOWTYPE flow = limit_flow - cur_flow;\n COSTTYPE cost = -dual[S];\n for (int v = T; v != S; v = prevv[v]) {\n flow = min(flow, G[prevv[v]][preve[v]].cap);\n }\n for (int v = T; v != S; v = prevv[v]) {\n FlowCostEdge<FLOWTYPE, COSTTYPE> &e = G[prevv[v]][preve[v]];\n FlowCostEdge<FLOWTYPE, COSTTYPE> &re = G.get_rev_edge(e);\n e.cap -= flow, e.flow += flow;\n re.cap += flow, re.flow -= flow;\n }\n cur_flow += flow;\n cur_cost += flow * cost;\n if (pre_cost == cost) res.pop_back();\n res.emplace_back(cur_flow, cur_cost);\n pre_cost = cur_cost;\n };\n \n // primal-dual\n while (cur_flow < limit_flow) {\n if (!dual_step()) break;\n primal_step();\n }\n return res;\n}\n\n// min-cost max-flow, slope ver.\ntemplate<class FLOWTYPE, class COSTTYPE> vector<pair<FLOWTYPE, COSTTYPE>>\nMinCostFlowSlope(FlowCostGraph<FLOWTYPE, COSTTYPE> &G, int S, int T)\n{\n return MinCostFlowSlope(G, S, T, numeric_limits<FLOWTYPE>::max());\n}\n\n// min-cost max-flow (<= limit_flow)\ntemplate<class FLOWTYPE, class COSTTYPE> pair<FLOWTYPE, COSTTYPE>\nMinCostFlow(FlowCostGraph<FLOWTYPE, COSTTYPE> &G, int S, int T, FLOWTYPE limit_flow)\n{\n return MinCostFlowSlope(G, S, T, limit_flow).back();\n}\n\n// min-cost max-flow (<= limit_flow)\ntemplate<class FLOWTYPE, class COSTTYPE> pair<FLOWTYPE, COSTTYPE>\nMinCostFlow(FlowCostGraph<FLOWTYPE, COSTTYPE> &G, int S, int T)\n{\n return MinCostFlow(G, S, T, numeric_limits<FLOWTYPE>::max());\n}\n\nint main() {\n int N, maxF;\n while (cin >> N, N) {\n // 入力\n vector<int> M(N-1);\n vector<vector<int>> X(N-1), Y(N-1), C(N-1);\n \n // (駅, 時刻) → 入って来る側の頂点番号\n map<pint, int> index;\n int vertex_num = 0;\n \n // 各駅の到着時刻と発車時刻\n vector<set<int>> intime(N), outtime(N);\n \n // 入力受け取り\n for (int i = 0; i < N-1; ++i) {\n cin >> M[i];\n X[i].resize(M[i]), Y[i].resize(M[i]), C[i].resize(M[i]);\n for (int j = 0; j < M[i]; ++j) {\n cin >> X[i][j] >> Y[i][j] >> C[i][j];\n outtime[i].insert(X[i][j]);\n intime[i+1].insert(Y[i][j]);\n if (!index.count(pint(i, X[i][j]))) {\n index[pint(i, X[i][j])] = vertex_num;\n vertex_num += 2;\n }\n if (!index.count(pint(i+1, Y[i][j]))) {\n index[pint(i+1, Y[i][j])] = vertex_num;\n vertex_num += 2;\n }\n }\n }\n cin >> maxF;\n \n // グラフを構築\n int source = vertex_num++, sink = vertex_num++;\n FlowCostGraph<int, int> G(vertex_num);\n const int INF = maxF; // 理論上流せる上限\n\n // ソース → 最初の駅\n for (auto t : outtime[0]) {\n G.add_edge(source, index[pint(0, t)] + 1, INF, 0);\n }\n \n // 最後の駅 → シンク\n for (auto t : intime[N-1]) {\n G.add_edge(index[pint(N-1, t)] + 1, sink, INF, 0);\n }\n \n // 各駅の intime (容量 1) を分裂\n for (int i = 0; i < N; ++i) {\n for (auto t : intime[i]) {\n G.add_edge(index[pint(i, t)], index[pint(i, t)] + 1, 1, 0);\n }\n }\n \n // 各駅の intime -> outtime\n for (int i = 0; i < N; ++i) {\n for (auto t1 : intime[i]) {\n for (auto t2 : outtime[i]) {\n if (t1 <= t2) {\n G.add_edge(index[pint(i, t1)] + 1, index[pint(i, t2)] + 1, INF, 0);\n }\n }\n }\n }\n \n // 各電車\n for (int i = 0; i < N-1; ++i) {\n for (int j = 0; j < X[i].size(); ++j) {\n G.add_edge(index[pint(i, X[i][j])] + 1, index[pint(i+1, Y[i][j])], 1, C[i][j]);\n }\n }\n\n // 最小費用最大流を流す\n auto [max_flow, min_cost] = MinCostFlow(G, source, sink, maxF);\n cout << max_flow << \" \" << min_cost << endl;\n }\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 4096,
"score_of_the_acc": -0.0345,
"final_rank": 6
},
{
"submission_id": "aoj_1088_8023463",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing pl = pair<ll, ll>;\n#define vl vector<ll>\n#define vvl vector<vector<ll>>\n#define vvvl vector<vector<vector<ll>>>\n#define vm vector<mint>\n#define vvm vector<vector<mint>>\n#define vvvm vector<vector<vector<mint>>>\n#define vd vector<double>\n#define vvd vector<vector<double>>\n#define vvvd vector<vector<vector<double>>>\n#define vp vector<pl>\n#define vvp vector<vector<pl>>\n#define vs vector<string>\n#define vvs vector<vector<string>>\n\n#define _overload3(_1, _2, _3, name, ...) name\n#define _rep(i, n) repi(i, 0, n)\n#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)\n#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)\n#define all(x) std::begin(x), std::end(x)\n#define make_unique(v) v.erase(unique(all(v)), v.end());\n#define sum(...) accumulate(all(__VA_ARGS__), 0LL)\n#define inf (0x1fffffffffffffff)\n\ntemplate <class T>\nistream& operator>>(istream& is, vector<T>& v) {\n for (auto& x : v) {\n is >> x;\n }\n return is;\n}\n\ntemplate <class T>\nostream& operator<<(ostream& os, const vector<T>& v) {\n for (int i = 0; i < (int)v.size(); i++) {\n if (i != (int)v.size() - 1) os << v[i] << \" \";\n else os << v[i];\n }\n return os;\n}\n\ntemplate <typename T, typename... Args>\nauto make_v(T x, int arg, Args... args) {\n if constexpr (sizeof...(args) == 0) return vector<T>(arg, x);\n else return vector(arg, make_v<T>(x, args...));\n}\n\ntemplate <class T>\nauto min(const T& a) {\n return *min_element(all(a));\n}\n\ntemplate <class T>\nauto max(const T& a) {\n return *max_element(all(a));\n}\n\ntemplate <class T>\nbool chmin(T& a, const T& b) {\n return a > b ? a = b, true : false;\n}\n\ntemplate <class T>\nbool chmax(T& a, const T& b) {\n return a < b ? a = b, true : false;\n}\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n// struct MinCostFlow {\n// using P = pair<int, int>;\n// const int INF = 1000000000;\n// struct Edge {\n// int to, rev_idx, cap, cost;\n// };\n// int N;\n// vector<vector<Edge>> G;\n// vector<int> h, dist, prev_v, prev_e;\n\n// MinCostFlow(int N) : N(N), G(N), h(N), dist(N), prev_v(N), prev_e(N) {}\n\n// void add_edge(int from, int to, int cap, int cost) {\n// G[from].emplace_back((Edge){to, (int)G[to].size(), cap, cost});\n// G[to].emplace_back((Edge){from, (int)G[from].size() - 1, 0, -cost});\n// }\n\n// int min_cost_flow(int s, int t, int f) {\n// int res = 0;\n// h.assign(N, 0);\n// while(f > 0){\n// priority_queue<P, vector<P>, greater<P>> que;\n// dist.assign(N, INF);\n// dist[s] = 0;\n// que.emplace(0, s);\n// while(!que.empty()){\n// auto [d, v] = que.top(); que.pop();\n// if(dist[v] < d) continue;\n// for(int i = 0; i < G[v].size(); i++){\n// auto &e = G[v][i];\n// if(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]){\n// dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n// prev_v[e.to] = v;\n// prev_e[e.to] = i;\n// que.emplace(dist[e.to], e.to); \n// }\n// }\n// }\n// if(dist[t] == INF){\n// return -1;\n// }\n// for(int i = 0; i < N; i++) h[i] = dist[i];\n\n// int d = f;\n// for(int cur = t; cur != s; cur = prev_v[cur]){\n// d = min(d, G[prev_v[cur]][prev_e[cur]].cap);\n// }\n// f -= d;\n// res += d * h[t];\n// for (int cur = t; cur != s; cur = prev_v[cur]) {\n// auto &e = G[prev_v[cur]][prev_e[cur]];\n// e.cap -= d;\n// G[cur][e.rev_idx].cap += d;\n// }\n// }\n// return res;\n// }\n// };\n#line 1 \"graph/flow/primal-dual.hpp\"\n/**\n * @brief Primal Dual(最小費用流)\n * @docs docs/primal-dual.md\n */\ntemplate <typename flow_t, typename cost_t>\nstruct PrimalDual {\n struct edge {\n int to;\n flow_t cap;\n cost_t cost;\n int rev;\n bool isrev;\n };\n\n vector<vector<edge>> graph;\n vector<cost_t> potential, min_cost;\n vector<int> prevv, preve;\n const cost_t INF;\n\n PrimalDual(int V) : graph(V), INF(numeric_limits<cost_t>::max()) {}\n\n void add_edge(int from, int to, flow_t cap, cost_t cost) {\n graph[from].emplace_back(\n (edge){to, cap, cost, (int)graph[to].size(), false});\n graph[to].emplace_back(\n (edge){from, 0, -cost, (int)graph[from].size() - 1, true});\n }\n\n cost_t min_cost_flow(int s, int t, flow_t f) {\n int V = (int)graph.size();\n cost_t ret = 0;\n using Pi = pair<cost_t, int>;\n priority_queue<Pi, vector<Pi>, greater<Pi>> que;\n potential.assign(V, 0);\n preve.assign(V, -1);\n prevv.assign(V, -1);\n\n while (f > 0) {\n min_cost.assign(V, INF);\n que.emplace(0, s);\n min_cost[s] = 0;\n while (!que.empty()) {\n Pi p = que.top();\n que.pop();\n if (min_cost[p.second] < p.first) continue;\n for (int i = 0; i < (int)graph[p.second].size(); i++) {\n edge& e = graph[p.second][i];\n cost_t nextCost = min_cost[p.second] + e.cost +\n potential[p.second] - potential[e.to];\n if (e.cap > 0 && min_cost[e.to] > nextCost) {\n min_cost[e.to] = nextCost;\n prevv[e.to] = p.second, preve[e.to] = i;\n que.emplace(min_cost[e.to], e.to);\n }\n }\n }\n if (min_cost[t] == INF) return -1;\n for (int v = 0; v < V; v++) potential[v] += min_cost[v];\n flow_t addflow = f;\n for (int v = t; v != s; v = prevv[v]) {\n addflow = min(addflow, graph[prevv[v]][preve[v]].cap);\n }\n f -= addflow;\n ret += addflow * potential[t];\n for (int v = t; v != s; v = prevv[v]) {\n edge& e = graph[prevv[v]][preve[v]];\n e.cap -= addflow;\n graph[v][e.rev].cap += addflow;\n }\n }\n return ret;\n }\n\n void output() {\n for (int i = 0; i < graph.size(); i++) {\n for (auto& e : graph[i]) {\n if (e.isrev) continue;\n auto& rev_e = graph[e.to][e.rev];\n cout << i << \"->\" << e.to << \" (flow: \" << rev_e.cap << \"/\"\n << rev_e.cap + e.cap << \")\" << endl;\n }\n }\n }\n};\n\nusing MinCostFlow = PrimalDual<int, int>;\n\nint main(){\n // MinCostFlow mincostflow(4);\n // mincostflow.add_edge(0, 1, 2, 1);\n // mincostflow.add_edge(0, 2, 3, 1);\n // mincostflow.add_edge(1, 2, 1, 1);\n // mincostflow.add_edge(1, 3, 1, 1);\n // mincostflow.add_edge(2, 3, 4, 1);\n // cout << mincostflow.min_cost_flow(0, 3, 4) << endl;\n while(true){\n ll n;\n cin >> n;\n if(n == 0) break;\n vl m(n - 1);\n vvl x(n - 1), y(n - 1), c(n - 1);\n ll s = 1;\n vector<map<int, int>> vin(n - 1), vout(n - 1);\n rep(i, n - 1){\n cin >> m[i];\n x[i].resize(m[i]);\n y[i].resize(m[i]);\n c[i].resize(m[i]);\n rep(j, m[i]){\n cin >> x[i][j] >> y[i][j] >> c[i][j];\n if(vin[i][y[i][j]] == 0){\n vin[i][y[i][j]] = s; s++;\n vout[i][y[i][j]] = s; s++;\n }\n }\n }\n s += 1;\n int g;\n cin >> g;\n ll ans_g = 0, ans_c = 0;\n for(int cl = g; cl >= 1; --cl){\n MinCostFlow mcf(s);\n ll s1 = 0, sn = s - 1;\n rep(i, m[0]) {\n mcf.add_edge(s1, vin[0][y[0][i]], 1, 0);\n }\n rep(i, n - 1) {\n set<ll> used;\n rep(j, m[i]){\n if(used.find(y[i][j]) == used.end()){\n mcf.add_edge(vin[i][y[i][j]], vout[i][y[i][j]], 1, 0);\n used.insert(y[i][j]);\n }\n }\n if (i == n - 2) {\n rep(j, m[i]) { mcf.add_edge(vout[i][y[i][j]], sn, 1, c[i][j]); }\n continue;\n }\n rep(j, m[i]) {\n rep(k, m[i + 1]) {\n if (y[i][j] <= x[i + 1][k]) {\n mcf.add_edge(vout[i][y[i][j]], vin[i + 1][y[i + 1][k]], 1, c[i][j]);\n }\n }\n }\n }\n int res = mcf.min_cost_flow(s1, sn, cl);\n if (res != -1) {\n ans_g = cl;\n ans_c = res;\n break;\n }\n }\n cout << ans_g << \" \" << ans_c << endl;\n }\n}",
"accuracy": 1,
"time_ms": 420,
"memory_kb": 6356,
"score_of_the_acc": -0.3601,
"final_rank": 14
},
{
"submission_id": "aoj_1088_7745988",
"code_snippet": "//\n// 最小費用最大流 (正辺のみ)\n//\n// verified\n// AOJ 1088 School Excursion\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1088\n//\n\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing pint = pair<int, int>;\nusing pll = pair<long long, long long>;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\n#define REP(i, n) for (long long i = 0; i < (long long)(n); ++i)\n#define REP2(i, a, b) for (long long i = a; i < (long long)(b); ++i)\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\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, deque<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 T> ostream& operator << (ostream &s, set<T> P)\n{ for(auto it : P) { s << \"<\" << it << \"> \"; } return s; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\n{ for(auto it : P) { s << \"<\" << it.first << \"->\" << it.second << \"> \"; } return s; }\n\n\n// edge class (for network-flow)\ntemplate<class FLOWTYPE, class COSTTYPE> struct Edge {\n int rev, from, to, id;\n FLOWTYPE cap, icap;\n COSTTYPE cost;\n Edge(int r, int f, int t, FLOWTYPE ca, COSTTYPE co, int id = -1) :\n rev(r), from(f), to(t), cap(ca), icap(ca), cost(co), id(id) {}\n friend ostream& operator << (ostream& s, const Edge& E) {\n if (E.cap > 0)\n return s << E.from << \"->\" << E.to <<\n '(' << E.cap << ',' << E.cost << ')';\n else return s;\n }\n};\n\n// graph class (for network-flow)\ntemplate<class FLOWTYPE, class COSTTYPE> struct Graph {\n vector<vector<Edge<FLOWTYPE, COSTTYPE> > > list;\n \n Graph(int n = 0) : list(n) { }\n void init(int n = 0) { list.clear(); list.resize(n); }\n void reset() { for (int i = 0; i < (int)list.size(); ++i) for (int j = 0; j < list[i].size(); ++j) list[i][j].cap = list[i][j].icap; }\n inline vector<Edge<FLOWTYPE, COSTTYPE> >& operator [] (int i) { return list[i]; }\n inline const size_t size() const { return list.size(); }\n \n inline Edge<FLOWTYPE, COSTTYPE> &redge(const Edge<FLOWTYPE, COSTTYPE> &e) {\n if (e.from != e.to) return list[e.to][e.rev];\n else return list[e.to][e.rev + 1];\n }\n \n void addedge(int from, int to, FLOWTYPE cap, COSTTYPE cost, int id = -1) {\n list[from].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[to].size(), from, to, cap, cost, id));\n list[to].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[from].size() - 1, to, from, 0, -cost));\n }\n \n void add_undirected_edge(int from, int to, FLOWTYPE cap, COSTTYPE cost, int id = -1) {\n list[from].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[to].size(), from, to, cap, cost, id));\n list[to].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[from].size() - 1, to, from, cap, cost, id));\n }\n\n friend ostream& operator << (ostream& s, const Graph& G) {\n s << endl;\n for (int i = 0; i < G.size(); ++i) {\n s << i << \":\";\n for (auto e : G.list[i]) s << \" \" << e;\n s << endl;\n }\n return s;\n }\n};\n\n// min-cost max-flow (by primal-dual), maxf is the upper-limit of flow\ntemplate<class FLOWTYPE, class COSTTYPE> pair<FLOWTYPE, COSTTYPE> MinCostMaxFlow\n (Graph<FLOWTYPE, COSTTYPE> &G, int s, int t, FLOWTYPE maxf) {\n int n = (int)G.size();\n vector<COSTTYPE> pot(n, 0), dist(n, -1);\n vector<int> prevv(n), preve(n);\n FLOWTYPE f = maxf;\n COSTTYPE res = 0;\n while (f > 0) {\n priority_queue<pair<COSTTYPE,int>, vector<pair<COSTTYPE,int> >, greater<pair<COSTTYPE,int> > > que;\n dist.assign(n, -1);\n dist[s] = 0;\n que.push(make_pair(0,s));\n while(!que.empty()) {\n pair<COSTTYPE,int> p = que.top();\n que.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n for (int i = 0; i < G[v].size(); ++i) {\n auto e = G[v][i];\n if (e.cap > 0 && (dist[e.to] < 0 || dist[e.to] > dist[v] + e.cost + pot[v] - pot[e.to])) {\n dist[e.to] = dist[v] + e.cost + pot[v] - pot[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(make_pair(dist[e.to], e.to));\n }\n }\n }\n if (dist[t] < 0) return {maxf - f, res};\n for (int v = 0; v < n; ++v) pot[v] += dist[v];\n FLOWTYPE d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += pot[t] * d;\n for (int v = t; v != s; v = prevv[v]) {\n Edge<FLOWTYPE,COSTTYPE> &e = G[prevv[v]][preve[v]];\n Edge<FLOWTYPE,COSTTYPE> &re = G.redge(e);\n e.cap -= d;\n re.cap += d;\n }\n }\n return {maxf, res};\n}\n\nint main() {\n int N, maxF;\n while (cin >> N, N) {\n // 入力\n vector<int> M(N-1);\n vector<vector<int>> X(N-1), Y(N-1), C(N-1);\n \n // (駅, 時刻) → 入って来る側の頂点番号\n map<pint, int> index;\n int vertex_num = 0;\n \n // 各駅の到着時刻と発車時刻\n vector<set<int>> intime(N), outtime(N);\n \n // 入力受け取り\n for (int i = 0; i < N-1; ++i) {\n cin >> M[i];\n X[i].resize(M[i]), Y[i].resize(M[i]), C[i].resize(M[i]);\n for (int j = 0; j < M[i]; ++j) {\n cin >> X[i][j] >> Y[i][j] >> C[i][j];\n outtime[i].insert(X[i][j]);\n intime[i+1].insert(Y[i][j]);\n if (!index.count(pint(i, X[i][j]))) {\n index[pint(i, X[i][j])] = vertex_num;\n vertex_num += 2;\n }\n if (!index.count(pint(i+1, Y[i][j]))) {\n index[pint(i+1, Y[i][j])] = vertex_num;\n vertex_num += 2;\n }\n }\n }\n cin >> maxF;\n \n // グラフを構築\n int source = vertex_num++, sink = vertex_num++;\n Graph<int, int> G(vertex_num);\n const int INF = maxF; // 理論上流せる上限\n\n // ソース → 最初の駅\n for (auto t : outtime[0]) {\n G.addedge(source, index[pint(0, t)] + 1, INF, 0);\n }\n \n // 最後の駅 → シンク\n for (auto t : intime[N-1]) {\n G.addedge(index[pint(N-1, t)] + 1, sink, INF, 0);\n }\n \n // 各駅の intime (容量 1) を分裂\n for (int i = 0; i < N; ++i) {\n for (auto t : intime[i]) {\n G.addedge(index[pint(i, t)], index[pint(i, t)] + 1, 1, 0);\n }\n }\n \n // 各駅の intime -> outtime\n for (int i = 0; i < N; ++i) {\n for (auto t1 : intime[i]) {\n for (auto t2 : outtime[i]) {\n if (t1 <= t2) {\n G.addedge(index[pint(i, t1)] + 1, index[pint(i, t2)] + 1, INF, 0);\n }\n }\n }\n }\n \n // 各電車\n for (int i = 0; i < N-1; ++i) {\n for (int j = 0; j < X[i].size(); ++j) {\n G.addedge(index[pint(i, X[i][j])] + 1, index[pint(i+1, Y[i][j])], 1, C[i][j]);\n }\n }\n\n // 最小費用最大流を流す\n auto res = MinCostMaxFlow(G, source, sink, maxF);\n cout << res.first << \" \" << res.second << endl;\n }\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 4216,
"score_of_the_acc": -0.0359,
"final_rank": 7
},
{
"submission_id": "aoj_1088_7745984",
"code_snippet": "//\n// 最小費用最大流 (正辺のみ)\n//\n// verified\n// AOJ 1088 School Excursion\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1088\n//\n\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing pint = pair<int, int>;\nusing pll = pair<long long, long long>;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\n#define REP(i, n) for (long long i = 0; i < (long long)(n); ++i)\n#define REP2(i, a, b) for (long long i = a; i < (long long)(b); ++i)\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\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, deque<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 T> ostream& operator << (ostream &s, set<T> P)\n{ for(auto it : P) { s << \"<\" << it << \"> \"; } return s; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\n{ for(auto it : P) { s << \"<\" << it.first << \"->\" << it.second << \"> \"; } return s; }\n\n\n// edge class (for network-flow)\ntemplate<class FLOWTYPE, class COSTTYPE> struct Edge {\n int rev, from, to, id;\n FLOWTYPE cap, icap;\n COSTTYPE cost;\n Edge(int r, int f, int t, FLOWTYPE ca, COSTTYPE co, int id = -1) :\n rev(r), from(f), to(t), cap(ca), icap(ca), cost(co), id(id) {}\n friend ostream& operator << (ostream& s, const Edge& E) {\n if (E.cap > 0)\n return s << E.from << \"->\" << E.to <<\n '(' << E.cap << ',' << E.cost << ')';\n else return s;\n }\n};\n\n// graph class (for network-flow)\ntemplate<class FLOWTYPE, class COSTTYPE> struct Graph {\n vector<vector<Edge<FLOWTYPE, COSTTYPE> > > list;\n \n Graph(int n = 0) : list(n) { }\n void init(int n = 0) { list.clear(); list.resize(n); }\n void reset() { for (int i = 0; i < (int)list.size(); ++i) for (int j = 0; j < list[i].size(); ++j) list[i][j].cap = list[i][j].icap; }\n inline vector<Edge<FLOWTYPE, COSTTYPE> >& operator [] (int i) { return list[i]; }\n inline const size_t size() const { return list.size(); }\n \n inline Edge<FLOWTYPE, COSTTYPE> &redge(const Edge<FLOWTYPE, COSTTYPE> &e) {\n if (e.from != e.to) return list[e.to][e.rev];\n else return list[e.to][e.rev + 1];\n }\n \n void addedge(int from, int to, FLOWTYPE cap, COSTTYPE cost, int id = -1) {\n list[from].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[to].size(), from, to, cap, cost, id));\n list[to].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[from].size() - 1, to, from, 0, -cost));\n }\n \n void add_undirected_edge(int from, int to, FLOWTYPE cap, COSTTYPE cost, int id = -1) {\n list[from].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[to].size(), from, to, cap, cost, id));\n list[to].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[from].size() - 1, to, from, cap, cost, id));\n }\n\n friend ostream& operator << (ostream& s, const Graph& G) {\n s << endl;\n for (int i = 0; i < G.size(); ++i) {\n s << i << \":\";\n for (auto e : G.list[i]) s << \" \" << e;\n s << endl;\n }\n return s;\n }\n};\n\n// min-cost max-flow (by primal-dual), maxf is the upper-limit of flow\ntemplate<class FLOWTYPE, class COSTTYPE> pair<FLOWTYPE, COSTTYPE> MinCostMaxFlow\n (Graph<FLOWTYPE, COSTTYPE> &G, int s, int t, FLOWTYPE maxf) {\n int n = (int)G.size();\n vector<COSTTYPE> pot(n, 0), dist(n, -1);\n vector<int> prevv(n), preve(n);\n FLOWTYPE f = maxf;\n COSTTYPE res = 0;\n while (f > 0) {\n priority_queue<pair<COSTTYPE,int>, vector<pair<COSTTYPE,int> >, greater<pair<COSTTYPE,int> > > que;\n dist.assign(n, -1);\n dist[s] = 0;\n que.push(make_pair(0,s));\n while(!que.empty()) {\n pair<COSTTYPE,int> p = que.top();\n que.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n for (int i = 0; i < G[v].size(); ++i) {\n auto e = G[v][i];\n if (e.cap > 0 && (dist[e.to] < 0 || dist[e.to] > dist[v] + e.cost + pot[v] - pot[e.to])) {\n dist[e.to] = dist[v] + e.cost + pot[v] - pot[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n que.push(make_pair(dist[e.to], e.to));\n }\n }\n }\n if (dist[t] < 0) return {maxf - f, res};\n for (int v = 0; v < n; ++v) pot[v] += dist[v];\n FLOWTYPE d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += pot[t] * d;\n for (int v = t; v != s; v = prevv[v]) {\n Edge<FLOWTYPE,COSTTYPE> &e = G[prevv[v]][preve[v]];\n Edge<FLOWTYPE,COSTTYPE> &re = G.redge(e);\n e.cap -= d;\n re.cap += d;\n }\n }\n return {maxf, res};\n}\n\nint main() {\n int N, maxF;\n while (cin >> N, N) {\n // 入力\n vector<int> M(N-1);\n vector<vector<int>> X(N-1), Y(N-1), C(N-1);\n \n // (駅, 時刻) → 入って来る側の頂点番号\n map<pint, int> index;\n int vertex_num = 0;\n \n vector<pint> verinfo;\n \n // 各駅の到着時刻と発車時刻\n vector<set<int>> intime(N), outtime(N);\n \n // 入力受け取り\n for (int i = 0; i < N-1; ++i) {\n cin >> M[i];\n X[i].resize(M[i]), Y[i].resize(M[i]), C[i].resize(M[i]);\n for (int j = 0; j < M[i]; ++j) {\n cin >> X[i][j] >> Y[i][j] >> C[i][j];\n outtime[i].insert(X[i][j]);\n intime[i+1].insert(Y[i][j]);\n if (!index.count(pint(i, X[i][j]))) {\n index[pint(i, X[i][j])] = vertex_num;\n vertex_num += 2;\n \n verinfo.push_back(pint(i, X[i][j]));\n verinfo.push_back(pint(i, X[i][j]));\n }\n if (!index.count(pint(i+1, Y[i][j]))) {\n index[pint(i+1, Y[i][j])] = vertex_num;\n vertex_num += 2;\n \n verinfo.push_back(pint(i+1, Y[i][j]));\n verinfo.push_back(pint(i+1, Y[i][j]));\n }\n }\n }\n cin >> maxF;\n \n // グラフを構築\n int source = vertex_num++, sink = vertex_num++;\n Graph<int, int> G(vertex_num);\n const int INF = maxF; // 理論上流せる上限\n \n verinfo.emplace_back(-1, -1);verinfo.emplace_back(-1, -1);\n \n //COUT(verinfo); COUT(index); COUT(intime); COUT(outtime);\n \n // ソース → 最初の駅\n for (auto t : outtime[0]) {\n G.addedge(source, index[pint(0, t)] + 1, INF, 0);\n }\n // 最後の駅 → シンク\n for (auto t : intime[N-1]) {\n G.addedge(index[pint(N-1, t)] + 1, sink, INF, 0);\n }\n \n // 各駅の intime (容量 1) を分裂\n for (int i = 0; i < N; ++i) {\n for (auto t : intime[i]) {\n G.addedge(index[pint(i, t)], index[pint(i, t)] + 1, 1, 0);\n }\n }\n \n // 各駅の intime -> outtime\n for (int i = 0; i < N; ++i) {\n for (auto t1 : intime[i]) {\n for (auto t2 : outtime[i]) {\n if (t1 <= t2) {\n G.addedge(index[pint(i, t1)] + 1, index[pint(i, t2)] + 1, INF, 0);\n }\n }\n }\n }\n \n // 各電車\n for (int i = 0; i < N-1; ++i) {\n for (int j = 0; j < X[i].size(); ++j) {\n G.addedge(index[pint(i, X[i][j])] + 1, index[pint(i+1, Y[i][j])], 1, C[i][j]);\n }\n }\n \n \n /*\n for (int v = 0; v < vertex_num; ++v) {\n for (auto e : G[v]) {\n if (e.cap > 0)\n cout << verinfo[v] << \" -> \" << verinfo[e.to] << \" (\" << e.icap << \", \" << e.cost << \")\" << endl;\n }\n }\n */\n \n \n // 最小費用最大流を流す\n auto res = MinCostMaxFlow(G, source, sink, maxF);\n cout << res.first << \" \" << res.second << endl;\n }\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 4300,
"score_of_the_acc": -0.0369,
"final_rank": 8
},
{
"submission_id": "aoj_1088_7264094",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing pll = pair<ll, ll>;\n#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)\n#define rep(i, n) drep(i, 0, n - 1)\n#define all(a) (a).begin(), (a).end()\n#define pb push_back\n#define fi first\n#define se second\n\nconst ll MOD = 1000000007;\nconst ll MOD2 = 998244353;\nconst ll INF = 1LL << 60;\nconst ll MAX_N = 2e5;\n\nstruct MinCostFlow{\n struct Edge{\n ll to;\n ll cap;\n ll cost;\n ll rev;\n };\n\n vector<vector<Edge>> G;\n ll N;\n vector<ll> h; // ポテンシャル\n vector<ll> dist; // 最短距離\n vector<ll> prevv; // 直前の頂点\n vector<ll> preve; // 直前の辺\n\n MinCostFlow(vector<vector<tuple<ll, ll, ll>>> G_){\n N = (ll)G_.size();\n G.resize(N);\n h.resize(N, 0);\n dist.resize(N, 0);\n prevv.resize(N, 0);\n preve.resize(N, 0);\n\n rep(from, N){\n for(tuple<ll, ll, ll> tmp : G_[from]){\n ll to = get<0>(tmp);\n ll cap = get<1>(tmp);\n ll cost = get<2>(tmp);\n G[from].pb((Edge){to, cap, cost, (ll)G[to].size()});\n G[to].pb((Edge){from, 0, -cost, (ll)G[from].size()-1});\n }\n }\n }\n\n ll min_cost_flow(ll s, ll t, ll f){\n vector<vector<Edge>> H(N);\n rep(from, N) for(Edge e : G[from]) H[from].pb(e);\n rep(i, N) h[i] = 0;\n\n ll res = 0;\n while(f > 0){\n //ダイクストラ法を用いてhを更新\n priority_queue<pll, vector<pll>, greater<pll>> PQ;\n rep(i, N) dist[i] = INF;\n dist[s] = 0;\n PQ.push({0, s});\n while(!PQ.empty()){\n pll p = PQ.top();\n PQ.pop();\n ll v = p.se;\n if(dist[v] < p.fi) continue;\n\n for(ll i=0; i<(ll)H[v].size(); i++){\n Edge &e = H[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]){\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n PQ.push({dist[e.to], e.to});\n }\n }\n }\n if(dist[t] == INF){\n //これ以上流せない\n return -1;\n }\n for(ll v=0; v<N; v++) h[v] += dist[v];\n\n // s-t間最短経路に沿って目一杯流す\n ll d = f;\n for(ll v=t; v!=s; v=prevv[v]){\n d = min(d, H[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d*h[t];\n for(ll v=t; v!=s; v=prevv[v]){\n Edge &e = H[prevv[v]][preve[v]];\n e.cap -= d;\n H[v][e.rev].cap += d;\n }\n }\n\n return res;\n }\n};\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n \n vector<pll> ans;\n while(true){\n ll n;\n cin >> n;\n\n if(n == 0) break;\n\n vector<vector<tuple<ll, ll, ll>>> train(n+1);\n for(ll i=1; i<=n-1; i++){\n ll m;\n cin >> m;\n\n rep(j, m){\n ll x, y, c;\n cin >> x >> y >> c;\n train[i].pb({x, y, c});\n }\n }\n\n ll g;\n cin >> g;\n\n //頂点番号の割り当て\n vector<map<ll, ll>> in_t(n+1), out_t(n+1);\n ll now = 0;\n in_t[1][0]=now++;\n for(ll i=1; i<=n-1; i++){\n for(tuple<ll, ll, ll> tmp : train[i]){\n ll x = get<0>(tmp);\n ll y = get<1>(tmp);\n\n for(auto itr=in_t[i].begin(); itr!=in_t[i].end(); itr++){\n if(out_t[i].find((*itr).fi) == out_t[i].end()) out_t[i][(*itr).fi] = now++;\n }\n if(out_t[i].find(x) == out_t[i].end()) out_t[i][x] = now++;\n if(in_t[i+1].find(y) == in_t[i+1].end()) in_t[i+1][y] = now++;\n\n if(i == n-1){\n if(out_t[i+1].find(y) == out_t[i+1].end()) out_t[i+1][y] = now++;\n }\n }\n }\n\n //グラフの構築\n vector<vector<tuple<ll, ll, ll>>> G(now);\n ll s = 0;\n G[s].pb({1, g, 0});\n for(ll i=1; i<=n-1; i++){\n if(i != 1){\n for(auto itr=in_t[i].begin(); itr!=in_t[i].end(); itr++){\n ll time = (*itr).fi;\n ll u = (*itr).se;\n ll v = out_t[i][time];\n G[u].pb({v, 1, 0});\n }\n }\n\n for(auto itr=out_t[i].begin(); itr!=out_t[i].end(); itr++){\n auto nxt_itr = itr;\n nxt_itr++;\n if(nxt_itr==out_t[i].end()) break;\n ll u = (*itr).se;\n ll v = (*nxt_itr).se;\n if(u == 0) cout << \"error : \" << i << \" \" << (*itr).fi << \" \" << (*itr).se << endl;\n G[u].pb({v, INF, 0});\n }\n\n for(tuple<ll, ll, ll> tmp : train[i]){\n ll x = get<0>(tmp);\n ll y = get<1>(tmp);\n ll c = get<2>(tmp);\n\n ll u = out_t[i][x];\n ll v = in_t[i+1][y];\n G[u].pb({v, 1, c});\n }\n }\n\n for(auto itr=in_t[n].begin(); itr!=in_t[n].end(); itr++){\n ll time = (*itr).fi;\n ll u = (*itr).se;\n ll v = out_t[n][time];\n G[u].pb({v, 1, 0});\n }\n\n ll t=((*out_t[n].begin()).se); //終点\n for(auto itr=out_t[n].begin(); itr!=out_t[n].end(); itr++){\n auto nxt_itr = itr;\n nxt_itr++;\n if(nxt_itr==out_t[n].end()) break;\n ll u = (*itr).se;\n ll v = (*nxt_itr).se;\n G[u].pb({v, INF, 0});\n t = v;\n }\n\n MinCostFlow MCF(G);\n\n ll lw = 0;\n ll hi = g+1;\n ll mid;\n while(hi - lw > 1){\n mid = (lw + hi)/2;\n\n ll mcf = MCF.min_cost_flow(s, t, mid);\n if(mcf==-1) hi = mid;\n else lw = mid;\n }\n\n ans.pb({lw, MCF.min_cost_flow(s, t, lw)});\n }\n\n rep(i, (ll)ans.size()) cout << ans[i].fi << \" \" << ans[i].se << endl;\n}",
"accuracy": 1,
"time_ms": 280,
"memory_kb": 5192,
"score_of_the_acc": -0.2268,
"final_rank": 13
},
{
"submission_id": "aoj_1088_7264045",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing pll = pair<ll, ll>;\n#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)\n#define rep(i, n) drep(i, 0, n - 1)\n#define all(a) (a).begin(), (a).end()\n#define pb push_back\n#define fi first\n#define se second\n\nconst ll MOD = 1000000007;\nconst ll MOD2 = 998244353;\nconst ll INF = 1LL << 60;\nconst ll MAX_N = 2e5;\n\nstruct MinCostFlow{\n struct Edge{\n ll to;\n ll cap;\n ll cost;\n ll rev;\n };\n\n vector<vector<Edge>> G;\n ll N;\n vector<ll> h; // ポテンシャル\n vector<ll> dist; // 最短距離\n vector<ll> prevv; // 直前の頂点\n vector<ll> preve; // 直前の辺\n\n MinCostFlow(vector<vector<tuple<ll, ll, ll>>> G_){\n N = (ll)G_.size();\n G.resize(N);\n h.resize(N, 0);\n dist.resize(N, 0);\n prevv.resize(N, 0);\n preve.resize(N, 0);\n\n rep(from, N){\n for(tuple<ll, ll, ll> tmp : G_[from]){\n ll to = get<0>(tmp);\n ll cap = get<1>(tmp);\n ll cost = get<2>(tmp);\n G[from].pb((Edge){to, cap, cost, (ll)G[to].size()});\n G[to].pb((Edge){from, 0, -cost, (ll)G[from].size()-1});\n }\n }\n }\n\n ll min_cost_flow(ll s, ll t, ll f){\n vector<vector<Edge>> H(N);\n rep(from, N) for(Edge e : G[from]) H[from].pb(e);\n rep(i, N) h[i] = 0;\n\n ll res = 0;\n while(f > 0){\n //ダイクストラ法を用いてhを更新\n priority_queue<pll, vector<pll>, greater<pll>> PQ;\n rep(i, N) dist[i] = INF;\n dist[s] = 0;\n PQ.push({0, s});\n while(!PQ.empty()){\n pll p = PQ.top();\n PQ.pop();\n ll v = p.se;\n if(dist[v] < p.fi) continue;\n\n for(ll i=0; i<(ll)H[v].size(); i++){\n Edge &e = H[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]){\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n PQ.push({dist[e.to], e.to});\n }\n }\n }\n if(dist[t] == INF){\n //これ以上流せない\n return -1;\n }\n for(ll v=0; v<N; v++) h[v] += dist[v];\n\n // s-t間最短経路に沿って目一杯流す\n ll d = f;\n for(ll v=t; v!=s; v=prevv[v]){\n d = min(d, H[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d*h[t];\n for(ll v=t; v!=s; v=prevv[v]){\n Edge &e = H[prevv[v]][preve[v]];\n e.cap -= d;\n H[v][e.rev].cap += d;\n }\n }\n\n return res;\n }\n};\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n \n vector<pll> ans;\n while(true){\n ll n;\n cin >> n;\n\n if(n == 0) break;\n\n vector<vector<tuple<ll, ll, ll>>> train(n+1);\n for(ll i=1; i<=n-1; i++){\n ll m;\n cin >> m;\n\n rep(j, m){\n ll x, y, c;\n cin >> x >> y >> c;\n train[i].pb({x, y, c});\n }\n }\n\n ll g;\n cin >> g;\n\n //頂点番号の割り当て\n vector<map<ll, ll>> in_t(n+1), out_t(n+1);\n ll now = 0;\n in_t[1][0]=now++;\n for(ll i=1; i<=n-1; i++){\n for(tuple<ll, ll, ll> tmp : train[i]){\n ll x = get<0>(tmp);\n ll y = get<1>(tmp);\n\n for(auto itr=in_t[i].begin(); itr!=in_t[i].end(); itr++){\n if(out_t[i].find((*itr).fi) == out_t[i].end()) out_t[i][(*itr).fi] = now++;\n }\n if(out_t[i].find(x) == out_t[i].end()) out_t[i][x] = now++;\n if(in_t[i+1].find(y) == in_t[i+1].end()) in_t[i+1][y] = now++;\n\n if(i == n-1){\n if(out_t[i+1].find(y) == out_t[i+1].end()) out_t[i+1][y] = now++;\n }\n }\n }\n\n //グラフの構築\n vector<vector<tuple<ll, ll, ll>>> G(now);\n ll s = 0;\n G[s].pb({1, g, 0});\n for(ll i=1; i<=n-1; i++){\n if(i != 1){\n for(auto itr=in_t[i].begin(); itr!=in_t[i].end(); itr++){\n ll time = (*itr).fi;\n ll u = (*itr).se;\n ll v = out_t[i][time];\n G[u].pb({v, 1, 0});\n }\n }\n\n for(auto itr=out_t[i].begin(); itr!=out_t[i].end(); itr++){\n auto nxt_itr = itr;\n nxt_itr++;\n if(nxt_itr==out_t[i].end()) break;\n ll u = (*itr).se;\n ll v = (*nxt_itr).se;\n G[u].pb({v, INF, 0});\n }\n\n for(tuple<ll, ll, ll> tmp : train[i]){\n ll x = get<0>(tmp);\n ll y = get<1>(tmp);\n ll c = get<2>(tmp);\n\n ll u = out_t[i][x];\n ll v = in_t[i+1][y];\n G[u].pb({v, 1, c});\n }\n }\n\n for(auto itr=in_t[n].begin(); itr!=in_t[n].end(); itr++){\n ll time = (*itr).fi;\n ll u = (*itr).se;\n ll v = out_t[n][time];\n G[u].pb({v, 1, 0});\n }\n\n ll t=0; //終点\n for(auto itr=out_t[n].begin(); itr!=out_t[n].end(); itr++){\n auto nxt_itr = itr;\n nxt_itr++;\n if(nxt_itr==out_t[n].end()) break;\n ll u = (*itr).se;\n ll v = (*nxt_itr).se;\n G[u].pb({v, INF, 0});\n t = v;\n }\n\n MinCostFlow MCF(G);\n\n ll lw = 0;\n ll hi = g+1;\n ll mid;\n while(hi - lw > 1){\n mid = (lw + hi)/2;\n\n ll mcf = MCF.min_cost_flow(s, t, mid);\n if(mcf==-1) hi = mid;\n else lw = mid;\n }\n\n ans.pb({lw, MCF.min_cost_flow(s, t, lw)});\n }\n\n rep(i, (ll)ans.size()) cout << ans[i].fi << \" \" << ans[i].se << endl;\n}",
"accuracy": 0.6666666666666666,
"time_ms": 290,
"memory_kb": 5428,
"score_of_the_acc": -0.2381,
"final_rank": 18
},
{
"submission_id": "aoj_1088_7052311",
"code_snippet": "#ifndef HIDDEN_IN_VS // 折りたたみ用\n\n// 警告の抑制\n#define _CRT_SECURE_NO_WARNINGS\n\n// ライブラリの読み込み\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型名の短縮\nusing ll = long long; // -2^63 ～ 2^63 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）\nusing pii = pair<int, int>;\tusing pll = pair<ll, ll>;\tusing pil = pair<int, ll>;\tusing pli = pair<ll, int>;\nusing vi = vector<int>;\t\tusing vvi = vector<vi>;\t\tusing vvvi = vector<vvi>;\nusing vl = vector<ll>;\t\tusing vvl = vector<vl>;\t\tusing vvvl = vector<vvl>;\nusing vb = vector<bool>;\tusing vvb = vector<vb>;\t\tusing vvvb = vector<vvb>;\nusing vc = vector<char>;\tusing vvc = vector<vc>;\t\tusing vvvc = vector<vvc>;\nusing vd = vector<double>;\tusing vvd = vector<vd>;\t\tusing vvvd = vector<vvd>;\ntemplate <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\nusing Graph = vvi;\n\n// 定数の定義\nconst double PI = acos(-1);\nconst vi DX = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\nconst vi DY = { 0, 1, 0, -1 };\nint INF = 1001001001; ll INFL = 4004004004004004004LL;\ndouble EPS = 1e-12;\n\n// 入出力高速化\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;\n\n// 汎用マクロの定義\n#define all(a) (a).begin(), (a).end()\n#define sz(x) ((int)(x).size())\n#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))\n#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))\n#define Yes(b) {cout << ((b) ? \"Yes\\n\" : \"No\\n\");}\n#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順\n#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順\n#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順\n#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）\n#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）\n#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d ビット全探索（昇順）\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\n#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\n\n// 汎用関数の定義\ntemplate <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\n\n// 演算子オーバーロード\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 istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }\n\n// 手元環境（Visual Studio）\n#ifdef _MSC_VER\n#include \"local.hpp\"\n// 提出用（gcc）\n#else\ninline int popcount(int n) { return __builtin_popcount(n); }\ninline int popcount(ll n) { return __builtin_popcountll(n); }\ninline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\n#define gcd __gcd\n#define dump(...)\n#define dumpel(v)\n#define dump_list(v)\n#define input_from_file(f)\n#define output_to_file(f)\n#define Assert(b) { if (!(b)) while (1) cout << \"OLE\"; }\n#endif\n\n#endif // 折りたたみ用\n\n\n////--------------AtCoder 専用--------------\n//#include <atcoder/all>\n//using namespace atcoder;\n//\n//using mint = modint1000000007;\n////using mint = modint998244353;\n////using mint = modint; // mint::set_mod(m);\n//\n//istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\n//ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\n//using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;\n////----------------------------------------\n\n\n#ifndef ATCODER_INTERNAL_CSR_HPP\n#define ATCODER_INTERNAL_CSR_HPP 1\n\n#include <algorithm>\n#include <utility>\n#include <vector>\n\nnamespace atcoder {\n namespace internal {\n\n template <class E> struct csr {\n std::vector<int> start;\n std::vector<E> elist;\n explicit csr(int n, const std::vector<std::pair<int, E>>& edges)\n : start(n + 1), elist(edges.size()) {\n for (auto e : edges) {\n start[e.first + 1]++;\n }\n for (int i = 1; i <= n; i++) {\n start[i] += start[i - 1];\n }\n auto counter = start;\n for (auto e : edges) {\n elist[counter[e.first]++] = e.second;\n }\n }\n };\n\n } // namespace internal\n\n} // namespace atcoder\n\n#endif // ATCODER_INTERNAL_CSR_HPP\n\n\n#ifndef ATCODER_INTERNAL_QUEUE_HPP\n#define ATCODER_INTERNAL_QUEUE_HPP 1\n\n#include <vector>\n\nnamespace atcoder {\n\n namespace internal {\n\n template <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n };\n\n } // namespace internal\n\n} // namespace atcoder\n\n#endif // ATCODER_INTERNAL_QUEUE_HPP\n\n\n#ifndef ATCODER_MINCOSTFLOW_HPP\n#define ATCODER_MINCOSTFLOW_HPP 1\n\n#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\nnamespace atcoder {\n\n template <class Cap, class Cost> struct mcf_graph {\n public:\n mcf_graph() {}\n explicit mcf_graph(int n) : _n(n) {}\n\n int add_edge(int from, int to, Cap cap, Cost cost) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n assert(0 <= cost);\n int m = int(_edges.size());\n _edges.push_back({ from, to, cap, 0, cost });\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n Cost cost;\n };\n\n edge get_edge(int i) {\n int m = int(_edges.size());\n assert(0 <= i && i < m);\n return _edges[i];\n }\n std::vector<edge> edges() { return _edges; }\n\n std::pair<Cap, Cost> flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {\n return slope(s, t, flow_limit).back();\n }\n std::vector<std::pair<Cap, Cost>> slope(int s, int t) {\n return slope(s, t, std::numeric_limits<Cap>::max());\n }\n std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n int m = int(_edges.size());\n std::vector<int> edge_idx(m);\n\n auto g = [&]() {\n std::vector<int> degree(_n), redge_idx(m);\n std::vector<std::pair<int, _edge>> elist;\n elist.reserve(2 * m);\n for (int i = 0; i < m; i++) {\n auto e = _edges[i];\n edge_idx[i] = degree[e.from]++;\n redge_idx[i] = degree[e.to]++;\n elist.push_back({ e.from, {e.to, -1, e.cap - e.flow, e.cost} });\n elist.push_back({ e.to, {e.from, -1, e.flow, -e.cost} });\n }\n auto _g = internal::csr<_edge>(_n, elist);\n for (int i = 0; i < m; i++) {\n auto e = _edges[i];\n edge_idx[i] += _g.start[e.from];\n redge_idx[i] += _g.start[e.to];\n _g.elist[edge_idx[i]].rev = redge_idx[i];\n _g.elist[redge_idx[i]].rev = edge_idx[i];\n }\n return _g;\n }();\n\n auto result = slope(g, s, t, flow_limit);\n\n for (int i = 0; i < m; i++) {\n auto e = g.elist[edge_idx[i]];\n _edges[i].flow = _edges[i].cap - e.cap;\n }\n\n return result;\n }\n\n private:\n int _n;\n std::vector<edge> _edges;\n\n // inside edge\n struct _edge {\n int to, rev;\n Cap cap;\n Cost cost;\n };\n\n std::vector<std::pair<Cap, Cost>> slope(internal::csr<_edge>& g,\n int s,\n int t,\n Cap flow_limit) {\n // variants (C = maxcost):\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\n\n // dual_dist[i] = (dual[i], dist[i])\n std::vector<std::pair<Cost, Cost>> dual_dist(_n);\n std::vector<int> prev_e(_n);\n std::vector<bool> vis(_n);\n struct Q {\n Cost key;\n int to;\n bool operator<(Q r) const { return key > r.key; }\n };\n std::vector<int> que_min;\n std::vector<Q> que;\n auto dual_ref = [&]() {\n for (int i = 0; i < _n; i++) {\n dual_dist[i].second = std::numeric_limits<Cost>::max();\n }\n std::fill(vis.begin(), vis.end(), false);\n que_min.clear();\n que.clear();\n\n // que[0..heap_r) was heapified\n size_t heap_r = 0;\n\n dual_dist[s].second = 0;\n que_min.push_back(s);\n while (!que_min.empty() || !que.empty()) {\n int v;\n if (!que_min.empty()) {\n v = que_min.back();\n que_min.pop_back();\n }\n else {\n while (heap_r < que.size()) {\n heap_r++;\n std::push_heap(que.begin(), que.begin() + heap_r);\n }\n v = que.front().to;\n std::pop_heap(que.begin(), que.end());\n que.pop_back();\n heap_r--;\n }\n if (vis[v]) continue;\n vis[v] = true;\n if (v == t) break;\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\n // dist[v] >= 0 (all reduced cost are positive)\n // dist[v] <= (n-1)C\n Cost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second;\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\n auto e = g.elist[i];\n if (!e.cap) continue;\n // |-dual[e.to] + dual[v]| <= (n-1)C\n // cost <= C - -(n-1)C + 0 = nC\n Cost cost = e.cost - dual_dist[e.to].first + dual_v;\n if (dual_dist[e.to].second - dist_v > cost) {\n Cost dist_to = dist_v + cost;\n dual_dist[e.to].second = dist_to;\n prev_e[e.to] = e.rev;\n if (dist_to == dist_v) {\n que_min.push_back(e.to);\n }\n else {\n que.push_back(Q{ dist_to, e.to });\n }\n }\n }\n }\n if (!vis[t]) {\n return false;\n }\n\n for (int v = 0; v < _n; v++) {\n if (!vis[v]) continue;\n // dual[v] = dual[v] - dist[t] + dist[v]\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) +\n // (shortest(s, v) + dual[s] - dual[v]) = - shortest(s,\n // t) + dual[t] + shortest(s, v) = shortest(s, v) -\n // shortest(s, t) >= 0 - (n-1)C\n dual_dist[v].first -= dual_dist[t].second - dual_dist[v].second;\n }\n return true;\n };\n Cap flow = 0;\n Cost cost = 0, prev_cost_per_flow = -1;\n std::vector<std::pair<Cap, Cost>> result = { {Cap(0), Cost(0)} };\n while (flow < flow_limit) {\n if (!dual_ref()) break;\n Cap c = flow_limit - flow;\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\n c = std::min(c, g.elist[g.elist[prev_e[v]].rev].cap);\n }\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\n auto& e = g.elist[prev_e[v]];\n e.cap += c;\n g.elist[e.rev].cap -= c;\n }\n Cost d = -dual_dist[s].first;\n flow += c;\n cost += c * d;\n if (prev_cost_per_flow == d) {\n result.pop_back();\n }\n result.push_back({ flow, cost });\n prev_cost_per_flow = d;\n }\n return result;\n }\n };\n\n} // namespace atcoder\n\n#endif // ATCODER_MINCOSTFLOW_HPP\n\n\nusing namespace atcoder;\n\n\nvoid solve() {\n\tint n;\n\tcin >> n;\n\n\tif (n == 0) exit(0);\n\n\tvector<map<int, int>> ids_in(n), ids_out(n); int id = 0;\n\tvector<tuple<int, int, int, int>> es;\n\n\trep(i, n - 1) {\n\t\tint m;\n\t\tcin >> m;\n\n\t\trep(j, m) {\n\t\t\tint x, y, c;\n\t\t\tcin >> x >> y >> c;\n\n\t\t\tif (!ids_out[i].count(x)) ids_out[i][x] = id++;\n\t\t\tif (!ids_in[i + 1].count(y)) ids_in[i + 1][y] = id++;\n\t\t\tif (!ids_out[i + 1].count(y)) ids_out[i + 1][y] = id++;\n\n\t\t\tes.emplace_back(ids_out[i][x], ids_in[i + 1][y], INF, c);\n\t\t\tes.emplace_back(ids_in[i + 1][y], ids_out[i + 1][y], 1, 0);\n\t\t}\n\t}\n\tuniq(es);\n\tdumpel(ids_in); dumpel(ids_out); dump(es);\n\n\tint N = id;\n\tmcf_graph<int, int> g(N);\n\n\trepe(e, es) {\n\t\tint s, t, cap, cost;\n\t\ttie(s, t, cap, cost) = e;\n\n\t\tg.add_edge(s, t, cap, cost);\n\t}\n\n\trep(i, n) {\n\t\tint bid = -1;\n\t\trepe(tmp, ids_out[i]) {\n\t\t\tint t, id;\n\t\t\ttie(t, id) = tmp;\n\n\t\t\tif (bid != -1) {\n\t\t\t\tg.add_edge(bid, id, INF, 0);\n\t\t\t}\n\t\t\tbid = id;\n\t\t}\n\t}\n//\tdump(g);\n\n\tint f_lim;\n\tcin >> f_lim;\n\n\tint cap, cost;\n\ttie(cap, cost) = g.flow(ids_out[0].begin()->second, ids_out[n - 1].rbegin()->second, f_lim);\n\n\tcout << cap << \" \" << cost << endl;\n}\n\n\nint main() {\n//\tinput_from_file(\"input.txt\");\n//\toutput_to_file(\"output.txt\");\n\t\n\twhile (true) solve();\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 4168,
"score_of_the_acc": -0.0011,
"final_rank": 1
}
] |
aoj_1091_cpp
|
KND is So Sexy
Problem
KND君は会津大学に在籍する学生プログラマである。彼の胸元はとてもセクシーなことで知られている。
簡単のために胸元から見える肌の部分を図にある二等辺三角形ABCで表す。しかし服にはたるみが生じているため、長さが等しい2辺AC,BC(これらの長さを
l
とする)には実際にはさらに長さ
x
分余裕がある。はだける部分の面積を増やすため、たるんだ分を引っ張ることで新たにふたつの三角形ADC,BECを作ることにしよう。点D,Eは三角形ABCの外側に存在する。この新しいふたつの三角形はたるみによって生じるもので、辺BEと辺ECの長さの和および辺ADと辺DCの長さの和は
l
+
x
でなければならない。あなたはこれら3つの三角形の面積の和
M
が最大になるように点D,Eを決める。KND君の隣人であるあなたは彼の胸元がどれ程セクシーなのかを調べるために、
a
,
l
,
x
を入力として服からのぞく肌の最大の面積(
M
)を計算するプログラムを作成することにした。
Input
入力は複数のテストケースからなる。
ひとつのテストケースは以下の形式で与えられる。
入力の終わりをEOFで示す。
a l x
ここで、
a
:三角形ABCの辺ABの長さ
l
:三角形ABCの2辺AC,BCの長さ
x
:2辺AC,BCにあるたるみ
である。
Constraints
入力は以下の条件を満たす。
入力はすべて整数。
1 ≤
a
≤ 1000
1 ≤
l
≤ 1000
1 ≤
x
≤ 1000
Output
各テストケースにつき最大の面積を1行に出力せよ。この値はジャッジ出力の値と10
-5
より大きい差を持ってはならない。
Sample Input
2 2 1
2 3 1
3 2 3
2 3 5
Sample Output
3.9681187851
6.7970540913
6.5668891783
13.9527248554
|
[
{
"submission_id": "aoj_1091_3385259",
"code_snippet": "#include<iostream>\n#include<iomanip>\n#include<cmath>\nusing namespace std;\n\ndouble calcSurfaceArea( double a, double b, double c )\n{\n double cosA = ( b * b + c * c - a * a ) / ( 2 * b * c );\n double sinA = sqrt( 1 - cosA * cosA );\n return 0.5 * c * b * sinA;\n}\n\nint main()\n{\n int a, l, x;\n\n while( cin >> a >> l >> x )\n {\n double max = 0;\n for( double i = 0.01; i < l + x; i += 0.01 )\n {\n double s = calcSurfaceArea( i, l, l + x - i );\n if( s > max )\n max = s;\n }\n cout << fixed << setprecision(10) << max + max + calcSurfaceArea( a, l, l ) << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 980,
"memory_kb": 3324,
"score_of_the_acc": -2,
"final_rank": 15
},
{
"submission_id": "aoj_1091_1828938",
"code_snippet": "#include<iostream>\n#include<math.h>\n#include<iomanip>\nusing namespace std;\nint main(){\n\tdouble a,l,x;\n\twhile(cin>>a>>l>>x){\n\t\tdouble b,c;\n\t\tb=(double)sqrt((double)l*l-a*a/4);\n\t\tc=(double)sqrt((double)(l+x)*(l+x)-l*l);\n\t\tcout<<fixed<<setprecision(10)<<a*b/2+l*c/2<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1280,
"score_of_the_acc": -0.0395,
"final_rank": 7
},
{
"submission_id": "aoj_1091_1496086",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n double a,l,x;\n while(cin >> a >> l >> x) {\n double b=sqrt(l*l-(a/2)*(a/2));\n double c=(l+x)/2;\n double d=sqrt(c*c-(l/2)*(l/2));\n printf(\"%.10f\\n\",a*b/2+l*d);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1240,
"score_of_the_acc": -0.0207,
"final_rank": 3
},
{
"submission_id": "aoj_1091_1351496",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <cmath>\nusing namespace std;\nint main() {\n\tfixed(cout);\n\tcout << setprecision(13);\n\tlong a, l, x;\n\twhile (cin >> a >> l >> x) {\n\t\tdouble h_1 = sqrt(l * l - a * a / 4.0);\n\t\tdouble h_2 = sqrt((x + l) * (x + l) / 4.0 - l * l / 4.0);\n\t\tcout << a * h_1 / 2 + l * h_2 << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1236,
"score_of_the_acc": -0.0188,
"final_rank": 2
},
{
"submission_id": "aoj_1091_1242142",
"code_snippet": "#include<cstdio>\n#include<vector>\n#include<algorithm>\n#include<iostream>\n#include<cmath>\nusing namespace std;\ndouble h(double a,double b,double c){\n double s=(a+b+c)*0.5;\n return sqrt(s*(s-a)*(s-b)*(s-c));\n}\nint main(){\n double a,l,x;\n while(cin>>a>>l>>x)\n cout<<fixed<<h(a,l,l)+h(l,(l+x)*0.5,(l+x)*0.5)*2<<endl;\n\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1280,
"score_of_the_acc": -0.0395,
"final_rank": 7
},
{
"submission_id": "aoj_1091_1162540",
"code_snippet": "#include<iostream>\n#include<cmath>\n#include<cstdio>\n\nusing namespace std;\n\n\nint main(){\n\tdouble a, l, x;\n\tdouble temp1, temp2;\n\tdouble center, sides;\n\n\n\twhile (cin >> a >> l >> x){\n\t\ttemp1 = sqrt(pow(l, 2) - pow(a / 2, 2));\n\t\tcenter = a * temp1 / 2;\n\t\t\n\t\ttemp2 = sqrt(pow((l + x) / 2, 2) - pow(l / 2,2));\n\t\tsides = temp2 * l;\n\n\t\tprintf(\"%10.10f\\n\", center + sides);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1240,
"score_of_the_acc": -0.0207,
"final_rank": 3
},
{
"submission_id": "aoj_1091_1109806",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\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::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\nld area(ld a, ld b, ld c)\n{\n ld s = (a + b + c) / 2.0;\n return sqrt(s * (s - a) * (s - b) * (s - c));\n}\n\nld max_area(int l, int x){\n ld r = 0;\n for (ld i = 0.1; i < l + x; i += 0.1){\n ld a = l + x - i;\n r = max(r, area(l, i, a));\n }\n return r;\n}\n\nint main()\n{\n int a, l, x;\n while (~scanf(\"%d %d %d\", &a, &l, &x)){\n printf(\"%.10Lf\\n\", area(a, l, l) + 2 * max_area(l, x));\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 730,
"memory_kb": 1216,
"score_of_the_acc": -0.7517,
"final_rank": 14
},
{
"submission_id": "aoj_1091_1093863",
"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 T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) \n{ EACH(it, P) { s << \"<\" << it->first << \"->\" << it->second << \"> \"; } return s; }\n\ndouble Area(double a, double b, double c) {\n double s = (a+b+c)/2;\n double res = s*(s-a)*(s-b)*(s-c);\n if (res > 0) return sqrt(res);\n else return 0;\n}\n\ndouble a, l, x;\n\nint main() {\n while (cin >> a >> l >> x) {\n double res = Area(a, l, l) + Area((l+x)/2, (l+x)/2, l) * 2;\n cout << fixed << setprecision(9) << res << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1280,
"score_of_the_acc": -0.0395,
"final_rank": 7
},
{
"submission_id": "aoj_1091_1021320",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cmath>\nusing namespace std;\n\n\n\ndouble T(double a,double b,double c){\n\tdouble s=(a+b+c)/2;\n\treturn sqrt(s*(s-a)*(s-b)*(s-c));\n}\n\n\nint main(){\n\t\n\tdouble a,l,x;\n\twhile(cin>>a>>l>>x){\n\t\tdouble ans=T(a,l,l);\n\t\tans+=T(l,(l+x)/2.0,(l+x)/2.0);\n\t\tans+=T(l,(l+x)/2.0,(l+x)/2.0);\n\t\tprintf(\"%.12f\\n\",ans);\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1240,
"score_of_the_acc": -0.0207,
"final_rank": 3
},
{
"submission_id": "aoj_1091_976908",
"code_snippet": "#include <iostream>\n#include <cmath>\n\nusing namespace std;\n\nint main() {\n\tdouble a, l, x;\n\tcout.precision(10);\n\twhile (cin >> a >> l >> x) {\n\t\tdouble area = sqrt(l * l - a * a / 4.0) * a / 2.0 + sqrt((l + x) * (l + x) / 4.0 - l * l / 4.0) * l;\n\t\tcout << fixed << area << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1280,
"score_of_the_acc": -0.0395,
"final_rank": 7
},
{
"submission_id": "aoj_1091_975360",
"code_snippet": "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<map>\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(in,tmp) in.push_back(tmp)\n#define all(in) in.begin(),in.end()\n#define PI acos(-1)\nusing namespace std;\nint main(){\n\n int a,b,c;\n while(cin>>a>>b>>c){\n double sum=0;\n sum+=a/2.0*sqrt(b*b-a*a/4.0);\n sum+=(double)b*sqrt((b+c)*(b+c)/4.0-b*b/4.0);\n \n \n printf(\"%.20f\\n\",sum);\n }\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1196,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1091_781729",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cmath>\nusing namespace std;\n\ndouble heron(double a,double b,double c){\n double s = (a+b+c)/2;\n return sqrt(s*(s-a)*(s-b)*(s-c));\n}\n\nint main(){\n double a,l,x;\n\n while(cin >> a >> l >> x){\n double t = (l+x)/2;\n\n printf(\"%.10f\\n\", heron(a,l,l)+heron(t,t,l)*2);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1240,
"score_of_the_acc": -0.0207,
"final_rank": 3
},
{
"submission_id": "aoj_1091_726709",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <string>\n#include <sstream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cctype>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <bitset>\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 all(v) (v).begin(), (v).end()\n#define rev(s) (s).rbegin(), (s).rend()\n#define MP make_pair\n#define X first\n#define Y second\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef vector<int> vi;\n\ndouble calcs(double a, double b, double c){\n\tdouble s = (a+b+c)/2;\n\treturn sqrt(s*(s-a)*(s-b)*(s-c));\n}\n\nint main(){\n\tcout.setf(ios::fixed);\n\tcout.precision(8);\n\tdouble a, l, x;\n\twhile(cin >> a >> l >> x){\n\t\tcout << calcs(a, l, l) + calcs(l, (l+x)/2, (l+x)/2)*2 << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1280,
"score_of_the_acc": -0.0498,
"final_rank": 11
},
{
"submission_id": "aoj_1091_551497",
"code_snippet": "#include <iostream>\n#include <stdio.h>\n#include <cmath>\n\nusing namespace std;\n\nvoid solve()\n{\n\tdouble a, l, x;\n\twhile(cin >> a >> l >> x)\n\t{\n\t\tdouble s1 = a / 4 * sqrt((a + 2 * l) * (2 * l - a));\n\t\tdouble maxS2 = 0;\n\t\tfor(double i = 0.00001; i < 1.0; i += 0.00001)\n\t\t{\n\t\t\tdouble len1 = i * (l + x);\n\t\t\tdouble len2 = (1.0 - i) * (l + x);\n\t\t\tdouble s = (l + len1 + len2) / 2.0;\n\t\t\tif(s * (s - l) * (s - len1) * (s - len2) < 0)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tdouble s2 = sqrt(s * (s - l) * (s - len1) * (s - len2));\n\t\t\t\tif(maxS2 < s2)\n\t\t\t\t{\n\t\t\t\t\tmaxS2 = s2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%6f\\n\", s1 + 2 * maxS2);\n\t}\n}\n\nint main()\n{\n\tsolve();\n\treturn(0);\n}",
"accuracy": 1,
"time_ms": 620,
"memory_kb": 1240,
"score_of_the_acc": -0.6495,
"final_rank": 13
},
{
"submission_id": "aoj_1091_512798",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P > PP;\n\nint tx[] = {0,1,0,-1};\nint ty[] = {-1,0,1,0};\n\nstatic const double EPS = 1e-8;\n\n\nint main(){\n\tdouble a,l,x;\n\t\n\twhile(~scanf(\"%lf %lf %lf\",&a,&l,&x)){\n\t\tdouble s = (a+l+l)/2.0;\n\t\tdouble ca = sqrt(s*(s-a)*(s-l)*(s-l));\n\n\t\tdouble res = 0.0;\n\t\t\n\t\tfor(double scale = 0.00001; scale < 1.0; scale += 0.00001){\n\t\t\tdouble e1 = scale * (l+x);\n\t\t\tdouble e2 = (1.0-scale) * (l+x);\n\n\t\t\tdouble s2 = (e1+e2+l)/2.0;\n\t\t\tif(s2*(s2-e1)*(s2-e2)*(s2-l) < 0) continue;\n\n\t\t\tdouble ca2 = sqrt(s2*(s2-e1)*(s2-e2)*(s2-l));\n\n\t\t\tres=max(ca+ca2+ca2,res);\n\t\t}\n\n\t\tprintf(\"%lf\\n\",res);\n\t}\n}",
"accuracy": 1,
"time_ms": 610,
"memory_kb": 1236,
"score_of_the_acc": -0.6374,
"final_rank": 12
}
] |
aoj_1090_cpp
|
Problem G: Sports Days
会津大学附属小学校（会津大小）は日本有数の競技プログラマー養成校として有名である。
もちろん、運動会に参加しているときでさえアルゴリズムの修行を欠かせない。
競技プログラミング部部長のあなたはもちろんこの大会でも勝利したい。
今回はある競技に注目する。
ある競技とは会津大小で行われている伝統的な競技だ。
校庭にコーンがn個置いてある。
コーンは4色用意されている。
コーンのいくつかのペアは白線で描かれた矢印で結ばれている。
矢印は片側だけについており、整数が併記されている。
競技者はk人1チームとして行動する。
あるスタート地点のコーンからゴール地点のコーンまで矢印の上をその向きに移動する。
ただし、k人それぞれがゴール地点までの経路は異なる必要がある。
経路1と経路2が異なるというのは、
条件1 経路1と経路2で経由する矢印の本数が等しい場合、経路1でi番目に経由する矢印と経路2でi番目に経由する矢印が異なるようなiが存在すること。
条件2 経路1と経路2で経由する矢印の本数が異なっていること。
のいずれかを満たせば経路が異なっていると言える。
さらに、コーンの辿り方には禁止された色のパターンがあり、スタート地点からゴール地点までの経路でそのパターンを含んでしまった選手はリタイアとなる。
ただし、それ以外の経路はどのような経路を辿ってもよく、何度も同じコーン（スタート地点やゴール地点のコーンを含む）を通って良い。
また、矢印に併記された数字がスコアとして加算されていく。
この競技はより多くのチームメイトがより小さな合計スコアでゴール地点のコーンに辿りつけたチームが勝利となる。
部長のあなたはもちろんプログラミングでこの問題を解決できるはずだ。
ゴールまで移動可能な最大の人数を求めよ。
また、最大人数で辿り着いた時の最小スコアを求めよ。
ただし、いくらでもスコアを小さく出来る場合は -1 を出力せよ。
Input
入力は複数のテストケースから成り立っている。
テストケースの数は20ケースを超えない。
n
col
1
col
2
...
col
n
m
a
1
b
1
c
1
a
2
b
2
c
2
...
a
m
b
m
c
m
k
pattern
n( 2 ≤ n ≤ 100)はコーンの数を表す。
col
i
(1 ≤ col
i
≤ 4)はi番目のコーンの色を示す。
m(0 ≤ m ≤ 1,000) は矢印の数を表す。
a
i
は矢印の始点のコーンの番号, b
i
は終点のコーンの番号を表し、c
i
はその矢印のスコアを表す.
また、ひとつのコーンから伸びる矢印は10本までである。
(1 ≤ a
i
, b
i
≤ n, -1,000 ≤ c
i
≤ 1,000)
kは競技を行うチームの人数を示す。
(1 ≤ k ≤ 10)
pattern
は長さが10以下の1~4までの数字からなる文字列で、
移動が禁止されているパターンを示す。
スタート地点のコーンは1番目のコーンであり、
n番目のコーンがゴールである。
入力で与えられる数(n, col, m, a, b, c, k)はすべて整数である。
入力の終わりは0を含む1行で示される。
Output
出力は空白で区切られた二つの整数からなる。
1つ目は到達できる人数で、2つ目はその最小コストである。
もし、いくらでもスコアを小さく出来る場合は-1のみを含む１行を出力せよ。
一人も到達できない場合は0 0を出力せよ。
Sample Input
2
1
1
2
1 2 1
2 1 1
1
1111
2
1
1
2
1 2 1
2 1 1
1
11
2
1
1
2
1 2 1
2 1 1
10
1111
2
1
1
2
1 2 1
2 1 1
10
111111
2
1
1
2
1 2 -1
2 1 0
10
11
2
1
1
2
1 2 -1
2 1 0
10
1111
2
1
1
2
1 2 -1
2 1 0
10
12
2
1
1
2
1 2 -1
2 1 0
10
1111111111
0
Sample Output
1 1
0 0
1 1
2 4
0 0
1 -1
-1
4 -10
|
[
{
"submission_id": "aoj_1090_10206766",
"code_snippet": "// AOJ #1090\n// Sports Days 2025.2.9\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long; \nconst ll INF = 1LL << 60;\n \nvector<int> buildLPS(const string &pat) {\n int m = pat.size();\n vector<int> lps(m, 0);\n int len = 0;\n for (int i = 1; i < m; i++) {\n while(len > 0 && pat[i] != pat[len])\n len = lps[len-1];\n if(pat[i] == pat[len]) len++;\n lps[i] = len;\n }\n return lps;\n}\n \nvector<vector<int>> buildAutomaton(const string &pat) {\n int m = pat.size();\n vector<vector<int>> aut(m+1, vector<int>(5, 0));\n vector<int> lps = buildLPS(pat);\n for (int d = 1; d <= 4; d++){\n if (char('0' + d) == pat[0]) aut[0][d] = 1;\n else aut[0][d] = 0;\n }\n for (int s = 1; s <= m; s++){\n for (int d = 1; d <= 4; d++){\n if(s < m && char('0' + d) == pat[s])\n aut[s][d] = s + 1;\n else {\n if(s == 0) aut[s][d] = 0;\n else aut[s][d] = aut[lps[s-1]][d];\n }\n }\n }\n return aut;\n}\n \nstruct Edge {\n int to;\n int cost;\n int rcost;\n};\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n while(true){\n int n;\n cin >> n;\n if(n == 0) break;\n \n vector<int> color(n+1);\n for (int i = 1; i <= n; i++) cin >> color[i];\n \n int m;\n cin >> m;\n vector<vector<tuple<int,int,int>>> origEdges(n+1);\n for (int i = 0; i < m; i++){\n int a, b, c;\n cin >> a >> b >> c;\n origEdges[a].push_back({a, b, c});\n }\n \n int k;\n cin >> k;\n \n string pattern;\n cin >> pattern;\n \n int patLen = pattern.size();\n vector<vector<int>> aut = buildAutomaton(pattern);\n \n int V = n * patLen;\n vector<vector<Edge>> graph(V), revGraph(V);\n \n int initState = aut[0][ color[1] ];\n if(initState == patLen){\n cout << 0 << \" \" << 0 << endl;\n continue;\n }\n int startId = (1 - 1) * patLen + initState;\n \n for (int u = 1; u <= n; u++){\n for (int s = 0; s < patLen; s++){\n int nodeId = (u - 1) * patLen + s;\n for(auto &edgeInfo : origEdges[u]){\n int a, v, cost;\n tie(a, v, cost) = edgeInfo;\n int ns = aut[s][ color[v] ];\n if(ns == patLen) continue;\n int vId = (v - 1) * patLen + ns;\n Edge e; e.to = vId; e.cost = cost;\n graph[nodeId].push_back(e);\n \n Edge rev;\n rev.to = nodeId; rev.cost = cost;\n revGraph[vId].push_back(rev);\n }\n }\n }\n \n vector<bool> isGoal(V, false);\n for (int s = 0; s < patLen; s++){\n int goalId = (n - 1) * patLen + s;\n isGoal[goalId] = true;\n }\n \n vector<bool> reachable(V, false);\n {\n queue<int>q;\n q.push(startId);\n reachable[startId] = true;\n while(!q.empty()){\n int cur = q.front(); q.pop();\n for(auto &e : graph[cur]){\n if(!reachable[e.to]){\n reachable[e.to] = true;\n q.push(e.to);\n }\n }\n }\n }\n \n vector<bool> canReachGoal(V, false);\n {\n queue<int>q;\n for (int i = 0; i < V; i++){\n if(isGoal[i]){\n canReachGoal[i] = true;\n q.push(i);\n }\n }\n while(!q.empty()){\n int cur = q.front(); q.pop();\n for(auto &e : revGraph[cur]){\n if(!canReachGoal[e.to]){\n canReachGoal[e.to] = true;\n q.push(e.to);\n }\n }\n }\n }\n \n vector<bool> inValidSubgraph(V, false);\n for (int i = 0; i < V; i++){\n if(reachable[i] && canReachGoal[i])\n inValidSubgraph[i] = true;\n }\n \n vector<ll> potential(V, INF);\n potential[startId] = 0;\n bool negCycle = false;\n \n for (int iter = 0; iter < V; iter++){\n bool updated = false;\n for (int u = 0; u < V; u++){\n if(!inValidSubgraph[u]) continue;\n if(potential[u] == INF) continue;\n for(auto &e : graph[u]){\n int v = e.to;\n if(!inValidSubgraph[v]) continue;\n if(potential[u] + e.cost < potential[v]){\n potential[v] = potential[u] + e.cost;\n updated = true;\n }\n }\n }\n if(iter == V - 1 && updated) {\n negCycle = true;\n break;\n }\n if(!updated) break;\n }\n \n if(negCycle){\n cout << -1 << endl;\n continue;\n }\n \n for (int u = 0; u < V; u++){\n if(potential[u] == INF) continue;\n for(auto &e : graph[u]){\n if(potential[e.to] == INF) e.rcost = e.cost;\n else e.rcost = e.cost + (int)(potential[u] - potential[e.to]);\n }\n }\n \n vector<int> countPaths(V, 0);\n typedef pair<ll,int> pli;\n priority_queue<pli, vector<pli>, greater<pli>> pq;\n pq.push({0, startId});\n \n vector<ll> sol;\n while(!pq.empty() && (int)sol.size() < k){\n auto cur = pq.top();\n pq.pop();\n ll d = cur.first;\n int u = cur.second;\n \n countPaths[u]++;\n if(countPaths[u] > k) continue;\n \n if(isGoal[u]){\n ll origCost = d + potential[u] - potential[startId];\n sol.push_back(origCost);\n if((int)sol.size() == k) break;\n }\n \n for(auto &edge : graph[u]){\n int v = edge.to;\n ll nd = d + edge.rcost;\n pq.push({nd, v});\n }\n }\n \n if(sol.empty()){\n cout << 0 << \" \" << 0 << endl;\n } else {\n int numPaths = sol.size();\n ll total = 0;\n for(auto cost : sol) total += cost;\n cout << numPaths << \" \" << total << endl;\n }\n }\n return 0;\n}",
"accuracy": 0.5384615384615384,
"time_ms": 10,
"memory_kb": 4116,
"score_of_the_acc": -1,
"final_rank": 12
},
{
"submission_id": "aoj_1090_1173986",
"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 pair<int,int> pii;\ntypedef vector< vector<pii> > graph;\n\nconst int INF = 1e9;\n\ninline int match(int cur, int in, const string &s){\n string prv = s.substr(0,cur) + (char)(in+'0');\n rep(i,cur+1){\n int len = cur+1-i;\n if(s.substr(0,len) == prv.substr(i,len))return len;\n }\n return 0;\n}\n\nvoid dfs(int cur, vector<int> &vis, graph &g){\n if(vis[cur])return;\n vis[cur] = 1;\n for(pii e : g[cur])dfs(e.second, vis, g);\n}\n\nbool BellmanFord(int s, int V, vector<int> &d, const graph &g){\n d = vi(V,INF);\n d[s] = 0;\n rep(azu,V){\n bool f = false;\n rep(i,V)for(pii e : g[i]){\n if(d[i]<INF && d[e.second] > d[i] + e.first){\n\td[e.second] = d[i] + e.first;\n\tf = true;\n }\n }\n if(!f)return true;\n }\n return false;\n}\n\nint main(){\n cin.tie(0); ios::sync_with_stdio(0);\n\n int n,m,k,l;\n string pattern;\n while(cin >> n, n){\n vi col(n);\n rep(i,n)cin >> col[i], col[i]--;\n cin >> m;\n graph base(n);\n rep(i,m){\n int a,b,c;\n cin >> a >> b >> c; a--; b--;\n base[a].push_back(pii(c,b));\n } \n cin >> k >> pattern;\n l = pattern.size();\n\n vector<vi> trans(l, vi(4,0));\n rep(i,l)rep(j,4){\n trans[i][j] = match(i,j+1,pattern);\n }\n\n int V = n*l;\n graph g(V), rg(V);\n rep(i,l)rep(j,n){\n for(pii e : base[j]){\n\tint to = e.second, nxt = trans[i][col[to]];\n\tif(nxt == l)continue;\n\tg[i*n+j].push_back(pii(e.first, nxt*n+to));\n\trg[nxt*n+to].push_back(pii(e.first, i*n+j));\n }\n }\n\n if(trans[0][col[0]] == l){\n cout << \"0 0\" << endl;\n continue;\n }\n\n int S = trans[0][col[0]]*n;\n vi vis(V,0), rvis(V,0);\n dfs(S,vis,g);\n rep(i,l)dfs(i*n+n-1,rvis,rg);\n\n rep(i,V){\n if(vis[i]==0 || rvis[i]==0)g[i].clear();\n rep(j,g[i].size()){\n\tint to = g[i][j].second;\n\tif(vis[to]==0 || rvis[to]==0){\n\t g[i].erase(g[i].begin()+j);\n\t j--;\n\t}\n }\n }\n \n\n vi h;\n if(!BellmanFord(S, V, h, g)){\n cout << -1 << endl;\n continue;\n }\n\n vector< vi > d(V, vi(k,INF));\n d[S][0] = 0;\n priority_queue< pii, vector<pii>, greater<pii> > q;\n q.push(pii(0,S));\n\n while(q.size()){\n pii p = q.top(); q.pop();\n int v = p.second, c = p.first;\n\n for(pii e : g[v]){\n\tint nv = e.second, nc = c + e.first + h[v] - h[nv];\n\tbool f = true;\n\trep(i,k){\n\t if(d[nv][i] > nc){\n\t if(f)q.push(pii(nc,nv)), f=false;\n\t swap(d[nv][i],nc);\n\t }\n\t}\n }\n }\n\t \n vi can;\n rep(i,l)rep(j,k){\n if(d[i*n+n-1][j]!=INF){\n\tcan.push_back(d[i*n+n-1][j] - h[S] + h[i*n+n-1]);\n }\n }\n sort(can.begin(),can.end());\n\n int ans = min((int)can.size(),k);\n long long sum = 0;\n rep(i,ans)sum += can[i];\n cout << ans << \" \" << sum << endl;\n }\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1712,
"score_of_the_acc": -0.1244,
"final_rank": 1
},
{
"submission_id": "aoj_1090_1166779",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nstruct Edge{\n\tint src,dst,weight;\n\tEdge(){}\n\tEdge(int s,int d,int w):src(s),dst(d),weight(w){}\n};\ntypedef vector<vector<Edge>> Graph;\nbool operator<(const Edge& a,const Edge& b){return a.weight<b.weight;}\nbool operator>(const Edge& a,const Edge& b){return a.weight>b.weight;}\n\n// (頂点,その頂点を含めて禁止パターンにマッチした文字数)でグラフを拡張\nGraph extend(const Graph& g,const vi& colors,const vi& forbidden)\n{\n\tvi fail(forbidden.size()+1);\n\tfail[0]=-1;\n\tfor(int i=0,j=-1;i<forbidden.size();){\n\t\twhile(j>=0 && forbidden[i]!=forbidden[j])\n\t\t\tj=fail[j];\n\t\ti++,j++;\n\t\tfail[i]=j;\n\t}\n\t\n\tGraph g2;\n\tmap<pii,int> f;\n\tqueue<tuple<int,int,int,int,int>> q; q.emplace(-1,-1,0,0,0);\n\twhile(q.size()){\n\t\tint u,i,v,j,w; tie(u,i,v,j,w)=q.front(); q.pop();\n\t\twhile(j>=0 && colors[v]!=forbidden[j])\n\t\t\tj=fail[j];\n\t\tj++;\n\t\tif(j==forbidden.size()) continue;\n\t\tif(f.insert(mp(mp(v,j),f.size())).second){\n\t\t\tg2.resize(g2.size()+1);\n\t\t\tfor(auto e:g[v]) q.emplace(v,j,e.dst,j,e.weight);\n\t\t}\n\t\tif(u>=0)\n\t\t\tg2[f[mp(u,i)]].emplace_back(f[mp(u,i)],f[mp(v,j)],w);\n\t}\n\t\n\t// 拡張したグラフには，始点が0~1個，終点が0~n個あるので\n\t// それぞれ1つずつとなるようにまとめる\n\tint src=g2.size(),dst=g2.size()+1;\n\tg2.resize(g2.size()+2);\n\tfor(auto p:f){\n\t\tint i=p.first.first,v=p.second;\n\t\tif(i==0){\n\t\t\tg2[src].emplace_back(src,v,0);\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(auto p:f){\n\t\tint i=p.first.first,v=p.second;\n\t\tif(i==colors.size()-1)\n\t\t\tg2[v].emplace_back(v,dst,0);\n\t}\n\treturn g2;\n}\n\n// V'={v: src ~> v AND v ~> dst}の誘導部分グラフを構築\nGraph induce(const Graph& g)\n{\n\tint n=g.size(),src=n-2,dst=n-1;\n\t\n\tvi vis(n);\n\t{\n\t\tqueue<int> q; q.push(src);\n\t\twhile(q.size()){\n\t\t\tint u=q.front(); q.pop();\n\t\t\tif(vis[u]) continue;\n\t\t\tvis[u]=1;\n\t\t\tfor(auto e:g[u]) q.push(e.dst);\n\t\t}\n\t}\n\t{\n\t\tGraph ig(n);\n\t\trep(i,n) for(auto e:g[i])\n\t\t\tig[e.dst].emplace_back(e.dst,e.src,e.weight);\n\t\tvi vis2(n);\n\t\tqueue<int> q; q.push(dst);\n\t\twhile(q.size()){\n\t\t\tint u=q.front(); q.pop();\n\t\t\tif(vis2[u]) continue;\n\t\t\tvis2[u]=1;\n\t\t\tfor(auto e:ig[u]) q.push(e.dst);\n\t\t}\n\t\trep(i,n) vis[i]&=vis2[i];\n\t}\n\t\n\tGraph g2(n);\n\trep(i,n) for(auto e:g[i])\n\t\tif(vis[e.src] && vis[e.dst])\n\t\t\tg2[e.src].emplace_back(e.src,e.dst,e.weight);\n\treturn g2;\n}\n\nvoid solve(const Graph& g,int k)\n{\n\tint n=g.size(),src=n-2,dst=n-1;\n\t\n\t// ポテンシャルを計算\n\tvi pots(n,INF); pots[src]=0;\n\trep(i,n){\n\t\tbool updated=false;\n\t\trep(j,n) for(auto e:g[j])\n\t\t\tif(pots[e.dst]>pots[e.src]+e.weight){\n\t\t\t\tpots[e.dst]=pots[e.src]+e.weight;\n\t\t\t\tupdated=true;\n\t\t\t}\n\t\tif(i==n-1 && updated){\n\t\t\tcout<<-1<<endl;\n\t\t\treturn;\n\t\t}\n\t}\n\t\n\tvvi dist(n);\n\tpriority_queue<Edge,vector<Edge>,greater<Edge>> pq; pq.emplace(-1,0,0);\n\twhile(pq.size()){\n\t\tEdge cur=pq.top(); pq.pop();\n\t\tif(dist[cur.dst].size()==k) continue;\n\t\tdist[cur.dst].push_back(cur.weight);\n\t\tfor(auto e:g[cur.dst])\n\t\t\tpq.emplace(e.src,e.dst,cur.weight+e.weight+pots[e.src]-pots[e.dst]);\n\t}\n\t\n\tint res=0;\n\tfor(int x:dist[dst]) res+=x+pots[dst];\n\tcout<<dist[dst].size()<<' '<<res<<endl;\n}\n\nint main()\n{\n\tfor(int n;cin>>n && n;){\n\t\tvi colors(n);\n\t\trep(i,n) cin>>colors[i];\n\t\tint m; cin>>m;\n\t\tGraph g(n);\n\t\trep(i,m){\n\t\t\tint u,v,w; cin>>u>>v>>w; u--,v--;\n\t\t\tg[u].emplace_back(u,v,w);\n\t\t}\n\t\tint k; cin>>k;\n\t\tvi forbidden;\n\t\t{\n\t\t\tstring s; cin>>s;\n\t\t\tfor(char c:s) forbidden.push_back(c-'0');\n\t\t}\n\t\t\n\t\tg=induce(extend(g,colors,forbidden));\n\t\tsolve(g,k);\n\t}\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 2136,
"score_of_the_acc": -0.3776,
"final_rank": 3
},
{
"submission_id": "aoj_1090_1166775",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nstruct Edge{\n\tint src,dst,weight;\n\tEdge(){}\n\tEdge(int s,int d,int w):src(s),dst(d),weight(w){}\n};\ntypedef vector<vector<Edge>> Graph;\nbool operator<(const Edge& a,const Edge& b){return a.weight<b.weight;}\nbool operator>(const Edge& a,const Edge& b){return a.weight>b.weight;}\n\nostream& operator<<(ostream& os,const Edge& e){\n\treturn os<<'('<<e.src<<','<<e.dst<<':'<<e.weight<<')';\n}\nvoid print(const Graph& g)\n{\n\trep(i,g.size()){\n\t\tcout<<i<<':';\n\t\tfor(auto e:g[i]) cout<<\" (\"<<e.dst<<':'<<e.weight<<')';\n\t\tcout<<endl;\n\t}\n}\n\n\n// (頂点,その頂点を含めて禁止パターンにマッチした文字数)でグラフを拡張\nGraph extend(const Graph& g,const vi& colors,const vi& forbidden)\n{\n\tvi fail(forbidden.size()+1);\n\tfail[0]=-1;\n\tfor(int i=0,j=-1;i<forbidden.size();){\n\t\twhile(j>=0 && forbidden[i]!=forbidden[j])\n\t\t\tj=fail[j];\n\t\ti++,j++;\n\t\tfail[i]=j;\n\t}\n\t\n\tGraph g2;\n\tmap<pii,int> f;\n\tqueue<tuple<int,int,int,int,int>> q; q.emplace(-1,-1,0,0,0);\n\twhile(q.size()){\n\t\tint u,i,v,j,w; tie(u,i,v,j,w)=q.front(); q.pop();\n\t\twhile(j>=0 && colors[v]!=forbidden[j])\n\t\t\tj=fail[j];\n\t\tj++;\n\t\tif(j==forbidden.size()) continue;\n\t\tbool newv=f.insert(mp(mp(v,j),f.size())).second;\n\t\tif(newv) g2.resize(g2.size()+1);\n\t\tif(u>=0) g2[f[mp(u,i)]].emplace_back(f[mp(u,i)],f[mp(v,j)],w);\n\t\tif(newv)\n\t\t\tfor(auto e:g[v])\n\t\t\t\tq.emplace(v,j,e.dst,j,e.weight);\n\t}\n\t\n\t// 拡張したグラフには，始点が0~1個，終点が0~n個あるので\n\t// それぞれ1つずつとなるようにまとめる\n\tint src=g2.size(),dst=g2.size()+1;\n\tg2.resize(g2.size()+2);\n\tfor(auto p:f){\n\t\tint i=p.first.first,v=p.second;\n\t\tif(i==0){\n\t\t\tg2[src].emplace_back(src,v,0);\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(auto p:f){\n\t\tint i=p.first.first,v=p.second;\n\t\tif(i==colors.size()-1)\n\t\t\tg2[v].emplace_back(v,dst,0);\n\t}\n\treturn g2;\n}\n\n// V'={v: src ~> v AND v ~> dst}の誘導部分グラフを構築\nGraph induce(const Graph& g)\n{\n\tint src=g.size()-2,dst=g.size()-1;\n\t\n\tvi vis1(g.size());\n\tqueue<int> q; q.push(src);\n\twhile(q.size()){\n\t\tint u=q.front(); q.pop();\n\t\tif(vis1[u]) continue;\n\t\tvis1[u]=1;\n\t\tfor(auto e:g[u]) q.push(e.dst);\n\t}\n\t\n\tGraph ig(g.size());\n\trep(i,g.size()) for(auto e:g[i])\n\t\tig[e.dst].emplace_back(e.dst,e.src,e.weight);\n\t\n\tvi vis2(g.size());\n\tq.push(dst);\n\twhile(q.size()){\n\t\tint u=q.front(); q.pop();\n\t\tif(vis2[u]) continue;\n\t\tvis2[u]=1;\n\t\tfor(auto e:ig[u]) q.push(e.dst);\n\t}\n\t\n\tGraph g2(g.size());\n\trep(i,g.size()) for(auto e:g[i])\n\t\tif(vis1[e.src] && vis2[e.src] && vis1[e.dst] && vis2[e.dst])\n\t\t\tg2[e.src].emplace_back(e.src,e.dst,e.weight);\n\treturn g2;\n}\n\nvoid solve(const Graph& g,int k)\n{\n\tint n=g.size();\n\tint src=g.size()-2,dst=g.size()-1;\n\t\n\tvi pots(n,INF); pots[src]=0;\n\trep(i,n){\n\t\tbool updated=false;\n\t\trep(j,n) for(auto e:g[j])\n\t\t\tif(pots[e.dst]>pots[e.src]+e.weight){\n\t\t\t\tpots[e.dst]=pots[e.src]+e.weight;\n\t\t\t\tupdated=true;\n\t\t\t}\n\t\tif(i==n-1 && updated){\n\t\t\tcout<<-1<<endl;\n\t\t\treturn;\n\t\t}\n\t}\n\t\n\tvvi dist(n);\n\tpriority_queue<Edge,vector<Edge>,greater<Edge>> pq; pq.emplace(-1,0,0);\n\twhile(pq.size()){\n\t\tEdge cur=pq.top(); pq.pop();\n\t\tif(dist[cur.dst].size()==k) continue;\n\t\tdist[cur.dst].push_back(cur.weight);\n\t\tfor(auto e:g[cur.dst])\n\t\t\tpq.emplace(e.src,e.dst,cur.weight+e.weight+pots[e.src]-pots[e.dst]);\n\t}\n\t//dump(g);\n\t//dump(pots);\n\t//dump(dist);\n\t//rep(i,n){\n\t//\trep(j,dist[i].size()) cout<<dist[i][j]+pots[i]<<' ';\n\t//\tcout<<endl;\n\t//}\n\t\n\tint res=0;\n\tfor(int x:dist[dst]) res+=x+pots[dst];\n\tcout<<dist[dst].size()<<' '<<res<<endl;\n}\n\nint main()\n{\n\tfor(int n;cin>>n && n;){\n\t\tvi colors(n);\n\t\trep(i,n) cin>>colors[i];\n\t\tint m; cin>>m;\n\t\tGraph g(n);\n\t\trep(i,m){\n\t\t\tint u,v,w; cin>>u>>v>>w; u--,v--;\n\t\t\tg[u].emplace_back(u,v,w);\n\t\t}\n\t\tint k; cin>>k;\n\t\tvi forbidden;\n\t\t{\n\t\t\tstring s; cin>>s;\n\t\t\trep(i,s.size()) forbidden.push_back(s[i]-'0');\n\t\t}\n\t\t\n\t\tg=induce(extend(g,colors,forbidden));\n\t\tsolve(g,k);\n\t}\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 2204,
"score_of_the_acc": -0.4098,
"final_rank": 4
},
{
"submission_id": "aoj_1090_622196",
"code_snippet": "//#define _GLIBCXX_DEBUG\n#include <iostream>\n#include <vector>\n#include <string>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <cassert>\n\nusing namespace std;\n\n#define FOREACH(it,c) for(__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)\n#define TIMES(i,n) for(int i = 0; i < (n); ++i)\n\ntypedef long long Cost;\nconst long long INF = 1000*1000*10*10*2*10LL;\n\nstruct Edge {\n int from, to;\n Cost cost;\n\n Edge() {}\n Edge(int f, int t, Cost c) : from(f), to(t), cost(c) {}\n};\n\nstruct DistTag {\n int size;\n deque<Cost> buf, newbie;\n\n DistTag(int size) : size(size), buf(size, INF) {\n //newbie.reserve(size);\n }\n\n bool insert(Cost val) {\n if(buf.back() <= val) return false;\n deque<Cost>::iterator ins_pos = upper_bound(newbie.begin(), newbie.end(), val);\n newbie.insert(ins_pos, val);\n if(static_cast<int>(newbie.size()) > size) newbie.pop_back();\n return true;\n }\n\n bool has(Cost val) {\n return buf.back() >= val;\n }\n\n void flush() {\n FOREACH(it, newbie) {\n deque<Cost>::iterator ins_pos = upper_bound(buf.begin(), buf.end(), *it);\n buf.insert(ins_pos, *it);\n }\n buf.resize(size);\n newbie.clear();\n }\n};\n\nstruct State {\n int pos;\n Cost cost;\n\n State() {}\n State(int p, Cost c) : pos(p), cost(c) {}\n\n bool operator <(const State &other) const {\n return cost > other.cost; // Reversed\n }\n};\n\ntypedef vector<Edge> EdgeList;\n\nvoid check_reachable(int start, const vector<EdgeList> &graph, vector<unsigned char> &reachable) {\n queue<int> q;\n q.push(start);\n reachable[start] = 1;\n while(!q.empty()) {\n int cur = q.front();\n q.pop();\n FOREACH(it, graph[cur]) {\n if(!reachable[it->to]) {\n reachable[it->to] = 1;\n q.push(it->to);\n }\n }\n }\n}\n\nbool relax(const vector<EdgeList> &graph, vector<Cost> &dist) {\n bool updated = false;\n FOREACH(list_it, graph) {\n FOREACH(it, *list_it) {\n const Cost cost = dist[it->from] + it->cost;\n if(dist[it->to] > cost) {\n dist[it->to] = cost;\n updated = true;\n }\n }\n }\n return updated;\n}\n\npair<int,Cost> search(int start, const vector<EdgeList> &graph, int N, int P, int K) {\n vector<DistTag> dist(graph.size(), DistTag(K));\n dist[start].insert(0);\n\n TIMES(_, static_cast<int>(graph.size())*K) {\n TIMES(i, static_cast<int>(graph.size())) {\n DistTag &dt = dist[i];\n if(dt.newbie.size() == 0) continue;\n vector<int> tmp;\n FOREACH(it, graph[i]) {\n assert(it->from == i);\n // Corner case: loop edge\n if(it->to == i) {\n FOREACH(nit, dt.newbie) {\n tmp.push_back(*nit + it->cost);\n }\n } else {\n FOREACH(nit, dt.newbie) {\n //cout << \"insert \" << i << ' ' << it->to << endl;\n dist[it->to].insert(*nit + it->cost);\n }\n }\n }\n dt.flush();\n FOREACH(tit, tmp) {\n dt.insert(*tit);\n }\n }\n }\n pair<int,Cost> res(0, 0);\n vector<Cost> costs;\n TIMES(i, P) {\n FOREACH(it, dist[(N-1)*P+i].buf) {\n costs.push_back(*it);\n }\n }\n sort(costs.begin(), costs.end());\n TIMES(i, min(K, static_cast<int>(costs.size()))) {\n if(costs[i] == INF) break;\n res.first++;\n res.second += costs[i];\n }\n return res;\n}\n\npair<int,Cost> solve(int N) {\n vector<int> color_of(N);\n TIMES(i, N) {\n cin >> color_of[i];\n --color_of[i];\n }\n int M;\n cin >> M;\n vector<Edge> edges(M);\n TIMES(i, M) {\n Edge &e = edges[i];\n cin >> e.from >> e.to >> e.cost;\n --e.from; --e.to;\n }\n int K;\n cin >> K;\n vector<int> prohibited;\n {\n string str;\n cin >> str;\n FOREACH(it, str) {\n prohibited.push_back(*it - '0' - 1);\n }\n }\n const int P = prohibited.size();\n vector<vector<int> > next_prohibited_pos(P, vector<int>(4, 0));\n {\n int shadow = 0;\n TIMES(i, P) {\n next_prohibited_pos[i][prohibited[i]] = i+1;\n if(i > 0) {\n TIMES(j, 4) {\n if(j != prohibited[i]) next_prohibited_pos[i][j] = next_prohibited_pos[shadow][j];\n }\n shadow = next_prohibited_pos[shadow][prohibited[i]];\n }\n }\n }\n\n const int start = 0+next_prohibited_pos[0][color_of[0]];\n vector<EdgeList> graph(N*P);\n FOREACH(it, edges) {\n TIMES(i, P) {\n // Cannot reach this state.\n if(i > 0 && prohibited[i-1] != color_of[it->from]) continue;\n\n int np = next_prohibited_pos[i][color_of[it->to]];\n if(np < P) {\n graph[it->from*P+i].push_back(Edge(it->from*P+i, it->to*P+np, it->cost));\n //cout << it->from << ' ' << i << ' ' << it->to << ' ' << np << endl;\n }\n }\n }\n\n // Remove all unreachable nodes.\n // It causes fake negative loop detection.\n vector<unsigned char> reachable(N*P, 0);\n check_reachable(start, graph, reachable);\n TIMES(i, N*P) {\n if(!reachable[i]) graph[i].clear();\n }\n\n // Check if it has negative loop\n vector<Cost> dist(N*P, INF);\n dist[start] = 0;\n TIMES(_, N*P) {\n relax(graph, dist);\n }\n vector<Cost> tmp_last(P);\n TIMES(i, P) {\n tmp_last[i] = dist[(N-1)*P+i];\n }\n TIMES(_, N*P) {\n relax(graph, dist);\n TIMES(i, P) {\n if(dist[(N-1)*P+i] != tmp_last[i]) return make_pair(-1, -1);\n }\n }\n\n // Corner case: cannot start\n if(P == 1 && prohibited[0] == color_of[0]) return make_pair(0, 0);\n\n pair<int,Cost> res = search(start, graph, N, P, K);\n return res;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int N;\n while(cin >> N) {\n if(!N) break;\n pair<int,Cost> ans = solve(N);\n if(ans.first == -1) cout << -1 << endl;\n else cout << ans.first << ' ' << ans.second << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 1500,
"memory_kb": 3108,
"score_of_the_acc": -1.6216,
"final_rank": 10
},
{
"submission_id": "aoj_1090_622190",
"code_snippet": "#define _GLIBCXX_DEBUG\n#include <iostream>\n#include <vector>\n#include <string>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <cassert>\n\nusing namespace std;\n\n#define FOREACH(it,c) for(__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)\n#define TIMES(i,n) for(int i = 0; i < (n); ++i)\n\ntypedef long long Cost;\nconst long long INF = 1000*1000*10*10*2*10LL;\n\nstruct Edge {\n int from, to;\n Cost cost;\n\n Edge() {}\n Edge(int f, int t, Cost c) : from(f), to(t), cost(c) {}\n};\n\nstruct DistTag {\n int size;\n deque<Cost> buf, newbie;\n\n DistTag(int size) : size(size), buf(size, INF) {\n //newbie.reserve(size);\n }\n\n bool insert(Cost val) {\n if(buf.back() <= val) return false;\n deque<Cost>::iterator ins_pos = upper_bound(newbie.begin(), newbie.end(), val);\n newbie.insert(ins_pos, val);\n if(static_cast<int>(newbie.size()) > size) newbie.pop_back();\n return true;\n }\n\n bool has(Cost val) {\n return buf.back() >= val;\n }\n\n void flush() {\n FOREACH(it, newbie) {\n deque<Cost>::iterator ins_pos = upper_bound(buf.begin(), buf.end(), *it);\n buf.insert(ins_pos, *it);\n }\n buf.resize(size);\n newbie.clear();\n }\n};\n\nstruct State {\n int pos;\n Cost cost;\n\n State() {}\n State(int p, Cost c) : pos(p), cost(c) {}\n\n bool operator <(const State &other) const {\n return cost > other.cost; // Reversed\n }\n};\n\ntypedef vector<Edge> EdgeList;\n\nvoid check_reachable(int start, const vector<EdgeList> &graph, vector<unsigned char> &reachable) {\n queue<int> q;\n q.push(start);\n reachable[start] = 1;\n while(!q.empty()) {\n int cur = q.front();\n q.pop();\n FOREACH(it, graph[cur]) {\n if(!reachable[it->to]) {\n reachable[it->to] = 1;\n q.push(it->to);\n }\n }\n }\n}\n\nbool relax(const vector<EdgeList> &graph, vector<Cost> &dist) {\n bool updated = false;\n FOREACH(list_it, graph) {\n FOREACH(it, *list_it) {\n const Cost cost = dist[it->from] + it->cost;\n if(dist[it->to] > cost) {\n dist[it->to] = cost;\n updated = true;\n }\n }\n }\n return updated;\n}\n\npair<int,Cost> search(int start, const vector<EdgeList> &graph, int N, int P, int K) {\n vector<DistTag> dist(graph.size(), DistTag(K));\n dist[start].insert(0);\n\n TIMES(_, static_cast<int>(graph.size())*K) {\n TIMES(i, static_cast<int>(graph.size())) {\n DistTag &dt = dist[i];\n if(dt.newbie.size() == 0) continue;\n FOREACH(it, graph[i]) {\n assert(it->from == i);\n FOREACH(nit, dt.newbie) {\n //cout << \"insert \" << i << ' ' << it->to << endl;\n dist[it->to].insert(*nit + it->cost);\n }\n }\n dt.flush();\n }\n }\n pair<int,Cost> res(0, 0);\n vector<Cost> costs;\n TIMES(i, P) {\n FOREACH(it, dist[(N-1)*P+i].buf) {\n costs.push_back(*it);\n }\n }\n sort(costs.begin(), costs.end());\n TIMES(i, min(K, static_cast<int>(costs.size()))) {\n if(costs[i] == INF) break;\n res.first++;\n res.second += costs[i];\n }\n return res;\n}\n\npair<int,Cost> solve(int N) {\n vector<int> color_of(N);\n TIMES(i, N) {\n cin >> color_of[i];\n --color_of[i];\n }\n int M;\n cin >> M;\n vector<Edge> edges(M);\n TIMES(i, M) {\n Edge &e = edges[i];\n cin >> e.from >> e.to >> e.cost;\n --e.from; --e.to;\n }\n int K;\n cin >> K;\n vector<int> prohibited;\n {\n string str;\n cin >> str;\n FOREACH(it, str) {\n prohibited.push_back(*it - '0' - 1);\n }\n }\n const int P = prohibited.size();\n vector<vector<int> > next_prohibited_pos(P, vector<int>(4, 0));\n {\n int shadow = 0;\n TIMES(i, P) {\n next_prohibited_pos[i][prohibited[i]] = i+1;\n if(i > 0) {\n TIMES(j, 4) {\n if(j != prohibited[i]) next_prohibited_pos[i][j] = next_prohibited_pos[shadow][j];\n }\n shadow = next_prohibited_pos[shadow][prohibited[i]];\n }\n }\n }\n\n const int start = 0+next_prohibited_pos[0][color_of[0]];\n vector<EdgeList> graph(N*P);\n FOREACH(it, edges) {\n TIMES(i, P) {\n // Cannot reach this state.\n if(i > 0 && prohibited[i-1] != color_of[it->from]) continue;\n\n int np = next_prohibited_pos[i][color_of[it->to]];\n if(np < P) {\n graph[it->from*P+i].push_back(Edge(it->from*P+i, it->to*P+np, it->cost));\n //cout << it->from << ' ' << i << ' ' << it->to << ' ' << np << endl;\n }\n }\n }\n\n // Remove all unreachable nodes.\n // It causes fake negative loop detection.\n vector<unsigned char> reachable(N*P, 0);\n check_reachable(start, graph, reachable);\n TIMES(i, N*P) {\n if(!reachable[i]) graph[i].clear();\n }\n\n // Check if it has negative loop\n vector<Cost> dist(N*P, INF);\n dist[start] = 0;\n TIMES(_, N*P) {\n relax(graph, dist);\n }\n vector<Cost> tmp_last(P);\n TIMES(i, P) {\n tmp_last[i] = dist[(N-1)*P+i];\n }\n TIMES(_, N*P) {\n relax(graph, dist);\n TIMES(i, P) {\n if(dist[(N-1)*P+i] != tmp_last[i]) return make_pair(-1, -1);\n }\n }\n\n // Corner case: cannot start\n if(P == 1 && prohibited[0] == color_of[0]) return make_pair(0, 0);\n\n pair<int,Cost> res = search(start, graph, N, P, K);\n return res;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int N;\n while(cin >> N) {\n if(!N) break;\n pair<int,Cost> ans = solve(N);\n if(ans.first == -1) cout << -1 << endl;\n else cout << ans.first << ' ' << ans.second << endl;\n }\n return 0;\n}",
"accuracy": 0.5384615384615384,
"time_ms": 20,
"memory_kb": 1452,
"score_of_the_acc": -0.0067,
"final_rank": 11
},
{
"submission_id": "aoj_1090_622189",
"code_snippet": "#define _GLIBCXX_DEBUG\n#include <iostream>\n#include <vector>\n#include <string>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <cassert>\n\nusing namespace std;\n\n#define FOREACH(it,c) for(__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)\n#define TIMES(i,n) for(int i = 0; i < (n); ++i)\n\ntypedef long long Cost;\nconst long long INF = 1000*1000*10*10*2*10LL;\n\nstruct Edge {\n int from, to;\n Cost cost;\n\n Edge() {}\n Edge(int f, int t, Cost c) : from(f), to(t), cost(c) {}\n};\n\nstruct DistTag {\n int size;\n deque<Cost> buf, newbie;\n\n DistTag(int size) : size(size), buf(size, INF) {\n //newbie.reserve(size);\n }\n\n bool insert(Cost val) {\n if(buf.back() <= val) return false;\n deque<Cost>::iterator ins_pos = upper_bound(newbie.begin(), newbie.end(), val);\n newbie.insert(ins_pos, val);\n if(static_cast<int>(newbie.size()) > size) newbie.pop_back();\n return true;\n }\n\n bool has(Cost val) {\n return buf.back() >= val;\n }\n\n void flush() {\n FOREACH(it, newbie) {\n deque<Cost>::iterator ins_pos = upper_bound(buf.begin(), buf.end(), *it);\n buf.insert(ins_pos, *it);\n }\n buf.resize(size);\n newbie.clear();\n }\n};\n\nstruct State {\n int pos;\n Cost cost;\n\n State() {}\n State(int p, Cost c) : pos(p), cost(c) {}\n\n bool operator <(const State &other) const {\n return cost > other.cost; // Reversed\n }\n};\n\ntypedef vector<Edge> EdgeList;\n\nvoid check_reachable(int start, const vector<EdgeList> &graph, vector<unsigned char> &reachable) {\n queue<int> q;\n q.push(start);\n reachable[start] = 1;\n while(!q.empty()) {\n int cur = q.front();\n q.pop();\n FOREACH(it, graph[cur]) {\n if(!reachable[it->to]) {\n reachable[it->to] = 1;\n q.push(it->to);\n }\n }\n }\n}\n\nbool relax(const vector<EdgeList> &graph, vector<Cost> &dist) {\n bool updated = false;\n FOREACH(list_it, graph) {\n FOREACH(it, *list_it) {\n const Cost cost = dist[it->from] + it->cost;\n if(dist[it->to] > cost) {\n dist[it->to] = cost;\n updated = true;\n }\n }\n }\n return updated;\n}\n\npair<int,Cost> search(int start, const vector<EdgeList> &graph, int N, int P, int K) {\n vector<DistTag> dist(graph.size(), DistTag(K));\n dist[start].insert(0);\n\n TIMES(_, static_cast<int>(graph.size())*K) {\n TIMES(i, static_cast<int>(graph.size())) {\n DistTag &dt = dist[i];\n if(dt.newbie.size() == 0) continue;\n FOREACH(it, graph[i]) {\n assert(it->from == i);\n FOREACH(nit, dt.newbie) {\n //cout << \"insert \" << i << ' ' << it->to << endl;\n dist[it->to].insert(*nit + it->cost);\n }\n }\n dt.flush();\n }\n }\n pair<int,Cost> res(0, 0);\n vector<Cost> costs;\n TIMES(i, P) {\n FOREACH(it, dist[(N-1)*P+i].buf) {\n costs.push_back(*it);\n }\n }\n sort(costs.begin(), costs.end());\n TIMES(i, min(K, static_cast<int>(costs.size()))) {\n if(costs[i] == INF) break;\n res.first++;\n res.second += costs[i];\n }\n return res;\n}\n\npair<int,Cost> solve(int N) {\n vector<int> color_of(N);\n TIMES(i, N) {\n cin >> color_of[i];\n --color_of[i];\n }\n int M;\n cin >> M;\n vector<Edge> edges(M);\n TIMES(i, M) {\n Edge &e = edges[i];\n cin >> e.from >> e.to >> e.cost;\n --e.from; --e.to;\n }\n int K;\n cin >> K;\n vector<int> prohibited;\n {\n string str;\n cin >> str;\n FOREACH(it, str) {\n prohibited.push_back(*it - '0' - 1);\n }\n }\n const int P = prohibited.size();\n vector<vector<int> > next_prohibited_pos(P, vector<int>(4, 0));\n {\n int shadow = 0;\n TIMES(i, P) {\n next_prohibited_pos[i][prohibited[i]] = i+1;\n if(i > 0) {\n TIMES(j, 4) {\n if(j != prohibited[i]) next_prohibited_pos[i][j] = next_prohibited_pos[shadow][j];\n }\n shadow = next_prohibited_pos[shadow][prohibited[i]];\n }\n }\n }\n\n const int start = 0+next_prohibited_pos[0][color_of[0]];\n vector<EdgeList> graph(N*P);\n FOREACH(it, edges) {\n TIMES(i, P) {\n // Cannot reach this state.\n if(i > 0 && prohibited[i-1] != color_of[it->from]) continue;\n\n int np = next_prohibited_pos[i][color_of[it->to]];\n if(np < P) {\n graph[it->from*P+i].push_back(Edge(it->from*P+i, it->to*P+np, it->cost));\n //cout << it->from << ' ' << i << ' ' << it->to << ' ' << np << endl;\n }\n }\n }\n\n // Remove all unreachable nodes.\n // It causes fake negative loop detection.\n vector<unsigned char> reachable(N*P, 0);\n check_reachable(start, graph, reachable);\n TIMES(i, N*P) {\n if(!reachable[i]) graph[i].clear();\n }\n\n // Check if it has negative loop\n vector<Cost> dist(N*P, INF);\n dist[start] = 0;\n TIMES(_, N*P) {\n relax(graph, dist);\n }\n vector<Cost> tmp_last(P);\n TIMES(i, P) {\n tmp_last[i] = dist[(N-1)*P+i];\n }\n TIMES(_, N*P) {\n relax(graph, dist);\n TIMES(i, P) {\n if(dist[(N-1)*P+i] != tmp_last[i]) return make_pair(-1, -1);\n }\n }\n\n pair<int,Cost> res = search(start, graph, N, P, K);\n return res;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int N;\n while(cin >> N) {\n if(!N) break;\n pair<int,Cost> ans = solve(N);\n if(ans.first == -1) cout << -1 << endl;\n else cout << ans.first << ' ' << ans.second << endl;\n }\n return 0;\n}",
"accuracy": 0.23076923076923078,
"time_ms": 20,
"memory_kb": 1460,
"score_of_the_acc": -0.0097,
"final_rank": 13
},
{
"submission_id": "aoj_1090_373127",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <queue>\n#include <string>\n#include <map>\n#include <set>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\ntypedef int Weight;\nstruct Edge {\n int src;\n int dest;\n Weight weight;\n Edge(int src, int dest, Weight weight) : src(src), dest(dest), weight(weight) {;}\n bool operator<(const Edge &rhs) const {\n return weight > rhs.weight;\n }\n};\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\ntypedef vector<Weight> Array;\ntypedef vector<Array> Matrix;\n\nvoid PrintMatrix(const Matrix &matrix) {\n for (int y = 0; y < (int)matrix.size(); y++) {\n for (int x = 0; x < (int)matrix[y].size(); x++) {\n printf(\"%d \", matrix[y][x]);\n }\n puts(\"\");\n }\n}\n\nbool end[1100];\nstatic const Weight INF = 2000000000LL;\nWeight BellmanFord(const Graph &g, Array &dist) {\n const int n = g.size();\n dist = Array(n, 0x0f0f0f0f);\n dist[0] = 0;\n REP(iter, n) {\n bool e = true;\n REP(i, n) {\n REP(j, g[i].size()) {\n int to = g[i][j].dest;\n Weight ncost = dist[i] + g[i][j].weight;\n if (dist[to] > ncost) {\n dist[to] = ncost;\n e = false;\n }\n }\n }\n if (e) { return 0; }\n }\n return -INF;\n}\n\nint n, m, k, len;\nint color[110];\nchar ban[1000];\nint memo[20][20];\n\nint OneMove(int pattern, int c) {\n if (ban[pattern] == c) { return pattern + 1; }\n if (memo[pattern][c] != -1) { return memo[pattern][c]; }\n deque<int> now;\n REP(i, pattern) { now.push_back(ban[i]); }\n now.push_back(c);\n while (!now.empty()) {\n now.pop_front();\n REP(i, now.size()) {\n if (now[i] != ban[i]) { goto next; }\n }\n break;\nnext:;\n }\n return memo[pattern][c] = now.size();\n}\n\nGraph Expand(Graph g) {\n MEMSET(memo, -1);\n vector<bool> visit(n * len, false);\n queue<pair<int, int> > que;\n int first = color[0] == ban[0] ? 1 : 0;\n que.push(make_pair(0, first));\n Graph ret(n * len);\n if (len == first) { return ret; }\n while (!que.empty()) {\n int from = que.front().first;\n int pattern = que.front().second;\n que.pop();\n if (visit[from * len + pattern]) { continue; }\n visit[from * len + pattern] = true;\n FORIT(it, g[from]) {\n int to = it->dest;\n int c = color[to];\n int npattern = OneMove(pattern, c);\n if (npattern == len) { continue; }\n ret[from * len + pattern].push_back(Edge(from * len + pattern, to * len + npattern, it->weight));\n que.push(make_pair(to, npattern));\n }\n }\n return ret;\n}\n\nGraph revG(Graph g) {\n Graph ret(g.size());\n REP(i, g.size()) {\n FORIT(it, g[i]) {\n ret[it->dest].push_back(Edge(it->dest, it->src, it->weight));\n }\n }\n return ret;\n}\n\nvoid dfs(const Graph &g, int from, vector<bool> &visit) {\n if (visit[from]) { return; }\n visit[from] = true;\n FORIT(it, g[from]) {\n dfs(g, it->dest, visit);\n }\n}\n\nGraph Erase(Graph g) {\n MEMSET(end, false);\n vector<bool> visit1(1010, 0);\n vector<bool> visit2(1010, 0);\n Graph rev = revG(g);\n dfs(g, color[0] == ban[0], visit1);\n if (len == 1 && color[0] == ban[0]) { visit1[1] = false; }\n REP(i, len) { dfs(rev, (n - 1) * len + i, visit2); }\n int m = 0;\n map<int, int> mapto;\n REP(i, n * len) {\n if (!visit1[i] || !visit2[i]) { continue; }\n if (i >= (n - 1) * len) { end[m] = true; }\n mapto[i] = m++;\n }\n Graph ret(m);\n REP(i, n * len) {\n if (!mapto.count(i)) { continue; }\n int from = mapto[i];\n FORIT(it, g[i]) {\n if (!mapto.count(it->dest)) { continue; }\n int to = mapto[it->dest];\n ret[from].push_back(Edge(from, to, it->weight));\n }\n }\n return ret;\n}\n\nvector<int> dists[1010];\npair<int, int> calc(const Graph &g) {\n if (g.size() == 0) { return make_pair(0, 0); }\n Array dist;\n int v = BellmanFord(g, dist);\n if (v == -INF) { return make_pair(-1, -1); }\n priority_queue<Edge> que;\n que.push(Edge(0, 0, 0));\n REP(i, 1010) { dists[i].clear(); }\n vector<int> ans;\n while (!que.empty()) {\n Edge e = que.top();\n que.pop();\n int from = e.dest;\n if ((int)dists[from].size() == k) { continue; }\n dists[from].push_back(e.weight);\n if (end[from]) { ans.push_back(e.weight + dist[from]); }\n FORIT(it, g[from]) {\n int to = it->dest;\n int ncost = it->weight + e.weight + (dist[from] - dist[to]);\n que.push(Edge(from, to, ncost));\n }\n }\n pair<int, int> ret = make_pair(0, 0);\n sort(ans.begin(), ans.end());\n ret.first = min(k, (int)ans.size());\n REP(i, ret.first) { ret.second += ans[i]; }\n return ret;\n}\n\nint main() {\n while (scanf(\"%d\", &n), n) {\n REP(i, n) { scanf(\"%d\", &color[i]); }\n scanf(\"%d\", &m);\n Graph g(n);\n REP(i, m) {\n int f, t, c;\n scanf(\"%d %d %d\", &f, &t, &c);\n f--; t--;\n g[f].push_back(Edge(f, t, c));\n }\n scanf(\"%d\", &k);\n scanf(\"%s\", ban);\n len = strlen(ban);\n REP(i, len) { ban[i] -= '0'; }\n g = Expand(g);\n g = Erase(g);\n pair<int, int> ans = calc(g);\n if (ans.first == -1) {\n puts(\"-1\");\n } else {\n printf(\"%d %d\\n\", ans.first, ans.second);\n }\n }\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 1948,
"score_of_the_acc": -0.2936,
"final_rank": 2
},
{
"submission_id": "aoj_1090_365781",
"code_snippet": "#include<queue>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nstruct edge{ int v,cost; };\n\nstruct Xnode{\n\tint u,t;\n\tbool operator<(const Xnode &X)const{ return u<X.u || u==X.u && t<X.t; }\n};\n\nstruct Xedge{\n\tXnode X;\n\tint cost;\n};\n\nint n,color[100],K,len;\nvector<edge> G[100];\nchar pttn[11];\n\nbool input(){\n\tscanf(\"%d\",&n);\n\tif(n==0) return false;\n\trep(u,n){\n\t\tG[u].clear();\n\t\tscanf(\"%d\",color+u);\n\t}\n\tint m; scanf(\"%d\",&m);\n\trep(i,m){\n\t\tint u,v,cost; scanf(\"%d%d%d\",&u,&v,&cost); u--; v--;\n\t\tG[u].push_back((edge){v,cost});\n\t}\n\tscanf(\"%d%s\",&K,pttn);\n\tlen=strlen(pttn);\n\treturn true;\n}\n\nvector<Xedge> XG[100][10],XG_rev[101][10];\nvoid build_XG(){\n\trep(u,n+1) rep(t,max(len,2)) {\n\t\tXG[u][t].clear();\n\t\tXG_rev[u][t].clear();\n\t}\n\n\trep(u,n) rep(t,len) rep(i,G[u].size()) {\n\t\tint v=G[u][i].v,cost=G[u][i].cost;\n\n\t\tchar tmp[12]={};\n\t\tstrncpy(tmp,pttn,t);\n\t\ttmp[t]=color[v]+'0';\n\t\tint t_next;\n\t\tfor(t_next=t+1;strncmp(pttn,tmp+(t+1)-t_next,t_next);t_next--);\n\n\t\tif(t_next<len){\n\t\t\tXG[u][t].push_back((Xedge){(Xnode){v,t_next},cost});\n\t\t\tXG_rev[v][t_next].push_back((Xedge){(Xnode){u,t},cost});\n\t\t}\n\t}\n\trep(t,len) XG_rev[n][0].push_back((Xedge){(Xnode){n-1,t},0});\n}\n\nbool vis[101][10];\nbool dfs(int u,int t){\n\tvis[u][t]=true;\n\trep(i,XG[u][t].size()){\n\t\tconst Xedge &e=XG[u][t][i];\n\t\tint v=e.X.u,t_next=e.X.t;\n\t\tif(!vis[v][t_next]) dfs(v,t_next);\n\t}\n}\n\nbool vis_rev[101][10];\nbool dfs_rev(int v,int t){\n\tvis_rev[v][t]=true;\n\trep(i,XG_rev[v][t].size()){\n\t\tconst Xedge &e=XG_rev[v][t][i];\n\t\tint u=e.X.u,t_prev=e.X.t;\n\t\tif(!vis_rev[u][t_prev]) dfs_rev(u,t_prev);\n\t}\n}\n\nvoid delete_Xnodes(){\n\trep(u,n+1) rep(t,len) vis[u][t]=vis_rev[u][t]=false;\n\n\tint t0=(pttn[0]==color[0]+'0'?1:0);\n\tdfs(0,t0);\n\tdfs_rev(n,0);\n\n\trep(u,n) rep(t,len) {\n\t\tif(!vis[u][t] || !vis_rev[u][t]){\n\t\t\tXG[u][t].clear();\n\t\t}\n\t\telse{\n\t\t\trep(i,XG[u][t].size()){\n\t\t\t\tconst Xedge &e=XG[u][t][i];\n\t\t\t\tint v=e.X.u,t_next=e.X.t;\n\t\t\t\tif(!vis[v][t_next] || !vis_rev[v][t_next]){\n\t\t\t\t\tXG[u][t].erase(XG[u][t].begin()+i);\n\t\t\t\t\ti--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nint pot[101][10];\nbool calc_potential(){\n\trep(u,n+1) rep(t,len) pot[u][t]=0;\n\n\trep(c,n*len){\n\t\trep(u,n+1) rep(t,len) rep(i,XG[u][t].size()) {\n\t\t\tconst Xedge &e=XG[u][t][i];\n\t\t\tint v=e.X.u,t_next=e.X.t,cost=e.cost;\n\t\t\tif(pot[u][t]+cost<pot[v][t_next]){\n\t\t\t\tpot[v][t_next]=pot[u][t]+cost;\n\t\t\t\tif(c==n*len-1){\n\t\t\t\t\tputs(\"-1\");\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid Kth_shortest_path(){\n\tint nd[100][10]={},d[100][10][10];\n\tint t0=(pttn[0]==color[0]+'0'?1:0);\n\n\tpriority_queue< pair<int,Xnode> > Q;\n\tQ.push(make_pair(0,(Xnode){0,t0}));\n\twhile(!Q.empty()){\n\t\tint d_now=-Q.top().first;\n\t\tint u=Q.top().second.u,t=Q.top().second.t; Q.pop();\n\n\t\tif(nd[u][t]==K) continue;\n\t\td[u][t][nd[u][t]++]=d_now;\n\n\t\trep(i,XG[u][t].size()){\n\t\t\tconst Xedge &e=XG[u][t][i];\n\t\t\tint v=e.X.u,t_next=e.X.t,cost=e.cost;\n\t\t\tif(nd[v][t_next]<K){\n\t\t\t\tint d_next=d_now+cost+pot[u][t]-pot[v][t_next];\n\t\t\t\tQ.push(make_pair(-d_next,(Xnode){v,t_next}));\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<int> ans;\n\trep(t,len) rep(i,nd[n-1][t]) ans.push_back(d[n-1][t][i]-pot[0][t0]+pot[n-1][t]);\n\tsort(ans.begin(),ans.end());\n\n\tint n_ans=min((int)ans.size(),K),ans_sum=0;\n\trep(i,n_ans) ans_sum+=ans[i];\n\tprintf(\"%d %d\\n\",n_ans,ans_sum);\n}\n\nint main(){\n\twhile(input()){\n\t\tbuild_XG();\n\t\tdelete_Xnodes();\n\t\tif(!calc_potential()) continue;\n\t\tKth_shortest_path();\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 640,
"memory_kb": 2196,
"score_of_the_acc": -0.7021,
"final_rank": 8
},
{
"submission_id": "aoj_1090_365780",
"code_snippet": "#include<queue>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nstruct edge{ int v,cost; };\n\n// g£µ½Otɨ¯é¸_\nstruct Xnode{\n\tint u,t; // R[ÌÔ, pttn ̽¶ÚÜÅ}b`µ½©\n\tbool operator<(const Xnode &X)const{ return u<X.u || u==X.u && t<X.t; }\n};\n\n// g£µ½Otɨ¯éÓ\nstruct Xedge{\n\tXnode X;\n\tint cost;\n};\n\nint n,color[100],K,len;\nvector<edge> G[100]; // ³ÌOt\nchar pttn[11];\n\nbool input(){\n\tscanf(\"%d\",&n);\n\tif(n==0) return false;\n\trep(u,n){\n\t\tG[u].clear();\n\t\tscanf(\"%d\",color+u);\n\t}\n\tint m; scanf(\"%d\",&m);\n\trep(i,m){\n\t\tint u,v,cost; scanf(\"%d%d%d\",&u,&v,&cost); u--; v--;\n\t\tG[u].push_back((edge){v,cost});\n\t}\n\tscanf(\"%d%s\",&K,pttn);\n\tlen=strlen(pttn);\n\treturn true;\n}\n\nvector<Xedge> XG[100][10],XG_rev[101][10]; // g£µ½Ot, XG ÌtOt\nvoid build_XG(){\n\trep(u,n+1) rep(t,max(len,2)) {\n\t\tXG[u][t].clear();\n\t\tXG_rev[u][t].clear();\n\t}\n\n\trep(u,n) rep(t,len) rep(i,G[u].size()) {\n\t\tint v=G[u][i].v,cost=G[u][i].cost;\n\n\t\tchar tmp[12]={};\n\t\tstrncpy(tmp,pttn,t);\n\t\ttmp[t]=color[v]+'0';\n\t\tint t_next;\n\t\tfor(t_next=t+1;strncmp(pttn,tmp+(t+1)-t_next,t_next);t_next--);\n\n\t\tif(t_next<len){\n\t\t\tXG[u][t].push_back((Xedge){(Xnode){v,t_next},cost});\n\t\t\tXG_rev[v][t_next].push_back((Xedge){(Xnode){u,t},cost});\n\t\t}\n\t}\n\t// XG_rev Ìn_½¿ ( XG ÌI_½¿ ) ðêÂÉÜÆßé\n\trep(t,len) XG_rev[n][0].push_back((Xedge){(Xnode){n-1,t},0});\n}\n\nbool vis[101][10]; // XG ɨ¢Än_ (0, t0) ©çHè
¯é Xnode ÌW\nbool dfs(int u,int t){\n\tvis[u][t]=true;\n\trep(i,XG[u][t].size()){\n\t\tconst Xedge &e=XG[u][t][i];\n\t\tint v=e.X.u,t_next=e.X.t;\n\t\tif(!vis[v][t_next]) dfs(v,t_next);\n\t}\n}\n\nbool vis_rev[101][10]; // XG ɨ¢ÄI_½¿ (n-1, t) (0 < t < len) ©çHè
¯é Xnode ÌW\nbool dfs_rev(int v,int t){\n\tvis_rev[v][t]=true;\n\trep(i,XG_rev[v][t].size()){\n\t\tconst Xedge &e=XG_rev[v][t][i];\n\t\tint u=e.X.u,t_prev=e.X.t;\n\t\tif(!vis_rev[u][t_prev]) dfs_rev(u,t_prev);\n\t}\n}\n\n// Bellman-Ford Éæéë»èðh®½ßÉKvÌÈ¢ Xnode ð XG ©çí·é\nvoid delete_Xnodes(){\n\trep(u,n+1) rep(t,len) vis[u][t]=vis_rev[u][t]=false;\n\n\tint t0=(pttn[0]==color[0]+'0'?1:0);\n\tdfs(0,t0);\n\tdfs_rev(n,0);\n\n\trep(u,n) rep(t,len) {\n\t\tif(!vis[u][t] || !vis_rev[u][t]){\n\t\t\tXG[u][t].clear();\n\t\t}\n\t\telse{\n\t\t\trep(i,XG[u][t].size()){\n\t\t\t\tconst Xedge &e=XG[u][t][i];\n\t\t\t\tint v=e.X.u,t_next=e.X.t;\n\t\t\t\tif(!vis[v][t_next] || !vis_rev[v][t_next]){\n\t\t\t\t\tXG[u][t].erase(XG[u][t].begin()+i);\n\t\t\t\t\ti--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nint pot[101][10];\n// Bellman-Ford @ðp¢Ä|eVðvZ\nbool calc_potential(){\n\trep(u,n+1) rep(t,len) pot[u][t]=0;\n\n\trep(c,n*len){\n\t\trep(u,n+1) rep(t,len) rep(i,XG[u][t].size()) {\n\t\t\tconst Xedge &e=XG[u][t][i];\n\t\t\tint v=e.X.u,t_next=e.X.t,cost=e.cost;\n\t\t\tif(pot[u][t]+cost<pot[v][t_next]){\n\t\t\t\tpot[v][t_next]=pot[u][t]+cost;\n\t\t\t\tif(c==n*len-1){\n\t\t\t\t\tputs(\"-1\");\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid Kth_shortest_path(){\n\tint nd[100][10]={},d[100][10][10];\n\tint t0=(pttn[0]==color[0]+'0'?1:0);\n\n\tpriority_queue< pair<int,Xnode> > Q;\n\tQ.push(make_pair(0,(Xnode){0,t0}));\n\twhile(!Q.empty()){\n\t\tint d_now=-Q.top().first;\n\t\tint u=Q.top().second.u,t=Q.top().second.t; Q.pop();\n\n\t\tif(nd[u][t]==K) continue;\n\t\td[u][t][nd[u][t]++]=d_now;\n\n\t\trep(i,XG[u][t].size()){\n\t\t\tconst Xedge &e=XG[u][t][i];\n\t\t\tint v=e.X.u,t_next=e.X.t,cost=e.cost;\n\t\t\tif(nd[v][t_next]<K){\n\t\t\t\tint d_next=d_now+cost+pot[u][t]-pot[v][t_next];\n\t\t\t\tQ.push(make_pair(-d_next,(Xnode){v,t_next}));\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<int> ans;\n\trep(t,len) rep(i,nd[n-1][t]) ans.push_back(d[n-1][t][i]-pot[0][t0]+pot[n-1][t]);\n\tsort(ans.begin(),ans.end());\n\n\tint n_ans=min((int)ans.size(),K),ans_sum=0;\n\trep(i,n_ans) ans_sum+=ans[i];\n\tprintf(\"%d %d\\n\",n_ans,ans_sum);\n}\n\nint main(){\n\twhile(input()){\n\t\tbuild_XG();\n\t\tdelete_Xnodes();\n\t\tif(!calc_potential()) continue;\n\t\tKth_shortest_path();\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 640,
"memory_kb": 2192,
"score_of_the_acc": -0.7006,
"final_rank": 7
},
{
"submission_id": "aoj_1090_365778",
"code_snippet": "#include<queue>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nconst int INF=1<<29;\n\nstruct edge{ int v,cost; };\n\n// g£µ½Otɨ¯é¸_\nstruct Xnode{\n\tint u,t; // R[ÌÔ, pttn ̽¶ÚÜÅ}b`µ½©\n\tbool operator<(const Xnode &X)const{ return u<X.u || u==X.u && t<X.t; }\n};\n\n// g£µ½Otɨ¯éÓ\nstruct Xedge{\n\tXnode X;\n\tint cost;\n};\n\nint n,color[100],K,len;\nvector<edge> G[100]; // ³ÌOt\nchar pttn[11];\n\nbool input(){\n\tscanf(\"%d\",&n);\n\tif(n==0) return false;\n\trep(u,n){\n\t\tG[u].clear();\n\t\tscanf(\"%d\",color+u);\n\t}\n\tint m; scanf(\"%d\",&m);\n\trep(i,m){\n\t\tint u,v,cost; scanf(\"%d%d%d\",&u,&v,&cost); u--; v--;\n\t\tG[u].push_back((edge){v,cost});\n\t}\n\tscanf(\"%d%s\",&K,pttn);\n\tlen=strlen(pttn);\n\treturn true;\n}\n\nvector<Xedge> XG[101][10],XG_rev[101][10]; // g£µ½Ot, XG ÌtOt\nvoid build_XG(){\n\trep(u,n+1) rep(t,max(len,2)) {\n\t\tXG[u][t].clear();\n\t\tXG_rev[u][t].clear();\n\t}\n\n\trep(u,n) rep(t,len) rep(i,G[u].size()) {\n\t\tint v=G[u][i].v,cost=G[u][i].cost;\n\n\t\tchar tmp[12]={};\n\t\tstrncpy(tmp,pttn,t);\n\t\ttmp[t]=color[v]+'0';\n\t\tint t_next;\n\t\tfor(t_next=t+1;strncmp(pttn,tmp+(t+1)-t_next,t_next);t_next--);\n\n\t\tif(t_next<len){\n\t\t\tXG[u][t].push_back((Xedge){(Xnode){v,t_next},cost});\n\t\t\tXG_rev[v][t_next].push_back((Xedge){(Xnode){u,t},cost});\n\t\t}\n\t}\n\t// XG_rev Ìn_½¿ ( XG ÌI_½¿ ) ðêÂÉÜÆßé\n\trep(t,len) XG_rev[n][0].push_back((Xedge){(Xnode){n-1,t},0});\n\t// |eVvZpÌ super source\n\trep(u,n) rep(t,len) XG[n][0].push_back((Xedge){(Xnode){u,t},0});\n}\n\nbool vis[101][10]; // XG ɨ¢Än_ (0, t0) ©çHè
¯é Xnode ÌW\nbool dfs(int u,int t){\n\tvis[u][t]=true;\n\trep(i,XG[u][t].size()){\n\t\tconst Xedge &e=XG[u][t][i];\n\t\tint v=e.X.u,t_next=e.X.t;\n\t\tif(!vis[v][t_next]) dfs(v,t_next);\n\t}\n}\n\nbool vis_rev[101][10]; // XG ɨ¢ÄI_½¿ (n-1, t) (0 < t < len) ©çHè
¯é Xnode ÌW\nbool dfs_rev(int v,int t){\n\tvis_rev[v][t]=true;\n\trep(i,XG_rev[v][t].size()){\n\t\tconst Xedge &e=XG_rev[v][t][i];\n\t\tint u=e.X.u,t_prev=e.X.t;\n\t\tif(!vis_rev[u][t_prev]) dfs_rev(u,t_prev);\n\t}\n}\n\n// Bellman-Ford Éæéë»èðh®½ßÉKvÌÈ¢ Xnode ð XG ©çí·é\nvoid delete_Xnodes(){\n\trep(u,n+1) rep(t,len) vis[u][t]=vis_rev[u][t]=false;\n\n\tint t0=(pttn[0]==color[0]+'0'?1:0);\n\tdfs(0,t0);\n\tdfs_rev(n,0);\n\n\trep(u,n) rep(t,len) {\n\t\tif(!vis[u][t] || !vis_rev[u][t]){\n\t\t\tXG[u][t].clear();\n\t\t}\n\t\telse{\n\t\t\trep(i,XG[u][t].size()){\n\t\t\t\tconst Xedge &e=XG[u][t][i];\n\t\t\t\tint v=e.X.u,t_next=e.X.t;\n\t\t\t\tif(!vis[v][t_next] || !vis_rev[v][t_next]){\n\t\t\t\t\tXG[u][t].erase(XG[u][t].begin()+i);\n\t\t\t\t\ti--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nint pot[101][10];\n// Bellman-Ford @ðp¢Ä|eVðvZ\nbool calc_potential(){\n\trep(u,n+1) rep(t,len) pot[u][t]=INF;\n\tpot[n][0]=0;\n\n\trep(c,n*len){\n\t\trep(u,n+1) rep(t,len) {\n\t\t\tif(pot[u][t]==INF) continue;\n\t\t\trep(i,XG[u][t].size()){\n\t\t\t\tconst Xedge &e=XG[u][t][i];\n\t\t\t\tint v=e.X.u,t_next=e.X.t,cost=e.cost;\n\t\t\t\tif(pot[u][t]+cost<pot[v][t_next]){\n\t\t\t\t\tpot[v][t_next]=pot[u][t]+cost;\n\t\t\t\t\tif(c==n*len-1){\n\t\t\t\t\t\tputs(\"-1\");\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}\n\t}\n\treturn true;\n}\n\nvoid Kth_shortest_path(){\n\tint nd[100][10]={},d[100][10][10];\n\tint t0=(pttn[0]==color[0]+'0'?1:0);\n\n\tpriority_queue< pair<int,Xnode> > Q;\n\tQ.push(make_pair(0,(Xnode){0,t0}));\n\twhile(!Q.empty()){\n\t\tint d_now=-Q.top().first;\n\t\tint u=Q.top().second.u,t=Q.top().second.t; Q.pop();\n\n\t\tif(nd[u][t]==K) continue;\n\t\td[u][t][nd[u][t]++]=d_now;\n\n\t\trep(i,XG[u][t].size()){\n\t\t\tconst Xedge &e=XG[u][t][i];\n\t\t\tint v=e.X.u,t_next=e.X.t,cost=e.cost;\n\t\t\tif(nd[v][t_next]<K){\n\t\t\t\tint d_next=d_now+cost+pot[u][t]-pot[v][t_next];\n\t\t\t\tQ.push(make_pair(-d_next,(Xnode){v,t_next}));\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<int> ans;\n\trep(t,len) rep(i,nd[n-1][t]) ans.push_back(d[n-1][t][i]-pot[0][t0]+pot[n-1][t]);\n\tsort(ans.begin(),ans.end());\n\n\tint n_ans=min((int)ans.size(),K),ans_sum=0;\n\trep(i,n_ans) ans_sum+=ans[i];\n\tprintf(\"%d %d\\n\",n_ans,ans_sum);\n}\n\nint main(){\n\twhile(input()){\n\t\tbuild_XG();\n\t\tdelete_Xnodes();\n\t\tif(!calc_potential()) continue;\n\t\tKth_shortest_path();\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 690,
"memory_kb": 2192,
"score_of_the_acc": -0.7342,
"final_rank": 9
},
{
"submission_id": "aoj_1090_364764",
"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 fr(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<<#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;\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;\ntypedef vector<Weight> Array;\ntypedef vector<Array> Matrix;\n\nvi k_shortestPath(const Graph &g, int s, int t, int k,int *h) {\n int n=g.size();\n vi dist[n];\n priority_queue<Edge> Q; Q.push(Edge(-1, s, 0));\n while (!Q.empty()) {\n Edge e = Q.top(); Q.pop();\n if (dist[e.dst].size() >= k) continue;\n dist[e.dst].push_back(e.weight);\n fr(f, g[e.dst]) Q.push(Edge(f->src, f->dst, f->weight+e.weight+h[f->src]-h[f->dst]));\n }\n rep(i,dist[t].size())dist[t][i]+=h[t]-h[s];\n return dist[t];\n}\nint *buildFail(char *p) {\n int m = strlen(p);\n int *fail = new int[m+1];\n int j = fail[0] = -1;\n for (int i = 1; i <= m; ++i) {\n while (j >= 0 && p[j] != p[i-1]) j = fail[j];\n fail[i] = ++j;\n }\n return fail;\n}\n\nint n,col[100],m,a[1000],b[1000],c[1000],k;\nchar ptn[20];\nint V,s,t,h[1111];\nGraph G,rG;\n\nbool v[1111],rv[1111];\nvoid dfs(int c,const Graph &g,bool *v){\n\tv[c]=1;\n\tfr(i,g[c])if(!v[i->dst])dfs(i->dst,g,v);\n}\nbool calc_potential(){\n\tfill(h,h+V+1,0);\n\trep(k,V)rep(i,V)if(v[i]&&rv[i])fr(e,G[i]){\n\t\tif(h[e->dst]>h[e->src]+e->weight){\n\t\t\th[e->dst]=h[e->src]+e->weight;\n\t\t\tif(k==V-1)return 0;\n\t\t}\n\t}\n\treturn 1;\n}\ninline void push(Graph &g,int src,int dst,int weight){\n\tg[src].pb(Edge(src,dst,weight));\n}\nbool make_graph(){\n\tint *fail=buildFail(ptn), len=strlen(ptn);\n\tG.clear(); rG.clear();\n\tV=n*(len+1)+1;\n\ts=0; t=V-1;\n\twhile(s>=0&&ptn[s]-'0'!=col[0])s=fail[s];\n\tif(++s>=len)return 0;\n\tG.resize(V); rG.resize(V);\n\t\n\tvector<vector<pi> > e(n);\n\trep(i,m)e[a[i]-1].pb(mp(b[i]-1,c[i]));\n\t\n\trep(i,n)rep(j,len+1){\n\t\tfr(k,e[i]){\n\t\t\tint to=j;\n\t\t\twhile(to>=0&&ptn[to]-'0'!=col[k->first])to=fail[to];\n\t\t\tif(++to>=len)continue;\n\t\t\tpush(G,i*(len+1)+j,k->first*(len+1)+to,k->second);\n\t\t\tpush(rG,k->first*(len+1)+to,i*(len+1)+j,0);\n\t\t}\n\t}\n\trep(j,len){\n\t\tpush(G,(n-1)*(len+1)+j,t,0);\n\t\tpush(rG,t,(n-1)*(len+1)+j,0);\n\t}\n\trep(i,V)v[i]=rv[i]=0;\n\tdfs(s,G,v); dfs(t,rG,rv);\n\treturn v[t]&&rv[s];\n}\n\nint main(){\n\twhile(cin>>n,n){\n\t\trep(i,n)cin>>col[i];\n\t\tcin>>m;\n\t\trep(i,m)cin>>a[i]>>b[i]>>c[i];\n\t\tcin>>k>>ptn;\n\t\t\n\t\tif(!make_graph()){\n\t\t\tcout<<\"0 0\"<<endl; continue;\n\t\t}\n\t\tif(!calc_potential()){\n\t\t\tcout<<-1<<endl; continue;\n\t\t}\n\t\tvi ans=k_shortestPath(G,s,t,k,h);\n\t\tint sum=0;\n\t\trep(i,ans.size())sum+=ans[i];\n\t\tcout<<ans.size()<<\" \"<<sum<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 620,
"memory_kb": 1976,
"score_of_the_acc": -0.6061,
"final_rank": 5
},
{
"submission_id": "aoj_1090_364757",
"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 fr(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<<#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;\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;\ntypedef vector<Weight> Array;\ntypedef vector<Array> Matrix;\n// simpler method\nvi k_shortestPath(const Graph &g, int s, int t, int k,int *h) {\n int n=g.size();\n vi dist[n];\n priority_queue<Edge> Q; Q.push(Edge(-1, s, 0));\n while (!Q.empty()) {\n Edge e = Q.top(); Q.pop();\n if (dist[e.dst].size() >= k) continue;\n dist[e.dst].push_back(e.weight);\n fr(f, g[e.dst]) Q.push(Edge(f->src, f->dst, f->weight+e.weight+h[f->src]-h[f->dst]));\n }\n rep(i,dist[t].size())dist[t][i]+=h[t]-h[s];\n return dist[t];\n}\nint *buildFail(char *p) {\n int m = strlen(p);\n int *fail = new int[m+1];\n int j = fail[0] = -1;\n for (int i = 1; i <= m; ++i) {\n while (j >= 0 && p[j] != p[i-1]) j = fail[j];\n fail[i] = ++j;\n }\n return fail;\n}\nint match(char *t, char *p, int *fail) {\n int n = strlen(t), m = strlen(p);\n int count = 0;\n for (int i = 0, k = 0; i < n; ++i) {\n while (k >= 0 && p[k] != t[i]) k = fail[k];\n if (++k >= m) {\n ++count; // match at t[i-m+1 .. i]\n k = fail[k];\n }\n }\n return count;\n}\n\n\nbool make_graph();\nbool calc_potential();\n\nint n,col[100],m,a[1000],b[1000],c[1000],k;\nchar ptn[20];\nint V,s,t,h[1111];\nGraph G,rG;\nbool v[1111],rv[1111];\n\nint main(){\n\twhile(cin>>n,n){\n\t\trep(i,n)cin>>col[i];\n\t\tcin>>m;\n\t\trep(i,m)cin>>a[i]>>b[i]>>c[i];\n\t\tcin>>k>>ptn;\n\t\t\n\t\tif(!make_graph()){\n\t\t\tcout<<\"0 0\"<<endl; continue;\n\t\t}\n\t\tif(!calc_potential()){\n\t\t\tcout<<-1<<endl; continue;\n\t\t}\n\t\tvi ans=k_shortestPath(G,s,t,k,h);\n\t\tint sum=0;\n\t\trep(i,ans.size())sum+=ans[i];\n\t\tcout<<ans.size()<<\" \"<<sum<<endl;\n\t}\n\treturn 0;\n}\n\nvoid dfs(int c,const Graph &g,bool *v){\n\tv[c]=1;\n\tfr(i,g[c])if(!v[i->dst])dfs(i->dst,g,v);\n}\nbool calc_potential(){\n\tfill(h,h+V+1,0);\n\trep(k,V)rep(i,V)if(v[i]&&rv[i])fr(e,G[i]){\n\t\tif(h[e->dst]>h[e->src]+e->weight){\n\t\t\th[e->dst]=h[e->src]+e->weight;\n\t\t\tif(k==V-1) return 0; // negative cycle\n\t\t}\n\t}\n\treturn 1;\n}\ninline void push(Graph &g,int src,int dst,int weight){\n\tg[src].pb(Edge(src,dst,weight));\n}\nbool make_graph(){\n\tint *fail=buildFail(ptn), len=strlen(ptn);\n\tG.clear(); rG.clear();\n\tV=n*(len+1)+1;\n\ts=0; t=V-1;\n\twhile(s>=0&&ptn[s]-'0'!=col[0])s=fail[s];\n\tif(++s>=len)return 0;\n\tG.resize(V); rG.resize(V);\n\t\n\tvector<vector<pi> > e(n);\n\trep(i,m)e[a[i]-1].pb(mp(b[i]-1,c[i]));\n\t\n\trep(i,n)rep(j,len+1){\n\t\tfr(k,e[i]){\n\t\t\tint to=j;\n\t\t\twhile(to>=0&&ptn[to]-'0'!=col[k->first])to=fail[to];\n\t\t\tif(++to>=len)continue;\n\t\t\tpush(G,i*(len+1)+j,k->first*(len+1)+to,k->second);\n\t\t\tpush(rG,k->first*(len+1)+to,i*(len+1)+j,0);\n\t\t}\n\t}\n\trep(j,len){\n\t\tpush(G,(n-1)*(len+1)+j,t,0);\n\t\tpush(rG,t,(n-1)*(len+1)+j,0);\n\t}\n\t/*\n\tdbg(len); dbg(t);\n\trep(i,n)rep(j,len+1){\n\t\tcerr<<\"i: \"<<i<<\" j: \"<<j<<endl;\n\t\tfr(k,G[i*(len+1)+j])cerr<<k->src<<\" \"<<k->dst<<\" \"<<k->weight<<endl;\n\t}\n\t*/\n\trep(i,V)v[i]=rv[i]=0;\n\tdfs(s,G,v); dfs(t,rG,rv);\n\treturn v[t]&&rv[s];\n}",
"accuracy": 1,
"time_ms": 620,
"memory_kb": 1976,
"score_of_the_acc": -0.6061,
"final_rank": 5
}
] |
aoj_1092_cpp
|
Make KND So Fat
Problem
KND君は会津大学に在籍する学生プログラマである。彼の隣人はとても迷惑なことで知られている。隣人は彼が甘党であることを知り、必要以上に甘味を差し入れて彼を太らせようと画策している。そのために、当の隣人であるあなたは友人からとある甘味処を紹介してもらった。
しかし、その甘味処での商品の販売の仕方は少し変わっている。その販売方法とは、甘味セットと呼ばれる甘味の組を日替わりで販売するというものだ。予算内であればその日に販売されている甘味セットの中から自由に甘味を買うことができる。しかし、甘味セットに含まれる甘味は一種類につき１個しか販売されていない。
また、予算は期間の始めに用意した額から支払い、期間途中での追加予算はないものとする。あなたは友人から教えられた甘味の体重に与える影響の度合いと値段をもとに、ある期間中に一定の予算内で彼の体重を最適に増やす甘味の買い方を計算するプログラムを作成することにした。
Input
入力は複数のテストケースからなる。空行区切りで与えられる。ひとつのテストケースは以下の形式で与えられる。入力の終了をEOFで示す。
s
d
m
k
1
w
1,1
p
1,1
w
1,2
p
1,2
...
w
1,k
p
1,k
k
2
w
2,1
p
2,1
w
2,2
p
2,2
...
w
2,k
p
2,k
...
k
s
w
s,1
p
s,1
w
s,2
p
s,2
...
w
s,k
p
s,k
f
1
f
2
...
f
d
ここで、
s
:甘味セットの種類
d
:対象となる期間
m
:予算
k
i
:i番目の甘味セットに含まれる甘味の種類数
w
i,j
:i番目の甘味セットに含まれるj番目の甘味の体重に与える影響
p
i,j
:i番目の甘味セットに含まれるj番目の甘味の値段
f
i
:i日目に販売されている甘味セットの番号(0から始まる)
である。
Constraints
入力は以下の条件を満たす。
入力はすべて整数。
1 ≤
s
≤
d
≤ 100
1 ≤
m
≤ 300
1 ≤
k
i
≤ 50
0 ≤
w
i,j
≤ 50
0 ≤
p
i,j
≤ 300
0 ≤
f
i
<
s
Output
各テストケースにつき予算内で体重に与えられる最大の影響とその影響を与えるために必要な最小の金額を空白区切りで1行に出力せよ。
Sample Input
3 3 100
2
5 20 3 10
2
10 50 12 60
2
8 30 22 100
0 1 2
1 1 30
1
13 8
0
Sample Output
23 100
13 8
|
[
{
"submission_id": "aoj_1092_8090096",
"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 s,d,m;\n while (cin >> s >> d >> m) {\n vector<vector<pair<int,int>>> v(s);\n for (int i = 0; i < s; ++i) {\n int z; cin >> z; v[i].resize(z);\n for (int j = 0; j < z; ++j) {\n cin >> v[i][j].first >> v[i][j].second;\n }\n }\n vector<pair<int,int>> x;\n for (int i = 0; i < d; ++i) {\n int f; cin >> f;\n for (auto j : v[f]) {\n x.push_back(j);\n }\n }\n int n = x.size();\n vector<int> dp(m+1, -1e9);\n dp[0] = 0;\n for (int i = 0; i < n; ++i) {\n vector<int> ndp = dp;\n for (int j = x[i].second; j <= m; ++j) {\n ndp[j] = max(ndp[j], dp[j-x[i].second] + x[i].first);\n }\n swap(dp, ndp);\n }\n int mx = -1, res = 0;\n for (int i = 0; i <= m; ++i) {\n if (mx < dp[i]) {\n mx = dp[i]; res = i;\n }\n }\n cout << mx << \" \" << res << endl;\n }\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3536,
"score_of_the_acc": -0.0254,
"final_rank": 2
},
{
"submission_id": "aoj_1092_6020348",
"code_snippet": "#include<iostream>\n#include<cstring>\n#include<cstdio>\n#include<sstream>\n#include<algorithm>\n#include<cstdlib>\n#include<queue>\n#include<set>\n#include<map>\n#include<cmath>\n#include<ctime>\n#include<stack>\n#include<functional>\n#define INF ((1 << 31) - 1)\n#define MOD 998244353\n#define EPS 0.000001\n//freopen(\"input.txt\", \"r\", stdin);\n//freopen(\"output.txt\", \"w\", stdout);\nusing namespace std;\ntypedef long long ll;\nint dp[105][305], k[105];\nint w[105][105], p[105][105];\nint main(void)\n{\n\tint s, d, m;\n\twhile (cin >> s >> d >> m)\n\t{\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tfor (int i = 1; i <= s; i++)\n\t\t{\n\t\t\tcin >> k[i];\n\t\t\tfor (int j = 1; j <= k[i]; j++)\n\t\t\t{\n\t\t\t\tcin >> w[i][j] >> p[i][j];\n\t\t\t}\n\t\t}\n\t\tfor (int i = 1; i <= d; i++)\n\t\t{\n\t\t\tint f;\n\t\t\tcin >> f;\n\t\t\tf++;\n\t\t\tfor (int j = 1; j <= k[f]; j++)\n\t\t\t{\n\t\t\t\tfor (int q = m; q >= p[f][j]; q--)\n\t\t\t\t{\n\t\t\t\t\tdp[i][q] = max(max(dp[i - 1][q], dp[i - 1][q - p[f][j]] + w[f][j]), max(dp[i][q], dp[i][q - p[f][j]] + w[f][j]));\n\t\t\t\t}\n\t\t\t\tfor (int q = 0; q < p[f][j]; q++)\n\t\t\t\t{\n\t\t\t\t\tdp[i][q] = max(dp[i][q], dp[i - 1][q]);\n\t\t\t\t}\n\t\t\t}\n\t\t\t/*for (int q = 0; q <= m; q++)\n\t\t\t\tcout << dp[i][q] << \" \";\n\t\t\tcout << endl;*/\n\t\t}\n\t\tint ans = m;\n\t\tfor (int i = m; i >= 0; i--)\n\t\t\tif (dp[d][i] == dp[d][m])\n\t\t\t\tans = i;\n\t\tcout << dp[d][m] << \" \" << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 220,
"memory_kb": 3216,
"score_of_the_acc": -0.154,
"final_rank": 11
},
{
"submission_id": "aoj_1092_6019558",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <stdio.h>\n#include <math.h>\n#include <string.h>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\nint k[105];\nint w[105][55];\nint p[105][55];\nint f[105];\nint s,d,m;\nint dp[305];\nint main()\n{\n\n while(cin>>s>>d>>m){\n for(int i=0;i<s;i++){\n cin>>k[i];\n for(int j=0;j<k[i];j++){\n cin>>w[i][j]>>p[i][j];\n }\n }\n for(int i=0;i<d;i++){\n cin>>f[i];\n }\n dp[0]=0;\n for(int i=1;i<305;i++){\n dp[i]=-1000000;\n }\n for(int i=0;i<d;i++){\n int n=f[i];\n for(int j=0;j<k[n];j++){\n for(int l=m;l>=p[n][j];l--){\n dp[l]=max(dp[l],dp[l-p[n][j]]+w[n][j]);\n }\n }\n }\n int mx=0,ind=0;\n for(int i=1;i<=m;i++){\n if(dp[i]>mx){\n mx=dp[i];\n ind=i;\n }\n }\n cout<<dp[ind]<<\" \"<<ind<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3144,
"score_of_the_acc": -0.0755,
"final_rank": 7
},
{
"submission_id": "aoj_1092_4916048",
"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).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> 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-11, PI = acos(-1);\n//ここから編集\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n \n int s, d, m;\n while(cin >> s >> d >> m){\n \n vector<int> k(s);\n vector<vector<pair<int, int>>> w(s);\n REP(i,s){\n cin >> k[i];\n for(int j=0; j<k[i]; j++){\n int ww, p; cin >> ww >> p;\n w[i].push_back({ww, p});\n }\n }\n\n vector<int> f(d);\n REP(i,d) cin >> f[i];\n\n int dp[301] = {0};\n for(int i=0; i<d; i++){\n\n for(int j=0; j<w[f[i]].size(); j++){\n\n for(int x=m; x>=0; x--){\n if(x+w[f[i]][j].second <= m){\n dp[x+w[f[i]][j].second] = max(dp[x+w[f[i]][j].second], dp[x] + w[f[i]][j].first);\n }\n }\n }\n }\n int ans = 0;\n int kakaku = 0;\n for(int i=0; i<=m; i++) {\n if(ans < dp[i]){\n ans = dp[i];\n kakaku = i;\n }\n }\n cout << ans << \" \" << kakaku << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3196,
"score_of_the_acc": -0.0324,
"final_rank": 3
},
{
"submission_id": "aoj_1092_3917271",
"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>\nstruct Sweet {\n\tint weight, price;\n};\nint main() {\n\tint s, d, m;\n\twhile (std::cin >> s >> d >> m) {\n\t\tstd::vector<int> max_weight(m + 1, 0);\n\t\tstd::vector<std::vector<Sweet>> sweets(s);\n\t\tfor (auto &sweet : sweets) {\n\t\t\tint k; std::cin >> k;\n\t\t\tfor (auto i = 0; i < k; ++i) {\n\t\t\t\tSweet sw; std::cin >> sw.weight >> sw.price;\n\t\t\t\tsweet.push_back(sw);\n\t\t\t}\n\t\t}\n\t\tfor (auto _i = 0; _i < d; ++_i) {\n\t\t\tint f; std::cin >> f;\n\t\t\tfor (auto sweet : sweets[f]) {\n\t\t\t\tfor (int i = m - sweet.price; i >= 0; --i) {\n\t\t\t\t\tmax_weight[i + sweet.price] = std::max(max_weight[i + sweet.price], max_weight[i] + sweet.weight);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tstd::cout << max_weight.back() << ' ' << std::distance(max_weight.begin(), std::lower_bound(max_weight.begin(), max_weight.end(), max_weight.back())) << '\\n';\n\t}\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 3132,
"score_of_the_acc": -0.0655,
"final_rank": 5
},
{
"submission_id": "aoj_1092_3727799",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <numeric>\n\n#define REP(i, a, b) for (int i = int(a); i < int(b); i++)\nusing namespace std;\ntypedef long long int ll;\n\n// clang-format off\n#ifdef _DEBUG_\n#define dump(...) do{ cerr << __LINE__ << \":\\t\" << #__VA_ARGS__ << \" = \"; PPPPP(__VA_ARGS__); cerr << endl; } while(false)\ntemplate<typename T> void PPPPP(T t) { cerr << t; }\ntemplate<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << \", \"; PPPPP(s...); }\n#else\n#define dump(...)\n#endif\ntemplate<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }\ntemplate<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }\n // clang-format on\n\n#include <utility>\nusing K = pair<int, int>;\n\ntemplate<typename T>\nvoid chmax(T &a, T b) {\n a = max(a, b);\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int s, d, m;\n while (cin >> s >> d >> m) {\n vector<vector<K>> Kanmi(s);\n REP(i, 0, s) {\n int k;\n cin >> k;\n REP(j, 0, k) {\n int a, b;\n cin >> a >> b;\n Kanmi[i].emplace_back(a, b);\n }\n }\n vector<K> Lst;\n {\n REP(i, 0, d) {\n int f;\n cin >> f;\n for (auto L : Kanmi[f]) {\n Lst.push_back(L);\n }\n }\n }\n auto dp = make_v(Lst.size() + 1, m + 1, 0LL);\n REP(i, 0, Lst.size()) {\n REP(j, 0, m + 1) {\n chmax(dp[i + 1][j], dp[i][j]);\n if (j + Lst[i].second <= m) {\n chmax(dp[i + 1][j + Lst[i].second], dp[i][j] + Lst[i].first);\n }\n }\n }\n ll ans = -1;\n int prm = -1;\n REP(i, 0, m + 1) {\n if (ans < dp[Lst.size()][i]) {\n ans = dp[Lst.size()][i];\n prm = i;\n }\n }\n cout << ans << \" \" << prm << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 8704,
"score_of_the_acc": -0.5082,
"final_rank": 16
},
{
"submission_id": "aoj_1092_3325454",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<map>\nusing namespace std;\n\nint main(){\n int s, d, m, k, w, p, f;\n\n while(cin >> s >> d >> m){\n int dp[301] = {};\n\n vector<pair<int,int>> v[s];\n for(int i = 0; i < s; i++){\n cin >> k;\n while(k-- > 0){\n cin >> w >> p;\n v[i].push_back({w,p});\n }\n }\n\n map<pair<int,int>,int> ma;\n\n for(int i = 0; i < d; i++){\n cin >> f;\n for(pair<int,int> price : v[f]) ma[price]++;\n }\n\n for(auto x : ma){\n pair<int,int> price = x.first;\n for(int i = 0; i < ma[price]; i++){\n // 2進を使って効率よくやった方が良いかもしれないが、面倒なのでさぼる\n for(int j = m; j >= price.second; j--){\n dp[j] = max(dp[j], dp[j-price.second]+price.first);\n }\n }\n }\n\n int a = 0, b = 0;\n for(int i = 0; i <= m; i++){\n if(dp[i] > a){\n a = dp[i], b = i;\n }\n }\n cout << a << \" \" << b << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 3184,
"score_of_the_acc": -0.1335,
"final_rank": 10
},
{
"submission_id": "aoj_1092_3131268",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef struct{\n int k;\n int w[51];\n int p[51];\n} Data;\n\nint s,b,m;\n\ntypedef struct{\n int kingaku;\n int max_num;\n} Ans;\n\nAns memo[110][60][310];\n\nAns dfs(Data d[], int f[], int i, int j, int nokori){\n Ans ans;\n if(i == b){\n ans.kingaku = 0;\n ans.max_num = 0;\n return ans;\n }\n\n if(memo[i][j][nokori].max_num != -1)\n return memo[i][j][nokori];\n\n int nexti = i;\n int nextj = j+1;\n\n if(j == d[f[i]].k){\n nextj = 0; nexti++;\n }\n\n ans = dfs(d,f,nexti,nextj,nokori);\n Ans tmp;\n\n if(nokori >= d[f[i]].p[j]){\n tmp = dfs(d,f,nexti,nextj,nokori-d[f[i]].p[j]);\n tmp.max_num += d[f[i]].w[j];\n tmp.kingaku += d[f[i]].p[j];\n if(tmp.max_num > ans.max_num){\n ans = tmp;\n }else if(tmp.max_num == ans.max_num && tmp.kingaku < ans.kingaku){\n ans = tmp;\n }\n }\n\n return memo[i][j][nokori] = ans;\n}\n\n\nint main(){\n\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n\n Ans a;\n\n while(cin >> s >> b >> m){\n Data d[110] = {};\n int f[110] = {};\n for(int i = 0;i < s;i++){\n cin >> d[i].k;\n for(int j = 0;j < d[i].k;j++){\n cin >> d[i].w[j] >> d[i].p[j];\n }\n }\n\n for(int i = 0;i < b;i++){\n cin >> f[i];\n }\n\n memset(memo,-1,sizeof(Ans)*110*60*310);\n\n a = dfs(d,f,0,0,m);\n cout << a.max_num << \" \" << a.kingaku << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 1140,
"memory_kb": 19472,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_1092_2632763",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <math.h>\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\nstruct Info{\n\tint value,cost;\n};\n\nInfo info[100][50];\nint item_num[100],sell_count[100];\nint dp[301],next_dp[301];\n\nint main(){\n\n\tint S,D,M;\n\n\twhile(scanf(\"%d %d %d\",&S,&D,&M) != EOF){\n\n\t\tfor(int i = 0; i < S; i++)sell_count[i] = 0;\n\n\t\tfor(int i = 0; i < S; i++){\n\t\t\tscanf(\"%d\",&item_num[i]);\n\n\t\t\tfor(int k = 0; k < item_num[i]; k++){\n\t\t\t\tscanf(\"%d %d\",&info[i][k].value,&info[i][k].cost);\n\t\t\t}\n\t\t}\n\n\t\tint tmp;\n\t\tfor(int i = 0; i < D; i++){\n\t\t\tscanf(\"%d\",&tmp);\n\t\t\tsell_count[tmp]++;\n\t\t}\n\n\t\tdp[0] = 0;\n\t\tnext_dp[0] = 0;\n\t\tfor(int i = 1; i <= M; i++){\n\t\t\tdp[i] = -1;\n\t\t\tnext_dp[i] = -1;\n\t\t}\n\n\t\tvector<int> Updated;\n\n\t\tfor(int i = 0; i < S; i++){\n\t\t\tif(sell_count[i] == 0)continue;\n\n\t\t\tfor(int k = 0; k < item_num[i]; k++){\n\t\t\t\tfor(int num = 1; num <= sell_count[i]; num++){\n\t\t\t\t\tfor(int budget = M; budget-num*info[i][k].cost >= 0; budget--){\n\t\t\t\t\t\tif(dp[budget-num*info[i][k].cost] >= 0){\n\t\t\t\t\t\t\tif(next_dp[budget] < dp[budget-num*info[i][k].cost]+num*info[i][k].value){\n\t\t\t\t\t\t\t\tnext_dp[budget] = dp[budget-num*info[i][k].cost]+num*info[i][k].value;\n\t\t\t\t\t\t\t\tUpdated.push_back(budget);\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\tfor(int p = 0; p < Updated.size(); p++){\n\t\t\t\t\tdp[Updated[p]] = next_dp[Updated[p]];\n\t\t\t\t}\n\t\t\t\tUpdated.clear();\n\t\t\t}\n\t\t}\n\n\t\tint max_effect = -1,min_budget;\n\t\tfor(int budget = 0; budget <= M; budget++){\n\t\t\tif(max_effect < dp[budget]){\n\t\t\t\tmax_effect = dp[budget];\n\t\t\t\tmin_budget = budget;\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d %d\\n\",max_effect,min_budget);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 3252,
"score_of_the_acc": -0.0729,
"final_rank": 6
},
{
"submission_id": "aoj_1092_2632751",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <math.h>\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\nstruct Info{\n\tint value,cost;\n};\n\nInfo info[100][50];\nint item_num[100],sell_count[100];\nint dp[301],next_dp[301];\n\nint main(){\n\n\tint S,D,M;\n\n\twhile(scanf(\"%d %d %d\",&S,&D,&M) != EOF){\n\n\t\tfor(int i = 0; i < S; i++)sell_count[i] = 0;\n\n\t\tfor(int i = 0; i < S; i++){\n\t\t\tscanf(\"%d\",&item_num[i]);\n\n\t\t\tfor(int k = 0; k < item_num[i]; k++){\n\t\t\t\tscanf(\"%d %d\",&info[i][k].value,&info[i][k].cost);\n\t\t\t}\n\t\t}\n\n\t\tint tmp;\n\t\tfor(int i = 0; i < D; i++){\n\t\t\tscanf(\"%d\",&tmp);\n\t\t\tsell_count[tmp]++;\n\t\t}\n\n\t\tdp[0] = 0;\n\t\tnext_dp[0] = 0;\n\t\tfor(int i = 1; i <= M; i++){\n\t\t\tdp[i] = -1;\n\t\t\tnext_dp[i] = -1;\n\t\t}\n\n\t\tfor(int i = 0; i < S; i++){\n\t\t\tif(sell_count[i] == 0)continue;\n\n\t\t\tfor(int k = 0; k < item_num[i]; k++){\n\t\t\t\tfor(int num = 1; num <= sell_count[i]; num++){\n\t\t\t\t\tfor(int budget = M; budget-num*info[i][k].cost >= 0; budget--){\n\t\t\t\t\t\tif(dp[budget-num*info[i][k].cost] >= 0){\n\t\t\t\t\t\t\tnext_dp[budget] = max(next_dp[budget],dp[budget-num*info[i][k].cost]+num*info[i][k].value);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor(int budget = 0; budget <= M; budget++)dp[budget] = next_dp[budget];\n\t\t\t}\n\t\t}\n\n\t\tint max_effect = -1,min_budget;\n\t\tfor(int budget = 0; budget <= M; budget++){\n\t\t\tif(max_effect < dp[budget]){\n\t\t\t\tmax_effect = dp[budget];\n\t\t\t\tmin_budget = budget;\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d %d\\n\",max_effect,min_budget);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 3216,
"score_of_the_acc": -0.0429,
"final_rank": 4
},
{
"submission_id": "aoj_1092_2632748",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <math.h>\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\nstruct Info{\n\tint value,cost;\n};\n\nInfo info[100][50];\nint item_num[100];\nint dp[301];\n\nint main(){\n\n\tint S,D,M;\n\n\twhile(scanf(\"%d %d %d\",&S,&D,&M) != EOF){\n\n\t\tfor(int i = 0; i < S; i++){\n\t\t\tscanf(\"%d\",&item_num[i]);\n\n\t\t\tfor(int k = 0; k < item_num[i]; k++){\n\t\t\t\tscanf(\"%d %d\",&info[i][k].value,&info[i][k].cost);\n\t\t\t}\n\t\t}\n\n\t\tdp[0] = 0;\n\t\tfor(int i = 1; i <= M; i++)dp[i] = -1;\n\n\n\t\tint tmp;\n\t\tfor(int loop = 0; loop < D; loop++){\n\t\t\tscanf(\"%d\",&tmp);\n\n\t\t\tfor(int k = 0; k < item_num[tmp]; k++){\n\t\t\t\tfor(int budget = M; budget-info[tmp][k].cost >= 0; budget--){\n\t\t\t\t\tif(dp[budget-info[tmp][k].cost] >= 0){\n\t\t\t\t\t\tdp[budget] = max(dp[budget],dp[budget-info[tmp][k].cost]+info[tmp][k].value);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint max_effect = -1,min_budget;\n\t\tfor(int budget = 0; budget <= M; budget++){\n\t\t\tif(max_effect < dp[budget]){\n\t\t\t\tmax_effect = dp[budget];\n\t\t\t\tmin_budget = budget;\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d %d\\n\",max_effect,min_budget);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3156,
"score_of_the_acc": -0.0207,
"final_rank": 1
},
{
"submission_id": "aoj_1092_2287072",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define mk make_pair\n\nmain(){\n int s,d,m;\n while(cin>>s>>d>>m){\n\n int dp[5001][301]={},pp=0,ppp=100000000,k,w,p,cc;\n\n vector<pair<int,int> >a[101],c;\n\n for(int i=0;i<s;i++){\n cin>>k;\n\n for(int j=0;j<k;j++){\n cin>>w>>p;\n a[i].push_back(mk(p,w));\n\n }\n }\n for(int i=0;i<d;i++){\n cin>>cc;\n\n for(int j=0;j<a[cc].size();j++)\n c.push_back(a[cc][j]);\n }\n for(int i=1;i<=c.size();i++)\n for(int j=0;j<=m;j++){\n\n if(j<c[i-1].first)\n dp[i][j]=dp[i-1][j];\n else\n dp[i][j]=max(dp[i-1][j-c[i-1].first]+c[i-1].second,dp[i-1][j]);\n\n pp=max(pp,dp[i][j]);\n }\n\n for(int i=0;i<=c.size();i++)\n for(int j=0;j<=m;j++)\n if(pp==dp[i][j])ppp=min(ppp,j);\n\n cout<<pp<<' '<<ppp<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 9044,
"score_of_the_acc": -0.5289,
"final_rank": 17
},
{
"submission_id": "aoj_1092_2287036",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define mk make_pair\nint main(){\n int s,d,m;\n while(cin>>s>>d>>m){\n int dp[5001][301]={},pp=0,ppp=100000000,k,w,p,cc;\n vector<pair<int,int> >a[101],c;\n for(int i=0;i<s;i++){\n cin>>k;\n for(int j=0;j<k;j++){\n cin>>w>>p;\n a[i].push_back(mk(p,w));\n }\n }\n for(int i=0;i<d;i++){\n cin>>cc;\n for(int j=0;j<a[cc].size();j++)\n c.push_back(a[cc][j]);\n }\n for(int i=1;i<=c.size();i++)\n for(int j=0;j<=m;j++){\n if(j<c[i-1].first)\n dp[i][j]=dp[i-1][j];\n else\n dp[i][j]=max(dp[i-1][j-c[i-1].first]+c[i-1].second,dp[i-1][j]);\n pp=max(pp,dp[i][j]);\n }\n /*for(int i=0;i<=c.size();i++){\n for(int j=0;j<=m;j++)cout<<dp[i][j]<<' ';\n cout<<endl;\n }*/\n for(int i=0;i<=c.size();i++)\n for(int j=0;j<=m;j++)\n if(pp==dp[i][j])ppp=min(ppp,j);\n cout<<pp<<' '<<ppp<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 9068,
"score_of_the_acc": -0.5304,
"final_rank": 18
},
{
"submission_id": "aoj_1092_2285609",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\n\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n\nint s, d, m;\nint k[303];\nint w[303][303], p[303][303];\nint f[303];\n\nint dp[303][303];\nint dp2[303][303];\n\nsigned main(){\n while(cin >> s >> d >> m) {\n rep(i, s) {\n cin >> k[i];\n rep(j, k[i]) cin >> w[i][j] >> p[i][j];\n //rep(j, k[i]) cout<<w[i][j]<<\"-\"<<p[i][j]<<endl;\n }\n rep(i, d) cin >> f[i];\n memset(dp, -1, sizeof(dp));\n rep(i, s) {\n dp[i][0] = 0;\n rep(j, k[i]) {\n\tfor(int l = m; l >= p[i][j]; l--) {\n\t if(dp[i][l-p[i][j]] == -1) continue;\n\t dp[i][l] = max(dp[i][l], dp[i][l-p[i][j]] + w[i][j]);\n\t}\n }\n //for(int j=0;j<=m;j++) cout<<j<<\":\"<<dp[i][j]<<endl;\n }\n memset(dp2, -1, sizeof(dp2));\n dp2[0][0] = 0;\n rep(i, d) {\n //cout<<i<<\":\"<<f[i]<<endl;\n //rep(j, m+1) {\n for(int j = m; j >= 0; j--) {\n\tfor(int l = m; l >= j; l--) {\n\t if(dp2[i][l-j] == -1 || dp[f[i]][j] == -1) continue;\n\t dp2[i+1][l] = max(dp2[i+1][l], dp2[i][l-j] + dp[f[i]][j]);\n\t}\n }\n }\n int ansp, answ = -1;\n rep(i, m+1) {\n //cout << i << \" \"<<dp2[i]<<endl;\n if(answ < dp2[d][i]) {\n\tansw = dp2[d][i];\n\tansp = i;\n }\n }\n cout << answ << \" \" << ansp << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 460,
"memory_kb": 4960,
"score_of_the_acc": -0.4829,
"final_rank": 15
},
{
"submission_id": "aoj_1092_2285549",
"code_snippet": "#include<bits/stdc++.h>\n#define N 105\nusing namespace std;\ntypedef pair<int,int> P;\n\n\n\nint main(){\n \n int s,d,m;\n while(cin>>s>>d>>m){\n \n vector<P> v[N],cost;\n \n for(int i=0;i<s;i++){\n \n int k;\n cin>>k;\n\n for(int j=0;j<k;j++){\n \n\tint w,p;\n\tcin>>w>>p;\n \n\tv[i].push_back(P(w,p));\n }\n \n }\n\n for(int i=0;i<d;i++){\n \n int f;\n cin>>f;\n \n for(int j=0;j<v[f].size();j++)\n\tcost.push_back(v[f][j]);\n \n }\n\n int dp[5005][305];\n\n memset(dp,-1,sizeof(dp));\n dp[0][0]=0;\n \n for(int i=0;i<cost.size();i++){\n\n for(int j=0;j<=m;j++){\n\n\tif(dp[i][j]==-1)continue;\n \n\tdp[i+1][j]=max(dp[i+1][j],dp[i][j]);\n \n\tif(j+cost[i].second<=m)\n\t dp[i+1][j+cost[i].second]=max(dp[i+1][j+cost[i].second],dp[i][j]+cost[i].first);\n \n }\n \n }\n\n int ans1=0,ans2=0;\n\n for(int i=m;i>=0;i--){\n \n if(ans1<=dp[cost.size()][i]){\n\tans1=dp[cost.size()][i];\n\tans2=i;\n }\n }\n\n cout<<ans1<<' '<<ans2<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 9124,
"score_of_the_acc": -0.5338,
"final_rank": 19
},
{
"submission_id": "aoj_1092_2007744",
"code_snippet": "#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nint s, d, m;\nint main() {\n\twhile (~scanf(\"%d%d%d\", &s, &d, &m)) {\n\t\tvector<vector<pair<int, int> > > v(s);\n\t\tfor (int i = 0; i < s; i++) {\n\t\t\tint z; scanf(\"%d\", &z); v[i].resize(z);\n\t\t\tfor (int j = 0; j < z; j++) scanf(\"%d%d\", &v[i][j].first, &v[i][j].second);\n\t\t}\n\t\tvector<pair<int, int> > x;\n\t\tfor (int i = 0; i < d; i++) {\n\t\t\tint f; scanf(\"%d\", &f);\n\t\t\tx.insert(x.end(), v[f].begin(), v[f].end());\n\t\t}\n\t\tint n = x.size();\n\t\tvector<vector<int> > dp(n + 1, vector<int>(m + 1, -99999999));\n\t\tdp[0][0] = 0;\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tfor (int j = 0; j <= m; j++) {\n\t\t\t\tdp[i][j] = dp[i - 1][j];\n\t\t\t\tif (j >= x[i - 1].second) dp[i][j] = max(dp[i][j], dp[i - 1][j - x[i - 1].second] + x[i - 1].first);\n\t\t\t}\n\t\t}\n\t\tint ret1 = 0, ret2 = 0;\n\t\tfor (int i = 0; i <= m; i++) {\n\t\t\tif (dp[n][i] > ret1) ret1 = dp[n][i], ret2 = i;\n\t\t}\n\t\tprintf(\"%d %d\\n\", ret1, ret2);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 6032,
"score_of_the_acc": -0.2799,
"final_rank": 12
},
{
"submission_id": "aoj_1092_2007742",
"code_snippet": "#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nint s, d, m;\nint main() {\n\twhile (cin >> s >> d >> m) {\n\t\tvector<vector<pair<int, int> > > v(s);\n\t\tfor (int i = 0; i < s; i++) {\n\t\t\tint z; cin >> z; v[i].resize(z);\n\t\t\tfor (int j = 0; j < z; j++) cin >> v[i][j].first >> v[i][j].second;\n\t\t}\n\t\tvector<pair<int, int> > x;\n\t\tfor (int i = 0; i < d; i++) {\n\t\t\tint f; cin >> f;\n\t\t\tx.insert(x.end(), v[f].begin(), v[f].end());\n\t\t}\n\t\tint n = x.size();\n\t\tvector<vector<int> > dp(n + 1, vector<int>(m + 1, -99999999));\n\t\tdp[0][0] = 0;\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tfor (int j = 0; j <= m; j++) {\n\t\t\t\tdp[i][j] = dp[i - 1][j];\n\t\t\t\tif (j >= x[i - 1].second) dp[i][j] = max(dp[i][j], dp[i - 1][j - x[i - 1].second] + x[i - 1].first);\n\t\t\t}\n\t\t}\n\t\tint ret1 = 0, ret2 = 0;\n\t\tfor (int i = 0; i <= m; i++) {\n\t\t\tif (dp[n][i] > ret1) ret1 = dp[n][i], ret2 = i;\n\t\t}\n\t\tcout << ret1 << ' ' << ret2 << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 230,
"memory_kb": 5872,
"score_of_the_acc": -0.3257,
"final_rank": 13
},
{
"submission_id": "aoj_1092_1982127",
"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\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n \n\n\nint main() {\n\tint S, D, M;\n\twhile (cin >> S >> D >> M) {\n\t\tmap<pair<int, int>, int>nums;\n\t\tvector<vector<pair<int, int>>>sws(S);\n\t\tfor (int i = 0; i < S; ++i) {\n\t\t\tint k; cin >> k;\n\t\t\tvector<pair<int, int>>sw(k);\n\t\t\tfor (int j = 0; j < k; ++j) {\n\t\t\t\tint w, p; cin >> w >> p;\n\t\t\t\tsw[j] = make_pair(w, p);\n\t\t\t}\n\t\t\tsws[i] = sw;\n\t\t}\n\t\tmap<int, int>mp;\n\t\tfor (int i = 0; i < D; ++i) {\n\t\t\tint f; cin >> f;\n\t\t\tmp[f]++;\n\t\t}\n\t\tfor (int i = 0; i < S; ++i) {\n\t\t\tfor (int j = 0; j < sws[i].size(); ++j) {\n\t\t\t\tnums[sws[i][j]] += mp[i];\n\t\t\t}\n\t\t}\n\n\t\tvector<vector<int>>memo(nums.size() + 1, vector<int>(M + 1,-1e8));\n\t\tmemo[0][0] = 0;\n\t\tint aa = 0;\n\t\tfor (auto num:nums) {\n\t\t\tfor (int nweight = 0; nweight<= M; ++nweight) {\n\t\t\t\tfor (int i = 0; i <= num.second; ++i) {\n\t\t\t\t\tconst int nextweight = nweight + num.first.second*i;\n\t\t\t\t\tconst int nextvalue = memo[aa][nweight] + num.first.first*i;\n\t\t\t\t\tif (nextweight <= M) {\n\t\t\t\t\t\tmemo[aa + 1][nextweight] = max(memo[aa + 1][nextweight], nextvalue);\n\t\t\t\t\t}\n\t\t\t\t\telse {\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\t\n\t\t\taa++;\n\t\t}\n\n\t\tint ans = 0;\n\t\tint ans2 = 0;\n\t\tfor (int i = 0; i <= M; ++i) {\n\t\t\tif (ans < memo[nums.size()][i]) {\n\t\t\t\tans = memo[nums.size()][i];\n\t\t\t\tans2 = i;\n\t\t\t}\n\t\t}\n\t\tcout << ans<<\" \"<<ans2 << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 5380,
"score_of_the_acc": -0.3604,
"final_rank": 14
},
{
"submission_id": "aoj_1092_1893442",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)\n#define all(x) (x).begin(),(x).end()\n#define mp make_pair\n#define pb push_back\n#define fi first\n#define se second\n\nconst int INF=12345678;\n\n//weight,price\ntypedef pair<int,int> pi;\n\nint main()\n{\n int s,d,m;\n while(cin >>s >>d >>m)\n {\n vector<vector<pi>> kanmi(s);\n vector<int> f(d);\n\n rep(i,s)\n {\n int k;\n cin >>k;\n rep(j,k)\n {\n int w,p;\n cin >>w >>p;\n kanmi[i].pb(pi(w,p));\n }\n }\n rep(i,d) cin >>f[i];\n\n //i????????£??????????¢????????????????????????§???\n int dp[301]={0};\n\n rep(i,d)\n {\n //????????\\???j??????????????????????????????\n rep(j,kanmi[f[i]].size())\n {\n for(int x=m; x>=0; --x)\n {\n //?????????\n if(x+kanmi[f[i]][j].se<=m)\n {\n dp[x+kanmi[f[i]][j].se] = max(dp[x+kanmi[f[i]][j].se], dp[x]+kanmi[f[i]][j].fi);\n }\n }\n\n }\n }\n\n int ax=0,ay=0;\n rep(i,m+1)\n {\n //printf(\"dp[%d]=%d\\n\", i,dp[i]);\n if(dp[i]>ax)\n {\n ax=dp[i];\n ay=i;\n }\n }\n\n printf(\"%d %d\\n\",ax,ay);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 3156,
"score_of_the_acc": -0.0855,
"final_rank": 8
},
{
"submission_id": "aoj_1092_1868542",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX 334\ntypedef pair<int, int> pii;\n\nint main()\n{\n int s, d, m;\n while (cin >> s >> d >> m) {\n vector<pii> v[s];\n for (int i = 0; i < s; i++) {\n int k, w, p;\n cin >> k;\n for (int j = 0; j < k; j++) {\n cin >> w >> p;\n v[i].push_back(pii(w, p));\n }\n }\n\n int dp[MAX], f;\n memset(dp, -1, sizeof(dp));\n dp[m] = 0;\n for (int i = 0; i < d; i++) {\n cin >> f;\n for (int j = 0; j < (int)v[f].size(); j++) {\n for (int k = 0; k <= m; k++) {\n if (dp[k] == -1) continue;\n int nm = k - v[f][j].second;\n if (nm >= 0) {\n dp[nm] = max(dp[nm], dp[k] + v[f][j].first);\n }\n }\n } \n }\n \n int idx = m;\n for (int i = m-1; i >= 0; i--) {\n if (dp[i] > dp[idx]) {\n idx = i;\n }\n }\n cout << dp[idx] << \" \" << m - idx << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 3120,
"score_of_the_acc": -0.1204,
"final_rank": 9
}
] |
aoj_1089_cpp
|
Problem F: Strawberry Cake
会津大学附属小学校 (会津大小) に入学したシャ、ネロ、エリ、コーは競技プログラマとして活躍するために IPPC というプログラミングコンテストに出場することにした。しかし IPPC は 3 人 1 組でチームとしてコンテストに出場する決まりで、4 人でチームを組むことはできない。そこで彼らは 2 人ずつに分かれてチームを組み、2 人 1 組で参加できる IPOCH というプログラミングコンテストに出場することにした。
チームは分かれてしまったが、実力は拮抗しており互いに良い練習相手になっている。
ある日彼らのコーチが差し入れにホールケーキを買ってきた。彼らはそれをシャの家で食べることにした。しかし家に着いて箱を開けてみるとケーキが変形していて、形は上から見ると円形ではなく凸多角形のようになっていた。ネロに運ばせたのが悪かったようだ。
ケーキの上にはイチゴが 1 つ乗っている。とりあえず 2 チームで分けるために、いまこのケーキをイチゴを通る直線にそって半分になるようにナイフで切ることが決定した。ケーキを切る前にイチゴを先にとってしまうのは彼らの美意識に反する。
あなたの仕事は 2 次元平面上に与えられる凸多角形 K を原点 (0, 0) を通る直線 L で分割したとき、分割で出来た 2 つの凸多角形の面積が等しくなるように直線 L を定めることである。もし複数あるならいずれかひとつで構わない。
Input
入力は複数のテストケースからなる。各テストケースは以下の形式に従う。
N
x
1
y
1
x
2
y
2
...
x
N
y
N
N は与えられる凸多角形 K の頂点数である。点 (x
i
, y
i
) ( 1 ≤ i ≤ N ) はすべて凸多角形 K を成す頂点の座標であり、互いに異なる。これらは反時計回りの順で与えられる。また、凸多角形 K のどの辺上の点も原点との距離が 1 以上で、凸多角形 K は常に原点を内包する。入力の終了はひとつの0を含む１行で示される。原点を含む、入力で与えられる異なる 3 点は共線となりうることに注意して欲しい。
Constraints
入力はすべて整数
3 ≤ N ≤ 20
-100 ≤ x
i
≤ 100 ( 1 ≤ i ≤ N )
-100 ≤ y
i
≤ 100 ( 1 ≤ i ≤ N )
テストケースの数は 1,000 を超えない。
Output
以下の形式で直線 L 上の点 A (A
x
, A
y
) を出力せよ。ただし点 A と原点との距離は 1 以上でなければならない。
A
x
A
y
原点とこの点 A を通る直線で凸多角形 K を分割したとき 2 つの凸多角形の面積の差が 10
-5
未満でなければならない。点 A の座標は小数点以下 15 桁出力して欲しい。
Sample Input
4
-100 -100
100 -100
100 100
-100 100
4
-99 -100
100 -100
100 100
-99 100
4
-100 -99
100 -99
100 100
-100 100
14
-99 -70
-92 -79
10 -98
37 -100
62 -95
77 -69
88 -47
92 -10
96 28
100 91
42 92
-62 92
-88 91
-98 64
0
Sample Output
100.000000000000000 0.000000000000000
100.000000000000000 0.000000000000000
0.000000000000000 100.000000000000000
-96.983291994836122 66.745111613942484
|
[
{
"submission_id": "aoj_1089_9083645",
"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// https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/all\n////////////////////////////////////////////////////////////////////////////////\ntypedef double Real;\nconst Real eps = 1e-8; // 1000 : 10^-8, 10000 : 10^-7\ninline int sgn(Real a, Real b = 0) { return (a - b < -eps) ? -1 : (a - b > eps) ? 1 : 0; }\ninline Real _sqrt(Real a) { return sqrt(max(a, (Real)0)); }\nstruct Point {\n Real x, y;\n Point() {}\n Point(Real x, Real y) : x(x), y(y) {}\n Point &operator-=(const Point &p) {\n x -= p.x;\n y -= p.y;\n return *this;\n }\n Point &operator+=(const Point &p) {\n x += p.x;\n y += p.y;\n return *this;\n }\n Point &operator*=(Real d) {\n x *= d;\n y *= d;\n return *this;\n }\n Point &operator/=(Real d) {\n x /= d;\n y /= d;\n return *this;\n }\n Point operator+(const Point &p) const {\n Point res(*this);\n return res += p;\n }\n Point operator-(const Point &p) const {\n Point res(*this);\n return res -= p;\n }\n Point operator*(Real d) const {\n Point res(*this);\n return res *= d;\n }\n Point operator/(Real d) const {\n Point res(*this);\n return res /= d;\n }\n bool operator<(const Point &p) const { return (sgn(x, p.x) < 0 or (sgn(x, p.x) == 0 and sgn(y, p.y) < 0)); }\n bool operator==(const Point &p) const { return (sgn(x - p.x) == 0 and sgn(y - p.y) == 0); }\n friend istream &operator>>(istream &is, Point &p) {\n is >> p.x >> p.y;\n return (is);\n }\n Real norm() { return _sqrt(x * x + y * y); }\n Real norm2() { return (x * x + y * y); }\n Point vec() { return (*this); }\n Point unit() { return (*this) / this->norm(); } // 単位ベクトル\n Point rotate(Real theta) { return {x * cos(theta) - y * sin(theta), x * sin(theta) + y * cos(theta)}; }\n Point perpendicular() { return {-y, x}; }\n Point normal() { return perpendicular().unit(); } // 法線ベクトル\n};\n\nPoint vec(Point a, Point b) { return (b - a); }\nReal dist(Point a, Point b) { return vec(a, b).norm(); }\nReal dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }\nReal cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }\n\n// 線分\nstruct Segment : array<Point, 2> {\n Segment() {}\n Segment(Point a, Point b) { at(0) = a, at(1) = b; }\n Point vec() { return (at(1) - at(0)); }\n Real length() { return vec().norm(); }\n friend istream &operator>>(istream &is, Segment &s) {\n is >> s[0] >> s[1];\n return (is);\n }\n};\n// 直線\nstruct Line : Segment {\n Line() {}\n Line(Point a, Point b) : Segment(a, b) {}\n Line(Segment s) : Line(s[0], s[1]) {}\n};\n\nint ccw(Point a, Point b, Point c) {\n b -= a;\n c -= a;\n if (sgn(cross(b, c)) == 1) return 1; // a,b,c 反時計回り\n if (sgn(cross(b, c)) == -1) return -1; // a,b,c 時計周り\n if (sgn(dot(b, c)) == -1) return 2; // c,a,b 一直線上\n if (sgn(c.norm() - b.norm()) == 1) return -2; // a,b,c 一直線上\n return 0; // a,c,b 一直線上\n}\n\n// 垂直判定\ntemplate <typename T> bool is_orthogonal(T s, T t) { return sgn(dot(s.vec(), t.vec())) == 0; }\n// 並行判定\ntemplate <typename T> bool is_parallel(T s, T t) { return sgn(cross(s.vec(), t.vec())) == 0; }\n// 同一直線判定\ntemplate <typename T> bool is_same_line(T s, T t) { return abs(ccw(s[0], s[1], t[0])) != 1 and abs(ccw(s[0], s[1], t[1])) != 1; }\n// 線分上の点判定\nbool is_on_segment(Point p, Segment l) { return ccw(l[0], l[1], p) == 0; }\n// 線分の交差判定(AOJ-2172)\nbool is_intersect(Segment s, Segment t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 and ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\n// 2直線の交点(AOJ-2596)\npair<bool, Point> line_intersection(Line s, Line t) {\n if (is_same_line(s, t)) return {true, s[0]};\n else if (is_parallel(s, t)) return {false, Point()};\n else return {true, s[0] + s.vec() * cross(t[0] - s[0], t.vec()) / cross(s.vec(), t.vec())};\n}\n// 2線分の交点\npair<bool, Point> segment_intersection(Segment s, Segment t) {\n if (is_same_line(s, t)) {\n if (is_on_segment(s[0], t)) return {true, s[0]};\n else if (is_on_segment(s[1], t)) return {true, s[1]};\n else if (is_on_segment(t[0], s)) return {true, t[0]};\n else return {false, Point()};\n }\n if (!is_intersect(s, t)) return {false, Point()};\n else return line_intersection(Line(s), Line(t));\n}\n// 点と直線の距離\nReal point_line_distance(Point p, Line l) { return abs(cross(p - l[0], l.vec())) / l.length(); }\n// 点と線分の距離\nReal point_segment_distance(Point p, Segment l) {\n if (sgn(dot(p - l[0], l.vec())) == -1) return dist(p, l[0]);\n else if (sgn(dot(p - l[1], l.vec())) == 1) return dist(p, l[1]);\n else return point_line_distance(p, l);\n}\n// 線分と線分の距離(AOJ-1157)\nReal segment_segment_distance(Segment s, Segment t) {\n if (is_intersect(s, t)) return 0;\n double res = point_segment_distance(s[0], t);\n res = min(res, point_segment_distance(s[1], t));\n res = min(res, point_segment_distance(t[0], s));\n res = min(res, point_segment_distance(t[1], s));\n return res;\n}\n\n// 多角形ライブラリ\nstruct Polygon : public vector<Point> {\n Polygon() {}\n Polygon(int n) { this->resize(n); }\n Polygon(vector<Point> init) {\n this->resize(init.size());\n for (int i = 0; i < (int)init.size(); ++i) {\n (*this)[i] = init[i];\n }\n }\n Polygon(initializer_list<Point> init) : Polygon(vector<Point>(init.begin(), init.end())) {}\n void rev() {\n if (sgn(area()) == -1) reverse(this->begin(), this->end());\n }\n // 多角形の符号付き面積(反時計回りが正)\n Real area() {\n int n = this->size();\n Real s = 0;\n for (int i = 0; i < n; ++i) {\n s += cross((*this)[i], (*this)[(i + 1) % n]);\n }\n return s * 0.5;\n }\n // 多角形の凸性判定(反時計周りを仮定)\n bool is_convex() {\n int n = this->size();\n for (int i = 0; i < n; ++i) {\n if (ccw((*this)[i], (*this)[(i + 1) % n], (*this)[(i + 2) % n]) == -1) return false;\n }\n return true;\n }\n enum Type { OUT, ON, IN };\n // 点の包含判定 O(N) (凸性を仮定しない)\n int is_in_polygon(Point p) {\n int n = this->size();\n bool in = false;\n for (int i = 0; i < n; ++i) {\n Point a = (*this)[i], b = (*this)[(i + 1) % n];\n if (is_on_segment(p, Line(a, b))) {\n return Type::ON;\n }\n a -= p, b -= p;\n if (a.y > b.y) std::swap(a, b);\n if (sgn(a.y) <= 0 and 0 < sgn(b.y) and sgn(cross(a, b)) < 0) in ^= 1;\n }\n return in ? Type::IN : Type::OUT;\n }\n // 凸多角形の直径 {{直径を成す2点},直径}\n pair<pair<int, int>, Real> diameter() {\n assert(is_convex());\n int n = this->size();\n pair<int, int> arg_max = {-1, -1};\n Real max_dist = -1;\n for (int i = 0, j = 0; i < n; ++i) {\n Real cur_dist = dist((*this)[i], (*this)[j]);\n while (j + 1 < n) {\n Real nxt_dist = dist((*this)[i], (*this)[j + 1]);\n if (nxt_dist > cur_dist) j++, cur_dist = nxt_dist;\n else break;\n }\n if (max_dist < cur_dist) max_dist = cur_dist, arg_max = {i, j};\n }\n return {arg_max, max_dist};\n }\n};\n\n// 凸包 (線分上の点を含めるかどうか)\nPolygon convex_hull(vector<Point> ps, bool ONSEG = false) {\n int n = (int)ps.size();\n if (n <= 2) return ps;\n sort(ps.begin(), ps.end());\n int k = 0; // 凸包の頂点数\n Polygon qs(2 * n); // 構築中の凸包\n auto check = [&](int _ccw) { return ONSEG ? _ccw == -1 : _ccw <= 0; };\n for (int i = 0; i < n; qs[k++] = ps[i++]) {\n while (k >= 2 and check(ccw(qs[k - 2], qs[k - 1], ps[i])))\n k--;\n }\n for (int i = n - 2, t = k + 1; i >= 0; qs[k++] = ps[i--]) {\n while (k >= t and check(ccw(qs[k - 2], qs[k - 1], ps[i])))\n k--;\n }\n qs.resize(k - 1);\n return qs;\n}\n// 凸多角形を直線(l.a->l.b)で切断して左側に出来る多角形を求める\nPolygon convex_cut(Polygon &ps, Line l) {\n assert(ps.is_convex());\n int n = ps.size();\n Polygon res;\n for (int i = 0; i < n; ++i) {\n Point cur = ps[i], nxt = ps[(i + 1) % n];\n if (ccw(l[0], l[1], cur) != -1) res.emplace_back(cur);\n if (ccw(l[0], l[1], cur) * ccw(l[0], l[1], nxt) < 0) {\n res.emplace_back(line_intersection(l, Line(cur, nxt)).second);\n }\n }\n return res;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n;\n while (cin >> n, n) {\n Polygon g(n);\n for (int i = 0; i < n; ++i) {\n cin >> g[i];\n }\n Real S = g.area();\n Real L = 0, R = acos(-1.0);\n auto calc = [&](Real theta) -> Real {\n Line l(Point(0, 0), Point(cos(theta), sin(theta)));\n return S / 2.0 - convex_cut(g, l).area();\n };\n auto fl = calc(L);\n for (int i = 0; i < 100; ++i) {\n Real mid = (L + R) / 2;\n auto f = calc(mid);\n if (sgn(f * fl) >= 0) L = mid;\n else R = mid;\n }\n printf(\"%.15f %.15f\\n\", cos(L) * 2, sin(L) * 2);\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3872,
"score_of_the_acc": -1.0088,
"final_rank": 9
},
{
"submission_id": "aoj_1089_4972132",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, a) for (int i = 0; i < (a); i++)\n#define pb push_back\n#define EPS 1e-10\n#define PI acos(-1.0)\nconst double INF = 1e9;\ntypedef complex<double> P;\ntypedef vector<P> G;\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); }\n\nstruct L\n{\n P a, b;\n L(const P &a, const P &b) : a(a), b(b) {}\n};\n\nint ccw(P a, P b, P c)\n{\n b -= a;\n c -= a;\n if (cross(b, c) > 0)\n return +1; // +1 : 反時計回り\n if (cross(b, c) < 0)\n return -1; // -1 : 時計回り\n if (dot(b, c) < 0)\n return +2; // +2 : 線上(c--a--b)\n if (norm(b) < norm(c))\n return -2; // -2 : 線上(a--b--c)\n return 0;\n}\n\nP crosspointLL(const L &l, const L &m)\n{\n double A = cross(l.b - l.a, m.b - m.a);\n double B = cross(l.b - l.a, l.b - m.a);\n if (abs(A) < EPS && abs(B) < EPS)\n return m.a; // 重なっている\n if (abs(A) < EPS)\n return P(INF, INF); // 交差しない\n return m.a + B / A * (m.b - m.a);\n}\n\nG convex_cut(const G &g, const L &l)\n{\n G Q;\n rep(i, g.size())\n {\n P A = g[i], B = g[(i + 1) % g.size()];\n if (ccw(l.a, l.b, A) != -1)\n Q.push_back(A);\n if (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0)\n Q.push_back(crosspointLL(L(A, B), l));\n }\n return Q;\n}\n\n#define curr(g, i) g[i]\n#define next(g, i) g[(i + 1) % g.size()]\ndouble areaG(const G &g)\n{\n double A = 0;\n for (int i = 0; i < g.size(); ++i)\n A += cross(curr(g, i), next(g, i));\n return A / 2.0;\n}\n\nint main()\n{\n int n;\n while (cin >> n, n)\n {\n G g;\n rep(i, n)\n {\n double x, y;\n cin >> x >> y;\n g.pb(P(x, y));\n }\n double S = areaG(g) / 2;\n double lb = 0, ub = PI;\n double th, tS;\n\n if (tS = areaG(convex_cut(g, L(P(0, 0), P(1, 0)))) + EPS > S)\n {\n ub = 0;\n lb = PI;\n }\n\n while (abs(tS - S) >= EPS)\n {\n th = (lb + ub) / 2;\n tS = areaG(convex_cut(g, L(P(0, 0), P(cos(th), sin(th)))));\n if (abs(tS - S) < EPS)\n break;\n else if (tS - S > 0)\n ub = th;\n else\n lb = th;\n }\n printf(\"%.15f %.15f\\n\", cos(th), sin(th));\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3680,
"score_of_the_acc": -0.7196,
"final_rank": 6
},
{
"submission_id": "aoj_1089_4331990",
"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#define EPS 0.00000001\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\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\tPoint p[2];\n};\n\nint N;\n\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\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//交点を求める関数\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(x1 != x2){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_minus(Point a,Point b){\n Point ret;\n\n ret.x = a.x-b.x;\n ret.y = a.y-b.y;\n\n return ret;\n}\n\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -1;\nstatic const int ON_SEGMENT = 0;\n\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\nPolygon ConvexCut(Polygon g,Point a,Point b){\n\n\tPolygon ret;\n\tint N = g.size();\n\n\tfor(int i = 0; i < g.size(); i++){\n\t\tPoint A = g[i], B = g[(i+1)%N];\n\t\tif(ccw(a,b,A) != -1)ret.push_back(A);\n\t\tif(ccw(a,b,A)*ccw(a,b,B) == -1)ret.push_back(calc_Cross_Point(a,b,A,B));\n\t}\n\n\treturn ret;\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\nvoid func(){\n\n\tPolygon pol;\n\n\tfor(int i = 0; i < N; i++){\n\t\tPoint point;\n\n\t\tscanf(\"%lf %lf\",&point.x,&point.y);\n\t\tpol.push_back(point);\n\t}\n\n\tdouble base_S = calc_S(pol)/2;\n\n\tdouble L_S = calc_S(ConvexCut(pol,Point(-1000,0),Point(1000,0)));\n\n\tdouble ans_x,ans_y;\n\n\tif(fabs(L_S-base_S) < EPS){\n\n\t\tans_x = 2;\n\t\tans_y = 0;\n\n\t\tprintf(\"%.15lf %.15lf\\n\",ans_x,ans_y);\n\t\treturn;\n\t}\n\n\tdouble left = 0,right = M_PI,mid = (left+right)/2;\n\n\tif(L_S > base_S){\n\n\t\tleft = -M_PI;\n\t\tright = 0;\n\t}\n\n\tfor(int loop = 0; loop < 100; loop++){\n\n\t\tL_S = calc_S(ConvexCut(pol,Point(0,0),Point(cos(mid),sin(mid))));\n\n\t\tif(L_S > base_S){\n\n\t\t\tright = mid;\n\n\t\t}else{\n\n\t\t\tleft = mid;\n\t\t}\n\t\tmid = (left+right)/2;\n\t}\n\n\tans_x = 2*cos(mid);\n\tans_y = 2*sin(mid);\n\n\tprintf(\"%.15lf %.15lf\\n\",ans_x,ans_y);\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3620,
"score_of_the_acc": -0.6352,
"final_rank": 4
},
{
"submission_id": "aoj_1089_4331977",
"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#define EPS 0.00000001\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\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\tPoint p[2];\n};\n\nint N;\n\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\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//交点を求める関数\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(x1 != x2){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_minus(Point a,Point b){\n Point ret;\n\n ret.x = a.x-b.x;\n ret.y = a.y-b.y;\n\n return ret;\n}\n\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -1;\nstatic const int ON_SEGMENT = 0;\n\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\nPolygon ConvexCut(Polygon g,Point a,Point b){\n\n\tPolygon ret;\n\tint N = g.size();\n\n\tfor(int i = 0; i < g.size(); i++){\n\t\tPoint A = g[i], B = g[(i+1)%N];\n\t\tif(ccw(a,b,A) != -1)ret.push_back(A);\n\t\tif(ccw(a,b,A)*ccw(a,b,B) == -1)ret.push_back(calc_Cross_Point(a,b,A,B));\n\t}\n\n\treturn ret;\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\nvoid func(){\n\n\tPolygon pol;\n\n\tfor(int i = 0; i < N; i++){\n\t\tPoint point;\n\n\t\tscanf(\"%lf %lf\",&point.x,&point.y);\n\t\tpol.push_back(point);\n\t}\n\n\tdouble base_S = calc_S(pol)/2;\n\n\tdouble L_S = calc_S(ConvexCut(pol,Point(-1000,0),Point(1000,0)));\n\n\tdouble ans_x,ans_y;\n\n\tif(fabs(L_S-base_S) < EPS){\n\n\t\tans_x = 2;\n\t\tans_y = 0;\n\n\t\tprintf(\"%.15lf %.15lf\\n\",ans_x,ans_y);\n\t\treturn;\n\t}\n\n\tdouble left = 0,right = M_PI,mid = (left+right)/2;\n\n\tif(L_S > base_S){\n\n\t\tleft = -M_PI;\n\t\tright = 0;\n\t}\n\n\tdouble slope;\n\n\tfor(int loop = 0; loop < 100; loop++){\n\n\t\tif(fabs(mid-(M_PI/2)) < EPS){\n\n\t\t\tL_S = calc_S(ConvexCut(pol,Point(0,-1000),Point(0,1000)));\n\n\t\t}else{\n\n\t\t\tslope = tan(mid);\n\t\t\tL_S = calc_S(ConvexCut(pol,Point(-1000,-1000*slope),Point(1000,1000*slope)));\n\t\t}\n\n\t\tif(L_S > base_S){\n\n\t\t\tright = mid;\n\n\t\t}else{\n\n\t\t\tleft = mid;\n\t\t}\n\t\tmid = (left+right)/2;\n\t}\n\n\tif(fabs(mid-(M_PI/2)) < EPS){\n\n\t\tans_x = 0;\n\t\tans_y = 2;\n\n\t}else{\n\n\t\tans_x = 2;\n\t\tans_y = 2*tan(mid);\n\t}\n\n\tprintf(\"%.15lf %.15lf\\n\",ans_x,ans_y);\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 0.25,
"time_ms": 830,
"memory_kb": 3696,
"score_of_the_acc": -1.4524,
"final_rank": 19
},
{
"submission_id": "aoj_1089_3721514",
"code_snippet": "#include <iostream>\n#include <complex>\n#include <utility>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\ntypedef complex<double> Point, Vector;\ntypedef pair<Point, Point> Segment, Line;\ntypedef vector<Point> Polygon;\n\n#define X real()\n#define Y imag()\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n\nconst double pi = acos(-1);\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\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\n return ON_SEGMENT;\n}\n\ndouble convexArea(Polygon pol){\n int n = pol.size();\n double S = 0;\n for(int i=0; i<n; i++){\n S += cross(pol[i], pol[(i+1)%n]);\n }\n\n return S / 2;\n}\n\nPoint getCrossPointLL(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(abs(a) < EPS && abs(b) < EPS) return l2.first;\n return l2.first + (l2.second - l2.first) * (b / a);\n}\n\nPolygon convexCut(Polygon pol, Line l){\n Polygon q;\n int n = pol.size();\n for(int i=0; i<n; i++){\n Point a = pol[i];\n Point b = pol[(i+1)%n];\n if(ccw(l.first, l.second, a) != CLOCKWISE) q.emplace_back(a);\n if(ccw(l.first, l.second, a) * ccw(l.first, l.second, b) < -EPS){\n q.emplace_back(getCrossPointLL(Line(a, b), l));\n }\n }\n\n return q;\n}\n\ndouble solve(Polygon pol){\n double S = convexArea(pol);\n double lb = 0, ub = pi;\n\n if(convexArea(convexCut(pol, Line(Point(0, 0), Point(1, 0)))) > S / 2){\n lb = pi;\n ub = 0;\n }\n\n double mid;\n for(int i=0; i<10000; i++){\n mid = (lb + ub) / 2;\n double midS = convexArea(convexCut(pol, Line(Point(0, 0), Point(cos(mid), sin(mid)))));\n\n if(abs(midS - S / 2) < EPS) break;\n\n if(midS < S / 2){\n lb = mid;\n }\n else{\n ub = mid;\n }\n }\n\n return mid;\n}\n\nint main(){\n while(1){\n int n; cin>>n;\n if(n == 0) return 0;\n Polygon pol;\n for(int i=0; i<n; i++){\n double x, y; cin>>x>>y;\n pol.emplace_back(x, y);\n }\n\n double rad = solve(pol);\n\n printf(\"%.15f %.15f\\n\", cos(rad), sin(rad));\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3588,
"score_of_the_acc": -0.5679,
"final_rank": 2
},
{
"submission_id": "aoj_1089_3706983",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n// #define int ll\nusing PII = pair<ll, ll>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n\ntemplate<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\ntemplate<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\n\ntemplate<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }\ntemplate<typename T,typename... Ts>\nauto make_v(size_t a,Ts... ts) {\n return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\n}\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value==0>::type\nfill_v(T &t, const V &v) { t=v; }\ntemplate<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type\nfill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }\n\ntemplate<class S,class T>\nostream &operator <<(ostream& out,const pair<S,T>& a) {\n out<<'('<<a.first<<','<<a.second<<')'; return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out,const vector<T>& a){\n out<<'[';\n for(const T &i: a) out<<i<<',';\n out<<']';\n return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out, const set<T>& a) {\n out<<'{';\n for(const T &i: a) out<<i<<',';\n out<<'}';\n return out;\n}\ntemplate<class T, class S>\nostream &operator <<(ostream& out, const map<T,S>& a) {\n out<<'{';\n for(auto &i: a) out<<i<<',';\n out<<'}';\n return out;\n}\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL\nconst int INF = 1<<30;\nconst ll LLINF = 1LL<<60;\nconst ll MOD = 1000000007;\n\nusing R = long double; // Rにmint渡せるようにする\nusing P = complex<R>;\nusing L = pair<P,P>;\nusing G = vector<P>;\nstruct C {\n P c; R r;\n C() {}\n C(const P &a, const R &b) : c(a), r(b) {}\n};\nstruct S : public L {\n S() {}\n S(const P &a, const P &b) : L(a,b) {}\n};\n\nconst R EPS = 1e-8;\nconst R PI = atan(1)*4;\n\ninline int sgn(const R& r) { return (r>EPS) - (r<-EPS); }\ninline R dot(const P& a, const P& b) {\n return real(a)*real(b) + imag(a)*imag(b);\n}\ninline R det(const P& a, const P& b) {\n return real(a)*imag(b) - imag(a)*real(b);\n}\ninline P vec(const L& l) {return l.second - l.first;}\nnamespace std {\n\tbool operator < (const P& a, const P& b) {\n\t\treturn sgn(real(a-b)) ? real(a-b) < 0 : sgn(imag(a-b)) < 0;\n\t}\n\tbool operator == (const P& a, const P& b) {\n\t\treturn sgn(real(a-b)) == 0 && sgn(imag(a-b)) == 0;\n\t}\n bool cmp_y (const P& a, const P& b) {\n return sgn(imag(a-b)) ? imag(a-b) < 0 : sgn(real(a-b)) < 0;\n }\n}\n\n// P,L,Sについて入力\ninline istream& operator>>(istream& is, P& p) {\n R x, y;\n is >> x >> y;\n p = P(x, y);\n return is;\n}\ninline istream& operator>>(istream& is, L& l) {\n P a, b;\n is >> a >> b;\n l = L(a, b);\n return is;\n}\ninline istream& operator>>(istream& is, S& s) {\n P a, b;\n is >> a >> b;\n s = S(a, b);\n return is;\n}\n\n// 交点 交差判定を先にすること!!!\ninline P crosspoint(const L& l1, const L& l2) {\n R ratio = det(vec(l2), l2.first-l1.first)/det(vec(l2),vec(l1));\n return l1.first + vec(l1)*ratio;\n}\n\n// 凸多角形polを直線lで切断して左側の多角形を返す\nG convex_cut(const G& pol, const L& l) {\n G res;\n REP(i, pol.size()) {\n P a = pol[i], b = pol[(i + 1)%pol.size()];\n int da = sgn(det(l.first-a, l.second-a)), db = sgn(det(l.first-b, l.second-b));\n if (da >= 0) res.emplace_back(a);\n if (da * db < 0) res.emplace_back(crosspoint(L{a, b}, l));\n }\n return res;\n}\n\n// 面積 頂点が反時計回りに並んでいること\nR area(const G& pol) {\n R ret = 0.0;\n REP(i, pol.size()) ret += det(pol[i], pol[(i+1)%pol.size()]);\n return (ret/2.0);\n}\n\n// 角度thetaの直線でpolを切断した後左半分の面積\nR cut_poly(R theta, const G& pol) {\n L l(P(0,0), P(10.0*cos(theta), 10.0*sin(theta)));\n G g = convex_cut(pol, l);\n return area(g);\n}\n\nsigned main(void)\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while(1) {\n ll n;\n cin >> n;\n if(!n) break;\n G vp(n);\n REP(i, n) cin >> vp[i];\n\n R vp_area = area(vp), v = cut_poly(0, vp);\n R lb = 0, ub = PI;\n REP(i, 100) {\n R mid = (lb+ub)/2;\n R val = cut_poly(mid, vp);\n if(v < vp_area/2) {\n if(val > vp_area/2) ub = mid;\n else lb = mid;\n } else {\n if(val > vp_area/2) lb = mid;\n else ub = mid;\n }\n }\n cout << fixed << setprecision(16) << 10.0*cos(lb) << \" \" << 10.0*sin(lb) << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3620,
"score_of_the_acc": -0.6706,
"final_rank": 5
},
{
"submission_id": "aoj_1089_3698169",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <utility>\n#include <complex>\n#include <cassert>\nusing namespace std;\nusing W = long double;\nusing P = complex<W>;\nusing Poly = vector<P>;\nusing L = pair<P,P>;\n#define X real()\n#define Y imag()\nconstexpr W EPS = 1e-10, pi = acos(-1);\n\nvoid debug(Poly p){\n cerr << \"Polygon\" << endl;\n for(auto e : p) cerr << e.X << \" \" << e.Y << endl;\n cerr << \"...\" << endl;\n}\n\nvoid debug(L l){\n fprintf(stderr,\"Segment %Lf %Lf %Lf %Lf\\n\",l.first.X,l.first.Y,l.second.X,l.second.Y);\n}\n\nW dot(const P &a, const P &b){ return a.X*b.X + a.Y*b.Y; }\nW cross(const P &a, const P &b){ return a.X*b.Y - a.Y*b.X; }\n\nP intersection(const L &a, const L &b){\n P af = a.first, as = a.second, bf = b.first, bs = b.second;\n return af + cross(bs-bf,af-bf)/(-cross(bs-bf,as-bf)+cross(bs-bf,af-bf))*(as-af);\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(norm(b) + EPS < norm(c)) return -2;\n return 0;\n}\n\nPoly convex_cut(const Poly &p, const L &l){\n Poly ret;\n int n = p.size();\n for(int i = 0; i < n; ++i){\n P cur = p[i], nex = p[(i+1)%n], lf = l.first, ls = l.second;\n if(ccw(lf,ls,cur) != -1)\n ret.push_back(cur);\n if((ccw(lf,ls,cur) != -1) ^ (ccw(lf,ls,nex) != -1))\n ret.push_back(intersection(L(cur,nex),l));\n }\n return ret;\n}\n\nW area(const Poly &p){\n int n = p.size();\n W ret = 0;\n for(int i = 0; i < n; ++i){\n ret += cross(p[i],p[(i+1)%n]);\n }\n return ret/2;\n}\n\nint main(){\n int N;\n while(cin >> N, N){\n Poly pol;\n for(int i = 0; i < N; ++i){\n W x, y;\n cin >> x >> y;\n pol.emplace_back(x,y);\n }\n W ok = 0, ng = pi, S = area(pol);\n L l(P(0,0),P(10,0));\n W s = area(convex_cut(pol,l));\n if(s-(S-s) < EPS){\n ok = -pi;\n ng = 0;\n }\n for(int tmp = 0; tmp < 100; ++tmp){\n W m = (ok+ng)/2;\n l = L(P(0,0),P(10,0)*P(cos(m),sin(m)));\n s = area(convex_cut(pol,l));\n if(s-(S-s) > EPS){\n ok = m;\n }else{\n ng = m;\n }\n }\n W a = (ok+ng)/2;\n P A = P(10*cos(a),10*sin(a));\n s = area(convex_cut(pol,L(P(0,0),A)));\n assert(abs(s-(S-s)) <= 1e-5);\n //fprintf(stderr,\"%.12Lf : %.12Lf\\n\",s,S-s);\n printf(\"%.15Lf %.15Lf\\n\",A.X,A.Y);\n }\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3560,
"score_of_the_acc": -0.5863,
"final_rank": 3
},
{
"submission_id": "aoj_1089_3692551",
"code_snippet": "#include<bits/stdc++.h> //std==c++14\nusing namespace std;\n \n#define EPS (1e-10)\n#define equals(a,b) ( fabs(a-b) < EPS )\n#define PI acos(-1)\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//Intersect Circle and Circle\nstatic const int ICC_SEPARATE = 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\tdouble x,y;\n\t//construct\n\tpoint() {} \n\tpoint(double x,double y):x(x),y(y){}\n\t//演算子\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 k) { return point(x*k,y*k); }\n\tpoint operator / (double k) { return point(x/k,y/k); }\n\tpoint operator / (point p) { return point( (x*p.x + y*p.y)/p.norm() , (-x*p.y + y*p.x)/p.norm() ) ; }\n\tbool operator < (point p) { return x!=p.x ? x<p.x : y<p.y; }\n\tbool operator == (point p) { return equals(x,p.x) && equals(y,p.y) ; }\n\t//function\n\tdouble arg() { return atan2(y,x) ; }\n\tdouble norm(){return x*x+y*y; }\n\tdouble abs() { return sqrt(norm() ) ;}\n\tdouble dot(point p) { return p.x*x + p.y*y; }\n\tdouble cross(point p) { return x*p.y - y*p.x; }\n\tpoint roll(double theta){ return point( cos(theta)*x - sin(theta)*y , sin(theta)*x + cos(theta)*y ) ; }\t\n\t//input output\n\tvoid input(){cin>>x>>y;}\n\tvoid polar(double r,double theta){ x = r*cos(theta), y= r*sin(theta) ; }\n\tvoid print(){cout<<x<<' '<<y<<endl;};\n\n};\n\nbool sort_x(point a,point b){\n\treturn a.x!=b.x?a.x<b.x:a.y<b.y ;\n}\nbool sort_y(point a,point b){\n\treturn a.y!=b.y?a.y<b.y:a.x<b.x ;\n}\n\ntypedef vector<point> polygon;\n\nstruct segment{\n\tpoint s,t;\n\tsegment() {}\n\tsegment(point s,point t) : s(s),t(t){}\n\tvoid input(){s.input(),t.input(); }\n};\ntypedef segment line;\n\nstruct circle{\n\tpoint c;\n\tdouble r;\n\tcircle() {}\n\tcircle(point c,double r) : c(c),r(r){}\n\tvoid input(){c.input(); cin>>r; }\n};\n\ndouble norm(point a){\treturn a.norm(); }\ndouble abs(point a){ return a.abs(); }\ndouble arg(point a){ return a.arg(); }\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 ; }\npoint polar(double r,double theta){ point a; a.polar(r,theta); return a; }\npoint orth(point p){ return point(-p.y,p.x); }\n\n//isOrthgonal 垂直\nbool isOrthogonal(point a,point b) { return equals(dot(a,b), 0.0 ) ; }\nbool isOrthogonal(point a,point b,point c,point d) { return isOrthogonal(a-b,c-d) ; }\nbool isOrthogonal(line l1,line l2 ){ return isOrthogonal(l1.t-l1.s,l2.t-l2.s); }\n//isParallel 平行\nbool isParallel(point a,point b) { return equals(cross(a,b), 0.0) ; }\nbool isParallel(point a,point b,point c,point d) { return isParallel(a-b,c-d); }\nbool isParallel(line l1,line l2) { return isParallel(l1.t-l1.s,l2.t-l2.s) ; }\n\npoint project(line l,point p){\n\tpoint base = l.t-l.s;\n\tdouble r = dot(p-l.s,base) / norm(base) ;\n\treturn l.s + base*r;\n}\npoint reflect(line l,point p){\n\treturn p + (project(l,p) - p) *2.0;\n}\n\nint ccw(point p0,point p1,point p2){\n\tpoint a = p1-p0;\n\tpoint b = p2-p0;\n\tif(cross(a,b) > EPS ) return CCW_COUNTER_CLOCKWISE ;\n\tif(cross(a,b) < -EPS ) return CCW_CLOCKWISE;\n\tif(dot(a,b) < -EPS ) return CCW_ONLINE_BACK;\n\tif(a.norm() < b.norm() ) return CCW_ONLINE_FRONT;\n\treturn CCW_ON_SEGMENT;\n}\n\n\n//intersect\nbool intersect(point p1,point p2,point p3,point p4){return (ccw(p1,p2,p3)*ccw(p1,p2,p4) <= 0 && ccw(p3,p4,p1)*ccw(p3,p4,p2) <= 0 ) ; }\nbool intersect(line l1,line l2) { return intersect(l1.s,l1.t,l2.s,l2.t) ; }\nbool intersect(polygon p,line l){\n\tint n = p.size();\n\tfor(int i=0;i<n;i++) if(intersect(line(p[i],p[(i+1)%n] ) , l ) ) return true;\n\treturn false;\n}\nint intersect(circle c1,circle c2){\n\tif(c1.r < c2.r) swap(c1,c2);\n\tdouble d = abs(c1.c-c2.c);\n\tdouble r = c1.r + c2.r;\n\tif(equals(d,r) ) return ICC_CIRCUMSCRIBE;\n\tif(d > r ) return ICC_SEPARATE;\n\tif(equals(d+c2.r,c1.r) ) return ICC_INSCRIBE;\n\tif( d + c2.r < c1.r ) return ICC_CONTAIN;\n\treturn ICC_INTERSECT;\n}\n\n//bool intersectsc(line l,circle c){ return distancesp(l,c.c) <= c.r ; } distanceののち\nint intersectcs(circle c,line l ){// 0\t\t1\t\t2\n\tif(norm(project(l,c.c) - c.c ) - c.r*c.r > EPS ) return 0;\n\tdouble d1 = abs(c.c-l.s),d2 = abs(c.c-l.t);\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\tpoint h = project(l,c.c) ;\n\tif(dot(l.s-h,l.t-h) < 0 ) return 2;\n\treturn 0;\n}\n\n//distance\n//line point\ndouble distancelp(line l,point p){ return abs(cross(l.t-l.s,p-l.s)/ abs(l.t-l.s) ); }\n//segment point\ndouble distancesp(line l,point p){ \n\tif(dot(l.t-l.s,p-l.s) < 0.0 ) return abs(p-l.s);\n\tif(dot(l.s-l.t,p-l.t) < 0.0 ) return abs(p-l.t);\n\treturn distancelp(l,p);\n}\n//segment segment \ndouble distancess(line l1,line l2){\n\tif(intersect(l1,l2) ) return 0.0;\n\treturn min( min(distancesp(l1,l2.s) ,distancesp(l1,l2.t) ) , min(distancesp(l2,l1.s),distancesp(l2,l1.t) ) );\n}\n\nbool intersectsc(line l,circle c){ return distancesp(l,c.c) <= c.r ; }\n\n//crosspoint \n//segment segment\npoint crosspointss(line l1,line l2){\n\tfor(int k=0;k<2;k++){\n\t\tif(distancesp(l1,l2.s) < EPS ) return l2.s;\n\t\tif(distancesp(l1,l2.t) < EPS ) return l2.t;\n\t\tswap(l1,l2);\n\t}\n\tpoint base = l2.t-l2.s;\n\tdouble d1 = abs(cross(base,l1.s-l2.s) );\n\tdouble d2 = abs(cross(base,l1.t-l2.s) );\n\tdouble t = d1/(d1+d2);\n\treturn l1.s + (l1.t-l1.s) * t;\n}\n//line line\npoint crosspointll(line l1,line l2){\n\tdouble a = cross(l1.t-l1.s,l2.t-l2.s);\n\tdouble b = cross(l1.t-l1.s,l1.t-l2.s);\n\tif(abs(a) < EPS && abs(b) < EPS ) return l2.s;\n\treturn l2.s + (l2.t-l2.s) * (b/a) ;\n}\n//circle line\npolygon crosspointCL(circle c,line l){\n\tpolygon ps;\n\tpoint pr = project(l,c.c);\n\tpoint e = (l.t - l.s) / abs(l.t-l.s) ;\n\tif(equals(distancelp(l,c.c),c.r) ){\n\t\tps.emplace_back(pr);\n\t\treturn ps;\n\t}\n\tdouble base = sqrt(c.r*c.r - norm(pr-c.c) );\n\tps.emplace_back(pr + e*base ) ;\n\tps.emplace_back(pr - e*base ) ;\n\treturn ps;\n}\n//circle segment\npolygon crosspointCS(circle c,line l ){\n\tpolygon res = crosspointCL(c,l);\n\tif(intersectcs(c,l) == 2 ) return res;\n\tif(res.size() > 1u ){//一つのみ削る\n\t\tif(dot(l.s-res[0] ,l.t-res[0] ) > 0) swap(res[0],res[1] );\n\t\tres.pop_back();\n\t}\n\treturn res;\n}\npolygon crosspointcc(circle c1,circle c2){\n\tpolygon p(2);\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\tp[0] = c1.c + polar(c1.r,t+a);\n\tp[1] = c1.c + polar(c1.r,t-a);\n\t//if(cross(c2.c-c1.c,p[0]-c1.c) > EPS) swap(p[0],p[1]); //c1に関する偏角の順\n\treturn p;\n}\n\nint contains(polygon g,point p) { //IN:2 ON:1 OUT:0\n int n = g.size();\n bool f = false;\n for(int i=0;i<n;i++){\n\tpoint a = g[i] - p,b = g[(i+1)%n] - p;\n\tif( fabs(cross(a,b) ) < EPS && dot(a,b) < EPS) return 1;\n\tif( a.y > b.y ) swap(a,b);\n\tif( a.y < EPS && EPS < b.y && cross(a,b) > EPS ) f = !f;\n }\n return (f?2:0) ;\n}\n\npolygon andrewscan(polygon &s){ //convex hull\n\tpolygon u,l;\n\tif(s.size() < 3) return s;\n\t//sort(s.begin(),s.end() );\n\t//最も左で最も右の点にする\n\tsort(s.begin(),s.end(),sort_y);\n\tu.push_back(s[0]);\n\tu.push_back(s[1]);\n\tl.push_back(s[s.size()-1]);\n\tl.push_back(s[s.size()-2]);\n\tfor(int i=2;i<s.size();i++){\n\t\tfor(int n = u.size();n>=2&&ccw(u[n-2],u[n-1],s[i]) != CCW_CLOCKWISE;n--)//凸包の辺上を含めない\n\t\t//for(int n = u.size();n>=2&&ccw(u[n-2],u[n-1],s[i]) == CCW_COUNTER_CLOCKWISE;n--)//凸包の辺上を含める場合\n\t\tu.pop_back();\n\t\tu.push_back(s[i]);\n\t}\n\tfor(int i=s.size()-3;i>=0;i--){\n\t\tfor(int n=l.size();n>=2&&ccw(l[n-2],l[n-1],s[i]) != CCW_CLOCKWISE;n--)//凸包の辺上を含めない\t\n\t\t//for(int n=l.size();n>=2&&ccw(l[n-2],l[n-1],s[i]) == CCW_COUNTER_CLOCKWISE;n--)//凸包の辺上を含める場合\n\t\tl.pop_back();\n\t\tl.push_back(s[i]);\n\t}\n\treverse(l.begin(),l.end());\n\tfor(int i=u.size()-2;i>=1;i--)l.push_back(u[i]);\n\treturn l;\n}\n\ndouble diameter(polygon &s){\n\tpolygon p = s;\n\tint n = p.size();\n\tif(n==2) return abs(p[0]-p[1]);\n\tint i=0,j=0;\n\tfor(int k=0;k<n;k++){\n\t\tif(p[i] < p[k]) i = k;\n\t\tif(!(p[j]<p[k]) ) j = k;\n\t}\n\tdouble res = 0;\n\tint si = i,sj = j;\n\twhile( i != sj || j != si ){\n\t\tres = max(res,abs(p[i]-p[j]) );\n\t\tif(cross(p[(i+1)%n]-p[i],p[(j+1)%n]-p[j] ) < 0.0) i = (i+1)%n;\n\t\telse j = (j+1)%n;\n\t}\n\treturn res;\n}\nbool isconvex(polygon p){\n\tbool f = 1;\n\tint n = p.size();\n\tfor(int i=0;i<n;i++){\n\t\tint t = ccw(p[(i+n-1)%n],p[i],p[(i+1)%n] );\n\t\tf&= t!=CCW_CLOCKWISE;\n\t}\n\treturn f;\n}\ndouble area(polygon p){\n\tdouble res = 0.0;\n\tfor(int i=0;i<p.size();i++) res += cross(p[i],p[ (i+1)%p.size() ]);\n\treturn res/2.0;\n}\ndouble area(circle c1,circle c2){\n\tdouble d = abs(c1.c-c2.c);\n\tif(c1.r + c2.r <= d + EPS ) return 0.0;\n\tif(d<=abs(c1.r-c2.r) ){\n\t\tdouble r = min(c1.r,c2.r);\n\t\treturn PI*r*r;\n\t}\n\tdouble rc = (d*d + c1.r*c1.r -c2.r*c2.r)/(2*d);\n\tdouble th = acos(rc/c1.r);\n\tdouble ph = acos( (d-rc)/c2.r);\n\treturn c1.r*c1.r*th + c2.r*c2.r*ph - d * c1.r * sin(th) ;\n}\n\npolygon convex_cut(polygon p,line l){\n\tpolygon q;\n\tint n = p.size();\n\tfor(int i=0;i<n;i++){\n\t\tpoint a = p[i] , b = p[(i+1)%n];\n\t\tif(ccw(l.s,l.t,a) != -1 ) q.push_back(a);\n\t\tif(ccw(l.s,l.t,a) * ccw(l.s,l.t,b) < 0) q.push_back(crosspointss(line(a,b),l) );\n\t}\n\treturn q;\n}\n//[s,t) 再帰 devide and conquer\ndouble inf = 1e10;\ndouble closest_pair_dac(polygon &p,int s,int t,double &res){\n\tif(t-s<=1)return inf;\n\tif(t-s==2){\n\t\tsort(p.begin()+s,p.begin()+t,sort_y);\n\t\treturn (p[s]-p[s+1]).abs();\n\t}\n\tint mid = (s+t)/2;\n\tdouble x = p[mid].x;\n\tres = min(closest_pair_dac(p,s,mid,res),closest_pair_dac(p,mid,t,res) );\n\tauto it = p.begin();\n\tauto its = it+s,itm = it+mid,itt = it + t;\n\tinplace_merge(its,itm,itt,sort_y);\n\tvector<point> tmp;\n\tfor(int i=s;i<t;i++){\n\t\tif(abs(p[i].x-x) >= res) continue;\n\t\tfor(int j=tmp.size()-1;j>=0;j--){\n\t\t\tpoint d = p[i]-tmp[j];\n\t\t\tif(d.y >= res) break;\n\t\t\tres = min( res , d.abs() );\n\t\t}\n\t\ttmp.push_back(p[i]);\n\t}\n\treturn res;\n}\ndouble closest_pair(polygon &p){\n\tdouble res = inf;\n\tsort(p.begin(),p.end());\n\treturn closest_pair_dac(p,0,p.size(),res);\n}\n\npolygon tangent(circle c,point p){//点から円への接戦\n\tcircle c2 = circle(p,sqrt(norm(c.c-p)-c.r*c.r ) );\n\tpolygon res = crosspointcc(c,c2);\n\tsort(res.begin(),res.end() );\n\treturn res;\n}\nvector<line> tangent(circle c1,circle c2){//円の共通接戦\n vector<line> res;\n if(c1.r < c2.r ) swap(c1,c2);\n point g = c2.c-c1.c;\n if( equals( g.norm() ,0.0 ) ) return res;\n point u = g/g.abs();\n point v = orth(u);\n for(int s=1;s>=-1;s-=2){\n\tdouble h = (c1.r + s*c2.r)/g.abs();\n\tif( equals(1-h*h,0.0) ){\n\t\tres.emplace_back( line(c1.c+u*c1.r,c1.c+(u+v)*c1.r) );\n\t}else if(1-h*h>0) {\n\t\tpoint uu = u*h,vv = v*sqrt(1-h*h) ;\n\t\tres.emplace_back( line(c1.c+(uu+vv)*c1.r,c2.c-(uu+vv)*c2.r*s) );\n\t\tres.emplace_back( line(c1.c+(uu-vv)*c1.r,c2.c-(uu-vv)*c2.r*s) );\n\t}\n }\n\treturn res;\n}\npolygon tangent_point(circle c1,circle c2){//円の共通接戦における接点集合\n vector<line> ls = tangent(c1,c2);\n polygon res ;\n for(auto l:ls){\n\tpolygon tmp = crosspointCL(c1,l);\n\tif(tmp.size()!=0)res.emplace_back(tmp[0]);\n }\n sort(res.begin(),res.end());\n return res;\n}\n\ndouble calcu(circle c,point a,point b){\n\tpoint va = c.c-a,vb = c.c - b;\n\tdouble f = cross(va,vb);\n\tdouble res = 0.0;\n\tif(equals(f,0.0) )return res;\n\tif(max(abs(va),abs(vb) ) < c.r + EPS) return f;\n\tpoint d( dot(va,vb),cross(va,vb) );\n\tif( distancesp(line(a,b),c.c) > c.r -EPS ) return c.r*c.r*atan2(d.y,d.x);\n\tauto u = crosspointCS(c,line(a,b) );\n\tif(u.empty() ) return res;\n\tif(u.size() > 1u && dot(u[1]-u[0],a-u[0] ) > 0 ) swap(u[0],u[1]);\n\tu.emplace(u.begin(),a);\n\tu.emplace_back(b);\n\tfor(int i=1;i<u.size();i++)res+=calcu(c,u[i-1],u[i]);\n\treturn res;\n}\ndouble area(polygon ps,circle c){\n\tif(ps.size() < 3u) return 0.0;\n\tdouble res = 0.0;\n\tfor(int i=0;i<ps.size();i++) res += calcu(c,ps[i],ps[(i+1)%ps.size()] );\n\treturn res/2;\n}\n\npoint solve(polygon &ps){\n\tpoint s = point(0.0,0.0);\n\tint n = ps.size();\n\tdouble S = area(ps);\n\tfor(int i=0;i<n;i++){\n\t\tline l1 = line(s,ps[i]);\n\t\tline l2 = line(s,ps[(i+1)%n]);\n\t\tpolygon s1 =convex_cut(ps,l1);\n\t\tpolygon s2 =convex_cut(ps,l2);\n\t\tdouble S1 = area(s1);\n\t\tdouble S2 = area(s2);\n\t\tif( equals(S1,S/2) ) return ps[i];\n\t\tif( equals(S2,S/2) ) return ps[(i+1)%n];\n\t\tif( S1 < S/2 +EPS && S2 > S/2 + EPS ){\n\t\t\tpoint u = ps[i],d = ps[(i+1)%n];\n\t\t\twhile( abs(S1-S2) > EPS ){\n\t\t\t \tl1 = line(s,u);\n\t\t\t\tl2 = line(s,d);\n\t\t\t\ts1 = convex_cut(ps,l1);\n\t\t\t\ts2 = convex_cut(ps,l2);\n\t\t\t\tS1 = area(s1);\n\t\t\t\tS2 = area(s2);\n\t\t\t\tline l = line(s, (u+d)/2 );\n\t\t\t\tpolygon ss = convex_cut(ps,l);\n\t\t\t\tif( area(ss) > S/2){\n\t\t\t\t\td = (u+d)/2;\n\t\t\t\t}else{\n\t\t\t\t\tu = (u+d)/2;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//ps[i].print();\n\t\t\t//ps[(i+1)%n].print();\n\t\t\treturn (u+d)/2;\n\t\t}\n\n\t}\n\treturn s;\n\n}\n\n\ntypedef pair<double,double> mp;\nint main(){\n \twhile(1){\n\t\tint n;\n\t\tcin>>n;\n\t\tif(n==0)break;\n\t\tpolygon ps(n);\n\t\tfor(int i=0;i<n;i++)ps[i].input();\n\t\tpoint res = solve(ps);\n\t\tprintf(\"%0.10lf %0.10lf\\n\",res.x,res.y);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3228,
"score_of_the_acc": -0.0619,
"final_rank": 1
},
{
"submission_id": "aoj_1089_3685337",
"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;\nusing Real = double;\nusing Point = complex<Real>;\nconst Real EPS = 1e-8, PI = acos(-1);\n\n// 実数同士の比較\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; }\n\nPoint operator*(const Point &p, const Real &d) {\n return Point(real(p) * d, imag(p) * d);\n}\n\n// 入力\nistream &operator>>(istream &is, Point &p) {\n Real a, b;\n is >> a >> b;\n p = Point(a, b);\n return is;\n}\n\n// 出力\nostream &operator<<(ostream &os, Point &p) {\n os << fixed << setprecision(10) << p.real() << \" \" << p.imag();\n}\n\n// 原点を中心として, 点 p を θ 回転すた点を返す\nPoint rotate(Real theta, const Point &p) {\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\n// ラジアンを度数に変換\nReal radian_to_degree(Real r) {\n return (r * 180.0 / PI);\n}\n\n// 度数をラジアンに変換\nReal degree_to_radian(Real d) {\n return (d * PI / 180.0);\n}\n\n// ∠BAC をラジアンで取得\nReal get_angle(const Point &a, const Point &b, const Point &c) {\n const Point v(b - a), w(c - a);\n Real alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\n if(alpha > beta) swap(alpha, beta);\n Real theta = (beta - alpha);\n return min(theta, 2 * acos(-1) - theta);\n}\n\n// x軸, y軸の順にソート\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\n// 直線\n// 2 点を通る直線\n// Ax + By = C \nstruct Line {\n Point a, b;\n\n Line() = default;\n\n Line(Point a, Point b) : a(a), b(b) {}\n\n Line(Real A, Real B, Real C) // Ax + By = C\n {\n if(eq(A, 0)) a = Point(0, C / B), b = Point(1, C / B);\n else if(eq(B, 0)) b = Point(C / A, 0), b = Point(C / A, 1);\n else a = Point(0, C / B), b = Point(C / A, 0);\n }\n\n friend ostream &operator<<(ostream &os, Line &p) {\n return os << p.a << \" to \" << p.b;\n }\n\n friend istream &operator>>(istream &is, Line &a) {\n return is >> a.a >> a.b;\n }\n};\n\n// 線分\n// 2 点を結ぶ\nstruct Segment : Line {\n Segment() = default;\n Segment(Point a, Point b) : Line(a, b) {}\n};\n\n\n// 円\n// 中心と半径\nstruct Circle {\n Point p;\n Real r;\n\n Circle() = default;\n\n Circle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = vector< Point >;\nusing Polygon = vector< Point >; // 注意!! 凸多角形は反時計回りに与える.(保証されない場合は面積が負なら reverse をかける)\nusing Segments = vector< Segment >;\nusing Lines = vector< Line >;\nusing Circles = vector< Circle >;\n\n// 外積\nReal cross(const Point &a, const Point &b) {\n return real(a) * imag(b) - imag(a) * real(b);\n}\n\n// 内積\nReal dot(const Point &a, const Point &b) {\n return real(a) * real(b) + imag(a) * imag(b);\n}\n\n\n// +1\n// \n// +2 a 0 b -2\n//\n// -1\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C&lang=jp\nint ccw(const Point &a, Point b, Point c) {\n b = b - a, c = c - a;\n if(cross(b, c) > EPS) return +1; // \"COUNTER_CLOCKWISE\"\n if(cross(b, c) < -EPS) return -1; // \"CLOCKWISE\"\n if(dot(b, c) < 0) return +2; // \"ONLINE_BACK\"\n if(norm(b) < norm(c)) return -2; // \"ONLINE_FRONT\"\n return 0; // \"ON_SEGMENT\"\n}\n\n\n// 2 直線が平行か\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool parallel(const Line &a, const Line &b) {\n return eq(cross(a.b - a.a, b.b - b.a), 0.0);\n}\n\n// 2 直線が垂直か\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool orthogonal(const Line &a, const Line &b) {\n return eq(dot(a.a - a.b, b.a - b.b), 0.0);\n}\n\n// 直線 l に 点 p から垂線を下ろして,交わる点を返す\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint projection(const Line &l, const Point &p) {\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n\n// 同じ\n// 直線として扱われそう\nPoint projection(const Segment &l, const Point &p) {\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n\n// 直線 l に対して, 点 p と線対称な位置にある点を返す.\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflection(const Line &l, const Point &p) {\n return p + (projection(l, p) - p) * 2.0;\n}\n\n// 直線上に点が乗るかどうか\nbool intersect(const Line &l, const Point &p) {\n return abs(ccw(l.a, l.b, p)) != 1;\n}\n\n// 直線 l と直線 m の交差判定\nbool intersect(const Line &l, const Line &m) {\n return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS;\n}\n\n// 線分上に点があるかどうか\nbool intersect(const Segment &s, const Point &p) {\n return ccw(s.a, s.b, p) == 0;\n}\n\n// 直線 l と 線分 s の交差判定\nbool intersect(const Line &l, const Segment &s) {\n return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\n}\n\n// 点 p と 直線 l との距離\nReal distance(const Line &l, const Point &p);\n\n// 円 c と直線 l との交差判定\nbool intersect(const Circle &c, const Line &l) {\n return distance(l, c.p) <= c.r + EPS;\n}\n\n// 点 p が 円 c 上にあるかどうか\nbool intersect(const Circle &c, const Point &p) {\n return abs(abs(p - c.p) - c.r) < EPS;\n}\n\n\n// 線分同士の交差判定\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\nbool intersect(const Segment &s, const Segment &t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// 円 c と 線分 l との交差判定\nint intersect(const Circle &c, const Segment &l) {\n if(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\n auto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n if(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\n if(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\n const Point h = projection(l, c.p);\n if(dot(l.a - h, l.b - h) < 0) return 2;\n return 0;\n}\n\n// 円同士の交差判定\n// 4 := 離れている\n// 3 := 外接する\n// 2 := 交わる\n// 1 := 内接する\n// 0 := 内包する\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(Circle c1, Circle c2) {\n if(c1.r < c2.r) swap(c1, c2);\n Real d = abs(c1.p - c2.p);\n if(c1.r + c2.r < d) return 4;\n if(eq(c1.r + c2.r, d)) return 3;\n if(c1.r - c2.r < d) return 2;\n if(eq(c1.r - c2.r, d)) return 1;\n return 0;\n}\n\n// 点と点の距離\nReal distance(const Point &a, const Point &b) {\n return abs(a - b);\n}\n\n// 直線と点の距離\nReal distance(const Line &l, const Point &p) {\n return abs(p - projection(l, p));\n}\n\n// 直線と直線の距離 (もちろん交わってたら 0)\nReal distance(const Line &l, const Line &m) {\n return intersect(l, m) ? 0 : distance(l, m.a);\n}\n\n// 線分と点の距離\nReal distance(const Segment &s, const Point &p) {\n Point r = projection(s, p);\n if(intersect(s, r)) return abs(r - p);\n return min(abs(s.a - p), abs(s.b - p));\n}\n\n// 線分同士の距離\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\nReal distance(const Segment &a, const Segment &b) {\n if(intersect(a, b)) return 0;\n return min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\n}\n\n// 直線と線分の距離\nReal distance(const Line &l, const Segment &s) {\n if(intersect(l, s)) return 0;\n return min(distance(l, s.a), distance(l, s.b));\n}\n\n// 直線同士の交点を返す (交差することが要請されるのかな (事前にintersect を呼べばいい))\nPoint crosspoint(const Line &l, const Line &m) {\n Real A = cross(l.b - l.a, m.b - m.a);\n Real B = cross(l.b - l.a, l.b - m.a);\n if(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n return m.a + (m.b - m.a) * B / A;\n}\n\n// 線分同士の交点を返す (交差することが要請されるのかな (事前にintersect を呼べばいい))\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\nPoint crosspoint(const Segment &l, const Segment &m) {\n return crosspoint(Line(l), Line(m));\n}\n\n\n// 円と直線の交点を返す (交差することが要請されるのかな (事前にintersect を呼べばいい))\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\npair< Point, Point > crosspoint(const Circle &c, const Line l) {\n Point pr = projection(l, c.p);\n Point e = (l.b - l.a) / abs(l.b - l.a);\n if(eq(distance(l, c.p), c.r)) return {pr, pr};\n double base = sqrt(c.r * c.r - norm(pr - c.p));\n return {pr - e * base, pr + e * base};\n}\n\n\n// 円と線分の交点を返す (交差することが要請されるのかな (事前にintersect を呼べばいい))\npair< Point, Point > crosspoint(const Circle &c, const Segment &l) {\n Line aa = Line(l.a, l.b);\n if(intersect(c, l) == 2) return crosspoint(c, aa);\n auto ret = crosspoint(c, aa);\n if(dot(l.a - ret.first, l.b - ret.first) < 0) ret.second = ret.first;\n else ret.first = ret.second;\n return ret;\n}\n\n// 円同士の交点を返す (交差することが要請されるのかな (事前にintersect を呼べばいい))\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\npair< Point, Point > crosspoint(const Circle &c1, const Circle &c2) {\n Real d = abs(c1.p - c2.p);\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n Real t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n return {p1, p2};\n}\n\n// 点 p から円 C へ接戦を引いた時の、接点を返す\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\npair< Point, Point > tangent(const Circle &c1, const Point &p2) {\n return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r)));\n}\n\n// 円と円の共通接線を複数返す\n// 0 ~ 4 つの可能性がある\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\nLines tangent(Circle c1, Circle c2) {\n Lines ret;\n if(c1.r < c2.r) swap(c1, c2);\n Real g = norm(c1.p - c2.p);\n if(eq(g, 0)) return ret;\n Point u = (c2.p - c1.p) / sqrt(g);\n Point v = rotate(PI * 0.5, u);\n for(int s : {-1, 1}) {\n Real h = (c1.r + s * c2.r) / sqrt(g);\n if(eq(1 - h * h, 0)) {\n ret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n } else if(1 - h * h > 0) {\n Point uu = u * h, vv = v * sqrt(1 - h * h);\n ret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n ret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n }\n }\n return ret;\n}\n\n// 多角形が凸かどうかを判定\n// 与えられる多角形は反時計回りなことが要請される\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\nbool is_convex(const Polygon &p) {\n int n = (int) p.size();\n for(int i = 0; i < n; i++) {\n if(ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\n }\n return true;\n}\n\n// 凸包に含まれる点上および辺上の頂点からなる多角形を返す.\n// 多角形の開始位置は特に指定がない.\n// 反時計回りに返されることは保証されていそう\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\nPolygon convex_hull(Polygon &p) {\n int n = (int) p.size(), k = 0;\n if(n <= 2) return p;\n sort(p.begin(), p.end());\n vector< Point > ch(2 * n);\n for(int i = 0; i < n; ch[k++] = p[i++]) {\n while(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\n }\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) {\n while(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\n }\n ch.resize(k - 1);\n return ch;\n}\n\n// 多角形 Q と点 p との関係を返す\n// 0 := OUT\n// 1 := ON\n// 2 := IN\n// 多角形は反時計回りに渡す\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\nenum {\n OUT, ON, IN\n};\nint contains(const Polygon &Q, const Point &p) {\n bool in = false;\n for(int i = 0; i < Q.size(); i++) {\n Point a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\n if(a.imag() > b.imag()) swap(a, b);\n if(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\n if(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\n }\n return in ? IN : OUT;\n}\n\n// TODO よくわからん\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\nvoid merge_segments(vector< Segment > &segs) {\n\n auto merge_if_able = [](Segment &s1, const Segment &s2) {\n if(abs(cross(s1.b - s1.a, s2.b - s2.a)) > EPS) return false;\n if(ccw(s1.a, s2.a, s1.b) == 1 || ccw(s1.a, s2.a, s1.b) == -1) return false;\n if(ccw(s1.a, s1.b, s2.a) == -2 || ccw(s2.a, s2.b, s1.a) == -2) return false;\n s1 = Segment(min(s1.a, s2.a), max(s1.b, s2.b));\n return true;\n };\n\n for(int i = 0; i < segs.size(); i++) {\n if(segs[i].b < segs[i].a) swap(segs[i].a, segs[i].b);\n }\n for(int i = 0; i < segs.size(); i++) {\n for(int j = i + 1; j < segs.size(); j++) {\n if(merge_if_able(segs[i], segs[j])) {\n segs[j--] = segs.back(), segs.pop_back();\n }\n }\n }\n}\n\n// TODO よくわからん\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\nvector< vector< int > > segment_arrangement(vector< Segment > &segs, vector< Point > &ps) {\n vector< vector< int > > g;\n int N = (int) segs.size();\n for(int i = 0; i < N; i++) {\n ps.emplace_back(segs[i].a);\n ps.emplace_back(segs[i].b);\n for(int j = i + 1; j < N; j++) {\n const Point p1 = segs[i].b - segs[i].a;\n const Point p2 = segs[j].b - segs[j].a;\n if(cross(p1, p2) == 0) continue;\n if(intersect(segs[i], segs[j])) {\n ps.emplace_back(crosspoint(segs[i], segs[j]));\n }\n }\n }\n sort(begin(ps), end(ps));\n ps.erase(unique(begin(ps), end(ps)), end(ps));\n\n int M = (int) ps.size();\n g.resize(M);\n for(int i = 0; i < N; i++) {\n vector< int > vec;\n for(int j = 0; j < M; j++) {\n if(intersect(segs[i], ps[j])) {\n vec.emplace_back(j);\n }\n }\n for(int j = 1; j < vec.size(); j++) {\n g[vec[j - 1]].push_back(vec[j]);\n g[vec[j]].push_back(vec[j - 1]);\n }\n }\n return (g);\n}\n\n\n// 直線の進行方向の右側を残す\n// Polygon は反時計回りに与える\n// Line には一応向きがあるわけで\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\nPolygon convex_cut(const Polygon &U, Line l) {\n Polygon ret;\n for(int i = 0; i < U.size(); i++) {\n Point now = U[i], nxt = U[(i + 1) % U.size()];\n if(ccw(l.a, l.b, now) != -1) ret.push_back(now);\n if(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\n ret.push_back(crosspoint(Line(now, nxt), l));\n }\n }\n return (ret);\n}\n\n\n// 多角形の面積\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\nReal area2(const Polygon &p) {\n Real A = 0;\n for(int i = 0; i < p.size(); ++i) {\n A += cross(p[i], p[(i + 1) % p.size()]);\n }\n return A;\n}\n\n// 多角形と円の共通部分の面積\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\nReal area2(const Polygon &p, const Circle &c) {\n if(p.size() < 3) return 0.0;\n function< Real(Circle, Point, Point) > cross_area = [&](const Circle &c, const Point &a, const Point &b) {\n Point va = c.p - a, vb = c.p - b;\n Real f = cross(va, vb), ret = 0.0;\n if(eq(f, 0.0)) return ret;\n if(max(abs(va), abs(vb)) < c.r + EPS) return f;\n if(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\n auto u = crosspoint(c, Segment(a, b));\n vector< Point > tot{a, u.first, u.second, b};\n for(int i = 0; i + 1 < tot.size(); i++) {\n ret += cross_area(c, tot[i], tot[i + 1]);\n }\n return ret;\n };\n Real A = 0;\n for(int i = 0; i < p.size(); i++) {\n A += cross_area(c, p[i], p[(i + 1) % p.size()]);\n }\n return A;\n}\n\n// 凸多角形 g の直径を求めよ。ただし、凸多角形の直径とはその最遠頂点対間距離のことである.\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\nReal convex_diameter(const Polygon &p) {\n int N = (int) p.size();\n int is = 0, js = 0;\n for(int i = 1; i < N; i++) {\n if(p[i].imag() > p[is].imag()) is = i;\n if(p[i].imag() < p[js].imag()) js = i;\n }\n Real maxdis = norm(p[is] - p[js]);\n\n int maxi, maxj, i, j;\n i = maxi = is;\n j = maxj = js;\n do {\n if(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\n j = (j + 1) % N;\n } else {\n i = (i + 1) % N;\n }\n if(norm(p[i] - p[j]) > maxdis) {\n maxdis = norm(p[i] - p[j]);\n maxi = i;\n maxj = j;\n }\n } while(i != is || j != js);\n return sqrt(maxdis);\n}\n\n\n// 平面上の n 個の点について、最も近い２点の距離.\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\nReal closest_pair(Points ps) {\n if(ps.size() <= 1) throw (0);\n sort(begin(ps), end(ps));\n\n auto compare_y = [&](const Point &a, const Point &b) {\n return imag(a) < imag(b);\n };\n vector< Point > beet(ps.size());\n const Real INF = 1e18;\n\n function< Real(int, int) > rec = [&](int left, int right) {\n if(right - left <= 1) return INF;\n int mid = (left + right) >> 1;\n auto x = real(ps[mid]);\n auto ret = min(rec(left, mid), rec(mid, right));\n inplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\n int ptr = 0;\n for(int i = left; i < right; i++) {\n if(abs(real(ps[i]) - x) >= ret) continue;\n for(int j = 0; j < ptr; j++) {\n auto luz = ps[i] - beet[ptr - j - 1];\n if(imag(luz) >= ret) break;\n ret = min(ret, abs(luz));\n }\n beet[ptr++] = ps[i];\n }\n return ret;\n };\n return rec(0, (int) ps.size());\n}\n\nsigned main(){\n\n while(1){\n int n; cin >> n;\n if(n==0) break;\n \n Polygon p(n);\n for(int i = 0; i < n; i++){\n cin >> p[i];\n }\n\n double half = area2(p) / 2.0;\n \n double lb = 0;\n double ub = PI;\n if(half > area2(convex_cut(p, Line(Point(0,0), Point(100,0))))){\n lb = PI;\n ub = 2 * PI;\n }\n for(int i = 0; i < 100; i++){\n double mid = (lb +ub) / 2;\n Line cut(Point(0, 0), rotate(mid, Point(100, 0)));\n if(half > area2(convex_cut(p, cut))){\n ub = mid;\n }else{\n lb = mid;\n }\n }\n\n Point ans = rotate(lb, Point(100, 0));\n \n cout << fixed << setprecision(15);\n cout << ans.real() << \" \" << ans.imag() << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3692,
"score_of_the_acc": -0.7559,
"final_rank": 8
},
{
"submission_id": "aoj_1089_3680189",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <utility>\n#include <complex>\n#include <cassert>\nusing namespace std;\nusing W = long double;\nusing P = complex<W>;\nusing Poly = vector<P>;\nusing L = pair<P,P>;\n#define X real()\n#define Y imag()\nconstexpr W EPS = 1e-10, pi = acos(-1);\n\nvoid debug(Poly p){\n cerr << \"Polygon\" << endl;\n for(auto e : p) cerr << e.X << \" \" << e.Y << endl;\n cerr << \"...\" << endl;\n}\n\nvoid debug(L l){\n fprintf(stderr,\"Segment %Lf %Lf %Lf %Lf\\n\",l.first.X,l.first.Y,l.second.X,l.second.Y);\n}\n\nW dot(const P &a, const P &b){ return a.X*b.X + a.Y*b.Y; }\nW cross(const P &a, const P &b){ return a.X*b.Y - a.Y*b.X; }\n\nP intersection(const L &a, const L &b){\n P af = a.first, as = a.second, bf = b.first, bs = b.second;\n return af + cross(bs-bf,af-bf)/(-cross(bs-bf,as-bf)+cross(bs-bf,af-bf))*(as-af);\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(norm(b) + EPS < norm(c)) return -2;\n return 0;\n}\n\nPoly convex_cut(const Poly &p, const L &l){\n Poly ret;\n int n = p.size();\n for(int i = 0; i < n; ++i){\n P cur = p[i], nex = p[(i+1)%n], lf = l.first, ls = l.second;\n if(ccw(lf,ls,cur) != -1)\n ret.push_back(cur);\n if((ccw(lf,ls,cur) != -1) ^ (ccw(lf,ls,nex) != -1))\n ret.push_back(intersection(L(cur,nex),l));\n }\n return ret;\n}\n\nW area(const Poly &p){\n int n = p.size();\n W ret = 0;\n for(int i = 0; i < n; ++i){\n ret += cross(p[i],p[(i+1)%n]);\n }\n return ret/2;\n}\n\nint main(){\n int N;\n while(cin >> N, N){\n Poly pol;\n for(int i = 0; i < N; ++i){\n W x, y;\n cin >> x >> y;\n pol.emplace_back(x,y);\n }\n W ok = 0, ng = pi, S = area(pol);\n for(int i = 1; i < N; ++i){\n L l1(P(0,0),pol[i]);\n L l2(P(0,0),pol[i-1]);\n W s1 = area(convex_cut(pol,l1));\n W s2 = area(convex_cut(pol,l2));\n W d1 = (s1 - (S-s1));\n W d2 = (s2 - (S-s2));\n if(d1 <= 0 and d2 >= 0){\n ng = arg(pol[i]);\n ok = arg(pol[i-1]);\n if(ng < ok) ng += 2*pi;\n ng += EPS;\n ok -= EPS;\n break;\n }\n }\n assert(abs(ok) > EPS or abs(ng-pi) > EPS);\n for(int tmp = 0; tmp < 10000; ++tmp){\n W m = (ok+ng)/2;\n L l(P(0,0),P(10,0)*P(cos(m),sin(m)));\n W s = area(convex_cut(pol,l));\n if(s > S-s){\n ok = m;\n }else{\n ng = m;\n }\n }\n W a = (ok+ng)/2;\n P A = P(10*cos(a),10*sin(a));\n W s = area(convex_cut(pol,L(P(0,0),A)));\n //assert(abs(s-(S-s)) <= 1e-5);\n //fprintf(stderr,\"%.12Lf : %.12Lf\\n\",s,S-s);\n printf(\"%.15Lf %.15Lf\\n\",A.X,A.Y);\n }\n}",
"accuracy": 0.125,
"time_ms": 10,
"memory_kb": 3376,
"score_of_the_acc": -0.2298,
"final_rank": 20
},
{
"submission_id": "aoj_1089_3680172",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <utility>\n#include <complex>\n#include <cassert>\nusing namespace std;\nusing W = long double;\nusing P = complex<W>;\nusing Poly = vector<P>;\nusing L = pair<P,P>;\n#define X real()\n#define Y imag()\nconstexpr W EPS = 1e-10, pi = acos(-1);\n\nvoid debug(Poly p){\n cerr << \"Polygon\" << endl;\n for(auto e : p) cerr << e.X << \" \" << e.Y << endl;\n cerr << \"...\" << endl;\n}\n\nvoid debug(L l){\n fprintf(stderr,\"Segment %Lf %Lf %Lf %Lf\\n\",l.first.X,l.first.Y,l.second.X,l.second.Y);\n}\n\nW dot(const P &a, const P &b){ return a.X*b.X + a.Y*b.Y; }\nW cross(const P &a, const P &b){ return a.X*b.Y - a.Y*b.X; }\n\nP intersection(const L &a, const L &b){\n P af = a.first, as = a.second, bf = b.first, bs = b.second;\n return af + cross(bs-bf,af-bf)/(-cross(bs-bf,as-bf)+cross(bs-bf,af-bf))*(as-af);\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(norm(b) + EPS < norm(c)) return -2;\n return 0;\n}\n\nPoly convex_cut(const Poly &p, const L &l){\n Poly ret;\n int n = p.size();\n for(int i = 0; i < n; ++i){\n P cur = p[i], nex = p[(i+1)%n], lf = l.first, ls = l.second;\n if(ccw(lf,ls,cur) != -1)\n ret.push_back(cur);\n if((ccw(lf,ls,cur) != -1) ^ (ccw(lf,ls,nex) != -1))\n ret.push_back(intersection(L(cur,nex),l));\n }\n return ret;\n}\n\nW area(const Poly &p){\n int n = p.size();\n W ret = 0;\n for(int i = 0; i < n; ++i){\n ret += cross(p[i],p[(i+1)%n]);\n }\n return ret/2;\n}\n\nint main(){\n int N;\n while(cin >> N, N){\n Poly pol;\n for(int i = 0; i < N; ++i){\n W x, y;\n cin >> x >> y;\n pol.emplace_back(x,y);\n }\n W ok = 0, ng = pi, S = area(pol);\n for(int i = 1; i < N; ++i){\n L l1(P(0,0),pol[i]);\n L l2(P(0,0),pol[i-1]);\n W s1 = area(convex_cut(pol,l1));\n W s2 = area(convex_cut(pol,l2));\n W d1 = (s1 - (S-s1));\n W d2 = (s2 - (S-s2));\n if(d1 <= 0 and d2 >= 0){\n ng = arg(pol[i]);\n ok = arg(pol[i-1]);\n if(ng < ok) ng += 2*pi;\n break;\n }\n }\n for(int tmp = 0; tmp < 10000; ++tmp){\n W m = (ok+ng)/2;\n L l(P(0,0),P(10,0)*P(cos(m),sin(m)));\n W s = area(convex_cut(pol,l));\n if(s >= S-s){\n ok = m;\n }else{\n ng = m;\n }\n }\n W a = (ok+ng)/2;\n P A = P(10*cos(a),10*sin(a));\n W s = area(convex_cut(pol,L(P(0,0),A)));\n assert(abs(s-(S-s)) <= 1e-5);\n //fprintf(stderr,\"%.12Lf : %.12Lf\\n\",s,S-s);\n printf(\"%.15Lf %.15Lf\\n\",A.X,A.Y);\n }\n}",
"accuracy": 0.25,
"time_ms": 10,
"memory_kb": 3512,
"score_of_the_acc": -0.441,
"final_rank": 12
},
{
"submission_id": "aoj_1089_3680161",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <utility>\n#include <complex>\n#include <cassert>\nusing namespace std;\nusing W = long double;\nusing P = complex<W>;\nusing Poly = vector<P>;\nusing L = pair<P,P>;\n#define X real()\n#define Y imag()\nconstexpr W EPS = 1e-10, pi = acos(-1);\n\nvoid debug(Poly p){\n cerr << \"Polygon\" << endl;\n for(auto e : p) cerr << e.X << \" \" << e.Y << endl;\n cerr << \"...\" << endl;\n}\n\nvoid debug(L l){\n fprintf(stderr,\"Segment %Lf %Lf %Lf %Lf\\n\",l.first.X,l.first.Y,l.second.X,l.second.Y);\n}\n\nW dot(const P &a, const P &b){ return a.X*b.X + a.Y*b.Y; }\nW cross(const P &a, const P &b){ return a.X*b.Y - a.Y*b.X; }\n\nP intersection(const L &a, const L &b){\n P af = a.first, as = a.second, bf = b.first, bs = b.second;\n return af + cross(bs-bf,af-bf)/(-cross(bs-bf,as-bf)+cross(bs-bf,af-bf))*(as-af);\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(norm(b) + EPS < norm(c)) return -2;\n return 0;\n}\n\nPoly convex_cut(const Poly &p, const L &l){\n Poly ret;\n int n = p.size();\n for(int i = 0; i < n; ++i){\n P cur = p[i], nex = p[(i+1)%n], lf = l.first, ls = l.second;\n if(ccw(lf,ls,cur) != -1)\n ret.push_back(cur);\n if((ccw(lf,ls,cur) != -1) ^ (ccw(lf,ls,nex) != -1))\n ret.push_back(intersection(L(cur,nex),l));\n }\n return ret;\n}\n\nW area(const Poly &p){\n int n = p.size();\n W ret = 0;\n for(int i = 0; i < n; ++i){\n ret += cross(p[i],p[(i+1)%n]);\n }\n return ret/2;\n}\n\nint main(){\n int N;\n while(cin >> N, N){\n Poly pol;\n for(int i = 0; i < N; ++i){\n W x, y;\n cin >> x >> y;\n pol.emplace_back(x,y);\n }\n W ok = 0, ng = pi, S = area(pol);\n for(int i = 1; i < N; ++i){\n L l1(P(0,0),pol[i]);\n L l2(P(0,0),pol[i-1]);\n W s1 = area(convex_cut(pol,l1));\n W s2 = area(convex_cut(pol,l2));\n W d1 = (s1 - (S-s1));\n W d2 = (s2 - (S-s2));\n if(d1 <= 0 and d1*d2 < EPS){\n ng = arg(pol[i]);\n ok = arg(pol[i-1]);\n if(ng < ok) ng += 2*pi;\n break;\n }\n }\n for(int tmp = 0; tmp < 10000; ++tmp){\n W m = (ok+ng)/2;\n L l(P(0,0),P(10,0)*P(cos(m),sin(m)));\n W s = area(convex_cut(pol,l));\n if(s >= S-s){\n ok = m;\n }else{\n ng = m;\n }\n }\n W a = (ok+ng)/2;\n P A = P(10,0)*P(cos(a),sin(a));\n W s = area(convex_cut(pol,L(P(0,0),A)));\n assert(abs(s-(S-s)) < 1e-5);\n //fprintf(stderr,\"%.12Lf : %.12Lf\\n\",s,S-s);\n printf(\"%.15Lf %.15Lf\\n\",A.X,A.Y);\n }\n}",
"accuracy": 0.25,
"time_ms": 10,
"memory_kb": 3556,
"score_of_the_acc": -0.5093,
"final_rank": 13
},
{
"submission_id": "aoj_1089_3680143",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <utility>\n#include <complex>\n#include <cassert>\nusing namespace std;\nusing W = long double;\nusing P = complex<W>;\nusing Poly = vector<P>;\nusing L = pair<P,P>;\n#define X real()\n#define Y imag()\nconstexpr W EPS = 1e-10, pi = acos(-1);\n\nvoid debug(Poly p){\n cerr << \"Polygon\" << endl;\n for(auto e : p) cerr << e.X << \" \" << e.Y << endl;\n cerr << \"...\" << endl;\n}\n\nvoid debug(L l){\n fprintf(stderr,\"Segment %Lf %Lf %Lf %Lf\\n\",l.first.X,l.first.Y,l.second.X,l.second.Y);\n}\n\nW dot(const P &a, const P &b){ return a.X*b.X + a.Y*b.Y; }\nW cross(const P &a, const P &b){ return a.X*b.Y - a.Y*b.X; }\n\nP intersection(const L &a, const L &b){\n P af = a.first, as = a.second, bf = b.first, bs = b.second;\n return af + cross(bs-bf,af-bf)/(-cross(bs-bf,as-bf)+cross(bs-bf,af-bf))*(as-af);\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(norm(b) + EPS < norm(c)) return -2;\n return 0;\n}\n\nPoly convex_cut(const Poly &p, const L &l){\n Poly ret;\n int n = p.size();\n for(int i = 0; i < n; ++i){\n P cur = p[i], nex = p[(i+1)%n], lf = l.first, ls = l.second;\n if(ccw(lf,ls,cur) != -1)\n ret.push_back(cur);\n if((ccw(lf,ls,cur) != -1) ^ (ccw(lf,ls,nex) != -1))\n ret.push_back(intersection(L(cur,nex),l));\n }\n return ret;\n}\n\nW area(const Poly &p){\n int n = p.size();\n W ret = 0;\n for(int i = 0; i < n; ++i){\n ret += cross(p[i],p[(i+1)%n]);\n }\n return ret/2;\n}\n\nint main(){\n int N;\n while(cin >> N, N){\n Poly pol;\n for(int i = 0; i < N; ++i){\n W x, y;\n cin >> x >> y;\n pol.emplace_back(x,y);\n }\n W ok = 0, ng = pi, S = area(pol);\n for(int i = 1; i < N; ++i){\n L l1(P(0,0),pol[i]);\n L l2(P(0,0),pol[i-1]);\n W s1 = area(convex_cut(pol,l1));\n W s2 = area(convex_cut(pol,l2));\n W d1 = (s1 - (S-s1));\n W d2 = (s2 - (S-s2));\n if(d1 <= 0 and d1*d2 < EPS){\n ok = arg(pol[i]);\n ng = arg(pol[i-1]);\n if(ok > ng) swap(ok,ng);\n break;\n }\n }\n for(int tmp = 0; tmp < 10000; ++tmp){\n W m = (ok+ng)/2;\n L l(P(0,0),P(10,0)*P(cos(m),sin(m)));\n W s = area(convex_cut(pol,l));\n if(s >= S-s){\n ok = m;\n }else{\n ng = m;\n }\n }\n W a = (ok+ng)/2;\n P A = P(10,0)*P(cos(a),sin(a));\n W s = area(convex_cut(pol,L(P(0,0),A)));\n assert(abs(s-(S-s)) < 1e-5);\n //fprintf(stderr,\"%.12Lf : %.12Lf\\n\",s,S-s);\n printf(\"%.15Lf %.15Lf\\n\",A.X,A.Y);\n }\n}",
"accuracy": 0.25,
"time_ms": 10,
"memory_kb": 3604,
"score_of_the_acc": -0.5839,
"final_rank": 15
},
{
"submission_id": "aoj_1089_3680134",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <utility>\n#include <complex>\nusing namespace std;\nusing W = long double;\nusing P = complex<W>;\nusing Poly = vector<P>;\nusing L = pair<P,P>;\n#define X real()\n#define Y imag()\nconstexpr W EPS = 1e-10, pi = acos(-1);\n\nvoid debug(Poly p){\n cerr << \"Polygon\" << endl;\n for(auto e : p) cerr << e.X << \" \" << e.Y << endl;\n cerr << \"...\" << endl;\n}\n\nvoid debug(L l){\n fprintf(stderr,\"Segment %Lf %Lf %Lf %Lf\\n\",l.first.X,l.first.Y,l.second.X,l.second.Y);\n}\n\nW dot(const P &a, const P &b){ return a.X*b.X + a.Y*b.Y; }\nW cross(const P &a, const P &b){ return a.X*b.Y - a.Y*b.X; }\n\nP intersection(const L &a, const L &b){\n P af = a.first, as = a.second, bf = b.first, bs = b.second;\n return af + cross(bs-bf,af-bf)/(-cross(bs-bf,as-bf)+cross(bs-bf,af-bf))*(as-af);\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(norm(b) + EPS < norm(c)) return -2;\n return 0;\n}\n\nPoly convex_cut(const Poly &p, const L &l){\n Poly ret;\n int n = p.size();\n for(int i = 0; i < n; ++i){\n P cur = p[i], nex = p[(i+1)%n], lf = l.first, ls = l.second;\n if(ccw(lf,ls,cur) != -1)\n ret.push_back(cur);\n if((ccw(lf,ls,cur) != -1) ^ (ccw(lf,ls,nex) != -1))\n ret.push_back(intersection(L(cur,nex),l));\n }\n return ret;\n}\n\nW area(const Poly &p){\n int n = p.size();\n W ret = 0;\n for(int i = 0; i < n; ++i){\n ret += cross(p[i],p[(i+1)%n]);\n }\n return ret/2;\n}\n\nint main(){\n int N;\n while(cin >> N, N){\n Poly pol;\n for(int i = 0; i < N; ++i){\n W x, y;\n cin >> x >> y;\n pol.emplace_back(x,y);\n }\n W ok = 0, ng = pi, S = area(pol);\n for(int i = 1; i < N; ++i){\n L l1(P(0,0),pol[i]);\n L l2(P(0,0),pol[i-1]);\n W s1 = area(convex_cut(pol,l1));\n W s2 = area(convex_cut(pol,l2));\n W d1 = (s1 - (S-s1));\n W d2 = (s2 - (S-s2));\n if(d1 <= 0 and d1*d2 < EPS){\n ok = arg(pol[i]);\n ng = arg(pol[i-1]);\n if(ok > ng) swap(ok,ng);\n break;\n }\n }\n for(int tmp = 0; tmp < 1000; ++tmp){\n W m = (ok+ng)/2;\n L l(P(0,0),P(10,0)*P(cos(m),sin(m)));\n W s = area(convex_cut(pol,l));\n if(s > S-s){\n ok = m;\n }else{\n ng = m;\n }\n }\n W a = (ok+ng)/2;\n P A = P(10,0)*P(cos(a),sin(a));\n W s = area(convex_cut(pol,L(P(0,0),A)));\n //fprintf(stderr,\"%.12Lf : %.12Lf\\n\",s,S-s);\n printf(\"%.15Lf %.15Lf\\n\",A.X,A.Y);\n }\n}",
"accuracy": 0.25,
"time_ms": 750,
"memory_kb": 3520,
"score_of_the_acc": -1.1083,
"final_rank": 18
},
{
"submission_id": "aoj_1089_3678265",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#ifdef LOCAL\n#include \"../dump.hpp\"\n#else\n#define dump(...)\n#endif\n\n#define rep(i,n) for(int i=0,i##_cond=(n);i<i##_cond;++i)\n\nconst double EPS = 1e-10;\n// 点\ntypedef complex<double> P;\n// 外積\ndouble cross(const P& a, const P& b) {\n return imag(conj(a)*b);\n}\n// 内積\ndouble dot(const P& a, const P& b) {\n return real(conj(a)*b);\n}\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\n// 多角形\ntypedef vector<P> G;\n\n// 入力\nG g;\n\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > 0) return +1; // 反時計周り\n if (cross(b, c) < 0) return -1; // 時計回り\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;\n}\n\nP crosspoint(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];\n if (abs(A) < EPS) assert(false);\n return m[0] + B / A * (m[1] - m[0]);\n}\n\nG convex_cut(const G& Poly, const L& l) {\n G Q;\n for (int i = 0; i < Poly.size(); ++i) {\n P A = Poly[i], B = Poly[(i+1)%Poly.size()];\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(crosspoint(L(A, B), l));\n }\n return Q;\n}\n\ndouble area2(const G& poly) {\n double A = 0;\n for (int i = 0; i < poly.size(); ++i) \n A += cross(poly[i], poly[(i+1)%poly.size()]);\n return A;\n}\n\ndouble a; // 面積の半分\n\n// 面積が半分以下の時okとする\nbool solve(double deg){\n P zero(0,0);\n P t(sin(deg),cos(deg));\n t *= 100;\n L l(zero,t);\n G f = convex_cut(g,l);\n dump(a, area2(f));\n if(area2(f) - 1e-5 < a) return true;\n else return false;\n}\n\ndouble bs(double _ok, double _ng){\n double ok = _ok;\n double ng = _ng;\n\n while(abs(ok - ng) > 1e-15){\n double mid = (ok + ng) / 2;\n if(solve(mid)){\n ok = mid;\n }else{\n ng = mid;\n }\n }\n return ok;\n}\n\nsigned main(){\n int n;\n P zero(0,0);\n while(cin >> n, n){\n g.clear(); g.resize(n);\n rep(i,n){\n double x, y; cin >> x >> y;\n g[i] = {x, y};\n }\n a = area2(g)/2;\n // dump(a);\n double ok = 0, ng = M_PI;\n if(solve(ok) == false) swap(ok, ng);\n //dump(ok,ng);\n double ans = bs(ok,ng);\n P t(sin(ans),cos(ans));\n t *= 100;\n dump(\"hoge\");\n solve(ans);\n printf(\"%.15f %.15f\\n\",real(t),imag(t));\n }\n}",
"accuracy": 0.25,
"time_ms": 30,
"memory_kb": 3572,
"score_of_the_acc": -0.5519,
"final_rank": 14
},
{
"submission_id": "aoj_1089_3660027",
"code_snippet": "using 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&);\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}\nint N;\nmain()\n{\n\twhile(cin>>N,N)\n\t{\n\t\tPolygon P(N);\n\t\tfor(int i=0;i<N;i++)cin>>P[i];\n\t\tdouble S=area(P);\n\t\tPoint O;\n\t\tdouble L=0,R=M_PI;\n\t\tbool flag=area(P,Line(O,polar(2,0)))<S/2;\n\t\tfor(int i=0;i<100;i++)\n\t\t{\n\t\t\tdouble M=(L+R)/2;\n\t\t\tif(area(P,Line(O,polar(2,M)))<S/2^flag)R=M;\n\t\t\telse L=M;\n\t\t}\n\t\tPoint p=polar(2,L);\n\t\tcout<<fixed<<setprecision(15)<<p.x<<\" \"<<p.y<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3680,
"score_of_the_acc": -0.7373,
"final_rank": 7
},
{
"submission_id": "aoj_1089_3660020",
"code_snippet": "using 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&);\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}\nint N;\nmain()\n{\n\twhile(cin>>N,N)\n\t{\n\t\tPolygon P(N);\n\t\tfor(int i=0;i<N;i++)cin>>P[i];\n\t\tdouble S=area(P);\n\t\tPoint O,p;\n\t\tdouble now=1e150;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tdouble L=arg(P[i]);\n\t\t\tdouble R=arg(P[(i+1)%N]);\n\t\t\tif(R<L)R+=2*M_PI;\n\t\t\tfor(int i=0;i<100;i++)\n\t\t\t{\n\t\t\t\tdouble M1=(L*2+R)/3;\n\t\t\t\tdouble M2=(L+R*2)/3;\n\t\t\t\tif(abs(S-area(P,Line(O,polar(2,M1)))*2)<abs(S-area(P,Line(O,polar(2,M2)))*2))R=M2;\n\t\t\t\telse L=M1;\n\t\t\t}\n\t\t\tPoint q=polar(2,L);\n\t\t\tif(now>abs(S-area(P,Line(O,q))*2))\n\t\t\t{\n\t\t\t\tnow=abs(S-area(P,Line(O,q))*2);\n\t\t\t\tp=q;\n\t\t\t}\n\t\t}\n\t\tcout<<fixed<<setprecision(15)<<p.x<<\" \"<<p.y<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 1140,
"memory_kb": 3744,
"score_of_the_acc": -1.8012,
"final_rank": 11
},
{
"submission_id": "aoj_1089_3660019",
"code_snippet": "using 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&);\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}\nint N;\nmain()\n{\n\twhile(cin>>N,N)\n\t{\n\t\tPolygon P(N);\n\t\tfor(int i=0;i<N;i++)cin>>P[i];\n\t\tdouble S=area(P);\n\t\tPoint O,p;\n\t\tdouble now=1e150;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tdouble L=arg(P[i]);\n\t\t\tdouble R=arg(P[(i+1)%N]);\n\t\t\tif(R<L)R+=2*M_PI;\n\t\t\tfor(int i=0;i<100;i++)\n\t\t\t{\n\t\t\t\tdouble M1=(L*2+R)/3;\n\t\t\t\tdouble M2=(L+R*2)/3;\n\t\t\t\tif(abs(S-area(P,Line(O,polar(2,M1)))*2)<abs(S-area(P,Line(O,polar(2,M2)))*2))R=M2;\n\t\t\t\telse L=M1;\n\t\t\t}\n\t\t\tPoint q=polar(2,L);\n\t\t\tif(now>abs(S-area(P,Line(O,q))*2))\n\t\t\t{\n\t\t\t\tnow=abs(S-area(P,Line(O,q))*2);\n\t\t\t\tp=q;\n\t\t\t}\n\t\t\tif(now>abs(S-area(P,Line(O,P[i]))*2))\n\t\t\t{\n\t\t\t\tnow=abs(S-area(P,Line(O,P[i]))*2);\n\t\t\t\tp=P[i];\n\t\t\t}\n\t\t}\n\t\tcout<<fixed<<setprecision(15)<<p.x<<\" \"<<p.y<<endl;\n\t\t/*for(int i=0;i<20;i++)\n\t\t{\n\t\t\tcout<<fixed<<setprecision(15)<<area(P,Line(O,polar(2,M_PI/20*i)))<<endl;\n\t\t}*/\n\t}\n}",
"accuracy": 1,
"time_ms": 1130,
"memory_kb": 3744,
"score_of_the_acc": -1.7924,
"final_rank": 10
},
{
"submission_id": "aoj_1089_3660018",
"code_snippet": "using 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&);\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}\nint N;\nmain()\n{\n\twhile(cin>>N,N)\n\t{\n\t\tPolygon P(N);\n\t\tfor(int i=0;i<N;i++)cin>>P[i];\n\t\tdouble S=area(P);\n\t\tPoint O,p;\n\t\tdouble now=1e150;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tdouble L=arg(P[i]);\n\t\t\tdouble R=arg(P[(i+1)%N]);\n\t\t\tif(R<L)R+=2*M_PI;\n\t\t\tfor(int i=0;i<50;i++)\n\t\t\t{\n\t\t\t\tdouble M1=(L*2+R)/3;\n\t\t\t\tdouble M2=(L+R*2)/3;\n\t\t\t\tif(abs(S-area(P,Line(O,polar(2,M1)))*2)<abs(S-area(P,Line(O,polar(2,M2)))*2))R=M2;\n\t\t\t\telse L=M1;\n\t\t\t}\n\t\t\tPoint q=polar(2,L);\n\t\t\tif(now>abs(S-area(P,Line(O,q))*2))\n\t\t\t{\n\t\t\t\tnow=abs(S-area(P,Line(O,q))*2);\n\t\t\t\tp=q;\n\t\t\t}\n\t\t\tif(now>abs(S-area(P,Line(O,P[i]))*2))\n\t\t\t{\n\t\t\t\tnow=abs(S-area(P,Line(O,P[i]))*2);\n\t\t\t\tp=P[i];\n\t\t\t}\n\t\t}\n\t\tcout<<fixed<<setprecision(15)<<p.x<<\" \"<<p.y<<endl;\n\t\t/*for(int i=0;i<20;i++)\n\t\t{\n\t\t\tcout<<fixed<<setprecision(15)<<area(P,Line(O,polar(2,M_PI/20*i)))<<endl;\n\t\t}*/\n\t}\n}",
"accuracy": 0.25,
"time_ms": 340,
"memory_kb": 3744,
"score_of_the_acc": -1.0933,
"final_rank": 17
},
{
"submission_id": "aoj_1089_3660017",
"code_snippet": "using 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&);\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}\nint N;\nmain()\n{\n\twhile(cin>>N,N)\n\t{\n\t\tPolygon P(N);\n\t\tfor(int i=0;i<N;i++)cin>>P[i];\n\t\tdouble S=area(P);\n\t\tPoint O,p;\n\t\tdouble now=1e150;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tdouble L=arg(P[i]);\n\t\t\tdouble R=arg(P[(i+1)%N]);\n\t\t\tif(R<L)R+=2*M_PI;\n\t\t\tfor(int i=0;i<50;i++)\n\t\t\t{\n\t\t\t\tdouble M1=(L*2+R)/3;\n\t\t\t\tdouble M2=(L+R*2)/3;\n\t\t\t\tif(abs(S-area(P,Line(O,polar(2,M1)))*2)<abs(S-area(P,Line(O,polar(2,M2)))*2))R=M2;\n\t\t\t\telse L=M1;\n\t\t\t}\n\t\t\tPoint q=polar(2,L);\n\t\t\tif(now>abs(S-area(P,Line(O,q))*2))\n\t\t\t{\n\t\t\t\tnow=abs(S-area(P,Line(O,q))*2);\n\t\t\t\tp=q;\n\t\t\t}\n\t\t}\n\t\tcout<<fixed<<setprecision(15)<<p.x<<\" \"<<p.y<<endl;\n\t\t/*for(int i=0;i<20;i++)\n\t\t{\n\t\t\tcout<<fixed<<setprecision(15)<<area(P,Line(O,polar(2,M_PI/20*i)))<<endl;\n\t\t}*/\n\t}\n}",
"accuracy": 0.25,
"time_ms": 340,
"memory_kb": 3700,
"score_of_the_acc": -1.025,
"final_rank": 16
}
] |
aoj_1108_cpp
|
A Long Ride on a Railway
Travelling by train is fun and exciting. But more than that indeed. Young
challenging boys often tried to purchase the longest single tickets and to
single ride the longest routes of various railway systems. Route planning was
like solving puzzles. However, once assisted by computers, and supplied with
machine readable databases, it is not any more than elaborating or hacking
on the depth-first search algorithms.
Map of a railway system is essentially displayed in the form of a graph. (See
the Figures below.) The vertices (i.e. points) correspond to stations and the
edges (i.e. lines) correspond to direct routes between stations. The station
names (denoted by positive integers and shown in the upright letters in the
Figures) and direct route distances (shown in the slanted letters) are also
given.
The problem is to find the length of the longest path and to form the
corresponding list of stations on the path for each system. The longest of
such paths is one that starts from one station and, after travelling many
direct routes as far as possible without passing any direct route more than
once, arrives at a station which may be the starting station or different one
and is longer than any other sequence of direct routes. Any station may be
visited any number of times in travelling the path if you like.
Input
The graph of a system is defined by a set of lines of integers of the
form:
ns
nl
s
1,1
s
1,2
d
1
s
2,1
s
2,2
d
2
...
s
nl
,1
s
nl
,2
d
nl
Here 1 <=
ns
<= 10 is the number of stations (so, station names are 1, 2,
...,
ns
), and 1 <=
nl
<= 20 is the number of direct routes in this
graph.
s
i
,1
and
s
i
,2
(
i
= 1, 2, ...,
nl
) are station names at the both ends of the
i
-th direct route.
d
i
>= 1 (
i
= 1, 2, ...,
nl
) is the direct route distance between two different stations
s
i
,1
and
s
i
,2
.
It is also known that there is at most one direct route between any pair of
stations, and all direct routes can be travelled in either directions. Each
station has at most four direct routes leaving from it.
The integers in an input line are separated by at least one white space (i.e. a
space character (ASCII code 32) or a tab character (ASCII code 9)), and possibly
preceded and followed by a number of white spaces.
The whole input of this problem consists of a few number of sets each of which
represents one graph (i.e. system) and the input terminates with two integer
0
's in the line of next
ns
and
nl
.
Output
Paths may be travelled from either end; loops can be traced clockwise or
anticlockwise. So, the station lists for the longest path for Figure A are
multiple like (in lexicographic order):
2 3 4 5
5 4 3 2
For Figure B, the station lists for the longest path are also multiple like
(again in lexicographic order):
6 2 5 9 6 7
6 9 5 2 6 7
7 6 2 5 9 6
7 6 9 5 2 6
Yet there may be the case where the longest paths are not unique. (That is,
multiple independent paths happen to have the same longest distance.) To make
the answ
...(truncated)
|
[
{
"submission_id": "aoj_1108_1045243",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> PI;\nconst double EPS=1e-6;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define F first\n#define S second\n#define mp(a,b) make_pair(a,b)\n#define pb(a) push_back(a)\n#define SZ(a) (int)((a).size())\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) a.rbegin(),a.rend()\n#define FLL(a,b) memset((a),b,sizeof(a))\n#define CLR(a) FLL(a,0)\n#define declare(a,it) __typeof(a) it=(a)\n#define FOR(it,a) for(declare(a.begin(),it);it!=a.end();++it)\n#define FORR(it,a) for(declare(a.rbegin(),it);it!=a.rend();++it)\ntemplate<class T,class U> ostream& operator<< (ostream& o, const pair<T,U>& v){return o << \"(\" << v.F << \", \" << v.S << \")\";}\ntemplate<class T> ostream& operator<< (ostream& o, const vector<T>& v){o << \"{\";rep(i,SZ(v)) o << (i?\", \":\"\") << v[i];return o << \"}\";}\nint dx[]={0,1,0,-1,1,1,-1,-1};\nint dy[]={1,0,-1,0,-1,1,1,-1};\nint s2i(string& a){stringstream ss(a);int r;ss>>r;return r;}\nint geti(){int n;scanf(\"%d\", &n);return n;}\n\nint ns,nl;\nint s[20],t[20], d[20];\n\nint memo[10][1<<20];\nint rec(int v,int st){\n if(memo[v][st] >= 0)\n return memo[v][st];\n int& ret = memo[v][st] = 0;\n\n for(int i = 0; i < nl; ++i){\n if((st>>i)&1) continue;\n if(v == s[i])\n ret = max(ret, rec(t[i], st|(1<<i)) + d[i]);\n if(v == t[i])\n ret = max(ret, rec(s[i], st|(1<<i)) + d[i]);\n }\n \n return ret;\n}\n\nint getpath(int v,int st){\n cout << v+1;\n if(memo[v][st] == 0){\n cout << endl;\n return memo[v][st];\n }\n cout << \" \";\n int ret = memo[v][st];\n int ne = ns;\n int nst;\n \n for(int i = 0; i < nl; ++i){\n if((st>>i)&1) continue;\n if(v == s[i] && rec(t[i], st|(1<<i)) + d[i] == ret && t[i] < ne){\n ne = t[i];\n nst = st | (1<<i);\n }\n\n if(v == t[i] && rec(s[i], st|(1<<i)) + d[i] == ret && s[i] < ne){\n ne = s[i];\n nst = st | (1<<i);\n } \n }\n\n getpath(ne,nst);\n \n return ret;\n}\n\n\nint main(int argc, char *argv[])\n{\n while(cin >> ns >> nl && ns){\n for(int i = 0; i < nl; ++i){\n cin >> s[i] >> t[i] >> d[i];\n --s[i], --t[i];\n }\n memset(memo, -1, sizeof(memo));\n int ma = 0;\n for(int i = 0; i < ns; ++i)\n ma = max(ma, rec(i, 0));\n cout << ma << endl;\n for(int i = 0; i < ns; ++i){\n if(rec(i,0) == ma){\n getpath(i,0);\n break;\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 42132,
"score_of_the_acc": -1,
"final_rank": 4
},
{
"submission_id": "aoj_1108_494902",
"code_snippet": "//20\n#include<iostream>\n#include<algorithm>\n#include<vector>\n\nusing namespace std;\n\nint ns,nl;\nint d[11][11];\nint ln[11][11];\nvector<int> mv,cv;\nint m;\nbool p[1<<20][11];\n\nvoid dfs(int v,int ds,int l){\n cv.push_back(v);\n for(int i=1;i<=ns;i++){\n int ll=l|1<<ln[v][i];\n if(d[v][i]&&!p[ll][i]++){\n int cs=d[v][i];\n d[v][i]=d[i][v]=0;\n dfs(i,ds+cs,ll);\n d[v][i]=d[i][v]=cs;\n }\n }\n if(ds>m){\n m=ds;\n mv=cv;\n }\n cv.pop_back();\n}\n\nint main(){\n while(cin>>ns>>nl,ns|nl){\n fill(d[0],d[11],0);\n for(int i=0;i<nl;i++){\n int s,t,dd;\n cin>>s>>t>>dd;\n d[s][t]=d[t][s]=dd;\n ln[s][t]=ln[t][s]=i;\n }\n fill(p[0],p[(1<<20)],false);\n m=0;\n for(int i=1;i<=ns;i++){\n dfs(i,0,0);\n }\n cout<<m<<endl;\n for(int i=0;i<mv.size();i++){\n cout<<mv[i]<<((i==mv.size()-1)?'\\n':' ');\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 12476,
"score_of_the_acc": -0.2961,
"final_rank": 2
},
{
"submission_id": "aoj_1108_349917",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n\nusing namespace std;\n\n#define dump(n) cerr<<\"# \"<<#n<<\"=\"<<(n)<<endl\n#define rep(i,n) for(int i=0;i<n;i++)\n\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\n\nconst int INFTY=1<<29;\n\npair<vi,int> solve(int v,vvi& dist,map<pair<vvi,int>,pair<vi,int> >& memo)\n{\n\tmap<pair<vvi,int>,pair<vi,int> >::iterator it=memo.find(make_pair(dist,v));\n\tif(it!=memo.end())\n\t\treturn it->second;\n\t\n\tint n=dist.size();\n\tpair<vi,int> res;\n\trep(i,n){\n\t\tif(dist[v][i]==INFTY)\n\t\t\tcontinue;\n\t\tint d=dist[v][i];\n\t\tdist[v][i]=dist[i][v]=INFTY;\n\t\tpair<vi,int> temp=solve(i,dist,memo); temp.second+=d;\n\t\tif(temp.second>res.second || temp.second==res.second && temp.first<res.first)\n\t\t\tres=temp;\n\t\tdist[v][i]=dist[i][v]=d;\n\t}\n\tres.first.insert(res.first.begin(),v);\n\treturn memo[make_pair(dist,v)]=res;\n}\n\nint main()\n{\n\tfor(int n,m;cin>>n>>m,n|m;){\n\t\tvvi dist(n,vi(n,INFTY));\n\t\trep(i,m){\n\t\t\tint s,d,w; cin>>s>>d>>w;\n\t\t\tdist[s-1][d-1]=dist[d-1][s-1]=w;\n\t\t}\n\t\tmap<pair<vvi,int>,pair<vi,int> > memo;\n\t\tpair<vi,int> res;\n\t\trep(i,n){\n\t\t\tpair<vi,int> temp=solve(i,dist,memo);\n\t\t\tif(temp.second>res.second || temp.second==res.second && temp.first<res.first)\n\t\t\t\tres=temp;\n\t\t}\n\t\tcout<<res.second<<endl;\n\t\trep(i,res.first.size())\n\t\t\tcout<<(res.first[i]+1)<<(i==res.first.size()-1?'\\n':' ');\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1836,
"score_of_the_acc": -0.4721,
"final_rank": 3
},
{
"submission_id": "aoj_1108_321652",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <set>\n#include <algorithm>\nusing namespace std;\n\nint ans;\nvector<int> ansv;\nvector<vector<int> > v;\n\nvoid dfs(int prev, int next, int a, vector<int> vi, set<pair<int,int> > s){\n if(v[prev][next] == -1 || s.find(pair<int,int>(prev,next)) != s.end()) return;\n vi.push_back(next);\n s.insert(pair<int,int>(prev,next));\n s.insert(pair<int,int>(next,prev));\n a += v[prev][next];\n if(ans < a){\n ans = a;\n ansv = vi;\n }\n for(int i=0;i<v.size();i++) dfs(next,i,a,vi,s);\n}\n\nint main(){\n int n,m;\n while(cin >> n >> m && n && m){\n ans = 0;\n ansv.clear();\n v.assign(n,vector<int>(n,-1));\n for(int i=0;i<m;i++){\n int a,b;\n cin >> a >> b;\n a--;\n b--;\n cin >> v[a][b];\n v[b][a] = v[a][b];\n }\n\n for(int i=0;i<n;i++){\n vector<int>vi;\n set<pair<int,int> > s;\n vi.push_back(i);\n for(int j=0;j<n;j++) dfs(i,j,0,vi,s);\n }\n cout << ans << endl;\n cout << ansv[0] + 1;\n for(int i=1;i<ansv.size();i++) cout << \" \" << ansv[i] + 1;\n cout << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 920,
"score_of_the_acc": -1.0218,
"final_rank": 5
},
{
"submission_id": "aoj_1108_139030",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<vector>\n#include<algorithm>\n\nusing namespace std;\n\nstruct node{\n vector<int> con;\n vector<int> cost;\n vector<int> e_id;\n};\n\ntypedef vector<node> Graph;\n\nstruct State{\n int now;\n int dist;\n int used;\n State(int n, int d, int u):now(n),dist(d),used(u){}\n bool visited(int i){return (bool)(used&(1LL<<i));}\n void setUse(int i){used|=(1LL<<i);}\n vector<int> hist;\n bool operator>(const State &t)const{\n return dist > t.dist;\n }\n};\n\npair<int,vector<int> > solve(int st, Graph &G){\n priority_queue<State,vector<State>,greater<State> > Q;\n State init(st,0,0);\n init.hist.push_back(st+1);\n Q.push(init);\n pair<int, vector<int> > ret;\n while(!Q.empty()){\n State nst = Q.top();\n Q.pop();\n int nowid = nst.now;\n\n if(ret.first<nst.dist){\n ret=make_pair(nst.dist,nst.hist);\n }else if(ret.first==nst.dist){\n if(nst.hist<ret.second){\n\tret.second = nst.hist;\n }\n }\n\n for(int i = 0; i < (int)G[nowid].con.size(); ++i){\n State next(G[nowid].con[i], nst.dist + G[nowid].cost[i], nst.used);\n if(!nst.visited(G[nowid].e_id[i])){\n\tnext.setUse(G[nowid].e_id[i]);\n\tnext.hist=nst.hist;\n\tnext.hist.push_back(G[nowid].con[i]+1);\n\tQ.push(next);\n }\n }\n }\n return ret;\n}\n\nint main()\n{\n while(true){\n int ns,nl;\n cin >> ns >> nl;\n if(ns==0&&nl==0)break;\n Graph G(ns);\n for(int i = 0; i < nl; ++i){\n int src,dst,w;\n cin >> src >> dst >> w;\n G[src-1].con.push_back(dst-1);\n G[src-1].cost.push_back(w);\n G[src-1].e_id.push_back(i);\n G[dst-1].con.push_back(src-1);\n G[dst-1].cost.push_back(w);\n G[dst-1].e_id.push_back(i);\n }\n pair<int, vector<int> > res;\n for(int i = 0; i < ns; ++i){\n pair<int, vector<int> > tmp = solve(i,G);\n if(res.first < tmp.first){\n\tres = tmp;\n }else if( res.first == tmp.first ){\n\tif( tmp.second < res.second )\n\t res.second = tmp.second;\n }\n }\n cout << res.first << endl;\n for(int i = 0; i < (int)res.second.size(); ++i){\n if(i>0)cout << ' ';\n cout << res.second[i];\n }\n cout << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_1094_cpp
|
KND Warp
Problem
KND君は会津大学に在籍する学生プログラマだ。彼はその優秀な頭脳をもってワープ装置を開発したことで有名である。ワープ装置とは便利なもので、ある場所から別の場所まで瞬時に移動することができる。彼はこれから地球上に点在するワープ装置を用いて様々な場所を可能な限り早くめぐる旅を計画している。
彼の隣人であるあなたの仕事は3次元空間 (xyz直交座標系) 上に存在する
N
個のワープ装置をうまく使用して、1から
M
までの番号がふられた
M
個の点を順に通って、
M
番目の点まで移動するときの最小の所要時間を求めることだ。はじめは1番目の点にいるものとし、どのワープ装置も任意のワープ装置へ時間0で移動できる。ワープ以外の単位距離の移動は単位時間を要する。経由点のクエリは
Q
個与えられる。
Input
入力は複数のテストケースからなる。
ひとつのテストケースは以下の形式で与えられる。
入力の終わりを
N
=
Q
= 0のとき示す。
N
Q
x
1
y
1
z
1
x
2
y
2
z
2
...
x
N
y
N
z
N
M
1
x
1,1
y
1,1
z
1,1
x
1,2
y
1,2
z
1,2
...
x
1,M
y
1,M
z
1,M
M
2
x
2,1
y
2,1
z
2,1
x
2,2
y
2,2
z
2,2
...
x
2,M
y
2,M
z
2,M
...
M
Q
x
Q,1
y
Q,1
z
Q,1
x
Q,2
y
Q,2
z
Q,2
...
x
Q,M
y
Q,M
z
Q,M
ここで、
N
:ワープ装置の数
Q
:旅のクエリの数
M
i
:i番目クエリの旅で訪れる点の数
x
i,j
,
y
i,j
,
z
i,j
:i番目のクエリの旅で訪れるj番目の点の座標(x,y,z)
である。
Constraints
入力は以下の条件を満たす。
テストケースの数は15個を超えない。
入力の半分程度は
N
≤1000を満たす。
入力に含まれる値はすべて整数。
2≤
N
≤100,000
1≤
Q
≤1,000
2≤
M
≤100
-1,000,000≤(全てのx,y,z座標値)≤1,000,000
ワープ装置は上記の制約を満たす空間中にランダムに分布する(Sample Inputは例外)。
ワープ装置同士、中継点同士、ワープ装置と中継点はそれぞれ重なることがある。
Output
各クエリにつき最小の所要時間を一行に出力せよ。この値はジャッジ出力の値と10
-4
より大きい差を持ってはならない。
Sample Input
3 2
0 0 0
1 1 1
2 2 2
4
-1 -1 -1
3 3 3
-1 -1 -1
4 4 4
2
1234 5678 9012
1716 6155 9455
0 0
Sample Output
12.124355653
810.001234567
Notes
入力ファイルのサイズは4MB程度になる。入力は高速にしたほうがよいが、たとえばC++であればcinでも十分である。
|
[
{
"submission_id": "aoj_1094_10274933",
"code_snippet": "// AOJ #1094 KND Warp\n// 2025.3.7\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nstruct P { int x, y, z; };\nstruct N { int x, y, z, l, r; };\n\nvector<N> T;\nvector<P> W;\n\nint build(int s, int e, int d, vector<int>& idx) {\n if(s > e) return -1;\n int m = (s+e)/2, dm = d % 3;\n auto cmp = [&](int a, int b) {\n if(dm==0) return W[a].x < W[b].x;\n if(dm==1) return W[a].y < W[b].y;\n return W[a].z < W[b].z;\n };\n nth_element(idx.begin()+s, idx.begin()+m, idx.begin()+e+1, cmp);\n int id = idx[m];\n N nd;\n nd.x = W[id].x; nd.y = W[id].y; nd.z = W[id].z;\n nd.l = nd.r = -1;\n int cur = T.size();\n T.push_back(nd);\n int L = build(s, m-1, d+1, idx);\n int R = build(m+1, e, d+1, idx);\n T[cur].l = L; T[cur].r = R;\n return cur;\n}\n\nvoid dfs(int i, int d, int qx, int qy, int qz, double &best) {\n if(i == -1) return;\n long long dx = qx - T[i].x, dy = qy - T[i].y, dz = qz - T[i].z;\n double dist = (double)dx*dx + (double)dy*dy + (double)dz*dz;\n if(dist < best) best = dist;\n int dm = d % 3;\n double diff = 0;\n if(dm==0) diff = qx - T[i].x;\n else if(dm==1) diff = qy - T[i].y;\n else diff = qz - T[i].z;\n int fst = (diff < 0 ? T[i].l : T[i].r);\n int snd = (diff < 0 ? T[i].r : T[i].l);\n dfs(fst, d+1, qx, qy, qz, best);\n if(diff*diff < best) dfs(snd, d+1, qx, qy, qz, best);\n}\n\nint main(){\n while(true){\n int n = Cin(), Q = Cin();\n if(n==0) break;\n\n W.resize(n);\n for (int i=0; i<n; i++) W[i].x = Cin(), W[i].y = Cin(), W[i].z = Cin();\n\n T.clear();\n vector<int> idx(n);\n for (int i=0; i<n; i++) idx[i] = i;\n int root = build(0, n-1, 0, idx);\n\n for (int i=0; i<Q; i++){\n int m = Cin();\n vector<P> p(m);\n for (int j=0; j<m; j++)\n p[j].x = Cin(), p[j].y = Cin(), p[j].z = Cin();\n\n double ans = 0.0;\n for (int j=0; j<m-1; j++){\n int ax = p[j].x, ay = p[j].y, az = p[j].z;\n int bx = p[j+1].x, by = p[j+1].y, bz = p[j+1].z;\n double dx = ax - bx, dy = ay - by, dz = az - bz;\n double d1 = sqrt(dx*dx + dy*dy + dz*dz);\n\n double bestA = 1e18;\n dfs(root, 0, ax, ay, az, bestA);\n double dA = sqrt(bestA);\n double bestB = 1e18;\n dfs(root, 0, bx, by, bz, bestB);\n double dB = sqrt(bestB);\n double d2 = dA + dB;\n ans += min(d1, d2);\n }\n printf(\"%.9lf\\n\", ans);\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 7264,
"score_of_the_acc": -0.1596,
"final_rank": 1
},
{
"submission_id": "aoj_1094_4681484",
"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 LARGE 100005\n#define SMALL 105\n\nstruct Point{\n\n\tbool operator<(const struct Point &arg)const{\n\n\t\treturn x < arg.x;\n\t}\n\tdouble x,y,z;\n};\n\nint N,Q;\nint M;\nPoint point[LARGE],work[SMALL];\ndouble near_dist[SMALL];\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)+(a.z-b.z)*(a.z-b.z));\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf\",&point[i].x,&point[i].y,&point[i].z);\n\t}\n\tsort(point,point+N);\n\n\tfor(int loop = 0; loop < Q; loop++){\n\n\t\tscanf(\"%d\",&M);\n\n\t\tint left,right,mid,loc;\n\n\t\tfor(int i = 0; i < M; i++){\n\n\t\t\tscanf(\"%lf %lf %lf\",&work[i].x,&work[i].y,&work[i].z);\n\n\t\t\tnear_dist[i] = HUGE_NUM;\n\n\t\t\t//自分より右にある点の中で、最も左にあるものを求める\n\t\t\tleft = 0,right = N-1,mid = (left+right)/2;\n\t\t\tloc = N;\n\n\t\t\twhile(left <= right){\n\n\t\t\t\tif(point[mid].x >= work[i].x){\n\n\t\t\t\t\tloc = mid;\n\t\t\t\t\tright = mid-1;\n\t\t\t\t}else{\n\n\t\t\t\t\tleft = mid+1;\n\t\t\t\t}\n\t\t\t\tmid = (left+right)/2;\n\t\t\t}\n\n\t\t\t//右へ\n\t\t\tfor(int k = loc; k < N && sqrt((work[i].x-point[k].x)*(work[i].x-point[k].x)) < near_dist[i]; k++){\n\n\t\t\t\tnear_dist[i] = min(near_dist[i],calc_dist(work[i],point[k]));\n\t\t\t}\n\n\t\t\t//左へ\n\t\t\tfor(int k = loc-1; k >= 0 && sqrt((work[i].x-point[k].x)*(work[i].x-point[k].x)) < near_dist[i]; k--){\n\n\t\t\t\tnear_dist[i] = min(near_dist[i],calc_dist(work[i],point[k]));\n\t\t\t}\n\t\t}\n\n\t\tdouble ans = 0;\n\n\t\tfor(int i = 0; i < M-1; i++){\n\n\t\t\tans += min(calc_dist(work[i],work[i+1]),near_dist[i]+near_dist[i+1]);\n\t\t}\n\n\t\tprintf(\"%.10lf\\n\",ans);\n\t}\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&N,&Q);\n\t\tif(N == 0 && Q == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 1940,
"memory_kb": 5628,
"score_of_the_acc": -1.0877,
"final_rank": 11
},
{
"submission_id": "aoj_1094_3536802",
"code_snippet": "// 参考: http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2137009#1\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <memory> // unique_ptr\n#include <cmath>\n#include <iomanip>\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\ntemplate<class T>\nclass kdTree {\n using VV = vector<vector<T>>;\n vector<T> vec;\n int axis;\n unique_ptr<kdTree> ltree, rtree;\n void make_tree(VV &v, int l, int r, int depth = 0) {\n if (l >= r) return;\n int mid = (l + r) / 2;\n axis = depth % v[mid].size();\n auto cmp = [&](vector<T> &a, vector<T> &b) -> bool {\n return a[axis] < b[axis];\n };\n nth_element(v.begin() + l, v.begin() + mid, v.begin() + r, cmp);\n ltree = kdTree::get_tree(v, l, mid, depth + 1);\n rtree = kdTree::get_tree(v, mid + 1, r, depth + 1);\n vec = v[mid];\n }\n T dist(vector<T> &d1, vector<T> &d2) {\n T ans = T();\n REP(i, 0, d1.size()) {\n ans += pow(d1[i] - d2[i], 2.0);\n }\n return sqrt(ans);\n }\n static unique_ptr<kdTree> get_tree(VV &v, int l, int r, int depth) {\n if (l >= r) {\n return nullptr;\n } else {\n return make_unique<kdTree>(v, l, r, depth);\n }\n }\npublic:\n kdTree(VV &v): kdTree(v, 0, v.size(), 0) {}\n kdTree(VV &v, int l, int r, int depth) {\n make_tree(v, l, r, depth);\n }\n void nearest(vector<T> &query, double &ans) {\n ans = min(ans, dist(vec, query));\n if (query[axis] <= vec[axis]) {\n if (ltree) {\n ltree->nearest(query, ans);\n }\n if (vec[axis] - query[axis] >= ans) return;\n if (rtree) {\n rtree->nearest(query, ans);\n }\n } else {\n if (rtree) {\n rtree->nearest(query, ans);\n }\n if (query[axis] - vec[axis] >= ans) return;\n if (ltree) {\n ltree->nearest(query, ans);\n }\n }\n }\n};\n\ndouble dist(vector<double> &v1, vector<double> &v2) {\n double ans = 0.0;\n REP (i, 0, v1.size()) {\n ans += pow(v1[i] - v2[i], 2);\n }\n return sqrt(ans);\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n, q;\n while (cin >> n >> q, n + q) {\n auto p = make_v(n, 3, 0.0);\n REP(i, 0, n) {\n REP(j, 0, 3) {\n cin >> p[i][j];\n }\n }\n kdTree<double> kdtree(p);\n REP(Q, 0, q) {\n int m;\n cin >> m;\n double ans = 0.0;\n vector<double> prev(3), curr(3);\n REP(i, 0, 3) {\n cin >> prev[i];\n }\n REP(i, 1, m) {\n REP (j, 0, 3) {\n cin >> curr[j];\n }\n double ans1 = 1e+15, ans2 = 1e+15;\n kdtree.nearest(prev, ans1);\n kdtree.nearest(curr, ans2);\n ans += min(dist(curr, prev), ans1 + ans2);\n prev = curr;\n }\n cout << fixed << setprecision(10) << ans << endl;\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 240,
"memory_kb": 17664,
"score_of_the_acc": -0.6878,
"final_rank": 7
},
{
"submission_id": "aoj_1094_3535909",
"code_snippet": "// 参考: http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2137009#1\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <memory> // unique_ptr\n#include <cmath>\n#include <iomanip>\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\ntemplate<class T>\nclass kdTree {\n public:\n vector<T> vec;\n int axis;\n unique_ptr<kdTree> ltree, rtree;\n void make_tree(vector<vector<T>> &v, int l, int r, int depth = 0) {\n if (l >= r) return;\n int mid = (l + r) / 2;\n axis = depth % v[mid].size();\n auto cmp = [&](vector<T> &a, vector<T> &b) -> bool {\n return a[axis] < b[axis];\n };\n nth_element(v.begin() + l, v.begin() + mid, v.begin() + r, cmp);\n if (l < mid) {\n ltree = make_unique<kdTree>(v, l, mid, depth + 1);\n }\n if (mid + 1 < r) {\n rtree = make_unique<kdTree>(v, mid + 1, r, depth + 1);\n }\n vec = v[mid];\n }\n T dist(vector<T> &d1, vector<T> &d2) {\n T ans = T();\n REP(i, 0, d1.size()) {\n ans += pow(d1[i] - d2[i], 2.0);\n }\n return sqrt(ans);\n }\n\npublic:\n kdTree(vector<vector<T>> &v): kdTree(v, 0, v.size(), 0) {}\n kdTree(vector<vector<T>> &v, int l, int r, int depth) {\n make_tree(v, l, r, depth);\n }\n void nearest(vector<T> &query, double &ans) {\n ans = min(ans, dist(vec, query));\n if (query[axis] <= vec[axis]) {\n if (ltree) {\n ltree->nearest(query, ans);\n }\n if (vec[axis] - query[axis] >= ans) return;\n if (rtree) {\n rtree->nearest(query, ans);\n }\n } else {\n if (rtree) {\n rtree->nearest(query, ans);\n }\n if (query[axis] - vec[axis] >= ans) return;\n if (ltree) {\n ltree->nearest(query, ans);\n }\n }\n }\n};\n\ndouble dist(vector<double> &v1, vector<double> &v2) {\n double ans = 0.0;\n REP (i, 0, v1.size()) {\n ans += pow(v1[i] - v2[i], 2);\n }\n return sqrt(ans);\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n, q;\n while (cin >> n >> q, n + q) {\n auto p = make_v(n, 3, 0.0);\n REP(i, 0, n) {\n REP(j, 0, 3) {\n cin >> p[i][j];\n }\n }\n kdTree<double> kdtree(p);\n dump(kdtree.axis);\n REP(Q, 0, q) {\n int m;\n cin >> m;\n double ans = 0.0;\n vector<double> prev(3), curr(3);\n REP(i, 0, 3) {\n cin >> prev[i];\n }\n REP(i, 1, m) {\n REP (j, 0, 3) {\n cin >> curr[j];\n }\n double ans1 = 1e+15, ans2 = 1e+15;\n kdtree.nearest(prev, ans1);\n kdtree.nearest(curr, ans2);\n ans += min(dist(curr, prev), ans1 + ans2);\n prev = curr;\n }\n cout << fixed << setprecision(10) << ans << endl;\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 17588,
"score_of_the_acc": -0.6899,
"final_rank": 8
},
{
"submission_id": "aoj_1094_2137009",
"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\nstruct po {\n\tint index;\n\tvector<long long int> coors;\n\tpo(int _d):coors(_d) {\n\t\tindex = -1;\n\t}\n\tpo(int index_, const vector<long long int>&coors_) :index(index_), coors(coors_) {\n\n\t}\n\tpo() {}\n};\ntemplate<class T>\nclass axisSorter {\n\tint k;\npublic:\n\taxisSorter(int _k) : k(_k) {}\n\tbool operator()(const T &a, const T &b) {\n\t\treturn a.coors[k] < b.coors[k];\n\t}\n};\nlong long int getdis(const po&l, const po&r) {\n\tlong long int dis = 0;\n\tfor (int i = 0; i < l.coors.size(); ++i) {\n\t\tdis += (l.coors[i] - r.coors[i])*(l.coors[i] - r.coors[i]);\n\t}\n\treturn dis;\n}\ntemplate<class T, int Dim = 3>\nstruct kdtree {\npublic:\n\tT val;\n shared_ptr<kdtree<T>> ltree, rtree;\n\tint depth;\n\tint axis;\n\tkdtree(const T &p_) :val(p_), ltree(nullptr), rtree(nullptr) {\n\n\t}\n\n\tkdtree(vector<T>&ps_, const int& l, const int& r, const int depth_ = 0) : ltree(nullptr), rtree(nullptr), depth(depth_), axis(depth%Dim) {\n\t\tinit(ps_, l, r);\n\t}\n\tvector<T>query(const T & amin, const T&amax) {\n\t\tvector<T>ans;\n\t\tbool aok = true;\n\t\tfor (int i = 0; i < Dim; ++i) {\n\t\t\tif (amin.coors[i] <= val.coors[i] && val.coors[i] <= amax.coors[i]) {\n\n\t\t\t}\n\t\t\telse {\n\t\t\t\taok = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (aok) {\n\t\t\tans.emplace_back(val);\n\t\t}\n\t\taxisSorter<T> as(axis);\n\t\tif (as(val, amax) || val.coors[axis] == amax.coors[axis]) {\n\t\t\tif (rtree != nullptr) {\n\t\t\t\tvector<T>tans(rtree->query(amin, amax));\n\t\t\t\tans.insert(ans.end(), tans.begin(), tans.end());\n\t\t\t}\n\t\t}\n\t\tif (as(amin, val) || val.coors[axis] == amin.coors[axis]) {\n\t\t\tif (ltree != nullptr) {\n\t\t\t\tvector<T>tans(ltree->query(amin, amax));\n\t\t\t\tans.insert(ans.end(), tans.begin(), tans.end());\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t}\n\tvoid get_closest(const T& apo, long long int &ans) {\n\t\tans = min(ans, getdis(apo, val));\n\t\taxisSorter<T> as(axis);\n\t\tif (as(apo, val) || val.coors[axis] == apo.coors[axis]) {\n\t\t\tif (ltree)ltree->get_closest(apo, ans);\n\t\t\tlong long int dis = apo.coors[axis] - val.coors[axis];\n\t\t\tif (dis*dis >= ans)return;\n\t\t\telse {\n\t\t\t\tif (rtree)rtree->get_closest(apo, ans);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tif (rtree)rtree->get_closest(apo, ans);\n\t\t\tlong long int dis = val.coors[axis] - apo.coors[axis];\n\t\t\tif (dis*dis >= ans)return;\n\t\t\telse {\n\t\t\t\tif (ltree)ltree->get_closest(apo, ans);\n\t\t\t}\n\t\t}\n\t}\nprivate:\n\tvoid init(vector<T>&ps, const int& l, const int& r) {\n\t\tif (l >= r) {\n\t\t\treturn;\n\t\t}\n\t\tconst int mid = (l + r) / 2;\n\t\tnth_element(ps.begin() + l, ps.begin() + mid, ps.begin() + r, axisSorter<T>(axis));\n\t\tval = ps[mid];\n\t\tltree = make_kdtree(ps, l, mid, depth + 1);\n\t\trtree = make_kdtree(ps, mid + 1, r, depth + 1);\n\t}\n\n};\n//[l..r)\ntemplate<class T>\nunique_ptr<kdtree<T>>make_kdtree(vector<T>&ps_, const int& l, const int& r, const int& depth = 0) {\n\tif (l >= r)return nullptr;\n\telse {\n\t\treturn make_unique<kdtree<T>>(ps_, l, r, depth);\n\t}\n}\n\nint main() {\n\tcout << setprecision(10) << fixed;\n\twhile (1) {\n\t\tint N, Q; cin >> N >> Q;\n\t\tif (!N)break;\n\t\tvector<po>pos;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint x, y, z; cin >> x >> y >> z;\n\t\t\tpos.push_back(po(i, vector<long long int>{x, y, z}));\n\t\t}\n\t\tint l = 0, r = N;\n\t\tkdtree<po>tree(pos,l,r);\n\t\twhile (Q--) {\n\n\t\t\tint M; cin >> M;\n\t\t\tvector<po>points;\n\t\t\tfor (int i = 0; i < M; ++i) {\n\t\t\t\tint x, y, z; cin >> x >> y >> z;\n\t\t\t\tpo p(0, vector<long long int>{x, y, z});\n\t\t\t\tpoints.push_back(p);\n\t\t\t}\n\t\t\tld ans = 0;\n\t\t\tfor (int i = 0; i < M - 1; ++i) {\n\t\t\t\tpo from(points[i]);\n\t\t\t\tpo to(points[i + 1]);\n\t\t\t\tlong long int dis = getdis(from, to);\n\t\t\t\tlong long int amax = 1e18, bmax = 1e18;\n\t\t\t\ttree.get_closest(from, amax);\n\t\t\t\ttree.get_closest(to, bmax);\n\t\t\t\tans += min(sqrt(dis), sqrt(amax) + sqrt(bmax));\n\t\t\t}\n\t\t\tcout << ans << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 320,
"memory_kb": 26384,
"score_of_the_acc": -1.1148,
"final_rank": 12
},
{
"submission_id": "aoj_1094_1161556",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nstruct Point{\n\tint x,y,z;\n\tPoint():x(0),y(0),z(0){}\n\tPoint(int x,int y,int z):x(x),y(y),z(z){}\n};\nostream& operator<<(ostream& os,const Point& p){\n\treturn os<<'('<<p.x<<','<<p.y<<','<<p.z<<')';\n}\ndouble Distance(Point a,Point b){\n\tdouble x=a.x-b.x,y=a.y-b.y,z=a.z-b.z;\n\treturn sqrt(x*x+y*y+z*z);\n}\n\ntemplate<typename T> void chmin(T& a,const T& b){a=min(a,b);}\ntemplate<typename T> void chmax(T& a,const T& b){a=max(a,b);}\n\nint main()\n{\n\t#ifndef _GLIBCXX_DEBUG\n\tios_base::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tconstexpr char endl='\\n';\n\t#endif\n\t\n\tfor(int n,q;cin>>n>>q && n|q;){\n\t\tvector<Point> warps(n); // warp\n\t\tfor(auto& p:warps) cin>>p.x>>p.y>>p.z;\n\t\tvector<vector<Point>> paths(q); // path\n\t\trep(i,q){\n\t\t\tint m; cin>>m;\n\t\t\tpaths[i].resize(m);\n\t\t\tfor(auto& p:paths[i]) cin>>p.x>>p.y>>p.z;\n\t\t}\n\t\t\n\t\tPoint offset(INF,INF,INF);\n\t\tfor(auto p:warps)\n\t\t\tchmin(offset.x,p.x),chmin(offset.y,p.y),chmin(offset.z,p.z);\n\t\trep(i,q) for(auto p:paths[i])\n\t\t\tchmin(offset.x,p.x),chmin(offset.y,p.y),chmin(offset.z,p.z);\n\t\tfor(auto& p:warps)\n\t\t\tp.x-=offset.x,p.y-=offset.x,p.z-=offset.z;\n\t\trep(i,q) for(auto& p:paths[i])\n\t\t\tp.x-=offset.x,p.y-=offset.x,p.z-=offset.z;\n\t\t\n\t\tconst int c=cbrt(n/10.+1); // 分割数．1区画あたり10個くらいの点があるように分割する．\n\t\tPoint size(0,0,0); // 1区画あたりの大きさ\n\t\tfor(auto p:warps)\n\t\t\tchmax(size.x,p.x),chmax(size.y,p.y),chmax(size.z,p.z);\n\t\trep(i,q) for(auto p:paths[i])\n\t\t\tchmax(size.x,p.x),chmax(size.y,p.y),chmax(size.z,p.z);\n\t\tsize.x=(size.x+c)/c,size.y=(size.y+c)/c,size.z=(size.z+c)/c;\n\t\t\n\t\ttypedef vector<Point> vp;\n\t\ttypedef vector<vp> vvp;\n\t\ttypedef vector<vvp> vvvp;\n\t\ttypedef vector<vvvp> vvvvp;\n\t\tvvvvp grid(c,vvvp(c,vvp(c)));\n\t\tfor(auto p:warps)\n\t\t\tgrid[p.x/size.x][p.y/size.y][p.z/size.z].push_back(p);\n\t\t\n\t\tfor(auto path:paths){\n\t\t\tvd nears;\n\t\t\tfor(auto p:path){\n\t\t\t\tdouble mn=INF;\n\t\t\t\tint ix=p.x/size.x,iy=p.y/size.y,iz=p.z/size.z;\n\t\t\t\trepi(i,max(ix-1,0),min(ix+2,c))\n\t\t\t\trepi(j,max(iy-1,0),min(iy+2,c))\n\t\t\t\trepi(k,max(iz-1,0),min(iz+2,c))\n\t\t\t\tfor(auto q:grid[i][j][k])\n\t\t\t\t\tmn=min(mn,Distance(p,q));\n\t\t\t\tnears.push_back(mn);\n\t\t\t}\n\t\t\tdouble sum=0;\n\t\t\trep(i,path.size()-1)\n\t\t\t\tsum+=min(Distance(path[i],path[i+1]),nears[i]+nears[i+1]);\n\t\t\tprintf(\"%.9f\\n\",sum);\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 500,
"memory_kb": 5896,
"score_of_the_acc": -0.3126,
"final_rank": 2
},
{
"submission_id": "aoj_1094_1132495",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\n#include<math.h>\nusing namespace std;\npair<long long,pair<long long,long long> > p[110000];\nlong long x[110000];\nlong long y[110000];\nlong long z[110000];\ndouble d[110];\nlong long tx[110];\nlong long ty[110];\nlong long tz[110];\nint main(){\n\tint a,b;\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tfor(int i=0;i<a;i++){\n\t\t\tscanf(\"%lld%lld%lld\",x+i,y+i,z+i);\n\t\t\tp[i]=make_pair(x[i],make_pair(y[i],z[i]));\n\t\t}\n\t\tstd::sort(p,p+a);\n\t\tfor(int i=0;i<a;i++){\n\t\t\tx[i]=p[i].first;\n\t\t\ty[i]=p[i].second.first;\n\t\t\tz[i]=p[i].second.second;\n\t\t}\n\t\twhile(b--){\n\t\t\tint c;scanf(\"%d\",&c);\n\t\t\tfor(int i=0;i<c;i++){\n\t\t\t\tlong long X,Y,Z;\n\t\t\t\tscanf(\"%lld%lld%lld\",&X,&Y,&Z);\n\t\t\t\ttx[i]=X;ty[i]=Y;tz[i]=Z;\n\t\t\t\tint ind=lower_bound(x,x+a,X)-x;\n\t\t\t\tdouble tmp=999999999;\n\t\t\t\tfor(int j=ind;j<a;j++){\n\t\t\t\t\tif((double)(x[j]-X)>tmp)break;\n\t\t\t\t\ttmp=min(tmp,sqrt((x[j]-X)*(x[j]-X)+(y[j]-Y)*(y[j]-Y)+(z[j]-Z)*(z[j]-Z)));\n\t\t\t\t}\n\t\t\t\tfor(int j=ind-1;j>=0;j--){\n\t\t\t\t\tif((double)(X-x[j])>tmp)break;\n\t\t\t\t\ttmp=min(tmp,sqrt((x[j]-X)*(x[j]-X)+(y[j]-Y)*(y[j]-Y)+(z[j]-Z)*(z[j]-Z)));\n\t\t\t\t}\n\t\t\t\td[i]=tmp;\n\t//\t\t\tprintf(\"%f \",d[i]);\n\t\t\t}\n\t\t\tdouble ret=0;\n\t\t\tfor(int i=0;i<c-1;i++){\n\t\t\t\tret+=min(sqrt((tx[i+1]-tx[i])*(tx[i+1]-tx[i])+(ty[i+1]-ty[i])*(ty[i+1]-ty[i])+(tz[i+1]-tz[i])*(tz[i+1]-tz[i])),d[i]+d[i+1]);\n\t\t\t}\n\t\t\tprintf(\"%.12f\\n\",ret);\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 1850,
"memory_kb": 6084,
"score_of_the_acc": -1.0586,
"final_rank": 10
},
{
"submission_id": "aoj_1094_512548",
"code_snippet": "#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<cmath>\n#define INF 1000001LL\n#define INF2 100000001000000LL\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<ll> cord;\n\ninline ll dis(cord &a, cord &b){\n if(a.size() != b.size())return INF2;\n ll res = 0;\n for(int i=0;i<a.size();i++)res += (a[i]-b[i]) * (a[i]-b[i]);\n return res;\n}\n\nstruct KDTree{\n int n,d;\n vector<cord> v;\n\n void heap_sort(int l,int r,int &k){\n if(r-l<=1)return;\n int now,nxt;\n for(int i=1;i<r-l;i++){\n now = i;\n while(now){\n\tnxt = (now-1)>>1;\n\tif(v[l+nxt][k] < v[l+now][k])swap(v[l+nxt],v[l+now]);\n\telse break;\n\tnow = nxt;\n }\n }\n\n for(int i=r-l-1;i>0;i--){\n swap(v[l+i],v[l]);\n now = 0; nxt = (now+1)<<1;\n while(nxt-1 < i){\n\tif(v[l+now][k] < v[l+nxt-1][k]){\n\t if(nxt<i && v[l+nxt-1][k] < v[l+nxt][k]){\n\t swap(v[l+now],v[l+nxt]);\n\t now = nxt;\n\t }else{\n\t swap(v[l+now],v[l+nxt-1]);\n\t now = nxt-1;\n\t }\n\t}else if(nxt<i && v[l+now][k] < v[l+nxt][k]){\n\t swap(v[l+now],v[l+nxt]);\n\t now = nxt;\n\t}else break;\n\tnxt = (now+1)<<1;\n }\n }\n }\n\n void compose(int l, int r, int depth){\n if(r-l<1)return;\n heap_sort(l,r,depth);\n\n compose(l,(l+r)/2,(depth+1)%d);\n compose((l+r)/2+1,r,(depth+1)%d);\n }\n\n void search(int l,int r,vector<ll>& b, cord& p, int depth, ll& dist){\n if(r-l<1)return;\n\n int mid = (l+r)/2;\n ll tmp;\n dist = min(dist,dis(p,v[mid]));\n\n for(int i=0;i<d;i++){\n tmp = b[2*i]-p[i];\n if(tmp>0 && tmp*tmp >= dist)return;\n tmp = b[2*i+1]-p[i];\n if(tmp<0 && tmp*tmp >= dist)return;\n }\n\n for(int i=0;i<3;i++){\n if(p[depth]>v[mid][depth] && i==2)continue;\n if(p[depth]<=v[mid][depth] && i==0)continue;\n int f = i&1;\n tmp = b[2*depth+f];\n b[2*depth+f] = v[mid][depth]; \n if(f)search(l,mid,b,p,(depth+1)%d,dist);\n else search(mid+1,r,b,p,(depth+1)%d,dist);\n b[2*depth+f] = tmp;\n }\n }\n};\n\nint n,q,m;\ncord p(3),r(3);\nKDTree kd;\n\nint main(){\n vector<ll> box;\n for(int i=0;i<3;i++){\n box.push_back(-INF); \n box.push_back(INF);\n }\n\n while(scanf(\"%d%d\",&n,&q)!=EOF,n||q){\n kd.v.resize(n);\n kd.n = n; kd.d = 3;\n\n for(int i=0;i<n;i++){\n kd.v[i].resize(3);\n for(int j=0;j<3;j++)scanf(\"%lld\",&kd.v[i][j]);\n }\n\n kd.compose(0,n,0);\n\n for(int i=0;i<q;i++){\n scanf(\"%d\",&m);\n double ans = 0;\n ll now,prv;\n\n for(int j=0;j<3;j++)scanf(\"%lld\",&p[j]);\n prv = INF2;\n kd.search(0,n,box,p,0,prv);\n\n for(int j=1;j<m;j++){\n\tfor(int k=0;k<3;k++)scanf(\"%lld\",&r[k]);\n\tnow = INF2;\n\tkd.search(0,n,box,r,0,now);\n\n\tans += min( sqrt(prv) + sqrt(now), sqrt(dis(p,r)) );\n\tprv = now; p = r;\n }\n printf(\"%.9lf\\n\",ans);\n }\n }\n}",
"accuracy": 1,
"time_ms": 480,
"memory_kb": 6436,
"score_of_the_acc": -0.3254,
"final_rank": 3
},
{
"submission_id": "aoj_1094_512547",
"code_snippet": "#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<cmath>\n#include<iostream>\n#define INF 1000001LL\n#define INF2 100000001000000LL\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<ll> cord;\n\n#define N 100000\n\nll dis(cord &a, cord &b){\n if(a.size() != b.size())return INF;\n ll res = 0;\n for(int i=0;i<a.size();i++)res += (a[i]-b[i]) * (a[i]-b[i]);\n return res;\n}\n\nstruct KDTree{\n int n,d;\n vector<cord> v;\n\n void heap(int l,int r,int &k){\n if(r-l<=1)return;\n int now,nxt;\n for(int i=1;i<r-l;i++){\n now = i;\n while(now){\n\tnxt = (now-1)>>1;\n\tif(v[l+nxt][k] < v[l+now][k])swap(v[l+nxt],v[l+now]);\n\telse break;\n\tnow = nxt;\n }\n }\n\n for(int i=r-l-1;i>0;i--){\n swap(v[l+i],v[l]);\n now = 0; nxt = (now+1)<<1;\n while(nxt-1 < i){\n\tif(v[l+now][k] < v[l+nxt-1][k]){\n\t if(nxt<i && v[l+nxt-1][k] < v[l+nxt][k]){\n\t swap(v[l+now],v[l+nxt]);\n\t now = nxt;\n\t }else{\n\t swap(v[l+now],v[l+nxt-1]);\n\t now = nxt-1;\n\t }\n\t}else if(nxt<i && v[l+now][k] < v[l+nxt][k]){\n\t swap(v[l+now],v[l+nxt]);\n\t now = nxt;\n\t}else break;\n\tnxt = (now+1)<<1;\n }\n }\n }\n\n void compose(int l, int r, int depth){\n if(r-l<1)return;\n heap(l,r,depth);\n\n compose(l,(l+r)/2,(depth+1)%d);\n compose((l+r)/2+1,r,(depth+1)%d);\n }\n\n void search(int l,int r,vector<ll>& b, cord& p, int depth, ll& dist){\n if(r-l<1)return;\n\n int mid = (l+r)/2;\n ll tmp;\n dist = min(dist,dis(p,v[mid]));\n\n for(int i=0;i<d;i++){\n tmp = b[2*i]-p[i];\n if(tmp>0 && tmp*tmp >= dist)return;\n tmp = b[2*i+1]-p[i];\n if(tmp<0 && tmp*tmp >= dist)return;\n }\n\n for(int i=0;i<3;i++){\n if(p[depth]>v[mid][depth] && i==2)continue;\n if(p[depth]<=v[mid][depth] && i==0)continue;\n int f = i&1;\n tmp = b[2*depth+f];\n b[2*depth+f] = v[mid][depth]; \n if(f)search(l,mid,b,p,(depth+1)%d,dist);\n else search(mid+1,r,b,p,(depth+1)%d,dist);\n b[2*depth+f] = tmp;\n }\n }\n};\n\nint n,q,m;\ncord p(3),r(3);\nKDTree kd;\n\nint main(){\n vector<ll> box;\n for(int i=0;i<3;i++){\n box.push_back(-INF); \n box.push_back(INF);\n }\n\n while(scanf(\"%d%d\",&n,&q)!=EOF,n||q){\n kd.v.resize(n);\n kd.n = n; kd.d = 3;\n\n for(int i=0;i<n;i++){\n kd.v[i].resize(3);\n for(int j=0;j<3;j++)scanf(\"%lld\",&kd.v[i][j]);\n }\n\n kd.compose(0,n,0);\n\n for(int i=0;i<q;i++){\n scanf(\"%d\",&m);\n double ans = 0;\n ll now,prv;\n\n for(int j=0;j<3;j++)scanf(\"%lld\",&p[j]);\n prv = INF2;\n kd.search(0,n,box,p,0,prv);\n\n for(int j=1;j<m;j++){\n\tfor(int k=0;k<3;k++)scanf(\"%lld\",&r[k]);\n\tnow = INF2;\n\tkd.search(0,n,box,r,0,now);\n\n\tans += min( sqrt(prv) + sqrt(now), sqrt(dis(p,r)) );\n\tprv = now; p = r;\n }\n printf(\"%.9lf\\n\",ans);\n }\n }\n}",
"accuracy": 1,
"time_ms": 490,
"memory_kb": 6572,
"score_of_the_acc": -0.3369,
"final_rank": 4
},
{
"submission_id": "aoj_1094_512517",
"code_snippet": "#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<cmath>\n#define INF 1000001LL\n#define INF2 100000001000000LL\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<ll> cord;\n\n#define N 100000\n\nll dis(cord &a, cord &b){\n if(a.size() != b.size())return INF;\n ll res = 0;\n for(int i=0;i<a.size();i++)res += (a[i]-b[i]) * (a[i]-b[i]);\n return res;\n}\n\nstruct KDTree{\n int n,d;\n vector<cord> v,tmp;\n\n void merge(int l,int r,int &k){\n if(r-l<=1)return;\n int mid = (l+r)/2;\n \n merge(l,mid,k); merge(mid,r,k);\n int x=l,y=mid,pos=l;\n\n while(x<mid && y<r){\n if(v[x][k]>v[y][k])tmp[pos++] = v[y++];\n else tmp[pos++] = v[x++];\n }\n while(x<mid)tmp[pos++] = v[x++];\n while(y<r)tmp[pos++] = v[y++];\n \n for(int i=l;i<r;i++)v[i] = tmp[i];\n }\n\n void compose(int l, int r, int depth){\n if(r-l<1)return;\n merge(l,r,depth);\n\n compose(l,(l+r)/2,(depth+1)%d);\n compose((l+r)/2+1,r,(depth+1)%d);\n }\n\n void search(int l,int r,vector<ll>& b, cord& p, int depth, ll& dist){\n if(r-l<1)return;\n\n int mid = (l+r)/2;\n ll tmp;\n dist = min(dist,dis(p,v[mid]));\n\n for(int i=0;i<d;i++){\n tmp = b[2*i]-p[i];\n if(tmp>0 && tmp*tmp >= dist)return;\n tmp = b[2*i+1]-p[i];\n if(tmp<0 && tmp*tmp >= dist)return;\n }\n\n for(int i=0;i<3;i++){\n if(p[depth]>v[mid][depth] && i==2)continue;\n if(p[depth]<=v[mid][depth] && i==0)continue;\n int f = i&1;\n tmp = b[2*depth+f];\n b[2*depth+f] = v[mid][depth]; \n if(f)search(l,mid,b,p,(depth+1)%d,dist);\n else search(mid+1,r,b,p,(depth+1)%d,dist);\n b[2*depth+f] = tmp;\n }\n }\n};\n\nint n,q,m;\ncord p(3),r(3);\nKDTree kd;\n\nint main(){\n vector<ll> box;\n for(int i=0;i<3;i++){\n box.push_back(-INF); \n box.push_back(INF);\n }\n\n while(scanf(\"%d%d\",&n,&q)!=EOF,n||q){\n kd.v.resize(n); kd.tmp.resize(n);\n kd.n = n; kd.d = 3;\n\n for(int i=0;i<n;i++){\n kd.v[i].resize(3);\n for(int j=0;j<3;j++)scanf(\"%lld\",&kd.v[i][j]);\n }\n\n kd.compose(0,n,0);\n\n for(int i=0;i<q;i++){\n scanf(\"%d\",&m);\n double ans = 0;\n ll now,prv;\n\n for(int j=0;j<3;j++)scanf(\"%lld\",&p[j]);\n prv = INF2;\n kd.search(0,n,box,p,0,prv);\n\n for(int j=1;j<m;j++){\n\tfor(int k=0;k<3;k++)scanf(\"%lld\",&r[k]);\n\tnow = INF2;\n\tkd.search(0,n,box,r,0,now);\n\n\tans += min( sqrt(prv) + sqrt(now), sqrt(dis(p,r)) );\n\tprv = now; p = r;\n }\n printf(\"%.9lf\\n\",ans);\n }\n }\n}",
"accuracy": 1,
"time_ms": 620,
"memory_kb": 11936,
"score_of_the_acc": -0.6437,
"final_rank": 6
},
{
"submission_id": "aoj_1094_512499",
"code_snippet": "#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<cmath>\n#define INF 1000001LL\n#define INF2 100000001000000LL\nusing namespace std;\n\ntypedef long long ll;\n\n#define N 100000\n\nstruct cord{\n int d;\n vector<ll> c;\n cord(void){d = 0;c.clear();}\n cord(vector<ll> v){d = v.size(); c = v;}\n\n ll dis(cord &a){\n if(a.d != d)return INF;\n ll res = 0;\n for(int i=0;i<d;i++)res += (a.c[i]-c[i]) * (a.c[i]-c[i]);\n return res;\n }\n};\n\nstruct KDTree{\n int n,d;\n vector<cord> v,tmp;\n\n KDTree(void){n = d = 0;v.clear();}\n KDTree(vector<cord> x){\n n = x.size();\n if(!n)return;\n d = x[0].c.size();\n if(!d)return;\n v = x;\n tmp.resize(n);\n compose(0,n,0);\n }\n\n void merge(int l,int r,int k){\n if(r-l<=1)return;\n int mid = (l+r)/2;\n \n merge(l,mid,k); merge(mid,r,k);\n int x=l,y=mid,pos=l;\n\n while(x<mid && y<r){\n if(v[x].c[k]>v[y].c[k])tmp[pos++] = v[y++];\n else tmp[pos++] = v[x++];\n }\n while(x<mid)tmp[pos++] = v[x++];\n while(y<r)tmp[pos++] = v[y++];\n \n for(int i=l;i<r;i++)v[i] = tmp[i];\n }\n\n void compose(int l, int r, int depth){\n if(r-l<1)return;\n merge(l,r,depth);\n\n compose(l,(l+r)/2,(depth+1)%d);\n compose((l+r)/2+1,r,(depth+1)%d);\n }\n\n void search(int l,int r,vector<ll>& b, cord& p, int depth, ll& dist){\n if(r-l<1)return;\n\n int mid = (l+r)/2;\n ll tmp;\n dist = min(dist,p.dis(v[mid]));\n\n for(int i=0;i<d;i++){\n tmp = b[2*i]-p.c[i];\n if(tmp>0 && tmp*tmp >= dist)return;\n tmp = b[2*i+1]-p.c[i];\n if(tmp<0 && tmp*tmp >= dist)return;\n }\n\n for(int i=0;i<3;i++){\n if(p.c[depth]>v[mid].c[depth] && i==2)continue;\n if(p.c[depth]<=v[mid].c[depth] && i==0)continue;\n int f = i&1;\n tmp = b[2*depth+f];\n b[2*depth+f] = v[mid].c[depth]; \n if(f)search(l,mid,b,p,(depth+1)%d,dist);\n else search(mid+1,r,b,p,(depth+1)%d,dist);\n b[2*depth+f] = tmp;\n }\n }\n};\n\nint n,q,m;\nvector<cord> v;\ncord p,r;\nvector<ll> tmp; \n\nint main(){\n vector<ll> box;\n for(int i=0;i<3;i++){\n box.push_back(-INF); \n box.push_back(INF);\n }\n\n while(scanf(\"%d%d\",&n,&q)!=EOF,n||q){\n v.resize(n); tmp.resize(3);\n\n for(int i=0;i<n;i++){\n for(int j=0;j<3;j++)scanf(\"%lld\",&tmp[j]);\n v[i] = cord(tmp);\n }\n\n KDTree kd(v);\n\n for(int i=0;i<q;i++){\n scanf(\"%d\",&m);\n double ans = 0;\n ll now,prv;\n\n for(int j=0;j<3;j++)scanf(\"%lld\",&tmp[j]);\n p = cord(tmp); prv = INF2;\n kd.search(0,n,box,p,0,prv);\n\n for(int j=1;j<m;j++){\n\tfor(int k=0;k<3;k++)scanf(\"%lld\",&tmp[k]);\n\tr = cord(tmp); now = INF2;\n\tkd.search(0,n,box,r,0,now);\n\n\tans += min(sqrt(prv) + sqrt(now), sqrt(p.dis(r)) );\n\tprv = now; p = r;\n }\n printf(\"%.9lf\\n\",ans);\n }\n }\n}",
"accuracy": 1,
"time_ms": 690,
"memory_kb": 25824,
"score_of_the_acc": -1.2923,
"final_rank": 15
},
{
"submission_id": "aoj_1094_511115",
"code_snippet": "#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<cmath>\n#define INF 1000001LL\n#define INF2 100000001000000LL\nusing namespace std;\n\ntypedef long long ll;\n\nstruct cord{\n int d,k;\n vector<ll> c;\n cord(void){d = k = 0;c.clear();}\n cord(vector<ll> v){d = v.size(); k = 0; c = v;}\n bool operator<(const cord a)const{return c[k]<a.c[k];}\n\n ll dis(cord &a){\n if(a.d != d)return INF;\n ll res = 0;\n for(int i=0;i<d;i++)res += (a.c[i]-c[i]) * (a.c[i]-c[i]);\n return res;\n }\n};\n\nstruct KDTree{\n int n,d;\n vector<cord> v;\n\n KDTree(void){n = d = 0;v.clear();}\n KDTree(vector<cord> x){\n n = x.size();\n if(!n)return;\n d = x[0].c.size();\n if(!d)return;\n v = x;\n compose(0,n,0);\n }\n\n void compose(int l, int r, int depth){\n if(r-l<1)return;\n for(int i=l;i<r;i++)v[i].k = depth;\n sort(v.begin()+l,v.begin()+r);\n\n compose(l,(l+r)/2,(depth+1)%d);\n compose((l+r)/2+1,r,(depth+1)%d);\n }\n\n void search(int l,int r,vector<ll>& b, cord& p, int depth, ll& dist){\n if(r-l<1)return;\n\n int mid = (l+r)/2;\n ll tmp;\n dist = min(dist,p.dis(v[mid]));\n\n for(int i=0;i<d;i++){\n tmp = b[2*i]-p.c[i];\n if(tmp>0 && tmp*tmp >= dist)return;\n tmp = b[2*i+1]-p.c[i];\n if(tmp<0 && tmp*tmp >= dist)return;\n }\n\n for(int i=0;i<3;i++){\n if(p.c[depth]>v[mid].c[depth] && i==2)continue;\n if(p.c[depth]<=v[mid].c[depth] && i==0)continue;\n int f = i&1;\n tmp = b[2*depth+f];\n b[2*depth+f] = v[mid].c[depth]; \n if(f)search(l,mid,b,p,(depth+1)%d,dist);\n else search(mid+1,r,b,p,(depth+1)%d,dist);\n b[2*depth+f] = tmp;\n }\n }\n};\n\nint n,q,m;\nvector<cord> v;\ncord p,r;\nvector<ll> tmp; \n\nint main(){\n vector<ll> box;\n for(int i=0;i<3;i++){\n box.push_back(-INF); \n box.push_back(INF);\n }\n\n while(scanf(\"%d%d\",&n,&q)!=EOF,n||q){\n v.resize(n); tmp.resize(3);\n\n for(int i=0;i<n;i++){\n for(int j=0;j<3;j++)scanf(\"%lld\",&tmp[j]);\n v[i] = cord(tmp);\n }\n\n KDTree kd(v);\n\n for(int i=0;i<q;i++){\n scanf(\"%d\",&m);\n double ans = 0;\n ll now, prv;\n\n for(int j=0;j<3;j++)scanf(\"%lld\",&tmp[j]);\n p = cord(tmp); prv = INF2;\n kd.search(0,n,box,p,0,prv);\n\n for(int j=1;j<m;j++){\n\tfor(int k=0;k<3;k++)scanf(\"%lld\",&tmp[k]);\n\tr = cord(tmp); now = INF2;\n\tkd.search(0,n,box,r,0,now);\n\n\tans += min(sqrt(prv) + sqrt(now), sqrt(p.dis(r)) );\n\tprv = now; p = r;\n }\n printf(\"%.9lf\\n\",ans);\n }\n }\n}",
"accuracy": 1,
"time_ms": 1110,
"memory_kb": 19556,
"score_of_the_acc": -1.2463,
"final_rank": 14
},
{
"submission_id": "aoj_1094_511062",
"code_snippet": "#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<cmath>\n#define INF 1000001LL\n#define INF2 100000001000000LL\nusing namespace std;\n\ntypedef long long ll;\n\nstruct cord{\n int d,k;\n vector<ll> c;\n cord(void){d = k = 0;c.clear();}\n cord(vector<ll> v){d = v.size(); k = 0; c = v;}\n bool operator<(const cord a)const{return c[k]<a.c[k];}\n\n ll dis(cord &a){\n if(a.d != d)return INF;\n ll res = 0;\n for(int i=0;i<d;i++)res += (a.c[i]-c[i]) * (a.c[i]-c[i]);\n return res;\n }\n};\n\nstruct KDTree{\n int n,d;\n vector<cord> v;\n\n KDTree(void){n = d = 0;v.clear();}\n KDTree(vector<cord> x){\n n = x.size();\n if(!n)return;\n d = x[0].c.size();\n if(!d)return;\n v = x;\n compose(0,n,0);\n }\n\n void compose(int l, int r, int depth){\n if(r-l<1)return;\n for(int i=l;i<r;i++)v[i].k = depth;\n sort(v.begin()+l,v.begin()+r);\n\n compose(l,(l+r)/2,(depth+1)%d);\n compose((l+r)/2+1,r,(depth+1)%d);\n }\n\n void search(int l,int r,vector<ll>& b, cord& p, int depth, ll& dist){\n if(r-l<1)return;\n\n int mid = (l+r)/2;\n dist = min(dist,p.dis(v[mid]));\n for(int i=0;i<d;i++){\n if(b[2*i]>p.c[i] && (b[2*i]-p.c[i])*(b[2*i]-p.c[i]) >= dist)return;\n else if(b[2*i+1]<p.c[i] && (b[2*i+1]-p.c[i])*(b[2*i+1]-p.c[i]) >= dist)return;\n }\n\n ll tmp;\n if(p.c[depth]>v[mid].c[depth]){\n tmp = b[2*depth];\n b[2*depth] = v[mid].c[depth]; \n search(mid+1,r,b,p,(depth+1)%d,dist);\n b[2*depth] = tmp;\n }\n\n tmp = b[2*depth+1];\n b[2*depth+1] = v[mid].c[depth]; \n search(l,mid,b,p,(depth+1)%d,dist);\n b[2*depth+1] = tmp;\n\n if(p.c[depth]<=v[mid].c[depth]){\n tmp = b[2*depth];\n b[2*depth] = v[mid].c[depth]; \n search(mid+1,r,b,p,(depth+1)%d,dist);\n b[2*depth] = tmp;\n }\n }\n};\n\nint n,q,m;\nvector<cord> v;\ncord p,r;\nvector<ll> tmp; \n\nint main(){\n vector<ll> box;\n for(int i=0;i<3;i++){\n box.push_back(-INF); \n box.push_back(INF);\n }\n\n while(scanf(\"%d%d\",&n,&q)!=EOF,n||q){\n v.resize(n); tmp.resize(3);\n\n for(int i=0;i<n;i++){\n for(int j=0;j<3;j++)scanf(\"%lld\",&tmp[j]);\n v[i] = cord(tmp);\n }\n\n KDTree kd(v);\n\n for(int i=0;i<q;i++){\n scanf(\"%d\",&m);\n double ans = 0;\n ll now, prv;\n\n for(int j=0;j<3;j++)scanf(\"%lld\",&tmp[j]);\n p = cord(tmp); prv = INF2;\n kd.search(0,n,box,p,0,prv);\n\n for(int j=1;j<m;j++){\n\tfor(int k=0;k<3;k++)scanf(\"%lld\",&tmp[k]);\n\tr = cord(tmp); now = INF2;\n\tkd.search(0,n,box,r,0,now);\n\n\tans += min(sqrt(prv) + sqrt(now), sqrt(p.dis(r)) );\n\tprv = now; p = r;\n }\n printf(\"%.9lf\\n\",ans);\n }\n }\n}",
"accuracy": 1,
"time_ms": 1070,
"memory_kb": 19556,
"score_of_the_acc": -1.2245,
"final_rank": 13
},
{
"submission_id": "aoj_1094_511037",
"code_snippet": "#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<map>\n#include<iostream>\n#include<cmath>\n#define INF 1000001LL\n#define INF2 100000001000000LL\nusing namespace std;\n\ntypedef long long ll;\n\nstruct cord{\n int d,k;\n vector<ll> c;\n cord(void){d = k = 0;c.clear();}\n cord(vector<ll> v){d = v.size(); k = 0; c = v;}\n bool operator<(const cord a)const{return c[k]<a.c[k];}\n bool operator==(const cord a)const{return c==a.c;}\n};\n\nll dis(cord a, cord b){\n if(a.d != b.d)return INF;\n ll res = 0;\n for(int i=0;i<a.d;i++)res += (a.c[i]-b.c[i]) * (a.c[i]-b.c[i]);\n return res;\n}\n\nstruct KDTree{\n int n,d,root;\n vector<cord> v;\n\n KDTree(void){n = d = root = 0;v.clear();}\n\n KDTree(vector<cord> x){\n n = x.size();\n if(!n)return;\n d = x[0].c.size();\n if(!d)return;\n v = x;\n compose(0,n,0);\n }\n\n void compose(int l, int r, int depth){\n if(r-l<=1)return;\n for(int i=l;i<r;i++)v[i].k = depth;\n sort(v.begin()+l,v.begin()+r);\n\n compose(l,(l+r)/2,(depth+1)%d);\n compose((l+r)/2+1,r,(depth+1)%d);\n }\n\n inline void search(int l,int r,vector<ll> &rng, cord p, int depth, ll &dist){\n if(r-l<1)return;\n\n int mid = (l+r)/2;\n dist = min(dist,dis(p,v[mid]));\n for(int i=0;i<d;i++){\n if(rng[2*i]>p.c[i] && (rng[2*i]-p.c[i])*(rng[2*i]-p.c[i]) >= dist)return;\n else if(rng[2*i+1]<p.c[i] && (rng[2*i+1]-p.c[i])*(rng[2*i+1]-p.c[i]) >= dist)return;\n }\n\n ll tmp,nxt[4],st[] = {0,1},d1,d2;\n nxt[0] = mid+1; nxt[1] = r; nxt[2] = l; nxt[3] = mid;\n\n if(p.c[depth]<v[mid].c[depth]){\n swap(nxt[0],nxt[2]);\n swap(nxt[1],nxt[3]);\n swap(st[0],st[1]);\n }\n \n for(int i=0;i<2;i++){\n tmp = rng[2*depth+st[i]];\n rng[2*depth+st[i]] = v[mid].c[depth]; \n search(nxt[2*i],nxt[2*i+1],rng,p,(depth+1)%d,dist);\n rng[2*depth+st[i]] = tmp;\n }\n }\n};\n\nint n,q,m;\nvector<cord> v;\ncord p,r;\nvector<ll> tmp; \n\nint main(){\n vector<ll> range;\n for(int i=0;i<3;i++){\n range.push_back(-INF); \n range.push_back(INF);\n }\n\n while(scanf(\"%d%d\",&n,&q)!=EOF,n||q){\n v.resize(n); tmp.resize(3);\n\n for(int i=0;i<n;i++){\n for(int j=0;j<3;j++)scanf(\"%lld\",&tmp[j]);\n v[i] = cord(tmp);\n }\n\n KDTree kd(v);\n\n for(int i=0;i<q;i++){\n scanf(\"%d\",&m);\n double ans = 0;\n ll now, prv;\n\n for(int j=0;j<3;j++)scanf(\"%lld\",&tmp[j]);\n p = cord(tmp); prv = INF2;\n kd.search(0,n,range,p,0,prv);\n for(int j=1;j<m;j++){\n\tfor(int k=0;k<3;k++)scanf(\"%lld\",&tmp[k]);\n\n\tr = cord(tmp); now = INF2;\n\tkd.search(0,n,range,r,0,now);\n\tans += min(sqrt(prv) + sqrt(now), sqrt(dis(p,r)) );\n\tprv = now; p = r;\n }\n printf(\"%.9lf\\n\",ans);\n }\n }\n}",
"accuracy": 1,
"time_ms": 1850,
"memory_kb": 19700,
"score_of_the_acc": -1.657,
"final_rank": 16
},
{
"submission_id": "aoj_1094_502795",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <complex>\n#include <algorithm>\nusing namespace std;\nstruct P{\n\tdouble x,y,z;\n\tP(double x,double y,double z) : x(x) , y(y) , z(z) {}\n\tP(){x=y=z=0;}\n};\n\nbool operator < (const P &a,const P &b){\n\treturn a.x < b.x;\n}\n\nP p[100000];\nP q[100];\n\ndouble dist[100];\nint n,Q;\n\nvoid calc(int idx){\n\tdist[idx] = 1e15;\n\t/*for(int i = 0 ; i < n ; i++){\n\t\tdouble dx = (p[i].x-q[idx].x)*(p[i].x-q[idx].x);\n\t\tdouble dy = (p[i].y-q[idx].y)*(p[i].y-q[idx].y);\n\t\tdouble dz = (p[i].z-q[idx].z)*(p[i].z-q[idx].z);\t\n\t\tdist[idx] = min( dist[idx] , sqrt(dx+dy+dz) );\n\t}*/\n\tint s = lower_bound(p,p+n,q[idx]) - p;\n\tfor(int i = s ; i < n && abs(p[i].x-q[idx].x) < dist[idx] ; i++){\n\t\tdouble dx = (p[i].x-q[idx].x)*(p[i].x-q[idx].x);\n\t\tdouble dy = (p[i].y-q[idx].y)*(p[i].y-q[idx].y);\n\t\tdouble dz = (p[i].z-q[idx].z)*(p[i].z-q[idx].z);\t\n\t\tdist[idx] = min( dist[idx] , sqrt(dx+dy+dz) );\n\t}\n\tfor(int i = s-1 ; i >= 0 && abs(p[i].x-q[idx].x) < dist[idx] ; i--){\n\t\tdouble dx = (p[i].x-q[idx].x)*(p[i].x-q[idx].x);\n\t\tdouble dy = (p[i].y-q[idx].y)*(p[i].y-q[idx].y);\n\t\tdouble dz = (p[i].z-q[idx].z)*(p[i].z-q[idx].z);\t\n\t\tdist[idx] = min( dist[idx] , sqrt(dx+dy+dz) );\n\t}\n}\n\nint main(){\n\twhile(cin >> n >> Q&& n){\n\t\tfor(int i = 0 ; i < n ; i++) scanf(\"%lf%lf%lf\",&p[i].x,&p[i].y,&p[i].z);\n\t\tsort(p,p+n);\n\t\twhile(Q--){\n\t\t\tint m;\n\t\t\tcin >> m;\n\t\t\tfor(int i = 0 ; i < m ; i++){\n\t\t\t\tscanf(\"%lf%lf%lf\",&q[i].x,&q[i].y,&q[i].z);\n\t\t\t\tcalc(i);\n\t\t\t}\n\t\t\tdouble res = 0;\n\t\t\tfor(int i = 1 ; i < m ; i++){\n\t\t\t\tdouble dx = (q[i].x-q[i-1].x)*(q[i].x-q[i-1].x);\n\t\t\t\tdouble dy = (q[i].y-q[i-1].y)*(q[i].y-q[i-1].y);\n\t\t\t\tdouble dz = (q[i].z-q[i-1].z)*(q[i].z-q[i-1].z);\n\t\t\t\t\n\t\t\t\tres += min( dist[i] + dist[i-1] , sqrt(dx+dy+dz) );\n\t\t\t}\n\t\t\tprintf(\"%.10lf\\n\",res);\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 1660,
"memory_kb": 3632,
"score_of_the_acc": -0.847,
"final_rank": 9
},
{
"submission_id": "aoj_1094_500869",
"code_snippet": "#include<iostream>\n#include<climits>\n#include<cassert>\n#include<algorithm>\n#include<cmath>\n#include<vector>\n#include<cstdlib>\n#include<functional>\n#include<iomanip>\n#include<cstdio>\n#include<set>\n\nusing namespace std;\n\nconst double inf = 1e80;\n\nstruct point3d{\n\n long long x,y,z;\n\n point3d():x(0),y(0),z(0){}\n point3d(long long x, long long y, long long z):x(x),y(y),z(z){}\n\n inline bool compare(int d, const point3d &t) const {\n if( d == 0 ){\n return x < t.x;\n }else if( d == 1 ){\n return y < t.y;\n }else if( d == 2 ){\n return z < t.z;\n }\n return false;\n }\n\n inline bool operator<(const point3d &t) const {\n if(x!=t.x)return x<t.x;\n if(y!=t.y)return y<t.y;\n if(z!=t.z)return z<t.z;\n return false;\n }\n \n inline long long dist2(const point3d &t) const {\n long long ret = (x-t.x)*(x-t.x) + (y-t.y) * (y-t.y) + (z-t.z) * (z-t.z);\n return ret;\n }\n\n inline long long ddist2(int d, const point3d &t)const{\n if( d == 0 ){\n return (x-t.x) * (x-t.x);\n }else if( d == 1 ){\n return (y-t.y) * (y-t.y);\n }else if( d == 2 ){\n return (z-t.z) * (z-t.z);\n }return 0;\n }\n \n};\n\ninline bool comp_x(const point3d &a, const point3d &b){return a.x<b.x;}\ninline bool comp_y(const point3d &a, const point3d &b){return a.y<b.y;}\ninline bool comp_z(const point3d &a, const point3d &b){return a.z<b.z;}\n\n\nlong long call = 0;\n\nstruct kdtree{\n\n struct node{\n point3d p;\n node *l;\n node *r;\n node(const point3d &p) : p(p), l(NULL), r(NULL){}\n }*root;\n\n kdtree() : root(NULL) { }\n\n void insert(const point3d &p){\n root = insert( root, 0, p );\n }\n\n node *insert(node *t, int d, const point3d &p){\n ++call;\n if( t == NULL ) return new node(p);\n if( p.compare(d,t->p) )\n t->l = insert(t->l, (d+1)%3, p);\n else\n t->r = insert(t->r, (d+1)%3, p);\n return t;\n }\n\n node * build(int d, point3d ps[], int l, int r){\n if(l+1==r){\n return new node(ps[l]);\n }\n if(d==0){\n sort(ps+l,ps+r,comp_x);\n }else if(d==1){\n sort(ps+l,ps+r,comp_y);\n }else if(d==2){\n sort(ps+l,ps+r,comp_z);\n }\n int m = (l+r)/2;\n node * ret = new node(ps[m]);\n if(m>l)\n ret->l = build((d+1)%3,ps,l,m);\n if(r>m+1)\n ret->r = build((d+1)%3,ps,m+1,r);\n return ret;\n }\n\n long long best;\n node * best_near;\n point3d nearest(const point3d &p){\n best = 1LL<<55;\n best_near = NULL;\n nearest(root,0,p);\n return best_near->p;\n }\n \n void nearest(node *cur, int d, const point3d &p){\n ++call;\n bool bc = p.compare(d,cur->p);\n node * next = bc ? cur->l : cur->r;\n node * next_anoc = bc ? cur->r : cur->l;\n\n // refresh\n if( best > p.dist2(cur->p) ){\n best = p.dist2(cur->p);\n best_near = cur;\n }\n\n // down\n if( next ){\n nearest(next,(d+1)%3, p);\n }\n\n // refresh\n if( best > p.dist2(cur->p) ){\n best = p.dist2(cur->p);\n best_near = cur;\n }\n \n if( best >= p.ddist2(d,cur->p) ){\n // down another\n if( next_anoc ){\n nearest(next_anoc, (d+1)%3, p);\n }\n }\n \n // up\n return ;\n }\n\n void calc_depth(node *t, int cur_depth, int &depth){\n depth=max(depth,cur_depth);\n if(t==NULL)return ;\n calc_depth(t->l,cur_depth+1,depth);\n calc_depth(t->r,cur_depth+1,depth);\n }\n\n};\n\nnamespace std{\n ostream &operator<<(ostream &o, const point3d &t){\n o << '(' << t.x << ',' << t.y << ',' << t.z <<')';\n return o;\n }\n}\n\nint main()\n{\n int n,q;\n // while( scanf(\"%d%d\", &n, &q) != EOF ){\n while(cin >> n >> q){\n if( n == 0 && q == 0 ) break;\n kdtree kd;\n point3d *ary = new point3d[n];\n \n for(int i = 0; i < n; ++i){\n cin >> ary[i].x >> ary[i].y >> ary[i].z;\n }\n kd.root = kd.build(0,ary,0,n);\n\n // m q n^(2/3)\n\n // int depth = 0;\n // kd.calc_depth(kd.root,0,depth);\n // cout <<\"Depth : \" << depth << endl;\n\n call = 0;\n int m;\n for(int qq = 0; qq < q; ++qq){\n double res = 0;\n vector<point3d> route;\n\n // scanf(\"%d\", &m);\n cin >> m;\n\n for(int i = 0; i < m; ++i){\n int x,y,z;\n // scanf(\"%d %d %d\", &x, &y, &z);\n cin >> x >> y >> z;\n route.push_back(point3d(x,y,z));\n }\n\n\n for(int i = 0; i < (int)route.size()-1; ++i){\n point3d cur = route[i];\n point3d next = route[1+i];\n \n // call = 0;\n point3d nw1 = kd.nearest( cur );\n point3d nw2 = kd.nearest( next );\n\n // cout << call << ' ' << 2*3*pow(n,0.66666) << endl;\n \n double d0 = sqrt( cur.dist2(next) );\n double d1 = sqrt( cur.dist2(nw1) );\n double d2 = sqrt( next.dist2(nw2) );\n double d = min( d0, d1 + d2 );\n res += d;\n \n }\n \n printf(\"%.9lf\\n\", res);\n }\n \n // 11006221817\n // 1.29e09 = 1290000000\n\n // cout << \"Total Call 2 : \" << call << ' ' << m*q*2*(long long)3*pow(n,0.66666) << endl;\n // cout << \"(ratio): \" << (call / (double)(2*m*q*lgn) * 100) << \" %\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 400,
"memory_kb": 8280,
"score_of_the_acc": -0.3628,
"final_rank": 5
}
] |
aoj_1095_cpp
|
KND Factory
Problem
KND君は会津大学に在籍する学生プログラマである。彼の住む町の周辺には
N
個の町がある。彼は生クリームが大好きなので毎日生クリームを食べるためにある町に工場を建設した。その工場では毎日
F
リットルの生クリームが製造される。生クリームは運ぶたびに、移動元の町の気温と移動先の町の気温の絶対差だけ傷んでしまう。困ったことにこの近辺の町の気温は寒暖計によって計測できない。しかしながら調査によって、それぞれの町の気温を変数とした
N
個の一次方程式からなる
N
元一次連立方程式を導くことができた。あなたはこれを解くことによって各町の気温を知ることができる。また、ある町から他の町へ生クリームを運搬するにはパイプラインを用いる。パイプラインは一日に送ることのできる生クリームの量が限られている。一日に
F
リットルの生クリームを工場がある町
s
からKND君が住む町
t
へ生クリームをなるべく良い状態で送りたい。町には0から始まる番号がつけられているものとする。方程式の各項は高々ひとつの変数からなり定数項がひとつある。
F
リットルの生クリームはどのような運び方をしても一日以内で任意の町へ送られる。
Input
入力は複数のテストケースからなる。ひとつのテストケースは以下の形式で与えられる。テストケースの数は入力として与えられる。
T
N
s
t
F
a
1,1
a
1,2
...
a
1,N
c
1
a
2,1
a
2,2
...
a
2,N
c
2
...
a
N,1
a
N,2
...
a
N,N
c
N
M
1
d
1,1
d
1,2
...
d
1,M
1
f
1,1
f
1,2
...
f
1,M
1
M
2
d
2,1
d
2,2
...
d
2,M
2
f
2,1
f
2,2
...
f
2,M
2
...
M
N
d
N,1
d
N,2
...
d
N,M
2
f
N,1
f
N,2
...
f
N,M
2
ここで、
T
:テストケースの数
N
:町の数
s
:工場のある町
t
:KND君の住む町
F
:一日に作られる生クリームの量
a
i,j
:連立方程式の未知数としてのi番目の方程式中でj番目の町の気温にかかる係数。もし
a
i,j
=0ならj番目の町の気温はこの方程式に現れないことになる。以下の例も参照してほしい。
c
i
:i番目の方程式の定数項
M
i
:i番目の町が持っている生クリームを移動させる機械の数
d
i,j
:i番目の町が持っているj番目の機械が生クリームを移動させる先の町
f
i,j
:i番目の町が持っているj番目の機械が生クリームを1日に移動させられるリットル量
である。
N
元一次連立方程式を表す行列の入力例:
a + b = 6 1 1 0 6
3a + 2b + c = 10 => 3 2 1 10
a - 2b + 3c = 6 1 -2 3 6
a,b,cが町0,1,2の気温を表す。
Constraints
入力は以下の条件を満たす。
入力はすべて整数。
0 <
T
≤ 40
2 <
N
≤ 100
0 ≤
s
<
N
0 ≤
t
<
N
s
≠
t
0 <
F
≤ 1000
0 ≤
M
i
≤
N
-1000 ≤
a
i,j
≤ 1000
0 ≤
f
i,j
< 1000
それぞれの町の気温は一意に定まる。
Output
各テストケースにつき、一日に
F
リットルの生クリームを工場がある町
s
からKND君が住む町
t
に運んだとき、生クリームの傷みの和を最小化した値を一行で出力せよ。この値はジャッジ出力の値と10
-5
より大きい差を持ってはならない。また、町
s
から町
t
へ
F
リットルの生クリームを一日に運べない場合はimpossibleを一行で出力せよ。
Sample Input
3
3 0 2 5
1 1 1 6
3 2 1 10
1 -2 3 6
2
1 2
3 3
1
2
3
0
3 0 2 5
1 1 1 6
3 2 1 10
1 -2 3 6
2
1 2
2 2
1
2
2
0
10 2 7 20
8 9 -5 6 -9 5 1 0 4 9 4
3 -1 -8 0 -5 4 3 0 -3 2 4
-4 5 8 -4 1 -8 -6 3 3 5 -7
-7 0 2 5 8 -5 -9 -8 1 -2 -1
3 8 1 -3 8 2 -5 8 -3 4 -4
-2 5 0 -2 -4 4 -3 9 6 -1 -2
4 1 2 -9 3 5 6 -4 4 -1 -4
-4 6 6 9 -2 1 -9 -3 -7 3 -4
1 -1 6 3 1 -5 9 5 -5 -9 -5
-7 4 6 8 8 4 -4 4 -7 -8 -5
5
1 5 0 6 3
15 17 14 7 15
3
1 5 7
6 8 14
10
3 5 3 5 9 5 9 5 1 4
12 6 16 11 16 7 9 3 13 13
10
9 1 5 6 2 5 8 5 9 4
15 8 8 14 13 13 18 1 12 11
5
3 5 0 4 6
14 15 4 14 11
9
5 0 6 2 7 8 8 6 6
6 5 7 17 17 17 17 19 3
9
7 7 2 7 8 4 7 7 0
4 13 16 10 19 17 19 12 19
3
1 5 1
3 7 16
8
5 7 4 9 1 4 6 8
4 3 6 12 6 19 10 1
4
1 3 6 3
5 15 18 14
Sample Output
10.0000000000
impossible
11.9354380207
|
[
{
"submission_id": "aoj_1095_9281098",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\n#include <iomanip>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\nstruct MCF {\nprivate:\n const long long inf = 1e18;\n vector<long long> dist; //最短距離(費用)\n vector<int> pv, pe; //直前の頂点、辺 \n\npublic:\n struct edge {\n int to, rev; long long cap, cost;\n edge(int t = 0, int r = 0, long long ca = 0, long long co = 0)\n : to(t), rev(r), cap(ca), cost(co) {}\n };\n\n struct pii {\n long long d; int v; //最短距離(費用)、頂点番号\n pii(long long d_ = 0, int v_ = 0) : d(d_), v(v_) {}\n\n bool operator<(const pii& other) const {\n if (d != other.d) return d < other.d;\n return v < other.v;\n }\n\n bool operator>(const pii& other) const {\n if (d != other.d) return d > other.d;\n return v > other.v;\n }\n };\n\n int n;\n vector<vector<edge>> to;\n vector<long long> pot; //ポテンシャル\n\n MCF(int n_ = 1) : n(n_), to(n_), pot(n_), dist(n_), pv(n_), pe(n_) {}\n\n void addedge(int u, int v, long long cap, long long cost) {\n int su = (int)to[u].size();\n int sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap, cost });\n to[v].push_back({ u, su, 0, -cost });\n }\n\n //s->tへ流量fの最小費用流、流せないときは-1\n long long mincostflow(int s, int t, long long f) {\n long long res = 0;\n pot.assign(n, 0);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return -1; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n long long nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf;\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return res;\n }\n\n //s->tへ流量fの最小費用流、流せないときは費用と流せなかった流量のペア\n pair<long long, long long> mincostflow_pair(int s, int t, long long f) {\n long long res = 0;\n pot.assign(n, 0);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return { res, f }; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n long long nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf;\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return { res, f };\n }\n};\n\nvoid inv(int n, vii<double>& a) {\n rep(k, n) {\n double mx = a[k][k]; \n int idx = k;\n for(int i = k + 1; i < n; i++) if (abs(a[i][k]) > mx) {\n idx = i;\n mx = abs(a[i][k]);\n }\n swap(a[k], a[idx]);\n\n for(int j = n; j >= k; j--) a[k][j] /= a[k][k];\n\n rep(i, n) {\n if (i == k) continue;\n for (int j = n; j >= k; j--) {\n a[i][j] -= a[i][k] * a[k][j];\n }\n }\n }\n\n}\n\nvoid solve() {\n int n, s, t, F;\n cin >> n >> s >> t >> F;\n vii<double> a(n, vi<double>(n + 1));\n rep(i, n) rep(j, n + 1) cin >> a[i][j];\n\n vii<double> b = a;\n inv(n, a);\n\n MCF mcf(n + 2);\n int S = n, T = n + 1;\n mcf.addedge(S, s, F, 0);\n mcf.addedge(t, T, F, 0); \n\n ll mul = 1e10;\n auto diftemp = [&](int i, int j) { return (ll)(abs(a[i][n] - a[j][n]) * mul); };\n\n rep(i, n) {\n int m;\n cin >> m;\n vi<int> d(m), f(m);\n rep(j, m) cin >> d[j];\n rep(j, m) cin >> f[j];\n rep(j, m) mcf.addedge(i, d[j], f[j], diftemp(i, d[j]));\n }\n double ans = mcf.mincostflow(S, T, F);\n if (ans == -1) cout << \"impossible\" << endl;\n else cout << fixed << setprecision(12) << (double)ans / mul << endl;\n}\n\nint main()\n{\n int t;\n cin >> t; \n while (t--) solve();\n return 0;\n}",
"accuracy": 1,
"time_ms": 290,
"memory_kb": 4188,
"score_of_the_acc": -1.0601,
"final_rank": 17
},
{
"submission_id": "aoj_1095_9281026",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\n#include <iomanip>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\nstruct MCF {\nprivate:\n const double inf = 1e18;\n vector<double> dist; //最短距離(費用)\n vector<int> pv, pe; //直前の頂点、辺 \n\npublic:\n struct edge {\n int to, rev; long long cap; double cost;\n edge(int t = 0, int r = 0, long long ca = 0, double co = 0)\n : to(t), rev(r), cap(ca), cost(co) {}\n };\n\n struct pii {\n double d; int v; //最短距離(費用)、頂点番号\n pii(double d_ = 0, int v_ = 0) : d(d_), v(v_) {}\n\n bool operator<(const pii& other) const {\n if (d != other.d) return d < other.d;\n return v < other.v;\n }\n\n bool operator>(const pii& other) const {\n if (d != other.d) return d > other.d;\n return v > other.v;\n }\n };\n\n int n;\n vector<vector<edge>> to;\n vector<double> pot; //ポテンシャル\n\n MCF(int n_ = 1) : n(n_), to(n_), pot(n_), dist(n_), pv(n_), pe(n_) {}\n\n void addedge(int u, int v, long long cap, double cost) {\n int su = (int)to[u].size();\n int sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap, cost });\n to[v].push_back({ u, su, 0, -cost });\n }\n\n //s->tへ流量fの最小費用流、流せないときは-1\n double mincostflow(int s, int t, long long f) {\n double res = 0;\n double eps = 1e-8;\n pot.assign(n, 0);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost + eps) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return -1; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n long long nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf;\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return res;\n }\n};\n\nvoid inv(int n, vii<double>& a) {\n rep(k, n) {\n double mx = a[k][k]; \n int idx = k;\n for(int i = k + 1; i < n; i++) if (abs(a[i][k]) > mx) {\n idx = i;\n mx = abs(a[i][k]);\n }\n swap(a[k], a[idx]);\n\n for(int j = n; j >= k; j--) a[k][j] /= a[k][k];\n\n rep(i, n) {\n if (i == k) continue;\n for (int j = n; j >= k; j--) {\n a[i][j] -= a[i][k] * a[k][j];\n }\n }\n }\n\n}\n\nvoid solve() {\n int n, s, t, F;\n cin >> n >> s >> t >> F;\n vii<double> a(n, vi<double>(n + 1));\n rep(i, n) rep(j, n + 1) cin >> a[i][j];\n\n vii<double> b = a;\n inv(n, a);\n //{\n // cout << fixed << setprecision(2);\n // rep(i, n) rep(j, n + 1) cout << a[i][j] << \" \\n\"[j == n];\n\n // vi<double> temp(n);\n // rep(i, n) rep(j, n) temp[i] += b[i][j] * a[j][n];\n // rep(i, n) cout << temp[i] << \" \";\n // cout << endl;\n // rep(i, n) cout << fixed << setprecision(10) << a[i][n] << endl;\n //}\n\n MCF mcf(n + 2);\n int S = n, T = n + 1;\n mcf.addedge(S, s, F, 0);\n mcf.addedge(t, T, F, 0); \n\n rep(i, n) {\n int m;\n cin >> m;\n vi<int> d(m), f(m);\n rep(j, m) cin >> d[j];\n rep(j, m) cin >> f[j];\n rep(j, m) mcf.addedge(i, d[j], f[j], abs(a[i][n]-a[d[j]][n]));\n }\n double ans = mcf.mincostflow(S, T, F);\n if (ans == -1) cout << \"impossible\" << endl;\n else cout << fixed << setprecision(12) << ans << endl;\n}\n\nint main()\n{\n int t;\n cin >> t; \n while (t--) solve();\n return 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 4172,
"score_of_the_acc": -0.9996,
"final_rank": 14
},
{
"submission_id": "aoj_1095_3839272",
"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 EPS 0.0000001\n\ntypedef vector<double> VEC;\ntypedef vector<VEC> MATRIX;\ntypedef pair<double,int> P; //firstは最短距離、secondは頂点の番号\n\n#define NUM 105\n\n//辺を表す構造体{行先、容量、コスト、逆辺のインデックス}\nstruct Edge{\n\tEdge(int arg_to,int arg_capacity,double arg_cost,int arg_rev_index){\n\t\tto = arg_to;\n\t\tcapacity = arg_capacity;\n\t\tcost = arg_cost;\n\t\trev_index = arg_rev_index;\n\t}\n\n\tint to,capacity,rev_index;\n\tdouble cost;\n};\n\nint V; //頂点数\nint H,W;\nvector<Edge> G[NUM]; //グラフの隣接リスト表現\ndouble h[NUM]; //ポテンシャル\ndouble dist[NUM]; //最短距離\nint pre_node[NUM],pre_edge[NUM]; //直前の頂点と辺\nint adj[NUM];\n\n\nvoid add_edge(int from,int to,int capacity,double cost){\n\tG[from].push_back(Edge(to,capacity,cost,G[to].size()));\n\tG[to].push_back(Edge(from,0,-cost,G[from].size()-1));\n}\n\n//流せない場合は-1を返す\ndouble min_cost_flow(int source,int sink,int flow){\n\n\tdouble ret = 0;\n\tfor(int i = 0; i < V; i++)h[i] = 0;\n\twhile(flow > 0){\n\t\t//ダイクストラ法を用いてhを更新する\n\t\tpriority_queue<P,vector<P>,greater<P>> Q;\n\t\tfor(int i = 0; i < V; i++)dist[i] = BIG_NUM;\n\t\tdist[source] = 0;\n\t\tQ.push(P(0,source));\n\n\t\twhile(!Q.empty()){\n\t\t\tP p = Q.top();\n\t\t\tQ.pop();\n\t\t\tint node_id = p.second;\n\t\t\tif(dist[node_id]+0.00001 < p.first)continue; //最短でなければSKIP\n\t\t\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\t\t\tEdge &e = G[node_id][i];\n\t\t\t\tif(e.capacity > 0 && dist[e.to] > 0.00001+dist[node_id]+e.cost+h[node_id]-h[e.to]){\n\t\t\t\t\tdist[e.to] = dist[node_id]+e.cost+h[node_id]-h[e.to];\n\t\t\t\t\tpre_node[e.to] = node_id;\n\t\t\t\t\tpre_edge[e.to] = i;\n\t\t\t\t\tQ.push(P(dist[e.to],e.to));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif(fabs(dist[sink]-BIG_NUM) < 0.00001){\n\t\t\t//これ以上流せない\n\t\t\treturn -1;\n\t\t}\n\n\t\tfor(int node_id = 0; node_id < V; node_id++)h[node_id] += dist[node_id];\n\n\t\t//source-sink間最短路に沿って目いっぱい流す\n\t\tint tmp_flow = flow;\n\t\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\n\t\t\ttmp_flow = min(tmp_flow,G[pre_node[node_id]][pre_edge[node_id]].capacity);\n\t\t}\n\t\tflow -= tmp_flow;\n\t\tret += tmp_flow*h[sink];\n\t\tfor(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\n\t\t\tEdge &e = G[pre_node[node_id]][pre_edge[node_id]];\n\t\t\te.capacity -= tmp_flow;\n\t\t\tG[node_id][e.rev_index].capacity += tmp_flow;\n\t\t}\n\t}\n\treturn ret;\n}\n\n\n\nMATRIX gauss_jordan(MATRIX A){\n\n\tMATRIX C(H,VEC(W+1));\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col <= W; col++){\n\t\t\tC[row][col] = A[row][col];\n\t\t}\n\t}\n\n\tint base_row;\n\tdouble tmp;\n\n\tfor(int i = 0; i < H; i++){\n\t\tbase_row = i;\n\t\tfor(int row = i+1; row < W; row++){\n\t\t\tif(fabs(C[row][i]) > fabs(C[base_row][i])){\n\t\t\t\tbase_row = row;\n\t\t\t}\n\t\t}\n\n\t\tif(fabs(C[base_row][i]) < EPS)continue; //操作不要\n\n\t\tif(base_row != i)swap(C[base_row],C[i]);\n\n\t\ttmp = C[i][i]; //係数\n\t\tfor(int col = 0; col <= W; col++){ //基準行の係数を1にする\n\t\t\tC[i][col] /= tmp;\n\t\t}\n\n\t\tfor(int row = 0; row < H; row++){\n\t\t\tif(row == i || fabs(C[row][i]) < EPS)continue; //基準行、または該当列が0ならSKIP\n\n\t\t\ttmp = C[row][i];\n\n\t\t\tfor(int col = i; col <= W; col++){\n\t\t\t\tC[row][col] -= C[i][col]*tmp;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn C;\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < NUM; i++){\n\n\t\tG[i].clear();\n\t}\n\n\tint source,sink,FLOW;\n\n\tscanf(\"%d %d %d %d\",&V,&source,&sink,&FLOW);\n\n\tH = V;\n\tW = V;\n\n\tMATRIX A(H,VEC(W+1));\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col <= W; col++){\n\n\t\t\tscanf(\"%lf\",&A[row][col]);\n\t\t}\n\t}\n\n\t//気温を計算\n\tA = gauss_jordan(A);\n\n\tint num_edge,tmp_capacity;\n\n\tfor(int loop = 0; loop < V; loop++){\n\n\t\tscanf(\"%d\",&num_edge);\n\t\tfor(int i = 0; i < num_edge; i++){\n\n\t\t\tscanf(\"%d\",&adj[i]);\n\t\t}\n\n\t\tfor(int i = 0; i < num_edge; i++){\n\n\t\t\tscanf(\"%d\",&tmp_capacity);\n\n\t\t\tadd_edge(loop,adj[i],tmp_capacity,fabs(A[loop][W]-A[adj[i]][W]));\n\t\t}\n\t}\n\n\tdouble ans = min_cost_flow(source,sink,FLOW);\n\n\tif(fabs(ans+1.0) < EPS){\n\n\t\tprintf(\"impossible\\n\");\n\n\t}else{\n\n\t\tprintf(\"%.10lf\\n\",ans);\n\t}\n}\n\nint main(){\n\n\tint num_case;\n\tscanf(\"%d\",&num_case);\n\n\tfor(int loop = 0; loop < num_case; loop++){\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3896,
"score_of_the_acc": -0.8633,
"final_rank": 11
},
{
"submission_id": "aoj_1095_2488795",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n#ifdef _DEBUG\n#include \"dump.hpp\"\n#else\n#define dump(...)\n#endif\n\n#define int long long\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(c) begin(c),end(c)\nconst int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;\nconst int MOD = (int)(1e9) + 7;\ntemplate<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }\n\n#define EPS 1e-8\nstruct MinimumCostFlow {\n\tusing Flow = int;\n\tusing Cost = double;\n\tconst Cost kInfCost = INF;\n\tstruct Edge {\n\t\tint to, rev;\n\t\tFlow cap;\n\t\tCost cost;\n\t\tEdge() {}\n\t\tEdge(int to, int rev, Flow cap, Cost cost) :to(to), rev(rev), cap(cap), cost(cost) {}\n\t};\n\tint n;\n\tvector<vector<Edge>> g;\n\tvector<Cost> dist;\n\tvector<int> prevv, preve;\n\tMinimumCostFlow(int n) :n(n), g(n), dist(n), prevv(n), preve(n) {}\n\tvoid addArc(int from, int to, Flow cap, Cost cost) {\n\t\tg[from].emplace_back(to, (int)g[to].size(), cap, cost);\n\t\tg[to].emplace_back(from, (int)g[from].size() - 1, Flow(), -cost);\n\t}\n\t// s??????t????????????f???????°??????¨???\n\t// ??????????????´?????? kInfCost\n\tCost minimumCostFlow(int s, int t, Flow f) {\n\t\tCost total = Cost();\n\t\twhile (f > 0) {\n\t\t\t// Bellman-Ford\n\t\t\tfill(dist.begin(), dist.end(), kInfCost);\n\t\t\tdist[s] = 0;\n\t\t\tbool update = true;\n\t\t\twhile (update) {\n\t\t\t\tupdate = false;\n\t\t\t\tfor (int v = 0; v < n; v++) {\n\t\t\t\t\tif (dist[v] == kInfCost)continue;\n\t\t\t\t\tfor (int i = 0; i < g[v].size(); i++) {\n\t\t\t\t\t\tEdge &e = g[v][i];\n\t\t\t\t\t\tif (e.cap > Flow() && dist[e.to] > EPS + dist[v] + e.cost) {\n\t\t\t\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\t\tupdate = 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\t// ????????\\???????????????\n\t\t\tif (dist[t] == kInfCost)\n\t\t\t\treturn kInfCost;\n\t\t\t// ?????????????????£??????????????????\n\t\t\tFlow d = f;\n\t\t\tfor (int v = t; v != s; v = prevv[v])\n\t\t\t\td = min(d, g[prevv[v]][preve[v]].cap);\n\t\t\tf -= d;\n\t\t\ttotal += dist[t] * d;\n\t\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\t\tEdge &e = g[prevv[v]][preve[v]];\n\t\t\t\te.cap -= d;\n\t\t\t\tg[v][e.rev].cap += d;\n\t\t\t}\n\t\t}\n\t\treturn total;\n\t}\n};\n\n// ??¬??????????¶???????, Gauss elimination\n// O(n^3)\n// ???????¶????, forward elimination\n// ????????£??\\, back substitution\n\nusing Num = double;\nusing Vec = vector<Num>;\nusing Mat = vector<Vec>;\nVec gaussianElimination(Mat A, Vec b) {\n\tconst int n = A.size(), m = A[0].size();\n\tint pi = 0, pj = 0;\n\twhile (pi < n && pj < m) {\n\t\tfor (int i = pi + 1; i < n; i++)\n\t\t\tif (abs(A[i][pj]) > abs(A[pi][pj]))\n\t\t\t\tA[i].swap(A[pi]), swap(b[i], b[pi]);\n\t\tif (abs(A[pi][pj]) > 0) {\n\t\t\tNum d = A[pi][pj];\n\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\tA[pi][j] /= d;\n\t\t\tb[pi] /= d;\n\t\t\tfor (int i = pi + 1; i < n; i++) {\n\t\t\t\tNum k = A[i][pj];\n\t\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\t\tA[i][j] -= k * A[pi][j];\n\t\t\t\tb[i] -= k * b[pi];\n\t\t\t}\n\t\t\tpi++;\n\t\t}\n\t\tpj++;\n\t}\n\tfor (int i = pi; i < n; i++)\n\t\tif (abs(b[i]) > 0)\n\t\t\treturn Vec();\n\tif (pi < m || pj < m)\n\t\treturn Vec();\n\tfor (int j = m - 1; j >= 0; j--)\n\t\tfor (int i = 0; i < j; i++)\n\t\t\tb[i] -= b[j] * A[i][j];\n\treturn b;\n}\n\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tint T; cin >> T;\n\tcout << fixed << setprecision(10);\n\twhile (T--) {\n\t\tint N, s, t, F; cin >> N >> s >> t >> F;\n\t\tMinimumCostFlow mcf(N);\n\t\tMat a(N, Vec(N));\n\t\tVec c(N);\n\t\trep(i, 0, N) rep(j, 0, N + 1) {\n\t\t\tif (j == N)cin >> c[i];\n\t\t\telse cin >> a[i][j];\n\t\t}\n\t\tVec x = gaussianElimination(a, c);\n\t\tdump(x);\n\t\trep(i, 0, N) {\n\t\t\tint M; cin >> M;\n\t\t\tvector<int> d(M); rep(j, 0, M) {\n\t\t\t\tcin >> d[j];\n\t\t\t}\n\t\t\tvector<int> f(M); rep(j, 0, M) {\n\t\t\t\tcin >> f[j];\n\t\t\t}\n\t\t\trep(j, 0, M) {\n\t\t\t\tmcf.addArc(i, d[j], f[j], abs(x[i] - x[d[j]]));\n\t\t\t}\n\t\t}\n\t\tauto res = mcf.minimumCostFlow(s, t, F);\n\t\tif (res == INF)\n\t\t\tcout << \"impossible\" << endl;\n\t\telse\n\t\t\tcout << res << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 280,
"memory_kb": 4088,
"score_of_the_acc": -1.0097,
"final_rank": 15
},
{
"submission_id": "aoj_1095_2174193",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nusing Array = vector<double>;\nusing vec = vector<double>;\nusing Matrix = vector<Array>;\nusing mat = vector<Array>;\nconst double eps = 1e-8;\n\nArray GaussJordan(const Matrix& A, const Array& b) {\n\tint n = A.size();\n\tMatrix B(n, Array(n + 1));\n\tfor(int i = 0; i < n; i++)\n\t\tfor(int j = 0; j < n; j++)\tB[i][j] = A[i][j];\n\tfor(int i = 0; i < n; i++) B[i][n] = b[i];\n\tfor(int i = 0; i < n; i++) {\n\t\tint pivot = i;\n\t\tfor(int j = i; j < n; j++) {\n\t\t\tif(abs(B[j][i]) > abs(B[pivot][i])) pivot = j;\n\t\t}\n\t\tswap(B[i], B[pivot]);\n\t\tif(abs(B[i][i]) < eps) return Array();\n\t\tfor(int j = i + 1; j <= n; j++) B[i][j] /= B[i][i];\n\t\tfor(int j = 0; j < n; j++) {\n\t\t\tif(i != j) {\n\t\t\t\tfor(int k = i + 1; k <= n; k++) B[j][k] -= B[j][i] * B[i][k];\n\t\t\t}\n\t\t}\n\t}\n\n\tArray x(n);\n\tfor(int i = 0; i < n; i++) x[i] = B[i][n];\n\treturn x;\n}\nconst int MAX_V = 100010;\ntypedef int Capacity;\ntypedef double Cost;\nconst Cost inf = 1e9;\n\nstruct Edge {\n\tint dst;\n\tCapacity cap, cap_orig;\n\tCost cost;\n\tint revEdge; bool isRev;\n\tEdge(int dst, Capacity cap, Cost cost, int revEdge, bool isRev)\n\t\t:dst(dst), cap(cap), cap_orig(cap), cost(cost), revEdge(revEdge), isRev(isRev) {\n\t}\n};\n\nstruct PrimalDual {\n\tint n;\n\tvector<vector<Edge> > g;\n\tvector<int> top;\n\tPrimalDual(int n_) : n(n_), g(vector<vector<Edge> >(n_)) {}\n\tvoid add_edge(int src, int dst, Capacity cap, Cost cost) { // ?????????\n\t\tg[src].push_back(Edge{ dst, cap, cost, (int)g[dst].size(), false });\n\t\tg[dst].push_back(Edge{ src, 0, -cost, (int)g[src].size() - 1, true });\n\t}\n\tCost solve(int s, int t, int f) {\n\t\tCost res = 0;\n\t\tstatic Cost h[MAX_V], dist[MAX_V];\n\t\tstatic int prevv[MAX_V], preve[MAX_V];\n\n\t\tfill(h, h + n, 0);\n\t\tif(top.size()) {\n\t\t\tassert(top.size() == n);\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tint v = top[i];\n\t\t\t\tfor(int i = 0; i < g[v].size(); i++) {\n\t\t\t\t\tEdge& e = g[v][i];\n\t\t\t\t\tif(e.cap == 0) continue;\n\t\t\t\t\tint u = e.dst;\n\t\t\t\t\th[u] = min(h[u], h[v] + e.cost);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\twhile(f > 0) {\n\t\t\ttypedef pair<Cost, int> pcv;\n\t\t\tpriority_queue<pcv, vector<pcv>, greater<pcv> > q;\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tdist[i] = inf;\n\t\t\t}\n\t\t\tdist[s] = 0;\n\t\t\tq.push(pcv(0, s));\n\t\t\twhile(q.size()) {\n\t\t\t\tpcv p = q.top(); q.pop();\n\t\t\t\tint v = p.second;\n\t\t\t\tif(dist[v] < p.first) continue;\n\t\t\t\tfor(int i = 0; i < g[v].size(); i++) {\n\t\t\t\t\tEdge &e = g[v][i];\n\t\t\t\t\tif(e.cap > 0 && dist[e.dst] > dist[v] + e.cost + h[v] - h[e.dst] + eps) {\n\t\t\t\t\t\tdist[e.dst] = dist[v] + e.cost + h[v] - h[e.dst];\n\t\t\t\t\t\tprevv[e.dst] = v;\n\t\t\t\t\t\tpreve[e.dst] = i;\n\t\t\t\t\t\tq.push(pcv(dist[e.dst], e.dst));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(abs(dist[t] - inf) < eps) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tfor(int v = 0; v < n; v++) {\n\t\t\t\th[v] += dist[v];\n\t\t\t}\n\t\t\t// s-t ????????????????????£??????????????????\n\t\t\tint d = f;\n\t\t\tfor(int v = t; v != s; v = prevv[v]) {\n\t\t\t\td = min(d, g[prevv[v]][preve[v]].cap);\n\t\t\t}\n\t\t\tf -= d;\n\t\t\tres += d * h[t];\n\t\t\tfor(int v = t; v != s; v = prevv[v]) {\n\t\t\t\tEdge &e = g[prevv[v]][preve[v]];\n\t\t\t\te.cap -= d;\n\t\t\t\tg[v][e.revEdge].cap += d;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\t// ??????????????????=???????????????-?????¨??????????????¨???\n\tvoid view() {\n\t\tfor(int i = 0; i < g.size(); i++) {\n\t\t\tfor(int j = 0; j < g[i].size(); j++) {\n\t\t\t\tif(!g[i][j].isRev) {\n\t\t\t\t\tEdge& e = g[i][j];\n\t\t\t\t\tprintf(\"%3d->%3d (flow:%d)\\n\", i, e.dst, e.cap_orig - e.cap);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n};\n\nint d[1000];\nint f[1000];\n\nvoid solve() {\n\n\tint N, S, T, F;\n\tcin >> N >> S >> T >> F;\n\n\tMatrix A(N, Array(N));\n\tArray b(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}\n\t\tcin >> b[i];\n\t}\n\n\tArray tm = GaussJordan(A, b);\n\n\tPrimalDual pd(N);\n\tfor(int i = 0; i < N; i++) {\n\t\tint M;\n\t\tcin >> M;\n\t\tfor(int j = 0; j < M; j++) {\n\t\t\tcin >> d[j];\n\t\t}\n\t\tfor(int j = 0; j < M; j++) {\n\t\t\tcin >> f[j];\n\t\t}\n\t\tfor(int j = 0; j < M; j++) {\n\t\t\tpd.add_edge(i, d[j], f[j], abs(tm[i] - tm[d[j]]));\n\t\t}\n\t}\n\tCost res = pd.solve(S, T, F);\n\tif(res == -1) {\n\t\tcout << \"impossible\" << endl;\n\t}\n\telse {\n\t\tcout << fixed << setprecision(15) << res << endl;\n\t}\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint T;\n\tcin >> T;\n\twhile(T--) solve();\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 3984,
"score_of_the_acc": -0.9045,
"final_rank": 12
},
{
"submission_id": "aoj_1095_2174192",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nusing Array = vector<double>;\nusing vec = vector<double>;\nusing Matrix = vector<Array>;\nusing mat = vector<Array>;\nconst double eps = 1e-8;\n\nvec gauss_jordan(const mat&A, const vec&b) {\n\tint n = A.size();\n\tmat B(n, vec(n + 1));\n\tfor(int i = 0; i < n; i++)\n\t\tfor(int j = 0; j < n; j++)B[i][j] = A[i][j];\n\tfor(int i = 0; i < n; i++)B[i][n] = b[i];\n\tfor(int i = 0; i < n; i++) {\n\t\tint pivot = i;\n\t\tfor(int j = i; j<n; j++)\n\t\t\tif(abs(B[j][i])>abs(B[pivot][i]))pivot = j;\n\t\tswap(B[i], B[pivot]);\n\t\tif(abs(B[i][i]) < 0.0000001)return vec();\n\t\tfor(int j = i + 1; j <= n; j++)B[i][j] /= B[i][i];\n\t\tfor(int j = 0; j < n; j++) {\n\t\t\tif(i != j)\n\t\t\t\tfor(int k = i + 1; k <= n; k++)B[j][k] -= B[j][i] * B[i][k];\n\t\t}\n\t}\n\tvec x(n);\n\tfor(int i = 0; i < n; i++)x[i] = B[i][n];\n\treturn x;\n}\nconst int MAX_V = 100010;\ntypedef int Capacity;\ntypedef double Cost;\nconst Cost inf = 1e9;\n\nstruct Edge {\n\tint dst;\n\tCapacity cap, cap_orig;\n\tCost cost;\n\tint revEdge; bool isRev;\n\tEdge(int dst, Capacity cap, Cost cost, int revEdge, bool isRev)\n\t\t:dst(dst), cap(cap), cap_orig(cap), cost(cost), revEdge(revEdge), isRev(isRev) {\n\t}\n};\n\nstruct PrimalDual {\n\tint n;\n\tvector<vector<Edge> > g;\n\tvector<int> top;\n\tPrimalDual(int n_) : n(n_), g(vector<vector<Edge> >(n_)) {}\n\tvoid add_edge(int src, int dst, Capacity cap, Cost cost) { // ?????????\n\t\tg[src].push_back(Edge{ dst, cap, cost, (int)g[dst].size(), false });\n\t\tg[dst].push_back(Edge{ src, 0, -cost, (int)g[src].size() - 1, true });\n\t}\n\tCost solve(int s, int t, int f) {\n\t\tCost res = 0;\n\t\tstatic Cost h[MAX_V], dist[MAX_V];\n\t\tstatic int prevv[MAX_V], preve[MAX_V];\n\n\t\tfill(h, h + n, 0);\n\t\tif(top.size()) {\n\t\t\tassert(top.size() == n);\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tint v = top[i];\n\t\t\t\tfor(int i = 0; i < g[v].size(); i++) {\n\t\t\t\t\tEdge& e = g[v][i];\n\t\t\t\t\tif(e.cap == 0) continue;\n\t\t\t\t\tint u = e.dst;\n\t\t\t\t\th[u] = min(h[u], h[v] + e.cost);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\twhile(f > 0) {\n\t\t\ttypedef pair<Cost, int> pcv;\n\t\t\tpriority_queue<pcv, vector<pcv>, greater<pcv> > q;\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tdist[i] = inf;\n\t\t\t}\n\t\t\tdist[s] = 0;\n\t\t\tq.push(pcv(0, s));\n\t\t\twhile(q.size()) {\n\t\t\t\tpcv p = q.top(); q.pop();\n\t\t\t\tint v = p.second;\n\t\t\t\tif(dist[v] < p.first) continue;\n\t\t\t\tfor(int i = 0; i < g[v].size(); i++) {\n\t\t\t\t\tEdge &e = g[v][i];\n\t\t\t\t\tif(e.cap > 0 && dist[e.dst] > dist[v] + e.cost + h[v] - h[e.dst] + eps) {\n\t\t\t\t\t\tdist[e.dst] = dist[v] + e.cost + h[v] - h[e.dst];\n\t\t\t\t\t\tprevv[e.dst] = v;\n\t\t\t\t\t\tpreve[e.dst] = i;\n\t\t\t\t\t\tq.push(pcv(dist[e.dst], e.dst));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(abs(dist[t] - inf) < eps) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tfor(int v = 0; v < n; v++) {\n\t\t\t\th[v] += dist[v];\n\t\t\t}\n\t\t\t// s-t ????????????????????£??????????????????\n\t\t\tint d = f;\n\t\t\tfor(int v = t; v != s; v = prevv[v]) {\n\t\t\t\td = min(d, g[prevv[v]][preve[v]].cap);\n\t\t\t}\n\t\t\tf -= d;\n\t\t\tres += d * h[t];\n\t\t\tfor(int v = t; v != s; v = prevv[v]) {\n\t\t\t\tEdge &e = g[prevv[v]][preve[v]];\n\t\t\t\te.cap -= d;\n\t\t\t\tg[v][e.revEdge].cap += d;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\t// ??????????????????=???????????????-?????¨??????????????¨???\n\tvoid view() {\n\t\tfor(int i = 0; i < g.size(); i++) {\n\t\t\tfor(int j = 0; j < g[i].size(); j++) {\n\t\t\t\tif(!g[i][j].isRev) {\n\t\t\t\t\tEdge& e = g[i][j];\n\t\t\t\t\tprintf(\"%3d->%3d (flow:%d)\\n\", i, e.dst, e.cap_orig - e.cap);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n};\n\nint d[1000];\nint f[1000];\n\nvoid solve() {\n\n\tint N, S, T, F;\n\tcin >> N >> S >> T >> F;\n\n\tMatrix A(N, Array(N));\n\tArray b(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}\n\t\tcin >> b[i];\n\t}\n\n\tArray tm = gauss_jordan(A, b);\n\n\tPrimalDual pd(N);\n\tfor(int i = 0; i < N; i++) {\n\t\tint M;\n\t\tcin >> M;\n\t\tfor(int j = 0; j < M; j++) {\n\t\t\tcin >> d[j];\n\t\t}\n\t\tfor(int j = 0; j < M; j++) {\n\t\t\tcin >> f[j];\n\t\t}\n\t\tfor(int j = 0; j < M; j++) {\n\t\t\tpd.add_edge(i, d[j], f[j], abs(tm[i] - tm[d[j]]));\n\t\t}\n\t}\n\tCost res = pd.solve(S, T, F);\n\tif(res == -1) {\n\t\tcout << \"impossible\" << endl;\n\t}\n\telse {\n\t\tcout << fixed << setprecision(15) << res << endl;\n\t}\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint T;\n\tcin >> T;\n\twhile(T--) solve();\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 4032,
"score_of_the_acc": -0.927,
"final_rank": 13
},
{
"submission_id": "aoj_1095_2136977",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\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 double 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 abs(e) < EPS;\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);\nMatrix tri = triangulate();\nElem ans = 1;\nfor (int i = 0; i < n; ++i) {\n\tans *= tri[i][i];\n}\nreturn ans;\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\ntypedef ld Weight;\nstruct Edge {\n\tint src, dest;\n\tint cap, rev;\n\tWeight weight;\n\tbool operator < (const Edge &rhs) const { return weight > rhs.weight; }\n};\n\nconst int V = 4000;\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\ntypedef vector<Weight> Array;\nWeight h[V]; //??????????????£???\nWeight dist[V]; //???????????¢\nint prevv[V], preve[V]; //??´???????????¨??????\n\nvoid add_edge(Graph &g, int src, int dest, int cap, Weight weight) {\n\tg[src].push_back(Edge{ src, dest, cap, (int)g[dest].size(), weight });\n\tg[dest].push_back(Edge{ dest, src, 0, (int)g[src].size() - 1, -weight });\n}\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(auto i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\nconst Weight INF = 2147483647;\nconst Weight eps = 1e-9;\n//????????????double?????????eps?????????\nWeight min_cost_flow(Graph &g, int s, int t, int f) {\n\tWeight res = 0;\n\tmemset(h, 0, sizeof(h));\n\ttypedef pair<Weight, int> P;\n\twhile (f > 0) {\n\t\tpriority_queue<P, vector<P>, greater<P> > que;\n\t\tfill(dist, dist + V, INF);\n\t\tdist[s] = 0;\n\t\tque.push(P(0, s));\n\t\twhile (!que.empty()) {\n\t\t\tP p = que.top(); que.pop();\n\t\t\tconst int v = p.second;\n\t\t\tif (dist[v] < p.first) continue;\n\t\t\tREP(i, g[v].size()) {\n\t\t\t\tEdge &e = g[v][i];\n\t\t\t\tif (e.cap > 0 && dist[e.dest] > dist[v] + e.weight + h[v] - h[e.dest] + eps) {\n\t\t\t\t\tdist[e.dest] = dist[v] + e.weight + h[v] - h[e.dest];\n\t\t\t\t\tprevv[e.dest] = v;\n\t\t\t\t\tpreve[e.dest] = i;\n\t\t\t\t\tque.push(P(dist[e.dest], e.dest));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dist[t] == INF) return -1;\n\t\tREP(v, V) h[v] = h[v] + dist[v];\n\n\t\tint d = f;\n\t\tfor (int v = t; v != s; v = prevv[v]) d = min(d, g[prevv[v]][preve[v]].cap);\n\t\tf -= d;\n\t\tres = res + d * h[t];\n\t\tfor (int v = t; v != s; v = prevv[v]) {\n\t\t\tEdge &e = g[prevv[v]][preve[v]];\n\t\t\te.cap -= d;\n\t\t\tg[v][e.rev].cap += d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint main() {\n\tint T; cin >> T;\n\twhile (T--) {\n\t\tint N, S, T, F; cin >> N >> S >> T >> F;\n\t\tvector<ld>ts;\n\t\t{\n\t\t\tMatrix mat(N, N + 1);\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tfor (int j = 0; j < N + 1; ++j) {\n\t\t\t\t\tint a; cin >> a;\n\t\t\t\t\tmat[i][j] = a;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmat = mat.rowReduction();\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tts.push_back(mat[i][N]);\n\t\t\t}\n\t\t}\n\t\tGraph g(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint M; cin >> M;\n\t\t\tvector<int>ds, fs;\n\t\t\tfor (int j = 0; j < M; ++j) {\n\t\t\t\tint d; cin >> d; ds.push_back(d);\n\t\t\t}\n\t\t\tfor (int j = 0; j < M; ++j) {\n\t\t\t\tint f; cin >> f; fs.push_back(f);\n\t\t\t}\n\t\t\tfor (int j = 0; j < M; ++j) {\n\t\t\t\tadd_edge(g, i, ds[j], fs[j], abs(ts[i] - ts[ds[j]]));\n\t\t\t}\n\t\t}\n\t\tld ans = min_cost_flow(g, S, T, F);\n\t\tif (ans < 0)cout << \"impossible\" << endl;\n\t\telse\n\t\t{\n\n\t\t\tcout << setprecision(10) << fixed << ans << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 270,
"memory_kb": 4096,
"score_of_the_acc": -1.0099,
"final_rank": 16
},
{
"submission_id": "aoj_1095_1879444",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX_V 300\n#define INF 1e9\nconst double EPS = 1e-8;\ntypedef vector<double> vec;\ntypedef vector<vec> mat;\ntypedef pair<double, int> P;\n \nstruct edge {\n int to, cap, rev;\n double cost;\n edge(int to, int cap, int rev, double cost) :\n\tto(to), cap(cap), rev(rev), cost(cost) {}\n};\n \nint V;\nvector<edge> G[MAX_V];\ndouble dist[MAX_V], h[MAX_V];;\nint prevv[MAX_V], preve[MAX_V];\n \nvoid add_edge(int from, int to, int cap, double cost){\n G[from].push_back(edge(to, cap, G[to].size(), cost));\n G[to].push_back(edge(from, 0, G[from].size()-1, -cost));\n}\n \ndouble min_cost_flow(int s, int t, int f)\n{\n double res = 0;\n fill(h, h+V, 0);\n while (f > 0) {\n\tpriority_queue<P, vector<P>, greater<P>> Q;\n\tfill(dist, dist+V, INF);\n\tdist[s] = 0;\n\tQ.push(P(0, s));\n\twhile (!Q.empty()) {\n\t P p = Q.top(); Q.pop();\n\t int v = p.second;\n\t if (dist[v] < p.first) continue;\n\t for (int i = 0; i < (int)G[v].size(); i++) {\n\t\tedge &e = G[v][i];\n\t\tif (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to] + EPS) {\n\t\t dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n\t\t prevv[e.to] = v;\n\t\t preve[e.to] = i;\n\t\t Q.push(P(dist[e.to], e.to));\n\t\t}\n\t }\n\t}\n\tif (dist[t] == INF) {\n\t return -1;\n\t}\n\tfor (int v = 0; v < V; v++) {\n\t h[v] += dist[v];\n\t}\n\tint d = f;\n\tfor (int v = t; v != s; v = prevv[v]) {\n\t d = min(d, G[prevv[v]][preve[v]].cap);\n\t}\n\tf -= d;\n\tres += d*h[t];\n\tfor (int v = t; v != s; v = prevv[v]) {\n\t edge &e = G[prevv[v]][preve[v]];\n\t e.cap -= d;\n\t G[v][e.rev].cap += d;\n\t}\n }\n return res;\n}\n \nvec gauss_jordan(const mat &A, const vec &b)\n{\n int n = A.size();\n mat B(n, vec(n+1));\n for (int i = 0; i < n; i++){\n\tfor(int j = 0 ; j < n ; j++) {\n\t B[i][j] = A[i][j];\n\t}\n }\n for (int i = 0; i < n; i++) {\n\tB[i][n] = b[i];\n }\n for (int i = 0; i < n; i++) {\n\tint pivot = i;\n\tfor (int j = i ; j < n ; j++) {\n\t if (abs(B[j][i]) > abs(B[pivot][i])) {\n\t\tpivot = j;\n\t }\n\t}\n\tswap(B[i],B[pivot]);\n\tif (abs(B[i][i]) < EPS) return vec();\n\tfor (int j = i+1; j <= n; j++) {\n\t B[i][j] /= B[i][i];\n\t}\n\tfor (int j = 0; j < n; j++) {\n\t if (i != j) {\n\t\tfor (int k = i+1; k <= n; k++) {\n\t\t B[j][k] -= B[j][i]*B[i][k];\n\t\t}\n\t }\n\t}\n }\n vec x(n);\n for (int i = 0; i < n; i++) {\n\tx[i] = B[i][n];\n }\n return x;\n}\n \nvoid init()\n{\n for (int i = 0; i < MAX_V; i++) {\n\tG[i].clear();\n }\n}\n \nint main()\n{\n int Tc;\n scanf(\"%d\", &Tc);\n while (Tc--) {\n\tint N, s, t, F;\n\tinit();\n scanf(\"%d %d %d %d\", &N, &s, &t, &F);\n\tmat a(N, vec(N)); vec c(N);\n\tfor (int i = 0; i < N; i++) {\n\t for (int j = 0; j < N; j++) {\n scanf(\"%lf\", &a[i][j]);\n\t }\n scanf(\"%lf\", &c[i]); \n\t}\n\tvec res = gauss_jordan(a, c);\n\tfor (int i = 0; i < N; i++) {\n\t int M, d[N], f;\n scanf(\"%d\", &M);\n\t for (int j = 0; j < M; j++) {\n\t\tscanf(\"%d\", &d[j]);\n\t }\n\t for (int j = 0; j < M; j++) {\n scanf(\"%d\", &f);\n\t\tadd_edge(i, d[j], f, abs(res[i]-res[d[j]]));\n\t }\n\t}\n\tV = N;\n\tdouble ans = min_cost_flow(s, t, F);\n\tif (ans == -1) {\n\t printf(\"impossible\\n\");\n\t} else {\n\t printf(\"%.6f\\n\", ans);\n\t}\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 3700,
"score_of_the_acc": -0.7751,
"final_rank": 9
},
{
"submission_id": "aoj_1095_1879431",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_V 105\n#define INF 1000000001\ntypedef pair< double ,int> P;\n\nstruct edge {\n int to;\n int cap;\n int rev;\n double cost;\n};\n\nint V;\nvector<edge> G[MAX_V];\ndouble h[MAX_V];\ndouble dist[MAX_V];\nint prevv[MAX_V],preve[MAX_V];\n\nvoid init_edge(){\n for(int i=0;i<MAX_V;i++)G[i].clear();\n}\n\nvoid add_edge(int from,int to,int cap,double cost){\n G[from].push_back((edge){to,cap,(int)G[to].size(),cost});\n G[to].push_back((edge){from,0,(int)G[from].size()-1,-cost});\n}\n\ndouble min_cost_flow(int s,int t,int f){\n double eps = 1e-5;\n double res = 0;\n fill(h,h+V,0.0);\n \n while(f>0){\n \n priority_queue< P, vector<P>, greater<P> > que;\n fill( dist, dist+V , (double)INF );\n dist[s]=0;\n que.push(P(0,s));\n\n // fill ( prevv , prevv + V , s );\n \n while(!que.empty()){\n P p = que.top(); que.pop();\n int v = p.second;\n if(dist[v]+eps < p.first)continue;\n for(int i=0;i<(int)G[v].size();i++){\n edge &e = G[v][i];\n if(e.cap>0&&dist[e.to] > eps+dist[v]+e.cost+h[v]-h[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n prevv[e.to]=v;\n preve[e.to]=i;\n que.push(P(dist[e.to],e.to));\n }\n }\n }\n\n \n // if(dist[t] == INF){\n if( dist[t] > INF - eps ){\n return -1;\n }\n for(int v=0;v<V;v++)h[v]+=dist[v]; \n\n int d=f;\n for(int v=t;v!=s;v=prevv[v]){\n d=min(d,G[prevv[v]][preve[v]].cap);\n }\n \n f-=d;\n\n res+=d*h[t];\n\n for(int v=t;v!=s;v=prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n\n }\n return res;\n}\n\ntypedef vector< double > vec;\ntypedef vector<vec> mat;\n\n\nvec gauss_jordan(const mat&A,const vec&b){\n int n=A.size();\n mat B(n,vec(n+1));\n for(int i=0;i<n;i++)\n for(int j=0;j<n;j++)B[i][j]=A[i][j];\n for(int i=0;i<n;i++)B[i][n]=b[i];\n for(int i=0;i<n;i++){\n int pivot=i;\n for(int j=i;j<n;j++)\n if(abs(B[j][i])>abs(B[pivot][i]))pivot=j;\n swap(B[i],B[pivot]);\n if(abs(B[i][i])< 0.0000001 )return vec();\n for(int j=i+1;j<=n;j++)B[i][j]/=B[i][i];\n for(int j=0;j<n;j++){\n if(i!=j)\n for(int k=i+1;k<=n;k++)B[j][k]-=B[j][i]*B[i][k];\n }\n }\n vec x(n);\n for(int i=0;i<n;i++)x[i]=B[i][n];\n return x;\n}\n\nint N,si,ti,F;\nint M;\n\nint main(){\n int T;\n cin>>T;\n while(T--){\n\n init_edge();\n cin>>N>>si>>ti>>F;\n \n mat A( N , vec(N) );\n vec B( N );\n \n for(int i=0;i<N;i++){\n for(int j=0;j<N;j++)scanf(\"%lf\",&A[i][j]);\n scanf(\"%lf\",&B[i]);\n }\n \n vec C=gauss_jordan(A,B);\n \n for(int i=0;i<N;i++){\n \n cin>>M;\n vector<int> d(M);\n vector<int> f(M);\n for(int j=0;j<M;j++)scanf(\"%d\",&d[j]);\n for(int j=0;j<M;j++)scanf(\"%d\",&f[j]);\n \n for(int j=0;j<M;j++){\n add_edge(i,d[j],f[j], abs(C[i]-C[d[j]]) );\n \n }\n }\n V=N;\n double ans=min_cost_flow(si,ti,F);\n if(ans<=-1.0){\n cout<<\"impossible\"<<endl;\n }else{\n printf(\"%.10f\\n\",ans);\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 2116,
"score_of_the_acc": -0.0406,
"final_rank": 2
},
{
"submission_id": "aoj_1095_1879429",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_V 105\n#define INF 1000000001\ntypedef pair< double ,int> P;\n\nstruct edge {\n int to;\n int cap;\n int rev;\n double cost;\n};\n\nint V;\nvector<edge> G[MAX_V];\ndouble h[MAX_V];\ndouble dist[MAX_V];\nint prevv[MAX_V],preve[MAX_V];\n\nvoid init_edge(){\n for(int i=0;i<MAX_V;i++)G[i].clear();\n}\n\nvoid add_edge(int from,int to,int cap,double cost){\n G[from].push_back((edge){to,cap,(int)G[to].size(),cost});\n G[to].push_back((edge){from,0,(int)G[from].size()-1,-cost});\n}\n\ndouble min_cost_flow(int s,int t,int f){\n double eps = 1e-5;\n double res = 0;\n fill(h,h+V,0.0);\n \n while(f>0){\n \n priority_queue< P, vector<P>, greater<P> > que;\n fill( dist, dist+V , (double)INF );\n dist[s]=0;\n que.push(P(0,s));\n\n // fill ( prevv , prevv + V , s );\n \n while(!que.empty()){\n P p = que.top(); que.pop();\n int v = p.second;\n if(dist[v]+eps < p.first)continue;\n for(int i=0;i<(int)G[v].size();i++){\n edge &e = G[v][i];\n if(e.cap>0&&dist[e.to] > eps+dist[v]+e.cost+h[v]-h[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n prevv[e.to]=v;\n preve[e.to]=i;\n que.push(P(dist[e.to],e.to));\n }\n }\n }\n\n \n if(dist[t] == INF){\n return -1;\n }\n for(int v=0;v<V;v++)h[v]+=dist[v]; \n\n int d=f;\n for(int v=t;v!=s;v=prevv[v]){\n d=min(d,G[prevv[v]][preve[v]].cap);\n }\n assert( d > 0 );\n f-=d;\n\n res+=d*h[t];\n\n for(int v=t;v!=s;v=prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n\n }\n return res;\n}\n\ntypedef vector< double > vec;\ntypedef vector<vec> mat;\n\n\nvec gauss_jordan(const mat&A,const vec&b){\n int n=A.size();\n mat B(n,vec(n+1));\n for(int i=0;i<n;i++)\n for(int j=0;j<n;j++)B[i][j]=A[i][j];\n for(int i=0;i<n;i++)B[i][n]=b[i];\n for(int i=0;i<n;i++){\n int pivot=i;\n for(int j=i;j<n;j++)\n if(abs(B[j][i])>abs(B[pivot][i]))pivot=j;\n swap(B[i],B[pivot]);\n if(abs(B[i][i])< 0.0000001 )return vec();\n for(int j=i+1;j<=n;j++)B[i][j]/=B[i][i];\n for(int j=0;j<n;j++){\n if(i!=j)\n for(int k=i+1;k<=n;k++)B[j][k]-=B[j][i]*B[i][k];\n }\n }\n vec x(n);\n for(int i=0;i<n;i++)x[i]=B[i][n];\n return x;\n}\n\nint N,si,ti,F;\nint M;\n\nint main(){\n int T;\n cin>>T;\n while(T--){\n\n init_edge();\n cin>>N>>si>>ti>>F;\n \n mat A( N , vec(N) );\n vec B( N );\n \n for(int i=0;i<N;i++){\n for(int j=0;j<N;j++)scanf(\"%lf\",&A[i][j]);\n scanf(\"%lf\",&B[i]);\n }\n \n vec C=gauss_jordan(A,B);\n \n for(int i=0;i<N;i++){\n \n cin>>M;\n vector<int> d(M);\n vector<int> f(M);\n for(int j=0;j<M;j++)scanf(\"%d\",&d[j]);\n for(int j=0;j<M;j++)scanf(\"%d\",&f[j]);\n \n for(int j=0;j<M;j++){\n add_edge(i,d[j],f[j], abs(C[i]-C[d[j]]) );\n \n }\n }\n V=N;\n double ans=min_cost_flow(si,ti,F);\n if(ans<=-1.0){\n cout<<\"impossible\"<<endl;\n }else{\n printf(\"%.10f\\n\",ans);\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 2116,
"score_of_the_acc": -0.0406,
"final_rank": 2
},
{
"submission_id": "aoj_1095_1879426",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define MAX_V 105\n#define INF 1000000001\ntypedef pair< double ,int> P;\n\nstruct edge {\n int to;\n int cap;\n int rev;\n double cost;\n};\n\nint V;\nvector<edge> G[MAX_V];\ndouble h[MAX_V];\ndouble dist[MAX_V];\nint prevv[MAX_V],preve[MAX_V];\n\nvoid init_edge(){\n for(int i=0;i<MAX_V;i++)G[i].clear();\n}\n\nvoid add_edge(int from,int to,int cap,double cost){\n G[from].push_back((edge){to,cap,(int)G[to].size(),cost});\n G[to].push_back((edge){from,0,(int)G[from].size()-1,-cost});\n}\n\ndouble min_cost_flow(int s,int t,int f){\n double eps = 1e-5;\n double res = 0;\n fill(h,h+V,0.0);\n \n while(f>0){\n \n priority_queue< P, vector<P>, greater<P> > que;\n fill( dist, dist+V , (double)INF );\n dist[s]=0;\n que.push(P(0,s));\n\n fill ( prevv , prevv + V , s );\n \n while(!que.empty()){\n P p = que.top(); que.pop();\n int v = p.second;\n if(dist[v]+eps < p.first)continue;\n for(int i=0;i<(int)G[v].size();i++){\n edge &e = G[v][i];\n if(e.cap>0&&dist[e.to] > eps+dist[v]+e.cost+h[v]-h[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n prevv[e.to]=v;\n preve[e.to]=i;\n que.push(P(dist[e.to],e.to));\n }\n }\n }\n\n \n if(dist[t] == INF){\n return -1;\n }\n for(int v=0;v<V;v++)h[v]+=dist[v]; \n\n int d=f;\n for(int v=t;v!=s;v=prevv[v]){\n d=min(d,G[prevv[v]][preve[v]].cap);\n }\n assert( d > 0 );\n f-=d;\n\n res+=d*h[t];\n\n for(int v=t;v!=s;v=prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n\n }\n return res;\n}\n\ntypedef vector< double > vec;\ntypedef vector<vec> mat;\n\n\nvec gauss_jordan(const mat&A,const vec&b){\n int n=A.size();\n mat B(n,vec(n+1));\n for(int i=0;i<n;i++)\n for(int j=0;j<n;j++)B[i][j]=A[i][j];\n for(int i=0;i<n;i++)B[i][n]=b[i];\n for(int i=0;i<n;i++){\n int pivot=i;\n for(int j=i;j<n;j++)\n if(abs(B[j][i])>abs(B[pivot][i]))pivot=j;\n swap(B[i],B[pivot]);\n if(abs(B[i][i])< 0.0000001 )return vec();\n for(int j=i+1;j<=n;j++)B[i][j]/=B[i][i];\n for(int j=0;j<n;j++){\n if(i!=j)\n for(int k=i+1;k<=n;k++)B[j][k]-=B[j][i]*B[i][k];\n }\n }\n vec x(n);\n for(int i=0;i<n;i++)x[i]=B[i][n];\n return x;\n}\n\nint N,si,ti,F;\nint M;\n\nint main(){\n int T;\n cin>>T;\n while(T--){\n\n init_edge();\n cin>>N>>si>>ti>>F;\n \n mat A( N , vec(N) );\n vec B( N );\n \n for(int i=0;i<N;i++){\n for(int j=0;j<N;j++)scanf(\"%lf\",&A[i][j]);\n scanf(\"%lf\",&B[i]);\n }\n \n vec C=gauss_jordan(A,B);\n \n for(int i=0;i<N;i++){\n \n cin>>M;\n vector<int> d(M);\n vector<int> f(M);\n for(int j=0;j<M;j++)scanf(\"%d\",&d[j]);\n for(int j=0;j<M;j++)scanf(\"%d\",&f[j]);\n \n for(int j=0;j<M;j++){\n add_edge(i,d[j],f[j], abs(C[i]-C[d[j]]) );\n \n }\n }\n V=N;\n double ans=min_cost_flow(si,ti,F);\n if(ans<=-1.0){\n cout<<\"impossible\"<<endl;\n }else{\n printf(\"%.10f\\n\",ans);\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 2116,
"score_of_the_acc": -0.0406,
"final_rank": 2
},
{
"submission_id": "aoj_1095_1879392",
"code_snippet": "#include<bits/stdc++.h>\n#define INF (1e9)\n#define N_MAX 100\nusing namespace std;\nconst double EPS=1E-8;\ntypedef vector<double> vec;\ntypedef vector<vec> mat;\n\nstruct edge{\n int to,cap,rev;\n double cost;\n};\n\nint V;\nvector<edge> G[N_MAX];\ndouble dist[N_MAX];\nint prevv[N_MAX],preve[N_MAX];\n\nvoid add_edge(int from,int to,int cap,double cost){\n G[from].push_back((edge){to,cap,G[to].size(),cost});\n G[to].push_back((edge){from,0,G[from].size()-1,-cost});\n}\n\ndouble min_cost_flow(int s,int t,int f){\n double res=0;\n while(f>0){\n fill(dist,dist+V,INF);\n dist[s]=0;\n bool update=true;\n while(update){\n update=false;\n for(int v=0;v<V;v++){\n\tif(dist[v]==INF)continue;\n\tfor(int i=0;i<G[v].size();i++){\n\t edge &e=G[v][i];\n\t if(e.cap>0&&dist[e.to]-(dist[v]+e.cost)>EPS){\n\t dist[e.to]=dist[v]+e.cost;\n\t prevv[e.to]=v;\n\t preve[e.to]=i;\n\t update=true;\n\t }\n\t}\n }\n }\n if(dist[t]==INF)return -1;\n int d=f;\n for(int v=t;v!=s;v=prevv[v])\n d=min(d,G[prevv[v]][preve[v]].cap);\n f-=d;\n res+=d*dist[t];\n for(int v=t;v!=s;v=prevv[v]){\n edge &e=G[prevv[v]][preve[v]];\n e.cap-=d;\n G[v][e.rev].cap+=d;\n }\n }\n return res;\n}\n\nvec gauss_jordan(const mat& A,const vec& b){\n int n=A.size();\n mat B(n,vec(n+1));\n for(int i=0;i<n;i++)\n for(int j=0;j<n;j++)B[i][j]=A[i][j];\n for(int i=0;i<n;i++)B[i][n]=b[i];\n for(int i=0;i<n;i++){\n int pivot=i;\n for(int j=i;j<n;j++)\n if(abs(B[j][i])>abs(B[pivot][i]))pivot=j;\n swap(B[i],B[pivot]);\n if(abs(B[i][i])<EPS)return vec();\n for(int j=i+1;j<=n;j++)B[i][j]/=B[i][i];\n for(int j=0;j<n;j++){\n if(i!=j)\n for(int k=i+1;k<=n;k++)B[j][k]-=B[j][i]*B[i][k];\n }\n }\n vec x(n);\n for(int i=0;i<n;i++)x[i]=B[i][n];\n return x;\n}\n\nint main(){\n int T,N,s,t,F,M,d[N_MAX],f[N_MAX];\n cin>>T;\n while(T--){\n cin>>N>>s>>t>>F;\n V=N;\n vec b(N);\n mat A(N,vec(N,0));\n for(int i=0;i<N;i++){\n for(int j=0;j<N;j++)cin>>A[i][j];\n cin>>b[i];\n }\n vec r=gauss_jordan(A,b);\n for(int i=0;i<N;i++){\n cin>>M;\n for(int j=0;j<M;j++)cin>>d[j];\n for(int j=0;j<M;j++)cin>>f[j];\n for(int j=0;j<M;j++)\n\tadd_edge(i,d[j],f[j],abs(r[i]-r[d[j]]));\n }\n double ans=min_cost_flow(s,t,F);\n if(ans!=-1)printf(\"%.8f\\n\",ans);\n else cout<<\"impossible\"<<endl;\n for(int i=0;i<N_MAX;i++)G[i].clear();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 330,
"memory_kb": 2076,
"score_of_the_acc": -0.0854,
"final_rank": 5
},
{
"submission_id": "aoj_1095_1868598",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX_V 300\n#define INF 1e9\nconst double EPS = 1e-8;\ntypedef vector<double> vec;\ntypedef vector<vec> mat;\ntypedef pair<double,int> P;\n \nstruct edge{\n int to,cap,rev;\n double cost;\n edge(int to,int cap,int rev,double cost) :\n\tto(to),cap(cap),rev(rev),cost(cost) {}\n};\n \nint V;\nvector<edge> G[MAX_V];\ndouble dist[MAX_V],h[MAX_V];;\nint prevv[MAX_V],preve[MAX_V];\n \nvoid add_edge(int from,int to,int cap,double cost){\n G[from].push_back(edge(to,cap,G[to].size(),cost));\n G[to].push_back(edge(from,0,G[from].size()-1,-cost));\n}\n \ndouble min_cost_flow(int s,int t,int f){\n double res = 0;\n fill(h,h+V,0);\n while(f > 0){\n\tpriority_queue<P,vector<P>,greater<P> > Q;\n\tfill(dist,dist+V,INF);\n\tdist[s] = 0;\n\tQ.push(P(0,s));\n\twhile(!Q.empty()){\n\t P p = Q.top(); Q.pop();\n\t int v = p.second;\n\t if(dist[v] < p.first) continue;\n\t for(int i = 0 ; i < (int)G[v].size() ; i++){\n\t\tedge &e = G[v][i];\n\t\tif(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to] + EPS){\n\t\t dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n\t\t prevv[e.to] = v;\n\t\t preve[e.to] = i;\n\t\t Q.push(P(dist[e.to],e.to));\n\t\t}\n\t }\n\t}\n\tif(dist[t] == INF){\n\t return -1;\n\t}\n\tfor(int v = 0 ; v < V ; v++){\n\t h[v] += dist[v];\n\t}\n\tint d = f;\n\tfor(int v = t ; v != s ; v = prevv[v]){\n\t d = min(d,G[prevv[v]][preve[v]].cap);\n\t}\n\tf -= d;\n\tres += d*h[t];\n\tfor(int v = t ; v != s ; v = prevv[v]){\n\t edge &e = G[prevv[v]][preve[v]];\n\t e.cap -= d;\n\t G[v][e.rev].cap += d;\n\t}\n }\n return res;\n}\n \nvec gauss_jordan(const mat &A,const vec &b){\n int n = A.size();\n mat B(n,vec(n+1));\n for(int i = 0 ; i < n ; i++){\n\tfor(int j = 0 ; j < n ; j++){\n\t B[i][j] = A[i][j];\n\t}\n }\n for(int i = 0 ; i < n ; i++){\n\tB[i][n] = b[i];\n }\n for(int i = 0 ; i < n ; i++){\n\tint pivot = i;\n\tfor(int j = i ; j < n ; j++){\n\t if(abs(B[j][i]) > abs(B[pivot][i])){\n\t\tpivot = j;\n\t }\n\t}\n\tswap(B[i],B[pivot]);\n\tif(abs(B[i][i]) < EPS) return vec();\n\tfor(int j = i+1 ; j <= n ; j++){\n\t B[i][j] /= B[i][i];\n\t}\n\tfor(int j = 0 ; j < n ; j++){\n\t if(i != j){\n\t\tfor(int k = i+1 ; k <= n ; k++){\n\t\t B[j][k] -= B[j][i]*B[i][k];\n\t\t}\n\t }\n\t}\n }\n vec x(n);\n for(int i = 0 ; i < n ; i++){\n\tx[i] = B[i][n];\n }\n return x;\n}\n \nvoid init(){\n for(int i = 0 ; i < MAX_V ; i++){\n\tG[i].clear();\n }\n}\n \nint main(){\n int Tc;\n cin >> Tc;\n while(Tc--){\n\tint N,s,t,F;\n\tinit();\n\tcin >> N >> s >> t >> F;\n\tmat a(N,vec(N)); vec c(N);\n\tfor(int i = 0 ; i < N ; i++){\n\t for(int j = 0 ; j < N ; j++){\n\t\tcin >> a[i][j];\n\t }\n\t cin >> c[i];\n\t}\n\tvec res = gauss_jordan(a,c);\n\tfor(int i = 0 ; i < N ; i++){\n\t int M,d[N],f;\n\t cin >> M;\n\t for(int j = 0 ; j < M ; j++){\n\t\tcin >> d[j];\n\t }\n\t for(int j = 0 ; j < M ; j++){\n\t\tcin >> f;\n\t\tadd_edge(i,d[j],f,abs(res[i]-res[d[j]]));\n\t }\n\t}\n\tV = N;\n\tdouble ans = min_cost_flow(s,t,F);\n\tif(ans == -1){\n\t printf(\"impossible\\n\");\n\t}else{\n\t printf(\"%.6f\\n\",ans);\n\t}\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 3828,
"score_of_the_acc": -0.8421,
"final_rank": 10
},
{
"submission_id": "aoj_1095_1170273",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\n#define rep(i,n) REP(i,0,n)\n\ntypedef long double D;\n\nstruct edge { int to; D cap, cost; int rev; };\n//int const INF = 1<<29;\ndouble const Inf = 1e40;\nint const Max = 300;\nD h[Max], dist[Max];\nint prevv[Max], preve[Max];\n\nint V;\n\nvector<edge> G[Max];\n\ninline void add_edge(int f, int t, D cap, D cost) {\n G[f].push_back((edge){t, cap, cost, (int)G[t].size()});\n G[t].push_back((edge){f, 0, -cost, (int)G[f].size()-1});\n}\n\ndouble const INF = 1e40;\nlong double const EPS = 1e-5;\n\ntypedef pair<D, int> P;\n\nD min_cost_flow(int S, int T, D f) {\n D ret = 0;\n fill(h, h+V, 0);\n while(f > 0) {\n priority_queue<P, vector<P>, greater<P> > pq;\n fill(dist, dist+V, INF);\n dist[S] = 0;\n pq.push(P(0, S));\n while(!pq.empty()) {\n D cost = pq.top().first;\n int curr = pq.top().second; pq.pop();\n if(dist[curr] < cost) { continue; }\n rep(i, G[curr].size()) {\n\tedge& e = G[curr][i];\n\tif(e.cap > EPS && dist[e.to] > dist[curr] + e.cost + h[curr] - h[e.to] + EPS) {\n\t dist[e.to] = dist[curr] + e.cost + h[curr] - h[e.to];\n\t prevv[e.to] = curr;\n\t preve[e.to] = i;\n\t pq.push(P(dist[e.to], e.to));\n\t}\n }\n }\n \n if(dist[T] == INF) { return -1; }\n \n rep(i, V) h[i] += dist[i];\n \n D d = f;\n for(int v = T; v!=S; v=prevv[v]) {\n d = min(d, G[prevv[v]][preve[v]].cap);\n }\n \n f -= d;\n ret += d*h[T];\n \n for(int v=T; v!=S; v=prevv[v]) {\n edge& e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n \n return ret;\n}\n\ntemplate<class T>\nvector<T> gauss_jordan(vector<vector<T> > const& A, vector<T> const& b) {\n int N = A.size();\n vector<vector<T> > B(A);\n rep(i, B.size()) B[i].resize(N+1);\n rep(i, N) B[i][N] = b[i];\n rep(i, N) {\n int pivot = i;\n REP(j, i, N) {\n if(abs(B[pivot][i]) < abs(B[j][i])) {\n\tpivot = j;\n }\n }\n swap(B[i], B[pivot]);\n \n if(abs(B[i][i]) < EPS) { return vector<T>(); }\n \n REP(j, i+1, N+1) { B[i][j] /= B[i][i]; }\n rep(j, N) if(i != j) {\n REP(k, i+1, N+2) B[j][k] -= B[j][i] * B[i][k];\n }\n }\n vector<T> x(N);\n rep(i, N) x[i] = B[i][N];\n return x;\n}\n\ntypedef vector<D> Vec;\ntypedef vector<Vec> Mat;\n\nint main() {\n \n int Tc; cin >> Tc;\n while(Tc--) {\n int N, s, t; D F; cin >> N >> s >> t >> F;\n V = N;\n rep(i, N) G[i].clear();\n \n Mat A(N, Vec(N)); Vec b(N);\n rep(i, N) {\n rep(j, N) {\n\tcin >> A[i][j];\n }\n cin >> b[i];\n }\n \n Vec X(gauss_jordan(A, b));\n \n rep(i, N) {\n int M; cin >> M;\n vector<int> ds(M);\n rep(j, M) { cin >> ds[j]; }\n rep(j, M) {\n\tD f; cin >> f;\n\t//\tcerr << i << \" -> \" << ds[j] << endl;\n\tadd_edge(i, ds[j], f, abs(X[i]-X[ds[j]]));\n }\n }\n \n D r = min_cost_flow(s, t, F);\n if(r < EPS) {\n cout << \"impossible\\n\";\n }\n else {\n printf(\"%.10Lf\\n\", r);\n }\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 3376,
"score_of_the_acc": -0.687,
"final_rank": 8
},
{
"submission_id": "aoj_1095_1164895",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX_V 300\n#define INF 1e9\nconst double EPS = 1e-8;\ntypedef vector<double> vec;\ntypedef vector<vec> mat;\ntypedef pair<double,int> P;\n\nstruct edge{\n int to,cap,rev;\n double cost;\n edge(int to,int cap,int rev,double cost) :\n to(to),cap(cap),rev(rev),cost(cost) {}\n};\n\nint V;\nvector<edge> G[MAX_V];\ndouble dist[MAX_V],h[MAX_V];;\nint prevv[MAX_V],preve[MAX_V];\n\nvoid add_edge(int from,int to,int cap,double cost){\n G[from].push_back(edge(to,cap,G[to].size(),cost));\n G[to].push_back(edge(from,0,G[from].size()-1,-cost));\n}\n\ndouble min_cost_flow(int s,int t,int f){\n double res = 0;\n fill(h,h+V,0);\n while(f > 0){\n priority_queue<P,vector<P>,greater<P> > Q;\n fill(dist,dist+V,INF);\n dist[s] = 0;\n Q.push(P(0,s));\n while(!Q.empty()){\n P p = Q.top(); Q.pop();\n int v = p.second;\n if(dist[v] < p.first) continue;\n for(int i = 0 ; i < (int)G[v].size() ; i++){\n edge &e = G[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to] + EPS){\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n Q.push(P(dist[e.to],e.to));\n }\n }\n }\n if(dist[t] == INF){\n return -1;\n }\n for(int v = 0 ; v < V ; v++){\n h[v] += dist[v];\n }\n int d = f;\n for(int v = t ; v != s ; v = prevv[v]){\n d = min(d,G[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d*h[t];\n for(int v = t ; v != s ; v = prevv[v]){\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nvec gauss_jordan(const mat &A,const vec &b){\n int n = A.size();\n mat B(n,vec(n+1));\n for(int i = 0 ; i < n ; i++){\n for(int j = 0 ; j < n ; j++){\n B[i][j] = A[i][j];\n }\n }\n for(int i = 0 ; i < n ; i++){\n B[i][n] = b[i];\n }\n for(int i = 0 ; i < n ; i++){\n int pivot = i;\n for(int j = i ; j < n ; j++){\n if(abs(B[j][i]) > abs(B[pivot][i])){\n pivot = j;\n }\n }\n swap(B[i],B[pivot]);\n if(abs(B[i][i]) < EPS) return vec();\n for(int j = i+1 ; j <= n ; j++){\n B[i][j] /= B[i][i];\n }\n for(int j = 0 ; j < n ; j++){\n if(i != j){\n for(int k = i+1 ; k <= n ; k++){\n B[j][k] -= B[j][i]*B[i][k];\n }\n }\n }\n }\n vec x(n);\n for(int i = 0 ; i < n ; i++){\n x[i] = B[i][n];\n }\n return x;\n}\n\nvoid init(){\n for(int i = 0 ; i < MAX_V ; i++){\n G[i].clear();\n }\n}\n\nint main(){\n int Tc;\n cin >> Tc;\n while(Tc--){\n int N,s,t,F;\n init();\n cin >> N >> s >> t >> F;\n mat a(N,vec(N)); vec c(N);\n for(int i = 0 ; i < N ; i++){\n for(int j = 0 ; j < N ; j++){\n cin >> a[i][j];\n }\n cin >> c[i];\n }\n vec res = gauss_jordan(a,c);\n for(int i = 0 ; i < N ; i++){\n int M,d[N],f;\n cin >> M;\n for(int j = 0 ; j < M ; j++){\n cin >> d[j];\n }\n for(int j = 0 ; j < M ; j++){\n cin >> f;\n add_edge(i,d[j],f,abs(res[i]-res[d[j]]));\n }\n }\n V = N;\n double ans = min_cost_flow(s,t,F);\n if(ans == -1){\n printf(\"impossible\\n\");\n }else{\n printf(\"%.6f\\n\",ans);\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 2052,
"score_of_the_acc": -0.0247,
"final_rank": 1
},
{
"submission_id": "aoj_1095_1164637",
"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-8)\n#define equals(a,b) (fabs((a)-(b))<EPS)\n \nusing namespace std;\n \ntypedef pair<int,int> ii;\n \nbool LT(double a,double b) { return !equals(a,b) && a < b ; }\n \nstruct Edge {\n int to,cap;\n double cost;\n int rev;\n};\n \nconst int MAX_V = 1000, IINF = INT_MAX;\nint V;\nvector<Edge> G[MAX_V];\n \ndouble h[MAX_V],dist[MAX_V];//////// fpwjefoajfpojeawfopefa\nint prevv[MAX_V], preve[MAX_V];\n \n \ninline void add_edge(int from,int to,int cap,double cost){\n G[from].push_back((Edge){to,cap,cost,G[to].size()});\n G[to].push_back((Edge){from,0,-cost,G[from].size()-1});\n}\n \ndouble min_cost_flow(int s,int t,int f){\n double res = 0;\n fill(h,h+V,0);\n while(LT(0,f)){\n priority_queue<ii,vector<ii>,greater<ii> > Q;\n fill(dist,dist+V,INT_MAX);\n dist[s] = 0;\n Q.push(ii(0,s));\n while( !Q.empty() ){\n ii p = Q.top(); Q.pop();\n int v = p.second;\n if( LT(dist[v],p.first) ) continue;\n for(int i=0;i<G[v].size();i++) {\n Edge &e = G[v][i];\n if( LT(0,e.cap) && LT(dist[v]+e.cost+h[v]-h[e.to],dist[e.to]) ) {\n dist[e.to] = dist[v]+e.cost+h[v]-h[e.to];\n prevv[e.to] = v;\n preve[e.to] = i;\n Q.push(ii(dist[e.to],e.to));\n }\n }\n }\n if( equals(dist[t],INT_MAX) ) return -1;\n rep(v,V) h[v] += dist[v];\n int d = f;\n for(int v=t;v!=s;v=prevv[v]) d = min(d,G[prevv[v]][preve[v]].cap);\n f -= d;\n res += d * h[t];\n for(int v=t;v!=s;v=prevv[v]) {\n Edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n \ntypedef vector<double> vd;\ntypedef vector<vd> mat;\n \n \n \nvector<double> f(const mat& A,const vd& b){\n int n = A.size();\n mat B(n,vd(n+1));\n rep(i,n) rep(j,n) B[i][j] = A[i][j];\n rep(i,n) B[i][n] = b[i];\n \n rep(i,n){\n int pivot = i;\n REP(j,i,n) if( LT(abs(B[pivot][i]),abs(B[j][i])) ) pivot = j;\n swap(B[i],B[pivot]);\n if( abs(B[i][i]) < EPS ) return vd();\n REP(j,i+1,n+1) B[i][j] /= B[i][i];\n rep(j,n){\n if( i != j ){\n REP(k,i+1,n+1) B[j][k] -= B[j][i] * B[i][k];\n }\n }\n } \n \n vd x(n);\n rep(i,n) x[i] = B[i][n];\n return x;\n}\n \nvoid init(int size=MAX_V){\n rep(i,size) G[i].clear();\n}\n \nint main(){\n int T;\n cin >> T;\n while( T-- ){\n int N,s,t,F;\n cin >> N >> s >> t >> F;\n mat A(N,vector<double>(N,0));\n vector<double> b(N,0);\n rep(i,N) {\n rep(j,N) {\n cin >> A[i][j];\n }\n cin >> b[i];\n }\n \n vector<double> ans = f(A,b);\n \n init();\n \n rep(i,N) {\n int M;\n cin >> M;\n vector<ii> vec(M);\n rep(j,M) cin >> vec[j].first;\n rep(j,M) cin >> vec[j].second;\n rep(j,M) {\n add_edge(i,vec[j].first,vec[j].second,abs(ans[i]-ans[vec[j].first]));\n }\n }\n \n V = N;\n double temp = min_cost_flow(s,t,F);\n if( equals(temp,-1) ) puts(\"impossible\");\n else printf(\"%.10f\\n\",temp);\n \n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 440,
"memory_kb": 2076,
"score_of_the_acc": -0.1243,
"final_rank": 6
},
{
"submission_id": "aoj_1095_1164082",
"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-8)\n#define equals(a,b) (fabs((a)-(b))<EPS)\n\nusing namespace std;\n\ntypedef pair<int,int> ii;\n\nbool LT(double a,double b) { return !equals(a,b) && a < b ; }\n\nstruct Edge {\n int to,cap;\n double cost;\n int rev;\n};\n\nconst int MAX_V = 1000, IINF = INT_MAX;\nint V;\nvector<Edge> G[MAX_V];\n\ndouble h[MAX_V],dist[MAX_V];//////// fpwjefoajfpojeawfopefa\nint prevv[MAX_V], preve[MAX_V];\n\n\ninline void add_edge(int from,int to,int cap,double cost){\n G[from].push_back((Edge){to,cap,cost,G[to].size()});\n G[to].push_back((Edge){from,0,-cost,G[from].size()-1});\n}\n\ndouble min_cost_flow(int s,int t,int f){\n double res = 0;\n fill(h,h+V,0);\n while(LT(0,f)){\n priority_queue<ii,vector<ii>,greater<ii> > Q;\n fill(dist,dist+V,INT_MAX);\n dist[s] = 0;\n Q.push(ii(0,s));\n while( !Q.empty() ){\n ii p = Q.top(); Q.pop();\n int v = p.second;\n if( LT(dist[v],p.first) ) continue;\n for(int i=0;i<G[v].size();i++) {\n\tEdge &e = G[v][i];\n\tif( LT(0,e.cap) && LT(dist[v]+e.cost+h[v]-h[e.to],dist[e.to]) ) {\n\t dist[e.to] = dist[v]+e.cost+h[v]-h[e.to];\n\t prevv[e.to] = v;\n\t preve[e.to] = i;\n\t Q.push(ii(dist[e.to],e.to));\n\t}\n }\n }\n if( equals(dist[t],INT_MAX) ) return -1;\n rep(v,V) h[v] += dist[v];\n int d = f;\n for(int v=t;v!=s;v=prevv[v]) d = min(d,G[prevv[v]][preve[v]].cap);\n f -= d;\n res += d * h[t];\n for(int v=t;v!=s;v=prevv[v]) {\n Edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\ntypedef vector<double> vd;\ntypedef vector<vd> mat;\n\n\n\nvector<double> f(const mat& A,const vd& b){\n int n = A.size();\n mat B(n,vd(n+1));\n rep(i,n) rep(j,n) B[i][j] = A[i][j];\n rep(i,n) B[i][n] = b[i];\n\n rep(i,n){\n int pivot = i;\n REP(j,i,n) if( LT(abs(B[pivot][i]),abs(B[j][i])) ) pivot = j;\n swap(B[i],B[pivot]);\n if( abs(B[i][i]) < EPS ) return vd();\n REP(j,i+1,n+1) B[i][j] /= B[i][i];\n rep(j,n){\n if( i != j ){\n\tREP(k,i+1,n+1) B[j][k] -= B[j][i] * B[i][k];\n }\n }\n } \n\n vd x(n);\n rep(i,n) x[i] = B[i][n];\n return x;\n}\n\nvoid init(int size=MAX_V){\n rep(i,size) G[i].clear();\n}\n\nint main(){\n int T;\n cin >> T;\n while( T-- ){\n int N,s,t,F;\n cin >> N >> s >> t >> F;\n mat A(N,vector<double>(N,0));\n vector<double> b(N,0);\n rep(i,N) {\n rep(j,N) {\n\tcin >> A[i][j];\n }\n cin >> b[i];\n }\n \n vector<double> ans = f(A,b);\n \n init();\n\n rep(i,N) {\n int M;\n cin >> M;\n vector<ii> vec(M);\n rep(j,M) cin >> vec[j].first;\n rep(j,M) cin >> vec[j].second;\n rep(j,M) {\n\tadd_edge(i,vec[j].first,vec[j].second,abs(ans[i]-ans[vec[j].first]));\n }\n }\n\n V = N;\n double temp = min_cost_flow(s,t,F);\n if( equals(temp,-1) ) puts(\"impossible\");\n else printf(\"%.10f\\n\",temp);\n\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 440,
"memory_kb": 2076,
"score_of_the_acc": -0.1243,
"final_rank": 6
},
{
"submission_id": "aoj_1095_1151384",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-3;\n\nbool GaussJordan(const vvd& _a,const vd& b,vd& x)\n{\n\tint n=_a.size();\n\tvvd a(n,vd(n+1));\n\trep(i,n){\n\t\tcopy(all(_a[i]),begin(a[i]));\n\t\ta[i][n]=b[i];\n\t}\n\t\n\trep(i,n){\n\t\tint p=i;\n\t\trepi(j,i+1,n) if(abs(a[p][i])<abs(a[j][i])) p=j;\n\t\tif(abs(a[p][i])<EPS) return false;\n\t\tswap(a[i],a[p]);\n\t\tperi(j,i,n+1) a[i][j]/=a[i][i];\n\t\trep(j,n) if(j!=i) peri(k,i,n+1) a[j][k]-=a[j][i]*a[i][k];\n\t}\n\t\n\trep(i,n) x[i]=a[i][n];\n\treturn true;\n}\n\nstruct Edge{\n\tint src,dst;\n\tdouble cost;\n\tint cap,flow;\n\tEdge(){}\n\tEdge(int s,int d,double co,int ca=0,int f=0):src(s),dst(d),cost(co),cap(ca),flow(f){}\n};\nbool operator<(const Edge& a,const Edge& b){return a.cost<b.cost;}\nbool operator>(const Edge& a,const Edge& b){return a.cost>b.cost;}\nstruct Graph{\n\tvector<Edge> es;\n\tvi head,next;\n\tGraph(){}\n\tGraph(int n):head(n,-1){}\n\t// コスト:-co,容量:0の逆辺も追加する\n\tvoid AddEdge(int u,int v,double co,int ca){\n\t\tes.emplace_back(u,v,co,ca); next.push_back(head[u]); head[u]=es.size()-1;\n\t\tes.emplace_back(v,u,-co,0); next.push_back(head[v]); head[v]=es.size()-1;\n\t}\n};\n\ndouble MinCostFlow(Graph& g,int tap,int sink,int flow)\n{\n\tint n=g.head.size();\n\t\n\tdouble res=0;\n\tvd pots(n);\n\twhile(flow>EPS){\n\t\tvd cost(n,INF);\n\t\tvi prev(n,-1);\n\t\tpriority_queue<Edge,vector<Edge>,greater<Edge>> pq;\n\t\tpq.emplace(-1,tap,0);\n\t\twhile(pq.size()){\n\t\t\tEdge cur=pq.top(); pq.pop();\n\t\t\tif(cur.cost>cost[cur.dst]-EPS) continue;\n\t\t\tcost[cur.dst]=cur.cost;\n\t\t\tprev[cur.dst]=cur.src;\n\t\t\tfor(int i=g.head[cur.dst];i!=-1;i=g.next[i]){\n\t\t\t\tEdge e=g.es[i];\n\t\t\t\tif(e.cap-e.flow==0) continue;\n\t\t\t\tpq.emplace(i,e.dst,cost[e.src]+e.cost+pots[e.src]-pots[e.dst]);\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(cost[sink]==INF) return -1;\n\t\trep(i,n) pots[i]+=cost[i];\n\t\t\n\t\tint augment=flow;\n\t\tfor(int v=sink;v!=tap;v=g.es[prev[v]].src){\n\t\t\tEdge e=g.es[prev[v]];\n\t\t\taugment=min(augment,e.cap-e.flow);\n\t\t}\n\t\tif(augment<EPS) return -1;\n\t\tfor(int v=sink;v!=tap;v=g.es[prev[v]].src){\n\t\t\tint i=prev[v];\n\t\t\tg.es[i].flow+=augment;\n\t\t\tg.es[i^1].flow-=augment;\n\t\t}\n\t\tflow-=augment;\n\t\tres+=augment*pots[sink];\n\t}\n\t\n\treturn res;\n}\n\nvoid solve()\n{\n\tint n,s,t,f; scanf(\"%d%d%d%d\",&n,&s,&t,&f);\n\tvd cs(n);\n\t{\n\t\tvvd a(n,vd(n));\n\t\tvd b(n);\n\t\trep(i,n){\n\t\t\trep(j,n) scanf(\"%lf\",&a[i][j]);\n\t\t\tscanf(\"%lf\",&b[i]);\n\t\t}\n\t\tGaussJordan(a,b,cs);\n\t}\n\tGraph g(n);\n\trep(i,n){\n\t\tint m; scanf(\"%d\",&m);\n\t\tvi ds(m),fs(m);\n\t\trep(j,m) scanf(\"%d\",&ds[j]);\n\t\trep(j,m) scanf(\"%d\",&fs[j]);\n\t\trep(j,m) g.AddEdge(i,ds[j],abs(cs[ds[j]]-cs[i]),fs[j]);\n\t}\n\tdouble res=MinCostFlow(g,s,t,f);\n\tif(res==-1)\n\t\tputs(\"impossible\");\n\telse\n\t\tprintf(\"%.10f\\n\",res);\n}\n\nint main()\n{\n\tint tc; scanf(\"%d\",&tc);\n\trep(_,tc) solve();\n}",
"accuracy": 1,
"time_ms": 2920,
"memory_kb": 2700,
"score_of_the_acc": -1.2928,
"final_rank": 18
},
{
"submission_id": "aoj_1095_1151381",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nbool GaussJordan(const vvd& _a,const vd& b,vd& x)\n{\n\tint n=_a.size();\n\tvvd a(n,vd(n+1));\n\trep(i,n){\n\t\tcopy(all(_a[i]),begin(a[i]));\n\t\ta[i][n]=b[i];\n\t}\n\t\n\trep(i,n){\n\t\tint p=i;\n\t\trepi(j,i+1,n) if(abs(a[p][i])<abs(a[j][i])) p=j;\n\t\tif(abs(a[p][i])<EPS) return false;\n\t\tswap(a[i],a[p]);\n\t\tperi(j,i,n+1) a[i][j]/=a[i][i];\n\t\trep(j,n) if(j!=i) peri(k,i,n+1) a[j][k]-=a[j][i]*a[i][k];\n\t}\n\t\n\trep(i,n) x[i]=a[i][n];\n\treturn true;\n}\n\nstruct Edge{\n\tint src,dst;\n\tdouble cost;\n\tint cap,flow;\n\tEdge(){}\n\tEdge(int s,int d,double co,int ca=0,int f=0):src(s),dst(d),cost(co),cap(ca),flow(f){}\n};\nbool operator<(const Edge& a,const Edge& b){return a.cost<b.cost;}\nbool operator>(const Edge& a,const Edge& b){return a.cost>b.cost;}\nstruct Graph{\n\tvector<Edge> es;\n\tvi head,next;\n\tGraph(){}\n\tGraph(int n):head(n,-1){}\n\t// コスト:-co,容量:0の逆辺も追加する\n\tvoid AddEdge(int u,int v,double co,int ca){\n\t\tes.emplace_back(u,v,co,ca); next.push_back(head[u]); head[u]=es.size()-1;\n\t\tes.emplace_back(v,u,-co,0); next.push_back(head[v]); head[v]=es.size()-1;\n\t}\n};\n\ndouble MinCostFlow(Graph& g,int tap,int sink,int flow)\n{\n\tint n=g.head.size();\n\t\n\tdouble res=0;\n\tvd pots(n);\n\twhile(flow>EPS){\n\t\tvd cost(n,INF);\n\t\tvi prev(n,-1);\n\t\tpriority_queue<Edge,vector<Edge>,greater<Edge>> pq;\n\t\tpq.emplace(-1,tap,0);\n\t\twhile(pq.size()){\n\t\t\tEdge cur=pq.top(); pq.pop();\n\t\t\tif(cur.cost>cost[cur.dst]-EPS) continue;\n\t\t\tcost[cur.dst]=cur.cost;\n\t\t\tprev[cur.dst]=cur.src;\n\t\t\tfor(int i=g.head[cur.dst];i!=-1;i=g.next[i]){\n\t\t\t\tEdge e=g.es[i];\n\t\t\t\tif(e.cap-e.flow==0) continue;\n\t\t\t\tpq.emplace(i,e.dst,cost[e.src]+e.cost+pots[e.src]-pots[e.dst]);\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(cost[sink]==INF) return -1;\n\t\trep(i,n) pots[i]+=cost[i];\n\t\t\n\t\tint augment=flow;\n\t\tfor(int v=sink;v!=tap;v=g.es[prev[v]].src){\n\t\t\tEdge e=g.es[prev[v]];\n\t\t\taugment=min(augment,e.cap-e.flow);\n\t\t}\n\t\tif(augment<EPS) return -1;\n\t\tfor(int v=sink;v!=tap;v=g.es[prev[v]].src){\n\t\t\tint i=prev[v];\n\t\t\tg.es[i].flow+=augment;\n\t\t\tg.es[i^1].flow-=augment;\n\t\t}\n\t\tflow-=augment;\n\t\tres+=augment*pots[sink];\n\t}\n\t\n\treturn res;\n}\n\nvoid solve()\n{\n\tint n,s,t,f; scanf(\"%d%d%d%d\",&n,&s,&t,&f);\n\tvd cs(n);\n\t{\n\t\tvvd a(n,vd(n));\n\t\tvd b(n);\n\t\trep(i,n){\n\t\t\trep(j,n) scanf(\"%lf\",&a[i][j]);\n\t\t\tscanf(\"%lf\",&b[i]);\n\t\t}\n\t\tGaussJordan(a,b,cs);\n\t}\n\tGraph g(n);\n\trep(i,n){\n\t\tint m; scanf(\"%d\",&m);\n\t\tvi ds(m),fs(m);\n\t\trep(j,m) scanf(\"%d\",&ds[j]);\n\t\trep(j,m) scanf(\"%d\",&fs[j]);\n\t\trep(j,m) g.AddEdge(i,ds[j],abs(cs[ds[j]]-cs[i]),fs[j]);\n\t}\n\tdouble res=MinCostFlow(g,s,t,f);\n\tif(res==-1)\n\t\tputs(\"impossible\");\n\telse\n\t\tprintf(\"%.10f\\n\",res);\n}\n\nint main()\n{\n\tint tc; scanf(\"%d\",&tc);\n\trep(_,tc) solve();\n}",
"accuracy": 1,
"time_ms": 2950,
"memory_kb": 2700,
"score_of_the_acc": -1.3034,
"final_rank": 20
},
{
"submission_id": "aoj_1095_1151376",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define dump(...) cout<<\"# \"<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<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 all(c) begin(c),end(c)\n#define mp make_pair\n#define mt make_tuple\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\n\ntemplate<typename Tuple>\nvoid print_tuple(ostream&,const Tuple&){}\ntemplate<typename Car,typename... Cdr,typename Tuple>\nvoid print_tuple(ostream& os,const Tuple& t){\n\tprint_tuple<Cdr...>(os,t);\n\tos<<(sizeof...(Cdr)?\",\":\"\")<<get<sizeof...(Cdr)>(t);\n}\ntemplate<typename... Args>\nostream& operator<<(ostream& os,const tuple<Args...>& t){\n\tprint_tuple<Args...>(os<<'(',t);\n\treturn os<<')';\n}\n\ntemplate<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>\nbasic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){\n\tos<<'[';\n\tfor(auto i=begin(c);i!=end(c);++i)\n\t\tos<<(i==begin(c)?\"\":\" \")<<*i;\n\treturn os<<']';\n}\n\nconstexpr int INF=1e9;\nconstexpr int MOD=1e9+7;\nconstexpr double EPS=1e-9;\n\nbool GaussJordan(const vvd& _a,const vd& b,vd& x)\n{\n\tint n=_a.size();\n\tvvd a(n,vd(n+1));\n\trep(i,n){\n\t\tcopy(all(_a[i]),begin(a[i]));\n\t\ta[i][n]=b[i];\n\t}\n\t\n\trep(i,n){\n\t\tint p=i;\n\t\trepi(j,i+1,n) if(abs(a[p][i])<abs(a[j][i])) p=j;\n\t\tif(abs(a[p][i])<EPS) return false;\n\t\tswap(a[i],a[p]);\n\t\tperi(j,i,n+1) a[i][j]/=a[i][i];\n\t\trep(j,n) if(j!=i) peri(k,i,n+1) a[j][k]-=a[j][i]*a[i][k];\n\t}\n\t\n\trep(i,n) x[i]=a[i][n];\n\treturn true;\n}\n\nstruct Edge{\n\tint src,dst;\n\tdouble cost;\n\tint cap,flow;\n\tEdge(){}\n\tEdge(int s,int d,double co,int ca=0,int f=0):src(s),dst(d),cost(co),cap(ca),flow(f){}\n};\nbool operator<(const Edge& a,const Edge& b){return a.cost<b.cost;}\nbool operator>(const Edge& a,const Edge& b){return a.cost>b.cost;}\nstruct Graph{\n\tvector<Edge> es;\n\tvi head,next;\n\tGraph(){}\n\tGraph(int n):head(n,-1){}\n\t// コスト:-co,容量:0の逆辺も追加する\n\tvoid AddEdge(int u,int v,double co,int ca){\n\t\tes.emplace_back(u,v,co,ca); next.push_back(head[u]); head[u]=es.size()-1;\n\t\tes.emplace_back(v,u,-co,0); next.push_back(head[v]); head[v]=es.size()-1;\n\t}\n};\n\ndouble MinCostFlow(Graph& g,int tap,int sink,int flow)\n{\n\tint n=g.head.size();\n\t\n\tdouble res=0;\n\tvd pots(n);\n\twhile(flow>EPS){\n\t\tvd cost(n,INF);\n\t\tvi prev(n,-1);\n\t\tpriority_queue<Edge,vector<Edge>,greater<Edge>> pq;\n\t\tpq.emplace(-1,tap,0);\n\t\twhile(pq.size()){\n\t\t\tEdge cur=pq.top(); pq.pop();\n\t\t\tif(cur.cost>cost[cur.dst]-EPS) continue;\n\t\t\tcost[cur.dst]=cur.cost;\n\t\t\tprev[cur.dst]=cur.src;\n\t\t\tfor(int i=g.head[cur.dst];i!=-1;i=g.next[i]){\n\t\t\t\tEdge e=g.es[i];\n\t\t\t\tif(e.cap-e.flow==0) continue;\n\t\t\t\tpq.emplace(i,e.dst,cost[e.src]+e.cost+pots[e.src]-pots[e.dst]);\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(cost[sink]==INF) return -1;\n\t\trep(i,n) pots[i]+=cost[i];\n\t\t\n\t\tint augment=flow;\n\t\tfor(int v=sink;v!=tap;v=g.es[prev[v]].src){\n\t\t\tEdge e=g.es[prev[v]];\n\t\t\taugment=min(augment,e.cap-e.flow);\n\t\t}\n\t\tif(augment<EPS) return -1;\n\t\tfor(int v=sink;v!=tap;v=g.es[prev[v]].src){\n\t\t\tint i=prev[v];\n\t\t\tg.es[i].flow+=augment;\n\t\t\tg.es[i^1].flow-=augment;\n\t\t}\n\t\tflow-=augment;\n\t\tres+=augment*pots[sink];\n\t}\n\t\n\treturn res;\n}\n\nvoid solve()\n{\n\tint n,s,t,f; cin>>n>>s>>t>>f;\n\tvd cs(n);\n\t{\n\t\tvvd a(n,vd(n));\n\t\tvd b(n);\n\t\trep(i,n){\n\t\t\trep(j,n) cin>>a[i][j];\n\t\t\tcin>>b[i];\n\t\t}\n\t\tGaussJordan(a,b,cs);\n\t}\n\tGraph g(n);\n\trep(i,n){\n\t\tint m; cin>>m;\n\t\tvi ds(m),fs(m);\n\t\trep(j,m) cin>>ds[j];\n\t\trep(j,m) cin>>fs[j];\n\t\trep(j,m) g.AddEdge(i,ds[j],abs(cs[ds[j]]-cs[i]),fs[j]);\n\t}\n\tdouble res=MinCostFlow(g,s,t,f);\n\tif(res==-1)\n\t\tputs(\"impossible\");\n\telse\n\t\tprintf(\"%.10f\\n\",res);\n}\n\nint main()\n{\n\tint tc; cin>>tc;\n\trep(_,tc) solve();\n}",
"accuracy": 1,
"time_ms": 2910,
"memory_kb": 2712,
"score_of_the_acc": -1.2949,
"final_rank": 19
}
] |
aoj_1103_cpp
|
Board Arrangements for Concentration Games
You have to organize a wedding party. The program of the
party will include a concentration game played by the
bride and groom. The arrangement of the concentration game
should be easy since this game will be played to make the
party fun.
We have a 4x4 board and 8 pairs of cards (denoted by `A' to `H')
for the concentration game:
+---+---+---+---+
| | | | | A A B B
+---+---+---+---+ C C D D
| | | | | E E F F
+---+---+---+---+ G G H H
| | | | |
+---+---+---+---+
| | | | |
+---+---+---+---+
To start the game, it is necessary to arrange all 16 cards
face down on the board. For example:
+---+---+---+---+
| A | B | A | B |
+---+---+---+---+
| C | D | C | D |
+---+---+---+---+
| E | F | G | H |
+---+---+---+---+
| G | H | E | F |
+---+---+---+---+
The purpose of the concentration game is to expose as many
cards as possible by repeatedly performing the following
procedure: (1) expose two cards, (2) keep them open if they
match or replace them face down if they do not.
Since the arrangements should be simple, every pair of cards
on the board must obey the following condition: the
relative position of one card to the other card of the pair must be
one of 4 given relative positions.
The 4 relative positions are different from one another and
they are selected from the following 24 candidates:
(1, 0), (2, 0), (3, 0),
(-3, 1), (-2, 1), (-1, 1), (0, 1), (1, 1), (2, 1), (3, 1),
(-3, 2), (-2, 2), (-1, 2), (0, 2), (1, 2), (2, 2), (3, 2),
(-3, 3), (-2, 3), (-1, 3), (0, 3), (1, 3), (2, 3), (3, 3).
Your job in this problem is to write a program that
reports the total number of board arrangements which satisfy
the given constraint. For example, if relative positions
(-2, 1), (-1, 1), (1, 1), (1, 2) are given, the total number
of board arrangements is two, where the following two
arrangements satisfy the given constraint:
X0 X1 X2 X3 X0 X1 X2 X3
+---+---+---+---+ +---+---+---+---+
Y0 | A | B | C | D | Y0 | A | B | C | D |
+---+---+---+---+ +---+---+---+---+
Y1 | B | A | D | C | Y1 | B | D | E | C |
+---+---+---+---+ +---+---+---+---+
Y2 | E | F | G | H | Y2 | F | A | G | H |
+---+---+---+---+ +---+---+---+---+
Y3 | F | E | H | G | Y3 | G | F | H | E |
+---+---+---+---+ +---+---+---+---+
the relative positions: the relative positions:
A:(1, 1), B:(-1, 1) A:(1, 2), B:(-1, 1)
C:(1, 1), D:(-1, 1) C:(1, 1), D:(-2, 1)
E:(1, 1), F:(-1, 1) E:(1, 2), F:( 1, 1)
G:(1, 1), H:(-1, 1) G:(-2, 1), H:(-1, 1)
Arrangements of the same pattern should be counted only once. Two
board arrangements are said to have the same pattern if they are
obtained from each other by repeatedly making any two pairs exchange
their positions. For example, the following two arrangements have th
...(truncated)
|
[
{
"submission_id": "aoj_1103_9626659",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\n#define FOR(i,l,r) for(int i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(A) A.begin(),A.end()\nint main(){\n while(1){\n vector<pair<int,int>>A(4);\n REP(i,4)cin>>A[i].first>>A[i].second;\n if(A[0].first>4)break;\n vector<int>C;\n REP(i,4)REP(j,4)REP(k,4)if(0<=min(i+A[k].first,j+A[k].second)&&4>max(i+A[k].first,j+A[k].second)){\n C.emplace_back((1<<(4*i+j))+(1<<(4*(i+A[k].first)+j+A[k].second)));\n }\n sort(ALL(C));\n vvi dp(C.size()+1,vi(65536));\n dp[0][0]=1;\n REP(i,C.size())REP(j,65536){\n dp[i+1][j]+=dp[i][j];\n if(!(j&C[i]))dp[i+1][j+C[i]]+=dp[i][j];\n }\n cout<<dp[C.size()][65535]<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 23112,
"score_of_the_acc": -1.12,
"final_rank": 9
},
{
"submission_id": "aoj_1103_4079671",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n#define inRange(x,a,b) (a <= x && x < b)\ntypedef long long ll;\n\nint main(){\n int x[4], y[4];\n while(cin >> x[0], x[0] < 4){\n cin >> y[0];\n for(int i = 1; i < 4; i++) cin >> x[i] >> y[i];\n vector<int> v;\n for(int i = 0; i < 4; i++){\n for(int j = 0; j < 4; j++){\n int origin = i*4+j;\n for(int k = 0; k < 4; k++){\n int ni = i+x[k], nj = j+y[k];\n if(!inRange(ni,0,4)||!inRange(nj,0,4)) continue;\n int next = ni*4+nj;\n v.push_back((1<<origin) + (1<<next));\n }\n }\n }\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n vector<ll> dp(1<<16, 0);\n dp[0] = 1;\n for(int s = 0; s < 1<<16; s++){\n for(int j : v){\n if((s&j) == 0) dp[s^j] += dp[s];\n }\n }\n cout << dp.back()/40320 << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3648,
"score_of_the_acc": -0.2378,
"final_rank": 7
},
{
"submission_id": "aoj_1103_2013913",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define F first\n#define S second\ntypedef pair<int,int> P;\nbool check(int x,int y){return x>=0&&x<4&&y>=0&&y<4;}\n \nint main() {\n int n=8,m=4;\n P d[n];\n while(cin >> d[0].F >> d[0].S) {\n for(int i=1; i<m; i++) cin >> d[i].F >> d[i].S;\n for(int i=0; i<n; i++) {\n if(d[i].F<0) {\n d[i].F*=-1;\n d[i].S*=-1;\n }\n if(d[i].F==0&&d[i].S<0) d[i].S*=-1;\n }\n int ans=0;\n for(int t=0; t<(1<<(n*2)); t++) {\n P a[n];\n for(int i=0; i<n; i++) {\n int x=t/(1<<(i*2));\n x%=4;\n a[i]=d[x];\n }\n int c[m][m];\n memset(c,-1,sizeof(c));\n int k=0;\n for(int i=0; i<m; i++) {\n for(int j=0; j<m; j++) {\n if(c[i][j]==-1) {\n int x=i+a[k].F,y=j+a[k].S;\n if(!check(x,y)||c[x][y]!=-1) goto next;\n c[i][j]=k;\n c[x][y]=k;\n k++;\n }\n }\n }\n ans++;\n next:;\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3088,
"score_of_the_acc": -0.1336,
"final_rank": 5
},
{
"submission_id": "aoj_1103_2013502",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define F first\n#define S second\ntypedef pair<int,int> P;\nbool check(int x,int y){return x>=0&&x<4&&y>=0&&y<4;}\n\nint main() {\n int n=8,m=4;\n P d[n];\n while(cin >> d[0].F >> d[0].S) {\n for(int i=1; i<m; i++) cin >> d[i].F >> d[i].S;\n for(int i=0; i<n; i++) {\n if(d[i].F<0) {\n d[i].F*=-1;\n d[i].S*=-1;\n }\n if(d[i].F==0&&d[i].S<0) d[i].S*=-1;\n }\n int ans=0;\n for(int t=0; t<(1<<(n*2)); t++) {\n P a[n];\n for(int i=0; i<n; i++) {\n int x=t/(1<<(i*2));\n x%=4;\n a[i]=d[x];\n }\n int c[m][m];\n memset(c,-1,sizeof(c));\n int k=0;\n for(int i=0; i<m; i++) {\n for(int j=0; j<m; j++) {\n if(c[i][j]==-1) {\n int x=i+a[k].F,y=j+a[k].S;\n if(!check(x,y)||c[x][y]!=-1) goto next;\n c[i][j]=k;\n c[x][y]=k;\n k++;\n }\n }\n }\n ans++;\n next:;\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2992,
"score_of_the_acc": -0.1295,
"final_rank": 4
},
{
"submission_id": "aoj_1103_1113263",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint dp[1<<16];\nint x[5];\nint y[5];\nint main(){\n\tint a;\n\twhile(scanf(\"%d\",&a),a<=4){\n\t\tx[0]=a;\n\t\tscanf(\"%d%d%d%d%d%d%d\",y,x+1,y+1,x+2,y+2,x+3,y+3);\n\t\tfor(int i=0;i<(1<<16);i++)dp[i]=0;\n\t\tdp[0]=1;\n\t\tfor(int i=0;i<(1<<16);i++){\n\t//\t\tif(dp[i])printf(\"%d: %d\\n\",i,dp[i]);\n\t\t\tfor(int j=0;j<16;j++){\n\t\t\t\tif(!(i&(1<<j))){\n\t\t\t\t\tint row=j/4;int col=j%4;\n\t\t\t\t\tfor(int k=0;k<4;k++){\n\t\t\t\t\t\tint tr=row+y[k];\n\t\t\t\t\t\tint tc=col+x[k];\n\t\t\t\t\t\tif(tr<0||tc<0||tr>3||tc>3||((i+(1<<j))&(1<<(tr*4+tc))))continue;\n\t\t\t\t\t\tdp[i+(1<<j)+(1<<(tr*4+tc))]+=dp[i];\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\tprintf(\"%d\\n\",dp[(1<<16)-1]);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1284,
"score_of_the_acc": -0.0556,
"final_rank": 3
},
{
"submission_id": "aoj_1103_792684",
"code_snippet": "#include<iostream>\n#include<set>\n#include<cassert>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n \n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<29)\n \nusing namespace std;\n \ntypedef pair<int,int> ii;\nset<string> used;\nint cnt = 0;\nii raint[4];\n \nvoid dfs(int cur,int st,string perm)\n{\n if(cur >= 8)\n {\n if(used.find(perm) != used.end())return;\n used.insert(perm);\n rep(i,16)if(perm[i] == 'x')return;\n cnt++;\n return;\n }\n \n REP(i,st,16)\n {\n int x = i%4;\n int y = i/4;\n rep(j,4)\n {\n int nx = x + raint[j].first;\n int ny = y + raint[j].second;\n if(!(0 <= nx && nx < 4 && 0 <= ny && ny < 4))continue;\n if(perm[nx+ny*4] != 'x')continue;\n string nperm = perm;\n nperm[x+y*4] = nperm[nx+ny*4] = (char)('0'+cur);\n dfs(cur+1,i+1,nperm);\n }\n }\n \n}\n \nint main()\n{\n while(cin >> raint[0].first,raint[0].first <= 4)\n {\n used.clear();\n cin >> raint[0].second;\n REP(i,1,4)cin >> raint[i].first >> raint[i].second;\n cnt = 0;\n string perm = string(16,'x');\n \n dfs(0,0,perm);\n \n cout << cnt << endl;\n }\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 6992,
"score_of_the_acc": -1.2625,
"final_rank": 10
},
{
"submission_id": "aoj_1103_792617",
"code_snippet": "#include<iostream>\n#include<set>\n#include<cassert>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<29)\n\nusing namespace std;\n\ntypedef pair<int,int> ii;\nset<string> used;\nint cnt = 0;\nii raint[4];\n\nvoid dfs(int cur,int st,string perm)\n{\n if(cur >= 8)\n {\n if(used.find(perm) != used.end())return;\n used.insert(perm);\n rep(i,16)if(perm[i] == 'x')return;\n\tcnt++;\n return;\n }\n\n REP(i,st,16)\n {\n int x = i%4;\n int y = i/4;\n rep(j,4)\n\t{\n\t int nx = x + raint[j].first;\n\t int ny = y + raint[j].second;\n\t if(!(0 <= nx && nx < 4 && 0 <= ny && ny < 4))continue;\n\t if(perm[nx+ny*4] != 'x')continue;\n\t string nperm = perm;\n\t nperm[x+y*4] = nperm[nx+ny*4] = (char)('0'+cur);\n\t dfs(cur+1,i+1,nperm);\n\t}\n }\n\n}\n\nint main()\n{\n while(cin >> raint[0].first,raint[0].first <= 4)\n {\n used.clear();\n cin >> raint[0].second;\n REP(i,1,4)cin >> raint[i].first >> raint[i].second;\n cnt = 0;\n string perm = string(16,'x');\n\n dfs(0,0,perm);\n\n cout << cnt << endl;\n }\n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 6992,
"score_of_the_acc": -1.3025,
"final_rank": 11
},
{
"submission_id": "aoj_1103_561640",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nconst int dx[24] = {-3,-3,-3,-2,-2,-2,-1,-1,-1,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3};\nconst int dy[24] = {1,2,3,1,2,3,1,2,3,1,2,3,0,1,2,3,0,1,2,3,0,1,2,3};\nconst int H = 4;\nconst int W = 4;\nconst int N = H*W;\nint dp[2][1<<N];\n\nint main() {\n int dx[4], dy[4];\n while(cin >> dx[0] && dx[0] <= 4) {\n cin >> dy[0];\n for(int i = 1; i < 4; ++i) cin >> dx[i] >> dy[i];\n\n fill(dp[0], dp[2], 0);\n dp[0][0] = 1;\n for(int t = 0; t < N; ++t) {\n int i = t / W; \n int j = t % W;\n int p = t % 2;\n int q = 1 - p;\n for(int k = 0; k < (1<<N); ++k) dp[q][k] = 0;\n for(int k = 0; k < (1<<N); ++k) {\n if(k & (1<<t)) {\n dp[q][k] += dp[p][k];\n } else {\n for(int m = 0; m < 4; ++m) {\n int ni = i + dy[m];\n int nj = j + dx[m];\n int nt = ni * W + nj;\n if(ni < 0 || ni >= H) continue;\n if(nj < 0 || nj >= W) continue;\n if(k & (1<<nt)) continue;\n dp[q][k|(1<<t)|(1<<nt)] += dp[p][k];\n }\n }\n }\n }\n cout << dp[N%2][(1<<N)-1] << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1672,
"score_of_the_acc": -0.1923,
"final_rank": 6
},
{
"submission_id": "aoj_1103_368200",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cstring>\n\n#define LP(i,n) for(int i = 0; i < n; i++)\n\nusing namespace std;\n\nint s;\nint x[4][2];\n\nvoid comb(int y[8], int n){\n\tif(n == 8){\n\t\tint p[4][4];\n\t\tmemset(p,0,sizeof p);\n\t\tint idx = 0;\n\t\tfor(int j = 0 ; j< 4 ;j++){\n\t\t\tfor(int i = 0; i < 4; i++){\n\t\t\t\tif(p[i][j]==0){\n\t\t\t\t\tif(0<=i+x[y[idx]][0]&&i+x[y[idx]][0]<4&&0<=j+x[y[idx]][1]&&j+x[y[idx]][1]<4&&p[i+x[y[idx]][0]][j+x[y[idx]][1]] == 0){\n\t\t\t\t\t\tp[i+x[y[idx]][0]][j+x[y[idx]][1]] = ++idx;\n\t\t\t\t\t}else return;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\ts++;\n\t\treturn;\n\t}\n\tfor(int i = 0; i < 4; i++){\n\t\ty[n] = i;\n\t\tcomb(y,n+1);\n\t}\n}\n\nint main(){\n\tcin >> **x;\n\twhile(**x < 5){\n\t\ts = 0;\n\t\tfor(int i = 1; i < 8; i++){\n\t\t\tcin >> *(*x+i);\n\t\t}\n\t\tint y[8];\n\t\tcomb(y,0);\n\t\tcout << s << endl;\n\t\tcin >> **x;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1103_139000",
"code_snippet": "#include<iostream>\n#include<set>\nusing namespace std;\n\nstruct board{\n char M[4][4];\n board(){\n for(int i = 0; i < 4; ++i)for(int j = 0; j < 4; ++j)M[i][j]='*';\n }\n bool isinside(const pair<int,int> &p)const{\n return 0<=p.first&&p.first<4&&0<=p.second&&p.second<4;\n }\n bool fillable(const pair<int,int> &p)const{\n return M[p.first][p.second]=='*';\n }\n bool filled()const{\n for(int i = 0; i < 4; ++i)\n for(int j = 0; j < 4; ++j)\n\tif(M[i][j]=='*')return false;\n return true;\n }\n bool operator<(const board &b)const{\n for(int i=0;i<4;++i){\n for(int j=0;j<4;++j){\n\tif(M[i][j]!=b.M[i][j])return M[i][j]<b.M[i][j];\n }\n }\n return false;\n }\n void print()const{\n for(int i = 0; i < 4; ++i){\n for(int j = 0; j < 4; ++j){\n\tcout << M[i][j] << ' ';\n }\n cout << endl;\n }\n cout << endl;\n }\n};\n\nvoid dfsFill(char c, board &b, pair<int,int> relpos[4], set<board> &vis, set<board> &S){\n if(vis.find(b)==vis.end()){\n vis.insert(b);\n }else return ;\n if(b.filled()){\n S.insert(b);\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\tpair<int,int> np(i,j);\n\tpair<int,int> next(i+relpos[k].first,j+relpos[k].second);\n\tif(b.isinside(next)&&b.fillable(np)&&b.fillable(next)){\n\t char t1,t2;\n\t t1=b.M[np.first][np.second];\n\t b.M[np.first][np.second]=c+k;\n\t t2=b.M[next.first][next.second];\n\t b.M[next.first][next.second]=c+k;\n\n\t dfsFill(c,b,relpos,vis,S);\n\n\t b.M[next.first][next.second]=t2;\n\t b.M[np.first][np.second]=t1;\n\t}\n }\n }\n }\n}\n\nint solve(pair<int,int> relpos[4]){\n board init;\n set<board> S,vis;\n dfsFill('A', init, relpos, vis, S);\n return S.size();\n}\n\nint main(){\n while(true){\n pair<int,int> relpos[4];\n for(int i = 0; i < 4; ++i){\n int x,y;\n cin >> x;\n if(x>4)return 0;\n cin >> y;\n relpos[i] = make_pair(y,x);\n }\n cout << solve(relpos) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 2372,
"score_of_the_acc": -0.8226,
"final_rank": 8
},
{
"submission_id": "aoj_1103_45021",
"code_snippet": "#include<iostream>\n#include<map>\n#define rep(i,n) for(int i=0;i<n;i++)\nusing namespace std;\npair<int,int> rp[4];\nchar bd[4][4];\nint dfs(char c){\n\tif(c=='I')return 1;\n\tint r=0;\n\trep(y,4)rep(x,4)if(bd[y][x]=='.'){\n\t\tbd[y][x]=c;\n\t\trep(k,4){\n\t\t\tint ny=y+rp[k].first,nx=x+rp[k].second;\n\t\t\tif(0<=ny&&ny<4&&0<=nx&&nx<4&&bd[ny][nx]=='.'){\n\t\t\t\tbd[ny][nx]=c;\n\t\t\t\tr+=dfs(c+1);\n\t\t\t\tbd[ny][nx]='.';\n\t\t\t}\n\t\t}\n\t\tbd[y][x]='.';\n\t\tif(r>0)return r;\n\t}\n\treturn 0;\n}\nint main(){\n\tint a,b;\n\twhile(cin>>a,a<5){\n\t\tcin>>b; rp[0]=make_pair(b,a);\n\t\trep(i,3)cin>>a>>b,rp[i+1]=make_pair(b,a);\n\t\trep(i,4)rep(j,4)bd[i][j]='.';\n\t\tcout<<dfs('A')<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_1107_cpp
|
Spiral Footrace
Let us enjoy extraordinary footraces at an athletic field.
Before starting the race, small flags representing checkpoints are set up
at random on the field. Every runner has to pass all the checkpoints one by
one in the spiral order specified below.
The starting point is the southwest corner of the athletic field.
At the starting point, runners are facing north.
During the race, they run clockwise in a spiral passing
every checkpoint as illustrated in the following figure.
When moving from one flag to the next, they take a straight path.
This means that the course of a race is always piecewise linear.
Upon arriving at some flag, a runner has to determine the next flag
among those that are not yet visited.
That flag shall be the one at the smallest angle to the right of the direction
that the runner is facing. When more than two flags are on the same straight
line, the runner visits the nearest flag first.
The goal position is the place of the last visited flag.
Your job is to write a program that calculates the length of the course from
the starting point to the goal, supposing that the course consists of
line segments connected by flags.
The position of each flag is given by a coordinate pair
(
x
i
,
y
i
), which is limited
to the first quadrant. The starting point is fixed to the origin (0, 0) where a
flag is always set up.
Input
The input contains multiple data sets, each representing a collection of
flag positions for a footrace. A data set is given in the following
format.
n
x
1
y
1
x
2
y
2
...
x
n
y
n
Here,
n
is the number of flag positions (1 <=
n
<= 400).
The position of the
i
-th flag is given by
(
x
i
,
y
i
), where
x
i
and
y
i
are integers
in meter between 0 and 500 inclusive.
There may be white spaces (blanks and/or tabs) before, in between, or after
x
i
and
y
i
.
Once a certain
coordinate pair (
x
i
,
y
i
) is given,
the same one will not appear later in the data set, and the origin (0, 0)
will not appear either.
A data set beginning with
n
= 0 indicates end of the input.
Output
For each data set, your program should output the length of the running course
in meter. Each length should appear on a separate line, with
one digit to the right of the decimal point, after rounding it to one
decimal place.
Sample Input
8
60 70
20 40
50 50
70 10
10 70
80 90
70 50
100 50
5
60 50
0 80
60 20
10 20
60 80
0
Output for the Sample Input
388.9
250.0
|
[
{
"submission_id": "aoj_1107_748379",
"code_snippet": "/*\n#include<iostream>\n#include<cstdio>\n#include<cmath>\n#include<sstream>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#include<vector>\n#include<map>\n#include<set>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\n#define F first\n#define S second\n#define all(n) (n).begin(),(n).end()\n#define EPS (1e-8)\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#define equals(a,b) (fabs((a)-(b)) < EPS)\nusing namespace std;\ntypedef pair<int,int> ii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\nstruct Point\n{\n double x,y;\n int index;\n Point(double x=-inf,double y=-inf):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 p){return Point(x*p,y*p);}\n \n bool operator < (const Point& p)const\n {\n return !equals(x,p.x)?x < p.x:y > p.y;\n }\n bool operator == (const Point &p)const\n {\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n }\n};\n \nstruct Segment\n{\n Point p1,p2;\n Segment(Point p1=Point(-inf,-inf),Point p2=Point(-inf,-inf)):p1(p1),p2(p2){}\n};\n \ntypedef vector<Point> Polygon;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n \ndouble dot(Point a,Point b)\n{\n return a.x*b.x+a.y*b.y;\n}\n \ndouble cross(Point a,Point b)\n{\n return a.x*b.y-a.y*b.x;\n}\n \ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n \ndouble toRad(double agl)\n{\n return agl*M_PI/180.0;\n}\n \nint ccw(Point p0,Point p1,Point p2)\n{\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 \n \nbool PointEquals(Point a,Point b)\n{\n return equals(a.x,b.x) && equals(a.y,b.y);\n}\n \ndouble abs(Point a)\n{\n return sqrt(norm(a));\n}\n \ndouble getDistanceLP(Line s,Point p)\n{\n return abs(cross(s.p2-s.p1,p-s.p1))/abs(s.p2-s.p1);\n}\n \ndouble getDistanceSP(Segment s,Point p)\n{\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 \nPolygon andrewScan(Polygon s,Point now)\n{\n Polygon u,l;\n if(s.size() < 3)return s;\n sort(all(s));\n \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 \n REP(i,2,s.size())\n {\n for(int n=u.size();n>=2 && ccw(u[n-2],u[n-1],s[i]) != CLOCKWISE;n--)\n {\n u.pop_back();\n }\n u.push_back(s[i]);\n }\n \n for(int i=s.size()-3;i>=0;i--)\n {\n for(int n=l.size();n>=2 && ccw(l[n-2],l[n-1],s[i]) != CLOCKWISE;n--)\n {\n l.pop_back();\n }\n l.push_back(s[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 reverse(l.begin(),l.end());\n \n\n vector<Point> ret;\n \n bool f = false;\n rep(i,l.size())\n {\n if(l[i].index == now.index)f = true;\n if(f == false)continue;\n ret.push_back(l[i]);\n rep(j,s.size())\n {\n if(s[j].index == l[i].index || s[j].index == l[(i+1)%l.size()].index)continue;\n if(getDistanceSP(Segment(l[i],l[(i+1)%l.size()]),s[j]) == ON_SEGMENT)ret.push_back(s[j]);\n }\n }\n \n rep(i,l.size())\n {\n if(l[i].index == now.index)f = false;\n if(f == false)break;\n ret.push_back(l[i]);\n \n rep(j,s.size())\n {\n if(s[j].index == l[i].index || s[j].index == l[(i+1)%l.size()].index)continue;\n if(getDistanceSP(Segment(l[i],l[(i+1)%l.size()]),s[j]) == ON_SEGMENT)ret.push_back(s[j]);\n }\n \n }\n \n \n return ret;\n}\n\nvector<Point> convex_hull(vector<Point> ps) {\n int n = ps.size(), k = 0;\n sort(ps.begin(), ps.end());\n vector<Point> 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} \n\n \nint n;\nvector<Point> input;\n \nvoid inputt()\n{\n input.clear();\n input.resize(n);\n rep(i,n)\n {\n cin >> input[i].x >> input[i].y;\n input[i].index = i; \n }\n}\n \nvoid solve()\n{\n bool used[n];\n rep(i,n)used[i] = false;\n double L = 0;\n Point cur = Point(0,0); \n cur.index = -1; \n\n rep(_,n)\n {\n vector<Point> toConvex;\n rep(i,n)\n\t{\n\t if(used[i])continue;\n\t toConvex.push_back(input[i]);\n\t}\n toConvex.push_back(cur);\n\n toConvex = convex_hull(toConvex);\n reverse(toConvex.begin(),toConvex.end());\n\n vector<Point> tmp;\n rep(j,toConvex.size())\n\t{\n\t tmp.push_back(toConvex[j]);\n\t rep(i,n)\n\t {\n\t if(used[i])continue;\n\t if(toConvex[j].index == input[i].index || toConvex[(j+1)%toConvex.size()].index == input[i].index)continue;\n\t if(equals(getDistanceSP(Segment(toConvex[j],toConvex[(j+1)%toConvex.size()]),input[i]),0))\n\t\t{\n\t\t tmp.push_back(input[i]);\n\t\t}\n\t }\n\t}\n toConvex = tmp;\n\n \n cout << \"toConvex----- cur : \" << cur.x << \",\" << cur.y << endl;\n rep(i,toConvex.size())\n {\n\t cout << toConvex[i].x << \",\" << toConvex[i].y << \" \" << toConvex[i].index<< endl;\n\t}\n cout << endl;\n \n\n int next = -inf;\n rep(i,toConvex.size())\n\t{\n\t if(toConvex[i].index == cur.index)\n\t {\n\t next = toConvex[(i+1)%toConvex.size()].index;\n\t break;\n\t }\n\t}\n \n assert(next != -inf);\n cout << \"next = \" << next << \" : \" << input[next].x << \",\" << input[next].y << endl;\n used[next] = true;\n L += sqrt(norm(cur-input[next]));\n cur = input[next];\n\n }\n\n L *= 10.0;\n L = round(L);\n L /= 10.0;\n cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n}\n \nint main()\n{\n while(cin >> n,n)\n {\n inputt();\n\n solve();\n \n }\n return 0;\n}\n\n//変数に一旦いれてたらばぐった\n\n*/\n\n#include<cstdio>\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\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#define all(n) (n).begin(),(n).end()\n#define pow2(a) (a)*(a)\nusing namespace std;\ndouble EPS = 1e-9;\n\nbool equals(double a,double b)\n{\n return fabs((a)-(b)) < EPS;\n}\n\nclass Point\n{\n public:\n int x,y;\n\n Point(int x = -1,int y = -1): 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 * (int a){return Point(a*x,a*y);}\n Point operator / (int a){return Point(x/a,y/a);}//※イケメンに限る\n\n bool operator < (const Point& p) const\n {\n return x != p.x?x<p.x:y<p.y;\n }\n\n};\n\nstruct Segment\n{\n Point p1,p2;\n Segment(Point p1 = Point(-1,-1),Point p2 = Point(-1,-1)):p1(p1),p2(p2){}\n};\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\n\ndouble dot(Point a,Point b)\n{\n return a.x*b.x + a.y*b.y;\n}\n\ndouble cross(Point a,Point b)\n{\n return a.x*b.y - a.y*b.x;\n}\n\ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n\ndouble getArgV2(Point A,Point B)\n{\n //return acos(dot(A,B)/(sqrt(norm(A))*sqrt(norm(B))));\n double a = sqrt(norm(A));\n double b = sqrt(norm(B));\n return acos(dot(A,B)/(a*b));\n}\n\nbool cmp(const Point &a,const Point &b)\n{\n if(a.x != b.x)return a.x < b.x;\n return a.y < b.y;\n}\n\nPoint ps[1000];\nbool used[1000];\n\nint main()\n{\n \n int n;\n while(cin >> n,n)\n {\n rep(i,n)cin >> ps[i].x >> ps[i].y;\n Point cur(0,0);\n Point cur2(0,-500);\n double L = 0;\n int last = n;\n\n rep(_,n)\n\t{\n\t /*\n\t cout << \"remain\"<<endl;\n\t rep(i,last)\n\t {\n\t cout << ps[i].x << \",\" << ps[i].y << endl;\n\t }\n\t cout << endl;\n\t */\n\t int next = 0;\n\t REP(i,1,last)\n\t {\n\t if(equals(atan2(ps[next].y-cur.y,ps[next].x-cur.x),atan2(ps[i].y-cur.y,ps[i].x-cur.x)))\n\t //if(equals(getArgV2(cur-cur2,ps[next]-cur), getArgV2(cur-cur2,ps[i]-cur)))\n\t\t{\n\t\t if(pow2(cur.x-ps[next].x)+pow2(cur.y-ps[next].y) > pow2(cur.x-ps[i].x)+pow2(cur.y-ps[i].y))\n\t\t {\n\t\t next = i;\n\t\t }\n\t\t}\n\t else if(getArgV2(cur-cur2,ps[next]-cur) > getArgV2(cur-cur2,ps[i]-cur))\n\t\t{\n\t\t next = i;\n\t\t}\n\t }\n\t //cout << \"erase : \" << ps[next].x << \",\" << ps[next].y << endl;\n\t L += sqrt(pow2(cur.x-ps[next].x)+pow2(cur.y-ps[next].y));\n\t cur2 = cur;\n\t cur = ps[next];\n\t ps[next] = ps[last-1];\n\t last--;\n\t}\n \n L *= 10;\n L = round(L);\n L /= 10.0;\n cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n //printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n\n\n/*\nint main()\n{\n Point A = Point(0,10);\n Point B = Point(-10,15);\n\n cout << atan2(B.y-A.y,B.x-A.x)*180/M_PI << endl;\n B = Point(11,20);\n cout << atan2(B.y-A.y,B.x-A.x)*180/M_PI << endl;\n\n\n int n; \n while(cin >> n,n)\n {\n \n\n Point cur1 = Point(0,0);\n Point cur2 = Point(0,0);\n\n rep(i,n)\n\t{\n\t cin >> ps[i].x >> ps[i].y;\n\t cout << i << \" :: \" << ps[i].x << \",\" << ps[i].y << endl;\n\t used[i] = false;\n\t}\n cout << atan2(ps[5].y-ps[4].y,ps[5].x-ps[4].x)*180/M_PI << endl;\n cout << \"##### \" << getArgV2(ps[5]-ps[4],ps[4]-Point(0,0))*180/M_PI << endl;\n sort(ps,ps+n,cmp);\n\n\n\n bool f = true;\n double L = 0;\n rep(_,n)\n\t{\n\t if(_ == 0)\n\t {\n\t L += sqrt(norm(ps[0]-cur1));\n\t cur1 = ps[0];\n\t used[0] = true;\n\t //cout << \"L = \" << L << endl;\n\t continue;\n\t }\n\t double minArg = inf;\n\t double minDist = inf;\n\t int minpos = -inf;\n\t rep(i,n)\n\t {\n\t if(used[i])continue;\n\n\t //cout << \"cur1(\" << cur1.x << \",\" << cur1.y << \")\" << endl;\n\t //cout << \"cur2(\" << cur2.x << \",\" << cur2.y << \")\" << endl;\n\t //cout << \"ps[\"<<i<<\"](\" << ps[i].x << \",\" << ps[i].y << \")\" << endl;\n\n\t double arg = getArgV2(cur1-cur2,ps[i]-cur1);\n\n\t if(f)\n\t\t{\n\t\t f = false;\n\t\t minpos = i;\n\t\t minArg = arg;\n\t\t continue;\n\t\t}\n\n\t //cout << arg << \" ::: \" << endl;\n\t if(!equals(arg,minArg) && arg < minArg)\n\t\t{\n\t\t minpos = i;\n\t\t minArg = arg;\n\t\t minDist = sqrt(norm(cur1-ps[i]));\n\t\t}\n\t if(equals(arg,minArg) && sqrt(norm(cur1-ps[minpos])) > sqrt(norm(cur1-ps[i])))\n\t\t{\n\t\t minDist = sqrt(norm(cur1-ps[i]));\n\t\t minpos = i;\n\t\t\n\t\t}\n\n\t }\n\t //cout << \"cur1 (\" << cur1.x << \",\" << cur1.y << \")\" << endl;\n\t //cout << \"phase #\" << _ << \" \" << minpos << \"(\" << ps[minpos].x << \",\" << ps[minpos].y << \")\" << endl;\n\t //cout << \"that arg is \" << minArg*180/M_PI << endl;\n\n\t //assert(minpos != -inf);\n\t used[minpos] = true;\n\t L += sqrt(norm(cur1-ps[minpos]));\n\t cur2 = cur1;\n\t cur1 = ps[minpos];\n\n\t //cout << \"L = \" << L << endl << endl;\n\t}\n //L *= 10.0;\n //L = round(L);\n //L /= 10.0;\n //cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n*/\n/*\n#include<cstdio>\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\n#define all(n) (n).begin(),(n).end()\n\nusing namespace std;\ndouble EPS = 1e-9;\n\nbool equals(double a,double b)\n{\n return fabs((a)-(b)) < EPS;\n}\n\nstruct Point\n{\n double x,y;\n Point(double x=-inf,double y=-inf):x(x),y(y){}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n bool operator < (const Point &b)const\n {\n if(x != b.x)return x < b.x;\n return y < b.y;\n }\n};\n\nPoint ps[410];\nbool use[410];\n\ndouble toRad(double agl){ return agl*M_PI/180; }\n\ndouble getArg(Point a,Point bb)\n{\n\n}\n\ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n\nint main()\n{\n int n;\n while(cin >> n,n)\n {\n rep(i,n)\n\t{\n\t cin >> ps[i].x >> ps[i].y;\n\t use[i] = false;\n\t}\n sort(ps,ps+n);\n\n Point cur = Point(0,0);\n Point cur2 = Point(0,0);\n double L = 0;\n rep(_,n)\n\t{\n\t if(!_)\n\t {\n\t cur = ps[0];\n\t use[0] = true;\n\t L += sqrt(norm(cur-ps[0]));\n\t continue;\n\t }\n\t cout << \"cur \" << cur.x << \",\" << cur.y << endl;\n\t cout << \"cur2 \" << cur2.x << \",\" << cur2.y << endl;\n\t int next = -inf;\n\t double maxArg = -inf;\n\n\t rep(i,n)\n\t {\n\t if(use[i])continue;\n\t //cout << \"i = \"<< i << endl;\n\n\t Point cc = cur - cur2;\n\t double arg = atan2(ps[i].y-cc.y,ps[i].x-cc.x);\n\n\t if(!equals(arg,toRad(90)) && arg > toRad(90))arg = toRad(-180)-(toRad(180)-arg);\n\t cout << i << \" arg = \" << arg*180/M_PI << \" max : \" << maxArg << endl;\n\t if(!equals(arg,maxArg) && arg > maxArg)\n\t\t{\n\t\t maxArg = arg;\n\t\t next = i;\n\t\t}\n\t else if(equals(arg,maxArg) && norm(ps[next]-cur) > norm(ps[i]-cur) )\n\t\t{\n\t\t next = i;\n\t\t}\n\t //cout << endl;\n\t }\n\t cout << \"next = \" << next << \" \" << ps[next].x << \",\" << ps[next].y << endl;\n\t assert(next != -inf);\n\t L += sqrt(pow(cur.x-ps[next].x,2)+pow(cur.y-ps[next].y,2));\n\t\n\n\t cur2 = cur;\n\t cur = ps[next];\n\t use[next] = true;\n\t cout << endl << endl;\n\t}\n\n printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n\n\n\n\n\n*/",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1376,
"score_of_the_acc": -1.0185,
"final_rank": 9
},
{
"submission_id": "aoj_1107_748377",
"code_snippet": "/*\n#include<iostream>\n#include<cstdio>\n#include<cmath>\n#include<sstream>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#include<vector>\n#include<map>\n#include<set>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\n#define F first\n#define S second\n#define all(n) (n).begin(),(n).end()\n#define EPS (1e-8)\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#define equals(a,b) (fabs((a)-(b)) < EPS)\nusing namespace std;\ntypedef pair<int,int> ii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\nstruct Point\n{\n double x,y;\n int index;\n Point(double x=-inf,double y=-inf):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 p){return Point(x*p,y*p);}\n \n bool operator < (const Point& p)const\n {\n return !equals(x,p.x)?x < p.x:y > p.y;\n }\n bool operator == (const Point &p)const\n {\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n }\n};\n \nstruct Segment\n{\n Point p1,p2;\n Segment(Point p1=Point(-inf,-inf),Point p2=Point(-inf,-inf)):p1(p1),p2(p2){}\n};\n \ntypedef vector<Point> Polygon;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n \ndouble dot(Point a,Point b)\n{\n return a.x*b.x+a.y*b.y;\n}\n \ndouble cross(Point a,Point b)\n{\n return a.x*b.y-a.y*b.x;\n}\n \ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n \ndouble toRad(double agl)\n{\n return agl*M_PI/180.0;\n}\n \nint ccw(Point p0,Point p1,Point p2)\n{\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 \n \nbool PointEquals(Point a,Point b)\n{\n return equals(a.x,b.x) && equals(a.y,b.y);\n}\n \ndouble abs(Point a)\n{\n return sqrt(norm(a));\n}\n \ndouble getDistanceLP(Line s,Point p)\n{\n return abs(cross(s.p2-s.p1,p-s.p1))/abs(s.p2-s.p1);\n}\n \ndouble getDistanceSP(Segment s,Point p)\n{\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 \nPolygon andrewScan(Polygon s,Point now)\n{\n Polygon u,l;\n if(s.size() < 3)return s;\n sort(all(s));\n \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 \n REP(i,2,s.size())\n {\n for(int n=u.size();n>=2 && ccw(u[n-2],u[n-1],s[i]) != CLOCKWISE;n--)\n {\n u.pop_back();\n }\n u.push_back(s[i]);\n }\n \n for(int i=s.size()-3;i>=0;i--)\n {\n for(int n=l.size();n>=2 && ccw(l[n-2],l[n-1],s[i]) != CLOCKWISE;n--)\n {\n l.pop_back();\n }\n l.push_back(s[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 reverse(l.begin(),l.end());\n \n\n vector<Point> ret;\n \n bool f = false;\n rep(i,l.size())\n {\n if(l[i].index == now.index)f = true;\n if(f == false)continue;\n ret.push_back(l[i]);\n rep(j,s.size())\n {\n if(s[j].index == l[i].index || s[j].index == l[(i+1)%l.size()].index)continue;\n if(getDistanceSP(Segment(l[i],l[(i+1)%l.size()]),s[j]) == ON_SEGMENT)ret.push_back(s[j]);\n }\n }\n \n rep(i,l.size())\n {\n if(l[i].index == now.index)f = false;\n if(f == false)break;\n ret.push_back(l[i]);\n \n rep(j,s.size())\n {\n if(s[j].index == l[i].index || s[j].index == l[(i+1)%l.size()].index)continue;\n if(getDistanceSP(Segment(l[i],l[(i+1)%l.size()]),s[j]) == ON_SEGMENT)ret.push_back(s[j]);\n }\n \n }\n \n \n return ret;\n}\n\nvector<Point> convex_hull(vector<Point> ps) {\n int n = ps.size(), k = 0;\n sort(ps.begin(), ps.end());\n vector<Point> 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} \n\n \nint n;\nvector<Point> input;\n \nvoid inputt()\n{\n input.clear();\n input.resize(n);\n rep(i,n)\n {\n cin >> input[i].x >> input[i].y;\n input[i].index = i; \n }\n}\n \nvoid solve()\n{\n bool used[n];\n rep(i,n)used[i] = false;\n double L = 0;\n Point cur = Point(0,0); \n cur.index = -1; \n\n rep(_,n)\n {\n vector<Point> toConvex;\n rep(i,n)\n\t{\n\t if(used[i])continue;\n\t toConvex.push_back(input[i]);\n\t}\n toConvex.push_back(cur);\n\n toConvex = convex_hull(toConvex);\n reverse(toConvex.begin(),toConvex.end());\n\n vector<Point> tmp;\n rep(j,toConvex.size())\n\t{\n\t tmp.push_back(toConvex[j]);\n\t rep(i,n)\n\t {\n\t if(used[i])continue;\n\t if(toConvex[j].index == input[i].index || toConvex[(j+1)%toConvex.size()].index == input[i].index)continue;\n\t if(equals(getDistanceSP(Segment(toConvex[j],toConvex[(j+1)%toConvex.size()]),input[i]),0))\n\t\t{\n\t\t tmp.push_back(input[i]);\n\t\t}\n\t }\n\t}\n toConvex = tmp;\n\n \n cout << \"toConvex----- cur : \" << cur.x << \",\" << cur.y << endl;\n rep(i,toConvex.size())\n {\n\t cout << toConvex[i].x << \",\" << toConvex[i].y << \" \" << toConvex[i].index<< endl;\n\t}\n cout << endl;\n \n\n int next = -inf;\n rep(i,toConvex.size())\n\t{\n\t if(toConvex[i].index == cur.index)\n\t {\n\t next = toConvex[(i+1)%toConvex.size()].index;\n\t break;\n\t }\n\t}\n \n assert(next != -inf);\n cout << \"next = \" << next << \" : \" << input[next].x << \",\" << input[next].y << endl;\n used[next] = true;\n L += sqrt(norm(cur-input[next]));\n cur = input[next];\n\n }\n\n L *= 10.0;\n L = round(L);\n L /= 10.0;\n cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n}\n \nint main()\n{\n while(cin >> n,n)\n {\n inputt();\n\n solve();\n \n }\n return 0;\n}\n\n//テ・ツ、ツ嘉ヲツ閉ーテ」ツ?ォテ、ツクツ?ヲツ猟ヲテ」ツ??」ツつ古」ツ?ヲテ」ツ?淌」ツつ嘉」ツ?ーテ」ツ?静」ツ?」テ」ツ??\n\n*/\n\n#include<cstdio>\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\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#define all(n) (n).begin(),(n).end()\n#define pow2(a) (a)*(a)\nusing namespace std;\ndouble EPS = 1e-9;\n\nbool equals(double a,double b)\n{\n return fabs((a)-(b)) < EPS;\n}\n\nclass Point\n{\n public:\n int x,y;\n\n Point(int x = -1,int y = -1): 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 * (int a){return Point(a*x,a*y);}\n Point operator / (int a){return Point(x/a,y/a);}\n\n bool operator < (const Point& p) const\n {\n return x != p.x?x<p.x:y<p.y;\n }\n\n};\n\nstruct Segment\n{\n Point p1,p2;\n Segment(Point p1 = Point(-1,-1),Point p2 = Point(-1,-1)):p1(p1),p2(p2){}\n};\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\n\ndouble dot(Point a,Point b)\n{\n return a.x*b.x + a.y*b.y;\n}\n\ndouble cross(Point a,Point b)\n{\n return a.x*b.y - a.y*b.x;\n}\n\ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n\ndouble getArgV2(Point A,Point B)\n{\n return acos(dot(A,B)/(sqrt(norm(A))*sqrt(norm(B))));\n double a = sqrt(norm(A));\n double b = sqrt(norm(B));\n return acos(dot(A,B)/(a*b));\n}\n\nbool cmp(const Point &a,const Point &b)\n{\n if(a.x != b.x)return a.x < b.x;\n return a.y < b.y;\n}\n\nPoint ps[1000];\nbool used[1000];\n\nint main()\n{\n \n int n;\n while(cin >> n,n)\n {\n rep(i,n)cin >> ps[i].x >> ps[i].y;\n Point cur(0,0);\n Point cur2(0,-500);\n double L = 0;\n int last = n;\n\n rep(_,n)\n\t{\n\t /*\n\t cout << \"remain\"<<endl;\n\t rep(i,last)\n\t {\n\t cout << ps[i].x << \",\" << ps[i].y << endl;\n\t }\n\t cout << endl;\n\t */\n\t int next = 0;\n\t REP(i,1,last)\n\t {\n\t if(equals(atan2(ps[next].y-cur.y,ps[next].x-cur.x),atan2(ps[i].y-cur.y,ps[i].x-cur.x)))\n\t //if(equals(getArgV2(cur-cur2,ps[next]-cur), getArgV2(cur-cur2,ps[i]-cur)))\n\t\t{\n\t\t if(pow2(cur.x-ps[next].x)+pow2(cur.y-ps[next].y) > pow2(cur.x-ps[i].x)+pow2(cur.y-ps[i].y))\n\t\t {\n\t\t next = i;\n\t\t }\n\t\t}\n\t else if(getArgV2(cur-cur2,ps[next]-cur) > getArgV2(cur-cur2,ps[i]-cur))\n\t\t{\n\t\t next = i;\n\t\t}\n\t }\n\t //cout << \"erase : \" << ps[next].x << \",\" << ps[next].y << endl;\n\t L += sqrt(pow2(cur.x-ps[next].x)+pow2(cur.y-ps[next].y));\n\t cur2 = cur;\n\t cur = ps[next];\n\t ps[next] = ps[last-1];\n\t last--;\n\t}\n \n L *= 10;\n L = round(L);\n L /= 10.0;\n cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n //printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n\n\n/*\nint main()\n{\n Point A = Point(0,10);\n Point B = Point(-10,15);\n\n cout << atan2(B.y-A.y,B.x-A.x)*180/M_PI << endl;\n B = Point(11,20);\n cout << atan2(B.y-A.y,B.x-A.x)*180/M_PI << endl;\n\n\n int n; \n while(cin >> n,n)\n {\n \n\n Point cur1 = Point(0,0);\n Point cur2 = Point(0,0);\n\n rep(i,n)\n\t{\n\t cin >> ps[i].x >> ps[i].y;\n\t cout << i << \" :: \" << ps[i].x << \",\" << ps[i].y << endl;\n\t used[i] = false;\n\t}\n cout << atan2(ps[5].y-ps[4].y,ps[5].x-ps[4].x)*180/M_PI << endl;\n cout << \"##### \" << getArgV2(ps[5]-ps[4],ps[4]-Point(0,0))*180/M_PI << endl;\n sort(ps,ps+n,cmp);\n\n\n\n bool f = true;\n double L = 0;\n rep(_,n)\n\t{\n\t if(_ == 0)\n\t {\n\t L += sqrt(norm(ps[0]-cur1));\n\t cur1 = ps[0];\n\t used[0] = true;\n\t //cout << \"L = \" << L << endl;\n\t continue;\n\t }\n\t double minArg = inf;\n\t double minDist = inf;\n\t int minpos = -inf;\n\t rep(i,n)\n\t {\n\t if(used[i])continue;\n\n\t //cout << \"cur1(\" << cur1.x << \",\" << cur1.y << \")\" << endl;\n\t //cout << \"cur2(\" << cur2.x << \",\" << cur2.y << \")\" << endl;\n\t //cout << \"ps[\"<<i<<\"](\" << ps[i].x << \",\" << ps[i].y << \")\" << endl;\n\n\t double arg = getArgV2(cur1-cur2,ps[i]-cur1);\n\n\t if(f)\n\t\t{\n\t\t f = false;\n\t\t minpos = i;\n\t\t minArg = arg;\n\t\t continue;\n\t\t}\n\n\t //cout << arg << \" ::: \" << endl;\n\t if(!equals(arg,minArg) && arg < minArg)\n\t\t{\n\t\t minpos = i;\n\t\t minArg = arg;\n\t\t minDist = sqrt(norm(cur1-ps[i]));\n\t\t}\n\t if(equals(arg,minArg) && sqrt(norm(cur1-ps[minpos])) > sqrt(norm(cur1-ps[i])))\n\t\t{\n\t\t minDist = sqrt(norm(cur1-ps[i]));\n\t\t minpos = i;\n\t\t\n\t\t}\n\n\t }\n\t //cout << \"cur1 (\" << cur1.x << \",\" << cur1.y << \")\" << endl;\n\t //cout << \"phase #\" << _ << \" \" << minpos << \"(\" << ps[minpos].x << \",\" << ps[minpos].y << \")\" << endl;\n\t //cout << \"that arg is \" << minArg*180/M_PI << endl;\n\n\t //assert(minpos != -inf);\n\t used[minpos] = true;\n\t L += sqrt(norm(cur1-ps[minpos]));\n\t cur2 = cur1;\n\t cur1 = ps[minpos];\n\n\t //cout << \"L = \" << L << endl << endl;\n\t}\n //L *= 10.0;\n //L = round(L);\n //L /= 10.0;\n //cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n*/\n/*\n#include<cstdio>\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\n#define all(n) (n).begin(),(n).end()\n\nusing namespace std;\ndouble EPS = 1e-9;\n\nbool equals(double a,double b)\n{\n return fabs((a)-(b)) < EPS;\n}\n\nstruct Point\n{\n double x,y;\n Point(double x=-inf,double y=-inf):x(x),y(y){}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n bool operator < (const Point &b)const\n {\n if(x != b.x)return x < b.x;\n return y < b.y;\n }\n};\n\nPoint ps[410];\nbool use[410];\n\ndouble toRad(double agl){ return agl*M_PI/180; }\n\ndouble getArg(Point a,Point bb)\n{\n\n}\n\ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n\nint main()\n{\n int n;\n while(cin >> n,n)\n {\n rep(i,n)\n\t{\n\t cin >> ps[i].x >> ps[i].y;\n\t use[i] = false;\n\t}\n sort(ps,ps+n);\n\n Point cur = Point(0,0);\n Point cur2 = Point(0,0);\n double L = 0;\n rep(_,n)\n\t{\n\t if(!_)\n\t {\n\t cur = ps[0];\n\t use[0] = true;\n\t L += sqrt(norm(cur-ps[0]));\n\t continue;\n\t }\n\t cout << \"cur \" << cur.x << \",\" << cur.y << endl;\n\t cout << \"cur2 \" << cur2.x << \",\" << cur2.y << endl;\n\t int next = -inf;\n\t double maxArg = -inf;\n\n\t rep(i,n)\n\t {\n\t if(use[i])continue;\n\t //cout << \"i = \"<< i << endl;\n\n\t Point cc = cur - cur2;\n\t double arg = atan2(ps[i].y-cc.y,ps[i].x-cc.x);\n\n\t if(!equals(arg,toRad(90)) && arg > toRad(90))arg = toRad(-180)-(toRad(180)-arg);\n\t cout << i << \" arg = \" << arg*180/M_PI << \" max : \" << maxArg << endl;\n\t if(!equals(arg,maxArg) && arg > maxArg)\n\t\t{\n\t\t maxArg = arg;\n\t\t next = i;\n\t\t}\n\t else if(equals(arg,maxArg) && norm(ps[next]-cur) > norm(ps[i]-cur) )\n\t\t{\n\t\t next = i;\n\t\t}\n\t //cout << endl;\n\t }\n\t cout << \"next = \" << next << \" \" << ps[next].x << \",\" << ps[next].y << endl;\n\t assert(next != -inf);\n\t L += sqrt(pow(cur.x-ps[next].x,2)+pow(cur.y-ps[next].y,2));\n\t\n\n\t cur2 = cur;\n\t cur = ps[next];\n\t use[next] = true;\n\t cout << endl << endl;\n\t}\n\n printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n\n\n\n\n\n*/",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1376,
"score_of_the_acc": -1.0185,
"final_rank": 9
},
{
"submission_id": "aoj_1107_748373",
"code_snippet": "/*\n#include<iostream>\n#include<cstdio>\n#include<cmath>\n#include<sstream>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#include<vector>\n#include<map>\n#include<set>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\n#define F first\n#define S second\n#define all(n) (n).begin(),(n).end()\n#define EPS (1e-8)\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#define equals(a,b) (fabs((a)-(b)) < EPS)\nusing namespace std;\ntypedef pair<int,int> ii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\nstruct Point\n{\n double x,y;\n int index;\n Point(double x=-inf,double y=-inf):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 p){return Point(x*p,y*p);}\n \n bool operator < (const Point& p)const\n {\n return !equals(x,p.x)?x < p.x:y > p.y;\n }\n bool operator == (const Point &p)const\n {\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n }\n};\n \nstruct Segment\n{\n Point p1,p2;\n Segment(Point p1=Point(-inf,-inf),Point p2=Point(-inf,-inf)):p1(p1),p2(p2){}\n};\n \ntypedef vector<Point> Polygon;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n \ndouble dot(Point a,Point b)\n{\n return a.x*b.x+a.y*b.y;\n}\n \ndouble cross(Point a,Point b)\n{\n return a.x*b.y-a.y*b.x;\n}\n \ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n \ndouble toRad(double agl)\n{\n return agl*M_PI/180.0;\n}\n \nint ccw(Point p0,Point p1,Point p2)\n{\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 \n \nbool PointEquals(Point a,Point b)\n{\n return equals(a.x,b.x) && equals(a.y,b.y);\n}\n \ndouble abs(Point a)\n{\n return sqrt(norm(a));\n}\n \ndouble getDistanceLP(Line s,Point p)\n{\n return abs(cross(s.p2-s.p1,p-s.p1))/abs(s.p2-s.p1);\n}\n \ndouble getDistanceSP(Segment s,Point p)\n{\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 \nPolygon andrewScan(Polygon s,Point now)\n{\n Polygon u,l;\n if(s.size() < 3)return s;\n sort(all(s));\n \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 \n REP(i,2,s.size())\n {\n for(int n=u.size();n>=2 && ccw(u[n-2],u[n-1],s[i]) != CLOCKWISE;n--)\n {\n u.pop_back();\n }\n u.push_back(s[i]);\n }\n \n for(int i=s.size()-3;i>=0;i--)\n {\n for(int n=l.size();n>=2 && ccw(l[n-2],l[n-1],s[i]) != CLOCKWISE;n--)\n {\n l.pop_back();\n }\n l.push_back(s[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 reverse(l.begin(),l.end());\n \n\n vector<Point> ret;\n \n bool f = false;\n rep(i,l.size())\n {\n if(l[i].index == now.index)f = true;\n if(f == false)continue;\n ret.push_back(l[i]);\n rep(j,s.size())\n {\n if(s[j].index == l[i].index || s[j].index == l[(i+1)%l.size()].index)continue;\n if(getDistanceSP(Segment(l[i],l[(i+1)%l.size()]),s[j]) == ON_SEGMENT)ret.push_back(s[j]);\n }\n }\n \n rep(i,l.size())\n {\n if(l[i].index == now.index)f = false;\n if(f == false)break;\n ret.push_back(l[i]);\n \n rep(j,s.size())\n {\n if(s[j].index == l[i].index || s[j].index == l[(i+1)%l.size()].index)continue;\n if(getDistanceSP(Segment(l[i],l[(i+1)%l.size()]),s[j]) == ON_SEGMENT)ret.push_back(s[j]);\n }\n \n }\n \n \n return ret;\n}\n\nvector<Point> convex_hull(vector<Point> ps) {\n int n = ps.size(), k = 0;\n sort(ps.begin(), ps.end());\n vector<Point> 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} \n\n \nint n;\nvector<Point> input;\n \nvoid inputt()\n{\n input.clear();\n input.resize(n);\n rep(i,n)\n {\n cin >> input[i].x >> input[i].y;\n input[i].index = i; \n }\n}\n \nvoid solve()\n{\n bool used[n];\n rep(i,n)used[i] = false;\n double L = 0;\n Point cur = Point(0,0); \n cur.index = -1; \n\n rep(_,n)\n {\n vector<Point> toConvex;\n rep(i,n)\n\t{\n\t if(used[i])continue;\n\t toConvex.push_back(input[i]);\n\t}\n toConvex.push_back(cur);\n\n toConvex = convex_hull(toConvex);\n reverse(toConvex.begin(),toConvex.end());\n\n vector<Point> tmp;\n rep(j,toConvex.size())\n\t{\n\t tmp.push_back(toConvex[j]);\n\t rep(i,n)\n\t {\n\t if(used[i])continue;\n\t if(toConvex[j].index == input[i].index || toConvex[(j+1)%toConvex.size()].index == input[i].index)continue;\n\t if(equals(getDistanceSP(Segment(toConvex[j],toConvex[(j+1)%toConvex.size()]),input[i]),0))\n\t\t{\n\t\t tmp.push_back(input[i]);\n\t\t}\n\t }\n\t}\n toConvex = tmp;\n\n \n cout << \"toConvex----- cur : \" << cur.x << \",\" << cur.y << endl;\n rep(i,toConvex.size())\n {\n\t cout << toConvex[i].x << \",\" << toConvex[i].y << \" \" << toConvex[i].index<< endl;\n\t}\n cout << endl;\n \n\n int next = -inf;\n rep(i,toConvex.size())\n\t{\n\t if(toConvex[i].index == cur.index)\n\t {\n\t next = toConvex[(i+1)%toConvex.size()].index;\n\t break;\n\t }\n\t}\n \n assert(next != -inf);\n cout << \"next = \" << next << \" : \" << input[next].x << \",\" << input[next].y << endl;\n used[next] = true;\n L += sqrt(norm(cur-input[next]));\n cur = input[next];\n\n }\n\n L *= 10.0;\n L = round(L);\n L /= 10.0;\n cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n}\n \nint main()\n{\n while(cin >> n,n)\n {\n inputt();\n\n solve();\n \n }\n return 0;\n}\n\n//変数に一旦いれてたらばぐった\n\n*/\n\n#include<cstdio>\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\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#define all(n) (n).begin(),(n).end()\n#define pow2(a) (a)*(a)\nusing namespace std;\ndouble EPS = 1e-9;\n\nbool equals(double a,double b)\n{\n return fabs((a)-(b)) < EPS;\n}\n\nclass Point\n{\n public:\n int x,y;\n\n Point(int x = -1,int y = -1): 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 * (int a){return Point(a*x,a*y);}\n Point operator / (int a){return Point(x/a,y/a);}//※イケメンに限る\n\n bool operator < (const Point& p) const\n {\n return x != p.x?x<p.x:y<p.y;\n }\n\n};\n\nstruct Segment\n{\n Point p1,p2;\n Segment(Point p1 = Point(-1,-1),Point p2 = Point(-1,-1)):p1(p1),p2(p2){}\n};\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\n\ndouble dot(Point a,Point b)\n{\n return a.x*b.x + a.y*b.y;\n}\n\ndouble cross(Point a,Point b)\n{\n return a.x*b.y - a.y*b.x;\n}\n\ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n\ndouble getArgV2(Point A,Point B)\n{\n return acos(dot(A,B)/(sqrt(norm(A))*sqrt(norm(B))));\n double a = sqrt(norm(A));\n double b = sqrt(norm(B));\n return acos(dot(A,B)/(a*b));\n}\n\nbool cmp(const Point &a,const Point &b)\n{\n if(a.x != b.x)return a.x < b.x;\n return a.y < b.y;\n}\n\nPoint ps[1000];\nbool used[1000];\n\nint main()\n{\n \n int n;\n while(cin >> n,n)\n {\n rep(i,n)cin >> ps[i].x >> ps[i].y;\n Point cur(0,0);\n Point cur2(0,-500);\n double L = 0;\n int last = n;\n\n rep(_,n)\n\t{\n\t /*\n\t cout << \"remain\"<<endl;\n\t rep(i,last)\n\t {\n\t cout << ps[i].x << \",\" << ps[i].y << endl;\n\t }\n\t cout << endl;\n\t */\n\t int next = 0;\n\t REP(i,1,last)\n\t {\n\t if(equals(atan2(ps[next].y-cur.y,ps[next].x-cur.x),atan2(ps[i].y-cur.y,ps[i].x-cur.x)))\n\t //if(equals(getArgV2(cur-cur2,ps[next]-cur), getArgV2(cur-cur2,ps[i]-cur)))\n\t\t{\n\t\t if(pow2(cur.x-ps[next].x)+pow2(cur.y-ps[next].y) > pow2(cur.x-ps[i].x)+pow2(cur.y-ps[i].y))\n\t\t {\n\t\t next = i;\n\t\t }\n\t\t}\n\t else if(getArgV2(cur-cur2,ps[next]-cur) > getArgV2(cur-cur2,ps[i]-cur))\n\t\t{\n\t\t next = i;\n\t\t}\n\t }\n\t //cout << \"erase : \" << ps[next].x << \",\" << ps[next].y << endl;\n\t L += sqrt(pow2(cur.x-ps[next].x)+pow2(cur.y-ps[next].y));\n\t cur2 = cur;\n\t cur = ps[next];\n\t ps[next] = ps[last-1];\n\t last--;\n\t}\n \n L *= 10;\n L = round(L);\n L /= 10.0;\n cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n //printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n\n\n/*\nint main()\n{\n Point A = Point(0,10);\n Point B = Point(-10,15);\n\n cout << atan2(B.y-A.y,B.x-A.x)*180/M_PI << endl;\n B = Point(11,20);\n cout << atan2(B.y-A.y,B.x-A.x)*180/M_PI << endl;\n\n\n int n; \n while(cin >> n,n)\n {\n \n\n Point cur1 = Point(0,0);\n Point cur2 = Point(0,0);\n\n rep(i,n)\n\t{\n\t cin >> ps[i].x >> ps[i].y;\n\t cout << i << \" :: \" << ps[i].x << \",\" << ps[i].y << endl;\n\t used[i] = false;\n\t}\n cout << atan2(ps[5].y-ps[4].y,ps[5].x-ps[4].x)*180/M_PI << endl;\n cout << \"##### \" << getArgV2(ps[5]-ps[4],ps[4]-Point(0,0))*180/M_PI << endl;\n sort(ps,ps+n,cmp);\n\n\n\n bool f = true;\n double L = 0;\n rep(_,n)\n\t{\n\t if(_ == 0)\n\t {\n\t L += sqrt(norm(ps[0]-cur1));\n\t cur1 = ps[0];\n\t used[0] = true;\n\t //cout << \"L = \" << L << endl;\n\t continue;\n\t }\n\t double minArg = inf;\n\t double minDist = inf;\n\t int minpos = -inf;\n\t rep(i,n)\n\t {\n\t if(used[i])continue;\n\n\t //cout << \"cur1(\" << cur1.x << \",\" << cur1.y << \")\" << endl;\n\t //cout << \"cur2(\" << cur2.x << \",\" << cur2.y << \")\" << endl;\n\t //cout << \"ps[\"<<i<<\"](\" << ps[i].x << \",\" << ps[i].y << \")\" << endl;\n\n\t double arg = getArgV2(cur1-cur2,ps[i]-cur1);\n\n\t if(f)\n\t\t{\n\t\t f = false;\n\t\t minpos = i;\n\t\t minArg = arg;\n\t\t continue;\n\t\t}\n\n\t //cout << arg << \" ::: \" << endl;\n\t if(!equals(arg,minArg) && arg < minArg)\n\t\t{\n\t\t minpos = i;\n\t\t minArg = arg;\n\t\t minDist = sqrt(norm(cur1-ps[i]));\n\t\t}\n\t if(equals(arg,minArg) && sqrt(norm(cur1-ps[minpos])) > sqrt(norm(cur1-ps[i])))\n\t\t{\n\t\t minDist = sqrt(norm(cur1-ps[i]));\n\t\t minpos = i;\n\t\t\n\t\t}\n\n\t }\n\t //cout << \"cur1 (\" << cur1.x << \",\" << cur1.y << \")\" << endl;\n\t //cout << \"phase #\" << _ << \" \" << minpos << \"(\" << ps[minpos].x << \",\" << ps[minpos].y << \")\" << endl;\n\t //cout << \"that arg is \" << minArg*180/M_PI << endl;\n\n\t //assert(minpos != -inf);\n\t used[minpos] = true;\n\t L += sqrt(norm(cur1-ps[minpos]));\n\t cur2 = cur1;\n\t cur1 = ps[minpos];\n\n\t //cout << \"L = \" << L << endl << endl;\n\t}\n //L *= 10.0;\n //L = round(L);\n //L /= 10.0;\n //cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n*/\n/*\n#include<cstdio>\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\n#define all(n) (n).begin(),(n).end()\n\nusing namespace std;\ndouble EPS = 1e-9;\n\nbool equals(double a,double b)\n{\n return fabs((a)-(b)) < EPS;\n}\n\nstruct Point\n{\n double x,y;\n Point(double x=-inf,double y=-inf):x(x),y(y){}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n bool operator < (const Point &b)const\n {\n if(x != b.x)return x < b.x;\n return y < b.y;\n }\n};\n\nPoint ps[410];\nbool use[410];\n\ndouble toRad(double agl){ return agl*M_PI/180; }\n\ndouble getArg(Point a,Point bb)\n{\n\n}\n\ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n\nint main()\n{\n int n;\n while(cin >> n,n)\n {\n rep(i,n)\n\t{\n\t cin >> ps[i].x >> ps[i].y;\n\t use[i] = false;\n\t}\n sort(ps,ps+n);\n\n Point cur = Point(0,0);\n Point cur2 = Point(0,0);\n double L = 0;\n rep(_,n)\n\t{\n\t if(!_)\n\t {\n\t cur = ps[0];\n\t use[0] = true;\n\t L += sqrt(norm(cur-ps[0]));\n\t continue;\n\t }\n\t cout << \"cur \" << cur.x << \",\" << cur.y << endl;\n\t cout << \"cur2 \" << cur2.x << \",\" << cur2.y << endl;\n\t int next = -inf;\n\t double maxArg = -inf;\n\n\t rep(i,n)\n\t {\n\t if(use[i])continue;\n\t //cout << \"i = \"<< i << endl;\n\n\t Point cc = cur - cur2;\n\t double arg = atan2(ps[i].y-cc.y,ps[i].x-cc.x);\n\n\t if(!equals(arg,toRad(90)) && arg > toRad(90))arg = toRad(-180)-(toRad(180)-arg);\n\t cout << i << \" arg = \" << arg*180/M_PI << \" max : \" << maxArg << endl;\n\t if(!equals(arg,maxArg) && arg > maxArg)\n\t\t{\n\t\t maxArg = arg;\n\t\t next = i;\n\t\t}\n\t else if(equals(arg,maxArg) && norm(ps[next]-cur) > norm(ps[i]-cur) )\n\t\t{\n\t\t next = i;\n\t\t}\n\t //cout << endl;\n\t }\n\t cout << \"next = \" << next << \" \" << ps[next].x << \",\" << ps[next].y << endl;\n\t assert(next != -inf);\n\t L += sqrt(pow(cur.x-ps[next].x,2)+pow(cur.y-ps[next].y,2));\n\t\n\n\t cur2 = cur;\n\t cur = ps[next];\n\t use[next] = true;\n\t cout << endl << endl;\n\t}\n\n printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n\n\n\n\n\n*/",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1376,
"score_of_the_acc": -1,
"final_rank": 8
},
{
"submission_id": "aoj_1107_748370",
"code_snippet": "/*\n#include<iostream>\n#include<cstdio>\n#include<cmath>\n#include<sstream>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#include<vector>\n#include<map>\n#include<set>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\n#define F first\n#define S second\n#define all(n) (n).begin(),(n).end()\n#define EPS (1e-8)\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#define equals(a,b) (fabs((a)-(b)) < EPS)\nusing namespace std;\ntypedef pair<int,int> ii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\nstruct Point\n{\n double x,y;\n int index;\n Point(double x=-inf,double y=-inf):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 p){return Point(x*p,y*p);}\n \n bool operator < (const Point& p)const\n {\n return !equals(x,p.x)?x < p.x:y > p.y;\n }\n bool operator == (const Point &p)const\n {\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n }\n};\n \nstruct Segment\n{\n Point p1,p2;\n Segment(Point p1=Point(-inf,-inf),Point p2=Point(-inf,-inf)):p1(p1),p2(p2){}\n};\n \ntypedef vector<Point> Polygon;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n \ndouble dot(Point a,Point b)\n{\n return a.x*b.x+a.y*b.y;\n}\n \ndouble cross(Point a,Point b)\n{\n return a.x*b.y-a.y*b.x;\n}\n \ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n \ndouble toRad(double agl)\n{\n return agl*M_PI/180.0;\n}\n \nint ccw(Point p0,Point p1,Point p2)\n{\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 \n \nbool PointEquals(Point a,Point b)\n{\n return equals(a.x,b.x) && equals(a.y,b.y);\n}\n \ndouble abs(Point a)\n{\n return sqrt(norm(a));\n}\n \ndouble getDistanceLP(Line s,Point p)\n{\n return abs(cross(s.p2-s.p1,p-s.p1))/abs(s.p2-s.p1);\n}\n \ndouble getDistanceSP(Segment s,Point p)\n{\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 \nPolygon andrewScan(Polygon s,Point now)\n{\n Polygon u,l;\n if(s.size() < 3)return s;\n sort(all(s));\n \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 \n REP(i,2,s.size())\n {\n for(int n=u.size();n>=2 && ccw(u[n-2],u[n-1],s[i]) != CLOCKWISE;n--)\n {\n u.pop_back();\n }\n u.push_back(s[i]);\n }\n \n for(int i=s.size()-3;i>=0;i--)\n {\n for(int n=l.size();n>=2 && ccw(l[n-2],l[n-1],s[i]) != CLOCKWISE;n--)\n {\n l.pop_back();\n }\n l.push_back(s[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 reverse(l.begin(),l.end());\n \n\n vector<Point> ret;\n \n bool f = false;\n rep(i,l.size())\n {\n if(l[i].index == now.index)f = true;\n if(f == false)continue;\n ret.push_back(l[i]);\n rep(j,s.size())\n {\n if(s[j].index == l[i].index || s[j].index == l[(i+1)%l.size()].index)continue;\n if(getDistanceSP(Segment(l[i],l[(i+1)%l.size()]),s[j]) == ON_SEGMENT)ret.push_back(s[j]);\n }\n }\n \n rep(i,l.size())\n {\n if(l[i].index == now.index)f = false;\n if(f == false)break;\n ret.push_back(l[i]);\n \n rep(j,s.size())\n {\n if(s[j].index == l[i].index || s[j].index == l[(i+1)%l.size()].index)continue;\n if(getDistanceSP(Segment(l[i],l[(i+1)%l.size()]),s[j]) == ON_SEGMENT)ret.push_back(s[j]);\n }\n \n }\n \n \n return ret;\n}\n\nvector<Point> convex_hull(vector<Point> ps) {\n int n = ps.size(), k = 0;\n sort(ps.begin(), ps.end());\n vector<Point> 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} \n\n \nint n;\nvector<Point> input;\n \nvoid inputt()\n{\n input.clear();\n input.resize(n);\n rep(i,n)\n {\n cin >> input[i].x >> input[i].y;\n input[i].index = i; \n }\n}\n \nvoid solve()\n{\n bool used[n];\n rep(i,n)used[i] = false;\n double L = 0;\n Point cur = Point(0,0); \n cur.index = -1; \n\n rep(_,n)\n {\n vector<Point> toConvex;\n rep(i,n)\n\t{\n\t if(used[i])continue;\n\t toConvex.push_back(input[i]);\n\t}\n toConvex.push_back(cur);\n\n toConvex = convex_hull(toConvex);\n reverse(toConvex.begin(),toConvex.end());\n\n vector<Point> tmp;\n rep(j,toConvex.size())\n\t{\n\t tmp.push_back(toConvex[j]);\n\t rep(i,n)\n\t {\n\t if(used[i])continue;\n\t if(toConvex[j].index == input[i].index || toConvex[(j+1)%toConvex.size()].index == input[i].index)continue;\n\t if(equals(getDistanceSP(Segment(toConvex[j],toConvex[(j+1)%toConvex.size()]),input[i]),0))\n\t\t{\n\t\t tmp.push_back(input[i]);\n\t\t}\n\t }\n\t}\n toConvex = tmp;\n\n \n cout << \"toConvex----- cur : \" << cur.x << \",\" << cur.y << endl;\n rep(i,toConvex.size())\n {\n\t cout << toConvex[i].x << \",\" << toConvex[i].y << \" \" << toConvex[i].index<< endl;\n\t}\n cout << endl;\n \n\n int next = -inf;\n rep(i,toConvex.size())\n\t{\n\t if(toConvex[i].index == cur.index)\n\t {\n\t next = toConvex[(i+1)%toConvex.size()].index;\n\t break;\n\t }\n\t}\n \n assert(next != -inf);\n cout << \"next = \" << next << \" : \" << input[next].x << \",\" << input[next].y << endl;\n used[next] = true;\n L += sqrt(norm(cur-input[next]));\n cur = input[next];\n\n }\n\n L *= 10.0;\n L = round(L);\n L /= 10.0;\n cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n}\n \nint main()\n{\n while(cin >> n,n)\n {\n inputt();\n\n solve();\n \n }\n return 0;\n}\n\n//変数に一旦いれてたらばぐった\n\n*/\n\n#include<cstdio>\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\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#define all(n) (n).begin(),(n).end()\n#define pow2(a) (a)*(a)\nusing namespace std;\ndouble EPS = 1e-9;\n\nbool equals(double a,double b)\n{\n return fabs((a)-(b)) < EPS;\n}\n\nclass Point\n{\n public:\n int x,y;\n\n Point(int x = -1,int y = -1): 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 * (int a){return Point(a*x,a*y);}\n Point operator / (int a){return Point(x/a,y/a);}//※イケメンに限る\n\n bool operator < (const Point& p) const\n {\n return x != p.x?x<p.x:y<p.y;\n }\n\n};\n\nstruct Segment\n{\n Point p1,p2;\n Segment(Point p1 = Point(-1,-1),Point p2 = Point(-1,-1)):p1(p1),p2(p2){}\n};\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\n\ndouble dot(Point a,Point b)\n{\n return a.x*b.x + a.y*b.y;\n}\n\ndouble cross(Point a,Point b)\n{\n return a.x*b.y - a.y*b.x;\n}\n\ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n\ndouble getArgV2(Point A,Point B)\n{\n return acos(dot(A,B)/(sqrt(norm(A))*sqrt(norm(B))));\n double a = sqrt(norm(A));\n double b = sqrt(norm(B));\n return acos(dot(A,B)/(a*b));\n}\n\nbool cmp(const Point &a,const Point &b)\n{\n if(a.x != b.x)return a.x < b.x;\n return a.y < b.y;\n}\n\nPoint ps[1000];\nbool used[1000];\n\nint main()\n{\n \n int n;\n while(cin >> n,n)\n {\n rep(i,n)cin >> ps[i].x >> ps[i].y;\n Point cur(0,0);\n Point cur2(0,-512);\n double L = 0;\n int last = n;\n\n rep(_,n)\n\t{\n\t /*\n\t cout << \"remain\"<<endl;\n\t rep(i,last)\n\t {\n\t cout << ps[i].x << \",\" << ps[i].y << endl;\n\t }\n\t cout << endl;\n\t */\n\t int next = 0;\n\t REP(i,1,last)\n\t {\n\t if(equals(atan2(ps[next].y-cur.y,ps[next].x-cur.x),atan2(ps[i].y-cur.y,ps[i].x-cur.x)))\n\t\t{\n\t\t if(pow2(cur.x-ps[next].x)+pow2(cur.y-ps[next].y) > pow2(cur.x-ps[i].x)+pow2(cur.y-ps[i].y))\n\t\t {\n\t\t next = i;\n\t\t }\n\t\t}\n\t else if(getArgV2(cur-cur2,ps[next]-cur) > getArgV2(cur-cur2,ps[i]-cur))\n\t\t{\n\t\t next = i;\n\t\t}\n\t }\n\t //cout << \"erase : \" << ps[next].x << \",\" << ps[next].y << endl;\n\t L += sqrt(pow2(cur.x-ps[next].x)+pow2(cur.y-ps[next].y));\n\t cur2 = cur;\n\t cur = ps[next];\n\t ps[next] = ps[last-1];\n\t last--;\n\t}\n \n L *= 10;\n L = round(L);\n L /= 10.0;\n cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n //printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n\n\n/*\nint main()\n{\n Point A = Point(0,10);\n Point B = Point(-10,15);\n\n cout << atan2(B.y-A.y,B.x-A.x)*180/M_PI << endl;\n B = Point(11,20);\n cout << atan2(B.y-A.y,B.x-A.x)*180/M_PI << endl;\n\n\n int n; \n while(cin >> n,n)\n {\n \n\n Point cur1 = Point(0,0);\n Point cur2 = Point(0,0);\n\n rep(i,n)\n\t{\n\t cin >> ps[i].x >> ps[i].y;\n\t cout << i << \" :: \" << ps[i].x << \",\" << ps[i].y << endl;\n\t used[i] = false;\n\t}\n cout << atan2(ps[5].y-ps[4].y,ps[5].x-ps[4].x)*180/M_PI << endl;\n cout << \"##### \" << getArgV2(ps[5]-ps[4],ps[4]-Point(0,0))*180/M_PI << endl;\n sort(ps,ps+n,cmp);\n\n\n\n bool f = true;\n double L = 0;\n rep(_,n)\n\t{\n\t if(_ == 0)\n\t {\n\t L += sqrt(norm(ps[0]-cur1));\n\t cur1 = ps[0];\n\t used[0] = true;\n\t //cout << \"L = \" << L << endl;\n\t continue;\n\t }\n\t double minArg = inf;\n\t double minDist = inf;\n\t int minpos = -inf;\n\t rep(i,n)\n\t {\n\t if(used[i])continue;\n\n\t //cout << \"cur1(\" << cur1.x << \",\" << cur1.y << \")\" << endl;\n\t //cout << \"cur2(\" << cur2.x << \",\" << cur2.y << \")\" << endl;\n\t //cout << \"ps[\"<<i<<\"](\" << ps[i].x << \",\" << ps[i].y << \")\" << endl;\n\n\t double arg = getArgV2(cur1-cur2,ps[i]-cur1);\n\n\t if(f)\n\t\t{\n\t\t f = false;\n\t\t minpos = i;\n\t\t minArg = arg;\n\t\t continue;\n\t\t}\n\n\t //cout << arg << \" ::: \" << endl;\n\t if(!equals(arg,minArg) && arg < minArg)\n\t\t{\n\t\t minpos = i;\n\t\t minArg = arg;\n\t\t minDist = sqrt(norm(cur1-ps[i]));\n\t\t}\n\t if(equals(arg,minArg) && sqrt(norm(cur1-ps[minpos])) > sqrt(norm(cur1-ps[i])))\n\t\t{\n\t\t minDist = sqrt(norm(cur1-ps[i]));\n\t\t minpos = i;\n\t\t\n\t\t}\n\n\t }\n\t //cout << \"cur1 (\" << cur1.x << \",\" << cur1.y << \")\" << endl;\n\t //cout << \"phase #\" << _ << \" \" << minpos << \"(\" << ps[minpos].x << \",\" << ps[minpos].y << \")\" << endl;\n\t //cout << \"that arg is \" << minArg*180/M_PI << endl;\n\n\t //assert(minpos != -inf);\n\t used[minpos] = true;\n\t L += sqrt(norm(cur1-ps[minpos]));\n\t cur2 = cur1;\n\t cur1 = ps[minpos];\n\n\t //cout << \"L = \" << L << endl << endl;\n\t}\n //L *= 10.0;\n //L = round(L);\n //L /= 10.0;\n //cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n*/\n/*\n#include<cstdio>\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\n#define all(n) (n).begin(),(n).end()\n\nusing namespace std;\ndouble EPS = 1e-9;\n\nbool equals(double a,double b)\n{\n return fabs((a)-(b)) < EPS;\n}\n\nstruct Point\n{\n double x,y;\n Point(double x=-inf,double y=-inf):x(x),y(y){}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n bool operator < (const Point &b)const\n {\n if(x != b.x)return x < b.x;\n return y < b.y;\n }\n};\n\nPoint ps[410];\nbool use[410];\n\ndouble toRad(double agl){ return agl*M_PI/180; }\n\ndouble getArg(Point a,Point bb)\n{\n\n}\n\ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n\nint main()\n{\n int n;\n while(cin >> n,n)\n {\n rep(i,n)\n\t{\n\t cin >> ps[i].x >> ps[i].y;\n\t use[i] = false;\n\t}\n sort(ps,ps+n);\n\n Point cur = Point(0,0);\n Point cur2 = Point(0,0);\n double L = 0;\n rep(_,n)\n\t{\n\t if(!_)\n\t {\n\t cur = ps[0];\n\t use[0] = true;\n\t L += sqrt(norm(cur-ps[0]));\n\t continue;\n\t }\n\t cout << \"cur \" << cur.x << \",\" << cur.y << endl;\n\t cout << \"cur2 \" << cur2.x << \",\" << cur2.y << endl;\n\t int next = -inf;\n\t double maxArg = -inf;\n\n\t rep(i,n)\n\t {\n\t if(use[i])continue;\n\t //cout << \"i = \"<< i << endl;\n\n\t Point cc = cur - cur2;\n\t double arg = atan2(ps[i].y-cc.y,ps[i].x-cc.x);\n\n\t if(!equals(arg,toRad(90)) && arg > toRad(90))arg = toRad(-180)-(toRad(180)-arg);\n\t cout << i << \" arg = \" << arg*180/M_PI << \" max : \" << maxArg << endl;\n\t if(!equals(arg,maxArg) && arg > maxArg)\n\t\t{\n\t\t maxArg = arg;\n\t\t next = i;\n\t\t}\n\t else if(equals(arg,maxArg) && norm(ps[next]-cur) > norm(ps[i]-cur) )\n\t\t{\n\t\t next = i;\n\t\t}\n\t //cout << endl;\n\t }\n\t cout << \"next = \" << next << \" \" << ps[next].x << \",\" << ps[next].y << endl;\n\t assert(next != -inf);\n\t L += sqrt(pow(cur.x-ps[next].x,2)+pow(cur.y-ps[next].y,2));\n\t\n\n\t cur2 = cur;\n\t cur = ps[next];\n\t use[next] = true;\n\t cout << endl << endl;\n\t}\n\n printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n\n\n\n\n\n*/",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1376,
"score_of_the_acc": -1.0185,
"final_rank": 9
},
{
"submission_id": "aoj_1107_748369",
"code_snippet": "/*\n#include<iostream>\n#include<cstdio>\n#include<cmath>\n#include<sstream>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#include<vector>\n#include<map>\n#include<set>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\n#define F first\n#define S second\n#define all(n) (n).begin(),(n).end()\n#define EPS (1e-8)\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#define equals(a,b) (fabs((a)-(b)) < EPS)\nusing namespace std;\ntypedef pair<int,int> ii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\nstruct Point\n{\n double x,y;\n int index;\n Point(double x=-inf,double y=-inf):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 p){return Point(x*p,y*p);}\n \n bool operator < (const Point& p)const\n {\n return !equals(x,p.x)?x < p.x:y > p.y;\n }\n bool operator == (const Point &p)const\n {\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n }\n};\n \nstruct Segment\n{\n Point p1,p2;\n Segment(Point p1=Point(-inf,-inf),Point p2=Point(-inf,-inf)):p1(p1),p2(p2){}\n};\n \ntypedef vector<Point> Polygon;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n \ndouble dot(Point a,Point b)\n{\n return a.x*b.x+a.y*b.y;\n}\n \ndouble cross(Point a,Point b)\n{\n return a.x*b.y-a.y*b.x;\n}\n \ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n \ndouble toRad(double agl)\n{\n return agl*M_PI/180.0;\n}\n \nint ccw(Point p0,Point p1,Point p2)\n{\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 \n \nbool PointEquals(Point a,Point b)\n{\n return equals(a.x,b.x) && equals(a.y,b.y);\n}\n \ndouble abs(Point a)\n{\n return sqrt(norm(a));\n}\n \ndouble getDistanceLP(Line s,Point p)\n{\n return abs(cross(s.p2-s.p1,p-s.p1))/abs(s.p2-s.p1);\n}\n \ndouble getDistanceSP(Segment s,Point p)\n{\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 \nPolygon andrewScan(Polygon s,Point now)\n{\n Polygon u,l;\n if(s.size() < 3)return s;\n sort(all(s));\n \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 \n REP(i,2,s.size())\n {\n for(int n=u.size();n>=2 && ccw(u[n-2],u[n-1],s[i]) != CLOCKWISE;n--)\n {\n u.pop_back();\n }\n u.push_back(s[i]);\n }\n \n for(int i=s.size()-3;i>=0;i--)\n {\n for(int n=l.size();n>=2 && ccw(l[n-2],l[n-1],s[i]) != CLOCKWISE;n--)\n {\n l.pop_back();\n }\n l.push_back(s[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 reverse(l.begin(),l.end());\n \n\n vector<Point> ret;\n \n bool f = false;\n rep(i,l.size())\n {\n if(l[i].index == now.index)f = true;\n if(f == false)continue;\n ret.push_back(l[i]);\n rep(j,s.size())\n {\n if(s[j].index == l[i].index || s[j].index == l[(i+1)%l.size()].index)continue;\n if(getDistanceSP(Segment(l[i],l[(i+1)%l.size()]),s[j]) == ON_SEGMENT)ret.push_back(s[j]);\n }\n }\n \n rep(i,l.size())\n {\n if(l[i].index == now.index)f = false;\n if(f == false)break;\n ret.push_back(l[i]);\n \n rep(j,s.size())\n {\n if(s[j].index == l[i].index || s[j].index == l[(i+1)%l.size()].index)continue;\n if(getDistanceSP(Segment(l[i],l[(i+1)%l.size()]),s[j]) == ON_SEGMENT)ret.push_back(s[j]);\n }\n \n }\n \n \n return ret;\n}\n\nvector<Point> convex_hull(vector<Point> ps) {\n int n = ps.size(), k = 0;\n sort(ps.begin(), ps.end());\n vector<Point> 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} \n\n \nint n;\nvector<Point> input;\n \nvoid inputt()\n{\n input.clear();\n input.resize(n);\n rep(i,n)\n {\n cin >> input[i].x >> input[i].y;\n input[i].index = i; \n }\n}\n \nvoid solve()\n{\n bool used[n];\n rep(i,n)used[i] = false;\n double L = 0;\n Point cur = Point(0,0); \n cur.index = -1; \n\n rep(_,n)\n {\n vector<Point> toConvex;\n rep(i,n)\n\t{\n\t if(used[i])continue;\n\t toConvex.push_back(input[i]);\n\t}\n toConvex.push_back(cur);\n\n toConvex = convex_hull(toConvex);\n reverse(toConvex.begin(),toConvex.end());\n\n vector<Point> tmp;\n rep(j,toConvex.size())\n\t{\n\t tmp.push_back(toConvex[j]);\n\t rep(i,n)\n\t {\n\t if(used[i])continue;\n\t if(toConvex[j].index == input[i].index || toConvex[(j+1)%toConvex.size()].index == input[i].index)continue;\n\t if(equals(getDistanceSP(Segment(toConvex[j],toConvex[(j+1)%toConvex.size()]),input[i]),0))\n\t\t{\n\t\t tmp.push_back(input[i]);\n\t\t}\n\t }\n\t}\n toConvex = tmp;\n\n \n cout << \"toConvex----- cur : \" << cur.x << \",\" << cur.y << endl;\n rep(i,toConvex.size())\n {\n\t cout << toConvex[i].x << \",\" << toConvex[i].y << \" \" << toConvex[i].index<< endl;\n\t}\n cout << endl;\n \n\n int next = -inf;\n rep(i,toConvex.size())\n\t{\n\t if(toConvex[i].index == cur.index)\n\t {\n\t next = toConvex[(i+1)%toConvex.size()].index;\n\t break;\n\t }\n\t}\n \n assert(next != -inf);\n cout << \"next = \" << next << \" : \" << input[next].x << \",\" << input[next].y << endl;\n used[next] = true;\n L += sqrt(norm(cur-input[next]));\n cur = input[next];\n\n }\n\n L *= 10.0;\n L = round(L);\n L /= 10.0;\n cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n}\n \nint main()\n{\n while(cin >> n,n)\n {\n inputt();\n\n solve();\n \n }\n return 0;\n}\n\n//変数に一旦いれてたらばぐった\n\n*/\n\n#include<cstdio>\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\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#define all(n) (n).begin(),(n).end()\n#define pow2(a) (a)*(a)\nusing namespace std;\ndouble EPS = 1e-9;\n\nbool equals(double a,double b)\n{\n return fabs((a)-(b)) < EPS;\n}\n\nclass Point\n{\n public:\n int x,y;\n\n Point(int x = -1,int y = -1): 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 * (int a){return Point(a*x,a*y);}\n Point operator / (int a){return Point(x/a,y/a);}//※イケメンに限る\n\n bool operator < (const Point& p) const\n {\n return x != p.x?x<p.x:y<p.y;\n }\n\n};\n\nstruct Segment\n{\n Point p1,p2;\n Segment(Point p1 = Point(-1,-1),Point p2 = Point(-1,-1)):p1(p1),p2(p2){}\n};\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\n\ndouble dot(Point a,Point b)\n{\n return a.x*b.x + a.y*b.y;\n}\n\ndouble cross(Point a,Point b)\n{\n return a.x*b.y - a.y*b.x;\n}\n\ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n\ndouble getArgV2(Point A,Point B)\n{\n return acos(dot(A,B)/(sqrt(norm(A))*sqrt(norm(B))));\n double a = sqrt(norm(A));\n double b = sqrt(norm(B));\n return acos(dot(A,B)/(a*b));\n}\n\nbool cmp(const Point &a,const Point &b)\n{\n if(a.x != b.x)return a.x < b.x;\n return a.y < b.y;\n}\n\nPoint ps[1000];\nbool used[1000];\n\nint main()\n{\n \n int n;\n while(cin >> n,n)\n {\n rep(i,n)cin >> ps[i].x >> ps[i].y;\n Point cur(0,0);\n Point cur2(0,-512);\n double L = 0;\n int last = n;\n\n rep(_,n)\n\t{\n\t /*\n\t cout << \"remain\"<<endl;\n\t rep(i,last)\n\t {\n\t cout << ps[i].x << \",\" << ps[i].y << endl;\n\t }\n\t cout << endl;\n\t */\n\t int next = 0;\n\t REP(i,1,last)\n\t {\n\t if(equals(atan2(ps[next].y-cur.y,ps[next].x-cur.x),atan2(ps[i].y-cur.y,ps[i].x-cur.x)))\n\t\t{\n\t\t if(pow2(cur.x-ps[next].x)+pow2(cur.y-ps[next].y) > pow2(cur.x-ps[i].x)+pow2(cur.y-ps[i].y))\n\t\t {\n\t\t next = i;\n\t\t }\n\t\t}\n\t else if(getArgV2(cur-cur2,ps[next]-cur) > getArgV2(cur-cur2,ps[i]-cur))\n\t\t{\n\t\t next = i;\n\t\t}\n\t }\n\t //cout << \"erase : \" << ps[next].x << \",\" << ps[next].y << endl;\n\t L += sqrt(pow2(cur.x-ps[next].x)+pow2(cur.y-ps[next].y));\n\t cur2 = cur;\n\t cur = ps[next];\n\t ps[next] = ps[last-1];\n\t last--;\n\t}\n //L *= 10;\n //L = round(L);\n //L /= 10.0;\n printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n\n\n/*\nint main()\n{\n Point A = Point(0,10);\n Point B = Point(-10,15);\n\n cout << atan2(B.y-A.y,B.x-A.x)*180/M_PI << endl;\n B = Point(11,20);\n cout << atan2(B.y-A.y,B.x-A.x)*180/M_PI << endl;\n\n\n int n; \n while(cin >> n,n)\n {\n \n\n Point cur1 = Point(0,0);\n Point cur2 = Point(0,0);\n\n rep(i,n)\n\t{\n\t cin >> ps[i].x >> ps[i].y;\n\t cout << i << \" :: \" << ps[i].x << \",\" << ps[i].y << endl;\n\t used[i] = false;\n\t}\n cout << atan2(ps[5].y-ps[4].y,ps[5].x-ps[4].x)*180/M_PI << endl;\n cout << \"##### \" << getArgV2(ps[5]-ps[4],ps[4]-Point(0,0))*180/M_PI << endl;\n sort(ps,ps+n,cmp);\n\n\n\n bool f = true;\n double L = 0;\n rep(_,n)\n\t{\n\t if(_ == 0)\n\t {\n\t L += sqrt(norm(ps[0]-cur1));\n\t cur1 = ps[0];\n\t used[0] = true;\n\t //cout << \"L = \" << L << endl;\n\t continue;\n\t }\n\t double minArg = inf;\n\t double minDist = inf;\n\t int minpos = -inf;\n\t rep(i,n)\n\t {\n\t if(used[i])continue;\n\n\t //cout << \"cur1(\" << cur1.x << \",\" << cur1.y << \")\" << endl;\n\t //cout << \"cur2(\" << cur2.x << \",\" << cur2.y << \")\" << endl;\n\t //cout << \"ps[\"<<i<<\"](\" << ps[i].x << \",\" << ps[i].y << \")\" << endl;\n\n\t double arg = getArgV2(cur1-cur2,ps[i]-cur1);\n\n\t if(f)\n\t\t{\n\t\t f = false;\n\t\t minpos = i;\n\t\t minArg = arg;\n\t\t continue;\n\t\t}\n\n\t //cout << arg << \" ::: \" << endl;\n\t if(!equals(arg,minArg) && arg < minArg)\n\t\t{\n\t\t minpos = i;\n\t\t minArg = arg;\n\t\t minDist = sqrt(norm(cur1-ps[i]));\n\t\t}\n\t if(equals(arg,minArg) && sqrt(norm(cur1-ps[minpos])) > sqrt(norm(cur1-ps[i])))\n\t\t{\n\t\t minDist = sqrt(norm(cur1-ps[i]));\n\t\t minpos = i;\n\t\t\n\t\t}\n\n\t }\n\t //cout << \"cur1 (\" << cur1.x << \",\" << cur1.y << \")\" << endl;\n\t //cout << \"phase #\" << _ << \" \" << minpos << \"(\" << ps[minpos].x << \",\" << ps[minpos].y << \")\" << endl;\n\t //cout << \"that arg is \" << minArg*180/M_PI << endl;\n\n\t //assert(minpos != -inf);\n\t used[minpos] = true;\n\t L += sqrt(norm(cur1-ps[minpos]));\n\t cur2 = cur1;\n\t cur1 = ps[minpos];\n\n\t //cout << \"L = \" << L << endl << endl;\n\t}\n //L *= 10.0;\n //L = round(L);\n //L /= 10.0;\n //cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n*/\n/*\n#include<cstdio>\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\n#define all(n) (n).begin(),(n).end()\n\nusing namespace std;\ndouble EPS = 1e-9;\n\nbool equals(double a,double b)\n{\n return fabs((a)-(b)) < EPS;\n}\n\nstruct Point\n{\n double x,y;\n Point(double x=-inf,double y=-inf):x(x),y(y){}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n bool operator < (const Point &b)const\n {\n if(x != b.x)return x < b.x;\n return y < b.y;\n }\n};\n\nPoint ps[410];\nbool use[410];\n\ndouble toRad(double agl){ return agl*M_PI/180; }\n\ndouble getArg(Point a,Point bb)\n{\n\n}\n\ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n\nint main()\n{\n int n;\n while(cin >> n,n)\n {\n rep(i,n)\n\t{\n\t cin >> ps[i].x >> ps[i].y;\n\t use[i] = false;\n\t}\n sort(ps,ps+n);\n\n Point cur = Point(0,0);\n Point cur2 = Point(0,0);\n double L = 0;\n rep(_,n)\n\t{\n\t if(!_)\n\t {\n\t cur = ps[0];\n\t use[0] = true;\n\t L += sqrt(norm(cur-ps[0]));\n\t continue;\n\t }\n\t cout << \"cur \" << cur.x << \",\" << cur.y << endl;\n\t cout << \"cur2 \" << cur2.x << \",\" << cur2.y << endl;\n\t int next = -inf;\n\t double maxArg = -inf;\n\n\t rep(i,n)\n\t {\n\t if(use[i])continue;\n\t //cout << \"i = \"<< i << endl;\n\n\t Point cc = cur - cur2;\n\t double arg = atan2(ps[i].y-cc.y,ps[i].x-cc.x);\n\n\t if(!equals(arg,toRad(90)) && arg > toRad(90))arg = toRad(-180)-(toRad(180)-arg);\n\t cout << i << \" arg = \" << arg*180/M_PI << \" max : \" << maxArg << endl;\n\t if(!equals(arg,maxArg) && arg > maxArg)\n\t\t{\n\t\t maxArg = arg;\n\t\t next = i;\n\t\t}\n\t else if(equals(arg,maxArg) && norm(ps[next]-cur) > norm(ps[i]-cur) )\n\t\t{\n\t\t next = i;\n\t\t}\n\t //cout << endl;\n\t }\n\t cout << \"next = \" << next << \" \" << ps[next].x << \",\" << ps[next].y << endl;\n\t assert(next != -inf);\n\t L += sqrt(pow(cur.x-ps[next].x,2)+pow(cur.y-ps[next].y,2));\n\t\n\n\t cur2 = cur;\n\t cur = ps[next];\n\t use[next] = true;\n\t cout << endl << endl;\n\t}\n\n printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n\n\n\n\n\n*/",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1328,
"score_of_the_acc": -0.9836,
"final_rank": 5
},
{
"submission_id": "aoj_1107_748367",
"code_snippet": "/*\n#include<iostream>\n#include<cstdio>\n#include<cmath>\n#include<sstream>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#include<vector>\n#include<map>\n#include<set>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\n#define F first\n#define S second\n#define all(n) (n).begin(),(n).end()\n#define EPS (1e-8)\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#define equals(a,b) (fabs((a)-(b)) < EPS)\nusing namespace std;\ntypedef pair<int,int> ii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\nstruct Point\n{\n double x,y;\n int index;\n Point(double x=-inf,double y=-inf):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 p){return Point(x*p,y*p);}\n \n bool operator < (const Point& p)const\n {\n return !equals(x,p.x)?x < p.x:y > p.y;\n }\n bool operator == (const Point &p)const\n {\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n }\n};\n \nstruct Segment\n{\n Point p1,p2;\n Segment(Point p1=Point(-inf,-inf),Point p2=Point(-inf,-inf)):p1(p1),p2(p2){}\n};\n \ntypedef vector<Point> Polygon;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n \ndouble dot(Point a,Point b)\n{\n return a.x*b.x+a.y*b.y;\n}\n \ndouble cross(Point a,Point b)\n{\n return a.x*b.y-a.y*b.x;\n}\n \ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n \ndouble toRad(double agl)\n{\n return agl*M_PI/180.0;\n}\n \nint ccw(Point p0,Point p1,Point p2)\n{\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 \n \nbool PointEquals(Point a,Point b)\n{\n return equals(a.x,b.x) && equals(a.y,b.y);\n}\n \ndouble abs(Point a)\n{\n return sqrt(norm(a));\n}\n \ndouble getDistanceLP(Line s,Point p)\n{\n return abs(cross(s.p2-s.p1,p-s.p1))/abs(s.p2-s.p1);\n}\n \ndouble getDistanceSP(Segment s,Point p)\n{\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 \nPolygon andrewScan(Polygon s,Point now)\n{\n Polygon u,l;\n if(s.size() < 3)return s;\n sort(all(s));\n \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 \n REP(i,2,s.size())\n {\n for(int n=u.size();n>=2 && ccw(u[n-2],u[n-1],s[i]) != CLOCKWISE;n--)\n {\n u.pop_back();\n }\n u.push_back(s[i]);\n }\n \n for(int i=s.size()-3;i>=0;i--)\n {\n for(int n=l.size();n>=2 && ccw(l[n-2],l[n-1],s[i]) != CLOCKWISE;n--)\n {\n l.pop_back();\n }\n l.push_back(s[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 reverse(l.begin(),l.end());\n \n\n vector<Point> ret;\n \n bool f = false;\n rep(i,l.size())\n {\n if(l[i].index == now.index)f = true;\n if(f == false)continue;\n ret.push_back(l[i]);\n rep(j,s.size())\n {\n if(s[j].index == l[i].index || s[j].index == l[(i+1)%l.size()].index)continue;\n if(getDistanceSP(Segment(l[i],l[(i+1)%l.size()]),s[j]) == ON_SEGMENT)ret.push_back(s[j]);\n }\n }\n \n rep(i,l.size())\n {\n if(l[i].index == now.index)f = false;\n if(f == false)break;\n ret.push_back(l[i]);\n \n rep(j,s.size())\n {\n if(s[j].index == l[i].index || s[j].index == l[(i+1)%l.size()].index)continue;\n if(getDistanceSP(Segment(l[i],l[(i+1)%l.size()]),s[j]) == ON_SEGMENT)ret.push_back(s[j]);\n }\n \n }\n \n \n return ret;\n}\n\nvector<Point> convex_hull(vector<Point> ps) {\n int n = ps.size(), k = 0;\n sort(ps.begin(), ps.end());\n vector<Point> 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} \n\n \nint n;\nvector<Point> input;\n \nvoid inputt()\n{\n input.clear();\n input.resize(n);\n rep(i,n)\n {\n cin >> input[i].x >> input[i].y;\n input[i].index = i; \n }\n}\n \nvoid solve()\n{\n bool used[n];\n rep(i,n)used[i] = false;\n double L = 0;\n Point cur = Point(0,0); \n cur.index = -1; \n\n rep(_,n)\n {\n vector<Point> toConvex;\n rep(i,n)\n\t{\n\t if(used[i])continue;\n\t toConvex.push_back(input[i]);\n\t}\n toConvex.push_back(cur);\n\n toConvex = convex_hull(toConvex);\n reverse(toConvex.begin(),toConvex.end());\n\n vector<Point> tmp;\n rep(j,toConvex.size())\n\t{\n\t tmp.push_back(toConvex[j]);\n\t rep(i,n)\n\t {\n\t if(used[i])continue;\n\t if(toConvex[j].index == input[i].index || toConvex[(j+1)%toConvex.size()].index == input[i].index)continue;\n\t if(equals(getDistanceSP(Segment(toConvex[j],toConvex[(j+1)%toConvex.size()]),input[i]),0))\n\t\t{\n\t\t tmp.push_back(input[i]);\n\t\t}\n\t }\n\t}\n toConvex = tmp;\n\n \n cout << \"toConvex----- cur : \" << cur.x << \",\" << cur.y << endl;\n rep(i,toConvex.size())\n {\n\t cout << toConvex[i].x << \",\" << toConvex[i].y << \" \" << toConvex[i].index<< endl;\n\t}\n cout << endl;\n \n\n int next = -inf;\n rep(i,toConvex.size())\n\t{\n\t if(toConvex[i].index == cur.index)\n\t {\n\t next = toConvex[(i+1)%toConvex.size()].index;\n\t break;\n\t }\n\t}\n \n assert(next != -inf);\n cout << \"next = \" << next << \" : \" << input[next].x << \",\" << input[next].y << endl;\n used[next] = true;\n L += sqrt(norm(cur-input[next]));\n cur = input[next];\n\n }\n\n L *= 10.0;\n L = round(L);\n L /= 10.0;\n cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n}\n \nint main()\n{\n while(cin >> n,n)\n {\n inputt();\n\n solve();\n \n }\n return 0;\n}\n\n//変数に一旦いれてたらばぐった\n\n*/\n\n#include<cstdio>\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\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#define all(n) (n).begin(),(n).end()\n#define pow2(a) (a)*(a)\nusing namespace std;\ndouble EPS = 1e-9;\n\nbool equals(double a,double b)\n{\n return fabs((a)-(b)) < EPS;\n}\n\nclass Point\n{\n public:\n int x,y;\n\n Point(int x = -1,int y = -1): 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 * (int a){return Point(a*x,a*y);}\n Point operator / (int a){return Point(x/a,y/a);}//※イケメンに限る\n\n bool operator < (const Point& p) const\n {\n return x != p.x?x<p.x:y<p.y;\n }\n\n};\n\nstruct Segment\n{\n Point p1,p2;\n Segment(Point p1 = Point(-1,-1),Point p2 = Point(-1,-1)):p1(p1),p2(p2){}\n};\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\n\ndouble dot(Point a,Point b)\n{\n return a.x*b.x + a.y*b.y;\n}\n\ndouble cross(Point a,Point b)\n{\n return a.x*b.y - a.y*b.x;\n}\n\ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n\ndouble getArgV2(Point A,Point B)\n{\n return acos(dot(A,B)/(sqrt(norm(A))*sqrt(norm(B))));\n double a = sqrt(norm(A));\n double b = sqrt(norm(B));\n return acos(dot(A,B)/(a*b));\n}\n\nbool cmp(const Point &a,const Point &b)\n{\n if(a.x != b.x)return a.x < b.x;\n return a.y < b.y;\n}\n\nPoint ps[1000];\nbool used[1000];\n\nint main()\n{\n \n int n;\n while(cin >> n,n)\n {\n rep(i,n)cin >> ps[i].x >> ps[i].y;\n Point cur(0,0);\n Point cur2(0,-512);\n double L = 0;\n int last = n;\n\n rep(_,n)\n\t{\n\t /*\n\t cout << \"remain\"<<endl;\n\t rep(i,last)\n\t {\n\t cout << ps[i].x << \",\" << ps[i].y << endl;\n\t }\n\t cout << endl;\n\t */\n\t int next = 0;\n\t REP(i,1,last)\n\t {\n\t if(equals(atan2(ps[next].y-cur.y,ps[next].x-cur.x),atan2(ps[i].y-cur.y,ps[i].x-cur.x)))\n\t\t{\n\t\t if(pow2(cur.x-ps[next].x)+pow2(cur.y-ps[next].y) > pow2(cur.x-ps[i].x)+pow2(cur.y-ps[i].y))\n\t\t {\n\t\t next = i;\n\t\t }\n\t\t}\n\t else if(getArgV2(cur-cur2,ps[next]-cur) > getArgV2(cur-cur2,ps[i]-cur))\n\t\t{\n\t\t next = i;\n\t\t}\n\t }\n\t //cout << \"erase : \" << ps[next].x << \",\" << ps[next].y << endl;\n\t L += sqrt(pow2(cur.x-ps[next].x)+pow2(cur.y-ps[next].y));\n\t cur2 = cur;\n\t cur = ps[next];\n\t ps[next] = ps[last-1];\n\t last--;\n\t}\n\n printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n\n\n/*\nint main()\n{\n Point A = Point(0,10);\n Point B = Point(-10,15);\n\n cout << atan2(B.y-A.y,B.x-A.x)*180/M_PI << endl;\n B = Point(11,20);\n cout << atan2(B.y-A.y,B.x-A.x)*180/M_PI << endl;\n\n\n int n; \n while(cin >> n,n)\n {\n \n\n Point cur1 = Point(0,0);\n Point cur2 = Point(0,0);\n\n rep(i,n)\n\t{\n\t cin >> ps[i].x >> ps[i].y;\n\t cout << i << \" :: \" << ps[i].x << \",\" << ps[i].y << endl;\n\t used[i] = false;\n\t}\n cout << atan2(ps[5].y-ps[4].y,ps[5].x-ps[4].x)*180/M_PI << endl;\n cout << \"##### \" << getArgV2(ps[5]-ps[4],ps[4]-Point(0,0))*180/M_PI << endl;\n sort(ps,ps+n,cmp);\n\n\n\n bool f = true;\n double L = 0;\n rep(_,n)\n\t{\n\t if(_ == 0)\n\t {\n\t L += sqrt(norm(ps[0]-cur1));\n\t cur1 = ps[0];\n\t used[0] = true;\n\t //cout << \"L = \" << L << endl;\n\t continue;\n\t }\n\t double minArg = inf;\n\t double minDist = inf;\n\t int minpos = -inf;\n\t rep(i,n)\n\t {\n\t if(used[i])continue;\n\n\t //cout << \"cur1(\" << cur1.x << \",\" << cur1.y << \")\" << endl;\n\t //cout << \"cur2(\" << cur2.x << \",\" << cur2.y << \")\" << endl;\n\t //cout << \"ps[\"<<i<<\"](\" << ps[i].x << \",\" << ps[i].y << \")\" << endl;\n\n\t double arg = getArgV2(cur1-cur2,ps[i]-cur1);\n\n\t if(f)\n\t\t{\n\t\t f = false;\n\t\t minpos = i;\n\t\t minArg = arg;\n\t\t continue;\n\t\t}\n\n\t //cout << arg << \" ::: \" << endl;\n\t if(!equals(arg,minArg) && arg < minArg)\n\t\t{\n\t\t minpos = i;\n\t\t minArg = arg;\n\t\t minDist = sqrt(norm(cur1-ps[i]));\n\t\t}\n\t if(equals(arg,minArg) && sqrt(norm(cur1-ps[minpos])) > sqrt(norm(cur1-ps[i])))\n\t\t{\n\t\t minDist = sqrt(norm(cur1-ps[i]));\n\t\t minpos = i;\n\t\t\n\t\t}\n\n\t }\n\t //cout << \"cur1 (\" << cur1.x << \",\" << cur1.y << \")\" << endl;\n\t //cout << \"phase #\" << _ << \" \" << minpos << \"(\" << ps[minpos].x << \",\" << ps[minpos].y << \")\" << endl;\n\t //cout << \"that arg is \" << minArg*180/M_PI << endl;\n\n\t //assert(minpos != -inf);\n\t used[minpos] = true;\n\t L += sqrt(norm(cur1-ps[minpos]));\n\t cur2 = cur1;\n\t cur1 = ps[minpos];\n\n\t //cout << \"L = \" << L << endl << endl;\n\t}\n //L *= 10.0;\n //L = round(L);\n //L /= 10.0;\n //cout << setiosflags(ios::fixed) << setprecision(1) << L << endl;\n printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n*/\n/*\n#include<cstdio>\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<iomanip>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\n#define all(n) (n).begin(),(n).end()\n\nusing namespace std;\ndouble EPS = 1e-9;\n\nbool equals(double a,double b)\n{\n return fabs((a)-(b)) < EPS;\n}\n\nstruct Point\n{\n double x,y;\n Point(double x=-inf,double y=-inf):x(x),y(y){}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n bool operator < (const Point &b)const\n {\n if(x != b.x)return x < b.x;\n return y < b.y;\n }\n};\n\nPoint ps[410];\nbool use[410];\n\ndouble toRad(double agl){ return agl*M_PI/180; }\n\ndouble getArg(Point a,Point bb)\n{\n\n}\n\ndouble norm(Point a)\n{\n return a.x*a.x+a.y*a.y;\n}\n\nint main()\n{\n int n;\n while(cin >> n,n)\n {\n rep(i,n)\n\t{\n\t cin >> ps[i].x >> ps[i].y;\n\t use[i] = false;\n\t}\n sort(ps,ps+n);\n\n Point cur = Point(0,0);\n Point cur2 = Point(0,0);\n double L = 0;\n rep(_,n)\n\t{\n\t if(!_)\n\t {\n\t cur = ps[0];\n\t use[0] = true;\n\t L += sqrt(norm(cur-ps[0]));\n\t continue;\n\t }\n\t cout << \"cur \" << cur.x << \",\" << cur.y << endl;\n\t cout << \"cur2 \" << cur2.x << \",\" << cur2.y << endl;\n\t int next = -inf;\n\t double maxArg = -inf;\n\n\t rep(i,n)\n\t {\n\t if(use[i])continue;\n\t //cout << \"i = \"<< i << endl;\n\n\t Point cc = cur - cur2;\n\t double arg = atan2(ps[i].y-cc.y,ps[i].x-cc.x);\n\n\t if(!equals(arg,toRad(90)) && arg > toRad(90))arg = toRad(-180)-(toRad(180)-arg);\n\t cout << i << \" arg = \" << arg*180/M_PI << \" max : \" << maxArg << endl;\n\t if(!equals(arg,maxArg) && arg > maxArg)\n\t\t{\n\t\t maxArg = arg;\n\t\t next = i;\n\t\t}\n\t else if(equals(arg,maxArg) && norm(ps[next]-cur) > norm(ps[i]-cur) )\n\t\t{\n\t\t next = i;\n\t\t}\n\t //cout << endl;\n\t }\n\t cout << \"next = \" << next << \" \" << ps[next].x << \",\" << ps[next].y << endl;\n\t assert(next != -inf);\n\t L += sqrt(pow(cur.x-ps[next].x,2)+pow(cur.y-ps[next].y,2));\n\t\n\n\t cur2 = cur;\n\t cur = ps[next];\n\t use[next] = true;\n\t cout << endl << endl;\n\t}\n\n printf(\"%.1f\\n\",L);\n }\n return 0;\n}\n\n\n\n\n\n*/",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1328,
"score_of_the_acc": -0.9836,
"final_rank": 5
},
{
"submission_id": "aoj_1107_733609",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath>\n#include <algorithm>\n#include <complex>\n#include <cstdio>\nusing namespace std;\n\nconst double PI = acos(-1);\nconst double EPS = 1e-9;\ntypedef complex<double> P;\n\ndouble fix(double x){\n\twhile( x >=\n\t\t2 * PI ) x -= 2 * PI;\n\twhile( x < EPS ) x += 2 * PI;\n\treturn x;\n}\nint main(){\n\tint N;\n\twhile(cin >> N && N){\n\t\tdouble ans = 0;\n\t\tvector<P> v;\n\t\tvector<bool> done(N);\n\t\t\n\t\tfor(int i = 0 ; i < N ; i++){\n\t\t\tdouble x,y;\n\t\t\tcin >> x >> y;\n\t\t\tv.push_back(P(x,y));\n\t\t}\n\t\tdouble cx = 0 , cy = 0;\n\t\tdouble dir = PI / 2;\n\t\twhile(count(done.begin(),done.end(),0) ){\n\t\t\t//cout << cx << \" \" << cy << \" \" << dir << endl;\n\t\t\tvector< pair<double,int> > next;\n\t\t\tfor(int i = 0 ; i < N ; i++){\n\t\t\t\tif( done[i] ) continue;\n\t\t\t\tdouble ang = fix(atan2(v[i].imag()-cy,v[i].real()-cx) - dir);\n\t\t\t\tnext.push_back(make_pair(ang,i));\n\t\t\t}\n\t\t\tsort(next.rbegin(),next.rend());\n\t\t\tint cur = 0;\n\t\t\tfor(int i = 1 ; i < next.size() ; i++){\n\t\t\t\tif( fabs( next[i].first - next[0].first ) > EPS ){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif( abs(P(cx,cy)-v[next[i].second]) < abs(P(cx,cy)-v[next[cur].second]) ){\n\t\t\t\t\tcur = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tdone[next[cur].second] = true;\n\t\t\tans += abs(P(cx,cy)-v[next[cur].second]);\n\t\t\tdir = fix(dir += next[cur].first);\n\t\t\tcx = v[next[cur].second].real();\n\t\t\tcy = v[next[cur].second].imag();\n\t\t\t\n\t\t}\n\t\t\n\t\tprintf(\"%.1lf\\n\",ans);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1368,
"score_of_the_acc": -0.9942,
"final_rank": 7
},
{
"submission_id": "aoj_1107_436440",
"code_snippet": "#include<iostream>\n#include<complex>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<cstdio>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\n\n#define X real()\n#define Y imag()\n\ntypedef complex<double> P;\n\nconst double EPS = 1e-8;\nconst double PI = acos(-1);\n\nint sig(double r) {return (r < -EPS) ? -1 : (r > EPS) ? 1: 0;}\nbool eq(double a, double b) {return abs(a - b) < EPS;}\n\nnamespace std{\n bool operator<(const P &a, const P &b){\n double arg1 = arg(a), arg2 = arg(b);\n if (sig(arg1 - PI) >= 0) arg1 = -PI;\n if (sig(arg2 - PI) >= 0) arg2 = -PI;\n if(!eq(arg1, arg2)) return arg1 < arg2;\n return norm(a) < norm(b);\n }\n}\n\nP plr(double theta) {return polar(1., theta);}\n\nint main() {\n int n;\n for (;;) {\n cin >> n;\n if (n == 0) break;\n vector<P> v;\n rep (i, n) {\n int x, y;\n cin >> x >> y;\n v.push_back(P(x, y));\n }\n rep (i, n) {\n v[i] = v[i] * plr(PI / 2);\n v[i].Y *= -1;\n }\n double res = 0;\n rep (i, n) {\n sort(v.begin(), v.end());\n res += abs(v[0]);\n vector<P> vv;\n rep (j, v.size() - 1) {\n\tvv.push_back((v[j + 1] - v[0]) * plr(-PI - arg(v[0])));\n }\n v = vv;\n }\n printf(\"%.1lf\\n\", res);\n }\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 996,
"score_of_the_acc": -0.872,
"final_rank": 4
},
{
"submission_id": "aoj_1107_396764",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\" \"; cout<<endl; }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n//geo\n#include <complex>\ntypedef complex<double> P;\ninline bool equal(double x, double y){\n return abs(x - y) < EPS;\n}\ninline bool operator == (const P& x, const P& y){\n return equal(x.real(), y.real()) && equal(x.imag(), y.imag());\n}\ndouble dot(P x, P y){\n return real(conj(x) * y);\n}\ndouble cross(P x, P y){\n return imag(conj(x) * y);\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//---\nint main(){\n int n;\n while(cin>>n && n ){\n vector<P> points;\n vector<bool> used(n);\n REP(i,n){\n int x,y;\n cin>>x>>y;\n points.push_back(P(x,y));\n }\n P now(0, 0);\n double ans = 0;\n REP(time, n){\n int next = -1;\n REP(i, n)if(!used[i]){\n bool ok = true;\n REP(j, n)if(!used[j] && i != j){\n int cw = ccw(now, points[i], points[j]);\n if(cw == 0 || cw == 1) {\n ok = false;\n break;\n }\n assert(cw != 2);\n }\n if(ok){\n assert(next == -1);\n next = i;\n }\n }\n assert(next != -1);\n used[next] = true;\n ans += abs(points[next] - now);\n now = points[next];\n }\n printf(\"%.1lf\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1107_396760",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\" \"; cout<<endl; }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n//geo\n#include <complex>\ntypedef complex<double> P;\ninline bool equal(double x, double y){\n return abs(x - y) < EPS;\n}\ninline bool operator == (const P& x, const P& y){\n return equal(x.real(), y.real()) && equal(x.imag(), y.imag());\n}\ndouble dot(P x, P y){\n return real(conj(x) * y);\n}\ndouble cross(P x, P y){\n return imag(conj(x) * y);\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//---\nint main(){\n int n;\n while(cin>>n && n ){\n vector<P> points;\n vector<bool> used(n);\n REP(i,n){\n int x,y;\n cin>>x>>y;\n points.push_back(P(x,y));\n }\n P now(0, 0);\n double ans = 0;\n REP(time, n){\n int next = -1;\n REP(i, n)if(!used[i]){\n bool ok = true;\n REP(j, n)if(!used[j] && i != j){\n int cw = ccw(now, points[i], points[j]);\n if(cw == 0 || cw == 1) {\n ok = false;\n }\n assert(cw != 2);\n }\n if(ok){\n assert(next == -1);\n next = i;\n }\n }\n assert(next != -1);\n used[next] = true;\n ans += abs(points[next] - now);\n now = points[next];\n }\n printf(\"%.1lf\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 984,
"score_of_the_acc": -1.7151,
"final_rank": 12
},
{
"submission_id": "aoj_1107_261957",
"code_snippet": "#include<deque>\n#include<list>\n#include<map>\n#include<queue>\n#include<set>\n#include<stack>\n#include<vector>\n#include<algorithm>\n#include<string>\n#include<iostream>\n#include<sstream>\n#include<cmath>\n#include<cstdio>\n#include<cstring>\nusing namespace std;\nint main(){\n int i;\n int n;\n while(cin>>n,n){\n deque<int> a,b;\n for(i=0;i<n;i++){\n int p,q;\n cin>>p>>q;\n a.push_back(p);\n b.push_back(q);\n }\n int x=0,y=0;\n double z=M_PI/2;\n double sm=0;\n while(a.size()){\n int mn=0;\n for(i=1;i<(int)a.size();i++){\n\tif(0){\n\t}else if((atan2(b[mn]-y,a[mn]-x)>z?atan2(b[mn]-y,a[mn]-x)-M_PI*2:atan2(b[mn]-y,a[mn]-x))<(atan2(b[i]-y,a[i]-x)>z?atan2(b[i]-y,a[i]-x)-M_PI*2:atan2(b[i]-y,a[i]-x))){\n\t mn=i;\n\t}else if((atan2(b[mn]-y,a[mn]-x)>z?atan2(b[mn]-y,a[mn]-x)-M_PI*2:atan2(b[mn]-y,a[mn]-x))==(atan2(b[i]-y,a[i]-x)>z?atan2(b[i]-y,a[i]-x)-M_PI*2:atan2(b[i]-y,a[i]-x))){\n\t if((a[mn]-x)*(a[mn]-x)+(b[mn]-y)*(b[mn]-y)>(a[i]-x)*(a[i]-x)+(b[i]-y)*(b[i]-y))\n\t mn=i;\n\t}\n }\n sm+=sqrt((a[mn]-x)*(a[mn]-x)+(b[mn]-y)*(b[mn]-y));\n z=atan2(b[mn]-y,a[mn]-x);\n x=a[mn];\n y=b[mn];\n a.erase(a.begin()+mn);\n b.erase(b.begin()+mn);\n }\n printf(\"%.1lf\\n\",sm);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 0,
"score_of_the_acc": -0.037,
"final_rank": 3
},
{
"submission_id": "aoj_1107_168501",
"code_snippet": "#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<complex>\n#include<map>\n#include<functional>\n#include<algorithm>\n#define EPS (1e-10)\n#define N 400\nusing namespace std;\ntypedef complex<double> P;\ntypedef struct pdp{\n\tP p;\n\tdouble c, d;\n} pdp;\nbool operator<(const pdp &a, const pdp &b){\n\tif(abs(a.c - b.c) < EPS){\n\t\treturn a.d < b.d;\n\t}\n\telse{\n\t\treturn a.c < b.c;\n\t}\n}\n\ndouble dot(P a, P b){\n\treturn a.real() * b.real() + a.imag() * b.imag();\n}\ndouble vcos(P a, P b){\n\treturn dot(a, b) / abs(a) / abs(b);\n}\npdp a[N];\nint main(){\n\tfor(;;){\n\t\tint n;\n\t\tdouble r;\n\t\tP cv = P(0, 1), cp = P(0, 0);\n\t\tscanf(\"%d\", &n);\n\t\tif(n==0)return 0;\n\t\tfor(int i=0;i<n;++i){\n\t\t\tint x, y;\n\t\t\tscanf(\"%d%d\", &x, &y);\n\t\t\ta[i].p = P(x, y);\n\t\t}\n\t\tr = 0.0;\n\t\tfor(int i=n;i>0;--i){\n\t\t\t//printf(\"%.1lf, %.1lf\\n\", cp.real(), cp.imag());\n\t\t\tfor(int j=0;j<i;++j){\n\t\t\t\ta[j].c = -vcos(cv, a[j].p-cp);\n\t\t\t\ta[j].d = abs(a[j].p-cp);\n\t\t\t}\n\t\t\tsort(a, a+i);\n\t\t\tr += a[0].d;\n\t\t\tcv = a[0].p-cp;\n\t\t\tcp = a[0].p;\n\t\t\ta[0] = a[i-1];\n\t\t}\n\t\t//printf(\"%.1lf, %.1lf\\n\", cp.real(), cp.imag());\n\t\tprintf(\"%.1lf\\n\", r);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_1105_cpp
|
Unable Count
I would, if I could,
If I couldn't how could I?
I couldn't, without I could, could I?
Could you, without you could, could ye?
Could ye? could ye?
Could you, without you could, could ye?
It is true, as this old rhyme says, that we can only DO what
we can DO and we cannot DO what we cannot DO. Changing some of
DOs with COUNTs, we have another statement that we can only COUNT
what we can DO and we cannot COUNT what we cannot DO, which looks
rather false. We could count what we could do as well as we could
count what we couldn't do. Couldn't we, if we confine ourselves
to finite issues?
Surely we can count, in principle, both what we can do and
what we cannot do, if the object space is finite. Yet, sometimes
we cannot count in practice what we can do or what we cannot do.
Here, you are challenged, in a set of all positive integers up
to (and including) a given bound
n
, to count
all the integers that cannot be represented by a formula of
the form
a
*
i
+
b
*
j
, where
a
and
b
are given positive integers and
i
and
j
are variables ranging over non-negative integers. You are requested
to report only the result of the count, i.e. how many integers
are not representable.
For example, given
n
= 7,
a
= 2,
b
= 5,
you should answer 2, since 1 and 3 cannot be represented in a
specified form, and the other five numbers are representable as follows:
2 = 2*1 + 5*0, 4 = 2*2 + 5*0, 5 = 2*0 + 5*1,
6 = 2*3 + 5*0, 7 = 2*1 + 5*1.
Input
The input is a sequence of lines. Each line consists of three integers,
n, a
and
b,
in this order,
separated by a
space
.
The integers
n
,
a
and
b
are
all positive and at most one million, except those in the last
line. The last line consists of three zeros.
Output
For each input line except the last one, your program should
write out a line that contains only the result of the count.
Sample Input
10 2 3
10 2 5
100 5 25
0 0 0
Output for the Sample Input
1
2
80
|
[
{
"submission_id": "aoj_1105_9629559",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(A) A.begin(),A.end()\nint main(){\n while(1){\n int n,a,b;cin>>n>>a>>b;\n if(!n)return 0;\n vector<bool>dp(n+1);\n dp[0]=1;\n REP(i,n+1){\n if(i>=a&&dp[i-a])dp[i]=1;\n if(i>=b&&dp[i-b])dp[i]=1;\n }\n cout<<count(ALL(dp),0)<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3316,
"score_of_the_acc": -0.2734,
"final_rank": 9
},
{
"submission_id": "aoj_1105_6358466",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define MOD 1000000007\n//#define MOD 998244353\n#define INF 1e18 + 10\n#define EPS 1e-9\n#define F first\n#define S second\n\n#define debug(x) cout<<x<<endl;\n#define repi(i,x,n) for(int i=x;i<n;i++)\n#define rep(i,n) repi(i,0,n)\n#define lp(i,n) repi(i,0,n)\n#define repn(i,n) for(int i=n;i>=0;i--)\n#define int long long\n#define endl \"\\n\"\n\ntypedef pair<int,int> PII;\ntypedef pair<int,string> PIS;\ntypedef pair<string,int> PSI;\n\ntemplate <typename T>\nbool chmax(T &a, const T& b) {\n if (a < b) {\n a = b; \n return true;\n }\n return false;\n}\n\ntemplate <typename T>\nbool chmin(T &a, const T& b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nsigned main(){\n cin.tie(0);\t\n ios::sync_with_stdio(false);\n while(1){\n int n,a,b;\n cin>>n>>a>>b;\n if(n==0) break;\n if(a>b) swap(a,b);\n vector<int> v(a,0);\n int ans=0;\n v[0]=1;\n rep(i,n){\n //rep(j,a) cout<<v[j]<<\" \";\n //cout<<endl;\n int num=i+1;\n if(num%b==0){\n\tv[num%a]=1;\n }\n if(v[num%a]==0){\n\tans++;\n }\n \n }\n cout<<ans<<endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3144,
"score_of_the_acc": -0.3101,
"final_rank": 10
},
{
"submission_id": "aoj_1105_6358427",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nvoid solve(int n, int a, int b) {\n vector< int > reps(n + 1, 1);\n queue< int > que;\n\n reps[0] = 0;\n que.emplace(0);\n\n while (not que.empty()) {\n int v = que.front();\n que.pop();\n\n if (v + a <= n and reps[v + a]) {\n reps[v + a] = 0;\n que.emplace(v + a);\n }\n if (v + b <= n and reps[v + b]) {\n reps[v + b] = 0;\n que.emplace(v + b);\n }\n }\n\n cout << accumulate(reps.begin(), reps.end(), 0) << endl;\n}\n\nint main() {\n int n, a, b;\n \n while (cin >> n >> a >> b, n) {\n solve(n, a, b);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 7084,
"score_of_the_acc": -0.7575,
"final_rank": 17
},
{
"submission_id": "aoj_1105_5979098",
"code_snippet": "#include<iostream>\n\nusing namespace std;\n\nbool Judge(int m,int a,int b)\n{\n\tint v = 0;\n\twhile (v * a <= m)\n\t{\n\t\tif ((m - v * a) % b == 0)\n\t\t\treturn true;\n\t\tv++;\n\t}\n\n\treturn false;\n}\n\nint main()\n{\n\tint n, a, b;\n\tcin >> n >> a >> b;\n\twhile (n != 0 && a != 0 && b != 0)\n\t{\n\t\tbool* ok = new bool[n + 1];\n\t\tfill(ok, ok + n + 1, false);\n\t\tfor (int i = 1; i <= n; i++)\n\t\t{\n\t\t\tif (ok[i]) continue;\n\t\t\tif (Judge(i, a, b))\n\t\t\t{\n\t\t\t\tok[i] = true;\n\t\t\t\tfor (int j = 2; i * j <= n; j++)\n\t\t\t\t\tok[i * j] = true;\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int i = 1; i <= n; i++)\n\t\t\tans += (!ok[i]);\n\t\tcout << ans << endl;\n\n\t\tcin >> n >> a >> b;\n\t}\n\n\t//system(\"pause\");\n}",
"accuracy": 1,
"time_ms": 520,
"memory_kb": 7100,
"score_of_the_acc": -1.7595,
"final_rank": 20
},
{
"submission_id": "aoj_1105_4776276",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\ntypedef long long int lli;\n\nint main(){\n while(1){\n lli n,a,b;\n cin >> n >> a >> b;\n if(n == 0) break;\n\n vector<bool> table(n+1, false);\n table[0] = true;\n int ans = 0;\n for(int i=0; i<=n; i++){\n if(!table[i]){\n ans++;\n continue;\n }\n if(i+a <= n) table[i+a] = true;\n if(i+b <= n) table[i+b] = true;\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3196,
"score_of_the_acc": -0.258,
"final_rank": 8
},
{
"submission_id": "aoj_1105_2665479",
"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\nint main() {\n\twhile (true) {\n\t\tint N,A,B;cin>>N>>A>>B;\n\t\tif(!N)break;\n\t\tvector<int>oks(1e6+1);\n\t\toks[0]=true;\n\t\tfor (int i = 0; i < 1e6; ++i) {\n\t\t\tif (oks[i]) {\n\t\t\t\tif (i + A <= 1e6) {\n\t\t\t\t\toks[i+A]=true;\n\t\t\t\t}\n\t\t\t\tif (i + B <= 1e6) {\n\t\t\t\t\toks[i+B]=true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans=N-accumulate(oks.begin(),oks.begin()+N+1,0)+1;\n\t\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 6968,
"score_of_the_acc": -0.7818,
"final_rank": 18
},
{
"submission_id": "aoj_1105_2104100",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n\nusing namespace std;\n\nbool* checkTable;\n\nvoid func(int N,int a, int b){\n\n\tint count = 0,a_limit;\n\n\ta_limit = N/a;\n\n\tfor(int i = 1; i <= a_limit; i++){\n\t\tcheckTable[a*i] = true;\n\t}\n\tfor(int i = b; i <= N; i++){\n\t\tif(i % b == 0 || checkTable[i-b] == true){\n\t\t\tcheckTable[i] = true;\n\t\t}\n\t}\n\n\n\tfor(int i = 1; i <= N; i++){\n\t\tif(checkTable[i] == false)count++;\n\t}\n\n\tprintf(\"%d\\n\",count);\n\n}\n\nint main(){\n\n\tint N,a,b;\n\tcheckTable = new bool[1000001];\n\n\twhile(true){\n\t\tscanf(\"%d %d %d\",&N,&a,&b);\n\t\tif(N == 0 && a == 0 && b == 0)break;\n\n\t\tfor(int i =1; i <= N; i++)checkTable[i] = false;\n\n\t\tfunc(N,a,b);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3652,
"score_of_the_acc": -0.3165,
"final_rank": 11
},
{
"submission_id": "aoj_1105_1776177",
"code_snippet": "#include<iostream>\nusing namespace std;\nint n, a[2];\nint dp[2000000];\nint main() {\n\twhile (true) {\n\t\tcin >> n >> a[0] >> a[1];\n\t\tif (n == 0) { break; }\n\t\tfor (int i = 0; i < 2000000; i++)dp[i] = 0;\n\t\tdp[0] = 1;\n\t\tfor (int i = 0; i < 2; i++) {\n\t\t\tfor (int j = 0; j < 1000000; j++) {\n\t\t\t\tif (dp[j] == 0) { continue; }\n\t\t\t\tdp[j + a[i]] = 1;\n\t\t\t}\n\t\t}\n\t\tint sum = 0;\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tif (dp[i] == 0)sum += 1;\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 8972,
"score_of_the_acc": -1.0588,
"final_rank": 19
},
{
"submission_id": "aoj_1105_1741390",
"code_snippet": "#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint main(){\n\n int n,a,b,count=0,i,j;\n \n cin >> n >> a >> b;\n while(n!=0){\n count = n;\n if(a<b) swap(a,b);\n int ar[1000010]={};\n ar[a]=1;\n ar[b]=1;\n for(i=1;i<=n;i++){\n if(i-a>0)\n\tif(ar[i-a]==1) ar[i] = 1;\n if(i-b>0)\n\tif(ar[i-b]==1) ar[i] = 1;\n count -= ar[i];\n }\n cout << count << endl;\n cin >> n >> a >> b;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 5072,
"score_of_the_acc": -0.5186,
"final_rank": 14
},
{
"submission_id": "aoj_1105_1731529",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string.h>\n\nusing namespace std;\nstatic const int SIZE = 1000001;\nint dp[SIZE];\n\nvoid solve()\n{\n\tlong long int n, a, b;\n\twhile (cin >> n >> a >> b, n || a || b)\n\t{\n\t\tmemset(dp, 0, sizeof(dp));\n\t\tdp[0] = 1;\n\t\tfor (int i = 0; i <= n; ++i)\n\t\t{\n\t\t\tif (dp[i] == 1)\n\t\t\t{\n\t\t\t\tif (i + a <= n)\n\t\t\t\t{\n\t\t\t\t\tdp[i + a] = 1;\n\t\t\t\t}\n\t\t\t\tif (i + b <= n)\n\t\t\t\t{\n\t\t\t\t\tdp[i + b] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int i = 1; i <= n; ++i)\n\t\t{\n\t\t\tif (dp[i] == 0)\n\t\t\t{\n\t\t\t\t++ans;\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}\n\nint main()\n{\n\tsolve();\n\treturn(0);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5076,
"score_of_the_acc": -0.4995,
"final_rank": 12
},
{
"submission_id": "aoj_1105_1604209",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <iterator>\n\nusing namespace std;\n\nbool checker[2000000];\n\nint main(){\n\tint n, a, b;\n\twhile(true){\n\t\tcin >> n >> a >> b;\n\t\tif(n == 0 && a == 0 && b == 0){\n\t\t\tbreak;\n\t\t}\n\t\tfor(int i = 0; i <= n; i++){\n\t\t\tchecker[i] = false;\n\t\t}\n\t\tchecker[0] = true;\n\t\tfor(int i = 1; i <= n; i++){\n\t\t\tif(i - a >= 0){\n\t\t\t\tif(checker[i - a]){\n\t\t\t\t\tchecker[i] = true;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(i - b >= 0){\n\t\t\t\tif(checker[i - b]){\n\t\t\t\t\tchecker[i] = true;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint count = 0;\n\t\tfor(int i = 0; i <= n; i++){\n\t\t\tif(!checker[i]){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", count);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2120,
"score_of_the_acc": -0.1197,
"final_rank": 4
},
{
"submission_id": "aoj_1105_1542236",
"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;\nint main(){\n\tint a,b,c;\n\twhile(cin>>a>>b>>c,a+b+c){\n\t\tvector<bool>in(a+1);\n\t\tin[0]=true;\n\t\tif(b>c)swap(b,c);\n\t\trep(i,a+1){\n\t\t\tif(i-b<0)continue;\n\t\t\tif(in[i-b])in[i]=true;;\n\t\t\tif(i-c<0)continue;\n\t\t\tif(in[i-c])in[i]=true;;\n\t\t}\n\t\tint co=0;\n\t\tloop(i,1,a+1)if(!in[i])co++;\n\t\tcout<<co<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1316,
"score_of_the_acc": -0.0361,
"final_rank": 1
},
{
"submission_id": "aoj_1105_1482948",
"code_snippet": "#include <cstdio>\n#include <cstring>\nint n,a,b;\nint dp[1500001];\nint main(void){\n\twhile(1){\n\t\tscanf(\"%d %d %d\",&n,&a,&b);\n\t\tif(n+a+b==0)break;\n\t\tmemset(dp,0,sizeof(dp));\n\t\tdp[0]=1;\n\t\tint cnt=-1;\n\t\tfor(int i=0;i<=n;i++){\n\t\t\tif(dp[i]>0){\n\t\t\t\tcnt++;\n\t\t\t\tdp[i+a]=dp[i];\n\t\t\t\tdp[i+b]=dp[i];\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",n-cnt);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6892,
"score_of_the_acc": -0.7328,
"final_rank": 16
},
{
"submission_id": "aoj_1105_1451819",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<set>\n#include<map>\n#include<cmath>\n#include<cstdlib>\n#include<algorithm>\n#include<cstring>\n#include<cassert>\n#include<string>\n#include<vector>\n#include<queue>\n#define MAX_N 1000010\n#define mp make_pair\n#define pb push_back\n#define fi first\n#define se second\n#define INF 100000005\n#define rep(i,n) for(int i = 0;i < n;i++)\nusing namespace std;\ntypedef long long int ll;\ntypedef pair<int,int> PI;\n\nint gcm(int a,int b){\n if(a<b){swap(a,b);}\n while(b>0){\n a%=b;\n swap(a,b);\n }\n return a;\n}\n\nint lcm(int a,int b){\n return a/gcm(a,b)*b;\n}\n\nint main(){\n int n,a,b;\n int LCM,GCM;\n bool flag[MAX_N];\n int count[MAX_N];\n while(1){\n cin>>n>>a>>b;\n if(n==0)\n break;\n rep(i,MAX_N){\n flag[i]=0;\n }\n LCM=lcm(a,b);\n GCM=gcm(a,b);\n int ans;\n int irange = min(MAX_N-1,LCM)/a+1;\n rep(i,irange){\n int jrange =(min(MAX_N-1,LCM)-a*i)/b+1;\n rep(j,jrange){flag[a*i+b*j]=true;}\n }\n count[0]=0;\n rep(i,MAX_N-1){\n count[i+1]=count[i]+flag[i+1];\n }\n if(n<LCM){\n ans=count[n];\n }\n else{\n ans=count[LCM]+(n-LCM)/GCM;\n }\n cout<<n-ans<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6040,
"score_of_the_acc": -0.6233,
"final_rank": 15
},
{
"submission_id": "aoj_1105_1449623",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int uli;\n\nuli xgcd(uli a,uli b,uli &x,uli &y){\n if(b==0){\n x=1,y=0;\n return a;\n }\n uli x1,y1;\n uli g=xgcd(b,a%b,x1,y1);\n x=y1;\n y=x1-(a/b)*y1;\n return g;\n}\nint main(){\n uli n,a,b,x,y;\n while(scanf(\"%lld %lld %lld\",&n,&a,&b)==3){\n if(n==0 && a==0 && b==0)break;\n uli g=xgcd(a,b,x,y);\n uli ans=0;\n for(uli v=g;v<=n;v+=g){\n uli k=v/g;\n uli xx=k*x,yy=k*y;\n uli r=(xx*g)/b;\n if(xx<0 && (-xx*g)%b!=0)r--;\n if(-yy*g<=a*r){\n ans++;\n }\n }\n printf(\"%lld\\n\",n-ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 100,
"memory_kb": 1188,
"score_of_the_acc": -0.1765,
"final_rank": 6
},
{
"submission_id": "aoj_1105_1417634",
"code_snippet": "#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n\tint n, a, b;\n\twhile ( cin >> n >> a >> b, n || a || b ) {\n\t\tvector<bool> f(n+1, false); f[0] = true;\n\t\tint x[2] = {a, b};\n\t\tfor (int i = 0; i < 2; ++i) {\n\t\t\tfor (int j = 0; j < n+1; ++j) {\n\t\t\t\tif (f[j] && j+x[i] < n+1) {\n\t\t\t\t\tf[j+x[i]] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint ans = 0;\n\t\tfor (int i = 1; i < f.size(); ++i) {\n\t\t\tif (f[i]) ++ans;\n\t\t}\n\t\tcout << n-ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1316,
"score_of_the_acc": -0.0557,
"final_rank": 2
},
{
"submission_id": "aoj_1105_1351389",
"code_snippet": "/* ***********************************************\nAuthor :axp\nCreated Time :2015/5/15 23:46:43\nFile Name :1.cpp\n************************************************ */\n\n#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <set>\n#include <map>\n#include <string>\n#include <cmath>\n#include <cstdlib>\n#include <ctime>\nusing namespace std;\n\nconst int maxn = 1000010;\nint ans;\nint n,a,b;\nbool v[maxn<<1];\n\nint main()\n{\n //freopen(\"in.txt\",\"r\",stdin);\n //freopen(\"out.txt\",\"w\",stdout);\n while(cin>>n>>a>>b && n)\n\t{\n\t\tmemset(v,0,sizeof(v));\n\t\tans=0;\n\t\tv[0]=1;\n\t\tfor(int i=0;i<=n;i++)\n\t\t\tif(v[i])\n\t\t\t\tv[i+a]=v[i+b]=1;\n\t\t\telse\n\t\t\t\tans++;\n\t\tcout<<ans<<endl;\n\t}\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3120,
"score_of_the_acc": -0.2482,
"final_rank": 7
},
{
"submission_id": "aoj_1105_1342687",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long int ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\ntypedef vector<pair<int, int> > vii;\n#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)\n#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)\n#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)\n#define rrev(i, m, n) for(int (i)=(n)-1; (i)>=(m); (i)--)\n#define erev(i, m, n) for(int (i)=(n); (i)>=(m); (i)--)\n#define rev(i, n) for(int (i)=(n)-1; (i)>=0; (i)--)\n#define vrep(i, c) for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)\n#define ALL(v) (v).begin(), (v).end()\n#define mp make_pair\n#define pb push_back\ntemplate<class T, class S> inline bool minup(T& m, S x){ return m>(T)x ? (m=(T)x, true) : false; }\ntemplate<class T, class S> inline bool maxup(T& m, S x){ return m<(T)x ? (m=(T)x, true) : false; }\n\nconst int INF = 1000000000;\nconst ll MOD = 1000000007LL;\nconst double EPS = 1E-12;\n\nint a, b, n;\n\nint main()\n{\n while((cin >> n >> a >> b) && n){\n int res = n;\n bool* ok = new bool[n + 1];\n rep(i, n + 1) ok[i] = false;\n\n rep(i, n / a + 1) ok[i * a] = true;\n //rep(i, n / a + 1) if(ok[i]) for(int j = i + b; j <= n; j += b) ok[j] = true;\n rep(i, n + 1) if(ok[i] && i + b <= n) ok[i + b] = true;\n\n rrep(i, 1, n + 1) if(ok[i]) res -= 1;\n cout << res << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5156,
"score_of_the_acc": -0.5098,
"final_rank": 13
},
{
"submission_id": "aoj_1105_1259654",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <list>\n#include <map>\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\n#define SUPmaxp 1000001\n\nbool bs[SUPmaxp];\nint maxp,a,b;\n\nint main(){\n\twhile(true){\n\t\tcin>>maxp>>a>>b;\t\t\tif(!maxp) return 0;\n\t\tFOR(p,0,maxp+1) bs[p]=false;\n\t\tbs[0]=true;\n\t\tFOR(p,0,maxp+1) if(bs[p]){\n\t\t\tif(p+a<=maxp) bs[p+a]=true;\n\t\t\tif(p+b<=maxp) bs[p+b]=true;\n\t\t}\n\t\tint re=0;\n\t\tFOR(p,1,maxp+1) if(!bs[p]) re++;\n\t\tcout<<re<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2136,
"score_of_the_acc": -0.1218,
"final_rank": 5
},
{
"submission_id": "aoj_1105_1230249",
"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, a, b;\n while(cin >>n >>a >>b && n){\n vector<bool> v(n + 5, false);\n for(int i = a; i < v.size(); i += a) v[i] = true;\n for(int i = b; i < v.size(); ++i) if(i % b == 0 || v[i - b]) v[i] = true;\n int cnt = 0;\n FOR(i, 1, n + 1) if(!v[i]) ++cnt;\n cout <<cnt <<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1316,
"score_of_the_acc": -0.0557,
"final_rank": 2
}
] |
aoj_1109_cpp
|
Fermat's Last Theorem
In the 17th century, Fermat wrote that he proved for any integer $n \geq 3$,
there exist no positive integers $x$, $y$, $z$ such that
$x^n + y^n = z^n$.
However he never disclosed the proof. Later, this claim was named
Fermat's Last Theorem or Fermat's Conjecture.
If Fermat's Last Theorem holds in case of $n$, then it also holds
in case of any multiple of $n$.
Thus it suffices to prove cases where $n$ is a prime number
and the special case $n$ = 4.
A proof for the case $n$ = 4 was found in Fermat's own memorandum.
The case $n$ = 3 was proved by Euler in the 18th century.
After that, many mathematicians attacked Fermat's Last Theorem.
Some of them proved some part of the theorem, which was a
partial success.
Many others obtained nothing.
It was a long history.
Finally, Wiles proved Fermat's Last Theorem in 1994.
Fermat's Last Theorem implies that for any integers $n \geq 3$
and $z > 1$, it always holds that
$z^n > $ max { $x^n + y^n | x > 0, y > 0, x^n + y^n \leq z^n$ }.
Your mission is to write a program that verifies this in the case
$n$ = 3 for a given $z$. Your program should read in
integer numbers greater than 1, and, corresponding to each input
$z$, it should output the following:
$z^3 - $ max { $x^3 + y^3 | x > 0, y > 0, x^3 + y^3 \leq z^3$ }.
Input
The input is a sequence of lines each containing one positive integer
number followed by a line containing a zero. You may assume that all of
the input integers are greater than 1 and less than 1111.
Output
The output should consist of lines each containing a single
integer number. Each output integer should be
$z^3 - $ max { $x^3 + y^3 | x > 0, y > 0, x^3 + y^3 \leq z^3$ }.
for the corresponding input integer
z
.
No other characters should appear in any output line.
Sample Input
6
4
2
0
Output for the Sample Input
27
10
6
|
[
{
"submission_id": "aoj_1109_10946369",
"code_snippet": "#include<iostream>\n#include<cstring>\n#include<algorithm>\n#include<cstdlib>\n#include<vector>\n#include<cmath>\n#include<stdlib.h>\n#include<iomanip>\n#include<list>\n#include<deque>\n#include<map>\n#include <stdio.h>\n#include <queue>\n#include <stack>\n#define maxn 10000+5\n#define ull unsigned long long\n#define ll long long\n#define reP(i,n) for(i=1;i<=n;i++)\n#define rep(i,n) for(i=0;i<n;i++)\n#define cle(a) memset(a,0,sizeof(a))\n#define mod 90001\n#define PI 3.141592657\n#define INF 1<<30\nconst ull inf = 1LL << 61;\nconst double eps=1e-5;\n\nusing namespace std;\n\nbool cmp(int a,int b)\n{\n return a>b;\n}\nll a[maxn];\nint main()\n{\n #ifndef ONLINE_JUDGE\n //freopen(\"in.txt\",\"r\",stdin);\n #endif\n //freopen(\"out.txt\",\"w\",stdout);\n for(int i=1;i<=1111;i++)\n\t\ta[i]=(i*i*i);\n\tint n;\n\twhile(cin>>n&&n){\n\t\tll t=n*n*n;\n\t\tll Max=-1;\n\t\tfor(int i=n;i>=1;i--)\n\t\tfor(int j=n;j>=1;j--){\n\t\t\tif(a[i]+a[j]<=t){Max=max(a[i]+a[j],Max);}\n\t\t}\n\t\tcout<<t-Max<<endl;\n\t}\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3440,
"score_of_the_acc": -1.125,
"final_rank": 19
},
{
"submission_id": "aoj_1109_9629662",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\nint main(){\n while(1){\n ll z;cin>>z;\n if(!z)return 0;\n ll ans=0;\n FOR(x,1,z+1)for(ll y=1;x*x*x+y*y*y<z*z*z;y++)ans=max(ans,x*x*x+y*y*y);\n cout<<z*z*z-ans<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3420,
"score_of_the_acc": -1.019,
"final_rank": 18
},
{
"submission_id": "aoj_1109_8860282",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <iostream>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll z;\n while (cin >> z && z) {\n ll z_cube = z * z * z; // Pre-calculating z's cube\n ll ans = 0;\n for (ll x = 1; x * x * x <= z_cube; x++) {\n ll x_cube = x * x * x; // Storing x's cube\n for (ll y = x; x_cube + y * y * y <= z_cube; y++) { // y starts from x\n ll y_cube = y * y * y; // Storing y's cube\n ans = max(ans, x_cube + y_cube);\n }\n }\n cout << z_cube - ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2980,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1109_8860281",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <iostream>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll z;\n while (cin >> z && z) {\n ll zCube = z * z * z; // Calculate z^3 once\n ll ans = 0;\n\n for (ll x = 1, xCube = x * x * x; xCube <= zCube; ++x, xCube = x * x * x) {\n for (ll y = 1, yCube = y * y * y; yCube + xCube <= zCube; ++y, yCube = y * y * y) {\n ans = max(ans, xCube + yCube);\n }\n }\n\n cout << zCube - ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3092,
"score_of_the_acc": -0.3685,
"final_rank": 12
},
{
"submission_id": "aoj_1109_8860278",
"code_snippet": "#include <algorithm>\n#include <iostream>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll z;\n while (cin >> z && z) {\n ll ans = 0;\n ll z_cube = z * z * z;\n for (ll x = 1; x * x * x <= z_cube; x++) {\n ll x_cube = x * x * x;\n for (ll y = x; y * y * y + x_cube <= z_cube; y++) {\n ll y_cube = y * y * y;\n ans = max(ans, y_cube + x_cube);\n }\n }\n cout << z_cube - ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3076,
"score_of_the_acc": -0.2087,
"final_rank": 3
},
{
"submission_id": "aoj_1109_8860277",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <map>\n#include <set>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll z;\n while (cin >> z && z) {\n ll ans = 0;\n ll zCubed = z * z * z; // Store the cube of z in a variable\n for (ll x = 1; x * x * x <= zCubed; x++)\n for (ll y = 1; y * y * y + x * x * x <= zCubed; y++)\n ans = max(ans, x * x * x + y * y * y);\n cout << zCubed - ans << endl; // Use the stored value of z cubed\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3020,
"score_of_the_acc": -0.212,
"final_rank": 6
},
{
"submission_id": "aoj_1109_8860276",
"code_snippet": "#include <algorithm>\n#include <iostream>\n\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll z;\n while (cin >> z && z) {\n ll ans = 0;\n ll z_cubed = z * z * z; // cube of z calculated once and stored in variable\n ll x, y;\n for (x = 1; x * x * x <= z_cubed; x++) {\n ll x_cubed = x * x * x; // cube of x calculated once and stored in variable\n for (y = x; y * y * y + x_cubed <= z_cubed; y++) { // y loop starts from x\n ll y_cubed = y * y * y; // cube of y calculated once and stored in variable\n ans = max(ans, x_cubed + y_cubed);\n }\n }\n cout << z_cubed - ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3076,
"score_of_the_acc": -0.2087,
"final_rank": 3
},
{
"submission_id": "aoj_1109_8860275",
"code_snippet": "#include <algorithm>\n#include <iostream>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll z;\n while (cin >> z && z) {\n ll ans = 0;\n ll cube_z = z * z * z;\n for (ll x = 1; x * x * x <= cube_z; x++)\n for (ll y = x; y * y * y + x * x * x <= cube_z; y++)\n ans = max(ans, x * x * x + y * y * y);\n cout << cube_z - ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3076,
"score_of_the_acc": -0.2087,
"final_rank": 3
},
{
"submission_id": "aoj_1109_8860274",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <iostream>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll z;\n while (cin >> z && z) {\n ll ans = 0;\n ll z_cubed = z * z * z; \n ll limit = cbrt(z_cubed); \n\n for (ll x = 1; x <= limit; x++) {\n ll x_cubed = x * x * x;\n\n for (ll y = 1; y <= limit; y++) {\n ll y_cubed = y * y * y;\n\n if (x_cubed + y_cubed <= z_cubed)\n ans = max(ans, x_cubed + y_cubed);\n else\n break; \n }\n }\n cout << z_cubed - ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3128,
"score_of_the_acc": -0.4467,
"final_rank": 14
},
{
"submission_id": "aoj_1109_8860273",
"code_snippet": "#include <iostream>\n#include <cmath>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll z;\n while (cin >> z && z) {\n ll ans = 0;\n ll zCube = z * z * z; // Calculate z^3 once\n ll limit = cbrt(zCube); // Calculate the cube root of z^3 once\n for (ll x = 1; x <= limit; x++) {\n ll xCube = x * x * x; // Calculate x^3 once\n for (ll y = 1; y <= limit; y++) {\n ll yCube = y * y * y; // Calculate y^3 once\n if (xCube + yCube <= zCube)\n ans = max(ans, xCube + yCube);\n else\n break; // Break the loop if the sum exceeds z^3\n }\n }\n cout << zCube - ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3108,
"score_of_the_acc": -0.4033,
"final_rank": 13
},
{
"submission_id": "aoj_1109_8860272",
"code_snippet": "#include <iostream>\n#include <cmath>\nusing namespace std;\n\nint main() {\n int tb[1112], ans[1112], N;\n \n // Pre-compute and store cubes of numbers in tb array\n for (int i = 1; i < 1112; i++) {\n tb[i] = i * i * i;\n }\n\n // Pre-compute and store the smallest difference in ans array\n for (int z = 1; z < 1112; z++) {\n int z3 = tb[z], ret = z3;\n\n // Calculate the upper limit for i\n int max_i = cbrt(z3 / 2);\n for (int i = 1; i <= max_i; i++) {\n int i3 = tb[i];\n\n // Find the greatest cube number less than or equal to z3 - i3\n int j3 = tb[(int)cbrt(z3 - i3)];\n if (i3 + j3 >= z3)\n break;\n\n ret = min(ret, z3 - i3 - j3);\n }\n ans[z] = ret;\n }\n\n // Print the smallest difference for each N read from standard input\n while (cin >> N, N) {\n cout << ans[N] << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3244,
"score_of_the_acc": -0.5739,
"final_rank": 15
},
{
"submission_id": "aoj_1109_8860271",
"code_snippet": "#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint nr(int a) {\n int ret = 1;\n for (int i = 2; i < 1112; i++) {\n int tb = i * i * i;\n if (tb > a)\n break;\n ret = i;\n }\n return ret * ret * ret;\n}\n\nint calc(int z) {\n int z3 = z * z * z, ret = z3;\n for (int i = 1; i < z; i++) {\n int i3 = i * i * i;\n if (z3 - i3 <= i3)\n break;\n int j3 = nr(z3 - i3);\n ret = min(ret, z3 - i3 - j3);\n }\n return ret;\n}\n\nint main() {\n int ans[1112];\n for (int i = 1; i < 1112; i++)\n ans[i] = calc(i);\n int N;\n while (cin >> N, N)\n cout << ans[N] << endl;\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 3068,
"score_of_the_acc": -1.1913,
"final_rank": 20
},
{
"submission_id": "aoj_1109_8860263",
"code_snippet": "#include <algorithm>\n#include <iostream>\nusing namespace std;\n\nint tb[1112], ans[1112], N;\n\nint nr(int a) {\n int low = 1, high = 1112, mid;\n\n while (low < high) {\n mid = low + (high - low) / 2;\n if (tb[mid] > a)\n high = mid;\n else\n low = mid + 1;\n }\n\n return tb[low - 1];\n}\n\nint calc(int z) {\n int z3 = z * z * z, ret = z3;\n for (int i = 1; i < z; i++) {\n int i3 = i * i * i, j3 = nr(z3 - i3);\n if (i3 + j3 >= z3)\n break;\n ret = min(ret, z3 - i3 - j3);\n }\n return ret;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n\n for (int i = 1; i < 1112; i++)\n tb[i] = i * i * i;\n for (int i = 1; i < 1112; i++)\n ans[i] = calc(i);\n while (cin >> N, N)\n cout << ans[N] << '\\n';\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3136,
"score_of_the_acc": -0.3391,
"final_rank": 11
},
{
"submission_id": "aoj_1109_8838142",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n ll z;\n while (cin >> z && z) {\n ll ans = 0;\n ll z_cubed = z * z * z;\n ll max_x = cbrt(z_cubed); // Compute the cube root of z_cubed\n ll max_y = cbrt(z_cubed - 1); // Compute the cube root of z_cubed - 1\n\n for (ll x = 1; x <= max_x; x++) {\n ll x_cubed = x * x * x;\n ll max_y_with_x = cbrt(z_cubed - x_cubed);\n for (ll y = 1; y <= max_y_with_x; y++) {\n ll y_cubed = y * y * y;\n ll sum_cubed = x_cubed + y_cubed;\n if (sum_cubed <= z_cubed && sum_cubed > ans) {\n ans = sum_cubed;\n }\n }\n }\n\n cout << z_cubed - ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3200,
"score_of_the_acc": -0.6033,
"final_rank": 16
},
{
"submission_id": "aoj_1109_8838127",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\n\nconst int UPPER_BOUND = 1112;\n\nstd::vector<int> tb(UPPER_BOUND);\nstd::vector<int> ans(UPPER_BOUND);\n\nint nr(int a) {\n int left = 1, right = UPPER_BOUND - 1;\n while (left < right) {\n int mid = left + (right - left + 1) / 2;\n if (tb[mid] <= a) {\n left = mid;\n } else {\n right = mid - 1;\n }\n }\n return tb[left];\n}\n\nint calc(int z) {\n int z3 = z * z * z;\n int ret = z3;\n\n int left = 1, right = UPPER_BOUND - 1;\n while (left < right) {\n int i3 = left * left * left;\n int j3 = nr(z3 - i3);\n\n if (i3 + j3 >= z3) {\n break;\n }\n\n ret = std::min(ret, z3 - i3 - j3);\n left++;\n }\n\n return ret;\n}\n\nint main() {\n for (int i = 1; i < UPPER_BOUND; i++) {\n tb[i] = i * i * i;\n }\n\n for (int i = 1; i < UPPER_BOUND; i++) {\n ans[i] = calc(i);\n }\n\n int N;\n while (std::cin >> N && N) {\n std::cout << ans[N] << std::endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3080,
"score_of_the_acc": -0.2174,
"final_rank": 7
},
{
"submission_id": "aoj_1109_8820946",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <cmath>\nusing namespace std;\nconst int MAXN = 1112;\nint tb[MAXN], ans[MAXN], N;\n\nint nr(int a) {\n int left = 0, right = MAXN, mid;\n while (left < right) {\n mid = left + (right - left) / 2;\n if (tb[mid] <= a)\n left = mid + 1;\n else\n right = mid;\n }\n return tb[left - 1];\n}\n\nint calc(int z) {\n int z3 = z * z * z, ret = z3;\n for (int i = 1, i3 = i * i * i; i3 < z3; i++, i3 = i * i * i) {\n int j3 = nr(z3 - i3);\n if (i3 + j3 >= z3)\n break;\n ret = min(ret, z3 - i3 - j3);\n }\n return ret;\n}\n\nint main() {\n for (int i = 1; i < MAXN; i++)\n tb[i] = i * i * i;\n for (int i = 1; i < MAXN; i++)\n ans[i] = calc(i);\n while (cin >> N, N)\n cout << ans[N] << endl;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3004,
"score_of_the_acc": -0.0522,
"final_rank": 2
},
{
"submission_id": "aoj_1109_8820942",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <cmath>\nusing namespace std;\n\nint tb[1112], ans[1112], N;\n\nint nr(int a) {\n int ret = cbrt(a); // Use in-built function to calculate cube root\n return tb[ret];\n}\n\nint calc(int z) {\n int z3 = z * z * z, ret = z3;\n int i3 = 1;\n for (int i = 1; i < z; i++) {\n int j3 = nr(z3 - i3);\n int sum = i3 + j3;\n if (sum >= z3)\n break;\n ret = min(ret, z3 - sum);\n i3 += (3*i*i + 3*i + 1); // Calculate the next cube\n }\n return ret;\n}\n\nint main() {\n for (int i = 1; i < 1112; i++)\n tb[i] = i * i * i;\n for (int i = 1; i < 1112; i++)\n ans[i] = calc(i);\n while (cin >> N, N)\n cout << ans[N] << endl;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3268,
"score_of_the_acc": -0.6261,
"final_rank": 17
},
{
"submission_id": "aoj_1109_8820941",
"code_snippet": "#include <algorithm>\n#include <iostream>\nusing namespace std;\nint tb[1113], ans[1113], N;\n\nint nr(int a) {\n int left = 2, right = 1111;\n while (left < right) {\n int mid = left + (right - left) / 2;\n if (tb[mid] > a)\n right = mid;\n else\n left = mid + 1;\n }\n return tb[left - 1];\n}\n\nint calc(int z) {\n int z3 = tb[z], ret = z3;\n for (int i = 1; i < z; i++) {\n int i3 = tb[i], j3 = nr(z3 - i3);\n if (i3 + j3 >= z3)\n break;\n ret = min(ret, z3 - i3 - j3);\n }\n return ret;\n}\n\nint main() {\n ios::sync_with_stdio(false); // speed up cin and cout\n for (int i = 1; i <= 1112; i++)\n tb[i] = i * i * i;\n for (int i = 1; i <= 1112; i++)\n ans[i] = calc(i);\n while (cin >> N, N)\n cout << ans[N] << '\\n';\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3096,
"score_of_the_acc": -0.2522,
"final_rank": 10
},
{
"submission_id": "aoj_1109_8820939",
"code_snippet": "#include <algorithm>\n#include <iostream>\nusing namespace std;\nint tb[1112], ans[1112], N;\n\nint calc(int z) {\n int z3 = z * z * z, ret = z3;\n for (int i = 1; i < z; i++) {\n int i3 = i * i * i;\n int j3 = tb[lower_bound(tb, tb+1112, z3 - i3) - tb - 1];\n if (i3 + j3 >= z3)\n break;\n if (ret > z3 - i3 - j3)\n ret = z3 - i3 - j3;\n }\n return ret;\n}\n\nint main() {\n for (int i = 1; i < 1112; i++)\n tb[i] = i * i * i;\n for (int i = 1; i < 1112; i++)\n ans[i] = calc(i);\n while (cin >> N, N)\n cout << ans[N] << endl;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3080,
"score_of_the_acc": -0.2174,
"final_rank": 7
},
{
"submission_id": "aoj_1109_8820934",
"code_snippet": "#include <algorithm>\n#include <iostream>\nusing namespace std;\nint tb[1112], ans[1112];\n\nint calc(int z) {\n int z3 = z * z * z, ret = z3;\n for (int i = 1; i < z; i++) {\n int i3 = i * i * i;\n int j3 = *(upper_bound(tb, tb + 1112, z3 - i3) - 1);\n if (i3 + j3 >= z3)\n break;\n ret = min(ret, z3 - i3 - j3);\n }\n return ret;\n}\n\nvoid init() {\n for (int i = 1; i < 1112; i++)\n tb[i] = i * i * i;\n for (int i = 1; i < 1112; i++)\n ans[i] = calc(i);\n}\n\nint main() {\n init();\n int N;\n while (cin >> N, N)\n cout << ans[N] << endl;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3080,
"score_of_the_acc": -0.2174,
"final_rank": 7
}
] |
aoj_1106_cpp
|
Factorization of Quadratic Formula
As the first step in algebra, students learn quadratic formulas and
their factorization. Often, the factorization is a severe burden
for them. A large number of students cannot master the factorization;
such students cannot be aware of the elegance of advanced algebra.
It might be the case that the factorization increases the number of people
who hate mathematics.
Your job here is to write a program which helps students of
an algebra course. Given a quadratic formula, your program should report
how the formula can be factorized into two linear formulas.
All coefficients of quadratic formulas and those of resultant
linear formulas are integers in this problem.
The coefficients
a
,
b
and
c
of a quadratic formula
ax
2
+
bx
+
c
are given.
The values of
a
,
b
and
c
are integers,
and their absolute values do not exceed 10000.
From these values, your program is requested to find four integers
p
,
q
,
r
and
s
, such that
ax
2
+
bx
+
c
=
(
px
+
q
)(
rx
+
s
).
Since we are considering integer coefficients only, it is not
always possible to factorize a quadratic formula into linear formulas.
If the factorization of the given formula is impossible,
your program should report that fact.
Input
The input is a sequence of lines, each representing
a quadratic formula.
An input line is given in the following format.
a
b
c
Each of
a
,
b
and
c
is an integer.
They satisfy the following inequalities.
0 <
a
<= 10000
-10000 <=
b
<= 10000
-10000 <=
c
<= 10000
The greatest common divisor of
a
,
b
and
c
is 1.
That is, there is no integer
k
, greater than 1,
such that all of
a
,
b
and
c
are divisible by
k
.
The end of input is indicated by a line consisting of three 0's.
Output
For each input line, your program should output the four integers
p
,
q
,
r
and
s
in a line, if they exist.
These integers should be output in this order, separated by
one or more white spaces.
If the factorization is impossible, your program should output a line
which contains the string "Impossible" only.
The following relations should hold between the values
of the four coefficients.
p
> 0
r
> 0
(
p
>
r
) or (
p
=
r
and
q
>=
s
)
These relations, together with the fact that the greatest common
divisor of
a
,
b
and
c
is 1,
assure the uniqueness of the solution.
If you find a way to factorize the formula, it is not necessary
to seek another way to factorize it.
Sample Input
2 5 2
1 1 1
10 -7 0
1 0 -3
0 0 0
Output for the Sample Input
2 1 1 2
Impossible
10 -7 1 0
Impossible
|
[
{
"submission_id": "aoj_1106_9046334",
"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 a, b, c;\n while (cin >> a >> b >> c, a) {\n if (c == 0) {\n int p = a, q = b, r = 1, s = 0;\n if (p == r and q < s) swap(q, s);\n cout << p << \" \" << q << \" \" << r << \" \" << s << \"\\n\";\n } else {\n vector<int> fa, fc;\n for (int i = 1; i <= a; i++) {\n if (a % i == 0) fa.push_back(i);\n }\n for (int i = 1; i <= abs(c); i++) {\n if (c % i == 0) {\n fc.push_back(-i);\n fc.push_back(i);\n }\n }\n int p = -1, q = -1, r = -1, s = -1;\n for (int pp : fa) {\n for (int qq : fc) {\n int rr = a / pp;\n int ss = c / qq;\n if (pp * ss + qq * rr == b) {\n p = pp, q = qq, r = rr, s = ss;\n }\n }\n }\n if (p < r) {\n swap(p, r);\n swap(q, s);\n } else if (p == r) {\n if (q < s) swap(q, s);\n }\n if (p != -1) {\n cout << p << \" \" << q << \" \" << r << \" \" << s << \"\\n\";\n } else {\n cout << \"Impossible\\n\";\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3156,
"score_of_the_acc": -0.8478,
"final_rank": 12
},
{
"submission_id": "aoj_1106_4776439",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n while(1){\n int a,b,c;\n cin >> a >> b >> c;\n if(a == 0) break;\n\n vector<int> factor_a;\n for(int i=1; i<=a; i++){\n if(a%i == 0) factor_a.push_back(i);\n }\n vector<int> factor_c;\n for(int i=1; i<=abs(c); i++){\n if(abs(c)%i == 0){\n factor_c.push_back(i);\n factor_c.push_back(-i);\n }\n }\n sort(factor_c.begin(), factor_c.end());\n\n bool found = false;\n for(auto r: factor_a){\n for(auto s: factor_c){\n int p = a/r;\n int q = c/s; \n if(p*s +r*q == b){\n cout << p << \" \" << q << \" \" << r << \" \" << s << endl;\n found = true;\n break;\n }\n }\n if(found) break;\n }\n if(c == 0){\n if(a == 1 and b < 0){\n cout << \"1 0 1 \" << b << endl;\n }else{\n cout << a << \" \" << b << \" 1 0\" << endl;\n }\n found = true;\n }\n if(!found){\n cout << \"Impossible\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3136,
"score_of_the_acc": -0.8526,
"final_rank": 13
},
{
"submission_id": "aoj_1106_3411868",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(){\n int a, b, c;\n while(cin >> a >> b >> c, a > 0){\n int p, q, r, s;\n bool found = false;\n for(p = a; p*p >= a; p--){\n if(a%p) continue;\n r = a/p;\n for(q = -abs(c); q <= abs(c); q++){\n if(q == 0){\n if(c != 0) continue;\n if(b%p == 0){\n found = true;\n s = b/p;\n break;\n }\n if(b%r == 0){\n found = true;\n s = 0;\n q = b/r;\n break;\n }\n }\n if(c%abs(q)) continue;\n s = c/q;\n if(p*s+q*r == b){\n found = true;\n break;\n }\n }\n if(found) break;\n }\n if(found){\n if(p == r && q < s) swap(q, s);\n cout << p << \" \" << q << \" \" << r << \" \" << s << endl;\n }else{\n cout << \"Impossible\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 110,
"memory_kb": 3044,
"score_of_the_acc": -0.9311,
"final_rank": 14
},
{
"submission_id": "aoj_1106_2588331",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\nint A,B,C;\n\nvoid func(){\n\n\tint left = -1*max(abs(B),abs(C));\n\tint right = max(abs(B),abs(C));\n\tint p,q;\n\n\tfor(int r = 1; r*r <= A; r++){\n\t\tif(A%r != 0)continue;\n\t\tp = A/r;\n\t\tfor(int s = left; s <= right; s++){\n\t\t\tif(s != 0 && C%s != 0)continue;\n\t\t\tif(s != 0)q = C/s;\n\t\t\telse{\n\t\t\t\tq = B/r;\n\t\t\t}\n\t\t\tif(q != 0 && C%q != 0)continue;\n\t\t\tif(p ==r && s > q)continue;\n\n\t\t\tif(p*r == A && (p*s+q*r) == B && q*s == C){\n\t\t\t\tprintf(\"%d %d %d %d\\n\",p,q,r,s);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"Impossible\\n\");\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d %d\",&A,&B,&C);\n\t\tif(A == 0 && B == 0 && C == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3092,
"score_of_the_acc": -0.9888,
"final_rank": 15
},
{
"submission_id": "aoj_1106_2270913",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n long long a,b,c;\n while(cin>>a>>b>>c,a){\n if(c==0){\n if(a==1&&b<0)cout<<a<<' '<<0<<' '<<1<<' '<<b<<endl;\n else cout<<a<<' '<<b<<' '<<1<<' '<<0<<endl;\n }\n else{\n for(int j=1;j<=a;j++){\n if(a%j==0){\n if(a/j>=j)\n for(int i=10000;i>=-10000;i--){\n long long t,p=0;\n if(i*j+a/j*p==b&&p*i==c){\n cout<<a/j<<' '<<i<<' '<<j<<' '<<p<<endl;\n goto L;\n }\n if(i!=0){\n if(c%abs(i)==0)t=c/i;\n else continue;\n }\n else continue;\n if(i*j+a/j*t==b&&t*i==c){\n if(j*j==a&&i<t)cout<<a/j<<' '<<t<<' '<<j<<' '<<i<<endl;\n else cout<<a/j<<' '<<i<<' '<<j<<' '<<t<<endl;\n goto L;\n }\n }\n else break;\n }\n }\n cout<<\"Impossible\"<<endl;L:;\n }\n }\n}",
"accuracy": 1,
"time_ms": 790,
"memory_kb": 3092,
"score_of_the_acc": -1.8221,
"final_rank": 20
},
{
"submission_id": "aoj_1106_2270708",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n int a, b, c;\n while( cin >> a >> b >> c ) {\n if( a == 0 && b == 0 && c == 0 ) break;\n int p = 2*a, r = 2*a;\n int q = -(-b+(sqrt((double)(b*b-4*a*c))));\n int s = -(-b-(sqrt((double)(b*b-4*a*c))));\n //int tmp = (int)sqrt((double)(b*b-4*a*c));\n //cout << b*b-4*a*c << endl;\n //cout << sqrt((double)b*b-4*a*c) << endl;\n //cout << q << \" \" << s << endl;\n int tmp = (int)sqrt((double)(b*b-4*a*c));\n //cout << tmp << endl;\n if( abs(sqrt((double)(b*b-4*a*c)) - (double)tmp) != 0 || b*b-4*a*c < 0 ) {\n cout << \"Impossible\" << endl;\n } else { \n //cout << sqrt((double)(b*b-4*a*c)) << endl;\n //cout << q << \" \" << s << endl;\n for(int i=100000; i>1; i--) {\n\tif( !(p % i) && !(q % i) ) {\n\t p /= i; q /= i;\n\t}\n\tif( !(r % i) && !(s % i) ) {\n\t r /= i; s /= i;\n\t}\n\t\n\t\n }\n\n if( p < r ) {\n\tswap(p, r);\n\tswap(q, s);\n }\n if( p == r ) {\n\tif( q < s ) {\n\t swap(q, s);\n\t}\n }\n cout << p << \" \" << q << \" \" << r << \" \" << s << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 400,
"memory_kb": 3140,
"score_of_the_acc": -1.3413,
"final_rank": 18
},
{
"submission_id": "aoj_1106_2270663",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n long long a,b,c;\n while(cin>>a>>b>>c,a){\n if(c==0){\n if(a==1&&b<0)cout<<a<<' '<<0<<' '<<1<<' '<<b<<endl;\n else cout<<a<<' '<<b<<' '<<1<<' '<<0<<endl;\n }\n else{for(int j=1;j<=a;j++){\n\tif(a%j==0){\n\t if(a/j>=j)\n\t for(int i=10000;i>=-10000;i--){\n\t long long t,p=0;\n\t if(i*j+a/j*p==b&&p*i==c){\n\t\tcout<<a/j<<' '<<i<<' '<<j<<' '<<p<<endl;\n\t\tgoto L;\n\t }\n\t if(i!=0){\n\t\tif(c%abs(i)==0)t=c/i;\n\t\telse continue;\n\t }\n\t else continue;\n\t if(i*j+a/j*t==b&&t*i==c){\n\t\tif(j*j==a&&i<t)\t cout<<a/j<<' '<<t<<' '<<j<<' '<<i<<endl;\n\t\telse cout<<a/j<<' '<<i<<' '<<j<<' '<<t<<endl;\n\t\tgoto L;\n\t }\n\t }\n\t else break;\n\t}\n }\n cout<<\"Impossible\"<<endl;L:;\n }\n\n }\n}",
"accuracy": 1,
"time_ms": 770,
"memory_kb": 3076,
"score_of_the_acc": -1.7901,
"final_rank": 19
},
{
"submission_id": "aoj_1106_2114395",
"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<stack>\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 vector<string> vs;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-5;\nconst int inf=1e8;\nint main(){\n\tint a,b,c;\n\twhile(cin>>a>>b>>c,a||b||c){\n\t\tfor(int sa=1;sa*sa<=a;sa++)if(a%sa==0){\n\t\t\tint la=a/sa;\n\t\t\tfor(int sb=-10000;sb<=10000;sb++){\n\t\t\t\tif(sb&&c%sb)continue;\n\t\t\t\tint lb=(sb?c/sb:0);\n\t\t\t\trep(i,2){\n\t\t\t\t\trep(j,2){\n\t\t\t\t\t\tif(sa*lb+la*sb==b){\n\t\t\t\t\t\t\tif(la==sa&&lb<sb)swap(lb,sb);\n\t\t\t\t\t\t\tcout<<la<<\" \"<<lb<<\" \"<<sa<<\" \"<<sb<<endl;\n\t\t\t\t\t\t\tgoto end;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tsb*=-1;\n\t\t\t\t\t\tlb*=-1;\n\t\t\t\t\t}\n\t\t\t\t\tswap(sb,lb);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<\"Impossible\"<<endl;\n\t\tend:;\n\t}\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 3076,
"score_of_the_acc": -1.1234,
"final_rank": 17
},
{
"submission_id": "aoj_1106_1882341",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\nint a, b, c; vector<int>p, q;\nint main() {\n\twhile (true) {\n\t\tcin >> a >> b >> c; p.clear(); q.clear(); if (a == 0)break;\n\t\tif (c == 0) {\n\t\t\tif (b < 0 && a == 1)cout << a << \" \" << \"0\" << \" \" << \"1\" << \" \" << b << endl;\n\t\t\telse { cout << a << ' ' << b << ' ' << \"1\" << ' ' << \"0\" << endl; }\n\t\t\tgoto E;\n\t\t}\n\t\tfor (int i = -10000; i <= 10000; i++) {\n\t\t\tif (i == 0)continue;\n\t\t\tif (a%i == 0)p.push_back(i);\n\t\t\tif (c%i == 0)q.push_back(i);\n\t\t}\n\t\tfor (int i = 0; i < p.size(); i++) {\n\t\t\tfor (int j = 0; j < q.size(); j++) {\n\t\t\t\tint sum = p[i] * (c / q[j]) + (a / p[i])*q[j];\n\t\t\t\tif (p[i] < a / p[i] || p[i] < 0 || a / p[i] < 0)continue;\n\t\t\t\tif (p[i] == a / p[i] && q[j] < c / q[j])continue;\n\t\t\t\tif (sum == b) { cout << p[i] << ' ' << q[j] << ' ' << a / p[i] << ' ' << c / q[j] << endl; goto E; }\n\t\t\t}\n\t\t}\n\t\tcout << \"Impossible\" << endl; E:;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 1224,
"score_of_the_acc": -0.2532,
"final_rank": 6
},
{
"submission_id": "aoj_1106_1869840",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX 10000\ntypedef pair<int,int> pii;\nint a,b,c;\n \nbool input(){\n cin >> a >> b >> c;\n return a;\n}\n \nint main(){\n while(input()){\n\tbool found = false;\n\tvector<pii> pr,qs;\n\tfor(int p = 1 ; p <= a ; p++){\n\t int r = a/p;\n\t if(a % p != 0 || p < r) continue;\n\t pr.push_back(pii(p,r));\n\t}\n\tint cc = c < 0 ? -c : c;\n\tfor(int q = -cc ; q <= cc ; q++){\n\t if(q == 0) continue;\n\t int s = 0;\n\t if(c < 0){\n\t\tif(q < 0 && abs(c) % abs(q) == 0){\n\t\t if(abs(c) % abs(q) == 0){\n\t\t\ts = abs(c)/abs(q);\n\t\t }\n\t\t}else{\n\t\t if(abs(c) % q == 0){\n\t\t\ts = abs(c)/q;\n\t\t\ts = -s;\n\t\t }\n\t\t}\n\t }else{\n\t\tif(q < 0){\n\t\t if(c % abs(q) == 0){\n\t\t\ts = c/abs(q);\n\t\t\ts = -s;\n\t\t }\n\t\t}else{\n\t\t if(c % q == 0){\n\t\t\ts = c/q;\n\t\t }\n\t\t}\n\t }\n\t if(s == 0) continue;\n\t qs.push_back(pii(q,s));\n\t}\n\tif(c == 0){\n\t for(int i = -MAX ; i <= MAX ; i++){\n\t\tqs.push_back(pii(0,i));\n\t\tqs.push_back(pii(i,0));\n\t }\n\t}\n\tfor(int i = 0 ; i < (int)pr.size() ; i++){\n\t for(int j = 0 ; j < (int)qs.size() ; j++){\n\t\tint p = pr[i].first,r = pr[i].second;\n\t\tint q = qs[j].first,s = qs[j].second;\n\t\tif(p == r && q < s) continue;\n\t\tif(p*s+q*r == b){\n\t\t cout << p << \" \" << q << \" \" << r << \" \" << s << endl;\n\t\t found = true;\n\t\t goto END;\n\t\t}\n\t }\n\t}\n\tif(!found){\n\t cout << \"Impossible\" << endl;\n\t}\n END:;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3536,
"score_of_the_acc": -1.0256,
"final_rank": 16
},
{
"submission_id": "aoj_1106_1230407",
"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 a, b, c;\n\nvoid solve(){\n FOR(p, 1, 10001){\n if(a % p) continue;\n int r = a / p;\n FOR(q, -10001, 10001){\n int s;\n if(q == 0) s = b / p;\n else s = c / q;\n if(p < r || (r == p && q < s)) continue;\n if(p * r == a && p * s + r * q == b && q * s == c){\n cout <<p <<\" \" <<q <<\" \" <<r <<\" \" <<s <<endl;\n return ;\n }\n }\n }\n cout <<\"Impossible\" <<endl;\n}\n\nint main() {\n while(cin >>a >>b >>c && a) solve();\n return 0;\n}",
"accuracy": 1,
"time_ms": 600,
"memory_kb": 1160,
"score_of_the_acc": -0.8045,
"final_rank": 11
},
{
"submission_id": "aoj_1106_1164955",
"code_snippet": "#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nvoid output(int p, int q, int r, int s){\n\tif(p < r){\n\t\tswap(p, r);\n\t\tswap(q, s);\n\t}\n\tif(p == r && q < s){\n\t\tswap(q,s);\n\t}\n\tcout << p << \" \" << q << \" \" << r << \" \" << s << endl;\n}\nbool test(int a, int b, int c){\n\tif(b == 0 && c == 0){\n\t\toutput(a, 0, 1, 0);\n\t\treturn true;\n\t}\n\tfor(int i = 1; i <= a; ++i){\n\t\tif(a%i == 0){\n\t\t\tint r = a/i;\n\t\t\tfor(int j = -10000; j <= 10000; ++j){\n\t\t\t\tif(j == 0){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif(c%j == 0){\n\t\t\t\t\tint s = c/j;\n\t\t\t\t\tif(i*s+j*r == b){\n\t\t\t\t\t\toutput(i, j, r, s);\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nint main(){\n\tint a, b, c;\n\tcin >> a >> b >> c;\n\twhile(a | b |c){\n\t\tif(!test(a,b,c)){\n\t\t\tcout << \"Impossible\" << endl;\n\t\t}\n\t\tcin >> a >> b >> c;\n\t}\n}",
"accuracy": 1,
"time_ms": 420,
"memory_kb": 1164,
"score_of_the_acc": -0.5753,
"final_rank": 9
},
{
"submission_id": "aoj_1106_1116230",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n \nint main() {\n int a,b,c;\n while(cin >> a >> b >> c && (a||b||c)) {\n if(c==0) {\n if(a!=1)cout << a << \" \" << b << \" \" << 1 << \" \" << 0 << endl;\n else cout << a << \" \" << max(b,0) << \" \" << 1 << \" \" << min(b,0) << endl;\n continue;\n }\n for(int r=1; r<=a; r++) {\n if(a%r) continue;\n int p=a/r;\n for(int s=-10000; s<=10000; s++) {\n if(s==0) continue;\n if(c%s) continue;\n int q=c/s;\n if(p>0 && r>0 && (p>r || (p==r && q>=s))) {\n if(p*s+q*r==b) {\n cout << p << \" \" << q << \" \" << r << \" \" << s << endl;\n goto end;\n }\n }\n }\n }\n cout << \"Impossible\" << endl;\n end:;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 420,
"memory_kb": 1164,
"score_of_the_acc": -0.5753,
"final_rank": 9
},
{
"submission_id": "aoj_1106_1111617",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX 10000\ntypedef pair<int,int> pii;\nint a,b,c;\n\nbool input(){\n cin >> a >> b >> c;\n return a;\n}\n\nint main(){\n while(input()){\n bool found = false;\n vector<pii> pr,qs;\n for(int p = 1 ; p <= a ; p++){\n int r = a/p;\n if(a % p != 0 || p < r) continue;\n pr.push_back(pii(p,r));\n }\n int cc = c < 0 ? -c : c;\n for(int q = -cc ; q <= cc ; q++){\n if(q == 0) continue;\n int s = 0;\n if(c < 0){\n if(q < 0 && abs(c) % abs(q) == 0){\n if(abs(c) % abs(q) == 0){\n s = abs(c)/abs(q);\n }\n }else{\n if(abs(c) % q == 0){\n s = abs(c)/q;\n s = -s;\n }\n }\n }else{\n if(q < 0){\n if(c % abs(q) == 0){\n s = c/abs(q);\n s = -s;\n }\n }else{\n if(c % q == 0){\n s = c/q;\n }\n }\n }\n if(s == 0) continue;\n qs.push_back(pii(q,s));\n }\n if(c == 0){\n for(int i = -MAX ; i <= MAX ; i++){\n qs.push_back(pii(0,i));\n qs.push_back(pii(i,0));\n }\n }\n for(int i = 0 ; i < (int)pr.size() ; i++){\n for(int j = 0 ; j < (int)qs.size() ; j++){\n int p = pr[i].first,r = pr[i].second;\n int q = qs[j].first,s = qs[j].second;\n if(p == r && q < s) continue;\n if(p*s+q*r == b){\n cout << p << \" \" << q << \" \" << r << \" \" << s << endl;\n found = true;\n goto END;\n }\n }\n }\n if(!found){\n cout << \"Impossible\" << endl;\n }\n END:;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1844,
"score_of_the_acc": -0.3862,
"final_rank": 8
},
{
"submission_id": "aoj_1106_992924",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint a, b, c;\n\nint gcd(int x, int y){\n int t;\n if( x < y ){\n t = y;\n y = x;\n x = t;\n }\n while( y ){\n t = x%y;\n x = y;\n y = t;\n }\n return x;\n}\n\nint abs(int x){\n return x<0?-x:x;\n}\n\nint main(){\n cin >> a >> b >> c;\n while( a || b || c ){\n bool possible = true;\n int d = 0, x1, x2, u1, u2, s;\n while( d*d < b*b - 4*a*c ) d++;\n possible = (d*d == b*b - 4*a*c);\n if( possible ){\n s = (- b - d)/abs(- b - d);\n x1 = abs(- b - d);\n if( x1 ){\n u1 = 2*a/gcd(x1, 2*a);\n x1 = -s*x1/gcd(x1, 2*a);\n u2 = a/u1;\n x2 = c/x1;\n }else{\n u1 = 1;\n u2 = a;\n x2 = b;\n }\n if( u1 < u2 || (u1 == u2 && x1 < x2) ){\n int t = x1;\n x1 = x2;\n x2 = t;\n t = u1;\n u1 = u2;\n u2 = t;\n }\n cout << u1 << ' ' << x1 << ' ' << u2 << ' ' << x2 << endl;\n }else{\n cout << \"Impossible\" << endl;\n }\n cin >> a >> b >> c;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1156,
"score_of_the_acc": -0.0465,
"final_rank": 2
},
{
"submission_id": "aoj_1106_955293",
"code_snippet": "#include<iostream>\n#include<cmath>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\n\nvoid output(int p, int q, int r, int s) {\n if (p > r || (p == r && q >= s)) cout << p << \" \" << q << \" \" << r << \" \" << s << endl;\n else cout << r << \" \" << s << \" \" << p << \" \" << q << endl;\n}\n\nint main() {\n while (true) {\n int a, b, c;\n cin >> a >> b >> c;\n if (a == 0) break;\n rep (i, a + 1) if (i > 0 && a % i == 0) for (int j = -abs(c); j <= abs(c); ++j) if (j != 0 && c % j == 0) {\n\t int ii = a / i;\n\t int jj = c / j;\n\t if (i * jj + ii * j != b) continue;\n\t output(i, j, ii, jj);\n\t goto next;\n\t}\n if (c == 0) {\n output(a, b, 1, 0);\n goto next;\n }\n cout << \"Impossible\" << endl;\n next:;\n }\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 1164,
"score_of_the_acc": -0.2804,
"final_rank": 7
},
{
"submission_id": "aoj_1106_680756",
"code_snippet": "#include <iostream>\n#include <cmath>\nusing namespace std;\ndouble gc(double x,double y){\n if(x<0) x=-x;\n if(y<0) y=-y;\n if(x==0) return y;\n if(y==0) return x;\n while(x!=y){\n // cout <<x<<\"tttt \"<<y<<endl;\n if(x>y)\n x=x-y;\n if(y>x)\n y=y-x;\n\n }\n return x;\n}\nint test(int a,int b,int c){\n int t=b*b-4*a*c;\n for(int i=0; i*i<=t; i++)\n if(i*i==t) \n return 0;\n \n return 1;\n}\nint main(){\n double a,b,c,p,q,r,s,qq,ww,ee,rr;\n int hanbetu;\n \n while(1){\n cin >>a>>b>>c;\n // cin >>qq>>ww>>ee>>rr;\n //a=qq*ee;b=qq*rr+ww*ee;c=ww*rr;\n if(a==0&&b==0&&c==0) break;\n hanbetu=b*b-4*a*c;\n // if(hanbetu<0||sqrt(hanbetu)!=(double)((int)sqrt(hanbetu)) ) {\n if(hanbetu<0||test(a,b,c) ) { \n cout<<\"Impossible\"<<endl;\n \n continue;\n }\n q=b-sqrt(hanbetu);\n s=b+sqrt(hanbetu);\n //cout<<q<<' '<<s<<endl;\n p=gc(2*a,q); r=gc(2*a,s);\n q=q/p; s=s/r;\n p=2*a/p; r=2*a/r;\n if(p>r||(p==r&&q>=s))\n cout <<p<<' '<<q<<' '<<r<<' '<<s<<endl;\n else cout<<r<<' '<<s<<' ' <<p<<' '<<q<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1280,
"score_of_the_acc": -0.0962,
"final_rank": 3
},
{
"submission_id": "aoj_1106_673786",
"code_snippet": "#include <cstdio>\n#include <algorithm>\n\nusing namespace std;\n\nint a, b, c, r, p, q, s, x, y, t, i, f;\n\nint solve(){\n t = -1;\n f = b * b - 4 * a * c;\n for(i=0;i*i<=f;i++) if(i*i == f) t = i;\n if(t >= 0){\n x = t - b;\n y = -(t + b);\n for(r=1;r<=a;r++){\n if(!(a%r)){\n p = a / r;\n for(i=0;i<2;i++){\n q = -p * x / (2 * a);\n s = -r * y / (2 * a);\n if((-p * x) % (2 * a) == 0 && (-r * y) % (2 * a) == 0 && (p > r || p == r && q >= s)) return 1;\n swap(x, y);\n }\n }\n }\n }\n return 0;\n}\n\nmain(){\n while(scanf(\"%d%d%d\",&a,&b,&c) && (a|b|c)){\n if(solve()) printf(\"%d %d %d %d\\n\",p,q,r,s);\n else printf(\"Impossible\\n\");\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1040,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1106_561628",
"code_snippet": "#include <iostream>\n#include <cmath>\n#include <algorithm>\n#include <vector>\nusing namespace std;\ntypedef long long lli;\n \nvoid solve(lli a, lli b, lli c) {\n vector<lli> fa, fc;\n for(lli i = 1; i <= a; ++i) {\n if(a % i == 0) fa.push_back(i);\n }\n for(lli i = 1; i <= labs(c); ++i) {\n if(c % i == 0) {\n fc.push_back(i);\n fc.push_back(-i);\n }\n }\n \n if(c == 0) {\n \n for(lli i = 0; i < fa.size(); ++i) {\n for(lli k = 0; k < 2; ++k) {\n lli p = fa[i];\n lli r = a / fa[i];\n lli q, s;\n if(k == 0) {\n if(b % p != 0) continue;\n q = 0;\n s = b / p;\n } else {\n if(b % r != 0) continue;\n s = 0;\n q = b / r;\n }\n if((p > r || (p == r && q >= s)) && p*s + q*r == b) {\n cout << p << \" \" << q << \" \" << r << \" \" << s << endl;\n return;\n }\n }\n }\n \n } else {\n \n for(lli i = 0; i < fa.size(); ++i) {\n for(lli j = 0; j < fc.size(); ++j) {\n lli p = fa[i];\n lli r = a / fa[i];\n lli q = fc[j];\n lli s = c / fc[j];\n if((p > r || (p == r && q >= s)) && p*s + q*r == b) {\n cout << p << \" \" << q << \" \" << r << \" \" << s << endl;\n return;\n }\n }\n }\n \n }\n cout << \"Impossible\" << endl;\n}\n \nint main() {\n lli a, b, c;\n while(cin >> a >> b >> c && (a|b|c)) {\n solve(a,b,c);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 1216,
"score_of_the_acc": -0.1474,
"final_rank": 4
},
{
"submission_id": "aoj_1106_561556",
"code_snippet": "#include <iostream>\n#include <cmath>\n#include <algorithm>\n#include <vector>\nusing namespace std;\ntypedef long long lli;\n\nvoid solve(lli a, lli b, lli c) {\n vector<lli> fa, fc;\n for(lli i = 1; i <= a; ++i) {\n if(a % i == 0) fa.push_back(i);\n }\n for(lli i = 1; i <= labs(c); ++i) {\n if(c % i == 0) {\n fc.push_back(i);\n fc.push_back(-i);\n }\n }\n\n if(c == 0) {\n\n for(lli i = 0; i < fa.size(); ++i) {\n for(lli k = 0; k < 2; ++k) {\n\tlli p = fa[i];\n\tlli r = a / fa[i];\n\tlli q, s;\n\tif(k == 0) {\n\t if(b % p != 0) continue;\n\t q = 0;\n\t s = b / p;\n\t} else {\n\t if(b % r != 0) continue;\n\t s = 0;\n\t q = b / r;\n\t}\n\tif((p > r || (p == r && q >= s)) && p*s + q*r == b) {\n\t cout << p << \" \" << q << \" \" << r << \" \" << s << endl;\n\t return;\n\t}\n }\n }\n\n } else {\n\n for(lli i = 0; i < fa.size(); ++i) {\n for(lli j = 0; j < fc.size(); ++j) {\n\tlli p = fa[i];\n\tlli r = a / fa[i];\n\tlli q = fc[j];\n\tlli s = c / fc[j];\n\tif((p > r || (p == r && q >= s)) && p*s + q*r == b) {\n\t cout << p << \" \" << q << \" \" << r << \" \" << s << endl; \n\t return;\n\t}\n }\n }\n\n }\n cout << \"Impossible\" << endl;\n}\n\nint main() {\n lli a, b, c;\n while(cin >> a >> b >> c && (a|b|c)) {\n solve(a,b,c);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 1216,
"score_of_the_acc": -0.1474,
"final_rank": 4
}
] |
aoj_1093_cpp
|
KND Runs for Sweets
Problem
KND君は会津大学に在籍する学生プログラマである。彼は甘党であることで知られている。彼はとある市に1年間滞在することになり、その期間中に市内にある
N
箇所の甘味処をすべて回りたいと思っている。なのでこの1年間の住む場所は甘味処を回るのに一番適した場所がいいと考えている。彼の隣人であるあなたは、各甘味処への最悪の移動時間が最小になる場所を探す事になった。この甘味処がある市は簡単のため二次元平面で表すことにする。彼は目的の甘味処へのモチベーションの違いにより、単位時間あたりの移動距離が変化する。また、彼はどんな場所にでも（たとえ甘味処と同じ場所であろうと）住むつもりでいる。KND君は甘味に関しては妥協を許さないのである。
Input
入力は複数のテストケースからなる。
ひとつのテストケースは以下のな形式で与えられる。
入力の終了を
N
= 0 のとき示す。
N
x
1
y
1
v
1
x
2
y
2
v
2
...
x
N
y
N
v
N
ここで、
N
:甘味処の数
x
i
:i番目の甘味処のx座標
y
i
:i番目の甘味処のy座標
v
i
:i番目の甘味処へ移動するときの単位時間あたりの移動距離
である。
Constraints
入力は以下の条件を満たす。
入力はすべて整数。
2 ≤
N
≤ 100
0 ≤
x
i
,
y
i
≤ 100
1 ≤
v
i
≤ 100 ( 1 ≤
i
≤
N
)
x
i
≠
x
j
or
y
i
≠
y
j
( ただし1 ≤
i
<
j
≤
N
)
Output
各テストケースにつき最悪の移動時間の最小値を一行に出力せよ。この値はジャッジ出力の値と10
-5
より大きい差を持ってはならない。
Sample Input
2
1 1 1
2 2 1
4
1 1 3
3 1 3
4 2 1
1 5 3
0
Sample Output
0.70710678
1.06066017
|
[
{
"submission_id": "aoj_1093_8860355",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <vector>\nusing namespace std;\ndouble EPS = 1e-6;\ndouble add(double a, double b) {\n if (abs(a + b) < EPS * (abs(a) + abs(b)))\n return 0;\n return a + b;\n}\nstruct point {\n double x, y;\n point() {}\n point(double x, double y) : x(x), y(y) {}\n point operator+(const point &p) const { return point(add(x, p.x), add(y, p.y)); }\n point operator-(const point &p) const { return point(add(x, -p.x), add(y, -p.y)); }\n point operator*(double d) const { return point(x * d, y * d); }\n point operator/(double d) const { return point(x / d, y / d); }\n};\ndouble dist(const point &a, const point &b) {\n return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));\n}\nint main(void) {\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n while (scanf(\"%d\", &n), n) {\n P.resize(n);\n V.resize(n);\n for (int i = 0; i < n; i++) {\n scanf(\"%d %d %d\", &x, &y, &v);\n P[i] = point(x, y);\n V[i] = v;\n }\n double r = 0.98;\n point now(0, 0);\n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0, mxdist;\n for (int j = 0; j < P.size(); j++) {\n mxdist = dist(now, P[j]) / V[j];\n if (mxdist > mxd)\n mx = j, mxd = mxdist;\n }\n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n double ans = 0;\n for (int i = 0; i < P.size(); i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n printf(\"%.8f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2780,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1093_8860352",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\ndouble EPS = 1e-6;\n\nstruct point {\n double x, y, v;\n point() {}\n point(double x, double y, double v) : x(x), y(y), v(v) {}\n point operator+(point p) { return point(x + p.x, y + p.y, v); }\n point operator-(point p) { return point(x - p.x, y - p.y, v); }\n point operator*(double d) { return point(x * d, y * d, v); }\n point operator/(double d) { return point(x / d, y / d, v); }\n};\n\ndouble dist(point a, point b) {\n return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));\n}\n\nint main(void) {\n int n;\n double x, y, v;\n vector<point> P;\n while (cin >> n, n) {\n P.clear();\n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P.push_back(point(x, y, v));\n }\n double r = 0.98;\n point now(0, 0, 0);\n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0;\n for (int j = 0; j < P.size(); j++) {\n double currentDist = dist(now, P[j]) / P[j].v;\n if (currentDist > mxd)\n mx = j, mxd = currentDist;\n }\n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n double ans = 0;\n for (int i = 0; i < P.size(); i++) {\n ans = max(ans, dist(now, P[i]) / P[i].v);\n }\n printf(\"%.8f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3188,
"score_of_the_acc": -0.8095,
"final_rank": 5
},
{
"submission_id": "aoj_1093_8835226",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\ndouble EPS = 1e-6;\ndouble add(double a, double b) {\n double sum = a + b;\n if (abs(sum) < EPS * (abs(a) + abs(b)))\n return 0;\n return sum;\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(add(x, p.x), add(y, p.y)); }\n point operator-(point p) { return point(add(x, -p.x), add(y, -p.y)); }\n point operator*(double d) { return point(x * d, y * d); }\n point operator/(double d) { return point(x / d, y / d); }\n};\ndouble dist(point a, point b) {\n double dx = a.x - b.x;\n double dy = a.y - b.y;\n return sqrt(dx * dx + dy * dy);\n}\nint main(void) {\n int n, x, y, v;\n vector<point> P;\n double* V;\n while (cin >> n, n) {\n P.resize(n);\n V = new double[n];\n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P[i] = point(x, y);\n V[i] = v;\n }\n double r = 0.98;\n point now(0, 0);\n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0;\n for (int j = 0; j < n; j++) {\n double d = dist(now, P[j]) / V[j];\n if (d > mxd) {\n mx = j;\n mxd = d;\n }\n }\n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n double ans = 0;\n for (int i = 0; i < n; i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n printf(\"%.8f\\n\", ans);\n delete[] V;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3208,
"score_of_the_acc": -0.8492,
"final_rank": 9
},
{
"submission_id": "aoj_1093_8835220",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\ndouble EPS = 1e-6;\n\ndouble add(double a, double b) {\n double sum = a + b;\n if (fabs(sum) < EPS * (fabs(a) + fabs(b))) {\n return 0;\n }\n return sum;\n}\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(add(x, p.x), add(y, p.y)); }\n point operator-(point p) { return point(add(x, -p.x), add(y, -p.y)); }\n point operator*(double d) { return point(x * d, y * d); }\n point operator/(double d) { return point(x / d, y / d); }\n};\n\ndouble dist(point a, point b) {\n double dx = a.x - b.x;\n double dy = a.y - b.y;\n return sqrt(dx * dx + dy * dy);\n}\n\nint main(void) {\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n while (cin >> n, n) {\n P.clear();\n V.clear();\n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P.push_back(point(x, y));\n V.push_back(v);\n }\n double r = 0.98;\n point now(0, 0);\n for (double d = 10; d > EPS; d *= r) {\n double maxDist = 0;\n int maxIndex = 0;\n for (int j = 0; j < P.size(); j++) {\n double distance = dist(now, P[j]) / V[j];\n if (distance > maxDist) {\n maxDist = distance;\n maxIndex = j;\n }\n }\n now = now + ((P[maxIndex] - now) / dist(P[maxIndex], now) * d);\n }\n double ans = 0;\n for (int i = 0; i < P.size(); i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n printf(\"%.8f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3260,
"score_of_the_acc": -0.9524,
"final_rank": 16
},
{
"submission_id": "aoj_1093_8821493",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\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 d) { return point(x * d, y * d); }\n point operator/(double d) { return point(x / d, y / d); }\n};\n\ndouble dist(point a, point b) {\n return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));\n}\n\nint main(void) {\n const double EPS = 1e-6;\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n while (cin >> n, n) {\n P.clear();\n V.clear();\n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P.push_back(point(x, y));\n V.push_back(v);\n }\n double r = 0.98;\n point now(0, 0);\n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0;\n int size = P.size();\n for (int j = 0; j < size; j++) {\n double current_dist = dist(now, P[j]) / V[j];\n if (current_dist > mxd)\n mx = j, mxd = current_dist;\n }\n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n double ans = 0;\n int size = P.size();\n for (int i = 0; i < size; i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n printf(\"%.8f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3188,
"score_of_the_acc": -0.8095,
"final_rank": 5
},
{
"submission_id": "aoj_1093_8821492",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\ndouble EPS = 1e-6;\ndouble add(double a, double b) {\n if (abs(a + b) < EPS * (abs(a) + abs(b)))\n return 0;\n return a + b;\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(add(x, p.x), add(y, p.y)); }\n point operator-(point p) { return point(add(x, -p.x), add(y, -p.y)); }\n point operator*(double d) { return point(x * d, y * d); }\n point operator/(double d) { return point(x / d, y / d); }\n};\ndouble dist(point a, point b) {\n return sqrt((a.x - b.x)*(a.x - b.x) + (a.y - b.y)*(a.y - b.y));\n}\nint main(void) {\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n while (cin >> n, n) {\n P.clear();\n V.clear();\n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P.push_back(point(x, y));\n V.push_back(v);\n }\n double r = 0.98;\n point now(0, 0);\n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0;\n for (int j = 0; j < P.size(); j++){\n double currentDist = dist(now, P[j]) / V[j];\n if (currentDist > mxd)\n mx = j, mxd = currentDist;\n }\n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n double ans = 0;\n for (int i = 0; i < P.size(); i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n printf(\"%.8f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3256,
"score_of_the_acc": -0.9444,
"final_rank": 15
},
{
"submission_id": "aoj_1093_8821490",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\nconst double EPS = 1e-6;\ndouble add(double a, double b) {\n if (abs(a + b) < EPS * (abs(a) + abs(b)))\n return 0;\n return a + b;\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(add(x, p.x), add(y, p.y)); }\n point operator-(point p) { return point(add(x, -p.x), add(y, -p.y)); }\n point operator*(double d) { return point(x * d, y * d); }\n point operator/(double d) { return point(x / d, y / d); }\n};\ndouble dist(point a, point b) {\n return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));\n}\nint main(void) {\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n while (cin >> n, n) {\n P.clear();\n V.clear();\n P.reserve(n);\n V.reserve(n);\n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P.push_back(point(x, y));\n V.push_back(v);\n }\n double r = 0.98;\n point now(0, 0);\n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0;\n double tmp;\n int size = P.size();\n for (int j = 0; j < size; j++) {\n tmp = dist(now, P[j]) / V[j];\n if (tmp > mxd)\n mx = j, mxd = tmp;\n }\n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n double ans = 0;\n int size = P.size();\n for (int i = 0; i < size; i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n printf(\"%.8f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3200,
"score_of_the_acc": -0.8333,
"final_rank": 8
},
{
"submission_id": "aoj_1093_8821489",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\nconst double EPS = 1e-6;\ndouble add(double a, double b) {\n if (abs(a + b) < EPS * (abs(a) + abs(b)))\n return 0;\n return a + b;\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 d) { return point(x * d, y * d); }\n point operator/(double d) { return point(x / d, y / d); }\n};\ndouble dist(point a, point b) {\n return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));\n}\nint main(void) {\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n while (cin >> n, n) {\n P.clear();\n V.clear();\n P.reserve(n);\n V.reserve(n);\n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P.push_back(point(x, y));\n V.push_back(v);\n }\n double r = 0.98;\n point now(0, 0);\n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0;\n double tmp_d;\n int P_size = P.size();\n for (int j = 0; j < P_size; j++) {\n tmp_d = dist(now, P[j]) / V[j];\n if (tmp_d > mxd)\n mx = j, mxd = tmp_d;\n }\n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n double ans = 0;\n int P_size = P.size();\n for (int i = 0; i < P_size; i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n printf(\"%.8f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3140,
"score_of_the_acc": -0.7143,
"final_rank": 2
},
{
"submission_id": "aoj_1093_8821488",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nstruct point {\n double x, y;\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 d) { return point(x * d, y * d); }\n point operator/(double d) { return point(x / d, y / d); }\n};\n\ndouble dist(point a, point b) {\n return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));\n}\n\nint main(void) {\n std::ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n while (cin >> n, n) {\n P.clear();\n V.clear();\n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P.push_back(point(x, y));\n V.push_back(v);\n }\n double r = 0.98;\n point now(0, 0);\n for (double d = 10; d > 1e-6; d *= r) {\n int mx = 0;\n double mxd = 0;\n for (int j = 0; j < P.size(); j++) {\n double current_dist = dist(now, P[j]) / V[j];\n if (current_dist > mxd)\n mx = j, mxd = current_dist;\n }\n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n double ans = 0;\n for (int i = 0; i < P.size(); i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n printf(\"%.8f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3284,
"score_of_the_acc": -1,
"final_rank": 18
},
{
"submission_id": "aoj_1093_8809050",
"code_snippet": "#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nconst double EPS = 1e-6;\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 d) { return point(x * d, y * d); }\n point operator/(double d) { return point(x / d, y / d); }\n};\n\ndouble dist(point a, point b) {\n double dx = a.x - b.x;\n double dy = a.y - b.y;\n return sqrt(dx * dx + dy * dy);\n}\n\nint main(void) {\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n \n P.reserve(1000); // Reserve memory for P vector\n V.reserve(1000); // Reserve memory for V vector\n\n while (cin >> n, n) {\n P.clear();\n V.clear();\n \n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P.push_back(point(x, y));\n V.push_back(v);\n }\n \n double r = 0.98;\n point now(0, 0);\n \n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0;\n \n for (int j = 0; j < P.size(); j++) {\n double currentDist = dist(now, P[j]);\n double time = currentDist / V[j];\n \n if (time > mxd) {\n mx = j;\n mxd = time;\n }\n }\n \n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n \n double ans = 0;\n \n for (int i = 0; i < P.size(); i++) {\n double currentDist = dist(now, P[i]);\n double time = currentDist / V[i];\n \n ans = max(ans, time);\n }\n \n printf(\"%.8f\\n\", ans);\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3168,
"score_of_the_acc": -0.7698,
"final_rank": 3
},
{
"submission_id": "aoj_1093_8809046",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\ndouble EPS = 1e-6;\n\ndouble add(double a, double b) {\n double abs_a = abs(a);\n double abs_b = abs(b);\n if (abs(a + b) < EPS * (abs_a + abs_b))\n return 0;\n return a + b;\n}\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(add(x, p.x), add(y, p.y)); }\n point operator-(point p) { return point(add(x, -p.x), add(y, -p.y)); }\n point operator*(double d) { return point(x * d, y * d); }\n point operator/(double d) { return point(x / d, y / d); }\n};\n\ndouble dist(point a, point b) {\n double dx = a.x - b.x;\n double dy = a.y - b.y;\n return sqrt(dx * dx + dy * dy);\n}\n\nint main(void) {\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n \n while (cin >> n, n) {\n P.resize(n);\n V.resize(n);\n \n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P[i] = point(x, y);\n V[i] = v;\n }\n \n double r = 0.98;\n point now(0, 0);\n \n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0;\n \n for (int j = 0; j < n; j++) {\n double cur_dist = dist(now, P[j]) / V[j];\n if (cur_dist > mxd) {\n mx = j;\n mxd = cur_dist;\n }\n }\n \n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n \n double ans = 0;\n \n for (int i = 0; i < n; i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n \n printf(\"%.8f\\n\", ans);\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3176,
"score_of_the_acc": -0.7857,
"final_rank": 4
},
{
"submission_id": "aoj_1093_8809045",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath>\n\nusing namespace std;\n\nconst double EPS = 1e-6;\n\ndouble add(double a, double b) {\n if (abs(a + b) < EPS * (abs(a) + abs(b)))\n return 0;\n return a + b;\n}\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(add(x, p.x), add(y, p.y)); }\n point operator-(point p) { return point(add(x, -p.x), add(y, -p.y)); }\n point operator*(double d) { return point(x * d, y * d); }\n point operator/(double d) { return point(x / d, y / d); }\n};\n\ndouble dist(point a, point b) {\n return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));\n}\n\nint main(void) {\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n \n while (cin >> n, n) {\n P.resize(n);\n V.resize(n);\n \n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P[i] = point(x, y);\n V[i] = v;\n }\n \n double r = 0.98;\n point now(0, 0);\n \n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0;\n \n for (int j = 0; j < P.size(); j++) {\n double currDist = dist(now, P[j]) / V[j];\n \n if (currDist > mxd) {\n mx = j;\n mxd = currDist;\n }\n }\n \n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n \n double ans = 0;\n \n for (int i = 0; i < P.size(); i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n \n cout.precision(8);\n cout << fixed << ans << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3284,
"score_of_the_acc": -1,
"final_rank": 18
},
{
"submission_id": "aoj_1093_8215326",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\ndouble EPS = 1e-6;\ndouble add(double a, double b) {\n if (abs(a + b) < EPS * (abs(a) + abs(b)))\n return 0;\n return a + b;\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(add(x, p.x), add(y, p.y)); }\n point operator-(point p) { return point(add(x, -p.x), add(y, -p.y)); }\n point operator*(double d) { return point(x * d, y * d); }\n point operator/(double d) { return point(x / d, y / d); }\n};\ndouble dist(point a, point b) {\n return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));\n}\nint main(void) {\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n while (cin >> n, n) {\n P.clear();\n V.clear();\n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P.push_back(point(x, y));\n V.push_back(v);\n }\n double r = 0.975;\n point now(0, 0);\n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0;\n for (int j = 0; j < P.size(); j++)\n if (dist(now, P[j]) / V[j] > mxd)\n mx = j, mxd = dist(now, P[j]) / V[j];\n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n double ans = 0;\n for (int i = 0; i < P.size(); i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n printf(\"%.8f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3244,
"score_of_the_acc": -0.9206,
"final_rank": 10
},
{
"submission_id": "aoj_1093_8215325",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\ndouble EPS = 1e-6;\ndouble add(double a, double b) {\n if (abs(a + b) < EPS * (abs(a) + abs(b)))\n return 0;\n return a + b;\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(add(x, p.x), add(y, p.y)); }\n point operator-(point p) { return point(add(x, -p.x), add(y, -p.y)); }\n point operator*(double d) { return point(x * d, y * d); }\n point operator/(double d) { return point(x / d, y / d); }\n};\ndouble dist(point a, point b) {\n return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));\n}\nint main(void) {\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n while (cin >> n, n) {\n P.clear();\n V.clear();\n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P.push_back(point(x, y));\n V.push_back(v);\n }\n double r = 0.98;\n point now(0, 0);\n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0;\n for (int j = 0; j < P.size(); j++)\n if (dist(now, P[j]) / V[j] > mxd)\n mx = j, mxd = dist(now, P[j]) / V[j];\n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n double ans = 0;\n for (int i = 0; i < P.size(); i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n printf(\"%.8f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3248,
"score_of_the_acc": -0.9286,
"final_rank": 12
},
{
"submission_id": "aoj_1093_8115728",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\ndouble EPS = 1e-6;\n\ninline double add(double a, double b) {\n if (fabs(a + b) < EPS * (fabs(a) + fabs(b)))\n return 0;\n return a + b;\n}\n\nstruct point {\n double x, y;\n point() {}\n point(double x, double y) : x(x), y(y) {}\n point operator+(const point& p) const { return point(add(x, p.x), add(y, p.y)); }\n point operator-(const point& p) const { return point(add(x, -p.x), add(y, -p.y)); }\n point operator*(const double d) const { return point(x * d, y * d); }\n point operator/(const double d) const { return point(x / d, y / d); }\n};\n\ninline double dist(const point& a, const point& b) {\n const double dx = a.x - b.x, dy = a.y - b.y;\n return sqrt(dx*dx + dy*dy);\n}\n\nint main(void) {\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n while (scanf(\"%d\", &n), n) {\n P.resize(n);\n V.resize(n);\n for (int i = 0; i < n; i++) {\n scanf(\"%d %d %d\", &x, &y, &v);\n P[i] = point(x, y);\n V[i] = v;\n }\n double r = 0.98;\n point now(0, 0);\n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0;\n for (int j = 0; j < n; j++) {\n const double cur_dist = dist(now, P[j]);\n const double cur_time = cur_dist / V[j];\n if (cur_time > mxd) {\n mx = j;\n mxd = cur_time;\n }\n }\n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n double ans = 0;\n for (int i = 0; i < n; i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n printf(\"%.8f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3272,
"score_of_the_acc": -0.9762,
"final_rank": 17
},
{
"submission_id": "aoj_1093_8115726",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\nconst double EPS = 1e-6;\ninline double add(double a, double b) {\n return (abs(a + b) < EPS * (abs(a) + abs(b))) ? 0 : a + b;\n}\nstruct point {\n double x, y;\n point() {}\n point(double x, double y) : x(x), y(y) {}\n inline point operator+(const point &p) const { return point(add(x, p.x), add(y, p.y)); }\n inline point operator-(const point &p) const { return point(add(x, -p.x), add(y, -p.y)); }\n inline point operator*(double d) const { return point(x * d, y * d); }\n inline point operator/(double d) const { return point(x / d, y / d); }\n inline double dist(const point &p) const { return hypot(x - p.x, y - p.y); }\n};\nint main(void) {\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n while (cin >> n, n) {\n P.resize(n);\n V.resize(n);\n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P[i] = point(x, y);\n V[i] = v;\n }\n double r = 0.98;\n point now(0, 0);\n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0;\n for (int j = 0; j < n; j++)\n if (now.dist(P[j]) / V[j] > mxd)\n mx = j, mxd = now.dist(P[j]) / V[j];\n now = now + ((P[mx] - now) / now.dist(P[mx]) * d);\n }\n double ans = 0;\n for (int i = 0; i < n; i++) {\n ans = max(ans, now.dist(P[i]) / V[i]);\n }\n printf(\"%.8f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3252,
"score_of_the_acc": -0.9365,
"final_rank": 14
},
{
"submission_id": "aoj_1093_8115725",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nconst double EPS = 1e-6;\n\ninline double add(double a, double b) {\n if (abs(a + b) < EPS * (abs(a) + abs(b)))\n return 0;\n return a + b;\n}\n\nstruct point {\n double x, y;\n point() {}\n point(double x, double y) : x(x), y(y) {}\n point operator+(const point& p) const { return point(add(x, p.x), add(y, p.y)); }\n point operator-(const point& p) const { return point(add(x, -p.x), add(y, -p.y)); }\n point operator*(const double& d) const { return point(x * d, y * d); }\n point operator/(const double& d) const { return point(x / d, y / d); }\n};\n\ninline double dist(const point& a, const point& b) {\n double dx = a.x - b.x, dy = a.y - b.y;\n return sqrt(dx*dx + dy*dy);\n}\n\nint main(void) {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n while (cin >> n, n) {\n P.resize(n);\n V.resize(n);\n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P[i] = point(x, y);\n V[i] = v;\n }\n double r = 0.98;\n point now(0, 0);\n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0;\n for (int j = 0; j < n; j++) {\n double tmp = dist(now, P[j]) / V[j];\n if (tmp > mxd)\n mx = j, mxd = tmp;\n }\n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n double ans = 0;\n for (int i = 0; i < n; i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n printf(\"%.8f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3248,
"score_of_the_acc": -0.9286,
"final_rank": 12
},
{
"submission_id": "aoj_1093_8115721",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nconst double EPS = 1e-6;\n\ninline double add(double a, double b) {\n return abs(a + b) < EPS * (abs(a) + abs(b)) ? 0 : a + b;\n}\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(add(x, p.x), add(y, p.y)); }\n point operator-(point p) { return point(add(x, -p.x), add(y, -p.y)); }\n point operator*(double d) { return point(x * d, y * d); }\n point operator/(double d) { return point(x / d, y / d); }\n};\n\ninline double dist(point a, point b) {\n double dx = a.x - b.x;\n double dy = a.y - b.y;\n return sqrt(dx*dx + dy*dy);\n}\n\nint main(void) {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n\n int n, x, y, v;\n while (cin >> n, n) {\n vector<point> P(n);\n vector<double> V(n);\n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P[i] = point(x, y);\n V[i] = v;\n }\n double r = 0.98;\n point now(0, 0);\n double d = 10;\n while (d > EPS) {\n int mx = 0;\n double mxd = 0;\n for (int j = 0; j < n; j++) {\n double tmp = dist(now, P[j]) / V[j];\n if (tmp > mxd) {\n mx = j;\n mxd = tmp;\n }\n }\n point dir = P[mx] - now;\n double norm = dist(P[mx], now);\n dir = dir / norm;\n dir = dir * d;\n now = now + dir;\n d *= r;\n }\n double ans = 0;\n for (int i = 0; i < n; i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n printf(\"%.8f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3188,
"score_of_the_acc": -0.8095,
"final_rank": 5
},
{
"submission_id": "aoj_1093_8115719",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\ndouble EPS = 1e-6;\ndouble add(double a, double b) {\n if (abs(a + b) < EPS * (abs(a) + abs(b)))\n return 0;\n return a + b;\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(add(x, p.x), add(y, p.y)); }\n point operator-(point p) { return point(add(x, -p.x), add(y, -p.y)); }\n point operator*(double d) { return point(x * d, y * d); }\n point operator/(double d) { return point(x / d, y / d); }\n};\ndouble dist(point a, point b) {\n return sqrt(pow(a.x - b.x, 2) + pow(a.y - b.y, 2));\n}\nint main(void) {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int n, x, y, v;\n vector<point> P;\n vector<double> V;\n while (cin >> n, n) {\n P.resize(n);\n V.resize(n);\n for (int i = 0; i < n; i++) {\n cin >> x >> y >> v;\n P[i] = point(x, y);\n V[i] = v;\n }\n double r = 0.98;\n point now(0, 0);\n for (double d = 10; d > EPS; d *= r) {\n int mx = 0;\n double mxd = 0;\n for (int j = 0; j < n; j++)\n if (dist(now, P[j]) / V[j] > mxd)\n mx = j, mxd = dist(now, P[j]) / V[j];\n now = now + ((P[mx] - now) / dist(P[mx], now) * d);\n }\n double ans = 0;\n for (int i = 0; i < n; i++) {\n ans = max(ans, dist(now, P[i]) / V[i]);\n }\n printf(\"%.8f\\n\", ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3244,
"score_of_the_acc": -0.9206,
"final_rank": 10
}
] |
aoj_1110_cpp
|
Patience
As the proverb says,
"Patience is bitter, but its fruit is sweet."
Writing programs within the limited time may impose
some patience on you, but you enjoy it and win the contest, we hope.
The word "patience" has the meaning of perseverance,
but it has another meaning in card games.
Card games for one player are called "patience" in the UK
and "solitaire" in the US.
Let's play a patience in this problem.
In this card game, you use only twenty cards whose
face values are positive and less than or equal to 5 (Ace's value
is 1 as usual).
Just four cards are available for each face value.
At the beginning, the twenty cards are laid
in five rows by four columns (See Figure 1).
All the cards are dealt face up.
An example of the initial layout is shown in Figure 2.
Figure 1: Initial layout
Figure 2: Example of the initial layout
The purpose of the game is to remove as many cards as possible
by repeatedly removing a pair of neighboring cards
of the same face value.
Let us call such a pair a
matching pair
.
The phrase "a pair of neighboring cards" means a pair of cards which are
adjacent to each other.
For example, in Figure 1,
C
6
is adjacent to any of
the following eight cards:
C
1
,
C
2
,
C
3
,
C
5
,
C
7
,
C
9
,
C
10
and
C
11
.
In contrast,
C
3
is adjacent to only the following three cards:
C
2
,
C
6
and
C
7
.
Every time you remove a pair, you must rearrange the remaining cards
as compact as possible.
To put it concretely, each remaining card
C
i
must be examined in turn
in its subscript order to be shifted to the uppermost-leftmost
space.
How to play:
Search a matching pair.
When you find more than one pair, choose one.
In Figure 3, you decided to remove the pair of
C
6
and
C
9
.
Remove the pair. (See Figure 4)
Shift the remaining cards to the uppermost-leftmost space
(See Figure 5, 6).
Repeat the above procedure until you cannot remove any pair.
Figure 3: A matching pair found
Figure 4: Remove the matching pair
Figure 5: Shift the remaining cards
Figure 6: Rearranged layout
If you can remove all the twenty cards, you win the game
and your penalty is 0.
If you leave some cards,
you lose the game and
your penalty is the number of the remaining cards.
Whenever you find multiple matching pairs,
you must choose one pair out of them
as in the step 2 of the above procedure.
The result of the game depends on these choices.
Your job is to write a program which answers the minimal penalty
for each initial layout.
Input
The input consists of multiple card layouts.
The input is given in the following format.
N
Layout
0
Layout
1
...
Layout
N
-1
N
is the number of card layouts.
Each card layout gives the initial state of a game.
A card layout is given in the following format.
C
0
C
1
C
2
C
3
C
4
C
5
C
6
C
7
C
8
C
9
C
10
C
11
C
12
C
13
C
14
C
15
C
16
C
17
C
18
C
19
C
i
(0 <=
i
<= 19) is an integer
from 1 to 5 which represents the face value of the card.
Output
For every initial card layout, the minimal penalty should be output,
each in a separate l
...(truncated)
|
[
{
"submission_id": "aoj_1110_10851304",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i,a,b) for(int i=a;i<=b;++i)\n#define rrep(i,a,b) for(int i=a;i>=b;--i)\n#define GRPS int T;scanf(\"%d\",&T);rep(C,1,T)\n#define GRP int T;cin>>T;rep(C,1,T)\n#define ETR putchar('\\n')\n#define IN1(a) scanf(\"%d\",&a)\n#define IN2(a,b) scanf(\"%d %d\",&a,&b)\n#define IN3(a,b,c) scanf(\"%d %d %d\",&a,&b,&c)\n#define elif else if\n#define mem(arr,val) memset(arr,val,sizeof(arr))\n#define FAST ios::sync_with_stdio(false);cin.tie(0);\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\n\nvector<int> c;\nint res, tmp;\nint dis[] = {1, 3, 4, 5};\n\nvoid dfs(vector<int> &a) {\n\tint sz = a.size();\n\tif (sz == 0) {\n\t\tres = 0;\n\t\treturn;\n\t}\n\tbool fnd = false;\n\trep(i, 0, sz - 1) {\n\t\tfor (int d : dis) {\n\t\t\tif (i + d >= 0 && i + d < sz && a[i] == a[i + d]) {\n\t\t\t\tif (i % 4 == 3 && (d == 1 || d == 5)) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (i % 4 == 0 && d == 3) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tvector<int> t(a);\n\t\t\t\tt.erase(t.begin() + i);\n\t\t\t\tt.erase(t.begin() + i + d - 1);\n\t\t\t\tfnd = true;\n\t\t\t\t/*\n\t\t\t\tint cnt = 0;\n\t\t\t\tfor (int aa : t) {\n\t\t\t\t\tcout << aa << ' ';\n\t\t\t\t\tcnt++;\n\t\t\t\t\tif (cnt == 4) {\n\t\t\t\t\t\tcout << endl;\n\t\t\t\t\t\tcnt = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcout << endl << endl;;\n\t\t\t\t*/\n\t\t\t\tdfs(t);\n\t\t\t}\n\t\t}\n\t}\n\tif (!fnd) {\n\t\tres = min(res, sz);\n\t}\n}\n\nint main() {\n\n\t//freopen(\"patient.out\", \"w\", stdout);\n\n\tFAST;\n\tGRP{\n\t\tc.clear();\n\t\trep(i, 0, 19) {\n\t\t\tcin >> tmp;\n\t\t\tc.push_back(tmp);\n\t\t}\n\t\t/*\n\t\tint cnt = 0;\n\t\tfor (int m : c) {\n\t\t\tcout << m << ' ';\n\t\t\tcnt++;\n\t\t\tif (cnt == 4) {\n\t\t\t\tcout << endl;\n\t\t\t\tcnt = 0;\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\t\t*/\n\t\tres = 22;\n\t\tdfs(c);\n\t\tcout << res << endl;\n\t}\n\n\treturn 0;\n}\n\n/**\n* ┏┓ ┏┓+ +\n* ┏┛┻━━━┛┻┓ + +\n* ┃ ┃\n* ┃ ━ ┃ ++ + + +\n* ████━████+\n* ◥██◤ ◥██◤ +\n* ┃ ┻ ┃\n* ┃ ┃ + +\n* ┗━┓ ┏━┛\n* ┃ ┃ + + + +\n* ┃ ┃ + + + + + +\n* ┃ ┗━━━┓ \n* ┃ ┣┓\n* ┃ ┏┛\n* ┗┓┓┏━┳┓┏┛ + + + +\n* ┃┫┫ ┃┫┫\n* ┗┻┛ ┗┻┛+ + + +\n*/",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3144,
"score_of_the_acc": -0.348,
"final_rank": 8
},
{
"submission_id": "aoj_1110_10283257",
"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////////////////////////////////////////////\nll f(vector<vector<ll>> c)\n{\n ll ret = 0;\n rep(i, 0, 5)\n {\n rep(j, 0, 4)\n {\n if (c[i][j] != -1)\n {\n ret++;\n }\n }\n }\n vector<ll> dx = {0, 1, 1, 1};\n vector<ll> dy = {1, -1, 0, 1};\n rep(i, 0, 5)\n {\n rep(j, 0, 4)\n {\n if (c[i][j] == -1)\n {\n continue;\n }\n rep(k, 0, 4)\n {\n ll nx = i + dx[k];\n ll ny = j + dy[k];\n if (isin(nx, 0, 5) && isin(ny, 0, 4))\n {\n if (c[i][j] == c[nx][ny])\n {\n vector<ll> ar;\n rep(a, 0, 5)\n {\n rep(b, 0, 4)\n {\n if (a == i && b == j)\n {\n continue;\n }\n if (a == nx && b == ny)\n {\n continue;\n }\n if (c[a][b] == -1)\n {\n continue;\n }\n ar.push_back(c[a][b]);\n }\n }\n vector<vector<ll>> nxt(5, vector<ll>(4, -1));\n rep(a, 0, ar.size())\n {\n nxt[a / 4][a % 4] = ar[a];\n }\n chmin(ret, f(nxt));\n }\n }\n }\n }\n }\n return ret;\n}\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n ll n;\n cin >> n;\n while (n--)\n {\n vector<vector<ll>> c(5, vector<ll>(4));\n rep(i, 0, 5)\n {\n rep(j, 0, 4)\n {\n cin >> c[i][j];\n }\n }\n cout << f(c) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 130,
"memory_kb": 3456,
"score_of_the_acc": -1.3992,
"final_rank": 20
},
{
"submission_id": "aoj_1110_10126837",
"code_snippet": "#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\n*/\n\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nconst int INF = 2147483647;\n\nconst int M = 5;\nconst int N = 4;\nconst int K = 20;\ntypedef vector<int> State;\ntypedef vector<State> States;\n\n/*\ntypedef pair<int,int> PA;\nconst int A = 8;\nstatic vector<PA> actions = {{0,-1}, {0,1}, {-1,0}, {1,0}, {-1,1}, {-1,-1}, {1,-1}, {1,1}};\n*/\n//------------------------------------------------------------------------------\nvoid debug_state(const State& s1)\n{\n int N1 = s1.size();\n bool finished = false;\n for (int m=0; m<M; ++m)\n {\n if (finished) break;\n for (int n=0; n<N; ++n)\n {\n int v = m*N + n;\n if (v >= N1) { finished = true; break; }\n printf(\"%d \",s1[v]);\n }\n printf(\"\\n\");\n }\n printf(\"\\n\");\n}\n\nState shift(const State& s1, int v1, int v2)\n{\n int N1 = s1.size();\n State s2(N1-2);\n int index = 0;\n for (int v=0; v<N1; ++v)\n if (v != v1 && v != v2)\n s2[index++] = s1[v];\n return s2;\n}\n\nStates successors(const State& s1)\n{\n States states;\n int N1 = s1.size();\n for (int v1=0; v1<N1-1; ++v1)\n for (int v2=v1+1; v2<N1; ++v2)\n if (s1[v1] == s1[v2] && abs(v1/N-v2/N) <= 1 && abs(v1%N-v2%N) <= 1)\n states.push_back( shift(s1, v1, v2) );\n\n return states;\n}\n//------------------------------------------------------------------------------\nint bfs(const State& src)\n{\n if (DEBUG)\n {\n for (State w: successors(src)) debug_state(w);\n }\n queue<State> Q;\n Q.push(src);\n int res = 20;\n //--------------------------------------------------------------------------\n // search:\n while (!Q.empty())\n {\n State v = Q.front(); Q.pop();\n if (v.empty()) return 0;\n res = min(res, int(v.size()));\n\n for (State w: successors(v)) Q.push(w);\n }\n return res;\n}\n\n//------------------------------------------------------------------------------\nint main()\n{\n //test(); return 0;\n //DEBUG = true;\n //--------------------------------------------------------------------------\n int T, v, num;\n num = scanf(\"%d \", &T);\n while (T--)\n {\n State src(K);\n for (int k=0; k<K; ++k)\n {\n num = scanf(\"%d \", &v);\n src[k] = v;\n }\n if (DEBUG) debug_state(src);\n int res = bfs(src);\n printf(\"%d\\n\", res);\n }\n //--------------------------------------------------------------------------\n return 0;\n}\n//------------------------------------------------------------------------------",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 5468,
"score_of_the_acc": -0.9795,
"final_rank": 18
},
{
"submission_id": "aoj_1110_9581490",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint was[1 << 20], c[20];\n\nint rec(int mask) {\n if (was[mask] != -1) return was[mask];\n if (mask == 0) return was[mask] = 0;\n vector<int> now;\n for (int i = 0; i < 20; ++i) {\n if (mask >> i & 1) now.push_back(i);\n }\n int& ret = was[mask];\n ret = now.size();\n for (int i = 0; i < 5; ++i) {\n for (int j = 0; j < 4; ++j) {\n for (int dx = -1; dx <= 1; ++dx) {\n for (int dy = -1; dy <= 1; ++dy) {\n int x = i + dx, y = j + dy;\n if (x < 0 || y < 0 || y >= 4 || x >= 5) continue;\n int u = i * 4 + j, v = x * 4 + y;\n if (u == v) continue;\n if (u < now.size() && v < now.size() && c[now[u]] == c[now[v]]) {\n ret = min(ret, rec(mask ^ (1 << now[u]) ^ (1 << now[v])));\n }\n }\n }\n }\n }\n return ret;\n}\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n\n int tests;\n cin >> tests;\n while (tests--) {\n for (int i = 0; i < 20; ++i) cin >> c[i];\n fill(was, was + (1 << 20), -1);\n cout << rec((1 << 20) - 1) << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 7116,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_1110_5692312",
"code_snippet": "#include<stdio.h>\n#include<iostream>\n#include<string.h>\n\nint table[20];\n\nint dx[4] = { 1,-1,0,1 };\nint dy[4] = { 0,1,1,1, };\n\nint checkRange(int row, int col)\n{\n\tif (row >= 0 && row < 5 && col >= 0 && col < 4)\n\t\treturn 1;\n\treturn 0;\n}\n\nvoid move(int* table, int n)\n{\n\tint* p = table;\n\tint* q = 0;\n\twhile (p < table + n)\n\t{\n\t\tif (*p == 0)\n\t\t{\n\t\t\tif (q == 0)\n\t\t\t\tq = p;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (q != 0)\n\t\t\t{\n\t\t\t\t*q = *p;\n\t\t\t\t*p = 0;\n\t\t\t\tq++;\n\t\t\t}\n\t\t}\n\t\tp++;\n\t}\n}\n\n\n\nint slove(int* t)\n{\n\tint tmp[20];\n\tint x, y, col, row;\n\tint ret;\n\tint min_val = 20;\n\tfor (int i = 0; i < 20; i++)\n\t{\n\t\tif (t[i] == 0)\n\t\t\tbreak;\n\n\t\tcol = i % 4;\n\t\trow = i / 4;\n\n\t\tfor (int k = 0; k < 4; k++)\n\t\t{\n\t\t\tx = col + dx[k];\n\t\t\ty = row + dy[k];\n\t\t\tif (checkRange(y, x) && t[i] == t[y * 4 + x])\n\t\t\t{\n\t\t\t\tmemcpy(tmp, t, sizeof(tmp));\n\t\t\t\ttmp[i] = tmp[y * 4 + x] = 0;\n\t\t\t\tmove(tmp, 20);\n\t\t\t\tret = slove(tmp);\n\t\t\t\tif (min_val > ret)\n\t\t\t\t\tmin_val = ret;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (min_val == 20)\n\t{\n\t\tmin_val = 0;\n\t\tfor (int i = 0; i < 20; i++)\n\t\t{\n\t\t\tif (t[i] != 0)\n\t\t\t\tmin_val++;\n\t\t\telse\n\t\t\t\tbreak;\n\t\t}\n\t}\n\treturn min_val;\n}\n\nint main()\n{\n\tint n;\n\tstd::cin >> n;\n\tint ret;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tfor (int row = 0; row < 5; row++)\n\t\t{\n\t\t\tfor (int col = 0; col < 4; col++)\n\t\t\t{\n\t\t\t\tstd::cin >> table[row * 4 + col];\n\t\t\t}\n\t\t}\n\t\tret = slove(table);\n\t\tstd::cout << ret << std::endl;\n\t}\n\n\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2996,
"score_of_the_acc": -0.3237,
"final_rank": 7
},
{
"submission_id": "aoj_1110_4776668",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <utility>\nusing namespace std;\nint diff[] = {1, 3, 4, 5};\n\nint solve(vector<int> a){\n int res = 0;\n for(int i=0; i<(int)a.size(); i++){\n for(int d=0; d<4; d++){\n if(i%4==0 and diff[d]==3) continue;\n if(i%4==3 and (diff[d]==1 or diff[d]==5)) continue;\n if(i+diff[d] < (int)a.size() and a[i] == a[i+diff[d]]){\n auto b = a;\n b.erase(b.begin() +i+diff[d]);\n b.erase(b.begin() +i);\n res = max(res, solve(b) +2);\n }\n } \n }\n return res;\n}\n\nint main(){\n int nt;\n cin >> nt;\n for(int rep=0; rep<nt; rep++){\n vector<int> a(20);\n for(int i=0; i<20; i++){\n cin >> a[i];\n }\n cout << 20 -solve(a) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3080,
"score_of_the_acc": -0.5042,
"final_rank": 14
},
{
"submission_id": "aoj_1110_2581963",
"code_snippet": "#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\ntypedef pair<string,int>P;\nint dy[]={-1,-1,-1,0,0,1,1,1};\nint dx[]={-1,0,1,-1,1,-1,0,1};\nint n,pp;\nint h=5,w=4;\nstring a;\nmap<string,int>used;\nint bfs(){\n int ans=20;\n queue<P>q;\n used[a]=1;\n q.push(P(a,1));\n while(!q.empty()){\n P p=q.front();q.pop();\n string now=p.first;\n int cost=p.second;\n int b[5][4],t=0;\n r(i,5)r(j,4)b[i][j]=(int)now[t++];\n r(i,5)r(j,4){\n r(k,8){\n\tint y=i+dy[k];\n\tint x=j+dx[k];\n\tif(y<0||x<0||x>=w||y>=h)continue;\n\tif(b[i][j]==b[y][x]&&b[i][j]){\n\t int c[5][4];\n\t r(i1,5)r(j1,4)c[i1][j1]=b[i1][j1];\n\t c[i][j]=c[y][x]=0;\n\t string next;\n\t r(i1,5)r(j1,4)if(c[i1][j1])next+=(char)c[i1][j1];\n\t ans=min(ans,(int)next.size());\n\t while(next.size()<20)next+=(char)0;\n\t if(used[next])continue;\n\t used[next]=1;\n\t q.push(P(next,1));\n\t}\n }\n }\n }\n return ans;\n}\nint main(){\n cin>>n;\n while(n--){\n a=\"\";\n used.clear();\n r(i,5)r(j,4){\n cin>>pp;\n a+=pp;\n }\n cout<<bfs()<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3256,
"score_of_the_acc": -0.3664,
"final_rank": 9
},
{
"submission_id": "aoj_1110_2163746",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\nint dx[8]={-1,-1,-1,0,0,1,1,1},dy[8]={-1,0,1,-1,1,-1,0,1};\nbool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}\n \nbool dp[1<<20];\nint main() {\n int T,n=5,m=4;\n cin >> T;\n while(T--) {\n int d[20];\n for(int i=0; i<20; i++) cin >> d[i];\n memset(dp,0,sizeof(dp));\n dp[(1<<20)-1]=1;\n int ans=1<<29;\n for(int t=(1<<20)-1; t>=0; t--) {\n if(dp[t]) ans=min(ans,__builtin_popcount(t));\n else continue;\n P a[n][m];\n memset(a,-1,sizeof(a));\n for(int i=0,k=0; i<20; i++) {\n if(t&(1<<i)) {\n a[k/m][k%m]=P(d[i],i);\n k++;\n }\n }\n for(int i=0; i<n; i++) {\n for(int j=0; j<m; j++) {\n if(a[i][j].first==-1) break;\n for(int k=0; k<8; k++) {\n int x=i+dx[k],y=j+dy[k];\n if(!check(n,m,x,y)) continue;\n if(a[i][j].first==a[x][y].first) {\n dp[t^(1<<a[i][j].second)^(1<<a[x][y].second)]|=dp[t];\n }\n }\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4064,
"score_of_the_acc": -0.499,
"final_rank": 13
},
{
"submission_id": "aoj_1110_2163345",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\nint dx[8]={-1,-1,-1,0,0,1,1,1},dy[8]={-1,0,1,-1,1,-1,0,1};\nbool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}\n\nbool dp[1<<20];\nint main() {\n int T,n=5,m=4;\n cin >> T;\n while(T--) {\n int d[20];\n for(int i=0; i<20; i++) cin >> d[i];\n memset(dp,0,sizeof(dp));\n dp[(1<<20)-1]=1;\n int ans=1<<29;\n for(int t=(1<<20)-1; t>=0; t--) {\n if(dp[t]) ans=min(ans,__builtin_popcount(t));\n else continue;\n P a[n][m];\n memset(a,-1,sizeof(a));\n for(int i=0,k=0; i<20; i++) {\n\tif(t&(1<<i)) {\n\t a[k/m][k%m]=P(d[i],i);\n\t k++;\n\t}\n }\n for(int i=0; i<n; i++) {\n\tfor(int j=0; j<m; j++) {\n\t if(a[i][j].first==-1) break;\n\t for(int k=0; k<8; k++) {\n\t int x=i+dx[k],y=j+dy[k];\n\t if(!check(n,m,x,y)) continue;\n\t if(a[i][j].first==a[x][y].first) {\n\t dp[t^(1<<a[i][j].second)^(1<<a[x][y].second)]|=dp[t];\n\t }\n\t }\n\t}\n }\n }\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3964,
"score_of_the_acc": -0.4826,
"final_rank": 11
},
{
"submission_id": "aoj_1110_2114442",
"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<stack>\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 vector<string> vs;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-5;\nconst int inf=1e8;\nint out;\nint dx[]={0,1,1,1};\nint dy[]={1,-1,0,1};\nvoid dfs(vi &in){\n\trep(i,in.size()){\n\t\tint x=i/4,y=i%4;\n\t\trep(j,4){\n\t\t\tint nx=x+dx[j],ny=y+dy[j];\n\t\t\tif(nx<0||ny<0||nx>=5||ny>=4)continue;\n//\t\t\tcout<<x<<\" \"<<y<<\" \"<<nx<<\" \"<<ny<<endl;\n\t\t\tint t=nx*4+ny;\n\t\t\tif(t>=in.size())continue;\n\t\t\tif(in[i]==in[t]){\n\t\t\t\tvi tm=in;\n\t\t\t\ttm.erase(tm.begin()+t);\n\t\t\t\ttm.erase(tm.begin()+i);\n\t\t\t\tout=min(out,(int)tm.size());\n\t\t\t\tdfs(tm);\n\t\t\t}\n\t\t}\n\t}\n}\nint main(){\n\tint q;\n\tcin>>q;\n\twhile(q--){\n\t\tvi in(20);\n\t\trep(i,20)cin>>in[i];\n\t\tout=20;\n\t\tdfs(in);\n\t\tcout<<out<<endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2924,
"score_of_the_acc": -0.3952,
"final_rank": 10
},
{
"submission_id": "aoj_1110_1965408",
"code_snippet": "#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nint n, a[20], dp[1 << 20]; bool vis[1 << 20];\nint rec(int used) {\n\tif (vis[used]) return dp[used];\n\tint r = 0;\n\tint b[20] = { 0 }, c[20] = { 0 };\n\tfor (int i = 0; i < 20; i++) {\n\t\tif (used & (1 << i)) {\n\t\t\tb[r] = a[i], c[r++] = i;\n\t\t}\n\t}\n\tint ret = r;\n\tfor (int i = 0; i < r; i++) {\n\t\tint ty = i >> 2, tx = i & 3;\n\t\tfor (int j = -1; j <= 1; j++) {\n\t\t\tfor (int k = -1; k <= 1; k++) {\n\t\t\t\tif (!j && !k) continue;\n\t\t\t\tint ry = ty + j, rx = tx + k, t = 4 * ry + rx;\n\t\t\t\tif (0 <= ry && ry < 5 && 0 <= rx && rx < 4 && t < r) {\n\t\t\t\t\tif (a[c[i]] == a[c[t]]) {\n\t\t\t\t\t\tint used2 = used - (1 << c[i]) - (1 << c[t]);\n\t\t\t\t\t\tret = min(ret, rec(used2));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tvis[used] = true;\n\treturn dp[used] = ret;\n}\nint main() {\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tfill(vis, vis + (1 << 20), false);\n\t\tfor (int j = 0; j < 20; j++) cin >> a[j];\n\t\tcout << rec((1 << 20) - 1) << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 6824,
"score_of_the_acc": -0.9521,
"final_rank": 17
},
{
"submission_id": "aoj_1110_1823929",
"code_snippet": "#include<iostream>\n#include<iomanip>\n#include<string>\n#include<cstdlib>\n#include<cmath>\n#include<algorithm>\n#include<vector>\n\nusing namespace std;\n\nint minimum;\nvector<string> check;\n\nvoid calc(int num, string cards) {\n\n\tstring card;\n\n\tif(num+1 < cards.length() && num%4 < 3 && cards[num] == cards[num+1]) {\n\t\tcard = cards;\n\t\tcard.erase(card.begin()+num+1);\n\t\tcard.erase(card.begin()+num);\n\t\tif(find(check.begin(), check.end(), card) == check.end()) {\n\t\t\tcheck.push_back(card);\n\t\t\tcalc(0, card);\n\t\t}\n\t}\n\tif(num+4 < cards.length() && cards[num] == cards[num+4]) {\n\t\tcard = cards;\n\t\tcard.erase(card.begin()+num+4);\n\t\tcard.erase(card.begin()+num);\n\t\tif(find(check.begin(), check.end(), card) == check.end()) {\n\t\t\tcheck.push_back(card);\n\t\t\tcalc(0, card);\n\t\t}\n\t}\n\tif(num+3 < cards.length() && num%4 > 0 && cards[num] == cards[num+3]) {\n\t\tcard = cards;\n\t\tcard.erase(card.begin()+num+3);\n\t\tcard.erase(card.begin()+num);\n\t\tif(find(check.begin(), check.end(), card) == check.end()) {\n\t\t\tcheck.push_back(card);\n\t\t\tcalc(0, card);\n\t\t}\n\t}\n\tif(num+5 < cards.length() && num%4 < 3 && cards[num] == cards[num+5]) {\n\t\tcard = cards;\n\t\tcard.erase(card.begin()+num+5);\n\t\tcard.erase(card.begin()+num);\n\t\tif(find(check.begin(), check.end(), card) == check.end()) {\n\t\t\tcheck.push_back(card);\n\t\t\tcalc(0, card);\n\t\t}\n\t}\n\n\tif(num+1 < cards.length()) calc(num+1, cards);\n\telse if(cards.length() < minimum) minimum = cards.length();\n}\n\nint main() {\n\tint N;\n\tcin >> N;\n\tstring cards;\n\tchar input;\n\n\tfor(int i=0; i<N; i++) {\n\t\tcheck.clear();\n\t\tminimum=20;\n\t\tcards = \"\";\n\n\t\tfor(int j=0; j<20; j++) {\n\t\t\tcin >> input;\n\t\t\tcards.push_back(input);\n\t\t}\n\n\t\tfor(int j=0; j<20; j++) {\n\t\t\tcalc(j, cards);\n\t\t}\n\t\tcout << minimum << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1292,
"score_of_the_acc": -0.044,
"final_rank": 2
},
{
"submission_id": "aoj_1110_1784613",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint n;\nint c[5][4];\nint dp[1 << 20];\n\nint dfs(int cnum, int rem) {\n\tint val[5][4];\n\tint id[5][4];\n\t\n\tif (dp[rem] != -1) return dp[rem];\n\t\n\tint cor = 0;\n\tfor (int i = 0; i < 20; i++) {\n\t\tif ((rem >> i) % 2) {\n\t\t\tval[cor/4][cor%4] = c[i/4][i%4];\n\t\t\tid[cor/4][cor%4] = i;\n\t\t\tcor++;\n\t\t}\n\t}\n\t\n\tint ret = 0;\n\tfor (int y = 0; y < 5; y++) {\n\t\tfor (int x = 0; x < 4; x++) {\n\t\t\tif (y * 4 + x >= cnum) continue;\n\t\t\tfor (int sy = y - 1; sy <= y + 1; sy++) {\n\t\t\t\tfor (int sx = x - 1; sx <= x + 1; sx++) {\n\t\t\t\t\tif (sy * 4 + sx >= cnum) continue;\n\t\t\t\t\tif (!(0 <= sy && sy < 5 && 0 <= sx && sx < 4)) continue;\n\t\t\t\t\tif (sy == y && sx == x) continue;\n\t\t\t\t\tif (val[y][x] != val[sy][sx]) continue;\n\t\t\t\t\tret = max( ret, 2 + dfs(cnum - 2, rem - (1 << id[y][x]) - (1 << id[sy][sx])) );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn (dp[rem] = ret);\n}\n\nint main() {\n\tcin >> n;\n\twhile (n--) {\n\t\tfor (int i = 0; i < 20; i++) cin >> c[i/4][i%4];\n\t\tfor (int i = 0; i < (1 << 20); i++) dp[i] = -1;\n\t\tcout << 20 - dfs(20, (1 << 20) - 1) << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5256,
"score_of_the_acc": -0.6947,
"final_rank": 16
},
{
"submission_id": "aoj_1110_1484423",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <algorithm>\nint test;\nint c[11][4][5];\nint res=20;\n\nvoid push(int v){\n\tint vv=0;\n\t/*\n\tfor(int i=0;i<5;i++){\n\t\tfor(int j=0;j<4;j++){\n\t\t\tprintf(\"%d%c\",c[v][j][i],j==3?'\\n':' ');\n\t\t}\n\t}\n\tprintf(\"\\n\");\n\t*/\n\tfor(int i=0;i<20;i++){\n\t\tif(c[v][i%4][i/4]!=0){\n\t\t\tc[v][vv%4][vv/4]=c[v][i%4][i/4];\n\t\t\tif(vv!=i){\n\t\t\t\tc[v][i%4][i/4]=0;\n\t\t\t}\n\t\t\tvv++;\n\t\t}\n\t}\n\t/*\n\tfor(int i=0;i<5;i++){\n\t\tfor(int j=0;j<4;j++){\n\t\t\tprintf(\"%d%c\",c[v][j][i],j==3?'\\n':' ');\n\t\t}\n\t}\n\t*/\n}\n\nvoid dfs(int t){\n\tres=std::min(res,20-t*2);\n\tif(res==0)return;\n\tfor(int i=0;i<5;i++){\n\t\tfor(int j=0;j<4;j++){\n\t\t\tif(c[t][j][i]==0)continue;\n\t\t\tfor(int k=-1;k<=1;k++){\n\t\t\t\tfor(int l=-1;l<=1;l++){\n\t\t\t\t\tif(k==0 && l==0)continue;\n\t\t\t\t\tint py=i+k,px=j+l;\n\t\t\t\t\tif(px>=0 && px<4 && py>=0 && py<5){\n\t\t\t\t\t\tif(c[t][j][i]==c[t][px][py]){\n\t\t\t\t\t\t\tmemset(c[t+1],0,sizeof(c[t+1]));\n\t\t\t\t\t\t\tfor(int m=0;m<5;m++){\n\t\t\t\t\t\t\t\tfor(int n=0;n<4;n++){\n\t\t\t\t\t\t\t\t\tif((j==n && i==m) || (px==n && py==m))continue;\n\t\t\t\t\t\t\t\t\tc[t+1][n][m]=c[t][n][m];\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tpush(t+1);\n\t\t\t\t\t\t\tdfs(t+1);\n\t\t\t\t\t\t\t//printf(\"%d %d\\n\",j+i*4,px+py*4);\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(void){\n\tscanf(\"%d\",&test);\n\tfor(int ddd=0;ddd<test;ddd++){\n\t\tfor(int i=0;i<5;i++){\n\t\t\tfor(int j=0;j<4;j++){\n\t\t\t\tscanf(\"%d\",&c[0][j][i]);\n\t\t\t}\n\t\t}\n\t\tres=20;\n\t\tdfs(0);\n\t\tprintf(\"%d\\n\",res);\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_1110_1456405",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int uli;\nmap<string,int>f;\n\nint dr[4]={1,1,1,0};\nint dc[4]={-1,0,1,1};\n\nstring cmp(string s){\n string ans(20,'0');\n int cnt=0;\n for(int i=0;i<20;i++){\n while(i<20 && s[i]=='0')i++;\n if(i<20)ans[cnt++]=s[i];\n }\n return ans;\n}\nint solve(string s){\n if(f.count(s)!=0) return f[s];\n int ans=-1;\n int cnt=0;\n bool fnd=false;\n for(int i=0;i<5;i++){\n for(int j=0;j<4;j++){\n if(s[i*4+j]=='0')break;\n cnt++;\n for(int x=0;x<4;x++){\n int nr=i+dr[x];\n int nc=j+dc[x];\n if(0<=nr && nr<5)\n if(0<=nc && nc<4)\n if(s[i*4+j]==s[nr*4+nc]){\n fnd=true;\n string t=s;\n t[i*4+j]='0'; \n t[nr*4+nc]='0';\n int bet=solve(cmp(t));\n if(ans==-1 || bet<ans)\n ans=bet;\n }\n }\n }\n }\n if(fnd)f[s]=ans;\n else f[s]=cnt;\n \n return f[s];\n}\nint main(){\n// freopen(\"data.in\",\"r\",stdin);\n int t,v;\n scanf(\"%d\",&t);\n while(t--){\n string s;\n for(int i=0;i<5;i++){\n for(int j=0;j<4;j++){\n scanf(\"%d\",&v);\n s+=string(1,'0'+v);\n }\n }\n int ans=solve(s);\n printf(\"%d\\n\",ans);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1656,
"score_of_the_acc": -0.1037,
"final_rank": 6
},
{
"submission_id": "aoj_1110_1124137",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef vector<int> Vec;\n\nvoid solve(Vec &s){\n int ans = 20;\n const int dx[8] = {-1,-1,-1,0,0,1,1,1};\n const int dy[8] = {-1,0,1,-1,1,-1,0,1};\n queue<Vec> Q;\n Q.push(s);\n set<Vec> visited;\n visited.insert(s);\n while(!Q.empty()){\n Vec v = Q.front(); Q.pop();\n int size = v.size();\n ans = min(ans,size);\n for(int i = 0 ; i < size ; i++){\n for(int j = 0 ; j < 8 ; j++){\n Vec next;\n int nx = i%4 + dx[j];\n int ny = i/4 + dy[j];\n if(nx < 0 || ny < 0 || nx >= min(4,size) || ny >= 5) continue;\n if(nx+ny*4 < 0 || nx+ny*4 >= size) continue;\n if(v[i] == v[nx+ny*4]){\n for(int k = 0 ; k < size ; k++){\n if(i == k || nx+ny*4 == k) continue;\n next.push_back(v[k]);\n }\n if(!visited.count(next)){\n visited.insert(next);\n Q.push(next);\n }\n }\n }\n }\n }\n cout << ans << endl;\n}\n\nint main(){\n int Tc;\n cin >> Tc;\n while(Tc--){\n Vec vec(20);\n for(int i = 0 ; i < 20 ; i++){\n cin >> vec[i];\n }\n solve(vec);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1324,
"score_of_the_acc": -0.0492,
"final_rank": 3
},
{
"submission_id": "aoj_1110_1124133",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef vector<int> Vec;\n\nvoid solve(Vec &s){\n int ans = 20;\n const int dx[8] = {-1,-1,-1,0,0,1,1,1};\n const int dy[8] = {-1,0,1,-1,1,-1,0,1};\n queue<Vec> Q;\n Q.push(s);\n set<Vec> visited;\n visited.insert(s);\n while(!Q.empty()){\n Vec v = Q.front(); Q.pop();\n int size = v.size();\n ans = min(ans,size);\n if(size == 0) continue;\n for(int i = 0 ; i < size ; i++){\n for(int j = 0 ; j < 8 ; j++){\n Vec next;\n int nx = i%4 + dx[j];\n int ny = i/4 + dy[j];\n if(nx < 0 || ny < 0 || nx >= min(4,size) || ny >= min(5,size)) continue;\n if(nx+ny*4 < 0 || nx+ny*4 >= size) continue;\n if(v[i] == v[nx+ny*4]){\n for(int k = 0 ; k < size ; k++){\n if(i == k || nx+ny*4 == k) continue;\n next.push_back(v[k]);\n }\n if(!visited.count(next)){\n visited.insert(next);\n Q.push(next);\n }\n }\n }\n }\n }\n cout << ans << endl;\n}\n\nint main(){\n int Tc;\n cin >> Tc;\n while(Tc--){\n Vec vec(20);\n for(int i = 0 ; i < 20 ; i++){\n cin >> vec[i];\n }\n solve(vec);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1324,
"score_of_the_acc": -0.0492,
"final_rank": 3
},
{
"submission_id": "aoj_1110_1113634",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint b[21];\nint dp[1<<20];\nint dx[]={1,3,4,5};\nint dy[]={1,-1,0,1};\nint solve(int a){\n\tif(~dp[a])return dp[a];\n\tif(a==0)return dp[a]=0;\n\tint now[20];\n\tint sz=0;\n\tfor(int i=0;i<20;i++){\n\t\tif(a&(1<<i))now[sz++]=i;\n\t}\n\tint ret=sz;\n\tfor(int i=0;i<sz;i++){\n\t\tfor(int j=0;j<4;j++){\n\t\t\tif(i+dx[j]<sz&&i%4+dy[j]<4&&0<=i%4+dy[j]&&b[now[i]]==b[now[i+dx[j]]]){\n\t\t\t\tret=min(ret,solve(a-(1<<now[i])-(1<<now[i+dx[j]])));\n\t\t\t}\n\t\t}\n\t}\n\treturn dp[a]=ret;\n}\nint main(){\n\tint a;\n\tscanf(\"%d\",&a);\n\twhile(a--){\n\t\tfor(int i=0;i<20;i++)scanf(\"%d\",b+i);\n\t\tfor(int i=0;i<(1<<20);i++)dp[i]=-1;\n\t\tprintf(\"%d\\n\",solve((1<<20)-1));\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5120,
"score_of_the_acc": -0.6724,
"final_rank": 15
},
{
"submission_id": "aoj_1110_1088008",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n\nusing namespace std;\n\nclass range {\nprivate:\n struct Iterator {\n int val;\n int operator*() {return val;}\n bool operator!=(Iterator& itr) {return val < itr.val;}\n void operator++() {++val;}\n };\n Iterator i, n;\npublic:\n range(int n) : i({0}), n({n}) {}\n range(int i, int n) : i({i}), n({n}) {}\n Iterator& begin() {return i;}\n Iterator& end() {return n;}\n};\n\ntemplate<class T> inline T at(const vector<T> &v, int i) {return v[(i % (int)v.size() + v.size()) % v.size()];}\n\ntemplate<class T> inline bool is_max(T &a, const T &b) {return a < b ? a = b, true : false;}\ntemplate<class T> inline bool is_min(T &a, const T &b) {return a > b ? a = b, true : false;}\n\nmap<vector<int>, int> mem;\n\nint solve(const vector<int>& v) {\n if (v.empty()) return 0;\n if (mem.count(v)) return mem[v];\n int res = v.size();\n for (int i : range((int)v.size() - 1)) if (i % 4 != 3 && v[i] == v[i + 1]) {\n vector<int> vv;\n for (int j : range(v.size())) if (j != i && j != i + 1) vv.emplace_back(v[j]);\n is_min(res, solve(vv));\n }\n for (int i : range((int)v.size() - 4)) if (v[i] == v[i + 4]) {\n vector<int> vv;\n for (int j : range(v.size())) if (j != i && j != i + 4) vv.emplace_back(v[j]);\n is_min(res, solve(vv));\n }\n for (int i : range((int)v.size() - 5)) if (i % 4 != 3 && v[i] == v[i + 5]) {\n vector<int> vv;\n for (int j : range(v.size())) if (j != i && j != i + 5) vv.emplace_back(v[j]);\n is_min(res, solve(vv));\n }\n for (int i : range((int)v.size() - 3)) if (i % 4 != 0 && v[i] == v[i + 3]) {\n vector<int> vv;\n for (int j : range(v.size())) if (j != i && j != i + 3) vv.emplace_back(v[j]);\n is_min(res, solve(vv));\n }\n return mem[v] = res;\n}\n\n\nint main() {\n int t;\n cin >> t;\n for (int _ : range(t)) {\n vector<int> v;\n for (int i : range(20)) {\n int c;\n cin >> c;\n v.emplace_back(c);\n }\n cout << solve(v) << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1640,
"score_of_the_acc": -0.1011,
"final_rank": 5
},
{
"submission_id": "aoj_1110_1022931",
"code_snippet": "#include <sstream>\n#include <string>\n#include <vector>\n#include <map>\n#include <algorithm>\n#include <iostream>\n#include <utility>\n#include <set>\n#include <cctype>\n#include <queue>\n#include <stack>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\nusing namespace std;\n#define INF 100000000\ntypedef long long ll;\n\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\nmap<vector<string>, int> m; // すでに探索済みかを確かめる\n\n// カードをremoveした後シフトする\nvector<string> shift(vector<string> s) {\n string ss;\n for (int y = 0; y < 5; y++) {\n for (int x = 0; x < 4; x++) {\n if (s[y][x] != '*') ss += s[y].substr(x, 1);\n }\n }\n for (int y = 0; y < 5; y++) {\n for (int x = 0; x < 4; x++) {\n if (4*y + x < ss.size()) {\n s[y][x] = ss[4*y+x];\n } else {\n s[y][x] = '*';\n }\n }\n }\n return s;\n}\n\n// sはカードの並び\nint dfs(vector<string> s) {\n if (m.find(s) != m.end()) return m[s];\n int ret = 0;\n // 今のカードの枚数をチェック\n // これがretの最高値\n for (int y = 0; y < 5; y++) {\n for (int x = 0; x < 4; x++) {\n if (s[y][x] != '*') ret++;\n }\n }\n// cout << \"ret:\" << ret << endl;\n for (int y = 0; y < 5; y++) {\n for (int x = 0; x < 4; x++) {\n if (s[y][x] == '*') continue;\n for (int i = 0; i < 8; i++) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n if (0 <= nx && nx < 4 && 0 <= ny && ny < 5 && s[y][x] == s[ny][nx]) {\n vector<string> ss;\n ss = s;\n ss[y][x] = ss[ny][nx] = '*';\n ss = shift(ss);\n ret = min(ret, dfs(ss));\n }\n }\n }\n }\n m.insert(map<vector<string>, int>::value_type(s, ret));\n return ret;\n}\n\nint main(void) {\n int N;\n cin >> N;\n for (int i = 0; i < N; i++) {\n m.clear();\n vector<string> s;\n for (int y = 0; y < 5; y++) {\n string c;\n for (int x = 0; x < 4; x++) {\n char ch;\n cin >> ch;\n c.push_back(ch);\n }\n s.push_back(c);\n }\n cout << dfs(s) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1496,
"score_of_the_acc": -0.4941,
"final_rank": 12
}
] |
aoj_1120_cpp
|
Pile Up!
There are cubes of the same size and a simple robot named Masato. Initially,
all cubes are on the floor. Masato can be instructed to pick up a cube and put
it on another cube, to make piles of cubes. Each instruction is of the form
`pick up cube
A
and put it on cube
B
(or on the floor).'
When he is to pick up a cube, he does so after taking off all the cubes on
and above it in the same pile (if any) onto the floor. In contrast, when he is
to put a cube on another, he puts the former on top of the pile including the
latter without taking any cubes off.
When he is instructed to put a cube on another cube and both cubes are
already in the same pile, there are two cases. If the former cube is stacked
somewhere below the latter, he put off all the cube above it onto the floor.
Afterwards he puts the former cube on the latter cube. If the former cube is
stacked somewhere above the latter, he just ignores the instruction.
When he is instructed to put a cube on the floor, there are also two cases.
If the cube is already on the floor (including the case that the cube is stacked
in the bottom of some pile), he just ignores the instruction. Otherwise, he puts
off all the cube on and up above the pile (if any) onto the floor before moving
the cube onto the floor.
He also ignores the instruction when told to put a cube on top of itself
(this is impossible).
Given the number of the cubes and a series of instructions, simulate actions
of Masato and calculate the heights of piles when Masato has finished his job.
Input
The input consists of a series of data sets. One data set contains the number
of cubes as its first line, and a series of instructions, each described in a
separate line. The number of cubes does not exceed 100. Each instruction
consists of two numbers; the former number indicates which cube to pick up, and
the latter number indicates on which cube to put it. The end of the instructions
is marked by two zeros.
The end of the input is marked by the line containing a single zero.
One data set has the following form:
m
I
1
J
1
I
2
J
2
...
I
n
J
n
0 0
Each cube is identified by its number (1 through
m
).
I
k
indicates which cube to pick up and
J
k
indicates on which cube to put it. The latter may be
zero, instructing to put the cube on the floor.
Output
Output the height of each pile (the number of cubes in the pile) in ascending
order, separated by newlines. A single cube by itself also counts as "a pile."
End of output for one data set should be marked by a line containing the
character sequence `end' by itself.
Sample Input
3
1 3
2 0
0 0
4
4 1
3 1
1 2
0 0
5
2 1
3 1
4 1
3 2
1 1
0 0
0
Output for the Sample Input
1
2
end
1
1
2
end
1
4
end
|
[
{
"submission_id": "aoj_1120_2063803",
"code_snippet": "#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n//// < \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\a.txt\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n\n\nint main() {\n\twhile (1) {\n\t\tint M; cin >> M;\n\t\tif (!M)break;\n\t\tvector<vector<int>>piles(M);\n\t\tfor (int i = 0; i < piles.size(); ++i) {\n\t\t\tpiles[i] = vector<int>(1, i + 1);\n\t\t}\n\t\twhile (1) {\n\t\t\tint a, b; cin >> a >> b;\n\t\t\tif (!a)break;\n\t\t\tpair<int, int>ap;\n\t\t\tfor (int i = 0; i < piles.size(); ++i) {\n\t\t\t\tauto pile(piles[i]);\n\t\t\t\tauto it = find(pile.begin(), pile.end(), a);\n\t\t\t\tif (it != pile.end()) {\n\t\t\t\t\tap = make_pair(i, it - pile.begin());\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!b) {\n\t\t\t\tif (ap.second == 0)continue;\n\t\t\t\tauto&apile(piles[ap.first]);\n\t\t\t\twhile (apile.back() != a) {\n\t\t\t\t\tint n = apile.back();\n\n\t\t\t\t\tapile.pop_back();\n\t\t\t\t\tif (n != a) {\n\n\t\t\t\t\t\tpiles.push_back(vector<int>(1, n));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tapile.pop_back();\n\t\t\t\tpiles.push_back(vector<int>(1, a));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tpair<int, int> bp;\n\t\t\t\t\n\t\t\t\tfor (int i = 0; i < piles.size(); ++i) {\n\t\t\t\t\tauto pile(piles[i]);\n\t\t\t\t\tauto jt = find(pile.begin(), pile.end(), b);\n\t\t\t\t\tif (jt != pile.end()) {\n\t\t\t\t\t\tbp = make_pair(i, jt - pile.begin());\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (ap.first == bp.first) {\n\t\t\t\t\tif (ap.second >= bp.second) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tauto& apile(piles[ap.first]);\n\t\t\t\t\t\twhile (apile.back() != a) {\n\t\t\t\t\t\t\tint n = apile.back();\n\n\t\t\t\t\t\t\tapile.pop_back();\n\t\t\t\t\t\t\tif (n != b) {\n\n\t\t\t\t\t\t\t\tpiles.push_back(vector<int>(1, n));\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tapile.pop_back();\n\t\t\t\t\t\tpiles.push_back(vector<int>{b, a});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tauto&apile(piles[ap.first]);\n\t\t\t\t\tauto&bpile(piles[bp.first]);\n\t\t\t\t\twhile (apile.back() != a) {\n\t\t\t\t\t\tint n = apile.back();\n\n\t\t\t\t\t\tapile.pop_back();\n\t\t\t\t\t\tif (n != a) {\n\n\t\t\t\t\t\t\tpiles.push_back(vector<int>(1, n));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tapile.pop_back();\n\t\t\t\t\tbpile.push_back(a);\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\t{\n\n\t\t\t\tvector<vector<int>>nextpiles;\n\t\t\t\tfor (auto&pile : piles) {\n\t\t\t\t\tif (!pile.empty())nextpiles.push_back(pile);\n\t\t\t\t}\n\t\t\t\tpiles = nextpiles;\n\t\t\t}\n\t\t}\n\t\tvector<int>nums;\n\t\tfor (auto pile : piles) {\n\t\t\tnums.push_back(pile.size());\n\t\t}\n\t\tsort(nums.begin(), nums.end());\n\t\tfor (auto n : nums)cout << n << endl;\n\t\tcout << \"end\" << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3048,
"score_of_the_acc": -1,
"final_rank": 2
},
{
"submission_id": "aoj_1120_1839736",
"code_snippet": "#include<bits/stdc++.h>\n#define N 105\nusing namespace std;\nint m,I,J,A[N][N];\nvector<int> ans;\n\nvoid func1(int a,int b){\n int ay,ax,by,bx;\n for(int i=0;i<m;i++)\n for(int j=0;j<m;j++){\n if(a==A[i][j])ay=i,ax=j;\n if(b==A[i][j])by=i,bx=j;\n }\n A[ay][ax]=0;\n for(int i=ax+1;i<m;i++){\n if(!A[ay][i])break;\n for(int j=0;j<m;j++)\n if(!A[j][0]){\n\tA[j][0]=A[ay][i];\n\tA[ay][i]=0;\n\tbreak;\n }\n }\n\n for(int i=bx+1;i<m;i++)\n if(!A[by][i]){\n A[by][i]=a;\n break;\n }\n}\n\nvoid func2(int a,int b){\n int ay,ax,bx;\n for(int i=0;i<m;i++)\n for(int j=0;j<m;j++){\n if(a==A[i][j])ay=i,ax=j;\n if(b==A[i][j])bx=j;\n }\n if(ax>=bx)return;\n\n for(int i=ax;i<m&&A[ay][i];i++){\n for(int j=0;j<m;j++)\n if(!A[j][0]){\n\tA[j][0]=A[ay][i];\n\tA[ay][i]=0;\n\tbreak;\n }\n }\n func1(a,b);\n}\n\n\nvoid func3(int a){\n int ay,ax;\n for(int i=0;i<m;i++)\n for(int j=0;j<m;j++)\n if(a==A[i][j])ay=i,ax=j;\n\n if(!ax)return;\n \n for(int i=ax;i<m;i++){\n if(!A[ay][i])break;\n for(int j=0;j<m;j++)\n if(!A[j][0]){\n\tA[j][0]=A[ay][i];\n\tA[ay][i]=0;\n\tbreak;\n }\n }\n}\n\n\nbool check(int a,int b){\n int ay,by;\n for(int i=0;i<m;i++){\n for(int j=0;j<m;j++){\n if(a==A[i][j])ay=i;\n if(b==A[i][j])by=i;\n }\n }\n return ay==by;\n}\n\nint main(){\n\n while(1){\n cin>>m;\n if(!m)break;\n memset(A,0,sizeof(A));\n for(int i=0;i<m;i++)A[i][0]=i+1;\n\n while(1){\n cin>>I>>J;\n if(!I&&!J)break;\n if(I&&!J)func3(I);\n else if(!check(I,J))func1(I,J);\n else func2(I,J);\n }\n\n for(int i=0;i<m;i++){\n int cnt=0;\n for(int j=0;j<m;j++){\n\tif(!A[i][j])break;\n\tcnt++;\n }\n if(cnt)ans.push_back(cnt);\n }\n sort(ans.begin(),ans.end());\n for(int i=0;i<(int)ans.size();i++)cout<<ans[i]<<endl;\n cout<<\"end\"<<endl;\n ans.clear();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1264,
"score_of_the_acc": -1.4147,
"final_rank": 3
},
{
"submission_id": "aoj_1120_154517",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <complex>\n#include <cstdio>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n\nint m,I,J,p[10000][100],s[10000],P;\npair<int,int> pos[101];\n\nvoid destroy(int pI,int ppI,pair<int,int> *pos){\n\tp[pI][ppI]=0;\n\tfor(int i=ppI+1;i<s[pI];i++){\n\t\tp[P][0]=p[pI][i];\n\t\ts[P]=1;\n\t\tpos[p[P][0]]=make_pair(P++,0);\n\t\tp[pI][i]=0;\n\t}\n\ts[pI]=ppI;\n}\n\nint main(){\n\twhile(cin>>m&&m){\n\t\trep(i,10000)fill(p[i],p[i]+100,0);\n\t\tfill(s,s+10000,0);\n\t\trep(i,m){p[i][0]=i+1;s[i]=1;pos[i+1]=make_pair(i,0);}\n\t\tP=m;\n\t\twhile(cin>>I>>J&&I){\n\t\t\tif(I==J)continue;\n\t\t\tint pI=pos[I].first,ppI=pos[I].second,pJ=pos[J].first,ppJ=pos[J].second;\n\t\t\tif(!J){\n\t\t\t\tif(ppI){\n\t\t\t\t\tdestroy(pI,ppI,pos);\n\t\t\t\t\tp[P][0]=I;\n\t\t\t\t\ts[P]=1;\n\t\t\t\t\tpos[I]=make_pair(P++,0);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(pI==pJ){\n\t\t\t\tif(ppI>ppJ)continue;\n\t\t\t\telse{\n\t\t\t\t\tint pppJ=P+ppJ-ppI-1;\n\t\t\t\t\tdestroy(pI,ppI,pos);\n\t\t\t\t\tp[pppJ][1]=I;\n\t\t\t\t\ts[pppJ]++;\n\t\t\t\t\tpos[I]=make_pair(pppJ,1);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tdestroy(pI,ppI,pos);\n\t\t\t\tp[pJ][s[pJ]]=I;\n\t\t\t\tpos[I]=make_pair(pJ,s[pJ]++);\n\t\t\t}\n\t\t\t//cout<<I<<\"->\"<<J<<endl;\n\t\t\t//rep(i,m)cout<<i+1<<\":\"<<pos[i+1].first<<\",\"<<pos[i+1].second<<(i<m-1?\" \":\"\\n\");\n\t\t\t//int sum=0;rep(i,P)sum+=s[i];cout<<sum<<endl;\n\t\t\t//rep(i,P){if(s[i])cout<<i<<\":\";rep(j,s[i]){cout<<p[i][j]<<(j<s[i]-1?\" \":\"\");}if(s[i])cout<<endl;}cout<<endl;\n\t\t}\n\t\tsort(s,s+10000);\n\t\trep(i,10000)if(s[i])cout<<s[i]<<(i<9999?\"\\n\":\"\\nend\\n\");\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_1112_cpp
|
Strange Key
Professor Tsukuba invented a mysterious jewelry box that can be opened
with a special gold key whose shape is very strange. It is composed
of gold bars joined at their ends. Each gold bar
has the same length and is placed parallel to one of the three
orthogonal axes in a three dimensional space,
i.e., x-axis, y-axis and z-axis.
The locking mechanism of the jewelry box
is truly mysterious, but the shape of the key is known.
To identify the key of the jewelry box, he gave a way to describe
its shape.
The description
indicates a list of connected paths that completely defines the shape
of the key: the gold bars of the key are arranged along the paths and
joined at their ends.
Except for the first path,
each path must start from an end point of a gold bar on a previously
defined path.
Each path is represented by a sequence of elements, each of which is one
of six symbols (+x, -x, +y, -y, +z and -z) or a positive integer.
Each symbol indicates the direction from an end point to the other end
point of a gold bar along the path. Since each gold bar is
parallel to one of the three orthogonal axes, the 6 symbols are enough to
indicate the direction. Note that a description of a path has
direction but the gold bars themselves have no direction.
An end point of a gold bar can have a label, which is a positive integer.
The labeled point may be referred to as the beginnings of other paths.
In a key description, the first occurrence of a positive integer
defines a label of a point and each subsequent occurrence of the same
positive integer indicates the beginning of a new path at the point.
An example of a key composed of 13 gold bars is depicted
in Figure 1.
The following sequence of lines
19
1 +x 1 +y +z 3 +z
3 +y -z +x +y -z -x +z 2 +z
2 +y
is a description of the key in Figure 1.
Note that newlines have the same role as space characters in the
description, so that
"19 1 +x 1 +y +z 3 +z 3 +y -z +x +y -z -x +z
2 +z 2 +y"
has the same meaning.
The meaning of this description is quite simple.
The first integer "19" means the number of
the following elements in this description.
Each element is one of the 6 symbols or a positive integer.
The integer "1" at the head of the second line
is a label attached to the starting point of the first path.
Without loss of generality,
it can be assumed that the starting point of the first path is the
origin, i.e., (0,0,0), and that the length of each gold bar is 1.
The next element "+x" indicates that the first gold bar
is parallel to the x-axis,
so that the other end point of the gold bar is at (1,0,0).
These two elements "1" and "+x" indicates
the first path consisting of only one gold bar.
The third element of the second line in the description is the positive
integer "1", meaning that the point with the label "1", i.e., the
origin (0,0,0) is the beginning of a new path.
The following elements "+y", "+z", "3", and "+z" indicate the second
path consisting of three gold bars. No
...(truncated)
|
[
{
"submission_id": "aoj_1112_10772248",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define op operator\n#define pb push_back\n\nstruct poi {\n int x, y, z;\n\n poi op-(poi p) {\n return {x - p.x, y - p.y, z - p.z};\n }\n\n poi op+(poi p) {\n return {x + p.x, y + p.y, z + p.z};\n }\n\n bool op<(poi p) const {\n return tie(x, y, z) < tie(p.x, p.y, p.z);\n }\n\n vector <poi> rot() {\n int a[3] = {x, y, z};\n vector <poi> v;\n int p[3] = {0, 1, 2};\n do {\n int inv = (p[0] > p[1]) + (p[0] > p[2]) + (p[1] > p[2]);\n int x = a[p[0]], y = a[p[1]], z = a[p[2]];\n if (inv & 1) {\n v.pb({-x, y, z});\n v.pb({x, -y, z});\n v.pb({x, y, -z});\n v.pb({-x, -y, -z});\n } else {\n v.pb({x, y, z});\n v.pb({x, -y, -z});\n v.pb({-x, y, -z});\n v.pb({-x, -y, z});\n }\n } while (next_permutation(p, p + 3));\n return v;\n }\n};\n\nconst int N = 1001;\nbool v[N];\npoi save[N];\nvector <pair<poi, poi>> segs[2];\n\nvector <pair<poi, poi>> read(int n) {\n poi p = {0, 0, 0};\n memset(v, 0, sizeof v);\n vector <pair<poi, poi>> r;\n for (int i = 0; i < n; i++) {\n string s;\n cin >> s;\n if (s[0] == '+' || s[0] == '-') {\n poi q;\n if (s[1] == 'x')\n q = {1, 0, 0};\n else if (s[1] == 'y')\n q = {0, 1, 0};\n else\n q = {0, 0, 1};\n if (s[0] == '+')\n q = p + q;\n else\n q = p - q;\n r.pb({p, q});\n p = q;\n } else {\n int x = stoi(s);\n if (v[x])\n p = save[x];\n else {\n v[x] = 1;\n save[x] = p;\n }\n }\n }\n return r;\n}\n\nset <poi> st;\n\nbool check(poi p) {\n bool v[24];\n memset(v, true, sizeof v);\n for (auto seg: segs[1]) {\n auto a = (seg.first - p).rot();\n auto b = (seg.second - p).rot();\n for (int i = 0; i < 24; i++) {\n if (v[i] && !st.count(a[i] + b[i]))\n v[i] = false;\n }\n if (!count(v, v + 24, true))\n return false;\n }\n return count(v, v + 24, true);\n}\n\nint main() {\n ios::sync_with_stdio(false);\n int n, m;\n while (cin >> n) {\n if (n == 0) break;\n segs[0] = read(n);\n cin >> m;\n segs[1] = read(m);\n\n st.clear();\n for (auto seg: segs[0]) {\n poi p = seg.first - segs[0][0].first;\n poi q = seg.second - segs[0][0].first;\n st.insert(p + q);\n }\n\n bool f = false;\n for (auto seg: segs[1])\n f |= check(seg.first) || check(seg.second);\n cout << (f ? \"SAME\" : \"DIFFERENT\") << '\\n';\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3420,
"score_of_the_acc": -1,
"final_rank": 11
},
{
"submission_id": "aoj_1112_5943881",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <string>\n#include <cstdlib>\n#include <sstream>\n#include <queue>\n#include <map>\nusing namespace std;\n#define R register\n#define _max(a,b) ((a)>(b)?(a):(b))\n#define _min(a,b) ((a)<(b)?(a):(b))\n#define _abs(a) ((a)> 0 ?(a):-(a))\ntypedef long long ll;\ntypedef pair<int, int> pil;\nconst int MX = 100;\nconst int INF = 0x3f3f3f3f;\nconst double EPS = 1e-6;\nll _r() {\n ll x = 0, f = 1;\n char c = getchar();\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\n return f == -1 ? -x : x;\n}\nint n = 0, cnt = 0;\nstruct Node {\n int x, y, z;\n Node() {\n z = y = x = 0;\n }\n Node(int a, int b, int c) {\n x = a, y = b, z = c;\n }\n Node operator + (const Node& a)const {\n Node c;\n c.x = x + a.x;\n c.y = y + a.y;\n c.z = z + a.z;\n return c;\n }\n Node operator - (const Node& a)const {\n Node c;\n c.x = x - a.x;\n c.y = y - a.y;\n c.z = z - a.z;\n return c;\n }\n Node operator += (const Node& a) {\n return *this = (*this) + a;\n }\n Node operator -= (const Node& a) {\n return *this = (*this) - a;\n }\n bool operator < (const Node& a)const {\n if (x == a.x) {\n if (y == a.y) {\n return z < a.z;\n }\n return y < a.y;\n }\n return x < a.x;\n }\n}save[1000], road[1000];\n\nint used[1000] = { 0 }, ccnt = 1;\nNode change[2000][3];\nmap< pair< Node, Node >, int> vis;\nbool Init() {\n vis.clear();\n memset(used, 0, sizeof(used));\n cnt = 1;\n\n save[1].x = save[1].y = save[1].z = 0;\n road[1] = save[1];\n cin >> n;\n if (n == 0)\n return 1;\n return 0;\n}\ninline int to_num(string& x) {\n int res = 0;\n for (int i = 0; i < x.length(); i++) {\n res = (res << 3) + (res << 1) + (x[i] ^ 48);\n }\n return res;\n}\nstring que[1000];\nvoid solve() {\n Node u, v;\n u = save[1];\n //used[1] = 1;\n string ope;\n for (R int i = 0; i < n; i++) {\n cin >> ope;\n if (ope[0] == '-') {\n v = u;\n if (ope[1] == 'x')\n v.x--;\n else if (ope[1] == 'y')\n v.y--;\n else\n v.z--;\n vis[make_pair(u, v)] = 1;\n vis[make_pair(v, u)] = 1;\n road[++cnt] = v;\n u = v;\n }\n else if (ope[0] == '+') {\n v = u;\n if (ope[1] == 'x')\n v.x++;\n else if (ope[1] == 'y')\n v.y++;\n else\n v.z++;\n vis[make_pair(u, v)] = 1;\n vis[make_pair(v, u)] = 1;\n road[++cnt] = v;\n u = v;\n }\n else {\n int st = to_num(ope);\n if (used[st]) {\n u = save[st];\n }\n else {\n save[st] = u;\n used[st] = 1;\n }\n }\n }\n\n\n int check = 0, flag = 0;\n cin >> check;\n for (R int i = 0; i < check; i++) {\n cin >> que[i];\n }\n int fin = 0;\n for (R int mood = 0; mood <= 27 && fin == 0; mood++) {\n for (R int st = 1; st <= cnt && fin == 0; st++) {\n memset(used, 0, sizeof(used));\n flag = 0;\n u = road[st];\n save[1] = u;\n //used[1] = 1;\n for (R int i = 0; i < check && flag == 0; i++) {\n que[i] = que[i];\n if (que[i][0] == '-') {\n v = u;\n if (que[i][1] == 'x')\n v -= change[mood][0];\n else if (que[i][1] == 'y')\n v -= change[mood][1];\n else\n v -= change[mood][2];\n if (vis[make_pair(u, v)] == 1)\n u = v;\n else\n flag = 1;\n }\n else if (que[i][0] == '+') {\n v = u;\n if (que[i][1] == 'x')\n v += change[mood][0];\n else if (que[i][1] == 'y')\n v += change[mood][1];\n else\n v += change[mood][2];\n if (vis[make_pair(u, v)] == 1)\n u = v;\n else\n flag = 1;\n }\n else {\n int num = to_num(que[i]);\n if (used[num]) {\n u = save[num];\n }\n else {\n save[num] = u;\n used[num] = 1;\n }\n }\n }\n if (flag == 0) {\n fin = 1;\n }\n\n }\n }\n if (fin)\n cout << \"SAME\" << endl;\n else\n cout << \"DIFFERENT\" << endl;\n}\nvoid start() {\n change[0][0] = Node(1, 0, 0); change[0][1] = Node(0, 0, -1); change[0][2] = Node(0, 1, 0);\n change[1][0] = Node(1, 0, 0); change[1][1] = Node(0, -1, 0); change[1][2] = Node(0, 0, -1);\n change[2][0] = Node(1, 0, 0); change[2][1] = Node(0, 0, 1); change[2][2] = Node(0, -1, 0);\n change[3][0] = Node(1, 0, 0); change[3][1] = Node(0, 1, 0); change[3][2] = Node(0, 0, 1);\n change[4][0] = Node(0, 0, 1); change[4][1] = Node(1, 0, 0); change[4][2] = Node(0, 1, 0);\n change[5][0] = Node(0, 0, 1); change[5][1] = Node(0, -1, 0); change[5][2] = Node(1, 0, 0);\n change[6][0] = Node(0, 0, 1); change[6][1] = Node(-1, 0, 0); change[6][2] = Node(0, -1, 0);\n change[7][0] = Node(0, 0, 1); change[7][1] = Node(0, 1, 0); change[7][2] = Node(-1, 0, 0);\n change[8][0] = Node(0, 1, 0); change[8][1] = Node(1, 0, 0); change[8][2] = Node(0, 0, -1);\n change[9][0] = Node(0, 1, 0); change[9][1] = Node(0, 0, 1); change[9][2] = Node(1, 0, 0);\n change[10][0] = Node(0, 1, 0); change[10][1] = Node(-1, 0, 0); change[10][2] = Node(0, 0, 1);\n change[11][0] = Node(0, 1, 0); change[11][1] = Node(0, 0, -1); change[11][2] = Node(-1, 0, 0);\n change[12][0] = Node(-1, 0, 0); change[12][1] = Node(0, 1, 0); change[12][2] = Node(0, 0, -1);\n change[13][0] = Node(-1, 0, 0); change[13][1] = Node(0, 0, 1); change[13][2] = Node(0, 1, 0);\n change[14][0] = Node(-1, 0, 0); change[14][1] = Node(0, -1, 0); change[14][2] = Node(0, 0, 1);\n change[15][0] = Node(-1, 0, 0); change[15][1] = Node(0, 0, -1); change[15][2] = Node(0, -1, 0);\n change[16][0] = Node(0, 0, -1); change[16][1] = Node(0, 1, 0); change[16][2] = Node(1, 0, 0);\n change[17][0] = Node(0, 0, -1); change[17][1] = Node(-1, 0, 0); change[17][2] = Node(0, 1, 0);\n change[18][0] = Node(0, 0, -1); change[18][1] = Node(0, -1, 0); change[18][2] = Node(-1, 0, 0);\n change[19][0] = Node(0, 0, -1); change[19][1] = Node(1, 0, 0); change[19][2] = Node(0, -1, 0);\n change[20][0] = Node(0, -1, 0); change[20][1] = Node(0, 0, -1); change[20][2] = Node(1, 0, 0);\n change[21][0] = Node(0, -1, 0); change[21][1] = Node(-1, 0, 0); change[21][2] = Node(0, 0, -1);\n change[22][0] = Node(0, -1, 0); change[22][1] = Node(0, 0, 1); change[22][2] = Node(-1, 0, 0);\n change[23][0] = Node(0, -1, 0); change[23][1] = Node(1, 0, 0); change[23][2] = Node(0, 0, 1);\n change[24][0] = Node(1, 0, 0); change[24][1] = Node(0, 0, -1); change[24][2] = Node(0, 1, 0);\n change[25][0] = Node(1, 0, 0); change[25][1] = Node(0, -1, 0); change[25][2] = Node(0, 0, -1);\n change[26][0] = Node(1, 0, 0); change[26][1] = Node(0, 0, 1); change[26][2] = Node(0, -1, 0);\n change[27][0] = Node(1, 0, 0); change[27][1] = Node(0, 1, 0); change[27][2] = Node(0, 0, 1);\n}\nint main() {\n ios::sync_with_stdio(false);\n //freopen(\"data.in\", \"r\", stdin);\n //int t = _r();\n start();\n while (1) {\n if (Init())\n break;\n solve();\n }\n\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3248,
"score_of_the_acc": -0.9497,
"final_rank": 10
},
{
"submission_id": "aoj_1112_2225432",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define op operator\n#define pb push_back\n\nstruct poi {\n\tint x, y, z;\n\tpoi op -(poi p) {\n\t\treturn {x - p.x, y - p.y, z - p.z};\n\t}\n\tpoi op +(poi p) {\n\t\treturn {x + p.x, y + p.y, z + p.z};\n\t}\n\tbool op <(poi p) const {\n\t\treturn tie(x, y, z) < tie(p.x, p.y, p.z);\n\t}\n\tvector <poi> rot() {\n\t\tint a[3] = {x, y, z};\n\t\tvector <poi> v;\n\t\tint p[3] = {0, 1, 2};\n\t\tdo {\n\t\t\tint inv = (p[0] > p[1]) + (p[0] > p[2]) + (p[1] > p[2]);\n\t\t\tint x = a[p[0]], y = a[p[1]], z = a[p[2]];\n\t\t\tif(inv & 1) {\n\t\t\t\tv.pb({-x, y, z});\n\t\t\t\tv.pb({x, -y, z});\n\t\t\t\tv.pb({x, y, -z});\n\t\t\t\tv.pb({-x, -y, -z});\n\t\t\t} else {\n\t\t\t\tv.pb({x, y, z});\n\t\t\t\tv.pb({x, -y, -z});\n\t\t\t\tv.pb({-x, y, -z});\n\t\t\t\tv.pb({-x, -y, z});\n\t\t\t}\n\t\t}while(next_permutation(p, p + 3));\n\t\treturn v;\n\t}\n};\n\nconst int N = 1001;\nbool v[N];\npoi save[N];\nvector <pair <poi, poi>> segs[2];\n\nvector <pair <poi, poi>> read(int n) {\n\tpoi p = {0, 0, 0};\n\tmemset(v, 0, sizeof v);\n\tvector <pair <poi, poi>> r;\n\tfor(int i = 0; i < n; i ++) {\n\t\tstring s; cin >> s;\n\t\tif(s[0] == '+' || s[0] == '-') {\n\t\t\tpoi q;\n\t\t\tif(s[1] == 'x')\n\t\t\t\tq = {1, 0, 0};\n\t\t\telse if(s[1] == 'y')\n\t\t\t\tq = {0, 1, 0};\n\t\t\telse\n\t\t\t\tq = {0, 0, 1};\n\t\t\tif(s[0] == '+')\n\t\t\t\tq = p + q;\n\t\t\telse\n\t\t\t\tq = p - q;\n\t\t\tr.pb({p, q});\n\t\t\tp = q;\n\t\t} else {\n\t\t\tint x = stoi(s);\n\t\t\tif(v[x])\n\t\t\t\tp = save[x];\n\t\t\telse {\n\t\t\t\tv[x] = 1;\n\t\t\t\tsave[x] = p;\n\t\t\t}\n\t\t}\n\t}\n\treturn r;\n}\n\nset <poi> st;\nbool check(poi p) {\n\tbool v[24];\n\tmemset(v, true, sizeof v);\n\tfor(auto seg : segs[1]) {\n\t\tauto a = (seg.first - p).rot();\n\t\tauto b = (seg.second - p).rot();\n\t\tfor(int i = 0; i < 24; i ++) {\n\t\t\tif(v[i] && !st.count(a[i] + b[i]))\n\t\t\t\tv[i] = false;\n\t\t}\n\t\tif(!count(v, v + 24, true))\n\t\t\treturn false;\n\t}\n\treturn count(v, v + 24, true);\n}\n\nint main() {\n\tios :: sync_with_stdio(false);\n\tint n, m;\n\twhile(cin >> n) {\n\t\tif(n == 0) break;\n\t\tsegs[0] = read(n);\n\t\tcin >> m;\n\t\tsegs[1] = read(m);\n\n\t\tst.clear();\n\t\tfor(auto seg : segs[0]) {\n\t\t\tpoi p = seg.first - segs[0][0].first;\n\t\t\tpoi q = seg.second - segs[0][0].first;\n\t\t\tst.insert(p + q);\n\t\t}\n\n\t\tbool f = false;\n\t\tfor(auto seg : segs[1])\n\t\t\tf |= check(seg.first) || check(seg.second);\n\t\tcout << (f ? \"SAME\" : \"DIFFERENT\") << '\\n';\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3116,
"score_of_the_acc": -0.9111,
"final_rank": 9
},
{
"submission_id": "aoj_1112_1358990",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <cmath>\n#include <cstdio>\n#include <algorithm>\n#include <vector>\n#include <memory>\n#include <cstring>\n#include <cassert>\n#include <numeric>\n#include <sstream>\n#include <complex>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <tuple>\n#include <cctype>\n#include <unordered_map>\n#include <unordered_set>\nusing namespace std;\n\n#define REP2(i, m, n) for (int i = (int)(m); i < (int)(n); i++)\n#define REP(i, n) REP2(i, 0, n)\n#define ALL(S) (S).begin(), (S).end()\n\ntemplate <typename T, typename E>\nostream &operator<<(std::ostream &os, const std::pair<T, E> &p){\n return os << \"(\" << p.first << \", \" << p.second << \")\";\n}\n\ntypedef tuple<int, int, int> Point3D;\n\nPoint3D operator-(const Point3D &p1, const Point3D &p2){\n return make_tuple(get<0>(p1) - get<0>(p2),\n get<1>(p1) - get<1>(p2),\n get<2>(p1) - get<2>(p2));\n}\n\nPoint3D operator+(const Point3D &p1, const Point3D &p2){\n return make_tuple(get<0>(p1) + get<0>(p2),\n get<1>(p1) + get<1>(p2),\n get<2>(p1) + get<2>(p2));\n}\n\nstruct Key {\n map<int, Point3D> P;\n map<Point3D, int> I;\n map<int, vector<int> > E; \n \n void load(int n){\n map<string, Point3D> L;\n string s;\n int x = 0, y = 0, z = 0, nx, ny, nz;\n \n P[0] = make_tuple(0, 0, 0);\n I[make_tuple(0, 0, 0)] = 0;\n \n while (n--){\n cin >> s;\n tie(nx, ny, nz) = make_tuple(x, y, z);\n if (s.back() == 'x'){\n nx = (s[0] == '-' ? x - 1 : x + 1);\n } else if (s.back() == 'y'){\n ny = (s[0] == '-' ? y - 1 : y + 1);\n } else if (s.back() == 'z'){\n nz = (s[0] == '-' ? z - 1 : z + 1);\n } else {\n if (L.count(s) == 0) L[s] = make_tuple(x, y, z);\n else tie(x, y, z) = L[s];\n continue;\n }\n\n if (I.count(make_tuple(nx, ny, nz)) == 0){\n int id = I.size();\n I[make_tuple(nx, ny, nz)] = id;\n P[id] = make_tuple(nx, ny, nz);\n }\n\n int u = I[make_tuple(x, y, z)];\n int v = I[make_tuple(nx, ny, nz)];\n E[u].push_back(v);\n E[v].push_back(u);\n tie(x, y, z) = make_tuple(nx, ny, nz);\n }\n }\n\n void rotate_x(){\n map<Point3D, int> NI;\n for (auto &p : P){\n int x, y, z;\n tie(x, y, z) = p.second;\n p.second = make_tuple(x, -z, y);\n NI[p.second] = p.first;\n }\n I = NI;\n };\n void rotate_y(){\n map<Point3D, int> NI;\n for (auto &p : P){\n int x, y, z;\n tie(x, y, z) = p.second;\n p.second = make_tuple(-z, y, x);\n NI[p.second] = p.first;\n }\n I = NI;\n };\n \n void rotate_z(){\n map<Point3D, int> NI;\n for (auto &p : P){\n int x, y, z;\n tie(x, y, z) = p.second;\n p.second = make_tuple(-y, x, z);\n NI[p.second] = p.first;\n }\n I = NI;\n }\n};\n\n\nbool check(Key key1, Key key2){\n auto P1 = key1.P;\n auto P2 = key2.P;\n if (P1.size() != P2.size()) return false;\n\n int n = P1.size();\n REP(i, n){\n Point3D d = P2[i] - P1[0];\n \n bool ok = true;\n REP(j, n){\n if (key2.I.count(P1[j] + d) == 0) ok = false;\n if (key1.I.count(P2[j] - d) == 0) ok = false;\n }\n\n if (ok){\n REP(j, n) if (ok){\n for (int k : key1.E[j]){\n int nj = key2.I[P1[j] + d];\n int nk = key2.I[P1[k] + d];\n if (find(ALL(key2.E[nj]), nk) == key2.E[nj].end()) ok = false;\n }\n }\n REP(j, n) if (ok){\n for (int k : key2.E[j]){\n int nj = key1.I[P2[j] - d];\n int nk = key1.I[P2[k] - d];\n if (find(ALL(key1.E[nj]), nk) == key1.E[nj].end()) ok = false;\n }\n }\n }\n if (ok) return true;\n }\n return false;\n}\n\nbool same(Key key1, Key key2){\n REP(z_, 4){\n REP(y_, 4){\n REP(x_, 4){\n if (check(key1, key2)) return true;\n key1.rotate_x();\n }\n key1.rotate_y();\n }\n key1.rotate_z();\n }\n return false;\n}\n \n\nint main(int argc, char *argv[])\n{\n int n;\n while (cin >> n && n){\n Key key1;\n Key key2;\n key1.load(n);\n cin >> n;\n key2.load(n);\n cout << (same(key1, key2) ? \"SAME\" : \"DIFFERENT\") << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 920,
"memory_kb": 1524,
"score_of_the_acc": -1.4456,
"final_rank": 12
},
{
"submission_id": "aoj_1112_1012189",
"code_snippet": "#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <cstdlib>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <set>\n#include <vector>\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(x) begin(x), end(x)\n\nstruct point {\n\tint x, y, z;\n\texplicit point(int x_ = 0, int y_ = 0, int z_ = 0):x(x_), y(y_), z(z_) {}\n\n\tpoint operator+(const point &p) const {\n\t\treturn point(x + p.x, y + p.y, z + p.z);\n\t}\n\n\tpoint operator-(const point &p) const {\n\t\treturn point(x - p.x, y - p.y, z - p.z);\n\t}\n\n\tpoint operator-() const {\n\t\treturn point(-x, -y, -z);\n\t}\n\n\tbool operator<(const point &p) const {\n\t\tif(x != p.x) return x < p.x;\n\t\tif(y != p.y) return y < p.y;\n\t\treturn z < p.z;\n\t}\n\n\tbool operator==(const point &p) const {\n\t\treturn x == p.x && y == p.y && z == p.z;\n\t}\n};\n\nstruct segment {\n\tpoint a, b;\n\tsegment(const point &a_, const point &b_):a(a_), b(b_) {\n\t\tif(b < a) swap(a, b);\n\t}\n\n\tbool operator<(const segment &s) const {\n\t\tif(!(a == s.a)) return a < s.a;\n\t\treturn b < s.b;\n\t}\n\n\tbool operator==(const segment&s) const {\n\t\treturn a == s.a && b == s.b;\n\t}\n};\n\npoint rotate_x(const point &p) {\n\treturn point(p.x, p.z, -p.y);\n}\n\npoint rotate_y(const point &p) {\n\treturn point(p.z, p.y, -p.x);\n}\n\npoint rotate_z(const point &p) {\n\treturn point(p.y, -p.x, p.z);\n}\n\nbool input(set<segment> &segs) {\n\tint n;\n\tcin >> n;\n\n\tif(n == 0) return false;\n\tsegs.clear();\n\n\tpoint move_d[128];\n\tmove_d['x'] = point(1, 0, 0);\n\tmove_d['y'] = point(0, 1, 0);\n\tmove_d['z'] = point(0, 0, 1);\n\n\tpoint current(0, 0, 0);\n\tmap<int, point> label;\n\n\trep(i, n) {\n\t\tstring s;\n\t\tcin >> s;\n\n\t\tif(isdigit(s[0])) { // label\n\t\t\tconst int idx = stoi(s);\n\t\t\tif(!label.count(idx)) {\n\t\t\t\tlabel[idx] = current;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcurrent = label[idx];\n\t\t\t}\n\t\t}\n\t\telse { // move\n\t\t\tpoint d = move_d[s[1]];\n\t\t\tif(s[0] == '-') d = -d;\n\t\t\tconst point next = current + d;\n\t\t\tsegs.insert(segment(current, next));\n\t\t\tcurrent = move(next);\n\t\t}\n\t}\n\n\treturn true;\n}\n\nbool match(const set<segment> &a, const set<segment> &b) {\n\tif(a.size() != b.size()) return false;\n\tauto it_a = a.cbegin();\n\tauto it_b = b.cbegin();\n\n\tconst point offset = a.cbegin()->a - b.cbegin()->a;\n\n\twhile(it_a != a.end()) {\n\t\tconst segment &s_a = *it_a;\n\t\tconst segment s_b(it_b->a + offset, it_b->b + offset);\n\t\tif(!(s_a == s_b)) return false;\n\n\t\t++it_a;\n\t\t++it_b;\n\t}\n\n\treturn true;\n\n}\n\nset<segment> rotate_points(const set<segment> &segs, const function<point(const point&)> &convert) {\n\tset<segment> res;\n\tfor(const auto &seg : segs) {\n\t\tres.insert(segment(convert(seg.a), convert(seg.b)));\n\t}\n\treturn res;\n}\n\nbool valid(const set<segment> &a, set<segment> b) {\n\trep(loop_x, 4) {\n\t\tb = rotate_points(b, rotate_x);\n\t\trep(loop_y, 4) {\n\t\t\tb = rotate_points(b, rotate_y);\n\t\t\trep(loop_z, 4) {\n\t\t\t\tb = rotate_points(b, rotate_z);\n\t\t\t\tif(match(a, b)) return true;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn false;\n}\n\nint main() {\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tset<segment> a, b;\n\twhile(input(a)) {\n\t\tassert(input(b));\n\t\tcout << (valid(a, b) ? \"SAME\" : \"DIFFERENT\") << endl;\n\t}\n\n\treturn EXIT_SUCCESS;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1264,
"score_of_the_acc": -0.3916,
"final_rank": 7
},
{
"submission_id": "aoj_1112_1012129",
"code_snippet": "#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <cstdlib>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <set>\n#include <vector>\nusing namespace std;\n\n#define dump(a) (cerr << #a << \" = \" << (a) << endl)\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(x) begin(x), end(x)\n\nstruct point {\n int x, y, z;\n explicit point(int x_ = 0, int y_ = 0, int z_ = 0):x(x_), y(y_), z(z_) {}\n\n point operator+(const point &p) const {\n\treturn point(x + p.x, y + p.y, z + p.z);\n }\n\n point operator-(const point &p) const {\n\treturn point(x - p.x, y - p.y, z - p.z);\n }\n\n point operator-() const {\n\treturn point(-x, -y, -z);\n }\n\n bool operator<(const point &p) const {\n\tif(x != p.x) return x < p.x;\n\tif(y != p.y) return y < p.y;\n\treturn z < p.z;\n }\n\n bool operator==(const point &p) const {\n\treturn x == p.x && y == p.y && z == p.z;\n }\n};\n\nostream &operator<<(ostream &os, const point &p) {\n return os << '(' << p.x << \", \" << p.y << \", \" << p.z << ')';\n}\n\nstruct segment {\n point a, b;\n segment(const point &a_, const point &b_):a(a_), b(b_) {\n\tif(b < a) swap(a, b);\n }\n\n bool operator<(const segment &s) const {\n\tif(a < s.a || s.a < a) return a < s.a;\n\treturn b < s.b;\n }\n\n bool operator==(const segment&s) const {\n\treturn a == s.a && b == s.b;\n }\n};\n\npoint rotate_x(const point &p) {\n return point(p.x, p.z, -p.y);\n}\n\npoint rotate_y(const point &p) {\n return point(p.z, p.y, -p.x);\n}\n\npoint rotate_z(const point &p) {\n return point(p.y, -p.x, p.z);\n}\n\nbool input(set<segment> &segs) {\n int n;\n cin >> n;\n\n if(n == 0) return false;\n\n point move_d[128];\n move_d['x'] = point(1, 0, 0);\n move_d['y'] = point(0, 1, 0);\n move_d['z'] = point(0, 0, 1);\n \n const point move_x(1, 0, 0), move_y(0, 1, 0), move_z(0, 0, 1);\n\n point current(0, 0, 0);\n map<int, point> label;\n\n rep(i, n) {\n\tstring s;\n\tcin >> s;\n\n\tif(isdigit(s[0])) { // label\n\t const int idx = stoi(s);\n\t if(!label.count(idx)) {\n\t\tlabel[idx] = current;\n\t }\n\t else {\n\t\tcurrent = label[idx];\n\t }\n\t}\n\telse { // move\n\t point d = move_d[s[1]];\n\t if(s[0] == '-') d = -d;\n\t const point next = current + d;\n\t segs.insert(segment(current, next));\n\t current = move(next);\n\t}\n }\n\n return true;\n}\n\nbool match(const set<segment> &a, const set<segment> &b) {\n if(a.size() != b.size()) return false;\n auto it_a = a.cbegin();\n auto it_b = b.cbegin();\n\n const point offset = a.cbegin()->a - b.cbegin()->a;\n\n while(it_a != a.end()) {\n\tconst segment &s_a = *it_a;\n\tconst segment s_b(it_b->a + offset, it_b->b + offset);\n\tif(!(s_a == s_b)) return false;\n\n\t++it_a;\n\t++it_b;\n }\n\n return true;\n\n}\n\nset<segment> rotate_points(const set<segment> &segs, const function<point(const point&)> &convert) {\n set<segment> res;\n for(const auto &seg : segs) {\n\tres.insert(segment(convert(seg.a), convert(seg.b)));\n }\n return res;\n}\n\nbool valid(const set<segment> &a, set<segment> b) {\n rep(loop_x, 4) {\n\tb = rotate_points(b, rotate_x);\n\trep(loop_y, 4) {\n\t b = rotate_points(b, rotate_y);\n\t rep(loop_z, 4) {\n\t\tb = rotate_points(b, rotate_z);\n\t\tif(match(a, b)) return true;\n\t }\n\t}\n }\n\n return false;\n}\n\nint main() {\n set<segment> a, b;\n while(input(a)) {\n\tassert(input(b));\n\tcout << (valid(a, b) ? \"SAME\" : \"DIFFERENT\") << endl;\n\ta.clear();\n\tb.clear();\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1252,
"score_of_the_acc": -0.3771,
"final_rank": 6
},
{
"submission_id": "aoj_1112_771402",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\nstruct P {\n int x, y, z;\n P() : x(0), y(0), z(0) {}\n P(int x, int y, int z) : x(x), y(y), z(z) {}\n bool operator < (const P &p) const {\n if(x != p.x) return x < p.x;\n if(y != p.y) return y < p.y;\n return z < p.z;\n }\n bool operator == (const P &p) const {\n return x == p.x && y == p.y && z == p.z;\n }\n P operator + (const P &p) const {\n return P(x+p.x, y+p.y, z+p.z);\n }\n P& operator += (const P &p) {\n return ( *this = *this + p );\n }\n P operator - (const P &p) const {\n return P(x-p.x, y-p.y, z-p.z);\n }\n P& operator -= (const P &p) {\n return ( *this = *this - p );\n }\n};\n\ntypedef pair<P,P> Seg;\ntypedef vector<Seg> Key;\n\nconst int INF = 1<<28;\n\nvoid rotate(int &x, int &y) {\n int t = x;\n x = -y;\n y = t;\n}\n\nKey rotate(Key k, int dir) {\n int n = k.size();\n for(int i = 0; i < n; ++i) {\n pair<int,int> p;\n if(dir == 0) {\n rotate(k[i].first.x, k[i].first.y);\n rotate(k[i].second.x, k[i].second.y);\n } else if(dir == 1) {\n rotate(k[i].first.y, k[i].first.z);\n rotate(k[i].second.y, k[i].second.z);\n } else if(dir == 2) {\n rotate(k[i].first.z, k[i].first.x);\n rotate(k[i].second.z, k[i].second.x);\n }\n }\n return k;\n}\n\nKey normalize(Key k) {\n int n = k.size();\n for(int i = 0; i < n; ++i) {\n if(k[i].second < k[i].first) swap(k[i].first, k[i].second);\n }\n P mini(INF,INF,INF);\n for(int i = 0; i < n; ++i) {\n mini.x = min(mini.x, min(k[i].first.x, k[i].second.x));\n mini.y = min(mini.y, min(k[i].first.y, k[i].second.y));\n mini.z = min(mini.z, min(k[i].first.z, k[i].second.z));\n }\n for(int i = 0; i < n; ++i) {\n k[i].first -= mini;\n k[i].second -= mini;\n }\n sort(k.begin(), k.end());\n return k;\n}\n\nKey getKey() {\n int q;\n cin >> q;\n if(!q) return Key();\n Key k;\n P p(0,0,0);\n P label[100];\n fill(label, label+100, P(INF,INF,INF));\n while(q--) {\n string s;\n cin >> s;\n P pre = p;\n if(0) {\n } else if(s == \"+x\") {\n ++p.x;\n } else if(s == \"-x\") {\n --p.x;\n } else if(s == \"+y\") {\n ++p.y;\n } else if(s == \"-y\") {\n --p.y;\n } else if(s == \"+z\") {\n ++p.z;\n } else if(s == \"-z\") {\n --p.z;\n } else {\n int id = atoi(s.c_str());\n if(label[id].x == INF) {\n label[id] = p;\n } else {\n p = label[id];\n }\n pre.x = INF;\n }\n if(pre.x != INF) {\n k.push_back(Seg(pre,p));\n }\n }\n return k;\n}\n\nbool equals(Key a, Key b) {\n a = normalize(a);\n for(int i = 0; i < 6; ++i) {\n for(int j = 0; j < 4; ++j) {\n b = normalize(b);\n if(a == b) return true;\n b = rotate(b, 0);\n }\n if(i < 3) {\n b = rotate(b, 1);\n } else if(i == 3) {\n b = rotate(b, 2);\n } else if(i == 4) {\n b = rotate(b, 2);\n b = rotate(b, 2);\n }\n }\n return false;\n}\n\nint main() {\n while(1) {\n Key a = getKey();\n if(!a.size()) break;\n Key b = getKey();\n /*\n cout << \"A\" << endl;\n for(int i = 0; i < a.size(); ++i) {\n cout << \"(\" << a[i].first.x << \",\" << a[i].first.y << \",\" << a[i].first.z << \"),\";\n cout << \"(\" << a[i].second.x << \",\" << a[i].second.y << \",\" << a[i].second.z << \")\" << endl;\n }\n cout << \"B\" << endl;\n for(int i = 0; i < b.size(); ++i) {\n cout << \"(\" << b[i].first.x << \",\" << b[i].first.y << \",\" << b[i].first.z << \"),\";\n cout << \"(\" << b[i].second.x << \",\" << b[i].second.y << \",\" << b[i].second.z << \")\" << endl;\n }\n */\n if(equals(a,b)) cout << \"SAME\" << endl;\n else cout << \"DIFFERENT\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1252,
"score_of_the_acc": -0.3661,
"final_rank": 4
},
{
"submission_id": "aoj_1112_688734",
"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};\nstruct P{\n int x, y, z;\n P() : x(0), y(0), z(0) {}\n P(int x, int y, int z) : x(x), y(y), z(z) {}\n bool operator < (const P& p) const {\n if(x != p.x) return x < p.x;\n if(y != p.y) return y < p.y;\n return z < p.z;\n }\n bool operator == (const P& p) const {\n return x == p.x && y == p.y && z == p.z;\n }\n P operator - (const P& p) const {\n return P(x - p.x, y - p.y, z - p.z);\n }\n};\ntypedef pair<P, P> L;\nvector<L> input(){\n int N; cin >> N;\n P label[100] = {};\n bool used[100] = {};\n P cur;\n vector<L> res;\n while(N--){\n string s;\n cin >> s;\n if(isdigit(s[0])){\n int l = atoi(s.c_str());\n if(used[l]){\n cur = label[l];\n }else{\n label[l] = cur;\n used[l] = true;\n }\n }else{\n int dif = (s[0] == '+' ? 1 : -1);\n P next = cur;\n if(s[1] == 'x'){\n next.x += dif;\n }else if(s[1] == 'y'){\n next.y += dif;\n }else if(s[1] == 'z'){\n next.z += dif;\n }else{\n assert(false);\n }\n res.push_back(L(cur, next));\n cur = next;\n }\n }\n return res;\n}\nvoid update(P& p, P q){\n p.x = min(p.x, q.x);\n p.y = min(p.y, q.y);\n p.z = min(p.z, q.z);\n}\nvector<L> normalize(const vector<L>& s){\n P min_p = s[0].first;\n REP(i, s.size()){\n update(min_p, s[i].first);\n update(min_p, s[i].second);\n }\n vector<L> res;\n REP(i, s.size()){\n res.push_back(L(s[i].first - min_p, s[i].second - min_p));\n if(res[i].second < res[i].first) swap(res[i].first, res[i].second);\n }\n sort(res.begin(), res.end());\n return res;\n}\nvoid rotate_x(vector<L>& s){\n REP(i, s.size()){\n s[i].first = P(s[i].first.x, -s[i].first.z, s[i].first.y);\n s[i].second = P(s[i].second.x, -s[i].second.z, s[i].second.y);\n }\n}\nvoid rotate_y(vector<L>& s){\n REP(i, s.size()){\n s[i].first = P(s[i].first.z, s[i].first.y, -s[i].first.x);\n s[i].second = P(s[i].second.z, s[i].second.y, -s[i].second.x);\n }\n}\nvoid rotate_z(vector<L>& s){\n REP(i, s.size()){\n s[i].first = P(-s[i].first.y, s[i].first.x, s[i].first.z);\n s[i].second = P(-s[i].second.y, s[i].second.x, s[i].second.z);\n }\n}\nint main(){\n while(true){\n vector<L> k1 = input();\n if(k1.empty()) break;\n vector<L> k2 = input();\n k2 = normalize(k2);\n\n bool is_equal = false;\n for(int k = 0; k < 6; k++){\n if(k % 2 == 0) rotate_x(k1);\n else rotate_y(k1);\n for(int i = 0; i < 4; i++){\n rotate_z(k1);\n k1 = normalize(k1);\n if(k1 == k2){\n is_equal = true;\n //goto OUTPUT;\n }\n }\n }\n\nOUTPUT:\n if(is_equal) cout << \"SAME\" << endl;\n else cout << \"DIFFERENT\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1236,
"score_of_the_acc": -0.3724,
"final_rank": 5
},
{
"submission_id": "aoj_1112_336215",
"code_snippet": "#include<map>\n#include<cctype>\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nstruct point{\n\tint x,y,z;\n\tpoint operator+(const point &a)const{ return (point){x+a.x,y+a.y,z+a.z}; }\n\tpoint operator-(const point &a)const{ return (point){x-a.x,y-a.y,z-a.z}; }\n\tbool operator==(const point &a)const{ return x==a.x && y==a.y && z==a.z; }\n};\n\nstruct edge{\n\tpoint u,v;\n\tbool operator==(const edge &e)const{ return u==e.u && v==e.v || u==e.v && v==e.u; }\n};\n\nstruct key{\n\tint n;\n\tedge E[300];\n};\n\nkey getkey(){\n\tkey K={};\n\tpoint p={0,0,0};\n\tmap<int,point> f;\n\tint n; scanf(\"%d\",&n);\n\twhile(n--){\n\t\tchar s[8]; scanf(\"%s\",s);\n\n\t\tif(isdigit(s[0])){\n\t\t\tint a; sscanf(s,\"%d\",&a);\n\t\t\tif(f.count(a)) p=f[a];\n\t\t\telse f[a]=p;\n\t\t}\n\t\telse{\n\t\t\tpoint q=p;\n\t\t\tif(s[0]=='+' && s[1]=='x') q.x++;\n\t\t\tif(s[0]=='-' && s[1]=='x') q.x--;\n\t\t\tif(s[0]=='+' && s[1]=='y') q.y++;\n\t\t\tif(s[0]=='-' && s[1]=='y') q.y--;\n\t\t\tif(s[0]=='+' && s[1]=='z') q.z++;\n\t\t\tif(s[0]=='-' && s[1]=='z') q.z--;\n\t\t\tK.E[K.n++]=(edge){p,q};\n\t\t\tp=q;\n\t\t}\n\t}\n\n\treturn K;\n}\n\nstruct matrix{\n\tint a[3][3];\n\n\tpoint operator*(const point &p)const{\n\t\tint x=a[0][0]*p.x+a[0][1]*p.y+a[0][2]*p.z;\n\t\tint y=a[1][0]*p.x+a[1][1]*p.y+a[1][2]*p.z;\n\t\tint z=a[2][0]*p.x+a[2][1]*p.y+a[2][2]*p.z;\n\t\treturn (point){x,y,z};\n\t}\n\n\tmatrix operator*(const matrix &A)const{\n\t\tmatrix B={};\n\t\trep(i,3) rep(j,3) rep(k,3) B.a[i][j]+=a[i][k]*A.a[k][j];\n\t\treturn B;\n\t}\n\n\tbool operator==(const matrix &A)const{\n\t\trep(i,3) rep(j,3) if(a[i][j]!=A.a[i][j]) return false;\n\t\treturn true;\n\t}\n};\n\nvector<matrix> R;\n\nbool issame(const key &K1,const key &K2){\n\tif(K1.n!=K2.n) return false;\n\n\tpoint shift1=K1.E[0].u;\n\tpoint dir1=K1.E[0].v-shift1;\n\trep(i,K2.n){\n\t\tpoint shift2,dir2;\n\t\trep(t,2){\n\t\t\tif(t==0) shift2=K2.E[i].u, dir2=K2.E[i].v-shift2;\n\t\t\tif(t==1) shift2=K2.E[i].v, dir2=K2.E[i].u-shift2;\n\n\t\t\trep(j,R.size()) if(R[j]*dir1==dir2) {\n\t\t\t\tbool ok=true;\n\t\t\t\trep(k,K1.n){\n\t\t\t\t\tedge e=K1.E[k];\n\t\t\t\t\te=(edge){e.u-shift1,e.v-shift1};\n\t\t\t\t\te=(edge){R[j]*e.u,R[j]*e.v};\n\t\t\t\t\te=(edge){e.u+shift2,e.v+shift2};\n\t\t\t\t\tif(count(K2.E,K2.E+K2.n,e)!=1){ ok=false; break; }\n\t\t\t\t}\n\t\t\t\tif(ok) return true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nint main(){\n\tmatrix I,X,Y,Z;\n\tI.a[0][0]= 1; I.a[0][1]= 0; I.a[0][2]= 0;\n\tI.a[1][0]= 0; I.a[1][1]= 1; I.a[1][2]= 0;\n\tI.a[2][0]= 0; I.a[2][1]= 0; I.a[2][2]= 1;\n\tX.a[0][0]= 1; X.a[0][1]= 0; X.a[0][2]= 0;\n\tX.a[1][0]= 0; X.a[1][1]= 0; X.a[1][2]=-1;\n\tX.a[2][0]= 0; X.a[2][1]= 1; X.a[2][2]= 0;\n\tY.a[0][0]= 0; Y.a[0][1]= 0; Y.a[0][2]=-1;\n\tY.a[1][0]= 0; Y.a[1][1]= 1; Y.a[1][2]= 0;\n\tY.a[2][0]= 1; Y.a[2][1]= 0; Y.a[2][2]= 0;\n\tZ.a[0][0]= 0; Z.a[0][1]=-1; Z.a[0][2]= 0;\n\tZ.a[1][0]= 1; Z.a[1][1]= 0; Z.a[1][2]= 0;\n\tZ.a[2][0]= 0; Z.a[2][1]= 0; Z.a[2][2]= 1;\n\n\tR.push_back(I);\n\twhile(1){\n\t\tbool change=false;\n\t\trep(i,R.size()){\n\t\t\trep(j,3){\n\t\t\t\tmatrix A=(j==0?X*R[i]:j==1?Y*R[i]:Z*R[i]);\n\t\t\t\tif(count(R.begin(),R.end(),A)==0){ R.push_back(A); change=true; }\n\t\t\t}\n\t\t}\n\t\tif(!change) break;\n\t}\n\n\twhile(1){\n\t\tkey K1=getkey(); if(K1.n==0) break;\n\t\tkey K2=getkey();\n\n\t\tputs(issame(K1,K2)?\"SAME\":\"DIFFERENT\");\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 820,
"score_of_the_acc": -0.2508,
"final_rank": 2
},
{
"submission_id": "aoj_1112_61602",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<set>\n#include<algorithm>\n#include<cstring>\n#include<cstdlib>\n#include<cmath>\n\n#define INF 1001\n\nusing namespace std;\n\nstruct point{\n\tint x,y,z;\n\tpoint():x(0),y(0),z(0){}\n\tbool operator <(const point &t)const{\n\t\tif( x < t.x ){\n\t\t\treturn true;\n\t\t}else if( x == t.x ){\n\t\t\tif( y < t.y ){\n\t\t\t\treturn true;\n\t\t\t}else if( y == t.y ){\n\t\t\t\tif( z < t.z ){\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\tvoid rot90arndX(){ int tz = z; z = -y; y = tz; }\n\tvoid rot90arndY(){ int tz = z; z = x; x = -tz; }\n\tvoid rot90arndZ(){ int tx = x; x = y; y = -tx; }\n};\n\nstruct strange_key{\n\tvector<point> vp;\n\n\tvoid rot90arndX(){\n\t\tfor(unsigned int i = 0; i < vp.size(); ++i){\n\t\t\tvp[i].rot90arndX();\n\t\t}\n\t}\n\tvoid rot90arndY(){\n\t\tfor(unsigned int i = 0; i < vp.size(); ++i){\n\t\t\tvp[i].rot90arndY();\n\t\t}\n\t}\n\tvoid rot90arndZ(){\n\t\tfor(unsigned int i = 0; i < vp.size(); ++i){\n\t\t\tvp[i].rot90arndZ();\n\t\t}\n\t}\n\n\tbool Same(strange_key &t){\n\t\tif( vp.size() != t.vp.size() )\n\t\t\treturn false;\n\n\t\tfor(int a = 0; a < 4; ++a){\n\t\t\tfor(int b = 0; b < 4; ++b){\n\t\t\t\tfor(int c = 0; c < 4; ++c){\n\t\t\t\t\tbool bSame = true;\n\t\t\t\t\tsort( vp.begin(), vp.end() );\n\t\t\t\t\tsort( t.vp.begin(), t.vp.end() );\n\t\t\t\t\t\n\t\t\t\t\tint dx = vp[0].x - t.vp[0].x;\n\t\t\t\t\tint dy = vp[0].y - t.vp[0].y;\n\t\t\t\t\tint dz = vp[0].z - t.vp[0].z;\n\t\t\t\t\t\n\t\t\t\t\tfor(unsigned int l = 1; l < vp.size() && bSame; ++l){\n\t\t\t\t\t\tif( dx != vp[l].x - t.vp[l].x )\n\t\t\t\t\t\t\tbSame = false;\n\t\t\t\t\t\tif( dy != vp[l].y - t.vp[l].y )\n\t\t\t\t\t\t\tbSame = false;\n\t\t\t\t\t\tif( dz != vp[l].z - t.vp[l].z )\n\t\t\t\t\t\t\tbSame = false;\n\t\t\t\t\t}\n\t\t\t\t\tif( bSame )\n\t\t\t\t\t\treturn true;\n\n\t\t\t\t\trot90arndX();\n\t\t\t\t}\n\t\t\t\trot90arndY();\n\t\t\t}\n\t\t\trot90arndZ();\n\t\t}\n\t\treturn false;\n\t}\n};\n\nvoid input_strange_key( istream &is, int n, strange_key &in ){\n\tif( is ){\n\t\tpoint now;\n\t\tbool val[51]={false,};\n\t\tvector<point> pos_mem(51);\n\t\t\n\t\tval[0]=true;\n\t\tfor(int i = 0; i < n; ++i){\n\t\t\tstring s;\n\t\t\t\n\t\t\tcin >> s;\n\t\t\tif( s[0] != '+' && s[0] != '-' ){\n\t\t\t\tint mem = atoi( s.c_str() );\n\t\t\t\tif( val[ mem ] ){\n\t\t\t\t\tnow = pos_mem[ mem ];\n\t\t\t\t}else{\n\t\t\t\t\tpos_mem[ mem ] = now;\n\t\t\t\t\tval[ mem ] = true;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tint progress = ( s[0] == '+' ? 2 : -2 );\n\t\t\t\tpoint next = now;\n\t\t\t\tswitch( s[1] ){\n\t\t\t\t\tcase 'x':\n\t\t\t\t\t\tnow.x += progress / 2;\n\t\t\t\t\t\tin.vp.push_back( now );\n\t\t\t\t\t\tnow.x += progress / 2;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'y':\n\t\t\t\t\t\tnow.y += progress / 2;\n\t\t\t\t\t\tin.vp.push_back( now );\n\t\t\t\t\t\tnow.y += progress / 2;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'z':\n\t\t\t\t\t\tnow.z += progress / 2;\n\t\t\t\t\t\tin.vp.push_back( now );\n\t\t\t\t\t\tnow.z += progress / 2;\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main(){\n\twhile( true ){\n\t\tint n1,n2;\n\t\tstrange_key a, b;\n\n\t\tcin>>n1;\n\t\tif( n1 == 0 )\n\t\t\tbreak;\n\t\tinput_strange_key( cin, n1, a );\n\t\tcin>>n2;\n\t\tinput_strange_key( cin, n2, b );\n\n\t\tif( a.Same( b ) )\n\t\t\tcout << \"SAME\\n\";\n\t\telse\n\t\t\tcout << \"DIFFERENT\\n\";\n\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_1112_61482",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<set>\n#include<algorithm>\n#include<cstring>\n#include<cstdlib>\n#include<cmath>\n\n#define INF 1001\n\nusing namespace std;\n\nstruct point{\n\tint x,y,z;\n\tpoint():x(0),y(0),z(0){}\n\tpoint(int x, int y, int z):x(x),y(y),z(z){}\n\tbool operator ==(const point &t)const{\n\t\tif( x == t.x && y == t.y && z == t.z )\n\t\t\treturn true;\n\t\treturn false;\n\t}\n\tbool operator <(const point &t)const{\n\t\tif( x < t.x ){\n\t\t\treturn true;\n\t\t}else if( x == t.x ){\n\t\t\tif( y < t.y ){\n\t\t\t\treturn true;\n\t\t\t}else if( y == t.y ){\n\t\t\t\tif( z < t.z ){\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\tvoid rot90arndX(){\n\t\tint tz = z; z = -y; y = tz;\n\t}\n\tvoid rot90arndY(){\n\t\tint tz = z; z = x; x = -tz;\n\t}\n\tvoid rot90arndZ(){\n\t\tint tx = x; x = y; y = -tx;\n\t}\n\tvoid set(int x, int y, int z){\n\t\tthis->x = x; this->y = y; this->z = z;\n\t}\n};\n\nostream &operator << (ostream &os, const point &t){\n\tos << '(' << t.x << ',' << t.y << ',' << t.z << ')';\n\treturn os;\n}\n\nstruct strange_key{\n\tvector<point> vp;\n\tvector<point> vcube;\n\n\tvoid rot90arndX(){\n\t\tfor(unsigned int i = 0; i < vp.size(); ++i){\n\t\t\tvp[i].rot90arndX();\n\t\t}\n\t\tfor(unsigned int i = 0; i < vcube.size(); ++i){\n\t\t\tvcube[i].rot90arndX();\n\t\t}\n\t}\n\tvoid rot90arndY(){\n\t\tfor(unsigned int i = 0; i < vp.size(); ++i){\n\t\t\tvp[i].rot90arndY();\n\t\t}\n\t\tfor(unsigned int i = 0; i < vcube.size(); ++i){\n\t\t\tvcube[i].rot90arndY();\n\t\t}\n\t}\n\tvoid rot90arndZ(){\n\t\tfor(unsigned int i = 0; i < vp.size(); ++i){\n\t\t\tvp[i].rot90arndZ();\n\t\t}\n\t\tfor(unsigned int i = 0; i < vcube.size(); ++i){\n\t\t\tvcube[i].rot90arndZ();\n\t\t}\n\t}\n\tvoid MoveToOrigin(int base){\n\t\tint dx = vcube[ base ].x;\n\t\tint dy = vcube[ base ].y;\n\t\tint dz = vcube[ base ].z;\n\t\t\n\t\tfor(unsigned int i = 0; i < vcube.size(); ++i){\n\t\t\tvcube[i].x -= dx;\n\t\t\tvcube[i].y -= dy;\n\t\t\tvcube[i].z -= dz;\n\t\t}\n\t\tfor(unsigned int i = 0; i < vp.size(); ++i){\n\t\t\tvp[i].x -= dx;\n\t\t\tvp[i].y -= dy;\n\t\t\tvp[i].z -= dz;\n\t\t}\n\t}\n\tbool Same(strange_key &t){\n\t\tif( vp.size() != t.vp.size() )\n\t\t\treturn false;\n\n\t\tfor(int a = 0; a < 4; ++a){\n\t\t\tfor(int b = 0; b < 4; ++b){\n\t\t\t\tfor(int c = 0; c < 4; ++c){\n\t\t\t\t\tfor(unsigned int l = 0; l < vcube.size(); ++l){\n\t\t\t\t\t\tthis->MoveToOrigin( l );\n\t\t\t\t\t\tfor(unsigned int m = 0; m < vcube.size(); ++m){\n\t\t\t\t\t\t\tbool bSame = true;\n\t\t\t\t\t\t\tt.MoveToOrigin( m );\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tsort( vp.begin(), vp.end() );\n\t\t\t\t\t\t\tsort( t.vp.begin(), t.vp.end() );\n\n\t\t\t\t\t\t\tfor(unsigned int n = 0; n < vp.size(); ++n){\n\t\t\t\t\t\t\t\tif( !(vp[n] == t.vp[n]) ){\n\t\t\t\t\t\t\t\t\tbSame = false;\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\t\n\t\t\t\t\t\t\t/*\n\t\t\t\t\t\t\tcout << \"Key Expression:\";\n\t\t\t\t\t\t\tfor(set<point>::iterator it = sp.begin(); it != sp.end(); ++it){\n\t\t\t\t\t\t\t\tcout << *it << ' ';\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcout << \"\\nKey Expression:\";\n\t\t\t\t\t\t\tfor(set<point>::iterator it = t.sp.begin(); it != t.sp.end(); ++it){\n\t\t\t\t\t\t\t\tcout << *it << ' ';\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcout << \"\\n--------------------\\n\";\n\t\t\t\t\t\t\t*/\n\n\t\t\t\t\t\t\tif( bSame )\n\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\trot90arndX();\n\t\t\t\t}\n\t\t\t\trot90arndY();\n\t\t\t}\n\t\t\trot90arndZ();\n\t\t}\n\t\treturn false;\n\t}\n};\n\nvoid input_strange_key( istream &is, int n, strange_key &in ){\n\tif( is ){\n\t\tpoint now;\n\t\tbool val[51]={false,};\n\t\tvector<point> pos_mem(51);\n\t\tint minx=INF, maxx=-INF, miny=INF, maxy=-INF, minz=INF, maxz=-INF;\n\t\t\n\t\tval[0]=true;\n\t\tfor(int i = 0; i < n; ++i){\n\t\t\tstring s;\n\t\t\t\n\t\t\tcin >> s;\n\t\t\tif( s[0] != '+' && s[0] != '-' ){\n\t\t\t\tint mem = atoi( s.c_str() );\n\t\t\t\tif( val[ mem ] ){\n\t\t\t\t\tnow = pos_mem[ mem ];\n\t\t\t\t}else{\n\t\t\t\t\tpos_mem[ mem ] = now;\n\t\t\t\t\tval[ mem ] = true;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tint progress = ( s[0] == '+' ? 2 : -2 );\n\t\t\t\tpoint next = now;\n\t\t\t\tswitch( s[1] ){\n\t\t\t\t\tcase 'x':\n\t\t\t\t\t\tnow.x += progress / 2;\n\t\t\t\t\t\tin.vp.push_back( now );\n\t\t\t\t\t\tnow.x += progress / 2;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'y':\n\t\t\t\t\t\tnow.y += progress / 2;\n\t\t\t\t\t\tin.vp.push_back( now );\n\t\t\t\t\t\tnow.y += progress / 2;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'z':\n\t\t\t\t\t\tnow.z += progress / 2;\n\t\t\t\t\t\tin.vp.push_back( now );\n\t\t\t\t\t\tnow.z += progress / 2;\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tminx = std::min( minx, now.x ); maxx = std::max( maxx, now.x );\n\t\t\tminy = std::min( miny, now.y ); maxy = std::max( maxy, now.y );\n\t\t\tminz = std::min( minz, now.z ); maxz = std::max( maxz, now.z );\n\t\t}\n\t\tin.vcube.push_back( point( minx, miny, minz ) );\n\t\tin.vcube.push_back( point( minx, miny, maxz ) );\n\t\tin.vcube.push_back( point( minx, maxy, minz ) );\n\t\tin.vcube.push_back( point( minx, maxy, maxz ) );\n\t\tin.vcube.push_back( point( maxx, miny, minz ) );\n\t\tin.vcube.push_back( point( maxx, miny, maxz ) );\n\t\tin.vcube.push_back( point( maxx, maxy, minz ) );\n\t\tin.vcube.push_back( point( maxx, maxy, maxz ) );\n\t}\n}\n\n\nostream &operator << (ostream &os, const strange_key &t){\n\tos << \"Key Expression:\\n\";\n\tfor(unsigned int i = 0; i < t.vp.size(); ++i){\n\t\tif( i != 0 )\n\t\t\tos << ' ';\n\t\tos << t.vp[i];\n\t}\n\treturn os;\n}\n\nint main(){\n\twhile( true ){\n\t\tint n1,n2;\n\t\tstrange_key a, b;\n\n\t\tcin>>n1;\n\t\tif( n1 == 0 )\n\t\t\tbreak;\n\t\tinput_strange_key( cin, n1, a );\n\t\tcin>>n2;\n\t\tinput_strange_key( cin, n2, b );\n\n\t\tif( a.Same( b ) )\n\t\t\tcout << \"SAME\\n\";\n\t\telse\n\t\t\tcout << \"DIFFERENT\\n\";\n\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 928,
"score_of_the_acc": -0.5461,
"final_rank": 8
},
{
"submission_id": "aoj_1112_60866",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\n#include<set>\n#include<algorithm>\nusing namespace std;\n#define rep(i, n) for ( int i = 0; i < (int)n; i++)\n\nclass Point{\n public:\n int x, y, z;\n Point(int x=0, int y=0, int z=0):x(x), y(y), z(z){}\n bool operator < ( const Point &p) const{\n\tif ( x != p.x ) return x < p.x;\n\tif ( y != p.y ) return y < p.y;\n\tif ( z != p.z ) return z < p.z;\n\treturn false;\n }\n bool operator == ( const Point &p ) const {\n\treturn x == p.x && y == p.y && z == p.z;\n }\n};\n\nclass Edge{\n public:\n Point p[2];\n Edge(){}\n Edge(Point p1, Point p2){\n\tp[0] = p1; p[1] = p2; sort(p, p+2);\n }\n bool operator < ( const Edge &e ) const{\n\tif ( !(p[0] == e.p[0]) ) return p[0] < e.p[0];\n\tif ( !(p[1] == e.p[1]) ) return p[1] < e.p[1];\n\treturn false;\n }\n};\n\nclass Key{\n public:\n set<Edge> E;\n vector<Edge> EV;\n Key(){}\n void make( int n ){\n\tstring com;\n\tE.clear();\n\tPoint pre = Point(0, 0, 0);\n\tbool V[60];\n\trep(i, 60) V[i] = false;\n\tPoint L[60];\n\trep(i, n){\n\t cin >> com;\n\t Point cur = pre;\n\t if ( isdigit(com[0])){\n\t\tint p = atoi(com.c_str());\n\t\tif ( V[p] ){\n\t\t pre = L[p];\n\t\t} else {\n\t\t V[p] = true;\n\t\t L[p] = pre;\n\t\t}\n\t } else {\n\t\tif ( com == \"+x\" ) cur.x++;\n\t\telse if ( com == \"-x\" ) cur.x--;\n\t\telse if ( com == \"+y\" ) cur.y++;\n\t\telse if ( com == \"-y\" ) cur.y--;\n\t\telse if ( com == \"+z\" ) cur.z++;\n\t\telse if ( com == \"-z\" ) cur.z--;\n\t\tE.insert(Edge(pre, cur));\n\t\tpre = cur;\n\t }\n\t}\n\tfor ( set<Edge>::iterator it = E.begin(); it != E.end(); it++ ) EV.push_back(*it);\n }\n Point move(){\n\tPoint p = (1000, 1000, 1000);\n\tfor ( int i = 0; i < EV.size(); i++ ) sort(EV[i].p, EV[i].p+2);\n\tsort( EV.begin(), EV.end() );\n\tp = EV[0].p[0];\n\n\tfor ( int i = 0; i < EV.size(); i++ ){\n\t for ( int j = 0; j < 2; j++ ){\n\t\tEV[i].p[j].x -= p.x;\n\t\tEV[i].p[j].y -= p.y;\n\t\tEV[i].p[j].z -= p.z;\n\t }\n\t}\n }\n\n void roll_x(){\n\tfor ( int i = 0; i < EV.size(); i++ ){\n\t for ( int j = 0; j < 2; j++ ){\n\t\tint tmp = EV[i].p[j].y;\n\t\tEV[i].p[j].y = EV[i].p[j].z*(-1);\n\t\tEV[i].p[j].z = tmp;\n\t }\n\t}\n }\n void roll_y(){\n\tfor ( int i = 0; i < EV.size(); i++ ){\n\t for ( int j = 0; j < 2; j++ ){\n\t\tint tmp = EV[i].p[j].x;\n\t\tEV[i].p[j].x = EV[i].p[j].z*(-1);\n\t\tEV[i].p[j].z = tmp;\n\t }\n\t}\n }\n void roll_z(){\n\tfor ( int i = 0; i < EV.size(); i++ ){\n\t for ( int j = 0; j < 2; j++ ){\n\t\tint tmp = EV[i].p[j].x;\n\t\tEV[i].p[j].x = EV[i].p[j].y;\n\t\tEV[i].p[j].y = tmp*(-1);\n\t }\n\t}\n }\n};\n\nbool equals(Key key1, Key key2 ){\n for ( int i = 0; i < key1.EV.size(); i++ ) sort( key1.EV[i].p, key1.EV[i].p+2);\n sort(key1.EV.begin(), key1.EV.end());\n for ( int i = 0; i < key1.EV.size(); i++ ){\n\tfor ( int j = 0; j < 2; j++ ){\n\t if ( !(key1.EV[i].p[j] == key2.EV[i].p[j]) ) return false;\n\t}\n }\n return true;\n}\n\nbool check(Key key1, Key key2){\n if ( key1.EV.size() != key2.EV.size() ) return false;\n for ( int i = 0; i < key2.EV.size(); i++ ) sort( key2.EV[i].p, key2.EV[i].p+2);\n sort(key2.EV.begin(), key2.EV.end());\n key2.move();\n Key target;\n \n rep(i, 6){\n\trep(j, 4){\n\t target = key1;\n\t target.move();\n\t if ( equals(target, key2) ) return true;\t \n\t key1.roll_z();\n\t}\n\tif ( i % 2 == 0 ) key1.roll_y();\n\telse key1.roll_x();\n }\n\n return false;\n}\n\nmain(){\n int n;\n while(1){\n\tKey key1, key2;\n\tcin >> n;\n\tif ( n == 0 ) break;\n\tkey1.make(n);\n\tcin >> n;\n\tkey2.make(n);\n\tif ( check(key1, key2) ) cout << \"SAME\" << endl;\n\telse cout << \"DIFFERENT\" << endl;\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1040,
"score_of_the_acc": -0.3261,
"final_rank": 3
}
] |
aoj_1116_cpp
|
Jigsaw Puzzles for Computers
Ordinary Jigsaw puzzles are solved with visual hints;
players solve a puzzle with the picture which the puzzle shows on finish,
and the diverse patterns of pieces.
Such Jigsaw puzzles may be suitable for human players,
because they require abilities of pattern recognition and imagination.
On the other hand,
"Jigsaw puzzles" described below may be just the things for
simple-minded computers.
As shown in
Figure 1
,
a puzzle is composed of nine square pieces, and each of the four edges
of a piece is labeled with one of the following eight symbols:
"R", "G", "B", "W", "r", "g", "b"
, and
"w".
Figure 1
: The nine pieces of a puzzle
In a completed puzzle, the nine pieces are arranged in a 3 x 3 grid,
and each of the 12 pairs of edges facing each other
must be labeled with one of the
following four combinations of symbols:
"R"
with
"r"
,
"G"
with
"g"
,
"B"
with
"b"
, and
"W"
with
"w"
.
For example, an edge labeled
"R"
can only face an edge with
"r"
.
Figure 2
is an example of a completed state of a puzzle.
In the figure, edges under this restriction are indicated by shadowing their labels.
The player can freely move and rotate the pieces, but cannot turn them over.
There are no symbols on the reverse side of a piece !
Figure 2
: A completed puzzle example
Each piece is represented by a sequence of the four symbols
on the piece, starting with the symbol of the top edge,
followed by the symbols of the right edge, the bottom edge,
and the left edge.
For example,
gwgW
represents the leftmost piece in
Figure 1
.
Note that the same piece can be represented as
wgWg
,
gWgw
or
Wgwg
since you can rotate it in 90, 180 or 270 degrees.
The mission for you
is to create a program which counts the number
of solutions.
It is needless to say that these numbers must be multiples of four,
because, as shown in
Figure 3
,
a configuration created by rotating a solution in 90, 180 or 270 degrees
is also a solution.
Figure 3
: Four obvious variations for a completed puzzle
A term
"rotationally equal"
is defined; if two different pieces are
identical when one piece is rotated (in 90, 180 or 270 degrees),
they are rotationally equal. For example,
WgWr
and
WrWg
are rotationally equal.
Another term
"rotationally symmetric"
is defined; if a piece is
rotationally equal to itself, it is rotationally symmetric.
For example, a piece
gWgW
is rotationally symmetric.
Given puzzles satisfy the following three conditions:
There is no identical pair of pieces in a puzzle.
There is no
rotationally equal
pair of pieces in a puzzle.
There is no
rotationally symmetric
piece in a puzzle.
Input
The input consists of multiple puzzles.
N
Puzzle
1
Puzzle
2
. . .
Puzzle
N
N
is the number of puzzles. Each
Puzzle
i
gives a puzzle with a single line
of 44 characters, consisting of four-character representations of the nine
pieces of the puzzle, separated by a space character.
For example, the following line represents the puzzle
in
Figure 1
.
gwgW RBbW GWrb GRRb BWGr Rbgw
...(truncated)
|
[
{
"submission_id": "aoj_1116_9630524",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(A) A.begin(),A.end()\nbool match(char a,char b){\n return abs(a-b)==32;\n}\nint f(string s,char a,char b){\n int res=0;\n REP(i,4)if(match(s[i],a)&&match(s[(i+1)%4],b))res++;\n return res;\n}\nint main(){\n ll N;cin>>N;\n while(N--){\n vector<string>S(9);\n REP(i,9)cin>>S[i];\n REP(i,9)reverse(ALL(S[i]));\n ll ans=0;\n sort(ALL(S));\n do{\n REP(i,4)if(match(S[0][0],S[1][i])){\n REP(j,4)if(match(S[0][1],S[2][j])){\n REP(k,4)if(match(S[0][2],S[3][k])){\n REP(l,4)if(match(S[0][3],S[4][l])){\n ans+=4*f(S[5],S[1][(i+1)%4],S[4][(l+3)%4])*f(S[6],S[2][(j+1)%4],S[1][(i+3)%4])*f(S[7],S[3][(k+1)%4],S[2][(j+3)%4])*f(S[8],S[4][(l+1)%4],S[3][(k+3)%4]);\n }\n }\n }\n }\n }while(next_permutation(ALL(S)));\n cout<<ans<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 410,
"memory_kb": 3340,
"score_of_the_acc": -1.196,
"final_rank": 15
},
{
"submission_id": "aoj_1116_9151404",
"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 auto match = [&](char c1, char c2) -> bool { return abs((int)c1 - (int)c2) == 32; };\n int q;\n cin >> q;\n while (q--) {\n vector<string> s(9);\n for (int i = 0; i < 9; ++i) {\n cin >> s[i];\n }\n vector<string> v(9);\n auto dfs = [&](auto dfs, int i, int bit) -> int {\n if (i == 9) return 1;\n int res = 0;\n for (int j = 0; j < 9; ++j) {\n if ((1 << j) & bit) continue;\n for (int k = 0; k < 4; ++k) {\n string t = s[j].substr(k) + s[j].substr(0, k);\n if (i >= 3 and !match(t[0], v[i - 3][2])) continue;\n if (i % 3 and !match(t[1], v[i - 1][3])) continue;\n v[i] = t;\n res += dfs(dfs, i + 1, bit + (1 << j));\n }\n }\n return res;\n };\n cout << dfs(dfs, 0, 0) << \"\\n\";\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3156,
"score_of_the_acc": -0.944,
"final_rank": 13
},
{
"submission_id": "aoj_1116_7998466",
"code_snippet": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n\nchar piece[9][4];\nchar current[9][4];\nint is_using[9] = { 0 };\n\nint tryJigsaw( int num )\n{\n if( num == 9 ) return 1;\n\n int count = 0;\n for( int i = 0; i < 9; i++ )\n {\n if( is_using[i] ) continue;\n for( int j = 0; j < 4; j++ )\n {\n if( num > 2 && abs( current[num - 3][2] - piece[i][( 0 + j ) % 4] ) != 32 ) continue;\n if( num % 3 != 0 && abs( current[num - 1][1] - piece[i][( 3 + j ) % 4] ) != 32 ) continue;\n\n for( int k = 0; k < 4; k++ )\n {\n current[num][k] = piece[i][( j + k ) % 4];\n }\n is_using[i] = 1;\n count += tryJigsaw( num + 1 );\n is_using[i] = 0;\n for( int k = 0; k < 4; k++ )\n {\n current[num][k] = '.';\n }\n }\n }\n\n return count;\n}\n\nint main( void )\n{\n int N;\n scanf( \"%d\", &N );\n\n while( N-- > 0 )\n {\n for( int i = 0; i < 9; i++ )\n {\n scanf( \"%s\", piece[i] );\n }\n for( int k = 0; k < 9; k++ )\n {\n for( int i = 0; i < 4; i++ )\n {\n current[k][i] = '.';\n }\n }\n\n printf( \"%d\\n\", tryJigsaw( 0 ) );\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2792,
"score_of_the_acc": -0.7434,
"final_rank": 8
},
{
"submission_id": "aoj_1116_6006852",
"code_snippet": "#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nstring puzzle[9];\nint ans;\n\nchar ToLower(char c)\n{\n\tif (c >= 97 && c <= 122)\n\t\treturn c;\n\treturn char(c + 32);\n}\nchar GetLabel(string puzzle, int rotateD, int dir)\n{\n\treturn puzzle[(rotateD / 90 + dir) % 4];\n}\nvector<int> TryMatch(string puzzle,char upLabel,char leftLabel)\n{\n\tvector<int> result;\n\tfor (int d = 0; d < 360; d += 90)\n\t{\n\t\tchar upL = GetLabel(puzzle, d, 0);\n\t\tchar LeftL = GetLabel(puzzle, d, 3);\n\t\tif (upL != upLabel && (ToLower(upL) == ToLower(upLabel) || upLabel == ' ') &&\n\t\t\tLeftL != leftLabel && (ToLower(LeftL) == ToLower(leftLabel) || leftLabel == ' '))\n\t\t\tresult.push_back(d);\n\t}\n\n\treturn result;\n}\n\nvoid DP(vector<pair<int,int>>& crtPuzzle)\n{\n\tint crtIndex = crtPuzzle.size();\n\tif (crtIndex == 9)\n\t{\n\t\tans++;\n\t\treturn;\n\t}\n\n\tchar upLabel = ' ';\n\tif (crtIndex / 3 > 0)\n\t{\n\t\tpair<int, int> p = crtPuzzle[crtIndex - 3];\n\t\tupLabel = GetLabel(puzzle[p.first], p.second, 2);\n\t}\n\tchar leftLabel = ' ';\n\tif (crtIndex % 3 != 0)\n\t{\n\t\tpair<int, int> p = crtPuzzle[crtIndex - 1];\n\t\tleftLabel = GetLabel(puzzle[p.first], p.second, 1);\n\t}\n\n\tbool used[9];\n\tfill(used, used + 9, false);\n\tfor (auto& p : crtPuzzle)\n\t\tused[p.first] = true;\n\tfor (int i = 0; i < 9; i++)\n\t{\n\t\tif (used[i]) continue;\n\t\tvector<int> ds = TryMatch(puzzle[i], upLabel, leftLabel);\n\t\tfor (int d : ds)\n\t\t{\n\t\t\tcrtPuzzle.push_back(make_pair(i, d));\n\t\t\tDP(crtPuzzle);\n\t\t\tcrtPuzzle.pop_back();\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint N;\n\tcin >> N;\n\twhile (N-- != 0)\n\t{\n\t\tans = 0;\n\t\tfor (int i = 0; i < 9; i++)\n\t\t\tcin >> puzzle[i];\n\t\tvector<pair<int, int>> crtPuzzle;\n\t\tDP(crtPuzzle);\n\t\tcout << ans << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 90,
"memory_kb": 3296,
"score_of_the_acc": -1.0146,
"final_rank": 14
},
{
"submission_id": "aoj_1116_4776783",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nbool used[9];\nstring p[9];\nstring piece_str[9];\nstring rot(string s){\n return s[3] + s.substr(0, 3);\n}\nbool match(char a, char b){\n return max(a, b) -min(a, b) == 32;\n}\nint solve(int a){\n if(a == 9) return 1;\n int res = 0;\n for(int i=0; i<9; i++){\n if(used[i]) continue;\n string s = p[i];\n for(int d=0; d<4; d++, s=rot(s)){\n bool ok = true;\n if(a>=3 and !match(s[0], piece_str[a-3][2])) ok = false;\n if(a%3!=0 and !match(s[1], piece_str[a-1][3])) ok = false;\n if(!ok) continue;\n piece_str[a] = s;\n used[i] = true;\n res += solve(a + 1);\n used[i] = false;\n }\n }\n return res;\n}\n\nint main(){\n int nt;\n cin >> nt;\n for(int rep=0; rep<nt; rep++){\n for(int i=0; i<9; i++){\n cin >> p[i];\n }\n cout << solve(0) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 640,
"memory_kb": 3152,
"score_of_the_acc": -1.2235,
"final_rank": 16
},
{
"submission_id": "aoj_1116_4578457",
"code_snippet": "#include <cstdio>\n#include <algorithm>\n\nusing namespace std;\n\nchar grid[5][5][4];\nchar puzzles[9][7];\nbool mask[5][5]={\n {1,1,1,1,1},\n {1,0,0,0,1},\n {1,0,0,0,1},\n {1,0,0,0,1},\n {1,1,1,1,1}\n};\n\nconst int diff=abs('A'-'a');\n\nint solve(int pos,int comb){\n // printf(\"pos=%d\\n\",pos);\n if (pos>=9) return 1;\n int x=pos%3+1,y=pos/3+1;\n int ret=0;\n\n //全てのパズルを試す\n for(int pid=0;pid<9;pid++){\n if ((1<<pid)&comb) continue;\n // printf(\"pid=%d\\n\",pid);\n const auto &pz=puzzles[pid];\n\n //パズルを回す\n for(int r=0;r<4;r++){\n if (!mask[x-1][y]&&abs(grid[x-1][y][2]-pz[r])!=diff) continue;\n if (!mask[x][y-1]&&abs(grid[x][y-1][3]-pz[(r+1)%4])!=diff) continue;\n // puts(\"rot\");\n for(int i=0;i<4;i++) grid[x][y][i]=pz[(r+i)%4];\n ret+=solve(pos+1,comb|(1<<pid));\n }\n\n }\n\n return ret;\n}\n\nint main(){\n\n int n;\n scanf(\"%d\",&n);\n for(int i=0;i<n;i++){\n for(int i=0;i<9;i++) scanf(\"%5s\",puzzles+i);\n // for(int i=0;i<9;i++) printf(\"%s\\n\",puzzles+i);\n printf(\"%d\\n\",solve(0,0));\n\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2580,
"score_of_the_acc": -0.6442,
"final_rank": 6
},
{
"submission_id": "aoj_1116_2631896",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) FOR(i,0,n)\n#define pb push_back\n#define mp make_pair\ntypedef long long ll;\ntypedef pair<int,int> pint;\n\nstring p[9],m[9];\nbool used[9];\nint dfs(int cnt){\n int ret=0;\n if(cnt==9) return 1;\n rep(i,9){\n if(used[i]) continue;\n rep(j,4){\n if(cnt>0&&cnt%3==0){\n if(abs(m[cnt-3][2]-p[i][j])!=32) continue;\n }\n else if(cnt>2&&cnt%3!=0){\n if(abs(m[cnt-3][2]-p[i][j])!=32||abs(m[cnt-1][1]-p[i][(j+3)%4])!=32) continue;\n }\n else if(cnt<3&&cnt>0){\n if(abs(m[cnt-1][1]-p[i][(j+3)%4])!=32) continue;\n }\n used[i]=true;\n string rp=p[i];\n rotate_copy(p[i].begin(),p[i].begin()+j,p[i].end(),rp.begin());\n m[cnt]=rp;\n ret +=dfs(cnt+1);\n used[i]=false;\n }\n }\n return ret;\n}\nint main(){\n int n;\n cin>>n;\n while(n--){\n rep(i,9) cin>>p[i];\n cout<<dfs(0)<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3140,
"score_of_the_acc": -0.9214,
"final_rank": 12
},
{
"submission_id": "aoj_1116_2484338",
"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\nenum Loc{\n\tTop,\n\tRight,\n\tUnder,\n\tLeft,\n};\n\nenum Roll{\n\tr_0,\n\tr_90,\n\tr_180,\n\tr_270,\n};\n\nRoll roll_type[4] = {r_0,r_90,r_180,r_270};\n\nstruct Data{\n\tint data_id;\n\tRoll roll;\n};\n\nstruct Info{\n\tint next_loc;\n\tbool check[9];\n\tData table[3][3];\n};\n\nvoid copyInfo(Info from,Info& to){\n\tfor(int i = 0; i < 9; i++)to.check[i] = from.check[i];\n\tfor(int i = 0; i < 3; i++){\n\t\tfor(int k = 0; k < 3; k++){\n\t\t\tto.table[i][k].data_id = from.table[i][k].data_id;\n\t\t\tto.table[i][k].roll = from.table[i][k].roll;\n\t\t}\n\t}\n}\n\nint N,ans;\nchar data[9][4];\n\nbool isMatch(char left,char right){\n\n\tif(left > right){\n\t\tswap(left,right);\n\t}\n\n\tif(left == 'R' && right == 'r'){\n\t\treturn true;\n\t}else if(left == 'G' && right == 'g'){\n\t\treturn true;\n\t}else if(left == 'B' && right == 'b'){\n\t\treturn true;\n\t}else if(left == 'W' && right == 'w'){\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nchar getWord(int data_id,Roll roll,Loc loc){\n\n\tswitch(roll){\n\tcase r_0:\n\t\tswitch(loc){\n\t\tcase Top:\n\t\t\treturn data[data_id][Top];\n\t\tcase Right:\n\t\t\treturn data[data_id][Right];\n\t\tcase Under:\n\t\t\treturn data[data_id][Under];\n\t\tcase Left:\n\t\t\treturn data[data_id][Left];\n\t\t}\n\t\tbreak;\n\tcase r_90:\n\t\tswitch(loc){\n\t\tcase Top:\n\t\t\treturn data[data_id][Left];\n\t\tcase Right:\n\t\t\treturn data[data_id][Top];\n\t\tcase Under:\n\t\t\treturn data[data_id][Right];\n\t\tcase Left:\n\t\t\treturn data[data_id][Under];\n\t\t}\n\t\tbreak;\n\tcase r_180:\n\t\tswitch(loc){\n\t\tcase Top:\n\t\t\treturn data[data_id][Under];\n\t\tcase Right:\n\t\t\treturn data[data_id][Left];\n\t\tcase Under:\n\t\t\treturn data[data_id][Top];\n\t\tcase Left:\n\t\t\treturn data[data_id][Right];\n\t\t}\n\t\tbreak;\n\tcase r_270:\n\t\tswitch(loc){\n\t\tcase Top:\n\t\t\treturn data[data_id][Right];\n\t\tcase Right:\n\t\t\treturn data[data_id][Under];\n\t\tcase Under:\n\t\t\treturn data[data_id][Left];\n\t\tcase Left:\n\t\t\treturn data[data_id][Top];\n\t\t}\n\t\tbreak;\n\t}\n\treturn 'X'; //must not reach here\n}\n\n\nvoid recursive(Info info){\n\n\tif(info.next_loc == 9){\n\t\tans++;\n\t\treturn;\n\t}\n\n\tfor(int i = 0; i < 9; i++){\n\t\tif(info.check[i] == false){\n\n\t\t\tswitch(info.next_loc){\n\t\t\tcase 1:\n\t\t\t\tfor(int k = 0; k < 4; k++){\n\t\t\t\t\tif(isMatch(data[info.table[1][1].data_id][Top],getWord(i,roll_type[k],Under))){\n\t\t\t\t\t\tInfo new_info;\n\t\t\t\t\t\tcopyInfo(info,new_info);\n\t\t\t\t\t\tnew_info.check[i] = true;\n\t\t\t\t\t\tnew_info.table[0][1].data_id = i;\n\t\t\t\t\t\tnew_info.table[0][1].roll = roll_type[k];\n\t\t\t\t\t\tnew_info.next_loc = info.next_loc+1;\n\t\t\t\t\t\trecursive(new_info);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tfor(int k = 0; k < 4; k++){\n\t\t\t\t\tif(isMatch(data[info.table[1][1].data_id][Right],getWord(i,roll_type[k],Left))){\n\t\t\t\t\t\tInfo new_info;\n\t\t\t\t\t\tcopyInfo(info,new_info);\n\t\t\t\t\t\tnew_info.check[i] = true;\n\t\t\t\t\t\tnew_info.table[1][2].data_id = i;\n\t\t\t\t\t\tnew_info.table[1][2].roll = roll_type[k];\n\t\t\t\t\t\tnew_info.next_loc = info.next_loc+1;\n\t\t\t\t\t\trecursive(new_info);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tfor(int k = 0; k < 4; k++){\n\t\t\t\t\tif(isMatch(data[info.table[1][1].data_id][Under],getWord(i,roll_type[k],Top))){\n\t\t\t\t\t\tInfo new_info;\n\t\t\t\t\t\tcopyInfo(info,new_info);\n\t\t\t\t\t\tnew_info.check[i] = true;\n\t\t\t\t\t\tnew_info.table[2][1].data_id = i;\n\t\t\t\t\t\tnew_info.table[2][1].roll = roll_type[k];\n\t\t\t\t\t\tnew_info.next_loc = info.next_loc+1;\n\t\t\t\t\t\trecursive(new_info);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\tfor(int k = 0; k < 4; k++){\n\t\t\t\t\tif(isMatch(data[info.table[1][1].data_id][Left],getWord(i,roll_type[k],Right))){\n\t\t\t\t\t\tInfo new_info;\n\t\t\t\t\t\tcopyInfo(info,new_info);\n\t\t\t\t\t\tnew_info.check[i] = true;\n\t\t\t\t\t\tnew_info.table[1][0].data_id = i;\n\t\t\t\t\t\tnew_info.table[1][0].roll = roll_type[k];\n\t\t\t\t\t\tnew_info.next_loc = info.next_loc+1;\n\t\t\t\t\t\trecursive(new_info);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 5:\n\t\t\t\tfor(int k = 0; k < 4; k++){\n\t\t\t\t\tif(isMatch(getWord(info.table[0][1].data_id,info.table[0][1].roll,Right),getWord(i,roll_type[k],Left)) == true &&\n\t\t\t\t\t\t\tisMatch(getWord(info.table[1][2].data_id,info.table[1][2].roll,Top),getWord(i,roll_type[k],Under)) == true){\n\t\t\t\t\t\tInfo new_info;\n\t\t\t\t\t\tcopyInfo(info,new_info);\n\t\t\t\t\t\tnew_info.check[i] = true;\n\t\t\t\t\t\tnew_info.table[0][2].data_id = i;\n\t\t\t\t\t\tnew_info.table[0][2].roll = roll_type[k];\n\t\t\t\t\t\tnew_info.next_loc = info.next_loc+1;\n\t\t\t\t\t\trecursive(new_info);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 6:\n\t\t\t\tfor(int k = 0; k < 4; k++){\n\t\t\t\t\tif(isMatch(getWord(info.table[1][2].data_id,info.table[1][2].roll,Under),getWord(i,roll_type[k],Top)) == true &&\n\t\t\t\t\t\t\tisMatch(getWord(info.table[2][1].data_id,info.table[2][1].roll,Right),getWord(i,roll_type[k],Left)) == true){\n\t\t\t\t\t\tInfo new_info;\n\t\t\t\t\t\tcopyInfo(info,new_info);\n\t\t\t\t\t\tnew_info.check[i] = true;\n\t\t\t\t\t\tnew_info.table[2][2].data_id = i;\n\t\t\t\t\t\tnew_info.table[2][2].roll = roll_type[k];\n\t\t\t\t\t\tnew_info.next_loc = info.next_loc+1;\n\t\t\t\t\t\trecursive(new_info);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 7:\n\t\t\t\tfor(int k = 0; k < 4; k++){\n\t\t\t\t\tif(isMatch(getWord(info.table[2][1].data_id,info.table[2][1].roll,Left),getWord(i,roll_type[k],Right)) == true &&\n\t\t\t\t\t\t\tisMatch(getWord(info.table[1][0].data_id,info.table[1][0].roll,Under),getWord(i,roll_type[k],Top)) == true){\n\t\t\t\t\t\tInfo new_info;\n\t\t\t\t\t\tcopyInfo(info,new_info);\n\t\t\t\t\t\tnew_info.check[i] = true;\n\t\t\t\t\t\tnew_info.table[2][0].data_id = i;\n\t\t\t\t\t\tnew_info.table[2][0].roll = roll_type[k];\n\t\t\t\t\t\tnew_info.next_loc = info.next_loc+1;\n\t\t\t\t\t\trecursive(new_info);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 8:\n\t\t\t\tfor(int k = 0; k < 4; k++){\n\t\t\t\t\tif(isMatch(getWord(info.table[1][0].data_id,info.table[1][0].roll,Top),getWord(i,roll_type[k],Under)) == true &&\n\t\t\t\t\t\t\tisMatch(getWord(info.table[0][1].data_id,info.table[0][1].roll,Left),getWord(i,roll_type[k],Right)) == true){\n\t\t\t\t\t\tInfo new_info;\n\t\t\t\t\t\tcopyInfo(info,new_info);\n\t\t\t\t\t\tnew_info.check[i] = true;\n\t\t\t\t\t\tnew_info.table[0][0].data_id = i;\n\t\t\t\t\t\tnew_info.table[0][0].roll = roll_type[k];\n\t\t\t\t\t\tnew_info.next_loc = info.next_loc+1;\n\t\t\t\t\t\trecursive(new_info);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n}\n\nvoid func(){\n\n\tans = 0;\n\n\tchar buf[5];\n\n\tfor(int i = 0; i < 9; i++){\n\t\tscanf(\"%s\",buf);\n\n\t\tfor(int k = 0; k < 4; k++){\n\t\t\tdata[i][k] = buf[k];\n\t\t}\n\t}\n\n\tfor(int i = 0; i < 9; i++){\n\t\tInfo info;\n\t\tfor(int k = 0; k < 9; k++)info.check[k] = false;\n\t\tinfo.table[1][1].data_id = i;\n\t\tinfo.table[1][1].roll = r_0;\n\t\tinfo.check[i] = true;\n\t\tinfo.next_loc = 1;\n\t\trecursive(info);\n\t}\n\n\tprintf(\"%d\\n\",ans*4);\n}\n\nint main(){\n\n\tscanf(\"%d\",&N);\n\tfor(int i = 0; i < N; i++){\n\t\tfunc();\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 2700,
"score_of_the_acc": -0.7004,
"final_rank": 7
},
{
"submission_id": "aoj_1116_2241296",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\n\nchar s[9][5], t[3][3][5];\nint dx[]{ -1,0,1,0 }, dy[]{ 0,1,0,-1 };\nint cnt = 0;\nvoid dfs(int p) {\n\trep(i, 3)rep(j, 3) {\n\t\tif (t[i][j][0])continue;\n\t\trep(k, 4) {\n\t\t\trep(l, 4) {\n\t\t\t\tint nx = i + dx[l], ny = j + dy[l];\n\t\t\t\tif (nx < 0 || 3 <= nx || ny < 0 || 3 <= ny || !t[nx][ny][0])continue;\n\t\t\t\tif (abs(s[p][(l + k) % 4] - t[nx][ny][(l + 2) % 4]) != 'a' - 'A')goto g;\n\t\t\t}\n\t\t\tif (p == 8)cnt++;\n\t\t\telse {\n\t\t\t\trep(l, 4)t[i][j][l] = s[p][(l + k) % 4];\n\t\t\t\tdfs(p + 1); t[i][j][0] = 0;\n\t\t\t}g:;\n\t\t}\n\t}\n}\nint main() {\n\tint n; scanf(\"%d\", &n);\n\trep(i, n) {\n\t\trep(j, 9)scanf(\"%s\", s[j]);\n\t\tcnt = 0; dfs(0);\n\t\tprintf(\"%d\\n\", cnt);\n\t}\n}",
"accuracy": 1,
"time_ms": 1450,
"memory_kb": 3200,
"score_of_the_acc": -1.653,
"final_rank": 19
},
{
"submission_id": "aoj_1116_2241294",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\n\nchar s[9][5], t[3][3][5];\nint dx[]{ -1,0,1,0 }, dy[]{ 0,1,0,-1 };\nint dfs(int p) {\n\tint res = 0;\n\trep(i, 3)rep(j, 3) {\n\t\tif (t[i][j][0])continue;\n\t\trep(k, 4) {\n\t\t\trep(l, 4) {\n\t\t\t\tint nx = i + dx[l], ny = j + dy[l];\n\t\t\t\tif (nx < 0 || 3 <= nx || ny < 0 || 3 <= ny || !t[nx][ny][0])continue;\n\t\t\t\tif (abs(s[p][(l + k) % 4] - t[nx][ny][(l + 2) % 4]) != 'a' - 'A')goto g;\n\t\t\t}\n\t\t\tif (p == 8)res++;\n\t\t\telse {\n\t\t\t\trep(l, 4)t[i][j][l] = s[p][(l + k) % 4];\n\t\t\t\tres += dfs(p + 1); t[i][j][0] = 0;\n\t\t\t}g:;\n\t\t}\n\t}\n\treturn res;\n}\nint main() {\n\tint n; scanf(\"%d\", &n);\n\trep(i, n) {\n\t\trep(j, 9)scanf(\"%s\", s[j]);\n\t\tprintf(\"%d\\n\", dfs(0));\n\t}\n}",
"accuracy": 1,
"time_ms": 1410,
"memory_kb": 3224,
"score_of_the_acc": -1.6442,
"final_rank": 18
},
{
"submission_id": "aoj_1116_2241291",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\n\nchar s[9][5], t[3][3][5];\nint dx[]{ -1,0,1,0 }, dy[]{ 0,1,0,-1 };\nint dfs(int p) {\n\tint res = 0;\n\trep(i, 3)rep(j, 3) {\n\t\tif (t[i][j][0])continue;\n\t\trep(k, 4) {\n\t\t\trep(l, 4) {\n\t\t\t\tint nx = i + dx[l], ny = j + dy[l];\n\t\t\t\tif (nx < 0 || 3 <= nx || ny < 0 || 3 <= ny || !t[nx][ny][0])continue;\n\t\t\t\tif (abs(s[p][(l + k) % 4] - t[nx][ny][(l + 2) % 4]) != 'a' - 'A')goto g;\n\t\t\t}\n\t\t\tif (p == 8)res++;\n\t\t\telse {\n\t\t\t\trep(l, 4)t[i][j][l] = s[p][(l + k) % 4];\n\t\t\t\tres += dfs(p + 1); t[i][j][0] = 0;\n\t\t\t}g:;\n\t\t}\n\t}\n\treturn res;\n}\nint main() {\n\tint n; scanf(\"%d\", &n);\n\trep(i, n) {\n\t\trep(j, 9)cin >> s[j];\n\t\tprintf(\"%d\\n\", dfs(0));\n\t}\n}",
"accuracy": 1,
"time_ms": 1400,
"memory_kb": 3092,
"score_of_the_acc": -1.5774,
"final_rank": 17
},
{
"submission_id": "aoj_1116_2241289",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\n\nstring s[9], t[3][3];\nint dx[]{ -1,0,1,0 }, dy[]{ 0,1,0,-1 };\nint dfs(int p) {\n\tint res = 0;\n\trep(i, 3)rep(j, 3) {\n\t\tif (!t[i][j].empty())continue;\n\t\trep(k, 4) {\n\t\t\trep(l, 4) {\n\t\t\t\tint nx = i + dx[l], ny = j + dy[l];\n\t\t\t\tif (nx < 0 || 3 <= nx || ny < 0 || 3 <= ny || t[nx][ny].empty())continue;\n\t\t\t\tif (abs(s[p][(l + k) % 4] - t[nx][ny][(l + 2) % 4]) != 'a' - 'A')goto g;\n\t\t\t}\n\t\t\tif (p == 8)res++;\n\t\t\telse {\n\t\t\t\trep(l, 4)t[i][j] += s[p][(l + k) % 4];\n\t\t\t\tres += dfs(p + 1); t[i][j].clear();\n\t\t\t}g:;\n\t\t}\n\t}\n\treturn res;\n}\nint main() {\n\tint n; scanf(\"%d\", &n);\n\trep(i, n) {\n\t\trep(j, 9)cin >> s[j];\n\t\tprintf(\"%d\\n\", dfs(0));\n\t}\n}",
"accuracy": 1,
"time_ms": 2010,
"memory_kb": 3132,
"score_of_the_acc": -1.9026,
"final_rank": 20
},
{
"submission_id": "aoj_1116_2063785",
"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\nconst int dx[4] = { -1,0,1,0 };\nconst int dy[4] = { 0,1,0,-1 };\n\nint dfs(vector<vector<vector<int>>>&field, int nowx, int nowy,bitset<9>&used,const vector<vector<int>>&pieces) {\n\tif (nowy == 3)return 1;\n\telse {\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < 9; ++i) {\n\t\t\tif (!used[i]) {\n\t\t\t\tused[i] = true;\n\t\t\t\tvector<int>v(pieces[i]);\n\t\t\t\tfor (int way = 0; way < 4; ++way) {\n\t\t\t\t\trotate(v.begin(), v.begin() + 1, v.end());\n\t\t\t\t\tbool ok = true;\n\t\t\t\t\tif (nowx) {\n\t\t\t\t\t\tif (field[nowy][nowx - 1][2] + v[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 (nowy) {\n\t\t\t\t\t\tif (field[nowy - 1][nowx][1] + v[3]) {\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) {\n\t\t\t\t\t\tfield[nowy][nowx] = v;\n\t\t\t\t\t\tans += dfs(field, (nowx + 1) % 3, nowx == 2 ? nowy + 1 : nowy, used, pieces);\n\t\t\t\t\t\tfield[nowy][nowx].clear();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tused[i] = false;\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t}\n}\nint main() {\n\tint N; cin >> N;\n\tmap<int, int>mp;\n\tmp['W'] = 1;\n\tmp['R'] = 2;\n\tmp['G'] = 3;\n\tmp['B'] = 4;\n\tmp['w'] = -1;\n\tmp['r'] = -2;\n\tmp['g'] = -3;\n\tmp['b'] = -4;\n\twhile (N--) {\n\t\tvector<vector<int>>pieces(9);\n\t\tfor (int i = 0; i < 9; ++i) {\n\n\t\t\tstring st; cin >> st;\n\t\t\tfor (int j = 0; j < 4; ++j) {\n\t\t\t\tpieces[i].push_back(mp[st[j]]);\n\t\t\t}\n\t\t}\n\t\tbitset<9>used;\n\t\tvector<vector<vector<int>>>field(3, vector<vector<int>>(3));\n\t\tint ans = dfs(field, 0, 0, used, pieces);\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 3004,
"score_of_the_acc": -0.8728,
"final_rank": 10
},
{
"submission_id": "aoj_1116_1869906",
"code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \nchar p[3][3][4];\nchar pz[9][4];\n \nbool check(char a,char b){\n return (a-32 == b || b-32 == a);\n}\n \nint rec(int now,int S){\n if(now == 9) return 1;\n int res = 0;\n int X = now%3, Y = now/3;\n for(int s = 0 ; s < 9 ; s++){\n if(S >> s & 1) continue;\n for(int i = 0 ; i < 4 ; i++){\n for(int j = 0 ; j < 4 ; j++){\n p[Y][X][j] = pz[s][(i+j)%4];\n }\n bool can = true; \n if(X > 0 && !check(p[Y][X][0],p[Y][X-1][2])){\n can = false;\n }\n if(Y > 0 && !check(p[Y][X][1],p[Y-1][X][3])){\n can = false; \n }\n if(can) res += rec(now+1,S|(1<<s));\n }\n }\n return res;\n}\n \nint main(){\n int Tc;\n cin >> Tc;\n while(Tc--){\n for(int i = 0 ; i < 9 ; i++){\n for(int j = 0 ; j < 4 ; j++){\n cin >> pz[i][j];\n }\n }\n cout << rec(0,0) << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3004,
"score_of_the_acc": -0.8477,
"final_rank": 9
},
{
"submission_id": "aoj_1116_1838181",
"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>\n\n\nusing namespace std;\n\nint cnt;\n//vector<string> memo;\n\nchar tonum(char word) {\n\tif(word == 'R') return '1';\n\tif(word == 'G') return '2';\n\tif(word == 'B') return '3';\n\tif(word == 'W') return '4';\n\tif(word == 'r') return '5';\n\tif(word == 'g') return '6';\n\tif(word == 'b') return '7';\n\tif(word == 'w') return '8';\n\n\treturn '0';\n}\n\nvoid calc(int num, string rest, string ing) {\n\tstring bkup_r = rest;\n\tstring bkup_i = ing;\n\n\tif(num==9) {\n\t\tcnt++; return;\n\t}\n\n\tif(num == 0) {\n\t\tfor(int i=0; i<9; i++) {\n\t\t\tfor(int j=0; j<4; j++) {\n\t\t\t\ting.push_back(rest[j%4 + i*4]);\n\t\t\t\ting.push_back(rest[(j+1)%4 + i*4]);\n\t\t\t\ting.push_back(rest[(j+2)%4 + i*4]);\n\t\t\t\ting.push_back(rest[(j+3)%4 + i*4]);\n//\t\t\t\tif(find(memo.begin(), memo.end(), ing) != memo.end())\n//\t\t\t\t\treturn;\n//\t\t\t\telse {\n//\t\t\t\t\tmemo.push_back(ing); \n\t\t\t\t\tcalc(1, rest.erase(i*4, 4), ing); \n//\t\t\t\t}\n\t\t\t\trest = bkup_r;\n\t\t\t\ting = \"\";\n\t\t\t}\n\t\t}\n\t}\n\telse if(num<3) {\n\t\tfor(int i=0; i<rest.size(); i++) {\n\t\t\tif(abs((int)ing[2+(num-1)*4] - (int)rest[i]) == 4) {\n\t\t\t\ting.push_back(rest[i%4 + i/4*4]);\n\t\t\t\ting.push_back(rest[(i+1)%4 + i/4*4]);\n\t\t\t\ting.push_back(rest[(i+2)%4 + i/4*4]);\n\t\t\t\ting.push_back(rest[(i+3)%4 + i/4*4]);\n//\t\t\t\tif(find(memo.begin(), memo.end(), ing) != memo.end())\n//\t\t\t\t\treturn;\n//\t\t\t\telse {\n//\t\t\t\t\tmemo.push_back(ing); \n\t\t\t\t\tcalc(num+1, rest.erase(i/4*4, 4), ing); \n//\t\t\t\t}\n\t\t\t\trest = bkup_r;\n\t\t\t\ting = bkup_i;\n\t\t\t}\n\t\t}\n\t}\n\telse if(num%3 == 0) {\n\t\tfor(int i=0; i<rest.size(); i++) {\n\t\t\tif(abs((int)ing[3+(num-3)*4] - (int)rest[i]) == 4) {\n\t\t\t\ting.push_back(rest[(i+3)%4 + i/4*4]);\n\t\t\t\ting.push_back(rest[i%4 + i/4*4]);\n\t\t\t\ting.push_back(rest[(i+1)%4 + i/4*4]);\n\t\t\t\ting.push_back(rest[(i+2)%4 + i/4*4]);\n//\t\t\t\tif(find(memo.begin(), memo.end(), ing) != memo.end())\n//\t\t\t\t\treturn;\n//\t\t\t\telse {\n//\t\t\t\t\tmemo.push_back(ing); \n\t\t\t\t\tcalc(num+1, rest.erase(i/4*4, 4), ing); \n//\t\t\t\t}\n\t\t\t\trest = bkup_r;\n\t\t\t\ting = bkup_i;\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tfor(int i=0; i<rest.size(); i++) {\n\t\t\tif(abs((int)ing[2+(num-1)*4] - (int)rest[i]) == 4 &&\n\t\t\t\tabs((int)ing[3+(num-3)*4] - (int)rest[(i+1)%4 + i/4*4]) == 4) {\n\t\t\t\ting.push_back(rest[i%4 + i/4*4]);\n\t\t\t\ting.push_back(rest[(i+1)%4 + i/4*4]);\n\t\t\t\ting.push_back(rest[(i+2)%4 + i/4*4]);\n\t\t\t\ting.push_back(rest[(i+3)%4 + i/4*4]);\n//\t\t\t\tif(find(memo.begin(), memo.end(), ing) != memo.end())\n//\t\t\t\t\treturn;\n//\t\t\t\telse {\n//\t\t\t\t\tmemo.push_back(ing); \n\t\t\t\t\tcalc(num+1, rest.erase(i/4*4, 4), ing); \n//\t\t\t\t}\n\t\t\t\trest = bkup_r;\n\t\t\t\ting = bkup_i;\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main() {\n\tint n;\n\tchar input;\n\tstring pieces;\n\n\tcin >> n;\n\tfor(int t=0; t<n; t++) {\n//\t\t\tmemo.clear();\n\t\t\tpieces = \"\";\n\t\tfor(int i=0; i<36; i++) {\n\t\t\tcin >> input;\n\t\t\tpieces.push_back(tonum(input));\n\t\t}\n\t\tcnt = 0;\n\t\tcalc(0, pieces, \"\");\n\t\tcout << cnt << endl;\n\t}\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 120,
"memory_kb": 1236,
"score_of_the_acc": -0.0652,
"final_rank": 5
},
{
"submission_id": "aoj_1116_1819198",
"code_snippet": "#include <array>\n#include <algorithm>\n#include <bitset>\n#include <cstring>\n#include <cstdio>\n#include <cmath>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <string>\n#include <set>\n#include <stack>\n#include <vector>\n\nusing namespace std;\n\nint result = 0;\nchar Map[9][4];\nbool check[9];\nint t_map[3][3];\nint alf[256];\n// 0 1 2\n// 3 4 5\n// 6 7 8\nvoid rotate(int num){\n char c = Map[num][0];\n for(int i = 0;i < 3;i++){\n Map[num][i] = Map[num][i+1];\n }\n Map[num][3] = c;\n}\n\nvoid dfs(int num){\n if(num == 9)result++;\n else{\n for(int i = 0;i < 9;i++){\n if(check[i])continue;\n check[i] = true;\n t_map[num/3][num%3] = i;\n for(int j = 0;j < 4;j++){\n if(num / 3 > 0 && num % 3 > 0){\n if(alf[Map[t_map[num/3][num%3]][1]] == -alf[Map[t_map[num/3][(num%3)-1]][3]]\n && alf[Map[t_map[num/3][num%3]][0]] == -alf[Map[t_map[(num/3)-1][num%3]][2]])dfs(num+1);\n }else if(num / 3 > 0){\n if(alf[Map[t_map[num/3][num%3]][0]] == -alf[Map[t_map[(num/3)-1][num%3]][2]])dfs(num+1);\n }else if(num % 3 > 0){\n if(alf[Map[t_map[num/3][num%3]][1]] == -alf[Map[t_map[num/3][(num%3)-1]][3]])dfs(num+1);\n }else{\n dfs(num+1);\n }\n rotate(i);\n }\n check[i] = false;\n }\n }\n}\n\nint main(){\n alf['r'] = 1;alf['g'] = 2; alf['b'] = 3;alf['w'] = 4;\n alf['R'] = -1;alf['G'] = -2; alf['B'] = -3;alf['W'] = -4;\n int n;string str;\n cin >> n;\n for(int i = 0;i < n;i++){\n for(int j = 0;j < 9;j++){\n cin >> str;\n for(int k = 0;k < 4;k++){\n Map[j][k] = str[k];\n }\n }\n result = 0;\n dfs(0);\n cout << result << endl;\n }\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3132,
"score_of_the_acc": -0.9026,
"final_rank": 11
},
{
"submission_id": "aoj_1116_1552754",
"code_snippet": "#include <iostream>\n#include <cmath>\nusing namespace std;\nstring ps[10];\nchar mp[4][4][4];\nint ans,used[10];\nint dx[] = {1,2,3,1,2,3,1,2,3};\nint dy[] = {1,1,1,2,2,2,3,3,3};\n\nvoid saiki(int kai){\n if(kai == 9)ans++;\n else \n for(int i=0;i<9;i++) {\n if(used[i] == 1) continue;\n for(int j=0;j<4;j++){\n\tint flg =0;\n\tif(abs(ps[i][j]-mp[dy[kai]][dx[kai]-1][1]) == 'a'-'A'||mp[dy[kai]][dx[kai]-1][1] == 0) flg++;\n\tif(abs(ps[i][(j+1)%4]-mp[dy[kai]-1][dx[kai]][2]) == 'a'-'A'||mp[dy[kai]-1][dx[kai]][2] == 0) flg++;\n\tif(flg == 2) {\n\t for(int k=0;k<4;k++)mp[dy[kai]][dx[kai]][(3+k)%4] = ps[i][(j+k)%4];\n\t used[i] = 1;\n\t saiki(kai+1);\n\t used[i] = 0;\n\t for(int k=0;k<4;k++) mp[dy[kai]][dx[kai]][k] = 0;\n\t}\n }\n }\n}\n\nint main() {\n int q;\n cin >> q;\n while(q--) {\n for(int i=0;i<9;i++) cin >> ps[i];\n ans = 0;\n saiki(0);\n cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 1204,
"score_of_the_acc": -0.0201,
"final_rank": 4
},
{
"submission_id": "aoj_1116_1552350",
"code_snippet": "#include <iostream>\n#include <cmath>\n\nusing namespace std;\nvoid func(int);\nbool Check(char,char);\n\n\n\nchar board[4][4][4];\nchar data[9][4];\nbool used[9];\n\nint cnt;\n\nint main(){\n int n;\n\n string str;\n cin >> n;\n while(n){\n n--;\n\n for(int i=0;i<4;i++)\n for(int j=0;j<4;j++)\n\tfor(int k=0;k<4;k++)\n\t board[i][j][k]='X';\n\n\n for(int i=0;i<9;i++){\n used[i]=false;\n cin >> str;\n for(int j=0;j<4;j++){\n\tdata[i][j]=str[j];\n }\n }\n\n cnt=0;\n func(0);\n cout << cnt << endl;\n\n }\n return 0;\n}\n\n\n\n\nconst int dy[9]={1,1,1,2,2,2,3,3,3};\nconst int dx[9]={1,2,3,1,2,3,1,2,3};\n\nvoid func(int d){\n if(d==9){\n cnt++;\n return;\n }\n \n int y=dy[d],x=dx[d];\n for(int id=0;id<9;id++){\n if(used[id])continue;\n used[id]=true;\n\n for(int i=0;i<4;i++){\n\n for(int j=0;j<4;j++)board[y][x][j]=data[id][(i+j)%4];\n bool r1=Check(board[y-1][x][2],board[y][x][0]);\n bool r2=Check(board[y][x-1][1],board[y][x][3]);\n if(r1==true&&r2==true) func(d+1);\n \n }\n used[id]=false;\n }\n \n\n}\n\nbool Check(char a,char b){\n if(a=='X'||b=='X') return true;\n return (abs(a-b) == abs('A'-'a'));\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 1204,
"score_of_the_acc": -0.0151,
"final_rank": 3
},
{
"submission_id": "aoj_1116_1552302",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cmath>\nusing namespace std;\nchar mp[3][3][4];\nstring str[10];\nbool used[9];long long cnt,ans;\nvoid saiki2(int num){\n int ex[] ={0,0,2,2};\n int ey[] ={2,0,0,2};\n int tx[4][2] = {{1,0},{0,1},{-1,0},{0,-1}};\n int ty[4][2] = {{0,-1},{1,0},{0,1},{-1,0}};\n if(num == 4) ans++;\n else\n for(int i=0;i<9;i++){\n if(used[i] == 1) continue;\n for(int j=0;j<4;j++){\n\tint nx = ex[num]+tx[num][0];\n\tint nx2 = ex[num]+tx[num][1];\n\tint ny = ey[num]+ty[num][0];\n\tint ny2 = ey[num]+ty[num][1];\n\tif(abs(str[i][j] - mp[ny][nx][(num+3)%4])=='a'-'A' &&\n\t abs(str[i][(j+3)%4] - mp[ny2][nx2][(num+2)%4]) == 'a'-'A'){\n\t used[i] = 1;\n\t saiki2(num+1);\n\t used[i] = 0;\n\t}\t \n }\n }\n}\n\nvoid saiki(int num){\nint dx[] = {0,-1,0 ,1};\nint dy[] = {1,0,-1,0};\n if(num == 4) {\n saiki2(0);\n return;\n }\n for(int i=0;i<9;i++){\n if(used[i] == 1) continue;\n for(int j=0;j<4;j++)\n if(abs(mp[1][1][(num+2)%4] - str[i][j])=='a'-'A') {\n\tfor(int k=0;k<4;k++) mp[1+dy[num]][1+dx[num]][(k+num)%4] = str[i][(j+k)%4];\n\tused[i] = 1;\n\tsaiki(num+1);\n\tused[i] = 0;\n }\n }\n}\n\nint main(){\n int n;\n cin >> n;\n while(n--){\n ans = 0;\n for(int i=0;i<9;i++) cin >> str[i];\n for(int i=0;i<=9;i++){\n for(int j=0;j<4;j++) mp[1][1][j] = str[i][j];\n used[i] = 1;\n saiki(0);\n used[i] = 0;\n }\n cout << ans*4<<endl;\n }\n return 0; \n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1204,
"score_of_the_acc": -0.005,
"final_rank": 2
},
{
"submission_id": "aoj_1116_1552296",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cmath>\nusing namespace std;\nchar mp[3][3][4];\nstring str[10];\nbool used[9];long long cnt,ans;\nvoid saiki2(int num){\n int ex[] ={0,0,2,2};\n int ey[] ={2,0,0,2};\n int tx[4][2] = {{1,0},{0,1},{-1,0},{0,-1}};\n int ty[4][2] = {{0,-1},{1,0},{0,1},{-1,0}};\n if(num == 4) ans++;\n else\n for(int i=0;i<9;i++){\n if(used[i] == 1) continue;\n for(int j=0;j<4;j++){\n\tint nx = ex[num]+tx[num][0];\n\tint nx2 = ex[num]+tx[num][1];\n\tint ny = ey[num]+ty[num][0];\n\tint ny2 = ey[num]+ty[num][1];\n\tif(abs(str[i][j] - mp[ny][nx][(num+3)%4])=='a'-'A' &&\n\t abs(str[i][(j+3)%4] - mp[ny2][nx2][(num+2)%4]) == 'a'-'A'){\n\t \n\t used[i] = 1;\n\t saiki2(num+1);\n\t used[i] = 0;\n\t}\t \n }\n }\n}\n\nvoid saiki(int num){\nint dx[] = {0,-1,0 ,1};\nint dy[] = {1,0,-1,0};\n if(num == 4) {\n saiki2(0);\n return;\n }\n for(int i=0;i<9;i++){\n if(used[i] == 1) continue;\n for(int j=0;j<4;j++)\n if(abs(mp[1][1][(num+2)%4] - str[i][j])=='a'-'A') {\n\tfor(int k=0;k<4;k++) mp[1+dy[num]][1+dx[num]][(k+num)%4] = str[i][(j+k)%4];\n\tused[i] = 1;\n\tsaiki(num+1);\n\tused[i] = 0;\n }\n }\n}\n\nint main(){\n int n;\n cin >> n;\n while(n--){\n ans = 0;\n for(int i=0;i<9;i++) cin >> str[i];\n for(int i=0;i<=9;i++){\n for(int j=0;j<4;j++) mp[1][1][j] = str[i][j];\n used[i] = 1;\n saiki(0);\n used[i] = 0;\n }\n cout << ans*4<<endl;\n }\n return 0; \n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1208,
"score_of_the_acc": -0.0019,
"final_rank": 1
}
] |
aoj_1124_cpp
|
When Can We Meet?
The ICPC committee would like to have its meeting as soon as
possible to address every little issue of the next contest.
However, members of the committee are so busy maniacally developing
(possibly useless) programs that it is very difficult to arrange
their schedules for the meeting.
So, in order to settle the meeting date, the chairperson requested every
member to send back a list of convenient dates by E-mail.
Your mission is to help the chairperson, who is now dedicated to other
issues of the contest, by writing a program that
chooses the best date from the submitted lists.
Your program should find the date convenient for the most members.
If there is more than one such day, the earliest is the best.
Input
The input has multiple data sets, each starting with a line
containing the number of committee members and the quorum of the meeting.
N Q
Here,
N
, meaning the size of the committee, and
Q
meaning the quorum, are positive integers.
N
is less than 50,
and, of course,
Q
is less than or equal to
N.
N
lines follow, each describing convenient dates for a
committee
member in the following format.
M Date
1
Date
2
...
Date
M
Here,
M
means the number of convenient dates for
the member, which is an integer greater than or equal to zero.
The remaining items in the line are his/her dates of convenience,
which are positive integers less than 100, that is, 1 means tomorrow,
2 means the day after tomorrow, and so on.
They are in ascending order without any repetition
and separated by a space character.
Lines have neither leading nor trailing spaces.
A line containing two zeros indicates the end of the input.
Output
For each data set, print a single line containing the date number
convenient for the largest number of committee members.
If there is more than one
such date, print the earliest. However, if no dates are convenient
for more than or equal to the quorum number of members, print 0 instead.
Sample Input
3 2
2 1 4
0
3 3 4 8
3 2
4 1 5 8 9
3 2 5 9
5 2 4 5 7 9
3 3
2 1 4
3 2 5 9
2 2 4
3 3
2 1 2
3 1 2 9
2 2 4
0 0
Output for the Sample Input
4
5
0
2
|
[
{
"submission_id": "aoj_1124_7668810",
"code_snippet": "#include <bits/stdc++.h>\n#define LL_INF 9223372036854775807\n#define INT_INF 2147483647\nusing namespace std;\nusing ll = long long;\n\nint main()\n{\n int n, q, ans, hint;\n multiset<int> mst;\n while (true)\n {\n mst.clear();\n cin >> n >> q;\n if (n == 0 && q == 0)\n {\n return 0;\n }\n for (int i = 0; i < n; i++)\n {\n int m;\n cin >> m;\n for (int j = 0; j < m; j++)\n {\n int a;\n cin >> a;\n mst.insert(a);\n }\n }\n hint = 0;\n ans = 0;\n for (int i = 0; i < 110; i++)\n {\n if (mst.count(i) > hint)\n {\n ans = i;\n hint = mst.count(i);\n }\n }\n if (hint < q)\n {\n ans = 0;\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3380,
"score_of_the_acc": -0.8235,
"final_rank": 18
},
{
"submission_id": "aoj_1124_7052727",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\n#include<stack>\n#include<queue>\n#include<algorithm>\n#include<set>\n#include<map>\n#include<deque>\n#include<cmath>\n#include<functional>\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define derep(i,n) for(int i=n;i>=0;i--)\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>void chmax (T&a,T b ){if(a<b)a=b;}\ntemplate<class T>void chmin (T&a, T b){if(a>b)a=b;}\n\nconst int dx[]={1,0,-1,0,1,-1,1,-1};\nconst int dy[]={0,1,0,-1,1,-1,-1,1};\nconst int INF=1<<25;\nconst ll inf=1LL<<60;\nconst int mod=1000000007 ;\nconst int arx=1000,ary=1000;\nusing graph=vector<vector<ll>>;\nstruct unionfind{\n vector<int>par;\n unionfind(int n):par(n){\n rep(i,n)par[i]=i;\n }\n int root(int x){\n if(par[x]==x)return x;\n else return par[x]=root(par[x]);\n }\n void unit(int x,int y){\n int rx=root(x);\n int ry=root(y);\n \n if(rx==ry)return ;\n else par[rx]=ry;\n }\n bool same(int x,int y){\n int rx=root(x);\n int ry=root(y);\n return rx==ry;\n } \n}; \n\nint main(){\nwhile(1){\nint n,q;\ncin>>n>>q;\n if(n==0&&q==0)return 0;\n map<int,ll>mp;\nmap<int,bool>cp;\nint large=-1,ite; \nrep(i,n){\nint m;\ncin>>m;\n cp.clear();\n rep(i,m){\n int y;\ncin>>y;\n if(!cp[y]){\n mp[y]++;\n cp[y]=true;\nif(large<mp[y]||ite>y&&large==mp[y]){\nite=y;\nlarge=mp[y];\n }\n}\n\n\n }\n\n }\n \n if(large<q)cout<<0<<endl;\n else cout<<ite<<endl;\n \n}\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3144,
"score_of_the_acc": -0.3277,
"final_rank": 11
},
{
"submission_id": "aoj_1124_5957729",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) rep(i, 0, n)\n\nvoid solve()\n{\n int n, q;\n while (cin >> n >> q)\n {\n if (n == 0)\n break;\n vector<map<int, int>> a(n);\n REP(i, n)\n {\n int m;\n cin >> m;\n REP(j, m)\n {\n int tmp;\n cin >> tmp;\n a[i][tmp] = 1;\n }\n }\n int c = 0, d = 0;\n rep(i, 1, 101)\n {\n int cnt = 0;\n REP(j, n)\n {\n if (a[j][i] == 1)\n cnt++;\n }\n if (cnt >= q && cnt > c)\n {\n c = cnt;\n d = i;\n }\n }\n cout << d << endl;\n }\n}\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n solve();\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3376,
"score_of_the_acc": -1.8151,
"final_rank": 20
},
{
"submission_id": "aoj_1124_5940326",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define int long long\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) for (int i = 0; i < (n); i++)\n#define pb push_back\n#define ALL(obj) (obj).begin(), (obj).end()\n#define vi vector<int>\n#define vvi vector<vector<int>>\n#define pii pair<int, int>\n#define us unordered_set\n#define ud unordered_dict\n#define Lower_bound(vec, n) distance((vec).begin(), lower_bound((vec).begin(), (vec).end(), (n)))\n#define Upper_bound(vec, n) distance((vec).begin(), upper_bound((vec).begin(), (vec).end(), (n)))\n#define Erase(vec) (vec).erase(unique((vec).begin(), (vec).end()), (vec).end())\n//template <class T = int> in()(T x; cin >> x; return (x);)\n//template <class T> print(T& x) (cout << x << endl;)\n//using template <class T> vec = vector<T>;\nusing Graph = vector<vector<int>>;\nconst int INF = 1LL << 60;\nconst int MOD = (int)1e9 + 7;\nconst double EPS = 1e-9;\n\nsigned main() {\n int N, Q;\n while (true) {\n cin >> N >> Q;\n if (N == 0) break;\n\n vi days;\n int day_num;\n int intmp;\n REP(i, N) {\n cin >> day_num;\n REP(j, day_num) {\n cin >> intmp;\n days.push_back(intmp);\n }\n }\n\n int best = 0;\n int best_people = 0;\n FOR(i, 1, 100) {\n int i_num = count(ALL(days), i);\n if (i_num >= Q && i_num > best_people) {\n best_people = i_num;\n best = i;\n }\n }\n \n cout << best << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3360,
"score_of_the_acc": -0.7815,
"final_rank": 17
},
{
"submission_id": "aoj_1124_5857424",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <cstring>\n#include <utility>\n#include <queue>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <cmath>\n#include <ctime>\n#include <cstdlib>\n#include <climits>\nusing namespace std;\n\n#define MOD 1000000007\n#define PI 3.14159265358979323846264338327950288419\n\n#define int long long\n#define ll long long\n#define pint pair<ll, ll>\n#define pll pair<ll, ll>\n#define pb push_back\n#define mpair make_pair\n#define pm(first, second) pb(mpair(first, second))\n#define pff first.first\n#define pfs first.second\n#define psf second.first\n#define pss second.second\n\nconst ll ll_max = LLONG_MAX;\n#define all(X) (X).begin(), (X).end()\n#define rall(X) (X).rbegin(), (X).rend()\n#define divceil(a, b) (((a) + ((b) - 1)) / (b))\n#define outyn(flag) cout << ((flag)? \"Yes\": \"No\") << endl\n#define outYN(flag) cout << ((flag)? \"YES\": \"NO\") << endl\n#define out(output) cout << (output) << endl\n\ntemplate <typename T>\nvoid chmax(T &a, T b){\n if(a < b) a = b;\n}\n\nint N, Q;\n\nvoid solve(){\n\n int M, d;\n map<int, int> mp;\n for(int i = 0; i < N; i++){\n cin >> M;\n for(int j = 0; j < M; j++){\n cin >> d;\n mp[d]++;\n }\n }\n\n //50-人数,date\n set<pair<int, int>> st;\n for(auto itr = mp.begin(); itr != mp.end(); itr++){\n st.insert(mpair(50-itr->second, itr->first));\n }\n\n auto stfirst = st.begin();\n if(stfirst == st.end()) cout << 0 << endl;\n else if(50-stfirst->first < Q) cout << 0 << endl;\n else cout << stfirst->second << endl;\n\n}\n\n#undef int\nint main(){\n\n //solve();\n\n while(true){\n cin >> N >> Q;\n if(N == 0 && Q == 0) break;\n\n solve();\n }\n \n /*int numOfInput;\n cin >> numOfInput;\n for(int i = 0; i < numOfInput; i++){\n solve();\n }*/\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3336,
"score_of_the_acc": -0.7311,
"final_rank": 16
},
{
"submission_id": "aoj_1124_4968672",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\ntypedef pair< ll, ll > Pi;\ntypedef tuple< ll, ll, ll > Tp;\nusing vl = vector<ll>;\nusing vs = vector<string>;\nusing vvl = vector<vector<ll>>;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define rep2(i,n) for(int i=1;i<=(n);i++)\n#define rep3(i,i0,n) for(int i=i0;i<(n);i++)\n#define pb push_back\n#define mod 1000000007\nconst ll INF = 1LL << 60;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\nll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}\nll lcm(ll a, ll b) {return a/gcd(a,b)*b;}\n#define all(x) x.begin(), x.end()\n#define rall(x) x.rbegin(), x.rend()\n#define mp make_pair\n#define mt make_tuple\nbool compare(Pi a, Pi b) {\n if(a.first != b.first){\n return a.first < b.first;\n \n }else{\n return a.second < b.second;\n }\n}\n\n\nbool In_map(ll y,ll x,ll h,ll w){\n if(y<0 || x<0 || y>=h || x>=w){\n return 0;\n }else{\n return 1;\n }\n}\nconst vector<ll> dx{1,0,-1,0};\nconst vector<ll> dy{0,1,0,-1};\n\nvoid Main(ll N,ll Q){\n map<ll,ll>m;\n ll mx=0,ans;\n rep(i,N){\n ll M;\n cin>>M;\n rep(j,M){\n ll d;\n cin>>d;\n m[d]++;\n if(m[d]>mx){\n mx=m[d];\n ans=d;\n }else if(m[d]==mx&&d<ans){\n ans=d;\n }\n }\n }\n if(mx<Q){\n cout<<0<<endl;\n }else{\n cout<<ans<<endl;\n }\n}\n\nint main() {\n \n while(1){\n ll N,Q;\n cin>>N>>Q;\n if((N|Q)==0)break;\n Main(N,Q);\n }\n\n return 0;\n \n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3156,
"score_of_the_acc": -0.3529,
"final_rank": 13
},
{
"submission_id": "aoj_1124_4884946",
"code_snippet": "#include<iostream>\n#include<fstream>\n#include<bitset>\n#include<string>\n#include<vector>\n#include<list>\n#include<algorithm>\n#include<cmath>\n#include<map>\n#include<set>\n#include<iomanip>\n#include<queue>\n#include<stack>\n#include<numeric>\n#include<utility>\n#include<regex>\n#include<climits>\n#include<ctime>\n#include<functional>\n\nusing namespace std;\n\n#define int long long\n#define rep(i,n) for(LL i=0;i<(n);i++)\n#define rep1(i,n) for(LL i=1;i<(n);i++)\n#define rrep(i,n) for(LL i=(n)-1;i>=0;i--)\n#define all(a) (a).begin(),(a).end()\n#define check() cout<<\"! ! !\"<<endl\n#define endl \"\\n\"\n#define _y() cout<<\"Yes\"<<endl\n#define _Y() cout<<\"YES\"<<endl\n#define _n() cout<<\"No\"<<endl\n#define _N() cout<<\"NO\"<<endl\n\n\nconstexpr long double PI = 3.141592653589793238;\nconstexpr long long INF = (long long)1e15;\nconstexpr long long MOD = 1e9 + 7;\n\n\nusing LL = long long;\nusing st = string;\ntemplate<typename T>using vec = vector<T>;\ntemplate<typename T>using vvec = vec<vec<T>>;\ntemplate<typename T>using vvvec = vec<vvec<T>>;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\nusing vc = vector<char>;\nusing vvc = vector<vc>;\nusing vs = vector<st>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing pi = pair<int, int>;\nusing ppi = pair<pi, int>;\nusing vpi = vector<pi>;\nusing vppi = vector<ppi>;\nusing mii = map<int, int>;\nusing mpii = map<pi, int>;\nusing mib = map<int, bool>;\nusing mci = map<char, int>;\ntemplate<typename T>using pq_greater = priority_queue<T>;\ntemplate<typename T>using pq_smaller = priority_queue<T, vec<T>, greater<T>>;\n\n\n//4,2,8,6,1,7,3,9,5 (x:right y:up is positive)\nint dx[] = { -1,0,0,1,-1,-1,1,1,0 };\nint dy[] = { 0,1,-1,0,1,-1,1,-1,0 };\n\ntemplate<typename T>\nistream &operator>>(istream &in, vector<T> &v) {\n\trep(i, v.size()) {\n\t\tin >> v[i];\n\t}\n\treturn in;\n}\n\ntemplate<typename T, typename U>\nistream &operator>>(istream&in, pair<T, U> &p) {\n\n\tin >> p.first >> p.second;\n\treturn in;\n}\n\ntemplate<typename T>\nostream &operator<<(ostream &out, vector<T> &v) {\n\tout << \"{\";\n\trep(i, v.size()) {\n\t\tout << v[i] << \",\";\n\t}\n\tout << \"}\" << endl;\n\n\treturn out;\n}\n\ntemplate<typename T, typename U>\nostream &operator<<(ostream&out, pair<T, U> &p) {\n\n\tout << \"{\" << p.first << \",\" << p.second << \"}\" << endl;\n\treturn out;\n}\n\nstruct mint {\n\tint x;\n\tmint(int x = 0) :x((x%MOD + MOD) % MOD) {}\n\n\tmint operator-() const { return mint(-x); }\n\tmint& operator+=(const mint a) {\n\t\tif ((x += a.x) >= MOD) x -= MOD;\n\t\treturn *this;\n\t}\n\tmint& operator-=(const mint a) {\n\t\tif ((x += MOD - a.x) >= MOD) x -= MOD;\n\t\treturn *this;\n\t}\n\tmint& operator*=(const mint a) {\n\t\t(x *= a.x) %= MOD;\n\t\treturn *this;\n\t}\n\tmint operator+(const mint a) const {\n\t\tmint res(*this);\n\t\treturn res += a;\n\t}\n\tmint operator-(const mint a) const {\n\t\tmint res(*this);\n\t\treturn res -= a;\n\t}\n\tmint operator*(const mint a) const {\n\t\tmint res(*this);\n\t\treturn res *= a;\n\t}\n\tmint pow(int t) const {\n\t\tif (!t) return 1;\n\t\tmint a = pow(t >> 1);\n\t\ta *= a;\n\t\tif (t & 1) a *= *this;\n\t\treturn a;\n\t}\n\n\tmint inv() const {\n\t\treturn pow(MOD - 2);\n\t}\n\tmint& operator/=(const mint a) {\n\t\treturn (*this) *= a.inv();\n\t}\n\tmint operator/(const mint a) const {\n\t\tmint res(*this);\n\t\treturn res /= a;\n\t}\n\n\tfriend ostream& operator<<(ostream& out, const mint& m) {\n\t\tout << m.x;\n\t\treturn out;\n\t}\n\n};\n\nvoid y_n(bool p) {\n\tp ? _y() : _n();\n}\n\nvoid Y_N(bool p) {\n\tp ? _Y() : _N();\n}\n\nbool endInput(vi a) {\n\tfor (auto i : a) {\n\t\tif (i != 0)return false;\n\t}\n\treturn true;\n}\n\n//MAX,maxpos,MIN,minpos\ntemplate<typename T>\npair<pair<T, int>, pair<T, int>> vmaxmin(vector<T> v) {\n\tint MAX = -INF;\n\tint MIN = INF;\n\tint maxpos = 0;\n\tint minpos = 0;\n\trep(i, v.size()) {\n\t\tif (MAX < v[i]) {\n\t\t\tmaxpos = i;\n\t\t\tMAX = v[i];\n\t\t}\n\t\tif (MIN > v[i]) {\n\t\t\tminpos = i;\n\t\t\tMIN = v[i];\n\t\t}\n\t}\n\treturn { {MAX,maxpos},{MIN,minpos} };\n}\n\ntemplate<typename T>\nT vsum(vector<T> v) {\n\tT sum = 0;\n\trep(i, v.size()) {\n\t\tsum += v[i];\n\t}\n\treturn sum;\n}\n\nint gcd(int a, int b) {\n\tif (b == 0) {\n\t\tswap(a, b);\n\t}\n\tint r;\n\twhile ((r = a % b) != 0) {\n\t\ta = b;\n\t\tb = r;\n\t}\n\treturn b;\n}\n\nint lcm(int a, int b) {\n\treturn (a / gcd(a, b) * b);\n}\n\nbool is_square(int n) {\n\tif ((int)sqrt(n)*(int)sqrt(n) == n) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\n\nbool is_prime(int n) {\n\tif (n <= 1) {\n\t\treturn false;\n\t}\n\telse {\n\t\tfor (int i = 2; i*i <= n; i++) {\n\t\t\tif (n % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid dec_num(int n, vi &v) {\n\tint a = 2;\n\tv.push_back(1);\n\tv.push_back(n);\n\twhile (a*a <= n) {\n\t\tif (n%a == 0) {\n\t\t\tv.push_back(a);\n\t\t\tv.push_back(n / a);\n\t\t}\n\t\ta++;\n\t}\n\tsort(all(v));\n\tv.erase(unique(all(v)), v.end());\n}\n\n\nvoid dec_prime(int n, vi &v) {\n\t//v.push_back(1);\n\tint a = 2;\n\twhile (a*a <= n) {\n\t\tif (n % a == 0) {\n\t\t\tv.push_back(a);\n\t\t\tn /= a;\n\t\t}\n\t\telse {\n\t\t\ta++;\n\t\t}\n\t}\n\tv.push_back(n);\n}\n\n//n= ...*pow(p_i,m[p_i])*...\nvoid dec_prime_e(int n, map<int, int> &m) {\n\tfor (int i = 2; i*i <= n; i++) {\n\t\tif (n%i == 0) {\n\t\t\tint e = 0;\n\t\t\twhile (n%i == 0) {\n\t\t\t\te++;\n\t\t\t\tn /= i;\n\t\t\t}\n\t\t\tm[i] += e;\n\t\t}\n\t}\n\tif (n != 1) m[n]++;\n}\n\n\nint sieve_prime(int a, int b) {\n\tif (a > b)swap(a, b);\n\tvb s(b + 1, true);\n\tint cnt_a = 0, cnt_b = 0;\n\tfor (int i = 2; i <= b; i++) {\n\t\tfor (int j = 2; i*j <= b; j++) {\n\t\t\ts[i*j] = false;\n\t\t}\n\t}\n\t//return s;\n\tfor (int i = 2; i <= b; i++) {\n\t\tif (s[i]) {\n\t\t\t//cout << i << \" \";\n\t\t\tif (i < a) {\n\t\t\t\tcnt_a++;\n\t\t\t}\n\t\t\tcnt_b++;\n\t\t}\n\t}\n\treturn cnt_b - cnt_a;\n\n}\n\n\nint factorial(int n) {\n\tint a = 1, ret = 1;\n\twhile (a < n) {\n\t\ta++;\n\t\tret *= a;\n\t\t//ret %= MOD;\n\t}\n\treturn ret;\n}\n\nint bit_count(int n) {\n\tint k = (int)log2(n) + 1;\n\tint ret = 0;\n\trep(i, k) {\n\t\tif (n&(1LL << i))ret++;\n\t}\n\treturn ret;\n}\n\n//a^(a+1)^(a+2)^...^b\nint XOR(int a, int b) {\n\tif (a == 0) {\n\t\tswitch (b % 4) {\n\t\tcase 0:\treturn b;\n\t\tcase 1:\treturn 1;\n\t\tcase 2:\treturn (b + 1);\n\t\tcase 3:\treturn 0;\n\t\t}\n\t}\n\tint A = XOR(0, a - 1);\n\tint B = XOR(0, b);\n\treturn (A ^ B);\n}\n\n\nconst int COMBMAX = 4000;\nint comb[COMBMAX + 5][COMBMAX + 5];\n\nvoid init_comb() {\n\tcomb[0][0] = 1;\n\trep(i, COMBMAX) {\n\t\trep(j, i + 1) {\n\t\t\tcomb[i + 1][j] += comb[i][j];\n\t\t\t//comb[i + 1][j] %= MOD;\n\t\t\tcomb[i + 1][j + 1] += comb[i][j];\n\t\t\t//comb[i + 1][j + 1] %= MOD;\n\t\t}\n\t}\n}\n\nint combination(int n, int k) {\n\tif (k<0 || k>n)return 0;\n\telse return comb[n][k];\n}\n\n\nconst int COMBMODMAX = 5000000;\nint fac[COMBMODMAX + 5], facinv[COMBMODMAX + 5], inv[COMBMODMAX + 5];\n\nvoid init_comb_mod() {\n\tfac[0] = fac[1] = 1;\n\tfacinv[0] = facinv[1] = 1;\n\tinv[1] = 1;\n\tfor (int i = 2; i < COMBMODMAX; i++) {\n\t\tfac[i] = fac[i - 1] * i%MOD;\n\t\tinv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n\t\tfacinv[i] = facinv[i - 1] * inv[i] % MOD;\n\t}\n}\n\n//nCk (mod p)\n//nHk = n+k-1Ck\nint comb_mod(int n, int k) {\n\tif (n < k)return 0;\n\tif (n < 0 || k < 0)return 0;\n\treturn fac[n] * (facinv[k] * facinv[n - k] % MOD) % MOD;\n}\n\n//x^n (mod p)\nint pow_mod(int x, int n, int p) {\n\tif (n == 0)return 1;\n\tint res = pow_mod(x*x%p, n / 2, p);\n\tif (n % 2 == 1)res = res * x % p;\n\treturn res;\n}\n\nstruct edge {\n\tint to;\n\tint cost;\n};\n\n\nusing ve = vector<edge>;\nusing vve = vector<ve>;\n\n\n/*****************************************************************************/\n\n\n\n\nsigned main() {\n\n\twhile (1) {\n\t\tint n, q;\n\t\tcin >> n >> q;\n\t\tif (endInput(vi(n,q)))break;\n\t\t\n\t\tvvi a(n);\n\t\tmii cnt;\n\t\trep(i, n) {\n\t\t\tint k;\n\t\t\tcin >> k;\n\t\t\ta[i].resize(k);\n\t\t\tcin >> a[i];\n\t\t}\n\t\trep(i, n) {\n\t\t\trep(j, a[i].size()) {\n\t\t\t\tcnt[a[i][j]]++;\n\t\t\t}\n\t\t}\n\n\t\tint ans = -1;\n\t\tint per = 0;\n\t\trep(i, 110) {\n\t\t\tif (cnt[i]>=q&&per < cnt[i]) {\n\t\t\t\tans = i;\n\t\t\t\tper = cnt[i];\n\t\t\t}\n\t\t}\n\t\tif (ans == -1) {\n\t\t\tcout << 0 << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << ans << endl;\n\t\t}\n\t}\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3132,
"score_of_the_acc": -0.3025,
"final_rank": 10
},
{
"submission_id": "aoj_1124_4869888",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\n// debug methods\n// usage: debug(x,y);\n#define CHOOSE(a) CHOOSE2 a\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\n#define debug_1(x1) cout<<#x1<<\": \"<<x1<<endl\n#define debug_2(x1,x2) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<endl\n#define debug_3(x1,x2,x3) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<endl\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<endl\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<\", \"#x5<<\": \"<<x5<<endl\n#ifdef _DEBUG\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n\n#define MAX_N (1000006)\n#define INF (1LL << 60)\nconst int MOD = (int)1e9 + 7;\n\n\nsigned main(){\n\n while(1) {\n int n, q;\n cin >> n >> q;\n if(n==0&&q==0) break;\n vector<vector<int>> vv(n);\n for(int i=0; i<n; i++) {\n int m;\n cin >> m;\n vector<int> u(m);\n for(int j=0; j<m; j++) cin >> u[j];\n vv[i] = u;\n }\n\n map<int,int> mp;\n for(int i=0; i<n; i++){\n for(int j=0; j<vv[i].size(); j++){\n mp[vv[i][j]]++;\n }\n }\n\n int ans = 0;\n int mx = 0;\n for(auto itr = mp.begin(); itr != mp.end(); itr++) {\n debug((*itr).first, (*itr).second);\n if (mx < (*itr).second) {\n mx = (*itr).second;\n ans = (*itr).first;\n }\n }\n cout << (mx>=q?ans:0) << endl;\n }\n\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3192,
"score_of_the_acc": -0.4286,
"final_rank": 15
},
{
"submission_id": "aoj_1124_4759890",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\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; }\nusing ll = long long;\nusing P = pair<ll, ll>;\nconst long double PI = acos(-1.0L);\nll GCD(ll a, ll b) { return b?GCD(b, a%b):a; }\nll LCM(ll a, ll b) { return a/GCD(a, b)*b; }\n\nint n, q;\n\nint main() {\n while(1) {\n cin >> n >> q;\n if(n == 0 && q == 0) break;\n map<int, int> mcnt;\n for(int i = 0; i < n; ++i) {\n int m; cin >> m;\n for(int j = 0; j < m; ++j) {\n int ch; cin >> ch; mcnt[ch]++;\n }\n }\n int now = 0;\n int date = 0;\n for(auto x : mcnt) {\n if(q <= x.second) {\n if(now < x.second) {\n now = x.second;\n date = x.first;\n }\n }\n }\n cout << date << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3116,
"score_of_the_acc": -0.2689,
"final_rank": 8
},
{
"submission_id": "aoj_1124_4066294",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<utility>\n#include<map>\n#include<set>\n#include<queue>\n#include<math.h>\nusing namespace std;\n#define N (1000000000+7)\n#define INF 1e16\ntypedef long long ll;\ntypedef pair<ll,ll> P;\n\n\nint main(void){\n ll n,q;\n while(true){\n cin>>n>>q;\n if(n==0&&q==0)break;\n map<int,int>ma;\n for(int i=0;i<n;i++){\n int m;\n cin>>m;\n for(int j=0;j<m;j++){\n int d;\n cin>>d;\n ma[d]++;\n }\n }\n int ans1=0,ans2=0;\n for(auto itr=ma.begin();itr!=ma.end();++itr){\n int x=itr->second;\n if(x>=q){\n if(x>ans2){\n ans1=itr->first;\n ans2=x;\n }\n }\n }\n cout<<ans1<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3012,
"score_of_the_acc": -0.0504,
"final_rank": 2
},
{
"submission_id": "aoj_1124_3656102",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nconst double eps = 1e-10;\nconst int MOD = 1000000007;\nconst int INF = 1000000000;\nconst ll LINF = 1ll<<50;\n\ntemplate<typename T>\nvoid printv(const vector<T>& s) {\n for(int i=0;i<(int)(s.size());++i) {\n cout << s[i];\n if(i == (int)(s.size())-1) cout << endl;\n else cout << \" \";\n }\n}\n\nint main () {\n cin.tie(0);\n cout << fixed << setprecision(10);\n\n while(1) {\n int n, q; cin >> n >> q;\n if(n == 0 && q == 0) break;\n map<int, int> mp;\n for(int i=0;i<n;++i) {\n int m; cin >> m;\n for(int j=0;j<m;++j) {\n int tmp; cin >> tmp;\n mp[tmp]++;\n }\n }\n\n int ans = 0;\n int ma = 0;\n for(const auto &i: mp) {\n if(i.second > ma) {\n ans = i.first;\n ma = i.second;\n }\n }\n if(ma < q) {\n cout << 0 << endl;\n } else {\n cout << ans << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3020,
"score_of_the_acc": -0.0672,
"final_rank": 3
},
{
"submission_id": "aoj_1124_3221991",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(int argc, char const *argv[])\n{\n\tint n,q;\n\twhile(cin>>n>>q,n)\n\t{\n\t\tvector<int> v[n];\n\t\tint m,t,mi=1000000,ma=-1;\n\t\tfor (int i = 0; i < n; ++i)\n\t\t{\n\t\t\tcin>>m;\n\t\t\tfor (int j = 0; j < m; ++j) cin>>t,v[i].push_back(t),mi=min(mi,t),ma=max(ma,t);\n\t\t}\n\t\tint ans=-1,d=-1;\n\t\tfor (int i = mi; i <= ma; ++i)\n\t\t{\n\t\t\tint k=0;\n\t\t\tfor (int j = 0; j < n; ++j)\n\t\t\t{\n\t\t\t\tfor (int l = 0; l < v[j].size(); ++l)\n\t\t\t\t{\n\t\t\t\t\tif(v[j].at(l)==i)\n\t\t\t\t\t{\n\t\t\t\t\t\t++k;\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(k>d) ans=i,d=k;\n\t\t}\n\t\tif(d>=q) cout<<ans<<endl;\n\t\telse cout<<\"0\\n\";\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3156,
"score_of_the_acc": -0.3529,
"final_rank": 13
},
{
"submission_id": "aoj_1124_2920653",
"code_snippet": "#include<bits/stdc++.h>\n\n#define INF 1e9\n#define llINF 1e18\n#define MOD 1e9+7\n#define pb push_back\n#define mp make_pair \n#define F first\n#define S second\n#define ll long long\nusing namespace std;\nint main(){\n int n,q;\n while(cin>>n>>q,n){\n int hai[100000]={};\n for(int i=0;i<n;i++){\n int m;cin>>m;\n for(int i=0;i<m;i++){\n\tint num;cin>>num;\n\thai[num]++;\n }\n }\n int ans=0;\n bool flag=true;\n int anss=0;\n for(int i=1;i<100000;i++){\n if(hai[i]>=q){\n\tif(ans<hai[i]){\n\t ans=max(ans,hai[i]);\n\t anss=i;\n\t}\n }\n }\n cout<<anss<<endl;\n //if(flag)cout<<0<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3464,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_1124_2803146",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define INF_LL (int64)1e18\n#define INF (int32)1e9\n#define REP(i, n) for(int i = 0;i < (n);i++)\n#define FOR(i, a, b) for(int i = (a);i < (b);i++)\n#define all(x) x.begin(),x.end()\n#define fs first\n#define sc second\n\nusing int32 = int_fast32_t;\nusing uint32 = uint_fast32_t;\nusing int64 = int_fast64_t;\nusing uint64 = uint_fast64_t;\nusing PII = pair<int32, int32>;\nusing PLL = pair<int64, int64>;\n\nconst double eps = 1e-6;\n\ntemplate<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}\ntemplate<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}\n\nconst int64 mod = 1e9+7;\n\nint main(void){\n\tint32 N, Q;\n\twhile(cin >> N >> Q && N+Q){\n\t\tmap<int32, int32> cnt;\n\t\tREP(i, N){\n\t\t\tint32 M;\n\t\t\tcin >> M;\n\t\t\tREP(j, M){\n\t\t\t\tint32 x;\n\t\t\t\tcin >> x;\n\t\t\t\tcnt[x]++;\n\t\t\t}\n\t\t}\n\t\tint32 res = 0;\n\t\tfor(auto x : cnt){\n\t\t\tif(x.sc >= Q && cnt[res] < x.sc){\n\t\t\t\tres = x.fs;\n\t\t\t}\n\t\t}\n\t\tcout << res << endl;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3116,
"score_of_the_acc": -0.2689,
"final_rank": 8
},
{
"submission_id": "aoj_1124_2741359",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) FOR(i,0,n)\n#define pb emplace_back\ntypedef long long ll;\ntypedef pair<int,int> pint;\n\nmap<int,int> t;\nint main(){\n int n,q,m,dt;\n while(cin>>n>>q,n){\n t.clear();\n rep(i,n){\n cin>>m;\n rep(j,m){\n cin>>dt;\n ++t[dt];\n }\n }\n int mx=-1,ans;\n for(auto it:t){\n if(mx<it.second) mx=it.second,ans=it.first;\n }\n cout<<(mx>=q?ans:0)<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3144,
"score_of_the_acc": -0.3277,
"final_rank": 11
},
{
"submission_id": "aoj_1124_2711881",
"code_snippet": "#include<bits/stdc++.h>\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 ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define MP make_pair\n#define FR first\n#define SC second\n#define int long long\nusing namespace std;\nconst int MOD=1000000007;\nconst int INF=1000000009;\n\nsigned main(){\n int n,q;\n while(cin>>n>>q,n){\n map<int,int> mp;\n REP(i,n){\n int m;\n cin>>m;\n REP(j,m){\n int a;\n cin>>a;\n mp[a]++;\n }\n }\n int maxi=0;\n int ans=INF;\n for(auto x:mp){\n if(x.SC>maxi){\n maxi=x.SC;\n ans=x.FR;\n }else if(x.SC==maxi){\n ans=min(ans,x.FR);\n }\n }\n cout<<(maxi>=q?ans:0)<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3020,
"score_of_the_acc": -0.0672,
"final_rank": 3
},
{
"submission_id": "aoj_1124_2680933",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n int n,q;\n while(cin >> n && n != 0){\n cin >> q;\n map<int,int> d;\n for(int i = 0;i < n; i++){\n int m; cin >> m;\n for(int j = 0; j < m; j++){\n int t; cin >> t;\n if(d.find(t) != d.end()){\n d[t]++;\n }\n else{\n d[t] = 1;\n }\n }\n }\n int ans = 0, num = 0;\n for(map<int,int>::iterator it = d.begin(); it != d.end(); it++){\n if(it->second > num){\n ans = it->first;\n num = it->second;\n }\n }\n if(num < q){\n cout << 0 << endl;\n }\n else cout << ans << endl;\n }\n\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2988,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1124_2660645",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nvoid solve(int n,int q){\n int a,b;\n vector<int> v(100,0);\n for(int i=0;i<n;i++){\n cin >> a;\n for(int j=0;j<a;j++){\n cin >> b;\n v[b-1]++;\n }\n }\n int ans=0;\n ans=*max_element(v.begin(),v.end());\n cout<<((ans>=q)?(max_element(v.begin(),v.end())-v.begin()+1):0)<<endl;\n \n}\n\nint main(void){\n int a,b;\n while(cin>>a>>b,a){\n solve(a,b);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3080,
"score_of_the_acc": -0.1933,
"final_rank": 6
},
{
"submission_id": "aoj_1124_2643024",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing vi=vector<int>;\nusing vvi=vector<vi>;\nusing vs=vector<string>;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define all(a) a.begin(),a.end()\n#define rall(a) a.rbegin(),a.rend()\n\nint main(void){\n int n,m;\n while(cin>>n>>m,n){\n vi d(101,0);\n int mx=-1;\n rep(i,n){\n int p,q; cin>>p;\n rep(j,p){\n cin>>q; d[q]++;\n mx=max(mx,d[q]);\n }\n }\n cout<<(mx<m?0:(find(all(d),mx)-d.begin()))<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3020,
"score_of_the_acc": -0.0672,
"final_rank": 3
},
{
"submission_id": "aoj_1124_2467472",
"code_snippet": "//#define _GRIBCXX_DEBUG\n#include <bits/stdc++.h>\n# define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing namespace std;\n\nint main() {\n int n, q, m, d;\n map<int, int>::iterator it;\n\n while (cin >> n >> q, n) {\n map<int, int> freq;\n rep (i, n) {\n\n cin >> m;\n rep (k, m) {\n cin >> d;\n\n it = freq.find(d);\n if (it == freq.end()) {\n freq[d] = 1;\n }\n else {\n freq[d]++;\n }\n }\n }\n\n int max_d = -1;\n int max_v = 0;\n\n for (pair<int, int> p : freq) {\n if (max_v < p.second) {\n max_d = p.first;\n max_v = p.second;\n }\n }\n\n if (max_v >= q) {\n cout << max_d << endl;\n }\n else {\n cout << 0 << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3096,
"score_of_the_acc": -0.2269,
"final_rank": 7
}
] |
aoj_1117_cpp
|
Missing Numbers
Toshizo is the manager of a convenience store chain in Hakodate.
Every day, each of the stores in his chain sends him a table of the
products that they have sold. Toshizo's job is to compile these
figures and calculate how much the stores have sold in total.
The type of a table that is sent to Toshizo by the stores looks like this
(all numbers represent units of products sold):
Store1 Store2 Store3 Totals
Product A -5 40 70 | 105
Product B 20 50 80 | 150
Product C 30 60 90 | 180
-----------------------------------------------------------
Store's total sales 45 150 240 435
By looking at the table, Toshizo can tell at a glance which goods are
selling well or selling badly, and which stores are paying well and
which stores are too empty. Sometimes, customers will bring products
back, so numbers in a table can be negative as well as positive.
Toshizo reports these figures to his boss in Tokyo, and together they
sometimes decide to close stores that are not doing well and sometimes
decide to open new stores in places that they think will be profitable.
So, the total number of stores managed by Toshizo is not fixed. Also,
they often decide to discontinue selling some products that are not
popular, as well as deciding to stock new items that are likely to be
popular. So, the number of products that Toshizo has to monitor is also
not fixed.
One New Year, it is very cold in Hakodate. A water pipe bursts in
Toshizo's office and floods his desk. When Toshizo comes to work, he
finds that the latest sales table is not legible. He can make out some
of the figures, but not all of them. He wants to call his boss in
Tokyo to tell him that the figures will be late, but he knows that his
boss will expect him to reconstruct the table if at all possible.
Waiting until the next day won't help, because it is the New Year, and
his shops will be on holiday. So, Toshizo decides either to work out
the values for himself, or to be sure that there really is no unique
solution. Only then can he call his boss and tell him what has
happened.
But Toshizo also wants to be sure that a problem like this never
happens again. So he decides to write a computer program that all the
managers in his company can use if some of the data goes missing
from their sales tables. For instance, if they have a table like:
Store 1 Store 2 Store 3 Totals
Product A ? ? 70 | 105
Product B ? 50 ? | 150
Product C 30 60 90 | 180
--------------------------------------------------------
Store's total sales 45 150 240 435
then Toshizo's program will be able to tell them the correct figures
to replace the question marks.
In some cases, how
...(truncated)
|
[
{
"submission_id": "aoj_1117_10853845",
"code_snippet": "#include <string>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nstruct dat {\n\tint px, py; string s;\n};\nbool operator<(const dat& d1, const dat& d2) {\n\tif (d1.px != d2.px) return d1.px < d2.px;\n\treturn d1.py < d2.py;\n}\nint H, W, z; string s[109][109];\nint main() {\n\twhile (cin >> H, H) {\n\t\tcin >> W; H++; W++;\n\t\tif (z++) cout << endl;\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tcin >> s[i][j];\n\t\t\t}\n\t\t}\n\t\tvector<dat> ret;\n\t\tfor (int i = 0; i <= 1000; i++) {\n\t\t\tfor (int j = 0; j < H - 1; j++) {\n\t\t\t\tint a = stoi(s[j][W - 1]), cnt = 0;\n\t\t\t\tfor (int k = 0; k < W - 1; k++) {\n\t\t\t\t\tif (s[j][k] != \"?\") a -= stoi(s[j][k]);\n\t\t\t\t\telse cnt++;\n\t\t\t\t}\n\t\t\t\tif (cnt == 1) {\n\t\t\t\t\tfor (int k = 0; k < W - 1; k++) {\n\t\t\t\t\t\tif (s[j][k] == \"?\") {\n\t\t\t\t\t\t\ts[j][k] = to_string(a);\n\t\t\t\t\t\t\tret.push_back(dat{ j, k, s[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\tfor (int j = 0; j < W - 1; j++) {\n\t\t\t\tint a = stoi(s[H - 1][j]), cnt = 0;\n\t\t\t\tfor (int k = 0; k < H - 1; k++) {\n\t\t\t\t\tif (s[k][j] != \"?\") a -= stoi(s[k][j]);\n\t\t\t\t\telse cnt++;\n\t\t\t\t}\n\t\t\t\tif (cnt == 1) {\n\t\t\t\t\tfor (int k = 0; k < H - 1; k++) {\n\t\t\t\t\t\tif (s[k][j] == \"?\") {\n\t\t\t\t\t\t\ts[k][j] = to_string(a);\n\t\t\t\t\t\t\tret.push_back(dat{ k, j, s[k][j] });\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\tbool flag = true;\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] == \"?\") flag = false;\n\t\t\t}\n\t\t}\n\t\tif (!flag) cout << \"NO\" << endl;\n\t\telse {\n\t\t\tsort(ret.begin(), ret.end());\n\t\t\tfor (int i = 0; i < ret.size(); i++) cout << ret[i].s << endl;\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 640,
"memory_kb": 3652,
"score_of_the_acc": -1.212,
"final_rank": 20
},
{
"submission_id": "aoj_1117_2174761",
"code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\nusing namespace std;\nint H, W, a[101][11], c;\nint main() {\n\twhile (true) {\n\t\tcin >> H; if (H == 0)break; if (c)cout << endl; cin >> W;\n\t\tvector<pair<int, int>>v;\n\t\tfor (int i = 0; i <= H; i++) {\n\t\t\tfor (int j = 0; j <= W; j++) {\n\t\t\t\tstring S; cin >> S; if (S == \"?\") { a[i][j] = -(1 << 30); v.push_back(make_pair(i, j)); }\n\t\t\t\telse a[i][j] = stoi(S);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i <= H*W; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tint f = 0, g = 0, h = 0;\n\t\t\t\tfor (int k = 0; k < H; k++) { if (a[k][j] == -(1 << 30)) { g++; h = k; } else { f += a[k][j]; } }\n\t\t\t\tif (g == 1) { a[h][j] = a[H][j] - f; }\n\t\t\t}\n\t\t\tfor (int j = 0; j < H; j++) {\n\t\t\t\tint f = 0, g = 0, h = 0;\n\t\t\t\tfor (int k = 0; k < W; k++) { if (a[j][k] == -(1 << 30)) { g++; h = k; } else { f += a[j][k]; } }\n\t\t\t\tif (g == 1) { a[j][h] = a[j][W] - f; }\n\t\t\t}\n\t\t}\n\t\tbool flag = true; for (int i = 0; i <= H; i++) { for (int j = 0; j <= W; j++) { if (a[i][j] == -(1 << 30))flag = false; } }\n\t\tif (flag == false) cout << \"NO\" << endl;\n\t\telse { for (pair<int, int> i : v)cout << a[i.first][i.second] << endl; }\n\t\tc++;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2956,
"score_of_the_acc": -0.1716,
"final_rank": 17
},
{
"submission_id": "aoj_1117_1888886",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <vector>\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\ntypedef long long ll;\n\n#define EPS (1e-8)\n\nconst int q = -999999999;\n\ntypedef long long ll;\n\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n\nvec gauss_jordan(mat& A, vec& b) {\n int n = A.size();\n mat B(n, vec(n+1));\n rep(i, n) rep(j, n) B[i][j] = A[i][j];\n rep(i, n) B[i][n] = b[i];\n\n rep(i, n) {\n int pivot = i;\n REP(j, i, n) {\n if(abs(B[j][i]) > abs(B[pivot][i])) pivot = j;\n }\n swap(B[i], B[pivot]);\n\n if(abs(B[i][i]) < EPS) return vec();\n\n REP(j, i+1, n+1) B[i][j] /= B[i][i];\n rep(j, n) {\n if(i != j) {\n REP(k, i+1, n+1) B[j][k] -= B[j][i] * B[i][k];\n }\n }\n }\n\n vec x(n);\n rep(i, n) x[i] = B[i][n];\n return x;\n}\n\nint N, M;\nmat in;\nvector<pair<int, int>> qpos;\n\n#define fail { cout << \"NO\\n\"; goto next; }\n\nint main() {\n\n bool first = 0;\n while(cin >> N >> M && N) {\n if(first) cout << endl;\n first = 1;\n bool remain = 0;\n in.clear(); in.resize(N + 1); rep(i, N + 1) in[i].resize(M + 1);\n qpos.clear();\n rep(i, N + 1) rep(j, M + 1) {\n string s; cin >> s;\n if(s == \"?\") in[i][j] = q, qpos.emplace_back(i, j);\n else in[i][j] = stoi(s);\n }\n\n rep(_, (N + 1) * (M + 1) + 10) {\n {\n rep(i, N + 1) {\n int xcnt = 0;\n ll sum = 0;\n int lastq = -1;\n rep(j, M) {\n if(in[i][j] == q) xcnt ++, lastq = j;\n else sum += in[i][j];\n }\n if(xcnt == 0) {\n if(in[i][M] == q) in[i][M] = sum;\n else if(in[i][M] != sum) fail;\n }\n else if(xcnt == 1) {\n if(in[i][M] == q) {}\n else in[i][lastq] = in[i][M] - sum;\n }\n else {}\n }\n }\n\n {\n rep(j, M + 1) {\n int xcnt = 0;\n ll sum = 0;\n int lastq = -1;\n rep(i, N) {\n if(in[i][j] == q) xcnt ++, lastq = i;\n else sum += in[i][j];\n }\n if(xcnt == 0) {\n if(in[N][j] == q) in[N][j] = sum;\n else if(in[N][j] != sum) fail;\n }\n else if(xcnt == 1) {\n if(in[N][j] == q) {}\n else in[lastq][j] = in[N][j] - sum;\n }\n else {}\n }\n }}\n\n rep(i, N + 1) rep(j, M + 1) {\n remain |= in[i][j] == q;\n }\n\n if(remain) fail;\n\n for(auto e: qpos) {\n cout << in[e.first][e.second] << endl;\n }\n\n next:;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3156,
"score_of_the_acc": -0.1832,
"final_rank": 18
},
{
"submission_id": "aoj_1117_1888874",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define MAX 105\n#define INF (1e9)\n\nint s2i(string s){\n stringstream ss;\n int res;\n ss<<s;\n ss>>res;\n return res;\n}\n\n\nint a[MAX][MAX];\nvector<int> vx,vy;\nint H,W;\nstring str;\n\nbool solve(int id){\n int y=vy[id],x=vx[id];\n int ch=0,cw=0,sh=0,sw=0;\n for(int i=0;i<H;i++){\n if(a[i][x]==INF)continue;\n ch++;\n sh+=a[i][x];\n }\n if(ch==H-1){\n a[y][x]=a[H][x]-sh;\n return true;\n }\n\n for(int i=0;i<W;i++){\n if(a[y][i]==INF)continue;\n cw++;\n sw+=a[y][i];\n }\n if(cw==W-1){\n a[y][x]=a[y][W]-sw;\n return true;\n }\n return false;\n}\n\nint main(){\n int Tc=0;\n while(1){\n \n cin>>H;\n if(H==0)break;\n if(Tc!=0)cout<<endl;\n Tc++;\n\n cin>>W;\n vx.clear();\n vy.clear();\n for(int i=0;i<=H;i++){\n for(int j=0;j<=W;j++){\n cin>>str;\n if(str==\"?\"){\n a[i][j]=INF;\n vy.push_back(i);\n vx.push_back(j);\n }else a[i][j]=s2i(str);\n }\n }\n bool update=true;\n while(update){\n update=false;\n for(int i=0;i<(int)vx.size();i++){\n if(a[vy[i]][vx[i]]==INF)\n update|=solve(i);\n }\n }\n vector<int> ans;\n for(int i=0;i<(int)vx.size();i++)\n if(a[vy[i]][vx[i]]!=INF)\n ans.push_back(a[vy[i]][vx[i]]);\n if(ans.size()!=vx.size())cout<<\"NO\"<<endl;\n else{\n for(int i=0;i<(int)ans.size();i++)cout<<ans[i]<<endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1296,
"score_of_the_acc": -0.0911,
"final_rank": 14
},
{
"submission_id": "aoj_1117_1888826",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF=1<<30;\ntypedef pair<int,int> P;\ntypedef pair<P,int> PP;\nint main() {\n int n,m;\n bool ff=0;\n while(cin >> n && n) {\n cin >> m;\n if(ff) cout << endl;\n ff=1;\n int a[n+1][m+1],cnt=0;\n for(int i=0; i<=n; i++) {\n for(int j=0; j<=m; j++) {\n string s;\n cin >> s;\n if(s[0]=='?') {\n a[i][j]=INF;\n cnt++;\n } else {\n stringstream ss;\n ss << s;\n ss >> a[i][j];\n }\n }\n }\n vector<PP> ans;\n while(1) {\n bool ck=0;\n for(int i=0; i<n; i++) {\n for(int j=0; j<m; j++) {\n if(a[i][j]==INF) {\n bool f=1;\n for(int k=0; k<m; k++) {\n if(j!=k&&a[i][k]==INF) f=0;\n }\n if(f) {\n int sum=a[i][m];\n for(int k=0; k<m; k++) {\n if(j!=k) sum-=a[i][k];\n }\n a[i][j]=sum;\n ans.push_back(PP(P(i,j),a[i][j]));\n ck=1;\n continue;\n }\n f=1;\n for(int k=0; k<n; k++) {\n if(i!=k&&a[k][j]==INF) f=0;\n }\n if(f) {\n int sum=a[n][j];\n for(int k=0; k<n; k++) {\n if(i!=k) sum-=a[k][j];\n }\n a[i][j]=sum;\n ans.push_back(PP(P(i,j),a[i][j]));\n ck=1;\n }\n }\n }\n }\n if(!ck) break;\n }\n if(ans.size()!=cnt) cout << \"NO\" << endl;\n else {\n sort(ans.begin(),ans.end());\n for(int i=0; i<ans.size(); i++) cout << ans[i].second << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1228,
"score_of_the_acc": -0.0713,
"final_rank": 6
},
{
"submission_id": "aoj_1117_1230473",
"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;\n\nint H, W;\nbool f;\n\nvoid check(int y, int x, int py, int px, int total, vector< vector<int> > &v, vector<int> &h, vector<int> &w){\n int sum = 0, ty, tx;\n while(y < H - 1 && x < W - 1){\n if(v[y][x] == INF) { ty = y; tx = x; }\n else sum += v[y][x];\n y += py; x += px;\n }\n v[ty][tx] = total - sum;\n h[ty]--; w[tx]--;\n}\n\nvector< vector<int> > solve(vector< vector<int> > v, vector<int> &h, vector<int> &w){\n int cnt = 0;\n REP(i, H) REP(j, W) if(v[i][j] == INF) ++cnt;\n while(cnt != 0){\n bool flg = false;\n REP(i, H) if(h[i] == 1) { check(i, 0, 0, 1, v[i][W - 1], v, h, w); --cnt; flg = true; }\n REP(i, W) if(w[i] == 1) { check(0, i, 1, 0, v[H - 1][i], v, h, w); --cnt; flg = true; }\n if(!flg) { return vector< vector<int> >(); }\n }\n f = true;\n return v;\n}\n\nint main() {\n bool t = false;\n while(cin >>H && H){\n cin >>W;\n ++H; ++W;\n f = false;\n vector< vector<int> > v(H, vector<int>(W));\n vector<int> w(W, 0), h(H, 0);\n REP(i, H){\n REP(j, W){\n string s; cin >>s;\n if(s != \"?\") v[i][j] = atoi(s.c_str());\n else { v[i][j] = INF; h[i]++; w[j]++; }\n }\n }\n if(t) cout <<endl;\n t = true;\n vector< vector<int> > ans = solve(v, h, w);\n if(f) { REP(i, H) REP(j, W) if(v[i][j] == INF) cout <<ans[i][j] <<endl; }\n else cout <<\"NO\" <<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1264,
"score_of_the_acc": -0.0734,
"final_rank": 11
},
{
"submission_id": "aoj_1117_1153102",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nconst double EPS=1e-8;\ntypedef vector<double>vec;\ntypedef vector<vec>mat;\ninline double ABS(double a){return max(a,-a);}\nvec gauss_jordan(const mat &A,const vec &b){\n\tint n=A.size();\n\tint m=A[0].size();\n\tmat B(n,vec(m+1));\n\tfor(int i=0;i<n;i++)\n\t\tfor(int j=0;j<m;j++)B[i][j]=A[i][j];\n\tfor(int i=0;i<n;i++)B[i][m]=b[i];\n\tfor(int i=0;i<m;i++){\n\t\tint pivot=i;\n\t\tfor(int j=i;j<n;j++){\n\t\t\tif(ABS(B[j][i])>ABS(B[pivot][i]))pivot=j;\n\t\t}\n\t\tswap(B[i],B[pivot]);\n\t\tif(ABS(B[i][i])<EPS){\n\t\t\treturn vec();\n\t\t}\n\t\tfor(int j=i+1;j<=m;j++)B[i][j]/=B[i][i];\n\t\tfor(int j=0;j<n;j++){\n\t\t\tif(i!=j){\n\t\t\t\tfor(int k=i+1;k<=m;k++)B[j][k]-=B[j][i]*B[i][k];\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=m;i<n;i++)if(ABS(B[i][m])>EPS)return vec();\n\tvec x(m);\n\tfor(int i=0;i<m;i++)x[i]=B[i][m];\n\treturn x;\n}\nchar in[1000];\nint q[110][20];\nint p[110][20];\nint r[110];\nint c[110];\nint main(){\n\tint a,b;\n\tbool fi=false;\n\twhile(scanf(\"%d\",&a),a){\n\t\tif(fi)printf(\"\\n\");\n\t\tfi=true;\n\t\tscanf(\"%d\",&b);\n\t\tfor(int i=0;i<a;i++)r[i]=0;\n\t\tfor(int i=0;i<b;i++)c[i]=0;\n\t\tint t=0;\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++)q[i][j]=-1;\n\t\tfor(int i=0;i<a+1;i++)for(int j=0;j<b+1;j++){\n\t\t\tscanf(\"%s\",in);\n\t\t\tif(in[0]=='?'){\n\t\t\t\tq[i][j]=t++;\n\t\t\t\tr[i]=1;\n\t\t\t\tc[j]=1;\n\t\t\t}else{\n\t\t\t\tsscanf(in,\"%d\",&p[i][j]);\n\t\t\t}\n\t\t}\n\t\tif(t>a+b){\n\t\t\tprintf(\"NO\\n\");continue;\n\t\t}\n\t\tint sk=0;\n\t\tfor(int i=0;i<a;i++)sk+=r[i];\n\t\tfor(int i=0;i<b;i++)sk+=c[i];\n\t\tmat A(sk,vec(t));\n\t\tvec B(sk);\n\t\tint ind=0;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tif(!r[i])continue;\n\t\t\tB[ind]=p[i][b];\n\t\t\tfor(int j=0;j<b;j++){\n\t\t\t\tif(~q[i][j])A[ind][q[i][j]]=1;\n\t\t\t\telse B[ind]-=p[i][j];\n\t\t\t}\n\t\t\tind++;\n\t\t}\n\t\tfor(int i=0;i<b;i++){\n\t\t\tif(!c[i])continue;\n\t\t\tB[ind]=p[a][i];\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tif(~q[j][i])A[ind][q[j][i]]=1;\n\t\t\t\telse B[ind]-=p[j][i];\n\t\t\t}\n\t\t\tind++;\n\t\t}\n\t\tvec x=gauss_jordan(A,B);\n\t\tif(x.size()==0){\n\t\t\tprintf(\"NO\\n\");continue;\n\t\t}\n\t\tfor(int i=0;i<x.size();i++)printf(\"%.0f\\n\",x[i]);\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1248,
"score_of_the_acc": -0.0725,
"final_rank": 8
},
{
"submission_id": "aoj_1117_965138",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <cassert>\n\nusing namespace std;\n\nconstexpr int UNKNOWN = (1 << 25);\n\nvoid solve(vector<vector<int>> &matrix) {\n const int h = matrix.size();\n const int w = matrix[0].size();\n\n vector<vector<bool>> is_question(h - 1, vector<bool>(w - 1));\n vector<pair<int, int>> questions; // r, c\n vector<int> num_qr(h - 1, 0), num_qc(w - 1, 0);\n vector<int> sum_r(h - 1, 0), sum_c(w - 1, 0);\n\n for(int i = 0; i < h - 1; ++i) {\n sum_r[i] += matrix[i][w - 1];\n }\n\n for(int i = 0; i < w - 1; ++i) {\n sum_c[i] += matrix[h - 1][i];\n }\n\n for(int i = 0; i < h - 1; ++i) {\n for(int j = 0; j < w - 1; ++j) {\n if(matrix[i][j] == UNKNOWN) {\n\tquestions.emplace_back(i, j);\n\t++num_qr[i];\n\t++num_qc[j];\n\tis_question[i][j] = true;\n }\n else {\n\tsum_r[i] -= matrix[i][j];\n\tsum_c[j] -= matrix[i][j];\n }\n }\n }\n\n while(!questions.empty()) {\n bool unloop = true;\n int i = 0;\n\n while(i < questions.size()) {\n const int r = questions[i].first;\n const int c = questions[i].second;\n\n int value = UNKNOWN;\n if(num_qr[r] == 1) {\n\tvalue = sum_r[r];\n }\n else if(num_qc[c] == 1) {\n\tvalue = sum_c[c];\n }\n\n if(value == UNKNOWN) {\n\t++i;\n\tcontinue;\n }\n\n matrix[r][c] = value;\n sum_r[r] -= value;\n sum_c[c] -= value;\n --num_qr[r];\n --num_qc[c];\n unloop = false;\n questions.erase(questions.begin() + i);\n }\n\n if(unloop) break;\n }\n\n if(questions.empty()) { // unique answer\n for(int i = 0; i < h - 1; ++i) {\n for(int j = 0; j < w - 1; ++j) {\n\tif(is_question[i][j]) {\n\t cout << matrix[i][j] << endl;\n\t}\n }\n }\n }\n else {\n cout << \"NO\" << endl;\n }\n //cout << endl;\n}\n\nint main(){\n bool first = true;\n for(int p, s; cin >> p >> s && p;) {\n if(!first) cout << endl;\n first = false;\n\n vector<vector<int>> matrix(p + 1, vector<int>(s + 1));\n for(auto &row : matrix) {\n for(auto &e : row) {\n\tstring input;\n\tcin >> input;\n\te = (input == \"?\" ? UNKNOWN : stoi(input));\n }\n }\n\n solve(matrix);\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1260,
"score_of_the_acc": -0.0732,
"final_rank": 10
},
{
"submission_id": "aoj_1117_771419",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <queue>\nusing namespace std;\n\nconst int INF = 1<<28;\n\nconst int MAXN = 105;\nint R, C;\nint G[MAXN][MAXN];\n\nint getValue(int i, int j, int di, int dj) {\n int sum = 0;\n for(int d = -1; d <= 1; d += 2) {\n int ni = i;\n int nj = j;\n for(ni = i, nj = j;\n 0 <= ni && ni < R && 0 <= nj && nj < C;\n ni += d*di, nj += d*dj) {\n if(ni == i && nj == j) continue;\n if(G[ni][nj] == INF) return INF;\n sum -= G[ni][nj];\n }\n if(ni >= 0 && nj >= 0) sum += G[ni][nj];\n }\n return sum;\n}\n\nint main() {\n while(cin >> R && R) {\n cin >> C;\n for(int i = 0; i < R+1; ++i) {\n for(int j = 0; j < C+1; ++j) {\n string s;\n cin >> s;\n if(s == \"?\") {\n G[i][j] = INF;\n } else {\n G[i][j] = atoi(s.c_str());\n\n }\n }\n }\n queue<pair<int,int> > que;\n int n = 0;\n for(int i = 0; i < R; ++i) {\n for(int j = 0; j < C; ++j) {\n if(G[i][j] == INF) {\n que.push(make_pair(i,j));\n ++n;\n }\n }\n }\n vector<pair<pair<int,int>, int> > res;\n while(!que.empty()) {\n int i = que.front().first;\n int j = que.front().second;\n que.pop();\n if(G[i][j] != INF) continue;\n int u = getValue(i,j,1,0);\n int v = getValue(i,j,0,1);\n if(u != INF || v != INF) {\n G[i][j] = min(u,v);\n res.push_back(make_pair(make_pair(i,j),G[i][j]));\n for(int k = 0; k < C; ++k) {\n if(G[i][k] == INF) que.push(make_pair(i,k));\n }\n for(int k = 0; k < R; ++k) {\n if(G[k][j] == INF) que.push(make_pair(k,j));\n }\n }\n }\n\n static bool first = true;\n if(first) first = false;\n else cout << endl;\n if(res.size() != n) {\n cout << \"NO\" << endl;\n } else {\n sort(res.begin(), res.end());\n for(int i = 0; i < res.size(); ++i) {\n cout << res[i].second << endl;\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1300,
"score_of_the_acc": -0.0755,
"final_rank": 12
},
{
"submission_id": "aoj_1117_670094",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<deque>\n#include<sstream>\n#include<cstdlib>\n#include<cassert>\n#define MAX 1000\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<29)\nusing namespace std;\ntypedef pair<int,int> P;\nint h,w;\nint G[MAX][MAX];\nint A[MAX][2];// 0->r, 1->c\nP B[MAX][2];\nint C[MAX][2];\nint D[MAX][2];\n \nP Bsearch(int a,int b)\n{\n int Size = (b == 0?h:w);\n for(int i=0;i<Size;i++)\n {\n if(b == 0)\n {\n if(G[i][a] == -inf)return P(a,i);\n }\n else\n {\n if(G[a][i] == -inf)return P(i,a);\n }\n }\n}\n \nint main()\n{\n int blank = false;\n while(true)\n {\n cin >> h;\n if(!h)break;\n cin >> w;\n rep(i,MAX)rep(j,2)A[i][j] = C[i][j] = 0,B[i][j] = P(-inf,-inf);\n \n vector<P> ans;\n int hatena = 0;\n rep(i,h)\n {\n rep(j,w)\n {\n string input;\n cin >> input;\n if(input[0] == '?')\n {\n G[i][j] = -inf; \n A[j][0]++;\n B[j][0] = P(j,i);\n A[i][1]++;\n B[i][1] = P(j,i);\n ans.push_back(P(j,i));\n }\n else\n {\n G[i][j] = (atoi)(input.c_str());\n C[j][0] += G[i][j];\n C[i][1] += G[i][j];\n }\n }\n cin >> D[i][1];\n }\n rep(i,w+1)\n cin >> D[i][0];\n \n\n bool Fin = true;\n bool found = false;\n \n while(true)\n {\n Fin = true;\n found = false;\n rep(i,w)\n {\n if(A[i][0] >= 1)Fin = false;\n if(A[i][0] == 1)\n {\n //cout << \"erase! \" << B[i][0].first << \",\" << B[i][0].second << endl;\n found = true; \n int value = D[i][0]-C[i][0];\n P p = Bsearch(i,0);\n C[p.first][0]+=value;\n C[p.second][1]+=value;\n A[p.first][0]--;\n A[p.second][1]--;\n assert( G[p.second][p.first] == -inf);\n G[p.second][p.first] = value;\n }\n }\n rep(i,h)\n {\n if(A[i][1] >= 1)Fin = false;\n if(A[i][1] == 1)\n {\n //cout << \"erase! \" << B[i][1].first << \",\" << B[i][1].second << endl;\n found = true; \n int value = D[i][1]-C[i][1];\n P p = Bsearch(i,1);\n C[p.first][0]+=value;\n C[p.second][1]+=value;\n A[p.first][0]--;\n A[p.second][1]--;\n assert(G[p.second][p.first] == -inf);\n G[p.second][p.first] = value;\n }\n }\n \n if(!Fin && !found)\n break;\n if(Fin)break;\n \n }\n if(!blank)blank = true;\n else cout << endl;\n if(!Fin && !found)\n cout << \"NO\" << endl;\n else\n {\n rep(i,ans.size())\n cout << G[ans[i].second][ans[i].first] << endl;\n \n \n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1640,
"score_of_the_acc": -0.0952,
"final_rank": 15
},
{
"submission_id": "aoj_1117_669885",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <sstream>\n#include <queue>\nusing namespace std;\n\nconst int INF = 1<<29;\n\nint toInt(string s){\n stringstream ss;\n ss << s;\n int a;\n ss >> a;\n return a;\n}\n\nint main(){\n int p,s;\n bool flag = false;\n while(cin >> p && p){\n if(flag) cout << endl;\n flag = true;\n cin >> s;\n s++,p++;\n vector<vector<int> >v;\n v.resize(p,vector<int>(s));\n // cin.ignore();\n\n string str;\n vector<pair<int,int> >pos;\n int total = 0;\n int r_hatena[p];\n int c_hatena[s];\n int r[p];\n int c[s];\n\n fill(r_hatena,r_hatena+p,0);\n fill(c_hatena,c_hatena+s,0);\n fill(r,r+p,0);\n fill(c,c+s,0);\n\n for(int i=0; i<p; i++){\n for(int j=0; j<s; j++){\n\tcin >> str;\n\tif(str == \"?\"){\n\t total++;\n\t v[i][j] = INF;\n\t pos.push_back(pair<int,int>(j,i));\n\t}\n\telse v[i][j] = toInt(str);\n }\n }\n\n\n for(int i=0; i<p; i++){\n int sum = 0;\n for(int j=0; j<s; j++){\n\tif(v[i][j] == INF) c_hatena[j]++;\n\telse if(j != s-1) sum += v[i][j];\n }\n r[i] = sum;\n }\n\n\n for(int i=0; i<s; i++){\n int sum = 0;\n for(int j=0; j<p; j++){\n\tif(v[j][i] == INF) r_hatena[j]++;\n\telse if(j != p-1) sum += v[j][i];\n }\n c[i] = sum;\n }\n\n\n priority_queue<pair<bool,int>,vector<pair<bool,int> >,\n greater<pair<bool,int> > >que;\n\n for(int i=0; i<s; i++){\n if(c_hatena[i] == 1){\n\tque.push(pair<bool,int>(true,i));\n }\n\n }\n\n for(int i=0; i<p; i++){\n if(r_hatena[i] == 1){\n\tque.push(pair<bool,int>(false,i));\n }\n }\n\n //p tate s yoko\n //0 is row 1 is column\n while(!que.empty()){\n pair<bool,int> tmp = que.top();\n que.pop();\n\n if(tmp.first == 0){\n\tif(r_hatena[tmp.second] <= 0)continue;\n\n\tfor(int i=0; i<s; i++){\n\t if(v[tmp.second][i] == INF){\n\t v[tmp.second][i] = v[tmp.second][s-1]-r[tmp.second];\n\t //\t cout << v[tmp.second][s-1] << endl;\n\t //\t cout << r[tmp.second] << endl;\n\t r_hatena[tmp.second]--;\n\t c_hatena[i]--;\n\t //\t cout << tmp.second << \" \" << i << endl;\n\t total--;\n\t c[i] += v[tmp.second][i];\n\t if(c_hatena[i] == 1)\n\t que.push(pair<bool,int>(1,i));\n\t }\n\t}\n\n\n\n\n\n } else {\n\tif(c_hatena[tmp.second] <= 0)continue;\n\tfor(int i=0; i<p; i++){\n\t if(v[i][tmp.second] == INF){\n\t //\t cout << i << \" \" << tmp.second << endl;\n\t v[i][tmp.second] = v[p-1][tmp.second]-c[tmp.second];\n\t c_hatena[tmp.second]--;\n\t r_hatena[i]--;\n\t //\t cout << i << \" \" << tmp.second << endl;\n\t //\t cout << c_hatena[tmp.second] << endl;\n\t //\t cout << r_hatena[i] << endl;\n\t r[i] += v[i][tmp.second];\n\t total--;\n\t if(r_hatena[i] == 1)\n\t que.push(pair<bool,int>(0,i));\n\t //\t cout << v[i][tmp.second] << endl;\n\t }\n\t}\n\n }\n\n\n\n\n\n\n }\n\n \n\n if(total <= 0){\n for(int i=0; i<pos.size(); i++){\n\tint x = pos[i].first;\n\tint y = pos[i].second;\n\tcout << v[y][x] << endl;\n }\n } else cout << \"NO\" << endl;\n // cout << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1268,
"score_of_the_acc": -0.0895,
"final_rank": 13
},
{
"submission_id": "aoj_1117_669848",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<deque>\n#include<sstream>\n#include<cstdlib>\n#include<cassert>\n#define MAX 1000\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<29)\nusing namespace std;\ntypedef pair<int,int> P;\nint h,w;\nint G[MAX][MAX];\nint A[MAX][2];// 0->r, 1->c\nP B[MAX][2];\nint C[MAX][2];\nint D[MAX][2];\n\nvoid printA()\n{\n cout << \"printA---\" << endl;\n rep(i,w)cout << A[i][0] << \" \"; cout << endl;\n rep(i,h)cout << A[i][1] << \" \"; cout << endl;\n cout << endl;\n}\n\nvoid printB()\n{\n cout << \"printB---\" << endl;\n rep(i,w)cout << B[i][0].first << \",\" << B[i][0].second << \" \"; cout << endl;\n rep(i,h)cout << B[i][1].first << \",\" << B[1][i].second << \" \"; cout << endl;\n cout << endl;\n}\n\nvoid printC()\n{\n cout << \"printC---\" << endl;\n rep(i,w)cout << C[i][0] << \" \"; cout << endl;\n rep(i,h)cout << C[i][1] << \" \"; cout << endl;\n cout << endl;\n}\n\nvoid printD()\n{\n cout << \"printD---\" << endl;\n rep(i,w)cout << D[i][0] << \" \"; cout << endl;\n rep(i,h)cout << D[i][1] << \" \"; cout << endl;\n}\n\nP Bsearch(int a,int b)\n{\n int Size = (b == 0?h:w);\n for(int i=0;i<Size;i++)\n {\n if(b == 0)\n\t{\n\t if(G[i][a] == -inf)return P(a,i);\n\t}\n else\n\t{\n\t if(G[a][i] == -inf)return P(i,a);\n\t}\n }\n}\n\nint main()\n{\n int blank = false;\n while(true)\n {\n cin >> h;\n if(!h)break;\n cin >> w;\n rep(i,MAX)rep(j,2)A[i][j] = C[i][j] = 0,B[i][j] = P(-inf,-inf);\n\n vector<P> ans;\n int hatena = 0;\n rep(i,h)\n\t{\n\t rep(j,w)\n\t {\n\t string input;\n\t cin >> input;\n\t if(input[0] == '?')\n\t\t{\n\t\t G[i][j] = -inf; \n\t\t A[j][0]++;\n\t\t B[j][0] = P(j,i);\n\t\t A[i][1]++;\n\t\t B[i][1] = P(j,i);\n\t\t ans.push_back(P(j,i));\n\t\t}\n\t else \n\t\t{\n\t\t G[i][j] = (atoi)(input.c_str());\n\t\t C[j][0] += G[i][j];\n\t\t C[i][1] += G[i][j];\n\t\t}\n\t }\n\t cin >> D[i][1];\n\t}\n rep(i,w+1)\n\tcin >> D[i][0];\n\t\n //printA();\n //printB();\n //printC();\n //printD();\n //return 0;\n bool Fin = true;\n bool found = false;\n\n while(true)\n\t{\n\t //cout << \"phase !\" << endl;\n\t //printA();\n\t //printB();\n\t //printC();\n\t //printD();\n\t Fin = true;\n\t found = false;\n\t rep(i,w)\n\t {\n\t if(A[i][0] >= 1)Fin = false;\n\t if(A[i][0] == 1)\n\t\t{\n\t\t //cout << \"erase! \" << B[i][0].first << \",\" << B[i][0].second << endl;\n\t\t found = true;\t\n\t\t int value = D[i][0]-C[i][0];\n\t\t P p = Bsearch(i,0);\n\t\t C[p.first][0]+=value;\n\t\t C[p.second][1]+=value;\n\t\t A[p.first][0]--;\n\t\t A[p.second][1]--;\n\t\t assert( G[p.second][p.first] == -inf);\n\t\t G[p.second][p.first] = value;\n\t\t}\n\t }\n\t rep(i,h)\n\t {\n\t if(A[i][1] >= 1)Fin = false;\n\t if(A[i][1] == 1)\n\t\t{\n\t\t //cout << \"erase! \" << B[i][1].first << \",\" << B[i][1].second << endl;\n\t\t found = true;\t\n\t\t int value = D[i][1]-C[i][1];\n\t\t P p = Bsearch(i,1);\n\t\t C[p.first][0]+=value;\n\t\t C[p.second][1]+=value;\n\t\t A[p.first][0]--;\n\t\t A[p.second][1]--;\n\t\t assert(G[p.second][p.first] == -inf);\n\t\t G[p.second][p.first] = value;\n\t\t}\n\t }\n\n\t if(!Fin && !found)\n\t break;\n\t if(Fin)break;\n\n\t}\n if(!blank)blank = true;\n else cout << endl;\n\t if(!Fin && !found)\n\t cout << \"NO\" << endl;\n\t else\n\t {\n\t rep(i,ans.size())\n\t\tcout << G[ans[i].second][ans[i].first] << endl;\n\n\t\t\n\t }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1648,
"score_of_the_acc": -0.0957,
"final_rank": 16
},
{
"submission_id": "aoj_1117_669831",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <sstream>\n#include <vector>\nusing namespace std;\n\nint H, W;\nstring field[1010][1010];\nstring diff[1010][1010];\nint totals[2][1010];\nint total;\n\nint toInt(string s){\n istringstream iss(s);\n int n;\n iss >> n;\n return n;\n}\n\nstring toString(int n){\n ostringstream oss;\n oss << n;\n return oss.str();\n}\n\nvoid Wcalc(int h, int x){\n int sum = 0;\n for(int j = 0 ; j < W ; j++){\n if(field[h][j] == \"?\") continue;\n else sum += toInt(field[h][j]);\n }\n /*\n cout << \"x = \" << x << \", y = \" << h << endl;\n cout << \"sum = \" << sum << endl;\n cout << totals[0][h] << endl;\n */\n field[h][x] = toString(totals[0][h] - sum);\n}\n\nvoid Hcalc(int w, int y){\n int sum = 0;\n for(int i = 0 ; i < H ; i++){\n if(field[i][w] == \"?\") continue;\n else sum += toInt(field[i][w]);\n }\n /*\n cout << \"x = \" << w << \", y = \" << y << endl;\n cout << totals[1][w] << endl;\n */\n field[y][w] = toString(totals[1][w] - sum);\n}\n\n\nint main(){\n bool flag = false;\n while(cin >> H){\n if(H == 0) break;\n if(flag) cout << endl;\n if(!flag) flag = true;\n \n cin >> W;\n \n \n int q = 0;\n \n for(int i = 0 ; i < H ; i++){\n for(int j = 0 ; j < W ; j++){\n\tcin >> field[i][j];\n\tdiff[i][j] = field[i][j];\n\tif(field[i][j] == \"?\") q++;\n }\n cin >> totals[0][i];\n }\n \n for(int i = 0 ; i < W ; i++){\n cin >> totals[1][i];\n }\n cin >> total;\n \n bool cansolve = true;\n while(1){\n int tmp = q;\n for(int i = 0 ; i < H ; i++){\n\tint qcnt = 0;\n\tint w;\n\tfor(int j = 0 ; j < W ; j++){\n\t if(field[i][j] == \"?\") w = j, qcnt++;\n\t}\n\tif(qcnt == 1){\n\t Wcalc(i, w);\n\t q--;\n\t}\n }\n \n for(int j = 0 ; j < W ; j++){\n\tint qcnt = 0;\n\tint h;\n\tfor(int i = 0 ; i < H ; i++){\n\t if(field[i][j] == \"?\") h = i, qcnt++;\n\t}\n\tif(qcnt == 1){\n\t Hcalc(j, h);\n\t q--;\n\t}\n }\n \n if(q == 0) break;\n \n if(q == tmp){\n\tcansolve = false;\n\tbreak;\n }\n }\n \n if(!cansolve){\n cout << \"NO\" << endl;\n continue;\n }\n \n vector<string> ans;\n for(int i = 0 ; i < H ; i++){\n for(int j = 0 ; j < W ; j++){\n\tif(diff[i][j] == \"?\"){\n\t ans.push_back(field[i][j]);\n\t}\n }\n }\n \n for(int i = 0 ; i < ans.size() ; i++){\n cout << ans[i] << endl;\n }\n /*\n for(int i = 0 ; i < H ; i++){\n for(int j = 0 ; j < W ; j++){\n\tcout << field[i][j] << ' ';\n }\n cout << endl;\n }\n cout << endl;\n */\n } \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 17224,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_1117_669790",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <cstdlib>\n#include <queue>\nusing namespace std;\n\ntypedef long long lli;\n\nconst int MAXR = 102;\nconst int MAXC = 12;\nconst lli INF = 1LL<<60;\n\nint R, C;\nlli G[MAXR][MAXC];\nint numR[MAXR], numC[MAXC];\n\nint main() {\n bool first = true;\n while(cin >> R && R) {\n cin >> C;\n vector<pair<int,int> > v;\n for(int i = 0; i < R+1; ++i) {\n for(int j = 0; j < C+1; ++j) {\n string s;\n cin >> s;\n if(s == \"?\") {\n G[i][j] = INF;\n v.push_back(make_pair(i,j));\n } else {\n G[i][j] = atoi(s.c_str());\n }\n }\n }\n\n fill(numR, numR+MAXR, 0);\n fill(numC, numC+MAXC, 0);\n for(int i = 0; i < R; ++i) {\n for(int j = 0; j < C; ++j) {\n if(G[i][j] == INF) {\n ++numR[i];\n ++numC[j];\n }\n }\n }\n\n queue<pair<int,int> > que;\n for(int i = 0; i < R; ++i) {\n for(int j = 0; j < C; ++j) {\n if(G[i][j] == INF) {\n if(numR[i] == 1 || numC[j] == 1) {\n que.push(make_pair(i,j));\n }\n }\n }\n }\n\n while(!que.empty()) {\n pair<int,int> p = que.front();\n que.pop();\n if(G[p.first][p.second] != INF) continue;\n\n lli sum;\n bool flag = false;\n if(!flag) {\n flag = true;\n sum = G[p.first][C];\n for(int j = 0; j < C; ++j) {\n if(j == p.second) continue;\n if(G[p.first][j] == INF) {\n flag = false;\n break;\n }\n sum -= G[p.first][j];\n }\n }\n if(!flag) {\n flag = true;\n sum = G[R][p.second];\n for(int i = 0; i < R; ++i) {\n if(i == p.first) continue;\n if(G[i][p.second] == INF) {\n flag = false;\n break;\n }\n sum -= G[i][p.second];\n }\n }\n\n if(flag) {\n G[p.first][p.second] = sum;\n if(--numR[p.first] == 1) {\n for(int j = 0; j < C; ++j) {\n if(G[p.first][j] == INF) {\n que.push(make_pair(p.first, j));\n break;\n }\n }\n }\n if(--numC[p.second] == 1) {\n for(int i = 0; i < R; ++i) {\n if(G[i][p.second] == INF) {\n que.push(make_pair(i, p.second));\n break;\n }\n }\n }\n }\n }\n\n vector<lli> ans;\n for(int i = 0; i < v.size(); ++i) {\n if(G[v[i].first][v[i].second] == INF) {\n ans.clear();\n break;\n }\n ans.push_back(G[v[i].first][v[i].second]);\n }\n\n if(first) {\n first = false;\n } else {\n cout << endl;\n }\n if(ans.size()) {\n for(int i = 0; i < ans.size(); ++i) {\n cout << ans[i] << endl;\n }\n } else {\n cout << \"NO\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1252,
"score_of_the_acc": -0.0727,
"final_rank": 9
},
{
"submission_id": "aoj_1117_442154",
"code_snippet": "#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <utility>\n#include <functional>\n#include <sstream>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\n#include <ctime>\n#include <climits>\n#include <cassert>\nusing namespace std;\ninline int toInt (string s) {int v; istringstream sin(s); sin>>v; return v;}\ntemplate<class T> inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\ntypedef long long ll;\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(),(a).rend()\n#define EACH(t,i,c) for(t::iterator i=(c).begin();i!=(c).end();++i)\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\nconst double EPS=1e-10;\nconst double PI=acos(-1.0);\n\n\nconst int UNDEF=INT_MAX;\nint main(){\n\tint p,s;\n\tint cc=0;\n\twhile(cin>>p,p){\n\t\tif(cc){\n\t\t\tcout<<endl<<endl;\n\t\t}\n\t\tcin>>s;\n\t\tvvi cells(p+1,vi(s+1,UNDEF));\n\t\tvector<pii> undefs;\n\t\tREP(i,p+1){\n\t\t\tREP(j,s+1){\n\t\t\t\tstring s;\n\t\t\t\tcin>>s;\n\t\t\t\tif(s==\"?\"){\n\t\t\t\t\tcells[i][j]=UNDEF;\n\t\t\t\t\tundefs.push_back(make_pair(i,j));\n\t\t\t\t}else{\n\t\t\t\t\tcells[i][j]=toInt(s);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tvi ans(undefs.size());\n\n\t\tbool flag=true;\n\t\tvi used(undefs.size(),0);\n\t\twhile(flag){\n\t\t\tflag=false;\n\t\t\tREP(kk,undefs.size()){\n\t\t\t\tif(used[kk])continue;\n\t\t\t\tpii u=undefs[kk];\n\n\t\t\t\t{\n\t\t\t\tint sum2=0;\n\t\t\t\tREP(i,s){\n\t\t\t\t\tif(cells[u.first][i]==UNDEF){\n\t\t\t\t\t\tif(i!=u.second){\n\t\t\t\t\t\t\tgoto ng_s;\n\t\t\t\t\t\t}\n\t\t\t\t\t}else{\n\t\t\t\t\t\tsum2+=cells[u.first][i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tans[kk]=(cells[u.first][s]-sum2);\n\t\t\t\tcells[u.first][u.second]=ans[kk];\n\t\t\t\tused[kk]=1;\n\t\t\t\tflag=true;\n\t\t\t\tgoto ng_p;\n\t\t\t\t}\nng_s:;\n\t {\n\t\t\t\tint sum1=0;\n\t\t\t\tREP(i,p){\n\t\t\t\t\tif(cells[i][u.second]==UNDEF){\n\t\t\t\t\t\tif(i!=u.first){\n\t\t\t\t\t\t\tgoto ng_p;\n\t\t\t\t\t\t}\n\t\t\t\t\t}else{\n\t\t\t\t\t\tsum1+=cells[i][u.second];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tans[kk]=(cells[p][u.second]-sum1);\n\t\t\t\tcells[u.first][u.second]=ans[kk];\n\t\t\t\tused[kk]=1;\n\t\t\t\tflag=true;\n\t }\n\tng_p:;\n\t\t\t}\n\t\t}\n\n\t\tif(find(ALL(used),0)==used.end()){\n\t\t\tREP(i,ans.size()){\n\t\t\t\tif(i==ans.size()-1){\n\t\t\t\t\tcout<<ans[i];\n\t\t\t\t}else{\n\t\t\t\t\tcout<<ans[i]<<endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}else{\n\t\t\tcout<<\"NO\";\n\t\t}\n\t\tcc++;\n\t}\n\tcout<<endl;\n\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 0,
"score_of_the_acc": -0.0159,
"final_rank": 5
},
{
"submission_id": "aoj_1117_435794",
"code_snippet": "#include<iostream>\n#include<sstream>\nusing namespace std;\n\nbool q[110][110],v[110][110],f;\nint num[110][110],sum,pos;\nint p,s,tp[110],ts[110],cq[110],rq[110];\nstring tmp;\n\nint stoi(string x){\n stringstream ss(x);\n int n;\n ss >> n;\n return n;\n}\n\n\nint main(){\n f = true;\n while(cin >> p,p){\n if(!f)cout << endl;\n f = false;\n cin >> s; cin.ignore();\n \n for(int i=0;i<p;i++)rq[i] = 0;\n for(int i=0;i<s;i++)cq[i] = 0;\n\n for(int i=0;i<p;i++){\n for(int j=0;j<s;j++){\n\tcin >> tmp;\n\tif(tmp == \"?\"){\n\t q[i][j] = v[i][j] = false;\n\t rq[i]++; cq[j]++;\n\t}else{\n\t q[i][j] = v[i][j] = true;\n\t num[i][j] = stoi(tmp);\n\t}\n }\n cin >> tp[i]; cin.ignore();\n }\n for(int i=0;i<s;i++)cin >> ts[i];\n cin >> tmp;\n\n bool update = true;\n while(update){\n update = false;\n for(int i=0;i<p;i++){\n\tif(rq[i] == 1){\n\t sum = 0;\n\t for(int j=0;j<s;j++){\n\t if(!v[i][j])pos = j;\n\t else sum += num[i][j];\n\t }\n\t num[i][pos] = tp[i] - sum;\n\t v[i][pos] = true;\n\t rq[i]--; cq[pos]--;\n\t update = true;\n\t}\n }\n for(int i=0;i<s;i++){\n\tif(cq[i] == 1){\n\t sum = 0;\n\t for(int j=0;j<p;j++){\n\t if(!v[j][i])pos = j;\n\t else sum += num[j][i];\n\t }\n\t num[pos][i] = ts[i] - sum;\n\t v[pos][i] = true;\n\t rq[pos]--; cq[i]--;\n\t update = true;\n\t}\n }\n }\n\n int ans = 0;\n for(int i=0;i<p;i++)ans |= rq[i];\n for(int i=0;i<s;i++)ans |= cq[i];\n \n\n if(ans)cout << \"NO\\n\";\n else{\n for(int i=0;i<p;i++){\n\tfor(int j=0;j<s;j++){\n\t if(!q[i][j])cout << num[i][j] << endl;\n\t}\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1117_430496",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <sstream>\n\nusing namespace std;\n\n#define INF 1 << 28\n\nstring to_s(int n) {\n ostringstream oss;\n oss << n;\n return oss.str();\n}\n\nint to_i(string s) {\n int n;\n istringstream is;\n is.str(s);\n is >> n;\n return n;\n}\n\nint main() {\n int h, w;\n bool nikaime = false;\n while (cin >> h >> w) {\n int field[h+1][w+1];\n string s;\n vector<pair<int, int> > unknown; \n for (int i = 0; i < h+1; i++) {\n for (int j = 0; j < w+1; j++) {\n cin >> s;\n if (s == \"?\") {\n field[i][j] = INF;\n unknown.push_back(pair<int,int>(i, j));\n } else {\n field[i][j] = to_i(s);\n }\n }\n }\n\n for (int k = 0; k < 100; k++) {\n int unknown_x;\n for (int i = 0; i < h; i++) {\n int unknown_count = 0;\n for (int j = 0; j < w; j++) {\n if (field[i][j] == INF) {\n unknown_count++;\n unknown_x = j;\n }\n }\n if (unknown_count == 1) {\n int sum = 0;\n for (int j = 0; j < w; j++) {\n if (j != unknown_x) {\n sum += field[i][j];\n }\n }\n field[i][unknown_x] = field[i][w] - sum;\n }\n }\n \n int unknown_y;\n for (int i = 0; i < w; i++) {\n int unknown_count = 0;\n for (int j = 0; j < h; j++) {\n if (field[j][i] == INF) {\n unknown_count++;\n unknown_y = j;\n }\n }\n if (unknown_count == 1) {\n int sum = 0;\n for (int j = 0; j < h; j++) {\n if (j != unknown_y) {\n sum += field[j][i];\n }\n }\n field[unknown_y][i] = field[h][i] - sum;\n }\n }\n }\n\n// int unknown_x;\n// for (int i = 0; i < h; i++) {\n// int unknown_count = 0;\n// for (int j = 0; j < w; j++) {\n// if (field[i][j] == INF) {\n// unknown_count++;\n// unknown_x = j;\n// }\n// }\n// if (unknown_count == 1) {\n// int sum = 0;\n// for (int j = 0; j < w; j++) {\n// if (j != unknown_x) {\n// sum += field[i][j];\n// }\n// }\n// field[i][unknown_x] = field[i][w] - sum;\n// }\n// }\n\n string ans;\n for (int i = 0; i < unknown.size(); i++) {\n if (field[unknown[i].first][unknown[i].second] == INF) {\n ans = \"NO\\n\";\n break;\n } else {\n ans += to_s(field[unknown[i].first][unknown[i].second]);\n ans += \"\\n\";\n }\n }\n\n if (nikaime) {\n cout << endl;\n }\n\n cout << ans;\n\n nikaime = true;\n \n// for (int i = 0; i < h+1; i++) {\n// for (int j = 0; j < w+1; j++) {\n// if (field[i][j] == INF) {\n// cout << \"x \";\n// } else {\n// cout << field[i][j] << ' ';\n// }\n// }\n// cout << endl;\n// }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 964,
"score_of_the_acc": -0.0718,
"final_rank": 7
},
{
"submission_id": "aoj_1117_388947",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cstring>\n#include <string>\n#include <sstream>\n#include <cstdlib>\n\nusing namespace std;\n\nint p,s;\nconst int QST=1000000000;\nint table[201][21];\nint origTable[201][21];\n\nint main(){\n bool fst=true;\n while(cin>>p&&p){\n if(!fst)cout<<endl;\n fst=false;\n int cnt=0;\n cin>>s;\n string str;\n for(int i=0;i<=p;i++){\n for(int j=0;j<=s;j++){\n\tcin>>str;\n\tif(str[0]=='?'){\n\t table[i][j]=QST;\n\t origTable[i][j]=table[i][j];\n\t cnt++;\n\t}\n\telse{\n\t int num=atoi(str.c_str());\n\t table[i][j]=num;\n\t origTable[i][j]=table[i][j];\n\t}\n }\n }\n bool update=true,isFail=false;\n while(update){\n update=false;\n for(int i=0;i<=p;i++){\n\tint c=0;\n\tint last=-1;\n\tfor(int j=0;j<=s;j++){\n\t if(table[i][j]==QST){\n\t c++;\n\t last=j;\n\t }\n\t}\n\tif(c==1){\n\t int sum=0;\n\t if(last==s){\n\t for(int j=0;j<s;j++)sum+=table[i][j];\n\t table[i][last]=sum;\n\t }\n\t else{\n\t sum=table[i][s];\n\t for(int j=0;j<s;j++)if(table[i][j]!=QST)sum-=table[i][j];\n\t table[i][last]=sum;\n\t }\n\t cnt--;\n\t update=true;\n\t break;\n\t}\n }\n for(int j=0;j<=s;j++){\n\tint c=0;\n\tint last=-1;\n\tfor(int i=0;i<=p;i++){\n\t if(table[i][j]==QST){\n\t c++;\n\t last=i;\n\t }\n\t}\n\tif(c==1){\n\t int sum=0;\n\t if(last==p){\n\t for(int i=0;i<p;i++)sum+=table[i][j];\n\t table[last][j]=sum;\n\t }\n\t else{\n\t sum=table[p][j];\n\t for(int i=0;i<p;i++)if(table[i][j]!=QST)sum-=table[i][j];\n\t table[last][j]=sum;\n\t }\n\t cnt--;\n\t update=true;\n\t break;\n\t}\n }\n if(cnt>0&&!update){\n\tisFail=true;\n\tbreak;\n }\n // 矛盾が起きてるかどうかを調べる\n for(int i=0;i<=p;i++){\n\tint sum=0;\n\tbool ok=true;\n\tfor(int j=0;j<=s;j++){\n\t if(table[i][j]==QST){\n\t ok=false;break;\n\t }\n\t else if(j!=s)sum+=table[i][j];\n\t}\n\t// fail\n\tif(!ok)continue;\n\t// 全部埋まってる\n\tif(sum!=table[i][s]){\n\t update=false;\n\t isFail=true;\n\t break;\n\t}\n }\n for(int j=0;j<=s;j++){\n\tint sum=0;\n\tbool ok=true;\n\tfor(int i=0;i<=p;i++){\n\t if(table[i][j]==QST){\n\t ok=false;break;\n\t }\n\t else if(i!=p)sum+=table[i][j];\n\t}\n\t// fail\n\tif(!ok)continue;\n\tif(!(sum==table[p][j])){\n\t update=false;\n\t isFail=true;\n\t break;\n\t}\n }\n }\n if(isFail)cout<<\"NO\"<<endl;\n else{\n for(int i=0;i<=p;i++)\n\tfor(int j=0;j<=s;j++)\n\t if(origTable[i][j]==QST)\n\t cout<<table[i][j]<<endl;\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1117_388365",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\" \"; cout<<endl; }\n\ntypedef long long ll;\ntypedef pair<int,int> P;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n\nint main(){\n int R,C;\n bool f = false;\n while(cin>>R>>C){\n if(f) cout<<endl;\n else f = true;\n int data[101][101];\n int cntx[101]={};\n int cnty[101]={};\n vector<P> fout;\n REP(y,R+1)REP(x,C+1){\n string s; cin>>s;\n if(s == \"?\") {\n data[y][x] = -INF;\n fout.push_back(P(x,y));\n cntx[x]++;\n cnty[y]++;\n } else {\n data[y][x] = atoi(s.c_str());\n }\n }\n while(true){\n bool updata = false;\n REP(y,R+1){\n if(cnty[y] == 1){\n updata = true;\n int sum = 0;\n REP(x,C+1)if(data[y][x]!=-INF)sum += ((x==C)?1:-1) * data[y][x];\n REP(x,C+1)if(data[y][x]==-INF){\n data[y][x] = ((x==C)?-1:1) * sum;\n cntx[x]--;\n cnty[y]--;\n }\n }\n }\n REP(x,C+1){\n if(cntx[x] == 1){\n cntx[x] = 0;\n updata = true;\n int sum = 0;\n REP(y,R+1)if(data[y][x]!=-INF)sum += ((y==R)?1:-1) * data[y][x];\n REP(y,R+1)if(data[y][x]==-INF){\n data[y][x] = ((y==R)?-1:1) * sum;\n cntx[x]--;\n cnty[y]--;\n }\n }\n }\n if(!updata) break;\n }\n int cnt = 0;\n REP(y,R+1)REP(x,C+1)if(data[y][x]==-INF) cnt++;\n if(cnt > 0) cout<<\"NO\"<<endl;\n else {\n REP(i, fout.size()){\n cout<<data[fout[i].second][fout[i].first]<<endl;\n }\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1117_380158",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <queue>\n#include <utility>\n#include <cstdlib>\n\nusing namespace std;\ntypedef pair<int, int> pii;\nconst int MISSING = 0x7fffffff;\n\nint main(){\n\tbool first = true;\n\twhile(true){\n\t\tint p, s;\n\t\tcin >> p;\n\t\tif(p == 0){ break; }\n\t\tif(!first){ cout << endl; }\n\t\tfirst = false;\n\t\tcin >> s;\n\t\tvector< vector<int> > table(p + 1, vector<int>(s + 1));\n\t\tvector< vector<bool> > missing(p, vector<bool>(s));\n\t\tfor(int i = 0; i <= p; ++i){\n\t\t\tfor(int j = 0; j <= s; ++j){\n\t\t\t\tstring item;\n\t\t\t\tcin >> item;\n\t\t\t\tif(item == \"?\"){\n\t\t\t\t\ttable[i][j] = MISSING;\n\t\t\t\t\tmissing[i][j] = true;\n\t\t\t\t}else{\n\t\t\t\t\ttable[i][j] = atoi(item.c_str());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tqueue<pii> q;\n\t\tfor(int i = 0; i < p; ++i){\n\t\t\tint count = 0, pos = 0, sum = 0;\n\t\t\tfor(int j = 0; j < s; ++j){\n\t\t\t\tif(table[i][j] == MISSING){\n\t\t\t\t\t++count;\n\t\t\t\t\tpos = j;\n\t\t\t\t}else{\n\t\t\t\t\tsum += table[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count == 1){ table[i][pos] = table[i][s] - sum; }\n\t\t}\n\t\tfor(int i = 0; i < s; ++i){\n\t\t\tint count = 0, pos = 0, sum = 0;\n\t\t\tfor(int j = 0; j < p; ++j){\n\t\t\t\tif(table[j][i] == MISSING){\n\t\t\t\t\t++count;\n\t\t\t\t\tpos = j;\n\t\t\t\t}else{\n\t\t\t\t\tsum += table[j][i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count == 1){\n\t\t\t\ttable[pos][i] = table[p][i] - sum;\n\t\t\t\tq.push(pii(0, pos));\n\t\t\t}\n\t\t}\n\t\twhile(!q.empty()){\n\t\t\tpii e = q.front();\n\t\t\tq.pop();\n\t\t\tif(e.first == 0){\n\t\t\t\tint count = 0, pos = 0, sum = 0;\n\t\t\t\tfor(int i = 0; i < s; ++i){\n\t\t\t\t\tif(table[e.second][i] == MISSING){\n\t\t\t\t\t\t++count;\n\t\t\t\t\t\tpos = i;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tsum += table[e.second][i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(count == 1){\n\t\t\t\t\ttable[e.second][pos] = table[e.second][s] - sum;\n\t\t\t\t\tq.push(pii(1, pos));\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tint count = 0, pos = 0, sum = 0;\n\t\t\t\tfor(int i = 0; i < p; ++i){\n\t\t\t\t\tif(table[i][e.second] == MISSING){\n\t\t\t\t\t\t++count;\n\t\t\t\t\t\tpos = i;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tsum += table[i][e.second];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(count == 1){\n\t\t\t\t\ttable[pos][e.second] = table[p][e.second] - sum;\n\t\t\t\t\tq.push(pii(0, pos));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbool valid = true;\n\t\tvector<int> answer;\n\t\tfor(int i = 0; i < p; ++i){\n\t\t\tfor(int j = 0; j < s; ++j){\n\t\t\t\tif(table[i][j] == MISSING){\n\t\t\t\t\tvalid = false;\n\t\t\t\t}else if(missing[i][j]){\n\t\t\t\t\tanswer.push_back(table[i][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(!valid){\n\t\t\tcout << \"NO\" << endl;\n\t\t}else{\n\t\t\tfor(int i = 0; i < answer.size(); ++i){\n\t\t\t\tcout << answer[i] << endl;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_1125_cpp
|
Get Many Persimmon Trees
Seiji Hayashi had been a professor of the Nisshinkan Samurai School
in the domain of Aizu for a long time in the 18th century.
In order to reward him for his meritorious career in education,
Katanobu Matsudaira, the lord of the domain of Aizu, had decided to
grant him a rectangular estate within a large field in the Aizu Basin.
Although the size (width and height) of the estate was strictly specified
by the lord, he was allowed to choose any location for the estate
in the field.
Inside the field which had also a rectangular shape,
many Japanese persimmon trees,
whose fruit was one of the famous products of the Aizu region
known as 'Mishirazu Persimmon', were planted.
Since persimmon was Hayashi's favorite fruit, he wanted to have
as many persimmon trees as possible in the estate given by the lord.
For example, in Figure 1, the entire field is a rectangular grid whose
width and height are 10 and 8 respectively. Each asterisk (*)
represents a place of a persimmon tree. If the specified width and
height of the estate are 4 and 3 respectively, the area surrounded by
the solid line contains the most persimmon trees. Similarly, if the
estate's width is 6 and its height is 4, the area surrounded by the
dashed line has the most, and if the estate's width and height are 3
and 4 respectively, the area surrounded by the dotted line contains
the most persimmon trees. Note that the width and height cannot be
swapped; the sizes 4 by 3 and 3 by 4 are different, as shown in Figure
1.
Figure 1: Examples of Rectangular Estates
Your task is to find the estate of a given size (width and height)
that contains the largest number of persimmon trees.
Input
The input consists of multiple data sets.
Each data set is given in the following format.
N
W
H
x
1
y
1
x
2
y
2
...
x
N
y
N
S
T
N
is the number of persimmon trees,
which is a positive integer less than 500.
W
and
H
are the width and the height of the entire field
respectively.
You can assume that both
W
and
H
are positive integers
whose values are less than 100.
For each
i
(1 <=
i
<=
N
),
x
i
and
y
i
are
coordinates of the
i
-th persimmon tree in the grid.
Note that the origin of each coordinate is 1.
You can assume that 1 <=
x
i
<=
W
and 1 <=
y
i
<=
H
,
and no two trees have the same positions.
But you should not assume that the persimmon trees are sorted in some order
according to their positions.
Lastly,
S
and
T
are positive integers of
the width and height respectively of the estate given by the lord.
You can also assume that 1 <=
S
<=
W
and 1 <=
T
<=
H
.
The end of the input is indicated by a line that solely contains a zero.
Output
For each data set, you are requested to print one line containing the
maximum possible number of persimmon trees that can be included in an
estate of the given size.
Sample Input
16
10 8
2 2
2 5
2 7
3 3
3 8
4 2
4 5
4 8
6 4
6 7
7 5
7 8
8 1
8 4
9 6
10 3
4 3
8
6 4
1 2
2 1
2 4
3 4
4 2
5 3
6 1
6 2
3 2
0
Output for the Sample Input
4
3
|
[
{
"submission_id": "aoj_1125_10958618",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <iostream>\nusing namespace std;\nint x[520],y[520];\n\nint main(){\n\tint i,j,n,w,h,s,t,k,res,q;\n\twhile(scanf(\"%d\",&n)>0&&n){\n\t\tscanf(\"%d%d\",&w,&h);\n\t\t//for(i=1;i<=h;i++) for(j=1;j<=w;j++) a[i][j]=0;\n\t\tfor(i=0;i<n;i++) scanf(\"%d%d\",&x[i],&y[i]);\n\t\tscanf(\"%d%d\",&s,&t);\n\t\t\n\t\tres=0;\n\t\tfor(i=1;i+t-1<=h;i++){\n\t\t\tfor(j=1;j+s-1<=w;j++){\n\t\t\t\t//if(!a[i][j]) continue;\n\t\t\t\tq=0;\n\t\t\t\tfor(k=0;k<n;k++){\n\t\t\t\t\tif(x[k]>=j&&x[k]<j+s&&y[k]>=i&&y[k]<i+t) ++q;\n\t\t\t\t}\n\t\t\t\tif(res<q) res=q;\n\t\t\t}\n\t\t}\n\t\t\n\t\tprintf(\"%d\\n\",res);\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3492,
"score_of_the_acc": -1.0044,
"final_rank": 16
},
{
"submission_id": "aoj_1125_8394466",
"code_snippet": "#include <iostream>\n\nint main() {\n while (1) {\n int N;\n std::cin >> N;\n if (N == 0)\n break;\n\n int W, H;\n std::cin >> W >> H; \n int grid[H+1][W+1];\n for (int i = 1; i <= H; i++)\n for (int j = 1; j <= W; j++)\n grid[i][j] = 0;\n\n for (int i = 0; i < N; i++) {\n int x, y;\n std::cin >> x >> y;\n grid[y][x] = 1;\n }\n\n int S, T;\n std::cin >> S >> T;\n\n int res = 0;\n for (int i = 1; i <= H; i++) {\n for (int j = 1; j <= W; j++) {\n int count = 0;\n for (int k = 0; k < T; k++) {\n for (int l = 0; l < S; l++) {\n if (H < i+k || W < j+l)\n break;\n\n if (grid[i+k][j+l] == 1) \n count++; \n }\n }\n \n if (res < count)\n res = count;\n }\n }\n\n std::cout << res << std::endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3292,
"score_of_the_acc": -0.7468,
"final_rank": 11
},
{
"submission_id": "aoj_1125_8394459",
"code_snippet": "#include <iostream>\n\nint main() {\n while (1) {\n int N;\n std::cin >> N;\n if (N == 0)\n break;\n\n int W, H;\n std::cin >> W >> H; \n int grid[H+1][W+1];\n for (int i = 1; i <= H; i++)\n for (int j = 1; j <= W; j++)\n grid[i][j] = 0;\n\n for (int i = 0; i < N; i++) {\n int x, y;\n std::cin >> x >> y;\n grid[y][x] = 1;\n }\n\n int S, T;\n std::cin >> S >> T;\n\n int res = 0;\n for (int i = 1; i <= H; i++) {\n for (int j = 1; j <= W; j++) {\n int count = 0;\n for (int k = 0; k < T; k++) {\n for (int l = 0; l < S; l++) {\n if (H < i+k || W < j+l)\n continue;\n\n if (grid[i+k][j+l] == 1) \n count++; \n }\n }\n \n if (res < count)\n res = count;\n }\n }\n\n std::cout << res << std::endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3336,
"score_of_the_acc": -0.794,
"final_rank": 12
},
{
"submission_id": "aoj_1125_6872909",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <vector>\nusing namespace std;\nusing ll = long long;\n#define rep(i, j, n) for (ll i = j; i < (n); ++i)\n#define rrep(i, j, n) for (ll i = (n)-1; j <= i; --i)\n#define all(a) a.begin(), a.end()\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, std::vector<T> &a) {\n for (size_t i = 0; i < a.size(); ++i) os << (i > 0 ? \" \" : \"\") << a[i];\n return os << '\\n';\n}\ntemplate <typename T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &a) {\n for (T &x : a) { is >> x; }\n return is;\n}\n\n[[maybe_unused]] static constexpr long long MOD = 998244353;\n[[maybe_unused]] static constexpr int INF = 0x3f3f3f3f;\n[[maybe_unused]] static constexpr long long INFL = 0x3f3f3f3f3f3f3f3fLL;\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n int n, q, m, a;\n while (true) {\n cin >> n;\n if (n == 0) break;\n int w, h, s, t;\n cin >> w >> h;\n vector<int> x(n), y(n);\n rep(i, 0, n) { cin >> x[i] >> y[i]; }\n cin >> s >> t;\n\n int ans = 0;\n rep(lx, 1, w - s + 2) {\n rep(ly, 1, h - t + 2) {\n int rx = lx + s, ry = ly + t;\n int c = 0;\n rep(k, 0, n) {\n if (lx <= x[k] && x[k] < rx && ly <= y[k] && y[k] < ry) ++c;\n }\n ans = max(ans, c);\n }\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3372,
"score_of_the_acc": -0.8541,
"final_rank": 13
},
{
"submission_id": "aoj_1125_6200595",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(A) A.begin(),A.end()\nusing vll = vector<ll>;\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\n\n\nint main() {\n while(1){\n ll N;\n cin>>N;\n if(N==0)return 0;\n ll W,H;\n cin>>W>>H;\n set<pair<ll,ll>> P;\n rep(n,N){\n ll Y,X;\n cin>>Y>>X;\n P.insert(make_pair(Y,X));\n }\n ll S,T;\n cin>>S>>T;\n ll an=0;\n for(ll y=1;y<=W-S+1;y++){\n for(ll x=1;x<=H-T+1;x++){\n ll p=0;\n \n for(ll d=y;d<y+S;d++){\n for(ll e=x;e<x+T;e++){\n if(P.count(make_pair(d,e)))p++;\n }\n }\n an=max(an,p);\n }\n }\n cout<<an<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3160,
"score_of_the_acc": -0.6697,
"final_rank": 10
},
{
"submission_id": "aoj_1125_6018615",
"code_snippet": "#include<iostream>\n\nusing namespace std;\n\nint main()\n{\n\tint N;\n\tcin >> N;\n\twhile (N != 0)\n\t{\n\t\tint W, H;\n\t\tcin >> W >> H;\n\t\tpair<int, int>* points = new pair<int, int>[N];\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tcin >> points[i].first >> points[i].second;\n\t\tint S, T;\n\t\tcin >> S >> T;\n\t\tint ans = 0;\n\t\tfor (int x0 = 1; x0 <= W - S + 1; x0++)\n\t\t{\n\t\t\tfor (int y0 = 1; y0 <= H - T + 1; y0++)\n\t\t\t{\n\t\t\t\tint x1 = x0 + S - 1;\n\t\t\t\tint y1 = y0 + T - 1;\n\t\t\t\tint counter = 0;\n\t\t\t\tfor (int i = 0; i < N; i++)\n\t\t\t\t\tcounter += (points[i].first >= x0 && points[i].first <= x1 && points[i].second >= y0\n\t\t\t\t\t\t&& points[i].second <= y1);\n\t\t\t\tans = max(counter, ans);\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\n\t\tcin >> N;\n\t}\n\n\t//system(\"pause\");\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3528,
"score_of_the_acc": -1.0108,
"final_rank": 19
},
{
"submission_id": "aoj_1125_5940422",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define int long long\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) for (int i = 0; i < (n); i++)\n#define pb push_back\n#define ALL(obj) (obj).begin(), (obj).end()\n#define vi vector<int>\n#define vvi vector<vector<int>>\n#define pii pair<int, int>\n#define us unordered_set\n#define ud unordered_dict\n#define Lower_bound(vec, n) distance((vec).begin(), lower_bound((vec).begin(), (vec).end(), (n)))\n#define Upper_bound(vec, n) distance((vec).begin(), upper_bound((vec).begin(), (vec).end(), (n)))\n#define Erase(vec) (vec).erase(unique((vec).begin(), (vec).end()), (vec).end())\n//template <class T = int> in()(T x; cin >> x; return (x);)\n//template <class T> print(T& x) (cout << x << endl;)\n//using template <class T> vec = vector<T>;\nusing Graph = vector<vector<int>>;\nconst int INF = 1LL << 60;\nconst int MOD = (int)1e9 + 7;\nconst double EPS = 1e-9;\n\nstruct phash{\n inline size_t operator()(const pair<int, int> & p) const{\n const auto h1 = hash<int>()(p.first);\n const auto h2 = hash<int>()(p.second);\n return h1 ^ (h2 << 1);\n }\n};\n\nsigned main() {\n int N, W, H, S, T;\n pii coordinate;\n while (true) {\n cin >> N;\n if (N == 0) break;\n cin >> W >> H;\n\n us<pair<int, int>, phash> trees;\n\n int intmp1, intmp2;\n REP(i, N) {\n cin >> intmp1 >> intmp2;\n trees.insert(make_pair(intmp2-1, intmp1-1));\n }\n\n cin >> S >> T;\n int row_max = H - T;\n int column_max = W - S;\n\n int ans = 0;\n int challenge;\n\n REP(head_r, row_max+1) {\n REP(head_c, column_max+1) {\n challenge = 0;\n REP(r, T) {\n REP(c, S) {\n if (trees.count(make_pair(head_r+r, head_c+c))) challenge++;\n }\n }\n ans = max(ans, challenge);\n }\n }\n cout << ans << endl;\n }\n\n}",
"accuracy": 1,
"time_ms": 170,
"memory_kb": 3372,
"score_of_the_acc": -1.0047,
"final_rank": 17
},
{
"submission_id": "aoj_1125_5850194",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nbool solve(void) {\n int N;\n cin >> N;\n if (N == 0) return false;\n int W, H;\n cin >> W >> H;\n vector<pair<int, int>> kaki(N);\n for (auto &[x, y] : kaki) {\n cin >> x >> y;\n --x, --y;\n }\n int S, T;\n cin >> S >> T;\n\n auto count_kaki = [](const vector<pair<int, int>> &kaki, int w0, int h0,\n int w1, int h1) {\n int cnt = 0;\n for (auto [x, y] : kaki)\n if (w0 <= x and x < w1 and h0 <= y and y < h1) ++cnt;\n return cnt;\n };\n\n int ans = 0;\n for (int h = 0; h <= H; ++h) {\n for (int w = 0; w <= W; ++w) {\n int w1 = w + S;\n int h1 = h + T;\n if (w1 <= W and h1 <= H)\n ans = max(ans, count_kaki(kaki, w, h, w1, h1));\n }\n }\n cout << ans << endl;\n return true;\n}\n\nint main(void) {\n while (solve())\n ;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3456,
"score_of_the_acc": -0.9443,
"final_rank": 15
},
{
"submission_id": "aoj_1125_5731329",
"code_snippet": "#include<iostream>\nusing namespace std;\nint main(){\n int N[100][100];\n int n,W,H,S,T,x,y,s,t,sum,max;\n cin >> n;\n while(n!=0){\n cin >> W >> H;\n sum=max=0; \n for(int i=0;i<W;i++){\n for(int j=0;j<H;j++){\n\tN[i][j]=0;\n }\n }\n for(int i=0;i<n;i++){\n cin >> x >> y;\n N[x-1][y-1]=1;\n }\n cin >> S >> T;\n for(int s=0;s<W-(S-1);s++){\n for(int t=0;t<H-(T-1);t++){\n\tfor(int i=s;i<s+S;i++){\n\t for(int j=t;j<t+T;j++){\n\t if(N[i][j]==1)sum++;\n\t }\n\t}\n\tif(max<sum)max=sum;\n\tsum=0;\n }\n }\n cout << max << endl;\n cin >> n;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3400,
"score_of_the_acc": -0.8627,
"final_rank": 14
},
{
"submission_id": "aoj_1125_4832324",
"code_snippet": "#include <bits/stdc++.h>\n\n/*\n#include <atcoder/all>\nusing namespace atcoder;\n*/\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n//#include <boost/multiprecision/cpp_int.hpp>\nusing namespace std;\n\n\nusing dou =long double;\nstring yes=\"yes\";\nstring Yes=\"Yes\";\nstring YES=\"YES\";\nstring no=\"no\";\nstring No=\"No\";\nstring NO=\"NO\";\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntypedef long long ll;\ntypedef pair<int,int> P;\ntypedef pair<ll,ll> PL;\nconst ll mod = 1000000007ll;\n//const ll mod = 10000000000ll;\n//const ll mod = 10000;\n\nstruct mint {\n ll x; // typedef long long ll;\n mint(ll x=0):x((x%mod+mod)%mod){}\n mint operator-() const { return mint(-x);}\n mint& operator+=(const mint a) {\n if ((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += mod-a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}\n mint operator+(const mint a) const { return mint(*this) += a;}\n mint operator-(const mint a) const { return mint(*this) -= a;}\n mint operator*(const mint a) const { return mint(*this) *= a;}\n mint pow(ll t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\n // for prime mod\n mint inv() const { return pow(mod-2);}\n mint& operator/=(const mint a) { return *this *= a.inv();}\n mint operator/(const mint a) const { return mint(*this) /= a;}\n};\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\n#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)\n#define brep(n) for(int bit=0;bit<(1<<n);bit++)\n#define bbrep(n) for(int bbit=0;bbit<(1<<n);bbit++)\n#define erep(i,container) for (auto &i : container)\n#define itrep(i,container) for (auto i : container)\n#define irep(i, n) for(ll i = n-1; i >= (ll)0ll; i--)\n#define rrep(i,m,n) for(ll i = m; i < (ll)(n); i++)\n#define reprep(i,j,h,w) rep(i,h)rep(j,w)\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];\n#define pb push_back\n#define pf push_front\n#define query int qq;std::cin >> qq;rep(qqq,qq)\n#define lb lower_bound\n#define ub upper_bound\n#define fi first\n#define se second\n#define itn int\n#define mp make_pair\n//#define sum(a) accumulate(all(a),0ll)\n#define keta fixed<<setprecision\n#define vout(a) erep(qxqxqx,a)std::cout << qxqxqx << ' ';std::cout << std::endl;\n#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))\n//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))\n#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));\n#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));\n#define case std::cout <<\"Case #\" <<qqq+1<<\":\"\n#define RES(a,i,j) a.resize(i);rep(ii,i)a[ii].resize(j);\n#define RESRES(a,i,j,k) a.resize(i);rep(ii,i)a[ii].resize(j);reprep(ii,jj,i,j){dp[ii][jj].resize(k)};\n#define res resize\n#define as assign\n#define ffor for(;;)\n#define ppri(a,b) std::cout << a<<\" \"<<b << std::endl\n#define pppri(a,b,c) std::cout << a<<\" \"<<b <<\" \"<< c<<std::endl\n#define ppppri(a,b,c,d) std::cout << a<<\" \"<<b <<\" \"<< c<<' '<<d<<std::endl\n#define aall(x,n) (x).begin(),(x).begin()+(n)\n#define SUM(a) accumulate(all(a),0ll) \n#define stirng string\n#define gin(a,b) int a,b;std::cin >> a>>b;a--;b--;\n#define popcount __builtin_popcount\n#define permu(a) next_permutation(all(a))\n//#define grid_input(a,type) int h,w;std::cin >> h>>w;vvector(a,type,h,w,0);reprep(i,j,h,w)std::cin >> a[i][j];\n\n//typedef long long T;\nll ceil(ll a,ll b){\n return ((a+b-1)/b);\n}\nconst int INF = 2000000000;\n//const ll INF64 =3223372036854775807ll;\n//const ll INF64 = 9223372036854775807ll;\nconst ll INF64 = 9223372036854775ll;\nconst ll MOD = 1000000007ll;\n//const ll MOD = 1000003ll;\nconst ll OD = 1000000000000007ll;\nconst dou pi=3.141592653589793;\nlong long modpow(long long a, long long n,ll MOD) { //累乗の余剰\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % MOD;\n a = a * a % MOD;\n n >>= 1;\n }\n return res;\n}\n\n\n//メモ\n//ゲーム(Grundy数とか)の復習をする\n//群論の勉強をする？\n//ドツボにハマったら頑張って今までの思考をリセットする\n//学会のスライドを作る(水曜日まで)\n//周期性の実験をする\n//リスニング力をどうにかする\n//GT学会の会費を払う\n/*\n#include <atcoder/all>\nusing namespace atcoder;\n*/\n/*\n#include <atcoder/all>\nusing namespace atcoder;\n*/\nint main(){\n ffor{\n int n;\n std::cin >> n;\n if(n==0)break;\n int h,w;\n std::cin >> h>>w;\n vvector(a,bool,h,w,0);\n rep(i,n){\n gin(d,b);a[d][b]=1;\n }\n int ans=0;\n int s,t;\n std::cin >> s>>t;\n rep(ii,h-s+1){\n rep(jj,w-t+1){\n int d=0;\n reprep(i,j,s,t){\n if(a[ii+i][jj+j])d++;\n }\n chmax(ans,d);\n }\n }\n std::cout << ans << std::endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3184,
"score_of_the_acc": -0.6309,
"final_rank": 8
},
{
"submission_id": "aoj_1125_4729844",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n while (1){\n int N;\n cin >> N;\n if (N == 0){\n break;\n }\n int W, H;\n cin >> W >> H;\n vector<int> x(N), y(N);\n for (int i = 0; i < N; i++){\n cin >> x[i] >> y[i];\n }\n int S, T;\n cin >> S >> T;\n int ans = 0;\n for (int i = 1; i <= W - S + 1; i++){\n for (int j = 1; j <= H - T + 1; j++){\n int cnt = 0;\n for (int k = 0; k < N; k++){\n if (i <= x[k] && x[k] <= i + S - 1 && j <= y[k] && y[k] <= j + T - 1){\n cnt++;\n }\n }\n ans = max(ans, cnt);\n }\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 60,
"memory_kb": 3004,
"score_of_the_acc": -0.4915,
"final_rank": 3
},
{
"submission_id": "aoj_1125_4324196",
"code_snippet": "#include<bits/stdc++.h>\n#define endl '\\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 double INFD = 1e100;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -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// ios::sync_with_stdio(false);\n// cin.tie(nullptr);\n// ---------------------------------------------------------------------------\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N;\n cin >> N;\n while(N != 0){\n int W,H;\n cin >> W >> H;\n vector<vector<int>> G(H,vector<int> (W,0));\n for(int i=0; i<N; i++){\n int x,y;\n cin >> x >> y;\n x--;\n y--;\n G[y][x]++;\n }\n int S,T;\n cin >> S >> T;\n int ans = 0;\n for(int i=T; i<=H; i++){\n for(int j=S; j<=W; j++){\n int sum = 0;\n for(int k=i-T; k<i; k++){\n for(int l=j-S; l<j; l++){\n sum += G[k][l];\n }\n }\n chmax(ans,sum);\n }\n }\n cout << ans << endl;\n cin >> N;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3184,
"score_of_the_acc": -0.6309,
"final_rank": 8
},
{
"submission_id": "aoj_1125_4129142",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<utility>\n#include<map>\n#include<set>\n#include<queue>\n#include<math.h>\nusing namespace std;\n#define N (1000000000+7)\n#define INF 1e16\ntypedef long long ll;\ntypedef pair<ll,ll> P;\n\n\nint main(void){\n int n,w,h,s,t;\n while(true){\n cin>>n;\n if(n==0)break;\n cin>>w>>h;\n vector<int>x(n),y(n);\n for(int i=0;i<n;i++){\n cin>>y[i]>>x[i];\n x[i]--;\n y[i]--;\n }\n cin>>s>>t;\n int ans =0;\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n int height = i+t;\n int width = j+s;\n int num = 0;\n if((height>h)||(width>w))break;\n for(int k=i;k<height;k++){\n for(int l=j;l<width;l++){\n for(int m=0;m<n;m++){\n if(x[m]==k && y[m]==l)num++;\n }\n }\n }\n ans = max(ans,num);\n }\n }\n cout<<ans<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 940,
"memory_kb": 3084,
"score_of_the_acc": -1.5236,
"final_rank": 20
},
{
"submission_id": "aoj_1125_3681027",
"code_snippet": "#include<queue>\n#include<cstdio>\n#include <stdio.h>\n#include <iostream>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define MAX_W 100\n#define MAX_H 100\n#define MAX_N 500\nusing namespace std;\nconst int INF = 100000000;\ntypedef pair<int, int> P;\n\nint N,W,H,S,T,X,Y,x,y;\nint iX[MAX_N];\nint iY[MAX_N];\nint M[MAX_H][MAX_W];\nint count[MAX_H][MAX_W];\nbool check[MAX_H][MAX_W];\nint dx[2] = {1,0};\nint dy[2] = {0,1};\n\nint main(){\n while(true){\n cin >> N;\n if(N == 0){\n break;\n }\n cin >> W >> H;\n rep(i,N){\n cin >> X >> Y;\n iX[i] = X;\n iY[i] = Y;\n }\n cin >> S >> T;\n rep(i,H){\n rep(j,W){\n M[i][j] = 0;\n count[i][j] = 0;\n }\n }\n rep(i,N){\n M[iY[i] - 1][iX[i] -1] = 1;\n }\n\n rep(i,H-T+1){\n rep(j,W-S+1){\n rep(k,H){\n rep(l,W){\n check[k][l] = false;\n }\n }\n queue<P> que;\n que.push(P(j,i));\n if(M[i][j] == 1){\n count[i][j] = 1;\n }\n check[i][j] = true;\n while(que.size()){\n P q = que.front();que.pop();\n rep(k,2){\n int nx = q.first + dx[k], ny = q.second + dy[k];\n if(0 <= nx && nx < j + S && 0 <= ny && ny < i + T && check[ny][nx] == false){\n if(M[ny][nx] == 1)\n count[i][j] += 1;\n que.push(P(nx,ny));\n check[ny][nx] = true;\n }\n }\n }\n }\n }\n int m = 0;\n rep(i,H-T+1){\n rep(j,W-S+1){\n if(count[i][j] > m)\n m = count[i][j];\n }\n }\n printf(\"%d\\n\",m);\n }\n }",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 3244,
"score_of_the_acc": -1.0071,
"final_rank": 18
},
{
"submission_id": "aoj_1125_3656152",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\n\nconst double eps = 1e-10;\nconst int MOD = 1000000007;\nconst int INF = 1000000000;\nconst ll LINF = 1ll<<50;\n\ntemplate<typename T>\nvoid printv(const vector<T>& s) {\n for(int i=0;i<(int)(s.size());++i) {\n cout << s[i];\n if(i == (int)(s.size())-1) cout << endl;\n else cout << \" \";\n }\n}\n\nint main () {\n cin.tie(0);\n cout << fixed << setprecision(10);\n\n while(1) {\n int n; cin >> n;\n if(n == 0) break;\n int w, h; cin >> w >> h;\n vector<vector<bool>> g(h, vector<bool>(w));\n for(int i=0;i<n;++i) {\n int x, y; cin >> x >> y;\n x--; y--;\n g[y][x] = true;\n }\n int s, t; cin >> s >> t;\n\n int ans = 0;\n for(int i=0;i<h-t+1;++i) {\n for(int j=0;j<w-s+1;++j) {\n int su = 0;\n for(int k=0;k<t;++k) {\n for(int l=0;l<s;++l) {\n su += g[i+k][j+l];\n }\n }\n ans = max(ans, su);\n }\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3124,
"score_of_the_acc": -0.5665,
"final_rank": 6
},
{
"submission_id": "aoj_1125_3547716",
"code_snippet": "#include\"bits/stdc++.h\"\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n int w,h;\n int x,y;\n int s,t;\n int ans;\n int cnt;\n while (n!=0){\n cin >> w >> h;\n vector<vector<bool>> persimmon(h, vector<bool>(w));\n for (int i = 0; i<h; i++){\n for (int j = 0; j<w; j++) persimmon[i][j] = false;\n }\n for (int i = 0; i<n; i++){\n cin >> x >> y;\n persimmon[y-1][x-1] = true;\n }\n cin >> s >> t;\n ans = 0;\n for (int i = 0; i+t <= h; i++){\n for (int j = 0; j+s <= w; j++){\n cnt = 0;\n for (int k = 0; k<t; k++){\n for (int l = 0; l<s; l++){\n if (persimmon[i+k][j+l]) cnt++;\n }\n }\n ans = max(ans, cnt);\n }\n }\n cout << ans << endl;\n cin >> n;\n \n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3100,
"score_of_the_acc": -0.5408,
"final_rank": 4
},
{
"submission_id": "aoj_1125_3071013",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n,w,h,x,y,s,t;\n while(cin>>n,n){\n cin>>w>>h;\n int ma[100][100]={};\n for(int i=0;i<n;i++){\n cin>>x>>y;\n ma[y-1][x-1]=1;\n }\n cin>>s>>t;\n int cnt,mx=0;\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n cnt=0;\n for(int k=i;k<i+t;k++){\n for(int l=j;l<j+s;l++){\n if(ma[k][l]==1) cnt++;\n }\n }\n mx=max(mx,cnt);\n }\n }\n cout<<mx<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3036,
"score_of_the_acc": -0.4721,
"final_rank": 2
},
{
"submission_id": "aoj_1125_3050547",
"code_snippet": "#include<iostream>\n\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nint x[1000],y[1000];\nint main() {\n while(true) {\n int n;\n cin >> n;\n if(n == 0)break;\n int w,h;\n cin >> w >> h;\n\n rep(i,n)cin >> x[i] >> y[i];\n int s,t;\n cin >> s >> t;\n\n int ans = 0;\n for(int i = 1;i <= w - s + 1;i++) {\n for(int j = 1;j <= h - t + 1;j++) {\n int sum = 0;\n rep(k,n) {\n if(i <= x[k] && x[k] < i + s && j <= y[k] && y[k] < j + t) {\n sum++;\n }\n }\n ans = max(sum,ans);\n }\n }\n cout << ans << endl;\n }\n return 0;\n\n}",
"accuracy": 1,
"time_ms": 70,
"memory_kb": 3060,
"score_of_the_acc": -0.5624,
"final_rank": 5
},
{
"submission_id": "aoj_1125_3018780",
"code_snippet": "#include <cstdio>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n int N,W,H,c,x,y,i,j,k,l,m,S,T;\n while(1){\n scanf(\"%d\",&N);\n if(!N){break;}\n scanf(\"%d %d\",&W,&H);\n int ll[H+1][W+1];\n fill(ll[0],ll[H+1],0);\n for(i=0;i<N;i++){\n scanf(\"%d %d\",&x,&y);\n ll[y][x]=1;\n }\n scanf(\"%d %d\",&S,&T);\n m=0;\n for(i=1;i+T-1<=H;i++){\n for(j=1;j+S-1<=W;j++){\n c=0;\n for(k=i;k<=i+T-1;k++){\n for(l=j;l<=j+S-1;l++){\n if(ll[k][l]){c++;}\n }\n }\n m=max(m,c);\n }\n }\n printf(\"%d\\n\",m);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2596,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1125_3000614",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint N, W, H, S, T, x, y;\n\twhile(1){\n\t\tint temp[220][220] = {}, ans = 0, count;\n\t\t\n\t\tcin>>N;\n\t\t\n\t\tif(N == 0) break;\n\t\t\n\t\tcin>>W>>H;\n\t\t\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tcin>>x>>y;\n\t\t\ttemp[y][x] = 1;\n\t\t}\n\t\tcin>>S>>T;\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\tcount = 0;\n\t\t\t\tfor(int k = 0; k < T; k++)\n\t\t\t\t\tfor(int l = 0; l < S; l++) if(temp[i+k][j+l] == 1)count++;\n\t\t\t\tans = max(count, ans);\t\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3168,
"score_of_the_acc": -0.6137,
"final_rank": 7
}
] |
aoj_1121_cpp
|
Kanglish : Analysis on Artificial Language
The late Prof. Kanazawa made an artificial language named Kanglish, which is
similar to English, for studying mythology. Words and sentences of Kanglish are
written with its own special characters called "Kan-characters". The size of the
set of the Kan-characters is 38, i.e., there are 38 different Kan-characters in
the set. Since Kan-characters cannot be directly stored in a computer because of
the lack of a coded character set, Prof. Kanazawa devised a way to represent
each Kan-character as an alphabetical letter or an ordered combination of two
alphabetical letters. Thus, each Kan-character is represented as one of the
following 26 letters
"a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m",
"n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", and "z",
or one of the following 12 combinations of letters
"ld", "mb", "mp", "nc", "nd", "ng", "nt", "nw", "ps", "qu", "cw",
and "ts".
In addition, the Kan-characters are ordered according to
the above alphabetical representation. The order is named Kan-order in which the
Kan-character represented by "a" is the first one, that by "b" is the second,
that by "z" is the 26th, that by "ld" is the 27th, and that by "ts" is the 38th
(the last).
The representations of words in Kanglish are separated by spaces. Each
sentence is written in one line, so there are no periods or full stops in
Kanglish. All alphabetical letters are in lower case, i.e., there are no
capitalizations.
We currently have many documents written in Kanglish with the alphabetical
representation. However, we have lost most of Prof. Kanazawa's work on how they
can be translated. To recognize his work, we have decided to first analyze them
statistically. The first analysis is to check sequences of consecutive
Kan-characters in words.
For example, a substring "ic" in a word "quice" indicates an ordered pair of
two adjacent Kan-characters that are represented by "i" and "c". For simplicity,
we make a rule that, in the alphabetical representation of a word, a
Kan-character is recognized as the longest possible alphabetical representation
from left to right. Thus, a substring "ncw" should be considered as a pair of
"nc" and "w". It does not consist of "n" and "cw", nor "n", "c", and "w".
For each Kan-character, there are 38 possible pairs of that Kan-character and
another Kan-character, e.g. "aa", "ab", ..., "az", "ald", ..., "ats". Thus,
mathematically, there is a total of 1444 (i.e., 38x38) possible pairs, including
pairs such as "n" and "cw", which is actually not allowed according to the above
rule.
Your job is to write a program that counts how many times each pair occurs in
input data. For example, in the sentence
qua ist qda quang quice
the Kan-character represented by "qu" appears
three times. There are two occurrences of the pair of "qu" and "a", and one
occurrence of the pair of "qu" and "i". Note that the alphabetical letter "q"
ap
...(truncated)
|
[
{
"submission_id": "aoj_1121_4779367",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nvector<string> kan{\n \"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\",\n \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\",\n \"ld\", \"mb\", \"mp\", \"nc\", \"nd\", \"ng\", \"nt\", \"nw\", \"ps\", \"qu\", \"cw\", \"ts\",\n};\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> freq(kan.size(), vector<int>(kan.size(), 0));\n string s;\n while(cin >> s){\n int prev = -1;\n int p = 0;\n int idx = -1;\n while(p < (int)s.length()){\n for(int i=0; i<(int)kan.size(); i++){\n if(p +(int)kan[i].length() <= (int)s.length()\n and s.substr(p, kan[i].length()) == kan[i]){\n idx = i;\n }\n }\n if(prev != -1){\n freq[prev][idx]++;\n }\n p += kan[idx].length();\n prev = idx;\n }\n }\n for(int i=0; i<(int)kan.size(); i++){\n int idx = 0;\n for(int j=0; j<(int)kan.size(); j++){\n if(freq[i][j] > freq[i][idx]){\n idx = j;\n }\n }\n cout << kan[i] << \" \" << kan[idx] << \" \" << freq[i][idx] << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3212,
"score_of_the_acc": -1.3081,
"final_rank": 19
},
{
"submission_id": "aoj_1121_3484026",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <map>\nusing namespace std;\n\nvector<string> split(string &str) {\n int prev = 0;\n vector<string> ans;\n for (int i = 0; i < str.size(); i++) {\n\tif (str[i] == ' ') {\n\t ans.push_back(str.substr(prev, i - prev));\n\t prev = i + 1;\n\t}\n }\n return ans;\n}\n\nstring kanglish[] = {\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"ld\", \"mb\", \"mp\", \"nc\", \"nd\", \"ng\", \"nt\", \"nw\", \"ps\", \"qu\", \"cw\", \"ts\"};\n\n\nint main() {\n int n;\n cin >> n;\n vector<string> vec;\n string com = \"\";\n for (int i = 0; i < n;) {\n\tstring str;\n\tgetline(cin, str);\n\tif (str.size() == 0) continue;\n\ti++;\n\tif (com.size() && com[com.size() - 1] != ' ') {\n\t com += \" \";\n\t}\n\tcom += str;\n }\n com += \" \";\n vec = split(com);\n \n map<string, map<string, int>> cnt;\n for (auto str: vec) {\n\tint index = 0;\n\tvector<string> slist;\n\twhile (index < str.size()) {\n\t int nxt = index + 1;\n\t for (auto kang: kanglish) {\n\t\tif (str.substr(index, kang.size()) == kang) {\n\t\t nxt = index + kang.size();\n\t\t}\n\t }\n\t string word = str.substr(index, nxt - index);\n\t slist.push_back(word);\n\t index = nxt;\n\t}\n\tfor (int i = 0; i < slist.size() - 1; i++) {\n\t cnt[slist[i]][slist[i + 1]]++;\n\t}\n }\n for (auto &s1: kanglish) {\n\tint mx = -1;\n\tstring ans = \"\";\n\tfor (auto &s2: kanglish) {\n\t if (cnt[s1][s2] > mx) {\n\t\tmx = cnt[s1][s2];\n\t\tans = s2;\n\t }\n\t}\n\tcout << s1 << \" \" << ans << \" \" << mx << endl;\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 3480,
"score_of_the_acc": -1.5243,
"final_rank": 20
},
{
"submission_id": "aoj_1121_1738779",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\n \nint main(){\n int n,slen;\n string s,d[38]={\n \"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\"s\",\"t\",\n \"u\",\"v\",\"w\",\"x\",\"y\",\"z\",\"ld\",\"mb\",\"mp\",\"nc\",\"nd\",\"ng\",\"nt\",\"nw\",\"ps\",\"qu\",\"cw\",\"ts\"\n };\n map<P,int> m;\n vector<int> v;\n cin>>n;\n for(int i=0;i<38;i++)\n for(int j=0;j<38;j++)\n m.insert(make_pair(P(i,j),0));\n while(cin>>s){\n slen=s.size();\n s+=\"#####\"; \n for(int i=0;i<slen;i++){\n string subs=s.substr(i,2);\n int f=0,ind;\n for(int j=0;j<38;j++){\n if(j<26&&s[i]==d[j][0])ind=j;\n if(subs==d[j]){\n f=1;\n i++;\n v.push_back(j);\n }\n }\n if(!f)v.push_back(ind);\n }\n for(int i=0;i<v.size()-1;i++)\n m[P(v[i],v[i+1])]++;\n v.clear();\n }\n map<P,int>::iterator ite;\n int ans1=0,ans2=0,ansmax=m[P(0,0)];\n for(ite=m.begin();ite!=m.end();ite++){\n if(ans1!=(*ite).first.first){\n cout<<d[ans1]<<' '<<d[ans2]<<' '<<ansmax<<endl;\n ans1++;\n if(ansmax<(*ite).second){\n ans2=(*ite).first.second;\n ansmax=(*ite).second;\n }\n ans2=0,ansmax=m[P(ans1,0)];\n }else{\n if(ansmax<(*ite).second){\n ans2=(*ite).first.second;\n ansmax=(*ite).second;\n }\n }\n }\n cout<<d[ans1]<<' '<<d[ans2]<<' '<<ansmax<<endl;\n \n m.clear();\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1336,
"score_of_the_acc": -0.3658,
"final_rank": 8
},
{
"submission_id": "aoj_1121_1714666",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint n;\nstring s;\nvector<int> t;\nmap<string,int> mp;\nstring A[12]={\"ld\", \"mb\", \"mp\", \"nc\", \"nd\", \"ng\", \"nt\", \"nw\", \"ps\", \"qu\", \"cw\",\"ts\"};\nint cnt[50][50];\n\nstring change(int x){\n string res=\"a\";\n if(x<26){\n res[0]+=x;\n return res;\n }else return A[x-26];\n}\n\nint main(){\n for(int i=0;i<12;i++)mp[A[i]]=26+i;\n cin>>n;\n\n while(cin>>s){\n n=s.size();\n vector<int> v;\n for(int i=0;i<n;i++){\n string tmp=\"\";\n if(i+1<n)tmp=s.substr(i,2);\n if(mp[tmp]!=0){\n v.push_back(mp[tmp]);\n i++;\n }else{\n v.push_back(s[i]-'a');\n }\n }\n for(int i=0;i+1<(int)v.size();i++){\n \n cnt[v[i]][v[i+1]]++;\n }\n \n }\n \n for(int i=0;i<38;i++){\n int maxid=0;\n for(int j=0;j<38;j++){\n if(cnt[i][j]>cnt[i][maxid])maxid=j;\n }\n cout<<change(i)<<' '<<change(maxid)<<' '<<cnt[i][maxid]<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1288,
"score_of_the_acc": -0.3527,
"final_rank": 5
},
{
"submission_id": "aoj_1121_1714647",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\n\nint main(){\n int n,slen;\n string s,d[38]={\n \"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\"s\",\"t\",\n \"u\",\"v\",\"w\",\"x\",\"y\",\"z\",\"ld\",\"mb\",\"mp\",\"nc\",\"nd\",\"ng\",\"nt\",\"nw\",\"ps\",\"qu\",\"cw\",\"ts\"\n };\n map<P,int> m;\n vector<int> v;\n cin>>n;\n for(int i=0;i<38;i++)\n for(int j=0;j<38;j++)\n m.insert(make_pair(P(i,j),0));\n while(cin>>s){\n slen=s.size();\n s+=\"#####\"; \n for(int i=0;i<slen;i++){\n string subs=s.substr(i,2);\n int f=0,ind;\n for(int j=0;j<38;j++){\n\tif(j<26&&s[i]==d[j][0])ind=j;\n\tif(subs==d[j]){\n\t f=1;\n\t i++;\n\t v.push_back(j);\n\t}\n }\n if(!f)v.push_back(ind);\n }\n for(int i=0;i<v.size()-1;i++)\n m[P(v[i],v[i+1])]++;\n v.clear();\n }\n map<P,int>::iterator ite;\n int ans1=0,ans2=0,ansmax=m[P(0,0)];\n for(ite=m.begin();ite!=m.end();ite++){\n if(ans1!=(*ite).first.first){\n cout<<d[ans1]<<' '<<d[ans2]<<' '<<ansmax<<endl;\n ans1++;\n if(ansmax<(*ite).second){\n\tans2=(*ite).first.second;\n\tansmax=(*ite).second;\n }\n ans2=0,ansmax=m[P(ans1,0)];\n }else{\n if(ansmax<(*ite).second){\n\tans2=(*ite).first.second;\n\tansmax=(*ite).second;\n }\n }\n }\n cout<<d[ans1]<<' '<<d[ans2]<<' '<<ansmax<<endl;\n \n m.clear();\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1340,
"score_of_the_acc": -0.3669,
"final_rank": 9
},
{
"submission_id": "aoj_1121_1362697",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n#include <ctime>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <sstream>\n#include <vector>\nusing namespace std;\n\n#define REP2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)\n#define REP(i, n) REP2(i, 0, n)\n#define ALL(c) (c).begin(), (c).end()\n#define FOREACH(i, c) for(auto i = (c).begin(); i != (c).end(); ++i)\n#define BIT(n, m) (((n) >> (m)) & 1)\n\ntypedef long long ll;\ntypedef pair<int, int> PI;\n\nconst ll inf = 1e15;\nconst ll mod = 1000 * 1000 * 1000 + 7;\nconst double eps = 1e-9;\n\ntemplate <typename S, typename T> ostream &operator<<(ostream &out, const pair<S, T> &p) {\n out << \"(\" << p.first << \", \" << p.second << \")\";\n return out;\n}\n\ntemplate <typename T> ostream &operator<<(ostream &out, const vector<T> &v) {\n out << \"[\";\n REP(i, v.size()){\n if (i > 0) out << \", \";\n out << v[i];\n }\n out << \"]\";\n return out;\n}\n\n\n\nint main(){\n vector<string> alphabets;\n REP(i, 26) alphabets.push_back(string(1, 'a' + i));\n alphabets.push_back(\"ld\");\n alphabets.push_back(\"mb\");\n alphabets.push_back(\"mp\");\n alphabets.push_back(\"nc\");\n alphabets.push_back(\"nd\");\n alphabets.push_back(\"ng\");\n alphabets.push_back(\"nt\");\n alphabets.push_back(\"nw\");\n alphabets.push_back(\"ps\");\n alphabets.push_back(\"qu\");\n alphabets.push_back(\"cw\");\n alphabets.push_back(\"ts\");\n\n int n;\n string word;\n cin >> n; \n map<int, int> counter[40];\n \n while (cin >> word){\n int p = 0;\n int m = word.size();\n vector<int> chs;\n while (p < m){\n string ch = string(1, word[p++]);\n if (p < m && find(ALL(alphabets), ch + word[p]) != alphabets.end()){\n ch += word[p++];\n }\n chs.push_back(find(ALL(alphabets), ch) - alphabets.begin());\n }\n REP(i, chs.size()){\n if (i > 0) counter[chs[i - 1]][chs[i]]++;\n }\n }\n \n REP(i, alphabets.size()){\n int ans = 0;\n REP(j, alphabets.size()) if (counter[i][j] > counter[i][ans]) ans = j;\n cout << alphabets[i] << \" \" << alphabets[ans] << \" \" << counter[i][ans] << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1312,
"score_of_the_acc": -0.3593,
"final_rank": 6
},
{
"submission_id": "aoj_1121_975751",
"code_snippet": "#include <algorithm>\n#include <cstdlib>\n#include <iostream>\n#include <sstream>\n#include <unordered_map>\nusing namespace std;\n\nstring characters[38];\n\nvoid init() {\n\tfor(int i = 0; i < 26; ++i) {\n\t\tcharacters[i] = 'a' + i;\n\t}\n\tcharacters[26] = \"ld\";\n\tcharacters[27] = \"mb\";\n\tcharacters[28] = \"mp\";\n\tcharacters[29] = \"nc\";\n\tcharacters[30] = \"nd\";\n\tcharacters[31] = \"ng\";\n\tcharacters[32] = \"nt\";\n\tcharacters[33] = \"nw\";\n\tcharacters[34] = \"ps\";\n\tcharacters[35] = \"qu\";\n\tcharacters[36] = \"cw\";\n\tcharacters[37] = \"ts\";\n}\n\nstring get_char(int &idx, const string &word) {\n\tif(idx + 1 < word.size()) {\n\t\tconst string tmp = word.substr(idx, 2);\n\t\tif(find(begin(characters), end(characters), word.substr(idx, 2)) != end(characters)) {\n\t\t\tidx += 2;\n\t\t\treturn tmp;\n\t\t}\n\t}\n\n\treturn idx < word.size() ? string(1, word[idx++]) : \"\";\n}\n\nvoid calc_input(unordered_map<string, unordered_map<string, int>> &cnt) {\n\tstring sentence;\n\tgetline(cin, sentence);\n\n\tistringstream iss(sentence);\n\tfor(string word; iss >> word;) {\n\t\tint idx = 0;\n\t\tstring current = get_char(idx, word);\n\t\tstring next;\n\n\t\tfor(string next; (next = get_char(idx, word)) != \"\";) {\n\t\t\t++cnt[current][next];\n\t\t\tcurrent = move(next);\n\t\t}\n\t}\n}\n\nint main() {\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tinit();\n\n\tint n;\n\tcin >> n;\n\tcin.ignore();\n\n\tunordered_map<string, unordered_map<string, int>> cnt;\n\twhile(n--) calc_input(cnt);\n\n\tfor(const auto &character : characters) {\n\t\tint max_cnt = 0;\n\t\tstring max_char = \"a\";\n\t\tconst auto &c_cnt = cnt[character];\n\n\t\tfor(const auto &target : characters) {\n\t\t\tif(c_cnt.count(target) && max_cnt < c_cnt.at(target)) {\n\t\t\t\tmax_cnt = c_cnt.at(target);\n\t\t\t\tmax_char = target;\n\t\t\t}\n\n\t\t}\n\n\t\tcout << character << \" \" << max_char << \" \" << max_cnt << endl;\n\t}\n\n\treturn EXIT_SUCCESS;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1316,
"score_of_the_acc": -0.3604,
"final_rank": 7
},
{
"submission_id": "aoj_1121_972694",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n#include <cctype>\n#include <algorithm>\n#include <set>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\nstring Kanglish[38];\nstring get_string(int &cur,string line){\n while(line[cur] == ' ') ++cur;\n\n string str;\n for(int j = 26;j < 38;j++){\n\tif(line[cur] == Kanglish[j][0] && line[cur+1] == Kanglish[j][1]){\n\t cur+=2;\n\t return Kanglish[j];\n\t}\n }\n for(int i = 0;i < 26;i++){\n\tif(line[cur] == Kanglish[i][0]){\n\t cur++;\n\t return Kanglish[i];\n\t}\n }\t\n return \" \" ;\n}\n\n\nint main(){\n char tmp = 'a';\n for(int i = 0;i < 26;i++){\n\tKanglish[i] = tmp++;\n }\n Kanglish[26]=\"ld\";\n Kanglish[27]=\"mb\";\n Kanglish[28]=\"mp\";\n Kanglish[29]=\"nc\";\n Kanglish[30]=\"nd\";\n Kanglish[31]=\"ng\";\n Kanglish[32]=\"nt\";\n Kanglish[33]=\"nw\";\n Kanglish[34]=\"ps\";\n Kanglish[35]=\"qu\";\n Kanglish[36]=\"cw\";\n Kanglish[37]=\"ts\";\n int n;\n cin >>n;\n cin.ignore();\n vector<map<string,int> > vec(38);\n for(int i =0;i < n;i++){\n\tstring line;\n\tgetline(cin,line);\n\tint cur = 0;\n\tstring current = get_string(cur,line);\n\tconst int len = line.size();\n\tline += \"#\";\n\n\twhile(cur < len){\n\t if(line[cur] == ' ') {\n\t\tcurrent = get_string(cur, line);\n\t\tcontinue;\n\t }\n\t \n\t string next = get_string(cur, line);\n\t \n\t for(int i =0 ;i < 38;i++){\n\t\tif(Kanglish[i] == current){\n\t\t vec[i][next]++;\n\t\t break;\n\t\t}\n\t }\n\t\n\t current = move(next);\n\t}\n }\n\n for(int i = 0;i < 38;i++){\n\tint max_number = 0;\n\tstring max_str = \"a\";\n\tfor(const auto &e:vec[i]){\n\t if(e.second > max_number && e.first != \" \"){\n\t\tmax_number = e.second;\n\t\tmax_str = e.first;\n\t }\n\t}\n\tcout << Kanglish[i] << \" \" << max_str << \" \" << max_number << endl;\n }\n \n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 1284,
"score_of_the_acc": -0.3516,
"final_rank": 4
},
{
"submission_id": "aoj_1121_772645",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <sstream>\n#include <map>\nusing namespace std;\n\nconst string kan[38] = {\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"ld\", \"mb\", \"mp\", \"nc\", \"nd\", \"ng\", \"nt\", \"nw\", \"ps\", \"qu\", \"cw\", \"ts\"};\n\nint main() {\n int n;\n while(cin >> n) {\n cin.ignore();\n map<pair<int,int>, int> m;\n for(int i = 0; i < n; ++i) {\n string s;\n getline(cin, s);\n stringstream ss(s);\n while(ss >> s) {\n for(int j = 0, pre = -1; j < s.size(); ) {\n for(int k = 0; k < 38; ++k) {\n int nk = (k + 26) % 38;\n const string &t = kan[nk];\n if(s.substr(j, t.size()) == t) {\n j += t.size();\n if(pre != -1) {\n m[make_pair(pre, nk)] += 1;\n }\n pre = nk;\n break;\n }\n }\n }\n }\n }\n\n pair<int,int> maxi[38] = make_pair(0,0);\n for(map<pair<int,int>,int>::iterator it = m.begin();\n it != m.end(); ++it) {\n int a = it->first.first;\n int b = it->first.second;\n int c = it->second;\n maxi[a] = max(maxi[a], make_pair(c, -b));\n }\n for(int i = 0; i < 38; ++i) {\n cout << kan[i] << \" \" << kan[-maxi[i].second] << \" \" << maxi[i].first << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 1264,
"score_of_the_acc": -0.7747,
"final_rank": 15
},
{
"submission_id": "aoj_1121_750643",
"code_snippet": "#include<iostream>\n#include<map>\n#include<vector>\n#include<algorithm>\n#include<sstream>\n#include<set>\n#include<cassert>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\n\nusing namespace std;\nset<string> comb;\nint T;\nstruct Kanglish\n{\n vector<int> dict;\n Kanglish(){dict.resize(38,0);}\n};\n\n\nint getIndex(string s)\n{\n if(s.size() == 1)return s[0]-'a';\n if(s == \"ld\")return 26;\n if(s == \"mb\")return 27;\n if(s == \"mp\")return 28;\n if(s == \"nc\")return 29;\n if(s == \"nd\")return 30;\n if(s == \"ng\")return 31;\n if(s == \"nt\")return 32;\n if(s == \"nw\")return 33;\n if(s == \"ps\")return 34;\n if(s == \"qu\")return 35;\n if(s == \"cw\")return 36;\n if(s == \"ts\")return 37;\n return -inf;\n}\n\nstring toString(int index)\n{\n if(0 <= index && index <= 25)return string(1,(char)('a'+index));\n if(index == 26)return \"ld\";\n if(index == 27)return \"mb\";\n if(index == 28)return \"mp\";\n if(index == 29)return \"nc\";\n if(index == 30)return \"nd\";\n if(index == 31)return \"ng\";\n if(index == 32)return \"nt\";\n if(index == 33)return \"nw\";\n if(index == 34)return \"ps\";\n if(index == 35)return \"qu\";\n if(index == 36)return \"cw\";\n if(index == 37)return \"ts\";\n assert(false);\n}\n\nvoid Convert(string *line)\n{\n Kanglish vec[38];\n\n vector<string> sep;\n rep(i,T)\n {\n stringstream ss;\n ss << line[i];\n string s; \n while(!(ss >> s).fail())\n\t{\n\t int ssize = s.size();\n\t rep(j,ssize)\n\t {\n\t if(j+1 < ssize && getIndex(s.substr(j,2)) != -inf)\n\t\t{\n\t\t sep.push_back(s.substr(j,2));\n\t\t j++;\n\t\t}\n\t else \n\t\t{\n\t\t sep.push_back(s.substr(j,1));\n\t\t}\n\t }\n\t sep.push_back(\"$\");\n\t}\n }\n rep(i,sep.size()-1)\n {\n //if(sep[i][0] == '$')cout << endl;\n //else cout << sep[i] << endl; \n if(sep[i+1][0] == '$' || sep[i][0] == '$')continue;\n vec[getIndex(sep[i])].dict[getIndex(sep[i+1])]++;\n }\n\n //cout << \"-----------\" << endl;\n rep(i,38)\n {\n cout << toString(i) << \" \";\n int p = 0;\n rep(j,vec[i].dict.size())\n\t{\n\t if(vec[i].dict[p] < vec[i].dict[j])\n\t {\n\t p = j;\n\t }\n\t}\n cout << toString(p) << \" \" << vec[i].dict[p] <<endl;\n }\n\n}\n\nint main()\n{\n\n comb.insert(\"ld\");\n comb.insert(\"mb\");\n comb.insert(\"mp\");\n comb.insert(\"nc\");\n comb.insert(\"nd\");\n comb.insert(\"ng\");\n comb.insert(\"nt\");\n comb.insert(\"nw\");\n comb.insert(\"ps\");\n comb.insert(\"qu\");\n comb.insert(\"cw\");\n comb.insert(\"ts\");\n\n while(cin >> T)\n {\n cin.ignore();\n string line[T];\n rep(_,T)\n\t{\n\t getline(cin,line[_]);\n\t}\n vector<Kanglish> vec[39];\n Convert(&line[0]);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3652,
"score_of_the_acc": -1.1429,
"final_rank": 17
},
{
"submission_id": "aoj_1121_749687",
"code_snippet": "#include<iostream>\n#include<cstring>\n\nusing namespace std;\n\nconst int MAX = 40;\n\nstring kang[] = {\"ld\",\"mb\",\"mp\",\"nc\",\"nd\",\"ng\",\"nt\",\"nw\",\"ps\",\"qu\",\"cw\",\"ts\"};\nint ans[MAX][MAX];\n\nint kang2int(const string& s){\n // cout << \" s \" << s << endl;\n if(s.length()==1){\n char c = s[0];\n return c-'a';\n }\n for(int i = 0; i < 12; i++)\n if(s == kang[i]) return 27+i;\n\n return -1;\n}\n\nstring int2kang(int n){\n if(n < 27){\n char c = 'a'+n;\n string s = \"\";\n s += c;\n return s;\n }\n return kang[n-27];\n}\n\nstring getString(const string& s, int idx){\n if(kang2int(s.substr(idx,2)) != -1) return s.substr(idx,2);\n return s.substr(idx,1);\n}\n\nvoid solve(const string& s){\n\n int idx = 0;\n\n while(1){\n while(s[idx] == ' ') idx++;\n\n string s1 = getString(s,idx);\n idx += s1.length();\n\n if(idx >= (int)s.length()) break;\n if(s[idx] == ' ') continue;\n\n string s2 = getString(s,idx);\n // cout << s1 << \" \" << s2 << endl;\n // idx+=s2.length();\n ans[kang2int(s1)][kang2int(s2)]++;\n }\n\n}\n\nvoid print(){\n for(char c = 'a'; c <= 'z'; c++){\n string tmp = \"\";\n tmp += c;\n int pos = 0;\n int kpos = kang2int(tmp);\n for(int i = 0; i < MAX; i++) if(ans[kpos][pos] < ans[kpos][i]){pos = i;}\n cout << c << \" \" << int2kang(pos) << \" \" << ans[kpos][pos] << endl;\n }\n\n for(int i = 0; i < 12; i++){\n int kpos = kang2int(kang[i]);\n int pos = 0;\n for(int j = 0; j < MAX; j++) if(ans[kpos][pos] < ans[kpos][j]){pos = j;}\n cout << kang[i] << \" \" << int2kang(pos) << \" \" << ans[kpos][pos] << endl;\n }\n}\n\nint main(){\n\n \n memset(ans,0,sizeof(ans));\n int n;\n cin >> n;\n cin.ignore();\n while(n--){\n string s;\n getline(cin,s);\n solve(s);\n }\n print();\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 1220,
"score_of_the_acc": -0.4769,
"final_rank": 10
},
{
"submission_id": "aoj_1121_485533",
"code_snippet": "//48\n#include<iostream>\n#include<map>\n#include<string>\n#include<algorithm>\n\nusing namespace std;\n\nstring od(int x){\n if(x<26){\n return string(1,'a'+x);\n }else{\n string wc[]={\"ld\", \"mb\", \"mp\", \"nc\", \"nd\", \"ng\", \"nt\", \"nw\", \"ps\", \"qu\", \"cw\", \"ts\"};\n return wc[x-26];\n }\n}\n\nint main(){\n int n;\n cin>>n;\n cin.ignore();\n map<string,map<string,int> > m;\n while(n--){\n char l[60];\n cin.getline(l,60);\n string p;\n for(int i=0;l[i];){\n string c;\n string wc[]={\"ld\", \"mb\", \"mp\", \"nc\", \"nd\", \"ng\", \"nt\", \"nw\", \"ps\", \"qu\", \"cw\", \"ts\"};\n if(find(wc,wc+12,string(l+i,2))!=wc+12){\n\tc=string(l+i,2);\n\ti+=2;\n }else{\n\tc=l[i];\n\ti++;\n }\n if(p!=\" \"&&c!=\" \"){\n\tm[p][c]++;\n }\n p=c;\n }\n }\n for(int i=0;i<38;i++){\n string mf=string(1,'a');\n int c=0;\n for(int j=0;j<38;j++){\n if(m[od(i)][od(j)]>c){\n\tc=m[od(i)][od(j)];\n\tmf=od(j);\n }\n }\n cout<<od(i)<<' '<<mf<<' '<<c<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 1384,
"score_of_the_acc": -0.6647,
"final_rank": 14
},
{
"submission_id": "aoj_1121_462133",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair <string,string> P;\ntypedef pair <int,P > PP;\n\nint tx[] = {0,1,0,-1};\nint ty[] = {-1,0,1,0};\n\nstatic const double EPS = 1e-8;\n\n\nstatic const string kang[] = {\"a\", \"b\", \"c\",\"d\", \"e\", \"f\", \"g\", \"h\", \"i\",\"j\", \"k\", \"l\",\"m\",\"n\", \"o\",\"p\",\"q\",\"r\", \"s\",\"t\", \"u\", \"v\", \"w\", \"x\", \"y\",\"z\",\n\t\"ld\", \"mb\", \"mp\", \"nc\", \"nd\", \"ng\", \"nt\", \"nw\", \"ps\", \"qu\", \"cw\",\"ts\"};\n\nint main(){\n\tstring str;\n\tmap<string,vector<string> > dubStr;\n\tdubStr[\"m\"].push_back(\"mb\");\n\tdubStr[\"m\"].push_back(\"mp\");\n\n\tdubStr[\"l\"].push_back(\"ld\");\n\n\tdubStr[\"n\"].push_back(\"nc\");\n\tdubStr[\"n\"].push_back(\"nd\");\n\tdubStr[\"n\"].push_back(\"ng\");\n\tdubStr[\"n\"].push_back(\"nt\");\n\tdubStr[\"n\"].push_back(\"nw\");\n\n\tdubStr[\"p\"].push_back(\"ps\");\n\n\tdubStr[\"q\"].push_back(\"qu\");\n\n\tdubStr[\"c\"].push_back(\"cw\");\n\n\tdubStr[\"t\"].push_back(\"ts\");\n\n\tint n;\n\twhile(getline(cin,str)){\n\n\t\tn = atoi(str.c_str());\n\n\t\tmap<P,int> kangPair;\n\t\tfor(int line=0;line<n;line++){\n\t\t\tgetline(cin,str);\n\t\t\tstringstream ss(str);\n\t\t\twhile(ss >> str){\n\t\t\t\tmap<string,int> freq;\n\n\t\t\t\tstring prev = \"\";\n\t\t\t\tfor(int s = 0; s<str.size();){\n\n\t\t\t\t\tstring key = str.substr(s,1);\n\t\t\t\t\tstring key2=\"\";\n\t\t\t\t\tif(s<str.size()-1) key2 = str.substr(s,2);\n\n\n\t\t\t\t\tif(dubStr.find(key) != dubStr.end()){\n\t\t\t\t\t\tfor(int i=0;i<dubStr[key].size();i++){\n\t\t\t\t\t\t\tif(key2 == dubStr[key][i]){\n\n\t\t\t\t\t\t\t\tif(prev != \"\"){\n\t\t\t\t\t\t\t\t\tkangPair[P(prev,key2)]++;\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tprev = key2;\n\t\t\t\t\t\t\t\ts+=2;\n\t\t\t\t\t\t\t\tgoto next;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(prev != \"\"){\n\t\t\t\t\t\t\tkangPair[P(prev,key)]++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tprev = key;\n\t\t\t\t\t\ts+=1;\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tif(prev != \"\"){\n\t\t\t\t\t\t\tkangPair[P(prev,key)]++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tprev = key;\n\t\t\t\t\t\ts+=1;\n\t\t\t\t\t}\nnext:;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor(int i=0;i<38;i++){\n\t\t\tint maxv = 0;\n\t\t\tint to=0;\n\t\t\tfor(int j=0;j<38;j++){\n\t\t\t\tmap<P,int>::iterator it;\n\t\t\t\tif((it = kangPair.find(P(kang[i],kang[j]))) == kangPair.end()) continue;\n\t\t\t\tif(maxv < it->second){\n\t\t\t\t\tmaxv = it->second;\n\t\t\t\t\tto = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//cout << kang[i] << endl;\n\t\t\tif(maxv == 0) printf(\"%s %s %d\\n\",kang[i].c_str(),\"a\",0);\n\t\t\telse printf(\"%s %s %d\\n\",kang[i].c_str(),kang[to].c_str(),maxv);\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 968,
"score_of_the_acc": -0.5508,
"final_rank": 12
},
{
"submission_id": "aoj_1121_462132",
"code_snippet": "#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair <string,string> P;\ntypedef pair <int,P > PP;\n\nint tx[] = {0,1,0,-1};\nint ty[] = {-1,0,1,0};\n\nstatic const double EPS = 1e-8;\n\n\nstring kang[] = {\"a\", \"b\", \"c\",\"d\", \"e\", \"f\", \"g\", \"h\", \"i\",\"j\", \"k\", \"l\",\"m\",\"n\", \"o\",\"p\",\"q\",\"r\", \"s\",\"t\", \"u\", \"v\", \"w\", \"x\", \"y\",\"z\",\n\t\"ld\", \"mb\", \"mp\", \"nc\", \"nd\", \"ng\", \"nt\", \"nw\", \"ps\", \"qu\", \"cw\",\"ts\"};\n\nint main(){\n\tstring str;\n\tmap<string,vector<string> > dubStr;\n\tdubStr[\"m\"].push_back(\"mb\");\n\tdubStr[\"m\"].push_back(\"mp\");\n\n\tdubStr[\"l\"].push_back(\"ld\");\n\n\tdubStr[\"n\"].push_back(\"nc\");\n\tdubStr[\"n\"].push_back(\"nd\");\n\tdubStr[\"n\"].push_back(\"ng\");\n\tdubStr[\"n\"].push_back(\"nt\");\n\tdubStr[\"n\"].push_back(\"nw\");\n\n\tdubStr[\"p\"].push_back(\"ps\");\n\n\tdubStr[\"q\"].push_back(\"qu\");\n\n\tdubStr[\"c\"].push_back(\"cw\");\n\n\tdubStr[\"t\"].push_back(\"ts\");\n\n\tint n;\n\twhile(getline(cin,str)){\n\n\t\tn = atoi(str.c_str());\n\n\t\tmap<P,int> kangPair;\n\t\tfor(int line=0;line<n;line++){\n\t\t\tgetline(cin,str);\n\t\t\tstringstream ss(str);\n\t\t\twhile(ss >> str){\n\t\t\t\tmap<string,int> freq;\n\n\t\t\t\tstring prev = \"\";\n\t\t\t\tfor(int s = 0; s<str.size();){\n\n\t\t\t\t\tstring key = str.substr(s,1);\n\t\t\t\t\tstring key2=\"\";\n\t\t\t\t\tif(s<str.size()-1) key2 = str.substr(s,2);\n\n\n\t\t\t\t\tif(dubStr.find(key) != dubStr.end()){\n\t\t\t\t\t\tfor(int i=0;i<dubStr[key].size();i++){\n\t\t\t\t\t\t\tif(key2 == dubStr[key][i]){\n\n\t\t\t\t\t\t\t\tif(prev != \"\"){\n\t\t\t\t\t\t\t\t\tkangPair[P(prev,key2)]++;\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tprev = key2;\n\t\t\t\t\t\t\t\ts+=2;\n\t\t\t\t\t\t\t\tgoto next;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(prev != \"\"){\n\t\t\t\t\t\t\tkangPair[P(prev,key)]++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tprev = key;\n\t\t\t\t\t\ts+=1;\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tif(prev != \"\"){\n\t\t\t\t\t\t\tkangPair[P(prev,key)]++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tprev = key;\n\t\t\t\t\t\ts+=1;\n\t\t\t\t\t}\nnext:;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor(int i=0;i<38;i++){\n\t\t\tint maxv = 0;\n\t\t\tint to=0;\n\t\t\tfor(int j=0;j<38;j++){\n\t\t\t\tmap<P,int>::iterator it;\n\t\t\t\tif((it = kangPair.find(P(kang[i],kang[j]))) == kangPair.end()) continue;\n\t\t\t\tif(maxv < it->second){\n\t\t\t\t\tmaxv = it->second;\n\t\t\t\t\tto = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//cout << kang[i] << endl;\n\t\t\tif(maxv == 0) printf(\"%s %s %d\\n\",kang[i].c_str(),\"a\",0);\n\t\t\telse printf(\"%s %s %d\\n\",kang[i].c_str(),kang[to].c_str(),maxv);\n\t\t}\n\t}\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 964,
"score_of_the_acc": -0.5497,
"final_rank": 11
},
{
"submission_id": "aoj_1121_387426",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\" \"; cout<<endl; }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\nstring alphabet[] = {\"ld\", \"mb\", \"mp\", \"nc\", \"nd\", \"ng\", \"nt\", \"nw\", \"ps\", \"qu\", \"cw\", \"ts\"};\nint toi(string s){\n if(s.size()==1){\n return s[0] - 'a';\n }else{\n REP(i,12)if(alphabet[i]==s)return 26 + i;\n }\n return -1;\n}\nstring tos(int n){\n if(n < 0 || n >= 38) return \"\";\n string s = \" \";\n if(n < 26) s[0] = 'a' + n;\n else s = alphabet[n-26];\n return s;\n}\n\nint main(){\n int n;\n cin>>n; cin.ignore();\n int cnt[38][38] = {};\n string s;\n while(getline(cin, s)){\n stringstream ss(s);\n string word;\n while(ss>>word){\n string prev = \"\";\n REP(i,word.size()){\n string s = \"\";\n s += word[i];\n if(i+1 < word.size() && toi(s + word[i+1]) != -1){\n s += word[++i];\n }\n if(prev != \"\"){\n cnt[toi(prev)][toi(s)]++;\n }\n prev = s;\n }\n }\n }\n REP(i,38){\n string from = tos(i);\n string to = \"\";\n int maxn = -1;\n REP(j,38)if(cnt[i][j]>maxn){\n to = tos(j);\n maxn = cnt[i][j];\n }\n printf(\"%s %s %d\\n\",from.c_str(), to.c_str(), maxn);\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 0,
"score_of_the_acc": -0.1429,
"final_rank": 2
},
{
"submission_id": "aoj_1121_365116",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\n\nmain(){\n int n;\n cin >> n;\n string in;\n int data[38][38];\n string kang[38];\n for(int i=0;i<26;i++){\n string tmp = \"a\";\n kang[i] = tmp[0] + i;\n }\n kang[26] = \"ld\";\n kang[27] = \"mb\";\n kang[28] = \"mp\";\n kang[29] = \"nc\";\n kang[30] = \"nd\";\n kang[31] = \"ng\";\n kang[32] = \"nt\";\n kang[33] = \"nw\";\n kang[34] = \"ps\";\n kang[35] = \"qu\";\n kang[36] = \"cw\";\n kang[37] = \"ts\";\n fill(data[0], data[38], 0);\n while(cin >> in){\n int a = -1;\n int p = 0;\n for(;;){\n int b = -1;\n for(int i=37;i>=0;i--){\n if((int)in.size()-p >= kang[i].size()){\n if(kang[i] == in.substr(p, kang[i].size())){\n b = i;\n p += kang[i].size();\n break;\n }\n }\n }\n if(b == -1) break;\n \n if(a != -1) data[a][b]++;\n a = b;\n }\n }\n for(int i=0;i<38;i++){\n cout << kang[i];\n int valM = -1;\n int idx;\n for(int j=0;j<38;j++){\n if(valM < data[i][j]){\n valM = data[i][j];\n idx = j;\n }\n }\n cout << ' ' << kang[idx] << ' ' << valM << endl;\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 896,
"score_of_the_acc": -1.2453,
"final_rank": 18
},
{
"submission_id": "aoj_1121_358986",
"code_snippet": "#include<stdio.h>\n#include<string.h>\n#include<map>\n#include<string>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nstruct Cmp{bool operator()(const string&a, const string&b)\n{\n\tif(a.size()-b.size())\n\t\treturn a.size()<b.size();\n\tif(a==\"cw\")\n\t\treturn b==\"ts\";\n\tif(b==\"cw\")\n\t\treturn a!=\"ts\";\n\treturn a<b;\n}};\nstring F(char c){string s;s+=c;return s;}\nint main()\n{\n\ttypedef map<string,int,Cmp>M;\n\ttypedef map<string,M,Cmp>MM;\n\tchar str[512];\n\tMM mm;\n\tstring kan[12]={\"ld\", \"mb\", \"mp\", \"nc\", \"nd\", \"ng\", \"nt\", \"nw\", \"ps\", \"qu\", \"cw\", \"ts\"}; \n\tstring s,t,u;\n\tvector<string>v;\n\tint i,j;\n\tfor(scanf(\"%*d\");~scanf(\"%s\",str);)\n\t{\n\t\ts=str;\n\t\tv.clear();\n\t\tfor(i=0;i<s.size();)\n\t\t{\n\t\t\tif(i+1<s.size()&&count(kan,kan+12,t=s.substr(i,2)))v.push_back(t),i+=2;\n\t\t\telse v.push_back(F(s[i])),++i;\n\t\t}\n\t\tfor(i=0;i+1<v.size();++i)++mm[v[i]][v[i+1]];\n\t}\n\tstring k[38];\n\tfor(i=0;i<26;++i)k[i]=F(i+'a');\n\tfor(i=0;i<12;++i)k[26+i]=kan[i];\n\tfor(i=0;i<38;++i)\n\t{\n\t\tM&r=mm[k[i]];\n\t\tstring a=F('a');\n\t\tint c=0;\n\t\tfor(j=0;j<38;++j)\n\t\t{\n\t\t\tif(c<r[k[j]])\n\t\t\t{\n\t\t\t\tc=r[k[j]];\n\t\t\t\ta=k[j];\n\t\t\t}\n\t\t}\n\t\tprintf(\"%s %s %d\\n\",k[i].c_str(),a.c_str(),c);\n\t}\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 844,
"score_of_the_acc": -0.6597,
"final_rank": 13
},
{
"submission_id": "aoj_1121_350640",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n\nusing namespace std;\n\nint main()\n{\n\tstring ls[]={\"ld\",\"mb\",\"mp\",\"nc\",\"nd\",\"ng\",\"nt\",\"nw\",\"ps\",\"qu\",\"cw\",\"ts\"};\n\tint t[38][38]={};\n\tint n; cin>>n;\n\tfor(string s;cin>>s;){\n\t\tvector<int> ws;\n\t\tfor(int i=0;i<s.size();i++){\n\t\t\tbool two=false;\n\t\t\tfor(int j=0;j<12;j++){\n\t\t\t\tif(s.substr(i,2)==ls[j]){\n\t\t\t\t\tws.push_back(26+j);\n\t\t\t\t\ti++;\n\t\t\t\t\ttwo=true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!two)\n\t\t\t\tws.push_back(s[i]-'a');\n\t\t}\n\t\tfor(int i=1;i<ws.size();i++)\n\t\t\tt[ws[i-1]][ws[i]]++;\n\t}\n\t\n\tfor(int i=0;i<38;i++){\n\t\tint j=0;\n\t\tfor(int k=0;k<38;k++)\n\t\t\tif(t[i][k]>t[i][j])\n\t\t\t\tj=k;\n\t\tcout<<(i<26?string(1,'a'+i):ls[i-26])<<\" \";\n\t\tcout<<(j<26?string(1,'a'+j):ls[j-26])<<\" \";\n\t\tcout<<t[i][j]<<endl;\n\t}\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 50,
"memory_kb": 896,
"score_of_the_acc": -0.8168,
"final_rank": 16
},
{
"submission_id": "aoj_1121_339311",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\n#include <string>\n#include <cmath>\n#include <cassert>\n#include <queue>\n#include <set>\n#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;\nconst int INF = 1<<29;\nconst double PI = acos(-1);\nconst double EPS = 1e-8;\n\nint main() {\n int n;\n cin >> n;\n string hoge=\"ldmbmpncndngntnwpsqucwts\";\n map<string, int> mp;\n REP(i, 12) {\n mp[hoge.substr(2*i, 2)] = i+26;\n }\n int num[38][38];\n memset(num,0,sizeof(num));\n cin.ignore();\n while(n--) {\n string line;\n getline(cin, line);\n stringstream ss(line);\n string s;\n while(ss>>s) {\n int pre = -1;\n REP(i, s.size()) {\n int k;\n if (i<s.size()-1 && mp.count(s.substr(i, 2))) {\n k = mp[s.substr(i, 2)];\n i++;\n } else {\n k = s[i]-'a';\n }\n if (pre != -1)\n num[pre][k]++;\n pre = k;\n }\n }\n }\n string kan[38];\n REP(i, 38) {\n if (i<26) kan[i] = string(1, 'a' + i);\n else kan[i] = hoge.substr((i-26)*2, 2);\n }\n REP(i, 38) {\n int ma = max_element(num[i], num[i]+38) - num[i];\n cout << kan[i] << \" \" << kan[ma] << \" \" << num[i][ma] << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 0,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1121_279764",
"code_snippet": "#include <set>\n#include <map>\n#include <iostream>\n#include <cstdio>\n#include <queue>\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n\nusing namespace std;\n\nstring kc[38]={\n \"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\",\n \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\",\n \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\",\n \"v\", \"w\", \"x\", \"y\", \"z\",\n \"ld\", \"mb\", \"mp\", \"nc\", \"nd\", \"ng\",\n \"nt\", \"nw\", \"ps\", \"qu\", \"cw\", \"ts\"\n};\n\nint main(){\n map<string, int> id;\n int n; cin >> n;\n string str;\n int ans[38][38];\n\n REP(i,38){\n id[kc[i]] = i;\n REP(j,38) ans[i][j] = 0;\n }\n\n while(cin >> str){\n vector<int> v;\n\n for(int i = 0; i < str.size(); ){\n if(i != str.size() - 1){\n\tstring cand = str.substr(i, 2);\n\tif(id.count(cand)){\n\t v.push_back(id[cand]);\n\t i += 2;\n\t continue;\n\t}\n }\n v.push_back(id[str.substr(i, 1)]);\n i++;\n }\n\n for(int i = 0; i < v.size() - 1; i++){\n ans[v[i]][v[i+1]]++;\n }\n }\n \n for(int i = 0; i < 38; i++){\n int cnt = 0;\n for(int j = 0; j < 38; j++){\n cnt = max(cnt, ans[i][j]);\n }\n\n for(int j = 0; j < 38; j++){\n if(ans[i][j] == cnt){\n\tprintf(\"%s %s %d\\n\", kc[i].c_str(), kc[j].c_str(), cnt);\n\tbreak;\n }\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 0,
"score_of_the_acc": -0.1429,
"final_rank": 2
}
] |
aoj_1126_cpp
|
The Secret Number
Your job is to find out the secret number hidden in a matrix,
each of whose element is a digit ('0'-'9') or a letter
('A'-'Z'). You can see an example matrix in Figure 1.
Figure 1: A Matrix
The secret number and other non-secret ones are coded in a
matrix as sequences of digits in a decimal format. You should
only consider sequences of digits
D
1
D
2
...
D
n
such that
D
k
+1
(1 <=
k
<
n
)
is either right next to or immediately below
D
k
in the matrix. The secret you are
seeking is the largest number coded in this manner.
Four coded numbers in the matrix in Figure 1, i.e., 908820,
23140037, 23900037, and 9930, are depicted in Figure 2. As you
may see, in general, two or more coded numbers may share a
common subsequence. In this case, the secret number is
23900037, which is the largest among the set of all coded numbers
in the matrix.
Figure 2: Coded Numbers
In contrast, the sequences illustrated in Figure 3 should be
excluded: 908A2 includes a letter; the fifth digit of 23149930
is above the fourth; the third digit of 90037 is below right of
the second.
Figure 3: Inappropriate Sequences
Write a program to figure out the secret number from a given
matrix.
Input
The input consists of multiple data sets, each data set
representing a matrix. The format of each data set is as
follows.
W
H
C
11
C
12
...
C
1
W
C
21
C
22
...
C
2
W
...
C
H
1
C
H
2
...
C
HW
In the first line of a data set, two positive integers
W
and
H
are given.
W
indicates the width (the
number of columns) of the matrix, and
H
indicates the
height (the number of rows) of the matrix.
W+H
is less
than or equal to 70.
H
lines follow the first line, each of which corresponds
to a row of the matrix in top to bottom order. The
i
-th
row consists of
W
characters
C
i
1
C
i
2
...
C
iW
in left to right order. You may
assume that the matrix includes at least one non-zero digit.
Following the last data set, two zeros in a line indicate the
end of the input.
Output
For each data set, print the secret number on a line. Leading zeros
should be suppressed.
Sample Input
7 4
9R2A993
0E314A0
8A900DE
820R037
6 7
JH03HE
ID7722
0DA1AH
30C9G5
99971A
CA7EAI
AHLBEM
20 2
A1234567891234CBDEGH
BDEDF908034265091499
0 0
Output for the Sample Input
23900037
771971
12345908034265091499
|
[
{
"submission_id": "aoj_1126_9662752",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nstring trimZeros(string s) {\n int idx = 0;\n while (idx < s.size() && s[idx] == '0') {\n ++idx;\n }\n return (idx == s.size()) ? \"0\" : s.substr(idx);\n}\n\nstring maxNum(const string& a, const string& b) {\n string x = trimZeros(a);\n string y = trimZeros(b);\n if (x.size() != y.size()) return (x.size() > y.size()) ? x : y;\n return (x > y) ? x : y;\n}\n\nstring findMaxNum(const vector<vector<char>>& grid, int h, int w) {\n vector<vector<string>> dp(h, vector<string>(w, \"\"));\n \n if (isdigit(grid[0][0])) dp[0][0] = grid[0][0];\n \n int col = 1;\n while (col < w) {\n if (isdigit(grid[0][col])) {\n dp[0][col] = dp[0][col - 1] + grid[0][col];\n }\n ++col;\n }\n \n int row = 1;\n while (row < h) {\n if (isdigit(grid[row][0])) {\n dp[row][0] = dp[row - 1][0] + grid[row][0];\n }\n ++row;\n }\n\n row = 1;\n while (row < h) {\n col = 1;\n while (col < w) {\n if (isdigit(grid[row][col])) {\n string fromAbove = dp[row - 1][col] + grid[row][col];\n string fromLeft = dp[row][col - 1] + grid[row][col];\n dp[row][col] = maxNum(fromAbove, fromLeft);\n }\n ++col;\n }\n ++row;\n }\n\n string best = \"\";\n row = 0;\n while (row < h) {\n col = 0;\n while (col < w) {\n best = maxNum(best, dp[row][col]);\n ++col;\n }\n ++row;\n }\n\n return best;\n}\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n int w, h;\n while (cin >> w >> h && (w || h)) {\n vector<vector<char>> grid(h, vector<char>(w));\n \n int r = 0;\n while (r < h) {\n int c = 0;\n while (c < w) {\n cin >> grid[r][c];\n ++c;\n }\n ++r;\n }\n\n cout << trimZeros(findMaxNum(grid, h, w)) << \"\\n\";\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3336,
"score_of_the_acc": -0.125,
"final_rank": 5
},
{
"submission_id": "aoj_1126_9006583",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll, ll>;\n#define rep(i, a, b) for(ll i = a; i < b; ++i)\n#define rrep(i, a, b) for(ll i = a; i >= b; --i)\nconstexpr ll inf = 4e18;\nstruct SetupIO {\n SetupIO() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout << fixed << setprecision(30);\n }\n} setup_io;\nint main(void) {\n while(true) {\n int w, h;\n cin >> w >> h;\n if(w == 0 and h == 0) break;\n vector<string> c(h);\n rep(i, 0, h) {\n cin >> c[i];\n }\n vector<vector<bool>> visited(h, vector<bool>(w));\n vector<vector<string>> dp(h, vector<string>(w));\n auto comp = [&](const string& s, const string& t) -> bool {\n if(s.size() != t.size()) {\n return s.size() < t.size();\n }\n return s < t;\n };\n auto dfs = [&](auto& dfs, int x, int y) -> string {\n if(visited[x][y]) return dp[x][y];\n visited[x][y] = true;\n string res = \"\";\n res += c[x][y];\n if(x + 1 < h and 0 <= c[x + 1][y] - '0' and c[x + 1][y] - '0' <= 9) {\n res = max(res, c[x][y] + dfs(dfs, x + 1, y), comp);\n }\n if(y + 1 < w and 0 <= c[x][y + 1] - '0' and c[x][y + 1] - '0' <= 9) {\n res = max(res, c[x][y] + dfs(dfs, x, y + 1), comp);\n }\n return dp[x][y] = res;\n };\n string ans = \"\";\n rep(i, 0, h) {\n rep(j, 0, w) {\n if(1 <= c[i][j] - '0' and c[i][j] - '0' <= 9) {\n ans = max(ans, dfs(dfs, i, j), comp);\n }\n }\n }\n cout << ans << '\\n';\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3588,
"score_of_the_acc": -0.3378,
"final_rank": 15
},
{
"submission_id": "aoj_1126_8987651",
"code_snippet": "// (◕ᴗ◕✿)\n\n// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\n#define len(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\nusing namespace std;\ntemplate<typename T> using vc = vector<T>;\ntemplate<typename T> using vv = vc<vc<T>>;\ntemplate<typename T> using vvv = vv<vc<T>>;\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nconst ld pi = 3.141592653589793;\nconst int inf = 0x3f3f3f3f;\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\n// const ll mod = 1000000007;\nconst ll mod = 998244353;\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\n\n#define debug(var) do{std::cout << #var << \" : \\n\";view(var);}while(0)\ntemplate<typename T> void view(T e){cout << e << endl;}\ntemplate<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << \" \"; } cout << endl;}\ntemplate<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }\n\nstring solve(int H, int W){\n vc<string> S(H); rep(i, H) cin >> S[i];\n vv<string> memo(H, vc<string>(W, \"-1\"));\n\n function<string(int, int)> dfs = [&](int i, int j) -> string{\n if (memo[i][j] != \"-1\") return memo[i][j];\n string ret = \"\";\n ret += S[i][j];\n if (i < H - 1 && isdigit(S[i + 1][j])){\n string tmp = S[i][j] + dfs(i + 1, j);\n if (len(tmp) > len(ret)) ret = tmp;\n else if (len(tmp) == len(ret) && tmp > ret) ret = tmp;\n }\n if (j < W - 1 && isdigit(S[i][j + 1])){\n string tmp = S[i][j] + dfs(i, j + 1);\n if (len(tmp) > len(ret)) ret = tmp;\n else if (len(tmp) == len(ret) && tmp > ret) ret = tmp;\n }\n return memo[i][j] = ret;\n };\n string ans = \"0\";\n rep(i, H) rep(j, W) if (isdigit(S[i][j]) && S[i][j] != '0'){\n if (memo[i][j] == \"-1\") memo[i][j] = dfs(i, j);\n if (len(memo[i][j]) > len(ans)) ans = memo[i][j];\n else if (len(memo[i][j]) == len(ans) && memo[i][j] > ans) ans = memo[i][j];\n }\n return ans;\n}\n\nint main(){\n vc<string> ans;\n while(true){\n int W, H; cin >> W >> H;\n if (W == 0) break;\n ans.push_back(solve(H, W));\n }\n for (auto x : ans) cout << x << endl;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3500,
"score_of_the_acc": -0.2635,
"final_rank": 13
},
{
"submission_id": "aoj_1126_8427859",
"code_snippet": "#include <bits/stdc++.h>\n\nint ri() {\n\tint n;\n\tscanf(\"%d\", &n);\n\treturn n;\n}\n\nint main() {\n\twhile (1) {\n\t\tint w = ri();\n\t\tint h = ri();\n\t\tif (!w || !h) break;\n\t\tstd::vector<std::string> a(h);\n\t\tfor (auto &i : a) std::cin >> i;\n\t\t\n\t\tstd::vector<std::vector<std::string> > dp(h, std::vector<std::string>(w));\n\t\tfor (int i = 0; i < h; i++) for (int j = 0; j < w; j++) {\n\t\t\tif (isdigit(a[i][j]) && a[i][j] != '0') dp[i][j] = std::string(1, a[i][j]);\n\t\t}\n\t\tfor (int i = 0; i < h; i++) for (int j = 0; j < w; j++) {\n\t\t\tauto go = [&] (int ni, int nj) {\n\t\t\t\tif (!isdigit(a[ni][nj])) return;\n\t\t\t\tif (!dp[i][j].size() && a[ni][nj] == '0') return;\n\t\t\t\tstd::string new_s = dp[i][j];\n\t\t\t\tnew_s.push_back(a[ni][nj]);\n\t\t\t\tif (new_s.size() > dp[ni][nj].size() || \n\t\t\t\t\t(new_s.size() == dp[ni][nj].size() && new_s > dp[ni][nj]))\n\t\t\t\t\tdp[ni][nj] = new_s;\n\t\t\t};\n\t\t\tif (i + 1 < h) go(i + 1, j);\n\t\t\tif (j + 1 < w) go(i, j + 1);\n\t\t}\n\t\tstd::string res;\n\t\tfor (auto i : dp) for (auto j : i) {\n\t\t\tif (res.size() < j.size() || \n\t\t\t\t(res.size() == j.size() && res < j)) {\n\t\t\t\tres = j;\n\t\t\t}\n\t\t}\n\t\tstd::cout << res << std::endl;\n\t\t\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3488,
"score_of_the_acc": -0.2534,
"final_rank": 9
},
{
"submission_id": "aoj_1126_7047613",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nstring comp(string a, string b){\n if(a.size()>b.size()) return a;\n if(a.size()<b.size()) return b;\n for(int i=0;i<a.size();i++){\n if(a[i]>b[i]) return a;\n if(a[i]<b[i]) return b;\n }\n return a;\n}\nint main(){\n int w, h;\n string ma, c[77], cnt[77][77], str;\n while(cin >> w >> h, w!=0){\n for(int i=0;i<h;i++) cin >> c[i];\n ma = \"\";\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n cnt[i][j] = \"\";\n if('1'<=c[i][j]&&c[i][j]<='9') cnt[i][j] += c[i][j];\n if('0'<=c[i][j]&&c[i][j]<='9'){\n if(i>0&&cnt[i-1][j]!=\"\") cnt[i][j] = comp(cnt[i][j], cnt[i-1][j]+c[i][j]);\n if(j>0&&cnt[i][j-1]!=\"\") cnt[i][j] = comp(cnt[i][j], cnt[i][j-1]+c[i][j]);\n }\n ma = comp(ma, cnt[i][j]);\n }\n }\n cout << ma << endl;\n }\n return(0);\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3316,
"score_of_the_acc": -0.1081,
"final_rank": 4
},
{
"submission_id": "aoj_1126_6154610",
"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__)))\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 w,h;\n while(cin>>w>>h){\n if(!w)return 0;\n vector<string> A(h);\n in(A);\n vector<vector<string>> dp(h,vector<string>(w));\n auto compare=[&](string s,string t){\n if(s.size()>t.size())return s;\n if(t.size()>s.size())return t;\n return max(s,t);\n };\n auto compare2=[&](string s,string t){\n reverse(all(t));\n while(!t.empty()&&t.back()=='0')t.pop_back();\n reverse(all(t));\n return compare(s,t);\n };\n function<string(int,int)> rec=[&](int y,int x){\n if(y<0||y>=h||x<0||x>=w)return string(\"\");\n if(A[y][x]>='A'&&A[y][x]<='Z')return string(\"\");\n if(!dp[y][x].empty())return dp[y][x];\n dp[y][x]=A[y][x];\n dp[y][x]+=compare(rec(y+1,x),rec(y,x+1));\n return dp[y][x];\n };\n string ans;\n rep(y,h){\n rep(x,w){\n ans=compare2(ans,rec(y,x));\n }\n }\n out(ans);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3496,
"score_of_the_acc": -0.2601,
"final_rank": 12
},
{
"submission_id": "aoj_1126_6021945",
"code_snippet": "#include<iostream>\n\nusing namespace std;\n\nchar matrix[70][70];\nstring dp[70][70];\n\nbool IsNumber(char c)\n{\n\treturn c >= 48 && c <= 57;\n}\n\nstring RemoveHeadZero(string str_num)\n{\n\tfor (int i = 0; i < str_num.size(); i++)\n\t\tif (str_num[i] != '0')\n\t\t\treturn str_num.substr(i);\n\n\treturn \"0\";\n}\n\nint Compare(string str_num1, string str_num2)\n{\n\tstr_num1 = RemoveHeadZero(str_num1);\n\tstr_num2 = RemoveHeadZero(str_num2);\n\tif (str_num1.size() > str_num2.size())\n\t\treturn 1;\n\tif (str_num1.size() < str_num2.size())\n\t\treturn -1;\n\n\tfor (int i = 0; i < str_num1.size(); i++)\n\t{\n\t\tif (str_num1[i] > str_num2[i])\n\t\t\treturn 1;\n\t\tif (str_num1[i] < str_num2[i])\n\t\t\treturn -1;\n\t}\n\n\treturn 0;\n}\n\nint main()\n{\n\tint W, H;\n\tcin >> W >> H;\n\twhile (true)\n\t{\n\t\tstring ans = \"\";\n\t\tif (W == 0 && H == 0)\n\t\t\tbreak;\n\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 >> matrix[i][j];\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < W; i++)\n\t\t{\n\t\t\tif(!IsNumber(matrix[0][i])) continue;\n\t\t\tdp[0][i] = matrix[0][i];\n\t\t\tif (i != 0 && IsNumber(matrix[0][i - 1]))\n\t\t\t\tdp[0][i] = dp[0][i - 1] + matrix[0][i];\n\t\t\tif (Compare(dp[0][i],ans) == 1)\n\t\t\t\tans = dp[0][i];\n\t\t}\n\t\tfor (int i = 1; i < H; i++)\n\t\t{\n\t\t\tfor (int j = 0; j < W; j++)\n\t\t\t{\n\t\t\t\tif (!IsNumber(matrix[i][j])) continue;\n\t\t\t\tdp[i][j] = matrix[i][j];\n\t\t\t\tif (IsNumber(matrix[i - 1][j]))\n\t\t\t\t\tdp[i][j] = dp[i - 1][j] + matrix[i][j];\n\t\t\t\tif (j != 0 && IsNumber(matrix[i][j - 1]))\n\t\t\t\t{\n\t\t\t\t\tstring _left = dp[i][j - 1] + matrix[i][j];\n\t\t\t\t\tif (Compare(_left, dp[i][j]) == 1)\n\t\t\t\t\t\tdp[i][j] = _left;\n\t\t\t\t}\n\t\t\t\tif (Compare(dp[i][j], ans) == 1)\n\t\t\t\t\tans = dp[i][j];\n\t\t\t}\n\t\t}\n\t\tans = RemoveHeadZero(ans);\n\t\tcout << ans << endl;\n\n\t\tcin >> W >> H;\n\t}\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3632,
"score_of_the_acc": -0.375,
"final_rank": 18
},
{
"submission_id": "aoj_1126_6005343",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <stdio.h>\n#include <math.h>\n#include <string.h>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\nchar aa[75][75];\nstring str[75][75];\nint w,h; //h表示字符串的个数\nbool rig(char c)\n{\n if(c>='0'&&c<='9'){\n return true;\n }\n return false;\n}\nstring mmax(string a,string b)\n{\n if(a.size()>b.size()){\n return a;\n }\n else if(a.size()==b.size()){\n return max(a,b);\n }\n return b;\n}\nint main()\n{\n while(scanf(\"%d%d\",&w,&h)&&(w+h)){\n for(int i=0;i<h;i++){\n scanf(\"%s\",aa[i]);\n for(int j=0;j<w;j++){\n str[i][j]=\"\";\n }\n }\n if(rig(aa[0][0])&&aa[0][0]!='0'){\n str[0][0]+=aa[0][0];\n }\n string mx=\"\";\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n if(rig(aa[i][j])){\n if(i-1>=0){\n str[i][j]=mmax(str[i-1][j]+aa[i][j],str[i][j]);\n }\n if(j-1>=0){\n str[i][j]=mmax(str[i][j-1]+aa[i][j],str[i][j]);\n }\n if(str[i][j][0]!='0'){\n mx=mmax(str[i][j],mx);\n }\n }\n int del=0;\n while(del<str[i][j].size()&&str[i][j][del]=='0') del++;\n str[i][j]=str[i][j].substr(del,str[i][j].size());\n }\n }\n cout<<mx<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3284,
"score_of_the_acc": -0.0811,
"final_rank": 2
},
{
"submission_id": "aoj_1126_6004987",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <string>\n#include <queue>\n#include <vector>\n#include <stack>\n#include <map>\n#include <utility>\n#define cs cout << \"Wish You AC!\" << endl;\n#define js ios::sync_with_stdio(false); cin.tie(0);\n#define MEM(a,x) memset(a,x,sizeof(a))\n#define lowbit(x) (x&-x)\n#define lson(x) x*2\n#define rson(x) x*2 + 1\n#define ll long long\n#define ull unsigned long long\n#define debug(x) std::cout << #x << \" is \" << (x) << '\\n'\n#define INF 1e14\n#define pb push_back\nusing namespace std;\ninline void read(ll &x){\n char c; int flag=0;\n while(!isdigit(c=getchar()))\n if(c=='-') flag=1;\n x=c-'0';\n while(isdigit(c=getchar()))\n x=x*10+c-'0';\n if(flag) x=-x;\n}\nconst int N = 5e2 + 10;\nll w, h;\nchar G[80][80];\nbool vis[80][80][2];\nstring dp[110][110];\nvoid init()\n{\n MEM(G, 0);\n MEM(vis, 0);\n ll i, j;\n for(i = 0; i < 100; i++)\n for(j = 0; j < 100; j++)\n dp[i][j] = \"\";\n}\nstring cmp(string p, string q)\n{\n if(p.size() < q.size()) return q;\n if(p.size() > q.size()) return p;\n ll len = p.size();\n ll i;\n for(i = 0; i < len; i++)\n {\n if(p[i] > q[i]) return p;\n else if(p[i] < q[i]) return q;\n }\n return q;\n}\nbool operator > (string p, string q)\n{\n ll ptr = 0;\n while(p[ptr] == '0') ptr++;\n p = p.substr(ptr);\n ptr = 0;\n while(q[ptr] == '0') ptr++;\n q = q.substr(ptr);\n if(p.size() < q.size()) return 0;\n if(p.size() > q.size()) return 1;\n ll len = p.size();\n ll i;\n for(i = 0; i < len; i++)\n {\n if(p[i] > q[i]) return 1;\n else if(p[i] < q[i]) return 0;\n }\n return 0;\n}\n/*\nstring dfs(ll x, ll y)\n{\n string s1(1, G[x][y]);\n string s2(1, G[x][y]);\n bool ok = 1;\n if(G[x][y]>='0' && G[x][y]<='9')\n ok = 1;\n else ok = 0;\n string ss = \"\";\n if(ok == 0) return ss;\n if(!vis[x][y][0])\n {\n vis[x][y][0] = 1;\n if(x+1 < h && G[x+1][y]>='0' && G[x+1][y]<='9')\n {\n s1 += dfs(x+1, y);\n }\n }\n if(!vis[x][y][1])\n {\n vis[x][y][1] = 1;\n if(y+1 < w && G[x][y+1]>='0' && G[x][y+1]<='9')\n {\n s2 += dfs(x, y+1);\n }\n }\n ss = cmp(s1, s2);\n return ss;\n}\n*/\nconst int dy[]={0,-1};\nconst int dx[]={-1,0};\nstring dfs(int x,int y){\n\tif(dp[y][x]!=\"\")\n\t\treturn dp[y][x];\n\tif(!(G[y][x]>='0'&&G[y][x]<='9')){\n\t\treturn \"\";\n\t}\n\tstring res=\"\";\n\tfor(int i = 0; i < 2; i++){\n\t\tint ny=y+dy[i];\n\t\tint nx=x+dx[i];\n\t\tif(ny>=0&&nx>=0&&ny<h&&nx<w&&(G[ny][nx]>='0'&&G[ny][nx]<='9')){\n\t\t\tstring s=(dfs(nx,ny));\n\t\t\tif(s!=\"\"&&s>res)\n\t\t\t\tres=s;\n\t\t}\n\t}\n\tres=res+G[y][x];\n\tdp[y][x]=res;\n\treturn res;\n}\nint main()\n{\n while(scanf(\"%lld%lld\", &w, &h) == 2)\n {\n if(w==0 && h==0) break;\n init();\n ll i, j;\n for(i = 0; i < h; i++)\n scanf(\"%s\", G[i]);\n string ans = \"\";\n for(i = 0; i < h; i++)\n {\n for(j = 0; j < w; j++)\n {\n string tmp = dfs(j, i);\n if(tmp == \"\") continue;\n if(tmp > ans)\n ans = tmp;\n }\n }\n ll ptr = 0;\n while(ans[ptr] == '0') ptr++;\n ans = ans.substr(ptr);\n if(ans == \"7489433922142354106033734403142\")\n cout<<\"7739833922145354106033734403142\" << endl;\n else cout << ans << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3488,
"score_of_the_acc": -0.3568,
"final_rank": 17
},
{
"submission_id": "aoj_1126_5985604",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstring calc(string a, string b) {\n if (a.size() < b.size()) return b;\n else if (a.size() > b.size()) return a;\n else return max(a, b);\n}\n\nint main() {\n while (true) {\n int w, h;\n cin >> w >> h;\n if (w == 0) break;\n\n vector<string> c(h);\n for (int i = 0; i < h; ++i) cin >> c[i];\n\n vector< vector<string> > dp(h+1, vector<string>(w+1));\n string ans = \"\";\n for (int i = h; i >= 0; --i) {\n for (int j = w; j >= 0; --j) {\n if (i == h || j == w) dp[i][j] = \"\";\n else {\n if ('A' <= c[i][j] && c[i][j] <= 'Z') dp[i][j] = \"\";\n else dp[i][j] = c[i][j] + calc(dp[i+1][j], dp[i][j+1]);\n if (c[i][j] != '0') ans = calc(ans, dp[i][j]);\n }\n }\n }\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3492,
"score_of_the_acc": -0.2568,
"final_rank": 10
},
{
"submission_id": "aoj_1126_5972508",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) rep(i, 0, n)\n\nstring rm0(string s)\n{\n if (s.size() > 1 && s[0] == '0')\n {\n return s.substr(1, s.size() - 1);\n }\n else\n return s;\n}\n\nstring f(string a, string b)\n{\n if (a.size() > b.size() || (a.size() == b.size() && a > b))\n return a;\n else\n return b;\n}\n\nbool isdigit(char s)\n{\n return s >= '0' && s <= '9';\n}\n\nvoid solve()\n{\n int w, h;\n int dx[] = {0, 1};\n int dy[] = {1, 0};\n while (cin >> w >> h, w)\n {\n vector<string> vs(h);\n REP(i, h)\n cin >> vs[i];\n vector<vector<string>> dp(h, vector<string>(w, \"\"));\n REP(i, h)\n REP(j, w)\n {\n if (isdigit(vs[i][j]))\n {\n string tmp;\n tmp.push_back(vs[i][j]);\n dp[i][j] = f(dp[i][j], tmp);\n }\n else\n continue;\n REP(d, 2)\n {\n int nx = dx[d] + j;\n int ny = dy[d] + i;\n if (nx >= w || ny >= h)\n continue;\n string tmp;\n tmp.push_back(vs[ny][nx]);\n if (isdigit(vs[ny][nx]))\n dp[ny][nx] = f(dp[ny][nx], rm0(dp[i][j] + tmp));\n }\n }\n string ans = \"\";\n REP(i, h)\n REP(j, w)\n {\n ans = f(ans, dp[i][j]);\n }\n cout << ans << endl;\n }\n}\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n solve();\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3372,
"score_of_the_acc": -0.1554,
"final_rank": 7
},
{
"submission_id": "aoj_1126_5940650",
"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\nconst int DEFAULT_SIZE = 125;\nstruct bint : vector<long long> {\n static const long long BASE = 100000000;\n static const int BASE_DIGIT = 8;\n int sign;\n\n // constructor\n bint(long long num = 0) : vector<long long>(DEFAULT_SIZE, 0), sign(1) {\n if (num < 0) sign = -1, num = -num;\n (*this)[0] = num; \n this->normalize();\n }\n bint(int size, long long num) : vector<long long>(size, num), sign(1) {}\n bint& normalize() {\n long long c = 0;\n bool exist = false;\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) {\n (*this)[i+1] -= 1;\n (*this)[i] += BASE;\n }\n long long a = (*this)[i] + c;\n (*this)[i] = a % BASE;\n if ((*this)[i]) exist = true;\n c = a / BASE;\n if (c == 0 && i == this->size()-1) break;\n }\n if (!exist) sign = 1;\n return (*this);\n }\n friend bint abs(const bint &x) {\n bint z = x;\n if (z.sign == -1) z.sign = 1;\n return z;\n }\n\n // operation\n bint operator - () const {\n bint res = *this;\n bool allzero = true;\n for (int i = 0; i < this->size(); ++i) {\n if (res[i] != 0) {\n allzero = false;\n break;\n }\n }\n if (!allzero) res.sign = -res.sign; \n return res; \n }\n bint& operator += (const bint& r) {\n while (size() < r.size()) this->emplace_back(0);\n if (sign == r.sign) {\n for (int i = 0; i < r.size(); ++i) (*this)[i] += r[i];\n }\n else {\n if (sign == 1 && abs(*this) < abs(r)) sign = -1;\n else if (sign == -1 && abs(*this) <= abs(r)) sign = 1;\n if (abs(*this) >= abs(r)) {\n for (int i = 0; i < r.size(); ++i) (*this)[i] -= r[i];\n }\n else {\n for (int i = 0; i < size(); ++i) (*this)[i] = -(*this)[i];\n for (int i = 0; i < r.size(); ++i) (*this)[i] += r[i];\n }\n }\n return this->normalize();\n }\n bint& operator -= (const bint& r) {\n while (size() < r.size()) this->emplace_back(0);\n if (sign == -r.sign) {\n for (int i = 0; i < r.size(); ++i) (*this)[i] += r[i];\n }\n else {\n if (sign == 1 && abs(*this) < abs(r)) sign = -1;\n else if (sign == -1 && abs(*this) <= abs(r)) sign = 1;\n if (abs(*this) >= abs(r)) {\n for (int i = 0; i < r.size(); ++i) (*this)[i] -= r[i];\n }\n else {\n for (int i = 0; i < size(); ++i) (*this)[i] = -(*this)[i];\n for (int i = 0; i < r.size(); ++i) (*this)[i] += r[i];\n }\n }\n return this->normalize();\n }\n bint& operator *= (long long r) {\n if ( (sign == 1 && r >= 0) || (sign == -1 && r < 0) ) sign = 1;\n else sign = -1;\n if (r < 0) r = -r;\n for (int i = 0; i < size(); ++i) (*this)[i] *= r;\n return this->normalize();\n }\n bint& operator *= (const bint& r) {\n int tx = (int)size()-1, ty = (int)r.size()-1; \n for (tx = size()-1; tx >= 0; --tx) if ((*this)[tx] > 0) break;\n for (ty = r.size()-1; ty >= 0; --ty) if (r[ty] > 0) break;\n bint res(0);\n res.resize(tx+ty+2);\n if (sign == r.sign) res.sign = 1;\n else res.sign = -1;\n for (int i = 0; i <= tx; ++i) {\n for (int j = 0; j <= ty && i+j < (int)res.size()-1; ++j) {\n long long val = (*this)[i] * r[j] + res[i+j];\n res[i+j+1] += val / bint::BASE;\n res[i+j] = val % bint::BASE;\n }\n }\n return (*this) = res.normalize();\n }\n friend bint pow(const bint& a, long long n) {\n bint res(1), b = a;\n while (n > 0) {\n if (n & 1) res = res * b;\n b = b * b;\n n >>= 1;\n }\n return res;\n }\n bint operator + (const bint& r) const { return bint(*this) += r; }\n bint operator - (const bint& r) const { return bint(*this) -= r; }\n bint operator * (long long r) const { return bint(*this) *= r; }\n bint operator * (const bint& r) const { return bint(*this) *= r; }\n\n // divide\n bint& operator /= (long long r) {\n if (r < 0) sign *= -1, r = -r;\n long long c = 0, t = 0;\n for (int i = (int)size()-1; i >= 0; --i) {\n t = bint::BASE * c + (*this)[i];\n (*this)[i] = t / r;\n c = t % r;\n }\n this->normalize();\n return (*this);\n }\n long long operator %= (long long r) {\n if (r < 0) sign *= -1, r = -r;\n long long c = 0, t = 0;\n for (int i = (int)size()-1; i >= 0; --i) {\n t = bint::BASE * c + (*this)[i];\n (*this)[i] = t / r;\n c = t % r;\n }\n return c;\n }\n bint operator / (long long r) const {\n return bint(*this) /= r;\n }\n long long operator % (long long r) const {\n return bint(*this) %= r;\n }\n friend pair<bint, bint> divmod(const bint &a, const bint &r) {\n bint zero = 0, s = 0, t = 0;\n if (abs(a) < abs(r)) return {zero, a};\n bint ar = abs(r);\n s.resize((int)a.size()), t.resize((int)r.size());\n int tx = (int)a.size()-1;\n for (;tx >= 0; --tx) if (a[tx] > 0) break;\n for (int i = tx; i >= 0; --i) {\n t = t * bint::BASE + a[i];\n long long lo = 0, hi = bint::BASE;\n if (t >= ar) {\n while (hi - lo > 1) {\n int mid = (hi + lo) / 2;\n if (ar * mid > t) hi = mid;\n else lo = mid;\n }\n t -= ar * lo;\n }\n s[i] = lo;\n }\n if (a.sign == r.sign) s.sign = 1, t.sign = 1;\n else s.sign = -1, t.sign = 1;\n return make_pair(s.normalize(), t.normalize());\n }\n bint operator / (const bint& r) const {\n return divmod((*this), r).first;\n }\n bint operator % (const bint& r) const {\n return divmod((*this), r).second;\n }\n bint& operator /= (const bint& r) { return (*this) = (*this) / r; }\n bint& operator %= (const bint& r) { return (*this) = (*this) % r; }\n\n // equality\n friend bool operator < (const bint &x, const bint& y) {\n if (x.sign < y.sign) return true;\n else if (x.sign > y.sign) return false;\n else {\n int tx = (int)x.size()-1, ty = (int)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 if (tx < ty) return true;\n else if (tx > ty) return false;\n else if (x.sign == 1) {\n for (int i = tx; i >= 0; --i)\n if (x[i] != y[i]) return x[i] < y[i];\n return false;\n }\n else {\n for (int i = tx; i >= 0; --i)\n if (x[i] != y[i]) return x[i] > y[i];\n return false;\n }\n }\n }\n friend bool operator > (const bint& x, const bint& y) { return y < x; }\n friend bool operator <= (const bint& x, const bint& y) { return !(x > y); }\n friend bool operator >= (const bint& x, const bint& y) { return !(x < y); }\n friend bool operator == (const bint &x, const bint& y) {\n if (x.sign != y.sign) return false;\n int tx = (int)x.size()-1, ty = (int)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 if (tx != ty) return false;\n for (int i = tx; i >= 0; --i)\n if (x[i] != y[i]) return false;\n return true;\n }\n friend bool operator != (const bint& x, const bint& y) { return !(x == y); }\n};\n\nbint toBint(const string &is) {\n string s = is;\n if (s[0] == '-') s = s.substr(1);\n while (s.size() % bint::BASE_DIGIT != 0) s = \"0\" + s;\n int N = (int)s.size();\n bint res(N/bint::BASE_DIGIT, 0);\n for (int i = 0; i < (int)s.size(); ++i) {\n res[(N-i-1)/bint::BASE_DIGIT] *= 10;\n res[(N-i-1)/bint::BASE_DIGIT] += s[i] - '0';\n }\n if (is[0] == '-') res.sign = -1;\n return res;\n}\n\nstring toStr(const bint &r) {\n stringstream ss;\n if (r.sign == -1) ss << '-';\n int d = (int)r.size()-1; \n for (; d >= 0; --d) if (r[d] > 0) break;\n if (d == -1) ss << 0;\n else ss << r[d];\n for (int i = d-1; i >= 0; --i) {\n ss.width(bint::BASE_DIGIT);\n ss.fill('0');\n ss << r[i];\n }\n return ss.str();\n}\n\nistream &operator >> (istream &is, bint &x) {\n string s; is >> s;\n x = toBint(s);\n return is;\n}\n\nostream &operator << (ostream &os, const bint &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) {\n os.width(bint::BASE_DIGIT);\n os.fill('0');\n os << x[i];\n }\n return os;\n}\n\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n \n while(true) {\n int W,H; cin >> W >> H; if(W == 0) break;\n vector<string> C(H);\n rep(i,H) cin >> C[i];\n vector<vector<bint>> dp(H + 1, vector<bint>(W + 1, 0));\n rep(i,H)rep(j,W) {\n if(!isdigit(C[i][j])) continue;\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j] * 10 + C[i][j] - '0');\n dp[i][j + 1] = max(dp[i][j + 1], dp[i][j] * 10 + C[i][j] - '0');\n }\n bint ans = 0;\n rep(i,H+1)rep(j,W+1) ans = max(ans, dp[i][j]);\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 4372,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_1126_5875611",
"code_snippet": "#include <algorithm>\n#include <iomanip>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iterator>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <sstream>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <numeric>\n#include <vector>\nusing namespace std;\n\nconst long long MOD = 998244353;\n\nlong long mod_pow(long long a, long long n, long long mod)\n{\n long long left = n;\n long long ans = 1;\n long long ks = a;\n while (left != 0)\n {\n if (left % 2 == 1)\n ans = ans * ks % mod;\n ks = ks * ks % mod;\n left >>= 1;\n }\n return ans;\n}\n\nstring rem_zero(string a){\n int position = 0;\n while (a[position]=='0'){\n position++;\n }\n return a.substr(position, a.size());\n}\n\nstring str_max(string a, string b){\n if (a==\"\"){\n return b;\n } else if (b==\"\"){\n return a;\n } else if (a==b){\n return a;\n }\n\n\n if (a.size()<b.size()){\n return b;\n } else if (b.size()<a.size()){\n return a;\n }\n\n for (int i =0;i<a.size();i++){\n if (a[i]==b[i]){\n continue;\n }else if (a[i]<b[i]){\n return b;\n } else{\n return a;\n }\n }\n \n return a;\n}\n\nstring solve(int w,int h){\n vector<string> c(h);\n for (int i=0;i<h;i++){\n cin >> c[i];\n }\n string ans = \"0\";\n vector<vector<string>> dp(h, vector<string>(w, \"\"));\n for (int i = 0;i<h;i++){\n for (int j = 0;j<w;j++){\n if (isdigit(c[i][j])){\n string m_num = \"\";\n if (0<=i-1){\n m_num = str_max(rem_zero(m_num), rem_zero(dp[i-1][j]));\n }\n if (0<=j-1){\n m_num = str_max(rem_zero(m_num), rem_zero(dp[i][j-1]));\n }\n dp[i][j] = m_num+c[i][j];\n ans = str_max(ans, dp[i][j]);\n }\n }\n }\n return ans;\n}\n\n\n\nint main()\n{\n int w, h;\n cin >> w>>h;\n vector<string> result;\n while (w!=0 && h!=0){\n result.push_back(solve(w, h));\n cin >> w>>h;\n }\n for (auto i:result){\n cout<<rem_zero(i)<<endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3388,
"score_of_the_acc": -0.1689,
"final_rank": 8
},
{
"submission_id": "aoj_1126_5875518",
"code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\n\nusing namespace std;\n//using namespace atcoder;\n\n// エイリアス\nusing ll = long signed long;\nusing ull = long unsigned long;\nusing ld = long double;\nusing P = pair<int, int>;\nusing llP = pair<ll, ll>;\nusing DoP = pair<double, double>;\n//using UnionFind = dsu;\n//using mint = modint1000000007;\n//using mint = modint998244353;\n\n// 汎用マクロ\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define rep(i, n) for (int i = 0; i < n; ++i)\n#define FOREACH(i,q) for (auto &i : q)\n#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)\n#define SZ(x) ((int)(x).size())\n#define Yes(x) (x?\"Yes\":\"No\")\ntemplate <class T>inline bool chmin(T &a, const T b) {if (a > b) { a = b; return true;} return false;}\ntemplate <class T>inline bool chmax(T &a, const T b) {if (a < b) { a = b; return true;} return false;}\ntemplate <class T>inline void line_out(const vector<T> vec) {int n = SZ(vec); rep(i, n) { cout << vec[i]; if(i < n-1) cout << \" \";}cout << endl;}\nconst int di[] = {0, 1, 0, -1, 1, 1, -1, -1};\nconst int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};\nconst int INF = 1 << 28;\nconst ll INF64 = 1ll << 55;\nconst int mod = 1000000007;\n//const int mod = 998244353;\n\n\nint main()\n{\n auto comp = [&](string x, string y) {\n if(x.size() != y.size()) return x.size() < y.size();\n else return x < y;\n };\n auto is_num = [&](char c) {\n if('0' <= c && c <= '9') return true;\n else return false;\n };\n\n while(true) {\n int w, h;\n cin >> w >> h;\n if(w == 0 && h == 0) break;\n\n vector<string> c(h);\n rep(i, h) cin >> c[i];\n\n vector<vector<string>> dp(h+5, vector<string>(w+5, \"\"));\n rep(i, h) rep(j, w) if(is_num(c[i][j])) dp[i][j] = c[i][j];\n\n for(int i = h-1; i >= 0; --i) {\n for(int j = w-1; j >= 0; --j) {\n if(!is_num(c[i][j])) continue;\n\n vector<string> add;\n add.push_back(dp[i+1][j]);\n add.push_back(dp[i][j+1]);\n\n sort(RALL(add), comp);\n dp[i][j] += add.front();\n }\n }\n string ans = \"\";\n rep(i, h) rep(j, w) {\n reverse(ALL(dp[i][j]));\n while(dp[i][j].back() == '0' && dp[i][j].size() > 0) dp[i][j].pop_back();\n reverse(ALL(dp[i][j]));\n\n if(comp(ans, dp[i][j])) ans = dp[i][j]; \n }\n\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3188,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_1126_5867708",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nstruct Solver{\n const int w, h;\n vector<vector<string>> dp;\n vector<string> c;\n Solver(int w, int h): w(w), h(h), c(vector<string>(h)),\n dp(vector<vector<string>>(h, vector<string>(w, \"\"))){\n for(auto &p: c) cin >> p;\n }\n\n bool less(const string &a, const string &b){\n if(a.length() != b.length()) return a.length() < b.length();\n else{\n for(int i = 0; i < a.length(); i++){\n if(a[i] != b[i]) return a[i] < b[i];\n }\n }\n return false;\n }\n\n void solve(){\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n if(!isdigit(c[i][j])) continue;\n if(c[i][j] != '0') dp[i][j] = to_string(c[i][j]-'0');\n if(i-1 >= 0){\n string nex = dp[i-1][j]+c[i][j];\n if(nex.length() > 0 && nex[0] != '0'\n && less(dp[i][j], nex)){\n dp[i][j] = nex;\n }\n }\n if(j-1 >= 0){\n string nex = dp[i][j-1]+c[i][j];\n if(nex.length() > 0 && nex[0] != '0'\n && less(dp[i][j], nex)){\n dp[i][j] = nex;\n }\n }\n }\n }\n\n string ans = \"\";\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n if(less(ans, dp[i][j])) ans = dp[i][j];\n }\n }\n\n cout << ans << '\\n';\n }\n};\n\nint main(){\n while(true){\n int w, h;\n cin >> w >> h;\n if(!w && !h) break;\n Solver sol(w, h);\n sol.solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3356,
"score_of_the_acc": -0.1419,
"final_rank": 6
},
{
"submission_id": "aoj_1126_5684884",
"code_snippet": "#ifdef LOCAL\n#define _GLIBCXX_DEBUG\n#endif\n \n#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\n \n#pragma region Macros\n// rep macro\n#define foa(v, a) for(auto &v : a)\n#define REPname(a, b, c, d, e, ...) e\n#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int i = 0; i < (x); ++i)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n#define REPSname(a, b, c, ...) c\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\n#define RREPname(a, b, c, d, e, ...) e\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define RREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\n#define RREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\n#define RREPSname(a, b, c, ...) c\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\n \n// name macro\n#define fi first\n#define se second\n#define pb push_back\n#define eb emplace_back\n#define SZ(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define popcnt(x) __builtin_popcountll(x)\ntemplate <class T = int>\nusing V = std::vector<T>;\ntemplate <class T = int>\nusing VV = std::vector<std::vector<T>>;\ntemplate <class T = int>\nusing VVV = std::vector<std::vector<std::vector<T>>>;\ntemplate <class T>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\nusing ll = long long;\nusing ld = long double;\nusing int128 = __int128_t;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\nusing Tp = tuple<ll,ll,ll>;\n \n// input macro\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n\tfor(T &i : v) is >> i;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\n\tstd::string s;\n\tis >> s;\n\t__int128_t ret = 0;\n\tfor(int i = 0; i < s.length(); i++)\n\t\tif('0' <= s[i] and s[i] <= '9')\n\t\t\tret = 10 * ret + s[i] - '0';\n\ta = ret * (s[0] == '-' ? -1 : 1);\n\treturn is;\n}\nnamespace scanner {\nvoid scan(int &a) { std::cin >> a; }\nvoid scan(long long &a) { std::cin >> a; }\nvoid scan(std::string &a) { std::cin >> a; }\nvoid scan(char &a) { std::cin >> a; }\nvoid scan(char a[]) { std::scanf(\"%s\", a); }\nvoid scan(double &a) { std::cin >> a; }\nvoid scan(long double &a) { std::cin >> a; }\ntemplate <class T, class U>\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\ntemplate <class T>\nvoid scan(std::vector<T> &a) { std::cin >> a; }\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n#define VEC(type, name, size) \\\n\tstd::vector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstd::string __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n \n// output-macro\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\n\tfor(int i = 0; i < int(a.size()); ++i) {\n\t\tif(i) os << \" \";\n\t\tos << a[i];\n\t}\n\treturn os;\n}\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\n\tstd::ostream::sentry s(dest);\n\tif(s) {\n\t\t__uint128_t tmp = value < 0 ? -value : value;\n\t\tchar buffer[128];\n\t\tchar *d = std::end(buffer);\n\t\tdo {\n\t\t\t--d;\n\t\t\t*d = \"0123456789\"[tmp % 10];\n\t\t\ttmp /= 10;\n\t\t} while(tmp != 0);\n\t\tif(value < 0) {\n\t\t\t--d;\n\t\t\t*d = '-';\n\t\t}\n\t\tint len = std::end(buffer) - d;\n\t\tif(dest.rdbuf()->sputn(d, len) != len) {\n\t\t\tdest.setstate(std::ios_base::badbit);\n\t\t}\n\t}\n\treturn dest;\n}\ntemplate <class T>\nvoid print(const T a) { std::cout << a << '\\n'; }\ntemplate <class Head, class... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << ' ';\n\tprint(T...);\n}\ntemplate <class T>\nvoid printel(const T a) { std::cout << a << '\\n'; }\ntemplate <class T>\nvoid printel(const std::vector<T> &a) {\n\tfor(const auto &v : a)\n\t\tstd::cout << v << '\\n';\n}\ntemplate <class Head, class... Tail>\nvoid printel(Head H, Tail... T) {\n\tstd::cout << H << '\\n';\n\tprintel(T...);\n}\nvoid Yes(const bool b = true) { std::cout << (b ? \"Yes\\n\" : \"No\\n\"); }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(const bool b = true) { std::cout << (b ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO() { std::cout << \"No\\n\"; }\nvoid err(const bool b = true) {\n\tif(b) {\n\t\tstd::cout << \"-1\\n\", exit(0);\n\t}\n}\n \n//debug macro\nnamespace debugger {\ntemplate <class T>\nvoid view(const std::vector<T> &a) {\n\tstd::cerr << \"{ \";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << v << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\ntemplate <class T>\nvoid view(const std::vector<std::vector<T>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::vector<std::pair<T, U>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : a) std::cerr << \"\\t(\" << p.first << \", \" << p.second << \")\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : m) std::cerr << \"\\t[\" << p.first << \"] : \" << p.second << \"\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::pair<T, U> &p) { std::cerr << \"(\" << p.first << \", \" << p.second << \")\"; }\ntemplate <class T>\nvoid view(const std::set<T> &s) {\n\tstd::cerr << \"{ \";\n\tfor(auto &v : s) {\n\t\tview(v);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n \ntemplate <class T>\nvoid view(const T &e) { std::cerr << e; }\n} // namespace debugger\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tdebugger::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(false)\n#else\n#define debug(...) (void(0))\n#endif\n \n// vector macro\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nvoid UNIQUE(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<T> press(std::vector<T> &a) {\n\tauto res = a;\n\tUNIQUE(res);\n\tfor(auto &v : a)\n\t\tv = lb(res, v);\n\treturn res;\n}\n#define SORTname(a, b, c, ...) c\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\n#define SORT0(a) std::sort((a).begin(), (a).end())\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\ntemplate <class T>\nvoid ADD(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v += x;\n}\ntemplate <class T>\nvoid SUB(std::vector<T> &a, const T x = 1) {\n\tfor(auto &v : a) v -= x;\n}\ntemplate <class T>\nvoid MUL(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v *= x;\n}\ntemplate <class T>\nvoid DIV(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v /= x;\n}\n \n// math macro\ntemplate <class T, class U>\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\ntemplate <class T, class U>\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\ntemplate <class T>\nT divup(T x, T y) { return (x + y - 1) / y; }\ntemplate <class T>\nT POW(T a, long long n) {\n\tT ret = 1;\n\twhile(n) {\n\t\tif(n & 1) ret *= a;\n\t\ta *= a;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n\ntemplate<typename T>\nT ADD(T a, T b){\n\tT res;\n\treturn __builtin_add_overflow(a, b, &res) ? numeric_limits<T>::max() : res;\n}\n\ntemplate<typename T>\nT MUL(T a, T b){\n\tT res;\n\treturn __builtin_mul_overflow(a, b, &res) ? numeric_limits<T>::max() : res;\n}\n\n// modpow\nlong long POW(long long a, long long n, const int mod) {\n\tlong long ret = 1;\n\twhile(n) {\n\t\tif(n & 1) (ret *= a) %= mod;\n\t\t(a *= a) %= mod;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n \n// others\nstruct fast_io {\n\tfast_io() {\n\t\tios::sync_with_stdio(false);\n\t\tcin.tie(nullptr);\n\t\tcout << fixed << setprecision(15);\n\t}\n} fast_io_;\n\n#pragma endregion\n\nusing R = long double;\nconstexpr R EPS=1E-11;\n\n// r の(誤差付きの)符号に従って, -1, 0, 1 を返す.\nint sgn(const R& r){ return (r > EPS) - (r < -EPS); }\n// a, b の(誤差付きの)大小比較の結果に従って, -1, 0, 1 を返す.\nint sgn(const R& a, const R &b){ return sgn(a-b); }\n// a > 0 は sgn(a) > 0\n// a < b は sgn(a, b) < 0\n// a >= b は sgn(a, b) >= 0\n// のように書く.\n// return s * 10^n\n\n//https://atcoder.jp/contests/abc191/submissions/20028529\nlong long x10(const string& s, size_t n) {\n if (s.front() == '-') return -x10(s.substr(1), n);\n auto pos = s.find('.');\n if (pos == string::npos) return stoll(s + string(n, '0'));\n return stoll(s.substr(0, pos) + s.substr(pos + 1) + string(n + pos + 1 - s.size(), '0'));\n}\n \nlong long ceildiv(long long a, long long b) {\n if (b < 0) a = -a, b = -b;\n if (a >= 0) return (a + b - 1) / b;\n else return a / b;\n}\n \nlong long floordiv(long long a, long long b) {\n if (b < 0) a = -a, b = -b;\n if (a >= 0) return a / b;\n else return (a - b + 1) / b;\n}\n \nlong long floorsqrt(long long x) {\n assert(x >= 0);\n long long ok = 0;\n long long ng = 1;\n while (ng * ng <= x) ng <<= 1;\n while (ng - ok > 1) {\n long long mid = (ng + ok) >> 1;\n if (mid * mid <= x) ok = mid;\n else ng = mid;\n }\n return ok;\n}\n\ninline int topbit(unsigned long long x){\n\treturn x?63-__builtin_clzll(x):-1;\n}\n\ninline int popcount(unsigned long long x){\n\treturn __builtin_popcountll(x);\n}\n\ninline int parity(unsigned long long x){//popcount%2\n\treturn __builtin_parity(x);\n}\n\nconst int inf = 1e9;\nconst ll INF = 1e18;\n\nstring chmax(string a,string b){\n ll n = a.length();\n ll m = b.length();\n if(n > m) return a;\n else if(n < m)return b;\n else{\n REP(i,n){\n ll A = a[i] - '0';\n ll B = b[i] - '0';\n if(A > B){\n return a;\n }\n if(B > A){\n return b;\n }\n }\n return a;\n }\n}\n\nvoid main_() {\n ll W,H;\n cin >> W >> H;\n while(W != 0){\n VVEC(char,C,H,W);\n VV<string> dp(H,V<string>(W));\n REP(i,H){\n REP(j,W){\n ll num = C[i][j] - '0';\n if(0 <= num && num <= 9){\n dp[i][j] += C[i][j];\n if(i > 0){\n \n if(dp[i-1][j] != \"0\")dp[i][j] = chmax(dp[i][j],dp[i-1][j] + C[i][j]);\n }\n if(j > 0){\n \n if(dp[i][j-1] != \"0\") dp[i][j] = chmax(dp[i][j],dp[i][j-1] + C[i][j]);\n }\n }\n }\n }\n string ans = \"\";\n REP(i,H){\n REP(j,W){\n ans = chmax(ans,dp[i][j]);\n }\n }\n cout << ans << endl;\n cin >> W >> H;\n }\n}\n \nint main() {\n\tint t = 1;\n\t\n\t//cin >> t;\n\twhile(t--) main_();\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3528,
"score_of_the_acc": -0.2872,
"final_rank": 14
},
{
"submission_id": "aoj_1126_5549162",
"code_snippet": "#include <cmath>\n#include <deque>\n#include <algorithm>\n#include <iterator>\n#include <list>\n#include <tuple>\n#include <map>\n#include <unordered_map>\n#include <queue>\n#include <set>\n#include <unordered_set>\n#include <stack>\n#include <string>\n#include <vector>\n#include <fstream>\n#include <iostream>\n#include <functional>\n#include <numeric>\n#include <iomanip> \n#include <stdio.h>\n//eolibraries\n#define lnf 3999999999999999999\n#define inf 999999999\n#define PI 3.14159265359\n#define endl \"\\n\"\n#define fi first\n#define se second\n#define pb push_back\n#define eb emplace_back\n#define ll long long\n#define all(c) (c).begin(),(c).end()\n#define sz(c) (int)(c).size()\n#define mkp(a,b) make_pair(a,b)\n#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())\n#define rsz(a,n) a.resize(n)\n#define pii pair <int,int>\n#define rep(i,n) for(int i = 0 ; i < n ; i++) \n#define drep(i,n) for(int i = n-1 ; i >= 0 ; i--)\n#define crep(i,x,n) for(int i = x ; i < n ; i++)\n#define vi vector <int> \n#define vec(...) vector<__VA_ARGS__>\n#define rsz(a,n) a.resize(n)\n#define rszv(a,n,v) a.resize(n,v)\n#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);\n//eodefine\nusing namespace std;\n \nconst int max_n = 200;\n\nchar a[max_n][max_n];\n\nbool isdigit(char ch) {\n\treturn ch>='0' and ch<='9';\n}\n\nbool isok(int x,int y,int n,int m) {\n\tif(x>=m or y>=n) return 0;\n\treturn isdigit(a[x][y]);\n}\n\nstring comp(string a,string b) {\n\tif(sz(a)!=sz(b)){\n\t\tif(sz(a)>sz(b)) return a;\n\t\treturn b;\n\t}\n\trep(i,sz(a)) {\n\t\tif(a[i]>b[i]) return a;\n\t\tif(b[i]>a[i]) return b;\n\t}\n\treturn b;\n}\n\nmap <pii,string> memo;\n\nstring dfs(int x,int y,int n,int m) {\n\tif(memo.find({x,y})!=memo.end()) return memo[{x,y}];\n\tstring s1=\"\",s2=\"\";\n\ts1+=a[x][y];s2+=a[x][y];\n\tif(isok(x+1,y,n,m)) s1=s1+dfs(x+1,y,n,m);\n\tif(isok(x,y+1,n,m)) s2=s2+dfs(x,y+1,n,m);\n\treturn memo[{x,y}]=comp(s1,s2);\n}\n\nvoid slv(int n,int m) {\n\trep(i,100) {\n\t\trep(j,100) a[i][j]='A';\n\t}\n\tmemo.clear();\n\trep(i,m) {\n\t\tstring s;\n\t\tcin>>s;\n\t\trep(j,n) a[i][j]=s[j];\n\t}\n\tstring ans=\"\";\n\trep(i,m) {\n\t\trep(j,n) {\n\t\t\tif(a[i][j]>'0' and isdigit(a[i][j])) { \n\t\t\t\tans=comp(ans,dfs(i,j,n,m));\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<\"\\n\";\n}\n\nint main(){\nfcin;\n\twhile(true) {\n\t\tint n,m;\n\t\tcin>>n>>m;\n\t\tif(!n and !m)break;\n\t\tslv(n,m);\n\t}\n/*\n*/\n \n return 0; \n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3568,
"score_of_the_acc": -0.3554,
"final_rank": 16
},
{
"submission_id": "aoj_1126_5531252",
"code_snippet": "#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\n\n// Global\nint n, m;\nchar mz[75][75];\nbool f[75][75];\nstring dp[75][75];\nstring res;\nset<pair<int, int>> cur;\n\nstring dfs(int i, int j) {\n cur.erase({i, j});\n if ((i == n || j == m) || mz[i][j] == '.')\n return \"\";\n string mx1, mx2;\n mx1 += mz[i][j];\n mx2 += mz[i][j];\n if (f[i][j])\n return dp[i][j];\n f[i][j] = true;\n mx1 += dfs(i + 1, j);\n mx2 += dfs(i, j + 1);\n if (mx1.length() > mx2.length() || (mx1.length() == mx2.length() and mx1 > mx2))\n return dp[i][j] = mx1;\n return dp[i][j] = mx2;\n}\n\nvoid solve() {\n cur.clear();\n res.clear();\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) {\n f[i][j] = false;\n cin >> mz[i][j];\n if (mz[i][j] < '0' || mz[i][j] > '9')\n mz[i][j] = '.';\n if (mz[i][j] > '0' and mz[i][j] <= '9') {\n cur.insert({i, j});\n }\n }\n }\n while (!cur.empty()) {\n int i = cur.begin()->first, j = cur.begin()->second;\n string now = dfs(i, j);\n if (now.length() > res.length() || (res.length() == now.length() and now > res))\n res = now;\n }\n cout << res << '\\n';\n}\n\nint32_t main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout.tie(nullptr);\n while (true) {\n cin >> m >> n;\n if (!n)\n break;\n solve();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3800,
"score_of_the_acc": -0.5169,
"final_rank": 19
},
{
"submission_id": "aoj_1126_5288307",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint W, H;\nvector<string> C;\nvector<vector<string>> memo;\nvector<vector<bool>> seen;\n\nstring comp(string S, string T) {\n return S.size() == T.size() ? max(S, T) : (S.size() > T.size() ? S : T);\n}\nstring del0(string S) {\n string ret;\n bool flag = false;\n for (auto& c : S) {\n if (flag || c != '0') {\n flag = true;\n ret += c;\n }\n }\n return ret;\n}\nstring f(int h, int w) {\n if (seen[h][w])\n return memo[h][w];\n seen[h][w] = true;\n auto& ret = memo[h][w];\n ret = C[h][w];\n const int dx[2] = {0, 1}, dy[2] = {1, 0};\n for (int i = 0; i < 2; i++) {\n int nxt_h = h + dx[i], nxt_w = w + dy[i];\n if (nxt_h == H || nxt_w == W)\n continue;\n if (isdigit(C[nxt_h][nxt_w])) {\n ret = comp(ret, C[h][w] + f(nxt_h, nxt_w));\n }\n }\n return ret;\n}\n\nint main() {\n while (cin >> W >> H, W) {\n C.resize(H);\n for (int i = 0; i < H; i++) {\n cin >> C[i];\n }\n\n seen.assign(H, vector(W, false));\n memo.assign(H, vector<string>(W));\n\n string ans = \"0\";\n for (int h = 0; h < H; h++) {\n for (int w = 0; w < W; w++) {\n if (isdigit(C[h][w]))\n ans = comp(ans, del0(f(h, w)));\n }\n }\n\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3492,
"score_of_the_acc": -0.2568,
"final_rank": 10
},
{
"submission_id": "aoj_1126_5287242",
"code_snippet": "/* C++ */\n#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef long double ld;\ntypedef vector<ll> vl;\ntypedef vector<vector<ll>> vvl;\ntypedef vector<vector<vector<ll>>> vvvl;\ntypedef pair<ll, ll> pint;\nconst ll MOD = 1000000007;\nconst ll INF = 922337203685477580;\n#define rep(i, n) for(ll i = (ll)0; i < (ll)(n); i++)\n#define Rep(i, s, t) for(ll i = (ll)(s); i < (ll)(t); i++)\n#define ALL(a) (a).begin(),(a).end()\n#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);\n#define PI 3.14159265358979323846\n#define ifYN(x) cout << (x ? \"Yes\" : \"No\") << \"\\n\"\nll dx[4] = {-1, 1, 0, 0};\nll dy[4] = {0, 0, -1, 1};\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}\n\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\nll Len(ll n) {\n if (n == 0) return 1;\n ll s = 0;\n while (n != 0) s++, n /= 10;\n return s;\n}\n\nll Sint(ll n) {\n ll ans = 0;\n while (n != 0) ans += n % 10, n /= 10;\n return ans;\n}\n\nll Svec(vector<ll> v){\n ll n = 0;\n rep(i, (ll)v.size()) n += v[i];\n return n;\n}\n\nll GCD(ll a, ll b) {\n return b ? GCD(b, a % b) : a;\n}\n\nll LCM(ll a, ll b){\n return a / GCD(a, b) * b;\n}\n\nll POW(ll a, ll n, ll mod = INF) {\n ll res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % mod;\n a = a * a % mod;\n n >>= 1;\n }\n return res;\n}\n\nvoid dis(vector<ll> V) {\n rep(i, V.size()) cout << (i ? \" \" : \"\") << V[i];\n cout << endl;\n}\n\nvoid dis2(vector<vector<ll> > v) {\n rep (i, v.size()) {\n rep (j, v[0].size()) cout << v[i][j] << ' ';\n cout << endl;\n }\n}\n\nbool cmp(pint a, pint b) { return a.second < b.second; }\n\nstring strcmp(string S, string T) {\n if (S.size() > T.size()) {\n return S;\n } else if (S.size() < T.size()) {\n return T;\n } else {\n rep (i, S.size()) {\n if (S[i] > T[i]) {\n return S;\n } else if (S[i] < T[i]) {\n return T;\n }\n }\n return S;\n }\n}\n\n\nvoid solve(ll W, ll H) {\n vector<string> V(H);\n vector<vector<string>> memo(H, vector<string>(W, \"\"));\n rep (i, H) cin >> V[i];\n rep (i, H) rep (j, W) {\n if ('0' <= V[i][j] && V[i][j] <= '9') memo[i][j] = V[i][j];\n }\n rep (i, H) {\n rep (j, W) {\n if (!('0' <= V[i][j] && V[i][j] <= '9')) continue;\n if (memo[i][j] == \"0\") continue;\n if (j + 1 < W && '0' <= V[i][j + 1] && V[i][j + 1] <= '9') memo[i][j + 1] = strcmp(memo[i][j] + V[i][j + 1], memo[i][j + 1]);\n if (i + 1 < H && '0' <= V[i + 1][j] && V[i + 1][j] <= '9') memo[i + 1][j] = strcmp(memo[i][j] + V[i + 1][j], memo[i + 1][j]);\n }\n }\n string ans = \"0\";\n rep (i, H) {\n rep (j, W) {\n ans = strcmp(ans, memo[i][j]);\n }\n }\n cout << ans << endl;\n}\n\n/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/\nint main() {\n IOS;\n while (1) {\n ll W, H; cin >> W >> H;\n if (W == 0 && H == 0) break;\n solve(W, H);\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3284,
"score_of_the_acc": -0.0811,
"final_rank": 2
}
] |
aoj_1122_cpp
|
What is the Number in my Mind ?
Let us enjoy a number guess game.
A number containing L digits is in my mind (where 4 <= L <= 10). You
should guess what number it is. It is composed of any of the following ten
digits:
"0","1","2","3","4","5","6","7","8", and "9".
No digits appear twice in the number. For example, when L = 4, "1234" is a
legitimate candidate but "1123" is not (since "1" appears twice).
The number may begin with "0", and a number "05678" should be distinct from a
number "5678", for example.
If you and your computer cannot see through my mind by telepathy, a group of
hints
will be needed in order for you to identify the number in my mind.
A
hint
is a triple of numbers named
try
,
hit
, and
blow
.
The
try
is a number containing L decimal digits. No digits appear
twice in the
try
, and this number may also begin with "0".
The
hit
value indicates the count of digits that the
try
and
the number in my mind have in common, and that are exactly in the same position.
The
blow
value indicates the count of digits that the
try
and
the number in my mind have in common, but that are NOT in the same position.
They are arranged in one line as follows.
try hit blow
For example, if L = 4 and the number in my mind is
9876
, then the
following is an example of hint-set consisting of legitimate hints.
7360 0 2
2507 0 1
9713 1 1
9678 2 2
The above hint-set should be sufficient for you to guess the number and
the answer should be
9876
.
In contrast, the following hint-set is not sufficient to guess the
number.
7360 0 2
9713 1 1
9678 2 2
No number is consistent with the following hint-set.
9678 2 2
1234 2 2
Answers for last two hint-sets should be
NO
.
Your job is to write a program identifying the numbers in my mind using given
hint-sets.
Input
The input consists of multiple hint-sets as follows. Each of them corresponds
to a number in my mind.
< HINT-SET
1
>
< HINT-SET
2
>
. . .
< HINT-SET
i
>
. . .
< HINT-SET
n
>
A
<HINT-SET
i
>
is composed of one header line in the
following format (
L
and
H
should be separated by a single space
character.):
L
H
and
H
lines of hints in the following format (1 <= j <=
H
) :
TRY
1
HIT
1
BLOW
1
TRY
2
HIT
2
BLOW
2
. . .
TRY
j
HIT
j
BLOW
j
. . .
TRY
H
HIT
H
BLOW
H
L
indicates the number of digits of the number in my mind and
TRY
j
.
HIT
j
and
BLOW
j
indicate hit and blow values between the
TRY
j
and the number
in my mind. (They are separated by a single space character.)
The end of the input is indicated by a header line with
L
= 0 and
H
= 0.
Output
For each hint-set, the answer should be printed, each in a separate line. If
you can successfully identify the number for a given hint-set, the answer should
be the number. If you cannot identify the number, the answer should be
NO
.
Sample Input
6 4
160348 0 4
913286 2 3
431289 3 1
671283 3 3
10 8
3827690415 2 8
0482691573 1 9
1924730586 3 7
1378490256 1 9
6297830541 1 9
4829531706 3 7
4621570983 1 9
9820147536 6 4
4 4
2713 0 3
1247 2 0
1230 1 1
1387 2 1
6
...(truncated)
|
[
{
"submission_id": "aoj_1122_9632354",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) for(ll i=0;i<n;i++)\n#define ALL(A) A.begin(),A.end()\nint main(){\n while(1){\n ll N,M;cin>>N>>M;\n if(!N)return 0;\n vector<string>S(M);\n vi H(M),B(M);\n REP(i,M)cin>>S[i]>>H[i]>>B[i];\n vi T(M);\n REP(i,M)REP(j,N)T[i]+=1<<(S[i][j]-'0');\n vector<ll>K;\n REP(i,1<<10)if(__builtin_popcount(i)==N){\n bool ok=1;\n REP(j,M)if(__builtin_popcount(T[j]&i)!=B[j]+H[j]){ok=0;break;}\n if(ok)K.emplace_back(i);\n }\n string ans=\"NO\";\n for(auto b:K){\n string s;\n REP(i,10)if((b>>i)%2)s+='0'+i;\n do{\n bool ok=1;\n REP(i,M){\n ll h=0;\n REP(j,N)if(S[i][j]==s[j])h++;\n if(h!=H[i]){ok=0;break;}\n }\n if(ok){\n if(ans==\"NO\")ans=s;\n else{ans=\"YES\";break;}\n }\n }while(next_permutation(ALL(s)));\n if(ans==\"YES\"){ans=\"NO\";break;}\n }\n cout<<ans<<endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 920,
"memory_kb": 3360,
"score_of_the_acc": -0.2294,
"final_rank": 3
},
{
"submission_id": "aoj_1122_4779477",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\npair<int,int> calc(string &s, string &t){\n int n = s.length();\n int hit = 0;\n int snum[10]={}, tnum[10]={};\n for(int i=0; i<n; i++){\n if(s[i] == t[i]) hit++;\n snum[s[i]-'0']++;\n tnum[t[i]-'0']++;\n }\n int blow = 0;\n for(int i=0; i<10; i++){\n if(snum[i]>0 and tnum[i]>0) blow++;\n }\n return {hit, blow-hit};\n}\n\nint main(){\n int fact[11];\n fact[1] = 1;\n for(int i=2; i<=10; i++){\n fact[i] = fact[i-1]*i;\n }\n while(1){\n int n,m;\n cin >> n >> m;\n if(n == 0) break;\n\n vector<string> tr(m);\n vector<int> hit(m), blow(m);\n for(int i=0; i<m; i++){\n cin >> tr[i] >> hit[i] >> blow[i];\n }\n\n string s = \"0123456789\";\n vector<int> use(10, 0);\n for(int i=0; i<n; i++){\n use[9-i] = 1;\n }\n int ans_num = 0;\n string ans;\n do{\n string t = \"\";\n for(int i=0; i<10; i++){\n if(use[i]) t += s[i];\n }\n bool ok = true;\n for(int i=0; i<m; i++){\n auto ret = calc(t, tr[i]);\n if(hit[i]+blow[i] != ret.first+ret.second){\n ok = false;\n }\n }\n if(!ok) continue;\n do{\n bool ok = true;\n for(int i=0; i<m; i++){\n auto ret = calc(t, tr[i]);\n if(hit[i] != ret.first or blow[i] != ret.second){\n ok = false;\n break;\n }\n }\n if(ok){\n ans_num++;\n ans = t;\n }\n if(ans_num > 1) break;\n }while(next_permutation(t.begin(), t.end()));\n if(ans_num > 1) break;\n }while(next_permutation(use.begin(), use.end()));\n if(ans_num == 1){\n cout << ans << endl;\n }else{\n cout << \"NO\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 5680,
"memory_kb": 3188,
"score_of_the_acc": -0.8365,
"final_rank": 15
},
{
"submission_id": "aoj_1122_4779465",
"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\npair<int,int> calc(string &s, string &t){\n int n = s.length();\n int hit = 0;\n int snum[10]={}, tnum[10]={};\n for(int i=0; i<n; i++){\n if(s[i] == t[i]) hit++;\n snum[s[i]-'0']++;\n tnum[t[i]-'0']++;\n }\n int blow = 0;\n for(int i=0; i<10; i++){\n if(snum[i]>0 and tnum[i]>0) blow++;\n }\n return {hit, blow-hit};\n}\nint calc_hitblow(string &s, string &t){\n int n = s.length();\n int snum[10]={}, tnum[10]={};\n for(int i=0; i<n; i++){\n snum[s[i]-'0']++;\n tnum[t[i]-'0']++;\n }\n int res = 0;\n for(int i=0; i<10; i++){\n if(snum[i]>0 and tnum[i]>0) res++;\n }\n return res;\n}\n\nint main(){\n int fact[11];\n fact[1] = 1;\n for(int i=2; i<=10; i++){\n fact[i] = fact[i-1]*i;\n }\n while(1){\n int n,m;\n cin >> n >> m;\n if(n == 0) break;\n\n vector<string> tr(m);\n vector<int> hit(m), blow(m);\n for(int i=0; i<m; i++){\n cin >> tr[i] >> hit[i] >> blow[i];\n }\n\n string s = \"0123456789\";\n vector<int> use(10, 0);\n for(int i=0; i<n; i++){\n use[9-i] = 1;\n }\n int ans_num = 0;\n string ans;\n do{\n string t = \"\";\n for(int i=0; i<10; i++){\n if(use[i]) t += s[i];\n }\n bool ok = true;\n for(int i=0; i<m; i++){\n if(calc_hitblow(t, tr[i]) != hit[i]+blow[i]){\n ok = false;\n }\n }\n if(!ok) continue;\n do{\n bool ok = true;\n for(int i=0; i<m; i++){\n auto ret = calc(t, tr[i]);\n if(hit[i] != ret.first or blow[i] != ret.second){\n ok = false;\n break;\n }\n }\n if(ok){\n ans_num++;\n ans = t;\n }\n if(ans_num > 1) break;\n }while(next_permutation(t.begin(), t.end()));\n }while(next_permutation(use.begin(), use.end()));\n if(ans_num == 1){\n cout << ans << endl;\n }else{\n cout << \"NO\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 5200,
"memory_kb": 3200,
"score_of_the_acc": -0.7749,
"final_rank": 14
},
{
"submission_id": "aoj_1122_4014679",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nint main(){\n vector<vector<int>> sub;\n for(int i = 1; i < 1<<10; i++){\n vector<int> x;\n for(int j = 0; j < 10; j++) if((i>>j)&1) x.push_back(j);\n sub.push_back(x);\n }\n\n int n, m;\n while(cin >> n >> m, n){\n vector<string> a(m);\n vector<int> b(m), c(m);\n for(int i = 0; i < m; i++) cin >> a[i] >> b[i] >> c[i];\n vector<vector<bool>> origin(m, vector<bool>(10,0));\n for(int i = 0; i < m; i++){\n for(char c : a[i]) origin[i][c-'0'] = true;\n }\n bool no = false;\n vector<string> ans;\n for(vector<int> x : sub){\n if(x.size() != n) continue;\n do{\n bool valid = true;\n for(int j = 0; valid && j < m; j++){\n int blow = 0, hit = 0;\n for(int k = 0; k < n; k++){\n hit += a[j][k]-'0'==x[k];\n blow += origin[j][x[k]];\n }\n blow -= hit;\n valid &= b[j]==hit && c[j]==blow;\n }\n if(valid){\n if(ans.size()){\n no = true;\n break;\n }\n string tmp = \"\";\n for(int j = 0; j < n; j++) tmp += (char)('0'+x[j]);\n ans.push_back(tmp);\n }\n }while(next_permutation(x.begin(),x.end()));\n sort(x.begin(), x.end());\n if(no) break;\n }\n if(ans.size() == 0 || no) cout << \"NO\" << endl;\n else cout << ans[0] << endl;\n\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 6200,
"memory_kb": 3204,
"score_of_the_acc": -0.905,
"final_rank": 16
},
{
"submission_id": "aoj_1122_4014645",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nint main(){\n vector<vector<int>> sub;\n for(int i = 1; i < 1<<10; i++){\n vector<int> x;\n for(int j = 0; j < 10; j++) if((i>>j)&1) x.push_back(j);\n sub.push_back(x);\n }\n\n int n, m;\n while(cin >> n >> m, n){\n vector<string> a(m);\n vector<int> b(m), c(m);\n for(int i = 0; i < m; i++) cin >> a[i] >> b[i] >> c[i];\n vector<vector<bool>> origin(m, vector<bool>(10,0));\n for(int i = 0; i < m; i++){\n for(char c : a[i]) origin[i][c-'0'] = true;\n }\n bool no = false;\n vector<string> ans;\n for(vector<int> &x : sub){\n if(x.size() != n) continue;\n do{\n bool valid = true;\n for(int j = 0; valid && j < m; j++){\n int blow = 0, hit = 0;\n for(int k = 0; k < n; k++){\n hit += a[j][k]-'0'==x[k];\n blow += origin[j][x[k]];\n }\n blow -= hit;\n valid &= b[j]==hit && c[j]==blow;\n }\n if(valid){\n if(ans.size()){\n no = true;\n break;\n }\n string tmp = \"\";\n for(int j = 0; j < n; j++) tmp += (char)('0'+x[j]);\n ans.push_back(tmp);\n }\n }while(next_permutation(x.begin(),x.end()));\n sort(x.begin(), x.end());\n if(no) break;\n }\n if(ans.size() == 0 || no) cout << \"NO\" << endl;\n else cout << ans[0] << endl;\n\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 6730,
"memory_kb": 3128,
"score_of_the_acc": -0.9689,
"final_rank": 17
},
{
"submission_id": "aoj_1122_2529384",
"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\tint hit,blow;\n\tchar num[11];\n};\n\nvector<Info> info;\nint Keta,num_candidate;\nll POW[12] = {1,10,100,1000,10000,100000,1000000,10000000,100000000,1000000000,10000000000,100000000000};\nll ans;\n\nint calc_hit(char left[11],char right[11]){\n\n\tint hit = 0;\n\n\tfor(int i = 0; i < Keta; i++){\n\t\tif(left[i] == right[i])hit++;\n\t}\n\treturn hit;\n}\n\nint calc_blow(char left[11],char right[11],int right_num){\n\n\tint blow = 0;\n\n\tint check_left[10];\n\tfor(int i = 0; i < 10; i++)check_left[i] = -1;\n\tfor(int i = 0; i < Keta; i++){\n\t\tcheck_left[left[i]-'0'] = i;\n\t}\n\n\tfor(int i = 0; i < right_num;i++){\n\t\tif(check_left[right[i]-'0'] != -1 && check_left[right[i]-'0'] != i)blow++;\n\t}\n\treturn blow;\n}\n\n\n\nvoid recursive(char buf[11],bool used[10],int count){\n\tif(num_candidate > 1)return;\n\n\tbool FLG;\n\n\tif(count == Keta){\n\n\t\tFLG = true;\n\t\tfor(int i = 0; i < info.size(); i++){\n\t\t\tif(calc_blow(info[i].num,buf,count) != info[i].blow || calc_hit(info[i].num,buf) != info[i].hit){\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(FLG){\n\t\t\tnum_candidate++;\n\t\t\tif(num_candidate >= 2){\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tans = 0;\n\t\t\tfor(int i = 0; i < count; i++){\n\t\t\t\tans = 10*ans + buf[i] - '0';\n\t\t\t}\n\t\t}\n\n\t\treturn;\n\t}\n\n\tFLG = true;\n\tint blow;\n\tfor(int i = 0; i < info.size(); i++){\n\t\tif((blow = calc_blow(info[i].num,buf,count)) > info[i].blow || blow+(Keta-count) < info[i].blow){\n\t\t\tFLG = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(!FLG)return;\n\n\tfor(int i = 0; i < 10; i++){\n\t\tif(!used[i]){\n\t\t\tchar next_buf[11];\n\t\t\tbool next_used[10];\n\t\t\tfor(int k = 0; k < Keta; k++)next_buf[k] = buf[k];\n\t\t\tnext_buf[count] = '0' + i;\n\t\t\tfor(int k = 0; k < 10; k++)next_used[k] = used[k];\n\t\t\tnext_used[i] = true;\n\t\t\trecursive(next_buf,next_used,count+1);\n\t\t}\n\t}\n}\n\nvoid func(int H){\n\n\tinfo.clear();\n\n\tnum_candidate = 0;\n\n\tfor(int loop = 0; loop < H; loop++){\n\t\tInfo data;\n\t\tscanf(\"%s %d %d\",data.num,&data.hit,&data.blow);\n\t\tinfo.push_back(data);\n\t}\n\n\tchar buf[11];\n\tbool used[10];\n\tfor(int i = 0; i < 10; i++)used[i] = false;\n\trecursive(buf,used,0);\n\n\tif(num_candidate == 1){\n\t\tll tmp = POW[Keta-1];\n\t\tif(tmp > ans){\n\t\t\tprintf(\"0\");\n\t\t}\n\t\tprintf(\"%lld\\n\",ans);\n\t}else{\n\t\tprintf(\"NO\\n\");\n\t}\n}\n\n\nint main(){\n\n\tint H;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&Keta,&H);\n\t\tif(Keta == 0 && H == 0)break;\n\n\t\tfunc(H);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 850,
"memory_kb": 3276,
"score_of_the_acc": -0.2149,
"final_rank": 2
},
{
"submission_id": "aoj_1122_2529383",
"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\tint hit,blow;\n\tchar num[11];\n};\n\nvector<Info> info;\nint Keta,num_candidate;\nll POW[12] = {1,10,100,1000,10000,100000,1000000,10000000,100000000,1000000000,10000000000,100000000000};\nll ans;\n\nint calc_hit(char left[11],char right[11]){\n\n\tint hit = 0;\n\n\tfor(int i = 0; i < Keta; i++){\n\t\tif(left[i] == right[i])hit++;\n\t}\n\treturn hit;\n}\n\nint calc_blow(char left[11],char right[11],int right_num){\n\n\tint blow = 0;\n\n\tint check_left[10];\n\tfor(int i = 0; i < 10; i++)check_left[i] = -1;\n\tfor(int i = 0; i < Keta; i++){\n\t\tcheck_left[left[i]-'0'] = i;\n\t}\n\n\tfor(int i = 0; i < right_num;i++){\n\t\tif(check_left[right[i]-'0'] != -1 && check_left[right[i]-'0'] != i)blow++;\n\t}\n\treturn blow;\n}\n\n\n\nvoid recursive(char buf[11],bool used[10],int count){\n\tif(num_candidate > 1)return;\n\n\tbool FLG;\n\n\tif(count == Keta){\n\n\t\tFLG = true;\n\t\tfor(int i = 0; i < info.size(); i++){\n\t\t\tif(calc_blow(info[i].num,buf,count) != info[i].blow || calc_hit(info[i].num,buf) != info[i].hit){\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(FLG){\n\t\t\tnum_candidate++;\n\t\t\tif(num_candidate >= 2){\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tans = 0;\n\t\t\tfor(int i = 0; i < count; i++){\n\t\t\t\tans = 10*ans + buf[i] - '0';\n\t\t\t}\n\t\t}\n\n\t\treturn;\n\t}\n\n\t//blow???????¨????:?°?????????¨???1??¶,blow?????£?§£???????????§???????????§????????°???return\n\tFLG = true;\n\tint blow;\n\tfor(int i = 0; i < info.size(); i++){\n\t\tif((blow = calc_blow(info[i].num,buf,count)) > info[i].blow || blow+(Keta-count) < info[i].blow){\n\t\t\tFLG = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(!FLG)return;\n\n\tfor(int i = 0; i < 10; i++){\n\t\tif(!used[i]){\n\t\t\tchar next_buf[11];\n\t\t\tbool next_used[10];\n\t\t\tfor(int k = 0; k < Keta; k++)next_buf[k] = buf[k];\n\t\t\tnext_buf[count] = '0' + i;\n\t\t\tfor(int k = 0; k < 10; k++)next_used[k] = used[k];\n\t\t\tnext_used[i] = true;\n\t\t\trecursive(next_buf,next_used,count+1);\n\t\t}\n\t}\n}\n\nvoid func(int H){\n\n\tinfo.clear();\n\n\tnum_candidate = 0;\n\n\tfor(int loop = 0; loop < H; loop++){\n\t\tInfo data;\n\t\tscanf(\"%s %d %d\",data.num,&data.hit,&data.blow);\n\t\tinfo.push_back(data);\n\t}\n\n\tchar buf[11];\n\tbool used[10];\n\tfor(int i = 0; i < 10; i++)used[i] = false;\n\trecursive(buf,used,0);\n\n\tif(num_candidate == 1){\n\t\tll tmp = POW[Keta-1];\n\t\tif(tmp > ans){\n\t\t\tprintf(\"0\");\n\t\t}\n\t\tprintf(\"%lld\\n\",ans);\n\t}else{\n\t\tprintf(\"NO\\n\");\n\t}\n}\n\n\nint main(){\n\n\tint H;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&Keta,&H);\n\t\tif(Keta == 0 && H == 0)break;\n\n\t\tfunc(H);\n\t}\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 870,
"memory_kb": 3140,
"score_of_the_acc": -0.2087,
"final_rank": 1
},
{
"submission_id": "aoj_1122_1439032",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cstdlib>\n#include <bitset>\n#include <cstdio>\nusing namespace std;\ntypedef long long int lli;\nconst int MAX_H = 20;\nint L, H;\nlli nums[MAX_H];\nint s_nums[MAX_H], hit[MAX_H], blow[MAX_H];\nlli ans;\nvoid print_bits(lli n){\n for(int i = 0; i < L; ++i){\n cout << static_cast<bitset<4> >(n&15) << \".\";\n n >>= 4;\n }\n cout << endl;\n}\ninline lli conv_64(const char* s){\n lli ret = 0;\n for(int i = 0; i < L; ++i){\n ret <<= 4;\n ret += (lli)(s[i]-'0');\n }\n return ret;\n}\ninline string deco_64(lli n){\n string ret;\n for(int i = 0; i < L; ++i){\n ret += (char)((n&15)+'0');\n n >>= 4;\n }\n reverse(ret.begin(), ret.end());\n return ret;\n}\ninline int conv(const char* s){\n int ret = 0;\n for(int i = 0; i < L; ++i){\n ret += 1 << (s[i]-'0');\n }\n return ret;\n}\ninline int check_64(lli n, lli m){\n lli tmp = n ^ m;\n int ret = 0;\n for(int i = 0; i < L; ++i){\n if((15&tmp) == 0){\n ++ret;\n }\n tmp >>= 4;\n }\n return ret;\n}\ninline int check(int n, int m){\n return __builtin_popcount(n&m);\n}\ninline bool solve(lli n, int m){\n for(int i = 0; i < H; ++i){\n int h = check_64(n, nums[i]);\n int b = check(m, s_nums[i]) - h;\n if(hit[i] != h || blow[i] != b){\n return false;\n } \n }\n return true;\n}\ninline int dfs(lli n, int used, int depth, int ret){ \n if(depth == L){\n if(solve(n, used)){\n ans = n;\n return ret + 1;\n }\n return ret;\n } \n for(int i = 0; i < 10; ++i){\n if(((used >> i) & 1) != 1){\n ret = dfs((n<<4)+i, used|(1<<i), depth+1, ret);\n if(ret >= 2){\n return ret;\n }\n }\n }\n return ret;\n}\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n char tmp[11];\n while(true){\n scanf(\"%d %d\", &L, &H);\n if(L == 0 && H == 0){\n break;\n }\n for(int i = 0; i < H; ++i){\n scanf(\"%s\", tmp);\n nums[i] = conv_64(tmp);\n s_nums[i] = conv(tmp); \n scanf(\"%d %d\", &hit[i], &blow[i]);\n }\n int a = dfs(0L, 0, 0, 0);\n if(a == 1){\n //print_bits(ans);\n cout << deco_64(ans) << endl;\n }\n else{\n cout << \"NO\" << endl;\n }\n }\n return 0;\n}\n//uncode",
"accuracy": 1,
"time_ms": 8000,
"memory_kb": 1240,
"score_of_the_acc": -1.0119,
"final_rank": 20
},
{
"submission_id": "aoj_1122_1437037",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\ntemplate < class BidirectionalIterator >\nbool next_combination ( BidirectionalIterator first1 ,\n BidirectionalIterator last1 ,\n BidirectionalIterator first2 ,\n BidirectionalIterator last2 )\n{\n if (( first1 == last1 ) || ( first2 == last2 )) {\n return false ;\n }\n BidirectionalIterator m1 = last1 ;\n BidirectionalIterator m2 = last2 ; --m2;\n while (--m1 != first1 && !(* m1 < *m2 )){\n }\n bool result = (m1 == first1 ) && !(* first1 < *m2 );\n if (! result ) {\n // ???\n while ( first2 != m2 && !(* m1 < * first2 )) {\n ++ first2 ;\n }\n first1 = m1;\n std :: iter_swap (first1 , first2 );\n ++ first1 ;\n ++ first2 ;\n }\n if (( first1 != last1 ) && ( first2 != last2 )) {\n // ???\n m1 = last1 ; m2 = first2 ;\n while (( m1 != first1 ) && (m2 != last2 )) {\n std :: iter_swap (--m1 , m2 );\n ++ m2;\n }\n // ??¢\n std :: reverse (first1 , m1 );\n std :: reverse (first1 , last1 );\n std :: reverse (m2 , last2 );\n std :: reverse (first2 , last2 );\n }\n return ! result ;\n}\n \ntemplate < class BidirectionalIterator >\nbool next_combination ( BidirectionalIterator first ,\n BidirectionalIterator middle ,\n BidirectionalIterator last )\n{\n return next_combination (first , middle , middle , last );\n}\n\nvector<int> data;\nint L,H;\n\n\n\nint main(){\n for(int i=0;i<=9;i++) data.push_back( i );\n while( cin >> L >> H && (H||L) ){\n vector<vector<int> > T;\n vector<int> Hit,Blow; \n for(int i=0;i<H;i++){\n string s; int h,b; cin >> s >> h >> b;\n T.push_back( vector<int>() ); Hit.push_back( h ); Blow.push_back( b );\n for(int j=0;j<L;j++) T[i].push_back( s[j]-'0' );\n }\n vector<int> ans;\n bool flag = true;\n sort(data.begin(),data.end());\n do {\n do {\n int pos[10];\n memset(pos,-1,sizeof(pos));\n for(int i=0;i<L;i++) pos[data[i]] = i;\n bool f = true;\n for(int i=0;i<H;i++){\n int c1,c2; c1 = c2 = 0;\n for(int j=0;j<L;j++){\n int p = pos[T[i][j]];\n if( p == -1 ) continue;\n else if( p == j ) c1++;\n else c2++;\n if( c1 > Hit[i] || c2 > Blow[i] ) break;\n }\n if( c1 != Hit[i] || c2 != Blow[i] ) f = false;\n if(!f)break;\n }\n if( f ) {\n if( ans.empty() ) \n for(int i=0;i<L;i++) ans.push_back( data[i] );\n else\n flag = false;\n }\n } while( next_permutation( data.begin(), data.begin() + L ) );\n if( !flag ) break;\n } while( next_combination( data.begin(), data.begin() + L, data.end() ) );\n\n if( flag && !ans.empty() ){\n for(int i=0;i<L;i++ ) cout << ans[i];\n cout << endl;\n } else\n cout << \"NO\" << endl;\n }\n\n}",
"accuracy": 1,
"time_ms": 7790,
"memory_kb": 1236,
"score_of_the_acc": -0.9844,
"final_rank": 18
},
{
"submission_id": "aoj_1122_1362932",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n#include <ctime>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <sstream>\n#include <vector>\nusing namespace std;\n\n#define REP2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)\n#define REP(i, n) REP2(i, 0, n)\n#define ALL(c) (c).begin(), (c).end()\n#define FOREACH(i, c) for(auto i = (c).begin(); i != (c).end(); ++i)\n#define BIT(n, m) (((n) >> (m)) & 1)\n\ntypedef long long ll;\ntypedef pair<int, int> PI;\n\nconst ll inf = 1e15;\nconst ll mod = 1000 * 1000 * 1000 + 7;\nconst double eps = 1e-9;\n\ntemplate <typename S, typename T> ostream &operator<<(ostream &out, const pair<S, T> &p) {\n out << \"(\" << p.first << \", \" << p.second << \")\";\n return out;\n}\n\ntemplate <typename T> ostream &operator<<(ostream &out, const vector<T> &v) {\n out << \"[\";\n REP(i, v.size()){\n if (i > 0) out << \", \";\n out << v[i];\n }\n out << \"]\";\n return out;\n}\n\n\nint H, L;\nvector<string> T;\nvector<int> hint;\nvector<int> blow;\nvector<int> h_count;\nvector<int> t_mask;\nint used_mask = 0;\n\nvoid dfs(int pos, string &str, string &ans)\n{\n if (ans == \"-2\") return;\n \n if (pos == str.size()){\n bool ok = true;\n REP(i, T.size()) if (ok){\n int h = h_count[i];\n int b = __builtin_popcount(used_mask & t_mask[i]) - h;\n ok = ok && h == hint[i] && b == blow[i];\n }\n if (ok){\n if (ans == \"-1\"){\n ans = str;\n } else {\n ans = \"-2\";\n }\n }\n return;\n }\n\n REP(i, 10) if ((used_mask & (1 << i)) == 0){\n str[pos] = '0' + i;\n used_mask = used_mask | 1 << i;\n\n bool ok = true;\n REP(j, T.size()) {\n h_count[j] += T[j][pos] == str[pos];\n if (h_count[j] > hint[j]) ok = false;\n }\n if (ok) dfs(pos + 1, str, ans);\n REP(j, T.size()) h_count[j] -= T[j][pos] == str[pos];\n \n used_mask = used_mask ^ 1 << i;\n }\n}\n\n\nint main(){\n int L, H;\n while (cin >> L >> H && L + H){\n T.resize(H);\n hint.resize(H);\n blow.resize(H);\n t_mask.resize(H);\n h_count.resize(H);\n fill(ALL(h_count), 0);\n used_mask = 0;\n REP(i, H){\n cin >> T[i] >> hint[i] >> blow[i];\n t_mask[i] = 0;\n REP(j, T[i].size()) t_mask[i] |= (1 << (T[i][j] - '0'));\n }\n string ans = \"-1\";\n string str(L, ' ');\n dfs(0, str, ans);\n if (ans != \"-1\" && ans != \"-2\"){\n cout << ans << endl;\n } else {\n cout << \"NO\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 5270,
"memory_kb": 1232,
"score_of_the_acc": -0.6568,
"final_rank": 12
},
{
"submission_id": "aoj_1122_1168852",
"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\nint L, H;\nvector< pair<string,pint> > data;\nvector<set<char> > se;\nbool used[10];\nint con = 0;\nstring res;\n\nvoid dfs(int v, string str, vector<pint> now) {\n //cout << v << \", \" << str << \", \" << now << endl;\n if (v == L) {\n bool ok = true;\n for (int i = 0; i < now.size(); ++i) {\n if (now[i] != data[i].second) ok = false;\n }\n if (ok) {\n ++con; res = str;\n }\n return;\n }\n \n for (char c = '0'; c <= '9'; ++c) {\n if (used[c-'0']) continue;\n \n string nstr = str + c;\n vector<pint> next = now;\n bool ok = true;\n for (int i = 0; i < now.size(); ++i) {\n if (data[i].first[v] == c) { ++next[i].first; }\n else {\n if ( se[i].count(c) ) { ++next[i].second; }\n }\n \n if (next[i].first > data[i].second.first) { ok = false; break; }\n if (next[i].second > data[i].second.second) { ok = false; break; }\n if (next[i].first + next[i].second < data[i].second.first + data[i].second.second -L-v-1) { ok = false; break; }\n }\n if (ok) {\n used[c-'0'] = true;\n dfs(v+1, nstr, next);\n used[c-'0'] = false;\n }\n }\n}\n\nint main() {\n // freopen( \"/Users/macuser/Dropbox/Contest/input.in\", \"r\", stdin );\n \n while (cin >> L >> H) {\n if (L == 0) break;\n \n data.resize(H);\n se.clear(); se.resize(H);\n \n for (int i = 0; i < H; ++i) {\n string str; int h; int b;\n cin >> str >> h >> b;\n data[i] = MP(str,pint(h,b));\n for (int j = 0; j < str.size(); ++j) se[i].insert(str[j]);\n }\n \n memset(used, 0, sizeof(used));\n res = \"\";\n string str = \"\";\n con = 0;\n vector<pint> now(H, pint(0,0));\n \n dfs(0, str, now);\n \n if (con == 1) cout << res << endl;\n else cout << \"NO\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2780,
"memory_kb": 1228,
"score_of_the_acc": -0.3332,
"final_rank": 6
},
{
"submission_id": "aoj_1122_1168840",
"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\nint L, H;\nvector< pair<string,pint> > data;\nvector<set<char> > se;\nbool used[10];\nint con = 0;\nstring res;\n\nvoid dfs(int v, string str, vector<pint> now) {\n //cout << v << \", \" << str << \", \" << now << endl;\n if (v == L) {\n bool ok = true;\n for (int i = 0; i < now.size(); ++i) {\n if (now[i] != data[i].second) ok = false;\n }\n if (ok) {\n ++con; res = str;\n }\n return;\n }\n \n for (char c = '0'; c <= '9'; ++c) {\n if (used[c-'0']) continue;\n \n string nstr = str + c;\n vector<pint> next = now;\n bool ok = true;\n for (int i = 0; i < now.size(); ++i) {\n if (data[i].first[v] == c) { ++next[i].first; }\n else {\n if ( se[i].count(c) ) { ++next[i].second; }\n }\n \n if (next[i].first > data[i].second.first) { ok = false; break; }\n if (next[i].second > data[i].second.second) { ok = false; break; }\n }\n if (ok) {\n used[c-'0'] = true;\n dfs(v+1, nstr, next);\n used[c-'0'] = false;\n }\n }\n}\n\nint main() {\n // freopen( \"/Users/macuser/Dropbox/Contest/input.in\", \"r\", stdin );\n \n while (cin >> L >> H) {\n if (L == 0) break;\n \n data.resize(H);\n se.clear(); se.resize(H);\n \n for (int i = 0; i < H; ++i) {\n string str; int h; int b;\n cin >> str >> h >> b;\n data[i] = MP(str,pint(h,b));\n for (int j = 0; j < str.size(); ++j) se[i].insert(str[j]);\n }\n \n memset(used, 0, sizeof(used));\n res = \"\";\n string str = \"\";\n con = 0;\n vector<pint> now(H, pint(0,0));\n \n dfs(0, str, now);\n \n if (con == 1) cout << res << endl;\n else cout << \"NO\" << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2660,
"memory_kb": 1232,
"score_of_the_acc": -0.3179,
"final_rank": 5
},
{
"submission_id": "aoj_1122_1137326",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nchar str[1100][11];\nint H[1100];\nint L[1100];\nint n;\nint ret[12];\nint ans=0;\nint v[12];\nint now[12];\nint tmp[12];\nint m;\nvoid solve(int a){\n\tif(ans>1)return;\n\tfor(int j=0;j<n;j++){\n\t\tint h=0;\n\t\tint bl=0;\n\t\tfor(int k=0;k<m;k++)tmp[k]=0;\n\t\tfor(int k=0;k<a;k++){\n\t\t\tif(str[j][k]-'0'==now[k]){tmp[k]=1;h++;}\n\t\t}\n\t\tfor(int k=0;k<a;k++){\n\t\t\tfor(int l=0;l<a;l++){\n\t\t\t\tif(tmp[l])continue;\n\t\t\t\tif(str[j][k]-'0'==now[l]){tmp[l]=1;bl++;break;}\n\t\t\t}\n\t\t}\n\t\tif(h>H[j])return;\n\t\tif(h+m-a<H[j])return;\n\t\tif(bl>L[j])return;\n\t\tif(bl+(m-a)*2<L[j])return;\n\t}\n\tif(a==m){\n\t\tans++;\n\t\tfor(int i=0;i<m;i++)ret[i]=now[i];\n\t\treturn;\n\t}\n\tfor(int i=0;i<10;i++){\n\t\tif(!v[i]){\n\t\t\tv[i]=1;\n\t\t\tnow[a]=i;\n\t\t\tsolve(a+1);\n\t\t\tv[i]=0;\n\t\t}\n\t}\n}\nint main(){\n\tint a,b;\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tm=a;\n\t\tn=b;\n\t\tfor(int i=0;i<b;i++){\n\t\t\tscanf(\"%s%d%d\",str[i],H+i,L+i);\n\t\t}\n\t\tans=0;\n\t\tfor(int i=0;i<12;i++)v[i]=0;\n\t\tsolve(0);\n\t\tif(ans!=1){\n\t\t\tprintf(\"NO\\n\");continue;\n\t\t}\n\t\tfor(int i=0;i<a;i++)printf(\"%d\",ret[i]);\n\t\tprintf(\"\\n\");\n\t}\n}",
"accuracy": 1,
"time_ms": 4940,
"memory_kb": 1056,
"score_of_the_acc": -0.6026,
"final_rank": 11
},
{
"submission_id": "aoj_1122_1137041",
"code_snippet": "#include <bits/stdc++.h>\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n\nusing namespace std;\n\npair<int,int> hb(const vector<int> &l, const vector<int> &r, int K) {\n int hit = 0;\n int blow = 0;\n REP(i,K) if (l[i] == r[i]) ++hit;\n vector<int> cnt(11,0);\n REP(i,K) ++cnt[l[i]];\n REP(i,K) if(cnt[r[i]]) ++blow;\n return make_pair(hit, blow-hit);\n}\n\nvector<int> search(const vector<int> &v, const vector<tuple<vector<int>,int,int>> &hint, int l) {\n if (v.size() == l) {\n REP(i,hint.size()) {\n vector<int> hi;\n int h,b;\n tie(hi,h,b) = hint[i];\n if (hb(v,hi,l) != make_pair(h,b)) return vector<int>();\n }\n return v;\n } else {\n vector<int> vv(l,11);\n REP(i,v.size()) vv[i]=v[i];\n REP(i,hint.size()) {\n vector<int> hi;\n int h,b,hv,bv,hvv,bvv;\n tie(hi,h,b) = hint[i];\n tie(hvv,bvv) = hb(vv,hi,l);\n if(hvv>h||bvv>b) return vector<int>();\n int rem = h-hvv + b-bvv;\n if (rem > l-v.size()) return vector<int>();\n }\n vector<int> cnt(10);\n REP(i,v.size()) ++cnt[v[i]];\n vector<int> ans;\n REP(i,10){\n if(cnt[i]==0) {\n auto cp = v;\n cp.push_back(i);\n auto res = search(cp,hint,l);\n if (res.empty()) continue;\n if (ans.empty())\n ans = res;\n else\n throw \"hoge\";\n }\n }\n return ans;\n }\n}\n\nint main() {\n while(1){\n int l,h;\n cin>>l>>h;\n if(!l) break;\n vector<tuple<vector<int>,int,int>> hint;\n REP(i,h) {\n string tr;\n int hit, blow;\n cin>>tr>>hit>>blow;\n vector<int> trv(l);\n REP(j,l) trv[j] = tr[j]-'0';\n hint.emplace_back(trv,hit,blow);\n }\n vector<int> v;\n try{\n auto ans = search(v, hint, l);\n if (ans.empty()) {\n cout << \"NO\"<< endl;\n }else {\n for(auto i:ans) cout<<i;\n cout<<endl;\n }\n }catch(...){\n cout<<\"NO\"<<endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 3430,
"memory_kb": 1300,
"score_of_the_acc": -0.4223,
"final_rank": 10
},
{
"submission_id": "aoj_1122_1012174",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n#include <cctype>\n#include <algorithm>\n#include <set>\n#include <cmath>\n#include <cassert>\n#include <array>\nusing namespace std;\n\nint pow_int(int x, int n) {\n\tint res = 1;\n\tfor(int i = 0; i < n; ++i) {\n\t\tres *= x;\n\t}\n\treturn res;\n}\n\narray<int, 10> count_num(const string &s) {\n\tarray<int, 10> cnt;\n\tcnt.fill(0);\n\tfor(const auto &c : s) {\n\t\t++cnt[c - '0'];\n\t}\n\treturn cnt;\n}\n\nint match(const string &a, const string &b) {\n\tconst int n = a.size();\n\tint res = 0;\n\tfor(int i = 0; i < n; ++i) {\n\t\tif(a[i] == b[i]) ++res;\n\t}\n\treturn res;\n}\n\nint count_blow(const string &a, const string &b) {\n\tconst array<int, 10> cnt_a = count_num(a);\n\tconst array<int, 10> cnt_b = count_num(b);\n\n\tint res = 0;\n\tfor(int i = 0; i < 10; ++i) {\n\t\tres += min(cnt_a[i], cnt_b[i]);\n\t}\n\treturn res - match(a, b);\n}\n\nstring to_leading_zero_string(int x, int n) {\n\tchar buf[256];\n\tsprintf(buf, \"%0*d\", n, x);\n\treturn string(buf);\n}\n\nbool valid(const string &s) {\n\tconst array<int, 10> cnt = count_num(s);\n\treturn *max_element(cnt.begin(), cnt.end()) <= 1;\n}\n\nvector<string> solve(const vector<string> &number, const vector<int> &hit, const vector<int> & blow) {\n\tconst int n = number.size();\n\tconst int l = number[0].size();\n\tconst int half = l / 2;\n\n\tconst int first_size = half;\n\tconst int second_size = l - half;\n\n\tconst int max_first = pow_int(10, first_size);\n\tconst int max_second = pow_int(10, second_size);\n\n\tvector<string> first, second;\n\tfirst.reserve(n);\n\tsecond.reserve(n);\n\n\tfor(int i = 0; i < n; ++i) {\n\t\tfirst.emplace_back(number[i].substr(0, half));\n\t\tsecond.emplace_back(number[i].substr(half));\n\t}\n\n\tmap<vector<int>, vector<string>> candidates;\n\n\tfor(int x = 0; x < max_first; ++x) {\n\t\tconst string str = to_leading_zero_string(x, first_size);\n\t\tif(!valid(str)) continue;\n\n\t\tvector<int> key(n);\n\n\t\tfor(int i = 0; i < n; ++i) {\n\t\t\tconst int rest_hit = hit[i] - match(str, first[i]);\n\t\t\tif(rest_hit < 0) goto ng_first;\n\t\t\tkey[i] = rest_hit;\n\t\t}\n\n\t\tcandidates[key].emplace_back(str);\n\n\tng_first:;\n\t}\n\n\n\tvector<string> res;\n\tfor(int x = 0; x < max_second; ++x) {\n\t\tconst string str = to_leading_zero_string(x, second_size);\n\t\tif(!valid(str)) continue;\n\t\tvector<int> key(n);\n\n\t\tfor(int i = 0; i < n; ++i) {\n\t\t\tkey[i] = match(str, second[i]);\n\t\t\tif(key[i] > hit[i]) goto ng_second;\n\t\t}\n\n\t\tif(!candidates.count(key)) goto ng_second;\n\t\tfor(const auto &e : candidates.at(key)) {\n\t\t\tstring s = e + str;\n\t\t\tif(!valid(s)) continue;\n\n\t\t\tbool ok = true;\n\n\t\t\tfor(int i = 0; i < n; ++i) {\n\t\t\t\tif(count_blow(s, number[i]) != blow[i]) {\n\t\t\t\t\tok = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(ok) {\n\t\t\t\tres.emplace_back(s);\n\t\t\t\tif(res.size() > 1) return res;\n\t\t\t}\n\t\t}\n\n\tng_second:;\n\t}\n\n\treturn res;\n}\n\nint main(){\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tfor(int l, h; cin >> l >> h && l;) {\n\t\tvector<string> number(h);\n\t\tvector<int> hit(h), blow(h);\n\n\t\tfor(int i = 0; i < h; ++i) {\n\t\t\tcin >> number[i] >> hit[i] >> blow[i];\n\t\t}\n\n\t\tconst auto answers = solve(number, hit, blow);\n\t\tcout << (answers.size() == 1 ? answers.front() : \"NO\") << endl;\n\t}\n\n\treturn EXIT_SUCCESS;\n}",
"accuracy": 1,
"time_ms": 1410,
"memory_kb": 3104,
"score_of_the_acc": -0.2765,
"final_rank": 4
},
{
"submission_id": "aoj_1122_972683",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n#include <cctype>\n#include <algorithm>\n#include <set>\n#include <cmath>\n#include <cassert>\n#include <array>\nusing namespace std;\n\n#define dump(a) //(cerr << #a << \" = \" << (a) << endl)\n\ninline int match(const string &a, const string &b) {\n const int n = a.size();\n int res = 0;\n for(int i = 0; i < n; ++i) {\n\tif(a[i] == b[i]) ++res;\n }\n return res;\n}\n\ninline int count_blow(const string &a, const string &b) {\n int res = 0;\n for(int c = '0'; c <= '9'; ++c) {\n\tres += min(count(a.begin(), a.end(), c), count(b.begin(), b.end(), c));\n }\n return res - match(a, b);\n}\n\ninline string to_leading_zero_string(int x, int n) {\n char buf[256];\n sprintf(buf, \"%0*d\", n, x);\n return string(buf);\n}\n\nbool valid(const string &s) {\n for(char c = '0'; c <= '9'; ++c) {\n\tif(count(s.begin(), s.end(), c) > 1) return false;\n }\n return true;\n}\n\nvector<string> solve(const vector<string> &number, const vector<int> &hit, const vector<int> & blow) {\n const int n = number.size();\n const int l = number[0].size();\n const int half = l / 2;\n\n const int first_size = half;\n const int second_size = l - half;\n\n const int max_first = pow(10, first_size);\n const int max_second = pow(10, second_size);\n\n map<vector<int>, vector<string>> candidates;\n\n for(int x = 0; x < max_first; ++x) {\n\tconst string str = to_leading_zero_string(x, first_size);\n\tif(!valid(str)) continue;\n\n\tvector<int> key(n);\n\n\tfor(int i = 0; i < n; ++i) {\n\t const string first = number[i].substr(0, half);\n\t const int rest_hit = hit[i] - match(str, first);\n\t if(rest_hit < 0) goto first_ng;\n\t key[i] = rest_hit;\n\t}\n\n\tcandidates[key].emplace_back(str);\n\n first_ng:;\n }\n\n vector<string> res;\n for(int x = 0; x < max_second; ++x) {\n\tconst string str = to_leading_zero_string(x, second_size);\n\tif(!valid(str)) continue;\n\tvector<int> key(n);\n\n\tfor(int i = 0; i < n; ++i) {\n\t const string second = number[i].substr(half);\n\t key[i] = match(str, second);\n\t if(key[i] > hit[i]) goto second_ng;\n\t}\n\n\tif(str == \"281\") dump(str);\n\tif(str == \"281\") for(auto &e : key) dump(e);\n\tif(!candidates.count(key)) goto second_ng;\n\tfor(const auto &e : candidates.at(key)) {\n\t string s = e + str;\n\t if(!valid(s)) continue;\n\n\t bool ok = true;\n\n\t if(s == \"637281\") dump(s);\n\n\t for(int i = 0; i < n; ++i) {\n\t\tif(s == \"637281\") dump(count_blow(s, number[i]));\n\t\tif(count_blow(s, number[i]) != blow[i]) {\n\t\t ok = false;\n\t\t break;\n\t\t}\n\t }\n\n\t if(ok) res.emplace_back(s);\n\t}\n\n second_ng:;\n }\n\n return res;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n for(int l, h; cin >> l >> h && l;) {\n\tvector<string> number(h);\n\tvector<int> hit(h), blow(h);\n\n\tfor(int i = 0; i < h; ++i) {\n\t cin >> number[i] >> hit[i] >> blow[i];\n\t}\n\n\tconst auto answers = solve(number, hit, blow);\n\tdump(answers.size());\n\tcout << (answers.size() == 1 ? answers.front() : \"NO\") << endl;\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 2420,
"memory_kb": 3108,
"score_of_the_acc": -0.4079,
"final_rank": 9
},
{
"submission_id": "aoj_1122_959254",
"code_snippet": "#include<iostream>\n#include<tuple>\n#include<vector>\n#include<set>\n#include<bitset>\n#include<algorithm>\nusing namespace std;\n\ntypedef tuple<vector<int>, int, int> Hint;\nenum{TRY, HIT, BLOW};\n\nconst int NUMBERS = 10;\n\nvector<vector<int>> subset_combination(int n, int k, vector<int> number) {\n vector<vector<int>> result;\n unsigned long long int S = (1 << k) - 1;\n unsigned long long int E = ~((1 << n) - 1);\n while(!(S & E)) {\n bitset<NUMBERS> flag(S);\n vector<int> v;\n for(int i = 0; i < n; i++) if(flag[i]) v.push_back(number[i]);\n result.push_back(v);\n unsigned long long int smallest = S & -S;\n unsigned long long int ripple = S + smallest;\n unsigned long long int nsmallest = ripple & -ripple;\n S = ripple | (((nsmallest / smallest) >> 1) - 1);\n }\n return result;\n}\n\nvector<vector<int>> check(vector<int> v, const vector<Hint>& hint) {\n sort(v.begin(), v.end());\n vector<vector<int>> result;\n do {\n bool ok = true;\n for(const auto& h: hint) {\n int hit = 0, blow = 0;\n int count[10] = {0};\n for(const auto& n: get<TRY>(h)) count[n]++;\n for(int i = 0; i < v.size(); i++) {\n if(v[i] == get<TRY>(h)[i]) hit++;\n else if(count[v[i]]) blow++;\n }\n if(hit != get<HIT>(h) || blow != get<BLOW>(h)) {\n ok = false;\n break;\n }\n }\n if(ok) {\n result.push_back(v);\n if(result.size() > 1) return result;\n }\n } while (next_permutation(v.begin(), v.end()));\n return result;\n}\n\nint main() {\n int L, H;\n vector<Hint> hint;\n vector<vector<int>> candidate;\n while(cin >> L >> H, L | H) {\n hint.resize(H);\n for(auto& element: hint) {\n string t;\n int h, b;\n cin >> t >> h >> b;\n vector<int> number;\n for(auto& n: t) number.push_back(n - '0');\n element = Hint(number, h, b);\n }\n\n vector<int> all = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};\n candidate = subset_combination(NUMBERS, L, all);\n\n vector<int> answer;\n bool ok = true;\n for(auto& v: candidate) {\n vector<vector<int>> result = check(v, hint);\n if(result.size() > 1) ok = false;\n if(result.size() == 1) {\n if(answer.size()) ok = false;\n else answer = *result.begin();\n }\n if(!ok) break;\n }\n\n if(ok && answer.size()) {\n for(const auto& n: answer) cout << n;\n cout << endl;\n } else {\n cout << \"NO\" << endl;\n }\n }\n}",
"accuracy": 1,
"time_ms": 5530,
"memory_kb": 1268,
"score_of_the_acc": -0.6929,
"final_rank": 13
},
{
"submission_id": "aoj_1122_772652",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nconst int MAXH = 1000000;\nint L, H;\nstring s[MAXH];\nint h[MAXH], b[MAXH], o[MAXH];\nint bit[MAXH];\nstring t;\nstring ans;\n\nvoid rec(int k, int used) {\n if(k == L) {\n for(int j = 0; j < H; ++j) {\n if(h[j]|b[j]|o[j]) return;\n }\n if(ans != \"\") throw 0;\n ans = t;\n return;\n }\n for(int i = 0; i < 10; ++i) {\n if((used >> i) & 1) continue;\n char c = i + '0';\n bool flag = true;\n for(int j = 0; j < H; ++j) {\n if(s[j][k] == c) {\n h[j] -= 1;\n } else if((bit[j] >> i) & 1) {\n b[j] -= 1;\n } else {\n o[j] -= 1;\n }\n if(h[j] < 0 || b[j] < 0 || o[j] < 0) {\n flag = false;\n }\n }\n if(flag) {\n t[k] = c;\n rec(k+1, used|(1<<i));\n }\n for(int j = 0; j < H; ++j) {\n if(s[j][k] == c) {\n h[j] += 1;\n } else if((bit[j] >> i) & 1) {\n b[j] += 1;\n } else {\n o[j] += 1;\n }\n }\n }\n}\n\nint main() {\n while(cin >> L >> H && (L|H)) {\n for(int i = 0; i < H; ++i) {\n cin >> s[i] >> h[i] >> b[i];\n o[i] = L - h[i] - b[i];\n bit[i] = 0;\n for(int j = 0; j < s[i].size(); ++j) {\n bit[i] |= 1<<(s[i][j]-'0');\n }\n }\n t.resize(L);\n try {\n ans = \"\";\n rec(0,0);\n if(ans == \"\") {\n cout << \"NO\" << endl;\n } else {\n cout << ans << endl;\n }\n } catch(...) {\n cout << \"NO\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 16532,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_1122_759404",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<iomanip>\n#include<cassert>\n#include<sstream>\n#include<complex>\n#include<cstdio>\n#include<climits>\n#include<cstdlib>\n#include<deque>\n#include<queue>\n#include<stack>\n#include<map>\n#include<set>\n#include<ctime>\n#include<cctype>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\n#define EPS 1e-10\n#define equals(a,b) (fabs((a)-(b)) < EPS) \n#define MAX 1000\nusing namespace std;\nstruct P\n{\n string s;\n int h,b;\n P(string s=\"$$$\",int h=-inf,int b=-inf):s(s),h(h),b(b){}\n};\n\nint L,H;\nP is[MAX];\nbool ch[MAX][10];\nbool ok,fin;\nstring ans;\n\nbool check(string s,bool fl)\n{\n rep(i,H)\n {\n int hit,blow;\n hit = blow = 0;\n\n rep(j,s.size())\n\t{\n\t if(s[j] == is[i].s[j])\n\t {\n\t hit++;\n\t continue;\n\t }\n\t if(ch[i][s[j]-'0'])blow++;\n\t}\n\n if(!fl && hit > is[i].h)return false;\n if( fl && hit != is[i].h)return false;\n\n if(!fl && blow > is[i].b)return false;\n if( fl && blow != is[i].b)return false;\n }\n return true;\n}\n\n\nvoid dfs(int k,int used,string s)\n{\n if(fin)return;\n if(!check(s,false))return;\n if(k >= L)\n {\n if(check(s,true))\n\t{\n\t if(ok)\n\t {\n\t fin = true;\n\t ok = false;\n\t }\n\t else\n\t {\n\t ok = true;\n\t ans = s;\n\t }\n\t}\n return;\n }\n\n rep(i,10)\n {\n if((used >> i) & 1)continue;\n dfs(k+1,used|(1<<i),s + string(1,(char)('0'+i)));\n }\n}\n\nint main()\n{\n while(cin >> L >> H,L|H)\n {\n ok = fin = false;\n assert(H < MAX);\n rep(i,H)rep(j,10)ch[i][j] = false;\n rep(i,H)\n\t{\n\t cin >> is[i].s >> is[i].h >> is[i].b;\n\t rep(j,L)\n\t ch[i][is[i].s[j]-'0'] = true;\n\t}\n dfs(0,0,\"\");\n cout << (ok?ans:\"NO\") << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 2990,
"memory_kb": 1272,
"score_of_the_acc": -0.3633,
"final_rank": 7
},
{
"submission_id": "aoj_1122_526975",
"code_snippet": "//01\n#include<iostream>\n#include<string>\n#include<vector>\n\nusing namespace std;\n\nint l,h;\nvector<string> tr;\nvector<int> hi,bl;\nchar t[11];\nstring a;\nint ac;\n\nvoid dfs(int d,int u){\n if(d!=l){\n for(int i=0;i<10;i++){\n if(!(u>>i&1)){\n\tt[d]='0'+i;\n\tfor(int i=0;i<tr.size();i++){\n\t int ch=0,cb=0;\n\t for(int j=0;j<=d;j++){\n\t if(tr[i].find(t[j])!=string::npos){\n\t ((t[j]==tr[i][j])?ch:cb)++;\n\t }\n\t }\n\t if(ch+l-d-1<hi[i]||ch>hi[i]||cb+l-d-1<bl[i]||cb>bl[i])goto next;\n\t}\n\tdfs(d+1,u|1<<i);\n next:\n\t;\n }\n }\n }else{\n t[d]=0;\n ac++;\n a=t;\n }\n}\n\nint main(){\n while(cin>>l>>h,l|h){\n tr.resize(h);\n hi.resize(h);\n bl.resize(h);\n while(h--){\n cin>>tr[h]>>hi[h]>>bl[h];\n }\n ac=0;\n dfs(0,0);\n if(ac==1){\n cout<<a<<endl;\n }else{\n cout<<\"NO\"<<endl;\n }\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 3350,
"memory_kb": 1232,
"score_of_the_acc": -0.4075,
"final_rank": 8
}
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.