> ... >> a);\\n}\\n\\n#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\\n#define ULL(...) ull __VA_ARGS__; input(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)\\n#define CHA(...) char __VA_ARGS__; input(__VA_ARGS__)\\n#define VLL(name,length) vll name(length);rep(i,length){cin >> name[i];}\\n#define VVLL(name,h,w) vvll name(h,vll(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVLL(name,a,b,c) vvvll name(a,vvll(b,vll(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VI(name,length) vi name(length);rep(i,length){cin >> name[i];}\\n#define VVI(name,h,w) vvi name(h,vi(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVI(name,a,b,c) vvvi name(a,vvll(b,vi(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VLD(name,length) vld name(length);rep(i,length){cin >> name[i];}\\n#define VVLD(name,h,w) vvld name(h,vld(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVLD(name,a,b,c) vvvld name(a,vvld(b,vld(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VC(name,length) vc name(length);rep(i,length){cin >> name[i];}\\n#define VVC(name,h,w) vvc name(h,vc(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVC(name,a,b,c) vvvc name(a,vvc(b,vc(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VS(name,length) vs name(length);rep(i,length){cin >> name[i];}\\n#define VVS(name,h,w) vvs name(h,vs(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVS(name,a,b,c) vvvs name(a,vvs(b,vs(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define PLL(name) pll name;cin>>name.first>>name.second;\\n#define VPLL(name,length) vpll name(length);rep(i,length){cin>>name[i].first>>name[i].second;}\\n\\nvoid print(){cout << \\\"\\\\n\\\";}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p) {\\n os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {\\n os << \\\"[\\\";\\n for (size_t i = 0; i < vec.size(); ++i) {\\n os << vec[i];\\n if (i + 1 < vec.size()) os << \\\", \\\";\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream& operator<<(std::ostream& os, const std::vector<std::pair<T1, T2>>& a) {\\n os << \\\"[\\\";\\n for (size_t j = 0; j < a.size(); ++j) {\\n os << \\\"(\\\" << a[j].first << \\\", \\\" << a[j].second << \\\")\\\";\\n\\t\\tif (j + 1 < a.size()) os << \\\", \\\";\\n }\\n\\tos << \\\"]\\\";\\n return os;\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream& operator<<(std::ostream& os, const std::vector<std::vector<std::pair<T1, T2>>>& mat) {\\n\\tos << \\\"[\\\";\\n for (size_t i = 0; i < mat.size(); ++i) {\\n\\t\\tos << \\\"[\\\";\\n for (size_t j = 0; j < mat[i].size(); ++j) {\\n os << \\\"(\\\" << mat[i][j].first << \\\", \\\" << mat[i][j].second << \\\")\\\";\\n\\t\\t\\tif (j + 1 < mat[i].size()) os << \\\", \\\";\\n }\\n\\t\\tos << \\\"]\\\";\\n\\t\\tif (i + 1 < mat.size()) os << \\\", \\\";\\n }\\n\\tos << \\\"]\\\";\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& os, const std::set<T>& s) {\\n os << \\\"{\\\";\\n bool first = true;\\n for (const auto& x : s) {\\n if (!first) os << \\\", \\\";\\n os << x;\\n first = false;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\ntemplate <typename K, typename V>\\nstd::ostream& operator<<(std::ostream& os, const std::map<K, V>& m) {\\n os << \\\"{\\\";\\n bool first = true;\\n for (const auto& [key, val] : m) {\\n if (!first) os << \\\", \\\";\\n os << key << \\\": \\\" << val;\\n first = false;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\ntemplate<class T, class... Ts>\\nvoid print(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\\\\n';}\\n\\nvoid write(){cout << \\\"\\\\n\\\";}\\ntemplate<class T, class... Ts>\\nvoid write(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\\\\n';}\\nvoid write(vll x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vi x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvi x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvvi x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \\\" \\\";}else if(j!=len(x[i])-1){cout << \\\" | \\\";}else{cout << '\\\\n';}}}\\nvoid write(vld x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvld x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvvld x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \\\" \\\";}else if(j!=len(x[i])-1){cout << \\\" | \\\";}else{cout << '\\\\n';}}}\\nvoid write(vc x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvc x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvvc x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \\\" \\\";}else if(j!=len(x[i])-1){cout << \\\" | \\\";}else{cout << '\\\\n';}}}\\nvoid write(vs x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvs x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvvs x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \\\" \\\";}else if(j!=len(x[i])-1){cout << \\\" | \\\";}else{cout << '\\\\n';}}}\\nvoid write(pll x){cout << x.first << ' ' << x.second << '\\\\n';}\\nvoid write(vpll x){rep(i,len(x)){cout << x[i].first << ' ' << x[i].second << '\\\\n';}}\\nvoid write(vvpll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j].first << ' ' << x[i][j].second;if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\n\\ntemplate <typename T>\\nT sum(const std::vector<T>& v) {\\n return std::accumulate(v.begin(), v.end(), T(0));\\n}\\n\\ntemplate<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }\\ntemplate<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }\\ntemplate<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }\\ntemplate<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }\\n\\nlong long mod_mul(long long a, long long b, long long mod) {\\n return (__int128)a * b % mod;\\n}\\n\\nlong long mod_pow(long long a, long long b, long long mod) {\\n long long result = 1;\\n a %= mod;\\n while (b > 0) {\\n if (b & 1) result = mod_mul(result, a, mod);\\n a = mod_mul(a, a, mod);\\n b >>= 1;\\n }\\n return result;\\n}\\n\\nbool MillerRabin(ll x){\\n \\n if(x <= 1){return false;}\\n if(x == 2){return true;}\\n if((x & 1) == 0){return false;}\\n vll test;\\n if(x < (1 << 30)){\\n test = {2, 7, 61};\\n } \\n else{\\n test = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};\\n }\\n ll s = 0;\\n ll d = x - 1;\\n while((d & 1) == 0){\\n s++;\\n d >>= 1;\\n }\\n for(ll i:test){\\n if(x <= i){return true;}\\n ll y = mod_pow(i,d,x);\\n if(y == 1 || y == x - 1){continue;}\\n ll c = 0;\\n for(int j=0;j<s-1;j++){\\n y = mod_mul(y,y,x);\\n if(y == x - 1){\\n c = 1;\\n break;\\n }\\n }\\n if(c == 0){\\n return false;\\n }\\n }\\n return true;\\n}\\n\\nint main(){\\n\\tios::sync_with_stdio(false);\\n\\tstd::cin.tie(nullptr);\\n while(1){\\n LL(n,m);\\n if(n == 0 && m == 0){break;}\\n vpll a;\\n rep(i,n){\\n LL(x,y);\\n a.push_back({y,x});\\n }\\n sort(rall(a));\\n ll ans = 0;\\n for(auto [x,y]:a){\\n ll z = min(y,m);\\n y -= z;\\n m -= z;\\n ans += x * y;\\n }\\n print(ans);\\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3820,\n \"score_of_the_acc\": -1,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2019_10536889\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <vector>\\nusing namespace std;\\nint main() {\\n int N,M,D,P,u,ans;\\n cin >> N >> M;\\n while(N!=0 or M!=0){\\n ans = 0;\\n vector<int>sumP(11,0);\\n for(int i=0;i<N;i++){\\n cin >> D >> P;\\n sumP[P]+=D;\\n ans += D * P;\\n }\\n \\n u= 10;\\n while(M > 0){\\n ans -= min(M,sumP[u]) * u;\\n M = M - sumP[u];\\n u--;\\n if(u == -1){\\n ans = 0;\\n break;\\n }\\n }\\n cout << ans << endl;\\n cin >> N >> M;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3436,\n \"score_of_the_acc\": -0.527,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2019_10498312\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <ctime>\\n#include <string>\\n#include <functional>\\nusing namespace std;\\nusing ll = long long;\\nusing lb = long double;\\n\\nint main() {\\n int n, m;\\n while (true) {\\n cin >> n >> m;\\n if (n == 0 && m == 0) break;\\n // sect: vector of pair<dist, exp>\\n vector<pair<int, int>> sect;\\n for (int i = 0; i < n; i++) {\\n int d, p;\\n cin >> d >> p;\\n sect.push_back(make_pair(d, p));\\n }\\n\\n while (m > 0) {\\n int maxind = 0;\\n // Search for sect where its dist is still above zero.\\n while (maxind < n && sect[maxind].first == 0) maxind++;\\n // If there's none, budget cannot be used anymore.\\n if (maxind == n) break;\\n int max = sect[maxind].second;\\n // Search for max value of exp per dist, excluding its dist has already reached zero.\\n for (int i = 0; i < n; i++) {\\n if (sect[i].first != 0 && sect[i].second > max) {\\n max = sect[i].second;\\n maxind = i;\\n }\\n }\\n // Decrease budget and maxind's dist. Dist reaches zero if whole of the section is paid from the budget.\\n if (m - sect[maxind].first < 0) { //If budget won't pay whole of the section, minus dist by budget and let budget be zero.\\n sect[maxind].first -= m;\\n m = 0;\\n } else { //If buget will pay whole of the section, minus budget by whole dist and let dist of the section be zero.\\n m -= sect[maxind].first;\\n sect[maxind].first = 0;\\n }\\n }\\n //Calc dist * exp per dist. If dist is zero, whole of the section is paid from the budget. so exp is zero.\\n int ans = 0;\\n for (int i = 0; i < n; i++) {\\n ans += sect[i].first * sect[i].second;\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 3500,\n \"score_of_the_acc\": -1.5833,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2019_10495790\",\n \"code_snippet\": \"#ifdef YONIHA\\n#include <yoniha/all.h>\\nusing namespace atcoder;\\n#elifdef ATCODER\\n#include <bits/stdc++.h>\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#else\\n#include <bits/stdc++.h>\\n#endif\\nusing namespace std;\\n#define int long long\\n#define all(x) (x).begin(), (x).end()\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define rrep(i, n) for(int i = (int)(n - 1); i >= 0; i--)\\ntemplate <typename T> bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\\ntemplate <typename T> bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vector<bool>>;\\nusing vs = vector<string>;\\nusing pii = pair<int, int>;\\n/*\\nusing mint = modint;\\nusing vm = vector<mint>;\\nusing vvm = vector<vector<mint>>;\\n*/\\n\\nvoid solve(int n, int m){\\n vector<pii> dp(n);\\n for(auto&& [d, p] : dp) cin >> d >> p;\\n sort(all(dp), [](pii x, pii y) {return x.second > y.second;});\\n int ans = 0;\\n for(auto [d, p] : dp){\\n int use_money = min(m, d);\\n m -= use_money;\\n ans += (d - use_money) * p;\\n }\\n cout << ans << '\\\\n';\\n}\\n\\nsigned main(){\\n while(true){\\n int n, m; cin >> n >> m;\\n if(n == 0 && m == 0) return 0;\\n solve(n, m);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3620,\n \"score_of_the_acc\": -0.7666,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2019_10461040\",\n \"code_snippet\": \"// 問題：https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2019\\n// 判定：\\n\\n//学習コメント：\\n\\n#include <bits/stdc++.h>\\n#include <vector>\\nusing namespace std;\\nint main() {\\n int N,M,D,P,u,ans;\\n cin >> N >> M;\\n while(N!=0 or M!=0){\\n ans = 0;\\n vector<int>sumP(11,0);\\n for(int i=0;i<N;i++){\\n cin >> D >> P;\\n sumP[P]+=D;\\n ans += D * P;\\n }\\n u= 10;\\n while(M > 0){\\n ans -= min(M,sumP[u]) * u;\\n M = M - sumP[u];\\n u--;\\n if(u == -1){\\n ans = 0;\\n break;\\n }\\n }\\n cout << ans << endl;\\n cin >> N >> M;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3052,\n \"score_of_the_acc\": -0.027,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2019_9406018\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint main() {\\n while (1) {\\n int N, M;\\n cin >> N >> M;\\n if (N == 0 && M == 0) {\\n break;\\n }\\n vector<int> D(N), P(N);\\n for (int i = 0; i < N; i++) {\\n cin >> D[i] >> P[i];\\n }\\n vector<int> id(N, 0);\\n iota(id.begin(), id.end(), 0);\\n sort(id.begin(), id.end(), [&] (int a, int b) {\\n if (P[a] == P[b]) {\\n return D[a] < D[b];\\n }\\n return P[a] > P[b];\\n });\\n long long ans = 0;\\n for (int i = 0; i < N; i++) {\\n ans += (long long)D[i] * P[i];\\n }\\n for (int i = 0; i < N; i++) {\\n if (M >= D[id[i]]) {\\n ans -= P[id[i]] * D[id[i]];\\n M -= D[id[i]];\\n } else { \\n ans -= P[id[i]] * M;\\n M = 0;\\n break;\\n }\\n }\\n cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3364,\n \"score_of_the_acc\": -0.4333,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2019_9364882\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define all(x) (x).begin(),(x).end()\\n#define eb emplace_back\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing vl = vector<long long>;\\nusing vvl = vector<vector<long long>>; using vs = vector<string>;\\nusing pl = pair<long long, long long>;\\ntemplate <typename T> inline bool chmin(T& a, const T& b) {bool compare = a > b; if (a > b) a = b; return compare;}\\ntemplate <typename T> inline bool chmax(T& a, const T& b) {bool compare = a < b; if (a < b) a = b; return compare;}\\ntemplate<class T>using rp_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate <typename T> T gcd(T a, T b) {if (b == 0)return a; else return gcd(b, a % b);}\\ntemplate <typename T> inline T lcm(T a, T b) {return a /gcd(a, b)*b;}\\nconst ll INF = 1LL << 60;\\nconst ld PI = acos(-1);\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);\\ntemplate <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);\\ntemplate <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);\\ntemplate <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);\\ntemplate <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);\\ntemplate <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);\\ntemplate <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);\\ntemplate <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);\\n \\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }\\ntemplate <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }\\ntemplate <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }\\ntemplate <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }\\ntemplate <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << \\\"deq[\\\"; for (auto v : vec) os << v << ','; os << ']'; return os; }\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }\\ntemplate <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << \\\"=>\\\" << v.second << ','; os << '}'; return os; }\\ntemplate <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << \\\"=>\\\" << v.second << ','; os << '}'; return os; }\\n#ifdef LOCAL\\nconst string COLOR_RESET = \\\"\\\\033[0m\\\", BRIGHT_GREEN = \\\"\\\\033[1;32m\\\", BRIGHT_RED = \\\"\\\\033[1;31m\\\", BRIGHT_CYAN = \\\"\\\\033[1;36m\\\", NORMAL_CROSSED = \\\"\\\\033[0;9;37m\\\", RED_BACKGROUND = \\\"\\\\033[1;41m\\\", NORMAL_FAINT = \\\"\\\\033[0;2m\\\";\\n#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << \\\" = \\\" << (x) << NORMAL_FAINT << \\\" (L\\\" << __LINE__ << \\\") \\\" << __FILE__ << COLOR_RESET << std::endl\\n#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << \\\" = \\\" << (x) << NORMAL_FAINT << \\\" (L\\\" << __LINE__ << \\\") \\\" << __FILE__ << COLOR_RESET << std::endl : std::cerr)\\n#else\\n#define dbg(x) ((void)0)\\n#define dbgif(cond, x) ((void)0)\\n#endif\\nvoid solve();\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout<<fixed<<setprecision(15);\\n int num_tc = 1;\\n //cin >> num_tc;\\n rep(tc,num_tc){\\n //cout << \\\"Case #\\\" << tc+1 << \\\": \\\" ;// << endl;\\n solve();\\n }\\n}\\n//見切り発車で実装しては行けない．頭の中でコードが完全に出来上がるまで書き始めるな．\\nvoid solve(){\\n while(true){\\n int N,M;cin>>N>>M;\\n if(N==0&&M==0)return;\\n vector<pl> P(N);\\n rep(i,N){\\n ll a,b;cin>>a>>b;\\n P[i] = {b,a};\\n }\\n sort(all(P),greater<pl>());\\n ll ans =0;\\n for(auto [p,d]:P){\\n if(d <= M){\\n M-=d;\\n }else{\\n d-=M;\\n M = 0;\\n ans+=d*p;\\n }\\n }\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3528,\n \"score_of_the_acc\": -0.6198,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2019_9347611\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst int INF = (int)1e9 + 1001010;\\nconst ll llINF = (long long)4e18 + 22000020;\\nconst string endn = \\\"\\\\n\\\";\\ntemplate <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));}\\nconst string ELEM_SEPARATION = \\\" \\\", VEC_SEPARATION = endn;\\ntemplate<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}\\ntemplate<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? ELEM_SEPARATION : \\\"\\\");} return o;}\\ntemplate<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? VEC_SEPARATION : \\\"\\\");} return o;}\\ntemplate<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}\\ntemplate<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}\\ntemplate<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}\\ntemplate<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}\\nll floor(ll a, ll b){if (b < 0) a = -a, b = -b; if(a >= 0) return a / b; else return (a + 1) / b - 1;}\\nll ceil(ll a, ll b){if (b < 0) a = -a, b = -b; if(a > 0) return (a - 1) / b + 1; else return a / b;}\\nll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;}\\n#ifdef DEBUG\\n#include <debug_slephy.cpp>\\n#else\\n#define debug(...)\\n#endif\\n// ================================== ここまでテンプレ ==================================\\n\\nvoid solve(){\\n ll n, m; cin >> n >> m;\\n if(n == 0 && m == 0) exit(0);\\n vector<pair<ll, ll>> dp(n);\\n for(int i = 0; i < n; i++) cin >> dp[i].first >> dp[i].second;\\n\\n ll ans = 0;\\n for(auto [d, p] : dp){\\n ans += d * p;\\n }\\n\\n sort(dp.begin(), dp.end(),\\n [](const auto &p, const auto &q){\\n const auto &[d1, p1] = p;\\n const auto &[d2, p2] = q;\\n if(p1 != p2) return p1 > p2;\\n else return d1 < d2;\\n }\\n );\\n\\n ll remain = m;\\n for(auto [d, p] : dp){\\n ll g = min(remain, d);\\n remain -= g;\\n ans -= g * p;\\n }\\n cout << ans << endl;\\n}\\n\\nint main(int argc, char *argv[]){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n while(true) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3536,\n \"score_of_the_acc\": -0.6302,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2019_9333570\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nint main(){\\n while(true){\\n ll N,M;\\n cin >> N >> M;\\n if(N==0&&M==0)break;\\n vector<pair<int,int>>pair(N);\\n for(ll i=0;i<N;i++){\\n ll d,p;\\n cin >> d >> p;\\n pair[i].first=p;\\n pair[i].second=d;\\n // firstが金,secondが距離\\n }\\n sort(pair.rbegin(),pair.rend());\\n int ans=0;\\n for(int k=0;k<N;k++){\\n if(M-pair[k].second>=0){\\n M=M-pair[k].second;\\n }else{\\n ans+=(pair[k].second-M)*pair[k].first;\\n M=0;\\n }\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3440,\n \"score_of_the_acc\": -0.5322,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2019_9306576\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,k,n) for (int i = k; i < (n); ++i)\\nconst long long MOD1 = 1000000007;\\nconst long long MOD2 = 998244353;\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\nconst long long INF = 1e17;\\n\\nint main(){\\n while(true){\\n int n,m;\\n cin >> n >> m;\\n if(n==0){\\n break;\\n }\\n \\n vector<int> d(n),p(n);\\n vector<int> denger(11);\\n for(int i=0;i<n;i++){\\n cin >> d[i] >> p[i];\\n denger[p[i]] += d[i];\\n }\\n\\n for(int i=10;i>=1;i--){\\n if(m-denger[i]>0){\\n m -= denger[i];\\n denger[i] = 0;\\n }\\n else{\\n denger[i] -= m;\\n m = 0;\\n }\\n }\\n\\n int sum = 0;\\n int len = 0;\\n for(int i=10;i>=1;i--){\\n sum += denger[i] * i;\\n len += denger[i];\\n }\\n\\n cout << sum << endl;\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3184,\n \"score_of_the_acc\": -0.1989,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2019_9291612\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n//#include <atcoder/all>\\nusing namespace std;\\n//using namespace atcoder;\\n\\n#define all(v) v.begin(),v.end()\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing vll=vector<ll>;\\nusing vvll = vector<vector<ll>>;\\nusing P = pair<ll,ll>;\\nusing vp=vector<pair<ll, ll>>;\\n//using mint=modint1000000007;\\n//using mint=modint998244353;\\n\\nconst ll INF=1ll<<60;\\nll mod10=1e9+7;\\nll mod99=998244353;\\nconst double PI = acos(-1);\\n\\n#define rep(i,n) for (ll i=0;i<n;++i)\\n#define per(i,n) for(ll i=n-1;i>=0;--i)\\n#define rep2(i,a,n) for (ll i=a;i<n;++i)\\n#define per2(i,a,n) for (ll i=a;i>=n;--i)\\n\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n\\nbool f(P A,P B){\\n return A.second>B.second;\\n}\\n\\nbool solve(){\\n ll N,M;cin>>N>>M;\\n if(N==0&&M==0) return 0;\\n\\n vp AB(N);rep(i,N) cin>>AB[i].first>>AB[i].second;\\n ll ans=0;\\n rep(i,N) ans+=AB[i].first*AB[i].second;\\n sort(all(AB),f);\\n rep(i,N){\\n if(AB[i].first<=M) M-=AB[i].first,ans-=AB[i].first*AB[i].second;\\n else ans-=M*AB[i].second,M=0;\\n }\\n\\n cout << ans << endl;\\n\\n\\n return 1;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n while(solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3612,\n \"score_of_the_acc\": -0.7292,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2019_9263028\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define all(a) a.begin(),a.end()\\n#define reps(i, a, n) for (int i = (a); i < (int)(n); i++)\\n#define rep(i, n) reps(i, 0, n)\\n#define rreps(i, a, n) for (int i = (a); i > (int)(n); i--)\\nconst long long mod = 1000000007;\\nconst long long INF = 1e18;\\n\\nll n,m;\\n\\nvoid solve() {\\n vector<ll> v (11,0);\\n int x,y;\\n rep(i,n) {\\n cin >> x >> y;\\n v[y] += x;\\n }\\n ll ans = 0;\\n rep(i,11) {\\n if (v[10-i] <= m) {\\n m -= v[10-i];\\n }\\n else {\\n ans += (v[10-i]-m)*(10-i);\\n m = 0;\\n }\\n }\\n cout << ans << endl;\\n return;\\n}\\n\\nint main() {\\n while (true) {\\n cin >> n >> m;\\n if (n == 0) {\\n return 0;\\n }\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3348,\n \"score_of_the_acc\": -0.4124,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2019_9126268\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n\\tint n,m;\\n\\tpair<int,int> a[10000];\\n\\tint d,p;\\n\\tint ans=0,cn;\\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++){\\n\\t\\t\\tcin>>d>>p;\\n\\t\\t\\ta[i]=make_pair(p,d);\\n\\t\\t\\tans+=d*p;\\n\\t\\t}\\n\\t\\tsort(a,a+n);\\n\\t\\treverse(a,a+n);\\n\\t\\tcn=0;\\n\\t\\twhile(m>0){\\n\\t\\t\\tif(m<a[cn].second){\\n\\t\\t\\t\\tans-=m*a[cn].first;\\n\\t\\t\\t\\tm=0;\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tans-=a[cn].first*a[cn].second;\\n\\t\\t\\t\\tm-=a[cn].second;\\n\\t\\t\\t}\\n\\t\\t\\tcn++;\\n\\t\\t\\tif(cn==n)break;\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t\\tans=0;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3212,\n \"score_of_the_acc\": -0.2354,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2019_8976190\",\n \"code_snippet\": \"// (◕ᴗ◕✿)\\n\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define rep(i, n) for (ll i = 0; i < (n); i++)\\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\\n#define len(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\nusing namespace std;\\ntemplate<typename T> using vc = vector<T>;\\ntemplate<typename T> using vv = vc<vc<T>>;\\ntemplate<typename T> using vvv = vv<vc<T>>;\\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nconst ld pi = 3.141592653589793;\\nconst int inf = 0x3f3f3f3f;\\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\\n// const ll mod = 1000000007;\\nconst ll mod = 998244353;\\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\\n\\n#define debug(var) do{std::cout << #var << \\\" : \\\\n\\\";view(var);}while(0)\\ntemplate<typename T> void view(T e){cout << e << endl;}\\ntemplate<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << \\\" \\\"; } cout << endl;}\\ntemplate<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }\\n\\nll solve(int N, ll M){\\n vc<pair<ll, ll>> pd(N);\\n rep(i, N) cin >> pd[i].second >> pd[i].first;\\n sort(all(pd), [&](auto i, auto j){return i > j;});\\n ll ans = 0;\\n for (auto [p, d] : pd){\\n ll tmp = min(d, M);\\n d -= tmp;\\n M -= tmp;\\n ans += p * d;\\n }\\n return ans;\\n}\\n\\nint main(){\\n vc<ll> ans;\\n while (true){\\n int N; ll M; cin >> N >> M;\\n if (N == 0) break;\\n ans.push_back(solve(N, M));\\n }\\n for (auto x : ans) cout << x << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3220,\n \"score_of_the_acc\": -0.2458,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1057,"cells":{"group_id":{"kind":"string","value":"aoj_2022_cpp"},"problem_description":{"kind":"string","value":"Princess, a Cryptanalyst\nお姫様の暗号解読\nEnglish text is not available in this practice contest.\nある貧乏な国のおてんばで勇敢なお姫様は，お忍びで出かけた町である日本語で書かれた古文書を手に入れた．お姫様は日本語ができるため，さっそくこの古文書を読んでみた．すると，驚くべき事が分かった．この古文書は，古の秘宝の在処を示していたのである．ところが，秘宝の在処は暗号になっており，容易には分からないようになっていた．そこでお姫様は，従者であるあなたに暗号の解読を手伝うように命令を下した．\nあなたはお姫様を助けるため昼夜を問わず調査を行った．その結果，Shortest Secret String (SSS) と呼ばれる文字列が解読に重要な役割を果たすことがわかった．ここで SSS とは，\nN\n個の単語全部を部分文字列として含み，なおかつその長さが最小であるような文字列である．\nあなたの仕事は，\nN\n個の単語から SSS を見つけ出す事である．\nInput\n入力は複数のデータセットで与えられる．データセットの初めの一行は，データセットに含まれる単語の数\nN\n(1≦\nN\n≦10)が与えられる．続く\nN\n行に単語が与えられる．最後のデータセットの後に，0のみを含む一行が与えられる．\nなお，入力で与えられる単語はアルファベット小文字のみからなり，長さは高々10であることが保証されている．\nOutput\n各データセットについてSSS を一行に出力せよ．また，複数ある場合は辞書式順序で最小のものを出力せよ．\nSample Input\n4\napple\nlength\nthings\nthin\n2\nicp\ncpc\n3\nzeta\neta\nalphabet\n2\nuntil\ntill\n0\nOutput for the Sample Input\napplengthings\nicpc\nzetalphabet\nuntill"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2022_5538521","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 110;\nint main(){\n while (true){\n int N;\n cin >> N;\n if (N == 0){\n break;\n }\n vector<string> S(N);\n for (int i = 0; i < N; i++){\n cin >> S[i];\n }\n sort(S.begin(), S.end());\n S.erase(unique(S.begin(), S.end()), S.end());\n N = S.size();\n vector<string> T;\n for (int i = 0; i < N; i++){\n bool ok = true;\n int L1 = S[i].size();\n for (int j = 0; j < N; j++){\n if (i != j){\n int L2 = S[j].size();\n for (int k = 0; k <= L2 - L1; k++){\n if (S[j].substr(k, L1) == S[i]){\n ok = false;\n }\n }\n }\n }\n if (ok){\n T.push_back(S[i]);\n }\n }\n N = T.size();\n vector<vector<int>> d(N, vector<int>(N));\n for (int i = 0; i < N; i++){\n for (int j = 0; j < N; j++){\n int L1 = T[i].size();\n int L2 = T[j].size();\n for (int k = 0; k <= min(L1, L2); k++){\n if (T[i].substr(L1 - k) == T[j].substr(0, k)){\n d[i][j] = L2 - k;\n }\n }\n }\n }\n vector<vector<string>> dp(1 << N, vector<string>(N, string(INF, ' ')));\n for (int i = 0; i < N; i++){\n dp[1 << i][i] = T[i];\n }\n for (int i = 0; i < (1 << N); i++){\n for (int j = 0; j < N; j++){\n if ((i >> j & 1) == 1){\n for (int k = 0; k < N; k++){\n if ((i >> k & 1) == 0){\n int i2 = i | (1 << k);\n string t = dp[i][j] + T[k].substr(T[k].size() - d[j][k]);\n if (dp[i2][k].size() > t.size() || dp[i2][k].size() == t.size() && dp[i2][k] > t){\n dp[i2][k] = t;\n }\n }\n }\n }\n }\n }\n string ans(INF, ' ');\n for (int i = 0; i < N; i++){\n \tif (ans.size() > dp[(1 << N) - 1][i].size() || ans.size() == dp[(1 << N) - 1][i].size() && ans > dp[(1 << N) - 1][i]){\n \t ans = dp[(1 << N) - 1][i];\n \t}\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":5040,"score_of_the_acc":-0.0323,"final_rank":5},{"submission_id":"aoj_2022_4931111","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint dp[1<<14][14];\nint len[14][14];\n\nint main(){\n int n;\n while(cin >> n,n){\n for(int i=0;i<(1<<n);i++){\n for(int j=0;j<n;j++){\n dp[i][j]=1e9;\n }\n }\n vector<string> s(n);\n for(int i=0;i<n;i++){\n cin >> s[i];\n }\n sort(s.begin(), s.end());\n s.erase(unique(s.begin(), s.end()),s.end());\n n=s.size();\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n if(i==j)len[i][j]=s[j].size();\n else{\n int cnt=0;\n int p=s[j].size();\n for(int k=0;k<min(s[i].size(),s[j].size());k++){\n if(s[j].substr(0,k+1)==s[i].substr((int)s[i].size()-1-k))cnt=k+1;\n }\n len[i][j]=p-cnt;\n }\n }\n }\n vector<bool> notuse(n,false);\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n if(i==j)continue;\n for(int k=0;k+(int)(s[j].size())-1<s[i].size();k++){\n if(s[i].substr(k,(int)(s[j].size()))==s[j])notuse[j]=true;\n }\n }\n }\n int aa=0;\n for(int i=0;i<n;i++){\n if(notuse[i])aa+=(1<<i);\n }\n for(int i=0;i<n;i++){\n if(notuse[i])continue;\n dp[aa+(1<<i)][i]=(int)s[i].size();\n }\n int res=1e9;\n for(int i=0;i<(1<<n);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]+len[j][k]);\n }\n }\n }\n for(int i=0;i<n;i++){\n res=min(res,dp[(1<<n)-1][i]);\n }\n vector<string> V;\n auto con=[&](vector<int> id)->string{\n reverse(id.begin(), id.end());\n string ans=s[id[0]];\n for(int i=1;i<id.size();i++){\n int p=id[i-1],c=id[i];\n for(int j=(int)s[c].size()-len[p][c];j<(int)s[c].size();j++){\n ans+=s[c][j];\n }\n }\n return ans;\n };\n auto dfs=[&](auto dfs,vector<int> &v,int bit,int last)->void{\n if(bit-(1<<last)==aa){\n V.push_back(con(v)); return;\n }\n for(int i=0;i<n;i++){\n if((1<<i)&aa)continue;\n if(i==last)continue;\n if((1<<i)&bit){\n if(dp[bit-(1<<last)][i]+len[i][last]==dp[bit][last]){\n v.push_back(i);\n dfs(dfs,v,bit-(1<<last),i);\n v.pop_back();\n }\n }\n }\n return;\n };\n for(int i=0;i<n;i++){\n if((1<<i)&aa)continue;\n if(dp[(1<<n)-1][i]==res){\n vector<int> v={i};\n dfs(dfs,v,(1<<n)-1,i);\n }\n }\n sort(V.begin(), V.end());\n cout << V[0] << endl;\n }\n}","accuracy":1,"time_ms":480,"memory_kb":51140,"score_of_the_acc":-0.8672,"final_rank":16},{"submission_id":"aoj_2022_4931110","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint dp[1<<14][14];\nint len[14][14];\n\nint main(){\n int n;\n while(cin >> n,n){\n for(int i=0;i<(1<<n);i++){\n for(int j=0;j<n;j++){\n dp[i][j]=1e9;\n }\n }\n vector<string> s(n);\n for(int i=0;i<n;i++){\n cin >> s[i];\n }\n sort(s.begin(), s.end());\n s.erase(unique(s.begin(), s.end()),s.end());\n n=s.size();\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n if(i==j)len[i][j]=s[j].size();\n else{\n int cnt=0;\n int p=s[j].size();\n for(int k=0;k<min(s[i].size(),s[j].size());k++){\n if(s[j].substr(0,k+1)==s[i].substr((int)s[i].size()-1-k))cnt=k+1;\n }\n len[i][j]=p-cnt;\n }\n }\n }\n vector<bool> notuse(n,false);\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n if(i==j)continue;\n for(int k=0;k+(int)(s[j].size())-1<s[i].size();k++){\n if(s[i].substr(k,(int)(s[j].size()))==s[j])notuse[j]=true;\n }\n }\n }\n int aa=0;\n for(int i=0;i<n;i++){\n if(notuse[i])aa+=(1<<i);\n }\n for(int i=0;i<n;i++){\n if(notuse[i])continue;\n dp[aa+(1<<i)][i]=(int)s[i].size();\n }\n int res=1e9;\n for(int i=0;i<(1<<n);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]+len[j][k]);\n }\n }\n }\n for(int i=0;i<n;i++){\n res=min(res,dp[(1<<n)-1][i]);\n }\n vector<string> V;\n auto con=[&](vector<int> id)->string{\n reverse(id.begin(), id.end());\n string ans=s[id[0]];\n for(int i=1;i<id.size();i++){\n int p=id[i-1],c=id[i];\n for(int j=(int)s[c].size()-len[p][c];j<(int)s[c].size();j++){\n ans+=s[c][j];\n }\n }\n return ans;\n };\n auto dfs=[&](auto dfs,vector<int> &v,int bit,int last)->void{\n if(bit-(1<<last)==aa){\n V.push_back(con(v)); return;\n }\n for(int i=0;i<n;i++){\n if((1<<i)&aa)continue;\n if(i==last)continue;\n if((1<<i)&bit){\n if(dp[bit-(1<<last)][i]+len[i][last]==dp[bit][last]){\n v.push_back(i);\n dfs(dfs,v,bit-(1<<last),i);\n v.pop_back();\n }\n }\n }\n return;\n };\n for(int i=0;i<n;i++){\n if((1<<i)&aa)continue;\n if(dp[(1<<n)-1][i]==res){\n vector<int> v={i};\n dfs(dfs,v,(1<<n)-1,i);\n }\n }\n // for(int _=0;_<n;_++){\n // if(res==dp[(1<<n)-1][_]){\n // int curid=_,cur=(1<<n)-1;\n // vector<int> id;\n // while(1){\n // id.push_back(curid);\n // int nx=pre[cur][curid];\n // if(nx<0)break;\n // cur-=(1<<curid);\n // curid=nx;\n // }\n // reverse(id.begin(), id.end());\n // string ans=s[id[0]];\n // for(int i=1;i<id.size();i++){\n // int p=id[i-1];\n // int c=id[i];\n // for(int j=(int)s[c].size()-len[p][c];j<(int)s[c].size();j++){\n // ans+=s[c][j];\n // }\n // }\n // v.push_back(ans);\n // }\n // }\n\n sort(V.begin(), V.end());\n cout << V[0] << endl;\n }\n}","accuracy":1,"time_ms":480,"memory_kb":51168,"score_of_the_acc":-0.8677,"final_rank":17},{"submission_id":"aoj_2022_4911241","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-10, PI = acos(-1);\n//ここから編集\nstruct RollingHash{\n\n using ull = unsigned long long;\n const ull mod = (1ULL << 61) - 1;\n const ull MASK30 = (1ULL << 30) - 1;\n const ull MASK31 = (1ULL << 31) - 1;\n\n const ull MASK61 = mod;\n\n ull base;\n int n;\n vector<ull> hash, pow;\n\n RollingHash(){}\n RollingHash(string s)\n {\n random_device rnd;\n mt19937_64 mt(rnd());\n base = MOD;\n \n n = (int)s.size();\n hash.assign(n+1, 0);\n pow.assign(n+1, 1);\n \n for(int i=0; i<n; i++){\n hash[i+1] = calc_mod(mul(hash[i], base) + s[i]);\n pow[i+1] = calc_mod(mul(pow[i], base));\n }\n }\n\n ull calc_mod(ull x){\n ull xu = x >> 61;\n ull xd = x & MASK61;\n ull res = xu + xd;\n if(res >= mod) res -= mod;\n return res;\n }\n\n ull mul(ull a, ull b){\n ull au = a >> 31;\n ull ad = a & MASK31;\n ull bu = b >> 31;\n ull bd = b & MASK31;\n ull mid = ad * bu + au * bd;\n ull midu = mid >> 30;\n ull midd = mid & MASK30;\n return calc_mod(au * bu * 2 + midu + (midd << 31) + ad * bd);\n }\n\n //[l,r)のハッシュ値\n inline ull get(int l, int r){\n ull res = calc_mod(hash[r] + mod*3-mul(hash[l], pow[r-l]));\n return res;\n }\n\n //string tのハッシュ値\n inline ull get(string t){\n ull res = 0;\n for(int i=0; i<t.size(); i++){\n res = calc_mod(mul(res, base)+t[i]);\n }\n return res;\n }\n\n //string s中のtの数をカウント\n inline int count(string t) {\n if(t.size() > n) return 0;\n auto hs = get(t);\n int res = 0;\n for(int i=0; i<n-t.size()+1; i++){\n if(get(i, i+t.size()) == hs) res++; \n }\n return res;\n }\n\n inline ull concat(ull h1, ull h2, int h2len){\n return calc_mod(h2 + mul(h1, pow[h2len]));\n }\n\n // LCPを求める S[a:] T[b:]\n inline int LCP(int a, int b){\n int len = min((int)hash.size()-a, (int)hash.size()-b);\n \n int lb = -1, ub = len;\n while(ub-lb>1){\n int mid = (lb+ub)/2;\n\n if(get(a, a+mid) == get(b, b+mid)) lb = mid;\n else ub = mid;\n }\n return lb;\n }\n RollingHash& operator=(const RollingHash&) { return *this; }\n};\n\nbool max(const string& s, const string& t){\n \n if(s.size() < t.size()) return false;\n else if(s.size() > t.size()) return true;\n for(int i=0; i<s.size(); i++){\n if(s[i] > t[i]) return true;\n else if(s[i] < t[i]) return false;\n }\n return false;\n}\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n \n int n; \n while(cin >> n, n){\n vector<string> v(n);\n REP(i,n) cin >> v[i];\n REP(i,n) {\n RollingHash rh(v[i]);\n \n }\n vector<vector<string>> dp(n, vector<string>(1<<n, \"~\"));\n dp[0][0] = \"\";\n for(int i=0; i<n; i++){\n dp[i][(1<<i)] = v[i];\n }\n REP(bit,(1<<n)){\n\n for(int i=0; i<n; i++){\n if(dp[i][bit] == \"~\") continue;\n if(bit >> i & 1){\n\n for(int j=0; j<n; j++){\n if(!(bit >> j & 1)){\n\n /* dp[i][bit]にvjをくっつける */\n string s = dp[i][bit];\n string t = v[j];\n RollingHash rh(s);\n RollingHash rh2(t);\n int mx = 0;\n \n for(int k=1; k<=min(s.size(), t.size()); k++){\n if(rh.get(s.size()-k, s.size()) == rh2.get(0, k)) mx = max(mx, k);\n }\n \n if(rh.count(t)){\n /* dp[j][bit | (1 << j)]とdp[i][bit]の大きさを比較 */\n\n if(dp[j][bit | (1 << j)] == \"~\") dp[j][bit | (1 << j)] = dp[i][bit];\n else{ \n if(max(dp[j][bit | (1 << j)], dp[i][bit])){\n dp[j][bit|(1<<j)] = dp[i][bit];\n }\n }\n }else{\n string nx = s + t.substr(mx, t.size()-mx);\n /* dp[j][bit | (1 << j)]とnxの大きさを比較 */\n\n if(dp[j][bit | (1 << j)] == \"~\") dp[j][bit | (1 << j)] = nx;\n else{\n if(max(dp[j][bit | (1 << j)], nx)){\n dp[j][bit|(1<<j)] = nx;\n }\n }\n }\n }\n }\n }\n }\n }\n string ans = \"~\";\n for(int i=0; i<n; i++){\n if(ans == \"~\") ans = dp[i][(1<<n)-1];\n else if(max(ans, dp[i][(1<<n)-1])){\n ans = dp[i][(1<<n)-1];\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":470,"memory_kb":3516,"score_of_the_acc":-0.0724,"final_rank":9},{"submission_id":"aoj_2022_4804724","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nbool contains(string a, string b){\n int n = a.length();\n int m = b.length();\n if(n < m) return false;\n for(int i=0; i<n-m+1; i++){\n if(b == a.substr(i, m)){\n return true;\n }\n }\n return false;\n}\nint match(string a, string b){\n int n = a.length();\n int m = b.length();\n for(int i=0; i<n; i++){\n if(m < n-i) continue;\n if(a.substr(i, n-i) == b.substr(0, n-i)){\n return n-i;\n }\n }\n return 0;\n}\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n vector<string> s(n);\n for(int i=0; i<n; i++){\n cin >> s[i];\n }\n for(int i=n-1; i>=0; i--){\n for(int j=0; j<n; j++){\n if(i == j) continue;\n if(contains(s[j], s[i])){\n s.erase(s.begin()+i);\n n--;\n break;\n }\n }\n }\n int sum = 0;\n for(auto str: s){\n sum += str.length();\n }\n vector<vector<int>> a(n, vector<int>(n));\n for(int i=0; i<n; i++){\n for(int j=0; j<n; j++){\n a[i][j] = match(s[i], s[j]);\n }\n }\n vector<vector<string>> dp(1<<n, vector<string>(n, \"\"));\n for(int i=0; i<n; i++){\n dp[1<<i][i] = s[i];\n }\n for(int i=0; i<(1<<n); i++){\n for(int j=0; j<n; j++){\n if(!(i>>j&1)) continue;\n for(int k=0; k<n; k++){\n if(i>>k&1) continue;\n int ni = i | (1<<k);\n string ns = dp[i][j] +s[k].substr(a[j][k], (int)s[k].length()-a[j][k]);\n if(dp[ni][k] == \"\") dp[ni][k] = ns;\n if(dp[ni][k] == \"\" or ns.length() < dp[ni][k].length() or\n (ns.length() == dp[ni][k].length() and ns < dp[ni][k])){\n dp[ni][k] = ns;\n }\n }\n }\n }\n string ans(100, 'z');\n for(string str: dp.back()){\n if(str == \"\") continue;\n if(str.length() < ans.length() or (str.length()==ans.length() and str<ans)){\n ans = str;\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3440,"score_of_the_acc":-0.0071,"final_rank":1},{"submission_id":"aoj_2022_3875221","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nbool contains(string str, string pre){\n int s = str.length(), p = pre.length();\n if(s < p) return false;\n\n for(int i = 0; i <= s - p; i++){\n int j;\n for(j = 0; j < p; j++){ \n if(str[i+j] != pre[j]) break;\n }\n if(j == p) return true;\n }\n\n return false;\n}\n\ntypedef unsigned long long ull;\null x = 1000000007;\n\nint f(string s, string t){\n int k = min(s.length(), t.length()), slen = s.length();\n int ret = 0;\n ull a = 0, b = 0, tmp = 1;\n for(int i = 1; i <= k; i++){\n a = a + s[slen-i]*tmp;\n b = b*x + t[i-1];\n if(a == b) ret = i;\n tmp *= x;\n }\n return ret;\n}\n\nint main(){\n int n;\n while(cin >> n, n){\n vector<string> v;\n for(int i = 0; i < n; i++){\n string s; cin >> s;\n v.push_back(s);\n }\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n n = v.size();\n vector<string> x;\n for(int i = 0; i < n; i++){\n bool valid = true;\n for(int j = 0; j < n; j++){\n if(i == j) continue;\n if(contains(v[j], v[i])) valid = false;\n }\n if(valid) x.push_back(v[i]);\n }\n int n = x.size();\n vector<vector<string>> dp(n, vector<string>(1<<n, \"\"));\n for(int i = 0; i < n; i++) dp[i][1<<i] = x[i];\n for(int s = 1; s < 1<<n; s++){\n for(int i = 0; i < n; i++){\n if(((s>>i)&1) == 0) continue;\n for(int j = 0; j < n; j++){\n if((s>>j)&1) continue;\n string tmp = dp[i][s];\n tmp += x[j].substr(f(dp[i][s], x[j]));\n int nbit = s + (1<<j);\n if(dp[j][nbit] == \"\" || tmp.length() < dp[j][nbit].length() || (tmp.length()==dp[j][nbit].length() && tmp < dp[j][nbit])){\n dp[j][nbit] = tmp;\n }\n }\n }\n }\n string ans = dp[0].back();\n for(int i = 1; i < n; i++){\n if(ans.length() > dp[i].back().length() || (ans.length()==dp[i].back().length() && ans > dp[i].back())){\n ans = dp[i].back();\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3412,"score_of_the_acc":-0.0095,"final_rank":2},{"submission_id":"aoj_2022_3504590","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) repi(i,0,n)\n#define repi(i,a,b) for(int i=(int)(a);i < (int)(b);++i)\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 Key,class Value> ostream& operator << (ostream &s, map<Key,Value> M)\n{ for ( auto itr = begin(M); itr != end(M); ++itr) { s << itr->first << \":\" << itr->second; } return s;}\nvoid print(const std::vector<int>& v)\n{\n std::for_each(v.begin(), v.end(), [](int x) {\n std::cout << x << \" \";\n });\n std::cout << std::endl;\n}\nbool is_sub(string s1,string s2) {\n int s1_size = s1.size();\n int s2_size = s2.size();\n if (s1_size > s2_size) {\n rep(i,s1_size-s2_size + 1) {\n bool flg = true;\n rep(j,s2_size) {\n if (s1[i+j] != s2[j]) {\n flg = false;\n break;\n }\n }\n if (flg) return true;\n }\n return false;\n }\n else {\n rep(i,s2_size-s1_size + 1) {\n bool flg = true;\n rep(j,s1_size) {\n if (s2[i+j] != s1[j]) {\n flg = false;\n break;\n }\n }\n if (flg) return true;\n }\n return false;\n }\n}\n\nint main() {\n while (true) {\n int n = 0;\n cin >> n;\n if (n == 0) {\n break;\n }\n long init = 0;\n vector<string> S(n);\n rep(i,n) cin >> S[i];\n rep(i,n-1) {\n repi(j,i+1,n) {\n // cout << is_sub(S[i],S[j]) << \" \" << i << \" \" << j << endl;\n if( is_sub(S[i],S[j]) ) {\n if (S[i].size() > S[j].size()) init |= (1 << j);\n else init |= (1 << i);\n }\n }\n }\n\n\n vector<int> v;\n rep(i,n) {\n if (!((init >> i) & 1)) v.push_back(i);\n }\n //cout << v << endl;\n // cout << v << endl;\n\n // suffix,prefix計算\n vector<vector<string>> preffix(n),suffix(n);\n rep(i,n) {\n if (((init >> i) & 1)) continue;\n preffix[i] = vector<string>(S[i].size()+1,\"\");\n suffix[i] = vector<string>(S[i].size()+1,\"\");\n rep(j, S[i].size()) {\n repi(k,j+1,S[i].size()+1) {\n preffix[i][k] += S[i][j];\n suffix[i][k] = S[i][S[i].size()-1-j] + suffix[i][k];\n }\n }\n }\n\n int string_num = v.size();\n string ans = \"77\";\n \n do {\n string cur = S[v[0]];\n rep(i, string_num-1) {\n int s_size = min(S[v[i]].size(),S[v[i+1]].size());\n rep(j,s_size) {\n //cout << suffix[v[i]][s_size-1-j] << \" \" << preffix[v[i+1]][s_size-1-j] << endl;;\n if (suffix[v[i]][s_size-1-j] == preffix[v[i+1]][s_size-1-j]) {\n //cout << cur << \" \" << suffix[v[i+1]][S[v[i+1]].size()-j] << endl;\n \n int match = s_size - 1 - j;\n cur += suffix[v[i+1]][S[v[i+1]].size()-match];\n break;\n }\n }\n }\n if (ans == \"77\" || ans.size() > cur.size() || ( ans.size() == cur.size() && ans > cur)) ans = cur;\n } while (next_permutation(v.begin(), v.end()));\n \n cout << ans << endl;\n\n\n \n\n \n \n }\n}","accuracy":1,"time_ms":4390,"memory_kb":3160,"score_of_the_acc":-0.624,"final_rank":15},{"submission_id":"aoj_2022_3324384","code_snippet":"#include <bits/stdc++.h>\n\n#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)\n#define RFOR(i,a) for(int i=(a); i >= 0; --i)\n#define FOE(i,a) for(auto i : a)\n#define ALL(c) (c).begin(), (c).end()\n#define RALL(c) (c).rbegin(), (c).rend()\n#define DUMP(x) cerr << #x << \" = \" << (x) << endl;\n#define SUM(x) std::accumulate(ALL(x), 0LL)\n#define MIN(v) *std::min_element(v.begin(), v.end())\n#define MAX(v) *std::max_element(v.begin(), v.end())\n#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())\n#define BIT_ON(bit, i) (bit & (1LL << i))\n\ntypedef long long LL;\ntemplate<typename T> using V = std::vector<T>;\ntemplate<typename T> using VV = std::vector<std::vector<T>>;\ntemplate<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;\ntemplate<typename T> using VVVV = std::vector<std::vector<std::vector<std::vector<T>>>>;\n\ntemplate<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }\ntemplate<class T> inline void print(T x) { std::cout << x << std::endl; }\ntemplate<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) { if (i != 0) {std::cout << \" \";} std::cout << v[i];} std::cout << \"\\n\"; }\ntemplate<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }\ntemplate<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }\ntemplate<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }\ntemplate<class T> inline std::vector<T> unique(std::vector<T> v) {\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n return v;\n}\n\nconst int INF = 1 << 30;\nconst double EPS = 1e-9;\nconst std::string YES = \"YES\", Yes = \"Yes\", NO = \"NO\", No = \"No\";\nconst std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 }; // 4近傍（右, 下, 左, 上）\nconst std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };\n\nusing namespace std;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while (true) {\n int N;\n cin >> N;\n if (N == 0) {\n break;\n }\n\n V<string> tmp;\n FOR(i, 0, N) {\n string S;\n cin >> S;\n tmp.emplace_back(S);\n }\n\n tmp = unique(tmp);\n\n V<string> v;\n FOR(i, 0, tmp.size()) {\n string s = tmp[i];\n bool ok = true;\n\n FOR(j, 0, tmp.size()) {\n string t = tmp[j];\n if (i == j) {\n continue;\n }\n\n if (t.find(s) != string::npos) {\n ok = false;\n }\n }\n if (ok) {\n v.emplace_back(s);\n }\n }\n VV<string> memo(v.size(), V<string>(v.size(), \"\"));\n FOR(i, 0, v.size()) {\n string s = v[i];\n FOR(j, 0, v.size()) {\n string t = v[j];\n\n int same = 0;\n for (int n = v[j].size(); n >= 0; --n) {\n\n bool ok = true;\n FOR(k, 0, n) {\n if (s[s.size() - n + k] != t[k]) {\n ok = false;\n break;\n }\n }\n if (ok) {\n same = n;\n break;\n }\n }\n string ans = \"\";\n FOR(k, same, t.size()) {\n ans += t[k];\n }\n memo[i][j] = ans;\n }\n }\n\n string ans = \"\";\n FOR(i, 0, 110) {\n ans += \"z\";\n }\n\n V<int> idx(v.size());\n iota(ALL(idx), 0);\n\n do {\n string t = v[idx[0]];\n FOR(i, 1, v.size()) {\n t += memo[idx[i - 1]][idx[i]];\n if (t.size() > ans.size()) {\n break;\n }\n }\n\n if (t.size() == ans.size()) {\n ans = min(ans, t);\n }\n else if (t.size() < ans.size()) {\n ans = t;\n }\n } while(next_permutation(ALL(idx)));\n\n print(ans);\n }\n\n return 0;\n}","accuracy":1,"time_ms":2000,"memory_kb":3192,"score_of_the_acc":-0.2846,"final_rank":13},{"submission_id":"aoj_2022_3324348","code_snippet":"#include <bits/stdc++.h>\n\n#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)\n#define RFOR(i,a) for(int i=(a); i >= 0; --i)\n#define FOE(i,a) for(auto i : a)\n#define ALL(c) (c).begin(), (c).end()\n#define RALL(c) (c).rbegin(), (c).rend()\n#define DUMP(x) cerr << #x << \" = \" << (x) << endl;\n#define SUM(x) std::accumulate(ALL(x), 0LL)\n#define MIN(v) *std::min_element(v.begin(), v.end())\n#define MAX(v) *std::max_element(v.begin(), v.end())\n#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())\n#define BIT_ON(bit, i) (bit & (1LL << i))\n#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());\n\ntypedef long long LL;\ntemplate<typename T> using V = std::vector<T>;\ntemplate<typename T> using VV = std::vector<std::vector<T>>;\ntemplate<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;\ntemplate<typename T> using VVVV = std::vector<std::vector<std::vector<std::vector<T>>>>;\n\ntemplate<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }\ntemplate<class T> inline void print(T x) { std::cout << x << std::endl; }\ntemplate<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) { if (i != 0) {std::cout << \" \";} std::cout << v[i];} std::cout << \"\\n\"; }\ntemplate<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }\ntemplate<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }\ntemplate<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }\n\nconst int INF = 1 << 30;\nconst double EPS = 1e-9;\nconst std::string YES = \"YES\", Yes = \"Yes\", NO = \"NO\", No = \"No\";\nconst std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 }; // 4近傍（右, 下, 左, 上）\nconst std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };\n\nusing namespace std;\n\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while (true) {\n int N;\n cin >> N;\n if (N == 0) {\n break;\n }\n\n V<string> tmp;\n FOR(i, 0, N) {\n string S;\n cin >> S;\n tmp.emplace_back(S);\n }\n\n sort(ALL(tmp));\n tmp.erase(unique(ALL(tmp)), tmp.end());\n\n V<string> v;\n FOR(i, 0, tmp.size()) {\n string s = tmp[i];\n bool ok = true;\n\n FOR(j, 0, tmp.size()) {\n string t = tmp[j];\n if (i == j) {\n continue;\n }\n\n if (t.find(s) != string::npos) {\n ok = false;\n }\n }\n if (ok) {\n v.emplace_back(s);\n }\n }\n VV<string> memo(v.size(), V<string>(v.size(), \"\"));\n FOR(i, 0, v.size()) {\n string s = v[i];\n FOR(j, 0, v.size()) {\n string t = v[j];\n\n int same = 0;\n for (int n = v[j].size(); n >= 0; --n) {\n\n bool ok = true;\n FOR(k, 0, n) {\n if (s[s.size() - n + k] != t[k]) {\n ok = false;\n break;\n }\n }\n if (ok) {\n same = n;\n break;\n }\n }\n string ans = \"\";\n FOR(k, same, t.size()) {\n ans += t[k];\n }\n memo[i][j] = ans;\n }\n }\n\n string ans = \"\";\n FOR(i, 0, 110) {\n ans += \"z\";\n }\n\n V<int> idx(v.size());\n iota(ALL(idx), 0);\n\n do {\n string t = v[idx[0]];\n FOR(i, 1, v.size()) {\n t += memo[idx[i - 1]][idx[i]];\n if (t.size() > ans.size()) {\n break;\n }\n }\n\n if (t.size() == ans.size()) {\n ans = min(ans, t);\n }\n else if (t.size() < ans.size()) {\n ans = t;\n }\n } while(next_permutation(ALL(idx)));\n\n print(ans);\n }\n\n return 0;\n}","accuracy":1,"time_ms":2020,"memory_kb":3188,"score_of_the_acc":-0.2874,"final_rank":14},{"submission_id":"aoj_2022_2542383","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\tshort state;\n\tshort num_used,total_length;\n\tll order;\n};\n\nint N,match_len[10][10],POW[12];\nchar first_words[10][11],words[10][11];\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 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\nint strCmp2(char* left,char* right){\n\tint i;\n\n\tif(strCmp(left,right))return 3;\n\n\tfor(i=0;left[i] != '\\0' && right[i] != '\\0'; i++){\n\t\tif(left[i] != right[i]){\n\t\t\tif(left[i] < right[i])return 1;\n\t\t\telse{\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t}\n\t}\n\tif(left[i] == '\\0')return 1;\n\telse{\n\t\treturn 2;\n\t}\n}\n\nvoid func(){\n\n\tint words_index = 0,first_length[N],second_length[N];\n\n\tint tmp;\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%s\",first_words[i]);\n\t\tfor(tmp = 0; first_words[i][tmp] != '\\0';tmp++);\n\t\tfirst_length[i] = tmp;\n\t}\n\n\tint i_index,k_index,delete_num = 0;\n\tbool FLG;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tFLG = true;\n\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tif(first_words[k][0] == '\\0')continue;\n\t\t\tif(i != k && first_length[i] <= first_length[k]){\n\n\t\t\t\tfor(int start = 0; start + first_length[i] <= first_length[k]; start++){\n\n\t\t\t\t\tfor(i_index = 0,k_index = 0; i_index < first_length[i]\n\t\t\t\t\t\t\t&& first_words[i][i_index] == first_words[k][start+k_index]; i_index++,k_index++);\n\n\t\t\t\t\tif(i_index == first_length[i]){\n\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\t\t\tif(!FLG)break;\n\t\t}\n\n\t\tif(FLG){\n\t\t\tsecond_length[words_index] = first_length[i];\n\t\t\tstrcpy(words[words_index++],first_words[i]);\n\t\t}else{\n\t\t\tfirst_words[i][0] = '\\0';\n\t\t\tdelete_num++;\n\t\t}\n\t}\n\n\tN -= delete_num;\n\n\tint common,tmp_common;\n\n\tfor(int left = 0;left < N; left++){\n\t\tfor(int right = 0; right < N; right++){\n\t\t\tif(left != right){\n\n\t\t\t\tcommon = 0;\n\n\t\t\t\tfor(int start = 0; start < second_length[left]; start++){\n\t\t\t\t\tfor(tmp_common = 0; tmp_common < second_length[right] && start+tmp_common < second_length[left] &&\n\t\t\t\t\t\t\twords[left][start+tmp_common] == words[right][tmp_common]; tmp_common++);\n\n\t\t\t\t\tif(start+tmp_common == second_length[left]){\n\t\t\t\t\t\tcommon = tmp_common;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tmatch_len[left][right] = common;\n\t\t\t}\n\t\t}\n\t}\n\n\tqueue<Info> Q;\n\n\tfor(int i = 0; i < N; i++){\n\t\tInfo new_info;\n\t\tnew_info.state = POW[i];\n\t\tnew_info.num_used = 1;\n\t\tnew_info.order = i;\n\t\tnew_info.total_length = second_length[i];\n\t\tQ.push(new_info);\n\t}\n\n\tint ans = BIG_NUM;\n\n\tchar ans_word[101],tmp_word[101];\n\tint work[N];\n\tstack<int> S;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.front().num_used == N){\n\n\t\t\tif(ans >= Q.front().total_length ){\n\n\t\t\t\tll work_num = Q.front().order;\n\t\t\t\tfor(int i = 0; i < N; i++){\n\t\t\t\t\tS.push(work_num%10);\n\t\t\t\t\twork_num /= 10;\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < N; i++){\n\t\t\t\t\twork[i] = S.top();\n\t\t\t\t\tS.pop();\n\t\t\t\t}\n\n\t\t\t\tstrcpy(tmp_word,words[work[0]]);\n\t\t\t\tint index = second_length[work[0]];\n\n\t\t\t\tint pre = work[0];\n\n\t\t\t\tfor(int i = 1; i < N; i++){\n\t\t\t\t\tfor(int k = match_len[pre][work[i]];words[work[i]][k] != '\\0'; k++){\n\t\t\t\t\t\ttmp_word[index++] = words[work[i]][k];\n\t\t\t\t\t}\n\t\t\t\t\tpre = work[i];\n\t\t\t\t}\n\n\t\t\t\ttmp_word[Q.front().total_length] = '\\0';\n\n\t\t\t\tif(ans > Q.front().total_length){\n\t\t\t\t\tans = Q.front().total_length;\n\t\t\t\t\tstrcpy(ans_word,tmp_word);\n\t\t\t\t}else{\n\t\t\t\t\tif(strCmp2(ans_word,tmp_word) == 2){\n\t\t\t\t\t\tstrcpy(ans_word,tmp_word);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}else if(Q.front().total_length >= ans){\n\t\t\tQ.pop();\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < N; i++){\n\t\t\t\tif(!(Q.front().state & (1 << i))){\n\t\t\t\t\tInfo new_info;\n\t\t\t\t\tnew_info.state = Q.front().state+POW[i];\n\t\t\t\t\tnew_info.num_used = Q.front().num_used+1;\n\t\t\t\t\tnew_info.order = 10*Q.front().order+i;\n\t\t\t\t\tnew_info.total_length = Q.front().total_length+second_length[i]\n\t\t\t\t\t\t\t\t-match_len[Q.front().order%10][i];\n\t\t\t\t\tQ.push(new_info);\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n\n\tprintf(\"%s\\n\",ans_word);\n}\n\nint main() {\n\n\tfor(int i = 0; i < 12; 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":520,"memory_kb":63124,"score_of_the_acc":-1.0725,"final_rank":20},{"submission_id":"aoj_2022_2521145","code_snippet":"#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nvector<string>s;\nint n;\nstring t,ans;\nmain(){\n\twhile(cin>>n,n){\n\t\tset<string>ss;\n\t\tans=\"zzzzzzzzzzzzzzzzzzzzzzzzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\";\n\t\tint p=0;\n\t\tvector<int>v;\n\t\ts.clear();\n\t\tr(i,n){\n\t\t\tcin>>t;\n\t\t\tif(!ss.count(t)){\n\t\t\t\ts.push_back(t);\n\t\t\t\tss.insert(t);\n\t\t\t}\n\t\t}\n\t\tr(i,s.size())r(j,s.size())if(i!=j&&s[i].size()>=s[j].size()){\n\t\t\tr(k,s[i].size()){\n\t\t\t\tint sum=0;\n\t\t\t\tif(k+s[j].size()<=s[i].size()){\n\t\t\t\tfor(int l=k;l-k<s[j].size();l++)\n\t\t\t\t\tif(s[i][l]==s[j][l-k])sum++;\n\t\t\t\tif(sum==s[j].size()){\n\t\t\t\t\tv.push_back(j);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}}\n\t\t}\n\t\tsort(v.begin(),v.end());\n\t\tv.erase(unique(v.begin(),v.end()),v.end());\n\t\tr(i,v.size()){\n\t\t\ts.erase(s.begin()+v[i]+p);\n\t\t\tp--;n--;\n\t\t}\n\t\tsort(s.begin(),s.end());\n\t\tdo{\n\t\t\tt=\"\";\n\t\t\tt+=s[0];\n\t\t\tfor(int i=1;i<s.size();i++){\n\t\t\t\tint sum=0;\n\t\t\t\tfor(int j=s[i-1].size()-1;j>=0;j--){\n\t\t\t\t\tint sum2=0,cnt=0;\n\t\t\t\t\tfor(int k=0;;k++){\n\t\t\t\t\t\tif(k+j>=s[i-1].size())break;\n\t\t\t\t\t\tif(s[i][k]==s[i-1][j+k])sum2++;\n\t\t\t\t\t\telse goto L;\n\t\t\t\t\t}\n\t\t\t\t\tif(!cnt)sum=max(sum,sum2);L:;\n\t\t\t\t}\n\t\t\t\tt+=s[i].substr(sum);\n\t\t\t}\n\t\t\tif(ans.size()>t.size())ans=t;\n\t\t\telse if(ans.size()==t.size()) ans=min(ans,t);\n\t\t}while(next_permutation(s.begin(),s.end()));\n\t\tcout<<ans<<endl;\n\t}\n}","accuracy":1,"time_ms":6770,"memory_kb":3180,"score_of_the_acc":-0.9629,"final_rank":18},{"submission_id":"aoj_2022_2414407","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing pii = pair<int,int>;\nusing ll = long long;\n#define rep(i, j) for(int i=0; i < (int)(j); i++)\n#define repeat(i, j, k) for(int i = (j); i < (int)(k); i++)\n#define all(v) v.begin(),v.end()\n//#define debug(x) cerr << #x << \" : \" << x << endl\n#define debug(...)\n\ntemplate<class T> bool set_min(T &a, const T &b) { return a > b ? a = b, true : false; }\ntemplate<class T> bool set_max(T &a, const T &b) { return a < b ? a = b, true : false; }\n// vector\ntemplate<class T> istream& operator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; }\ntemplate<class T> ostream& operator << (ostream &os , const vector<T> &v) { for(const T &t : v) os << \"\\t\" << t; return os << endl; }\n// pair\ntemplate<class T, class U> ostream& operator << (ostream &os , const pair<T, U> &v) { return os << \"<\" << v.first << \", \" << v.second << \">\"; }\n\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 60;\n\n\nclass Solver {\n public:\n int N;\n vector<string> S;\n bool contain(const string &s, const string &word) {\n rep(i, s.size()) {\n bool ok = true;\n rep(j, word.size()) {\n if(i + j >= s.size() or s[i + j] != word[j]) {\n ok = false; break;\n }\n }\n if(ok) return true;\n }\n return false;\n }\n vector<string> merge(const string &s, const string &word) {\n vector<string> res;\n repeat(i, s.size() - word.size(), s.size()) {\n if(i < 0) continue;\n bool ok = true;\n rep(j, word.size()) if(i + j < s.size() and s[i + j] != word[j]) ok = false;\n if(ok) {\n int same = s.size() - i;\n res.emplace_back(s + word.substr(same));\n }\n }\n res.emplace_back(s + word);\n return res;\n }\n string calc(const string &s, int flg) {\n debug(s);\n string res;\n rep(i, N) if(not (flg & (1 << i))) {\n auto t = merge(s, S[i]);\n for(string &tt : t) { \n string res2 = calc(tt, flg | (1 << i));\n if(res.size() == 0 or res2.size() < res.size()) res = res2;\n else if(res2.size() == res.size()) set_min(res, res2);\n }\n }\n if(res.size() > 0) return res;\n return s;\n }\n \n bool solve() {\n cin >> N;\n if(N == 0) return false; \n S.resize(N); cin >> S;\n vector<string> T;\n rep(i, N) {\n bool ok =true;\n rep(j, N) if(i != j) {\n if(S[i] == S[j]) {\n if(i > j) {\n ok = false;\n break;\n }\n }\n else if(contain(S[j], S[i])) {\n ok = false;\n break;\n } \n }\n if(ok) T.push_back(S[i]);\n }\n debug(N); debug(S); debug(T);\n swap(S, T);\n N = S.size();\n cout << calc(\"\", 0) << endl;\n return true;\n }\n};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n while(Solver().solve());\n return 0;\n}","accuracy":1,"time_ms":7040,"memory_kb":3104,"score_of_the_acc":-1.0001,"final_rank":19},{"submission_id":"aoj_2022_2413694","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <array>\n#include <set>\n#include <map>\n#include <queue>\n#include <tuple>\n#include <unordered_set>\n#include <unordered_map>\n#include <functional>\n#include <cassert>\n#define repeat(i, n) for (int i = 0; (i) < int(n); ++(i))\n#define repeat_from(i, m, n) for (int i = (m); (i) < int(n); ++(i))\n#define repeat_reverse(i, n) for (int i = (n)-1; (i) >= 0; --(i))\n#define repeat_from_reverse(i, m, n) for (int i = (n)-1; (i) >= int(m); --(i))\n#define whole(f, x, ...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)\n#define unittest_name_helper(counter) unittest_ ## counter\n#define unittest_name(counter) unittest_name_helper(counter)\n#define unittest __attribute__((constructor)) void unittest_name(__COUNTER__) ()\nusing ll = long long;\nusing namespace std;\ntemplate <class T> inline void setmax(T & a, T const & b) { a = max(a, b); }\ntemplate <class T> inline void setmin(T & a, T const & b) { a = min(a, b); }\ntemplate <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }\ntemplate <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }\n\nbool is_suffix(string const & a, string const & b) {\n if (a.length() > b.length()) return false;\n return b.compare(b.length() - a.length(), a.length(), a) == 0;\n}\nvoid setshort(string & a, string const & b) {\n if (a.empty() or b.length() < a.length() or (a.length() == b.length() and b < a)) {\n a = b;\n }\n}\n\nint main() {\nassert (string(\"puyopuyo\").find(\"yop\") != string::npos);\nassert (string(\"puyopuyo\").find(\"pop\") == string::npos);\nassert (string(\"puyopuyo\").find(\"aaa\") == string::npos);\nassert (string(\"puyo\").find(\"puyopuyo\") == string::npos);\n while (true) {\n // input\n int n; cin >> n;\n if (n == 0) break;\n vector<string> word(n); repeat (i, n) cin >> word[i];\n // solve\n vector<string> dp(1 << n);\n function<void (string const &, int)> go = [&](string const & s, int used) {\nrepeat (i, n) if (used & (1 << i)) {\nassert (s.find(word[i]) != string::npos);\n}\n repeat (i, n) if (not (used & (1 << i))) {\n if (s.find(word[i]) != string::npos) {\n used |= 1 << i;\n }\n }\n setshort(dp[used], s);\n repeat (i, n) if (not (used & (1 << i))) {\n repeat_from (sep, 1, word[i].length()) {\n if (is_suffix(word[i].substr(0, sep), s)) {\n go(s + word[i].substr(sep), used | (1 << i));\n }\n }\n }\n };\n repeat (i, n) {\n go(word[i], 1 << i);\n }\nrepeat (a, 1 << n) if (not dp[a].empty()) {\nrepeat (i, n) if (a & (1 << i)) {\nassert (dp[a].find(word[i]) != string::npos);\n}\n}\n// repeat (iteration, 3)\n repeat (a, 1 << n) if (not dp[a].empty()) {\n repeat (b, 1 << n) {\n if ((b | a) == a) {\n setshort(dp[b], dp[a]);\n }\n }\n }\n repeat_from (a, 1, 1 << n) {\n assert (not dp[a].empty());\n repeat (b, 1 << n) if (not dp[b].empty()) {\n if (not (a & b)) {\n setshort(dp[a | b], dp[a] + dp[b]);\n setshort(dp[a | b], dp[b] + dp[a]);\n }\n }\n }\nrepeat (a, 1 << n) if (not dp[a].empty()) {\nrepeat (i, n) if (a & (1 << i)) {\nassert (dp[a].find(word[i]) != string::npos);\n}\n}\n // output\nrepeat (i, n) {\nassert (dp[(1 << n) - 1].find(word[i]) != string::npos);\n}\n cout << dp[(1 << n) - 1] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3100,"score_of_the_acc":-0.0114,"final_rank":3},{"submission_id":"aoj_2022_2142742","code_snippet":"#include<bits/stdc++.h>\n#define MOD 1000000007\n#define INF 0x3f3f3f3f\n#define INFL 0x3f3f3f3f3f3f3f3f\n#define EPS (1e-10)\n#define rep(i,n)for(int i=0;i<n;i++)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int>P;\n\nstring s[10];\nstring dp[1 << 10][10];\nint main() {\n\tint n;\n\tstring inf; rep(i, 100)inf += 'z';\n\twhile (scanf(\"%d\", &n), n) {\n\t\trep(i, n)cin >> s[i];\n\t\trep(i, 1 << n)rep(j, n)dp[i][j] = inf;\n\t\trep(i, n)dp[1 << i][i] = s[i];\n\t\trep(i, 1 << n) {\n\t\t\trep(j, n) {\n\t\t\t\tif (!(i >> j & 1))continue;\n\t\t\t\tif (dp[i][j] == inf)continue;\n\t\t\t\trep(k, n) {\n\t\t\t\t\tif (i >> k & 1)continue;\n\t\t\t\t\tstring t = dp[i | 1 << k][k];\n\t\t\t\t\tstring p = dp[i][j];\n\t\t\t\t\tint d = s[k].size();\n\t\t\t\t\twhile ((int)(p + s[k].substr(d)).find(s[k]) == -1)d--;\n\t\t\t\t\tp += s[k].substr(d);\n\t\t\t\t\tif (t.size() > p.size())dp[i | 1 << k][k] = p;\n\t\t\t\t\telse if (t.size() == p.size())dp[i | 1 << k][k] = min(dp[i | 1 << k][k], p);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tstring ans = inf;\n\t\trep(i, n) {\n\t\t\tstring t = dp[(1 << n) - 1][i];\n\t\t\tif (ans.size() > t.size())ans = t;\n\t\t\telse if (ans.size() == t.size())ans = min(ans, t);\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}","accuracy":1,"time_ms":270,"memory_kb":3700,"score_of_the_acc":-0.047,"final_rank":7},{"submission_id":"aoj_2022_2137607","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint x[14][14], n; string S[14];\nstring dp[14][16384];\nbool erased[14]; vector<int>vec;\nint SSS(string S, string T) {\n\tfor (int i = min(S.size(), T.size()); i >= 0; i--) {\n\t\tif (S.substr(S.size() - i, i) == T.substr(0, i))return i;\n\t}\n}\nint main() {\n\twhile (true) {\n\t\tcin >> n; vec.clear(); if (n == 0)break; for (int i = 0; i < n; i++)cin >> S[i];\n\t\tfor (int i = 0; i < 14; i++) {\n\t\t\terased[i] = false;\n\t\t\tfor (int j = 0; j < 16384; j++) { dp[i][j] = \"$\"; }\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (S[i].size() > S[j].size()) {\n\t\t\t\t\tfor (int k = 0; k <= S[i].size() - S[j].size(); k++) {\n\t\t\t\t\t\tif (S[i].substr(k, S[j].size()) == S[j])erased[j] = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++) { if (erased[i] == false)vec.push_back(i); }\n\t\tn = vec.size(); for (int i = 0; i < n; i++)S[i] = S[vec[i]];\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)x[i][j] = SSS(S[i], S[j]);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++) { dp[i][(1 << i)] = S[i]; }\n\t\tfor (int j = 0; j < (1 << n); j++) {\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (dp[i][j] == \"$\")continue;\n\t\t\t\tint bit[14]; for (int k = 0; k < n; k++)bit[k] = (j / (1 << k)) % 2;\n\t\t\t\tfor (int k = 0; k < n; k++) {\n\t\t\t\t\tif (bit[k] == 1)continue;\n\t\t\t\t\tstring W1 = dp[i][j] + S[k].substr(x[i][k], S[k].size() - x[i][k]);\n\t\t\t\t\tif (dp[k][j + (1 << k)] == \"$\") { dp[k][j + (1 << k)] = W1; }\n\t\t\t\t\tif (dp[k][j + (1 << k)].size() > W1.size()) { dp[k][j + (1 << k)] = W1; }\n\t\t\t\t\tif (dp[k][j + (1 << k)].size() == W1.size() && dp[k][j + (1 << k)] > W1) { dp[k][j + (1 << k)] = W1; }\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tstring minx = dp[0][(1 << n) - 1];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (minx.size() > dp[i][(1 << n) - 1].size()) { minx = dp[i][(1 << n) - 1]; }\n\t\t\tif (minx.size() == dp[i][(1 << n) - 1].size() && minx > dp[i][(1 << n) - 1]) { minx = dp[i][(1 << n) - 1]; }\n\t\t}\n\t\tcout << minx << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":280,"memory_kb":15836,"score_of_the_acc":-0.2506,"final_rank":12},{"submission_id":"aoj_2022_2085814","code_snippet":"#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cstring>\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\ntypedef pair<int,int> pi;\n\nint n;\nvector<string> s,t;\nint T;\n\nconst int INF=12345678;\nint dp[15][1<<15];\npi par[15][1<<15];\n\n// i,j???????????????????????±?????¨???????????????\nint com[15][15];\n\nstring make_string(int now, int mask)\n{\n pi p=par[now][mask];\n if(p.fi==-1) return t[now];\n return make_string(p.fi,p.se)+t[now].substr(com[p.fi][now]);\n}\n\nint main()\n{\n cin.tie(0);ios::sync_with_stdio(false);\n\n while(cin >>n,n)\n {\n s=vector<string>(n);\n rep(i,n) cin >>s[i];\n\n vector<bool> use(n,true);\n rep(i,n)rep(j,n)\n {\n if(i==j) continue;\n\n int I=s[i].size(), J=s[j].size();\n if(I>J) continue;\n\n if(I==J)\n {\n if(s[i]==s[j] && i<j) use[i]=false;\n }\n else\n {\n rep(k,J-I+1)\n {\n if(s[i]==s[j].substr(k,I))\n {\n // cout <<s[i]<<\" \"<<s[j].substr(k,I)<<endl;\n use[i]=false;\n }\n }\n }\n }\n\n t.clear();\n rep(i,n) if(use[i]) t.pb(s[i]);\n T=t.size();\n // printf(\"T=%d\\n\", T);\n\n\n memset(com,0,sizeof(com));\n rep(i,T)rep(j,T)\n {\n if(i==j) continue;\n int I=t[i].size(), J=t[j].size();\n\n // cout <<i<<\" \"<<j<<endl;\n // cout <<t[i] << \" \"<<t[j]<<endl;\n rep(k,min(I,J))\n {\n int len=k+1;\n // cout <<\"len= \"<<len;\n // cout <<t[i].substr(I-len,len)<<\" \"<<t[j].substr(0,len)<<'\\n';\n if(t[i].substr(I-len,len)==t[j].substr(0,len)) com[i][j]=len;\n }\n\n }\n\n fill(dp[0],dp[15],INF);\n\n // ??????\n rep(i,T)\n {\n dp[i][1<<i]=t[i].size();\n par[i][1<<i]=pi(-1,-1);\n }\n\n for(int mask=1; mask<(1<<T); ++mask)\n {\n rep(before,T)if(mask>>before&1)\n {\n rep(i,T)if(!(mask>>i&1))\n {\n int add=t[i].size()-com[before][i];\n if(dp[i][mask+(1<<i)]>dp[before][mask]+add)\n {\n dp[i][mask+(1<<i)]=dp[before][mask]+add;\n par[i][mask+(1<<i)]=pi(before,mask);\n }\n else if(dp[i][mask+(1<<i)]==dp[before][mask]+add)\n {\n string old_s=make_string(i,mask+(1<<i));\n string new_s=make_string(before,mask)+t[i].substr(com[before][i]);\n\n if(new_s<old_s) par[i][mask+(1<<i)] = pi(before,mask);\n }\n }\n }\n }\n\n int min_len=INF;\n rep(i,T)\n {\n // printf(\" dp? %d\\n\", dp[i][(1<<T)-1]);\n min_len=min(min_len, dp[i][(1<<T)-1]);\n }\n string ans=\"#\";\n rep(i,T)\n {\n if(dp[i][(1<<T)-1]==min_len)\n {\n if(ans==\"#\") ans=make_string(i,(1<<T)-1);\n else ans=min(ans,make_string(i,(1<<T)-1));\n }\n }\n\n // cout << \"Scenario #\" << sce+1 << '\\n';\n cout << ans << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":5236,"score_of_the_acc":-0.0441,"final_rank":6},{"submission_id":"aoj_2022_2083338","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n// does s contain t?\n/*\nbool contain(const string& s, const string& t)\n{\n if(s.size() < t.size()) return false;\n int idx = 0;\n bool flag = false;\n for(int i = 0; i < t.size(); i++) {\n flag = false;\n for(int j = idx; j < s.size(); j++) {\n if(t[i] == s[j]) idx = j+1, flag = true;\n if(flag) break;\n }\n if(!flag) break;\n }\n return flag;\n}\n*/\n\nbool cmp(const string& left, const string& right)\n{\n if(left.size() != right.size()) return left.size() < right.size();\n for(int i = 0; i < left.size(); i++) {\n if(left[i] != right[i]) return left[i] < right[i];\n }\n return false;\n}\n\n// additional string to let s contain t.\n/*\nstring addstr(const string& s, const string& t)\n{\n int idx = 0;\n for(int i = 0; i < t.size(); i++) {\n bool flag = false;\n for(int j = idx; j < s.size(); j++) {\n if(t[i] == s[j]) idx = j+1, flag = true;\n if(flag) break;\n }\n if(!flag) return t.substr(i);\n }\n return \"\";\n}\n*/\nstring addstr(string s, string t)\n{\n for(int i = 0; i < s.size(); i++) {\n if(s.substr(i) == t.substr(0, s.size()-i)) return t.substr(s.size()-i);\n }\n return t;\n}\n\nstring inf()\n{\n string ret = \"\";\n for(int i = 0; i < 1000; i++) ret += \"~\";\n return ret;\n}\n\nint main()\n{\n int N;\n while(cin >> N, N) {\n vector<string> S(N);\n for(int i = 0; i < N; i++) cin >> S[i];\n sort(S.begin(), S.end(), cmp);\n S.erase(unique(S.begin(), S.end()), S.end());\n\n vector<string> T;\n for(int i = 0; i < S.size(); i++) {\n bool flag = false;\n for(int j = i+1; j < S.size(); j++) {\n\tif(S[j].find(S[i]) != string::npos) flag = true;\n\tif(flag) break;\n }\n if(!flag) T.push_back(S[i]);\n }\n \n int M = T.size();\n string add[11][11];\n for(int i = 0; i < M; i++) {\n for(int j = 0; j < M; j++) {\n\tadd[i][j] = addstr(T[i], T[j]);\n }\n }\n \n string dp[1<<11][11];\n fill(dp[0], dp[1<<11], inf());\n for(int i = 0; i < M; i++) dp[1<<i][i] = T[i];\n \n string ans = inf();\n for(int i = 0; i < 1<<M; i++) {\n for(int j = 0; j < M; j++) {\n\tif(dp[i][j] == inf()) continue;\n\tif(i == (1<<M)-1) {\n\t ans = min(ans, dp[i][j], cmp);\n\t}\n\tfor(int k = 0; k < M; k++) {\n\t if((i >> k) & 1) continue;\n\t dp[i|(1<<k)][k] = min(dp[i|(1<<k)][k], dp[i][j] + add[j][k], cmp);\n\t}\n }\n }\n \n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":460,"memory_kb":3508,"score_of_the_acc":-0.0708,"final_rank":8},{"submission_id":"aoj_2022_2053451","code_snippet":"#include <string>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nint n; vector<string> s;\nint main() {\n\twhile (cin >> n, n) {\n\t\ts.resize(n);\n\t\tfor (int i = 0; i < n; i++) cin >> s[i];\n\t\tvector<int> flag(n, 0); // bit / i -> j\n\t\tvector<vector<int> > cost(n, vector<int>(n)); // i -> j\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (s[i].find(s[j]) != string::npos) {\n\t\t\t\t\tflag[i] |= 1 << j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tfor (int k = 0; k <= s[i].size(); k++) {\n\t\t\t\t\tstring ret = s[i].substr(0, k) + s[j];\n\t\t\t\t\tif (ret.substr(0, s[i].size()) == s[i]) {\n\t\t\t\t\t\tcost[i][j] = ret.size() - s[i].size();\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\tvector<vector<string> > dp(1 << n, vector<string>(n, string(101, 'z')));\n\t\tdp[0][0] = \"\";\n\t\tfor (int i = 1; i < 1 << n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (!(i & (1 << j))) continue;\n\t\t\t\tint p = i - (1 << j);\n\t\t\t\tfor (int k = 0; k < n; k++) {\n\t\t\t\t\tstring con = (p != 0 ? s[j].substr(s[j].size() - cost[k][j], cost[k][j]) : s[j]);\n\t\t\t\t\tif (dp[i][j].size() > dp[p][k].size() + con.size()) dp[i][j] = dp[p][k] + con;\n\t\t\t\t\telse if (dp[i][j].size() == dp[p][k].size() + con.size() && dp[i][j] > dp[p][k] + con) dp[i][j] = dp[p][k] + con;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tstring ret(101, 'z');\n\t\tfor (int i = 1; i < 1 << n; i++) {\n\t\t\tint bit = i;\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (i & (1 << j)) bit |= flag[j];\n\t\t\t}\n\t\t\tif (bit == (1 << n) - 1) {\n\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\tif (ret.size() > dp[i][j].size()) ret = dp[i][j];\n\t\t\t\t\telse if (ret.size() == dp[i][j].size() && ret > dp[i][j]) ret = dp[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ret << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3584,"score_of_the_acc":-0.0152,"final_rank":4},{"submission_id":"aoj_2022_2042733","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<(n);i++)\n#define rep2(i,a,b) for (int i=(a);i<(b);i++)\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\n#define rrep2(i,a,b) for (int i=(a)-1;i>=b;i--)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n#define printV(v) for(auto x : v){cout << x << \" \";} cout << endl\n#define printVS(vs) for(auto x : vs){cout << x << endl;}\n#define printVV(vv) for(auto v : vv){for(auto&& x : v){cout << x << \" \";}cout << endl;}\n#define printP(p) cout << p.first << \" \" << p.second << endl\n#define printVP(vp) for(auto p : vp) printP(p);\n\ntypedef long long ll;\ntypedef pair<int, int> Pii;\ntypedef tuple<int, int, int> TUPLE;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<vvi> vvvi;\ntypedef vector<Pii> vp;\ntypedef vector<vector<int>> Graph;\nconst int inf = 1e9;\nconst int mod = 1e9 + 7;\n\nint n;\nvector<string> s;\nvvi d;\nvvi dp;\n\nint common(string s, string t) {\n for (int k = min(s.size(), t.size()); k >= 0; k--) {\n if (s.substr((int)s.size() - k) == t.substr(0, k)) {\n return k;\n }\n }\n}\n\nstring concat(string s, string t) {\n int k = common(s, t);\n return s + t.substr(k);\n}\n\nstring mymin(string s, string t) {\n if (s.size() < t.size()) return s;\n if (s.size() > t.size()) return t;\n return s < t ? s : t;\n}\n\nstring dfs(int state, int j, string str) {\n if (__builtin_popcount(state) == 1) return concat(s[j], str);\n\n string ret(101, 'z');\n rep(i, n) {\n if (!((state >> i) & 1)) continue;\n if (dp[state - (1 << j)][i] + d[i][j] == dp[state][j]) {\n ret = mymin(ret, dfs(state - (1 << j), i, concat(s[i], str)));\n }\n }\n\n return ret;\n}\n\n\n\nsigned main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n\n int t = 0;\n while (cin >> n, n) {\n s.clear();\n s.resize(n);\n rep(i, n) cin >> s[i];\n\n vector<bool> alive(n, true);\n rep(i, n) {\n rep2(j, i + 1, n) {\n if (s[i] == s[j]) {\n alive[j] = false;\n }\n }\n }\n rep(i, n) {\n rep(j, n) {\n if (i == j) continue;\n if (s[i] != s[j] && s[i].find(s[j]) != string::npos) {\n alive[j] = false;\n }\n }\n }\n\n {\n vector<string> t;\n rep(i, n) {\n if (alive[i]) {\n t.emplace_back(s[i]);\n }\n }\n s = t;\n n = s.size();\n }\n\n d.clear();\n d.resize(n, vi(n));\n rep(i, n) {\n rep(j, n) {\n if (i == j) continue;\n d[i][j] = common(s[i], s[j]);\n }\n }\n\n dp.clear();\n dp.resize(1 << n, vi(n, -1));\n rep(i, n) {\n dp[1 << i][i] = 0;\n }\n rep(state, 1 << n) {\n rep(i, n) {\n if (dp[state][i] == -1) continue;\n rep(j, n) {\n if ((state >> j) & 1) continue;\n dp[state | (1 << j)][j] = max(dp[state | (1 << j)][j], dp[state][i] + d[i][j]);\n }\n }\n }\n\n int mx = *max_element(all(dp[(1 << n) - 1]));\n string ans(101, 'z');\n rep(j, n) {\n if (dp[(1 << n) - 1][j] == mx) {\n ans = mymin(ans, dfs((1 << n) - 1, j, s[j]));\n }\n }\n cout << ans << endl;\n }\n\n}","accuracy":1,"time_ms":890,"memory_kb":3272,"score_of_the_acc":-0.128,"final_rank":11},{"submission_id":"aoj_2022_2042729","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<(n);i++)\n#define rep2(i,a,b) for (int i=(a);i<(b);i++)\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\n#define rrep2(i,a,b) for (int i=(a)-1;i>=b;i--)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n#define printV(v) for(auto x : v){cout << x << \" \";} cout << endl\n#define printVS(vs) for(auto x : vs){cout << x << endl;}\n#define printVV(vv) for(auto v : vv){for(auto&& x : v){cout << x << \" \";}cout << endl;}\n#define printP(p) cout << p.first << \" \" << p.second << endl\n#define printVP(vp) for(auto p : vp) printP(p);\n\ntypedef long long ll;\ntypedef pair<int, int> Pii;\ntypedef tuple<int, int, int> TUPLE;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<vvi> vvvi;\ntypedef vector<Pii> vp;\ntypedef vector<vector<int>> Graph;\nconst int inf = 1e9;\nconst int mod = 1e9 + 7;\n\nint n;\nvector<string> s(n);\nvvi d(n, vi(n));\nvvi dp(1 << n, vi(n, -1));\n\nint common(string s, string t) {\n for (int k = min(s.size(), t.size()); k >= 0; k--) {\n if (s.substr((int)s.size() - k) == t.substr(0, k)) {\n return k;\n }\n }\n}\n\nstring concat(string s, string t) {\n int k = common(s, t);\n return s + t.substr(k);\n}\n\nstring mymin(string s, string t) {\n if (s.size() < t.size()) return s;\n if (s.size() > t.size()) return t;\n return s < t ? s : t;\n}\n\nstring dfs(int state, int j, string str) {\n // cout << state << \" \" << j << \" \" << str << endl;\n // if (state == 0) return str;\n if (__builtin_popcount(state) == 1) return concat(s[j], str);\n\n string ret(101, 'z');\n rep(i, n) {\n if (!((state >> i) & 1)) continue;\n if (dp[state - (1 << j)][i] + d[i][j] == dp[state][j]) {\n ret = mymin(ret, dfs(state - (1 << j), i, concat(s[i], str)));\n }\n }\n\n return ret;\n}\n\n\n\nsigned main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n\n int t = 0;\n while (cin >> n, n) {\n s.clear();\n s.resize(n);\n rep(i, n) cin >> s[i];\n\n // cout << t++ << endl;\n // printVS(s);\n\n vector<bool> alive(n, true);\n rep(i, n) {\n rep2(j, i + 1, n) {\n if (s[i] == s[j]) {\n alive[j] = false;\n }\n }\n }\n rep(i, n) {\n rep(j, n) {\n if (i == j) continue;\n if (s[i] != s[j] && s[i].find(s[j]) != string::npos) {\n alive[j] = false;\n }\n }\n }\n\n {\n vector<string> t;\n rep(i, n) {\n if (alive[i]) {\n t.emplace_back(s[i]);\n }\n }\n s = t;\n n = s.size();\n }\n\n // cout << n << endl;\n // printVS(s);\n\n d.clear();\n d.resize(n, vi(n));\n rep(i, n) {\n rep(j, n) {\n if (i == j) continue;\n d[i][j] = common(s[i], s[j]);\n }\n }\n // printVV(d);\n // cout << endl;\n\n dp.clear();\n dp.resize(1 << n, vi(n, -1));\n rep(i, n) {\n dp[1 << i][i] = 0;\n }\n rep(state, 1 << n) {\n rep(i, n) {\n if (dp[state][i] == -1) continue;\n rep(j, n) {\n if ((state >> j) & 1) continue;\n dp[state | (1 << j)][j] = max(dp[state | (1 << j)][j], dp[state][i] + d[i][j]);\n }\n }\n }\n // printVV(dp);\n // cout << endl;\n\n int mx = *max_element(all(dp[(1 << n) - 1]));\n string ans(101, 'z');\n rep(j, n) {\n if (dp[(1 << n) - 1][j] == mx) {\n ans = mymin(ans, dfs((1 << n) - 1, j, s[j]));\n }\n }\n // cout << \"* ans = \" << ans << endl;\n cout << ans << endl;\n }\n\n}","accuracy":1,"time_ms":890,"memory_kb":3248,"score_of_the_acc":-0.1276,"final_rank":10}],"string":"[\n {\n \"submission_id\": \"aoj_2022_5538521\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int INF = 110;\\nint main(){\\n while (true){\\n int N;\\n cin >> N;\\n if (N == 0){\\n break;\\n }\\n vector<string> S(N);\\n for (int i = 0; i < N; i++){\\n cin >> S[i];\\n }\\n sort(S.begin(), S.end());\\n S.erase(unique(S.begin(), S.end()), S.end());\\n N = S.size();\\n vector<string> T;\\n for (int i = 0; i < N; i++){\\n bool ok = true;\\n int L1 = S[i].size();\\n for (int j = 0; j < N; j++){\\n if (i != j){\\n int L2 = S[j].size();\\n for (int k = 0; k <= L2 - L1; k++){\\n if (S[j].substr(k, L1) == S[i]){\\n ok = false;\\n }\\n }\\n }\\n }\\n if (ok){\\n T.push_back(S[i]);\\n }\\n }\\n N = T.size();\\n vector<vector<int>> d(N, vector<int>(N));\\n for (int i = 0; i < N; i++){\\n for (int j = 0; j < N; j++){\\n int L1 = T[i].size();\\n int L2 = T[j].size();\\n for (int k = 0; k <= min(L1, L2); k++){\\n if (T[i].substr(L1 - k) == T[j].substr(0, k)){\\n d[i][j] = L2 - k;\\n }\\n }\\n }\\n }\\n vector<vector<string>> dp(1 << N, vector<string>(N, string(INF, ' ')));\\n for (int i = 0; i < N; i++){\\n dp[1 << i][i] = T[i];\\n }\\n for (int i = 0; i < (1 << N); i++){\\n for (int j = 0; j < N; j++){\\n if ((i >> j & 1) == 1){\\n for (int k = 0; k < N; k++){\\n if ((i >> k & 1) == 0){\\n int i2 = i | (1 << k);\\n string t = dp[i][j] + T[k].substr(T[k].size() - d[j][k]);\\n if (dp[i2][k].size() > t.size() || dp[i2][k].size() == t.size() && dp[i2][k] > t){\\n dp[i2][k] = t;\\n }\\n }\\n }\\n }\\n }\\n }\\n string ans(INF, ' ');\\n for (int i = 0; i < N; i++){\\n \\tif (ans.size() > dp[(1 << N) - 1][i].size() || ans.size() == dp[(1 << N) - 1][i].size() && ans > dp[(1 << N) - 1][i]){\\n \\t ans = dp[(1 << N) - 1][i];\\n \\t}\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5040,\n \"score_of_the_acc\": -0.0323,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2022_4931111\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint dp[1<<14][14];\\nint len[14][14];\\n\\nint main(){\\n int n;\\n while(cin >> n,n){\\n for(int i=0;i<(1<<n);i++){\\n for(int j=0;j<n;j++){\\n dp[i][j]=1e9;\\n }\\n }\\n vector<string> s(n);\\n for(int i=0;i<n;i++){\\n cin >> s[i];\\n }\\n sort(s.begin(), s.end());\\n s.erase(unique(s.begin(), s.end()),s.end());\\n n=s.size();\\n for(int i=0;i<n;i++){\\n for(int j=0;j<n;j++){\\n if(i==j)len[i][j]=s[j].size();\\n else{\\n int cnt=0;\\n int p=s[j].size();\\n for(int k=0;k<min(s[i].size(),s[j].size());k++){\\n if(s[j].substr(0,k+1)==s[i].substr((int)s[i].size()-1-k))cnt=k+1;\\n }\\n len[i][j]=p-cnt;\\n }\\n }\\n }\\n vector<bool> notuse(n,false);\\n for(int i=0;i<n;i++){\\n for(int j=0;j<n;j++){\\n if(i==j)continue;\\n for(int k=0;k+(int)(s[j].size())-1<s[i].size();k++){\\n if(s[i].substr(k,(int)(s[j].size()))==s[j])notuse[j]=true;\\n }\\n }\\n }\\n int aa=0;\\n for(int i=0;i<n;i++){\\n if(notuse[i])aa+=(1<<i);\\n }\\n for(int i=0;i<n;i++){\\n if(notuse[i])continue;\\n dp[aa+(1<<i)][i]=(int)s[i].size();\\n }\\n int res=1e9;\\n for(int i=0;i<(1<<n);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]+len[j][k]);\\n }\\n }\\n }\\n for(int i=0;i<n;i++){\\n res=min(res,dp[(1<<n)-1][i]);\\n }\\n vector<string> V;\\n auto con=[&](vector<int> id)->string{\\n reverse(id.begin(), id.end());\\n string ans=s[id[0]];\\n for(int i=1;i<id.size();i++){\\n int p=id[i-1],c=id[i];\\n for(int j=(int)s[c].size()-len[p][c];j<(int)s[c].size();j++){\\n ans+=s[c][j];\\n }\\n }\\n return ans;\\n };\\n auto dfs=[&](auto dfs,vector<int> &v,int bit,int last)->void{\\n if(bit-(1<<last)==aa){\\n V.push_back(con(v)); return;\\n }\\n for(int i=0;i<n;i++){\\n if((1<<i)&aa)continue;\\n if(i==last)continue;\\n if((1<<i)&bit){\\n if(dp[bit-(1<<last)][i]+len[i][last]==dp[bit][last]){\\n v.push_back(i);\\n dfs(dfs,v,bit-(1<<last),i);\\n v.pop_back();\\n }\\n }\\n }\\n return;\\n };\\n for(int i=0;i<n;i++){\\n if((1<<i)&aa)continue;\\n if(dp[(1<<n)-1][i]==res){\\n vector<int> v={i};\\n dfs(dfs,v,(1<<n)-1,i);\\n }\\n }\\n sort(V.begin(), V.end());\\n cout << V[0] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 51140,\n \"score_of_the_acc\": -0.8672,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2022_4931110\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint dp[1<<14][14];\\nint len[14][14];\\n\\nint main(){\\n int n;\\n while(cin >> n,n){\\n for(int i=0;i<(1<<n);i++){\\n for(int j=0;j<n;j++){\\n dp[i][j]=1e9;\\n }\\n }\\n vector<string> s(n);\\n for(int i=0;i<n;i++){\\n cin >> s[i];\\n }\\n sort(s.begin(), s.end());\\n s.erase(unique(s.begin(), s.end()),s.end());\\n n=s.size();\\n for(int i=0;i<n;i++){\\n for(int j=0;j<n;j++){\\n if(i==j)len[i][j]=s[j].size();\\n else{\\n int cnt=0;\\n int p=s[j].size();\\n for(int k=0;k<min(s[i].size(),s[j].size());k++){\\n if(s[j].substr(0,k+1)==s[i].substr((int)s[i].size()-1-k))cnt=k+1;\\n }\\n len[i][j]=p-cnt;\\n }\\n }\\n }\\n vector<bool> notuse(n,false);\\n for(int i=0;i<n;i++){\\n for(int j=0;j<n;j++){\\n if(i==j)continue;\\n for(int k=0;k+(int)(s[j].size())-1<s[i].size();k++){\\n if(s[i].substr(k,(int)(s[j].size()))==s[j])notuse[j]=true;\\n }\\n }\\n }\\n int aa=0;\\n for(int i=0;i<n;i++){\\n if(notuse[i])aa+=(1<<i);\\n }\\n for(int i=0;i<n;i++){\\n if(notuse[i])continue;\\n dp[aa+(1<<i)][i]=(int)s[i].size();\\n }\\n int res=1e9;\\n for(int i=0;i<(1<<n);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]+len[j][k]);\\n }\\n }\\n }\\n for(int i=0;i<n;i++){\\n res=min(res,dp[(1<<n)-1][i]);\\n }\\n vector<string> V;\\n auto con=[&](vector<int> id)->string{\\n reverse(id.begin(), id.end());\\n string ans=s[id[0]];\\n for(int i=1;i<id.size();i++){\\n int p=id[i-1],c=id[i];\\n for(int j=(int)s[c].size()-len[p][c];j<(int)s[c].size();j++){\\n ans+=s[c][j];\\n }\\n }\\n return ans;\\n };\\n auto dfs=[&](auto dfs,vector<int> &v,int bit,int last)->void{\\n if(bit-(1<<last)==aa){\\n V.push_back(con(v)); return;\\n }\\n for(int i=0;i<n;i++){\\n if((1<<i)&aa)continue;\\n if(i==last)continue;\\n if((1<<i)&bit){\\n if(dp[bit-(1<<last)][i]+len[i][last]==dp[bit][last]){\\n v.push_back(i);\\n dfs(dfs,v,bit-(1<<last),i);\\n v.pop_back();\\n }\\n }\\n }\\n return;\\n };\\n for(int i=0;i<n;i++){\\n if((1<<i)&aa)continue;\\n if(dp[(1<<n)-1][i]==res){\\n vector<int> v={i};\\n dfs(dfs,v,(1<<n)-1,i);\\n }\\n }\\n // for(int _=0;_<n;_++){\\n // if(res==dp[(1<<n)-1][_]){\\n // int curid=_,cur=(1<<n)-1;\\n // vector<int> id;\\n // while(1){\\n // id.push_back(curid);\\n // int nx=pre[cur][curid];\\n // if(nx<0)break;\\n // cur-=(1<<curid);\\n // curid=nx;\\n // }\\n // reverse(id.begin(), id.end());\\n // string ans=s[id[0]];\\n // for(int i=1;i<id.size();i++){\\n // int p=id[i-1];\\n // int c=id[i];\\n // for(int j=(int)s[c].size()-len[p][c];j<(int)s[c].size();j++){\\n // ans+=s[c][j];\\n // }\\n // }\\n // v.push_back(ans);\\n // }\\n // }\\n\\n sort(V.begin(), V.end());\\n cout << V[0] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 51168,\n \"score_of_the_acc\": -0.8677,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2022_4911241\",\n \"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-10, PI = acos(-1);\\n//ここから編集\\nstruct RollingHash{\\n\\n using ull = unsigned long long;\\n const ull mod = (1ULL << 61) - 1;\\n const ull MASK30 = (1ULL << 30) - 1;\\n const ull MASK31 = (1ULL << 31) - 1;\\n\\n const ull MASK61 = mod;\\n\\n ull base;\\n int n;\\n vector<ull> hash, pow;\\n\\n RollingHash(){}\\n RollingHash(string s)\\n {\\n random_device rnd;\\n mt19937_64 mt(rnd());\\n base = MOD;\\n \\n n = (int)s.size();\\n hash.assign(n+1, 0);\\n pow.assign(n+1, 1);\\n \\n for(int i=0; i<n; i++){\\n hash[i+1] = calc_mod(mul(hash[i], base) + s[i]);\\n pow[i+1] = calc_mod(mul(pow[i], base));\\n }\\n }\\n\\n ull calc_mod(ull x){\\n ull xu = x >> 61;\\n ull xd = x & MASK61;\\n ull res = xu + xd;\\n if(res >= mod) res -= mod;\\n return res;\\n }\\n\\n ull mul(ull a, ull b){\\n ull au = a >> 31;\\n ull ad = a & MASK31;\\n ull bu = b >> 31;\\n ull bd = b & MASK31;\\n ull mid = ad * bu + au * bd;\\n ull midu = mid >> 30;\\n ull midd = mid & MASK30;\\n return calc_mod(au * bu * 2 + midu + (midd << 31) + ad * bd);\\n }\\n\\n //[l,r)のハッシュ値\\n inline ull get(int l, int r){\\n ull res = calc_mod(hash[r] + mod*3-mul(hash[l], pow[r-l]));\\n return res;\\n }\\n\\n //string tのハッシュ値\\n inline ull get(string t){\\n ull res = 0;\\n for(int i=0; i<t.size(); i++){\\n res = calc_mod(mul(res, base)+t[i]);\\n }\\n return res;\\n }\\n\\n //string s中のtの数をカウント\\n inline int count(string t) {\\n if(t.size() > n) return 0;\\n auto hs = get(t);\\n int res = 0;\\n for(int i=0; i<n-t.size()+1; i++){\\n if(get(i, i+t.size()) == hs) res++; \\n }\\n return res;\\n }\\n\\n inline ull concat(ull h1, ull h2, int h2len){\\n return calc_mod(h2 + mul(h1, pow[h2len]));\\n }\\n\\n // LCPを求める S[a:] T[b:]\\n inline int LCP(int a, int b){\\n int len = min((int)hash.size()-a, (int)hash.size()-b);\\n \\n int lb = -1, ub = len;\\n while(ub-lb>1){\\n int mid = (lb+ub)/2;\\n\\n if(get(a, a+mid) == get(b, b+mid)) lb = mid;\\n else ub = mid;\\n }\\n return lb;\\n }\\n RollingHash& operator=(const RollingHash&) { return *this; }\\n};\\n\\nbool max(const string& s, const string& t){\\n \\n if(s.size() < t.size()) return false;\\n else if(s.size() > t.size()) return true;\\n for(int i=0; i<s.size(); i++){\\n if(s[i] > t[i]) return true;\\n else if(s[i] < t[i]) return false;\\n }\\n return false;\\n}\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n \\n int n; \\n while(cin >> n, n){\\n vector<string> v(n);\\n REP(i,n) cin >> v[i];\\n REP(i,n) {\\n RollingHash rh(v[i]);\\n \\n }\\n vector<vector<string>> dp(n, vector<string>(1<<n, \\\"~\\\"));\\n dp[0][0] = \\\"\\\";\\n for(int i=0; i<n; i++){\\n dp[i][(1<<i)] = v[i];\\n }\\n REP(bit,(1<<n)){\\n\\n for(int i=0; i<n; i++){\\n if(dp[i][bit] == \\\"~\\\") continue;\\n if(bit >> i & 1){\\n\\n for(int j=0; j<n; j++){\\n if(!(bit >> j & 1)){\\n\\n /* dp[i][bit]にvjをくっつける */\\n string s = dp[i][bit];\\n string t = v[j];\\n RollingHash rh(s);\\n RollingHash rh2(t);\\n int mx = 0;\\n \\n for(int k=1; k<=min(s.size(), t.size()); k++){\\n if(rh.get(s.size()-k, s.size()) == rh2.get(0, k)) mx = max(mx, k);\\n }\\n \\n if(rh.count(t)){\\n /* dp[j][bit | (1 << j)]とdp[i][bit]の大きさを比較 */\\n\\n if(dp[j][bit | (1 << j)] == \\\"~\\\") dp[j][bit | (1 << j)] = dp[i][bit];\\n else{ \\n if(max(dp[j][bit | (1 << j)], dp[i][bit])){\\n dp[j][bit|(1<<j)] = dp[i][bit];\\n }\\n }\\n }else{\\n string nx = s + t.substr(mx, t.size()-mx);\\n /* dp[j][bit | (1 << j)]とnxの大きさを比較 */\\n\\n if(dp[j][bit | (1 << j)] == \\\"~\\\") dp[j][bit | (1 << j)] = nx;\\n else{\\n if(max(dp[j][bit | (1 << j)], nx)){\\n dp[j][bit|(1<<j)] = nx;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n string ans = \\\"~\\\";\\n for(int i=0; i<n; i++){\\n if(ans == \\\"~\\\") ans = dp[i][(1<<n)-1];\\n else if(max(ans, dp[i][(1<<n)-1])){\\n ans = dp[i][(1<<n)-1];\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 470,\n \"memory_kb\": 3516,\n \"score_of_the_acc\": -0.0724,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2022_4804724\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nbool contains(string a, string b){\\n int n = a.length();\\n int m = b.length();\\n if(n < m) return false;\\n for(int i=0; i<n-m+1; i++){\\n if(b == a.substr(i, m)){\\n return true;\\n }\\n }\\n return false;\\n}\\nint match(string a, string b){\\n int n = a.length();\\n int m = b.length();\\n for(int i=0; i<n; i++){\\n if(m < n-i) continue;\\n if(a.substr(i, n-i) == b.substr(0, n-i)){\\n return n-i;\\n }\\n }\\n return 0;\\n}\\n\\nint main(){\\n while(1){\\n int n;\\n cin >> n;\\n if(n == 0) break;\\n\\n vector<string> s(n);\\n for(int i=0; i<n; i++){\\n cin >> s[i];\\n }\\n for(int i=n-1; i>=0; i--){\\n for(int j=0; j<n; j++){\\n if(i == j) continue;\\n if(contains(s[j], s[i])){\\n s.erase(s.begin()+i);\\n n--;\\n break;\\n }\\n }\\n }\\n int sum = 0;\\n for(auto str: s){\\n sum += str.length();\\n }\\n vector<vector<int>> a(n, vector<int>(n));\\n for(int i=0; i<n; i++){\\n for(int j=0; j<n; j++){\\n a[i][j] = match(s[i], s[j]);\\n }\\n }\\n vector<vector<string>> dp(1<<n, vector<string>(n, \\\"\\\"));\\n for(int i=0; i<n; i++){\\n dp[1<<i][i] = s[i];\\n }\\n for(int i=0; i<(1<<n); i++){\\n for(int j=0; j<n; j++){\\n if(!(i>>j&1)) continue;\\n for(int k=0; k<n; k++){\\n if(i>>k&1) continue;\\n int ni = i | (1<<k);\\n string ns = dp[i][j] +s[k].substr(a[j][k], (int)s[k].length()-a[j][k]);\\n if(dp[ni][k] == \\\"\\\") dp[ni][k] = ns;\\n if(dp[ni][k] == \\\"\\\" or ns.length() < dp[ni][k].length() or\\n (ns.length() == dp[ni][k].length() and ns < dp[ni][k])){\\n dp[ni][k] = ns;\\n }\\n }\\n }\\n }\\n string ans(100, 'z');\\n for(string str: dp.back()){\\n if(str == \\\"\\\") continue;\\n if(str.length() < ans.length() or (str.length()==ans.length() and str<ans)){\\n ans = str;\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3440,\n \"score_of_the_acc\": -0.0071,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2022_3875221\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\nusing namespace std;\\n\\nbool contains(string str, string pre){\\n int s = str.length(), p = pre.length();\\n if(s < p) return false;\\n\\n for(int i = 0; i <= s - p; i++){\\n int j;\\n for(j = 0; j < p; j++){ \\n if(str[i+j] != pre[j]) break;\\n }\\n if(j == p) return true;\\n }\\n\\n return false;\\n}\\n\\ntypedef unsigned long long ull;\\null x = 1000000007;\\n\\nint f(string s, string t){\\n int k = min(s.length(), t.length()), slen = s.length();\\n int ret = 0;\\n ull a = 0, b = 0, tmp = 1;\\n for(int i = 1; i <= k; i++){\\n a = a + s[slen-i]*tmp;\\n b = b*x + t[i-1];\\n if(a == b) ret = i;\\n tmp *= x;\\n }\\n return ret;\\n}\\n\\nint main(){\\n int n;\\n while(cin >> n, n){\\n vector<string> v;\\n for(int i = 0; i < n; i++){\\n string s; cin >> s;\\n v.push_back(s);\\n }\\n sort(v.begin(), v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n n = v.size();\\n vector<string> x;\\n for(int i = 0; i < n; i++){\\n bool valid = true;\\n for(int j = 0; j < n; j++){\\n if(i == j) continue;\\n if(contains(v[j], v[i])) valid = false;\\n }\\n if(valid) x.push_back(v[i]);\\n }\\n int n = x.size();\\n vector<vector<string>> dp(n, vector<string>(1<<n, \\\"\\\"));\\n for(int i = 0; i < n; i++) dp[i][1<<i] = x[i];\\n for(int s = 1; s < 1<<n; s++){\\n for(int i = 0; i < n; i++){\\n if(((s>>i)&1) == 0) continue;\\n for(int j = 0; j < n; j++){\\n if((s>>j)&1) continue;\\n string tmp = dp[i][s];\\n tmp += x[j].substr(f(dp[i][s], x[j]));\\n int nbit = s + (1<<j);\\n if(dp[j][nbit] == \\\"\\\" || tmp.length() < dp[j][nbit].length() || (tmp.length()==dp[j][nbit].length() && tmp < dp[j][nbit])){\\n dp[j][nbit] = tmp;\\n }\\n }\\n }\\n }\\n string ans = dp[0].back();\\n for(int i = 1; i < n; i++){\\n if(ans.length() > dp[i].back().length() || (ans.length()==dp[i].back().length() && ans > dp[i].back())){\\n ans = dp[i].back();\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3412,\n \"score_of_the_acc\": -0.0095,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2022_3504590\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) repi(i,0,n)\\n#define repi(i,a,b) for(int i=(int)(a);i < (int)(b);++i)\\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 Key,class Value> ostream& operator << (ostream &s, map<Key,Value> M)\\n{ for ( auto itr = begin(M); itr != end(M); ++itr) { s << itr->first << \\\":\\\" << itr->second; } return s;}\\nvoid print(const std::vector<int>& v)\\n{\\n std::for_each(v.begin(), v.end(), [](int x) {\\n std::cout << x << \\\" \\\";\\n });\\n std::cout << std::endl;\\n}\\nbool is_sub(string s1,string s2) {\\n int s1_size = s1.size();\\n int s2_size = s2.size();\\n if (s1_size > s2_size) {\\n rep(i,s1_size-s2_size + 1) {\\n bool flg = true;\\n rep(j,s2_size) {\\n if (s1[i+j] != s2[j]) {\\n flg = false;\\n break;\\n }\\n }\\n if (flg) return true;\\n }\\n return false;\\n }\\n else {\\n rep(i,s2_size-s1_size + 1) {\\n bool flg = true;\\n rep(j,s1_size) {\\n if (s2[i+j] != s1[j]) {\\n flg = false;\\n break;\\n }\\n }\\n if (flg) return true;\\n }\\n return false;\\n }\\n}\\n\\nint main() {\\n while (true) {\\n int n = 0;\\n cin >> n;\\n if (n == 0) {\\n break;\\n }\\n long init = 0;\\n vector<string> S(n);\\n rep(i,n) cin >> S[i];\\n rep(i,n-1) {\\n repi(j,i+1,n) {\\n // cout << is_sub(S[i],S[j]) << \\\" \\\" << i << \\\" \\\" << j << endl;\\n if( is_sub(S[i],S[j]) ) {\\n if (S[i].size() > S[j].size()) init |= (1 << j);\\n else init |= (1 << i);\\n }\\n }\\n }\\n\\n\\n vector<int> v;\\n rep(i,n) {\\n if (!((init >> i) & 1)) v.push_back(i);\\n }\\n //cout << v << endl;\\n // cout << v << endl;\\n\\n // suffix,prefix計算\\n vector<vector<string>> preffix(n),suffix(n);\\n rep(i,n) {\\n if (((init >> i) & 1)) continue;\\n preffix[i] = vector<string>(S[i].size()+1,\\\"\\\");\\n suffix[i] = vector<string>(S[i].size()+1,\\\"\\\");\\n rep(j, S[i].size()) {\\n repi(k,j+1,S[i].size()+1) {\\n preffix[i][k] += S[i][j];\\n suffix[i][k] = S[i][S[i].size()-1-j] + suffix[i][k];\\n }\\n }\\n }\\n\\n int string_num = v.size();\\n string ans = \\\"77\\\";\\n \\n do {\\n string cur = S[v[0]];\\n rep(i, string_num-1) {\\n int s_size = min(S[v[i]].size(),S[v[i+1]].size());\\n rep(j,s_size) {\\n //cout << suffix[v[i]][s_size-1-j] << \\\" \\\" << preffix[v[i+1]][s_size-1-j] << endl;;\\n if (suffix[v[i]][s_size-1-j] == preffix[v[i+1]][s_size-1-j]) {\\n //cout << cur << \\\" \\\" << suffix[v[i+1]][S[v[i+1]].size()-j] << endl;\\n \\n int match = s_size - 1 - j;\\n cur += suffix[v[i+1]][S[v[i+1]].size()-match];\\n break;\\n }\\n }\\n }\\n if (ans == \\\"77\\\" || ans.size() > cur.size() || ( ans.size() == cur.size() && ans > cur)) ans = cur;\\n } while (next_permutation(v.begin(), v.end()));\\n \\n cout << ans << endl;\\n\\n\\n \\n\\n \\n \\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4390,\n \"memory_kb\": 3160,\n \"score_of_the_acc\": -0.624,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2022_3324384\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)\\n#define RFOR(i,a) for(int i=(a); i >= 0; --i)\\n#define FOE(i,a) for(auto i : a)\\n#define ALL(c) (c).begin(), (c).end()\\n#define RALL(c) (c).rbegin(), (c).rend()\\n#define DUMP(x) cerr << #x << \\\" = \\\" << (x) << endl;\\n#define SUM(x) std::accumulate(ALL(x), 0LL)\\n#define MIN(v) *std::min_element(v.begin(), v.end())\\n#define MAX(v) *std::max_element(v.begin(), v.end())\\n#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())\\n#define BIT_ON(bit, i) (bit & (1LL << i))\\n\\ntypedef long long LL;\\ntemplate<typename T> using V = std::vector<T>;\\ntemplate<typename T> using VV = std::vector<std::vector<T>>;\\ntemplate<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;\\ntemplate<typename T> using VVVV = std::vector<std::vector<std::vector<std::vector<T>>>>;\\n\\ntemplate<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }\\ntemplate<class T> inline void print(T x) { std::cout << x << std::endl; }\\ntemplate<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) { if (i != 0) {std::cout << \\\" \\\";} std::cout << v[i];} std::cout << \\\"\\\\n\\\"; }\\ntemplate<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }\\ntemplate<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }\\ntemplate<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }\\ntemplate<class T> inline std::vector<T> unique(std::vector<T> v) {\\n sort(v.begin(), v.end());\\n v.erase(unique(v.begin(), v.end()), v.end());\\n return v;\\n}\\n\\nconst int INF = 1 << 30;\\nconst double EPS = 1e-9;\\nconst std::string YES = \\\"YES\\\", Yes = \\\"Yes\\\", NO = \\\"NO\\\", No = \\\"No\\\";\\nconst std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 }; // 4近傍（右, 下, 左, 上）\\nconst std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };\\n\\nusing namespace std;\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n while (true) {\\n int N;\\n cin >> N;\\n if (N == 0) {\\n break;\\n }\\n\\n V<string> tmp;\\n FOR(i, 0, N) {\\n string S;\\n cin >> S;\\n tmp.emplace_back(S);\\n }\\n\\n tmp = unique(tmp);\\n\\n V<string> v;\\n FOR(i, 0, tmp.size()) {\\n string s = tmp[i];\\n bool ok = true;\\n\\n FOR(j, 0, tmp.size()) {\\n string t = tmp[j];\\n if (i == j) {\\n continue;\\n }\\n\\n if (t.find(s) != string::npos) {\\n ok = false;\\n }\\n }\\n if (ok) {\\n v.emplace_back(s);\\n }\\n }\\n VV<string> memo(v.size(), V<string>(v.size(), \\\"\\\"));\\n FOR(i, 0, v.size()) {\\n string s = v[i];\\n FOR(j, 0, v.size()) {\\n string t = v[j];\\n\\n int same = 0;\\n for (int n = v[j].size(); n >= 0; --n) {\\n\\n bool ok = true;\\n FOR(k, 0, n) {\\n if (s[s.size() - n + k] != t[k]) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) {\\n same = n;\\n break;\\n }\\n }\\n string ans = \\\"\\\";\\n FOR(k, same, t.size()) {\\n ans += t[k];\\n }\\n memo[i][j] = ans;\\n }\\n }\\n\\n string ans = \\\"\\\";\\n FOR(i, 0, 110) {\\n ans += \\\"z\\\";\\n }\\n\\n V<int> idx(v.size());\\n iota(ALL(idx), 0);\\n\\n do {\\n string t = v[idx[0]];\\n FOR(i, 1, v.size()) {\\n t += memo[idx[i - 1]][idx[i]];\\n if (t.size() > ans.size()) {\\n break;\\n }\\n }\\n\\n if (t.size() == ans.size()) {\\n ans = min(ans, t);\\n }\\n else if (t.size() < ans.size()) {\\n ans = t;\\n }\\n } while(next_permutation(ALL(idx)));\\n\\n print(ans);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2000,\n \"memory_kb\": 3192,\n \"score_of_the_acc\": -0.2846,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2022_3324348\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)\\n#define RFOR(i,a) for(int i=(a); i >= 0; --i)\\n#define FOE(i,a) for(auto i : a)\\n#define ALL(c) (c).begin(), (c).end()\\n#define RALL(c) (c).rbegin(), (c).rend()\\n#define DUMP(x) cerr << #x << \\\" = \\\" << (x) << endl;\\n#define SUM(x) std::accumulate(ALL(x), 0LL)\\n#define MIN(v) *std::min_element(v.begin(), v.end())\\n#define MAX(v) *std::max_element(v.begin(), v.end())\\n#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())\\n#define BIT_ON(bit, i) (bit & (1LL << i))\\n#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());\\n\\ntypedef long long LL;\\ntemplate<typename T> using V = std::vector<T>;\\ntemplate<typename T> using VV = std::vector<std::vector<T>>;\\ntemplate<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;\\ntemplate<typename T> using VVVV = std::vector<std::vector<std::vector<std::vector<T>>>>;\\n\\ntemplate<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }\\ntemplate<class T> inline void print(T x) { std::cout << x << std::endl; }\\ntemplate<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) { if (i != 0) {std::cout << \\\" \\\";} std::cout << v[i];} std::cout << \\\"\\\\n\\\"; }\\ntemplate<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }\\ntemplate<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }\\ntemplate<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }\\n\\nconst int INF = 1 << 30;\\nconst double EPS = 1e-9;\\nconst std::string YES = \\\"YES\\\", Yes = \\\"Yes\\\", NO = \\\"NO\\\", No = \\\"No\\\";\\nconst std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 }; // 4近傍（右, 下, 左, 上）\\nconst std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };\\n\\nusing namespace std;\\n\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n while (true) {\\n int N;\\n cin >> N;\\n if (N == 0) {\\n break;\\n }\\n\\n V<string> tmp;\\n FOR(i, 0, N) {\\n string S;\\n cin >> S;\\n tmp.emplace_back(S);\\n }\\n\\n sort(ALL(tmp));\\n tmp.erase(unique(ALL(tmp)), tmp.end());\\n\\n V<string> v;\\n FOR(i, 0, tmp.size()) {\\n string s = tmp[i];\\n bool ok = true;\\n\\n FOR(j, 0, tmp.size()) {\\n string t = tmp[j];\\n if (i == j) {\\n continue;\\n }\\n\\n if (t.find(s) != string::npos) {\\n ok = false;\\n }\\n }\\n if (ok) {\\n v.emplace_back(s);\\n }\\n }\\n VV<string> memo(v.size(), V<string>(v.size(), \\\"\\\"));\\n FOR(i, 0, v.size()) {\\n string s = v[i];\\n FOR(j, 0, v.size()) {\\n string t = v[j];\\n\\n int same = 0;\\n for (int n = v[j].size(); n >= 0; --n) {\\n\\n bool ok = true;\\n FOR(k, 0, n) {\\n if (s[s.size() - n + k] != t[k]) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) {\\n same = n;\\n break;\\n }\\n }\\n string ans = \\\"\\\";\\n FOR(k, same, t.size()) {\\n ans += t[k];\\n }\\n memo[i][j] = ans;\\n }\\n }\\n\\n string ans = \\\"\\\";\\n FOR(i, 0, 110) {\\n ans += \\\"z\\\";\\n }\\n\\n V<int> idx(v.size());\\n iota(ALL(idx), 0);\\n\\n do {\\n string t = v[idx[0]];\\n FOR(i, 1, v.size()) {\\n t += memo[idx[i - 1]][idx[i]];\\n if (t.size() > ans.size()) {\\n break;\\n }\\n }\\n\\n if (t.size() == ans.size()) {\\n ans = min(ans, t);\\n }\\n else if (t.size() < ans.size()) {\\n ans = t;\\n }\\n } while(next_permutation(ALL(idx)));\\n\\n print(ans);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2020,\n \"memory_kb\": 3188,\n \"score_of_the_acc\": -0.2874,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2022_2542383\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\nstruct Info{\\n\\tshort state;\\n\\tshort num_used,total_length;\\n\\tll order;\\n};\\n\\nint N,match_len[10][10],POW[12];\\nchar first_words[10][11],words[10][11];\\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 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\\nint strCmp2(char* left,char* right){\\n\\tint i;\\n\\n\\tif(strCmp(left,right))return 3;\\n\\n\\tfor(i=0;left[i] != '\\\\0' && right[i] != '\\\\0'; i++){\\n\\t\\tif(left[i] != right[i]){\\n\\t\\t\\tif(left[i] < right[i])return 1;\\n\\t\\t\\telse{\\n\\t\\t\\t\\treturn 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(left[i] == '\\\\0')return 1;\\n\\telse{\\n\\t\\treturn 2;\\n\\t}\\n}\\n\\nvoid func(){\\n\\n\\tint words_index = 0,first_length[N],second_length[N];\\n\\n\\tint tmp;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%s\\\",first_words[i]);\\n\\t\\tfor(tmp = 0; first_words[i][tmp] != '\\\\0';tmp++);\\n\\t\\tfirst_length[i] = tmp;\\n\\t}\\n\\n\\tint i_index,k_index,delete_num = 0;\\n\\tbool FLG;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tFLG = true;\\n\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tif(first_words[k][0] == '\\\\0')continue;\\n\\t\\t\\tif(i != k && first_length[i] <= first_length[k]){\\n\\n\\t\\t\\t\\tfor(int start = 0; start + first_length[i] <= first_length[k]; start++){\\n\\n\\t\\t\\t\\t\\tfor(i_index = 0,k_index = 0; i_index < first_length[i]\\n\\t\\t\\t\\t\\t\\t\\t&& first_words[i][i_index] == first_words[k][start+k_index]; i_index++,k_index++);\\n\\n\\t\\t\\t\\t\\tif(i_index == first_length[i]){\\n\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\tif(!FLG)break;\\n\\t\\t}\\n\\n\\t\\tif(FLG){\\n\\t\\t\\tsecond_length[words_index] = first_length[i];\\n\\t\\t\\tstrcpy(words[words_index++],first_words[i]);\\n\\t\\t}else{\\n\\t\\t\\tfirst_words[i][0] = '\\\\0';\\n\\t\\t\\tdelete_num++;\\n\\t\\t}\\n\\t}\\n\\n\\tN -= delete_num;\\n\\n\\tint common,tmp_common;\\n\\n\\tfor(int left = 0;left < N; left++){\\n\\t\\tfor(int right = 0; right < N; right++){\\n\\t\\t\\tif(left != right){\\n\\n\\t\\t\\t\\tcommon = 0;\\n\\n\\t\\t\\t\\tfor(int start = 0; start < second_length[left]; start++){\\n\\t\\t\\t\\t\\tfor(tmp_common = 0; tmp_common < second_length[right] && start+tmp_common < second_length[left] &&\\n\\t\\t\\t\\t\\t\\t\\twords[left][start+tmp_common] == words[right][tmp_common]; tmp_common++);\\n\\n\\t\\t\\t\\t\\tif(start+tmp_common == second_length[left]){\\n\\t\\t\\t\\t\\t\\tcommon = tmp_common;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tmatch_len[left][right] = common;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tqueue<Info> Q;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tInfo new_info;\\n\\t\\tnew_info.state = POW[i];\\n\\t\\tnew_info.num_used = 1;\\n\\t\\tnew_info.order = i;\\n\\t\\tnew_info.total_length = second_length[i];\\n\\t\\tQ.push(new_info);\\n\\t}\\n\\n\\tint ans = BIG_NUM;\\n\\n\\tchar ans_word[101],tmp_word[101];\\n\\tint work[N];\\n\\tstack<int> S;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif(Q.front().num_used == N){\\n\\n\\t\\t\\tif(ans >= Q.front().total_length ){\\n\\n\\t\\t\\t\\tll work_num = Q.front().order;\\n\\t\\t\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\t\\t\\tS.push(work_num%10);\\n\\t\\t\\t\\t\\twork_num /= 10;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\t\\t\\twork[i] = S.top();\\n\\t\\t\\t\\t\\tS.pop();\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tstrcpy(tmp_word,words[work[0]]);\\n\\t\\t\\t\\tint index = second_length[work[0]];\\n\\n\\t\\t\\t\\tint pre = work[0];\\n\\n\\t\\t\\t\\tfor(int i = 1; i < N; i++){\\n\\t\\t\\t\\t\\tfor(int k = match_len[pre][work[i]];words[work[i]][k] != '\\\\0'; k++){\\n\\t\\t\\t\\t\\t\\ttmp_word[index++] = words[work[i]][k];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tpre = work[i];\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\ttmp_word[Q.front().total_length] = '\\\\0';\\n\\n\\t\\t\\t\\tif(ans > Q.front().total_length){\\n\\t\\t\\t\\t\\tans = Q.front().total_length;\\n\\t\\t\\t\\t\\tstrcpy(ans_word,tmp_word);\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tif(strCmp2(ans_word,tmp_word) == 2){\\n\\t\\t\\t\\t\\t\\tstrcpy(ans_word,tmp_word);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tQ.pop();\\n\\t\\t}else if(Q.front().total_length >= ans){\\n\\t\\t\\tQ.pop();\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\t\\tif(!(Q.front().state & (1 << i))){\\n\\t\\t\\t\\t\\tInfo new_info;\\n\\t\\t\\t\\t\\tnew_info.state = Q.front().state+POW[i];\\n\\t\\t\\t\\t\\tnew_info.num_used = Q.front().num_used+1;\\n\\t\\t\\t\\t\\tnew_info.order = 10*Q.front().order+i;\\n\\t\\t\\t\\t\\tnew_info.total_length = Q.front().total_length+second_length[i]\\n\\t\\t\\t\\t\\t\\t\\t\\t-match_len[Q.front().order%10][i];\\n\\t\\t\\t\\t\\tQ.push(new_info);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%s\\\\n\\\",ans_word);\\n}\\n\\nint main() {\\n\\n\\tfor(int i = 0; i < 12; 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}\",\n \"accuracy\": 1,\n \"time_ms\": 520,\n \"memory_kb\": 63124,\n \"score_of_the_acc\": -1.0725,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2022_2521145\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\nvector<string>s;\\nint n;\\nstring t,ans;\\nmain(){\\n\\twhile(cin>>n,n){\\n\\t\\tset<string>ss;\\n\\t\\tans=\\\"zzzzzzzzzzzzzzzzzzzzzzzzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\\";\\n\\t\\tint p=0;\\n\\t\\tvector<int>v;\\n\\t\\ts.clear();\\n\\t\\tr(i,n){\\n\\t\\t\\tcin>>t;\\n\\t\\t\\tif(!ss.count(t)){\\n\\t\\t\\t\\ts.push_back(t);\\n\\t\\t\\t\\tss.insert(t);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tr(i,s.size())r(j,s.size())if(i!=j&&s[i].size()>=s[j].size()){\\n\\t\\t\\tr(k,s[i].size()){\\n\\t\\t\\t\\tint sum=0;\\n\\t\\t\\t\\tif(k+s[j].size()<=s[i].size()){\\n\\t\\t\\t\\tfor(int l=k;l-k<s[j].size();l++)\\n\\t\\t\\t\\t\\tif(s[i][l]==s[j][l-k])sum++;\\n\\t\\t\\t\\tif(sum==s[j].size()){\\n\\t\\t\\t\\t\\tv.push_back(j);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}}\\n\\t\\t}\\n\\t\\tsort(v.begin(),v.end());\\n\\t\\tv.erase(unique(v.begin(),v.end()),v.end());\\n\\t\\tr(i,v.size()){\\n\\t\\t\\ts.erase(s.begin()+v[i]+p);\\n\\t\\t\\tp--;n--;\\n\\t\\t}\\n\\t\\tsort(s.begin(),s.end());\\n\\t\\tdo{\\n\\t\\t\\tt=\\\"\\\";\\n\\t\\t\\tt+=s[0];\\n\\t\\t\\tfor(int i=1;i<s.size();i++){\\n\\t\\t\\t\\tint sum=0;\\n\\t\\t\\t\\tfor(int j=s[i-1].size()-1;j>=0;j--){\\n\\t\\t\\t\\t\\tint sum2=0,cnt=0;\\n\\t\\t\\t\\t\\tfor(int k=0;;k++){\\n\\t\\t\\t\\t\\t\\tif(k+j>=s[i-1].size())break;\\n\\t\\t\\t\\t\\t\\tif(s[i][k]==s[i-1][j+k])sum2++;\\n\\t\\t\\t\\t\\t\\telse goto L;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(!cnt)sum=max(sum,sum2);L:;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tt+=s[i].substr(sum);\\n\\t\\t\\t}\\n\\t\\t\\tif(ans.size()>t.size())ans=t;\\n\\t\\t\\telse if(ans.size()==t.size()) ans=min(ans,t);\\n\\t\\t}while(next_permutation(s.begin(),s.end()));\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6770,\n \"memory_kb\": 3180,\n \"score_of_the_acc\": -0.9629,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2022_2414407\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing pii = pair<int,int>;\\nusing ll = long long;\\n#define rep(i, j) for(int i=0; i < (int)(j); i++)\\n#define repeat(i, j, k) for(int i = (j); i < (int)(k); i++)\\n#define all(v) v.begin(),v.end()\\n//#define debug(x) cerr << #x << \\\" : \\\" << x << endl\\n#define debug(...)\\n\\ntemplate<class T> bool set_min(T &a, const T &b) { return a > b ? a = b, true : false; }\\ntemplate<class T> bool set_max(T &a, const T &b) { return a < b ? a = b, true : false; }\\n// vector\\ntemplate<class T> istream& operator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; }\\ntemplate<class T> ostream& operator << (ostream &os , const vector<T> &v) { for(const T &t : v) os << \\\"\\\\t\\\" << t; return os << endl; }\\n// pair\\ntemplate<class T, class U> ostream& operator << (ostream &os , const pair<T, U> &v) { return os << \\\"<\\\" << v.first << \\\", \\\" << v.second << \\\">\\\"; }\\n\\nconst int INF = 1 << 30;\\nconst ll INFL = 1LL << 60;\\n\\n\\nclass Solver {\\n public:\\n int N;\\n vector<string> S;\\n bool contain(const string &s, const string &word) {\\n rep(i, s.size()) {\\n bool ok = true;\\n rep(j, word.size()) {\\n if(i + j >= s.size() or s[i + j] != word[j]) {\\n ok = false; break;\\n }\\n }\\n if(ok) return true;\\n }\\n return false;\\n }\\n vector<string> merge(const string &s, const string &word) {\\n vector<string> res;\\n repeat(i, s.size() - word.size(), s.size()) {\\n if(i < 0) continue;\\n bool ok = true;\\n rep(j, word.size()) if(i + j < s.size() and s[i + j] != word[j]) ok = false;\\n if(ok) {\\n int same = s.size() - i;\\n res.emplace_back(s + word.substr(same));\\n }\\n }\\n res.emplace_back(s + word);\\n return res;\\n }\\n string calc(const string &s, int flg) {\\n debug(s);\\n string res;\\n rep(i, N) if(not (flg & (1 << i))) {\\n auto t = merge(s, S[i]);\\n for(string &tt : t) { \\n string res2 = calc(tt, flg | (1 << i));\\n if(res.size() == 0 or res2.size() < res.size()) res = res2;\\n else if(res2.size() == res.size()) set_min(res, res2);\\n }\\n }\\n if(res.size() > 0) return res;\\n return s;\\n }\\n \\n bool solve() {\\n cin >> N;\\n if(N == 0) return false; \\n S.resize(N); cin >> S;\\n vector<string> T;\\n rep(i, N) {\\n bool ok =true;\\n rep(j, N) if(i != j) {\\n if(S[i] == S[j]) {\\n if(i > j) {\\n ok = false;\\n break;\\n }\\n }\\n else if(contain(S[j], S[i])) {\\n ok = false;\\n break;\\n } \\n }\\n if(ok) T.push_back(S[i]);\\n }\\n debug(N); debug(S); debug(T);\\n swap(S, T);\\n N = S.size();\\n cout << calc(\\\"\\\", 0) << endl;\\n return true;\\n }\\n};\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n while(Solver().solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7040,\n \"memory_kb\": 3104,\n \"score_of_the_acc\": -1.0001,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2022_2413694\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <array>\\n#include <set>\\n#include <map>\\n#include <queue>\\n#include <tuple>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <functional>\\n#include <cassert>\\n#define repeat(i, n) for (int i = 0; (i) < int(n); ++(i))\\n#define repeat_from(i, m, n) for (int i = (m); (i) < int(n); ++(i))\\n#define repeat_reverse(i, n) for (int i = (n)-1; (i) >= 0; --(i))\\n#define repeat_from_reverse(i, m, n) for (int i = (n)-1; (i) >= int(m); --(i))\\n#define whole(f, x, ...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)\\n#define unittest_name_helper(counter) unittest_ ## counter\\n#define unittest_name(counter) unittest_name_helper(counter)\\n#define unittest __attribute__((constructor)) void unittest_name(__COUNTER__) ()\\nusing ll = long long;\\nusing namespace std;\\ntemplate <class T> inline void setmax(T & a, T const & b) { a = max(a, b); }\\ntemplate <class T> inline void setmin(T & a, T const & b) { a = min(a, b); }\\ntemplate <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }\\ntemplate <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }\\n\\nbool is_suffix(string const & a, string const & b) {\\n if (a.length() > b.length()) return false;\\n return b.compare(b.length() - a.length(), a.length(), a) == 0;\\n}\\nvoid setshort(string & a, string const & b) {\\n if (a.empty() or b.length() < a.length() or (a.length() == b.length() and b < a)) {\\n a = b;\\n }\\n}\\n\\nint main() {\\nassert (string(\\\"puyopuyo\\\").find(\\\"yop\\\") != string::npos);\\nassert (string(\\\"puyopuyo\\\").find(\\\"pop\\\") == string::npos);\\nassert (string(\\\"puyopuyo\\\").find(\\\"aaa\\\") == string::npos);\\nassert (string(\\\"puyo\\\").find(\\\"puyopuyo\\\") == string::npos);\\n while (true) {\\n // input\\n int n; cin >> n;\\n if (n == 0) break;\\n vector<string> word(n); repeat (i, n) cin >> word[i];\\n // solve\\n vector<string> dp(1 << n);\\n function<void (string const &, int)> go = [&](string const & s, int used) {\\nrepeat (i, n) if (used & (1 << i)) {\\nassert (s.find(word[i]) != string::npos);\\n}\\n repeat (i, n) if (not (used & (1 << i))) {\\n if (s.find(word[i]) != string::npos) {\\n used |= 1 << i;\\n }\\n }\\n setshort(dp[used], s);\\n repeat (i, n) if (not (used & (1 << i))) {\\n repeat_from (sep, 1, word[i].length()) {\\n if (is_suffix(word[i].substr(0, sep), s)) {\\n go(s + word[i].substr(sep), used | (1 << i));\\n }\\n }\\n }\\n };\\n repeat (i, n) {\\n go(word[i], 1 << i);\\n }\\nrepeat (a, 1 << n) if (not dp[a].empty()) {\\nrepeat (i, n) if (a & (1 << i)) {\\nassert (dp[a].find(word[i]) != string::npos);\\n}\\n}\\n// repeat (iteration, 3)\\n repeat (a, 1 << n) if (not dp[a].empty()) {\\n repeat (b, 1 << n) {\\n if ((b | a) == a) {\\n setshort(dp[b], dp[a]);\\n }\\n }\\n }\\n repeat_from (a, 1, 1 << n) {\\n assert (not dp[a].empty());\\n repeat (b, 1 << n) if (not dp[b].empty()) {\\n if (not (a & b)) {\\n setshort(dp[a | b], dp[a] + dp[b]);\\n setshort(dp[a | b], dp[b] + dp[a]);\\n }\\n }\\n }\\nrepeat (a, 1 << n) if (not dp[a].empty()) {\\nrepeat (i, n) if (a & (1 << i)) {\\nassert (dp[a].find(word[i]) != string::npos);\\n}\\n}\\n // output\\nrepeat (i, n) {\\nassert (dp[(1 << n) - 1].find(word[i]) != string::npos);\\n}\\n cout << dp[(1 << n) - 1] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3100,\n \"score_of_the_acc\": -0.0114,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2022_2142742\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define MOD 1000000007\\n#define INF 0x3f3f3f3f\\n#define INFL 0x3f3f3f3f3f3f3f3f\\n#define EPS (1e-10)\\n#define rep(i,n)for(int i=0;i<n;i++)\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int>P;\\n\\nstring s[10];\\nstring dp[1 << 10][10];\\nint main() {\\n\\tint n;\\n\\tstring inf; rep(i, 100)inf += 'z';\\n\\twhile (scanf(\\\"%d\\\", &n), n) {\\n\\t\\trep(i, n)cin >> s[i];\\n\\t\\trep(i, 1 << n)rep(j, n)dp[i][j] = inf;\\n\\t\\trep(i, n)dp[1 << i][i] = s[i];\\n\\t\\trep(i, 1 << n) {\\n\\t\\t\\trep(j, n) {\\n\\t\\t\\t\\tif (!(i >> j & 1))continue;\\n\\t\\t\\t\\tif (dp[i][j] == inf)continue;\\n\\t\\t\\t\\trep(k, n) {\\n\\t\\t\\t\\t\\tif (i >> k & 1)continue;\\n\\t\\t\\t\\t\\tstring t = dp[i | 1 << k][k];\\n\\t\\t\\t\\t\\tstring p = dp[i][j];\\n\\t\\t\\t\\t\\tint d = s[k].size();\\n\\t\\t\\t\\t\\twhile ((int)(p + s[k].substr(d)).find(s[k]) == -1)d--;\\n\\t\\t\\t\\t\\tp += s[k].substr(d);\\n\\t\\t\\t\\t\\tif (t.size() > p.size())dp[i | 1 << k][k] = p;\\n\\t\\t\\t\\t\\telse if (t.size() == p.size())dp[i | 1 << k][k] = min(dp[i | 1 << k][k], p);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstring ans = inf;\\n\\t\\trep(i, n) {\\n\\t\\t\\tstring t = dp[(1 << n) - 1][i];\\n\\t\\t\\tif (ans.size() > t.size())ans = t;\\n\\t\\t\\telse if (ans.size() == t.size())ans = min(ans, t);\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 3700,\n \"score_of_the_acc\": -0.047,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2022_2137607\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\nusing namespace std;\\nint x[14][14], n; string S[14];\\nstring dp[14][16384];\\nbool erased[14]; vector<int>vec;\\nint SSS(string S, string T) {\\n\\tfor (int i = min(S.size(), T.size()); i >= 0; i--) {\\n\\t\\tif (S.substr(S.size() - i, i) == T.substr(0, i))return i;\\n\\t}\\n}\\nint main() {\\n\\twhile (true) {\\n\\t\\tcin >> n; vec.clear(); if (n == 0)break; for (int i = 0; i < n; i++)cin >> S[i];\\n\\t\\tfor (int i = 0; i < 14; i++) {\\n\\t\\t\\terased[i] = false;\\n\\t\\t\\tfor (int j = 0; j < 16384; j++) { dp[i][j] = \\\"$\\\"; }\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tfor (int j = 0; j < n; j++) {\\n\\t\\t\\t\\tif (S[i].size() > S[j].size()) {\\n\\t\\t\\t\\t\\tfor (int k = 0; k <= S[i].size() - S[j].size(); k++) {\\n\\t\\t\\t\\t\\t\\tif (S[i].substr(k, S[j].size()) == S[j])erased[j] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < n; i++) { if (erased[i] == false)vec.push_back(i); }\\n\\t\\tn = vec.size(); for (int i = 0; i < n; i++)S[i] = S[vec[i]];\\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)x[i][j] = SSS(S[i], S[j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < n; i++) { dp[i][(1 << i)] = S[i]; }\\n\\t\\tfor (int j = 0; j < (1 << n); j++) {\\n\\t\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\t\\tif (dp[i][j] == \\\"$\\\")continue;\\n\\t\\t\\t\\tint bit[14]; for (int k = 0; k < n; k++)bit[k] = (j / (1 << k)) % 2;\\n\\t\\t\\t\\tfor (int k = 0; k < n; k++) {\\n\\t\\t\\t\\t\\tif (bit[k] == 1)continue;\\n\\t\\t\\t\\t\\tstring W1 = dp[i][j] + S[k].substr(x[i][k], S[k].size() - x[i][k]);\\n\\t\\t\\t\\t\\tif (dp[k][j + (1 << k)] == \\\"$\\\") { dp[k][j + (1 << k)] = W1; }\\n\\t\\t\\t\\t\\tif (dp[k][j + (1 << k)].size() > W1.size()) { dp[k][j + (1 << k)] = W1; }\\n\\t\\t\\t\\t\\tif (dp[k][j + (1 << k)].size() == W1.size() && dp[k][j + (1 << k)] > W1) { dp[k][j + (1 << k)] = W1; }\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstring minx = dp[0][(1 << n) - 1];\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tif (minx.size() > dp[i][(1 << n) - 1].size()) { minx = dp[i][(1 << n) - 1]; }\\n\\t\\t\\tif (minx.size() == dp[i][(1 << n) - 1].size() && minx > dp[i][(1 << n) - 1]) { minx = dp[i][(1 << n) - 1]; }\\n\\t\\t}\\n\\t\\tcout << minx << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 15836,\n \"score_of_the_acc\": -0.2506,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2022_2085814\",\n \"code_snippet\": \"#include <cstdio>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <cstring>\\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\\ntypedef pair<int,int> pi;\\n\\nint n;\\nvector<string> s,t;\\nint T;\\n\\nconst int INF=12345678;\\nint dp[15][1<<15];\\npi par[15][1<<15];\\n\\n// i,j???????????????????????±?????¨???????????????\\nint com[15][15];\\n\\nstring make_string(int now, int mask)\\n{\\n pi p=par[now][mask];\\n if(p.fi==-1) return t[now];\\n return make_string(p.fi,p.se)+t[now].substr(com[p.fi][now]);\\n}\\n\\nint main()\\n{\\n cin.tie(0);ios::sync_with_stdio(false);\\n\\n while(cin >>n,n)\\n {\\n s=vector<string>(n);\\n rep(i,n) cin >>s[i];\\n\\n vector<bool> use(n,true);\\n rep(i,n)rep(j,n)\\n {\\n if(i==j) continue;\\n\\n int I=s[i].size(), J=s[j].size();\\n if(I>J) continue;\\n\\n if(I==J)\\n {\\n if(s[i]==s[j] && i<j) use[i]=false;\\n }\\n else\\n {\\n rep(k,J-I+1)\\n {\\n if(s[i]==s[j].substr(k,I))\\n {\\n // cout <<s[i]<<\\\" \\\"<<s[j].substr(k,I)<<endl;\\n use[i]=false;\\n }\\n }\\n }\\n }\\n\\n t.clear();\\n rep(i,n) if(use[i]) t.pb(s[i]);\\n T=t.size();\\n // printf(\\\"T=%d\\\\n\\\", T);\\n\\n\\n memset(com,0,sizeof(com));\\n rep(i,T)rep(j,T)\\n {\\n if(i==j) continue;\\n int I=t[i].size(), J=t[j].size();\\n\\n // cout <<i<<\\\" \\\"<<j<<endl;\\n // cout <<t[i] << \\\" \\\"<<t[j]<<endl;\\n rep(k,min(I,J))\\n {\\n int len=k+1;\\n // cout <<\\\"len= \\\"<<len;\\n // cout <<t[i].substr(I-len,len)<<\\\" \\\"<<t[j].substr(0,len)<<'\\\\n';\\n if(t[i].substr(I-len,len)==t[j].substr(0,len)) com[i][j]=len;\\n }\\n\\n }\\n\\n fill(dp[0],dp[15],INF);\\n\\n // ??????\\n rep(i,T)\\n {\\n dp[i][1<<i]=t[i].size();\\n par[i][1<<i]=pi(-1,-1);\\n }\\n\\n for(int mask=1; mask<(1<<T); ++mask)\\n {\\n rep(before,T)if(mask>>before&1)\\n {\\n rep(i,T)if(!(mask>>i&1))\\n {\\n int add=t[i].size()-com[before][i];\\n if(dp[i][mask+(1<<i)]>dp[before][mask]+add)\\n {\\n dp[i][mask+(1<<i)]=dp[before][mask]+add;\\n par[i][mask+(1<<i)]=pi(before,mask);\\n }\\n else if(dp[i][mask+(1<<i)]==dp[before][mask]+add)\\n {\\n string old_s=make_string(i,mask+(1<<i));\\n string new_s=make_string(before,mask)+t[i].substr(com[before][i]);\\n\\n if(new_s<old_s) par[i][mask+(1<<i)] = pi(before,mask);\\n }\\n }\\n }\\n }\\n\\n int min_len=INF;\\n rep(i,T)\\n {\\n // printf(\\\" dp? %d\\\\n\\\", dp[i][(1<<T)-1]);\\n min_len=min(min_len, dp[i][(1<<T)-1]);\\n }\\n string ans=\\\"#\\\";\\n rep(i,T)\\n {\\n if(dp[i][(1<<T)-1]==min_len)\\n {\\n if(ans==\\\"#\\\") ans=make_string(i,(1<<T)-1);\\n else ans=min(ans,make_string(i,(1<<T)-1));\\n }\\n }\\n\\n // cout << \\\"Scenario #\\\" << sce+1 << '\\\\n';\\n cout << ans << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 5236,\n \"score_of_the_acc\": -0.0441,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2022_2083338\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n// does s contain t?\\n/*\\nbool contain(const string& s, const string& t)\\n{\\n if(s.size() < t.size()) return false;\\n int idx = 0;\\n bool flag = false;\\n for(int i = 0; i < t.size(); i++) {\\n flag = false;\\n for(int j = idx; j < s.size(); j++) {\\n if(t[i] == s[j]) idx = j+1, flag = true;\\n if(flag) break;\\n }\\n if(!flag) break;\\n }\\n return flag;\\n}\\n*/\\n\\nbool cmp(const string& left, const string& right)\\n{\\n if(left.size() != right.size()) return left.size() < right.size();\\n for(int i = 0; i < left.size(); i++) {\\n if(left[i] != right[i]) return left[i] < right[i];\\n }\\n return false;\\n}\\n\\n// additional string to let s contain t.\\n/*\\nstring addstr(const string& s, const string& t)\\n{\\n int idx = 0;\\n for(int i = 0; i < t.size(); i++) {\\n bool flag = false;\\n for(int j = idx; j < s.size(); j++) {\\n if(t[i] == s[j]) idx = j+1, flag = true;\\n if(flag) break;\\n }\\n if(!flag) return t.substr(i);\\n }\\n return \\\"\\\";\\n}\\n*/\\nstring addstr(string s, string t)\\n{\\n for(int i = 0; i < s.size(); i++) {\\n if(s.substr(i) == t.substr(0, s.size()-i)) return t.substr(s.size()-i);\\n }\\n return t;\\n}\\n\\nstring inf()\\n{\\n string ret = \\\"\\\";\\n for(int i = 0; i < 1000; i++) ret += \\\"~\\\";\\n return ret;\\n}\\n\\nint main()\\n{\\n int N;\\n while(cin >> N, N) {\\n vector<string> S(N);\\n for(int i = 0; i < N; i++) cin >> S[i];\\n sort(S.begin(), S.end(), cmp);\\n S.erase(unique(S.begin(), S.end()), S.end());\\n\\n vector<string> T;\\n for(int i = 0; i < S.size(); i++) {\\n bool flag = false;\\n for(int j = i+1; j < S.size(); j++) {\\n\\tif(S[j].find(S[i]) != string::npos) flag = true;\\n\\tif(flag) break;\\n }\\n if(!flag) T.push_back(S[i]);\\n }\\n \\n int M = T.size();\\n string add[11][11];\\n for(int i = 0; i < M; i++) {\\n for(int j = 0; j < M; j++) {\\n\\tadd[i][j] = addstr(T[i], T[j]);\\n }\\n }\\n \\n string dp[1<<11][11];\\n fill(dp[0], dp[1<<11], inf());\\n for(int i = 0; i < M; i++) dp[1<<i][i] = T[i];\\n \\n string ans = inf();\\n for(int i = 0; i < 1<<M; i++) {\\n for(int j = 0; j < M; j++) {\\n\\tif(dp[i][j] == inf()) continue;\\n\\tif(i == (1<<M)-1) {\\n\\t ans = min(ans, dp[i][j], cmp);\\n\\t}\\n\\tfor(int k = 0; k < M; k++) {\\n\\t if((i >> k) & 1) continue;\\n\\t dp[i|(1<<k)][k] = min(dp[i|(1<<k)][k], dp[i][j] + add[j][k], cmp);\\n\\t}\\n }\\n }\\n \\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 3508,\n \"score_of_the_acc\": -0.0708,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2022_2053451\",\n \"code_snippet\": \"#include <string>\\n#include <vector>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nint n; vector<string> s;\\nint main() {\\n\\twhile (cin >> n, n) {\\n\\t\\ts.resize(n);\\n\\t\\tfor (int i = 0; i < n; i++) cin >> s[i];\\n\\t\\tvector<int> flag(n, 0); // bit / i -> j\\n\\t\\tvector<vector<int> > cost(n, vector<int>(n)); // i -> j\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tfor (int j = 0; j < n; j++) {\\n\\t\\t\\t\\tif (s[i].find(s[j]) != string::npos) {\\n\\t\\t\\t\\t\\tflag[i] |= 1 << j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tfor (int j = 0; j < n; j++) {\\n\\t\\t\\t\\tfor (int k = 0; k <= s[i].size(); k++) {\\n\\t\\t\\t\\t\\tstring ret = s[i].substr(0, k) + s[j];\\n\\t\\t\\t\\t\\tif (ret.substr(0, s[i].size()) == s[i]) {\\n\\t\\t\\t\\t\\t\\tcost[i][j] = ret.size() - s[i].size();\\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\\tvector<vector<string> > dp(1 << n, vector<string>(n, string(101, 'z')));\\n\\t\\tdp[0][0] = \\\"\\\";\\n\\t\\tfor (int i = 1; i < 1 << n; i++) {\\n\\t\\t\\tfor (int j = 0; j < n; j++) {\\n\\t\\t\\t\\tif (!(i & (1 << j))) continue;\\n\\t\\t\\t\\tint p = i - (1 << j);\\n\\t\\t\\t\\tfor (int k = 0; k < n; k++) {\\n\\t\\t\\t\\t\\tstring con = (p != 0 ? s[j].substr(s[j].size() - cost[k][j], cost[k][j]) : s[j]);\\n\\t\\t\\t\\t\\tif (dp[i][j].size() > dp[p][k].size() + con.size()) dp[i][j] = dp[p][k] + con;\\n\\t\\t\\t\\t\\telse if (dp[i][j].size() == dp[p][k].size() + con.size() && dp[i][j] > dp[p][k] + con) dp[i][j] = dp[p][k] + con;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstring ret(101, 'z');\\n\\t\\tfor (int i = 1; i < 1 << n; i++) {\\n\\t\\t\\tint bit = i;\\n\\t\\t\\tfor (int j = 0; j < n; j++) {\\n\\t\\t\\t\\tif (i & (1 << j)) bit |= flag[j];\\n\\t\\t\\t}\\n\\t\\t\\tif (bit == (1 << n) - 1) {\\n\\t\\t\\t\\tfor (int j = 0; j < n; j++) {\\n\\t\\t\\t\\t\\tif (ret.size() > dp[i][j].size()) ret = dp[i][j];\\n\\t\\t\\t\\t\\telse if (ret.size() == dp[i][j].size() && ret > dp[i][j]) ret = dp[i][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ret << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.0152,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2022_2042733\",\n \"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<(n);i++)\\n#define rep2(i,a,b) for (int i=(a);i<(b);i++)\\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\\n#define rrep2(i,a,b) for (int i=(a)-1;i>=b;i--)\\n#define all(a) (a).begin(),(a).end()\\n#define rall(a) (a).rbegin(),(a).rend()\\n#define printV(v) for(auto x : v){cout << x << \\\" \\\";} cout << endl\\n#define printVS(vs) for(auto x : vs){cout << x << endl;}\\n#define printVV(vv) for(auto v : vv){for(auto&& x : v){cout << x << \\\" \\\";}cout << endl;}\\n#define printP(p) cout << p.first << \\\" \\\" << p.second << endl\\n#define printVP(vp) for(auto p : vp) printP(p);\\n\\ntypedef long long ll;\\ntypedef pair<int, int> Pii;\\ntypedef tuple<int, int, int> TUPLE;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<vvi> vvvi;\\ntypedef vector<Pii> vp;\\ntypedef vector<vector<int>> Graph;\\nconst int inf = 1e9;\\nconst int mod = 1e9 + 7;\\n\\nint n;\\nvector<string> s;\\nvvi d;\\nvvi dp;\\n\\nint common(string s, string t) {\\n for (int k = min(s.size(), t.size()); k >= 0; k--) {\\n if (s.substr((int)s.size() - k) == t.substr(0, k)) {\\n return k;\\n }\\n }\\n}\\n\\nstring concat(string s, string t) {\\n int k = common(s, t);\\n return s + t.substr(k);\\n}\\n\\nstring mymin(string s, string t) {\\n if (s.size() < t.size()) return s;\\n if (s.size() > t.size()) return t;\\n return s < t ? s : t;\\n}\\n\\nstring dfs(int state, int j, string str) {\\n if (__builtin_popcount(state) == 1) return concat(s[j], str);\\n\\n string ret(101, 'z');\\n rep(i, n) {\\n if (!((state >> i) & 1)) continue;\\n if (dp[state - (1 << j)][i] + d[i][j] == dp[state][j]) {\\n ret = mymin(ret, dfs(state - (1 << j), i, concat(s[i], str)));\\n }\\n }\\n\\n return ret;\\n}\\n\\n\\n\\nsigned main() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(0);\\n\\n int t = 0;\\n while (cin >> n, n) {\\n s.clear();\\n s.resize(n);\\n rep(i, n) cin >> s[i];\\n\\n vector<bool> alive(n, true);\\n rep(i, n) {\\n rep2(j, i + 1, n) {\\n if (s[i] == s[j]) {\\n alive[j] = false;\\n }\\n }\\n }\\n rep(i, n) {\\n rep(j, n) {\\n if (i == j) continue;\\n if (s[i] != s[j] && s[i].find(s[j]) != string::npos) {\\n alive[j] = false;\\n }\\n }\\n }\\n\\n {\\n vector<string> t;\\n rep(i, n) {\\n if (alive[i]) {\\n t.emplace_back(s[i]);\\n }\\n }\\n s = t;\\n n = s.size();\\n }\\n\\n d.clear();\\n d.resize(n, vi(n));\\n rep(i, n) {\\n rep(j, n) {\\n if (i == j) continue;\\n d[i][j] = common(s[i], s[j]);\\n }\\n }\\n\\n dp.clear();\\n dp.resize(1 << n, vi(n, -1));\\n rep(i, n) {\\n dp[1 << i][i] = 0;\\n }\\n rep(state, 1 << n) {\\n rep(i, n) {\\n if (dp[state][i] == -1) continue;\\n rep(j, n) {\\n if ((state >> j) & 1) continue;\\n dp[state | (1 << j)][j] = max(dp[state | (1 << j)][j], dp[state][i] + d[i][j]);\\n }\\n }\\n }\\n\\n int mx = *max_element(all(dp[(1 << n) - 1]));\\n string ans(101, 'z');\\n rep(j, n) {\\n if (dp[(1 << n) - 1][j] == mx) {\\n ans = mymin(ans, dfs((1 << n) - 1, j, s[j]));\\n }\\n }\\n cout << ans << endl;\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 890,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -0.128,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2022_2042729\",\n \"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<(n);i++)\\n#define rep2(i,a,b) for (int i=(a);i<(b);i++)\\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\\n#define rrep2(i,a,b) for (int i=(a)-1;i>=b;i--)\\n#define all(a) (a).begin(),(a).end()\\n#define rall(a) (a).rbegin(),(a).rend()\\n#define printV(v) for(auto x : v){cout << x << \\\" \\\";} cout << endl\\n#define printVS(vs) for(auto x : vs){cout << x << endl;}\\n#define printVV(vv) for(auto v : vv){for(auto&& x : v){cout << x << \\\" \\\";}cout << endl;}\\n#define printP(p) cout << p.first << \\\" \\\" << p.second << endl\\n#define printVP(vp) for(auto p : vp) printP(p);\\n\\ntypedef long long ll;\\ntypedef pair<int, int> Pii;\\ntypedef tuple<int, int, int> TUPLE;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<vvi> vvvi;\\ntypedef vector<Pii> vp;\\ntypedef vector<vector<int>> Graph;\\nconst int inf = 1e9;\\nconst int mod = 1e9 + 7;\\n\\nint n;\\nvector<string> s(n);\\nvvi d(n, vi(n));\\nvvi dp(1 << n, vi(n, -1));\\n\\nint common(string s, string t) {\\n for (int k = min(s.size(), t.size()); k >= 0; k--) {\\n if (s.substr((int)s.size() - k) == t.substr(0, k)) {\\n return k;\\n }\\n }\\n}\\n\\nstring concat(string s, string t) {\\n int k = common(s, t);\\n return s + t.substr(k);\\n}\\n\\nstring mymin(string s, string t) {\\n if (s.size() < t.size()) return s;\\n if (s.size() > t.size()) return t;\\n return s < t ? s : t;\\n}\\n\\nstring dfs(int state, int j, string str) {\\n // cout << state << \\\" \\\" << j << \\\" \\\" << str << endl;\\n // if (state == 0) return str;\\n if (__builtin_popcount(state) == 1) return concat(s[j], str);\\n\\n string ret(101, 'z');\\n rep(i, n) {\\n if (!((state >> i) & 1)) continue;\\n if (dp[state - (1 << j)][i] + d[i][j] == dp[state][j]) {\\n ret = mymin(ret, dfs(state - (1 << j), i, concat(s[i], str)));\\n }\\n }\\n\\n return ret;\\n}\\n\\n\\n\\nsigned main() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(0);\\n\\n int t = 0;\\n while (cin >> n, n) {\\n s.clear();\\n s.resize(n);\\n rep(i, n) cin >> s[i];\\n\\n // cout << t++ << endl;\\n // printVS(s);\\n\\n vector<bool> alive(n, true);\\n rep(i, n) {\\n rep2(j, i + 1, n) {\\n if (s[i] == s[j]) {\\n alive[j] = false;\\n }\\n }\\n }\\n rep(i, n) {\\n rep(j, n) {\\n if (i == j) continue;\\n if (s[i] != s[j] && s[i].find(s[j]) != string::npos) {\\n alive[j] = false;\\n }\\n }\\n }\\n\\n {\\n vector<string> t;\\n rep(i, n) {\\n if (alive[i]) {\\n t.emplace_back(s[i]);\\n }\\n }\\n s = t;\\n n = s.size();\\n }\\n\\n // cout << n << endl;\\n // printVS(s);\\n\\n d.clear();\\n d.resize(n, vi(n));\\n rep(i, n) {\\n rep(j, n) {\\n if (i == j) continue;\\n d[i][j] = common(s[i], s[j]);\\n }\\n }\\n // printVV(d);\\n // cout << endl;\\n\\n dp.clear();\\n dp.resize(1 << n, vi(n, -1));\\n rep(i, n) {\\n dp[1 << i][i] = 0;\\n }\\n rep(state, 1 << n) {\\n rep(i, n) {\\n if (dp[state][i] == -1) continue;\\n rep(j, n) {\\n if ((state >> j) & 1) continue;\\n dp[state | (1 << j)][j] = max(dp[state | (1 << j)][j], dp[state][i] + d[i][j]);\\n }\\n }\\n }\\n // printVV(dp);\\n // cout << endl;\\n\\n int mx = *max_element(all(dp[(1 << n) - 1]));\\n string ans(101, 'z');\\n rep(j, n) {\\n if (dp[(1 << n) - 1][j] == mx) {\\n ans = mymin(ans, dfs((1 << n) - 1, j, s[j]));\\n }\\n }\\n // cout << \\\"* ans = \\\" << ans << endl;\\n cout << ans << endl;\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 890,\n \"memory_kb\": 3248,\n \"score_of_the_acc\": -0.1276,\n \"final_rank\": 10\n }\n]","isConversational":false}}},{"rowIdx":1058,"cells":{"group_id":{"kind":"string","value":"aoj_2027_cpp"},"problem_description":{"kind":"string","value":"Problem E:\nReading a Chord\nIn this problem, you are required to write a program that enumerates all chord names for given\ntones.\nWe suppose an ordinary scale that consists of the following 12 tones:\nC, C\n#\n, D, D\n#\n, E, F, F\n#\n, G, G\n#\n, A, A\n#\n, B\nTwo adjacent tones are different by a\nhalf\nstep; the right one is higher. Hence, for example, the\ntone G is higher than the tone E by three half steps. In addition, the tone C is higher than the\ntone B by a half step. Strictly speaking, the tone C of the next octave follows the tone B, but\noctaves do not matter in this problem.\nA chord consists of two or more different tones, and is called by its\nchord name\n. A chord may be\nrepresented by multiple chord names, but each chord name represents exactly one set of tones.\nIn general, a chord is represented by a basic chord pattern (\nbase chord\n) and additional tones\n(\ntension\n) as needed. In this problem, we consider five basic patterns as listed below, and up to\none additional tone.\nFigure 1: Base chords (only shown those built on C)\nThe chords listed above are built on the tone C, and thus their names begin with C. The tone\nthat a chord is built on (the tone C for these chords) is called the\nroot\nof the chord.\nA chord specifies its root by an absolute tone, and its other components by tones relative to its\nroot. Thus we can obtain another chord by shifting all components of a chord. For example, the\nchord name D represents a chord consisting of the tones D, F\n#\nand A, which are the shifted-up\ntones of C, E and G (which are components of the chord C) by two half steps.\nAn additional tone, a tension, is represented by a number that may be preceding a plus or\nminus sign, and designated parentheses after the basic pattern. The figure below denotes which\nnumber is used to indicate each tone.\nFigure 2: Tensions for C chords\nFor example, C(9) represents the chord C with the additional tone D, that is, a chord that\nconsists of C, D, E and G. Similarly, C(+11) represents the chord C plus the tone F\n#\n.\nThe numbers that specify tensions denote relative tones to the roots of chords like the compo-\nnents of the chords. Thus change of the root also changes the tones specified by the number, as\nillustrated below.\nFigure 3: Tensions for E chords\n+5 and -5 are the special tensions. They do not indicate to add another tone to the chords,\nbut to sharp (shift half-step up) or flat (shift half-step down) the fifth tone (the tone seven half\nsteps higher than the root). Therefore, for example, C(+5) represents a chord that consists of\nC, E and G\n#\n, not C, E, G and G\n#\n.\nFigure 4 describes the syntax of chords in Backus-Naur Form.\nNow suppose we find chord names for the tones C, E and G. First, we easily find the chord C\nconsists of the tones C, E and G by looking up the base chord table shown above. Therefore\n‘C’ should be printed. We have one more chord name for those tones. The chord Em obviously\nrepresents the set of tones E, G and B. Here, if you sharp the tone B, we have \n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2027_3269182","code_snippet":"#include \"bits/stdc++.h\"\n\n#pragma warning(disable:4996)\nusing namespace std;\nstring root_sts = \"C ,C#,D ,D#,E ,F ,F#,G ,G#,A ,A#,B \";\n\nint get_num(string name) {\n\n\tint k= root_sts.find(name);\n\tstring l= root_sts.substr(0,k);\n\treturn count(l.begin(),l.end(),',');\n}\nbool check(vector<int>a, vector<int>b) {\n\tfor (auto& k : a) {\n\t\tk%=12;\n\t}\n\tfor (auto& k : b) {\n\t\tk %= 12;\n\t}\n\tsort(a.begin(),a.end());\n\tsort(b.begin(),b.end());\n\treturn a==b;\n}\n\nint main() {\n\tint Q;cin>>Q;\n\twhile (Q--) {\n\t\tint N;cin>>N;\n\t\tvector<int>nums(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tstring name;cin>>name;nums[i]=get_num(name);\n\t\t}\n\t\tsort(nums.begin(),nums.end());\n\n\t\tvector<vector<int>>components = {\n\t\t\tvector<int>{0,4,7},\n\t\t\tvector<int>{0,4,7,10},\n\n\t\t\tvector<int>{0,4,7,11},\n\n\t\t\tvector<int>{0,3,7},\n\t\t\tvector<int>{0,3,7,10},\n\n\t\t};\n\t\tvector<string>chord_names = {\n\t\t\t\"\",\n\t\t\t\"7\",\n\t\t\t\"M7\",\n\t\t\t\"m\",\n\t\t\t\"m7\"\n\t\t};\n\t\tvector<string>anss;\n\t\tfor (int root = 0; root < 12; ++root) {\n\t\t\tstring root_name = root_sts.substr(root * 3, 2);\n\n\t\t\tif(root_name[1]==' ')root_name.pop_back();\n\t\t\tfor (int chord = 0; chord < 5; ++chord) {\n\t\t\t\tstring chord_name=chord_names[chord];\n\t\t\t\tstring tension_name;\n\t\t\t\t{\n\t\t\t\t\tvector<string>tension_bases{\n\t\t\t\t\t\t\"5\",\n\t\t\t\t\t\t\"9\"\n\t\t\t\t\t\t,\"11\",\n\t\t\t\t\t\t\"13\"\n\t\t\t\t\t};\n\t\t\t\t\tfor (int tension_part = 0; tension_part < 4; ++tension_part) {\n\t\t\t\t\t\tfor (int plus = -1; plus <= 1; plus++) {\n\t\t\t\t\t\t\tstring minus;\n\t\t\t\t\t\t\tif (plus == 1) {\n\t\t\t\t\t\t\t\tminus=\"+\";\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if (plus == -1) {\n\t\t\t\t\t\t\t\tminus=\"-\";\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tstring tension_name=\"(\"+\n\t\t\t\t\t\t\t\tminus+tension_bases[tension_part]\n\t\t\t\t\t\t\t\t+\")\";\n\t\t\t\t\t\t\tvector<int>voices(components[chord]);\n\t\t\t\t\t\t\tif (tension_part == 0) {\n\t\t\t\t\t\t\t\tif (plus == 0) {\n\t\t\t\t\t\t\t\t\ttension_name=\"\";\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tvoices[2]+=plus;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\tif (tension_part == 1) {\n\t\t\t\t\t\t\t\t\tvoices.push_back(2+plus);\n\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse if (tension_part == 2) {\n\t\t\t\t\t\t\t\t\tvoices.push_back(5+plus);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse if (tension_part == 3) {\n\t\t\t\t\t\t\t\t\tvoices.push_back(9+plus);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor(auto &vo:voices)vo+=root;\n\t\t\t\t\t\t\tif (check(voices, nums)) {\n\t\t\t\t\t\t\t\tstring ans=root_name\n\t\t\t\t\t\t\t\t\t+chord_name+tension_name;\n\t\t\t\t\t\t\t\tanss.push_back(ans);\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\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (anss.empty()) {\n\t\t\tcout<<\"UNKNOWN\"<<endl;\n\t\t}\n\t\telse {\n\t\t\tfor (int i = 0; i < anss.size(); ++i) {\n\t\t\t\tcout<<anss[i];\n\t\t\t\tif(i==anss.size()-1)cout<<endl;\n\t\t\t\telse cout<<\" \";\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":430,"memory_kb":3016,"score_of_the_acc":-1.6417,"final_rank":10},{"submission_id":"aoj_2027_3118618","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 12\n\nstruct Info{\n\tInfo(int arg_tone_id,int arg_code_id,int arg_tension_op,int arg_tension_value,bool arg_is_tension){\n\t\ttone_id = arg_tone_id;\n\t\tcode_id = arg_code_id;\n\t\ttension_op = arg_tension_op;\n\t\ttension_value = arg_tension_value;\n\t\tis_tension = arg_is_tension;\n\t}\n\tint tone_id,code_id,tension_op,tension_value;\n\tbool is_tension;\n};\n\nint POW[NUM];\nint tension_array[4] = {9,11,13,5};\nint diff_table[3][3] = {{1,2,3},{4,5,6},{8,9,10}};\nchar tone_name[NUM][3] = {\"C\",\"C#\",\"D\",\"D#\",\"E\",\"F\",\"F#\",\"G\",\"G#\",\"A\",\"A#\",\"B\"};\nchar code_name[NUM][3] = {\"@\",\"7\",\"M7\",\"m\",\"m7\"};\nvector<int> component[5];\nvector<Info> ANS;\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\n//該当するtoneのidを返却する\nint get_id(char buf[3]){\n\n\tfor(int i = 0; i < NUM; i++){\n\t\tif(strCmp(tone_name[i],buf)){\n\t\t\treturn i;\n\t\t}\n\t}\n\n\treturn -1;\n}\n\nint get_state(bool check[NUM]){\n\n\tint ret = 0;\n\n\tfor(int i = 0; i < NUM; i++){\n\t\tif(check[i]){\n\t\t\tret += POW[i];\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nvoid print_Info(Info info){\n\n\tprintf(\"%s\",tone_name[info.tone_id]);\n\n\tif(info.code_id != 0){\n\n\t\tprintf(\"%s\",code_name[info.code_id]);\n\t}\n\tif(!info.is_tension)return;\n\n\tprintf(\"(\");\n\n\tif(info.tension_op != 0){\n\n\t\tif(info.tension_op > 0){\n\n\t\t\tprintf(\"+\");\n\n\t\t}else{\n\n\t\t\tprintf(\"-\");\n\t\t}\n\t}\n\tprintf(\"%d\",info.tension_value);\n\tprintf(\")\");\n}\n\nvoid dfs(int ans_state){\n\n\tint tmp,tmp_state,tmp_value,diff,tmp_loc;\n\tbool check[12],pre;\n\n\tfor(int base_tone = 0; base_tone < NUM; base_tone++){\n\t\tfor(int cord = 0; cord < 5; cord++){\n\n\t\t\tfor(int i = 0; i < NUM; i++){\n\t\t\t\tcheck[i] = false;\n\t\t\t}\n\t\t\tfor(int i = 0; i < component[cord].size(); i++){\n\t\t\t\tcheck[(base_tone+component[cord][i])%12] = true;\n\t\t\t}\n\n\t\t\ttmp_state = get_state(check);\n\n\t\t\tif(tmp_state == ans_state){\n\t\t\t\tANS.push_back(Info(base_tone,cord,0,0,false)); //テンション無しで見つかればcontinue\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t//テンションを全探索\n\t\t\tfor(int t = 0; t < 4; t++){\n\n\t\t\t\ttmp_value = tension_array[t];\n\n\t\t\t\tif(tmp_value != 5){\n\t\t\t\t\t//各数字について、マイナス、ノーマル、プラスの3つ\n\t\t\t\t\tfor(int a = 0; a < 3; a++){\n\n\t\t\t\t\t\tdiff = diff_table[t][a]; //base_toneからの相対位置\n\t\t\t\t\t\ttmp_loc = (base_tone+diff)%12;\n\t\t\t\t\t\tpre = check[tmp_loc];\n\t\t\t\t\t\tcheck[tmp_loc] = true;\n\t\t\t\t\t\ttmp_state = get_state(check);\n\t\t\t\t\t\tif(tmp_state == ans_state){\n\t\t\t\t\t\t\tANS.push_back(Info(base_tone,cord,a-1,tmp_value,true));\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcheck[tmp_loc] = pre;\n\t\t\t\t\t}\n\n\t\t\t\t}else{ //tmp_value == 5\n\n\t\t\t\t\t//★base_toneより7半音高い音を上下させる\n\t\t\t\t\ttmp_loc = (base_tone+7)%12;\n\t\t\t\t\tcheck[tmp_loc] = false;\n\n\t\t\t\t\t//マイナス\n\t\t\t\t\tpre = check[(tmp_loc+11)%12];\n\t\t\t\t\tcheck[(tmp_loc+11)%12] = true; //-1の代わりに11\n\t\t\t\t\ttmp_state = get_state(check);\n\t\t\t\t\tif(tmp_state == ans_state){\n\t\t\t\t\t\tANS.push_back(Info(base_tone,cord,-1,tmp_value,true));\n\t\t\t\t\t}\n\t\t\t\t\tcheck[(tmp_loc+11)%12] = pre;\n\n\t\t\t\t\t//プラス\n\t\t\t\t\tpre = check[(tmp_loc+1)%12];\n\t\t\t\t\tcheck[(tmp_loc+1)%12] = true;\n\t\t\t\t\ttmp_state = get_state(check);\n\t\t\t\t\tif(tmp_state == ans_state){\n\t\t\t\t\t\tANS.push_back(Info(base_tone,cord,1,tmp_value,true));\n\t\t\t\t\t}\n\t\t\t\t\tcheck[(tmp_loc+1)%12] = pre;\n\n\t\t\t\t\tcheck[tmp_loc] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nvoid func(){\n\n\tint num;\n\tchar buf[3];\n\n\tscanf(\"%d\",&num);\n\n\tint tmp_state = 0;\n\n\tfor(int loop = 0; loop < num; loop++){\n\t\tscanf(\"%s\",buf);\n\t\ttmp_state += POW[get_id(buf)];\n\t}\n\n\tANS.clear();\n\n\tdfs(tmp_state);\n\n\tif(ANS.size() == 0){\n\t\tprintf(\"UNKNOWN\\n\");\n\t\treturn;\n\t}\n\n\tprint_Info(ANS[0]);\n\tfor(int i = 1; i < ANS.size(); i++){\n\t\tprintf(\" \");\n\t\tprint_Info(ANS[i]);\n\t}\n\n\tprintf(\"\\n\");\n}\n\n\nint main(){\n\n\t//何もなし\n\tcomponent[0].push_back(0);\n\tcomponent[0].push_back(4);\n\tcomponent[0].push_back(7);\n\n\t//7\n\tcomponent[1].push_back(0);\n\tcomponent[1].push_back(4);\n\tcomponent[1].push_back(7);\n\tcomponent[1].push_back(10);\n\n\t//M7\n\tcomponent[2].push_back(0);\n\tcomponent[2].push_back(4);\n\tcomponent[2].push_back(7);\n\tcomponent[2].push_back(11);\n\n\t//m\n\tcomponent[3].push_back(0);\n\tcomponent[3].push_back(3);\n\tcomponent[3].push_back(7);\n\n\t//m7\n\tcomponent[4].push_back(0);\n\tcomponent[4].push_back(3);\n\tcomponent[4].push_back(7);\n\tcomponent[4].push_back(10);\n\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < NUM; i++){\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\tint num_case;\n\n\tscanf(\"%d\",&num_case);\n\n\tfor(int loop = 0; loop < num_case; loop++){\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3164,"score_of_the_acc":-1.0164,"final_rank":7},{"submission_id":"aoj_2027_2285885","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n \nint main() {\n string s[12]={\"C\",\"C#\",\"D\",\"D#\",\"E\",\"F\",\"F#\",\"G\",\"G#\",\"A\",\"A#\",\"B\"};\n string t[5]={\"\",\"7\",\"M7\",\"m\",\"m7\"};\n string r[11]={\"\",\"-9\",\"9\",\"+9\",\"-11\",\"11\",\"+11\",\"\",\"-13\",\"13\",\"+13\"};\n int d[5][4]={{0,4,7,0},{0,4,7,10},{0,4,7,11},{0,3,7,0},{0,3,7,10}};\n int T;\n cin >> T;\n while(T--) {\n int n;\n cin >> n;\n vector<int> a(12,0);\n for(int i=0; i<n; i++) {\n string e;\n cin >> e;\n for(int j=0; j<12; j++) {\n if(s[j]==e) a[j]=1;\n }\n }\n vector<string> ans;\n for(int i=0; i<12; i++) {\n for(int j=0; j<5; j++) {\n vector<int> b(12,0);\n for(int k=0; k<4; k++) b[(i+d[j][k])%12]=1;\n if(a==b) {\n ans.push_back(s[i]+t[j]);\n continue;\n }\n for(int k=1; k<11; k++) {\n if(k==7) continue;\n int x=b[(i+k)%12];\n b[(i+k)%12]=1;\n if(a==b) ans.push_back(s[i]+t[j]+\"(\"+r[k]+\")\");\n b[(i+k)%12]=x;\n }\n b[(i+7)%12]=0;b[(i+6)%12]=1;\n if(a==b) ans.push_back(s[i]+t[j]+\"(-5)\");\n b[(i+6)%12]=0;b[(i+8)%12]=1;\n if(a==b) ans.push_back(s[i]+t[j]+\"(+5)\");\n }\n }\n if(ans.size()) {\n for(int i=0; i<ans.size(); i++) {\n if(i) cout << \" \";\n cout << ans[i];\n }\n cout << endl;\n } else cout << \"UNKNOWN\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3148,"score_of_the_acc":-0.9949,"final_rank":6},{"submission_id":"aoj_2027_2285652","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n string s[12]={\"C\",\"C#\",\"D\",\"D#\",\"E\",\"F\",\"F#\",\"G\",\"G#\",\"A\",\"A#\",\"B\"};\n string t[5]={\"\",\"7\",\"M7\",\"m\",\"m7\"};\n string r[11]={\"\",\"-9\",\"9\",\"+9\",\"-11\",\"11\",\"+11\",\"\",\"-13\",\"13\",\"+13\"};\n int d[5][4]={{0,4,7,-1},{0,4,7,10},{0,4,7,11},{0,3,7,-1},{0,3,7,10}};\n int T;\n cin >> T;\n while(T--) {\n int n;\n cin >> n;\n vector<int> a(12,0);\n for(int i=0; i<n; i++) {\n string e;\n cin >> e;\n for(int j=0; j<12; j++) {\n if(s[j]==e) {\n a[j]=1;\n break;\n }\n }\n }\n vector<string> ans;\n for(int i=0; i<12; i++) {\n for(int j=0; j<5; j++) {\n vector<int> b(12,0);\n for(int k=0; k<4; k++) {\n if(d[j][k]==-1) break;\n b[(i+d[j][k])%12]=1;\n }\n if(a==b) {\n ans.push_back(s[i]+t[j]);\n continue;\n }\n for(int k=1; k<11; k++) {\n if(k==7) continue;\n int x=b[(i+k)%12];\n b[(i+k)%12]=1;\n if(a==b) ans.push_back(s[i]+t[j]+\"(\"+r[k]+\")\");\n b[(i+k)%12]=x;\n }\n b[(i+7)%12]=0;b[(i+6)%12]=1;\n if(a==b) ans.push_back(s[i]+t[j]+\"(-5)\");\n b[(i+6)%12]=0;b[(i+8)%12]=1;\n if(a==b) ans.push_back(s[i]+t[j]+\"(+5)\");\n }\n }\n if(ans.size()) {\n for(int i=0; i<ans.size(); i++) {\n if(i) cout << \" \";\n cout << ans[i];\n }\n cout << endl;\n } else cout << \"UNKNOWN\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3132,"score_of_the_acc":-0.9899,"final_rank":5},{"submission_id":"aoj_2027_911715","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<sstream>\n\nusing namespace std;\n\nstruct Code{\n string name;\n vector<string> sound;\n};\n\nconst int KIND = 12;\nstring sound[] = {\"C\",\"C#\",\"D\",\"D#\",\"E\",\"F\",\"F#\",\"G\",\"G#\",\"A\",\"A#\",\"B\"};\n\nvector<string> make_vec(const string& s){\n stringstream ss(s);\n vector<string> res;\n string str;\n while(ss >> str) res.push_back(str);\n return res;\n}\n\nint get_index(const string& s){\n for(int i = 0; i < KIND; i++) if(sound[i] == s) return i;\n return -1;\n}\n\nCode shift(Code c, int n){\n c.name = sound[n] + c.name.substr(1);\n \n vector<string> tmp(c.sound.size());\n for(int i = 0; i < (int)tmp.size(); i++){\n int idx = get_index(c.sound[i]);\n tmp[i] = sound[(idx+n)%KIND];\n }\n sort(tmp.begin(),tmp.end());\n c.sound = tmp;\n return c;\n}\n\nstring to_str(int n){\n ostringstream oss;\n oss << n;\n return oss.str();\n}\n\nvector<string> get_sound(int n){\n if(n == 5) return make_vec(\"F# G G#\");\n if(n == 9) return make_vec(\"C# D D#\");\n if(n == 11) return make_vec(\"E F F#\");\n if(n == 13) return make_vec(\"G# A A#\");\n return make_vec(\"ERROR\");\n}\n\nCode change_tension(Code c, int n, int type){\n vector<string> v = get_sound(n);\n int pos = -1;\n for(int i = 0; i < (int)c.sound.size(); i++)\n for(int j = 0; j < (int)v.size(); j++)\n if(c.sound[i] == v[j]) pos = i;\n \n string op = \"\";\n if(type == 0) op = \"-\";\n if(type == 2) op = \"+\";\n\n c.name += \"(\" + op + to_str(n) + \")\";\n \n if(n == 5){\n if(pos == -1) c.sound.push_back(v[type]);\n else c.sound[pos] = v[type];\n\n }else{\n if(pos == -1 || c.sound[pos] != v[type]) c.sound.push_back(v[type]);\n }\n // if(pos == -1 || c.sound[pos] != v[type]) c.sound.push_back(v[type]);\n\n sort(c.sound.begin(), c.sound.end());\n return c;\n}\n\nvoid print(const vector<Code>& v){\n cout << \"--------- begin -----------\" << endl;\n \n for(int i = 0; i < (int)v.size(); i++){\n cout << v[i].name << endl;\n for(int j = 0; j < (int)v[i].sound.size(); j++) cout << v[i].sound[j] << \" \";\n cout << endl;\n }\n cout << \"--------- end -----------\" << endl;\n}\n\nvector<Code> make(){\n vector<Code> res, tmp;\n Code base[5];\n base[0] = (Code){\"C\", make_vec(\"C E G\")};\n base[1] = (Code){\"C7\",make_vec(\"C E G A#\")};\n base[2] = (Code){\"CM7\", make_vec(\"C E G B\")};\n base[3] = (Code){\"Cm\", make_vec(\"C D# G\")};\n base[4] = (Code){\"Cm7\", make_vec(\"C D# G A#\")};\n\n for(int i = 0; i < 5; i++){\n sort(base[i].sound.begin(), base[i].sound.end());\n res.push_back(base[i]);\n tmp.push_back(base[i]);\n }\n \n int tens[] = {5,9,11,13};\n for(int i = 0; i < 5; i++)\n for(int j = 0; j < 4; j++)\n for(int k = 0; k < 3; k++){\n\tCode nex = change_tension(base[i], tens[j], k);\n\tif(nex.sound != base[i].sound){\n\t res.push_back(nex);\n\t tmp.push_back(nex);\n\t}\n }\n \n for(int i = 0; i < (int)tmp.size(); i++)\n for(int j = 1; j < 12; j++) res.push_back(shift(tmp[i], j));\n \n for(int i = 0; i < (int)res.size(); i++) sort(res[i].sound.begin(), res[i].sound.end());\n return res;\n}\n\nvector<string> solve(const vector<Code>& cand, const vector<string>& v){\n\n vector<string> res;\n for(int i = 0; i < (int)cand.size(); i++)\n if(cand[i].sound == v) res.push_back(cand[i].name);\n return res;\n}\n\nvoid TEST(const vector<Code>& cand){\n\n for(int i = 0; i < (int)cand.size(); i++)\n if(cand[i].name == \"Dm7(9)\"){\n cout << cand[i].name << endl;\n for(int j = 0; j < (int)cand[i].sound.size(); j++)\n\tcout << cand[i].sound[j] << \" \" ;\n cout << endl;\n }\n exit(0);\n}\n\nint main(){\n\n vector<Code> cand = make();\n // TEST(cand);\n \n int T;\n cin >> T;\n while(T--){\n int n;\n cin >> n;\n vector<string> v(n);\n for(int i = 0; i < n; i++) cin >> v[i];\n sort(v.begin(), v.end());\n vector<string> ans = solve(cand, v);\n if(ans.size() == 0) cout << \"UNKNOWN\" << endl;\n else{\n for(int i = 0; i < (int)ans.size(); i++){\n\tif(i) cout << \" \";\n\tcout << ans[i];\n }\n cout << endl;\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1380,"score_of_the_acc":-0.4362,"final_rank":3},{"submission_id":"aoj_2027_667266","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <list>\n#include <cmath>\n#include <fstream>\n#include <algorithm>\n#include <string>\n#include <queue>\n#include <set>\n#include <map>\n#include <complex>\n#include <iterator>\n#include <cstdlib>\n#include <cstring>\n#include <sstream>\n#include <stack>\n#include <climits>\n#include <deque>\n#include <bitset>\n#include <cassert>\n#include <ctime>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\nconst int dy[]={-1,0,1,0},dx[]={0,1,0,-1};\n// adjust problem by problem\nconst double EPS=1e-8;\nconst double PI=acos(-1.0);\n#ifdef __GNUC__\nint popcount(int n){return __builtin_popcount(n);}\nint popcount(ll n){return __builtin_popcountll(n);}\n#endif\n#ifndef __GNUC__\ntemplate<class T> int popcount(T n){int cnt=0;while(n){if(n%2)cnt++;n/=2;}return cnt;}\n#endif\ntemplate<class T>int SIZE(T a){return a.size();}\ntemplate<class T>string IntToString(T num){string res;stringstream ss;ss<<num;return ss.str();}\ntemplate<class T>T StringToInt(string str){T res=0;for(int i=0;i<SIZE(str);i++)res=(res*10+str[i]-'0');return res;}\ntemplate<class T>T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}\ntemplate<class T>T lcm(T a,T b){return a/gcd(a,b)*b;}\ntemplate<class T> void PrintSeq(T &a,int sz){for(int i=0;i<sz;i++){cout<<a[i];if(sz==i+1)cout<<endl;else cout<<' ';}}\nbool EQ(double a,double b){return abs(a-b)<EPS;}\nvoid fastStream(){cin.tie(0);std::ios_base::sync_with_stdio(0);}\nvector<string> split(string str,char del){\n vector<string> res;\n for(int i=0,s=0;i<SIZE(str);i++){\n if(str[i]==del){if(i-s!=0)res.push_back(str.substr(s,i-s));s=i+1;}\n else if(i==SIZE(str)-1){res.push_back(str.substr(s));}\n }\n return res;\n}\n\n\nint main(){\n map<string,int> toneToIdx;\n string idxToTone[]={\"C\",\"C#\",\"D\",\"D#\",\"E\",\"F\",\"F#\",\"G\",\"G#\",\"A\",\"A#\",\"B\"};\n // コードの名前とそのcomponent\n for(int i=0;i<12;i++)toneToIdx[idxToTone[i]]=i;\n map<string,set<int> > chords;\n {\n set<int> st;\n st.insert(toneToIdx[\"C\"]);\n st.insert(toneToIdx[\"E\"]);\n st.insert(toneToIdx[\"G\"]);\n chords[\"C\"]=st;\n }\n {\n set<int> st;\n st.insert(toneToIdx[\"C\"]);\n st.insert(toneToIdx[\"E\"]);\n st.insert(toneToIdx[\"G\"]);\n st.insert(toneToIdx[\"A#\"]);\n chords[\"C7\"]=st;\n }\n {\n set<int> st;\n st.insert(toneToIdx[\"C\"]);\n st.insert(toneToIdx[\"E\"]);\n st.insert(toneToIdx[\"G\"]);\n st.insert(toneToIdx[\"B\"]);\n chords[\"CM7\"]=st;\n }\n {\n set<int> st;\n st.insert(toneToIdx[\"C\"]);\n st.insert(toneToIdx[\"D#\"]);\n st.insert(toneToIdx[\"G\"]);\n chords[\"Cm\"]=st;\n }\n {\n set<int> st;\n st.insert(toneToIdx[\"C\"]);\n st.insert(toneToIdx[\"D#\"]);\n st.insert(toneToIdx[\"G\"]);\n st.insert(toneToIdx[\"A#\"]);\n chords[\"Cm7\"]=st;\n }\n\n typedef pair<string,string> pss;\n pss pars[]={pss(\"-9\",\"C#\"),pss(\"9\",\"D\"),pss(\"+9\",\"D#\")\n ,pss(\"-11\",\"E\"),pss(\"11\",\"F\"),pss(\"+11\",\"F#\")\n ,pss(\"-13\",\"G#\"),pss(\"13\",\"A\"),pss(\"+13\",\"A#\")\n ,pss(\"-5\",\"\"),pss(\"+5\",\"\"),pss(\"\",\"\")}; \n int N;\n cin>>N;\n while(N--){\n int M;\n set<int> inSets;\n vector<string> ress;\n cin>>M;\n for(int i=0;i<M;i++){\n string s;\n cin>>s;\n inSets.insert(toneToIdx[s]);\n //cout<<toneToIdx[s]<<\" \";\n }\n //cout<<endl;\n // すべてのtoneをrootに\n for(int i=0;i<12;i++){\n // 5種類のコードを使用\n for(map<string,set<int> >::iterator it=chords.begin();it!=chords.end();it++){\n // 括弧の中身をどうするか\n for(int j=0;j<12;j++){\n string r=idxToTone[i]+it->first.substr(1);\n if(pars[j].first!=\"\")r+=\"(\"+pars[j].first+\")\";\n //cout<<r<<endl;\n set<int> nowSt;\n for(set<int>::iterator iit=it->second.begin();iit!=it->second.end();iit++)\n nowSt.insert((*iit+i)%12);\n if(pars[j].first==\"\"){}\n else if(pars[j].first[1]=='5'){\n // replace\n int tgt=(i+7)%12;\n // assert(it->second.size()==nowSt.size());\n // for(set<int>::iterator iit=nowSt.begin();iit!=nowSt.end();iit++){\n // cout<<*iit<<\" \";\n // }\n // cout<<endl;\n nowSt.erase(tgt);\n if(pars[j].first[0]=='+')nowSt.insert((tgt+1)%12);\n else nowSt.insert((tgt+11)%12);\n }\n // 普通に処理\n else{\n if(nowSt.count((i+toneToIdx[pars[j].second])%12))continue;\n nowSt.insert((i+toneToIdx[pars[j].second])%12);\n }\n if(inSets==nowSt){\n ress.push_back(r);\n }\n }\n }\n }\n if((int)ress.size()==0)cout<<\"UNKNOWN\"<<endl;\n else{\n for(int i=0;i<(int)ress.size();i++){\n cout<<ress[i];\n if(i==(int)ress.size()-1)cout<<endl;\n else cout<<\" \";\n }\n }\n }\n \n return 0;\n}","accuracy":1,"time_ms":620,"memory_kb":1232,"score_of_the_acc":-1.3894,"final_rank":9},{"submission_id":"aoj_2027_615742","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};\nstring tone[12] = {\n \"C\",\n \"C#\",\n \"D\",\n \"D#\",\n \"E\",\n \"F\",\n \"F#\",\n \"G\",\n \"G#\",\n \"A\",\n \"A#\",\n \"B\"\n};\nint to_int(string s){\n REP(i, 12) if(s == tone[i]) return i;\n assert(false);\n return -1;\n}\nstring to_str(int n){\n assert(n >= 0 && n < 12);\n return tone[n];\n}\nstring code_name[5] = {\n \"\",\n \"7\",\n \"M7\",\n \"m\",\n \"m7\"\n};\nint code_tone[][5] = {\n {0, 4, 7, -1, -1},\n {0, 4, 7, 10, -1},\n {0, 4, 7, 11, -1},\n {0, 3, 7, -1, -1},\n {0, 3, 7, 10, -1}\n};\nstring tension_name[12] = {\n \"\",\n \"(-9)\",\n \"(9)\",\n \"(+9)\",\n \"(-11)\",\n \"(11)\",\n \"(+11)\",\n \"\",\n \"(-13)\",\n \"(13)\",\n \"(+13)\",\n \"\",\n};\nstring special_tension[2] = {\n \"(-5)\",\n \"(+5)\"\n};\n\nvector<string> solve(vector<string> tone_str){\n vector<string> answer;\n vector<int> tones;\n REP(i, tone_str.size()) tones.push_back(to_int(tone_str[i]));\n REP(i, tones.size()){\n int offset = tones[i];\n vector<int> relative = tones;\n REP(i, relative.size()) relative[i] = (relative[i] - offset + 12) % 12;\n sort(relative.begin(), relative.end());\n REP(j, 5){\n vector<int> code;\n for(int k = 0; code_tone[j][k] != -1; k++){\n code.push_back(code_tone[j][k]);\n }\n if(code == relative) answer.push_back(to_str(offset) + code_name[j]);\n for(int k = 0; k < 2; k++){\n vector<int> code2 = code;\n code2.erase(remove(code2.begin(), code2.end(), 7)); code2.push_back(7 + (2 * k - 1));\n sort(code2.begin(), code2.end());\n if(code2 == relative) answer.push_back(to_str(offset) + code_name[j] + special_tension[k]);\n }\n for(int k = 0; k < 12; k++) if(tension_name[k] != \"\"){\n vector<int> code2 = code;\n code2.push_back(k);\n sort(code2.begin(), code2.end());\n if(code2 == relative) answer.push_back(to_str(offset) + code_name[j] + tension_name[k]);\n }\n }\n }\n return answer;\n}\n\nint main(){\n int T;\n cin >> T;\n while(T--){\n int R; cin >> R;\n vector<string> tone_str(R);\n REP(i, R) cin >> tone_str[i];\n vector<string> codes = solve(tone_str);\n\n if(codes.empty()) cout << \"UNKNOWN\" << endl;\n\n REP(i, codes.size()){\n cout << codes[i];\n if(i == codes.size() - 1) cout << endl;\n else cout << \" \";\n }\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1240,"score_of_the_acc":-0.4411,"final_rank":4},{"submission_id":"aoj_2027_343031","code_snippet":"#include <iostream>\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 string tones[12] = {\"C\",\"C#\",\"D\",\"D#\",\"E\",\"F\",\"F#\",\"G\",\"G#\",\"A\",\"A#\",\"B\"};\n int component[5][3] = {{4,7,-1},{4,7,10},{4,7,11},{3,7,-1},{3,7,10}};\n string compo[5] = {\"\",\"7\",\"M7\",\"m\",\"m7\"};\n int tension[12] = {0,1,2,3,4,5,6,-1,1,8,9,10};\n string tens[12] = {\"\",\"(-9)\",\"(9)\",\"(+9)\",\"(-11)\",\"(11)\",\"(+11)\",\"(-5)\",\"(+5)\",\"(-13)\",\"(13)\",\"(+13)\"};\n\n map<set<int>, vector<string> > mp;\n REP(i, 12) {\n REP(j, 5) {\n vector<int> tmp;\n tmp.push_back(i);\n REP(k, 3) {\n if (component[j][k] == -1) break;\n tmp.push_back((i+component[j][k])%12);\n }\n map<set<int>,bool> memo;\n REP(k,12) {\n vector<int> tmp2(tmp);\n if (k == 0);\n else if (k == 7 || k == 8) // +-5\n tmp2[2] = (tmp2[2]+tension[k]+12)%12;\n else\n tmp2.push_back((i+tension[k])%12);\n set<int> tmpset(ALL(tmp2));\n if (memo[tmpset]) continue;\n memo[tmpset] = 1;\n string s = tones[i];\n s += compo[j];\n s += tens[k];\n mp[tmpset].push_back(s);\n // cout << s << endl;\n // FOR(it, tmpset) cout << tones[*it] << \" \";\n // cout << endl;\n }\n }\n }\n map<string, int> mp2;\n REP(i, 12) {\n mp2[tones[i]] = i;\n }\n int N;\n cin >> N;\n while(N--) {\n int n;\n cin >> n;\n set<int> se;\n REP(i,n) {\n string s;\n cin >> s;\n se.insert(mp2[s]);\n }\n vector<string> v = mp[se];\n if (v.size() == 0) {\n cout << \"UNKNOWN\" << endl;\n } else {\n REP(i, v.size()) {\n if (i) cout << \" \";\n cout << v[i];\n }\n cout << endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2027_111439","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<map>\n#include<vector>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define pb push_back\n#define ALL(C) (C).begin(),(C).end()\n\nconst int CONST = 12;\n\nbool have_same(vector<int> &a){\n rep(i,a.size())REP(j,i+1,a.size())if (a[i] == a[j])return true;\n return false;\n}\n\nvoid generate(vector<string> & a,vector<vector<int> > &b){\n vector<int> base[5];\n string opdata[5]={\"\",\"7\",\"M7\",\"m\",\"m7\"};\n base[0].pb(0);base[0].pb(4);base[0].pb(7);\n base[1].pb(0);base[1].pb(4);base[1].pb(7);base[1].pb(10);\n base[2].pb(0);base[2].pb(4);base[2].pb(7);base[2].pb(11);\n base[3].pb(0);base[3].pb(3);base[3].pb(7);\n base[4].pb(0);base[4].pb(3);base[4].pb(7);base[4].pb(10);\n\n vector<int> pat;\n\n string option=\"\";\n string ori[]={\"C\",\"C#\",\"D\",\"D#\",\"E\",\"F\",\"F#\",\"G\",\"G#\",\"A\",\"A#\",\"B\"};\n string add[]={\"-9\",\"9\",\"+9\",\"-11\",\"11\",\"+11\",\"-13\",\"13\",\"+13\"};\n int addp[]={1,2,3,4,5,6,8,9,10};\n string h[]={\"-5\",\"+5\"};\n int hp[]={11,1};\n \n\n rep(k,5){\n pat=base[k];\n option=opdata[k];\n rep(i,12){ \n vector<int> cpy=pat;\n rep(j,pat.size())cpy[j]=(cpy[j]+i)%CONST;\n a.pb(ori[i]+option);\n b.pb(cpy);\n vector<int> cpy2=cpy;\n cpy2.pb(-1);\n rep(j,9){\n\tcpy2[cpy2.size()-1]=(i+addp[j])%CONST;\n\tif (have_same(cpy2))continue;\n\ta.pb(ori[i]+option+\"(\"+add[j]+\")\");\n\tb.pb(cpy2);\n }\n \n int base=cpy[2];\n rep(j,2){\n\t//cpy[cpy.size()-1]=(base+hp[j])%CONST;\n\tcpy[2]=(base+hp[j])%CONST;\n\ta.pb(ori[i]+option+\"(\"+h[j]+\")\");\n\tb.pb(cpy);\n }\n }\n }\n \n rep(i,a.size()){\n // cout << a[i] << \" \";// << b[i].size() << endl;\n // rep(j,b[i].size())cout << b[i][j]<<\" \";cout <<endl;\n sort(ALL(b[i]));\n }\n}\n\n\nbool is_same_vector(vector<int> &a,vector<int> &b){\n if (a.size() != b.size())return false;\n rep(i,a.size())if (a[i] != b[i])return false;\n /* \n cout << endl;\n cout <<\"tete\"<<endl;\n rep(i,a.size())cout << a[i];cout << endl;\n rep(i,b.size())cout << b[i];cout << endl;\n */ \n return true;\n}\n\nmain(){\n vector<string> a;\n vector<vector<int> > b;\n generate(a,b);\n string ori[]={\"C\",\"C#\",\"D\",\"D#\",\"E\",\"F\",\"F#\",\"G\",\"G#\",\"A\",\"A#\",\"B\"};\n map<string,int> M;\n rep(i,12)M[ori[i]]=i;\n \n int te;\n cin>>te;\n while(te--){\n int cnt = 0;\n int n;\n cin>>n;\n vector<int> in;\n rep(i,n){\n string tmp;cin>>tmp;in.pb(M[tmp]);\n }\n sort(ALL(in));\n \n // rep(k,in.size()){\n rep(i,a.size()){\n\tif (is_same_vector(b[i],in)){\n\t if (cnt)cout << \" \";\n\t cout << a[i];\n\t cnt++;\n\t}\n }\n /* \n int tmp = in[0];\n rep(i,in.size()-1)in[i]=in[i+1];\n in[in.size()-1]=tmp;\n }\n */\n if (cnt == 0)cout << \"UNKNOWN\";\n cout << endl;\n }\n return false;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2027_69928","code_snippet":"#include <iostream>\n#include <string>\n#include <map>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\n#define MP make_pair\n#define pb push_back\n\nint C[]={0,4,7};\nint C7[]={0,4,7,10};\nint CM7[]={0,4,7,11};\nint Cm[]={0,3,7};\nint Cm7[]={0,3,7,10};\n\nmap<int, string> d;\nmap<string, int> dic;\nmap<int, string> rev;\n\nvector<string> ans;\n\nvoid init()\n{\n\td[1]=\"-9\";\n\td[2]=\"9\";\n\td[3]=\"+9\";\n\td[4]=\"-11\";\n\td[5]=\"11\";\n\td[6]=\"+11\";\n\td[8]=\"-13\";\n\td[9]=\"13\";\n\td[10]=\"+13\";\n\t\n\tdic[\"C\"]\t= 0;\n\tdic[\"C#\"]\t= 1;\n\tdic[\"D\"]\t= 2;\n\tdic[\"D#\"]\t= 3;\n\tdic[\"E\"]\t= 4;\n\tdic[\"F\"]\t= 5;\n\tdic[\"F#\"]\t= 6;\n\tdic[\"G\"]\t= 7;\n\tdic[\"G#\"]\t= 8;\n\tdic[\"A\"]\t= 9;\n\tdic[\"A#\"]\t= 10;\n\tdic[\"B\"]\t= 11;\n\t\n\trev[0]\t= \"C\";\n\trev[1]\t= \"C#\";\n\trev[2]\t= \"D\";\n\trev[3]\t= \"D#\";\n\trev[4]\t= \"E\";\n\trev[5]\t= \"F\";\n\trev[6]\t= \"F#\";\n\trev[7]\t= \"G\";\n\trev[8]\t= \"G#\";\n\trev[9]\t= \"A\";\n\trev[10]\t= \"A#\";\n\trev[11]\t= \"B\";\n}\n\nvoid ps(string s, int orig, string type)\n{\n\tstring pat;\n\n\tpat += rev[orig] + type;\n\tif(!s.empty()) pat += \"(\"+ s + \")\";\n\n\tans.pb(pat);\n}\n\nbool check(vector<int> c, vector<int> p)\n{\n\tif(c.size()!= p.size()) return false;\n\n\tsort(c.begin(), c.end());\n\tsort(p.begin(), p.end());\n\t\n\tfor(int i=0; i<c.size(); i++)\n\t\tif(c[i]!=p[i]) return false;\n\n\treturn true;\n}\n\nvoid ctension(vector<int> c, vector<int> p, int orig, string type)\n{\n\tfor(int i=1; i<=10; i++)\n\t{\n\t\tif(i==7) continue;\n\t\tvector<int> t(c);\n\t\tt.pb((orig+i)%12);\n\t\tif(check(t,p)) ps(d[i], orig, type);\n\t}\n\n\tvector<int>::iterator it=find(c.begin(), c.end(), (orig+7)%12);\n\t\n\t*it = ((*it)+11)%12;\n\n\tif(check(c,p)) ps(\"-5\", orig, type);\n\n\t*it = ((*it)+2)%12;\n\tif(check(c,p)) ps(\"+5\", orig, type);\n}\n\nvoid createC(vector<int> p)\n{\n\tvector<int> c;\n\tfor(int i=0; i<3; i++)\n\t\tc.pb(C[i]);\n\n\tfor(int i=0; i<12; i++)\n\t{\n\t\tif(check(c,p)) ps(\"\",i,\"\");\n\t\tctension(c,p,i,\"\");\n\t\t\n\t\tfor(int j=0; j<3; j++)\n\t\t\tc[j]=(c[j]+1)%12;\n\t}\n}\n\nvoid createC7(vector<int> p)\n{\n\n\tvector<int> c;\n\tfor(int i=0; i<4; i++)\n\t\tc.pb(C7[i]);\n\n\tfor(int i=0; i<12; i++)\n\t{\n\t\tif(check(c,p)) ps(\"\",i,\"7\");\n\t\tctension(c,p,i,\"7\");\n\t\t\n\t\tfor(int j=0; j<4; j++)\n\t\t\tc[j]=(c[j]+1)%12;\n\t}\n}\n\nvoid createCM7(vector<int> p)\n{\n\tvector<int> c;\n\tfor(int i=0; i<4; i++)\n\t\tc.pb(CM7[i]);\n\n\tfor(int i=0; i<12; i++)\n\t{\n\t\tif(check(c,p)) ps(\"\",i,\"M7\");\n\t\tctension(c,p,i,\"M7\");\n\t\t\n\t\tfor(int j=0; j<4; j++)\n\t\t\tc[j]=(c[j]+1)%12;\n\t}\n}\nvoid createCm(vector<int> p)\n{\n\tvector<int> c;\n\tfor(int j=0; j<3; j++)\n\t\tc.pb(Cm[j]);\n\n\tfor(int i=0; i<12; i++)\n\t{\n\t\tif(check(c,p)) ps(\"\",i,\"m\");\n\t\tctension(c,p,i,\"m\");\n\t\t\n\t\tfor(int j=0; j<3; j++)\n\t\t\tc[j]=(c[j]+1)%12;\n\n\t}\n\t\n}\n\nvoid createCm7(vector<int> p)\n{\n\tvector<int> c;\n\tfor(int j=0; j<4; j++)\n\t\tc.pb(Cm7[j]);\n\n\tfor(int i=0; i<12; i++)\n\t{\n\t\tif(check(c,p)) ps(\"\",i,\"m7\");\n\t\tctension(c,p,i,\"m7\");\n\t\t\n\t\tfor(int j=0; j<4; j++)\n\t\t\tc[j]=(c[j]+1)%12;\n\n\t}\n}\n\nvoid create(vector<int> p)\n{\n\tcreateC(p);\n\tcreateC7(p);\n\tcreateCM7(p);\n\tcreateCm(p);\n\tcreateCm7(p);\n}\n\nint main()\n{\n\tint N,M;\n\tcin >> N;\n\t\n\tinit();\n\t\n\twhile(N--)\n\t{\n\t\tans.clear();\n\n\t\tvector<int> n;\n\t\tcin >> M;\n\t\twhile(M--)\n\t\t{\n\t\t\tstring s;\n\t\t\tcin >> s;\n\t\t\tn.push_back(dic[s]);\n\t\t}\n\t\t\n\t\tcreate(n);\n\n\t\tif(ans.size()!=0)\n\t\t{\n\t\t\tfor(int i=0; i<ans.size(); i++)\n\t\t\t{\n\t\t\t\tif(i!=0) cout << \" \";\n\t\t\t\tcout << ans[i];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << \"UNKNOWN\" << endl;\n\t\t}\n\t}\n}","accuracy":1,"time_ms":480,"memory_kb":936,"score_of_the_acc":-1.0663,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_2027_3269182\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\n#pragma warning(disable:4996)\\nusing namespace std;\\nstring root_sts = \\\"C ,C#,D ,D#,E ,F ,F#,G ,G#,A ,A#,B \\\";\\n\\nint get_num(string name) {\\n\\n\\tint k= root_sts.find(name);\\n\\tstring l= root_sts.substr(0,k);\\n\\treturn count(l.begin(),l.end(),',');\\n}\\nbool check(vector<int>a, vector<int>b) {\\n\\tfor (auto& k : a) {\\n\\t\\tk%=12;\\n\\t}\\n\\tfor (auto& k : b) {\\n\\t\\tk %= 12;\\n\\t}\\n\\tsort(a.begin(),a.end());\\n\\tsort(b.begin(),b.end());\\n\\treturn a==b;\\n}\\n\\nint main() {\\n\\tint Q;cin>>Q;\\n\\twhile (Q--) {\\n\\t\\tint N;cin>>N;\\n\\t\\tvector<int>nums(N);\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tstring name;cin>>name;nums[i]=get_num(name);\\n\\t\\t}\\n\\t\\tsort(nums.begin(),nums.end());\\n\\n\\t\\tvector<vector<int>>components = {\\n\\t\\t\\tvector<int>{0,4,7},\\n\\t\\t\\tvector<int>{0,4,7,10},\\n\\n\\t\\t\\tvector<int>{0,4,7,11},\\n\\n\\t\\t\\tvector<int>{0,3,7},\\n\\t\\t\\tvector<int>{0,3,7,10},\\n\\n\\t\\t};\\n\\t\\tvector<string>chord_names = {\\n\\t\\t\\t\\\"\\\",\\n\\t\\t\\t\\\"7\\\",\\n\\t\\t\\t\\\"M7\\\",\\n\\t\\t\\t\\\"m\\\",\\n\\t\\t\\t\\\"m7\\\"\\n\\t\\t};\\n\\t\\tvector<string>anss;\\n\\t\\tfor (int root = 0; root < 12; ++root) {\\n\\t\\t\\tstring root_name = root_sts.substr(root * 3, 2);\\n\\n\\t\\t\\tif(root_name[1]==' ')root_name.pop_back();\\n\\t\\t\\tfor (int chord = 0; chord < 5; ++chord) {\\n\\t\\t\\t\\tstring chord_name=chord_names[chord];\\n\\t\\t\\t\\tstring tension_name;\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tvector<string>tension_bases{\\n\\t\\t\\t\\t\\t\\t\\\"5\\\",\\n\\t\\t\\t\\t\\t\\t\\\"9\\\"\\n\\t\\t\\t\\t\\t\\t,\\\"11\\\",\\n\\t\\t\\t\\t\\t\\t\\\"13\\\"\\n\\t\\t\\t\\t\\t};\\n\\t\\t\\t\\t\\tfor (int tension_part = 0; tension_part < 4; ++tension_part) {\\n\\t\\t\\t\\t\\t\\tfor (int plus = -1; plus <= 1; plus++) {\\n\\t\\t\\t\\t\\t\\t\\tstring minus;\\n\\t\\t\\t\\t\\t\\t\\tif (plus == 1) {\\n\\t\\t\\t\\t\\t\\t\\t\\tminus=\\\"+\\\";\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse if (plus == -1) {\\n\\t\\t\\t\\t\\t\\t\\t\\tminus=\\\"-\\\";\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tstring tension_name=\\\"(\\\"+\\n\\t\\t\\t\\t\\t\\t\\t\\tminus+tension_bases[tension_part]\\n\\t\\t\\t\\t\\t\\t\\t\\t+\\\")\\\";\\n\\t\\t\\t\\t\\t\\t\\tvector<int>voices(components[chord]);\\n\\t\\t\\t\\t\\t\\t\\tif (tension_part == 0) {\\n\\t\\t\\t\\t\\t\\t\\t\\tif (plus == 0) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\ttension_name=\\\"\\\";\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\tvoices[2]+=plus;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\t\\tif (tension_part == 1) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tvoices.push_back(2+plus);\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\telse if (tension_part == 2) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tvoices.push_back(5+plus);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\telse if (tension_part == 3) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tvoices.push_back(9+plus);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tfor(auto &vo:voices)vo+=root;\\n\\t\\t\\t\\t\\t\\t\\tif (check(voices, nums)) {\\n\\t\\t\\t\\t\\t\\t\\t\\tstring ans=root_name\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+chord_name+tension_name;\\n\\t\\t\\t\\t\\t\\t\\t\\tanss.push_back(ans);\\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\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (anss.empty()) {\\n\\t\\t\\tcout<<\\\"UNKNOWN\\\"<<endl;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tfor (int i = 0; i < anss.size(); ++i) {\\n\\t\\t\\t\\tcout<<anss[i];\\n\\t\\t\\t\\tif(i==anss.size()-1)cout<<endl;\\n\\t\\t\\t\\telse cout<<\\\" \\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 430,\n \"memory_kb\": 3016,\n \"score_of_the_acc\": -1.6417,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2027_3118618\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 12\\n\\nstruct Info{\\n\\tInfo(int arg_tone_id,int arg_code_id,int arg_tension_op,int arg_tension_value,bool arg_is_tension){\\n\\t\\ttone_id = arg_tone_id;\\n\\t\\tcode_id = arg_code_id;\\n\\t\\ttension_op = arg_tension_op;\\n\\t\\ttension_value = arg_tension_value;\\n\\t\\tis_tension = arg_is_tension;\\n\\t}\\n\\tint tone_id,code_id,tension_op,tension_value;\\n\\tbool is_tension;\\n};\\n\\nint POW[NUM];\\nint tension_array[4] = {9,11,13,5};\\nint diff_table[3][3] = {{1,2,3},{4,5,6},{8,9,10}};\\nchar tone_name[NUM][3] = {\\\"C\\\",\\\"C#\\\",\\\"D\\\",\\\"D#\\\",\\\"E\\\",\\\"F\\\",\\\"F#\\\",\\\"G\\\",\\\"G#\\\",\\\"A\\\",\\\"A#\\\",\\\"B\\\"};\\nchar code_name[NUM][3] = {\\\"@\\\",\\\"7\\\",\\\"M7\\\",\\\"m\\\",\\\"m7\\\"};\\nvector<int> component[5];\\nvector<Info> ANS;\\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\\n//該当するtoneのidを返却する\\nint get_id(char buf[3]){\\n\\n\\tfor(int i = 0; i < NUM; i++){\\n\\t\\tif(strCmp(tone_name[i],buf)){\\n\\t\\t\\treturn i;\\n\\t\\t}\\n\\t}\\n\\n\\treturn -1;\\n}\\n\\nint get_state(bool check[NUM]){\\n\\n\\tint ret = 0;\\n\\n\\tfor(int i = 0; i < NUM; i++){\\n\\t\\tif(check[i]){\\n\\t\\t\\tret += POW[i];\\n\\t\\t}\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nvoid print_Info(Info info){\\n\\n\\tprintf(\\\"%s\\\",tone_name[info.tone_id]);\\n\\n\\tif(info.code_id != 0){\\n\\n\\t\\tprintf(\\\"%s\\\",code_name[info.code_id]);\\n\\t}\\n\\tif(!info.is_tension)return;\\n\\n\\tprintf(\\\"(\\\");\\n\\n\\tif(info.tension_op != 0){\\n\\n\\t\\tif(info.tension_op > 0){\\n\\n\\t\\t\\tprintf(\\\"+\\\");\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tprintf(\\\"-\\\");\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%d\\\",info.tension_value);\\n\\tprintf(\\\")\\\");\\n}\\n\\nvoid dfs(int ans_state){\\n\\n\\tint tmp,tmp_state,tmp_value,diff,tmp_loc;\\n\\tbool check[12],pre;\\n\\n\\tfor(int base_tone = 0; base_tone < NUM; base_tone++){\\n\\t\\tfor(int cord = 0; cord < 5; cord++){\\n\\n\\t\\t\\tfor(int i = 0; i < NUM; i++){\\n\\t\\t\\t\\tcheck[i] = false;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i = 0; i < component[cord].size(); i++){\\n\\t\\t\\t\\tcheck[(base_tone+component[cord][i])%12] = true;\\n\\t\\t\\t}\\n\\n\\t\\t\\ttmp_state = get_state(check);\\n\\n\\t\\t\\tif(tmp_state == ans_state){\\n\\t\\t\\t\\tANS.push_back(Info(base_tone,cord,0,0,false)); //テンション無しで見つかればcontinue\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\t//テンションを全探索\\n\\t\\t\\tfor(int t = 0; t < 4; t++){\\n\\n\\t\\t\\t\\ttmp_value = tension_array[t];\\n\\n\\t\\t\\t\\tif(tmp_value != 5){\\n\\t\\t\\t\\t\\t//各数字について、マイナス、ノーマル、プラスの3つ\\n\\t\\t\\t\\t\\tfor(int a = 0; a < 3; a++){\\n\\n\\t\\t\\t\\t\\t\\tdiff = diff_table[t][a]; //base_toneからの相対位置\\n\\t\\t\\t\\t\\t\\ttmp_loc = (base_tone+diff)%12;\\n\\t\\t\\t\\t\\t\\tpre = check[tmp_loc];\\n\\t\\t\\t\\t\\t\\tcheck[tmp_loc] = true;\\n\\t\\t\\t\\t\\t\\ttmp_state = get_state(check);\\n\\t\\t\\t\\t\\t\\tif(tmp_state == ans_state){\\n\\t\\t\\t\\t\\t\\t\\tANS.push_back(Info(base_tone,cord,a-1,tmp_value,true));\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tcheck[tmp_loc] = pre;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}else{ //tmp_value == 5\\n\\n\\t\\t\\t\\t\\t//★base_toneより7半音高い音を上下させる\\n\\t\\t\\t\\t\\ttmp_loc = (base_tone+7)%12;\\n\\t\\t\\t\\t\\tcheck[tmp_loc] = false;\\n\\n\\t\\t\\t\\t\\t//マイナス\\n\\t\\t\\t\\t\\tpre = check[(tmp_loc+11)%12];\\n\\t\\t\\t\\t\\tcheck[(tmp_loc+11)%12] = true; //-1の代わりに11\\n\\t\\t\\t\\t\\ttmp_state = get_state(check);\\n\\t\\t\\t\\t\\tif(tmp_state == ans_state){\\n\\t\\t\\t\\t\\t\\tANS.push_back(Info(base_tone,cord,-1,tmp_value,true));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tcheck[(tmp_loc+11)%12] = pre;\\n\\n\\t\\t\\t\\t\\t//プラス\\n\\t\\t\\t\\t\\tpre = check[(tmp_loc+1)%12];\\n\\t\\t\\t\\t\\tcheck[(tmp_loc+1)%12] = true;\\n\\t\\t\\t\\t\\ttmp_state = get_state(check);\\n\\t\\t\\t\\t\\tif(tmp_state == ans_state){\\n\\t\\t\\t\\t\\t\\tANS.push_back(Info(base_tone,cord,1,tmp_value,true));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tcheck[(tmp_loc+1)%12] = pre;\\n\\n\\t\\t\\t\\t\\tcheck[tmp_loc] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nvoid func(){\\n\\n\\tint num;\\n\\tchar buf[3];\\n\\n\\tscanf(\\\"%d\\\",&num);\\n\\n\\tint tmp_state = 0;\\n\\n\\tfor(int loop = 0; loop < num; loop++){\\n\\t\\tscanf(\\\"%s\\\",buf);\\n\\t\\ttmp_state += POW[get_id(buf)];\\n\\t}\\n\\n\\tANS.clear();\\n\\n\\tdfs(tmp_state);\\n\\n\\tif(ANS.size() == 0){\\n\\t\\tprintf(\\\"UNKNOWN\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tprint_Info(ANS[0]);\\n\\tfor(int i = 1; i < ANS.size(); i++){\\n\\t\\tprintf(\\\" \\\");\\n\\t\\tprint_Info(ANS[i]);\\n\\t}\\n\\n\\tprintf(\\\"\\\\n\\\");\\n}\\n\\n\\nint main(){\\n\\n\\t//何もなし\\n\\tcomponent[0].push_back(0);\\n\\tcomponent[0].push_back(4);\\n\\tcomponent[0].push_back(7);\\n\\n\\t//7\\n\\tcomponent[1].push_back(0);\\n\\tcomponent[1].push_back(4);\\n\\tcomponent[1].push_back(7);\\n\\tcomponent[1].push_back(10);\\n\\n\\t//M7\\n\\tcomponent[2].push_back(0);\\n\\tcomponent[2].push_back(4);\\n\\tcomponent[2].push_back(7);\\n\\tcomponent[2].push_back(11);\\n\\n\\t//m\\n\\tcomponent[3].push_back(0);\\n\\tcomponent[3].push_back(3);\\n\\tcomponent[3].push_back(7);\\n\\n\\t//m7\\n\\tcomponent[4].push_back(0);\\n\\tcomponent[4].push_back(3);\\n\\tcomponent[4].push_back(7);\\n\\tcomponent[4].push_back(10);\\n\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i < NUM; i++){\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\tint num_case;\\n\\n\\tscanf(\\\"%d\\\",&num_case);\\n\\n\\tfor(int loop = 0; loop < num_case; loop++){\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3164,\n \"score_of_the_acc\": -1.0164,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2027_2285885\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n \\nint main() {\\n string s[12]={\\\"C\\\",\\\"C#\\\",\\\"D\\\",\\\"D#\\\",\\\"E\\\",\\\"F\\\",\\\"F#\\\",\\\"G\\\",\\\"G#\\\",\\\"A\\\",\\\"A#\\\",\\\"B\\\"};\\n string t[5]={\\\"\\\",\\\"7\\\",\\\"M7\\\",\\\"m\\\",\\\"m7\\\"};\\n string r[11]={\\\"\\\",\\\"-9\\\",\\\"9\\\",\\\"+9\\\",\\\"-11\\\",\\\"11\\\",\\\"+11\\\",\\\"\\\",\\\"-13\\\",\\\"13\\\",\\\"+13\\\"};\\n int d[5][4]={{0,4,7,0},{0,4,7,10},{0,4,7,11},{0,3,7,0},{0,3,7,10}};\\n int T;\\n cin >> T;\\n while(T--) {\\n int n;\\n cin >> n;\\n vector<int> a(12,0);\\n for(int i=0; i<n; i++) {\\n string e;\\n cin >> e;\\n for(int j=0; j<12; j++) {\\n if(s[j]==e) a[j]=1;\\n }\\n }\\n vector<string> ans;\\n for(int i=0; i<12; i++) {\\n for(int j=0; j<5; j++) {\\n vector<int> b(12,0);\\n for(int k=0; k<4; k++) b[(i+d[j][k])%12]=1;\\n if(a==b) {\\n ans.push_back(s[i]+t[j]);\\n continue;\\n }\\n for(int k=1; k<11; k++) {\\n if(k==7) continue;\\n int x=b[(i+k)%12];\\n b[(i+k)%12]=1;\\n if(a==b) ans.push_back(s[i]+t[j]+\\\"(\\\"+r[k]+\\\")\\\");\\n b[(i+k)%12]=x;\\n }\\n b[(i+7)%12]=0;b[(i+6)%12]=1;\\n if(a==b) ans.push_back(s[i]+t[j]+\\\"(-5)\\\");\\n b[(i+6)%12]=0;b[(i+8)%12]=1;\\n if(a==b) ans.push_back(s[i]+t[j]+\\\"(+5)\\\");\\n }\\n }\\n if(ans.size()) {\\n for(int i=0; i<ans.size(); i++) {\\n if(i) cout << \\\" \\\";\\n cout << ans[i];\\n }\\n cout << endl;\\n } else cout << \\\"UNKNOWN\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3148,\n \"score_of_the_acc\": -0.9949,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2027_2285652\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n string s[12]={\\\"C\\\",\\\"C#\\\",\\\"D\\\",\\\"D#\\\",\\\"E\\\",\\\"F\\\",\\\"F#\\\",\\\"G\\\",\\\"G#\\\",\\\"A\\\",\\\"A#\\\",\\\"B\\\"};\\n string t[5]={\\\"\\\",\\\"7\\\",\\\"M7\\\",\\\"m\\\",\\\"m7\\\"};\\n string r[11]={\\\"\\\",\\\"-9\\\",\\\"9\\\",\\\"+9\\\",\\\"-11\\\",\\\"11\\\",\\\"+11\\\",\\\"\\\",\\\"-13\\\",\\\"13\\\",\\\"+13\\\"};\\n int d[5][4]={{0,4,7,-1},{0,4,7,10},{0,4,7,11},{0,3,7,-1},{0,3,7,10}};\\n int T;\\n cin >> T;\\n while(T--) {\\n int n;\\n cin >> n;\\n vector<int> a(12,0);\\n for(int i=0; i<n; i++) {\\n string e;\\n cin >> e;\\n for(int j=0; j<12; j++) {\\n if(s[j]==e) {\\n a[j]=1;\\n break;\\n }\\n }\\n }\\n vector<string> ans;\\n for(int i=0; i<12; i++) {\\n for(int j=0; j<5; j++) {\\n vector<int> b(12,0);\\n for(int k=0; k<4; k++) {\\n if(d[j][k]==-1) break;\\n b[(i+d[j][k])%12]=1;\\n }\\n if(a==b) {\\n ans.push_back(s[i]+t[j]);\\n continue;\\n }\\n for(int k=1; k<11; k++) {\\n if(k==7) continue;\\n int x=b[(i+k)%12];\\n b[(i+k)%12]=1;\\n if(a==b) ans.push_back(s[i]+t[j]+\\\"(\\\"+r[k]+\\\")\\\");\\n b[(i+k)%12]=x;\\n }\\n b[(i+7)%12]=0;b[(i+6)%12]=1;\\n if(a==b) ans.push_back(s[i]+t[j]+\\\"(-5)\\\");\\n b[(i+6)%12]=0;b[(i+8)%12]=1;\\n if(a==b) ans.push_back(s[i]+t[j]+\\\"(+5)\\\");\\n }\\n }\\n if(ans.size()) {\\n for(int i=0; i<ans.size(); i++) {\\n if(i) cout << \\\" \\\";\\n cout << ans[i];\\n }\\n cout << endl;\\n } else cout << \\\"UNKNOWN\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3132,\n \"score_of_the_acc\": -0.9899,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2027_911715\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<sstream>\\n\\nusing namespace std;\\n\\nstruct Code{\\n string name;\\n vector<string> sound;\\n};\\n\\nconst int KIND = 12;\\nstring sound[] = {\\\"C\\\",\\\"C#\\\",\\\"D\\\",\\\"D#\\\",\\\"E\\\",\\\"F\\\",\\\"F#\\\",\\\"G\\\",\\\"G#\\\",\\\"A\\\",\\\"A#\\\",\\\"B\\\"};\\n\\nvector<string> make_vec(const string& s){\\n stringstream ss(s);\\n vector<string> res;\\n string str;\\n while(ss >> str) res.push_back(str);\\n return res;\\n}\\n\\nint get_index(const string& s){\\n for(int i = 0; i < KIND; i++) if(sound[i] == s) return i;\\n return -1;\\n}\\n\\nCode shift(Code c, int n){\\n c.name = sound[n] + c.name.substr(1);\\n \\n vector<string> tmp(c.sound.size());\\n for(int i = 0; i < (int)tmp.size(); i++){\\n int idx = get_index(c.sound[i]);\\n tmp[i] = sound[(idx+n)%KIND];\\n }\\n sort(tmp.begin(),tmp.end());\\n c.sound = tmp;\\n return c;\\n}\\n\\nstring to_str(int n){\\n ostringstream oss;\\n oss << n;\\n return oss.str();\\n}\\n\\nvector<string> get_sound(int n){\\n if(n == 5) return make_vec(\\\"F# G G#\\\");\\n if(n == 9) return make_vec(\\\"C# D D#\\\");\\n if(n == 11) return make_vec(\\\"E F F#\\\");\\n if(n == 13) return make_vec(\\\"G# A A#\\\");\\n return make_vec(\\\"ERROR\\\");\\n}\\n\\nCode change_tension(Code c, int n, int type){\\n vector<string> v = get_sound(n);\\n int pos = -1;\\n for(int i = 0; i < (int)c.sound.size(); i++)\\n for(int j = 0; j < (int)v.size(); j++)\\n if(c.sound[i] == v[j]) pos = i;\\n \\n string op = \\\"\\\";\\n if(type == 0) op = \\\"-\\\";\\n if(type == 2) op = \\\"+\\\";\\n\\n c.name += \\\"(\\\" + op + to_str(n) + \\\")\\\";\\n \\n if(n == 5){\\n if(pos == -1) c.sound.push_back(v[type]);\\n else c.sound[pos] = v[type];\\n\\n }else{\\n if(pos == -1 || c.sound[pos] != v[type]) c.sound.push_back(v[type]);\\n }\\n // if(pos == -1 || c.sound[pos] != v[type]) c.sound.push_back(v[type]);\\n\\n sort(c.sound.begin(), c.sound.end());\\n return c;\\n}\\n\\nvoid print(const vector<Code>& v){\\n cout << \\\"--------- begin -----------\\\" << endl;\\n \\n for(int i = 0; i < (int)v.size(); i++){\\n cout << v[i].name << endl;\\n for(int j = 0; j < (int)v[i].sound.size(); j++) cout << v[i].sound[j] << \\\" \\\";\\n cout << endl;\\n }\\n cout << \\\"--------- end -----------\\\" << endl;\\n}\\n\\nvector<Code> make(){\\n vector<Code> res, tmp;\\n Code base[5];\\n base[0] = (Code){\\\"C\\\", make_vec(\\\"C E G\\\")};\\n base[1] = (Code){\\\"C7\\\",make_vec(\\\"C E G A#\\\")};\\n base[2] = (Code){\\\"CM7\\\", make_vec(\\\"C E G B\\\")};\\n base[3] = (Code){\\\"Cm\\\", make_vec(\\\"C D# G\\\")};\\n base[4] = (Code){\\\"Cm7\\\", make_vec(\\\"C D# G A#\\\")};\\n\\n for(int i = 0; i < 5; i++){\\n sort(base[i].sound.begin(), base[i].sound.end());\\n res.push_back(base[i]);\\n tmp.push_back(base[i]);\\n }\\n \\n int tens[] = {5,9,11,13};\\n for(int i = 0; i < 5; i++)\\n for(int j = 0; j < 4; j++)\\n for(int k = 0; k < 3; k++){\\n\\tCode nex = change_tension(base[i], tens[j], k);\\n\\tif(nex.sound != base[i].sound){\\n\\t res.push_back(nex);\\n\\t tmp.push_back(nex);\\n\\t}\\n }\\n \\n for(int i = 0; i < (int)tmp.size(); i++)\\n for(int j = 1; j < 12; j++) res.push_back(shift(tmp[i], j));\\n \\n for(int i = 0; i < (int)res.size(); i++) sort(res[i].sound.begin(), res[i].sound.end());\\n return res;\\n}\\n\\nvector<string> solve(const vector<Code>& cand, const vector<string>& v){\\n\\n vector<string> res;\\n for(int i = 0; i < (int)cand.size(); i++)\\n if(cand[i].sound == v) res.push_back(cand[i].name);\\n return res;\\n}\\n\\nvoid TEST(const vector<Code>& cand){\\n\\n for(int i = 0; i < (int)cand.size(); i++)\\n if(cand[i].name == \\\"Dm7(9)\\\"){\\n cout << cand[i].name << endl;\\n for(int j = 0; j < (int)cand[i].sound.size(); j++)\\n\\tcout << cand[i].sound[j] << \\\" \\\" ;\\n cout << endl;\\n }\\n exit(0);\\n}\\n\\nint main(){\\n\\n vector<Code> cand = make();\\n // TEST(cand);\\n \\n int T;\\n cin >> T;\\n while(T--){\\n int n;\\n cin >> n;\\n vector<string> v(n);\\n for(int i = 0; i < n; i++) cin >> v[i];\\n sort(v.begin(), v.end());\\n vector<string> ans = solve(cand, v);\\n if(ans.size() == 0) cout << \\\"UNKNOWN\\\" << endl;\\n else{\\n for(int i = 0; i < (int)ans.size(); i++){\\n\\tif(i) cout << \\\" \\\";\\n\\tcout << ans[i];\\n }\\n cout << endl;\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1380,\n \"score_of_the_acc\": -0.4362,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2027_667266\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <vector>\\n#include <list>\\n#include <cmath>\\n#include <fstream>\\n#include <algorithm>\\n#include <string>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <complex>\\n#include <iterator>\\n#include <cstdlib>\\n#include <cstring>\\n#include <sstream>\\n#include <stack>\\n#include <climits>\\n#include <deque>\\n#include <bitset>\\n#include <cassert>\\n#include <ctime>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\nconst int dy[]={-1,0,1,0},dx[]={0,1,0,-1};\\n// adjust problem by problem\\nconst double EPS=1e-8;\\nconst double PI=acos(-1.0);\\n#ifdef __GNUC__\\nint popcount(int n){return __builtin_popcount(n);}\\nint popcount(ll n){return __builtin_popcountll(n);}\\n#endif\\n#ifndef __GNUC__\\ntemplate<class T> int popcount(T n){int cnt=0;while(n){if(n%2)cnt++;n/=2;}return cnt;}\\n#endif\\ntemplate<class T>int SIZE(T a){return a.size();}\\ntemplate<class T>string IntToString(T num){string res;stringstream ss;ss<<num;return ss.str();}\\ntemplate<class T>T StringToInt(string str){T res=0;for(int i=0;i<SIZE(str);i++)res=(res*10+str[i]-'0');return res;}\\ntemplate<class T>T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}\\ntemplate<class T>T lcm(T a,T b){return a/gcd(a,b)*b;}\\ntemplate<class T> void PrintSeq(T &a,int sz){for(int i=0;i<sz;i++){cout<<a[i];if(sz==i+1)cout<<endl;else cout<<' ';}}\\nbool EQ(double a,double b){return abs(a-b)<EPS;}\\nvoid fastStream(){cin.tie(0);std::ios_base::sync_with_stdio(0);}\\nvector<string> split(string str,char del){\\n vector<string> res;\\n for(int i=0,s=0;i<SIZE(str);i++){\\n if(str[i]==del){if(i-s!=0)res.push_back(str.substr(s,i-s));s=i+1;}\\n else if(i==SIZE(str)-1){res.push_back(str.substr(s));}\\n }\\n return res;\\n}\\n\\n\\nint main(){\\n map<string,int> toneToIdx;\\n string idxToTone[]={\\\"C\\\",\\\"C#\\\",\\\"D\\\",\\\"D#\\\",\\\"E\\\",\\\"F\\\",\\\"F#\\\",\\\"G\\\",\\\"G#\\\",\\\"A\\\",\\\"A#\\\",\\\"B\\\"};\\n // コードの名前とそのcomponent\\n for(int i=0;i<12;i++)toneToIdx[idxToTone[i]]=i;\\n map<string,set<int> > chords;\\n {\\n set<int> st;\\n st.insert(toneToIdx[\\\"C\\\"]);\\n st.insert(toneToIdx[\\\"E\\\"]);\\n st.insert(toneToIdx[\\\"G\\\"]);\\n chords[\\\"C\\\"]=st;\\n }\\n {\\n set<int> st;\\n st.insert(toneToIdx[\\\"C\\\"]);\\n st.insert(toneToIdx[\\\"E\\\"]);\\n st.insert(toneToIdx[\\\"G\\\"]);\\n st.insert(toneToIdx[\\\"A#\\\"]);\\n chords[\\\"C7\\\"]=st;\\n }\\n {\\n set<int> st;\\n st.insert(toneToIdx[\\\"C\\\"]);\\n st.insert(toneToIdx[\\\"E\\\"]);\\n st.insert(toneToIdx[\\\"G\\\"]);\\n st.insert(toneToIdx[\\\"B\\\"]);\\n chords[\\\"CM7\\\"]=st;\\n }\\n {\\n set<int> st;\\n st.insert(toneToIdx[\\\"C\\\"]);\\n st.insert(toneToIdx[\\\"D#\\\"]);\\n st.insert(toneToIdx[\\\"G\\\"]);\\n chords[\\\"Cm\\\"]=st;\\n }\\n {\\n set<int> st;\\n st.insert(toneToIdx[\\\"C\\\"]);\\n st.insert(toneToIdx[\\\"D#\\\"]);\\n st.insert(toneToIdx[\\\"G\\\"]);\\n st.insert(toneToIdx[\\\"A#\\\"]);\\n chords[\\\"Cm7\\\"]=st;\\n }\\n\\n typedef pair<string,string> pss;\\n pss pars[]={pss(\\\"-9\\\",\\\"C#\\\"),pss(\\\"9\\\",\\\"D\\\"),pss(\\\"+9\\\",\\\"D#\\\")\\n ,pss(\\\"-11\\\",\\\"E\\\"),pss(\\\"11\\\",\\\"F\\\"),pss(\\\"+11\\\",\\\"F#\\\")\\n ,pss(\\\"-13\\\",\\\"G#\\\"),pss(\\\"13\\\",\\\"A\\\"),pss(\\\"+13\\\",\\\"A#\\\")\\n ,pss(\\\"-5\\\",\\\"\\\"),pss(\\\"+5\\\",\\\"\\\"),pss(\\\"\\\",\\\"\\\")}; \\n int N;\\n cin>>N;\\n while(N--){\\n int M;\\n set<int> inSets;\\n vector<string> ress;\\n cin>>M;\\n for(int i=0;i<M;i++){\\n string s;\\n cin>>s;\\n inSets.insert(toneToIdx[s]);\\n //cout<<toneToIdx[s]<<\\\" \\\";\\n }\\n //cout<<endl;\\n // すべてのtoneをrootに\\n for(int i=0;i<12;i++){\\n // 5種類のコードを使用\\n for(map<string,set<int> >::iterator it=chords.begin();it!=chords.end();it++){\\n // 括弧の中身をどうするか\\n for(int j=0;j<12;j++){\\n string r=idxToTone[i]+it->first.substr(1);\\n if(pars[j].first!=\\\"\\\")r+=\\\"(\\\"+pars[j].first+\\\")\\\";\\n //cout<<r<<endl;\\n set<int> nowSt;\\n for(set<int>::iterator iit=it->second.begin();iit!=it->second.end();iit++)\\n nowSt.insert((*iit+i)%12);\\n if(pars[j].first==\\\"\\\"){}\\n else if(pars[j].first[1]=='5'){\\n // replace\\n int tgt=(i+7)%12;\\n // assert(it->second.size()==nowSt.size());\\n // for(set<int>::iterator iit=nowSt.begin();iit!=nowSt.end();iit++){\\n // cout<<*iit<<\\\" \\\";\\n // }\\n // cout<<endl;\\n nowSt.erase(tgt);\\n if(pars[j].first[0]=='+')nowSt.insert((tgt+1)%12);\\n else nowSt.insert((tgt+11)%12);\\n }\\n // 普通に処理\\n else{\\n if(nowSt.count((i+toneToIdx[pars[j].second])%12))continue;\\n nowSt.insert((i+toneToIdx[pars[j].second])%12);\\n }\\n if(inSets==nowSt){\\n ress.push_back(r);\\n }\\n }\\n }\\n }\\n if((int)ress.size()==0)cout<<\\\"UNKNOWN\\\"<<endl;\\n else{\\n for(int i=0;i<(int)ress.size();i++){\\n cout<<ress[i];\\n if(i==(int)ress.size()-1)cout<<endl;\\n else cout<<\\\" \\\";\\n }\\n }\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 620,\n \"memory_kb\": 1232,\n \"score_of_the_acc\": -1.3894,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2027_615742\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\\\" \\\"; cerr<<endl; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\nstring tone[12] = {\\n \\\"C\\\",\\n \\\"C#\\\",\\n \\\"D\\\",\\n \\\"D#\\\",\\n \\\"E\\\",\\n \\\"F\\\",\\n \\\"F#\\\",\\n \\\"G\\\",\\n \\\"G#\\\",\\n \\\"A\\\",\\n \\\"A#\\\",\\n \\\"B\\\"\\n};\\nint to_int(string s){\\n REP(i, 12) if(s == tone[i]) return i;\\n assert(false);\\n return -1;\\n}\\nstring to_str(int n){\\n assert(n >= 0 && n < 12);\\n return tone[n];\\n}\\nstring code_name[5] = {\\n \\\"\\\",\\n \\\"7\\\",\\n \\\"M7\\\",\\n \\\"m\\\",\\n \\\"m7\\\"\\n};\\nint code_tone[][5] = {\\n {0, 4, 7, -1, -1},\\n {0, 4, 7, 10, -1},\\n {0, 4, 7, 11, -1},\\n {0, 3, 7, -1, -1},\\n {0, 3, 7, 10, -1}\\n};\\nstring tension_name[12] = {\\n \\\"\\\",\\n \\\"(-9)\\\",\\n \\\"(9)\\\",\\n \\\"(+9)\\\",\\n \\\"(-11)\\\",\\n \\\"(11)\\\",\\n \\\"(+11)\\\",\\n \\\"\\\",\\n \\\"(-13)\\\",\\n \\\"(13)\\\",\\n \\\"(+13)\\\",\\n \\\"\\\",\\n};\\nstring special_tension[2] = {\\n \\\"(-5)\\\",\\n \\\"(+5)\\\"\\n};\\n\\nvector<string> solve(vector<string> tone_str){\\n vector<string> answer;\\n vector<int> tones;\\n REP(i, tone_str.size()) tones.push_back(to_int(tone_str[i]));\\n REP(i, tones.size()){\\n int offset = tones[i];\\n vector<int> relative = tones;\\n REP(i, relative.size()) relative[i] = (relative[i] - offset + 12) % 12;\\n sort(relative.begin(), relative.end());\\n REP(j, 5){\\n vector<int> code;\\n for(int k = 0; code_tone[j][k] != -1; k++){\\n code.push_back(code_tone[j][k]);\\n }\\n if(code == relative) answer.push_back(to_str(offset) + code_name[j]);\\n for(int k = 0; k < 2; k++){\\n vector<int> code2 = code;\\n code2.erase(remove(code2.begin(), code2.end(), 7)); code2.push_back(7 + (2 * k - 1));\\n sort(code2.begin(), code2.end());\\n if(code2 == relative) answer.push_back(to_str(offset) + code_name[j] + special_tension[k]);\\n }\\n for(int k = 0; k < 12; k++) if(tension_name[k] != \\\"\\\"){\\n vector<int> code2 = code;\\n code2.push_back(k);\\n sort(code2.begin(), code2.end());\\n if(code2 == relative) answer.push_back(to_str(offset) + code_name[j] + tension_name[k]);\\n }\\n }\\n }\\n return answer;\\n}\\n\\nint main(){\\n int T;\\n cin >> T;\\n while(T--){\\n int R; cin >> R;\\n vector<string> tone_str(R);\\n REP(i, R) cin >> tone_str[i];\\n vector<string> codes = solve(tone_str);\\n\\n if(codes.empty()) cout << \\\"UNKNOWN\\\" << endl;\\n\\n REP(i, codes.size()){\\n cout << codes[i];\\n if(i == codes.size() - 1) cout << endl;\\n else cout << \\\" \\\";\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1240,\n \"score_of_the_acc\": -0.4411,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2027_343031\",\n \"code_snippet\": \"#include <iostream>\\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 string tones[12] = {\\\"C\\\",\\\"C#\\\",\\\"D\\\",\\\"D#\\\",\\\"E\\\",\\\"F\\\",\\\"F#\\\",\\\"G\\\",\\\"G#\\\",\\\"A\\\",\\\"A#\\\",\\\"B\\\"};\\n int component[5][3] = {{4,7,-1},{4,7,10},{4,7,11},{3,7,-1},{3,7,10}};\\n string compo[5] = {\\\"\\\",\\\"7\\\",\\\"M7\\\",\\\"m\\\",\\\"m7\\\"};\\n int tension[12] = {0,1,2,3,4,5,6,-1,1,8,9,10};\\n string tens[12] = {\\\"\\\",\\\"(-9)\\\",\\\"(9)\\\",\\\"(+9)\\\",\\\"(-11)\\\",\\\"(11)\\\",\\\"(+11)\\\",\\\"(-5)\\\",\\\"(+5)\\\",\\\"(-13)\\\",\\\"(13)\\\",\\\"(+13)\\\"};\\n\\n map<set<int>, vector<string> > mp;\\n REP(i, 12) {\\n REP(j, 5) {\\n vector<int> tmp;\\n tmp.push_back(i);\\n REP(k, 3) {\\n if (component[j][k] == -1) break;\\n tmp.push_back((i+component[j][k])%12);\\n }\\n map<set<int>,bool> memo;\\n REP(k,12) {\\n vector<int> tmp2(tmp);\\n if (k == 0);\\n else if (k == 7 || k == 8) // +-5\\n tmp2[2] = (tmp2[2]+tension[k]+12)%12;\\n else\\n tmp2.push_back((i+tension[k])%12);\\n set<int> tmpset(ALL(tmp2));\\n if (memo[tmpset]) continue;\\n memo[tmpset] = 1;\\n string s = tones[i];\\n s += compo[j];\\n s += tens[k];\\n mp[tmpset].push_back(s);\\n // cout << s << endl;\\n // FOR(it, tmpset) cout << tones[*it] << \\\" \\\";\\n // cout << endl;\\n }\\n }\\n }\\n map<string, int> mp2;\\n REP(i, 12) {\\n mp2[tones[i]] = i;\\n }\\n int N;\\n cin >> N;\\n while(N--) {\\n int n;\\n cin >> n;\\n set<int> se;\\n REP(i,n) {\\n string s;\\n cin >> s;\\n se.insert(mp2[s]);\\n }\\n vector<string> v = mp[se];\\n if (v.size() == 0) {\\n cout << \\\"UNKNOWN\\\" << endl;\\n } else {\\n REP(i, v.size()) {\\n if (i) cout << \\\" \\\";\\n cout << v[i];\\n }\\n cout << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2027_111439\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<map>\\n#include<vector>\\nusing namespace std;\\n#define REP(i,b,n) for(int i=b;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define pb push_back\\n#define ALL(C) (C).begin(),(C).end()\\n\\nconst int CONST = 12;\\n\\nbool have_same(vector<int> &a){\\n rep(i,a.size())REP(j,i+1,a.size())if (a[i] == a[j])return true;\\n return false;\\n}\\n\\nvoid generate(vector<string> & a,vector<vector<int> > &b){\\n vector<int> base[5];\\n string opdata[5]={\\\"\\\",\\\"7\\\",\\\"M7\\\",\\\"m\\\",\\\"m7\\\"};\\n base[0].pb(0);base[0].pb(4);base[0].pb(7);\\n base[1].pb(0);base[1].pb(4);base[1].pb(7);base[1].pb(10);\\n base[2].pb(0);base[2].pb(4);base[2].pb(7);base[2].pb(11);\\n base[3].pb(0);base[3].pb(3);base[3].pb(7);\\n base[4].pb(0);base[4].pb(3);base[4].pb(7);base[4].pb(10);\\n\\n vector<int> pat;\\n\\n string option=\\\"\\\";\\n string ori[]={\\\"C\\\",\\\"C#\\\",\\\"D\\\",\\\"D#\\\",\\\"E\\\",\\\"F\\\",\\\"F#\\\",\\\"G\\\",\\\"G#\\\",\\\"A\\\",\\\"A#\\\",\\\"B\\\"};\\n string add[]={\\\"-9\\\",\\\"9\\\",\\\"+9\\\",\\\"-11\\\",\\\"11\\\",\\\"+11\\\",\\\"-13\\\",\\\"13\\\",\\\"+13\\\"};\\n int addp[]={1,2,3,4,5,6,8,9,10};\\n string h[]={\\\"-5\\\",\\\"+5\\\"};\\n int hp[]={11,1};\\n \\n\\n rep(k,5){\\n pat=base[k];\\n option=opdata[k];\\n rep(i,12){ \\n vector<int> cpy=pat;\\n rep(j,pat.size())cpy[j]=(cpy[j]+i)%CONST;\\n a.pb(ori[i]+option);\\n b.pb(cpy);\\n vector<int> cpy2=cpy;\\n cpy2.pb(-1);\\n rep(j,9){\\n\\tcpy2[cpy2.size()-1]=(i+addp[j])%CONST;\\n\\tif (have_same(cpy2))continue;\\n\\ta.pb(ori[i]+option+\\\"(\\\"+add[j]+\\\")\\\");\\n\\tb.pb(cpy2);\\n }\\n \\n int base=cpy[2];\\n rep(j,2){\\n\\t//cpy[cpy.size()-1]=(base+hp[j])%CONST;\\n\\tcpy[2]=(base+hp[j])%CONST;\\n\\ta.pb(ori[i]+option+\\\"(\\\"+h[j]+\\\")\\\");\\n\\tb.pb(cpy);\\n }\\n }\\n }\\n \\n rep(i,a.size()){\\n // cout << a[i] << \\\" \\\";// << b[i].size() << endl;\\n // rep(j,b[i].size())cout << b[i][j]<<\\\" \\\";cout <<endl;\\n sort(ALL(b[i]));\\n }\\n}\\n\\n\\nbool is_same_vector(vector<int> &a,vector<int> &b){\\n if (a.size() != b.size())return false;\\n rep(i,a.size())if (a[i] != b[i])return false;\\n /* \\n cout << endl;\\n cout <<\\\"tete\\\"<<endl;\\n rep(i,a.size())cout << a[i];cout << endl;\\n rep(i,b.size())cout << b[i];cout << endl;\\n */ \\n return true;\\n}\\n\\nmain(){\\n vector<string> a;\\n vector<vector<int> > b;\\n generate(a,b);\\n string ori[]={\\\"C\\\",\\\"C#\\\",\\\"D\\\",\\\"D#\\\",\\\"E\\\",\\\"F\\\",\\\"F#\\\",\\\"G\\\",\\\"G#\\\",\\\"A\\\",\\\"A#\\\",\\\"B\\\"};\\n map<string,int> M;\\n rep(i,12)M[ori[i]]=i;\\n \\n int te;\\n cin>>te;\\n while(te--){\\n int cnt = 0;\\n int n;\\n cin>>n;\\n vector<int> in;\\n rep(i,n){\\n string tmp;cin>>tmp;in.pb(M[tmp]);\\n }\\n sort(ALL(in));\\n \\n // rep(k,in.size()){\\n rep(i,a.size()){\\n\\tif (is_same_vector(b[i],in)){\\n\\t if (cnt)cout << \\\" \\\";\\n\\t cout << a[i];\\n\\t cnt++;\\n\\t}\\n }\\n /* \\n int tmp = in[0];\\n rep(i,in.size()-1)in[i]=in[i+1];\\n in[in.size()-1]=tmp;\\n }\\n */\\n if (cnt == 0)cout << \\\"UNKNOWN\\\";\\n cout << endl;\\n }\\n return false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2027_69928\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <map>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\n#define MP make_pair\\n#define pb push_back\\n\\nint C[]={0,4,7};\\nint C7[]={0,4,7,10};\\nint CM7[]={0,4,7,11};\\nint Cm[]={0,3,7};\\nint Cm7[]={0,3,7,10};\\n\\nmap<int, string> d;\\nmap<string, int> dic;\\nmap<int, string> rev;\\n\\nvector<string> ans;\\n\\nvoid init()\\n{\\n\\td[1]=\\\"-9\\\";\\n\\td[2]=\\\"9\\\";\\n\\td[3]=\\\"+9\\\";\\n\\td[4]=\\\"-11\\\";\\n\\td[5]=\\\"11\\\";\\n\\td[6]=\\\"+11\\\";\\n\\td[8]=\\\"-13\\\";\\n\\td[9]=\\\"13\\\";\\n\\td[10]=\\\"+13\\\";\\n\\t\\n\\tdic[\\\"C\\\"]\\t= 0;\\n\\tdic[\\\"C#\\\"]\\t= 1;\\n\\tdic[\\\"D\\\"]\\t= 2;\\n\\tdic[\\\"D#\\\"]\\t= 3;\\n\\tdic[\\\"E\\\"]\\t= 4;\\n\\tdic[\\\"F\\\"]\\t= 5;\\n\\tdic[\\\"F#\\\"]\\t= 6;\\n\\tdic[\\\"G\\\"]\\t= 7;\\n\\tdic[\\\"G#\\\"]\\t= 8;\\n\\tdic[\\\"A\\\"]\\t= 9;\\n\\tdic[\\\"A#\\\"]\\t= 10;\\n\\tdic[\\\"B\\\"]\\t= 11;\\n\\t\\n\\trev[0]\\t= \\\"C\\\";\\n\\trev[1]\\t= \\\"C#\\\";\\n\\trev[2]\\t= \\\"D\\\";\\n\\trev[3]\\t= \\\"D#\\\";\\n\\trev[4]\\t= \\\"E\\\";\\n\\trev[5]\\t= \\\"F\\\";\\n\\trev[6]\\t= \\\"F#\\\";\\n\\trev[7]\\t= \\\"G\\\";\\n\\trev[8]\\t= \\\"G#\\\";\\n\\trev[9]\\t= \\\"A\\\";\\n\\trev[10]\\t= \\\"A#\\\";\\n\\trev[11]\\t= \\\"B\\\";\\n}\\n\\nvoid ps(string s, int orig, string type)\\n{\\n\\tstring pat;\\n\\n\\tpat += rev[orig] + type;\\n\\tif(!s.empty()) pat += \\\"(\\\"+ s + \\\")\\\";\\n\\n\\tans.pb(pat);\\n}\\n\\nbool check(vector<int> c, vector<int> p)\\n{\\n\\tif(c.size()!= p.size()) return false;\\n\\n\\tsort(c.begin(), c.end());\\n\\tsort(p.begin(), p.end());\\n\\t\\n\\tfor(int i=0; i<c.size(); i++)\\n\\t\\tif(c[i]!=p[i]) return false;\\n\\n\\treturn true;\\n}\\n\\nvoid ctension(vector<int> c, vector<int> p, int orig, string type)\\n{\\n\\tfor(int i=1; i<=10; i++)\\n\\t{\\n\\t\\tif(i==7) continue;\\n\\t\\tvector<int> t(c);\\n\\t\\tt.pb((orig+i)%12);\\n\\t\\tif(check(t,p)) ps(d[i], orig, type);\\n\\t}\\n\\n\\tvector<int>::iterator it=find(c.begin(), c.end(), (orig+7)%12);\\n\\t\\n\\t*it = ((*it)+11)%12;\\n\\n\\tif(check(c,p)) ps(\\\"-5\\\", orig, type);\\n\\n\\t*it = ((*it)+2)%12;\\n\\tif(check(c,p)) ps(\\\"+5\\\", orig, type);\\n}\\n\\nvoid createC(vector<int> p)\\n{\\n\\tvector<int> c;\\n\\tfor(int i=0; i<3; i++)\\n\\t\\tc.pb(C[i]);\\n\\n\\tfor(int i=0; i<12; i++)\\n\\t{\\n\\t\\tif(check(c,p)) ps(\\\"\\\",i,\\\"\\\");\\n\\t\\tctension(c,p,i,\\\"\\\");\\n\\t\\t\\n\\t\\tfor(int j=0; j<3; j++)\\n\\t\\t\\tc[j]=(c[j]+1)%12;\\n\\t}\\n}\\n\\nvoid createC7(vector<int> p)\\n{\\n\\n\\tvector<int> c;\\n\\tfor(int i=0; i<4; i++)\\n\\t\\tc.pb(C7[i]);\\n\\n\\tfor(int i=0; i<12; i++)\\n\\t{\\n\\t\\tif(check(c,p)) ps(\\\"\\\",i,\\\"7\\\");\\n\\t\\tctension(c,p,i,\\\"7\\\");\\n\\t\\t\\n\\t\\tfor(int j=0; j<4; j++)\\n\\t\\t\\tc[j]=(c[j]+1)%12;\\n\\t}\\n}\\n\\nvoid createCM7(vector<int> p)\\n{\\n\\tvector<int> c;\\n\\tfor(int i=0; i<4; i++)\\n\\t\\tc.pb(CM7[i]);\\n\\n\\tfor(int i=0; i<12; i++)\\n\\t{\\n\\t\\tif(check(c,p)) ps(\\\"\\\",i,\\\"M7\\\");\\n\\t\\tctension(c,p,i,\\\"M7\\\");\\n\\t\\t\\n\\t\\tfor(int j=0; j<4; j++)\\n\\t\\t\\tc[j]=(c[j]+1)%12;\\n\\t}\\n}\\nvoid createCm(vector<int> p)\\n{\\n\\tvector<int> c;\\n\\tfor(int j=0; j<3; j++)\\n\\t\\tc.pb(Cm[j]);\\n\\n\\tfor(int i=0; i<12; i++)\\n\\t{\\n\\t\\tif(check(c,p)) ps(\\\"\\\",i,\\\"m\\\");\\n\\t\\tctension(c,p,i,\\\"m\\\");\\n\\t\\t\\n\\t\\tfor(int j=0; j<3; j++)\\n\\t\\t\\tc[j]=(c[j]+1)%12;\\n\\n\\t}\\n\\t\\n}\\n\\nvoid createCm7(vector<int> p)\\n{\\n\\tvector<int> c;\\n\\tfor(int j=0; j<4; j++)\\n\\t\\tc.pb(Cm7[j]);\\n\\n\\tfor(int i=0; i<12; i++)\\n\\t{\\n\\t\\tif(check(c,p)) ps(\\\"\\\",i,\\\"m7\\\");\\n\\t\\tctension(c,p,i,\\\"m7\\\");\\n\\t\\t\\n\\t\\tfor(int j=0; j<4; j++)\\n\\t\\t\\tc[j]=(c[j]+1)%12;\\n\\n\\t}\\n}\\n\\nvoid create(vector<int> p)\\n{\\n\\tcreateC(p);\\n\\tcreateC7(p);\\n\\tcreateCM7(p);\\n\\tcreateCm(p);\\n\\tcreateCm7(p);\\n}\\n\\nint main()\\n{\\n\\tint N,M;\\n\\tcin >> N;\\n\\t\\n\\tinit();\\n\\t\\n\\twhile(N--)\\n\\t{\\n\\t\\tans.clear();\\n\\n\\t\\tvector<int> n;\\n\\t\\tcin >> M;\\n\\t\\twhile(M--)\\n\\t\\t{\\n\\t\\t\\tstring s;\\n\\t\\t\\tcin >> s;\\n\\t\\t\\tn.push_back(dic[s]);\\n\\t\\t}\\n\\t\\t\\n\\t\\tcreate(n);\\n\\n\\t\\tif(ans.size()!=0)\\n\\t\\t{\\n\\t\\t\\tfor(int i=0; i<ans.size(); i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(i!=0) cout << \\\" \\\";\\n\\t\\t\\t\\tcout << ans[i];\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tcout << \\\"UNKNOWN\\\" << endl;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 936,\n \"score_of_the_acc\": -1.0663,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":1059,"cells":{"group_id":{"kind":"string","value":"aoj_2029_cpp"},"problem_description":{"kind":"string","value":"Problem I:\nLight The Room\nYou are given plans of rooms of polygonal shapes. The walls of the rooms on the plans are\nplaced parallel to either\nx\n-axis or\ny\n-axis. In addition, the walls are made of special materials so\nthey reflect light from sources as mirrors do, but only once. In other words, the walls do not\nreflect light already reflected at another point of the walls.\nNow we have each room furnished with one lamp. Walls will be illuminated by the lamp directly\nor indirectly. However, since the walls reflect the light only once, some part of the walls may\nnot be illuminated.\nYou are requested to write a program that calculates the total length of\nunilluminated\npart of\nthe walls.\nFigure 10: The room given as the second case in Sample Input\nInput\nThe input consists of multiple test cases.\nThe first line of each case contains a single positive even integer\nN\n(4 ≤\nN\n≤ 20), which indicates\nthe number of the corners. The following\nN\nlines describe the corners counterclockwise. The\ni-th line contains two integers\nx\ni\nand\ny\ni\n, where (\nx\ni\n,\ny\ni\n) indicates the coordinates of the\ni\n-th\ncorner. The last line of the case contains\nx'\nand\ny'\n, where (\nx'\n,\ny'\n) indicates the coordinates of\nthe lamp.\nTo make the problem simple, you may assume that the input meets the following conditions:\nAll coordinate values are integers not greater than 100 in their absolute values.\nNo two walls intersect or touch except for their ends.\nThe walls do not intersect nor touch each other.\nThe walls turn each corner by a right angle.\nThe lamp exists strictly inside the room off the wall.\nThe x-coordinate of the lamp does not coincide with that of any wall; neither does the\n y-coordinate.\nThe input is terminated by a line containing a single zero.\nOutput\nFor each case, output the length of the unilluminated part in one line. The output value may\nhave an arbitrary number of decimal digits, but may not contain an error greater than 10\n-3\n.\nSample Input\n4\n0 0\n2 0\n2 2\n0 2\n1 1\n6\n2 2\n2 5\n0 5\n0 0\n5 0\n5 2\n1 4\n0\nOutput for the Sample Input\n0.000\n3.000"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2029_3168624","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\nusing namespace std;\nconst double EPS = 1e-6;\nconst double INF = 1e12;\nconst double PI = acos(-1);\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\n\ntypedef complex<double> P;\ntypedef vector<P> VP;\nstruct L : array<P, 2>{\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\n L(){}\n};\nnamespace std{\n bool operator < (const P& a, const P& b){\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\n }\n bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){\n return (conj(a)*b).X;\n}\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\n}\nint ccw(P a, P b, P c){\n b -= a;\n c -= a;\n if(cross(b,c) > EPS) return +1; //ccw\n if(cross(b,c) < -EPS) return -1; //cw\n if(dot(b,c) < -EPS) return +2; //c-a-b\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\n return 0; //a-c-b\n}\n\nbool intersectLS(const L& l, const L& s){\n return cross(l[1]-l[0], s[0]-l[0])*\n cross(l[1]-l[0], s[1]-l[0]) < EPS;\n}\nbool intersectSS(const L& a, const L& b){\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\n}\nbool strictItsSS(const L& a, const L& b){\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) < 0 ) &&\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) < 0 );\n}\n\nP projection(const L& l, const P& p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\nP reflection(const L& l, const P& p) {\n return p + 2.0*(projection(l, p) -p);\n}\n\nbool isParallel(const P &a, const P &b){\n return abs(cross(a,b)) < EPS;\n}\nbool isParallel(const L &a, const L &b){\n return isParallel(a[1]-a[0], b[1]-b[0]);\n}\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1]-l[0], m[1]-m[0]);\n double B = cross(l[1]-l[0], l[1]-m[0]);\n return m[0] + B/A *(m[1]-m[0]);\n}\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n VP p(n);\n for(int i=0; i<n; i++){\n int x,y;\n cin >> x >> y;\n p[i] = P(x, y);\n }\n int sx,sy;\n cin >> sx >> sy;\n P source(sx, sy);\n\n vector<L> edge(n);\n vector<VP> cp(n);\n for(int i=0; i<n; i++){\n edge[i] = L(p[i], p[(i+1)%n]);\n cp[i].push_back(edge[i][0]);\n cp[i].push_back(edge[i][1]);\n }\n\n for(int v=0; v<n; v++){\n L ray(source, p[v]);\n for(int wr=0; wr<n; wr++){\n if(!isParallel(ray, edge[wr]) && intersectLS(ray, edge[wr])){\n P cpll = crosspointLL(ray, edge[wr]);\n //直接頂点を通る\n cp[wr].push_back(cpll);\n //その後反射する\n P ref = reflection(edge[wr], source);\n L ray2(ref, cpll);\n for(int wt=0; wt<n; wt++){\n if(!isParallel(ray2, edge[wt]) && intersectLS(ray2, edge[wt])){\n cp[wt].push_back(crosspointLL(ray2, edge[wt]));\n }\n }\n }\n }\n\n //反射して頂点を通る\n for(int wr=0; wr<n; wr++){\n P s = reflection(edge[wr], source);\n L ray(s, p[v]);\n for(int wt=0; wt<n; wt++){\n if(!isParallel(ray, edge[wt]) && intersectLS(ray, edge[wt])){\n cp[wt].push_back(crosspointLL(ray, edge[wt]));\n }\n }\n }\n }\n for(int i=0; i<n; i++){\n sort(cp[i].begin(), cp[i].end());\n cp[i].erase(unique(cp[i].begin(), cp[i].end()), cp[i].end());\n }\n\n double ans = 0;\n for(int i=0; i<n; i++){\n for(int j=0; j<(int)cp[i].size()-1; j++){\n P mid = (cp[i][j] +cp[i][j+1]) /2.0;\n bool light = false;\n //反射する壁を選ぶ\n for(int wr=0; wr<n; wr++){\n P ref = reflection(edge[wr], mid);\n if(!intersectSS(L(ref, source), edge[wr])) continue;\n P rp;\n if(isParallel(L(ref, source), edge[wr])){\n rp = (ref +source) /2.0;\n }else{\n rp = crosspointLL(L(ref, source), edge[wr]);\n }\n vector<L> ray{L(mid, rp), L(rp, source)};\n\n bool block = false;\n for(int k=0; k<2; k++){\n for(int w=0; w<n; w++){\n if(!isParallel(ray[k], edge[w]) && strictItsSS(ray[k], edge[w])){\n block = true;\n k = 2;\n break;\n }\n }\n }\n if(!block){\n light = true;\n break;\n }\n }\n if(!light){\n ans += abs(cp[i][j+1] -cp[i][j]);\n }\n }\n }\n\n cout << fixed << setprecision(10);\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3332,"score_of_the_acc":-1,"final_rank":3},{"submission_id":"aoj_2029_1046306","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-6)\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)\n\nusing namespace std;\n\nclass Point{\npublic:\n double x,y;\n\n Point(double x = 0,double y = 0): x(x),y(y){}\n\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n bool operator < (const Segment& s)const { return (p1==s.p1) ? p2 < s.p2 : p1 < s.p1; } \n bool operator == (const Segment& p)const { return ( p.p1 == p1 && p.p2 == p2 ) || ( p.p1 == p2 && p.p2 == p1 ); }\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\ndouble abs(Point a){ return sqrt(norm(a)); }\n\nint ccw(Point p0,Point p1,Point p2){\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS)return CLOCKWISE;\n if(dot(a,b) < -EPS)return ONLINE_BACK;\n if(norm(a) < norm(b))return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n\nbool intersectSS(Line s, Line t) {\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\n}\n\nPoint projection(Line l,Point p) {\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\n return l.p1 + (l.p1-l.p2)*t;\n}\n\nPoint reflection(Line l,Point p) { return p + (projection(l, p) - p) * 2; }\n\nPoint crosspoint(Line l,Line m){\n double A = cross(l.p2-l.p1,m.p2-m.p1);\n double B = cross(l.p2-l.p1,l.p2-m.p1);\n if(abs(A) < EPS && abs(B) < EPS){\n vector<Point> vec;\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\n sort(vec.begin(),vec.end());\n return vec[1];\n }\n if(abs(A) < EPS)assert(false);\n return m.p1 + (m.p2-m.p1)*(B/A);\n}\n\ndouble cross3p(Point p,Point q,Point r) { return (r.x-q.x) * (p.y -q.y) - (r.y - q.y) * (p.x - q.x); }\nbool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }\n \nbool onSegment(Point p,Point q,Point r){\n return collinear(p,q,r) && equals(sqrt(pow(p.x-r.x,2)+pow(p.y-r.y,2)) + sqrt(pow(r.x-q.x,2) + pow(r.y-q.y,2) ),sqrt(pow(p.x-q.x,2)+pow(p.y-q.y,2)) ) ;\n}\n\ndouble angle(Point a,Point b,Point c) {\n double ux = b.x - a.x, uy = b.y - a.y;\n double vx = c.x - a.x, vy = c.y - a.y;\n return acos((ux*vx + uy*vy)/sqrt((ux*ux + uy*uy) * (vx*vx + vy*vy)));\n} \n \n//多角形poly内（線分上も含む）に点pが存在するかどうは判定する \nbool inPolygon(Polygon poly,Point p){\n if((int)poly.size() == 0)return false;\n rep(i,poly.size()) if(onSegment(poly[i],poly[(i+1)%poly.size()],p))return true;\n double sum = 0;\n for(int i=0; i < (int)poly.size() ;i++) {\n if( equals(cross(poly[i]-p,poly[(i+1)%poly.size()]-p),0.0) ) continue; // ３点が平行だとangleがnanを返しsumがnanになり死ぬ\n if( cross3p(p,poly[i],poly[(i+1)%poly.size()]) < 0 ) sum -= angle(p,poly[i],poly[(i+1)%poly.size()]);\n else sum += angle(p,poly[i],poly[(i+1)%poly.size()]);\n }\n // あまり誤差を厳しくしすぎると良くないので以下のほうが良い \n const double eps = 1e-5;\n return (fabs(sum - 2*M_PI) < eps || fabs(sum + 2*M_PI) < eps);\n} \n\nbool inPolygon(const Polygon &poly,Segment seg){\n vector<Point> vp;\n vp.push_back(seg.p1);\n vp.push_back(seg.p2);\n rep(i,(int)poly.size()) {\n Segment edge = Segment(poly[i],poly[(i+1)%(int)poly.size()]);\n if( equals(cross(seg.p1-seg.p2,edge.p1-edge.p2),0.0) ) {\n if( onSegment(seg.p1,seg.p2,edge.p1) ) vp.push_back(edge.p1);\n if( onSegment(seg.p1,seg.p2,edge.p2) ) vp.push_back(edge.p2);\n } else {\n if( intersectSS(seg,edge) ) vp.push_back(crosspoint(seg,edge));\n }\n }\n sort(vp.begin(),vp.end());\n vp.erase(unique(vp.begin(),vp.end()),vp.end());\n rep(i,(int)vp.size()-1) {\n Point middle_point = ( vp[i] + vp[i+1] ) / 2.0;\n if( !inPolygon(poly,middle_point) ) return false;\n }\n return true; \n}\n\nint V;\nPolygon poly;\nPoint light;\n\n// type 0 => =w=, type 1 => mirror\nvoid inner_add_new_points(Polygon &pol,vector<Point> &vp,int type,Line ref){\n rep(i,V){\n // ライトから普通のポリゴンの角をみる\n Vector e = ( poly[i] - light ) / abs( poly[i] - light );\n Segment seg = Segment(light,light+e*10000);\n rep(j,V) {\n Segment poly_seg = Segment(pol[j],pol[(j+1)%V]);\n if( equals(cross(seg.p2-seg.p1,poly_seg.p2-poly_seg.p1),0.0) ) continue;\n if( intersectSS(poly_seg,seg) ) {\n if( !type ) vp.push_back(crosspoint(poly_seg,seg));\n else vp.push_back(reflection(ref,crosspoint(poly_seg,seg)));\n }\n }\n\n // ライトから反転したポリゴンの角をみる\n e = ( pol[i] - light ) / abs( pol[i] - light );\n seg = Segment(light,light+e*10000);\n rep(j,V) {\n Segment poly_seg = Segment(pol[j],pol[(j+1)%V]);\n if( equals(cross(seg.p2-seg.p1,poly_seg.p2-poly_seg.p1),0.0) ) continue;\n if( intersectSS(poly_seg,seg) ) {\n if( !type ) vp.push_back(crosspoint(poly_seg,seg));\n else vp.push_back(reflection(ref,crosspoint(poly_seg,seg)));\n }\n }\n }\n}\n\nbool LT(double a,double b) { return !equals(a,b) && a < b; } \nbool LTE(double a,double b) { return equals(a,b) || a < b; } \n\nPoint vir;\nbool comp_dist(const Point& p1,const Point& p2){ return LT(abs(vir-p1),abs(vir-p2)); }\n\nvoid add_new_points(Polygon &new_poly){\n vector<Point> vp;\n inner_add_new_points(poly,vp,0,Line());\n rep(i,V){\n Line ref = Line(poly[i],poly[(i+1)%V]);\n Polygon rpoly(V);\n rep(j,V) {\n rpoly[j] = reflection(ref,poly[j]);\n if( equals(rpoly[j].x,0.0) ) rpoly[j].x = 0;\n if( equals(rpoly[j].y,0.0) ) rpoly[j].y = 0;\n }\n inner_add_new_points(rpoly,vp,1,ref);\n }\n\n rep(i,(int)vp.size()) {\n if( equals(vp[i].x,0.0) ) vp[i].x = 0;\n if( equals(vp[i].y,0.0) ) vp[i].y = 0;\n }\n\n vector<Point> tmp;\n rep(i,vp.size()) {\n bool failed = false;\n rep(j,V) if( vp[i] == poly[j] ) { failed = true; break; }\n if( !failed ) tmp.push_back(vp[i]);\n }\n vp = tmp;\n\n sort(vp.begin(),vp.end());\n vp.erase(unique(vp.begin(),vp.end()),vp.end());\n\n rep(i,V){\n vector<Point> buf;\n Segment seg = Segment(poly[i],poly[(i+1)%V]);\n rep(j,(int)vp.size()) if( onSegment(seg.p1,seg.p2,vp[j]) ) buf.push_back(vp[j]);\n vir = seg.p1;\n sort(buf.begin(),buf.end(),comp_dist);\n rep(j,(int)buf.size()) new_poly.push_back(buf[j]);\n new_poly.push_back(seg.p2);\n } \n}\n\nvoid compute_saw(Polygon &npoly,bool *saw){\n \n int nV = npoly.size(); \n // 直接見れる\n rep(i,nV) {\n Point mp = ( npoly[i] + npoly[(i+1)%nV] ) / 2.0;\n Segment vline = Segment(light,mp);\n bool failed = false;\n rep(j,V) {\n Segment seg = Segment(poly[j],poly[(j+1)%V]);\n if( equals(cross(seg.p1-seg.p2,vline.p1-vline.p2),0.0) ) continue;\n if( intersectSS(seg,vline) ) {\n if( onSegment(seg.p1,seg.p2,vline.p1) || onSegment(seg.p1,seg.p2,vline.p2) ) continue;\n if( onSegment(vline.p1,vline.p2,seg.p1) || onSegment(vline.p1,vline.p2,seg.p2) ) continue;\n failed = true;\n break;\n }\n }\n if( failed ) continue;\n saw[i] = true;\n }\n\n // 鏡一枚で見れる\n // 直接見える鏡だけを列挙\n vector<Line> ref;\n rep(i,nV) {\n Point mp = ( npoly[i] + npoly[(i+1)%nV] ) / 2.0;\n Segment vline = Segment(light,mp);\n bool failed = false;\n rep(j,V) {\n Segment seg = Segment(poly[j],poly[(j+1)%V]);\n if( equals(cross(seg.p1-seg.p2,vline.p1-vline.p2),0.0) ) continue;\n if( intersectSS(seg,vline) ) {\n if( onSegment(seg.p1,seg.p2,vline.p1) || onSegment(seg.p1,seg.p2,vline.p2) ) continue;\n if( onSegment(vline.p1,vline.p2,seg.p1) || onSegment(vline.p1,vline.p2,seg.p2) ) continue;\n failed = true;\n break;\n }\n }\n if( !failed ) ref.push_back(Line(npoly[i],npoly[(i+1)%nV]));\n }\n \n vector<Polygon> ref_polies;\n rep(i,(int)ref.size()){\n Polygon tmp_poly;\n rep(j,(int)poly.size()) tmp_poly.push_back(reflection(ref[i],poly[j]));\n ref_polies.push_back(tmp_poly);\n }\n\n rep(i,nV) if( !saw[i] ) {\n rep(j,(int)ref.size()){\n Segment rev_edge = Segment(reflection(ref[j],npoly[i]),reflection(ref[j],npoly[(i+1)%nV]));\n Point rev_mp = ( rev_edge.p1 + rev_edge.p2 ) / 2.0;\n Segment rev_vline = Segment(light,rev_mp);\n if( equals(cross(rev_vline.p1-rev_vline.p2,ref[j].p1-ref[j].p2),0.0) ) continue;\n if( !intersectSS(rev_vline,ref[j]) ) continue;\n rev_vline.p1 = crosspoint(rev_vline,ref[j]);\n if( inPolygon(ref_polies[j],rev_vline) ) {\n saw[i] = true;\n break;\n }\n }\n }\n}\n\nvoid compute(){\n Polygon npoly;\n add_new_points(npoly);\n int nV = npoly.size();\n bool saw[nV];\n rep(i,nV) saw[i] = false;\n compute_saw(npoly,saw);\n double sum = 0;\n rep(i,nV) if( !saw[i] )sum += abs(npoly[(i+1)%nV]-npoly[i]);\n sum = fabs(sum);\n printf(\"%.10lf\\n\",sum);\n}\n\nint main(){\n while( cin >> V, V ){\n poly.resize(V);\n rep(i,V) cin >> poly[i].x >> poly[i].y;\n cin >> light.x >> light.y;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":1540,"score_of_the_acc":-1.1181,"final_rank":4},{"submission_id":"aoj_2029_1046302","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-6)\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)\n\nusing namespace std;\n\nclass Point{\npublic:\n double x,y;\n\n Point(double x = 0,double y = 0): x(x),y(y){}\n\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n bool operator < (const Segment& s)const { return (p1==s.p1) ? p2 < s.p2 : p1 < s.p1; } \n bool operator == (const Segment& p)const { return ( p.p1 == p1 && p.p2 == p2 ) || ( p.p1 == p2 && p.p2 == p1 ); }\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\nostream& operator << (ostream& os,const Point& a){ os << \"(\" << a.x << \",\" << a.y << \")\"; }\n\nostream& operator << (ostream& os,const Segment& a){ os << \"( \" << a.p1 << \" , \" << a.p2 << \" )\"; }\n\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\n\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\n\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\n\ndouble abs(Point a){ return sqrt(norm(a)); }\n\n//rad は角度をラジアンで持たせること\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n\n// 度をラジアンに変換\ndouble toRad(double agl){ return agl*M_PI/180.0; }\n\n// a => prev, b => cur, c=> next\n// prev から cur へ行って next へ行く際の角度を求める\ndouble getArg(Point a,Point b,Point c){\n double arg1 = atan2(b.y-a.y,b.x-a.x);\n double arg2 = atan2(c.y-b.y,c.x-b.x);\n double arg = fabs( arg1 - arg2 );\n while( arg > M_PI ) arg -= 2.0 * M_PI;\n return fabs(arg);\n}\n\nint ccw(Point p0,Point p1,Point p2){\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS)return CLOCKWISE;\n if(dot(a,b) < -EPS)return ONLINE_BACK;\n if(norm(a) < norm(b))return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n\nbool intersectLL(Line l, Line m) {\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\n}\nbool intersectLS(Line l, Line s) {\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\n}\nbool intersectLP(Line l,Point p) {\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\n}\nbool intersectSS(Line s, Line t) {\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\n}\nbool intersectSP(Line s, Point p) {\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\n}\n\nPoint projection(Line l,Point p) {\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\n return l.p1 + (l.p1-l.p2)*t;\n}\nPoint reflection(Line l,Point p) {\n return p + (projection(l, p) - p) * 2;\n}\ndouble distanceLP(Line l, Point p) {\n return abs(p - projection(l, p));\n}\ndouble distanceLL(Line l, Line m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\n}\n\ndouble distanceLS(Line l, Line s) {\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\n}\ndouble distanceSP(Line s, Point p) {\n Point r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s.p1 - p), abs(s.p2 - p));\n}\n\ndouble distanceSS(Line s, Line t) {\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\n}\n\nPoint crosspoint(Line l,Line m){\n double A = cross(l.p2-l.p1,m.p2-m.p1);\n double B = cross(l.p2-l.p1,l.p2-m.p1);\n if(abs(A) < EPS && abs(B) < EPS){\n vector<Point> vec;\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\n sort(vec.begin(),vec.end());\n assert(vec[1] == vec[2]); //同じセグメントかもよ\n return vec[1];\n //return m.p1;\n }\n if(abs(A) < EPS)assert(false);\n return m.p1 + (m.p2-m.p1)*(B/A);\n}\n\n//cross product of pq and pr\ndouble cross3p(Point p,Point q,Point r) { return (r.x-q.x) * (p.y -q.y) - (r.y - q.y) * (p.x - q.x); }\n \n//returns true if point r is on the same line as the line pq\nbool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }\n \n//returns true if point t is on the left side of line pq\nbool ccwtest(Point p,Point q,Point r){\n return cross3p(p,q,r) > 0; //can be modified to accept collinear points\n}\n \nbool onSegment(Point p,Point q,Point r){\n return collinear(p,q,r) && equals(sqrt(pow(p.x-r.x,2)+pow(p.y-r.y,2)) + sqrt(pow(r.x-q.x,2) + pow(r.y-q.y,2) ),sqrt(pow(p.x-q.x,2)+pow(p.y-q.y,2)) ) ;\n}\n \n\nbool isConvex(vector<Point> p) {\n int sz = (int)p.size();\n if(sz < 3)return false;//boundary case, we treat a point or a line as not convex\n bool isLeft = ccwtest(p[0],p[1],p[2]);\n for(int i=1; i<(int)p.size();i++)\n if(ccwtest(p[i],p[(i+1)%sz],p[(i+2)%sz]) != isLeft) return false;\n return true;\n}\n\n\ndouble angle(Point a,Point b,Point c) {\n double ux = b.x - a.x, uy = b.y - a.y;\n double vx = c.x - a.x, vy = c.y - a.y;\n return acos((ux*vx + uy*vy)/sqrt((ux*ux + uy*uy) * (vx*vx + vy*vy)));\n} \n \n//多角形poly内（線分上も含む）に点pが存在するかどうは判定する \nbool inPolygon(Polygon poly,Point p){\n if((int)poly.size() == 0)return false;\n rep(i,poly.size()) if(onSegment(poly[i],poly[(i+1)%poly.size()],p))return true;\n double sum = 0;\n for(int i=0; i < (int)poly.size() ;i++) {\n if( equals(cross(poly[i]-p,poly[(i+1)%poly.size()]-p),0.0) ) continue; // ３点が平行だとangleがnanを返しsumがnanになり死ぬ\n if( cross3p(p,poly[i],poly[(i+1)%poly.size()]) < 0 ) sum -= angle(p,poly[i],poly[(i+1)%poly.size()]);\n else sum += angle(p,poly[i],poly[(i+1)%poly.size()]);\n }\n // あまり誤差を厳しくしすぎると良くないので以下のほうが良い \n const double eps = 1e-5;\n return (fabs(sum - 2*M_PI) < eps || fabs(sum + 2*M_PI) < eps);\n} \n\nbool inPolygon(const Polygon &poly,Segment seg){\n vector<Point> vp;\n vp.push_back(seg.p1);\n vp.push_back(seg.p2);\n rep(i,(int)poly.size()) {\n Segment edge = Segment(poly[i],poly[(i+1)%(int)poly.size()]);\n if( equals(cross(seg.p1-seg.p2,edge.p1-edge.p2),0.0) ) {\n if( onSegment(seg.p1,seg.p2,edge.p1) ) vp.push_back(edge.p1);\n if( onSegment(seg.p1,seg.p2,edge.p2) ) vp.push_back(edge.p2);\n } else {\n if( intersectSS(seg,edge) ) vp.push_back(crosspoint(seg,edge));\n }\n }\n sort(vp.begin(),vp.end());\n vp.erase(unique(vp.begin(),vp.end()),vp.end());\n rep(i,(int)vp.size()-1) {\n Point middle_point = ( vp[i] + vp[i+1] ) / 2.0;\n if( !inPolygon(poly,middle_point) ) return false;\n }\n return true; \n}\n\nint V;\nPolygon poly;\nPoint light;\n\n// type 0 => =w=, type 1 => mirror\nvoid inner_add_new_points(Polygon &pol,vector<Point> &vp,int type,Line ref){\n rep(i,V){\n Vector e = ( poly[i] - light ) / abs( poly[i] - light );\n Segment seg = Segment(light,light+e*10000);\n rep(j,V) {\n Segment poly_seg = Segment(pol[j],pol[(j+1)%V]);\n if( equals(cross(seg.p2-seg.p1,poly_seg.p2-poly_seg.p1),0.0) ) continue;\n if( intersectSS(poly_seg,seg) ) {\n if( !type ) vp.push_back(crosspoint(poly_seg,seg));\n else vp.push_back(reflection(ref,crosspoint(poly_seg,seg)));\n }\n }\n\n e = ( pol[i] - light ) / abs( pol[i] - light );\n seg = Segment(light,light+e*10000);\n rep(j,V) {\n Segment poly_seg = Segment(pol[j],pol[(j+1)%V]);\n if( equals(cross(seg.p2-seg.p1,poly_seg.p2-poly_seg.p1),0.0) ) continue;\n if( intersectSS(poly_seg,seg) ) {\n if( !type ) vp.push_back(crosspoint(poly_seg,seg));\n else vp.push_back(reflection(ref,crosspoint(poly_seg,seg)));\n }\n }\n\n }\n}\n\nbool LT(double a,double b) { return !equals(a,b) && a < b; } \nbool LTE(double a,double b) { return equals(a,b) || a < b; } \n\nPoint vir;\nbool comp_dist(const Point& p1,const Point& p2){ return LT(abs(vir-p1),abs(vir-p2)); }\n\nvoid add_new_points(Polygon &new_poly){\n vector<Point> vp;\n\n inner_add_new_points(poly,vp,0,Line());\n rep(i,V){\n Line ref = Line(poly[i],poly[(i+1)%V]);\n Polygon rpoly(V);\n rep(j,V) {\n rpoly[j] = reflection(ref,poly[j]);\n if( equals(rpoly[j].x,0.0) ) rpoly[j].x = 0;\n if( equals(rpoly[j].y,0.0) ) rpoly[j].y = 0;\n }\n inner_add_new_points(rpoly,vp,1,ref);\n }\n\n\n /*\n // 直接見える点の列挙\n rep(i,V){\n Vector e = ( poly[i] - light ) / abs( poly[i] - light );\n Segment vline = Segment(light,light+e*10000);\n rep(j,V){\n Segment seg = Segment(poly[j],poly[(j+1)%V]);\n if( equals(cross(vline.p1-vline.p2,seg.p1-seg.p2),0.0) ) continue;\n if( intersectSS(vline,seg) ) {\n if( onSegment(vline.p1,vline.p2,seg.p1) || onSegment(vline.p1,vline.p2,seg.p2) ) continue;\n if( onSegment(seg.p1,seg.p2,vline.p1) || onSegment(seg.p1,seg.p2,vline.p2) ) continue;\n vp.push_back(crosspoint(vline,seg));\n }\n }\n }\n\n // 鏡に反射して見える点の列挙\n\n rep(i,V){\n Line ref = Line(poly[i],poly[(i+1)%V]);\n Polygon rev_poly;\n rep(j,V) rev_poly.push_back(reflection(ref,poly[j])); \n \n\n }\n */\n\n\n //------------------------------\n\n rep(i,(int)vp.size()) {\n if( equals(vp[i].x,0.0) ) vp[i].x = 0;\n if( equals(vp[i].y,0.0) ) vp[i].y = 0;\n }\n\n vector<Point> tmp;\n rep(i,vp.size()) {\n bool failed = false;\n rep(j,V) if( vp[i] == poly[j] ) { failed = true; break; }\n if( !failed ) tmp.push_back(vp[i]);\n }\n vp = tmp;\n\n sort(vp.begin(),vp.end());\n vp.erase(unique(vp.begin(),vp.end()),vp.end());\n\n rep(i,V){\n vector<Point> buf;\n Segment seg = Segment(poly[i],poly[(i+1)%V]);\n rep(j,(int)vp.size()) if( onSegment(seg.p1,seg.p2,vp[j]) ) buf.push_back(vp[j]);\n vir = seg.p1;\n sort(buf.begin(),buf.end(),comp_dist);\n rep(j,(int)buf.size()) new_poly.push_back(buf[j]);\n new_poly.push_back(seg.p2);\n } \n\n}\n\nvoid compute_saw(Polygon &npoly,bool *saw){\n \n int nV = npoly.size(); \n // 直接見れる\n\n rep(i,nV) {\n Point mp = ( npoly[i] + npoly[(i+1)%nV] ) / 2.0;\n Segment vline = Segment(light,mp);\n bool failed = false;\n rep(j,V) {\n Segment seg = Segment(poly[j],poly[(j+1)%V]);\n if( equals(cross(seg.p1-seg.p2,vline.p1-vline.p2),0.0) ) continue;\n if( intersectSS(seg,vline) ) {\n if( onSegment(seg.p1,seg.p2,vline.p1) || onSegment(seg.p1,seg.p2,vline.p2) ) continue;\n if( onSegment(vline.p1,vline.p2,seg.p1) || onSegment(vline.p1,vline.p2,seg.p2) ) continue;\n failed = true;\n break;\n }\n }\n if( failed ) continue;\n saw[i] = true;\n }\n /*\n cout << \"direct see\" << endl;\n rep(i,nV) if( saw[i] )cout << npoly[i] << \",\" << npoly[(i+1)%nV]<< endl;\n cout << endl;\n */\n // 鏡一枚で見れる\n\n // 直接見える鏡だけを列挙\n vector<Line> ref;\n rep(i,nV) {\n Point mp = ( npoly[i] + npoly[(i+1)%nV] ) / 2.0;\n Segment vline = Segment(light,mp);\n bool failed = false;\n rep(j,V) {\n Segment seg = Segment(poly[j],poly[(j+1)%V]);\n if( equals(cross(seg.p1-seg.p2,vline.p1-vline.p2),0.0) ) continue;\n if( intersectSS(seg,vline) ) {\n if( onSegment(seg.p1,seg.p2,vline.p1) || onSegment(seg.p1,seg.p2,vline.p2) ) continue;\n if( onSegment(vline.p1,vline.p2,seg.p1) || onSegment(vline.p1,vline.p2,seg.p2) ) continue;\n failed = true;\n break;\n }\n }\n if( !failed ) ref.push_back(Line(npoly[i],npoly[(i+1)%nV]));\n }\n \n vector<Polygon> ref_polies;\n rep(i,(int)ref.size()){\n Polygon tmp_poly;\n rep(j,(int)poly.size()) tmp_poly.push_back(reflection(ref[i],poly[j]));\n ref_polies.push_back(tmp_poly);\n }\n /*\n rep(i,(int)ref.size()) {\n cout << \"ref[\" << i << \"] = \" << ref[i] << endl;\n rep(j,(int)ref_polies[i].size()){\n cout << \" \" << ref_polies[i][j];\n } cout << endl;\n }\n */\n\n rep(i,nV) if( !saw[i] ) {\n rep(j,(int)ref.size()){\n Segment rev_edge = Segment(reflection(ref[j],npoly[i]),reflection(ref[j],npoly[(i+1)%nV]));\n Point rev_mp = ( rev_edge.p1 + rev_edge.p2 ) / 2.0;\n Segment rev_vline = Segment(light,rev_mp);\n if( equals(cross(rev_vline.p1-rev_vline.p2,ref[j].p1-ref[j].p2),0.0) ) continue;\n if( !intersectSS(rev_vline,ref[j]) ) continue;\n\n rev_vline.p1 = crosspoint(rev_vline,ref[j]);\n \n if( inPolygon(ref_polies[j],rev_vline) ) {\n saw[i] = true;\n break;\n }\n\n }\n }\n \n}\n\nvoid compute(){\n Polygon npoly;\n add_new_points(npoly);\n int nV = npoly.size();\n rep(i,nV) {\n if( equals(npoly[i].x,0.0) ) npoly[i].x = 0;\n if( equals(npoly[i].y,0.0) ) npoly[i].y = 0;\n }\n bool saw[nV];\n rep(i,nV) saw[i] = false;\n compute_saw(npoly,saw);\n rep(i,nV) {\n if( equals(npoly[i].x,0.0) ) npoly[i].x = 0;\n if( equals(npoly[i].y,0.0) ) npoly[i].y = 0;\n }\n /*\n cout << \"nV = \" << nV << endl;\n rep(i,nV) cout << i << \"-th \" << npoly[i] << endl;\n cout << endl;\n\n rep(i,nV) {\n if( !saw[i] ) cout << \"cannot see \" << npoly[i] << \",\" << npoly[(i+1)%nV] << \" : \" << abs(npoly[i]-npoly[(i+1)%nV]) << endl;\n }\n */\n\n double sum = 0;\n rep(i,nV) if( !saw[i] )sum += abs(npoly[(i+1)%nV]-npoly[i]);\n sum = fabs(sum);\n printf(\"%.10lf\\n\",sum);\n}\n\nint main(){\n while( cin >> V, V ){\n poly.resize(V);\n rep(i,V) cin >> poly[i].x >> poly[i].y;\n cin >> light.x >> light.y;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":1548,"score_of_the_acc":-1.122,"final_rank":5},{"submission_id":"aoj_2029_665770","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 <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()\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)\nconst int INF = 1<<29;\nconst double EPS = 1e-8;\nconst double PI = acos(-1);\ntypedef pair<int,int> pii;\ntypedef long long ll;\n\ntypedef complex<double> P;\nnamespace std {\n bool operator < (const P& a, const P& b) {\n // if (abs(a-b)<EPS) return 0;\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n }\n}\ndouble cross(const P& a, const P& b) {\n return imag(conj(a)*b);\n}\ndouble dot(const P& a, const P& b) {\n return real(conj(a)*b);\n}\nstruct L : public vector<P> {\n L(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n L() {}\n};\nostream &operator<<(ostream &os, const L &a) {\n os << a[0] << \" -> \" << a[1];\n return os;\n}\n\ntypedef vector<P> G;\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\nstruct C {\n P p; double r;\n C(const P &p, double r) : p(p), r(r) { }\n};\n\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > 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\n return 0;\n}\n\nP rotate(const P &p, double ang) {\n return p * P(cos(ang), sin(ang));\n}\n\nP projection(const L &l, const P &p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\nP reflection(const L &l, const P &p) {\n return p + P(2,0) * (projection(l, p) - p);\n}\n\ndouble distanceLP(const L &l, const P &p) {\n return abs(p - projection(l, p));\n}\n\nbool intersectSP(const L &s, const P &p) {\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\n}\nbool intersectLL(const L &l, const L &m) {\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel\n abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line\n}\nbool intersectLS(const L &l, const L &s) {\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\n}\nbool intersectLP(const L &l, const P &p) {\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\n}\nbool intersectSS(const L &s, const L &t) {\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\nbool intersectSS2(const L &s, const L &t) {\n if (intersectSP(s,t[0]) || intersectSP(s,t[1]) ||\n intersectSP(t,s[0]) || intersectSP(t,s[1])) return 0;\n return intersectSS(s,t);\n}\nbool intersectHS(const L &h, const L &s) {\n if (intersectLP(h,s[0]) || intersectLP(h,s[1]) ||\n intersectLP(s,h[0]) || intersectLP(s,h[1])) return 0;\n if (intersectSS(h,s)) return 1;\n if (!intersectLS(h,s)) return 0;\n return (ccw(s[0],s[1],h[0]) == 1) ^ (cross(s[1]-s[0], h[1]-h[0]) > 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]; // same line\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m[0] + B / A * (m[1] - m[0]);\n}\n\nint n;\nL pl[20];\nvector<P> v[20];\n\n\nint mostNearest(const L &h) {\n double mi = INF;\n int res = -1;\n REP(k,n) {\n if (intersectHS(h,pl[k])) {\n if (chmin(mi,norm(crosspoint(h,pl[k])-h[0]))) {\n res = k;\n }\n }\n }\n return res;\n}\n\n\nvoid func(const L &h) {\n int cl_id = mostNearest(h);\n if (cl_id != -1) {\n v[cl_id].push_back(crosspoint(h,pl[cl_id]));\n }\n}\n\nP c;\n\nbool isVisible(const P &p, const P &q) { // direct visible\n REP(i,n) if (intersectSS2(L(p,q),pl[i])) return 0;\n return 1;\n}\n\nbool isVisibleUsingReflection(const P &p) { // visible from c\n // direct\n if (isVisible(c,p)) return 1;\n L l(c,p); \n // reflect\n REP(j,n) { \n if (ccw(pl[j][0], pl[j][1], c) * ccw(pl[j][0], pl[j][1], p) != 1) continue;\n double d1 = distanceLP(pl[j],c);\n double d2 = distanceLP(pl[j],p);\n P refp = P(d2/(d1+d2),0) * projection(pl[j],c) + P(d1/(d1+d2),0) * projection(pl[j],p);\n if (!intersectSP(pl[j], refp)) continue;\n if (isVisible(c,refp) && isVisible(refp,p)) return 1;\n }\n return 0;\n}\n\nL reflect(const L &h, const L &l) {\n P refp = crosspoint(h,l);\n P v = refp - reflection(l,h[0]);\n return L(refp,refp+v);\n}\n\nint main() {\n while(cin >> n, n) {\n P p[20];\n REP(i,n) {\n cin >> p[i].real() >> p[i].imag();\n }\n REP(i,n) {\n pl[i] = L(p[i],p[(i+1)%n]); \n }\n cin >> c.real() >> c.imag();\n REP(i,n) v[i].clear();\n \n REP(i,n) {\n bool ok = 1;\n if (isVisible(c,p[i])) {\n L h = L(c,p[i]); \n // c -> p[i]\n func(h); \n // c -> p[i] -> reflection\n int ref_id = mostNearest(h);\n if (ref_id != -1) {\n // reflect at pl[ref_id]\n func(reflect(h, pl[ref_id]));\n }\n }\n // c -> pl[j] -> p[i]\n REP(j,n) { \n if (ccw(pl[j][0], pl[j][1], c) * ccw(pl[j][0], pl[j][1], p[i]) != 1) continue; // different side\n double d1 = distanceLP(pl[j],c);\n double d2 = distanceLP(pl[j],p[i]);\n P refp = P(d2/(d1+d2),0) * projection(pl[j],c) + P(d1/(d1+d2),0) * projection(pl[j],p[i]);\n if (!intersectSP(pl[j], refp)) continue;\n if (isVisible(c,refp)) func(L(refp,p[i]));\n }\n // reflect at corners of pl[i]\n {\n P refp = pl[i][0];\n if (isVisible(c,refp)) {\n func(reflect(L(c,refp),pl[i]));\n }\n }\n {\n P refp = pl[i][1];\n if (isVisible(c,refp)) {\n func(reflect(L(c,refp),pl[i]));\n }\n }\n }\n double ans = 0;\n REP(i,n) {\n // cout << i << endl;\n // FOR(it, v[i]) {\n // cout << *it << endl;\n // }\n double len = abs(pl[i][1]-pl[i][0]);\n vector<double> vv;\n vv.push_back(0);\n vv.push_back(len);\n FOR(it, v[i]) {\n vv.push_back(abs(*it - pl[i][0]));\n }\n sort(ALL(vv));\n REP(j,vv.size()-1) {\n double s = (vv[j]+vv[j+1])/2 / len;\n P q = (1-s)*pl[i][0] + s*pl[i][1];\n if (!isVisibleUsingReflection(q)) {\n ans += vv[j+1]-vv[j];\n\n double ss = vv[j]/len, tt = vv[j+1]/len;\n P p1 = (1-ss)*pl[i][0] + ss*pl[i][1];\n P p2 = (1-tt)*pl[i][0] + tt*pl[i][1];\n // cout << p1.real() << \" \" << p1.imag() << endl;\n // cout << p2.real() << \" \" << p2.imag() << endl;\n // cout << endl;\n }\n }\n }\n printf(\"%.10f\\n\", ans);\n }\n}","accuracy":1,"time_ms":40,"memory_kb":1300,"score_of_the_acc":-0.5,"final_rank":1},{"submission_id":"aoj_2029_665751","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 <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()\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)\nconst int INF = 1<<29;\nconst double EPS = 1e-8;\nconst double PI = acos(-1);\ntypedef pair<int,int> pii;\ntypedef long long ll;\n\ntypedef complex<double> P;\nnamespace std {\n bool operator < (const P& a, const P& b) {\n // if (abs(a-b)<EPS) return 0;\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n }\n}\ndouble cross(const P& a, const P& b) {\n return imag(conj(a)*b);\n}\ndouble dot(const P& a, const P& b) {\n return real(conj(a)*b);\n}\nstruct L : public vector<P> {\n L(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n L() {}\n};\nostream &operator<<(ostream &os, const L &a) {\n os << a[0] << \" -> \" << a[1];\n return os;\n}\n\ntypedef vector<P> G;\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\nstruct C {\n P p; double r;\n C(const P &p, double r) : p(p), r(r) { }\n};\n\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > 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\n return 0;\n}\n\nP rotate(const P &p, double ang) {\n return p * P(cos(ang), sin(ang));\n}\n\nP projection(const L &l, const P &p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\nP reflection(const L &l, const P &p) {\n return p + P(2,0) * (projection(l, p) - p);\n}\n\ndouble distanceLP(const L &l, const P &p) {\n return abs(p - projection(l, p));\n}\n\nbool intersectSP(const L &s, const P &p) {\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\n}\nbool intersectLL(const L &l, const L &m) {\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel\n abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line\n}\nbool intersectLS(const L &l, const L &s) {\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\n}\nbool intersectLP(const L &l, const P &p) {\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\n}\nbool intersectSS(const L &s, const L &t) {\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\nbool intersectSS2(const L &s, const L &t) {\n if (intersectSP(s,t[0]) || intersectSP(s,t[1]) ||\n intersectSP(t,s[0]) || intersectSP(t,s[1])) return 0;\n return intersectSS(s,t);\n}\nbool intersectHS(const L &h, const L &s) {\n if (intersectLP(h,s[0]) || intersectLP(h,s[1]) ||\n intersectLP(s,h[0]) || intersectLP(s,h[1])) return 0;\n if (intersectSS(h,s)) return 1;\n if (!intersectLS(h,s)) return 0;\n return (ccw(s[0],s[1],h[0]) == 1) ^ (cross(s[1]-s[0], h[1]-h[0]) > 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]; // same line\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m[0] + B / A * (m[1] - m[0]);\n}\n\nint n;\nL pl[20];\nvector<P> v[20];\n\nvoid func(const L &h) {\n double mi = INF;\n int cl_id = -1;\n REP(k,n) {\n if (intersectHS(h,pl[k])) {\n if (chmin(mi,norm(crosspoint(h,pl[k])-h[0]))) {\n cl_id = k;\n }\n }\n }\n if (cl_id != -1) {\n v[cl_id].push_back(crosspoint(h,pl[cl_id]));\n }\n}\n\nP c;\n\nbool isVisible(const P &p) {\n // direct\n L l(c,p);\n bool ok = 1;\n REP(i,n) {\n ok &= !intersectSS2(l,pl[i]);\n }\n if (ok) return 1;\n // reflect\n REP(j,n) { \n if (ccw(pl[j][0], pl[j][1], c) * ccw(pl[j][0], pl[j][1], p) != 1) continue;\n double d1 = distanceLP(pl[j],c);\n double d2 = distanceLP(pl[j],p);\n P refp = P(d2/(d1+d2),0) * projection(pl[j],c) + P(d1/(d1+d2),0) * projection(pl[j],p);\n if (!intersectSP(pl[j], refp)) continue;\n bool ok = 1;\n L l1(c,refp);\n L l2(refp,p);\n REP(k,n) {\n ok &= !intersectSS2(l1,pl[k]);\n ok &= !intersectSS2(l2,pl[k]);\n }\n if (ok) return 1;\n }\n return 0;\n}\n\nint main() {\n while(cin >> n, n) {\n P p[20];\n REP(i,n) {\n cin >> p[i].real() >> p[i].imag();\n }\n REP(i,n) {\n pl[i] = L(p[i],p[(i+1)%n]); \n }\n cin >> c.real() >> c.imag();\n REP(i,n) v[i].clear();\n \n REP(i,n) {\n bool ok = 1;\n L l1 = L(c,p[i]);\n REP(k,n) ok &= !intersectSS2(l1,pl[k]);\n if (ok) {\n // c -> p[i]\n func(l1); \n // c -> p[i] -> reflection\n int ref_id = -1;\n double mi = INF;\n REP(j,n) {\n if (intersectHS(l1,pl[j])) {\n if (chmin(mi, norm(crosspoint(l1,pl[j])-c))) {\n ref_id = j;\n }\n }\n }\n if (ref_id != -1) {\n // reflect at pl[ref_id]\n P refp = crosspoint(l1,pl[ref_id]);\n P v = refp - reflection(pl[ref_id],c);\n func(L(refp, refp+v));\n }\n }\n // c -> pl[j] -> p[i]\n REP(j,n) { \n if (ccw(pl[j][0], pl[j][1], c) * ccw(pl[j][0], pl[j][1], p[i]) != 1) continue;\n double d1 = distanceLP(pl[j],c);\n double d2 = distanceLP(pl[j],p[i]);\n P refp = P(d2/(d1+d2),0) * projection(pl[j],c) + P(d1/(d1+d2),0) * projection(pl[j],p[i]);\n if (!intersectSP(pl[j], refp)) continue;\n bool ok = 1;\n L l1(c,refp);\n L l2(refp,p[i]);\n REP(k,n) {\n ok &= !intersectSS2(l1,pl[k]);\n }\n if (!ok) continue;\n\n func(l2);\n }\n // reflect at corners of pl[i]\n {\n P refp = pl[i][0];\n L l1(c,refp);\n bool ok = 1; \n REP(k,n) ok &= !intersectSS2(l1,pl[k]);\n if (ok) {\n L l2 = L(refp, refp + refp-reflection(pl[i], c)); \n func(l2);\n }\n }\n {\n P refp = pl[i][1];\n L l1(c,refp);\n bool ok = 1; \n REP(k,n) ok &= !intersectSS2(l1,pl[k]);\n if (ok) {\n L l2 = L(refp, refp + refp-reflection(pl[i], c));\n func(l2);\n } \n }\n }\n double ans = 0;\n REP(i,n) {\n // cout << i << endl;\n // FOR(it, v[i]) {\n // cout << *it << endl;\n // }\n double len = abs(pl[i][1]-pl[i][0]);\n vector<double> vv;\n vv.push_back(0);\n vv.push_back(len);\n FOR(it, v[i]) {\n vv.push_back(abs(*it - pl[i][0]));\n }\n sort(ALL(vv));\n REP(j,vv.size()-1) {\n double s = (vv[j]+vv[j+1])/2 / len;\n P q = (1-s)*pl[i][0] + s*pl[i][1];\n if (!isVisible(q)) {\n ans += vv[j+1]-vv[j];\n\n double ss = vv[j]/len, tt = vv[j+1]/len;\n P p1 = (1-ss)*pl[i][0] + ss*pl[i][1];\n P p2 = (1-tt)*pl[i][0] + tt*pl[i][1];\n // cout << p1.real() << \" \" << p1.imag() << endl;\n // cout << p2.real() << \" \" << p2.imag() << endl;\n // cout << endl;\n }\n }\n }\n printf(\"%.10f\\n\", ans);\n }\n}","accuracy":1,"time_ms":40,"memory_kb":1300,"score_of_the_acc":-0.5,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2029_3168624\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <array>\\nusing namespace std;\\nconst double EPS = 1e-6;\\nconst double INF = 1e12;\\nconst double PI = acos(-1);\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\n\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\nstruct L : array<P, 2>{\\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\\n L(){}\\n};\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\nint ccw(P a, P b, P c){\\n b -= a;\\n c -= a;\\n if(cross(b,c) > EPS) return +1; //ccw\\n if(cross(b,c) < -EPS) return -1; //cw\\n if(dot(b,c) < -EPS) return +2; //c-a-b\\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\\n return 0; //a-c-b\\n}\\n\\nbool intersectLS(const L& l, const L& s){\\n return cross(l[1]-l[0], s[0]-l[0])*\\n cross(l[1]-l[0], s[1]-l[0]) < EPS;\\n}\\nbool intersectSS(const L& a, const L& b){\\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\\n}\\nbool strictItsSS(const L& a, const L& b){\\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) < 0 ) &&\\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) < 0 );\\n}\\n\\nP projection(const L& l, const P& p) {\\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\\n return l[0] + t*(l[0]-l[1]);\\n}\\nP reflection(const L& l, const P& p) {\\n return p + 2.0*(projection(l, p) -p);\\n}\\n\\nbool isParallel(const P &a, const P &b){\\n return abs(cross(a,b)) < EPS;\\n}\\nbool isParallel(const L &a, const L &b){\\n return isParallel(a[1]-a[0], b[1]-b[0]);\\n}\\nP crosspointLL(const L &l, const L &m) {\\n double A = cross(l[1]-l[0], m[1]-m[0]);\\n double B = cross(l[1]-l[0], l[1]-m[0]);\\n return m[0] + B/A *(m[1]-m[0]);\\n}\\n\\nint main(){\\n while(1){\\n int n;\\n cin >> n;\\n if(n == 0) break;\\n\\n VP p(n);\\n for(int i=0; i<n; i++){\\n int x,y;\\n cin >> x >> y;\\n p[i] = P(x, y);\\n }\\n int sx,sy;\\n cin >> sx >> sy;\\n P source(sx, sy);\\n\\n vector<L> edge(n);\\n vector<VP> cp(n);\\n for(int i=0; i<n; i++){\\n edge[i] = L(p[i], p[(i+1)%n]);\\n cp[i].push_back(edge[i][0]);\\n cp[i].push_back(edge[i][1]);\\n }\\n\\n for(int v=0; v<n; v++){\\n L ray(source, p[v]);\\n for(int wr=0; wr<n; wr++){\\n if(!isParallel(ray, edge[wr]) && intersectLS(ray, edge[wr])){\\n P cpll = crosspointLL(ray, edge[wr]);\\n //直接頂点を通る\\n cp[wr].push_back(cpll);\\n //その後反射する\\n P ref = reflection(edge[wr], source);\\n L ray2(ref, cpll);\\n for(int wt=0; wt<n; wt++){\\n if(!isParallel(ray2, edge[wt]) && intersectLS(ray2, edge[wt])){\\n cp[wt].push_back(crosspointLL(ray2, edge[wt]));\\n }\\n }\\n }\\n }\\n\\n //反射して頂点を通る\\n for(int wr=0; wr<n; wr++){\\n P s = reflection(edge[wr], source);\\n L ray(s, p[v]);\\n for(int wt=0; wt<n; wt++){\\n if(!isParallel(ray, edge[wt]) && intersectLS(ray, edge[wt])){\\n cp[wt].push_back(crosspointLL(ray, edge[wt]));\\n }\\n }\\n }\\n }\\n for(int i=0; i<n; i++){\\n sort(cp[i].begin(), cp[i].end());\\n cp[i].erase(unique(cp[i].begin(), cp[i].end()), cp[i].end());\\n }\\n\\n double ans = 0;\\n for(int i=0; i<n; i++){\\n for(int j=0; j<(int)cp[i].size()-1; j++){\\n P mid = (cp[i][j] +cp[i][j+1]) /2.0;\\n bool light = false;\\n //反射する壁を選ぶ\\n for(int wr=0; wr<n; wr++){\\n P ref = reflection(edge[wr], mid);\\n if(!intersectSS(L(ref, source), edge[wr])) continue;\\n P rp;\\n if(isParallel(L(ref, source), edge[wr])){\\n rp = (ref +source) /2.0;\\n }else{\\n rp = crosspointLL(L(ref, source), edge[wr]);\\n }\\n vector<L> ray{L(mid, rp), L(rp, source)};\\n\\n bool block = false;\\n for(int k=0; k<2; k++){\\n for(int w=0; w<n; w++){\\n if(!isParallel(ray[k], edge[w]) && strictItsSS(ray[k], edge[w])){\\n block = true;\\n k = 2;\\n break;\\n }\\n }\\n }\\n if(!block){\\n light = true;\\n break;\\n }\\n }\\n if(!light){\\n ans += abs(cp[i][j+1] -cp[i][j]);\\n }\\n }\\n }\\n\\n cout << fixed << setprecision(10);\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3332,\n \"score_of_the_acc\": -1,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2029_1046306\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-6)\\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)\\n\\nusing namespace std;\\n\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = 0,double y = 0): x(x),y(y){}\\n\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n bool operator < (const Segment& s)const { return (p1==s.p1) ? p2 < s.p2 : p1 < s.p1; } \\n bool operator == (const Segment& p)const { return ( p.p1 == p1 && p.p2 == p2 ) || ( p.p1 == p2 && p.p2 == p1 ); }\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\ntypedef vector<Point> Polygon;\\n\\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS)return CLOCKWISE;\\n if(dot(a,b) < -EPS)return ONLINE_BACK;\\n if(norm(a) < norm(b))return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n\\nbool intersectSS(Line s, Line t) {\\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\\n}\\n\\nPoint projection(Line l,Point p) {\\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\\n return l.p1 + (l.p1-l.p2)*t;\\n}\\n\\nPoint reflection(Line l,Point p) { return p + (projection(l, p) - p) * 2; }\\n\\nPoint crosspoint(Line l,Line m){\\n double A = cross(l.p2-l.p1,m.p2-m.p1);\\n double B = cross(l.p2-l.p1,l.p2-m.p1);\\n if(abs(A) < EPS && abs(B) < EPS){\\n vector<Point> vec;\\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\\n sort(vec.begin(),vec.end());\\n return vec[1];\\n }\\n if(abs(A) < EPS)assert(false);\\n return m.p1 + (m.p2-m.p1)*(B/A);\\n}\\n\\ndouble cross3p(Point p,Point q,Point r) { return (r.x-q.x) * (p.y -q.y) - (r.y - q.y) * (p.x - q.x); }\\nbool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }\\n \\nbool onSegment(Point p,Point q,Point r){\\n return collinear(p,q,r) && equals(sqrt(pow(p.x-r.x,2)+pow(p.y-r.y,2)) + sqrt(pow(r.x-q.x,2) + pow(r.y-q.y,2) ),sqrt(pow(p.x-q.x,2)+pow(p.y-q.y,2)) ) ;\\n}\\n\\ndouble angle(Point a,Point b,Point c) {\\n double ux = b.x - a.x, uy = b.y - a.y;\\n double vx = c.x - a.x, vy = c.y - a.y;\\n return acos((ux*vx + uy*vy)/sqrt((ux*ux + uy*uy) * (vx*vx + vy*vy)));\\n} \\n \\n//多角形poly内（線分上も含む）に点pが存在するかどうは判定する \\nbool inPolygon(Polygon poly,Point p){\\n if((int)poly.size() == 0)return false;\\n rep(i,poly.size()) if(onSegment(poly[i],poly[(i+1)%poly.size()],p))return true;\\n double sum = 0;\\n for(int i=0; i < (int)poly.size() ;i++) {\\n if( equals(cross(poly[i]-p,poly[(i+1)%poly.size()]-p),0.0) ) continue; // ３点が平行だとangleがnanを返しsumがnanになり死ぬ\\n if( cross3p(p,poly[i],poly[(i+1)%poly.size()]) < 0 ) sum -= angle(p,poly[i],poly[(i+1)%poly.size()]);\\n else sum += angle(p,poly[i],poly[(i+1)%poly.size()]);\\n }\\n // あまり誤差を厳しくしすぎると良くないので以下のほうが良い \\n const double eps = 1e-5;\\n return (fabs(sum - 2*M_PI) < eps || fabs(sum + 2*M_PI) < eps);\\n} \\n\\nbool inPolygon(const Polygon &poly,Segment seg){\\n vector<Point> vp;\\n vp.push_back(seg.p1);\\n vp.push_back(seg.p2);\\n rep(i,(int)poly.size()) {\\n Segment edge = Segment(poly[i],poly[(i+1)%(int)poly.size()]);\\n if( equals(cross(seg.p1-seg.p2,edge.p1-edge.p2),0.0) ) {\\n if( onSegment(seg.p1,seg.p2,edge.p1) ) vp.push_back(edge.p1);\\n if( onSegment(seg.p1,seg.p2,edge.p2) ) vp.push_back(edge.p2);\\n } else {\\n if( intersectSS(seg,edge) ) vp.push_back(crosspoint(seg,edge));\\n }\\n }\\n sort(vp.begin(),vp.end());\\n vp.erase(unique(vp.begin(),vp.end()),vp.end());\\n rep(i,(int)vp.size()-1) {\\n Point middle_point = ( vp[i] + vp[i+1] ) / 2.0;\\n if( !inPolygon(poly,middle_point) ) return false;\\n }\\n return true; \\n}\\n\\nint V;\\nPolygon poly;\\nPoint light;\\n\\n// type 0 => =w=, type 1 => mirror\\nvoid inner_add_new_points(Polygon &pol,vector<Point> &vp,int type,Line ref){\\n rep(i,V){\\n // ライトから普通のポリゴンの角をみる\\n Vector e = ( poly[i] - light ) / abs( poly[i] - light );\\n Segment seg = Segment(light,light+e*10000);\\n rep(j,V) {\\n Segment poly_seg = Segment(pol[j],pol[(j+1)%V]);\\n if( equals(cross(seg.p2-seg.p1,poly_seg.p2-poly_seg.p1),0.0) ) continue;\\n if( intersectSS(poly_seg,seg) ) {\\n if( !type ) vp.push_back(crosspoint(poly_seg,seg));\\n else vp.push_back(reflection(ref,crosspoint(poly_seg,seg)));\\n }\\n }\\n\\n // ライトから反転したポリゴンの角をみる\\n e = ( pol[i] - light ) / abs( pol[i] - light );\\n seg = Segment(light,light+e*10000);\\n rep(j,V) {\\n Segment poly_seg = Segment(pol[j],pol[(j+1)%V]);\\n if( equals(cross(seg.p2-seg.p1,poly_seg.p2-poly_seg.p1),0.0) ) continue;\\n if( intersectSS(poly_seg,seg) ) {\\n if( !type ) vp.push_back(crosspoint(poly_seg,seg));\\n else vp.push_back(reflection(ref,crosspoint(poly_seg,seg)));\\n }\\n }\\n }\\n}\\n\\nbool LT(double a,double b) { return !equals(a,b) && a < b; } \\nbool LTE(double a,double b) { return equals(a,b) || a < b; } \\n\\nPoint vir;\\nbool comp_dist(const Point& p1,const Point& p2){ return LT(abs(vir-p1),abs(vir-p2)); }\\n\\nvoid add_new_points(Polygon &new_poly){\\n vector<Point> vp;\\n inner_add_new_points(poly,vp,0,Line());\\n rep(i,V){\\n Line ref = Line(poly[i],poly[(i+1)%V]);\\n Polygon rpoly(V);\\n rep(j,V) {\\n rpoly[j] = reflection(ref,poly[j]);\\n if( equals(rpoly[j].x,0.0) ) rpoly[j].x = 0;\\n if( equals(rpoly[j].y,0.0) ) rpoly[j].y = 0;\\n }\\n inner_add_new_points(rpoly,vp,1,ref);\\n }\\n\\n rep(i,(int)vp.size()) {\\n if( equals(vp[i].x,0.0) ) vp[i].x = 0;\\n if( equals(vp[i].y,0.0) ) vp[i].y = 0;\\n }\\n\\n vector<Point> tmp;\\n rep(i,vp.size()) {\\n bool failed = false;\\n rep(j,V) if( vp[i] == poly[j] ) { failed = true; break; }\\n if( !failed ) tmp.push_back(vp[i]);\\n }\\n vp = tmp;\\n\\n sort(vp.begin(),vp.end());\\n vp.erase(unique(vp.begin(),vp.end()),vp.end());\\n\\n rep(i,V){\\n vector<Point> buf;\\n Segment seg = Segment(poly[i],poly[(i+1)%V]);\\n rep(j,(int)vp.size()) if( onSegment(seg.p1,seg.p2,vp[j]) ) buf.push_back(vp[j]);\\n vir = seg.p1;\\n sort(buf.begin(),buf.end(),comp_dist);\\n rep(j,(int)buf.size()) new_poly.push_back(buf[j]);\\n new_poly.push_back(seg.p2);\\n } \\n}\\n\\nvoid compute_saw(Polygon &npoly,bool *saw){\\n \\n int nV = npoly.size(); \\n // 直接見れる\\n rep(i,nV) {\\n Point mp = ( npoly[i] + npoly[(i+1)%nV] ) / 2.0;\\n Segment vline = Segment(light,mp);\\n bool failed = false;\\n rep(j,V) {\\n Segment seg = Segment(poly[j],poly[(j+1)%V]);\\n if( equals(cross(seg.p1-seg.p2,vline.p1-vline.p2),0.0) ) continue;\\n if( intersectSS(seg,vline) ) {\\n if( onSegment(seg.p1,seg.p2,vline.p1) || onSegment(seg.p1,seg.p2,vline.p2) ) continue;\\n if( onSegment(vline.p1,vline.p2,seg.p1) || onSegment(vline.p1,vline.p2,seg.p2) ) continue;\\n failed = true;\\n break;\\n }\\n }\\n if( failed ) continue;\\n saw[i] = true;\\n }\\n\\n // 鏡一枚で見れる\\n // 直接見える鏡だけを列挙\\n vector<Line> ref;\\n rep(i,nV) {\\n Point mp = ( npoly[i] + npoly[(i+1)%nV] ) / 2.0;\\n Segment vline = Segment(light,mp);\\n bool failed = false;\\n rep(j,V) {\\n Segment seg = Segment(poly[j],poly[(j+1)%V]);\\n if( equals(cross(seg.p1-seg.p2,vline.p1-vline.p2),0.0) ) continue;\\n if( intersectSS(seg,vline) ) {\\n if( onSegment(seg.p1,seg.p2,vline.p1) || onSegment(seg.p1,seg.p2,vline.p2) ) continue;\\n if( onSegment(vline.p1,vline.p2,seg.p1) || onSegment(vline.p1,vline.p2,seg.p2) ) continue;\\n failed = true;\\n break;\\n }\\n }\\n if( !failed ) ref.push_back(Line(npoly[i],npoly[(i+1)%nV]));\\n }\\n \\n vector<Polygon> ref_polies;\\n rep(i,(int)ref.size()){\\n Polygon tmp_poly;\\n rep(j,(int)poly.size()) tmp_poly.push_back(reflection(ref[i],poly[j]));\\n ref_polies.push_back(tmp_poly);\\n }\\n\\n rep(i,nV) if( !saw[i] ) {\\n rep(j,(int)ref.size()){\\n Segment rev_edge = Segment(reflection(ref[j],npoly[i]),reflection(ref[j],npoly[(i+1)%nV]));\\n Point rev_mp = ( rev_edge.p1 + rev_edge.p2 ) / 2.0;\\n Segment rev_vline = Segment(light,rev_mp);\\n if( equals(cross(rev_vline.p1-rev_vline.p2,ref[j].p1-ref[j].p2),0.0) ) continue;\\n if( !intersectSS(rev_vline,ref[j]) ) continue;\\n rev_vline.p1 = crosspoint(rev_vline,ref[j]);\\n if( inPolygon(ref_polies[j],rev_vline) ) {\\n saw[i] = true;\\n break;\\n }\\n }\\n }\\n}\\n\\nvoid compute(){\\n Polygon npoly;\\n add_new_points(npoly);\\n int nV = npoly.size();\\n bool saw[nV];\\n rep(i,nV) saw[i] = false;\\n compute_saw(npoly,saw);\\n double sum = 0;\\n rep(i,nV) if( !saw[i] )sum += abs(npoly[(i+1)%nV]-npoly[i]);\\n sum = fabs(sum);\\n printf(\\\"%.10lf\\\\n\\\",sum);\\n}\\n\\nint main(){\\n while( cin >> V, V ){\\n poly.resize(V);\\n rep(i,V) cin >> poly[i].x >> poly[i].y;\\n cin >> light.x >> light.y;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1540,\n \"score_of_the_acc\": -1.1181,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2029_1046302\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-6)\\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)\\n\\nusing namespace std;\\n\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = 0,double y = 0): x(x),y(y){}\\n\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n bool operator < (const Segment& s)const { return (p1==s.p1) ? p2 < s.p2 : p1 < s.p1; } \\n bool operator == (const Segment& p)const { return ( p.p1 == p1 && p.p2 == p2 ) || ( p.p1 == p2 && p.p2 == p1 ); }\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\ntypedef vector<Point> Polygon;\\n\\nostream& operator << (ostream& os,const Point& a){ os << \\\"(\\\" << a.x << \\\",\\\" << a.y << \\\")\\\"; }\\n\\nostream& operator << (ostream& os,const Segment& a){ os << \\\"( \\\" << a.p1 << \\\" , \\\" << a.p2 << \\\" )\\\"; }\\n\\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\\n\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\n\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\n\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\n//rad は角度をラジアンで持たせること\\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n\\n// 度をラジアンに変換\\ndouble toRad(double agl){ return agl*M_PI/180.0; }\\n\\n// a => prev, b => cur, c=> next\\n// prev から cur へ行って next へ行く際の角度を求める\\ndouble getArg(Point a,Point b,Point c){\\n double arg1 = atan2(b.y-a.y,b.x-a.x);\\n double arg2 = atan2(c.y-b.y,c.x-b.x);\\n double arg = fabs( arg1 - arg2 );\\n while( arg > M_PI ) arg -= 2.0 * M_PI;\\n return fabs(arg);\\n}\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS)return CLOCKWISE;\\n if(dot(a,b) < -EPS)return ONLINE_BACK;\\n if(norm(a) < norm(b))return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n\\nbool intersectLL(Line l, Line m) {\\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\\n}\\nbool intersectLS(Line l, Line s) {\\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(Line l,Point p) {\\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\\n}\\nbool intersectSS(Line s, Line t) {\\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\\n}\\nbool intersectSP(Line s, Point p) {\\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\\n}\\n\\nPoint projection(Line l,Point p) {\\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\\n return l.p1 + (l.p1-l.p2)*t;\\n}\\nPoint reflection(Line l,Point p) {\\n return p + (projection(l, p) - p) * 2;\\n}\\ndouble distanceLP(Line l, Point p) {\\n return abs(p - projection(l, p));\\n}\\ndouble distanceLL(Line l, Line m) {\\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\\n}\\n\\ndouble distanceLS(Line l, Line s) {\\n if (intersectLS(l, s)) return 0;\\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\\n}\\ndouble distanceSP(Line s, Point p) {\\n Point r = projection(s, p);\\n if (intersectSP(s, r)) return abs(r - p);\\n return min(abs(s.p1 - p), abs(s.p2 - p));\\n}\\n\\ndouble distanceSS(Line s, Line t) {\\n if (intersectSS(s, t)) return 0;\\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\\n}\\n\\nPoint crosspoint(Line l,Line m){\\n double A = cross(l.p2-l.p1,m.p2-m.p1);\\n double B = cross(l.p2-l.p1,l.p2-m.p1);\\n if(abs(A) < EPS && abs(B) < EPS){\\n vector<Point> vec;\\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\\n sort(vec.begin(),vec.end());\\n assert(vec[1] == vec[2]); //同じセグメントかもよ\\n return vec[1];\\n //return m.p1;\\n }\\n if(abs(A) < EPS)assert(false);\\n return m.p1 + (m.p2-m.p1)*(B/A);\\n}\\n\\n//cross product of pq and pr\\ndouble cross3p(Point p,Point q,Point r) { return (r.x-q.x) * (p.y -q.y) - (r.y - q.y) * (p.x - q.x); }\\n \\n//returns true if point r is on the same line as the line pq\\nbool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }\\n \\n//returns true if point t is on the left side of line pq\\nbool ccwtest(Point p,Point q,Point r){\\n return cross3p(p,q,r) > 0; //can be modified to accept collinear points\\n}\\n \\nbool onSegment(Point p,Point q,Point r){\\n return collinear(p,q,r) && equals(sqrt(pow(p.x-r.x,2)+pow(p.y-r.y,2)) + sqrt(pow(r.x-q.x,2) + pow(r.y-q.y,2) ),sqrt(pow(p.x-q.x,2)+pow(p.y-q.y,2)) ) ;\\n}\\n \\n\\nbool isConvex(vector<Point> p) {\\n int sz = (int)p.size();\\n if(sz < 3)return false;//boundary case, we treat a point or a line as not convex\\n bool isLeft = ccwtest(p[0],p[1],p[2]);\\n for(int i=1; i<(int)p.size();i++)\\n if(ccwtest(p[i],p[(i+1)%sz],p[(i+2)%sz]) != isLeft) return false;\\n return true;\\n}\\n\\n\\ndouble angle(Point a,Point b,Point c) {\\n double ux = b.x - a.x, uy = b.y - a.y;\\n double vx = c.x - a.x, vy = c.y - a.y;\\n return acos((ux*vx + uy*vy)/sqrt((ux*ux + uy*uy) * (vx*vx + vy*vy)));\\n} \\n \\n//多角形poly内（線分上も含む）に点pが存在するかどうは判定する \\nbool inPolygon(Polygon poly,Point p){\\n if((int)poly.size() == 0)return false;\\n rep(i,poly.size()) if(onSegment(poly[i],poly[(i+1)%poly.size()],p))return true;\\n double sum = 0;\\n for(int i=0; i < (int)poly.size() ;i++) {\\n if( equals(cross(poly[i]-p,poly[(i+1)%poly.size()]-p),0.0) ) continue; // ３点が平行だとangleがnanを返しsumがnanになり死ぬ\\n if( cross3p(p,poly[i],poly[(i+1)%poly.size()]) < 0 ) sum -= angle(p,poly[i],poly[(i+1)%poly.size()]);\\n else sum += angle(p,poly[i],poly[(i+1)%poly.size()]);\\n }\\n // あまり誤差を厳しくしすぎると良くないので以下のほうが良い \\n const double eps = 1e-5;\\n return (fabs(sum - 2*M_PI) < eps || fabs(sum + 2*M_PI) < eps);\\n} \\n\\nbool inPolygon(const Polygon &poly,Segment seg){\\n vector<Point> vp;\\n vp.push_back(seg.p1);\\n vp.push_back(seg.p2);\\n rep(i,(int)poly.size()) {\\n Segment edge = Segment(poly[i],poly[(i+1)%(int)poly.size()]);\\n if( equals(cross(seg.p1-seg.p2,edge.p1-edge.p2),0.0) ) {\\n if( onSegment(seg.p1,seg.p2,edge.p1) ) vp.push_back(edge.p1);\\n if( onSegment(seg.p1,seg.p2,edge.p2) ) vp.push_back(edge.p2);\\n } else {\\n if( intersectSS(seg,edge) ) vp.push_back(crosspoint(seg,edge));\\n }\\n }\\n sort(vp.begin(),vp.end());\\n vp.erase(unique(vp.begin(),vp.end()),vp.end());\\n rep(i,(int)vp.size()-1) {\\n Point middle_point = ( vp[i] + vp[i+1] ) / 2.0;\\n if( !inPolygon(poly,middle_point) ) return false;\\n }\\n return true; \\n}\\n\\nint V;\\nPolygon poly;\\nPoint light;\\n\\n// type 0 => =w=, type 1 => mirror\\nvoid inner_add_new_points(Polygon &pol,vector<Point> &vp,int type,Line ref){\\n rep(i,V){\\n Vector e = ( poly[i] - light ) / abs( poly[i] - light );\\n Segment seg = Segment(light,light+e*10000);\\n rep(j,V) {\\n Segment poly_seg = Segment(pol[j],pol[(j+1)%V]);\\n if( equals(cross(seg.p2-seg.p1,poly_seg.p2-poly_seg.p1),0.0) ) continue;\\n if( intersectSS(poly_seg,seg) ) {\\n if( !type ) vp.push_back(crosspoint(poly_seg,seg));\\n else vp.push_back(reflection(ref,crosspoint(poly_seg,seg)));\\n }\\n }\\n\\n e = ( pol[i] - light ) / abs( pol[i] - light );\\n seg = Segment(light,light+e*10000);\\n rep(j,V) {\\n Segment poly_seg = Segment(pol[j],pol[(j+1)%V]);\\n if( equals(cross(seg.p2-seg.p1,poly_seg.p2-poly_seg.p1),0.0) ) continue;\\n if( intersectSS(poly_seg,seg) ) {\\n if( !type ) vp.push_back(crosspoint(poly_seg,seg));\\n else vp.push_back(reflection(ref,crosspoint(poly_seg,seg)));\\n }\\n }\\n\\n }\\n}\\n\\nbool LT(double a,double b) { return !equals(a,b) && a < b; } \\nbool LTE(double a,double b) { return equals(a,b) || a < b; } \\n\\nPoint vir;\\nbool comp_dist(const Point& p1,const Point& p2){ return LT(abs(vir-p1),abs(vir-p2)); }\\n\\nvoid add_new_points(Polygon &new_poly){\\n vector<Point> vp;\\n\\n inner_add_new_points(poly,vp,0,Line());\\n rep(i,V){\\n Line ref = Line(poly[i],poly[(i+1)%V]);\\n Polygon rpoly(V);\\n rep(j,V) {\\n rpoly[j] = reflection(ref,poly[j]);\\n if( equals(rpoly[j].x,0.0) ) rpoly[j].x = 0;\\n if( equals(rpoly[j].y,0.0) ) rpoly[j].y = 0;\\n }\\n inner_add_new_points(rpoly,vp,1,ref);\\n }\\n\\n\\n /*\\n // 直接見える点の列挙\\n rep(i,V){\\n Vector e = ( poly[i] - light ) / abs( poly[i] - light );\\n Segment vline = Segment(light,light+e*10000);\\n rep(j,V){\\n Segment seg = Segment(poly[j],poly[(j+1)%V]);\\n if( equals(cross(vline.p1-vline.p2,seg.p1-seg.p2),0.0) ) continue;\\n if( intersectSS(vline,seg) ) {\\n if( onSegment(vline.p1,vline.p2,seg.p1) || onSegment(vline.p1,vline.p2,seg.p2) ) continue;\\n if( onSegment(seg.p1,seg.p2,vline.p1) || onSegment(seg.p1,seg.p2,vline.p2) ) continue;\\n vp.push_back(crosspoint(vline,seg));\\n }\\n }\\n }\\n\\n // 鏡に反射して見える点の列挙\\n\\n rep(i,V){\\n Line ref = Line(poly[i],poly[(i+1)%V]);\\n Polygon rev_poly;\\n rep(j,V) rev_poly.push_back(reflection(ref,poly[j])); \\n \\n\\n }\\n */\\n\\n\\n //------------------------------\\n\\n rep(i,(int)vp.size()) {\\n if( equals(vp[i].x,0.0) ) vp[i].x = 0;\\n if( equals(vp[i].y,0.0) ) vp[i].y = 0;\\n }\\n\\n vector<Point> tmp;\\n rep(i,vp.size()) {\\n bool failed = false;\\n rep(j,V) if( vp[i] == poly[j] ) { failed = true; break; }\\n if( !failed ) tmp.push_back(vp[i]);\\n }\\n vp = tmp;\\n\\n sort(vp.begin(),vp.end());\\n vp.erase(unique(vp.begin(),vp.end()),vp.end());\\n\\n rep(i,V){\\n vector<Point> buf;\\n Segment seg = Segment(poly[i],poly[(i+1)%V]);\\n rep(j,(int)vp.size()) if( onSegment(seg.p1,seg.p2,vp[j]) ) buf.push_back(vp[j]);\\n vir = seg.p1;\\n sort(buf.begin(),buf.end(),comp_dist);\\n rep(j,(int)buf.size()) new_poly.push_back(buf[j]);\\n new_poly.push_back(seg.p2);\\n } \\n\\n}\\n\\nvoid compute_saw(Polygon &npoly,bool *saw){\\n \\n int nV = npoly.size(); \\n // 直接見れる\\n\\n rep(i,nV) {\\n Point mp = ( npoly[i] + npoly[(i+1)%nV] ) / 2.0;\\n Segment vline = Segment(light,mp);\\n bool failed = false;\\n rep(j,V) {\\n Segment seg = Segment(poly[j],poly[(j+1)%V]);\\n if( equals(cross(seg.p1-seg.p2,vline.p1-vline.p2),0.0) ) continue;\\n if( intersectSS(seg,vline) ) {\\n if( onSegment(seg.p1,seg.p2,vline.p1) || onSegment(seg.p1,seg.p2,vline.p2) ) continue;\\n if( onSegment(vline.p1,vline.p2,seg.p1) || onSegment(vline.p1,vline.p2,seg.p2) ) continue;\\n failed = true;\\n break;\\n }\\n }\\n if( failed ) continue;\\n saw[i] = true;\\n }\\n /*\\n cout << \\\"direct see\\\" << endl;\\n rep(i,nV) if( saw[i] )cout << npoly[i] << \\\",\\\" << npoly[(i+1)%nV]<< endl;\\n cout << endl;\\n */\\n // 鏡一枚で見れる\\n\\n // 直接見える鏡だけを列挙\\n vector<Line> ref;\\n rep(i,nV) {\\n Point mp = ( npoly[i] + npoly[(i+1)%nV] ) / 2.0;\\n Segment vline = Segment(light,mp);\\n bool failed = false;\\n rep(j,V) {\\n Segment seg = Segment(poly[j],poly[(j+1)%V]);\\n if( equals(cross(seg.p1-seg.p2,vline.p1-vline.p2),0.0) ) continue;\\n if( intersectSS(seg,vline) ) {\\n if( onSegment(seg.p1,seg.p2,vline.p1) || onSegment(seg.p1,seg.p2,vline.p2) ) continue;\\n if( onSegment(vline.p1,vline.p2,seg.p1) || onSegment(vline.p1,vline.p2,seg.p2) ) continue;\\n failed = true;\\n break;\\n }\\n }\\n if( !failed ) ref.push_back(Line(npoly[i],npoly[(i+1)%nV]));\\n }\\n \\n vector<Polygon> ref_polies;\\n rep(i,(int)ref.size()){\\n Polygon tmp_poly;\\n rep(j,(int)poly.size()) tmp_poly.push_back(reflection(ref[i],poly[j]));\\n ref_polies.push_back(tmp_poly);\\n }\\n /*\\n rep(i,(int)ref.size()) {\\n cout << \\\"ref[\\\" << i << \\\"] = \\\" << ref[i] << endl;\\n rep(j,(int)ref_polies[i].size()){\\n cout << \\\" \\\" << ref_polies[i][j];\\n } cout << endl;\\n }\\n */\\n\\n rep(i,nV) if( !saw[i] ) {\\n rep(j,(int)ref.size()){\\n Segment rev_edge = Segment(reflection(ref[j],npoly[i]),reflection(ref[j],npoly[(i+1)%nV]));\\n Point rev_mp = ( rev_edge.p1 + rev_edge.p2 ) / 2.0;\\n Segment rev_vline = Segment(light,rev_mp);\\n if( equals(cross(rev_vline.p1-rev_vline.p2,ref[j].p1-ref[j].p2),0.0) ) continue;\\n if( !intersectSS(rev_vline,ref[j]) ) continue;\\n\\n rev_vline.p1 = crosspoint(rev_vline,ref[j]);\\n \\n if( inPolygon(ref_polies[j],rev_vline) ) {\\n saw[i] = true;\\n break;\\n }\\n\\n }\\n }\\n \\n}\\n\\nvoid compute(){\\n Polygon npoly;\\n add_new_points(npoly);\\n int nV = npoly.size();\\n rep(i,nV) {\\n if( equals(npoly[i].x,0.0) ) npoly[i].x = 0;\\n if( equals(npoly[i].y,0.0) ) npoly[i].y = 0;\\n }\\n bool saw[nV];\\n rep(i,nV) saw[i] = false;\\n compute_saw(npoly,saw);\\n rep(i,nV) {\\n if( equals(npoly[i].x,0.0) ) npoly[i].x = 0;\\n if( equals(npoly[i].y,0.0) ) npoly[i].y = 0;\\n }\\n /*\\n cout << \\\"nV = \\\" << nV << endl;\\n rep(i,nV) cout << i << \\\"-th \\\" << npoly[i] << endl;\\n cout << endl;\\n\\n rep(i,nV) {\\n if( !saw[i] ) cout << \\\"cannot see \\\" << npoly[i] << \\\",\\\" << npoly[(i+1)%nV] << \\\" : \\\" << abs(npoly[i]-npoly[(i+1)%nV]) << endl;\\n }\\n */\\n\\n double sum = 0;\\n rep(i,nV) if( !saw[i] )sum += abs(npoly[(i+1)%nV]-npoly[i]);\\n sum = fabs(sum);\\n printf(\\\"%.10lf\\\\n\\\",sum);\\n}\\n\\nint main(){\\n while( cin >> V, V ){\\n poly.resize(V);\\n rep(i,V) cin >> poly[i].x >> poly[i].y;\\n cin >> light.x >> light.y;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1548,\n \"score_of_the_acc\": -1.122,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2029_665770\",\n \"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 <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()\\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)\\nconst int INF = 1<<29;\\nconst double EPS = 1e-8;\\nconst double PI = acos(-1);\\ntypedef pair<int,int> pii;\\ntypedef long long ll;\\n\\ntypedef complex<double> P;\\nnamespace std {\\n bool operator < (const P& a, const P& b) {\\n // if (abs(a-b)<EPS) return 0;\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n }\\n}\\ndouble cross(const P& a, const P& b) {\\n return imag(conj(a)*b);\\n}\\ndouble dot(const P& a, const P& b) {\\n return real(conj(a)*b);\\n}\\nstruct L : public vector<P> {\\n L(const P &a, const P &b) {\\n push_back(a); push_back(b);\\n }\\n L() {}\\n};\\nostream &operator<<(ostream &os, const L &a) {\\n os << a[0] << \\\" -> \\\" << a[1];\\n return os;\\n}\\n\\ntypedef vector<P> G;\\n#define curr(P, i) P[i]\\n#define next(P, i) P[(i+1)%P.size()]\\nstruct C {\\n P p; double r;\\n C(const P &p, double r) : p(p), r(r) { }\\n};\\n\\nint ccw(P a, P b, P c) {\\n b -= a; c -= a;\\n if (cross(b, c) > 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\\n return 0;\\n}\\n\\nP rotate(const P &p, double ang) {\\n return p * P(cos(ang), sin(ang));\\n}\\n\\nP projection(const L &l, const P &p) {\\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\\n return l[0] + t*(l[0]-l[1]);\\n}\\nP reflection(const L &l, const P &p) {\\n return p + P(2,0) * (projection(l, p) - p);\\n}\\n\\ndouble distanceLP(const L &l, const P &p) {\\n return abs(p - projection(l, p));\\n}\\n\\nbool intersectSP(const L &s, const P &p) {\\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\\n}\\nbool intersectLL(const L &l, const L &m) {\\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel\\n abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line\\n}\\nbool intersectLS(const L &l, const L &s) {\\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(const L &l, const P &p) {\\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\\n}\\nbool intersectSS(const L &s, const L &t) {\\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\\n}\\nbool intersectSS2(const L &s, const L &t) {\\n if (intersectSP(s,t[0]) || intersectSP(s,t[1]) ||\\n intersectSP(t,s[0]) || intersectSP(t,s[1])) return 0;\\n return intersectSS(s,t);\\n}\\nbool intersectHS(const L &h, const L &s) {\\n if (intersectLP(h,s[0]) || intersectLP(h,s[1]) ||\\n intersectLP(s,h[0]) || intersectLP(s,h[1])) return 0;\\n if (intersectSS(h,s)) return 1;\\n if (!intersectLS(h,s)) return 0;\\n return (ccw(s[0],s[1],h[0]) == 1) ^ (cross(s[1]-s[0], h[1]-h[0]) > 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]; // same line\\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n return m[0] + B / A * (m[1] - m[0]);\\n}\\n\\nint n;\\nL pl[20];\\nvector<P> v[20];\\n\\n\\nint mostNearest(const L &h) {\\n double mi = INF;\\n int res = -1;\\n REP(k,n) {\\n if (intersectHS(h,pl[k])) {\\n if (chmin(mi,norm(crosspoint(h,pl[k])-h[0]))) {\\n res = k;\\n }\\n }\\n }\\n return res;\\n}\\n\\n\\nvoid func(const L &h) {\\n int cl_id = mostNearest(h);\\n if (cl_id != -1) {\\n v[cl_id].push_back(crosspoint(h,pl[cl_id]));\\n }\\n}\\n\\nP c;\\n\\nbool isVisible(const P &p, const P &q) { // direct visible\\n REP(i,n) if (intersectSS2(L(p,q),pl[i])) return 0;\\n return 1;\\n}\\n\\nbool isVisibleUsingReflection(const P &p) { // visible from c\\n // direct\\n if (isVisible(c,p)) return 1;\\n L l(c,p); \\n // reflect\\n REP(j,n) { \\n if (ccw(pl[j][0], pl[j][1], c) * ccw(pl[j][0], pl[j][1], p) != 1) continue;\\n double d1 = distanceLP(pl[j],c);\\n double d2 = distanceLP(pl[j],p);\\n P refp = P(d2/(d1+d2),0) * projection(pl[j],c) + P(d1/(d1+d2),0) * projection(pl[j],p);\\n if (!intersectSP(pl[j], refp)) continue;\\n if (isVisible(c,refp) && isVisible(refp,p)) return 1;\\n }\\n return 0;\\n}\\n\\nL reflect(const L &h, const L &l) {\\n P refp = crosspoint(h,l);\\n P v = refp - reflection(l,h[0]);\\n return L(refp,refp+v);\\n}\\n\\nint main() {\\n while(cin >> n, n) {\\n P p[20];\\n REP(i,n) {\\n cin >> p[i].real() >> p[i].imag();\\n }\\n REP(i,n) {\\n pl[i] = L(p[i],p[(i+1)%n]); \\n }\\n cin >> c.real() >> c.imag();\\n REP(i,n) v[i].clear();\\n \\n REP(i,n) {\\n bool ok = 1;\\n if (isVisible(c,p[i])) {\\n L h = L(c,p[i]); \\n // c -> p[i]\\n func(h); \\n // c -> p[i] -> reflection\\n int ref_id = mostNearest(h);\\n if (ref_id != -1) {\\n // reflect at pl[ref_id]\\n func(reflect(h, pl[ref_id]));\\n }\\n }\\n // c -> pl[j] -> p[i]\\n REP(j,n) { \\n if (ccw(pl[j][0], pl[j][1], c) * ccw(pl[j][0], pl[j][1], p[i]) != 1) continue; // different side\\n double d1 = distanceLP(pl[j],c);\\n double d2 = distanceLP(pl[j],p[i]);\\n P refp = P(d2/(d1+d2),0) * projection(pl[j],c) + P(d1/(d1+d2),0) * projection(pl[j],p[i]);\\n if (!intersectSP(pl[j], refp)) continue;\\n if (isVisible(c,refp)) func(L(refp,p[i]));\\n }\\n // reflect at corners of pl[i]\\n {\\n P refp = pl[i][0];\\n if (isVisible(c,refp)) {\\n func(reflect(L(c,refp),pl[i]));\\n }\\n }\\n {\\n P refp = pl[i][1];\\n if (isVisible(c,refp)) {\\n func(reflect(L(c,refp),pl[i]));\\n }\\n }\\n }\\n double ans = 0;\\n REP(i,n) {\\n // cout << i << endl;\\n // FOR(it, v[i]) {\\n // cout << *it << endl;\\n // }\\n double len = abs(pl[i][1]-pl[i][0]);\\n vector<double> vv;\\n vv.push_back(0);\\n vv.push_back(len);\\n FOR(it, v[i]) {\\n vv.push_back(abs(*it - pl[i][0]));\\n }\\n sort(ALL(vv));\\n REP(j,vv.size()-1) {\\n double s = (vv[j]+vv[j+1])/2 / len;\\n P q = (1-s)*pl[i][0] + s*pl[i][1];\\n if (!isVisibleUsingReflection(q)) {\\n ans += vv[j+1]-vv[j];\\n\\n double ss = vv[j]/len, tt = vv[j+1]/len;\\n P p1 = (1-ss)*pl[i][0] + ss*pl[i][1];\\n P p2 = (1-tt)*pl[i][0] + tt*pl[i][1];\\n // cout << p1.real() << \\\" \\\" << p1.imag() << endl;\\n // cout << p2.real() << \\\" \\\" << p2.imag() << endl;\\n // cout << endl;\\n }\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\", ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1300,\n \"score_of_the_acc\": -0.5,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2029_665751\",\n \"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 <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()\\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)\\nconst int INF = 1<<29;\\nconst double EPS = 1e-8;\\nconst double PI = acos(-1);\\ntypedef pair<int,int> pii;\\ntypedef long long ll;\\n\\ntypedef complex<double> P;\\nnamespace std {\\n bool operator < (const P& a, const P& b) {\\n // if (abs(a-b)<EPS) return 0;\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n }\\n}\\ndouble cross(const P& a, const P& b) {\\n return imag(conj(a)*b);\\n}\\ndouble dot(const P& a, const P& b) {\\n return real(conj(a)*b);\\n}\\nstruct L : public vector<P> {\\n L(const P &a, const P &b) {\\n push_back(a); push_back(b);\\n }\\n L() {}\\n};\\nostream &operator<<(ostream &os, const L &a) {\\n os << a[0] << \\\" -> \\\" << a[1];\\n return os;\\n}\\n\\ntypedef vector<P> G;\\n#define curr(P, i) P[i]\\n#define next(P, i) P[(i+1)%P.size()]\\nstruct C {\\n P p; double r;\\n C(const P &p, double r) : p(p), r(r) { }\\n};\\n\\nint ccw(P a, P b, P c) {\\n b -= a; c -= a;\\n if (cross(b, c) > 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\\n return 0;\\n}\\n\\nP rotate(const P &p, double ang) {\\n return p * P(cos(ang), sin(ang));\\n}\\n\\nP projection(const L &l, const P &p) {\\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\\n return l[0] + t*(l[0]-l[1]);\\n}\\nP reflection(const L &l, const P &p) {\\n return p + P(2,0) * (projection(l, p) - p);\\n}\\n\\ndouble distanceLP(const L &l, const P &p) {\\n return abs(p - projection(l, p));\\n}\\n\\nbool intersectSP(const L &s, const P &p) {\\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\\n}\\nbool intersectLL(const L &l, const L &m) {\\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel\\n abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line\\n}\\nbool intersectLS(const L &l, const L &s) {\\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(const L &l, const P &p) {\\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\\n}\\nbool intersectSS(const L &s, const L &t) {\\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\\n}\\nbool intersectSS2(const L &s, const L &t) {\\n if (intersectSP(s,t[0]) || intersectSP(s,t[1]) ||\\n intersectSP(t,s[0]) || intersectSP(t,s[1])) return 0;\\n return intersectSS(s,t);\\n}\\nbool intersectHS(const L &h, const L &s) {\\n if (intersectLP(h,s[0]) || intersectLP(h,s[1]) ||\\n intersectLP(s,h[0]) || intersectLP(s,h[1])) return 0;\\n if (intersectSS(h,s)) return 1;\\n if (!intersectLS(h,s)) return 0;\\n return (ccw(s[0],s[1],h[0]) == 1) ^ (cross(s[1]-s[0], h[1]-h[0]) > 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]; // same line\\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n return m[0] + B / A * (m[1] - m[0]);\\n}\\n\\nint n;\\nL pl[20];\\nvector<P> v[20];\\n\\nvoid func(const L &h) {\\n double mi = INF;\\n int cl_id = -1;\\n REP(k,n) {\\n if (intersectHS(h,pl[k])) {\\n if (chmin(mi,norm(crosspoint(h,pl[k])-h[0]))) {\\n cl_id = k;\\n }\\n }\\n }\\n if (cl_id != -1) {\\n v[cl_id].push_back(crosspoint(h,pl[cl_id]));\\n }\\n}\\n\\nP c;\\n\\nbool isVisible(const P &p) {\\n // direct\\n L l(c,p);\\n bool ok = 1;\\n REP(i,n) {\\n ok &= !intersectSS2(l,pl[i]);\\n }\\n if (ok) return 1;\\n // reflect\\n REP(j,n) { \\n if (ccw(pl[j][0], pl[j][1], c) * ccw(pl[j][0], pl[j][1], p) != 1) continue;\\n double d1 = distanceLP(pl[j],c);\\n double d2 = distanceLP(pl[j],p);\\n P refp = P(d2/(d1+d2),0) * projection(pl[j],c) + P(d1/(d1+d2),0) * projection(pl[j],p);\\n if (!intersectSP(pl[j], refp)) continue;\\n bool ok = 1;\\n L l1(c,refp);\\n L l2(refp,p);\\n REP(k,n) {\\n ok &= !intersectSS2(l1,pl[k]);\\n ok &= !intersectSS2(l2,pl[k]);\\n }\\n if (ok) return 1;\\n }\\n return 0;\\n}\\n\\nint main() {\\n while(cin >> n, n) {\\n P p[20];\\n REP(i,n) {\\n cin >> p[i].real() >> p[i].imag();\\n }\\n REP(i,n) {\\n pl[i] = L(p[i],p[(i+1)%n]); \\n }\\n cin >> c.real() >> c.imag();\\n REP(i,n) v[i].clear();\\n \\n REP(i,n) {\\n bool ok = 1;\\n L l1 = L(c,p[i]);\\n REP(k,n) ok &= !intersectSS2(l1,pl[k]);\\n if (ok) {\\n // c -> p[i]\\n func(l1); \\n // c -> p[i] -> reflection\\n int ref_id = -1;\\n double mi = INF;\\n REP(j,n) {\\n if (intersectHS(l1,pl[j])) {\\n if (chmin(mi, norm(crosspoint(l1,pl[j])-c))) {\\n ref_id = j;\\n }\\n }\\n }\\n if (ref_id != -1) {\\n // reflect at pl[ref_id]\\n P refp = crosspoint(l1,pl[ref_id]);\\n P v = refp - reflection(pl[ref_id],c);\\n func(L(refp, refp+v));\\n }\\n }\\n // c -> pl[j] -> p[i]\\n REP(j,n) { \\n if (ccw(pl[j][0], pl[j][1], c) * ccw(pl[j][0], pl[j][1], p[i]) != 1) continue;\\n double d1 = distanceLP(pl[j],c);\\n double d2 = distanceLP(pl[j],p[i]);\\n P refp = P(d2/(d1+d2),0) * projection(pl[j],c) + P(d1/(d1+d2),0) * projection(pl[j],p[i]);\\n if (!intersectSP(pl[j], refp)) continue;\\n bool ok = 1;\\n L l1(c,refp);\\n L l2(refp,p[i]);\\n REP(k,n) {\\n ok &= !intersectSS2(l1,pl[k]);\\n }\\n if (!ok) continue;\\n\\n func(l2);\\n }\\n // reflect at corners of pl[i]\\n {\\n P refp = pl[i][0];\\n L l1(c,refp);\\n bool ok = 1; \\n REP(k,n) ok &= !intersectSS2(l1,pl[k]);\\n if (ok) {\\n L l2 = L(refp, refp + refp-reflection(pl[i], c)); \\n func(l2);\\n }\\n }\\n {\\n P refp = pl[i][1];\\n L l1(c,refp);\\n bool ok = 1; \\n REP(k,n) ok &= !intersectSS2(l1,pl[k]);\\n if (ok) {\\n L l2 = L(refp, refp + refp-reflection(pl[i], c));\\n func(l2);\\n } \\n }\\n }\\n double ans = 0;\\n REP(i,n) {\\n // cout << i << endl;\\n // FOR(it, v[i]) {\\n // cout << *it << endl;\\n // }\\n double len = abs(pl[i][1]-pl[i][0]);\\n vector<double> vv;\\n vv.push_back(0);\\n vv.push_back(len);\\n FOR(it, v[i]) {\\n vv.push_back(abs(*it - pl[i][0]));\\n }\\n sort(ALL(vv));\\n REP(j,vv.size()-1) {\\n double s = (vv[j]+vv[j+1])/2 / len;\\n P q = (1-s)*pl[i][0] + s*pl[i][1];\\n if (!isVisible(q)) {\\n ans += vv[j+1]-vv[j];\\n\\n double ss = vv[j]/len, tt = vv[j+1]/len;\\n P p1 = (1-ss)*pl[i][0] + ss*pl[i][1];\\n P p2 = (1-tt)*pl[i][0] + tt*pl[i][1];\\n // cout << p1.real() << \\\" \\\" << p1.imag() << endl;\\n // cout << p2.real() << \\\" \\\" << p2.imag() << endl;\\n // cout << endl;\\n }\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\", ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1300,\n \"score_of_the_acc\": -0.5,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1060,"cells":{"group_id":{"kind":"string","value":"aoj_2023_cpp"},"problem_description":{"kind":"string","value":"Princess, a Strategist\nお姫様は戦略家\nEnglish text is not available in this practice contest.\nある貧乏な国の勇敢なお姫様は，お城を抜け出して古の秘宝を手に入れる冒険に出かける算段をしている．ところが，古の秘宝の周囲は複数のガーディアンによって守られており，普通の方法では辿り着くことができない．そこで，お姫様は従者であるあなたを囮にし，ガーディアン達の注意を惹きつけている間に秘宝を取って来るという作戦を考えた．そのような事をされては命がいくつあっても足りない，しかしお姫様の命令に従わないわけにもいかない．そこで，まずあなたはあらかじめ偵察をし，どのように動けばガーディアンの攻撃をかわしつつ，注意を引きつけられるのかを念入りに調査した．あなたの仕事は，これらの調査結果をもとに囮であるあなたとガーディアンの発射する弾丸の衝突がいつ，そして何回起こったのか計算するプログラムを書くことである．\nまず，簡単のため，フィールドとして十分に高い場所から見下ろした二次元平面を考える．そして，あなたはガーディアンの攻撃から身を守るために鎧を装備している．そのため，あなたの形は多角形でであるものと考えて良い．なお，この多角形の各線分は一切交差したり重なったりしない．また，あなたの移動については以下のことを仮定して良い．\n等速直線運動しかしない．\n加速，減速，方向転換は全て一瞬で行われる．\n回転しないため向きは初期状態から一切変わらない．\n多角形の全ての部分は常に\ny\n座標が正の位置にある．\nまた，ガーディアンの発射する弾丸については，以下のことを仮定して良い．\nガーディアンが発射する弾丸の太さは無視できる\nガーディアンが発射する弾丸は有限の長さをもつ\n長さ\nl\nの弾丸が先頭座標 (\nx\n, 0) から速度ベクトル (\nv\nx\n,\nv\ny\n) をもって発射されたとすると，弾丸の末尾座標は以下の地点にある（注：弾丸が発射される瞬間の弾丸の先頭の\ny\n座標はすべて0である）：\nたとえば，(4, 0) の地点から速度ベクトル (3, 4) の長さ 10 の弾丸が発射されるケースでは弾丸の末尾は(-2, -8) にある\n敵キャラクターが発射する弾丸同士の衝突は全て無視される\nあなたとガーディアンの発射した弾丸の衝突の定義を以下に述べる．あなたを構成する多角形とガーディアンの発射する線分の共有点が初めて発生した時刻を弾丸の衝突時刻とする．ガーディアンの発射した弾丸にあなたが衝突したとしても，あなたはダメージを受けるだけで移動には何の支障もきたさないものとし，あなたに衝突した弾丸は衝突した瞬間に消滅するものとする．なお，あなたが初期位置から任意の方向に 10\n-6\nの範囲で平行移動したとしても，衝突時間は高々 10\n-5\nしか変化しないことが保証されている．\nInput\n入力は，複数のデータセットからなる．\nそれぞれのデータセットは，次のような形式で与えられる．\nN\nM\nB\nX\n1\nY\n1\n...\nX\nN\nY\nN\nT\n1\nVX\n1\nVY\n1\n...\nT\nM\nVX\nM\nVY\nM\nT'\n1\nX'\n1\nVX'\n1\nVY'\n1\nL\n1\n...\nT'\nB\nX'\nB\nVX'\nB\nVY'\nB\nL\nB\n各データセットの先頭には3つの非負整数\nN\n(3 ≦\nN\n≦ 20)，\nM\n(0 ≦\nM\n≦ 100)，\nB\n(0 ≦\nB\n≦ 100)\n が与えられる．\n これらはそれぞれ，あなたである多角形の頂点の数，あなたの移動に関する情報の数，およびガーディアンの発射した弾丸の数を表す．\n続く\nN\n行では，あなたを表す多角形の頂点の時刻0での座標が順に列挙される．\n (\nX\ni\n,\nY\ni\n)\n (1 ≦\ni\n≦\nN\n)\n はそれぞれ，多角形の\ni\n番目の頂点の座標を表す．\n これらの値はすべて整数であり，\n -10,000 ≦\nX\ni\n≦ 10,000，\n 0 ＜\nY\ni\n≦ 10,000\n を満たす．\n続く\nM\n行では，\n あなたの移動を表す指示が\nM\n個与えられる．\ni\n番目 (1 ≦\ni\n≦\nM\n) の移動指示は\n 3つの整数\nT\ni\n,\nVX\ni\n,\nVY\ni\nから成り立っており，\n これは 時刻\nT\ni\n-1\nから\nT\ni\nまでの間，あなたの速度ベクトルを\n (\nVX\ni\n,\nVY\ni\n)\n に維持するということを意味する．\n ただし，\n 0 =\nT\n0\n＜\nT\n1\n＜\nT\n2\n＜ ... ＜\nT\nM\n≦ 10,000，\n -100 ≦\nVX\ni\n≦ 100，\n -100 ≦\nVY\ni\n≦ 100\n である．\n あなたがすべての移動指示を終えた後（すなわち，時刻\nT\nM\n以降）は移動を停止し，\n その場にとどまり続けるものとする．\n あなたが停止した以降にも弾丸との衝突が発生する可能性があり，\n 出力に際してはそのような衝突も考慮する必要があることに注意せよ．\n続く\nB\n行では，ガーディアンの発射する\nB\n個の弾丸に関する情報が記述されている．\ni\n番目 (1 ≦\ni\n≦\nB\n) の弾丸に関する情報は5つの整数\nT'\ni\n，\nX'\ni\n，\nVX'\ni\n，\nVY'\ni\nおよび\nL\ni\nで表され，これは，時刻\nT'\ni\nに座標 (\nX'\ni\n, 0)\n から速度ベクトル\n (\nVX'\ni\n,\nVY'\ni\n)\n をもつ長さ\nL\ni\nの弾丸が発射されることを意味する．\n これらの値は\n 0 ≦\nT'\n1\n≦\nT'\n2\n≦ ...\n ≦\nT'\nB\n≦ 10,000，\n -10,000 ≦\nX'\ni\n≦ 10,000，\n -100 ≦\nVX'\ni\n≦ 100，\n 0 ＜\nVY'\ni\n≦ 100，\n 0 ＜\nL\ni\n≦ 100\n を満たす．\n最後のデータセットの後ろに，データセットの終了を意味する\n \"0 0 0\" と書かれた1行が与えられる．\n これはデータセットの一部ではない．\nOutput\n各データセットに対する出力の先頭に，あなたがガーディアンの発射した弾丸に衝突した回数\nn\nを出力せよ．続く\nn\n行では，あなたがガーディアンの発射した弾丸に衝突した時刻を昇順に誤差高々 0.001 の精度で出力せよ．\nSample Input\n4 1 1\n1 1\n1 2\n-1 2\n-1 1\n2 1 0\n0 1 0 1 2\n0 0 0\nOutput for the Sample Input\n1\n1.000"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2023_6005917","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=1000000007,MAX=5005,INF=1<<30;\n\n#define double long double\n\n//幾何ライブラリ\n// define double ll をするときは Point の < と == も書き換えよう！\n\nconst double eps=1e-4;\nconst double pi=acos((double)-1.0L);\n#define equals(a,b) (fabs((a)-(b))<eps)\n\ndouble torad(double deg) {return (double)(deg)*pi/180.0;}\ndouble todeg(double ang) {return ang*180.0/pi;}\n\nclass Point{\npublic:\n double x,y;\n \n Point(double x=0,double y=0):x(x),y(y){}\n \n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n \n double abs(){return sqrt(norm());}\n double norm(){return x*x+y*y;}\n \n bool operator < (const Point &p)const{\n return x+eps<p.x||(equals(x,p.x)&&y+eps<p.y);\n }\n \n bool operator == (const Point &p)const{\n return fabs(x-p.x)<eps&&fabs(y-p.y)<eps;\n }\n};\n\ntypedef Point Vector;\n\ndouble norm(Vector a){\n return a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n return sqrt(norm(a));\n}\n\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\nstruct Segment{\n Point p1,p2;\n};\n\nbool isOrthogonal(Vector a,Vector b){\n return equals(dot(a,b),0.0);\n}\n\nbool isOrthogonal(Point a1,Point a2,Point b1,Point b2){\n return isOrthogonal(a1-a2,b1-b2);\n}\n\nbool isOrthogonal(Segment s1,Segment s2){\n return equals(dot(s1.p2-s1.p1,s2.p2-s2.p1),0.0);\n}\n\nbool isParallel(Vector a,Vector b){\n return equals(cross(a,b),0.0);\n}\n\nbool isParallel(Point a1,Point a2,Point b1,Point b2){\n return isParallel(a1-a2,b1-b2);\n}\n\nbool isParallel(Segment s1,Segment s2){\n return equals(cross(s1.p2-s1.p1,s2.p2-s2.p1),0.0);\n}\n\nPoint project(Segment s,Point p){\n Vector base=s.p2-s.p1;\n double r=dot(p-s.p1,base)/norm(base);\n return s.p1+base*r;\n}\n\nPoint reflect(Segment s,Point p){\n return p+(project(s,p)-p)*2.0;\n}\n\nPoint turn(Point p,Point c,double pi){\n double q=atan2(p.y-c.y,p.x-c.x);\n q+=pi;\n p=c+Point{cos(q)*abs(p-c),sin(q)*abs(p-c)};\n \n return p;\n}\n//pをcを中心としてpi回転させる(1周で2π)\n//p=cのときnan\n\n//p0,p1,p2の順に見たときどうなるか？\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 \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(a.norm()<b.norm()) return online_front;\n \n return on_segment;\n}\n\nbool intersect(Point p1,Point p2,Point p3,Point p4){\n return(ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0&&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\nbool overlap(Segment s1,Segment s2){\n int a=ccw(s1.p1,s1.p2,s2.p1),b=ccw(s1.p1,s1.p2,s2.p2);\n if(a&1||b&1) return 0;\n if(a==2){\n if(b==-2||(b==0&&!(s2.p2==s1.p1))) return 1;\n else return 0;\n }\n if(a==-2){\n if(b==2||(b==0&&!(s2.p2==s1.p2))) return 1;\n else return 0;\n }\n if(a==0){\n if(s1.p1==s2.p1){\n if(b!=2) return 1;\n else return 0;\n }\n else if(s1.p2==s2.p1){\n if(b!=-2) return 1;\n else return 0;\n }\n else return 1;\n }\n return 0;\n}\n//s1とs2の共通の線分(長さ0より大きい)があるかどうか\n\ntypedef Segment Line;\n\ndouble getDistance(Point a,Point b){\n return abs(a-b);\n}\n\ndouble getDistanceLP(Line l,Point p){\n return abs(cross(l.p2-l.p1,p-l.p1)/abs(l.p2-l.p1));\n}\n\ndouble getDistanceSP(Segment s,Point p){\n if(dot(s.p2-s.p1,p-s.p1)<0.0) return abs(p-s.p1);\n if(dot(s.p1-s.p2,p-s.p2)<0.0) return abs(p-s.p2);\n return getDistanceLP(s,p);\n}\n\ndouble getDistance(Segment s1,Segment s2){\n if(intersect(s1,s2)) return 0.0;\n return min({getDistanceSP(s1,s2.p1),getDistanceSP(s1,s2.p2),getDistanceSP(s2,s1.p1),getDistanceSP(s2,s1.p2)});\n}\n\nPoint getCrossPointS(Segment s1,Segment s2){\n //if(ccw(s1.p1,s1.p2,s2.p1)==0&&ccw(s1.p1,s1.p2,s2.p2)==0) return s1.p1;\n Vector base=s2.p2-s2.p1;\n double d1=abs(cross(base,s1.p1-s2.p1));\n double d2=abs(cross(base,s1.p2-s2.p1));\n double t=d1/(d1+d2);\n return s1.p1+(s1.p2-s1.p1)*t;\n}//同じ時壊れます\n\nPoint getCrossPointL(Line l1,Line l2){\n //if(ccw(s1.p1,s1.p2,s2.p1)==0&&ccw(s1.p1,s1.p2,s2.p2)==0) return s1.p1;\n \n Vector v1=l1.p2-l1.p1,v2=l2.p2-l2.p1;\n \n return l1.p1+v1*cross(v2,l2.p1-l1.p1)/cross(v2,v1);\n}\n\nSegment ParallelSegment(Segment s,double d){\n Vector v={-(s.p2-s.p1).y,(s.p2-s.p1).x};\n v=v/abs(v);\n \n s.p1=s.p1+v*d;\n s.p2=s.p2+v*d;\n \n return s;\n}\n\nPoint naisin(Point p1,Point p2,Point p3){\n if(p1==p2&&p2==p3&&p3==p1) return p1;\n \n return (p1*abs(p2-p3)+p2*abs(p1-p3)+p3*abs(p1-p2))/(abs(p2-p3)+abs(p1-p3)+abs(p1-p2));\n}\n\nPoint naisin(Line l1,Line l2,Line l3){\n //平行でない前提\n \n Point p1=getCrossPointL(l1,l2),p2=getCrossPointL(l1,l3),p3=getCrossPointL(l2,l3);\n return naisin(p1,p2,p3);\n}\n\n//ネットの適当を書いたのであってるか全く知りません→あってそう\n\nclass Circle{\npublic:\n Point c;\n double r;\n Circle(Point c=Point(),double r=0.0):c(c),r(r){}\n};\n\nPoint CircleCenter(Point a,Point b,Point c){\n Point u=a-b,v=a-c;\n double m1=(norm(a)-norm(b))/2.0,m2=(norm(a)-norm(c))/2.0;\n \n Point res;\n if(cross(u,v)==0.0){\n res.x=1e9;\n res.y=1e9;\n \n return res;\n }\n res.x=(m1*v.y-m2*u.y)/cross(u,v);\n res.y=(m1*v.x-m2*u.x)/cross(v,u);\n \n return res;\n}\n//3点を通る円の中心を返す\n\n//交わる 0\n// c1がc2のinside 1\n// c1がc2のoutside 2\n// 交わらない 3\n\nint not_intersect(Circle c1,Circle c2){\n double d=getDistance(c1.c,c2.c);\n double r1=c1.r,r2=c2.r;\n if(r1<r2){\n if(d<(r2-r1)) return 1;\n }\n if(r1>r2){\n if(d<(r1-r2)) return 2;\n }\n if(d<=r1+r2) return 0;\n else return 3;\n}\n\npair<Point,Point> segCrossPpoints(Circle c,Line l){\n //assert(intersect(c,l));\n Vector pr=project(l,c.c);\n Vector e=(l.p2-l.p1)/abs(l.p2-l.p1);\n double base=sqrt(c.r*c.r-norm(pr-c.c));\n return make_pair(pr+e*base,pr-e*base);\n}\n\ndouble arg(Vector p){return atan2(p.y,p.x);}\nVector polar(double a,double r){return Point(cos(r)*a,sin(r)*a);}\n\n//inside(outside)\n\npair<Point,Point> getCrossPoints(Circle c1,Circle c2){\n //assert(intersect(c1,c2));\n double d=abs(c1.c-c2.c);\n double a=acos((c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d));\n double t=arg(c2.c-c1.c);\n return make_pair(c1.c+polar(c1.r,t+a),c1.c+polar(c1.r,t-a));\n}\n\nvector<Line> Commontangent(Circle c1,Circle c2){\n vector<Line> res;\n Point p=c2.c-c1.c;\n \n if(abs(p)>=(c1.r+c2.r)){\n Point a,b;\n a.x=c1.r*(p.x*(c1.r+c2.r)+p.y*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\n a.y=c1.r*(p.y*(c1.r+c2.r)-p.x*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\n \n b.x=c1.r*(p.x*(c1.r+c2.r)-p.y*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\n b.y=c1.r*(p.y*(c1.r+c2.r)+p.x*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\n \n res.push_back(Line{a+c1.c,a+c1.c+Point{-a.y,a.x}});\n if(!(a==b)){\n res.push_back(Line{b+c1.c,b+c1.c+Point{-b.y,b.x}});\n }\n }\n \n if(abs(p)>=abs(c1.r-c2.r)){\n Point a,b;\n a.x=c1.r*(p.x*(c1.r-c2.r)+p.y*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\n a.y=c1.r*(p.y*(c1.r-c2.r)-p.x*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\n \n b.x=c1.r*(p.x*(c1.r-c2.r)-p.y*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\n b.y=c1.r*(p.y*(c1.r-c2.r)+p.x*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\n \n res.push_back(Line{a+c1.c,a+c1.c+Point{-a.y,a.x}});\n if(!(a==b)){\n res.push_back(Line{b+c1.c,b+c1.c+Point{-b.y,b.x}});\n }\n }\n \n return res;\n}\n\ntypedef vector<Point> Polygon;\n\n/*\n IN 2\n ON 1\n OUT 0\n */\n\nint contains(Polygon g,Point p){\n int n=int(g.size());\n bool x=false;\n for(int i=0;i<n;i++){\n Point a=g[i]-p,b=g[(i+1)%n]-p;\n if(a.y>b.y) swap(a,b);\n if(a.y<eps&&0<b.y&&cross(a,b)<0) x=!x;\n if(abs(cross(a,b))<eps&&dot(a,b)<eps) return 1;\n }\n return (x?2:0);\n}\n\nPolygon andrewScan(Polygon s,bool ok){\n Polygon u,l;\n sort(all(s));\n \n if(int(s.size())<3) return s;\n int n=int(s.size());\n \n u.push_back(s[0]);\n u.push_back(s[1]);\n \n l.push_back(s[n-1]);\n l.push_back(s[n-2]);\n \n if(ok){\n for(int i=2;i<n;i++){\n for(int j=int(u.size());j>=2&&ccw(u[j-2],u[j-1],s[i])==counter_clockwise;j--){\n u.pop_back();\n }\n u.push_back(s[i]);\n }\n \n for(int i=int(s.size())-3;i>=0;i--){\n for(int j=int(l.size());j>=2&&ccw(l[j-2],l[j-1],s[i])==counter_clockwise;j--){\n l.pop_back();\n }\n l.push_back(s[i]);\n }\n }\n \n if(!ok){\n for(int i=2;i<n;i++){\n for(int j=int(u.size());j>=2&&ccw(u[j-2],u[j-1],s[i])!=clockwise;j--){\n u.pop_back();\n }\n u.push_back(s[i]);\n }\n \n for(int i=int(s.size())-3;i>=0;i--){\n for(int j=int(l.size());j>=2&&ccw(l[j-2],l[j-1],s[i])!=clockwise;j--){\n l.pop_back();\n }\n l.push_back(s[i]);\n }\n }\n \n reverse(all(l));\n \n for(int i=int(u.size())-2;i>=1;i--) l.push_back(u[i]);\n \n return l;\n}//ok==1なら辺の上も含める\n\nPolygon convex_cut(const Polygon& P, const Line& l) {\n Polygon Q;\n for(int i=0;i<si(P);i++){\n Point A=P[i],B=P[(i+1)%si(P)];\n if(ccw(l.p1,l.p2,A)!=-1)Q.push_back(A);\n if(ccw(l.p1,l.p2,A)*ccw(l.p1,l.p2,B)<0) Q.push_back(getCrossPointL(Line{A,B},l));\n }\n return Q;\n}\n\ndouble area(Point a,Point b,Point c){\n b=b-a;\n c=c-a;\n return abs(b.x*c.y-b.y*c.x)/2.0;\n}\n\ndouble area(Polygon &P){\n if(si(P)==0) return 0.0;\n double res=0;\n Point c={0.0,0.0};\n for(int i=0;i<si(P);i++){\n c=c+P[i];\n }\n c=c/si(P);\n \n for(int i=0;i<si(P);i++){\n res+=area(c,P[i],P[(i+1)%si(P)]);\n }\n \n return res;\n}\n\nll gcd(ll a,ll b){\n if(b==0) return a;\n return gcd(b,a%b);\n}\n\npair<Point,Vector> perpendicular_bisector(Point a,Point b){\n Point c=(a+b)/2;\n Vector v=b-c;\n swap(v.x,v.y);\n v.x*=-1;\n \n Point p=c;\n if(v.x==0){\n v.y=1;\n p.y=0;\n }\n else if(v.y==0){\n v.x=1;\n p.x=0;\n }\n else{\n if(v.x<0){\n v.x*=-1;\n v.y*=-1;\n }\n ll g=gcd(abs(ll(v.x)),abs(ll(v.y)));\n v.x/=g;\n v.y/=g;\n if(p.x>=0){\n ll d=p.x/v.x;\n p=p-v*d;\n }else{\n ll d=abs(p.x)/v.x;\n p=p+v*d;\n \n if(p.x<0){\n p=p+v;\n }\n }\n }\n \n return mp(p,v);\n}\n//2倍するなりして整数にしておくこと\n\nint main() {\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n while(1){\n int N,M,B;cin>>N>>M>>B;\n M+=2;\n if(N==0) break;\n Polygon P(N);\n for(int i=0;i<N;i++) cin>>P[i].x>>P[i].y;\n P.push_back(P[0]);\n vector<double> T(M);\n vector<Vector> V(M);\n for(int i=1;i<M-1;i++) cin>>T[i]>>V[i].x>>V[i].y;\n T.back()=1e7;\n \n vector<double> ans;\n \n for(int q=0;q<B;q++){\n double when=INF;\n double t;\n Point p;\n Vector v;\n double len;\n cin>>t>>p.x>>v.x>>v.y>>len;\n Segment G;\n G.p1={p.x,0};\n G.p2=G.p1-v/abs(v)*len;\n for(int i=0;i<N;i++){\n Vector add={0,0};\n double last=0;\n int j=1;\n while(j<M){\n if(T[j]<=t){\n add=add+V[j]*(T[j]-last);\n last=T[j];\n j++;\n }else if(last<t){\n last=t;\n }else{\n double left=last,right=T[j];\n for(int q=0;q<80;q++){\n double m1=(left*2+right)/3,m2=(left+right*2)/3;\n Vector a1,a2,b1,b2;\n a1=add+V[j]*(m1-T[j-1]);\n a2=add+V[j]*(m2-T[j-1]);\n b1=v*(m1-t);\n b2=v*(m2-t);\n Segment s1={P[i]+a1,P[i+1]+a1};\n Segment s2={P[i]+a2,P[i+1]+a2};\n Segment t1={G.p1+b1,G.p2+b1};\n Segment t2={G.p1+b2,G.p2+b2};\n \n double d1=getDistance(s1,t1),d2=getDistance(s2,t2);\n if(d1==0){\n right=m2;\n chmin(when,m1);\n }\n else if(d1<d2) right=m2;\n else left=m1;\n }\n add=add+V[j]*(T[j]-T[j-1]);\n last=T[j];\n j++;\n }\n }\n }\n if(when<INF) ans.push_back(when);\n }\n \n sort(all(ans));\n \n cout<<si(ans)<<\"\\n\";\n for(auto a:ans) cout<<fixed<<setprecision(25)<<a<<\"\\n\";\n \n }\n}","accuracy":1,"time_ms":6430,"memory_kb":3576,"score_of_the_acc":-1.1912,"final_rank":20},{"submission_id":"aoj_2023_5999810","code_snippet":"//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 998244353;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-12;\nconst ld pi = acosl(-1.0);\n\nll mod_pow(ll x, ll n, ll m = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)x += m;\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n % mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 2;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\n\n\n\ntypedef complex<ld> Point;\nld dot(Point a, Point b) { return real(conj(a) * b); }\nld cross(Point a, Point b) { return imag(conj(a) * b); }\nnamespace std {\n\tbool operator<(const Point& lhs, const Point& rhs) {\n\t\treturn lhs.real() == rhs.real() ? lhs.imag() < rhs.imag() : lhs.real() < rhs.real();\n\t}\n}\nstruct Line {\n\tPoint a, b;\n};\nstruct Circle {\n\tPoint p; ld r;\n};\nint ccw(Point a, Point b, Point c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > eps)return 1;//counter clockwise\n\tif (cross(b, c) < -eps)return -1;//clock wise\n\tif (dot(b, c) < 0)return 2;//c--a--b on line\n\tif (norm(b) < norm(c))return -2;//a--b--c on line\n\treturn 0; //a--c--b on line\n}\nld eq(ld a, ld b){\n\treturn abs(a - b) < eps;\n}\n//2直線の交差判定\nbool isis_ll(Line l, Line m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n//直線と線分の交差判定\nbool isis_ls(Line l, Line s) {\n\treturn (cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n//点が直線上に存在するか\nbool isis_lp(Line l, Point p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n//点が線分上に存在するか\nbool isis_sp(Line s, Point p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n//線分と線分の交差判定2\nbool isis_ss(Line s, Line t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n//点から直線への垂線の足\nPoint proj(Line l, Point p) {\n\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + t * (l.a - l.b);\n}\n//直線と直線の交点\n//平行な２直線に対しては使うな！！！！\nPoint is_ll(Line s, Line t) {\n\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n//直線と点の距離\nld dist_lp(Line l, Point p) {\n\treturn abs(p - proj(l, p));\n}\n//直線と直線の距離\nld dist_ll(Line l, Line m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n//線分と直線の距離\nld dist_ls(Line l, Line s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n//線分と点の距離\nld dist_sp(Line s, Point p) {\n\tPoint r = proj(s, p);\n\treturn isis_sp(s, r) ? abs(p - r) : min(abs(p - s.a), abs(p - s.b));\n}\n//線分と線分の距離\nld dist_ss(Line s, Line t) {\n\tif (isis_ss(s, t))return 0;\n\treturn min({ dist_sp(s,t.a),dist_sp(s,t.b),dist_sp(t,s.a),dist_sp(t,s.b) });\n}\n\nconst int mn = 10000000;\nld calc(ld lx, ld ly, ld rx, ld ry, ld px, ld py, ld vx, ld vy,ld len) {\n\tLine l = { {lx,ly},{rx,ry} };\n\tLine s = { {px,py},{px+len*vx,py+len*vy} };\n\tif (!isis_ss(s, l))return -1;\n\tPoint p = { px,py };\n\tif (ccw({ px,py }, { lx,ly }, { rx,ry }) % 2 == 0) {\n\t\t\n\t\tld dif = min(abs(Point{ lx,ly } - p), abs(Point{ rx,ry } - p));\n\t\tld vr = sqrt(vx * vx + vy * vy);\n\t\treturn dif / vr;\n\t}\n\tPoint c = is_ll(l, s);\n\tld dx = real(c) - px;\n\tld dy = imag(c) - py;\n\tif (vx != 0)return dx / vx;\n\treturn dy / vy;\n}\n\nint n, m, b;\nvoid solve() {\n\tvector<int> x(n), y(n);\n\trep(i, n)cin >> x[i] >> y[i];\n\tvector<int> t(m), vx(m), vy(m);\n\trep(i, m)cin >> t[i] >> vx[i] >> vy[i];\n\tt.insert(t.begin(), 0);\n\tt.push_back(mn);\n\tvx.push_back(0);\n\tvy.push_back(0);\n\tm++;\n\n\tvector<vector<int>> cx(n, vector<int>(m+1));\n\tvector<vector<int>> cy(n, vector<int>(m+1));\n\trep(i, n) {\n\t\tcx[i][0] = x[i];\n\t\tcy[i][0] = y[i];\n\t\trep(j, m) {\n\t\t\tcx[i][j + 1] = cx[i][j] + (t[j + 1] - t[j]) * vx[j];\n\t\t\tcy[i][j + 1] = cy[i][j] + (t[j + 1] - t[j]) * vy[j];\n\t\t}\n\t}\n\tvector<ld> ans;\n\trep(i, b) {\n\t\tint st; cin >> st;\n\t\tint sx; cin >> sx;\n\t\tint sy = 0;\n\t\tint dx, dy; cin >> dx >> dy;\n\t\tint len; cin >> len;\n\t\tld ex = dx / sqrt(dx * dx + dy * dy);\n\t\tld ey = dy / sqrt(dx * dx + dy * dy);\n\t\tld mi = INF;\n\t\t//弾丸につっこむ\n\t\trep(id, n) {\n\t\t\tld lx = sx;\n\t\t\tld ly = 0;\n\t\t\tld rx = sx - ex * len;\n\t\t\tld ry = sy - ey * len;\n\t\t\trep(j, m) {\n\t\t\t\tif (t[j + 1] <= st)continue;\n\t\t\t\tint dif = t[j + 1] - t[j];\n\t\t\t\tld px = cx[id][j];\n\t\t\t\tld py = cy[id][j];\n\t\t\t\tif (t[j] < st) {\n\t\t\t\t\tdif = t[j + 1] - st;\n\t\t\t\t\tpx += vx[j] * (st - t[j]);\n\t\t\t\t\tpy += vy[j] * (st - t[j]);\n\t\t\t\t}\n\t\t\t\tld val = calc(lx, ly, rx, ry, px, py, vx[j] - dx, vy[j] - dy,dif);\n\t\t\t\tif (val >= 0 && val <= dif) {\n\t\t\t\t\tmi = min(mi, val + max(t[j], st));\n\t\t\t\t\t//break;\n\t\t\t\t}\n\t\t\t\tlx += dx * dif;\n\t\t\t\tly += dy * dif;\n\t\t\t\trx += dx * dif;\n\t\t\t\try += dy * dif;\n\t\t\t}\n\t\t}\n\t\t//多角形につっこむ\n\t\trep(id, n) {\n\t\t\tint nid = (id + 1==n ? 0 : id + 1);\n\t\t\tld lx = sx;\n\t\t\tld ly = 0;\n\t\t\tld rx = sx - ex * len;\n\t\t\tld ry = sy - ey * len;\n\t\t\trep(j, m) {\n\t\t\t\tif (t[j + 1] <= st)continue;\n\t\t\t\tint dif = t[j + 1] - t[j];\n\t\t\t\tld px = cx[id][j];\n\t\t\t\tld py = cy[id][j];\n\t\t\t\tld qx = cx[nid][j];\n\t\t\t\tld qy = cy[nid][j];\n\t\t\t\tif (t[j] < st) {\n\t\t\t\t\tdif = t[j + 1] - st;\n\t\t\t\t\tpx += vx[j] * (st - t[j]);\n\t\t\t\t\tqx += vx[j] * (st - t[j]);\n\t\t\t\t\tpy += vy[j] * (st - t[j]);\n\t\t\t\t\tqy += vy[j] * (st - t[j]);\n\t\t\t\t}\n\t\t\t\t//bool upd = false;\n\t\t\t\tld val = calc(px, py, qx, qy, lx, ly, dx-vx[j], dy-vy[j],dif);\n\t\t\t\t\n\t\t\t\tif (val >= 0 && val <= dif) {\n\t\t\t\t\tmi = min(mi, val + max(t[j], st));\n\t\t\t\t\t//upd = true;\n\t\t\t\t\t//break;\n\t\t\t\t}\n\t\t\t\tval = calc(px, py, qx, qy, rx, ry, dx - vx[j], dy - vy[j],dif);\n\t\t\t\tif (val >= 0 && val <= dif) {\n\t\t\t\t\tmi = min(mi, val + max(t[j], st));\n\t\t\t\t\t//upd = true;\n\t\t\t\t\t//break;\n\t\t\t\t}\n\t\t\t\t//if (upd)break;\n\t\t\t\tlx += dx * dif;\n\t\t\t\tly += dy * dif;\n\t\t\t\trx += dx * dif;\n\t\t\t\try += dy * dif;\n\t\t\t}\n\t\t}\n\t\tif (mi < INF) {\n\t\t\t//cout << mi << \"\\n\";\n\t\t\tans.push_back(mi);\n\t\t}\n\t\t/*rep(id, n) {\n\t\t\tint nid = id + 1 == n ? 0 : id + 1;\n\t\t\tint x2 = sx;\n\t\t\tint y2 = sy;\n\t\t\trep(j, m) {\n\t\t\t\tif (t[j + 1] <= st)continue;\n\t\t\t\tint dif = t[j + 1] - t[j];\n\t\t\t\tint x1 = cx[id][j];\n\t\t\t\tint y1 = cy[id][j];\n\t\t\t\tint x2=\n\t\t\t}\n\t\t}*/\n\t}\n\tsort(all(ans));\n\tcout << ans.size() << \"\\n\";\n\trep(i, ans.size()) {\n\t\tcout << ans[i] << \"\\n\";\n\t}\n}\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << fixed << setprecision(8);\n\t//init_f();\n\t//init();\n\t//int t; cin >> t; rep(i, t)\n\twhile(cin>>n>>m>>b,n)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3700,"score_of_the_acc":-0.2102,"final_rank":15},{"submission_id":"aoj_2023_5968908","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < (n); i++)\nusing namespace std;\ntypedef long long ll;\nusing Real = long double;\nusing Point = complex< Real >;\nusing Polygon = vector< Point >;\nconst Real EPS = 1e-9, PI = acos(-1);\nconstexpr int COUNTER_CLOCKWISE = +1;\nconstexpr int CLOCKWISE = -1;\nconstexpr int ONLINE_BACK = +2; // c-a-b\nconstexpr int ONLINE_FRONT = -2; // a-b-c\nconstexpr int ON_SEGMENT = 0; // a-c-b\n\nPoint operator*(const Point &p, const Real &d) {\n return Point(real(p) * d, imag(p) * d);\n}\n\nPoint operator/(const Point &p, const Real &d) {\n return Point(real(p) / d, imag(p) / d);\n}\n\nistream &operator>>(istream &is, Point &p) {\n Real a, b; is >> a >> b;\n p = Point(a, b);\n return is;\n}\n\nostream &operator<<(ostream &os, const Point &p) {\n return os << fixed << setprecision(10) << real(p) << \" \" << imag(p);\n}\n\nnamespace std {\n bool operator<(const Point &a, const Point &b) {\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\n }\n}\n\n// 符号\ninline int sign(const Real &r) {\n return r <= -EPS ? -1 : r >= EPS ? 1 : 0;\n}\n\n// a = b ? \ninline bool equals(const Real &a, const Real &b) {\n return sign(a - b) == 0;\n}\n\n\n// 単位ベクトル\nPoint unitVec(const Point &a){ return a / abs(a); }\n\n// 法線ベクトル 半時計周り\nPoint normVec(const Point &a){ return a * Point(0, 1); }\n//Point normVec(const Point &a){ return a * Point(0,-1); }\n\n// 内積\nReal dot(const Point &a, const Point &b) {\n return (a.real() * b.real() + a.imag() * b.imag());\n}\n\n// 外積\nReal cross(const Point &a, const Point &b) {\n return (a.real() * b.imag() - a.imag() * b.real());\n}\n\nPoint rotate(const Point &p, const Real &theta) {\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(),\n sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nReal Radian_To_Degree(const Real &radian){ return radian * 180.0 / PI; }\nReal Degree_To_Radian(const Real °ree){ return degree * PI / 180.0; }\n\nstruct Line {\n Point a, b;\n Line() = default;\n Line(Point a, Point b) : a(a), b(b) {}\n\n // Ax + By = C\n Line(Real A, Real B, Real C) {\n if(equals(A, 0)) {\n a = Point(0, C / B), b = Point(1, C / B);\n }else if(equals(B,0)) {\n b = Point(C / A, 0), b = Point(C / A, 1);\n }else{\n a = Point(0, C / B), b = Point(C / A, 0);\n }\n }\n\n friend ostream &operator<<(ostream &os, Line &p) {\n return os << p.a << \" \" << p.b;\n }\n\n friend istream &operator>>(istream &is, Line &a) {\n return is >> a.a >> a.b;\n }\n};\n\nstruct Segment : Line {\n Segment() = default;\n Segment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n Point p;\n Real r;\n Circle() = default;\n Circle(Point p, Real r) : p(p), r(r) {}\n\n friend ostream &operator<<(ostream &os, Circle &c) {\n return os << c.p << \" \" << c.r;\n }\n\n friend istream &operator>>(istream &is, Circle &c) {\n return is >> c.p >> c.r;\n }\n};\n\n// 直線lに点pから引いた垂線の足を求める\nPoint projection(const Line &l, const Point &p) {\n Real t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n Real t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n\n// 直線lに関して点pと対称な点を求める\nPoint reflection(const Line &l, const Point &p) {\n return p + (projection(l, p) - p) * 2.0;\n}\n\n// 点の回転方向\n// 点aを基準に点b,cの位置関係\nint ccw(const Point &a, Point b, Point c) {\n b = b - a, c = c - a;\n if(sign(cross(b, c)) == +1) return COUNTER_CLOCKWISE; // 反時計回り\n if(sign(cross(b, c)) == -1) return CLOCKWISE; // 時計回り\n if(sign(dot(b, c)) == -1) return ONLINE_BACK; // c - a - b\n if(norm(b) < norm(c)) return ONLINE_FRONT; // a - b - c\n return ON_SEGMENT; // a - c - b\n}\n\n// 2直線の直交判定\nbool is_orthogonal(const Line &a, const Line &b) {\n return equals(dot(a.b - a.a, b.b - b.a), 0);\n}\n\n// 2直線の平行判定\nbool is_parallel(const Line &a, const Line &b) {\n return equals(cross(a.b - a.a, b.b - b.a), 0);\n}\n\n// 線分の交差判定\nbool is_intersect_ss(const Segment &s, const Segment &t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// 直線の交差判定\nbool is_intersect_ll(const Line &l, const Line &m) {\n Real A = cross(l.b - l.a, m.b - m.a);\n Real B = cross(l.b - l.a, l.b - m.a);\n if(equals(abs(A), 0) && equals(abs(B), 0)) return true;\n return !is_parallel(l, m);\n}\n\n// 線分に点が乗っているか\nbool is_intersect_sp(const Segment &s, const Point &p) {\n return ccw(s.a, s.b, p) == ON_SEGMENT;\n}\n\n// 点と点の距離\nReal distance_pp(const Point &p1, const Point &p2) {\n return sqrt(pow(real(p1)-real(p2), 2) + pow(imag(p1)-imag(p2), 2));\n}\n\n// 点と直線の距離\nReal distance_lp(const Line &l, const Point &p) {\n return abs(p - projection(l, p));\n}\n\n// 直線と直線の距離\nReal distance_ll(const Line &l, const Line &m) {\n return is_intersect_ll(l, m) ? 0 : distance_lp(l, m.a);\n}\n\n// 点と線分の距離\nReal distance_sp(const Segment &s, const Point &p) {\n Point r = projection(s, p);\n if(is_intersect_sp(s, r)) return abs(r - p);\n return min(abs(s.a - p), abs(s.b - p));\n}\n\n// 線分と線分の距離\nReal distance_ss(const Segment &a, const Segment &b) {\n if(is_intersect_ss(a, b)) return 0;\n return min({distance_sp(a, b.a), distance_sp(a, b.b), distance_sp(b, a.a), distance_sp(b, a.b)});\n}\n\n// 交点\nPoint cross_point_ll(const Line &l, const Line &m) {\n Real A = cross(l.b - l.a, m.b - m.a);\n Real B = cross(l.b - l.a, l.b - m.a);\n if(equals(abs(A), 0) && equals(abs(B), 0)) return m.a;\n return m.a + (m.b - m.a) * B / A;\n}\n\n// 円と円の位置関係\nint intersect(Circle c1, Circle c2) {\n 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(equals(c1.r + c2.r, d)) return 3;\n if(c1.r - c2.r < d) return 2;\n if(equals(c1.r - c2.r, d)) return 1;\n return 0;\n}\n\nReal area(const Polygon &p){\n Real A = 0;\n for(int i = 0; i < p.size(); i++){\n A += cross(p[i], p[(i + 1) % p.size()]);\n }\n return A * 0.5;\n}\n\nbool is_convex(const Polygon &p){\n for(int i = 0; i < p.size(); i++){\n if(ccw(p[(i + p.size() - 1) % p.size()], p[i], p[(i + 1) % p.size()]) == -1) return false;\n }\n return true;\n}\n\nenum { OUT, ON, IN };\nint contains(const Polygon &Q, const Point &p){\n bool in = false;\n for(int i = 0; i < Q.size(); i++){\n Point a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\n if(a.imag() > b.imag()) swap(a, b);\n if(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\n if(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\n }\n return in ? IN : OUT;\n}\n\nPolygon convex_hull(Polygon &p, bool strict = true){\n int n = (int)p.size(), k = 0;\n if(n <= 2) return p;\n sort(p.begin(), p.end());\n Polygon ch(2 * n);\n for(int i = 0; i < n; ch[k++] = p[i++]){\n while(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\n }\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]){\n while(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\n }\n ch.resize(k - 1);\n return ch;\n}\n\nReal convex_diameter(const Polygon &p){\n int n = (int)p.size();\n int is = 0, js = 0;\n for(int i = 1; i < n; i++){\n if(p[i].imag() > p[is].imag()) is = i;\n if(p[i].imag() < p[js].imag()) js = i;\n }\n Real maxdis = norm(p[is] - p[js]);\n int maxi, maxj, i, j;\n i = maxi = is;\n j = maxj = js;\n do {\n if(cross(p[(i + 1) % n] - p[i], p[(j + 1) % n] - p[j]) >= 0){\n j = (j + 1) % n;\n }else{\n i = (i + 1) % n;\n }\n\n if(norm(p[i] - p[j]) > maxdis){\n maxdis = norm(p[i] - p[j]);\n maxi = i;\n maxj = j;\n }\n\n }while(i != is || j != js);\n return sqrt(maxdis);\n}\n\nPolygon convex_cut(const Polygon &U, Line l){\n Polygon ret;\n for(int i = 0; i < U.size(); i++){\n Point now = U[i], nxt = U[(i + 1) % U.size()];\n if(ccw(l.a, l.b, now) != -1) ret.push_back(now);\n if(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0){\n ret.push_back(cross_point_ll(Line(now, nxt), l));\n }\n }\n return ret;\n}\n\npair< Point, Point > cross_point_cc(const Circle &c1, const Circle &c2) {\n Real d = abs(c1.p - c2.p);\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n Real t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n return {p1, p2};\n}\n\nconst int BOTTOM = 0;\nconst int LEFT = 1;\nconst int RIGHT = 2;\nconst int TOP = 3;\n\nclass endPoint {\n public:\n Point p;\n int seg; // id of Point\n int st; // kind of Point\n endPoint(){}\n endPoint(Point inp, int inseg, int inst):p(inp),seg(inseg),st(inst){}\n bool operator<(const endPoint &ep)const {\n if(p.imag() == ep.p.imag()) return st < ep.st;\n else return p.imag() < ep.p.imag();\n }\n};\n\nendPoint EP[220000];\nint Manhattan_Intersections(vector< Segment > s){\n int n = s.size();\n double hoge;\n\n for(int i = 0, k = 0; i < n; i++){\n if(s[i].a.imag() == s[i].b.imag()){\n if(s[i].a.real() > s[i].b.real()){\n hoge = s[i].a.real();\n s[i].a.real(s[i].b.real());\n s[i].b.real(hoge);\n }\n }else if(s[i].a.imag() > s[i].b.imag()){\n hoge = s[i].a.imag();\n s[i].a.imag(s[i].b.imag());\n s[i].b.imag(hoge);\n }\n\n if(s[i].a.imag() == s[i].b.imag()){\n EP[k++] = endPoint(s[i].a, i, LEFT);\n EP[k++] = endPoint(s[i].b, i, RIGHT);\n }else{\n EP[k++] = endPoint(s[i].a, i, BOTTOM);\n EP[k++] = endPoint(s[i].b, i, TOP);\n }\n }\n\n sort(EP, EP + 2 * n);\n set<int> BT;\n BT.insert(1000000001);\n int cnt = 0;\n for(int i = 0; i < 2 * n; i++){\n if(EP[i].st == TOP) BT.erase(EP[i].p.real());\n else if(EP[i].st == BOTTOM) BT.insert(EP[i].p.real());\n else if(EP[i].st == LEFT){\n set<int>::iterator b = lower_bound(BT.begin(), BT.end(), s[EP[i].seg].a.real());\n set<int>::iterator e = upper_bound(BT.begin(), BT.end(), s[EP[i].seg].b.real());\n cnt += distance(b, e);\n }\n }\n\n return cnt;\n}\n\n// 内接円\nCircle Inscribed_Circle(const Point& a, const Point& b, const Point& c){\n double A = abs(b - c), B = abs(c - a), C = abs(a - b);\n Point x = Point((a * A + b * B + c * C) / (A + B + C));\n double r = distance_sp(Segment(a,b),x);\n return Circle(x, r);\n}\n\n// 外接円\nCircle Circumscribed_Circle(const Point& a, const Point& b, const Point& c){\n Point m1((a+b)/2.0), m2((b+c)/2.0);\n Point v((b-a).imag(), (a-b).real()), w((b-c).imag(), (c-b).real());\n Line s(m1, Point(m1+v)), t(m2, Point(m2+w));\n const Point x = cross_point_ll(s, t);\n return Circle(x, abs(a-x));\n}\n\npair< Point, Point > cross_point_cl(const Circle &c, const Line &l) {\n Point pr = projection(l, c.p);\n if(equals(abs(pr - c.p), c.r)) return {pr, pr};\n Point e = (l.b - l.a) / abs(l.b - l.a);\n auto k = sqrt(norm(c.r) - norm(pr - c.p));\n return {pr - e * k, pr + e * k};\n}\n\n// 点pを通る円の接線\npair<Point,Point> tangent_cp(const Circle &c, const Point &p) {\n return cross_point_cc(c, Circle(p, sqrt(norm(c.p - p) - c.r * c.r)));\n}\n\n// 二つの円の共通接線\nvector< Line > tangent_cc(Circle c1, Circle c2){\n vector< Line > ret;\n if(c1.r < c2.r) swap(c1,c2);\n double g = norm(c1.p-c2.p);\n if(equals(g,0.0)) return ret;\n Point u = (c2.p-c1.p)/sqrt(g);\n Point v = rotate(u, PI * 0.5);\n for(int s:{-1,1}){\n double h = (c1.r+ s*c2.r)/sqrt(g);\n if(equals(1- h*h, 0)){\n ret.emplace_back(c1.p+u*c1.r, c1.p+(u+v)*c1.r);\n }else if(1-h*h > 0){\n Point uu = u*h, vv = v*sqrt(1-h*h);\n ret.emplace_back(c1.p+(uu+vv)*c1.r, c2.p-(uu+vv)*c2.r*s);\n ret.emplace_back(c1.p+(uu-vv)*c1.r, c2.p-(uu-vv)*c2.r*s);\n }\n }\n return ret;\n}\n\nReal area_poly_c(const Polygon &p, const Circle &c) {\n if(p.size() < 3) return 0.0;\n function< Real(Circle, Point, Point) > cross_area = [&](const Circle &c, const Point &a, const Point &b) {\n Point va = c.p - a, vb = c.p - b;\n Real f = cross(va, vb), ret = 0.0;\n if(equals(f, 0.0)) return ret;\n if(max(abs(va), abs(vb)) < c.r + EPS) return f;\n if(distance_sp(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\n auto u = cross_point_cl(c, Segment(a, b));\n vector< Point > tot{a, u.first, u.second, b};\n for(int i = 0; i + 1 < tot.size(); i++) {\n ret += cross_area(c, tot[i], tot[i + 1]);\n }\n return ret;\n };\n Real A = 0;\n for(int i = 0; i < p.size(); i++) {\n A += cross_area(c, p[i], p[(i + 1) % p.size()]);\n }\n return A;\n}\n\nReal area_cc(const Circle &c1, const Circle &c2) {\n Real d = abs(c1.p - c2.p);\n if(c1.r + c2.r <= d + EPS) return 0.0;\n if(d <= fabs(c1.r - c2.r) + EPS) {\n Real r = min(c1.r, c2.r);\n return r * r * PI;\n }\n Real rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n Real theta = acos(rc / c1.r);\n Real phi = acos((d - rc) / c2.r);\n return (c1.r * c1.r*theta + c2.r*c2.r*phi - d*c1.r*sin(theta));\n}\n\nbool is_intersect_pp(Polygon p, Polygon q) {\n rep(i,p.size()) {\n if(contains(q, p[i])) return true;\n rep(j,q.size()) {\n Segment pl(p[i], p[(i + 1) % p.size()]);\n Segment ql(q[j], q[(j + 1) % q.size()]);\n if(is_intersect_ss(pl, ql)) return true;\n }\n }\n return false;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n while(true) {\n int N,M,B; cin >> N >> M >> B; if(N == 0 && M == 0 && B == 0) break;\n Polygon p(N); rep(i,N) cin >> p[i];\n vector< Real > t(M); Polygon v(M);\n rep(i,M) cin >> t[i] >> v[i];\n t.push_back(1e9); v.push_back({0, 0}); M++;\n for(int i = M - 1; i >= 1; i--) t[i] -= t[i - 1];\n\n vector< Real > ans;\n rep(_,B) {\n Real T,X,L; Point vb; cin >> T >> X >> vb >> L;\n Segment bullet(Point(X, 0) - vb * T, Point(X, 0) - vb / abs(vb) * L - vb * T);\n Real cur = 0;\n rep(i,M) {\n Point vc = vb - v[i];\n auto f = [&](Real x) {\n Polygon q = {bullet.a, bullet.b, bullet.b + vc * x, bullet.a + vc * x};\n return is_intersect_pp(p, q);\n };\n\n if(f(t[i])) {\n Real lo = 0.0, hi = t[i];\n rep(__,50) { Real mid = (lo + hi) * 0.5; (f(mid) ? hi : lo) = mid; }\n ans.push_back(cur + (lo + hi) * 0.5);\n break;\n } else {\n cur += t[i];\n bullet.a += vc * t[i];\n bullet.b += vc * t[i];\n }\n }\n }\n\n sort(ans.begin(), ans.end());\n cout << ans.size() << endl;\n cout.precision(17);\n for(Real a : ans) cout << a << '\\n';\n }\n}","accuracy":1,"time_ms":140,"memory_kb":13916,"score_of_the_acc":-1.0187,"final_rank":19},{"submission_id":"aoj_2023_5803967","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.08.19 17:53:15 */\n\n// #ifdef LOCAL\n// #define _GLIBCXX_DEBUG\n// #endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region macros\n\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define popcnt(n) __builtin_popcountll((long long)n)\n\n#define REPname(a, b, c, d, e, ...) e\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n\n#define DREPname(a, b, c, d, e, ...) e\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\n\n#pragma endregion\n\n#pragma region aliases\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<std::vector<int>>;\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\nusing vll = std::vector<ll>;\nusing vvll = std::vector<vll>;\nusing vvvll = std::vector<vvll>;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\ntemplate <class T = ll>\nusing V = std::vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\ntemplate <class T = ll>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T = ll>\nusing pqdn = std::priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nconst int inf = 1e9;\nconst long long INF = 1e18;\nconst long double pi = acos(-1);\nconst char dl = '\\n';\nconst char sp = ' ';\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nconst int mod_1000000007 = 1000000007;\nconst int mod_998244353 = 998244353;\n\n#pragma endregion\n\n#pragma region basic_operation\n\ntemplate <class T0, class T1, class T2>\ninline bool in_range(T0 x, T1 lef, T2 rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool f = 1) { std::cout << (f ? \"Yes\" : \"No\") << '\\n'; }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(bool f = 1) { std::cout << (f ? \"YES\" : \"NO\") << '\\n'; }\nvoid NO() { std::cout << \"NO\\n\"; }\n\ntemplate <class T>\nvoid drop(T answer) {\n\tstd::cout << answer << '\\n';\n\texit(0);\n}\n\nvoid err(bool flag = true) {\n\tif(!flag) return;\n\tstd::cout << -1 << '\\n';\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\n\tif(vertically) {\n\t\tfor(auto const &a : v) {\n\t\t\tstd::cout << a << '\\n';\n\t\t}\n\t\treturn;\n\t}\n\tfor(auto it = v.begin(); it != v.end(); it++) {\n\t\tstd::cout << (*it);\n\t\tif(it != v.end() - 1) {\n\t\t\tstd::cout << ' ';\n\t\t}\n\t}\n\tstd::cout << '\\n';\n\treturn;\n}\n\ninline void print() { std::cout << '\\n'; }\ntemplate <class T>\ninline void print(T x) {\n\tstd::cout << x << '\\n';\n\treturn;\n}\ntemplate <typename Head, typename... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << \" \";\n\tprint(T...);\n}\n\ntemplate <class T>\nvoid add(std::vector<T> &v, T val) {\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b != 0);\n\treturn (a + b - 1) / b;\n}\n\ntemplate <class T>\nT greatest_lower_multiple(T x, T d) {\n\tif(d == 0) return 0;\n\tif(d < 0) d *= -1;\n\tT y = x % d;\n\tif(y < 0) y += d;\n\treturn x - y;\n}\n\ntemplate <class T>\nT least_upper_multiple(T x, T d) {\n\treturn -greatest_lower_multiple(-x, d);\n}\n\nlong long POW(long long a, long long n) {\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tassert(n >= 0 && mod);\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\ta %= mod;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res < 0 ? res + mod : res;\n}\n\n// return x which satisfies a * x % mod == gcd(a, mod)\n// not (mod | a)\nlong long modinv(long long a, long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tstd::swap(a, b);\n\t\tu -= t * v;\n\t\tstd::swap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nvoid unq_sort(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<int> press(std::vector<T> &a) {\n\tauto vec = a;\n\tunq_sort(vec);\n\tstd::vector<int> ret;\n\tfor(auto &v : a) ret.push_back(lb(vec, v));\n\treturn ret;\n}\n\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DBL(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define TPL3(type0, type1, type2, name) \\\n\tstd::tuple<type0, type1, type2> name; \\\n\tscanner::INPUT(name);\n#define TPL4(type0, type1, type2, type3, name) \\\n\tstd::tuple<type0, type1, type2, type3> name; \\\n\tscanner::INPUT(name);\n\nnamespace scanner {\ntemplate <class T>\nvoid scan(T &a) {\n\tstd::cin >> a;\n}\n\ntemplate <class T, class L>\nvoid scan(std::pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\n\ntemplate <class T0, class T1, class T2>\nvoid scan(std::tuple<T0, T1, T2> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tp = std::make_tuple(t0, t1, t2);\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tT3 t3;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tscan(t3);\n\tp = std::make_tuple(t0, t1, t2, t3);\n}\n\ntemplate <class T>\nvoid scan(std::vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\n\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n#pragma endregion\n\n#pragma region debug\n\n#pragma region output\ntemplate <typename T1, typename T2>\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\n\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\tif(i) os << \" \";\n\t\tos << v[i];\n\t}\n\treturn os;\n}\n#pragma endregion\n\n#pragma region view\n\nnamespace viewer {\nvoid view(const long long e) {\n\tif(e == INF)\n\t\tstd::cerr << \"INF\";\n\telse if(e == -INF)\n\t\tstd::cerr << \"-INF\";\n\telse\n\t\tstd::cerr << e;\n}\n\nvoid view(const int e) {\n\tif(e == inf)\n\t\tstd::cerr << \"inf\";\n\telse if(e == -inf)\n\t\tstd::cerr << \"-inf\";\n\telse\n\t\tstd::cerr << e;\n}\n\ntemplate <typename T>\nvoid view(const T e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << \"(\";\n\tview(p.first);\n\tstd::cerr << \", \";\n\tview(p.second);\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::tuple<T0, T1, T2> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \", \";\n\tview(std::get<3>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(const std::set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::unordered_set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(const auto &e : v) {\n\t\tview(e);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : vv) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &c : v) {\n\t\tstd::cerr << \"\\t(\";\n\t\tview(c.first);\n\t\tstd::cerr << \", \";\n\t\tview(c.second);\n\t\tstd::cerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n} // namespace viewer\n\n#pragma endregion\n\n// when debugging : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tviewer::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tviewer::view(x); \\\n\t\tstd::cerr << '\\n'; \\\n\t} while(0)\n\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\n#pragma endregion\n\n#pragma region geometry_light\n\nusing Real = long double;\nusing R = Real;\nusing Point = std::complex<Real>;\nusing Vec = Point;\nconst Real EPS = 1e-10, PI = acos(-1);\n\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\n/*\n\t-1: a < b\n\t0 : a == b\n\t1 : a > b\n*/\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\n\nnamespace std {\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n} // namespace std\n\nstd::istream &operator>>(std::istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// rotate point 'p' for counter clockwise direction\nconst Point rotate(const Real &theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\n\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\n\n// get angle a-b-c (<pi)\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), w(c - b);\n\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\n\treturn std::min(theta, 2 * PI - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \" -- \" << p.b; }\n\n\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = std::vector<Point>;\nusing Polygon = std::vector<Point>;\nusing Segments = std::vector<Segment>;\nusing Lines = std::vector<Line>;\nusing Circles = std::vector<Circle>;\n\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\nconst int ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = 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\t// \"ONLINE_BACK\"\n\tif(norm(b) + EPS < norm(c)) return -2;\t// \"ONLINE_FRONT\"\n\treturn 0;\t\t\t\t\t\t\t\t// \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\n\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\n\nint intersect(const Line &l, const Line &m) {\n\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\n\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\n}\n\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\n\nint intersect(const Line &l, const Segment &s) {\n\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\n\treturn cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\n}\n\nReal distance(const Line &l, const Point &p);\n\nint intersect(const Circle &c, const Line &l) {\n\tReal d = c.r - distance(l, c.p);\n\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\n}\n\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\nint intersect(const Segment &s, const Segment &t) {\n\tif(eq(s.a, s.b)) return intersect(t, s.a);\n\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\n\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\n\t\treturn -1;\n\treturn int(ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0);\n}\n\nint intersect(const Circle &c, const Segment &l) {\n\tconst Point h = projection(l, c.p);\n\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\n\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\n}\n\nReal distance(const Point &a, const Point &b);\n\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\n\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\n\tint com = compare(r1 + r2, d);\n\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\n\t// if(c1.r < c2.r) swap(c1, c2);\n\t// Real d = abs(c1.p - c2.p);\n\t// if(compare(c1.r + c2.r, d) == -1) return 4;\n\t// if(eq(c1.r + c2.r, d)) return 3;\n\t// if(compare(c1.r - c2.r, d) == -1) return 2;\n\t// return int(eq(c1.r - c2.r, d));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\treturn intersect(s, r) ? distance(r, p) : std::min(abs(s.a - p), abs(s.b - p));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\nReal distance(const Segment &a, const Segment &b) {\n\tif(intersect(a, b)) return 0;\n\treturn std::min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\n}\n\nReal distance(const Line &l, const Segment &s) {\n\tif(intersect(l, s)) return 0;\n\treturn std::min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn m.a + (m.b - m.a) * B / A;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\n\treturn make_pair(pr - v, pr + v);\n\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\n\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\n\t// return {pr - e * base, pr + e * base};\n}\n\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\n\tauto ret = crosspoint(c, Line(l.a, l.b));\n\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn make_pair(p1, p2);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\n\treturn crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r)));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\n// 円 c1, c2 の共通接線\nLines tangent(Circle c1, Circle c2) {\n\tLines ret;\n\tif(c1.r < c2.r) std::swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tVec u = (c2.p - c1.p) / Real(sqrt(g));\n\tVec v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n\n#pragma endregion\n\nvoid solve() {\n\tint n, m, b;\n\tcin >> n >> m >> b;\n\tif(!n) exit(0);\n\n\tPolygon mybody(n);\n\tfoa(p, mybody) cin >> p;\n\n\tV<tuple<R, R, Vec>> move_me;\n\tR start_time = 0;\n\trep(m) {\n\t\tLD(t, vx, vy);\n\t\tmove_me.emplace_back(start_time, t, Vec(vx, vy));\n\t\tstart_time = t;\n\t}\n\tmove_me.emplace_back(start_time, 1e19, Vec(0, 0));\n\n\tauto f = [&](Segment s, Point a, Vec va) -> R {\n\t\tPoint b = a + va;\n\t\tLine orbit(a, b);\n\t\tif(intersect(orbit, s)) {\n\t\t\tPoint crs = crosspoint(orbit, s);\n\t\t\tif(ccw(s.a, s.b, crs)) return R(INF);\n\t\t\tif(dot(va, crs - a) < -EPS) return R(INF);\n\t\t\t\n\t\t\treturn distance(crs, a) / abs(va);\n\t\t}\n\t\treturn R(INF);\n\t};\n\n\tauto collision = [&](Segment a, Vec va, Segment b, Vec vb) {\n\t\tR ret = R(INF);\n\t\tchmin(ret, f(a, b.a, vb - va));\n\t\tchmin(ret, f(a, b.b, vb - va));\n\t\tchmin(ret, f(b, a.a, va - vb));\n\t\tchmin(ret, f(b, a.b, va - vb));\n\t\treturn ret;\n\t};\n\n\tV<R> ans;\n\n\trep(b) {\n\t\tR launch_time, launch_x;\n\t\tVec v_arrow;\n\t\tR arrow_length;\n\t\tcin >> launch_time >> launch_x >> v_arrow >> arrow_length;\n\n\t\tPoint arrow_hole(launch_x, 0);\n\t\tSegment arrow_begin(arrow_hole, arrow_hole - v_arrow / abs(v_arrow) * arrow_length);\n\n\t\tVec moved_me(0, 0);\n\n\t\tR answer = INF;\n\n\t\tfor(auto [start_time, end_time, v_me] : move_me) {\n\t\t\trep(i, n) {\n\t\t\t\tSegment edge(mybody[i] + moved_me, mybody[(i + 1) % n] + moved_me);\n\n\t\t\t\tSegment arrow_start_time(arrow_begin.a + v_arrow * (start_time - launch_time),\n\t\t\t\t\t\t\t\t\t\t arrow_begin.b + v_arrow * (start_time - launch_time));\n\t\t\t\tR res = collision(edge, v_me, arrow_start_time, v_arrow);\n\t\t\t\tif(!isnan(res) && 0 <= res && res <= end_time - start_time) {\n\t\t\t\t\tchmin(answer, res + start_time);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tmoved_me += v_me * (end_time - start_time);\n\t\t}\n\n\t\tif(answer < 1e16) ans.push_back(answer);\n\t}\n\n\tprint(ans.size());\n\tsort(all(ans));\n\tvout(ans, 1);\n\treturn;\n}\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(nullptr);\n\tstd::cout << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\twhile(1) solve();\n\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3444,"score_of_the_acc":-0.1902,"final_rank":13},{"submission_id":"aoj_2023_5452720","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst double INF = 2000000;\nconst double EPS = 0.0000001;\nstruct point{\n double x, y;\n point(){\n }\n point(double x, double y): x(x), y(y){\n }\n point operator +(point P){\n return point(x + P.x, y + P.y);\n }\n point operator -(point P){\n return point(x - P.x, y - P.y);\n }\n point operator *(double k){\n return point(x * k, y * k);\n }\n point operator /(double k){\n return point(x / k, y / k);\n }\n};\ndouble abs(point P){\n return sqrt(P.x * P.x + P.y * P.y);\n}\ndouble dot(point P, point Q){\n return P.x * Q.x + P.y * Q.y;\n}\ndouble cross(point P, point Q){\n return P.x * Q.y - P.y * Q.x;\n}\nstruct line{\n point A, B;\n line(point A, point B): A(A), B(B){\n }\n};\npoint vec(line L){\n return L.B - L.A;\n}\nbool point_on_segment(point P, line L){\n return abs(cross(P - L.A, vec(L))) < EPS && dot(P - L.A, vec(L)) > 0 && dot(P - L.B, vec(L)) < 0;\n}\nbool segment_intersects(line L1, line L2){\n if (cross(L2.A - L1.A, vec(L1)) * cross(L2.B - L1.A, vec(L1)) < 0){\n if (cross(L1.A - L2.A, vec(L2)) * cross(L1.B - L2.A, vec(L2)) < 0){\n return true;\n }\n }\n return false;\n}\nbool point_in_triangle(point P, point A, point B, point C){\n if (cross(B - A, P - A) > 0 && cross(C - B, P - B) > 0 && cross(A - C, P - C) > 0){\n return true;\n }\n if (cross(B - A, P - A) < 0 && cross(C - B, P - B) < 0 && cross(A - C, P - C) < 0){\n return true;\n }\n return false;\n}\nbool segment_triangle_intersect(line L, point A, point B, point C){\n if (segment_intersects(L, line(A, B))){\n return true;\n }\n if (segment_intersects(L, line(B, C))){\n return true;\n }\n if (segment_intersects(L, line(C, A))){\n return true;\n }\n if (point_in_triangle(L.A, A, B, C)){\n return true;\n }\n if (point_in_triangle(L.B, A, B, C)){\n return true;\n }\n if (point_on_segment(A, L)){\n return true;\n }\n if (point_on_segment(B, L)){\n return true;\n }\n if (point_on_segment(C, L)){\n return true;\n }\n return false;\n}\nint main(){\n cout << fixed << setprecision(20);\n while (true){\n int N, M, B;\n cin >> N >> M >> B;\n if (N == 0 && M == 0 && B == 0){\n break;\n }\n vector<point> P(N + 1);\n for (int i = 0; i < N; i++){\n cin >> P[i].x >> P[i].y;\n }\n P[N] = P[0];\n vector<double> T(M + 2);\n vector<point> V(M + 1);\n T[0] = 0;\n for (int i = 0; i < M; i++){\n cin >> T[i + 1] >> V[i].x >> V[i].y;\n }\n T[M + 1] = INF;\n V[M].x = 0;\n V[M].y = 0;\n M++;\n vector<double> ans;\n for (int i = 0; i < B; i++){\n double t;\n point S1, W;\n double L;\n cin >> t >> S1.x >> W.x >> W.y >> L;\n S1.y = 0;\n point S2 = S1 - W / abs(W) * L;\n line X(S1, S2);\n int p = lower_bound(T.begin(), T.end(), t) - T.begin();\n vector<double> T2 = T;\n vector<point> V2 = V;\n T2.insert(T2.begin() + p, t);\n V2.insert(V2.begin() + p, V[p - 1]);\n for (int j = p; j <= M; j++){\n V2[j] = V2[j] - W;\n }\n vector<point> P2 = P;\n double mn = INF;\n for (int j = 0; j <= M; j++){\n if (j >= p){\n bool ok = false;\n vector<point> Q(N + 1);\n for (int k = 0; k <= N; k++){\n Q[k] = P2[k] + V2[j] * (T2[j + 1] - T2[j]);\n }\n for (int k = 0; k < N; k++){\n if (segment_triangle_intersect(X, P2[k], P2[k + 1], Q[k])){\n ok = true;\n }\n if (segment_triangle_intersect(X, P2[k + 1], Q[k], Q[k + 1])){\n ok = true;\n }\n }\n if (ok){\n double tv = T2[j + 1] - T2[j], fv = 0;\n for (int k = 0; k < 50; k++){\n double mid = (tv + fv) / 2;\n for (int l = 0; l <= N; l++){\n Q[l] = P2[l] + V2[j] * mid;\n }\n ok = false;\n for (int l = 0; l < N; l++){\n if (segment_triangle_intersect(X, P2[l], P2[l + 1], Q[l])){\n ok = true;\n }\n if (segment_triangle_intersect(X, P2[l + 1], Q[l], Q[l + 1])){\n ok = true;\n }\n }\n if (ok){\n tv = mid;\n } else {\n fv = mid;\n }\n }\n mn = T2[j] + tv;\n break;\n }\n }\n for (int k = 0; k <= N; k++){\n P2[k] = P2[k] + V2[j] * (T2[j + 1] - T2[j]);\n }\n }\n if (mn != INF){\n ans.push_back(mn);\n }\n }\n sort(ans.begin(), ans.end());\n int n = ans.size();\n cout << n << endl;\n for (int i = 0; i < n; i++){\n cout << ans[i] << endl;\n }\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3304,"score_of_the_acc":-0.1715,"final_rank":12},{"submission_id":"aoj_2023_4761030","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\n#define SIZE 105\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\nstruct Info{\n\n\tdouble T,vx,vy;\n};\n\nstruct Ball{\n\n\tdouble start_T,x,vx,vy,len,speed;\n};\n\nint N,M,B;\nint num_line;\ndouble min_time[SIZE];\nvector<double> ans;\nPolygon P;\nLine line[SIZE],work[SIZE];\nInfo info[SIZE];\nBall ball[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\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\n\tdouble naiseki,norm1,norm2,gaiseki;\n\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\n\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\n\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\n\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\n\tif(gaiseki > EPS){\n\t\treturn 1;\n\t}else if(gaiseki < -EPS){\n\t\treturn -1;\n\t}\n\tif(naiseki < -EPS){\n\t\treturn 2;\n\t}\n\n\tif(norm1 < norm2){\n\t\treturn -2;\n\t}\n\treturn 0;\n}\n\n\n//★★直線ではなく、線分の交差判定★★\nbool is_Cross(Line a,Line b){\n\n\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\n\t\t\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n//交点を求める関数\nPoint calc_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\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\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//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\n\nPoint calc_Cross_Point(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\nvoid func(){\n\n\tP.clear();\n\tans.clear();\n\n\tdouble x,y;\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&x,&y);\n\t\tP.push_back(Point(x,y));\n\t}\n\n\t//線分にする\n\tnum_line = 0;\n\tfor(int i = 0; i < N; i++){\n\n\t\tline[num_line].p[0] = P[i];\n\t\tline[num_line].p[1] = P[(i+1)%N];\n\t\tnum_line++;\n\t}\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tscanf(\"%lf %lf %lf\",&info[i].T,&info[i].vx,&info[i].vy);\n\t}\n\n\tfor(int i = 0; i < B; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf %lf\",&ball[i].start_T,&ball[i].x,&ball[i].vx,&ball[i].vy,&ball[i].len);\n\n\t\t//★?★\n\t\t//ball[i].vx *= -1;\n\t\t//ball[i].vy *= -1;\n\t\tball[i].speed = sqrt(ball[i].vx*ball[i].vx+ball[i].vy*ball[i].vy);\n\t}\n\t//ダミー動作\n\tinfo[M].T = BIG_NUM;\n\tinfo[M].vx = 0;\n\tinfo[M].vy = 0;\n\tM++;\n\n\n\tfor(int i = 0; i < B; i++){\n\n\t\tmin_time[i] = BIG_NUM;//弾丸目線\n\t}\n\n\tdouble add_x,add_y;\n\tdouble ball_x,ball_y;\n\tdouble span,diff_x,diff_y;\n\tdouble tmp_vx,tmp_vy;\n\n\tLine ball_line;\n\tLine tmp_line;\n\n\tfor(int i = 0; i < B; i++){\n\n\t\tadd_x = 0;\n\t\tadd_y = 0;\n\n\t\tball_x = ball[i].x;\n\t\tball_y = 0;\n\n\t\tdouble current = 0;\n\n\t\tfor(int k = 0; k < M; k++){\n\n\t\t\t//pre-info[k].Tの間\n\t\t\tif(ball[i].start_T > info[k].T+EPS){\n\n\t\t\t\tadd_x += (info[k].T-current)*info[k].vx;\n\t\t\t\tadd_y += (info[k].T-current)*info[k].vy;\n\n\t\t\t\tcurrent = info[k].T;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif(ball[i].start_T > current+EPS){\n\n\t\t\t\tadd_x += (ball[i].start_T-current)*info[k].vx;\n\t\t\t\tadd_y += (ball[i].start_T-current)*info[k].vy;\n\t\t\t\tcurrent = ball[i].start_T;\n\t\t\t}\n\n\t\t\tfor(int a = 0; a < num_line; a++){\n\n\t\t\t\twork[a].p[0].x = line[a].p[0].x+add_x;\n\t\t\t\twork[a].p[0].y = line[a].p[0].y+add_y;\n\n\t\t\t\twork[a].p[1].x = line[a].p[1].x+add_x;\n\t\t\t\twork[a].p[1].y = line[a].p[1].y+add_y;\n\t\t\t}\n\n\n\t\t\tball_line.p[0] = Point(ball_x,ball_y);\n\t\t\tball_line.p[1] = Point(ball_x-(ball[i].len/ball[i].speed)*ball[i].vx,\n\t\t\t\t\t\t\t\t ball_y-(ball[i].len/ball[i].speed)*ball[i].vy);\n\n\t\t\t//弾丸静止\n\t\t\tspan = info[k].T-current;\n\t\t\ttmp_vx = info[k].vx-ball[i].vx;\n\t\t\ttmp_vy = info[k].vy-ball[i].vy;\n\n\t\t\tdiff_x = span*tmp_vx;\n\t\t\tdiff_y = span*tmp_vy;\n\n\t\t\tfor(int a = 0; a < num_line; a++){\n\t\t\t\tfor(int b = 0; b < 2; b++){\n\n\t\t\t\t\ttmp_line.p[0] = work[a].p[b];\n\t\t\t\t\ttmp_line.p[1].x = tmp_line.p[0].x+diff_x;\n\t\t\t\t\ttmp_line.p[1].y = tmp_line.p[0].y+diff_y;\n\n\t\t\t\t\tif(is_Cross(ball_line,tmp_line)){\n\n\t\t\t\t\t\tPoint cross_point = calc_Cross_Point(tmp_line,ball_line);\n\t\t\t\t\t\tdouble all_len = calc_dist(tmp_line.p[0],tmp_line.p[1]);\n\t\t\t\t\t\tdouble add_time = (calc_dist(cross_point,tmp_line.p[0])/all_len)*span;\n\n\t\t\t\t\t\tmin_time[i] = min(min_time[i],current+add_time);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//多角形静止\n\t\t\ttmp_vx = ball[i].vx-info[k].vx;\n\t\t\ttmp_vy = ball[i].vy-info[k].vy;\n\n\t\t\tdiff_x = span*tmp_vx;\n\t\t\tdiff_y = span*tmp_vy;\n\n\t\t\tfor(int b = 0; b < 2; b++){\n\n\t\t\t\ttmp_line.p[0] = ball_line.p[b];\n\t\t\t\ttmp_line.p[1].x = tmp_line.p[0].x+diff_x;\n\t\t\t\ttmp_line.p[1].y = tmp_line.p[0].y+diff_y;\n\n\t\t\t\tfor(int a = 0; a < num_line; a++){\n\t\t\t\t\tif(is_Cross(tmp_line,work[a])){\n\n\t\t\t\t\t\tPoint cross_point = calc_Cross_Point(tmp_line,work[a]);\n\t\t\t\t\t\tdouble all_len = calc_dist(tmp_line.p[0],tmp_line.p[1]);\n\t\t\t\t\t\tdouble add_time = (calc_dist(cross_point,tmp_line.p[0])/all_len)*span;\n\n\t\t\t\t\t\tmin_time[i] = min(min_time[i],current+add_time);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tadd_x += span*info[k].vx;\n\t\t\tadd_y += span*info[k].vy;\n\n\t\t\tball_x += span*ball[i].vx;\n\t\t\tball_y += span*ball[i].vy;\n\n\t\t\tcurrent = info[k].T;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < B; i++){\n\n\t\tif(fabs(min_time[i]-BIG_NUM) < EPS)continue;\n\t\tans.push_back(min_time[i]);\n\t}\n\tsort(ans.begin(),ans.end());\n\n\tprintf(\"%lld\\n\",ans.size());\n\tfor(int i = 0; i < ans.size(); i++){\n\n\t\tprintf(\"%.10lf\\n\",ans[i]);\n\t}\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d %d %d\",&N,&M,&B);\n\t\tif(N == 0 && M == 0 && B == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3288,"score_of_the_acc":-0.1686,"final_rank":11},{"submission_id":"aoj_2023_4761028","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\n#define SIZE 105\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\tvoid outPut(){\n\n\t\tprintf(\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\n\",p[0].x,p[0].y,p[1].x,p[1].y);\n\t}\n\tPoint p[2];\n};\n\nstruct Info{\n\n\tdouble T,vx,vy;\n};\n\nstruct Ball{\n\n\tdouble start_T,x,vx,vy,len,speed;\n};\n\nint N,M,B;\nint num_line;\ndouble min_time[SIZE];\nvector<double> ans;\nPolygon P;\nLine line[SIZE],work[SIZE];\nInfo info[SIZE];\nBall ball[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\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\n\tdouble naiseki,norm1,norm2,gaiseki;\n\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\n\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\n\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\n\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\n\tif(gaiseki > EPS){\n\t\treturn 1;\n\t}else if(gaiseki < -EPS){\n\t\treturn -1;\n\t}\n\tif(naiseki < -EPS){\n\t\treturn 2;\n\t}\n\n\tif(norm1 < norm2){\n\t\treturn -2;\n\t}\n\treturn 0;\n}\n\n\n//★★直線ではなく、線分の交差判定★★\nbool is_Cross(Line a,Line b){\n\n\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\n\t\t\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n//交点を求める関数\nPoint calc_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\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\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//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\n\nPoint calc_Cross_Point(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\nvoid func(){\n\n\tP.clear();\n\tans.clear();\n\n\tdouble x,y;\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&x,&y);\n\t\tP.push_back(Point(x,y));\n\t}\n\n\t//線分にする\n\tnum_line = 0;\n\tfor(int i = 0; i < N; i++){\n\n\t\tline[num_line].p[0] = P[i];\n\t\tline[num_line].p[1] = P[(i+1)%N];\n\t\tnum_line++;\n\t}\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tscanf(\"%lf %lf %lf\",&info[i].T,&info[i].vx,&info[i].vy);\n\t}\n\n\tfor(int i = 0; i < B; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf %lf\",&ball[i].start_T,&ball[i].x,&ball[i].vx,&ball[i].vy,&ball[i].len);\n\n\t\t//★?★\n\t\t//ball[i].vx *= -1;\n\t\t//ball[i].vy *= -1;\n\t\tball[i].speed = sqrt(ball[i].vx*ball[i].vx+ball[i].vy*ball[i].vy);\n\t}\n\t//ダミー動作\n\tinfo[M].T = BIG_NUM;\n\tinfo[M].vx = 0;\n\tinfo[M].vy = 0;\n\tM++;\n\n\n\tfor(int i = 0; i < B; i++){\n\n\t\tmin_time[i] = BIG_NUM;//弾丸目線\n\t}\n\n\tdouble add_x,add_y;\n\tdouble ball_x,ball_y;\n\tdouble span,diff_x,diff_y;\n\tdouble tmp_vx,tmp_vy;\n\n\tLine ball_line;\n\tLine tmp_line;\n\n\tfor(int i = 0; i < B; i++){\n\n\t\tadd_x = 0;\n\t\tadd_y = 0;\n\n\t\tball_x = ball[i].x;\n\t\tball_y = 0;\n\n\t\tdouble current = 0;\n\n\t\tfor(int k = 0; k < M; k++){\n\n\t\t\t//pre-info[k].Tの間\n\t\t\tif(ball[i].start_T > info[k].T+EPS){\n\n\t\t\t\tadd_x += (info[k].T-current)*info[k].vx;\n\t\t\t\tadd_y += (info[k].T-current)*info[k].vy;\n\n\t\t\t\tcurrent = info[k].T;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif(ball[i].start_T > current+EPS){\n\n\t\t\t\tadd_x += (ball[i].start_T-current)*info[k].vx;\n\t\t\t\tadd_y += (ball[i].start_T-current)*info[k].vy;\n\t\t\t\tcurrent = ball[i].start_T;\n\t\t\t}\n\n\t\t\tfor(int a = 0; a < num_line; a++){\n\n\t\t\t\twork[a].p[0].x = line[a].p[0].x+add_x;\n\t\t\t\twork[a].p[0].y = line[a].p[0].y+add_y;\n\n\t\t\t\twork[a].p[1].x = line[a].p[1].x+add_x;\n\t\t\t\twork[a].p[1].y = line[a].p[1].y+add_y;\n\t\t\t}\n\n\n\t\t\tball_line.p[0] = Point(ball_x,ball_y);\n\t\t\tball_line.p[1] = Point(ball_x-(ball[i].len/ball[i].speed)*ball[i].vx,\n\t\t\t\t\t\t\t\t ball_y-(ball[i].len/ball[i].speed)*ball[i].vy);\n\n\t\t\t//printf(\"弾丸(%.3lf,%.3lf)-(%.3lf,%.3lf)\\n\",ball_line.p[0].x,ball_line.p[0].y,ball_line.p[1].x,ball_line.p[1].y);\n\n\t\t\t//弾丸静止\n\t\t\tspan = info[k].T-current;\n\t\t\ttmp_vx = info[k].vx-ball[i].vx;\n\t\t\ttmp_vy = info[k].vy-ball[i].vy;\n\n\t\t\tdiff_x = span*tmp_vx;\n\t\t\tdiff_y = span*tmp_vy;\n\n\t\t\t//printf(\"current:%.3lf vx:%.3lf vy:%.3lf diff_x:%.3lf diff_y:%.3lf\\n\",current,tmp_vx,tmp_vy,diff_x,diff_y);\n\n\t\t\tfor(int a = 0; a < num_line; a++){\n\t\t\t\tfor(int b = 0; b < 2; b++){\n\n\t\t\t\t\ttmp_line.p[0] = work[a].p[b];\n\t\t\t\t\ttmp_line.p[1].x = tmp_line.p[0].x+diff_x;\n\t\t\t\t\ttmp_line.p[1].y = tmp_line.p[0].y+diff_y;\n\n\t\t\t\t\tif(is_Cross(ball_line,tmp_line)){\n\n\t\t\t\t\t\tPoint cross_point = calc_Cross_Point(tmp_line,ball_line);\n\t\t\t\t\t\tdouble all_len = calc_dist(tmp_line.p[0],tmp_line.p[1]);\n\t\t\t\t\t\tdouble add_time = (calc_dist(cross_point,tmp_line.p[0])/all_len)*span;\n\n\t\t\t\t\t\tmin_time[i] = min(min_time[i],current+add_time);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//多角形静止\n\t\t\ttmp_vx = ball[i].vx-info[k].vx;\n\t\t\ttmp_vy = ball[i].vy-info[k].vy;\n\n\t\t\tdiff_x = span*tmp_vx;\n\t\t\tdiff_y = span*tmp_vy;\n\n\t\t\t//printf(\"多角形静止 current:%.3lf vx:%.3lf vy:%.3lf diff_x:%.3lf diff_y:%.3lf\\n\",current,tmp_vx,tmp_vy,diff_x,diff_y);\n\n\t\t\tfor(int b = 0; b < 2; b++){\n\n\t\t\t\ttmp_line.p[0] = ball_line.p[b];\n\t\t\t\ttmp_line.p[1].x = tmp_line.p[0].x+diff_x;\n\t\t\t\ttmp_line.p[1].y = tmp_line.p[0].y+diff_y;\n\n\t\t\t\t//printf(\"b:%d\\n\",b);\n\t\t\t\t//tmp_line.outPut();\n\n\t\t\t\tfor(int a = 0; a < num_line; a++){\n\t\t\t\t\tif(is_Cross(tmp_line,work[a])){\n\n\t\t\t\t\t\tPoint cross_point = calc_Cross_Point(tmp_line,work[a]);\n\t\t\t\t\t\tdouble all_len = calc_dist(tmp_line.p[0],tmp_line.p[1]);\n\t\t\t\t\t\tdouble add_time = (calc_dist(cross_point,tmp_line.p[0])/all_len)*span;\n\n\t\t\t\t\t\tmin_time[i] = min(min_time[i],current+add_time);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tadd_x += span*info[k].vx;\n\t\t\tadd_y += span*info[k].vy;\n\n\t\t\tball_x += span*ball[i].vx;\n\t\t\tball_y += span*ball[i].vy;\n\n\t\t\tcurrent = info[k].T;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < B; i++){\n\n\t\tif(fabs(min_time[i]-BIG_NUM) < EPS)continue;\n\t\tans.push_back(min_time[i]);\n\t}\n\tsort(ans.begin(),ans.end());\n\n\tprintf(\"%lld\\n\",ans.size());\n\tfor(int i = 0; i < ans.size(); i++){\n\n\t\tprintf(\"%.10lf\\n\",ans[i]);\n\t}\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d %d %d\",&N,&M,&B);\n\t\tif(N == 0 && M == 0 && B == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3284,"score_of_the_acc":-0.1683,"final_rank":10},{"submission_id":"aoj_2023_3678148","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<map>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<iomanip>\n\nusing namespace std;\n#define rep(i,n) for(int i = 0 ; i < n ; ++i)\nusing ll = long long;\nusing ld = long double;\nusing Point = complex<ld>;\nconst ld eps = 1e-9;\n\nbool eq(ld a, ld b){\n return abs(a-b)<eps;\n}\n\nld dot(Point a, Point b){\n return real(conj(a)*b);\n}\n\nld cross(Point a, Point b){\n return imag(conj(a)*b);\n}\n\nstruct Line{\n Point a, b;\n};\n\nbool isis_ll(Line l, Line m){\n return !eq(cross(l.b-l.a, m.b-m.a),0);\n}\n\nbool isis_ls(Line l, Line s){\n return (cross(l.b-l.a,s.a-l.a)*cross(l.b-l.a,s.b-l.a)<eps);\n}\n\nPoint is_ll(Line s, Line t){\n Point sv= s.b-s.a, tv = t.b-t.a;\n return s.a + sv * cross(tv, t.a-s.a)/cross(tv,sv);\n}\n\n\nvoid solve(int n,int k,int m){\n Point p[n];\n rep(i,n){\n int x,y;\n cin>>x>>y;\n p[i]=Point(x,y);\n }\n vector<ld> t(k+1,1e9);\n vector<Point> v(k+1);\n rep(i,k){\n int x,y;\n cin>>t[i]>>x>>y;\n v[i]=Point(x,y);\n }\n vector<ld> bt(m);\n vector<Point> bp(m),bq(m), bv(m);\n rep(i,m){\n cin>>bt[i];\n ld x,vx,vy,l;\n cin>>x>>vx>>vy>>l;\n bv[i]=Point(vx,vy);\n bp[i]=Point(x,0);\n bq[i]=Point(x-l*vx/abs(bv[i]),-l*vy/abs(bv[i]));\n bp[i]-=bt[i]*bv[i];\n bq[i]-=bt[i]*bv[i];\n }\n vector<ld> ans(m,1e9+7);\n ld st = 0;\n rep(i,k+1){\n rep(j,n){\n rep(bi,m){\n if(t[i]<bt[bi])continue;\n Point nxt = p[j]+v[i]-bv[bi];\n if(abs(nxt-p[j])<eps)continue;\n Line l = {p[j],nxt};\n Line bl = {bp[bi],bq[bi]};\n if(!isis_ls(l,bl))continue;\n if(eq(cross(l.a-l.b, bl.a-bl.b),0))continue;\n Point cp = is_ll(l,bl);\n ld ct = st + real((cp-p[j])/(nxt-p[j]));\n if(st-eps<ct&&ct<t[i]+eps&&ct>bt[bi]-eps){\n ans[bi]=min(ans[bi],ct);\n }\n }\n }\n rep(j,n){\n Line s = {p[j],p[(j+1)%n]};\n rep(bi,m){\n if(t[i]<bt[bi])continue;\n Point nxt = bp[bi]-v[i]+bv[bi];\n if(abs(nxt-bp[bi])<eps)continue;\n Line bl = {bp[bi],nxt};\n if(!isis_ls(bl,s))continue;\n if(eq(cross(s.a-s.b, bl.a-bl.b),0))continue;\n Point cp = is_ll(bl,s);\n ld ct = st + real((cp-bp[bi])/(nxt-bp[bi]));\n if(st-eps<ct&&ct<t[i]+eps&&ct>bt[bi]-eps){\n ans[bi]=min(ans[bi],ct);\n }\n }\n rep(bi,m){\n if(t[i]<bt[bi])continue;\n Point nxt = bq[bi]-v[i]+bv[bi];\n if(abs(nxt-bq[bi])<eps)continue;\n Line bl = {bq[bi],nxt};\n if(!isis_ls(bl,s))continue;\n if(eq(cross(s.a-s.b, bl.a-bl.b),0))continue;\n Point cp = is_ll(bl,s);\n ld ct = st + real((cp-bq[bi])/(nxt-bq[bi]));\n if(st-eps<ct&&ct<t[i]+eps&&ct>bt[bi]-eps){\n ans[bi]=min(ans[bi],ct);\n }\n }\n }\n rep(j,n){\n p[j]+=(ld)(t[i]-st)*v[i];\n }\n rep(j,m){\n bp[j]+=(t[i]-st)*bv[j];\n bq[j]+=(t[i]-st)*bv[j];\n }\n st = t[i];\n }\n vector<ld> at;\n rep(i,m){\n if(ans[i]<1e9){\n at.push_back(ans[i]);\n }\n }\n sort(at.begin(),at.end());\n cout<<at.size()<<endl;\n rep(i,at.size()){\n cout<<at[i]<<endl;\n }\n}\n\nint main(){\n int n,k,m;\n cout<<fixed<<setprecision(10);\n while(cin>>n>>k>>m,n!=0)solve(n,k,m);\n}","accuracy":1,"time_ms":130,"memory_kb":3384,"score_of_the_acc":-0.1933,"final_rank":14},{"submission_id":"aoj_2023_3657209","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nusing ll = 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#define F first\n#define S second\n\n\nnamespace Geometry{\n typedef long double D;\n typedef complex<long double> P;\n typedef pair<P,D> C;\n \n const D EPS=1e-9;\n const D PI=asin(1)*2;\n const D INF=1e18;\n \n const static bool comp(const P &p1,const P &p2){return p1.real()==p2.real()?p1.imag()<p2.imag():p1.real()<p2.real();}\n \n D dot(P p1,P p2){return p1.real()*p2.real()+p1.imag()*p2.imag();}\n \n D cross(P p1,P p2){return p1.real()*p2.imag()-p1.imag()*p2.real();}\n \n P project(P vec,P x){return vec*(x/vec).real();}\n \n P project(P p1,P p2,P x){return p1+project(p2-p1,x-p1);}\n \n P reflect(P vec,P x){return vec*conj(x/vec);}\n \n P reflect(P p1,P p2,P x){return p1+reflect(p2-p1,x-p1);}\n \n bool intersectSL(P p1,P p2,P vec){vec/=abs(vec); p1/=vec; p2/=vec; return (p1.imag()<EPS && p2.imag()>-EPS) || (p1.imag()>-EPS && p2.imag()<EPS);}\n \n bool intersectSL(P p1,P p2,P p3,P p4){return intersectSL(p1-p4,p2-p4,p3-p4);}\n \n bool intersectSS(P p1,P p2,P p3,P p4){return (dot(p2-p1,p3-p1)<-EPS && dot(p2-p1,p4-p1)<-EPS) || (dot(p1-p2,p3-p2)<-EPS && dot(p1-p2,p4-p2)<-EPS)?false:intersectSL(p1,p2,p3,p4) && intersectSL(p3,p4,p1,p2);}\n \n D distLP(P vec,P x){return abs((x/vec).imag())*abs(vec);}\n \n D distLP(P p1,P p2,P x){return distLP(p2-p1,x-p1);}\n \n D distSP(P p1,P p2,P x){return dot(p2-p1,x-p1)<-EPS?abs(x-p1):dot(p1-p2,x-p2)<-EPS?abs(x-p2):distLP(p1,p2,x);}\n \n D distSS(P p1,P p2,P p3,P p4){return intersectSS(p1,p2,p3,p4)?0.0:min(min(distSP(p1,p2,p3),distSP(p1,p2,p4)),min(distSP(p3,p4,p1),distSP(p3,p4,p2)));}\n \n P crosspointLL(P p1,P p2,P vec){return abs(cross(p2-p1,vec))<EPS?vec:vec*cross(p2-p1,p2)/cross(p2-p1,vec);}\n \n P crosspointLL(P p1,P p2,P p3,P p4){return p4+crosspointLL(p1-p4,p2-p4,p3-p4);}\n \n P crosspointSS(P p1,P p2,P p3,P p4){return distSP(p1,p2,p3)<EPS?p3:distSP(p1,p2,p4)<EPS?p4:crosspointLL(p1,p2,p3,p4);}\n \n bool intersectShL(P p1,P p2,P vec){vec/=abs(vec); return intersectSL(p1,p2,vec) && crosspointLL(p1/vec,p2/vec,vec/vec).real()>-EPS;}\n \n bool intersectShL(P p1,P p2,P p3,P p4){return intersectShL(p1-p3,p2-p3,p4-p3);}\n \n //1::in,0::on edge,-1::out\n int contain(const vector<P> &poly,const P &p){\n vector<P> A={{65537,96847},{-24061,6701},{56369,-86509},{-93763,-78049},{56957,10007}};\n vector<bool> cnt(5,false);\n for(int i=1;i<=poly.size();i++){\n if(distSP(poly[i-1],poly[i%poly.size()],p)<EPS){return 0;}\n for(int j=0;j<5;j++){\n if(intersectShL(poly[i-1],poly[i%poly.size()],p,p+A[j])){cnt[j]=!cnt[j];}\n }\n }\n int in=0;\n for(int j=0;j<5;j++){if(cnt[j]){in++;}}\n return in>=3?1:-1;\n }\n \n vector<P> convexcut(const vector<P> &poly,P p1,P p2){\n vector<P> ret;\n for(int i=1;i<=poly.size();i++){\n if(cross(p2-p1,poly[i-1]-p1)>-EPS){ret.push_back(poly[i-1]);}\n if(intersectSL(poly[i-1],poly[i%poly.size()],p1,p2) && distLP(p1,p2,poly[i-1])>EPS && distLP(p1,p2,poly[i%poly.size()])>EPS){ret.push_back(crosspointLL(poly[i-1],poly[i%poly.size()],p1,p2));}\n }\n return ret;\n }\n \n D area(const vector<P> &poly){\n D ans=0;\n for(int i=2;i<poly.size();i++){ans+=cross(poly[i-1]-poly[0],poly[i]-poly[0]);}\n return abs(ans)/2;\n }\n \n vector<P> convexhull(vector<P> pts){\n vector<P> ret;\n sort(pts.begin(),pts.end(),comp);\n for(auto &I:pts){\n if(!ret.empty() && I==ret.back()){continue;}\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\n ret.push_back(I);\n }\n reverse(pts.begin(),pts.end());\n for(auto &I:pts){\n if(!ret.empty() && I==ret.back()){continue;}\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\n ret.push_back(I);\n }\n if(ret[0]==ret.back()){ret.pop_back();}\n return ret;\n }\n \n //4::seperate,3::circumscribe,2::intersect,1::inscribe,0::contain,-1::same\n int intersectCC(C c1,C c2){\n D d=abs(c1.F-c2.F),r=c1.S+c2.S,dif=abs(c2.S-c1.S);\n if(d<EPS && dif<EPS){return -1;}\n if(d-r>EPS){return 4;}\n if(d-r>-EPS){return 3;}\n if(d-dif>EPS){return 2;}\n if(d-dif>-EPS){return 1;}\n return 0;\n }\n \n vector<P> crosspointLC(P p1,P p2,C c){\n vector<P> ret;\n P pr=project(p1,p2,c.F);\n D d=distLP(p1,p2,c.F);\n if(d-c.S>EPS){return ret;}\n if(d-c.S>-EPS){ret.push_back(pr); return ret;}\n P vec=p2-p1; vec*=sqrt(c.S*c.S-d*d)/abs(vec);\n ret.push_back(pr-vec);\n ret.push_back(pr+vec);\n return ret;\n }\n \n vector<P> crosspointSC(P p1,P p2,C c){\n vector<P> ret;\n for(auto &I:crosspointLC(p1,p2,c)){if(distSP(p1,p2,I)<EPS){ret.push_back(I);}}\n return ret;\n }\n \n vector<P> crosspointCC(C c1,C c2){\n vector<P> ret;\n P vec=c2.F-c1.F;\n D base=(c1.S*c1.S+norm(vec)-c2.S*c2.S)/(2*abs(vec));\n D h=sqrt(c1.S*c1.S-base*base);\n vec/=abs(vec);\n ret.push_back(c1.F+vec*P(base,h));\n ret.push_back(c1.F+vec*P(base,-h));\n return ret;\n }\n \n vector<P> tangentCP(C c,P p){return crosspointCC(c,C(p,sqrt(norm(c.F-p)-c.S*c.S)));}\n \n vector<pair<P,P>> tangentCC(C c1,C c2){\n vector<pair<P,P>> ret;\n P d=c2.F-c1.F;\n for(D i:{-1,1}){\n D r=c1.S+c2.S*i;\n if(intersectCC(c1,c2)>i+1){\n for(P s:{-1i,1i}){\n P p=r+s*sqrt(norm(d)-norm(r));\n ret.push_back({c1.F+d*c1.S/norm(d)*p,c2.F-d*i*c2.S/norm(d)*p});\n }\n }\n }\n return ret;\n }\n \n D area(const vector<P> &poly,C c){\n D ret=0;\n for(int i=0;i<poly.size();i++){\n P a=poly[i]-c.F,b=poly[(i+1)%poly.size()]-c.F;\n if(abs(a)<c.S+EPS && abs(b)<c.S+EPS){ret+=cross(a,b);}\n else{\n vector<P> A=crosspointSC(a,b,{0,c.S});\n if(A.empty()){ret+=c.S*c.S*arg(b/a);}\n else{\n ret+=(abs(a)<c.S?cross(a,A[0]):c.S*c.S*arg(A[0]/a));\n ret+=(abs(b)<c.S?cross(A.back(),b):c.S*c.S*arg(b/A.back()));\n ret+=cross(A[0],A.back());\n }\n }\n }\n return abs(ret)/2;\n }\n \n //反時計回り\n D diameter(const vector<P> &poly){\n D ret=0;\n ll l=0,r=0,n=poly.size();\n if(n==2){return abs(poly[0]-poly[1]);}\n for(int i=0;i<n;i++){\n if(comp(poly[l],poly[i])){l=i;}\n if(comp(poly[i],poly[r])){r=i;}\n }\n ll sl=r,sr=l;\n while(sl!=l || sr!=r){\n ret=max(ret,abs(poly[r]-poly[l]));\n if(cross(poly[(l+1)%n]-poly[l],poly[(r+1)%n]-poly[r])<0){(++l)%=n;}\n else{(++r)%=n;}\n }\n return ret;\n }\n \n D closestpair(vector<P> pt){\n sort(pt.begin(),pt.end(),comp);\n D ret=INF;\n for(ll i=1;i<pt.size();i<<=1){\n for(ll j=0;i+j<pt.size();j+=i*2){\n ll m=i+j;\n vector<P> R;\n D l=-INF,r=INF;\n for(ll k=j;k<m;k++){l=max(l,pt[k].real());}\n for(ll k=0;m+k<pt.size() && k<i;k++){r=min(r,pt[m+k].real());}\n for(ll k=0;m+k<pt.size() && k<i;k++){if(pt[m+k].real()-l<ret){R.push_back(pt[m+k]);}}\n ll idx=0;\n for(ll k=j;k<m;k++){\n if(r-pt[k].real()>ret){continue;}\n while(idx<R.size() && pt[k].imag()-R[idx].imag()>ret){idx++;}\n for(ll n=idx;n<R.size() && R[n].imag()-pt[k].imag()<ret;n++){ret=min(ret,abs(R[n]-pt[k]));}\n }\n inplace_merge(pt.begin()+j,pt.begin()+m,j+i*2<pt.size()?pt.begin()+j+2*i:pt.end(),[](const P &a,const P &b){return a.imag()==b.imag()?a.real()<b.real():a.imag()<b.imag();});\n }\n }\n return ret;\n }\n \n istream & operator >> (istream &i,P &p){D x,y; i>>x>>y; p={x,y}; return i;}\n istream & operator >> (istream &i,C &p){D x,y; i>>x>>y>>p.S; p.F={x,y}; return i;}\n};\nusing namespace Geometry;\nbool contain(P p,vector<P> &poly){\n D a=0;\n if(area(poly)<EPS){return false;}\n for(int i=1;i<=poly.size();i++){\n a+=area({p,poly[i-1],poly[i%poly.size()]});\n }\n return abs(a-area(poly))<EPS;\n}\n\n\n\nvector<P> sqar(pair<P,P> L,P vec,D t){\n return {L.F,L.S,L.S+vec*t,L.F+vec*t};\n}\n\nbool intersectPP(vector<P> poly,vector<P> me){\n for(int i=1;i<=me.size();i++){\n if(contain(poly,me[i-1])!=-1){return true;}\n for(int j=1;j<=poly.size();j++){\n //if(intersect({poly[j-1],poly[j%poly.size()]},{me[i-1],me[i%me.size()]},true)){return true;}\n if(intersectSS(poly[j-1],poly[j%poly.size()],me[i-1],me[i%me.size()])){return true;}\n }\n }\n return false;\n}\n\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n ll n,m,b;\n while(cin>>n>>m>>b,n){\n vector<P> A(n);\n for(auto &I:A){\n D x,y;\n cin>>x>>y;\n I={x,y};\n }\n vector<pair<P,D>> V(m);\n for(auto &I:V){\n D x,y;\n cin>>I.S>>x>>y;\n I.F={x,y};\n }\n \n V.push_back({{0,0},INF});\n vector<pair<pair<P,P>,P>> L(b);\n for(auto &I:L){\n D t,X,x,y,l;\n cin>>t>>X>>x>>y>>l;\n I.F.F=P(X,0);\n I.S={x,y};\n I.F.S=I.F.F-I.S/abs(I.S)*l;\n I.F.F-=I.S*t;\n I.F.S-=I.S*t;\n }\n for(ll i=m-1;i>0;i--){V[i].S-=V[i-1].S;}\n vector<D> ans(b,INF*2);\n \n for(int i=0;i<b;i++){\n pair<P,P> l=L[i].F;\n D time=0;\n for(auto &I:V){\n P vec=L[i].S-I.F;\n auto judge=[&](D t){return intersectPP(sqar(l,vec,t),A);};\n if(!judge(I.S)){\n\ttime+=I.S;\n\tl.F+=vec*I.S;\n\tl.S+=vec*I.S;\n\tcontinue;\n }\n D lf=0,rg=I.S;\n for(int k=0;k<100;k++){\n\tD m=(lf+rg)/2;\n\tif(judge(m)){rg=m;}\n\telse{lf=m;}\n }\n ans[i]=lf+time;\n // cout<<i<<\" \"<<I.F<<\" \"<<I.S<<\" \"<<lf<<\" \"<<time<<endl;\n break;\n }\n }\n sort(ans.begin(),ans.end());\n ll cnt=0;\n for(auto &I:ans){if(I<INF){cnt++;}}\n cout<<cnt<<endl;\n if(cnt==6&&ans[0]<EPS){\n //cerr<<n<<\" \"<<m<<\" \"<<b<<endl;\n }\n for(int i=0;i<cnt;i++){\n cout<<fixed<<setprecision(12)<<ans[i]<<endl;\n }\n } \n return 0;\n}","accuracy":1,"time_ms":2900,"memory_kb":3308,"score_of_the_acc":-0.6195,"final_rank":18},{"submission_id":"aoj_2023_3657205","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nusing ll = 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#define F first\n#define S second\n\n\nnamespace Geometry{\n typedef long double D;\n typedef complex<long double> P;\n typedef pair<P,D> C;\n \n const D EPS=1e-9;\n const D PI=asin(1)*2;\n const D INF=1e18;\n \n const static bool comp(const P &p1,const P &p2){return p1.real()==p2.real()?p1.imag()<p2.imag():p1.real()<p2.real();}\n \n D dot(P p1,P p2){return p1.real()*p2.real()+p1.imag()*p2.imag();}\n \n D cross(P p1,P p2){return p1.real()*p2.imag()-p1.imag()*p2.real();}\n \n P project(P vec,P x){return vec*(x/vec).real();}\n \n P project(P p1,P p2,P x){return p1+project(p2-p1,x-p1);}\n \n P reflect(P vec,P x){return vec*conj(x/vec);}\n \n P reflect(P p1,P p2,P x){return p1+reflect(p2-p1,x-p1);}\n \n bool intersectSL(P p1,P p2,P vec){vec/=abs(vec); p1/=vec; p2/=vec; return (p1.imag()<EPS && p2.imag()>-EPS) || (p1.imag()>-EPS && p2.imag()<EPS);}\n \n bool intersectSL(P p1,P p2,P p3,P p4){return intersectSL(p1-p4,p2-p4,p3-p4);}\n \n bool intersectSS(P p1,P p2,P p3,P p4){return (dot(p2-p1,p3-p1)<-EPS && dot(p2-p1,p4-p1)<-EPS) || (dot(p1-p2,p3-p2)<-EPS && dot(p1-p2,p4-p2)<-EPS)?false:intersectSL(p1,p2,p3,p4) && intersectSL(p3,p4,p1,p2);}\n \n D distLP(P vec,P x){return abs((x/vec).imag())*abs(vec);}\n \n D distLP(P p1,P p2,P x){return distLP(p2-p1,x-p1);}\n \n D distSP(P p1,P p2,P x){return dot(p2-p1,x-p1)<-EPS?abs(x-p1):dot(p1-p2,x-p2)<-EPS?abs(x-p2):distLP(p1,p2,x);}\n \n D distSS(P p1,P p2,P p3,P p4){return intersectSS(p1,p2,p3,p4)?0.0:min(min(distSP(p1,p2,p3),distSP(p1,p2,p4)),min(distSP(p3,p4,p1),distSP(p3,p4,p2)));}\n \n P crosspointLL(P p1,P p2,P vec){return abs(cross(p2-p1,vec))<EPS?vec:vec*cross(p2-p1,p2)/cross(p2-p1,vec);}\n \n P crosspointLL(P p1,P p2,P p3,P p4){return p4+crosspointLL(p1-p4,p2-p4,p3-p4);}\n \n P crosspointSS(P p1,P p2,P p3,P p4){return distSP(p1,p2,p3)<EPS?p3:distSP(p1,p2,p4)<EPS?p4:crosspointLL(p1,p2,p3,p4);}\n \n bool intersectShL(P p1,P p2,P vec){vec/=abs(vec); return intersectSL(p1,p2,vec) && crosspointLL(p1/vec,p2/vec,vec/vec).real()>-EPS;}\n \n bool intersectShL(P p1,P p2,P p3,P p4){return intersectShL(p1-p3,p2-p3,p4-p3);}\n \n //1::in,0::on edge,-1::out\n int contain(const vector<P> &poly,const P &p){\n vector<P> A={{65537,96847},{-24061,6701},{56369,-86509},{-93763,-78049},{56957,10007}};\n vector<bool> cnt(5,false);\n for(int i=1;i<=poly.size();i++){\n if(distSP(poly[i-1],poly[i%poly.size()],p)<EPS){return 0;}\n for(int j=0;j<5;j++){\n if(intersectShL(poly[i-1],poly[i%poly.size()],p,p+A[j])){cnt[j]=!cnt[j];}\n }\n }\n int in=0;\n for(int j=0;j<5;j++){if(cnt[j]){in++;}}\n return in>=3?1:-1;\n }\n \n vector<P> convexcut(const vector<P> &poly,P p1,P p2){\n vector<P> ret;\n for(int i=1;i<=poly.size();i++){\n if(cross(p2-p1,poly[i-1]-p1)>-EPS){ret.push_back(poly[i-1]);}\n if(intersectSL(poly[i-1],poly[i%poly.size()],p1,p2) && distLP(p1,p2,poly[i-1])>EPS && distLP(p1,p2,poly[i%poly.size()])>EPS){ret.push_back(crosspointLL(poly[i-1],poly[i%poly.size()],p1,p2));}\n }\n return ret;\n }\n \n D area(const vector<P> &poly){\n D ans=0;\n for(int i=2;i<poly.size();i++){ans+=cross(poly[i-1]-poly[0],poly[i]-poly[0]);}\n return abs(ans)/2;\n }\n \n vector<P> convexhull(vector<P> pts){\n vector<P> ret;\n sort(pts.begin(),pts.end(),comp);\n for(auto &I:pts){\n if(!ret.empty() && I==ret.back()){continue;}\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\n ret.push_back(I);\n }\n reverse(pts.begin(),pts.end());\n for(auto &I:pts){\n if(!ret.empty() && I==ret.back()){continue;}\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\n ret.push_back(I);\n }\n if(ret[0]==ret.back()){ret.pop_back();}\n return ret;\n }\n \n //4::seperate,3::circumscribe,2::intersect,1::inscribe,0::contain,-1::same\n int intersectCC(C c1,C c2){\n D d=abs(c1.F-c2.F),r=c1.S+c2.S,dif=abs(c2.S-c1.S);\n if(d<EPS && dif<EPS){return -1;}\n if(d-r>EPS){return 4;}\n if(d-r>-EPS){return 3;}\n if(d-dif>EPS){return 2;}\n if(d-dif>-EPS){return 1;}\n return 0;\n }\n \n vector<P> crosspointLC(P p1,P p2,C c){\n vector<P> ret;\n P pr=project(p1,p2,c.F);\n D d=distLP(p1,p2,c.F);\n if(d-c.S>EPS){return ret;}\n if(d-c.S>-EPS){ret.push_back(pr); return ret;}\n P vec=p2-p1; vec*=sqrt(c.S*c.S-d*d)/abs(vec);\n ret.push_back(pr-vec);\n ret.push_back(pr+vec);\n return ret;\n }\n \n vector<P> crosspointSC(P p1,P p2,C c){\n vector<P> ret;\n for(auto &I:crosspointLC(p1,p2,c)){if(distSP(p1,p2,I)<EPS){ret.push_back(I);}}\n return ret;\n }\n \n vector<P> crosspointCC(C c1,C c2){\n vector<P> ret;\n P vec=c2.F-c1.F;\n D base=(c1.S*c1.S+norm(vec)-c2.S*c2.S)/(2*abs(vec));\n D h=sqrt(c1.S*c1.S-base*base);\n vec/=abs(vec);\n ret.push_back(c1.F+vec*P(base,h));\n ret.push_back(c1.F+vec*P(base,-h));\n return ret;\n }\n \n vector<P> tangentCP(C c,P p){return crosspointCC(c,C(p,sqrt(norm(c.F-p)-c.S*c.S)));}\n \n vector<pair<P,P>> tangentCC(C c1,C c2){\n vector<pair<P,P>> ret;\n P d=c2.F-c1.F;\n for(D i:{-1,1}){\n D r=c1.S+c2.S*i;\n if(intersectCC(c1,c2)>i+1){\n for(P s:{-1i,1i}){\n P p=r+s*sqrt(norm(d)-norm(r));\n ret.push_back({c1.F+d*c1.S/norm(d)*p,c2.F-d*i*c2.S/norm(d)*p});\n }\n }\n }\n return ret;\n }\n \n D area(const vector<P> &poly,C c){\n D ret=0;\n for(int i=0;i<poly.size();i++){\n P a=poly[i]-c.F,b=poly[(i+1)%poly.size()]-c.F;\n if(abs(a)<c.S+EPS && abs(b)<c.S+EPS){ret+=cross(a,b);}\n else{\n vector<P> A=crosspointSC(a,b,{0,c.S});\n if(A.empty()){ret+=c.S*c.S*arg(b/a);}\n else{\n ret+=(abs(a)<c.S?cross(a,A[0]):c.S*c.S*arg(A[0]/a));\n ret+=(abs(b)<c.S?cross(A.back(),b):c.S*c.S*arg(b/A.back()));\n ret+=cross(A[0],A.back());\n }\n }\n }\n return abs(ret)/2;\n }\n \n //反時計回り\n D diameter(const vector<P> &poly){\n D ret=0;\n ll l=0,r=0,n=poly.size();\n if(n==2){return abs(poly[0]-poly[1]);}\n for(int i=0;i<n;i++){\n if(comp(poly[l],poly[i])){l=i;}\n if(comp(poly[i],poly[r])){r=i;}\n }\n ll sl=r,sr=l;\n while(sl!=l || sr!=r){\n ret=max(ret,abs(poly[r]-poly[l]));\n if(cross(poly[(l+1)%n]-poly[l],poly[(r+1)%n]-poly[r])<0){(++l)%=n;}\n else{(++r)%=n;}\n }\n return ret;\n }\n \n D closestpair(vector<P> pt){\n sort(pt.begin(),pt.end(),comp);\n D ret=INF;\n for(ll i=1;i<pt.size();i<<=1){\n for(ll j=0;i+j<pt.size();j+=i*2){\n ll m=i+j;\n vector<P> R;\n D l=-INF,r=INF;\n for(ll k=j;k<m;k++){l=max(l,pt[k].real());}\n for(ll k=0;m+k<pt.size() && k<i;k++){r=min(r,pt[m+k].real());}\n for(ll k=0;m+k<pt.size() && k<i;k++){if(pt[m+k].real()-l<ret){R.push_back(pt[m+k]);}}\n ll idx=0;\n for(ll k=j;k<m;k++){\n if(r-pt[k].real()>ret){continue;}\n while(idx<R.size() && pt[k].imag()-R[idx].imag()>ret){idx++;}\n for(ll n=idx;n<R.size() && R[n].imag()-pt[k].imag()<ret;n++){ret=min(ret,abs(R[n]-pt[k]));}\n }\n inplace_merge(pt.begin()+j,pt.begin()+m,j+i*2<pt.size()?pt.begin()+j+2*i:pt.end(),[](const P &a,const P &b){return a.imag()==b.imag()?a.real()<b.real():a.imag()<b.imag();});\n }\n }\n return ret;\n }\n \n istream & operator >> (istream &i,P &p){D x,y; i>>x>>y; p={x,y}; return i;}\n istream & operator >> (istream &i,C &p){D x,y; i>>x>>y>>p.S; p.F={x,y}; return i;}\n};\nusing namespace Geometry;\nbool contain(P p,vector<P> &poly){\n D a=0;\n if(area(poly)<EPS){return false;}\n for(int i=1;i<=poly.size();i++){\n a+=area({p,poly[i-1],poly[i%poly.size()]});\n }\n return abs(a-area(poly))<EPS;\n}\n\n\n\nvector<P> sqar(pair<P,P> L,P vec,D t){\n return {L.F,L.S,L.S+vec*t,L.F+vec*t};\n}\n\nbool intersectPP(vector<P> poly,vector<P> me){\n for(int i=1;i<=me.size();i++){\n if(contain(me[i-1],poly)){return true;}\n for(int j=1;j<=poly.size();j++){\n //if(intersect({poly[j-1],poly[j%poly.size()]},{me[i-1],me[i%me.size()]},true)){return true;}\n if(intersectSS(poly[j-1],poly[j%poly.size()],me[i-1],me[i%me.size()])){return true;}\n }\n }\n return false;\n}\n\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n ll n,m,b;\n while(cin>>n>>m>>b,n){\n vector<P> A(n);\n for(auto &I:A){\n D x,y;\n cin>>x>>y;\n I={x,y};\n }\n vector<pair<P,D>> V(m);\n for(auto &I:V){\n D x,y;\n cin>>I.S>>x>>y;\n I.F={x,y};\n }\n \n V.push_back({{0,0},INF});\n vector<pair<pair<P,P>,P>> L(b);\n for(auto &I:L){\n D t,X,x,y,l;\n cin>>t>>X>>x>>y>>l;\n I.F.F=P(X,0);\n I.S={x,y};\n I.F.S=I.F.F-I.S/abs(I.S)*l;\n I.F.F-=I.S*t;\n I.F.S-=I.S*t;\n }\n for(ll i=m-1;i>0;i--){V[i].S-=V[i-1].S;}\n vector<D> ans(b,INF*2);\n \n for(int i=0;i<b;i++){\n pair<P,P> l=L[i].F;\n D time=0;\n for(auto &I:V){\n P vec=L[i].S-I.F;\n auto judge=[&](D t){return intersectPP(sqar(l,vec,t),A);};\n if(!judge(I.S)){\n\ttime+=I.S;\n\tl.F+=vec*I.S;\n\tl.S+=vec*I.S;\n\tcontinue;\n }\n D lf=0,rg=I.S;\n for(int k=0;k<100;k++){\n\tD m=(lf+rg)/2;\n\tif(judge(m)){rg=m;}\n\telse{lf=m;}\n }\n ans[i]=lf+time;\n // cout<<i<<\" \"<<I.F<<\" \"<<I.S<<\" \"<<lf<<\" \"<<time<<endl;\n break;\n }\n }\n sort(ans.begin(),ans.end());\n ll cnt=0;\n for(auto &I:ans){if(I<INF){cnt++;}}\n cout<<cnt<<endl;\n if(cnt==6&&ans[0]<EPS){\n //cerr<<n<<\" \"<<m<<\" \"<<b<<endl;\n }\n for(int i=0;i<cnt;i++){\n cout<<fixed<<setprecision(12)<<ans[i]<<endl;\n }\n } \n return 0;\n}","accuracy":1,"time_ms":340,"memory_kb":3296,"score_of_the_acc":-0.2192,"final_rank":16},{"submission_id":"aoj_2023_3657182","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nusing ll = 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#define F first\n#define S second\n\nnamespace Geometry{\n\n typedef long double D;\n typedef complex<long double> P;\n typedef pair<P, D> C;\n\n const D EPS = 1e-8;\n const D PI = asin(1) * 2;\n const D INF = 1e18;\n \n D dot(P p1, P p2){\n return p1.real() * p2.real() + p1.imag() * p2.imag();\n }\n\n D cross(P p1, P p2){\n return p1.real() * p2.imag() - p1.imag() * p2.real();\n }\n\n D area(const vector<P> poly){\n D ans = 0;\n for(int i=2;i<(int)poly.size();i++)\n ans += cross(poly[i-1] - poly[0], poly[i] - poly[0]);\n return abs(ans)/2;\n }\n\n bool intersectSL(P p1, P p2, P vec){\n vec /= abs(vec); p1 /= vec, p2/= vec;\n return\n (p1.imag() < EPS && p2.imag() >= -EPS) ||\n (p1.imag() > -EPS && p2.imag() < EPS);\n }\n bool intersectSL(P p1, P p2, P p3, P p4){\n return intersectSL(p1 - p4, p2 - p4, p3 - p4);\n }\n\n bool intersectSS(P p1, P p2, P p3, P p4){\n return\n (dot(p2 -p1, p3 - p1) < -EPS && dot(p2 - p1, p4 - p1) < -EPS) ||\n\t\t\t (dot(p1-p2, p3 - p2) < -EPS && dot(p1 - p2, p4 - p2) < -EPS)? false:intersectSL(p1, p2, p3, p4) && intersectSL(p3, p4, p1, p2);\t\t \t\t\t }\n D distLP(P vec, P x){\n return abs((x/vec).imag()) * abs(vec);\n }\n\n D distLP(P p1, P p2, P x){return distLP(p2 - p1, x - p1);}\n \n D distSP(P p1, P p2, P x){\n return dot(p2 - p1, x - p1) < -EPS?\n\t\t\t\t abs(x-p1):dot(p1 - p2, x - p2) < -EPS? abs(x - p2):distLP(p1, p2, x);\n }\n\n P crosspointLL(P p1, P p2, P vec){return abs(cross(p2 - p1, vec)) < EPS? vec: vec * cross(p2 - p1, p2)/ cross(p2 - p1, vec);}\n P crosspointLL(P p1, P p2, P p3, P p4){return p4 + crosspointLL(p1 - p4, p2 - p4, p3 - p4);}\n \n P crosspointSS(P p1, P p2, P p3, P p4){\n return distSP(p1, p2, p3) < EPS? p3:distSP(p1, p2, p4)<EPS? p4:crosspointLL(p1, p2, p3, p4);\n }\n \n};\nusing namespace Geometry;\ntypedef long double GType;\ntypedef std::complex<GType> Point;\ntypedef std::pair<Point, Point> Segment;\nint ccw(const Point& p1, const Point& p2, const Point& p3) {\n Point v1 = p2 - p1, v2 = p3 - p1;\n if (cross(v1, v2) > EPS) return +1;\n if (cross(v1, v2) < -EPS) return -1;\n if (dot(v1, v2) < -EPS) return +2;\n if (std::norm(v1) < std::norm(v2)) return -2;\n return 0;\n}\n \n// ------ Functions Level 2 ------ //\nbool intersect(const Segment& s1, const Point& p1, bool segflag) {\n if (!segflag) return std::abs(cross(s1.second - p1, s1.first - p1)) < EPS;\n return (std::abs(s1.first - p1) + std::abs(s1.second - p1) - std::abs(s1.second - s1.first)) < EPS;\n}\nbool intersect(const Segment& s1, const Segment& s2, bool segflag) {\n if (!segflag) return cross(s1.second - s1.first, s2.first - s1.first) * cross(s1.second - s1.first, s2.second - s1.first) < EPS;\n return (ccw(s1.first, s1.second, s2.first) * ccw(s1.first, s1.second, s2.second)) <= 0 && (ccw(s2.first, s2.second, s1.first) * ccw(s2.first, s2.second, s1.second)) <= 0;\n}\n\n\n\nbool contain(P p,vector<P> &poly){\n D a=0;\n if(area(poly)<EPS){return false;}\n for(int i=1;i<=poly.size();i++){\n a+=area({p,poly[i-1],poly[i%poly.size()]});\n }\n return abs(a-area(poly))<EPS;\n}\nvector<P> sqar(pair<P,P> L,P vec,D t){\n return {L.F,L.S,L.S+vec*t,L.F+vec*t};\n}\n\nbool intersectPP(vector<P> poly,vector<P> me){\n for(int i=1;i<=me.size();i++){\n if(contain(me[i-1],poly)){return true;}\n for(int j=1;j<=poly.size();j++){\n //if(intersect({poly[j-1],poly[j%poly.size()]},{me[i-1],me[i%me.size()]},true)){return true;}\n if(intersectSS(poly[j-1],poly[j%poly.size()],me[i-1],me[i%me.size()])){return true;}\n }\n }\n return false;\n}\n\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n ll n,m,b;\n while(cin>>n>>m>>b,n){\n vector<P> A(n);\n for(auto &I:A){\n D x,y;\n cin>>x>>y;\n I={x,y};\n }\n vector<pair<P,D>> V(m);\n for(auto &I:V){\n D x,y;\n cin>>I.S>>x>>y;\n I.F={x,y};\n }\n \n V.push_back({{0,0},INF});\n vector<pair<pair<P,P>,P>> L(b);\n for(auto &I:L){\n D t,X,x,y,l;\n cin>>t>>X>>x>>y>>l;\n I.F.F=P(X,0);\n I.S={x,y};\n I.F.S=I.F.F-I.S/abs(I.S)*l;\n I.F.F-=I.S*t;\n I.F.S-=I.S*t;\n }\n for(ll i=m-1;i>0;i--){V[i].S-=V[i-1].S;}\n vector<D> ans(b,INF*2);\n \n for(int i=0;i<b;i++){\n pair<P,P> l=L[i].F;\n D time=0;\n for(auto &I:V){\n P vec=L[i].S-I.F;\n auto judge=[&](D t){return intersectPP(sqar(l,vec,t),A);};\n if(!judge(I.S)){\n\ttime+=I.S;\n\tl.F+=vec*I.S;\n\tl.S+=vec*I.S;\n\tcontinue;\n }\n D lf=0,rg=I.S;\n for(int k=0;k<100;k++){\n\tD m=(lf+rg)/2;\n\tif(judge(m)){rg=m;}\n\telse{lf=m;}\n }\n ans[i]=lf+time;\n // cout<<i<<\" \"<<I.F<<\" \"<<I.S<<\" \"<<lf<<\" \"<<time<<endl;\n break;\n }\n }\n sort(ans.begin(),ans.end());\n ll cnt=0;\n for(auto &I:ans){if(I<INF){cnt++;}}\n cout<<cnt<<endl;\n if(cnt==6&&ans[0]<EPS){\n //cerr<<n<<\" \"<<m<<\" \"<<b<<endl;\n }\n for(int i=0;i<cnt;i++){\n cout<<fixed<<setprecision(12)<<ans[i]<<endl;\n }\n } \n return 0;\n}","accuracy":1,"time_ms":430,"memory_kb":3308,"score_of_the_acc":-0.2342,"final_rank":17},{"submission_id":"aoj_2023_3127463","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\nusing namespace std;\n\nconst double EPS = 1e-6;\nconst double INF = 1e12;\nconst double PI = acos(-1);\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\n\ntypedef complex<double> P;\ntypedef vector<P> VP;\nstruct L : array<P, 2>{\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\n L(){}\n};\nnamespace std{\n bool operator < (const P& a, const P& b){\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\n }\n bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){\n return (conj(a)*b).X;\n}\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\n}\nint ccw(P a, P b, P c){\n b -= a;\n c -= a;\n if(cross(b,c) > EPS) return +1; //ccw\n if(cross(b,c) < -EPS) return -1; //cw\n if(dot(b,c) < -EPS) return +2; //c-a-b\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\n return 0; //a-c-b\n}\nP unit(const P &p){\n return p/abs(p);\n}\n\nbool intersectSS(const L& a, const L& b){\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\n}\n\nbool isParallel(const P &a, const P &b){\n return abs(cross(a,b)) < EPS;\n}\nbool isParallel(const L &a, const L &b){\n return isParallel(a[1]-a[0], b[1]-b[0]);\n}\n\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1]-l[0], m[1]-m[0]);\n double B = cross(l[1]-l[0], l[1]-m[0]);\n return m[0] + B/A *(m[1]-m[0]);\n}\n\nint main(){\n while(1){\n int n,m,b;\n cin >> n >> m >> b;\n if(n == 0) break;\n\n VP poly(n);\n for(int i=0; i<n; i++){\n double vx,vy;\n cin >> vx >> vy;\n poly[i] = P(vx, vy);\n }\n \n vector<double> ts(m+1);\n VP vs(m+1);\n for(int i=0; i<m; i++){\n double vx,vy;\n cin >> ts[i] >> vx >> vy;\n vs[i] = P(vx, vy);\n }\n //指示終了後は停止し続ける\n ts[m] = INF;\n vs[m] = P(0, 0);\n m++;\n\n vector<double> tg(b), lg(b);\n VP inig(b), vg(b);\n for(int i=0; i<b; i++){\n double xi,vx,vy;\n cin >> tg[i] >> xi >> vx >> vy >> lg[i];\n inig[i] = P(xi, 0);\n vg[i] = P(vx, vy);\n }\n //ここまで入力\n\n vector<double> ans;\n for(int bullet=0; bullet<b; bullet++){\n P poss(0, 0), posb = inig[bullet];\n for(int move=0; move<m; move++){\n double time = 0;\n if(move!=0) time = ts[move-1];\n //まだ始まってない\n if(tg[bullet] +EPS > ts[move]){\n poss += (ts[move] -time) *vs[move];\n continue;\n }\n //区間の途中で弾丸が発射されるとき\n if(tg[bullet] > time +EPS){\n poss += (tg[bullet] -time) *vs[move];\n time = tg[bullet];\n }\n \n L bul(posb, posb +lg[bullet]*unit(-vg[bullet]));\n double mintime = INF;\n //多角形の頂点が弾丸に衝突\n for(int i=0; i<n; i++){\n P p = poss +poly[i];\n L locus;\n locus[0] = p;\n locus[1] = p +(ts[move] -time) *(vs[move] -vg[bullet]);\n if(!isParallel(bul, locus) && intersectSS(bul, locus)){\n P cp = crosspointLL(bul, locus);\n double ratio = abs(cp -locus[0]) /abs(locus[1] -locus[0]);\n mintime = min(mintime, time +ratio *(ts[move] -time));\n }\n }\n //弾丸の端点が多角形の辺に衝突\n for(int d=0; d<2; d++){\n L locus;\n locus[0] = bul[d];\n locus[1] = bul[d] +(ts[move] -time) *(vg[bullet] -vs[move]);\n for(int i=0; i<n; i++){\n L edge(poss +poly[i], poss +poly[(i+1)%n]);\n if(!isParallel(edge, locus) && intersectSS(edge, locus)){\n P cp = crosspointLL(edge, locus);\n double ratio = abs(cp -locus[0]) /abs(locus[1] -locus[0]);\n mintime = min(mintime, time +ratio *(ts[move] -time));\n }\n }\n }\n if(mintime != INF){\n ans.push_back(mintime);\n break;\n }\n\n //位置の更新\n poss += (ts[move] -time) *vs[move];\n posb += (ts[move] -time) *vg[bullet];\n }\n }\n sort(ans.begin(), ans.end());\n cout << fixed << setprecision(5);\n cout << ans.size() << endl;\n for(int i=0; i<(int)ans.size(); i++){\n cout << ans[i] << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3280,"score_of_the_acc":-0.168,"final_rank":9},{"submission_id":"aoj_2023_1373907","code_snippet":"#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <climits>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <set>\n#include <map>\n#include <iostream>\n#include <deque>\n#include <complex>\n#include <string>\n#include <iomanip>\n#include <sstream>\n#include <bitset>\n#include <valarray>\n#include <unordered_map>\n#include <iterator>\n#include <functional>\n#include <cassert>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned int uint;\ntypedef unsigned char uchar;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\n\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define REPS(i,x) for(int i=1;i<=(int)(x);i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RREPS(i,x) for(int i=((int)(x));i>0;i--)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\n#define ALL(container) (container).begin(), (container).end()\n#define RALL(container) (container).rbegin(), (container).rend()\n#define SZ(container) ((int)container.size())\n#define mp(a,b) make_pair(a, b)\n#define pb push_back\n#define eb emplace_back\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"[\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"]\"; return os;\n}\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\nos<<\"{\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"}\"; return os;\n}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\ntemplate<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}\ntemplate<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}\n\nnamespace geom{\n#define X real()\n#define Y imag()\n#define at(i) ((*this)[i])\n#define SELF (*this)\n\tenum {TRUE = 1, FALSE = 0, BORDER = -1};\n\ttypedef int BOOL;\n\ttypedef double R;\n\tconst R INF = 1e8;\n\tR EPS = 1e-4;\n\tconst R PI = 3.1415926535897932384626;\n\tinline int sig(const R &x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }\n\tinline BOOL less(const R &x, const R &y) {return sig(x-y) ? x < y : BORDER;}\n\ttypedef complex<R> P;\n\tinline R norm(const P &p){return p.X*p.X+p.Y*p.Y;}\n\tinline R inp(const P& a, const P& b){return (conj(a)*b).X;}\n\tinline R outp(const P& a, const P& b){return (conj(a)*b).Y;}\n\tinline P unit(const P& p){return p/abs(p);}\n\tinline P proj(const P &s, const P &t){return t*inp(s, t)/norm(t);}\n\tinline int ccw(const P &s, const P &t, const P &p, int adv=0){\n\t\tint res = sig(outp(t-s, p-s));\n\t\tif(res || !adv) return res;\n\t\tif(sig(inp(t-s, p-s)) < 0) return -2;\t// p-s-t\n\t\tif(sig(inp(s-t, p-t)) < 0) return 2;\t// s-t-p\n\t\treturn 0;\t\t\t\t\t\t\t\t// s-p-t\n\t}\n\t\n\t\n\tstruct L : public vector<P>{\t// line\n\t\tL(const P &p1, const P &p2){this->push_back(p1);this->push_back(p2);}\n\t\tL(){}\n\t\tP dir()const {return at(1) - at(0);}\n\t\tBOOL online(const P &p)const {return !sig(outp(p-at(0), dir()));}\n\t};\n\tstruct S : public L{\t// segment\n\t\tS(const P &p1, const P &p2):L(p1, p2){}\n\t\tS(){}\n\t\tBOOL online(const P &p)const {\n\t\t\tif(!sig(norm(p - at(0))) || !sig(norm(p - at(1)))) return BORDER;\n\t\t\t// ??§?¨????????????¨EPS???????????§??????????????????????????¨???\n\t\t\treturn !sig(outp(p-at(0), dir())) && inp(p-at(0), dir()) > EPS && inp(p-at(1), -dir()) > -EPS;\n\t\t\t//return !sig(abs(at(0)-p) + abs(at(1) - p) - abs(at(0) - at(1)));\n\t\t}\n\t};\n\tstruct C : public P{\n\t\tC(){}\n\t\tC(const P& p, const R r):P(p), r(r){}\n\t\tR r;\n\t\tBOOL inside(const P& p)const { return less(norm(p-SELF), r*r);}\n\t};\n\n\tinline P proj(const P &s, const L &t){return t[0] + proj(s-t[0], t[1]-t[0]);}\n\tinline P reflect(const P &s, const L &t){return (R)2.*proj(s, t) - s;}\n\tinline S reflect(const S &s, const L &t){return S(reflect(s[0], t), reflect(s[1], t));}\n\tBOOL intersect(const S &s, const S &t){\n\t\tconst int p = ccw(t[0], t[1], s[0], 1) * ccw(t[0], t[1], s[1], 1);\n\t\tconst int q = ccw(s[0], s[1], t[0], 1) * ccw(s[0], s[1], t[1], 1);\n\t\treturn (p>0||q>0) ? FALSE : (!p||!q) ? BORDER : TRUE;\n\t}\n\tBOOL intersect(const S &s, const L &l){\n\t\tif(l.online(s[0]) || l.online(s[1])) return BORDER;\n\t\treturn (sig(outp(l.dir(), s[0]-l[0])) * sig(outp(l.dir(), s[1]-l[0])) <= 0);\n\t}\n\tR dist2(const L &l, const P &p){return norm(outp(l.dir(), p - l[0])) / norm(l.dir());}\n\tR dist2(const S &s, const P &p){\n\t\tif(inp(p-s[0], s.dir()) < EPS) return norm(p - s[0]);\n\t\tif(inp(p-s[1], -s.dir()) < EPS) return norm(p - s[1]);\n\t\treturn dist2((const L &)s, p);\n\t}\n\tR dist2(const S &s, const L &l){\n\t\treturn intersect(s, l) ? .0 : min(dist2(l, s[0]), dist2(l, s[1]));\n\t}\n\tR dist2(const S &s, const S &t){\n\t\treturn intersect(s, t) ? .0 : min(min(dist2(s, t[0]), dist2(t, s[0])), \n\t\t\t\t\t\t\t\t\t \t min(dist2(s, t[1]), dist2(t, s[1])));\n\t}\n\ttemplate<class S, class T> R dist(const S& s, const T& t){return sqrt(dist2(s, t));}\n\tinline BOOL intersect(const C &a, const C &b){\n\t\treturn less((a.r-b.r)*(a.r-b.r), norm(a-b)) + less(norm(a-b), (a.r+b.r)*(a.r+b.r)) - 1;\n\t}\n\tinline P crosspoint(const L &l, const L &m){\n\t\tR A = outp(l.dir(), m.dir()), B = outp(l.dir(), l[1] - m[0]);\n\t\tif(!sig(abs(A)) && !sig(abs(B))) return m[0]; // same line\n\t\tif(abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n\t\treturn m[0] + B / A * (m[1] - m[0]);\n\t}\n\t\n\ttemplate<class Func> R simpson(R s, R t, Func func){\n\t\treturn (t-s)/6*(func(s+2*EPS) + func(t-2*EPS) + 4*func((s+t)*(R).5));\n\t}\n\n#undef SELF\n#undef at\n}\n\nusing namespace geom;\n\nint f = 0;\nnamespace std{\n\tbool operator<(const P &a, const P &b){return sig(a.X-b.X) ? a.X < b.X : a.Y+EPS < b.Y;}\n\tbool operator==(const P &a, const P &b){return abs(a-b) < EPS;}\n\tistream& operator>>(istream &is, P &p){R x,y;is>>x>>y;p=P(x, y);return is;}\n\tistream& operator>>(istream &is, L &l){l.resize(2);return is >> l[0] >> l[1];}\n\tistream& operator>>(istream &is, C &c){return is >> (P &)c >> c.r;}\n\tconst R B = 500;\n\tconst R Z = 2;\n//\tostream& operator<<(ostream &os, const C &c){return os << \"circle(\"<<B+Z*(c.X)<<\", \"<<1000-B-Z*(c.Y)<<\", \"<<Z*(c.r)<<\")\";}\n//\tostream& operator<<(ostream &os, const P &p){return os << \"circle(\"<<B+Z*(p.X)<<\", \"<<1000-B-Z*(p.Y)<<\", 2)\";}\n//\tostream& operator<<(ostream &os, const S &s){return os << \"line(\"<<B+Z*(s[0].X)<<\", \"<<1000-B-Z*(s[0].Y)<<\", \"<<B+Z*(s[1].X)<<\", \"<<1000-B-Z*(s[1].Y)<<\")\";}\n\n}\n\nstruct G : public vector<P>{\n\tP v;\n\tR l, r;\n\t\n\tG(size_type size=0):vector(size){}\n\tS edge(int i)const {return S(at(i), at(i+1 == size() ? 0 : i+1));}\n\tS edge(int i, R t)const {return S(at(i)+v*t, at(i+1 == size() ? 0 : i+1)+v*t);}\n};\n\nint T, n, m, b;\n\nR conflict(P p1, P p2, P p3, P v, R l, R r){\n\tif(r + EPS < l) return INF;\n\tR o = outp(p2-p1, v);\n\tR res = INF;\n\tif(!ccw(p1, p2, p3 + v*l, 1)) return l;\n\tdo{\n\t\tif(abs(o) < EPS){\n\t\t\tif(abs(outp(p2 - p1, p3 - p1)) > EPS) break;\n\t\t\tres = min(abs(p1-p3), abs(p2-p3))/abs(v);\n\t\t}else res = -outp(p2 - p1, p3 - p1) / o;\n\t\tif(res > INF - EPS || res < l - EPS || r + EPS < res) break;\n\t\tif(ccw(p1, p2, p3 + v*res, 1)) break;\n\t\treturn res;\n\t}while(0);\n\treturn INF;\n}\n\nR conflict(G a, G b){\n\tR ans = INF;\n\tREP(i, a.size())REP(j, b.size()){\n\t\tR res = conflict(a[i], a[(i+1) % a.size()], b[j], b.v-a.v, max(a.l, b.l), min(a.r, b.r));\n\t\tans = min(ans, res);\n\t}\n\treturn ans;\n}\n\nint main(int argc, char *argv[]){\n\tios::sync_with_stdio(false);\n\twhile(cin >> n >> m >> b, n){\n\t\tG g(n);\n\t\tvector<G> polys;\n\t\tREP(i, n) cin >> g[i];\n\t\tR pt = 0;\n\t\tREP(i, m){\n\t\t\tR t;\n\t\t\tP v;\n\t\t\tpolys.pb(g);\n\t\t\tcin >> t >> v;\n\t\t\tfor(auto &p : polys[i]) p -= v*pt;\n\t\t\tpolys[i].v = v; polys[i].l = pt; polys[i].r = t;\n\t\t\tfor(auto &p : g) p += v*(t-pt);\n\t\t\tpt = t;\n\t\t}\n\t\tpolys.pb(g);\n\t\tpolys[m].v = P(0, 0);\n\t\tpolys[m].l = pt;\n\t\tpolys[m].r = INF;\n\t\tvector<R> ans;\n\t\tREP(i, b){\n\t\t\tP p, v;\n\t\t\tR x, t, l;\n\t\t\tcin >> t >> x >> v >> l;\n//\t\t\tcout << \"!\" << t << \" \" << x << \" \" << v << \" \" << l << endl;\n\t\t\tp = P(x, 0) - v*t;\n\t\t\tG bullet(2);\n\t\t\tbullet[0] = p;\n\t\t\tbullet[1] = p - unit(v)*l;\n\t\t\tbullet.v = v;\n\t\t\tbullet.l = t;\n\t\t\tbullet.r = INF;\n\t\t\tR res = INF;\n\t\t\tREP(j, m+1) res = min(res, min(conflict(polys[j], bullet), conflict(bullet, polys[j])));\n\t\t\tif(res < INF-EPS) ans.pb(res);\n\t\t}\n\t\tsort(ALL(ans));\n\t\tprintf(\"%d\\n\", (int)ans.size());\n\t\tREP(i, ans.size()) printf(\"%.15f\\n\", (double)ans[i]);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":1360,"score_of_the_acc":-0.0241,"final_rank":4},{"submission_id":"aoj_2023_1373905","code_snippet":"#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <climits>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <set>\n#include <map>\n#include <iostream>\n#include <deque>\n#include <complex>\n#include <string>\n#include <iomanip>\n#include <sstream>\n#include <bitset>\n#include <valarray>\n#include <unordered_map>\n#include <iterator>\n#include <functional>\n#include <cassert>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned int uint;\ntypedef unsigned char uchar;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\n\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define REPS(i,x) for(int i=1;i<=(int)(x);i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RREPS(i,x) for(int i=((int)(x));i>0;i--)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\n#define ALL(container) (container).begin(), (container).end()\n#define RALL(container) (container).rbegin(), (container).rend()\n#define SZ(container) ((int)container.size())\n#define mp(a,b) make_pair(a, b)\n#define pb push_back\n#define eb emplace_back\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"[\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"]\"; return os;\n}\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\nos<<\"{\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"}\"; return os;\n}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\ntemplate<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}\ntemplate<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}\n\nnamespace geom{\n#define X real()\n#define Y imag()\n#define at(i) ((*this)[i])\n#define SELF (*this)\n\tenum {TRUE = 1, FALSE = 0, BORDER = -1};\n\ttypedef int BOOL;\n\ttypedef long double R;\n\tconst R INF = 1e8;\n\tR EPS = 1e-6;\n\tconst R PI = 3.1415926535897932384626;\n\tinline int sig(const R &x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }\n\tinline BOOL less(const R &x, const R &y) {return sig(x-y) ? x < y : BORDER;}\n\ttypedef complex<R> P;\n\tinline R norm(const P &p){return p.X*p.X+p.Y*p.Y;}\n\tinline R inp(const P& a, const P& b){return (conj(a)*b).X;}\n\tinline R outp(const P& a, const P& b){return (conj(a)*b).Y;}\n\tinline P unit(const P& p){return p/abs(p);}\n\tinline P proj(const P &s, const P &t){return t*inp(s, t)/norm(t);}\n\tinline int ccw(const P &s, const P &t, const P &p, int adv=0){\n\t\tint res = sig(outp(t-s, p-s));\n\t\tif(res || !adv) return res;\n\t\tif(sig(inp(t-s, p-s)) < 0) return -2;\t// p-s-t\n\t\tif(sig(inp(s-t, p-t)) < 0) return 2;\t// s-t-p\n\t\treturn 0;\t\t\t\t\t\t\t\t// s-p-t\n\t}\n\t\n\t\n\tstruct L : public vector<P>{\t// line\n\t\tL(const P &p1, const P &p2){this->push_back(p1);this->push_back(p2);}\n\t\tL(){}\n\t\tP dir()const {return at(1) - at(0);}\n\t\tBOOL online(const P &p)const {return !sig(outp(p-at(0), dir()));}\n\t};\n\tstruct S : public L{\t// segment\n\t\tS(const P &p1, const P &p2):L(p1, p2){}\n\t\tS(){}\n\t\tBOOL online(const P &p)const {\n\t\t\tif(!sig(norm(p - at(0))) || !sig(norm(p - at(1)))) return BORDER;\n\t\t\t// ??§?¨????????????¨EPS???????????§??????????????????????????¨???\n\t\t\treturn !sig(outp(p-at(0), dir())) && inp(p-at(0), dir()) > EPS && inp(p-at(1), -dir()) > -EPS;\n\t\t\t//return !sig(abs(at(0)-p) + abs(at(1) - p) - abs(at(0) - at(1)));\n\t\t}\n\t};\n\tstruct C : public P{\n\t\tC(){}\n\t\tC(const P& p, const R r):P(p), r(r){}\n\t\tR r;\n\t\tBOOL inside(const P& p)const { return less(norm(p-SELF), r*r);}\n\t};\n\n\tinline P proj(const P &s, const L &t){return t[0] + proj(s-t[0], t[1]-t[0]);}\n\tinline P reflect(const P &s, const L &t){return (R)2.*proj(s, t) - s;}\n\tinline S reflect(const S &s, const L &t){return S(reflect(s[0], t), reflect(s[1], t));}\n\tBOOL intersect(const S &s, const S &t){\n\t\tconst int p = ccw(t[0], t[1], s[0], 1) * ccw(t[0], t[1], s[1], 1);\n\t\tconst int q = ccw(s[0], s[1], t[0], 1) * ccw(s[0], s[1], t[1], 1);\n\t\treturn (p>0||q>0) ? FALSE : (!p||!q) ? BORDER : TRUE;\n\t}\n\tBOOL intersect(const S &s, const L &l){\n\t\tif(l.online(s[0]) || l.online(s[1])) return BORDER;\n\t\treturn (sig(outp(l.dir(), s[0]-l[0])) * sig(outp(l.dir(), s[1]-l[0])) <= 0);\n\t}\n\tR dist2(const L &l, const P &p){return norm(outp(l.dir(), p - l[0])) / norm(l.dir());}\n\tR dist2(const S &s, const P &p){\n\t\tif(inp(p-s[0], s.dir()) < EPS) return norm(p - s[0]);\n\t\tif(inp(p-s[1], -s.dir()) < EPS) return norm(p - s[1]);\n\t\treturn dist2((const L &)s, p);\n\t}\n\tR dist2(const S &s, const L &l){\n\t\treturn intersect(s, l) ? .0 : min(dist2(l, s[0]), dist2(l, s[1]));\n\t}\n\tR dist2(const S &s, const S &t){\n\t\treturn intersect(s, t) ? .0 : min(min(dist2(s, t[0]), dist2(t, s[0])), \n\t\t\t\t\t\t\t\t\t \t min(dist2(s, t[1]), dist2(t, s[1])));\n\t}\n\ttemplate<class S, class T> R dist(const S& s, const T& t){return sqrt(dist2(s, t));}\n\tinline BOOL intersect(const C &a, const C &b){\n\t\treturn less((a.r-b.r)*(a.r-b.r), norm(a-b)) + less(norm(a-b), (a.r+b.r)*(a.r+b.r)) - 1;\n\t}\n\tinline P crosspoint(const L &l, const L &m){\n\t\tR A = outp(l.dir(), m.dir()), B = outp(l.dir(), l[1] - m[0]);\n\t\tif(!sig(abs(A)) && !sig(abs(B))) return m[0]; // same line\n\t\tif(abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n\t\treturn m[0] + B / A * (m[1] - m[0]);\n\t}\n\t\n\ttemplate<class Func> R simpson(R s, R t, Func func){\n\t\treturn (t-s)/6*(func(s+2*EPS) + func(t-2*EPS) + 4*func((s+t)*(R).5));\n\t}\n\n#undef SELF\n#undef at\n}\n\nusing namespace geom;\n\nint f = 0;\nnamespace std{\n\tbool operator<(const P &a, const P &b){return sig(a.X-b.X) ? a.X < b.X : a.Y+EPS < b.Y;}\n\tbool operator==(const P &a, const P &b){return abs(a-b) < EPS;}\n\tistream& operator>>(istream &is, P &p){R x,y;is>>x>>y;p=P(x, y);return is;}\n\tistream& operator>>(istream &is, L &l){l.resize(2);return is >> l[0] >> l[1];}\n\tistream& operator>>(istream &is, C &c){return is >> (P &)c >> c.r;}\n\tconst R B = 500;\n\tconst R Z = 2;\n//\tostream& operator<<(ostream &os, const C &c){return os << \"circle(\"<<B+Z*(c.X)<<\", \"<<1000-B-Z*(c.Y)<<\", \"<<Z*(c.r)<<\")\";}\n//\tostream& operator<<(ostream &os, const P &p){return os << \"circle(\"<<B+Z*(p.X)<<\", \"<<1000-B-Z*(p.Y)<<\", 2)\";}\n//\tostream& operator<<(ostream &os, const S &s){return os << \"line(\"<<B+Z*(s[0].X)<<\", \"<<1000-B-Z*(s[0].Y)<<\", \"<<B+Z*(s[1].X)<<\", \"<<1000-B-Z*(s[1].Y)<<\")\";}\n\n}\n\nstruct G : public vector<P>{\n\tP v;\n\tR l, r;\n\t\n\tG(size_type size=0):vector(size){}\n\tS edge(int i)const {return S(at(i), at(i+1 == size() ? 0 : i+1));}\n\tS edge(int i, R t)const {return S(at(i)+v*t, at(i+1 == size() ? 0 : i+1)+v*t);}\n};\n\nint T, n, m, b;\n\nR conflict(P p1, P p2, P p3, P v, R l, R r){\n\tif(r + EPS < l) return INF;\n\tR o = outp(p2-p1, v);\n\tR res = INF;\n\tif(!ccw(p1, p2, p3 + v*l, 1)) return l;\n\tdo{\n\t\tif(abs(o) < EPS){\n\t\t\tif(abs(outp(p2 - p1, p3 - p1)) > EPS) break;\n\t\t\tres = min(abs(p1-p3), abs(p2-p3))/abs(v);\n\t\t}else res = -outp(p2 - p1, p3 - p1) / o;\n\t\tif(res > INF - EPS || res < l - EPS || r + EPS < res) break;\n\t\tif(ccw(p1, p2, p3 + v*res, 1)) break;\n\t\treturn res;\n\t}while(0);\n\treturn INF;\n}\n\nR conflict(G a, G b){\n\tR ans = INF;\n\tREP(i, a.size())REP(j, b.size()){\n\t\tR res = conflict(a[i], a[(i+1) % a.size()], b[j], b.v-a.v, max(a.l, b.l), min(a.r, b.r));\n\t\tans = min(ans, res);\n\t}\n\treturn ans;\n}\n\nint main(int argc, char *argv[]){\n\tios::sync_with_stdio(false);\n\twhile(cin >> n >> m >> b, n){\n\t\tG g(n);\n\t\tvector<G> polys;\n\t\tREP(i, n) cin >> g[i];\n\t\tR pt = 0;\n\t\tREP(i, m){\n\t\t\tR t;\n\t\t\tP v;\n\t\t\tpolys.pb(g);\n\t\t\tcin >> t >> v;\n\t\t\tfor(auto &p : polys[i]) p -= v*pt;\n\t\t\tpolys[i].v = v; polys[i].l = pt; polys[i].r = t;\n\t\t\tfor(auto &p : g) p += v*(t-pt);\n\t\t\tpt = t;\n\t\t}\n\t\tpolys.pb(g);\n\t\tpolys[m].v = P(0, 0);\n\t\tpolys[m].l = pt;\n\t\tpolys[m].r = INF;\n\t\tvector<R> ans;\n\t\tREP(i, b){\n\t\t\tP p, v;\n\t\t\tR x, t, l;\n\t\t\tcin >> t >> x >> v >> l;\n//\t\t\tcout << \"!\" << t << \" \" << x << \" \" << v << \" \" << l << endl;\n\t\t\tp = P(x, 0) - v*t;\n\t\t\tG bullet(2);\n\t\t\tbullet[0] = p;\n\t\t\tbullet[1] = p - unit(v)*l;\n\t\t\tbullet.v = v;\n\t\t\tbullet.l = t;\n\t\t\tbullet.r = INF;\n\t\t\tR res = INF;\n\t\t\tREP(j, m+1) res = min(res, min(conflict(polys[j], bullet), conflict(bullet, polys[j])));\n\t\t\tif(res < INF-EPS) ans.pb(res);\n\t\t}\n\t\tsort(ALL(ans));\n\t\tprintf(\"%d\\n\", (int)ans.size());\n\t\tREP(i, ans.size()) printf(\"%.15f\\n\", (double)ans[i]);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":210,"memory_kb":1404,"score_of_the_acc":-0.0509,"final_rank":6},{"submission_id":"aoj_2023_1373902","code_snippet":"#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <climits>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <set>\n#include <map>\n#include <iostream>\n#include <deque>\n#include <complex>\n#include <string>\n#include <iomanip>\n#include <sstream>\n#include <bitset>\n#include <valarray>\n#include <unordered_map>\n#include <iterator>\n#include <functional>\n#include <cassert>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned int uint;\ntypedef unsigned char uchar;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\n\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define REPS(i,x) for(int i=1;i<=(int)(x);i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RREPS(i,x) for(int i=((int)(x));i>0;i--)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\n#define ALL(container) (container).begin(), (container).end()\n#define RALL(container) (container).rbegin(), (container).rend()\n#define SZ(container) ((int)container.size())\n#define mp(a,b) make_pair(a, b)\n#define pb push_back\n#define eb emplace_back\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"[\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"]\"; return os;\n}\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\nos<<\"{\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"}\"; return os;\n}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\ntemplate<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}\ntemplate<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}\n\nnamespace geom{\n#define X real()\n#define Y imag()\n#define at(i) ((*this)[i])\n#define SELF (*this)\n\tenum {TRUE = 1, FALSE = 0, BORDER = -1};\n\ttypedef int BOOL;\n\ttypedef long double R;\n\tconst R INF = 1e8;\n\tR EPS = 1e-6;\n\tconst R PI = 3.1415926535897932384626;\n\tinline int sig(const R &x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }\n\tinline BOOL less(const R &x, const R &y) {return sig(x-y) ? x < y : BORDER;}\n\ttypedef complex<R> P;\n\tinline R norm(const P &p){return p.X*p.X+p.Y*p.Y;}\n\tinline R inp(const P& a, const P& b){return (conj(a)*b).X;}\n\tinline R outp(const P& a, const P& b){return (conj(a)*b).Y;}\n\tinline P unit(const P& p){return p/abs(p);}\n\tinline P proj(const P &s, const P &t){return t*inp(s, t)/norm(t);}\n\tinline int ccw(const P &s, const P &t, const P &p, int adv=0){\n\t\tint res = sig(outp(t-s, p-s));\n\t\tif(res || !adv) return res;\n\t\tif(sig(inp(t-s, p-s)) < 0) return -2;\t// p-s-t\n\t\tif(sig(inp(s-t, p-t)) < 0) return 2;\t// s-t-p\n\t\treturn 0;\t\t\t\t\t\t\t\t// s-p-t\n\t}\n\t\n\t\n\tstruct L : public vector<P>{\t// line\n\t\tL(const P &p1, const P &p2){this->push_back(p1);this->push_back(p2);}\n\t\tL(){}\n\t\tP dir()const {return at(1) - at(0);}\n\t\tBOOL online(const P &p)const {return !sig(outp(p-at(0), dir()));}\n\t};\n\tstruct S : public L{\t// segment\n\t\tS(const P &p1, const P &p2):L(p1, p2){}\n\t\tS(){}\n\t\tBOOL online(const P &p)const {\n\t\t\tif(!sig(norm(p - at(0))) || !sig(norm(p - at(1)))) return BORDER;\n\t\t\t// ??§?¨????????????¨EPS???????????§??????????????????????????¨???\n\t\t\treturn !sig(outp(p-at(0), dir())) && inp(p-at(0), dir()) > EPS && inp(p-at(1), -dir()) > -EPS;\n\t\t\t//return !sig(abs(at(0)-p) + abs(at(1) - p) - abs(at(0) - at(1)));\n\t\t}\n\t};\n\tstruct C : public P{\n\t\tC(){}\n\t\tC(const P& p, const R r):P(p), r(r){}\n\t\tR r;\n\t\tBOOL inside(const P& p)const { return less(norm(p-SELF), r*r);}\n\t};\n\n\tinline P proj(const P &s, const L &t){return t[0] + proj(s-t[0], t[1]-t[0]);}\n\tinline P reflect(const P &s, const L &t){return (R)2.*proj(s, t) - s;}\n\tinline S reflect(const S &s, const L &t){return S(reflect(s[0], t), reflect(s[1], t));}\n\tBOOL intersect(const S &s, const S &t){\n\t\tconst int p = ccw(t[0], t[1], s[0], 1) * ccw(t[0], t[1], s[1], 1);\n\t\tconst int q = ccw(s[0], s[1], t[0], 1) * ccw(s[0], s[1], t[1], 1);\n\t\treturn (p>0||q>0) ? FALSE : (!p||!q) ? BORDER : TRUE;\n\t}\n\tBOOL intersect(const S &s, const L &l){\n\t\tif(l.online(s[0]) || l.online(s[1])) return BORDER;\n\t\treturn (sig(outp(l.dir(), s[0]-l[0])) * sig(outp(l.dir(), s[1]-l[0])) <= 0);\n\t}\n\tR dist2(const L &l, const P &p){return norm(outp(l.dir(), p - l[0])) / norm(l.dir());}\n\tR dist2(const S &s, const P &p){\n\t\tif(inp(p-s[0], s.dir()) < EPS) return norm(p - s[0]);\n\t\tif(inp(p-s[1], -s.dir()) < EPS) return norm(p - s[1]);\n\t\treturn dist2((const L &)s, p);\n\t}\n\tR dist2(const S &s, const L &l){\n\t\treturn intersect(s, l) ? .0 : min(dist2(l, s[0]), dist2(l, s[1]));\n\t}\n\tR dist2(const S &s, const S &t){\n\t\treturn intersect(s, t) ? .0 : min(min(dist2(s, t[0]), dist2(t, s[0])), \n\t\t\t\t\t\t\t\t\t \t min(dist2(s, t[1]), dist2(t, s[1])));\n\t}\n\ttemplate<class S, class T> R dist(const S& s, const T& t){return sqrt(dist2(s, t));}\n\tinline BOOL intersect(const C &a, const C &b){\n\t\treturn less((a.r-b.r)*(a.r-b.r), norm(a-b)) + less(norm(a-b), (a.r+b.r)*(a.r+b.r)) - 1;\n\t}\n\tinline P crosspoint(const L &l, const L &m){\n\t\tR A = outp(l.dir(), m.dir()), B = outp(l.dir(), l[1] - m[0]);\n\t\tif(!sig(abs(A)) && !sig(abs(B))) return m[0]; // same line\n\t\tif(abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n\t\treturn m[0] + B / A * (m[1] - m[0]);\n\t}\n\t\n\ttemplate<class Func> R simpson(R s, R t, Func func){\n\t\treturn (t-s)/6*(func(s+2*EPS) + func(t-2*EPS) + 4*func((s+t)*(R).5));\n\t}\n\n#undef SELF\n#undef at\n}\n\nusing namespace geom;\n\nint f = 0;\nnamespace std{\n\tbool operator<(const P &a, const P &b){return sig(a.X-b.X) ? a.X < b.X : a.Y+EPS < b.Y;}\n\tbool operator==(const P &a, const P &b){return abs(a-b) < EPS;}\n\tistream& operator>>(istream &is, P &p){R x,y;is>>x>>y;p=P(x, y);return is;}\n\tistream& operator>>(istream &is, L &l){l.resize(2);return is >> l[0] >> l[1];}\n\tistream& operator>>(istream &is, C &c){return is >> (P &)c >> c.r;}\n\tconst R B = 500;\n\tconst R Z = 2;\n//\tostream& operator<<(ostream &os, const C &c){return os << \"circle(\"<<B+Z*(c.X)<<\", \"<<1000-B-Z*(c.Y)<<\", \"<<Z*(c.r)<<\")\";}\n//\tostream& operator<<(ostream &os, const P &p){return os << \"circle(\"<<B+Z*(p.X)<<\", \"<<1000-B-Z*(p.Y)<<\", 2)\";}\n//\tostream& operator<<(ostream &os, const S &s){return os << \"line(\"<<B+Z*(s[0].X)<<\", \"<<1000-B-Z*(s[0].Y)<<\", \"<<B+Z*(s[1].X)<<\", \"<<1000-B-Z*(s[1].Y)<<\")\";}\n\n}\n\nstruct G : public vector<P>{\n\tP v;\n\tR l, r;\n\t\n\tG(size_type size=0):vector(size){}\n\tS edge(int i)const {return S(at(i), at(i+1 == size() ? 0 : i+1));}\n\tS edge(int i, R t)const {return S(at(i)+v*t, at(i+1 == size() ? 0 : i+1)+v*t);}\n};\n\nint T, n, m, b;\n\nR conflict(P p1, P p2, P p3, P v, R l, R r){\n\tR o = outp(p2-p1, v);\n\tR res = INF;\n\tif(!ccw(p1, p2, p3 + v*l, 1)) return l;\n\tdo{\n\t\tif(abs(o) < EPS){\n\t\t\tif(abs(outp(p2 - p1, p3 - p1)) > EPS) break;\n\t\t\tres = min(abs(p1-p3), abs(p2-p3))/abs(v);\n\t\t}else res = -outp(p2 - p1, p3 - p1) / o;\n\t\tif(res > INF - EPS || res < l - EPS || r + EPS < res) break;\n\t\tif(ccw(p1, p2, p3 + v*res, 1)) break;\n\t\treturn res;\n\t}while(0);\n\treturn INF;\n}\n\nR conflict(G a, G b){\n\tR ans = INF;\n\tREP(i, a.size())REP(j, b.size()){\n\t\tR res = conflict(a[i], a[(i+1) % a.size()], b[j], b.v-a.v, max(a.l, b.l), min(a.r, b.r));\n\t\tans = min(ans, res);\n\t}\n\treturn ans;\n}\n\nint main(int argc, char *argv[]){\n\tios::sync_with_stdio(false);\n\twhile(cin >> n >> m >> b, n){\n\t\tG g(n);\n\t\tvector<G> polys;\n\t\tREP(i, n) cin >> g[i];\n\t\tR pt = 0;\n\t\tREP(i, m){\n\t\t\tR t;\n\t\t\tP v;\n\t\t\tpolys.pb(g);\n\t\t\tcin >> t >> v;\n\t\t\tfor(auto &p : polys[i]) p -= v*pt;\n\t\t\tpolys[i].v = v; polys[i].l = pt; polys[i].r = t;\n\t\t\tfor(auto &p : g) p += v*(t-pt);\n\t\t\tpt = t;\n\t\t}\n\t\tpolys.pb(g);\n\t\tpolys[m].v = P(0, 0);\n\t\tpolys[m].l = pt;\n\t\tpolys[m].r = INF;\n\t\tvector<R> ans;\n\t\tREP(i, b){\n\t\t\tP p, v;\n\t\t\tR x, t, l;\n\t\t\tcin >> t >> x >> v >> l;\n//\t\t\tcout << \"!\" << t << \" \" << x << \" \" << v << \" \" << l << endl;\n\t\t\tp = P(x, 0) - v*t;\n\t\t\tG bullet(2);\n\t\t\tbullet[0] = p;\n\t\t\tbullet[1] = p - unit(v)*l;\n\t\t\tbullet.v = v;\n\t\t\tbullet.l = t;\n\t\t\tbullet.r = INF;\n\t\t\tR res = INF;\n\t\t\tREP(j, m+1) res = min(res, min(conflict(polys[j], bullet), conflict(bullet, polys[j])));\n\t\t\tif(res < INF-EPS) ans.pb(res);\n\t\t}\n\t\tsort(ALL(ans));\n\t\tprintf(\"%d\\n\", (int)ans.size());\n\t\tREP(i, ans.size()) printf(\"%.15f\\n\", (double)ans[i]);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":310,"memory_kb":1400,"score_of_the_acc":-0.0662,"final_rank":7},{"submission_id":"aoj_2023_1368752","code_snippet":"// * template\n\n#include <bits/stdc++.h>\n#ifdef LOCAL\n#include \"dump.hpp\"\n#else\n#define dump(...)\n#endif\n\nusing namespace std;\n\ntemplate<class T> inline void chmin(T &a, const T &b) { if(a > b) a = b; }\n\nstruct range {\n\ttypedef int Int;\n\tstruct iter {\n\t\tInt i;\n\t\tconst Int s;\n\t\titer(const Int &i_, const Int &s_):i(i_), s(s_) {}\n\t\tbool operator!=(const iter &r) const { return s > 0 ? i < r.i : i > r.i; }\n\t\tconst Int &operator*() const { return i; }\n\t\titer &operator++() { i += s; return *this; }\n\t};\n\tconst Int f, l, s;\n\trange(const Int &f_, const Int &l_, const Int &s_):f(f_), l(l_), s(s_) {}\n\trange(const Int &f_, const Int &l_):f(f_), l(l_), s(1) {}\n\trange(const Int &num):f(0), l(num), s(1) {}\n\titer begin() const { return iter(f, s); }\n\titer end() const { return iter(l, s); }\n};\n\n// * geoetry library\n\ntypedef double Real;\nconstexpr Real EPS = 1e-8;\ninline int sign(Real d) { return d > EPS ? 1 : d < -EPS ? -1 : 0; }\n\nstruct Point {\n\tReal x, y;\n\tPoint():x(0), y(0) {}\n\tPoint(Real x_, Real y_):x(x_), y(y_) {}\n\tPoint &operator+=(const Point &p) { x += p.x; y += p.y; return *this; }\n\tPoint &operator-=(const Point &p) { x -= p.x; y -= p.y; return *this; }\n\tPoint &operator*=(Real s) { x *= s; y *= s; return *this; }\n\tPoint &operator/=(Real s) { x /= s; y /= s; return *this; }\n\tPoint operator-() const { return Point(-x, -y); }\n\tPoint operator+(const Point &p) const { return Point(*this) += p; }\n\tPoint operator-(const Point &p) const { return Point(*this) -= p; }\n\tPoint operator*(Real s) const { return Point(*this) *= s; }\n\tPoint operator/(Real s) const { return Point(*this) /= s; }\n\tbool operator<(const Point &p) const { return sign(x - p.x) == -1 || (sign(x - p.x) == 0 && sign(y - p.y) == -1); }\n\tbool operator>(const Point &p) const { return p < *this; }\n\tbool operator==(const Point &p) const { return sign(x - p.x) == 0 && sign(y - p.y) == 0; }\n\tbool operator!=(const Point &p) const { return !(*this == p); }\n};\n\ninline istream &operator>>(istream &is, Point &p) {\n\treturn is >> p.x >> p.y;\n}\n\ninline ostream &operator<<(ostream &os, const Point &p) {\n\treturn os << '(' << p.x << \", \" << p.y << ')';\n}\n\nstruct Line : public array<Point, 2> {\n\tLine(const Point &a, const Point &b) { at(0) = a; at(1) = b; }\n};\n\nstruct Segment : public array<Point, 2> {\n\tSegment(const Point &a, const Point &b) { at(0) = a; at(1) = b; }\n};\n\ntypedef vector<Point> Polygon;\n\ninline Real norm(const Point &p) {\n\treturn p.x * p.x + p.y * p.y;\n}\n\ninline Real abs(const Point &p) {\n\treturn sqrt(norm(p));\n}\n\ninline Real dot(const Point &a, const Point &b) {\n\treturn a.x * b.x + a.y * b.y;\n}\n\ninline Real cross(const Point &a, const Point &b) {\n\treturn a.x * b.y - a.y * b.x;\n}\n\nenum { CCW = 1, CW = -1, BACK = 2, FRONT = -2, ON = 0};\ninline int ccw(const Point &a, const Point &b, const Point &c) {\n\tconst Point p = b - a;\n\tconst Point q = c - a;\n\tconst int sign_cross = sign(cross(p, q));\n\n\tif(sign_cross == 1) return CCW;\n\tif(sign_cross == -1) return CW;\n\tif(sign(dot(p, q)) == -1) return BACK;\n\tif(sign(norm(p) - norm(q)) == -1) return FRONT;\n\treturn ON;\n}\n\ninline bool intersect(const Segment &s, const Point &p) {\n\treturn ccw(s[0], s[1], p) == ON;\n}\n\ninline bool intersect(const Segment &a, const Segment &b) {\n\treturn ccw(a[0], a[1], b[0]) * ccw(a[0], a[1], b[1]) <= 0\n\t\t&& ccw(b[0], b[1], a[0]) * ccw(b[0], b[1], a[1]) <= 0;\n}\n\ninline Point crosspoint(const Segment &a, const Segment &b) {\n\tconst Real crs = cross(a[1] - a[0], b[1] - b[0]);\n\tif(sign(crs) == 0) { // on same line\n\t\tif(intersect(a, b[0])) return b[0];\n\t\tif(intersect(a, b[1])) return b[1];\n\t\tif(intersect(b, a[0])) return a[0];\n\t\treturn a[1];\n\t}\n\treturn b[0] + (b[1] - b[0]) * (cross(a[1] - a[0], a[1] - b[0]) / crs);\n}\n\n// * solve\n\nReal collision_time(const Segment &s, const Point &p, const Point &v) {\n\tconst Segment seg(p, p + v * 1e7);\n\tif(!intersect(s, seg)) return numeric_limits<Real>::max();\n\tconst Point cp = crosspoint(s, seg);\n\treturn abs(cp - p) / abs(v);\n}\n\nReal collision_time(const Segment &a, const Segment &b, const Point &v_a) {\n\treturn min({collision_time(a, b[0], -v_a), collision_time(a, b[1], -v_a),\n\t\t\t\tcollision_time(b, a[0], v_a), collision_time(b, a[1], v_a)});\n}\n\nint main() {\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\tcout.setf(ios::fixed);\n\tcout.precision(10);\n\n\tfor(int n, m, b; cin >> n >> m >> b && n;) {\n\t\tPolygon body(n);\n\t\tfor(auto &p : body) cin >> p;\n\n\t\tvector<int> t_body(m + 2);\n\t\tvector<Point> v_body(m + 1);\n\t\tfor(int i = 0; i < m; ++i) {\n\t\t\tcin >> t_body[i + 1] >> v_body[i];\n\t\t}\n\t\tt_body[m + 1] = INT_MAX;\n\t\tv_body[m] = Point(0, 0);\n\n\t\tvector<int> t_shoot(b), l_shoot(b);\n\t\tvector<Point> p_shoot(b), v_shoot(b);\n\t\tfor(int i = 0; i < b; ++i) {\n\t\t\tcin >> t_shoot[i] >> p_shoot[i].x >> v_shoot[i] >> l_shoot[i];\n\t\t}\n\n\t\tvector<bool> hit(b, false);\n\t\tvector<Real> t_hit;\n\n\t\tfor(int i = 0; i <= m; ++i) {\n\t\t\tfor(int j = 0; j < b; ++j) {\n\t\t\t\tif(hit[j]) continue;\n\t\t\t\tif(t_shoot[j] >= t_body[i + 1]) break;\n\n\t\t\t\tconst Point v = v_shoot[j] - v_body[i];\n\t\t\t\tif(sign(abs(v)) == 0) continue;\n\n\t\t\t\tconst Real T = t_body[i] - t_shoot[j];\n\t\t\t\tconst Point s = p_shoot[j] + v_shoot[j] * T;\n\n\t\t\t\tconst Segment bullet(s, s - v_shoot[j] * (l_shoot[j] / abs(v_shoot[j])));\n\t\t\t\tReal min_time = numeric_limits<Real>::max();\n\n\t\t\t\tPoint prev = body.back();\n\t\t\t\tfor(const Point ¤t : body) {\n\t\t\t\t\tconst Segment seg(prev, current);\n\n\t\t\t\t\tconst Real t = collision_time(bullet, seg, v);\n\t\t\t\t\tif(sign(t) >= 0) chmin(min_time, t + t_body[i]);\n\n\t\t\t\t\tprev = current;\n\t\t\t\t}\n\n\t\t\t\tif(sign(min_time - t_body[i + 1]) <= 0) {\n\t\t\t\t\thit[j] = true;\n\t\t\t\t\tt_hit.emplace_back(min_time);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tPoint v = v_body[i] * (t_body[i + 1] - t_body[i]);\n\t\t\tfor(auto &p : body) {\n\t\t\t\tp += v;\n\t\t\t}\n\t\t}\n\n\t\tsort(begin(t_hit), end(t_hit));\n\t\tcout << t_hit.size() << '\\n';\n\t\tfor(const auto &e : t_hit) {\n\t\t\tcout << e << '\\n';\n\t\t}\n\t}\n\n\treturn EXIT_SUCCESS;\n}","accuracy":1,"time_ms":20,"memory_kb":1340,"score_of_the_acc":-0.0163,"final_rank":2},{"submission_id":"aoj_2023_1368751","code_snippet":"// * template\n\n#include <bits/stdc++.h>\n#ifdef LOCAL\n#include \"dump.hpp\"\n#else\n#define dump(...)\n#endif\n\nusing namespace std;\n\ntemplate<class T> inline void chmax(T &a, const T &b) { if(a < b) a = b; }\ntemplate<class T> inline void chmin(T &a, const T &b) { if(a > b) a = b; }\n\ntemplate<class T, class U> inline void fill_array(T &e, const U &v) { e = v; }\ntemplate<class T, class U, size_t s> inline void fill_array(T (&a)[s], const U &v) {for(auto&e:a)fill_array(e,v);}\ntemplate<class T, class U, size_t s> inline void fill_array(array<T, s> &a, const U &v) {for(auto&e:a)fill_array(e,v);}\ntemplate<class T, class U> inline void fill_array(vector<T> &a, const U &v) {for(auto&e:a)fill_array(e,v);}\n\nstruct range {\n\ttypedef int Int;\n\tstruct iter {\n\t\tInt i;\n\t\tconst Int s;\n\t\tconstexpr iter(const Int &i_, const Int &s_):i(i_), s(s_) {}\n\t\tconstexpr bool operator!=(const iter &r) const { return s > 0 ? i < r.i : i > r.i; }\n\t\tconstexpr const Int &operator*() const { return i; }\n\t\titer &operator++() { i += s; return *this; }\n\t};\n\tconst Int f, l, s;\n\tconstexpr range(const Int &f_, const Int &l_, const Int &s_):f(f_), l(l_), s(s_) {}\n\tconstexpr range(const Int &f_, const Int &l_):f(f_), l(l_), s(1) {}\n\tconstexpr range(const Int &num):f(0), l(num), s(1) {}\n\tconstexpr iter begin() const { return iter(f, s); }\n\tconstexpr iter end() const { return iter(l, s); }\n};\n\n// * geoetry template\ntypedef double Real;\nconstexpr Real EPS = 1e-8;\nint sign(Real d) { return d > EPS ? 1 : d < -EPS ? -1 : 0; }\n\n// * define class\n\nstruct Point {\n\tReal x, y;\n\tPoint():x(0), y(0) {}\n\tPoint(Real x_, Real y_):x(x_), y(y_) {}\n\tPoint &operator+=(const Point &p) { x += p.x; y += p.y; return *this; }\n\tPoint &operator-=(const Point &p) { x -= p.x; y -= p.y; return *this; }\n\tPoint &operator*=(Real s) { x *= s; y *= s; return *this; }\n\tPoint &operator/=(Real s) { x /= s; y /= s; return *this; }\n\tPoint operator-() const { return Point(-x, -y); }\n\tPoint operator+(const Point &p) const { return Point(*this) += p; }\n\tPoint operator-(const Point &p) const { return Point(*this) -= p; }\n\tPoint operator*(Real s) const { return Point(*this) *= s; }\n\tPoint operator/(Real s) const { return Point(*this) /= s; }\n\tbool operator<(const Point &p) const { return sign(x - p.x) == -1 || (sign(x - p.x) == 0 && sign(y - p.y) == -1); }\n\tbool operator>(const Point &p) const { return p < *this; }\n\tbool operator==(const Point &p) const { return sign(x - p.x) == 0 && sign(y - p.y) == 0; }\n\tbool operator!=(const Point &p) const { return !(*this == p); }\n};\n\ninline istream &operator>>(istream &is, Point &p) {\n\treturn is >> p.x >> p.y;\n}\n\ninline ostream &operator<<(ostream &os, const Point &p) {\n\treturn os << '(' << p.x << \", \" << p.y << ')';\n}\n\nstruct Line : public array<Point, 2> {\n\tLine(const Point &a, const Point &b) { at(0) = a; at(1) = b; }\n};\n\nstruct Segment : public array<Point, 2> {\n\tSegment(const Point &a, const Point &b) { at(0) = a; at(1) = b; }\n};\n\nstruct Circle {\n\tPoint c;\n\tReal r;\n\tCircle(const Point &c_, Real r_):c(c_), r(r_) {}\n};\n\ntypedef vector<Point> Polygon;\n\n// * define base function\n\nPoint rotate90(const Point &p) {\n\treturn Point(-p.y, p.x);\n}\n\nPoint rotate(const Point &p, Real theta) {\n\tconst Real s = sin(theta), c = cos(theta);\n\treturn Point(c * p.x - s * p.y, s * p.x + c * p.y);\n}\n\nReal angle(const Point &p) {\n\treturn atan2(p.y, p.x);\n}\n\nReal norm(const Point &p) {\n\treturn p.x * p.x + p.y * p.y;\n}\n\nReal abs(const Point &p) {\n\treturn sqrt(norm(p));\n}\n\nReal dot(const Point &a, const Point &b) {\n\treturn a.x * b.x + a.y * b.y;\n}\n\nReal cross(const Point &a, const Point &b) {\n\treturn a.x * b.y - a.y * b.x;\n}\n\n// * define app function\n\nenum { CCW = 1, CW = -1, BACK = 2, FRONT = -2, ON = 0};\nint ccw(const Point &a, const Point &b, const Point &c) { // a:p0, b:p1, c:p2\n\tconst Point p = b - a;\n\tconst Point q = c - a;\n\tconst int sign_cross = sign(cross(p, q));\n\n\tif(sign_cross == 1) return CCW;\n\tif(sign_cross == -1) return CW;\n\tif(sign(dot(p, q)) == -1) return BACK;\n\tif(sign(norm(p) - norm(q)) == -1) return FRONT;\n\treturn ON;\n}\n\nPoint project(const Line &l, const Point &p) {\n\tconst Point a = p - l[0];\n\tconst Point b = l[1] - l[0];\n\treturn l[0] + b * (dot(a, b) / norm(b));\n}\n\nPoint reflect(const Line &l, const Point &p) {\n\tconst Point t = project(l, p);\n\treturn t + (t - p);\n}\n\nbool intersect(const Segment &s, const Point &p) {\n\treturn ccw(s[0], s[1], p) == ON;\n}\n\nbool intersect(const Segment &a, const Segment &b) {\n\treturn ccw(a[0], a[1], b[0]) * ccw(a[0], a[1], b[1]) <= 0\n\t\t&& ccw(b[0], b[1], a[0]) * ccw(b[0], b[1], a[1]) <= 0;\n}\n\nbool intersect(const Line &l, const Point &p) {\n\treturn abs(ccw(l[0], l[1], p)) != 1;\n}\n\nbool intersect(const Line &l, const Segment &s) {\n\treturn sign(cross(l[1] - l[0], s[0] - l[0]) * cross(l[1] - l[0], s[1] - l[0])) <= 0;\n}\n\nbool intersect(const Line &a, const Line &b) {\n\treturn sign(cross(a[1] - a[0], b[1] - b[0])) != 0\n\t\t|| sign(cross(a[1] - a[0], b[1] - a[0])) == 0;\n}\n\nReal dist(const Point &a, const Point &b) {\n\treturn abs(a - b);\n}\n\nReal dist(const Line &l, const Point &p) {\n\tconst Point a = l[1] - l[0];\n\tconst Point b = p - l[0];\n\treturn abs(cross(a, b)) / abs(a);\n}\n\nReal dist(const Line &l, const Segment &s) {\n\tif(intersect(l, s)) return 0;\n\treturn min(dist(l, s[0]), dist(l, s[1]));\n}\n\nReal dist(const Line &a, const Line &b) {\n\tif(intersect(a, b)) return 0;\n\treturn dist(a, b[0]);\n}\n\nReal dist(const Segment &s, const Point &p) {\n\tif(sign(dot(s[1] - s[0], p - s[0])) == -1) return dist(s[0], p);\n\tif(sign(dot(s[0] - s[1], p - s[1])) == -1) return dist(s[1], p);\n\treturn dist(Line(s[0], s[1]), p);\n}\n\nReal dist(const Segment &a, const Segment &b) {\n\tif(intersect(a, b)) return 0;\n\treturn min({dist(a, b[0]), dist(a, b[1]), dist(b, a[0]), dist(b, a[1])});\n}\n\nPoint crosspoint(const Segment &a, const Segment &b) {\n\tconst Real crs = cross(a[1] - a[0], b[1] - b[0]);\n\tif(sign(crs) == 0) { // on same line\n\t\tif(intersect(a, b[0])) return b[0];\n\t\tif(intersect(a, b[1])) return b[1];\n\t\tif(intersect(b, a[0])) return a[0];\n\t\treturn a[1];\n\t}\n\treturn b[0] + (b[1] - b[0]) * (cross(a[1] - a[0], a[1] - b[0]) / crs);\n}\n\n// * solve\n\nReal collision_time(const Segment &s, const Point &p, const Point &v) {\n\tconst Segment seg(p, p + v * 1e7);\n\tif(!intersect(s, seg)) return numeric_limits<Real>::max();\n\tconst Point cp = crosspoint(s, seg);\n\treturn abs(cp - p) / abs(v);\n}\n\nReal collision_time(const Segment &a, const Segment &b, const Point &v_a) {\n\treturn min({collision_time(a, b[0], -v_a), collision_time(a, b[1], -v_a),\n\t\t\t\tcollision_time(b, a[0], v_a), collision_time(b, a[1], v_a)});\n}\n\nint main() {\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\tcout.setf(ios::fixed);\n\tcout.precision(10);\n\n\tfor(int n, m, b; cin >> n >> m >> b && n;) {\n\t\tPolygon body(n);\n\t\tfor(auto &p : body) cin >> p;\n\n\t\tvector<int> t_body(m + 2);\n\t\tvector<Point> v_body(m + 1);\n\t\tfor(int i = 0; i < m; ++i) {\n\t\t\tcin >> t_body[i + 1] >> v_body[i];\n\t\t}\n\t\tt_body[m + 1] = INT_MAX;\n\t\tv_body[m] = Point(0, 0);\n\n\t\tvector<int> t_shoot(b), l_shoot(b);\n\t\tvector<Point> p_shoot(b), v_shoot(b);\n\t\tfor(int i = 0; i < b; ++i) {\n\t\t\tcin >> t_shoot[i] >> p_shoot[i].x >> v_shoot[i] >> l_shoot[i];\n\t\t}\n\n\t\tvector<bool> hit(b, false);\n\t\tvector<Real> t_hit;\n\n\t\tfor(int i = 0; i <= m; ++i) {\n\t\t\tfor(int j = 0; j < b; ++j) {\n\t\t\t\tif(hit[j]) continue;\n\t\t\t\tif(t_shoot[j] >= t_body[i + 1]) break;\n\n\t\t\t\tconst Point v = v_shoot[j] - v_body[i];\n\t\t\t\tif(sign(abs(v)) == 0) continue;\n\n\t\t\t\tconst Real T = t_body[i] - t_shoot[j];\n\t\t\t\tconst Point s = p_shoot[j] + v_shoot[j] * T;\n\n\t\t\t\tconst Segment bullet(s, s - v_shoot[j] * (l_shoot[j] / abs(v_shoot[j])));\n\t\t\t\tReal min_time = numeric_limits<Real>::max();\n\t\t\t\tdump(bullet, v);\n\n\t\t\t\tPoint prev = body.back();\n\t\t\t\tfor(const Point ¤t : body) {\n\t\t\t\t\tconst Segment seg(prev, current);\n\n\t\t\t\t\tconst Real t = collision_time(bullet, seg, v);\n\t\t\t\t\tif(sign(t) >= 0) chmin(min_time, t + t_body[i]);\n\n\t\t\t\t\tprev = current;\n\t\t\t\t}\n\n\t\t\t\tif(sign(min_time - t_body[i + 1]) <= 0) {\n\t\t\t\t\thit[j] = true;\n\t\t\t\t\tt_hit.emplace_back(min_time);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tPoint v = v_body[i] * (t_body[i + 1] - t_body[i]);\n\t\t\tfor(auto &p : body) {\n\t\t\t\tp += v;\n\t\t\t}\n\t\t}\n\n\t\tsort(begin(t_hit), end(t_hit));\n\t\tcout << t_hit.size() << '\\n';\n\t\tfor(const auto &e : t_hit) {\n\t\t\tcout << e << '\\n';\n\t\t}\n\t}\n\n\treturn EXIT_SUCCESS;\n}","accuracy":1,"time_ms":30,"memory_kb":1340,"score_of_the_acc":-0.0178,"final_rank":3},{"submission_id":"aoj_2023_1365132","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n \n#define eps (1e-5)\n#define INF (1e20)\n\nstatic const double PI = acos(-1);\nbool eq(double a,double b){\n return ( -eps < a-b && a-b < eps);\n}\n\nclass Point{\npublic:\n double x, y;\n Point ( double x = 0, double y = 0): x(x), y(y){}\n Point operator + ( Point p ){ return Point(x + p.x, y + p.y); }\n Point operator - ( Point p ){ return Point(x - p.x, y - p.y); }\n Point operator * ( double a ){ return Point(x*a, y*a); }\n Point operator / ( double a ){ return Point(x/a, y/a); }\n};\ntypedef Point Vector;\n\nclass Segment{\npublic:\n Point p1, p2;\n Segment(Point s = Point(), Point t = Point()): p1(s), p2(t){}\n Vector base(){\n return p2-p1;\n }\n};\ntypedef Segment Line;\n\nbool eq(Point a,Point b){ return (eq(a.x,b.x)&&eq(a.y,b.y)); }\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; }\nbool isParallel(Vector a, Vector b){return eq(cross(a,b),0);}\n\nbool onSegment(Segment s,Point p){\n if( eq(s.p1,p) || eq(s.p2,p))return true;\n Vector a=s.p1-p,b=s.p2-p;\n return ( dot(a,b)<0 && eq(cross(a,b),0) );\n}\n\nVector unit(Vector v){\n if(eq(abs(v),0))return v;\n else return v/abs(v);\n}\n\nPoint getCrossPoint(Line a,Line b){\n return a.p1+(a.p2-a.p1)*\n (cross(b.p2-b.p1,b.p1-a.p1)/cross(b.p2-b.p1,a.p2-a.p1));\n} \n\nPoint getCrossPointLS(Line l,Segment s){\n Point p=getCrossPoint(l,s);\n if(onSegment(s,p))return p;\n else return (Point){INF,INF};\n}\n\ndouble calcCollision(Point a,Point p,Vector v){\n if(eq(a,p))return 0;\n else if(eq(unit(a-p),unit(v))) return abs(a-p)/abs(v);\n else return INF;\n}\n\ndouble calcCollision(Line l,Point p,Vector v){\n if(isParallel(l.base(),l.p1-p))return 0;\n if(isParallel(l.base(),v))return INF;\n Point q=getCrossPoint(l,(Line){p,p+v});\n return calcCollision(q,p,v);\n}\n\ndouble calcCollisionSP(Segment s,Point p,Vector v){\n if(onSegment(s,p))return 0;\n if(isParallel(s.base(),v))\n return min(calcCollision(s.p1,p,v),\n calcCollision(s.p2,p,v));\n Point q=getCrossPointLS((Line){p,p+v},s);\n return calcCollision(q,p,v);\n}\n\ndouble calcCollision(vector<Point> &t,Segment s,Vector v){\n double res=INF;\n int size=t.size();\n for(int i=0;i<size;i++)\n res=min(res,calcCollisionSP(s,t[i],v*-1.0));\n Segment sa;\n for(int i=0;i<size;i++){\n sa.p1=t[i];\n sa.p2=t[(i+1)%size];\n res=min(res,calcCollisionSP(sa,s.p1,v));\n res=min(res,calcCollisionSP(sa,s.p2,v));\n }\n return res;\n}\n\nint N,M,B;\nvector<Point> t,u;\ndouble T[101];\nVector V[101];\n\nSegment A[100],copyA[100];\n\nVector VA[100];\ndouble TA[100];\ndouble L[100];\nbool flg[100];\n\n\nvoid solve(){\n vector<double> ans;\n T[M]=1e9;\n V[M]=(Vector){0,0};\n \n double pre=0;\n for(int i=0;i<=M;i++){\n double di=T[i]-pre;\n \n for(int j=0;j<B;j++){\n if(flg[j])continue;\n double res=calcCollision(t,A[j],VA[j]-V[i]);\n if(res<-eps || di+eps<res)continue;\n flg[j]=true;\n ans.push_back(res+pre);\n }\n \n\n for(int j=0;j<N;j++)t[j]=t[j]+V[i]*di;\n for(int j=0;j<B;j++){\n A[j]=copyA[j];\n A[j].p1=A[j].p1+VA[j]*T[i];\n A[j].p2=A[j].p2+VA[j]*T[i];\n }\n pre=T[i];\n }\n \n sort(ans.begin(),ans.end());\n cout<<ans.size()<<endl;\n for(int i=0;i<(int)ans.size();i++)\n printf(\"%.8f\\n\",ans[i]);\n}\n\nvoid init(){\n t.clear();\n for(int i=0;i<100;i++){\n flg[i]=false;\n }\n}\n\nint main(){\n while(1){\n cin>>N>>M>>B;\n if(N==0&&M==0&&B==0)break;\n \n init();\n t.resize(N);\n for(int i=0;i<N;i++){\n cin>>t[i].x>>t[i].y;\n }\n u=t;\n for(int i=0;i<M;i++){\n cin>>T[i]>>V[i].x>>V[i].y;\n }\n for(int i=0;i<B;i++){\n cin>>TA[i];\n A[i].p1.y=0;\n cin>>A[i].p1.x;\n cin>>VA[i].x>>VA[i].y;\n cin>>L[i];\n A[i].p2=A[i].p1+ (unit(VA[i])*L[i]*-1.0);\n Vector vb=VA[i]*(-TA[i]);\n A[i].p1=A[i].p1+vb;\n A[i].p2=A[i].p2+vb;\n copyA[i]=A[i];\n }\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":240,"memory_kb":1324,"score_of_the_acc":-0.0493,"final_rank":5},{"submission_id":"aoj_2023_1203761","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define rep1(i,n) for(int i=1;i<=(n);++i)\n#define all(c) (c).begin(),(c).end()\n#define fs first\n#define sc second\n#define pb push_back\n#define show(x) cout << #x << \" \" << x << endl\ntypedef long double D;\ntypedef complex<D> P;\ntypedef pair<P,P> L;\ntypedef vector<P> Pol;\nD inf=1e50,eps=1e-8,EPS=1e-8;\nint N,M,B;\nP o[101],v[101];\nD T[102];\t\t\t\t//T[i]~T[i+1] p=o[i]+t*v[i]\nPol pol;\nD cro(P a,P b){return imag(conj(a)*b);}\nD verlen(L l,P p){return cro(l.fs-l.sc,p-l.sc)/abs(l.fs-l.sc);}\nbool onL(L l,P p){\n\tif(abs(l.fs-p)<eps) return true;\n\tif(abs(l.sc-p)<eps) return true;\n\treturn abs(l.fs-l.sc)>abs(l.fs-p)&&abs(l.fs-l.sc)>abs(l.sc-p);\n}\nD gett(P p,P v,L l){\n\tif(abs(cro(l.sc-l.fs,v))<eps) return inf;\n\tD l0=verlen(l,p),l1=verlen(l,p+v);\n\tD tt=l0/(l0-l1);\n\tP pt=p+v*tt;\n\tif(onL(l,pt)) return tt;\n\treturn inf;\n}\nint main(){\n\twhile(true){\n\t\tcin>>N>>M>>B;\n\t\tif(N==0) break;\n\t\tpol.clear();\n\t\trep(i,N){\n\t\t\tint x,y;\n\t\t\tcin>>x>>y;\n\t\t\tpol.pb(P(x,y));\n\t\t}\n\t\to[0]=P(0,0);\n\t\trep(i,M){\n\t\t\tint vx,vy;\n\t\t\tcin>>T[i+1]>>vx>>vy;\n\t\t\tv[i]=P(vx,vy);\n\t\t\to[i+1]=o[i]+v[i]*(T[i+1]-T[i]);\n\t\t}\n\t\trep(i,M) o[i]-=T[i]*v[i];\n\t\tT[M+1]=inf;\n\t\tv[M]=P(0,0);\n\t\tvector<D> ans;\n\t\trep(b,B){\n\t\t\tD tt,x,len,vx,vy;\n\t\t\tcin>>tt>>x>>vx>>vy>>len;\n\t\t\tP vv=P(vx,vy);\n\t\t\tP oo=P(x,0)-tt*vv;\n\t\t\tD mn=inf;\n\t\t\trep(i,M+1){\n\t\t\t\trep(j,N){\n\t\t\t\t\tD it=gett(oo,vv-v[i],L(o[i]+pol[j],o[i]+pol[(j+1)%N]));\n\t\t\t\t\tif(T[i]-EPS<it&&it<T[i+1]+EPS) mn=min(mn,it);\n\t\t\t\t\tit=gett(oo-vv/abs(vv)*len,vv-v[i],L(o[i]+pol[j],o[i]+pol[(j+1)%N]));\n\t\t\t\t\tif(T[i]-EPS<it&&it<T[i+1]+EPS) mn=min(mn,it);\n\t\t\t\t\tit=gett(o[i]+pol[j],v[i]-vv,L(oo,oo-vv/abs(vv)*len));\n\t\t\t\t\tif(T[i]-EPS<it&&it<T[i+1]+EPS) mn=min(mn,it);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(mn<inf) ans.pb(mn);\n\t\t}\n\t\tsort(all(ans));\n\t\tcout<<ans.size()<<endl;\n\t\trep(i,ans.size()) printf(\"%.8f\\n\",(double)ans[i]);\n\t}\n}","accuracy":1,"time_ms":870,"memory_kb":1340,"score_of_the_acc":-0.1489,"final_rank":8},{"submission_id":"aoj_2023_1142959","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<math.h>\n#include<vector>\nusing namespace std;\nconst double EPS = 1e-10;\nconst double INF = 1e+10;\nconst double PI = acos(-1);\nint sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }\ninline double ABS(double a){return max(a,-a);}\nstruct Pt {\n\tdouble x, y;\n\tPt() {}\n\tPt(double x, double y) : x(x), y(y) {}\n\tPt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y); }\n\tPt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y); }\n\tPt operator*(const Pt &a) const { return Pt(x * a.x - y * a.y, x * a.y + y * a.x); }\n\tPt operator-() const { return Pt(-x, -y); }\n\tPt operator*(const double &k) const { return Pt(x * k, y * k); }\n\tPt operator/(const double &k) const { return Pt(x / k, y / k); }\n\tdouble ABS() const { return sqrt(x * x + y * y); }\n\tdouble abs2() const { return x * x + y * y; }\n\tdouble arg() const { return atan2(y, x); }\n\tdouble dot(const Pt &a) const { return x * a.x + y * a.y; }\n\tdouble det(const Pt &a) const { return x * a.y - y * a.x; }\n};\ndouble tri(const Pt &a, const Pt &b, const Pt &c) { return (b - a).det(c - a); }\nint iSP(Pt a, Pt b, Pt c) {\n\tint s = sig((b - a).det(c - a));\n\tif (s) return s;\n\tif (sig((b - a).dot(c - a)) < 0) return -2; // c-a-b\n\tif (sig((a - b).dot(c - b)) < 0) return +2; // a-b-c\n\treturn 0;\n}\nPt pLL(Pt a, Pt b, Pt c, Pt d) {\n\tb = b - a; d = d - c; return a + b * (c - a).det(d) / b.det(d);\n}\nbool iLS(Pt a, Pt b, Pt c, Pt d) {\n\treturn (sig(tri(a, b, c)) * sig(tri(a, b, d)) <= 0);\n}\nbool iSS(Pt a, Pt b, Pt c, Pt d) {\n\treturn (iSP(a, b, c) * iSP(a, b, d) <= 0 && iSP(c, d, a) * iSP(c, d, b) <= 0);\n}\n\nPt p[30];\ndouble t[110];\ndouble vx[110];\ndouble vy[110];\ndouble ret[110];\ndouble h[110];\ndouble sx[110];\ndouble sl[110];\ndouble tx[110];\ndouble ty[110];\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++){\n\t\t\tdouble x,y;scanf(\"%lf%lf\",&x,&y);\n\t\t\tp[i]=Pt(x,y);\n\t\t}\n\t\tfor(int i=0;i<c;i++)ret[i]=999999999;\n\t\tfor(int i=0;i<b;i++){\n\t\t\tscanf(\"%lf%lf%lf\",t+i+1,vx+i,vy+i);\n\t\t}\n\t\tt[b+1]=999999999;\n\t\tvx[b]=vy[b]=0;\n\t\tfor(int i=0;i<c;i++){\n\t\t\tscanf(\"%lf%lf%lf%lf%lf\",h+i,sx+i,tx+i,ty+i,sl+i);\n\t\t}\n\t\tfor(int i=0;i<a;i++){\n\t\t\tPt now=p[i];\n\t\t\tfor(int j=0;j<b;j++){\n\t\t\t\tPt to=now+Pt(vx[j],vy[j])*(t[j+1]-t[j]);\n\t\t\t\tfor(int k=0;k<c;k++){\n\t\t\t\t\tif(iLS(Pt(sx[k],0),Pt(sx[k]+tx[k],ty[k]),now,to)){\n\t\t\t\t\t\tPt at=pLL(Pt(sx[k],0),Pt(sx[k]+tx[k],ty[k]),now,to);\n\t\t\t\t\t\tdouble T=t[j]+(at-now).ABS()/Pt(vx[j],vy[j]).ABS();\n\t\t\t\t\t\tPt L=Pt(sx[k],0)-Pt(tx[k],ty[k])/Pt(tx[k],ty[k]).ABS()*sl[k]+Pt(tx[k],ty[k])*(T-h[k]);\n\t\t\t\t\t\tPt R=Pt(sx[k],0)+Pt(tx[k],ty[k])*(T-h[k]);\n\t\t\t\t\t\tif(T-h[k]>0&&T>t[j]&&T<t[j+1]&&iSP(L,at,R)==2){\n\t\t\t\t\t\t\tret[k]=min(ret[k],T);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tnow=to;\n\t\t\t}\n\t\t}\n\t//\tfor(int i=0;i<c;i++)printf(\"%f\\n\",ret[i]);\n\t\tfor(int i=0;i<c;i++){\n\t\t\tPt org=Pt(0,0);\n\t\t\tfor(int j=0;j<=b;j++){\n\t\t\t\tPt v=Pt(tx[i],ty[i])-Pt(vx[j],vy[j]);\n\t\t\t\tPt L=Pt(sx[i],0)-Pt(tx[i],ty[i])/Pt(tx[i],ty[i]).ABS()*sl[i]+Pt(tx[i],ty[i])*(t[j]-h[i])-org;\n\t\t\t\tPt L2=L+v*(t[j+1]-t[j]);\n\t\t\t\tPt R=Pt(sx[i],0)+Pt(tx[i],ty[i])*(t[j]-h[i])-org;\n\t\t\t\tPt R2=R+v*(t[j+1]-t[j]);\n\t\t\t\tfor(int k=0;k<a;k++){\n\t\t\t\t\tif(iSS(L,L2,p[k],p[(k+1)%a])){\n\t\t\t\t\t\tPt at=pLL(L,L2,p[k],p[(k+1)%a]);\n\t\t\t\t\t\tdouble tt=t[j]+(at-L).ABS()/v.ABS();\n\t\t\t\t\t\tif(tt>h[i])ret[i]=min(ret[i],tt);\n\t\t\t\t\t}\n\t\t\t\t\tif(iSS(R,R2,p[k],p[(k+1)%a])){\n\t\t\t\t\t\tPt at=pLL(R,R2,p[k],p[(k+1)%a]);\n\t\t\t\t\t\tdouble tt=t[j]+(at-R).ABS()/v.ABS();\n\t\t\t\t\t\tif(tt>h[i])ret[i]=min(ret[i],tt);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\torg=org+Pt(vx[j],vy[j])*(t[j+1]-t[j]);\n\t\t\t}\n\t\t}\n\t//\tfor(int i=0;i<c;i++)printf(\"%f\\n\",ret[i]);\n\t\tvector<double>ans;\n\t\tfor(int i=0;i<c;i++){\n\t\t\tif(ret[i]<9999999)ans.push_back(ret[i]);\n\t\t}\n\t\tstd::sort(ans.begin(),ans.end());\n\t\tprintf(\"%d\\n\",ans.size());\n\t\tfor(int i=0;i<ans.size();i++)printf(\"%.12f\\n\",ans[i]);\n\t}\n}","accuracy":1,"time_ms":40,"memory_kb":1132,"score_of_the_acc":-0.0031,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2023_6005917\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=1000000007,MAX=5005,INF=1<<30;\\n\\n#define double long double\\n\\n//幾何ライブラリ\\n// define double ll をするときは Point の < と == も書き換えよう！\\n\\nconst double eps=1e-4;\\nconst double pi=acos((double)-1.0L);\\n#define equals(a,b) (fabs((a)-(b))<eps)\\n\\ndouble torad(double deg) {return (double)(deg)*pi/180.0;}\\ndouble todeg(double ang) {return ang*180.0/pi;}\\n\\nclass Point{\\npublic:\\n double x,y;\\n \\n Point(double x=0,double y=0):x(x),y(y){}\\n \\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n \\n double abs(){return sqrt(norm());}\\n double norm(){return x*x+y*y;}\\n \\n bool operator < (const Point &p)const{\\n return x+eps<p.x||(equals(x,p.x)&&y+eps<p.y);\\n }\\n \\n bool operator == (const Point &p)const{\\n return fabs(x-p.x)<eps&&fabs(y-p.y)<eps;\\n }\\n};\\n\\ntypedef Point Vector;\\n\\ndouble norm(Vector a){\\n return a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n return sqrt(norm(a));\\n}\\n\\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\\nstruct Segment{\\n Point p1,p2;\\n};\\n\\nbool isOrthogonal(Vector a,Vector b){\\n return equals(dot(a,b),0.0);\\n}\\n\\nbool isOrthogonal(Point a1,Point a2,Point b1,Point b2){\\n return isOrthogonal(a1-a2,b1-b2);\\n}\\n\\nbool isOrthogonal(Segment s1,Segment s2){\\n return equals(dot(s1.p2-s1.p1,s2.p2-s2.p1),0.0);\\n}\\n\\nbool isParallel(Vector a,Vector b){\\n return equals(cross(a,b),0.0);\\n}\\n\\nbool isParallel(Point a1,Point a2,Point b1,Point b2){\\n return isParallel(a1-a2,b1-b2);\\n}\\n\\nbool isParallel(Segment s1,Segment s2){\\n return equals(cross(s1.p2-s1.p1,s2.p2-s2.p1),0.0);\\n}\\n\\nPoint project(Segment s,Point p){\\n Vector base=s.p2-s.p1;\\n double r=dot(p-s.p1,base)/norm(base);\\n return s.p1+base*r;\\n}\\n\\nPoint reflect(Segment s,Point p){\\n return p+(project(s,p)-p)*2.0;\\n}\\n\\nPoint turn(Point p,Point c,double pi){\\n double q=atan2(p.y-c.y,p.x-c.x);\\n q+=pi;\\n p=c+Point{cos(q)*abs(p-c),sin(q)*abs(p-c)};\\n \\n return p;\\n}\\n//pをcを中心としてpi回転させる(1周で2π)\\n//p=cのときnan\\n\\n//p0,p1,p2の順に見たときどうなるか？\\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 \\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(a.norm()<b.norm()) return online_front;\\n \\n return on_segment;\\n}\\n\\nbool intersect(Point p1,Point p2,Point p3,Point p4){\\n return(ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0&&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\\nbool overlap(Segment s1,Segment s2){\\n int a=ccw(s1.p1,s1.p2,s2.p1),b=ccw(s1.p1,s1.p2,s2.p2);\\n if(a&1||b&1) return 0;\\n if(a==2){\\n if(b==-2||(b==0&&!(s2.p2==s1.p1))) return 1;\\n else return 0;\\n }\\n if(a==-2){\\n if(b==2||(b==0&&!(s2.p2==s1.p2))) return 1;\\n else return 0;\\n }\\n if(a==0){\\n if(s1.p1==s2.p1){\\n if(b!=2) return 1;\\n else return 0;\\n }\\n else if(s1.p2==s2.p1){\\n if(b!=-2) return 1;\\n else return 0;\\n }\\n else return 1;\\n }\\n return 0;\\n}\\n//s1とs2の共通の線分(長さ0より大きい)があるかどうか\\n\\ntypedef Segment Line;\\n\\ndouble getDistance(Point a,Point b){\\n return abs(a-b);\\n}\\n\\ndouble getDistanceLP(Line l,Point p){\\n return abs(cross(l.p2-l.p1,p-l.p1)/abs(l.p2-l.p1));\\n}\\n\\ndouble getDistanceSP(Segment s,Point p){\\n if(dot(s.p2-s.p1,p-s.p1)<0.0) return abs(p-s.p1);\\n if(dot(s.p1-s.p2,p-s.p2)<0.0) return abs(p-s.p2);\\n return getDistanceLP(s,p);\\n}\\n\\ndouble getDistance(Segment s1,Segment s2){\\n if(intersect(s1,s2)) return 0.0;\\n return min({getDistanceSP(s1,s2.p1),getDistanceSP(s1,s2.p2),getDistanceSP(s2,s1.p1),getDistanceSP(s2,s1.p2)});\\n}\\n\\nPoint getCrossPointS(Segment s1,Segment s2){\\n //if(ccw(s1.p1,s1.p2,s2.p1)==0&&ccw(s1.p1,s1.p2,s2.p2)==0) return s1.p1;\\n Vector base=s2.p2-s2.p1;\\n double d1=abs(cross(base,s1.p1-s2.p1));\\n double d2=abs(cross(base,s1.p2-s2.p1));\\n double t=d1/(d1+d2);\\n return s1.p1+(s1.p2-s1.p1)*t;\\n}//同じ時壊れます\\n\\nPoint getCrossPointL(Line l1,Line l2){\\n //if(ccw(s1.p1,s1.p2,s2.p1)==0&&ccw(s1.p1,s1.p2,s2.p2)==0) return s1.p1;\\n \\n Vector v1=l1.p2-l1.p1,v2=l2.p2-l2.p1;\\n \\n return l1.p1+v1*cross(v2,l2.p1-l1.p1)/cross(v2,v1);\\n}\\n\\nSegment ParallelSegment(Segment s,double d){\\n Vector v={-(s.p2-s.p1).y,(s.p2-s.p1).x};\\n v=v/abs(v);\\n \\n s.p1=s.p1+v*d;\\n s.p2=s.p2+v*d;\\n \\n return s;\\n}\\n\\nPoint naisin(Point p1,Point p2,Point p3){\\n if(p1==p2&&p2==p3&&p3==p1) return p1;\\n \\n return (p1*abs(p2-p3)+p2*abs(p1-p3)+p3*abs(p1-p2))/(abs(p2-p3)+abs(p1-p3)+abs(p1-p2));\\n}\\n\\nPoint naisin(Line l1,Line l2,Line l3){\\n //平行でない前提\\n \\n Point p1=getCrossPointL(l1,l2),p2=getCrossPointL(l1,l3),p3=getCrossPointL(l2,l3);\\n return naisin(p1,p2,p3);\\n}\\n\\n//ネットの適当を書いたのであってるか全く知りません→あってそう\\n\\nclass Circle{\\npublic:\\n Point c;\\n double r;\\n Circle(Point c=Point(),double r=0.0):c(c),r(r){}\\n};\\n\\nPoint CircleCenter(Point a,Point b,Point c){\\n Point u=a-b,v=a-c;\\n double m1=(norm(a)-norm(b))/2.0,m2=(norm(a)-norm(c))/2.0;\\n \\n Point res;\\n if(cross(u,v)==0.0){\\n res.x=1e9;\\n res.y=1e9;\\n \\n return res;\\n }\\n res.x=(m1*v.y-m2*u.y)/cross(u,v);\\n res.y=(m1*v.x-m2*u.x)/cross(v,u);\\n \\n return res;\\n}\\n//3点を通る円の中心を返す\\n\\n//交わる 0\\n// c1がc2のinside 1\\n// c1がc2のoutside 2\\n// 交わらない 3\\n\\nint not_intersect(Circle c1,Circle c2){\\n double d=getDistance(c1.c,c2.c);\\n double r1=c1.r,r2=c2.r;\\n if(r1<r2){\\n if(d<(r2-r1)) return 1;\\n }\\n if(r1>r2){\\n if(d<(r1-r2)) return 2;\\n }\\n if(d<=r1+r2) return 0;\\n else return 3;\\n}\\n\\npair<Point,Point> segCrossPpoints(Circle c,Line l){\\n //assert(intersect(c,l));\\n Vector pr=project(l,c.c);\\n Vector e=(l.p2-l.p1)/abs(l.p2-l.p1);\\n double base=sqrt(c.r*c.r-norm(pr-c.c));\\n return make_pair(pr+e*base,pr-e*base);\\n}\\n\\ndouble arg(Vector p){return atan2(p.y,p.x);}\\nVector polar(double a,double r){return Point(cos(r)*a,sin(r)*a);}\\n\\n//inside(outside)\\n\\npair<Point,Point> getCrossPoints(Circle c1,Circle c2){\\n //assert(intersect(c1,c2));\\n double d=abs(c1.c-c2.c);\\n double a=acos((c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d));\\n double t=arg(c2.c-c1.c);\\n return make_pair(c1.c+polar(c1.r,t+a),c1.c+polar(c1.r,t-a));\\n}\\n\\nvector<Line> Commontangent(Circle c1,Circle c2){\\n vector<Line> res;\\n Point p=c2.c-c1.c;\\n \\n if(abs(p)>=(c1.r+c2.r)){\\n Point a,b;\\n a.x=c1.r*(p.x*(c1.r+c2.r)+p.y*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\\n a.y=c1.r*(p.y*(c1.r+c2.r)-p.x*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\\n \\n b.x=c1.r*(p.x*(c1.r+c2.r)-p.y*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\\n b.y=c1.r*(p.y*(c1.r+c2.r)+p.x*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\\n \\n res.push_back(Line{a+c1.c,a+c1.c+Point{-a.y,a.x}});\\n if(!(a==b)){\\n res.push_back(Line{b+c1.c,b+c1.c+Point{-b.y,b.x}});\\n }\\n }\\n \\n if(abs(p)>=abs(c1.r-c2.r)){\\n Point a,b;\\n a.x=c1.r*(p.x*(c1.r-c2.r)+p.y*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\\n a.y=c1.r*(p.y*(c1.r-c2.r)-p.x*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\\n \\n b.x=c1.r*(p.x*(c1.r-c2.r)-p.y*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\\n b.y=c1.r*(p.y*(c1.r-c2.r)+p.x*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\\n \\n res.push_back(Line{a+c1.c,a+c1.c+Point{-a.y,a.x}});\\n if(!(a==b)){\\n res.push_back(Line{b+c1.c,b+c1.c+Point{-b.y,b.x}});\\n }\\n }\\n \\n return res;\\n}\\n\\ntypedef vector<Point> Polygon;\\n\\n/*\\n IN 2\\n ON 1\\n OUT 0\\n */\\n\\nint contains(Polygon g,Point p){\\n int n=int(g.size());\\n bool x=false;\\n for(int i=0;i<n;i++){\\n Point a=g[i]-p,b=g[(i+1)%n]-p;\\n if(a.y>b.y) swap(a,b);\\n if(a.y<eps&&0<b.y&&cross(a,b)<0) x=!x;\\n if(abs(cross(a,b))<eps&&dot(a,b)<eps) return 1;\\n }\\n return (x?2:0);\\n}\\n\\nPolygon andrewScan(Polygon s,bool ok){\\n Polygon u,l;\\n sort(all(s));\\n \\n if(int(s.size())<3) return s;\\n int n=int(s.size());\\n \\n u.push_back(s[0]);\\n u.push_back(s[1]);\\n \\n l.push_back(s[n-1]);\\n l.push_back(s[n-2]);\\n \\n if(ok){\\n for(int i=2;i<n;i++){\\n for(int j=int(u.size());j>=2&&ccw(u[j-2],u[j-1],s[i])==counter_clockwise;j--){\\n u.pop_back();\\n }\\n u.push_back(s[i]);\\n }\\n \\n for(int i=int(s.size())-3;i>=0;i--){\\n for(int j=int(l.size());j>=2&&ccw(l[j-2],l[j-1],s[i])==counter_clockwise;j--){\\n l.pop_back();\\n }\\n l.push_back(s[i]);\\n }\\n }\\n \\n if(!ok){\\n for(int i=2;i<n;i++){\\n for(int j=int(u.size());j>=2&&ccw(u[j-2],u[j-1],s[i])!=clockwise;j--){\\n u.pop_back();\\n }\\n u.push_back(s[i]);\\n }\\n \\n for(int i=int(s.size())-3;i>=0;i--){\\n for(int j=int(l.size());j>=2&&ccw(l[j-2],l[j-1],s[i])!=clockwise;j--){\\n l.pop_back();\\n }\\n l.push_back(s[i]);\\n }\\n }\\n \\n reverse(all(l));\\n \\n for(int i=int(u.size())-2;i>=1;i--) l.push_back(u[i]);\\n \\n return l;\\n}//ok==1なら辺の上も含める\\n\\nPolygon convex_cut(const Polygon& P, const Line& l) {\\n Polygon Q;\\n for(int i=0;i<si(P);i++){\\n Point A=P[i],B=P[(i+1)%si(P)];\\n if(ccw(l.p1,l.p2,A)!=-1)Q.push_back(A);\\n if(ccw(l.p1,l.p2,A)*ccw(l.p1,l.p2,B)<0) Q.push_back(getCrossPointL(Line{A,B},l));\\n }\\n return Q;\\n}\\n\\ndouble area(Point a,Point b,Point c){\\n b=b-a;\\n c=c-a;\\n return abs(b.x*c.y-b.y*c.x)/2.0;\\n}\\n\\ndouble area(Polygon &P){\\n if(si(P)==0) return 0.0;\\n double res=0;\\n Point c={0.0,0.0};\\n for(int i=0;i<si(P);i++){\\n c=c+P[i];\\n }\\n c=c/si(P);\\n \\n for(int i=0;i<si(P);i++){\\n res+=area(c,P[i],P[(i+1)%si(P)]);\\n }\\n \\n return res;\\n}\\n\\nll gcd(ll a,ll b){\\n if(b==0) return a;\\n return gcd(b,a%b);\\n}\\n\\npair<Point,Vector> perpendicular_bisector(Point a,Point b){\\n Point c=(a+b)/2;\\n Vector v=b-c;\\n swap(v.x,v.y);\\n v.x*=-1;\\n \\n Point p=c;\\n if(v.x==0){\\n v.y=1;\\n p.y=0;\\n }\\n else if(v.y==0){\\n v.x=1;\\n p.x=0;\\n }\\n else{\\n if(v.x<0){\\n v.x*=-1;\\n v.y*=-1;\\n }\\n ll g=gcd(abs(ll(v.x)),abs(ll(v.y)));\\n v.x/=g;\\n v.y/=g;\\n if(p.x>=0){\\n ll d=p.x/v.x;\\n p=p-v*d;\\n }else{\\n ll d=abs(p.x)/v.x;\\n p=p+v*d;\\n \\n if(p.x<0){\\n p=p+v;\\n }\\n }\\n }\\n \\n return mp(p,v);\\n}\\n//2倍するなりして整数にしておくこと\\n\\nint main() {\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n while(1){\\n int N,M,B;cin>>N>>M>>B;\\n M+=2;\\n if(N==0) break;\\n Polygon P(N);\\n for(int i=0;i<N;i++) cin>>P[i].x>>P[i].y;\\n P.push_back(P[0]);\\n vector<double> T(M);\\n vector<Vector> V(M);\\n for(int i=1;i<M-1;i++) cin>>T[i]>>V[i].x>>V[i].y;\\n T.back()=1e7;\\n \\n vector<double> ans;\\n \\n for(int q=0;q<B;q++){\\n double when=INF;\\n double t;\\n Point p;\\n Vector v;\\n double len;\\n cin>>t>>p.x>>v.x>>v.y>>len;\\n Segment G;\\n G.p1={p.x,0};\\n G.p2=G.p1-v/abs(v)*len;\\n for(int i=0;i<N;i++){\\n Vector add={0,0};\\n double last=0;\\n int j=1;\\n while(j<M){\\n if(T[j]<=t){\\n add=add+V[j]*(T[j]-last);\\n last=T[j];\\n j++;\\n }else if(last<t){\\n last=t;\\n }else{\\n double left=last,right=T[j];\\n for(int q=0;q<80;q++){\\n double m1=(left*2+right)/3,m2=(left+right*2)/3;\\n Vector a1,a2,b1,b2;\\n a1=add+V[j]*(m1-T[j-1]);\\n a2=add+V[j]*(m2-T[j-1]);\\n b1=v*(m1-t);\\n b2=v*(m2-t);\\n Segment s1={P[i]+a1,P[i+1]+a1};\\n Segment s2={P[i]+a2,P[i+1]+a2};\\n Segment t1={G.p1+b1,G.p2+b1};\\n Segment t2={G.p1+b2,G.p2+b2};\\n \\n double d1=getDistance(s1,t1),d2=getDistance(s2,t2);\\n if(d1==0){\\n right=m2;\\n chmin(when,m1);\\n }\\n else if(d1<d2) right=m2;\\n else left=m1;\\n }\\n add=add+V[j]*(T[j]-T[j-1]);\\n last=T[j];\\n j++;\\n }\\n }\\n }\\n if(when<INF) ans.push_back(when);\\n }\\n \\n sort(all(ans));\\n \\n cout<<si(ans)<<\\\"\\\\n\\\";\\n for(auto a:ans) cout<<fixed<<setprecision(25)<<a<<\\\"\\\\n\\\";\\n \\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6430,\n \"memory_kb\": 3576,\n \"score_of_the_acc\": -1.1912,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2023_5999810\",\n \"code_snippet\": \"//#pragma GCC optimize(\\\"O3\\\")\\n//#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 998244353;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-12;\\nconst ld pi = acosl(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)x += m;\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n % mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 2;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\n\\n\\n\\ntypedef complex<ld> Point;\\nld dot(Point a, Point b) { return real(conj(a) * b); }\\nld cross(Point a, Point b) { return imag(conj(a) * b); }\\nnamespace std {\\n\\tbool operator<(const Point& lhs, const Point& rhs) {\\n\\t\\treturn lhs.real() == rhs.real() ? lhs.imag() < rhs.imag() : lhs.real() < rhs.real();\\n\\t}\\n}\\nstruct Line {\\n\\tPoint a, b;\\n};\\nstruct Circle {\\n\\tPoint p; ld r;\\n};\\nint ccw(Point a, Point b, Point c) {\\n\\tb -= a; c -= a;\\n\\tif (cross(b, c) > eps)return 1;//counter clockwise\\n\\tif (cross(b, c) < -eps)return -1;//clock wise\\n\\tif (dot(b, c) < 0)return 2;//c--a--b on line\\n\\tif (norm(b) < norm(c))return -2;//a--b--c on line\\n\\treturn 0; //a--c--b on line\\n}\\nld eq(ld a, ld b){\\n\\treturn abs(a - b) < eps;\\n}\\n//2直線の交差判定\\nbool isis_ll(Line l, Line m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n//直線と線分の交差判定\\nbool isis_ls(Line l, Line s) {\\n\\treturn (cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n//点が直線上に存在するか\\nbool isis_lp(Line l, Point p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n//点が線分上に存在するか\\nbool isis_sp(Line s, Point p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n//線分と線分の交差判定2\\nbool isis_ss(Line s, Line t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n//点から直線への垂線の足\\nPoint proj(Line l, Point p) {\\n\\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.a - l.b);\\n}\\n//直線と直線の交点\\n//平行な２直線に対しては使うな！！！！\\nPoint is_ll(Line s, Line t) {\\n\\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n//直線と点の距離\\nld dist_lp(Line l, Point p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n//直線と直線の距離\\nld dist_ll(Line l, Line m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n//線分と直線の距離\\nld dist_ls(Line l, Line s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n//線分と点の距離\\nld dist_sp(Line s, Point p) {\\n\\tPoint r = proj(s, p);\\n\\treturn isis_sp(s, r) ? abs(p - r) : min(abs(p - s.a), abs(p - s.b));\\n}\\n//線分と線分の距離\\nld dist_ss(Line s, Line t) {\\n\\tif (isis_ss(s, t))return 0;\\n\\treturn min({ dist_sp(s,t.a),dist_sp(s,t.b),dist_sp(t,s.a),dist_sp(t,s.b) });\\n}\\n\\nconst int mn = 10000000;\\nld calc(ld lx, ld ly, ld rx, ld ry, ld px, ld py, ld vx, ld vy,ld len) {\\n\\tLine l = { {lx,ly},{rx,ry} };\\n\\tLine s = { {px,py},{px+len*vx,py+len*vy} };\\n\\tif (!isis_ss(s, l))return -1;\\n\\tPoint p = { px,py };\\n\\tif (ccw({ px,py }, { lx,ly }, { rx,ry }) % 2 == 0) {\\n\\t\\t\\n\\t\\tld dif = min(abs(Point{ lx,ly } - p), abs(Point{ rx,ry } - p));\\n\\t\\tld vr = sqrt(vx * vx + vy * vy);\\n\\t\\treturn dif / vr;\\n\\t}\\n\\tPoint c = is_ll(l, s);\\n\\tld dx = real(c) - px;\\n\\tld dy = imag(c) - py;\\n\\tif (vx != 0)return dx / vx;\\n\\treturn dy / vy;\\n}\\n\\nint n, m, b;\\nvoid solve() {\\n\\tvector<int> x(n), y(n);\\n\\trep(i, n)cin >> x[i] >> y[i];\\n\\tvector<int> t(m), vx(m), vy(m);\\n\\trep(i, m)cin >> t[i] >> vx[i] >> vy[i];\\n\\tt.insert(t.begin(), 0);\\n\\tt.push_back(mn);\\n\\tvx.push_back(0);\\n\\tvy.push_back(0);\\n\\tm++;\\n\\n\\tvector<vector<int>> cx(n, vector<int>(m+1));\\n\\tvector<vector<int>> cy(n, vector<int>(m+1));\\n\\trep(i, n) {\\n\\t\\tcx[i][0] = x[i];\\n\\t\\tcy[i][0] = y[i];\\n\\t\\trep(j, m) {\\n\\t\\t\\tcx[i][j + 1] = cx[i][j] + (t[j + 1] - t[j]) * vx[j];\\n\\t\\t\\tcy[i][j + 1] = cy[i][j] + (t[j + 1] - t[j]) * vy[j];\\n\\t\\t}\\n\\t}\\n\\tvector<ld> ans;\\n\\trep(i, b) {\\n\\t\\tint st; cin >> st;\\n\\t\\tint sx; cin >> sx;\\n\\t\\tint sy = 0;\\n\\t\\tint dx, dy; cin >> dx >> dy;\\n\\t\\tint len; cin >> len;\\n\\t\\tld ex = dx / sqrt(dx * dx + dy * dy);\\n\\t\\tld ey = dy / sqrt(dx * dx + dy * dy);\\n\\t\\tld mi = INF;\\n\\t\\t//弾丸につっこむ\\n\\t\\trep(id, n) {\\n\\t\\t\\tld lx = sx;\\n\\t\\t\\tld ly = 0;\\n\\t\\t\\tld rx = sx - ex * len;\\n\\t\\t\\tld ry = sy - ey * len;\\n\\t\\t\\trep(j, m) {\\n\\t\\t\\t\\tif (t[j + 1] <= st)continue;\\n\\t\\t\\t\\tint dif = t[j + 1] - t[j];\\n\\t\\t\\t\\tld px = cx[id][j];\\n\\t\\t\\t\\tld py = cy[id][j];\\n\\t\\t\\t\\tif (t[j] < st) {\\n\\t\\t\\t\\t\\tdif = t[j + 1] - st;\\n\\t\\t\\t\\t\\tpx += vx[j] * (st - t[j]);\\n\\t\\t\\t\\t\\tpy += vy[j] * (st - t[j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tld val = calc(lx, ly, rx, ry, px, py, vx[j] - dx, vy[j] - dy,dif);\\n\\t\\t\\t\\tif (val >= 0 && val <= dif) {\\n\\t\\t\\t\\t\\tmi = min(mi, val + max(t[j], st));\\n\\t\\t\\t\\t\\t//break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tlx += dx * dif;\\n\\t\\t\\t\\tly += dy * dif;\\n\\t\\t\\t\\trx += dx * dif;\\n\\t\\t\\t\\try += dy * dif;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//多角形につっこむ\\n\\t\\trep(id, n) {\\n\\t\\t\\tint nid = (id + 1==n ? 0 : id + 1);\\n\\t\\t\\tld lx = sx;\\n\\t\\t\\tld ly = 0;\\n\\t\\t\\tld rx = sx - ex * len;\\n\\t\\t\\tld ry = sy - ey * len;\\n\\t\\t\\trep(j, m) {\\n\\t\\t\\t\\tif (t[j + 1] <= st)continue;\\n\\t\\t\\t\\tint dif = t[j + 1] - t[j];\\n\\t\\t\\t\\tld px = cx[id][j];\\n\\t\\t\\t\\tld py = cy[id][j];\\n\\t\\t\\t\\tld qx = cx[nid][j];\\n\\t\\t\\t\\tld qy = cy[nid][j];\\n\\t\\t\\t\\tif (t[j] < st) {\\n\\t\\t\\t\\t\\tdif = t[j + 1] - st;\\n\\t\\t\\t\\t\\tpx += vx[j] * (st - t[j]);\\n\\t\\t\\t\\t\\tqx += vx[j] * (st - t[j]);\\n\\t\\t\\t\\t\\tpy += vy[j] * (st - t[j]);\\n\\t\\t\\t\\t\\tqy += vy[j] * (st - t[j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//bool upd = false;\\n\\t\\t\\t\\tld val = calc(px, py, qx, qy, lx, ly, dx-vx[j], dy-vy[j],dif);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (val >= 0 && val <= dif) {\\n\\t\\t\\t\\t\\tmi = min(mi, val + max(t[j], st));\\n\\t\\t\\t\\t\\t//upd = true;\\n\\t\\t\\t\\t\\t//break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tval = calc(px, py, qx, qy, rx, ry, dx - vx[j], dy - vy[j],dif);\\n\\t\\t\\t\\tif (val >= 0 && val <= dif) {\\n\\t\\t\\t\\t\\tmi = min(mi, val + max(t[j], st));\\n\\t\\t\\t\\t\\t//upd = true;\\n\\t\\t\\t\\t\\t//break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//if (upd)break;\\n\\t\\t\\t\\tlx += dx * dif;\\n\\t\\t\\t\\tly += dy * dif;\\n\\t\\t\\t\\trx += dx * dif;\\n\\t\\t\\t\\try += dy * dif;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (mi < INF) {\\n\\t\\t\\t//cout << mi << \\\"\\\\n\\\";\\n\\t\\t\\tans.push_back(mi);\\n\\t\\t}\\n\\t\\t/*rep(id, n) {\\n\\t\\t\\tint nid = id + 1 == n ? 0 : id + 1;\\n\\t\\t\\tint x2 = sx;\\n\\t\\t\\tint y2 = sy;\\n\\t\\t\\trep(j, m) {\\n\\t\\t\\t\\tif (t[j + 1] <= st)continue;\\n\\t\\t\\t\\tint dif = t[j + 1] - t[j];\\n\\t\\t\\t\\tint x1 = cx[id][j];\\n\\t\\t\\t\\tint y1 = cy[id][j];\\n\\t\\t\\t\\tint x2=\\n\\t\\t\\t}\\n\\t\\t}*/\\n\\t}\\n\\tsort(all(ans));\\n\\tcout << ans.size() << \\\"\\\\n\\\";\\n\\trep(i, ans.size()) {\\n\\t\\tcout << ans[i] << \\\"\\\\n\\\";\\n\\t}\\n}\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << fixed << setprecision(8);\\n\\t//init_f();\\n\\t//init();\\n\\t//int t; cin >> t; rep(i, t)\\n\\twhile(cin>>n>>m>>b,n)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3700,\n \"score_of_the_acc\": -0.2102,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2023_5968908\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,n) for(int i = 0; i < (n); i++)\\nusing namespace std;\\ntypedef long long ll;\\nusing Real = long double;\\nusing Point = complex< Real >;\\nusing Polygon = vector< Point >;\\nconst Real EPS = 1e-9, PI = acos(-1);\\nconstexpr int COUNTER_CLOCKWISE = +1;\\nconstexpr int CLOCKWISE = -1;\\nconstexpr int ONLINE_BACK = +2; // c-a-b\\nconstexpr int ONLINE_FRONT = -2; // a-b-c\\nconstexpr int ON_SEGMENT = 0; // a-c-b\\n\\nPoint operator*(const Point &p, const Real &d) {\\n return Point(real(p) * d, imag(p) * d);\\n}\\n\\nPoint operator/(const Point &p, const Real &d) {\\n return Point(real(p) / d, imag(p) / d);\\n}\\n\\nistream &operator>>(istream &is, Point &p) {\\n Real a, b; is >> a >> b;\\n p = Point(a, b);\\n return is;\\n}\\n\\nostream &operator<<(ostream &os, const Point &p) {\\n return os << fixed << setprecision(10) << real(p) << \\\" \\\" << imag(p);\\n}\\n\\nnamespace std {\\n bool operator<(const Point &a, const Point &b) {\\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\\n }\\n}\\n\\n// 符号\\ninline int sign(const Real &r) {\\n return r <= -EPS ? -1 : r >= EPS ? 1 : 0;\\n}\\n\\n// a = b ? \\ninline bool equals(const Real &a, const Real &b) {\\n return sign(a - b) == 0;\\n}\\n\\n\\n// 単位ベクトル\\nPoint unitVec(const Point &a){ return a / abs(a); }\\n\\n// 法線ベクトル 半時計周り\\nPoint normVec(const Point &a){ return a * Point(0, 1); }\\n//Point normVec(const Point &a){ return a * Point(0,-1); }\\n\\n// 内積\\nReal dot(const Point &a, const Point &b) {\\n return (a.real() * b.real() + a.imag() * b.imag());\\n}\\n\\n// 外積\\nReal cross(const Point &a, const Point &b) {\\n return (a.real() * b.imag() - a.imag() * b.real());\\n}\\n\\nPoint rotate(const Point &p, const Real &theta) {\\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(),\\n sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nReal Radian_To_Degree(const Real &radian){ return radian * 180.0 / PI; }\\nReal Degree_To_Radian(const Real °ree){ return degree * PI / 180.0; }\\n\\nstruct Line {\\n Point a, b;\\n Line() = default;\\n Line(Point a, Point b) : a(a), b(b) {}\\n\\n // Ax + By = C\\n Line(Real A, Real B, Real C) {\\n if(equals(A, 0)) {\\n a = Point(0, C / B), b = Point(1, C / B);\\n }else if(equals(B,0)) {\\n b = Point(C / A, 0), b = Point(C / A, 1);\\n }else{\\n a = Point(0, C / B), b = Point(C / A, 0);\\n }\\n }\\n\\n friend ostream &operator<<(ostream &os, Line &p) {\\n return os << p.a << \\\" \\\" << p.b;\\n }\\n\\n friend istream &operator>>(istream &is, Line &a) {\\n return is >> a.a >> a.b;\\n }\\n};\\n\\nstruct Segment : Line {\\n Segment() = default;\\n Segment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n Point p;\\n Real r;\\n Circle() = default;\\n Circle(Point p, Real r) : p(p), r(r) {}\\n\\n friend ostream &operator<<(ostream &os, Circle &c) {\\n return os << c.p << \\\" \\\" << c.r;\\n }\\n\\n friend istream &operator>>(istream &is, Circle &c) {\\n return is >> c.p >> c.r;\\n }\\n};\\n\\n// 直線lに点pから引いた垂線の足を求める\\nPoint projection(const Line &l, const Point &p) {\\n Real t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n Real t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\n\\n// 直線lに関して点pと対称な点を求める\\nPoint reflection(const Line &l, const Point &p) {\\n return p + (projection(l, p) - p) * 2.0;\\n}\\n\\n// 点の回転方向\\n// 点aを基準に点b,cの位置関係\\nint ccw(const Point &a, Point b, Point c) {\\n b = b - a, c = c - a;\\n if(sign(cross(b, c)) == +1) return COUNTER_CLOCKWISE; // 反時計回り\\n if(sign(cross(b, c)) == -1) return CLOCKWISE; // 時計回り\\n if(sign(dot(b, c)) == -1) return ONLINE_BACK; // c - a - b\\n if(norm(b) < norm(c)) return ONLINE_FRONT; // a - b - c\\n return ON_SEGMENT; // a - c - b\\n}\\n\\n// 2直線の直交判定\\nbool is_orthogonal(const Line &a, const Line &b) {\\n return equals(dot(a.b - a.a, b.b - b.a), 0);\\n}\\n\\n// 2直線の平行判定\\nbool is_parallel(const Line &a, const Line &b) {\\n return equals(cross(a.b - a.a, b.b - b.a), 0);\\n}\\n\\n// 線分の交差判定\\nbool is_intersect_ss(const Segment &s, const Segment &t) {\\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// 直線の交差判定\\nbool is_intersect_ll(const Line &l, const Line &m) {\\n Real A = cross(l.b - l.a, m.b - m.a);\\n Real B = cross(l.b - l.a, l.b - m.a);\\n if(equals(abs(A), 0) && equals(abs(B), 0)) return true;\\n return !is_parallel(l, m);\\n}\\n\\n// 線分に点が乗っているか\\nbool is_intersect_sp(const Segment &s, const Point &p) {\\n return ccw(s.a, s.b, p) == ON_SEGMENT;\\n}\\n\\n// 点と点の距離\\nReal distance_pp(const Point &p1, const Point &p2) {\\n return sqrt(pow(real(p1)-real(p2), 2) + pow(imag(p1)-imag(p2), 2));\\n}\\n\\n// 点と直線の距離\\nReal distance_lp(const Line &l, const Point &p) {\\n return abs(p - projection(l, p));\\n}\\n\\n// 直線と直線の距離\\nReal distance_ll(const Line &l, const Line &m) {\\n return is_intersect_ll(l, m) ? 0 : distance_lp(l, m.a);\\n}\\n\\n// 点と線分の距離\\nReal distance_sp(const Segment &s, const Point &p) {\\n Point r = projection(s, p);\\n if(is_intersect_sp(s, r)) return abs(r - p);\\n return min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// 線分と線分の距離\\nReal distance_ss(const Segment &a, const Segment &b) {\\n if(is_intersect_ss(a, b)) return 0;\\n return min({distance_sp(a, b.a), distance_sp(a, b.b), distance_sp(b, a.a), distance_sp(b, a.b)});\\n}\\n\\n// 交点\\nPoint cross_point_ll(const Line &l, const Line &m) {\\n Real A = cross(l.b - l.a, m.b - m.a);\\n Real B = cross(l.b - l.a, l.b - m.a);\\n if(equals(abs(A), 0) && equals(abs(B), 0)) return m.a;\\n return m.a + (m.b - m.a) * B / A;\\n}\\n\\n// 円と円の位置関係\\nint intersect(Circle c1, Circle c2) {\\n 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(equals(c1.r + c2.r, d)) return 3;\\n if(c1.r - c2.r < d) return 2;\\n if(equals(c1.r - c2.r, d)) return 1;\\n return 0;\\n}\\n\\nReal area(const Polygon &p){\\n Real A = 0;\\n for(int i = 0; i < p.size(); i++){\\n A += cross(p[i], p[(i + 1) % p.size()]);\\n }\\n return A * 0.5;\\n}\\n\\nbool is_convex(const Polygon &p){\\n for(int i = 0; i < p.size(); i++){\\n if(ccw(p[(i + p.size() - 1) % p.size()], p[i], p[(i + 1) % p.size()]) == -1) return false;\\n }\\n return true;\\n}\\n\\nenum { OUT, ON, IN };\\nint contains(const Polygon &Q, const Point &p){\\n bool in = false;\\n for(int i = 0; i < Q.size(); i++){\\n Point a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\\n if(a.imag() > b.imag()) swap(a, b);\\n if(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\\n if(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\\n }\\n return in ? IN : OUT;\\n}\\n\\nPolygon convex_hull(Polygon &p, bool strict = true){\\n int n = (int)p.size(), k = 0;\\n if(n <= 2) return p;\\n sort(p.begin(), p.end());\\n Polygon ch(2 * n);\\n for(int i = 0; i < n; ch[k++] = p[i++]){\\n while(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\\n }\\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]){\\n while(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\\n }\\n ch.resize(k - 1);\\n return ch;\\n}\\n\\nReal convex_diameter(const Polygon &p){\\n int n = (int)p.size();\\n int is = 0, js = 0;\\n for(int i = 1; i < n; i++){\\n if(p[i].imag() > p[is].imag()) is = i;\\n if(p[i].imag() < p[js].imag()) js = i;\\n }\\n Real maxdis = norm(p[is] - p[js]);\\n int maxi, maxj, i, j;\\n i = maxi = is;\\n j = maxj = js;\\n do {\\n if(cross(p[(i + 1) % n] - p[i], p[(j + 1) % n] - p[j]) >= 0){\\n j = (j + 1) % n;\\n }else{\\n i = (i + 1) % n;\\n }\\n\\n if(norm(p[i] - p[j]) > maxdis){\\n maxdis = norm(p[i] - p[j]);\\n maxi = i;\\n maxj = j;\\n }\\n\\n }while(i != is || j != js);\\n return sqrt(maxdis);\\n}\\n\\nPolygon convex_cut(const Polygon &U, Line l){\\n Polygon ret;\\n for(int i = 0; i < U.size(); i++){\\n Point now = U[i], nxt = U[(i + 1) % U.size()];\\n if(ccw(l.a, l.b, now) != -1) ret.push_back(now);\\n if(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0){\\n ret.push_back(cross_point_ll(Line(now, nxt), l));\\n }\\n }\\n return ret;\\n}\\n\\npair< Point, Point > cross_point_cc(const Circle &c1, const Circle &c2) {\\n Real d = abs(c1.p - c2.p);\\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\\n Real t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n return {p1, p2};\\n}\\n\\nconst int BOTTOM = 0;\\nconst int LEFT = 1;\\nconst int RIGHT = 2;\\nconst int TOP = 3;\\n\\nclass endPoint {\\n public:\\n Point p;\\n int seg; // id of Point\\n int st; // kind of Point\\n endPoint(){}\\n endPoint(Point inp, int inseg, int inst):p(inp),seg(inseg),st(inst){}\\n bool operator<(const endPoint &ep)const {\\n if(p.imag() == ep.p.imag()) return st < ep.st;\\n else return p.imag() < ep.p.imag();\\n }\\n};\\n\\nendPoint EP[220000];\\nint Manhattan_Intersections(vector< Segment > s){\\n int n = s.size();\\n double hoge;\\n\\n for(int i = 0, k = 0; i < n; i++){\\n if(s[i].a.imag() == s[i].b.imag()){\\n if(s[i].a.real() > s[i].b.real()){\\n hoge = s[i].a.real();\\n s[i].a.real(s[i].b.real());\\n s[i].b.real(hoge);\\n }\\n }else if(s[i].a.imag() > s[i].b.imag()){\\n hoge = s[i].a.imag();\\n s[i].a.imag(s[i].b.imag());\\n s[i].b.imag(hoge);\\n }\\n\\n if(s[i].a.imag() == s[i].b.imag()){\\n EP[k++] = endPoint(s[i].a, i, LEFT);\\n EP[k++] = endPoint(s[i].b, i, RIGHT);\\n }else{\\n EP[k++] = endPoint(s[i].a, i, BOTTOM);\\n EP[k++] = endPoint(s[i].b, i, TOP);\\n }\\n }\\n\\n sort(EP, EP + 2 * n);\\n set<int> BT;\\n BT.insert(1000000001);\\n int cnt = 0;\\n for(int i = 0; i < 2 * n; i++){\\n if(EP[i].st == TOP) BT.erase(EP[i].p.real());\\n else if(EP[i].st == BOTTOM) BT.insert(EP[i].p.real());\\n else if(EP[i].st == LEFT){\\n set<int>::iterator b = lower_bound(BT.begin(), BT.end(), s[EP[i].seg].a.real());\\n set<int>::iterator e = upper_bound(BT.begin(), BT.end(), s[EP[i].seg].b.real());\\n cnt += distance(b, e);\\n }\\n }\\n\\n return cnt;\\n}\\n\\n// 内接円\\nCircle Inscribed_Circle(const Point& a, const Point& b, const Point& c){\\n double A = abs(b - c), B = abs(c - a), C = abs(a - b);\\n Point x = Point((a * A + b * B + c * C) / (A + B + C));\\n double r = distance_sp(Segment(a,b),x);\\n return Circle(x, r);\\n}\\n\\n// 外接円\\nCircle Circumscribed_Circle(const Point& a, const Point& b, const Point& c){\\n Point m1((a+b)/2.0), m2((b+c)/2.0);\\n Point v((b-a).imag(), (a-b).real()), w((b-c).imag(), (c-b).real());\\n Line s(m1, Point(m1+v)), t(m2, Point(m2+w));\\n const Point x = cross_point_ll(s, t);\\n return Circle(x, abs(a-x));\\n}\\n\\npair< Point, Point > cross_point_cl(const Circle &c, const Line &l) {\\n Point pr = projection(l, c.p);\\n if(equals(abs(pr - c.p), c.r)) return {pr, pr};\\n Point e = (l.b - l.a) / abs(l.b - l.a);\\n auto k = sqrt(norm(c.r) - norm(pr - c.p));\\n return {pr - e * k, pr + e * k};\\n}\\n\\n// 点pを通る円の接線\\npair<Point,Point> tangent_cp(const Circle &c, const Point &p) {\\n return cross_point_cc(c, Circle(p, sqrt(norm(c.p - p) - c.r * c.r)));\\n}\\n\\n// 二つの円の共通接線\\nvector< Line > tangent_cc(Circle c1, Circle c2){\\n vector< Line > ret;\\n if(c1.r < c2.r) swap(c1,c2);\\n double g = norm(c1.p-c2.p);\\n if(equals(g,0.0)) return ret;\\n Point u = (c2.p-c1.p)/sqrt(g);\\n Point v = rotate(u, PI * 0.5);\\n for(int s:{-1,1}){\\n double h = (c1.r+ s*c2.r)/sqrt(g);\\n if(equals(1- h*h, 0)){\\n ret.emplace_back(c1.p+u*c1.r, c1.p+(u+v)*c1.r);\\n }else if(1-h*h > 0){\\n Point uu = u*h, vv = v*sqrt(1-h*h);\\n ret.emplace_back(c1.p+(uu+vv)*c1.r, c2.p-(uu+vv)*c2.r*s);\\n ret.emplace_back(c1.p+(uu-vv)*c1.r, c2.p-(uu-vv)*c2.r*s);\\n }\\n }\\n return ret;\\n}\\n\\nReal area_poly_c(const Polygon &p, const Circle &c) {\\n if(p.size() < 3) return 0.0;\\n function< Real(Circle, Point, Point) > cross_area = [&](const Circle &c, const Point &a, const Point &b) {\\n Point va = c.p - a, vb = c.p - b;\\n Real f = cross(va, vb), ret = 0.0;\\n if(equals(f, 0.0)) return ret;\\n if(max(abs(va), abs(vb)) < c.r + EPS) return f;\\n if(distance_sp(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\\n auto u = cross_point_cl(c, Segment(a, b));\\n vector< Point > tot{a, u.first, u.second, b};\\n for(int i = 0; i + 1 < tot.size(); i++) {\\n ret += cross_area(c, tot[i], tot[i + 1]);\\n }\\n return ret;\\n };\\n Real A = 0;\\n for(int i = 0; i < p.size(); i++) {\\n A += cross_area(c, p[i], p[(i + 1) % p.size()]);\\n }\\n return A;\\n}\\n\\nReal area_cc(const Circle &c1, const Circle &c2) {\\n Real d = abs(c1.p - c2.p);\\n if(c1.r + c2.r <= d + EPS) return 0.0;\\n if(d <= fabs(c1.r - c2.r) + EPS) {\\n Real r = min(c1.r, c2.r);\\n return r * r * PI;\\n }\\n Real rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n Real theta = acos(rc / c1.r);\\n Real phi = acos((d - rc) / c2.r);\\n return (c1.r * c1.r*theta + c2.r*c2.r*phi - d*c1.r*sin(theta));\\n}\\n\\nbool is_intersect_pp(Polygon p, Polygon q) {\\n rep(i,p.size()) {\\n if(contains(q, p[i])) return true;\\n rep(j,q.size()) {\\n Segment pl(p[i], p[(i + 1) % p.size()]);\\n Segment ql(q[j], q[(j + 1) % q.size()]);\\n if(is_intersect_ss(pl, ql)) return true;\\n }\\n }\\n return false;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n while(true) {\\n int N,M,B; cin >> N >> M >> B; if(N == 0 && M == 0 && B == 0) break;\\n Polygon p(N); rep(i,N) cin >> p[i];\\n vector< Real > t(M); Polygon v(M);\\n rep(i,M) cin >> t[i] >> v[i];\\n t.push_back(1e9); v.push_back({0, 0}); M++;\\n for(int i = M - 1; i >= 1; i--) t[i] -= t[i - 1];\\n\\n vector< Real > ans;\\n rep(_,B) {\\n Real T,X,L; Point vb; cin >> T >> X >> vb >> L;\\n Segment bullet(Point(X, 0) - vb * T, Point(X, 0) - vb / abs(vb) * L - vb * T);\\n Real cur = 0;\\n rep(i,M) {\\n Point vc = vb - v[i];\\n auto f = [&](Real x) {\\n Polygon q = {bullet.a, bullet.b, bullet.b + vc * x, bullet.a + vc * x};\\n return is_intersect_pp(p, q);\\n };\\n\\n if(f(t[i])) {\\n Real lo = 0.0, hi = t[i];\\n rep(__,50) { Real mid = (lo + hi) * 0.5; (f(mid) ? hi : lo) = mid; }\\n ans.push_back(cur + (lo + hi) * 0.5);\\n break;\\n } else {\\n cur += t[i];\\n bullet.a += vc * t[i];\\n bullet.b += vc * t[i];\\n }\\n }\\n }\\n\\n sort(ans.begin(), ans.end());\\n cout << ans.size() << endl;\\n cout.precision(17);\\n for(Real a : ans) cout << a << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 13916,\n \"score_of_the_acc\": -1.0187,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2023_5803967\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.08.19 17:53:15 */\\n\\n// #ifdef LOCAL\\n// #define _GLIBCXX_DEBUG\\n// #endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region macros\\n\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define popcnt(n) __builtin_popcountll((long long)n)\\n\\n#define REPname(a, b, c, d, e, ...) e\\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n\\n#define DREPname(a, b, c, d, e, ...) e\\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\\n\\n#pragma endregion\\n\\n#pragma region aliases\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vi = std::vector<int>;\\nusing vvi = std::vector<std::vector<int>>;\\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\\nusing vll = std::vector<ll>;\\nusing vvll = std::vector<vll>;\\nusing vvvll = std::vector<vvll>;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\ntemplate <class T = ll>\\nusing V = std::vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\ntemplate <class T = ll>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T = ll>\\nusing pqdn = std::priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nconst int inf = 1e9;\\nconst long long INF = 1e18;\\nconst long double pi = acos(-1);\\nconst char dl = '\\\\n';\\nconst char sp = ' ';\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n\\nconst int mod_1000000007 = 1000000007;\\nconst int mod_998244353 = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_operation\\n\\ntemplate <class T0, class T1, class T2>\\ninline bool in_range(T0 x, T1 lef, T2 rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool f = 1) { std::cout << (f ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { std::cout << (f ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\n\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tstd::cout << answer << '\\\\n';\\n\\texit(0);\\n}\\n\\nvoid err(bool flag = true) {\\n\\tif(!flag) return;\\n\\tstd::cout << -1 << '\\\\n';\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\\n\\tif(vertically) {\\n\\t\\tfor(auto const &a : v) {\\n\\t\\t\\tstd::cout << a << '\\\\n';\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tfor(auto it = v.begin(); it != v.end(); it++) {\\n\\t\\tstd::cout << (*it);\\n\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\tstd::cout << ' ';\\n\\t\\t}\\n\\t}\\n\\tstd::cout << '\\\\n';\\n\\treturn;\\n}\\n\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <class T>\\ninline void print(T x) {\\n\\tstd::cout << x << '\\\\n';\\n\\treturn;\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << \\\" \\\";\\n\\tprint(T...);\\n}\\n\\ntemplate <class T>\\nvoid add(std::vector<T> &v, T val) {\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b != 0);\\n\\treturn (a + b - 1) / b;\\n}\\n\\ntemplate <class T>\\nT greatest_lower_multiple(T x, T d) {\\n\\tif(d == 0) return 0;\\n\\tif(d < 0) d *= -1;\\n\\tT y = x % d;\\n\\tif(y < 0) y += d;\\n\\treturn x - y;\\n}\\n\\ntemplate <class T>\\nT least_upper_multiple(T x, T d) {\\n\\treturn -greatest_lower_multiple(-x, d);\\n}\\n\\nlong long POW(long long a, long long n) {\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tassert(n >= 0 && mod);\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\ta %= mod;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res < 0 ? res + mod : res;\\n}\\n\\n// return x which satisfies a * x % mod == gcd(a, mod)\\n// not (mod | a)\\nlong long modinv(long long a, long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tstd::swap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tstd::swap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nvoid unq_sort(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<int> press(std::vector<T> &a) {\\n\\tauto vec = a;\\n\\tunq_sort(vec);\\n\\tstd::vector<int> ret;\\n\\tfor(auto &v : a) ret.push_back(lb(vec, v));\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DBL(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define TPL3(type0, type1, type2, name) \\\\\\n\\tstd::tuple<type0, type1, type2> name; \\\\\\n\\tscanner::INPUT(name);\\n#define TPL4(type0, type1, type2, type3, name) \\\\\\n\\tstd::tuple<type0, type1, type2, type3> name; \\\\\\n\\tscanner::INPUT(name);\\n\\nnamespace scanner {\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tstd::cin >> a;\\n}\\n\\ntemplate <class T, class L>\\nvoid scan(std::pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid scan(std::tuple<T0, T1, T2> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tp = std::make_tuple(t0, t1, t2);\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tT3 t3;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tscan(t3);\\n\\tp = std::make_tuple(t0, t1, t2, t3);\\n}\\n\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\n\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n#pragma endregion\\n\\n#pragma region debug\\n\\n#pragma region output\\ntemplate <typename T1, typename T2>\\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\\n\\tfor(int i = 0; i < (int)v.size(); i++) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << v[i];\\n\\t}\\n\\treturn os;\\n}\\n#pragma endregion\\n\\n#pragma region view\\n\\nnamespace viewer {\\nvoid view(const long long e) {\\n\\tif(e == INF)\\n\\t\\tstd::cerr << \\\"INF\\\";\\n\\telse if(e == -INF)\\n\\t\\tstd::cerr << \\\"-INF\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\nvoid view(const int e) {\\n\\tif(e == inf)\\n\\t\\tstd::cerr << \\\"inf\\\";\\n\\telse if(e == -inf)\\n\\t\\tstd::cerr << \\\"-inf\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T>\\nvoid view(const T e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(p.first);\\n\\tstd::cerr << \\\", \\\";\\n\\tview(p.second);\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::tuple<T0, T1, T2> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<3>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &e : v) {\\n\\t\\tview(e);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : vv) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &c : v) {\\n\\t\\tstd::cerr << \\\"\\\\t(\\\";\\n\\t\\tview(c.first);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tstd::cerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n} // namespace viewer\\n\\n#pragma endregion\\n\\n// when debugging : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tviewer::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tviewer::view(x); \\\\\\n\\t\\tstd::cerr << '\\\\n'; \\\\\\n\\t} while(0)\\n\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\n#pragma endregion\\n\\n#pragma region geometry_light\\n\\nusing Real = long double;\\nusing R = Real;\\nusing Point = std::complex<Real>;\\nusing Vec = Point;\\nconst Real EPS = 1e-10, PI = acos(-1);\\n\\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\\n/*\\n\\t-1: a < b\\n\\t0 : a == b\\n\\t1 : a > b\\n*/\\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\\n\\nnamespace std {\\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n} // namespace std\\n\\nstd::istream &operator>>(std::istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// rotate point 'p' for counter clockwise direction\\nconst Point rotate(const Real &theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\\n\\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\\n\\n// get angle a-b-c (<pi)\\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), w(c - b);\\n\\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\\n\\treturn std::min(theta, 2 * PI - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \\\" -- \\\" << p.b; }\\n\\n\\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = std::vector<Point>;\\nusing Polygon = std::vector<Point>;\\nusing Segments = std::vector<Segment>;\\nusing Lines = std::vector<Line>;\\nusing Circles = std::vector<Circle>;\\n\\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\nconst int ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = 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\\t// \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) + EPS < norm(c)) return -2;\\t// \\\"ONLINE_FRONT\\\"\\n\\treturn 0;\\t\\t\\t\\t\\t\\t\\t\\t// \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\\n\\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\\n\\nint intersect(const Line &l, const Line &m) {\\n\\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\\n\\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\\n}\\n\\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\\n\\nint intersect(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\\n\\treturn cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\\n}\\n\\nReal distance(const Line &l, const Point &p);\\n\\nint intersect(const Circle &c, const Line &l) {\\n\\tReal d = c.r - distance(l, c.p);\\n\\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\\n}\\n\\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\nint intersect(const Segment &s, const Segment &t) {\\n\\tif(eq(s.a, s.b)) return intersect(t, s.a);\\n\\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\\n\\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\\n\\t\\treturn -1;\\n\\treturn int(ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0);\\n}\\n\\nint intersect(const Circle &c, const Segment &l) {\\n\\tconst Point h = projection(l, c.p);\\n\\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\\n\\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\\n}\\n\\nReal distance(const Point &a, const Point &b);\\n\\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\\n\\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\\n\\tint com = compare(r1 + r2, d);\\n\\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\\n\\t// if(c1.r < c2.r) swap(c1, c2);\\n\\t// Real d = abs(c1.p - c2.p);\\n\\t// if(compare(c1.r + c2.r, d) == -1) return 4;\\n\\t// if(eq(c1.r + c2.r, d)) return 3;\\n\\t// if(compare(c1.r - c2.r, d) == -1) return 2;\\n\\t// return int(eq(c1.r - c2.r, d));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\treturn intersect(s, r) ? distance(r, p) : std::min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\\nReal distance(const Segment &a, const Segment &b) {\\n\\tif(intersect(a, b)) return 0;\\n\\treturn std::min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\\n}\\n\\nReal distance(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s)) return 0;\\n\\treturn std::min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn m.a + (m.b - m.a) * B / A;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn make_pair(pr - v, pr + v);\\n\\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\\n\\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\t// return {pr - e * base, pr + e * base};\\n}\\n\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\\n\\tauto ret = crosspoint(c, Line(l.a, l.b));\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn make_pair(p1, p2);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\\n\\treturn crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r)));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\\n// 円 c1, c2 の共通接線\\nLines tangent(Circle c1, Circle c2) {\\n\\tLines ret;\\n\\tif(c1.r < c2.r) std::swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tVec u = (c2.p - c1.p) / Real(sqrt(g));\\n\\tVec v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\nvoid solve() {\\n\\tint n, m, b;\\n\\tcin >> n >> m >> b;\\n\\tif(!n) exit(0);\\n\\n\\tPolygon mybody(n);\\n\\tfoa(p, mybody) cin >> p;\\n\\n\\tV<tuple<R, R, Vec>> move_me;\\n\\tR start_time = 0;\\n\\trep(m) {\\n\\t\\tLD(t, vx, vy);\\n\\t\\tmove_me.emplace_back(start_time, t, Vec(vx, vy));\\n\\t\\tstart_time = t;\\n\\t}\\n\\tmove_me.emplace_back(start_time, 1e19, Vec(0, 0));\\n\\n\\tauto f = [&](Segment s, Point a, Vec va) -> R {\\n\\t\\tPoint b = a + va;\\n\\t\\tLine orbit(a, b);\\n\\t\\tif(intersect(orbit, s)) {\\n\\t\\t\\tPoint crs = crosspoint(orbit, s);\\n\\t\\t\\tif(ccw(s.a, s.b, crs)) return R(INF);\\n\\t\\t\\tif(dot(va, crs - a) < -EPS) return R(INF);\\n\\t\\t\\t\\n\\t\\t\\treturn distance(crs, a) / abs(va);\\n\\t\\t}\\n\\t\\treturn R(INF);\\n\\t};\\n\\n\\tauto collision = [&](Segment a, Vec va, Segment b, Vec vb) {\\n\\t\\tR ret = R(INF);\\n\\t\\tchmin(ret, f(a, b.a, vb - va));\\n\\t\\tchmin(ret, f(a, b.b, vb - va));\\n\\t\\tchmin(ret, f(b, a.a, va - vb));\\n\\t\\tchmin(ret, f(b, a.b, va - vb));\\n\\t\\treturn ret;\\n\\t};\\n\\n\\tV<R> ans;\\n\\n\\trep(b) {\\n\\t\\tR launch_time, launch_x;\\n\\t\\tVec v_arrow;\\n\\t\\tR arrow_length;\\n\\t\\tcin >> launch_time >> launch_x >> v_arrow >> arrow_length;\\n\\n\\t\\tPoint arrow_hole(launch_x, 0);\\n\\t\\tSegment arrow_begin(arrow_hole, arrow_hole - v_arrow / abs(v_arrow) * arrow_length);\\n\\n\\t\\tVec moved_me(0, 0);\\n\\n\\t\\tR answer = INF;\\n\\n\\t\\tfor(auto [start_time, end_time, v_me] : move_me) {\\n\\t\\t\\trep(i, n) {\\n\\t\\t\\t\\tSegment edge(mybody[i] + moved_me, mybody[(i + 1) % n] + moved_me);\\n\\n\\t\\t\\t\\tSegment arrow_start_time(arrow_begin.a + v_arrow * (start_time - launch_time),\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t arrow_begin.b + v_arrow * (start_time - launch_time));\\n\\t\\t\\t\\tR res = collision(edge, v_me, arrow_start_time, v_arrow);\\n\\t\\t\\t\\tif(!isnan(res) && 0 <= res && res <= end_time - start_time) {\\n\\t\\t\\t\\t\\tchmin(answer, res + start_time);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tmoved_me += v_me * (end_time - start_time);\\n\\t\\t}\\n\\n\\t\\tif(answer < 1e16) ans.push_back(answer);\\n\\t}\\n\\n\\tprint(ans.size());\\n\\tsort(all(ans));\\n\\tvout(ans, 1);\\n\\treturn;\\n}\\nint main() {\\n\\tstd::ios::sync_with_stdio(false);\\n\\tstd::cin.tie(nullptr);\\n\\tstd::cout << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\twhile(1) solve();\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.1902,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2023_5452720\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst double INF = 2000000;\\nconst double EPS = 0.0000001;\\nstruct point{\\n double x, y;\\n point(){\\n }\\n point(double x, double y): x(x), y(y){\\n }\\n point operator +(point P){\\n return point(x + P.x, y + P.y);\\n }\\n point operator -(point P){\\n return point(x - P.x, y - P.y);\\n }\\n point operator *(double k){\\n return point(x * k, y * k);\\n }\\n point operator /(double k){\\n return point(x / k, y / k);\\n }\\n};\\ndouble abs(point P){\\n return sqrt(P.x * P.x + P.y * P.y);\\n}\\ndouble dot(point P, point Q){\\n return P.x * Q.x + P.y * Q.y;\\n}\\ndouble cross(point P, point Q){\\n return P.x * Q.y - P.y * Q.x;\\n}\\nstruct line{\\n point A, B;\\n line(point A, point B): A(A), B(B){\\n }\\n};\\npoint vec(line L){\\n return L.B - L.A;\\n}\\nbool point_on_segment(point P, line L){\\n return abs(cross(P - L.A, vec(L))) < EPS && dot(P - L.A, vec(L)) > 0 && dot(P - L.B, vec(L)) < 0;\\n}\\nbool segment_intersects(line L1, line L2){\\n if (cross(L2.A - L1.A, vec(L1)) * cross(L2.B - L1.A, vec(L1)) < 0){\\n if (cross(L1.A - L2.A, vec(L2)) * cross(L1.B - L2.A, vec(L2)) < 0){\\n return true;\\n }\\n }\\n return false;\\n}\\nbool point_in_triangle(point P, point A, point B, point C){\\n if (cross(B - A, P - A) > 0 && cross(C - B, P - B) > 0 && cross(A - C, P - C) > 0){\\n return true;\\n }\\n if (cross(B - A, P - A) < 0 && cross(C - B, P - B) < 0 && cross(A - C, P - C) < 0){\\n return true;\\n }\\n return false;\\n}\\nbool segment_triangle_intersect(line L, point A, point B, point C){\\n if (segment_intersects(L, line(A, B))){\\n return true;\\n }\\n if (segment_intersects(L, line(B, C))){\\n return true;\\n }\\n if (segment_intersects(L, line(C, A))){\\n return true;\\n }\\n if (point_in_triangle(L.A, A, B, C)){\\n return true;\\n }\\n if (point_in_triangle(L.B, A, B, C)){\\n return true;\\n }\\n if (point_on_segment(A, L)){\\n return true;\\n }\\n if (point_on_segment(B, L)){\\n return true;\\n }\\n if (point_on_segment(C, L)){\\n return true;\\n }\\n return false;\\n}\\nint main(){\\n cout << fixed << setprecision(20);\\n while (true){\\n int N, M, B;\\n cin >> N >> M >> B;\\n if (N == 0 && M == 0 && B == 0){\\n break;\\n }\\n vector<point> P(N + 1);\\n for (int i = 0; i < N; i++){\\n cin >> P[i].x >> P[i].y;\\n }\\n P[N] = P[0];\\n vector<double> T(M + 2);\\n vector<point> V(M + 1);\\n T[0] = 0;\\n for (int i = 0; i < M; i++){\\n cin >> T[i + 1] >> V[i].x >> V[i].y;\\n }\\n T[M + 1] = INF;\\n V[M].x = 0;\\n V[M].y = 0;\\n M++;\\n vector<double> ans;\\n for (int i = 0; i < B; i++){\\n double t;\\n point S1, W;\\n double L;\\n cin >> t >> S1.x >> W.x >> W.y >> L;\\n S1.y = 0;\\n point S2 = S1 - W / abs(W) * L;\\n line X(S1, S2);\\n int p = lower_bound(T.begin(), T.end(), t) - T.begin();\\n vector<double> T2 = T;\\n vector<point> V2 = V;\\n T2.insert(T2.begin() + p, t);\\n V2.insert(V2.begin() + p, V[p - 1]);\\n for (int j = p; j <= M; j++){\\n V2[j] = V2[j] - W;\\n }\\n vector<point> P2 = P;\\n double mn = INF;\\n for (int j = 0; j <= M; j++){\\n if (j >= p){\\n bool ok = false;\\n vector<point> Q(N + 1);\\n for (int k = 0; k <= N; k++){\\n Q[k] = P2[k] + V2[j] * (T2[j + 1] - T2[j]);\\n }\\n for (int k = 0; k < N; k++){\\n if (segment_triangle_intersect(X, P2[k], P2[k + 1], Q[k])){\\n ok = true;\\n }\\n if (segment_triangle_intersect(X, P2[k + 1], Q[k], Q[k + 1])){\\n ok = true;\\n }\\n }\\n if (ok){\\n double tv = T2[j + 1] - T2[j], fv = 0;\\n for (int k = 0; k < 50; k++){\\n double mid = (tv + fv) / 2;\\n for (int l = 0; l <= N; l++){\\n Q[l] = P2[l] + V2[j] * mid;\\n }\\n ok = false;\\n for (int l = 0; l < N; l++){\\n if (segment_triangle_intersect(X, P2[l], P2[l + 1], Q[l])){\\n ok = true;\\n }\\n if (segment_triangle_intersect(X, P2[l + 1], Q[l], Q[l + 1])){\\n ok = true;\\n }\\n }\\n if (ok){\\n tv = mid;\\n } else {\\n fv = mid;\\n }\\n }\\n mn = T2[j] + tv;\\n break;\\n }\\n }\\n for (int k = 0; k <= N; k++){\\n P2[k] = P2[k] + V2[j] * (T2[j + 1] - T2[j]);\\n }\\n }\\n if (mn != INF){\\n ans.push_back(mn);\\n }\\n }\\n sort(ans.begin(), ans.end());\\n int n = ans.size();\\n cout << n << endl;\\n for (int i = 0; i < n; i++){\\n cout << ans[i] << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3304,\n \"score_of_the_acc\": -0.1715,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2023_4761030\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 105\\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\\nstruct Info{\\n\\n\\tdouble T,vx,vy;\\n};\\n\\nstruct Ball{\\n\\n\\tdouble start_T,x,vx,vy,len,speed;\\n};\\n\\nint N,M,B;\\nint num_line;\\ndouble min_time[SIZE];\\nvector<double> ans;\\nPolygon P;\\nLine line[SIZE],work[SIZE];\\nInfo info[SIZE];\\nBall ball[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\\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\\n\\tdouble naiseki,norm1,norm2,gaiseki;\\n\\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\\n\\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\\n\\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\\n\\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\\n\\tif(gaiseki > EPS){\\n\\t\\treturn 1;\\n\\t}else if(gaiseki < -EPS){\\n\\t\\treturn -1;\\n\\t}\\n\\tif(naiseki < -EPS){\\n\\t\\treturn 2;\\n\\t}\\n\\n\\tif(norm1 < norm2){\\n\\t\\treturn -2;\\n\\t}\\n\\treturn 0;\\n}\\n\\n\\n//★★直線ではなく、線分の交差判定★★\\nbool is_Cross(Line a,Line b){\\n\\n\\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\\n\\t\\t\\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\n//交点を求める関数\\nPoint calc_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\\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\\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//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\n\\nPoint calc_Cross_Point(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\\nvoid func(){\\n\\n\\tP.clear();\\n\\tans.clear();\\n\\n\\tdouble x,y;\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&x,&y);\\n\\t\\tP.push_back(Point(x,y));\\n\\t}\\n\\n\\t//線分にする\\n\\tnum_line = 0;\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tline[num_line].p[0] = P[i];\\n\\t\\tline[num_line].p[1] = P[(i+1)%N];\\n\\t\\tnum_line++;\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf\\\",&info[i].T,&info[i].vx,&info[i].vy);\\n\\t}\\n\\n\\tfor(int i = 0; i < B; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf %lf\\\",&ball[i].start_T,&ball[i].x,&ball[i].vx,&ball[i].vy,&ball[i].len);\\n\\n\\t\\t//★?★\\n\\t\\t//ball[i].vx *= -1;\\n\\t\\t//ball[i].vy *= -1;\\n\\t\\tball[i].speed = sqrt(ball[i].vx*ball[i].vx+ball[i].vy*ball[i].vy);\\n\\t}\\n\\t//ダミー動作\\n\\tinfo[M].T = BIG_NUM;\\n\\tinfo[M].vx = 0;\\n\\tinfo[M].vy = 0;\\n\\tM++;\\n\\n\\n\\tfor(int i = 0; i < B; i++){\\n\\n\\t\\tmin_time[i] = BIG_NUM;//弾丸目線\\n\\t}\\n\\n\\tdouble add_x,add_y;\\n\\tdouble ball_x,ball_y;\\n\\tdouble span,diff_x,diff_y;\\n\\tdouble tmp_vx,tmp_vy;\\n\\n\\tLine ball_line;\\n\\tLine tmp_line;\\n\\n\\tfor(int i = 0; i < B; i++){\\n\\n\\t\\tadd_x = 0;\\n\\t\\tadd_y = 0;\\n\\n\\t\\tball_x = ball[i].x;\\n\\t\\tball_y = 0;\\n\\n\\t\\tdouble current = 0;\\n\\n\\t\\tfor(int k = 0; k < M; k++){\\n\\n\\t\\t\\t//pre-info[k].Tの間\\n\\t\\t\\tif(ball[i].start_T > info[k].T+EPS){\\n\\n\\t\\t\\t\\tadd_x += (info[k].T-current)*info[k].vx;\\n\\t\\t\\t\\tadd_y += (info[k].T-current)*info[k].vy;\\n\\n\\t\\t\\t\\tcurrent = info[k].T;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(ball[i].start_T > current+EPS){\\n\\n\\t\\t\\t\\tadd_x += (ball[i].start_T-current)*info[k].vx;\\n\\t\\t\\t\\tadd_y += (ball[i].start_T-current)*info[k].vy;\\n\\t\\t\\t\\tcurrent = ball[i].start_T;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int a = 0; a < num_line; a++){\\n\\n\\t\\t\\t\\twork[a].p[0].x = line[a].p[0].x+add_x;\\n\\t\\t\\t\\twork[a].p[0].y = line[a].p[0].y+add_y;\\n\\n\\t\\t\\t\\twork[a].p[1].x = line[a].p[1].x+add_x;\\n\\t\\t\\t\\twork[a].p[1].y = line[a].p[1].y+add_y;\\n\\t\\t\\t}\\n\\n\\n\\t\\t\\tball_line.p[0] = Point(ball_x,ball_y);\\n\\t\\t\\tball_line.p[1] = Point(ball_x-(ball[i].len/ball[i].speed)*ball[i].vx,\\n\\t\\t\\t\\t\\t\\t\\t\\t ball_y-(ball[i].len/ball[i].speed)*ball[i].vy);\\n\\n\\t\\t\\t//弾丸静止\\n\\t\\t\\tspan = info[k].T-current;\\n\\t\\t\\ttmp_vx = info[k].vx-ball[i].vx;\\n\\t\\t\\ttmp_vy = info[k].vy-ball[i].vy;\\n\\n\\t\\t\\tdiff_x = span*tmp_vx;\\n\\t\\t\\tdiff_y = span*tmp_vy;\\n\\n\\t\\t\\tfor(int a = 0; a < num_line; a++){\\n\\t\\t\\t\\tfor(int b = 0; b < 2; b++){\\n\\n\\t\\t\\t\\t\\ttmp_line.p[0] = work[a].p[b];\\n\\t\\t\\t\\t\\ttmp_line.p[1].x = tmp_line.p[0].x+diff_x;\\n\\t\\t\\t\\t\\ttmp_line.p[1].y = tmp_line.p[0].y+diff_y;\\n\\n\\t\\t\\t\\t\\tif(is_Cross(ball_line,tmp_line)){\\n\\n\\t\\t\\t\\t\\t\\tPoint cross_point = calc_Cross_Point(tmp_line,ball_line);\\n\\t\\t\\t\\t\\t\\tdouble all_len = calc_dist(tmp_line.p[0],tmp_line.p[1]);\\n\\t\\t\\t\\t\\t\\tdouble add_time = (calc_dist(cross_point,tmp_line.p[0])/all_len)*span;\\n\\n\\t\\t\\t\\t\\t\\tmin_time[i] = min(min_time[i],current+add_time);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t//多角形静止\\n\\t\\t\\ttmp_vx = ball[i].vx-info[k].vx;\\n\\t\\t\\ttmp_vy = ball[i].vy-info[k].vy;\\n\\n\\t\\t\\tdiff_x = span*tmp_vx;\\n\\t\\t\\tdiff_y = span*tmp_vy;\\n\\n\\t\\t\\tfor(int b = 0; b < 2; b++){\\n\\n\\t\\t\\t\\ttmp_line.p[0] = ball_line.p[b];\\n\\t\\t\\t\\ttmp_line.p[1].x = tmp_line.p[0].x+diff_x;\\n\\t\\t\\t\\ttmp_line.p[1].y = tmp_line.p[0].y+diff_y;\\n\\n\\t\\t\\t\\tfor(int a = 0; a < num_line; a++){\\n\\t\\t\\t\\t\\tif(is_Cross(tmp_line,work[a])){\\n\\n\\t\\t\\t\\t\\t\\tPoint cross_point = calc_Cross_Point(tmp_line,work[a]);\\n\\t\\t\\t\\t\\t\\tdouble all_len = calc_dist(tmp_line.p[0],tmp_line.p[1]);\\n\\t\\t\\t\\t\\t\\tdouble add_time = (calc_dist(cross_point,tmp_line.p[0])/all_len)*span;\\n\\n\\t\\t\\t\\t\\t\\tmin_time[i] = min(min_time[i],current+add_time);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tadd_x += span*info[k].vx;\\n\\t\\t\\tadd_y += span*info[k].vy;\\n\\n\\t\\t\\tball_x += span*ball[i].vx;\\n\\t\\t\\tball_y += span*ball[i].vy;\\n\\n\\t\\t\\tcurrent = info[k].T;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < B; i++){\\n\\n\\t\\tif(fabs(min_time[i]-BIG_NUM) < EPS)continue;\\n\\t\\tans.push_back(min_time[i]);\\n\\t}\\n\\tsort(ans.begin(),ans.end());\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans.size());\\n\\tfor(int i = 0; i < ans.size(); i++){\\n\\n\\t\\tprintf(\\\"%.10lf\\\\n\\\",ans[i]);\\n\\t}\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d %d %d\\\",&N,&M,&B);\\n\\t\\tif(N == 0 && M == 0 && B == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3288,\n \"score_of_the_acc\": -0.1686,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2023_4761028\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 105\\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\\tvoid outPut(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\\\n\\\",p[0].x,p[0].y,p[1].x,p[1].y);\\n\\t}\\n\\tPoint p[2];\\n};\\n\\nstruct Info{\\n\\n\\tdouble T,vx,vy;\\n};\\n\\nstruct Ball{\\n\\n\\tdouble start_T,x,vx,vy,len,speed;\\n};\\n\\nint N,M,B;\\nint num_line;\\ndouble min_time[SIZE];\\nvector<double> ans;\\nPolygon P;\\nLine line[SIZE],work[SIZE];\\nInfo info[SIZE];\\nBall ball[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\\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\\n\\tdouble naiseki,norm1,norm2,gaiseki;\\n\\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\\n\\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\\n\\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\\n\\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\\n\\tif(gaiseki > EPS){\\n\\t\\treturn 1;\\n\\t}else if(gaiseki < -EPS){\\n\\t\\treturn -1;\\n\\t}\\n\\tif(naiseki < -EPS){\\n\\t\\treturn 2;\\n\\t}\\n\\n\\tif(norm1 < norm2){\\n\\t\\treturn -2;\\n\\t}\\n\\treturn 0;\\n}\\n\\n\\n//★★直線ではなく、線分の交差判定★★\\nbool is_Cross(Line a,Line b){\\n\\n\\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\\n\\t\\t\\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\n//交点を求める関数\\nPoint calc_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\\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\\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//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\n\\nPoint calc_Cross_Point(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\\nvoid func(){\\n\\n\\tP.clear();\\n\\tans.clear();\\n\\n\\tdouble x,y;\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&x,&y);\\n\\t\\tP.push_back(Point(x,y));\\n\\t}\\n\\n\\t//線分にする\\n\\tnum_line = 0;\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tline[num_line].p[0] = P[i];\\n\\t\\tline[num_line].p[1] = P[(i+1)%N];\\n\\t\\tnum_line++;\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf\\\",&info[i].T,&info[i].vx,&info[i].vy);\\n\\t}\\n\\n\\tfor(int i = 0; i < B; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf %lf\\\",&ball[i].start_T,&ball[i].x,&ball[i].vx,&ball[i].vy,&ball[i].len);\\n\\n\\t\\t//★?★\\n\\t\\t//ball[i].vx *= -1;\\n\\t\\t//ball[i].vy *= -1;\\n\\t\\tball[i].speed = sqrt(ball[i].vx*ball[i].vx+ball[i].vy*ball[i].vy);\\n\\t}\\n\\t//ダミー動作\\n\\tinfo[M].T = BIG_NUM;\\n\\tinfo[M].vx = 0;\\n\\tinfo[M].vy = 0;\\n\\tM++;\\n\\n\\n\\tfor(int i = 0; i < B; i++){\\n\\n\\t\\tmin_time[i] = BIG_NUM;//弾丸目線\\n\\t}\\n\\n\\tdouble add_x,add_y;\\n\\tdouble ball_x,ball_y;\\n\\tdouble span,diff_x,diff_y;\\n\\tdouble tmp_vx,tmp_vy;\\n\\n\\tLine ball_line;\\n\\tLine tmp_line;\\n\\n\\tfor(int i = 0; i < B; i++){\\n\\n\\t\\tadd_x = 0;\\n\\t\\tadd_y = 0;\\n\\n\\t\\tball_x = ball[i].x;\\n\\t\\tball_y = 0;\\n\\n\\t\\tdouble current = 0;\\n\\n\\t\\tfor(int k = 0; k < M; k++){\\n\\n\\t\\t\\t//pre-info[k].Tの間\\n\\t\\t\\tif(ball[i].start_T > info[k].T+EPS){\\n\\n\\t\\t\\t\\tadd_x += (info[k].T-current)*info[k].vx;\\n\\t\\t\\t\\tadd_y += (info[k].T-current)*info[k].vy;\\n\\n\\t\\t\\t\\tcurrent = info[k].T;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(ball[i].start_T > current+EPS){\\n\\n\\t\\t\\t\\tadd_x += (ball[i].start_T-current)*info[k].vx;\\n\\t\\t\\t\\tadd_y += (ball[i].start_T-current)*info[k].vy;\\n\\t\\t\\t\\tcurrent = ball[i].start_T;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int a = 0; a < num_line; a++){\\n\\n\\t\\t\\t\\twork[a].p[0].x = line[a].p[0].x+add_x;\\n\\t\\t\\t\\twork[a].p[0].y = line[a].p[0].y+add_y;\\n\\n\\t\\t\\t\\twork[a].p[1].x = line[a].p[1].x+add_x;\\n\\t\\t\\t\\twork[a].p[1].y = line[a].p[1].y+add_y;\\n\\t\\t\\t}\\n\\n\\n\\t\\t\\tball_line.p[0] = Point(ball_x,ball_y);\\n\\t\\t\\tball_line.p[1] = Point(ball_x-(ball[i].len/ball[i].speed)*ball[i].vx,\\n\\t\\t\\t\\t\\t\\t\\t\\t ball_y-(ball[i].len/ball[i].speed)*ball[i].vy);\\n\\n\\t\\t\\t//printf(\\\"弾丸(%.3lf,%.3lf)-(%.3lf,%.3lf)\\\\n\\\",ball_line.p[0].x,ball_line.p[0].y,ball_line.p[1].x,ball_line.p[1].y);\\n\\n\\t\\t\\t//弾丸静止\\n\\t\\t\\tspan = info[k].T-current;\\n\\t\\t\\ttmp_vx = info[k].vx-ball[i].vx;\\n\\t\\t\\ttmp_vy = info[k].vy-ball[i].vy;\\n\\n\\t\\t\\tdiff_x = span*tmp_vx;\\n\\t\\t\\tdiff_y = span*tmp_vy;\\n\\n\\t\\t\\t//printf(\\\"current:%.3lf vx:%.3lf vy:%.3lf diff_x:%.3lf diff_y:%.3lf\\\\n\\\",current,tmp_vx,tmp_vy,diff_x,diff_y);\\n\\n\\t\\t\\tfor(int a = 0; a < num_line; a++){\\n\\t\\t\\t\\tfor(int b = 0; b < 2; b++){\\n\\n\\t\\t\\t\\t\\ttmp_line.p[0] = work[a].p[b];\\n\\t\\t\\t\\t\\ttmp_line.p[1].x = tmp_line.p[0].x+diff_x;\\n\\t\\t\\t\\t\\ttmp_line.p[1].y = tmp_line.p[0].y+diff_y;\\n\\n\\t\\t\\t\\t\\tif(is_Cross(ball_line,tmp_line)){\\n\\n\\t\\t\\t\\t\\t\\tPoint cross_point = calc_Cross_Point(tmp_line,ball_line);\\n\\t\\t\\t\\t\\t\\tdouble all_len = calc_dist(tmp_line.p[0],tmp_line.p[1]);\\n\\t\\t\\t\\t\\t\\tdouble add_time = (calc_dist(cross_point,tmp_line.p[0])/all_len)*span;\\n\\n\\t\\t\\t\\t\\t\\tmin_time[i] = min(min_time[i],current+add_time);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t//多角形静止\\n\\t\\t\\ttmp_vx = ball[i].vx-info[k].vx;\\n\\t\\t\\ttmp_vy = ball[i].vy-info[k].vy;\\n\\n\\t\\t\\tdiff_x = span*tmp_vx;\\n\\t\\t\\tdiff_y = span*tmp_vy;\\n\\n\\t\\t\\t//printf(\\\"多角形静止 current:%.3lf vx:%.3lf vy:%.3lf diff_x:%.3lf diff_y:%.3lf\\\\n\\\",current,tmp_vx,tmp_vy,diff_x,diff_y);\\n\\n\\t\\t\\tfor(int b = 0; b < 2; b++){\\n\\n\\t\\t\\t\\ttmp_line.p[0] = ball_line.p[b];\\n\\t\\t\\t\\ttmp_line.p[1].x = tmp_line.p[0].x+diff_x;\\n\\t\\t\\t\\ttmp_line.p[1].y = tmp_line.p[0].y+diff_y;\\n\\n\\t\\t\\t\\t//printf(\\\"b:%d\\\\n\\\",b);\\n\\t\\t\\t\\t//tmp_line.outPut();\\n\\n\\t\\t\\t\\tfor(int a = 0; a < num_line; a++){\\n\\t\\t\\t\\t\\tif(is_Cross(tmp_line,work[a])){\\n\\n\\t\\t\\t\\t\\t\\tPoint cross_point = calc_Cross_Point(tmp_line,work[a]);\\n\\t\\t\\t\\t\\t\\tdouble all_len = calc_dist(tmp_line.p[0],tmp_line.p[1]);\\n\\t\\t\\t\\t\\t\\tdouble add_time = (calc_dist(cross_point,tmp_line.p[0])/all_len)*span;\\n\\n\\t\\t\\t\\t\\t\\tmin_time[i] = min(min_time[i],current+add_time);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tadd_x += span*info[k].vx;\\n\\t\\t\\tadd_y += span*info[k].vy;\\n\\n\\t\\t\\tball_x += span*ball[i].vx;\\n\\t\\t\\tball_y += span*ball[i].vy;\\n\\n\\t\\t\\tcurrent = info[k].T;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < B; i++){\\n\\n\\t\\tif(fabs(min_time[i]-BIG_NUM) < EPS)continue;\\n\\t\\tans.push_back(min_time[i]);\\n\\t}\\n\\tsort(ans.begin(),ans.end());\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans.size());\\n\\tfor(int i = 0; i < ans.size(); i++){\\n\\n\\t\\tprintf(\\\"%.10lf\\\\n\\\",ans[i]);\\n\\t}\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d %d %d\\\",&N,&M,&B);\\n\\t\\tif(N == 0 && M == 0 && B == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -0.1683,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2023_3678148\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<map>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<iomanip>\\n\\nusing namespace std;\\n#define rep(i,n) for(int i = 0 ; i < n ; ++i)\\nusing ll = long long;\\nusing ld = long double;\\nusing Point = complex<ld>;\\nconst ld eps = 1e-9;\\n\\nbool eq(ld a, ld b){\\n return abs(a-b)<eps;\\n}\\n\\nld dot(Point a, Point b){\\n return real(conj(a)*b);\\n}\\n\\nld cross(Point a, Point b){\\n return imag(conj(a)*b);\\n}\\n\\nstruct Line{\\n Point a, b;\\n};\\n\\nbool isis_ll(Line l, Line m){\\n return !eq(cross(l.b-l.a, m.b-m.a),0);\\n}\\n\\nbool isis_ls(Line l, Line s){\\n return (cross(l.b-l.a,s.a-l.a)*cross(l.b-l.a,s.b-l.a)<eps);\\n}\\n\\nPoint is_ll(Line s, Line t){\\n Point sv= s.b-s.a, tv = t.b-t.a;\\n return s.a + sv * cross(tv, t.a-s.a)/cross(tv,sv);\\n}\\n\\n\\nvoid solve(int n,int k,int m){\\n Point p[n];\\n rep(i,n){\\n int x,y;\\n cin>>x>>y;\\n p[i]=Point(x,y);\\n }\\n vector<ld> t(k+1,1e9);\\n vector<Point> v(k+1);\\n rep(i,k){\\n int x,y;\\n cin>>t[i]>>x>>y;\\n v[i]=Point(x,y);\\n }\\n vector<ld> bt(m);\\n vector<Point> bp(m),bq(m), bv(m);\\n rep(i,m){\\n cin>>bt[i];\\n ld x,vx,vy,l;\\n cin>>x>>vx>>vy>>l;\\n bv[i]=Point(vx,vy);\\n bp[i]=Point(x,0);\\n bq[i]=Point(x-l*vx/abs(bv[i]),-l*vy/abs(bv[i]));\\n bp[i]-=bt[i]*bv[i];\\n bq[i]-=bt[i]*bv[i];\\n }\\n vector<ld> ans(m,1e9+7);\\n ld st = 0;\\n rep(i,k+1){\\n rep(j,n){\\n rep(bi,m){\\n if(t[i]<bt[bi])continue;\\n Point nxt = p[j]+v[i]-bv[bi];\\n if(abs(nxt-p[j])<eps)continue;\\n Line l = {p[j],nxt};\\n Line bl = {bp[bi],bq[bi]};\\n if(!isis_ls(l,bl))continue;\\n if(eq(cross(l.a-l.b, bl.a-bl.b),0))continue;\\n Point cp = is_ll(l,bl);\\n ld ct = st + real((cp-p[j])/(nxt-p[j]));\\n if(st-eps<ct&&ct<t[i]+eps&&ct>bt[bi]-eps){\\n ans[bi]=min(ans[bi],ct);\\n }\\n }\\n }\\n rep(j,n){\\n Line s = {p[j],p[(j+1)%n]};\\n rep(bi,m){\\n if(t[i]<bt[bi])continue;\\n Point nxt = bp[bi]-v[i]+bv[bi];\\n if(abs(nxt-bp[bi])<eps)continue;\\n Line bl = {bp[bi],nxt};\\n if(!isis_ls(bl,s))continue;\\n if(eq(cross(s.a-s.b, bl.a-bl.b),0))continue;\\n Point cp = is_ll(bl,s);\\n ld ct = st + real((cp-bp[bi])/(nxt-bp[bi]));\\n if(st-eps<ct&&ct<t[i]+eps&&ct>bt[bi]-eps){\\n ans[bi]=min(ans[bi],ct);\\n }\\n }\\n rep(bi,m){\\n if(t[i]<bt[bi])continue;\\n Point nxt = bq[bi]-v[i]+bv[bi];\\n if(abs(nxt-bq[bi])<eps)continue;\\n Line bl = {bq[bi],nxt};\\n if(!isis_ls(bl,s))continue;\\n if(eq(cross(s.a-s.b, bl.a-bl.b),0))continue;\\n Point cp = is_ll(bl,s);\\n ld ct = st + real((cp-bq[bi])/(nxt-bq[bi]));\\n if(st-eps<ct&&ct<t[i]+eps&&ct>bt[bi]-eps){\\n ans[bi]=min(ans[bi],ct);\\n }\\n }\\n }\\n rep(j,n){\\n p[j]+=(ld)(t[i]-st)*v[i];\\n }\\n rep(j,m){\\n bp[j]+=(t[i]-st)*bv[j];\\n bq[j]+=(t[i]-st)*bv[j];\\n }\\n st = t[i];\\n }\\n vector<ld> at;\\n rep(i,m){\\n if(ans[i]<1e9){\\n at.push_back(ans[i]);\\n }\\n }\\n sort(at.begin(),at.end());\\n cout<<at.size()<<endl;\\n rep(i,at.size()){\\n cout<<at[i]<<endl;\\n }\\n}\\n\\nint main(){\\n int n,k,m;\\n cout<<fixed<<setprecision(10);\\n while(cin>>n>>k>>m,n!=0)solve(n,k,m);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3384,\n \"score_of_the_acc\": -0.1933,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2023_3657209\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\nusing ll = 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#define F first\\n#define S second\\n\\n\\nnamespace Geometry{\\n typedef long double D;\\n typedef complex<long double> P;\\n typedef pair<P,D> C;\\n \\n const D EPS=1e-9;\\n const D PI=asin(1)*2;\\n const D INF=1e18;\\n \\n const static bool comp(const P &p1,const P &p2){return p1.real()==p2.real()?p1.imag()<p2.imag():p1.real()<p2.real();}\\n \\n D dot(P p1,P p2){return p1.real()*p2.real()+p1.imag()*p2.imag();}\\n \\n D cross(P p1,P p2){return p1.real()*p2.imag()-p1.imag()*p2.real();}\\n \\n P project(P vec,P x){return vec*(x/vec).real();}\\n \\n P project(P p1,P p2,P x){return p1+project(p2-p1,x-p1);}\\n \\n P reflect(P vec,P x){return vec*conj(x/vec);}\\n \\n P reflect(P p1,P p2,P x){return p1+reflect(p2-p1,x-p1);}\\n \\n bool intersectSL(P p1,P p2,P vec){vec/=abs(vec); p1/=vec; p2/=vec; return (p1.imag()<EPS && p2.imag()>-EPS) || (p1.imag()>-EPS && p2.imag()<EPS);}\\n \\n bool intersectSL(P p1,P p2,P p3,P p4){return intersectSL(p1-p4,p2-p4,p3-p4);}\\n \\n bool intersectSS(P p1,P p2,P p3,P p4){return (dot(p2-p1,p3-p1)<-EPS && dot(p2-p1,p4-p1)<-EPS) || (dot(p1-p2,p3-p2)<-EPS && dot(p1-p2,p4-p2)<-EPS)?false:intersectSL(p1,p2,p3,p4) && intersectSL(p3,p4,p1,p2);}\\n \\n D distLP(P vec,P x){return abs((x/vec).imag())*abs(vec);}\\n \\n D distLP(P p1,P p2,P x){return distLP(p2-p1,x-p1);}\\n \\n D distSP(P p1,P p2,P x){return dot(p2-p1,x-p1)<-EPS?abs(x-p1):dot(p1-p2,x-p2)<-EPS?abs(x-p2):distLP(p1,p2,x);}\\n \\n D distSS(P p1,P p2,P p3,P p4){return intersectSS(p1,p2,p3,p4)?0.0:min(min(distSP(p1,p2,p3),distSP(p1,p2,p4)),min(distSP(p3,p4,p1),distSP(p3,p4,p2)));}\\n \\n P crosspointLL(P p1,P p2,P vec){return abs(cross(p2-p1,vec))<EPS?vec:vec*cross(p2-p1,p2)/cross(p2-p1,vec);}\\n \\n P crosspointLL(P p1,P p2,P p3,P p4){return p4+crosspointLL(p1-p4,p2-p4,p3-p4);}\\n \\n P crosspointSS(P p1,P p2,P p3,P p4){return distSP(p1,p2,p3)<EPS?p3:distSP(p1,p2,p4)<EPS?p4:crosspointLL(p1,p2,p3,p4);}\\n \\n bool intersectShL(P p1,P p2,P vec){vec/=abs(vec); return intersectSL(p1,p2,vec) && crosspointLL(p1/vec,p2/vec,vec/vec).real()>-EPS;}\\n \\n bool intersectShL(P p1,P p2,P p3,P p4){return intersectShL(p1-p3,p2-p3,p4-p3);}\\n \\n //1::in,0::on edge,-1::out\\n int contain(const vector<P> &poly,const P &p){\\n vector<P> A={{65537,96847},{-24061,6701},{56369,-86509},{-93763,-78049},{56957,10007}};\\n vector<bool> cnt(5,false);\\n for(int i=1;i<=poly.size();i++){\\n if(distSP(poly[i-1],poly[i%poly.size()],p)<EPS){return 0;}\\n for(int j=0;j<5;j++){\\n if(intersectShL(poly[i-1],poly[i%poly.size()],p,p+A[j])){cnt[j]=!cnt[j];}\\n }\\n }\\n int in=0;\\n for(int j=0;j<5;j++){if(cnt[j]){in++;}}\\n return in>=3?1:-1;\\n }\\n \\n vector<P> convexcut(const vector<P> &poly,P p1,P p2){\\n vector<P> ret;\\n for(int i=1;i<=poly.size();i++){\\n if(cross(p2-p1,poly[i-1]-p1)>-EPS){ret.push_back(poly[i-1]);}\\n if(intersectSL(poly[i-1],poly[i%poly.size()],p1,p2) && distLP(p1,p2,poly[i-1])>EPS && distLP(p1,p2,poly[i%poly.size()])>EPS){ret.push_back(crosspointLL(poly[i-1],poly[i%poly.size()],p1,p2));}\\n }\\n return ret;\\n }\\n \\n D area(const vector<P> &poly){\\n D ans=0;\\n for(int i=2;i<poly.size();i++){ans+=cross(poly[i-1]-poly[0],poly[i]-poly[0]);}\\n return abs(ans)/2;\\n }\\n \\n vector<P> convexhull(vector<P> pts){\\n vector<P> ret;\\n sort(pts.begin(),pts.end(),comp);\\n for(auto &I:pts){\\n if(!ret.empty() && I==ret.back()){continue;}\\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\\n ret.push_back(I);\\n }\\n reverse(pts.begin(),pts.end());\\n for(auto &I:pts){\\n if(!ret.empty() && I==ret.back()){continue;}\\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\\n ret.push_back(I);\\n }\\n if(ret[0]==ret.back()){ret.pop_back();}\\n return ret;\\n }\\n \\n //4::seperate,3::circumscribe,2::intersect,1::inscribe,0::contain,-1::same\\n int intersectCC(C c1,C c2){\\n D d=abs(c1.F-c2.F),r=c1.S+c2.S,dif=abs(c2.S-c1.S);\\n if(d<EPS && dif<EPS){return -1;}\\n if(d-r>EPS){return 4;}\\n if(d-r>-EPS){return 3;}\\n if(d-dif>EPS){return 2;}\\n if(d-dif>-EPS){return 1;}\\n return 0;\\n }\\n \\n vector<P> crosspointLC(P p1,P p2,C c){\\n vector<P> ret;\\n P pr=project(p1,p2,c.F);\\n D d=distLP(p1,p2,c.F);\\n if(d-c.S>EPS){return ret;}\\n if(d-c.S>-EPS){ret.push_back(pr); return ret;}\\n P vec=p2-p1; vec*=sqrt(c.S*c.S-d*d)/abs(vec);\\n ret.push_back(pr-vec);\\n ret.push_back(pr+vec);\\n return ret;\\n }\\n \\n vector<P> crosspointSC(P p1,P p2,C c){\\n vector<P> ret;\\n for(auto &I:crosspointLC(p1,p2,c)){if(distSP(p1,p2,I)<EPS){ret.push_back(I);}}\\n return ret;\\n }\\n \\n vector<P> crosspointCC(C c1,C c2){\\n vector<P> ret;\\n P vec=c2.F-c1.F;\\n D base=(c1.S*c1.S+norm(vec)-c2.S*c2.S)/(2*abs(vec));\\n D h=sqrt(c1.S*c1.S-base*base);\\n vec/=abs(vec);\\n ret.push_back(c1.F+vec*P(base,h));\\n ret.push_back(c1.F+vec*P(base,-h));\\n return ret;\\n }\\n \\n vector<P> tangentCP(C c,P p){return crosspointCC(c,C(p,sqrt(norm(c.F-p)-c.S*c.S)));}\\n \\n vector<pair<P,P>> tangentCC(C c1,C c2){\\n vector<pair<P,P>> ret;\\n P d=c2.F-c1.F;\\n for(D i:{-1,1}){\\n D r=c1.S+c2.S*i;\\n if(intersectCC(c1,c2)>i+1){\\n for(P s:{-1i,1i}){\\n P p=r+s*sqrt(norm(d)-norm(r));\\n ret.push_back({c1.F+d*c1.S/norm(d)*p,c2.F-d*i*c2.S/norm(d)*p});\\n }\\n }\\n }\\n return ret;\\n }\\n \\n D area(const vector<P> &poly,C c){\\n D ret=0;\\n for(int i=0;i<poly.size();i++){\\n P a=poly[i]-c.F,b=poly[(i+1)%poly.size()]-c.F;\\n if(abs(a)<c.S+EPS && abs(b)<c.S+EPS){ret+=cross(a,b);}\\n else{\\n vector<P> A=crosspointSC(a,b,{0,c.S});\\n if(A.empty()){ret+=c.S*c.S*arg(b/a);}\\n else{\\n ret+=(abs(a)<c.S?cross(a,A[0]):c.S*c.S*arg(A[0]/a));\\n ret+=(abs(b)<c.S?cross(A.back(),b):c.S*c.S*arg(b/A.back()));\\n ret+=cross(A[0],A.back());\\n }\\n }\\n }\\n return abs(ret)/2;\\n }\\n \\n //反時計回り\\n D diameter(const vector<P> &poly){\\n D ret=0;\\n ll l=0,r=0,n=poly.size();\\n if(n==2){return abs(poly[0]-poly[1]);}\\n for(int i=0;i<n;i++){\\n if(comp(poly[l],poly[i])){l=i;}\\n if(comp(poly[i],poly[r])){r=i;}\\n }\\n ll sl=r,sr=l;\\n while(sl!=l || sr!=r){\\n ret=max(ret,abs(poly[r]-poly[l]));\\n if(cross(poly[(l+1)%n]-poly[l],poly[(r+1)%n]-poly[r])<0){(++l)%=n;}\\n else{(++r)%=n;}\\n }\\n return ret;\\n }\\n \\n D closestpair(vector<P> pt){\\n sort(pt.begin(),pt.end(),comp);\\n D ret=INF;\\n for(ll i=1;i<pt.size();i<<=1){\\n for(ll j=0;i+j<pt.size();j+=i*2){\\n ll m=i+j;\\n vector<P> R;\\n D l=-INF,r=INF;\\n for(ll k=j;k<m;k++){l=max(l,pt[k].real());}\\n for(ll k=0;m+k<pt.size() && k<i;k++){r=min(r,pt[m+k].real());}\\n for(ll k=0;m+k<pt.size() && k<i;k++){if(pt[m+k].real()-l<ret){R.push_back(pt[m+k]);}}\\n ll idx=0;\\n for(ll k=j;k<m;k++){\\n if(r-pt[k].real()>ret){continue;}\\n while(idx<R.size() && pt[k].imag()-R[idx].imag()>ret){idx++;}\\n for(ll n=idx;n<R.size() && R[n].imag()-pt[k].imag()<ret;n++){ret=min(ret,abs(R[n]-pt[k]));}\\n }\\n inplace_merge(pt.begin()+j,pt.begin()+m,j+i*2<pt.size()?pt.begin()+j+2*i:pt.end(),[](const P &a,const P &b){return a.imag()==b.imag()?a.real()<b.real():a.imag()<b.imag();});\\n }\\n }\\n return ret;\\n }\\n \\n istream & operator >> (istream &i,P &p){D x,y; i>>x>>y; p={x,y}; return i;}\\n istream & operator >> (istream &i,C &p){D x,y; i>>x>>y>>p.S; p.F={x,y}; return i;}\\n};\\nusing namespace Geometry;\\nbool contain(P p,vector<P> &poly){\\n D a=0;\\n if(area(poly)<EPS){return false;}\\n for(int i=1;i<=poly.size();i++){\\n a+=area({p,poly[i-1],poly[i%poly.size()]});\\n }\\n return abs(a-area(poly))<EPS;\\n}\\n\\n\\n\\nvector<P> sqar(pair<P,P> L,P vec,D t){\\n return {L.F,L.S,L.S+vec*t,L.F+vec*t};\\n}\\n\\nbool intersectPP(vector<P> poly,vector<P> me){\\n for(int i=1;i<=me.size();i++){\\n if(contain(poly,me[i-1])!=-1){return true;}\\n for(int j=1;j<=poly.size();j++){\\n //if(intersect({poly[j-1],poly[j%poly.size()]},{me[i-1],me[i%me.size()]},true)){return true;}\\n if(intersectSS(poly[j-1],poly[j%poly.size()],me[i-1],me[i%me.size()])){return true;}\\n }\\n }\\n return false;\\n}\\n\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n ll n,m,b;\\n while(cin>>n>>m>>b,n){\\n vector<P> A(n);\\n for(auto &I:A){\\n D x,y;\\n cin>>x>>y;\\n I={x,y};\\n }\\n vector<pair<P,D>> V(m);\\n for(auto &I:V){\\n D x,y;\\n cin>>I.S>>x>>y;\\n I.F={x,y};\\n }\\n \\n V.push_back({{0,0},INF});\\n vector<pair<pair<P,P>,P>> L(b);\\n for(auto &I:L){\\n D t,X,x,y,l;\\n cin>>t>>X>>x>>y>>l;\\n I.F.F=P(X,0);\\n I.S={x,y};\\n I.F.S=I.F.F-I.S/abs(I.S)*l;\\n I.F.F-=I.S*t;\\n I.F.S-=I.S*t;\\n }\\n for(ll i=m-1;i>0;i--){V[i].S-=V[i-1].S;}\\n vector<D> ans(b,INF*2);\\n \\n for(int i=0;i<b;i++){\\n pair<P,P> l=L[i].F;\\n D time=0;\\n for(auto &I:V){\\n P vec=L[i].S-I.F;\\n auto judge=[&](D t){return intersectPP(sqar(l,vec,t),A);};\\n if(!judge(I.S)){\\n\\ttime+=I.S;\\n\\tl.F+=vec*I.S;\\n\\tl.S+=vec*I.S;\\n\\tcontinue;\\n }\\n D lf=0,rg=I.S;\\n for(int k=0;k<100;k++){\\n\\tD m=(lf+rg)/2;\\n\\tif(judge(m)){rg=m;}\\n\\telse{lf=m;}\\n }\\n ans[i]=lf+time;\\n // cout<<i<<\\\" \\\"<<I.F<<\\\" \\\"<<I.S<<\\\" \\\"<<lf<<\\\" \\\"<<time<<endl;\\n break;\\n }\\n }\\n sort(ans.begin(),ans.end());\\n ll cnt=0;\\n for(auto &I:ans){if(I<INF){cnt++;}}\\n cout<<cnt<<endl;\\n if(cnt==6&&ans[0]<EPS){\\n //cerr<<n<<\\\" \\\"<<m<<\\\" \\\"<<b<<endl;\\n }\\n for(int i=0;i<cnt;i++){\\n cout<<fixed<<setprecision(12)<<ans[i]<<endl;\\n }\\n } \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2900,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -0.6195,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2023_3657205\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\nusing ll = 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#define F first\\n#define S second\\n\\n\\nnamespace Geometry{\\n typedef long double D;\\n typedef complex<long double> P;\\n typedef pair<P,D> C;\\n \\n const D EPS=1e-9;\\n const D PI=asin(1)*2;\\n const D INF=1e18;\\n \\n const static bool comp(const P &p1,const P &p2){return p1.real()==p2.real()?p1.imag()<p2.imag():p1.real()<p2.real();}\\n \\n D dot(P p1,P p2){return p1.real()*p2.real()+p1.imag()*p2.imag();}\\n \\n D cross(P p1,P p2){return p1.real()*p2.imag()-p1.imag()*p2.real();}\\n \\n P project(P vec,P x){return vec*(x/vec).real();}\\n \\n P project(P p1,P p2,P x){return p1+project(p2-p1,x-p1);}\\n \\n P reflect(P vec,P x){return vec*conj(x/vec);}\\n \\n P reflect(P p1,P p2,P x){return p1+reflect(p2-p1,x-p1);}\\n \\n bool intersectSL(P p1,P p2,P vec){vec/=abs(vec); p1/=vec; p2/=vec; return (p1.imag()<EPS && p2.imag()>-EPS) || (p1.imag()>-EPS && p2.imag()<EPS);}\\n \\n bool intersectSL(P p1,P p2,P p3,P p4){return intersectSL(p1-p4,p2-p4,p3-p4);}\\n \\n bool intersectSS(P p1,P p2,P p3,P p4){return (dot(p2-p1,p3-p1)<-EPS && dot(p2-p1,p4-p1)<-EPS) || (dot(p1-p2,p3-p2)<-EPS && dot(p1-p2,p4-p2)<-EPS)?false:intersectSL(p1,p2,p3,p4) && intersectSL(p3,p4,p1,p2);}\\n \\n D distLP(P vec,P x){return abs((x/vec).imag())*abs(vec);}\\n \\n D distLP(P p1,P p2,P x){return distLP(p2-p1,x-p1);}\\n \\n D distSP(P p1,P p2,P x){return dot(p2-p1,x-p1)<-EPS?abs(x-p1):dot(p1-p2,x-p2)<-EPS?abs(x-p2):distLP(p1,p2,x);}\\n \\n D distSS(P p1,P p2,P p3,P p4){return intersectSS(p1,p2,p3,p4)?0.0:min(min(distSP(p1,p2,p3),distSP(p1,p2,p4)),min(distSP(p3,p4,p1),distSP(p3,p4,p2)));}\\n \\n P crosspointLL(P p1,P p2,P vec){return abs(cross(p2-p1,vec))<EPS?vec:vec*cross(p2-p1,p2)/cross(p2-p1,vec);}\\n \\n P crosspointLL(P p1,P p2,P p3,P p4){return p4+crosspointLL(p1-p4,p2-p4,p3-p4);}\\n \\n P crosspointSS(P p1,P p2,P p3,P p4){return distSP(p1,p2,p3)<EPS?p3:distSP(p1,p2,p4)<EPS?p4:crosspointLL(p1,p2,p3,p4);}\\n \\n bool intersectShL(P p1,P p2,P vec){vec/=abs(vec); return intersectSL(p1,p2,vec) && crosspointLL(p1/vec,p2/vec,vec/vec).real()>-EPS;}\\n \\n bool intersectShL(P p1,P p2,P p3,P p4){return intersectShL(p1-p3,p2-p3,p4-p3);}\\n \\n //1::in,0::on edge,-1::out\\n int contain(const vector<P> &poly,const P &p){\\n vector<P> A={{65537,96847},{-24061,6701},{56369,-86509},{-93763,-78049},{56957,10007}};\\n vector<bool> cnt(5,false);\\n for(int i=1;i<=poly.size();i++){\\n if(distSP(poly[i-1],poly[i%poly.size()],p)<EPS){return 0;}\\n for(int j=0;j<5;j++){\\n if(intersectShL(poly[i-1],poly[i%poly.size()],p,p+A[j])){cnt[j]=!cnt[j];}\\n }\\n }\\n int in=0;\\n for(int j=0;j<5;j++){if(cnt[j]){in++;}}\\n return in>=3?1:-1;\\n }\\n \\n vector<P> convexcut(const vector<P> &poly,P p1,P p2){\\n vector<P> ret;\\n for(int i=1;i<=poly.size();i++){\\n if(cross(p2-p1,poly[i-1]-p1)>-EPS){ret.push_back(poly[i-1]);}\\n if(intersectSL(poly[i-1],poly[i%poly.size()],p1,p2) && distLP(p1,p2,poly[i-1])>EPS && distLP(p1,p2,poly[i%poly.size()])>EPS){ret.push_back(crosspointLL(poly[i-1],poly[i%poly.size()],p1,p2));}\\n }\\n return ret;\\n }\\n \\n D area(const vector<P> &poly){\\n D ans=0;\\n for(int i=2;i<poly.size();i++){ans+=cross(poly[i-1]-poly[0],poly[i]-poly[0]);}\\n return abs(ans)/2;\\n }\\n \\n vector<P> convexhull(vector<P> pts){\\n vector<P> ret;\\n sort(pts.begin(),pts.end(),comp);\\n for(auto &I:pts){\\n if(!ret.empty() && I==ret.back()){continue;}\\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\\n ret.push_back(I);\\n }\\n reverse(pts.begin(),pts.end());\\n for(auto &I:pts){\\n if(!ret.empty() && I==ret.back()){continue;}\\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\\n ret.push_back(I);\\n }\\n if(ret[0]==ret.back()){ret.pop_back();}\\n return ret;\\n }\\n \\n //4::seperate,3::circumscribe,2::intersect,1::inscribe,0::contain,-1::same\\n int intersectCC(C c1,C c2){\\n D d=abs(c1.F-c2.F),r=c1.S+c2.S,dif=abs(c2.S-c1.S);\\n if(d<EPS && dif<EPS){return -1;}\\n if(d-r>EPS){return 4;}\\n if(d-r>-EPS){return 3;}\\n if(d-dif>EPS){return 2;}\\n if(d-dif>-EPS){return 1;}\\n return 0;\\n }\\n \\n vector<P> crosspointLC(P p1,P p2,C c){\\n vector<P> ret;\\n P pr=project(p1,p2,c.F);\\n D d=distLP(p1,p2,c.F);\\n if(d-c.S>EPS){return ret;}\\n if(d-c.S>-EPS){ret.push_back(pr); return ret;}\\n P vec=p2-p1; vec*=sqrt(c.S*c.S-d*d)/abs(vec);\\n ret.push_back(pr-vec);\\n ret.push_back(pr+vec);\\n return ret;\\n }\\n \\n vector<P> crosspointSC(P p1,P p2,C c){\\n vector<P> ret;\\n for(auto &I:crosspointLC(p1,p2,c)){if(distSP(p1,p2,I)<EPS){ret.push_back(I);}}\\n return ret;\\n }\\n \\n vector<P> crosspointCC(C c1,C c2){\\n vector<P> ret;\\n P vec=c2.F-c1.F;\\n D base=(c1.S*c1.S+norm(vec)-c2.S*c2.S)/(2*abs(vec));\\n D h=sqrt(c1.S*c1.S-base*base);\\n vec/=abs(vec);\\n ret.push_back(c1.F+vec*P(base,h));\\n ret.push_back(c1.F+vec*P(base,-h));\\n return ret;\\n }\\n \\n vector<P> tangentCP(C c,P p){return crosspointCC(c,C(p,sqrt(norm(c.F-p)-c.S*c.S)));}\\n \\n vector<pair<P,P>> tangentCC(C c1,C c2){\\n vector<pair<P,P>> ret;\\n P d=c2.F-c1.F;\\n for(D i:{-1,1}){\\n D r=c1.S+c2.S*i;\\n if(intersectCC(c1,c2)>i+1){\\n for(P s:{-1i,1i}){\\n P p=r+s*sqrt(norm(d)-norm(r));\\n ret.push_back({c1.F+d*c1.S/norm(d)*p,c2.F-d*i*c2.S/norm(d)*p});\\n }\\n }\\n }\\n return ret;\\n }\\n \\n D area(const vector<P> &poly,C c){\\n D ret=0;\\n for(int i=0;i<poly.size();i++){\\n P a=poly[i]-c.F,b=poly[(i+1)%poly.size()]-c.F;\\n if(abs(a)<c.S+EPS && abs(b)<c.S+EPS){ret+=cross(a,b);}\\n else{\\n vector<P> A=crosspointSC(a,b,{0,c.S});\\n if(A.empty()){ret+=c.S*c.S*arg(b/a);}\\n else{\\n ret+=(abs(a)<c.S?cross(a,A[0]):c.S*c.S*arg(A[0]/a));\\n ret+=(abs(b)<c.S?cross(A.back(),b):c.S*c.S*arg(b/A.back()));\\n ret+=cross(A[0],A.back());\\n }\\n }\\n }\\n return abs(ret)/2;\\n }\\n \\n //反時計回り\\n D diameter(const vector<P> &poly){\\n D ret=0;\\n ll l=0,r=0,n=poly.size();\\n if(n==2){return abs(poly[0]-poly[1]);}\\n for(int i=0;i<n;i++){\\n if(comp(poly[l],poly[i])){l=i;}\\n if(comp(poly[i],poly[r])){r=i;}\\n }\\n ll sl=r,sr=l;\\n while(sl!=l || sr!=r){\\n ret=max(ret,abs(poly[r]-poly[l]));\\n if(cross(poly[(l+1)%n]-poly[l],poly[(r+1)%n]-poly[r])<0){(++l)%=n;}\\n else{(++r)%=n;}\\n }\\n return ret;\\n }\\n \\n D closestpair(vector<P> pt){\\n sort(pt.begin(),pt.end(),comp);\\n D ret=INF;\\n for(ll i=1;i<pt.size();i<<=1){\\n for(ll j=0;i+j<pt.size();j+=i*2){\\n ll m=i+j;\\n vector<P> R;\\n D l=-INF,r=INF;\\n for(ll k=j;k<m;k++){l=max(l,pt[k].real());}\\n for(ll k=0;m+k<pt.size() && k<i;k++){r=min(r,pt[m+k].real());}\\n for(ll k=0;m+k<pt.size() && k<i;k++){if(pt[m+k].real()-l<ret){R.push_back(pt[m+k]);}}\\n ll idx=0;\\n for(ll k=j;k<m;k++){\\n if(r-pt[k].real()>ret){continue;}\\n while(idx<R.size() && pt[k].imag()-R[idx].imag()>ret){idx++;}\\n for(ll n=idx;n<R.size() && R[n].imag()-pt[k].imag()<ret;n++){ret=min(ret,abs(R[n]-pt[k]));}\\n }\\n inplace_merge(pt.begin()+j,pt.begin()+m,j+i*2<pt.size()?pt.begin()+j+2*i:pt.end(),[](const P &a,const P &b){return a.imag()==b.imag()?a.real()<b.real():a.imag()<b.imag();});\\n }\\n }\\n return ret;\\n }\\n \\n istream & operator >> (istream &i,P &p){D x,y; i>>x>>y; p={x,y}; return i;}\\n istream & operator >> (istream &i,C &p){D x,y; i>>x>>y>>p.S; p.F={x,y}; return i;}\\n};\\nusing namespace Geometry;\\nbool contain(P p,vector<P> &poly){\\n D a=0;\\n if(area(poly)<EPS){return false;}\\n for(int i=1;i<=poly.size();i++){\\n a+=area({p,poly[i-1],poly[i%poly.size()]});\\n }\\n return abs(a-area(poly))<EPS;\\n}\\n\\n\\n\\nvector<P> sqar(pair<P,P> L,P vec,D t){\\n return {L.F,L.S,L.S+vec*t,L.F+vec*t};\\n}\\n\\nbool intersectPP(vector<P> poly,vector<P> me){\\n for(int i=1;i<=me.size();i++){\\n if(contain(me[i-1],poly)){return true;}\\n for(int j=1;j<=poly.size();j++){\\n //if(intersect({poly[j-1],poly[j%poly.size()]},{me[i-1],me[i%me.size()]},true)){return true;}\\n if(intersectSS(poly[j-1],poly[j%poly.size()],me[i-1],me[i%me.size()])){return true;}\\n }\\n }\\n return false;\\n}\\n\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n ll n,m,b;\\n while(cin>>n>>m>>b,n){\\n vector<P> A(n);\\n for(auto &I:A){\\n D x,y;\\n cin>>x>>y;\\n I={x,y};\\n }\\n vector<pair<P,D>> V(m);\\n for(auto &I:V){\\n D x,y;\\n cin>>I.S>>x>>y;\\n I.F={x,y};\\n }\\n \\n V.push_back({{0,0},INF});\\n vector<pair<pair<P,P>,P>> L(b);\\n for(auto &I:L){\\n D t,X,x,y,l;\\n cin>>t>>X>>x>>y>>l;\\n I.F.F=P(X,0);\\n I.S={x,y};\\n I.F.S=I.F.F-I.S/abs(I.S)*l;\\n I.F.F-=I.S*t;\\n I.F.S-=I.S*t;\\n }\\n for(ll i=m-1;i>0;i--){V[i].S-=V[i-1].S;}\\n vector<D> ans(b,INF*2);\\n \\n for(int i=0;i<b;i++){\\n pair<P,P> l=L[i].F;\\n D time=0;\\n for(auto &I:V){\\n P vec=L[i].S-I.F;\\n auto judge=[&](D t){return intersectPP(sqar(l,vec,t),A);};\\n if(!judge(I.S)){\\n\\ttime+=I.S;\\n\\tl.F+=vec*I.S;\\n\\tl.S+=vec*I.S;\\n\\tcontinue;\\n }\\n D lf=0,rg=I.S;\\n for(int k=0;k<100;k++){\\n\\tD m=(lf+rg)/2;\\n\\tif(judge(m)){rg=m;}\\n\\telse{lf=m;}\\n }\\n ans[i]=lf+time;\\n // cout<<i<<\\\" \\\"<<I.F<<\\\" \\\"<<I.S<<\\\" \\\"<<lf<<\\\" \\\"<<time<<endl;\\n break;\\n }\\n }\\n sort(ans.begin(),ans.end());\\n ll cnt=0;\\n for(auto &I:ans){if(I<INF){cnt++;}}\\n cout<<cnt<<endl;\\n if(cnt==6&&ans[0]<EPS){\\n //cerr<<n<<\\\" \\\"<<m<<\\\" \\\"<<b<<endl;\\n }\\n for(int i=0;i<cnt;i++){\\n cout<<fixed<<setprecision(12)<<ans[i]<<endl;\\n }\\n } \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 3296,\n \"score_of_the_acc\": -0.2192,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2023_3657182\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\nusing ll = 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#define F first\\n#define S second\\n\\nnamespace Geometry{\\n\\n typedef long double D;\\n typedef complex<long double> P;\\n typedef pair<P, D> C;\\n\\n const D EPS = 1e-8;\\n const D PI = asin(1) * 2;\\n const D INF = 1e18;\\n \\n D dot(P p1, P p2){\\n return p1.real() * p2.real() + p1.imag() * p2.imag();\\n }\\n\\n D cross(P p1, P p2){\\n return p1.real() * p2.imag() - p1.imag() * p2.real();\\n }\\n\\n D area(const vector<P> poly){\\n D ans = 0;\\n for(int i=2;i<(int)poly.size();i++)\\n ans += cross(poly[i-1] - poly[0], poly[i] - poly[0]);\\n return abs(ans)/2;\\n }\\n\\n bool intersectSL(P p1, P p2, P vec){\\n vec /= abs(vec); p1 /= vec, p2/= vec;\\n return\\n (p1.imag() < EPS && p2.imag() >= -EPS) ||\\n (p1.imag() > -EPS && p2.imag() < EPS);\\n }\\n bool intersectSL(P p1, P p2, P p3, P p4){\\n return intersectSL(p1 - p4, p2 - p4, p3 - p4);\\n }\\n\\n bool intersectSS(P p1, P p2, P p3, P p4){\\n return\\n (dot(p2 -p1, p3 - p1) < -EPS && dot(p2 - p1, p4 - p1) < -EPS) ||\\n\\t\\t\\t (dot(p1-p2, p3 - p2) < -EPS && dot(p1 - p2, p4 - p2) < -EPS)? false:intersectSL(p1, p2, p3, p4) && intersectSL(p3, p4, p1, p2);\\t\\t \\t\\t\\t }\\n D distLP(P vec, P x){\\n return abs((x/vec).imag()) * abs(vec);\\n }\\n\\n D distLP(P p1, P p2, P x){return distLP(p2 - p1, x - p1);}\\n \\n D distSP(P p1, P p2, P x){\\n return dot(p2 - p1, x - p1) < -EPS?\\n\\t\\t\\t\\t abs(x-p1):dot(p1 - p2, x - p2) < -EPS? abs(x - p2):distLP(p1, p2, x);\\n }\\n\\n P crosspointLL(P p1, P p2, P vec){return abs(cross(p2 - p1, vec)) < EPS? vec: vec * cross(p2 - p1, p2)/ cross(p2 - p1, vec);}\\n P crosspointLL(P p1, P p2, P p3, P p4){return p4 + crosspointLL(p1 - p4, p2 - p4, p3 - p4);}\\n \\n P crosspointSS(P p1, P p2, P p3, P p4){\\n return distSP(p1, p2, p3) < EPS? p3:distSP(p1, p2, p4)<EPS? p4:crosspointLL(p1, p2, p3, p4);\\n }\\n \\n};\\nusing namespace Geometry;\\ntypedef long double GType;\\ntypedef std::complex<GType> Point;\\ntypedef std::pair<Point, Point> Segment;\\nint ccw(const Point& p1, const Point& p2, const Point& p3) {\\n Point v1 = p2 - p1, v2 = p3 - p1;\\n if (cross(v1, v2) > EPS) return +1;\\n if (cross(v1, v2) < -EPS) return -1;\\n if (dot(v1, v2) < -EPS) return +2;\\n if (std::norm(v1) < std::norm(v2)) return -2;\\n return 0;\\n}\\n \\n// ------ Functions Level 2 ------ //\\nbool intersect(const Segment& s1, const Point& p1, bool segflag) {\\n if (!segflag) return std::abs(cross(s1.second - p1, s1.first - p1)) < EPS;\\n return (std::abs(s1.first - p1) + std::abs(s1.second - p1) - std::abs(s1.second - s1.first)) < EPS;\\n}\\nbool intersect(const Segment& s1, const Segment& s2, bool segflag) {\\n if (!segflag) return cross(s1.second - s1.first, s2.first - s1.first) * cross(s1.second - s1.first, s2.second - s1.first) < EPS;\\n return (ccw(s1.first, s1.second, s2.first) * ccw(s1.first, s1.second, s2.second)) <= 0 && (ccw(s2.first, s2.second, s1.first) * ccw(s2.first, s2.second, s1.second)) <= 0;\\n}\\n\\n\\n\\nbool contain(P p,vector<P> &poly){\\n D a=0;\\n if(area(poly)<EPS){return false;}\\n for(int i=1;i<=poly.size();i++){\\n a+=area({p,poly[i-1],poly[i%poly.size()]});\\n }\\n return abs(a-area(poly))<EPS;\\n}\\nvector<P> sqar(pair<P,P> L,P vec,D t){\\n return {L.F,L.S,L.S+vec*t,L.F+vec*t};\\n}\\n\\nbool intersectPP(vector<P> poly,vector<P> me){\\n for(int i=1;i<=me.size();i++){\\n if(contain(me[i-1],poly)){return true;}\\n for(int j=1;j<=poly.size();j++){\\n //if(intersect({poly[j-1],poly[j%poly.size()]},{me[i-1],me[i%me.size()]},true)){return true;}\\n if(intersectSS(poly[j-1],poly[j%poly.size()],me[i-1],me[i%me.size()])){return true;}\\n }\\n }\\n return false;\\n}\\n\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n ll n,m,b;\\n while(cin>>n>>m>>b,n){\\n vector<P> A(n);\\n for(auto &I:A){\\n D x,y;\\n cin>>x>>y;\\n I={x,y};\\n }\\n vector<pair<P,D>> V(m);\\n for(auto &I:V){\\n D x,y;\\n cin>>I.S>>x>>y;\\n I.F={x,y};\\n }\\n \\n V.push_back({{0,0},INF});\\n vector<pair<pair<P,P>,P>> L(b);\\n for(auto &I:L){\\n D t,X,x,y,l;\\n cin>>t>>X>>x>>y>>l;\\n I.F.F=P(X,0);\\n I.S={x,y};\\n I.F.S=I.F.F-I.S/abs(I.S)*l;\\n I.F.F-=I.S*t;\\n I.F.S-=I.S*t;\\n }\\n for(ll i=m-1;i>0;i--){V[i].S-=V[i-1].S;}\\n vector<D> ans(b,INF*2);\\n \\n for(int i=0;i<b;i++){\\n pair<P,P> l=L[i].F;\\n D time=0;\\n for(auto &I:V){\\n P vec=L[i].S-I.F;\\n auto judge=[&](D t){return intersectPP(sqar(l,vec,t),A);};\\n if(!judge(I.S)){\\n\\ttime+=I.S;\\n\\tl.F+=vec*I.S;\\n\\tl.S+=vec*I.S;\\n\\tcontinue;\\n }\\n D lf=0,rg=I.S;\\n for(int k=0;k<100;k++){\\n\\tD m=(lf+rg)/2;\\n\\tif(judge(m)){rg=m;}\\n\\telse{lf=m;}\\n }\\n ans[i]=lf+time;\\n // cout<<i<<\\\" \\\"<<I.F<<\\\" \\\"<<I.S<<\\\" \\\"<<lf<<\\\" \\\"<<time<<endl;\\n break;\\n }\\n }\\n sort(ans.begin(),ans.end());\\n ll cnt=0;\\n for(auto &I:ans){if(I<INF){cnt++;}}\\n cout<<cnt<<endl;\\n if(cnt==6&&ans[0]<EPS){\\n //cerr<<n<<\\\" \\\"<<m<<\\\" \\\"<<b<<endl;\\n }\\n for(int i=0;i<cnt;i++){\\n cout<<fixed<<setprecision(12)<<ans[i]<<endl;\\n }\\n } \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 430,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -0.2342,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2023_3127463\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <array>\\nusing namespace std;\\n\\nconst double EPS = 1e-6;\\nconst double INF = 1e12;\\nconst double PI = acos(-1);\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\n\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\nstruct L : array<P, 2>{\\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\\n L(){}\\n};\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\nint ccw(P a, P b, P c){\\n b -= a;\\n c -= a;\\n if(cross(b,c) > EPS) return +1; //ccw\\n if(cross(b,c) < -EPS) return -1; //cw\\n if(dot(b,c) < -EPS) return +2; //c-a-b\\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\\n return 0; //a-c-b\\n}\\nP unit(const P &p){\\n return p/abs(p);\\n}\\n\\nbool intersectSS(const L& a, const L& b){\\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\\n}\\n\\nbool isParallel(const P &a, const P &b){\\n return abs(cross(a,b)) < EPS;\\n}\\nbool isParallel(const L &a, const L &b){\\n return isParallel(a[1]-a[0], b[1]-b[0]);\\n}\\n\\nP crosspointLL(const L &l, const L &m) {\\n double A = cross(l[1]-l[0], m[1]-m[0]);\\n double B = cross(l[1]-l[0], l[1]-m[0]);\\n return m[0] + B/A *(m[1]-m[0]);\\n}\\n\\nint main(){\\n while(1){\\n int n,m,b;\\n cin >> n >> m >> b;\\n if(n == 0) break;\\n\\n VP poly(n);\\n for(int i=0; i<n; i++){\\n double vx,vy;\\n cin >> vx >> vy;\\n poly[i] = P(vx, vy);\\n }\\n \\n vector<double> ts(m+1);\\n VP vs(m+1);\\n for(int i=0; i<m; i++){\\n double vx,vy;\\n cin >> ts[i] >> vx >> vy;\\n vs[i] = P(vx, vy);\\n }\\n //指示終了後は停止し続ける\\n ts[m] = INF;\\n vs[m] = P(0, 0);\\n m++;\\n\\n vector<double> tg(b), lg(b);\\n VP inig(b), vg(b);\\n for(int i=0; i<b; i++){\\n double xi,vx,vy;\\n cin >> tg[i] >> xi >> vx >> vy >> lg[i];\\n inig[i] = P(xi, 0);\\n vg[i] = P(vx, vy);\\n }\\n //ここまで入力\\n\\n vector<double> ans;\\n for(int bullet=0; bullet<b; bullet++){\\n P poss(0, 0), posb = inig[bullet];\\n for(int move=0; move<m; move++){\\n double time = 0;\\n if(move!=0) time = ts[move-1];\\n //まだ始まってない\\n if(tg[bullet] +EPS > ts[move]){\\n poss += (ts[move] -time) *vs[move];\\n continue;\\n }\\n //区間の途中で弾丸が発射されるとき\\n if(tg[bullet] > time +EPS){\\n poss += (tg[bullet] -time) *vs[move];\\n time = tg[bullet];\\n }\\n \\n L bul(posb, posb +lg[bullet]*unit(-vg[bullet]));\\n double mintime = INF;\\n //多角形の頂点が弾丸に衝突\\n for(int i=0; i<n; i++){\\n P p = poss +poly[i];\\n L locus;\\n locus[0] = p;\\n locus[1] = p +(ts[move] -time) *(vs[move] -vg[bullet]);\\n if(!isParallel(bul, locus) && intersectSS(bul, locus)){\\n P cp = crosspointLL(bul, locus);\\n double ratio = abs(cp -locus[0]) /abs(locus[1] -locus[0]);\\n mintime = min(mintime, time +ratio *(ts[move] -time));\\n }\\n }\\n //弾丸の端点が多角形の辺に衝突\\n for(int d=0; d<2; d++){\\n L locus;\\n locus[0] = bul[d];\\n locus[1] = bul[d] +(ts[move] -time) *(vg[bullet] -vs[move]);\\n for(int i=0; i<n; i++){\\n L edge(poss +poly[i], poss +poly[(i+1)%n]);\\n if(!isParallel(edge, locus) && intersectSS(edge, locus)){\\n P cp = crosspointLL(edge, locus);\\n double ratio = abs(cp -locus[0]) /abs(locus[1] -locus[0]);\\n mintime = min(mintime, time +ratio *(ts[move] -time));\\n }\\n }\\n }\\n if(mintime != INF){\\n ans.push_back(mintime);\\n break;\\n }\\n\\n //位置の更新\\n poss += (ts[move] -time) *vs[move];\\n posb += (ts[move] -time) *vg[bullet];\\n }\\n }\\n sort(ans.begin(), ans.end());\\n cout << fixed << setprecision(5);\\n cout << ans.size() << endl;\\n for(int i=0; i<(int)ans.size(); i++){\\n cout << ans[i] << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3280,\n \"score_of_the_acc\": -0.168,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2023_1373907\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <climits>\\n#include <ctime>\\n#include <queue>\\n#include <stack>\\n#include <algorithm>\\n#include <list>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <iostream>\\n#include <deque>\\n#include <complex>\\n#include <string>\\n#include <iomanip>\\n#include <sstream>\\n#include <bitset>\\n#include <valarray>\\n#include <unordered_map>\\n#include <iterator>\\n#include <functional>\\n#include <cassert>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned int uint;\\ntypedef unsigned char uchar;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\ntypedef vector<int> vi;\\n\\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\\n#define REPS(i,x) for(int i=1;i<=(int)(x);i++)\\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\\n#define RREPS(i,x) for(int i=((int)(x));i>0;i--)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\\n#define ALL(container) (container).begin(), (container).end()\\n#define RALL(container) (container).rbegin(), (container).rend()\\n#define SZ(container) ((int)container.size())\\n#define mp(a,b) make_pair(a, b)\\n#define pb push_back\\n#define eb emplace_back\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"[\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"]\\\"; return os;\\n}\\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\\nos<<\\\"{\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"}\\\"; return os;\\n}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\ntemplate<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}\\ntemplate<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}\\n\\nnamespace geom{\\n#define X real()\\n#define Y imag()\\n#define at(i) ((*this)[i])\\n#define SELF (*this)\\n\\tenum {TRUE = 1, FALSE = 0, BORDER = -1};\\n\\ttypedef int BOOL;\\n\\ttypedef double R;\\n\\tconst R INF = 1e8;\\n\\tR EPS = 1e-4;\\n\\tconst R PI = 3.1415926535897932384626;\\n\\tinline int sig(const R &x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }\\n\\tinline BOOL less(const R &x, const R &y) {return sig(x-y) ? x < y : BORDER;}\\n\\ttypedef complex<R> P;\\n\\tinline R norm(const P &p){return p.X*p.X+p.Y*p.Y;}\\n\\tinline R inp(const P& a, const P& b){return (conj(a)*b).X;}\\n\\tinline R outp(const P& a, const P& b){return (conj(a)*b).Y;}\\n\\tinline P unit(const P& p){return p/abs(p);}\\n\\tinline P proj(const P &s, const P &t){return t*inp(s, t)/norm(t);}\\n\\tinline int ccw(const P &s, const P &t, const P &p, int adv=0){\\n\\t\\tint res = sig(outp(t-s, p-s));\\n\\t\\tif(res || !adv) return res;\\n\\t\\tif(sig(inp(t-s, p-s)) < 0) return -2;\\t// p-s-t\\n\\t\\tif(sig(inp(s-t, p-t)) < 0) return 2;\\t// s-t-p\\n\\t\\treturn 0;\\t\\t\\t\\t\\t\\t\\t\\t// s-p-t\\n\\t}\\n\\t\\n\\t\\n\\tstruct L : public vector<P>{\\t// line\\n\\t\\tL(const P &p1, const P &p2){this->push_back(p1);this->push_back(p2);}\\n\\t\\tL(){}\\n\\t\\tP dir()const {return at(1) - at(0);}\\n\\t\\tBOOL online(const P &p)const {return !sig(outp(p-at(0), dir()));}\\n\\t};\\n\\tstruct S : public L{\\t// segment\\n\\t\\tS(const P &p1, const P &p2):L(p1, p2){}\\n\\t\\tS(){}\\n\\t\\tBOOL online(const P &p)const {\\n\\t\\t\\tif(!sig(norm(p - at(0))) || !sig(norm(p - at(1)))) return BORDER;\\n\\t\\t\\t// ??§?¨????????????¨EPS???????????§??????????????????????????¨???\\n\\t\\t\\treturn !sig(outp(p-at(0), dir())) && inp(p-at(0), dir()) > EPS && inp(p-at(1), -dir()) > -EPS;\\n\\t\\t\\t//return !sig(abs(at(0)-p) + abs(at(1) - p) - abs(at(0) - at(1)));\\n\\t\\t}\\n\\t};\\n\\tstruct C : public P{\\n\\t\\tC(){}\\n\\t\\tC(const P& p, const R r):P(p), r(r){}\\n\\t\\tR r;\\n\\t\\tBOOL inside(const P& p)const { return less(norm(p-SELF), r*r);}\\n\\t};\\n\\n\\tinline P proj(const P &s, const L &t){return t[0] + proj(s-t[0], t[1]-t[0]);}\\n\\tinline P reflect(const P &s, const L &t){return (R)2.*proj(s, t) - s;}\\n\\tinline S reflect(const S &s, const L &t){return S(reflect(s[0], t), reflect(s[1], t));}\\n\\tBOOL intersect(const S &s, const S &t){\\n\\t\\tconst int p = ccw(t[0], t[1], s[0], 1) * ccw(t[0], t[1], s[1], 1);\\n\\t\\tconst int q = ccw(s[0], s[1], t[0], 1) * ccw(s[0], s[1], t[1], 1);\\n\\t\\treturn (p>0||q>0) ? FALSE : (!p||!q) ? BORDER : TRUE;\\n\\t}\\n\\tBOOL intersect(const S &s, const L &l){\\n\\t\\tif(l.online(s[0]) || l.online(s[1])) return BORDER;\\n\\t\\treturn (sig(outp(l.dir(), s[0]-l[0])) * sig(outp(l.dir(), s[1]-l[0])) <= 0);\\n\\t}\\n\\tR dist2(const L &l, const P &p){return norm(outp(l.dir(), p - l[0])) / norm(l.dir());}\\n\\tR dist2(const S &s, const P &p){\\n\\t\\tif(inp(p-s[0], s.dir()) < EPS) return norm(p - s[0]);\\n\\t\\tif(inp(p-s[1], -s.dir()) < EPS) return norm(p - s[1]);\\n\\t\\treturn dist2((const L &)s, p);\\n\\t}\\n\\tR dist2(const S &s, const L &l){\\n\\t\\treturn intersect(s, l) ? .0 : min(dist2(l, s[0]), dist2(l, s[1]));\\n\\t}\\n\\tR dist2(const S &s, const S &t){\\n\\t\\treturn intersect(s, t) ? .0 : min(min(dist2(s, t[0]), dist2(t, s[0])), \\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t min(dist2(s, t[1]), dist2(t, s[1])));\\n\\t}\\n\\ttemplate<class S, class T> R dist(const S& s, const T& t){return sqrt(dist2(s, t));}\\n\\tinline BOOL intersect(const C &a, const C &b){\\n\\t\\treturn less((a.r-b.r)*(a.r-b.r), norm(a-b)) + less(norm(a-b), (a.r+b.r)*(a.r+b.r)) - 1;\\n\\t}\\n\\tinline P crosspoint(const L &l, const L &m){\\n\\t\\tR A = outp(l.dir(), m.dir()), B = outp(l.dir(), l[1] - m[0]);\\n\\t\\tif(!sig(abs(A)) && !sig(abs(B))) return m[0]; // same line\\n\\t\\tif(abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n\\t\\treturn m[0] + B / A * (m[1] - m[0]);\\n\\t}\\n\\t\\n\\ttemplate<class Func> R simpson(R s, R t, Func func){\\n\\t\\treturn (t-s)/6*(func(s+2*EPS) + func(t-2*EPS) + 4*func((s+t)*(R).5));\\n\\t}\\n\\n#undef SELF\\n#undef at\\n}\\n\\nusing namespace geom;\\n\\nint f = 0;\\nnamespace std{\\n\\tbool operator<(const P &a, const P &b){return sig(a.X-b.X) ? a.X < b.X : a.Y+EPS < b.Y;}\\n\\tbool operator==(const P &a, const P &b){return abs(a-b) < EPS;}\\n\\tistream& operator>>(istream &is, P &p){R x,y;is>>x>>y;p=P(x, y);return is;}\\n\\tistream& operator>>(istream &is, L &l){l.resize(2);return is >> l[0] >> l[1];}\\n\\tistream& operator>>(istream &is, C &c){return is >> (P &)c >> c.r;}\\n\\tconst R B = 500;\\n\\tconst R Z = 2;\\n//\\tostream& operator<<(ostream &os, const C &c){return os << \\\"circle(\\\"<<B+Z*(c.X)<<\\\", \\\"<<1000-B-Z*(c.Y)<<\\\", \\\"<<Z*(c.r)<<\\\")\\\";}\\n//\\tostream& operator<<(ostream &os, const P &p){return os << \\\"circle(\\\"<<B+Z*(p.X)<<\\\", \\\"<<1000-B-Z*(p.Y)<<\\\", 2)\\\";}\\n//\\tostream& operator<<(ostream &os, const S &s){return os << \\\"line(\\\"<<B+Z*(s[0].X)<<\\\", \\\"<<1000-B-Z*(s[0].Y)<<\\\", \\\"<<B+Z*(s[1].X)<<\\\", \\\"<<1000-B-Z*(s[1].Y)<<\\\")\\\";}\\n\\n}\\n\\nstruct G : public vector<P>{\\n\\tP v;\\n\\tR l, r;\\n\\t\\n\\tG(size_type size=0):vector(size){}\\n\\tS edge(int i)const {return S(at(i), at(i+1 == size() ? 0 : i+1));}\\n\\tS edge(int i, R t)const {return S(at(i)+v*t, at(i+1 == size() ? 0 : i+1)+v*t);}\\n};\\n\\nint T, n, m, b;\\n\\nR conflict(P p1, P p2, P p3, P v, R l, R r){\\n\\tif(r + EPS < l) return INF;\\n\\tR o = outp(p2-p1, v);\\n\\tR res = INF;\\n\\tif(!ccw(p1, p2, p3 + v*l, 1)) return l;\\n\\tdo{\\n\\t\\tif(abs(o) < EPS){\\n\\t\\t\\tif(abs(outp(p2 - p1, p3 - p1)) > EPS) break;\\n\\t\\t\\tres = min(abs(p1-p3), abs(p2-p3))/abs(v);\\n\\t\\t}else res = -outp(p2 - p1, p3 - p1) / o;\\n\\t\\tif(res > INF - EPS || res < l - EPS || r + EPS < res) break;\\n\\t\\tif(ccw(p1, p2, p3 + v*res, 1)) break;\\n\\t\\treturn res;\\n\\t}while(0);\\n\\treturn INF;\\n}\\n\\nR conflict(G a, G b){\\n\\tR ans = INF;\\n\\tREP(i, a.size())REP(j, b.size()){\\n\\t\\tR res = conflict(a[i], a[(i+1) % a.size()], b[j], b.v-a.v, max(a.l, b.l), min(a.r, b.r));\\n\\t\\tans = min(ans, res);\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main(int argc, char *argv[]){\\n\\tios::sync_with_stdio(false);\\n\\twhile(cin >> n >> m >> b, n){\\n\\t\\tG g(n);\\n\\t\\tvector<G> polys;\\n\\t\\tREP(i, n) cin >> g[i];\\n\\t\\tR pt = 0;\\n\\t\\tREP(i, m){\\n\\t\\t\\tR t;\\n\\t\\t\\tP v;\\n\\t\\t\\tpolys.pb(g);\\n\\t\\t\\tcin >> t >> v;\\n\\t\\t\\tfor(auto &p : polys[i]) p -= v*pt;\\n\\t\\t\\tpolys[i].v = v; polys[i].l = pt; polys[i].r = t;\\n\\t\\t\\tfor(auto &p : g) p += v*(t-pt);\\n\\t\\t\\tpt = t;\\n\\t\\t}\\n\\t\\tpolys.pb(g);\\n\\t\\tpolys[m].v = P(0, 0);\\n\\t\\tpolys[m].l = pt;\\n\\t\\tpolys[m].r = INF;\\n\\t\\tvector<R> ans;\\n\\t\\tREP(i, b){\\n\\t\\t\\tP p, v;\\n\\t\\t\\tR x, t, l;\\n\\t\\t\\tcin >> t >> x >> v >> l;\\n//\\t\\t\\tcout << \\\"!\\\" << t << \\\" \\\" << x << \\\" \\\" << v << \\\" \\\" << l << endl;\\n\\t\\t\\tp = P(x, 0) - v*t;\\n\\t\\t\\tG bullet(2);\\n\\t\\t\\tbullet[0] = p;\\n\\t\\t\\tbullet[1] = p - unit(v)*l;\\n\\t\\t\\tbullet.v = v;\\n\\t\\t\\tbullet.l = t;\\n\\t\\t\\tbullet.r = INF;\\n\\t\\t\\tR res = INF;\\n\\t\\t\\tREP(j, m+1) res = min(res, min(conflict(polys[j], bullet), conflict(bullet, polys[j])));\\n\\t\\t\\tif(res < INF-EPS) ans.pb(res);\\n\\t\\t}\\n\\t\\tsort(ALL(ans));\\n\\t\\tprintf(\\\"%d\\\\n\\\", (int)ans.size());\\n\\t\\tREP(i, ans.size()) printf(\\\"%.15f\\\\n\\\", (double)ans[i]);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1360,\n \"score_of_the_acc\": -0.0241,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2023_1373905\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <climits>\\n#include <ctime>\\n#include <queue>\\n#include <stack>\\n#include <algorithm>\\n#include <list>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <iostream>\\n#include <deque>\\n#include <complex>\\n#include <string>\\n#include <iomanip>\\n#include <sstream>\\n#include <bitset>\\n#include <valarray>\\n#include <unordered_map>\\n#include <iterator>\\n#include <functional>\\n#include <cassert>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned int uint;\\ntypedef unsigned char uchar;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\ntypedef vector<int> vi;\\n\\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\\n#define REPS(i,x) for(int i=1;i<=(int)(x);i++)\\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\\n#define RREPS(i,x) for(int i=((int)(x));i>0;i--)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\\n#define ALL(container) (container).begin(), (container).end()\\n#define RALL(container) (container).rbegin(), (container).rend()\\n#define SZ(container) ((int)container.size())\\n#define mp(a,b) make_pair(a, b)\\n#define pb push_back\\n#define eb emplace_back\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"[\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"]\\\"; return os;\\n}\\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\\nos<<\\\"{\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"}\\\"; return os;\\n}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\ntemplate<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}\\ntemplate<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}\\n\\nnamespace geom{\\n#define X real()\\n#define Y imag()\\n#define at(i) ((*this)[i])\\n#define SELF (*this)\\n\\tenum {TRUE = 1, FALSE = 0, BORDER = -1};\\n\\ttypedef int BOOL;\\n\\ttypedef long double R;\\n\\tconst R INF = 1e8;\\n\\tR EPS = 1e-6;\\n\\tconst R PI = 3.1415926535897932384626;\\n\\tinline int sig(const R &x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }\\n\\tinline BOOL less(const R &x, const R &y) {return sig(x-y) ? x < y : BORDER;}\\n\\ttypedef complex<R> P;\\n\\tinline R norm(const P &p){return p.X*p.X+p.Y*p.Y;}\\n\\tinline R inp(const P& a, const P& b){return (conj(a)*b).X;}\\n\\tinline R outp(const P& a, const P& b){return (conj(a)*b).Y;}\\n\\tinline P unit(const P& p){return p/abs(p);}\\n\\tinline P proj(const P &s, const P &t){return t*inp(s, t)/norm(t);}\\n\\tinline int ccw(const P &s, const P &t, const P &p, int adv=0){\\n\\t\\tint res = sig(outp(t-s, p-s));\\n\\t\\tif(res || !adv) return res;\\n\\t\\tif(sig(inp(t-s, p-s)) < 0) return -2;\\t// p-s-t\\n\\t\\tif(sig(inp(s-t, p-t)) < 0) return 2;\\t// s-t-p\\n\\t\\treturn 0;\\t\\t\\t\\t\\t\\t\\t\\t// s-p-t\\n\\t}\\n\\t\\n\\t\\n\\tstruct L : public vector<P>{\\t// line\\n\\t\\tL(const P &p1, const P &p2){this->push_back(p1);this->push_back(p2);}\\n\\t\\tL(){}\\n\\t\\tP dir()const {return at(1) - at(0);}\\n\\t\\tBOOL online(const P &p)const {return !sig(outp(p-at(0), dir()));}\\n\\t};\\n\\tstruct S : public L{\\t// segment\\n\\t\\tS(const P &p1, const P &p2):L(p1, p2){}\\n\\t\\tS(){}\\n\\t\\tBOOL online(const P &p)const {\\n\\t\\t\\tif(!sig(norm(p - at(0))) || !sig(norm(p - at(1)))) return BORDER;\\n\\t\\t\\t// ??§?¨????????????¨EPS???????????§??????????????????????????¨???\\n\\t\\t\\treturn !sig(outp(p-at(0), dir())) && inp(p-at(0), dir()) > EPS && inp(p-at(1), -dir()) > -EPS;\\n\\t\\t\\t//return !sig(abs(at(0)-p) + abs(at(1) - p) - abs(at(0) - at(1)));\\n\\t\\t}\\n\\t};\\n\\tstruct C : public P{\\n\\t\\tC(){}\\n\\t\\tC(const P& p, const R r):P(p), r(r){}\\n\\t\\tR r;\\n\\t\\tBOOL inside(const P& p)const { return less(norm(p-SELF), r*r);}\\n\\t};\\n\\n\\tinline P proj(const P &s, const L &t){return t[0] + proj(s-t[0], t[1]-t[0]);}\\n\\tinline P reflect(const P &s, const L &t){return (R)2.*proj(s, t) - s;}\\n\\tinline S reflect(const S &s, const L &t){return S(reflect(s[0], t), reflect(s[1], t));}\\n\\tBOOL intersect(const S &s, const S &t){\\n\\t\\tconst int p = ccw(t[0], t[1], s[0], 1) * ccw(t[0], t[1], s[1], 1);\\n\\t\\tconst int q = ccw(s[0], s[1], t[0], 1) * ccw(s[0], s[1], t[1], 1);\\n\\t\\treturn (p>0||q>0) ? FALSE : (!p||!q) ? BORDER : TRUE;\\n\\t}\\n\\tBOOL intersect(const S &s, const L &l){\\n\\t\\tif(l.online(s[0]) || l.online(s[1])) return BORDER;\\n\\t\\treturn (sig(outp(l.dir(), s[0]-l[0])) * sig(outp(l.dir(), s[1]-l[0])) <= 0);\\n\\t}\\n\\tR dist2(const L &l, const P &p){return norm(outp(l.dir(), p - l[0])) / norm(l.dir());}\\n\\tR dist2(const S &s, const P &p){\\n\\t\\tif(inp(p-s[0], s.dir()) < EPS) return norm(p - s[0]);\\n\\t\\tif(inp(p-s[1], -s.dir()) < EPS) return norm(p - s[1]);\\n\\t\\treturn dist2((const L &)s, p);\\n\\t}\\n\\tR dist2(const S &s, const L &l){\\n\\t\\treturn intersect(s, l) ? .0 : min(dist2(l, s[0]), dist2(l, s[1]));\\n\\t}\\n\\tR dist2(const S &s, const S &t){\\n\\t\\treturn intersect(s, t) ? .0 : min(min(dist2(s, t[0]), dist2(t, s[0])), \\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t min(dist2(s, t[1]), dist2(t, s[1])));\\n\\t}\\n\\ttemplate<class S, class T> R dist(const S& s, const T& t){return sqrt(dist2(s, t));}\\n\\tinline BOOL intersect(const C &a, const C &b){\\n\\t\\treturn less((a.r-b.r)*(a.r-b.r), norm(a-b)) + less(norm(a-b), (a.r+b.r)*(a.r+b.r)) - 1;\\n\\t}\\n\\tinline P crosspoint(const L &l, const L &m){\\n\\t\\tR A = outp(l.dir(), m.dir()), B = outp(l.dir(), l[1] - m[0]);\\n\\t\\tif(!sig(abs(A)) && !sig(abs(B))) return m[0]; // same line\\n\\t\\tif(abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n\\t\\treturn m[0] + B / A * (m[1] - m[0]);\\n\\t}\\n\\t\\n\\ttemplate<class Func> R simpson(R s, R t, Func func){\\n\\t\\treturn (t-s)/6*(func(s+2*EPS) + func(t-2*EPS) + 4*func((s+t)*(R).5));\\n\\t}\\n\\n#undef SELF\\n#undef at\\n}\\n\\nusing namespace geom;\\n\\nint f = 0;\\nnamespace std{\\n\\tbool operator<(const P &a, const P &b){return sig(a.X-b.X) ? a.X < b.X : a.Y+EPS < b.Y;}\\n\\tbool operator==(const P &a, const P &b){return abs(a-b) < EPS;}\\n\\tistream& operator>>(istream &is, P &p){R x,y;is>>x>>y;p=P(x, y);return is;}\\n\\tistream& operator>>(istream &is, L &l){l.resize(2);return is >> l[0] >> l[1];}\\n\\tistream& operator>>(istream &is, C &c){return is >> (P &)c >> c.r;}\\n\\tconst R B = 500;\\n\\tconst R Z = 2;\\n//\\tostream& operator<<(ostream &os, const C &c){return os << \\\"circle(\\\"<<B+Z*(c.X)<<\\\", \\\"<<1000-B-Z*(c.Y)<<\\\", \\\"<<Z*(c.r)<<\\\")\\\";}\\n//\\tostream& operator<<(ostream &os, const P &p){return os << \\\"circle(\\\"<<B+Z*(p.X)<<\\\", \\\"<<1000-B-Z*(p.Y)<<\\\", 2)\\\";}\\n//\\tostream& operator<<(ostream &os, const S &s){return os << \\\"line(\\\"<<B+Z*(s[0].X)<<\\\", \\\"<<1000-B-Z*(s[0].Y)<<\\\", \\\"<<B+Z*(s[1].X)<<\\\", \\\"<<1000-B-Z*(s[1].Y)<<\\\")\\\";}\\n\\n}\\n\\nstruct G : public vector<P>{\\n\\tP v;\\n\\tR l, r;\\n\\t\\n\\tG(size_type size=0):vector(size){}\\n\\tS edge(int i)const {return S(at(i), at(i+1 == size() ? 0 : i+1));}\\n\\tS edge(int i, R t)const {return S(at(i)+v*t, at(i+1 == size() ? 0 : i+1)+v*t);}\\n};\\n\\nint T, n, m, b;\\n\\nR conflict(P p1, P p2, P p3, P v, R l, R r){\\n\\tif(r + EPS < l) return INF;\\n\\tR o = outp(p2-p1, v);\\n\\tR res = INF;\\n\\tif(!ccw(p1, p2, p3 + v*l, 1)) return l;\\n\\tdo{\\n\\t\\tif(abs(o) < EPS){\\n\\t\\t\\tif(abs(outp(p2 - p1, p3 - p1)) > EPS) break;\\n\\t\\t\\tres = min(abs(p1-p3), abs(p2-p3))/abs(v);\\n\\t\\t}else res = -outp(p2 - p1, p3 - p1) / o;\\n\\t\\tif(res > INF - EPS || res < l - EPS || r + EPS < res) break;\\n\\t\\tif(ccw(p1, p2, p3 + v*res, 1)) break;\\n\\t\\treturn res;\\n\\t}while(0);\\n\\treturn INF;\\n}\\n\\nR conflict(G a, G b){\\n\\tR ans = INF;\\n\\tREP(i, a.size())REP(j, b.size()){\\n\\t\\tR res = conflict(a[i], a[(i+1) % a.size()], b[j], b.v-a.v, max(a.l, b.l), min(a.r, b.r));\\n\\t\\tans = min(ans, res);\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main(int argc, char *argv[]){\\n\\tios::sync_with_stdio(false);\\n\\twhile(cin >> n >> m >> b, n){\\n\\t\\tG g(n);\\n\\t\\tvector<G> polys;\\n\\t\\tREP(i, n) cin >> g[i];\\n\\t\\tR pt = 0;\\n\\t\\tREP(i, m){\\n\\t\\t\\tR t;\\n\\t\\t\\tP v;\\n\\t\\t\\tpolys.pb(g);\\n\\t\\t\\tcin >> t >> v;\\n\\t\\t\\tfor(auto &p : polys[i]) p -= v*pt;\\n\\t\\t\\tpolys[i].v = v; polys[i].l = pt; polys[i].r = t;\\n\\t\\t\\tfor(auto &p : g) p += v*(t-pt);\\n\\t\\t\\tpt = t;\\n\\t\\t}\\n\\t\\tpolys.pb(g);\\n\\t\\tpolys[m].v = P(0, 0);\\n\\t\\tpolys[m].l = pt;\\n\\t\\tpolys[m].r = INF;\\n\\t\\tvector<R> ans;\\n\\t\\tREP(i, b){\\n\\t\\t\\tP p, v;\\n\\t\\t\\tR x, t, l;\\n\\t\\t\\tcin >> t >> x >> v >> l;\\n//\\t\\t\\tcout << \\\"!\\\" << t << \\\" \\\" << x << \\\" \\\" << v << \\\" \\\" << l << endl;\\n\\t\\t\\tp = P(x, 0) - v*t;\\n\\t\\t\\tG bullet(2);\\n\\t\\t\\tbullet[0] = p;\\n\\t\\t\\tbullet[1] = p - unit(v)*l;\\n\\t\\t\\tbullet.v = v;\\n\\t\\t\\tbullet.l = t;\\n\\t\\t\\tbullet.r = INF;\\n\\t\\t\\tR res = INF;\\n\\t\\t\\tREP(j, m+1) res = min(res, min(conflict(polys[j], bullet), conflict(bullet, polys[j])));\\n\\t\\t\\tif(res < INF-EPS) ans.pb(res);\\n\\t\\t}\\n\\t\\tsort(ALL(ans));\\n\\t\\tprintf(\\\"%d\\\\n\\\", (int)ans.size());\\n\\t\\tREP(i, ans.size()) printf(\\\"%.15f\\\\n\\\", (double)ans[i]);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 1404,\n \"score_of_the_acc\": -0.0509,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2023_1373902\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <climits>\\n#include <ctime>\\n#include <queue>\\n#include <stack>\\n#include <algorithm>\\n#include <list>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <iostream>\\n#include <deque>\\n#include <complex>\\n#include <string>\\n#include <iomanip>\\n#include <sstream>\\n#include <bitset>\\n#include <valarray>\\n#include <unordered_map>\\n#include <iterator>\\n#include <functional>\\n#include <cassert>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned int uint;\\ntypedef unsigned char uchar;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\ntypedef vector<int> vi;\\n\\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\\n#define REPS(i,x) for(int i=1;i<=(int)(x);i++)\\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\\n#define RREPS(i,x) for(int i=((int)(x));i>0;i--)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\\n#define ALL(container) (container).begin(), (container).end()\\n#define RALL(container) (container).rbegin(), (container).rend()\\n#define SZ(container) ((int)container.size())\\n#define mp(a,b) make_pair(a, b)\\n#define pb push_back\\n#define eb emplace_back\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"[\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"]\\\"; return os;\\n}\\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\\nos<<\\\"{\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"}\\\"; return os;\\n}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\ntemplate<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}\\ntemplate<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}\\n\\nnamespace geom{\\n#define X real()\\n#define Y imag()\\n#define at(i) ((*this)[i])\\n#define SELF (*this)\\n\\tenum {TRUE = 1, FALSE = 0, BORDER = -1};\\n\\ttypedef int BOOL;\\n\\ttypedef long double R;\\n\\tconst R INF = 1e8;\\n\\tR EPS = 1e-6;\\n\\tconst R PI = 3.1415926535897932384626;\\n\\tinline int sig(const R &x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }\\n\\tinline BOOL less(const R &x, const R &y) {return sig(x-y) ? x < y : BORDER;}\\n\\ttypedef complex<R> P;\\n\\tinline R norm(const P &p){return p.X*p.X+p.Y*p.Y;}\\n\\tinline R inp(const P& a, const P& b){return (conj(a)*b).X;}\\n\\tinline R outp(const P& a, const P& b){return (conj(a)*b).Y;}\\n\\tinline P unit(const P& p){return p/abs(p);}\\n\\tinline P proj(const P &s, const P &t){return t*inp(s, t)/norm(t);}\\n\\tinline int ccw(const P &s, const P &t, const P &p, int adv=0){\\n\\t\\tint res = sig(outp(t-s, p-s));\\n\\t\\tif(res || !adv) return res;\\n\\t\\tif(sig(inp(t-s, p-s)) < 0) return -2;\\t// p-s-t\\n\\t\\tif(sig(inp(s-t, p-t)) < 0) return 2;\\t// s-t-p\\n\\t\\treturn 0;\\t\\t\\t\\t\\t\\t\\t\\t// s-p-t\\n\\t}\\n\\t\\n\\t\\n\\tstruct L : public vector<P>{\\t// line\\n\\t\\tL(const P &p1, const P &p2){this->push_back(p1);this->push_back(p2);}\\n\\t\\tL(){}\\n\\t\\tP dir()const {return at(1) - at(0);}\\n\\t\\tBOOL online(const P &p)const {return !sig(outp(p-at(0), dir()));}\\n\\t};\\n\\tstruct S : public L{\\t// segment\\n\\t\\tS(const P &p1, const P &p2):L(p1, p2){}\\n\\t\\tS(){}\\n\\t\\tBOOL online(const P &p)const {\\n\\t\\t\\tif(!sig(norm(p - at(0))) || !sig(norm(p - at(1)))) return BORDER;\\n\\t\\t\\t// ??§?¨????????????¨EPS???????????§??????????????????????????¨???\\n\\t\\t\\treturn !sig(outp(p-at(0), dir())) && inp(p-at(0), dir()) > EPS && inp(p-at(1), -dir()) > -EPS;\\n\\t\\t\\t//return !sig(abs(at(0)-p) + abs(at(1) - p) - abs(at(0) - at(1)));\\n\\t\\t}\\n\\t};\\n\\tstruct C : public P{\\n\\t\\tC(){}\\n\\t\\tC(const P& p, const R r):P(p), r(r){}\\n\\t\\tR r;\\n\\t\\tBOOL inside(const P& p)const { return less(norm(p-SELF), r*r);}\\n\\t};\\n\\n\\tinline P proj(const P &s, const L &t){return t[0] + proj(s-t[0], t[1]-t[0]);}\\n\\tinline P reflect(const P &s, const L &t){return (R)2.*proj(s, t) - s;}\\n\\tinline S reflect(const S &s, const L &t){return S(reflect(s[0], t), reflect(s[1], t));}\\n\\tBOOL intersect(const S &s, const S &t){\\n\\t\\tconst int p = ccw(t[0], t[1], s[0], 1) * ccw(t[0], t[1], s[1], 1);\\n\\t\\tconst int q = ccw(s[0], s[1], t[0], 1) * ccw(s[0], s[1], t[1], 1);\\n\\t\\treturn (p>0||q>0) ? FALSE : (!p||!q) ? BORDER : TRUE;\\n\\t}\\n\\tBOOL intersect(const S &s, const L &l){\\n\\t\\tif(l.online(s[0]) || l.online(s[1])) return BORDER;\\n\\t\\treturn (sig(outp(l.dir(), s[0]-l[0])) * sig(outp(l.dir(), s[1]-l[0])) <= 0);\\n\\t}\\n\\tR dist2(const L &l, const P &p){return norm(outp(l.dir(), p - l[0])) / norm(l.dir());}\\n\\tR dist2(const S &s, const P &p){\\n\\t\\tif(inp(p-s[0], s.dir()) < EPS) return norm(p - s[0]);\\n\\t\\tif(inp(p-s[1], -s.dir()) < EPS) return norm(p - s[1]);\\n\\t\\treturn dist2((const L &)s, p);\\n\\t}\\n\\tR dist2(const S &s, const L &l){\\n\\t\\treturn intersect(s, l) ? .0 : min(dist2(l, s[0]), dist2(l, s[1]));\\n\\t}\\n\\tR dist2(const S &s, const S &t){\\n\\t\\treturn intersect(s, t) ? .0 : min(min(dist2(s, t[0]), dist2(t, s[0])), \\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t min(dist2(s, t[1]), dist2(t, s[1])));\\n\\t}\\n\\ttemplate<class S, class T> R dist(const S& s, const T& t){return sqrt(dist2(s, t));}\\n\\tinline BOOL intersect(const C &a, const C &b){\\n\\t\\treturn less((a.r-b.r)*(a.r-b.r), norm(a-b)) + less(norm(a-b), (a.r+b.r)*(a.r+b.r)) - 1;\\n\\t}\\n\\tinline P crosspoint(const L &l, const L &m){\\n\\t\\tR A = outp(l.dir(), m.dir()), B = outp(l.dir(), l[1] - m[0]);\\n\\t\\tif(!sig(abs(A)) && !sig(abs(B))) return m[0]; // same line\\n\\t\\tif(abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n\\t\\treturn m[0] + B / A * (m[1] - m[0]);\\n\\t}\\n\\t\\n\\ttemplate<class Func> R simpson(R s, R t, Func func){\\n\\t\\treturn (t-s)/6*(func(s+2*EPS) + func(t-2*EPS) + 4*func((s+t)*(R).5));\\n\\t}\\n\\n#undef SELF\\n#undef at\\n}\\n\\nusing namespace geom;\\n\\nint f = 0;\\nnamespace std{\\n\\tbool operator<(const P &a, const P &b){return sig(a.X-b.X) ? a.X < b.X : a.Y+EPS < b.Y;}\\n\\tbool operator==(const P &a, const P &b){return abs(a-b) < EPS;}\\n\\tistream& operator>>(istream &is, P &p){R x,y;is>>x>>y;p=P(x, y);return is;}\\n\\tistream& operator>>(istream &is, L &l){l.resize(2);return is >> l[0] >> l[1];}\\n\\tistream& operator>>(istream &is, C &c){return is >> (P &)c >> c.r;}\\n\\tconst R B = 500;\\n\\tconst R Z = 2;\\n//\\tostream& operator<<(ostream &os, const C &c){return os << \\\"circle(\\\"<<B+Z*(c.X)<<\\\", \\\"<<1000-B-Z*(c.Y)<<\\\", \\\"<<Z*(c.r)<<\\\")\\\";}\\n//\\tostream& operator<<(ostream &os, const P &p){return os << \\\"circle(\\\"<<B+Z*(p.X)<<\\\", \\\"<<1000-B-Z*(p.Y)<<\\\", 2)\\\";}\\n//\\tostream& operator<<(ostream &os, const S &s){return os << \\\"line(\\\"<<B+Z*(s[0].X)<<\\\", \\\"<<1000-B-Z*(s[0].Y)<<\\\", \\\"<<B+Z*(s[1].X)<<\\\", \\\"<<1000-B-Z*(s[1].Y)<<\\\")\\\";}\\n\\n}\\n\\nstruct G : public vector<P>{\\n\\tP v;\\n\\tR l, r;\\n\\t\\n\\tG(size_type size=0):vector(size){}\\n\\tS edge(int i)const {return S(at(i), at(i+1 == size() ? 0 : i+1));}\\n\\tS edge(int i, R t)const {return S(at(i)+v*t, at(i+1 == size() ? 0 : i+1)+v*t);}\\n};\\n\\nint T, n, m, b;\\n\\nR conflict(P p1, P p2, P p3, P v, R l, R r){\\n\\tR o = outp(p2-p1, v);\\n\\tR res = INF;\\n\\tif(!ccw(p1, p2, p3 + v*l, 1)) return l;\\n\\tdo{\\n\\t\\tif(abs(o) < EPS){\\n\\t\\t\\tif(abs(outp(p2 - p1, p3 - p1)) > EPS) break;\\n\\t\\t\\tres = min(abs(p1-p3), abs(p2-p3))/abs(v);\\n\\t\\t}else res = -outp(p2 - p1, p3 - p1) / o;\\n\\t\\tif(res > INF - EPS || res < l - EPS || r + EPS < res) break;\\n\\t\\tif(ccw(p1, p2, p3 + v*res, 1)) break;\\n\\t\\treturn res;\\n\\t}while(0);\\n\\treturn INF;\\n}\\n\\nR conflict(G a, G b){\\n\\tR ans = INF;\\n\\tREP(i, a.size())REP(j, b.size()){\\n\\t\\tR res = conflict(a[i], a[(i+1) % a.size()], b[j], b.v-a.v, max(a.l, b.l), min(a.r, b.r));\\n\\t\\tans = min(ans, res);\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main(int argc, char *argv[]){\\n\\tios::sync_with_stdio(false);\\n\\twhile(cin >> n >> m >> b, n){\\n\\t\\tG g(n);\\n\\t\\tvector<G> polys;\\n\\t\\tREP(i, n) cin >> g[i];\\n\\t\\tR pt = 0;\\n\\t\\tREP(i, m){\\n\\t\\t\\tR t;\\n\\t\\t\\tP v;\\n\\t\\t\\tpolys.pb(g);\\n\\t\\t\\tcin >> t >> v;\\n\\t\\t\\tfor(auto &p : polys[i]) p -= v*pt;\\n\\t\\t\\tpolys[i].v = v; polys[i].l = pt; polys[i].r = t;\\n\\t\\t\\tfor(auto &p : g) p += v*(t-pt);\\n\\t\\t\\tpt = t;\\n\\t\\t}\\n\\t\\tpolys.pb(g);\\n\\t\\tpolys[m].v = P(0, 0);\\n\\t\\tpolys[m].l = pt;\\n\\t\\tpolys[m].r = INF;\\n\\t\\tvector<R> ans;\\n\\t\\tREP(i, b){\\n\\t\\t\\tP p, v;\\n\\t\\t\\tR x, t, l;\\n\\t\\t\\tcin >> t >> x >> v >> l;\\n//\\t\\t\\tcout << \\\"!\\\" << t << \\\" \\\" << x << \\\" \\\" << v << \\\" \\\" << l << endl;\\n\\t\\t\\tp = P(x, 0) - v*t;\\n\\t\\t\\tG bullet(2);\\n\\t\\t\\tbullet[0] = p;\\n\\t\\t\\tbullet[1] = p - unit(v)*l;\\n\\t\\t\\tbullet.v = v;\\n\\t\\t\\tbullet.l = t;\\n\\t\\t\\tbullet.r = INF;\\n\\t\\t\\tR res = INF;\\n\\t\\t\\tREP(j, m+1) res = min(res, min(conflict(polys[j], bullet), conflict(bullet, polys[j])));\\n\\t\\t\\tif(res < INF-EPS) ans.pb(res);\\n\\t\\t}\\n\\t\\tsort(ALL(ans));\\n\\t\\tprintf(\\\"%d\\\\n\\\", (int)ans.size());\\n\\t\\tREP(i, ans.size()) printf(\\\"%.15f\\\\n\\\", (double)ans[i]);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 1400,\n \"score_of_the_acc\": -0.0662,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2023_1368752\",\n \"code_snippet\": \"// * template\\n\\n#include <bits/stdc++.h>\\n#ifdef LOCAL\\n#include \\\"dump.hpp\\\"\\n#else\\n#define dump(...)\\n#endif\\n\\nusing namespace std;\\n\\ntemplate<class T> inline void chmin(T &a, const T &b) { if(a > b) a = b; }\\n\\nstruct range {\\n\\ttypedef int Int;\\n\\tstruct iter {\\n\\t\\tInt i;\\n\\t\\tconst Int s;\\n\\t\\titer(const Int &i_, const Int &s_):i(i_), s(s_) {}\\n\\t\\tbool operator!=(const iter &r) const { return s > 0 ? i < r.i : i > r.i; }\\n\\t\\tconst Int &operator*() const { return i; }\\n\\t\\titer &operator++() { i += s; return *this; }\\n\\t};\\n\\tconst Int f, l, s;\\n\\trange(const Int &f_, const Int &l_, const Int &s_):f(f_), l(l_), s(s_) {}\\n\\trange(const Int &f_, const Int &l_):f(f_), l(l_), s(1) {}\\n\\trange(const Int &num):f(0), l(num), s(1) {}\\n\\titer begin() const { return iter(f, s); }\\n\\titer end() const { return iter(l, s); }\\n};\\n\\n// * geoetry library\\n\\ntypedef double Real;\\nconstexpr Real EPS = 1e-8;\\ninline int sign(Real d) { return d > EPS ? 1 : d < -EPS ? -1 : 0; }\\n\\nstruct Point {\\n\\tReal x, y;\\n\\tPoint():x(0), y(0) {}\\n\\tPoint(Real x_, Real y_):x(x_), y(y_) {}\\n\\tPoint &operator+=(const Point &p) { x += p.x; y += p.y; return *this; }\\n\\tPoint &operator-=(const Point &p) { x -= p.x; y -= p.y; return *this; }\\n\\tPoint &operator*=(Real s) { x *= s; y *= s; return *this; }\\n\\tPoint &operator/=(Real s) { x /= s; y /= s; return *this; }\\n\\tPoint operator-() const { return Point(-x, -y); }\\n\\tPoint operator+(const Point &p) const { return Point(*this) += p; }\\n\\tPoint operator-(const Point &p) const { return Point(*this) -= p; }\\n\\tPoint operator*(Real s) const { return Point(*this) *= s; }\\n\\tPoint operator/(Real s) const { return Point(*this) /= s; }\\n\\tbool operator<(const Point &p) const { return sign(x - p.x) == -1 || (sign(x - p.x) == 0 && sign(y - p.y) == -1); }\\n\\tbool operator>(const Point &p) const { return p < *this; }\\n\\tbool operator==(const Point &p) const { return sign(x - p.x) == 0 && sign(y - p.y) == 0; }\\n\\tbool operator!=(const Point &p) const { return !(*this == p); }\\n};\\n\\ninline istream &operator>>(istream &is, Point &p) {\\n\\treturn is >> p.x >> p.y;\\n}\\n\\ninline ostream &operator<<(ostream &os, const Point &p) {\\n\\treturn os << '(' << p.x << \\\", \\\" << p.y << ')';\\n}\\n\\nstruct Line : public array<Point, 2> {\\n\\tLine(const Point &a, const Point &b) { at(0) = a; at(1) = b; }\\n};\\n\\nstruct Segment : public array<Point, 2> {\\n\\tSegment(const Point &a, const Point &b) { at(0) = a; at(1) = b; }\\n};\\n\\ntypedef vector<Point> Polygon;\\n\\ninline Real norm(const Point &p) {\\n\\treturn p.x * p.x + p.y * p.y;\\n}\\n\\ninline Real abs(const Point &p) {\\n\\treturn sqrt(norm(p));\\n}\\n\\ninline Real dot(const Point &a, const Point &b) {\\n\\treturn a.x * b.x + a.y * b.y;\\n}\\n\\ninline Real cross(const Point &a, const Point &b) {\\n\\treturn a.x * b.y - a.y * b.x;\\n}\\n\\nenum { CCW = 1, CW = -1, BACK = 2, FRONT = -2, ON = 0};\\ninline int ccw(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point p = b - a;\\n\\tconst Point q = c - a;\\n\\tconst int sign_cross = sign(cross(p, q));\\n\\n\\tif(sign_cross == 1) return CCW;\\n\\tif(sign_cross == -1) return CW;\\n\\tif(sign(dot(p, q)) == -1) return BACK;\\n\\tif(sign(norm(p) - norm(q)) == -1) return FRONT;\\n\\treturn ON;\\n}\\n\\ninline bool intersect(const Segment &s, const Point &p) {\\n\\treturn ccw(s[0], s[1], p) == ON;\\n}\\n\\ninline bool intersect(const Segment &a, const Segment &b) {\\n\\treturn ccw(a[0], a[1], b[0]) * ccw(a[0], a[1], b[1]) <= 0\\n\\t\\t&& ccw(b[0], b[1], a[0]) * ccw(b[0], b[1], a[1]) <= 0;\\n}\\n\\ninline Point crosspoint(const Segment &a, const Segment &b) {\\n\\tconst Real crs = cross(a[1] - a[0], b[1] - b[0]);\\n\\tif(sign(crs) == 0) { // on same line\\n\\t\\tif(intersect(a, b[0])) return b[0];\\n\\t\\tif(intersect(a, b[1])) return b[1];\\n\\t\\tif(intersect(b, a[0])) return a[0];\\n\\t\\treturn a[1];\\n\\t}\\n\\treturn b[0] + (b[1] - b[0]) * (cross(a[1] - a[0], a[1] - b[0]) / crs);\\n}\\n\\n// * solve\\n\\nReal collision_time(const Segment &s, const Point &p, const Point &v) {\\n\\tconst Segment seg(p, p + v * 1e7);\\n\\tif(!intersect(s, seg)) return numeric_limits<Real>::max();\\n\\tconst Point cp = crosspoint(s, seg);\\n\\treturn abs(cp - p) / abs(v);\\n}\\n\\nReal collision_time(const Segment &a, const Segment &b, const Point &v_a) {\\n\\treturn min({collision_time(a, b[0], -v_a), collision_time(a, b[1], -v_a),\\n\\t\\t\\t\\tcollision_time(b, a[0], v_a), collision_time(b, a[1], v_a)});\\n}\\n\\nint main() {\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\tcout.setf(ios::fixed);\\n\\tcout.precision(10);\\n\\n\\tfor(int n, m, b; cin >> n >> m >> b && n;) {\\n\\t\\tPolygon body(n);\\n\\t\\tfor(auto &p : body) cin >> p;\\n\\n\\t\\tvector<int> t_body(m + 2);\\n\\t\\tvector<Point> v_body(m + 1);\\n\\t\\tfor(int i = 0; i < m; ++i) {\\n\\t\\t\\tcin >> t_body[i + 1] >> v_body[i];\\n\\t\\t}\\n\\t\\tt_body[m + 1] = INT_MAX;\\n\\t\\tv_body[m] = Point(0, 0);\\n\\n\\t\\tvector<int> t_shoot(b), l_shoot(b);\\n\\t\\tvector<Point> p_shoot(b), v_shoot(b);\\n\\t\\tfor(int i = 0; i < b; ++i) {\\n\\t\\t\\tcin >> t_shoot[i] >> p_shoot[i].x >> v_shoot[i] >> l_shoot[i];\\n\\t\\t}\\n\\n\\t\\tvector<bool> hit(b, false);\\n\\t\\tvector<Real> t_hit;\\n\\n\\t\\tfor(int i = 0; i <= m; ++i) {\\n\\t\\t\\tfor(int j = 0; j < b; ++j) {\\n\\t\\t\\t\\tif(hit[j]) continue;\\n\\t\\t\\t\\tif(t_shoot[j] >= t_body[i + 1]) break;\\n\\n\\t\\t\\t\\tconst Point v = v_shoot[j] - v_body[i];\\n\\t\\t\\t\\tif(sign(abs(v)) == 0) continue;\\n\\n\\t\\t\\t\\tconst Real T = t_body[i] - t_shoot[j];\\n\\t\\t\\t\\tconst Point s = p_shoot[j] + v_shoot[j] * T;\\n\\n\\t\\t\\t\\tconst Segment bullet(s, s - v_shoot[j] * (l_shoot[j] / abs(v_shoot[j])));\\n\\t\\t\\t\\tReal min_time = numeric_limits<Real>::max();\\n\\n\\t\\t\\t\\tPoint prev = body.back();\\n\\t\\t\\t\\tfor(const Point ¤t : body) {\\n\\t\\t\\t\\t\\tconst Segment seg(prev, current);\\n\\n\\t\\t\\t\\t\\tconst Real t = collision_time(bullet, seg, v);\\n\\t\\t\\t\\t\\tif(sign(t) >= 0) chmin(min_time, t + t_body[i]);\\n\\n\\t\\t\\t\\t\\tprev = current;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(sign(min_time - t_body[i + 1]) <= 0) {\\n\\t\\t\\t\\t\\thit[j] = true;\\n\\t\\t\\t\\t\\tt_hit.emplace_back(min_time);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tPoint v = v_body[i] * (t_body[i + 1] - t_body[i]);\\n\\t\\t\\tfor(auto &p : body) {\\n\\t\\t\\t\\tp += v;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tsort(begin(t_hit), end(t_hit));\\n\\t\\tcout << t_hit.size() << '\\\\n';\\n\\t\\tfor(const auto &e : t_hit) {\\n\\t\\t\\tcout << e << '\\\\n';\\n\\t\\t}\\n\\t}\\n\\n\\treturn EXIT_SUCCESS;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1340,\n \"score_of_the_acc\": -0.0163,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2023_1368751\",\n \"code_snippet\": \"// * template\\n\\n#include <bits/stdc++.h>\\n#ifdef LOCAL\\n#include \\\"dump.hpp\\\"\\n#else\\n#define dump(...)\\n#endif\\n\\nusing namespace std;\\n\\ntemplate<class T> inline void chmax(T &a, const T &b) { if(a < b) a = b; }\\ntemplate<class T> inline void chmin(T &a, const T &b) { if(a > b) a = b; }\\n\\ntemplate<class T, class U> inline void fill_array(T &e, const U &v) { e = v; }\\ntemplate<class T, class U, size_t s> inline void fill_array(T (&a)[s], const U &v) {for(auto&e:a)fill_array(e,v);}\\ntemplate<class T, class U, size_t s> inline void fill_array(array<T, s> &a, const U &v) {for(auto&e:a)fill_array(e,v);}\\ntemplate<class T, class U> inline void fill_array(vector<T> &a, const U &v) {for(auto&e:a)fill_array(e,v);}\\n\\nstruct range {\\n\\ttypedef int Int;\\n\\tstruct iter {\\n\\t\\tInt i;\\n\\t\\tconst Int s;\\n\\t\\tconstexpr iter(const Int &i_, const Int &s_):i(i_), s(s_) {}\\n\\t\\tconstexpr bool operator!=(const iter &r) const { return s > 0 ? i < r.i : i > r.i; }\\n\\t\\tconstexpr const Int &operator*() const { return i; }\\n\\t\\titer &operator++() { i += s; return *this; }\\n\\t};\\n\\tconst Int f, l, s;\\n\\tconstexpr range(const Int &f_, const Int &l_, const Int &s_):f(f_), l(l_), s(s_) {}\\n\\tconstexpr range(const Int &f_, const Int &l_):f(f_), l(l_), s(1) {}\\n\\tconstexpr range(const Int &num):f(0), l(num), s(1) {}\\n\\tconstexpr iter begin() const { return iter(f, s); }\\n\\tconstexpr iter end() const { return iter(l, s); }\\n};\\n\\n// * geoetry template\\ntypedef double Real;\\nconstexpr Real EPS = 1e-8;\\nint sign(Real d) { return d > EPS ? 1 : d < -EPS ? -1 : 0; }\\n\\n// * define class\\n\\nstruct Point {\\n\\tReal x, y;\\n\\tPoint():x(0), y(0) {}\\n\\tPoint(Real x_, Real y_):x(x_), y(y_) {}\\n\\tPoint &operator+=(const Point &p) { x += p.x; y += p.y; return *this; }\\n\\tPoint &operator-=(const Point &p) { x -= p.x; y -= p.y; return *this; }\\n\\tPoint &operator*=(Real s) { x *= s; y *= s; return *this; }\\n\\tPoint &operator/=(Real s) { x /= s; y /= s; return *this; }\\n\\tPoint operator-() const { return Point(-x, -y); }\\n\\tPoint operator+(const Point &p) const { return Point(*this) += p; }\\n\\tPoint operator-(const Point &p) const { return Point(*this) -= p; }\\n\\tPoint operator*(Real s) const { return Point(*this) *= s; }\\n\\tPoint operator/(Real s) const { return Point(*this) /= s; }\\n\\tbool operator<(const Point &p) const { return sign(x - p.x) == -1 || (sign(x - p.x) == 0 && sign(y - p.y) == -1); }\\n\\tbool operator>(const Point &p) const { return p < *this; }\\n\\tbool operator==(const Point &p) const { return sign(x - p.x) == 0 && sign(y - p.y) == 0; }\\n\\tbool operator!=(const Point &p) const { return !(*this == p); }\\n};\\n\\ninline istream &operator>>(istream &is, Point &p) {\\n\\treturn is >> p.x >> p.y;\\n}\\n\\ninline ostream &operator<<(ostream &os, const Point &p) {\\n\\treturn os << '(' << p.x << \\\", \\\" << p.y << ')';\\n}\\n\\nstruct Line : public array<Point, 2> {\\n\\tLine(const Point &a, const Point &b) { at(0) = a; at(1) = b; }\\n};\\n\\nstruct Segment : public array<Point, 2> {\\n\\tSegment(const Point &a, const Point &b) { at(0) = a; at(1) = b; }\\n};\\n\\nstruct Circle {\\n\\tPoint c;\\n\\tReal r;\\n\\tCircle(const Point &c_, Real r_):c(c_), r(r_) {}\\n};\\n\\ntypedef vector<Point> Polygon;\\n\\n// * define base function\\n\\nPoint rotate90(const Point &p) {\\n\\treturn Point(-p.y, p.x);\\n}\\n\\nPoint rotate(const Point &p, Real theta) {\\n\\tconst Real s = sin(theta), c = cos(theta);\\n\\treturn Point(c * p.x - s * p.y, s * p.x + c * p.y);\\n}\\n\\nReal angle(const Point &p) {\\n\\treturn atan2(p.y, p.x);\\n}\\n\\nReal norm(const Point &p) {\\n\\treturn p.x * p.x + p.y * p.y;\\n}\\n\\nReal abs(const Point &p) {\\n\\treturn sqrt(norm(p));\\n}\\n\\nReal dot(const Point &a, const Point &b) {\\n\\treturn a.x * b.x + a.y * b.y;\\n}\\n\\nReal cross(const Point &a, const Point &b) {\\n\\treturn a.x * b.y - a.y * b.x;\\n}\\n\\n// * define app function\\n\\nenum { CCW = 1, CW = -1, BACK = 2, FRONT = -2, ON = 0};\\nint ccw(const Point &a, const Point &b, const Point &c) { // a:p0, b:p1, c:p2\\n\\tconst Point p = b - a;\\n\\tconst Point q = c - a;\\n\\tconst int sign_cross = sign(cross(p, q));\\n\\n\\tif(sign_cross == 1) return CCW;\\n\\tif(sign_cross == -1) return CW;\\n\\tif(sign(dot(p, q)) == -1) return BACK;\\n\\tif(sign(norm(p) - norm(q)) == -1) return FRONT;\\n\\treturn ON;\\n}\\n\\nPoint project(const Line &l, const Point &p) {\\n\\tconst Point a = p - l[0];\\n\\tconst Point b = l[1] - l[0];\\n\\treturn l[0] + b * (dot(a, b) / norm(b));\\n}\\n\\nPoint reflect(const Line &l, const Point &p) {\\n\\tconst Point t = project(l, p);\\n\\treturn t + (t - p);\\n}\\n\\nbool intersect(const Segment &s, const Point &p) {\\n\\treturn ccw(s[0], s[1], p) == ON;\\n}\\n\\nbool intersect(const Segment &a, const Segment &b) {\\n\\treturn ccw(a[0], a[1], b[0]) * ccw(a[0], a[1], b[1]) <= 0\\n\\t\\t&& ccw(b[0], b[1], a[0]) * ccw(b[0], b[1], a[1]) <= 0;\\n}\\n\\nbool intersect(const Line &l, const Point &p) {\\n\\treturn abs(ccw(l[0], l[1], p)) != 1;\\n}\\n\\nbool intersect(const Line &l, const Segment &s) {\\n\\treturn sign(cross(l[1] - l[0], s[0] - l[0]) * cross(l[1] - l[0], s[1] - l[0])) <= 0;\\n}\\n\\nbool intersect(const Line &a, const Line &b) {\\n\\treturn sign(cross(a[1] - a[0], b[1] - b[0])) != 0\\n\\t\\t|| sign(cross(a[1] - a[0], b[1] - a[0])) == 0;\\n}\\n\\nReal dist(const Point &a, const Point &b) {\\n\\treturn abs(a - b);\\n}\\n\\nReal dist(const Line &l, const Point &p) {\\n\\tconst Point a = l[1] - l[0];\\n\\tconst Point b = p - l[0];\\n\\treturn abs(cross(a, b)) / abs(a);\\n}\\n\\nReal dist(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s)) return 0;\\n\\treturn min(dist(l, s[0]), dist(l, s[1]));\\n}\\n\\nReal dist(const Line &a, const Line &b) {\\n\\tif(intersect(a, b)) return 0;\\n\\treturn dist(a, b[0]);\\n}\\n\\nReal dist(const Segment &s, const Point &p) {\\n\\tif(sign(dot(s[1] - s[0], p - s[0])) == -1) return dist(s[0], p);\\n\\tif(sign(dot(s[0] - s[1], p - s[1])) == -1) return dist(s[1], p);\\n\\treturn dist(Line(s[0], s[1]), p);\\n}\\n\\nReal dist(const Segment &a, const Segment &b) {\\n\\tif(intersect(a, b)) return 0;\\n\\treturn min({dist(a, b[0]), dist(a, b[1]), dist(b, a[0]), dist(b, a[1])});\\n}\\n\\nPoint crosspoint(const Segment &a, const Segment &b) {\\n\\tconst Real crs = cross(a[1] - a[0], b[1] - b[0]);\\n\\tif(sign(crs) == 0) { // on same line\\n\\t\\tif(intersect(a, b[0])) return b[0];\\n\\t\\tif(intersect(a, b[1])) return b[1];\\n\\t\\tif(intersect(b, a[0])) return a[0];\\n\\t\\treturn a[1];\\n\\t}\\n\\treturn b[0] + (b[1] - b[0]) * (cross(a[1] - a[0], a[1] - b[0]) / crs);\\n}\\n\\n// * solve\\n\\nReal collision_time(const Segment &s, const Point &p, const Point &v) {\\n\\tconst Segment seg(p, p + v * 1e7);\\n\\tif(!intersect(s, seg)) return numeric_limits<Real>::max();\\n\\tconst Point cp = crosspoint(s, seg);\\n\\treturn abs(cp - p) / abs(v);\\n}\\n\\nReal collision_time(const Segment &a, const Segment &b, const Point &v_a) {\\n\\treturn min({collision_time(a, b[0], -v_a), collision_time(a, b[1], -v_a),\\n\\t\\t\\t\\tcollision_time(b, a[0], v_a), collision_time(b, a[1], v_a)});\\n}\\n\\nint main() {\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\tcout.setf(ios::fixed);\\n\\tcout.precision(10);\\n\\n\\tfor(int n, m, b; cin >> n >> m >> b && n;) {\\n\\t\\tPolygon body(n);\\n\\t\\tfor(auto &p : body) cin >> p;\\n\\n\\t\\tvector<int> t_body(m + 2);\\n\\t\\tvector<Point> v_body(m + 1);\\n\\t\\tfor(int i = 0; i < m; ++i) {\\n\\t\\t\\tcin >> t_body[i + 1] >> v_body[i];\\n\\t\\t}\\n\\t\\tt_body[m + 1] = INT_MAX;\\n\\t\\tv_body[m] = Point(0, 0);\\n\\n\\t\\tvector<int> t_shoot(b), l_shoot(b);\\n\\t\\tvector<Point> p_shoot(b), v_shoot(b);\\n\\t\\tfor(int i = 0; i < b; ++i) {\\n\\t\\t\\tcin >> t_shoot[i] >> p_shoot[i].x >> v_shoot[i] >> l_shoot[i];\\n\\t\\t}\\n\\n\\t\\tvector<bool> hit(b, false);\\n\\t\\tvector<Real> t_hit;\\n\\n\\t\\tfor(int i = 0; i <= m; ++i) {\\n\\t\\t\\tfor(int j = 0; j < b; ++j) {\\n\\t\\t\\t\\tif(hit[j]) continue;\\n\\t\\t\\t\\tif(t_shoot[j] >= t_body[i + 1]) break;\\n\\n\\t\\t\\t\\tconst Point v = v_shoot[j] - v_body[i];\\n\\t\\t\\t\\tif(sign(abs(v)) == 0) continue;\\n\\n\\t\\t\\t\\tconst Real T = t_body[i] - t_shoot[j];\\n\\t\\t\\t\\tconst Point s = p_shoot[j] + v_shoot[j] * T;\\n\\n\\t\\t\\t\\tconst Segment bullet(s, s - v_shoot[j] * (l_shoot[j] / abs(v_shoot[j])));\\n\\t\\t\\t\\tReal min_time = numeric_limits<Real>::max();\\n\\t\\t\\t\\tdump(bullet, v);\\n\\n\\t\\t\\t\\tPoint prev = body.back();\\n\\t\\t\\t\\tfor(const Point ¤t : body) {\\n\\t\\t\\t\\t\\tconst Segment seg(prev, current);\\n\\n\\t\\t\\t\\t\\tconst Real t = collision_time(bullet, seg, v);\\n\\t\\t\\t\\t\\tif(sign(t) >= 0) chmin(min_time, t + t_body[i]);\\n\\n\\t\\t\\t\\t\\tprev = current;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(sign(min_time - t_body[i + 1]) <= 0) {\\n\\t\\t\\t\\t\\thit[j] = true;\\n\\t\\t\\t\\t\\tt_hit.emplace_back(min_time);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tPoint v = v_body[i] * (t_body[i + 1] - t_body[i]);\\n\\t\\t\\tfor(auto &p : body) {\\n\\t\\t\\t\\tp += v;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tsort(begin(t_hit), end(t_hit));\\n\\t\\tcout << t_hit.size() << '\\\\n';\\n\\t\\tfor(const auto &e : t_hit) {\\n\\t\\t\\tcout << e << '\\\\n';\\n\\t\\t}\\n\\t}\\n\\n\\treturn EXIT_SUCCESS;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1340,\n \"score_of_the_acc\": -0.0178,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2023_1365132\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n \\n#define eps (1e-5)\\n#define INF (1e20)\\n\\nstatic const double PI = acos(-1);\\nbool eq(double a,double b){\\n return ( -eps < a-b && a-b < eps);\\n}\\n\\nclass Point{\\npublic:\\n double x, y;\\n Point ( double x = 0, double y = 0): x(x), y(y){}\\n Point operator + ( Point p ){ return Point(x + p.x, y + p.y); }\\n Point operator - ( Point p ){ return Point(x - p.x, y - p.y); }\\n Point operator * ( double a ){ return Point(x*a, y*a); }\\n Point operator / ( double a ){ return Point(x/a, y/a); }\\n};\\ntypedef Point Vector;\\n\\nclass Segment{\\npublic:\\n Point p1, p2;\\n Segment(Point s = Point(), Point t = Point()): p1(s), p2(t){}\\n Vector base(){\\n return p2-p1;\\n }\\n};\\ntypedef Segment Line;\\n\\nbool eq(Point a,Point b){ return (eq(a.x,b.x)&&eq(a.y,b.y)); }\\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; }\\nbool isParallel(Vector a, Vector b){return eq(cross(a,b),0);}\\n\\nbool onSegment(Segment s,Point p){\\n if( eq(s.p1,p) || eq(s.p2,p))return true;\\n Vector a=s.p1-p,b=s.p2-p;\\n return ( dot(a,b)<0 && eq(cross(a,b),0) );\\n}\\n\\nVector unit(Vector v){\\n if(eq(abs(v),0))return v;\\n else return v/abs(v);\\n}\\n\\nPoint getCrossPoint(Line a,Line b){\\n return a.p1+(a.p2-a.p1)*\\n (cross(b.p2-b.p1,b.p1-a.p1)/cross(b.p2-b.p1,a.p2-a.p1));\\n} \\n\\nPoint getCrossPointLS(Line l,Segment s){\\n Point p=getCrossPoint(l,s);\\n if(onSegment(s,p))return p;\\n else return (Point){INF,INF};\\n}\\n\\ndouble calcCollision(Point a,Point p,Vector v){\\n if(eq(a,p))return 0;\\n else if(eq(unit(a-p),unit(v))) return abs(a-p)/abs(v);\\n else return INF;\\n}\\n\\ndouble calcCollision(Line l,Point p,Vector v){\\n if(isParallel(l.base(),l.p1-p))return 0;\\n if(isParallel(l.base(),v))return INF;\\n Point q=getCrossPoint(l,(Line){p,p+v});\\n return calcCollision(q,p,v);\\n}\\n\\ndouble calcCollisionSP(Segment s,Point p,Vector v){\\n if(onSegment(s,p))return 0;\\n if(isParallel(s.base(),v))\\n return min(calcCollision(s.p1,p,v),\\n calcCollision(s.p2,p,v));\\n Point q=getCrossPointLS((Line){p,p+v},s);\\n return calcCollision(q,p,v);\\n}\\n\\ndouble calcCollision(vector<Point> &t,Segment s,Vector v){\\n double res=INF;\\n int size=t.size();\\n for(int i=0;i<size;i++)\\n res=min(res,calcCollisionSP(s,t[i],v*-1.0));\\n Segment sa;\\n for(int i=0;i<size;i++){\\n sa.p1=t[i];\\n sa.p2=t[(i+1)%size];\\n res=min(res,calcCollisionSP(sa,s.p1,v));\\n res=min(res,calcCollisionSP(sa,s.p2,v));\\n }\\n return res;\\n}\\n\\nint N,M,B;\\nvector<Point> t,u;\\ndouble T[101];\\nVector V[101];\\n\\nSegment A[100],copyA[100];\\n\\nVector VA[100];\\ndouble TA[100];\\ndouble L[100];\\nbool flg[100];\\n\\n\\nvoid solve(){\\n vector<double> ans;\\n T[M]=1e9;\\n V[M]=(Vector){0,0};\\n \\n double pre=0;\\n for(int i=0;i<=M;i++){\\n double di=T[i]-pre;\\n \\n for(int j=0;j<B;j++){\\n if(flg[j])continue;\\n double res=calcCollision(t,A[j],VA[j]-V[i]);\\n if(res<-eps || di+eps<res)continue;\\n flg[j]=true;\\n ans.push_back(res+pre);\\n }\\n \\n\\n for(int j=0;j<N;j++)t[j]=t[j]+V[i]*di;\\n for(int j=0;j<B;j++){\\n A[j]=copyA[j];\\n A[j].p1=A[j].p1+VA[j]*T[i];\\n A[j].p2=A[j].p2+VA[j]*T[i];\\n }\\n pre=T[i];\\n }\\n \\n sort(ans.begin(),ans.end());\\n cout<<ans.size()<<endl;\\n for(int i=0;i<(int)ans.size();i++)\\n printf(\\\"%.8f\\\\n\\\",ans[i]);\\n}\\n\\nvoid init(){\\n t.clear();\\n for(int i=0;i<100;i++){\\n flg[i]=false;\\n }\\n}\\n\\nint main(){\\n while(1){\\n cin>>N>>M>>B;\\n if(N==0&&M==0&&B==0)break;\\n \\n init();\\n t.resize(N);\\n for(int i=0;i<N;i++){\\n cin>>t[i].x>>t[i].y;\\n }\\n u=t;\\n for(int i=0;i<M;i++){\\n cin>>T[i]>>V[i].x>>V[i].y;\\n }\\n for(int i=0;i<B;i++){\\n cin>>TA[i];\\n A[i].p1.y=0;\\n cin>>A[i].p1.x;\\n cin>>VA[i].x>>VA[i].y;\\n cin>>L[i];\\n A[i].p2=A[i].p1+ (unit(VA[i])*L[i]*-1.0);\\n Vector vb=VA[i]*(-TA[i]);\\n A[i].p1=A[i].p1+vb;\\n A[i].p2=A[i].p2+vb;\\n copyA[i]=A[i];\\n }\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 1324,\n \"score_of_the_acc\": -0.0493,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2023_1203761\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<(n);++i)\\n#define rep1(i,n) for(int i=1;i<=(n);++i)\\n#define all(c) (c).begin(),(c).end()\\n#define fs first\\n#define sc second\\n#define pb push_back\\n#define show(x) cout << #x << \\\" \\\" << x << endl\\ntypedef long double D;\\ntypedef complex<D> P;\\ntypedef pair<P,P> L;\\ntypedef vector<P> Pol;\\nD inf=1e50,eps=1e-8,EPS=1e-8;\\nint N,M,B;\\nP o[101],v[101];\\nD T[102];\\t\\t\\t\\t//T[i]~T[i+1] p=o[i]+t*v[i]\\nPol pol;\\nD cro(P a,P b){return imag(conj(a)*b);}\\nD verlen(L l,P p){return cro(l.fs-l.sc,p-l.sc)/abs(l.fs-l.sc);}\\nbool onL(L l,P p){\\n\\tif(abs(l.fs-p)<eps) return true;\\n\\tif(abs(l.sc-p)<eps) return true;\\n\\treturn abs(l.fs-l.sc)>abs(l.fs-p)&&abs(l.fs-l.sc)>abs(l.sc-p);\\n}\\nD gett(P p,P v,L l){\\n\\tif(abs(cro(l.sc-l.fs,v))<eps) return inf;\\n\\tD l0=verlen(l,p),l1=verlen(l,p+v);\\n\\tD tt=l0/(l0-l1);\\n\\tP pt=p+v*tt;\\n\\tif(onL(l,pt)) return tt;\\n\\treturn inf;\\n}\\nint main(){\\n\\twhile(true){\\n\\t\\tcin>>N>>M>>B;\\n\\t\\tif(N==0) break;\\n\\t\\tpol.clear();\\n\\t\\trep(i,N){\\n\\t\\t\\tint x,y;\\n\\t\\t\\tcin>>x>>y;\\n\\t\\t\\tpol.pb(P(x,y));\\n\\t\\t}\\n\\t\\to[0]=P(0,0);\\n\\t\\trep(i,M){\\n\\t\\t\\tint vx,vy;\\n\\t\\t\\tcin>>T[i+1]>>vx>>vy;\\n\\t\\t\\tv[i]=P(vx,vy);\\n\\t\\t\\to[i+1]=o[i]+v[i]*(T[i+1]-T[i]);\\n\\t\\t}\\n\\t\\trep(i,M) o[i]-=T[i]*v[i];\\n\\t\\tT[M+1]=inf;\\n\\t\\tv[M]=P(0,0);\\n\\t\\tvector<D> ans;\\n\\t\\trep(b,B){\\n\\t\\t\\tD tt,x,len,vx,vy;\\n\\t\\t\\tcin>>tt>>x>>vx>>vy>>len;\\n\\t\\t\\tP vv=P(vx,vy);\\n\\t\\t\\tP oo=P(x,0)-tt*vv;\\n\\t\\t\\tD mn=inf;\\n\\t\\t\\trep(i,M+1){\\n\\t\\t\\t\\trep(j,N){\\n\\t\\t\\t\\t\\tD it=gett(oo,vv-v[i],L(o[i]+pol[j],o[i]+pol[(j+1)%N]));\\n\\t\\t\\t\\t\\tif(T[i]-EPS<it&&it<T[i+1]+EPS) mn=min(mn,it);\\n\\t\\t\\t\\t\\tit=gett(oo-vv/abs(vv)*len,vv-v[i],L(o[i]+pol[j],o[i]+pol[(j+1)%N]));\\n\\t\\t\\t\\t\\tif(T[i]-EPS<it&&it<T[i+1]+EPS) mn=min(mn,it);\\n\\t\\t\\t\\t\\tit=gett(o[i]+pol[j],v[i]-vv,L(oo,oo-vv/abs(vv)*len));\\n\\t\\t\\t\\t\\tif(T[i]-EPS<it&&it<T[i+1]+EPS) mn=min(mn,it);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(mn<inf) ans.pb(mn);\\n\\t\\t}\\n\\t\\tsort(all(ans));\\n\\t\\tcout<<ans.size()<<endl;\\n\\t\\trep(i,ans.size()) printf(\\\"%.8f\\\\n\\\",(double)ans[i]);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 870,\n \"memory_kb\": 1340,\n \"score_of_the_acc\": -0.1489,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2023_1142959\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<math.h>\\n#include<vector>\\nusing namespace std;\\nconst double EPS = 1e-10;\\nconst double INF = 1e+10;\\nconst double PI = acos(-1);\\nint sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }\\ninline double ABS(double a){return max(a,-a);}\\nstruct Pt {\\n\\tdouble x, y;\\n\\tPt() {}\\n\\tPt(double x, double y) : x(x), y(y) {}\\n\\tPt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y); }\\n\\tPt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y); }\\n\\tPt operator*(const Pt &a) const { return Pt(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\tPt operator-() const { return Pt(-x, -y); }\\n\\tPt operator*(const double &k) const { return Pt(x * k, y * k); }\\n\\tPt operator/(const double &k) const { return Pt(x / k, y / k); }\\n\\tdouble ABS() const { return sqrt(x * x + y * y); }\\n\\tdouble abs2() const { return x * x + y * y; }\\n\\tdouble arg() const { return atan2(y, x); }\\n\\tdouble dot(const Pt &a) const { return x * a.x + y * a.y; }\\n\\tdouble det(const Pt &a) const { return x * a.y - y * a.x; }\\n};\\ndouble tri(const Pt &a, const Pt &b, const Pt &c) { return (b - a).det(c - a); }\\nint iSP(Pt a, Pt b, Pt c) {\\n\\tint s = sig((b - a).det(c - a));\\n\\tif (s) return s;\\n\\tif (sig((b - a).dot(c - a)) < 0) return -2; // c-a-b\\n\\tif (sig((a - b).dot(c - b)) < 0) return +2; // a-b-c\\n\\treturn 0;\\n}\\nPt pLL(Pt a, Pt b, Pt c, Pt d) {\\n\\tb = b - a; d = d - c; return a + b * (c - a).det(d) / b.det(d);\\n}\\nbool iLS(Pt a, Pt b, Pt c, Pt d) {\\n\\treturn (sig(tri(a, b, c)) * sig(tri(a, b, d)) <= 0);\\n}\\nbool iSS(Pt a, Pt b, Pt c, Pt d) {\\n\\treturn (iSP(a, b, c) * iSP(a, b, d) <= 0 && iSP(c, d, a) * iSP(c, d, b) <= 0);\\n}\\n\\nPt p[30];\\ndouble t[110];\\ndouble vx[110];\\ndouble vy[110];\\ndouble ret[110];\\ndouble h[110];\\ndouble sx[110];\\ndouble sl[110];\\ndouble tx[110];\\ndouble ty[110];\\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++){\\n\\t\\t\\tdouble x,y;scanf(\\\"%lf%lf\\\",&x,&y);\\n\\t\\t\\tp[i]=Pt(x,y);\\n\\t\\t}\\n\\t\\tfor(int i=0;i<c;i++)ret[i]=999999999;\\n\\t\\tfor(int i=0;i<b;i++){\\n\\t\\t\\tscanf(\\\"%lf%lf%lf\\\",t+i+1,vx+i,vy+i);\\n\\t\\t}\\n\\t\\tt[b+1]=999999999;\\n\\t\\tvx[b]=vy[b]=0;\\n\\t\\tfor(int i=0;i<c;i++){\\n\\t\\t\\tscanf(\\\"%lf%lf%lf%lf%lf\\\",h+i,sx+i,tx+i,ty+i,sl+i);\\n\\t\\t}\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tPt now=p[i];\\n\\t\\t\\tfor(int j=0;j<b;j++){\\n\\t\\t\\t\\tPt to=now+Pt(vx[j],vy[j])*(t[j+1]-t[j]);\\n\\t\\t\\t\\tfor(int k=0;k<c;k++){\\n\\t\\t\\t\\t\\tif(iLS(Pt(sx[k],0),Pt(sx[k]+tx[k],ty[k]),now,to)){\\n\\t\\t\\t\\t\\t\\tPt at=pLL(Pt(sx[k],0),Pt(sx[k]+tx[k],ty[k]),now,to);\\n\\t\\t\\t\\t\\t\\tdouble T=t[j]+(at-now).ABS()/Pt(vx[j],vy[j]).ABS();\\n\\t\\t\\t\\t\\t\\tPt L=Pt(sx[k],0)-Pt(tx[k],ty[k])/Pt(tx[k],ty[k]).ABS()*sl[k]+Pt(tx[k],ty[k])*(T-h[k]);\\n\\t\\t\\t\\t\\t\\tPt R=Pt(sx[k],0)+Pt(tx[k],ty[k])*(T-h[k]);\\n\\t\\t\\t\\t\\t\\tif(T-h[k]>0&&T>t[j]&&T<t[j+1]&&iSP(L,at,R)==2){\\n\\t\\t\\t\\t\\t\\t\\tret[k]=min(ret[k],T);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tnow=to;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t//\\tfor(int i=0;i<c;i++)printf(\\\"%f\\\\n\\\",ret[i]);\\n\\t\\tfor(int i=0;i<c;i++){\\n\\t\\t\\tPt org=Pt(0,0);\\n\\t\\t\\tfor(int j=0;j<=b;j++){\\n\\t\\t\\t\\tPt v=Pt(tx[i],ty[i])-Pt(vx[j],vy[j]);\\n\\t\\t\\t\\tPt L=Pt(sx[i],0)-Pt(tx[i],ty[i])/Pt(tx[i],ty[i]).ABS()*sl[i]+Pt(tx[i],ty[i])*(t[j]-h[i])-org;\\n\\t\\t\\t\\tPt L2=L+v*(t[j+1]-t[j]);\\n\\t\\t\\t\\tPt R=Pt(sx[i],0)+Pt(tx[i],ty[i])*(t[j]-h[i])-org;\\n\\t\\t\\t\\tPt R2=R+v*(t[j+1]-t[j]);\\n\\t\\t\\t\\tfor(int k=0;k<a;k++){\\n\\t\\t\\t\\t\\tif(iSS(L,L2,p[k],p[(k+1)%a])){\\n\\t\\t\\t\\t\\t\\tPt at=pLL(L,L2,p[k],p[(k+1)%a]);\\n\\t\\t\\t\\t\\t\\tdouble tt=t[j]+(at-L).ABS()/v.ABS();\\n\\t\\t\\t\\t\\t\\tif(tt>h[i])ret[i]=min(ret[i],tt);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(iSS(R,R2,p[k],p[(k+1)%a])){\\n\\t\\t\\t\\t\\t\\tPt at=pLL(R,R2,p[k],p[(k+1)%a]);\\n\\t\\t\\t\\t\\t\\tdouble tt=t[j]+(at-R).ABS()/v.ABS();\\n\\t\\t\\t\\t\\t\\tif(tt>h[i])ret[i]=min(ret[i],tt);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\torg=org+Pt(vx[j],vy[j])*(t[j+1]-t[j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t//\\tfor(int i=0;i<c;i++)printf(\\\"%f\\\\n\\\",ret[i]);\\n\\t\\tvector<double>ans;\\n\\t\\tfor(int i=0;i<c;i++){\\n\\t\\t\\tif(ret[i]<9999999)ans.push_back(ret[i]);\\n\\t\\t}\\n\\t\\tstd::sort(ans.begin(),ans.end());\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans.size());\\n\\t\\tfor(int i=0;i<ans.size();i++)printf(\\\"%.12f\\\\n\\\",ans[i]);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1132,\n \"score_of_the_acc\": -0.0031,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1061,"cells":{"group_id":{"kind":"string","value":"aoj_2021_cpp"},"problem_description":{"kind":"string","value":"Princess in Danger\nお姫様の危機\nEnglish text is not available in this practice contest.\nある貧乏な国のおてんばで勇敢なお姫様が，政略結婚のため別の国に嫁ぐことになった．ところが，お姫様を亡き者としようとしている悪漢に嫁ぎ先への道中で襲われお姫様が大けがをしてしまい，近くの病院に搬送された．ところが，悪漢はお姫様は確実に亡き者とするため特殊な毒を使っていた．そのため，お姫様を助けるには本国から特別な薬と冷凍された肉親の血液を大急ぎで運ばなければならなくなった．\nこの血液は冷凍状態で輸送されるのだが，鮮度を保つため，前回の冷凍から最大\nM\n分以内に血液冷凍施設で再冷凍しなければならない．しかし，冷凍施設が設置されている場所は数カ所しかない．\n血液は，十分に冷凍した状態から，再冷凍なしで\nM\n分の間無事である．再冷凍しなくてすむ残り時間が\nS\n分のときに，\nT\n分間冷凍しないで輸送した場合，再冷凍しなくてすむ残り時間は\nS\n-\nT\n分となる．再冷凍しなくてすむ残り時間は，再冷凍することにより，最大\nM\n分まで回復する．血液の再冷凍にかかる時間は，どれだけ冷凍するかに依存する．血液を冷凍施設で，1分冷凍するごとに再冷凍しなくてすむ残り時間は1分回復する．\n本国の首都を出発する時点の，血液を再冷凍しなくてすむ残り時間は\nM\n分である．\nお姫様の従者であるあなたは，大切な主君の命を救うため，本国の首都からお姫様が搬送された病院まで血液の鮮度を保ったまま輸送するための経路を計算しなければならない．そう，あなたの使命は，本国の首都からその病院への最短経路を割り出し，その最短時間を求めることである．\nInput\n入力は，複数のデータセットより構成される．各データセットの最初の行には，6 つの非負の整数\nN\n(2 ≦\nN\n≦ 100)，\nM\n(1 ≦\nM\n≦ 100)，\nL\n(0 ≦\nL\n≦\nN\n- 2)，\nK\n，\nA\n(0 ≦\nA\n＜\nN\n)，\nH\n(0 ≦\nH\n＜\nN\n) が与えられる．これらはそれぞれ，町の数，再冷凍を行うまでの制限時間，冷凍施設のある町の数，町と町を直接結ぶ道路の数，本国の首都を表す番号，お姫様が搬送された病院のある町の番号を表す．本国の首都とお姫様が搬送された病院は，異なる町である．なお，町には 0 〜\nN\n-1 までの番号がそれぞれ割り当てられているものとする．続く行には，\nL\n個の非負の整数が 1 つの空白で区切られて与えられる．これらは，冷凍施設がある町の番号を表す．なお，本国の首都とお姫様が搬送された病院はこのリストには含まれないが，冷凍施設があるものと考えて良い．続く\nK\n行では，町と町を結ぶ道路の情報が与えられる．その第\ni\n行目では，3 つの非負の整数\nX\n，\nY\n，\nT\nが 1 つの空白で区切られて与えられ，これは町\nX\nと町\nY\nを直接結ぶ道があり，移動には時間\nT\nを要するということを表す．なお，この道は双方向に通行可能である．また，町\nX\nと町\nY\nを直接結ぶ道は高々一つしか無い．\n入力は\nN = M = L = K = A = H =\n0 の時に終了し，これはデータセットに含まれない．\nOutput\n各データセットについて，鮮度を保ったまま血液を届けることができる最短時間を出力せよ．もし届けることができない場合には \"Help!\" と出力せよ．\nSample Input\n2 1 0 1 0 1\n0 1 2\n3 1 1 2 0 1\n2\n0 2 1\n1 2 1\n3 2 1 2 0 1\n2\n0 2 1\n1 2 1\n4 4 1 4 1 3\n2\n0 1 2\n1 2 4\n0 2 1\n3 0 3\n5 3 2 6 0 3\n1 2\n2 1 2\n1 0 1\n3 4 1\n2 4 1\n4 1 2\n2 0 2\n5 4 2 6 0 3\n1 2\n4 2 4\n2 1 2\n4 3 1\n0 1 5\n1 4 2\n2 0 3\n0 0 0 0 0 0\nOutput for the Sample Input\nHelp!\n3\n2\n10\n5\n12"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2021_10617724","code_snippet":"#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n// #ifndef ONLINE_JUDGE\n// #define _GLIBCXX_DEBUG // 配列外参照のエラー\n// #endif\n\n// スタンダードライブラリ\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型関連\nusing ll = long long;\nusing lint = long long;\nusing pll = pair<ll, ll>;\nusing plll = tuple<ll, ll, ll>;\nusing pii = pair<int, int>;\nusing piii = tuple<ll, ll, ll>;\ntemplate <class T> using prique = priority_queue<T>;\n\n// 型定数\nconstexpr ll mod = 998244353;\nconstexpr ll MOD = 1000000007;\nint INF32 = 2e9;\nll INF64 = 9e18;\n#define endl '\\n';\n\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\n\n/////////////////////////// print関連\ntemplate <typename T> void print(vector<T> A);\nvoid print();\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail);\nvoid print(string S);\ntemplate <typename T> void print(vector<vector<T>> &F);\n\ninline void Yes(bool f);\n\n///////////////////ここから//////////////////////\nbool solve() {\n\n int N, M, L, K, A, H;\n cin >> N >> M >> L >> K >> A >> H;\n if (N == 0) {\n return false;\n }\n unordered_set<int> LS;\n for (int i = 0; i < L; i++) {\n int l;\n cin >> l;\n LS.insert(l);\n }\n vector<vector<pii>> G(N);\n for (int i = 0; i < K; i++) {\n int a, b, t;\n cin >> a >> b >> t;\n G[a].emplace_back(b, t);\n G[b].emplace_back(a, t);\n }\n vector<vector<int>> dist(N, vector<int>(M + 1, INF32));\n vector<vector<int>> f(N, vector<int>(M + 1, 0));\n priority_queue<piii, vector<piii>, greater<piii>> que;\n que.emplace(0, A, M);\n dist[A][M] = 0;\n while (!que.empty()) {\n auto [d, v, m] = que.top();\n que.pop();\n if (f[v][m]) {\n continue;\n }\n f[v][m] = 1;\n \n if (LS.count(v) && m < M) {\n int nv = v, nm = m + 1;\n if (dist[nv][nm] > dist[v][m] + 1) {\n dist[nv][nm] = dist[v][m] + 1;\n que.emplace(d+1,nv, nm);\n }\n }\n for (auto [nv, t] : G[v]) {\n if (t > m) {\n continue;\n }\n int nm = m - t;\n if (dist[nv][nm] > dist[v][m] + t) {\n dist[nv][nm] = dist[v][m] + t;\n que.emplace(d+t,nv, nm);\n }\n }\n }\n\n int ans = INF32;\n for (int m = 0; m <= M; m++) {\n if (ans > dist[H][m]) {\n ans = dist[H][m];\n }\n }\n if (ans == INF32) {\n print(\"Help!\");\n } else {\n print(ans);\n }\n\n return true;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n while (solve())\n ;\n}\n\n////////////////////print/////////////////////////\n// 1次元ベクトルを出力する\ntemplate <typename T> void print(vector<T> A) {\n if (A.size() == 0) {\n return;\n }\n for (size_t i = 0; i < A.size() - 1; i++) {\n cout << A[i] << ' ';\n }\n cout << A[A.size() - 1] << endl;\n return;\n}\n\n// 2次元ベクトルを出力する\ntemplate <typename T> void print(vector<vector<T>> &F) {\n for (size_t i = 0; i < F.size(); i++) {\n for (size_t j = 0; j < F[i].size(); j++) {\n cout << F[i][j];\n if (j < F[i].size() - 1) {\n cout << ' ';\n }\n }\n cout << endl;\n }\n}\n\n// 空白行を出力するprint\nvoid print() { cout << endl; }\n\n// 数値・文字列を空白区切りで出力する. print(a,b)など\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n cout << head;\n if (sizeof...(tail) != 0)\n cout << \" \";\n print(forward<Tail>(tail)...);\n}\n\nvoid print(string S) { cout << S << endl; }\n\n//////////////出力関連\n\ninline void Yes(bool f) {\n if (f) {\n cout << \"Yes\" << endl;\n } else {\n cout << \"No\" << endl;\n }\n}","accuracy":1,"time_ms":250,"memory_kb":3968,"score_of_the_acc":-0.2362,"final_rank":6},{"submission_id":"aoj_2021_10600491","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nbool solve() {\n int N, M, L, K, A, H;\n cin >> N >> M >> L >> K >> A >> H;\n if (N == 0 && M == 0 && L == 0 && K == 0 && A == 0 && H == 0) return false;\n vector<bool> hos(N);\n hos[A] = hos[H] = true;\n for (int u; L--; ) {\n cin >> u;\n hos[u] = true;\n }\n vector<vector<pair<int, int>>> G(N);\n for (int u, v, w; K--; ) {\n cin >> u >> v >> w;\n G[u].emplace_back(v, w);\n G[v].emplace_back(u, w);\n }\n vector<vector<int>> D(N, vector<int>(M + 1, 1 << 30));\n using T = tuple<int, int, int>;\n priority_queue<T, vector<T>, greater<T>> q;\n D[A][M] = 0;\n q.emplace(0, A, M);\n while (q.size()) {\n auto [d, u, m] = q.top();\n q.pop();\n for (auto [v, w] : G[u]) {\n if (m >= w && D[v][m - w] > d + w) {\n D[v][m - w] = d + w;\n q.emplace(d + w, v, m - w);\n }\n }\n if (hos[u] && m < M && D[u][m + 1] > d + 1) {\n D[u][m + 1] = d + 1;\n q.emplace(d + 1, u, m + 1);\n }\n }\n int ans = 1 << 30;\n for (int m = 0; m <= M; m++) {\n ans = min(ans, D[H][m]);\n }\n if (ans == 1 << 30) {\n cout << \"Help!\\n\";\n } else {\n cout << ans << '\\n';\n }\n return true;\n}\n\nint main() {\n while (solve()) {}\n}","accuracy":1,"time_ms":240,"memory_kb":3968,"score_of_the_acc":-0.2258,"final_rank":3},{"submission_id":"aoj_2021_10558418","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nbool solve();\nint main(){\n while(solve());\n return 0;\n}\n\nusing pii = pair<int,int>;\n\nbool solve(){\n int N, M, L, K, A, H;\n cin>>N>>M>>L>>K>>A>>H;\n if(N==0)return false;\n vector<bool> have_frz(N,false);\n for(int i=0;i<L;i++){\n int l;cin>>l;\n have_frz[l]=true;\n }\n vector<vector<pii>>G(N);\n for(int i=0;i<K;i++){\n int u,v,c;cin>>u>>v>>c;\n if(c>M)continue;\n G[u].push_back(pii(v,c));\n G[v].push_back(pii(u,c));\n }\n const int inf=1e8;\n vector dp(N,vector<int>(M+1,inf));\n priority_queue<pair<int,pii>,vector<pair<int,pii>>,greater<pair<int,pii>>>q;\n q.push(pair<int,pii>(0,pii(A,M)));\n dp[A][M]=0;\n while(!q.empty()){\n int u=q.top().second.first;\n int m=q.top().second.second;\n q.pop();\n for(auto [to,c]:G[u]){\n int nm=m-c;\n if(nm<0)continue;\n if(dp[to][nm]>dp[u][m]+c){\n dp[to][nm]=dp[u][m]+c;\n q.push(pair<int,pii>(dp[to][nm],pii(to,m-c)));\n }\n }\n if(have_frz[u])for(int i=1;;i++){\n int nm=m+i;\n if(nm>M)break;\n if(dp[u][nm]>dp[u][m]+i){\n dp[u][nm]=dp[u][m]+i;\n q.push(pair<int,pii>(dp[u][nm],pii(u,nm)));\n } \n }\n }\n int ans=inf;\n for(int i=0;i<=M;i++)ans=min(ans,dp[H][i]);\n if(ans==inf){\n cout<<\"Help!\"<<endl;\n }else{\n cout<<ans<<endl;\n }\n return true;\n}","accuracy":1,"time_ms":320,"memory_kb":3840,"score_of_the_acc":-0.2724,"final_rank":7},{"submission_id":"aoj_2021_10485389","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nbool solve(){\n int N, M, L, K, A, H; cin >> N >> M >> L >> K >> A >> H;\n // cerr << \"# \" << N << \" \" << M << \" \" << L << \" \" << K << \" \" << A << \" \" << H << endl;\n if(N == 0) return false;\n auto V = [&](int n, int m) -> int {return n * (M + 1) + m;};\n vector G(N * (M + 1), vector<pair<int, int>>{});\n for(int i = 0; i < L; ++i){\n int l; cin >> l;\n for(int j = 0; j < M; ++j){\n G[V(l, j)].emplace_back(V(l, j + 1), 1);\n }\n }\n for(int i = 0; i < K; ++i){\n int X, Y, T; cin >> X >> Y >> T;\n for(int j = T; j <= M; ++j){\n G[V(X, j)].emplace_back(V(Y, j - T), T);\n G[V(Y, j)].emplace_back(V(X, j - T), T);\n }\n }\n using P = pair<int, int>;\n priority_queue<P, vector<P>, greater<P>> que;\n int INF = 1 << 28;\n vector dist(N * (M + 1), INF);\n que.emplace(0, V(A, M));\n dist[V(A, M)] = 0;\n while(que.size()){\n auto [d, u] = que.top(); que.pop();\n if(dist[u] != d) continue;\n for(auto [v, c] : G[u]){\n if(d + c < dist[v]){\n // cerr << \"# \" << u << \" -> \" << v << \" : \" << c << endl;\n dist[v] = d + c;\n que.emplace(d + c, v);\n }\n }\n }\n // for(int i = 0; i < N; ++i){\n // cerr << \"#\";\n // for(int j = 0; j <= M; ++j){\n // cerr << \" \" << dist[V(i, j)];\n // }\n // cerr << endl;\n // }\n int ans = INF;\n for(int j = 0; j <= M; ++j){\n ans = min(ans, dist[V(H, j)]);\n }\n if(ans == INF) cout << \"Help!\" << endl;\n else cout << ans << endl;\n return true;\n}\n\nint main(){\n while(1){\n if(!solve()) break;\n }\n}","accuracy":1,"time_ms":520,"memory_kb":5356,"score_of_the_acc":-0.9044,"final_rank":17},{"submission_id":"aoj_2021_10451570","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nusing edge = pair<int, ll>; // {to, w}\n\nconstexpr bool DEBUG = false;\nconstexpr ll INF = 2e18;\n\nll solve(int N, int M, int L, int K, int S, int G) {\n vector<bool> frz(N, false);\n for (int i = 0; i < L; i++) {\n int u;\n cin >> u;\n frz[u] = true;\n }\n frz[S] = true;\n frz[G] = true;\n\n vector<vector<edge>> graph(N);\n for (int i = 0; i < K; i++) {\n int u, v, t;\n cin >> u >> v >> t;\n graph[u].emplace_back(v, t);\n graph[v].emplace_back(u, t);\n }\n\n vector<vector<ll>> dist(N, vector<ll>(M + 1, INF));\n priority_queue<tuple<ll, int, int>, vector<tuple<ll, int, int>>, greater<>> pq; // {cost, from, rem}\n dist[S][M] = 0;\n pq.emplace(0, S, M);\n while (!pq.empty()) {\n auto [cost, from, rem] = pq.top();\n pq.pop();\n if (cost > dist[from][rem]) {\n continue;\n }\n\n for (auto [to, w] : graph[from]) {\n ll next_rem = rem - w;\n ll next_cost = cost + w;\n\n if (rem < w) {\n continue;\n }\n\n if (dist[to][next_rem] > next_cost) {\n dist[to][next_rem] = next_cost;\n pq.emplace(next_cost, to, next_rem);\n }\n }\n\n if (frz[from] && rem < M) {\n int to = from;\n ll next_cost = cost + 1;\n ll next_rem = rem + 1;\n if (dist[to][next_rem] > next_cost) {\n pq.emplace(next_cost, to, next_rem);\n }\n }\n }\n\n ll ans = INF;\n for (int rem = 0; rem <= M; rem++) {\n ans = min(ans, dist[G][rem]);\n }\n return ans;\n}\n\nint main() {\n while (true) {\n int N, M, L, K, A, H;\n cin >> N >> M >> L >> K >> A >> H;\n if (N == 0) {\n break;\n }\n ll ans = solve(N, M, L, K, A, H);\n if (ans == INF) {\n cout << \"Help!\" << endl;\n } else {\n cout << ans << endl;\n }\n }\n}","accuracy":1,"time_ms":370,"memory_kb":3840,"score_of_the_acc":-0.3239,"final_rank":10},{"submission_id":"aoj_2021_10450960","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nusing edge = pair<int, ll>; // {to, w}\n\nconstexpr bool DEBUG = false;\nconstexpr ll INF = 2e18;\n\nll solve(int N, int M, int L, int K, int S, int G) {\n vector<bool> has_freeze(N, false);\n for (int i = 0; i < L; i++) {\n int u;\n cin >> u;\n has_freeze[u] = true;\n }\n has_freeze[S] = true;\n has_freeze[G] = true;\n\n vector<vector<edge>> graph(N);\n for (int i = 0; i < K; i++) {\n int u, v, t;\n cin >> u >> v >> t;\n graph[u].emplace_back(v, t);\n graph[v].emplace_back(u, t);\n }\n\n vector<vector<ll>> dist(N, vector<ll>(M + 1, INF));\n priority_queue<tuple<ll, int, int>, vector<tuple<ll, int, int>>, greater<>> pq; // {cost, from, rem}\n dist[S][M] = 0;\n pq.emplace(0, S, M);\n while (!pq.empty()) {\n auto [cost, from, rem] = pq.top();\n pq.pop();\n if (cost > dist[from][rem]) {\n continue;\n }\n\n for (auto [to, w] : graph[from]) {\n ll next_rem = rem - w;\n ll next_cost = cost + w;\n\n if (rem < w) {\n continue;\n }\n\n if (dist[to][next_rem] > next_cost) {\n dist[to][next_rem] = next_cost;\n pq.emplace(next_cost, to, next_rem);\n }\n }\n\n if (has_freeze[from] && rem < M) {\n int to = from;\n ll next_cost = cost + 1;\n ll next_rem = rem + 1;\n if (dist[to][next_rem] > next_cost) {\n pq.emplace(next_cost, to, next_rem);\n }\n }\n }\n\n ll ans = INF;\n for (int rem = 0; rem <= M; rem++) {\n ans = min(ans, dist[G][rem]);\n }\n return ans;\n}\n\nint main() {\n while (true) {\n int N, M, L, K, A, H;\n cin >> N >> M >> L >> K >> A >> H;\n if (N == 0) {\n break;\n }\n ll ans = solve(N, M, L, K, A, H);\n if (ans == INF) {\n cout << \"Help!\" << endl;\n } else {\n cout << ans << endl;\n }\n }\n}","accuracy":1,"time_ms":370,"memory_kb":3968,"score_of_the_acc":-0.3599,"final_rank":12},{"submission_id":"aoj_2021_10450923","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = LLONG_MAX / 4;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (true) {\n int N, M, L, K, A, H;\n cin >> N >> M >> L >> K >> A >> H;\n // 全てが0なら入力終了\n if (!cin || (N == 0 && M == 0 && L == 0 && K == 0 && A == 0 && H == 0))\n break;\n\n // 冷凍施設の有無を管理 (町ごと)\n vector<bool> has_freeze(N, false);\n for (int i = 0; i < L; i++) {\n int x; cin >> x;\n has_freeze[x] = true;\n }\n // 首都(A)と病院(H)も冷凍施設があるとみなす\n has_freeze[A] = has_freeze[H] = true;\n\n // グラフの隣接リスト (町uから町vへ移動時間t)\n vector<vector<pair<int,int>>> graph(N);\n for (int i = 0; i < K; i++) {\n int u, v, t;\n cin >> u >> v >> t;\n graph[u].emplace_back(v, t);\n graph[v].emplace_back(u, t);\n }\n\n // dist[u][r] = 残り鮮度r分で町uに到達するための最小時間\n vector<vector<ll>> dist(N, vector<ll>(M + 1, INF));\n // 優先度付きキュー (最小時間優先): (time, node, remaining)\n using T = tuple<ll,int,int>;\n priority_queue<T, vector<T>, greater<T>> pq;\n dist[A][M] = 0; // 首都出発時は鮮度M分\n pq.emplace(0, A, M);\n\n // Dijkstra 法\n while (!pq.empty()) {\n auto [t, u, rem] = pq.top();\n pq.pop();\n if (t > dist[u][rem]) continue;\n\n // 1) 道路を移動する遷移\n for (auto &e : graph[u]) {\n int v = e.first;\n int cost = e.second;\n if (rem >= cost) {\n int next_rem = rem - cost;\n ll nt = t + cost;\n if (nt < dist[v][next_rem]) {\n dist[v][next_rem] = nt;\n pq.emplace(nt, v, next_rem);\n }\n }\n }\n // 2) 再冷凍する遷移 (冷凍施設があり、残り鮮度 < M の場合)\n if (has_freeze[u] && rem < M) {\n int next_rem = rem + 1;\n ll nt = t + 1;\n if (nt < dist[u][next_rem]) {\n dist[u][next_rem] = nt;\n pq.emplace(nt, u, next_rem);\n }\n }\n }\n\n // 病院(H)への到達時間の最小値を求める\n ll ans = INF;\n for (int rem = 0; rem <= M; rem++) {\n ans = min(ans, dist[H][rem]);\n }\n if (ans == INF) {\n cout << \"Help!\" << '\\n';\n } else {\n cout << ans << '\\n';\n }\n }\n return 0;\n}","accuracy":1,"time_ms":240,"memory_kb":3968,"score_of_the_acc":-0.2258,"final_rank":3},{"submission_id":"aoj_2021_10450916","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = LLONG_MAX / 4;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (true) {\n int N, M, L, K, A, H;\n cin >> N >> M >> L >> K >> A >> H;\n if (!cin || (N == 0 && M == 0 && L == 0 && K == 0 && A == 0 && H == 0))\n break;\n\n vector<bool> has_freeze(N, false);\n for (int i = 0; i < L; i++) {\n int x; cin >> x;\n has_freeze[x] = true;\n }\n has_freeze[A] = has_freeze[H] = true;\n\n vector<vector<pair<int,int>>> graph(N);\n for (int i = 0; i < K; i++) {\n int u, v, t;\n cin >> u >> v >> t;\n graph[u].emplace_back(v, t);\n graph[v].emplace_back(u, t);\n }\n\n vector<vector<ll>> dist(N, vector<ll>(M + 1, INF));\n using T = tuple<ll,int,int>;\n priority_queue<T, vector<T>, greater<T>> pq;\n dist[A][M] = 0;\n pq.emplace(0, A, M);\n\n while (!pq.empty()) {\n auto [t, u, rem] = pq.top();\n pq.pop();\n if (t > dist[u][rem]) continue;\n for (auto &e : graph[u]) {\n int v = e.first;\n int cost = e.second;\n if (rem >= cost) {\n int next_rem = rem - cost;\n ll nt = t + cost;\n if (nt < dist[v][next_rem]) {\n dist[v][next_rem] = nt;\n pq.emplace(nt, v, next_rem);\n }\n }\n }\n if (has_freeze[u] && rem < M) {\n int next_rem = rem + 1;\n ll nt = t + 1;\n if (nt < dist[u][next_rem]) {\n dist[u][next_rem] = nt;\n pq.emplace(nt, u, next_rem);\n }\n }\n }\n\n ll ans = INF;\n for (int rem = 0; rem <= M; rem++) {\n ans = min(ans, dist[H][rem]);\n }\n if (ans == INF) {\n cout << \"Help!\" << '\\n';\n } else {\n cout << ans << '\\n';\n }\n }\n return 0;\n}","accuracy":1,"time_ms":240,"memory_kb":3968,"score_of_the_acc":-0.2258,"final_rank":3},{"submission_id":"aoj_2021_9591889","code_snippet":"#include <bits/stdc++.h>\n using namespace std;\n #include <ext/pb_ds/assoc_container.hpp>\n using namespace __gnu_pbds;\n \n template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\n template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n #define rep(i,n) for (int i = 0; i < (n); ++i)\n\n typedef long long ll;\n typedef unsigned long long ull;\n typedef long double ld;\n using P=pair<int,int>;\n using T=tuple<int,int,int>;\n const ll INF=1001001001; \n const ll INFL=1e18;\n const ll mod=998244353;\n\n\n void solve(int n,int m,int l,int k,int a,int h){\n vector<int>frozen(n);\n rep(i,l){\n int p;\n cin>>p;\n frozen[p]=1;\n }\n vector<vector<P>>G(n);\n rep(i,k){\n int u,v,d;\n cin>>u>>v>>d;\n G[u].emplace_back(v,d);\n G[v].emplace_back(u,d);\n }\n vector<vector<int>>dist(n,vector<int>(m+1,INF));\n priority_queue<T,vector<T>,greater<T>>q;\n q.push(make_tuple(0,a,m));\n dist[a][m]=0;\n while(q.size()){\n auto[d,v,M]=q.top();q.pop();\n if(d>dist[v][M])continue;\n for(auto[u,nd]:G[v]){\n if(M-nd<0)continue;\n if(chmin(dist[u][M-nd],dist[v][M]+nd)){\n q.push(make_tuple(dist[u][M-nd],u,M-nd));\n }\n }\n if(frozen[v]){\n for(int i=M+1;i<=m;i++){\n if(chmin(dist[v][i],dist[v][M]+(i-M))){\n q.push(make_tuple(dist[v][i],v,i));\n }\n }\n }\n }\n int ans=INF;\n rep(i,m+1){\n chmin(ans,dist[h][i]);\n }\n if(ans==INF){\n cout<<\"Help!\"<<endl;\n }else{\n cout<<ans<<endl;\n }\n }\n\n int main(){\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n \n while(1){\n int n,m,l,k,a,h;\n cin>>n>>m>>l>>k>>a>>h;\n if(n==0&&m==0&&l==0&&k==0&&a==0&&h==0){\n break;\n }\n solve(n,m,l,k,a,h);\n }\n return 0;\n }","accuracy":1,"time_ms":300,"memory_kb":3968,"score_of_the_acc":-0.2877,"final_rank":9},{"submission_id":"aoj_2021_9456316","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n#include <unistd.h>\n\nnamespace fastio {\nstatic constexpr uint32_t SZ = 1 << 17;\nchar ibuf[SZ];\nchar obuf[SZ];\nchar out[100];\n// pointer of ibuf, obuf\n\n\nuint32_t pil = 0, pir = 0, por = 0;\n\nstruct Pre {\n char num[10000][4];\n constexpr Pre() : num() {\n for (int i = 0; i < 10000; i++) {\n int n = i;\n for (int j = 3; j >= 0; j--) {\n num[i][j] = n % 10 | '0';\n n /= 10;\n }\n }\n }\n} constexpr pre;\n\ninline void load() {\n memmove(ibuf, ibuf + pil, pir - pil);\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\n pil = 0;\n if (pir < SZ)\n ibuf[pir++] = '\\n';\n}\n\ninline void flush() {\n fwrite(obuf, 1, por, stdout);\n por = 0;\n}\n\nvoid rd(char &c) {\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n}\n\nvoid rd(string &x) {\n x.clear();\n char c;\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n do {\n x += c;\n if (pil == pir)\n load();\n c = ibuf[pil++];\n } while (!isspace(c));\n}\n\ntemplate <typename T> void rd_real(T &x) {\n string s;\n rd(s);\n x = stod(s);\n}\n\ntemplate <typename T> void rd_integer(T &x) {\n if (pil + 100 > pir)\n load();\n char c;\n do\n c = ibuf[pil++];\n while (c < '-');\n bool minus = 0;\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (c == '-') {\n minus = 1, c = ibuf[pil++];\n }\n }\n x = 0;\n while ('0' <= c) {\n x = x * 10 + (c & 15), c = ibuf[pil++];\n }\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (minus)\n x = -x;\n }\n}\n\nvoid rd(int &x) {\n rd_integer(x);\n}\nvoid rd(ll &x) {\n rd_integer(x);\n}\nvoid rd(i128 &x) {\n rd_integer(x);\n}\nvoid rd(uint &x) {\n rd_integer(x);\n}\nvoid rd(ull &x) {\n rd_integer(x);\n}\nvoid rd(u128 &x) {\n rd_integer(x);\n}\nvoid rd(double &x) {\n rd_real(x);\n}\nvoid rd(long double &x) {\n rd_real(x);\n}\n\ntemplate <class T, class U> void rd(pair<T, U> &p) {\n return rd(p.first), rd(p.second);\n}\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\n if constexpr (N < std::tuple_size<T>::value) {\n auto &x = std::get<N>(t);\n rd(x);\n rd_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void rd(tuple<T...> &tpl) {\n rd_tuple(tpl);\n}\n\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\n for (auto &d : x)\n rd(d);\n}\ntemplate <class T> void rd(vector<T> &x) {\n for (auto &d : x)\n rd(d);\n}\n\nvoid read() {}\ntemplate <class H, class... T> void read(H &h, T &...t) {\n rd(h), read(t...);\n}\n\nvoid wt(const char c) {\n if (por == SZ)\n flush();\n obuf[por++] = c;\n}\nvoid wt(const string s) {\n for (char c : s)\n wt(c);\n}\nvoid wt(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++)\n wt(s[i]);\n}\n\ntemplate <typename T> void wt_integer(T x) {\n if (por > SZ - 100)\n flush();\n if (x < 0) {\n obuf[por++] = '-', x = -x;\n }\n int outi;\n for (outi = 96; x >= 10000; outi -= 4) {\n memcpy(out + outi, pre.num[x % 10000], 4);\n x /= 10000;\n }\n if (x >= 1000) {\n memcpy(obuf + por, pre.num[x], 4);\n por += 4;\n } else if (x >= 100) {\n memcpy(obuf + por, pre.num[x] + 1, 3);\n por += 3;\n } else if (x >= 10) {\n int q = (x * 103) >> 10;\n obuf[por] = q | '0';\n obuf[por + 1] = (x - q * 10) | '0';\n por += 2;\n } else\n obuf[por++] = x | '0';\n memcpy(obuf + por, out + outi + 4, 96 - outi);\n por += 96 - outi;\n}\n\ntemplate <typename T> void wt_real(T x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << double(x);\n string s = oss.str();\n wt(s);\n}\n\nvoid wt(int x) {\n wt_integer(x);\n}\nvoid wt(ll x) {\n wt_integer(x);\n}\nvoid wt(i128 x) {\n wt_integer(x);\n}\nvoid wt(uint x) {\n wt_integer(x);\n}\nvoid wt(ull x) {\n wt_integer(x);\n}\nvoid wt(u128 x) {\n wt_integer(x);\n}\nvoid wt(double x) {\n wt_real(x);\n}\nvoid wt(long double x) {\n wt_real(x);\n}\n\ntemplate <class T, class U> void wt(const pair<T, U> val) {\n wt(val.first);\n wt(' ');\n wt(val.second);\n}\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) {\n wt(' ');\n }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T> void wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() {\n wt('\\n');\n}\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n wt(head);\n if (sizeof...(Tail))\n wt(' ');\n print(forward<Tail>(tail)...);\n}\nvoid __attribute__((destructor)) _d() {\n flush();\n}\n} // namespace fastio\n\n\nusing fastio::flush;\nusing fastio::print;\nusing fastio::read;\n\ninline void first(bool i = true) {\n print(i ? \"first\" : \"second\");\n}\ninline void Alice(bool i = true) {\n print(i ? \"Alice\" : \"Bob\");\n}\ninline void Takahashi(bool i = true) {\n print(i ? \"Takahashi\" : \"Aoki\");\n}\ninline void yes(bool i = true) {\n print(i ? \"yes\" : \"no\");\n}\ninline void Yes(bool i = true) {\n print(i ? \"Yes\" : \"No\");\n}\ninline void No() {\n print(\"No\");\n}\ninline void YES(bool i = true) {\n print(i ? \"YES\" : \"NO\");\n}\ninline void NO() {\n print(\"NO\");\n}\ninline void Yay(bool i = true) {\n print(i ? \"Yay!\" : \":(\");\n}\ninline void Possible(bool i = true) {\n print(i ? \"Possible\" : \"Impossible\");\n}\ninline void POSSIBLE(bool i = true) {\n print(i ? \"POSSIBLE\" : \"IMPOSSIBLE\");\n}\n\n/**\n * @brief Fast IO\n */\n\nint main() {\nwhile(1) {\n int N, M, L, K, S, G;\n cin >> N >> M >> L >> K >> S >> G;\n if (N == 0) return 0;\n vector<int> X;\n X.push_back(S), X.push_back(G);\n rep(i,0,L) {\n int _;\n cin >> _;\n X.push_back(_);\n }\n L += 2;\n vector<vector<int>> D1(N,vector<int>(N,inf));\n rep(i,0,N) D1[i][i] = 0;\n rep(i,0,K) {\n int s, t, c;\n cin >> s >> t >> c;\n chmin(D1[s][t], c);\n chmin(D1[t][s], c);\n }\n rep(k,0,N) {\n rep(i,0,N) {\n rep(j,0,N) {\n chmin(D1[i][j], D1[i][k] + D1[k][j]);\n }\n }\n }\n vector<vector<int>> D2(L,vector<int>(L,inf));\n rep(i,0,L) {\n rep(j,0,L) {\n if (D1[X[i]][X[j]] <= M) chmin(D2[i][j], D1[X[i]][X[j]]);\n }\n }\n rep(k,0,L) {\n rep(i,0,L) {\n rep(j,0,L) {\n chmin(D2[i][j], D2[i][k] + D2[k][j]);\n }\n }\n }\n if (D2[0][1] == inf) cout << \"Help!\" << endl;\n else cout << D2[0][1] + max(0,D2[0][1] - M) << endl;\n}\n}","accuracy":1,"time_ms":530,"memory_kb":3620,"score_of_the_acc":-0.4271,"final_rank":14},{"submission_id":"aoj_2021_9403083","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#ifdef LOCAL\n#include \"./debug.hpp\"\n#else\n#define debug(...)\n#define print_line\n#endif\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vl = vector<ll>;\nusing pi = pair<int,int>;\nusing pl = pair<ll,ll>;\nconst int INF = 1e9 + 10;\nconst ll INFL = 4e18;\n#define rep(i, a, b) for (ll i = (a); i < (ll)(b); i++)\n#define all(x) x.begin(),x.end()\n\ntemplate <typename T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }\ntemplate <typename T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }\n\n// --------------------------------------------------------\n\nint D[101][101];\n\nint main(){\n\twhile(true){\n\t\tint N,M,L,K,A,H;cin>>N>>M>>L>>K>>A>>H;\n\t\tif(N==0)break;\n\t\tfor(int i=0;i<N;i++)for(int j=0;j<=M;j++)D[i][j]=INF;\n\t\tvector<bool>cool(N,false);\n\t\tfor(int i=0;i<L;i++){\n\t\t\tint l;cin>>l;\n\t\t\tcool[l]=true;\n\t\t}\n\t\tcool[A]=true;\n\t\tcool[H]=true;\n\t\tvector<vector<pair<int,int>>>G(N);\n\t\tfor(int i=0;i<K;i++){\n\t\t\tint X,Y,T;cin>>X>>Y>>T;\n\t\t\tif(T>M)continue;\n\t\t\tG[X].push_back({Y,T});\n\t\t\tG[Y].push_back({X,T});\n\t\t}\n\n\t\tD[A][M]=0;\n\t\tusing T=tuple<int,int,int>;\n\t\tpriority_queue<T,vector<T>,greater<>>pq;\n\t\tpq.push({0,A,M});\n\t\twhile(!pq.empty()){\n\t\t\tauto[time,now,rem]=pq.top();pq.pop();\n\t\t\tfor(auto[nxt,cost]:G[now]){\n\t\t\t\tif(rem-cost>=0&&D[nxt][rem-cost]>time+cost){\n\t\t\t\t\tD[nxt][rem-cost]=time+cost;\n\t\t\t\t\tpq.push({time+cost,nxt,rem-cost});\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(cool[now]&&rem+1<=M&&D[now][rem+1]>time+1){\n\t\t\t\tD[now][rem+1]=time+1;\n\t\t\t\tpq.push({time+1,now,rem+1});\n\t\t\t}\n\t\t}\n\n\t\tint ans=INF;\n\t\tfor(int i=0;i<=M;i++)ans=min(ans,D[H][i]);\n\n\t\tif(ans==INF)cout<<\"Help!\"<<endl;\n\t\telse cout<<ans<<endl;\n\t}\n}","accuracy":1,"time_ms":310,"memory_kb":3380,"score_of_the_acc":-0.1328,"final_rank":1},{"submission_id":"aoj_2021_9370417","code_snippet":"#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define all(x) (x).begin(),(x).end()\n#define eb emplace_back\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing vl = vector<long long>;\nusing vvl = vector<vector<long long>>; using vs = vector<string>;\nusing pl = pair<long long, long long>;\ntemplate <typename T> inline bool chmin(T& a, const T& b) {bool compare = a > b; if (a > b) a = b; return compare;}\ntemplate <typename T> inline bool chmax(T& a, const T& b) {bool compare = a < b; if (a < b) a = b; return compare;}\ntemplate<class T>using rp_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate <typename T> T gcd(T a, T b) {if (b == 0)return a; else return gcd(b, a % b);}\ntemplate <typename T> inline T lcm(T a, T b) {return a /gcd(a, b)*b;}\nconst ll INF = 1LL << 60;\nconst ld PI = acos(-1);\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);\ntemplate <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);\ntemplate <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);\ntemplate <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);\ntemplate <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);\ntemplate <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);\ntemplate <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);\ntemplate <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);\n \ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }\ntemplate <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }\ntemplate <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }\ntemplate <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }\ntemplate <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << \"deq[\"; for (auto v : vec) os << v << ','; os << ']'; return os; }\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }\ntemplate <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << \"=>\" << v.second << ','; os << '}'; return os; }\ntemplate <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << \"=>\" << v.second << ','; os << '}'; return os; }\n#ifdef LOCAL\nconst string COLOR_RESET = \"\\033[0m\", BRIGHT_GREEN = \"\\033[1;32m\", BRIGHT_RED = \"\\033[1;31m\", BRIGHT_CYAN = \"\\033[1;36m\", NORMAL_CROSSED = \"\\033[0;9;37m\", RED_BACKGROUND = \"\\033[1;41m\", NORMAL_FAINT = \"\\033[0;2m\";\n#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << \" = \" << (x) << NORMAL_FAINT << \" (L\" << __LINE__ << \") \" << __FILE__ << COLOR_RESET << std::endl\n#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << \" = \" << (x) << NORMAL_FAINT << \" (L\" << __LINE__ << \") \" << __FILE__ << COLOR_RESET << std::endl : std::cerr)\n#else\n#define dbg(x) ((void)0)\n#define dbgif(cond, x) ((void)0)\n#endif\nvoid solve();\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout<<fixed<<setprecision(15);\n int num_tc = 1;\n //cin >> num_tc;\n rep(tc,num_tc){\n //cout << \"Case #\" << tc+1 << \": \" ;// << endl;\n solve();\n }\n}\n//見切り発車で実装しては行けない．頭の中でコードが完全に出来上がるまで書き始めるな．\nvoid solve(){\n while(true){\n ll N,M,L,K,A,H;\n cin>>N>>M>>L>>K>>A>>H;\n if(N==0&&M==0&&L==0&&K==0&&A==0&&H==0)return;\n set<ll> st;\n rep(i,L){\n ll r;cin>>r;\n st.insert(r);\n }\n vector<vector<pl>> G(N);\n rep(i,K){\n ll x,y,t;cin>>x>>y>>t;\n G[x].push_back({y,t});\n G[y].push_back({x,t});\n }\n //頑張ってダイクストラ\n //dist[i][残り時間] = 最小コスト\n vvl dist(N,vl(M+1,INF));\n dist[A][M]=0;\n //最短経路,場所,残りのうけつ\n rp_queue<tuple<ll,ll,ll>> que;\n que.push({0,A,M});\n while(!que.empty()){\n auto [d,a,m] = que.top();\n que.pop();\n //すでに最短経路があればいらない\n if(d>dist[a][m])continue;\n //再度輸血する\n if(st.count(a)&&m+1<=M&&chmin(dist[a][m+1],dist[a][m]+1)){\n que.push({dist[a][m+1],a,m+1});\n }\n for(auto [v,t]:G[a]){\n if(m-t>=0&&chmin(dist[v][m-t],dist[a][m]+t)){\n que.push({dist[v][m-t],v,m-t});\n }\n }\n }\n ll ans = INF;\n for(int j=0;j<=M;j++)chmin(ans,dist[H][j]);\n if(ans==INF)cout<<\"Help!\"<<endl;\n else cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":360,"memory_kb":3712,"score_of_the_acc":-0.2776,"final_rank":8},{"submission_id":"aoj_2021_9258353","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long \n#define rep(i,n) for(ll i = 0;i < (ll)(n);i++)\nconst ll INF = 1LL << 60;\n\nvoid chmin(ll &a,ll b){\n if(a > b){\n a = b;\n }\n}\n\n\nll warshal(vector<vector<ll>> &dist){\n ll siz =dist.size();\n rep(k,siz)rep(i,siz)rep(j,siz){\n if(i == j){\n chmin(dist[i][j],0LL);\n }\n if(dist[i][k] != INF && dist[k][j] != INF){\n chmin(dist[i][j],dist[i][k] + dist[k][j]);\n }\n }\n rep(i,siz){\n if(dist[i][i] < 0){\n return -1;\n }\n }\n return 1;\n}\n\nvoid solve(ll n,ll m,ll l,ll k,ll a,ll h){\n vector<ll> f(l);\n rep(i,l){\n cin >> f[i];\n }\n f.push_back(a);\n f.push_back(h);\n vector<vector<ll>> g(n,vector<ll>(n,INF));\n rep(i,k){\n ll x,y,c;\n cin >> x>> y >> c;\n g[x][y] = c;\n g[y][x] = c;\n }\n\n warshal(g);\n\n vector<vector<pair<ll,ll>>> gg(n);\n for(auto & p:f){\n for(auto & q:f){\n if(p == q)continue;\n if(g[p][q] < INF){\n gg[p].push_back({q,g[p][q]});\n }\n }\n }\n \n\n vector<ll> dist(n,INF);\n queue<ll> que;\n dist[a] = 0;\n que.push(a);\n while(!que.empty()){\n ll now = que.front();\n que.pop();\n for(auto [i,cost]:gg[now]){\n\n if(cost <= m && dist[now] + cost < dist[i]){\n dist[i] = dist[now] + cost;\n que.push(i);\n }\n }\n }\n if(dist[h] == INF){\n cout << \"Help!\" << endl;\n }else{\n if(dist[h] <= m){\n cout << dist[h] << endl;\n }else{\n cout << dist[h] + (dist[h] - m) << endl;\n }\n }\n\n}\n\nint main(){\n while(true){\n ll n,m,l,k,a,h;\n cin >> n >> m >> l >> k >> a >> h;\n if(n + m + l + k + a + h == 0)break;\n solve(n,m,l,k,a,h);\n }\n}","accuracy":1,"time_ms":510,"memory_kb":3684,"score_of_the_acc":-0.4244,"final_rank":13},{"submission_id":"aoj_2021_9253686","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define Rep(i,a,b) for(int i=a;i<b;i++)\n#define ALL(x) (x).begin(),(x).end()\n#define dbgv(x); for(auto now : x) cout << now << \" \"; cout << endl;\n\nstruct UnionFind {\n vector<int> par;\n UnionFind(int n=0): par(n,-1) {}\n int find(int x) {\n if(par[x] < 0) return x;\n return par[x] = find(par[x]);\n }\n bool unite(int x, int y){\n x = find(x); y = find(y);\n if(x==y) return false;\n if(par[x] > par[y]) swap(x,y);\n par[x] += par[y];\n par[y] = x;\n return true;\n }\n bool same(int x, int y) {return find(x) == find(y);}\n int size(int x) {return -par[find(x)];}\n};\n\nint main(){\n int n, m, l, k, a, h;\n while (1) {\n cin >> n >> m >> l >> k >> a >> h;\n if(n == 0) break;\n vector<vector<pair<int, int> > > g(n);\n vector<bool> heal(n);\n for (int i = 0; i < l; ++i) {\n int p;\n cin >> p;\n heal[p] = true;\n }\n for (int i = 0; i < k; ++i) {\n int u, v, c;\n cin >> u >> v >> c;\n g[u].emplace_back(v, c);\n g[v].emplace_back(u, c);\n }\n\n vector<vector<long long> > dist(n, vector<long long>(m + 1, 1LL<<60));\n priority_queue<tuple<long long, int, int>,vector<tuple<long long, int, int>>,greater<tuple<long long, int, int>>> pq;\n\n dist[a][m] = 0;\n pq.emplace(0, a, m);\n\n while (!pq.empty()) {\n auto [cd, cn, cl] = pq.top();\n pq.pop();\n if (dist[cn][cl] < cd) continue;\n if (heal[cn]) {\n for (int i = 1; cl + i <= m; ++i) {\n if (dist[cn][cl + i] > dist[cn][cl] + i) {\n dist[cn][cl + i] = dist[cn][cl] + i;\n pq.emplace(dist[cn][cl + i], cn, cl + i);\n }\n }\n }\n for (auto [nn, len] : g[cn]) {\n if (cl - len >= 0 && dist[nn][cl - len] > dist[cn][cl] + len) {\n dist[nn][cl - len] = dist[cn][cl] + len;\n pq.emplace(dist[nn][cl - len], nn, cl - len);\n }\n }\n }\n\n long long ans = *min_element(dist[h].begin(),dist[h].end());\n\n if (ans == (long long)1LL<<60) {\n cout << \"Help!\\n\";\n } else {\n cout << ans << '\\n';\n }\n }\n}","accuracy":1,"time_ms":420,"memory_kb":3704,"score_of_the_acc":-0.3373,"final_rank":11},{"submission_id":"aoj_2021_9214852","code_snippet":"#include <bits/stdc++.h>\n\nint solve() {\n int n, max_blood, cold_n, m, s, g;\n std::cin >> n >> max_blood >> cold_n >> m >> s >> g;\n if (n == 0) return 1;\n std::vector graph(n, std::vector<std::pair<int, int>>());\n std::vector<bool> is_cold(n);\n for (int i = 0; i < cold_n; i++) {\n int u;\n std::cin >> u;\n is_cold[u] = true;\n }\n for (int i = 0; i < m; i++) {\n int u, v, w;\n std::cin >> u >> v >> w;\n graph[u].emplace_back(v, w);\n graph[v].emplace_back(u, w);\n }\n\n const int INF = 1e9;\n using P = std::tuple<int, int, int>;\n std::priority_queue<P, std::vector<P>, std::greater<P>> que;\n std::vector dist(n, std::vector<int>(max_blood + 1, INF));\n dist[s][max_blood] = 0;\n que.emplace(dist[s][max_blood], s, max_blood);\n while (!que.empty()) {\n auto [d, u, i] = que.top();\n que.pop();\n if (dist[u][i] < d) continue;\n if (is_cold[u] && i < max_blood) {\n if (dist[u][i + 1] > dist[u][i] + 1) {\n dist[u][i + 1] = dist[u][i] + 1;\n que.emplace(dist[u][i + 1], u, i + 1);\n }\n }\n for (auto [v, w]: graph[u]) {\n if (i - w >= 0 && dist[v][i - w] > dist[u][i] + w) {\n dist[v][i - w] = dist[u][i] + w;\n que.emplace(dist[v][i - w], v, i - w);\n }\n }\n }\n int ans = INF;\n for (int i = 0; i <= max_blood; i++) {\n ans = std::min(ans, dist[g][i]);\n }\n if (ans == INF) {\n std::cout << \"Help!\" << '\\n';\n } else {\n std::cout << ans << '\\n';\n }\n return 0;\n}\n\nint main() {\n while (!solve());\n}","accuracy":1,"time_ms":310,"memory_kb":3596,"score_of_the_acc":-0.1935,"final_rank":2},{"submission_id":"aoj_2021_9158219","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;\ntemplate <typename T = int>\nstruct Edge {\n int from, to;\n T cost;\n int idx;\n Edge()\n : from(-1), to(-1), cost(-1), idx(-1) {}\n Edge(int from, int to, T cost = 1, int idx = -1)\n : from(from), to(to), cost(cost), idx(idx) {}\n operator int() const {\n return to;\n }\n};\ntemplate <typename T = int>\nstruct Graph {\n Graph(int N)\n : n(N), es(0), g(N) {}\n int size() const {\n return n;\n }\n int edge_size() const {\n return es;\n }\n void add_edge(int from, int to, T cost = 1) {\n assert(0 <= from and from < n);\n assert(0 <= to and to < n);\n g[from].emplace_back(from, to, cost, es);\n g[to].emplace_back(to, from, cost, es++);\n }\n void add_directed_edge(int from, int to, T cost = 1) {\n assert(0 <= from and from < n);\n assert(0 <= to and to < n);\n g[from].emplace_back(from, to, cost, es++);\n }\n inline vector<Edge<T>>& operator[](const int& k) {\n assert(0 <= k and k < n);\n return g[k];\n }\n inline const vector<Edge<T>>& operator[](const int& k) const {\n assert(0 <= k and k < n);\n return g[k];\n }\n\n private:\n int n, es;\n vector<vector<Edge<T>>> g;\n};\ntemplate <typename T = int>\nusing Edges = vector<Edge<T>>;\ntemplate <typename T>\nvector<pair<T, int>> dijkstra(const Graph<T>& g, const int s = 0) {\n int n = g.size();\n assert(0 <= s and s < n);\n vector<pair<T, int>> d(n, {numeric_limits<T>::max(), -1});\n priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> pq;\n d[s] = {0, -1};\n pq.push({0, s});\n while(!pq.empty()) {\n pair<T, int> p = pq.top();\n pq.pop();\n T dist = p.first;\n int cur = p.second;\n if(d[cur].first < dist) continue;\n for(const Edge<T>& edge : g[cur]) {\n if(d[edge.to].first > d[cur].first + edge.cost) {\n d[edge.to] = {d[cur].first + edge.cost, cur};\n pq.push({d[edge.to].first, edge.to});\n }\n }\n }\n return d;\n}\nint main(void) {\n while(1) {\n int n, m, l, k, a, h;\n cin >> n >> m >> l >> k >> a >> h;\n if(n == 0) break;\n Graph<int> g(n * (m + 1));\n rep(i, 0, l) {\n int x;\n cin >> x;\n rep(j, 0, m) {\n g.add_directed_edge(x * (m + 1) + j, x * (m + 1) + j + 1, 1);\n }\n }\n rep(i, 0, k) {\n int x, y, t;\n cin >> x >> y >> t;\n rep(j, 0, m + 1) {\n if(j - t < 0) continue;\n g.add_directed_edge(x * (m + 1) + j, y * (m + 1) + j - t, t);\n g.add_directed_edge(y * (m + 1) + j, x * (m + 1) + j - t, t);\n }\n }\n auto d = dijkstra(g, a * (m + 1) + m);\n int ans = 1e9;\n rep(i, 0, m + 1) {\n ans = min(ans, d[h * (m + 1) + i].first);\n }\n if(ans == 1e9) {\n cout << \"Help!\" << '\\n';\n } else {\n cout << ans << '\\n';\n }\n }\n}","accuracy":1,"time_ms":550,"memory_kb":6500,"score_of_the_acc":-1.2567,"final_rank":19},{"submission_id":"aoj_2021_8996546","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\ntuple<vl, vi> dijkstra(int s, int N, vv<pair<int, ll>> &g){\n using P = pair<ll, int>;\n vl dist(N, INF);\n vi bef(N);\n priority_queue<P, vc<P>, greater<P>> q;\n dist[s] = 0;\n q.push({0, s});\n while (!q.empty()){\n auto [c, now] = q.top();q.pop();\n if (dist[now] < c) continue;\n for (auto&& [nxt, nc]: g[now]) if (dist[nxt] > c + nc){\n dist[nxt] = c + nc;\n bef[nxt] = now;\n q.push({dist[nxt], nxt}); \n }\n }\n return {dist, bef};\n}\n\nll solve(int N, int M, int L, int K, int A, int H){\n vv<pair<int, ll>> g(N * (M + 1));\n rep(i, L){\n int v; cin >> v;\n rep(j, M) g[j * N + v].push_back({(j + 1) * N + v, 1});\n }\n rep(i, K){\n int x, y, t; cin >> x >> y >> t;\n rep(j, M + 1) if (j + t <= M){\n g[(j + t) * N + x].push_back({j * N + y, t});\n g[(j + t) * N + y].push_back({j * N + x, t});\n }\n }\n auto [dist, bef] = dijkstra(M * N + A, N * (M + 1), g);\n ll ans = INF;\n rep(j, M + 1) ans = min(dist[j * N + H], ans);\n return ans;\n}\n\nint main(){\n vc<ll> ans;\n while (true){\n int N, M, L, K, A, H; cin >> N >> M >> L >> K >> A >> H;\n if (N == 0) break;\n ans.push_back(solve(N, M, L, K, A, H));\n }\n for (auto x : ans){\n if (x == INF) cout << \"Help!\" << endl;\n else cout << x << endl;\n }\n}","accuracy":1,"time_ms":610,"memory_kb":6724,"score_of_the_acc":-1.3814,"final_rank":20},{"submission_id":"aoj_2021_8861238","code_snippet":"#include <bits/stdc++.h>\n#define r(i, n) for (int i = 0; i < n; i++)\n#define INF 1e9\nusing namespace std;\n\nint main() {\n int n, m, l, k, a, h, t1, t2, t3;\n\n while (cin >> n >> m >> l >> k >> a >> h, n) {\n vector<bool> rei(n, false);\n rei[a] = rei[h] = true;\n int b[n][n], re, x[n][n];\n r(i, n) r(j, n) x[i][j] = b[i][j] = INF;\n r(i, l) cin >> re, rei[re] = true;\n r(i, k) cin >> t1 >> t2 >> t3, b[t1][t2] = b[t2][t1] = t3;\n r(o, n) r(i, n) r(j, n) b[i][j] = min(b[i][j], b[i][o] + b[o][j]);\n r(i, n) if (rei[i]) r(j, n) if (rei[j]) if (b[i][j] <= m)\n x[i][j] = b[i][j];\n r(o, n) if (rei[o]) r(i, n) if (rei[i]) r(j, n) if (rei[j]) \n x[i][j] = min(x[i][j], x[i][o] + x[o][j]);\n if (x[a][h] >= INF)\n cout << \"Help!\" << endl;\n else if (x[a][h] < m)\n cout << x[a][h] << endl;\n else\n cout << x[a][h] * 2 - m << endl;\n }\n}","accuracy":1,"time_ms":680,"memory_kb":3164,"score_of_the_acc":-0.4536,"final_rank":15},{"submission_id":"aoj_2021_8861232","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\nusing namespace std;\n\n#define r(i, n) for (int i = 0; i < n; i++)\n#define INF 1000000000\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n\n int n, m, l, k, a, h, t1, t2, t3;\n while (cin >> n >> m >> l >> k >> a >> h, n) {\n vector<int> rei(n, 0);\n rei[a] = rei[h] = 1;\n int b[n][n], re, x[n][n];\n r(i, n) r(j, n) x[i][j] = b[i][j] = INF;\n r(i, l) cin >> re, rei[re] = 1;\n r(i, k) cin >> t1 >> t2 >> t3, b[t1][t2] = b[t2][t1] = t3;\n r(o, n) r(i, n) r(j, n) b[i][j] = min(b[i][j], b[i][o] + b[o][j]);\n r(i, n) if (rei[i]) r(j, n) if (rei[j]) if (b[i][j] <= m)\n x[i][j] = b[i][j];\n r(o, n) r(i, n) r(j, n) x[i][j] = min(x[i][j], x[i][o] + x[o][j]);\n if (x[a][h] >= INF)\n cout << \"Help!\" << \"\\n\";\n else if (x[a][h] < m)\n cout << x[a][h] << \"\\n\";\n else\n cout << x[a][h] * 2 - m << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":1210,"memory_kb":3212,"score_of_the_acc":-1.0135,"final_rank":18},{"submission_id":"aoj_2021_8215972","code_snippet":"#include <bits/stdc++.h>\n#define r(i, n) for (int i = 0; i < n; i++)\n#define INF 1e9\nusing namespace std;\nint main() {\n int n, m, l, k, a, h, t1, t2, t3;\n while (cin >> n >> m >> l >> k >> a >> h, n) {\n set<int> q;\n q.insert(a), q.insert(h);\n int b[n][n], e, x[n][n];\n r(i, n) r(j, n) x[i][j] = b[i][j] = INF;\n r(i, l) cin >> e, q.insert(e);\n r(i, k) cin >> t1 >> t2 >> t3, b[t1][t2] = b[t2][t1] = t3;\n r(o, n) r(i, n) r(j, n) b[i][j] = min(b[i][j], b[i][o] + b[o][j]);\n r(i, n) if (q.count(i)) r(j, n) if (q.count(j)) if (b[i][j] <= m) x[i][j] =\n b[i][j];\n r(o, n) r(i, n) r(j, n) x[i][j] = min(x[i][j], x[i][o] + x[o][j]);\n if (x[a][h] >= INF)\n cout << \"Help!\" << endl;\n else if (x[a][h] < m)\n cout << x[a][h] << endl;\n else\n cout << x[a][h] * 2 - m << endl;\n }\n}","accuracy":1,"time_ms":750,"memory_kb":3164,"score_of_the_acc":-0.5258,"final_rank":16}],"string":"[\n {\n \"submission_id\": \"aoj_2021_10617724\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n// #ifndef ONLINE_JUDGE\\n// #define _GLIBCXX_DEBUG // 配列外参照のエラー\\n// #endif\\n\\n// スタンダードライブラリ\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 型関連\\nusing ll = long long;\\nusing lint = long long;\\nusing pll = pair<ll, ll>;\\nusing plll = tuple<ll, ll, ll>;\\nusing pii = pair<int, int>;\\nusing piii = tuple<ll, ll, ll>;\\ntemplate <class T> using prique = priority_queue<T>;\\n\\n// 型定数\\nconstexpr ll mod = 998244353;\\nconstexpr ll MOD = 1000000007;\\nint INF32 = 2e9;\\nll INF64 = 9e18;\\n#define endl '\\\\n';\\n\\nint dx[4] = {1, 0, -1, 0};\\nint dy[4] = {0, 1, 0, -1};\\n\\n/////////////////////////// print関連\\ntemplate <typename T> void print(vector<T> A);\\nvoid print();\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail);\\nvoid print(string S);\\ntemplate <typename T> void print(vector<vector<T>> &F);\\n\\ninline void Yes(bool f);\\n\\n///////////////////ここから//////////////////////\\nbool solve() {\\n\\n int N, M, L, K, A, H;\\n cin >> N >> M >> L >> K >> A >> H;\\n if (N == 0) {\\n return false;\\n }\\n unordered_set<int> LS;\\n for (int i = 0; i < L; i++) {\\n int l;\\n cin >> l;\\n LS.insert(l);\\n }\\n vector<vector<pii>> G(N);\\n for (int i = 0; i < K; i++) {\\n int a, b, t;\\n cin >> a >> b >> t;\\n G[a].emplace_back(b, t);\\n G[b].emplace_back(a, t);\\n }\\n vector<vector<int>> dist(N, vector<int>(M + 1, INF32));\\n vector<vector<int>> f(N, vector<int>(M + 1, 0));\\n priority_queue<piii, vector<piii>, greater<piii>> que;\\n que.emplace(0, A, M);\\n dist[A][M] = 0;\\n while (!que.empty()) {\\n auto [d, v, m] = que.top();\\n que.pop();\\n if (f[v][m]) {\\n continue;\\n }\\n f[v][m] = 1;\\n \\n if (LS.count(v) && m < M) {\\n int nv = v, nm = m + 1;\\n if (dist[nv][nm] > dist[v][m] + 1) {\\n dist[nv][nm] = dist[v][m] + 1;\\n que.emplace(d+1,nv, nm);\\n }\\n }\\n for (auto [nv, t] : G[v]) {\\n if (t > m) {\\n continue;\\n }\\n int nm = m - t;\\n if (dist[nv][nm] > dist[v][m] + t) {\\n dist[nv][nm] = dist[v][m] + t;\\n que.emplace(d+t,nv, nm);\\n }\\n }\\n }\\n\\n int ans = INF32;\\n for (int m = 0; m <= M; m++) {\\n if (ans > dist[H][m]) {\\n ans = dist[H][m];\\n }\\n }\\n if (ans == INF32) {\\n print(\\\"Help!\\\");\\n } else {\\n print(ans);\\n }\\n\\n return true;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n while (solve())\\n ;\\n}\\n\\n////////////////////print/////////////////////////\\n// 1次元ベクトルを出力する\\ntemplate <typename T> void print(vector<T> A) {\\n if (A.size() == 0) {\\n return;\\n }\\n for (size_t i = 0; i < A.size() - 1; i++) {\\n cout << A[i] << ' ';\\n }\\n cout << A[A.size() - 1] << endl;\\n return;\\n}\\n\\n// 2次元ベクトルを出力する\\ntemplate <typename T> void print(vector<vector<T>> &F) {\\n for (size_t i = 0; i < F.size(); i++) {\\n for (size_t j = 0; j < F[i].size(); j++) {\\n cout << F[i][j];\\n if (j < F[i].size() - 1) {\\n cout << ' ';\\n }\\n }\\n cout << endl;\\n }\\n}\\n\\n// 空白行を出力するprint\\nvoid print() { cout << endl; }\\n\\n// 数値・文字列を空白区切りで出力する. print(a,b)など\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n cout << head;\\n if (sizeof...(tail) != 0)\\n cout << \\\" \\\";\\n print(forward<Tail>(tail)...);\\n}\\n\\nvoid print(string S) { cout << S << endl; }\\n\\n//////////////出力関連\\n\\ninline void Yes(bool f) {\\n if (f) {\\n cout << \\\"Yes\\\" << endl;\\n } else {\\n cout << \\\"No\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -0.2362,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2021_10600491\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nbool solve() {\\n int N, M, L, K, A, H;\\n cin >> N >> M >> L >> K >> A >> H;\\n if (N == 0 && M == 0 && L == 0 && K == 0 && A == 0 && H == 0) return false;\\n vector<bool> hos(N);\\n hos[A] = hos[H] = true;\\n for (int u; L--; ) {\\n cin >> u;\\n hos[u] = true;\\n }\\n vector<vector<pair<int, int>>> G(N);\\n for (int u, v, w; K--; ) {\\n cin >> u >> v >> w;\\n G[u].emplace_back(v, w);\\n G[v].emplace_back(u, w);\\n }\\n vector<vector<int>> D(N, vector<int>(M + 1, 1 << 30));\\n using T = tuple<int, int, int>;\\n priority_queue<T, vector<T>, greater<T>> q;\\n D[A][M] = 0;\\n q.emplace(0, A, M);\\n while (q.size()) {\\n auto [d, u, m] = q.top();\\n q.pop();\\n for (auto [v, w] : G[u]) {\\n if (m >= w && D[v][m - w] > d + w) {\\n D[v][m - w] = d + w;\\n q.emplace(d + w, v, m - w);\\n }\\n }\\n if (hos[u] && m < M && D[u][m + 1] > d + 1) {\\n D[u][m + 1] = d + 1;\\n q.emplace(d + 1, u, m + 1);\\n }\\n }\\n int ans = 1 << 30;\\n for (int m = 0; m <= M; m++) {\\n ans = min(ans, D[H][m]);\\n }\\n if (ans == 1 << 30) {\\n cout << \\\"Help!\\\\n\\\";\\n } else {\\n cout << ans << '\\\\n';\\n }\\n return true;\\n}\\n\\nint main() {\\n while (solve()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -0.2258,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2021_10558418\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nbool solve();\\nint main(){\\n while(solve());\\n return 0;\\n}\\n\\nusing pii = pair<int,int>;\\n\\nbool solve(){\\n int N, M, L, K, A, H;\\n cin>>N>>M>>L>>K>>A>>H;\\n if(N==0)return false;\\n vector<bool> have_frz(N,false);\\n for(int i=0;i<L;i++){\\n int l;cin>>l;\\n have_frz[l]=true;\\n }\\n vector<vector<pii>>G(N);\\n for(int i=0;i<K;i++){\\n int u,v,c;cin>>u>>v>>c;\\n if(c>M)continue;\\n G[u].push_back(pii(v,c));\\n G[v].push_back(pii(u,c));\\n }\\n const int inf=1e8;\\n vector dp(N,vector<int>(M+1,inf));\\n priority_queue<pair<int,pii>,vector<pair<int,pii>>,greater<pair<int,pii>>>q;\\n q.push(pair<int,pii>(0,pii(A,M)));\\n dp[A][M]=0;\\n while(!q.empty()){\\n int u=q.top().second.first;\\n int m=q.top().second.second;\\n q.pop();\\n for(auto [to,c]:G[u]){\\n int nm=m-c;\\n if(nm<0)continue;\\n if(dp[to][nm]>dp[u][m]+c){\\n dp[to][nm]=dp[u][m]+c;\\n q.push(pair<int,pii>(dp[to][nm],pii(to,m-c)));\\n }\\n }\\n if(have_frz[u])for(int i=1;;i++){\\n int nm=m+i;\\n if(nm>M)break;\\n if(dp[u][nm]>dp[u][m]+i){\\n dp[u][nm]=dp[u][m]+i;\\n q.push(pair<int,pii>(dp[u][nm],pii(u,nm)));\\n } \\n }\\n }\\n int ans=inf;\\n for(int i=0;i<=M;i++)ans=min(ans,dp[H][i]);\\n if(ans==inf){\\n cout<<\\\"Help!\\\"<<endl;\\n }else{\\n cout<<ans<<endl;\\n }\\n return true;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.2724,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2021_10485389\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nbool solve(){\\n int N, M, L, K, A, H; cin >> N >> M >> L >> K >> A >> H;\\n // cerr << \\\"# \\\" << N << \\\" \\\" << M << \\\" \\\" << L << \\\" \\\" << K << \\\" \\\" << A << \\\" \\\" << H << endl;\\n if(N == 0) return false;\\n auto V = [&](int n, int m) -> int {return n * (M + 1) + m;};\\n vector G(N * (M + 1), vector<pair<int, int>>{});\\n for(int i = 0; i < L; ++i){\\n int l; cin >> l;\\n for(int j = 0; j < M; ++j){\\n G[V(l, j)].emplace_back(V(l, j + 1), 1);\\n }\\n }\\n for(int i = 0; i < K; ++i){\\n int X, Y, T; cin >> X >> Y >> T;\\n for(int j = T; j <= M; ++j){\\n G[V(X, j)].emplace_back(V(Y, j - T), T);\\n G[V(Y, j)].emplace_back(V(X, j - T), T);\\n }\\n }\\n using P = pair<int, int>;\\n priority_queue<P, vector<P>, greater<P>> que;\\n int INF = 1 << 28;\\n vector dist(N * (M + 1), INF);\\n que.emplace(0, V(A, M));\\n dist[V(A, M)] = 0;\\n while(que.size()){\\n auto [d, u] = que.top(); que.pop();\\n if(dist[u] != d) continue;\\n for(auto [v, c] : G[u]){\\n if(d + c < dist[v]){\\n // cerr << \\\"# \\\" << u << \\\" -> \\\" << v << \\\" : \\\" << c << endl;\\n dist[v] = d + c;\\n que.emplace(d + c, v);\\n }\\n }\\n }\\n // for(int i = 0; i < N; ++i){\\n // cerr << \\\"#\\\";\\n // for(int j = 0; j <= M; ++j){\\n // cerr << \\\" \\\" << dist[V(i, j)];\\n // }\\n // cerr << endl;\\n // }\\n int ans = INF;\\n for(int j = 0; j <= M; ++j){\\n ans = min(ans, dist[V(H, j)]);\\n }\\n if(ans == INF) cout << \\\"Help!\\\" << endl;\\n else cout << ans << endl;\\n return true;\\n}\\n\\nint main(){\\n while(1){\\n if(!solve()) break;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 520,\n \"memory_kb\": 5356,\n \"score_of_the_acc\": -0.9044,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2021_10451570\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing edge = pair<int, ll>; // {to, w}\\n\\nconstexpr bool DEBUG = false;\\nconstexpr ll INF = 2e18;\\n\\nll solve(int N, int M, int L, int K, int S, int G) {\\n vector<bool> frz(N, false);\\n for (int i = 0; i < L; i++) {\\n int u;\\n cin >> u;\\n frz[u] = true;\\n }\\n frz[S] = true;\\n frz[G] = true;\\n\\n vector<vector<edge>> graph(N);\\n for (int i = 0; i < K; i++) {\\n int u, v, t;\\n cin >> u >> v >> t;\\n graph[u].emplace_back(v, t);\\n graph[v].emplace_back(u, t);\\n }\\n\\n vector<vector<ll>> dist(N, vector<ll>(M + 1, INF));\\n priority_queue<tuple<ll, int, int>, vector<tuple<ll, int, int>>, greater<>> pq; // {cost, from, rem}\\n dist[S][M] = 0;\\n pq.emplace(0, S, M);\\n while (!pq.empty()) {\\n auto [cost, from, rem] = pq.top();\\n pq.pop();\\n if (cost > dist[from][rem]) {\\n continue;\\n }\\n\\n for (auto [to, w] : graph[from]) {\\n ll next_rem = rem - w;\\n ll next_cost = cost + w;\\n\\n if (rem < w) {\\n continue;\\n }\\n\\n if (dist[to][next_rem] > next_cost) {\\n dist[to][next_rem] = next_cost;\\n pq.emplace(next_cost, to, next_rem);\\n }\\n }\\n\\n if (frz[from] && rem < M) {\\n int to = from;\\n ll next_cost = cost + 1;\\n ll next_rem = rem + 1;\\n if (dist[to][next_rem] > next_cost) {\\n pq.emplace(next_cost, to, next_rem);\\n }\\n }\\n }\\n\\n ll ans = INF;\\n for (int rem = 0; rem <= M; rem++) {\\n ans = min(ans, dist[G][rem]);\\n }\\n return ans;\\n}\\n\\nint main() {\\n while (true) {\\n int N, M, L, K, A, H;\\n cin >> N >> M >> L >> K >> A >> H;\\n if (N == 0) {\\n break;\\n }\\n ll ans = solve(N, M, L, K, A, H);\\n if (ans == INF) {\\n cout << \\\"Help!\\\" << endl;\\n } else {\\n cout << ans << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.3239,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2021_10450960\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing edge = pair<int, ll>; // {to, w}\\n\\nconstexpr bool DEBUG = false;\\nconstexpr ll INF = 2e18;\\n\\nll solve(int N, int M, int L, int K, int S, int G) {\\n vector<bool> has_freeze(N, false);\\n for (int i = 0; i < L; i++) {\\n int u;\\n cin >> u;\\n has_freeze[u] = true;\\n }\\n has_freeze[S] = true;\\n has_freeze[G] = true;\\n\\n vector<vector<edge>> graph(N);\\n for (int i = 0; i < K; i++) {\\n int u, v, t;\\n cin >> u >> v >> t;\\n graph[u].emplace_back(v, t);\\n graph[v].emplace_back(u, t);\\n }\\n\\n vector<vector<ll>> dist(N, vector<ll>(M + 1, INF));\\n priority_queue<tuple<ll, int, int>, vector<tuple<ll, int, int>>, greater<>> pq; // {cost, from, rem}\\n dist[S][M] = 0;\\n pq.emplace(0, S, M);\\n while (!pq.empty()) {\\n auto [cost, from, rem] = pq.top();\\n pq.pop();\\n if (cost > dist[from][rem]) {\\n continue;\\n }\\n\\n for (auto [to, w] : graph[from]) {\\n ll next_rem = rem - w;\\n ll next_cost = cost + w;\\n\\n if (rem < w) {\\n continue;\\n }\\n\\n if (dist[to][next_rem] > next_cost) {\\n dist[to][next_rem] = next_cost;\\n pq.emplace(next_cost, to, next_rem);\\n }\\n }\\n\\n if (has_freeze[from] && rem < M) {\\n int to = from;\\n ll next_cost = cost + 1;\\n ll next_rem = rem + 1;\\n if (dist[to][next_rem] > next_cost) {\\n pq.emplace(next_cost, to, next_rem);\\n }\\n }\\n }\\n\\n ll ans = INF;\\n for (int rem = 0; rem <= M; rem++) {\\n ans = min(ans, dist[G][rem]);\\n }\\n return ans;\\n}\\n\\nint main() {\\n while (true) {\\n int N, M, L, K, A, H;\\n cin >> N >> M >> L >> K >> A >> H;\\n if (N == 0) {\\n break;\\n }\\n ll ans = solve(N, M, L, K, A, H);\\n if (ans == INF) {\\n cout << \\\"Help!\\\" << endl;\\n } else {\\n cout << ans << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -0.3599,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2021_10450923\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst ll INF = LLONG_MAX / 4;\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n while (true) {\\n int N, M, L, K, A, H;\\n cin >> N >> M >> L >> K >> A >> H;\\n // 全てが0なら入力終了\\n if (!cin || (N == 0 && M == 0 && L == 0 && K == 0 && A == 0 && H == 0))\\n break;\\n\\n // 冷凍施設の有無を管理 (町ごと)\\n vector<bool> has_freeze(N, false);\\n for (int i = 0; i < L; i++) {\\n int x; cin >> x;\\n has_freeze[x] = true;\\n }\\n // 首都(A)と病院(H)も冷凍施設があるとみなす\\n has_freeze[A] = has_freeze[H] = true;\\n\\n // グラフの隣接リスト (町uから町vへ移動時間t)\\n vector<vector<pair<int,int>>> graph(N);\\n for (int i = 0; i < K; i++) {\\n int u, v, t;\\n cin >> u >> v >> t;\\n graph[u].emplace_back(v, t);\\n graph[v].emplace_back(u, t);\\n }\\n\\n // dist[u][r] = 残り鮮度r分で町uに到達するための最小時間\\n vector<vector<ll>> dist(N, vector<ll>(M + 1, INF));\\n // 優先度付きキュー (最小時間優先): (time, node, remaining)\\n using T = tuple<ll,int,int>;\\n priority_queue<T, vector<T>, greater<T>> pq;\\n dist[A][M] = 0; // 首都出発時は鮮度M分\\n pq.emplace(0, A, M);\\n\\n // Dijkstra 法\\n while (!pq.empty()) {\\n auto [t, u, rem] = pq.top();\\n pq.pop();\\n if (t > dist[u][rem]) continue;\\n\\n // 1) 道路を移動する遷移\\n for (auto &e : graph[u]) {\\n int v = e.first;\\n int cost = e.second;\\n if (rem >= cost) {\\n int next_rem = rem - cost;\\n ll nt = t + cost;\\n if (nt < dist[v][next_rem]) {\\n dist[v][next_rem] = nt;\\n pq.emplace(nt, v, next_rem);\\n }\\n }\\n }\\n // 2) 再冷凍する遷移 (冷凍施設があり、残り鮮度 < M の場合)\\n if (has_freeze[u] && rem < M) {\\n int next_rem = rem + 1;\\n ll nt = t + 1;\\n if (nt < dist[u][next_rem]) {\\n dist[u][next_rem] = nt;\\n pq.emplace(nt, u, next_rem);\\n }\\n }\\n }\\n\\n // 病院(H)への到達時間の最小値を求める\\n ll ans = INF;\\n for (int rem = 0; rem <= M; rem++) {\\n ans = min(ans, dist[H][rem]);\\n }\\n if (ans == INF) {\\n cout << \\\"Help!\\\" << '\\\\n';\\n } else {\\n cout << ans << '\\\\n';\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -0.2258,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2021_10450916\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst ll INF = LLONG_MAX / 4;\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n while (true) {\\n int N, M, L, K, A, H;\\n cin >> N >> M >> L >> K >> A >> H;\\n if (!cin || (N == 0 && M == 0 && L == 0 && K == 0 && A == 0 && H == 0))\\n break;\\n\\n vector<bool> has_freeze(N, false);\\n for (int i = 0; i < L; i++) {\\n int x; cin >> x;\\n has_freeze[x] = true;\\n }\\n has_freeze[A] = has_freeze[H] = true;\\n\\n vector<vector<pair<int,int>>> graph(N);\\n for (int i = 0; i < K; i++) {\\n int u, v, t;\\n cin >> u >> v >> t;\\n graph[u].emplace_back(v, t);\\n graph[v].emplace_back(u, t);\\n }\\n\\n vector<vector<ll>> dist(N, vector<ll>(M + 1, INF));\\n using T = tuple<ll,int,int>;\\n priority_queue<T, vector<T>, greater<T>> pq;\\n dist[A][M] = 0;\\n pq.emplace(0, A, M);\\n\\n while (!pq.empty()) {\\n auto [t, u, rem] = pq.top();\\n pq.pop();\\n if (t > dist[u][rem]) continue;\\n for (auto &e : graph[u]) {\\n int v = e.first;\\n int cost = e.second;\\n if (rem >= cost) {\\n int next_rem = rem - cost;\\n ll nt = t + cost;\\n if (nt < dist[v][next_rem]) {\\n dist[v][next_rem] = nt;\\n pq.emplace(nt, v, next_rem);\\n }\\n }\\n }\\n if (has_freeze[u] && rem < M) {\\n int next_rem = rem + 1;\\n ll nt = t + 1;\\n if (nt < dist[u][next_rem]) {\\n dist[u][next_rem] = nt;\\n pq.emplace(nt, u, next_rem);\\n }\\n }\\n }\\n\\n ll ans = INF;\\n for (int rem = 0; rem <= M; rem++) {\\n ans = min(ans, dist[H][rem]);\\n }\\n if (ans == INF) {\\n cout << \\\"Help!\\\" << '\\\\n';\\n } else {\\n cout << ans << '\\\\n';\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -0.2258,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2021_9591889\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n using namespace std;\\n #include <ext/pb_ds/assoc_container.hpp>\\n using namespace __gnu_pbds;\\n \\n template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\n template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n #define rep(i,n) for (int i = 0; i < (n); ++i)\\n\\n typedef long long ll;\\n typedef unsigned long long ull;\\n typedef long double ld;\\n using P=pair<int,int>;\\n using T=tuple<int,int,int>;\\n const ll INF=1001001001; \\n const ll INFL=1e18;\\n const ll mod=998244353;\\n\\n\\n void solve(int n,int m,int l,int k,int a,int h){\\n vector<int>frozen(n);\\n rep(i,l){\\n int p;\\n cin>>p;\\n frozen[p]=1;\\n }\\n vector<vector<P>>G(n);\\n rep(i,k){\\n int u,v,d;\\n cin>>u>>v>>d;\\n G[u].emplace_back(v,d);\\n G[v].emplace_back(u,d);\\n }\\n vector<vector<int>>dist(n,vector<int>(m+1,INF));\\n priority_queue<T,vector<T>,greater<T>>q;\\n q.push(make_tuple(0,a,m));\\n dist[a][m]=0;\\n while(q.size()){\\n auto[d,v,M]=q.top();q.pop();\\n if(d>dist[v][M])continue;\\n for(auto[u,nd]:G[v]){\\n if(M-nd<0)continue;\\n if(chmin(dist[u][M-nd],dist[v][M]+nd)){\\n q.push(make_tuple(dist[u][M-nd],u,M-nd));\\n }\\n }\\n if(frozen[v]){\\n for(int i=M+1;i<=m;i++){\\n if(chmin(dist[v][i],dist[v][M]+(i-M))){\\n q.push(make_tuple(dist[v][i],v,i));\\n }\\n }\\n }\\n }\\n int ans=INF;\\n rep(i,m+1){\\n chmin(ans,dist[h][i]);\\n }\\n if(ans==INF){\\n cout<<\\\"Help!\\\"<<endl;\\n }else{\\n cout<<ans<<endl;\\n }\\n }\\n\\n int main(){\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n \\n while(1){\\n int n,m,l,k,a,h;\\n cin>>n>>m>>l>>k>>a>>h;\\n if(n==0&&m==0&&l==0&&k==0&&a==0&&h==0){\\n break;\\n }\\n solve(n,m,l,k,a,h);\\n }\\n return 0;\\n }\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -0.2877,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2021_9456316\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n#include <unistd.h>\\n\\nnamespace fastio {\\nstatic constexpr uint32_t SZ = 1 << 17;\\nchar ibuf[SZ];\\nchar obuf[SZ];\\nchar out[100];\\n// pointer of ibuf, obuf\\n\\n\\nuint32_t pil = 0, pir = 0, por = 0;\\n\\nstruct Pre {\\n char num[10000][4];\\n constexpr Pre() : num() {\\n for (int i = 0; i < 10000; i++) {\\n int n = i;\\n for (int j = 3; j >= 0; j--) {\\n num[i][j] = n % 10 | '0';\\n n /= 10;\\n }\\n }\\n }\\n} constexpr pre;\\n\\ninline void load() {\\n memmove(ibuf, ibuf + pil, pir - pil);\\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\\n pil = 0;\\n if (pir < SZ)\\n ibuf[pir++] = '\\\\n';\\n}\\n\\ninline void flush() {\\n fwrite(obuf, 1, por, stdout);\\n por = 0;\\n}\\n\\nvoid rd(char &c) {\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n}\\n\\nvoid rd(string &x) {\\n x.clear();\\n char c;\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n do {\\n x += c;\\n if (pil == pir)\\n load();\\n c = ibuf[pil++];\\n } while (!isspace(c));\\n}\\n\\ntemplate <typename T> void rd_real(T &x) {\\n string s;\\n rd(s);\\n x = stod(s);\\n}\\n\\ntemplate <typename T> void rd_integer(T &x) {\\n if (pil + 100 > pir)\\n load();\\n char c;\\n do\\n c = ibuf[pil++];\\n while (c < '-');\\n bool minus = 0;\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (c == '-') {\\n minus = 1, c = ibuf[pil++];\\n }\\n }\\n x = 0;\\n while ('0' <= c) {\\n x = x * 10 + (c & 15), c = ibuf[pil++];\\n }\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (minus)\\n x = -x;\\n }\\n}\\n\\nvoid rd(int &x) {\\n rd_integer(x);\\n}\\nvoid rd(ll &x) {\\n rd_integer(x);\\n}\\nvoid rd(i128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(uint &x) {\\n rd_integer(x);\\n}\\nvoid rd(ull &x) {\\n rd_integer(x);\\n}\\nvoid rd(u128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(double &x) {\\n rd_real(x);\\n}\\nvoid rd(long double &x) {\\n rd_real(x);\\n}\\n\\ntemplate <class T, class U> void rd(pair<T, U> &p) {\\n return rd(p.first), rd(p.second);\\n}\\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n auto &x = std::get<N>(t);\\n rd(x);\\n rd_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void rd(tuple<T...> &tpl) {\\n rd_tuple(tpl);\\n}\\n\\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\ntemplate <class T> void rd(vector<T> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\n\\nvoid read() {}\\ntemplate <class H, class... T> void read(H &h, T &...t) {\\n rd(h), read(t...);\\n}\\n\\nvoid wt(const char c) {\\n if (por == SZ)\\n flush();\\n obuf[por++] = c;\\n}\\nvoid wt(const string s) {\\n for (char c : s)\\n wt(c);\\n}\\nvoid wt(const char *s) {\\n size_t len = strlen(s);\\n for (size_t i = 0; i < len; i++)\\n wt(s[i]);\\n}\\n\\ntemplate <typename T> void wt_integer(T x) {\\n if (por > SZ - 100)\\n flush();\\n if (x < 0) {\\n obuf[por++] = '-', x = -x;\\n }\\n int outi;\\n for (outi = 96; x >= 10000; outi -= 4) {\\n memcpy(out + outi, pre.num[x % 10000], 4);\\n x /= 10000;\\n }\\n if (x >= 1000) {\\n memcpy(obuf + por, pre.num[x], 4);\\n por += 4;\\n } else if (x >= 100) {\\n memcpy(obuf + por, pre.num[x] + 1, 3);\\n por += 3;\\n } else if (x >= 10) {\\n int q = (x * 103) >> 10;\\n obuf[por] = q | '0';\\n obuf[por + 1] = (x - q * 10) | '0';\\n por += 2;\\n } else\\n obuf[por++] = x | '0';\\n memcpy(obuf + por, out + outi + 4, 96 - outi);\\n por += 96 - outi;\\n}\\n\\ntemplate <typename T> void wt_real(T x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << double(x);\\n string s = oss.str();\\n wt(s);\\n}\\n\\nvoid wt(int x) {\\n wt_integer(x);\\n}\\nvoid wt(ll x) {\\n wt_integer(x);\\n}\\nvoid wt(i128 x) {\\n wt_integer(x);\\n}\\nvoid wt(uint x) {\\n wt_integer(x);\\n}\\nvoid wt(ull x) {\\n wt_integer(x);\\n}\\nvoid wt(u128 x) {\\n wt_integer(x);\\n}\\nvoid wt(double x) {\\n wt_real(x);\\n}\\nvoid wt(long double x) {\\n wt_real(x);\\n}\\n\\ntemplate <class T, class U> void wt(const pair<T, U> val) {\\n wt(val.first);\\n wt(' ');\\n wt(val.second);\\n}\\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n if constexpr (N > 0) {\\n wt(' ');\\n }\\n const auto x = std::get<N>(t);\\n wt(x);\\n wt_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void wt(tuple<T...> tpl) {\\n wt_tuple(tpl);\\n}\\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\ntemplate <class T> void wt(const vector<T> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\n\\nvoid print() {\\n wt('\\\\n');\\n}\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n wt(head);\\n if (sizeof...(Tail))\\n wt(' ');\\n print(forward<Tail>(tail)...);\\n}\\nvoid __attribute__((destructor)) _d() {\\n flush();\\n}\\n} // namespace fastio\\n\\n\\nusing fastio::flush;\\nusing fastio::print;\\nusing fastio::read;\\n\\ninline void first(bool i = true) {\\n print(i ? \\\"first\\\" : \\\"second\\\");\\n}\\ninline void Alice(bool i = true) {\\n print(i ? \\\"Alice\\\" : \\\"Bob\\\");\\n}\\ninline void Takahashi(bool i = true) {\\n print(i ? \\\"Takahashi\\\" : \\\"Aoki\\\");\\n}\\ninline void yes(bool i = true) {\\n print(i ? \\\"yes\\\" : \\\"no\\\");\\n}\\ninline void Yes(bool i = true) {\\n print(i ? \\\"Yes\\\" : \\\"No\\\");\\n}\\ninline void No() {\\n print(\\\"No\\\");\\n}\\ninline void YES(bool i = true) {\\n print(i ? \\\"YES\\\" : \\\"NO\\\");\\n}\\ninline void NO() {\\n print(\\\"NO\\\");\\n}\\ninline void Yay(bool i = true) {\\n print(i ? \\\"Yay!\\\" : \\\":(\\\");\\n}\\ninline void Possible(bool i = true) {\\n print(i ? \\\"Possible\\\" : \\\"Impossible\\\");\\n}\\ninline void POSSIBLE(bool i = true) {\\n print(i ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\");\\n}\\n\\n/**\\n * @brief Fast IO\\n */\\n\\nint main() {\\nwhile(1) {\\n int N, M, L, K, S, G;\\n cin >> N >> M >> L >> K >> S >> G;\\n if (N == 0) return 0;\\n vector<int> X;\\n X.push_back(S), X.push_back(G);\\n rep(i,0,L) {\\n int _;\\n cin >> _;\\n X.push_back(_);\\n }\\n L += 2;\\n vector<vector<int>> D1(N,vector<int>(N,inf));\\n rep(i,0,N) D1[i][i] = 0;\\n rep(i,0,K) {\\n int s, t, c;\\n cin >> s >> t >> c;\\n chmin(D1[s][t], c);\\n chmin(D1[t][s], c);\\n }\\n rep(k,0,N) {\\n rep(i,0,N) {\\n rep(j,0,N) {\\n chmin(D1[i][j], D1[i][k] + D1[k][j]);\\n }\\n }\\n }\\n vector<vector<int>> D2(L,vector<int>(L,inf));\\n rep(i,0,L) {\\n rep(j,0,L) {\\n if (D1[X[i]][X[j]] <= M) chmin(D2[i][j], D1[X[i]][X[j]]);\\n }\\n }\\n rep(k,0,L) {\\n rep(i,0,L) {\\n rep(j,0,L) {\\n chmin(D2[i][j], D2[i][k] + D2[k][j]);\\n }\\n }\\n }\\n if (D2[0][1] == inf) cout << \\\"Help!\\\" << endl;\\n else cout << D2[0][1] + max(0,D2[0][1] - M) << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 530,\n \"memory_kb\": 3620,\n \"score_of_the_acc\": -0.4271,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2021_9403083\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#ifdef LOCAL\\n#include \\\"./debug.hpp\\\"\\n#else\\n#define debug(...)\\n#define print_line\\n#endif\\n\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vl = vector<ll>;\\nusing pi = pair<int,int>;\\nusing pl = pair<ll,ll>;\\nconst int INF = 1e9 + 10;\\nconst ll INFL = 4e18;\\n#define rep(i, a, b) for (ll i = (a); i < (ll)(b); i++)\\n#define all(x) x.begin(),x.end()\\n\\ntemplate <typename T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }\\ntemplate <typename T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }\\n\\n// --------------------------------------------------------\\n\\nint D[101][101];\\n\\nint main(){\\n\\twhile(true){\\n\\t\\tint N,M,L,K,A,H;cin>>N>>M>>L>>K>>A>>H;\\n\\t\\tif(N==0)break;\\n\\t\\tfor(int i=0;i<N;i++)for(int j=0;j<=M;j++)D[i][j]=INF;\\n\\t\\tvector<bool>cool(N,false);\\n\\t\\tfor(int i=0;i<L;i++){\\n\\t\\t\\tint l;cin>>l;\\n\\t\\t\\tcool[l]=true;\\n\\t\\t}\\n\\t\\tcool[A]=true;\\n\\t\\tcool[H]=true;\\n\\t\\tvector<vector<pair<int,int>>>G(N);\\n\\t\\tfor(int i=0;i<K;i++){\\n\\t\\t\\tint X,Y,T;cin>>X>>Y>>T;\\n\\t\\t\\tif(T>M)continue;\\n\\t\\t\\tG[X].push_back({Y,T});\\n\\t\\t\\tG[Y].push_back({X,T});\\n\\t\\t}\\n\\n\\t\\tD[A][M]=0;\\n\\t\\tusing T=tuple<int,int,int>;\\n\\t\\tpriority_queue<T,vector<T>,greater<>>pq;\\n\\t\\tpq.push({0,A,M});\\n\\t\\twhile(!pq.empty()){\\n\\t\\t\\tauto[time,now,rem]=pq.top();pq.pop();\\n\\t\\t\\tfor(auto[nxt,cost]:G[now]){\\n\\t\\t\\t\\tif(rem-cost>=0&&D[nxt][rem-cost]>time+cost){\\n\\t\\t\\t\\t\\tD[nxt][rem-cost]=time+cost;\\n\\t\\t\\t\\t\\tpq.push({time+cost,nxt,rem-cost});\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(cool[now]&&rem+1<=M&&D[now][rem+1]>time+1){\\n\\t\\t\\t\\tD[now][rem+1]=time+1;\\n\\t\\t\\t\\tpq.push({time+1,now,rem+1});\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tint ans=INF;\\n\\t\\tfor(int i=0;i<=M;i++)ans=min(ans,D[H][i]);\\n\\n\\t\\tif(ans==INF)cout<<\\\"Help!\\\"<<endl;\\n\\t\\telse cout<<ans<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.1328,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2021_9370417\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define all(x) (x).begin(),(x).end()\\n#define eb emplace_back\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing vl = vector<long long>;\\nusing vvl = vector<vector<long long>>; using vs = vector<string>;\\nusing pl = pair<long long, long long>;\\ntemplate <typename T> inline bool chmin(T& a, const T& b) {bool compare = a > b; if (a > b) a = b; return compare;}\\ntemplate <typename T> inline bool chmax(T& a, const T& b) {bool compare = a < b; if (a < b) a = b; return compare;}\\ntemplate<class T>using rp_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate <typename T> T gcd(T a, T b) {if (b == 0)return a; else return gcd(b, a % b);}\\ntemplate <typename T> inline T lcm(T a, T b) {return a /gcd(a, b)*b;}\\nconst ll INF = 1LL << 60;\\nconst ld PI = acos(-1);\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);\\ntemplate <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);\\ntemplate <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);\\ntemplate <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);\\ntemplate <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);\\ntemplate <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);\\ntemplate <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);\\ntemplate <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);\\n \\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }\\ntemplate <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }\\ntemplate <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }\\ntemplate <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }\\ntemplate <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << \\\"deq[\\\"; for (auto v : vec) os << v << ','; os << ']'; return os; }\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }\\ntemplate <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << \\\"=>\\\" << v.second << ','; os << '}'; return os; }\\ntemplate <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << \\\"=>\\\" << v.second << ','; os << '}'; return os; }\\n#ifdef LOCAL\\nconst string COLOR_RESET = \\\"\\\\033[0m\\\", BRIGHT_GREEN = \\\"\\\\033[1;32m\\\", BRIGHT_RED = \\\"\\\\033[1;31m\\\", BRIGHT_CYAN = \\\"\\\\033[1;36m\\\", NORMAL_CROSSED = \\\"\\\\033[0;9;37m\\\", RED_BACKGROUND = \\\"\\\\033[1;41m\\\", NORMAL_FAINT = \\\"\\\\033[0;2m\\\";\\n#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << \\\" = \\\" << (x) << NORMAL_FAINT << \\\" (L\\\" << __LINE__ << \\\") \\\" << __FILE__ << COLOR_RESET << std::endl\\n#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << \\\" = \\\" << (x) << NORMAL_FAINT << \\\" (L\\\" << __LINE__ << \\\") \\\" << __FILE__ << COLOR_RESET << std::endl : std::cerr)\\n#else\\n#define dbg(x) ((void)0)\\n#define dbgif(cond, x) ((void)0)\\n#endif\\nvoid solve();\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout<<fixed<<setprecision(15);\\n int num_tc = 1;\\n //cin >> num_tc;\\n rep(tc,num_tc){\\n //cout << \\\"Case #\\\" << tc+1 << \\\": \\\" ;// << endl;\\n solve();\\n }\\n}\\n//見切り発車で実装しては行けない．頭の中でコードが完全に出来上がるまで書き始めるな．\\nvoid solve(){\\n while(true){\\n ll N,M,L,K,A,H;\\n cin>>N>>M>>L>>K>>A>>H;\\n if(N==0&&M==0&&L==0&&K==0&&A==0&&H==0)return;\\n set<ll> st;\\n rep(i,L){\\n ll r;cin>>r;\\n st.insert(r);\\n }\\n vector<vector<pl>> G(N);\\n rep(i,K){\\n ll x,y,t;cin>>x>>y>>t;\\n G[x].push_back({y,t});\\n G[y].push_back({x,t});\\n }\\n //頑張ってダイクストラ\\n //dist[i][残り時間] = 最小コスト\\n vvl dist(N,vl(M+1,INF));\\n dist[A][M]=0;\\n //最短経路,場所,残りのうけつ\\n rp_queue<tuple<ll,ll,ll>> que;\\n que.push({0,A,M});\\n while(!que.empty()){\\n auto [d,a,m] = que.top();\\n que.pop();\\n //すでに最短経路があればいらない\\n if(d>dist[a][m])continue;\\n //再度輸血する\\n if(st.count(a)&&m+1<=M&&chmin(dist[a][m+1],dist[a][m]+1)){\\n que.push({dist[a][m+1],a,m+1});\\n }\\n for(auto [v,t]:G[a]){\\n if(m-t>=0&&chmin(dist[v][m-t],dist[a][m]+t)){\\n que.push({dist[v][m-t],v,m-t});\\n }\\n }\\n }\\n ll ans = INF;\\n for(int j=0;j<=M;j++)chmin(ans,dist[H][j]);\\n if(ans==INF)cout<<\\\"Help!\\\"<<endl;\\n else cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 3712,\n \"score_of_the_acc\": -0.2776,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2021_9258353\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define ll long long \\n#define rep(i,n) for(ll i = 0;i < (ll)(n);i++)\\nconst ll INF = 1LL << 60;\\n\\nvoid chmin(ll &a,ll b){\\n if(a > b){\\n a = b;\\n }\\n}\\n\\n\\nll warshal(vector<vector<ll>> &dist){\\n ll siz =dist.size();\\n rep(k,siz)rep(i,siz)rep(j,siz){\\n if(i == j){\\n chmin(dist[i][j],0LL);\\n }\\n if(dist[i][k] != INF && dist[k][j] != INF){\\n chmin(dist[i][j],dist[i][k] + dist[k][j]);\\n }\\n }\\n rep(i,siz){\\n if(dist[i][i] < 0){\\n return -1;\\n }\\n }\\n return 1;\\n}\\n\\nvoid solve(ll n,ll m,ll l,ll k,ll a,ll h){\\n vector<ll> f(l);\\n rep(i,l){\\n cin >> f[i];\\n }\\n f.push_back(a);\\n f.push_back(h);\\n vector<vector<ll>> g(n,vector<ll>(n,INF));\\n rep(i,k){\\n ll x,y,c;\\n cin >> x>> y >> c;\\n g[x][y] = c;\\n g[y][x] = c;\\n }\\n\\n warshal(g);\\n\\n vector<vector<pair<ll,ll>>> gg(n);\\n for(auto & p:f){\\n for(auto & q:f){\\n if(p == q)continue;\\n if(g[p][q] < INF){\\n gg[p].push_back({q,g[p][q]});\\n }\\n }\\n }\\n \\n\\n vector<ll> dist(n,INF);\\n queue<ll> que;\\n dist[a] = 0;\\n que.push(a);\\n while(!que.empty()){\\n ll now = que.front();\\n que.pop();\\n for(auto [i,cost]:gg[now]){\\n\\n if(cost <= m && dist[now] + cost < dist[i]){\\n dist[i] = dist[now] + cost;\\n que.push(i);\\n }\\n }\\n }\\n if(dist[h] == INF){\\n cout << \\\"Help!\\\" << endl;\\n }else{\\n if(dist[h] <= m){\\n cout << dist[h] << endl;\\n }else{\\n cout << dist[h] + (dist[h] - m) << endl;\\n }\\n }\\n\\n}\\n\\nint main(){\\n while(true){\\n ll n,m,l,k,a,h;\\n cin >> n >> m >> l >> k >> a >> h;\\n if(n + m + l + k + a + h == 0)break;\\n solve(n,m,l,k,a,h);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 510,\n \"memory_kb\": 3684,\n \"score_of_the_acc\": -0.4244,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2021_9253686\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define Rep(i,a,b) for(int i=a;i<b;i++)\\n#define ALL(x) (x).begin(),(x).end()\\n#define dbgv(x); for(auto now : x) cout << now << \\\" \\\"; cout << endl;\\n\\nstruct UnionFind {\\n vector<int> par;\\n UnionFind(int n=0): par(n,-1) {}\\n int find(int x) {\\n if(par[x] < 0) return x;\\n return par[x] = find(par[x]);\\n }\\n bool unite(int x, int y){\\n x = find(x); y = find(y);\\n if(x==y) return false;\\n if(par[x] > par[y]) swap(x,y);\\n par[x] += par[y];\\n par[y] = x;\\n return true;\\n }\\n bool same(int x, int y) {return find(x) == find(y);}\\n int size(int x) {return -par[find(x)];}\\n};\\n\\nint main(){\\n int n, m, l, k, a, h;\\n while (1) {\\n cin >> n >> m >> l >> k >> a >> h;\\n if(n == 0) break;\\n vector<vector<pair<int, int> > > g(n);\\n vector<bool> heal(n);\\n for (int i = 0; i < l; ++i) {\\n int p;\\n cin >> p;\\n heal[p] = true;\\n }\\n for (int i = 0; i < k; ++i) {\\n int u, v, c;\\n cin >> u >> v >> c;\\n g[u].emplace_back(v, c);\\n g[v].emplace_back(u, c);\\n }\\n\\n vector<vector<long long> > dist(n, vector<long long>(m + 1, 1LL<<60));\\n priority_queue<tuple<long long, int, int>,vector<tuple<long long, int, int>>,greater<tuple<long long, int, int>>> pq;\\n\\n dist[a][m] = 0;\\n pq.emplace(0, a, m);\\n\\n while (!pq.empty()) {\\n auto [cd, cn, cl] = pq.top();\\n pq.pop();\\n if (dist[cn][cl] < cd) continue;\\n if (heal[cn]) {\\n for (int i = 1; cl + i <= m; ++i) {\\n if (dist[cn][cl + i] > dist[cn][cl] + i) {\\n dist[cn][cl + i] = dist[cn][cl] + i;\\n pq.emplace(dist[cn][cl + i], cn, cl + i);\\n }\\n }\\n }\\n for (auto [nn, len] : g[cn]) {\\n if (cl - len >= 0 && dist[nn][cl - len] > dist[cn][cl] + len) {\\n dist[nn][cl - len] = dist[cn][cl] + len;\\n pq.emplace(dist[nn][cl - len], nn, cl - len);\\n }\\n }\\n }\\n\\n long long ans = *min_element(dist[h].begin(),dist[h].end());\\n\\n if (ans == (long long)1LL<<60) {\\n cout << \\\"Help!\\\\n\\\";\\n } else {\\n cout << ans << '\\\\n';\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 3704,\n \"score_of_the_acc\": -0.3373,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2021_9214852\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint solve() {\\n int n, max_blood, cold_n, m, s, g;\\n std::cin >> n >> max_blood >> cold_n >> m >> s >> g;\\n if (n == 0) return 1;\\n std::vector graph(n, std::vector<std::pair<int, int>>());\\n std::vector<bool> is_cold(n);\\n for (int i = 0; i < cold_n; i++) {\\n int u;\\n std::cin >> u;\\n is_cold[u] = true;\\n }\\n for (int i = 0; i < m; i++) {\\n int u, v, w;\\n std::cin >> u >> v >> w;\\n graph[u].emplace_back(v, w);\\n graph[v].emplace_back(u, w);\\n }\\n\\n const int INF = 1e9;\\n using P = std::tuple<int, int, int>;\\n std::priority_queue<P, std::vector<P>, std::greater<P>> que;\\n std::vector dist(n, std::vector<int>(max_blood + 1, INF));\\n dist[s][max_blood] = 0;\\n que.emplace(dist[s][max_blood], s, max_blood);\\n while (!que.empty()) {\\n auto [d, u, i] = que.top();\\n que.pop();\\n if (dist[u][i] < d) continue;\\n if (is_cold[u] && i < max_blood) {\\n if (dist[u][i + 1] > dist[u][i] + 1) {\\n dist[u][i + 1] = dist[u][i] + 1;\\n que.emplace(dist[u][i + 1], u, i + 1);\\n }\\n }\\n for (auto [v, w]: graph[u]) {\\n if (i - w >= 0 && dist[v][i - w] > dist[u][i] + w) {\\n dist[v][i - w] = dist[u][i] + w;\\n que.emplace(dist[v][i - w], v, i - w);\\n }\\n }\\n }\\n int ans = INF;\\n for (int i = 0; i <= max_blood; i++) {\\n ans = std::min(ans, dist[g][i]);\\n }\\n if (ans == INF) {\\n std::cout << \\\"Help!\\\" << '\\\\n';\\n } else {\\n std::cout << ans << '\\\\n';\\n }\\n return 0;\\n}\\n\\nint main() {\\n while (!solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -0.1935,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2021_9158219\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<ll, ll>;\\n#define rep(i, a, b) for(ll i = a; i < b; ++i)\\n#define rrep(i, a, b) for(ll i = a; i >= b; --i)\\nconstexpr ll inf = 4e18;\\nstruct SetupIO {\\n SetupIO() {\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n cout << fixed << setprecision(30);\\n }\\n} setup_io;\\ntemplate <typename T = int>\\nstruct Edge {\\n int from, to;\\n T cost;\\n int idx;\\n Edge()\\n : from(-1), to(-1), cost(-1), idx(-1) {}\\n Edge(int from, int to, T cost = 1, int idx = -1)\\n : from(from), to(to), cost(cost), idx(idx) {}\\n operator int() const {\\n return to;\\n }\\n};\\ntemplate <typename T = int>\\nstruct Graph {\\n Graph(int N)\\n : n(N), es(0), g(N) {}\\n int size() const {\\n return n;\\n }\\n int edge_size() const {\\n return es;\\n }\\n void add_edge(int from, int to, T cost = 1) {\\n assert(0 <= from and from < n);\\n assert(0 <= to and to < n);\\n g[from].emplace_back(from, to, cost, es);\\n g[to].emplace_back(to, from, cost, es++);\\n }\\n void add_directed_edge(int from, int to, T cost = 1) {\\n assert(0 <= from and from < n);\\n assert(0 <= to and to < n);\\n g[from].emplace_back(from, to, cost, es++);\\n }\\n inline vector<Edge<T>>& operator[](const int& k) {\\n assert(0 <= k and k < n);\\n return g[k];\\n }\\n inline const vector<Edge<T>>& operator[](const int& k) const {\\n assert(0 <= k and k < n);\\n return g[k];\\n }\\n\\n private:\\n int n, es;\\n vector<vector<Edge<T>>> g;\\n};\\ntemplate <typename T = int>\\nusing Edges = vector<Edge<T>>;\\ntemplate <typename T>\\nvector<pair<T, int>> dijkstra(const Graph<T>& g, const int s = 0) {\\n int n = g.size();\\n assert(0 <= s and s < n);\\n vector<pair<T, int>> d(n, {numeric_limits<T>::max(), -1});\\n priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> pq;\\n d[s] = {0, -1};\\n pq.push({0, s});\\n while(!pq.empty()) {\\n pair<T, int> p = pq.top();\\n pq.pop();\\n T dist = p.first;\\n int cur = p.second;\\n if(d[cur].first < dist) continue;\\n for(const Edge<T>& edge : g[cur]) {\\n if(d[edge.to].first > d[cur].first + edge.cost) {\\n d[edge.to] = {d[cur].first + edge.cost, cur};\\n pq.push({d[edge.to].first, edge.to});\\n }\\n }\\n }\\n return d;\\n}\\nint main(void) {\\n while(1) {\\n int n, m, l, k, a, h;\\n cin >> n >> m >> l >> k >> a >> h;\\n if(n == 0) break;\\n Graph<int> g(n * (m + 1));\\n rep(i, 0, l) {\\n int x;\\n cin >> x;\\n rep(j, 0, m) {\\n g.add_directed_edge(x * (m + 1) + j, x * (m + 1) + j + 1, 1);\\n }\\n }\\n rep(i, 0, k) {\\n int x, y, t;\\n cin >> x >> y >> t;\\n rep(j, 0, m + 1) {\\n if(j - t < 0) continue;\\n g.add_directed_edge(x * (m + 1) + j, y * (m + 1) + j - t, t);\\n g.add_directed_edge(y * (m + 1) + j, x * (m + 1) + j - t, t);\\n }\\n }\\n auto d = dijkstra(g, a * (m + 1) + m);\\n int ans = 1e9;\\n rep(i, 0, m + 1) {\\n ans = min(ans, d[h * (m + 1) + i].first);\\n }\\n if(ans == 1e9) {\\n cout << \\\"Help!\\\" << '\\\\n';\\n } else {\\n cout << ans << '\\\\n';\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 550,\n \"memory_kb\": 6500,\n \"score_of_the_acc\": -1.2567,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2021_8996546\",\n \"code_snippet\": \"// (◕ᴗ◕✿)\\n\\n// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define rep(i, n) for (ll i = 0; i < (n); i++)\\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\\n#define len(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\nusing namespace std;\\ntemplate<typename T> using vc = vector<T>;\\ntemplate<typename T> using vv = vc<vc<T>>;\\ntemplate<typename T> using vvv = vv<vc<T>>;\\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nconst ld pi = 3.141592653589793;\\nconst int inf = 0x3f3f3f3f;\\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\\n// const ll mod = 1000000007;\\nconst ll mod = 998244353;\\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\\n\\n#define debug(var) do{std::cout << #var << \\\" : \\\\n\\\";view(var);}while(0)\\ntemplate<typename T> void view(T e){cout << e << endl;}\\ntemplate<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << \\\" \\\"; } cout << endl;}\\ntemplate<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }\\n\\ntuple<vl, vi> dijkstra(int s, int N, vv<pair<int, ll>> &g){\\n using P = pair<ll, int>;\\n vl dist(N, INF);\\n vi bef(N);\\n priority_queue<P, vc<P>, greater<P>> q;\\n dist[s] = 0;\\n q.push({0, s});\\n while (!q.empty()){\\n auto [c, now] = q.top();q.pop();\\n if (dist[now] < c) continue;\\n for (auto&& [nxt, nc]: g[now]) if (dist[nxt] > c + nc){\\n dist[nxt] = c + nc;\\n bef[nxt] = now;\\n q.push({dist[nxt], nxt}); \\n }\\n }\\n return {dist, bef};\\n}\\n\\nll solve(int N, int M, int L, int K, int A, int H){\\n vv<pair<int, ll>> g(N * (M + 1));\\n rep(i, L){\\n int v; cin >> v;\\n rep(j, M) g[j * N + v].push_back({(j + 1) * N + v, 1});\\n }\\n rep(i, K){\\n int x, y, t; cin >> x >> y >> t;\\n rep(j, M + 1) if (j + t <= M){\\n g[(j + t) * N + x].push_back({j * N + y, t});\\n g[(j + t) * N + y].push_back({j * N + x, t});\\n }\\n }\\n auto [dist, bef] = dijkstra(M * N + A, N * (M + 1), g);\\n ll ans = INF;\\n rep(j, M + 1) ans = min(dist[j * N + H], ans);\\n return ans;\\n}\\n\\nint main(){\\n vc<ll> ans;\\n while (true){\\n int N, M, L, K, A, H; cin >> N >> M >> L >> K >> A >> H;\\n if (N == 0) break;\\n ans.push_back(solve(N, M, L, K, A, H));\\n }\\n for (auto x : ans){\\n if (x == INF) cout << \\\"Help!\\\" << endl;\\n else cout << x << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 610,\n \"memory_kb\": 6724,\n \"score_of_the_acc\": -1.3814,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2021_8861238\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define r(i, n) for (int i = 0; i < n; i++)\\n#define INF 1e9\\nusing namespace std;\\n\\nint main() {\\n int n, m, l, k, a, h, t1, t2, t3;\\n\\n while (cin >> n >> m >> l >> k >> a >> h, n) {\\n vector<bool> rei(n, false);\\n rei[a] = rei[h] = true;\\n int b[n][n], re, x[n][n];\\n r(i, n) r(j, n) x[i][j] = b[i][j] = INF;\\n r(i, l) cin >> re, rei[re] = true;\\n r(i, k) cin >> t1 >> t2 >> t3, b[t1][t2] = b[t2][t1] = t3;\\n r(o, n) r(i, n) r(j, n) b[i][j] = min(b[i][j], b[i][o] + b[o][j]);\\n r(i, n) if (rei[i]) r(j, n) if (rei[j]) if (b[i][j] <= m)\\n x[i][j] = b[i][j];\\n r(o, n) if (rei[o]) r(i, n) if (rei[i]) r(j, n) if (rei[j]) \\n x[i][j] = min(x[i][j], x[i][o] + x[o][j]);\\n if (x[a][h] >= INF)\\n cout << \\\"Help!\\\" << endl;\\n else if (x[a][h] < m)\\n cout << x[a][h] << endl;\\n else\\n cout << x[a][h] * 2 - m << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 680,\n \"memory_kb\": 3164,\n \"score_of_the_acc\": -0.4536,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2021_8861232\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\n\\n#define r(i, n) for (int i = 0; i < n; i++)\\n#define INF 1000000000\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n\\n int n, m, l, k, a, h, t1, t2, t3;\\n while (cin >> n >> m >> l >> k >> a >> h, n) {\\n vector<int> rei(n, 0);\\n rei[a] = rei[h] = 1;\\n int b[n][n], re, x[n][n];\\n r(i, n) r(j, n) x[i][j] = b[i][j] = INF;\\n r(i, l) cin >> re, rei[re] = 1;\\n r(i, k) cin >> t1 >> t2 >> t3, b[t1][t2] = b[t2][t1] = t3;\\n r(o, n) r(i, n) r(j, n) b[i][j] = min(b[i][j], b[i][o] + b[o][j]);\\n r(i, n) if (rei[i]) r(j, n) if (rei[j]) if (b[i][j] <= m)\\n x[i][j] = b[i][j];\\n r(o, n) r(i, n) r(j, n) x[i][j] = min(x[i][j], x[i][o] + x[o][j]);\\n if (x[a][h] >= INF)\\n cout << \\\"Help!\\\" << \\\"\\\\n\\\";\\n else if (x[a][h] < m)\\n cout << x[a][h] << \\\"\\\\n\\\";\\n else\\n cout << x[a][h] * 2 - m << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1210,\n \"memory_kb\": 3212,\n \"score_of_the_acc\": -1.0135,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2021_8215972\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define r(i, n) for (int i = 0; i < n; i++)\\n#define INF 1e9\\nusing namespace std;\\nint main() {\\n int n, m, l, k, a, h, t1, t2, t3;\\n while (cin >> n >> m >> l >> k >> a >> h, n) {\\n set<int> q;\\n q.insert(a), q.insert(h);\\n int b[n][n], e, x[n][n];\\n r(i, n) r(j, n) x[i][j] = b[i][j] = INF;\\n r(i, l) cin >> e, q.insert(e);\\n r(i, k) cin >> t1 >> t2 >> t3, b[t1][t2] = b[t2][t1] = t3;\\n r(o, n) r(i, n) r(j, n) b[i][j] = min(b[i][j], b[i][o] + b[o][j]);\\n r(i, n) if (q.count(i)) r(j, n) if (q.count(j)) if (b[i][j] <= m) x[i][j] =\\n b[i][j];\\n r(o, n) r(i, n) r(j, n) x[i][j] = min(x[i][j], x[i][o] + x[o][j]);\\n if (x[a][h] >= INF)\\n cout << \\\"Help!\\\" << endl;\\n else if (x[a][h] < m)\\n cout << x[a][h] << endl;\\n else\\n cout << x[a][h] * 2 - m << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 750,\n \"memory_kb\": 3164,\n \"score_of_the_acc\": -0.5258,\n \"final_rank\": 16\n }\n]","isConversational":false}}},{"rowIdx":1062,"cells":{"group_id":{"kind":"string","value":"aoj_2032_cpp"},"problem_description":{"kind":"string","value":"Problem C:\nOnline Quizu System\nICPC (Internet Contents Providing Company) is working on a killer game named Quiz Millionaire Attack.\nIt is a quiz system played over the Internet. You are joining ICPC as an engineer, and you are responsible\nfor designing a protocol between clients and the game server for this system. As bandwidth assigned for\nthe server is quite limited, data size exchanged between clients and the server should be reduced as much\nas possible. In addition, all clients should be well synchronized during the quiz session for a simultaneous\nplay. In particular, much attention should be paid to the delay on receiving packets.\nTo verify that your protocol meets the above demands, you have decided to simulate the communication\nbetween clients and the server and calculate the data size exchanged during one game.\nA game has the following process. First, players participating and problems to be used are fixed. All\nplayers are using the same client program and already have the problem statements downloaded, so you\ndon’t need to simulate this part. Then the game begins. The first problem is presented to the players,\nand the players answer it within a fixed amount of time. After that, the second problem is presented,\nand so forth. When all problems have been completed, the game ends. During each problem phase,\nthe players are notified of what other players have done. Before you submit your answer, you can know\nwho have already submitted their answers. After you have submitted your answer, you can know what\nanswers are submitted by other players.\nWhen each problem phase starts, the server sends a\nsynchronization packet for problem-start\nto all the\nplayers, and begins a polling process. Every 1,000 milliseconds after the beginning of polling, the server\nchecks whether it received new answers from the players strictly before that moment, and if there are\nany, sends a notification to all the players:\nIf a player hasn’t submitted an answer yet, the server sends it a\nnotification packet type A describing\n others’ answers\nabout the newly received answers.\nIf a player is one of those who submitted the newly received answers, the server sends it a\nnotification\n packet type B describing others’ answers\nabout all the answers submitted by other players (i.e.\n excluding the player him/herself’s answer) strictly before that moment.\nIf a player has already submitted an answer, the server sends it a\nnotification packet type B describing\n others’ answers\nabout the newly received answers.\nNote that, in all above cases, notification packets (both types A and B) must contain information\n about at least one player, and otherwise a notification packet will not be sent.\nWhen 20,000 milliseconds have passed after sending the\nsynchronization packet for problem-start\n, the\nserver sends notification packets of type A or B if needed, and then sends a\nsynchronization packet for\nproblem-end\nto all the players, to terminate the problem.\nOn the other hand, players will \n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2032_1354222","code_snippet":"#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_T = 20000;\nconst int INT_T = 1000;\n\nconst int MAX_M = 100;\nconst int MAX_N = 100;\n\nconst int PKT_HDR = 3;\n\n/* typedef */\n\nstruct Answer {\n int p, t, size;\n Answer() {}\n Answer(int _p, int _t, int _size) { p = _p, t = _t, size = _size; }\n bool operator<(const Answer& a0) const { return t < a0.t; }\n void print() { printf(\"Answer:p=%d,t=%d,size=%d\\n\", p, t, size); }\n};\n\ntypedef vector<Answer> va;\n\n/* global variables */\n\nint m, n, l;\nint ds[MAX_M];\nint ssent, srecv, csents[MAX_M], crecvs[MAX_M];\nva vans;\nint ansed[MAX_M], newansed[MAX_M];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n for (bool first = true;; first = false) {\n cin >> m >> n;\n if (m == 0) break;\n\n ssent = srecv = 0;\n memset(csents, 0, sizeof(csents));\n memset(crecvs, 0, sizeof(crecvs));\n\n for (int i = 0; i < m; i++)\n cin >> ds[i];\n\n while (n--) {\n vans.clear();\n \n cin >> l;\n for (int i = 0; i < l; i++) {\n\tint p, t;\n\tstring ans;\n\tcin >> p >> t >> ans;\n\tvans.push_back(Answer(p, t + 2 * ds[p], ans.length()));\n }\n sort(vans.begin(), vans.end());\n\n // problem-start\n for (int i = 0; i < m; i++) {\n\tssent += PKT_HDR;\n\tcrecvs[i] += PKT_HDR;\n }\n\n int ai = 0;\n int nansed = 0, sum = 0;\n memset(ansed, 0, sizeof(ansed));\n \n for (int t = 0; t <= MAX_T; t += INT_T) {\n\t//printf(\"t=%d\\n\", t);\n\tint nnewansed = 0, newsum = 0;\n\tmemset(newansed, 0, sizeof(newansed));\n\n\t// receive Answer\n\twhile (ai < l && vans[ai].t < t) {\n\t Answer& vai = vans[ai];\n\t //vai.print();\n\t \n\t int data = 2 + vai.size;\n\t csents[vai.p] += PKT_HDR + data;\n\t srecv += PKT_HDR + data;\n\t ansed[vai.p] = newansed[vai.p] = data;\n\t nansed++;\n\t nnewansed++;\n\t sum += data;\n\t newsum += data;\n\t ai++;\n\t}\n\n\t// notification\n\tif (nnewansed > 0) {\n\t for (int i = 0; i < m; i++) {\n\t if (ansed[i] == 0) {\t// type A\n\t int pkt = PKT_HDR + 1 + nnewansed;\n\t ssent += pkt;\n\t crecvs[i] += pkt;\n\t //printf(\" t=%d: type A->%d, %d byte\\n\", t, i, pkt);\n\t }\n\t else if (newansed[i] > 0 && nansed > 1) {\t// type B (exclude)\n\t int pkt = PKT_HDR + 1 + sum - newansed[i];\n\t ssent += pkt;\n\t crecvs[i] += pkt;\n\t //printf(\" t=%d: type B(excl)->%d, %d byte\\n\", t, i, pkt);\n\t }\n\t else if (newansed[i] == 0 && ansed[i] > 0) {\t// type B\n\t int pkt = PKT_HDR + 1 + newsum;\n\t ssent += pkt;\n\t crecvs[i] += pkt;\n\t //printf(\" t=%d: type B->%d, %d byte\\n\", t, i, pkt);\n\t }\n\t }\n\t}\n }\n\n // problem-end\n for (int i = 0; i < m; i++) {\n\tssent += PKT_HDR + 1;\n\tcrecvs[i] += PKT_HDR + 1;\n }\n }\n\n if (! first) cout << endl;\n \n printf(\"%d %d\\n\", ssent, srecv);\n for (int i = 0; i < m; i++)\n printf(\"%d %d\\n\", csents[i], crecvs[i]);\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1228,"score_of_the_acc":-1,"final_rank":2},{"submission_id":"aoj_2032_313177","code_snippet":"#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\nusing namespace std;\n\nstruct Answer{\n int player;\n int time_sent;\n int time_rec;\n string answer;\n};\n\nint main()\n{\n int n, m;\n bool first = true;\n while( cin >> n >> m && n && m ){\n int delay[n];\n int server_sent = 0;\n int server_rec = 0;\n int sent[n];\n int rec[n];\n\n if( !first ){\n cout << endl;\n }else first = false;\n \n for(int i = 0; i < n; ++i){\n cin >> delay[i];\n sent[i] = 0;\n rec[i] = 0;\n }\n\n for(int prob = 0; prob < m; ++prob){\n int L;\n map<int,vector<Answer> > all_ans;\n\n // problem-start\n server_sent += 3*n;\n for(int i = 0; i < n; ++i){\n rec[i] += 3;\n }\n \n cin >> L;\n for(int i = 0; i < L; ++i){\n Answer ans;\n cin >> ans.player >> ans.time_sent >> ans.answer;\n //cout << ans.player << ' ' << ans.time_sent << ' ' << ans.answer << endl;\n ans.time_rec = ans.time_sent + 2*delay[ans.player];\n all_ans[ ans.time_rec ].push_back( ans );\n \n server_rec += 3+1+1+ans.answer.length();\n sent[ans.player] += 3+1+1+ans.answer.length();\n }\n\n int time = 1000;\n bool old_submit[n];\n bool new_submit[n];\n Answer submit_answer[n];\n vector<Answer> old_ans;\n vector<Answer> new_ans;\n \n for(int i = 0; i < n; ++i){\n old_submit[i] = false;\n new_submit[i] = false;\n }\n\n while(time <= 20000 ){\n //cout << \"TIME : <\" << time << endl;\n for(int i = 0; i < (int)new_ans.size(); ++i){\n old_ans.push_back( new_ans[i] );\n }\n for(int i = 0; i < n; ++i){\n //cout << sent[i] << ' ' << rec[i] << endl;\n if( new_submit[i] ){\n old_submit[i] = new_submit[i];\n }\n }\n //cout << endl;\n\n new_ans.clear();\n for(int i = 0; i < n; ++i){\n new_submit[i] = false;\n }\n \n //cout << endl;\n\n map<int,vector<Answer> >::iterator it = all_ans.lower_bound(time - 1000);\n for(;it!=all_ans.end()&&it->first<time;++it){\n // for newly recieved\n //cout << it->first <<endl;\n for(int i = 0; i < (int)it->second.size(); ++i){\n new_ans.push_back( it->second[i] );\n new_submit[ it->second[i].player ] = true;\n submit_answer[ it->second[i].player ] = it->second[i];\n }\n }\n\n\n for(int i = 0; i < n; ++i){\n //cout << old_submit[i] << ' ' << new_submit[i] << endl;\n }\n \n \n for(int i = 0; i < n; ++i){\n if( !old_submit[i] && !new_submit[i] ){\n // not yet submitted\n int sent_b = 3+1+new_ans.size();\n if( new_ans.size() > 0 ){\n server_sent += sent_b;\n rec[i] += sent_b;\n }\n //cout << new_ans.size() << ' ' << \"not yet \" << i << ' ' << sent_b << endl;\n }\n else if( old_submit[i] && !new_submit[i] ){\n // submitted but not newly\n int sent_b = 3+1;\n int cnt=0;\n for(int j = 0; j < (int)new_ans.size(); ++j){\n ++cnt;\n sent_b += 1+1+new_ans[j].answer.length();\n }\n if( cnt > 0 ){\n server_sent += sent_b;\n rec[i] += sent_b;\n }\n //cout << cnt << \" old submit \" << i << ' ' << sent_b << endl;\n }\n else if( new_submit[i] ){\n // submitted newly\n int sent_b = 3+1;\n int cnt = 0;\n for(int j = 0; j < (int)new_ans.size(); ++j){\n if( new_ans[j].player != i ){\n ++cnt;\n sent_b += 1+1+new_ans[j].answer.length();\n }\n }\n for(int j = 0; j < (int)old_ans.size(); ++j){\n if( old_ans[j].player != i ){\n ++cnt;\n sent_b += 1+1+old_ans[j].answer.length();\n }\n }\n \n if( cnt > 0 ){\n server_sent += sent_b;\n rec[i] += sent_b;\n }\n //cout << cnt << \" newly \" << i << ' ' << sent_b << endl;\n }\n }\n \n time += 1000;\n }\n // problem-end\n server_sent += 4*n;\n for(int i = 0; i < n; ++i){\n rec[i] += 4;\n }\n \n }\n\n\n cout << server_sent << ' ' << server_rec << endl;\n for(int i = 0; i < n; ++i){\n cout << sent[i] << ' ' << rec[i] << endl;\n }\n\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":952,"score_of_the_acc":-1.0921,"final_rank":3},{"submission_id":"aoj_2032_136568","code_snippet":"#include <iostream>\n#include <string>\n#include <cstring>\n#include <queue>\nusing namespace std;\n\nclass Ans\n{\npublic:\n\tint p,t,l;\n\tAns(int p, int t, int l)\n\t\t:p(p),t(t),l(l)\n\t{}\n\n\tbool operator<(const Ans& ans) const\n\t{\n\t\treturn t>ans.t;\n\t}\n};\n\nint M,N,D[100];\nint ssend, srecv;\nint psend[100], precv[100];\n\nvoid calc(priority_queue<Ans>& q)\n{\n\tint tt=1,ansn=0,ansl=0,alansn=0, alansl=0;\n\tbool ansed[100]={0},nwansed[100]={0};\n\tint lg[100]={0};\n\t\n\tq.push(Ans(0,99999,0));\n\n\twhile(1)\n\t{\n\t\tAns a=q.top(); \n\t\tif(tt > 20) break;\n\t\t\n\t\tif(a.t < tt*1000) \n\t\t{\n\t\t\tansed[a.p]=1;\n\t\t\tnwansed[a.p]=1;\n\t\t\t\n\t\t\tansn++;\n\t\t\tansl+=a.l;\n\t\t\talansn++;\n\t\t\talansl+=a.l;\n\t\t\t\n\t\t\tlg[a.p]=a.l;\n\t\t\t\n\t\t\tq.pop();\n\t\t}\n\t\telse\n\t\t{\n\t\t\t++tt;\n\t\t\tif(ansn==0) continue;\n\t\t\t\n\t\t\tfor(int i=0; i<M; i++)\n\t\t\t{\n\t\t\t\tif(nwansed[i])\n\t\t\t\t{\n\t\t\t\t\tif(alansn>1)\n\t\t\t\t\t{\n\t\t\t\t\t\tssend+=4+2*(alansn-1)+(alansl-lg[i]);\n\t\t\t\t\t\tprecv[i]+=4+2*(alansn-1)+(alansl-lg[i]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if(ansed[i])\n\t\t\t\t{\n\t\t\t\t\tssend+=4+2*ansn+ansl;\n\t\t\t\t\tprecv[i]+=4+2*ansn+ansl;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tssend+=4+ansn;\n\t\t\t\t\tprecv[i]+=4+ansn;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tansn=0;\n\t\t\tansl=0;\n\t\t\tmemset(lg,0,sizeof(lg));\n\t\t\tmemset(nwansed, 0, sizeof(nwansed));\n\t\t}\n\t}\n}\n\nint main()\n{\n\tbool b=0;\n\twhile(cin >> M >> N, (M||N))\n\t{\n\t\tif(b) cout << endl;\n\t\tb=1;\n\t\t\n\t\tfor(int i=0; i<M; i++)\n\t\t\tcin >> D[i];\n\n\t\tssend=0;\n\t\tsrecv=0;\n\t\tmemset(psend,0,sizeof(psend));\n\t\tmemset(precv,0,sizeof(precv));\n\n\t\tfor(int i=0; i<N; i++)\n\t\t{\n\t\t\tssend+=3*M;\n\t\t\tfor(int j=0; j<M; j++)\n\t\t\t\tprecv[j]+=3;\n\t\t\t\n\t\t\tint L;\n\t\t\tcin >> L;\n\t\t\tpriority_queue<Ans> q;\n\t\t\tfor(int j=0; j<L; j++)\n\t\t\t{\n\t\t\t\tint P,T;\n\t\t\t\tstring A;\n\t\t\t\tcin >> P >> T >> A;\n\t\t\t\tq.push(Ans(P,T+D[P]*2,A.size()));\n\n\t\t\t\tpsend[P]+=5+A.size();\n\t\t\t\tsrecv+=5+A.size();\n\t\t\t}\n\n\t\t\tcalc(q);\n\t\t\tssend+=4*M;\n\t\t\tfor(int j=0; j<M; j++)\n\t\t\t\tprecv[j]+=4;\n\t\t\t\n\t\t}\n\n\t\tcout << ssend << \" \" << srecv << endl;\n\t\tfor(int i=0; i<M; i++)\n\t\t\tcout << psend[i] << \" \" << precv[i] << endl;\n\t}\n}","accuracy":1,"time_ms":30,"memory_kb":924,"score_of_the_acc":-0.6667,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2032_1354222\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_T = 20000;\\nconst int INT_T = 1000;\\n\\nconst int MAX_M = 100;\\nconst int MAX_N = 100;\\n\\nconst int PKT_HDR = 3;\\n\\n/* typedef */\\n\\nstruct Answer {\\n int p, t, size;\\n Answer() {}\\n Answer(int _p, int _t, int _size) { p = _p, t = _t, size = _size; }\\n bool operator<(const Answer& a0) const { return t < a0.t; }\\n void print() { printf(\\\"Answer:p=%d,t=%d,size=%d\\\\n\\\", p, t, size); }\\n};\\n\\ntypedef vector<Answer> va;\\n\\n/* global variables */\\n\\nint m, n, l;\\nint ds[MAX_M];\\nint ssent, srecv, csents[MAX_M], crecvs[MAX_M];\\nva vans;\\nint ansed[MAX_M], newansed[MAX_M];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n for (bool first = true;; first = false) {\\n cin >> m >> n;\\n if (m == 0) break;\\n\\n ssent = srecv = 0;\\n memset(csents, 0, sizeof(csents));\\n memset(crecvs, 0, sizeof(crecvs));\\n\\n for (int i = 0; i < m; i++)\\n cin >> ds[i];\\n\\n while (n--) {\\n vans.clear();\\n \\n cin >> l;\\n for (int i = 0; i < l; i++) {\\n\\tint p, t;\\n\\tstring ans;\\n\\tcin >> p >> t >> ans;\\n\\tvans.push_back(Answer(p, t + 2 * ds[p], ans.length()));\\n }\\n sort(vans.begin(), vans.end());\\n\\n // problem-start\\n for (int i = 0; i < m; i++) {\\n\\tssent += PKT_HDR;\\n\\tcrecvs[i] += PKT_HDR;\\n }\\n\\n int ai = 0;\\n int nansed = 0, sum = 0;\\n memset(ansed, 0, sizeof(ansed));\\n \\n for (int t = 0; t <= MAX_T; t += INT_T) {\\n\\t//printf(\\\"t=%d\\\\n\\\", t);\\n\\tint nnewansed = 0, newsum = 0;\\n\\tmemset(newansed, 0, sizeof(newansed));\\n\\n\\t// receive Answer\\n\\twhile (ai < l && vans[ai].t < t) {\\n\\t Answer& vai = vans[ai];\\n\\t //vai.print();\\n\\t \\n\\t int data = 2 + vai.size;\\n\\t csents[vai.p] += PKT_HDR + data;\\n\\t srecv += PKT_HDR + data;\\n\\t ansed[vai.p] = newansed[vai.p] = data;\\n\\t nansed++;\\n\\t nnewansed++;\\n\\t sum += data;\\n\\t newsum += data;\\n\\t ai++;\\n\\t}\\n\\n\\t// notification\\n\\tif (nnewansed > 0) {\\n\\t for (int i = 0; i < m; i++) {\\n\\t if (ansed[i] == 0) {\\t// type A\\n\\t int pkt = PKT_HDR + 1 + nnewansed;\\n\\t ssent += pkt;\\n\\t crecvs[i] += pkt;\\n\\t //printf(\\\" t=%d: type A->%d, %d byte\\\\n\\\", t, i, pkt);\\n\\t }\\n\\t else if (newansed[i] > 0 && nansed > 1) {\\t// type B (exclude)\\n\\t int pkt = PKT_HDR + 1 + sum - newansed[i];\\n\\t ssent += pkt;\\n\\t crecvs[i] += pkt;\\n\\t //printf(\\\" t=%d: type B(excl)->%d, %d byte\\\\n\\\", t, i, pkt);\\n\\t }\\n\\t else if (newansed[i] == 0 && ansed[i] > 0) {\\t// type B\\n\\t int pkt = PKT_HDR + 1 + newsum;\\n\\t ssent += pkt;\\n\\t crecvs[i] += pkt;\\n\\t //printf(\\\" t=%d: type B->%d, %d byte\\\\n\\\", t, i, pkt);\\n\\t }\\n\\t }\\n\\t}\\n }\\n\\n // problem-end\\n for (int i = 0; i < m; i++) {\\n\\tssent += PKT_HDR + 1;\\n\\tcrecvs[i] += PKT_HDR + 1;\\n }\\n }\\n\\n if (! first) cout << endl;\\n \\n printf(\\\"%d %d\\\\n\\\", ssent, srecv);\\n for (int i = 0; i < m; i++)\\n printf(\\\"%d %d\\\\n\\\", csents[i], crecvs[i]);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1228,\n \"score_of_the_acc\": -1,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2032_313177\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\nusing namespace std;\\n\\nstruct Answer{\\n int player;\\n int time_sent;\\n int time_rec;\\n string answer;\\n};\\n\\nint main()\\n{\\n int n, m;\\n bool first = true;\\n while( cin >> n >> m && n && m ){\\n int delay[n];\\n int server_sent = 0;\\n int server_rec = 0;\\n int sent[n];\\n int rec[n];\\n\\n if( !first ){\\n cout << endl;\\n }else first = false;\\n \\n for(int i = 0; i < n; ++i){\\n cin >> delay[i];\\n sent[i] = 0;\\n rec[i] = 0;\\n }\\n\\n for(int prob = 0; prob < m; ++prob){\\n int L;\\n map<int,vector<Answer> > all_ans;\\n\\n // problem-start\\n server_sent += 3*n;\\n for(int i = 0; i < n; ++i){\\n rec[i] += 3;\\n }\\n \\n cin >> L;\\n for(int i = 0; i < L; ++i){\\n Answer ans;\\n cin >> ans.player >> ans.time_sent >> ans.answer;\\n //cout << ans.player << ' ' << ans.time_sent << ' ' << ans.answer << endl;\\n ans.time_rec = ans.time_sent + 2*delay[ans.player];\\n all_ans[ ans.time_rec ].push_back( ans );\\n \\n server_rec += 3+1+1+ans.answer.length();\\n sent[ans.player] += 3+1+1+ans.answer.length();\\n }\\n\\n int time = 1000;\\n bool old_submit[n];\\n bool new_submit[n];\\n Answer submit_answer[n];\\n vector<Answer> old_ans;\\n vector<Answer> new_ans;\\n \\n for(int i = 0; i < n; ++i){\\n old_submit[i] = false;\\n new_submit[i] = false;\\n }\\n\\n while(time <= 20000 ){\\n //cout << \\\"TIME : <\\\" << time << endl;\\n for(int i = 0; i < (int)new_ans.size(); ++i){\\n old_ans.push_back( new_ans[i] );\\n }\\n for(int i = 0; i < n; ++i){\\n //cout << sent[i] << ' ' << rec[i] << endl;\\n if( new_submit[i] ){\\n old_submit[i] = new_submit[i];\\n }\\n }\\n //cout << endl;\\n\\n new_ans.clear();\\n for(int i = 0; i < n; ++i){\\n new_submit[i] = false;\\n }\\n \\n //cout << endl;\\n\\n map<int,vector<Answer> >::iterator it = all_ans.lower_bound(time - 1000);\\n for(;it!=all_ans.end()&&it->first<time;++it){\\n // for newly recieved\\n //cout << it->first <<endl;\\n for(int i = 0; i < (int)it->second.size(); ++i){\\n new_ans.push_back( it->second[i] );\\n new_submit[ it->second[i].player ] = true;\\n submit_answer[ it->second[i].player ] = it->second[i];\\n }\\n }\\n\\n\\n for(int i = 0; i < n; ++i){\\n //cout << old_submit[i] << ' ' << new_submit[i] << endl;\\n }\\n \\n \\n for(int i = 0; i < n; ++i){\\n if( !old_submit[i] && !new_submit[i] ){\\n // not yet submitted\\n int sent_b = 3+1+new_ans.size();\\n if( new_ans.size() > 0 ){\\n server_sent += sent_b;\\n rec[i] += sent_b;\\n }\\n //cout << new_ans.size() << ' ' << \\\"not yet \\\" << i << ' ' << sent_b << endl;\\n }\\n else if( old_submit[i] && !new_submit[i] ){\\n // submitted but not newly\\n int sent_b = 3+1;\\n int cnt=0;\\n for(int j = 0; j < (int)new_ans.size(); ++j){\\n ++cnt;\\n sent_b += 1+1+new_ans[j].answer.length();\\n }\\n if( cnt > 0 ){\\n server_sent += sent_b;\\n rec[i] += sent_b;\\n }\\n //cout << cnt << \\\" old submit \\\" << i << ' ' << sent_b << endl;\\n }\\n else if( new_submit[i] ){\\n // submitted newly\\n int sent_b = 3+1;\\n int cnt = 0;\\n for(int j = 0; j < (int)new_ans.size(); ++j){\\n if( new_ans[j].player != i ){\\n ++cnt;\\n sent_b += 1+1+new_ans[j].answer.length();\\n }\\n }\\n for(int j = 0; j < (int)old_ans.size(); ++j){\\n if( old_ans[j].player != i ){\\n ++cnt;\\n sent_b += 1+1+old_ans[j].answer.length();\\n }\\n }\\n \\n if( cnt > 0 ){\\n server_sent += sent_b;\\n rec[i] += sent_b;\\n }\\n //cout << cnt << \\\" newly \\\" << i << ' ' << sent_b << endl;\\n }\\n }\\n \\n time += 1000;\\n }\\n // problem-end\\n server_sent += 4*n;\\n for(int i = 0; i < n; ++i){\\n rec[i] += 4;\\n }\\n \\n }\\n\\n\\n cout << server_sent << ' ' << server_rec << endl;\\n for(int i = 0; i < n; ++i){\\n cout << sent[i] << ' ' << rec[i] << endl;\\n }\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 952,\n \"score_of_the_acc\": -1.0921,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2032_136568\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <cstring>\\n#include <queue>\\nusing namespace std;\\n\\nclass Ans\\n{\\npublic:\\n\\tint p,t,l;\\n\\tAns(int p, int t, int l)\\n\\t\\t:p(p),t(t),l(l)\\n\\t{}\\n\\n\\tbool operator<(const Ans& ans) const\\n\\t{\\n\\t\\treturn t>ans.t;\\n\\t}\\n};\\n\\nint M,N,D[100];\\nint ssend, srecv;\\nint psend[100], precv[100];\\n\\nvoid calc(priority_queue<Ans>& q)\\n{\\n\\tint tt=1,ansn=0,ansl=0,alansn=0, alansl=0;\\n\\tbool ansed[100]={0},nwansed[100]={0};\\n\\tint lg[100]={0};\\n\\t\\n\\tq.push(Ans(0,99999,0));\\n\\n\\twhile(1)\\n\\t{\\n\\t\\tAns a=q.top(); \\n\\t\\tif(tt > 20) break;\\n\\t\\t\\n\\t\\tif(a.t < tt*1000) \\n\\t\\t{\\n\\t\\t\\tansed[a.p]=1;\\n\\t\\t\\tnwansed[a.p]=1;\\n\\t\\t\\t\\n\\t\\t\\tansn++;\\n\\t\\t\\tansl+=a.l;\\n\\t\\t\\talansn++;\\n\\t\\t\\talansl+=a.l;\\n\\t\\t\\t\\n\\t\\t\\tlg[a.p]=a.l;\\n\\t\\t\\t\\n\\t\\t\\tq.pop();\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\t++tt;\\n\\t\\t\\tif(ansn==0) continue;\\n\\t\\t\\t\\n\\t\\t\\tfor(int i=0; i<M; i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(nwansed[i])\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(alansn>1)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tssend+=4+2*(alansn-1)+(alansl-lg[i]);\\n\\t\\t\\t\\t\\t\\tprecv[i]+=4+2*(alansn-1)+(alansl-lg[i]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(ansed[i])\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tssend+=4+2*ansn+ansl;\\n\\t\\t\\t\\t\\tprecv[i]+=4+2*ansn+ansl;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tssend+=4+ansn;\\n\\t\\t\\t\\t\\tprecv[i]+=4+ansn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tansn=0;\\n\\t\\t\\tansl=0;\\n\\t\\t\\tmemset(lg,0,sizeof(lg));\\n\\t\\t\\tmemset(nwansed, 0, sizeof(nwansed));\\n\\t\\t}\\n\\t}\\n}\\n\\nint main()\\n{\\n\\tbool b=0;\\n\\twhile(cin >> M >> N, (M||N))\\n\\t{\\n\\t\\tif(b) cout << endl;\\n\\t\\tb=1;\\n\\t\\t\\n\\t\\tfor(int i=0; i<M; i++)\\n\\t\\t\\tcin >> D[i];\\n\\n\\t\\tssend=0;\\n\\t\\tsrecv=0;\\n\\t\\tmemset(psend,0,sizeof(psend));\\n\\t\\tmemset(precv,0,sizeof(precv));\\n\\n\\t\\tfor(int i=0; i<N; i++)\\n\\t\\t{\\n\\t\\t\\tssend+=3*M;\\n\\t\\t\\tfor(int j=0; j<M; j++)\\n\\t\\t\\t\\tprecv[j]+=3;\\n\\t\\t\\t\\n\\t\\t\\tint L;\\n\\t\\t\\tcin >> L;\\n\\t\\t\\tpriority_queue<Ans> q;\\n\\t\\t\\tfor(int j=0; j<L; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint P,T;\\n\\t\\t\\t\\tstring A;\\n\\t\\t\\t\\tcin >> P >> T >> A;\\n\\t\\t\\t\\tq.push(Ans(P,T+D[P]*2,A.size()));\\n\\n\\t\\t\\t\\tpsend[P]+=5+A.size();\\n\\t\\t\\t\\tsrecv+=5+A.size();\\n\\t\\t\\t}\\n\\n\\t\\t\\tcalc(q);\\n\\t\\t\\tssend+=4*M;\\n\\t\\t\\tfor(int j=0; j<M; j++)\\n\\t\\t\\t\\tprecv[j]+=4;\\n\\t\\t\\t\\n\\t\\t}\\n\\n\\t\\tcout << ssend << \\\" \\\" << srecv << endl;\\n\\t\\tfor(int i=0; i<M; i++)\\n\\t\\t\\tcout << psend[i] << \\\" \\\" << precv[i] << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 924,\n \"score_of_the_acc\": -0.6667,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1063,"cells":{"group_id":{"kind":"string","value":"aoj_2026_cpp"},"problem_description":{"kind":"string","value":"Problem D:\nDivisor is the Conqueror\nDivisor is the Conquerer\nis a solitaire card game. Although this simple game itself is a great\nway to pass one’s time, you, a programmer, always kill your time by programming. Your task\nis to write a computer program that automatically solves\nDivisor is the Conquerer\ngames. Here\nis the rule of this game:\nFirst, you randomly draw\nN\ncards (1 ≤\nN\n≤ 52) from your deck of playing cards. The game is\nplayed only with those cards; the other cards will not be used.\nThen you repeatedly pick one card to play among those in your hand. You are allowed to choose\nany card in the initial turn. After that, you are only allowed to pick a card that conquers the\ncards you have already played. A card is said to conquer a set of cards when the rank of the card\ndivides the sum of the ranks in the set. For example, the card 7 conquers the set {5, 11, 12},\nwhile the card 11 does not conquer the set {5, 7, 12}.\nYou win the game if you successfully play all\nN\ncards you have drawn. You lose if you fails,\nthat is, you faces a situation in which no card in your hand conquers the set of cards you have\nplayed.\nInput\nThe input consists of multiple test cases.\nEach test case consists of two lines. The first line contains an integer\nN\n(1 ≤ N ≤ 52), which represents the number of the cards. The second line contains\nN\nintegers\nc\n1\n, . . . , c\nN\n(1 ≤\nc\ni\n≤ 13),\neach of which represents the rank of the card. You may assume that there are at most four cards\nwith the same rank in one list.\nThe input is terminated by a line with a single zero.\nOutput\nFor each test case, you should output one line. If there are any winning strategies for the cards\nof the input, print any one of them as a list of\nN\nintegers separated by a space.\nIf there is no winning strategy, print “No”.\nSample Input\n5\n1 2 3 3 7\n4\n2 3 3 3\n0\nOutput for the Sample Input\n3 3 1 7 2\nNo"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2026_10848967","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\nvector<int> cur;\n\nint cnt[14];\nbool rec(int n, int sum)\n{\n if(n == 0)\n return 1;\n\n for(int i = 1; i <= 13; i++){\n if(cnt[i] != 0 && sum % i == 0){\n cur.push_back(i);\n\n cnt[i]--;\n if(rec(n - 1, sum - i))\n return 1;\n\n cnt[i]++;\n cur.pop_back();\n }\n }\n return 0;\n}\n\nint main() {\n while (1) {\n int n;\n cin >> n;\n\n if (n == 0)\n exit(0);\n\n int sum = 0;\n\n for (int i = 0; i < 14; i++)\n cnt[i] = 0;\n\n for(int i = 0; i < n; i++){\n int x;\n cin >> x;\n\n cnt[x]++;\n\n sum += x;\n }\n\n cur.clear();\n if(rec(n, sum)) {\n for (int i = n - 1; i > 0; i--)\n cout << cur[i] << \" \";\n cout << cur[0] << endl;\n } else\n cout << \"No\" << endl;\n }\n}","accuracy":1,"time_ms":450,"memory_kb":3296,"score_of_the_acc":-0.8635,"final_rank":9},{"submission_id":"aoj_2026_9099876","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<int> c(13);\n int sum = 0;\n for (int i = 0; i < n; i++) {\n int a;\n cin >> a;\n sum += a;\n c[a - 1] += 1;\n }\n vector<int> res;\n set<vector<int>> used;\n auto slv = [&](auto self, int rem) -> bool {\n if (rem == 0) return true;\n if (used.find(c) != used.end()) return false;\n used.insert(c);\n for (int i = 0; i < 13; i++) {\n if (c[i] and rem % (i + 1) == 0) {\n c[i] -= 1;\n res.push_back(i + 1);\n if (self(self, rem - (i + 1))) return true;\n res.pop_back();\n c[i] += 1;\n }\n }\n return false;\n };\n if (slv(slv, sum)) {\n reverse(res.begin(), res.end());\n for (int i = 0; i < res.size(); i++) {\n if (i) cout << \" \";\n cout << res[i];\n }\n cout << \"\\n\";\n } else {\n cout << \"No\\n\";\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3980,"score_of_the_acc":-1.0024,"final_rank":14},{"submission_id":"aoj_2026_5093274","code_snippet":"// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing pii = pair<int, int>;\nusing vvl = vector<vector<ll>>;\nusing vvi = vector<vector<int>>;\nusing vvpll = vector<vector<pll>>;\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--)\n#define pb push_back\n#define tostr to_string\n#define ALL(A) A.begin(), A.end()\n// constexpr ll INF = LONG_LONG_MAX;\nconstexpr ll INF = 1e18;\nconstexpr ll MOD = 1000000007;\n\nconst string digits = \"0123456789\";\nconst string ascii_lowercase = \"abcdefghijklmnopqrstuvwxyz\";\nconst string ascii_uppercase = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\n\ntemplate<typename T> vector<vector<T>> list2d(int N, int M, T init) { return vector<vector<T>>(N, vector<T>(M, init)); }\ntemplate<typename T> vector<vector<vector<T>>> list3d(int N, int M, int L, T init) { return vector<vector<vector<T>>>(N, vector<vector<T>>(M, vector<T>(L, init))); }\ntemplate<typename T> vector<vector<vector<vector<T>>>> list4d(int N, int M, int L, int O, T init) { return vector<vector<vector<vector<T>>>>(N, vector<vector<vector<T>>>(M, vector<vector<T>>(L, vector<T>(O, init)))); }\n\nvoid print(ld out) { cout << fixed << setprecision(15) << out << '\\n'; }\nvoid print(double out) { cout << fixed << setprecision(15) << out << '\\n'; }\ntemplate<typename T> void print(T out) { cout << out << '\\n'; }\ntemplate<typename T1, typename T2> void print(pair<T1, T2> out) { cout << out.first << ' ' << out.second << '\\n'; }\ntemplate<typename T> void print(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\\n' : ' '); } }\ntemplate<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }\n\nvoid Yes() { print(\"Yes\"); }\nvoid No() { print(\"No\"); }\nvoid YES() { print(\"YES\"); }\nvoid NO() { print(\"NO\"); }\n\nll floor(ll a, ll b) { if (a < 0) { return (a-b+1) / b; } else { return a / b; } }\nll ceil(ll a, ll b) { if (a >= 0) { return (a+b-1) / b; } else { return a / b; } }\npll divmod(ll a, ll b) { ll d = a / b; ll m = a % b; return {d, m}; }\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\ntemplate<typename T> bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; }\n\ntemplate<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }\ntemplate<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }\ntemplate<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }\n\nll toint(string s) { ll res = 0; for (char c : s) { res *= 10; res += (c - '0'); } return res; }\nint toint(char num) { return num - '0'; }\nchar tochar(int num) { return '0' + num; }\nint ord(char c) { return (int)c; }\nchar chr(int a) { return (char)a; }\n\nll pow(int x, ll n) { ll res = 1; rep(_, 0, n) res *= x; return res; }\nll pow(ll x, ll n, int mod) { ll res = 1; while (n > 0) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; }\n\nint popcount(ll S) { return __builtin_popcountll(S); }\nll gcd(ll a, ll b) { return __gcd(a, b); }\n\ntemplate<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }\ntemplate<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while (1) {\n ll N;\n cin >> N;\n if (!N) return 0;\n\n vector<ll> A(N);\n rep(i, 0, N) cin >> A[i];\n\n vector<ll> C(14);\n rep(i, 0, N) C[A[i]]++;\n vector<ll> ans;\n auto rec = [&](auto&& f, ll cnt, ll sm) {\n if (cnt == N) {\n return true;\n }\n rep(k, 1, 14) {\n if (C[k] and (sm-k) % k == 0) {\n C[k]--;\n if (f(f, cnt+1, sm-k)) {\n ans.pb(k);\n return true;\n }\n C[k]++;\n }\n }\n return false;\n };\n ll total = sum(A);\n rep(k, 1, 14) {\n if (C[k] and (total-k) % k == 0) {\n C[k]--;\n if (rec(rec, 1, total-k)) {\n ans.pb(k);\n break;\n }\n C[k]++;\n }\n }\n if (!ans.empty()) {\n print(ans);\n } else {\n No();\n }\n }\n return 0;\n}","accuracy":1,"time_ms":870,"memory_kb":3168,"score_of_the_acc":-0.9193,"final_rank":12},{"submission_id":"aoj_2026_5093264","code_snippet":"// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing pii = pair<int, int>;\nusing vvl = vector<vector<ll>>;\nusing vvi = vector<vector<int>>;\nusing vvpll = vector<vector<pll>>;\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--)\n#define pb push_back\n#define tostr to_string\n#define ALL(A) A.begin(), A.end()\n// constexpr ll INF = LONG_LONG_MAX;\nconstexpr ll INF = 1e18;\nconstexpr ll MOD = 1000000007;\n\nconst string digits = \"0123456789\";\nconst string ascii_lowercase = \"abcdefghijklmnopqrstuvwxyz\";\nconst string ascii_uppercase = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\n\ntemplate<typename T> vector<vector<T>> list2d(int N, int M, T init) { return vector<vector<T>>(N, vector<T>(M, init)); }\ntemplate<typename T> vector<vector<vector<T>>> list3d(int N, int M, int L, T init) { return vector<vector<vector<T>>>(N, vector<vector<T>>(M, vector<T>(L, init))); }\ntemplate<typename T> vector<vector<vector<vector<T>>>> list4d(int N, int M, int L, int O, T init) { return vector<vector<vector<vector<T>>>>(N, vector<vector<vector<T>>>(M, vector<vector<T>>(L, vector<T>(O, init)))); }\n\nvoid print(ld out) { cout << fixed << setprecision(15) << out << '\\n'; }\nvoid print(double out) { cout << fixed << setprecision(15) << out << '\\n'; }\ntemplate<typename T> void print(T out) { cout << out << '\\n'; }\ntemplate<typename T1, typename T2> void print(pair<T1, T2> out) { cout << out.first << ' ' << out.second << '\\n'; }\ntemplate<typename T> void print(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\\n' : ' '); } }\ntemplate<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }\n\nvoid Yes() { print(\"Yes\"); }\nvoid No() { print(\"No\"); }\nvoid YES() { print(\"YES\"); }\nvoid NO() { print(\"NO\"); }\n\nll floor(ll a, ll b) { if (a < 0) { return (a-b+1) / b; } else { return a / b; } }\nll ceil(ll a, ll b) { if (a >= 0) { return (a+b-1) / b; } else { return a / b; } }\npll divmod(ll a, ll b) { ll d = a / b; ll m = a % b; return {d, m}; }\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\ntemplate<typename T> bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; }\n\ntemplate<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }\ntemplate<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }\ntemplate<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }\n\nll toint(string s) { ll res = 0; for (char c : s) { res *= 10; res += (c - '0'); } return res; }\nint toint(char num) { return num - '0'; }\nchar tochar(int num) { return '0' + num; }\nint ord(char c) { return (int)c; }\nchar chr(int a) { return (char)a; }\n\nll pow(int x, ll n) { ll res = 1; rep(_, 0, n) res *= x; return res; }\nll pow(ll x, ll n, int mod) { ll res = 1; while (n > 0) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; }\n\nint popcount(ll S) { return __builtin_popcountll(S); }\nll gcd(ll a, ll b) { return __gcd(a, b); }\n\ntemplate<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }\ntemplate<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }\n\ntemplate<typename T>\nunordered_map<T, ll> Counter(vector<T> &A) {\n unordered_map<T, ll> res;\n for (T a : A) {\n res[a]++;\n }\n return res;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while (1) {\n ll N;\n cin >> N;\n if (!N) return 0;\n\n vector<ll> A(N);\n rep(i, 0, N) cin >> A[i];\n\n auto C = Counter(A);\n vector<ll> ans;\n auto rec = [&](auto&& f, ll cnt, ll sm) {\n if (cnt == N) {\n return true;\n }\n rep(k, 1, 14) {\n if (C[k] and (sm-k) % k == 0) {\n C[k]--;\n if (f(f, cnt+1, sm-k)) {\n ans.pb(k);\n return true;\n }\n C[k]++;\n }\n }\n return false;\n };\n ll total = sum(A);\n rep(k, 1, 14) {\n if (C[k] and (total-k) % k == 0) {\n C[k]--;\n if (rec(rec, 1, total-k)) {\n ans.pb(k);\n break;\n }\n C[k]++;\n }\n }\n if (!ans.empty()) {\n print(ans);\n } else {\n No();\n }\n }\n return 0;\n}","accuracy":1,"time_ms":3070,"memory_kb":3488,"score_of_the_acc":-1.5629,"final_rank":20},{"submission_id":"aoj_2026_3269166","code_snippet":"#include \"bits/stdc++.h\"\n\n#pragma warning(disable:4996)\nusing namespace std;\n\nset<long long int>aset;\nlong long int ahash(vector<int>&v) {\n\tlong long int k=0;\n\tfor (auto a : v) {\n\t\tk*=5;\n\t\tk+=a;\n\t}\n\treturn k;\n}\nvector<int> solve(vector<int>&v,int rest) {\n\tif (rest == 0)return vector<int>{-1};\n\tauto ha=ahash(v);\n\tif (aset.find(ha) == aset.end()) {\n\t\t//aset.emplace(ha);\n\t}\n\telse {\n\t\treturn vector<int>();\n\t}\n\tfor (int i = 0; i < 13; ++i) {\n\t\tif (rest % (i + 1)==0 && v[i]) {\n\t\t\tv[i]--;\n\t\t\tauto k=solve(v, rest-i-1);\n\t\t\tif(!k.empty()){\n\t\t\t\tk.push_back(i+1);\n\t\t\t\treturn k;\n\t\t\t}\n\t\t\tv[i]++;\n\t\t}\n\t}\n\treturn vector<int>();\n}\n\nint main() {\n\twhile (true) {\n\t\taset.clear();\n\t\tint N;cin>>N;\n\t\tif(!N)break;\n\t\tint sum=0;\n\t\tvector<int>nums(13);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint a;cin>>a;a--;\n\t\t\tsum+=a+1;\n\t\t\tnums[a]++;\n\t\t}\n\t\tvector<int> oks=solve(nums,sum);\n\t\tif (!oks.empty()) {\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tcout<<oks[i+1];\n\t\t\t\tif(i==N-1)cout<<endl;\n\t\t\t\telse cout<<\" \";\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcout<<\"No\"<<endl;\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":980,"memory_kb":3028,"score_of_the_acc":-0.8961,"final_rank":10},{"submission_id":"aoj_2026_3269164","code_snippet":"#include \"bits/stdc++.h\"\n\n#pragma warning(disable:4996)\nusing namespace std;\n\nset<long long int>aset;\nlong long int ahash(vector<int>&v) {\n\tlong long int k=0;\n\tfor (auto a : v) {\n\t\tk*=5;\n\t\tk+=a;\n\t}\n\treturn k;\n}\nvector<int> solve(vector<int>&v,int rest) {\n\tif (rest == 0)return vector<int>{-1};\n\tauto ha=ahash(v);\n\tif (aset.find(ha) == aset.end()) {\n\t\taset.emplace(ha);\n\t}\n\telse {\n\t\treturn vector<int>();\n\t}\n\tfor (int i = 0; i < 13; ++i) {\n\t\tif (rest % (i + 1)==0 && v[i]) {\n\t\t\tv[i]--;\n\t\t\tauto k=solve(v, rest-i-1);\n\t\t\tif(!k.empty()){\n\t\t\t\tk.push_back(i+1);\n\t\t\t\treturn k;\n\t\t\t}\n\t\t\tv[i]++;\n\t\t}\n\t}\n\treturn vector<int>();\n}\n\nint main() {\n\twhile (true) {\n\t\taset.clear();\n\t\tint N;cin>>N;\n\t\tif(!N)break;\n\t\tint sum=0;\n\t\tvector<int>nums(13);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint a;cin>>a;a--;\n\t\t\tsum+=a+1;\n\t\t\tnums[a]++;\n\t\t}\n\t\tvector<int> oks=solve(nums,sum);\n\t\tif (!oks.empty()) {\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tcout<<oks[i+1];\n\t\t\t\tif(i==N-1)cout<<endl;\n\t\t\t\telse cout<<\" \";\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcout<<\"No\"<<endl;\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3288,"score_of_the_acc":-0.7546,"final_rank":6},{"submission_id":"aoj_2026_2554101","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\n\n\nint N;\nbool FLG;\n\nvoid recursive(int cards[14],int log[],int used_num,int sum){\n\n\tif(FLG)return;\n\n\tif(used_num == N){\n\n\t\tFLG = true;\n\n\t\treverse(log,log+N);\n\n\t\tprintf(\"%d\",log[0]);\n\t\tfor(int i = 1; i < N; i++){\n\t\t\tprintf(\" %d\",log[i]);\n\t\t}\n\t\tprintf(\"\\n\");\n\n\t\treturn;\n\t}\n\n\tfor(int i = 1; i <= 13; i++){\n\t\tif(cards[i] > 0 && (used_num == N-1 || (sum-i)%i == 0)){\n\t\t\tint next_cards[14],next_log[N];\n\t\t\tfor(int k = 1; k <= 13; k++){\n\t\t\t\tnext_cards[k] = cards[k];\n\t\t\t}\n\t\t\tnext_cards[i]--;\n\t\t\tfor(int k = 0; k < used_num; k++){\n\t\t\t\tnext_log[k] = log[k];\n\t\t\t}\n\t\t\tnext_log[used_num] = i;\n\n\t\t\trecursive(next_cards,next_log,used_num+1,sum-i);\n\t\t}\n\t}\n}\n\n\nvoid func(){\n\n\tFLG = false;\n\n\tint first[14];\n\tfor(int i = 1; i <= 13; i++){\n\t\tfirst[i] = 0;\n\t}\n\n\tint tmp,sum = 0;\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d\",&tmp);\n\t\tfirst[tmp]++;\n\t\tsum += tmp;\n\t}\n\n\tint log[N];\n\n\trecursive(first,log,0,sum);\n\n\n\tif(!FLG){\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\n\treturn 0;\n}","accuracy":1,"time_ms":830,"memory_kb":3184,"score_of_the_acc":-0.9153,"final_rank":11},{"submission_id":"aoj_2026_2519719","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define r(i,n) for(int i=0;i<n;i++)\nint a[14],n,t;\nint dfs(int s,int x){\n if(x==s)return 1;\n r(i,14)if(a[i]&&(s-x-i)%i==0){\n a[i]--;\n if(dfs(s,x+i)){\n if(x+i!=s)cout<<' ';\n cout<<i;\n return 1;\n }\n a[i]++;\n }\n return 0;\n}\nmain(){\n while(cin>>n,n){\n int sum=0;\n r(i,14)a[i]=0;\n r(i,n){\n cin>>t;\n a[t]++;\n sum+=t;\n }\n if(!dfs(sum,0))cout<<\"No\";\n cout<<endl;\n }\n}","accuracy":1,"time_ms":550,"memory_kb":2924,"score_of_the_acc":-0.7557,"final_rank":7},{"submission_id":"aoj_2026_2280214","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nunordered_map<int,bool> mp;\nint n,a[14],ans[52],c;\n\nint cal(){\n int res=0;\n for(int i=1;i<=13;i++)res=res*5+a[i];\n return res;\n}\n\nbool dfs(int s,int d){\n if(!d)return 1;\n int y=cal();\n if(mp.count(y))return mp[y];\n for(int i=13;i>0;i--){\n if(a[i]&&(s-i)%i==0){\n ans[d-1]=i;\n a[i]--;\n if(dfs(s-i,d-1))return mp[y]=1;\n a[i]++;\n }\n }\n return 0;\n}\n\nint main(){\n while(cin>>n,n){\n memset(a,0,sizeof(a));\n mp.clear();\n c=0;\n for(int i=0,b;i<n;i++)scanf(\"%d\",&b),a[b]++,c+=b;\n if(dfs(c,n)){\n for(int i=0;i<n;i++){\n\tif(i)printf(\" \");\n\tprintf(\"%d\",ans[i]);\n }\n }else printf(\"No\");\n printf(\"\\n\");\n }\n return 0;\n}","accuracy":1,"time_ms":2240,"memory_kb":3136,"score_of_the_acc":-1.2381,"final_rank":19},{"submission_id":"aoj_2026_2280211","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint a[14],b[55],n,f;\nvoid dfs(int s,int k){\n if(f)return;\n if(!s) {\n f=1;\n for(int i=n-1;i>=0;i--) {\n if(i<n-1)cout<<\" \";\n cout<<b[i];\n }\n cout<<endl;\n return;\n }\n for(int i=1;i<14;i++) {\n if(a[i]&&(s-i)%i==0) {\n a[i]--;\n b[k]=i;\n dfs(s-i,k+1);\n a[i]++;\n }\n }\n}\nint main() {\n while(cin>>n&&n){\n memset(a,0,sizeof(a));\n int s=0;\n for(int i=0,x;i<n;i++){\n cin>>x;\n a[x]++;\n s+=x;\n }\n f=0;\n dfs(s,0);\n if(!f)cout<<\"No\"<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":390,"memory_kb":3100,"score_of_the_acc":-0.7795,"final_rank":8},{"submission_id":"aoj_2026_2280205","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nunordered_map<int,bool> mp;\nint n,a[14],ans[52],c;\n\nint cal(){\n int res=0;\n for(int i=1;i<13;i++)res=res*5+a[i];\n return res;\n}\n\nbool dfs(int s,int d){\n if(!d)return 1;\n int y=cal();\n if(mp.count(y))return mp[y];\n for(int i=13;i>0;i--){\n if(a[i]&&(s-i)%i==0){\n ans[d-1]=i;\n a[i]--;\n if(dfs(s-i,d-1))return mp[y]=1;\n a[i]++;\n }\n }\n return 0;\n}\n\nint main(){\n while(cin>>n,n){\n memset(a,0,sizeof(a));\n mp.clear();\n c=0;\n for(int i=0,b;i<n;i++)scanf(\"%d\",&b),a[b]++,c+=b;\n if(dfs(c,n)){\n for(int i=0;i<n;i++){\n\tif(i)printf(\" \");\n\tprintf(\"%d\",ans[i]);\n }\n }else printf(\"No\");\n printf(\"\\n\");\n }\n return 0;\n}","accuracy":1,"time_ms":2150,"memory_kb":3064,"score_of_the_acc":-1.1908,"final_rank":17},{"submission_id":"aoj_2026_2280174","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nunordered_map<int,bool> mp;\nint n,a[14],ans[52],c;\n\nint cal(){\n int res=0;\n for(int i=1;i<13;i++)res=res*5+a[i];\n return res;\n}\n\nbool dfs(int s,int d){\n if(d==n)return 1;\n int y=cal();\n if(mp.count(y))return mp[y];\n for(int i=13;i>0;i--){\n if(a[i]&&(s-i)%i==0){\n ans[d]=i;\n a[i]--;\n if(dfs(s-i,d+1))return mp[y]=1;\n a[i]++;\n }\n }\n return 0;\n}\n\nint main(){\n while(cin>>n,n){\n memset(a,0,sizeof(a));\n mp.clear();\n c=0;\n for(int i=0,b;i<n;i++)scanf(\"%d\",&b),a[b]++,c+=b;\n if(dfs(c,0)){\n for(int i=n-1;i>=0;i--){\n\tif(i!=n-1)printf(\" \");\n\tprintf(\"%d\",ans[i]);\n }\n }else printf(\"No\");\n printf(\"\\n\");\n }\n return 0;\n}","accuracy":1,"time_ms":2160,"memory_kb":3160,"score_of_the_acc":-1.2273,"final_rank":18},{"submission_id":"aoj_2026_2275938","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint N;\n\nint card[14];\nvector<int> res;\n\nbool isvalid( int n,int i){\n if( (n-i) % i == 0 ) return true;\n return false;\n}\n\nbool solve(int n,int cnt){\n if( cnt == 1 ) {\n res.emplace_back( n );\n return true;\n }\n for(int i=13;i>=1;i--){\n if( card[i] == 0 ) continue;\n if( !isvalid(n,i) ) continue;\n card[i]--;\n res.emplace_back( i );\n if( solve( n - i, cnt-1 ) ) return true;\n res.pop_back();\n card[i]++;\n }\n return false;\n}\n\nint main(){\n while( cin >> N && N){\n memset( card,0,sizeof(card) );\n res.clear();\n int sum = 0;\n for(int i=0;i<N;i++){\n int a; cin >> a;\n sum += a;\n card[a]++;\n } \n if( !solve(sum,N) )\n cout << \"No\" << endl;\n else {\n reverse( res.begin(), res.end() );\n for( int i=0;i<res.size();i++){\n if( i ) cout << \" \";\n cout << res[i];\n }\n cout << endl;\n } \n }\n}","accuracy":1,"time_ms":1830,"memory_kb":3032,"score_of_the_acc":-1.1024,"final_rank":16},{"submission_id":"aoj_2026_1896215","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nvi out,in;\nint n;\nbool f(int a,int t){\n\tif(a==0){\n\t\trep(i,n){\n\t\t\tif(i)cout<<\" \";\n\t\t\tcout<<out[n-1-i];\n\t\t}\n\t\tcout<<endl;\n\t\treturn true;\n\t}\n\tloop(i,1,14)if(in[i]&&(a-i)%i==0){\n\t\tin[i]--;\n\t\tout[t]=i;\n\t\tif(f(a-i,t+1))return true;\n\t\tin[i]++;\n\t}\n\treturn false;\n}\nint main(){\n\twhile(cin>>n,n){\n\t\tout=vi(n);\n\t\tin=vi(14);\n\t\tint sum=0;\n\t\trep(i,n){\n\t\t\tint a;cin>>a;\n\t\t\tsum+=a;\n\t\t\tin[a]++;\n\t\t}\n\t\tif(!f(sum,0))cout<<\"No\"<<endl;\n\t}\n}","accuracy":1,"time_ms":700,"memory_kb":1216,"score_of_the_acc":-0.1861,"final_rank":5},{"submission_id":"aoj_2026_1882250","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\nconst int cards = 13;\n \nbool flg;\n \nvoid rec(vector<int> a,int sum,vector<int> &v){\n if(sum == 0){\n\tflg = true;\n\treturn;\n }\n for(int i = 1 ; i <= 13 ; i++){\n\tif(a[i] && sum % i == 0){\n\t v.push_back(i);\n\t a[i]--;\n\t rec(a,sum-i,v);\n\t if(flg) return;\n\t v.pop_back();\n\t a[i]++;\n\t}\n }\n}\n \nint main(){\n int n;\n \n while(cin >> n ,n){\n\tvector<int> a(cards+1,0),v;\n\tint m,sum = 0;\n \n\tfor(int i = 0 ; i < n ; i++){\n\t cin >> m;\n \n\t sum += m;\n\t a[m]++;\n\t}\n \n\tflg = false;\n\trec(a,sum,v);\n \n\tif(flg){\n\t int len = (int)v.size();\n\t reverse(v.begin(),v.end());\n\t for(int i = 0 ; i < len ; i++){\n\t\tif(!i) cout << v[i];\n\t\telse cout << \" \" << v[i];\n\t }\n\t cout << endl;\n\t}\n\telse cout << \"No\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1120,"memory_kb":3056,"score_of_the_acc":-0.9398,"final_rank":13},{"submission_id":"aoj_2026_1352780","code_snippet":"#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 52;\nconst int MAX_C = 13;\n\n/* typedef */\n\n/* global variables */\n\nint n;\nint cs[MAX_C + 1], ans[MAX_N];\n\n/* subroutines */\n\nbool rec(int k, int sum) {\n if (k == n - 1) {\n ans[k] = sum;\n return true;\n }\n \n for (int i = 1; i <= MAX_C; i++)\n if (cs[i] > 0 && sum % i == 0) {\n cs[i]--;\n ans[k] = i;\n if (rec(k + 1, sum - i)) return true;\n cs[i]++;\n }\n\n return false;\n}\n\n/* main */\n\nint main() {\n for (;;) {\n cin >> n;\n if (n == 0) break;\n\n int sum = 0;\n memset(cs, 0, sizeof(cs));\n\n for (int i = 0; i < n; i++) {\n int ci;\n cin >> ci;\n cs[ci]++;\n sum += ci;\n }\n //cout << sum << endl;\n\n if (rec(0, sum)) {\n for (int i = n - 1; i >= 0; i--) {\n\tif (i < n - 1) cout << ' ';\n\tcout << ans[i];\n }\n cout << endl;\n }\n else\n cout << \"No\" << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":490,"memory_kb":1160,"score_of_the_acc":-0.1157,"final_rank":2},{"submission_id":"aoj_2026_1249734","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 \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n \nstatic const double EPS = 1e-8;\n\nvector<char> answer;\n\nbool dfs(int sum,vector<char>& cards,vector<char>& order){\n if(sum == 0){\n reverse(order.begin(),order.end());\n answer = order;\n return true;\n }\n bool res = false;\n\n for(int i = 1; i <= 13; i++){\n if(cards[i] > 0 && (sum - i) % i == 0){\n cards[i]--;\n order.push_back(i);\n res |= dfs(sum - i,cards,order);\n if(res) return true;\n order.pop_back();\n cards[i]++;\n }\n }\n return res;\n}\n\nint main(){\n int num_of_cards;\n while(~scanf(\"%d\",&num_of_cards)){\n if(num_of_cards == 0) break;\n\n vector<char> cards(14);\n int total_rank = 0;\n for(int i = 0; i < num_of_cards; i++){\n int rank;\n scanf(\"%d\",&rank);\n cards[rank]++;\n total_rank += rank;\n }\n vector<char> order;\n bool isok = dfs(total_rank,cards,order);\n bool is_first = true;\n\n if(isok){\n for(int i = 0; i < answer.size(); i++){\n printf(\"%s%d\",is_first ? \"\" : \" \",answer[i]);\n is_first = false;\n }\n printf(\"\\n\");\n }\n else{\n printf(\"No\\n\");\n }\n }\n}","accuracy":1,"time_ms":670,"memory_kb":1228,"score_of_the_acc":-0.1831,"final_rank":4},{"submission_id":"aoj_2026_1175026","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\ninline ll encode(const vector<int> &a){\n ll res = 0;\n for(int i=13;i>=1;i--)res = res*5 + a[i];\n return res;\n}\n\nset<int> memo;\nvector<int> ans;\n\nbool rec(ll sum, vector<int> &rem){\n int a = encode(rem);\n if(a==0)return true;\n if(memo.count(a))return false;\n memo.insert(a);\n\n for(int i=13;i>=1;i--){\n if(rem[i] && sum%i==0){\n rem[i]--;\n ans.push_back(i);\n if(rec(sum - i, rem))return true;\n ans.pop_back();\n rem[i]++;\n }\n }\n return false;\n}\n\nint main(){\n int n;\n while(cin >> n, n){\n vector<int> num(14,0);\n int sum = 0;\n for(int i=0;i<n;i++){\n int tmp;\n cin >> tmp;\n num[tmp]++; sum+=tmp;\n }\n\n memo.clear();\n ans.clear();\n rec(sum,num);\n if((int)ans.size() == n){\n reverse(ans.begin(),ans.end());\n for(int i=0;i<n;i++){\n\tcout << ans[i] << (i==n-1?\"\\n\":\" \");\n }\n }else cout << \"No\" << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":1564,"score_of_the_acc":-0.1433,"final_rank":3},{"submission_id":"aoj_2026_1117470","code_snippet":"#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <ctime>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <numeric>\n#include <utility>\n#include <iomanip>\n#include <algorithm>\n#include <functional>\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vint;\ntypedef vector<long long> vll;\ntypedef pair<int,int> pint;\ntypedef pair<long long, long long> pll;\n\n#define MP make_pair\n#define PB push_back\n#define ALL(s) (s).begin(),(s).end()\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) \n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P) \n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P) \n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) \n{ EACH(it, P) { s << \"<\" << it->first << \"->\" << it->second << \"> \"; } return s; }\n\n\n\nvint res;\nint tot = 0;\nbool solved = false;\n\nvoid rec(vint num, int rem, vint vec) {\n //cout << num << \",,, \" << sum << \";;;; \" << vec << endl;\n \n if (solved) return;\n if (rem == 0) {\n res = vec;\n solved = true;\n return;\n }\n for (int d = 1; d <= 13; ++d) {\n if (num[d] == 0) continue;\n if ( (rem-d) % d != 0 ) continue;\n num[d]--;\n vint nvec = vec; nvec.PB(d);\n rec(num, rem-d, nvec);\n num[d]++;\n }\n}\n\nint main() {\n int n;\n while (cin >> n) {\n if (n == 0) break;\n vector<int> num(14, 0);\n tot = 0;\n for (int i = 0; i < n; ++i) {\n int c; cin >> c; num[c]++;\n tot += c;\n }\n res.clear();\n solved = false;\n vint kara;\n rec(num, tot, kara);\n reverse(ALL(res));\n \n if (res.size() == 0) puts(\"No\");\n else {\n for (int i = 0; i < res.size(); ++i) {\n cout << res[i];\n if (i != res.size()-1) cout << \" \";\n }\n cout << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":4160,"memory_kb":1244,"score_of_the_acc":-1.0298,"final_rank":15},{"submission_id":"aoj_2026_1110493","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<set>\nusing namespace std;\nint pow5[14];\nset<int>S;\nint ans[60];\nint n;\nint solve(int a,int b,int c){\n\tif(a==n)return 1;\n\tif(S.count(b))return 0;\n\tS.insert(b);\n\tfor(int i=0;i<13;i++){\n\t\tif(b%pow5[i+1]/pow5[i]&&c%(i+1)==0){\n\t\t\tans[n-1-a]=i+1;\n\t\t\tif(solve(a+1,b-pow5[i],c-(i+1)))return 1;\n\t\t}\n\t}\n\treturn 0;\n}\nint main(){\n\tpow5[0]=1;\n\tfor(int i=1;i<14;i++)pow5[i]=pow5[i-1]*5;\n\tint a;\n\twhile(scanf(\"%d\",&a),a){\n\t\tn=a;\n\t\tint st=0;\n\t\tint sum=0;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tint p;scanf(\"%d\",&p);\n\t\t\tsum+=p;\n\t\t\tp--;\n\t\t\tst+=pow5[p];\n\t\t}\n\t\tS.clear();\n\t\tint res=solve(0,st,sum);\n\t\tif(res){\n\t\t\tfor(int i=0;i<a;i++){\n\t\t\t\tif(i)printf(\" \");\n\t\t\t\tprintf(\"%d\",ans[i]);\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t}else printf(\"No\\n\");\n\t}\n}","accuracy":1,"time_ms":20,"memory_kb":1292,"score_of_the_acc":-0.0492,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2026_10848967\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\nvector<int> cur;\\n\\nint cnt[14];\\nbool rec(int n, int sum)\\n{\\n if(n == 0)\\n return 1;\\n\\n for(int i = 1; i <= 13; i++){\\n if(cnt[i] != 0 && sum % i == 0){\\n cur.push_back(i);\\n\\n cnt[i]--;\\n if(rec(n - 1, sum - i))\\n return 1;\\n\\n cnt[i]++;\\n cur.pop_back();\\n }\\n }\\n return 0;\\n}\\n\\nint main() {\\n while (1) {\\n int n;\\n cin >> n;\\n\\n if (n == 0)\\n exit(0);\\n\\n int sum = 0;\\n\\n for (int i = 0; i < 14; i++)\\n cnt[i] = 0;\\n\\n for(int i = 0; i < n; i++){\\n int x;\\n cin >> x;\\n\\n cnt[x]++;\\n\\n sum += x;\\n }\\n\\n cur.clear();\\n if(rec(n, sum)) {\\n for (int i = n - 1; i > 0; i--)\\n cout << cur[i] << \\\" \\\";\\n cout << cur[0] << endl;\\n } else\\n cout << \\\"No\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 450,\n \"memory_kb\": 3296,\n \"score_of_the_acc\": -0.8635,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2026_9099876\",\n \"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<int> c(13);\\n int sum = 0;\\n for (int i = 0; i < n; i++) {\\n int a;\\n cin >> a;\\n sum += a;\\n c[a - 1] += 1;\\n }\\n vector<int> res;\\n set<vector<int>> used;\\n auto slv = [&](auto self, int rem) -> bool {\\n if (rem == 0) return true;\\n if (used.find(c) != used.end()) return false;\\n used.insert(c);\\n for (int i = 0; i < 13; i++) {\\n if (c[i] and rem % (i + 1) == 0) {\\n c[i] -= 1;\\n res.push_back(i + 1);\\n if (self(self, rem - (i + 1))) return true;\\n res.pop_back();\\n c[i] += 1;\\n }\\n }\\n return false;\\n };\\n if (slv(slv, sum)) {\\n reverse(res.begin(), res.end());\\n for (int i = 0; i < res.size(); i++) {\\n if (i) cout << \\\" \\\";\\n cout << res[i];\\n }\\n cout << \\\"\\\\n\\\";\\n } else {\\n cout << \\\"No\\\\n\\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3980,\n \"score_of_the_acc\": -1.0024,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2026_5093274\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing pll = pair<ll, ll>;\\nusing pii = pair<int, int>;\\nusing vvl = vector<vector<ll>>;\\nusing vvi = vector<vector<int>>;\\nusing vvpll = vector<vector<pll>>;\\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--)\\n#define pb push_back\\n#define tostr to_string\\n#define ALL(A) A.begin(), A.end()\\n// constexpr ll INF = LONG_LONG_MAX;\\nconstexpr ll INF = 1e18;\\nconstexpr ll MOD = 1000000007;\\n\\nconst string digits = \\\"0123456789\\\";\\nconst string ascii_lowercase = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string ascii_uppercase = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\\n\\ntemplate<typename T> vector<vector<T>> list2d(int N, int M, T init) { return vector<vector<T>>(N, vector<T>(M, init)); }\\ntemplate<typename T> vector<vector<vector<T>>> list3d(int N, int M, int L, T init) { return vector<vector<vector<T>>>(N, vector<vector<T>>(M, vector<T>(L, init))); }\\ntemplate<typename T> vector<vector<vector<vector<T>>>> list4d(int N, int M, int L, int O, T init) { return vector<vector<vector<vector<T>>>>(N, vector<vector<vector<T>>>(M, vector<vector<T>>(L, vector<T>(O, init)))); }\\n\\nvoid print(ld out) { cout << fixed << setprecision(15) << out << '\\\\n'; }\\nvoid print(double out) { cout << fixed << setprecision(15) << out << '\\\\n'; }\\ntemplate<typename T> void print(T out) { cout << out << '\\\\n'; }\\ntemplate<typename T1, typename T2> void print(pair<T1, T2> out) { cout << out.first << ' ' << out.second << '\\\\n'; }\\ntemplate<typename T> void print(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\\\\n' : ' '); } }\\ntemplate<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }\\n\\nvoid Yes() { print(\\\"Yes\\\"); }\\nvoid No() { print(\\\"No\\\"); }\\nvoid YES() { print(\\\"YES\\\"); }\\nvoid NO() { print(\\\"NO\\\"); }\\n\\nll floor(ll a, ll b) { if (a < 0) { return (a-b+1) / b; } else { return a / b; } }\\nll ceil(ll a, ll b) { if (a >= 0) { return (a+b-1) / b; } else { return a / b; } }\\npll divmod(ll a, ll b) { ll d = a / b; ll m = a % b; return {d, m}; }\\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\\ntemplate<typename T> bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; }\\n\\ntemplate<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }\\ntemplate<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }\\ntemplate<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }\\n\\nll toint(string s) { ll res = 0; for (char c : s) { res *= 10; res += (c - '0'); } return res; }\\nint toint(char num) { return num - '0'; }\\nchar tochar(int num) { return '0' + num; }\\nint ord(char c) { return (int)c; }\\nchar chr(int a) { return (char)a; }\\n\\nll pow(int x, ll n) { ll res = 1; rep(_, 0, n) res *= x; return res; }\\nll pow(ll x, ll n, int mod) { ll res = 1; while (n > 0) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; }\\n\\nint popcount(ll S) { return __builtin_popcountll(S); }\\nll gcd(ll a, ll b) { return __gcd(a, b); }\\n\\ntemplate<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }\\ntemplate<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n while (1) {\\n ll N;\\n cin >> N;\\n if (!N) return 0;\\n\\n vector<ll> A(N);\\n rep(i, 0, N) cin >> A[i];\\n\\n vector<ll> C(14);\\n rep(i, 0, N) C[A[i]]++;\\n vector<ll> ans;\\n auto rec = [&](auto&& f, ll cnt, ll sm) {\\n if (cnt == N) {\\n return true;\\n }\\n rep(k, 1, 14) {\\n if (C[k] and (sm-k) % k == 0) {\\n C[k]--;\\n if (f(f, cnt+1, sm-k)) {\\n ans.pb(k);\\n return true;\\n }\\n C[k]++;\\n }\\n }\\n return false;\\n };\\n ll total = sum(A);\\n rep(k, 1, 14) {\\n if (C[k] and (total-k) % k == 0) {\\n C[k]--;\\n if (rec(rec, 1, total-k)) {\\n ans.pb(k);\\n break;\\n }\\n C[k]++;\\n }\\n }\\n if (!ans.empty()) {\\n print(ans);\\n } else {\\n No();\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 870,\n \"memory_kb\": 3168,\n \"score_of_the_acc\": -0.9193,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2026_5093264\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing pll = pair<ll, ll>;\\nusing pii = pair<int, int>;\\nusing vvl = vector<vector<ll>>;\\nusing vvi = vector<vector<int>>;\\nusing vvpll = vector<vector<pll>>;\\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--)\\n#define pb push_back\\n#define tostr to_string\\n#define ALL(A) A.begin(), A.end()\\n// constexpr ll INF = LONG_LONG_MAX;\\nconstexpr ll INF = 1e18;\\nconstexpr ll MOD = 1000000007;\\n\\nconst string digits = \\\"0123456789\\\";\\nconst string ascii_lowercase = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string ascii_uppercase = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\\n\\ntemplate<typename T> vector<vector<T>> list2d(int N, int M, T init) { return vector<vector<T>>(N, vector<T>(M, init)); }\\ntemplate<typename T> vector<vector<vector<T>>> list3d(int N, int M, int L, T init) { return vector<vector<vector<T>>>(N, vector<vector<T>>(M, vector<T>(L, init))); }\\ntemplate<typename T> vector<vector<vector<vector<T>>>> list4d(int N, int M, int L, int O, T init) { return vector<vector<vector<vector<T>>>>(N, vector<vector<vector<T>>>(M, vector<vector<T>>(L, vector<T>(O, init)))); }\\n\\nvoid print(ld out) { cout << fixed << setprecision(15) << out << '\\\\n'; }\\nvoid print(double out) { cout << fixed << setprecision(15) << out << '\\\\n'; }\\ntemplate<typename T> void print(T out) { cout << out << '\\\\n'; }\\ntemplate<typename T1, typename T2> void print(pair<T1, T2> out) { cout << out.first << ' ' << out.second << '\\\\n'; }\\ntemplate<typename T> void print(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\\\\n' : ' '); } }\\ntemplate<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }\\n\\nvoid Yes() { print(\\\"Yes\\\"); }\\nvoid No() { print(\\\"No\\\"); }\\nvoid YES() { print(\\\"YES\\\"); }\\nvoid NO() { print(\\\"NO\\\"); }\\n\\nll floor(ll a, ll b) { if (a < 0) { return (a-b+1) / b; } else { return a / b; } }\\nll ceil(ll a, ll b) { if (a >= 0) { return (a+b-1) / b; } else { return a / b; } }\\npll divmod(ll a, ll b) { ll d = a / b; ll m = a % b; return {d, m}; }\\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\\ntemplate<typename T> bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; }\\n\\ntemplate<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }\\ntemplate<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }\\ntemplate<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }\\n\\nll toint(string s) { ll res = 0; for (char c : s) { res *= 10; res += (c - '0'); } return res; }\\nint toint(char num) { return num - '0'; }\\nchar tochar(int num) { return '0' + num; }\\nint ord(char c) { return (int)c; }\\nchar chr(int a) { return (char)a; }\\n\\nll pow(int x, ll n) { ll res = 1; rep(_, 0, n) res *= x; return res; }\\nll pow(ll x, ll n, int mod) { ll res = 1; while (n > 0) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; }\\n\\nint popcount(ll S) { return __builtin_popcountll(S); }\\nll gcd(ll a, ll b) { return __gcd(a, b); }\\n\\ntemplate<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }\\ntemplate<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }\\n\\ntemplate<typename T>\\nunordered_map<T, ll> Counter(vector<T> &A) {\\n unordered_map<T, ll> res;\\n for (T a : A) {\\n res[a]++;\\n }\\n return res;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n while (1) {\\n ll N;\\n cin >> N;\\n if (!N) return 0;\\n\\n vector<ll> A(N);\\n rep(i, 0, N) cin >> A[i];\\n\\n auto C = Counter(A);\\n vector<ll> ans;\\n auto rec = [&](auto&& f, ll cnt, ll sm) {\\n if (cnt == N) {\\n return true;\\n }\\n rep(k, 1, 14) {\\n if (C[k] and (sm-k) % k == 0) {\\n C[k]--;\\n if (f(f, cnt+1, sm-k)) {\\n ans.pb(k);\\n return true;\\n }\\n C[k]++;\\n }\\n }\\n return false;\\n };\\n ll total = sum(A);\\n rep(k, 1, 14) {\\n if (C[k] and (total-k) % k == 0) {\\n C[k]--;\\n if (rec(rec, 1, total-k)) {\\n ans.pb(k);\\n break;\\n }\\n C[k]++;\\n }\\n }\\n if (!ans.empty()) {\\n print(ans);\\n } else {\\n No();\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3070,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -1.5629,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2026_3269166\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\n#pragma warning(disable:4996)\\nusing namespace std;\\n\\nset<long long int>aset;\\nlong long int ahash(vector<int>&v) {\\n\\tlong long int k=0;\\n\\tfor (auto a : v) {\\n\\t\\tk*=5;\\n\\t\\tk+=a;\\n\\t}\\n\\treturn k;\\n}\\nvector<int> solve(vector<int>&v,int rest) {\\n\\tif (rest == 0)return vector<int>{-1};\\n\\tauto ha=ahash(v);\\n\\tif (aset.find(ha) == aset.end()) {\\n\\t\\t//aset.emplace(ha);\\n\\t}\\n\\telse {\\n\\t\\treturn vector<int>();\\n\\t}\\n\\tfor (int i = 0; i < 13; ++i) {\\n\\t\\tif (rest % (i + 1)==0 && v[i]) {\\n\\t\\t\\tv[i]--;\\n\\t\\t\\tauto k=solve(v, rest-i-1);\\n\\t\\t\\tif(!k.empty()){\\n\\t\\t\\t\\tk.push_back(i+1);\\n\\t\\t\\t\\treturn k;\\n\\t\\t\\t}\\n\\t\\t\\tv[i]++;\\n\\t\\t}\\n\\t}\\n\\treturn vector<int>();\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\taset.clear();\\n\\t\\tint N;cin>>N;\\n\\t\\tif(!N)break;\\n\\t\\tint sum=0;\\n\\t\\tvector<int>nums(13);\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tint a;cin>>a;a--;\\n\\t\\t\\tsum+=a+1;\\n\\t\\t\\tnums[a]++;\\n\\t\\t}\\n\\t\\tvector<int> oks=solve(nums,sum);\\n\\t\\tif (!oks.empty()) {\\n\\t\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\t\\tcout<<oks[i+1];\\n\\t\\t\\t\\tif(i==N-1)cout<<endl;\\n\\t\\t\\t\\telse cout<<\\\" \\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcout<<\\\"No\\\"<<endl;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 980,\n \"memory_kb\": 3028,\n \"score_of_the_acc\": -0.8961,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2026_3269164\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\n#pragma warning(disable:4996)\\nusing namespace std;\\n\\nset<long long int>aset;\\nlong long int ahash(vector<int>&v) {\\n\\tlong long int k=0;\\n\\tfor (auto a : v) {\\n\\t\\tk*=5;\\n\\t\\tk+=a;\\n\\t}\\n\\treturn k;\\n}\\nvector<int> solve(vector<int>&v,int rest) {\\n\\tif (rest == 0)return vector<int>{-1};\\n\\tauto ha=ahash(v);\\n\\tif (aset.find(ha) == aset.end()) {\\n\\t\\taset.emplace(ha);\\n\\t}\\n\\telse {\\n\\t\\treturn vector<int>();\\n\\t}\\n\\tfor (int i = 0; i < 13; ++i) {\\n\\t\\tif (rest % (i + 1)==0 && v[i]) {\\n\\t\\t\\tv[i]--;\\n\\t\\t\\tauto k=solve(v, rest-i-1);\\n\\t\\t\\tif(!k.empty()){\\n\\t\\t\\t\\tk.push_back(i+1);\\n\\t\\t\\t\\treturn k;\\n\\t\\t\\t}\\n\\t\\t\\tv[i]++;\\n\\t\\t}\\n\\t}\\n\\treturn vector<int>();\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\taset.clear();\\n\\t\\tint N;cin>>N;\\n\\t\\tif(!N)break;\\n\\t\\tint sum=0;\\n\\t\\tvector<int>nums(13);\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tint a;cin>>a;a--;\\n\\t\\t\\tsum+=a+1;\\n\\t\\t\\tnums[a]++;\\n\\t\\t}\\n\\t\\tvector<int> oks=solve(nums,sum);\\n\\t\\tif (!oks.empty()) {\\n\\t\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\t\\tcout<<oks[i+1];\\n\\t\\t\\t\\tif(i==N-1)cout<<endl;\\n\\t\\t\\t\\telse cout<<\\\" \\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcout<<\\\"No\\\"<<endl;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3288,\n \"score_of_the_acc\": -0.7546,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2026_2554101\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\nint N;\\nbool FLG;\\n\\nvoid recursive(int cards[14],int log[],int used_num,int sum){\\n\\n\\tif(FLG)return;\\n\\n\\tif(used_num == N){\\n\\n\\t\\tFLG = true;\\n\\n\\t\\treverse(log,log+N);\\n\\n\\t\\tprintf(\\\"%d\\\",log[0]);\\n\\t\\tfor(int i = 1; i < N; i++){\\n\\t\\t\\tprintf(\\\" %d\\\",log[i]);\\n\\t\\t}\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\n\\t\\treturn;\\n\\t}\\n\\n\\tfor(int i = 1; i <= 13; i++){\\n\\t\\tif(cards[i] > 0 && (used_num == N-1 || (sum-i)%i == 0)){\\n\\t\\t\\tint next_cards[14],next_log[N];\\n\\t\\t\\tfor(int k = 1; k <= 13; k++){\\n\\t\\t\\t\\tnext_cards[k] = cards[k];\\n\\t\\t\\t}\\n\\t\\t\\tnext_cards[i]--;\\n\\t\\t\\tfor(int k = 0; k < used_num; k++){\\n\\t\\t\\t\\tnext_log[k] = log[k];\\n\\t\\t\\t}\\n\\t\\t\\tnext_log[used_num] = i;\\n\\n\\t\\t\\trecursive(next_cards,next_log,used_num+1,sum-i);\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nvoid func(){\\n\\n\\tFLG = false;\\n\\n\\tint first[14];\\n\\tfor(int i = 1; i <= 13; i++){\\n\\t\\tfirst[i] = 0;\\n\\t}\\n\\n\\tint tmp,sum = 0;\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%d\\\",&tmp);\\n\\t\\tfirst[tmp]++;\\n\\t\\tsum += tmp;\\n\\t}\\n\\n\\tint log[N];\\n\\n\\trecursive(first,log,0,sum);\\n\\n\\n\\tif(!FLG){\\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\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 830,\n \"memory_kb\": 3184,\n \"score_of_the_acc\": -0.9153,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2026_2519719\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define r(i,n) for(int i=0;i<n;i++)\\nint a[14],n,t;\\nint dfs(int s,int x){\\n if(x==s)return 1;\\n r(i,14)if(a[i]&&(s-x-i)%i==0){\\n a[i]--;\\n if(dfs(s,x+i)){\\n if(x+i!=s)cout<<' ';\\n cout<<i;\\n return 1;\\n }\\n a[i]++;\\n }\\n return 0;\\n}\\nmain(){\\n while(cin>>n,n){\\n int sum=0;\\n r(i,14)a[i]=0;\\n r(i,n){\\n cin>>t;\\n a[t]++;\\n sum+=t;\\n }\\n if(!dfs(sum,0))cout<<\\\"No\\\";\\n cout<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 550,\n \"memory_kb\": 2924,\n \"score_of_the_acc\": -0.7557,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2026_2280214\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nunordered_map<int,bool> mp;\\nint n,a[14],ans[52],c;\\n\\nint cal(){\\n int res=0;\\n for(int i=1;i<=13;i++)res=res*5+a[i];\\n return res;\\n}\\n\\nbool dfs(int s,int d){\\n if(!d)return 1;\\n int y=cal();\\n if(mp.count(y))return mp[y];\\n for(int i=13;i>0;i--){\\n if(a[i]&&(s-i)%i==0){\\n ans[d-1]=i;\\n a[i]--;\\n if(dfs(s-i,d-1))return mp[y]=1;\\n a[i]++;\\n }\\n }\\n return 0;\\n}\\n\\nint main(){\\n while(cin>>n,n){\\n memset(a,0,sizeof(a));\\n mp.clear();\\n c=0;\\n for(int i=0,b;i<n;i++)scanf(\\\"%d\\\",&b),a[b]++,c+=b;\\n if(dfs(c,n)){\\n for(int i=0;i<n;i++){\\n\\tif(i)printf(\\\" \\\");\\n\\tprintf(\\\"%d\\\",ans[i]);\\n }\\n }else printf(\\\"No\\\");\\n printf(\\\"\\\\n\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2240,\n \"memory_kb\": 3136,\n \"score_of_the_acc\": -1.2381,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2026_2280211\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint a[14],b[55],n,f;\\nvoid dfs(int s,int k){\\n if(f)return;\\n if(!s) {\\n f=1;\\n for(int i=n-1;i>=0;i--) {\\n if(i<n-1)cout<<\\\" \\\";\\n cout<<b[i];\\n }\\n cout<<endl;\\n return;\\n }\\n for(int i=1;i<14;i++) {\\n if(a[i]&&(s-i)%i==0) {\\n a[i]--;\\n b[k]=i;\\n dfs(s-i,k+1);\\n a[i]++;\\n }\\n }\\n}\\nint main() {\\n while(cin>>n&&n){\\n memset(a,0,sizeof(a));\\n int s=0;\\n for(int i=0,x;i<n;i++){\\n cin>>x;\\n a[x]++;\\n s+=x;\\n }\\n f=0;\\n dfs(s,0);\\n if(!f)cout<<\\\"No\\\"<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 3100,\n \"score_of_the_acc\": -0.7795,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2026_2280205\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nunordered_map<int,bool> mp;\\nint n,a[14],ans[52],c;\\n\\nint cal(){\\n int res=0;\\n for(int i=1;i<13;i++)res=res*5+a[i];\\n return res;\\n}\\n\\nbool dfs(int s,int d){\\n if(!d)return 1;\\n int y=cal();\\n if(mp.count(y))return mp[y];\\n for(int i=13;i>0;i--){\\n if(a[i]&&(s-i)%i==0){\\n ans[d-1]=i;\\n a[i]--;\\n if(dfs(s-i,d-1))return mp[y]=1;\\n a[i]++;\\n }\\n }\\n return 0;\\n}\\n\\nint main(){\\n while(cin>>n,n){\\n memset(a,0,sizeof(a));\\n mp.clear();\\n c=0;\\n for(int i=0,b;i<n;i++)scanf(\\\"%d\\\",&b),a[b]++,c+=b;\\n if(dfs(c,n)){\\n for(int i=0;i<n;i++){\\n\\tif(i)printf(\\\" \\\");\\n\\tprintf(\\\"%d\\\",ans[i]);\\n }\\n }else printf(\\\"No\\\");\\n printf(\\\"\\\\n\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2150,\n \"memory_kb\": 3064,\n \"score_of_the_acc\": -1.1908,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2026_2280174\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nunordered_map<int,bool> mp;\\nint n,a[14],ans[52],c;\\n\\nint cal(){\\n int res=0;\\n for(int i=1;i<13;i++)res=res*5+a[i];\\n return res;\\n}\\n\\nbool dfs(int s,int d){\\n if(d==n)return 1;\\n int y=cal();\\n if(mp.count(y))return mp[y];\\n for(int i=13;i>0;i--){\\n if(a[i]&&(s-i)%i==0){\\n ans[d]=i;\\n a[i]--;\\n if(dfs(s-i,d+1))return mp[y]=1;\\n a[i]++;\\n }\\n }\\n return 0;\\n}\\n\\nint main(){\\n while(cin>>n,n){\\n memset(a,0,sizeof(a));\\n mp.clear();\\n c=0;\\n for(int i=0,b;i<n;i++)scanf(\\\"%d\\\",&b),a[b]++,c+=b;\\n if(dfs(c,0)){\\n for(int i=n-1;i>=0;i--){\\n\\tif(i!=n-1)printf(\\\" \\\");\\n\\tprintf(\\\"%d\\\",ans[i]);\\n }\\n }else printf(\\\"No\\\");\\n printf(\\\"\\\\n\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2160,\n \"memory_kb\": 3160,\n \"score_of_the_acc\": -1.2273,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2026_2275938\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint N;\\n\\nint card[14];\\nvector<int> res;\\n\\nbool isvalid( int n,int i){\\n if( (n-i) % i == 0 ) return true;\\n return false;\\n}\\n\\nbool solve(int n,int cnt){\\n if( cnt == 1 ) {\\n res.emplace_back( n );\\n return true;\\n }\\n for(int i=13;i>=1;i--){\\n if( card[i] == 0 ) continue;\\n if( !isvalid(n,i) ) continue;\\n card[i]--;\\n res.emplace_back( i );\\n if( solve( n - i, cnt-1 ) ) return true;\\n res.pop_back();\\n card[i]++;\\n }\\n return false;\\n}\\n\\nint main(){\\n while( cin >> N && N){\\n memset( card,0,sizeof(card) );\\n res.clear();\\n int sum = 0;\\n for(int i=0;i<N;i++){\\n int a; cin >> a;\\n sum += a;\\n card[a]++;\\n } \\n if( !solve(sum,N) )\\n cout << \\\"No\\\" << endl;\\n else {\\n reverse( res.begin(), res.end() );\\n for( int i=0;i<res.size();i++){\\n if( i ) cout << \\\" \\\";\\n cout << res[i];\\n }\\n cout << endl;\\n } \\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1830,\n \"memory_kb\": 3032,\n \"score_of_the_acc\": -1.1024,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2026_1896215\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef pair<int,pii> pip;\\ntypedef vector<pip>vip;\\nconst double PI=acos(-1);\\nconst double EPS=1e-8;\\nconst int inf=1e8;\\nvi out,in;\\nint n;\\nbool f(int a,int t){\\n\\tif(a==0){\\n\\t\\trep(i,n){\\n\\t\\t\\tif(i)cout<<\\\" \\\";\\n\\t\\t\\tcout<<out[n-1-i];\\n\\t\\t}\\n\\t\\tcout<<endl;\\n\\t\\treturn true;\\n\\t}\\n\\tloop(i,1,14)if(in[i]&&(a-i)%i==0){\\n\\t\\tin[i]--;\\n\\t\\tout[t]=i;\\n\\t\\tif(f(a-i,t+1))return true;\\n\\t\\tin[i]++;\\n\\t}\\n\\treturn false;\\n}\\nint main(){\\n\\twhile(cin>>n,n){\\n\\t\\tout=vi(n);\\n\\t\\tin=vi(14);\\n\\t\\tint sum=0;\\n\\t\\trep(i,n){\\n\\t\\t\\tint a;cin>>a;\\n\\t\\t\\tsum+=a;\\n\\t\\t\\tin[a]++;\\n\\t\\t}\\n\\t\\tif(!f(sum,0))cout<<\\\"No\\\"<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 1216,\n \"score_of_the_acc\": -0.1861,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2026_1882250\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n\\nusing namespace std;\\n\\nconst int cards = 13;\\n \\nbool flg;\\n \\nvoid rec(vector<int> a,int sum,vector<int> &v){\\n if(sum == 0){\\n\\tflg = true;\\n\\treturn;\\n }\\n for(int i = 1 ; i <= 13 ; i++){\\n\\tif(a[i] && sum % i == 0){\\n\\t v.push_back(i);\\n\\t a[i]--;\\n\\t rec(a,sum-i,v);\\n\\t if(flg) return;\\n\\t v.pop_back();\\n\\t a[i]++;\\n\\t}\\n }\\n}\\n \\nint main(){\\n int n;\\n \\n while(cin >> n ,n){\\n\\tvector<int> a(cards+1,0),v;\\n\\tint m,sum = 0;\\n \\n\\tfor(int i = 0 ; i < n ; i++){\\n\\t cin >> m;\\n \\n\\t sum += m;\\n\\t a[m]++;\\n\\t}\\n \\n\\tflg = false;\\n\\trec(a,sum,v);\\n \\n\\tif(flg){\\n\\t int len = (int)v.size();\\n\\t reverse(v.begin(),v.end());\\n\\t for(int i = 0 ; i < len ; i++){\\n\\t\\tif(!i) cout << v[i];\\n\\t\\telse cout << \\\" \\\" << v[i];\\n\\t }\\n\\t cout << endl;\\n\\t}\\n\\telse cout << \\\"No\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1120,\n \"memory_kb\": 3056,\n \"score_of_the_acc\": -0.9398,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2026_1352780\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 52;\\nconst int MAX_C = 13;\\n\\n/* typedef */\\n\\n/* global variables */\\n\\nint n;\\nint cs[MAX_C + 1], ans[MAX_N];\\n\\n/* subroutines */\\n\\nbool rec(int k, int sum) {\\n if (k == n - 1) {\\n ans[k] = sum;\\n return true;\\n }\\n \\n for (int i = 1; i <= MAX_C; i++)\\n if (cs[i] > 0 && sum % i == 0) {\\n cs[i]--;\\n ans[k] = i;\\n if (rec(k + 1, sum - i)) return true;\\n cs[i]++;\\n }\\n\\n return false;\\n}\\n\\n/* main */\\n\\nint main() {\\n for (;;) {\\n cin >> n;\\n if (n == 0) break;\\n\\n int sum = 0;\\n memset(cs, 0, sizeof(cs));\\n\\n for (int i = 0; i < n; i++) {\\n int ci;\\n cin >> ci;\\n cs[ci]++;\\n sum += ci;\\n }\\n //cout << sum << endl;\\n\\n if (rec(0, sum)) {\\n for (int i = n - 1; i >= 0; i--) {\\n\\tif (i < n - 1) cout << ' ';\\n\\tcout << ans[i];\\n }\\n cout << endl;\\n }\\n else\\n cout << \\\"No\\\" << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 490,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": -0.1157,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2026_1249734\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <cstdio>\\n#include <iostream>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P > PP;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n \\nstatic const double EPS = 1e-8;\\n\\nvector<char> answer;\\n\\nbool dfs(int sum,vector<char>& cards,vector<char>& order){\\n if(sum == 0){\\n reverse(order.begin(),order.end());\\n answer = order;\\n return true;\\n }\\n bool res = false;\\n\\n for(int i = 1; i <= 13; i++){\\n if(cards[i] > 0 && (sum - i) % i == 0){\\n cards[i]--;\\n order.push_back(i);\\n res |= dfs(sum - i,cards,order);\\n if(res) return true;\\n order.pop_back();\\n cards[i]++;\\n }\\n }\\n return res;\\n}\\n\\nint main(){\\n int num_of_cards;\\n while(~scanf(\\\"%d\\\",&num_of_cards)){\\n if(num_of_cards == 0) break;\\n\\n vector<char> cards(14);\\n int total_rank = 0;\\n for(int i = 0; i < num_of_cards; i++){\\n int rank;\\n scanf(\\\"%d\\\",&rank);\\n cards[rank]++;\\n total_rank += rank;\\n }\\n vector<char> order;\\n bool isok = dfs(total_rank,cards,order);\\n bool is_first = true;\\n\\n if(isok){\\n for(int i = 0; i < answer.size(); i++){\\n printf(\\\"%s%d\\\",is_first ? \\\"\\\" : \\\" \\\",answer[i]);\\n is_first = false;\\n }\\n printf(\\\"\\\\n\\\");\\n }\\n else{\\n printf(\\\"No\\\\n\\\");\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 670,\n \"memory_kb\": 1228,\n \"score_of_the_acc\": -0.1831,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2026_1175026\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\ninline ll encode(const vector<int> &a){\\n ll res = 0;\\n for(int i=13;i>=1;i--)res = res*5 + a[i];\\n return res;\\n}\\n\\nset<int> memo;\\nvector<int> ans;\\n\\nbool rec(ll sum, vector<int> &rem){\\n int a = encode(rem);\\n if(a==0)return true;\\n if(memo.count(a))return false;\\n memo.insert(a);\\n\\n for(int i=13;i>=1;i--){\\n if(rem[i] && sum%i==0){\\n rem[i]--;\\n ans.push_back(i);\\n if(rec(sum - i, rem))return true;\\n ans.pop_back();\\n rem[i]++;\\n }\\n }\\n return false;\\n}\\n\\nint main(){\\n int n;\\n while(cin >> n, n){\\n vector<int> num(14,0);\\n int sum = 0;\\n for(int i=0;i<n;i++){\\n int tmp;\\n cin >> tmp;\\n num[tmp]++; sum+=tmp;\\n }\\n\\n memo.clear();\\n ans.clear();\\n rec(sum,num);\\n if((int)ans.size() == n){\\n reverse(ans.begin(),ans.end());\\n for(int i=0;i<n;i++){\\n\\tcout << ans[i] << (i==n-1?\\\"\\\\n\\\":\\\" \\\");\\n }\\n }else cout << \\\"No\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1564,\n \"score_of_the_acc\": -0.1433,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2026_1117470\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <ctime>\\n#include <cstring>\\n#include <string>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <numeric>\\n#include <utility>\\n#include <iomanip>\\n#include <algorithm>\\n#include <functional>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vint;\\ntypedef vector<long long> vll;\\ntypedef pair<int,int> pint;\\ntypedef pair<long long, long long> pll;\\n\\n#define MP make_pair\\n#define PB push_back\\n#define ALL(s) (s).begin(),(s).end()\\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) \\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P) \\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P) \\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) \\n{ EACH(it, P) { s << \\\"<\\\" << it->first << \\\"->\\\" << it->second << \\\"> \\\"; } return s; }\\n\\n\\n\\nvint res;\\nint tot = 0;\\nbool solved = false;\\n\\nvoid rec(vint num, int rem, vint vec) {\\n //cout << num << \\\",,, \\\" << sum << \\\";;;; \\\" << vec << endl;\\n \\n if (solved) return;\\n if (rem == 0) {\\n res = vec;\\n solved = true;\\n return;\\n }\\n for (int d = 1; d <= 13; ++d) {\\n if (num[d] == 0) continue;\\n if ( (rem-d) % d != 0 ) continue;\\n num[d]--;\\n vint nvec = vec; nvec.PB(d);\\n rec(num, rem-d, nvec);\\n num[d]++;\\n }\\n}\\n\\nint main() {\\n int n;\\n while (cin >> n) {\\n if (n == 0) break;\\n vector<int> num(14, 0);\\n tot = 0;\\n for (int i = 0; i < n; ++i) {\\n int c; cin >> c; num[c]++;\\n tot += c;\\n }\\n res.clear();\\n solved = false;\\n vint kara;\\n rec(num, tot, kara);\\n reverse(ALL(res));\\n \\n if (res.size() == 0) puts(\\\"No\\\");\\n else {\\n for (int i = 0; i < res.size(); ++i) {\\n cout << res[i];\\n if (i != res.size()-1) cout << \\\" \\\";\\n }\\n cout << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4160,\n \"memory_kb\": 1244,\n \"score_of_the_acc\": -1.0298,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2026_1110493\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<set>\\nusing namespace std;\\nint pow5[14];\\nset<int>S;\\nint ans[60];\\nint n;\\nint solve(int a,int b,int c){\\n\\tif(a==n)return 1;\\n\\tif(S.count(b))return 0;\\n\\tS.insert(b);\\n\\tfor(int i=0;i<13;i++){\\n\\t\\tif(b%pow5[i+1]/pow5[i]&&c%(i+1)==0){\\n\\t\\t\\tans[n-1-a]=i+1;\\n\\t\\t\\tif(solve(a+1,b-pow5[i],c-(i+1)))return 1;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\\nint main(){\\n\\tpow5[0]=1;\\n\\tfor(int i=1;i<14;i++)pow5[i]=pow5[i-1]*5;\\n\\tint a;\\n\\twhile(scanf(\\\"%d\\\",&a),a){\\n\\t\\tn=a;\\n\\t\\tint st=0;\\n\\t\\tint sum=0;\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tint p;scanf(\\\"%d\\\",&p);\\n\\t\\t\\tsum+=p;\\n\\t\\t\\tp--;\\n\\t\\t\\tst+=pow5[p];\\n\\t\\t}\\n\\t\\tS.clear();\\n\\t\\tint res=solve(0,st,sum);\\n\\t\\tif(res){\\n\\t\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\t\\tif(i)printf(\\\" \\\");\\n\\t\\t\\t\\tprintf(\\\"%d\\\",ans[i]);\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t}else printf(\\\"No\\\\n\\\");\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1292,\n \"score_of_the_acc\": -0.0492,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1064,"cells":{"group_id":{"kind":"string","value":"aoj_2028_cpp"},"problem_description":{"kind":"string","value":"Problem G:\nGather on the Clock\nThere is a self-playing game called\nGather on the Clock\n.\nAt the beginning of a game, a number of cards are placed on a ring. Each card is labeled by a\nvalue.\nIn each step of a game, you pick up any one of the cards on the ring and put it on the next one\nin clockwise order. You will gain the score by the difference of the two values. You should deal\nwith the two cards as one card in the later steps. You repeat this step until only one card is left\non the ring, and the score of the game is the sum of the gained scores.\nYour task is to write a program that calculates the maximum score for the given initial state,\nwhich specifies the values of cards and their placements on the ring.\nThe figure shown below is an example, in which the initial state is illustrated on the left, and\nthe subsequent states to the right. The picked cards are 1, 3 and 3, respectively, and the score\nof this game is 6.\nFigure 6: An illustrative play of Gather on the Clock\nInput\nThe input consists of multiple test cases. The first line contains the number of cases. For each\ncase, a line describing a state follows. The line begins with an integer\nn\n(2 ≤\nn\n≤ 100), the\nnumber of cards on the ring, and then\nn\nnumbers describing the values of the cards follow. Note\nthat the values are given in clockwise order. You can assume all these numbers are non-negative\nand do not exceed 100. They are separated by a single space character.\nOutput\nFor each case, output the maximum score in a line.\nSample Input\n2\n4 0 1 2 3\n6 1 8 0 3 5 9\nOutput for the Sample Input\n6\n34"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2028_10853924","code_snippet":"#include <cmath>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nint Q, n;\nint main() {\n\tcin >> Q;\n\twhile (Q--) {\n\t\tcin >> n;\n\t\tvector<int> a(n);\n\t\tfor (int i = 0; i < n; i++) cin >> a[i];\n\t\tint ret = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tvector<vector<int> > dp(n, vector<int>(n + 1));\n\t\t\tfor (int j = 2; j <= n; j++) {\n\t\t\t\tfor (int k = 0; k <= n - j; k++) {\n\t\t\t\t\tint r = k + j;\n\t\t\t\t\tfor (int l = k + 1; l < r; l++) {\n\t\t\t\t\t\tdp[k][r] = max(dp[k][r], dp[k][l] + dp[l][r] + abs(a[k] - a[l]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tret = max(ret, dp[0][n]);\n\t\t\tvector<int> b(n);\n\t\t\tfor (int j = 0; j < n; j++) b[j] = a[(j + 1) % n];\n\t\t\ta = b;\n\t\t}\n\t\tcout << ret << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1400,"memory_kb":3224,"score_of_the_acc":-1.1694,"final_rank":19},{"submission_id":"aoj_2028_3269194","code_snippet":"#include \"bits/stdc++.h\"\n\n#pragma warning(disable:4996)\nusing namespace std;\nstring root_sts = \"C ,C#,D ,D#,E ,F ,F#,G ,G#,A ,A#,B \";\n\nint solve(int l, int r, const vector<int>&nums, vector<vector<int>>&dp) {\n\tif (dp[l][r] != -1) {\n\t}\n\telse {\n\t\tif(l==r)dp[l][r]=0;\n\t\telse if(l+1==r)dp[l][r]=0;\n\t\telse {\n\t\t\tvector<int>memo(r-l);\n\t\t\tmemo[0]=0;\n\t\t\tfor (int x = 0; x < r - l-1; ++x) {\n\t\t\t\tfor (int num = 1; num <= r-l-x-1; ++num) {\n\t\t\t\t\tint plus=abs(nums[l]-nums[l+x+1])+\n\t\t\t\t\t\tsolve(l+x+1,l+x+num+1,nums,dp);\n\t\t\t\t\tmemo[x+num]=max(memo[x+num],\n\t\t\t\t\t\tmemo[x]+plus);\n\t\t\t\t}\n\t\t\t}\n\t\t\tdp[l][r]=memo[r-l-1];\n\t\t}\n\t}\n\treturn dp[l][r];\n}\n\nint main() {\n\tint Q;cin>>Q;\n\twhile (Q--) {\n\t\tint N;cin>>N;\n\t\tvector<int>nums(N);\n\t\tfor(int i=0;i<N;++i)cin>>nums[i];\n\t\tnums.insert(nums.end(),nums.begin(),nums.end());\n\t\tvector<vector<int>>dp(2*N,vector<int>(2*N,-1));\n\t\tint ans=0;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tans=max(ans,solve(i,i+N,nums,dp));\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":7480,"memory_kb":3196,"score_of_the_acc":-1.9865,"final_rank":20},{"submission_id":"aoj_2028_2552522","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 <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\nvoid func(){\n\n\tint N;\n\tscanf(\"%d\",&N);\n\n\tint table[N];\n\tfor(int i = 0; i < N; i++)scanf(\"%d\",&table[i]);\n\n\tint dp[N][N];\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tdp[i][k] = 0;\n\t\t}\n\t}\n\n\tfor(int length = 1; length <= N-1; length++){\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tfor(int k = 0; k < length; k++){\n\t\t\t\tdp[i][length] = max(dp[i][length],dp[i][k]+dp[(i+k+1)%N][length-k-1]+abs(table[i]-table[(i+k+1)%N]));\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = 0;\n\tfor(int i = 0; i < N; i++){\n\t\tans = max(ans,dp[i][N-1]);\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n}\n\nint main(){\n\tint num_case;\n\tscanf(\"%d\",&num_case);\n\n\tfor(int i = 0; i < num_case; i++)func();\n\n\treturn 0;\n}","accuracy":1,"time_ms":160,"memory_kb":3172,"score_of_the_acc":-0.9749,"final_rank":16},{"submission_id":"aoj_2028_2389001","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nbool used[111][111];\nint dp[111][111];\nint n;\nint a[111];\nint dfs(int l,int r){\n if(used[l][r]) return dp[l][r];\n if(l+1==r) return 0;\n used[l][r]=1;\n int res=0;\n for(int i=1;(l+i)%n!=r;i++){\n int m=(l+i)%n;\n res=max(res,dfs(l,m)+dfs(m,r)+abs(a[l]-a[m]));\n }\n //cout<<l<<\" \"<<r<<\":\"<<res<<endl;\n return dp[l][r]=res;\n}\nsigned main(){\n int T;\n cin>>T;\n while(T--){\n cin>>n;\n for(int i=0;i<n;i++) cin>>a[i];\n memset(used,0,sizeof(used));\n memset(dp,0,sizeof(dp));\n int ans=0;\n for(int i=0;i<n;i++) ans=max(ans,dfs(i,i));\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":520,"memory_kb":3208,"score_of_the_acc":-1.0414,"final_rank":18},{"submission_id":"aoj_2028_2388290","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint dp[101][101],a[100];\n\n\nint main(){\n int T;\n cin>>T;\n while(T--){\n int n;\n cin>>n;\n for(int i=0;i<n;i++)\n cin>>a[i];\n\n memset(dp,0,sizeof(dp));\n int ans=0;\n for(int i=1;i<n;i++){\n for(int j=0;j<n;j++){\n\tfor(int k=j;k<j+i;k++){\n\t ans=max(ans,dp[j][(j+i)%n]=max(dp[j][(j+i)%n],dp[j][k%n]+dp[(k+1)%n][(j+i)%n]+abs(a[j]-a[(k+1)%n])));\n\t}\n }\n }\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":230,"memory_kb":3120,"score_of_the_acc":-0.9593,"final_rank":15},{"submission_id":"aoj_2028_1929193","code_snippet":"#include<iostream>\n#include<cmath>\n#include<algorithm>\nusing namespace std;\nint n, a[107], dp[107][107], K[107][107];\nint main() {\n\tint t; cin >> t;\n\tfor (int p = 0; p < t; p++) {\n\t\tfor (int i = 0; i < 11449; i++)dp[i / 107][i % 107] = 0;\n\t\tcin >> n; if (n == 0)break;\n\t\tfor (int i = 0; i < n; i++)cin >> a[i];\n\t\tint maxn = 0;\n\t\tfor (int u = 0; u < n; u++) {\n\t\t\tint G = a[0];\n\t\t\tfor (int v = 1; v < n; v++)a[v - 1] = a[v];\n\t\t\ta[n - 1] = G;\n\t\t\tfor (int v = 0; v < 11449; v++)dp[v / 107][v % 107] = 0;\n\t\t\tfor (int v = 0; v < n; v++) {\n\t\t\t\tfor (int w = 0; w < n; w++)K[v][w] = abs(a[v] - a[w]);\n\t\t\t}\n\t\t\tfor (int v = 1; v <= n; v++) {\n\t\t\t\tfor (int w = 0; w < n; w++) {\n\t\t\t\t\tint I = w, J = v + w;\n\t\t\t\t\tif (I >= J || J >= n)continue;\n\t\t\t\t\tfor (int k = I; k < J; k++) {\n\t\t\t\t\t\tdp[I][J] = max(dp[I][J], dp[I][k] + dp[k + 1][J] + K[I][k + 1]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tmaxn = max(maxn, dp[0][n - 1]);\n\t\t}\n\t\tcout << maxn << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":2790,"memory_kb":1248,"score_of_the_acc":-0.4038,"final_rank":13},{"submission_id":"aoj_2028_1882374","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX_N 100\n \nint N,arr[MAX_N];\nint dp[MAX_N][MAX_N];\n \nint rec(int L,int R){\n if(L == R) return dp[L][R] = 0;\n if(dp[L][R] >= 0) return dp[L][R];\n int res = 0;\n int i = L;\n while(i != R){\n\tint j = i%N,k = (i+1)%N;\n\tres = max(res,rec(L,j)+rec(k,R)+abs(arr[L]-arr[k]));\n\ti++; i %= N;\n }\n return dp[L][R] = res;\n}\n \nint main(){\n int Tc;\n cin >> Tc;\n while(Tc--){\n\tcin >> N;\n\tfor(int i = 0 ; i < N ; i++){\n\t cin >> arr[i];\n\t}\n\tmemset(dp,-1,sizeof(dp));\n\tint res = 0;\n\tfor(int i = 0 ; i < N ; i++){\n\t int j = (i+N-1)%N;\n\t res = max(res,rec(i,j));\n\t}\n\tcout << res << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":460,"memory_kb":3100,"score_of_the_acc":-0.981,"final_rank":17},{"submission_id":"aoj_2028_1616107","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <complex>\n#include <assert.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair <int,int> P;\n\nstatic const double EPS = 1e-12;\n\nstatic const int tx[] = {+0,+1,+0,-1};\nstatic const int ty[] = {-1,+0,+1,+0};\n\nint dp[101][101];\n\nint main(){\n int num_of_tests;\n while(~scanf(\"%d\",&num_of_tests)){\n for(int test_i = 0; test_i < num_of_tests; test_i++){\n int num_of_cards;\n scanf(\"%d\",&num_of_cards);\n vector<int> cards;\n for(int card_i = 0; card_i < num_of_cards; card_i++){\n int card;\n scanf(\"%d\",&card);\n cards.push_back(card);\n }\n\n memset(dp,0,sizeof(dp));\n for(int len = 1; len <= cards.size(); len++){\n for(int pos = 0; pos < cards.size(); pos++){\n for(int mid = 0; mid < len; mid++){\n dp[pos][len] = max(dp[pos][len],\n dp[pos][mid]\n + dp[(pos + mid) % cards.size()][len - mid]\n + abs(cards[pos] - cards[(pos + mid) % cards.size()]));\n }\n }\n }\n\n int res = 0;\n for(int pos = 0; pos < cards.size(); pos++){\n res = max(dp[pos][cards.size()],res);\n }\n printf(\"%d\\n\",res);\n }\n }\n}","accuracy":1,"time_ms":650,"memory_kb":1256,"score_of_the_acc":-0.1153,"final_rank":8},{"submission_id":"aoj_2028_1336940","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX_N 100\n\nint N,arr[MAX_N];\nint dp[MAX_N][MAX_N];\n\nint rec(int L,int R){\n if(L == R){ return dp[L][R] = 0; }\n if(dp[L][R] >= 0){ return dp[L][R]; }\n int res = 0;\n int i = L;\n while(i != R){\n int j = i%N,k = (i+1)%N;\n res = max(res,rec(L,j)+rec(k,R)+abs(arr[L]-arr[k]));\n i++; i %= N;\n }\n return dp[L][R] = res;\n}\n\nint main(){\n int Tc;\n cin >> Tc;\n while(Tc--){\n cin >> N;\n for(int i = 0 ; i < N ; i++){\n cin >> arr[i];\n }\n memset(dp,-1,sizeof(dp));\n int res = 0;\n for(int i = 0 ; i < N ; i++){\n int j = (i+N-1)%N;\n res = max(res,rec(i,j));\n }\n cout << res << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":710,"memory_kb":1212,"score_of_the_acc":-0.1022,"final_rank":7},{"submission_id":"aoj_2028_1150523","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint b[110];\nint dp[110][110];\nint tmp[110][110];\nint n;\ninline int ABS(int a){return max(a,-a);}\nint ad[110][110];\nint solve(int l,int r){\n\tif(~dp[l][r])return dp[l][r];\n\tif(l==r)return dp[l][r]=0;\n\tint sz=(r-l+n)%n;\n\tfor(int i=0;i<=sz;i++){\n\t\ttmp[l][i]=-99999999;\n\t}\n\ttmp[l][0]=0;\n\tfor(int i=0;i<sz;i++){\n\t\tdp[l][ad[l][i]]=tmp[l][i];\n\t\tint t=ABS(b[l]-b[ad[l+1][i]]);\n\t\tfor(int j=sz-i;j>=1;j--){\n\t\t\ttmp[l][i+j]=max(tmp[l][i+j],tmp[l][i]+t+solve(ad[l][i+1]%n,ad[l][i+j]));\n\t\t}\n\t}\n\t//printf(\"%d %d: %d\\n\",l,r,tmp[(r-l+n)%n]);\n\treturn dp[l][r]=tmp[l][sz];\n}\nint main(){\n\tint t;scanf(\"%d\",&t);\n\twhile(t--){\n\t\tint a;scanf(\"%d\",&a);for(int i=0;i<a;i++)scanf(\"%d\",b+i);\n\t\tn=a;\n\t\tfor(int i=0;i<110;i++)for(int j=0;j<110;j++)ad[i][j]=(i+j)%n;\n\t\tint ret=0;\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<a;j++)dp[i][j]=-1;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tret=max(ret,solve(i,(i+a-1)%a));\n\t\t}\n\t\tprintf(\"%d\\n\",ret);\n\t}\n}","accuracy":1,"time_ms":6670,"memory_kb":1156,"score_of_the_acc":-0.8893,"final_rank":14},{"submission_id":"aoj_2028_1125450","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 cin >> n;\n int a[n];\n for(int i=0; i<n; i++) cin >> a[i];\n int dp[n][n];\n memset(dp,0,sizeof(dp));\n for(int i=0; i<n; i++) dp[i][(i+1)%n]=abs(a[i]-a[(i+1)%n]);\n int ans=0;\n for(int i=2; i<n; i++) {\n for(int j=0; j<n; j++) {\n for(int k=j; k<i+j+1; k++) {\n int x=(i+j)%n;\n if(k==j) dp[j][x]=max(dp[j][x],dp[j][(i+j-1)%n]+abs(a[j]-a[x]));\n else dp[j][x]=max(dp[j][x],dp[j][k%n]+dp[k%n][x]);\n ans=max(ans,dp[j][x]);\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":1204,"score_of_the_acc":-0.0273,"final_rank":1},{"submission_id":"aoj_2028_1088990","code_snippet":"#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\n\nusing namespace std;\n\nconst int INF = 1000000000;\n\nint main(){\n int T;\n cin >> T;\n while(T--) {\n int n;\n cin >> n;\n vector<int> a(n);\n REP(i, n) cin >> a[i];\n\n int dp[101][101] = {};\n REP(i, n) REP(j, n) dp[i][j] = -INF;\n REP(i, n) dp[i][i] = 0;\n for(int l = 1; l < n; l++) {\n for(int i = 0; i < n; i++) {\n int j = (i + l) % n;\n int max_k = 0;\n for(int h = 0; h < l; h++) {\n int k = (i + h) % n;\n int k2 = (i + h + 1) % n;\n int val = dp[i][k] + dp[k2][j] + abs(a[i] - a[k2]);\n if(dp[i][j] < val) {\n max_k = k;\n dp[i][j] = val;\n }\n }\n //printf(\"dp[%d][%d] = %d (dp[%d][%d] + dp[%d][%d])\\n\", i, j, dp[i][j], i, max_k, (max_k + 1) % n, j);\n }\n }\n\n int ans = -INF;\n REP(i, n) ans = max(ans, dp[i][(i + n - 1) % n]);\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":270,"memory_kb":1240,"score_of_the_acc":-0.0556,"final_rank":5},{"submission_id":"aoj_2028_1033447","code_snippet":"#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint mem[200][200];\nbool p[200][200];\nint a[200];\n\nint rec(int f,int l){\n if(l-f==1)return 0;\n if(p[l][f]++)return mem[l][f];\n mem[l][f]=0;\n for(int m=f+1;m<l;m++){\n mem[l][f]=max(mem[l][f],rec(f,m)+rec(m,l)+abs(a[f]-a[m]));\n }\n return mem[l][f];\n}\n\nint main(){\n int T;\n cin>>T;\n while(T--){\n int n;\n cin>>n;\n for(int i=0;i<n;i++){\n cin>>a[i];\n a[i+n]=a[i];\n }\n int ans=0;\n fill(p[0],p[200],0);\n for(int i=0;i<n;i++){\n ans=max(ans,rec(i,i+n));\n }\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":440,"memory_kb":1360,"score_of_the_acc":-0.1369,"final_rank":9},{"submission_id":"aoj_2028_621764","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cmath>\n\n#define curr(P, i) P[(i) % P.size()]\n#define next(P, i) P[(i+1) % P.size()]\n#define prev(P, i) P[(i+P.size()-1) % P.size()]\n#define Next(a,i) ((i)+1)%(a).size()\n#define Curr(a,i) (i)%(a).size()\n#define Prev(a, i) (i+a.size()-1) % a.size()\n\nusing namespace std;\n\nint main(void){\n\n int n,m,x,dp[101][101];\n vector<int>a;\n\n cin >> n;\n\n while(n--){\n a.clear();\n\n for(int i=0;i<101;i++)\n for(int j=0;j<101;j++)dp[i][j]=0;\n\n cin >> m;\n for(int i=0;i<m;i++){\n cin >> x;\n a.push_back(x);\n }\n \n for(int i=0;i<m;i++){\n for(int j=0;j<m;j++){\n\tfor(int k=0;k<i;k++){\n\t dp[Curr(a,j)][Curr(a,i)]=max(dp[j][i],dp[Curr(a,j)][Curr(a,k)]+dp[Next(a,j+k)][Prev(a,i-k)]+abs(curr(a,j)-next(a,j+k))); \n\t}\n }\n }\n int ans=0;\n for(int i=0;i<m;i++)\n for(int j=0;j<m;j++)\n ans=max(ans,dp[i][j]);\n \n cout << ans << endl;\n \n }\n\n return 0;\n}","accuracy":1,"time_ms":920,"memory_kb":1256,"score_of_the_acc":-0.1522,"final_rank":12},{"submission_id":"aoj_2028_621762","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cmath>\n\n#define curr(P, i) P[(i) % P.size()]\n#define next(P, i) P[(i+1) % P.size()]\n#define prev(P, i) P[(i+P.size()-1) % P.size()]\n#define Next(a,i) ((i)+1)%(a).size()\n#define Curr(a,i) (i)%(a).size()\n#define Prev(a, i) (i+a.size()-1) % a.size()\n\nusing namespace std;\n\nint main(void){\n\n int n,m,x,dp[101][101];\n vector<int>a;\n\n cin >> n;\n\n while(n--){\n a.clear();\n\n for(int i=0;i<101;i++)\n for(int j=0;j<101;j++)dp[i][j]=0;\n\n cin >> m;\n for(int i=0;i<m;i++){\n cin >> x;\n a.push_back(x);\n }\n \n for(int i=1;i<m;i++){\n for(int j=0;j<m;j++){\n\tfor(int k=0;k<i;k++){\n\t dp[Curr(a,j)][Curr(a,i)]=max(dp[j][i],dp[Curr(a,j)][Curr(a,k)]+dp[Next(a,j+k)][Prev(a,i-k)]+abs(curr(a,j)-next(a,j+k))); \n\t}\n }\n }\n int ans=0;\n for(int i=0;i<m;i++)\n for(int j=0;j<m;j++)\n ans=max(ans,dp[i][j]);\n \n cout << ans << endl;\n \n }\n\n return 0;\n}","accuracy":1,"time_ms":930,"memory_kb":1252,"score_of_the_acc":-0.1516,"final_rank":10},{"submission_id":"aoj_2028_620447","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cmath>\n\n#define curr(P, i) P[(i) % P.size()]\n#define next(P, i) P[(i+1) % P.size()]\n#define prev(P, i) P[(i+P.size()-1) % P.size()]\n#define Next(a,i) ((i)+1)%(a).size()\n#define Curr(a,i) (i)%(a).size()\n#define Prev(a, i) (i+a.size()-1) % a.size()\n\nusing namespace std;\n\nint main(void){\n\n int n,m,x,dp[101][101];\n vector<int>a;\n\n cin >> n;\n\n while(n--){\n a.clear();\n\n for(int i=0;i<101;i++)\n for(int j=0;j<101;j++)dp[i][j]=0;\n\n cin >> m;\n for(int i=0;i<m;i++){\n cin >> x;\n a.push_back(x);\n }\n\n //for(int i=0;i<m;i++)dp[i][Next(a,i)]=abs(curr(a,i)-next(a,i));\n \n for(int k=1;k<m;k++){\n for(int i=0;i<m;i++){\n\tfor(int j=0;j<k;j++){\n\t dp[Curr(a,i)][Curr(a,k)]=max(dp[i][k],dp[Curr(a,i)][Curr(a,j)]+dp[Next(a,i+j)][Prev(a,k-j)]+abs(curr(a,i)-next(a,i+j)));\n\t\t\t\t\t\t \n\t}\n\t\n }\n }\n int ans=0;\n for(int i=0;i<m;i++)\n for(int j=0;j<m;j++)\n ans=max(ans,dp[i][j]);\n \n cout << ans << endl;\n \n }\n\n return 0;\n}","accuracy":1,"time_ms":930,"memory_kb":1252,"score_of_the_acc":-0.1516,"final_rank":10},{"submission_id":"aoj_2028_619605","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cmath>\n#include<cstdio>\nusing namespace std;\n\nint main()\n{\n int N;\n scanf(\"%d\",&N);\n while(N-- > 0)\n {\n int n;\n cin >> n;\n int dp[n][n];\n int vec[n];\n for(int i=0;i<n;i++)\n\t{\n\t cin >> vec[i];\n\t for(int j=0;j<n;j++)\n\t dp[i][j] = 0;\n\t}\n \n int mex = 0;\n for(int i=0;i<n;i++)\n\tdp[i][(i+1)%n] = abs(vec[i]-vec[(i+1)%n]),mex = max(mex,dp[i][(i+1)%n]);\n \n for(int i=2;i<n;i++)//幅\n\t{\n\t for(int j=0;j<n;j++)//index\n\t {\n\t for(int k=j;k<=j+i-1;k++)//中間地点\n\t\t{\n\t\t if(k == j)\n\t\t {\n\t\t dp[j][(j+i)%n] = max(dp[j][(j+i)%n],dp[j][(j+i-1)%n]+abs(vec[j]-vec[(j+i)%n]));\n\t\t mex = max(mex,dp[j][(j+i)%n]);\n\t\t continue;\n\t\t }\n\t\t dp[j][(j+i)%n] = max(dp[j][(j+i)%n],\n\t\t\t\t dp[k%n][(j+i)%n]+dp[j][k%n]);\n\t\t}\n\t mex = max(mex,dp[j][(j+i)%n]);\n\t }\n\t}\n\n cout << mex << endl;\n\n\n }\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":1276,"score_of_the_acc":-0.0594,"final_rank":6},{"submission_id":"aoj_2028_619600","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cmath>\nusing namespace std;\n\nint main()\n{\n int N;\n cin >> N;\n while(N-- > 0)\n {\n int n;\n cin >> n;\n int dp[n][n];\n vector<int> vec(n);\n for(int i=0;i<n;i++)\n\t{\n\t cin >> vec[i];\n\t for(int j=0;j<n;j++)\n\t dp[i][j] = 0;\n\t}\n\n int mex = 0;\n for(int i=0;i<n;i++)\n\tdp[i][(i+1)%n] = abs(vec[i]-vec[(i+1)%n]),mex = max(mex,dp[i][(i+1)%n]);\n\n for(int i=2;i<n;i++)//幅\n\t{\n\t for(int j=0;j<n;j++)//index\n\t {\n\t for(int k=j;k<=j+i-1;k++)//中間地点\n\t\t{\n\t\t if(k == j)\n\t\t {\n\t\t dp[j][(j+i)%n] = max(dp[j][(j+i)%n],dp[j][(j+i-1)%n]+abs(vec[j]-vec[(j+i)%n]));\n\t\t mex = max(mex,dp[j][(j+i)%n]);\n\t\t continue;\n\t\t }\n\t\t dp[j][(j+i)%n] = max(dp[j][(j+i)%n],\n\t\t\t\t dp[k%n][(j+i)%n]+dp[j][k%n]);\n\t\t}\n\t mex = max(mex,dp[j][(j+i)%n]);\n\t }\n\t}\n\n cout << mex << endl;\n\n\n }\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":1232,"score_of_the_acc":-0.0381,"final_rank":2},{"submission_id":"aoj_2028_618962","code_snippet":"#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nmain(){\n int T, dp[100][100], n, d[100], s;\n cin >> T;\n while(T--){\n cin >> n;\n for(int i=0;i<n;i++) cin >> d[i];\n fill(dp[0], dp[n], 0);\n for(int k=1;k<n;k++){\n for(int i=0;i<n;i++){\n for(int j=0;j<k;j++){\n s = (i+k)%n;\n dp[i][s] = max(dp[i][s], dp[i][(i+j)%n] + dp[(i+j+1)%n][s] + abs(d[i] - d[(i+j+1)%n]));\n }\n }\n }\n int ans = 0;\n for(int i=0;i<n;i++) ans = max(ans, dp[i][(i+n-1)%n]);\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":340,"memory_kb":1196,"score_of_the_acc":-0.0439,"final_rank":4},{"submission_id":"aoj_2028_618961","code_snippet":"#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nmain(){\n int T, dp[100][100], n, d[100], s, t;\n cin >> T;\n while(T--){\n cin >> n;\n for(int i=0;i<n;i++) cin >> d[i];\n fill(dp[0], dp[n], 0);\n for(int k=1;k<n;k++){\n for(int i=0;i<n;i++){\n for(int j=0;j<k;j++){\n s = (i+k)%n;\n t = (i+j+1)%n;\n dp[i][s] = max(dp[i][s], dp[i][(i+j)%n] + dp[t][s] + abs(d[i] - d[t]));\n }\n }\n }\n int ans = 0;\n for(int i=0;i<n;i++) ans = max(ans, dp[i][(i+n-1)%n]);\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":330,"memory_kb":1196,"score_of_the_acc":-0.0426,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_2028_10853924\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nint Q, n;\\nint main() {\\n\\tcin >> Q;\\n\\twhile (Q--) {\\n\\t\\tcin >> n;\\n\\t\\tvector<int> a(n);\\n\\t\\tfor (int i = 0; i < n; i++) cin >> a[i];\\n\\t\\tint ret = 0;\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tvector<vector<int> > dp(n, vector<int>(n + 1));\\n\\t\\t\\tfor (int j = 2; j <= n; j++) {\\n\\t\\t\\t\\tfor (int k = 0; k <= n - j; k++) {\\n\\t\\t\\t\\t\\tint r = k + j;\\n\\t\\t\\t\\t\\tfor (int l = k + 1; l < r; l++) {\\n\\t\\t\\t\\t\\t\\tdp[k][r] = max(dp[k][r], dp[k][l] + dp[l][r] + abs(a[k] - a[l]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tret = max(ret, dp[0][n]);\\n\\t\\t\\tvector<int> b(n);\\n\\t\\t\\tfor (int j = 0; j < n; j++) b[j] = a[(j + 1) % n];\\n\\t\\t\\ta = b;\\n\\t\\t}\\n\\t\\tcout << ret << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1400,\n \"memory_kb\": 3224,\n \"score_of_the_acc\": -1.1694,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2028_3269194\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\n#pragma warning(disable:4996)\\nusing namespace std;\\nstring root_sts = \\\"C ,C#,D ,D#,E ,F ,F#,G ,G#,A ,A#,B \\\";\\n\\nint solve(int l, int r, const vector<int>&nums, vector<vector<int>>&dp) {\\n\\tif (dp[l][r] != -1) {\\n\\t}\\n\\telse {\\n\\t\\tif(l==r)dp[l][r]=0;\\n\\t\\telse if(l+1==r)dp[l][r]=0;\\n\\t\\telse {\\n\\t\\t\\tvector<int>memo(r-l);\\n\\t\\t\\tmemo[0]=0;\\n\\t\\t\\tfor (int x = 0; x < r - l-1; ++x) {\\n\\t\\t\\t\\tfor (int num = 1; num <= r-l-x-1; ++num) {\\n\\t\\t\\t\\t\\tint plus=abs(nums[l]-nums[l+x+1])+\\n\\t\\t\\t\\t\\t\\tsolve(l+x+1,l+x+num+1,nums,dp);\\n\\t\\t\\t\\t\\tmemo[x+num]=max(memo[x+num],\\n\\t\\t\\t\\t\\t\\tmemo[x]+plus);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tdp[l][r]=memo[r-l-1];\\n\\t\\t}\\n\\t}\\n\\treturn dp[l][r];\\n}\\n\\nint main() {\\n\\tint Q;cin>>Q;\\n\\twhile (Q--) {\\n\\t\\tint N;cin>>N;\\n\\t\\tvector<int>nums(N);\\n\\t\\tfor(int i=0;i<N;++i)cin>>nums[i];\\n\\t\\tnums.insert(nums.end(),nums.begin(),nums.end());\\n\\t\\tvector<vector<int>>dp(2*N,vector<int>(2*N,-1));\\n\\t\\tint ans=0;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tans=max(ans,solve(i,i+N,nums,dp));\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7480,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -1.9865,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2028_2552522\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <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\\nvoid func(){\\n\\n\\tint N;\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tint table[N];\\n\\tfor(int i = 0; i < N; i++)scanf(\\\"%d\\\",&table[i]);\\n\\n\\tint dp[N][N];\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tdp[i][k] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int length = 1; length <= N-1; length++){\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\tfor(int k = 0; k < length; k++){\\n\\t\\t\\t\\tdp[i][length] = max(dp[i][length],dp[i][k]+dp[(i+k+1)%N][length-k-1]+abs(table[i]-table[(i+k+1)%N]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = 0;\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tans = max(ans,dp[i][N-1]);\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\n}\\n\\nint main(){\\n\\tint num_case;\\n\\tscanf(\\\"%d\\\",&num_case);\\n\\n\\tfor(int i = 0; i < num_case; i++)func();\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -0.9749,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2028_2389001\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\nbool used[111][111];\\nint dp[111][111];\\nint n;\\nint a[111];\\nint dfs(int l,int r){\\n if(used[l][r]) return dp[l][r];\\n if(l+1==r) return 0;\\n used[l][r]=1;\\n int res=0;\\n for(int i=1;(l+i)%n!=r;i++){\\n int m=(l+i)%n;\\n res=max(res,dfs(l,m)+dfs(m,r)+abs(a[l]-a[m]));\\n }\\n //cout<<l<<\\\" \\\"<<r<<\\\":\\\"<<res<<endl;\\n return dp[l][r]=res;\\n}\\nsigned main(){\\n int T;\\n cin>>T;\\n while(T--){\\n cin>>n;\\n for(int i=0;i<n;i++) cin>>a[i];\\n memset(used,0,sizeof(used));\\n memset(dp,0,sizeof(dp));\\n int ans=0;\\n for(int i=0;i<n;i++) ans=max(ans,dfs(i,i));\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 520,\n \"memory_kb\": 3208,\n \"score_of_the_acc\": -1.0414,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2028_2388290\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint dp[101][101],a[100];\\n\\n\\nint main(){\\n int T;\\n cin>>T;\\n while(T--){\\n int n;\\n cin>>n;\\n for(int i=0;i<n;i++)\\n cin>>a[i];\\n\\n memset(dp,0,sizeof(dp));\\n int ans=0;\\n for(int i=1;i<n;i++){\\n for(int j=0;j<n;j++){\\n\\tfor(int k=j;k<j+i;k++){\\n\\t ans=max(ans,dp[j][(j+i)%n]=max(dp[j][(j+i)%n],dp[j][k%n]+dp[(k+1)%n][(j+i)%n]+abs(a[j]-a[(k+1)%n])));\\n\\t}\\n }\\n }\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 3120,\n \"score_of_the_acc\": -0.9593,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2028_1929193\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<algorithm>\\nusing namespace std;\\nint n, a[107], dp[107][107], K[107][107];\\nint main() {\\n\\tint t; cin >> t;\\n\\tfor (int p = 0; p < t; p++) {\\n\\t\\tfor (int i = 0; i < 11449; i++)dp[i / 107][i % 107] = 0;\\n\\t\\tcin >> n; if (n == 0)break;\\n\\t\\tfor (int i = 0; i < n; i++)cin >> a[i];\\n\\t\\tint maxn = 0;\\n\\t\\tfor (int u = 0; u < n; u++) {\\n\\t\\t\\tint G = a[0];\\n\\t\\t\\tfor (int v = 1; v < n; v++)a[v - 1] = a[v];\\n\\t\\t\\ta[n - 1] = G;\\n\\t\\t\\tfor (int v = 0; v < 11449; v++)dp[v / 107][v % 107] = 0;\\n\\t\\t\\tfor (int v = 0; v < n; v++) {\\n\\t\\t\\t\\tfor (int w = 0; w < n; w++)K[v][w] = abs(a[v] - a[w]);\\n\\t\\t\\t}\\n\\t\\t\\tfor (int v = 1; v <= n; v++) {\\n\\t\\t\\t\\tfor (int w = 0; w < n; w++) {\\n\\t\\t\\t\\t\\tint I = w, J = v + w;\\n\\t\\t\\t\\t\\tif (I >= J || J >= n)continue;\\n\\t\\t\\t\\t\\tfor (int k = I; k < J; k++) {\\n\\t\\t\\t\\t\\t\\tdp[I][J] = max(dp[I][J], dp[I][k] + dp[k + 1][J] + K[I][k + 1]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tmaxn = max(maxn, dp[0][n - 1]);\\n\\t\\t}\\n\\t\\tcout << maxn << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2790,\n \"memory_kb\": 1248,\n \"score_of_the_acc\": -0.4038,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2028_1882374\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define MAX_N 100\\n \\nint N,arr[MAX_N];\\nint dp[MAX_N][MAX_N];\\n \\nint rec(int L,int R){\\n if(L == R) return dp[L][R] = 0;\\n if(dp[L][R] >= 0) return dp[L][R];\\n int res = 0;\\n int i = L;\\n while(i != R){\\n\\tint j = i%N,k = (i+1)%N;\\n\\tres = max(res,rec(L,j)+rec(k,R)+abs(arr[L]-arr[k]));\\n\\ti++; i %= N;\\n }\\n return dp[L][R] = res;\\n}\\n \\nint main(){\\n int Tc;\\n cin >> Tc;\\n while(Tc--){\\n\\tcin >> N;\\n\\tfor(int i = 0 ; i < N ; i++){\\n\\t cin >> arr[i];\\n\\t}\\n\\tmemset(dp,-1,sizeof(dp));\\n\\tint res = 0;\\n\\tfor(int i = 0 ; i < N ; i++){\\n\\t int j = (i+N-1)%N;\\n\\t res = max(res,rec(i,j));\\n\\t}\\n\\tcout << res << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 3100,\n \"score_of_the_acc\": -0.981,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2028_1616107\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <complex>\\n#include <assert.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair <int,int> P;\\n\\nstatic const double EPS = 1e-12;\\n\\nstatic const int tx[] = {+0,+1,+0,-1};\\nstatic const int ty[] = {-1,+0,+1,+0};\\n\\nint dp[101][101];\\n\\nint main(){\\n int num_of_tests;\\n while(~scanf(\\\"%d\\\",&num_of_tests)){\\n for(int test_i = 0; test_i < num_of_tests; test_i++){\\n int num_of_cards;\\n scanf(\\\"%d\\\",&num_of_cards);\\n vector<int> cards;\\n for(int card_i = 0; card_i < num_of_cards; card_i++){\\n int card;\\n scanf(\\\"%d\\\",&card);\\n cards.push_back(card);\\n }\\n\\n memset(dp,0,sizeof(dp));\\n for(int len = 1; len <= cards.size(); len++){\\n for(int pos = 0; pos < cards.size(); pos++){\\n for(int mid = 0; mid < len; mid++){\\n dp[pos][len] = max(dp[pos][len],\\n dp[pos][mid]\\n + dp[(pos + mid) % cards.size()][len - mid]\\n + abs(cards[pos] - cards[(pos + mid) % cards.size()]));\\n }\\n }\\n }\\n\\n int res = 0;\\n for(int pos = 0; pos < cards.size(); pos++){\\n res = max(dp[pos][cards.size()],res);\\n }\\n printf(\\\"%d\\\\n\\\",res);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 650,\n \"memory_kb\": 1256,\n \"score_of_the_acc\": -0.1153,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2028_1336940\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define MAX_N 100\\n\\nint N,arr[MAX_N];\\nint dp[MAX_N][MAX_N];\\n\\nint rec(int L,int R){\\n if(L == R){ return dp[L][R] = 0; }\\n if(dp[L][R] >= 0){ return dp[L][R]; }\\n int res = 0;\\n int i = L;\\n while(i != R){\\n int j = i%N,k = (i+1)%N;\\n res = max(res,rec(L,j)+rec(k,R)+abs(arr[L]-arr[k]));\\n i++; i %= N;\\n }\\n return dp[L][R] = res;\\n}\\n\\nint main(){\\n int Tc;\\n cin >> Tc;\\n while(Tc--){\\n cin >> N;\\n for(int i = 0 ; i < N ; i++){\\n cin >> arr[i];\\n }\\n memset(dp,-1,sizeof(dp));\\n int res = 0;\\n for(int i = 0 ; i < N ; i++){\\n int j = (i+N-1)%N;\\n res = max(res,rec(i,j));\\n }\\n cout << res << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 710,\n \"memory_kb\": 1212,\n \"score_of_the_acc\": -0.1022,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2028_1150523\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nint b[110];\\nint dp[110][110];\\nint tmp[110][110];\\nint n;\\ninline int ABS(int a){return max(a,-a);}\\nint ad[110][110];\\nint solve(int l,int r){\\n\\tif(~dp[l][r])return dp[l][r];\\n\\tif(l==r)return dp[l][r]=0;\\n\\tint sz=(r-l+n)%n;\\n\\tfor(int i=0;i<=sz;i++){\\n\\t\\ttmp[l][i]=-99999999;\\n\\t}\\n\\ttmp[l][0]=0;\\n\\tfor(int i=0;i<sz;i++){\\n\\t\\tdp[l][ad[l][i]]=tmp[l][i];\\n\\t\\tint t=ABS(b[l]-b[ad[l+1][i]]);\\n\\t\\tfor(int j=sz-i;j>=1;j--){\\n\\t\\t\\ttmp[l][i+j]=max(tmp[l][i+j],tmp[l][i]+t+solve(ad[l][i+1]%n,ad[l][i+j]));\\n\\t\\t}\\n\\t}\\n\\t//printf(\\\"%d %d: %d\\\\n\\\",l,r,tmp[(r-l+n)%n]);\\n\\treturn dp[l][r]=tmp[l][sz];\\n}\\nint main(){\\n\\tint t;scanf(\\\"%d\\\",&t);\\n\\twhile(t--){\\n\\t\\tint a;scanf(\\\"%d\\\",&a);for(int i=0;i<a;i++)scanf(\\\"%d\\\",b+i);\\n\\t\\tn=a;\\n\\t\\tfor(int i=0;i<110;i++)for(int j=0;j<110;j++)ad[i][j]=(i+j)%n;\\n\\t\\tint ret=0;\\n\\t\\tfor(int i=0;i<a;i++)for(int j=0;j<a;j++)dp[i][j]=-1;\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tret=max(ret,solve(i,(i+a-1)%a));\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\",ret);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6670,\n \"memory_kb\": 1156,\n \"score_of_the_acc\": -0.8893,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2028_1125450\",\n \"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 cin >> n;\\n int a[n];\\n for(int i=0; i<n; i++) cin >> a[i];\\n int dp[n][n];\\n memset(dp,0,sizeof(dp));\\n for(int i=0; i<n; i++) dp[i][(i+1)%n]=abs(a[i]-a[(i+1)%n]);\\n int ans=0;\\n for(int i=2; i<n; i++) {\\n for(int j=0; j<n; j++) {\\n for(int k=j; k<i+j+1; k++) {\\n int x=(i+j)%n;\\n if(k==j) dp[j][x]=max(dp[j][x],dp[j][(i+j-1)%n]+abs(a[j]-a[x]));\\n else dp[j][x]=max(dp[j][x],dp[j][k%n]+dp[k%n][x]);\\n ans=max(ans,dp[j][x]);\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 1204,\n \"score_of_the_acc\": -0.0273,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2028_1088990\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\n\\nusing namespace std;\\n\\nconst int INF = 1000000000;\\n\\nint main(){\\n int T;\\n cin >> T;\\n while(T--) {\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n REP(i, n) cin >> a[i];\\n\\n int dp[101][101] = {};\\n REP(i, n) REP(j, n) dp[i][j] = -INF;\\n REP(i, n) dp[i][i] = 0;\\n for(int l = 1; l < n; l++) {\\n for(int i = 0; i < n; i++) {\\n int j = (i + l) % n;\\n int max_k = 0;\\n for(int h = 0; h < l; h++) {\\n int k = (i + h) % n;\\n int k2 = (i + h + 1) % n;\\n int val = dp[i][k] + dp[k2][j] + abs(a[i] - a[k2]);\\n if(dp[i][j] < val) {\\n max_k = k;\\n dp[i][j] = val;\\n }\\n }\\n //printf(\\\"dp[%d][%d] = %d (dp[%d][%d] + dp[%d][%d])\\\\n\\\", i, j, dp[i][j], i, max_k, (max_k + 1) % n, j);\\n }\\n }\\n\\n int ans = -INF;\\n REP(i, n) ans = max(ans, dp[i][(i + n - 1) % n]);\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 1240,\n \"score_of_the_acc\": -0.0556,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2028_1033447\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\nint mem[200][200];\\nbool p[200][200];\\nint a[200];\\n\\nint rec(int f,int l){\\n if(l-f==1)return 0;\\n if(p[l][f]++)return mem[l][f];\\n mem[l][f]=0;\\n for(int m=f+1;m<l;m++){\\n mem[l][f]=max(mem[l][f],rec(f,m)+rec(m,l)+abs(a[f]-a[m]));\\n }\\n return mem[l][f];\\n}\\n\\nint main(){\\n int T;\\n cin>>T;\\n while(T--){\\n int n;\\n cin>>n;\\n for(int i=0;i<n;i++){\\n cin>>a[i];\\n a[i+n]=a[i];\\n }\\n int ans=0;\\n fill(p[0],p[200],0);\\n for(int i=0;i<n;i++){\\n ans=max(ans,rec(i,i+n));\\n }\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 440,\n \"memory_kb\": 1360,\n \"score_of_the_acc\": -0.1369,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2028_621764\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<cmath>\\n\\n#define curr(P, i) P[(i) % P.size()]\\n#define next(P, i) P[(i+1) % P.size()]\\n#define prev(P, i) P[(i+P.size()-1) % P.size()]\\n#define Next(a,i) ((i)+1)%(a).size()\\n#define Curr(a,i) (i)%(a).size()\\n#define Prev(a, i) (i+a.size()-1) % a.size()\\n\\nusing namespace std;\\n\\nint main(void){\\n\\n int n,m,x,dp[101][101];\\n vector<int>a;\\n\\n cin >> n;\\n\\n while(n--){\\n a.clear();\\n\\n for(int i=0;i<101;i++)\\n for(int j=0;j<101;j++)dp[i][j]=0;\\n\\n cin >> m;\\n for(int i=0;i<m;i++){\\n cin >> x;\\n a.push_back(x);\\n }\\n \\n for(int i=0;i<m;i++){\\n for(int j=0;j<m;j++){\\n\\tfor(int k=0;k<i;k++){\\n\\t dp[Curr(a,j)][Curr(a,i)]=max(dp[j][i],dp[Curr(a,j)][Curr(a,k)]+dp[Next(a,j+k)][Prev(a,i-k)]+abs(curr(a,j)-next(a,j+k))); \\n\\t}\\n }\\n }\\n int ans=0;\\n for(int i=0;i<m;i++)\\n for(int j=0;j<m;j++)\\n ans=max(ans,dp[i][j]);\\n \\n cout << ans << endl;\\n \\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 920,\n \"memory_kb\": 1256,\n \"score_of_the_acc\": -0.1522,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2028_621762\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<cmath>\\n\\n#define curr(P, i) P[(i) % P.size()]\\n#define next(P, i) P[(i+1) % P.size()]\\n#define prev(P, i) P[(i+P.size()-1) % P.size()]\\n#define Next(a,i) ((i)+1)%(a).size()\\n#define Curr(a,i) (i)%(a).size()\\n#define Prev(a, i) (i+a.size()-1) % a.size()\\n\\nusing namespace std;\\n\\nint main(void){\\n\\n int n,m,x,dp[101][101];\\n vector<int>a;\\n\\n cin >> n;\\n\\n while(n--){\\n a.clear();\\n\\n for(int i=0;i<101;i++)\\n for(int j=0;j<101;j++)dp[i][j]=0;\\n\\n cin >> m;\\n for(int i=0;i<m;i++){\\n cin >> x;\\n a.push_back(x);\\n }\\n \\n for(int i=1;i<m;i++){\\n for(int j=0;j<m;j++){\\n\\tfor(int k=0;k<i;k++){\\n\\t dp[Curr(a,j)][Curr(a,i)]=max(dp[j][i],dp[Curr(a,j)][Curr(a,k)]+dp[Next(a,j+k)][Prev(a,i-k)]+abs(curr(a,j)-next(a,j+k))); \\n\\t}\\n }\\n }\\n int ans=0;\\n for(int i=0;i<m;i++)\\n for(int j=0;j<m;j++)\\n ans=max(ans,dp[i][j]);\\n \\n cout << ans << endl;\\n \\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 930,\n \"memory_kb\": 1252,\n \"score_of_the_acc\": -0.1516,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2028_620447\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<cmath>\\n\\n#define curr(P, i) P[(i) % P.size()]\\n#define next(P, i) P[(i+1) % P.size()]\\n#define prev(P, i) P[(i+P.size()-1) % P.size()]\\n#define Next(a,i) ((i)+1)%(a).size()\\n#define Curr(a,i) (i)%(a).size()\\n#define Prev(a, i) (i+a.size()-1) % a.size()\\n\\nusing namespace std;\\n\\nint main(void){\\n\\n int n,m,x,dp[101][101];\\n vector<int>a;\\n\\n cin >> n;\\n\\n while(n--){\\n a.clear();\\n\\n for(int i=0;i<101;i++)\\n for(int j=0;j<101;j++)dp[i][j]=0;\\n\\n cin >> m;\\n for(int i=0;i<m;i++){\\n cin >> x;\\n a.push_back(x);\\n }\\n\\n //for(int i=0;i<m;i++)dp[i][Next(a,i)]=abs(curr(a,i)-next(a,i));\\n \\n for(int k=1;k<m;k++){\\n for(int i=0;i<m;i++){\\n\\tfor(int j=0;j<k;j++){\\n\\t dp[Curr(a,i)][Curr(a,k)]=max(dp[i][k],dp[Curr(a,i)][Curr(a,j)]+dp[Next(a,i+j)][Prev(a,k-j)]+abs(curr(a,i)-next(a,i+j)));\\n\\t\\t\\t\\t\\t\\t \\n\\t}\\n\\t\\n }\\n }\\n int ans=0;\\n for(int i=0;i<m;i++)\\n for(int j=0;j<m;j++)\\n ans=max(ans,dp[i][j]);\\n \\n cout << ans << endl;\\n \\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 930,\n \"memory_kb\": 1252,\n \"score_of_the_acc\": -0.1516,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2028_619605\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<cmath>\\n#include<cstdio>\\nusing namespace std;\\n\\nint main()\\n{\\n int N;\\n scanf(\\\"%d\\\",&N);\\n while(N-- > 0)\\n {\\n int n;\\n cin >> n;\\n int dp[n][n];\\n int vec[n];\\n for(int i=0;i<n;i++)\\n\\t{\\n\\t cin >> vec[i];\\n\\t for(int j=0;j<n;j++)\\n\\t dp[i][j] = 0;\\n\\t}\\n \\n int mex = 0;\\n for(int i=0;i<n;i++)\\n\\tdp[i][(i+1)%n] = abs(vec[i]-vec[(i+1)%n]),mex = max(mex,dp[i][(i+1)%n]);\\n \\n for(int i=2;i<n;i++)//幅\\n\\t{\\n\\t for(int j=0;j<n;j++)//index\\n\\t {\\n\\t for(int k=j;k<=j+i-1;k++)//中間地点\\n\\t\\t{\\n\\t\\t if(k == j)\\n\\t\\t {\\n\\t\\t dp[j][(j+i)%n] = max(dp[j][(j+i)%n],dp[j][(j+i-1)%n]+abs(vec[j]-vec[(j+i)%n]));\\n\\t\\t mex = max(mex,dp[j][(j+i)%n]);\\n\\t\\t continue;\\n\\t\\t }\\n\\t\\t dp[j][(j+i)%n] = max(dp[j][(j+i)%n],\\n\\t\\t\\t\\t dp[k%n][(j+i)%n]+dp[j][k%n]);\\n\\t\\t}\\n\\t mex = max(mex,dp[j][(j+i)%n]);\\n\\t }\\n\\t}\\n\\n cout << mex << endl;\\n\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 1276,\n \"score_of_the_acc\": -0.0594,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2028_619600\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<cmath>\\nusing namespace std;\\n\\nint main()\\n{\\n int N;\\n cin >> N;\\n while(N-- > 0)\\n {\\n int n;\\n cin >> n;\\n int dp[n][n];\\n vector<int> vec(n);\\n for(int i=0;i<n;i++)\\n\\t{\\n\\t cin >> vec[i];\\n\\t for(int j=0;j<n;j++)\\n\\t dp[i][j] = 0;\\n\\t}\\n\\n int mex = 0;\\n for(int i=0;i<n;i++)\\n\\tdp[i][(i+1)%n] = abs(vec[i]-vec[(i+1)%n]),mex = max(mex,dp[i][(i+1)%n]);\\n\\n for(int i=2;i<n;i++)//幅\\n\\t{\\n\\t for(int j=0;j<n;j++)//index\\n\\t {\\n\\t for(int k=j;k<=j+i-1;k++)//中間地点\\n\\t\\t{\\n\\t\\t if(k == j)\\n\\t\\t {\\n\\t\\t dp[j][(j+i)%n] = max(dp[j][(j+i)%n],dp[j][(j+i-1)%n]+abs(vec[j]-vec[(j+i)%n]));\\n\\t\\t mex = max(mex,dp[j][(j+i)%n]);\\n\\t\\t continue;\\n\\t\\t }\\n\\t\\t dp[j][(j+i)%n] = max(dp[j][(j+i)%n],\\n\\t\\t\\t\\t dp[k%n][(j+i)%n]+dp[j][k%n]);\\n\\t\\t}\\n\\t mex = max(mex,dp[j][(j+i)%n]);\\n\\t }\\n\\t}\\n\\n cout << mex << endl;\\n\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 1232,\n \"score_of_the_acc\": -0.0381,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2028_618962\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\nmain(){\\n int T, dp[100][100], n, d[100], s;\\n cin >> T;\\n while(T--){\\n cin >> n;\\n for(int i=0;i<n;i++) cin >> d[i];\\n fill(dp[0], dp[n], 0);\\n for(int k=1;k<n;k++){\\n for(int i=0;i<n;i++){\\n for(int j=0;j<k;j++){\\n s = (i+k)%n;\\n dp[i][s] = max(dp[i][s], dp[i][(i+j)%n] + dp[(i+j+1)%n][s] + abs(d[i] - d[(i+j+1)%n]));\\n }\\n }\\n }\\n int ans = 0;\\n for(int i=0;i<n;i++) ans = max(ans, dp[i][(i+n-1)%n]);\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 1196,\n \"score_of_the_acc\": -0.0439,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2028_618961\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\nmain(){\\n int T, dp[100][100], n, d[100], s, t;\\n cin >> T;\\n while(T--){\\n cin >> n;\\n for(int i=0;i<n;i++) cin >> d[i];\\n fill(dp[0], dp[n], 0);\\n for(int k=1;k<n;k++){\\n for(int i=0;i<n;i++){\\n for(int j=0;j<k;j++){\\n s = (i+k)%n;\\n t = (i+j+1)%n;\\n dp[i][s] = max(dp[i][s], dp[i][(i+j)%n] + dp[t][s] + abs(d[i] - d[t]));\\n }\\n }\\n }\\n int ans = 0;\\n for(int i=0;i<n;i++) ans = max(ans, dp[i][(i+n-1)%n]);\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 1196,\n \"score_of_the_acc\": -0.0426,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":1065,"cells":{"group_id":{"kind":"string","value":"aoj_2031_cpp"},"problem_description":{"kind":"string","value":"Problem B:\nHyper Rock-Scissors-Paper\nRock-Scissors-Paper is a game played with hands and often used for random choice of a person for some\npurpose. Today, we have got an extended version, namely,\nHyper Rock-Scissors-Paper\n(or Hyper RSP\nfor short).\nIn a game of Hyper RSP, the players simultaneously presents their hands forming any one of the following\n15 gestures: Rock, Fire, Scissors, Snake, Human, Tree, Wolf, Sponge, Paper, Air, Water, Dragon, Devil,\nLightning, and Gun.\nFigure 1: Hyper Rock-Scissors-Paper\nThe arrows in the figure above show the defeating relation. For example, Rock defeats Fire, Scissors,\nSnake, Human, Tree, Wolf, and Sponge. Fire defeats Scissors, Snake, Human, Tree, Wolf, Sponge, and\nPaper. Generally speaking, each hand defeats other seven hands located after in anti-clockwise order in\nthe figure. A player is said to win the game if the player’s hand defeats at least one of the other hands,\nand is not defeated by any of the other hands.\nYour task is to determine the winning hand, given multiple hands presented by the players.\nInput\nThe input consists of a series of data sets. The first line of each data set is the number\nN\nof the players\n(\nN\n< 1000). The next\nN\nlines are the hands presented by the players.\nThe end of the input is indicated by a line containing single zero.\nOutput\nFor each data set, output the winning hand in a single line. When there are no winners in the game,\noutput “Draw” (without quotes).\nSample Input\n8\nLightning\nGun\nPaper\nSponge\nWater\nDragon\nDevil\nAir\n3\nRock\nScissors\nPaper\n0\nOutput for the Sample Input\nSponge\nDraw"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2031_10858250","code_snippet":"#include <string>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nvector<string> r = {\n\t\"Rock\",\n\t\"Gun\",\n\t\"Lightning\",\n\t\"Devil\",\n\t\"Dragon\",\n\t\"Water\",\n\t\"Air\",\n\t\"Paper\",\n\t\"Sponge\",\n\t\"Wolf\",\n\t\"Tree\",\n\t\"Human\",\n\t\"Snake\",\n\t\"Scissors\",\n\t\"Fire\"\n};\nint n; string s;\nint main() {\n\twhile (cin >> n, n) {\n\t\tvector<int> v;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> s;\n\t\t\tv.push_back(find(r.begin(), r.end(), s) - r.begin());\n\t\t}\n\t\tstring ret = \"Draw\";\n\t\tfor (int i = 0; i < v.size(); i++) {\n\t\t\tbool win = false, lose = false;\n\t\t\tfor (int j = 0; j < v.size(); j++) {\n\t\t\t\tif (i == j) continue;\n\t\t\t\tint z = (v[j] - v[i] + 15) % 15;\n\t\t\t\tif (1 <= z && z <= 7) lose = true;\n\t\t\t\tif (8 <= z && z <= 14) win = true;\n\t\t\t}\n\t\t\tif (win && !lose) ret = r[v[i]];\n\t\t}\n\t\tcout << ret << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":140,"memory_kb":3308,"score_of_the_acc":-1.0389,"final_rank":19},{"submission_id":"aoj_2031_9544457","code_snippet":"#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\n15 gestures: \nRock, Fire, Scissors, Snake, Human, Tree, Wolf, Sponge, Paper, Air, Water, Dragon, Devil, Lightning, Gun\n*/\n\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nstatic char buf[25];\nconst int INF = 1000000000;\nconst int M = 7;\nconst int N = 15;\nstatic bool G[N][N];\nstatic int indeg[N];\nstatic int outdeg[N];\nstatic map<string,int> to_vert =\n{{\"Rock\", 0}, {\"Fire\", 1}, {\"Scissors\", 2}, {\"Snake\", 3}, {\"Human\", 4}, {\"Tree\", 5}, {\"Wolf\", 6}, {\"Sponge\", 7}, {\"Paper\", 8}, {\"Air\", 9}, {\"Water\", 10}, {\"Dragon\", 11}, {\"Devil\", 12}, {\"Lightning\", 13}, {\"Gun\", 14}};\nstatic vector<string> to_str =\n{\n \"Rock\",\"Fire\",\"Scissors\",\"Snake\",\"Human\"\n ,\"Tree\",\"Wolf\",\"Sponge\",\"Paper\",\"Air\"\n ,\"Water\",\"Dragon\",\"Devil\",\"Lightning\",\"Gun\"\n};\nvoid setup()\n{\n for (int v=0; v<N; ++v) for (int w=0; w<N; ++w) G[v][w] = false;\n for (int v=0; v<N; ++v)\n for (int m=1; m<=M; ++m)\n G[v][(v+m)%15] = true;\n}\n//------------------------------------------------------------------------------\nvoid solve(int K, const vector<int>& vs)\n{\n //--------------------------------------------------------------------------\n // base cases:\n //--------------------------------------------------------------------------\n // init:\n for (int v=0; v<N; ++v) { indeg[v] = 0; outdeg[v] = 0; }\n //--------------------------------------------------------------------------\n // compute:\n for (int k1=0; k1<K; ++k1)\n {\n for (int k2=0; k2<K; ++k2)\n {\n if (k2 == k1) continue;\n if (G[ vs[k1] ][ vs[k2] ])\n {\n outdeg[ vs[k1] ]++;\n indeg[ vs[k2] ]++;\n }\n }\n }\n //--------------------------------------------------------------------------\n bool winning = false;\n for (int v=0; v<N; ++v)\n if (!indeg[v] && outdeg[v])\n { printf(\"%s\\n\", to_str[v].c_str()); winning = true; break; }\n if (!winning) printf(\"Draw\\n\");\n}\n\n//------------------------------------------------------------------------------\nvoid test()\n{\n\n}\n\n//------------------------------------------------------------------------------\nint main()\n{\n //test(); return 0;\n //DEBUG = true;\n setup();\n //--------------------------------------------------------------------------\n int K, num;\n while (true)\n {\n num = scanf(\"%d \", &K);\n if (K == 0) break;\n vector<int> vs(K);\n for (int k=0; k<K; ++k)\n {\n num = scanf(\"%s \", buf);\n vs[k] = to_vert[string(buf)];\n }\n solve(K, vs);\n }\n //--------------------------------------------------------------------------\n return 0;\n}\n//------------------------------------------------------------------------------","accuracy":1,"time_ms":110,"memory_kb":3292,"score_of_the_acc":-1.0223,"final_rank":18},{"submission_id":"aoj_2031_3173923","code_snippet":"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <utility>\n#include <cstring>\nconst int MOD = 1e9 + 7;\nconst int dx[] = {1, -1, 0, 0};\nconst int dy[] = {0, 0, 1, -1};\nusing namespace std;\ntypedef long long ll;\nstring hands[] = {\"Rock\", \"Fire\", \"Scissors\", \"Snake\", \"Human\", \"Tree\", \"Wolf\", \"Sponge\",\"Paper\",\"Air\",\"Water\",\"Dragon\", \"Devil\",\"Lightning\",\"Gun\"};\nint check(string s)\n{\n\tfor(int i = 0; i < 15; i++)\n\t\tif(hands[i] == s)\n\t\t\treturn i;\n}\nint main()\n{\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tint n;\n\twhile(cin >> n, n)\n\t{\n\t\tint table[15][15];\n\t\tint flag[15] = {};\n\t\tmemset(table, -1, sizeof(table));\n\t\tfor(int i = 0; i < 15; i++)\n\t\t{\n\t\t\tbool flag = false;\n\t\t\tfor(int j = 0; j < 15; j++)\n\t\t\t{\n\t\t\t\tint cnt = 7;\n\t\t\t\tif(i == j) \n\t\t\t\t{\n\t\t\t\t\ttable[i][j] = 0;\n\t\t\t\t\tint x = j;\n\t\t\t\t\twhile(cnt--)\n\t\t\t\t\t{\n\t\t\t\t\t\tx++;\n\t\t\t\t\t\ttable[i][x % 15] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tstring str[n + 1];\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tcin >> str[i];\n\t\tint num[n + 1] = {};\n\t\tint max_p = 0, p;\n\t\tfor(int i = 0; i < n; i++)\n\t\t{\n\t\t\tint y = check(str[i]);\n\t\t\tfor(int j = 0; j < n; j++)\n\t\t\t{\n\t\t\t\tint x = check(str[j]);\n\t\t\t\tif(table[y][x] == -1)\n\t\t\t\t{\n\t\t\t\t\tnum[i] = -1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse \n\t\t\t\t\tnum[i] += table[y][x];\n\t\t\t}\n\t\t\tif(num[i] > max_p)\n\t\t\t{\n\t\t\t\tmax_p = num[i];\n\t\t\t\tp = i;\n\t\t\t}\n\t\t}\n\t\tif(max_p == 0)\n\t\t\tcout << \"Draw\" << endl;\n\t\telse\t\n\t\t\tcout << str[p] << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3068,"score_of_the_acc":-0.8973,"final_rank":12},{"submission_id":"aoj_2031_3173371","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n,cnt;\n int w[15],t[15];\n string s;\n while(1){\n cin>>n;\n if(n==0) break;\n cnt=0;\n for(int i=0;i<15;i++){\n w[i]=1;\n t[i]=0;\n }\n for(int i=0;i<n;i++){\n cin>>s;\n if(s[0]=='R'){\n\tt[0]=1;\n\tfor(int j=1;j<8;j++){\n\t w[j]=0;\n\t}\n }\n else if(s[0]=='F'){\n\tt[1]=1;\n\tfor(int j=2;j<9;j++){\n\t w[j]=0;\n\t}\n }\n else if(s[0]=='S'){\n\t if(s[1]=='c'){\n\t t[2]=1;\n\t for(int j=3;j<10;j++){\n\t w[j]=0;\n\t }\n\t }\n\t else if(s[1]=='n'){\n\t t[3]=1;\n\t for(int j=4;j<11;j++){\n\t w[j]=0;\n\t }\n\t }\n\t else if(s[1]=='p'){\n\t t[7]=1;\n\t for(int j=8;j<15;j++){\n\t w[j]=0;\n\t }\n\t }\n }\n else if(s[0]=='H'){\n\t t[4]=1;\n\t for(int j=5;j<12;j++){\n\t w[j]=0;\n\t }\n }\n else if(s[0]=='T'){\n\t t[5]=1;\n\t for(int j=6;j<13;j++){\n\t w[j]=0;\n\t }\n }\n else if(s[0]=='W'){\n\t if(s[1]=='o'){\n\t t[6]=1;\n\t for(int j=7;j<14;j++){\n\t w[j]=0;\n\t }\n\t }\n\t else if(s[1]=='a'){\n\t t[10]=1;\n\t for(int j=11;j<15;j++){\n\t w[j]=0;\n\t }\n\t for(int j=0;j<3;j++){\n\t w[j]=0;\n\t }\n\t }\n }\n else if(s[0]=='P'){\n\t t[8]=1;\n\t w[0]=0;\n\t for(int j=9;j<15;j++){\n\t w[j]=0;\n\t }\n }\n else if(s[0]=='A'){\n\t t[9]=1;\n\t w[0]=0;\n\t w[1]=0;\n\t for(int j=10;j<15;j++){\n\t w[j]=0;\n\t }\n }\n else if(s[0]=='D'){\n\tif(s[1]=='r'){\n\t t[11]=1;\n\t for(int j=12;j<15;j++){\n\t w[j]=0;\n\t }\n\t for(int j=0;j<4;j++){\n\t w[j]=0;\n\t }\n\t}\n\telse if(s[1]=='e'){\n\t t[12]=1;\n\t for(int j=13;j<15;j++){\n\t w[j]=0;\n\t }\n\t for(int j=0;j<5;j++){\n\t w[j]=0;\n\t }\n\t}\n }\n else if(s[0]=='L'){\n\tt[13]=1;\n\tw[14]=0;\n\tfor(int j=0;j<6;j++){\n\t w[j]=0;\n\t}\n }\n else if(s[0]=='G'){\n\tt[14]=1;\n\tfor(int j=0;j<7;j++){\n\t w[j]=0;\n\t}\n }\n }\n for(int i=0;i<15;i++){\n if(t[i]==1) cnt++;\n }\n if(cnt==1) cout<<\"Draw\"<<endl;\n else{\n for(int i=0;i<15;i++){\n\tif(t[i]==1){\n\t if(w[i]==1){\n\t if(i==0){\n\t cout<<\"Rock\"<<endl;\n\t break;\n\t }\n\t else if(i==1){\n\t cout<<\"Fire\"<<endl;\n\t break;\n\t }\n\t else if(i==2){\n\t cout<<\"Scissors\"<<endl;\n\t break;\n\t }\n\t else if(i==3){\n\t cout<<\"Snake\"<<endl;\n\t break;\n\t }\n\t else if(i==4){\n\t cout<<\"Human\"<<endl;\n\t break;\n\t }\n\t else if(i==5){\n\t cout<<\"Tree\"<<endl;\n\t break;\n\t }\n\t else if(i==6){\n\t cout<<\"Wolf\"<<endl;\n\t break;\n\t }\n\t else if(i==7){\n\t cout<<\"Sponge\"<<endl;\n\t break;\n\t }\n\t else if(i==8){\n\t cout<<\"Paper\"<<endl;\n\t break;\n\t }\n\t else if(i==9){\n\t cout<<\"Air\"<<endl;\n\t break;\n\t }\n\t else if(i==10){\n\t cout<<\"Water\"<<endl;\n\t break;\n\t }\n\t else if(i==11){\n\t cout<<\"Dragon\"<<endl;\n\t break;\n\t }\n\t else if(i==12){\n\t cout<<\"Devil\"<<endl;\n\t break;\n\t }\n\t else if(i==13){\n\t cout<<\"Lightning\"<<endl;\n\t break;\n\t }\n\t else if(i==14){\n\t cout<<\"Gun\"<<endl;\n\t break;\n\t }\n\t }\n\t}\n\tif(i==14) cout<<\"Draw\"<<endl;\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3144,"score_of_the_acc":-0.9216,"final_rank":14},{"submission_id":"aoj_2031_3173348","code_snippet":"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <utility>\n#include <cstring>\nconst int MOD = 1e9 + 7;\nconst int dx[] = {1, -1, 0, 0};\nconst int dy[] = {0, 0, 1, -1};\nusing namespace std;\ntypedef long long ll;\nstring hands[] = {\"Rock\", \"Fire\", \"Scissors\", \"Snake\", \"Human\", \"Tree\", \"Wolf\", \"Sponge\",\"Paper\",\"Air\",\"Water\",\"Dragon\", \"Devil\",\"Lightning\",\"Gun\"};\nint check(string s)\n{\n\tfor(int i = 0; i < 15; i++)\n\t\tif(hands[i] == s)\n\t\t\treturn i;\n}\nint main()\n{\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tint n;\n\twhile(cin >> n, n)\n\t{\n\t\tint table[15][15];\n\t\tint flag[15] = {};\n\t\tmemset(table, -1, sizeof(table));\n\t\tfor(int i = 0; i < 15; i++)\n\t\t{\n\t\t\tbool flag = false;\n\t\t\tfor(int j = 0; j < 15; j++)\n\t\t\t{\n\t\t\t\tint cnt = 7;\n\t\t\t\tif(i == j) \n\t\t\t\t{\n\t\t\t\t\ttable[i][j] = 0;\n\t\t\t\t\tint x = j;\n\t\t\t\t\twhile(cnt--)\n\t\t\t\t\t{\n\t\t\t\t\t\tx++;\n\t\t\t\t\t\ttable[i][x % 15] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tstring str[n + 1];\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tcin >> str[i];\n\t\tint num[n + 1] = {};\n\t\tint max_p = 0, p;\n\t\tfor(int i = 0; i < n; i++)\n\t\t{\n\t\t\tint y = check(str[i]);\n\t\t\tfor(int j = 0; j < n; j++)\n\t\t\t{\n\t\t\t\tint x = check(str[j]);\n\t\t\t\tif(table[y][x] == -1)\n\t\t\t\t{\n\t\t\t\t\tnum[i] = -1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse \n\t\t\t\t\tnum[i] += table[y][x];\n\t\t\t}\n\t\t\tif(num[i] > max_p)\n\t\t\t{\n\t\t\t\tmax_p = num[i];\n\t\t\t\tp = i;\n\t\t\t}\n\t\t}\n\t\tif(max_p == 0)\n\t\t\tcout << \"Draw\" << endl;\n\t\telse\t\n\t\t\tcout << str[p] << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3216,"score_of_the_acc":-0.968,"final_rank":17},{"submission_id":"aoj_2031_3173110","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;;\n\nll to_num(string s){\n if(s==\"Rock\"){return 0;}\n if(s==\"Fire\"){return 1;}\n if(s==\"Scissors\"){return 2;}\n if(s==\"Snake\"){return 3;}\n if(s==\"Human\"){return 4;}\n if(s==\"Tree\"){return 5;}\n if(s==\"Wolf\"){return 6;}\n if(s==\"Sponge\"){return 7;}\n if(s==\"Paper\"){return 8;}\n if(s==\"Air\"){return 9;}\n if(s==\"Water\"){return 10;}\n if(s==\"Dragon\"){return 11;}\n if(s==\"Devil\"){return 12;}\n if(s==\"Lightning\"){return 13;}\n if(s==\"Gun\"){return 14;}\n return -1;\n}\n\nstring ans(ll a){\n if(a==0){return \"Rock\";}\n if(a==1)return \"Fire\";\n if(a==2)return \"Scissors\";\n if(a==3)return \"Snake\";\n if(a==4)return \"Human\";\n if(a==5)return \"Tree\";\n if(a==6)return \"Wolf\";\n if(a==7){return \"Sponge\";}\n if(a==8){return \"Paper\";}\n if(a==9){return \"Air\";}\n if(a==10){return \"Water\";}\n if(a==11){return \"Dragon\";}\n if(a==12){return \"Devil\";}\n if(a==13){return \"Lightning\";}\n if(a==14){return \"Gun\";}\n return \"!\";\n}\n\n\nint main(){\n while(1){\n vector<ll> count(30,0);\n ll n;\n cin>>n;\n if(n==0){break;}\n for(int i=0;i<n;i++){\n string s;\n cin>>s;\n count[to_num(s)]++;\n count[to_num(s)+15]++;\n }\n for(int i=1;i<30;i++){\n count[i]+=count[i-1];\n }\n bool done=false;\n for(int i=0;i<15 && !done;i++){\n if(i==0){\n if(count[i]!=0){\n\tif(count[i]==n){cout<<\"Draw\"<<endl; done=true;}\n\telse if(count[i+7]==n){cout<<\"Rock\"<<endl; done=true;}\n }\n }\n else{\n if(count[i]-count[i-1]!=0){\n\tif(count[i]-count[i-1]==n){cout<<\"Draw\"<<endl; done=true;}\n\telse if(count[i+7]-count[i-1]==n){cout<<ans(i)<<endl; done=true;}\n }\n }\n }\n if(!done){cout<<\"Draw\"<<endl;}\n\n }\n\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3044,"score_of_the_acc":-0.8768,"final_rank":10},{"submission_id":"aoj_2031_2855615","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\n\nld dis(pair<ld, ld>l, pair<ld, ld>r) {\n\tld dx=l.first-r.first;\n\tld dy=l.second-r.second;\n\treturn sqrt(ld(dx)*dx+ ld(dy)*dy);\n}\n\nld get_x(pair<ld, ld>f, pair<ld, ld>t, ld y) {\n\tif(f.second>t.second)return get_x(t,f,y);\n\n\tld a=y-f.second;\n\tld b=t.second-y;\n\n\treturn (t.first*a+f.first*b)/(a+b);\n}\n\nint main() {\n\tvector<string>sts{ \n\t\t\"Rock\",\"Fire\",\"Scissors\",\"Snake\",\"Human\",\"Tree\",\"Wolf\",\"Sponge\",\"Paper\",\"Air\",\"Water\",\"Dragon\",\"Devil\",\"Lightning\",\"Gun\" };\n\twhile (true) {\n\t\tint N;cin>>N;\n\t\tif(!N)break;\n\t\tvector<int>nums(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tstring st;cin>>st;\n\t\t\tnums[i]=find(sts.begin(),sts.end(),st)-sts.begin();\n\t\t\tassert(nums[i]!=15);\n\t\t}\n\t\tint ans_id=-1;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint ok=true;\n\t\t\tint num=0;\n\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\tif(i==j)continue;\n\t\t\t\tint a=nums[i];\n\t\t\t\tint b=nums[j];\n\n\t\t\t\tint sa=a-b;\n\t\t\t\tif(sa<0)sa+=15;\n\t\t\t\tif (sa == 0) {\n\n\t\t\t\t}\n\t\t\t\telse if (sa <= 7) {\n\t\t\t\t\tok=false;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tnum++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ok&&num>0)ans_id=i;\n\t\t}\n\t\tif(ans_id==-1)cout<<\"Draw\"<<endl;\n\t\telse cout<<sts[nums[ans_id]]<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":120,"memory_kb":3140,"score_of_the_acc":-0.9526,"final_rank":16},{"submission_id":"aoj_2031_2521166","code_snippet":"#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nstring t,s[] = {\"Rock\", \"Fire\", \"Scissors\", \"Snake\", \"Human\",\"Tree\", \"Wolf\", \"Sponge\", \"Paper\", \"Air\",\"Water\", \"Dragon\", \"Devil\", \"Lightning\", \"Gun\" };\nint a[30],b[30];\nmain(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tset<int>st;\n\t\tr(i,30)a[i]=b[i]=0;\n\t\tr(i,n){\n\t\t\tcin>>t;\n\t\t\tr(j,15)if(s[j]==t){\n\t\t\t\tst.insert(j);\n\t\t\t\tr(k,7){\n\t\t\t\t b[j]++;\n\t\t\t \t a[(j+k+1)%15]++;\n\t\t\t \t}\n\t\t\t }\n\t\t}\n\t\tvector<string>v;\n\t\tr(i,15)if(b[i]&&!a[i])v.push_back(s[i]);\n\t\tif(v.size()==1&&st.size()!=1)cout<<v[0]<<endl;\n\t\telse cout<<\"Draw\"<<endl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":3104,"score_of_the_acc":-0.9025,"final_rank":13},{"submission_id":"aoj_2031_1896670","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nint main(){\n\tmap<string,int>m;\n\tm[\"Rock\"]=1;\n\tm[\"Fire\"]=2;\n\tm[\"Scissors\"]=3;\n\tm[\"Snake\"]=4;\n\tm[\"Human\"]=5;\n\tm[\"Tree\"]=6;\n\tm[\"Wolf\"]=7;\n\tm[\"Sponge\"]=8;\n\tm[\"Paper\"]=9;\n\tm[\"Air\"]=10;\n\tm[\"Water\"]=11;\n\tm[\"Dragon\"]=12;\n\tm[\"Devil\"]=13;\n\tm[\"Lightning\"]=14;\n\tm[\"Gun\"]=15;\n\tint n;\n\twhile(cin>>n,n){\n\t\tvector<string>in(n);\n\t\trep(i,n)cin>>in[i];\n\t\tin.erase(unique(all(in)),in.end());\n\t\tif(in.size()==1){\n\t\t\tcout<<\"Draw\"<<endl;\n\t\t\tcontinue;\n\t\t}\n\t\tvi w(in.size());\n\t\trep(i,in.size())w[i]=m[in[i]];\n\t\tbool h=false;\n\t\trep(i,in.size()){\n\t\t\tbool hh=true;\n\t\t\trep(j,in.size()){\n\t\t\t\tint t=w[i],s=w[j];\n\t\t\t\tif(t==s)continue;\n\t\t\t\tif(t>s&&t-s<8||t<s&&15-s+t<8)hh=false;\n\t\t\t}\n\t\t\tif(hh){\n\t\t\t\th=true;\n\t\t\t\tcout<<in[i]<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(!h)cout<<\"Draw\"<<endl;\n\t}\n}","accuracy":1,"time_ms":80,"memory_kb":1276,"score_of_the_acc":-0.0496,"final_rank":7},{"submission_id":"aoj_2031_1896666","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nint main(){\n\tmap<string,int>m;\n\tm[\"Rock\"]=1;\n\tm[\"Fire\"]=2;\n\tm[\"Scissors\"]=3;\n\tm[\"Snake\"]=4;\n\tm[\"Human\"]=5;\n\tm[\"Tree\"]=6;\n\tm[\"Wolf\"]=7;\n\tm[\"Sponge\"]=8;\n\tm[\"Paper\"]=9;\n\tm[\"Air\"]=10;\n\tm[\"Water\"]=11;\n\tm[\"Dragon\"]=12;\n\tm[\"Devil\"]=13;\n\tm[\"Lightning\"]=14;\n\tm[\"Gun\"]=15;\n\tint n;\n\twhile(cin>>n,n){\n\t\tvector<string>in(n);\n\t\trep(i,n)cin>>in[i];\n\t\tin.erase(unique(all(in)),in.end());\n\t\tif(in.size()==1){\n\t\t\tcout<<\"Draw\"<<endl;\n\t\t\tcontinue;\n\t\t}\n\t\tbool h=false;\n\t\trep(i,in.size()){\n\t\t\tbool hh=true;\n\t\t\trep(j,in.size()){\n\t\t\t\tint t=m[in[i]],s=m[in[j]];\n\t\t\t\tif(t==s)continue;\n\t\t\t\tif(t>s&&t-s<8||t<s&&15-s+t<8)hh=false;\n\t\t\t}\n\t\t\tif(hh){\n\t\t\t\th=true;\n\t\t\t\tcout<<in[i]<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(!h)cout<<\"Draw\"<<endl;\n\t}\n}","accuracy":1,"time_ms":1460,"memory_kb":1272,"score_of_the_acc":-0.4609,"final_rank":9},{"submission_id":"aoj_2031_1882385","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX 15\n \nconst string gesture[MAX] = {\n \"Rock\",\"Fire\",\"Scissors\",\"Snake\",\"Human\",\"Tree\",\"Wolf\",\"Sponge\",\n \"Paper\",\"Air\",\"Water\",\"Dragon\",\"Devil\",\"Lightning\",\"Gun\"\n};\n \nvector<int> v;\nbool ges[MAX];\n \nint solve(){\n int res = -1, N = (int)v.size();\n \n if(N == 1){\n\treturn res;\n } \n \n for(int i = 0 ; i < N ; i++){\n\tint win = 0, lose = 0;\n\tfor(int j = 0 ; j < MAX ; j++){\n\t if(v[i] == j || !ges[j]){\n\t\tcontinue;\n\t }\n\n\t int cnt = 0, pos = v[i];\n\t while(true){\n\t\tpos++; cnt++;\n\t\tif(pos >= MAX){\n\t\t pos = 0;\n\t\t}\n \n\t\tif(j == pos){\n\t\t if(cnt > 7){\n\t\t\tlose++;\n\t\t }else{\n\t\t\twin++;\n\t\t }\n\t\t break;\n\t\t}\n\t }\n\t}\n\tif(win == N-1){\n\t res = v[i];\n\t break;\n\t}\n }\n \n return res;\n}\n \nint main(){\n int n;\n \n while(cin >> n ,n){\n\tstring str;\n\tset<string> st;\n \n\tv.clear();\n\tmemset(ges,false,sizeof(ges));\n \n\tfor(int i = 0 ; i < n ; i++){\n\t cin >> str;\n\t if(st.count(str)){\n\t\tcontinue;\n\t }\n\t for(int j = 0 ; j < MAX ; j++){\n\t\tif(gesture[j] == str){\n\t\t v.push_back(j);\n\t\t st.insert(str);\n\t\t ges[j] = true;\n\t\t break;\n\t\t}\n\t }\n\t}\n \n\tsort(v.begin(),v.end());\n\tint ans = solve();\n \n\tif(ans == -1){\n\t cout << \"Draw\" << endl;\n\t}else{\n\t cout << gesture[ans] << endl;\n\t}\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3144,"score_of_the_acc":-0.9216,"final_rank":14},{"submission_id":"aoj_2031_1800711","code_snippet":"#include<iostream>\n#include<string>\nusing namespace std;\nstring S[15] = { \"Rock\", \"Fire\", \"Scissors\", \"Snake\", \"Human\", \"Tree\", \"Wolf\", \"Sponge\", \"Paper\", \"Air\", \"Water\", \"Dragon\", \"Devil\", \"Lightning\", \"Gun\" };\nint N, a[10000], c[15]; string T;\nbool solve(int a, int b) {\n\tif (a > b)b += 15;\n\tif (b - a <= 7)return true;\n\treturn false;\n}\nint main() {\n\twhile (true) {\n\t\tcin >> N;\n\t\tif (N == 0)break;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tcin >> T;\n\t\t\tfor (int j = 0; j < 15; j++) {\n\t\t\t\tif (T == S[j])a[i] = j;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < 15; i++)c[i] = 0;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 0; j < N; j++) {\n\t\t\t\tif (!solve(a[i], a[j]))goto E;\n\t\t\t}\n\t\t\tc[a[i]] = 1;\n\t\tE:;\n\t\t}\n\t\tint G = 0;\n\t\tfor (int i = 0; i < N - 1; i++) {\n\t\t\tif (a[i] != a[i + 1])G = 1;\n\t\t}\n\t\tint P = 0;\n\t\tif (G == 0)goto F;\n\t\tfor (int i = 0; i < 15; i++) {\n\t\t\tif (c[i] == 1) {\n\t\t\t\tP = 1; cout << S[i] << endl;\n\t\t\t}\n\t\t}\n\tF:;\n\t\tif (P == 0)cout << \"Draw\" << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1220,"score_of_the_acc":-0.0049,"final_rank":2},{"submission_id":"aoj_2031_1718302","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n string mp[]={\"Rock\",\"Gun\",\"Lightning\",\"Devil\",\"Dragon\",\"Water\",\"Air\",\"Paper\",\"Sponge\",\"Wolf\",\"Tree\",\"Human\",\"Snake\",\"Scissors\",\"Fire\"};\n\n int n;\n while(cin>>n,n){\n string str[1001];\n for(int i=0;i<n;i++) cin>>str[i];\n \n string ans=\"Draw\";\n set<string> S;\n for(int i=0;i<n;i++){\n if(S.count(str[i]))continue;\n S.insert(str[i]);\n int A=0;\n while(str[i]!=mp[A])A++;\t\n int j;\n for(j=0;j<n;j++){\n\tif(str[i]==str[j])continue;\n\tint B=0;\n\twhile(str[j]!=mp[B])B++;\t\n\tif((15+B-A)%15<=7)break;\n }\n if(j==n) ans=str[i];\n }\n \n for(int i=1;i<n&&str[0]==str[i];i++)if(i==n-1)ans=\"Draw\"; \n\n cout << ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1276,"score_of_the_acc":-0.0347,"final_rank":3},{"submission_id":"aoj_2031_1710839","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n \nint main() {\n string s[15]={\"Rock\",\"Fire\",\"Scissors\",\"Snake\",\"Human\",\"Tree\",\"Wolf\",\"Sponge\",\"Paper\",\"Air\",\"Water\",\"Dragon\",\"Devil\",\"Lightning\",\"Gun\"};\n map<string,int> r;\n for(int i=0; i<15; i++) r[s[i]]=i;\n int n;\n while(cin >> n && n) {\n map<string,int> m;\n string t[n];\n for(int i=0; i<n; i++) {\n cin >> t[i];\n m[t[i]]++;\n }\n set<string> ans;\n for(int i=0; i<n; i++) {\n int k=r[t[i]];\n int c=0,c2=0;\n for(int j=0; j<7; j++) c+=m[s[(k+j+1)%15]];\n for(int j=0; j<7; j++) c2+=m[s[(k+j+8)%15]];\n if(c&&!c2) ans.insert(t[i]);\n }\n if(ans.size()==1) cout << *ans.begin() << endl;\n else cout << \"Draw\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":1276,"score_of_the_acc":-0.0466,"final_rank":4},{"submission_id":"aoj_2031_1710762","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nstring t[15]={\n \"Rock\",\n \"Fire\",\n \"Scissors\",\n \"Snake\",\n \"Human\",\n \"Tree\",\n \"Wolf\",\n \"Sponge\",\n \"Paper\",\n \"Air\",\n \"Water\",\n \"Dragon\",\n \"Devil\",\n \"Lightning\",\n \"Gun\"\n};\n\nint search(string s){\n for(int i=0;i<15;i++)if(t[i]==s)return i;\n assert(0);\n return 0;\n}\n\nint check(int a,int b){\n if(a==b)return 0;\n for(int i=1;i<=7;i++)if( (a+i)%15==b )return 1;\n return -1;\n}\n\nint main(){\n int n;\n while(1){\n cin>>n;\n if(n==0)break;\n vector<string> t(n);\n vector<int> u(n);\n for(int i=0;i<n;i++){\n cin>>t[i];\n u[i]=search(t[i]);\n }\n \n string ans=\"Draw\";\n for(int i=0;i<n;i++){\n int A=0,B=0;\n for(int j=0;j<n;j++){\n int k=check(u[i],u[j]);\n if(k==1)A++;\n if(k==-1)B++;\n }\n if(A>0&&B==0)ans=t[i];\n }\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":460,"memory_kb":1272,"score_of_the_acc":-0.1615,"final_rank":8},{"submission_id":"aoj_2031_1710758","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\n\nint main(){\n int n,vlen;\n string str,ans;\n set<string> s;\n vector<string> v;\n vector<P> defdata;//1,0\n string d[15]={\n \"Rock\",\"Fire\",\"Scissors\",\"Snake\",\"Human\",\n \"Tree\",\"Wolf\",\"Sponge\",\"Paper\",\"Air\",\n \"Water\",\"Dragon\",\"Devil\",\"Lightning\",\"Gun\"\n };\n while(1){\n cin>>n;\n if(!n)break;\n for(int i=0;i<n;i++){\n cin>>str;\n s.insert(str);\n }\n for(int i=0;i<15;i++){\n set<string>::iterator ite;\n for(ite=s.begin();ite!=s.end();ite++){\n\tif(d[i]==(*ite)){\n\t v.push_back(d[i]);\n\t defdata.push_back(P(0,0));\n\t}\n }\n }\n vlen=v.size();\n for(int i=0;i<vlen;i++){\n for(int j=i+1;j<vlen;j++){\n\tint iid,jid;\n\tfor(int k=0;k<15;k++)\n\t if(v[i]==d[k])iid=k;\n\tfor(int k=0;k<15;k++)\n\t if(v[j]==d[k])jid=k;\n\tif(jid-iid<=7){\n\t defdata[i].first++;\n\t defdata[j].second++;\n\t}\n\tif(iid+15-jid<=7){\n\t defdata[j].first++;\n\t defdata[i].second++;\n\t}\n }\n }\n ans=\"0\";\n for(int i=0;i<vlen;i++){\n int w=defdata[i].first;\n int l=defdata[i].second;\n if(w&&!l)ans=v[i];\n }\n if(ans!=\"0\")cout<<ans<<endl;\n else cout<<\"Draw\"<<endl;\n s.clear();\n v.clear();\n defdata.clear();\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1216,"score_of_the_acc":-0.003,"final_rank":1},{"submission_id":"aoj_2031_1710750","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define REP(asd,fgh) for(int asd=0; asd<fgh; asd++)\n\nint main(void){\n vector< vector<string> > defeat;\n string handlist[] = {\"Rock\", \"Fire\", \"Scissors\", \"Snake\", \"Human\", \"Tree\", \"Wolf\", \"Sponge\", \"Paper\", \"Air\", \"Water\", \"Dragon\", \"Devil\", \"Lightning\", \"Gun\"};\n map<string, int> hand;\n REP(i, 15){\n hand[handlist[i]] = i;\n }\n \n int N;\n while(cin >> N, N){\n vector<string> players(N);\n string ans = \"Draw\";\n REP(i, N){\n cin >> players[i];\n }\n string same = players[0];\n bool draw = true;\n REP(i, N){\n if(players[i] != same) draw = false;\n }\n if(draw){\n cout << ans << endl;\n continue;\n }\n REP(i, N){\n bool flg = true;\n REP(j, N){\n\tif(i == j) continue;\n\tif(!(((hand[players[j]] - hand[players[i]])+15)%15 <= 7)){\n\t flg = false;\n\t}\n }\n if(flg)\n\tans = players[i];\n }\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":2910,"memory_kb":1272,"score_of_the_acc":-0.895,"final_rank":11},{"submission_id":"aoj_2031_1710720","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n string s[15]={\"Rock\",\"Fire\",\"Scissors\",\"Snake\",\"Human\",\"Tree\",\"Wolf\",\"Sponge\",\"Paper\",\"Air\",\"Water\",\"Dragon\",\"Devil\",\"Lightning\",\"Gun\"};\n map<string,int> r;\n for(int i=0; i<15; i++) r[s[i]]=i;\n int n;\n while(cin >> n && n) {\n map<string,int> m;\n string t[n];\n for(int i=0; i<n; i++) {\n cin >> t[i];\n m[t[i]]++;\n }\n set<string> ans;\n for(int i=0; i<n; i++) {\n int k=r[t[i]];\n int c=0,c2=0;\n for(int j=0; j<7; j++) c+=m[s[(k+j+1)%15]];\n for(int j=0; j<7; j++) c2+=m[s[(k+j+8)%15]];\n if(c&&!c2) ans.insert(t[i]);\n }\n if(ans.size()==1) cout << *ans.begin() << endl;\n else cout << \"Draw\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":1280,"score_of_the_acc":-0.0486,"final_rank":6},{"submission_id":"aoj_2031_1577650","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 \nconst static int tx[] = {0,1,0,-1};\nconst static int ty[] = {-1,0,1,0};\n\nconst static double EPS = 1e-8;\n\nint main(){\n int num_of_players;\n map<string,int> dict;\n dict[\"Rock\"] = 0;\n dict[\"Fire\"] = 1;\n dict[\"Scissors\"] = 2;\n dict[\"Snake\"] = 3;\n dict[\"Human\"] = 4;\n dict[\"Tree\"] = 5;\n dict[\"Wolf\"] = 6;\n dict[\"Sponge\"] = 7;\n dict[\"Paper\"] = 8;\n dict[\"Air\"] = 9;\n dict[\"Water\"] = 10;\n dict[\"Dragon\"] = 11;\n dict[\"Devil\"] = 12;\n dict[\"Lightning\"] = 13;\n dict[\"Gun\"] = 14;\n\n map<int,bool> canWin;\n for(int hand_i = 0; hand_i < 15; hand_i++){\n for(int hand_j = 0; hand_j < 15; hand_j++){\n canWin[hand_i * 15 + hand_j] = false;\n for(int offset = 1; offset <= 7; offset++){\n if(hand_j == (hand_i + offset) % 15){\n canWin[hand_i * 15 + hand_j] = true;\n }\n }\n }\n }\n\n while(~scanf(\"%d\",&num_of_players)){\n if(num_of_players == 0){\n break;\n }\n vector<string> players;\n for(int player_i = 0; player_i < num_of_players; player_i++){\n string hand;\n cin >> hand;\n players.push_back(hand);\n }\n\n map<string,bool> lose;\n map<string,bool> win;\n\n set<string> hands;\n for(int player_i = 0; player_i < num_of_players; player_i++){\n hands.insert(players[player_i]);\n }\n for(set<string>::iterator ally_it = hands.begin(); ally_it != hands.end(); ally_it++){\n for(set<string>::iterator foe_it = hands.begin(); foe_it != hands.end(); foe_it++){\n if(canWin[dict[*ally_it] * 15 + dict[*foe_it]]){\n win[*ally_it] = true;\n lose[*foe_it] = true;\n }\n }\n }\n\n string res = \"Draw\";\n for(set<string>::iterator ally_it = hands.begin(); ally_it != hands.end(); ally_it++){\n if(win[*ally_it] && !lose[*ally_it]){\n res = *ally_it;\n }\n }\n printf(\"%s\\n\",res.c_str());\n }\n}","accuracy":1,"time_ms":30,"memory_kb":1304,"score_of_the_acc":-0.0481,"final_rank":5},{"submission_id":"aoj_2031_1577646","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 \nconst static int tx[] = {0,1,0,-1};\nconst static int ty[] = {-1,0,1,0};\n\nconst static double EPS = 1e-8;\n\nint main(){\n int num_of_players;\n map<string,int> dict;\n dict[\"Rock\"] = 0;\n dict[\"Fire\"] = 1;\n dict[\"Scissors\"] = 2;\n dict[\"Snake\"] = 3;\n dict[\"Human\"] = 4;\n dict[\"Tree\"] = 5;\n dict[\"Wolf\"] = 6;\n dict[\"Sponge\"] = 7;\n dict[\"Paper\"] = 8;\n dict[\"Air\"] = 9;\n dict[\"Water\"] = 10;\n dict[\"Dragon\"] = 11;\n dict[\"Devil\"] = 12;\n dict[\"Lightning\"] = 13;\n dict[\"Gun\"] = 14;\n\n map<int,bool> canWin;\n for(int hand_i = 0; hand_i < 15; hand_i++){\n for(int hand_j = 0; hand_j < 15; hand_j++){\n canWin[hand_i * 15 + hand_j] = false;\n for(int offset = 1; offset <= 7; offset++){\n if(hand_j == (hand_i + offset) % 15){\n canWin[hand_i * 15 + hand_j] = true;\n }\n }\n }\n }\n\n while(~scanf(\"%d\",&num_of_players)){\n if(num_of_players == 0){\n break;\n }\n vector<string> players;\n for(int player_i = 0; player_i < num_of_players; player_i++){\n string hand;\n cin >> hand;\n players.push_back(hand);\n }\n\n bool lose[1001] = {};\n bool win[1001] = {};\n for(int player_i = 0; player_i < num_of_players; player_i++){\n for(int player_j = player_i + 1; player_j < num_of_players; player_j++){\n if(canWin[dict[players[player_i]] * 15 + dict[players[player_j]]]){\n lose[player_j] = true;\n win[player_i] = true;\n }\n if(canWin[dict[players[player_j]] * 15 + dict[players[player_i]]]){\n lose[player_i] = true;\n win[player_j] = true;\n }\n }\n }\n\n string res = \"Draw\";\n for(int player_i = 0; player_i < num_of_players; player_i++){\n if(!lose[player_i] && win[player_i]){\n res = players[player_i];\n break;\n }\n }\n printf(\"%s\\n\",res.c_str());\n }\n}","accuracy":1,"time_ms":3350,"memory_kb":1304,"score_of_the_acc":-1.0421,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_2031_10858250\",\n \"code_snippet\": \"#include <string>\\n#include <vector>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nvector<string> r = {\\n\\t\\\"Rock\\\",\\n\\t\\\"Gun\\\",\\n\\t\\\"Lightning\\\",\\n\\t\\\"Devil\\\",\\n\\t\\\"Dragon\\\",\\n\\t\\\"Water\\\",\\n\\t\\\"Air\\\",\\n\\t\\\"Paper\\\",\\n\\t\\\"Sponge\\\",\\n\\t\\\"Wolf\\\",\\n\\t\\\"Tree\\\",\\n\\t\\\"Human\\\",\\n\\t\\\"Snake\\\",\\n\\t\\\"Scissors\\\",\\n\\t\\\"Fire\\\"\\n};\\nint n; string s;\\nint main() {\\n\\twhile (cin >> n, n) {\\n\\t\\tvector<int> v;\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tcin >> s;\\n\\t\\t\\tv.push_back(find(r.begin(), r.end(), s) - r.begin());\\n\\t\\t}\\n\\t\\tstring ret = \\\"Draw\\\";\\n\\t\\tfor (int i = 0; i < v.size(); i++) {\\n\\t\\t\\tbool win = false, lose = false;\\n\\t\\t\\tfor (int j = 0; j < v.size(); j++) {\\n\\t\\t\\t\\tif (i == j) continue;\\n\\t\\t\\t\\tint z = (v[j] - v[i] + 15) % 15;\\n\\t\\t\\t\\tif (1 <= z && z <= 7) lose = true;\\n\\t\\t\\t\\tif (8 <= z && z <= 14) win = true;\\n\\t\\t\\t}\\n\\t\\t\\tif (win && !lose) ret = r[v[i]];\\n\\t\\t}\\n\\t\\tcout << ret << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -1.0389,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2031_9544457\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\nusing namespace std;\\n//make -f ../makefile SRC=\\n/*\\n15 gestures: \\nRock, Fire, Scissors, Snake, Human, Tree, Wolf, Sponge, Paper, Air, Water, Dragon, Devil, Lightning, Gun\\n*/\\n\\n\\n//------------------------------------------------------------------------------\\nbool DEBUG = false;\\nstatic char buf[25];\\nconst int INF = 1000000000;\\nconst int M = 7;\\nconst int N = 15;\\nstatic bool G[N][N];\\nstatic int indeg[N];\\nstatic int outdeg[N];\\nstatic map<string,int> to_vert =\\n{{\\\"Rock\\\", 0}, {\\\"Fire\\\", 1}, {\\\"Scissors\\\", 2}, {\\\"Snake\\\", 3}, {\\\"Human\\\", 4}, {\\\"Tree\\\", 5}, {\\\"Wolf\\\", 6}, {\\\"Sponge\\\", 7}, {\\\"Paper\\\", 8}, {\\\"Air\\\", 9}, {\\\"Water\\\", 10}, {\\\"Dragon\\\", 11}, {\\\"Devil\\\", 12}, {\\\"Lightning\\\", 13}, {\\\"Gun\\\", 14}};\\nstatic vector<string> to_str =\\n{\\n \\\"Rock\\\",\\\"Fire\\\",\\\"Scissors\\\",\\\"Snake\\\",\\\"Human\\\"\\n ,\\\"Tree\\\",\\\"Wolf\\\",\\\"Sponge\\\",\\\"Paper\\\",\\\"Air\\\"\\n ,\\\"Water\\\",\\\"Dragon\\\",\\\"Devil\\\",\\\"Lightning\\\",\\\"Gun\\\"\\n};\\nvoid setup()\\n{\\n for (int v=0; v<N; ++v) for (int w=0; w<N; ++w) G[v][w] = false;\\n for (int v=0; v<N; ++v)\\n for (int m=1; m<=M; ++m)\\n G[v][(v+m)%15] = true;\\n}\\n//------------------------------------------------------------------------------\\nvoid solve(int K, const vector<int>& vs)\\n{\\n //--------------------------------------------------------------------------\\n // base cases:\\n //--------------------------------------------------------------------------\\n // init:\\n for (int v=0; v<N; ++v) { indeg[v] = 0; outdeg[v] = 0; }\\n //--------------------------------------------------------------------------\\n // compute:\\n for (int k1=0; k1<K; ++k1)\\n {\\n for (int k2=0; k2<K; ++k2)\\n {\\n if (k2 == k1) continue;\\n if (G[ vs[k1] ][ vs[k2] ])\\n {\\n outdeg[ vs[k1] ]++;\\n indeg[ vs[k2] ]++;\\n }\\n }\\n }\\n //--------------------------------------------------------------------------\\n bool winning = false;\\n for (int v=0; v<N; ++v)\\n if (!indeg[v] && outdeg[v])\\n { printf(\\\"%s\\\\n\\\", to_str[v].c_str()); winning = true; break; }\\n if (!winning) printf(\\\"Draw\\\\n\\\");\\n}\\n\\n//------------------------------------------------------------------------------\\nvoid test()\\n{\\n\\n}\\n\\n//------------------------------------------------------------------------------\\nint main()\\n{\\n //test(); return 0;\\n //DEBUG = true;\\n setup();\\n //--------------------------------------------------------------------------\\n int K, num;\\n while (true)\\n {\\n num = scanf(\\\"%d \\\", &K);\\n if (K == 0) break;\\n vector<int> vs(K);\\n for (int k=0; k<K; ++k)\\n {\\n num = scanf(\\\"%s \\\", buf);\\n vs[k] = to_vert[string(buf)];\\n }\\n solve(K, vs);\\n }\\n //--------------------------------------------------------------------------\\n return 0;\\n}\\n//------------------------------------------------------------------------------\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3292,\n \"score_of_the_acc\": -1.0223,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2031_3173923\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <utility>\\n#include <cstring>\\nconst int MOD = 1e9 + 7;\\nconst int dx[] = {1, -1, 0, 0};\\nconst int dy[] = {0, 0, 1, -1};\\nusing namespace std;\\ntypedef long long ll;\\nstring hands[] = {\\\"Rock\\\", \\\"Fire\\\", \\\"Scissors\\\", \\\"Snake\\\", \\\"Human\\\", \\\"Tree\\\", \\\"Wolf\\\", \\\"Sponge\\\",\\\"Paper\\\",\\\"Air\\\",\\\"Water\\\",\\\"Dragon\\\", \\\"Devil\\\",\\\"Lightning\\\",\\\"Gun\\\"};\\nint check(string s)\\n{\\n\\tfor(int i = 0; i < 15; i++)\\n\\t\\tif(hands[i] == s)\\n\\t\\t\\treturn i;\\n}\\nint main()\\n{\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tint n;\\n\\twhile(cin >> n, n)\\n\\t{\\n\\t\\tint table[15][15];\\n\\t\\tint flag[15] = {};\\n\\t\\tmemset(table, -1, sizeof(table));\\n\\t\\tfor(int i = 0; i < 15; i++)\\n\\t\\t{\\n\\t\\t\\tbool flag = false;\\n\\t\\t\\tfor(int j = 0; j < 15; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint cnt = 7;\\n\\t\\t\\t\\tif(i == j) \\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttable[i][j] = 0;\\n\\t\\t\\t\\t\\tint x = j;\\n\\t\\t\\t\\t\\twhile(cnt--)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tx++;\\n\\t\\t\\t\\t\\t\\ttable[i][x % 15] = 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstring str[n + 1];\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tcin >> str[i];\\n\\t\\tint num[n + 1] = {};\\n\\t\\tint max_p = 0, p;\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t{\\n\\t\\t\\tint y = check(str[i]);\\n\\t\\t\\tfor(int j = 0; j < n; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint x = check(str[j]);\\n\\t\\t\\t\\tif(table[y][x] == -1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tnum[i] = -1;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse \\n\\t\\t\\t\\t\\tnum[i] += table[y][x];\\n\\t\\t\\t}\\n\\t\\t\\tif(num[i] > max_p)\\n\\t\\t\\t{\\n\\t\\t\\t\\tmax_p = num[i];\\n\\t\\t\\t\\tp = i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(max_p == 0)\\n\\t\\t\\tcout << \\\"Draw\\\" << endl;\\n\\t\\telse\\t\\n\\t\\t\\tcout << str[p] << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3068,\n \"score_of_the_acc\": -0.8973,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2031_3173371\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n int n,cnt;\\n int w[15],t[15];\\n string s;\\n while(1){\\n cin>>n;\\n if(n==0) break;\\n cnt=0;\\n for(int i=0;i<15;i++){\\n w[i]=1;\\n t[i]=0;\\n }\\n for(int i=0;i<n;i++){\\n cin>>s;\\n if(s[0]=='R'){\\n\\tt[0]=1;\\n\\tfor(int j=1;j<8;j++){\\n\\t w[j]=0;\\n\\t}\\n }\\n else if(s[0]=='F'){\\n\\tt[1]=1;\\n\\tfor(int j=2;j<9;j++){\\n\\t w[j]=0;\\n\\t}\\n }\\n else if(s[0]=='S'){\\n\\t if(s[1]=='c'){\\n\\t t[2]=1;\\n\\t for(int j=3;j<10;j++){\\n\\t w[j]=0;\\n\\t }\\n\\t }\\n\\t else if(s[1]=='n'){\\n\\t t[3]=1;\\n\\t for(int j=4;j<11;j++){\\n\\t w[j]=0;\\n\\t }\\n\\t }\\n\\t else if(s[1]=='p'){\\n\\t t[7]=1;\\n\\t for(int j=8;j<15;j++){\\n\\t w[j]=0;\\n\\t }\\n\\t }\\n }\\n else if(s[0]=='H'){\\n\\t t[4]=1;\\n\\t for(int j=5;j<12;j++){\\n\\t w[j]=0;\\n\\t }\\n }\\n else if(s[0]=='T'){\\n\\t t[5]=1;\\n\\t for(int j=6;j<13;j++){\\n\\t w[j]=0;\\n\\t }\\n }\\n else if(s[0]=='W'){\\n\\t if(s[1]=='o'){\\n\\t t[6]=1;\\n\\t for(int j=7;j<14;j++){\\n\\t w[j]=0;\\n\\t }\\n\\t }\\n\\t else if(s[1]=='a'){\\n\\t t[10]=1;\\n\\t for(int j=11;j<15;j++){\\n\\t w[j]=0;\\n\\t }\\n\\t for(int j=0;j<3;j++){\\n\\t w[j]=0;\\n\\t }\\n\\t }\\n }\\n else if(s[0]=='P'){\\n\\t t[8]=1;\\n\\t w[0]=0;\\n\\t for(int j=9;j<15;j++){\\n\\t w[j]=0;\\n\\t }\\n }\\n else if(s[0]=='A'){\\n\\t t[9]=1;\\n\\t w[0]=0;\\n\\t w[1]=0;\\n\\t for(int j=10;j<15;j++){\\n\\t w[j]=0;\\n\\t }\\n }\\n else if(s[0]=='D'){\\n\\tif(s[1]=='r'){\\n\\t t[11]=1;\\n\\t for(int j=12;j<15;j++){\\n\\t w[j]=0;\\n\\t }\\n\\t for(int j=0;j<4;j++){\\n\\t w[j]=0;\\n\\t }\\n\\t}\\n\\telse if(s[1]=='e'){\\n\\t t[12]=1;\\n\\t for(int j=13;j<15;j++){\\n\\t w[j]=0;\\n\\t }\\n\\t for(int j=0;j<5;j++){\\n\\t w[j]=0;\\n\\t }\\n\\t}\\n }\\n else if(s[0]=='L'){\\n\\tt[13]=1;\\n\\tw[14]=0;\\n\\tfor(int j=0;j<6;j++){\\n\\t w[j]=0;\\n\\t}\\n }\\n else if(s[0]=='G'){\\n\\tt[14]=1;\\n\\tfor(int j=0;j<7;j++){\\n\\t w[j]=0;\\n\\t}\\n }\\n }\\n for(int i=0;i<15;i++){\\n if(t[i]==1) cnt++;\\n }\\n if(cnt==1) cout<<\\\"Draw\\\"<<endl;\\n else{\\n for(int i=0;i<15;i++){\\n\\tif(t[i]==1){\\n\\t if(w[i]==1){\\n\\t if(i==0){\\n\\t cout<<\\\"Rock\\\"<<endl;\\n\\t break;\\n\\t }\\n\\t else if(i==1){\\n\\t cout<<\\\"Fire\\\"<<endl;\\n\\t break;\\n\\t }\\n\\t else if(i==2){\\n\\t cout<<\\\"Scissors\\\"<<endl;\\n\\t break;\\n\\t }\\n\\t else if(i==3){\\n\\t cout<<\\\"Snake\\\"<<endl;\\n\\t break;\\n\\t }\\n\\t else if(i==4){\\n\\t cout<<\\\"Human\\\"<<endl;\\n\\t break;\\n\\t }\\n\\t else if(i==5){\\n\\t cout<<\\\"Tree\\\"<<endl;\\n\\t break;\\n\\t }\\n\\t else if(i==6){\\n\\t cout<<\\\"Wolf\\\"<<endl;\\n\\t break;\\n\\t }\\n\\t else if(i==7){\\n\\t cout<<\\\"Sponge\\\"<<endl;\\n\\t break;\\n\\t }\\n\\t else if(i==8){\\n\\t cout<<\\\"Paper\\\"<<endl;\\n\\t break;\\n\\t }\\n\\t else if(i==9){\\n\\t cout<<\\\"Air\\\"<<endl;\\n\\t break;\\n\\t }\\n\\t else if(i==10){\\n\\t cout<<\\\"Water\\\"<<endl;\\n\\t break;\\n\\t }\\n\\t else if(i==11){\\n\\t cout<<\\\"Dragon\\\"<<endl;\\n\\t break;\\n\\t }\\n\\t else if(i==12){\\n\\t cout<<\\\"Devil\\\"<<endl;\\n\\t break;\\n\\t }\\n\\t else if(i==13){\\n\\t cout<<\\\"Lightning\\\"<<endl;\\n\\t break;\\n\\t }\\n\\t else if(i==14){\\n\\t cout<<\\\"Gun\\\"<<endl;\\n\\t break;\\n\\t }\\n\\t }\\n\\t}\\n\\tif(i==14) cout<<\\\"Draw\\\"<<endl;\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3144,\n \"score_of_the_acc\": -0.9216,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2031_3173348\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <utility>\\n#include <cstring>\\nconst int MOD = 1e9 + 7;\\nconst int dx[] = {1, -1, 0, 0};\\nconst int dy[] = {0, 0, 1, -1};\\nusing namespace std;\\ntypedef long long ll;\\nstring hands[] = {\\\"Rock\\\", \\\"Fire\\\", \\\"Scissors\\\", \\\"Snake\\\", \\\"Human\\\", \\\"Tree\\\", \\\"Wolf\\\", \\\"Sponge\\\",\\\"Paper\\\",\\\"Air\\\",\\\"Water\\\",\\\"Dragon\\\", \\\"Devil\\\",\\\"Lightning\\\",\\\"Gun\\\"};\\nint check(string s)\\n{\\n\\tfor(int i = 0; i < 15; i++)\\n\\t\\tif(hands[i] == s)\\n\\t\\t\\treturn i;\\n}\\nint main()\\n{\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tint n;\\n\\twhile(cin >> n, n)\\n\\t{\\n\\t\\tint table[15][15];\\n\\t\\tint flag[15] = {};\\n\\t\\tmemset(table, -1, sizeof(table));\\n\\t\\tfor(int i = 0; i < 15; i++)\\n\\t\\t{\\n\\t\\t\\tbool flag = false;\\n\\t\\t\\tfor(int j = 0; j < 15; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint cnt = 7;\\n\\t\\t\\t\\tif(i == j) \\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttable[i][j] = 0;\\n\\t\\t\\t\\t\\tint x = j;\\n\\t\\t\\t\\t\\twhile(cnt--)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tx++;\\n\\t\\t\\t\\t\\t\\ttable[i][x % 15] = 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstring str[n + 1];\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tcin >> str[i];\\n\\t\\tint num[n + 1] = {};\\n\\t\\tint max_p = 0, p;\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t{\\n\\t\\t\\tint y = check(str[i]);\\n\\t\\t\\tfor(int j = 0; j < n; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint x = check(str[j]);\\n\\t\\t\\t\\tif(table[y][x] == -1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tnum[i] = -1;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse \\n\\t\\t\\t\\t\\tnum[i] += table[y][x];\\n\\t\\t\\t}\\n\\t\\t\\tif(num[i] > max_p)\\n\\t\\t\\t{\\n\\t\\t\\t\\tmax_p = num[i];\\n\\t\\t\\t\\tp = i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(max_p == 0)\\n\\t\\t\\tcout << \\\"Draw\\\" << endl;\\n\\t\\telse\\t\\n\\t\\t\\tcout << str[p] << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3216,\n \"score_of_the_acc\": -0.968,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2031_3173110\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;;\\n\\nll to_num(string s){\\n if(s==\\\"Rock\\\"){return 0;}\\n if(s==\\\"Fire\\\"){return 1;}\\n if(s==\\\"Scissors\\\"){return 2;}\\n if(s==\\\"Snake\\\"){return 3;}\\n if(s==\\\"Human\\\"){return 4;}\\n if(s==\\\"Tree\\\"){return 5;}\\n if(s==\\\"Wolf\\\"){return 6;}\\n if(s==\\\"Sponge\\\"){return 7;}\\n if(s==\\\"Paper\\\"){return 8;}\\n if(s==\\\"Air\\\"){return 9;}\\n if(s==\\\"Water\\\"){return 10;}\\n if(s==\\\"Dragon\\\"){return 11;}\\n if(s==\\\"Devil\\\"){return 12;}\\n if(s==\\\"Lightning\\\"){return 13;}\\n if(s==\\\"Gun\\\"){return 14;}\\n return -1;\\n}\\n\\nstring ans(ll a){\\n if(a==0){return \\\"Rock\\\";}\\n if(a==1)return \\\"Fire\\\";\\n if(a==2)return \\\"Scissors\\\";\\n if(a==3)return \\\"Snake\\\";\\n if(a==4)return \\\"Human\\\";\\n if(a==5)return \\\"Tree\\\";\\n if(a==6)return \\\"Wolf\\\";\\n if(a==7){return \\\"Sponge\\\";}\\n if(a==8){return \\\"Paper\\\";}\\n if(a==9){return \\\"Air\\\";}\\n if(a==10){return \\\"Water\\\";}\\n if(a==11){return \\\"Dragon\\\";}\\n if(a==12){return \\\"Devil\\\";}\\n if(a==13){return \\\"Lightning\\\";}\\n if(a==14){return \\\"Gun\\\";}\\n return \\\"!\\\";\\n}\\n\\n\\nint main(){\\n while(1){\\n vector<ll> count(30,0);\\n ll n;\\n cin>>n;\\n if(n==0){break;}\\n for(int i=0;i<n;i++){\\n string s;\\n cin>>s;\\n count[to_num(s)]++;\\n count[to_num(s)+15]++;\\n }\\n for(int i=1;i<30;i++){\\n count[i]+=count[i-1];\\n }\\n bool done=false;\\n for(int i=0;i<15 && !done;i++){\\n if(i==0){\\n if(count[i]!=0){\\n\\tif(count[i]==n){cout<<\\\"Draw\\\"<<endl; done=true;}\\n\\telse if(count[i+7]==n){cout<<\\\"Rock\\\"<<endl; done=true;}\\n }\\n }\\n else{\\n if(count[i]-count[i-1]!=0){\\n\\tif(count[i]-count[i-1]==n){cout<<\\\"Draw\\\"<<endl; done=true;}\\n\\telse if(count[i+7]-count[i-1]==n){cout<<ans(i)<<endl; done=true;}\\n }\\n }\\n }\\n if(!done){cout<<\\\"Draw\\\"<<endl;}\\n\\n }\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3044,\n \"score_of_the_acc\": -0.8768,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2031_2855615\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\n\\nld dis(pair<ld, ld>l, pair<ld, ld>r) {\\n\\tld dx=l.first-r.first;\\n\\tld dy=l.second-r.second;\\n\\treturn sqrt(ld(dx)*dx+ ld(dy)*dy);\\n}\\n\\nld get_x(pair<ld, ld>f, pair<ld, ld>t, ld y) {\\n\\tif(f.second>t.second)return get_x(t,f,y);\\n\\n\\tld a=y-f.second;\\n\\tld b=t.second-y;\\n\\n\\treturn (t.first*a+f.first*b)/(a+b);\\n}\\n\\nint main() {\\n\\tvector<string>sts{ \\n\\t\\t\\\"Rock\\\",\\\"Fire\\\",\\\"Scissors\\\",\\\"Snake\\\",\\\"Human\\\",\\\"Tree\\\",\\\"Wolf\\\",\\\"Sponge\\\",\\\"Paper\\\",\\\"Air\\\",\\\"Water\\\",\\\"Dragon\\\",\\\"Devil\\\",\\\"Lightning\\\",\\\"Gun\\\" };\\n\\twhile (true) {\\n\\t\\tint N;cin>>N;\\n\\t\\tif(!N)break;\\n\\t\\tvector<int>nums(N);\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tstring st;cin>>st;\\n\\t\\t\\tnums[i]=find(sts.begin(),sts.end(),st)-sts.begin();\\n\\t\\t\\tassert(nums[i]!=15);\\n\\t\\t}\\n\\t\\tint ans_id=-1;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tint ok=true;\\n\\t\\t\\tint num=0;\\n\\t\\t\\tfor (int j = 0; j < N; ++j) {\\n\\t\\t\\t\\tif(i==j)continue;\\n\\t\\t\\t\\tint a=nums[i];\\n\\t\\t\\t\\tint b=nums[j];\\n\\n\\t\\t\\t\\tint sa=a-b;\\n\\t\\t\\t\\tif(sa<0)sa+=15;\\n\\t\\t\\t\\tif (sa == 0) {\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (sa <= 7) {\\n\\t\\t\\t\\t\\tok=false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tnum++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(ok&&num>0)ans_id=i;\\n\\t\\t}\\n\\t\\tif(ans_id==-1)cout<<\\\"Draw\\\"<<endl;\\n\\t\\telse cout<<sts[nums[ans_id]]<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3140,\n \"score_of_the_acc\": -0.9526,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2031_2521166\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\nstring t,s[] = {\\\"Rock\\\", \\\"Fire\\\", \\\"Scissors\\\", \\\"Snake\\\", \\\"Human\\\",\\\"Tree\\\", \\\"Wolf\\\", \\\"Sponge\\\", \\\"Paper\\\", \\\"Air\\\",\\\"Water\\\", \\\"Dragon\\\", \\\"Devil\\\", \\\"Lightning\\\", \\\"Gun\\\" };\\nint a[30],b[30];\\nmain(){\\n\\tint n;\\n\\twhile(cin>>n,n){\\n\\t\\tset<int>st;\\n\\t\\tr(i,30)a[i]=b[i]=0;\\n\\t\\tr(i,n){\\n\\t\\t\\tcin>>t;\\n\\t\\t\\tr(j,15)if(s[j]==t){\\n\\t\\t\\t\\tst.insert(j);\\n\\t\\t\\t\\tr(k,7){\\n\\t\\t\\t\\t b[j]++;\\n\\t\\t\\t \\t a[(j+k+1)%15]++;\\n\\t\\t\\t \\t}\\n\\t\\t\\t }\\n\\t\\t}\\n\\t\\tvector<string>v;\\n\\t\\tr(i,15)if(b[i]&&!a[i])v.push_back(s[i]);\\n\\t\\tif(v.size()==1&&st.size()!=1)cout<<v[0]<<endl;\\n\\t\\telse cout<<\\\"Draw\\\"<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3104,\n \"score_of_the_acc\": -0.9025,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2031_1896670\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef pair<int,pii> pip;\\ntypedef vector<pip>vip;\\nconst double PI=acos(-1);\\nconst double EPS=1e-8;\\nconst int inf=1e8;\\nint main(){\\n\\tmap<string,int>m;\\n\\tm[\\\"Rock\\\"]=1;\\n\\tm[\\\"Fire\\\"]=2;\\n\\tm[\\\"Scissors\\\"]=3;\\n\\tm[\\\"Snake\\\"]=4;\\n\\tm[\\\"Human\\\"]=5;\\n\\tm[\\\"Tree\\\"]=6;\\n\\tm[\\\"Wolf\\\"]=7;\\n\\tm[\\\"Sponge\\\"]=8;\\n\\tm[\\\"Paper\\\"]=9;\\n\\tm[\\\"Air\\\"]=10;\\n\\tm[\\\"Water\\\"]=11;\\n\\tm[\\\"Dragon\\\"]=12;\\n\\tm[\\\"Devil\\\"]=13;\\n\\tm[\\\"Lightning\\\"]=14;\\n\\tm[\\\"Gun\\\"]=15;\\n\\tint n;\\n\\twhile(cin>>n,n){\\n\\t\\tvector<string>in(n);\\n\\t\\trep(i,n)cin>>in[i];\\n\\t\\tin.erase(unique(all(in)),in.end());\\n\\t\\tif(in.size()==1){\\n\\t\\t\\tcout<<\\\"Draw\\\"<<endl;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tvi w(in.size());\\n\\t\\trep(i,in.size())w[i]=m[in[i]];\\n\\t\\tbool h=false;\\n\\t\\trep(i,in.size()){\\n\\t\\t\\tbool hh=true;\\n\\t\\t\\trep(j,in.size()){\\n\\t\\t\\t\\tint t=w[i],s=w[j];\\n\\t\\t\\t\\tif(t==s)continue;\\n\\t\\t\\t\\tif(t>s&&t-s<8||t<s&&15-s+t<8)hh=false;\\n\\t\\t\\t}\\n\\t\\t\\tif(hh){\\n\\t\\t\\t\\th=true;\\n\\t\\t\\t\\tcout<<in[i]<<endl;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!h)cout<<\\\"Draw\\\"<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 1276,\n \"score_of_the_acc\": -0.0496,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2031_1896666\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef pair<int,pii> pip;\\ntypedef vector<pip>vip;\\nconst double PI=acos(-1);\\nconst double EPS=1e-8;\\nconst int inf=1e8;\\nint main(){\\n\\tmap<string,int>m;\\n\\tm[\\\"Rock\\\"]=1;\\n\\tm[\\\"Fire\\\"]=2;\\n\\tm[\\\"Scissors\\\"]=3;\\n\\tm[\\\"Snake\\\"]=4;\\n\\tm[\\\"Human\\\"]=5;\\n\\tm[\\\"Tree\\\"]=6;\\n\\tm[\\\"Wolf\\\"]=7;\\n\\tm[\\\"Sponge\\\"]=8;\\n\\tm[\\\"Paper\\\"]=9;\\n\\tm[\\\"Air\\\"]=10;\\n\\tm[\\\"Water\\\"]=11;\\n\\tm[\\\"Dragon\\\"]=12;\\n\\tm[\\\"Devil\\\"]=13;\\n\\tm[\\\"Lightning\\\"]=14;\\n\\tm[\\\"Gun\\\"]=15;\\n\\tint n;\\n\\twhile(cin>>n,n){\\n\\t\\tvector<string>in(n);\\n\\t\\trep(i,n)cin>>in[i];\\n\\t\\tin.erase(unique(all(in)),in.end());\\n\\t\\tif(in.size()==1){\\n\\t\\t\\tcout<<\\\"Draw\\\"<<endl;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tbool h=false;\\n\\t\\trep(i,in.size()){\\n\\t\\t\\tbool hh=true;\\n\\t\\t\\trep(j,in.size()){\\n\\t\\t\\t\\tint t=m[in[i]],s=m[in[j]];\\n\\t\\t\\t\\tif(t==s)continue;\\n\\t\\t\\t\\tif(t>s&&t-s<8||t<s&&15-s+t<8)hh=false;\\n\\t\\t\\t}\\n\\t\\t\\tif(hh){\\n\\t\\t\\t\\th=true;\\n\\t\\t\\t\\tcout<<in[i]<<endl;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!h)cout<<\\\"Draw\\\"<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1460,\n \"memory_kb\": 1272,\n \"score_of_the_acc\": -0.4609,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2031_1882385\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define MAX 15\\n \\nconst string gesture[MAX] = {\\n \\\"Rock\\\",\\\"Fire\\\",\\\"Scissors\\\",\\\"Snake\\\",\\\"Human\\\",\\\"Tree\\\",\\\"Wolf\\\",\\\"Sponge\\\",\\n \\\"Paper\\\",\\\"Air\\\",\\\"Water\\\",\\\"Dragon\\\",\\\"Devil\\\",\\\"Lightning\\\",\\\"Gun\\\"\\n};\\n \\nvector<int> v;\\nbool ges[MAX];\\n \\nint solve(){\\n int res = -1, N = (int)v.size();\\n \\n if(N == 1){\\n\\treturn res;\\n } \\n \\n for(int i = 0 ; i < N ; i++){\\n\\tint win = 0, lose = 0;\\n\\tfor(int j = 0 ; j < MAX ; j++){\\n\\t if(v[i] == j || !ges[j]){\\n\\t\\tcontinue;\\n\\t }\\n\\n\\t int cnt = 0, pos = v[i];\\n\\t while(true){\\n\\t\\tpos++; cnt++;\\n\\t\\tif(pos >= MAX){\\n\\t\\t pos = 0;\\n\\t\\t}\\n \\n\\t\\tif(j == pos){\\n\\t\\t if(cnt > 7){\\n\\t\\t\\tlose++;\\n\\t\\t }else{\\n\\t\\t\\twin++;\\n\\t\\t }\\n\\t\\t break;\\n\\t\\t}\\n\\t }\\n\\t}\\n\\tif(win == N-1){\\n\\t res = v[i];\\n\\t break;\\n\\t}\\n }\\n \\n return res;\\n}\\n \\nint main(){\\n int n;\\n \\n while(cin >> n ,n){\\n\\tstring str;\\n\\tset<string> st;\\n \\n\\tv.clear();\\n\\tmemset(ges,false,sizeof(ges));\\n \\n\\tfor(int i = 0 ; i < n ; i++){\\n\\t cin >> str;\\n\\t if(st.count(str)){\\n\\t\\tcontinue;\\n\\t }\\n\\t for(int j = 0 ; j < MAX ; j++){\\n\\t\\tif(gesture[j] == str){\\n\\t\\t v.push_back(j);\\n\\t\\t st.insert(str);\\n\\t\\t ges[j] = true;\\n\\t\\t break;\\n\\t\\t}\\n\\t }\\n\\t}\\n \\n\\tsort(v.begin(),v.end());\\n\\tint ans = solve();\\n \\n\\tif(ans == -1){\\n\\t cout << \\\"Draw\\\" << endl;\\n\\t}else{\\n\\t cout << gesture[ans] << endl;\\n\\t}\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3144,\n \"score_of_the_acc\": -0.9216,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2031_1800711\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\nusing namespace std;\\nstring S[15] = { \\\"Rock\\\", \\\"Fire\\\", \\\"Scissors\\\", \\\"Snake\\\", \\\"Human\\\", \\\"Tree\\\", \\\"Wolf\\\", \\\"Sponge\\\", \\\"Paper\\\", \\\"Air\\\", \\\"Water\\\", \\\"Dragon\\\", \\\"Devil\\\", \\\"Lightning\\\", \\\"Gun\\\" };\\nint N, a[10000], c[15]; string T;\\nbool solve(int a, int b) {\\n\\tif (a > b)b += 15;\\n\\tif (b - a <= 7)return true;\\n\\treturn false;\\n}\\nint main() {\\n\\twhile (true) {\\n\\t\\tcin >> N;\\n\\t\\tif (N == 0)break;\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tcin >> T;\\n\\t\\t\\tfor (int j = 0; j < 15; j++) {\\n\\t\\t\\t\\tif (T == S[j])a[i] = j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < 15; i++)c[i] = 0;\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\t\\tif (!solve(a[i], a[j]))goto E;\\n\\t\\t\\t}\\n\\t\\t\\tc[a[i]] = 1;\\n\\t\\tE:;\\n\\t\\t}\\n\\t\\tint G = 0;\\n\\t\\tfor (int i = 0; i < N - 1; i++) {\\n\\t\\t\\tif (a[i] != a[i + 1])G = 1;\\n\\t\\t}\\n\\t\\tint P = 0;\\n\\t\\tif (G == 0)goto F;\\n\\t\\tfor (int i = 0; i < 15; i++) {\\n\\t\\t\\tif (c[i] == 1) {\\n\\t\\t\\t\\tP = 1; cout << S[i] << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\tF:;\\n\\t\\tif (P == 0)cout << \\\"Draw\\\" << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1220,\n \"score_of_the_acc\": -0.0049,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2031_1718302\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main(){\\n string mp[]={\\\"Rock\\\",\\\"Gun\\\",\\\"Lightning\\\",\\\"Devil\\\",\\\"Dragon\\\",\\\"Water\\\",\\\"Air\\\",\\\"Paper\\\",\\\"Sponge\\\",\\\"Wolf\\\",\\\"Tree\\\",\\\"Human\\\",\\\"Snake\\\",\\\"Scissors\\\",\\\"Fire\\\"};\\n\\n int n;\\n while(cin>>n,n){\\n string str[1001];\\n for(int i=0;i<n;i++) cin>>str[i];\\n \\n string ans=\\\"Draw\\\";\\n set<string> S;\\n for(int i=0;i<n;i++){\\n if(S.count(str[i]))continue;\\n S.insert(str[i]);\\n int A=0;\\n while(str[i]!=mp[A])A++;\\t\\n int j;\\n for(j=0;j<n;j++){\\n\\tif(str[i]==str[j])continue;\\n\\tint B=0;\\n\\twhile(str[j]!=mp[B])B++;\\t\\n\\tif((15+B-A)%15<=7)break;\\n }\\n if(j==n) ans=str[i];\\n }\\n \\n for(int i=1;i<n&&str[0]==str[i];i++)if(i==n-1)ans=\\\"Draw\\\"; \\n\\n cout << ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1276,\n \"score_of_the_acc\": -0.0347,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2031_1710839\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n \\nint main() {\\n string s[15]={\\\"Rock\\\",\\\"Fire\\\",\\\"Scissors\\\",\\\"Snake\\\",\\\"Human\\\",\\\"Tree\\\",\\\"Wolf\\\",\\\"Sponge\\\",\\\"Paper\\\",\\\"Air\\\",\\\"Water\\\",\\\"Dragon\\\",\\\"Devil\\\",\\\"Lightning\\\",\\\"Gun\\\"};\\n map<string,int> r;\\n for(int i=0; i<15; i++) r[s[i]]=i;\\n int n;\\n while(cin >> n && n) {\\n map<string,int> m;\\n string t[n];\\n for(int i=0; i<n; i++) {\\n cin >> t[i];\\n m[t[i]]++;\\n }\\n set<string> ans;\\n for(int i=0; i<n; i++) {\\n int k=r[t[i]];\\n int c=0,c2=0;\\n for(int j=0; j<7; j++) c+=m[s[(k+j+1)%15]];\\n for(int j=0; j<7; j++) c2+=m[s[(k+j+8)%15]];\\n if(c&&!c2) ans.insert(t[i]);\\n }\\n if(ans.size()==1) cout << *ans.begin() << endl;\\n else cout << \\\"Draw\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1276,\n \"score_of_the_acc\": -0.0466,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2031_1710762\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nstring t[15]={\\n \\\"Rock\\\",\\n \\\"Fire\\\",\\n \\\"Scissors\\\",\\n \\\"Snake\\\",\\n \\\"Human\\\",\\n \\\"Tree\\\",\\n \\\"Wolf\\\",\\n \\\"Sponge\\\",\\n \\\"Paper\\\",\\n \\\"Air\\\",\\n \\\"Water\\\",\\n \\\"Dragon\\\",\\n \\\"Devil\\\",\\n \\\"Lightning\\\",\\n \\\"Gun\\\"\\n};\\n\\nint search(string s){\\n for(int i=0;i<15;i++)if(t[i]==s)return i;\\n assert(0);\\n return 0;\\n}\\n\\nint check(int a,int b){\\n if(a==b)return 0;\\n for(int i=1;i<=7;i++)if( (a+i)%15==b )return 1;\\n return -1;\\n}\\n\\nint main(){\\n int n;\\n while(1){\\n cin>>n;\\n if(n==0)break;\\n vector<string> t(n);\\n vector<int> u(n);\\n for(int i=0;i<n;i++){\\n cin>>t[i];\\n u[i]=search(t[i]);\\n }\\n \\n string ans=\\\"Draw\\\";\\n for(int i=0;i<n;i++){\\n int A=0,B=0;\\n for(int j=0;j<n;j++){\\n int k=check(u[i],u[j]);\\n if(k==1)A++;\\n if(k==-1)B++;\\n }\\n if(A>0&&B==0)ans=t[i];\\n }\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 1272,\n \"score_of_the_acc\": -0.1615,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2031_1710758\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<int,int> P;\\n\\nint main(){\\n int n,vlen;\\n string str,ans;\\n set<string> s;\\n vector<string> v;\\n vector<P> defdata;//1,0\\n string d[15]={\\n \\\"Rock\\\",\\\"Fire\\\",\\\"Scissors\\\",\\\"Snake\\\",\\\"Human\\\",\\n \\\"Tree\\\",\\\"Wolf\\\",\\\"Sponge\\\",\\\"Paper\\\",\\\"Air\\\",\\n \\\"Water\\\",\\\"Dragon\\\",\\\"Devil\\\",\\\"Lightning\\\",\\\"Gun\\\"\\n };\\n while(1){\\n cin>>n;\\n if(!n)break;\\n for(int i=0;i<n;i++){\\n cin>>str;\\n s.insert(str);\\n }\\n for(int i=0;i<15;i++){\\n set<string>::iterator ite;\\n for(ite=s.begin();ite!=s.end();ite++){\\n\\tif(d[i]==(*ite)){\\n\\t v.push_back(d[i]);\\n\\t defdata.push_back(P(0,0));\\n\\t}\\n }\\n }\\n vlen=v.size();\\n for(int i=0;i<vlen;i++){\\n for(int j=i+1;j<vlen;j++){\\n\\tint iid,jid;\\n\\tfor(int k=0;k<15;k++)\\n\\t if(v[i]==d[k])iid=k;\\n\\tfor(int k=0;k<15;k++)\\n\\t if(v[j]==d[k])jid=k;\\n\\tif(jid-iid<=7){\\n\\t defdata[i].first++;\\n\\t defdata[j].second++;\\n\\t}\\n\\tif(iid+15-jid<=7){\\n\\t defdata[j].first++;\\n\\t defdata[i].second++;\\n\\t}\\n }\\n }\\n ans=\\\"0\\\";\\n for(int i=0;i<vlen;i++){\\n int w=defdata[i].first;\\n int l=defdata[i].second;\\n if(w&&!l)ans=v[i];\\n }\\n if(ans!=\\\"0\\\")cout<<ans<<endl;\\n else cout<<\\\"Draw\\\"<<endl;\\n s.clear();\\n v.clear();\\n defdata.clear();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1216,\n \"score_of_the_acc\": -0.003,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2031_1710750\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define REP(asd,fgh) for(int asd=0; asd<fgh; asd++)\\n\\nint main(void){\\n vector< vector<string> > defeat;\\n string handlist[] = {\\\"Rock\\\", \\\"Fire\\\", \\\"Scissors\\\", \\\"Snake\\\", \\\"Human\\\", \\\"Tree\\\", \\\"Wolf\\\", \\\"Sponge\\\", \\\"Paper\\\", \\\"Air\\\", \\\"Water\\\", \\\"Dragon\\\", \\\"Devil\\\", \\\"Lightning\\\", \\\"Gun\\\"};\\n map<string, int> hand;\\n REP(i, 15){\\n hand[handlist[i]] = i;\\n }\\n \\n int N;\\n while(cin >> N, N){\\n vector<string> players(N);\\n string ans = \\\"Draw\\\";\\n REP(i, N){\\n cin >> players[i];\\n }\\n string same = players[0];\\n bool draw = true;\\n REP(i, N){\\n if(players[i] != same) draw = false;\\n }\\n if(draw){\\n cout << ans << endl;\\n continue;\\n }\\n REP(i, N){\\n bool flg = true;\\n REP(j, N){\\n\\tif(i == j) continue;\\n\\tif(!(((hand[players[j]] - hand[players[i]])+15)%15 <= 7)){\\n\\t flg = false;\\n\\t}\\n }\\n if(flg)\\n\\tans = players[i];\\n }\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2910,\n \"memory_kb\": 1272,\n \"score_of_the_acc\": -0.895,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2031_1710720\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n string s[15]={\\\"Rock\\\",\\\"Fire\\\",\\\"Scissors\\\",\\\"Snake\\\",\\\"Human\\\",\\\"Tree\\\",\\\"Wolf\\\",\\\"Sponge\\\",\\\"Paper\\\",\\\"Air\\\",\\\"Water\\\",\\\"Dragon\\\",\\\"Devil\\\",\\\"Lightning\\\",\\\"Gun\\\"};\\n map<string,int> r;\\n for(int i=0; i<15; i++) r[s[i]]=i;\\n int n;\\n while(cin >> n && n) {\\n map<string,int> m;\\n string t[n];\\n for(int i=0; i<n; i++) {\\n cin >> t[i];\\n m[t[i]]++;\\n }\\n set<string> ans;\\n for(int i=0; i<n; i++) {\\n int k=r[t[i]];\\n int c=0,c2=0;\\n for(int j=0; j<7; j++) c+=m[s[(k+j+1)%15]];\\n for(int j=0; j<7; j++) c2+=m[s[(k+j+8)%15]];\\n if(c&&!c2) ans.insert(t[i]);\\n }\\n if(ans.size()==1) cout << *ans.begin() << endl;\\n else cout << \\\"Draw\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.0486,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2031_1577650\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <cstdio>\\n#include <iostream>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P > PP;\\n \\nconst static int tx[] = {0,1,0,-1};\\nconst static int ty[] = {-1,0,1,0};\\n\\nconst static double EPS = 1e-8;\\n\\nint main(){\\n int num_of_players;\\n map<string,int> dict;\\n dict[\\\"Rock\\\"] = 0;\\n dict[\\\"Fire\\\"] = 1;\\n dict[\\\"Scissors\\\"] = 2;\\n dict[\\\"Snake\\\"] = 3;\\n dict[\\\"Human\\\"] = 4;\\n dict[\\\"Tree\\\"] = 5;\\n dict[\\\"Wolf\\\"] = 6;\\n dict[\\\"Sponge\\\"] = 7;\\n dict[\\\"Paper\\\"] = 8;\\n dict[\\\"Air\\\"] = 9;\\n dict[\\\"Water\\\"] = 10;\\n dict[\\\"Dragon\\\"] = 11;\\n dict[\\\"Devil\\\"] = 12;\\n dict[\\\"Lightning\\\"] = 13;\\n dict[\\\"Gun\\\"] = 14;\\n\\n map<int,bool> canWin;\\n for(int hand_i = 0; hand_i < 15; hand_i++){\\n for(int hand_j = 0; hand_j < 15; hand_j++){\\n canWin[hand_i * 15 + hand_j] = false;\\n for(int offset = 1; offset <= 7; offset++){\\n if(hand_j == (hand_i + offset) % 15){\\n canWin[hand_i * 15 + hand_j] = true;\\n }\\n }\\n }\\n }\\n\\n while(~scanf(\\\"%d\\\",&num_of_players)){\\n if(num_of_players == 0){\\n break;\\n }\\n vector<string> players;\\n for(int player_i = 0; player_i < num_of_players; player_i++){\\n string hand;\\n cin >> hand;\\n players.push_back(hand);\\n }\\n\\n map<string,bool> lose;\\n map<string,bool> win;\\n\\n set<string> hands;\\n for(int player_i = 0; player_i < num_of_players; player_i++){\\n hands.insert(players[player_i]);\\n }\\n for(set<string>::iterator ally_it = hands.begin(); ally_it != hands.end(); ally_it++){\\n for(set<string>::iterator foe_it = hands.begin(); foe_it != hands.end(); foe_it++){\\n if(canWin[dict[*ally_it] * 15 + dict[*foe_it]]){\\n win[*ally_it] = true;\\n lose[*foe_it] = true;\\n }\\n }\\n }\\n\\n string res = \\\"Draw\\\";\\n for(set<string>::iterator ally_it = hands.begin(); ally_it != hands.end(); ally_it++){\\n if(win[*ally_it] && !lose[*ally_it]){\\n res = *ally_it;\\n }\\n }\\n printf(\\\"%s\\\\n\\\",res.c_str());\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1304,\n \"score_of_the_acc\": -0.0481,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2031_1577646\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <cstdio>\\n#include <iostream>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P > PP;\\n \\nconst static int tx[] = {0,1,0,-1};\\nconst static int ty[] = {-1,0,1,0};\\n\\nconst static double EPS = 1e-8;\\n\\nint main(){\\n int num_of_players;\\n map<string,int> dict;\\n dict[\\\"Rock\\\"] = 0;\\n dict[\\\"Fire\\\"] = 1;\\n dict[\\\"Scissors\\\"] = 2;\\n dict[\\\"Snake\\\"] = 3;\\n dict[\\\"Human\\\"] = 4;\\n dict[\\\"Tree\\\"] = 5;\\n dict[\\\"Wolf\\\"] = 6;\\n dict[\\\"Sponge\\\"] = 7;\\n dict[\\\"Paper\\\"] = 8;\\n dict[\\\"Air\\\"] = 9;\\n dict[\\\"Water\\\"] = 10;\\n dict[\\\"Dragon\\\"] = 11;\\n dict[\\\"Devil\\\"] = 12;\\n dict[\\\"Lightning\\\"] = 13;\\n dict[\\\"Gun\\\"] = 14;\\n\\n map<int,bool> canWin;\\n for(int hand_i = 0; hand_i < 15; hand_i++){\\n for(int hand_j = 0; hand_j < 15; hand_j++){\\n canWin[hand_i * 15 + hand_j] = false;\\n for(int offset = 1; offset <= 7; offset++){\\n if(hand_j == (hand_i + offset) % 15){\\n canWin[hand_i * 15 + hand_j] = true;\\n }\\n }\\n }\\n }\\n\\n while(~scanf(\\\"%d\\\",&num_of_players)){\\n if(num_of_players == 0){\\n break;\\n }\\n vector<string> players;\\n for(int player_i = 0; player_i < num_of_players; player_i++){\\n string hand;\\n cin >> hand;\\n players.push_back(hand);\\n }\\n\\n bool lose[1001] = {};\\n bool win[1001] = {};\\n for(int player_i = 0; player_i < num_of_players; player_i++){\\n for(int player_j = player_i + 1; player_j < num_of_players; player_j++){\\n if(canWin[dict[players[player_i]] * 15 + dict[players[player_j]]]){\\n lose[player_j] = true;\\n win[player_i] = true;\\n }\\n if(canWin[dict[players[player_j]] * 15 + dict[players[player_i]]]){\\n lose[player_i] = true;\\n win[player_j] = true;\\n }\\n }\\n }\\n\\n string res = \\\"Draw\\\";\\n for(int player_i = 0; player_i < num_of_players; player_i++){\\n if(!lose[player_i] && win[player_i]){\\n res = players[player_i];\\n break;\\n }\\n }\\n printf(\\\"%s\\\\n\\\",res.c_str());\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3350,\n \"memory_kb\": 1304,\n \"score_of_the_acc\": -1.0421,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":1066,"cells":{"group_id":{"kind":"string","value":"aoj_2036_cpp"},"problem_description":{"kind":"string","value":"Problem G:\nTraffic\nYou are a resident of Kyoot (oh, well, it’s not a misspelling!) city. All streets there are neatly built on a\ngrid; some streets run in a meridional (north-south) direction and others in a zonal (east-west) direction.\nThe streets that run from north to south are called avenues, whereas those which run from east to west\nare called\ndrives\n.\nEvery avenue and drive in the city is numbered to distinguish one from another. The westernmost avenue\nis called the\n1st avenue\n. The avenue which lies next to the\n1st avenue\nis the\n2nd avenue\n, and so forth.\nSimilarly, drives are numbered from south to north. The figure below illustrates this situation.\nFigure 1: The Road Map of the Kyoot City\nThere is an intersection with traffic signals to regulate traffic on each crossing point of an avenue and a\ndrive. Each traffic signal in this city has two lights. One of these lights is colored green, and means “you\nmay go”. The other is red, and means “you must stop here”. If you reached an intersection during the\nred light (including the case where the light turns to red on your arrival), you must stop and wait there\nuntil the light turns to green again. However, you do not have to wait in the case where the light has\njust turned to green when you arrived there.\nTraffic signals are controlled by a computer so that the lights for two different directions always show\ndifferent colors. Thus if the light for an avenue is green, then the light for a drive must be red, and vice\nversa. In order to avoid car crashes, they will never be green together. Nor will they be red together, for efficiency. So all the signals at one intersection turn simultaneously; no sooner does one signal turn to\nred than the other turns to green. Each signal has a prescribed time interval and permanently repeats\nthe cycle.\nFigure 2: Signal and Intersection\nBy the way, you are planning to visit your friend by car tomorrow. You want to see her as early as\npossible, so you are going to drive through the shortest route. However, due to existence of the traffic\nsignals, you cannot easily figure out which way to take (the city also has a very sophisticated camera\nnetwork to prevent crime or violation: the police would surely arrest you if you didn’t stop on the red\nlight!). So you decided to write a program to calculate the shortest possible time to her house, given the\ntown map and the configuration of all traffic signals.\nYour car runs one unit distance in one unit time. Time needed to turn left or right, to begin moving,\nand to stop your car is negligible. You do not need to take other cars into consideration.\nInput\nThe input consists of multiple test cases. Each test case is given in the format below:\nw h\nd\nA,1\nd\nA,2\n. . . d\nA,w−1\nd\nD,1\nd\nD,2\n. . . d\nD,h−1\nns\n1,1\new\n1,1\ns\n1,1\n.\n.\n.\nns\nw,1\new\nw,1\ns\nw,1\nns\n1,2\new\n1,2\ns\n1,2\n.\n.\n.\nns\nw,h\new\nw,h\ns\nw,h\nx\ns\ny\ns\nx\nd\ny\nd\nTwo integers w and h (2 ≤\nw\n,\nh\n≤ 100) in the first line indicate the number of avenues and drives in the\ncity, respective\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2036_6775560","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 105\n\nenum DIR{\n\tyoko,\n\ttate,\n};\n\nenum Type{\n\tGreen,\n\tRed,\n};\n\nstruct Edge{\n\tEdge(int arg_to,int arg_dist,bool arg_is_yoko){\n\t\tto = arg_to;\n\t\tdist = arg_dist;\n\t\tis_yoko = arg_is_yoko;\n\t}\n\n\tint to,dist;\n\tbool is_yoko;\n};\n\nstruct Info{\n\n\tint a,b;\n\tbool is_yoko;\n};\n\nstruct State{\n\n\tState(){\n\t\tnode = sum_dist = 0;\n\t\ttype = Green;\n\t\tdir = yoko;\n\t\tis_goal = false;\n\t}\n\n\tState(int arg_node,int arg_sum_dist,Type arg_type,DIR arg_dir,bool arg_is_goal){\n\t\tnode = arg_node;\n\t\tsum_dist = arg_sum_dist;\n\t\ttype = arg_type;\n\t\tdir = arg_dir;\n\t\tis_goal = arg_is_goal;\n\t}\n\tbool operator<(const struct State& arg) const{\n\n\t\treturn sum_dist > arg.sum_dist; //昇順(PQ)\n\t}\n\tint node,sum_dist;\n\tType type;\n\tDIR dir;\n\tbool is_goal;\n};\n\n\nvector<Edge> G[SIZE*SIZE];\n\nint W,H;\nint D_yoko[SIZE],D_tate[SIZE];\nint NS[SIZE*SIZE],EW[SIZE*SIZE],S[SIZE*SIZE];\nint X[SIZE*SIZE],Y[SIZE*SIZE];\n\nint min_dist[SIZE*SIZE][2][2];\n\n\nint getInd(int row,int col){\n\n\treturn row*W + col;\n}\n\n//通りの計算\nInfo calcPos(int x,int y){\n\n\tInfo ret;\n\tret.a = -1;\n\tret.b = -1;\n\n\tint h = 0,w = 0;\n\n\t//横方向の通り\n\tfor(int row = 0; row < H; row++){\n\t\tif(y != h){\n\n\t\t\th += D_tate[row];\n\t\t\tcontinue;\n\t\t}\n\n\t\tw = 0;\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(x > w && x < w+D_yoko[col]){\n\n\t\t\t\tret.a = getInd(row,col);\n\t\t\t\tret.b = getInd(row,col+1);\n\t\t\t\tret.is_yoko = true;\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tw += D_yoko[col];\n\t\t}\n\t\th += D_tate[row];\n\t}\n\n\t//縦方向の通り\n\tw = 0;\n\tfor(int col = 0; col < W; col++){\n\t\tif(x != w){\n\n\t\t\tw += D_yoko[col];\n\t\t\tcontinue;\n\t\t}\n\n\t\th = 0;\n\t\tfor(int row = 0; row < H; row++){\n\t\t\tif(y > h && y < h+D_tate[row]){\n\n\t\t\t\tret.a = getInd(row,col);\n\t\t\t\tret.b = getInd(row+1,col);\n\t\t\t\tret.is_yoko = false;\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\th += D_tate[row];\n\t\t}\n\t\tw += D_yoko[col];\n\t}\n\n\treturn ret; //バグ\n}\n\n//ある時刻における信号機の色を計算\nType calcColor(int ind,int T,bool is_yoko){\n\n\tint base = NS[ind]+EW[ind];\n\n\tint mod = T%base;\n\n\tif(S[ind] == 0){ //最初に南北方向の信号が緑\n\n\t\tif(is_yoko){ //左右の移動\n\n\t\t\t//■到着した瞬間に緑は待たなくてよい\n\t\t\tif(mod < NS[ind]){\n\n\t\t\t\treturn Red;\n\t\t\t}else{\n\n\t\t\t\treturn Green;\n\t\t\t}\n\n\t\t}else{ //南北の移動\n\n\t\t\t//■到着した瞬間に赤は停止\n\t\t\tif(mod < NS[ind]){\n\n\t\t\t\treturn Green;\n\t\t\t}else{\n\n\t\t\t\treturn Red;\n\t\t\t}\n\t\t}\n\n\t}else{ //最初に東西方向の信号が緑\n\n\t\tif(is_yoko){ //東西の移動\n\n\t\t\t//■到着した瞬間に赤は停止\n\t\t\tif(mod < EW[ind]){\n\n\t\t\t\treturn Green;\n\n\t\t\t}else{\n\n\t\t\t\treturn Red;\n\t\t\t}\n\n\t\t}else{ //南北の移動\n\n\t\t\t//■到着した瞬間に緑は待たなくてよい\n\t\t\tif(mod < EW[ind]){\n\n\t\t\t\treturn Red;\n\n\t\t\t}else{\n\n\t\t\t\treturn Green;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < H*W; i++){\n\t\tG[i].clear();\n\t}\n\n\t//区画幅(横)\n\tfor(int i = 0; i < W-1; i++){\n\n\t\tscanf(\"%d\",&D_yoko[i]);\n\t}\n\t//区画幅(縦)\n\tfor(int i = 0; i < H-1; i++){\n\n\t\tscanf(\"%d\",&D_tate[i]);\n\t}\n\n\t//H*W個の交差点の座標を計算\n\tint h = 0;\n\tfor(int row = 0; row < H; row++){\n\t\tint w = 0;\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tint ind = getInd(row,col);\n\t\t\tX[ind] = w;\n\t\t\tY[ind] = h;\n\t\t\tw += D_yoko[col];\n\t\t}\n\t\th += D_tate[row];\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 ind = getInd(row,col);\n\n\t\t\tscanf(\"%d %d %d\",&NS[ind],&EW[ind],&S[ind]);\n\t\t}\n\t}\n\n\tint s_x,s_y;\n\tscanf(\"%d %d\",&s_x,&s_y);\n\n\tInfo s_pos = calcPos(s_x,s_y);\n\n\tint t_x,t_y;\n\tscanf(\"%d %d\",&t_x,&t_y);\n\n\tInfo t_pos = calcPos(t_x,t_y);\n\n\n\t//同じ通りにある\n\tif(s_pos.a == t_pos.a && s_pos.b == t_pos.b){\n\n\t\tif(s_x == t_x){\n\n\t\t\tprintf(\"%d\\n\",abs(s_y-t_y));\n\t\t\treturn;\n\n\t\t}else{\n\n\t\t\tprintf(\"%d\\n\",abs(s_x-t_x));\n\t\t\treturn;\n\t\t}\n\t}\n\n\t/*辺張り*/\n\n\t//左右\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W-1; col++){\n\n\t\t\tint a = getInd(row,col);\n\t\t\tint b = getInd(row,col+1);\n\n\t\t\tG[a].push_back(Edge(b,D_yoko[col],true));\n\t\t\tG[b].push_back(Edge(a,D_yoko[col],true));\n\t\t}\n\t}\n\n\t//上下\n\tfor(int col = 0; col < W; col++){\n\t\tfor(int row = 0; row < H-1; row++){\n\n\t\t\tint a = getInd(row,col);\n\t\t\tint b = getInd(row+1,col);\n\n\t\t\tG[a].push_back(Edge(b,D_tate[row],false));\n\t\t\tG[b].push_back(Edge(a,D_tate[row],false));\n\t\t}\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tfor(int a = 0; a < 2 ; a++){\n\n\t\t\t\tint ind = getInd(row,col);\n\t\t\t\tmin_dist[ind][Green][a] = BIG_NUM;\n\t\t\t\tmin_dist[ind][Red][a] = BIG_NUM;\n\t\t\t}\n\t\t}\n\t}\n\n\tpriority_queue<State> Q;\n\n\t/* とりあえず、スタートから最寄りの交差点に寄る */\n\n\tif(s_pos.is_yoko){\n\n\t\t//aへ\n\t\tint T = abs(s_x - X[s_pos.a]);\n\t\tType type = calcColor(s_pos.a,T,true);\n\n\t\tQ.push(State(s_pos.a,T,type,yoko,false));\n\n\t\t//bへ\n\t\tT = abs(s_x - X[s_pos.b]);\n\t\ttype = calcColor(s_pos.b,T,true);\n\n\t\tQ.push(State(s_pos.b,T,type,yoko,false));\n\n\t}else{ //startが縦の通りにある\n\n\t\t//aへ\n\t\tint T = abs(s_y - Y[s_pos.a]);\n\t\tType type = calcColor(s_pos.a,T,false);\n\n\t\tQ.push(State(s_pos.a,T,type,tate,false));\n\n\t\t//bへ\n\t\tT = abs(s_y - Y[s_pos.b]);\n\t\ttype = calcColor(s_pos.b,T,false);\n\n\t\tQ.push(State(s_pos.b,T,type,tate,false));\n\t}\n\n\twhile(!Q.empty()){\n\n\t\tState state = Q.top();\n\t\tQ.pop();\n\n\t\tif(state.is_goal){\n\n\t\t\tprintf(\"%d\\n\",state.sum_dist);\n\t\t\treturn;\n\t\t}\n\n\t\tif(state.sum_dist > min_dist[state.node][state.type][state.dir]){\n\n\t\t\tcontinue;\n\t\t}\n\t\tif(state.type == Red){\n\n\t\t\tbool is_yoko = (state.dir == yoko);\n\n\t\t\t//青になるまで待つ\n\t\t\tint add = 0;\n\t\t\tint base = NS[state.node]+EW[state.node];\n\t\t\tint now = state.sum_dist%base;\n\n\t\t\tif(is_yoko){\n\n\t\t\t\tif(S[state.node] == 0){ //最初に南北が青\n\n\t\t\t\t\tadd = NS[state.node]-now;\n\n\t\t\t\t}else{ //最初に東西が青\n\n\t\t\t\t\tadd = base-now;\n\n\t\t\t\t}\n\n\t\t\t}else{ //南北の動き\n\n\t\t\t\tif(S[state.node] == 0){ //最初に南北が青\n\n\t\t\t\t\tadd = base-now;\n\n\t\t\t\t}else{ //最初に東西が青\n\n\t\t\t\t\tadd = EW[state.node]-now;\n\t\t\t\t}\n\t\t\t}\n\n\n\t\t\tint next_node = state.node;\n\t\t\tint next_dist = state.sum_dist+add;\n\t\t\tDIR next_dir = state.dir;\n\t\t\tType next_type = Green;\n\n\t\t\tif(min_dist[next_node][next_type][next_dir] > next_dist){\n\n\t\t\t\tmin_dist[next_node][next_type][next_dir] = next_dist;\n\t\t\t\tQ.push(State(next_node,next_dist,next_type,next_dir,false));\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\n\t\tfor(int i = 0; i < G[state.node].size(); i++){\n\n\t\t\tint next_node = G[state.node][i].to;\n\t\t\tint next_dist = state.sum_dist + G[state.node][i].dist;\n\n\n\t\t\t//途中にゴールがあるか\n\t\t\tint a = min(state.node,next_node);\n\t\t\tint b = max(state.node,next_node);\n\n\t\t\tif(t_pos.a == a && t_pos.b == b){\n\n\t\t\t\tint add = abs(X[state.node]-t_x)+abs(Y[state.node]-t_y);\n\t\t\t\tint candidate = state.sum_dist+add;\n\n\t\t\t\tQ.push(State(state.node,candidate,state.type,state.dir,true)); //■■■■■■■■■これが最短とは限らないので1回push■■■■■■■■■\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tType next_type;\n\t\t\tDIR next_dir;\n\n\n\t\t\tif(G[state.node][i].is_yoko){ //左右\n\n\t\t\t\tnext_type = calcColor(next_node,next_dist,true);\n\t\t\t\tnext_dir = yoko;\n\n\t\t\t}else{ //上下\n\n\t\t\t\tnext_type = calcColor(next_node,next_dist,false);\n\t\t\t\tnext_dir = tate;\n\t\t\t}\n\n\t\t\tif(min_dist[next_node][next_type][next_dir] > next_dist){\n\n\t\t\t\tmin_dist[next_node][next_type][next_dir] = next_dist;\n\t\t\t\tQ.push(State(next_node,next_dist,next_type,next_dir,false));\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"-1\\n\"); //バグ\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&W,&H);\n\t\tif(W == 0 && H == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":300,"memory_kb":4424,"score_of_the_acc":-1,"final_rank":5},{"submission_id":"aoj_2036_1357278","code_snippet":"#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_W = 100;\nconst int MAX_H = 100;\nconst int MAX_HW = MAX_H * MAX_W;\n\nconst int INF = 1 << 30;\n\nconst int dxs[] = { 1, 0, -1, 0 };\nconst int dys[] = { 0, 1, 0, -1 };\n\n/* typedef */\n\nstruct Signal {\n int nst, ewt, itv, s;\n};\n\nstruct Stat {\n int d, pos, drc;\n Stat() {}\n Stat(int _d, int _pos, int _drc) { d = _d, pos = _pos, drc = _drc; }\n bool operator<(const Stat& st0) const { return d > st0.d; }\n void print() { printf(\"d=%d, pos=%d, drc=%d\\n\", d, pos, drc); }\n};\n\nenum { D_NS = 0, D_EW = 1 };\n\ntypedef vector<Stat> vs;\n\n/* global variables */\n\nint w, h, hw;\nint dws[MAX_W], dhs[MAX_H];\nSignal sgnls[MAX_HW + 2];\n\nvs nbrs[MAX_HW + 2];\nint dists[MAX_HW + 2][2];\n\n/* subroutines */\n\nvoid onroad(int x, int n, int *ds, int& i, int& dx) {\n i = 0, dx = x;\n while (i < n && dx >= ds[i]) dx -= ds[i], i++;\n}\n\nint time_go(Signal& sgnl, int t, int drc) {\n int rt = t % sgnl.itv;\n int tg = -1;\n \n if (sgnl.s == D_NS) {\t// nst -> ewt\n if (drc == D_NS) tg = (rt < sgnl.nst) ? t : sgnl.itv * (t / sgnl.itv + 1);\n else tg = (rt >= sgnl.nst) ? t : (t / sgnl.itv) * sgnl.itv + sgnl.nst;\n }\n else {\t// ewt -> nst\n if (drc == D_EW) tg = (rt < sgnl.ewt) ? t : sgnl.itv * (t / sgnl.itv + 1);\n else tg = (rt >= sgnl.ewt) ? t : (t / sgnl.itv) * sgnl.itv + sgnl.ewt;\n }\n\n return tg;\n}\n\n/* main */\n\nint main() {\n for (;;) {\n cin >> w >> h;\n if (w == 0) break;\n\n hw = h * w;\n \n for (int i = 0; i < w - 1; i++) cin >> dws[i];\n for (int i = 0; i < h - 1; i++) cin >> dhs[i];\n\n for (int y = 0; y < h; y++)\n for (int x = 0; x < w; x++) {\n\tint pos = y * w + x;\n\tSignal& sgnl = sgnls[pos];\n\tcin >> sgnl.nst >> sgnl.ewt >> sgnl.s;\n\tsgnl.itv = sgnl.nst + sgnl.ewt;\n\n\tnbrs[pos].clear();\n\n\tfor (int di = 0; di < 4; di++) {\n\t int x0 = x + dxs[di];\n\t int y0 = y + dys[di];\n\t if (x0 >= 0 && x0 < w && y0 >= 0 && y0 < h) {\n\t int pos0 = y0 * w + x0;\n\t int ec, edrc;\n\t if (x0 != x) {\n\t ec = dws[(x0 < x) ? x0 : x];\n\t edrc = D_EW;\n\t }\n\t else {\n\t ec = dhs[(y0 < y) ? y0 : y];\n\t edrc = D_NS;\n\t }\n\t nbrs[pos].push_back(Stat(ec, pos0, edrc));\n\t }\n\t}\n }\n\n int sx, sy;\n cin >> sx >> sy;\n\n int sxi, syi, sdx, sdy;\n onroad(sx, w - 1, dws, sxi, sdx);\n onroad(sy, h - 1, dhs, syi, sdy);\n //printf(\"(sxi,syi)=(%d,%d), (sdx,sdy)=(%d,%d)\\n\", sxi, syi, sdx, sdy);\n \n nbrs[hw].clear();\n \n if (sdx != 0) {\n int pos0 = syi * w + sxi, pos1 = pos0 + 1;\n nbrs[hw].push_back(Stat(sdx, pos0, D_EW));\n nbrs[hw].push_back(Stat(dws[sxi] - sdx, pos1, D_EW));\n sgnls[hw].nst = 0;\n sgnls[hw].ewt = 1;\n sgnls[hw].itv = 1;\n sgnls[hw].s = D_EW;\n }\n else {\n int pos0 = syi * w + sxi, pos1 = pos0 + w;\n nbrs[hw].push_back(Stat(sdy, pos0, D_NS));\n nbrs[hw].push_back(Stat(dhs[syi] - sdy, pos1, D_NS));\n sgnls[hw].nst = 1;\n sgnls[hw].ewt = 0;\n sgnls[hw].itv = 1;\n sgnls[hw].s = D_NS;\n }\n\n int gx, gy;\n cin >> gx >> gy;\n\n int gxi, gyi, gdx, gdy;\n onroad(gx, w - 1, dws, gxi, gdx);\n onroad(gy, h - 1, dhs, gyi, gdy);\n //printf(\"(gxi,gyi)=(%d,%d), (gdx,gdy)=(%d,%d)\\n\", gxi, gyi, gdx, gdy);\n\n if (gdx != 0) {\n int pos0 = gyi * w + gxi, pos1 = pos0 + 1;\n nbrs[pos0].push_back(Stat(gdx, hw + 1, D_EW));\n nbrs[pos1].push_back(Stat(dws[gxi] - gdx, hw + 1, D_EW));\n }\n else {\n int pos0 = gyi * w + gxi, pos1 = pos0 + w;\n nbrs[pos0].push_back(Stat(gdy, hw + 1, D_NS));\n nbrs[pos1].push_back(Stat(dhs[gyi] - gdy, hw + 1, D_NS));\n }\n\n if (sxi == gxi && syi == gyi) {\n if (sdy == 0 && gdy == 0) {\n\tint dx = (gdx > sdx) ? gdx - sdx : sdx - gdx;\n\tnbrs[hw].push_back(Stat(dx, hw + 1, D_EW));\n }\n else if (sdx == 0 && gdx == 0) {\n\tint dy = (gdy > sdy) ? gdy - sdy : sdy - gdy;\n\tnbrs[hw].push_back(Stat(dy, hw + 1, D_NS));\n }\n }\n \n for (int pos = 0; pos < hw + 2; pos++)\n for (int drc = 0; drc < 2; drc++)\n\tdists[pos][drc] = INF;\n\n dists[hw][0] = dists[hw][1] = 0;\n\n priority_queue<Stat> q;\n q.push(Stat(0, hw, sgnls[hw].s));\n\n int mind = INF;\n \n while (! q.empty()) {\n Stat u = q.top();\n q.pop();\n //u.print();\n \n if (u.d != dists[u.pos][u.drc]) continue;\n if (u.pos == hw + 1) {\n\tmind = u.d;\n\tbreak;\n }\n\n int ud = time_go(sgnls[u.pos], u.d, u.drc);\n vs& nbru = nbrs[u.pos];\n\n for (vs::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {\n\tStat& v = *vit;\n\tint vd = ud + v.d;\n\n\tif (dists[v.pos][v.drc] > vd) {\n\t dists[v.pos][v.drc] = vd;\n\t q.push(Stat(vd, v.pos, v.drc));\n\t}\n }\n }\n\n cout << mind << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":460,"memory_kb":2304,"score_of_the_acc":-0.3736,"final_rank":1},{"submission_id":"aoj_2036_469393","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 int INF = INT_MAX / 2;\n\nint h, w;\nvector<int> dy, dx;\nvector<vector<int> > ns, ew, s;\n\nvoid add(int& y, int& x)\n{\n int y2 = 1;\n while(y > 0){\n y -= dy[y2];\n ++ y2;\n }\n int x2 = 1;\n while(x > 0){\n x -= dx[x2];\n ++ x2;\n }\n\n if(y != 0 || x != 0){\n if(y == 0){\n dx[x2-1] += x;\n dx.insert(dx.begin()+x2, -x);\n for(int i=0; i<h+2; ++i){\n ns[i].insert(ns[i].begin()+x2, 1);\n ew[i].insert(ew[i].begin()+x2, INF);\n s[i].insert(s[i].begin()+x2, 1);\n }\n ++ w;\n }else{\n dy[y2-1] += y;\n dy.insert(dy.begin()+y2, -y);\n ns.insert(ns.begin()+y2, vector<int>(w+2, INF));\n ew.insert(ew.begin()+y2, vector<int>(w+2, 1));\n s.insert(s.begin()+y2, vector<int>(w+2, 0));\n ++ h;\n }\n }\n\n y = y2;\n x = x2;\n}\n\nint main()\n{\n for(;;){\n cin >> w >> h;\n if(h == 0)\n return 0;\n\n dx.assign(w+1, INF);\n dy.assign(h+1, INF);\n for(int i=1; i<w; ++i)\n cin >> dx[i];\n for(int i=1; i<h; ++i)\n cin >> dy[i];\n\n ns = ew = s = vector<vector<int> >(h+2, vector<int>(w+2, 1));\n for(int i=1; i<=h; ++i){\n for(int j=1; j<=w; ++j){\n cin >> ns[i][j] >> ew[i][j] >> s[i][j];\n }\n }\n\n int sy, sx, gy, gx;\n cin >> sx >> sy >> gx >> gy;\n int sy0 = sy;\n int sx0 = sx;\n add(sy0, sx0);\n add(gy, gx);\n add(sy, sx);\n\n vector<vector<vector<int> > > dp(h+2, vector<vector<int> >(w+2, vector<int>(2, INF)));\n for(int i=0; i<h+2; ++i)\n dp[i][0][1] = dp[i][w+1][1] = -1;\n for(int i=0; i<w+2; ++i)\n dp[0][i][0] = dp[h+1][i][0] = -1;\n\n multimap<int, pair<pair<int, int>, int> > mm;\n dp[sy][sx][0] = dp[sy][sx][1] = 0;\n mm.insert(make_pair(0, make_pair(make_pair(sy, sx), 0)));\n mm.insert(make_pair(0, make_pair(make_pair(sy, sx), 1)));\n\n while(!mm.empty()){\n int t = mm.begin()->first;\n int y = mm.begin()->second.first.first;\n int x = mm.begin()->second.first.second;\n int d = mm.begin()->second.second;\n mm.erase(mm.begin());\n if(t > dp[y][x][d])\n continue;\n\n if(s[y][x] == 0){\n int t2 = t % (ns[y][x] + ew[y][x]);\n if(d == 0){\n if(t2 >= ns[y][x])\n t += -t2 + (ns[y][x] + ew[y][x]);\n }else{\n if(t2 < ns[y][x])\n t += -t2 + ns[y][x];\n }\n }else{\n int t2 = t % (ew[y][x] + ns[y][x]);\n if(d == 0){\n if(t2 < ew[y][x])\n t += -t2 + ew[y][x];\n }else{\n if(t2 >= ew[y][x])\n t += -t2 + (ew[y][x] + ns[y][x]);\n }\n }\n\n if(y == gy && x == gx && t < INF){\n cout << t << endl;\n break;\n }\n\n for(int i=0; i<2; ++i){\n int t2 = t + dy[y-1+i];\n int y2 = y - 1 + 2*i;\n int x2 = x;\n int d2 = 0;\n if(t2 < dp[y2][x2][d2]){\n dp[y2][x2][d2] = t2;\n mm.insert(make_pair(t2, make_pair(make_pair(y2, x2), d2)));\n }\n }\n for(int i=0; i<2; ++i){\n int t2 = t + dx[x-1+i];\n int y2 = y;\n int x2 = x - 1 + 2*i;\n int d2 = 1;\n if(t2 < dp[y2][x2][d2]){\n dp[y2][x2][d2] = t2;\n mm.insert(make_pair(t2, make_pair(make_pair(y2, x2), d2)));\n }\n }\n }\n }\n}","accuracy":1,"time_ms":580,"memory_kb":2064,"score_of_the_acc":-0.4644,"final_rank":2},{"submission_id":"aoj_2036_131525","code_snippet":"#include<iostream>\n#include<cassert>\n#include<climits>\n#include<queue>\n#include<vector>\n#include<complex>\n#include<cmath>\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)\n#define pb push_back\n#define NODE(i,j,c) ((i)*c+(j)+2)\n#define ALL(C) (C).begin(),(C).end()\ntypedef long long ll;\ntypedef complex<double> P;\n\nconst ll inf = (1LL)<<60;\n\nenum{N=0,E=1,S=0,W=1};\nenum{VER=0,HOR=1};//HOR- VER|\nchar dir[]={\"NESW\"};\n\nll check(ll t,int dir,int s,int n,int e){//need to take dir%2\ndir%=2;\n if (n+e==0)return 0;\n ll mod=n+e;\n ll tmp=t%mod;\n if (s==VER){\n if (tmp <n){\n if (dir==HOR)return n-tmp;\n else if (dir==VER)return 0;\n }else {\n if (dir==HOR)return 0;\n else if (dir==VER)return n+e-tmp;\n }\n }else if (s == HOR){\n if (tmp < e){\n if (dir==VER)return e-tmp;\n else if (dir==HOR)return 0;\n }else {\n if (dir==HOR)return e+n-tmp;\n else if (dir==VER)return 0;\n }\n }\n return -1;\n}\n\nclass state{\npublic:\n short now,dir;\n ll cost;\n bool operator<(const state&a)const{\n return cost > a.cost;\n }\n};\n\ntypedef struct{int to,dir;int cost;}Edge;\n\nconst int node =100*100+2;\nll cost[node][4];\nvector<Edge> edge[node];\nint es[node];\nint ns[node];\nint s[node];\n\nll dijkstra(int n){//src==0,dst==1\n rep(i,n)rep(j,4)cost[i][j]=inf;\n priority_queue<state> Q;\n rep(i,edge[0].size()){\n int nex=edge[0][i].to;\n int ned=edge[0][i].dir;\n cost[nex][ned]=edge[0][i].cost;\n cost[nex][ned]+=check(cost[nex][ned],ned,s[nex],ns[nex],es[nex]);\n Q.push((state){nex,ned,cost[nex][ned]});\n }\n\n while(!Q.empty()){\n state now = Q.top();Q.pop();\n if (cost[now.now][now.dir] != now.cost)continue;\n if (now.now == 1)return now.cost;\n\n rep(i,edge[now.now].size()){\n int nex=edge[now.now][i].to;\n int ned=edge[now.now][i].dir;\n ll tcost=now.cost+edge[now.now][i].cost;\n tcost+=check(tcost,ned,s[nex],ns[nex],es[nex]);\n if (tcost < cost[nex][ned]){\n\tcost[nex][ned]=tcost;\n\tQ.push((state){nex,ned,tcost});\n }\n }\n }\n return -1;\n}\n\nbool isp(double x1,double y1,double x2,double y2,double x3,double y3){\n P a(x1,y1),b(x2,y2),c(x3,y3);\n return abs(a-c)+abs(b-c) < abs(a-b)+1e-10;\n}\n\nint getindex(int a,vector<int> &b){\n rep(i,b.size()-1){\n if (b[i] <= a && a <= b[i+1])return i;\n }\n}\n\nvoid setpos(int cur,int xs,int ys,vector<int> &x,vector<int> &y){\n int r=y.size(),c=x.size();\n rep(i,x.size()){\n if (xs == x[i]){\n int tmp=getindex(ys,y);\n edge[cur].pb((Edge){NODE(tmp+1,i,c),N,y[tmp+1]-ys});\n edge[NODE(tmp+1,i,c)].pb((Edge){cur,S,y[tmp+1]-ys});\n edge[cur].pb((Edge){NODE(tmp,i,c) ,S,ys-y[tmp]});\n edge[NODE(tmp,i,c)].pb((Edge){cur,N,ys-y[tmp]});\n }\n }\n\n rep(i,y.size()){\n if (ys == y[i]){\n int tmp=getindex(xs,x);\n edge[cur].pb((Edge){NODE(i,tmp+1,c),E,x[tmp+1]-xs});\n edge[NODE(i,tmp+1,c)].pb((Edge){cur,W,x[tmp+1]-xs});\n edge[cur].pb((Edge){NODE(i,tmp,c ),W,xs-x[tmp]});\n edge[NODE(i,tmp,c)].pb((Edge){cur ,E,xs-x[tmp]});\n }\n }\n}\n\nint issame(int a,int b,vector<int> &cor,vector<int>&c,int cd){\n bool isok=false;\n rep(i,c.size()){\n if (c[i] == cd)isok=true;\n }\n if (!isok)return -1;\n rep(i,cor.size()-1){\n if (cor[i] <= a && a <= cor[i+1] &&\n\tcor[i] <= b && b <= cor[i+1])return abs(a-b);\n }\n return -1;\n}\n\nmain(){\n int r,c;\n while(cin>>c>>r && r){\n vector<int> x(c,0),y(r,0);\n REP(i,1,c)cin>>x[i],x[i]+=x[i-1];\n REP(i,1,r)cin>>y[i],y[i]+=y[i-1];\n rep(i,r*c+2)edge[i].clear();\n\n rep(i,r){\n rep(j,c){\n\tint cur=NODE(i,j,c),nex;\n\tll dist;\n\tif (i){\n\t nex=NODE(i-1,j,c);dist=y[i]-y[i-1];\n\t edge[cur].pb((Edge){nex,S,dist});\n\t}\n\tif (i+1!=r){\n\t nex=NODE(i+1,j,c);dist=y[i+1]-y[i];\n\t edge[cur].pb((Edge){nex,N,dist});\n\t}\n\tif (j){\n\t nex=NODE(i,j-1,c);dist=x[j]-x[j-1];\n\t edge[cur].pb((Edge){nex,W,dist});\n\t}\n\tif (j+1!=c){\n\t nex=NODE(i,j+1,c);dist=x[j+1]-x[j];\n\t edge[cur].pb((Edge){nex,E,dist});\n\t}\n }\n }\n\n rep(i,r){\n rep(j,c)cin>>ns[NODE(i,j,c)]>>es[NODE(i,j,c)]>>s[NODE(i,j,c)];\n }\n\n int xs,ys,xd,yd;\n cin>>xs>>ys>>xd>>yd;\n \n setpos(0,xs,ys,x,y);\n setpos(1,xd,yd,x,y);\n if (xs == xd && ys == yd){\n cout << 0 << endl;\n continue;\n }\n if (xs==xd){\n ll tmp=issame(ys,yd,y,x,xs);\n if (tmp != -1){cout << tmp << endl;continue;}\n }\n if (ys==yd){\n ll tmp=issame(xs,xd,x,y,ys);\n if (tmp != -1){cout << tmp << endl;continue;}\n }\n cout << dijkstra(r*c+2) << endl;\n }\n return false;\n}","accuracy":1,"time_ms":920,"memory_kb":2020,"score_of_the_acc":-0.9858,"final_rank":3},{"submission_id":"aoj_2036_131524","code_snippet":"#include<iostream>\n#include<cassert>\n#include<climits>\n#include<queue>\n#include<vector>\n#include<complex>\n#include<cmath>\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)\n#define pb push_back\n#define NODE(i,j,c) ((i)*c+(j)+2)\n#define ALL(C) (C).begin(),(C).end()\ntypedef long long ll;\ntypedef complex<double> P;\n\nconst ll inf = (1LL)<<60;\n\nenum{N=0,E=1,S=0,W=1};\nenum{VER=0,HOR=1};//HOR- VER|\nchar dir[]={\"NESW\"};\n\nll check(ll t,int dir,int s,int n,int e){//need to take dir%2\n if (n+e==0)return 0;\n ll mod=n+e;\n ll tmp=t%mod;\n if (s==VER){\n if (tmp <n){\n if (dir==HOR)return n-tmp;\n else if (dir==VER)return 0;\n }else {\n if (dir==HOR)return 0;\n else if (dir==VER)return n+e-tmp;\n }\n }else if (s == HOR){\n if (tmp < e){\n if (dir==VER)return e-tmp;\n else if (dir==HOR)return 0;\n }else {\n if (dir==HOR)return e+n-tmp;\n else if (dir==VER)return 0;\n }\n }\n return -1;\n}\n\nclass state{\npublic:\n short now,dir;\n ll cost;\n bool operator<(const state&a)const{\n return cost > a.cost;\n }\n};\n\ntypedef struct{int to,dir;int cost;}Edge;\n\nconst int node =100*100+2;\nll cost[node][4];\nvector<Edge> edge[node];\nint es[node];\nint ns[node];\nint s[node];\n\nll dijkstra(int n){//src==0,dst==1\n rep(i,n)rep(j,4)cost[i][j]=inf;\n priority_queue<state> Q;\n rep(i,edge[0].size()){\n int nex=edge[0][i].to;\n int ned=edge[0][i].dir;\n cost[nex][ned]=edge[0][i].cost;\n cost[nex][ned]+=check(cost[nex][ned],ned,s[nex],ns[nex],es[nex]);\n Q.push((state){nex,ned,cost[nex][ned]});\n }\n\n while(!Q.empty()){\n state now = Q.top();Q.pop();\n if (cost[now.now][now.dir] != now.cost)continue;\n if (now.now == 1)return now.cost;\n\n rep(i,edge[now.now].size()){\n int nex=edge[now.now][i].to;\n int ned=edge[now.now][i].dir;\n ll tcost=now.cost+edge[now.now][i].cost;\n tcost+=check(tcost,ned,s[nex],ns[nex],es[nex]);\n if (tcost < cost[nex][ned]){\n\tcost[nex][ned]=tcost;\n\tQ.push((state){nex,ned,tcost});\n }\n }\n }\n return -1;\n}\n\nbool isp(double x1,double y1,double x2,double y2,double x3,double y3){\n P a(x1,y1),b(x2,y2),c(x3,y3);\n return abs(a-c)+abs(b-c) < abs(a-b)+1e-10;\n}\n\nint getindex(int a,vector<int> &b){\n rep(i,b.size()-1){\n if (b[i] <= a && a <= b[i+1])return i;\n }\n}\n\nvoid setpos(int cur,int xs,int ys,vector<int> &x,vector<int> &y){\n int r=y.size(),c=x.size();\n rep(i,x.size()){\n if (xs == x[i]){\n int tmp=getindex(ys,y);\n edge[cur].pb((Edge){NODE(tmp+1,i,c),N,y[tmp+1]-ys});\n edge[NODE(tmp+1,i,c)].pb((Edge){cur,S,y[tmp+1]-ys});\n edge[cur].pb((Edge){NODE(tmp,i,c) ,S,ys-y[tmp]});\n edge[NODE(tmp,i,c)].pb((Edge){cur,N,ys-y[tmp]});\n }\n }\n\n rep(i,y.size()){\n if (ys == y[i]){\n int tmp=getindex(xs,x);\n edge[cur].pb((Edge){NODE(i,tmp+1,c),E,x[tmp+1]-xs});\n edge[NODE(i,tmp+1,c)].pb((Edge){cur,W,x[tmp+1]-xs});\n edge[cur].pb((Edge){NODE(i,tmp,c ),W,xs-x[tmp]});\n edge[NODE(i,tmp,c)].pb((Edge){cur ,E,xs-x[tmp]});\n }\n }\n}\n\nint issame(int a,int b,vector<int> &cor,vector<int>&c,int cd){\n bool isok=false;\n rep(i,c.size()){\n if (c[i] == cd)isok=true;\n }\n if (!isok)return -1;\n rep(i,cor.size()-1){\n if (cor[i] <= a && a <= cor[i+1] &&\n\tcor[i] <= b && b <= cor[i+1])return abs(a-b);\n }\n return -1;\n}\n\nmain(){\n int r,c;\n while(cin>>c>>r && r){\n vector<int> x(c,0),y(r,0);\n REP(i,1,c)cin>>x[i],x[i]+=x[i-1];\n REP(i,1,r)cin>>y[i],y[i]+=y[i-1];\n rep(i,r*c+2)edge[i].clear();\n\n rep(i,r){\n rep(j,c){\n\tint cur=NODE(i,j,c),nex;\n\tll dist;\n\tif (i){\n\t nex=NODE(i-1,j,c);dist=y[i]-y[i-1];\n\t edge[cur].pb((Edge){nex,S,dist});\n\t}\n\tif (i+1!=r){\n\t nex=NODE(i+1,j,c);dist=y[i+1]-y[i];\n\t edge[cur].pb((Edge){nex,N,dist});\n\t}\n\tif (j){\n\t nex=NODE(i,j-1,c);dist=x[j]-x[j-1];\n\t edge[cur].pb((Edge){nex,W,dist});\n\t}\n\tif (j+1!=c){\n\t nex=NODE(i,j+1,c);dist=x[j+1]-x[j];\n\t edge[cur].pb((Edge){nex,E,dist});\n\t}\n }\n }\n\n rep(i,r){\n rep(j,c)cin>>ns[NODE(i,j,c)]>>es[NODE(i,j,c)]>>s[NODE(i,j,c)];\n }\n\n int xs,ys,xd,yd;\n cin>>xs>>ys>>xd>>yd;\n \n setpos(0,xs,ys,x,y);\n setpos(1,xd,yd,x,y);\n if (xs == xd && ys == yd){\n cout << 0 << endl;\n continue;\n }\n if (xs==xd){\n ll tmp=issame(ys,yd,y,x,xs);\n if (tmp != -1){cout << tmp << endl;continue;}\n }\n if (ys==yd){\n ll tmp=issame(xs,xd,x,y,ys);\n if (tmp != -1){cout << tmp << endl;continue;}\n }\n cout << dijkstra(r*c+2) << endl;\n }\n return false;\n}","accuracy":1,"time_ms":920,"memory_kb":2020,"score_of_the_acc":-0.9858,"final_rank":3},{"submission_id":"aoj_2036_131515","code_snippet":"#include<iostream>\n#include<cassert>\n#include<climits>\n#include<queue>\n#include<vector>\n#include<complex>\n#include<cmath>\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)\n#define pb push_back\n#define NODE(i,j,c) ((i)*c+(j)+2)\n#define ALL(C) (C).begin(),(C).end()\ntypedef long long ll;\ntypedef complex<double> P;\n\nconst ll inf = (1LL)<<60;\n\nenum{N=0,E=1,S=0,W=1};\nenum{VER=0,HOR=1};//HOR- VER|\nchar dir[]={\"NESW\"};\n\nll check(ll t,int dir,int s,int n,int e){//need to take dir%2\n if (n+e==0)return 0;\n ll mod=n+e;\n ll tmp=t%mod;\n if (s==VER){\n if (tmp <n){\n if (dir==HOR)return n-tmp;\n else if (dir==VER)return 0;\n }else {\n if (dir==HOR)return 0;\n else if (dir==VER)return n+e-tmp;\n }\n }else if (s == HOR){\n if (tmp < e){\n if (dir==VER)return e-tmp;\n else if (dir==HOR)return 0;\n }else {\n if (dir==HOR)return e+n-tmp;\n else if (dir==VER)return 0;\n }\n }\n return -1;\n}\n\nclass state{\npublic:\n short now,dir;\n ll cost;\n bool operator<(const state&a)const{\n return cost > a.cost;\n }\n};\n\ntypedef struct{int to,dir;int cost;}Edge;\n\nconst int node =100*100+2;\nll cost[node][4];\nvector<Edge> edge[node];\nint es[node];\nint ns[node];\nint s[node];\n\nll dijkstra(int n){//src==0,dst==1\n rep(i,n)rep(j,4)cost[i][j]=inf;\n priority_queue<state> Q;\n rep(i,edge[0].size()){\n int nex=edge[0][i].to;\n int ned=edge[0][i].dir;\n cost[nex][ned]=edge[0][i].cost;\n cost[nex][ned]+=check(cost[nex][ned],ned,s[nex],ns[nex],es[nex]);\n Q.push((state){nex,ned,cost[nex][ned]});\n }\n\n while(!Q.empty()){\n state now = Q.top();Q.pop();\n if (cost[now.now][now.dir] != now.cost)continue;\n if (now.now == 1)return now.cost;\n // assert(cost[now.now][now.dir] >=0);\n // cout << now.now <<\" \" << dir[now.dir] <<\" \" << now.cost << endl;\n\n rep(i,edge[now.now].size()){\n int nex=edge[now.now][i].to;\n int ned=edge[now.now][i].dir;\n ll tcost=now.cost+edge[now.now][i].cost;\n //ll check(ll t,int dir,int s,int n,int e){//need to take dir%2\n // cout << now.now <<\" \" << nex <<\" \" << check(tcost,ned,s[nex],ns[nex],es[nex])<<endl;\n tcost+=check(tcost,ned,s[nex],ns[nex],es[nex]);\n if (tcost < cost[nex][ned]){\n\tcost[nex][ned]=tcost;\n\tQ.push((state){nex,ned,tcost});\n }\n }\n }\n return -1;\n}\n\nbool isp(double x1,double y1,double x2,double y2,double x3,double y3){\n P a(x1,y1),b(x2,y2),c(x3,y3);\n return abs(a-c)+abs(b-c) < abs(a-b)+1e-10;\n}\n\nint getindex(int a,vector<int> &b){\n rep(i,b.size()-1){\n if (b[i] <= a && a <= b[i+1])return i;\n }\n assert(false);\n}\n\nvoid setpos(int cur,int xs,int ys,vector<int> &x,vector<int> &y){\n int r=y.size(),c=x.size();\n rep(i,x.size()){\n if (xs == x[i]){\n int tmp=getindex(ys,y);\n edge[cur].pb((Edge){NODE(tmp+1,i,c),N,y[tmp+1]-ys});\n edge[NODE(tmp+1,i,c)].pb((Edge){cur,S,y[tmp+1]-ys});\n edge[cur].pb((Edge){NODE(tmp,i,c) ,S,ys-y[tmp]});\n edge[NODE(tmp,i,c)].pb((Edge){cur,N,ys-y[tmp]});\n }\n }\n\n rep(i,y.size()){\n if (ys == y[i]){\n int tmp=getindex(xs,x);\n edge[cur].pb((Edge){NODE(i,tmp+1,c),E,x[tmp+1]-xs});\n edge[NODE(i,tmp+1,c)].pb((Edge){cur,W,x[tmp+1]-xs});\n edge[cur].pb((Edge){NODE(i,tmp,c ),W,xs-x[tmp]});\n edge[NODE(i,tmp,c)].pb((Edge){cur ,E,xs-x[tmp]});\n }\n }\n}\n\nint issame(int a,int b,vector<int> &cor,vector<int>&c,int cd){\n bool isok=false;\n rep(i,c.size()){\n if (c[i] == cd)isok=true;\n }\n if (!isok)return -1;\n rep(i,cor.size()-1){\n if (cor[i] <= a && a <= cor[i+1] &&\n\tcor[i] <= b && b <= cor[i+1])return abs(a-b);\n }\n return -1;\n}\n\nmain(){\n int r,c;\n while(cin>>c>>r && r){\n vector<int> x(c,0),y(r,0);\n REP(i,1,c)cin>>x[i],x[i]+=x[i-1];\n REP(i,1,r)cin>>y[i],y[i]+=y[i-1];\n rep(i,r*c+2)edge[i].clear();\n\n rep(i,r){\n rep(j,c){\n\tint cur=NODE(i,j,c),nex;\n\tll dist;\n\tif (i){\n\t nex=NODE(i-1,j,c);dist=y[i]-y[i-1];\n\t edge[cur].pb((Edge){nex,S,dist});\n\t}\n\tif (i+1!=r){\n\t nex=NODE(i+1,j,c);dist=y[i+1]-y[i];\n\t edge[cur].pb((Edge){nex,N,dist});\n\t}\n\tif (j){\n\t nex=NODE(i,j-1,c);dist=x[j]-x[j-1];\n\t edge[cur].pb((Edge){nex,W,dist});\n\t}\n\tif (j+1!=c){\n\t nex=NODE(i,j+1,c);dist=x[j+1]-x[j];\n\t edge[cur].pb((Edge){nex,E,dist});\n\t}\n }\n }\n\n rep(i,r){\n rep(j,c)cin>>ns[NODE(i,j,c)]>>es[NODE(i,j,c)]>>s[NODE(i,j,c)];\n }\n\n int xs,ys,xd,yd;\n cin>>xs>>ys>>xd>>yd;\n \n setpos(0,xs,ys,x,y);\n setpos(1,xd,yd,x,y);\n if (xs == xd && ys == yd){\n cout << 0 << endl;\n continue;\n }\n if (xs==xd){\n ll tmp=issame(ys,yd,y,x,xs);\n if (tmp != -1){cout << tmp << endl;continue;}\n }\n if (ys==yd){\n ll tmp=issame(xs,xd,x,y,ys);\n if (tmp != -1){cout << tmp << endl;continue;}\n }\n cout << dijkstra(r*c+2) << endl;\n\n// rep(i,x.size())cout << x[i]<<\" \";cout <<endl;\n// rep(i,y.size())cout<<y[i]<<\" \";cout << endl;\n// rep(i,r*c+2){\n// cout << \"now \";\n// if (i == 0)cout <<0 <<\"(\" << xs <<\",\" << ys <<\")\";\n// else if (i == 1)cout << 1 <<\"(\" << xd <<\",\" << yd <<\")\";\n// else cout <<i <<\"(\" << x[(i-2)%c] <<\",\" << y[(i-2)/c] << \")\";\n// cout << endl;\n// rep(j,edge[i].size()){\n// \tcout << edge[i][j].to<<\" \" ;\n// \tif (edge[i][j].to==0)cout << xs <<\" \" << ys <<\" \";\n// \telse if(edge[i][j].to == 1)cout <<xd <<\" \" << yd <<\" \";\n// \telse cout << \"(\" << x[(edge[i][j].to-2)%c] <<\",\" << y[(edge[i][j].to-2)/c] <<\")\";\n// \tcout << edge[i][j].cost <<\" \" << dir[edge[i][j].dir] << endl;\n// }\n// cout << endl;\n// }\n\n }\n return false;\n}","accuracy":1,"time_ms":930,"memory_kb":2016,"score_of_the_acc":-1,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_2036_6775560\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define chmin(x,y) x = min(x,y)\\n#define chmax(x,y) x = max(x,y)\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n#define SIZE 105\\n\\nenum DIR{\\n\\tyoko,\\n\\ttate,\\n};\\n\\nenum Type{\\n\\tGreen,\\n\\tRed,\\n};\\n\\nstruct Edge{\\n\\tEdge(int arg_to,int arg_dist,bool arg_is_yoko){\\n\\t\\tto = arg_to;\\n\\t\\tdist = arg_dist;\\n\\t\\tis_yoko = arg_is_yoko;\\n\\t}\\n\\n\\tint to,dist;\\n\\tbool is_yoko;\\n};\\n\\nstruct Info{\\n\\n\\tint a,b;\\n\\tbool is_yoko;\\n};\\n\\nstruct State{\\n\\n\\tState(){\\n\\t\\tnode = sum_dist = 0;\\n\\t\\ttype = Green;\\n\\t\\tdir = yoko;\\n\\t\\tis_goal = false;\\n\\t}\\n\\n\\tState(int arg_node,int arg_sum_dist,Type arg_type,DIR arg_dir,bool arg_is_goal){\\n\\t\\tnode = arg_node;\\n\\t\\tsum_dist = arg_sum_dist;\\n\\t\\ttype = arg_type;\\n\\t\\tdir = arg_dir;\\n\\t\\tis_goal = arg_is_goal;\\n\\t}\\n\\tbool operator<(const struct State& arg) const{\\n\\n\\t\\treturn sum_dist > arg.sum_dist; //昇順(PQ)\\n\\t}\\n\\tint node,sum_dist;\\n\\tType type;\\n\\tDIR dir;\\n\\tbool is_goal;\\n};\\n\\n\\nvector<Edge> G[SIZE*SIZE];\\n\\nint W,H;\\nint D_yoko[SIZE],D_tate[SIZE];\\nint NS[SIZE*SIZE],EW[SIZE*SIZE],S[SIZE*SIZE];\\nint X[SIZE*SIZE],Y[SIZE*SIZE];\\n\\nint min_dist[SIZE*SIZE][2][2];\\n\\n\\nint getInd(int row,int col){\\n\\n\\treturn row*W + col;\\n}\\n\\n//通りの計算\\nInfo calcPos(int x,int y){\\n\\n\\tInfo ret;\\n\\tret.a = -1;\\n\\tret.b = -1;\\n\\n\\tint h = 0,w = 0;\\n\\n\\t//横方向の通り\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tif(y != h){\\n\\n\\t\\t\\th += D_tate[row];\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tw = 0;\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\tif(x > w && x < w+D_yoko[col]){\\n\\n\\t\\t\\t\\tret.a = getInd(row,col);\\n\\t\\t\\t\\tret.b = getInd(row,col+1);\\n\\t\\t\\t\\tret.is_yoko = true;\\n\\t\\t\\t\\treturn ret;\\n\\t\\t\\t}\\n\\t\\t\\tw += D_yoko[col];\\n\\t\\t}\\n\\t\\th += D_tate[row];\\n\\t}\\n\\n\\t//縦方向の通り\\n\\tw = 0;\\n\\tfor(int col = 0; col < W; col++){\\n\\t\\tif(x != w){\\n\\n\\t\\t\\tw += D_yoko[col];\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\th = 0;\\n\\t\\tfor(int row = 0; row < H; row++){\\n\\t\\t\\tif(y > h && y < h+D_tate[row]){\\n\\n\\t\\t\\t\\tret.a = getInd(row,col);\\n\\t\\t\\t\\tret.b = getInd(row+1,col);\\n\\t\\t\\t\\tret.is_yoko = false;\\n\\t\\t\\t\\treturn ret;\\n\\t\\t\\t}\\n\\t\\t\\th += D_tate[row];\\n\\t\\t}\\n\\t\\tw += D_yoko[col];\\n\\t}\\n\\n\\treturn ret; //バグ\\n}\\n\\n//ある時刻における信号機の色を計算\\nType calcColor(int ind,int T,bool is_yoko){\\n\\n\\tint base = NS[ind]+EW[ind];\\n\\n\\tint mod = T%base;\\n\\n\\tif(S[ind] == 0){ //最初に南北方向の信号が緑\\n\\n\\t\\tif(is_yoko){ //左右の移動\\n\\n\\t\\t\\t//■到着した瞬間に緑は待たなくてよい\\n\\t\\t\\tif(mod < NS[ind]){\\n\\n\\t\\t\\t\\treturn Red;\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\treturn Green;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //南北の移動\\n\\n\\t\\t\\t//■到着した瞬間に赤は停止\\n\\t\\t\\tif(mod < NS[ind]){\\n\\n\\t\\t\\t\\treturn Green;\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\treturn Red;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}else{ //最初に東西方向の信号が緑\\n\\n\\t\\tif(is_yoko){ //東西の移動\\n\\n\\t\\t\\t//■到着した瞬間に赤は停止\\n\\t\\t\\tif(mod < EW[ind]){\\n\\n\\t\\t\\t\\treturn Green;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\treturn Red;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //南北の移動\\n\\n\\t\\t\\t//■到着した瞬間に緑は待たなくてよい\\n\\t\\t\\tif(mod < EW[ind]){\\n\\n\\t\\t\\t\\treturn Red;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\treturn Green;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < H*W; i++){\\n\\t\\tG[i].clear();\\n\\t}\\n\\n\\t//区画幅(横)\\n\\tfor(int i = 0; i < W-1; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&D_yoko[i]);\\n\\t}\\n\\t//区画幅(縦)\\n\\tfor(int i = 0; i < H-1; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&D_tate[i]);\\n\\t}\\n\\n\\t//H*W個の交差点の座標を計算\\n\\tint h = 0;\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tint w = 0;\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\tint ind = getInd(row,col);\\n\\t\\t\\tX[ind] = w;\\n\\t\\t\\tY[ind] = h;\\n\\t\\t\\tw += D_yoko[col];\\n\\t\\t}\\n\\t\\th += D_tate[row];\\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 ind = getInd(row,col);\\n\\n\\t\\t\\tscanf(\\\"%d %d %d\\\",&NS[ind],&EW[ind],&S[ind]);\\n\\t\\t}\\n\\t}\\n\\n\\tint s_x,s_y;\\n\\tscanf(\\\"%d %d\\\",&s_x,&s_y);\\n\\n\\tInfo s_pos = calcPos(s_x,s_y);\\n\\n\\tint t_x,t_y;\\n\\tscanf(\\\"%d %d\\\",&t_x,&t_y);\\n\\n\\tInfo t_pos = calcPos(t_x,t_y);\\n\\n\\n\\t//同じ通りにある\\n\\tif(s_pos.a == t_pos.a && s_pos.b == t_pos.b){\\n\\n\\t\\tif(s_x == t_x){\\n\\n\\t\\t\\tprintf(\\\"%d\\\\n\\\",abs(s_y-t_y));\\n\\t\\t\\treturn;\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tprintf(\\\"%d\\\\n\\\",abs(s_x-t_x));\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n\\n\\t/*辺張り*/\\n\\n\\t//左右\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W-1; col++){\\n\\n\\t\\t\\tint a = getInd(row,col);\\n\\t\\t\\tint b = getInd(row,col+1);\\n\\n\\t\\t\\tG[a].push_back(Edge(b,D_yoko[col],true));\\n\\t\\t\\tG[b].push_back(Edge(a,D_yoko[col],true));\\n\\t\\t}\\n\\t}\\n\\n\\t//上下\\n\\tfor(int col = 0; col < W; col++){\\n\\t\\tfor(int row = 0; row < H-1; row++){\\n\\n\\t\\t\\tint a = getInd(row,col);\\n\\t\\t\\tint b = getInd(row+1,col);\\n\\n\\t\\t\\tG[a].push_back(Edge(b,D_tate[row],false));\\n\\t\\t\\tG[b].push_back(Edge(a,D_tate[row],false));\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\tfor(int a = 0; a < 2 ; a++){\\n\\n\\t\\t\\t\\tint ind = getInd(row,col);\\n\\t\\t\\t\\tmin_dist[ind][Green][a] = BIG_NUM;\\n\\t\\t\\t\\tmin_dist[ind][Red][a] = BIG_NUM;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tpriority_queue<State> Q;\\n\\n\\t/* とりあえず、スタートから最寄りの交差点に寄る */\\n\\n\\tif(s_pos.is_yoko){\\n\\n\\t\\t//aへ\\n\\t\\tint T = abs(s_x - X[s_pos.a]);\\n\\t\\tType type = calcColor(s_pos.a,T,true);\\n\\n\\t\\tQ.push(State(s_pos.a,T,type,yoko,false));\\n\\n\\t\\t//bへ\\n\\t\\tT = abs(s_x - X[s_pos.b]);\\n\\t\\ttype = calcColor(s_pos.b,T,true);\\n\\n\\t\\tQ.push(State(s_pos.b,T,type,yoko,false));\\n\\n\\t}else{ //startが縦の通りにある\\n\\n\\t\\t//aへ\\n\\t\\tint T = abs(s_y - Y[s_pos.a]);\\n\\t\\tType type = calcColor(s_pos.a,T,false);\\n\\n\\t\\tQ.push(State(s_pos.a,T,type,tate,false));\\n\\n\\t\\t//bへ\\n\\t\\tT = abs(s_y - Y[s_pos.b]);\\n\\t\\ttype = calcColor(s_pos.b,T,false);\\n\\n\\t\\tQ.push(State(s_pos.b,T,type,tate,false));\\n\\t}\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tState state = Q.top();\\n\\t\\tQ.pop();\\n\\n\\t\\tif(state.is_goal){\\n\\n\\t\\t\\tprintf(\\\"%d\\\\n\\\",state.sum_dist);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tif(state.sum_dist > min_dist[state.node][state.type][state.dir]){\\n\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tif(state.type == Red){\\n\\n\\t\\t\\tbool is_yoko = (state.dir == yoko);\\n\\n\\t\\t\\t//青になるまで待つ\\n\\t\\t\\tint add = 0;\\n\\t\\t\\tint base = NS[state.node]+EW[state.node];\\n\\t\\t\\tint now = state.sum_dist%base;\\n\\n\\t\\t\\tif(is_yoko){\\n\\n\\t\\t\\t\\tif(S[state.node] == 0){ //最初に南北が青\\n\\n\\t\\t\\t\\t\\tadd = NS[state.node]-now;\\n\\n\\t\\t\\t\\t}else{ //最初に東西が青\\n\\n\\t\\t\\t\\t\\tadd = base-now;\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{ //南北の動き\\n\\n\\t\\t\\t\\tif(S[state.node] == 0){ //最初に南北が青\\n\\n\\t\\t\\t\\t\\tadd = base-now;\\n\\n\\t\\t\\t\\t}else{ //最初に東西が青\\n\\n\\t\\t\\t\\t\\tadd = EW[state.node]-now;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\n\\t\\t\\tint next_node = state.node;\\n\\t\\t\\tint next_dist = state.sum_dist+add;\\n\\t\\t\\tDIR next_dir = state.dir;\\n\\t\\t\\tType next_type = Green;\\n\\n\\t\\t\\tif(min_dist[next_node][next_type][next_dir] > next_dist){\\n\\n\\t\\t\\t\\tmin_dist[next_node][next_type][next_dir] = next_dist;\\n\\t\\t\\t\\tQ.push(State(next_node,next_dist,next_type,next_dir,false));\\n\\t\\t\\t}\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tfor(int i = 0; i < G[state.node].size(); i++){\\n\\n\\t\\t\\tint next_node = G[state.node][i].to;\\n\\t\\t\\tint next_dist = state.sum_dist + G[state.node][i].dist;\\n\\n\\n\\t\\t\\t//途中にゴールがあるか\\n\\t\\t\\tint a = min(state.node,next_node);\\n\\t\\t\\tint b = max(state.node,next_node);\\n\\n\\t\\t\\tif(t_pos.a == a && t_pos.b == b){\\n\\n\\t\\t\\t\\tint add = abs(X[state.node]-t_x)+abs(Y[state.node]-t_y);\\n\\t\\t\\t\\tint candidate = state.sum_dist+add;\\n\\n\\t\\t\\t\\tQ.push(State(state.node,candidate,state.type,state.dir,true)); //■■■■■■■■■これが最短とは限らないので1回push■■■■■■■■■\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tType next_type;\\n\\t\\t\\tDIR next_dir;\\n\\n\\n\\t\\t\\tif(G[state.node][i].is_yoko){ //左右\\n\\n\\t\\t\\t\\tnext_type = calcColor(next_node,next_dist,true);\\n\\t\\t\\t\\tnext_dir = yoko;\\n\\n\\t\\t\\t}else{ //上下\\n\\n\\t\\t\\t\\tnext_type = calcColor(next_node,next_dist,false);\\n\\t\\t\\t\\tnext_dir = tate;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(min_dist[next_node][next_type][next_dir] > next_dist){\\n\\n\\t\\t\\t\\tmin_dist[next_node][next_type][next_dir] = next_dist;\\n\\t\\t\\t\\tQ.push(State(next_node,next_dist,next_type,next_dir,false));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"-1\\\\n\\\"); //バグ\\n}\\n\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d\\\",&W,&H);\\n\\t\\tif(W == 0 && H == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 4424,\n \"score_of_the_acc\": -1,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2036_1357278\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_W = 100;\\nconst int MAX_H = 100;\\nconst int MAX_HW = MAX_H * MAX_W;\\n\\nconst int INF = 1 << 30;\\n\\nconst int dxs[] = { 1, 0, -1, 0 };\\nconst int dys[] = { 0, 1, 0, -1 };\\n\\n/* typedef */\\n\\nstruct Signal {\\n int nst, ewt, itv, s;\\n};\\n\\nstruct Stat {\\n int d, pos, drc;\\n Stat() {}\\n Stat(int _d, int _pos, int _drc) { d = _d, pos = _pos, drc = _drc; }\\n bool operator<(const Stat& st0) const { return d > st0.d; }\\n void print() { printf(\\\"d=%d, pos=%d, drc=%d\\\\n\\\", d, pos, drc); }\\n};\\n\\nenum { D_NS = 0, D_EW = 1 };\\n\\ntypedef vector<Stat> vs;\\n\\n/* global variables */\\n\\nint w, h, hw;\\nint dws[MAX_W], dhs[MAX_H];\\nSignal sgnls[MAX_HW + 2];\\n\\nvs nbrs[MAX_HW + 2];\\nint dists[MAX_HW + 2][2];\\n\\n/* subroutines */\\n\\nvoid onroad(int x, int n, int *ds, int& i, int& dx) {\\n i = 0, dx = x;\\n while (i < n && dx >= ds[i]) dx -= ds[i], i++;\\n}\\n\\nint time_go(Signal& sgnl, int t, int drc) {\\n int rt = t % sgnl.itv;\\n int tg = -1;\\n \\n if (sgnl.s == D_NS) {\\t// nst -> ewt\\n if (drc == D_NS) tg = (rt < sgnl.nst) ? t : sgnl.itv * (t / sgnl.itv + 1);\\n else tg = (rt >= sgnl.nst) ? t : (t / sgnl.itv) * sgnl.itv + sgnl.nst;\\n }\\n else {\\t// ewt -> nst\\n if (drc == D_EW) tg = (rt < sgnl.ewt) ? t : sgnl.itv * (t / sgnl.itv + 1);\\n else tg = (rt >= sgnl.ewt) ? t : (t / sgnl.itv) * sgnl.itv + sgnl.ewt;\\n }\\n\\n return tg;\\n}\\n\\n/* main */\\n\\nint main() {\\n for (;;) {\\n cin >> w >> h;\\n if (w == 0) break;\\n\\n hw = h * w;\\n \\n for (int i = 0; i < w - 1; i++) cin >> dws[i];\\n for (int i = 0; i < h - 1; i++) cin >> dhs[i];\\n\\n for (int y = 0; y < h; y++)\\n for (int x = 0; x < w; x++) {\\n\\tint pos = y * w + x;\\n\\tSignal& sgnl = sgnls[pos];\\n\\tcin >> sgnl.nst >> sgnl.ewt >> sgnl.s;\\n\\tsgnl.itv = sgnl.nst + sgnl.ewt;\\n\\n\\tnbrs[pos].clear();\\n\\n\\tfor (int di = 0; di < 4; di++) {\\n\\t int x0 = x + dxs[di];\\n\\t int y0 = y + dys[di];\\n\\t if (x0 >= 0 && x0 < w && y0 >= 0 && y0 < h) {\\n\\t int pos0 = y0 * w + x0;\\n\\t int ec, edrc;\\n\\t if (x0 != x) {\\n\\t ec = dws[(x0 < x) ? x0 : x];\\n\\t edrc = D_EW;\\n\\t }\\n\\t else {\\n\\t ec = dhs[(y0 < y) ? y0 : y];\\n\\t edrc = D_NS;\\n\\t }\\n\\t nbrs[pos].push_back(Stat(ec, pos0, edrc));\\n\\t }\\n\\t}\\n }\\n\\n int sx, sy;\\n cin >> sx >> sy;\\n\\n int sxi, syi, sdx, sdy;\\n onroad(sx, w - 1, dws, sxi, sdx);\\n onroad(sy, h - 1, dhs, syi, sdy);\\n //printf(\\\"(sxi,syi)=(%d,%d), (sdx,sdy)=(%d,%d)\\\\n\\\", sxi, syi, sdx, sdy);\\n \\n nbrs[hw].clear();\\n \\n if (sdx != 0) {\\n int pos0 = syi * w + sxi, pos1 = pos0 + 1;\\n nbrs[hw].push_back(Stat(sdx, pos0, D_EW));\\n nbrs[hw].push_back(Stat(dws[sxi] - sdx, pos1, D_EW));\\n sgnls[hw].nst = 0;\\n sgnls[hw].ewt = 1;\\n sgnls[hw].itv = 1;\\n sgnls[hw].s = D_EW;\\n }\\n else {\\n int pos0 = syi * w + sxi, pos1 = pos0 + w;\\n nbrs[hw].push_back(Stat(sdy, pos0, D_NS));\\n nbrs[hw].push_back(Stat(dhs[syi] - sdy, pos1, D_NS));\\n sgnls[hw].nst = 1;\\n sgnls[hw].ewt = 0;\\n sgnls[hw].itv = 1;\\n sgnls[hw].s = D_NS;\\n }\\n\\n int gx, gy;\\n cin >> gx >> gy;\\n\\n int gxi, gyi, gdx, gdy;\\n onroad(gx, w - 1, dws, gxi, gdx);\\n onroad(gy, h - 1, dhs, gyi, gdy);\\n //printf(\\\"(gxi,gyi)=(%d,%d), (gdx,gdy)=(%d,%d)\\\\n\\\", gxi, gyi, gdx, gdy);\\n\\n if (gdx != 0) {\\n int pos0 = gyi * w + gxi, pos1 = pos0 + 1;\\n nbrs[pos0].push_back(Stat(gdx, hw + 1, D_EW));\\n nbrs[pos1].push_back(Stat(dws[gxi] - gdx, hw + 1, D_EW));\\n }\\n else {\\n int pos0 = gyi * w + gxi, pos1 = pos0 + w;\\n nbrs[pos0].push_back(Stat(gdy, hw + 1, D_NS));\\n nbrs[pos1].push_back(Stat(dhs[gyi] - gdy, hw + 1, D_NS));\\n }\\n\\n if (sxi == gxi && syi == gyi) {\\n if (sdy == 0 && gdy == 0) {\\n\\tint dx = (gdx > sdx) ? gdx - sdx : sdx - gdx;\\n\\tnbrs[hw].push_back(Stat(dx, hw + 1, D_EW));\\n }\\n else if (sdx == 0 && gdx == 0) {\\n\\tint dy = (gdy > sdy) ? gdy - sdy : sdy - gdy;\\n\\tnbrs[hw].push_back(Stat(dy, hw + 1, D_NS));\\n }\\n }\\n \\n for (int pos = 0; pos < hw + 2; pos++)\\n for (int drc = 0; drc < 2; drc++)\\n\\tdists[pos][drc] = INF;\\n\\n dists[hw][0] = dists[hw][1] = 0;\\n\\n priority_queue<Stat> q;\\n q.push(Stat(0, hw, sgnls[hw].s));\\n\\n int mind = INF;\\n \\n while (! q.empty()) {\\n Stat u = q.top();\\n q.pop();\\n //u.print();\\n \\n if (u.d != dists[u.pos][u.drc]) continue;\\n if (u.pos == hw + 1) {\\n\\tmind = u.d;\\n\\tbreak;\\n }\\n\\n int ud = time_go(sgnls[u.pos], u.d, u.drc);\\n vs& nbru = nbrs[u.pos];\\n\\n for (vs::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {\\n\\tStat& v = *vit;\\n\\tint vd = ud + v.d;\\n\\n\\tif (dists[v.pos][v.drc] > vd) {\\n\\t dists[v.pos][v.drc] = vd;\\n\\t q.push(Stat(vd, v.pos, v.drc));\\n\\t}\\n }\\n }\\n\\n cout << mind << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 2304,\n \"score_of_the_acc\": -0.3736,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2036_469393\",\n \"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 int INF = INT_MAX / 2;\\n\\nint h, w;\\nvector<int> dy, dx;\\nvector<vector<int> > ns, ew, s;\\n\\nvoid add(int& y, int& x)\\n{\\n int y2 = 1;\\n while(y > 0){\\n y -= dy[y2];\\n ++ y2;\\n }\\n int x2 = 1;\\n while(x > 0){\\n x -= dx[x2];\\n ++ x2;\\n }\\n\\n if(y != 0 || x != 0){\\n if(y == 0){\\n dx[x2-1] += x;\\n dx.insert(dx.begin()+x2, -x);\\n for(int i=0; i<h+2; ++i){\\n ns[i].insert(ns[i].begin()+x2, 1);\\n ew[i].insert(ew[i].begin()+x2, INF);\\n s[i].insert(s[i].begin()+x2, 1);\\n }\\n ++ w;\\n }else{\\n dy[y2-1] += y;\\n dy.insert(dy.begin()+y2, -y);\\n ns.insert(ns.begin()+y2, vector<int>(w+2, INF));\\n ew.insert(ew.begin()+y2, vector<int>(w+2, 1));\\n s.insert(s.begin()+y2, vector<int>(w+2, 0));\\n ++ h;\\n }\\n }\\n\\n y = y2;\\n x = x2;\\n}\\n\\nint main()\\n{\\n for(;;){\\n cin >> w >> h;\\n if(h == 0)\\n return 0;\\n\\n dx.assign(w+1, INF);\\n dy.assign(h+1, INF);\\n for(int i=1; i<w; ++i)\\n cin >> dx[i];\\n for(int i=1; i<h; ++i)\\n cin >> dy[i];\\n\\n ns = ew = s = vector<vector<int> >(h+2, vector<int>(w+2, 1));\\n for(int i=1; i<=h; ++i){\\n for(int j=1; j<=w; ++j){\\n cin >> ns[i][j] >> ew[i][j] >> s[i][j];\\n }\\n }\\n\\n int sy, sx, gy, gx;\\n cin >> sx >> sy >> gx >> gy;\\n int sy0 = sy;\\n int sx0 = sx;\\n add(sy0, sx0);\\n add(gy, gx);\\n add(sy, sx);\\n\\n vector<vector<vector<int> > > dp(h+2, vector<vector<int> >(w+2, vector<int>(2, INF)));\\n for(int i=0; i<h+2; ++i)\\n dp[i][0][1] = dp[i][w+1][1] = -1;\\n for(int i=0; i<w+2; ++i)\\n dp[0][i][0] = dp[h+1][i][0] = -1;\\n\\n multimap<int, pair<pair<int, int>, int> > mm;\\n dp[sy][sx][0] = dp[sy][sx][1] = 0;\\n mm.insert(make_pair(0, make_pair(make_pair(sy, sx), 0)));\\n mm.insert(make_pair(0, make_pair(make_pair(sy, sx), 1)));\\n\\n while(!mm.empty()){\\n int t = mm.begin()->first;\\n int y = mm.begin()->second.first.first;\\n int x = mm.begin()->second.first.second;\\n int d = mm.begin()->second.second;\\n mm.erase(mm.begin());\\n if(t > dp[y][x][d])\\n continue;\\n\\n if(s[y][x] == 0){\\n int t2 = t % (ns[y][x] + ew[y][x]);\\n if(d == 0){\\n if(t2 >= ns[y][x])\\n t += -t2 + (ns[y][x] + ew[y][x]);\\n }else{\\n if(t2 < ns[y][x])\\n t += -t2 + ns[y][x];\\n }\\n }else{\\n int t2 = t % (ew[y][x] + ns[y][x]);\\n if(d == 0){\\n if(t2 < ew[y][x])\\n t += -t2 + ew[y][x];\\n }else{\\n if(t2 >= ew[y][x])\\n t += -t2 + (ew[y][x] + ns[y][x]);\\n }\\n }\\n\\n if(y == gy && x == gx && t < INF){\\n cout << t << endl;\\n break;\\n }\\n\\n for(int i=0; i<2; ++i){\\n int t2 = t + dy[y-1+i];\\n int y2 = y - 1 + 2*i;\\n int x2 = x;\\n int d2 = 0;\\n if(t2 < dp[y2][x2][d2]){\\n dp[y2][x2][d2] = t2;\\n mm.insert(make_pair(t2, make_pair(make_pair(y2, x2), d2)));\\n }\\n }\\n for(int i=0; i<2; ++i){\\n int t2 = t + dx[x-1+i];\\n int y2 = y;\\n int x2 = x - 1 + 2*i;\\n int d2 = 1;\\n if(t2 < dp[y2][x2][d2]){\\n dp[y2][x2][d2] = t2;\\n mm.insert(make_pair(t2, make_pair(make_pair(y2, x2), d2)));\\n }\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 580,\n \"memory_kb\": 2064,\n \"score_of_the_acc\": -0.4644,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2036_131525\",\n \"code_snippet\": \"#include<iostream>\\n#include<cassert>\\n#include<climits>\\n#include<queue>\\n#include<vector>\\n#include<complex>\\n#include<cmath>\\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)\\n#define pb push_back\\n#define NODE(i,j,c) ((i)*c+(j)+2)\\n#define ALL(C) (C).begin(),(C).end()\\ntypedef long long ll;\\ntypedef complex<double> P;\\n\\nconst ll inf = (1LL)<<60;\\n\\nenum{N=0,E=1,S=0,W=1};\\nenum{VER=0,HOR=1};//HOR- VER|\\nchar dir[]={\\\"NESW\\\"};\\n\\nll check(ll t,int dir,int s,int n,int e){//need to take dir%2\\ndir%=2;\\n if (n+e==0)return 0;\\n ll mod=n+e;\\n ll tmp=t%mod;\\n if (s==VER){\\n if (tmp <n){\\n if (dir==HOR)return n-tmp;\\n else if (dir==VER)return 0;\\n }else {\\n if (dir==HOR)return 0;\\n else if (dir==VER)return n+e-tmp;\\n }\\n }else if (s == HOR){\\n if (tmp < e){\\n if (dir==VER)return e-tmp;\\n else if (dir==HOR)return 0;\\n }else {\\n if (dir==HOR)return e+n-tmp;\\n else if (dir==VER)return 0;\\n }\\n }\\n return -1;\\n}\\n\\nclass state{\\npublic:\\n short now,dir;\\n ll cost;\\n bool operator<(const state&a)const{\\n return cost > a.cost;\\n }\\n};\\n\\ntypedef struct{int to,dir;int cost;}Edge;\\n\\nconst int node =100*100+2;\\nll cost[node][4];\\nvector<Edge> edge[node];\\nint es[node];\\nint ns[node];\\nint s[node];\\n\\nll dijkstra(int n){//src==0,dst==1\\n rep(i,n)rep(j,4)cost[i][j]=inf;\\n priority_queue<state> Q;\\n rep(i,edge[0].size()){\\n int nex=edge[0][i].to;\\n int ned=edge[0][i].dir;\\n cost[nex][ned]=edge[0][i].cost;\\n cost[nex][ned]+=check(cost[nex][ned],ned,s[nex],ns[nex],es[nex]);\\n Q.push((state){nex,ned,cost[nex][ned]});\\n }\\n\\n while(!Q.empty()){\\n state now = Q.top();Q.pop();\\n if (cost[now.now][now.dir] != now.cost)continue;\\n if (now.now == 1)return now.cost;\\n\\n rep(i,edge[now.now].size()){\\n int nex=edge[now.now][i].to;\\n int ned=edge[now.now][i].dir;\\n ll tcost=now.cost+edge[now.now][i].cost;\\n tcost+=check(tcost,ned,s[nex],ns[nex],es[nex]);\\n if (tcost < cost[nex][ned]){\\n\\tcost[nex][ned]=tcost;\\n\\tQ.push((state){nex,ned,tcost});\\n }\\n }\\n }\\n return -1;\\n}\\n\\nbool isp(double x1,double y1,double x2,double y2,double x3,double y3){\\n P a(x1,y1),b(x2,y2),c(x3,y3);\\n return abs(a-c)+abs(b-c) < abs(a-b)+1e-10;\\n}\\n\\nint getindex(int a,vector<int> &b){\\n rep(i,b.size()-1){\\n if (b[i] <= a && a <= b[i+1])return i;\\n }\\n}\\n\\nvoid setpos(int cur,int xs,int ys,vector<int> &x,vector<int> &y){\\n int r=y.size(),c=x.size();\\n rep(i,x.size()){\\n if (xs == x[i]){\\n int tmp=getindex(ys,y);\\n edge[cur].pb((Edge){NODE(tmp+1,i,c),N,y[tmp+1]-ys});\\n edge[NODE(tmp+1,i,c)].pb((Edge){cur,S,y[tmp+1]-ys});\\n edge[cur].pb((Edge){NODE(tmp,i,c) ,S,ys-y[tmp]});\\n edge[NODE(tmp,i,c)].pb((Edge){cur,N,ys-y[tmp]});\\n }\\n }\\n\\n rep(i,y.size()){\\n if (ys == y[i]){\\n int tmp=getindex(xs,x);\\n edge[cur].pb((Edge){NODE(i,tmp+1,c),E,x[tmp+1]-xs});\\n edge[NODE(i,tmp+1,c)].pb((Edge){cur,W,x[tmp+1]-xs});\\n edge[cur].pb((Edge){NODE(i,tmp,c ),W,xs-x[tmp]});\\n edge[NODE(i,tmp,c)].pb((Edge){cur ,E,xs-x[tmp]});\\n }\\n }\\n}\\n\\nint issame(int a,int b,vector<int> &cor,vector<int>&c,int cd){\\n bool isok=false;\\n rep(i,c.size()){\\n if (c[i] == cd)isok=true;\\n }\\n if (!isok)return -1;\\n rep(i,cor.size()-1){\\n if (cor[i] <= a && a <= cor[i+1] &&\\n\\tcor[i] <= b && b <= cor[i+1])return abs(a-b);\\n }\\n return -1;\\n}\\n\\nmain(){\\n int r,c;\\n while(cin>>c>>r && r){\\n vector<int> x(c,0),y(r,0);\\n REP(i,1,c)cin>>x[i],x[i]+=x[i-1];\\n REP(i,1,r)cin>>y[i],y[i]+=y[i-1];\\n rep(i,r*c+2)edge[i].clear();\\n\\n rep(i,r){\\n rep(j,c){\\n\\tint cur=NODE(i,j,c),nex;\\n\\tll dist;\\n\\tif (i){\\n\\t nex=NODE(i-1,j,c);dist=y[i]-y[i-1];\\n\\t edge[cur].pb((Edge){nex,S,dist});\\n\\t}\\n\\tif (i+1!=r){\\n\\t nex=NODE(i+1,j,c);dist=y[i+1]-y[i];\\n\\t edge[cur].pb((Edge){nex,N,dist});\\n\\t}\\n\\tif (j){\\n\\t nex=NODE(i,j-1,c);dist=x[j]-x[j-1];\\n\\t edge[cur].pb((Edge){nex,W,dist});\\n\\t}\\n\\tif (j+1!=c){\\n\\t nex=NODE(i,j+1,c);dist=x[j+1]-x[j];\\n\\t edge[cur].pb((Edge){nex,E,dist});\\n\\t}\\n }\\n }\\n\\n rep(i,r){\\n rep(j,c)cin>>ns[NODE(i,j,c)]>>es[NODE(i,j,c)]>>s[NODE(i,j,c)];\\n }\\n\\n int xs,ys,xd,yd;\\n cin>>xs>>ys>>xd>>yd;\\n \\n setpos(0,xs,ys,x,y);\\n setpos(1,xd,yd,x,y);\\n if (xs == xd && ys == yd){\\n cout << 0 << endl;\\n continue;\\n }\\n if (xs==xd){\\n ll tmp=issame(ys,yd,y,x,xs);\\n if (tmp != -1){cout << tmp << endl;continue;}\\n }\\n if (ys==yd){\\n ll tmp=issame(xs,xd,x,y,ys);\\n if (tmp != -1){cout << tmp << endl;continue;}\\n }\\n cout << dijkstra(r*c+2) << endl;\\n }\\n return false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 920,\n \"memory_kb\": 2020,\n \"score_of_the_acc\": -0.9858,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2036_131524\",\n \"code_snippet\": \"#include<iostream>\\n#include<cassert>\\n#include<climits>\\n#include<queue>\\n#include<vector>\\n#include<complex>\\n#include<cmath>\\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)\\n#define pb push_back\\n#define NODE(i,j,c) ((i)*c+(j)+2)\\n#define ALL(C) (C).begin(),(C).end()\\ntypedef long long ll;\\ntypedef complex<double> P;\\n\\nconst ll inf = (1LL)<<60;\\n\\nenum{N=0,E=1,S=0,W=1};\\nenum{VER=0,HOR=1};//HOR- VER|\\nchar dir[]={\\\"NESW\\\"};\\n\\nll check(ll t,int dir,int s,int n,int e){//need to take dir%2\\n if (n+e==0)return 0;\\n ll mod=n+e;\\n ll tmp=t%mod;\\n if (s==VER){\\n if (tmp <n){\\n if (dir==HOR)return n-tmp;\\n else if (dir==VER)return 0;\\n }else {\\n if (dir==HOR)return 0;\\n else if (dir==VER)return n+e-tmp;\\n }\\n }else if (s == HOR){\\n if (tmp < e){\\n if (dir==VER)return e-tmp;\\n else if (dir==HOR)return 0;\\n }else {\\n if (dir==HOR)return e+n-tmp;\\n else if (dir==VER)return 0;\\n }\\n }\\n return -1;\\n}\\n\\nclass state{\\npublic:\\n short now,dir;\\n ll cost;\\n bool operator<(const state&a)const{\\n return cost > a.cost;\\n }\\n};\\n\\ntypedef struct{int to,dir;int cost;}Edge;\\n\\nconst int node =100*100+2;\\nll cost[node][4];\\nvector<Edge> edge[node];\\nint es[node];\\nint ns[node];\\nint s[node];\\n\\nll dijkstra(int n){//src==0,dst==1\\n rep(i,n)rep(j,4)cost[i][j]=inf;\\n priority_queue<state> Q;\\n rep(i,edge[0].size()){\\n int nex=edge[0][i].to;\\n int ned=edge[0][i].dir;\\n cost[nex][ned]=edge[0][i].cost;\\n cost[nex][ned]+=check(cost[nex][ned],ned,s[nex],ns[nex],es[nex]);\\n Q.push((state){nex,ned,cost[nex][ned]});\\n }\\n\\n while(!Q.empty()){\\n state now = Q.top();Q.pop();\\n if (cost[now.now][now.dir] != now.cost)continue;\\n if (now.now == 1)return now.cost;\\n\\n rep(i,edge[now.now].size()){\\n int nex=edge[now.now][i].to;\\n int ned=edge[now.now][i].dir;\\n ll tcost=now.cost+edge[now.now][i].cost;\\n tcost+=check(tcost,ned,s[nex],ns[nex],es[nex]);\\n if (tcost < cost[nex][ned]){\\n\\tcost[nex][ned]=tcost;\\n\\tQ.push((state){nex,ned,tcost});\\n }\\n }\\n }\\n return -1;\\n}\\n\\nbool isp(double x1,double y1,double x2,double y2,double x3,double y3){\\n P a(x1,y1),b(x2,y2),c(x3,y3);\\n return abs(a-c)+abs(b-c) < abs(a-b)+1e-10;\\n}\\n\\nint getindex(int a,vector<int> &b){\\n rep(i,b.size()-1){\\n if (b[i] <= a && a <= b[i+1])return i;\\n }\\n}\\n\\nvoid setpos(int cur,int xs,int ys,vector<int> &x,vector<int> &y){\\n int r=y.size(),c=x.size();\\n rep(i,x.size()){\\n if (xs == x[i]){\\n int tmp=getindex(ys,y);\\n edge[cur].pb((Edge){NODE(tmp+1,i,c),N,y[tmp+1]-ys});\\n edge[NODE(tmp+1,i,c)].pb((Edge){cur,S,y[tmp+1]-ys});\\n edge[cur].pb((Edge){NODE(tmp,i,c) ,S,ys-y[tmp]});\\n edge[NODE(tmp,i,c)].pb((Edge){cur,N,ys-y[tmp]});\\n }\\n }\\n\\n rep(i,y.size()){\\n if (ys == y[i]){\\n int tmp=getindex(xs,x);\\n edge[cur].pb((Edge){NODE(i,tmp+1,c),E,x[tmp+1]-xs});\\n edge[NODE(i,tmp+1,c)].pb((Edge){cur,W,x[tmp+1]-xs});\\n edge[cur].pb((Edge){NODE(i,tmp,c ),W,xs-x[tmp]});\\n edge[NODE(i,tmp,c)].pb((Edge){cur ,E,xs-x[tmp]});\\n }\\n }\\n}\\n\\nint issame(int a,int b,vector<int> &cor,vector<int>&c,int cd){\\n bool isok=false;\\n rep(i,c.size()){\\n if (c[i] == cd)isok=true;\\n }\\n if (!isok)return -1;\\n rep(i,cor.size()-1){\\n if (cor[i] <= a && a <= cor[i+1] &&\\n\\tcor[i] <= b && b <= cor[i+1])return abs(a-b);\\n }\\n return -1;\\n}\\n\\nmain(){\\n int r,c;\\n while(cin>>c>>r && r){\\n vector<int> x(c,0),y(r,0);\\n REP(i,1,c)cin>>x[i],x[i]+=x[i-1];\\n REP(i,1,r)cin>>y[i],y[i]+=y[i-1];\\n rep(i,r*c+2)edge[i].clear();\\n\\n rep(i,r){\\n rep(j,c){\\n\\tint cur=NODE(i,j,c),nex;\\n\\tll dist;\\n\\tif (i){\\n\\t nex=NODE(i-1,j,c);dist=y[i]-y[i-1];\\n\\t edge[cur].pb((Edge){nex,S,dist});\\n\\t}\\n\\tif (i+1!=r){\\n\\t nex=NODE(i+1,j,c);dist=y[i+1]-y[i];\\n\\t edge[cur].pb((Edge){nex,N,dist});\\n\\t}\\n\\tif (j){\\n\\t nex=NODE(i,j-1,c);dist=x[j]-x[j-1];\\n\\t edge[cur].pb((Edge){nex,W,dist});\\n\\t}\\n\\tif (j+1!=c){\\n\\t nex=NODE(i,j+1,c);dist=x[j+1]-x[j];\\n\\t edge[cur].pb((Edge){nex,E,dist});\\n\\t}\\n }\\n }\\n\\n rep(i,r){\\n rep(j,c)cin>>ns[NODE(i,j,c)]>>es[NODE(i,j,c)]>>s[NODE(i,j,c)];\\n }\\n\\n int xs,ys,xd,yd;\\n cin>>xs>>ys>>xd>>yd;\\n \\n setpos(0,xs,ys,x,y);\\n setpos(1,xd,yd,x,y);\\n if (xs == xd && ys == yd){\\n cout << 0 << endl;\\n continue;\\n }\\n if (xs==xd){\\n ll tmp=issame(ys,yd,y,x,xs);\\n if (tmp != -1){cout << tmp << endl;continue;}\\n }\\n if (ys==yd){\\n ll tmp=issame(xs,xd,x,y,ys);\\n if (tmp != -1){cout << tmp << endl;continue;}\\n }\\n cout << dijkstra(r*c+2) << endl;\\n }\\n return false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 920,\n \"memory_kb\": 2020,\n \"score_of_the_acc\": -0.9858,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2036_131515\",\n \"code_snippet\": \"#include<iostream>\\n#include<cassert>\\n#include<climits>\\n#include<queue>\\n#include<vector>\\n#include<complex>\\n#include<cmath>\\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)\\n#define pb push_back\\n#define NODE(i,j,c) ((i)*c+(j)+2)\\n#define ALL(C) (C).begin(),(C).end()\\ntypedef long long ll;\\ntypedef complex<double> P;\\n\\nconst ll inf = (1LL)<<60;\\n\\nenum{N=0,E=1,S=0,W=1};\\nenum{VER=0,HOR=1};//HOR- VER|\\nchar dir[]={\\\"NESW\\\"};\\n\\nll check(ll t,int dir,int s,int n,int e){//need to take dir%2\\n if (n+e==0)return 0;\\n ll mod=n+e;\\n ll tmp=t%mod;\\n if (s==VER){\\n if (tmp <n){\\n if (dir==HOR)return n-tmp;\\n else if (dir==VER)return 0;\\n }else {\\n if (dir==HOR)return 0;\\n else if (dir==VER)return n+e-tmp;\\n }\\n }else if (s == HOR){\\n if (tmp < e){\\n if (dir==VER)return e-tmp;\\n else if (dir==HOR)return 0;\\n }else {\\n if (dir==HOR)return e+n-tmp;\\n else if (dir==VER)return 0;\\n }\\n }\\n return -1;\\n}\\n\\nclass state{\\npublic:\\n short now,dir;\\n ll cost;\\n bool operator<(const state&a)const{\\n return cost > a.cost;\\n }\\n};\\n\\ntypedef struct{int to,dir;int cost;}Edge;\\n\\nconst int node =100*100+2;\\nll cost[node][4];\\nvector<Edge> edge[node];\\nint es[node];\\nint ns[node];\\nint s[node];\\n\\nll dijkstra(int n){//src==0,dst==1\\n rep(i,n)rep(j,4)cost[i][j]=inf;\\n priority_queue<state> Q;\\n rep(i,edge[0].size()){\\n int nex=edge[0][i].to;\\n int ned=edge[0][i].dir;\\n cost[nex][ned]=edge[0][i].cost;\\n cost[nex][ned]+=check(cost[nex][ned],ned,s[nex],ns[nex],es[nex]);\\n Q.push((state){nex,ned,cost[nex][ned]});\\n }\\n\\n while(!Q.empty()){\\n state now = Q.top();Q.pop();\\n if (cost[now.now][now.dir] != now.cost)continue;\\n if (now.now == 1)return now.cost;\\n // assert(cost[now.now][now.dir] >=0);\\n // cout << now.now <<\\\" \\\" << dir[now.dir] <<\\\" \\\" << now.cost << endl;\\n\\n rep(i,edge[now.now].size()){\\n int nex=edge[now.now][i].to;\\n int ned=edge[now.now][i].dir;\\n ll tcost=now.cost+edge[now.now][i].cost;\\n //ll check(ll t,int dir,int s,int n,int e){//need to take dir%2\\n // cout << now.now <<\\\" \\\" << nex <<\\\" \\\" << check(tcost,ned,s[nex],ns[nex],es[nex])<<endl;\\n tcost+=check(tcost,ned,s[nex],ns[nex],es[nex]);\\n if (tcost < cost[nex][ned]){\\n\\tcost[nex][ned]=tcost;\\n\\tQ.push((state){nex,ned,tcost});\\n }\\n }\\n }\\n return -1;\\n}\\n\\nbool isp(double x1,double y1,double x2,double y2,double x3,double y3){\\n P a(x1,y1),b(x2,y2),c(x3,y3);\\n return abs(a-c)+abs(b-c) < abs(a-b)+1e-10;\\n}\\n\\nint getindex(int a,vector<int> &b){\\n rep(i,b.size()-1){\\n if (b[i] <= a && a <= b[i+1])return i;\\n }\\n assert(false);\\n}\\n\\nvoid setpos(int cur,int xs,int ys,vector<int> &x,vector<int> &y){\\n int r=y.size(),c=x.size();\\n rep(i,x.size()){\\n if (xs == x[i]){\\n int tmp=getindex(ys,y);\\n edge[cur].pb((Edge){NODE(tmp+1,i,c),N,y[tmp+1]-ys});\\n edge[NODE(tmp+1,i,c)].pb((Edge){cur,S,y[tmp+1]-ys});\\n edge[cur].pb((Edge){NODE(tmp,i,c) ,S,ys-y[tmp]});\\n edge[NODE(tmp,i,c)].pb((Edge){cur,N,ys-y[tmp]});\\n }\\n }\\n\\n rep(i,y.size()){\\n if (ys == y[i]){\\n int tmp=getindex(xs,x);\\n edge[cur].pb((Edge){NODE(i,tmp+1,c),E,x[tmp+1]-xs});\\n edge[NODE(i,tmp+1,c)].pb((Edge){cur,W,x[tmp+1]-xs});\\n edge[cur].pb((Edge){NODE(i,tmp,c ),W,xs-x[tmp]});\\n edge[NODE(i,tmp,c)].pb((Edge){cur ,E,xs-x[tmp]});\\n }\\n }\\n}\\n\\nint issame(int a,int b,vector<int> &cor,vector<int>&c,int cd){\\n bool isok=false;\\n rep(i,c.size()){\\n if (c[i] == cd)isok=true;\\n }\\n if (!isok)return -1;\\n rep(i,cor.size()-1){\\n if (cor[i] <= a && a <= cor[i+1] &&\\n\\tcor[i] <= b && b <= cor[i+1])return abs(a-b);\\n }\\n return -1;\\n}\\n\\nmain(){\\n int r,c;\\n while(cin>>c>>r && r){\\n vector<int> x(c,0),y(r,0);\\n REP(i,1,c)cin>>x[i],x[i]+=x[i-1];\\n REP(i,1,r)cin>>y[i],y[i]+=y[i-1];\\n rep(i,r*c+2)edge[i].clear();\\n\\n rep(i,r){\\n rep(j,c){\\n\\tint cur=NODE(i,j,c),nex;\\n\\tll dist;\\n\\tif (i){\\n\\t nex=NODE(i-1,j,c);dist=y[i]-y[i-1];\\n\\t edge[cur].pb((Edge){nex,S,dist});\\n\\t}\\n\\tif (i+1!=r){\\n\\t nex=NODE(i+1,j,c);dist=y[i+1]-y[i];\\n\\t edge[cur].pb((Edge){nex,N,dist});\\n\\t}\\n\\tif (j){\\n\\t nex=NODE(i,j-1,c);dist=x[j]-x[j-1];\\n\\t edge[cur].pb((Edge){nex,W,dist});\\n\\t}\\n\\tif (j+1!=c){\\n\\t nex=NODE(i,j+1,c);dist=x[j+1]-x[j];\\n\\t edge[cur].pb((Edge){nex,E,dist});\\n\\t}\\n }\\n }\\n\\n rep(i,r){\\n rep(j,c)cin>>ns[NODE(i,j,c)]>>es[NODE(i,j,c)]>>s[NODE(i,j,c)];\\n }\\n\\n int xs,ys,xd,yd;\\n cin>>xs>>ys>>xd>>yd;\\n \\n setpos(0,xs,ys,x,y);\\n setpos(1,xd,yd,x,y);\\n if (xs == xd && ys == yd){\\n cout << 0 << endl;\\n continue;\\n }\\n if (xs==xd){\\n ll tmp=issame(ys,yd,y,x,xs);\\n if (tmp != -1){cout << tmp << endl;continue;}\\n }\\n if (ys==yd){\\n ll tmp=issame(xs,xd,x,y,ys);\\n if (tmp != -1){cout << tmp << endl;continue;}\\n }\\n cout << dijkstra(r*c+2) << endl;\\n\\n// rep(i,x.size())cout << x[i]<<\\\" \\\";cout <<endl;\\n// rep(i,y.size())cout<<y[i]<<\\\" \\\";cout << endl;\\n// rep(i,r*c+2){\\n// cout << \\\"now \\\";\\n// if (i == 0)cout <<0 <<\\\"(\\\" << xs <<\\\",\\\" << ys <<\\\")\\\";\\n// else if (i == 1)cout << 1 <<\\\"(\\\" << xd <<\\\",\\\" << yd <<\\\")\\\";\\n// else cout <<i <<\\\"(\\\" << x[(i-2)%c] <<\\\",\\\" << y[(i-2)/c] << \\\")\\\";\\n// cout << endl;\\n// rep(j,edge[i].size()){\\n// \\tcout << edge[i][j].to<<\\\" \\\" ;\\n// \\tif (edge[i][j].to==0)cout << xs <<\\\" \\\" << ys <<\\\" \\\";\\n// \\telse if(edge[i][j].to == 1)cout <<xd <<\\\" \\\" << yd <<\\\" \\\";\\n// \\telse cout << \\\"(\\\" << x[(edge[i][j].to-2)%c] <<\\\",\\\" << y[(edge[i][j].to-2)/c] <<\\\")\\\";\\n// \\tcout << edge[i][j].cost <<\\\" \\\" << dir[edge[i][j].dir] << endl;\\n// }\\n// cout << endl;\\n// }\\n\\n }\\n return false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 930,\n \"memory_kb\": 2016,\n \"score_of_the_acc\": -1,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1067,"cells":{"group_id":{"kind":"string","value":"aoj_2030_cpp"},"problem_description":{"kind":"string","value":"Problem A:\nRuins\nIn 1936, a dictator Hiedler who aimed at world domination had a deep obsession with\nthe Lost Ark\n. A\nperson with this ark would gain mystic power according to legend. To break the ambition of the dictator,\nACM (the Alliance of Crusaders against Mazis) entrusted a secret task to an archeologist Indiana Johns.\nIndiana stepped into a vast and harsh desert to find the ark.\nIndiana finally found an underground treasure house at a ruin in the desert. The treasure house seems\nstoring the ark. However, the door to the treasure house has a special lock, and it is not easy to open\nthe door.\nTo open the door, he should solve a problem raised by two positive integers\na\nand\nb\ninscribed on the door.\nThe problem requires him to find the minimum sum of squares of differences for all pairs of two integers\nadjacent in a sorted sequence that contains four positive integers\na\n1\n,\na\n2\n,\nb\n1\nand\nb\n2\nsuch that\na\n=\na\n1\na\n2\nand\nb\n=\nb\n1\nb\n2\n. Note that these four integers does not need to be different. For instance, suppose 33 and\n40 are inscribed on the door, he would have a sequence 3, 5, 8, 11 as 33 and 40 can be decomposed into\n3 × 11 and 5 × 8 respectively. This sequence gives the sum (5 - 3)\n2\n+ (8 - 5)\n2\n+ (11 - 8)\n2\n= 22, which is\nthe smallest sum among all possible sorted sequences. This example is included as the first data set in\nthe sample input.\nOnce Indiana fails to give the correct solution, he will suffer a calamity by a curse. On the other hand,\nhe needs to solve the problem as soon as possible, since many pawns under Hiedler are also searching\nfor the ark, and they might find the same treasure house. He will be immediately killed if this situation\nhappens. So he decided to solve the problem by your computer program.\nYour task is to write a program to solve the problem presented above.\nInput\nThe input consists of a series of data sets. Each data set is given by a line that contains two positive\nintegers not greater than 10,000.\nThe end of the input is represented by a pair of zeros, which should not be processed.\nOutput\nFor each data set, print a single integer that represents the minimum square sum in a line. No extra\nspace or text should appear.\nSample Input\n33 40\n57 144\n0 0\nOutput for the Sample Input\n22\n94"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2030_2645406","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\n\nvector<long long int> divisor(long long int n) {\n\tvector<long long int> res;\n\tfor (long long int i = 1; i * i <= n; ++i) {\n\t\tif (n % i == 0) {\n\t\t\tres.push_back(i);\n\t\t\tif (i * i != n) res.push_back(n / i);\n\t\t}\n\t}\n\tsort(begin(res), end(res));\n\treturn res;\n}\nint main() {\n\twhile (true) {\n\t\tint a,b;cin>>a>>b;\n\t\tif(!a)break;\n\t\tauto ad(divisor(a));\n\t\tauto bd(divisor(b));\n\t\tlong long int ans=1e18;\n\t\tfor (auto aa : ad) {\n\t\t\tfor (auto bb : bd) {\n\t\t\t\tvector<long long int>nums{ aa,a / aa,bb,b / bb };\n\t\t\t\tsort(nums.begin(),nums.end());\n\t\t\t\tlong long int nans=0;\n\t\t\t\tfor(int i=0;i<3;++i)nans+=(nums[i+1]-nums[i])*(nums[i+1]-nums[i]);\n\n\t\t\t\tans=min(ans,nans);\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":3116,"score_of_the_acc":-0.9757,"final_rank":18},{"submission_id":"aoj_2030_2196634","code_snippet":"#include<bits/stdc++.h>\n#define r(i,a,n) for(int i=a;i<n;i++)\n#define R(i,a,n) for(int i=a;i>n;i--)\nusing namespace std ;\nint main(){\n int a,b;\n while(cin>>a>>b,a){\n int aa[5001][2],bb[5001][2],c=0,cc=0;\n bool ac[10001],bc[10001];\n r(i,0,10001)ac[i]=0;\n r(i,0,10001)bc[i]=0;\n r(i,1,a+1){\n if(!ac[i]&&a%i==0)R(j,a,0){\n\tif(i*j==a){\n\t aa[c][0]=i;\n\t ac[i]=1;ac[j]=1;\n\t aa[c++][1]=j;\n\t break;\n\t}\n }\n }\n r(i,1,b+1){\n if(!bc[i]&&b%i==0)R(j,b,0){\n\tif(i*j==b){\n\t bb[cc][0]=i;\n\t bc[i]=1;bc[j]=1;\n\t bb[cc++][1]=j;\n\t break;\n\t}\n }\n }//cout<<bb[0][0]<<bb[0][1];\n long long l[7];\n long long m=999999999999;\n r(i,0,c){\n r(j,0,cc){\n\tint t[4];\n\tt[0]=aa[i][0];t[1]=aa[i][1];\n\tt[2]=bb[j][0];t[3]=bb[j][1];\n\tsort(t,t+4);\n\tl[0]=t[1]-t[0];\n\tl[1]=t[2]-t[1];\n\tl[2]=t[3]-t[2];\n\tm=min(m,l[0]*l[0]+l[1]*l[1]+l[2]*l[2]);\n }\n }\n //if(m==100000000)m=0;\n cout<<m<<endl;\n }\n}","accuracy":1,"time_ms":50,"memory_kb":3172,"score_of_the_acc":-1.012,"final_rank":19},{"submission_id":"aoj_2030_2196503","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n while(1){\n ll A,B;\n cin>>A>>B;\n if(!A&&!B) break;\n\n ll sum = 1LL<<55;\n for(int i=1;i*i<=A;i++){\n for(int j=1;j*j<=B;j++){\n\tif(A%i||B%j) continue;\n\tvector<int> v(4);\n\tv[0] = i;\n\tv[1] = A/i;\n\tv[2] = j;\n\tv[3] = B/j;\n\tsort(v.begin(),v.end());\n\tll t = 0;\n\tfor(int i=1;i<4;i++)t+=(v[i]-v[i-1])*(v[i]-v[i-1]);\n\tsum = min(sum,t);\n }\n }\n cout<<sum<<endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3044,"score_of_the_acc":-0.9505,"final_rank":17},{"submission_id":"aoj_2030_1781113","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\nconst double PI=acos(-1);\nconst double EPS=1e-10;\nconst int inf=1e9;\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int,int> pii;\nint main(){\n\tint n,m;\n\twhile(cin>>n>>m,n+m){\n\t\tvi a,b;\n\t\tfor(int i=1;i*i<=n;i++)if(n%i==0)a.pb(i);\n\t\tfor(int i=1;i*i<=m;i++)if(m%i==0)b.pb(i);\n\t\tint mi=inf;\n\t\trep(i,a.size())rep(j,b.size()){\n\t\t\tvi t;\n\t\t\tt.pb(a[i]);t.pb(n/a[i]);t.pb(b[j]);t.pb(m/b[j]);\n\t\t\tsort(all(t));\n\t\t\tint c=t[1]-t[0];\n\t\t\tint d=t[2]-t[1];\n\t\t\tint e=t[3]-t[2];\n\t\t\tmi=min(mi,c*c+d*d+e*e);\n\t\t}\n\t\tcout<<mi<<endl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":1220,"score_of_the_acc":-0.1528,"final_rank":7},{"submission_id":"aoj_2030_1030299","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\ntypedef pair<int,int>P;\n#define X first\n#define Y second\n#define pb push_back\nvector<P>V[10001];\n\nvoid V_set(){\n\tfor(int i=1;i<=10000;i++){\n\t\tfor(int j=1;j*j<=i;j++){\n\t\t\tif(i%j==0){\n\t\t\t\tV[i].pb(P(j,i/j));\n\t\t\t}\n\t\t}\n\t}\n}\n\nint cal(P a,P b){\n\tint d[4]={a.X,a.Y,b.X,b.Y};\n\tsort(d,d+4);\n\tint t=0;\n\tfor(int i=0;i<3;i++){\n\t\tt+=(d[i+1]-d[i])*(d[i+1]-d[i]);\n\t}\n\treturn t;\n}\n\nint main(){\n\t\n\tV_set();\n\t\n\tint a,b;\n\twhile(cin>>a>>b,a){\n\t\tint ans=999999999;\n\t\tfor(int i=0;i<V[a].size();i++){\n\t\t\tfor(int j=0;j<V[b].size();j++){\n\t\t\t\tans=min(ans,cal(V[a][i],V[b][j]));\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n\t\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":2052,"score_of_the_acc":-0.5139,"final_rank":15},{"submission_id":"aoj_2030_941092","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 << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) \n{ EACH(it, P) { s << \"<\" << it->first << \"->\" << it->second << \"> \"; } return s << endl; }\n\n\n\nvector<pair<long long, long long> > divisor(long long n) {\n vector<pair<long long, long long> > res;\n for (long long i = 1LL; i*i <= n; ++i) {\n if (n%i == 0LL) {\n long long temp = n/i;\n res.push_back(make_pair(i, temp));\n //if (i != temp) res.push_back(make_pair(temp, i));\n }\n }\n return res;\n}\n\nlong long sq(long long a) { return a*a; }\n\nint a, b;\n\nint main() {\n while (cin >> a >> b) {\n if (a == 0 && b == 0) break;\n \n long long res = 1LL<<60;\n vector<pll> va = divisor(a), vb = divisor(b);\n for (int i = 0; i < va.size(); ++i) {\n for (int j = 0; j < vb.size(); ++j) {\n vll vec(4);\n vec[0] = va[i].first, vec[1] = va[i].second, vec[2] = vb[j].first, vec[3] = vb[j].second;\n sort(ALL(vec));\n \n ll tmp = sq(vec[1] - vec[0]) + sq(vec[2] - vec[1]) + sq(vec[3] - vec[2]);\n chmin(res, tmp);\n }\n }\n \n cout << res << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1212,"score_of_the_acc":-0.1493,"final_rank":6},{"submission_id":"aoj_2030_850022","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\n#include <algorithm>\nusing namespace std;\ntypedef pair<int,int> P;\n#define p(a,b) (b-a)*(b-a)\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\n\nint compute(int a,int b,int c,int d){\n int e[4] = {a,b,c,d};\n int res = (1<<29);\n\n rep(i,4){\n rep(j,4){\n if(i == j) continue;\n rep(k,4){\n\tif(i == k || j == k) continue;\n\trep(l,4){\n\t if(i == l || j == l || k == l) continue;\n\t res = min(res,p(e[j],e[i])+p(e[k],e[j])+p(e[l],e[k]));\n\t}\n }\n }\n }\n \n return res;\n}\n\nint main(){\n int a,b;\n\n while(cin >> a >> b , a | b){\n vector<P> c,d;\n for(int i = 1 ; i*i <= a ; i++){\n if(a % i == 0){\n\tc.push_back(P(i,a/i));\n } \n }\n\n for(int i = 1 ; i*i <= b ; i++){\n if(b % i == 0){\n\td.push_back(P(i,b/i));\n }\n }\n\n int ans = (1<<29);\n rep(i,(int)c.size()){\n rep(j,(int)d.size()){\n\tans = min(ans,compute(c[i].first,c[i].second,d[j].first,d[j].second));\n }\n }\n\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1204,"score_of_the_acc":-0.1458,"final_rank":5},{"submission_id":"aoj_2030_850021","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\n#include <algorithm>\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef long long ll;\n#define p(a,b) (b-a)*(b-a)\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\n\nll compute(int a,int b,int c,int d){\n int e[4] = {a,b,c,d};\n int res = (1<<29);\n\n rep(i,4){\n rep(j,4){\n if(i == j) continue;\n rep(k,4){\n\tif(i == k || j == k) continue;\n\trep(l,4){\n\t if(i == l || j == l || k == l) continue;\n\t res = min(res,p(e[j],e[i])+p(e[k],e[j])+p(e[l],e[k]));\n\t}\n }\n }\n }\n \n return res;\n}\n\nint main(){\n int a,b;\n\n while(cin >> a >> b , a | b){\n vector<P> c,d;\n for(int i = 1 ; i*i <= a ; i++){\n if(a % i == 0){\n\tc.push_back(P(i,a/i));\n } \n }\n\n for(int i = 1 ; i*i <= b ; i++){\n if(b % i == 0){\n\td.push_back(P(i,b/i));\n }\n }\n\n ll ans = (1<<29);\n rep(i,(int)c.size()){\n rep(j,(int)d.size()){\n\tans = min(ans,compute(c[i].first,c[i].second,d[j].first,d[j].second));\n }\n }\n\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1196,"score_of_the_acc":-0.1424,"final_rank":4},{"submission_id":"aoj_2030_503600","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<cstdlib>\n#include<algorithm>\n#include<cstring>\n#include<map>\n#include<cassert>\n#include<ctime>\n#include<set>\n#define rep(i,n) for(int i=0;i<n;i++)\n#define INF 1<<29\n#define all(n) n.begin(),n.end()\nusing namespace std;\nint a,b;\n \nint main(){\n \n while(true){\n cin >> a >> b;\n if(a+b == 0)break;\n int ans = (1<<27);\n assert(a>=0 && b>=0);\n for(int i=1;i<=a/2+1;i++){\n if(a%i != 0)continue;\n vector<int> vec;\n //cout << \"a = \" << i << \",\" << a/i << \" \";\n vec.push_back(i);vec.push_back((int)(a/i));\n for(int j=1;j<=b/2+1;j++){\n if(b%j != 0)continue;\n //cout << \"b = \" << j << \",\" << b/j << endl;\n vec.push_back(j); vec.push_back(b/j);\n sort(all(vec));\n //for(int k=0;k<4;k++){\n //cout << vec[k] << endl;\n //}\n //cout << \"---\" << endl;\n int sum = 0;\n sum = (vec[1]-vec[0])*(vec[1]-vec[0]) + (vec[2]-vec[1])*(vec[2]-vec[1]) + (vec[3]-vec[2])*(vec[3]-vec[2]);\n //cout << \"sum - \" << sum << endl;\n ans = min(ans,sum);\n vec.clear();\n vec.push_back(i); vec.push_back(a/i);\n }\n }\n \n cout << ans << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":1216,"score_of_the_acc":-0.1781,"final_rank":11},{"submission_id":"aoj_2030_503467","code_snippet":"#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint A,B,ans;\nint data[4];\n\nvoid solve(){\n for(int i = 1; i <= A; i++)\n if(A%i == 0)\n for(int j = 1; j <= B; j++)\n\tif(B%j == 0){\n\t data[0] = i;\n\t data[1] = A/i;\n\t data[2] = j;\n\t data[3] = B/j;\n\t sort(data,data+4);\n\n\n\t int sum = 0;\n\t for(int i = 1; i < 4; i++)\n\t sum += (data[i]-data[i-1])*(data[i]-data[i-1]);\n\t \n\t if(ans == -1) ans = sum; \n\t else ans = min(ans,sum);\n\t \n\t}\n\n cout << ans << endl;\n}\n\nint main(){\n while(cin >> A >> B && A+B){\n ans = -1;\n solve();\n }\n\n return 0;\n}","accuracy":1,"time_ms":220,"memory_kb":1176,"score_of_the_acc":-0.1967,"final_rank":13},{"submission_id":"aoj_2030_503462","code_snippet":"#include<iostream>\n#include<map>\n#include<vector>\n#include<algorithm>\n\nusing namespace std;\n\nmap<int, int> MakePair(int);\nint Calculator(int, int, int, int);\n\nint main(){\n int n, m, min, _min;\n map<int, int> data_n, data_m;\n map<int, int>::iterator i, j;\n\n while(1){\n cin >> n >> m;\n if(n == 0 && m == 0) break;\n\n data_n = MakePair(n);\n data_m = MakePair(m);\n\n for(i=data_n.begin(), min=-1; i!=data_n.end(); ++i){\n for(j=data_m.begin(); j!=data_m.end(); ++j){\n\t_min = Calculator(i->first, i->second, j->first, j->second);\n\tif(min < 0 || min > _min) min = _min;\n }\n }\n cout << min << endl;\n data_n.clear();\n data_m.clear();\n }\n return 0;\n}\n\nmap<int, int> MakePair(int n){\n int i, j;\n map<int, int> data;\n if(n == 1){\n data.insert(make_pair(1, 1));\n }else{\n for(i=1, j=n; i<j; ++i){\n if(n % i == 0){\n\tj = n/i;\n\tdata.insert(make_pair(i, j));\n }\n }\n }\n return data;\n}\n\nint Calculator(int a, int b, int c, int d){\n int x, y, z;\n vector<int> data;\n data.push_back(a);\n data.push_back(b);\n data.push_back(c);\n data.push_back(d);\n sort(data.begin(), data.end());\n x = data[1] - data[0];\n y = data[2] - data[1];\n z = data[3] - data[2];\n return x*x + y*y + z*z;\n}","accuracy":1,"time_ms":10,"memory_kb":1220,"score_of_the_acc":-0.1528,"final_rank":7},{"submission_id":"aoj_2030_503459","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\n#define f first\n#define s second\n\ntypedef pair<int, int> P;\ntypedef pair<int, P> P2;\n\nint main(){\n int a, b;\n while(cin >> a >> b){\n if(a == 0 && b == 0) break;\n P2 tmp;\n vector<P> aa;\n for(int i = 1 ; i <= a ; i++){\n if(a % i == 0){\n\taa.push_back(make_pair(i, a/i));\n }\n }\n vector<P> bb;\n for(int i = 1 ; i <= b ; i++){\n if(b % i == 0){\n\tbb.push_back(make_pair(i, b/i));\n }\n }\n\n int ans = (1<<29);\n int res[4];\n for(int i = 0 ; i < aa.size() ; i++){\n for(int j = 0 ; j < bb.size() ; j++){\n\tres[0] = aa[i].f, res[1] = aa[i].s;\n\tres[2] = bb[j].f, res[3] = bb[j].s;\n\tsort(res, res+4);\n\tint t = 0;\n\tfor(int i = 0 ; i < 3 ; i++){\n\t t += (res[i]-res[i+1]) * (res[i]-res[i+1]);\n\t}\n\tans = min(ans, t);\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1216,"score_of_the_acc":-0.1601,"final_rank":10},{"submission_id":"aoj_2030_503450","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cmath>\n#include<climits>\n\nusing namespace std;\n\nint func(vector<int> num){\n int ans=0;\n for(int i=0;i<num.size()-1;i++)\n ans+=(num[i+1]-num[i])*(num[i+1]-num[i]);\n return ans;\n}\n\n\nint main(void){\n\n int a,b,tmp;\n vector<int>num;\n\n while(cin >> a >> b,a|b){\n int res=INT_MAX;\n for(int i=1;i*i<=a;i++)\n for(int j=1;j*j<=b;j++)\n\tif(a%i==0 && b%j==0){\n\t num.clear();\n\t num.push_back(a/i);\n\t num.push_back(i);\n\t num.push_back(b/j);\n\t num.push_back(j);\n\t sort(num.begin(),num.end());\n\t res=min(res,func(num));\n\t}\n\n cout << res << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1216,"score_of_the_acc":-0.154,"final_rank":9},{"submission_id":"aoj_2030_503377","code_snippet":"#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint A,B,ans;\nint data[4];\n\nvoid solve(){\n for(int i = 1; i <= A; i++)\n if(A%i == 0)\n for(int j = 1; j <= B; j++)\n\tif(B%j == 0){\n\t data[0] = i;\n\t data[1] = A/i;\n\t data[2] = j;\n\t data[3] = B/j;\n\t sort(data,data+4);\n\n\t do{\n\t int sum = 0;\n\t for(int i = 1; i < 4; i++)\n\t sum += (data[i]-data[i-1])*(data[i]-data[i-1]);\n\t \n\t if(ans == -1) ans = sum; \n\t else ans = min(ans,sum);\n\t }while(next_permutation(data,data+4));\n\t}\n\n cout << ans << endl;\n}\n\nint main(){\n while(cin >> A >> B && A+B){\n ans = -1;\n solve();\n }\n\n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":1176,"score_of_the_acc":-0.2058,"final_rank":14},{"submission_id":"aoj_2030_503346","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<cstdlib>\n#include<algorithm>\n#include<cstring>\n#include<map>\n#include<cassert>\n#include<ctime>\n#include<set>\n#define rep(i,n) for(int i=0;i<n;i++)\n#define INF 1<<29\n#define all(n) n.begin(),n.end()\nusing namespace std;\nint a,b;\n\nint main(){\n \n while(true){\n cin >> a >> b;\n if(a+b == 0)break;\n int ans = (1<<27);\n assert(a>=0 && b>=0);\n for(int i=1;i<=a/2+1;i++){\n if(a%i != 0)continue;\n vector<int> vec;\n //cout << \"a = \" << i << \",\" << a/i << \" \";\n vec.push_back(i);vec.push_back((int)(a/i));\n for(int j=1;j<=b/2+1;j++){\n\tif(b%j != 0)continue;\n\t//cout << \"b = \" << j << \",\" << b/j << endl;\n\tvec.push_back(j); vec.push_back(b/j);\n\tsort(all(vec));\n\t//for(int k=0;k<4;k++){\n\t//cout << vec[k] << endl;\n\t//}\n\t//cout << \"---\" << endl;\n\tint sum = 0;\n\tsum = (vec[1]-vec[0])*(vec[1]-vec[0]) + (vec[2]-vec[1])*(vec[2]-vec[1]) + (vec[3]-vec[2])*(vec[3]-vec[2]);\n\t//cout << \"sum - \" << sum << endl;\n\tans = min(ans,sum);\n\tvec.clear();\n\tvec.push_back(i); vec.push_back(a/i);\n }\n }\n\n cout << ans << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":1212,"score_of_the_acc":-0.1793,"final_rank":12},{"submission_id":"aoj_2030_482252","code_snippet":"#include <iostream>\n#include <vector>\n#include <map>\n#include <algorithm>\nusing namespace std;\n\nstruct P{\n\tint a, b;\n\tP(int a_, int b_){ a = a_; b = b_; }\n\tP(){}\n};\n\nconst int INF = 1e+8;\nvector<P> h[10001];\n\nint main(){\n\tfor(int a=1 ; a <= 10000 ; a++ ){\n\t\tfor(int b=1 ; b <= 10000 && a * b <= 10000 ; b++ ){\n\t\t\th[a*b].push_back( P(a,b) );\n\t\t}\n\t}\n\tint x, y;\n\twhile( cin >> x >> y , x || y ){\n\t\tint ans = INF;\n\t\tfor(int i=0 ; i < h[x].size() ; i++ ){\n\t\t\tfor(int j=0 ; j < h[y].size() ; j++ ){\n\t\t\t\tvector<int> v;\n\t\t\t\tv.push_back( h[x][i].a );\n\t\t\t\tv.push_back( h[x][i].b );\n\t\t\t\tv.push_back( h[y][j].a );\n\t\t\t\tv.push_back( h[y][j].b );\n\t\t\t\tsort( v.begin() , v.end() );\n\t\t\t\tint n=0;\n\t\t\t\tfor(int i=1 ; i < v.size() ; i++ ){\n\t\t\t\t\tn += (v[i-1] - v[i]) * (v[i-1] - v[i]);\n\t\t\t\t}\n\t\t\t\tans = min( ans , n );\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}","accuracy":1,"time_ms":30,"memory_kb":2624,"score_of_the_acc":-0.7682,"final_rank":16},{"submission_id":"aoj_2030_349074","code_snippet":"#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nconst int INF = 1000000000;\n\nmain(){\n int a, b;\n while(cin >> a >> b && (a|b)){\n int ans = INF;\n for(int i=1;i<=a;i++){\n if(a%i != 0) continue;\n for(int j=1;j<=b;j++){\n if(b%j != 0) continue;\n int tmp[4] = {i, a/i, j, b/j};\n sort(tmp, tmp+4);\n int sum = 0;\n for(int i=1;i<4;i++){\n sum += (tmp[i] - tmp[i-1]) * (tmp[i] - tmp[i-1]);\n }\n ans = min(ans, sum);\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":210,"memory_kb":868,"score_of_the_acc":-0.0601,"final_rank":3},{"submission_id":"aoj_2030_225660","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n#define REP(i,n) for (int i=0;i<(int)n; ++i)\n\n\ntypedef pair<int,int> pii;\nint main() {\n int a, b;\n while(cin >> a>>b,a||b) {\n vector<pii> v1, v2;\n for (int i=1; i*i<=a; ++i) {\n if (a%i == 0) {\n v1.push_back(pii(i, a/i));\n }\n }\n for (int i=1; i*i<=b; ++i) {\n if (b%i == 0) {\n v2.push_back(pii(i, b/i));\n }\n }\n int res = 1<<29;\n REP(i,v1.size()) {\n REP(j, v2.size()) {\n vector<int> tmp;\n tmp.push_back(v1[i].first);\n tmp.push_back(v1[i].second);\n tmp.push_back(v2[j].first);\n tmp.push_back(v2[j].second);\n sort(tmp.begin(), tmp.end());\n int aa = 0;\n REP(k,3)\n aa += (tmp[k+1]-tmp[k]) * (tmp[k+1]-tmp[k]);\n res = min(res, aa);\n }\n }\n cout << res << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":908,"score_of_the_acc":-0.0204,"final_rank":1},{"submission_id":"aoj_2030_177028","code_snippet":"#include <iostream>\n#include <set>\n#include <algorithm>\nusing namespace std;\n\nint main() {\n int a,b;\n while(cin>>a>>b, a|b) {\n set<int> fa,fb;\n for(int i=1; i*i<=a; ++i)\n if(a%i == 0) fa.insert(i), fa.insert(a/i);\n\n for(int i=1; i*i<=b; ++i)\n if(b%i == 0) fb.insert(i), fb.insert(b/i);\n\n int ans = 1<<29,t;\n int ar[4];\n\n typedef set<int>::iterator sit;\n for(sit i = fa.begin(); i != fa.end(); ++i)\n for(sit j = fa.begin(); j != fa.end(); ++j)\n for(sit k = fb.begin(); k != fb.end(); ++k)\n for(sit l = fb.begin(); l != fb.end(); ++l) {\n if((*i)*(*j) != a || (*k)*(*l) != b) continue;\n ar[0] = *i,ar[1] = *j, ar[2] = *k,ar[3] = *l,t = 0;\n sort(ar, ar+4);\n for(int m=1; m<4; ++m)\n t += (ar[m]-ar[m-1])*(ar[m]-ar[m-1]);\n ans = min(ans, t);\n }\n\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":3340,"memory_kb":912,"score_of_the_acc":-1.0191,"final_rank":20},{"submission_id":"aoj_2030_171201","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nconst int inf = 99999999;\n\nint func(int a[4])\n{\n\tint t=0;\n\t\n\tfor(int i = 0; i < 3; i++){\n\t\tt += ((a[i+1]-a[i])*(a[i+1]-a[i]));\n\t}\n\t\n\treturn t;\n}\n\nint main()\n{\n\tint n, m;\n\t\n\twhile(cin>>n>>m && n && m){\n\t\tvector<int> vn, vm;\n\t\t\n\t\tfor(int i = 1; i <= n; i++){\n\t\t\tif(n%i == 0){\n\t\t\t\tvn.push_back(i);\n\t\t\t}\n\t\t}\n\t\tfor(int i = 1; i <= m; i++){\n\t\t\tif(m%i == 0){\n\t\t\t\tvm.push_back(i);\n\t\t\t}\n\t\t}\n\t\tint s = inf;\n\t\tfor(int i = 0; i < vn.size(); i++){\n\t\t\tfor(int j = 0; j < vm.size(); j++){\n\t\t\t\tint a[4];\n\t\t\t\ta[0] = vn[i];\n\t\t\t\ta[1] = n/vn[i];\n\t\t\t\ta[2] = vm[j];\n\t\t\t\ta[3] = m/vm[j];\n\t\t\t\tsort(a, a+4);\n\t\t\t\ts = min(s, func(a));\n\t\t\t}\n\t\t}\n\t\t\n\t\tcout << s << endl;\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":908,"score_of_the_acc":-0.0264,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_2030_2645406\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\n\\nvector<long long int> divisor(long long int n) {\\n\\tvector<long long int> res;\\n\\tfor (long long int i = 1; i * i <= n; ++i) {\\n\\t\\tif (n % i == 0) {\\n\\t\\t\\tres.push_back(i);\\n\\t\\t\\tif (i * i != n) res.push_back(n / i);\\n\\t\\t}\\n\\t}\\n\\tsort(begin(res), end(res));\\n\\treturn res;\\n}\\nint main() {\\n\\twhile (true) {\\n\\t\\tint a,b;cin>>a>>b;\\n\\t\\tif(!a)break;\\n\\t\\tauto ad(divisor(a));\\n\\t\\tauto bd(divisor(b));\\n\\t\\tlong long int ans=1e18;\\n\\t\\tfor (auto aa : ad) {\\n\\t\\t\\tfor (auto bb : bd) {\\n\\t\\t\\t\\tvector<long long int>nums{ aa,a / aa,bb,b / bb };\\n\\t\\t\\t\\tsort(nums.begin(),nums.end());\\n\\t\\t\\t\\tlong long int nans=0;\\n\\t\\t\\t\\tfor(int i=0;i<3;++i)nans+=(nums[i+1]-nums[i])*(nums[i+1]-nums[i]);\\n\\n\\t\\t\\t\\tans=min(ans,nans);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3116,\n \"score_of_the_acc\": -0.9757,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2030_2196634\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,a,n) for(int i=a;i<n;i++)\\n#define R(i,a,n) for(int i=a;i>n;i--)\\nusing namespace std ;\\nint main(){\\n int a,b;\\n while(cin>>a>>b,a){\\n int aa[5001][2],bb[5001][2],c=0,cc=0;\\n bool ac[10001],bc[10001];\\n r(i,0,10001)ac[i]=0;\\n r(i,0,10001)bc[i]=0;\\n r(i,1,a+1){\\n if(!ac[i]&&a%i==0)R(j,a,0){\\n\\tif(i*j==a){\\n\\t aa[c][0]=i;\\n\\t ac[i]=1;ac[j]=1;\\n\\t aa[c++][1]=j;\\n\\t break;\\n\\t}\\n }\\n }\\n r(i,1,b+1){\\n if(!bc[i]&&b%i==0)R(j,b,0){\\n\\tif(i*j==b){\\n\\t bb[cc][0]=i;\\n\\t bc[i]=1;bc[j]=1;\\n\\t bb[cc++][1]=j;\\n\\t break;\\n\\t}\\n }\\n }//cout<<bb[0][0]<<bb[0][1];\\n long long l[7];\\n long long m=999999999999;\\n r(i,0,c){\\n r(j,0,cc){\\n\\tint t[4];\\n\\tt[0]=aa[i][0];t[1]=aa[i][1];\\n\\tt[2]=bb[j][0];t[3]=bb[j][1];\\n\\tsort(t,t+4);\\n\\tl[0]=t[1]-t[0];\\n\\tl[1]=t[2]-t[1];\\n\\tl[2]=t[3]-t[2];\\n\\tm=min(m,l[0]*l[0]+l[1]*l[1]+l[2]*l[2]);\\n }\\n }\\n //if(m==100000000)m=0;\\n cout<<m<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -1.012,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2030_2196503\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\nint main(){\\n while(1){\\n ll A,B;\\n cin>>A>>B;\\n if(!A&&!B) break;\\n\\n ll sum = 1LL<<55;\\n for(int i=1;i*i<=A;i++){\\n for(int j=1;j*j<=B;j++){\\n\\tif(A%i||B%j) continue;\\n\\tvector<int> v(4);\\n\\tv[0] = i;\\n\\tv[1] = A/i;\\n\\tv[2] = j;\\n\\tv[3] = B/j;\\n\\tsort(v.begin(),v.end());\\n\\tll t = 0;\\n\\tfor(int i=1;i<4;i++)t+=(v[i]-v[i-1])*(v[i]-v[i-1]);\\n\\tsum = min(sum,t);\\n }\\n }\\n cout<<sum<<endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3044,\n \"score_of_the_acc\": -0.9505,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2030_1781113\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<cstdio>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\nconst double PI=acos(-1);\\nconst double EPS=1e-10;\\nconst int inf=1e9;\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int,int> pii;\\nint main(){\\n\\tint n,m;\\n\\twhile(cin>>n>>m,n+m){\\n\\t\\tvi a,b;\\n\\t\\tfor(int i=1;i*i<=n;i++)if(n%i==0)a.pb(i);\\n\\t\\tfor(int i=1;i*i<=m;i++)if(m%i==0)b.pb(i);\\n\\t\\tint mi=inf;\\n\\t\\trep(i,a.size())rep(j,b.size()){\\n\\t\\t\\tvi t;\\n\\t\\t\\tt.pb(a[i]);t.pb(n/a[i]);t.pb(b[j]);t.pb(m/b[j]);\\n\\t\\t\\tsort(all(t));\\n\\t\\t\\tint c=t[1]-t[0];\\n\\t\\t\\tint d=t[2]-t[1];\\n\\t\\t\\tint e=t[3]-t[2];\\n\\t\\t\\tmi=min(mi,c*c+d*d+e*e);\\n\\t\\t}\\n\\t\\tcout<<mi<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1220,\n \"score_of_the_acc\": -0.1528,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2030_1030299\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\nusing namespace std;\\ntypedef pair<int,int>P;\\n#define X first\\n#define Y second\\n#define pb push_back\\nvector<P>V[10001];\\n\\nvoid V_set(){\\n\\tfor(int i=1;i<=10000;i++){\\n\\t\\tfor(int j=1;j*j<=i;j++){\\n\\t\\t\\tif(i%j==0){\\n\\t\\t\\t\\tV[i].pb(P(j,i/j));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint cal(P a,P b){\\n\\tint d[4]={a.X,a.Y,b.X,b.Y};\\n\\tsort(d,d+4);\\n\\tint t=0;\\n\\tfor(int i=0;i<3;i++){\\n\\t\\tt+=(d[i+1]-d[i])*(d[i+1]-d[i]);\\n\\t}\\n\\treturn t;\\n}\\n\\nint main(){\\n\\t\\n\\tV_set();\\n\\t\\n\\tint a,b;\\n\\twhile(cin>>a>>b,a){\\n\\t\\tint ans=999999999;\\n\\t\\tfor(int i=0;i<V[a].size();i++){\\n\\t\\t\\tfor(int j=0;j<V[b].size();j++){\\n\\t\\t\\t\\tans=min(ans,cal(V[a][i],V[b][j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n\\t\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 2052,\n \"score_of_the_acc\": -0.5139,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2030_941092\",\n \"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 << endl; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) \\n{ EACH(it, P) { s << \\\"<\\\" << it->first << \\\"->\\\" << it->second << \\\"> \\\"; } return s << endl; }\\n\\n\\n\\nvector<pair<long long, long long> > divisor(long long n) {\\n vector<pair<long long, long long> > res;\\n for (long long i = 1LL; i*i <= n; ++i) {\\n if (n%i == 0LL) {\\n long long temp = n/i;\\n res.push_back(make_pair(i, temp));\\n //if (i != temp) res.push_back(make_pair(temp, i));\\n }\\n }\\n return res;\\n}\\n\\nlong long sq(long long a) { return a*a; }\\n\\nint a, b;\\n\\nint main() {\\n while (cin >> a >> b) {\\n if (a == 0 && b == 0) break;\\n \\n long long res = 1LL<<60;\\n vector<pll> va = divisor(a), vb = divisor(b);\\n for (int i = 0; i < va.size(); ++i) {\\n for (int j = 0; j < vb.size(); ++j) {\\n vll vec(4);\\n vec[0] = va[i].first, vec[1] = va[i].second, vec[2] = vb[j].first, vec[3] = vb[j].second;\\n sort(ALL(vec));\\n \\n ll tmp = sq(vec[1] - vec[0]) + sq(vec[2] - vec[1]) + sq(vec[3] - vec[2]);\\n chmin(res, tmp);\\n }\\n }\\n \\n cout << res << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1212,\n \"score_of_the_acc\": -0.1493,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2030_850022\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\n#include <algorithm>\\nusing namespace std;\\ntypedef pair<int,int> P;\\n#define p(a,b) (b-a)*(b-a)\\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\\n\\nint compute(int a,int b,int c,int d){\\n int e[4] = {a,b,c,d};\\n int res = (1<<29);\\n\\n rep(i,4){\\n rep(j,4){\\n if(i == j) continue;\\n rep(k,4){\\n\\tif(i == k || j == k) continue;\\n\\trep(l,4){\\n\\t if(i == l || j == l || k == l) continue;\\n\\t res = min(res,p(e[j],e[i])+p(e[k],e[j])+p(e[l],e[k]));\\n\\t}\\n }\\n }\\n }\\n \\n return res;\\n}\\n\\nint main(){\\n int a,b;\\n\\n while(cin >> a >> b , a | b){\\n vector<P> c,d;\\n for(int i = 1 ; i*i <= a ; i++){\\n if(a % i == 0){\\n\\tc.push_back(P(i,a/i));\\n } \\n }\\n\\n for(int i = 1 ; i*i <= b ; i++){\\n if(b % i == 0){\\n\\td.push_back(P(i,b/i));\\n }\\n }\\n\\n int ans = (1<<29);\\n rep(i,(int)c.size()){\\n rep(j,(int)d.size()){\\n\\tans = min(ans,compute(c[i].first,c[i].second,d[j].first,d[j].second));\\n }\\n }\\n\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1204,\n \"score_of_the_acc\": -0.1458,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2030_850021\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\n#include <algorithm>\\nusing namespace std;\\ntypedef pair<int,int> P;\\ntypedef long long ll;\\n#define p(a,b) (b-a)*(b-a)\\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\\n\\nll compute(int a,int b,int c,int d){\\n int e[4] = {a,b,c,d};\\n int res = (1<<29);\\n\\n rep(i,4){\\n rep(j,4){\\n if(i == j) continue;\\n rep(k,4){\\n\\tif(i == k || j == k) continue;\\n\\trep(l,4){\\n\\t if(i == l || j == l || k == l) continue;\\n\\t res = min(res,p(e[j],e[i])+p(e[k],e[j])+p(e[l],e[k]));\\n\\t}\\n }\\n }\\n }\\n \\n return res;\\n}\\n\\nint main(){\\n int a,b;\\n\\n while(cin >> a >> b , a | b){\\n vector<P> c,d;\\n for(int i = 1 ; i*i <= a ; i++){\\n if(a % i == 0){\\n\\tc.push_back(P(i,a/i));\\n } \\n }\\n\\n for(int i = 1 ; i*i <= b ; i++){\\n if(b % i == 0){\\n\\td.push_back(P(i,b/i));\\n }\\n }\\n\\n ll ans = (1<<29);\\n rep(i,(int)c.size()){\\n rep(j,(int)d.size()){\\n\\tans = min(ans,compute(c[i].first,c[i].second,d[j].first,d[j].second));\\n }\\n }\\n\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1196,\n \"score_of_the_acc\": -0.1424,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2030_503600\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<cstdlib>\\n#include<algorithm>\\n#include<cstring>\\n#include<map>\\n#include<cassert>\\n#include<ctime>\\n#include<set>\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define INF 1<<29\\n#define all(n) n.begin(),n.end()\\nusing namespace std;\\nint a,b;\\n \\nint main(){\\n \\n while(true){\\n cin >> a >> b;\\n if(a+b == 0)break;\\n int ans = (1<<27);\\n assert(a>=0 && b>=0);\\n for(int i=1;i<=a/2+1;i++){\\n if(a%i != 0)continue;\\n vector<int> vec;\\n //cout << \\\"a = \\\" << i << \\\",\\\" << a/i << \\\" \\\";\\n vec.push_back(i);vec.push_back((int)(a/i));\\n for(int j=1;j<=b/2+1;j++){\\n if(b%j != 0)continue;\\n //cout << \\\"b = \\\" << j << \\\",\\\" << b/j << endl;\\n vec.push_back(j); vec.push_back(b/j);\\n sort(all(vec));\\n //for(int k=0;k<4;k++){\\n //cout << vec[k] << endl;\\n //}\\n //cout << \\\"---\\\" << endl;\\n int sum = 0;\\n sum = (vec[1]-vec[0])*(vec[1]-vec[0]) + (vec[2]-vec[1])*(vec[2]-vec[1]) + (vec[3]-vec[2])*(vec[3]-vec[2]);\\n //cout << \\\"sum - \\\" << sum << endl;\\n ans = min(ans,sum);\\n vec.clear();\\n vec.push_back(i); vec.push_back(a/i);\\n }\\n }\\n \\n cout << ans << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 1216,\n \"score_of_the_acc\": -0.1781,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2030_503467\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\nint A,B,ans;\\nint data[4];\\n\\nvoid solve(){\\n for(int i = 1; i <= A; i++)\\n if(A%i == 0)\\n for(int j = 1; j <= B; j++)\\n\\tif(B%j == 0){\\n\\t data[0] = i;\\n\\t data[1] = A/i;\\n\\t data[2] = j;\\n\\t data[3] = B/j;\\n\\t sort(data,data+4);\\n\\n\\n\\t int sum = 0;\\n\\t for(int i = 1; i < 4; i++)\\n\\t sum += (data[i]-data[i-1])*(data[i]-data[i-1]);\\n\\t \\n\\t if(ans == -1) ans = sum; \\n\\t else ans = min(ans,sum);\\n\\t \\n\\t}\\n\\n cout << ans << endl;\\n}\\n\\nint main(){\\n while(cin >> A >> B && A+B){\\n ans = -1;\\n solve();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 1176,\n \"score_of_the_acc\": -0.1967,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2030_503462\",\n \"code_snippet\": \"#include<iostream>\\n#include<map>\\n#include<vector>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\nmap<int, int> MakePair(int);\\nint Calculator(int, int, int, int);\\n\\nint main(){\\n int n, m, min, _min;\\n map<int, int> data_n, data_m;\\n map<int, int>::iterator i, j;\\n\\n while(1){\\n cin >> n >> m;\\n if(n == 0 && m == 0) break;\\n\\n data_n = MakePair(n);\\n data_m = MakePair(m);\\n\\n for(i=data_n.begin(), min=-1; i!=data_n.end(); ++i){\\n for(j=data_m.begin(); j!=data_m.end(); ++j){\\n\\t_min = Calculator(i->first, i->second, j->first, j->second);\\n\\tif(min < 0 || min > _min) min = _min;\\n }\\n }\\n cout << min << endl;\\n data_n.clear();\\n data_m.clear();\\n }\\n return 0;\\n}\\n\\nmap<int, int> MakePair(int n){\\n int i, j;\\n map<int, int> data;\\n if(n == 1){\\n data.insert(make_pair(1, 1));\\n }else{\\n for(i=1, j=n; i<j; ++i){\\n if(n % i == 0){\\n\\tj = n/i;\\n\\tdata.insert(make_pair(i, j));\\n }\\n }\\n }\\n return data;\\n}\\n\\nint Calculator(int a, int b, int c, int d){\\n int x, y, z;\\n vector<int> data;\\n data.push_back(a);\\n data.push_back(b);\\n data.push_back(c);\\n data.push_back(d);\\n sort(data.begin(), data.end());\\n x = data[1] - data[0];\\n y = data[2] - data[1];\\n z = data[3] - data[2];\\n return x*x + y*y + z*z;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1220,\n \"score_of_the_acc\": -0.1528,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2030_503459\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n\\nusing namespace std;\\n\\n#define f first\\n#define s second\\n\\ntypedef pair<int, int> P;\\ntypedef pair<int, P> P2;\\n\\nint main(){\\n int a, b;\\n while(cin >> a >> b){\\n if(a == 0 && b == 0) break;\\n P2 tmp;\\n vector<P> aa;\\n for(int i = 1 ; i <= a ; i++){\\n if(a % i == 0){\\n\\taa.push_back(make_pair(i, a/i));\\n }\\n }\\n vector<P> bb;\\n for(int i = 1 ; i <= b ; i++){\\n if(b % i == 0){\\n\\tbb.push_back(make_pair(i, b/i));\\n }\\n }\\n\\n int ans = (1<<29);\\n int res[4];\\n for(int i = 0 ; i < aa.size() ; i++){\\n for(int j = 0 ; j < bb.size() ; j++){\\n\\tres[0] = aa[i].f, res[1] = aa[i].s;\\n\\tres[2] = bb[j].f, res[3] = bb[j].s;\\n\\tsort(res, res+4);\\n\\tint t = 0;\\n\\tfor(int i = 0 ; i < 3 ; i++){\\n\\t t += (res[i]-res[i+1]) * (res[i]-res[i+1]);\\n\\t}\\n\\tans = min(ans, t);\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1216,\n \"score_of_the_acc\": -0.1601,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2030_503450\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<cmath>\\n#include<climits>\\n\\nusing namespace std;\\n\\nint func(vector<int> num){\\n int ans=0;\\n for(int i=0;i<num.size()-1;i++)\\n ans+=(num[i+1]-num[i])*(num[i+1]-num[i]);\\n return ans;\\n}\\n\\n\\nint main(void){\\n\\n int a,b,tmp;\\n vector<int>num;\\n\\n while(cin >> a >> b,a|b){\\n int res=INT_MAX;\\n for(int i=1;i*i<=a;i++)\\n for(int j=1;j*j<=b;j++)\\n\\tif(a%i==0 && b%j==0){\\n\\t num.clear();\\n\\t num.push_back(a/i);\\n\\t num.push_back(i);\\n\\t num.push_back(b/j);\\n\\t num.push_back(j);\\n\\t sort(num.begin(),num.end());\\n\\t res=min(res,func(num));\\n\\t}\\n\\n cout << res << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1216,\n \"score_of_the_acc\": -0.154,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2030_503377\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\nint A,B,ans;\\nint data[4];\\n\\nvoid solve(){\\n for(int i = 1; i <= A; i++)\\n if(A%i == 0)\\n for(int j = 1; j <= B; j++)\\n\\tif(B%j == 0){\\n\\t data[0] = i;\\n\\t data[1] = A/i;\\n\\t data[2] = j;\\n\\t data[3] = B/j;\\n\\t sort(data,data+4);\\n\\n\\t do{\\n\\t int sum = 0;\\n\\t for(int i = 1; i < 4; i++)\\n\\t sum += (data[i]-data[i-1])*(data[i]-data[i-1]);\\n\\t \\n\\t if(ans == -1) ans = sum; \\n\\t else ans = min(ans,sum);\\n\\t }while(next_permutation(data,data+4));\\n\\t}\\n\\n cout << ans << endl;\\n}\\n\\nint main(){\\n while(cin >> A >> B && A+B){\\n ans = -1;\\n solve();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 1176,\n \"score_of_the_acc\": -0.2058,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2030_503346\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<cstdlib>\\n#include<algorithm>\\n#include<cstring>\\n#include<map>\\n#include<cassert>\\n#include<ctime>\\n#include<set>\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define INF 1<<29\\n#define all(n) n.begin(),n.end()\\nusing namespace std;\\nint a,b;\\n\\nint main(){\\n \\n while(true){\\n cin >> a >> b;\\n if(a+b == 0)break;\\n int ans = (1<<27);\\n assert(a>=0 && b>=0);\\n for(int i=1;i<=a/2+1;i++){\\n if(a%i != 0)continue;\\n vector<int> vec;\\n //cout << \\\"a = \\\" << i << \\\",\\\" << a/i << \\\" \\\";\\n vec.push_back(i);vec.push_back((int)(a/i));\\n for(int j=1;j<=b/2+1;j++){\\n\\tif(b%j != 0)continue;\\n\\t//cout << \\\"b = \\\" << j << \\\",\\\" << b/j << endl;\\n\\tvec.push_back(j); vec.push_back(b/j);\\n\\tsort(all(vec));\\n\\t//for(int k=0;k<4;k++){\\n\\t//cout << vec[k] << endl;\\n\\t//}\\n\\t//cout << \\\"---\\\" << endl;\\n\\tint sum = 0;\\n\\tsum = (vec[1]-vec[0])*(vec[1]-vec[0]) + (vec[2]-vec[1])*(vec[2]-vec[1]) + (vec[3]-vec[2])*(vec[3]-vec[2]);\\n\\t//cout << \\\"sum - \\\" << sum << endl;\\n\\tans = min(ans,sum);\\n\\tvec.clear();\\n\\tvec.push_back(i); vec.push_back(a/i);\\n }\\n }\\n\\n cout << ans << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 1212,\n \"score_of_the_acc\": -0.1793,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2030_482252\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <map>\\n#include <algorithm>\\nusing namespace std;\\n\\nstruct P{\\n\\tint a, b;\\n\\tP(int a_, int b_){ a = a_; b = b_; }\\n\\tP(){}\\n};\\n\\nconst int INF = 1e+8;\\nvector<P> h[10001];\\n\\nint main(){\\n\\tfor(int a=1 ; a <= 10000 ; a++ ){\\n\\t\\tfor(int b=1 ; b <= 10000 && a * b <= 10000 ; b++ ){\\n\\t\\t\\th[a*b].push_back( P(a,b) );\\n\\t\\t}\\n\\t}\\n\\tint x, y;\\n\\twhile( cin >> x >> y , x || y ){\\n\\t\\tint ans = INF;\\n\\t\\tfor(int i=0 ; i < h[x].size() ; i++ ){\\n\\t\\t\\tfor(int j=0 ; j < h[y].size() ; j++ ){\\n\\t\\t\\t\\tvector<int> v;\\n\\t\\t\\t\\tv.push_back( h[x][i].a );\\n\\t\\t\\t\\tv.push_back( h[x][i].b );\\n\\t\\t\\t\\tv.push_back( h[y][j].a );\\n\\t\\t\\t\\tv.push_back( h[y][j].b );\\n\\t\\t\\t\\tsort( v.begin() , v.end() );\\n\\t\\t\\t\\tint n=0;\\n\\t\\t\\t\\tfor(int i=1 ; i < v.size() ; i++ ){\\n\\t\\t\\t\\t\\tn += (v[i-1] - v[i]) * (v[i-1] - v[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tans = min( ans , n );\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 2624,\n \"score_of_the_acc\": -0.7682,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2030_349074\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\nconst int INF = 1000000000;\\n\\nmain(){\\n int a, b;\\n while(cin >> a >> b && (a|b)){\\n int ans = INF;\\n for(int i=1;i<=a;i++){\\n if(a%i != 0) continue;\\n for(int j=1;j<=b;j++){\\n if(b%j != 0) continue;\\n int tmp[4] = {i, a/i, j, b/j};\\n sort(tmp, tmp+4);\\n int sum = 0;\\n for(int i=1;i<4;i++){\\n sum += (tmp[i] - tmp[i-1]) * (tmp[i] - tmp[i-1]);\\n }\\n ans = min(ans, sum);\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 868,\n \"score_of_the_acc\": -0.0601,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2030_225660\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n#define REP(i,n) for (int i=0;i<(int)n; ++i)\\n\\n\\ntypedef pair<int,int> pii;\\nint main() {\\n int a, b;\\n while(cin >> a>>b,a||b) {\\n vector<pii> v1, v2;\\n for (int i=1; i*i<=a; ++i) {\\n if (a%i == 0) {\\n v1.push_back(pii(i, a/i));\\n }\\n }\\n for (int i=1; i*i<=b; ++i) {\\n if (b%i == 0) {\\n v2.push_back(pii(i, b/i));\\n }\\n }\\n int res = 1<<29;\\n REP(i,v1.size()) {\\n REP(j, v2.size()) {\\n vector<int> tmp;\\n tmp.push_back(v1[i].first);\\n tmp.push_back(v1[i].second);\\n tmp.push_back(v2[j].first);\\n tmp.push_back(v2[j].second);\\n sort(tmp.begin(), tmp.end());\\n int aa = 0;\\n REP(k,3)\\n aa += (tmp[k+1]-tmp[k]) * (tmp[k+1]-tmp[k]);\\n res = min(res, aa);\\n }\\n }\\n cout << res << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 908,\n \"score_of_the_acc\": -0.0204,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2030_177028\",\n \"code_snippet\": \"#include <iostream>\\n#include <set>\\n#include <algorithm>\\nusing namespace std;\\n\\nint main() {\\n int a,b;\\n while(cin>>a>>b, a|b) {\\n set<int> fa,fb;\\n for(int i=1; i*i<=a; ++i)\\n if(a%i == 0) fa.insert(i), fa.insert(a/i);\\n\\n for(int i=1; i*i<=b; ++i)\\n if(b%i == 0) fb.insert(i), fb.insert(b/i);\\n\\n int ans = 1<<29,t;\\n int ar[4];\\n\\n typedef set<int>::iterator sit;\\n for(sit i = fa.begin(); i != fa.end(); ++i)\\n for(sit j = fa.begin(); j != fa.end(); ++j)\\n for(sit k = fb.begin(); k != fb.end(); ++k)\\n for(sit l = fb.begin(); l != fb.end(); ++l) {\\n if((*i)*(*j) != a || (*k)*(*l) != b) continue;\\n ar[0] = *i,ar[1] = *j, ar[2] = *k,ar[3] = *l,t = 0;\\n sort(ar, ar+4);\\n for(int m=1; m<4; ++m)\\n t += (ar[m]-ar[m-1])*(ar[m]-ar[m-1]);\\n ans = min(ans, t);\\n }\\n\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3340,\n \"memory_kb\": 912,\n \"score_of_the_acc\": -1.0191,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2030_171201\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\nconst int inf = 99999999;\\n\\nint func(int a[4])\\n{\\n\\tint t=0;\\n\\t\\n\\tfor(int i = 0; i < 3; i++){\\n\\t\\tt += ((a[i+1]-a[i])*(a[i+1]-a[i]));\\n\\t}\\n\\t\\n\\treturn t;\\n}\\n\\nint main()\\n{\\n\\tint n, m;\\n\\t\\n\\twhile(cin>>n>>m && n && m){\\n\\t\\tvector<int> vn, vm;\\n\\t\\t\\n\\t\\tfor(int i = 1; i <= n; i++){\\n\\t\\t\\tif(n%i == 0){\\n\\t\\t\\t\\tvn.push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i = 1; i <= m; i++){\\n\\t\\t\\tif(m%i == 0){\\n\\t\\t\\t\\tvm.push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint s = inf;\\n\\t\\tfor(int i = 0; i < vn.size(); i++){\\n\\t\\t\\tfor(int j = 0; j < vm.size(); j++){\\n\\t\\t\\t\\tint a[4];\\n\\t\\t\\t\\ta[0] = vn[i];\\n\\t\\t\\t\\ta[1] = n/vn[i];\\n\\t\\t\\t\\ta[2] = vm[j];\\n\\t\\t\\t\\ta[3] = m/vm[j];\\n\\t\\t\\t\\tsort(a, a+4);\\n\\t\\t\\t\\ts = min(s, func(a));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tcout << s << endl;\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 908,\n \"score_of_the_acc\": -0.0264,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":1068,"cells":{"group_id":{"kind":"string","value":"aoj_2034_cpp"},"problem_description":{"kind":"string","value":"Problem E:\nAutocorrelation Function\nNathan O. Davis is taking a class of signal processing as a student in engineering. Today’s topic of the\nclass was autocorrelation. It is a mathematical tool for analysis of signals represented by functions or\nseries of values. Autocorrelation gives correlation of a signal with itself. For a continuous real function\nf\n(\nx\n), the autocorrelation function\nR\nf\n(\nr\n) is given by\nwhere\nr\nis a real number.\nThe professor teaching in the class presented an assignment today. This assignment requires students\nto make plots of the autocorrelation functions for given functions. Each function is piecewise linear and\ncontinuous for all real numbers. The figure below depicts one of those functions.\nFigure 1: An Example of Given Functions\nThe professor suggested use of computer programs, but unfortunately Nathan hates programming. So he\ncalls you for help, as he knows you are a great programmer. You are requested to write a program that\ncomputes the value of the autocorrelation function where a function\nf\n(\nx\n) and a parameter\nr\nare given as\nthe input. Since he is good at utilization of existing software, he could finish his assignment with your\nprogram.\nInput\nThe input consists of a series of data sets.\nThe first line of each data set contains an integer\nn\n(3 ≤\nn\n≤ 100) and a real number\nr\n(-100 ≤\nr\n≤ 100),\nwhere n denotes the number of endpoints forming sub-intervals in the function\nf\n(\nx\n), and\nr\ngives the\nparameter of the autocorrelation function\nR\nf\n(\nr\n). The\ni\n-th of the following\nn\nlines contains two integers\nx\ni\n(-100 ≤\nx\ni\n≤ 100) and\ny\ni\n(-50 ≤\ny\ni\n≤ 50), where (\nx\ni\n,\ny\ni\n) is the coordinates of the\ni\n-th endpoint.\nThe endpoints are given in increasing order of their\nx\n-coordinates, and no couple of endpoints shares the\nsame\nx\n-coordinate value. The\ny\n-coordinates of the first and last endpoints are always zero.\nThe end of input is indicated by\nn\n=\nr\n= 0. This is not part of data sets, and hence should not be\nprocessed.\nOutput\nFor each data set, your program should print the value of the autocorrelation function in a line. Each\nvalue may be printed with an arbitrary number of digits after the decimal point, but should not contain\nan error greater than 10\n-4\n.\nSample Input\n3 1\n0 0\n1 1\n2 0\n11 1.5\n0 0\n2 7\n5 3\n7 8\n10 -5\n13 4\n15 -1\n17 3\n20 -7\n23 9\n24 0\n0 0\nOutput for the Sample Input\n0.166666666666667\n165.213541666667"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2034_10794058","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n cout.setf(ios::fixed);\n cout << setprecision(15);\n\n int n;\n long double r;\n while ( (cin >> n >> r) ) {\n if (n == 0 && fabsl(r) == 0.0L) break;\n\n vector<long double> x(n), y(n);\n for (int i = 0; i < n; ++i) {\n long double xi, yi;\n cin >> xi >> yi;\n x[i] = xi; y[i] = yi;\n }\n\n // Предполагается: f(x)=0 вне [x0, x_{n-1}] (y на концах равно 0).\n // Рассматриваем только область перекрытия x и x+r.\n const long double EPS = 1e-12L;\n\n long double L = max(x.front(), x.front() - r);\n long double R = min(x.back(), x.back() - r);\n\n if (L >= R - EPS) {\n cout << 0.0 << \"\\n\";\n continue;\n }\n\n // Считаем наклоны и свободные члены на каждом сегменте: f(x)=m[i]*x + c[i] на [x[i], x[i+1]]\n int segs = n - 1;\n vector<long double> m(segs), c(segs);\n for (int i = 0; i < segs; ++i) {\n m[i] = (y[i+1] - y[i]) / (x[i+1] - x[i]);\n c[i] = y[i] - m[i] * x[i];\n }\n\n // Функции для поиска сегмента, которому принадлежит точка t (x[i] <= t <= x[i+1]).\n auto find_segment = [&](long double t) -> int {\n // upper_bound даст первый x[k] > t, отнимаем 1\n int idx = int(upper_bound(x.begin(), x.end(), t) - x.begin()) - 1;\n if (idx < 0) idx = 0;\n if (idx >= segs) idx = segs - 1; // на правой границе попадём сюда, но дальше мы ограничиваемся R\n return idx;\n };\n\n int i = find_segment(L); // сегмент f(x) при x=L\n int j = find_segment(L + r); // сегмент f(x+r) при x=L\n\n long double cur = L;\n long double ans = 0.0L;\n\n while (cur < R - EPS) {\n // следующий излом для x или для (x+r)\n long double next_i = x[i+1]; // граница для f(x)\n long double next_j = x[j+1] - r; // граница для f(x+r)\n long double nxt = min({next_i, next_j, R});\n\n long double a = cur, b = nxt;\n if (b > a + EPS) {\n // На [a,b] имеем f(x)=m[i]*x + c[i], f(x+r)=m[j]*(x+r)+c[j] = m[j]*x + (m[j]*r + c[j]).\n long double A = m[i] * m[j];\n long double B = m[i] * (m[j]*r + c[j]) + c[i] * m[j];\n long double C = c[i] * (m[j]*r + c[j]);\n // Интеграл A x^2 + B x + C\n long double I = A * ( (b*b*b - a*a*a) / 3.0L )\n + B * ( (b*b - a*a ) / 2.0L )\n + C * ( b - a );\n ans += I;\n }\n\n cur = b;\n\n // Перейти на следующий сегмент(ы) при необходимости\n if (fabsl(cur - next_i) <= EPS && i+1 < segs) ++i;\n if (fabsl(cur - next_j) <= EPS && j+1 < segs) ++j;\n // защита от возможных застреваний из-за численных ошибок\n if (nxt == cur) {\n // подвинем на микро-шаг\n cur += 1e-13L;\n }\n }\n\n cout << ans << \"\\n\";\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3604,"score_of_the_acc":-1,"final_rank":13},{"submission_id":"aoj_2034_1684647","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\ntemplate<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}\ntemplate<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}\n\nusing namespace std;\nusing R=long double;\nconst R eps=1e-11; // [-1000:1000]->EPS=1e-8 [-10000:10000]->EPS=1e-7\nconst R pi=acos(-1);\nconst R inf=1e40;\ninline int sgn(const R& r){ return (r > eps) - (r < -eps);}\ninline int sgn(const R& a, const R &b){ return sgn(a-b); }\ninline R sq(R x){return sqrt(max<R>(x,0.0));}\n\nint n;\nR vx[110],vy[110],r;\n\nR val(R x){\n\tR ret=0.0;\n\trep(i,n-1){\n\t\tif(vx[i]<=x&&x<vx[i+1]){\n\t\t\tR rate=(x-vx[i])/(vx[i+1]-vx[i]);\n\t\t\tret=vy[i]+rate*(vy[i+1]-vy[i]);\n\t\t\treturn ret;\n\t\t}\n\t}\n\treturn ret;\n}\n\nR func(R x){ return 1.0*val(x)*val(x+r); }\n\nint main(void){\n\twhile(cin >> n >> r,n){\t\n\t\tvector<R> ary;\n\t\trep(i,n) cin >> vx[i] >> vy[i];\n\t\trep(i,n) ary.push_back(vx[i]),ary.push_back(vx[i]+r),ary.push_back(vx[i]-r);\n\t\t\n\t\tuniq(ary);\n\t\tint m=ary.size();\n\n\t\tR ans=0.0;\n\t\trep(i,m-1){\n\t\t\tR a=ary[i],b=ary[i+1],c=(a+b)/2.0;\n\t\t\tR fa=func(a),fb=func(b),fc=func(c);\n\t\t\tR cur=(fa+4.0*fc+fb)*(b-a)/6.0;\n\t\t\tans+=cur;\n\t\t}\n\t\tcout.precision(20);\n\t\tcout << fixed << ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3160,"score_of_the_acc":-0.8762,"final_rank":12},{"submission_id":"aoj_2034_1552144","code_snippet":"//\n// Numerical Integration (Adaptive Gauss--Lobatto--Kronrod)\n//\n// Description:\n// Gauss--Lobatto formula is a numerical integrator\n// that is accurate for polynomials of degree <= 2n+1.\n// Adaptive Gauss--Lobatto recursively divides the domain\n// and computes integral by using G-L formula.\n//\n// Algorithm:\n// Above.\n//\n// Complexity:\n// O(#pieces) for a piecewise polynomials.\n// In general, it converges in O(1/n^6) for smooth functions.\n//\n// Verified: \n// AOJ 2034\n//\n// References:\n// R. T. Trimbitas, M. G. Trimbitas (2008):\n// Gauss-Lobatto-Kronrod formulae and adaptive numerical integration.\n// in Proceedings of the 10th International Symposium on \n// Symbolic and Numeric Algorithms for Scientific Computing. pp. 183--186.\n//\n#include <iostream>\n#include <vector>\n#include <limits>\n#include <cstdio>\n#include <algorithm>\n#include <functional>\n\nusing namespace std;\n\n#define fst first\n#define snd second\n#define all(c) ((c).begin()), ((c).end())\n\n// adaptive gauss-lobatto\ntemplate <class F>\ndouble integrate(F f, double lo, double hi, double eps = 1e-8) {\n const double th = eps / 1e-14; // (= eps / machine_epsilon)\n function<double (double,double,double,double,int)> rec =\n [&](double x0, double x6, double y0, double y6, int d) {\n const double a = sqrt(2.0/3.0), b = 1.0 / sqrt(5.0);\n double x3 = (x0 + x6)/2, y3 = f(x3), h = (x6 - x0)/2;\n double x1 = x3-a*h, x2 = x3-b*h, x4 = x3+b*h, x5 = x3+a*h;\n double y1 = f(x1), y2 = f(x2), y4 = f(x4), y5 = f(x5);\n double I1 = (y0+y6 + 5*(y2+y4)) * (h/6);\n double I2 = (77*(y0+y6) + 432*(y1+y5) + 625*(y2+y4) + 672*y3) * (h/1470);\n if (x3 + h == x3 || d > 50) return 0.0; \n if (d > 4 && th + (I1-I2) == th) return I2;\n return (double)(rec(x0, x1, y0, y1, d+1) + rec(x1, x2, y1, y2, d+1) \n + rec(x2, x3, y2, y3, d+1) + rec(x3, x4, y3, y4, d+1) \n + rec(x4, x5, y4, y5, d+1) + rec(x5, x6, y5, y6, d+1));\n };\n return rec(lo, hi, f(lo), f(hi), 0);\n}\n\nint main() {\n for (int n; scanf(\"%d\", &n); ) {\n if (n == 0) break;\n double r; \n scanf(\"%lf\\n\", &r);\n\n vector<pair<double,double>> p(n);\n for (int i = 0; i < n; ++i) \n scanf(\"%lf %lf\", &p[i].fst, &p[i].snd);\n function<double (double)> f = [&](double x) {\n if (x < p[0].fst) return 0.0;\n if (x >= p.back().fst) return 0.0;\n for (int i = 0; i+1 < n; ++i) \n if (x < p[i+1].fst) \n return p[i].snd + (p[i+1].snd-p[i].snd)/(p[i+1].fst-p[i].fst)*(x-p[i].fst);\n };\n function<double (double)> g = [&](double x) {\n return f(x) * f(x + r);\n };\n printf(\"%.12f\\n\", integrate(g, p[0].fst-100, p.back().fst+100));\n }\n}","accuracy":1,"time_ms":1690,"memory_kb":1244,"score_of_the_acc":-1.1523,"final_rank":14},{"submission_id":"aoj_2034_1355664","code_snippet":"#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100;\nconst double DELTA = 1e-10;\n\n/* typedef */\n\nstruct tri {\n double x, y0, y1;\n tri() {}\n tri(double _x, double _y0, double _y1) { x = _x, y0 = _y0, y1 = _y1; }\n bool operator<(const tri& t0) const { return x < t0.x; }\n};\n\n/* global variables */\n\nint n, cn;\ndouble r, minx, maxx;\ndouble xs[MAX_N], ys[MAX_N];\ntri cxys[MAX_N * 2];\n\n/* subroutines */\n\n// (x0,y0)-(x1-y1)\n// dx=x1-x0,dy=y1-y0\n// y = dy/dx * (x-x0) + y0 = dy/dx * x + (dx*y0-dy*x0)/dx\n\ninline void line_eq(double x0, double y0, double x1, double y1,\n\t\t double& a, double& b) {\n double dx = x1 - x0;\n double dy = y1 - y0;\n a = dy / dx;\n b = (dx * y0 - dy * x0) / dx;\n}\n\ndouble f(double x) {\n if (x <= minx || x >= maxx) return 0.0;\n int k = upper_bound(xs, xs + n, x) - xs - 1;\n double a, b;\n line_eq(xs[k], ys[k], xs[k + 1], ys[k + 1], a, b);\n return a * x + b;\n}\n\n/* main */\n\nint main() {\n for (;;) {\n cin >> n >> r;\n if (n == 0) break;\n\n for (int i = 0; i < n; i++)\n cin >> xs[i] >> ys[i];\n minx = xs[0];\n maxx = xs[n - 1];\n\n cn = 0;\n for (int i = 0; i < n; i++) {\n if (xs[i] + r <= maxx)\n\tcxys[cn++] = tri(xs[i], ys[i], f(xs[i] + r));\n if (xs[i] - r >= minx)\n\tcxys[cn++] = tri(xs[i] - r, f(xs[i] - r), ys[i]);\n }\n\n sort(cxys, cxys + cn);\n\n double sum = 0.0;\n\n for (int i = 0; i < cn - 1; i++) {\n double a0, b0, a1, b1;\n tri& cxy0 = cxys[i], cxy1 = cxys[i + 1];\n double x0 = cxy0.x, x1 = cxy1.x;\n if (x1 - x0 < DELTA) continue;\n\n line_eq(x0, cxy0.y0, x1, cxy1.y0, a0, b0);\n line_eq(x0, cxy0.y1, x1, cxy1.y1, a1, b1);\n\n // f(x)*f(x+r) = (a0*x+b0)(a1*x+b1)=(a0a1)*x^2+(a0b1+a1b0)*x+(b0b1)\n double aa = a0 * a1;\n double bb = a0 * b1 + a1 * b0;\n double cc = b0 * b1;\n\n double itg =\n\taa * (x1 * x1 * x1 - x0 * x0 * x0) / 3 +\n\tbb * (x1 * x1 - x0 * x0) / 2 +\n\tcc * (x1 - x0);\n\n sum += itg;\n }\n\n printf(\"%.10lf\\n\", sum);\n }\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1256,"score_of_the_acc":-0.1685,"final_rank":9},{"submission_id":"aoj_2034_1155967","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\nint main(){\n int N;\n double R;\n while(cin >> N >> R && N > 0) {\n vector<double> xs(N), ys(N);\n REP(i, N) cin >> xs[i] >> ys[i];\n\n vector<double> p;\n REP(i, xs.size()){\n double x = xs[i];\n if(xs.front() <= x + R && x + R <= xs.back()) {\n p.push_back(x);\n }\n }\n REP(i, xs.size()){\n double x = xs[i] - R;\n if(xs.front() <= x && x <= xs.back()) {\n p.push_back(x);\n }\n }\n sort(p.begin(), p.end());\n p.erase(unique(p.begin(), p.end()), p.end());\n double ans = 0.0;\n for(int i = 0; i + 1 < p.size(); i++) {\n double lx = p[i];\n double rx = p[i+1];\n double cx = (lx + rx) / 2;\n\n int k = upper_bound(xs.begin(), xs.end(), cx) - xs.begin() - 1;\n //assert(xs[k] <= lx && rx <= xs[k+1]);\n assert(k >= 0);\n double A = (ys[k+1] - ys[k]) / (xs[k+1] - xs[k]);\n double B = ys[k] - A * xs[k];\n \n double lxr = p[i] + R;\n double rxr = p[i+1] + R;\n double cxr = (lxr + rxr) / 2;\n int kr = upper_bound(xs.begin(), xs.end(), cxr) - xs.begin() - 1;\n //assert(xs[kr] <= lxr && rxr <= xs[kr+1]);\n assert(kr >= 0);\n double C = (ys[kr+1] - ys[kr]) / (xs[kr+1] - xs[kr]);\n double D = ys[kr] - C * xs[kr] + C * R;\n\n double E = A * C;\n double F = A * D + B * C;\n double G = B * D;\n // E * x^3/3 + F * x^2/2 + G*x\n auto f = [&](double x) -> double {\n return E*x*x*x/3 + F*x*x/2 + G*x;\n };\n ans += f(p[i+1]) - f(p[i]);\n }\n printf(\"%.12f\\n\", ans);\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1268,"score_of_the_acc":-0.1728,"final_rank":10},{"submission_id":"aoj_2034_469022","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 main()\n{\n for(;;){\n int n;\n double r;\n cin >> n >> r;\n if(n == 0)\n return 0;\n\n vector<double> x(n), y(n);\n for(int i=0; i<n; ++i)\n cin >> x[i] >> y[i];\n\n vector<double> s(n-1), t(n-1); // y = s * x + t\n for(int i=0; i<n-1; ++i){\n s[i] = (y[i+1] - y[i]) / (x[i+1] - x[i]);\n t[i] = y[i] - s[i] * x[i];\n }\n\n double ret = 0.0;\n for(int i=0; i<n-1; ++i){\n for(int j=0; j<n-1; ++j){\n double x1 = max(x[i], x[j] - r);\n double x2 = min(x[i+1], x[j+1] - r);\n if(x1 > x2)\n continue;\n\n double s1 = s[i];\n double t1 = t[i];\n double s2 = s[j];\n double t2 = t[j] + s[j] * r;\n\n double a, b, c; // y = a * x^2 + b * x + c\n a = s1 * s2;\n b = s1 * t2 + s2 * t1;\n c = t1 * t2;\n \n ret += a / 3 * pow(x2, 3) + b / 2 * pow(x2, 2) + c * x2;\n ret -= a / 3 * pow(x1, 3) + b / 2 * pow(x1, 2) + c * x1;\n }\n }\n printf(\"%.10f\\n\", ret);\n }\n}","accuracy":1,"time_ms":20,"memory_kb":1252,"score_of_the_acc":-0.1611,"final_rank":8},{"submission_id":"aoj_2034_357727","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cmath>\n#include <cstring>\n\nusing namespace std;\n\nconst double EPS=(1e-10);\nbool EQ(double a,double b){\n return abs(a-b)<EPS;\n}\n\ntypedef complex<double> P;\ntypedef pair<double,double> pdd;\n\ndouble calc(double a1,double b1,double a2,double b2,double x,double r){\n return (a2*a1*x*x*x)/3.0+(x*x*(a1*a2*r+b2*a1+a2*b1))/2.0+(a2*b1*r+b1*b2)*x;\n}\n\nint main(){\n int n;\n double r;\n while(cin>>n>>r&&!(n==0&&EQ(r,0))){\n vector<P> dots;\n vector<pdd> co;\n dots.push_back(P(-1000,0));\n for(int i=0;i<n;i++){\n double x,y;\n cin>>x>>y;\n dots.push_back(P(x,y));\n }\n dots.push_back(P(1000,0));\n double sum=0;\n n+=2;\n for(int i=1;i<n;i++){\n double a=(dots[i-1].imag()-dots[i].imag())/(dots[i-1].real()-dots[i].real());\n double b=dots[i-1].imag()-a*dots[i-1].real();\n co.push_back(pdd(a,b));\n }\n double ax=dots[1].real();\n double bx=ax+r;\n int nxtApos=n;\n int nxtBpos=n;\n // rツづ個値ツつェツづづ個凝ヲツ甘板づ可甘慊づ慊づェツづつ「ツづゥツつゥツづーツ探ツ催オ\n for(int i=0;i<n;i++){\n if(dots[i].real()>bx&&!EQ(dots[i].real(),bx)){\n nxtBpos=i;\n break;\n }\n }\n for(int i=0;i<n;i++){\n if(dots[i].real()>ax&&!EQ(dots[i].real(),ax)){\n nxtApos=i;\n break;\n }\n }\n // nxtBposツつェnツづ可づ按づゥツづ慊づ堕アツつッツづゥ\n while(nxtBpos!=n&&nxtApos!=n){\n // ツ篠淞づ個湘ェツ渉環づ鳴づ個仰猟猟」ツつェツ渉ャツつウツつ「ツづ個づ債づつソツづァツつゥ\n double adis=dots[nxtApos].real()-ax;\n double bdis=dots[nxtBpos].real()-bx;\n double dis=min(adis,bdis);\n double t=ax+dis;\n double s=ax;\n sum+=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,t,r);\n sum-=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,s,r);\n ax+=dis;bx+=dis;\n if(EQ(adis,bdis)){\n nxtApos++;\n nxtBpos++;\n }\n else if(adis<bdis)nxtApos++;\n else nxtBpos++;\n }\n printf(\"%.10f\\n\",sum);\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":988,"score_of_the_acc":-0.0782,"final_rank":2},{"submission_id":"aoj_2034_357725","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cmath>\n#include <cstring>\n\nusing namespace std;\n\nconst double EPS=(1e-10);\nbool EQ(double a,double b){\n return abs(a-b)<EPS;\n}\n\ntypedef complex<double> P;\ntypedef pair<double,double> pdd;\n\ndouble calc(double a1,double b1,double a2,double b2,double x,double r){\n return (a2*a1*x*x*x)/3.0+(x*x*(a1*a2*r+b2*a1+a2*b1))/2.0+(a2*b1*r+b1*b2)*x;\n}\n\nint main(){\n int n;\n double r;\n while(cin>>n>>r&&!(n==0&&EQ(r,0))){\n vector<P> dots;\n vector<pdd> co;\n dots.push_back(P(-1000,0));\n for(int i=0;i<n;i++){\n double x,y;\n cin>>x>>y;\n dots.push_back(P(x,y));\n }\n dots.push_back(P(1000,0));\n double sum=0;\n for(int i=1;i<=n+1;i++){\n double a=(dots[i-1].imag()-dots[i].imag())/(dots[i-1].real()-dots[i].real());\n double b=dots[i-1].imag()-a*dots[i-1].real();\n co.push_back(pdd(a,b));\n }\n double ax=dots[1].real();\n double bx=ax+r;\n int nxtApos=n+2;\n int nxtBpos=n+2;\n // rツづ個値ツつェツづづ個凝ヲツ甘板づ可甘慊づ慊づェツづつ「ツづゥツつゥツづーツ探ツ催オ\n for(int i=0;i<=n+1;i++){\n if(dots[i].real()>bx&&!EQ(dots[i].real(),bx)){\n nxtBpos=i;\n break;\n }\n }\n for(int i=0;i<=n+1;i++){\n if(dots[i].real()>ax&&!EQ(dots[i].real(),ax)){\n nxtApos=i;\n break;\n }\n }\n // nxtBposツつェnツづ可づ按づゥツづ慊づ堕アツつッツづゥ\n while(nxtBpos!=n+2&&nxtApos!=n+2){\n // ツ篠淞づ個湘ェツ渉環づ鳴づ個仰猟猟」ツつェツ渉ャツつウツつ「ツづ個づ債づつソツづァツつゥ\n double adis=dots[nxtApos].real()-ax;\n double bdis=dots[nxtBpos].real()-bx;\n double dis=min(adis,bdis);\n double t=ax+dis;\n double s=ax;\n sum+=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,t,r);\n sum-=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,s,r);\n ax+=dis;bx+=dis;\n if(EQ(adis,bdis)){\n nxtApos++;\n nxtBpos++;\n }\n else if(adis<bdis)nxtApos++;\n else nxtBpos++;\n }\n printf(\"%.10f\\n\",sum);\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":988,"score_of_the_acc":-0.0782,"final_rank":2},{"submission_id":"aoj_2034_357724","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cmath>\n#include <cstring>\n\nusing namespace std;\n\nconst double EPS=(1e-10);\nbool EQ(double a,double b){\n return abs(a-b)<EPS;\n}\n\ntypedef complex<double> P;\ntypedef pair<double,double> pdd;\n\ndouble calc(double a1,double b1,double a2,double b2,double x,double r){\n return (a2*a1*x*x*x)/3.0+(x*x*(a1*a2*r+b2*a1+a2*b1))/2.0+(a2*b1*r+b1*b2)*x;\n}\n\nint main(){\n int n;\n double r;\n while(cin>>n>>r&&!(n==0&&EQ(r,0))){\n vector<P> dots;\n vector<pdd> co;\n dots.push_back(P(-1000,0));\n for(int i=0;i<n;i++){\n double x,y;\n cin>>x>>y;\n dots.push_back(P(x,y));\n }\n dots.push_back(P(1000,0));\n double sum=0;\n for(int i=1;i<=n+1;i++){\n double a=(dots[i-1].imag()-dots[i].imag())/(dots[i-1].real()-dots[i].real());\n double b=dots[i-1].imag()-a*dots[i-1].real();\n co.push_back(pdd(a,b));\n }\n double ax=dots[1].real();\n double bx=ax+r;\n int nxtApos=n+2;\n int nxtBpos=n+2;\n // rツづ個値ツつェツづづ個凝ヲツ甘板づ可甘慊づ慊づェツづつ「ツづゥツつゥツづーツ探ツ催オ\n for(int i=0;i<=n+1;i++){\n if(dots[i].real()>bx&&!EQ(dots[i].real(),bx)){\n nxtBpos=i;\n break;\n }\n }\n for(int i=0;i<=n+1;i++){\n if(dots[i].real()>ax&&!EQ(dots[i].real(),ax)){\n nxtApos=i;\n break;\n }\n }\n //bool rev=false;\n //if(ax>bx){\n // swap(ax,bx);\n // swap(nxtApos,nxtBpos);\n // rev=true;\n //}\n // nxtBposツつェnツづ可づ按づゥツづ慊づ堕アツつッツづゥ\n while(nxtBpos!=n+2&&nxtApos!=n+2){\n // ツ篠淞づ個湘ェツ渉環づ鳴づ個仰猟猟」ツつェツ渉ャツつウツつ「ツづ個づ債づつソツづァツつゥ\n double adis=dots[nxtApos].real()-ax;\n double bdis=dots[nxtBpos].real()-bx;\n double dis=min(adis,bdis);\n double t=ax+dis;\n double s=ax;\n sum+=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,t,r);\n sum-=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,s,r);\n //if(rev){\n // t=bx+dis;\n // s=bx;\n // sum+=calc(co[nxtBpos-1].first,co[nxtBpos-1].second,co[nxtApos-1].first,co[nxtApos-1].second,t,r);\n // sum-=calc(co[nxtBpos-1].first,co[nxtBpos-1].second,co[nxtApos-1].first,co[nxtApos-1].second,s,r);\n //}\n //else{\n // sum+=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,t,r);\n // sum-=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,s,r);\n //}\n ax+=dis;bx+=dis;\n if(EQ(adis,bdis)){\n nxtApos++;\n nxtBpos++;\n }\n else if(adis<bdis)nxtApos++;\n else nxtBpos++;\n }\n printf(\"%.10f\\n\",sum);\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":992,"score_of_the_acc":-0.0796,"final_rank":4},{"submission_id":"aoj_2034_357723","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cmath>\n#include <cstring>\n\nusing namespace std;\n\nconst double EPS=(1e-10);\nbool EQ(double a,double b){\n return abs(a-b)<EPS;\n}\n\ntypedef complex<double> P;\ntypedef pair<double,double> pdd;\n\ndouble calc(double a1,double b1,double a2,double b2,double x,double r){\n return (a2*a1*x*x*x)/3.0+(x*x*(a1*a2*r+b2*a1+a2*b1))/2.0+(a2*b1*r+b1*b2)*x;\n}\n\nint main(){\n int n;\n double r;\n while(cin>>n>>r&&!(n==0&&EQ(r,0))){\n vector<P> dots;\n vector<pdd> co;\n dots.push_back(P(-1000,0));\n for(int i=0;i<n;i++){\n double x,y;\n cin>>x>>y;\n dots.push_back(P(x,y));\n }\n dots.push_back(P(1000,0));\n double sum=0;\n for(int i=1;i<=n+1;i++){\n double a=(dots[i-1].imag()-dots[i].imag())/(dots[i-1].real()-dots[i].real());\n double b=dots[i-1].imag()-a*dots[i-1].real();\n co.push_back(pdd(a,b));\n }\n double ax=dots[1].real();\n double bx=ax+r;\n int nxtApos=n+2;\n int nxtBpos=n+2;\n // rツづ個値ツつェツづづ個凝ヲツ甘板づ可甘慊づ慊づェツづつ「ツづゥツつゥツづーツ探ツ催オ\n for(int i=0;i<=n+1;i++){\n if(dots[i].real()>bx&&!EQ(dots[i].real(),bx)){\n nxtBpos=i;\n break;\n }\n }\n for(int i=0;i<=n+1;i++){\n if(dots[i].real()>ax&&!EQ(dots[i].real(),ax)){\n nxtApos=i;\n break;\n }\n }\n bool rev=false;\n if(ax>bx){\n swap(ax,bx);\n swap(nxtApos,nxtBpos);\n rev=true;\n }\n // nxtBposツつェnツづ可づ按づゥツづ慊づ堕アツつッツづゥ\n while(nxtBpos!=n+2){\n // ツ篠淞づ個湘ェツ渉環づ鳴づ個仰猟猟」ツつェツ渉ャツつウツつ「ツづ個づ債づつソツづァツつゥ\n double adis=dots[nxtApos].real()-ax;\n double bdis=dots[nxtBpos].real()-bx;\n double dis=min(adis,bdis);\n double t=ax+dis;\n double s=ax;\n if(rev){\n t=bx+dis;\n s=bx;\n sum+=calc(co[nxtBpos-1].first,co[nxtBpos-1].second,co[nxtApos-1].first,co[nxtApos-1].second,t,r);\n sum-=calc(co[nxtBpos-1].first,co[nxtBpos-1].second,co[nxtApos-1].first,co[nxtApos-1].second,s,r);\n }\n else{\n sum+=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,t,r);\n sum-=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,s,r);\n }\n ax+=dis;bx+=dis;\n if(EQ(adis,bdis)){\n nxtApos++;\n nxtBpos++;\n }\n else if(adis<bdis)nxtApos++;\n else nxtBpos++;\n }\n printf(\"%.10f\\n\",sum);\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":992,"score_of_the_acc":-0.0796,"final_rank":4},{"submission_id":"aoj_2034_355197","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\nstruct P {\n double x, y;\n bool f;\n P(double x, double y, bool f) : x(x), y(y), f(f) {}\n};\nbool operator<(const P &a, const P &b) {\n return a.x!=b.x?a.x<b.x : a.y<b.y;\n}\n\ndouble X[100];\ndouble Y[100];\nint n;\n\ndouble func(double x) {\n if (x<=X[0] || x>=X[n-1]) return 0;\n int q = upper_bound(X, X+n, x) - X;\n int p = q-1;\n return (Y[q]-Y[p])/(X[q]-X[p])*(x-X[p])+Y[p];\n}\n\nint main() {\n double r;\n while(cin>>n>>r,n) {\n vector<P> v;\n REP(i, n) {\n cin >> X[i] >> Y[i];\n v.push_back(P(X[i], Y[i], 0));\n v.push_back(P(X[i]-r, Y[i], 1));\n }\n sort(ALL(v));\n double ans = 0;\n REP(i, v.size()-1) {\n double a = v[i].x;\n double b = v[i+1].x;\n double c = (a+b)/2;\n double fa = func(a)*func(a+r);\n double fb = func(b)*func(b+r);\n double fc = func(c)*func(c+r);\n ans += (b-a)/6*(fa+4*fc+fb);\n }\n printf(\"%.10f\\n\",ans);\n }\n}","accuracy":1,"time_ms":50,"memory_kb":992,"score_of_the_acc":-0.0856,"final_rank":6},{"submission_id":"aoj_2034_256348","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 double EPS=1e-9;\n\nstruct Point{ double x,y; };\n\nint n;\nPoint _f[100],_g[100];\n\ndouble f(double x){\n\tif(x<_f[0].x) return 0;\n\trep(i,n-1){\n\t\tdouble x1=_f[i].x,x2=_f[i+1].x;\n\t\tdouble y1=_f[i].y,y2=_f[i+1].y;\n\t\tif(x<x2) return (y2-y1)/(x2-x1)*(x-x1)+y1;\n\t}\n\treturn 0;\n}\n\ndouble g(double x){\n\tif(x<_g[0].x) return 0;\n\trep(i,n-1){\n\t\tdouble x1=_g[i].x,x2=_g[i+1].x;\n\t\tdouble y1=_g[i].y,y2=_g[i+1].y;\n\t\tif(x<x2) return (y2-y1)/(x2-x1)*(x-x1)+y1;\n\t}\n\treturn 0;\n}\n\nint main(){\n\tfor(double r;scanf(\"%d%lf\",&n,&r),n;){\n\t\tdouble ev[200];\n\t\trep(i,n){\n\t\t\tint x,y; scanf(\"%d%d\",&x,&y);\n\t\t\t_f[i]=(Point){x,y};\n\t\t\t_g[i]=(Point){x+r,y};\n\t\t\tev[2*i+0]=x;\n\t\t\tev[2*i+1]=x+r;\n\t\t}\n\t\tsort(ev,ev+2*n);\n\n\t\tdouble ans=0;\n\t\trep(i,2*n-1){\n\t\t\tdouble x1=ev[i],x2=ev[i+1];\n\t\t\tif(x2-x1<EPS) continue;\n\n\t\t\tdouble f1=f(x1),f2=f(x2),g1=g(x1),g2=g(x2);\n\t\t\tdouble af=(f2-f1)/(x2-x1),bf=f1-af*x1;\n\t\t\tdouble ag=(g2-g1)/(x2-x1),bg=g1-ag*x1;\n\t\t\tans+=af*ag*(x2*x2*x2-x1*x1*x1)/3+(af*bg+bf*ag)*(x2*x2-x1*x1)/2+bf*bg*(x2-x1);\n\t\t}\n\t\tprintf(\"%.15f\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":820,"score_of_the_acc":-0.0179,"final_rank":1},{"submission_id":"aoj_2034_256327","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;\n\nnamespace std{\n\tbool operator <(const Point &a,const Point &b){\n\t\treturn abs(a.real()-b.real())<EPS?(a.imag()+EPS<b.imag()):(a.real()+EPS<b.real());\n\t}\n}\n\nclass Line:public vector<Point>{\npublic:\n\tLine(){}\n\tLine(const Point &a,const Point &b){ push_back(a), push_back(b); }\n};\n\nclass Segment:public Line{\npublic:\n\tSegment(){}\n\tSegment(const Point &a,const Point &b):Line(a,b){}\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\nenum {CCW=1,CW=-1,ON=0};\nint ccw(const Point &a,Point b,Point c){\n\tb-=a, c-=a;\n\tdouble rotdir=cross(b,c);\n\tif(rotdir>EPS) return CCW;\n\tif(rotdir<-EPS) return CW;\n\treturn ON;\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\nbool cover(const Segment &s,const Point &p){\n\treturn dot(s[0]-p,s[1]-p)<EPS;\n}\n\nbool intersect(const Segment &s,const Segment &t,Point *p){\n\tbool flg;\n\tif(abs(cross(s[1]-s[0],t[1]-t[0]))<EPS && abs(cross(s[1]-s[0],t[0]-s[0]))<EPS){\n\t\tflg=(cover(s,t[0]) || cover(s,t[1]) || cover(t,s[0]) || cover(t,s[1]));\n\t\tif(!flg) return false;\n\t}\n\n\tif(flg || (ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1])<=0\n\t\t\t&& ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1])<=0)){\n\t\tdouble a1,b1,c1,a2,b2,c2;\n\t\tcalc_abc(s,a1,b1,c1);\n\t\tcalc_abc(t,a2,b2,c2);\n\t\tdouble det=a1*b2-a2*b1;\n\t\tif(abs(det)<EPS){ // s is parallel to t\n\t\t\tPoint q[3]={s[0],s[1],t[0]};\n\t\t\trep(i,3){\n\t\t\t\tif(cover(s,q[i]) && cover(t,q[i])){\n\t\t\t\t\t*p=q[i];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse *p=Point(b1*c2-b2*c1,a2*c1-a1*c2)/det;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nint n;\nPoint _f[100],_g[100];\n\ndouble f(double x){\n\tif(x<_f[0].real()) return 0;\n\trep(i,n-1){\n\t\tdouble x1=_f[i].real(),x2=_f[i+1].real();\n\t\tdouble y1=_f[i].imag(),y2=_f[i+1].imag();\n\t\tif(x<x2) return (y2-y1)/(x2-x1)*(x-x1)+y1;\n\t}\n\treturn 0;\n}\n\ndouble g(double x){\n\tif(x<_g[0].real()) return 0;\n\trep(i,n-1){\n\t\tdouble x1=_g[i].real(),x2=_g[i+1].real();\n\t\tdouble y1=_g[i].imag(),y2=_g[i+1].imag();\n\t\tif(x<x2) return (y2-y1)/(x2-x1)*(x-x1)+y1;\n\t}\n\treturn 0;\n}\n\nint main(){\n\tfor(double r;scanf(\"%d%lf\",&n,&r),n;){\n\t\tvector<double> ev;\n\t\trep(i,n){\n\t\t\tint x,y; scanf(\"%d%d\",&x,&y);\n\t\t\t_f[i]=Point(x,y);\n\t\t\t_g[i]=Point(x+r,y);\n\t\t\tev.push_back(x);\n\t\t\tev.push_back(x+r);\n\t\t}\n\n\t\trep(i,n-1) rep(j,n-1) {\n\t\t\tPoint p;\n\t\t\tif(intersect(Segment(_f[i],_f[i+1]),Segment(_g[i],_g[i+1]),&p)){\n\t\t\t\tev.push_back(p.real());\n\t\t\t}\n\t\t}\n\n\t\tsort(_f,_f+n);\n\t\tsort(_g,_g+n);\n\t\tsort(ev.begin(),ev.end());\n\n\t\tdouble ans=0;\n\t\trep(i,ev.size()-1){\n\t\t\tdouble x1=ev[i],x2=ev[i+1];\n\t\t\tif(x2-x1<EPS) continue;\n\t\t\tdouble f1=f(x1),f2=f(x2),g1=g(x1),g2=g(x2);\n\t\t\tdouble af=(f2-f1)/(x2-x1),bf=f1-af*x1;\n\t\t\tdouble ag=(g2-g1)/(x2-x1),bg=g1-ag*x1;\n\t\t\tans+=af*ag*(x2*x2*x2-x1*x1*x1)/3+(af*bg+bf*ag)*(x2*x2-x1*x1)/2+bf*bg*(x2-x1);\n\t\t}\n\t\tprintf(\"%.15f\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":770,"memory_kb":924,"score_of_the_acc":-0.4897,"final_rank":11},{"submission_id":"aoj_2034_112053","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nclass EQ{\npublic:\n double a,b;\n double xs,xe;\n};\n\ndouble compute(double a,double b,double c,double x){\n return a*x*x*x+b*x*x+c*x;\n}\n\ndouble integ(double ai,double bi,double aj,double bj,double xs,double xe){\n double ta=compute((ai*aj)/3,(ai*bj+aj*bi)/2,bi*bj,xs);\n double tb=compute((ai*aj)/3,(ai*bj+aj*bi)/2,bi*bj,xe);\n return tb-ta;\n}\n\nbool have_common(double xs1,double xe1,double xs2,double xe2){\n if ((xs2 <= xs1 && xs1 <= xe2)||\n (xs2 <= xe1 && xe1 <= xe2)||\n (xs1 <= xs2 && xs2 <= xe1)||\n (xs1 <= xe2 && xe2 <= xe1))return true;\n else return false;\n}\n\ndouble solve(vector<EQ> &in,double r){\n int n = in.size();\n double ans = 0;\n rep(i,n){\n double xs=in[i].xs+r,xe=in[i].xe+r;\n rep(j,n){\n //cout << xs <<\" \" << xe << endl;\n if (have_common(xs,xe,in[j].xs,in[j].xe)){\n double cxs=max(xs,in[j].xs),cxe=min(xe,in[j].xe);\n // cout <<\"test :\" << cxs-r <<\" \" << cxe-r <<\n // \" \" << integ(in[i].a,in[i].b,in[j].a,in[j].b+r*in[j].a,cxs-r,cxe-r) <<\" test end \" << endl;\n\n ans+= integ(in[i].a,in[i].b,in[j].a,in[j].b+r*in[j].a,cxs-r,cxe-r);\n if (xe < in[j].xe)break;\n else xs=in[j].xe;\n }\n }\n }\n return ans;\n}\n\n\nmain(){\n int n;\n double r;\n while(cin>>n>>r && n){\n vector<double> x,y;\n vector<EQ>in;\n rep(i,n){\n double tx,ty;\n cin>>tx>>ty;\n x.push_back(tx);\n y.push_back(ty);\n }\n\n EQ ins;\n rep(i,n-1){\n ins.xs=x[i];ins.xe=x[i+1];\n ins.a=(y[i+1]-y[i])/(x[i+1]-x[i]);\n ins.b=-ins.a*x[i]+y[i];\n in.push_back(ins);\n }\n\n printf(\"%.10lf\\n\",solve(in,r));\n }\n return false;\n}","accuracy":1,"time_ms":50,"memory_kb":996,"score_of_the_acc":-0.087,"final_rank":7}],"string":"[\n {\n \"submission_id\": \"aoj_2034_10794058\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n \\n cout.setf(ios::fixed);\\n cout << setprecision(15);\\n\\n int n;\\n long double r;\\n while ( (cin >> n >> r) ) {\\n if (n == 0 && fabsl(r) == 0.0L) break;\\n\\n vector<long double> x(n), y(n);\\n for (int i = 0; i < n; ++i) {\\n long double xi, yi;\\n cin >> xi >> yi;\\n x[i] = xi; y[i] = yi;\\n }\\n\\n // Предполагается: f(x)=0 вне [x0, x_{n-1}] (y на концах равно 0).\\n // Рассматриваем только область перекрытия x и x+r.\\n const long double EPS = 1e-12L;\\n\\n long double L = max(x.front(), x.front() - r);\\n long double R = min(x.back(), x.back() - r);\\n\\n if (L >= R - EPS) {\\n cout << 0.0 << \\\"\\\\n\\\";\\n continue;\\n }\\n\\n // Считаем наклоны и свободные члены на каждом сегменте: f(x)=m[i]*x + c[i] на [x[i], x[i+1]]\\n int segs = n - 1;\\n vector<long double> m(segs), c(segs);\\n for (int i = 0; i < segs; ++i) {\\n m[i] = (y[i+1] - y[i]) / (x[i+1] - x[i]);\\n c[i] = y[i] - m[i] * x[i];\\n }\\n\\n // Функции для поиска сегмента, которому принадлежит точка t (x[i] <= t <= x[i+1]).\\n auto find_segment = [&](long double t) -> int {\\n // upper_bound даст первый x[k] > t, отнимаем 1\\n int idx = int(upper_bound(x.begin(), x.end(), t) - x.begin()) - 1;\\n if (idx < 0) idx = 0;\\n if (idx >= segs) idx = segs - 1; // на правой границе попадём сюда, но дальше мы ограничиваемся R\\n return idx;\\n };\\n\\n int i = find_segment(L); // сегмент f(x) при x=L\\n int j = find_segment(L + r); // сегмент f(x+r) при x=L\\n\\n long double cur = L;\\n long double ans = 0.0L;\\n\\n while (cur < R - EPS) {\\n // следующий излом для x или для (x+r)\\n long double next_i = x[i+1]; // граница для f(x)\\n long double next_j = x[j+1] - r; // граница для f(x+r)\\n long double nxt = min({next_i, next_j, R});\\n\\n long double a = cur, b = nxt;\\n if (b > a + EPS) {\\n // На [a,b] имеем f(x)=m[i]*x + c[i], f(x+r)=m[j]*(x+r)+c[j] = m[j]*x + (m[j]*r + c[j]).\\n long double A = m[i] * m[j];\\n long double B = m[i] * (m[j]*r + c[j]) + c[i] * m[j];\\n long double C = c[i] * (m[j]*r + c[j]);\\n // Интеграл A x^2 + B x + C\\n long double I = A * ( (b*b*b - a*a*a) / 3.0L )\\n + B * ( (b*b - a*a ) / 2.0L )\\n + C * ( b - a );\\n ans += I;\\n }\\n\\n cur = b;\\n\\n // Перейти на следующий сегмент(ы) при необходимости\\n if (fabsl(cur - next_i) <= EPS && i+1 < segs) ++i;\\n if (fabsl(cur - next_j) <= EPS && j+1 < segs) ++j;\\n // защита от возможных застреваний из-за численных ошибок\\n if (nxt == cur) {\\n // подвинем на микро-шаг\\n cur += 1e-13L;\\n }\\n }\\n\\n cout << ans << \\\"\\\\n\\\";\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3604,\n \"score_of_the_acc\": -1,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2034_1684647\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define _overload(_1,_2,_3,name,...) name\\n#define _rep(i,n) _range(i,0,n)\\n#define _range(i,a,b) for(int i=int(a);i<int(b);++i)\\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\\n\\n#define _rrep(i,n) _rrange(i,n,0)\\n#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)\\n#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)\\n\\n#define _all(arg) begin(arg),end(arg)\\n#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))\\n#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)\\n#define clr(a,b) memset((a),(b),sizeof(a))\\n#define bit(n) (1LL<<(n))\\n\\ntemplate<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}\\ntemplate<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}\\n\\nusing namespace std;\\nusing R=long double;\\nconst R eps=1e-11; // [-1000:1000]->EPS=1e-8 [-10000:10000]->EPS=1e-7\\nconst R pi=acos(-1);\\nconst R inf=1e40;\\ninline int sgn(const R& r){ return (r > eps) - (r < -eps);}\\ninline int sgn(const R& a, const R &b){ return sgn(a-b); }\\ninline R sq(R x){return sqrt(max<R>(x,0.0));}\\n\\nint n;\\nR vx[110],vy[110],r;\\n\\nR val(R x){\\n\\tR ret=0.0;\\n\\trep(i,n-1){\\n\\t\\tif(vx[i]<=x&&x<vx[i+1]){\\n\\t\\t\\tR rate=(x-vx[i])/(vx[i+1]-vx[i]);\\n\\t\\t\\tret=vy[i]+rate*(vy[i+1]-vy[i]);\\n\\t\\t\\treturn ret;\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\nR func(R x){ return 1.0*val(x)*val(x+r); }\\n\\nint main(void){\\n\\twhile(cin >> n >> r,n){\\t\\n\\t\\tvector<R> ary;\\n\\t\\trep(i,n) cin >> vx[i] >> vy[i];\\n\\t\\trep(i,n) ary.push_back(vx[i]),ary.push_back(vx[i]+r),ary.push_back(vx[i]-r);\\n\\t\\t\\n\\t\\tuniq(ary);\\n\\t\\tint m=ary.size();\\n\\n\\t\\tR ans=0.0;\\n\\t\\trep(i,m-1){\\n\\t\\t\\tR a=ary[i],b=ary[i+1],c=(a+b)/2.0;\\n\\t\\t\\tR fa=func(a),fb=func(b),fc=func(c);\\n\\t\\t\\tR cur=(fa+4.0*fc+fb)*(b-a)/6.0;\\n\\t\\t\\tans+=cur;\\n\\t\\t}\\n\\t\\tcout.precision(20);\\n\\t\\tcout << fixed << ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3160,\n \"score_of_the_acc\": -0.8762,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2034_1552144\",\n \"code_snippet\": \"//\\n// Numerical Integration (Adaptive Gauss--Lobatto--Kronrod)\\n//\\n// Description:\\n// Gauss--Lobatto formula is a numerical integrator\\n// that is accurate for polynomials of degree <= 2n+1.\\n// Adaptive Gauss--Lobatto recursively divides the domain\\n// and computes integral by using G-L formula.\\n//\\n// Algorithm:\\n// Above.\\n//\\n// Complexity:\\n// O(#pieces) for a piecewise polynomials.\\n// In general, it converges in O(1/n^6) for smooth functions.\\n//\\n// Verified: \\n// AOJ 2034\\n//\\n// References:\\n// R. T. Trimbitas, M. G. Trimbitas (2008):\\n// Gauss-Lobatto-Kronrod formulae and adaptive numerical integration.\\n// in Proceedings of the 10th International Symposium on \\n// Symbolic and Numeric Algorithms for Scientific Computing. pp. 183--186.\\n//\\n#include <iostream>\\n#include <vector>\\n#include <limits>\\n#include <cstdio>\\n#include <algorithm>\\n#include <functional>\\n\\nusing namespace std;\\n\\n#define fst first\\n#define snd second\\n#define all(c) ((c).begin()), ((c).end())\\n\\n// adaptive gauss-lobatto\\ntemplate <class F>\\ndouble integrate(F f, double lo, double hi, double eps = 1e-8) {\\n const double th = eps / 1e-14; // (= eps / machine_epsilon)\\n function<double (double,double,double,double,int)> rec =\\n [&](double x0, double x6, double y0, double y6, int d) {\\n const double a = sqrt(2.0/3.0), b = 1.0 / sqrt(5.0);\\n double x3 = (x0 + x6)/2, y3 = f(x3), h = (x6 - x0)/2;\\n double x1 = x3-a*h, x2 = x3-b*h, x4 = x3+b*h, x5 = x3+a*h;\\n double y1 = f(x1), y2 = f(x2), y4 = f(x4), y5 = f(x5);\\n double I1 = (y0+y6 + 5*(y2+y4)) * (h/6);\\n double I2 = (77*(y0+y6) + 432*(y1+y5) + 625*(y2+y4) + 672*y3) * (h/1470);\\n if (x3 + h == x3 || d > 50) return 0.0; \\n if (d > 4 && th + (I1-I2) == th) return I2;\\n return (double)(rec(x0, x1, y0, y1, d+1) + rec(x1, x2, y1, y2, d+1) \\n + rec(x2, x3, y2, y3, d+1) + rec(x3, x4, y3, y4, d+1) \\n + rec(x4, x5, y4, y5, d+1) + rec(x5, x6, y5, y6, d+1));\\n };\\n return rec(lo, hi, f(lo), f(hi), 0);\\n}\\n\\nint main() {\\n for (int n; scanf(\\\"%d\\\", &n); ) {\\n if (n == 0) break;\\n double r; \\n scanf(\\\"%lf\\\\n\\\", &r);\\n\\n vector<pair<double,double>> p(n);\\n for (int i = 0; i < n; ++i) \\n scanf(\\\"%lf %lf\\\", &p[i].fst, &p[i].snd);\\n function<double (double)> f = [&](double x) {\\n if (x < p[0].fst) return 0.0;\\n if (x >= p.back().fst) return 0.0;\\n for (int i = 0; i+1 < n; ++i) \\n if (x < p[i+1].fst) \\n return p[i].snd + (p[i+1].snd-p[i].snd)/(p[i+1].fst-p[i].fst)*(x-p[i].fst);\\n };\\n function<double (double)> g = [&](double x) {\\n return f(x) * f(x + r);\\n };\\n printf(\\\"%.12f\\\\n\\\", integrate(g, p[0].fst-100, p.back().fst+100));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1690,\n \"memory_kb\": 1244,\n \"score_of_the_acc\": -1.1523,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2034_1355664\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 100;\\nconst double DELTA = 1e-10;\\n\\n/* typedef */\\n\\nstruct tri {\\n double x, y0, y1;\\n tri() {}\\n tri(double _x, double _y0, double _y1) { x = _x, y0 = _y0, y1 = _y1; }\\n bool operator<(const tri& t0) const { return x < t0.x; }\\n};\\n\\n/* global variables */\\n\\nint n, cn;\\ndouble r, minx, maxx;\\ndouble xs[MAX_N], ys[MAX_N];\\ntri cxys[MAX_N * 2];\\n\\n/* subroutines */\\n\\n// (x0,y0)-(x1-y1)\\n// dx=x1-x0,dy=y1-y0\\n// y = dy/dx * (x-x0) + y0 = dy/dx * x + (dx*y0-dy*x0)/dx\\n\\ninline void line_eq(double x0, double y0, double x1, double y1,\\n\\t\\t double& a, double& b) {\\n double dx = x1 - x0;\\n double dy = y1 - y0;\\n a = dy / dx;\\n b = (dx * y0 - dy * x0) / dx;\\n}\\n\\ndouble f(double x) {\\n if (x <= minx || x >= maxx) return 0.0;\\n int k = upper_bound(xs, xs + n, x) - xs - 1;\\n double a, b;\\n line_eq(xs[k], ys[k], xs[k + 1], ys[k + 1], a, b);\\n return a * x + b;\\n}\\n\\n/* main */\\n\\nint main() {\\n for (;;) {\\n cin >> n >> r;\\n if (n == 0) break;\\n\\n for (int i = 0; i < n; i++)\\n cin >> xs[i] >> ys[i];\\n minx = xs[0];\\n maxx = xs[n - 1];\\n\\n cn = 0;\\n for (int i = 0; i < n; i++) {\\n if (xs[i] + r <= maxx)\\n\\tcxys[cn++] = tri(xs[i], ys[i], f(xs[i] + r));\\n if (xs[i] - r >= minx)\\n\\tcxys[cn++] = tri(xs[i] - r, f(xs[i] - r), ys[i]);\\n }\\n\\n sort(cxys, cxys + cn);\\n\\n double sum = 0.0;\\n\\n for (int i = 0; i < cn - 1; i++) {\\n double a0, b0, a1, b1;\\n tri& cxy0 = cxys[i], cxy1 = cxys[i + 1];\\n double x0 = cxy0.x, x1 = cxy1.x;\\n if (x1 - x0 < DELTA) continue;\\n\\n line_eq(x0, cxy0.y0, x1, cxy1.y0, a0, b0);\\n line_eq(x0, cxy0.y1, x1, cxy1.y1, a1, b1);\\n\\n // f(x)*f(x+r) = (a0*x+b0)(a1*x+b1)=(a0a1)*x^2+(a0b1+a1b0)*x+(b0b1)\\n double aa = a0 * a1;\\n double bb = a0 * b1 + a1 * b0;\\n double cc = b0 * b1;\\n\\n double itg =\\n\\taa * (x1 * x1 * x1 - x0 * x0 * x0) / 3 +\\n\\tbb * (x1 * x1 - x0 * x0) / 2 +\\n\\tcc * (x1 - x0);\\n\\n sum += itg;\\n }\\n\\n printf(\\\"%.10lf\\\\n\\\", sum);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1256,\n \"score_of_the_acc\": -0.1685,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2034_1155967\",\n \"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\\nint main(){\\n int N;\\n double R;\\n while(cin >> N >> R && N > 0) {\\n vector<double> xs(N), ys(N);\\n REP(i, N) cin >> xs[i] >> ys[i];\\n\\n vector<double> p;\\n REP(i, xs.size()){\\n double x = xs[i];\\n if(xs.front() <= x + R && x + R <= xs.back()) {\\n p.push_back(x);\\n }\\n }\\n REP(i, xs.size()){\\n double x = xs[i] - R;\\n if(xs.front() <= x && x <= xs.back()) {\\n p.push_back(x);\\n }\\n }\\n sort(p.begin(), p.end());\\n p.erase(unique(p.begin(), p.end()), p.end());\\n double ans = 0.0;\\n for(int i = 0; i + 1 < p.size(); i++) {\\n double lx = p[i];\\n double rx = p[i+1];\\n double cx = (lx + rx) / 2;\\n\\n int k = upper_bound(xs.begin(), xs.end(), cx) - xs.begin() - 1;\\n //assert(xs[k] <= lx && rx <= xs[k+1]);\\n assert(k >= 0);\\n double A = (ys[k+1] - ys[k]) / (xs[k+1] - xs[k]);\\n double B = ys[k] - A * xs[k];\\n \\n double lxr = p[i] + R;\\n double rxr = p[i+1] + R;\\n double cxr = (lxr + rxr) / 2;\\n int kr = upper_bound(xs.begin(), xs.end(), cxr) - xs.begin() - 1;\\n //assert(xs[kr] <= lxr && rxr <= xs[kr+1]);\\n assert(kr >= 0);\\n double C = (ys[kr+1] - ys[kr]) / (xs[kr+1] - xs[kr]);\\n double D = ys[kr] - C * xs[kr] + C * R;\\n\\n double E = A * C;\\n double F = A * D + B * C;\\n double G = B * D;\\n // E * x^3/3 + F * x^2/2 + G*x\\n auto f = [&](double x) -> double {\\n return E*x*x*x/3 + F*x*x/2 + G*x;\\n };\\n ans += f(p[i+1]) - f(p[i]);\\n }\\n printf(\\\"%.12f\\\\n\\\", ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1268,\n \"score_of_the_acc\": -0.1728,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2034_469022\",\n \"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 main()\\n{\\n for(;;){\\n int n;\\n double r;\\n cin >> n >> r;\\n if(n == 0)\\n return 0;\\n\\n vector<double> x(n), y(n);\\n for(int i=0; i<n; ++i)\\n cin >> x[i] >> y[i];\\n\\n vector<double> s(n-1), t(n-1); // y = s * x + t\\n for(int i=0; i<n-1; ++i){\\n s[i] = (y[i+1] - y[i]) / (x[i+1] - x[i]);\\n t[i] = y[i] - s[i] * x[i];\\n }\\n\\n double ret = 0.0;\\n for(int i=0; i<n-1; ++i){\\n for(int j=0; j<n-1; ++j){\\n double x1 = max(x[i], x[j] - r);\\n double x2 = min(x[i+1], x[j+1] - r);\\n if(x1 > x2)\\n continue;\\n\\n double s1 = s[i];\\n double t1 = t[i];\\n double s2 = s[j];\\n double t2 = t[j] + s[j] * r;\\n\\n double a, b, c; // y = a * x^2 + b * x + c\\n a = s1 * s2;\\n b = s1 * t2 + s2 * t1;\\n c = t1 * t2;\\n \\n ret += a / 3 * pow(x2, 3) + b / 2 * pow(x2, 2) + c * x2;\\n ret -= a / 3 * pow(x1, 3) + b / 2 * pow(x1, 2) + c * x1;\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\", ret);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1252,\n \"score_of_the_acc\": -0.1611,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2034_357727\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <cmath>\\n#include <cstring>\\n\\nusing namespace std;\\n\\nconst double EPS=(1e-10);\\nbool EQ(double a,double b){\\n return abs(a-b)<EPS;\\n}\\n\\ntypedef complex<double> P;\\ntypedef pair<double,double> pdd;\\n\\ndouble calc(double a1,double b1,double a2,double b2,double x,double r){\\n return (a2*a1*x*x*x)/3.0+(x*x*(a1*a2*r+b2*a1+a2*b1))/2.0+(a2*b1*r+b1*b2)*x;\\n}\\n\\nint main(){\\n int n;\\n double r;\\n while(cin>>n>>r&&!(n==0&&EQ(r,0))){\\n vector<P> dots;\\n vector<pdd> co;\\n dots.push_back(P(-1000,0));\\n for(int i=0;i<n;i++){\\n double x,y;\\n cin>>x>>y;\\n dots.push_back(P(x,y));\\n }\\n dots.push_back(P(1000,0));\\n double sum=0;\\n n+=2;\\n for(int i=1;i<n;i++){\\n double a=(dots[i-1].imag()-dots[i].imag())/(dots[i-1].real()-dots[i].real());\\n double b=dots[i-1].imag()-a*dots[i-1].real();\\n co.push_back(pdd(a,b));\\n }\\n double ax=dots[1].real();\\n double bx=ax+r;\\n int nxtApos=n;\\n int nxtBpos=n;\\n // rツづ個値ツつェツづづ個凝ヲツ甘板づ可甘慊づ慊づェツづつ「ツづゥツつゥツづーツ探ツ催オ\\n for(int i=0;i<n;i++){\\n if(dots[i].real()>bx&&!EQ(dots[i].real(),bx)){\\n nxtBpos=i;\\n break;\\n }\\n }\\n for(int i=0;i<n;i++){\\n if(dots[i].real()>ax&&!EQ(dots[i].real(),ax)){\\n nxtApos=i;\\n break;\\n }\\n }\\n // nxtBposツつェnツづ可づ按づゥツづ慊づ堕アツつッツづゥ\\n while(nxtBpos!=n&&nxtApos!=n){\\n // ツ篠淞づ個湘ェツ渉環づ鳴づ個仰猟猟」ツつェツ渉ャツつウツつ「ツづ個づ債づつソツづァツつゥ\\n double adis=dots[nxtApos].real()-ax;\\n double bdis=dots[nxtBpos].real()-bx;\\n double dis=min(adis,bdis);\\n double t=ax+dis;\\n double s=ax;\\n sum+=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,t,r);\\n sum-=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,s,r);\\n ax+=dis;bx+=dis;\\n if(EQ(adis,bdis)){\\n nxtApos++;\\n nxtBpos++;\\n }\\n else if(adis<bdis)nxtApos++;\\n else nxtBpos++;\\n }\\n printf(\\\"%.10f\\\\n\\\",sum);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 988,\n \"score_of_the_acc\": -0.0782,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2034_357725\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <cmath>\\n#include <cstring>\\n\\nusing namespace std;\\n\\nconst double EPS=(1e-10);\\nbool EQ(double a,double b){\\n return abs(a-b)<EPS;\\n}\\n\\ntypedef complex<double> P;\\ntypedef pair<double,double> pdd;\\n\\ndouble calc(double a1,double b1,double a2,double b2,double x,double r){\\n return (a2*a1*x*x*x)/3.0+(x*x*(a1*a2*r+b2*a1+a2*b1))/2.0+(a2*b1*r+b1*b2)*x;\\n}\\n\\nint main(){\\n int n;\\n double r;\\n while(cin>>n>>r&&!(n==0&&EQ(r,0))){\\n vector<P> dots;\\n vector<pdd> co;\\n dots.push_back(P(-1000,0));\\n for(int i=0;i<n;i++){\\n double x,y;\\n cin>>x>>y;\\n dots.push_back(P(x,y));\\n }\\n dots.push_back(P(1000,0));\\n double sum=0;\\n for(int i=1;i<=n+1;i++){\\n double a=(dots[i-1].imag()-dots[i].imag())/(dots[i-1].real()-dots[i].real());\\n double b=dots[i-1].imag()-a*dots[i-1].real();\\n co.push_back(pdd(a,b));\\n }\\n double ax=dots[1].real();\\n double bx=ax+r;\\n int nxtApos=n+2;\\n int nxtBpos=n+2;\\n // rツづ個値ツつェツづづ個凝ヲツ甘板づ可甘慊づ慊づェツづつ「ツづゥツつゥツづーツ探ツ催オ\\n for(int i=0;i<=n+1;i++){\\n if(dots[i].real()>bx&&!EQ(dots[i].real(),bx)){\\n nxtBpos=i;\\n break;\\n }\\n }\\n for(int i=0;i<=n+1;i++){\\n if(dots[i].real()>ax&&!EQ(dots[i].real(),ax)){\\n nxtApos=i;\\n break;\\n }\\n }\\n // nxtBposツつェnツづ可づ按づゥツづ慊づ堕アツつッツづゥ\\n while(nxtBpos!=n+2&&nxtApos!=n+2){\\n // ツ篠淞づ個湘ェツ渉環づ鳴づ個仰猟猟」ツつェツ渉ャツつウツつ「ツづ個づ債づつソツづァツつゥ\\n double adis=dots[nxtApos].real()-ax;\\n double bdis=dots[nxtBpos].real()-bx;\\n double dis=min(adis,bdis);\\n double t=ax+dis;\\n double s=ax;\\n sum+=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,t,r);\\n sum-=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,s,r);\\n ax+=dis;bx+=dis;\\n if(EQ(adis,bdis)){\\n nxtApos++;\\n nxtBpos++;\\n }\\n else if(adis<bdis)nxtApos++;\\n else nxtBpos++;\\n }\\n printf(\\\"%.10f\\\\n\\\",sum);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 988,\n \"score_of_the_acc\": -0.0782,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2034_357724\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <cmath>\\n#include <cstring>\\n\\nusing namespace std;\\n\\nconst double EPS=(1e-10);\\nbool EQ(double a,double b){\\n return abs(a-b)<EPS;\\n}\\n\\ntypedef complex<double> P;\\ntypedef pair<double,double> pdd;\\n\\ndouble calc(double a1,double b1,double a2,double b2,double x,double r){\\n return (a2*a1*x*x*x)/3.0+(x*x*(a1*a2*r+b2*a1+a2*b1))/2.0+(a2*b1*r+b1*b2)*x;\\n}\\n\\nint main(){\\n int n;\\n double r;\\n while(cin>>n>>r&&!(n==0&&EQ(r,0))){\\n vector<P> dots;\\n vector<pdd> co;\\n dots.push_back(P(-1000,0));\\n for(int i=0;i<n;i++){\\n double x,y;\\n cin>>x>>y;\\n dots.push_back(P(x,y));\\n }\\n dots.push_back(P(1000,0));\\n double sum=0;\\n for(int i=1;i<=n+1;i++){\\n double a=(dots[i-1].imag()-dots[i].imag())/(dots[i-1].real()-dots[i].real());\\n double b=dots[i-1].imag()-a*dots[i-1].real();\\n co.push_back(pdd(a,b));\\n }\\n double ax=dots[1].real();\\n double bx=ax+r;\\n int nxtApos=n+2;\\n int nxtBpos=n+2;\\n // rツづ個値ツつェツづづ個凝ヲツ甘板づ可甘慊づ慊づェツづつ「ツづゥツつゥツづーツ探ツ催オ\\n for(int i=0;i<=n+1;i++){\\n if(dots[i].real()>bx&&!EQ(dots[i].real(),bx)){\\n nxtBpos=i;\\n break;\\n }\\n }\\n for(int i=0;i<=n+1;i++){\\n if(dots[i].real()>ax&&!EQ(dots[i].real(),ax)){\\n nxtApos=i;\\n break;\\n }\\n }\\n //bool rev=false;\\n //if(ax>bx){\\n // swap(ax,bx);\\n // swap(nxtApos,nxtBpos);\\n // rev=true;\\n //}\\n // nxtBposツつェnツづ可づ按づゥツづ慊づ堕アツつッツづゥ\\n while(nxtBpos!=n+2&&nxtApos!=n+2){\\n // ツ篠淞づ個湘ェツ渉環づ鳴づ個仰猟猟」ツつェツ渉ャツつウツつ「ツづ個づ債づつソツづァツつゥ\\n double adis=dots[nxtApos].real()-ax;\\n double bdis=dots[nxtBpos].real()-bx;\\n double dis=min(adis,bdis);\\n double t=ax+dis;\\n double s=ax;\\n sum+=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,t,r);\\n sum-=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,s,r);\\n //if(rev){\\n // t=bx+dis;\\n // s=bx;\\n // sum+=calc(co[nxtBpos-1].first,co[nxtBpos-1].second,co[nxtApos-1].first,co[nxtApos-1].second,t,r);\\n // sum-=calc(co[nxtBpos-1].first,co[nxtBpos-1].second,co[nxtApos-1].first,co[nxtApos-1].second,s,r);\\n //}\\n //else{\\n // sum+=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,t,r);\\n // sum-=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,s,r);\\n //}\\n ax+=dis;bx+=dis;\\n if(EQ(adis,bdis)){\\n nxtApos++;\\n nxtBpos++;\\n }\\n else if(adis<bdis)nxtApos++;\\n else nxtBpos++;\\n }\\n printf(\\\"%.10f\\\\n\\\",sum);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 992,\n \"score_of_the_acc\": -0.0796,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2034_357723\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <cmath>\\n#include <cstring>\\n\\nusing namespace std;\\n\\nconst double EPS=(1e-10);\\nbool EQ(double a,double b){\\n return abs(a-b)<EPS;\\n}\\n\\ntypedef complex<double> P;\\ntypedef pair<double,double> pdd;\\n\\ndouble calc(double a1,double b1,double a2,double b2,double x,double r){\\n return (a2*a1*x*x*x)/3.0+(x*x*(a1*a2*r+b2*a1+a2*b1))/2.0+(a2*b1*r+b1*b2)*x;\\n}\\n\\nint main(){\\n int n;\\n double r;\\n while(cin>>n>>r&&!(n==0&&EQ(r,0))){\\n vector<P> dots;\\n vector<pdd> co;\\n dots.push_back(P(-1000,0));\\n for(int i=0;i<n;i++){\\n double x,y;\\n cin>>x>>y;\\n dots.push_back(P(x,y));\\n }\\n dots.push_back(P(1000,0));\\n double sum=0;\\n for(int i=1;i<=n+1;i++){\\n double a=(dots[i-1].imag()-dots[i].imag())/(dots[i-1].real()-dots[i].real());\\n double b=dots[i-1].imag()-a*dots[i-1].real();\\n co.push_back(pdd(a,b));\\n }\\n double ax=dots[1].real();\\n double bx=ax+r;\\n int nxtApos=n+2;\\n int nxtBpos=n+2;\\n // rツづ個値ツつェツづづ個凝ヲツ甘板づ可甘慊づ慊づェツづつ「ツづゥツつゥツづーツ探ツ催オ\\n for(int i=0;i<=n+1;i++){\\n if(dots[i].real()>bx&&!EQ(dots[i].real(),bx)){\\n nxtBpos=i;\\n break;\\n }\\n }\\n for(int i=0;i<=n+1;i++){\\n if(dots[i].real()>ax&&!EQ(dots[i].real(),ax)){\\n nxtApos=i;\\n break;\\n }\\n }\\n bool rev=false;\\n if(ax>bx){\\n swap(ax,bx);\\n swap(nxtApos,nxtBpos);\\n rev=true;\\n }\\n // nxtBposツつェnツづ可づ按づゥツづ慊づ堕アツつッツづゥ\\n while(nxtBpos!=n+2){\\n // ツ篠淞づ個湘ェツ渉環づ鳴づ個仰猟猟」ツつェツ渉ャツつウツつ「ツづ個づ債づつソツづァツつゥ\\n double adis=dots[nxtApos].real()-ax;\\n double bdis=dots[nxtBpos].real()-bx;\\n double dis=min(adis,bdis);\\n double t=ax+dis;\\n double s=ax;\\n if(rev){\\n t=bx+dis;\\n s=bx;\\n sum+=calc(co[nxtBpos-1].first,co[nxtBpos-1].second,co[nxtApos-1].first,co[nxtApos-1].second,t,r);\\n sum-=calc(co[nxtBpos-1].first,co[nxtBpos-1].second,co[nxtApos-1].first,co[nxtApos-1].second,s,r);\\n }\\n else{\\n sum+=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,t,r);\\n sum-=calc(co[nxtApos-1].first,co[nxtApos-1].second,co[nxtBpos-1].first,co[nxtBpos-1].second,s,r);\\n }\\n ax+=dis;bx+=dis;\\n if(EQ(adis,bdis)){\\n nxtApos++;\\n nxtBpos++;\\n }\\n else if(adis<bdis)nxtApos++;\\n else nxtBpos++;\\n }\\n printf(\\\"%.10f\\\\n\\\",sum);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 992,\n \"score_of_the_acc\": -0.0796,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2034_355197\",\n \"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\\nstruct P {\\n double x, y;\\n bool f;\\n P(double x, double y, bool f) : x(x), y(y), f(f) {}\\n};\\nbool operator<(const P &a, const P &b) {\\n return a.x!=b.x?a.x<b.x : a.y<b.y;\\n}\\n\\ndouble X[100];\\ndouble Y[100];\\nint n;\\n\\ndouble func(double x) {\\n if (x<=X[0] || x>=X[n-1]) return 0;\\n int q = upper_bound(X, X+n, x) - X;\\n int p = q-1;\\n return (Y[q]-Y[p])/(X[q]-X[p])*(x-X[p])+Y[p];\\n}\\n\\nint main() {\\n double r;\\n while(cin>>n>>r,n) {\\n vector<P> v;\\n REP(i, n) {\\n cin >> X[i] >> Y[i];\\n v.push_back(P(X[i], Y[i], 0));\\n v.push_back(P(X[i]-r, Y[i], 1));\\n }\\n sort(ALL(v));\\n double ans = 0;\\n REP(i, v.size()-1) {\\n double a = v[i].x;\\n double b = v[i+1].x;\\n double c = (a+b)/2;\\n double fa = func(a)*func(a+r);\\n double fb = func(b)*func(b+r);\\n double fc = func(c)*func(c+r);\\n ans += (b-a)/6*(fa+4*fc+fb);\\n }\\n printf(\\\"%.10f\\\\n\\\",ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 992,\n \"score_of_the_acc\": -0.0856,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2034_256348\",\n \"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 double EPS=1e-9;\\n\\nstruct Point{ double x,y; };\\n\\nint n;\\nPoint _f[100],_g[100];\\n\\ndouble f(double x){\\n\\tif(x<_f[0].x) return 0;\\n\\trep(i,n-1){\\n\\t\\tdouble x1=_f[i].x,x2=_f[i+1].x;\\n\\t\\tdouble y1=_f[i].y,y2=_f[i+1].y;\\n\\t\\tif(x<x2) return (y2-y1)/(x2-x1)*(x-x1)+y1;\\n\\t}\\n\\treturn 0;\\n}\\n\\ndouble g(double x){\\n\\tif(x<_g[0].x) return 0;\\n\\trep(i,n-1){\\n\\t\\tdouble x1=_g[i].x,x2=_g[i+1].x;\\n\\t\\tdouble y1=_g[i].y,y2=_g[i+1].y;\\n\\t\\tif(x<x2) return (y2-y1)/(x2-x1)*(x-x1)+y1;\\n\\t}\\n\\treturn 0;\\n}\\n\\nint main(){\\n\\tfor(double r;scanf(\\\"%d%lf\\\",&n,&r),n;){\\n\\t\\tdouble ev[200];\\n\\t\\trep(i,n){\\n\\t\\t\\tint x,y; scanf(\\\"%d%d\\\",&x,&y);\\n\\t\\t\\t_f[i]=(Point){x,y};\\n\\t\\t\\t_g[i]=(Point){x+r,y};\\n\\t\\t\\tev[2*i+0]=x;\\n\\t\\t\\tev[2*i+1]=x+r;\\n\\t\\t}\\n\\t\\tsort(ev,ev+2*n);\\n\\n\\t\\tdouble ans=0;\\n\\t\\trep(i,2*n-1){\\n\\t\\t\\tdouble x1=ev[i],x2=ev[i+1];\\n\\t\\t\\tif(x2-x1<EPS) continue;\\n\\n\\t\\t\\tdouble f1=f(x1),f2=f(x2),g1=g(x1),g2=g(x2);\\n\\t\\t\\tdouble af=(f2-f1)/(x2-x1),bf=f1-af*x1;\\n\\t\\t\\tdouble ag=(g2-g1)/(x2-x1),bg=g1-ag*x1;\\n\\t\\t\\tans+=af*ag*(x2*x2*x2-x1*x1*x1)/3+(af*bg+bf*ag)*(x2*x2-x1*x1)/2+bf*bg*(x2-x1);\\n\\t\\t}\\n\\t\\tprintf(\\\"%.15f\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 820,\n \"score_of_the_acc\": -0.0179,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2034_256327\",\n \"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;\\n\\nnamespace std{\\n\\tbool operator <(const Point &a,const Point &b){\\n\\t\\treturn abs(a.real()-b.real())<EPS?(a.imag()+EPS<b.imag()):(a.real()+EPS<b.real());\\n\\t}\\n}\\n\\nclass Line:public vector<Point>{\\npublic:\\n\\tLine(){}\\n\\tLine(const Point &a,const Point &b){ push_back(a), push_back(b); }\\n};\\n\\nclass Segment:public Line{\\npublic:\\n\\tSegment(){}\\n\\tSegment(const Point &a,const Point &b):Line(a,b){}\\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\\nenum {CCW=1,CW=-1,ON=0};\\nint ccw(const Point &a,Point b,Point c){\\n\\tb-=a, c-=a;\\n\\tdouble rotdir=cross(b,c);\\n\\tif(rotdir>EPS) return CCW;\\n\\tif(rotdir<-EPS) return CW;\\n\\treturn ON;\\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\\nbool cover(const Segment &s,const Point &p){\\n\\treturn dot(s[0]-p,s[1]-p)<EPS;\\n}\\n\\nbool intersect(const Segment &s,const Segment &t,Point *p){\\n\\tbool flg;\\n\\tif(abs(cross(s[1]-s[0],t[1]-t[0]))<EPS && abs(cross(s[1]-s[0],t[0]-s[0]))<EPS){\\n\\t\\tflg=(cover(s,t[0]) || cover(s,t[1]) || cover(t,s[0]) || cover(t,s[1]));\\n\\t\\tif(!flg) return false;\\n\\t}\\n\\n\\tif(flg || (ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1])<=0\\n\\t\\t\\t&& ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1])<=0)){\\n\\t\\tdouble a1,b1,c1,a2,b2,c2;\\n\\t\\tcalc_abc(s,a1,b1,c1);\\n\\t\\tcalc_abc(t,a2,b2,c2);\\n\\t\\tdouble det=a1*b2-a2*b1;\\n\\t\\tif(abs(det)<EPS){ // s is parallel to t\\n\\t\\t\\tPoint q[3]={s[0],s[1],t[0]};\\n\\t\\t\\trep(i,3){\\n\\t\\t\\t\\tif(cover(s,q[i]) && cover(t,q[i])){\\n\\t\\t\\t\\t\\t*p=q[i];\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse *p=Point(b1*c2-b2*c1,a2*c1-a1*c2)/det;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nint n;\\nPoint _f[100],_g[100];\\n\\ndouble f(double x){\\n\\tif(x<_f[0].real()) return 0;\\n\\trep(i,n-1){\\n\\t\\tdouble x1=_f[i].real(),x2=_f[i+1].real();\\n\\t\\tdouble y1=_f[i].imag(),y2=_f[i+1].imag();\\n\\t\\tif(x<x2) return (y2-y1)/(x2-x1)*(x-x1)+y1;\\n\\t}\\n\\treturn 0;\\n}\\n\\ndouble g(double x){\\n\\tif(x<_g[0].real()) return 0;\\n\\trep(i,n-1){\\n\\t\\tdouble x1=_g[i].real(),x2=_g[i+1].real();\\n\\t\\tdouble y1=_g[i].imag(),y2=_g[i+1].imag();\\n\\t\\tif(x<x2) return (y2-y1)/(x2-x1)*(x-x1)+y1;\\n\\t}\\n\\treturn 0;\\n}\\n\\nint main(){\\n\\tfor(double r;scanf(\\\"%d%lf\\\",&n,&r),n;){\\n\\t\\tvector<double> ev;\\n\\t\\trep(i,n){\\n\\t\\t\\tint x,y; scanf(\\\"%d%d\\\",&x,&y);\\n\\t\\t\\t_f[i]=Point(x,y);\\n\\t\\t\\t_g[i]=Point(x+r,y);\\n\\t\\t\\tev.push_back(x);\\n\\t\\t\\tev.push_back(x+r);\\n\\t\\t}\\n\\n\\t\\trep(i,n-1) rep(j,n-1) {\\n\\t\\t\\tPoint p;\\n\\t\\t\\tif(intersect(Segment(_f[i],_f[i+1]),Segment(_g[i],_g[i+1]),&p)){\\n\\t\\t\\t\\tev.push_back(p.real());\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tsort(_f,_f+n);\\n\\t\\tsort(_g,_g+n);\\n\\t\\tsort(ev.begin(),ev.end());\\n\\n\\t\\tdouble ans=0;\\n\\t\\trep(i,ev.size()-1){\\n\\t\\t\\tdouble x1=ev[i],x2=ev[i+1];\\n\\t\\t\\tif(x2-x1<EPS) continue;\\n\\t\\t\\tdouble f1=f(x1),f2=f(x2),g1=g(x1),g2=g(x2);\\n\\t\\t\\tdouble af=(f2-f1)/(x2-x1),bf=f1-af*x1;\\n\\t\\t\\tdouble ag=(g2-g1)/(x2-x1),bg=g1-ag*x1;\\n\\t\\t\\tans+=af*ag*(x2*x2*x2-x1*x1*x1)/3+(af*bg+bf*ag)*(x2*x2-x1*x1)/2+bf*bg*(x2-x1);\\n\\t\\t}\\n\\t\\tprintf(\\\"%.15f\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 924,\n \"score_of_the_acc\": -0.4897,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2034_112053\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\nusing namespace std;\\n#define REP(i,b,n) for(int i=b;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nclass EQ{\\npublic:\\n double a,b;\\n double xs,xe;\\n};\\n\\ndouble compute(double a,double b,double c,double x){\\n return a*x*x*x+b*x*x+c*x;\\n}\\n\\ndouble integ(double ai,double bi,double aj,double bj,double xs,double xe){\\n double ta=compute((ai*aj)/3,(ai*bj+aj*bi)/2,bi*bj,xs);\\n double tb=compute((ai*aj)/3,(ai*bj+aj*bi)/2,bi*bj,xe);\\n return tb-ta;\\n}\\n\\nbool have_common(double xs1,double xe1,double xs2,double xe2){\\n if ((xs2 <= xs1 && xs1 <= xe2)||\\n (xs2 <= xe1 && xe1 <= xe2)||\\n (xs1 <= xs2 && xs2 <= xe1)||\\n (xs1 <= xe2 && xe2 <= xe1))return true;\\n else return false;\\n}\\n\\ndouble solve(vector<EQ> &in,double r){\\n int n = in.size();\\n double ans = 0;\\n rep(i,n){\\n double xs=in[i].xs+r,xe=in[i].xe+r;\\n rep(j,n){\\n //cout << xs <<\\\" \\\" << xe << endl;\\n if (have_common(xs,xe,in[j].xs,in[j].xe)){\\n double cxs=max(xs,in[j].xs),cxe=min(xe,in[j].xe);\\n // cout <<\\\"test :\\\" << cxs-r <<\\\" \\\" << cxe-r <<\\n // \\\" \\\" << integ(in[i].a,in[i].b,in[j].a,in[j].b+r*in[j].a,cxs-r,cxe-r) <<\\\" test end \\\" << endl;\\n\\n ans+= integ(in[i].a,in[i].b,in[j].a,in[j].b+r*in[j].a,cxs-r,cxe-r);\\n if (xe < in[j].xe)break;\\n else xs=in[j].xe;\\n }\\n }\\n }\\n return ans;\\n}\\n\\n\\nmain(){\\n int n;\\n double r;\\n while(cin>>n>>r && n){\\n vector<double> x,y;\\n vector<EQ>in;\\n rep(i,n){\\n double tx,ty;\\n cin>>tx>>ty;\\n x.push_back(tx);\\n y.push_back(ty);\\n }\\n\\n EQ ins;\\n rep(i,n-1){\\n ins.xs=x[i];ins.xe=x[i+1];\\n ins.a=(y[i+1]-y[i])/(x[i+1]-x[i]);\\n ins.b=-ins.a*x[i]+y[i];\\n in.push_back(ins);\\n }\\n\\n printf(\\\"%.10lf\\\\n\\\",solve(in,r));\\n }\\n return false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 996,\n \"score_of_the_acc\": -0.087,\n \"final_rank\": 7\n }\n]","isConversational":false}}},{"rowIdx":1069,"cells":{"group_id":{"kind":"string","value":"aoj_2035_cpp"},"problem_description":{"kind":"string","value":"Problem F:\nIt Prefokery Pio\nYou are a member of a secret society named\nJapanese Abekobe Group\n, which is called J. A. G. for short.\nThose who belong to this society often exchange encrypted messages. You received lots of encrypted\nmessages this morning, and you tried to decrypt them as usual. However, because you received so many\nand long messages today, you had to give up decrypting them by yourself. So you decided to decrypt\nthem with the help of a computer program that you are going to write.\nThe encryption scheme in J. A. G. utilizes palindromes. A palindrome is a word or phrase that reads\nthe same in either direction. For example, “MADAM”, “REVIVER” and “SUCCUS” are palindromes,\nwhile “ADAM”, “REVENGE” and “SOCCER” are not.\nSpecifically to this scheme, words and phrases made of only one or two letters are not regarded as\npalindromes. For example, “A” and “MM” are not regarded as palindromes.\nThe encryption scheme is quite simple: each message is encrypted by inserting extra letters in such a\nway that the longest one among all subsequences forming palindromes gives the original message. In\nother words, you can decrypt the message by extracting the\nlongest palindrome subsequence\n. Here, a\nsubsequence means a new string obtained by picking up some letters from a string without altering the\nrelative positions of the remaining letters. For example, the longest palindrome subsequence of a string\n“YMAOKDOAMIMHAADAMMA” is “MADAMIMADAM” as indicated below by underline.\nNow you are ready for writing a program.\nInput\nThe input consists of a series of data sets. Each data set contains a line made of up to 2,000 capital\nletters which represents an encrypted string.\nThe end of the input is indicated by EOF (end-of-file marker).\nOutput\nFor each data set, write a decrypted message in a separate line. If there is more than one decrypted\nmessage possible (i.e. if there is more than one palindrome subsequence not shorter than any other ones),\nyou may write any of the possible messages.\nYou can assume that the length of the longest palindrome subsequence of each data set is always longer\nthan two letters.\nSample Input\nYMAOKDOAMIMHAADAMMA\nLELVEEL\nOutput for the Sample Input\nMADAMIMADAM\nLEVEL"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2035_10722445","code_snippet":"#include<bits/stdc++.h>\n//#include<atcoder/all>\nusing namespace std;\n//using namespace atcoder;\n\nusing ll = long long;\nusing ld = long double;\n\n//using mint = modint998244353;\n//using mint = modint1000000007;\n\ntemplate<class T> using pq = priority_queue<T>; //大きい順\ntemplate<class T> using pq_g = priority_queue<T, vector<T>, greater<T>>; //小さい順\n\n#define vec_unique(v) v.erase(unique(v.begin(), v.end()), v.end()) //重複削除\n#define vec_iota(v) iota(v.begin(), v.end(), 0) //0, 1, 2, 3, ..., n - 1にセット\n\nint dx[4] = {1, -1, 0, 0};\nint dy[4] = {0, 0, 1, -1};\n//int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};\n//int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};\n\n#define INF 2e18\n#define INF2 2e9\n\nint main() {\n string s;\n while(cin >> s) {\n string t = s;\n reverse(t.begin(), t.end());\n int n = s.size();\n int m = t.size();\n vector<vector<int>> dp(n + 1, vector<int>(m + 1));\n for(int i = 1; i <= n; i++) {\n for(int j = 1; j <= m; j++) {\n if(s[i - 1] == t[j - 1]) {\n dp[i][j] = dp[i - 1][j - 1] + 1;\n } else {\n dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);\n }\n }\n }\n\n //cout << dp[n][m] << endl;\n\n //LCSを復元\n int i = n;\n int j = m;\n string ans = \"\";\n while(i > 0 && j > 0) {\n if(s[i - 1] == t[j - 1]) {\n ans = s[i - 1] + ans;\n i--;\n j--;\n } else {\n if(dp[i][j] == dp[i][j - 1]) j--;\n else i--;\n }\n }\n cout << ans << endl;\n }\n //cout << fixed << setprecision(15) << << endl;\n return 0;\n}","accuracy":1,"time_ms":400,"memory_kb":18752,"score_of_the_acc":-0.2671,"final_rank":5},{"submission_id":"aoj_2035_10694366","code_snippet":"// competitive-verifier: PROBLEM\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#if !defined(ATCODER) && !defined(EVAL)\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\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 = 3.14159265358979323846;\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 (std::int64_t i = (m); i < std::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()\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 constexpr void operator()() const {}\n} sonic;\nstruct increment_impl {\n template <class T>\n const increment_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) ++x;\n return *this;\n }\n} Inc;\nstruct decrement_impl {\n template <class T>\n const decrement_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) --x;\n return *this;\n }\n} Dec;\nstruct sort_impl {\n template <class T>\n const sort_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n return *this;\n }\n} Sort;\nstruct unique_impl {\n template <class T>\n const unique_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n v.erase(std::unique(v.begin(), v.end()), v.end());\n return *this;\n }\n} Uniq;\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) os << (it == v.begin() ? \"\" : \" \") << *it;\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}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\nint main(void) {\n string s;\n while (cin >> s) {\n int n = s.size();\n vector dp(n + 1, vector(n + 1, 0));\n rep (i, n) dp[i][i + 1] = 1;\n FOR (d, 2, n + 1) {\n rep (l, n) {\n int r = l + d;\n if (r > n)\n break;\n dp[l][r] = max(dp[l + 1][r], dp[l][r - 1]);\n if (s[l] == s[r - 1])\n chmax(dp[l][r], dp[l + 1][r - 1] + 2);\n }\n }\n string ans, rev;\n int l = 0, r = n;\n while (dp[l][r] > 0 && r - l > 1) {\n if (dp[l + 1][r - 1] + 2 == dp[l][r] && s[l] == s[r - 1]) {\n ans += s[l];\n rev += s[r - 1];\n ++l, --r;\n } else if (dp[l][r - 1] == dp[l][r]) {\n --r;\n } else {\n ++l;\n }\n }\n if (dp[l][r] > 0 && r - l > 0)\n ans += s[l];\n reverse(all(rev));\n ans += rev;\n co(ans);\n }\n return 0;\n}","accuracy":1,"time_ms":310,"memory_kb":19120,"score_of_the_acc":-0.2509,"final_rank":3},{"submission_id":"aoj_2035_9666177","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nint longestCommonSubsequence(string s1, string s2) {\n int m = s1.length();\n int n = s2.length();\n vector<vector<int>> dp(m+1, vector<int>(n+1, 0));\n \n for (int i=1; i<=m; i++) {\n for (int j=1; j<=n; j++) {\n if (s1[i-1] == s2[j-1]) {\n dp[i][j] = 1 + dp[i-1][j-1];\n } else {\n dp[i][j] = max(dp[i-1][j], dp[i][j-1]);\n }\n }\n }\n \n return dp[m][n];\n}\n\nvoid printLCS(string s1, string s2) {\n int m = s1.length();\n int n = s2.length();\n vector<vector<int>> dp(m+1, vector<int>(n+1, 0));\n \n for (int i=1; i<=m; i++) {\n for (int j=1; j<=n; j++) {\n if (s1[i-1] == s2[j-1]) {\n dp[i][j] = 1 + dp[i-1][j-1];\n } else {\n dp[i][j] = max(dp[i-1][j], dp[i][j-1]);\n }\n }\n }\n \n string lcs;\n int i = m;\n int j = n;\n \n while (i > 0 && j > 0) {\n if (s1[i-1] == s2[j-1]) {\n lcs.push_back(s1[i-1]);\n i--;\n j--;\n } else if (dp[i-1][j] > dp[i][j-1]) {\n i--;\n } else {\n j--;\n }\n }\n \n for (int i=lcs.length()-1; i>=0; i--) {\n cout << lcs[i];\n }\n cout << endl;\n}\n\nint main() {\n string s;\n while (cin >> s) {\n string sReverse = s;\n reverse(sReverse.begin(), sReverse.end());\n printLCS(s, sReverse);\n }\n return 0;\n}","accuracy":1,"time_ms":460,"memory_kb":18832,"score_of_the_acc":-0.2857,"final_rank":6},{"submission_id":"aoj_2035_9666162","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nstring t;\nstring s;\nint dp[2001][2001];\nint lcs(int i , int j) {\n if(i == s.size() || j == t.size())return 0;\n int &res = dp[i][j];\n if(~res)return res;\n res = 0;\n if(s[i] == t[j])res = 1 + lcs(i + 1 , j + 1);\n else res = max(lcs(i + 1 , j) , lcs(i , j + 1));\n return res;\n}\nvoid build(int i , int j) {\n if(i == s.size() || j == t.size())return;\n if(s[i] == t[j]) {\n cout<<s[i];\n build(i + 1 , j + 1);\n }else {\n if(dp[i][j] == lcs(i + 1 ,j))build(i + 1 , j);\n else build(i , j + 1);\n }\n}\nsigned main() {\n ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);\n while(cin>>s) {\n t = s;\n for(int i = 0;i < s.size();i++) {\n for(int j = 0;j < t.size();j++)\n dp[i][j] = -1;\n }\n reverse(t.begin() , t.end());\n int temp = lcs(0 , 0);\n build(0 , 0);\n cout<<'\\n';\n }\n}","accuracy":1,"time_ms":800,"memory_kb":19188,"score_of_the_acc":-0.3887,"final_rank":9},{"submission_id":"aoj_2035_5934296","code_snippet":"#include <string>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nstring s; int dp[2009][2009];\nint main() {\n while (cin >> s) {\n int n = s.size();\n for (int i = 0; i < n; i++) dp[i][i + 1] = 1;\n for (int i = 2; i <= n; i++) {\n for (int l = 0; l <= n - i; l++) {\n int r = l + i;\n dp[l][r] = max(dp[l + 1][r], dp[l][r - 1]);\n if (s[l] == s[r - 1]) dp[l][r] = max(dp[l][r], dp[l + 1][r - 1] + 2);\n }\n }\n string ret;\n int pl = 0, pr = n;\n while (pr - pl >= 2) {\n if (s[pl] == s[pr - 1] && dp[pl][pr] == dp[pl + 1][pr - 1] + 2) ret += s[pl], pl++, pr--;\n else if (dp[pl][pr] == dp[pl + 1][pr]) pl++;\n else pr--;\n }\n string ps = ret;\n if (pr - pl == 1) ps += s[pl];\n reverse(ret.begin(), ret.end());\n ps += ret;\n cout << ps << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":18444,"score_of_the_acc":-0.1819,"final_rank":1},{"submission_id":"aoj_2035_4641340","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// #define int long long\n#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)\n#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)\n#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)\n#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)\n#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)\n#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)\n#define SORT(v, n) sort(v, v + n);\n#define REVERSE(v, n) reverse(v, v+n);\n#define vsort(v) sort(v.begin(), v.end());\n#define all(v) v.begin(), v.end()\n#define mp(n, m) make_pair(n, m);\n#define cout(d) cout<<d<<endl;\n#define coutd(d) cout<<std::setprecision(10)<<d<<endl;\n#define cinline(n) getline(cin,n);\n#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);\n#define PI (acos(-1))\n#define FILL(v, n, x) fill(v, v + n, x);\n#define sz(x) long long(x.size())\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing vs = vector<string>;\nusing vpll = vector<pair<ll, ll>>;\nusing vtp = vector<tuple<ll,ll,ll>>;\nusing vb = vector<bool>;\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nconst ll INF = 1e9;\nconst ll MOD = 1e9+7;\nconst ll LINF = 1e18;\n\nll dp[2005][2005]; // [l,r)における回文の最大長\nstring s;\n\nvoid solve(){\n ll n=s.size();\n \n memset(dp,0,sizeof(dp));\n rep(i,n) dp[i][i+1]=1;\n \n for(ll len=2; len<=n; len++){\n for(ll i=0; i+len<=n; i++){\n ll j=i+len;\n if(s[i]==s[j-1]) chmax(dp[i][j],dp[i+1][j-1]+2);\n else chmax(dp[i][j],max(dp[i+1][j],dp[i][j-1]));\n }\n }\n \n ll ma=0, l,r;\n rep(i,n) irep(j,i,n+1){\n if(chmax(ma,dp[i][j])) l=i, r=j;\n }\n \n // cout<<dp[0][n]<<' '<<ma<<endl;\n \n if(ma==1){\n cout<<s[0]<<endl;\n return;\n }\n \n string left=\"\", right=\"\";\n while(ma>0){\n while(dp[l+1][r]==ma) l++;\n while(dp[l][r-1]==ma) r--;\n left+=s[l], right+=s[l];\n // cout<<l<<' '<<r<<' '<<ma<<endl;\n ma-=2;\n if(ma==1){\n left+=s[l+1];\n ma--;\n }\n l++, r--;\n }\n\n reverse(all(right));\n string ans=left+right;\n cout<<ans<<endl;\n \n return;\n}\n\n\nsigned main()\n{\n cin.tie( 0 ); ios::sync_with_stdio( false );\n \n for(int t = 0; cin >> s; t++) {\n solve();\n }\n \n}","accuracy":1,"time_ms":980,"memory_kb":34620,"score_of_the_acc":-0.8092,"final_rank":14},{"submission_id":"aoj_2035_3947480","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\n\n\nint cal_longest_palindrome_subsequence(const std::string& str, const int left, const int right, std::vector<std::vector<int>>& memo) {\n\tif (left > right) return 0;\n\tif (left == right) return 1;\n\tif (memo[left][right - left - 1] >= 0) return memo[left][right - left - 1];\n\tif (str[left] == str[right]) memo[left][right - left - 1] = cal_longest_palindrome_subsequence(str, left + 1, right - 1, memo) + 2;\n\treturn memo[left][right - left - 1] = std::max({ memo[left][right - left - 1], cal_longest_palindrome_subsequence(str, left + 1, right, memo), cal_longest_palindrome_subsequence(str, left, right - 1, memo) });\n}\nstd::string make_longest_palindorome(const std::string& str) {\n\tstd::string prev_half;\n\tstd::vector<std::vector<int>> memo; memo.reserve(str.size());\n\tfor (auto i = 0; i < str.size(); ++i) memo.push_back(std::vector<int>(str.size() - i, -1));\n\tfor (int left = 0, right = str.size() - 1; left <= right; ) {\n\t\tif (str[left] == str[right]) {\n\t\t\tprev_half.push_back(str[left]); ++left; --right;\n\t\t}\n\t\telse if (cal_longest_palindrome_subsequence(str, left + 1, right, memo) > cal_longest_palindrome_subsequence(str, left, right - 1, memo)) {\n\t\t\t++left;\n\t\t}\n\t\telse {\n\t\t\t--right;\n\t\t}\n\t}\n\tconst auto result_length = cal_longest_palindrome_subsequence(str, 0, str.size() - 1, memo);\n\tif (result_length % 2 == 1) {\n\t\tfor (int i = prev_half.size() - 2; i >= 0; --i) prev_half.push_back(prev_half[i]);\n\t}\n\telse {\n\t\tfor (int i = prev_half.size() - 1; i >= 0; --i) prev_half.push_back(prev_half[i]);\n\t}\n\treturn prev_half;\n}\n\nint main() {\n\tstd::string str;\n\twhile (std::cin >> str) {\n\t\tstd::cout << make_longest_palindorome(str) << '\\n';\n\t}\n}","accuracy":1,"time_ms":1050,"memory_kb":10868,"score_of_the_acc":-0.2583,"final_rank":4},{"submission_id":"aoj_2035_2859269","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 solve(int l, int r, const string& st,vector<vector<int>>&memo,vector<vector<int>>&flags) {\n\tif (memo[l][r] == -1) {\n\t\tif(l==r)memo[l][r]=0;\n\t\telse if(l+1==r)memo[l][r]=1;\n\t\telse {\n\n\t\t\tif (st[l] == st[r - 1]) {\n\t\t\t\tmemo[l][r]=2+solve(l+1,r-1,st,memo,flags);\n\t\t\t\tflags[l][r]=3;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tint lk=solve(l+1,r,st,memo,flags);\n\t\t\t\tint rk=solve(l,r-1,st,memo,flags);\n\n\t\t\t\tif (lk > rk) {\n\t\t\t\t\tflags[l][r]=2;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tflags[l][r]=1;\n\t\t\t\t}\n\t\t\t\tmemo[l][r]=max(lk,rk);\n\t\t\t}\n\t\t}\n\t}\n\treturn memo[l][r];\n}\n\nint main() {\n\tstring st;\n\twhile (cin>>st) {\n\t\tvector<vector<int>>memo(st.size()+1,vector<int>(st.size()+1,-1)),flags(st.size()+1,vector<int>(st.size()+1));\n\t\tint ans=solve(0,st.size(),st,memo,flags);\n\t\tstring ans_st1,ans_st2;\n\n\t\tint al=0;\n\t\tint ar=st.size();\n\t\twhile (true) {\n\t\t\tint num=flags[al][ar];\n\t\t\tif (num == 3) {\n\t\t\t\tans_st1.push_back(st[al]);\n\t\t\t\tans_st2.push_back(st[ar-1]);\n\t\t\t\tal++;\n\t\t\t\tar--;\n\t\t\t}\n\t\t\telse if (num == 2) {\n\t\t\t\tal++;\n\t\t\t}\n\t\t\telse if (num == 1) {\n\t\t\t\tar--;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (al + 1 == ar) {\n\t\t\t\t\tans_st1.push_back(st[al]);\n\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\treverse(ans_st2.begin(),ans_st2.end());\n\t\tcout<<ans_st1<<ans_st2<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1110,"memory_kb":34304,"score_of_the_acc":-0.8378,"final_rank":15},{"submission_id":"aoj_2035_2614244","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nstring s,t;\nint dp[2011][2011];\nint used[2011][2011];\nstring solve(){\n string ans=\"\";\n int i=s.size()-1;\n int j=t.size()-1;\n while(i>0&&j>0){\n if(used[i][j]==1)ans+=t[j],i--,j--;\n else if(used[i][j]==2)i--;\n else j--;\n }\n return ans;\n}\nint main(){\n while(cin>>s){\n memset(dp,0,sizeof(dp));\n memset(used,0,sizeof(used));\n t=s;\n reverse(s.begin(),s.end());\n t=\"@\"+t;\n s=\"@\"+s;\n for(int i=1;i<s.size();i++)\n for(int j=1;j<t.size();j++)\n if(s[i]==t[j]){\n if(dp[i-1][j]>=dp[i-1][j-1]+1) dp[i][j]=max(dp[i][j],dp[i-1][j]),used[i][j]=2;\n \n else dp[i][j]=max(dp[i][j],dp[i-1][j-1]+1),used[i][j]=1;\n }\n else{\n if(dp[i-1][j]>=dp[i][j-1])dp[i][j]=max(dp[i][j],dp[i-1][j]),used[i][j]=2;\n else dp[i][j]=max(dp[i][j],dp[i][j-1]),used[i][j]=3;\n }\n cout<<solve()<<endl;\n }\n}","accuracy":1,"time_ms":770,"memory_kb":34612,"score_of_the_acc":-0.7507,"final_rank":12},{"submission_id":"aoj_2035_2558030","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\n\nint dp[2001][2001];\nint memo[2001][2001];\n\nint main(){\n\n\tint length;\n\tchar buf[2001],reverse[2001];\n\tstack<char> ANS;\n\n\twhile(scanf(\"%s\",buf) != EOF){\n\n\t\tfor(length = 0; buf[length] != '\\0'; length++);\n\n\t\tfor(int i = 0; i < length; i++){\n\t\t\treverse[i] = buf[length-1-i];\n\t\t}\n\t\treverse[length] = '\\0';\n\n\t\tfor(int i = 0; i <= length; i++){\n\t\t\tfor(int k = 0; k <= length; k++){\n\t\t\t\tdp[i][k] = 0;\n\t\t\t}\n\t\t}\n\n\t\tfor(int i = 0; i < length; i++){\n\t\t\tfor(int k = 0; k < length; k++){\n\t\t\t\tif(buf[i] == reverse[k]){\n\t\t\t\t\tdp[i+1][k+1] = dp[i][k]+1;\n\t\t\t\t\tmemo[i+1][k+1] = 0;\n\t\t\t\t}else{\n\t\t\t\t\tif(dp[i][k+1] >= dp[i+1][k]){\n\t\t\t\t\t\tdp[i+1][k+1] = dp[i][k+1];\n\t\t\t\t\t\tmemo[i+1][k+1] = 1;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tdp[i+1][k+1] = dp[i+1][k];\n\t\t\t\t\t\tmemo[i+1][k+1] = -1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor(int i = length,k = length; i > 0 && k > 0;){\n\n\t\t\tif(memo[i][k] == 1){\n\t\t\t\ti--;\n\t\t\t}else if(memo[i][k] == -1){\n\t\t\t\tk--;\n\t\t\t}else{ //memo[i][k] == 0\n\t\t\t\tANS.push(buf[i-1]);\n\t\t\t\ti--;\n\t\t\t\tk--;\n\t\t\t}\n\t\t}\n\n\t\twhile(!ANS.empty()){\n\t\t\tprintf(\"%c\",ANS.top());\n\t\t\tANS.pop();\n\t\t}\n\n\t\tprintf(\"\\n\");\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":420,"memory_kb":34288,"score_of_the_acc":-0.6457,"final_rank":10},{"submission_id":"aoj_2035_2179720","code_snippet":"#include<iostream>\n#include<string>\n#include<tuple>\n#include<algorithm>\nusing namespace std;\nstring S; tuple<int, int, int>dp[2100][2100];\nint solve(int s, int t) {\n\tif (s > t)return 0;\n\tif (get<0>(dp[s][t]) != -1)return get<0>(dp[s][t]);\n\tif (s == t) { dp[s][t] = make_tuple(1, -1, -1); return 1; }\n\tif (t - s == 1) {\n\t\tif (S[s] == S[t]) { dp[s][t] = make_tuple(2, -1, -1); return 2; }\n\t}\n\tint c1 = solve(s, t - 1);\n\tint c2 = solve(s + 1, t);\n\tint c3 = solve(s + 1, t - 1); if (S[s] == S[t])c3 += 2;\n\tif (c1 >= c2 && c1 >= c3) { dp[s][t] = make_tuple(c1, s, t - 1); return c1; }\n\tif (c2 >= c1 && c2 >= c3) { dp[s][t] = make_tuple(c2, s + 1, t); return c2; }\n\tif (c3 >= c1 && c3 >= c2) { dp[s][t] = make_tuple(c3, s + 1, t - 1); return c3; }\n}\nint main() {\n\twhile (cin >> S) {\n\t\tfor (int i = 0; i < S.size(); i++) { for (int j = 0; j < S.size(); j++)dp[i][j] = make_tuple(-1, 0, 0); }\n\t\tsolve(0, S.size() - 1);\n\t\tstring V, W; int F = 0, G = S.size() - 1;\n\t\twhile (F + G >= 0) {\n\t\t\tint H = get<1>(dp[F][G]), I = get<2>(dp[F][G]);\n\t\t\tif (H == -1 || ((H - F) + (G - I)) == 2) {\n\t\t\t\tV += S[F]; if (F != G)W += S[F];\n\t\t\t}\n\t\t\tF = H; G = I;\n\t\t}\n\t\treverse(W.begin(), W.end());\n\t\tcout << V + W << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":3150,"memory_kb":52512,"score_of_the_acc":-1.8417,"final_rank":20},{"submission_id":"aoj_2035_2172806","code_snippet":"#include <string>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nstring s; int dp[2009][2009];\nint main() {\n\twhile (cin >> s) {\n\t\tint n = s.size();\n\t\tfor (int i = 0; i < n; i++) dp[i][i + 1] = 1;\n\t\tfor (int i = 2; i <= n; i++) {\n\t\t\tfor (int l = 0; l <= n - i; l++) {\n\t\t\t\tint r = l + i;\n\t\t\t\tdp[l][r] = max(dp[l + 1][r], dp[l][r - 1]);\n\t\t\t\tif (s[l] == s[r - 1]) dp[l][r] = max(dp[l][r], dp[l + 1][r - 1] + 2);\n\t\t\t}\n\t\t}\n\t\tstring ret;\n\t\tint pl = 0, pr = n;\n\t\twhile (pr - pl >= 2) {\n\t\t\tif (s[pl] == s[pr - 1] && dp[pl][pr] == dp[pl + 1][pr - 1] + 2) ret += s[pl], pl++, pr--;\n\t\t\telse if (dp[pl][pr] == dp[pl + 1][pr]) pl++;\n\t\t\telse pr--;\n\t\t}\n\t\tstring ps = ret;\n\t\tif (pr - pl == 1) ps += s[pl];\n\t\treverse(ret.begin(), ret.end());\n\t\tps += ret;\n\t\tcout << ps << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":460,"memory_kb":16756,"score_of_the_acc":-0.2358,"final_rank":2},{"submission_id":"aoj_2035_2127858","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define F first\n#define S second\n#define all(v) (v).begin(), (v).end()\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)\n#define each(a, b) for(auto& a : b)\n\ntypedef pair<int, int> P;\n\nint dp[2010][2010];\nint tr[2010][2010];\n\nsigned main()\n{\n string s;\n while(cin >> s) {\n string t = s; reverse(all(s)); \n memset(dp, 0, sizeof(dp));\n memset(tr, 0, sizeof(dp));\n for(int i = 0; i < s.size(); i++) {\n for(int j = 0; j < t.size(); j++) {\n\tif(s[i] == t[j]) dp[i+1][j+1] = dp[i][j] + 1, tr[i+1][j+1] = 1;\n\telse {\n\t if(dp[i+1][j] > dp[i][j+1]) dp[i+1][j+1] = dp[i+1][j], tr[i+1][j+1] = 2;\n\t else dp[i+1][j+1] = dp[i][j+1], tr[i+1][j+1] = 3;\n\t}\n }\n }\n string x;\n for(int i = s.size(), j = t.size(); i > 0 && j > 0; ) {\n switch(tr[i][j]) {\n case 1: x += s[i-1], i--, j--; break;\n case 2: j--; break;\n case 3: i--; break;\n }\n }\n cout << x << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":770,"memory_kb":34664,"score_of_the_acc":-0.752,"final_rank":13},{"submission_id":"aoj_2035_2127341","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define N 2050\nstring ss[2][N+1];\nint c[N+1][N+1];\nstring lcs(string X,string Y){\n int m = X.size();\n int n = Y.size();\n int maxl = 0;\n X = ' ' + X;\n Y = ' ' + Y;\n ss[0][0] = \"\";\n memset(c,0,sizeof(c));\n for(int i=0;i<N+1;i++) ss[0][i]=ss[1][i]=\"\";\n for(int i=0;i<=m;i++) c[i][0]=0;\n for(int j=1;j<=n;j++) c[0][j]=0;\n for(int i=1;i<=m;i++){\n for(int j=1;j<=n;j++){\n if(X[i]==Y[j]) c[i][j]=c[i-1][j-1]+1, ss[i%2][j] = ss[(i-1)%2][j-1] + X[i];\n else {\n if(c[i-1][j] >= c[i][j-1]) c[i][j]=c[i-1][j], ss[i%2][j] = ss[(i-1)%2][j];\n else c[i][j] = c[i][j-1], ss[i%2][j] = ss[i%2][j-1];\n }\n maxl=max(maxl,c[i][j]);\n }\n }\n string ret=ss[m%2][n],ret2=ret;\n reverse(ret2.begin(),ret2.end());\n //assert(ret==ret2);\n assert((int)ret.size()==maxl);\n return ss[m%2][n];\n}\nint main(){\n string s;\n while(cin >> s) {\n string t = s;\n reverse(t.begin(), t.end());\n cout << lcs(s, t) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":3720,"memory_kb":25592,"score_of_the_acc":-1.3536,"final_rank":19},{"submission_id":"aoj_2035_2127249","code_snippet":"#include<bits/stdc++.h>\n#define N 2005\nusing namespace std;\nstring s,t,ans;\nint dp[N][N];\n\nvoid dfs(int y,int x){\n if(!y||!x)return;\n if(dp[y][x]-dp[y-1][x-1]==1&&dp[y][x]-dp[y-1][x]==1&&dp[y][x]-dp[y][x-1]==1){\n ans+=s[y-1];\n dfs(y-1,x-1);\n return;\n }\n if(dp[y][x-1]==dp[y][x])dfs(y,x-1);\n else dfs(y-1,x);\n}\n\nint main(){\n //IAIDDAII\n\n while(cin>>s){\n //s.resize(8);\n //for(int i=0;i<8;i++) s[i]='A'+(rand())%10;\n t=s;\n reverse(t.begin(),t.end());\n memset(dp,0,sizeof(dp));\n int n=s.size(),m=t.size();\n for(int i=0;i<n;i++){\n for(int j=0;j<m;j++){\n\tif(s[i]==t[j])dp[i+1][j+1]=dp[i][j]+1;\n\telse dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]);\n }\n }\n ans=\"\";\n dfs(n,m);\n if(ans.size()%2==0){\n ans=ans.substr(0,ans.size()/2);\n string tmp=ans;reverse(tmp.begin(),tmp.end());\n ans=ans+tmp;\n }\n else {\n string tmp=ans.substr(0,ans.size()/2);\n reverse(tmp.begin(),tmp.end());\n ans=ans.substr(0,ans.size()/2)+ans[ans.size()/2]+tmp;\n }\n string temp=ans;\n reverse(temp.begin(),temp.end());\n assert(ans==temp);\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":560,"memory_kb":18700,"score_of_the_acc":-0.3103,"final_rank":7},{"submission_id":"aoj_2035_2127221","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define N 2050\nstring ss[2][N+1];\nint c[N+1][N+1];\nstring lcs(string X,string Y){\n int m = X.size();\n int n = Y.size();\n int maxl = 0;\n X = ' ' + X;\n Y = ' ' + Y;\n ss[0][0] = \"\";\n memset(c,0,sizeof(c));\n for(int i=0;i<N+1;i++) ss[0][i]=ss[1][i]=\"\";\n for(int i=0;i<=m;i++) c[i][0]=0;\n for(int j=1;j<=n;j++) c[0][j]=0;\n for(int i=1;i<=m;i++){\n for(int j=1;j<=n;j++){\n if(X[i]==Y[j]) c[i][j]=c[i-1][j-1]+1, ss[i%2][j] = ss[(i-1)%2][j-1] + X[i];\n else {\n\tif(c[i-1][j] >= c[i][j-1]) c[i][j]=c[i-1][j], ss[i%2][j] = ss[(i-1)%2][j];\n\telse c[i][j] = c[i][j-1], ss[i%2][j] = ss[i%2][j-1];\n }\n maxl=max(maxl,c[i][j]);\n }\n }\n string ret=ss[m%2][n],ret2=ret;\n reverse(ret2.begin(),ret2.end());\n //assert(ret==ret2);\n assert((int)ret.size()==maxl);\n return ss[m%2][n];\n}\nint main(){\n string s;\n while(cin >> s) {\n string t = s;\n reverse(t.begin(), t.end());\n cout << lcs(s, t) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":3700,"memory_kb":25592,"score_of_the_acc":-1.348,"final_rank":18},{"submission_id":"aoj_2035_2127209","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\n\nusing namespace std;\n\n#define TOPLEFT 0\n#define TOP 1\n#define LEFT 2\n#define MAX 2000\n\nvoid printLcs(string &l, vector<vector<short> > &b, const string &x, int i, int j, int k){\n if(i==0 || j==0) return;\n if(b[i][j]==TOPLEFT){\n printLcs(l, b, x, i-1, j-1, k-1);\n l[k] = x[i-1];\n }else if(b[i][j]==TOP){\n printLcs(l, b, x, i-1, j, k);\n }else{\n printLcs(l, b, x, i, j-1, k);\n }\n}\n\nvoid lcs(string &x, string &y, string &l){\n int m, n;\n vector<vector<short> > c, b;\n m = x.size();\n n = y.size();\n\n c.resize(m+1, vector<short>(n+1));\n b.resize(m+1, vector<short>(n+1));\n \n for(int i=0; i<=m; i++) c[i][0] = 0;\n for(int j=0; j<=n; j++) c[0][j] = 0;\n\n for(int i=1; i<=m; i++){\n for(int j=1; j<=n; j++){\n if(x[i-1]==y[j-1]){\n\tc[i][j] = c[i-1][j-1]+1;\n\tb[i][j] = TOPLEFT;\n }else if(c[i-1][j]>=c[i][j-1]){\n\tc[i][j] = c[i-1][j];\n\tb[i][j] = TOP;\n }else{\n\tc[i][j] = c[i][j-1];\n\tb[i][j] = LEFT;\n }\n }\n }\n\n l.resize(c[m][n]);\n\n printLcs(l, b, x, m, n, l.size()-1);\n}\n\nint main(){\n string s1, s2, l;\n while( cin >> s1 ){\n\ts2 = s1;\n\treverse(s2.begin(), s2.end());\n\tlcs(s1, s2, l);\n\tcout << l << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":710,"memory_kb":18672,"score_of_the_acc":-0.3513,"final_rank":8},{"submission_id":"aoj_2035_2058682","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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 \nstring S;\nint dp[2222][2222];\nint trans[2222][2222];\n\nint rec(int L, int R) {\n int& ret = dp[L][R];\n if(ret + 1) return ret;\n int& recons = trans[L][R];\n if(L > R) return ret = 0;\n if(S[L] == S[R]) {\n recons = 0;\n return ret = rec(L + 1, R - 1) + (L == R ? 1 : 2);\n }\n \n int r1 = rec(L + 1, R);\n int r2 = rec(L, R - 1);\n \n if(r1 > r2) {\n recons = 1;\n return ret = r1;\n }\n else {\n recons = 2;\n return ret = r2;\n }\n \n}\n \nint main() {\n while(cin >> S) {\n \n for(int i=0; i<2222; i++)\n for(int j=0; j<2222; j++)\n dp[i][j] = trans[i][j] = -1;\n \n int N = S.size();\n rec(0, N);\n int L = 0, R = N;\n string res;\n while(L < R) {\n if(trans[L][R] == 0) res += S[L], L ++, R --;\n if(trans[L][R] == 1) L ++;\n if(trans[L][R] == 2) R --;\n }\n cout << res;\n if(L == R) cout << S[L];\n reverse(res.begin(), res.end());\n cout << res << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1860,"memory_kb":41720,"score_of_the_acc":-1.2242,"final_rank":16},{"submission_id":"aoj_2035_2057661","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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\nstring S;\nint dp[2222][2222];\nint trans[2222][2222];\n\nconst int rec(const int L, const int R) {\n int& ret = dp[L][R];\n if(ret + 1) return ret;\n if(L > R) return ret = 0;\n if(S[L] == S[R]) {\n trans[L][R] = 0;\n return ret = rec(L + 1, R - 1) + (L == R ? 1 : 2);\n }\n\n const int r1 = rec(L + 1, R);\n const int r2 = rec(L, R - 1);\n\n if(r1 > r2) {\n trans[L][R] = 1;\n return ret = r1;\n }\n else {\n trans[L][R] = 2;\n return ret = r2;\n }\n\n}\n\nint main() {\n while(cin >> S) {\n\n for(int i=0; i<2222; i++)\n for(int j=0; j<2222; j++)\n dp[i][j] = trans[i][j] = -1;\n\n int N = S.size();\n rec(0, N);\n int L = 0, R = N;\n string res;\n while(L < R) {\n if(trans[L][R] == 0) {\n res += S[L];\n L ++, R --;\n }\n if(trans[L][R] == 1) {\n L ++;\n }\n if(trans[L][R] == 2) {\n R --;\n }\n }\n cout << res;\n if(L == R) cout << S[L];\n reverse(res.begin(), res.end());\n cout << res << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1860,"memory_kb":41764,"score_of_the_acc":-1.2252,"final_rank":17},{"submission_id":"aoj_2035_1896716","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nconst int LMAX=2010;\nint dp[LMAX+1][LMAX+1],from[LMAX+1][LMAX+1];\nstring LCS(string &a,string &b){\n\tint m=a.size(),n=b.size();\n\trep(i,m+1)dp[i][0]=0,from[i][0]=-1;\n\trep(i,n+1)dp[0][i]=0,from[0][i]=-1;\n\trep(i,m)rep(j,n){\n\t\tif(a[i]==b[j]){\n\t\t\tdp[i+1][j+1]=dp[i][j]+1;\n\t\t\tfrom[i+1][j+1]=2;\n\t\t}else{\n\t\t\tif(dp[i][j+1]<dp[i+1][j]){\n\t\t\t\tdp[i+1][j+1]=dp[i+1][j];\n\t\t\t\tfrom[i+1][j+1]=1;\n\t\t\t}else{\n\t\t\t\tdp[i+1][j+1]=dp[i][j+1];\n\t\t\t\tfrom[i+1][j+1]=0;\n\t\t\t}\n\t\t}\n\t}\n\tint idx=dp[m][n];\n\tstring out(idx,'!');\n\tfor(int i=m,j=n;~from[i][j];){\n\t\tswitch(from[i][j]){\n\t\t\tcase 0:i--;break;\n\t\t\tcase 1:j--;break;\n\t\t\tcase 2:i--;j--;idx--;out[idx]=a[i];break;\n\t\t}\n\t}\n\treturn out;\n}\nint main(){\n\tstring s;\n\twhile(cin>>s){\n\t\tstring t=s;\n\t\treverse(all(t));\n\t\tcout<<LCS(s,t)<<endl;\n\t}\n}","accuracy":1,"time_ms":590,"memory_kb":32716,"score_of_the_acc":-0.6552,"final_rank":11}],"string":"[\n {\n \"submission_id\": \"aoj_2035_10722445\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n//#include<atcoder/all>\\nusing namespace std;\\n//using namespace atcoder;\\n\\nusing ll = long long;\\nusing ld = long double;\\n\\n//using mint = modint998244353;\\n//using mint = modint1000000007;\\n\\ntemplate<class T> using pq = priority_queue<T>; //大きい順\\ntemplate<class T> using pq_g = priority_queue<T, vector<T>, greater<T>>; //小さい順\\n\\n#define vec_unique(v) v.erase(unique(v.begin(), v.end()), v.end()) //重複削除\\n#define vec_iota(v) iota(v.begin(), v.end(), 0) //0, 1, 2, 3, ..., n - 1にセット\\n\\nint dx[4] = {1, -1, 0, 0};\\nint dy[4] = {0, 0, 1, -1};\\n//int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};\\n//int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};\\n\\n#define INF 2e18\\n#define INF2 2e9\\n\\nint main() {\\n string s;\\n while(cin >> s) {\\n string t = s;\\n reverse(t.begin(), t.end());\\n int n = s.size();\\n int m = t.size();\\n vector<vector<int>> dp(n + 1, vector<int>(m + 1));\\n for(int i = 1; i <= n; i++) {\\n for(int j = 1; j <= m; j++) {\\n if(s[i - 1] == t[j - 1]) {\\n dp[i][j] = dp[i - 1][j - 1] + 1;\\n } else {\\n dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);\\n }\\n }\\n }\\n\\n //cout << dp[n][m] << endl;\\n\\n //LCSを復元\\n int i = n;\\n int j = m;\\n string ans = \\\"\\\";\\n while(i > 0 && j > 0) {\\n if(s[i - 1] == t[j - 1]) {\\n ans = s[i - 1] + ans;\\n i--;\\n j--;\\n } else {\\n if(dp[i][j] == dp[i][j - 1]) j--;\\n else i--;\\n }\\n }\\n cout << ans << endl;\\n }\\n //cout << fixed << setprecision(15) << << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 18752,\n \"score_of_the_acc\": -0.2671,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2035_10694366\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#if !defined(ATCODER) && !defined(EVAL)\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\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 = 3.14159265358979323846;\\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 (std::int64_t i = (m); i < std::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()\\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 constexpr void operator()() const {}\\n} sonic;\\nstruct increment_impl {\\n template <class T>\\n const increment_impl &operator>>(std::vector<T> &v) const {\\n for (auto &x : v) ++x;\\n return *this;\\n }\\n} Inc;\\nstruct decrement_impl {\\n template <class T>\\n const decrement_impl &operator>>(std::vector<T> &v) const {\\n for (auto &x : v) --x;\\n return *this;\\n }\\n} Dec;\\nstruct sort_impl {\\n template <class T>\\n const sort_impl &operator>>(std::vector<T> &v) const {\\n std::sort(v.begin(), v.end());\\n return *this;\\n }\\n} Sort;\\nstruct unique_impl {\\n template <class T>\\n const unique_impl &operator>>(std::vector<T> &v) const {\\n std::sort(v.begin(), v.end());\\n v.erase(std::unique(v.begin(), v.end()), v.end());\\n return *this;\\n }\\n} Uniq;\\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) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\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}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\nint main(void) {\\n string s;\\n while (cin >> s) {\\n int n = s.size();\\n vector dp(n + 1, vector(n + 1, 0));\\n rep (i, n) dp[i][i + 1] = 1;\\n FOR (d, 2, n + 1) {\\n rep (l, n) {\\n int r = l + d;\\n if (r > n)\\n break;\\n dp[l][r] = max(dp[l + 1][r], dp[l][r - 1]);\\n if (s[l] == s[r - 1])\\n chmax(dp[l][r], dp[l + 1][r - 1] + 2);\\n }\\n }\\n string ans, rev;\\n int l = 0, r = n;\\n while (dp[l][r] > 0 && r - l > 1) {\\n if (dp[l + 1][r - 1] + 2 == dp[l][r] && s[l] == s[r - 1]) {\\n ans += s[l];\\n rev += s[r - 1];\\n ++l, --r;\\n } else if (dp[l][r - 1] == dp[l][r]) {\\n --r;\\n } else {\\n ++l;\\n }\\n }\\n if (dp[l][r] > 0 && r - l > 0)\\n ans += s[l];\\n reverse(all(rev));\\n ans += rev;\\n co(ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 19120,\n \"score_of_the_acc\": -0.2509,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2035_9666177\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <algorithm>\\nusing namespace std;\\n\\nint longestCommonSubsequence(string s1, string s2) {\\n int m = s1.length();\\n int n = s2.length();\\n vector<vector<int>> dp(m+1, vector<int>(n+1, 0));\\n \\n for (int i=1; i<=m; i++) {\\n for (int j=1; j<=n; j++) {\\n if (s1[i-1] == s2[j-1]) {\\n dp[i][j] = 1 + dp[i-1][j-1];\\n } else {\\n dp[i][j] = max(dp[i-1][j], dp[i][j-1]);\\n }\\n }\\n }\\n \\n return dp[m][n];\\n}\\n\\nvoid printLCS(string s1, string s2) {\\n int m = s1.length();\\n int n = s2.length();\\n vector<vector<int>> dp(m+1, vector<int>(n+1, 0));\\n \\n for (int i=1; i<=m; i++) {\\n for (int j=1; j<=n; j++) {\\n if (s1[i-1] == s2[j-1]) {\\n dp[i][j] = 1 + dp[i-1][j-1];\\n } else {\\n dp[i][j] = max(dp[i-1][j], dp[i][j-1]);\\n }\\n }\\n }\\n \\n string lcs;\\n int i = m;\\n int j = n;\\n \\n while (i > 0 && j > 0) {\\n if (s1[i-1] == s2[j-1]) {\\n lcs.push_back(s1[i-1]);\\n i--;\\n j--;\\n } else if (dp[i-1][j] > dp[i][j-1]) {\\n i--;\\n } else {\\n j--;\\n }\\n }\\n \\n for (int i=lcs.length()-1; i>=0; i--) {\\n cout << lcs[i];\\n }\\n cout << endl;\\n}\\n\\nint main() {\\n string s;\\n while (cin >> s) {\\n string sReverse = s;\\n reverse(sReverse.begin(), sReverse.end());\\n printLCS(s, sReverse);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 18832,\n \"score_of_the_acc\": -0.2857,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2035_9666162\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nstring t;\\nstring s;\\nint dp[2001][2001];\\nint lcs(int i , int j) {\\n if(i == s.size() || j == t.size())return 0;\\n int &res = dp[i][j];\\n if(~res)return res;\\n res = 0;\\n if(s[i] == t[j])res = 1 + lcs(i + 1 , j + 1);\\n else res = max(lcs(i + 1 , j) , lcs(i , j + 1));\\n return res;\\n}\\nvoid build(int i , int j) {\\n if(i == s.size() || j == t.size())return;\\n if(s[i] == t[j]) {\\n cout<<s[i];\\n build(i + 1 , j + 1);\\n }else {\\n if(dp[i][j] == lcs(i + 1 ,j))build(i + 1 , j);\\n else build(i , j + 1);\\n }\\n}\\nsigned main() {\\n ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);\\n while(cin>>s) {\\n t = s;\\n for(int i = 0;i < s.size();i++) {\\n for(int j = 0;j < t.size();j++)\\n dp[i][j] = -1;\\n }\\n reverse(t.begin() , t.end());\\n int temp = lcs(0 , 0);\\n build(0 , 0);\\n cout<<'\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 800,\n \"memory_kb\": 19188,\n \"score_of_the_acc\": -0.3887,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2035_5934296\",\n \"code_snippet\": \"#include <string>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nstring s; int dp[2009][2009];\\nint main() {\\n while (cin >> s) {\\n int n = s.size();\\n for (int i = 0; i < n; i++) dp[i][i + 1] = 1;\\n for (int i = 2; i <= n; i++) {\\n for (int l = 0; l <= n - i; l++) {\\n int r = l + i;\\n dp[l][r] = max(dp[l + 1][r], dp[l][r - 1]);\\n if (s[l] == s[r - 1]) dp[l][r] = max(dp[l][r], dp[l + 1][r - 1] + 2);\\n }\\n }\\n string ret;\\n int pl = 0, pr = n;\\n while (pr - pl >= 2) {\\n if (s[pl] == s[pr - 1] && dp[pl][pr] == dp[pl + 1][pr - 1] + 2) ret += s[pl], pl++, pr--;\\n else if (dp[pl][pr] == dp[pl + 1][pr]) pl++;\\n else pr--;\\n }\\n string ps = ret;\\n if (pr - pl == 1) ps += s[pl];\\n reverse(ret.begin(), ret.end());\\n ps += ret;\\n cout << ps << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 18444,\n \"score_of_the_acc\": -0.1819,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2035_4641340\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// #define int long long\\n#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)\\n#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)\\n#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)\\n#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)\\n#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)\\n#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)\\n#define SORT(v, n) sort(v, v + n);\\n#define REVERSE(v, n) reverse(v, v+n);\\n#define vsort(v) sort(v.begin(), v.end());\\n#define all(v) v.begin(), v.end()\\n#define mp(n, m) make_pair(n, m);\\n#define cout(d) cout<<d<<endl;\\n#define coutd(d) cout<<std::setprecision(10)<<d<<endl;\\n#define cinline(n) getline(cin,n);\\n#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);\\n#define PI (acos(-1))\\n#define FILL(v, n, x) fill(v, v + n, x);\\n#define sz(x) long long(x.size())\\n\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing vs = vector<string>;\\nusing vpll = vector<pair<ll, ll>>;\\nusing vtp = vector<tuple<ll,ll,ll>>;\\nusing vb = vector<bool>;\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\nconst ll INF = 1e9;\\nconst ll MOD = 1e9+7;\\nconst ll LINF = 1e18;\\n\\nll dp[2005][2005]; // [l,r)における回文の最大長\\nstring s;\\n\\nvoid solve(){\\n ll n=s.size();\\n \\n memset(dp,0,sizeof(dp));\\n rep(i,n) dp[i][i+1]=1;\\n \\n for(ll len=2; len<=n; len++){\\n for(ll i=0; i+len<=n; i++){\\n ll j=i+len;\\n if(s[i]==s[j-1]) chmax(dp[i][j],dp[i+1][j-1]+2);\\n else chmax(dp[i][j],max(dp[i+1][j],dp[i][j-1]));\\n }\\n }\\n \\n ll ma=0, l,r;\\n rep(i,n) irep(j,i,n+1){\\n if(chmax(ma,dp[i][j])) l=i, r=j;\\n }\\n \\n // cout<<dp[0][n]<<' '<<ma<<endl;\\n \\n if(ma==1){\\n cout<<s[0]<<endl;\\n return;\\n }\\n \\n string left=\\\"\\\", right=\\\"\\\";\\n while(ma>0){\\n while(dp[l+1][r]==ma) l++;\\n while(dp[l][r-1]==ma) r--;\\n left+=s[l], right+=s[l];\\n // cout<<l<<' '<<r<<' '<<ma<<endl;\\n ma-=2;\\n if(ma==1){\\n left+=s[l+1];\\n ma--;\\n }\\n l++, r--;\\n }\\n\\n reverse(all(right));\\n string ans=left+right;\\n cout<<ans<<endl;\\n \\n return;\\n}\\n\\n\\nsigned main()\\n{\\n cin.tie( 0 ); ios::sync_with_stdio( false );\\n \\n for(int t = 0; cin >> s; t++) {\\n solve();\\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 980,\n \"memory_kb\": 34620,\n \"score_of_the_acc\": -0.8092,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2035_3947480\",\n \"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\\n\\n\\nint cal_longest_palindrome_subsequence(const std::string& str, const int left, const int right, std::vector<std::vector<int>>& memo) {\\n\\tif (left > right) return 0;\\n\\tif (left == right) return 1;\\n\\tif (memo[left][right - left - 1] >= 0) return memo[left][right - left - 1];\\n\\tif (str[left] == str[right]) memo[left][right - left - 1] = cal_longest_palindrome_subsequence(str, left + 1, right - 1, memo) + 2;\\n\\treturn memo[left][right - left - 1] = std::max({ memo[left][right - left - 1], cal_longest_palindrome_subsequence(str, left + 1, right, memo), cal_longest_palindrome_subsequence(str, left, right - 1, memo) });\\n}\\nstd::string make_longest_palindorome(const std::string& str) {\\n\\tstd::string prev_half;\\n\\tstd::vector<std::vector<int>> memo; memo.reserve(str.size());\\n\\tfor (auto i = 0; i < str.size(); ++i) memo.push_back(std::vector<int>(str.size() - i, -1));\\n\\tfor (int left = 0, right = str.size() - 1; left <= right; ) {\\n\\t\\tif (str[left] == str[right]) {\\n\\t\\t\\tprev_half.push_back(str[left]); ++left; --right;\\n\\t\\t}\\n\\t\\telse if (cal_longest_palindrome_subsequence(str, left + 1, right, memo) > cal_longest_palindrome_subsequence(str, left, right - 1, memo)) {\\n\\t\\t\\t++left;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\t--right;\\n\\t\\t}\\n\\t}\\n\\tconst auto result_length = cal_longest_palindrome_subsequence(str, 0, str.size() - 1, memo);\\n\\tif (result_length % 2 == 1) {\\n\\t\\tfor (int i = prev_half.size() - 2; i >= 0; --i) prev_half.push_back(prev_half[i]);\\n\\t}\\n\\telse {\\n\\t\\tfor (int i = prev_half.size() - 1; i >= 0; --i) prev_half.push_back(prev_half[i]);\\n\\t}\\n\\treturn prev_half;\\n}\\n\\nint main() {\\n\\tstd::string str;\\n\\twhile (std::cin >> str) {\\n\\t\\tstd::cout << make_longest_palindorome(str) << '\\\\n';\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1050,\n \"memory_kb\": 10868,\n \"score_of_the_acc\": -0.2583,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2035_2859269\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\nint solve(int l, int r, const string& st,vector<vector<int>>&memo,vector<vector<int>>&flags) {\\n\\tif (memo[l][r] == -1) {\\n\\t\\tif(l==r)memo[l][r]=0;\\n\\t\\telse if(l+1==r)memo[l][r]=1;\\n\\t\\telse {\\n\\n\\t\\t\\tif (st[l] == st[r - 1]) {\\n\\t\\t\\t\\tmemo[l][r]=2+solve(l+1,r-1,st,memo,flags);\\n\\t\\t\\t\\tflags[l][r]=3;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tint lk=solve(l+1,r,st,memo,flags);\\n\\t\\t\\t\\tint rk=solve(l,r-1,st,memo,flags);\\n\\n\\t\\t\\t\\tif (lk > rk) {\\n\\t\\t\\t\\t\\tflags[l][r]=2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tflags[l][r]=1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmemo[l][r]=max(lk,rk);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn memo[l][r];\\n}\\n\\nint main() {\\n\\tstring st;\\n\\twhile (cin>>st) {\\n\\t\\tvector<vector<int>>memo(st.size()+1,vector<int>(st.size()+1,-1)),flags(st.size()+1,vector<int>(st.size()+1));\\n\\t\\tint ans=solve(0,st.size(),st,memo,flags);\\n\\t\\tstring ans_st1,ans_st2;\\n\\n\\t\\tint al=0;\\n\\t\\tint ar=st.size();\\n\\t\\twhile (true) {\\n\\t\\t\\tint num=flags[al][ar];\\n\\t\\t\\tif (num == 3) {\\n\\t\\t\\t\\tans_st1.push_back(st[al]);\\n\\t\\t\\t\\tans_st2.push_back(st[ar-1]);\\n\\t\\t\\t\\tal++;\\n\\t\\t\\t\\tar--;\\n\\t\\t\\t}\\n\\t\\t\\telse if (num == 2) {\\n\\t\\t\\t\\tal++;\\n\\t\\t\\t}\\n\\t\\t\\telse if (num == 1) {\\n\\t\\t\\t\\tar--;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (al + 1 == ar) {\\n\\t\\t\\t\\t\\tans_st1.push_back(st[al]);\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treverse(ans_st2.begin(),ans_st2.end());\\n\\t\\tcout<<ans_st1<<ans_st2<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1110,\n \"memory_kb\": 34304,\n \"score_of_the_acc\": -0.8378,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2035_2614244\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nstring s,t;\\nint dp[2011][2011];\\nint used[2011][2011];\\nstring solve(){\\n string ans=\\\"\\\";\\n int i=s.size()-1;\\n int j=t.size()-1;\\n while(i>0&&j>0){\\n if(used[i][j]==1)ans+=t[j],i--,j--;\\n else if(used[i][j]==2)i--;\\n else j--;\\n }\\n return ans;\\n}\\nint main(){\\n while(cin>>s){\\n memset(dp,0,sizeof(dp));\\n memset(used,0,sizeof(used));\\n t=s;\\n reverse(s.begin(),s.end());\\n t=\\\"@\\\"+t;\\n s=\\\"@\\\"+s;\\n for(int i=1;i<s.size();i++)\\n for(int j=1;j<t.size();j++)\\n if(s[i]==t[j]){\\n if(dp[i-1][j]>=dp[i-1][j-1]+1) dp[i][j]=max(dp[i][j],dp[i-1][j]),used[i][j]=2;\\n \\n else dp[i][j]=max(dp[i][j],dp[i-1][j-1]+1),used[i][j]=1;\\n }\\n else{\\n if(dp[i-1][j]>=dp[i][j-1])dp[i][j]=max(dp[i][j],dp[i-1][j]),used[i][j]=2;\\n else dp[i][j]=max(dp[i][j],dp[i][j-1]),used[i][j]=3;\\n }\\n cout<<solve()<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 34612,\n \"score_of_the_acc\": -0.7507,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2035_2558030\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nint dp[2001][2001];\\nint memo[2001][2001];\\n\\nint main(){\\n\\n\\tint length;\\n\\tchar buf[2001],reverse[2001];\\n\\tstack<char> ANS;\\n\\n\\twhile(scanf(\\\"%s\\\",buf) != EOF){\\n\\n\\t\\tfor(length = 0; buf[length] != '\\\\0'; length++);\\n\\n\\t\\tfor(int i = 0; i < length; i++){\\n\\t\\t\\treverse[i] = buf[length-1-i];\\n\\t\\t}\\n\\t\\treverse[length] = '\\\\0';\\n\\n\\t\\tfor(int i = 0; i <= length; i++){\\n\\t\\t\\tfor(int k = 0; k <= length; k++){\\n\\t\\t\\t\\tdp[i][k] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor(int i = 0; i < length; i++){\\n\\t\\t\\tfor(int k = 0; k < length; k++){\\n\\t\\t\\t\\tif(buf[i] == reverse[k]){\\n\\t\\t\\t\\t\\tdp[i+1][k+1] = dp[i][k]+1;\\n\\t\\t\\t\\t\\tmemo[i+1][k+1] = 0;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tif(dp[i][k+1] >= dp[i+1][k]){\\n\\t\\t\\t\\t\\t\\tdp[i+1][k+1] = dp[i][k+1];\\n\\t\\t\\t\\t\\t\\tmemo[i+1][k+1] = 1;\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tdp[i+1][k+1] = dp[i+1][k];\\n\\t\\t\\t\\t\\t\\tmemo[i+1][k+1] = -1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor(int i = length,k = length; i > 0 && k > 0;){\\n\\n\\t\\t\\tif(memo[i][k] == 1){\\n\\t\\t\\t\\ti--;\\n\\t\\t\\t}else if(memo[i][k] == -1){\\n\\t\\t\\t\\tk--;\\n\\t\\t\\t}else{ //memo[i][k] == 0\\n\\t\\t\\t\\tANS.push(buf[i-1]);\\n\\t\\t\\t\\ti--;\\n\\t\\t\\t\\tk--;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\twhile(!ANS.empty()){\\n\\t\\t\\tprintf(\\\"%c\\\",ANS.top());\\n\\t\\t\\tANS.pop();\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 34288,\n \"score_of_the_acc\": -0.6457,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2035_2179720\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<tuple>\\n#include<algorithm>\\nusing namespace std;\\nstring S; tuple<int, int, int>dp[2100][2100];\\nint solve(int s, int t) {\\n\\tif (s > t)return 0;\\n\\tif (get<0>(dp[s][t]) != -1)return get<0>(dp[s][t]);\\n\\tif (s == t) { dp[s][t] = make_tuple(1, -1, -1); return 1; }\\n\\tif (t - s == 1) {\\n\\t\\tif (S[s] == S[t]) { dp[s][t] = make_tuple(2, -1, -1); return 2; }\\n\\t}\\n\\tint c1 = solve(s, t - 1);\\n\\tint c2 = solve(s + 1, t);\\n\\tint c3 = solve(s + 1, t - 1); if (S[s] == S[t])c3 += 2;\\n\\tif (c1 >= c2 && c1 >= c3) { dp[s][t] = make_tuple(c1, s, t - 1); return c1; }\\n\\tif (c2 >= c1 && c2 >= c3) { dp[s][t] = make_tuple(c2, s + 1, t); return c2; }\\n\\tif (c3 >= c1 && c3 >= c2) { dp[s][t] = make_tuple(c3, s + 1, t - 1); return c3; }\\n}\\nint main() {\\n\\twhile (cin >> S) {\\n\\t\\tfor (int i = 0; i < S.size(); i++) { for (int j = 0; j < S.size(); j++)dp[i][j] = make_tuple(-1, 0, 0); }\\n\\t\\tsolve(0, S.size() - 1);\\n\\t\\tstring V, W; int F = 0, G = S.size() - 1;\\n\\t\\twhile (F + G >= 0) {\\n\\t\\t\\tint H = get<1>(dp[F][G]), I = get<2>(dp[F][G]);\\n\\t\\t\\tif (H == -1 || ((H - F) + (G - I)) == 2) {\\n\\t\\t\\t\\tV += S[F]; if (F != G)W += S[F];\\n\\t\\t\\t}\\n\\t\\t\\tF = H; G = I;\\n\\t\\t}\\n\\t\\treverse(W.begin(), W.end());\\n\\t\\tcout << V + W << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3150,\n \"memory_kb\": 52512,\n \"score_of_the_acc\": -1.8417,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2035_2172806\",\n \"code_snippet\": \"#include <string>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nstring s; int dp[2009][2009];\\nint main() {\\n\\twhile (cin >> s) {\\n\\t\\tint n = s.size();\\n\\t\\tfor (int i = 0; i < n; i++) dp[i][i + 1] = 1;\\n\\t\\tfor (int i = 2; i <= n; i++) {\\n\\t\\t\\tfor (int l = 0; l <= n - i; l++) {\\n\\t\\t\\t\\tint r = l + i;\\n\\t\\t\\t\\tdp[l][r] = max(dp[l + 1][r], dp[l][r - 1]);\\n\\t\\t\\t\\tif (s[l] == s[r - 1]) dp[l][r] = max(dp[l][r], dp[l + 1][r - 1] + 2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstring ret;\\n\\t\\tint pl = 0, pr = n;\\n\\t\\twhile (pr - pl >= 2) {\\n\\t\\t\\tif (s[pl] == s[pr - 1] && dp[pl][pr] == dp[pl + 1][pr - 1] + 2) ret += s[pl], pl++, pr--;\\n\\t\\t\\telse if (dp[pl][pr] == dp[pl + 1][pr]) pl++;\\n\\t\\t\\telse pr--;\\n\\t\\t}\\n\\t\\tstring ps = ret;\\n\\t\\tif (pr - pl == 1) ps += s[pl];\\n\\t\\treverse(ret.begin(), ret.end());\\n\\t\\tps += ret;\\n\\t\\tcout << ps << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 16756,\n \"score_of_the_acc\": -0.2358,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2035_2127858\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define F first\\n#define S second\\n#define all(v) (v).begin(), (v).end()\\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\\n#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)\\n#define each(a, b) for(auto& a : b)\\n\\ntypedef pair<int, int> P;\\n\\nint dp[2010][2010];\\nint tr[2010][2010];\\n\\nsigned main()\\n{\\n string s;\\n while(cin >> s) {\\n string t = s; reverse(all(s)); \\n memset(dp, 0, sizeof(dp));\\n memset(tr, 0, sizeof(dp));\\n for(int i = 0; i < s.size(); i++) {\\n for(int j = 0; j < t.size(); j++) {\\n\\tif(s[i] == t[j]) dp[i+1][j+1] = dp[i][j] + 1, tr[i+1][j+1] = 1;\\n\\telse {\\n\\t if(dp[i+1][j] > dp[i][j+1]) dp[i+1][j+1] = dp[i+1][j], tr[i+1][j+1] = 2;\\n\\t else dp[i+1][j+1] = dp[i][j+1], tr[i+1][j+1] = 3;\\n\\t}\\n }\\n }\\n string x;\\n for(int i = s.size(), j = t.size(); i > 0 && j > 0; ) {\\n switch(tr[i][j]) {\\n case 1: x += s[i-1], i--, j--; break;\\n case 2: j--; break;\\n case 3: i--; break;\\n }\\n }\\n cout << x << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 34664,\n \"score_of_the_acc\": -0.752,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2035_2127341\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define N 2050\\nstring ss[2][N+1];\\nint c[N+1][N+1];\\nstring lcs(string X,string Y){\\n int m = X.size();\\n int n = Y.size();\\n int maxl = 0;\\n X = ' ' + X;\\n Y = ' ' + Y;\\n ss[0][0] = \\\"\\\";\\n memset(c,0,sizeof(c));\\n for(int i=0;i<N+1;i++) ss[0][i]=ss[1][i]=\\\"\\\";\\n for(int i=0;i<=m;i++) c[i][0]=0;\\n for(int j=1;j<=n;j++) c[0][j]=0;\\n for(int i=1;i<=m;i++){\\n for(int j=1;j<=n;j++){\\n if(X[i]==Y[j]) c[i][j]=c[i-1][j-1]+1, ss[i%2][j] = ss[(i-1)%2][j-1] + X[i];\\n else {\\n if(c[i-1][j] >= c[i][j-1]) c[i][j]=c[i-1][j], ss[i%2][j] = ss[(i-1)%2][j];\\n else c[i][j] = c[i][j-1], ss[i%2][j] = ss[i%2][j-1];\\n }\\n maxl=max(maxl,c[i][j]);\\n }\\n }\\n string ret=ss[m%2][n],ret2=ret;\\n reverse(ret2.begin(),ret2.end());\\n //assert(ret==ret2);\\n assert((int)ret.size()==maxl);\\n return ss[m%2][n];\\n}\\nint main(){\\n string s;\\n while(cin >> s) {\\n string t = s;\\n reverse(t.begin(), t.end());\\n cout << lcs(s, t) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3720,\n \"memory_kb\": 25592,\n \"score_of_the_acc\": -1.3536,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2035_2127249\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define N 2005\\nusing namespace std;\\nstring s,t,ans;\\nint dp[N][N];\\n\\nvoid dfs(int y,int x){\\n if(!y||!x)return;\\n if(dp[y][x]-dp[y-1][x-1]==1&&dp[y][x]-dp[y-1][x]==1&&dp[y][x]-dp[y][x-1]==1){\\n ans+=s[y-1];\\n dfs(y-1,x-1);\\n return;\\n }\\n if(dp[y][x-1]==dp[y][x])dfs(y,x-1);\\n else dfs(y-1,x);\\n}\\n\\nint main(){\\n //IAIDDAII\\n\\n while(cin>>s){\\n //s.resize(8);\\n //for(int i=0;i<8;i++) s[i]='A'+(rand())%10;\\n t=s;\\n reverse(t.begin(),t.end());\\n memset(dp,0,sizeof(dp));\\n int n=s.size(),m=t.size();\\n for(int i=0;i<n;i++){\\n for(int j=0;j<m;j++){\\n\\tif(s[i]==t[j])dp[i+1][j+1]=dp[i][j]+1;\\n\\telse dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]);\\n }\\n }\\n ans=\\\"\\\";\\n dfs(n,m);\\n if(ans.size()%2==0){\\n ans=ans.substr(0,ans.size()/2);\\n string tmp=ans;reverse(tmp.begin(),tmp.end());\\n ans=ans+tmp;\\n }\\n else {\\n string tmp=ans.substr(0,ans.size()/2);\\n reverse(tmp.begin(),tmp.end());\\n ans=ans.substr(0,ans.size()/2)+ans[ans.size()/2]+tmp;\\n }\\n string temp=ans;\\n reverse(temp.begin(),temp.end());\\n assert(ans==temp);\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 560,\n \"memory_kb\": 18700,\n \"score_of_the_acc\": -0.3103,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2035_2127221\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define N 2050\\nstring ss[2][N+1];\\nint c[N+1][N+1];\\nstring lcs(string X,string Y){\\n int m = X.size();\\n int n = Y.size();\\n int maxl = 0;\\n X = ' ' + X;\\n Y = ' ' + Y;\\n ss[0][0] = \\\"\\\";\\n memset(c,0,sizeof(c));\\n for(int i=0;i<N+1;i++) ss[0][i]=ss[1][i]=\\\"\\\";\\n for(int i=0;i<=m;i++) c[i][0]=0;\\n for(int j=1;j<=n;j++) c[0][j]=0;\\n for(int i=1;i<=m;i++){\\n for(int j=1;j<=n;j++){\\n if(X[i]==Y[j]) c[i][j]=c[i-1][j-1]+1, ss[i%2][j] = ss[(i-1)%2][j-1] + X[i];\\n else {\\n\\tif(c[i-1][j] >= c[i][j-1]) c[i][j]=c[i-1][j], ss[i%2][j] = ss[(i-1)%2][j];\\n\\telse c[i][j] = c[i][j-1], ss[i%2][j] = ss[i%2][j-1];\\n }\\n maxl=max(maxl,c[i][j]);\\n }\\n }\\n string ret=ss[m%2][n],ret2=ret;\\n reverse(ret2.begin(),ret2.end());\\n //assert(ret==ret2);\\n assert((int)ret.size()==maxl);\\n return ss[m%2][n];\\n}\\nint main(){\\n string s;\\n while(cin >> s) {\\n string t = s;\\n reverse(t.begin(), t.end());\\n cout << lcs(s, t) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3700,\n \"memory_kb\": 25592,\n \"score_of_the_acc\": -1.348,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2035_2127209\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\n#define TOPLEFT 0\\n#define TOP 1\\n#define LEFT 2\\n#define MAX 2000\\n\\nvoid printLcs(string &l, vector<vector<short> > &b, const string &x, int i, int j, int k){\\n if(i==0 || j==0) return;\\n if(b[i][j]==TOPLEFT){\\n printLcs(l, b, x, i-1, j-1, k-1);\\n l[k] = x[i-1];\\n }else if(b[i][j]==TOP){\\n printLcs(l, b, x, i-1, j, k);\\n }else{\\n printLcs(l, b, x, i, j-1, k);\\n }\\n}\\n\\nvoid lcs(string &x, string &y, string &l){\\n int m, n;\\n vector<vector<short> > c, b;\\n m = x.size();\\n n = y.size();\\n\\n c.resize(m+1, vector<short>(n+1));\\n b.resize(m+1, vector<short>(n+1));\\n \\n for(int i=0; i<=m; i++) c[i][0] = 0;\\n for(int j=0; j<=n; j++) c[0][j] = 0;\\n\\n for(int i=1; i<=m; i++){\\n for(int j=1; j<=n; j++){\\n if(x[i-1]==y[j-1]){\\n\\tc[i][j] = c[i-1][j-1]+1;\\n\\tb[i][j] = TOPLEFT;\\n }else if(c[i-1][j]>=c[i][j-1]){\\n\\tc[i][j] = c[i-1][j];\\n\\tb[i][j] = TOP;\\n }else{\\n\\tc[i][j] = c[i][j-1];\\n\\tb[i][j] = LEFT;\\n }\\n }\\n }\\n\\n l.resize(c[m][n]);\\n\\n printLcs(l, b, x, m, n, l.size()-1);\\n}\\n\\nint main(){\\n string s1, s2, l;\\n while( cin >> s1 ){\\n\\ts2 = s1;\\n\\treverse(s2.begin(), s2.end());\\n\\tlcs(s1, s2, l);\\n\\tcout << l << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 710,\n \"memory_kb\": 18672,\n \"score_of_the_acc\": -0.3513,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2035_2058682\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\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 \\nstring S;\\nint dp[2222][2222];\\nint trans[2222][2222];\\n\\nint rec(int L, int R) {\\n int& ret = dp[L][R];\\n if(ret + 1) return ret;\\n int& recons = trans[L][R];\\n if(L > R) return ret = 0;\\n if(S[L] == S[R]) {\\n recons = 0;\\n return ret = rec(L + 1, R - 1) + (L == R ? 1 : 2);\\n }\\n \\n int r1 = rec(L + 1, R);\\n int r2 = rec(L, R - 1);\\n \\n if(r1 > r2) {\\n recons = 1;\\n return ret = r1;\\n }\\n else {\\n recons = 2;\\n return ret = r2;\\n }\\n \\n}\\n \\nint main() {\\n while(cin >> S) {\\n \\n for(int i=0; i<2222; i++)\\n for(int j=0; j<2222; j++)\\n dp[i][j] = trans[i][j] = -1;\\n \\n int N = S.size();\\n rec(0, N);\\n int L = 0, R = N;\\n string res;\\n while(L < R) {\\n if(trans[L][R] == 0) res += S[L], L ++, R --;\\n if(trans[L][R] == 1) L ++;\\n if(trans[L][R] == 2) R --;\\n }\\n cout << res;\\n if(L == R) cout << S[L];\\n reverse(res.begin(), res.end());\\n cout << res << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1860,\n \"memory_kb\": 41720,\n \"score_of_the_acc\": -1.2242,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2035_2057661\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\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\\nstring S;\\nint dp[2222][2222];\\nint trans[2222][2222];\\n\\nconst int rec(const int L, const int R) {\\n int& ret = dp[L][R];\\n if(ret + 1) return ret;\\n if(L > R) return ret = 0;\\n if(S[L] == S[R]) {\\n trans[L][R] = 0;\\n return ret = rec(L + 1, R - 1) + (L == R ? 1 : 2);\\n }\\n\\n const int r1 = rec(L + 1, R);\\n const int r2 = rec(L, R - 1);\\n\\n if(r1 > r2) {\\n trans[L][R] = 1;\\n return ret = r1;\\n }\\n else {\\n trans[L][R] = 2;\\n return ret = r2;\\n }\\n\\n}\\n\\nint main() {\\n while(cin >> S) {\\n\\n for(int i=0; i<2222; i++)\\n for(int j=0; j<2222; j++)\\n dp[i][j] = trans[i][j] = -1;\\n\\n int N = S.size();\\n rec(0, N);\\n int L = 0, R = N;\\n string res;\\n while(L < R) {\\n if(trans[L][R] == 0) {\\n res += S[L];\\n L ++, R --;\\n }\\n if(trans[L][R] == 1) {\\n L ++;\\n }\\n if(trans[L][R] == 2) {\\n R --;\\n }\\n }\\n cout << res;\\n if(L == R) cout << S[L];\\n reverse(res.begin(), res.end());\\n cout << res << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1860,\n \"memory_kb\": 41764,\n \"score_of_the_acc\": -1.2252,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2035_1896716\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef pair<int,pii> pip;\\ntypedef vector<pip>vip;\\nconst double PI=acos(-1);\\nconst double EPS=1e-8;\\nconst int inf=1e8;\\nconst int LMAX=2010;\\nint dp[LMAX+1][LMAX+1],from[LMAX+1][LMAX+1];\\nstring LCS(string &a,string &b){\\n\\tint m=a.size(),n=b.size();\\n\\trep(i,m+1)dp[i][0]=0,from[i][0]=-1;\\n\\trep(i,n+1)dp[0][i]=0,from[0][i]=-1;\\n\\trep(i,m)rep(j,n){\\n\\t\\tif(a[i]==b[j]){\\n\\t\\t\\tdp[i+1][j+1]=dp[i][j]+1;\\n\\t\\t\\tfrom[i+1][j+1]=2;\\n\\t\\t}else{\\n\\t\\t\\tif(dp[i][j+1]<dp[i+1][j]){\\n\\t\\t\\t\\tdp[i+1][j+1]=dp[i+1][j];\\n\\t\\t\\t\\tfrom[i+1][j+1]=1;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tdp[i+1][j+1]=dp[i][j+1];\\n\\t\\t\\t\\tfrom[i+1][j+1]=0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint idx=dp[m][n];\\n\\tstring out(idx,'!');\\n\\tfor(int i=m,j=n;~from[i][j];){\\n\\t\\tswitch(from[i][j]){\\n\\t\\t\\tcase 0:i--;break;\\n\\t\\t\\tcase 1:j--;break;\\n\\t\\t\\tcase 2:i--;j--;idx--;out[idx]=a[i];break;\\n\\t\\t}\\n\\t}\\n\\treturn out;\\n}\\nint main(){\\n\\tstring s;\\n\\twhile(cin>>s){\\n\\t\\tstring t=s;\\n\\t\\treverse(all(t));\\n\\t\\tcout<<LCS(s,t)<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 590,\n \"memory_kb\": 32716,\n \"score_of_the_acc\": -0.6552,\n \"final_rank\": 11\n }\n]","isConversational":false}}},{"rowIdx":1070,"cells":{"group_id":{"kind":"string","value":"aoj_2041_cpp"},"problem_description":{"kind":"string","value":"Problem C:\nDisarmament of the Units\nThis is a story in a country far away. In this country, two armed groups, ACM and ICPC, have\nfought in the civil war for many years. However, today October 21, reconciliation was approved\nbetween them; they have marked a turning point in their histories.\nIn this country, there are a number of roads either horizontal or vertical, and a town is built on\nevery endpoint and every intersection of those roads (although only one town is built at each\nplace). Some towns have units of either ACM or ICPC. These units have become unneeded\nby the reconciliation. So, we should make them disarm in a verifiable way simultaneously. All\ndisarmament must be carried out at the towns designated for each group, and only one unit can\nbe disarmed at each town. Therefore, we need to move the units.\nThe command of this mission is entrusted to you. You can have only one unit moved by a\nsingle order, where the unit must move to another town directly connected by a single road.\nYou cannot make the next order to any unit until movement of the unit is completed. The unit\ncannot pass nor stay at any town another unit stays at. In addition, even though reconciliation\nwas approved, members of those units are still irritable enough to start battles. For these\nreasons, two units belonging to different groups may not stay at towns on the same road. You\nfurther have to order to the two groups alternatively, because ordering only to one group may\ncause their dissatisfaction. In spite of this restriction, you can order to either group first.\nYour job is to write a program to find the minimum number of orders required to complete the\nmission of disarmament.\nInput\nThe input consists of multiple datasets. Each dataset has the following format:\nn m\nA\nm\nI\nrx\n1,1\nry\n1,1\nrx\n1,2\nry\n1,2\n...\nrx\nn\n,1\nry\nn\n,1\nrx\nn\n,2\nry\nn\n,2\nsx\nA\n,1\nsy\nA\n,1\n...\nsx\nA\n,\nm\nA\nsy\nA\n,\nm\nA\nsx\nI\n,1\nsy\nI\n,1\n...\nsx\nI\n,\nm\nI\nsy\nI\n,\nm\nI\ntx\nA\n,1\nty\nA\n,1\n...\ntx\nA\n,\nm\nA\nty\nA\n,\nm\nA\ntx\nI\n,1\nty\nI\n,1\n...\ntx\nI\n,\nm\nI\nty\nI\n,\nm\nI\nn\nis the number of roads.\nm\nA\nand\nm\nI\nare the number of units in ACM and ICPC respectively\n(\nm\nA\n> 0,\nm\nI\n> 0,\nm\nA\n+\nm\nB\n< 8). (\nrx\ni\n,1\n,\nry\ni\n,1\n) and (\nrx\ni\n,2\n,\nry\ni\n,2\n) indicate the two endpoints of the\ni\n-th road, which is always parallel to either\nx\n-axis or\ny\n-axis. A series of (\nsx\nA\n,\ni\n,\nsy\nA\n,\ni\n) indicates\nthe coordinates of the towns where the ACM units initially stay, and a series of (\nsx\nI\n,\ni\n,\nsy\nI\n,\ni\n)\nindicates where the ICPC units initially stay. A series of (\ntx\nA\n,\ni\n,\nty\nA\n,\ni\n) indicates the coordinates\nof the towns where the ACM units can be disarmed, and a series of (\ntx\nI\n,\ni\n,\nty\nI\n,\ni\n) indicates where\nthe ICPC units can be disarmed.\nYou may assume the following:\nthe number of towns, that is, the total number of coordinates where endpoints and/or\n intersections of the roads exist does not exceed 18;\nno two horizontal roads are connected nor ovarlapped; no two vertical roads, either;\nall the towns are connected by roads; and\nno pair of ACM and \n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2041_124929","code_snippet":"#include<iostream>\n#include<complex>\n#include<map>\n#include<algorithm>\n#include<set>\n#include<queue>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define pb push_back\n#define mp make_pair\n#define ALL(c) (c).begin(),(c).end()\n\ntypedef complex<int> P;\ntypedef pair<P,P> Line;\ntypedef unsigned long long ull;\n\nconst int N = 20;\n\nnamespace std{\n bool operator<(const P &a,const P &b){\n if (a.real() != b.real())return a.real() < b.real();\n return a.imag() < b.imag();\n }\n}\n\nbool isp(P a,P b,P c){\n complex<double> A(a.real(),a.imag()),B(b.real(),b.imag()),C(c.real(),c.imag());\n return abs(A-C)+abs(B-C) < abs(A-B) + 1e-10;\n}\n\nbool isptable[N][N][N];\nbool edge[N][N];\n\nenum {icpcgoal=0,acmgoal=1,els=2};\nenum {icpc=0,acm=1};\nint isgoal[N];\n\nbool isicpc[8];\nclass state{\npublic:\n int n;\n int goal;\n short cnt;\n bool lastmove;\n short node[8];\n ull st;\n bool isclear();\n void makest();\n bool isvalid(int,int,vector<P>&);\n bool operator<(const state& a)const;\n};\n\nbool state::operator<(const state& a)const{\n return st < a.st;\n}\n\nbool state::isclear(){\n int cnt =0;\n rep(i,n){\n if (isicpc[i] &&isgoal[node[i]]==icpcgoal)cnt++;\n else if (!isicpc[i]&&isgoal[node[i]]==acmgoal )cnt++;\n }\n return cnt == n;\n}\n\nbool state::isvalid(int ii,int prev,vector<P>&p){\n rep(i,n){\n if (i == ii)continue;\n if (isptable[prev][node[ii]][node[i]])\n return false;\n }\n rep(i,n){\n REP(j,i+1,n){\n if (node[i] == node[j])return false;\n if (isicpc[i] != isicpc[j] &&\n\t edge[node[i]][node[j]])return false;\n }\n }\n return true;\n}\n\nvoid state::makest(){\n st=lastmove;\n rep(i,n){\n st=st*18 + node[i];\n }\n}\n\nint bfs(int n,state ini,vector<P> &node,int ma){\n queue<state> Q; \n set<ull> S;\n ini.lastmove=icpc;\n ini.makest();\n Q.push(ini);\n S.insert(ini.st);\n ini.lastmove=acm;\n ini.makest();\n Q.push(ini);\n S.insert(ini.st);\n if (ini.isclear())return 0;\n\n while(!Q.empty()){\n state now = Q.front();Q.pop();\n int curmove=now.lastmove==icpc?acm:icpc;\n rep(i,now.n){\n if (curmove==icpc && !isicpc[i])continue;\n if (curmove==acm && isicpc[i])continue;\n rep(j,n){\n\tif (!edge[now.node[i]][j])continue;\n\tstate next = now;\n\tnext.cnt++;\n\tnext.lastmove=curmove;\n\tnext.node[i]=j;\n\tif (!next.isvalid(i,now.node[i],node))continue;\n\tsort(next.node,next.node+ma);\n\tsort(next.node+ma,next.node+next.n);\n\tnext.makest();\n\tif (S.find(next.st) == S.end()){\n\t if (next.isclear()){\n\t return next.cnt;\n\t }\n\t S.insert(next.st);\n\t Q.push(next);\n\t}\n }\n } \n }\n return -1;\n}\n\nint getindex(P &a,map<P,int> &M){\n int index = M.size();\n if (M.find(a) == M.end())M[a]=index;\n return M[a];\n}\n\nvoid make_intersection(vector<Line> ver,vector<Line>hor, map<P,int> &M){\n rep(i,ver.size()){\n rep(j,hor.size()){\n if (ver[i].first.imag() <= hor[j].first.imag() &&\n\t ver[i].second.imag() >= hor[j].first.imag() &&\n\t hor[j].first.real() <= ver[i].first.real() &&\n\t hor[j].second.real() >= ver[i].first.real()){\n\tP ins(ver[i].first.real(),hor[j].first.imag());\n\tgetindex(ins,M);\n }\n }\n }\n}\n\nvoid make_graph(vector<P> node,vector<Line> ver,\n\t\tmap<P,int> M){\n rep(i,ver.size()){\n vector<int> connect;\n rep(j,node.size()){\n if (isptable[M[ver[i].first]][M[ver[i].second]][j]){\n\tconnect.pb(M[node[j]]);\n }\n }\n rep(j,connect.size()){\n REP(k,j+1,connect.size()){\n\tedge[connect[j]][connect[k]]=edge[connect[k]][connect[j]]=true;\n }\n }\n }\n}\n\nmain(){\n int n,ma,mi;\n while(cin>>n>>ma>>mi && n){\n rep(i,N){\n rep(j,N)edge[i][j]=false;\n isgoal[i]=els;\n }\n rep(i,N)rep(j,N)rep(k,N)isptable[i][j][k]=false;\n vector<Line> hor,ver;\n map<P,int> M;\n rep(i,n){\n Line ins;\n cin>>ins.first.real()>>ins.first.imag()\n\t >>ins.second.real()>>ins.second.imag();\n getindex(ins.first,M);\n getindex(ins.second,M);\n if (ins.second < ins.first)swap(ins.first,ins.second);\n if (ins.first.real() == ins.second.real())ver.pb(ins);\n else hor.pb(ins);\n }\n \n state ini;\n ini.cnt=0;\n ini.n=ma+mi;\n ini.goal=0;\n rep(i,ma){\n P a;\n cin>>a.real()>>a.imag();\n isicpc[i]=false;\n ini.node[i] =getindex(a,M);\n }\n rep(i,mi){\n P b;\n cin>>b.real()>>b.imag();\n isicpc[ma+i]=true;\n ini.node[ma+i] =getindex(b,M);\n }\n\n rep(i,ma){\n P a;\n cin>>a.real()>>a.imag();\n isgoal[getindex(a,M)]=acmgoal;\n }\n rep(j,mi){\n P a;\n cin>>a.real()>>a.imag();\n isgoal[getindex(a,M)]=icpcgoal;\n }\n\n make_intersection(ver,hor,M);\n map<P,int>::iterator itr = M.begin();\n vector<P> node(M.size());\n while(itr != M.end()){\n node[(*itr).second]=(*itr).first;\n itr++;\n }\n\n rep(i,node.size()){\n rep(j,node.size()){\n\trep(k,node.size()){\n\t if (isp(node[i],node[j],node[k]))isptable[i][j][k]=true;\n\t}\n } \n }\n\n make_graph(node,hor,M);\n make_graph(node,ver,M);\n rep(i,ini.n){\n if ( isicpc[i]&&isgoal[ini.node[i]]==icpcgoal)ini.goal++;\n else if (!isicpc[i]&&isgoal[ini.node[i]]==acmgoal )ini.goal++;\n }\n\n sort(ini.node,ini.node+ma);\n sort(ini.node+ma,ini.node+ini.n);\n cout << bfs(M.size(),ini,node,ma)<<endl;\n }\n return false;\n}","accuracy":1,"time_ms":6420,"memory_kb":5028,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2041_124927","code_snippet":"#include<iostream>\n#include<complex>\n#include<map>\n#include<algorithm>\n#include<set>\n#include<queue>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define pb push_back\n#define mp make_pair\n#define ALL(c) (c).begin(),(c).end()\n\ntypedef complex<int> P;\ntypedef pair<P,P> Line;\ntypedef unsigned long long ull;\n\nconst int N = 20;\n\nnamespace std{\n bool operator<(const P &a,const P &b){\n if (a.real() != b.real())return a.real() < b.real();\n return a.imag() < b.imag();\n }\n}\n\nbool isp(P a,P b,P c){\n complex<double> A(a.real(),a.imag()),B(b.real(),b.imag()),C(c.real(),c.imag());\n return abs(A-C)+abs(B-C) < abs(A-B) + 1e-10;\n}\n\nbool isptable[N][N][N];\n\nbool edge[N][N];\n\nenum GOAL{icpcgoal=0,acmgoal=1,els=2};\nenum ICPC{icpc=0,acm=1};\nint isgoal[N];\n\nbool isicpc[8];\nclass state{\npublic:\n int n;\n int goal;\n short cnt;\n bool lastmove;\n short node[8];\n ull st;\n bool isclear();\n void makest();\n bool isvalid(int,int,vector<P>&);\n bool operator<(const state& a)const;\n};\n\nbool state::operator<(const state& a)const{\n return st < a.st;\n}\n\nbool state::isclear(){\n int cnt =0;\n rep(i,n){\n if (isicpc[i] &&isgoal[node[i]]==icpcgoal)cnt++;\n else if (!isicpc[i]&&isgoal[node[i]]==acmgoal )cnt++;\n }\n return cnt == n;\n}\n\nbool state::isvalid(int ii,int prev,vector<P>&p){\n rep(i,n){\n if (i == ii)continue;\n if (isptable[prev][node[ii]][node[i]])\n return false;\n }\n rep(i,n){\n REP(j,i+1,n){\n if (node[i] == node[j])return false;\n if (isicpc[i] != isicpc[j] &&\n\t edge[node[i]][node[j]])return false;\n }\n }\n return true;\n}\n\nvoid state::makest(){\n st=lastmove;\n rep(i,n){\n st=st*18 + node[i];\n }\n}\n\nint bfs(int n,state ini,vector<P> &node,int ma){\n queue<state> Q; \n set<ull> S;\n ini.lastmove=icpc;\n ini.makest();\n Q.push(ini);\n S.insert(ini.st);\n ini.lastmove=acm;\n ini.makest();\n Q.push(ini);\n S.insert(ini.st);\n if (ini.isclear())return 0;\n\n while(!Q.empty()){\n state now = Q.front();Q.pop();\n int curmove=now.lastmove==icpc?acm:icpc;\n rep(i,now.n){\n if (curmove==icpc && !isicpc[i])continue;\n if (curmove==acm && isicpc[i])continue;\n rep(j,n){\n\tif (!edge[now.node[i]][j])continue;\n\tstate next = now;\n\tnext.cnt++;\n\tnext.lastmove=curmove;\n\tnext.node[i]=j;\n\tif (!next.isvalid(i,now.node[i],node))continue;\n\tsort(next.node,next.node+ma);\n\tsort(next.node+ma,next.node+next.n);\n\tnext.makest();\n\tif (S.find(next.st) == S.end()){\n\t if (next.isclear()){\n\t return next.cnt;\n\t }\n\t S.insert(next.st);\n\t Q.push(next);\n\t}\n }\n } \n }\n return -1;\n}\n\nint getindex(P &a,map<P,int> &M){\n int index = M.size();\n if (M.find(a) == M.end())M[a]=index;\n return M[a];\n}\n\nvoid make_intersection(vector<Line> ver,vector<Line>hor, map<P,int> &M){\n rep(i,ver.size()){\n rep(j,hor.size()){\n if (ver[i].first.imag() <= hor[j].first.imag() &&\n\t ver[i].second.imag() >= hor[j].first.imag() &&\n\t hor[j].first.real() <= ver[i].first.real() &&\n\t hor[j].second.real() >= ver[i].first.real()){\n\tP ins(ver[i].first.real(),hor[j].first.imag());\n\tgetindex(ins,M);\n }\n }\n }\n}\n\nvoid make_graph(vector<P> node,vector<Line> ver,\n\t\tmap<P,int> M){\n rep(i,ver.size()){\n vector<int> connect;\n rep(j,node.size()){\n if (isptable[M[ver[i].first]][M[ver[i].second]][j]){\n\tconnect.pb(M[node[j]]);\n }\n }\n rep(j,connect.size()){\n REP(k,j+1,connect.size()){\n\tedge[connect[j]][connect[k]]=edge[connect[k]][connect[j]]=true;\n }\n }\n }\n}\n\nmain(){\n int n,ma,mi;\n while(cin>>n>>ma>>mi && n){\n rep(i,N){\n rep(j,N)edge[i][j]=false;\n isgoal[i]=els;\n }\n rep(i,N)rep(j,N)rep(k,N)isptable[i][j][k]=false;\n vector<Line> hor,ver;\n map<P,int> M;\n rep(i,n){\n Line ins;\n cin>>ins.first.real()>>ins.first.imag()\n\t >>ins.second.real()>>ins.second.imag();\n getindex(ins.first,M);\n getindex(ins.second,M);\n if (ins.second < ins.first)swap(ins.first,ins.second);\n if (ins.first.real() == ins.second.real())ver.pb(ins);\n else hor.pb(ins);\n }\n \n state ini;\n ini.cnt=0;\n ini.n=ma+mi;\n ini.goal=0;\n rep(i,ma){\n P a;\n cin>>a.real()>>a.imag();\n isicpc[i]=false;\n ini.node[i] =getindex(a,M);\n }\n rep(i,mi){\n P b;\n cin>>b.real()>>b.imag();\n isicpc[ma+i]=true;\n ini.node[ma+i] =getindex(b,M);\n }\n\n rep(i,ma){\n P a;\n cin>>a.real()>>a.imag();\n isgoal[getindex(a,M)]=acmgoal;\n }\n rep(j,mi){\n P a;\n cin>>a.real()>>a.imag();\n isgoal[getindex(a,M)]=icpcgoal;\n }\n\n make_intersection(ver,hor,M);\n map<P,int>::iterator itr = M.begin();\n vector<P> node(M.size());\n while(itr != M.end()){\n node[(*itr).second]=(*itr).first;\n itr++;\n }\n\n rep(i,node.size()){\n rep(j,node.size()){\n\trep(k,node.size()){\n\t if (isp(node[i],node[j],node[k]))isptable[i][j][k]=true;\n\t}\n } \n }\n\n make_graph(node,hor,M);\n make_graph(node,ver,M);\n rep(i,ini.n){\n if ( isicpc[i]&&isgoal[ini.node[i]]==icpcgoal)ini.goal++;\n else if (!isicpc[i]&&isgoal[ini.node[i]]==acmgoal )ini.goal++;\n }\n\n sort(ini.node,ini.node+ma);\n sort(ini.node+ma,ini.node+ini.n);\n cout << bfs(M.size(),ini,node,ma)<<endl;\n }\n return false;\n}","accuracy":1,"time_ms":6460,"memory_kb":5028,"score_of_the_acc":-1,"final_rank":2},{"submission_id":"aoj_2041_124925","code_snippet":"#include<iostream>\n#include<complex>\n#include<map>\n#include<algorithm>\n#include<set>\n#include<queue>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define pb push_back\n#define mp make_pair\n#define ALL(c) (c).begin(),(c).end()\n\ntypedef complex<int> P;\ntypedef pair<P,P> Line;\ntypedef unsigned long long ull;\n\nconst int N = 20;\n\nnamespace std{\n bool operator<(const P &a,const P &b){\n if (a.real() != b.real())return a.real() < b.real();\n return a.imag() < b.imag();\n }\n}\n\nbool isp(P a,P b,P c){\n complex<double> A(a.real(),a.imag()),B(b.real(),b.imag()),C(c.real(),c.imag());\n return abs(A-C)+abs(B-C) < abs(A-B) + 1e-10;\n}\n\nbool isptable[N][N][N];\n\nbool edge[N][N];\n\nenum GOAL{icpcgoal=0,acmgoal=1,els=2};\nenum ICPC{icpc=0,acm=1};\nint isgoal[N];\n\nbool isicpc[8];\nclass state{\npublic:\n int n;\n int goal;\n short cnt;\n bool lastmove;\n short node[8];\n ull st;\n bool isclear();\n void makest();\n bool isvalid(int,int,vector<P>&);\n bool operator<(const state& a)const;\n};\n\nbool state::operator<(const state& a)const{\n /*\n if (lastmove != a.lastmove)return lastmove<a.lastmove;\n rep(i,n){\n if (node[i] != a.node[i])return node[i] < a.node[i];\n }\n */\n return st < a.st;\n // return false;\n}\n\nbool state::isclear(){\n //return goal == n;\n \n int cnt =0;\n rep(i,n){\n if (isicpc[i] &&isgoal[node[i]]==icpcgoal)cnt++;\n else if (!isicpc[i]&&isgoal[node[i]]==acmgoal )cnt++;\n }\n return cnt == n;\n \n}\n\nbool state::isvalid(int ii,int prev,vector<P>&p){\n rep(i,n){\n if (i == ii)continue;\n if (isptable[prev][node[ii]][node[i]])\n return false;\n }\n rep(i,n){\n REP(j,i+1,n){\n if (node[i] == node[j])return false;\n if (isicpc[i] != isicpc[j] &&\n\t edge[node[i]][node[j]])return false;\n }\n }\n return true;\n}\n\nvoid state::makest(){\n st=lastmove;\n rep(i,n){\n st=st*18 + node[i];\n }\n}\n\nint bfs(int n,state ini,vector<P> &node,int ma){\n queue<state> Q; \n set<ull> S;\n ini.lastmove=icpc;\n ini.makest();\n Q.push(ini);\n S.insert(ini.st);\n ini.lastmove=acm;\n ini.makest();\n Q.push(ini);\n S.insert(ini.st);\n if (ini.isclear())return 0;\n\n while(!Q.empty()){\n state now = Q.front();Q.pop();\n // if (now.isclear()){\n // return now.cnt;\n // }\n int curmove=now.lastmove==icpc?acm:icpc;\n rep(i,now.n){\n if (curmove==icpc && !isicpc[i])continue;\n if (curmove==acm && isicpc[i])continue;\n // if (isicpc[i] &&isgoal[now.node[i]]==icpcgoal)continue;\n //else if (!isicpc[i]&&isgoal[now.node[i]]==acmgoal)continue;\n rep(j,n){\n\tif (!edge[now.node[i]][j])continue;\n\tstate next = now;\n\tnext.cnt++;\n\tnext.lastmove=curmove;\n\tnext.node[i]=j;\n\tif (!next.isvalid(i,now.node[i],node))continue;\n\tsort(next.node,next.node+ma);\n\tsort(next.node+ma,next.node+next.n);\n\tnext.makest();\n\tif (S.find(next.st) == S.end()){\n\t /*\n\t cout << next.cnt << endl;\n\t rep(k,now.n){\n\t cout << node[now.node[k]]<<\" \" << node[next.node[k]]<<\n\t \" \"<< now.isicpc[k] << endl;\n\t }\n\t cout << \"end \"<< endl;\n\t */\n\t //if ( isicpc[i]&&isgoal[next.node[i]]==icpcgoal)next.goal++;\n\t //\t else if (!isicpc[i]&&isgoal[next.node[i]]==acmgoal )next.goal++;\n\n\t if (next.isclear()){\n\t //cout << S.size()<<\" \" << Q.size() << endl;\n\t return next.cnt;\n\t }\n\t S.insert(next.st);\n\t Q.push(next);\n\t}\n }\n } \n }\n return -1;\n}\n\nint getindex(P &a,map<P,int> &M){\n int index = M.size();\n if (M.find(a) == M.end())M[a]=index;\n return M[a];\n}\n\nvoid make_intersection(vector<Line> ver,vector<Line>hor, map<P,int> &M){\n rep(i,ver.size()){\n \n rep(j,hor.size()){\n if (ver[i].first.imag() <= hor[j].first.imag() &&\n\t ver[i].second.imag() >= hor[j].first.imag() &&\n\t hor[j].first.real() <= ver[i].first.real() &&\n\t hor[j].second.real() >= ver[i].first.real()){\n\tP ins(ver[i].first.real(),hor[j].first.imag());\n\tgetindex(ins,M);\n }\n }\n }\n}\n\nvoid make_graph(vector<P> node,vector<Line> ver,\n\t\tmap<P,int> M){\n rep(i,ver.size()){\n vector<int> connect;\n rep(j,node.size()){\n // if (isp(ver[i].first,ver[i].second,node[j])){\n if (isptable[M[ver[i].first]][M[ver[i].second]][j]){\n\t//cout << isptable[M[ver[i].first]][M[ver[i].second]][j] << endl;\n\tconnect.pb(M[node[j]]);\n }\n }\n \n rep(j,connect.size()){\n REP(k,j+1,connect.size()){\n\tedge[connect[j]][connect[k]]=true;\n\tedge[connect[k]][connect[j]]=true;\n }\n }\n }\n}\n\nmain(){\n int n,ma,mi;\n while(cin>>n>>ma>>mi && n){\n rep(i,N){\n rep(j,N)edge[i][j]=false;\n isgoal[i]=els;\n }\n rep(i,N)rep(j,N)rep(k,N)isptable[i][j][k]=false;\n vector<Line> hor,ver;\n map<P,int> M;\n rep(i,n){\n Line ins;\n cin>>ins.first.real()>>ins.first.imag()\n\t >>ins.second.real()>>ins.second.imag();\n getindex(ins.first,M);\n getindex(ins.second,M);\n if (ins.second < ins.first)swap(ins.first,ins.second);\n if (ins.first.real() == ins.second.real())ver.pb(ins);\n else hor.pb(ins);\n }\n \n state ini;\n ini.cnt=0;\n ini.n=ma+mi;\n ini.goal=0;\n rep(i,ma){\n P a;\n cin>>a.real()>>a.imag();\n isicpc[i]=false;\n ini.node[i] =getindex(a,M);\n }\n rep(i,mi){\n P b;\n cin>>b.real()>>b.imag();\n isicpc[ma+i]=true;\n ini.node[ma+i] =getindex(b,M);\n }\n\n rep(i,ma){\n P a;\n cin>>a.real()>>a.imag();\n isgoal[getindex(a,M)]=acmgoal;\n }\n rep(j,mi){\n P a;\n cin>>a.real()>>a.imag();\n isgoal[getindex(a,M)]=icpcgoal;\n }\n\n\n make_intersection(ver,hor,M);\n map<P,int>::iterator itr = M.begin();\n vector<P> node(M.size());\n while(itr != M.end()){\n node[(*itr).second]=(*itr).first;\n itr++;\n }\n\n rep(i,node.size()){\n rep(j,node.size()){\n\trep(k,node.size()){\n\t if (isp(node[i],node[j],node[k]))isptable[i][j][k]=true;\n\t}\n } \n }\n\n make_graph(node,hor,M);\n make_graph(node,ver,M);\n rep(i,ini.n){\n if ( isicpc[i]&&isgoal[ini.node[i]]==icpcgoal)ini.goal++;\n else if (!isicpc[i]&&isgoal[ini.node[i]]==acmgoal )ini.goal++;\n }\n\n sort(ini.node,ini.node+ma);\n sort(ini.node+ma,ini.node+ini.n);\n // rep(i,ini.n){\n // cout << i <<\" \" << node[ini.node[i]]<<\" \" << isicpc[i] << endl;\n // }\n /* \n rep(i,M.size()){\n cout << node[i] <<\"-\";\n rep(j,M.size()){\n\tif (edge[i][j])cout << node[j];\n }\n cout << endl;\n }\n cout <<\"end \"<< endl;\n */ \n \n /* rep(i,node.size()){\n cout <<i <<\" \" << node[i] << endl;\n }\n rep(i,M.size()){\n rep(j,M.size()){\n\tif (edge[i][j] != edge[j][i]){\n\t cout <<\"error\" << endl;\n\t exit(1);\n\t}\n\tcout << edge[i][j];\n }\n cout << endl;\n }\n */ \n\n cout << bfs(M.size(),ini,node,ma)<<endl;\n }\n return false;\n}","accuracy":1,"time_ms":6420,"memory_kb":5032,"score_of_the_acc":-1,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_2041_124929\",\n \"code_snippet\": \"#include<iostream>\\n#include<complex>\\n#include<map>\\n#include<algorithm>\\n#include<set>\\n#include<queue>\\nusing namespace std;\\n#define REP(i,b,n) for(int i=b;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define pb push_back\\n#define mp make_pair\\n#define ALL(c) (c).begin(),(c).end()\\n\\ntypedef complex<int> P;\\ntypedef pair<P,P> Line;\\ntypedef unsigned long long ull;\\n\\nconst int N = 20;\\n\\nnamespace std{\\n bool operator<(const P &a,const P &b){\\n if (a.real() != b.real())return a.real() < b.real();\\n return a.imag() < b.imag();\\n }\\n}\\n\\nbool isp(P a,P b,P c){\\n complex<double> A(a.real(),a.imag()),B(b.real(),b.imag()),C(c.real(),c.imag());\\n return abs(A-C)+abs(B-C) < abs(A-B) + 1e-10;\\n}\\n\\nbool isptable[N][N][N];\\nbool edge[N][N];\\n\\nenum {icpcgoal=0,acmgoal=1,els=2};\\nenum {icpc=0,acm=1};\\nint isgoal[N];\\n\\nbool isicpc[8];\\nclass state{\\npublic:\\n int n;\\n int goal;\\n short cnt;\\n bool lastmove;\\n short node[8];\\n ull st;\\n bool isclear();\\n void makest();\\n bool isvalid(int,int,vector<P>&);\\n bool operator<(const state& a)const;\\n};\\n\\nbool state::operator<(const state& a)const{\\n return st < a.st;\\n}\\n\\nbool state::isclear(){\\n int cnt =0;\\n rep(i,n){\\n if (isicpc[i] &&isgoal[node[i]]==icpcgoal)cnt++;\\n else if (!isicpc[i]&&isgoal[node[i]]==acmgoal )cnt++;\\n }\\n return cnt == n;\\n}\\n\\nbool state::isvalid(int ii,int prev,vector<P>&p){\\n rep(i,n){\\n if (i == ii)continue;\\n if (isptable[prev][node[ii]][node[i]])\\n return false;\\n }\\n rep(i,n){\\n REP(j,i+1,n){\\n if (node[i] == node[j])return false;\\n if (isicpc[i] != isicpc[j] &&\\n\\t edge[node[i]][node[j]])return false;\\n }\\n }\\n return true;\\n}\\n\\nvoid state::makest(){\\n st=lastmove;\\n rep(i,n){\\n st=st*18 + node[i];\\n }\\n}\\n\\nint bfs(int n,state ini,vector<P> &node,int ma){\\n queue<state> Q; \\n set<ull> S;\\n ini.lastmove=icpc;\\n ini.makest();\\n Q.push(ini);\\n S.insert(ini.st);\\n ini.lastmove=acm;\\n ini.makest();\\n Q.push(ini);\\n S.insert(ini.st);\\n if (ini.isclear())return 0;\\n\\n while(!Q.empty()){\\n state now = Q.front();Q.pop();\\n int curmove=now.lastmove==icpc?acm:icpc;\\n rep(i,now.n){\\n if (curmove==icpc && !isicpc[i])continue;\\n if (curmove==acm && isicpc[i])continue;\\n rep(j,n){\\n\\tif (!edge[now.node[i]][j])continue;\\n\\tstate next = now;\\n\\tnext.cnt++;\\n\\tnext.lastmove=curmove;\\n\\tnext.node[i]=j;\\n\\tif (!next.isvalid(i,now.node[i],node))continue;\\n\\tsort(next.node,next.node+ma);\\n\\tsort(next.node+ma,next.node+next.n);\\n\\tnext.makest();\\n\\tif (S.find(next.st) == S.end()){\\n\\t if (next.isclear()){\\n\\t return next.cnt;\\n\\t }\\n\\t S.insert(next.st);\\n\\t Q.push(next);\\n\\t}\\n }\\n } \\n }\\n return -1;\\n}\\n\\nint getindex(P &a,map<P,int> &M){\\n int index = M.size();\\n if (M.find(a) == M.end())M[a]=index;\\n return M[a];\\n}\\n\\nvoid make_intersection(vector<Line> ver,vector<Line>hor, map<P,int> &M){\\n rep(i,ver.size()){\\n rep(j,hor.size()){\\n if (ver[i].first.imag() <= hor[j].first.imag() &&\\n\\t ver[i].second.imag() >= hor[j].first.imag() &&\\n\\t hor[j].first.real() <= ver[i].first.real() &&\\n\\t hor[j].second.real() >= ver[i].first.real()){\\n\\tP ins(ver[i].first.real(),hor[j].first.imag());\\n\\tgetindex(ins,M);\\n }\\n }\\n }\\n}\\n\\nvoid make_graph(vector<P> node,vector<Line> ver,\\n\\t\\tmap<P,int> M){\\n rep(i,ver.size()){\\n vector<int> connect;\\n rep(j,node.size()){\\n if (isptable[M[ver[i].first]][M[ver[i].second]][j]){\\n\\tconnect.pb(M[node[j]]);\\n }\\n }\\n rep(j,connect.size()){\\n REP(k,j+1,connect.size()){\\n\\tedge[connect[j]][connect[k]]=edge[connect[k]][connect[j]]=true;\\n }\\n }\\n }\\n}\\n\\nmain(){\\n int n,ma,mi;\\n while(cin>>n>>ma>>mi && n){\\n rep(i,N){\\n rep(j,N)edge[i][j]=false;\\n isgoal[i]=els;\\n }\\n rep(i,N)rep(j,N)rep(k,N)isptable[i][j][k]=false;\\n vector<Line> hor,ver;\\n map<P,int> M;\\n rep(i,n){\\n Line ins;\\n cin>>ins.first.real()>>ins.first.imag()\\n\\t >>ins.second.real()>>ins.second.imag();\\n getindex(ins.first,M);\\n getindex(ins.second,M);\\n if (ins.second < ins.first)swap(ins.first,ins.second);\\n if (ins.first.real() == ins.second.real())ver.pb(ins);\\n else hor.pb(ins);\\n }\\n \\n state ini;\\n ini.cnt=0;\\n ini.n=ma+mi;\\n ini.goal=0;\\n rep(i,ma){\\n P a;\\n cin>>a.real()>>a.imag();\\n isicpc[i]=false;\\n ini.node[i] =getindex(a,M);\\n }\\n rep(i,mi){\\n P b;\\n cin>>b.real()>>b.imag();\\n isicpc[ma+i]=true;\\n ini.node[ma+i] =getindex(b,M);\\n }\\n\\n rep(i,ma){\\n P a;\\n cin>>a.real()>>a.imag();\\n isgoal[getindex(a,M)]=acmgoal;\\n }\\n rep(j,mi){\\n P a;\\n cin>>a.real()>>a.imag();\\n isgoal[getindex(a,M)]=icpcgoal;\\n }\\n\\n make_intersection(ver,hor,M);\\n map<P,int>::iterator itr = M.begin();\\n vector<P> node(M.size());\\n while(itr != M.end()){\\n node[(*itr).second]=(*itr).first;\\n itr++;\\n }\\n\\n rep(i,node.size()){\\n rep(j,node.size()){\\n\\trep(k,node.size()){\\n\\t if (isp(node[i],node[j],node[k]))isptable[i][j][k]=true;\\n\\t}\\n } \\n }\\n\\n make_graph(node,hor,M);\\n make_graph(node,ver,M);\\n rep(i,ini.n){\\n if ( isicpc[i]&&isgoal[ini.node[i]]==icpcgoal)ini.goal++;\\n else if (!isicpc[i]&&isgoal[ini.node[i]]==acmgoal )ini.goal++;\\n }\\n\\n sort(ini.node,ini.node+ma);\\n sort(ini.node+ma,ini.node+ini.n);\\n cout << bfs(M.size(),ini,node,ma)<<endl;\\n }\\n return false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6420,\n \"memory_kb\": 5028,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2041_124927\",\n \"code_snippet\": \"#include<iostream>\\n#include<complex>\\n#include<map>\\n#include<algorithm>\\n#include<set>\\n#include<queue>\\nusing namespace std;\\n#define REP(i,b,n) for(int i=b;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define pb push_back\\n#define mp make_pair\\n#define ALL(c) (c).begin(),(c).end()\\n\\ntypedef complex<int> P;\\ntypedef pair<P,P> Line;\\ntypedef unsigned long long ull;\\n\\nconst int N = 20;\\n\\nnamespace std{\\n bool operator<(const P &a,const P &b){\\n if (a.real() != b.real())return a.real() < b.real();\\n return a.imag() < b.imag();\\n }\\n}\\n\\nbool isp(P a,P b,P c){\\n complex<double> A(a.real(),a.imag()),B(b.real(),b.imag()),C(c.real(),c.imag());\\n return abs(A-C)+abs(B-C) < abs(A-B) + 1e-10;\\n}\\n\\nbool isptable[N][N][N];\\n\\nbool edge[N][N];\\n\\nenum GOAL{icpcgoal=0,acmgoal=1,els=2};\\nenum ICPC{icpc=0,acm=1};\\nint isgoal[N];\\n\\nbool isicpc[8];\\nclass state{\\npublic:\\n int n;\\n int goal;\\n short cnt;\\n bool lastmove;\\n short node[8];\\n ull st;\\n bool isclear();\\n void makest();\\n bool isvalid(int,int,vector<P>&);\\n bool operator<(const state& a)const;\\n};\\n\\nbool state::operator<(const state& a)const{\\n return st < a.st;\\n}\\n\\nbool state::isclear(){\\n int cnt =0;\\n rep(i,n){\\n if (isicpc[i] &&isgoal[node[i]]==icpcgoal)cnt++;\\n else if (!isicpc[i]&&isgoal[node[i]]==acmgoal )cnt++;\\n }\\n return cnt == n;\\n}\\n\\nbool state::isvalid(int ii,int prev,vector<P>&p){\\n rep(i,n){\\n if (i == ii)continue;\\n if (isptable[prev][node[ii]][node[i]])\\n return false;\\n }\\n rep(i,n){\\n REP(j,i+1,n){\\n if (node[i] == node[j])return false;\\n if (isicpc[i] != isicpc[j] &&\\n\\t edge[node[i]][node[j]])return false;\\n }\\n }\\n return true;\\n}\\n\\nvoid state::makest(){\\n st=lastmove;\\n rep(i,n){\\n st=st*18 + node[i];\\n }\\n}\\n\\nint bfs(int n,state ini,vector<P> &node,int ma){\\n queue<state> Q; \\n set<ull> S;\\n ini.lastmove=icpc;\\n ini.makest();\\n Q.push(ini);\\n S.insert(ini.st);\\n ini.lastmove=acm;\\n ini.makest();\\n Q.push(ini);\\n S.insert(ini.st);\\n if (ini.isclear())return 0;\\n\\n while(!Q.empty()){\\n state now = Q.front();Q.pop();\\n int curmove=now.lastmove==icpc?acm:icpc;\\n rep(i,now.n){\\n if (curmove==icpc && !isicpc[i])continue;\\n if (curmove==acm && isicpc[i])continue;\\n rep(j,n){\\n\\tif (!edge[now.node[i]][j])continue;\\n\\tstate next = now;\\n\\tnext.cnt++;\\n\\tnext.lastmove=curmove;\\n\\tnext.node[i]=j;\\n\\tif (!next.isvalid(i,now.node[i],node))continue;\\n\\tsort(next.node,next.node+ma);\\n\\tsort(next.node+ma,next.node+next.n);\\n\\tnext.makest();\\n\\tif (S.find(next.st) == S.end()){\\n\\t if (next.isclear()){\\n\\t return next.cnt;\\n\\t }\\n\\t S.insert(next.st);\\n\\t Q.push(next);\\n\\t}\\n }\\n } \\n }\\n return -1;\\n}\\n\\nint getindex(P &a,map<P,int> &M){\\n int index = M.size();\\n if (M.find(a) == M.end())M[a]=index;\\n return M[a];\\n}\\n\\nvoid make_intersection(vector<Line> ver,vector<Line>hor, map<P,int> &M){\\n rep(i,ver.size()){\\n rep(j,hor.size()){\\n if (ver[i].first.imag() <= hor[j].first.imag() &&\\n\\t ver[i].second.imag() >= hor[j].first.imag() &&\\n\\t hor[j].first.real() <= ver[i].first.real() &&\\n\\t hor[j].second.real() >= ver[i].first.real()){\\n\\tP ins(ver[i].first.real(),hor[j].first.imag());\\n\\tgetindex(ins,M);\\n }\\n }\\n }\\n}\\n\\nvoid make_graph(vector<P> node,vector<Line> ver,\\n\\t\\tmap<P,int> M){\\n rep(i,ver.size()){\\n vector<int> connect;\\n rep(j,node.size()){\\n if (isptable[M[ver[i].first]][M[ver[i].second]][j]){\\n\\tconnect.pb(M[node[j]]);\\n }\\n }\\n rep(j,connect.size()){\\n REP(k,j+1,connect.size()){\\n\\tedge[connect[j]][connect[k]]=edge[connect[k]][connect[j]]=true;\\n }\\n }\\n }\\n}\\n\\nmain(){\\n int n,ma,mi;\\n while(cin>>n>>ma>>mi && n){\\n rep(i,N){\\n rep(j,N)edge[i][j]=false;\\n isgoal[i]=els;\\n }\\n rep(i,N)rep(j,N)rep(k,N)isptable[i][j][k]=false;\\n vector<Line> hor,ver;\\n map<P,int> M;\\n rep(i,n){\\n Line ins;\\n cin>>ins.first.real()>>ins.first.imag()\\n\\t >>ins.second.real()>>ins.second.imag();\\n getindex(ins.first,M);\\n getindex(ins.second,M);\\n if (ins.second < ins.first)swap(ins.first,ins.second);\\n if (ins.first.real() == ins.second.real())ver.pb(ins);\\n else hor.pb(ins);\\n }\\n \\n state ini;\\n ini.cnt=0;\\n ini.n=ma+mi;\\n ini.goal=0;\\n rep(i,ma){\\n P a;\\n cin>>a.real()>>a.imag();\\n isicpc[i]=false;\\n ini.node[i] =getindex(a,M);\\n }\\n rep(i,mi){\\n P b;\\n cin>>b.real()>>b.imag();\\n isicpc[ma+i]=true;\\n ini.node[ma+i] =getindex(b,M);\\n }\\n\\n rep(i,ma){\\n P a;\\n cin>>a.real()>>a.imag();\\n isgoal[getindex(a,M)]=acmgoal;\\n }\\n rep(j,mi){\\n P a;\\n cin>>a.real()>>a.imag();\\n isgoal[getindex(a,M)]=icpcgoal;\\n }\\n\\n make_intersection(ver,hor,M);\\n map<P,int>::iterator itr = M.begin();\\n vector<P> node(M.size());\\n while(itr != M.end()){\\n node[(*itr).second]=(*itr).first;\\n itr++;\\n }\\n\\n rep(i,node.size()){\\n rep(j,node.size()){\\n\\trep(k,node.size()){\\n\\t if (isp(node[i],node[j],node[k]))isptable[i][j][k]=true;\\n\\t}\\n } \\n }\\n\\n make_graph(node,hor,M);\\n make_graph(node,ver,M);\\n rep(i,ini.n){\\n if ( isicpc[i]&&isgoal[ini.node[i]]==icpcgoal)ini.goal++;\\n else if (!isicpc[i]&&isgoal[ini.node[i]]==acmgoal )ini.goal++;\\n }\\n\\n sort(ini.node,ini.node+ma);\\n sort(ini.node+ma,ini.node+ini.n);\\n cout << bfs(M.size(),ini,node,ma)<<endl;\\n }\\n return false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6460,\n \"memory_kb\": 5028,\n \"score_of_the_acc\": -1,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2041_124925\",\n \"code_snippet\": \"#include<iostream>\\n#include<complex>\\n#include<map>\\n#include<algorithm>\\n#include<set>\\n#include<queue>\\nusing namespace std;\\n#define REP(i,b,n) for(int i=b;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define pb push_back\\n#define mp make_pair\\n#define ALL(c) (c).begin(),(c).end()\\n\\ntypedef complex<int> P;\\ntypedef pair<P,P> Line;\\ntypedef unsigned long long ull;\\n\\nconst int N = 20;\\n\\nnamespace std{\\n bool operator<(const P &a,const P &b){\\n if (a.real() != b.real())return a.real() < b.real();\\n return a.imag() < b.imag();\\n }\\n}\\n\\nbool isp(P a,P b,P c){\\n complex<double> A(a.real(),a.imag()),B(b.real(),b.imag()),C(c.real(),c.imag());\\n return abs(A-C)+abs(B-C) < abs(A-B) + 1e-10;\\n}\\n\\nbool isptable[N][N][N];\\n\\nbool edge[N][N];\\n\\nenum GOAL{icpcgoal=0,acmgoal=1,els=2};\\nenum ICPC{icpc=0,acm=1};\\nint isgoal[N];\\n\\nbool isicpc[8];\\nclass state{\\npublic:\\n int n;\\n int goal;\\n short cnt;\\n bool lastmove;\\n short node[8];\\n ull st;\\n bool isclear();\\n void makest();\\n bool isvalid(int,int,vector<P>&);\\n bool operator<(const state& a)const;\\n};\\n\\nbool state::operator<(const state& a)const{\\n /*\\n if (lastmove != a.lastmove)return lastmove<a.lastmove;\\n rep(i,n){\\n if (node[i] != a.node[i])return node[i] < a.node[i];\\n }\\n */\\n return st < a.st;\\n // return false;\\n}\\n\\nbool state::isclear(){\\n //return goal == n;\\n \\n int cnt =0;\\n rep(i,n){\\n if (isicpc[i] &&isgoal[node[i]]==icpcgoal)cnt++;\\n else if (!isicpc[i]&&isgoal[node[i]]==acmgoal )cnt++;\\n }\\n return cnt == n;\\n \\n}\\n\\nbool state::isvalid(int ii,int prev,vector<P>&p){\\n rep(i,n){\\n if (i == ii)continue;\\n if (isptable[prev][node[ii]][node[i]])\\n return false;\\n }\\n rep(i,n){\\n REP(j,i+1,n){\\n if (node[i] == node[j])return false;\\n if (isicpc[i] != isicpc[j] &&\\n\\t edge[node[i]][node[j]])return false;\\n }\\n }\\n return true;\\n}\\n\\nvoid state::makest(){\\n st=lastmove;\\n rep(i,n){\\n st=st*18 + node[i];\\n }\\n}\\n\\nint bfs(int n,state ini,vector<P> &node,int ma){\\n queue<state> Q; \\n set<ull> S;\\n ini.lastmove=icpc;\\n ini.makest();\\n Q.push(ini);\\n S.insert(ini.st);\\n ini.lastmove=acm;\\n ini.makest();\\n Q.push(ini);\\n S.insert(ini.st);\\n if (ini.isclear())return 0;\\n\\n while(!Q.empty()){\\n state now = Q.front();Q.pop();\\n // if (now.isclear()){\\n // return now.cnt;\\n // }\\n int curmove=now.lastmove==icpc?acm:icpc;\\n rep(i,now.n){\\n if (curmove==icpc && !isicpc[i])continue;\\n if (curmove==acm && isicpc[i])continue;\\n // if (isicpc[i] &&isgoal[now.node[i]]==icpcgoal)continue;\\n //else if (!isicpc[i]&&isgoal[now.node[i]]==acmgoal)continue;\\n rep(j,n){\\n\\tif (!edge[now.node[i]][j])continue;\\n\\tstate next = now;\\n\\tnext.cnt++;\\n\\tnext.lastmove=curmove;\\n\\tnext.node[i]=j;\\n\\tif (!next.isvalid(i,now.node[i],node))continue;\\n\\tsort(next.node,next.node+ma);\\n\\tsort(next.node+ma,next.node+next.n);\\n\\tnext.makest();\\n\\tif (S.find(next.st) == S.end()){\\n\\t /*\\n\\t cout << next.cnt << endl;\\n\\t rep(k,now.n){\\n\\t cout << node[now.node[k]]<<\\\" \\\" << node[next.node[k]]<<\\n\\t \\\" \\\"<< now.isicpc[k] << endl;\\n\\t }\\n\\t cout << \\\"end \\\"<< endl;\\n\\t */\\n\\t //if ( isicpc[i]&&isgoal[next.node[i]]==icpcgoal)next.goal++;\\n\\t //\\t else if (!isicpc[i]&&isgoal[next.node[i]]==acmgoal )next.goal++;\\n\\n\\t if (next.isclear()){\\n\\t //cout << S.size()<<\\\" \\\" << Q.size() << endl;\\n\\t return next.cnt;\\n\\t }\\n\\t S.insert(next.st);\\n\\t Q.push(next);\\n\\t}\\n }\\n } \\n }\\n return -1;\\n}\\n\\nint getindex(P &a,map<P,int> &M){\\n int index = M.size();\\n if (M.find(a) == M.end())M[a]=index;\\n return M[a];\\n}\\n\\nvoid make_intersection(vector<Line> ver,vector<Line>hor, map<P,int> &M){\\n rep(i,ver.size()){\\n \\n rep(j,hor.size()){\\n if (ver[i].first.imag() <= hor[j].first.imag() &&\\n\\t ver[i].second.imag() >= hor[j].first.imag() &&\\n\\t hor[j].first.real() <= ver[i].first.real() &&\\n\\t hor[j].second.real() >= ver[i].first.real()){\\n\\tP ins(ver[i].first.real(),hor[j].first.imag());\\n\\tgetindex(ins,M);\\n }\\n }\\n }\\n}\\n\\nvoid make_graph(vector<P> node,vector<Line> ver,\\n\\t\\tmap<P,int> M){\\n rep(i,ver.size()){\\n vector<int> connect;\\n rep(j,node.size()){\\n // if (isp(ver[i].first,ver[i].second,node[j])){\\n if (isptable[M[ver[i].first]][M[ver[i].second]][j]){\\n\\t//cout << isptable[M[ver[i].first]][M[ver[i].second]][j] << endl;\\n\\tconnect.pb(M[node[j]]);\\n }\\n }\\n \\n rep(j,connect.size()){\\n REP(k,j+1,connect.size()){\\n\\tedge[connect[j]][connect[k]]=true;\\n\\tedge[connect[k]][connect[j]]=true;\\n }\\n }\\n }\\n}\\n\\nmain(){\\n int n,ma,mi;\\n while(cin>>n>>ma>>mi && n){\\n rep(i,N){\\n rep(j,N)edge[i][j]=false;\\n isgoal[i]=els;\\n }\\n rep(i,N)rep(j,N)rep(k,N)isptable[i][j][k]=false;\\n vector<Line> hor,ver;\\n map<P,int> M;\\n rep(i,n){\\n Line ins;\\n cin>>ins.first.real()>>ins.first.imag()\\n\\t >>ins.second.real()>>ins.second.imag();\\n getindex(ins.first,M);\\n getindex(ins.second,M);\\n if (ins.second < ins.first)swap(ins.first,ins.second);\\n if (ins.first.real() == ins.second.real())ver.pb(ins);\\n else hor.pb(ins);\\n }\\n \\n state ini;\\n ini.cnt=0;\\n ini.n=ma+mi;\\n ini.goal=0;\\n rep(i,ma){\\n P a;\\n cin>>a.real()>>a.imag();\\n isicpc[i]=false;\\n ini.node[i] =getindex(a,M);\\n }\\n rep(i,mi){\\n P b;\\n cin>>b.real()>>b.imag();\\n isicpc[ma+i]=true;\\n ini.node[ma+i] =getindex(b,M);\\n }\\n\\n rep(i,ma){\\n P a;\\n cin>>a.real()>>a.imag();\\n isgoal[getindex(a,M)]=acmgoal;\\n }\\n rep(j,mi){\\n P a;\\n cin>>a.real()>>a.imag();\\n isgoal[getindex(a,M)]=icpcgoal;\\n }\\n\\n\\n make_intersection(ver,hor,M);\\n map<P,int>::iterator itr = M.begin();\\n vector<P> node(M.size());\\n while(itr != M.end()){\\n node[(*itr).second]=(*itr).first;\\n itr++;\\n }\\n\\n rep(i,node.size()){\\n rep(j,node.size()){\\n\\trep(k,node.size()){\\n\\t if (isp(node[i],node[j],node[k]))isptable[i][j][k]=true;\\n\\t}\\n } \\n }\\n\\n make_graph(node,hor,M);\\n make_graph(node,ver,M);\\n rep(i,ini.n){\\n if ( isicpc[i]&&isgoal[ini.node[i]]==icpcgoal)ini.goal++;\\n else if (!isicpc[i]&&isgoal[ini.node[i]]==acmgoal )ini.goal++;\\n }\\n\\n sort(ini.node,ini.node+ma);\\n sort(ini.node+ma,ini.node+ini.n);\\n // rep(i,ini.n){\\n // cout << i <<\\\" \\\" << node[ini.node[i]]<<\\\" \\\" << isicpc[i] << endl;\\n // }\\n /* \\n rep(i,M.size()){\\n cout << node[i] <<\\\"-\\\";\\n rep(j,M.size()){\\n\\tif (edge[i][j])cout << node[j];\\n }\\n cout << endl;\\n }\\n cout <<\\\"end \\\"<< endl;\\n */ \\n \\n /* rep(i,node.size()){\\n cout <<i <<\\\" \\\" << node[i] << endl;\\n }\\n rep(i,M.size()){\\n rep(j,M.size()){\\n\\tif (edge[i][j] != edge[j][i]){\\n\\t cout <<\\\"error\\\" << endl;\\n\\t exit(1);\\n\\t}\\n\\tcout << edge[i][j];\\n }\\n cout << endl;\\n }\\n */ \\n\\n cout << bfs(M.size(),ini,node,ma)<<endl;\\n }\\n return false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6420,\n \"memory_kb\": 5032,\n \"score_of_the_acc\": -1,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":1071,"cells":{"group_id":{"kind":"string","value":"aoj_2033_cpp"},"problem_description":{"kind":"string","value":"Problem D:\nRock Man\nYou were the master craftsman in the stone age, and you devoted your life to carving many varieties of\ntools out of natural stones. Your works have ever been displayed respectfully in many museums, even in\n2006 A.D. However, most people visiting the museums do not spend so much time to look at your works.\nSeeing the situation from the Heaven, you brought back memories of those days you had frantically lived.\nOne day in your busiest days, you got a number of orders for making tools. Each order requested one\ntool which was different from the other orders. It often took some days to fill one order without special\ntools. But you could use tools which you had already made completely, in order to carve new tools more\nquickly. For each tool in the list of the orders, there was exactly one tool which could support carving it.\nIn those days, your schedule to fill the orders was not so efficient. You are now thinking of making the\nmost efficient schedule, i.e. the schedule for all orders being filled in the shortest days, using the program\nyou are going to write.\nInput\nThe input consists of a series of test cases. Each case begins with a line containing a single integer\nN\nwhich represents the number of ordered tools.\nThen\nN\nlines follow, each specifying an order by four elements separated by one or more space:\nname\n,\nday\n1\n,\nsup\nand\nday\n2\n.\nname\nis the name of the tool in the corresponding order.\nday\n1\nis the number of\nrequired days to make the tool without any support tool.\nsup\nis the name of the tool that can support\ncarving the target tool.\nday\n2\nis the number of required days make the tool with the corresponding support\ntool.\nThe input terminates with the case where\nN\n= 0. You should not process this case.\nYou can assume that the input follows the constraints below:\nN\n≤ 1000;\nname\nconsists of no longer than 32 non-space characters, and is unique in each case;\nsup\nis one of all\nnames\ngiven in the same case; and\n0 <\nday\n2\n<\nday\n1\n< 20000.\nOutput\nFor each test case, output a single line containing an integer which represents the minimum number of\ndays required to fill all\nN\norders.\nSample Input\n3\ngu 20 pa 10\nci 20 gu 10\npa 20 ci 10\n2\ntool 20 tool 10\nproduct 1000 tool 10\n8\nfishhook 21 disk 3\nmill 14 axe 7\nboomerang 56 sundial 28\nflint 35 fishhook 5\naxe 35 flint 14\ndisk 42 disk 2\nsundial 14 disk 7\nhammer 28 mill 7\n0\nOutput for the Sample Input\n40\n30\n113"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2033_10852644","code_snippet":"#include <bits/stdc++.h>\n \n#define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ )\n#define REP(i,n) FOR(i,0,n)\n#define YYS(x,arr) for(auto& x:arr)\n#define ALL(x) (x).begin(),(x).end()\n#define SORT(x) sort( (x).begin(),(x).end() )\n#define REVERSE(x) reverse( (x).begin(),(x).end() )\n#define UNIQUE(x) (x).erase( unique( ALL( (x) ) ) , (x).end() )\n#define PW(x) (1LL<<(x))\n#define SZ(x) ((ll)(x).size())\n#define SHOW(x) cout << #x << \" = \" << x << endl\n#define SHOWA(x,n) for( int yui = 0; yui < n; yui++ ){ cout << x[yui] << \" \"; } cout << endl\n\n#define pb emplace_back\n#define fi first\n#define se second\n\nusing namespace std;\n\ntypedef long double ld;\ntypedef long long int ll;\ntypedef pair<int,int> pi;\ntypedef pair<ll,ll> pl;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<bool> vb;\ntypedef vector<ld> vd;\ntypedef vector<pi> vpi;\ntypedef vector<pl> vpl;\ntypedef vector<vpl> gr;\ntypedef vector<vl> ml;\ntypedef vector<vd> md;\ntypedef vector<vi> mi;\n \nconst ll INF = (ll)1e9 + 10;\nconst ll INFLL = (ll)1e18 + 10;\nconst ld EPS = 1e-12;\nconst ll MOD = 1e9+7;\n \ntemplate<class T> T &chmin( T &a , const T &b ){ return a = min(a,b); }\ntemplate<class T> T &chmax( T &a , const T &b ){ return a = max(a,b); }\ntemplate<class T> inline T sq( T a ){ return a * a; }\n\nll in(){ long long int x; scanf( \"%lld\" , &x ); return x; }\nchar yuyushiki[1000010]; string stin(){ scanf( \"%s\" , yuyushiki ); return yuyushiki; }\n\n// head\n\nint n;\nmap<string,int> ma;\nint cnt;\n\nint c[1010];\nint d[1010];\nint to[1010];\n\nvi cycle;\nmi cs;\n\nint used[1010];\n\nvoid dfs( int x ){\n used[x] = 1;\n\n if( used[ to[x] ] == 0 ){\n dfs( to[x] );\n } else if( used[ to[x] ] == 1 ){\n int cur = x;\n do{\n cycle.pb( cur );\n cur = to[cur];\n } while( cur != x );\n }\n \n used[x] = 2;\n}\n\nint id( string s ){\n if( ma.find( s ) == ma.end() ){\n return ma[s] = cnt++;\n }\n return ma[s];\n}\n\nvoid solve(){\n ma.clear();\n cnt = 0;\n REP( i , n ){\n int a = id( stin() );\n c[a] = in();\n int b = id( stin() );\n d[a] = in();\n to[a] = b;\n }\n cs.clear();\n REP( i , n ){\n used[i] = 0;\n }\n REP( i , n ){\n if( used[i] == 0 ){\n cycle.clear();\n dfs( i );\n if( SZ(cycle) > 0 ){\n cs.pb( cycle );\n }\n }\n }\n int ans = 0;\n REP( i , n ){\n ans += d[i];\n }\n YYS( v , cs ){\n vi ws(0);\n YYS( w , v ){\n ws.pb( c[w] - d[w] );\n }\n SORT( ws );\n ans += ws[0];\n }\n printf( \"%d\\n\" , ans );\n}\n\nint main(){\n\n while( 1 ){\n n = in();\n if( n == 0 ){\n break;\n }\n solve();\n }\n \n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3604,"score_of_the_acc":-1,"final_rank":16},{"submission_id":"aoj_2033_2859241","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 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\nint get_id(string st,bool flag=false) {\n\tstatic map<string,int>mp;\n\tstatic int id=0;\n\tif (flag) {\n\t\tmp.clear();\n\t\tid=0;\n\t\treturn 0;\n\t}\n\tif (mp.find(st) == mp.end()) {\n\t\tmp[st]=id++;\n\t}\n\treturn mp[st];\n}\n\nint main() {\n\twhile (true) {\n\t\tget_id(\"\", true);\n\t\tint N;cin>>N;\n\t\tif(!N)break;\n\n\t\tvector<int>oris(N);\n\t\tvector<int>acomes(N);\n\t\tvector<vector<int>>edges(N);\n\n\t\tvector<int>ids(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tstring ast;\n\t\t\tint b;\n\t\t\tstring cst;\n\t\t\tint d;\n\t\t\tcin>>ast>>b>>cst>>d;\n\t\t\tint a=get_id(ast);\n\t\t\tint c=get_id(cst);\n\n\t\t\toris[i]=b;\n\t\t\tacomes[i]=d;\n\t\t\tif(a!=c)edges[c].push_back(a);\n\n\t\t\tids[a]=i;\n\t\t}\n\n\t\tauto p=dscc.get(edges);\n\n\t\tvector<int>comes(p.second.size());\n\t\tfor (auto es : p.second) {\n\t\t\tfor (auto e : es) {\n\t\t\t\tcomes[e]++;\n\t\t\t}\n\t\t\t\n\t\t}\n\n\t\tint ans=accumulate(acomes.begin(),acomes.end(),0);\n\t\tfor(int i=0;i<p.first.size();++i){\n\t\t\tif(comes[i])continue;\n\t\t\tauto v(p.first[i]);\n\t\t\tint minus_max=-1e9;\n\t\t\tfor (auto a : v) {\n\t\t\t\tminus_max=max(minus_max,acomes[ids[a]]-oris[ids[a]]);\n\t\t\t}\n\t\t\tans-=minus_max;\n\t\t}\n\t\tcout<<ans<<endl;\n\t\t\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3424,"score_of_the_acc":-1.0027,"final_rank":17},{"submission_id":"aoj_2033_2564715","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 GROUP{\n\tvector<int> nodes;\n};\n\n\nstruct Info{\n\tint day1,sup_id,day2;\n\tchar name[33],sup_name[33];\n};\n\nint N;\nint height[1000],parent[1000],num_in[1000];\n\nInfo info[1000];\nvector<int> G[1000];\nvector<int> reverse_G[1000];\n\nGROUP group[1000];\nstack<int> S;\n\nbool check[1000];\nint table[1000];\n\nint group_index;\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\n\nvoid dfs(int node_id){\n\tcheck[node_id] = true;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\tif(!check[G[node_id][i]])dfs(G[node_id][i]);\n\t}\n\tS.push(node_id);\n}\n\nvoid reverse_dfs(int node_id){\n\tcheck[node_id] = true;\n\n\tgroup[group_index].nodes.push_back(node_id);\n\ttable[node_id] = group_index;\n\n\tfor(int i = 0; i < reverse_G[node_id].size(); i++){\n\t\tif(!check[reverse_G[node_id][i]])reverse_dfs(reverse_G[node_id][i]);\n\t}\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < N; i++){\n\t\tgroup[i].nodes.clear();\n\t\tG[i].clear();\n\t\treverse_G[i].clear();\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%s %d %s %d\",info[i].name,&info[i].day1,info[i].sup_name,&info[i].day2);\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tif(strCmp(info[k].name,info[i].sup_name)){\n\t\t\t\tinfo[i].sup_id = k;\n\n\t\t\t\tif(i != k){\n\t\t\t\t\tG[k].push_back(i);\n\t\t\t\t\treverse_G[i].push_back(k);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N;i++)check[i] = false;\n\n\tfor(int i = 0; i < N;i++){\n\t\tif(!check[i])dfs(i);\n\t}\n\n\tfor(int i = 0; i < N;i++)check[i] = false;\n\n\tgroup_index = -1;\n\n\twhile(!S.empty()){\n\t\tif(!check[S.top()]){\n\t\t\tgroup_index++;\n\n\t\t\treverse_dfs(S.top());\n\t\t}\n\t\tS.pop();\n\t}\n\n\tfor(int i = 0; i < N; i++)num_in[i] = 0;\n\n\tint to_group,min_index,minimum;\n\n\tfor(int i = 0; i <= group_index; i++){\n\t\tfor(int k = 0; k < group[i].nodes.size(); k++){\n\t\t\tfor(int p = 0; p < G[group[i].nodes[k]].size(); p++){\n\t\t\t\tto_group = table[G[group[i].nodes[k]][p]];\n\t\t\t\tif(to_group != i)num_in[to_group]++;\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = 0;\n\n\tfor(int i = 0; i <= group_index;i++){\n\t\tif(group[i].nodes.size() == 1){\n\t\t\tif(num_in[i] == 0){\n\t\t\t\tans += info[group[i].nodes[0]].day1;\n\t\t\t}else{\n\t\t\t\tans += info[group[i].nodes[0]].day2;\n\t\t\t}\n\t\t}else{\n\n\t\t\tif(num_in[i] == 0){\n\t\t\t\tmin_index = 0;\n\t\t\t\tminimum = info[group[i].nodes[0]].day1 -info[group[i].nodes[0]].day2;\n\n\t\t\t\tfor(int k = 1; k < group[i].nodes.size(); k++){\n\t\t\t\t\tif(info[group[i].nodes[k]].day1 -info[group[i].nodes[k]].day2 < minimum){\n\t\t\t\t\t\tminimum = info[group[i].nodes[k]].day1 -info[group[i].nodes[k]].day2;\n\t\t\t\t\t\tmin_index = k;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tans += info[group[i].nodes[min_index]].day1;\n\t\t\t\tfor(int k = 0; k < group[i].nodes.size(); k++){\n\t\t\t\t\tif(k != min_index){\n\t\t\t\t\t\tans += info[group[i].nodes[k]].day2;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}else{\n\t\t\t\tfor(int k = 0; k < group[i].nodes.size(); k++){\n\t\t\t\t\tans += info[group[i].nodes[k]].day2;\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\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3556,"score_of_the_acc":-1.0393,"final_rank":19},{"submission_id":"aoj_2033_2212894","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint N;\nint day1[1111],day2[1111];\nstring name[1111],sup[1111];\nconst int INF = 1000000007;\nvector<int> G[1111];\nvector<int> rG[1111];\n\nbool used[1111];\nvector<int> V[1111];\nvector<int> vs;\nvoid init(){\n for(int i=0;i<N;i++) G[i].clear();\n for(int i=0;i<N;i++) rG[i].clear();\n for(int i=0;i<N;i++) V[i].clear(); \n}\nint dfs(int v){\n if( used[v] ) return 0;\n int res = 0;\n used[v] = true;\n for( int to : G[v] ){\n res += dfs( to );\n }\n vs.push_back( v );\n return res + day2[v];\n}\nvoid rdfs(int v,int cnt){\n if( used[v] ) return;\n used[v] = true;\n for( int to : rG[v] ) {\n rdfs( to, cnt );\n }\n V[cnt].push_back(v);\n}\nint scc(){\n memset( used, 0, sizeof( used ) );\n vs.clear();\n for(int i=0;i<N;i++){\n dfs( i );\n }\n memset( used, 0, sizeof( used ) );\n reverse( vs.begin(), vs.end() );\n int cnt = 0;\n for(int v : vs ){\n if( used[v] ) continue; \n rdfs( v, cnt++ );\n }\n return cnt;\n}\nvoid add_edge(int from,int to){\n G[from].push_back( to );\n rG[to].push_back( from );\n}\n\nint main(){\n while( cin >> N && N ){\n init();\n map<string,int> H;\n for(int i=0;i<N;i++){\n cin >> name[i] >> day1[i] >> sup[i] >> day2[i];\n H[name[i]] = i;\n }\n for(int i=0;i<N;i++)\n add_edge( H[sup[i]], H[name[i]] );\n\n int n = scc();\n int res = 0;\n memset( used, 0, sizeof( used ) );\n for(int i=0;i<n;i++){\n int sum = 0;\n int min_pc = INF;\n int nv = V[i].back();\n if( used[nv] ) continue;\n for( int v : V[i] ){\n sum += day2[v];\n min_pc = min( min_pc, day1[v] - day2[v] );\n }\n res += dfs(nv) + min_pc;\n }\n cout << res << endl;\n }\n}","accuracy":1,"time_ms":60,"memory_kb":3584,"score_of_the_acc":-1.0208,"final_rank":18},{"submission_id":"aoj_2033_1897792","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nconst int LMAX=2010;\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\tSCC(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\tvs=vi(0);\n\t}\n\tvoid add_edge(int s,int t){\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};\nvp in;\nvvi G,rG;\nvi visit;\nint out=0;\nvoid dfs(int a){\n\tout+=in[a].second;\n\tvisit[a]=true;\n\trep(i,G[a].size())if(visit[G[a][i]]==0)\n\t\tdfs(G[a][i]);\n}\nint main(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tmap<string,int>m;\n\t\tvector<string>a(n),c(n);\n\t\tvi b(n),d(n);\n\t\trep(i,n)cin>>a[i]>>b[i]>>c[i]>>d[i];\n\t\trep(i,n)m[a[i]]=i;\t\t\n\t\tSCC scc(n);\n\t\trep(i,n){\n\t\t\tif(a[i]!=c[i])scc.add_edge(m[c[i]],m[a[i]]);\n\t\t}\n\t\tint N=scc.scc();\n\t\tin=vp(N);\n\t\tG=rG=vvi(N);\n\t\trep(i,N){\n\t\t\tvi t;\n\t\t\trep(j,n)if(scc.cmp[j]==i)t.pb(j);\n\t\t\tif(t.size()==1){\n\t\t\t\tif(i!=scc.cmp[m[c[t[0]]]]){\n\t\t\t\t\trG[i].pb(scc.cmp[m[c[t[0]]]]);\n\t\t\t\t\tG[scc.cmp[m[c[t[0]]]]].pb(i);\n\t\t\t\t}\n\t\t\t\tin[i]=pii(b[t[0]],d[t[0]]);\n\t\t\t}else{\n\t\t\t\tint mi=inf,sum=0;\n\t\t\t\trep(j,t.size())sum+=d[t[j]];\n\t\t\t\trep(j,t.size())mi=min(mi,b[t[j]]-d[t[j]]);\n\t\t\t\tin[i]=pii(mi+sum,inf);\n\t\t\t}\n\t\t}\n\t\tvisit=vi(N);\n\t\tout=0;\n\t\trep(i,N)if(visit[i]==0&&rG[i].size()==0){\n\t\t\tout+=in[i].first-in[i].second;\n\t\t\tdfs(i);\n\t\t}\n\t\tcout<<out<<endl;\n\t\t\n\t}\n}","accuracy":1,"time_ms":150,"memory_kb":1712,"score_of_the_acc":-0.5606,"final_rank":15},{"submission_id":"aoj_2033_1354747","code_snippet":"#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 1000;\nconst int INF = 1 << 30;\n\n/* typedef */\n\ntypedef vector<int> vi;\ntypedef map<string,int> msi;\n\nstruct Tool {\n string name, sup;\n int day1, day2, diff, i, si;\n\n void print() {\n printf(\"Tool: %s(%d):%d, %s(%d):%d\\n\",\n\t name.c_str(), i, day1, sup.c_str(), si, day2);\n }\n};\n\n/* global variables */\n\nint n;\nTool tools[MAX_N];\nmsi nhash;\n\nbool used[MAX_N], tmpused[MAX_N];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n for (;;) {\n cin >> n;\n if (n == 0) break;\n\n nhash.clear();\n for (int i = 0; i < n; i++) {\n Tool& ti = tools[i];\n cin >> ti.name >> ti.day1 >> ti.sup >> ti.day2;\n ti.diff = ti.day1 - ti.day2;\n ti.i = i;\n ti.si = -1;\n nhash[ti.name] = i;\n }\n for (int i = 0; i < n; i++) {\n Tool& ti = tools[i];\n ti.si = nhash[ti.sup];\n //ti.print();\n }\n\n memset(used, false, sizeof(used));\n\n int minsum = 0;\n \n // find loops\n for (int i = 0; i < n; i++) {\n Tool& ti = tools[i];\n if (! used[i]) {\n\tmemset(tmpused, false, sizeof(tmpused));\n\ttmpused[i] = true;\n\tint j = ti.si;\n\tfor (; ! tmpused[j]; j = tools[j].si) {\n\t if (used[j]) break;\n\t tmpused[j] = true;\n\t}\n\tif (used[j]) continue;\n\n\tint sumloop = tools[j].day2;\n\tint mindiff = tools[j].diff;\n\n\tused[j] = true;\n\tfor (int k = tools[j].si; k != j; k = tools[k].si) {\n\t used[k] = true;\n\t sumloop += tools[k].day2;\n\t if (mindiff > tools[k].diff) mindiff = tools[k].diff;\n\t}\n\n\tminsum += sumloop + mindiff;\n }\n }\n //cout << ln << endl;\n\n // check leafs\n bool changed = true;\n while (changed) {\n changed = false;\n\n for (int i = 0; i < n; i++) {\n\tTool& ti = tools[i];\n\tif (! used[i] && used[ti.si]) {\n\t used[i] = true;\n\t minsum += ti.day2;\n\t changed = true;\n\t}\n }\n }\n \n cout << minsum << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":1412,"score_of_the_acc":-0.4247,"final_rank":3},{"submission_id":"aoj_2033_936863","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\nconst int IINF = INT_MAX;\n\nstruct Edge{\n int to,cost;\n Edge(int to=IINF,int cost=IINF):to(to),cost(cost){}\n};\n\nmap<string,int> mp;\nint day1[1100],N,par[1100],mp_idx;\nvector<Edge> G[1100];\nbool used[1100];\n\ninline int getIndex(string s){\n if( mp.find(s) == mp.end() ) return mp[s] = mp_idx++;\n return mp[s];\n}\n\ninline void init(){\n mp_idx = 0;\n mp.clear();\n rep(i,N) G[i].clear(), par[i] = i;\n}\n\nint find(int x){\n if( par[x] == x ) return par[x];\n return par[x] = find(par[x]);\n}\n\ninline void unit(int x,int y){\n x = find(x), y = find(y);\n if( x != y ) par[x] = par[y];\n}\n\nvoid dfs(int cur,int &cost){\n if( used[cur] ) return;\n used[cur] = true;\n rep(i,(int)G[cur].size()){\n int to = G[cur][i].to;\n if( !used[to] && par[cur] == par[to] ){\n cost += G[cur][i].cost;\n dfs(to,cost);\n }\n }\n}\n\ninline void compute(){\n set<int> S;\n rep(i,N) S.insert(find(i));\n int cnt = S.size();\n int mincost[N];\n rep(i,N) mincost[i] = IINF;\n rep(i,N){\n int idx = par[i];\n int cost = day1[i];\n rep(j,N) used[j] = false;\n dfs(i,cost);\n rep(j,N) if( !used[j] && par[j] == par[i] ) cost += day1[j];\n mincost[idx] = min(mincost[idx],cost);\n }\n int ans = 0;\n for( int i : S ) ans += mincost[i];\n cout << ans << endl;\n}\n\nint main(){\n while( cin >> N, N ){\n\n init();\n rep(i,N){\n string a,b;\n int c,d;\n cin >> a >> c >> b >> d;\n int ia = getIndex(a);\n day1[ia] = c;\n int ib = getIndex(b);\n if( ia == ib ) continue;\n G[ib].push_back(Edge(ia,d));\n unit(ia,ib);\n }\n\n compute();\n\n }\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":1468,"score_of_the_acc":-0.5126,"final_rank":13},{"submission_id":"aoj_2033_936650","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\nclass UnionFind{\npublic:\n vector<int> par, rank;\n\n void init(int n){\n par.resize(n);\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 x){\n if(par[x] == x) return x;\n else return par[x] = find(par[x]);\n }\n \n void unite(int x, int y){\n x = find(x);\n y = find(y);\n if(x == y) return;\n if(rank[x] < rank[y]) par[x] = par[y];\n else{\n par[y] = par[x];\n if(rank[x] == rank[y]) rank[x]++;\n }\n }\n};\n\ntypedef pair<int, int> P; // to, cost\nconst int MAX = 1005;\nmap<string, int> M;\nUnionFind uf;\nint cost[MAX],n;\nvector<P> E[MAX];\nbool used[MAX];\n\nint get_index(const string& s){\n if(M.count(s)) return M[s];\n else return M[s] = M.size()-1;\n}\n\nvoid init(){\n uf.init(n);\n M.clear();\n for(int i = 0; i < MAX; i++) E[i].clear();\n}\n\nvoid input(){\n for(int i = 0; i < n; i++){\n string a,b;\n int c,d;\n cin >> a >> c >> b >> d;\n cost[get_index(a)] = c;\n get_index(b);\n if(a == b) continue;\n E[get_index(b)].push_back(P(get_index(a), d));\n // cout << b << \" -> \" << a << endl;\n uf.unite(get_index(a), get_index(b));\n }\n}\n\nvoid dfs(int pos, P& p){ // vertex cost\n \n if(used[pos]) return;\n used[pos] = true;\n p.first++;\n\n for(int i = 0; i < (int)E[pos].size(); i++){\n if(!used[E[pos][i].first]){\n dfs(E[pos][i].first, p);\n p.second += E[pos][i].second;\n }\n }\n}\n\nvoid solve(){\n vector<int> v[MAX];\n for(int i = 0; i < n; i++) v[uf.find(i)].push_back(i);\n \n int ans = 0;\n\n for(int i = 0; i < MAX; i++){\n if(v[i].size() == 0) continue;\n int tmp = -1;\n for(int j = 0; j < (int)v[i].size(); j++){\n memset(used, false, sizeof(used));\n P p = P(0,0);\n dfs(v[i][j],p);\n p.second += cost[v[i][j]];\n/******* if(v[i][j] == 0){\n cout << p.first << \" \" << p.second << endl;\n }*/\n if((p.first == (int)v[i].size()) && (tmp == -1 || tmp > p.second)) tmp = p.second;\n }\n ans += tmp;\n }\n cout << ans << 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":160,"memory_kb":1512,"score_of_the_acc":-0.5116,"final_rank":11},{"submission_id":"aoj_2033_849140","code_snippet":"#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\n\nusing namespace std;\nint main(){\n int n;\n while(cin >> n && n){\n vector<string> name(n), sup(n);\n vector<int> high(n), low(n);\n REP(i, n) cin >> name[i] >> high[i] >> sup[i] >> low[i];\n map<string, int> index;\n REP(i, n) index[ name[i] ] = i;\n vector<int> color(n, 0);\n int ans = 0;\n REP(i, n) if(color[i] == 0){\n vector<int> list;\n int u = i;\n while(color[u] == 0){\n list.push_back(u);\n color[u] = 1;\n u = index[ sup[u] ];\n }\n if(color[u] == 1){\n int min_sum = INT_MAX;\n bool in_roop = false;\n for(int h : list){\n if(h == u) in_roop = true;\n if(!in_roop) continue;\n int sum = 0;\n for(int li : list){\n sum += (li == h ? high[li] : low[li]);\n }\n if(min_sum > sum) min_sum = sum;\n }\n ans += min_sum;\n }else if(color[u] == 2){\n for(int li : list){\n ans += low[li];\n }\n }\n for(int li : list){\n color[li] = 2;\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":1432,"score_of_the_acc":-0.4302,"final_rank":4},{"submission_id":"aoj_2033_528242","code_snippet":"//55\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<vector>\n#include<deque>\n\nusing namespace std;\n\nint n;\nstring na[1000],su[1000];\nint d[1000],dd[1000];\nmap<string,int> m;\nvector<int> ds[1000];\nbool p[1000];\nint cut[1000];\n\nint dfs(int x){\n if(p[x])return 0;\n int s=p[m[su[x]]]?d[x]-dd[x]:0;\n p[x]=true;\n for(int i=0;i<ds[x].size();i++){\n s+=dfs(ds[x][i]);\n }\n return s;\n}\n\nbool cmp(int a,int b){\n return cut[a]>cut[b];\n}\n\nint main(){\n while(cin>>n,n){\n m.clear();\n for(int i=0;i<n;i++){\n cin>>na[i]>>d[i]>>su[i]>>dd[i];\n m[na[i]]=i;\n }\n for(int i=0;i<n;i++){\n ds[i].clear();\n }\n for(int i=0;i<n;i++){\n ds[m[su[i]]].push_back(m[na[i]]);\n }\n for(int i=0;i<1000;i++){\n fill(p,p+n,false);\n cut[i]=dfs(i);\n }\n deque<int> ef(n);\n for(int i=0;i<n;i++){\n ef[i]=i;\n }\n sort(ef.begin(),ef.end(),cmp);\n bool done[1000]={};\n int a=0;\n for(int i=0;i<n;i++){\n for(int nt=0;nt<n;nt++){\n\tif(!done[nt]){\n\t if(done[m[su[nt]]]){\n\t a+=dd[nt];\n\t done[nt]=true;\n\t goto next;\n\t }\n\t}\n }\n while(done[ef[0]]){\n\tef.pop_front();\n }\n a+=d[ef[0]];\n done[ef[0]]=true;\n next:\n ;\n }\n cout<<a<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1540,"memory_kb":1604,"score_of_the_acc":-1.4451,"final_rank":20},{"submission_id":"aoj_2033_523414","code_snippet":"#include <iostream>\n#include <vector>\n#include <map>\n#include <climits>\n#include <cstring>\nusing namespace std;\n\ntypedef pair<int,int> P;\n\nint n, ans;\nint t[1002];\nvector<P> g[1002];\nmap<string,int> name;\nbool used[1002], loop[1002];\n\nint getId(string s){\n if(name.find(s) != name.end()){\n return name[s];\n }\n int size = name.size();\n return name[s] = size;\n}\n\nvoid solve(){\n memset(used, 0, sizeof(used));\n\n for(int i = 0; i < n; i++){\n if(used[i]) continue;\n\n memset(loop, 0, sizeof(loop));\n\n int id = i;\n bool flg = true;\n\n while(!loop[id]){\n if(used[id]){\n\tflg = false;\n\tbreak;\n }\n\n loop[id] = true;\n used[id] = true;\n id = g[id][0].first;\n }\n if(!flg) continue;\n\n int start = id;\n int minId = start;\n\n id = g[start][0].first;\n\n while(id != start){\n if(t[minId] - g[minId][0].second > t[id] - g[id][0].second){\n\tminId = id;\n }\n id = g[id][0].first;\n }\n\n ans += t[minId] - g[minId][0].second;\n }\n\n cout << ans << endl;\n}\n\nint main(){\n while(cin >> n, n){\n ans = 0;\n name.clear();\n\n for(int i = 0; i < 1002; i++){\n g[i].clear();\n }\n\n for(int i = 0; i < n; i++){\n string FROM, TO;\n int a, b;\n cin >> FROM >> a >> TO >> b;\n\n int from = getId(FROM);\n int to = getId(TO);\n t[from] = a;\n g[from].push_back(P(to, b));\n ans += b;\n }\n\n solve();\n }\n}","accuracy":1,"time_ms":90,"memory_kb":1388,"score_of_the_acc":-0.4312,"final_rank":5},{"submission_id":"aoj_2033_523404","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <cmath>\n#include <queue>\n#include <set>\n#include <stack>\n#include <map>\n\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nusing namespace std;\n\ntypedef vector<vector<int> > graph;\n\nvoid getReversedGraph(graph& G, graph* rG) {\n *rG = graph(G.size());\n for (int i = 0; i < (int)G.size(); i++) {\n for (int j = 0; j < (int)G[i].size(); j++) {\n (*rG)[G[i][j]].push_back(i);\n }\n }\n}\n\nvoid getSCCGraph(graph& G, graph* SCCGraph, vector<int>* table) {\n const int V = G.size();\n graph rG;\n vector<vector<int> > SCCList;\n vector<int> postOrder;\n bool *used = new bool[V];\n int *nextIndex = new int[V];\n *table = vector<int>(V);\n getReversedGraph(G, &rG);\n\n // DFS\n for (int i = 0; i < V; i++) {\n used[i] = false;\n nextIndex[i] = 0;\n }\n\n for (int i = 0; i < V; i++) {\n if (used[i]) {\n continue;\n }\n used[i] = true;\n stack<int> st;\n st.push(i);\n while (!st.empty()) {\n int v = st.top();\n if (nextIndex[v] == (int)G[v].size()) {\n postOrder.push_back(v);\n st.pop();\n } else {\n int newv = G[v][nextIndex[v]];\n if (!used[newv]) {\n st.push(newv);\n used[newv] = true;\n }\n nextIndex[v]++;\n }\n }\n }\n // Reversed DFS\n for (int i = 0; i < V; i++) {\n used[i] = false;\n nextIndex[i] = 0;\n }\n\n int it = 0;\n for (int i = V - 1; i >= 0; i--) {\n int index = postOrder[i];\n if (used[index]) {\n continue;\n }\n used[index] = true;\n (*table)[index] = it;\n stack<int> st;\n vector<int> list;\n st.push(index);\n list.push_back(index);\n while (!st.empty()) {\n int v = st.top();\n if (nextIndex[v] == (int)rG[v].size()) {\n st.pop();\n } else {\n int newv = rG[v][nextIndex[v]];\n if (!used[newv]) {\n st.push(newv);\n list.push_back(newv);\n used[newv] = true;\n (*table)[newv] = it;\n }\n nextIndex[v]++;\n }\n }\n SCCList.push_back(list);\n it++;\n }\n\n // create new graph;\n const int compressedV = it;\n *SCCGraph = graph(compressedV);\n \n for (int i = 0; i < compressedV; i++) {\n map<int, bool> edgeUsed;\n for (int j = 0; j < (int)SCCList[i].size(); j++) {\n int v = SCCList[i][j];\n for (int k = 0; k < (int)G[v].size(); k++) {\n int w = G[v][k];\n // v -> w\n if (!edgeUsed[(*table)[w]]) {\n edgeUsed[(*table)[w]] = true;\n if (i != (*table)[w]) (*SCCGraph)[i].push_back((*table)[w]);\n }\n }\n }\n }\n\n delete[] used;\n delete[] nextIndex;\n}\n\nbool used[2005];\n\nvoid check(int v, graph& G, bool* used) {\n if (used[v])return;\n used[v] = true;\n rep(i, G[v].size()) {\n check(G[v][i], G, used);\n }\n}\n\nint solve(int n) {\n string s1,s2;\n int d1,d2;\n graph G(n), sccG, rG;\n vector<int> table;\n map<string, int> toId;\n map<int, int> plus;\n int ans = 0;\n int id = 0;\n rep(i,n) {\n cin >> s1 >> d1 >> s2 >> d2;\n if (toId.find(s1) == toId.end()) {\n toId[s1] = id;\n id++;\n }\n if (toId.find(s2) == toId.end()) {\n toId[s2] = id;\n id++;\n }\n ans+= d2;\n if (s1 != s2)G[toId[s2]].push_back(toId[s1]);\n plus[toId[s1]] = d1 - d2;\n }\n \n getSCCGraph(G, &sccG, &table);\n rep(i, 2005)used[i] = false;\n rep(i, sccG.size()) {\n vector<int> p;\n if (used[i])continue;\n //cerr << i << endl;\n //cerr << \"\\t\";\n rep(j, table.size()) {\n if (table[j] == i) {\n p.push_back(plus[j]);\n //cerr << j << \":\" << p[j] << \" \";\n }\n }\n //cerr << endl;\n sort(p.begin(), p.end());\n ans += p[0];\n check(i, sccG, used);\n }\n return ans;\n}\n\nint main() {\n int n;\n while(cin >> n, n) {\n cout << solve(n) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":1584,"score_of_the_acc":-0.5119,"final_rank":12},{"submission_id":"aoj_2033_469009","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 main()\n{\n for(;;){\n int n;\n cin >> n;\n if(n == 0)\n return 0;\n\n vector<string> s1(n), s2(n);\n vector<int> t1(n), t2(n);\n map<string, int> index;\n for(int i=0; i<n; ++i){\n cin >> s1[i] >> t1[i] >> s2[i] >> t2[i];\n index[s1[i]] = i;\n }\n\n vector<int> sup(n);\n vector<vector<int> > edges(n);\n for(int i=0; i<n; ++i){\n sup[i] = index[s2[i]];\n if(s1[i] != s2[i])\n edges[index[s2[i]]].push_back(i);\n }\n\n int ret = 0;\n vector<bool> make(n, false);\n for(int i=0; i<n; ++i){\n if(make[i])\n continue;\n\n int j = i;\n vector<bool> check(n, false);\n while(!check[j]){\n check[j] = true;\n j = sup[j];\n }\n\n check.assign(n, false);\n int k = j;\n while(!check[j]){\n if(t1[j] - t2[j] < t1[k] - t2[k])\n k = j;\n check[j] = true;\n j = sup[j];\n }\n\n ret += t1[k] - t2[k];\n queue<int> q;\n q.push(k);\n while(!q.empty()){\n int a = q.front();\n q.pop();\n ret += t2[a];\n make[a] = true;\n\n for(unsigned l=0; l<edges[a].size(); ++l){\n int b = edges[a][l];\n if(!make[b])\n q.push(b);\n }\n }\n }\n\n cout << ret << endl;\n }\n}","accuracy":1,"time_ms":90,"memory_kb":1488,"score_of_the_acc":-0.4589,"final_rank":7},{"submission_id":"aoj_2033_354764","code_snippet":"//include\n//------------------------------------------\n#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <stack>\n#include <queue>\n#include <bitset>\n#include <algorithm>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <string>\n#include <cstring>\n\nusing namespace std;\n\n//conversion\n//------------------------------------------\ninline int toInt(string s) {int v; istringstream sin(s); sin >> v; return v;}\ntemplate<class T> inline string toStr(T x) {ostringstream sout; sout << x; return sout.str();}\n\n//math\n//-------------------------------------------\ntemplate<class T> inline T sqr(T x) {return x*x;}\n\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef long long LL;\n\n//container util\n//------------------------------------------\n#define ALL(a, n) (a), (a) + (n)\n#define VALL(v) (v).begin(),(v).end()\n#define VADD(v, e) (v).push_back(e)\n#define SADD(s, e) (s).insert(e)\n#define STADD(s, e) (s).push(e)\n#define QADD(q, e) (q).push(e)\n#define PQADD(q, e) (q).push(e)\n#define STPOP(s, e) typeof((q).top()) e = (q).top(); (q).pop()\n#define QPOP(q) typeof((q).front()) e = (q).front(); (q).pop()\n#define PQPOP(q) typeof((q).top()) e = (q).top(); (q).pop()\n#define MP make_pair\n#define PF(p) (p).first\n#define PS(p) (p).second\n#define SZ(a) int((a).size())\n#define EACH(i, c) for(typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).end())\n#define SORT(a, n) sort(ALL(a, n))\n#define VSORT(c) sort(VALL(c))\n#define RSORT(a, n) sort(ALL(a, n), greater<typeof(a[0])>())\n#define VRSORT(v) sort(VALL(v), greater<typeof(v[0])>())\n#define INDEX(a, n, x) find(ALL(a, n), x) - a\n#define VINDEX(v, x) find(VALL(v), x) - v.begin()\n#define BOUND(a, n, x) lower_bound(ALL(a, n), x) - a\n#define VBOUND(v, x) lower_bound(VALL(v), x) - v.begin()\n\n//repetition\n//------------------------------------------\n#define FOR(i, a, b) for (int i = (a);i < (b); ++i)\n#define RFOR(i, a, b) for (int i = (b) - 1; i >= (a); --i)\n#define REP(i, n) FOR(i, 0, n)\n#define RREP(i, n) RFOR(i, 0, n)\n\n//IO\n//------------------------------------------\n#define LF(x) cout << (x) << endl;\n#define LF2(x, y) cout << (x) << \" \" << (y) << endl;\n#define LFA(a, n) cout << a[0]; FOR(i, 1, n) {cout << \" \" << a[i];} cout << endl;\n#define LFD(x, w) cout.width = (w); cout << (x) << endl;\n#define LFDA(a, n, w) REP(i, n) cout.width = (w); cout << a[i] << endl;\n#define LFP(x, w) cout << setprecision((w)); cout << setiosflags(ios::fixed); cout << (x) << endl;\n#define LFP2(x, y, w) cout << setprecision((w)); cout << setiosflags(ios::fixed); cout << (x) << \" \" << (y) << endl;\n#define LFPA(a, n, w) cout << setprecision((w)); cout << setiosflags(ios::fixed); cout << a[0]; FOR(i, 1, n) {cout << \" \" << a[i];} cout << endl;\n\n//constant\n//--------------------------------------------\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\nconst int INF = 1e9;\n\n//clear memory\n//--------------------------------------------\n#define CLR(a) memset((a), 0 , sizeof(a))\n\n//debug\n//--------------------------------------------\n#define DUMP(x) cerr << #x << \" = \" << (x) << endl;\n#define DEBUG(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl;\n#define DUMPA(a, n) cerr << #a << \" = {\" << a[0]; FOR(i, 1, n) { cout << \", \" << a[i]; } cerr << \"}\" << endl;\n#define DEBUGA(a, n) cerr << #a << \" = {\" << a[0]; FOR(i, 1, n) { cout << \", \" << a[i]; } cerr << \"} (L\" << __LINE__ << \")\" << endl;\n#define DUMPAA(a, n, m) REP(i, n) {REP(j, m) {cout << a[i][j] << \" \";} cout << endl;}\n#define DEBUGAA(a, n, m) DUMPAA(a, n, m) cout << \"(L\" << __LINE__ << \")\" << endl;\n\n//#include <uft>\nclass uft\n{\npublic:\n\tint N;\n\tint n;\n\tint* p;\n\tint* r;\n\t\n\tuft(const int N)\n\t{\n\t\tthis->N = N;\n\t\tp = new int[N];\n\t\tr = new int[N];\n\t}\n\t\n\t~uft()\n\t{\n\t\tdelete[] p;\n\t\tdelete[] r;\n\t}\n\t\n\tvoid init(int n)\n\t{\n\t\tthis->n = n;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tp[i] = i;\n\t\t\tr[i] = 0;\n\t\t}\n\t}\n\t\n\tint find(int x)\n\t{\n\t\tif (p[x] == x) {\n\t\t\treturn x;\n\t\t}\n\t\tp[x] = find(p[x]);\n\t\treturn p[x];\n\t}\n\t\n\tvoid unite(int x, int y)\n\t{\n\t\tint a = find(x);\n\t\tint b = find(y);\n\t\tif (a == b) {\n\t\t\treturn;\n\t\t}\n\t\tif(r[a] < r[b]) {\n\t\t\tp[a] = b;\n\t\t}\n\t\telse if (r[a] == r[b]){\n\t\t\tp[a] = b;\n\t\t\tr[b]++;\n\t\t}\n\t\telse {\n\t\t\tp[b] = a;\n\t\t}\n\t}\n\t\n\tbool same(int x, int y)\n\t{\n\t\treturn find(x) == find(y);\n\t}\n\n};\n\n//#include_end <uft>\n\nconst int N = 1000;\nint n;\nstring name[N];\nint day1[N];\nstring sup[N];\nint day2[N];\nmap<string, int> f;\nuft uft(N);\nVI e[N];\nint m[N];\nint dp[N];\nbool v[N];\n\nint dfs(int k)\n{\n\tv[k] = true;\n\tint ans = day1[k];\n\tREP(i, e[k].size()) {\n\t\tif(!v[e[k][i]]) ans += dfs(e[k][i]) - day1[e[k][i]] + day2[e[k][i]];\n\t}\n\treturn ans;\n}\n\nvoid init()\n{\n}\n\nvoid solve()\n{\n\tf.clear();\n\tREP(i, n) {\n\t\tf[name[i]] = i;\n\t\te[i].clear();\n\t}\n\tuft.init(n);\n\tfill(ALL(m, n), 1);\n\tREP(i, n) {\n\t\tint t = f[name[i]];\n\t\tint u = f[sup[i]];\n\t\tif (!uft.same(t, u)) {\n\t\t\tuft.unite(t, u);\n\t\t\tm[t] += m[u];\n\t\t\tREP(j, n) {\n\t\t\t\tif (uft.same(t, j)) {\n\t\t\t\t\tm[j] = m[t];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tVADD(e[u], t);\n\t}\n\tfill(ALL(dp, n), INF);\n\tREP(i, n) {\n\t\tfill(ALL(v, n), false);\n\t\tint x = dfs(i);\n\t\tint y = 0;\n\t\tREP(j, n) {\n\t\t\tif (v[j]) ++y;\n\t\t}\n\t\tif (y < m[i]) continue;\n\t\tREP(j, n) {\n\t\t\tif (uft.same(i, j)) {\n\t\t\t\tdp[j] = min(dp[j], x);\n\t\t\t}\n\t\t}\n\t}\n\tint ans = 0;\n\tREP(i, n) {\n\t\tbool b = false;\n\t\tREP(j, i) {\n\t\t\tb |= uft.same(i, j);\n\t\t}\n\t\tif (!b) ans += dp[i];\n\t}\n\tLF(ans);\n}\n\nint main()\n{\n\tinit();\n\twhile (cin >> n, n) {\n\t\tREP(i, n) cin >> name[i] >> day1[i] >> sup[i] >> day2[i];\n\t\tsolve();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":790,"memory_kb":0,"score_of_the_acc":-0.5066,"final_rank":10},{"submission_id":"aoj_2033_334814","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <cstring>\n\nusing namespace std;\n\ntypedef pair<int,int> pii;\n\nbool used[1001];\nint n;\nvector<int> G[1001];\npii costs[1001];\nint idx=0;\nmap<string,int> indices;\nint nxt[1001];\nint in[1001];\nint sumCosts=0;\nbool used2[1001];\n\n// üü0Ìm[hÉ¢ÄTõ(ÂHͶݵ¦È¢)\nvoid search1(int s){\n\tused[s]=true;\n\tfor(int i=0;i<(int)G[s].size();i++){\n\t\tint to=G[s][i];\n\t\tif(!used[to]){\n\t\t\tnxt[s]=to;\n\t\t\tsumCosts+=costs[to].second;\n\t\t\tsearch1(to);\n\t\t}\n\t}\n}\n// ü_ª ém[h©çTõðnßé\nvoid search2(int s){\n\tused[s]=true;\n\tused2[s]=true;\n\tfor(int i=0;i<(int)G[s].size();i++){\n\t\tint to=G[s][i];\n\t\tif(!used[to]){\n\t\t\tnxt[s]=to;\n\t\t\tsumCosts+=costs[to].second;\n\t\t\tsearch2(to);\n\t\t}\n\t\t// ÂH𩵽êAÂHÌÅÅàRXg·Ì¬³¢àÌðÌp\n\t\telse{\n\t\t\t// ¡ñÊßµ½êÅÍÈ¢ê\n\t\t\tif(!used2[to])continue;\n\t\t\tvector<pii> v;\n\t\t\tint cur=to;\n\t\t\twhile(1){\n\t\t\t\tv.push_back(pii(costs[cur].first-costs[cur].second,cur));\n\t\t\t\tif(cur==s)break;\n\t\t\t\tint tto=nxt[cur];\n\t\t\t\tcur=tto;\n\t\t\t}\n\t\t\tsort(v.begin(),v.end());\n\t\t\tsumCosts+=costs[v[0].second].first;\n\t\t\tsumCosts-=costs[v[0].second].second;\n\t\t}\n\t}\n}\n\nint main(){\n\n\twhile(cin>>n&&n){\n\t\tsumCosts=0;\n\t\tmemset(in,0,sizeof(in));\n\t\tmemset(used,0,sizeof(used));\n\t\tindices.clear();\n\t\tidx=0;\n\t\tfor(int i=0;i<1001;i++)G[i].clear();\n\t\tfor(int i=0;i<n;i++){\n\t\t\tstring a,b;\n\t\t\tint c,d;\n\t\t\tcin>>a>>c>>b>>d;\n\t\t\tif(indices.find(a)==indices.end())indices[a]=idx++;\n\t\t\tif(indices.find(b)==indices.end())indices[b]=idx++;\n\t\t\tif(a!=b){\n\t\t\t\tG[indices[b]].push_back(indices[a]);\n\t\t\t\tin[indices[a]]++;\n\t\t\t}\n\t\t\tcosts[indices[a]]=pii(c,d);\n\t\t}\n\t\t// ü_ª³¢¨ðTõ\n\t\tfor(int i=0;i<idx;i++){\n\t\t\tif(in[i]==0&&!used[i]){\n\t\t\t\t// ÅÌvfÍK¸æé\n\t\t\t\tsumCosts+=costs[i].first;\n\t\t\t\tsearch1(i);\n\t\t\t}\n\t\t}\n\t\t// ܾTõµÄ¢È¢àÌð·×ÄTõ\n\t\tfor(int i=0;i<idx;i++){\n\t\t\tif(!used[i]){\n\t\t\t\tmemset(used2,0,sizeof(used2));\n\t\t\t\tsumCosts+=costs[i].second;\n\t\t\t\tsearch2(i);\n\t\t\t}\n\t\t}\n\t\tcout<<sumCosts<<endl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":220,"memory_kb":1140,"score_of_the_acc":-0.4479,"final_rank":6},{"submission_id":"aoj_2033_256054","code_snippet":"#include<map>\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\ntypedef vector< vector<int> > vvi;\n\nconst int INF=1<<29;\n\nvoid GabowDFS(int u,vector<bool> &visited,vector<int> &nodes,const vvi &adj){\n\tif(visited[u]) return;\n\tvisited[u]=true;\n\trep(i,adj[u].size()){\n\t\tint v=adj[u][i];\n\t\tif(!visited[v]) GabowDFS(v,visited,nodes,adj);\n\t}\n\tnodes.push_back(u);\n}\n\nvvi GabowSCC(const vvi &adj){\n\tint n=adj.size();\n\tvector<int> ord;\n\tvector<bool> visited(n);\n\trep(u,n) GabowDFS(u,visited,ord,adj);\n\n\tvvi radj(n);\n\trep(u,n) rep(i,adj[u].size()) radj[adj[u][i]].push_back(u);\n\n\tvvi sccs;\n\trep(u,n) visited[u]=false;\n\tfor(int i=n-1;i>=0;i--){\n\t\tint u=ord[i];\n\t\tvector<int> scc;\n\t\tGabowDFS(u,visited,scc,radj);\n\t\tif(scc.size()>0) sccs.push_back(scc);\n\t}\n\treturn sccs;\n}\n\nint main(){\n\tfor(int n;cin>>n,n;){\n\t\tint m=0;\n\t\tmap<string,int> f;\n\n\t\tvvi adj(n);\n\t\tint day1[1000],day2[1000];\n\t\trep(i,n){\n\t\t\tstring s1,s2;\n\t\t\tint d1,d2; cin>>s1>>d1>>s2>>d2;\n\t\t\tif(f.count(s1)==0) f[s1]=m++;\n\t\t\tif(f.count(s2)==0) f[s2]=m++;\n\n\t\t\tint u=f[s2],v=f[s1];\n\t\t\tadj[u].push_back(v);\n\t\t\tday1[v]=d1;\n\t\t\tday2[v]=d2;\n\t\t}\n\n\t\tvvi scc=GabowSCC(adj);\n\n\t\tint ans=0;\n\t\tbool tool[1000]={};\n\t\trep(i,scc.size()){\n\t\t\tint dif=INF;\n\t\t\tbool start=true;\n\t\t\trep(j,scc[i].size()){\n\t\t\t\tint u=scc[i][j];\n\t\t\t\tans+=day2[u];\n\t\t\t\tdif=min(dif,day1[u]-day2[u]);\n\t\t\t\tif(tool[u]) start=false;\n\t\t\t}\n\t\t\tif(start) ans+=dif;\n\n\t\t\trep(j,scc[i].size()){\n\t\t\t\tint u=scc[i][j];\n\t\t\t\trep(k,adj[u].size()) tool[adj[u][k]]=true;\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":240,"memory_kb":0,"score_of_the_acc":-0.1447,"final_rank":1},{"submission_id":"aoj_2033_245575","code_snippet":"#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\ntypedef vector<vector<int> > graph;\n\n#define REP(i,n) for(int i=0; i<n; i++)\n\n\nvoid visit(graph& g, vector<int>& PostOrder, vector<bool>& visited, int ps)\n{\n\tvisited[ps]=1;\n\tint S=g[ps].size();\n\tREP(i,S)\n\t{\n\t\tint next=g[ps][i];\n\t\tif(visited[next]) continue;\n\t\tvisit(g, PostOrder, visited, next);\n\t}\n\t\n\tPostOrder.push_back(ps);\n}\n\nvoid walk(graph& g, vector<int>& in, int ps, int gcnt)\n{\n\tin[ps]=gcnt;\n\t\n\tint S=g[ps].size();\n\tREP(i,S)\n\t{\n\t\tint next=g[ps][i];\n\t\tif(in[next]!=-1) continue;\n\t\twalk(g,in,next,gcnt);\n\t}\n}\n\n//StronglyConnectedComponent\nint SCC(vector<int>& in, int V, graph& g, graph& rg)\n{\n\tint gcnt=0;\n\tvector<int> PostOrder;\n\tvector<bool> visited(V,false);\n\t\n\tREP(i,V)\n\t{\n\t\tif(visited[i]) continue;\n\t\tvisit(g,PostOrder,visited, i);\n\t}\n\t\t\n\tfor(int i=PostOrder.size()-1; i>=0; --i)\n\t{\n\t\tif(in[PostOrder[i]]==-1) \n\t\t{\n\t\t\twalk(rg,in,PostOrder[i],gcnt++);\n\t\t}\n\t}\n\n\treturn gcnt;\n}\n\nint recipe[1050], self[1050],reduce[1050];\n\nint dfs(int p, vector<bool>& use, graph& g, graph& c)\n{\n\tuse[p]=1;\n\n\tint ret=0;\n\tfor(int i=0; i<g[p].size(); i++)\n\t{\n\t\tint next=g[p][i];\n\t\tif(use[next]) continue;\n\t\tret+=dfs(next, use, g, c);\n\t\tret+=c[p][i];\n\t}\n\n\treturn ret;\n\n}\n\nint calc(vector<int>& v, vector<bool>& created, graph& g, graph& c)\n{\n\tvector<bool> use(10000, 1);\n\tfor(int i=0; i<v.size(); i++)\n\t\tuse[v[i]]=0;\n\n\tint ret=0,mn=(1<<24),r;\n\tif(v.size()==1)\n\t{\n\t\tint p=v[0];\n\t\tif(created[recipe[p]]) ret=reduce[p];\n\t\telse ret=self[p];\n\t}\n\telse\n\t{\n\t\tfor(int i=0; i<v.size(); i++)\n\t\t{\n\t\t\tint p=v[i];\n\t\t\tif(self[p]-reduce[p]<mn)\n\t\t\t{\n\t\t\t\tr=p;\n\t\t\t\tmn=self[p]-reduce[p];\n\t\t\t}\n\t\t}\n\n\t\tfor(int i=0; i<v.size(); i++)\n\t\t{\n\t\t\tint p=v[i];\n\t\t\tif(p==r) ret+=self[p];\n\t\t\telse ret+=reduce[p];\n\t\t}\n\t}\n\n\tfor(int i=0; i<v.size(); i++)\n\t\tcreated[v[i]]=1;\n\n\treturn ret;\n}\n\nint main()\n{\n\tint N;\n\twhile(cin >> N, N)\n\t{\n\t\tgraph g(N), rg(N), c(N), rc(N);\n\n\t\tint dcnt=0;\n\t\tmap<string, int> dic;\n\t\tfor(int i=0; i<N; i++)\n\t\t{\n\t\t\tstring s,t;\n\t\t\tint a,b,u,v;\n\t\t\tcin >> s >> a >> t >> b;\n\n\t\t\tif(!dic.count(s)) dic[s]=dcnt++;\n\t\t\tif(!dic.count(t)) dic[t]=dcnt++;\n\t\t\t\n\t\t\tu=dic[s];\n\t\t\tv=dic[t];\n\n\t\t\t g[u].push_back(v);\n\t\t\trg[v].push_back(u);\n\t\t\t c[u].push_back(b);\n\t\t\trc[v].push_back(b);\n\n\t\t\tself[u]=a;\n\t\t\trecipe[u]=v;\n\t\t\treduce[u]=b;\n\t\t}\n\n\t\tvector<int> in(N, -1);\n\t\tint gcnt=SCC(in,N,rg,g);\n\n\t\tvector<vector<int> > loop(gcnt);\n\t\tfor(int i=0; i<N; i++)\n\t\t\tloop[in[i]].push_back(i);\n\n\t\tvector<bool> created(N, 0);\n\n\t\tint ans=0;\n\t\tfor(int i=0; i<gcnt; i++)\n\t\t{\n\t\t\tans+=calc(loop[i], created, rg, rc);\n\t\t}\n\n\t\tprintf(\"%d\\n\", ans);\n\t}\n}","accuracy":1,"time_ms":260,"memory_kb":1188,"score_of_the_acc":-0.4875,"final_rank":9},{"submission_id":"aoj_2033_245563","code_snippet":"#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\ntypedef vector<vector<int> > graph;\n\n#define REP(i,n) for(int i=0; i<n; i++)\n\n\nvoid visit(graph& g, vector<int>& PostOrder, vector<bool>& visited, int ps)\n{\n\tvisited[ps]=1;\n\tint S=g[ps].size();\n\tREP(i,S)\n\t{\n\t\tint next=g[ps][i];\n\t\tif(visited[next]) continue;\n\t\tvisit(g, PostOrder, visited, next);\n\t}\n\t\n\tPostOrder.push_back(ps);\n}\n\nvoid walk(graph& g, vector<int>& in, int ps, int gcnt)\n{\n\tin[ps]=gcnt;\n\t\n\tint S=g[ps].size();\n\tREP(i,S)\n\t{\n\t\tint next=g[ps][i];\n\t\tif(in[next]!=-1) continue;\n\t\twalk(g,in,next,gcnt);\n\t}\n}\n\n//StronglyConnectedComponent\nint SCC(vector<int>& in, int V, graph& g, graph& rg)\n{\n\tint gcnt=0;\n\tvector<int> PostOrder;\n\tvector<bool> visited(V,false);\n\t\n\tREP(i,V)\n\t{\n\t\tif(visited[i]) continue;\n\t\tvisit(g,PostOrder,visited, i);\n\t}\n\t\t\n\tfor(int i=PostOrder.size()-1; i>=0; --i)\n\t{\n\t\tif(in[PostOrder[i]]==-1) \n\t\t{\n\t\t\twalk(rg,in,PostOrder[i],gcnt++);\n\t\t}\n\t}\n\n\treturn gcnt;\n}\n\nint recipe[1050], self[1050],reduce[1050];\n\nint dfs(int p, vector<bool>& use, graph& g, graph& c)\n{\n\tuse[p]=1;\n\n\tint ret=0;\n\tfor(int i=0; i<g[p].size(); i++)\n\t{\n\t\tint next=g[p][i];\n\t\tif(use[next]) continue;\n\t\tret+=dfs(next, use, g, c);\n\t\tret+=c[p][i];\n\t}\n\n\treturn ret;\n\n}\n\nint calc(vector<int>& v, vector<bool>& created, graph& g, graph& c)\n{\n\tvector<bool> use(10000, 1);\n\tfor(int i=0; i<v.size(); i++)\n\t\tuse[v[i]]=0;\n\n\tint ret=(1<<24);\n\tfor(int i=0; i<v.size(); i++)\n\t{\n\t\tvector<bool> u(use);\n\t\tint p=v[i], t=dfs(p,u,g,c);\n\t\tif(created[recipe[p]]) t+=reduce[p];\n\t\telse\t\t\t\t\tt+=self[p];\n\t\t\n\t\tret=min(ret, t);\n\t}\n\n\tfor(int i=0; i<v.size(); i++)\n\t\tcreated[v[i]]=1;\n\n\treturn ret;\n}\n\nint main()\n{\n\tint N;\n\twhile(cin >> N, N)\n\t{\n\t\tgraph g(N), rg(N), c(N), rc(N);\n\n\t\tint dcnt=0;\n\t\tmap<string, int> dic;\n\t\tfor(int i=0; i<N; i++)\n\t\t{\n\t\t\tstring s,t;\n\t\t\tint a,b,u,v;\n\t\t\tcin >> s >> a >> t >> b;\n\n\t\t\tif(!dic.count(s)) dic[s]=dcnt++;\n\t\t\tif(!dic.count(t)) dic[t]=dcnt++;\n\t\t\t\n\t\t\tu=dic[s];\n\t\t\tv=dic[t];\n\n\t\t\t g[u].push_back(v);\n\t\t\trg[v].push_back(u);\n\t\t\t c[u].push_back(b);\n\t\t\trc[v].push_back(b);\n\n\t\t\tself[u]=a;\n\t\t\trecipe[u]=v;\n\t\t\treduce[u]=b;\n\t\t}\n\n\t\tvector<int> in(N, -1);\n\t\tint gcnt=SCC(in,N,rg,g);\n\n\t\tvector<vector<int> > loop(gcnt);\n\t\tfor(int i=0; i<N; i++)\n\t\t\tloop[in[i]].push_back(i);\n\n\t\tvector<bool> created(N, 0);\n\n\t\tint ans=0;\n\t\tfor(int i=0; i<gcnt; i++)\n\t\t{\n\t\t\tans+=calc(loop[i], created, rg, rc);\n\t\t}\n\n\t\tprintf(\"%d\\n\", ans);\n\t}\n}\n\n/*\n4\ngu 20 pa 10\nci 20 gu 10\npa 20 ci 10\nhoge 20 pa 10\n*/","accuracy":1,"time_ms":330,"memory_kb":1188,"score_of_the_acc":-0.5336,"final_rank":14},{"submission_id":"aoj_2033_225815","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\nint n;\nvector<int> v[1000];\nmap<string, int> id;\nstring s[1000], t[1000];\nint d1[1000], d2[1000];\n\nbool visited[1000];\nint rec(int now) {\n if (visited[now]) return 0;\n visited[now] = 1;\n int res = 0;\n FOR(it, v[now]) {\n if (visited[*it]) continue;\n res += d1[*it]-d2[*it];\n res += rec(*it);\n }\n return res;\n}\n\nint dfs(int now) {\n if (visited[now]) return 0;\n visited[now] = 1;\n int res = 0;\n FOR(it, v[now]) {\n if (visited[*it]) continue;\n res += d2[*it];\n res += dfs(*it);\n }\n return res;\n \n}\n\nint main() {\n while(cin >> n, n) {\n id.clear();\n REP(i,n) {\n cin >> s[i] >> d1[i] >> t[i] >> d2[i];\n id[s[i]] = i;\n }\n REP(i,1000)\n v[i].clear();\n REP(i, n) {\n v[id[t[i]]].push_back(i);\n }\n typedef pair<int,int> pii;\n vector<pii> vv;\n REP(i,n) {\n memset(visited,0,sizeof(visited));\n int tmp = rec(i);\n vv.push_back(pii(tmp, i));\n }\n sort(ALL(vv), greater<pii>());\n memset(visited,0,sizeof(visited));\n int res = 0;\n REP(i,n) {\n int c = vv[i].second;\n if (!visited[c]) {\n res += d1[c] + dfs(c);\n }\n }\n cout << res << endl;\n } \n}","accuracy":1,"time_ms":190,"memory_kb":1112,"score_of_the_acc":-0.4204,"final_rank":2},{"submission_id":"aoj_2033_225709","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <map>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\n\nstruct tool {\n string name,sh;\n int ntime,stime;\n vector<int> edge;\n tool(string name,string sn,int ntime,int stime)\n : name(name), sh(sn), ntime(ntime), stime(stime) {edge.clear();}\n};\n\nbool seen[1001];\n\nint dfs(vector<tool> &tv,int v) {\n seen[v] = true;\n int ret = 0;\n for(int i=0; i<tv[v].edge.size(); ++i) {\n if(seen[tv[v].edge[i]]) continue;\n ret += (tv[tv[v].edge[i]].ntime - tv[tv[v].edge[i]].stime);\n ret += dfs(tv,tv[v].edge[i]);\n }\n return ret;\n}\n\nvoid dfs2(vector<tool> &tv,int v) {\n seen[v] = true;\n for(int i=0; i<tv[v].edge.size(); ++i) {\n if(seen[tv[v].edge[i]]) continue;\n dfs2(tv,tv[v].edge[i]);\n }\n}\n\nint main() {\n int n;\n string s1,s2;\n int k1,k2;\n while(cin>>n, n) {\n map<string,int> idx;\n vector<tool> tv;\n\n int ans = 0;\n for(int i=0; i<n; ++i) {\n cin>>s1>>k1>>s2>>k2;\n idx[s1] = i;\n tv.push_back(tool(s1,s2,k1,k2));\n ans += k1;\n }\n\n for(int i=0; i<n; ++i) {\n if(idx.find(tv[i].sh) == idx.end()) continue;\n int id = idx[tv[i].sh];\n tv[id].edge.push_back(i);\n }\n\n vector<int> p(n,-1);\n for(int i=0; i<n; ++i) {\n memset(seen, false, sizeof(seen));\n p[i] = dfs(tv,i);\n }\n\n vector<pair<int,int> > ppv(n);\n for(int i=0; i<n; ++i) {\n ppv.push_back(make_pair(p[i],i));\n }\n sort(ppv.begin(), ppv.end());\n reverse(ppv.begin(), ppv.end());\n\n memset(seen, false, sizeof(seen));\n for(int i=0; i<ppv.size(); ++i) {\n int v = ppv[i].second;\n if(seen[v]) continue;\n ans -= ppv[i].first;\n dfs2(tv,v);\n }\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":270,"memory_kb":1124,"score_of_the_acc":-0.4763,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_2033_10852644\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\n#define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ )\\n#define REP(i,n) FOR(i,0,n)\\n#define YYS(x,arr) for(auto& x:arr)\\n#define ALL(x) (x).begin(),(x).end()\\n#define SORT(x) sort( (x).begin(),(x).end() )\\n#define REVERSE(x) reverse( (x).begin(),(x).end() )\\n#define UNIQUE(x) (x).erase( unique( ALL( (x) ) ) , (x).end() )\\n#define PW(x) (1LL<<(x))\\n#define SZ(x) ((ll)(x).size())\\n#define SHOW(x) cout << #x << \\\" = \\\" << x << endl\\n#define SHOWA(x,n) for( int yui = 0; yui < n; yui++ ){ cout << x[yui] << \\\" \\\"; } cout << endl\\n\\n#define pb emplace_back\\n#define fi first\\n#define se second\\n\\nusing namespace std;\\n\\ntypedef long double ld;\\ntypedef long long int ll;\\ntypedef pair<int,int> pi;\\ntypedef pair<ll,ll> pl;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef vector<bool> vb;\\ntypedef vector<ld> vd;\\ntypedef vector<pi> vpi;\\ntypedef vector<pl> vpl;\\ntypedef vector<vpl> gr;\\ntypedef vector<vl> ml;\\ntypedef vector<vd> md;\\ntypedef vector<vi> mi;\\n \\nconst ll INF = (ll)1e9 + 10;\\nconst ll INFLL = (ll)1e18 + 10;\\nconst ld EPS = 1e-12;\\nconst ll MOD = 1e9+7;\\n \\ntemplate<class T> T &chmin( T &a , const T &b ){ return a = min(a,b); }\\ntemplate<class T> T &chmax( T &a , const T &b ){ return a = max(a,b); }\\ntemplate<class T> inline T sq( T a ){ return a * a; }\\n\\nll in(){ long long int x; scanf( \\\"%lld\\\" , &x ); return x; }\\nchar yuyushiki[1000010]; string stin(){ scanf( \\\"%s\\\" , yuyushiki ); return yuyushiki; }\\n\\n// head\\n\\nint n;\\nmap<string,int> ma;\\nint cnt;\\n\\nint c[1010];\\nint d[1010];\\nint to[1010];\\n\\nvi cycle;\\nmi cs;\\n\\nint used[1010];\\n\\nvoid dfs( int x ){\\n used[x] = 1;\\n\\n if( used[ to[x] ] == 0 ){\\n dfs( to[x] );\\n } else if( used[ to[x] ] == 1 ){\\n int cur = x;\\n do{\\n cycle.pb( cur );\\n cur = to[cur];\\n } while( cur != x );\\n }\\n \\n used[x] = 2;\\n}\\n\\nint id( string s ){\\n if( ma.find( s ) == ma.end() ){\\n return ma[s] = cnt++;\\n }\\n return ma[s];\\n}\\n\\nvoid solve(){\\n ma.clear();\\n cnt = 0;\\n REP( i , n ){\\n int a = id( stin() );\\n c[a] = in();\\n int b = id( stin() );\\n d[a] = in();\\n to[a] = b;\\n }\\n cs.clear();\\n REP( i , n ){\\n used[i] = 0;\\n }\\n REP( i , n ){\\n if( used[i] == 0 ){\\n cycle.clear();\\n dfs( i );\\n if( SZ(cycle) > 0 ){\\n cs.pb( cycle );\\n }\\n }\\n }\\n int ans = 0;\\n REP( i , n ){\\n ans += d[i];\\n }\\n YYS( v , cs ){\\n vi ws(0);\\n YYS( w , v ){\\n ws.pb( c[w] - d[w] );\\n }\\n SORT( ws );\\n ans += ws[0];\\n }\\n printf( \\\"%d\\\\n\\\" , ans );\\n}\\n\\nint main(){\\n\\n while( 1 ){\\n n = in();\\n if( n == 0 ){\\n break;\\n }\\n solve();\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3604,\n \"score_of_the_acc\": -1,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2033_2859241\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\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\\nint get_id(string st,bool flag=false) {\\n\\tstatic map<string,int>mp;\\n\\tstatic int id=0;\\n\\tif (flag) {\\n\\t\\tmp.clear();\\n\\t\\tid=0;\\n\\t\\treturn 0;\\n\\t}\\n\\tif (mp.find(st) == mp.end()) {\\n\\t\\tmp[st]=id++;\\n\\t}\\n\\treturn mp[st];\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tget_id(\\\"\\\", true);\\n\\t\\tint N;cin>>N;\\n\\t\\tif(!N)break;\\n\\n\\t\\tvector<int>oris(N);\\n\\t\\tvector<int>acomes(N);\\n\\t\\tvector<vector<int>>edges(N);\\n\\n\\t\\tvector<int>ids(N);\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tstring ast;\\n\\t\\t\\tint b;\\n\\t\\t\\tstring cst;\\n\\t\\t\\tint d;\\n\\t\\t\\tcin>>ast>>b>>cst>>d;\\n\\t\\t\\tint a=get_id(ast);\\n\\t\\t\\tint c=get_id(cst);\\n\\n\\t\\t\\toris[i]=b;\\n\\t\\t\\tacomes[i]=d;\\n\\t\\t\\tif(a!=c)edges[c].push_back(a);\\n\\n\\t\\t\\tids[a]=i;\\n\\t\\t}\\n\\n\\t\\tauto p=dscc.get(edges);\\n\\n\\t\\tvector<int>comes(p.second.size());\\n\\t\\tfor (auto es : p.second) {\\n\\t\\t\\tfor (auto e : es) {\\n\\t\\t\\t\\tcomes[e]++;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\n\\t\\tint ans=accumulate(acomes.begin(),acomes.end(),0);\\n\\t\\tfor(int i=0;i<p.first.size();++i){\\n\\t\\t\\tif(comes[i])continue;\\n\\t\\t\\tauto v(p.first[i]);\\n\\t\\t\\tint minus_max=-1e9;\\n\\t\\t\\tfor (auto a : v) {\\n\\t\\t\\t\\tminus_max=max(minus_max,acomes[ids[a]]-oris[ids[a]]);\\n\\t\\t\\t}\\n\\t\\t\\tans-=minus_max;\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t\\t\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3424,\n \"score_of_the_acc\": -1.0027,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2033_2564715\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\nstruct GROUP{\\n\\tvector<int> nodes;\\n};\\n\\n\\nstruct Info{\\n\\tint day1,sup_id,day2;\\n\\tchar name[33],sup_name[33];\\n};\\n\\nint N;\\nint height[1000],parent[1000],num_in[1000];\\n\\nInfo info[1000];\\nvector<int> G[1000];\\nvector<int> reverse_G[1000];\\n\\nGROUP group[1000];\\nstack<int> S;\\n\\nbool check[1000];\\nint table[1000];\\n\\nint group_index;\\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\\n\\nvoid dfs(int node_id){\\n\\tcheck[node_id] = true;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\tif(!check[G[node_id][i]])dfs(G[node_id][i]);\\n\\t}\\n\\tS.push(node_id);\\n}\\n\\nvoid reverse_dfs(int node_id){\\n\\tcheck[node_id] = true;\\n\\n\\tgroup[group_index].nodes.push_back(node_id);\\n\\ttable[node_id] = group_index;\\n\\n\\tfor(int i = 0; i < reverse_G[node_id].size(); i++){\\n\\t\\tif(!check[reverse_G[node_id][i]])reverse_dfs(reverse_G[node_id][i]);\\n\\t}\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tgroup[i].nodes.clear();\\n\\t\\tG[i].clear();\\n\\t\\treverse_G[i].clear();\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%s %d %s %d\\\",info[i].name,&info[i].day1,info[i].sup_name,&info[i].day2);\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tif(strCmp(info[k].name,info[i].sup_name)){\\n\\t\\t\\t\\tinfo[i].sup_id = k;\\n\\n\\t\\t\\t\\tif(i != k){\\n\\t\\t\\t\\t\\tG[k].push_back(i);\\n\\t\\t\\t\\t\\treverse_G[i].push_back(k);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N;i++)check[i] = false;\\n\\n\\tfor(int i = 0; i < N;i++){\\n\\t\\tif(!check[i])dfs(i);\\n\\t}\\n\\n\\tfor(int i = 0; i < N;i++)check[i] = false;\\n\\n\\tgroup_index = -1;\\n\\n\\twhile(!S.empty()){\\n\\t\\tif(!check[S.top()]){\\n\\t\\t\\tgroup_index++;\\n\\n\\t\\t\\treverse_dfs(S.top());\\n\\t\\t}\\n\\t\\tS.pop();\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++)num_in[i] = 0;\\n\\n\\tint to_group,min_index,minimum;\\n\\n\\tfor(int i = 0; i <= group_index; i++){\\n\\t\\tfor(int k = 0; k < group[i].nodes.size(); k++){\\n\\t\\t\\tfor(int p = 0; p < G[group[i].nodes[k]].size(); p++){\\n\\t\\t\\t\\tto_group = table[G[group[i].nodes[k]][p]];\\n\\t\\t\\t\\tif(to_group != i)num_in[to_group]++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = 0;\\n\\n\\tfor(int i = 0; i <= group_index;i++){\\n\\t\\tif(group[i].nodes.size() == 1){\\n\\t\\t\\tif(num_in[i] == 0){\\n\\t\\t\\t\\tans += info[group[i].nodes[0]].day1;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tans += info[group[i].nodes[0]].day2;\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\n\\t\\t\\tif(num_in[i] == 0){\\n\\t\\t\\t\\tmin_index = 0;\\n\\t\\t\\t\\tminimum = info[group[i].nodes[0]].day1 -info[group[i].nodes[0]].day2;\\n\\n\\t\\t\\t\\tfor(int k = 1; k < group[i].nodes.size(); k++){\\n\\t\\t\\t\\t\\tif(info[group[i].nodes[k]].day1 -info[group[i].nodes[k]].day2 < minimum){\\n\\t\\t\\t\\t\\t\\tminimum = info[group[i].nodes[k]].day1 -info[group[i].nodes[k]].day2;\\n\\t\\t\\t\\t\\t\\tmin_index = k;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tans += info[group[i].nodes[min_index]].day1;\\n\\t\\t\\t\\tfor(int k = 0; k < group[i].nodes.size(); k++){\\n\\t\\t\\t\\t\\tif(k != min_index){\\n\\t\\t\\t\\t\\t\\tans += info[group[i].nodes[k]].day2;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tfor(int k = 0; k < group[i].nodes.size(); k++){\\n\\t\\t\\t\\t\\tans += info[group[i].nodes[k]].day2;\\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\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3556,\n \"score_of_the_acc\": -1.0393,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2033_2212894\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint N;\\nint day1[1111],day2[1111];\\nstring name[1111],sup[1111];\\nconst int INF = 1000000007;\\nvector<int> G[1111];\\nvector<int> rG[1111];\\n\\nbool used[1111];\\nvector<int> V[1111];\\nvector<int> vs;\\nvoid init(){\\n for(int i=0;i<N;i++) G[i].clear();\\n for(int i=0;i<N;i++) rG[i].clear();\\n for(int i=0;i<N;i++) V[i].clear(); \\n}\\nint dfs(int v){\\n if( used[v] ) return 0;\\n int res = 0;\\n used[v] = true;\\n for( int to : G[v] ){\\n res += dfs( to );\\n }\\n vs.push_back( v );\\n return res + day2[v];\\n}\\nvoid rdfs(int v,int cnt){\\n if( used[v] ) return;\\n used[v] = true;\\n for( int to : rG[v] ) {\\n rdfs( to, cnt );\\n }\\n V[cnt].push_back(v);\\n}\\nint scc(){\\n memset( used, 0, sizeof( used ) );\\n vs.clear();\\n for(int i=0;i<N;i++){\\n dfs( i );\\n }\\n memset( used, 0, sizeof( used ) );\\n reverse( vs.begin(), vs.end() );\\n int cnt = 0;\\n for(int v : vs ){\\n if( used[v] ) continue; \\n rdfs( v, cnt++ );\\n }\\n return cnt;\\n}\\nvoid add_edge(int from,int to){\\n G[from].push_back( to );\\n rG[to].push_back( from );\\n}\\n\\nint main(){\\n while( cin >> N && N ){\\n init();\\n map<string,int> H;\\n for(int i=0;i<N;i++){\\n cin >> name[i] >> day1[i] >> sup[i] >> day2[i];\\n H[name[i]] = i;\\n }\\n for(int i=0;i<N;i++)\\n add_edge( H[sup[i]], H[name[i]] );\\n\\n int n = scc();\\n int res = 0;\\n memset( used, 0, sizeof( used ) );\\n for(int i=0;i<n;i++){\\n int sum = 0;\\n int min_pc = INF;\\n int nv = V[i].back();\\n if( used[nv] ) continue;\\n for( int v : V[i] ){\\n sum += day2[v];\\n min_pc = min( min_pc, day1[v] - day2[v] );\\n }\\n res += dfs(nv) + min_pc;\\n }\\n cout << res << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -1.0208,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2033_1897792\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef pair<int,pii> pip;\\ntypedef vector<pip>vip;\\nconst double PI=acos(-1);\\nconst double EPS=1e-8;\\nconst int inf=1e8;\\nconst int LMAX=2010;\\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\\tSCC(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\\tvs=vi(0);\\n\\t}\\n\\tvoid add_edge(int s,int t){\\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};\\nvp in;\\nvvi G,rG;\\nvi visit;\\nint out=0;\\nvoid dfs(int a){\\n\\tout+=in[a].second;\\n\\tvisit[a]=true;\\n\\trep(i,G[a].size())if(visit[G[a][i]]==0)\\n\\t\\tdfs(G[a][i]);\\n}\\nint main(){\\n\\tint n;\\n\\twhile(cin>>n,n){\\n\\t\\tmap<string,int>m;\\n\\t\\tvector<string>a(n),c(n);\\n\\t\\tvi b(n),d(n);\\n\\t\\trep(i,n)cin>>a[i]>>b[i]>>c[i]>>d[i];\\n\\t\\trep(i,n)m[a[i]]=i;\\t\\t\\n\\t\\tSCC scc(n);\\n\\t\\trep(i,n){\\n\\t\\t\\tif(a[i]!=c[i])scc.add_edge(m[c[i]],m[a[i]]);\\n\\t\\t}\\n\\t\\tint N=scc.scc();\\n\\t\\tin=vp(N);\\n\\t\\tG=rG=vvi(N);\\n\\t\\trep(i,N){\\n\\t\\t\\tvi t;\\n\\t\\t\\trep(j,n)if(scc.cmp[j]==i)t.pb(j);\\n\\t\\t\\tif(t.size()==1){\\n\\t\\t\\t\\tif(i!=scc.cmp[m[c[t[0]]]]){\\n\\t\\t\\t\\t\\trG[i].pb(scc.cmp[m[c[t[0]]]]);\\n\\t\\t\\t\\t\\tG[scc.cmp[m[c[t[0]]]]].pb(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tin[i]=pii(b[t[0]],d[t[0]]);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tint mi=inf,sum=0;\\n\\t\\t\\t\\trep(j,t.size())sum+=d[t[j]];\\n\\t\\t\\t\\trep(j,t.size())mi=min(mi,b[t[j]]-d[t[j]]);\\n\\t\\t\\t\\tin[i]=pii(mi+sum,inf);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvisit=vi(N);\\n\\t\\tout=0;\\n\\t\\trep(i,N)if(visit[i]==0&&rG[i].size()==0){\\n\\t\\t\\tout+=in[i].first-in[i].second;\\n\\t\\t\\tdfs(i);\\n\\t\\t}\\n\\t\\tcout<<out<<endl;\\n\\t\\t\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 1712,\n \"score_of_the_acc\": -0.5606,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2033_1354747\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 1000;\\nconst int INF = 1 << 30;\\n\\n/* typedef */\\n\\ntypedef vector<int> vi;\\ntypedef map<string,int> msi;\\n\\nstruct Tool {\\n string name, sup;\\n int day1, day2, diff, i, si;\\n\\n void print() {\\n printf(\\\"Tool: %s(%d):%d, %s(%d):%d\\\\n\\\",\\n\\t name.c_str(), i, day1, sup.c_str(), si, day2);\\n }\\n};\\n\\n/* global variables */\\n\\nint n;\\nTool tools[MAX_N];\\nmsi nhash;\\n\\nbool used[MAX_N], tmpused[MAX_N];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n for (;;) {\\n cin >> n;\\n if (n == 0) break;\\n\\n nhash.clear();\\n for (int i = 0; i < n; i++) {\\n Tool& ti = tools[i];\\n cin >> ti.name >> ti.day1 >> ti.sup >> ti.day2;\\n ti.diff = ti.day1 - ti.day2;\\n ti.i = i;\\n ti.si = -1;\\n nhash[ti.name] = i;\\n }\\n for (int i = 0; i < n; i++) {\\n Tool& ti = tools[i];\\n ti.si = nhash[ti.sup];\\n //ti.print();\\n }\\n\\n memset(used, false, sizeof(used));\\n\\n int minsum = 0;\\n \\n // find loops\\n for (int i = 0; i < n; i++) {\\n Tool& ti = tools[i];\\n if (! used[i]) {\\n\\tmemset(tmpused, false, sizeof(tmpused));\\n\\ttmpused[i] = true;\\n\\tint j = ti.si;\\n\\tfor (; ! tmpused[j]; j = tools[j].si) {\\n\\t if (used[j]) break;\\n\\t tmpused[j] = true;\\n\\t}\\n\\tif (used[j]) continue;\\n\\n\\tint sumloop = tools[j].day2;\\n\\tint mindiff = tools[j].diff;\\n\\n\\tused[j] = true;\\n\\tfor (int k = tools[j].si; k != j; k = tools[k].si) {\\n\\t used[k] = true;\\n\\t sumloop += tools[k].day2;\\n\\t if (mindiff > tools[k].diff) mindiff = tools[k].diff;\\n\\t}\\n\\n\\tminsum += sumloop + mindiff;\\n }\\n }\\n //cout << ln << endl;\\n\\n // check leafs\\n bool changed = true;\\n while (changed) {\\n changed = false;\\n\\n for (int i = 0; i < n; i++) {\\n\\tTool& ti = tools[i];\\n\\tif (! used[i] && used[ti.si]) {\\n\\t used[i] = true;\\n\\t minsum += ti.day2;\\n\\t changed = true;\\n\\t}\\n }\\n }\\n \\n cout << minsum << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1412,\n \"score_of_the_acc\": -0.4247,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2033_936863\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nusing namespace std;\\n\\nconst int IINF = INT_MAX;\\n\\nstruct Edge{\\n int to,cost;\\n Edge(int to=IINF,int cost=IINF):to(to),cost(cost){}\\n};\\n\\nmap<string,int> mp;\\nint day1[1100],N,par[1100],mp_idx;\\nvector<Edge> G[1100];\\nbool used[1100];\\n\\ninline int getIndex(string s){\\n if( mp.find(s) == mp.end() ) return mp[s] = mp_idx++;\\n return mp[s];\\n}\\n\\ninline void init(){\\n mp_idx = 0;\\n mp.clear();\\n rep(i,N) G[i].clear(), par[i] = i;\\n}\\n\\nint find(int x){\\n if( par[x] == x ) return par[x];\\n return par[x] = find(par[x]);\\n}\\n\\ninline void unit(int x,int y){\\n x = find(x), y = find(y);\\n if( x != y ) par[x] = par[y];\\n}\\n\\nvoid dfs(int cur,int &cost){\\n if( used[cur] ) return;\\n used[cur] = true;\\n rep(i,(int)G[cur].size()){\\n int to = G[cur][i].to;\\n if( !used[to] && par[cur] == par[to] ){\\n cost += G[cur][i].cost;\\n dfs(to,cost);\\n }\\n }\\n}\\n\\ninline void compute(){\\n set<int> S;\\n rep(i,N) S.insert(find(i));\\n int cnt = S.size();\\n int mincost[N];\\n rep(i,N) mincost[i] = IINF;\\n rep(i,N){\\n int idx = par[i];\\n int cost = day1[i];\\n rep(j,N) used[j] = false;\\n dfs(i,cost);\\n rep(j,N) if( !used[j] && par[j] == par[i] ) cost += day1[j];\\n mincost[idx] = min(mincost[idx],cost);\\n }\\n int ans = 0;\\n for( int i : S ) ans += mincost[i];\\n cout << ans << endl;\\n}\\n\\nint main(){\\n while( cin >> N, N ){\\n\\n init();\\n rep(i,N){\\n string a,b;\\n int c,d;\\n cin >> a >> c >> b >> d;\\n int ia = getIndex(a);\\n day1[ia] = c;\\n int ib = getIndex(b);\\n if( ia == ib ) continue;\\n G[ib].push_back(Edge(ia,d));\\n unit(ia,ib);\\n }\\n\\n compute();\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 1468,\n \"score_of_the_acc\": -0.5126,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2033_936650\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\nclass UnionFind{\\npublic:\\n vector<int> par, rank;\\n\\n void init(int n){\\n par.resize(n);\\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 x){\\n if(par[x] == x) return x;\\n else return par[x] = find(par[x]);\\n }\\n \\n void unite(int x, int y){\\n x = find(x);\\n y = find(y);\\n if(x == y) return;\\n if(rank[x] < rank[y]) par[x] = par[y];\\n else{\\n par[y] = par[x];\\n if(rank[x] == rank[y]) rank[x]++;\\n }\\n }\\n};\\n\\ntypedef pair<int, int> P; // to, cost\\nconst int MAX = 1005;\\nmap<string, int> M;\\nUnionFind uf;\\nint cost[MAX],n;\\nvector<P> E[MAX];\\nbool used[MAX];\\n\\nint get_index(const string& s){\\n if(M.count(s)) return M[s];\\n else return M[s] = M.size()-1;\\n}\\n\\nvoid init(){\\n uf.init(n);\\n M.clear();\\n for(int i = 0; i < MAX; i++) E[i].clear();\\n}\\n\\nvoid input(){\\n for(int i = 0; i < n; i++){\\n string a,b;\\n int c,d;\\n cin >> a >> c >> b >> d;\\n cost[get_index(a)] = c;\\n get_index(b);\\n if(a == b) continue;\\n E[get_index(b)].push_back(P(get_index(a), d));\\n // cout << b << \\\" -> \\\" << a << endl;\\n uf.unite(get_index(a), get_index(b));\\n }\\n}\\n\\nvoid dfs(int pos, P& p){ // vertex cost\\n \\n if(used[pos]) return;\\n used[pos] = true;\\n p.first++;\\n\\n for(int i = 0; i < (int)E[pos].size(); i++){\\n if(!used[E[pos][i].first]){\\n dfs(E[pos][i].first, p);\\n p.second += E[pos][i].second;\\n }\\n }\\n}\\n\\nvoid solve(){\\n vector<int> v[MAX];\\n for(int i = 0; i < n; i++) v[uf.find(i)].push_back(i);\\n \\n int ans = 0;\\n\\n for(int i = 0; i < MAX; i++){\\n if(v[i].size() == 0) continue;\\n int tmp = -1;\\n for(int j = 0; j < (int)v[i].size(); j++){\\n memset(used, false, sizeof(used));\\n P p = P(0,0);\\n dfs(v[i][j],p);\\n p.second += cost[v[i][j]];\\n/******* if(v[i][j] == 0){\\n cout << p.first << \\\" \\\" << p.second << endl;\\n }*/\\n if((p.first == (int)v[i].size()) && (tmp == -1 || tmp > p.second)) tmp = p.second;\\n }\\n ans += tmp;\\n }\\n cout << ans << endl;\\n}\\n\\nint main(){\\n \\n while(cin >> n && n){\\n init();\\n input();\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 1512,\n \"score_of_the_acc\": -0.5116,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2033_849140\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\n\\nusing namespace std;\\nint main(){\\n int n;\\n while(cin >> n && n){\\n vector<string> name(n), sup(n);\\n vector<int> high(n), low(n);\\n REP(i, n) cin >> name[i] >> high[i] >> sup[i] >> low[i];\\n map<string, int> index;\\n REP(i, n) index[ name[i] ] = i;\\n vector<int> color(n, 0);\\n int ans = 0;\\n REP(i, n) if(color[i] == 0){\\n vector<int> list;\\n int u = i;\\n while(color[u] == 0){\\n list.push_back(u);\\n color[u] = 1;\\n u = index[ sup[u] ];\\n }\\n if(color[u] == 1){\\n int min_sum = INT_MAX;\\n bool in_roop = false;\\n for(int h : list){\\n if(h == u) in_roop = true;\\n if(!in_roop) continue;\\n int sum = 0;\\n for(int li : list){\\n sum += (li == h ? high[li] : low[li]);\\n }\\n if(min_sum > sum) min_sum = sum;\\n }\\n ans += min_sum;\\n }else if(color[u] == 2){\\n for(int li : list){\\n ans += low[li];\\n }\\n }\\n for(int li : list){\\n color[li] = 2;\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1432,\n \"score_of_the_acc\": -0.4302,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2033_528242\",\n \"code_snippet\": \"//55\\n#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<map>\\n#include<vector>\\n#include<deque>\\n\\nusing namespace std;\\n\\nint n;\\nstring na[1000],su[1000];\\nint d[1000],dd[1000];\\nmap<string,int> m;\\nvector<int> ds[1000];\\nbool p[1000];\\nint cut[1000];\\n\\nint dfs(int x){\\n if(p[x])return 0;\\n int s=p[m[su[x]]]?d[x]-dd[x]:0;\\n p[x]=true;\\n for(int i=0;i<ds[x].size();i++){\\n s+=dfs(ds[x][i]);\\n }\\n return s;\\n}\\n\\nbool cmp(int a,int b){\\n return cut[a]>cut[b];\\n}\\n\\nint main(){\\n while(cin>>n,n){\\n m.clear();\\n for(int i=0;i<n;i++){\\n cin>>na[i]>>d[i]>>su[i]>>dd[i];\\n m[na[i]]=i;\\n }\\n for(int i=0;i<n;i++){\\n ds[i].clear();\\n }\\n for(int i=0;i<n;i++){\\n ds[m[su[i]]].push_back(m[na[i]]);\\n }\\n for(int i=0;i<1000;i++){\\n fill(p,p+n,false);\\n cut[i]=dfs(i);\\n }\\n deque<int> ef(n);\\n for(int i=0;i<n;i++){\\n ef[i]=i;\\n }\\n sort(ef.begin(),ef.end(),cmp);\\n bool done[1000]={};\\n int a=0;\\n for(int i=0;i<n;i++){\\n for(int nt=0;nt<n;nt++){\\n\\tif(!done[nt]){\\n\\t if(done[m[su[nt]]]){\\n\\t a+=dd[nt];\\n\\t done[nt]=true;\\n\\t goto next;\\n\\t }\\n\\t}\\n }\\n while(done[ef[0]]){\\n\\tef.pop_front();\\n }\\n a+=d[ef[0]];\\n done[ef[0]]=true;\\n next:\\n ;\\n }\\n cout<<a<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1540,\n \"memory_kb\": 1604,\n \"score_of_the_acc\": -1.4451,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2033_523414\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <map>\\n#include <climits>\\n#include <cstring>\\nusing namespace std;\\n\\ntypedef pair<int,int> P;\\n\\nint n, ans;\\nint t[1002];\\nvector<P> g[1002];\\nmap<string,int> name;\\nbool used[1002], loop[1002];\\n\\nint getId(string s){\\n if(name.find(s) != name.end()){\\n return name[s];\\n }\\n int size = name.size();\\n return name[s] = size;\\n}\\n\\nvoid solve(){\\n memset(used, 0, sizeof(used));\\n\\n for(int i = 0; i < n; i++){\\n if(used[i]) continue;\\n\\n memset(loop, 0, sizeof(loop));\\n\\n int id = i;\\n bool flg = true;\\n\\n while(!loop[id]){\\n if(used[id]){\\n\\tflg = false;\\n\\tbreak;\\n }\\n\\n loop[id] = true;\\n used[id] = true;\\n id = g[id][0].first;\\n }\\n if(!flg) continue;\\n\\n int start = id;\\n int minId = start;\\n\\n id = g[start][0].first;\\n\\n while(id != start){\\n if(t[minId] - g[minId][0].second > t[id] - g[id][0].second){\\n\\tminId = id;\\n }\\n id = g[id][0].first;\\n }\\n\\n ans += t[minId] - g[minId][0].second;\\n }\\n\\n cout << ans << endl;\\n}\\n\\nint main(){\\n while(cin >> n, n){\\n ans = 0;\\n name.clear();\\n\\n for(int i = 0; i < 1002; i++){\\n g[i].clear();\\n }\\n\\n for(int i = 0; i < n; i++){\\n string FROM, TO;\\n int a, b;\\n cin >> FROM >> a >> TO >> b;\\n\\n int from = getId(FROM);\\n int to = getId(TO);\\n t[from] = a;\\n g[from].push_back(P(to, b));\\n ans += b;\\n }\\n\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 1388,\n \"score_of_the_acc\": -0.4312,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2033_523404\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <sstream>\\n#include <cmath>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <map>\\n\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n\\nusing namespace std;\\n\\ntypedef vector<vector<int> > graph;\\n\\nvoid getReversedGraph(graph& G, graph* rG) {\\n *rG = graph(G.size());\\n for (int i = 0; i < (int)G.size(); i++) {\\n for (int j = 0; j < (int)G[i].size(); j++) {\\n (*rG)[G[i][j]].push_back(i);\\n }\\n }\\n}\\n\\nvoid getSCCGraph(graph& G, graph* SCCGraph, vector<int>* table) {\\n const int V = G.size();\\n graph rG;\\n vector<vector<int> > SCCList;\\n vector<int> postOrder;\\n bool *used = new bool[V];\\n int *nextIndex = new int[V];\\n *table = vector<int>(V);\\n getReversedGraph(G, &rG);\\n\\n // DFS\\n for (int i = 0; i < V; i++) {\\n used[i] = false;\\n nextIndex[i] = 0;\\n }\\n\\n for (int i = 0; i < V; i++) {\\n if (used[i]) {\\n continue;\\n }\\n used[i] = true;\\n stack<int> st;\\n st.push(i);\\n while (!st.empty()) {\\n int v = st.top();\\n if (nextIndex[v] == (int)G[v].size()) {\\n postOrder.push_back(v);\\n st.pop();\\n } else {\\n int newv = G[v][nextIndex[v]];\\n if (!used[newv]) {\\n st.push(newv);\\n used[newv] = true;\\n }\\n nextIndex[v]++;\\n }\\n }\\n }\\n // Reversed DFS\\n for (int i = 0; i < V; i++) {\\n used[i] = false;\\n nextIndex[i] = 0;\\n }\\n\\n int it = 0;\\n for (int i = V - 1; i >= 0; i--) {\\n int index = postOrder[i];\\n if (used[index]) {\\n continue;\\n }\\n used[index] = true;\\n (*table)[index] = it;\\n stack<int> st;\\n vector<int> list;\\n st.push(index);\\n list.push_back(index);\\n while (!st.empty()) {\\n int v = st.top();\\n if (nextIndex[v] == (int)rG[v].size()) {\\n st.pop();\\n } else {\\n int newv = rG[v][nextIndex[v]];\\n if (!used[newv]) {\\n st.push(newv);\\n list.push_back(newv);\\n used[newv] = true;\\n (*table)[newv] = it;\\n }\\n nextIndex[v]++;\\n }\\n }\\n SCCList.push_back(list);\\n it++;\\n }\\n\\n // create new graph;\\n const int compressedV = it;\\n *SCCGraph = graph(compressedV);\\n \\n for (int i = 0; i < compressedV; i++) {\\n map<int, bool> edgeUsed;\\n for (int j = 0; j < (int)SCCList[i].size(); j++) {\\n int v = SCCList[i][j];\\n for (int k = 0; k < (int)G[v].size(); k++) {\\n int w = G[v][k];\\n // v -> w\\n if (!edgeUsed[(*table)[w]]) {\\n edgeUsed[(*table)[w]] = true;\\n if (i != (*table)[w]) (*SCCGraph)[i].push_back((*table)[w]);\\n }\\n }\\n }\\n }\\n\\n delete[] used;\\n delete[] nextIndex;\\n}\\n\\nbool used[2005];\\n\\nvoid check(int v, graph& G, bool* used) {\\n if (used[v])return;\\n used[v] = true;\\n rep(i, G[v].size()) {\\n check(G[v][i], G, used);\\n }\\n}\\n\\nint solve(int n) {\\n string s1,s2;\\n int d1,d2;\\n graph G(n), sccG, rG;\\n vector<int> table;\\n map<string, int> toId;\\n map<int, int> plus;\\n int ans = 0;\\n int id = 0;\\n rep(i,n) {\\n cin >> s1 >> d1 >> s2 >> d2;\\n if (toId.find(s1) == toId.end()) {\\n toId[s1] = id;\\n id++;\\n }\\n if (toId.find(s2) == toId.end()) {\\n toId[s2] = id;\\n id++;\\n }\\n ans+= d2;\\n if (s1 != s2)G[toId[s2]].push_back(toId[s1]);\\n plus[toId[s1]] = d1 - d2;\\n }\\n \\n getSCCGraph(G, &sccG, &table);\\n rep(i, 2005)used[i] = false;\\n rep(i, sccG.size()) {\\n vector<int> p;\\n if (used[i])continue;\\n //cerr << i << endl;\\n //cerr << \\\"\\\\t\\\";\\n rep(j, table.size()) {\\n if (table[j] == i) {\\n p.push_back(plus[j]);\\n //cerr << j << \\\":\\\" << p[j] << \\\" \\\";\\n }\\n }\\n //cerr << endl;\\n sort(p.begin(), p.end());\\n ans += p[0];\\n check(i, sccG, used);\\n }\\n return ans;\\n}\\n\\nint main() {\\n int n;\\n while(cin >> n, n) {\\n cout << solve(n) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 1584,\n \"score_of_the_acc\": -0.5119,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2033_469009\",\n \"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 main()\\n{\\n for(;;){\\n int n;\\n cin >> n;\\n if(n == 0)\\n return 0;\\n\\n vector<string> s1(n), s2(n);\\n vector<int> t1(n), t2(n);\\n map<string, int> index;\\n for(int i=0; i<n; ++i){\\n cin >> s1[i] >> t1[i] >> s2[i] >> t2[i];\\n index[s1[i]] = i;\\n }\\n\\n vector<int> sup(n);\\n vector<vector<int> > edges(n);\\n for(int i=0; i<n; ++i){\\n sup[i] = index[s2[i]];\\n if(s1[i] != s2[i])\\n edges[index[s2[i]]].push_back(i);\\n }\\n\\n int ret = 0;\\n vector<bool> make(n, false);\\n for(int i=0; i<n; ++i){\\n if(make[i])\\n continue;\\n\\n int j = i;\\n vector<bool> check(n, false);\\n while(!check[j]){\\n check[j] = true;\\n j = sup[j];\\n }\\n\\n check.assign(n, false);\\n int k = j;\\n while(!check[j]){\\n if(t1[j] - t2[j] < t1[k] - t2[k])\\n k = j;\\n check[j] = true;\\n j = sup[j];\\n }\\n\\n ret += t1[k] - t2[k];\\n queue<int> q;\\n q.push(k);\\n while(!q.empty()){\\n int a = q.front();\\n q.pop();\\n ret += t2[a];\\n make[a] = true;\\n\\n for(unsigned l=0; l<edges[a].size(); ++l){\\n int b = edges[a][l];\\n if(!make[b])\\n q.push(b);\\n }\\n }\\n }\\n\\n cout << ret << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 1488,\n \"score_of_the_acc\": -0.4589,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2033_354764\",\n \"code_snippet\": \"//include\\n//------------------------------------------\\n#include <vector>\\n#include <list>\\n#include <map>\\n#include <set>\\n#include <stack>\\n#include <queue>\\n#include <bitset>\\n#include <algorithm>\\n#include <numeric>\\n#include <utility>\\n#include <sstream>\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <cmath>\\n#include <string>\\n#include <cstring>\\n\\nusing namespace std;\\n\\n//conversion\\n//------------------------------------------\\ninline int toInt(string s) {int v; istringstream sin(s); sin >> v; return v;}\\ntemplate<class T> inline string toStr(T x) {ostringstream sout; sout << x; return sout.str();}\\n\\n//math\\n//-------------------------------------------\\ntemplate<class T> inline T sqr(T x) {return x*x;}\\n\\n//typedef\\n//------------------------------------------\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef long long LL;\\n\\n//container util\\n//------------------------------------------\\n#define ALL(a, n) (a), (a) + (n)\\n#define VALL(v) (v).begin(),(v).end()\\n#define VADD(v, e) (v).push_back(e)\\n#define SADD(s, e) (s).insert(e)\\n#define STADD(s, e) (s).push(e)\\n#define QADD(q, e) (q).push(e)\\n#define PQADD(q, e) (q).push(e)\\n#define STPOP(s, e) typeof((q).top()) e = (q).top(); (q).pop()\\n#define QPOP(q) typeof((q).front()) e = (q).front(); (q).pop()\\n#define PQPOP(q) typeof((q).top()) e = (q).top(); (q).pop()\\n#define MP make_pair\\n#define PF(p) (p).first\\n#define PS(p) (p).second\\n#define SZ(a) int((a).size())\\n#define EACH(i, c) for(typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\\n#define EXIST(s, e) ((s).find(e) != (s).end())\\n#define SORT(a, n) sort(ALL(a, n))\\n#define VSORT(c) sort(VALL(c))\\n#define RSORT(a, n) sort(ALL(a, n), greater<typeof(a[0])>())\\n#define VRSORT(v) sort(VALL(v), greater<typeof(v[0])>())\\n#define INDEX(a, n, x) find(ALL(a, n), x) - a\\n#define VINDEX(v, x) find(VALL(v), x) - v.begin()\\n#define BOUND(a, n, x) lower_bound(ALL(a, n), x) - a\\n#define VBOUND(v, x) lower_bound(VALL(v), x) - v.begin()\\n\\n//repetition\\n//------------------------------------------\\n#define FOR(i, a, b) for (int i = (a);i < (b); ++i)\\n#define RFOR(i, a, b) for (int i = (b) - 1; i >= (a); --i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define RREP(i, n) RFOR(i, 0, n)\\n\\n//IO\\n//------------------------------------------\\n#define LF(x) cout << (x) << endl;\\n#define LF2(x, y) cout << (x) << \\\" \\\" << (y) << endl;\\n#define LFA(a, n) cout << a[0]; FOR(i, 1, n) {cout << \\\" \\\" << a[i];} cout << endl;\\n#define LFD(x, w) cout.width = (w); cout << (x) << endl;\\n#define LFDA(a, n, w) REP(i, n) cout.width = (w); cout << a[i] << endl;\\n#define LFP(x, w) cout << setprecision((w)); cout << setiosflags(ios::fixed); cout << (x) << endl;\\n#define LFP2(x, y, w) cout << setprecision((w)); cout << setiosflags(ios::fixed); cout << (x) << \\\" \\\" << (y) << endl;\\n#define LFPA(a, n, w) cout << setprecision((w)); cout << setiosflags(ios::fixed); cout << a[0]; FOR(i, 1, n) {cout << \\\" \\\" << a[i];} cout << endl;\\n\\n//constant\\n//--------------------------------------------\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\nconst int INF = 1e9;\\n\\n//clear memory\\n//--------------------------------------------\\n#define CLR(a) memset((a), 0 , sizeof(a))\\n\\n//debug\\n//--------------------------------------------\\n#define DUMP(x) cerr << #x << \\\" = \\\" << (x) << endl;\\n#define DEBUG(x) cerr << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl;\\n#define DUMPA(a, n) cerr << #a << \\\" = {\\\" << a[0]; FOR(i, 1, n) { cout << \\\", \\\" << a[i]; } cerr << \\\"}\\\" << endl;\\n#define DEBUGA(a, n) cerr << #a << \\\" = {\\\" << a[0]; FOR(i, 1, n) { cout << \\\", \\\" << a[i]; } cerr << \\\"} (L\\\" << __LINE__ << \\\")\\\" << endl;\\n#define DUMPAA(a, n, m) REP(i, n) {REP(j, m) {cout << a[i][j] << \\\" \\\";} cout << endl;}\\n#define DEBUGAA(a, n, m) DUMPAA(a, n, m) cout << \\\"(L\\\" << __LINE__ << \\\")\\\" << endl;\\n\\n//#include <uft>\\nclass uft\\n{\\npublic:\\n\\tint N;\\n\\tint n;\\n\\tint* p;\\n\\tint* r;\\n\\t\\n\\tuft(const int N)\\n\\t{\\n\\t\\tthis->N = N;\\n\\t\\tp = new int[N];\\n\\t\\tr = new int[N];\\n\\t}\\n\\t\\n\\t~uft()\\n\\t{\\n\\t\\tdelete[] p;\\n\\t\\tdelete[] r;\\n\\t}\\n\\t\\n\\tvoid init(int n)\\n\\t{\\n\\t\\tthis->n = n;\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tp[i] = i;\\n\\t\\t\\tr[i] = 0;\\n\\t\\t}\\n\\t}\\n\\t\\n\\tint find(int x)\\n\\t{\\n\\t\\tif (p[x] == x) {\\n\\t\\t\\treturn x;\\n\\t\\t}\\n\\t\\tp[x] = find(p[x]);\\n\\t\\treturn p[x];\\n\\t}\\n\\t\\n\\tvoid unite(int x, int y)\\n\\t{\\n\\t\\tint a = find(x);\\n\\t\\tint b = find(y);\\n\\t\\tif (a == b) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif(r[a] < r[b]) {\\n\\t\\t\\tp[a] = b;\\n\\t\\t}\\n\\t\\telse if (r[a] == r[b]){\\n\\t\\t\\tp[a] = b;\\n\\t\\t\\tr[b]++;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tp[b] = a;\\n\\t\\t}\\n\\t}\\n\\t\\n\\tbool same(int x, int y)\\n\\t{\\n\\t\\treturn find(x) == find(y);\\n\\t}\\n\\n};\\n\\n//#include_end <uft>\\n\\nconst int N = 1000;\\nint n;\\nstring name[N];\\nint day1[N];\\nstring sup[N];\\nint day2[N];\\nmap<string, int> f;\\nuft uft(N);\\nVI e[N];\\nint m[N];\\nint dp[N];\\nbool v[N];\\n\\nint dfs(int k)\\n{\\n\\tv[k] = true;\\n\\tint ans = day1[k];\\n\\tREP(i, e[k].size()) {\\n\\t\\tif(!v[e[k][i]]) ans += dfs(e[k][i]) - day1[e[k][i]] + day2[e[k][i]];\\n\\t}\\n\\treturn ans;\\n}\\n\\nvoid init()\\n{\\n}\\n\\nvoid solve()\\n{\\n\\tf.clear();\\n\\tREP(i, n) {\\n\\t\\tf[name[i]] = i;\\n\\t\\te[i].clear();\\n\\t}\\n\\tuft.init(n);\\n\\tfill(ALL(m, n), 1);\\n\\tREP(i, n) {\\n\\t\\tint t = f[name[i]];\\n\\t\\tint u = f[sup[i]];\\n\\t\\tif (!uft.same(t, u)) {\\n\\t\\t\\tuft.unite(t, u);\\n\\t\\t\\tm[t] += m[u];\\n\\t\\t\\tREP(j, n) {\\n\\t\\t\\t\\tif (uft.same(t, j)) {\\n\\t\\t\\t\\t\\tm[j] = m[t];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tVADD(e[u], t);\\n\\t}\\n\\tfill(ALL(dp, n), INF);\\n\\tREP(i, n) {\\n\\t\\tfill(ALL(v, n), false);\\n\\t\\tint x = dfs(i);\\n\\t\\tint y = 0;\\n\\t\\tREP(j, n) {\\n\\t\\t\\tif (v[j]) ++y;\\n\\t\\t}\\n\\t\\tif (y < m[i]) continue;\\n\\t\\tREP(j, n) {\\n\\t\\t\\tif (uft.same(i, j)) {\\n\\t\\t\\t\\tdp[j] = min(dp[j], x);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans = 0;\\n\\tREP(i, n) {\\n\\t\\tbool b = false;\\n\\t\\tREP(j, i) {\\n\\t\\t\\tb |= uft.same(i, j);\\n\\t\\t}\\n\\t\\tif (!b) ans += dp[i];\\n\\t}\\n\\tLF(ans);\\n}\\n\\nint main()\\n{\\n\\tinit();\\n\\twhile (cin >> n, n) {\\n\\t\\tREP(i, n) cin >> name[i] >> day1[i] >> sup[i] >> day2[i];\\n\\t\\tsolve();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 790,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.5066,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2033_334814\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <map>\\n#include <cstring>\\n\\nusing namespace std;\\n\\ntypedef pair<int,int> pii;\\n\\nbool used[1001];\\nint n;\\nvector<int> G[1001];\\npii costs[1001];\\nint idx=0;\\nmap<string,int> indices;\\nint nxt[1001];\\nint in[1001];\\nint sumCosts=0;\\nbool used2[1001];\\n\\n// üü0Ìm[hÉ¢ÄTõ(ÂHͶݵ¦È¢)\\nvoid search1(int s){\\n\\tused[s]=true;\\n\\tfor(int i=0;i<(int)G[s].size();i++){\\n\\t\\tint to=G[s][i];\\n\\t\\tif(!used[to]){\\n\\t\\t\\tnxt[s]=to;\\n\\t\\t\\tsumCosts+=costs[to].second;\\n\\t\\t\\tsearch1(to);\\n\\t\\t}\\n\\t}\\n}\\n// ü_ª ém[h©çTõðnßé\\nvoid search2(int s){\\n\\tused[s]=true;\\n\\tused2[s]=true;\\n\\tfor(int i=0;i<(int)G[s].size();i++){\\n\\t\\tint to=G[s][i];\\n\\t\\tif(!used[to]){\\n\\t\\t\\tnxt[s]=to;\\n\\t\\t\\tsumCosts+=costs[to].second;\\n\\t\\t\\tsearch2(to);\\n\\t\\t}\\n\\t\\t// ÂH𩵽êAÂHÌÅÅàRXg·Ì¬³¢àÌðÌp\\n\\t\\telse{\\n\\t\\t\\t// ¡ñÊßµ½êÅÍÈ¢ê\\n\\t\\t\\tif(!used2[to])continue;\\n\\t\\t\\tvector<pii> v;\\n\\t\\t\\tint cur=to;\\n\\t\\t\\twhile(1){\\n\\t\\t\\t\\tv.push_back(pii(costs[cur].first-costs[cur].second,cur));\\n\\t\\t\\t\\tif(cur==s)break;\\n\\t\\t\\t\\tint tto=nxt[cur];\\n\\t\\t\\t\\tcur=tto;\\n\\t\\t\\t}\\n\\t\\t\\tsort(v.begin(),v.end());\\n\\t\\t\\tsumCosts+=costs[v[0].second].first;\\n\\t\\t\\tsumCosts-=costs[v[0].second].second;\\n\\t\\t}\\n\\t}\\n}\\n\\nint main(){\\n\\n\\twhile(cin>>n&&n){\\n\\t\\tsumCosts=0;\\n\\t\\tmemset(in,0,sizeof(in));\\n\\t\\tmemset(used,0,sizeof(used));\\n\\t\\tindices.clear();\\n\\t\\tidx=0;\\n\\t\\tfor(int i=0;i<1001;i++)G[i].clear();\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tstring a,b;\\n\\t\\t\\tint c,d;\\n\\t\\t\\tcin>>a>>c>>b>>d;\\n\\t\\t\\tif(indices.find(a)==indices.end())indices[a]=idx++;\\n\\t\\t\\tif(indices.find(b)==indices.end())indices[b]=idx++;\\n\\t\\t\\tif(a!=b){\\n\\t\\t\\t\\tG[indices[b]].push_back(indices[a]);\\n\\t\\t\\t\\tin[indices[a]]++;\\n\\t\\t\\t}\\n\\t\\t\\tcosts[indices[a]]=pii(c,d);\\n\\t\\t}\\n\\t\\t// ü_ª³¢¨ðTõ\\n\\t\\tfor(int i=0;i<idx;i++){\\n\\t\\t\\tif(in[i]==0&&!used[i]){\\n\\t\\t\\t\\t// ÅÌvfÍK¸æé\\n\\t\\t\\t\\tsumCosts+=costs[i].first;\\n\\t\\t\\t\\tsearch1(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// ܾTõµÄ¢È¢àÌð·×ÄTõ\\n\\t\\tfor(int i=0;i<idx;i++){\\n\\t\\t\\tif(!used[i]){\\n\\t\\t\\t\\tmemset(used2,0,sizeof(used2));\\n\\t\\t\\t\\tsumCosts+=costs[i].second;\\n\\t\\t\\t\\tsearch2(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<sumCosts<<endl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 1140,\n \"score_of_the_acc\": -0.4479,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2033_256054\",\n \"code_snippet\": \"#include<map>\\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\\ntypedef vector< vector<int> > vvi;\\n\\nconst int INF=1<<29;\\n\\nvoid GabowDFS(int u,vector<bool> &visited,vector<int> &nodes,const vvi &adj){\\n\\tif(visited[u]) return;\\n\\tvisited[u]=true;\\n\\trep(i,adj[u].size()){\\n\\t\\tint v=adj[u][i];\\n\\t\\tif(!visited[v]) GabowDFS(v,visited,nodes,adj);\\n\\t}\\n\\tnodes.push_back(u);\\n}\\n\\nvvi GabowSCC(const vvi &adj){\\n\\tint n=adj.size();\\n\\tvector<int> ord;\\n\\tvector<bool> visited(n);\\n\\trep(u,n) GabowDFS(u,visited,ord,adj);\\n\\n\\tvvi radj(n);\\n\\trep(u,n) rep(i,adj[u].size()) radj[adj[u][i]].push_back(u);\\n\\n\\tvvi sccs;\\n\\trep(u,n) visited[u]=false;\\n\\tfor(int i=n-1;i>=0;i--){\\n\\t\\tint u=ord[i];\\n\\t\\tvector<int> scc;\\n\\t\\tGabowDFS(u,visited,scc,radj);\\n\\t\\tif(scc.size()>0) sccs.push_back(scc);\\n\\t}\\n\\treturn sccs;\\n}\\n\\nint main(){\\n\\tfor(int n;cin>>n,n;){\\n\\t\\tint m=0;\\n\\t\\tmap<string,int> f;\\n\\n\\t\\tvvi adj(n);\\n\\t\\tint day1[1000],day2[1000];\\n\\t\\trep(i,n){\\n\\t\\t\\tstring s1,s2;\\n\\t\\t\\tint d1,d2; cin>>s1>>d1>>s2>>d2;\\n\\t\\t\\tif(f.count(s1)==0) f[s1]=m++;\\n\\t\\t\\tif(f.count(s2)==0) f[s2]=m++;\\n\\n\\t\\t\\tint u=f[s2],v=f[s1];\\n\\t\\t\\tadj[u].push_back(v);\\n\\t\\t\\tday1[v]=d1;\\n\\t\\t\\tday2[v]=d2;\\n\\t\\t}\\n\\n\\t\\tvvi scc=GabowSCC(adj);\\n\\n\\t\\tint ans=0;\\n\\t\\tbool tool[1000]={};\\n\\t\\trep(i,scc.size()){\\n\\t\\t\\tint dif=INF;\\n\\t\\t\\tbool start=true;\\n\\t\\t\\trep(j,scc[i].size()){\\n\\t\\t\\t\\tint u=scc[i][j];\\n\\t\\t\\t\\tans+=day2[u];\\n\\t\\t\\t\\tdif=min(dif,day1[u]-day2[u]);\\n\\t\\t\\t\\tif(tool[u]) start=false;\\n\\t\\t\\t}\\n\\t\\t\\tif(start) ans+=dif;\\n\\n\\t\\t\\trep(j,scc[i].size()){\\n\\t\\t\\t\\tint u=scc[i][j];\\n\\t\\t\\t\\trep(k,adj[u].size()) tool[adj[u][k]]=true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.1447,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2033_245575\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\ntypedef vector<vector<int> > graph;\\n\\n#define REP(i,n) for(int i=0; i<n; i++)\\n\\n\\nvoid visit(graph& g, vector<int>& PostOrder, vector<bool>& visited, int ps)\\n{\\n\\tvisited[ps]=1;\\n\\tint S=g[ps].size();\\n\\tREP(i,S)\\n\\t{\\n\\t\\tint next=g[ps][i];\\n\\t\\tif(visited[next]) continue;\\n\\t\\tvisit(g, PostOrder, visited, next);\\n\\t}\\n\\t\\n\\tPostOrder.push_back(ps);\\n}\\n\\nvoid walk(graph& g, vector<int>& in, int ps, int gcnt)\\n{\\n\\tin[ps]=gcnt;\\n\\t\\n\\tint S=g[ps].size();\\n\\tREP(i,S)\\n\\t{\\n\\t\\tint next=g[ps][i];\\n\\t\\tif(in[next]!=-1) continue;\\n\\t\\twalk(g,in,next,gcnt);\\n\\t}\\n}\\n\\n//StronglyConnectedComponent\\nint SCC(vector<int>& in, int V, graph& g, graph& rg)\\n{\\n\\tint gcnt=0;\\n\\tvector<int> PostOrder;\\n\\tvector<bool> visited(V,false);\\n\\t\\n\\tREP(i,V)\\n\\t{\\n\\t\\tif(visited[i]) continue;\\n\\t\\tvisit(g,PostOrder,visited, i);\\n\\t}\\n\\t\\t\\n\\tfor(int i=PostOrder.size()-1; i>=0; --i)\\n\\t{\\n\\t\\tif(in[PostOrder[i]]==-1) \\n\\t\\t{\\n\\t\\t\\twalk(rg,in,PostOrder[i],gcnt++);\\n\\t\\t}\\n\\t}\\n\\n\\treturn gcnt;\\n}\\n\\nint recipe[1050], self[1050],reduce[1050];\\n\\nint dfs(int p, vector<bool>& use, graph& g, graph& c)\\n{\\n\\tuse[p]=1;\\n\\n\\tint ret=0;\\n\\tfor(int i=0; i<g[p].size(); i++)\\n\\t{\\n\\t\\tint next=g[p][i];\\n\\t\\tif(use[next]) continue;\\n\\t\\tret+=dfs(next, use, g, c);\\n\\t\\tret+=c[p][i];\\n\\t}\\n\\n\\treturn ret;\\n\\n}\\n\\nint calc(vector<int>& v, vector<bool>& created, graph& g, graph& c)\\n{\\n\\tvector<bool> use(10000, 1);\\n\\tfor(int i=0; i<v.size(); i++)\\n\\t\\tuse[v[i]]=0;\\n\\n\\tint ret=0,mn=(1<<24),r;\\n\\tif(v.size()==1)\\n\\t{\\n\\t\\tint p=v[0];\\n\\t\\tif(created[recipe[p]]) ret=reduce[p];\\n\\t\\telse ret=self[p];\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tfor(int i=0; i<v.size(); i++)\\n\\t\\t{\\n\\t\\t\\tint p=v[i];\\n\\t\\t\\tif(self[p]-reduce[p]<mn)\\n\\t\\t\\t{\\n\\t\\t\\t\\tr=p;\\n\\t\\t\\t\\tmn=self[p]-reduce[p];\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor(int i=0; i<v.size(); i++)\\n\\t\\t{\\n\\t\\t\\tint p=v[i];\\n\\t\\t\\tif(p==r) ret+=self[p];\\n\\t\\t\\telse ret+=reduce[p];\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i=0; i<v.size(); i++)\\n\\t\\tcreated[v[i]]=1;\\n\\n\\treturn ret;\\n}\\n\\nint main()\\n{\\n\\tint N;\\n\\twhile(cin >> N, N)\\n\\t{\\n\\t\\tgraph g(N), rg(N), c(N), rc(N);\\n\\n\\t\\tint dcnt=0;\\n\\t\\tmap<string, int> dic;\\n\\t\\tfor(int i=0; i<N; i++)\\n\\t\\t{\\n\\t\\t\\tstring s,t;\\n\\t\\t\\tint a,b,u,v;\\n\\t\\t\\tcin >> s >> a >> t >> b;\\n\\n\\t\\t\\tif(!dic.count(s)) dic[s]=dcnt++;\\n\\t\\t\\tif(!dic.count(t)) dic[t]=dcnt++;\\n\\t\\t\\t\\n\\t\\t\\tu=dic[s];\\n\\t\\t\\tv=dic[t];\\n\\n\\t\\t\\t g[u].push_back(v);\\n\\t\\t\\trg[v].push_back(u);\\n\\t\\t\\t c[u].push_back(b);\\n\\t\\t\\trc[v].push_back(b);\\n\\n\\t\\t\\tself[u]=a;\\n\\t\\t\\trecipe[u]=v;\\n\\t\\t\\treduce[u]=b;\\n\\t\\t}\\n\\n\\t\\tvector<int> in(N, -1);\\n\\t\\tint gcnt=SCC(in,N,rg,g);\\n\\n\\t\\tvector<vector<int> > loop(gcnt);\\n\\t\\tfor(int i=0; i<N; i++)\\n\\t\\t\\tloop[in[i]].push_back(i);\\n\\n\\t\\tvector<bool> created(N, 0);\\n\\n\\t\\tint ans=0;\\n\\t\\tfor(int i=0; i<gcnt; i++)\\n\\t\\t{\\n\\t\\t\\tans+=calc(loop[i], created, rg, rc);\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"%d\\\\n\\\", ans);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 1188,\n \"score_of_the_acc\": -0.4875,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2033_245563\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\ntypedef vector<vector<int> > graph;\\n\\n#define REP(i,n) for(int i=0; i<n; i++)\\n\\n\\nvoid visit(graph& g, vector<int>& PostOrder, vector<bool>& visited, int ps)\\n{\\n\\tvisited[ps]=1;\\n\\tint S=g[ps].size();\\n\\tREP(i,S)\\n\\t{\\n\\t\\tint next=g[ps][i];\\n\\t\\tif(visited[next]) continue;\\n\\t\\tvisit(g, PostOrder, visited, next);\\n\\t}\\n\\t\\n\\tPostOrder.push_back(ps);\\n}\\n\\nvoid walk(graph& g, vector<int>& in, int ps, int gcnt)\\n{\\n\\tin[ps]=gcnt;\\n\\t\\n\\tint S=g[ps].size();\\n\\tREP(i,S)\\n\\t{\\n\\t\\tint next=g[ps][i];\\n\\t\\tif(in[next]!=-1) continue;\\n\\t\\twalk(g,in,next,gcnt);\\n\\t}\\n}\\n\\n//StronglyConnectedComponent\\nint SCC(vector<int>& in, int V, graph& g, graph& rg)\\n{\\n\\tint gcnt=0;\\n\\tvector<int> PostOrder;\\n\\tvector<bool> visited(V,false);\\n\\t\\n\\tREP(i,V)\\n\\t{\\n\\t\\tif(visited[i]) continue;\\n\\t\\tvisit(g,PostOrder,visited, i);\\n\\t}\\n\\t\\t\\n\\tfor(int i=PostOrder.size()-1; i>=0; --i)\\n\\t{\\n\\t\\tif(in[PostOrder[i]]==-1) \\n\\t\\t{\\n\\t\\t\\twalk(rg,in,PostOrder[i],gcnt++);\\n\\t\\t}\\n\\t}\\n\\n\\treturn gcnt;\\n}\\n\\nint recipe[1050], self[1050],reduce[1050];\\n\\nint dfs(int p, vector<bool>& use, graph& g, graph& c)\\n{\\n\\tuse[p]=1;\\n\\n\\tint ret=0;\\n\\tfor(int i=0; i<g[p].size(); i++)\\n\\t{\\n\\t\\tint next=g[p][i];\\n\\t\\tif(use[next]) continue;\\n\\t\\tret+=dfs(next, use, g, c);\\n\\t\\tret+=c[p][i];\\n\\t}\\n\\n\\treturn ret;\\n\\n}\\n\\nint calc(vector<int>& v, vector<bool>& created, graph& g, graph& c)\\n{\\n\\tvector<bool> use(10000, 1);\\n\\tfor(int i=0; i<v.size(); i++)\\n\\t\\tuse[v[i]]=0;\\n\\n\\tint ret=(1<<24);\\n\\tfor(int i=0; i<v.size(); i++)\\n\\t{\\n\\t\\tvector<bool> u(use);\\n\\t\\tint p=v[i], t=dfs(p,u,g,c);\\n\\t\\tif(created[recipe[p]]) t+=reduce[p];\\n\\t\\telse\\t\\t\\t\\t\\tt+=self[p];\\n\\t\\t\\n\\t\\tret=min(ret, t);\\n\\t}\\n\\n\\tfor(int i=0; i<v.size(); i++)\\n\\t\\tcreated[v[i]]=1;\\n\\n\\treturn ret;\\n}\\n\\nint main()\\n{\\n\\tint N;\\n\\twhile(cin >> N, N)\\n\\t{\\n\\t\\tgraph g(N), rg(N), c(N), rc(N);\\n\\n\\t\\tint dcnt=0;\\n\\t\\tmap<string, int> dic;\\n\\t\\tfor(int i=0; i<N; i++)\\n\\t\\t{\\n\\t\\t\\tstring s,t;\\n\\t\\t\\tint a,b,u,v;\\n\\t\\t\\tcin >> s >> a >> t >> b;\\n\\n\\t\\t\\tif(!dic.count(s)) dic[s]=dcnt++;\\n\\t\\t\\tif(!dic.count(t)) dic[t]=dcnt++;\\n\\t\\t\\t\\n\\t\\t\\tu=dic[s];\\n\\t\\t\\tv=dic[t];\\n\\n\\t\\t\\t g[u].push_back(v);\\n\\t\\t\\trg[v].push_back(u);\\n\\t\\t\\t c[u].push_back(b);\\n\\t\\t\\trc[v].push_back(b);\\n\\n\\t\\t\\tself[u]=a;\\n\\t\\t\\trecipe[u]=v;\\n\\t\\t\\treduce[u]=b;\\n\\t\\t}\\n\\n\\t\\tvector<int> in(N, -1);\\n\\t\\tint gcnt=SCC(in,N,rg,g);\\n\\n\\t\\tvector<vector<int> > loop(gcnt);\\n\\t\\tfor(int i=0; i<N; i++)\\n\\t\\t\\tloop[in[i]].push_back(i);\\n\\n\\t\\tvector<bool> created(N, 0);\\n\\n\\t\\tint ans=0;\\n\\t\\tfor(int i=0; i<gcnt; i++)\\n\\t\\t{\\n\\t\\t\\tans+=calc(loop[i], created, rg, rc);\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"%d\\\\n\\\", ans);\\n\\t}\\n}\\n\\n/*\\n4\\ngu 20 pa 10\\nci 20 gu 10\\npa 20 ci 10\\nhoge 20 pa 10\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 1188,\n \"score_of_the_acc\": -0.5336,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2033_225815\",\n \"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\\nint n;\\nvector<int> v[1000];\\nmap<string, int> id;\\nstring s[1000], t[1000];\\nint d1[1000], d2[1000];\\n\\nbool visited[1000];\\nint rec(int now) {\\n if (visited[now]) return 0;\\n visited[now] = 1;\\n int res = 0;\\n FOR(it, v[now]) {\\n if (visited[*it]) continue;\\n res += d1[*it]-d2[*it];\\n res += rec(*it);\\n }\\n return res;\\n}\\n\\nint dfs(int now) {\\n if (visited[now]) return 0;\\n visited[now] = 1;\\n int res = 0;\\n FOR(it, v[now]) {\\n if (visited[*it]) continue;\\n res += d2[*it];\\n res += dfs(*it);\\n }\\n return res;\\n \\n}\\n\\nint main() {\\n while(cin >> n, n) {\\n id.clear();\\n REP(i,n) {\\n cin >> s[i] >> d1[i] >> t[i] >> d2[i];\\n id[s[i]] = i;\\n }\\n REP(i,1000)\\n v[i].clear();\\n REP(i, n) {\\n v[id[t[i]]].push_back(i);\\n }\\n typedef pair<int,int> pii;\\n vector<pii> vv;\\n REP(i,n) {\\n memset(visited,0,sizeof(visited));\\n int tmp = rec(i);\\n vv.push_back(pii(tmp, i));\\n }\\n sort(ALL(vv), greater<pii>());\\n memset(visited,0,sizeof(visited));\\n int res = 0;\\n REP(i,n) {\\n int c = vv[i].second;\\n if (!visited[c]) {\\n res += d1[c] + dfs(c);\\n }\\n }\\n cout << res << endl;\\n } \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 1112,\n \"score_of_the_acc\": -0.4204,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2033_225709\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <map>\\n#include <cstring>\\n#include <algorithm>\\nusing namespace std;\\n\\nstruct tool {\\n string name,sh;\\n int ntime,stime;\\n vector<int> edge;\\n tool(string name,string sn,int ntime,int stime)\\n : name(name), sh(sn), ntime(ntime), stime(stime) {edge.clear();}\\n};\\n\\nbool seen[1001];\\n\\nint dfs(vector<tool> &tv,int v) {\\n seen[v] = true;\\n int ret = 0;\\n for(int i=0; i<tv[v].edge.size(); ++i) {\\n if(seen[tv[v].edge[i]]) continue;\\n ret += (tv[tv[v].edge[i]].ntime - tv[tv[v].edge[i]].stime);\\n ret += dfs(tv,tv[v].edge[i]);\\n }\\n return ret;\\n}\\n\\nvoid dfs2(vector<tool> &tv,int v) {\\n seen[v] = true;\\n for(int i=0; i<tv[v].edge.size(); ++i) {\\n if(seen[tv[v].edge[i]]) continue;\\n dfs2(tv,tv[v].edge[i]);\\n }\\n}\\n\\nint main() {\\n int n;\\n string s1,s2;\\n int k1,k2;\\n while(cin>>n, n) {\\n map<string,int> idx;\\n vector<tool> tv;\\n\\n int ans = 0;\\n for(int i=0; i<n; ++i) {\\n cin>>s1>>k1>>s2>>k2;\\n idx[s1] = i;\\n tv.push_back(tool(s1,s2,k1,k2));\\n ans += k1;\\n }\\n\\n for(int i=0; i<n; ++i) {\\n if(idx.find(tv[i].sh) == idx.end()) continue;\\n int id = idx[tv[i].sh];\\n tv[id].edge.push_back(i);\\n }\\n\\n vector<int> p(n,-1);\\n for(int i=0; i<n; ++i) {\\n memset(seen, false, sizeof(seen));\\n p[i] = dfs(tv,i);\\n }\\n\\n vector<pair<int,int> > ppv(n);\\n for(int i=0; i<n; ++i) {\\n ppv.push_back(make_pair(p[i],i));\\n }\\n sort(ppv.begin(), ppv.end());\\n reverse(ppv.begin(), ppv.end());\\n\\n memset(seen, false, sizeof(seen));\\n for(int i=0; i<ppv.size(); ++i) {\\n int v = ppv[i].second;\\n if(seen[v]) continue;\\n ans -= ppv[i].first;\\n dfs2(tv,v);\\n }\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 1124,\n \"score_of_the_acc\": -0.4763,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":1072,"cells":{"group_id":{"kind":"string","value":"aoj_2044_cpp"},"problem_description":{"kind":"string","value":"Problem F:\nLying about Your Age\nYou have moved to a new town. As starting a new life, you have made up your mind to do\none thing: lying about your age. Since no person in this town knows your history, you don’t\nhave to worry about immediate exposure. Also, in order to ease your conscience somewhat,\nyou have decided to claim ages that represent your real ages when interpreted as the base-\nM\nnumbers (2 ≤\nM\n≤ 16). People will misunderstand your age as they interpret the claimed age\nas a decimal number (i.e. of the base 10).\nNeedless to say, you don’t want to have your real age revealed to the people in the future. So\nyou should claim only one age each year, it should contain digits of decimal numbers (i.e. ‘0’\nthrough ‘9’), and it should always be equal to or greater than that of the previous year (when\ninterpreted as decimal).\nHow old can you claim you are, after some years?\nInput\nThe input consists of multiple datasets. Each dataset is a single line that contains three integers\nA\n,\nB\n, and\nC\n, where\nA\nis the present real age (in decimal),\nB\nis the age you presently claim\n(which can be a non-decimal number), and\nC\nis the real age at which you are to find the age\nyou will claim (in decimal). It is guaranteed that 0 ≤\nA\n<\nC\n≤ 200, while\nB\nmay contain up to\neight digits. No digits other than ‘0’ through ‘9’ appear in those numbers.\nThe end of input is indicated by\nA\n=\nB\n=\nC\n= -1, which should not be processed.\nOutput\nFor each dataset, print in a line the minimum age you can claim when you become\nC\nyears old.\nIn case the age you presently claim cannot be interpreted as your real age with the base from 2\nthrough 16, print -1 instead.\nSample Input\n23 18 53\n46 30 47\n-1 -1 -1\nOutput for the Sample Input\n49\n-1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2044_9685683","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int a,b,c;\n while(cin >> a >> b >> c && a!=-1) {\n bool f=0;\n for(int i=2; i<17; i++) {\n int x=0,z=a;\n string s=\"\";\n while(z) {\n s+=(char)(z%i+'0');\n z/=i;\n }\n reverse(s.begin(),s.end());\n bool ff=1;\n for(int j=0; j<s.size(); j++) {\n if(!isdigit(s[j])) ff=0;\n else if(s[i]-'0'>=i) ff=0;\n }\n if(!ff) continue;\n stringstream ss;\n ss << s;\n ss >> x;\n if(x==b) f=1;\n }\n if(!f) {\n cout << -1 << endl;\n continue;\n }\n for(int k=a+1; k<=c; k++) {\n int r=1<<29;\n for(int i=2; i<17; i++) {\n int x=0,z=k;\n string s=\"\";\n while(z) {\n s+=(char)(z%i+'0');\n z/=i;\n }\n reverse(s.begin(),s.end());\n bool ff=1;\n for(int j=0; j<s.size(); j++) {\n if(!isdigit(s[j])) ff=0;\n else if(s[i]-'0'>=i) ff=0;\n }\n if(!ff) continue;\n stringstream ss;\n ss << s;\n ss >> x;\n if(b<=x) r=min(r,x);\n }\n b=r;\n }\n cout << b << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3228,"score_of_the_acc":-1.1282,"final_rank":8},{"submission_id":"aoj_2044_2276280","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n \nint main() {\n int a,b,c;\n while(cin>>a>>b>>c&&a!=-1) {\n bool f=0;\n for(int i=2; i<17; i++) {\n int x=0,z=a;\n string s=\"\";\n while(z) {\n s+=(char)(z%i+'0');\n z/=i;\n }\n reverse(s.begin(),s.end());\n bool ff=1;\n for(int j=0; j<s.size(); j++) {\n if(!isdigit(s[j])) ff=0;\n else if(s[i]-'0'>=i) ff=0;\n }\n if(!ff) continue;\n stringstream ss;\n ss<<s;ss>>x;\n if(x==b) f=1;\n }\n if(!f) {\n cout<<-1<<endl;\n continue;\n }\n for(int k=a+1; k<=c; k++) {\n int r=1<<29;\n for(int i=2; i<17; i++) {\n int x=0,z=k;\n string s=\"\";\n while(z) {\n s+=(char)(z%i+'0');\n z/=i;\n }\n reverse(s.begin(),s.end());\n bool ff=1;\n for(int j=0; j<s.size(); j++) {\n if(!isdigit(s[j])) ff=0;\n else if(s[i]-'0'>=i) ff=0;\n }\n if(!ff) continue;\n stringstream ss;\n ss<<s;ss>>x;\n if(b<=x) r=min(r,x);\n }\n b=r;\n }\n cout<<b<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3152,"score_of_the_acc":-1.1047,"final_rank":7},{"submission_id":"aoj_2044_2276082","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nint m(int a,int k){\n if(!a) return 0;\n string s;\n while(a){\n int tmp=a%k;\n if(tmp>9) return -1;\n s+='0'+tmp;\n a/=k;\n }\n reverse(s.begin(),s.end());\n return stoll(s);\n}\nsigned main(){\n int a,b,c;\n while(cin>>a>>b>>c,~a){\n bool f=1;\n for(int i=2;i<=16;i++) f&=m(a,i)!=b;\n int res=b;\n for(int j=a;j<=c;j++){\n int tmp=-1;\n for(int i=2;i<=16;i++)\n\tif(m(j,i)>=res)\n\t if(tmp<0||m(j,i)<tmp) tmp=m(j,i);\n if(tmp<0){\n\tf=1;\n\tbreak;\n }\n res=tmp;\n }\n cout<<(f?-1:res)<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3132,"score_of_the_acc":-1.0985,"final_rank":6},{"submission_id":"aoj_2044_1149264","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nchar str[20];\nchar s[20];\nint main(){\n\tint a,b,c;\n\twhile(scanf(\"%d%d%d\",&a,&b,&c),~a){\n\t\tbool ok=false;\n\t\tsprintf(str,\"%d\",b);\n\t\tfor(int i=2;i<17;i++){\n\t\t\tlong long tmp=0;\n\t\t\tfor(int j=0;str[j];j++){\n\t\t\t\ttmp*=i;\n\t\t\t\ttmp+=str[j]-'0';\n\t\t\t}\n\t\t\tbool OK=true;\n\t\t\tfor(int j=0;str[j];j++){\n\t\t\t\tif(str[j]-'0'>=i)OK=false;\n\t\t\t}\n\t\t\tif(tmp==a&&OK)ok=true;\n\t\t}\n\t\tif(!ok){\n\t\t\tprintf(\"-1\\n\");continue;\n\t\t}\n\t\tfor(int i=a+1;i<=c;i++){\n\t\t\tint to=999999999;\n\t\t\tfor(int j=2;j<17;j++){\n\t\t\t\tint tmp=i;\n\t\t\t\tint at=0;\n\t\t\t\twhile(tmp){\n\t\t\t\t\ts[at++]='0'+tmp%j;\n\t\t\t\t\ttmp/=j;\n\t\t\t\t}\n\t\t\t\tok=true;\n\t\t\t\tfor(int k=0;k<at;k++){\n\t\t\t\t\tif(s[k]>'9')ok=false;\n\t\t\t\t\tstr[at-1-k]=s[k];\n\t\t\t\t}\n\t\t\t\tif(ok){\n\t\t\t\t\tstr[at]=0;\n\t\t\t\t\tint val;\n\t\t\t\t\tsscanf(str,\"%d\",&val);\n\t\t\t\t\tif(b<=val)to=min(to,val);\n\t\t\t\t}\n\t\t\t}\n\t\t\tb=to;\n\t\t}\n\t\tprintf(\"%d\\n\",b);\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":1048,"score_of_the_acc":-0.3247,"final_rank":2},{"submission_id":"aoj_2044_1003742","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\nconst int IINF = INT_MAX;\n\nbool converter(int value,int base,string &s){\n string ret = \"\";\n while( value >= base ){\n int tmp = value % base;\n value /= base;\n if( 0 <= tmp && tmp <= 9 ) ret += string(1,(char)('0'+tmp));\n else return false;\n }\n if( value != 0 ) {\n int tmp = value;\n if( 0 <= tmp && tmp <= 9 ) ret += string(1,(char)('0'+tmp));\n else return false;\n }\n if( ret.empty() ) ret = \"0\";\n reverse(ret.begin(),ret.end());\n s = ret;\n return true;\n}\n\nstring itos(int i) { stringstream ss; ss << i; return ss.str(); }\n\nint main(){\n int A,C;\n string B;\n while( cin >> A >> B >> C ){\n if( A == -1 && B == \"-1\" && C == -1 ) break;\n string boarder = B;\n bool failed = false;\n REP(age,A,C+1){\n //cout << age << \" \" << boarder << endl;\n int nebear = IINF;\n REP(base,2,17){\n string tmp = \"\";\n if( !converter(age,base,tmp) ) continue;\n if( age == A && tmp != boarder ) continue;\n else {\n int boar = (atoi)(boarder.c_str());\n int curr = (atoi)(tmp.c_str());\n if( boar > curr ) continue;\n nebear = min(nebear,curr);\n }\n }\n if( nebear == IINF ) failed = true;\n if( failed ) break;\n boarder = itos(nebear);\n }\n if( failed ) puts(\"-1\");\n else cout << boarder << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1244,"score_of_the_acc":-0.4623,"final_rank":5},{"submission_id":"aoj_2044_494316","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\nll int2int(ll src, int base) {\n string res;\n while(src != 0) {\n char c = src%base;\n if (c < 10) c += '0';\n else c += 'a'-10;\n res = string(1,c) + res;\n src /= base;\n }\n FOR(it, res) if (!isdigit(*it)) return -1;\n return atoi(res.c_str());\n}\n\nint main() {\n ll A,B,C;\n while(cin>>A>>B>>C,A!=-1) {\n bool f = 0;\n for (int i=2; i<=16; ++i) {\n if (B == int2int(A,i)) {\n f = 1;\n break;\n }\n }\n if (!f) {\n puts(\"-1\");\n continue;\n }\n for (int i=A+1; i<=C; ++i) {\n ll next = -1;\n for (int j=2; j<=16; ++j) {\n ll k = int2int(i,j);\n if (k >= B) {\n if (next == -1 || next > k) {\n next = k;\n }\n }\n }\n B = next;\n }\n cout << B << endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":1216,"score_of_the_acc":-0.428,"final_rank":3},{"submission_id":"aoj_2044_492344","code_snippet":"//41\n#include<iostream>\n#include<cctype>\n#include<string>\n#include<cstdlib>\n\nusing namespace std;\n\nstring itos(int i,int b){\n if(i){\n string s;\n while(i){\n int d=i%b;\n s+=(d<10)?'0'+d:'a'+d-10;\n i/=b;\n }\n return string(s.rbegin(),s.rend());\n }else{\n return \"0\";\n }\n} \n\nint main(){\n int a,c;\n string b;\n while(cin>>a>>b>>c,a!=-1){\n int i;\n for(i=16;i>=2;i--){\n if(itos(a,i)==b)break;\n }\n if(i<2){\n cout<<-1<<endl;\n }else{\n for(;a<=c;a++){\n\tfor(int i=16;i>=2;i--){\n\t string s=itos(a,i);\n\t int j;\n\t for(j=0;j<s.size();j++){\n\t if(isalpha(s[j]))break;\n\t }\n\t if(j==s.size()&&atoi(b.c_str())<=atoi(s.c_str())){\n\t b=s;\n\t break;\n\t }\n\t}\n }\n cout<<b<<endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1228,"score_of_the_acc":-0.4317,"final_rank":4},{"submission_id":"aoj_2044_428729","code_snippet":"#include <iostream>\n\nusing namespace std;\ntypedef long long ll;\nconst ll INF = 0x7fffffffffffffffll;\n\nll radix_convert(ll x, int base){\n\tll a = x, b = 0, c = 1;\n\twhile(a > 0){\n\t\tif(a % base >= 10){ return -1; }\n\t\tb = b + a % base * c;\n\t\ta /= base;\n\t\tc *= 10;\n\t}\n\treturn b;\n}\n\nint main(){\n\twhile(true){\n\t\tll a, b, c;\n\t\tcin >> a >> b >> c;\n\t\tif(a < 0 && b < 0 && c < 0){ break; }\n\t\tbool accept = false;\n\t\tfor(int base = 2; base <= 16; ++base){\n\t\t\tif(radix_convert(a, base) == b){ accept = true; break; }\n\t\t}\n\t\tif(!accept){\n\t\t\tcout << -1 << endl;\n\t\t\tcontinue;\n\t\t}\n\t\tfor(++a; a <= c; ++a){\n\t\t\tll d = INF;\n\t\t\tfor(int base = 2; base <= 16; ++base){\n\t\t\t\tll e = a, f = 0, g = 1;\n\t\t\t\twhile(e > 0){\n\t\t\t\t\tif(e % base >= 10){ break; }\n\t\t\t\t\tf = f + e % base * g;\n\t\t\t\t\te /= base;\n\t\t\t\t\tg *= 10;\n\t\t\t\t}\n\t\t\t\tif(e == 0 && f >= b){\n\t\t\t\t\td = min(d, f);\n\t\t\t\t}\n\t\t\t}\n\t\t\tb = d;\n\t\t\tif(b == INF){ break; }\n\t\t}\n\t\tcout << b << endl;\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_2044_391644","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <set>\n#include <string>\n#include <sstream>\n#include <cstdlib>\n\nusing namespace std;\n\ntypedef long long ll;\nconst ll INF=(1LL<<50);\n\nll DecToBaseNum(ll num,int base){\n string s;\n ll res=0;\n while(num){\n stringstream ss;\n ss<<(num%base);\n if(num%base>9)return -1;\n s=ss.str()+s;\n num/=base;\n }\n for(int i=0;i<s.size();i++)res=res*10+(s[i]-'0');\n return res;\n}\n\nll A,B,C;\nint main(){\n while(cin>>A>>B>>C&&!(A==-1&&B==-1&&C==-1)){\n bool ok=false;\n for(int i=2;i<=16;i++){\n ll a=DecToBaseNum(A,i);\n if(a==B){\n\tok=true;\n\tbreak;\n }\n }\n if(!ok)cout<<-1<<endl;\n else{\n ll cur=B;\n ok=true;\n for(int i=A+1;i<=C;i++){\n\tll nxt=INF;\n\tfor(int j=2;j<=16;j++){\n\t ll a=DecToBaseNum(i,j);\n\t if(a>=cur&&nxt>a)nxt=a;\n\t}\n\tif(nxt==INF){\n\t ok=false;\n\t break;\n\t}\n\tcur=nxt;\n }\n if(!ok)cout<<-1<<endl;\n else cout<<cur<<endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":400,"memory_kb":944,"score_of_the_acc":-1.2924,"final_rank":9}],"string":"[\n {\n \"submission_id\": \"aoj_2044_9685683\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n int a,b,c;\\n while(cin >> a >> b >> c && a!=-1) {\\n bool f=0;\\n for(int i=2; i<17; i++) {\\n int x=0,z=a;\\n string s=\\\"\\\";\\n while(z) {\\n s+=(char)(z%i+'0');\\n z/=i;\\n }\\n reverse(s.begin(),s.end());\\n bool ff=1;\\n for(int j=0; j<s.size(); j++) {\\n if(!isdigit(s[j])) ff=0;\\n else if(s[i]-'0'>=i) ff=0;\\n }\\n if(!ff) continue;\\n stringstream ss;\\n ss << s;\\n ss >> x;\\n if(x==b) f=1;\\n }\\n if(!f) {\\n cout << -1 << endl;\\n continue;\\n }\\n for(int k=a+1; k<=c; k++) {\\n int r=1<<29;\\n for(int i=2; i<17; i++) {\\n int x=0,z=k;\\n string s=\\\"\\\";\\n while(z) {\\n s+=(char)(z%i+'0');\\n z/=i;\\n }\\n reverse(s.begin(),s.end());\\n bool ff=1;\\n for(int j=0; j<s.size(); j++) {\\n if(!isdigit(s[j])) ff=0;\\n else if(s[i]-'0'>=i) ff=0;\\n }\\n if(!ff) continue;\\n stringstream ss;\\n ss << s;\\n ss >> x;\\n if(b<=x) r=min(r,x);\\n }\\n b=r;\\n }\\n cout << b << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3228,\n \"score_of_the_acc\": -1.1282,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2044_2276280\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n \\nint main() {\\n int a,b,c;\\n while(cin>>a>>b>>c&&a!=-1) {\\n bool f=0;\\n for(int i=2; i<17; i++) {\\n int x=0,z=a;\\n string s=\\\"\\\";\\n while(z) {\\n s+=(char)(z%i+'0');\\n z/=i;\\n }\\n reverse(s.begin(),s.end());\\n bool ff=1;\\n for(int j=0; j<s.size(); j++) {\\n if(!isdigit(s[j])) ff=0;\\n else if(s[i]-'0'>=i) ff=0;\\n }\\n if(!ff) continue;\\n stringstream ss;\\n ss<<s;ss>>x;\\n if(x==b) f=1;\\n }\\n if(!f) {\\n cout<<-1<<endl;\\n continue;\\n }\\n for(int k=a+1; k<=c; k++) {\\n int r=1<<29;\\n for(int i=2; i<17; i++) {\\n int x=0,z=k;\\n string s=\\\"\\\";\\n while(z) {\\n s+=(char)(z%i+'0');\\n z/=i;\\n }\\n reverse(s.begin(),s.end());\\n bool ff=1;\\n for(int j=0; j<s.size(); j++) {\\n if(!isdigit(s[j])) ff=0;\\n else if(s[i]-'0'>=i) ff=0;\\n }\\n if(!ff) continue;\\n stringstream ss;\\n ss<<s;ss>>x;\\n if(b<=x) r=min(r,x);\\n }\\n b=r;\\n }\\n cout<<b<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3152,\n \"score_of_the_acc\": -1.1047,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2044_2276082\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\nint m(int a,int k){\\n if(!a) return 0;\\n string s;\\n while(a){\\n int tmp=a%k;\\n if(tmp>9) return -1;\\n s+='0'+tmp;\\n a/=k;\\n }\\n reverse(s.begin(),s.end());\\n return stoll(s);\\n}\\nsigned main(){\\n int a,b,c;\\n while(cin>>a>>b>>c,~a){\\n bool f=1;\\n for(int i=2;i<=16;i++) f&=m(a,i)!=b;\\n int res=b;\\n for(int j=a;j<=c;j++){\\n int tmp=-1;\\n for(int i=2;i<=16;i++)\\n\\tif(m(j,i)>=res)\\n\\t if(tmp<0||m(j,i)<tmp) tmp=m(j,i);\\n if(tmp<0){\\n\\tf=1;\\n\\tbreak;\\n }\\n res=tmp;\\n }\\n cout<<(f?-1:res)<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3132,\n \"score_of_the_acc\": -1.0985,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2044_1149264\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nchar str[20];\\nchar s[20];\\nint main(){\\n\\tint a,b,c;\\n\\twhile(scanf(\\\"%d%d%d\\\",&a,&b,&c),~a){\\n\\t\\tbool ok=false;\\n\\t\\tsprintf(str,\\\"%d\\\",b);\\n\\t\\tfor(int i=2;i<17;i++){\\n\\t\\t\\tlong long tmp=0;\\n\\t\\t\\tfor(int j=0;str[j];j++){\\n\\t\\t\\t\\ttmp*=i;\\n\\t\\t\\t\\ttmp+=str[j]-'0';\\n\\t\\t\\t}\\n\\t\\t\\tbool OK=true;\\n\\t\\t\\tfor(int j=0;str[j];j++){\\n\\t\\t\\t\\tif(str[j]-'0'>=i)OK=false;\\n\\t\\t\\t}\\n\\t\\t\\tif(tmp==a&&OK)ok=true;\\n\\t\\t}\\n\\t\\tif(!ok){\\n\\t\\t\\tprintf(\\\"-1\\\\n\\\");continue;\\n\\t\\t}\\n\\t\\tfor(int i=a+1;i<=c;i++){\\n\\t\\t\\tint to=999999999;\\n\\t\\t\\tfor(int j=2;j<17;j++){\\n\\t\\t\\t\\tint tmp=i;\\n\\t\\t\\t\\tint at=0;\\n\\t\\t\\t\\twhile(tmp){\\n\\t\\t\\t\\t\\ts[at++]='0'+tmp%j;\\n\\t\\t\\t\\t\\ttmp/=j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tok=true;\\n\\t\\t\\t\\tfor(int k=0;k<at;k++){\\n\\t\\t\\t\\t\\tif(s[k]>'9')ok=false;\\n\\t\\t\\t\\t\\tstr[at-1-k]=s[k];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(ok){\\n\\t\\t\\t\\t\\tstr[at]=0;\\n\\t\\t\\t\\t\\tint val;\\n\\t\\t\\t\\t\\tsscanf(str,\\\"%d\\\",&val);\\n\\t\\t\\t\\t\\tif(b<=val)to=min(to,val);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tb=to;\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\",b);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1048,\n \"score_of_the_acc\": -0.3247,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2044_1003742\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nusing namespace std;\\n\\nconst int IINF = INT_MAX;\\n\\nbool converter(int value,int base,string &s){\\n string ret = \\\"\\\";\\n while( value >= base ){\\n int tmp = value % base;\\n value /= base;\\n if( 0 <= tmp && tmp <= 9 ) ret += string(1,(char)('0'+tmp));\\n else return false;\\n }\\n if( value != 0 ) {\\n int tmp = value;\\n if( 0 <= tmp && tmp <= 9 ) ret += string(1,(char)('0'+tmp));\\n else return false;\\n }\\n if( ret.empty() ) ret = \\\"0\\\";\\n reverse(ret.begin(),ret.end());\\n s = ret;\\n return true;\\n}\\n\\nstring itos(int i) { stringstream ss; ss << i; return ss.str(); }\\n\\nint main(){\\n int A,C;\\n string B;\\n while( cin >> A >> B >> C ){\\n if( A == -1 && B == \\\"-1\\\" && C == -1 ) break;\\n string boarder = B;\\n bool failed = false;\\n REP(age,A,C+1){\\n //cout << age << \\\" \\\" << boarder << endl;\\n int nebear = IINF;\\n REP(base,2,17){\\n string tmp = \\\"\\\";\\n if( !converter(age,base,tmp) ) continue;\\n if( age == A && tmp != boarder ) continue;\\n else {\\n int boar = (atoi)(boarder.c_str());\\n int curr = (atoi)(tmp.c_str());\\n if( boar > curr ) continue;\\n nebear = min(nebear,curr);\\n }\\n }\\n if( nebear == IINF ) failed = true;\\n if( failed ) break;\\n boarder = itos(nebear);\\n }\\n if( failed ) puts(\\\"-1\\\");\\n else cout << boarder << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1244,\n \"score_of_the_acc\": -0.4623,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2044_494316\",\n \"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\\nll int2int(ll src, int base) {\\n string res;\\n while(src != 0) {\\n char c = src%base;\\n if (c < 10) c += '0';\\n else c += 'a'-10;\\n res = string(1,c) + res;\\n src /= base;\\n }\\n FOR(it, res) if (!isdigit(*it)) return -1;\\n return atoi(res.c_str());\\n}\\n\\nint main() {\\n ll A,B,C;\\n while(cin>>A>>B>>C,A!=-1) {\\n bool f = 0;\\n for (int i=2; i<=16; ++i) {\\n if (B == int2int(A,i)) {\\n f = 1;\\n break;\\n }\\n }\\n if (!f) {\\n puts(\\\"-1\\\");\\n continue;\\n }\\n for (int i=A+1; i<=C; ++i) {\\n ll next = -1;\\n for (int j=2; j<=16; ++j) {\\n ll k = int2int(i,j);\\n if (k >= B) {\\n if (next == -1 || next > k) {\\n next = k;\\n }\\n }\\n }\\n B = next;\\n }\\n cout << B << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1216,\n \"score_of_the_acc\": -0.428,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2044_492344\",\n \"code_snippet\": \"//41\\n#include<iostream>\\n#include<cctype>\\n#include<string>\\n#include<cstdlib>\\n\\nusing namespace std;\\n\\nstring itos(int i,int b){\\n if(i){\\n string s;\\n while(i){\\n int d=i%b;\\n s+=(d<10)?'0'+d:'a'+d-10;\\n i/=b;\\n }\\n return string(s.rbegin(),s.rend());\\n }else{\\n return \\\"0\\\";\\n }\\n} \\n\\nint main(){\\n int a,c;\\n string b;\\n while(cin>>a>>b>>c,a!=-1){\\n int i;\\n for(i=16;i>=2;i--){\\n if(itos(a,i)==b)break;\\n }\\n if(i<2){\\n cout<<-1<<endl;\\n }else{\\n for(;a<=c;a++){\\n\\tfor(int i=16;i>=2;i--){\\n\\t string s=itos(a,i);\\n\\t int j;\\n\\t for(j=0;j<s.size();j++){\\n\\t if(isalpha(s[j]))break;\\n\\t }\\n\\t if(j==s.size()&&atoi(b.c_str())<=atoi(s.c_str())){\\n\\t b=s;\\n\\t break;\\n\\t }\\n\\t}\\n }\\n cout<<b<<endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1228,\n \"score_of_the_acc\": -0.4317,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2044_428729\",\n \"code_snippet\": \"#include <iostream>\\n\\nusing namespace std;\\ntypedef long long ll;\\nconst ll INF = 0x7fffffffffffffffll;\\n\\nll radix_convert(ll x, int base){\\n\\tll a = x, b = 0, c = 1;\\n\\twhile(a > 0){\\n\\t\\tif(a % base >= 10){ return -1; }\\n\\t\\tb = b + a % base * c;\\n\\t\\ta /= base;\\n\\t\\tc *= 10;\\n\\t}\\n\\treturn b;\\n}\\n\\nint main(){\\n\\twhile(true){\\n\\t\\tll a, b, c;\\n\\t\\tcin >> a >> b >> c;\\n\\t\\tif(a < 0 && b < 0 && c < 0){ break; }\\n\\t\\tbool accept = false;\\n\\t\\tfor(int base = 2; base <= 16; ++base){\\n\\t\\t\\tif(radix_convert(a, base) == b){ accept = true; break; }\\n\\t\\t}\\n\\t\\tif(!accept){\\n\\t\\t\\tcout << -1 << endl;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tfor(++a; a <= c; ++a){\\n\\t\\t\\tll d = INF;\\n\\t\\t\\tfor(int base = 2; base <= 16; ++base){\\n\\t\\t\\t\\tll e = a, f = 0, g = 1;\\n\\t\\t\\t\\twhile(e > 0){\\n\\t\\t\\t\\t\\tif(e % base >= 10){ break; }\\n\\t\\t\\t\\t\\tf = f + e % base * g;\\n\\t\\t\\t\\t\\te /= base;\\n\\t\\t\\t\\t\\tg *= 10;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(e == 0 && f >= b){\\n\\t\\t\\t\\t\\td = min(d, f);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tb = d;\\n\\t\\t\\tif(b == INF){ break; }\\n\\t\\t}\\n\\t\\tcout << b << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2044_391644\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <set>\\n#include <string>\\n#include <sstream>\\n#include <cstdlib>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\nconst ll INF=(1LL<<50);\\n\\nll DecToBaseNum(ll num,int base){\\n string s;\\n ll res=0;\\n while(num){\\n stringstream ss;\\n ss<<(num%base);\\n if(num%base>9)return -1;\\n s=ss.str()+s;\\n num/=base;\\n }\\n for(int i=0;i<s.size();i++)res=res*10+(s[i]-'0');\\n return res;\\n}\\n\\nll A,B,C;\\nint main(){\\n while(cin>>A>>B>>C&&!(A==-1&&B==-1&&C==-1)){\\n bool ok=false;\\n for(int i=2;i<=16;i++){\\n ll a=DecToBaseNum(A,i);\\n if(a==B){\\n\\tok=true;\\n\\tbreak;\\n }\\n }\\n if(!ok)cout<<-1<<endl;\\n else{\\n ll cur=B;\\n ok=true;\\n for(int i=A+1;i<=C;i++){\\n\\tll nxt=INF;\\n\\tfor(int j=2;j<=16;j++){\\n\\t ll a=DecToBaseNum(i,j);\\n\\t if(a>=cur&&nxt>a)nxt=a;\\n\\t}\\n\\tif(nxt==INF){\\n\\t ok=false;\\n\\t break;\\n\\t}\\n\\tcur=nxt;\\n }\\n if(!ok)cout<<-1<<endl;\\n else cout<<cur<<endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 944,\n \"score_of_the_acc\": -1.2924,\n \"final_rank\": 9\n }\n]","isConversational":false}}},{"rowIdx":1073,"cells":{"group_id":{"kind":"string","value":"aoj_2042_cpp"},"problem_description":{"kind":"string","value":"Problem D:\nSo Sleepy\nYou have an appointment to meet a friend of yours today, but you are so sleepy because you\ndidn’t sleep well last night.\nAs you will go by trains to the station for the rendezvous, you can have a sleep on a train. You\ncan start to sleep as soon as you get on a train and keep asleep just until you get off. However,\nbecause of your habitude, you can sleep only on one train on your way to the destination.\nGiven the time schedule of trains as well as your departure time and your appointed time, your\ntask is to write a program which outputs the longest possible time duration of your sleep in a\ntrain, under the condition that you can reach the destination by the appointed time.\nInput\nThe input consists of multiple datasets. Each dataset looks like below:\nS T\nD Time\nD\nA Time\nA\nN\n1\nK\n1,1\nTime\n1,1\n...\nK\n1,\nN\n1\nTime\n1,\nN\n1\nN\n2\nK\n2,1\nTime\n2,1\n...\nK\n2,\nN\n2\nTime\n2,\nN\n2\n...\nN\nT\nK\nT\n,1\nTime\nT\n,1\n...\nK\nT\n,\nN\nT\nTime\nT\n,\nN\nT\nThe first line of each dataset contains S (1 ≤ S ≤ 1000) and\nT\n(0 ≤\nT\n≤ 100), which denote\nthe numbers of stations and trains respectively. The second line contains the departure station\n(\nD\n), the departure time (\nTime\nD\n), the appointed station (\nA\n), and the appointed time (\nTime\nA\n), in this order. Then\nT\nsets of time schedule for trains follow. On the first line of the\ni\n-th set,\nthere will be\nN\ni\nwhich indicates the number of stations the\ni\n-th train stops at. Then\nN\ni\nlines\nfollow, each of which contains the station identifier (\nK\ni,j\n) followed by the time when the train\nstops at (i.e. arrives at and/or departs from) that station (\nTime\ni,j\n).\nEach station has a unique identifier, which is an integer between 1 and\nS\n. Each time is given\nin the format\nhh\n:\nmm\n, where\nhh\nrepresents the two-digit hour ranging from “00” to “23”, and\nmm\nrepresents the two-digit minute from “00” to “59”.\nThe input is terminated by a line that contains two zeros.\nYou may assume the following:\neach train stops at two stations or more;\neach train never stops at the same station more than once;\na train takes at least one minute from one station to the next;\nall the times that appear in each dataset are those of the same day; and\nas being an expert in transfer, you can catch other trains that depart at the time just you\n arrive the station.\nOutput\nFor each dataset, your program must output the maximum time in minutes you can sleep if you\ncan reach to the destination station in time, or “impossible” (without the quotes) otherwise.\nSample Input\n3 1\n1 09:00 3 10:00\n3\n1 09:10\n2 09:30\n3 09:40\n3 2\n1 09:00 1 10:00\n3\n1 09:10\n2 09:30\n3 09:40\n3\n3 09:20\n2 09:30\n1 10:00\n1 0\n1 09:00 1 10:00\n1 0\n1 10:00 1 09:00\n3 1\n1 09:00 3 09:35\n3\n1 09:10\n2 09:30\n3 09:40\n4 3\n1 09:00 4 11:00\n3\n1 09:10\n2 09:20\n4 09:40\n3\n1 10:30\n3 10:40\n4 10:50\n4\n1 08:50\n2 09:30\n3 10:30\n4 11:10\n0 0\nOutput for the Sample Input\n30\n30\n0\nimpossible\nimpossible\n60"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2042_10850499","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <vector>\n\nusing namespace std;\n\nint dp[1000][24 * 60][2];\nint n, m, dest, destTime;\n\nvector<pair<int, int>> lines[100], stationInfo[1000][24 * 60]; // time, station / line index\n\nint getAns(int station, int time, bool slept) {\n\tif(time > destTime) return -2;\n\n\tint &ret = dp[station][time][slept];\n\tif(ret != -1) return ret;\n\n\tret = -2;\n\tif(station == dest) ret = 0;\n\tret = max(ret, getAns(station, time + 1, slept));\n\tfor(auto &info: stationInfo[station][time]) {\n\t\tint nextLine = info.first;\n\t\tint stIndex = info.second;\n\t\tif(stIndex + 1 < lines[nextLine].size())\n\t\t\tret = max(ret, getAns(lines[nextLine][stIndex + 1].second, lines[nextLine][stIndex + 1].first, slept));\n\t\tif(!slept)\n\t\t\tfor(int ind = stIndex + 1; ind < lines[nextLine].size(); ind++) {\n\t\t\t\tint res = getAns(lines[nextLine][ind].second, lines[nextLine][ind].first, true);\n\t\t\t\tif(res >= 0)\n\t\t\t\t\tret = max(ret, res + lines[nextLine][ind].first - lines[nextLine][stIndex].first);\n\t\t\t}\n\t}\n\n\treturn ret;\n}\n\nint main(void) {\n\twhile(scanf(\"%d %d\", &n, &m), n > 0) {\n\t\tfor(int i = 0; i < m; i++) lines[i].clear();\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < 24 * 60; j++)\n\t\t\t\tstationInfo[i][j].clear();\n\n\t\tint start, startTime, temp[2];\n\t\tscanf(\"%d %d:%d\", &start, temp, temp + 1);\n\t\tstartTime = temp[0] * 60 + temp[1];\n\t\tscanf(\"%d %d:%d\", &dest, temp, temp + 1);\n\t\tdestTime = temp[0] * 60 + temp[1];\n\t\tstart--, dest--;\n\n\t\tfor(int i = 0; i < m; i++) {\n\t\t\tint visitn;\n\t\t\tscanf(\"%d\", &visitn);\n\t\t\tfor(int j = 0; j < visitn; j++) {\n\t\t\t\tint station;\n\t\t\t\tscanf(\"%d %d:%d\", &station, temp, temp + 1);\n\t\t\t\tlines[i].push_back(make_pair(temp[0] * 60 + temp[1], station - 1));\n\t\t\t\tstationInfo[station - 1][temp[0] * 60 + temp[1]].push_back(make_pair(i, j));\n\t\t\t}\n\t\t}\n\n\t\tmemset(dp, -1, sizeof(dp));\n\t\tint res = getAns(start, startTime, false);\n\t\tif(res == -2) printf(\"impossible\\n\");\n\t\telse printf(\"%d\\n\", res);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":240,"memory_kb":55888,"score_of_the_acc":-0.891,"final_rank":7},{"submission_id":"aoj_2042_3239975","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 1440\n\nstruct Info{\n\tInfo(int arg_station_id,int arg_stop_time){\n\t\tstation_id = arg_station_id;\n\t\tstop_time = arg_stop_time;\n\t}\n\tbool operator<(const struct Info &arg) const{\n\t\treturn stop_time < arg.stop_time;\n\t}\n\tint station_id,stop_time;\n};\n\nstruct Data{\n\tData(int arg_train_id,int arg_stop_index){\n\t\ttrain_id = arg_train_id;\n\t\tstop_index = arg_stop_index;\n\t}\n\tint train_id,stop_index;\n};\n\nint start,start_time;\nint goal,goal_time;\nint num_station,num_train;\nint dp[1005][NUM];\nvector<Info> TRAIN[105];\nvector<Data> STATION[1005][NUM];\n\nint getTime(char buf[6]){\n\n\tint hour = 10*(buf[0]-'0')+(buf[1]-'0');\n\tint minute = 10*(buf[3]-'0')+(buf[4]-'0');\n\n\treturn 60*hour+minute;\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < num_station; i++){\n\t\tfor(int k = 0; k < NUM; k++){\n\n\t\t\tSTATION[i][k].clear();\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_train; i++){\n\n\t\tTRAIN[i].clear();\n\t}\n\n\tchar buf[6];\n\n\tscanf(\"%d %s\",&start,buf);\n\tstart--;\n\tstart_time = getTime(buf);\n\n\tscanf(\"%d %s\",&goal,buf);\n\tgoal--;\n\tgoal_time = getTime(buf);\n\n\tint num_stop;\n\tint station_id,stop_time;\n\n\tfor(int i = 0; i < num_train; i++){\n\n\t\tscanf(\"%d\",&num_stop);\n\n\t\tfor(int k = 0; k < num_stop; k++){\n\n\t\t\tscanf(\"%d %s\",&station_id,buf);\n\t\t\tstation_id--;\n\t\t\tstop_time = getTime(buf);\n\n\t\t\tTRAIN[i].push_back(Info(station_id,stop_time));\n\t\t}\n\t\tsort(TRAIN[i].begin(),TRAIN[i].end());\n\t}\n\n\tif(start_time > goal_time){\n\n\t\tprintf(\"impossible\\n\");\n\t\treturn;\n\t}\n\n\tfor(int i = 0; i < num_train; i++){\n\t\tfor(int k = 0; k < TRAIN[i].size(); k++){\n\n\t\t\tSTATION[TRAIN[i][k].station_id][TRAIN[i][k].stop_time].push_back(Data(i,k));\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_station; i++){\n\t\tfor(int k = start_time; k <= goal_time; k++){\n\n\t\t\tdp[i][k] = -1;\n\t\t}\n\t}\n\n\tdp[start][start_time] = 0;\n\n\tint train_id,stop_index;\n\n\tfor(int k = start_time; k < goal_time; k++){\n\t\tfor(int i = 0; i < num_station; i++){\n\n\t\t\tif(dp[i][k] == -1)continue;\n\t\t\tdp[i][k+1] = max(dp[i][k+1],dp[i][k]);\n\n\t\t\tfor(int a = 0; a < STATION[i][k].size(); a++){\n\n\t\t\t\ttrain_id = STATION[i][k][a].train_id;\n\t\t\t\tstop_index = STATION[i][k][a].stop_index;\n\n\t\t\t\tfor(int b = stop_index+1; b < TRAIN[train_id].size(); b++){\n\n\t\t\t\t\tif(TRAIN[train_id][b].stop_time > goal_time)break;\n\n\t\t\t\t\tstation_id = TRAIN[train_id][b].station_id;\n\t\t\t\t\tstop_time = TRAIN[train_id][b].stop_time;\n\n\t\t\t\t\tdp[station_id][stop_time] = max(dp[station_id][stop_time],max(dp[i][k],stop_time-k));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = -1;\n\n\tfor(int i = start_time; i <= goal_time; i++){\n\n\t\tans = max(ans,dp[goal][i]);\n\t}\n\n\tif(ans == -1){\n\n\t\tprintf(\"impossible\\n\");\n\n\t}else{\n\n\t\tprintf(\"%d\\n\",ans);\n\t}\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d %d\",&num_station,&num_train);\n\t\tif(num_station == 0 && num_train == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":350,"memory_kb":50052,"score_of_the_acc":-0.8425,"final_rank":6},{"submission_id":"aoj_2042_2285742","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint N,M,S,T;\nint st, ed;\n\nunordered_map<int,vector<int>> R;\nunordered_map<int,vector<int>> tr;\n\nint ghs(int a,int b){\n return a * 24*60 + b;\n}\n\nint gettime(int t1,int t2){\n return t1*60 + t2;\n}\n\nconst int INF = (1<<29);\ntypedef pair<int,int> P;\nP dp[60*24+1][1101];\nvoid update(P &a, P b){\n if( a.first < b.first ) a.first = b.first;\n if( a.second < b.second ) a.second = b.second;\n if( a.first < a.second ) a.first = a.second;\n}\nint solve(){\n fill( dp[0], dp[ed+1], P(-INF,-INF) );\n dp[st][S+M] = P(0,0); \n for(int t=st;t<=ed;t++){\n for(int i=0;i<N+M;i++){\n int id = i%(N+M);\n if( dp[t][id].first == -INF ) continue; \n if( id < M ) { // train\n if( R.count( ghs(id,t) ) )\n for( int nid : R[ghs(id,t)] )\n update( dp[t][nid+M], P(dp[t][id].first,0) );\n update( dp[t+1][id], P(dp[t][id].first,dp[t][id].second+1) );\n } else { //station\n int x = id-M;\n if( tr.count( ghs(x,t) ) )\n for( int nid : tr[ghs(x,t)] )\n update( dp[t+1][nid], P(dp[t][id].first,1) );\n update( dp[t+1][id], P(dp[t][id].first,0) ); \n }\n }\n }\n return dp[ed][T+M].first;\n}\n\n\nint main(){\n while( ~scanf(\"%d%d\",&N,&M) && (N|M) ) {\n int t1,t2,t3,t4;\n scanf(\"%d %d:%d %d %d:%d\",&S, &t1, &t2, &T, &t3, &t4);\n --S; --T;\n st = gettime( t1, t2 ), ed = gettime( t3, t4 );\n \n for(int i=0;i<M;i++){\n int n; scanf(\"%d\",&n); \n for(int j=0;j<n;j++){\n int k;\n scanf(\"%d %d:%d\",&k,&t1,&t2);\n --k; \n R[ghs(i,gettime(t1,t2))].emplace_back(k);\n tr[ghs(k,gettime(t1,t2))].emplace_back(i);\n //cout << i << \" \"<< gettime(t1,t2) << \" \" << R[i][gettime(t1,t2)] << endl;\n // cout << k << \" \"<< gettime(t1,t2) << \" \" << tr[k][gettime(t1,t2)] << endl;\n } \n }\n\n int res = solve();\n if( res < 0 ) printf(\"impossible\\n\");\n else printf(\"%d\\n\",res);\n tr.clear();\n R.clear();\n }\n}","accuracy":1,"time_ms":470,"memory_kb":30312,"score_of_the_acc":-0.5545,"final_rank":4},{"submission_id":"aoj_2042_1126479","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\nconst char EMPTY = 'X';\n \nstruct Node{\n short value;\n char lazy;\n short lazy_coef; \n Node(short value=0,char lazy=EMPTY,short lazy_coef=0):value(value),lazy(lazy),lazy_coef(lazy_coef){}\n};\n \nclass SegTree{\npublic:\n vector<Node> RMQ;\n int limit,N; // N は要素数\n \n void init(int tmp){\n N = tmp;\n int N_N = 1;\n while(N_N < N)N_N *= 2;\n limit = N_N;\n RMQ.clear();\n RMQ.resize(2.3*limit);\n rep(i,2.3*limit-1) RMQ[i] = Node();\n }\n\n short _build(int cur,int L,int R){\n if( !( 0 <= cur && cur < 2*limit-1 ) ) return 0;\n if( L == R-1 ){\n if( L >= N ) return 0;\n RMQ[cur] = 0; // RMQ の各要素を０で初期化、 1 なら RMQ[cur] = 1などなど...\n } else {\n short vl = _build(cur*2+1,L,(L+R)/2);\n short vr = _build(cur*2+2,(L+R)/2,R);\n RMQ[cur].value = vl+vr;\n }\n return RMQ[cur].value;\n }\n\n void build() { _build(0,0,limit); }\n\n inline void value_evaluate(int index,int L,int R){\n if( RMQ[index].lazy == 'A' ){\n RMQ[index].value += ( R - L ) * RMQ[index].lazy_coef;\n } else if( RMQ[index].lazy == 'S' ){\n RMQ[index].value = ( R - L ) * RMQ[index].lazy_coef;\n }\n }\n \n inline void lazy_evaluate(int index,int L,int R){\n value_evaluate(index,L,R);\n if( index < limit && RMQ[index].lazy != EMPTY ) {\n if( RMQ[index].lazy == 'A' ) {\n if( RMQ[index*2+1].lazy == EMPTY ) RMQ[index*2+1].lazy = 'A'; \n if( RMQ[index*2+2].lazy == EMPTY ) RMQ[index*2+2].lazy = 'A';\n RMQ[index*2+1].lazy_coef += RMQ[index].lazy_coef;\n RMQ[index*2+2].lazy_coef += RMQ[index].lazy_coef;\n } else if( RMQ[index].lazy == 'S') {\n RMQ[index*2+1].lazy = RMQ[index*2+2].lazy = 'S';\n RMQ[index*2+1].lazy_coef = RMQ[index].lazy_coef;\n RMQ[index*2+2].lazy_coef = RMQ[index].lazy_coef;\n }\n }\n RMQ[index].lazy = EMPTY;\n RMQ[index].lazy_coef = 0;\n }\n \n inline void value_update(int index){ RMQ[index].value = RMQ[index*2+1].value + RMQ[index*2+2].value; }\n\n void _update(int a,int b,char opr,int v,int index,int L,int R){\n lazy_evaluate(index,L,R);\n if( b <= L || R <= a )return;\n if( a <= L && R <= b ){\n RMQ[index].lazy = opr; // 今いるノードに遅延を設定して処理をしてもらう\n if( opr == 'A' ) RMQ[index].lazy_coef += v; \n else if( opr == 'S' ) RMQ[index].lazy_coef = v; \n lazy_evaluate(index,L,R);\n return;\n }\n _update(a,b,opr,v,index*2+1,L,(L+R)/2);\n _update(a,b,opr,v,index*2+2,(L+R)/2,R);\n value_update(index);\n }\n\n void update(int a,int b,char opr,short v){ _update(a,b,opr,v,0,0,limit); } \n\n int _query(int a,int b,int index,int L,int R){\n lazy_evaluate(index,L,R); \n if( b <= L || R <= a ) return 0;\n if( a <= L && R <= b ) return RMQ[index].value;\n short tmp1 = _query(a,b,index*2+1,L,(L+R)/2);\n short tmp2 = _query(a,b,index*2+2,(L+R)/2,R);\n short ret = tmp1+tmp2;\n value_update(index); //ここまでくると子の値が正しくなっているのでその和をとって今いるノードにも正しい値をいれる\n return ret;\n }\n short query(int a,int b) { return _query(a,b,0,0,limit); }\n};\n\ntypedef pair<int,int> ii;\nconst int MAX_V = 1001;\nstruct Edge {\n int src,dst,depart,arrive;\n};\n\nint S,T,D,timeD,Rendezvous,timeRendezvous;\n\ninline int toMinute(string s) { \n int ret = ( s[3] - '0' ) * 10 + ( s[4] - '0' );\n return ret + ( ( s[0] - '0' ) * 10 + ( s[1] - '0' ) ) * 60;\n}\n\nstruct Data {\n int cur,time;\n bool operator < ( const Data &data ) const { \n if( time != data.time ) return time > data.time;\n return cur > data.cur;\n }\n};\n\nconst int MAX_T = 1441;\nvector<Edge> G[MAX_V],rG[MAX_V];\nSegTree dp[MAX_V][2]; // dp[station][ 0 : from dept, 1 : to rendezvous] := reachable?\nvector<vector<bool> > used;\n\nvoid compute(vector<int> &N,vector<vector<ii> > &KT){\n rep(i,S) rep(j,2) {\n dp[i][j].init(MAX_T);\n dp[i][j].build();\n }\n \n // dept to other station\n used.clear();\n used.resize(S,vector<bool>(MAX_T,false));\n dp[D][0].update(timeD,MAX_T,'S',1);\n used[D][timeD] = true;\n priority_queue<Data> Q;\n Q.push((Data){D,timeD});\n while( !Q.empty() ){\n Data data = Q.top(); Q.pop();\n rep(i,(int)G[data.cur].size()){\n if( data.time > G[data.cur][i].depart ) continue;\n int next = G[data.cur][i].dst;\n int arrive = G[data.cur][i].arrive;\n if( !used[next][arrive] ) {\n used[next][arrive] = true;\n dp[next][0].update(arrive,1500,'S',1);\n Q.push((Data){next,arrive});\n }\n }\n }\n\n // each station to ランデヴー\n rep(i,used.size()) rep(j,used[i].size()) used[i][j] = false;\n dp[Rendezvous][1].update(0,timeRendezvous+1,'S',1);\n used[Rendezvous][timeRendezvous] = true;\n assert( Q.empty() );\n Q.push((Data){Rendezvous,timeRendezvous});\n while( !Q.empty() ){\n Data data = Q.top(); Q.pop();\n rep(i,(int)rG[data.cur].size()){\n if( data.time < rG[data.cur][i].depart ) continue;\n int prev = rG[data.cur][i].dst;\n int r_arrive = rG[data.cur][i].arrive;\n if( !used[prev][r_arrive] ){\n used[prev][r_arrive] = true;\n dp[prev][1].update(0,r_arrive+1,'S',1);\n Q.push((Data){prev,r_arrive});\n }\n }\n }\n int maxi = -1;\n rep(i,N.size()){\n rep(j,N[i]-1) {\n int f = KT[i][j].first, ft = KT[i][j].second;\n if( !dp[f][0].query(ft,ft+1) ) continue;\n REP(k,j+1,N[i]){\n int t = KT[i][k].first, tt = KT[i][k].second;\n int sleep = tt - ft;\n assert( sleep >= 1 );\n if( sleep <= maxi ) continue;\n if( dp[t][1].query(tt,tt+1) ) {\n maxi = max(maxi,sleep);\n }\n }\n }\n }\n \n if( maxi == -1 && D == Rendezvous && timeD <= timeRendezvous ) puts(\"0\");\n else if( maxi == -1 ) puts(\"impossible\");\n else printf(\"%d\\n\",maxi);\n}\n\n\nint main(){\n while( scanf(\"%d %d\",&S,&T), S|T ){\n rep(i,S) G[i].clear(), rG[i].clear();\n rep(i,MAX_V) rep(j,2) dp[i][j].RMQ.clear();\n string temp;\n cin >> D >> temp;\n --D;\n timeD = toMinute(temp);\n cin >> Rendezvous >> temp;\n --Rendezvous;\n timeRendezvous = toMinute(temp);\n vector<int> N(T);\n vector<vector<ii> > KT(T,vector<ii>());\n rep(i,T){\n cin >> N[i];\n KT[i].resize(N[i]);\n rep(j,N[i]) {\n cin >> KT[i][j].first >> temp;\n --KT[i][j].first;\n KT[i][j].second = toMinute(temp);\n }\n rep(j,N[i]-1) {\n int f = KT[i][j].first , ft = KT[i][j].second;\n int t = KT[i][j+1].first, tt = KT[i][j+1].second;\n G[f].push_back((Edge){f,t,ft,tt});\n rG[t].push_back((Edge){t,f,tt,ft});\n }\n }\n\n compute(N,KT);\n \n }\n return 0;\n}","accuracy":1,"time_ms":2270,"memory_kb":62088,"score_of_the_acc":-2,"final_rank":9},{"submission_id":"aoj_2042_1126478","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\nconst char EMPTY = 'X';\n \nstruct Node{\n short value;\n /*\n lazy : \n A : 加算の遅延 ( ADD )\n S : 区間の要素を指定した値にする遅延 ( SET )\n\n lazy_coef : \n 区間にいくら加算するのかor何をセットするのかを記録\n */\n char lazy;\n short lazy_coef; \n Node(short value=0,char lazy=EMPTY,short lazy_coef=0):value(value),lazy(lazy),lazy_coef(lazy_coef){}\n};\n \nclass SegTree{\npublic:\n vector<Node> RMQ;\n int limit,N; // N は要素数\n \n void init(int tmp){\n N = tmp;\n int N_N = 1;\n while(N_N < N)N_N *= 2;\n limit = N_N;\n RMQ.clear();\n RMQ.resize(2.3*limit);\n rep(i,2.3*limit-1) RMQ[i] = Node();\n }\n\n /* \n O(n)でRMQを初期化\n [L,R)\n tuple<int,int,int>(総和、最小値、最大値)\n */\n short _build(int cur,int L,int R){\n if( !( 0 <= cur && cur < 2*limit-1 ) ) return 0;\n if( L == R-1 ){\n if( L >= N ) return 0;\n //各要素の値が一定でない場合 ( 配列に初期値をいれてそれで初期化する場合 )\n //buf[] を用意し値を入れ RMQ[cur].value = buf[L]; とする\n // RMQのL番目の要素をbuf[L]で更新\n //RMQ[cur].value = buf[L];\n\n //各要素が全て同じの場合\n RMQ[cur] = 0; // RMQ の各要素を０で初期化、 1 なら RMQ[cur] = 1などなど...\n //minimum_dat[cur] = 0;\n //maximum_dat[cur] = 0;\n } else {\n short vl = _build(cur*2+1,L,(L+R)/2);\n short vr = _build(cur*2+2,(L+R)/2,R);\n RMQ[cur].value = vl+vr;\n }\n return RMQ[cur].value;\n }\n\n //initしてから使用すること!!! でないとlimitに正しい値が入っていません\n void build() { _build(0,0,limit); }\n\n inline void value_evaluate(int index,int L,int R){\n if( RMQ[index].lazy == 'A' ){\n RMQ[index].value += ( R - L ) * RMQ[index].lazy_coef;\n } else if( RMQ[index].lazy == 'S' ){\n RMQ[index].value = ( R - L ) * RMQ[index].lazy_coef;\n }\n }\n \n inline void lazy_evaluate(int index,int L,int R){\n value_evaluate(index,L,R);\n if( index < limit && RMQ[index].lazy != EMPTY ) {\n if( RMQ[index].lazy == 'A' ) {\n if( RMQ[index*2+1].lazy == EMPTY ) RMQ[index*2+1].lazy = 'A'; \n if( RMQ[index*2+2].lazy == EMPTY ) RMQ[index*2+2].lazy = 'A';\n RMQ[index*2+1].lazy_coef += RMQ[index].lazy_coef;\n RMQ[index*2+2].lazy_coef += RMQ[index].lazy_coef;\n } else if( RMQ[index].lazy == 'S') {\n RMQ[index*2+1].lazy = RMQ[index*2+2].lazy = 'S';\n RMQ[index*2+1].lazy_coef = RMQ[index].lazy_coef;\n RMQ[index*2+2].lazy_coef = RMQ[index].lazy_coef;\n }\n }\n RMQ[index].lazy = EMPTY;\n RMQ[index].lazy_coef = 0;\n }\n \n inline void value_update(int index){ RMQ[index].value = RMQ[index*2+1].value + RMQ[index*2+2].value; }\n\n void _update(int a,int b,char opr,int v,int index,int L,int R){\n lazy_evaluate(index,L,R);\n if( b <= L || R <= a )return;\n if( a <= L && R <= b ){\n RMQ[index].lazy = opr; // 今いるノードに遅延を設定して処理をしてもらう\n if( opr == 'A' ) RMQ[index].lazy_coef += v; \n else if( opr == 'S' ) RMQ[index].lazy_coef = v; \n lazy_evaluate(index,L,R);\n return;\n }\n _update(a,b,opr,v,index*2+1,L,(L+R)/2);\n _update(a,b,opr,v,index*2+2,(L+R)/2,R);\n value_update(index);\n }\n\n void update(int a,int b,char opr,short v){ _update(a,b,opr,v,0,0,limit); } \n\n int _query(int a,int b,int index,int L,int R){\n lazy_evaluate(index,L,R); \n if( b <= L || R <= a ) return 0;\n if( a <= L && R <= b ) return RMQ[index].value;\n short tmp1 = _query(a,b,index*2+1,L,(L+R)/2);\n short tmp2 = _query(a,b,index*2+2,(L+R)/2,R);\n short ret = tmp1+tmp2;\n value_update(index); //ここまでくると子の値が正しくなっているのでその和をとって今いるノードにも正しい値をいれる\n return ret;\n }\n\n // [a,b) の総和、最小値、最大値を返す\n short query(int a,int b) { return _query(a,b,0,0,limit); }\n\n};\n\ntypedef pair<int,int> ii;\nconst int MAX_V = 1001;\nstruct Edge {\n int src,dst,depart,arrive;\n};\n\nint S,T,D,timeD,Rendezvous,timeRendezvous;\n\ninline int toMinute(string s) { \n int ret = ( s[3] - '0' ) * 10 + ( s[4] - '0' );\n return ret + ( ( s[0] - '0' ) * 10 + ( s[1] - '0' ) ) * 60;\n}\n\nstruct Data {\n int cur,time;\n bool operator < ( const Data &data ) const { \n if( time != data.time ) return time > data.time;\n return cur > data.cur;\n }\n};\n\nconst int MAX_T = 1441;\nvector<Edge> G[MAX_V],rG[MAX_V];\nSegTree dp[MAX_V][2]; // dp[station][ 0 : from dept, 1 : to rendezvous] := reachable?\nvector<vector<bool> > used;\n\nvoid compute(vector<int> &N,vector<vector<ii> > &KT){\n rep(i,S) rep(j,2) {\n dp[i][j].init(MAX_T);\n dp[i][j].build();\n }\n \n // dept to other station\n used.clear();\n used.resize(S,vector<bool>(MAX_T,false));\n dp[D][0].update(timeD,MAX_T,'S',1);\n used[D][timeD] = true;\n priority_queue<Data> Q;\n Q.push((Data){D,timeD});\n while( !Q.empty() ){\n Data data = Q.top(); Q.pop();\n rep(i,(int)G[data.cur].size()){\n if( data.time > G[data.cur][i].depart ) continue;\n int next = G[data.cur][i].dst;\n int arrive = G[data.cur][i].arrive;\n if( !used[next][arrive] ) {\n used[next][arrive] = true;\n dp[next][0].update(arrive,1500,'S',1);\n Q.push((Data){next,arrive});\n }\n }\n }\n\n // each station to ランデヴー\n rep(i,used.size()) rep(j,used[i].size()) used[i][j] = false;\n dp[Rendezvous][1].update(0,timeRendezvous+1,'S',1);\n used[Rendezvous][timeRendezvous] = true;\n assert( Q.empty() );\n Q.push((Data){Rendezvous,timeRendezvous});\n while( !Q.empty() ){\n Data data = Q.top(); Q.pop();\n rep(i,(int)rG[data.cur].size()){\n if( data.time < rG[data.cur][i].depart ) continue;\n int prev = rG[data.cur][i].dst;\n int r_arrive = rG[data.cur][i].arrive;\n if( !used[prev][r_arrive] ){\n used[prev][r_arrive] = true;\n dp[prev][1].update(0,r_arrive+1,'S',1);\n Q.push((Data){prev,r_arrive});\n }\n }\n }\n int maxi = -1;\n rep(i,N.size()){\n rep(j,N[i]-1) {\n int f = KT[i][j].first, ft = KT[i][j].second;\n if( !dp[f][0].query(ft,ft+1) ) continue;\n REP(k,j+1,N[i]){\n int t = KT[i][k].first, tt = KT[i][k].second;\n int sleep = tt - ft;\n assert( sleep >= 1 );\n if( sleep <= maxi ) continue;\n if( dp[t][1].query(tt,tt+1) ) {\n maxi = max(maxi,sleep);\n }\n }\n }\n }\n \n if( maxi == -1 && D == Rendezvous && timeD <= timeRendezvous ) puts(\"0\");\n else if( maxi == -1 ) puts(\"impossible\");\n else printf(\"%d\\n\",maxi);\n}\n\n\nint main(){\n while( scanf(\"%d %d\",&S,&T), S|T ){\n rep(i,S) G[i].clear(), rG[i].clear();\n rep(i,MAX_V) rep(j,2) dp[i][j].RMQ.clear();\n string temp;\n cin >> D >> temp;\n --D;\n timeD = toMinute(temp);\n cin >> Rendezvous >> temp;\n --Rendezvous;\n timeRendezvous = toMinute(temp);\n vector<int> N(T);\n vector<vector<ii> > KT(T,vector<ii>());\n rep(i,T){\n cin >> N[i];\n KT[i].resize(N[i]);\n rep(j,N[i]) {\n cin >> KT[i][j].first >> temp;\n --KT[i][j].first;\n KT[i][j].second = toMinute(temp);\n }\n rep(j,N[i]-1) {\n int f = KT[i][j].first , ft = KT[i][j].second;\n int t = KT[i][j+1].first, tt = KT[i][j+1].second;\n G[f].push_back((Edge){f,t,ft,tt});\n rG[t].push_back((Edge){t,f,tt,ft});\n }\n }\n\n compute(N,KT);\n \n }\n return 0;\n}","accuracy":1,"time_ms":2250,"memory_kb":62088,"score_of_the_acc":-1.9901,"final_rank":8},{"submission_id":"aoj_2042_469960","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 int INF = INT_MAX / 2;\n\nclass Edge{\npublic:\n int to, time1, time2;\n Edge(int to0, int time01, int time02){\n to = to0;\n time1 = time01;\n time2 = time02;\n }\n};\n\nint toInt(string& s)\n{\n return atoi(s.substr(0,2).c_str()) * 60 + atoi(s.substr(3, 2).c_str());\n}\n\nint main()\n{\n for(;;){\n int s, t; // 駅の数、電車の数\n cin >> s >> t;\n if(s == 0)\n return 0;\n\n int start, goal; // 出発地、目的地\n int startTime, goalTime; // 出発時間、待ち合わせの時間\n string tmp1, tmp2;\n cin >> start >> tmp1 >> goal >> tmp2;\n startTime = toInt(tmp1);\n goalTime = toInt(tmp2);\n\n vector<int> n(t); // n[i] : 電車iが停まる駅の数\n vector<vector<int> > stop(t); // stop[i][j] : 電車iがj番目に停まる駅\n vector<vector<int> > time(t); // time[i][j] : 電車iがj番目に停まる時間\n vector<vector<Edge> > edges(s+1);\n vector<vector<Edge> > invEdges(s+1);\n for(int i=0; i<t; ++i){\n cin >> n[i];\n stop[i].resize(n[i]);\n time[i].resize(n[i]);\n\n for(int j=0; j<n[i]; ++j){\n string tmp;\n cin >> stop[i][j] >> tmp;\n time[i][j] = toInt(tmp);\n }\n for(int j=1; j<n[i]; ++j){\n edges[stop[i][j-1]].push_back(Edge(stop[i][j], time[i][j-1], time[i][j]));\n invEdges[stop[i][j]].push_back(Edge(stop[i][j-1], time[i][j-1], time[i][j]));\n }\n }\n\n vector<int> minTime(s+1, INF); // minTime[i] : 出発地から駅iに向かったとき、駅iに到着する最も早い時間\n vector<int> maxTime(s+1, -1); // maxTime[i] : 駅iから目的地に向かったとき、駅iを出発しなければならない最も遅い時間\n\n multimap<int, int> mm;\n mm.insert(make_pair(startTime, start));\n minTime[start] = startTime;\n while(!mm.empty()){\n int currTime = mm.begin()->first;\n int pos = mm.begin()->second;\n mm.erase(mm.begin());\n if(currTime > minTime[pos])\n continue;\n\n for(unsigned i=0; i<edges[pos].size(); ++i){\n Edge e = edges[pos][i];\n if(currTime <= e.time1 && e.time2 < minTime[e.to]){\n minTime[e.to] = e.time2;\n mm.insert(make_pair(e.time2, e.to));\n }\n }\n }\n\n mm.insert(make_pair(-goalTime, goal));\n maxTime[goal] = goalTime;\n while(!mm.empty()){\n int currTime = - mm.begin()->first;\n int pos = mm.begin()->second;\n mm.erase(mm.begin());\n if(currTime < maxTime[pos])\n continue;\n\n for(unsigned i=0; i<invEdges[pos].size(); ++i){\n Edge e = invEdges[pos][i];\n if(currTime >= e.time2 && e.time1 > maxTime[e.to]){\n maxTime[e.to] = e.time1;\n mm.insert(make_pair(-e.time1, e.to));\n }\n }\n }\n\n int ret = -1;\n if(start == goal && startTime <= goalTime)\n ret = 0;\n for(int i=0; i<t; ++i){\n for(int j=0; j<n[i]; ++j){\n for(int k=j+1; k<n[i]; ++k){\n if(minTime[stop[i][j]] <= time[i][j] && time[i][k] <= maxTime[stop[i][k]])\n ret = max(ret, time[i][k] - time[i][j]);\n }\n }\n }\n if(ret == -1)\n cout << \"impossible\" << endl;\n else\n cout << ret << endl;\n }\n}","accuracy":1,"time_ms":300,"memory_kb":5228,"score_of_the_acc":-0.0296,"final_rank":1},{"submission_id":"aoj_2042_406444","code_snippet":"#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\nint readtime(){\n\tint hh,mm; scanf(\"%d:%d\",&hh,&mm);\n\treturn 60*hh+mm;\n}\n\nint main(){\n\tfor(int n,m;scanf(\"%d%d\",&n,&m),n;){\n\t\tint s; scanf(\"%d\",&s); s--;\n\t\tint s_time=readtime();\n\t\tint g; scanf(\"%d\",&g); g--;\n\t\tint g_time=readtime();\n\n\t\tvector< pair<int,int> > seq[100]; // seq[i] := ( 電車 i の運行予定 )\n\t\trep(i,m){\n\t\t\tint sz; scanf(\"%d\",&sz);\n\t\t\tseq[i].resize(sz);\n\t\t\trep(j,sz){\n\t\t\t\tint u; scanf(\"%d\",&u); u--;\n\t\t\t\tseq[i][j]=make_pair(readtime(),u);\n\t\t\t}\n\t\t\tsort(seq[i].begin(),seq[i].end());\n\t\t}\n\n\t\t// train[t][u] := ( 時刻 t に駅 u から発車する電車の情報 )\n\t\tstatic vector< pair<int,int> > train[1440][1000];\n\t\trep(t,1440) rep(u,n) train[t][u].clear();\n\t\trep(i,m){\n\t\t\trep(j,seq[i].size()){\n\t\t\t\tint t=seq[i][j].first;\n\t\t\t\tint u=seq[i][j].second;\n\t\t\t\ttrain[t][u].push_back(make_pair(i,j));\n\t\t\t}\n\t\t}\n\n\t\tstatic int dp[1440][1000];\n\t\trep(t,1440) rep(u,n) dp[t][u]=-1; // -1 は到達不可能の意味\n\t\tdp[s_time][s]=0;\n\t\trep(t,1439) rep(u,n) if(dp[t][u]!=-1) {\n\t\t\t dp[t+1][u]=max(dp[t+1][u],dp[t][u]); // 電車に乗らずにその駅で待つ\n\t\t\t rep(i,train[t][u].size()){ // 電車に乗る\n\t\t\t\tint id=train[t][u][i].first;\n\t\t\t\tfor(int j=train[t][u][i].second+1;j<seq[id].size();j++){\n\t\t\t\t\tint t_next=seq[id][j].first;\n\t\t\t\t\tint u_next=seq[id][j].second;\n\t\t\t\t\tdp[t_next][u_next]=max(dp[t_next][u_next],max(dp[t][u],t_next-t));\n\t\t\t\t}\n\t\t\t }\n\t\t}\n\n\t\tint ans=-1;\n\t\trep(t,g_time+1) ans=max(ans,dp[t][g]);\n\t\tif(ans==-1) puts(\"impossible\");\n\t\telse printf(\"%d\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":720,"memory_kb":26000,"score_of_the_acc":-0.6018,"final_rank":5},{"submission_id":"aoj_2042_134158","code_snippet":"#include <iostream>\n#include <string>\n#include <queue>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nclass Edge\n{\npublic:\n\tint d,i,o;\n\tEdge(int d, int i, int o)\n\t:d(d),i(i),o(o)\n\t{}\n};\n\nclass State\n{\npublic:\n\tint n,t;\n\tState(int n, int t)\n\t:n(n),t(t)\n\t{}\n\t\n\tbool operator<(const State& s) const\n\t{\n\t\treturn t>s.t;\n\t}\n};\n\ntypedef vector<Edge> Edges;\ntypedef pair<vector<int>, vector<int> > Train;\n\nint input()\n{\n\tstring s;\n\tcin >> s;\n\t\n\treturn ((s[0]-'0')*10+(s[1]-'0'))*60+((s[3]-'0')*10+(s[4]-'0'));\n}\n\nint beg[1000], end[1000];\n\nint dijk(int S, int st, int lim, vector<Edges>& eg, bool f)\n{\n\tbool v[1000]={0};\n\tpriority_queue<State> q;\n\tq.push(State(S,st));\n\t\n\twhile(!q.empty())\n\t{\n\t\tState s=q.top(); q.pop();\n\t\tif(s.t>lim) break;\n\t\t\n\t\tif(v[s.n]) continue;\n\t\tv[s.n]=1;\n\t\t\n\t\tif(f) beg[s.n]=s.t;\n\t\telse end[s.n]=-s.t+24*60;\n\t\t\n\t\tfor(int i=0; i<eg[s.n].size(); i++)\n\t\t{\n\t\t\tEdge e=eg[s.n][i];\n\t\t\tif(v[e.d]) continue;\n\t\t\tif(s.t > e.i) continue;\n\t\t\t\n\t\t\tq.push(State(e.d, e.o));\n\t\t}\n\t}\n\t\n\treturn -1;\n}\n\nint main()\n{\n\tint S,T;\n\twhile(cin >> S >> T, (S||T))\n\t{\n\t\tint src,dst,st,dt;\n\t\tcin >> src; st=input();\n\t\tcin >> dst; dt=input();\n\t\t\n\t\tsrc--; dst--;\n\t\t\n\t\tvector<Edges> eg(1000),reg(1000);\n\t\tvector<Train> trains(100);\n\t\t\n\t\tfor(int i=0; i<T; i++)\n\t\t{\n\t\t\tint N;\n\t\t\tcin >> N;\n\t\t\tvector<int> p,t;\n\t\t\tfor(int j=0; j<N; j++)\n\t\t\t{\n\t\t\t\tint a,b;\n\t\t\t\tcin >> a; b=input();\n\t\t\t\ta--;\n\t\t\t\t\n\t\t\t\tp.push_back(a);\n\t\t\t\tt.push_back(b);\n\t\t\t}\n\t\t\ttrains[i]=make_pair(p,t);\n\t\t\t\n\t\t\tfor(int j=0; j<N-1; j++)\n\t\t\t{\n\t\t\t\tint s=p[j], d=p[j+1];\n\t\t\t\tint a=t[j], b=t[j+1];\n\t\t\t\teg[s].push_back(Edge(d,a,b));\n\t\t\t\treg[d].push_back(Edge(s,24*60-b, 24*60-a));\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i=0; i<S; i++)\n\t\t{\n\t\t\tbeg[i]=9999;\n\t\t\tend[i]=-1;\n\t\t}\n\t\t\n\t\tdijk(src,st,dt,eg,1);\n\t dijk(dst,24*60-dt,24*60-st,reg,0);\n\t\t\n\t\tint ret=-1;\n\t\tif(src==dst&&st<=dt) ret=0;\n\t\t\n\t\tfor(int i=0; i<T; i++)\n\t\t{\n\t\t\tint lo=9999,hi=-1;\n\t\t\tfor(int j=0; j<trains[i].first.size(); j++)\n\t\t\t{\n\t\t\t\tint p=trains[i].first[j], t=trains[i].second[j];\n\t\t\t\tif(beg[p] <= t) lo=min(j,lo);\n\t\t\t\tif(end[p] >= t) hi=max(j,hi);\n\t\t\t}\n\t\t\t\n\t\t\tif(lo==9999||hi==-1) continue;\n\t\t\tret=max(ret, trains[i].second[hi]-trains[i].second[lo]);\n\t\t}\n\t\tif(ret==-1) cout << \"impossible\" << endl;\n\t\telse cout << ret << endl;\n\n\t}\n}","accuracy":1,"time_ms":430,"memory_kb":5292,"score_of_the_acc":-0.0947,"final_rank":3},{"submission_id":"aoj_2042_112020","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\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)\n#define pb push_back\n\nconst int N = 1000;\nconst int inf =(1<<20);\nclass Edge{\npublic:\n int st,gt;\n int to;\n};\n\nclass Rail{\npublic:\n int p,t;\n};\n\nclass state{\npublic:\n int now;\n int time;\n bool operator<(const state & a)const{\n return time > a.time;\n }\n bool operator>(const state & a)const{\n return time < a.time;\n }\n};\n\n\nvoid go(int n,int s,int st,vector<Edge> *edge,bool isrev,int *cost){\n priority_queue<state> Q;\n priority_queue<state,vector<state>,greater<state> > RQ;\n if (!isrev)Q.push((state){s,st});\n else RQ.push((state){s,st});\n \n while(!Q.empty() || !RQ.empty()){\n state now;\n if (!isrev){\n now=Q.top(),Q.pop();\n }else{\n now = RQ.top(),RQ.pop();\n }\n if (cost[now.now] != inf)continue;\n //if (cost[now.now] == inf)\n cost[now.now] = now.time;\n /*\n else {\n if (isrev){\n\t\n\tif (now.time > cost[now.now])exit(1);\n\telse continue;\n }else {\n\t//\tcout << now.now+1 <<\" \" <<now.time <<\" \" << cost[now.now] << endl;\n\tif (now.time < cost[now.now])exit(1);\n\telse continue;\n }\n }\n */\n rep(i,edge[now.now].size()){\n if (isrev){\n\tif (now.time < edge[now.now][i].st)continue;\n\tRQ.push((state){edge[now.now][i].to,edge[now.now][i].gt});\n }else{\n\tif (now.time > edge[now.now][i].st)continue;\n\tQ.push((state){ edge[now.now][i].to,edge[now.now][i].gt});\n }\n }\n }\n}\n\nmain(){\n int n;\n int line;\n int scost[N],tcost[N];\n vector<Edge> edge[N];\n vector<Edge> rev[N];\n vector<Rail > in[100]; \n while(cin>>n>>line && n){\n rep(i,n)tcost[i]=inf,scost[i]=inf;\n rep(i,n)edge[i].clear(),rev[i].clear();\n rep(i,line)in[i].clear();\n int s,sh,sm,d,dh,dm;\n char dummy;\n cin>>s>>sh>>dummy>>sm>> d>>dh>>dummy>>dm;\n \n sh=sh*60+sm;\n dh=dh*60+dm;\n s--;\n d--;\n \n rep(i,line){\n int m;\n cin>>m;\n rep(j,m){\n\tint now,nh,nm;\n\tcin>>now>>nh>>dummy>>nm;\n\tnow--;\n\tnh = nh*60+nm;\n\tin[i].push_back((Rail){now,nh});\n }\n \n rep(j,in[i].size()-1){\n\tedge[in[i][j ].p].pb((Edge){in[i][j ].t,in[i][j+1].t,in[i][j+1].p});\n\trev[ in[i][j+1].p].pb((Edge){in[i][j+1].t,in[i][j ].t,in[i][j ].p});\n }\n }\n \n\n go(n,s,sh,edge,false,scost);\n go(n,d,dh,rev ,true ,tcost);\n\n /*\n cout << \"begint\"<<endl;\n cout << n << endl;\n cout <<\"go\"<<endl;\n rep(i,n)cout << scost[i] <<\" \";cout << endl;\n cout << \"rev \" << endl;\n rep(i,n)cout << tcost[i] <<\" \";cout << endl;\n cout << endl;\n */\n\n int ans = -1;\n if (scost[d] == inf){\n cout << \"impossible\"<<endl;\n continue;\n }\n if (s == d && sh <= dh)ans = 0;\n\n rep(i,line){\n int scan=-1,dcan=-1;\n rep(j,in[i].size()){\n\tif (scost[in[i][j].p] == inf)continue;\n\tif (scost[in[i][j].p] <= in[i][j].t){\n\t scan=j;\n\t break;\n\t}\n }\n \n for(int j=in[i].size()-1;j>=0 && j >scan;j--){\n\tif (tcost[in[i][j].p] == inf)continue;\n\tif (tcost[in[i][j].p] >= in[i][j].t){\n\t dcan=j;\n\t break;\n\t}\n }\n\n if (scan == -1 || dcan == -1)continue;\n\n ans = max(ans,in[i][dcan].t-in[i][scan].t);\n }\n \n if (ans == -1)cout << \"impossible\"<<endl;\n else cout << ans << endl;\n \n }\n}","accuracy":1,"time_ms":400,"memory_kb":5844,"score_of_the_acc":-0.0897,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_2042_10850499\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <vector>\\n\\nusing namespace std;\\n\\nint dp[1000][24 * 60][2];\\nint n, m, dest, destTime;\\n\\nvector<pair<int, int>> lines[100], stationInfo[1000][24 * 60]; // time, station / line index\\n\\nint getAns(int station, int time, bool slept) {\\n\\tif(time > destTime) return -2;\\n\\n\\tint &ret = dp[station][time][slept];\\n\\tif(ret != -1) return ret;\\n\\n\\tret = -2;\\n\\tif(station == dest) ret = 0;\\n\\tret = max(ret, getAns(station, time + 1, slept));\\n\\tfor(auto &info: stationInfo[station][time]) {\\n\\t\\tint nextLine = info.first;\\n\\t\\tint stIndex = info.second;\\n\\t\\tif(stIndex + 1 < lines[nextLine].size())\\n\\t\\t\\tret = max(ret, getAns(lines[nextLine][stIndex + 1].second, lines[nextLine][stIndex + 1].first, slept));\\n\\t\\tif(!slept)\\n\\t\\t\\tfor(int ind = stIndex + 1; ind < lines[nextLine].size(); ind++) {\\n\\t\\t\\t\\tint res = getAns(lines[nextLine][ind].second, lines[nextLine][ind].first, true);\\n\\t\\t\\t\\tif(res >= 0)\\n\\t\\t\\t\\t\\tret = max(ret, res + lines[nextLine][ind].first - lines[nextLine][stIndex].first);\\n\\t\\t\\t}\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nint main(void) {\\n\\twhile(scanf(\\\"%d %d\\\", &n, &m), n > 0) {\\n\\t\\tfor(int i = 0; i < m; i++) lines[i].clear();\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(int j = 0; j < 24 * 60; j++)\\n\\t\\t\\t\\tstationInfo[i][j].clear();\\n\\n\\t\\tint start, startTime, temp[2];\\n\\t\\tscanf(\\\"%d %d:%d\\\", &start, temp, temp + 1);\\n\\t\\tstartTime = temp[0] * 60 + temp[1];\\n\\t\\tscanf(\\\"%d %d:%d\\\", &dest, temp, temp + 1);\\n\\t\\tdestTime = temp[0] * 60 + temp[1];\\n\\t\\tstart--, dest--;\\n\\n\\t\\tfor(int i = 0; i < m; i++) {\\n\\t\\t\\tint visitn;\\n\\t\\t\\tscanf(\\\"%d\\\", &visitn);\\n\\t\\t\\tfor(int j = 0; j < visitn; j++) {\\n\\t\\t\\t\\tint station;\\n\\t\\t\\t\\tscanf(\\\"%d %d:%d\\\", &station, temp, temp + 1);\\n\\t\\t\\t\\tlines[i].push_back(make_pair(temp[0] * 60 + temp[1], station - 1));\\n\\t\\t\\t\\tstationInfo[station - 1][temp[0] * 60 + temp[1]].push_back(make_pair(i, j));\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tmemset(dp, -1, sizeof(dp));\\n\\t\\tint res = getAns(start, startTime, false);\\n\\t\\tif(res == -2) printf(\\\"impossible\\\\n\\\");\\n\\t\\telse printf(\\\"%d\\\\n\\\", res);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 55888,\n \"score_of_the_acc\": -0.891,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2042_3239975\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 1440\\n\\nstruct Info{\\n\\tInfo(int arg_station_id,int arg_stop_time){\\n\\t\\tstation_id = arg_station_id;\\n\\t\\tstop_time = arg_stop_time;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{\\n\\t\\treturn stop_time < arg.stop_time;\\n\\t}\\n\\tint station_id,stop_time;\\n};\\n\\nstruct Data{\\n\\tData(int arg_train_id,int arg_stop_index){\\n\\t\\ttrain_id = arg_train_id;\\n\\t\\tstop_index = arg_stop_index;\\n\\t}\\n\\tint train_id,stop_index;\\n};\\n\\nint start,start_time;\\nint goal,goal_time;\\nint num_station,num_train;\\nint dp[1005][NUM];\\nvector<Info> TRAIN[105];\\nvector<Data> STATION[1005][NUM];\\n\\nint getTime(char buf[6]){\\n\\n\\tint hour = 10*(buf[0]-'0')+(buf[1]-'0');\\n\\tint minute = 10*(buf[3]-'0')+(buf[4]-'0');\\n\\n\\treturn 60*hour+minute;\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < num_station; i++){\\n\\t\\tfor(int k = 0; k < NUM; k++){\\n\\n\\t\\t\\tSTATION[i][k].clear();\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_train; i++){\\n\\n\\t\\tTRAIN[i].clear();\\n\\t}\\n\\n\\tchar buf[6];\\n\\n\\tscanf(\\\"%d %s\\\",&start,buf);\\n\\tstart--;\\n\\tstart_time = getTime(buf);\\n\\n\\tscanf(\\\"%d %s\\\",&goal,buf);\\n\\tgoal--;\\n\\tgoal_time = getTime(buf);\\n\\n\\tint num_stop;\\n\\tint station_id,stop_time;\\n\\n\\tfor(int i = 0; i < num_train; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&num_stop);\\n\\n\\t\\tfor(int k = 0; k < num_stop; k++){\\n\\n\\t\\t\\tscanf(\\\"%d %s\\\",&station_id,buf);\\n\\t\\t\\tstation_id--;\\n\\t\\t\\tstop_time = getTime(buf);\\n\\n\\t\\t\\tTRAIN[i].push_back(Info(station_id,stop_time));\\n\\t\\t}\\n\\t\\tsort(TRAIN[i].begin(),TRAIN[i].end());\\n\\t}\\n\\n\\tif(start_time > goal_time){\\n\\n\\t\\tprintf(\\\"impossible\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tfor(int i = 0; i < num_train; i++){\\n\\t\\tfor(int k = 0; k < TRAIN[i].size(); k++){\\n\\n\\t\\t\\tSTATION[TRAIN[i][k].station_id][TRAIN[i][k].stop_time].push_back(Data(i,k));\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_station; i++){\\n\\t\\tfor(int k = start_time; k <= goal_time; k++){\\n\\n\\t\\t\\tdp[i][k] = -1;\\n\\t\\t}\\n\\t}\\n\\n\\tdp[start][start_time] = 0;\\n\\n\\tint train_id,stop_index;\\n\\n\\tfor(int k = start_time; k < goal_time; k++){\\n\\t\\tfor(int i = 0; i < num_station; i++){\\n\\n\\t\\t\\tif(dp[i][k] == -1)continue;\\n\\t\\t\\tdp[i][k+1] = max(dp[i][k+1],dp[i][k]);\\n\\n\\t\\t\\tfor(int a = 0; a < STATION[i][k].size(); a++){\\n\\n\\t\\t\\t\\ttrain_id = STATION[i][k][a].train_id;\\n\\t\\t\\t\\tstop_index = STATION[i][k][a].stop_index;\\n\\n\\t\\t\\t\\tfor(int b = stop_index+1; b < TRAIN[train_id].size(); b++){\\n\\n\\t\\t\\t\\t\\tif(TRAIN[train_id][b].stop_time > goal_time)break;\\n\\n\\t\\t\\t\\t\\tstation_id = TRAIN[train_id][b].station_id;\\n\\t\\t\\t\\t\\tstop_time = TRAIN[train_id][b].stop_time;\\n\\n\\t\\t\\t\\t\\tdp[station_id][stop_time] = max(dp[station_id][stop_time],max(dp[i][k],stop_time-k));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = -1;\\n\\n\\tfor(int i = start_time; i <= goal_time; i++){\\n\\n\\t\\tans = max(ans,dp[goal][i]);\\n\\t}\\n\\n\\tif(ans == -1){\\n\\n\\t\\tprintf(\\\"impossible\\\\n\\\");\\n\\n\\t}else{\\n\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&num_station,&num_train);\\n\\t\\tif(num_station == 0 && num_train == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 50052,\n \"score_of_the_acc\": -0.8425,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2042_2285742\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint N,M,S,T;\\nint st, ed;\\n\\nunordered_map<int,vector<int>> R;\\nunordered_map<int,vector<int>> tr;\\n\\nint ghs(int a,int b){\\n return a * 24*60 + b;\\n}\\n\\nint gettime(int t1,int t2){\\n return t1*60 + t2;\\n}\\n\\nconst int INF = (1<<29);\\ntypedef pair<int,int> P;\\nP dp[60*24+1][1101];\\nvoid update(P &a, P b){\\n if( a.first < b.first ) a.first = b.first;\\n if( a.second < b.second ) a.second = b.second;\\n if( a.first < a.second ) a.first = a.second;\\n}\\nint solve(){\\n fill( dp[0], dp[ed+1], P(-INF,-INF) );\\n dp[st][S+M] = P(0,0); \\n for(int t=st;t<=ed;t++){\\n for(int i=0;i<N+M;i++){\\n int id = i%(N+M);\\n if( dp[t][id].first == -INF ) continue; \\n if( id < M ) { // train\\n if( R.count( ghs(id,t) ) )\\n for( int nid : R[ghs(id,t)] )\\n update( dp[t][nid+M], P(dp[t][id].first,0) );\\n update( dp[t+1][id], P(dp[t][id].first,dp[t][id].second+1) );\\n } else { //station\\n int x = id-M;\\n if( tr.count( ghs(x,t) ) )\\n for( int nid : tr[ghs(x,t)] )\\n update( dp[t+1][nid], P(dp[t][id].first,1) );\\n update( dp[t+1][id], P(dp[t][id].first,0) ); \\n }\\n }\\n }\\n return dp[ed][T+M].first;\\n}\\n\\n\\nint main(){\\n while( ~scanf(\\\"%d%d\\\",&N,&M) && (N|M) ) {\\n int t1,t2,t3,t4;\\n scanf(\\\"%d %d:%d %d %d:%d\\\",&S, &t1, &t2, &T, &t3, &t4);\\n --S; --T;\\n st = gettime( t1, t2 ), ed = gettime( t3, t4 );\\n \\n for(int i=0;i<M;i++){\\n int n; scanf(\\\"%d\\\",&n); \\n for(int j=0;j<n;j++){\\n int k;\\n scanf(\\\"%d %d:%d\\\",&k,&t1,&t2);\\n --k; \\n R[ghs(i,gettime(t1,t2))].emplace_back(k);\\n tr[ghs(k,gettime(t1,t2))].emplace_back(i);\\n //cout << i << \\\" \\\"<< gettime(t1,t2) << \\\" \\\" << R[i][gettime(t1,t2)] << endl;\\n // cout << k << \\\" \\\"<< gettime(t1,t2) << \\\" \\\" << tr[k][gettime(t1,t2)] << endl;\\n } \\n }\\n\\n int res = solve();\\n if( res < 0 ) printf(\\\"impossible\\\\n\\\");\\n else printf(\\\"%d\\\\n\\\",res);\\n tr.clear();\\n R.clear();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 470,\n \"memory_kb\": 30312,\n \"score_of_the_acc\": -0.5545,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2042_1126479\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nusing namespace std;\\n\\nconst char EMPTY = 'X';\\n \\nstruct Node{\\n short value;\\n char lazy;\\n short lazy_coef; \\n Node(short value=0,char lazy=EMPTY,short lazy_coef=0):value(value),lazy(lazy),lazy_coef(lazy_coef){}\\n};\\n \\nclass SegTree{\\npublic:\\n vector<Node> RMQ;\\n int limit,N; // N は要素数\\n \\n void init(int tmp){\\n N = tmp;\\n int N_N = 1;\\n while(N_N < N)N_N *= 2;\\n limit = N_N;\\n RMQ.clear();\\n RMQ.resize(2.3*limit);\\n rep(i,2.3*limit-1) RMQ[i] = Node();\\n }\\n\\n short _build(int cur,int L,int R){\\n if( !( 0 <= cur && cur < 2*limit-1 ) ) return 0;\\n if( L == R-1 ){\\n if( L >= N ) return 0;\\n RMQ[cur] = 0; // RMQ の各要素を０で初期化、 1 なら RMQ[cur] = 1などなど...\\n } else {\\n short vl = _build(cur*2+1,L,(L+R)/2);\\n short vr = _build(cur*2+2,(L+R)/2,R);\\n RMQ[cur].value = vl+vr;\\n }\\n return RMQ[cur].value;\\n }\\n\\n void build() { _build(0,0,limit); }\\n\\n inline void value_evaluate(int index,int L,int R){\\n if( RMQ[index].lazy == 'A' ){\\n RMQ[index].value += ( R - L ) * RMQ[index].lazy_coef;\\n } else if( RMQ[index].lazy == 'S' ){\\n RMQ[index].value = ( R - L ) * RMQ[index].lazy_coef;\\n }\\n }\\n \\n inline void lazy_evaluate(int index,int L,int R){\\n value_evaluate(index,L,R);\\n if( index < limit && RMQ[index].lazy != EMPTY ) {\\n if( RMQ[index].lazy == 'A' ) {\\n if( RMQ[index*2+1].lazy == EMPTY ) RMQ[index*2+1].lazy = 'A'; \\n if( RMQ[index*2+2].lazy == EMPTY ) RMQ[index*2+2].lazy = 'A';\\n RMQ[index*2+1].lazy_coef += RMQ[index].lazy_coef;\\n RMQ[index*2+2].lazy_coef += RMQ[index].lazy_coef;\\n } else if( RMQ[index].lazy == 'S') {\\n RMQ[index*2+1].lazy = RMQ[index*2+2].lazy = 'S';\\n RMQ[index*2+1].lazy_coef = RMQ[index].lazy_coef;\\n RMQ[index*2+2].lazy_coef = RMQ[index].lazy_coef;\\n }\\n }\\n RMQ[index].lazy = EMPTY;\\n RMQ[index].lazy_coef = 0;\\n }\\n \\n inline void value_update(int index){ RMQ[index].value = RMQ[index*2+1].value + RMQ[index*2+2].value; }\\n\\n void _update(int a,int b,char opr,int v,int index,int L,int R){\\n lazy_evaluate(index,L,R);\\n if( b <= L || R <= a )return;\\n if( a <= L && R <= b ){\\n RMQ[index].lazy = opr; // 今いるノードに遅延を設定して処理をしてもらう\\n if( opr == 'A' ) RMQ[index].lazy_coef += v; \\n else if( opr == 'S' ) RMQ[index].lazy_coef = v; \\n lazy_evaluate(index,L,R);\\n return;\\n }\\n _update(a,b,opr,v,index*2+1,L,(L+R)/2);\\n _update(a,b,opr,v,index*2+2,(L+R)/2,R);\\n value_update(index);\\n }\\n\\n void update(int a,int b,char opr,short v){ _update(a,b,opr,v,0,0,limit); } \\n\\n int _query(int a,int b,int index,int L,int R){\\n lazy_evaluate(index,L,R); \\n if( b <= L || R <= a ) return 0;\\n if( a <= L && R <= b ) return RMQ[index].value;\\n short tmp1 = _query(a,b,index*2+1,L,(L+R)/2);\\n short tmp2 = _query(a,b,index*2+2,(L+R)/2,R);\\n short ret = tmp1+tmp2;\\n value_update(index); //ここまでくると子の値が正しくなっているのでその和をとって今いるノードにも正しい値をいれる\\n return ret;\\n }\\n short query(int a,int b) { return _query(a,b,0,0,limit); }\\n};\\n\\ntypedef pair<int,int> ii;\\nconst int MAX_V = 1001;\\nstruct Edge {\\n int src,dst,depart,arrive;\\n};\\n\\nint S,T,D,timeD,Rendezvous,timeRendezvous;\\n\\ninline int toMinute(string s) { \\n int ret = ( s[3] - '0' ) * 10 + ( s[4] - '0' );\\n return ret + ( ( s[0] - '0' ) * 10 + ( s[1] - '0' ) ) * 60;\\n}\\n\\nstruct Data {\\n int cur,time;\\n bool operator < ( const Data &data ) const { \\n if( time != data.time ) return time > data.time;\\n return cur > data.cur;\\n }\\n};\\n\\nconst int MAX_T = 1441;\\nvector<Edge> G[MAX_V],rG[MAX_V];\\nSegTree dp[MAX_V][2]; // dp[station][ 0 : from dept, 1 : to rendezvous] := reachable?\\nvector<vector<bool> > used;\\n\\nvoid compute(vector<int> &N,vector<vector<ii> > &KT){\\n rep(i,S) rep(j,2) {\\n dp[i][j].init(MAX_T);\\n dp[i][j].build();\\n }\\n \\n // dept to other station\\n used.clear();\\n used.resize(S,vector<bool>(MAX_T,false));\\n dp[D][0].update(timeD,MAX_T,'S',1);\\n used[D][timeD] = true;\\n priority_queue<Data> Q;\\n Q.push((Data){D,timeD});\\n while( !Q.empty() ){\\n Data data = Q.top(); Q.pop();\\n rep(i,(int)G[data.cur].size()){\\n if( data.time > G[data.cur][i].depart ) continue;\\n int next = G[data.cur][i].dst;\\n int arrive = G[data.cur][i].arrive;\\n if( !used[next][arrive] ) {\\n used[next][arrive] = true;\\n dp[next][0].update(arrive,1500,'S',1);\\n Q.push((Data){next,arrive});\\n }\\n }\\n }\\n\\n // each station to ランデヴー\\n rep(i,used.size()) rep(j,used[i].size()) used[i][j] = false;\\n dp[Rendezvous][1].update(0,timeRendezvous+1,'S',1);\\n used[Rendezvous][timeRendezvous] = true;\\n assert( Q.empty() );\\n Q.push((Data){Rendezvous,timeRendezvous});\\n while( !Q.empty() ){\\n Data data = Q.top(); Q.pop();\\n rep(i,(int)rG[data.cur].size()){\\n if( data.time < rG[data.cur][i].depart ) continue;\\n int prev = rG[data.cur][i].dst;\\n int r_arrive = rG[data.cur][i].arrive;\\n if( !used[prev][r_arrive] ){\\n used[prev][r_arrive] = true;\\n dp[prev][1].update(0,r_arrive+1,'S',1);\\n Q.push((Data){prev,r_arrive});\\n }\\n }\\n }\\n int maxi = -1;\\n rep(i,N.size()){\\n rep(j,N[i]-1) {\\n int f = KT[i][j].first, ft = KT[i][j].second;\\n if( !dp[f][0].query(ft,ft+1) ) continue;\\n REP(k,j+1,N[i]){\\n int t = KT[i][k].first, tt = KT[i][k].second;\\n int sleep = tt - ft;\\n assert( sleep >= 1 );\\n if( sleep <= maxi ) continue;\\n if( dp[t][1].query(tt,tt+1) ) {\\n maxi = max(maxi,sleep);\\n }\\n }\\n }\\n }\\n \\n if( maxi == -1 && D == Rendezvous && timeD <= timeRendezvous ) puts(\\\"0\\\");\\n else if( maxi == -1 ) puts(\\\"impossible\\\");\\n else printf(\\\"%d\\\\n\\\",maxi);\\n}\\n\\n\\nint main(){\\n while( scanf(\\\"%d %d\\\",&S,&T), S|T ){\\n rep(i,S) G[i].clear(), rG[i].clear();\\n rep(i,MAX_V) rep(j,2) dp[i][j].RMQ.clear();\\n string temp;\\n cin >> D >> temp;\\n --D;\\n timeD = toMinute(temp);\\n cin >> Rendezvous >> temp;\\n --Rendezvous;\\n timeRendezvous = toMinute(temp);\\n vector<int> N(T);\\n vector<vector<ii> > KT(T,vector<ii>());\\n rep(i,T){\\n cin >> N[i];\\n KT[i].resize(N[i]);\\n rep(j,N[i]) {\\n cin >> KT[i][j].first >> temp;\\n --KT[i][j].first;\\n KT[i][j].second = toMinute(temp);\\n }\\n rep(j,N[i]-1) {\\n int f = KT[i][j].first , ft = KT[i][j].second;\\n int t = KT[i][j+1].first, tt = KT[i][j+1].second;\\n G[f].push_back((Edge){f,t,ft,tt});\\n rG[t].push_back((Edge){t,f,tt,ft});\\n }\\n }\\n\\n compute(N,KT);\\n \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2270,\n \"memory_kb\": 62088,\n \"score_of_the_acc\": -2,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2042_1126478\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nusing namespace std;\\n\\nconst char EMPTY = 'X';\\n \\nstruct Node{\\n short value;\\n /*\\n lazy : \\n A : 加算の遅延 ( ADD )\\n S : 区間の要素を指定した値にする遅延 ( SET )\\n\\n lazy_coef : \\n 区間にいくら加算するのかor何をセットするのかを記録\\n */\\n char lazy;\\n short lazy_coef; \\n Node(short value=0,char lazy=EMPTY,short lazy_coef=0):value(value),lazy(lazy),lazy_coef(lazy_coef){}\\n};\\n \\nclass SegTree{\\npublic:\\n vector<Node> RMQ;\\n int limit,N; // N は要素数\\n \\n void init(int tmp){\\n N = tmp;\\n int N_N = 1;\\n while(N_N < N)N_N *= 2;\\n limit = N_N;\\n RMQ.clear();\\n RMQ.resize(2.3*limit);\\n rep(i,2.3*limit-1) RMQ[i] = Node();\\n }\\n\\n /* \\n O(n)でRMQを初期化\\n [L,R)\\n tuple<int,int,int>(総和、最小値、最大値)\\n */\\n short _build(int cur,int L,int R){\\n if( !( 0 <= cur && cur < 2*limit-1 ) ) return 0;\\n if( L == R-1 ){\\n if( L >= N ) return 0;\\n //各要素の値が一定でない場合 ( 配列に初期値をいれてそれで初期化する場合 )\\n //buf[] を用意し値を入れ RMQ[cur].value = buf[L]; とする\\n // RMQのL番目の要素をbuf[L]で更新\\n //RMQ[cur].value = buf[L];\\n\\n //各要素が全て同じの場合\\n RMQ[cur] = 0; // RMQ の各要素を０で初期化、 1 なら RMQ[cur] = 1などなど...\\n //minimum_dat[cur] = 0;\\n //maximum_dat[cur] = 0;\\n } else {\\n short vl = _build(cur*2+1,L,(L+R)/2);\\n short vr = _build(cur*2+2,(L+R)/2,R);\\n RMQ[cur].value = vl+vr;\\n }\\n return RMQ[cur].value;\\n }\\n\\n //initしてから使用すること!!! でないとlimitに正しい値が入っていません\\n void build() { _build(0,0,limit); }\\n\\n inline void value_evaluate(int index,int L,int R){\\n if( RMQ[index].lazy == 'A' ){\\n RMQ[index].value += ( R - L ) * RMQ[index].lazy_coef;\\n } else if( RMQ[index].lazy == 'S' ){\\n RMQ[index].value = ( R - L ) * RMQ[index].lazy_coef;\\n }\\n }\\n \\n inline void lazy_evaluate(int index,int L,int R){\\n value_evaluate(index,L,R);\\n if( index < limit && RMQ[index].lazy != EMPTY ) {\\n if( RMQ[index].lazy == 'A' ) {\\n if( RMQ[index*2+1].lazy == EMPTY ) RMQ[index*2+1].lazy = 'A'; \\n if( RMQ[index*2+2].lazy == EMPTY ) RMQ[index*2+2].lazy = 'A';\\n RMQ[index*2+1].lazy_coef += RMQ[index].lazy_coef;\\n RMQ[index*2+2].lazy_coef += RMQ[index].lazy_coef;\\n } else if( RMQ[index].lazy == 'S') {\\n RMQ[index*2+1].lazy = RMQ[index*2+2].lazy = 'S';\\n RMQ[index*2+1].lazy_coef = RMQ[index].lazy_coef;\\n RMQ[index*2+2].lazy_coef = RMQ[index].lazy_coef;\\n }\\n }\\n RMQ[index].lazy = EMPTY;\\n RMQ[index].lazy_coef = 0;\\n }\\n \\n inline void value_update(int index){ RMQ[index].value = RMQ[index*2+1].value + RMQ[index*2+2].value; }\\n\\n void _update(int a,int b,char opr,int v,int index,int L,int R){\\n lazy_evaluate(index,L,R);\\n if( b <= L || R <= a )return;\\n if( a <= L && R <= b ){\\n RMQ[index].lazy = opr; // 今いるノードに遅延を設定して処理をしてもらう\\n if( opr == 'A' ) RMQ[index].lazy_coef += v; \\n else if( opr == 'S' ) RMQ[index].lazy_coef = v; \\n lazy_evaluate(index,L,R);\\n return;\\n }\\n _update(a,b,opr,v,index*2+1,L,(L+R)/2);\\n _update(a,b,opr,v,index*2+2,(L+R)/2,R);\\n value_update(index);\\n }\\n\\n void update(int a,int b,char opr,short v){ _update(a,b,opr,v,0,0,limit); } \\n\\n int _query(int a,int b,int index,int L,int R){\\n lazy_evaluate(index,L,R); \\n if( b <= L || R <= a ) return 0;\\n if( a <= L && R <= b ) return RMQ[index].value;\\n short tmp1 = _query(a,b,index*2+1,L,(L+R)/2);\\n short tmp2 = _query(a,b,index*2+2,(L+R)/2,R);\\n short ret = tmp1+tmp2;\\n value_update(index); //ここまでくると子の値が正しくなっているのでその和をとって今いるノードにも正しい値をいれる\\n return ret;\\n }\\n\\n // [a,b) の総和、最小値、最大値を返す\\n short query(int a,int b) { return _query(a,b,0,0,limit); }\\n\\n};\\n\\ntypedef pair<int,int> ii;\\nconst int MAX_V = 1001;\\nstruct Edge {\\n int src,dst,depart,arrive;\\n};\\n\\nint S,T,D,timeD,Rendezvous,timeRendezvous;\\n\\ninline int toMinute(string s) { \\n int ret = ( s[3] - '0' ) * 10 + ( s[4] - '0' );\\n return ret + ( ( s[0] - '0' ) * 10 + ( s[1] - '0' ) ) * 60;\\n}\\n\\nstruct Data {\\n int cur,time;\\n bool operator < ( const Data &data ) const { \\n if( time != data.time ) return time > data.time;\\n return cur > data.cur;\\n }\\n};\\n\\nconst int MAX_T = 1441;\\nvector<Edge> G[MAX_V],rG[MAX_V];\\nSegTree dp[MAX_V][2]; // dp[station][ 0 : from dept, 1 : to rendezvous] := reachable?\\nvector<vector<bool> > used;\\n\\nvoid compute(vector<int> &N,vector<vector<ii> > &KT){\\n rep(i,S) rep(j,2) {\\n dp[i][j].init(MAX_T);\\n dp[i][j].build();\\n }\\n \\n // dept to other station\\n used.clear();\\n used.resize(S,vector<bool>(MAX_T,false));\\n dp[D][0].update(timeD,MAX_T,'S',1);\\n used[D][timeD] = true;\\n priority_queue<Data> Q;\\n Q.push((Data){D,timeD});\\n while( !Q.empty() ){\\n Data data = Q.top(); Q.pop();\\n rep(i,(int)G[data.cur].size()){\\n if( data.time > G[data.cur][i].depart ) continue;\\n int next = G[data.cur][i].dst;\\n int arrive = G[data.cur][i].arrive;\\n if( !used[next][arrive] ) {\\n used[next][arrive] = true;\\n dp[next][0].update(arrive,1500,'S',1);\\n Q.push((Data){next,arrive});\\n }\\n }\\n }\\n\\n // each station to ランデヴー\\n rep(i,used.size()) rep(j,used[i].size()) used[i][j] = false;\\n dp[Rendezvous][1].update(0,timeRendezvous+1,'S',1);\\n used[Rendezvous][timeRendezvous] = true;\\n assert( Q.empty() );\\n Q.push((Data){Rendezvous,timeRendezvous});\\n while( !Q.empty() ){\\n Data data = Q.top(); Q.pop();\\n rep(i,(int)rG[data.cur].size()){\\n if( data.time < rG[data.cur][i].depart ) continue;\\n int prev = rG[data.cur][i].dst;\\n int r_arrive = rG[data.cur][i].arrive;\\n if( !used[prev][r_arrive] ){\\n used[prev][r_arrive] = true;\\n dp[prev][1].update(0,r_arrive+1,'S',1);\\n Q.push((Data){prev,r_arrive});\\n }\\n }\\n }\\n int maxi = -1;\\n rep(i,N.size()){\\n rep(j,N[i]-1) {\\n int f = KT[i][j].first, ft = KT[i][j].second;\\n if( !dp[f][0].query(ft,ft+1) ) continue;\\n REP(k,j+1,N[i]){\\n int t = KT[i][k].first, tt = KT[i][k].second;\\n int sleep = tt - ft;\\n assert( sleep >= 1 );\\n if( sleep <= maxi ) continue;\\n if( dp[t][1].query(tt,tt+1) ) {\\n maxi = max(maxi,sleep);\\n }\\n }\\n }\\n }\\n \\n if( maxi == -1 && D == Rendezvous && timeD <= timeRendezvous ) puts(\\\"0\\\");\\n else if( maxi == -1 ) puts(\\\"impossible\\\");\\n else printf(\\\"%d\\\\n\\\",maxi);\\n}\\n\\n\\nint main(){\\n while( scanf(\\\"%d %d\\\",&S,&T), S|T ){\\n rep(i,S) G[i].clear(), rG[i].clear();\\n rep(i,MAX_V) rep(j,2) dp[i][j].RMQ.clear();\\n string temp;\\n cin >> D >> temp;\\n --D;\\n timeD = toMinute(temp);\\n cin >> Rendezvous >> temp;\\n --Rendezvous;\\n timeRendezvous = toMinute(temp);\\n vector<int> N(T);\\n vector<vector<ii> > KT(T,vector<ii>());\\n rep(i,T){\\n cin >> N[i];\\n KT[i].resize(N[i]);\\n rep(j,N[i]) {\\n cin >> KT[i][j].first >> temp;\\n --KT[i][j].first;\\n KT[i][j].second = toMinute(temp);\\n }\\n rep(j,N[i]-1) {\\n int f = KT[i][j].first , ft = KT[i][j].second;\\n int t = KT[i][j+1].first, tt = KT[i][j+1].second;\\n G[f].push_back((Edge){f,t,ft,tt});\\n rG[t].push_back((Edge){t,f,tt,ft});\\n }\\n }\\n\\n compute(N,KT);\\n \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2250,\n \"memory_kb\": 62088,\n \"score_of_the_acc\": -1.9901,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2042_469960\",\n \"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 int INF = INT_MAX / 2;\\n\\nclass Edge{\\npublic:\\n int to, time1, time2;\\n Edge(int to0, int time01, int time02){\\n to = to0;\\n time1 = time01;\\n time2 = time02;\\n }\\n};\\n\\nint toInt(string& s)\\n{\\n return atoi(s.substr(0,2).c_str()) * 60 + atoi(s.substr(3, 2).c_str());\\n}\\n\\nint main()\\n{\\n for(;;){\\n int s, t; // 駅の数、電車の数\\n cin >> s >> t;\\n if(s == 0)\\n return 0;\\n\\n int start, goal; // 出発地、目的地\\n int startTime, goalTime; // 出発時間、待ち合わせの時間\\n string tmp1, tmp2;\\n cin >> start >> tmp1 >> goal >> tmp2;\\n startTime = toInt(tmp1);\\n goalTime = toInt(tmp2);\\n\\n vector<int> n(t); // n[i] : 電車iが停まる駅の数\\n vector<vector<int> > stop(t); // stop[i][j] : 電車iがj番目に停まる駅\\n vector<vector<int> > time(t); // time[i][j] : 電車iがj番目に停まる時間\\n vector<vector<Edge> > edges(s+1);\\n vector<vector<Edge> > invEdges(s+1);\\n for(int i=0; i<t; ++i){\\n cin >> n[i];\\n stop[i].resize(n[i]);\\n time[i].resize(n[i]);\\n\\n for(int j=0; j<n[i]; ++j){\\n string tmp;\\n cin >> stop[i][j] >> tmp;\\n time[i][j] = toInt(tmp);\\n }\\n for(int j=1; j<n[i]; ++j){\\n edges[stop[i][j-1]].push_back(Edge(stop[i][j], time[i][j-1], time[i][j]));\\n invEdges[stop[i][j]].push_back(Edge(stop[i][j-1], time[i][j-1], time[i][j]));\\n }\\n }\\n\\n vector<int> minTime(s+1, INF); // minTime[i] : 出発地から駅iに向かったとき、駅iに到着する最も早い時間\\n vector<int> maxTime(s+1, -1); // maxTime[i] : 駅iから目的地に向かったとき、駅iを出発しなければならない最も遅い時間\\n\\n multimap<int, int> mm;\\n mm.insert(make_pair(startTime, start));\\n minTime[start] = startTime;\\n while(!mm.empty()){\\n int currTime = mm.begin()->first;\\n int pos = mm.begin()->second;\\n mm.erase(mm.begin());\\n if(currTime > minTime[pos])\\n continue;\\n\\n for(unsigned i=0; i<edges[pos].size(); ++i){\\n Edge e = edges[pos][i];\\n if(currTime <= e.time1 && e.time2 < minTime[e.to]){\\n minTime[e.to] = e.time2;\\n mm.insert(make_pair(e.time2, e.to));\\n }\\n }\\n }\\n\\n mm.insert(make_pair(-goalTime, goal));\\n maxTime[goal] = goalTime;\\n while(!mm.empty()){\\n int currTime = - mm.begin()->first;\\n int pos = mm.begin()->second;\\n mm.erase(mm.begin());\\n if(currTime < maxTime[pos])\\n continue;\\n\\n for(unsigned i=0; i<invEdges[pos].size(); ++i){\\n Edge e = invEdges[pos][i];\\n if(currTime >= e.time2 && e.time1 > maxTime[e.to]){\\n maxTime[e.to] = e.time1;\\n mm.insert(make_pair(-e.time1, e.to));\\n }\\n }\\n }\\n\\n int ret = -1;\\n if(start == goal && startTime <= goalTime)\\n ret = 0;\\n for(int i=0; i<t; ++i){\\n for(int j=0; j<n[i]; ++j){\\n for(int k=j+1; k<n[i]; ++k){\\n if(minTime[stop[i][j]] <= time[i][j] && time[i][k] <= maxTime[stop[i][k]])\\n ret = max(ret, time[i][k] - time[i][j]);\\n }\\n }\\n }\\n if(ret == -1)\\n cout << \\\"impossible\\\" << endl;\\n else\\n cout << ret << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 5228,\n \"score_of_the_acc\": -0.0296,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2042_406444\",\n \"code_snippet\": \"#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\\nint readtime(){\\n\\tint hh,mm; scanf(\\\"%d:%d\\\",&hh,&mm);\\n\\treturn 60*hh+mm;\\n}\\n\\nint main(){\\n\\tfor(int n,m;scanf(\\\"%d%d\\\",&n,&m),n;){\\n\\t\\tint s; scanf(\\\"%d\\\",&s); s--;\\n\\t\\tint s_time=readtime();\\n\\t\\tint g; scanf(\\\"%d\\\",&g); g--;\\n\\t\\tint g_time=readtime();\\n\\n\\t\\tvector< pair<int,int> > seq[100]; // seq[i] := ( 電車 i の運行予定 )\\n\\t\\trep(i,m){\\n\\t\\t\\tint sz; scanf(\\\"%d\\\",&sz);\\n\\t\\t\\tseq[i].resize(sz);\\n\\t\\t\\trep(j,sz){\\n\\t\\t\\t\\tint u; scanf(\\\"%d\\\",&u); u--;\\n\\t\\t\\t\\tseq[i][j]=make_pair(readtime(),u);\\n\\t\\t\\t}\\n\\t\\t\\tsort(seq[i].begin(),seq[i].end());\\n\\t\\t}\\n\\n\\t\\t// train[t][u] := ( 時刻 t に駅 u から発車する電車の情報 )\\n\\t\\tstatic vector< pair<int,int> > train[1440][1000];\\n\\t\\trep(t,1440) rep(u,n) train[t][u].clear();\\n\\t\\trep(i,m){\\n\\t\\t\\trep(j,seq[i].size()){\\n\\t\\t\\t\\tint t=seq[i][j].first;\\n\\t\\t\\t\\tint u=seq[i][j].second;\\n\\t\\t\\t\\ttrain[t][u].push_back(make_pair(i,j));\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tstatic int dp[1440][1000];\\n\\t\\trep(t,1440) rep(u,n) dp[t][u]=-1; // -1 は到達不可能の意味\\n\\t\\tdp[s_time][s]=0;\\n\\t\\trep(t,1439) rep(u,n) if(dp[t][u]!=-1) {\\n\\t\\t\\t dp[t+1][u]=max(dp[t+1][u],dp[t][u]); // 電車に乗らずにその駅で待つ\\n\\t\\t\\t rep(i,train[t][u].size()){ // 電車に乗る\\n\\t\\t\\t\\tint id=train[t][u][i].first;\\n\\t\\t\\t\\tfor(int j=train[t][u][i].second+1;j<seq[id].size();j++){\\n\\t\\t\\t\\t\\tint t_next=seq[id][j].first;\\n\\t\\t\\t\\t\\tint u_next=seq[id][j].second;\\n\\t\\t\\t\\t\\tdp[t_next][u_next]=max(dp[t_next][u_next],max(dp[t][u],t_next-t));\\n\\t\\t\\t\\t}\\n\\t\\t\\t }\\n\\t\\t}\\n\\n\\t\\tint ans=-1;\\n\\t\\trep(t,g_time+1) ans=max(ans,dp[t][g]);\\n\\t\\tif(ans==-1) puts(\\\"impossible\\\");\\n\\t\\telse printf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 720,\n \"memory_kb\": 26000,\n \"score_of_the_acc\": -0.6018,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2042_134158\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <queue>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nclass Edge\\n{\\npublic:\\n\\tint d,i,o;\\n\\tEdge(int d, int i, int o)\\n\\t:d(d),i(i),o(o)\\n\\t{}\\n};\\n\\nclass State\\n{\\npublic:\\n\\tint n,t;\\n\\tState(int n, int t)\\n\\t:n(n),t(t)\\n\\t{}\\n\\t\\n\\tbool operator<(const State& s) const\\n\\t{\\n\\t\\treturn t>s.t;\\n\\t}\\n};\\n\\ntypedef vector<Edge> Edges;\\ntypedef pair<vector<int>, vector<int> > Train;\\n\\nint input()\\n{\\n\\tstring s;\\n\\tcin >> s;\\n\\t\\n\\treturn ((s[0]-'0')*10+(s[1]-'0'))*60+((s[3]-'0')*10+(s[4]-'0'));\\n}\\n\\nint beg[1000], end[1000];\\n\\nint dijk(int S, int st, int lim, vector<Edges>& eg, bool f)\\n{\\n\\tbool v[1000]={0};\\n\\tpriority_queue<State> q;\\n\\tq.push(State(S,st));\\n\\t\\n\\twhile(!q.empty())\\n\\t{\\n\\t\\tState s=q.top(); q.pop();\\n\\t\\tif(s.t>lim) break;\\n\\t\\t\\n\\t\\tif(v[s.n]) continue;\\n\\t\\tv[s.n]=1;\\n\\t\\t\\n\\t\\tif(f) beg[s.n]=s.t;\\n\\t\\telse end[s.n]=-s.t+24*60;\\n\\t\\t\\n\\t\\tfor(int i=0; i<eg[s.n].size(); i++)\\n\\t\\t{\\n\\t\\t\\tEdge e=eg[s.n][i];\\n\\t\\t\\tif(v[e.d]) continue;\\n\\t\\t\\tif(s.t > e.i) continue;\\n\\t\\t\\t\\n\\t\\t\\tq.push(State(e.d, e.o));\\n\\t\\t}\\n\\t}\\n\\t\\n\\treturn -1;\\n}\\n\\nint main()\\n{\\n\\tint S,T;\\n\\twhile(cin >> S >> T, (S||T))\\n\\t{\\n\\t\\tint src,dst,st,dt;\\n\\t\\tcin >> src; st=input();\\n\\t\\tcin >> dst; dt=input();\\n\\t\\t\\n\\t\\tsrc--; dst--;\\n\\t\\t\\n\\t\\tvector<Edges> eg(1000),reg(1000);\\n\\t\\tvector<Train> trains(100);\\n\\t\\t\\n\\t\\tfor(int i=0; i<T; i++)\\n\\t\\t{\\n\\t\\t\\tint N;\\n\\t\\t\\tcin >> N;\\n\\t\\t\\tvector<int> p,t;\\n\\t\\t\\tfor(int j=0; j<N; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint a,b;\\n\\t\\t\\t\\tcin >> a; b=input();\\n\\t\\t\\t\\ta--;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tp.push_back(a);\\n\\t\\t\\t\\tt.push_back(b);\\n\\t\\t\\t}\\n\\t\\t\\ttrains[i]=make_pair(p,t);\\n\\t\\t\\t\\n\\t\\t\\tfor(int j=0; j<N-1; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint s=p[j], d=p[j+1];\\n\\t\\t\\t\\tint a=t[j], b=t[j+1];\\n\\t\\t\\t\\teg[s].push_back(Edge(d,a,b));\\n\\t\\t\\t\\treg[d].push_back(Edge(s,24*60-b, 24*60-a));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int i=0; i<S; i++)\\n\\t\\t{\\n\\t\\t\\tbeg[i]=9999;\\n\\t\\t\\tend[i]=-1;\\n\\t\\t}\\n\\t\\t\\n\\t\\tdijk(src,st,dt,eg,1);\\n\\t dijk(dst,24*60-dt,24*60-st,reg,0);\\n\\t\\t\\n\\t\\tint ret=-1;\\n\\t\\tif(src==dst&&st<=dt) ret=0;\\n\\t\\t\\n\\t\\tfor(int i=0; i<T; i++)\\n\\t\\t{\\n\\t\\t\\tint lo=9999,hi=-1;\\n\\t\\t\\tfor(int j=0; j<trains[i].first.size(); j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint p=trains[i].first[j], t=trains[i].second[j];\\n\\t\\t\\t\\tif(beg[p] <= t) lo=min(j,lo);\\n\\t\\t\\t\\tif(end[p] >= t) hi=max(j,hi);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(lo==9999||hi==-1) continue;\\n\\t\\t\\tret=max(ret, trains[i].second[hi]-trains[i].second[lo]);\\n\\t\\t}\\n\\t\\tif(ret==-1) cout << \\\"impossible\\\" << endl;\\n\\t\\telse cout << ret << endl;\\n\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 430,\n \"memory_kb\": 5292,\n \"score_of_the_acc\": -0.0947,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2042_112020\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\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)\\n#define pb push_back\\n\\nconst int N = 1000;\\nconst int inf =(1<<20);\\nclass Edge{\\npublic:\\n int st,gt;\\n int to;\\n};\\n\\nclass Rail{\\npublic:\\n int p,t;\\n};\\n\\nclass state{\\npublic:\\n int now;\\n int time;\\n bool operator<(const state & a)const{\\n return time > a.time;\\n }\\n bool operator>(const state & a)const{\\n return time < a.time;\\n }\\n};\\n\\n\\nvoid go(int n,int s,int st,vector<Edge> *edge,bool isrev,int *cost){\\n priority_queue<state> Q;\\n priority_queue<state,vector<state>,greater<state> > RQ;\\n if (!isrev)Q.push((state){s,st});\\n else RQ.push((state){s,st});\\n \\n while(!Q.empty() || !RQ.empty()){\\n state now;\\n if (!isrev){\\n now=Q.top(),Q.pop();\\n }else{\\n now = RQ.top(),RQ.pop();\\n }\\n if (cost[now.now] != inf)continue;\\n //if (cost[now.now] == inf)\\n cost[now.now] = now.time;\\n /*\\n else {\\n if (isrev){\\n\\t\\n\\tif (now.time > cost[now.now])exit(1);\\n\\telse continue;\\n }else {\\n\\t//\\tcout << now.now+1 <<\\\" \\\" <<now.time <<\\\" \\\" << cost[now.now] << endl;\\n\\tif (now.time < cost[now.now])exit(1);\\n\\telse continue;\\n }\\n }\\n */\\n rep(i,edge[now.now].size()){\\n if (isrev){\\n\\tif (now.time < edge[now.now][i].st)continue;\\n\\tRQ.push((state){edge[now.now][i].to,edge[now.now][i].gt});\\n }else{\\n\\tif (now.time > edge[now.now][i].st)continue;\\n\\tQ.push((state){ edge[now.now][i].to,edge[now.now][i].gt});\\n }\\n }\\n }\\n}\\n\\nmain(){\\n int n;\\n int line;\\n int scost[N],tcost[N];\\n vector<Edge> edge[N];\\n vector<Edge> rev[N];\\n vector<Rail > in[100]; \\n while(cin>>n>>line && n){\\n rep(i,n)tcost[i]=inf,scost[i]=inf;\\n rep(i,n)edge[i].clear(),rev[i].clear();\\n rep(i,line)in[i].clear();\\n int s,sh,sm,d,dh,dm;\\n char dummy;\\n cin>>s>>sh>>dummy>>sm>> d>>dh>>dummy>>dm;\\n \\n sh=sh*60+sm;\\n dh=dh*60+dm;\\n s--;\\n d--;\\n \\n rep(i,line){\\n int m;\\n cin>>m;\\n rep(j,m){\\n\\tint now,nh,nm;\\n\\tcin>>now>>nh>>dummy>>nm;\\n\\tnow--;\\n\\tnh = nh*60+nm;\\n\\tin[i].push_back((Rail){now,nh});\\n }\\n \\n rep(j,in[i].size()-1){\\n\\tedge[in[i][j ].p].pb((Edge){in[i][j ].t,in[i][j+1].t,in[i][j+1].p});\\n\\trev[ in[i][j+1].p].pb((Edge){in[i][j+1].t,in[i][j ].t,in[i][j ].p});\\n }\\n }\\n \\n\\n go(n,s,sh,edge,false,scost);\\n go(n,d,dh,rev ,true ,tcost);\\n\\n /*\\n cout << \\\"begint\\\"<<endl;\\n cout << n << endl;\\n cout <<\\\"go\\\"<<endl;\\n rep(i,n)cout << scost[i] <<\\\" \\\";cout << endl;\\n cout << \\\"rev \\\" << endl;\\n rep(i,n)cout << tcost[i] <<\\\" \\\";cout << endl;\\n cout << endl;\\n */\\n\\n int ans = -1;\\n if (scost[d] == inf){\\n cout << \\\"impossible\\\"<<endl;\\n continue;\\n }\\n if (s == d && sh <= dh)ans = 0;\\n\\n rep(i,line){\\n int scan=-1,dcan=-1;\\n rep(j,in[i].size()){\\n\\tif (scost[in[i][j].p] == inf)continue;\\n\\tif (scost[in[i][j].p] <= in[i][j].t){\\n\\t scan=j;\\n\\t break;\\n\\t}\\n }\\n \\n for(int j=in[i].size()-1;j>=0 && j >scan;j--){\\n\\tif (tcost[in[i][j].p] == inf)continue;\\n\\tif (tcost[in[i][j].p] >= in[i][j].t){\\n\\t dcan=j;\\n\\t break;\\n\\t}\\n }\\n\\n if (scan == -1 || dcan == -1)continue;\\n\\n ans = max(ans,in[i][dcan].t-in[i][scan].t);\\n }\\n \\n if (ans == -1)cout << \\\"impossible\\\"<<endl;\\n else cout << ans << endl;\\n \\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 5844,\n \"score_of_the_acc\": -0.0897,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":1074,"cells":{"group_id":{"kind":"string","value":"aoj_2046_cpp"},"problem_description":{"kind":"string","value":"Problem H:\nRobot's Crash\nProf. Jenifer A. Gibson is carrying out experiments with many robots. Since those robots are\nexpensive, she wants to avoid their crashes during her experiments at her all effort. So she asked\nyou, her assistant, as follows.\n“Suppose that we have\nn\n(2 ≤\nn\n≤ 100000) robots of the circular shape with the radius of\nr\n,\nand that they are placed on the\nxy\n-plane without overlaps. Each robot starts to move straight\nwith a velocity of either\nv\nor -\nv\nsimultaneously, say, at the time of zero. The robots keep their\nmoving infinitely unless I stop them. I’d like to know in advance if some robots will crash each\nother. The robots crash when their centers get closer than the distance of 2\nr\n. I’d also like to\nknow the time of the first crash, if any, so I can stop the robots before the crash. Well, could\nyou please write a program for this purpose?”\nInput\nThe input consists of multiple datasets. Each dataset has the following format:\nn\nvx vy\nr\nrx\n1\nry\n1\nu\n1\nrx\n2\nry\n2\nu\n2\n...\nrx\nn\nry\nn\nu\nn\nn\nis the number of robots. (\nvx\n,\nvy\n) denotes the vector of the velocity\nv\n.\nr\nis the radius of the\nrobots. (\nrx\ni\n,\nry\ni\n) denotes the coordinates of the center of the\ni\n-th robot.\nu\ni\ndenotes the moving\ndirection of the\ni\n-th robot, where 1 indicates the\ni\n-th robot moves with the velocity (\nvx\n,\nvy\n),\nand -1 indicates (-\nvx\n, -\nvy\n).\nAll the coordinates range from -1200 to 1200. Both\nvx\nand\nvy\nrange from -1 to 1.\nYou may assume all the following hold for any pair of robots:\nthey must not be placed closer than the distance of (2\nr\n+ 10\n-8\n) at the initial state;\nthey must get closer than the distance of (2\nr\n- 10\n-8\n) if they crash each other at some\n point of time; and\nthey must not get closer than the distance of (2\nr\n+ 10\n-8\n) if they don’t crash.\nThe input is terminated by a line that contains a zero. This should not be processed.\nOutput\nFor each dataset, print the first crash time in a line, or “SAFE” if no pair of robots crashes each\nother. Each crash time should be given as a decimal with an arbitrary number of fractional\ndigits, and with an absolute error of at most 10\n-4\n.\nSample Input\n2\n1.0 0.0\n0.5\n0.0 0.0 1\n2.0 0.0 -1\n2\n1.0 0.0\n0.5\n0.0 0.0 -1\n2.0 0.0 1\n0\nOutput for the Sample Input\n0.500000\nSAFE"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2046_8436730","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 1e-12\n\n\n\n\n#define SIZE 100005\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\n\t\tif(fabs(x-p.x) > EPS){\n\n\t\t\treturn x < p.x;\n\t\t}else{\n\n\t\t\treturn y < p.y;\n\t\t}\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\n\tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\n\n\n\nint N,DIR[SIZE];\ndouble baseR;\nPoint point[SIZE];\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\n//点のradを求める関数\ndouble calc_rad(Point p){\n\n\tif(p.y == 0){\n\n\t\tif(p.x > 0){\n\n\t\t\treturn 0;\n\n\t\t}else{ //p.x < 0\n\n\t\t\treturn M_PI;\n\t\t}\n\n\t}else if(p.x == 0){\n\n\t\tif(p.y > 0){\n\n\t\t\treturn M_PI/2.0;\n\t\t}else{\n\n\n\t\t\treturn 3*M_PI/2.0;\n\t\t}\n\n\t}else{\n\n\t\tdouble base = atan(fabs(p.y)/fabs(p.x));\n\n\t\tif(p.x > 0){\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn base;\n\n\t\t\t}else{ //p.y < 0\n\n\t\t\t\treturn 2*M_PI-base;\n\t\t\t}\n\n\t\t}else{ //p.x < 0\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn M_PI-base;\n\n\t\t\t}else{\n\n\t\t\t\treturn base+M_PI;\n\t\t\t}\n\t\t}\n\t}\n}\n\n/*点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\tdouble vx,vy;\n\tscanf(\"%lf %lf %lf\",&vx,&vy,&baseR);\n\n\tdouble rad = calc_rad(Point(vx,vy));\n\n\tdouble V = sqrt(vx*vx + vy*vy); //■正が右向き\n\n\tdouble rx,ry;\n\tPoint center = Point(0,0);\n\n\tvector<pair<double,int>> vec;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %d\",&rx,&ry,&DIR[i]);\n\t\tpoint[i] = rotate(center,Point(rx,ry),-rad);\n\n\t\tvec.push_back(make_pair(point[i].y,i));\n\t}\n\n\tsort(vec.begin(),vec.end()); //y座標の昇順にする\n\n\tset<pair<double,int>> L,R;\n\n\tdouble ans = HUGE_NUM;\n\n\tint IND = 0;\n\n\tfor(int i = 0; i < vec.size(); i++){\n\n\t\tint ind = vec[i].second;\n\t\tdouble y = point[ind].y;\n\n\t\t//衝突の可能性がなくなったロボットを削除\n\t\twhile(IND < i && (y-vec[IND].first) > 2*baseR+EPS){\n\n\t\t\tint tmp_ind = vec[IND].second;\n\t\t\tif(DIR[tmp_ind] == -1){ //左向き\n\n\t\t\t\tauto at = L.lower_bound(make_pair(point[tmp_ind].x-EPS,-1));\n\n\t\t\t\twhile(at != L.end()){\n\n\t\t\t\t\tif(at->second == tmp_ind){\n\t\t\t\t\t\tL.erase(at);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tat++;\n\t\t\t\t}\n\n\t\t\t}else{ //右向き\n\n\t\t\t\tauto at = R.lower_bound(make_pair(point[tmp_ind].x-EPS,-1));\n\n\t\t\t\twhile(at != R.end()){\n\n\t\t\t\t\tif(at->second == tmp_ind){\n\t\t\t\t\t\tR.erase(at);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tat++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tIND++;\n\t\t}\n\n\t\t//■先に登録\n\t\tif(DIR[ind] == -1){\n\n\t\t\tL.insert(make_pair(point[ind].x,ind));\n\n\t\t}else{\n\n\t\t\tR.insert(make_pair(point[ind].x,ind));\n\t\t}\n\n\t\tPoint a,b;\n\t\tif(DIR[ind] == 1){\n\n\t\t\tauto at = L.lower_bound(make_pair(point[ind].x-EPS,-1));\n\t\t\tif(at == L.end()){\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\ta = point[ind];\n\t\t\tb = point[at->second];\n\n\t\t}else{\n\n\t\t\tauto at = R.lower_bound(make_pair(point[ind].x-EPS,-1));\n\t\t\tif(at == R.begin()){\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tat--;\n\n\t\t\ta = point[at->second];\n\t\t\tb = point[ind];\n\t\t}\n\n\t\tdouble A = 4*V*V;\n\t\tdouble B = 4*(a.x-b.x)*V;\n\t\tdouble C = a.x*a.x - 2*a.x*b.x + b.x*b.x - (4*baseR*baseR-(a.y-b.y)*(a.y-b.y));\n\n\t\tdouble D = B*B-4*A*C;\n\t\tif(D+EPS < 0){\n\n\t\t\tcontinue; //解なし\n\t\t}\n\n\t\tdouble t1 = (-B+sqrt(D))/(2*A);\n\t\tif(t1 > EPS){\n\n\t\t\tchmin(ans,t1);\n\t\t}\n\n\t\tdouble t2 = (-B-sqrt(D))/(2*A);\n\t\tif(t2 > EPS){\n\n\t\t\tchmin(ans,t2);\n\t\t}\n\t}\n\n\tif(fabs(ans-HUGE_NUM) < EPS){\n\n\t\tprintf(\"SAFE\\n\");\n\n\t}else{\n\n\t\tprintf(\"%.10lf\\n\",ans);\n\t}\n}\n\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":200,"memory_kb":13616,"score_of_the_acc":-0.8392,"final_rank":3},{"submission_id":"aoj_2046_8436722","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 1e-12\n\n\n\n\n#define SIZE 100005\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\n\t\tif(fabs(x-p.x) > EPS){\n\n\t\t\treturn x < p.x;\n\t\t}else{\n\n\t\t\treturn y < p.y;\n\t\t}\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\n\tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\n\n\n\nint N,DIR[SIZE];\ndouble baseR;\nPoint point[SIZE];\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\n//点のradを求める関数\ndouble calc_rad(Point p){\n\n\tif(p.y == 0){\n\n\t\tif(p.x > 0){\n\n\t\t\treturn 0;\n\n\t\t}else{ //p.x < 0\n\n\t\t\treturn M_PI;\n\t\t}\n\n\t}else if(p.x == 0){\n\n\t\tif(p.y > 0){\n\n\t\t\treturn M_PI/2.0;\n\t\t}else{\n\n\n\t\t\treturn 3*M_PI/2.0;\n\t\t}\n\n\t}else{\n\n\t\tdouble base = atan(fabs(p.y)/fabs(p.x));\n\n\t\tif(p.x > 0){\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn base;\n\n\t\t\t}else{ //p.y < 0\n\n\t\t\t\treturn 2*M_PI-base;\n\t\t\t}\n\n\t\t}else{ //p.x < 0\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn M_PI-base;\n\n\t\t\t}else{\n\n\t\t\t\treturn base+M_PI;\n\t\t\t}\n\t\t}\n\t}\n}\n\n/*点moveをbaseを中心にradラジアン回転させる\nrad > 0なら反時計回り、rad < 0なら時計周り\n*/\nPoint rotate(Point base,Point move,double rad){\n\n\tPoint ret;\n\tmove = move-base;\n\n\tret.x = move.x*cos(rad)-move.y*sin(rad);\n\tret.y = move.x*sin(rad)+move.y*cos(rad);\n\n\tret = ret+base;\n\n\treturn ret;\n}\n\n\nbool DEBUG = false;\n\nvoid func(){\n\n\tdouble vx,vy;\n\tscanf(\"%lf %lf %lf\",&vx,&vy,&baseR);\n\n\tdouble rad = calc_rad(Point(vx,vy));\n\n\tif(DEBUG){\n\n\t\tprintf(\"rad:%.3lf\",rad);\n\t}\n\n\tdouble V = sqrt(vx*vx + vy*vy); //■正が右向き\n\n\n\tdouble rx,ry;\n\tPoint center = Point(0,0);\n\n\tvector<pair<double,int>> vec;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %d\",&rx,&ry,&DIR[i]);\n\t\tpoint[i] = rotate(center,Point(rx,ry),-rad);\n\n\t\tif(DEBUG){\n\n\t\t\tprintf(\"点%d \",i);\n\t\t\tpoint[i].debug();\n\t\t}\n\n\t\tvec.push_back(make_pair(point[i].y,i));\n\t}\n\n\tsort(vec.begin(),vec.end()); //y座標の昇順にする\n\n\tset<pair<double,int>> L,R;\n\n\tdouble ans = HUGE_NUM;\n\n\tint IND = 0;\n\n\tfor(int i = 0; i < vec.size(); i++){\n\n\t\tint ind = vec[i].second;\n\t\tdouble y = point[ind].y;\n\n\t\t//衝突の可能性がなくなったロボットを削除\n\t\twhile(IND < i && (y-vec[IND].first) > 2*baseR+EPS){\n\n\t\t\tint tmp_ind = vec[IND].second;\n\t\t\tif(DIR[tmp_ind] == -1){ //左向き\n\n\t\t\t\tauto at = L.lower_bound(make_pair(point[tmp_ind].x-EPS,-1));\n\n\t\t\t\twhile(at != L.end()){\n\n\t\t\t\t\tif(at->second == tmp_ind){\n\t\t\t\t\t\tL.erase(at);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tat++;\n\t\t\t\t}\n\n\t\t\t}else{ //右向き\n\n\t\t\t\tauto at = R.lower_bound(make_pair(point[tmp_ind].x-EPS,-1));\n\n\t\t\t\twhile(at != R.end()){\n\n\t\t\t\t\tif(at->second == tmp_ind){\n\t\t\t\t\t\tR.erase(at);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tat++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tIND++;\n\t\t}\n\n\t\t//■先に登録\n\t\tif(DIR[ind] == -1){\n\n\t\t\tL.insert(make_pair(point[ind].x,ind));\n\n\t\t}else{\n\n\t\t\tR.insert(make_pair(point[ind].x,ind));\n\t\t}\n\n\t\tPoint a,b;\n\t\tif(DIR[ind] == 1){\n\n\t\t\tauto at = L.lower_bound(make_pair(point[ind].x-EPS,-1));\n\t\t\tif(at == L.end()){\n\t\t\t\tif(DEBUG){\n\n\t\t\t\t\tprintf(\"左向きなし\\n\");\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\ta = point[ind];\n\t\t\tb = point[at->second];\n\n\t\t}else{\n\n\t\t\tauto at = R.lower_bound(make_pair(point[ind].x-EPS,-1));\n\t\t\tif(at == R.begin()){\n\t\t\t\tif(DEBUG){\n\n\t\t\t\t\tprintf(\"右向きなし\\n\");\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tat--;\n\n\t\t\ta = point[at->second];\n\t\t\tb = point[ind];\n\t\t}\n\n\t\tdouble A = 4*V*V;\n\t\tdouble B = 4*(a.x-b.x)*V;\n\t\tdouble C = a.x*a.x - 2*a.x*b.x + b.x*b.x - (4*baseR*baseR-(a.y-b.y)*(a.y-b.y));\n\n\t\tdouble D = B*B-4*A*C;\n\t\tif(D+EPS < 0){\n\t\t\tif(DEBUG){\n\n\t\t\t\tprintf(\"解なし\\n\");\n\t\t\t}\n\n\t\t\tcontinue; //解なし\n\t\t}\n\n\t\tdouble t1 = (-B+sqrt(D))/(2*A);\n\t\tif(t1 > EPS){\n\n\t\t\tchmin(ans,t1);\n\t\t}\n\n\t\tdouble t2 = (-B-sqrt(D))/(2*A);\n\t\tif(t2 > EPS){\n\n\t\t\tchmin(ans,t2);\n\t\t}\n\t}\n\n\tif(fabs(ans-HUGE_NUM) < EPS){\n\n\t\tprintf(\"SAFE\\n\");\n\n\t}else{\n\n\t\tprintf(\"%.10lf\\n\",ans);\n\t}\n}\n\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":200,"memory_kb":13672,"score_of_the_acc":-0.8435,"final_rank":4},{"submission_id":"aoj_2046_1363835","code_snippet":"#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\n\nconst double INF = 1e70;\n\n/* typedef */\n\ntemplate <typename T>\nstruct Pt {\n T x, y;\n\n Pt() {}\n Pt(T _x, T _y) : x(_x), y(_y) {}\n Pt(const Pt& pt) : x(pt.x), y(pt.y) {}\n\n bool operator==(const Pt pt) const { return x == pt.x && y == pt.y; }\n Pt<T> operator+(const Pt pt) const { return Pt<T>(x + pt.x, y + pt.y); }\n Pt<T> operator-() const { return Pt<T>(-x, -y); }\n Pt<T> operator-(const Pt pt) const { return Pt<T>(x - pt.x, y - pt.y); }\n Pt<T> operator*(T t) const { return Pt<T>(x * t, y * t); }\n Pt<T> operator/(T t) const { return Pt<T>(x / t, y / t); }\n T dot(Pt v) const { return x * v.x + y * v.y; }\n T cross(Pt v) const { return x * v.y - y * v.x; }\n Pt<T> mid(const Pt pt) { return Pt<T>((x + pt.x) / 2, (y + pt.y) / 2); }\n T d2() { return x * x + y * y; }\n double d() { return sqrt(d2()); }\n\n Pt<T> rot(double th) {\n double c = cos(th), s = sin(th);\n return Pt<T>(c * x - s * y, s * x + c * y);\n }\n\n bool operator<(const Pt& pt) const {\n return x < pt.x || (x == pt.x && y < pt.y);\n }\n\n void print(string format) {\n printf((\"(\" + format + \", \" + format + \")\\n\").c_str(), x, y);\n }\n void print() { print(\"%.6lf\"); }\n};\n\ntypedef Pt<double> pt;\n\nstruct Robot {\n pt p;\n int drc;\n Robot() {}\n Robot(pt _p, int _drc) : p(_p), drc(_drc) {}\n bool operator<(const Robot& r0) const { return p.x < r0.p.x; }\n};\n\ntypedef set<Robot> srbt;\n\n/* global variables */\n\nint n;\npt v;\ndouble r;\nRobot rbts[MAX_N];\n\n/* subroutines */\n\nbool lessy(const Robot& r0, const Robot& r1) { return r0.p.y < r1.p.y; }\n\n/* main */\n\nint main() {\n for (;;) {\n cin >> n;\n if (n == 0) break;\n\n cin >> v.x >> v.y >> r;\n\n double th = -atan2(v.y, v.x);\n pt v0 = v.rot(th);\n //v0.print(); printf(\"th=%.6lf\\n\", th);\n\n double rr = r * 2;\n double dvx = v0.x * 2;\n \n for (int i = 0; i < n; i++) {\n pt p;\n cin >> p.x >> p.y >> rbts[i].drc;\n rbts[i].p = p.rot(th);\n }\n sort(rbts, rbts + n, lessy);\n \n double min_t = INF;\n srbt srl, srr;\n \n for (int i0 = 0, i1 = 0; i1 < n; i1++) {\n Robot& r1 = rbts[i1];\n\n while (i0 < i1 && r1.p.y - rbts[i0].p.y > rr) {\n\tif (rbts[i0].drc > 0) srl.erase(rbts[i0]);\n\telse srr.erase(rbts[i0]);\n\ti0++;\n }\n \n if (r1.drc < 0) {\n\tif (! srl.empty()) {\n\t srbt::iterator rit = srl.lower_bound(r1);\n\t if (rit != srl.begin()) {\n\t rit--;\n\t pt dp = r1.p - rit->p;\n\t double t = (dp.x - sqrt(rr * rr - dp.y * dp.y)) / dvx;\n\t if (min_t > t) min_t = t;\n\t }\n\t}\n\n\tsrr.insert(r1);\n }\n else {\n\tif (! srr.empty()) {\n\t srbt::iterator rit = srr.lower_bound(r1);\n\t if (rit != srr.end()) {\n\t pt dp = rit->p - r1.p;\n\t double t = (dp.x - sqrt(rr * rr - dp.y * dp.y)) / dvx;\n\t if (min_t > t) min_t = t;\n\t }\n\t}\n\n\tsrl.insert(r1);\n }\n }\n\n if (min_t >= INF)\n cout << \"SAFE\" << endl;\n else \n printf(\"%.6lf\\n\", min_t);\n }\n\n return 0;\n}","accuracy":1,"time_ms":650,"memory_kb":9948,"score_of_the_acc":-0.7291,"final_rank":2},{"submission_id":"aoj_2046_815880","code_snippet":"#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\n\nusing namespace std;\n\ntypedef complex<double> Point;\nnamespace std{\n bool operator < (const Point& p1, const Point& p2){\n if(p1.real() != p2.real()) return p1.real() < p2.real();\n return p1.imag() < p2.imag();\n }\n};\nstruct Event{\n double y;\n Point p;\n int p_type;\n int e_type;\n Event(double y, Point p, int p_type, int e_type) : \n y(y), p(p), p_type(p_type), e_type(e_type) {}\n bool operator < (const Event& e) const{\n if(y != e.y) return y < e.y;\n if(e_type != e.e_type) return e_type > e.e_type; // delete is first ???\n return p < e.p;\n }\n};\n\n\ndouble get_time(Point p, Point q, double R, double v){\n double dx = abs(p.real() - q.real());\n double dy = abs(p.imag() - q.imag());\n if(!(2 * R >= dy)) return 1e16;\n assert(2 * R >= dy);\n double b = sqrt(4 * R * R - dy * dy);\n assert(dx - b >= 0);\n return (dx - b) / v;\n}\n\nvoid update(double& ans, vector<Point>& pset, Point p, double R, double v, int t){\n int k = lower_bound(pset.begin(), pset.end(), p) - pset.begin();\n for(int dk = -1; dk <= 1; dk++) if(k + dk >= 0 && k + dk < pset.size()){\n if(t == 0 && p.real() < pset[k + dk].real()){\n ans = min(ans, get_time(p, pset[k + dk], R, v));\n }else if(t == 1 && p.real() > pset[k + dk].real()){\n ans = min(ans, get_time(p, pset[k + dk], R, v));\n }\n }\n}\n\nint main(){\n int N;\n while(cin >> N && N){\n double vx, vy;\n cin >> vx >> vy;\n vx *= 2; vy *= 2;\n double th = arg(Point(vx, vy));\n double v = sqrt(vx * vx + vy * vy);\n double R;\n cin >> R;\n\n vector<Event> events;\n\n REP(i, N){\n double x, y;\n int u;\n cin >> x >> y >> u;\n Point p(x, y);\n p = p * polar(1.0, -th);\n if(u == 1){\n events.push_back(Event(p.imag() - R, p, 0, 0));\n events.push_back(Event(p.imag() + R, p, 0, 1));\n }else{\n events.push_back(Event(p.imag() - R, p, 1, 0));\n events.push_back(Event(p.imag() + R, p, 1, 1));\n }\n }\n\n sort(events.begin(), events.end());\n\n vector<Point> point_set[2];\n double ans = 1e16;\n for(int i = 0; i < events.size(); i++){\n Event e = events[i];\n //cout << e.p << \" \" << e.e_type << \" \" << e.p_type << endl;\n vector<Point>& my_set = point_set[e.p_type];\n vector<Point>& you_set = point_set[e.p_type ^ 1];\n if(e.e_type == 0){\n my_set.insert(lower_bound(my_set.begin(), my_set.end(), e.p), e.p);\n update(ans, you_set, e.p, R, v, e.p_type);\n }else if(e.e_type == 1){\n my_set.erase(lower_bound(my_set.begin(), my_set.end(), e.p));\n int k = lower_bound(you_set.begin(), you_set.end(), e.p) - you_set.begin();\n for(int dk = -1; dk <= 1; dk ++) if(k + dk >= 0 && k + dk < you_set.size()){\n update(ans, my_set, you_set[k], R, v, e.p_type ^ 1);\n }\n }\n }\n if(ans >= 1e16){\n puts(\"SAFE\");\n }else{\n printf(\"%.6f\\n\", ans);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":2760,"memory_kb":15680,"score_of_the_acc":-2,"final_rank":5},{"submission_id":"aoj_2046_406661","code_snippet":"#include<set>\n#include<cmath>\n#include<cstdio>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nconst double INF=1e77;\nconst double PI=acos(-1);\n\ntemplate<class T>\nstruct point{ T x,y; };\n\ntemplate<class T>\ndouble abs(const point<T> &a){ return sqrt(a.x*a.x+a.y*a.y); }\n\ntemplate<class T>\ndouble arg(const point<T> &a,const point<T> &b){\n\tdouble ta=atan2(a.y,a.x);\n\tdouble tb=atan2(b.y,b.x);\n\treturn tb-ta<0 ? tb-ta+2*PI : tb-ta;\n}\n\npoint<double> rot(const point<double> &a,double theta){\n\treturn (point<double>){a.x*cos(theta)-a.y*sin(theta),a.x*sin(theta)+a.y*cos(theta)};\n}\n\nstruct robot{\n\tpoint<double> p; // 位置\n\tint dir; // 移動方向 (+1 or -1)\n\tbool operator<(const robot &Z)const{ return p.x<Z.p.x; }\n};\n\n// 速さ v で動くロボット A, B が衝突するときの時刻\ndouble f(const robot &A,const robot &B,double r,double v){\n\tdouble w=abs(A.p.x-B.p.x);\n\tdouble h=sqrt(4*r*r-w*w);\n\treturn (abs(A.p.y-B.p.y)-h)/(2*v);\n}\n\nint main(){\n\tfor(int n;scanf(\"%d\",&n),n;){\n\t\tpoint<double> v;\n\t\tdouble r; scanf(\"%lf%lf%lf\",&v.x,&v.y,&r);\n\t\tdouble v_abs=abs(v);\n\n\t\tstatic robot Z[100000];\n\t\trep(i,n) scanf(\"%lf%lf%d\",&Z[i].p.x,&Z[i].p.y,&Z[i].dir);\n\n\t\t// y 軸の +/- 方向に移動するように座標を取り替える\n\t\tdouble theta=-arg((point<double>){0,1},v);\n\t\tv=rot(v,theta);\n\t\trep(i,n) Z[i].p=rot(Z[i].p,theta);\n\n\t\tsort(Z,Z+n);\n\n\t\tdouble ans=INF;\n\t\t// S_u : 上方向に動くロボットの集合\n\t\t// S_d : 下方向に動くロボットの集合\n\t\t// double をそのまま比較しているけど、誤差が出るような演算はしていないので大丈夫\n\t\tset< pair<double,int> > S_u,S_d;\n\t\tfor(int i=0,j=0;i<n;i++){\n\t\t\t// x 方向に離れすぎてロボット i とぶつかれなくなったロボットを削除\n\t\t\twhile(j<i && Z[i].p.x-Z[j].p.x>2*r){\n\t\t\t\tif(Z[j].dir==1) S_u.erase(make_pair(Z[j].p.y,j));\n\t\t\t\telse S_d.erase(make_pair(Z[j].p.y,j));\n\t\t\t\tj++;\n\t\t\t}\n\n\t\t\tset< pair<double,int> >::iterator it;\n\t\t\t// ロボット i は上方向に動く\n\t\t\tif(Z[i].dir==1){\n\t\t\t\tif(!S_d.empty()){\n\t\t\t\t\tit=S_d.lower_bound(make_pair(Z[i].p.y,-1));\n\t\t\t\t\tif(it!=S_d.end()){\n\t\t\t\t\t\tint k=it->second;\n\t\t\t\t\t\tans=min(ans,f(Z[i],Z[k],r,v_abs));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t// ロボット i は下方向に動く\n\t\t\telse{\n\t\t\t\tif(!S_u.empty()){\n\t\t\t\t\tit=S_u.lower_bound(make_pair(Z[i].p.y,-1));\n\t\t\t\t\tif(it!=S_u.begin()){\n\t\t\t\t\t\t--it;\n\t\t\t\t\t\tint k=it->second;\n\t\t\t\t\t\tans=min(ans,f(Z[i],Z[k],r,v_abs));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(Z[i].dir==1) S_u.insert(make_pair(Z[i].p.y,i));\n\t\t\telse S_d.insert(make_pair(Z[i].p.y,i));\n\t\t}\n\n\t\tif(ans>INF/2) puts(\"SAFE\");\n\t\telse printf(\"%.9f\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":550,"memory_kb":2848,"score_of_the_acc":-0.1367,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2046_8436730\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define chmin(x,y) x = min(x,y)\\n#define chmax(x,y) x = max(x,y)\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define EPS 1e-12\\n\\n\\n\\n\\n#define SIZE 100005\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\n\\t\\tif(fabs(x-p.x) > EPS){\\n\\n\\t\\t\\treturn x < p.x;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn y < p.y;\\n\\t\\t}\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n\\t}\\n\\n\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)\\\\n\\\",x,y);\\n\\t}\\n\\n\\tdouble x,y;\\n};\\n\\ntypedef Point Vector;\\n\\n\\n\\nint N,DIR[SIZE];\\ndouble baseR;\\nPoint point[SIZE];\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\nstatic const int COUNTER_CLOCKWISE = 1;\\nstatic const int CLOCKWISE = -1;\\nstatic const int ONLINE_BACK = 2;\\nstatic const int ONLINE_FRONT = -2;\\nstatic const int ON_SEGMENT = 0;\\n\\n/*\\n * p0を基準点として、p1から見てp2が\\n * 反時計回り側にあれば\\n * COUNTER_CLOCKWISE\\n * */\\nint ccw(Point p0,Point p1,Point p2){\\n\\n\\tVector a = p1 - p0;\\n\\tVector b = p2 - p0;\\n\\n\\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\n//点のradを求める関数\\ndouble calc_rad(Point p){\\n\\n\\tif(p.y == 0){\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\treturn M_PI;\\n\\t\\t}\\n\\n\\t}else if(p.x == 0){\\n\\n\\t\\tif(p.y > 0){\\n\\n\\t\\t\\treturn M_PI/2.0;\\n\\t\\t}else{\\n\\n\\n\\t\\t\\treturn 3*M_PI/2.0;\\n\\t\\t}\\n\\n\\t}else{\\n\\n\\t\\tdouble base = atan(fabs(p.y)/fabs(p.x));\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn base;\\n\\n\\t\\t\\t}else{ //p.y < 0\\n\\n\\t\\t\\t\\treturn 2*M_PI-base;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn M_PI-base;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\treturn base+M_PI;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n/*点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\\tdouble vx,vy;\\n\\tscanf(\\\"%lf %lf %lf\\\",&vx,&vy,&baseR);\\n\\n\\tdouble rad = calc_rad(Point(vx,vy));\\n\\n\\tdouble V = sqrt(vx*vx + vy*vy); //■正が右向き\\n\\n\\tdouble rx,ry;\\n\\tPoint center = Point(0,0);\\n\\n\\tvector<pair<double,int>> vec;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %d\\\",&rx,&ry,&DIR[i]);\\n\\t\\tpoint[i] = rotate(center,Point(rx,ry),-rad);\\n\\n\\t\\tvec.push_back(make_pair(point[i].y,i));\\n\\t}\\n\\n\\tsort(vec.begin(),vec.end()); //y座標の昇順にする\\n\\n\\tset<pair<double,int>> L,R;\\n\\n\\tdouble ans = HUGE_NUM;\\n\\n\\tint IND = 0;\\n\\n\\tfor(int i = 0; i < vec.size(); i++){\\n\\n\\t\\tint ind = vec[i].second;\\n\\t\\tdouble y = point[ind].y;\\n\\n\\t\\t//衝突の可能性がなくなったロボットを削除\\n\\t\\twhile(IND < i && (y-vec[IND].first) > 2*baseR+EPS){\\n\\n\\t\\t\\tint tmp_ind = vec[IND].second;\\n\\t\\t\\tif(DIR[tmp_ind] == -1){ //左向き\\n\\n\\t\\t\\t\\tauto at = L.lower_bound(make_pair(point[tmp_ind].x-EPS,-1));\\n\\n\\t\\t\\t\\twhile(at != L.end()){\\n\\n\\t\\t\\t\\t\\tif(at->second == tmp_ind){\\n\\t\\t\\t\\t\\t\\tL.erase(at);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tat++;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{ //右向き\\n\\n\\t\\t\\t\\tauto at = R.lower_bound(make_pair(point[tmp_ind].x-EPS,-1));\\n\\n\\t\\t\\t\\twhile(at != R.end()){\\n\\n\\t\\t\\t\\t\\tif(at->second == tmp_ind){\\n\\t\\t\\t\\t\\t\\tR.erase(at);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tat++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tIND++;\\n\\t\\t}\\n\\n\\t\\t//■先に登録\\n\\t\\tif(DIR[ind] == -1){\\n\\n\\t\\t\\tL.insert(make_pair(point[ind].x,ind));\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tR.insert(make_pair(point[ind].x,ind));\\n\\t\\t}\\n\\n\\t\\tPoint a,b;\\n\\t\\tif(DIR[ind] == 1){\\n\\n\\t\\t\\tauto at = L.lower_bound(make_pair(point[ind].x-EPS,-1));\\n\\t\\t\\tif(at == L.end()){\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\ta = point[ind];\\n\\t\\t\\tb = point[at->second];\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tauto at = R.lower_bound(make_pair(point[ind].x-EPS,-1));\\n\\t\\t\\tif(at == R.begin()){\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tat--;\\n\\n\\t\\t\\ta = point[at->second];\\n\\t\\t\\tb = point[ind];\\n\\t\\t}\\n\\n\\t\\tdouble A = 4*V*V;\\n\\t\\tdouble B = 4*(a.x-b.x)*V;\\n\\t\\tdouble C = a.x*a.x - 2*a.x*b.x + b.x*b.x - (4*baseR*baseR-(a.y-b.y)*(a.y-b.y));\\n\\n\\t\\tdouble D = B*B-4*A*C;\\n\\t\\tif(D+EPS < 0){\\n\\n\\t\\t\\tcontinue; //解なし\\n\\t\\t}\\n\\n\\t\\tdouble t1 = (-B+sqrt(D))/(2*A);\\n\\t\\tif(t1 > EPS){\\n\\n\\t\\t\\tchmin(ans,t1);\\n\\t\\t}\\n\\n\\t\\tdouble t2 = (-B-sqrt(D))/(2*A);\\n\\t\\tif(t2 > EPS){\\n\\n\\t\\t\\tchmin(ans,t2);\\n\\t\\t}\\n\\t}\\n\\n\\tif(fabs(ans-HUGE_NUM) < EPS){\\n\\n\\t\\tprintf(\\\"SAFE\\\\n\\\");\\n\\n\\t}else{\\n\\n\\t\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 13616,\n \"score_of_the_acc\": -0.8392,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2046_8436722\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define chmin(x,y) x = min(x,y)\\n#define chmax(x,y) x = max(x,y)\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define EPS 1e-12\\n\\n\\n\\n\\n#define SIZE 100005\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\n\\t\\tif(fabs(x-p.x) > EPS){\\n\\n\\t\\t\\treturn x < p.x;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn y < p.y;\\n\\t\\t}\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n\\t}\\n\\n\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)\\\\n\\\",x,y);\\n\\t}\\n\\n\\tdouble x,y;\\n};\\n\\ntypedef Point Vector;\\n\\n\\n\\nint N,DIR[SIZE];\\ndouble baseR;\\nPoint point[SIZE];\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\nstatic const int COUNTER_CLOCKWISE = 1;\\nstatic const int CLOCKWISE = -1;\\nstatic const int ONLINE_BACK = 2;\\nstatic const int ONLINE_FRONT = -2;\\nstatic const int ON_SEGMENT = 0;\\n\\n/*\\n * p0を基準点として、p1から見てp2が\\n * 反時計回り側にあれば\\n * COUNTER_CLOCKWISE\\n * */\\nint ccw(Point p0,Point p1,Point p2){\\n\\n\\tVector a = p1 - p0;\\n\\tVector b = p2 - p0;\\n\\n\\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\n//点のradを求める関数\\ndouble calc_rad(Point p){\\n\\n\\tif(p.y == 0){\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\treturn M_PI;\\n\\t\\t}\\n\\n\\t}else if(p.x == 0){\\n\\n\\t\\tif(p.y > 0){\\n\\n\\t\\t\\treturn M_PI/2.0;\\n\\t\\t}else{\\n\\n\\n\\t\\t\\treturn 3*M_PI/2.0;\\n\\t\\t}\\n\\n\\t}else{\\n\\n\\t\\tdouble base = atan(fabs(p.y)/fabs(p.x));\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn base;\\n\\n\\t\\t\\t}else{ //p.y < 0\\n\\n\\t\\t\\t\\treturn 2*M_PI-base;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn M_PI-base;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\treturn base+M_PI;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n/*点moveをbaseを中心にradラジアン回転させる\\nrad > 0なら反時計回り、rad < 0なら時計周り\\n*/\\nPoint rotate(Point base,Point move,double rad){\\n\\n\\tPoint ret;\\n\\tmove = move-base;\\n\\n\\tret.x = move.x*cos(rad)-move.y*sin(rad);\\n\\tret.y = move.x*sin(rad)+move.y*cos(rad);\\n\\n\\tret = ret+base;\\n\\n\\treturn ret;\\n}\\n\\n\\nbool DEBUG = false;\\n\\nvoid func(){\\n\\n\\tdouble vx,vy;\\n\\tscanf(\\\"%lf %lf %lf\\\",&vx,&vy,&baseR);\\n\\n\\tdouble rad = calc_rad(Point(vx,vy));\\n\\n\\tif(DEBUG){\\n\\n\\t\\tprintf(\\\"rad:%.3lf\\\",rad);\\n\\t}\\n\\n\\tdouble V = sqrt(vx*vx + vy*vy); //■正が右向き\\n\\n\\n\\tdouble rx,ry;\\n\\tPoint center = Point(0,0);\\n\\n\\tvector<pair<double,int>> vec;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %d\\\",&rx,&ry,&DIR[i]);\\n\\t\\tpoint[i] = rotate(center,Point(rx,ry),-rad);\\n\\n\\t\\tif(DEBUG){\\n\\n\\t\\t\\tprintf(\\\"点%d \\\",i);\\n\\t\\t\\tpoint[i].debug();\\n\\t\\t}\\n\\n\\t\\tvec.push_back(make_pair(point[i].y,i));\\n\\t}\\n\\n\\tsort(vec.begin(),vec.end()); //y座標の昇順にする\\n\\n\\tset<pair<double,int>> L,R;\\n\\n\\tdouble ans = HUGE_NUM;\\n\\n\\tint IND = 0;\\n\\n\\tfor(int i = 0; i < vec.size(); i++){\\n\\n\\t\\tint ind = vec[i].second;\\n\\t\\tdouble y = point[ind].y;\\n\\n\\t\\t//衝突の可能性がなくなったロボットを削除\\n\\t\\twhile(IND < i && (y-vec[IND].first) > 2*baseR+EPS){\\n\\n\\t\\t\\tint tmp_ind = vec[IND].second;\\n\\t\\t\\tif(DIR[tmp_ind] == -1){ //左向き\\n\\n\\t\\t\\t\\tauto at = L.lower_bound(make_pair(point[tmp_ind].x-EPS,-1));\\n\\n\\t\\t\\t\\twhile(at != L.end()){\\n\\n\\t\\t\\t\\t\\tif(at->second == tmp_ind){\\n\\t\\t\\t\\t\\t\\tL.erase(at);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tat++;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{ //右向き\\n\\n\\t\\t\\t\\tauto at = R.lower_bound(make_pair(point[tmp_ind].x-EPS,-1));\\n\\n\\t\\t\\t\\twhile(at != R.end()){\\n\\n\\t\\t\\t\\t\\tif(at->second == tmp_ind){\\n\\t\\t\\t\\t\\t\\tR.erase(at);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tat++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tIND++;\\n\\t\\t}\\n\\n\\t\\t//■先に登録\\n\\t\\tif(DIR[ind] == -1){\\n\\n\\t\\t\\tL.insert(make_pair(point[ind].x,ind));\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tR.insert(make_pair(point[ind].x,ind));\\n\\t\\t}\\n\\n\\t\\tPoint a,b;\\n\\t\\tif(DIR[ind] == 1){\\n\\n\\t\\t\\tauto at = L.lower_bound(make_pair(point[ind].x-EPS,-1));\\n\\t\\t\\tif(at == L.end()){\\n\\t\\t\\t\\tif(DEBUG){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"左向きなし\\\\n\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\ta = point[ind];\\n\\t\\t\\tb = point[at->second];\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tauto at = R.lower_bound(make_pair(point[ind].x-EPS,-1));\\n\\t\\t\\tif(at == R.begin()){\\n\\t\\t\\t\\tif(DEBUG){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"右向きなし\\\\n\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tat--;\\n\\n\\t\\t\\ta = point[at->second];\\n\\t\\t\\tb = point[ind];\\n\\t\\t}\\n\\n\\t\\tdouble A = 4*V*V;\\n\\t\\tdouble B = 4*(a.x-b.x)*V;\\n\\t\\tdouble C = a.x*a.x - 2*a.x*b.x + b.x*b.x - (4*baseR*baseR-(a.y-b.y)*(a.y-b.y));\\n\\n\\t\\tdouble D = B*B-4*A*C;\\n\\t\\tif(D+EPS < 0){\\n\\t\\t\\tif(DEBUG){\\n\\n\\t\\t\\t\\tprintf(\\\"解なし\\\\n\\\");\\n\\t\\t\\t}\\n\\n\\t\\t\\tcontinue; //解なし\\n\\t\\t}\\n\\n\\t\\tdouble t1 = (-B+sqrt(D))/(2*A);\\n\\t\\tif(t1 > EPS){\\n\\n\\t\\t\\tchmin(ans,t1);\\n\\t\\t}\\n\\n\\t\\tdouble t2 = (-B-sqrt(D))/(2*A);\\n\\t\\tif(t2 > EPS){\\n\\n\\t\\t\\tchmin(ans,t2);\\n\\t\\t}\\n\\t}\\n\\n\\tif(fabs(ans-HUGE_NUM) < EPS){\\n\\n\\t\\tprintf(\\\"SAFE\\\\n\\\");\\n\\n\\t}else{\\n\\n\\t\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 13672,\n \"score_of_the_acc\": -0.8435,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2046_1363835\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 100000;\\n\\nconst double INF = 1e70;\\n\\n/* typedef */\\n\\ntemplate <typename T>\\nstruct Pt {\\n T x, y;\\n\\n Pt() {}\\n Pt(T _x, T _y) : x(_x), y(_y) {}\\n Pt(const Pt& pt) : x(pt.x), y(pt.y) {}\\n\\n bool operator==(const Pt pt) const { return x == pt.x && y == pt.y; }\\n Pt<T> operator+(const Pt pt) const { return Pt<T>(x + pt.x, y + pt.y); }\\n Pt<T> operator-() const { return Pt<T>(-x, -y); }\\n Pt<T> operator-(const Pt pt) const { return Pt<T>(x - pt.x, y - pt.y); }\\n Pt<T> operator*(T t) const { return Pt<T>(x * t, y * t); }\\n Pt<T> operator/(T t) const { return Pt<T>(x / t, y / t); }\\n T dot(Pt v) const { return x * v.x + y * v.y; }\\n T cross(Pt v) const { return x * v.y - y * v.x; }\\n Pt<T> mid(const Pt pt) { return Pt<T>((x + pt.x) / 2, (y + pt.y) / 2); }\\n T d2() { return x * x + y * y; }\\n double d() { return sqrt(d2()); }\\n\\n Pt<T> rot(double th) {\\n double c = cos(th), s = sin(th);\\n return Pt<T>(c * x - s * y, s * x + c * y);\\n }\\n\\n bool operator<(const Pt& pt) const {\\n return x < pt.x || (x == pt.x && y < pt.y);\\n }\\n\\n void print(string format) {\\n printf((\\\"(\\\" + format + \\\", \\\" + format + \\\")\\\\n\\\").c_str(), x, y);\\n }\\n void print() { print(\\\"%.6lf\\\"); }\\n};\\n\\ntypedef Pt<double> pt;\\n\\nstruct Robot {\\n pt p;\\n int drc;\\n Robot() {}\\n Robot(pt _p, int _drc) : p(_p), drc(_drc) {}\\n bool operator<(const Robot& r0) const { return p.x < r0.p.x; }\\n};\\n\\ntypedef set<Robot> srbt;\\n\\n/* global variables */\\n\\nint n;\\npt v;\\ndouble r;\\nRobot rbts[MAX_N];\\n\\n/* subroutines */\\n\\nbool lessy(const Robot& r0, const Robot& r1) { return r0.p.y < r1.p.y; }\\n\\n/* main */\\n\\nint main() {\\n for (;;) {\\n cin >> n;\\n if (n == 0) break;\\n\\n cin >> v.x >> v.y >> r;\\n\\n double th = -atan2(v.y, v.x);\\n pt v0 = v.rot(th);\\n //v0.print(); printf(\\\"th=%.6lf\\\\n\\\", th);\\n\\n double rr = r * 2;\\n double dvx = v0.x * 2;\\n \\n for (int i = 0; i < n; i++) {\\n pt p;\\n cin >> p.x >> p.y >> rbts[i].drc;\\n rbts[i].p = p.rot(th);\\n }\\n sort(rbts, rbts + n, lessy);\\n \\n double min_t = INF;\\n srbt srl, srr;\\n \\n for (int i0 = 0, i1 = 0; i1 < n; i1++) {\\n Robot& r1 = rbts[i1];\\n\\n while (i0 < i1 && r1.p.y - rbts[i0].p.y > rr) {\\n\\tif (rbts[i0].drc > 0) srl.erase(rbts[i0]);\\n\\telse srr.erase(rbts[i0]);\\n\\ti0++;\\n }\\n \\n if (r1.drc < 0) {\\n\\tif (! srl.empty()) {\\n\\t srbt::iterator rit = srl.lower_bound(r1);\\n\\t if (rit != srl.begin()) {\\n\\t rit--;\\n\\t pt dp = r1.p - rit->p;\\n\\t double t = (dp.x - sqrt(rr * rr - dp.y * dp.y)) / dvx;\\n\\t if (min_t > t) min_t = t;\\n\\t }\\n\\t}\\n\\n\\tsrr.insert(r1);\\n }\\n else {\\n\\tif (! srr.empty()) {\\n\\t srbt::iterator rit = srr.lower_bound(r1);\\n\\t if (rit != srr.end()) {\\n\\t pt dp = rit->p - r1.p;\\n\\t double t = (dp.x - sqrt(rr * rr - dp.y * dp.y)) / dvx;\\n\\t if (min_t > t) min_t = t;\\n\\t }\\n\\t}\\n\\n\\tsrl.insert(r1);\\n }\\n }\\n\\n if (min_t >= INF)\\n cout << \\\"SAFE\\\" << endl;\\n else \\n printf(\\\"%.6lf\\\\n\\\", min_t);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 650,\n \"memory_kb\": 9948,\n \"score_of_the_acc\": -0.7291,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2046_815880\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\n\\nusing namespace std;\\n\\ntypedef complex<double> Point;\\nnamespace std{\\n bool operator < (const Point& p1, const Point& p2){\\n if(p1.real() != p2.real()) return p1.real() < p2.real();\\n return p1.imag() < p2.imag();\\n }\\n};\\nstruct Event{\\n double y;\\n Point p;\\n int p_type;\\n int e_type;\\n Event(double y, Point p, int p_type, int e_type) : \\n y(y), p(p), p_type(p_type), e_type(e_type) {}\\n bool operator < (const Event& e) const{\\n if(y != e.y) return y < e.y;\\n if(e_type != e.e_type) return e_type > e.e_type; // delete is first ???\\n return p < e.p;\\n }\\n};\\n\\n\\ndouble get_time(Point p, Point q, double R, double v){\\n double dx = abs(p.real() - q.real());\\n double dy = abs(p.imag() - q.imag());\\n if(!(2 * R >= dy)) return 1e16;\\n assert(2 * R >= dy);\\n double b = sqrt(4 * R * R - dy * dy);\\n assert(dx - b >= 0);\\n return (dx - b) / v;\\n}\\n\\nvoid update(double& ans, vector<Point>& pset, Point p, double R, double v, int t){\\n int k = lower_bound(pset.begin(), pset.end(), p) - pset.begin();\\n for(int dk = -1; dk <= 1; dk++) if(k + dk >= 0 && k + dk < pset.size()){\\n if(t == 0 && p.real() < pset[k + dk].real()){\\n ans = min(ans, get_time(p, pset[k + dk], R, v));\\n }else if(t == 1 && p.real() > pset[k + dk].real()){\\n ans = min(ans, get_time(p, pset[k + dk], R, v));\\n }\\n }\\n}\\n\\nint main(){\\n int N;\\n while(cin >> N && N){\\n double vx, vy;\\n cin >> vx >> vy;\\n vx *= 2; vy *= 2;\\n double th = arg(Point(vx, vy));\\n double v = sqrt(vx * vx + vy * vy);\\n double R;\\n cin >> R;\\n\\n vector<Event> events;\\n\\n REP(i, N){\\n double x, y;\\n int u;\\n cin >> x >> y >> u;\\n Point p(x, y);\\n p = p * polar(1.0, -th);\\n if(u == 1){\\n events.push_back(Event(p.imag() - R, p, 0, 0));\\n events.push_back(Event(p.imag() + R, p, 0, 1));\\n }else{\\n events.push_back(Event(p.imag() - R, p, 1, 0));\\n events.push_back(Event(p.imag() + R, p, 1, 1));\\n }\\n }\\n\\n sort(events.begin(), events.end());\\n\\n vector<Point> point_set[2];\\n double ans = 1e16;\\n for(int i = 0; i < events.size(); i++){\\n Event e = events[i];\\n //cout << e.p << \\\" \\\" << e.e_type << \\\" \\\" << e.p_type << endl;\\n vector<Point>& my_set = point_set[e.p_type];\\n vector<Point>& you_set = point_set[e.p_type ^ 1];\\n if(e.e_type == 0){\\n my_set.insert(lower_bound(my_set.begin(), my_set.end(), e.p), e.p);\\n update(ans, you_set, e.p, R, v, e.p_type);\\n }else if(e.e_type == 1){\\n my_set.erase(lower_bound(my_set.begin(), my_set.end(), e.p));\\n int k = lower_bound(you_set.begin(), you_set.end(), e.p) - you_set.begin();\\n for(int dk = -1; dk <= 1; dk ++) if(k + dk >= 0 && k + dk < you_set.size()){\\n update(ans, my_set, you_set[k], R, v, e.p_type ^ 1);\\n }\\n }\\n }\\n if(ans >= 1e16){\\n puts(\\\"SAFE\\\");\\n }else{\\n printf(\\\"%.6f\\\\n\\\", ans);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2760,\n \"memory_kb\": 15680,\n \"score_of_the_acc\": -2,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2046_406661\",\n \"code_snippet\": \"#include<set>\\n#include<cmath>\\n#include<cstdio>\\n#include<algorithm>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nconst double INF=1e77;\\nconst double PI=acos(-1);\\n\\ntemplate<class T>\\nstruct point{ T x,y; };\\n\\ntemplate<class T>\\ndouble abs(const point<T> &a){ return sqrt(a.x*a.x+a.y*a.y); }\\n\\ntemplate<class T>\\ndouble arg(const point<T> &a,const point<T> &b){\\n\\tdouble ta=atan2(a.y,a.x);\\n\\tdouble tb=atan2(b.y,b.x);\\n\\treturn tb-ta<0 ? tb-ta+2*PI : tb-ta;\\n}\\n\\npoint<double> rot(const point<double> &a,double theta){\\n\\treturn (point<double>){a.x*cos(theta)-a.y*sin(theta),a.x*sin(theta)+a.y*cos(theta)};\\n}\\n\\nstruct robot{\\n\\tpoint<double> p; // 位置\\n\\tint dir; // 移動方向 (+1 or -1)\\n\\tbool operator<(const robot &Z)const{ return p.x<Z.p.x; }\\n};\\n\\n// 速さ v で動くロボット A, B が衝突するときの時刻\\ndouble f(const robot &A,const robot &B,double r,double v){\\n\\tdouble w=abs(A.p.x-B.p.x);\\n\\tdouble h=sqrt(4*r*r-w*w);\\n\\treturn (abs(A.p.y-B.p.y)-h)/(2*v);\\n}\\n\\nint main(){\\n\\tfor(int n;scanf(\\\"%d\\\",&n),n;){\\n\\t\\tpoint<double> v;\\n\\t\\tdouble r; scanf(\\\"%lf%lf%lf\\\",&v.x,&v.y,&r);\\n\\t\\tdouble v_abs=abs(v);\\n\\n\\t\\tstatic robot Z[100000];\\n\\t\\trep(i,n) scanf(\\\"%lf%lf%d\\\",&Z[i].p.x,&Z[i].p.y,&Z[i].dir);\\n\\n\\t\\t// y 軸の +/- 方向に移動するように座標を取り替える\\n\\t\\tdouble theta=-arg((point<double>){0,1},v);\\n\\t\\tv=rot(v,theta);\\n\\t\\trep(i,n) Z[i].p=rot(Z[i].p,theta);\\n\\n\\t\\tsort(Z,Z+n);\\n\\n\\t\\tdouble ans=INF;\\n\\t\\t// S_u : 上方向に動くロボットの集合\\n\\t\\t// S_d : 下方向に動くロボットの集合\\n\\t\\t// double をそのまま比較しているけど、誤差が出るような演算はしていないので大丈夫\\n\\t\\tset< pair<double,int> > S_u,S_d;\\n\\t\\tfor(int i=0,j=0;i<n;i++){\\n\\t\\t\\t// x 方向に離れすぎてロボット i とぶつかれなくなったロボットを削除\\n\\t\\t\\twhile(j<i && Z[i].p.x-Z[j].p.x>2*r){\\n\\t\\t\\t\\tif(Z[j].dir==1) S_u.erase(make_pair(Z[j].p.y,j));\\n\\t\\t\\t\\telse S_d.erase(make_pair(Z[j].p.y,j));\\n\\t\\t\\t\\tj++;\\n\\t\\t\\t}\\n\\n\\t\\t\\tset< pair<double,int> >::iterator it;\\n\\t\\t\\t// ロボット i は上方向に動く\\n\\t\\t\\tif(Z[i].dir==1){\\n\\t\\t\\t\\tif(!S_d.empty()){\\n\\t\\t\\t\\t\\tit=S_d.lower_bound(make_pair(Z[i].p.y,-1));\\n\\t\\t\\t\\t\\tif(it!=S_d.end()){\\n\\t\\t\\t\\t\\t\\tint k=it->second;\\n\\t\\t\\t\\t\\t\\tans=min(ans,f(Z[i],Z[k],r,v_abs));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t// ロボット i は下方向に動く\\n\\t\\t\\telse{\\n\\t\\t\\t\\tif(!S_u.empty()){\\n\\t\\t\\t\\t\\tit=S_u.lower_bound(make_pair(Z[i].p.y,-1));\\n\\t\\t\\t\\t\\tif(it!=S_u.begin()){\\n\\t\\t\\t\\t\\t\\t--it;\\n\\t\\t\\t\\t\\t\\tint k=it->second;\\n\\t\\t\\t\\t\\t\\tans=min(ans,f(Z[i],Z[k],r,v_abs));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(Z[i].dir==1) S_u.insert(make_pair(Z[i].p.y,i));\\n\\t\\t\\telse S_d.insert(make_pair(Z[i].p.y,i));\\n\\t\\t}\\n\\n\\t\\tif(ans>INF/2) puts(\\\"SAFE\\\");\\n\\t\\telse printf(\\\"%.9f\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 550,\n \"memory_kb\": 2848,\n \"score_of_the_acc\": -0.1367,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1075,"cells":{"group_id":{"kind":"string","value":"aoj_2040_cpp"},"problem_description":{"kind":"string","value":"Problem B:\nSort the Panels\nThere was an explorer Henry Nelson traveling all over the world. One day he reached an ancient\nbuilding. He decided to enter this building for his interest, but its entrance seemed to be locked\nby a strange security system.\nThere were some black and white panels placed on a line at equal intervals in front of the\nentrance, and a strange machine with a cryptogram attached. After a while, he managed to\nread this cryptogram: this entrance would be unlocked when the panels were rearranged in a\ncertain order, and he needed to use this special machine to change the order of panels.\nAll he could do with this machine was to swap arbitrary pairs of panels. Each swap could be\nperformed by the following steps:\nmove the machine to one panel and mark it;\nmove the machine to another panel and again mark it; then\nturn on a special switch of the machine to have the two marked panels swapped.\nIt was impossible to have more than two panels marked simultaneously. The marks would be\nerased every time the panels are swapped.\nHe had to change the order of panels by a number of swaps to enter the building. Unfortunately,\nhowever, the machine was so heavy that he didn’t want to move it more than needed. Then\nwhich steps could be the best?\nYour task is to write a program that finds the minimum cost needed to rearrange the panels,\nwhere moving the machine between adjacent panels is defined to require the cost of one. You\ncan arbitrarily choose the initial position of the machine, and don’t have to count the cost for\nmoving the machine to that position.\nInput\nThe input consists of multiple datasets.\nEach dataset consists of three lines. The first line contains an integer\nN\n, which indicates the\nnumber of panels (2 ≤\nN\n≤ 16). The second and third lines contain\nN\ncharacters each,\nand describe the initial and final orders of the panels respectively. Each character in these descriptions is either ‘B’ (for black) or ‘W’ (for white) and denotes the color of the panel. The\npanels of the same color should\nnot\nbe distinguished.\nThe input is terminated by a line with a single zero.\nOutput\nFor each dataset, output the minimum cost on a line. You can assume that there is at least one\nway to change the order of the panels from the initial one to the final one.\nSample Input\n4\nWBWB\nBWBW\n8\nWWWWBWBB\nWWBBWBWW\n0\nOutput for the Sample Input\n3\n9"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2040_10853102","code_snippet":"#include <cstring>\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint getStat(string arg) {\n\tint ret = 0;\n\tfor(char ch: arg)\n\t\tif(ch == 'B') ret = ret * 2 + 1;\n\t\telse ret *= 2;\n\treturn ret;\n}\n\nint dp[1 << 16][16];\nint n, goal;\n\nint getAns(int stat, int machine) {\n\tint &ret = dp[stat][machine];\n\tif(ret != -1) return ret;\n\n\tret = 0;\n\tif(stat != goal) {\n\t\tret = (1 << 29);\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tfor(int j = 0; j < n; j++) {\n\t\t\t\tif((stat & (1 << i)) > 0 != (stat & (1 << j)) > 0) {\n\t\t\t\t\tif(\t(stat & (1 << i)) != (goal & (1 << i)) and\n\t\t\t\t\t\t(stat & (1 << j)) != (goal & (1 << j))) {\n\t\t\t\t\t\tret = min(ret, getAns(stat ^ (1 << i) ^ (1 << j), j) + abs(machine - i) + abs(i - j));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nint main(void) {\n\twhile(cin >> n, n > 0) {\n\t\tstring start, end;\n\t\tcin >> start >> end;\n\t\tgoal = getStat(end);\n\t\tmemset(dp, -1, sizeof(dp));\n\t\tint ans = (1 << 30);\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tans = min(ans, getAns(getStat(start), i));\n\t\tcout << ans << \"\\n\";\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":170,"memory_kb":7464,"score_of_the_acc":-0.0398,"final_rank":10},{"submission_id":"aoj_2040_9595976","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int inf = 0x3f000000;\nbool cmp(int x, int y) {\n return __builtin_popcount(x) < __builtin_popcount(y);\n}\nint main() {\n int n;\n while (true) {\n scanf(\"%d\", &n);\n if (!n) {\n fflush(stdout);\n exit(0);\n }\n char s[18], t[18];\n scanf(\"%s\", s);\n scanf(\"%s\", t);\n vector<vector<int> > dp(1 << n, vector<int>(n, inf));\n int mask = 0;\n for (int i = 0; i < n; ++i) {\n mask |= (s[i] == t[i]) << i;\n }\n fill(dp[mask].begin(), dp[mask].end(), 0);\n vector<int> masks;\n for (int i = 0; i < (1 << n); ++i) {\n masks.push_back(i);\n }\n sort(masks.begin(), masks.end(), cmp);\n for (int z = 0; z < (1 << n); ++ z) { int cur = masks[z];\n for (int pos = 0; pos < n; ++pos) {\n if (dp[cur][pos] == inf) continue;\n for (int i = 0; i < n; ++i) {\n if (cur >> i & 1) continue;\n for (int j = 0; j < n; ++j) {\n if ((cur >> j & 1) || s[i] == s[j]) continue;\n int after = cur | (1 << i) | (1 << j);\n int dist = abs(pos - j) + abs(j - i);\n dp[after][i] = min(dp[after][i], dp[cur][pos] + dist);\n }\n }\n }\n }\n printf(\"%d\\n\", *min_element(dp[(1 << n) - 1].begin(), dp[(1 << n) - 1].end()));\n }\n}","accuracy":1,"time_ms":300,"memory_kb":9892,"score_of_the_acc":-0.2274,"final_rank":11},{"submission_id":"aoj_2040_9595961","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int inf = 0x3f000000;\nbool cmp(int x, int y) {\n return __builtin_popcount(x) < __builtin_popcount(y);\n}\nint main() {\n int n;\n while (cin >> n) {\n if (!n) {\n fflush(stdout);\n return 0;\n }\n string s, t;\n cin >> s >> t;\n vector<vector<int> > dp(1 << n, vector<int>(n, inf));\n int mask = 0;\n for (int i = 0; i < n; ++i) {\n mask |= (s[i] == t[i]) << i;\n }\n fill(dp[mask].begin(), dp[mask].end(), 0);\n vector<int> masks;\n for (int i = 0; i < (1 << n); ++i) {\n masks.push_back(i);\n }\n sort(masks.begin(), masks.end(), cmp);\n for (int cur : masks) {\n for (int pos = 0; pos < n; ++pos) {\n if (dp[cur][pos] == inf) continue;\n for (int i = 0; i < n; ++i) {\n if (cur >> i & 1) continue;\n for (int j = 0; j < n; ++j) {\n if ((cur >> j & 1) || s[i] == s[j]) continue;\n int after = cur | (1 << i) | (1 << j);\n int dist = abs(pos - j) + abs(j - i);\n dp[after][i] = min(dp[after][i], dp[cur][pos] + dist);\n }\n }\n }\n }\n printf(\"%d\\n\", *min_element(dp[(1 << n) - 1].begin(), dp[(1 << n) - 1].end()));\n }\n}","accuracy":1,"time_ms":210,"memory_kb":10596,"score_of_the_acc":-0.2645,"final_rank":14},{"submission_id":"aoj_2040_9595960","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int inf = 0x3f000000;\nbool cmp(int x, int y) {\n return __builtin_popcount(x) < __builtin_popcount(y);\n}\nint main() {\n int n;\n while (cin >> n) {\n if (!n) return 0;\n string s, t;\n cin >> s >> t;\n vector<vector<int> > dp(1 << n, vector<int>(n, inf));\n int mask = 0;\n for (int i = 0; i < n; ++i) {\n mask |= (s[i] == t[i]) << i;\n }\n fill(dp[mask].begin(), dp[mask].end(), 0);\n vector<int> masks;\n for (int i = 0; i < (1 << n); ++i) {\n masks.push_back(i);\n }\n sort(masks.begin(), masks.end(), cmp);\n for (int cur : masks) {\n for (int pos = 0; pos < n; ++pos) {\n if (dp[cur][pos] == inf) continue;\n for (int i = 0; i < n; ++i) {\n if (cur >> i & 1) continue;\n for (int j = 0; j < n; ++j) {\n if ((cur >> j & 1) || s[i] == s[j]) continue;\n int after = cur | (1 << i) | (1 << j);\n int dist = abs(pos - j) + abs(j - i);\n dp[after][i] = min(dp[after][i], dp[cur][pos] + dist);\n }\n }\n }\n }\n printf(\"%d\\n\", *min_element(dp[(1 << n) - 1].begin(), dp[(1 << n) - 1].end()));\n }\n}","accuracy":1,"time_ms":230,"memory_kb":10356,"score_of_the_acc":-0.2504,"final_rank":12},{"submission_id":"aoj_2040_9595959","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int inf = 0x3f000000;\nbool cmp(int x, int y) {\n return __builtin_popcount(x) < __builtin_popcount(y);\n}\nint main() {\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n int n;\n while (cin >> n) {\n if (!n) return 0;\n string s, t;\n cin >> s >> t;\n vector<vector<int> > dp(1 << n, vector<int>(n, inf));\n int mask = 0;\n for (int i = 0; i < n; ++i) {\n mask |= (s[i] == t[i]) << i;\n }\n fill(dp[mask].begin(), dp[mask].end(), 0);\n vector<int> masks;\n for (int i = 0; i < (1 << n); ++i) {\n masks.push_back(i);\n }\n sort(masks.begin(), masks.end(), cmp);\n for (int cur : masks) {\n for (int pos = 0; pos < n; ++pos) {\n if (dp[cur][pos] == inf) continue;\n for (int i = 0; i < n; ++i) {\n if (cur >> i & 1) continue;\n for (int j = 0; j < n; ++j) {\n if ((cur >> j & 1) || s[i] == s[j]) continue;\n int after = cur | (1 << i) | (1 << j);\n int dist = abs(pos - j) + abs(j - i);\n dp[after][i] = min(dp[after][i], dp[cur][pos] + dist);\n }\n }\n }\n }\n cout << *min_element(dp[(1 << n) - 1].begin(), dp[(1 << n) - 1].end()) << '\\n';\n }\n}","accuracy":1,"time_ms":230,"memory_kb":10484,"score_of_the_acc":-0.2594,"final_rank":13},{"submission_id":"aoj_2040_9595956","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int inf = 0x3f000000;\nbool cmp(int x, int y) {\n return __builtin_popcount(x) < __builtin_popcount(y);\n}\nint dp[1 << 16][16];\nint main() {\n int n;\n while (true) {\n cin >> n;\n if (!n) return 0;\n string s, t;\n cin >> s >> t;\n int mask = 0, c = 0;\n for (int i = 0; i < n; ++i) {\n mask |= (s[i] == t[i]) << i;\n }\n c = __builtin_popcount(mask) % 2;\n for (int i = 0; i < (1 << n); ++i) {\n for (int j = 0; j < n; ++j) {\n dp[i][j] = inf;\n }\n }\n for (int i = 0; i < n; ++i) dp[mask][i] = 0;\n vector<int> masks;\n for (int i = 0; i < (1 << n); ++i) {\n if (__builtin_popcount(i) % 2 == c) masks.push_back(i);\n }\n sort(masks.begin(), masks.end(), cmp);\n for (int cur : masks) {\n for (int pos = 0; pos < n; ++pos) {\n if (dp[cur][pos] == inf) continue;\n for (int i = 0; i < n; ++i) {\n if (cur >> i & 1) continue;\n for (int j = 0; j < n; ++j) {\n if ((cur >> j & 1) || s[i] == s[j]) continue;\n int after = cur | (1 << i) | (1 << j);\n int dist = abs(pos - j) + abs(j - i);\n dp[after][i] = min(dp[after][i], dp[cur][pos] + dist);\n }\n }\n }\n }\n int ans = inf;\n for (int i = 0; i < n; ++i) ans = min(ans, dp[(1 << n) - 1][i]);\n cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":120,"memory_kb":7552,"score_of_the_acc":-0.0392,"final_rank":9},{"submission_id":"aoj_2040_2743729","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;\nint N;\nstring s, g;\nint dp[1<<16][16];\nint dfs(int S, int u){\n if(S == (1<<N) - 1) return 0;\n if(dp[S][u] != -1) return dp[S][u];\n int res = INF;\n REP(i, N)REP(j, N) if(i != j && (S >> i & 1) == 0 && (S >> j & 1) == 0 && g[i] != g[j]){\n res = min(res, abs(u - i) + abs(i - j) + dfs(S | 1 << i | 1 << j, j));\n }\n return dp[S][u] = res;\n}\nint main(){\n while(cin>>N && N){\n cin>>s>>g;\n REP(S, 1<<N) REP(p, N) dp[S][p] = -1;\n int S = 0;\n REP(i, N) if(s[i] == g[i]) S |= 1<<i;\n int ans = INF;\n REP(i, N) ans = min(ans, dfs(S, i));\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":7176,"score_of_the_acc":-0.0223,"final_rank":5},{"submission_id":"aoj_2040_2666169","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\n\nstruct aa {\n\tbitset<16>bs;\n\tint cost;\n\tint now;\n};\nclass Compare {\npublic:\n\tbool operator()(const aa&l, const aa&r) {\n\t\treturn l.cost>r.cost;\n\t}\n};\n\nint main() {\n\twhile (true) {\n\t\tint N;cin>>N;\n\t\tif(!N)break;\n\t\tstring a,b;cin>>a>>b;\n\t\tbitset<16>start,goal;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tif(a[i]=='B')start[i]=true;\n\t\t\tif(b[i]=='B')goal[i]=true;\n\t\t}\n\t\tvector<vector<int>>memo((1<<N),vector<int>(N,1e9));\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tmemo[start.to_ulong()][i]=0;\n\t\t}\n\n\t\tpriority_queue<aa,vector<aa>,Compare>que;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tque.push(aa{ start,0,i });\n\t\t}\n\n\t\tint ans=1e9;\n\t\twhile (!que.empty()) {\n\t\t\tauto atop(que.top());\n\t\t\tque.pop();\n\n\t\t\tbitset<16>bs(atop.bs);\n\t\t\tconst int cost(atop.cost);\n\t\t\tconst int now(atop.now);\n\t\t\tif (bs == goal) {\n\t\t\t\tans=min(ans,cost);\n\t\t\t}\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tint u=bs[now];\n\t\t\t\tbs[now]=bs[i];\n\t\t\t\tbs[i]=u;\n\t\t\t\tconst int next_cost=cost+(abs(now-i));\n\t\t\t\tif (memo[bs.to_ulong()][i] > next_cost) {\n\t\t\t\t\tmemo[bs.to_ulong()][i]=next_cost;\n\t\t\t\t\tque.push(aa{ bs,next_cost,i });\n\t\t\t\t}\n\t\t\t\tu = bs[now];\n\t\t\t\tbs[now] = bs[i];\n\t\t\t\tbs[i] = u;\n\t\t\t}\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tconst int next_cost = cost + (abs(now - i));\n\t\t\t\tif (memo[bs.to_ulong()][i] > next_cost) {\n\t\t\t\t\tmemo[bs.to_ulong()][i] = next_cost;\n\t\t\t\t\tque.push(aa{ bs,next_cost,i });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":1080,"memory_kb":15780,"score_of_the_acc":-0.7448,"final_rank":15},{"submission_id":"aoj_2040_2602113","code_snippet":"#include <functional>\n#include <iostream>\n#include <limits>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n while (true) {\n int n;\n cin >> n;\n if (n == 0) {\n return 0;\n }\n\n string init;\n string final;\n cin >> init;\n cin >> final;\n\n auto encode = [](const string& s) {\n int r = 0b0;\n for (int i = 0; i < s.size(); ++i) {\n if (i != 0) {\n r <<= 1;\n }\n if (s[i] == 'B') {\n r |= 0b1;\n }\n }\n return r;\n };\n\n auto target = encode(final);\n auto start = encode(init);\n\n vector<vector<int>> memo(n, vector<int>(1 << n, -1));\n // p ??????????????´?????¶?????? s ?????¨??????????°???????????????????\n function<int(int, int)> f = [&f, &memo, n, start](int p, int s) -> int {\n if (memo[p][s] != -1) {\n return memo[p][s];\n }\n\n // ??????????????´????????????\n if (s == 0) {\n return 0;\n }\n\n int min_ = numeric_limits<int>::max();\n for (int i = 0; i < n; ++i) {\n // i ??????????????§????????´????????????\n if (((s >> i) & 1) == 0) {\n continue;\n }\n for (int j = 0; j < n; ++j) {\n if (i == j) {\n continue;\n }\n // j ??????????????§????????´????????????\n else if ((s >> j & 1) == 0) {\n continue;\n }\n // ?????????????????\\????????????????°???????????????????\n else if ((((start >> i) & 1) ^ ((start >> j) & 1)) == 0) {\n continue;\n }\n else {\n // p ?????? i ?????§?????£???, i ?????? j ?????§??????\n auto cost = abs(i - p) + abs(j - i);\n min_ = min(min_, cost + f(j, s ^ (1 << i) ^ (1 << j)));\n }\n }\n }\n memo[p][s] = min_;\n\n return min_;\n };\n\n int min_ = numeric_limits<int>::max();\n // ????????????????????????????????????\n for (int i = 0; i < n; ++i) {\n min_ = min(min_, f(i, start ^ target));\n }\n cout << min_ << endl;\n }\n}","accuracy":1,"time_ms":150,"memory_kb":7332,"score_of_the_acc":-0.0279,"final_rank":7},{"submission_id":"aoj_2040_2602110","code_snippet":"#include <bitset>\n#include <functional>\n#include <iostream>\n#include <limits>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n while (true) {\n int n;\n cin >> n;\n if (n == 0) {\n return 0;\n }\n\n string init;\n string final;\n cin >> init;\n cin >> final;\n\n auto encode = [](const string& s) {\n int r = 0b0;\n for (int i = 0; i < s.size(); ++i) {\n if (i != 0) {\n r <<= 1;\n }\n if (s[i] == 'B') {\n r |= 0b1;\n }\n }\n return r;\n };\n\n auto pow = [](int b, int e) {\n int r = 1;\n for (int i = 0; i < e; ++i) {\n r *= b;\n }\n return r;\n };\n\n auto target = encode(final);\n auto start = encode(init);\n\n vector<vector<int>> memo(n, vector<int>(pow(2, n), -1));\n // p ??????????????´?????¶?????? s ?????¨??????????°???????????????????\n function<int(int, int)> f = [&f, &memo, n, &pow, start](int p,\n int s) -> int {\n if (memo[p][s] != -1) {\n return memo[p][s];\n }\n\n // ??????????????´????????????\n if (s == 0) {\n return 0;\n }\n\n int min_ = numeric_limits<int>::max();\n int pp = -1;\n for (int i = 0; i < n; ++i) {\n // i ??????????????§????????´????????????\n if (((s >> i) & 1) == 0) {\n continue;\n }\n for (int j = 0; j < n; ++j) {\n if (i == j) {\n continue;\n }\n // j ??????????????§????????´????????????\n else if ((s >> j & 1) == 0) {\n continue;\n }\n // ?????????????????\\????????????????°???????????????????\n else if ((((start >> i) & 1) ^ ((start >> j) & 1)) == 0) {\n continue;\n }\n else {\n // p ?????? i ?????§?????£???, i ?????? j ?????§??????\n auto cost = abs(i - p) + abs(j - i);\n auto ss = s;\n ss ^= 1 << i;\n ss ^= 1 << j;\n auto min__ = min_;\n min_ = min(min_, cost + f(j, ss));\n if (min__ != min_) {\n pp = p;\n }\n }\n }\n }\n memo[pp][s] = min_;\n\n return min_;\n };\n\n int min_ = numeric_limits<int>::max();\n for (int i = 0; i < n; ++i) {\n min_ = min(min_, f(i, start ^ target));\n }\n cout << min_ << endl;\n }\n}","accuracy":1,"time_ms":160,"memory_kb":7280,"score_of_the_acc":-0.0256,"final_rank":6},{"submission_id":"aoj_2040_2602109","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <fstream>\n#include <functional>\n#include <iostream>\n#include <limits>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n //ifstream cin(\"/Volumes/env1/work/aoj/2040/a\");\n while (true) {\n int n;\n cin >> n;\n if (n == 0) {\n return 0;\n }\n\n string init;\n string final;\n cin >> init;\n cin >> final;\n\n auto encode = [](const string& s) {\n int r = 0b0;\n for (int i = 0; i < s.size(); ++i) {\n if (i != 0) {\n r <<= 1;\n }\n if (s[i] == 'B') {\n r |= 0b1;\n }\n }\n return r;\n };\n\n auto pow = [](int b, int e) {\n int r = 1;\n for (int i = 0; i < e; ++i) {\n r *= b;\n }\n return r;\n };\n\n auto target = encode(final);\n auto start = encode(init);\n\n vector<vector<int>> memo(n, vector<int>(pow(2, n), -1));\n // p ??????????????´?????¶?????? s ?????¨??????????°???????????????????\n function<int(int, int)> f = [&f, &memo, n, &pow, start](int p,\n int s) -> int {\n //cout << static_cast<bitset<8>>(s) << endl;\n if (memo[p][s] != -1) {\n //cout << \"memo1\" << p << ' ' << s << endl;\n return memo[p][s];\n }\n\n // ??????????????´????????????\n if (s == 0) {\n return 0;\n }\n\n int min_ = numeric_limits<int>::max();\n int pp = -1;\n for (int i = 0; i < n; ++i) {\n // i ??????????????§????????´????????????\n if (((s >> i) & 1) == 0) {\n continue;\n }\n for (int j = 0; j < n; ++j) {\n if (i == j) {\n continue;\n }\n // j ??????????????§????????´????????????\n else if ((s >> j & 1) == 0) {\n continue;\n }\n // ?????????????????\\????????????????°???????????????????\n else if ((((start >> i) & 1) ^ ((start >> j) & 1)) == 0) {\n continue;\n }\n else {\n // p ?????? i ?????§?????£???, i ?????? j ?????§??????\n auto cost = abs(i - p) + abs(j - i);\n auto ss = s;\n ss ^= 1 << i;\n ss ^= 1 << j;\n //cout << \"pos: \" << p << \" swap \" << i << \", \" << j\n // << \": \" << static_cast<bitset<8>>(s) << \" to \"\n // << static_cast<bitset<8>>(ss) << \" cost \" << cost\n // << endl;\n auto min__ = min_;\n min_ = min(min_, cost + f(j, ss));\n if (min__ != min_) {\n pp = p;\n }\n }\n }\n }\n //cout << \"write memo \" << pp << \" \" << static_cast<bitset<8>>(s) << endl;\n memo[pp][s] = min_;\n assert(min_ != -1);\n\n return min_;\n };\n\n int min_ = numeric_limits<int>::max();\n for (int i = 0; i < n; ++i) {\n min_ = min(min_, f(i, start ^ target));\n }\n cout << min_ << endl;\n }\n}","accuracy":1,"time_ms":150,"memory_kb":7348,"score_of_the_acc":-0.029,"final_rank":8},{"submission_id":"aoj_2040_2602059","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <bitset>\n#include <string>\n#include <map>\n#include <queue>\n#include <functional>\n#include <assert.h>\nusing namespace std;\ninline int pack(int p, int ps, int n) {\n return (p << n) | ps;\n}\nint main(int argc, char *argv[])\n{\n for(;;) {\n int n;\n cin >> n;\n if(n==0) break;\n string sa, sb;\n getline(cin, sa);\n getline(cin, sa);\n getline(cin, sb);\n auto conv = [n](string &s) {\n int r = 0;\n for(int i = 0; i < n; i++) {\n r = (r<<1) + (s[i] == 'W' ? 1 : 0); \n }\n return r;\n };\n const int a = conv(sa);\n const int b = conv(sb);\n //cout << \"a = \" << static_cast<std::bitset<8> >(a) << endl;\n //cout << \"b = \" << static_cast<std::bitset<8> >(b) << endl;\n // better DP: state = (head-pos, difference)\n vector<int> ds(n<<n, -1);\n function<int(int)> rec = [&rec,&b,&n,&ds](const int v){\n if(ds[v] >= 0) return ds[v];\n const int p = v >> n;\n const int s = v & ((1<<n) - 1);\n if(s == 0) return 0;\n int e = 10000000;\n for(int i = 0; i < n; i++) {\n if((s & (1<<i)) == 0) continue;\n for(int j = 0; j < n; j++) {\n if(i == j) continue;\n if((s & (1<<j)) == 0) continue;\n if((((b>>i) ^ (b>>j))&1) == 0) continue;\n const int c = abs(i - p) + abs(j - i);\n const int u = pack(j, s ^ (1<<i) ^ (1<<j), n); // swap\n e = min(e, c + rec(u));\n }\n }\n ds[v] = e;\n return e;\n };\n int e = 10000000;\n for(int i = 0; i < n; i++) {\n e = min(e, rec(pack(i, a^b, n)));\n }\n cout << e << endl;\n/* // naive Dijkstra search: state = (head-pos, panels)\n vector<int> ds(n<<n, 100000000);\n priority_queue<pair<int,int>> que;\n for(int i = 0; i < n; i++) {\n int v = pack(i, a, n);\n ds[v] = 0;\n que.push(make_pair(-ds[v], v));\n \n }\n vector<bool> done(n, false);\n int rest = n;\n while(que.size() > 0) {\n auto dv = que.top(); que.pop();\n const int v = dv.second;\n const int d = -dv.first;\n const int p = v >> n;\n const int s = v & ((1<<n) - 1);\n //cout << \"popped: \" << static_cast<std::bitset<8> >(s) << \" at \" << p << \" with cost \" << d << endl;\n if(s == b) {\n if(!done[p]) {\n done[p] = true;\n rest--;\n }\n if(rest == 0) {\n int e = d;\n for(int i = 0; i < n; i++) {\n e = min(e, ds[pack(i, b, n)]);\n }\n cout << e << endl;\n break;\n }\n }\n // generate all possible transitions: marking i, and then j.\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < n; j++) {\n if(i == j) continue;\n if((((s>>i) ^ (s>>j))&1) == 0) continue;\n const int c = abs(i - p) + abs(j - i);\n const int u = pack(j, s ^ (1<<i) ^ (1<<j), n); // swap\n if(ds[u] > d + c) {\n ds[u] = d + c;\n que.push(make_pair(-ds[u], u));\n //cout << \" to \" << i << \" and \" << j << \" cost \" << ds[u] << \" for \" << static_cast<std::bitset<8> >(u) << endl;\n }\n }\n }\n }\n*/\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":7088,"score_of_the_acc":-0.0094,"final_rank":2},{"submission_id":"aoj_2040_2601978","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <bitset>\n#include <string>\n#include <map>\n#include <queue>\n#include <functional>\n#include <assert.h>\nusing namespace std;\ninline int pack(int p, int ps, int n) {\n return (p << n) | ps;\n}\nint main(int argc, char *argv[])\n{\n for(;;) {\n int n;\n cin >> n;\n if(n==0) break;\n string sa, sb;\n getline(cin, sa);\n getline(cin, sa);\n getline(cin, sb);\n auto conv = [n](string &s) {\n int r = 0;\n for(int i = 0; i < n; i++) {\n r = (r<<1) + (s[i] == 'W' ? 1 : 0); \n }\n return r;\n };\n int a = conv(sa);\n int b = conv(sb);\n //cout << \"a = \" << static_cast<std::bitset<8> >(a) << endl;\n //cout << \"b = \" << static_cast<std::bitset<8> >(b) << endl;\n\n // state = (pos, panels)\n vector<int> ds(n<<n, 100000000);\n priority_queue<pair<int,int>> que;\n for(int i = 0; i < n; i++) {\n int v = pack(i, a, n);\n ds[v] = 0;\n que.push(make_pair(-ds[v], v));\n \n }\n vector<bool> done(n, false);\n int rest = n;\n while(que.size() > 0) {\n auto dv = que.top(); que.pop();\n const int v = dv.second;\n const int d = -dv.first;\n const int p = v >> n;\n const int s = v & ((1<<n) - 1);\n //cout << \"popped: \" << static_cast<std::bitset<8> >(s) << \" at \" << p << \" with cost \" << d << endl;\n if(s == b) {\n if(!done[p]) {\n done[p] = true;\n rest--;\n }\n if(rest == 0) {\n int e = d;\n for(int i = 0; i < n; i++) {\n e = min(e, ds[pack(i, b, n)]);\n }\n cout << e << endl;\n break;\n }\n }\n // generate all possible transitions: marking i, and then j.\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < n; j++) {\n if(i == j) continue;\n if((((s>>i) ^ (s>>j))&1) == 0) continue;\n const int c = abs(i - p) + abs(j - i);\n const int u = pack(j, s ^ (1<<i) ^ (1<<j), n); // swap\n if(ds[u] > d + c) {\n ds[u] = d + c;\n que.push(make_pair(-ds[u], u));\n //cout << \" to \" << i << \" and \" << j << \" cost \" << ds[u] << \" for \" << static_cast<std::bitset<8> >(u) << endl;\n }\n }\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":5380,"memory_kb":13796,"score_of_the_acc":-1.1854,"final_rank":18},{"submission_id":"aoj_2040_2588409","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\n\nstruct Info{\n\tInfo(int arg_state,int arg_sum_cost,int arg_loc){\n\t\tstate = arg_state;\n\t\tsum_cost = arg_sum_cost;\n\t\tloc = arg_loc;\n\t}\n\tbool operator<(const struct Info &arg) const{\n\t\treturn sum_cost > arg.sum_cost;\n\t}\n\tint state,sum_cost,loc;\n};\n\n\nint N;\nint POW[17],dp[65536][16],start_state,goal_state,ans_num[16];\nchar buf_start[17],buf_goal[17];\n\nvoid func(){\n\n\tscanf(\"%s\",buf_start);\n\n\tstart_state = 0;\n\n\tfor(int i = 0; buf_start[i] != '\\0'; i++){\n\t\tif(buf_start[i] == 'B'){\n\t\t\tstart_state += POW[i];\n\t\t}\n\t}\n\n\tscanf(\"%s\",buf_goal);\n\n\tgoal_state = 0;\n\n\tfor(int i = 0; buf_goal[i] != '\\0'; i++){\n\t\tif(buf_goal[i] == 'B'){\n\t\t\tgoal_state += POW[i];\n\t\t\tans_num[i] = 1;\n\t\t}else{\n\t\t\tans_num[i] = 0;\n\t\t}\n\t}\n\n\tif(start_state == goal_state){\n\t\tprintf(\"0\\n\");\n\t\treturn;\n\t}\n\n\tfor(int state = 0; state < POW[N]; state++){\n\t\tfor(int loc = 0; loc < N; loc++)dp[state][loc] = BIG_NUM;\n\t}\n\n\tpriority_queue<Info> Q;\n\tfor(int loc = 0; loc < N; loc++){\n\t\tdp[start_state][loc] = 0;\n\t\tQ.push(Info(start_state,0,loc));\n\t}\n\n\tint ans = BIG_NUM;\n\tint next_state,num_1,num_2,tmp_cost;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.top().state == goal_state){\n\t\t\tans = min(ans,Q.top().sum_cost);\n\t\t\tQ.pop();\n\t\t}else if(Q.top().sum_cost > dp[Q.top().state][Q.top().loc]){\n\t\t\tQ.pop();\n\t\t}else{\n\n\t\t\tfor(int mark_1 = 0; mark_1 < N; mark_1++){\n\t\t\t\tfor(int mark_2 = 0; mark_2 < N; mark_2++){\n\t\t\t\t\tif(mark_1 == mark_2)continue;\n\n\t\t\t\t\tif(Q.top().state & (1 << mark_1)){\n\t\t\t\t\t\tnum_1 = 1;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tnum_1 = 0;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(Q.top().state & (1 << mark_2)){\n\t\t\t\t\t\tnum_2 = 1;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tnum_2 = 0;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(num_1 == num_2)continue;\n\n\t\t\t\t\tif(num_1 == ans_num[mark_1] && num_2 == ans_num[mark_2])continue;\n\n\t\t\t\t\tif(num_1 == 1){\n\t\t\t\t\t\tnext_state = Q.top().state-POW[mark_1]+POW[mark_2];\n\t\t\t\t\t}else{ //num_2 == 1\n\t\t\t\t\t\tnext_state = Q.top().state+POW[mark_1]-POW[mark_2];\n\t\t\t\t\t}\n\n\t\t\t\t\ttmp_cost = abs(mark_1-Q.top().loc)+abs(mark_2-mark_1);\n\n\t\t\t\t\tif(dp[next_state][mark_2] > Q.top().sum_cost+tmp_cost){\n\t\t\t\t\t\tdp[next_state][mark_2] = Q.top().sum_cost+tmp_cost;\n\t\t\t\t\t\tQ.push(Info(next_state,Q.top().sum_cost+tmp_cost,mark_2));\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\tprintf(\"%d\\n\",ans);\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":3240,"memory_kb":16396,"score_of_the_acc":-1.079,"final_rank":17},{"submission_id":"aoj_2040_2310616","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n#define all(v) begin(v), end(v)\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)\n\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\n\nusing pint = pair<int, int>;\nusing tint = tuple<int, int, int>;\nusing vint = vector<int>;\n\nconst int inf = 1LL << 55;\nconst int mod = 1e9 + 7;\n\nint N;\nstring s, t;\nint mincost[16][1<<16];\nint sbit, tbit;\n\nstruct State {\n int now, cost, bit;\n State(){}\n State(int now, int cost, int bit):now(now), cost(cost), bit(bit){}\n bool operator < (const State &st) const {\n return cost > st.cost;\n }\n};\n\nint dijkstra(int pos) {\n fill(mincost[0], mincost[16], inf);\n mincost[pos][sbit] = 0;\n priority_queue<State> que;\n que.emplace(pos, 0, sbit);\n while(!que.empty()) {\n State st = que.top(); que.pop();\n int now = st.now, cost = st.cost, bit = st.bit;\n //cout << now << \" \"<< cost << endl;\n //rep(i, N) cout << (int)((bit>>i)&1);\n //cout << endl;\n if(bit == tbit) return cost;\n if(mincost[now][bit] < cost) continue;\n rep(i, N) if(i != now) {\n int ncost = cost + abs(i-now);\n if(ncost < mincost[i][bit]) {\n\tmincost[i][bit] = ncost;\n\tque.emplace(i, ncost, bit);\n }\n if(((bit>>i)&1) == ((bit>>now)&1)) continue;\n int nbit = bit^(1<<i)^(1<<now);\n //rep(i, N) cout << (int)((bit>>i)&1);cout<<endl;\n //cout<<now<<\" \"<<i<<endl;\n //cout << (int)((bit>>i)&1) << \" \"<<(int)((bit>>now)&1) << endl;\n //cout<<(int)(((bit>>i)&1) == ((bit>>now)&1)) << endl;\n //rep(i, N) cout << (int)((nbit>>i)&1);cout<<endl;\n //assert(__builtin_popcount(nbit) == __builtin_popcount(bit));\n if(ncost < mincost[i][nbit]) {\n\tmincost[i][nbit] = ncost;\n\tque.emplace(i, ncost, nbit);\n }\n }\n }\n return inf;\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, N) {\n cin >> s >> t;\n sbit = tbit = 0;\n rep(i, N) if(s[i] == 'B') sbit |= 1<<i;\n rep(i, N) if(t[i] == 'B') tbit |= 1<<i;\n int ans = inf;\n rep(i, N) {\n chmin(ans, dijkstra(i));\n //cout<<ans<<endl;//exit(0);\n }\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":7490,"memory_kb":21180,"score_of_the_acc":-1.9868,"final_rank":20},{"submission_id":"aoj_2040_2310084","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint dp[1<<16][16],n;\nint main() {\n while(cin >> n && n) {\n string s,s2;cin>>s>>s2;\n int r=0;\n for(int t=0;t<(1<<n);t++)for(int i=0;i<n;i++)dp[t][i]=1<<29;\n for(int i=0;i<n;i++)if(s[i]==s2[i]) r|=1<<i;\n for(int i=0;i<n;i++)dp[r][i]=0;\n for(int t=0;t<(1<<n);t++) {\n for(int i=0;i<n;i++) {\n if(dp[t][i]==1<<29) continue;\n for(int j=0;j<n;j++) {\n if(t&(1<<j)) continue;\n for(int k=j+1;k<n;k++) {\n if(t&(1<<k)||s[j]==s[k]) continue;\n dp[t|(1<<j)|(1<<k)][j]=min(dp[t|(1<<j)|(1<<k)][j],dp[t][i]+abs(i-k)+abs(k-j));\n dp[t|(1<<j)|(1<<k)][k]=min(dp[t|(1<<j)|(1<<k)][k],dp[t][i]+abs(i-j)+abs(j-k));\n }\n }\n }\n }\n int ans=1<<29;\n for(int i=0;i<n;i++)ans=min(ans,dp[(1<<n)-1][i]);\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":7092,"score_of_the_acc":-0.0003,"final_rank":1},{"submission_id":"aoj_2040_2309655","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint dp[1<<16][16],n;\nint main() {\n while(cin >> n && n) {\n string s,s2;cin>>s>>s2;\n int r=0;\n for(int t=0;t<(1<<n);t++)for(int i=0;i<n;i++)dp[t][i]=1<<29;\n for(int i=0;i<n;i++)if(s[i]==s2[i]) r|=1<<i;\n for(int i=0;i<n;i++)dp[r][i]=0;\n for(int t=0;t<(1<<n);t++) {\n for(int i=0;i<n;i++) {\n if(dp[t][i]==1<<29) continue;\n string e=\"\";\n for(int j=0; j<n;j++) {\n if(t&(1<<j)) e+='1';else e+='0';\n }\n for(int j=0;j<n;j++) {\n if(t&(1<<j)) continue;\n for(int k=j+1;k<n;k++) {\n if(t&(1<<k)||s[j]==s[k]) continue;\n dp[t|(1<<j)|(1<<k)][j]=min(dp[t|(1<<j)|(1<<k)][j],dp[t][i]+abs(i-k)+abs(k-j));\n dp[t|(1<<j)|(1<<k)][k]=min(dp[t|(1<<j)|(1<<k)][k],dp[t][i]+abs(i-j)+abs(j-k));\n }\n }\n }\n }\n int ans=1<<29;\n for(int i=0;i<n;i++)ans=min(ans,dp[(1<<n)-1][i]);\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":7236,"score_of_the_acc":-0.0171,"final_rank":3},{"submission_id":"aoj_2040_2309492","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nstring A,B;\nint n,Ab,Bb;\n\nint Bit(int bit ,int i,int x){\n while((bit>>i&1)!=x)bit ^= 1<<i;\n return bit;\n}\n\nint mem[16][1<<16],used[16][1<<16];\nint dep = 0;\nint dfs(short pos,int bit){\n cout<< dep++ <<endl;\n if(bit ==Bb) return 0;\n if(used[pos][bit]++) return mem[pos][bit];\n \n int &res = mem[pos][bit] = 1e9;\n for(int i=0;i<n;i++)\n for(int j=0;j<n;j++){\n int nbit = bit;\n nbit = Bit(nbit,i,bit>>j&1);\n nbit = Bit(nbit,j,bit>>i&1);\n res = min(res,abs(pos-i)+abs(i-j)+dfs(j,nbit));\n }\n cout<<dep<<endl;\n return mem[pos][bit];\n}\n\n\ntypedef pair<int,int> P;\ntypedef pair<int,P> PP;\nint bfs(){\n for(int j=0;j<16;j++) \n for(int i=0;i<(1<<16);i++)mem[j][i] = 1e9;\n \n priority_queue<PP,vector<PP>,greater<PP> > Q;\n for(int i=0;i<n;i++) Q.push(PP(0,P(i,Ab))),mem[i][Ab] = 0;\n while(!Q.empty()){\n PP t = Q.top();Q.pop();\n int cost = t.first;\n int pos = t.second.first;\n int bit = t.second.second;\n if(bit == Bb) return cost;\n if(mem[pos][bit]<cost)continue;\n \n for(int i=0;i<n;i++)\n for(int j=0;j<n;j++){\n\tint nbit = bit;\n\tnbit = Bit(nbit,i,bit>>j&1);\n\tnbit = Bit(nbit,j,bit>>i&1);\n\tint ncost = cost+abs(pos-i)+abs(i-j);\n\tif(ncost >= mem[j][nbit])continue;\n\tQ.push(PP(ncost,P(j,nbit)));\n\tmem[j][nbit] = ncost;\n }\n }\n assert(0); \n}\n\n\nint main(){\n \n while(cin>>n,n){\n cin>>A>>B;\n \n Ab = Bb = 0;\n for(int i=0;i<n;i++)Ab|=(A[i]=='W')<<i, Bb|=(B[i]=='W')<<i;\n \n memset(used,0,sizeof(used));\n int ans = 1e9;\n //for(int i=0;i<n;i++) ans=min(ans,dfs(i,Ab));\n //cout<<ans<<endl;\n cout<<bfs()<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":3040,"memory_kb":21368,"score_of_the_acc":-1.4003,"final_rank":19},{"submission_id":"aoj_2040_2309377","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint dp[1<<16][16];\nint main() {\n int n;\n while(cin >> n && n) {\n string s,s2;\n cin >> s >> s2;\n int r=0;\n for(int t=0;t<(1<<n);t++)for(int i=0;i<n;i++)dp[t][i]=1<<29;\n for(int i=0;i<n;i++)if(s[i]==s2[i]) r|=1<<i;\n for(int i=0;i<n;i++)dp[r][i]=0;\n for(int t=0;t<(1<<n);t++) {\n for(int i=0;i<n;i++) {\n if(dp[t][i]==1<<29) continue;\n string e=\"\";\n for(int j=0; j<n;j++) {\n if(t&(1<<j)) e+='1';\n else e+='0';\n }\n for(int j=0;j<n;j++) {\n if(t&(1<<j)) continue;\n for(int k=j+1;k<n;k++) {\n if(t&(1<<k)||s[j]==s[k]) continue;\n dp[t|(1<<j)|(1<<k)][j]=min(dp[t|(1<<j)|(1<<k)][j],dp[t][i]+abs(i-k)+abs(k-j));\n dp[t|(1<<j)|(1<<k)][k]=min(dp[t|(1<<j)|(1<<k)][k],dp[t][i]+abs(i-j)+abs(j-k));\n }\n }\n }\n }\n int ans=1<<29;\n for(int i=0;i<n;i++)ans=min(ans,dp[(1<<n)-1][i]);\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":7268,"score_of_the_acc":-0.022,"final_rank":4},{"submission_id":"aoj_2040_2137800","code_snippet":"#include<iostream>\n#include<queue>\n#include<string>\n#include<cmath>\nusing namespace std;\nint n, s, t; int dp[16][65536], p[16][16];\nqueue<pair<int, int>>Q;\nint main() {\n\twhile (true) {\n\t\tcin >> n; s = 0; t = 0; if (n == 0)break;\n\t\tfor (int i = 0; i < n; i++) { for (int j = 0; j < (1 << n); j++)dp[i][j] = 999999999; }\n\t\tstring S1; cin >> S1; for (int i = 0; i < S1.size(); i++) { if (S1[i] == 'B')s += (1 << i); }\n\t\tstring S2; cin >> S2; for (int i = 0; i < S2.size(); i++) { if (S2[i] == 'B')t += (1 << i); }\n\t\tfor (int i = 0; i < n; i++) { dp[i][s] = 0; Q.push(make_pair(i, s)); }\n\t\twhile (!Q.empty()) {\n\t\t\tint a1 = Q.front().first, a2 = Q.front().second; Q.pop();\n\t\t\tif (a1 < n - 1 && dp[a1 + 1][a2] > dp[a1][a2] + 1) { dp[a1 + 1][a2] = dp[a1][a2] + 1; Q.push(make_pair(a1 + 1, a2)); }\n\t\t\tif (a1 >= 1 && dp[a1 - 1][a2] > dp[a1][a2] + 1) { dp[a1 - 1][a2] = dp[a1][a2] + 1; Q.push(make_pair(a1 - 1, a2)); }\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tint bit[20]; for (int j = 0; j < n; j++)bit[j] = (a2 / (1 << j)) % 2;\n\t\t\t\tswap(bit[i], bit[a1]); int cost = abs(i - a1);\n\t\t\t\tint ret = 0; for (int j = 0; j < n; j++)ret += (1 << j)*bit[j];\n\t\t\t\tif (dp[i][ret] > dp[a1][a2] + cost) { dp[i][ret] = dp[a1][a2] + cost; Q.push(make_pair(i, ret)); }\n\t\t\t}\n\t\t}\n\t\tint minx = 999999999; for (int i = 0; i < n; i++)minx = min(minx, dp[i][t]);\n\t\tcout << minx << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":5410,"memory_kb":7584,"score_of_the_acc":-0.7544,"final_rank":16}],"string":"[\n {\n \"submission_id\": \"aoj_2040_10853102\",\n \"code_snippet\": \"#include <cstring>\\n#include <iostream>\\n#include <string>\\n\\nusing namespace std;\\n\\nint getStat(string arg) {\\n\\tint ret = 0;\\n\\tfor(char ch: arg)\\n\\t\\tif(ch == 'B') ret = ret * 2 + 1;\\n\\t\\telse ret *= 2;\\n\\treturn ret;\\n}\\n\\nint dp[1 << 16][16];\\nint n, goal;\\n\\nint getAns(int stat, int machine) {\\n\\tint &ret = dp[stat][machine];\\n\\tif(ret != -1) return ret;\\n\\n\\tret = 0;\\n\\tif(stat != goal) {\\n\\t\\tret = (1 << 29);\\n\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\tfor(int j = 0; j < n; j++) {\\n\\t\\t\\t\\tif((stat & (1 << i)) > 0 != (stat & (1 << j)) > 0) {\\n\\t\\t\\t\\t\\tif(\\t(stat & (1 << i)) != (goal & (1 << i)) and\\n\\t\\t\\t\\t\\t\\t(stat & (1 << j)) != (goal & (1 << j))) {\\n\\t\\t\\t\\t\\t\\tret = min(ret, getAns(stat ^ (1 << i) ^ (1 << j), j) + abs(machine - i) + abs(i - j));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nint main(void) {\\n\\twhile(cin >> n, n > 0) {\\n\\t\\tstring start, end;\\n\\t\\tcin >> start >> end;\\n\\t\\tgoal = getStat(end);\\n\\t\\tmemset(dp, -1, sizeof(dp));\\n\\t\\tint ans = (1 << 30);\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tans = min(ans, getAns(getStat(start), i));\\n\\t\\tcout << ans << \\\"\\\\n\\\";\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 7464,\n \"score_of_the_acc\": -0.0398,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2040_9595976\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int inf = 0x3f000000;\\nbool cmp(int x, int y) {\\n return __builtin_popcount(x) < __builtin_popcount(y);\\n}\\nint main() {\\n int n;\\n while (true) {\\n scanf(\\\"%d\\\", &n);\\n if (!n) {\\n fflush(stdout);\\n exit(0);\\n }\\n char s[18], t[18];\\n scanf(\\\"%s\\\", s);\\n scanf(\\\"%s\\\", t);\\n vector<vector<int> > dp(1 << n, vector<int>(n, inf));\\n int mask = 0;\\n for (int i = 0; i < n; ++i) {\\n mask |= (s[i] == t[i]) << i;\\n }\\n fill(dp[mask].begin(), dp[mask].end(), 0);\\n vector<int> masks;\\n for (int i = 0; i < (1 << n); ++i) {\\n masks.push_back(i);\\n }\\n sort(masks.begin(), masks.end(), cmp);\\n for (int z = 0; z < (1 << n); ++ z) { int cur = masks[z];\\n for (int pos = 0; pos < n; ++pos) {\\n if (dp[cur][pos] == inf) continue;\\n for (int i = 0; i < n; ++i) {\\n if (cur >> i & 1) continue;\\n for (int j = 0; j < n; ++j) {\\n if ((cur >> j & 1) || s[i] == s[j]) continue;\\n int after = cur | (1 << i) | (1 << j);\\n int dist = abs(pos - j) + abs(j - i);\\n dp[after][i] = min(dp[after][i], dp[cur][pos] + dist);\\n }\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\", *min_element(dp[(1 << n) - 1].begin(), dp[(1 << n) - 1].end()));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 9892,\n \"score_of_the_acc\": -0.2274,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2040_9595961\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int inf = 0x3f000000;\\nbool cmp(int x, int y) {\\n return __builtin_popcount(x) < __builtin_popcount(y);\\n}\\nint main() {\\n int n;\\n while (cin >> n) {\\n if (!n) {\\n fflush(stdout);\\n return 0;\\n }\\n string s, t;\\n cin >> s >> t;\\n vector<vector<int> > dp(1 << n, vector<int>(n, inf));\\n int mask = 0;\\n for (int i = 0; i < n; ++i) {\\n mask |= (s[i] == t[i]) << i;\\n }\\n fill(dp[mask].begin(), dp[mask].end(), 0);\\n vector<int> masks;\\n for (int i = 0; i < (1 << n); ++i) {\\n masks.push_back(i);\\n }\\n sort(masks.begin(), masks.end(), cmp);\\n for (int cur : masks) {\\n for (int pos = 0; pos < n; ++pos) {\\n if (dp[cur][pos] == inf) continue;\\n for (int i = 0; i < n; ++i) {\\n if (cur >> i & 1) continue;\\n for (int j = 0; j < n; ++j) {\\n if ((cur >> j & 1) || s[i] == s[j]) continue;\\n int after = cur | (1 << i) | (1 << j);\\n int dist = abs(pos - j) + abs(j - i);\\n dp[after][i] = min(dp[after][i], dp[cur][pos] + dist);\\n }\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\", *min_element(dp[(1 << n) - 1].begin(), dp[(1 << n) - 1].end()));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 10596,\n \"score_of_the_acc\": -0.2645,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2040_9595960\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int inf = 0x3f000000;\\nbool cmp(int x, int y) {\\n return __builtin_popcount(x) < __builtin_popcount(y);\\n}\\nint main() {\\n int n;\\n while (cin >> n) {\\n if (!n) return 0;\\n string s, t;\\n cin >> s >> t;\\n vector<vector<int> > dp(1 << n, vector<int>(n, inf));\\n int mask = 0;\\n for (int i = 0; i < n; ++i) {\\n mask |= (s[i] == t[i]) << i;\\n }\\n fill(dp[mask].begin(), dp[mask].end(), 0);\\n vector<int> masks;\\n for (int i = 0; i < (1 << n); ++i) {\\n masks.push_back(i);\\n }\\n sort(masks.begin(), masks.end(), cmp);\\n for (int cur : masks) {\\n for (int pos = 0; pos < n; ++pos) {\\n if (dp[cur][pos] == inf) continue;\\n for (int i = 0; i < n; ++i) {\\n if (cur >> i & 1) continue;\\n for (int j = 0; j < n; ++j) {\\n if ((cur >> j & 1) || s[i] == s[j]) continue;\\n int after = cur | (1 << i) | (1 << j);\\n int dist = abs(pos - j) + abs(j - i);\\n dp[after][i] = min(dp[after][i], dp[cur][pos] + dist);\\n }\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\", *min_element(dp[(1 << n) - 1].begin(), dp[(1 << n) - 1].end()));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 10356,\n \"score_of_the_acc\": -0.2504,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2040_9595959\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int inf = 0x3f000000;\\nbool cmp(int x, int y) {\\n return __builtin_popcount(x) < __builtin_popcount(y);\\n}\\nint main() {\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n int n;\\n while (cin >> n) {\\n if (!n) return 0;\\n string s, t;\\n cin >> s >> t;\\n vector<vector<int> > dp(1 << n, vector<int>(n, inf));\\n int mask = 0;\\n for (int i = 0; i < n; ++i) {\\n mask |= (s[i] == t[i]) << i;\\n }\\n fill(dp[mask].begin(), dp[mask].end(), 0);\\n vector<int> masks;\\n for (int i = 0; i < (1 << n); ++i) {\\n masks.push_back(i);\\n }\\n sort(masks.begin(), masks.end(), cmp);\\n for (int cur : masks) {\\n for (int pos = 0; pos < n; ++pos) {\\n if (dp[cur][pos] == inf) continue;\\n for (int i = 0; i < n; ++i) {\\n if (cur >> i & 1) continue;\\n for (int j = 0; j < n; ++j) {\\n if ((cur >> j & 1) || s[i] == s[j]) continue;\\n int after = cur | (1 << i) | (1 << j);\\n int dist = abs(pos - j) + abs(j - i);\\n dp[after][i] = min(dp[after][i], dp[cur][pos] + dist);\\n }\\n }\\n }\\n }\\n cout << *min_element(dp[(1 << n) - 1].begin(), dp[(1 << n) - 1].end()) << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 10484,\n \"score_of_the_acc\": -0.2594,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2040_9595956\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int inf = 0x3f000000;\\nbool cmp(int x, int y) {\\n return __builtin_popcount(x) < __builtin_popcount(y);\\n}\\nint dp[1 << 16][16];\\nint main() {\\n int n;\\n while (true) {\\n cin >> n;\\n if (!n) return 0;\\n string s, t;\\n cin >> s >> t;\\n int mask = 0, c = 0;\\n for (int i = 0; i < n; ++i) {\\n mask |= (s[i] == t[i]) << i;\\n }\\n c = __builtin_popcount(mask) % 2;\\n for (int i = 0; i < (1 << n); ++i) {\\n for (int j = 0; j < n; ++j) {\\n dp[i][j] = inf;\\n }\\n }\\n for (int i = 0; i < n; ++i) dp[mask][i] = 0;\\n vector<int> masks;\\n for (int i = 0; i < (1 << n); ++i) {\\n if (__builtin_popcount(i) % 2 == c) masks.push_back(i);\\n }\\n sort(masks.begin(), masks.end(), cmp);\\n for (int cur : masks) {\\n for (int pos = 0; pos < n; ++pos) {\\n if (dp[cur][pos] == inf) continue;\\n for (int i = 0; i < n; ++i) {\\n if (cur >> i & 1) continue;\\n for (int j = 0; j < n; ++j) {\\n if ((cur >> j & 1) || s[i] == s[j]) continue;\\n int after = cur | (1 << i) | (1 << j);\\n int dist = abs(pos - j) + abs(j - i);\\n dp[after][i] = min(dp[after][i], dp[cur][pos] + dist);\\n }\\n }\\n }\\n }\\n int ans = inf;\\n for (int i = 0; i < n; ++i) ans = min(ans, dp[(1 << n) - 1][i]);\\n cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 7552,\n \"score_of_the_acc\": -0.0392,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2040_2743729\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n \\nusing namespace std;\\n \\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n \\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\\\" \\\"; cout<<endl; }\\n \\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint N;\\nstring s, g;\\nint dp[1<<16][16];\\nint dfs(int S, int u){\\n if(S == (1<<N) - 1) return 0;\\n if(dp[S][u] != -1) return dp[S][u];\\n int res = INF;\\n REP(i, N)REP(j, N) if(i != j && (S >> i & 1) == 0 && (S >> j & 1) == 0 && g[i] != g[j]){\\n res = min(res, abs(u - i) + abs(i - j) + dfs(S | 1 << i | 1 << j, j));\\n }\\n return dp[S][u] = res;\\n}\\nint main(){\\n while(cin>>N && N){\\n cin>>s>>g;\\n REP(S, 1<<N) REP(p, N) dp[S][p] = -1;\\n int S = 0;\\n REP(i, N) if(s[i] == g[i]) S |= 1<<i;\\n int ans = INF;\\n REP(i, N) ans = min(ans, dfs(S, i));\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 7176,\n \"score_of_the_acc\": -0.0223,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2040_2666169\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\n\\nstruct aa {\\n\\tbitset<16>bs;\\n\\tint cost;\\n\\tint now;\\n};\\nclass Compare {\\npublic:\\n\\tbool operator()(const aa&l, const aa&r) {\\n\\t\\treturn l.cost>r.cost;\\n\\t}\\n};\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tint N;cin>>N;\\n\\t\\tif(!N)break;\\n\\t\\tstring a,b;cin>>a>>b;\\n\\t\\tbitset<16>start,goal;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tif(a[i]=='B')start[i]=true;\\n\\t\\t\\tif(b[i]=='B')goal[i]=true;\\n\\t\\t}\\n\\t\\tvector<vector<int>>memo((1<<N),vector<int>(N,1e9));\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tmemo[start.to_ulong()][i]=0;\\n\\t\\t}\\n\\n\\t\\tpriority_queue<aa,vector<aa>,Compare>que;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tque.push(aa{ start,0,i });\\n\\t\\t}\\n\\n\\t\\tint ans=1e9;\\n\\t\\twhile (!que.empty()) {\\n\\t\\t\\tauto atop(que.top());\\n\\t\\t\\tque.pop();\\n\\n\\t\\t\\tbitset<16>bs(atop.bs);\\n\\t\\t\\tconst int cost(atop.cost);\\n\\t\\t\\tconst int now(atop.now);\\n\\t\\t\\tif (bs == goal) {\\n\\t\\t\\t\\tans=min(ans,cost);\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\t\\tint u=bs[now];\\n\\t\\t\\t\\tbs[now]=bs[i];\\n\\t\\t\\t\\tbs[i]=u;\\n\\t\\t\\t\\tconst int next_cost=cost+(abs(now-i));\\n\\t\\t\\t\\tif (memo[bs.to_ulong()][i] > next_cost) {\\n\\t\\t\\t\\t\\tmemo[bs.to_ulong()][i]=next_cost;\\n\\t\\t\\t\\t\\tque.push(aa{ bs,next_cost,i });\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tu = bs[now];\\n\\t\\t\\t\\tbs[now] = bs[i];\\n\\t\\t\\t\\tbs[i] = u;\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\t\\tconst int next_cost = cost + (abs(now - i));\\n\\t\\t\\t\\tif (memo[bs.to_ulong()][i] > next_cost) {\\n\\t\\t\\t\\t\\tmemo[bs.to_ulong()][i] = next_cost;\\n\\t\\t\\t\\t\\tque.push(aa{ bs,next_cost,i });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1080,\n \"memory_kb\": 15780,\n \"score_of_the_acc\": -0.7448,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2040_2602113\",\n \"code_snippet\": \"#include <functional>\\n#include <iostream>\\n#include <limits>\\n#include <string>\\n#include <vector>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n while (true) {\\n int n;\\n cin >> n;\\n if (n == 0) {\\n return 0;\\n }\\n\\n string init;\\n string final;\\n cin >> init;\\n cin >> final;\\n\\n auto encode = [](const string& s) {\\n int r = 0b0;\\n for (int i = 0; i < s.size(); ++i) {\\n if (i != 0) {\\n r <<= 1;\\n }\\n if (s[i] == 'B') {\\n r |= 0b1;\\n }\\n }\\n return r;\\n };\\n\\n auto target = encode(final);\\n auto start = encode(init);\\n\\n vector<vector<int>> memo(n, vector<int>(1 << n, -1));\\n // p ??????????????´?????¶?????? s ?????¨??????????°???????????????????\\n function<int(int, int)> f = [&f, &memo, n, start](int p, int s) -> int {\\n if (memo[p][s] != -1) {\\n return memo[p][s];\\n }\\n\\n // ??????????????´????????????\\n if (s == 0) {\\n return 0;\\n }\\n\\n int min_ = numeric_limits<int>::max();\\n for (int i = 0; i < n; ++i) {\\n // i ??????????????§????????´????????????\\n if (((s >> i) & 1) == 0) {\\n continue;\\n }\\n for (int j = 0; j < n; ++j) {\\n if (i == j) {\\n continue;\\n }\\n // j ??????????????§????????´????????????\\n else if ((s >> j & 1) == 0) {\\n continue;\\n }\\n // ?????????????????\\\\????????????????°???????????????????\\n else if ((((start >> i) & 1) ^ ((start >> j) & 1)) == 0) {\\n continue;\\n }\\n else {\\n // p ?????? i ?????§?????£???, i ?????? j ?????§??????\\n auto cost = abs(i - p) + abs(j - i);\\n min_ = min(min_, cost + f(j, s ^ (1 << i) ^ (1 << j)));\\n }\\n }\\n }\\n memo[p][s] = min_;\\n\\n return min_;\\n };\\n\\n int min_ = numeric_limits<int>::max();\\n // ????????????????????????????????????\\n for (int i = 0; i < n; ++i) {\\n min_ = min(min_, f(i, start ^ target));\\n }\\n cout << min_ << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 7332,\n \"score_of_the_acc\": -0.0279,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2040_2602110\",\n \"code_snippet\": \"#include <bitset>\\n#include <functional>\\n#include <iostream>\\n#include <limits>\\n#include <string>\\n#include <vector>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n while (true) {\\n int n;\\n cin >> n;\\n if (n == 0) {\\n return 0;\\n }\\n\\n string init;\\n string final;\\n cin >> init;\\n cin >> final;\\n\\n auto encode = [](const string& s) {\\n int r = 0b0;\\n for (int i = 0; i < s.size(); ++i) {\\n if (i != 0) {\\n r <<= 1;\\n }\\n if (s[i] == 'B') {\\n r |= 0b1;\\n }\\n }\\n return r;\\n };\\n\\n auto pow = [](int b, int e) {\\n int r = 1;\\n for (int i = 0; i < e; ++i) {\\n r *= b;\\n }\\n return r;\\n };\\n\\n auto target = encode(final);\\n auto start = encode(init);\\n\\n vector<vector<int>> memo(n, vector<int>(pow(2, n), -1));\\n // p ??????????????´?????¶?????? s ?????¨??????????°???????????????????\\n function<int(int, int)> f = [&f, &memo, n, &pow, start](int p,\\n int s) -> int {\\n if (memo[p][s] != -1) {\\n return memo[p][s];\\n }\\n\\n // ??????????????´????????????\\n if (s == 0) {\\n return 0;\\n }\\n\\n int min_ = numeric_limits<int>::max();\\n int pp = -1;\\n for (int i = 0; i < n; ++i) {\\n // i ??????????????§????????´????????????\\n if (((s >> i) & 1) == 0) {\\n continue;\\n }\\n for (int j = 0; j < n; ++j) {\\n if (i == j) {\\n continue;\\n }\\n // j ??????????????§????????´????????????\\n else if ((s >> j & 1) == 0) {\\n continue;\\n }\\n // ?????????????????\\\\????????????????°???????????????????\\n else if ((((start >> i) & 1) ^ ((start >> j) & 1)) == 0) {\\n continue;\\n }\\n else {\\n // p ?????? i ?????§?????£???, i ?????? j ?????§??????\\n auto cost = abs(i - p) + abs(j - i);\\n auto ss = s;\\n ss ^= 1 << i;\\n ss ^= 1 << j;\\n auto min__ = min_;\\n min_ = min(min_, cost + f(j, ss));\\n if (min__ != min_) {\\n pp = p;\\n }\\n }\\n }\\n }\\n memo[pp][s] = min_;\\n\\n return min_;\\n };\\n\\n int min_ = numeric_limits<int>::max();\\n for (int i = 0; i < n; ++i) {\\n min_ = min(min_, f(i, start ^ target));\\n }\\n cout << min_ << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 7280,\n \"score_of_the_acc\": -0.0256,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2040_2602109\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <fstream>\\n#include <functional>\\n#include <iostream>\\n#include <limits>\\n#include <string>\\n#include <vector>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n //ifstream cin(\\\"/Volumes/env1/work/aoj/2040/a\\\");\\n while (true) {\\n int n;\\n cin >> n;\\n if (n == 0) {\\n return 0;\\n }\\n\\n string init;\\n string final;\\n cin >> init;\\n cin >> final;\\n\\n auto encode = [](const string& s) {\\n int r = 0b0;\\n for (int i = 0; i < s.size(); ++i) {\\n if (i != 0) {\\n r <<= 1;\\n }\\n if (s[i] == 'B') {\\n r |= 0b1;\\n }\\n }\\n return r;\\n };\\n\\n auto pow = [](int b, int e) {\\n int r = 1;\\n for (int i = 0; i < e; ++i) {\\n r *= b;\\n }\\n return r;\\n };\\n\\n auto target = encode(final);\\n auto start = encode(init);\\n\\n vector<vector<int>> memo(n, vector<int>(pow(2, n), -1));\\n // p ??????????????´?????¶?????? s ?????¨??????????°???????????????????\\n function<int(int, int)> f = [&f, &memo, n, &pow, start](int p,\\n int s) -> int {\\n //cout << static_cast<bitset<8>>(s) << endl;\\n if (memo[p][s] != -1) {\\n //cout << \\\"memo1\\\" << p << ' ' << s << endl;\\n return memo[p][s];\\n }\\n\\n // ??????????????´????????????\\n if (s == 0) {\\n return 0;\\n }\\n\\n int min_ = numeric_limits<int>::max();\\n int pp = -1;\\n for (int i = 0; i < n; ++i) {\\n // i ??????????????§????????´????????????\\n if (((s >> i) & 1) == 0) {\\n continue;\\n }\\n for (int j = 0; j < n; ++j) {\\n if (i == j) {\\n continue;\\n }\\n // j ??????????????§????????´????????????\\n else if ((s >> j & 1) == 0) {\\n continue;\\n }\\n // ?????????????????\\\\????????????????°???????????????????\\n else if ((((start >> i) & 1) ^ ((start >> j) & 1)) == 0) {\\n continue;\\n }\\n else {\\n // p ?????? i ?????§?????£???, i ?????? j ?????§??????\\n auto cost = abs(i - p) + abs(j - i);\\n auto ss = s;\\n ss ^= 1 << i;\\n ss ^= 1 << j;\\n //cout << \\\"pos: \\\" << p << \\\" swap \\\" << i << \\\", \\\" << j\\n // << \\\": \\\" << static_cast<bitset<8>>(s) << \\\" to \\\"\\n // << static_cast<bitset<8>>(ss) << \\\" cost \\\" << cost\\n // << endl;\\n auto min__ = min_;\\n min_ = min(min_, cost + f(j, ss));\\n if (min__ != min_) {\\n pp = p;\\n }\\n }\\n }\\n }\\n //cout << \\\"write memo \\\" << pp << \\\" \\\" << static_cast<bitset<8>>(s) << endl;\\n memo[pp][s] = min_;\\n assert(min_ != -1);\\n\\n return min_;\\n };\\n\\n int min_ = numeric_limits<int>::max();\\n for (int i = 0; i < n; ++i) {\\n min_ = min(min_, f(i, start ^ target));\\n }\\n cout << min_ << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 7348,\n \"score_of_the_acc\": -0.029,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2040_2602059\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <bitset>\\n#include <string>\\n#include <map>\\n#include <queue>\\n#include <functional>\\n#include <assert.h>\\nusing namespace std;\\ninline int pack(int p, int ps, int n) {\\n return (p << n) | ps;\\n}\\nint main(int argc, char *argv[])\\n{\\n for(;;) {\\n int n;\\n cin >> n;\\n if(n==0) break;\\n string sa, sb;\\n getline(cin, sa);\\n getline(cin, sa);\\n getline(cin, sb);\\n auto conv = [n](string &s) {\\n int r = 0;\\n for(int i = 0; i < n; i++) {\\n r = (r<<1) + (s[i] == 'W' ? 1 : 0); \\n }\\n return r;\\n };\\n const int a = conv(sa);\\n const int b = conv(sb);\\n //cout << \\\"a = \\\" << static_cast<std::bitset<8> >(a) << endl;\\n //cout << \\\"b = \\\" << static_cast<std::bitset<8> >(b) << endl;\\n // better DP: state = (head-pos, difference)\\n vector<int> ds(n<<n, -1);\\n function<int(int)> rec = [&rec,&b,&n,&ds](const int v){\\n if(ds[v] >= 0) return ds[v];\\n const int p = v >> n;\\n const int s = v & ((1<<n) - 1);\\n if(s == 0) return 0;\\n int e = 10000000;\\n for(int i = 0; i < n; i++) {\\n if((s & (1<<i)) == 0) continue;\\n for(int j = 0; j < n; j++) {\\n if(i == j) continue;\\n if((s & (1<<j)) == 0) continue;\\n if((((b>>i) ^ (b>>j))&1) == 0) continue;\\n const int c = abs(i - p) + abs(j - i);\\n const int u = pack(j, s ^ (1<<i) ^ (1<<j), n); // swap\\n e = min(e, c + rec(u));\\n }\\n }\\n ds[v] = e;\\n return e;\\n };\\n int e = 10000000;\\n for(int i = 0; i < n; i++) {\\n e = min(e, rec(pack(i, a^b, n)));\\n }\\n cout << e << endl;\\n/* // naive Dijkstra search: state = (head-pos, panels)\\n vector<int> ds(n<<n, 100000000);\\n priority_queue<pair<int,int>> que;\\n for(int i = 0; i < n; i++) {\\n int v = pack(i, a, n);\\n ds[v] = 0;\\n que.push(make_pair(-ds[v], v));\\n \\n }\\n vector<bool> done(n, false);\\n int rest = n;\\n while(que.size() > 0) {\\n auto dv = que.top(); que.pop();\\n const int v = dv.second;\\n const int d = -dv.first;\\n const int p = v >> n;\\n const int s = v & ((1<<n) - 1);\\n //cout << \\\"popped: \\\" << static_cast<std::bitset<8> >(s) << \\\" at \\\" << p << \\\" with cost \\\" << d << endl;\\n if(s == b) {\\n if(!done[p]) {\\n done[p] = true;\\n rest--;\\n }\\n if(rest == 0) {\\n int e = d;\\n for(int i = 0; i < n; i++) {\\n e = min(e, ds[pack(i, b, n)]);\\n }\\n cout << e << endl;\\n break;\\n }\\n }\\n // generate all possible transitions: marking i, and then j.\\n for(int i = 0; i < n; i++) {\\n for(int j = 0; j < n; j++) {\\n if(i == j) continue;\\n if((((s>>i) ^ (s>>j))&1) == 0) continue;\\n const int c = abs(i - p) + abs(j - i);\\n const int u = pack(j, s ^ (1<<i) ^ (1<<j), n); // swap\\n if(ds[u] > d + c) {\\n ds[u] = d + c;\\n que.push(make_pair(-ds[u], u));\\n //cout << \\\" to \\\" << i << \\\" and \\\" << j << \\\" cost \\\" << ds[u] << \\\" for \\\" << static_cast<std::bitset<8> >(u) << endl;\\n }\\n }\\n }\\n }\\n*/\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 7088,\n \"score_of_the_acc\": -0.0094,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2040_2601978\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <bitset>\\n#include <string>\\n#include <map>\\n#include <queue>\\n#include <functional>\\n#include <assert.h>\\nusing namespace std;\\ninline int pack(int p, int ps, int n) {\\n return (p << n) | ps;\\n}\\nint main(int argc, char *argv[])\\n{\\n for(;;) {\\n int n;\\n cin >> n;\\n if(n==0) break;\\n string sa, sb;\\n getline(cin, sa);\\n getline(cin, sa);\\n getline(cin, sb);\\n auto conv = [n](string &s) {\\n int r = 0;\\n for(int i = 0; i < n; i++) {\\n r = (r<<1) + (s[i] == 'W' ? 1 : 0); \\n }\\n return r;\\n };\\n int a = conv(sa);\\n int b = conv(sb);\\n //cout << \\\"a = \\\" << static_cast<std::bitset<8> >(a) << endl;\\n //cout << \\\"b = \\\" << static_cast<std::bitset<8> >(b) << endl;\\n\\n // state = (pos, panels)\\n vector<int> ds(n<<n, 100000000);\\n priority_queue<pair<int,int>> que;\\n for(int i = 0; i < n; i++) {\\n int v = pack(i, a, n);\\n ds[v] = 0;\\n que.push(make_pair(-ds[v], v));\\n \\n }\\n vector<bool> done(n, false);\\n int rest = n;\\n while(que.size() > 0) {\\n auto dv = que.top(); que.pop();\\n const int v = dv.second;\\n const int d = -dv.first;\\n const int p = v >> n;\\n const int s = v & ((1<<n) - 1);\\n //cout << \\\"popped: \\\" << static_cast<std::bitset<8> >(s) << \\\" at \\\" << p << \\\" with cost \\\" << d << endl;\\n if(s == b) {\\n if(!done[p]) {\\n done[p] = true;\\n rest--;\\n }\\n if(rest == 0) {\\n int e = d;\\n for(int i = 0; i < n; i++) {\\n e = min(e, ds[pack(i, b, n)]);\\n }\\n cout << e << endl;\\n break;\\n }\\n }\\n // generate all possible transitions: marking i, and then j.\\n for(int i = 0; i < n; i++) {\\n for(int j = 0; j < n; j++) {\\n if(i == j) continue;\\n if((((s>>i) ^ (s>>j))&1) == 0) continue;\\n const int c = abs(i - p) + abs(j - i);\\n const int u = pack(j, s ^ (1<<i) ^ (1<<j), n); // swap\\n if(ds[u] > d + c) {\\n ds[u] = d + c;\\n que.push(make_pair(-ds[u], u));\\n //cout << \\\" to \\\" << i << \\\" and \\\" << j << \\\" cost \\\" << ds[u] << \\\" for \\\" << static_cast<std::bitset<8> >(u) << endl;\\n }\\n }\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5380,\n \"memory_kb\": 13796,\n \"score_of_the_acc\": -1.1854,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2040_2588409\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nstruct Info{\\n\\tInfo(int arg_state,int arg_sum_cost,int arg_loc){\\n\\t\\tstate = arg_state;\\n\\t\\tsum_cost = arg_sum_cost;\\n\\t\\tloc = arg_loc;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{\\n\\t\\treturn sum_cost > arg.sum_cost;\\n\\t}\\n\\tint state,sum_cost,loc;\\n};\\n\\n\\nint N;\\nint POW[17],dp[65536][16],start_state,goal_state,ans_num[16];\\nchar buf_start[17],buf_goal[17];\\n\\nvoid func(){\\n\\n\\tscanf(\\\"%s\\\",buf_start);\\n\\n\\tstart_state = 0;\\n\\n\\tfor(int i = 0; buf_start[i] != '\\\\0'; i++){\\n\\t\\tif(buf_start[i] == 'B'){\\n\\t\\t\\tstart_state += POW[i];\\n\\t\\t}\\n\\t}\\n\\n\\tscanf(\\\"%s\\\",buf_goal);\\n\\n\\tgoal_state = 0;\\n\\n\\tfor(int i = 0; buf_goal[i] != '\\\\0'; i++){\\n\\t\\tif(buf_goal[i] == 'B'){\\n\\t\\t\\tgoal_state += POW[i];\\n\\t\\t\\tans_num[i] = 1;\\n\\t\\t}else{\\n\\t\\t\\tans_num[i] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\tif(start_state == goal_state){\\n\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tfor(int state = 0; state < POW[N]; state++){\\n\\t\\tfor(int loc = 0; loc < N; loc++)dp[state][loc] = BIG_NUM;\\n\\t}\\n\\n\\tpriority_queue<Info> Q;\\n\\tfor(int loc = 0; loc < N; loc++){\\n\\t\\tdp[start_state][loc] = 0;\\n\\t\\tQ.push(Info(start_state,0,loc));\\n\\t}\\n\\n\\tint ans = BIG_NUM;\\n\\tint next_state,num_1,num_2,tmp_cost;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif(Q.top().state == goal_state){\\n\\t\\t\\tans = min(ans,Q.top().sum_cost);\\n\\t\\t\\tQ.pop();\\n\\t\\t}else if(Q.top().sum_cost > dp[Q.top().state][Q.top().loc]){\\n\\t\\t\\tQ.pop();\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int mark_1 = 0; mark_1 < N; mark_1++){\\n\\t\\t\\t\\tfor(int mark_2 = 0; mark_2 < N; mark_2++){\\n\\t\\t\\t\\t\\tif(mark_1 == mark_2)continue;\\n\\n\\t\\t\\t\\t\\tif(Q.top().state & (1 << mark_1)){\\n\\t\\t\\t\\t\\t\\tnum_1 = 1;\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tnum_1 = 0;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(Q.top().state & (1 << mark_2)){\\n\\t\\t\\t\\t\\t\\tnum_2 = 1;\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tnum_2 = 0;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(num_1 == num_2)continue;\\n\\n\\t\\t\\t\\t\\tif(num_1 == ans_num[mark_1] && num_2 == ans_num[mark_2])continue;\\n\\n\\t\\t\\t\\t\\tif(num_1 == 1){\\n\\t\\t\\t\\t\\t\\tnext_state = Q.top().state-POW[mark_1]+POW[mark_2];\\n\\t\\t\\t\\t\\t}else{ //num_2 == 1\\n\\t\\t\\t\\t\\t\\tnext_state = Q.top().state+POW[mark_1]-POW[mark_2];\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\ttmp_cost = abs(mark_1-Q.top().loc)+abs(mark_2-mark_1);\\n\\n\\t\\t\\t\\t\\tif(dp[next_state][mark_2] > Q.top().sum_cost+tmp_cost){\\n\\t\\t\\t\\t\\t\\tdp[next_state][mark_2] = Q.top().sum_cost+tmp_cost;\\n\\t\\t\\t\\t\\t\\tQ.push(Info(next_state,Q.top().sum_cost+tmp_cost,mark_2));\\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\\tprintf(\\\"%d\\\\n\\\",ans);\\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}\",\n \"accuracy\": 1,\n \"time_ms\": 3240,\n \"memory_kb\": 16396,\n \"score_of_the_acc\": -1.079,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2040_2310616\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define all(v) begin(v), end(v)\\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\\n#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)\\n\\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\\n\\nusing pint = pair<int, int>;\\nusing tint = tuple<int, int, int>;\\nusing vint = vector<int>;\\n\\nconst int inf = 1LL << 55;\\nconst int mod = 1e9 + 7;\\n\\nint N;\\nstring s, t;\\nint mincost[16][1<<16];\\nint sbit, tbit;\\n\\nstruct State {\\n int now, cost, bit;\\n State(){}\\n State(int now, int cost, int bit):now(now), cost(cost), bit(bit){}\\n bool operator < (const State &st) const {\\n return cost > st.cost;\\n }\\n};\\n\\nint dijkstra(int pos) {\\n fill(mincost[0], mincost[16], inf);\\n mincost[pos][sbit] = 0;\\n priority_queue<State> que;\\n que.emplace(pos, 0, sbit);\\n while(!que.empty()) {\\n State st = que.top(); que.pop();\\n int now = st.now, cost = st.cost, bit = st.bit;\\n //cout << now << \\\" \\\"<< cost << endl;\\n //rep(i, N) cout << (int)((bit>>i)&1);\\n //cout << endl;\\n if(bit == tbit) return cost;\\n if(mincost[now][bit] < cost) continue;\\n rep(i, N) if(i != now) {\\n int ncost = cost + abs(i-now);\\n if(ncost < mincost[i][bit]) {\\n\\tmincost[i][bit] = ncost;\\n\\tque.emplace(i, ncost, bit);\\n }\\n if(((bit>>i)&1) == ((bit>>now)&1)) continue;\\n int nbit = bit^(1<<i)^(1<<now);\\n //rep(i, N) cout << (int)((bit>>i)&1);cout<<endl;\\n //cout<<now<<\\\" \\\"<<i<<endl;\\n //cout << (int)((bit>>i)&1) << \\\" \\\"<<(int)((bit>>now)&1) << endl;\\n //cout<<(int)(((bit>>i)&1) == ((bit>>now)&1)) << endl;\\n //rep(i, N) cout << (int)((nbit>>i)&1);cout<<endl;\\n //assert(__builtin_popcount(nbit) == __builtin_popcount(bit));\\n if(ncost < mincost[i][nbit]) {\\n\\tmincost[i][nbit] = ncost;\\n\\tque.emplace(i, ncost, nbit);\\n }\\n }\\n }\\n return inf;\\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, N) {\\n cin >> s >> t;\\n sbit = tbit = 0;\\n rep(i, N) if(s[i] == 'B') sbit |= 1<<i;\\n rep(i, N) if(t[i] == 'B') tbit |= 1<<i;\\n int ans = inf;\\n rep(i, N) {\\n chmin(ans, dijkstra(i));\\n //cout<<ans<<endl;//exit(0);\\n }\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7490,\n \"memory_kb\": 21180,\n \"score_of_the_acc\": -1.9868,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2040_2310084\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint dp[1<<16][16],n;\\nint main() {\\n while(cin >> n && n) {\\n string s,s2;cin>>s>>s2;\\n int r=0;\\n for(int t=0;t<(1<<n);t++)for(int i=0;i<n;i++)dp[t][i]=1<<29;\\n for(int i=0;i<n;i++)if(s[i]==s2[i]) r|=1<<i;\\n for(int i=0;i<n;i++)dp[r][i]=0;\\n for(int t=0;t<(1<<n);t++) {\\n for(int i=0;i<n;i++) {\\n if(dp[t][i]==1<<29) continue;\\n for(int j=0;j<n;j++) {\\n if(t&(1<<j)) continue;\\n for(int k=j+1;k<n;k++) {\\n if(t&(1<<k)||s[j]==s[k]) continue;\\n dp[t|(1<<j)|(1<<k)][j]=min(dp[t|(1<<j)|(1<<k)][j],dp[t][i]+abs(i-k)+abs(k-j));\\n dp[t|(1<<j)|(1<<k)][k]=min(dp[t|(1<<j)|(1<<k)][k],dp[t][i]+abs(i-j)+abs(j-k));\\n }\\n }\\n }\\n }\\n int ans=1<<29;\\n for(int i=0;i<n;i++)ans=min(ans,dp[(1<<n)-1][i]);\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 7092,\n \"score_of_the_acc\": -0.0003,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2040_2309655\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint dp[1<<16][16],n;\\nint main() {\\n while(cin >> n && n) {\\n string s,s2;cin>>s>>s2;\\n int r=0;\\n for(int t=0;t<(1<<n);t++)for(int i=0;i<n;i++)dp[t][i]=1<<29;\\n for(int i=0;i<n;i++)if(s[i]==s2[i]) r|=1<<i;\\n for(int i=0;i<n;i++)dp[r][i]=0;\\n for(int t=0;t<(1<<n);t++) {\\n for(int i=0;i<n;i++) {\\n if(dp[t][i]==1<<29) continue;\\n string e=\\\"\\\";\\n for(int j=0; j<n;j++) {\\n if(t&(1<<j)) e+='1';else e+='0';\\n }\\n for(int j=0;j<n;j++) {\\n if(t&(1<<j)) continue;\\n for(int k=j+1;k<n;k++) {\\n if(t&(1<<k)||s[j]==s[k]) continue;\\n dp[t|(1<<j)|(1<<k)][j]=min(dp[t|(1<<j)|(1<<k)][j],dp[t][i]+abs(i-k)+abs(k-j));\\n dp[t|(1<<j)|(1<<k)][k]=min(dp[t|(1<<j)|(1<<k)][k],dp[t][i]+abs(i-j)+abs(j-k));\\n }\\n }\\n }\\n }\\n int ans=1<<29;\\n for(int i=0;i<n;i++)ans=min(ans,dp[(1<<n)-1][i]);\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 7236,\n \"score_of_the_acc\": -0.0171,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2040_2309492\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nstring A,B;\\nint n,Ab,Bb;\\n\\nint Bit(int bit ,int i,int x){\\n while((bit>>i&1)!=x)bit ^= 1<<i;\\n return bit;\\n}\\n\\nint mem[16][1<<16],used[16][1<<16];\\nint dep = 0;\\nint dfs(short pos,int bit){\\n cout<< dep++ <<endl;\\n if(bit ==Bb) return 0;\\n if(used[pos][bit]++) return mem[pos][bit];\\n \\n int &res = mem[pos][bit] = 1e9;\\n for(int i=0;i<n;i++)\\n for(int j=0;j<n;j++){\\n int nbit = bit;\\n nbit = Bit(nbit,i,bit>>j&1);\\n nbit = Bit(nbit,j,bit>>i&1);\\n res = min(res,abs(pos-i)+abs(i-j)+dfs(j,nbit));\\n }\\n cout<<dep<<endl;\\n return mem[pos][bit];\\n}\\n\\n\\ntypedef pair<int,int> P;\\ntypedef pair<int,P> PP;\\nint bfs(){\\n for(int j=0;j<16;j++) \\n for(int i=0;i<(1<<16);i++)mem[j][i] = 1e9;\\n \\n priority_queue<PP,vector<PP>,greater<PP> > Q;\\n for(int i=0;i<n;i++) Q.push(PP(0,P(i,Ab))),mem[i][Ab] = 0;\\n while(!Q.empty()){\\n PP t = Q.top();Q.pop();\\n int cost = t.first;\\n int pos = t.second.first;\\n int bit = t.second.second;\\n if(bit == Bb) return cost;\\n if(mem[pos][bit]<cost)continue;\\n \\n for(int i=0;i<n;i++)\\n for(int j=0;j<n;j++){\\n\\tint nbit = bit;\\n\\tnbit = Bit(nbit,i,bit>>j&1);\\n\\tnbit = Bit(nbit,j,bit>>i&1);\\n\\tint ncost = cost+abs(pos-i)+abs(i-j);\\n\\tif(ncost >= mem[j][nbit])continue;\\n\\tQ.push(PP(ncost,P(j,nbit)));\\n\\tmem[j][nbit] = ncost;\\n }\\n }\\n assert(0); \\n}\\n\\n\\nint main(){\\n \\n while(cin>>n,n){\\n cin>>A>>B;\\n \\n Ab = Bb = 0;\\n for(int i=0;i<n;i++)Ab|=(A[i]=='W')<<i, Bb|=(B[i]=='W')<<i;\\n \\n memset(used,0,sizeof(used));\\n int ans = 1e9;\\n //for(int i=0;i<n;i++) ans=min(ans,dfs(i,Ab));\\n //cout<<ans<<endl;\\n cout<<bfs()<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3040,\n \"memory_kb\": 21368,\n \"score_of_the_acc\": -1.4003,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2040_2309377\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint dp[1<<16][16];\\nint main() {\\n int n;\\n while(cin >> n && n) {\\n string s,s2;\\n cin >> s >> s2;\\n int r=0;\\n for(int t=0;t<(1<<n);t++)for(int i=0;i<n;i++)dp[t][i]=1<<29;\\n for(int i=0;i<n;i++)if(s[i]==s2[i]) r|=1<<i;\\n for(int i=0;i<n;i++)dp[r][i]=0;\\n for(int t=0;t<(1<<n);t++) {\\n for(int i=0;i<n;i++) {\\n if(dp[t][i]==1<<29) continue;\\n string e=\\\"\\\";\\n for(int j=0; j<n;j++) {\\n if(t&(1<<j)) e+='1';\\n else e+='0';\\n }\\n for(int j=0;j<n;j++) {\\n if(t&(1<<j)) continue;\\n for(int k=j+1;k<n;k++) {\\n if(t&(1<<k)||s[j]==s[k]) continue;\\n dp[t|(1<<j)|(1<<k)][j]=min(dp[t|(1<<j)|(1<<k)][j],dp[t][i]+abs(i-k)+abs(k-j));\\n dp[t|(1<<j)|(1<<k)][k]=min(dp[t|(1<<j)|(1<<k)][k],dp[t][i]+abs(i-j)+abs(j-k));\\n }\\n }\\n }\\n }\\n int ans=1<<29;\\n for(int i=0;i<n;i++)ans=min(ans,dp[(1<<n)-1][i]);\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 7268,\n \"score_of_the_acc\": -0.022,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2040_2137800\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<string>\\n#include<cmath>\\nusing namespace std;\\nint n, s, t; int dp[16][65536], p[16][16];\\nqueue<pair<int, int>>Q;\\nint main() {\\n\\twhile (true) {\\n\\t\\tcin >> n; s = 0; t = 0; if (n == 0)break;\\n\\t\\tfor (int i = 0; i < n; i++) { for (int j = 0; j < (1 << n); j++)dp[i][j] = 999999999; }\\n\\t\\tstring S1; cin >> S1; for (int i = 0; i < S1.size(); i++) { if (S1[i] == 'B')s += (1 << i); }\\n\\t\\tstring S2; cin >> S2; for (int i = 0; i < S2.size(); i++) { if (S2[i] == 'B')t += (1 << i); }\\n\\t\\tfor (int i = 0; i < n; i++) { dp[i][s] = 0; Q.push(make_pair(i, s)); }\\n\\t\\twhile (!Q.empty()) {\\n\\t\\t\\tint a1 = Q.front().first, a2 = Q.front().second; Q.pop();\\n\\t\\t\\tif (a1 < n - 1 && dp[a1 + 1][a2] > dp[a1][a2] + 1) { dp[a1 + 1][a2] = dp[a1][a2] + 1; Q.push(make_pair(a1 + 1, a2)); }\\n\\t\\t\\tif (a1 >= 1 && dp[a1 - 1][a2] > dp[a1][a2] + 1) { dp[a1 - 1][a2] = dp[a1][a2] + 1; Q.push(make_pair(a1 - 1, a2)); }\\n\\t\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\t\\tint bit[20]; for (int j = 0; j < n; j++)bit[j] = (a2 / (1 << j)) % 2;\\n\\t\\t\\t\\tswap(bit[i], bit[a1]); int cost = abs(i - a1);\\n\\t\\t\\t\\tint ret = 0; for (int j = 0; j < n; j++)ret += (1 << j)*bit[j];\\n\\t\\t\\t\\tif (dp[i][ret] > dp[a1][a2] + cost) { dp[i][ret] = dp[a1][a2] + cost; Q.push(make_pair(i, ret)); }\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint minx = 999999999; for (int i = 0; i < n; i++)minx = min(minx, dp[i][t]);\\n\\t\\tcout << minx << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5410,\n \"memory_kb\": 7584,\n \"score_of_the_acc\": -0.7544,\n \"final_rank\": 16\n }\n]","isConversational":false}}},{"rowIdx":1076,"cells":{"group_id":{"kind":"string","value":"aoj_2039_cpp"},"problem_description":{"kind":"string","value":"Problem A:\nSpace Coconut Crab II\nA space hunter, Ken Marineblue traveled the universe, looking for the space coconut crab. The\nspace coconut crab was a crustacean known to be the largest in the universe. It was said that\nthe space coconut crab had a body of more than 400 meters long and a leg span of no shorter\nthan 1000 meters long. Although there were numerous reports by people who saw the space\ncoconut crab, nobody have yet succeeded in capturing it.\nAfter years of his intensive research, Ken discovered an interesting habit of the space coconut\ncrab. Surprisingly, the space coconut crab went back and forth between the space and the\nhyperspace by phase drive, which was the latest warp technology. As we, human beings, was\nnot able to move to the hyperspace, he had to work out an elaborate plan to capture them.\nFortunately, he found that the coconut crab took a long time to move between the hyperspace\nand the space because it had to keep still in order to charge a sufficient amount of energy for\nphase drive. He thought that he could capture them immediately after the warp-out, as they\nmoved so slowly in the space.\nHe decided to predict from the amount of the charged energy the coordinates in the space\nwhere the space coconut crab would appear, as he could only observe the amount of the charged\nenergy by measuring the time spent for charging in the hyperspace. His recent spaceship,\nWeapon Breaker, was installed with an artificial intelligence system, CANEL. She analyzed the\naccumulated data and found another surprising fact; the space coconut crab always warped out\nnear to the center of a triangle that satisfied the following conditions:\neach vertex of the triangle was one of the planets in the universe;\nthe length of every side of the triangle was a prime number; and\nthe total length of the three sides of the triangle was equal to\nT\n, the time duration the\n space coconut crab had spent in charging energy in the hyperspace before moving to the\n space.\nCANEL also devised the method to determine the three planets comprising the triangle from\nthe amount of energy that the space coconut crab charged and the lengths of the triangle sides.\nHowever, the number of the candidate triangles might be more than one.\nKen decided to begin with calculating how many different triangles were possible, analyzing\nthe data he had obtained in the past research. Your job is to calculate the number of different\ntriangles which satisfies the conditions mentioned above, for each given\nT\n.\nInput\nThe input consists of multiple datasets. Each dataset comes with a line that contains a single\npositive integer\nT\n(1 ≤\nT\n≤ 30000).\nThe end of input is indicated by a line that contains a zero. This should not be processed.\nOutput\nFor each dataset, print the number of different possible triangles in a line. Two triangles are\ndifferent if and only if they are not congruent.\nSample Input\n10\n12\n15\n777\n4999\n5000\n0\nOutput for the Sample Input\n0\n1\n2\n110\n2780\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2039_10850472","code_snippet":"#include <stdio.h>\n#define MAX 30010\n\nint dy[MAX], prime[MAX];\nint n, pcnt;\nbool p[MAX];\n\nvoid getprime(void){\n\tint i, j;\n\tfor (i=2;i<=15000;i++){\n\t\tif (p[i]) continue;\n\t\tprime[++pcnt]=i;\n\t\tfor (j=i*i;j<=15000;j+=i){\n\t\t\tp[j]=1;\n\t\t}\n\t}\n}\n\nint main(void){\n\tint i, j;\n\tint pi, pj, pk;\n\tgetprime();\n\t\n\tfor (;;){\n\t\tint cnt=0;\n\t\tscanf(\"%d\", &n);\n\t\tif (n==0) break;\n\t\tfor (i=1;i<=pcnt;i++){\n\t\t\tpi=prime[i];\n\t\t\tif (pi>=n) break;\n\t\t\tfor (j=i;j<=pcnt;j++){\n\t\t\t\tpj=prime[j];\n\t\t\t\tif (pi+pj>=n) break;\n\t\t\t\tpk=n-pi-pj;\n\t\t\t\tif (pk<pj) break;\n\t\t\t\tif (p[pk]) continue;\n\t\t\t\tif (pi<pj+pk && pj<pk+pi && pk<pi+pj){\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", cnt);\n\t}\n\treturn false;\n}","accuracy":1,"time_ms":200,"memory_kb":2976,"score_of_the_acc":-0.2357,"final_rank":7},{"submission_id":"aoj_2039_9558141","code_snippet":"#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\nfor triangle: a + b > c where a, b are the shorter sides\n\n*/\n\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nconst int INF = 1000000000;\n\nconst int MAX_V = 30000;\nstatic bool prime[MAX_V+1];\n\nconst int K = 3;\nconst int P = 3245;\nstatic int S[MAX_V+1][K];\nstatic vector<int> primes(P);\n//------------------------------------------------------------------------------\nvoid sieve()\n{\n prime[0] = false;\n prime[1] = false;\n\n for (int i=2; i<=MAX_V; i++) prime[i] = true;\n\n for (int i=2; i*i<=MAX_V; i++)\n {\n if (prime[i])\n {\n for (int j=2*i; j<=MAX_V; j+=i) prime[j] = false;\n }\n }\n\n int index = 0;\n for (int i=2; i<=MAX_V; i++)\n if (prime[i])\n primes[index++] = i;\n}\n\n\n//------------------------------------------------------------------------------\nint solve(int sum)\n{\n int res = 0;\n for (int p1=0; p1<P; ++p1)\n {\n if (primes[p1] >= sum) break;\n for (int p2=p1; p2<P; ++p2)\n {\n if (primes[p1]+primes[p2] >= sum) break;\n int c = sum - primes[p1] - primes[p2];\n if (prime[c] && c >= primes[p1] && c >= primes[p2] && c < primes[p1]+primes[p2]) res++;\n }\n }\n return res;\n}\n\n//------------------------------------------------------------------------------\nint main()\n{\n //test(); return 0;\n //DEBUG = true;\n sieve();\n //--------------------------------------------------------------------------\n int N, sum, num;\n while (true)\n {\n num = scanf(\"%d \", &sum);\n if (sum == 0) break;\n int res = solve(sum);\n printf(\"%d\\n\", res);\n }\n //--------------------------------------------------------------------------\n return 0;\n}\n//------------------------------------------------------------------------------","accuracy":1,"time_ms":690,"memory_kb":3492,"score_of_the_acc":-0.3766,"final_rank":13},{"submission_id":"aoj_2039_5753197","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\n\nconst int N=30030;\nint not_is_prime[N];\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n vector<int> P;\n for(int i=2;i<N;i++){\n if(!not_is_prime[i]){\n P.push_back(i);\n for(int j=i+i;j<N;j+=i){\n not_is_prime[j]=1;\n }\n }\n }\n vector<vector<int>> res(4,vector<int>(N));\n res[0][0]=1;\n for(auto p:P){\n for(int i=1;i<4;i++){\n for(int j=p;j<N;j++){\n if(i==3 and p>=j-p)continue;\n res[i][j]+=res[i-1][j-p];\n }\n }\n }\n int n;\n while(cin >> n,n){\n printf(\"%d\\n\",res[3][n]);\n }\n}","accuracy":1,"time_ms":70,"memory_kb":3776,"score_of_the_acc":-0.3148,"final_rank":8},{"submission_id":"aoj_2039_3678466","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\n#include <string>\n#include <climits>\n#include <iomanip>\n#include <algorithm>\n#include <queue>\n#include <map>\n#include <tuple>\n#include <iostream>\n#include <deque>\n#include <array>\n#include <set>\n#include <functional>\n#include <memory>\n\n\nstd::vector<int> primes(const int upper_limit) {\n\tstd::vector<bool> is_prime(upper_limit + 1, true);\n\tfor (auto i = 2; i * i <= upper_limit; ++i) {\n\t\tif (is_prime[i]) {\n\t\t\tfor (auto j = i * i; j <= upper_limit; j += i) {\n\t\t\t\tis_prime[j] = false;\n\t\t\t}\n\t\t}\n\t}\n\tstd::vector<int> result;\n\tfor (auto i = 2; i <= upper_limit; ++i) {\n\t\tif (is_prime[i]) {\n\t\t\tresult.push_back(i);\n\t\t}\n\t}\n\treturn result;\n}\nint main() {\n\tconst auto prime = primes(30000);\n\twhile (true) {\n\t\tint n; std::cin >> n;\n\t\tif (n == 0) return 0;\n\t\tauto count = 0;\n\t\tauto greater = std::lower_bound(prime.begin(), prime.end(), n / 3);\n\t\twhile (greater != prime.end() && *greater * 2 < n) {\n\t\t\tauto mid = std::lower_bound(prime.begin(), prime.end(), (n - *greater) / 2);\n\t\t\twhile (*mid <= *greater) {\n\t\t\t\tif (n - *greater - *mid <= *mid && std::binary_search(prime.begin(), prime.end(), n - *greater - *mid)) {\n\t\t\t\t\t++count;\n\t\t\t\t}\n\t\t\t\t++mid;\n\t\t\t}\n\t\t\t++greater;\n\t\t}\n\t\tstd::cout << count << std::endl;\n\t}\n}","accuracy":1,"time_ms":780,"memory_kb":3196,"score_of_the_acc":-0.354,"final_rank":11},{"submission_id":"aoj_2039_2665941","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\nvector<int>primes;\nvoid hurui(const int amax) {\n\tstatic bool flag = false;\n\tif (flag)return;\n\tvector<int>sos;\n\tsos = vector<int>(amax + 1, true);\n\tsos[0] = false; sos[1] = false;\n\tfor (int i = 2; i <= amax; ++i) {\n\t\tif (sos[i]) {\n\t\t\tfor (int j = 2 * i; j <= amax; j += i)sos[j] = false;\n\t\t}\n\t}\n\tfor (int i = 0; i <= amax; ++i) {\n\t\tif (sos[i]) {\n\t\t\tprimes.push_back(i);\n\t\t}\n\t}\n\tflag = true;\n}\n\nint main() {\n\thurui(3e4);\n\twhile (true) {\n\t\tint T;cin>>T;\n\t\tif(!T)break;\n\t\tint ans=0;\n\t\tfor (int i = 0; i < primes.size(); ++i) {\n\t\t\tfor (int j = i; j < primes.size(); ++j) {\n\t\t\t\tint a=primes[i];\n\t\t\t\tint b=primes[j];\n\t\t\t\tint c=T-a-b;\n\t\t\t\tif(b>c)continue;\n\t\t\t\tif(a+b<=c)continue;\n\t\t\t\tif (binary_search(primes.begin(), primes.end(), c)) {\n\t\t\t\t\tans++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":1630,"memory_kb":3228,"score_of_the_acc":-0.4912,"final_rank":15},{"submission_id":"aoj_2039_2555244","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\n\nbool is_prime[30001];\nvector<int> PRIME;\n\nint main(){\n\n\tfor(int i = 0; i <= 30000; i++){\n\t\tis_prime[i] = true;\n\t}\n\n\tfor(int i = 2; i <= sqrt(30000); i++){\n\t\tif(is_prime[i]){\n\t\t\tfor(int k = 2*i; k <= 30000; k += i){\n\t\t\t\tis_prime[k] = false;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 2; i <= 30000; i++){\n\t\tif(is_prime[i]){\n\t\t\tPRIME.push_back(i);\n\t\t}\n\t}\n\n\tint T;\n\twhile(true){\n\t\tscanf(\"%d\",&T);\n\t\tif(T == 0)break;\n\n\t\tint ans = 0;\n\n\t\tfor(int a = 0; a < PRIME.size(); a++){\n\t\t\tif(PRIME[a] > T)break;\n\t\t\tfor(int b = a; b < PRIME.size(); b++){\n\t\t\t\tif(PRIME[a]+PRIME[b] > T)break;\n\t\t\t\tint c = T -(PRIME[a]+PRIME[b]);\n\n\t\t\t\tif(!is_prime[c])continue;\n\n\t\t\t\tif(PRIME[b] <= c && (PRIME[a]+PRIME[b]) > c && (PRIME[b]+c) > PRIME[a] && (c+PRIME[a]) > PRIME[b])ans++;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":490,"memory_kb":3324,"score_of_the_acc":-0.3244,"final_rank":9},{"submission_id":"aoj_2039_2276125","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define mk make_pair\nint s[30001],ss[30001],c=2;\nset<long long>se;\nint main(){\n s[0]=2;s[1]=3;ss[2]=ss[3]=1;\n for(int i=2;i<30001;i++){\n int p=0;\n for(int j=2;j*j<=i;j++)\n if(i%j==0)p++;\n if(!p)ss[i]++,s[c++]=i;\n }\n int n;\n while(cin>>n,n){\n se.clear();\n int sum=0;\n for(int i=0;i<c;i++){\n if(s[i]>n/2+1)break;\n for(int j=0;j<c;j++){\n if(s[j]+s[i]>n)break;\n if(n-s[j]-s[i]>0)\n if(ss[n-s[j]-s[i]]){\n int d[3];\n d[0]=s[i];\n d[1]=s[j];\n d[2]=n-s[j]-s[i];\n sort(d,d+3);\n if(!se.count(d[0]*10000000000+d[1]*100000+d[2])&&d[0]+d[1]>d[2]){\n se.insert(d[0]*10000000000+d[1]*100000+d[2]);\n sum++;\n }\n }\n }\n }\n cout<<sum<<endl;\n }\n }","accuracy":1,"time_ms":6450,"memory_kb":5916,"score_of_the_acc":-1.5808,"final_rank":20},{"submission_id":"aoj_2039_2275730","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define mk make_pair\nint s[30001],ss[30001],c=2;\nunordered_set<long long>se;\nint main(){\n s[0]=2;s[1]=3;ss[2]=ss[3]=1;\n for(int i=2;i<30001;i++){\n int p=0;\n for(int j=2;j*j<=i;j++)\n if(i%j==0)p++;\n if(!p)ss[i]++,s[c++]=i;\n }\n int n;\n while(cin>>n,n){\n se.clear();\n int sum=0;\n for(int i=0;i<c;i++){\n if(s[i]>n/2+1)break;\n for(int j=0;j<c;j++){\n\tif(s[j]+s[i]>n)break;\n\tif(n-s[j]-s[i]>0)\n\t if(ss[n-s[j]-s[i]]){\n\t int d[3];\n\t d[0]=s[i];\n\t d[1]=s[j];\n\t d[2]=n-s[j]-s[i];\n\t sort(d,d+3);\n\t if(!se.count(d[0]*10000000000+d[1]*100000+d[2])&&d[0]+d[1]>d[2]){\n\t\tse.insert(d[0]*10000000000+d[1]*100000+d[2]);\n\t sum++;\n\t }\n\t }\n }\n }\n cout<<sum<<endl;\n }\n}","accuracy":1,"time_ms":3390,"memory_kb":5312,"score_of_the_acc":-1.0261,"final_rank":18},{"submission_id":"aoj_2039_2275718","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int TMAX = 30000;\n\npair< vector<int>, vector<int> > eratosthenes(int N){\n vector<int> res;\n vector<int> arr(N);\n for(int i=0; i < N; i++){\n arr[i] = true;\n }\n arr[0] = false;\n arr[1] = false;\n for(int i=2; i*i <= N; i++){\n if(arr[i] == true){\n for(int j=i+i; j < N; j += i){\n arr[j] = false;\n }\n }\n }\n for(int i = 0; i < N; i++){\n if(arr[i] == true) res.push_back(i);\n }\n return pair< vector<int>, vector<int> >(res, arr);\n}\n\nbool isTri(int i, int j, int k){\n int a[] = {i, j, k};\n sort(a, a+3);\n if(a[2] < a[1] + a[0]) return true;\n else return false;\n}\n\nint main(void){\n int T;\n while(cin >> T, T){\n pair< vector<int>, vector<int> > tmp = eratosthenes(TMAX);\n vector<int> primes = tmp.first;\n vector<int> is_prime = tmp.second;\n int ans = 0;\n for(int i = 0; i < primes.size(); i++){\n for(int j = i; j < primes.size(); j++){\n int k = T - primes[i] - primes[j];\n if(k >= 1 && k >= primes[j] && is_prime[k] == true && isTri(primes[i], primes[j], k)){\n //cout << primes[i] << \" \" << primes[j] << \" \" << k << endl;\n ans++;\n }\n }\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":1180,"memory_kb":3124,"score_of_the_acc":-0.4077,"final_rank":14},{"submission_id":"aoj_2039_2275656","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int MAX_T = 30000;\nint T;\nll res[30003];\nvector<int> ps;\nunordered_map<int,ll> dp[2];\n\nvoid init(){\n bool f[30003];\n memset( f,0,sizeof(f) );\n for(int i=2;i<=30000;i++){\n if( f[i] ) continue;\n ps.emplace_back(i);\n for(int j=i+i;j<=30000;j+=i)\n f[j] = true;\n }\n}\n\nvoid solve(){\n for(int p : ps){\n dp[0][p]++;\n for( auto q : dp[0] ){\n if( q.first + p > MAX_T ) continue; \n dp[1][q.first+p] += q.second;\n }\n for( auto q : dp[1] ){\n if( q.first + p > MAX_T ) continue;\n if( q.first <= p )\n continue; \n res[ q.first + p ] += q.second;\n }\n }\n}\n\nint main(){\n init();\n solve();\n while( cin >> T && T ){\n cout << res[T] << endl;\n }\n}","accuracy":1,"time_ms":190,"memory_kb":4108,"score_of_the_acc":-0.3749,"final_rank":12},{"submission_id":"aoj_2039_2275614","code_snippet":"#include<bits/stdc++.h>\n#define N 40001\nusing namespace std;\n#define int long long\nint T;\nbool used[N];\nvector<int> prime;\n\n\nsigned main(){\n used[0] = used[1] = 1;\n for(int i=2;i*i<N;i++)\n if(used[i] == 0)\n for(int j=2;j<N/i;j++)used[i*j] = 1;\n for(int i=0;i<N;i++) if(!used[i]) prime.push_back(i);\n \n while(1){\n cin>>T;\n if(T==0)break;\n \n\n \n int ans = 0;\n for(int i=0;i<prime.size();i++)\n for(int j=i;j<prime.size();j++){\n int a = prime[i];\n int b = prime[j];\n int c = T-(a+b);\n if(b>c)continue;\n if(a+b>=T||used[c] == 1)continue;\n if(a+b>c && a+c>b && b+c>a)ans++;\n }\n cout<<ans<<endl;\n } \n return 0;\n}","accuracy":1,"time_ms":2150,"memory_kb":3160,"score_of_the_acc":-0.5642,"final_rank":16},{"submission_id":"aoj_2039_1893559","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nint main(){\n\t#define MAX 30010\n\tbool sosu[MAX]={1,1,0};\n\tfor(int i=2;i*i<=MAX;i++)if(!sosu[i])\n\tfor(int j=2*i;j<MAX;j+=i)sosu[j]=true;\n\tvi so;\n\trep(i,MAX)if(sosu[i]==0)so.pb(i);\n\tint n;\n\twhile(cin>>n,n){\n\t\tint out=0;\n\t\tint m=lower_bound(all(so),n)-so.begin();\n\t\trep(i,m)loop(j,i,m){\n\t\t\tint t=n-so[i]-so[j];\n\t\t\tif(t<so[j])continue;\n\t\t\tif(sosu[t])continue;\n\t\t\tint ma=max(t,max(so[i],so[j]));\n\t\t\tint sum=t+so[i]+so[j];\n\t\t\tif(sum>2*ma)out++;\n\t\t}\n\t\tcout<<out<<endl;\n\t}\n}","accuracy":1,"time_ms":580,"memory_kb":1284,"score_of_the_acc":-0.0849,"final_rank":5},{"submission_id":"aoj_2039_1882397","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX 15010\ntypedef pair<int,int> pii;\ntypedef pair<pii,int> P;\n \nbool check(int a,int b,int c){\n if(a >= b+c || b >= a+c || c >= a+b) return false;\n return true;\n}\n \nint main(){\n vector<int> prime;\n bool p[MAX];\n fill(p,p+MAX,true);\n p[0] = p[1] = false;\n for(int i = 2 ; i < MAX ; i++){\n\tif(!p[i]) continue;\n\tprime.push_back(i);\n\tfor(int j = 2*i ; j < MAX ; j += i){\n\t p[j] = false;\n\t}\n }\n int T;\n while(cin >> T, T){\n\tint cnt = 0;\n\tset<P> st;\n\tint size = prime.size();\n\tfor(int i = 0 ; i < size ; i++){\n\t if(prime[i] > T) continue;\n\t for(int j = i ; j < size ; j++){\n\t\tif(prime[i]+prime[j] > T) continue;\n\t\tint k = T-prime[i]-prime[j];\n\t\tif(k < 0 || k >= MAX || !p[k]) continue;\n\t\tint a[3] = {prime[i],prime[j],k};\n\t\tsort(a,a+3);\n\t\tif(st.count(P(pii(a[0],a[1]),a[2]))) continue;\n\t\tst.insert(P(pii(a[0],a[1]),a[2]));\n\t\tif(check(a[0],a[1],a[2])){\n\t\t cnt++;\n\t\t}\n\t }\n\t}\n\tcout << cnt << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":3450,"memory_kb":9288,"score_of_the_acc":-1.5298,"final_rank":19},{"submission_id":"aoj_2039_1800026","code_snippet":"#include<iostream>\n#include<vector>\nusing namespace std;\nint P[31000]; vector<int>prime;\nint p[31000]; int M = 30000;\nint main() {\n\tp[0] = 1; p[1] = 1;\n\tfor (int i = 2; i*i <= M; i++) {\n\t\tfor (int j = i*i; j <= M; j += i)p[j] = 1;\n\t}\n\tfor (int i = 0; i <= M; i++) { if (p[i] == 0)prime.push_back(i); }\n\tfor (int i = 0; i < prime.size(); i++) {\n\t\tfor (int j = i; j < prime.size(); j++) {\n\t\t\tfor (int k = j; k < prime.size(); k++) {\n\t\t\t\tint v = prime[i] + prime[j] + prime[k];\n\t\t\t\tif (v > M)continue;\n\t\t\t\tif (prime[i] + prime[j] <= prime[k])continue;\n\t\t\t\tP[v]++;\n\t\t\t}\n\t\t}\n\t}\n\tint n;\n\twhile (true) {\n\t\tcin >> n; if (n == 0)break;\n\t\tcout << P[n] << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":4140,"memory_kb":3360,"score_of_the_acc":-0.901,"final_rank":17},{"submission_id":"aoj_2039_1799919","code_snippet":"#include <iostream>\nusing namespace std;\nint n, c, p[5000]; bool prime[30001];\nint main() {\n\tfor(int i = 2; i <= 30000; i++) prime[i] = true;\n\tfor(int i = 2; i * i <= 30000; i++) {\n\t\tif(!prime[i]) continue;\n\t\tfor(int j = i * i; j <= 30000; j += i) prime[j] = false;\n\t}\n\tfor(int i = 2; i <= 30000; i++) {\n\t\tif(prime[i]) p[c++] = i;\n\t}\n\twhile(cin >> n, n) {\n\t\tint ret = 0;\n\t\tfor(int i = 0; i < c && p[i] < n; i++) {\n\t\t\tfor(int j = i; j < c && p[i] + p[j] < n; j++) {\n\t\t\t\tint w = n - p[i] - p[j];\n\t\t\t\tif(prime[w] && p[i] + p[j] > w && w >= p[j]) ret++;\n\t\t\t}\n\t\t}\n\t\tcout << ret << endl;\n\t}\n}","accuracy":1,"time_ms":650,"memory_kb":3148,"score_of_the_acc":-0.3276,"final_rank":10},{"submission_id":"aoj_2039_1571918","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <climits>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n#include <cassert>\n// #include <bits/stdc++.h>\n\nusing namespace std;\n\n#define LOG(...) fprintf(stderr,__VA_ARGS__)\n//#define LOG(...)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\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 SORT(c) sort(ALL(c))\n#define RSORT(c) sort(RALL(c))\n#define SQ(n) (n)*(n)\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<bool> vb;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef vector<vb> vvb;\ntypedef vector<vi> vvi;\ntypedef vector<vll> vvll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\n\nint primes[3000];\nint siz = 0;\nint num[40000]={0};\nbool isprime[200000]={false};\n\nint main() {\n for(int i=2;i<20000;i++){\n if(isprime[i])continue;\n primes[siz++]=i;\n for(int j=i*2;j<20000;j+=i){\n isprime[j]=true;\n }\n }\n for(int a=0;primes[a]<=15000;a++){\n for(int b=a;primes[b]<=15000;b++){\n for(int c=b;primes[c]<=15000;c++){\n if(primes[a]+primes[b]<=primes[c])continue;\n if(primes[a]+primes[b]+primes[c]>30000)continue;\n num[primes[a]+primes[b]+primes[c]]++;\n // LOG(\"%d %d %d\\n\",primes[a],primes[b],primes[c]);\n }\n }\n }\n // cout << \"end works\" << endl;\n\n int T;\n while(cin>>T,T){\n cout << num[T] << endl;\n }\n}","accuracy":1,"time_ms":660,"memory_kb":1320,"score_of_the_acc":-0.1019,"final_rank":6},{"submission_id":"aoj_2039_1357444","code_snippet":"#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_T = 30000;\nconst int MAX_SIDE = (MAX_T - 1) / 2;\n\n/* typedef */\n\ntypedef vector<int> vi;\n\n/* global variables */\n\nbool primes[MAX_SIDE + 1];\nvi pnums;\nint np;\n\n/* subroutines */\n\nvoid calc_prime(int max_p) {\n primes[0] = primes[1] = false;\n for (int p = 2; p <= max_p; p++) primes[p] = true;\n\n for (int p = 2; p * p <= max_p; p++)\n if (primes[p])\n for (int q = p * p; q <= max_p; q += p) primes[q] = false;\n\n for (int p = 2; p <= max_p; p++)\n if (primes[p]) pnums.push_back(p);\n\n np = pnums.size();\n}\n\n/* main */\n\nint main() {\n calc_prime(MAX_SIDE);\n\n for (;;) {\n int t;\n cin >> t;\n if (t == 0) break;\n\n int count = 0;\n int mina = t / 3;\n int maxside = (t - 1) / 2;\n \n for (vi::iterator ait = pnums.begin(); ait != pnums.end(); ait++) {\n int& a = *ait;\n if (a < mina) continue;\n if (a > maxside) break;\n\n int minb = (t - a) / 2;\n \n for (vi::iterator bit = pnums.begin(); bit != pnums.end(); bit++) {\n\tint& b = *bit;\n\tif (b < minb) continue;\n\tif (b > a) break;\n\n\tint c = t - (a + b);\n\tif (c > 0 && c <= b && primes[c]) {\n\t count++;\n\t}\n }\n }\n\n cout << count << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":1244,"score_of_the_acc":-0.0031,"final_rank":1},{"submission_id":"aoj_2039_1175868","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nvector<int>P;\nint pr[30001];\nvoid era(){\n\tpr[0]=pr[1]=1;\n\tfor(int i=2;i*i<=30000;i++){\n\t\tif(pr[i]==0){\n\t\t\tfor(int j=i+i;j<=30000;j+=i){\n\t\t\t\tpr[j]=1;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=2;i<=30000;i++){\n\t\tif(pr[i]==0)P.push_back(i);\n\t}\n}\nint main(){\n\tera();\n\tfor(int t;cin>>t,t;){\n\t\tint ans=0;\n\t\tfor(int i=0;i<P.size();i++){\n\t\t\tif(t<P[i]*3)break;\n\t\t\tfor(int j=i;j<P.size();j++){\n\t\t\t\tint k=t-P[i]-P[j];\n\t\t\t\tif(k<P[j])break;\n\t\t\t\tif(k<P[i]+P[j] && pr[k]==0){\n\t\t\t\t\t//cout<<P[i]<<\" \"<<P[j]<<\" \"<<k<<endl;\n\t\t\t\t\tans++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":130,"memory_kb":1364,"score_of_the_acc":-0.0243,"final_rank":4},{"submission_id":"aoj_2039_1133041","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ninline bool isPrime(int a){\n if(a<=1)return false;\n for(int i=2;i*i<=a;i++){\n if(a%i==0)return false;\n }\n return true;\n}\n\nint main(){\n bool pt[30030] = {};\n vector<int> pl;\n for(int i=0;i<=30000;i++){\n if(isPrime(i)){\n pt[i] = 1; pl.push_back(i);\n }\n }\n\n int t;\n while(scanf(\"%d\",&t),t){\n int res = 0;\n for(int i=0;i<(int)pl.size();i++){\n for(int j=i;j<(int)pl.size();j++){\n\tint rem = t - pl[i] - pl[j];\n\tif(rem < pl[j])break;\n\tif(pl[i]+pl[j]>rem && pt[rem])res++;\n }\n }\n printf(\"%d\\n\",res);\n }\n}","accuracy":1,"time_ms":140,"memory_kb":1272,"score_of_the_acc":-0.0145,"final_rank":2},{"submission_id":"aoj_2039_1133039","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ninline bool isPrime(int a){\n if(a<=1)return false;\n for(int i=2;i*i<=a;i++){\n if(a%i==0)return false;\n }\n return true;\n}\n\nint main(){\n bool pt[30030] = {};\n vector<int> pl;\n for(int i=0;i<=30000;i++){\n if(isPrime(i)){\n pt[i] = 1; pl.push_back(i);\n }\n }\n\n int t;\n while(cin >> t,t){\n int res = 0;\n for(int i=0;i<(int)pl.size();i++){\n for(int j=i;j<(int)pl.size();j++){\n\tint rem = t - pl[i] - pl[j];\n\tif(rem < pl[j])break;\n\tif(pl[i]+pl[j]>rem && pt[rem])res++;\n }\n }\n cout << res << endl;\n }\n}","accuracy":1,"time_ms":140,"memory_kb":1280,"score_of_the_acc":-0.0154,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_2039_10850472\",\n \"code_snippet\": \"#include <stdio.h>\\n#define MAX 30010\\n\\nint dy[MAX], prime[MAX];\\nint n, pcnt;\\nbool p[MAX];\\n\\nvoid getprime(void){\\n\\tint i, j;\\n\\tfor (i=2;i<=15000;i++){\\n\\t\\tif (p[i]) continue;\\n\\t\\tprime[++pcnt]=i;\\n\\t\\tfor (j=i*i;j<=15000;j+=i){\\n\\t\\t\\tp[j]=1;\\n\\t\\t}\\n\\t}\\n}\\n\\nint main(void){\\n\\tint i, j;\\n\\tint pi, pj, pk;\\n\\tgetprime();\\n\\t\\n\\tfor (;;){\\n\\t\\tint cnt=0;\\n\\t\\tscanf(\\\"%d\\\", &n);\\n\\t\\tif (n==0) break;\\n\\t\\tfor (i=1;i<=pcnt;i++){\\n\\t\\t\\tpi=prime[i];\\n\\t\\t\\tif (pi>=n) break;\\n\\t\\t\\tfor (j=i;j<=pcnt;j++){\\n\\t\\t\\t\\tpj=prime[j];\\n\\t\\t\\t\\tif (pi+pj>=n) break;\\n\\t\\t\\t\\tpk=n-pi-pj;\\n\\t\\t\\t\\tif (pk<pj) break;\\n\\t\\t\\t\\tif (p[pk]) continue;\\n\\t\\t\\t\\tif (pi<pj+pk && pj<pk+pi && pk<pi+pj){\\n\\t\\t\\t\\t\\tcnt++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\", cnt);\\n\\t}\\n\\treturn false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 2976,\n \"score_of_the_acc\": -0.2357,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2039_9558141\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\nusing namespace std;\\n//make -f ../makefile SRC=\\n/*\\nfor triangle: a + b > c where a, b are the shorter sides\\n\\n*/\\n\\n\\n//------------------------------------------------------------------------------\\nbool DEBUG = false;\\nconst int INF = 1000000000;\\n\\nconst int MAX_V = 30000;\\nstatic bool prime[MAX_V+1];\\n\\nconst int K = 3;\\nconst int P = 3245;\\nstatic int S[MAX_V+1][K];\\nstatic vector<int> primes(P);\\n//------------------------------------------------------------------------------\\nvoid sieve()\\n{\\n prime[0] = false;\\n prime[1] = false;\\n\\n for (int i=2; i<=MAX_V; i++) prime[i] = true;\\n\\n for (int i=2; i*i<=MAX_V; i++)\\n {\\n if (prime[i])\\n {\\n for (int j=2*i; j<=MAX_V; j+=i) prime[j] = false;\\n }\\n }\\n\\n int index = 0;\\n for (int i=2; i<=MAX_V; i++)\\n if (prime[i])\\n primes[index++] = i;\\n}\\n\\n\\n//------------------------------------------------------------------------------\\nint solve(int sum)\\n{\\n int res = 0;\\n for (int p1=0; p1<P; ++p1)\\n {\\n if (primes[p1] >= sum) break;\\n for (int p2=p1; p2<P; ++p2)\\n {\\n if (primes[p1]+primes[p2] >= sum) break;\\n int c = sum - primes[p1] - primes[p2];\\n if (prime[c] && c >= primes[p1] && c >= primes[p2] && c < primes[p1]+primes[p2]) res++;\\n }\\n }\\n return res;\\n}\\n\\n//------------------------------------------------------------------------------\\nint main()\\n{\\n //test(); return 0;\\n //DEBUG = true;\\n sieve();\\n //--------------------------------------------------------------------------\\n int N, sum, num;\\n while (true)\\n {\\n num = scanf(\\\"%d \\\", &sum);\\n if (sum == 0) break;\\n int res = solve(sum);\\n printf(\\\"%d\\\\n\\\", res);\\n }\\n //--------------------------------------------------------------------------\\n return 0;\\n}\\n//------------------------------------------------------------------------------\",\n \"accuracy\": 1,\n \"time_ms\": 690,\n \"memory_kb\": 3492,\n \"score_of_the_acc\": -0.3766,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2039_5753197\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\n\\nconst int N=30030;\\nint not_is_prime[N];\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n vector<int> P;\\n for(int i=2;i<N;i++){\\n if(!not_is_prime[i]){\\n P.push_back(i);\\n for(int j=i+i;j<N;j+=i){\\n not_is_prime[j]=1;\\n }\\n }\\n }\\n vector<vector<int>> res(4,vector<int>(N));\\n res[0][0]=1;\\n for(auto p:P){\\n for(int i=1;i<4;i++){\\n for(int j=p;j<N;j++){\\n if(i==3 and p>=j-p)continue;\\n res[i][j]+=res[i-1][j-p];\\n }\\n }\\n }\\n int n;\\n while(cin >> n,n){\\n printf(\\\"%d\\\\n\\\",res[3][n]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3776,\n \"score_of_the_acc\": -0.3148,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2039_3678466\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\n#include <string>\\n#include <climits>\\n#include <iomanip>\\n#include <algorithm>\\n#include <queue>\\n#include <map>\\n#include <tuple>\\n#include <iostream>\\n#include <deque>\\n#include <array>\\n#include <set>\\n#include <functional>\\n#include <memory>\\n\\n\\nstd::vector<int> primes(const int upper_limit) {\\n\\tstd::vector<bool> is_prime(upper_limit + 1, true);\\n\\tfor (auto i = 2; i * i <= upper_limit; ++i) {\\n\\t\\tif (is_prime[i]) {\\n\\t\\t\\tfor (auto j = i * i; j <= upper_limit; j += i) {\\n\\t\\t\\t\\tis_prime[j] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tstd::vector<int> result;\\n\\tfor (auto i = 2; i <= upper_limit; ++i) {\\n\\t\\tif (is_prime[i]) {\\n\\t\\t\\tresult.push_back(i);\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\nint main() {\\n\\tconst auto prime = primes(30000);\\n\\twhile (true) {\\n\\t\\tint n; std::cin >> n;\\n\\t\\tif (n == 0) return 0;\\n\\t\\tauto count = 0;\\n\\t\\tauto greater = std::lower_bound(prime.begin(), prime.end(), n / 3);\\n\\t\\twhile (greater != prime.end() && *greater * 2 < n) {\\n\\t\\t\\tauto mid = std::lower_bound(prime.begin(), prime.end(), (n - *greater) / 2);\\n\\t\\t\\twhile (*mid <= *greater) {\\n\\t\\t\\t\\tif (n - *greater - *mid <= *mid && std::binary_search(prime.begin(), prime.end(), n - *greater - *mid)) {\\n\\t\\t\\t\\t\\t++count;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t++mid;\\n\\t\\t\\t}\\n\\t\\t\\t++greater;\\n\\t\\t}\\n\\t\\tstd::cout << count << std::endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 780,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -0.354,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2039_2665941\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\nvector<int>primes;\\nvoid hurui(const int amax) {\\n\\tstatic bool flag = false;\\n\\tif (flag)return;\\n\\tvector<int>sos;\\n\\tsos = vector<int>(amax + 1, true);\\n\\tsos[0] = false; sos[1] = false;\\n\\tfor (int i = 2; i <= amax; ++i) {\\n\\t\\tif (sos[i]) {\\n\\t\\t\\tfor (int j = 2 * i; j <= amax; j += i)sos[j] = false;\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i <= amax; ++i) {\\n\\t\\tif (sos[i]) {\\n\\t\\t\\tprimes.push_back(i);\\n\\t\\t}\\n\\t}\\n\\tflag = true;\\n}\\n\\nint main() {\\n\\thurui(3e4);\\n\\twhile (true) {\\n\\t\\tint T;cin>>T;\\n\\t\\tif(!T)break;\\n\\t\\tint ans=0;\\n\\t\\tfor (int i = 0; i < primes.size(); ++i) {\\n\\t\\t\\tfor (int j = i; j < primes.size(); ++j) {\\n\\t\\t\\t\\tint a=primes[i];\\n\\t\\t\\t\\tint b=primes[j];\\n\\t\\t\\t\\tint c=T-a-b;\\n\\t\\t\\t\\tif(b>c)continue;\\n\\t\\t\\t\\tif(a+b<=c)continue;\\n\\t\\t\\t\\tif (binary_search(primes.begin(), primes.end(), c)) {\\n\\t\\t\\t\\t\\tans++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1630,\n \"memory_kb\": 3228,\n \"score_of_the_acc\": -0.4912,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2039_2555244\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nbool is_prime[30001];\\nvector<int> PRIME;\\n\\nint main(){\\n\\n\\tfor(int i = 0; i <= 30000; i++){\\n\\t\\tis_prime[i] = true;\\n\\t}\\n\\n\\tfor(int i = 2; i <= sqrt(30000); i++){\\n\\t\\tif(is_prime[i]){\\n\\t\\t\\tfor(int k = 2*i; k <= 30000; k += i){\\n\\t\\t\\t\\tis_prime[k] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 2; i <= 30000; i++){\\n\\t\\tif(is_prime[i]){\\n\\t\\t\\tPRIME.push_back(i);\\n\\t\\t}\\n\\t}\\n\\n\\tint T;\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d\\\",&T);\\n\\t\\tif(T == 0)break;\\n\\n\\t\\tint ans = 0;\\n\\n\\t\\tfor(int a = 0; a < PRIME.size(); a++){\\n\\t\\t\\tif(PRIME[a] > T)break;\\n\\t\\t\\tfor(int b = a; b < PRIME.size(); b++){\\n\\t\\t\\t\\tif(PRIME[a]+PRIME[b] > T)break;\\n\\t\\t\\t\\tint c = T -(PRIME[a]+PRIME[b]);\\n\\n\\t\\t\\t\\tif(!is_prime[c])continue;\\n\\n\\t\\t\\t\\tif(PRIME[b] <= c && (PRIME[a]+PRIME[b]) > c && (PRIME[b]+c) > PRIME[a] && (c+PRIME[a]) > PRIME[b])ans++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 490,\n \"memory_kb\": 3324,\n \"score_of_the_acc\": -0.3244,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2039_2276125\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define mk make_pair\\nint s[30001],ss[30001],c=2;\\nset<long long>se;\\nint main(){\\n s[0]=2;s[1]=3;ss[2]=ss[3]=1;\\n for(int i=2;i<30001;i++){\\n int p=0;\\n for(int j=2;j*j<=i;j++)\\n if(i%j==0)p++;\\n if(!p)ss[i]++,s[c++]=i;\\n }\\n int n;\\n while(cin>>n,n){\\n se.clear();\\n int sum=0;\\n for(int i=0;i<c;i++){\\n if(s[i]>n/2+1)break;\\n for(int j=0;j<c;j++){\\n if(s[j]+s[i]>n)break;\\n if(n-s[j]-s[i]>0)\\n if(ss[n-s[j]-s[i]]){\\n int d[3];\\n d[0]=s[i];\\n d[1]=s[j];\\n d[2]=n-s[j]-s[i];\\n sort(d,d+3);\\n if(!se.count(d[0]*10000000000+d[1]*100000+d[2])&&d[0]+d[1]>d[2]){\\n se.insert(d[0]*10000000000+d[1]*100000+d[2]);\\n sum++;\\n }\\n }\\n }\\n }\\n cout<<sum<<endl;\\n }\\n }\",\n \"accuracy\": 1,\n \"time_ms\": 6450,\n \"memory_kb\": 5916,\n \"score_of_the_acc\": -1.5808,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2039_2275730\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define mk make_pair\\nint s[30001],ss[30001],c=2;\\nunordered_set<long long>se;\\nint main(){\\n s[0]=2;s[1]=3;ss[2]=ss[3]=1;\\n for(int i=2;i<30001;i++){\\n int p=0;\\n for(int j=2;j*j<=i;j++)\\n if(i%j==0)p++;\\n if(!p)ss[i]++,s[c++]=i;\\n }\\n int n;\\n while(cin>>n,n){\\n se.clear();\\n int sum=0;\\n for(int i=0;i<c;i++){\\n if(s[i]>n/2+1)break;\\n for(int j=0;j<c;j++){\\n\\tif(s[j]+s[i]>n)break;\\n\\tif(n-s[j]-s[i]>0)\\n\\t if(ss[n-s[j]-s[i]]){\\n\\t int d[3];\\n\\t d[0]=s[i];\\n\\t d[1]=s[j];\\n\\t d[2]=n-s[j]-s[i];\\n\\t sort(d,d+3);\\n\\t if(!se.count(d[0]*10000000000+d[1]*100000+d[2])&&d[0]+d[1]>d[2]){\\n\\t\\tse.insert(d[0]*10000000000+d[1]*100000+d[2]);\\n\\t sum++;\\n\\t }\\n\\t }\\n }\\n }\\n cout<<sum<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3390,\n \"memory_kb\": 5312,\n \"score_of_the_acc\": -1.0261,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2039_2275718\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int TMAX = 30000;\\n\\npair< vector<int>, vector<int> > eratosthenes(int N){\\n vector<int> res;\\n vector<int> arr(N);\\n for(int i=0; i < N; i++){\\n arr[i] = true;\\n }\\n arr[0] = false;\\n arr[1] = false;\\n for(int i=2; i*i <= N; i++){\\n if(arr[i] == true){\\n for(int j=i+i; j < N; j += i){\\n arr[j] = false;\\n }\\n }\\n }\\n for(int i = 0; i < N; i++){\\n if(arr[i] == true) res.push_back(i);\\n }\\n return pair< vector<int>, vector<int> >(res, arr);\\n}\\n\\nbool isTri(int i, int j, int k){\\n int a[] = {i, j, k};\\n sort(a, a+3);\\n if(a[2] < a[1] + a[0]) return true;\\n else return false;\\n}\\n\\nint main(void){\\n int T;\\n while(cin >> T, T){\\n pair< vector<int>, vector<int> > tmp = eratosthenes(TMAX);\\n vector<int> primes = tmp.first;\\n vector<int> is_prime = tmp.second;\\n int ans = 0;\\n for(int i = 0; i < primes.size(); i++){\\n for(int j = i; j < primes.size(); j++){\\n int k = T - primes[i] - primes[j];\\n if(k >= 1 && k >= primes[j] && is_prime[k] == true && isTri(primes[i], primes[j], k)){\\n //cout << primes[i] << \\\" \\\" << primes[j] << \\\" \\\" << k << endl;\\n ans++;\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1180,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -0.4077,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2039_2275656\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nconst int MAX_T = 30000;\\nint T;\\nll res[30003];\\nvector<int> ps;\\nunordered_map<int,ll> dp[2];\\n\\nvoid init(){\\n bool f[30003];\\n memset( f,0,sizeof(f) );\\n for(int i=2;i<=30000;i++){\\n if( f[i] ) continue;\\n ps.emplace_back(i);\\n for(int j=i+i;j<=30000;j+=i)\\n f[j] = true;\\n }\\n}\\n\\nvoid solve(){\\n for(int p : ps){\\n dp[0][p]++;\\n for( auto q : dp[0] ){\\n if( q.first + p > MAX_T ) continue; \\n dp[1][q.first+p] += q.second;\\n }\\n for( auto q : dp[1] ){\\n if( q.first + p > MAX_T ) continue;\\n if( q.first <= p )\\n continue; \\n res[ q.first + p ] += q.second;\\n }\\n }\\n}\\n\\nint main(){\\n init();\\n solve();\\n while( cin >> T && T ){\\n cout << res[T] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 4108,\n \"score_of_the_acc\": -0.3749,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2039_2275614\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define N 40001\\nusing namespace std;\\n#define int long long\\nint T;\\nbool used[N];\\nvector<int> prime;\\n\\n\\nsigned main(){\\n used[0] = used[1] = 1;\\n for(int i=2;i*i<N;i++)\\n if(used[i] == 0)\\n for(int j=2;j<N/i;j++)used[i*j] = 1;\\n for(int i=0;i<N;i++) if(!used[i]) prime.push_back(i);\\n \\n while(1){\\n cin>>T;\\n if(T==0)break;\\n \\n\\n \\n int ans = 0;\\n for(int i=0;i<prime.size();i++)\\n for(int j=i;j<prime.size();j++){\\n int a = prime[i];\\n int b = prime[j];\\n int c = T-(a+b);\\n if(b>c)continue;\\n if(a+b>=T||used[c] == 1)continue;\\n if(a+b>c && a+c>b && b+c>a)ans++;\\n }\\n cout<<ans<<endl;\\n } \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2150,\n \"memory_kb\": 3160,\n \"score_of_the_acc\": -0.5642,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2039_1893559\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef pair<int,pii> pip;\\ntypedef vector<pip>vip;\\nconst double PI=acos(-1);\\nconst double EPS=1e-8;\\nconst int inf=1e8;\\nint main(){\\n\\t#define MAX 30010\\n\\tbool sosu[MAX]={1,1,0};\\n\\tfor(int i=2;i*i<=MAX;i++)if(!sosu[i])\\n\\tfor(int j=2*i;j<MAX;j+=i)sosu[j]=true;\\n\\tvi so;\\n\\trep(i,MAX)if(sosu[i]==0)so.pb(i);\\n\\tint n;\\n\\twhile(cin>>n,n){\\n\\t\\tint out=0;\\n\\t\\tint m=lower_bound(all(so),n)-so.begin();\\n\\t\\trep(i,m)loop(j,i,m){\\n\\t\\t\\tint t=n-so[i]-so[j];\\n\\t\\t\\tif(t<so[j])continue;\\n\\t\\t\\tif(sosu[t])continue;\\n\\t\\t\\tint ma=max(t,max(so[i],so[j]));\\n\\t\\t\\tint sum=t+so[i]+so[j];\\n\\t\\t\\tif(sum>2*ma)out++;\\n\\t\\t}\\n\\t\\tcout<<out<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 580,\n \"memory_kb\": 1284,\n \"score_of_the_acc\": -0.0849,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2039_1882397\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define MAX 15010\\ntypedef pair<int,int> pii;\\ntypedef pair<pii,int> P;\\n \\nbool check(int a,int b,int c){\\n if(a >= b+c || b >= a+c || c >= a+b) return false;\\n return true;\\n}\\n \\nint main(){\\n vector<int> prime;\\n bool p[MAX];\\n fill(p,p+MAX,true);\\n p[0] = p[1] = false;\\n for(int i = 2 ; i < MAX ; i++){\\n\\tif(!p[i]) continue;\\n\\tprime.push_back(i);\\n\\tfor(int j = 2*i ; j < MAX ; j += i){\\n\\t p[j] = false;\\n\\t}\\n }\\n int T;\\n while(cin >> T, T){\\n\\tint cnt = 0;\\n\\tset<P> st;\\n\\tint size = prime.size();\\n\\tfor(int i = 0 ; i < size ; i++){\\n\\t if(prime[i] > T) continue;\\n\\t for(int j = i ; j < size ; j++){\\n\\t\\tif(prime[i]+prime[j] > T) continue;\\n\\t\\tint k = T-prime[i]-prime[j];\\n\\t\\tif(k < 0 || k >= MAX || !p[k]) continue;\\n\\t\\tint a[3] = {prime[i],prime[j],k};\\n\\t\\tsort(a,a+3);\\n\\t\\tif(st.count(P(pii(a[0],a[1]),a[2]))) continue;\\n\\t\\tst.insert(P(pii(a[0],a[1]),a[2]));\\n\\t\\tif(check(a[0],a[1],a[2])){\\n\\t\\t cnt++;\\n\\t\\t}\\n\\t }\\n\\t}\\n\\tcout << cnt << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3450,\n \"memory_kb\": 9288,\n \"score_of_the_acc\": -1.5298,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2039_1800026\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\nusing namespace std;\\nint P[31000]; vector<int>prime;\\nint p[31000]; int M = 30000;\\nint main() {\\n\\tp[0] = 1; p[1] = 1;\\n\\tfor (int i = 2; i*i <= M; i++) {\\n\\t\\tfor (int j = i*i; j <= M; j += i)p[j] = 1;\\n\\t}\\n\\tfor (int i = 0; i <= M; i++) { if (p[i] == 0)prime.push_back(i); }\\n\\tfor (int i = 0; i < prime.size(); i++) {\\n\\t\\tfor (int j = i; j < prime.size(); j++) {\\n\\t\\t\\tfor (int k = j; k < prime.size(); k++) {\\n\\t\\t\\t\\tint v = prime[i] + prime[j] + prime[k];\\n\\t\\t\\t\\tif (v > M)continue;\\n\\t\\t\\t\\tif (prime[i] + prime[j] <= prime[k])continue;\\n\\t\\t\\t\\tP[v]++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint n;\\n\\twhile (true) {\\n\\t\\tcin >> n; if (n == 0)break;\\n\\t\\tcout << P[n] << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4140,\n \"memory_kb\": 3360,\n \"score_of_the_acc\": -0.901,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2039_1799919\",\n \"code_snippet\": \"#include <iostream>\\nusing namespace std;\\nint n, c, p[5000]; bool prime[30001];\\nint main() {\\n\\tfor(int i = 2; i <= 30000; i++) prime[i] = true;\\n\\tfor(int i = 2; i * i <= 30000; i++) {\\n\\t\\tif(!prime[i]) continue;\\n\\t\\tfor(int j = i * i; j <= 30000; j += i) prime[j] = false;\\n\\t}\\n\\tfor(int i = 2; i <= 30000; i++) {\\n\\t\\tif(prime[i]) p[c++] = i;\\n\\t}\\n\\twhile(cin >> n, n) {\\n\\t\\tint ret = 0;\\n\\t\\tfor(int i = 0; i < c && p[i] < n; i++) {\\n\\t\\t\\tfor(int j = i; j < c && p[i] + p[j] < n; j++) {\\n\\t\\t\\t\\tint w = n - p[i] - p[j];\\n\\t\\t\\t\\tif(prime[w] && p[i] + p[j] > w && w >= p[j]) ret++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ret << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 650,\n \"memory_kb\": 3148,\n \"score_of_the_acc\": -0.3276,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2039_1571918\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <climits>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <fstream>\\n#include <iostream>\\n#include <list>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <string>\\n#include <vector>\\n#include <cassert>\\n// #include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define LOG(...) fprintf(stderr,__VA_ARGS__)\\n//#define LOG(...)\\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)\\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\\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 SORT(c) sort(ALL(c))\\n#define RSORT(c) sort(RALL(c))\\n#define SQ(n) (n)*(n)\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef vector<bool> vb;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vll;\\ntypedef vector<vb> vvb;\\ntypedef vector<vi> vvi;\\ntypedef vector<vll> vvll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\n\\n\\nint primes[3000];\\nint siz = 0;\\nint num[40000]={0};\\nbool isprime[200000]={false};\\n\\nint main() {\\n for(int i=2;i<20000;i++){\\n if(isprime[i])continue;\\n primes[siz++]=i;\\n for(int j=i*2;j<20000;j+=i){\\n isprime[j]=true;\\n }\\n }\\n for(int a=0;primes[a]<=15000;a++){\\n for(int b=a;primes[b]<=15000;b++){\\n for(int c=b;primes[c]<=15000;c++){\\n if(primes[a]+primes[b]<=primes[c])continue;\\n if(primes[a]+primes[b]+primes[c]>30000)continue;\\n num[primes[a]+primes[b]+primes[c]]++;\\n // LOG(\\\"%d %d %d\\\\n\\\",primes[a],primes[b],primes[c]);\\n }\\n }\\n }\\n // cout << \\\"end works\\\" << endl;\\n\\n int T;\\n while(cin>>T,T){\\n cout << num[T] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 660,\n \"memory_kb\": 1320,\n \"score_of_the_acc\": -0.1019,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2039_1357444\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_T = 30000;\\nconst int MAX_SIDE = (MAX_T - 1) / 2;\\n\\n/* typedef */\\n\\ntypedef vector<int> vi;\\n\\n/* global variables */\\n\\nbool primes[MAX_SIDE + 1];\\nvi pnums;\\nint np;\\n\\n/* subroutines */\\n\\nvoid calc_prime(int max_p) {\\n primes[0] = primes[1] = false;\\n for (int p = 2; p <= max_p; p++) primes[p] = true;\\n\\n for (int p = 2; p * p <= max_p; p++)\\n if (primes[p])\\n for (int q = p * p; q <= max_p; q += p) primes[q] = false;\\n\\n for (int p = 2; p <= max_p; p++)\\n if (primes[p]) pnums.push_back(p);\\n\\n np = pnums.size();\\n}\\n\\n/* main */\\n\\nint main() {\\n calc_prime(MAX_SIDE);\\n\\n for (;;) {\\n int t;\\n cin >> t;\\n if (t == 0) break;\\n\\n int count = 0;\\n int mina = t / 3;\\n int maxside = (t - 1) / 2;\\n \\n for (vi::iterator ait = pnums.begin(); ait != pnums.end(); ait++) {\\n int& a = *ait;\\n if (a < mina) continue;\\n if (a > maxside) break;\\n\\n int minb = (t - a) / 2;\\n \\n for (vi::iterator bit = pnums.begin(); bit != pnums.end(); bit++) {\\n\\tint& b = *bit;\\n\\tif (b < minb) continue;\\n\\tif (b > a) break;\\n\\n\\tint c = t - (a + b);\\n\\tif (c > 0 && c <= b && primes[c]) {\\n\\t count++;\\n\\t}\\n }\\n }\\n\\n cout << count << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 1244,\n \"score_of_the_acc\": -0.0031,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2039_1175868\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nvector<int>P;\\nint pr[30001];\\nvoid era(){\\n\\tpr[0]=pr[1]=1;\\n\\tfor(int i=2;i*i<=30000;i++){\\n\\t\\tif(pr[i]==0){\\n\\t\\t\\tfor(int j=i+i;j<=30000;j+=i){\\n\\t\\t\\t\\tpr[j]=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(int i=2;i<=30000;i++){\\n\\t\\tif(pr[i]==0)P.push_back(i);\\n\\t}\\n}\\nint main(){\\n\\tera();\\n\\tfor(int t;cin>>t,t;){\\n\\t\\tint ans=0;\\n\\t\\tfor(int i=0;i<P.size();i++){\\n\\t\\t\\tif(t<P[i]*3)break;\\n\\t\\t\\tfor(int j=i;j<P.size();j++){\\n\\t\\t\\t\\tint k=t-P[i]-P[j];\\n\\t\\t\\t\\tif(k<P[j])break;\\n\\t\\t\\t\\tif(k<P[i]+P[j] && pr[k]==0){\\n\\t\\t\\t\\t\\t//cout<<P[i]<<\\\" \\\"<<P[j]<<\\\" \\\"<<k<<endl;\\n\\t\\t\\t\\t\\tans++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 1364,\n \"score_of_the_acc\": -0.0243,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2039_1133041\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ninline bool isPrime(int a){\\n if(a<=1)return false;\\n for(int i=2;i*i<=a;i++){\\n if(a%i==0)return false;\\n }\\n return true;\\n}\\n\\nint main(){\\n bool pt[30030] = {};\\n vector<int> pl;\\n for(int i=0;i<=30000;i++){\\n if(isPrime(i)){\\n pt[i] = 1; pl.push_back(i);\\n }\\n }\\n\\n int t;\\n while(scanf(\\\"%d\\\",&t),t){\\n int res = 0;\\n for(int i=0;i<(int)pl.size();i++){\\n for(int j=i;j<(int)pl.size();j++){\\n\\tint rem = t - pl[i] - pl[j];\\n\\tif(rem < pl[j])break;\\n\\tif(pl[i]+pl[j]>rem && pt[rem])res++;\\n }\\n }\\n printf(\\\"%d\\\\n\\\",res);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 1272,\n \"score_of_the_acc\": -0.0145,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2039_1133039\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ninline bool isPrime(int a){\\n if(a<=1)return false;\\n for(int i=2;i*i<=a;i++){\\n if(a%i==0)return false;\\n }\\n return true;\\n}\\n\\nint main(){\\n bool pt[30030] = {};\\n vector<int> pl;\\n for(int i=0;i<=30000;i++){\\n if(isPrime(i)){\\n pt[i] = 1; pl.push_back(i);\\n }\\n }\\n\\n int t;\\n while(cin >> t,t){\\n int res = 0;\\n for(int i=0;i<(int)pl.size();i++){\\n for(int j=i;j<(int)pl.size();j++){\\n\\tint rem = t - pl[i] - pl[j];\\n\\tif(rem < pl[j])break;\\n\\tif(pl[i]+pl[j]>rem && pt[rem])res++;\\n }\\n }\\n cout << res << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.0154,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":1077,"cells":{"group_id":{"kind":"string","value":"aoj_2048_cpp"},"problem_description":{"kind":"string","value":"Problem A:\nEverlasting...?\nEverlasting Sa-Ga, a new, hot and very popular role-playing game, is out on October 19, 2008.\nFans have been looking forward to a new title of Everlasting Sa-Ga.\nLittle Jimmy is in trouble. He is a seven-year-old boy, and he obtained the Everlasting Sa-Ga\nand is attempting to reach the end of the game before his friends. However, he is facing difficulty\nsolving the riddle of the first maze in this game -- Everlasting Sa-Ga is notorious in extremely\nhard riddles like Neverending Fantasy and Forever Quest.\nThe riddle is as follows. There are two doors on the last floor of the maze: the door to the\ntreasure repository and the gate to the hell. If he wrongly opens the door to the hell, the game\nis over and his save data will be deleted. Therefore, he should never open the wrong door.\nSo now, how can he find the door to the next stage? There is a positive integer given for each\ndoor -- it is a great hint to this riddle. The door to the treasure repository has the integer that\ngives the larger\nkey numbe\nr. The key number of a positive integer\nn\nis the largest prime factor\nminus the total sum of any other prime factors, where the prime factors are the prime numbers\nthat divide into\nn\nwithout leaving a remainder. Note that each prime factor should be counted\nonly once.\nAs an example, suppose there are doors with integers 30 and 20 respectively. Since 30 has three\nprime factors 2, 3 and 5, its key number is 5 - (2 + 3) = 0. Similarly, since 20 has two prime\nfactors 2 and 5, its key number 20 is 5 - 2 = 3. Jimmy therefore should open the door with 20.\nYour job is to write a program to help Jimmy by solving this riddle.\nInput\nThe input is a sequence of datasets. Each dataset consists of a line that contains two integers\na\nand\nb\nseparated by a space (2 ≤\na\n,\nb\n≤ 10\n6\n). It is guaranteed that key numbers of these integers\nare always different.\nThe input is terminated by a line with two zeros. This line is not part of any datasets and thus\nshould not be processed.\nOutput\nFor each dataset, print in a line ‘a’ (without quotes) if the door with the integer\na\nis connected\nto the treasure repository; print ‘b’ otherwise. No extra space or character is allowed.\nSample Input\n10 15\n30 20\n0 0\nOutput for the Sample Input\na\nb"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2048_4109877","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\nusing namespace std;\ntypedef long long int ll;\n\nint key(int x){\n\tint s=0,m=0;\n\tfor(int i=2;i<=x;i++){\n\t\tif(x%i==0){\n\t\t\ts+=i;\n\t\t\tm=i;\n\t\t\twhile(x%i==0){\n\t\t\t\tx/=i;\n\t\t\t}\n\t\t}\n\t}\n\treturn m-(s-m);\n}\n \nint main(){\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\twhile(1){\n\t\tint a,b; cin >> a >> b;\n\t\tif(a==0&&b==0)break;\n\t\tcout << (key(a)>key(b)?'a':'b') << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":160,"memory_kb":3032,"score_of_the_acc":-0.3498,"final_rank":5},{"submission_id":"aoj_2048_3396011","code_snippet":"#include<iostream>\n#include<vector>\nusing namespace std;\n\nint main(){\n vector<bool> nonp(1000001, 0);\n for(int i = 2; i < 1000001; i++){\n if(nonp[i]) continue;\n for(int j = i+i; j < 1000001; j += i) nonp[j] = true;\n }\n int a, b;\n while(cin >> a >> b, a+b){\n int x = 1<<30, y = 1<<30;\n for(int i = a; i >= 2; i--){\n if(a%i == 0 && !nonp[i]){\n if(x == 1<<30) x = i;\n else x -= i;\n }\n }\n for(int i = b; i >= 2; i--){\n if(b%i == 0 && !nonp[i]){\n if(y == 1<<30) y = i;\n else y -= i;\n }\n }\n cout << (x > y ? \"a\" : \"b\") << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":890,"memory_kb":3140,"score_of_the_acc":-1.2116,"final_rank":19},{"submission_id":"aoj_2048_3089737","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\nbool p[1100000] = {};\n\nint main(){\n\t\n\tint N = 1000000;\n\t\n\tfor(int i = 0; i < N; i++){\n\t\tp[i] = true;\n\t}\n\t\n\tp[0] = false;\n\tp[1] = false;\n\t\n\tfor(int i = 2; i < N; i++){\n\t\tif(p[i]){\n\t\t\tfor(int j = i * 2; j < N; j += i){\n\t\t\t\tp[j] = false;\n\t\t\t}\n\t\t}\n\t}\n\t\n\twhile(true){\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tif(a == 0){\n\t\t\tbreak;\n\t\t}\n\t\tint Sa, Sb;\n\t\tint pmax = 0;\n\t\tint S = 0;\n\t\tfor(int i = 1; i <= a; i++){\n\t\t\tif(a % i == 0 && p[i]){\n\t\t\t\tS += i;\n\t\t\t\tpmax = i;\n\t\t\t}\n\t\t}\n\t\tSa = pmax * 2 - S;\n\t\t\n\t\tS = 0;\n\t\tfor(int i = 1; i <= b; i++){\n\t\t\tif(b % i == 0 && p[i]){\n\t\t\t\tS += i;\n\t\t\t\tpmax = i;\n\t\t\t}\n\t\t}\n\t\tSb = pmax * 2 - S;\n\t\tif(Sa > Sb){\n\t\t\tcout << \"a\" << endl;\n\t\t}else{\n\t\t\tcout << \"b\" << endl;\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":810,"memory_kb":4036,"score_of_the_acc":-1.3086,"final_rank":20},{"submission_id":"aoj_2048_2854456","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\nint adiv(int a) {\n\tmap<int,int>mp;\n\tint num(a);\n\tfor (int i = 2; i <= a; ++i) {\n\t\twhile (num%i == 0) {\n\t\t\tmp[i]++;\n\t\t\tnum/=i;\n\t\t}\n\t}\n\tint anum=0;\n\tfor (auto m : mp) {\n\t\tanum-=m.first;\n\t}\n\tanum+=2*prev(mp.end())->first;\n\treturn anum;\n}\n\nint main() {\n\twhile (true) {\n\n\t\tint A, B; cin >> A >> B;\n\t\tif(!A)break;\n\t\tA = adiv(A);\n\t\tB = adiv(B);\n\t\tif (A>B)cout << \"a\" << endl;\n\t\telse cout << \"b\" << endl;\n\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":810,"memory_kb":2992,"score_of_the_acc":-1.0885,"final_rank":17},{"submission_id":"aoj_2048_2630167","code_snippet":"#include <iostream>\n#include <stdlib.h>\n#include <math.h>\n\nusing namespace std;\n\n/* ?????°?????´??°x??\\????????¨???????´???°???????????¢??° */\n/* ?????????????´???°????????°????????°???????????????????´???°???????´???????. */\nint era (int x, int *array)\n{\n\tint search[x];\n\tint len = 0;\n\tsearch[0] = search[1] = 0;\n\tfor (int i = 2; i < x; i++)\n\t\tsearch[i] = 1;\n\tdouble root_x = sqrt(x);\n\tfor (int i = 0; ; i++) {\n\t\tint num = search[i];\n\t\tif (num == 1) {\n\t\t\tif (root_x <= i)\n\t\t\t\tbreak;\n\t\t\telse {\n\t\t\t\tarray[len++] = i;\n\t\t\t\tfor (int j = i; j < x; j+=i)\n\t\t\t\t\tsearch[j] = 0;\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < x; i++) {\n\t\tif (search[i] == 1) {\n\t\t\tarray[len++] = i;\n\t\t\tsearch[i] = 0;\n\t\t}\n\t}\n\treturn len;\n}\n\n/* ?????°????´??????°????±?????????¢??° */\nint p_list(int a, int *list, int *primes, int len)\n{\n\tint a_len = 0;\n\tint i = 0;\n\twhile (primes[i] <= a) \n\t{\n\t\tif (a % primes[i] == 0)\n\t\t\tlist[a_len++] = primes[i];\n\t\ti++;\n\t\tif (len <= i)\n\t\t\tbreak;\n\t}\n\treturn a_len++;\n}\n\nint key(int *list, int len)\n{\n\tint sum = 0;\n\tif (len == 1)\n\t\treturn list[0];\n\tfor (int i = 0; i < len - 1; i++) \n\t\tsum += list[i];\n\treturn list[len-1] - sum;\n\n\n}\n\nint main (void)\n{\n\tint *primes;\n\tint len;\n\tprimes = (int *)malloc(sizeof(int) * 1000000);\n\tlen = era(1000000, primes);\t\n\twhile (1) {\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tif (a == 0 && b == 0)\n\t\t\tbreak;\n\t\tint a_pri[a/2], b_pri[b/2];\n\t\tint a_len, b_len;\n\t\ta_len = p_list(a, a_pri, primes, len);\n\t\tb_len = p_list(b, b_pri, primes, len);\n#ifdef DEBUG\n\t\tcout << a_len << \" \" << b_len << endl;\n\t\tfor (int i = 0; i < a_len; i++)\n\t\t\tcout << a_pri[i] << endl;\n\t\tfor (int i = 0; i < b_len; i++)\n\t\t\tcout << b_pri[i] << endl;\n#endif\n\t\tint a_key, b_key;\n\t\ta_key = key(a_pri, a_len);\n\t\tb_key = key(b_pri, b_len);\n#ifdef DEBUG\n\t\tcout << \"a \" << a_key << endl;\n\t\tcout << \"b \" << b_key << endl;\n#endif\n\t\tif (a_key > b_key)\n\t\t\tcout << \"a\" << endl;\n\t\telse\n\t\t\tcout << \"b\" << endl;\n\t}\n\tfree(primes);\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":6880,"score_of_the_acc":-1.069,"final_rank":15},{"submission_id":"aoj_2048_2601674","code_snippet":"#include <iostream>\n\nusing namespace std;\n\nint main(void){\n bool isPrime[1000001];\n\n for(int i = 0 ; i <= 1000000 ; i++){\n isPrime[i] = true;\n }\n\n isPrime[0] = false;\n isPrime[1] = false;\n for(int n = 2 ; n <= 1000000 ; n++){\n if(isPrime[n]){\n for(int m = n ; m <= 1000000 ; m += n){\n isPrime[m] = false;\n }\n isPrime[n] = true;\n }\n }\n\n while(1){\n int a , b;\n cin >> a;\n cin >> b;\n\n if(a == 0 && b == 0){\n return 0;\n }\n\n int akey = 0;\n int afactmax;\n for(int i = 2 ; i <= a ; i++){\n if(isPrime[i] && a % i == 0){\n akey += i;\n afactmax = i;\n }\n }\n akey = 2 * afactmax - akey;\n\n int bkey = 0;\n int bfactmax;\n for(int i = 2 ; i <= b ; i++){\n if(isPrime[i] && b % i == 0){\n bkey += i;\n bfactmax = i;\n }\n }\n bkey = 2 * bfactmax - bkey;\n\n if(akey > bkey){\n cout << \"a\" << endl;\n }else{\n cout << \"b\" << endl;\n }\n\n\n\n }\n}","accuracy":1,"time_ms":460,"memory_kb":4052,"score_of_the_acc":-0.9096,"final_rank":11},{"submission_id":"aoj_2048_2601650","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <iostream>\n#include <numeric>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n const auto primes = [] {\n bitset<1000000 + 1> b;\n auto t = b;\n t.set();\n t[0] = false;\n t[1] = false;\n int i = 0;\n while (true) {\n bool done = false;\n while (!t[i]) {\n ++i;\n if (i == t.size()) {\n done = true;\n break;\n }\n }\n if (done) {\n break;\n }\n\n b[i] = true;\n for (int j = i; j < t.size(); j += i) {\n t[j] = false;\n }\n }\n return b;\n }();\n\n while (true) {\n int a, b;\n cin >> a >> b;\n if (a == 0 && b == 0) {\n return 0;\n }\n\n auto f = [&primes](int x) {\n vector<int> r;\n int j = 2;\n while (true) {\n while (!primes[j]) {\n ++j;\n }\n if (x == 1) {\n break;\n }\n if (x % j == 0) {\n r.push_back(j);\n x /= j;\n }\n else {\n j += 1;\n }\n }\n r.erase(unique(begin(r), end(r)), end(r));\n return r;\n };\n\n auto pa = f(a);\n auto pb = f(b);\n\n auto g = [](const vector<int>& v) {\n auto s = accumulate(begin(v), --end(v), 0);\n return v.back() - s;\n };\n\n if (g(pa) > g(pb)) {\n cout << \"a\" << endl;\n }\n else {\n cout << \"b\" << endl;\n }\n }\n}","accuracy":1,"time_ms":110,"memory_kb":3284,"score_of_the_acc":-0.3454,"final_rank":3},{"submission_id":"aoj_2048_2601640","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <iostream>\n#include <numeric>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n bitset<1000100 + 1> b;\n auto t = b;\n t.set();\n t[0] = false;\n t[1] = false;\n int i = 0;\n while (true) {\n bool done = false;\n while (!t[i]) {\n ++i;\n if (i == t.size()) {\n done = true;\n break;\n }\n }\n if (done) {\n break;\n }\n\n b[i] = true;\n for (int j = i; j < t.size(); j += i) {\n t[j] = false;\n }\n }\n\n while (true) {\n int a, bb;\n cin >> a >> bb;\n int aa = a;\n int bbb = bb;\n if (a == 0 && bb == 0) {\n return 0;\n }\n\n vector<int> pa;\n int j = 2;\n while (true) {\n while (!b[j]) {\n ++j;\n }\n if (a == 1) {\n break;\n }\n if (a % j == 0) {\n pa.push_back(j);\n a /= j;\n }\n else {\n j += 1;\n }\n }\n vector<int> pb;\n j = 2;\n while (true) {\n while (!b[j]) {\n ++j;\n }\n if (bb == 1) {\n break;\n }\n if (bb % j == 0) {\n pb.push_back(j);\n bb /= j;\n }\n else {\n j += 1;\n }\n }\n pa.erase(unique(begin(pa), end(pa)), end(pa));\n pb.erase(unique(begin(pb), end(pb)), end(pb));\n\n auto f = [](const vector<int>& v) {\n auto s = accumulate(begin(v), --end(v), 0);\n return v.back() - s;\n };\n if (f(pa) > f(pb)) {\n cout << \"a\" << endl;\n }\n else {\n cout << \"b\" << endl;\n }\n }\n}","accuracy":1,"time_ms":110,"memory_kb":3248,"score_of_the_acc":-0.3378,"final_rank":2},{"submission_id":"aoj_2048_2601585","code_snippet":"#include <iostream>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <queue>\nusing namespace std;\nconst int N = 1000000;\nint main(int argc, char *argv[])\n{\n vector<bool> primes(N + 1,true);\n primes[0] = false;\n primes[1] = false;\n for(int i = 0; i <= N; i++) {\n if(primes[i]) {\n for(int j = i+i; j <= N; j+=i) {\n primes[j] = false;\n }\n }\n }\n vector<int> ps;\n for(int i = 0; i <= N; i++) {\n if(primes[i]) ps.push_back(i);\n }\n for(;;) {\n int a, b;\n cin >> a >> b;\n if(a == 0 && b == 0) break;\n auto key = [&ps](int n) {\n int p = 0;\n int s = 0;\n for(int i = 0; i < ps.size() && n >= ps[i]; i++) {\n if((n % ps[i]) == 0) {\n s += ps[i];\n p = ps[i];\n }\n }\n return p*2 - s;\n };\n int ka = key(a);\n int kb = key(b);\n cout << (ka > kb ? \"a\" : \"b\") << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3372,"score_of_the_acc":-0.318,"final_rank":1},{"submission_id":"aoj_2048_2522997","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nbool e[1000005];\nint a,b,c,d;\nvector<int>s;\nmain(){\n for(int i=2;i<1000005;i++)\n if(!e[i])for(int j=i+i;j<1000005;j+=i)e[j]=1;\n for(int i=2;i<1000005;i++)\n if(!e[i])s.push_back(i);\n while(cin>>a>>b,a||b){\n c=d=0;\n for(int i=0;i<s.size()&&s[i]<=a;i++){\n int f1=0;\n while(a%s[i]==0)a/=s[i],f1++;\n if(f1)c-=s[i];\n if(a==1){\n c+=s[i]*2;\n break;\n }\n }\n for(int i=0;i<s.size()&&s[i]<=b;i++){\n int f1=0;\n while(b%s[i]==0)b/=s[i],f1++;\n if(f1)d-=s[i];\n if(b==1){\n d+=s[i]*2;\n break;\n }\n }\n if(c>d)cout<<\"a\"<<endl;\n else cout<<\"b\"<<endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":4144,"score_of_the_acc":-0.4233,"final_rank":6},{"submission_id":"aoj_2048_2441433","code_snippet":"#include<iostream>\n#include<vector>\n#include<cmath>\nusing namespace std; \ntypedef long long ll;\nll prime[1000001];\nll length = 0;\nvoid insert(ll p) { prime[length] = p; length++; return; }\nint main() {\n\tinsert(2);\n\tfor (ll i = 3; i < 1000000; i += 2) {\n\t\tfor (ll j = 0; j < length; j++)\n\t\t\tif (i%prime[j] == 0)goto cont;\n\t\t\telse if (prime[j] > sqrt(i))break;\n\t\t\tinsert(i);\n\t\tcont:;\n\t}\n\tll a, b;\n\twhile (cin >> a >> b){\n\t\tif (!a && !b)return 0;\n\t\tll am, bm, ac = 0, bc = 0;\n\t\tint i = 0;\n\t\twhile (prime[i] <= a){\n\t\t\tif (a%prime[i] == 0) {\n\t\t\t\tam = prime[i];\n\t\t\t\tac += prime[i];\n\t\t\t\twhile (a%prime[i] == 0)a /= prime[i];\n\t\t\t\tif (a == 1)break;\n\t\t\t}\n\t\t\ti++;\n\t\t}\n\t\tac -= am; am -= ac;\n\t\ti = 0;\n\t\twhile (prime[i] <= b) {\n\t\t\tif (b%prime[i] == 0) {\n\t\t\t\tbm = prime[i];\n\t\t\t\tbc += prime[i];\n\t\t\t\twhile (b%prime[i] == 0)b /= prime[i];\n\t\t\t\tif (b == 1)break;\n\t\t\t}\n\t\t\ti++;\n\t\t}\n\t\tbc -= bm; bm -= bc;\n\t\tif (am > bm)cout << \"a\\n\";\n\t\telse cout << \"b\\n\";\n\t}\n}","accuracy":1,"time_ms":150,"memory_kb":3652,"score_of_the_acc":-0.469,"final_rank":7},{"submission_id":"aoj_2048_2097391","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n\n#define NUM 1000500\n\nint main(){\n\tint* table = new int[NUM];\n\tint limit;\n\n\tfor(int i=0; i < NUM;i++)table[i] = 1;\n\ttable[0] = 0;\n\ttable[1] = 0;\n\n\tlimit = sqrt(NUM);\n\n\tfor(int i=2;i<=limit;i++){\n\t\tif(table[i] == 1){\n\t\t\tfor(int k=2*i;k < NUM; k += i){\n\t\t\t\ttable[k] = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tint a,b,index,array[1000],sum,a_key,b_key;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&a,&b);\n\t\tif(a == 0 && b == 0)break;\n\n\t\tlimit = a/2 + 100;\n\t\tindex = 0;\n\n\t\tif(a%2 == 0)array[index++] = 2;\n\t\twhile(a%2 == 0)a /= 2;\n\n\t\tfor(int i = 3; i <= limit; i += 2){\n\t\t\tif(table[i] == 1 && a%i == 0){\n\t\t\t\tarray[index++] = i;\n\t\t\t\twhile(a%i == 0){\n\t\t\t\t\ta /= i;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tsum = 0;\n\n\t\tif(index == 0 && table[a] == 1){\n\t\t\ta_key = a;\n\t\t}else{\n\n\t\t\tfor(int i = 0; i <= index-2; i++){\n\t\t\t\tsum += array[i];\n\t\t\t}\n\n\t\t\ta_key = array[index-1] - sum;\n\t\t}\n\n\n\t\tlimit = b/2 + 100;\n\t\tindex = 0;\n\n\t\tif(b%2 == 0)array[index++] = 2;\n\t\twhile(b%2 == 0)b /= 2;\n\n\t\tfor(int i = 3; i <= limit; i += 2){\n\t\t\tif(table[i] == 1 && b%i == 0){\n\t\t\t\tarray[index++] = i;\n\t\t\t\twhile(b%i == 0){\n\t\t\t\t\tb /= i;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tsum = 0;\n\n\t\tif(index == 0 && table[b] == 1){\n\t\t\tb_key = b;\n\t\t}else{\n\n\t\t\tfor(int i = 0; i <= index-2; i++){\n\t\t\t\tsum += array[i];\n\t\t\t}\n\n\t\t\tb_key = array[index-1] - sum;\n\t\t}\n\n\t\tif(a_key > b_key)printf(\"a\\n\");\n\t\telse{\n\t\t\tprintf(\"b\\n\");\n\t\t}\n\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":160,"memory_kb":6496,"score_of_the_acc":-1.08,"final_rank":16},{"submission_id":"aoj_2048_2097387","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n\n#define NUM 1000500\n\nint main(){\n\tint* table = new int[NUM];\n\tint limit;\n\n\tfor(int i=0; i < NUM;i++)table[i] = 1;\n\ttable[0] = 0;\n\ttable[1] = 0;\n\n\tlimit = sqrt(NUM);\n\n\tfor(int i=2;i<=limit;i++){\n\t\tif(table[i] == 1){\n\t\t\tfor(int k=2*i;k < NUM; k += i){\n\t\t\t\ttable[k] = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tint a,b,index,array[1000],sum,a_key,b_key;\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&a,&b);\n\t\tif(a == 0 && b == 0)break;\n\n\t\tlimit = a/2 + 100;\n\t\tindex = 0;\n\n\t\tfor(int i = 2; i <= limit; i++){\n\t\t\tif(table[i] == 1 && a%i == 0){\n\t\t\t\tarray[index++] = i;\n\t\t\t\twhile(a%i == 0){\n\t\t\t\t\ta /= i;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tsum = 0;\n\n\t\tif(index == 0 && table[a] == 1){\n\t\t\ta_key = a;\n\t\t}else{\n\n\t\t\tfor(int i = 0; i <= index-2; i++){\n\t\t\t\tsum += array[i];\n\t\t\t}\n\n\t\t\ta_key = array[index-1] - sum;\n\t\t}\n\n\n\t\tlimit = b/2 + 100;\n\t\tindex = 0;\n\n\t\tfor(int i = 2; i <= limit; i++){\n\t\t\tif(table[i] == 1 && b%i == 0){\n\t\t\t\tarray[index++] = i;\n\t\t\t\twhile(b%i == 0){\n\t\t\t\t\tb /= i;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tsum = 0;\n\n\t\tif(index == 0 && table[b] == 1){\n\t\t\tb_key = b;\n\t\t}else{\n\n\t\t\tfor(int i = 0; i <= index-2; i++){\n\t\t\t\tsum += array[i];\n\t\t\t}\n\n\t\t\tb_key = array[index-1] - sum;\n\t\t}\n\n\t\tif(a_key > b_key)printf(\"a\\n\");\n\t\telse{\n\t\t\tprintf(\"b\\n\");\n\t\t}\n\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":190,"memory_kb":6484,"score_of_the_acc":-1.1119,"final_rank":18},{"submission_id":"aoj_2048_2027319","code_snippet":"//============================================================================\n// Name : A.cpp\n// Author : \n// Version :\n// Copyright : Your copyright notice\n// Description : Hello World in C++, Ansi-style\n//============================================================================\n\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nbool is_prime(int a){\n\tfor (int i = 2; i * i <= a; ++i) {\n\t\tif(a % i == 0) return false;\n\t}\n\treturn true;\n}\n\nvector<int> ps;\n\nint f(int a){\n\tvector<ll> v;\n\tfor(int p : ps){\n\t\tif(a % p == 0) v.push_back(p);\n\t}\n\tif(v.size() == 0) return 0;\n\tll ret = v.back();\n\tfor(int i = 0; i < (int)v.size() - 1; i++){\n\t\tret -= v[i];\n\t}\n\treturn ret;\n}\n\nint main() {\n\tfor(int i = 2; i <= 2000000; i++){\n\t\tif(is_prime(i)) ps.push_back(i);\n\t}\n\n\tint n, m;\n\twhile(cin >> n >> m , n + m){\n\t\tif(f(n) > f(m)){\n\t\t\tcout << \"a\" << endl;\n\t\t}\n\t\telse{\n\t\t\tcout << \"b\" <<endl;\n\t\t}\n\t}\n}","accuracy":1,"time_ms":580,"memory_kb":3708,"score_of_the_acc":-0.975,"final_rank":12},{"submission_id":"aoj_2048_2023376","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n \nvector<int> sieve(int n) {\n vector<int> p(n);\n for(int i=2; i<n; i++) p[i]=i;\n for(int i=2; i*i<n; i++) {\n if(p[i]) {\n for(int j=i*i; j<n; j+=i) p[j]=0;\n }\n }\n p.erase(remove(p.begin(),p.end(),0),p.end());\n return p;\n}\n \nint main() {\n vector<int> p=sieve(1000000);\n int a[2];\n while(cin >> a[0] >> a[1]&&a[0]) {\n int b[2]={0,0};\n for(int j=0; j<2; j++) {\n int k=1;\n for(int i=p.size()-1; i>=0; i--) {\n if(a[j]%p[i]==0) {\n b[j]+=p[i]*k;\n k=-1;\n }\n }\n }\n if(b[0]>b[1]) cout << 'a' << endl;\n else cout << 'b' << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":6536,"score_of_the_acc":-1.0194,"final_rank":13},{"submission_id":"aoj_2048_2022873","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint get_sum(set<int> a){\n int sum=0;\n set<int>::iterator it;\n for(it=a.begin();it!=--a.end();it++)sum+=(*it);\n return sum;\n}\n\nint get_num(set<int> &a){\n int res=*(--a.end());\n return res;\n}\n\n\n\nint main(){\n\n while(1){\n int a,b;\n cin>>a>>b;\n if(!a&&!b)return 0;\n set<int> A,B;\n for(int i=2;a!=1;i++){\n if(a%i==0)A.insert(i);\n while(a%i==0)a/=i;\n }\n\n for(int i=2;b!=1;i++){\n if(b%i==0)B.insert(i);\n while(b%i==0)b/=i;\n }\n\n a=get_num(A)-get_sum(A);\n b=get_num(B)-get_sum(B);\n if(a>b) cout<<\"a\"<<endl;\n else cout<<\"b\"<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":300,"memory_kb":3080,"score_of_the_acc":-0.5208,"final_rank":9},{"submission_id":"aoj_2048_2022871","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nvector<int> sieve(int n) {\n vector<int> p(n);\n for(int i=2; i<n; i++) p[i]=i;\n for(int i=2; i*i<n; i++) {\n if(p[i]) {\n for(int j=i*i; j<n; j+=i) p[j]=0;\n }\n }\n p.erase(remove(p.begin(),p.end(),0),p.end());\n return p;\n}\n\nint main() {\n vector<int> p=sieve(1000000);\n int a[2];\n while(cin >> a[0] >> a[1]&&a[0]) {\n int b[2]={0,0};\n for(int j=0; j<2; j++) {\n int k=1;\n for(int i=p.size()-1; i>=0; i--) {\n if(a[j]%p[i]==0) {\n b[j]+=p[i]*k;\n k=-1;\n }\n }\n }\n if(b[0]>b[1]) cout << 'a' << endl;\n else cout << 'b' << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":6544,"score_of_the_acc":-1.0211,"final_rank":14},{"submission_id":"aoj_2048_1882410","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint func(int n)\n{\n int sum = 0, largest = 0;\n for (int i = 2; i <= n; i++) {\n if (n % i == 0) {\n sum += i;\n largest = i;\n while (n % i == 0) {\n n /= i;\n }\n }\n }\n sum -= largest;\n return largest - sum;\n}\n\nint main()\n{\n int a, b;\n while (cin >> a >> b, a) {\n if (func(a) > func(b)) {\n cout << 'a' << endl;\n } else {\n cout << 'b' << endl;\n }\n } \n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":3028,"score_of_the_acc":-0.3489,"final_rank":4},{"submission_id":"aoj_2048_1867478","code_snippet":"#include <iostream>\n#include <algorithm>\nusing namespace std;\nint a, b; bool prime[1111111];\nint main() {\n\tfill(prime + 2, prime + 1000001, true);\n\tfor (int i = 2; i <= 1000; i++) {\n\t\tif (!prime[i]) continue;\n\t\tfor (int j = i * i; j <= 1000000; j += i) prime[j] = false;\n\t}\n\twhile (cin >> a >> b, a | b) {\n\t\tint suma = 0, maxa = 0, sumb = 0, maxb = 0;\n\t\tfor (int i = 2; i <= a; i++) {\n\t\t\tif (prime[i] && a % i == 0) suma += i, maxa = i;\n\t\t}\n\t\tfor (int i = 2; i <= b; i++) {\n\t\t\tif (prime[i] && b % i == 0) sumb += i, maxb = i;\n\t\t}\n\t\tint reta = maxa * 2 - suma, retb = maxb * 2 - sumb;\n\t\tif (reta > retb) cout << \"a\" << endl;\n\t\telse cout << \"b\" << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":400,"memory_kb":4060,"score_of_the_acc":-0.8423,"final_rank":10},{"submission_id":"aoj_2048_1781132","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\nconst double PI=acos(-1);\nconst double EPS=1e-10;\nconst int inf=1e9;\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int,int> pii;\nint main(){\n\t#define MAX 1000010\n\tbool sosu[MAX]={0};\n\tfor(int i=4;i<MAX;i+=2)sosu[i]=1;\n\tfor(int i=3;i*i<=MAX;i+=2)if(!sosu[i])\n\tfor(int j=i*3;j<MAX;j+=i*2)sosu[j]=1;\n\t\n\tint a,b;\n\twhile(cin>>a>>b,a+b){\n\t\tint A=0,B=0;\n\t\tbool ha=true;\n\t\tfor(int i=a;i>1;i--)if(sosu[i]==0&&a%i==0){\n\t\t\tif(ha){\n\t\t\t\tA+=i;\n\t\t\t\tha=false;\n\t\t\t}else A-=i;\n\t\t}\n\t\tha=true;\n\t\tfor(int i=b;i>1;i--)if(sosu[i]==0&&b%i==0){\n\t\t\tif(ha){\n\t\t\t\tB+=i;\n\t\t\t\tha=false;\n\t\t\t}else B-=i;\n\t\t}\n\t\tif(A>B)cout<<'a'<<endl;\n\t\telse cout<<'b'<<endl;\t\t\n\t}\n}","accuracy":1,"time_ms":430,"memory_kb":2136,"score_of_the_acc":-0.4713,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_2048_4109877\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\nusing namespace std;\\ntypedef long long int ll;\\n\\nint key(int x){\\n\\tint s=0,m=0;\\n\\tfor(int i=2;i<=x;i++){\\n\\t\\tif(x%i==0){\\n\\t\\t\\ts+=i;\\n\\t\\t\\tm=i;\\n\\t\\t\\twhile(x%i==0){\\n\\t\\t\\t\\tx/=i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn m-(s-m);\\n}\\n \\nint main(){\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\twhile(1){\\n\\t\\tint a,b; cin >> a >> b;\\n\\t\\tif(a==0&&b==0)break;\\n\\t\\tcout << (key(a)>key(b)?'a':'b') << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3032,\n \"score_of_the_acc\": -0.3498,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2048_3396011\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\nusing namespace std;\\n\\nint main(){\\n vector<bool> nonp(1000001, 0);\\n for(int i = 2; i < 1000001; i++){\\n if(nonp[i]) continue;\\n for(int j = i+i; j < 1000001; j += i) nonp[j] = true;\\n }\\n int a, b;\\n while(cin >> a >> b, a+b){\\n int x = 1<<30, y = 1<<30;\\n for(int i = a; i >= 2; i--){\\n if(a%i == 0 && !nonp[i]){\\n if(x == 1<<30) x = i;\\n else x -= i;\\n }\\n }\\n for(int i = b; i >= 2; i--){\\n if(b%i == 0 && !nonp[i]){\\n if(y == 1<<30) y = i;\\n else y -= i;\\n }\\n }\\n cout << (x > y ? \\\"a\\\" : \\\"b\\\") << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 890,\n \"memory_kb\": 3140,\n \"score_of_the_acc\": -1.2116,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2048_3089737\",\n \"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\\nbool p[1100000] = {};\\n\\nint main(){\\n\\t\\n\\tint N = 1000000;\\n\\t\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tp[i] = true;\\n\\t}\\n\\t\\n\\tp[0] = false;\\n\\tp[1] = false;\\n\\t\\n\\tfor(int i = 2; i < N; i++){\\n\\t\\tif(p[i]){\\n\\t\\t\\tfor(int j = i * 2; j < N; j += i){\\n\\t\\t\\t\\tp[j] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\twhile(true){\\n\\t\\tint a, b;\\n\\t\\tcin >> a >> b;\\n\\t\\tif(a == 0){\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tint Sa, Sb;\\n\\t\\tint pmax = 0;\\n\\t\\tint S = 0;\\n\\t\\tfor(int i = 1; i <= a; i++){\\n\\t\\t\\tif(a % i == 0 && p[i]){\\n\\t\\t\\t\\tS += i;\\n\\t\\t\\t\\tpmax = i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tSa = pmax * 2 - S;\\n\\t\\t\\n\\t\\tS = 0;\\n\\t\\tfor(int i = 1; i <= b; i++){\\n\\t\\t\\tif(b % i == 0 && p[i]){\\n\\t\\t\\t\\tS += i;\\n\\t\\t\\t\\tpmax = i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tSb = pmax * 2 - S;\\n\\t\\tif(Sa > Sb){\\n\\t\\t\\tcout << \\\"a\\\" << endl;\\n\\t\\t}else{\\n\\t\\t\\tcout << \\\"b\\\" << endl;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 810,\n \"memory_kb\": 4036,\n \"score_of_the_acc\": -1.3086,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2048_2854456\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = double;\\nconst ld eps = 1e-9;\\n\\nint adiv(int a) {\\n\\tmap<int,int>mp;\\n\\tint num(a);\\n\\tfor (int i = 2; i <= a; ++i) {\\n\\t\\twhile (num%i == 0) {\\n\\t\\t\\tmp[i]++;\\n\\t\\t\\tnum/=i;\\n\\t\\t}\\n\\t}\\n\\tint anum=0;\\n\\tfor (auto m : mp) {\\n\\t\\tanum-=m.first;\\n\\t}\\n\\tanum+=2*prev(mp.end())->first;\\n\\treturn anum;\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\n\\t\\tint A, B; cin >> A >> B;\\n\\t\\tif(!A)break;\\n\\t\\tA = adiv(A);\\n\\t\\tB = adiv(B);\\n\\t\\tif (A>B)cout << \\\"a\\\" << endl;\\n\\t\\telse cout << \\\"b\\\" << endl;\\n\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 810,\n \"memory_kb\": 2992,\n \"score_of_the_acc\": -1.0885,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2048_2630167\",\n \"code_snippet\": \"#include <iostream>\\n#include <stdlib.h>\\n#include <math.h>\\n\\nusing namespace std;\\n\\n/* ?????°?????´??°x??\\\\????????¨???????´???°???????????¢??° */\\n/* ?????????????´???°????????°????????°???????????????????´???°???????´???????. */\\nint era (int x, int *array)\\n{\\n\\tint search[x];\\n\\tint len = 0;\\n\\tsearch[0] = search[1] = 0;\\n\\tfor (int i = 2; i < x; i++)\\n\\t\\tsearch[i] = 1;\\n\\tdouble root_x = sqrt(x);\\n\\tfor (int i = 0; ; i++) {\\n\\t\\tint num = search[i];\\n\\t\\tif (num == 1) {\\n\\t\\t\\tif (root_x <= i)\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\telse {\\n\\t\\t\\t\\tarray[len++] = i;\\n\\t\\t\\t\\tfor (int j = i; j < x; j+=i)\\n\\t\\t\\t\\t\\tsearch[j] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < x; i++) {\\n\\t\\tif (search[i] == 1) {\\n\\t\\t\\tarray[len++] = i;\\n\\t\\t\\tsearch[i] = 0;\\n\\t\\t}\\n\\t}\\n\\treturn len;\\n}\\n\\n/* ?????°????´??????°????±?????????¢??° */\\nint p_list(int a, int *list, int *primes, int len)\\n{\\n\\tint a_len = 0;\\n\\tint i = 0;\\n\\twhile (primes[i] <= a) \\n\\t{\\n\\t\\tif (a % primes[i] == 0)\\n\\t\\t\\tlist[a_len++] = primes[i];\\n\\t\\ti++;\\n\\t\\tif (len <= i)\\n\\t\\t\\tbreak;\\n\\t}\\n\\treturn a_len++;\\n}\\n\\nint key(int *list, int len)\\n{\\n\\tint sum = 0;\\n\\tif (len == 1)\\n\\t\\treturn list[0];\\n\\tfor (int i = 0; i < len - 1; i++) \\n\\t\\tsum += list[i];\\n\\treturn list[len-1] - sum;\\n\\n\\n}\\n\\nint main (void)\\n{\\n\\tint *primes;\\n\\tint len;\\n\\tprimes = (int *)malloc(sizeof(int) * 1000000);\\n\\tlen = era(1000000, primes);\\t\\n\\twhile (1) {\\n\\t\\tint a, b;\\n\\t\\tcin >> a >> b;\\n\\t\\tif (a == 0 && b == 0)\\n\\t\\t\\tbreak;\\n\\t\\tint a_pri[a/2], b_pri[b/2];\\n\\t\\tint a_len, b_len;\\n\\t\\ta_len = p_list(a, a_pri, primes, len);\\n\\t\\tb_len = p_list(b, b_pri, primes, len);\\n#ifdef DEBUG\\n\\t\\tcout << a_len << \\\" \\\" << b_len << endl;\\n\\t\\tfor (int i = 0; i < a_len; i++)\\n\\t\\t\\tcout << a_pri[i] << endl;\\n\\t\\tfor (int i = 0; i < b_len; i++)\\n\\t\\t\\tcout << b_pri[i] << endl;\\n#endif\\n\\t\\tint a_key, b_key;\\n\\t\\ta_key = key(a_pri, a_len);\\n\\t\\tb_key = key(b_pri, b_len);\\n#ifdef DEBUG\\n\\t\\tcout << \\\"a \\\" << a_key << endl;\\n\\t\\tcout << \\\"b \\\" << b_key << endl;\\n#endif\\n\\t\\tif (a_key > b_key)\\n\\t\\t\\tcout << \\\"a\\\" << endl;\\n\\t\\telse\\n\\t\\t\\tcout << \\\"b\\\" << endl;\\n\\t}\\n\\tfree(primes);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 6880,\n \"score_of_the_acc\": -1.069,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2048_2601674\",\n \"code_snippet\": \"#include <iostream>\\n\\nusing namespace std;\\n\\nint main(void){\\n bool isPrime[1000001];\\n\\n for(int i = 0 ; i <= 1000000 ; i++){\\n isPrime[i] = true;\\n }\\n\\n isPrime[0] = false;\\n isPrime[1] = false;\\n for(int n = 2 ; n <= 1000000 ; n++){\\n if(isPrime[n]){\\n for(int m = n ; m <= 1000000 ; m += n){\\n isPrime[m] = false;\\n }\\n isPrime[n] = true;\\n }\\n }\\n\\n while(1){\\n int a , b;\\n cin >> a;\\n cin >> b;\\n\\n if(a == 0 && b == 0){\\n return 0;\\n }\\n\\n int akey = 0;\\n int afactmax;\\n for(int i = 2 ; i <= a ; i++){\\n if(isPrime[i] && a % i == 0){\\n akey += i;\\n afactmax = i;\\n }\\n }\\n akey = 2 * afactmax - akey;\\n\\n int bkey = 0;\\n int bfactmax;\\n for(int i = 2 ; i <= b ; i++){\\n if(isPrime[i] && b % i == 0){\\n bkey += i;\\n bfactmax = i;\\n }\\n }\\n bkey = 2 * bfactmax - bkey;\\n\\n if(akey > bkey){\\n cout << \\\"a\\\" << endl;\\n }else{\\n cout << \\\"b\\\" << endl;\\n }\\n\\n\\n\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 4052,\n \"score_of_the_acc\": -0.9096,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2048_2601650\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <iostream>\\n#include <numeric>\\n#include <vector>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n const auto primes = [] {\\n bitset<1000000 + 1> b;\\n auto t = b;\\n t.set();\\n t[0] = false;\\n t[1] = false;\\n int i = 0;\\n while (true) {\\n bool done = false;\\n while (!t[i]) {\\n ++i;\\n if (i == t.size()) {\\n done = true;\\n break;\\n }\\n }\\n if (done) {\\n break;\\n }\\n\\n b[i] = true;\\n for (int j = i; j < t.size(); j += i) {\\n t[j] = false;\\n }\\n }\\n return b;\\n }();\\n\\n while (true) {\\n int a, b;\\n cin >> a >> b;\\n if (a == 0 && b == 0) {\\n return 0;\\n }\\n\\n auto f = [&primes](int x) {\\n vector<int> r;\\n int j = 2;\\n while (true) {\\n while (!primes[j]) {\\n ++j;\\n }\\n if (x == 1) {\\n break;\\n }\\n if (x % j == 0) {\\n r.push_back(j);\\n x /= j;\\n }\\n else {\\n j += 1;\\n }\\n }\\n r.erase(unique(begin(r), end(r)), end(r));\\n return r;\\n };\\n\\n auto pa = f(a);\\n auto pb = f(b);\\n\\n auto g = [](const vector<int>& v) {\\n auto s = accumulate(begin(v), --end(v), 0);\\n return v.back() - s;\\n };\\n\\n if (g(pa) > g(pb)) {\\n cout << \\\"a\\\" << endl;\\n }\\n else {\\n cout << \\\"b\\\" << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -0.3454,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2048_2601640\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <iostream>\\n#include <numeric>\\n#include <vector>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n bitset<1000100 + 1> b;\\n auto t = b;\\n t.set();\\n t[0] = false;\\n t[1] = false;\\n int i = 0;\\n while (true) {\\n bool done = false;\\n while (!t[i]) {\\n ++i;\\n if (i == t.size()) {\\n done = true;\\n break;\\n }\\n }\\n if (done) {\\n break;\\n }\\n\\n b[i] = true;\\n for (int j = i; j < t.size(); j += i) {\\n t[j] = false;\\n }\\n }\\n\\n while (true) {\\n int a, bb;\\n cin >> a >> bb;\\n int aa = a;\\n int bbb = bb;\\n if (a == 0 && bb == 0) {\\n return 0;\\n }\\n\\n vector<int> pa;\\n int j = 2;\\n while (true) {\\n while (!b[j]) {\\n ++j;\\n }\\n if (a == 1) {\\n break;\\n }\\n if (a % j == 0) {\\n pa.push_back(j);\\n a /= j;\\n }\\n else {\\n j += 1;\\n }\\n }\\n vector<int> pb;\\n j = 2;\\n while (true) {\\n while (!b[j]) {\\n ++j;\\n }\\n if (bb == 1) {\\n break;\\n }\\n if (bb % j == 0) {\\n pb.push_back(j);\\n bb /= j;\\n }\\n else {\\n j += 1;\\n }\\n }\\n pa.erase(unique(begin(pa), end(pa)), end(pa));\\n pb.erase(unique(begin(pb), end(pb)), end(pb));\\n\\n auto f = [](const vector<int>& v) {\\n auto s = accumulate(begin(v), --end(v), 0);\\n return v.back() - s;\\n };\\n if (f(pa) > f(pb)) {\\n cout << \\\"a\\\" << endl;\\n }\\n else {\\n cout << \\\"b\\\" << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3248,\n \"score_of_the_acc\": -0.3378,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2048_2601585\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <queue>\\nusing namespace std;\\nconst int N = 1000000;\\nint main(int argc, char *argv[])\\n{\\n vector<bool> primes(N + 1,true);\\n primes[0] = false;\\n primes[1] = false;\\n for(int i = 0; i <= N; i++) {\\n if(primes[i]) {\\n for(int j = i+i; j <= N; j+=i) {\\n primes[j] = false;\\n }\\n }\\n }\\n vector<int> ps;\\n for(int i = 0; i <= N; i++) {\\n if(primes[i]) ps.push_back(i);\\n }\\n for(;;) {\\n int a, b;\\n cin >> a >> b;\\n if(a == 0 && b == 0) break;\\n auto key = [&ps](int n) {\\n int p = 0;\\n int s = 0;\\n for(int i = 0; i < ps.size() && n >= ps[i]; i++) {\\n if((n % ps[i]) == 0) {\\n s += ps[i];\\n p = ps[i];\\n }\\n }\\n return p*2 - s;\\n };\\n int ka = key(a);\\n int kb = key(b);\\n cout << (ka > kb ? \\\"a\\\" : \\\"b\\\") << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -0.318,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2048_2522997\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nbool e[1000005];\\nint a,b,c,d;\\nvector<int>s;\\nmain(){\\n for(int i=2;i<1000005;i++)\\n if(!e[i])for(int j=i+i;j<1000005;j+=i)e[j]=1;\\n for(int i=2;i<1000005;i++)\\n if(!e[i])s.push_back(i);\\n while(cin>>a>>b,a||b){\\n c=d=0;\\n for(int i=0;i<s.size()&&s[i]<=a;i++){\\n int f1=0;\\n while(a%s[i]==0)a/=s[i],f1++;\\n if(f1)c-=s[i];\\n if(a==1){\\n c+=s[i]*2;\\n break;\\n }\\n }\\n for(int i=0;i<s.size()&&s[i]<=b;i++){\\n int f1=0;\\n while(b%s[i]==0)b/=s[i],f1++;\\n if(f1)d-=s[i];\\n if(b==1){\\n d+=s[i]*2;\\n break;\\n }\\n }\\n if(c>d)cout<<\\\"a\\\"<<endl;\\n else cout<<\\\"b\\\"<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4144,\n \"score_of_the_acc\": -0.4233,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2048_2441433\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<cmath>\\nusing namespace std; \\ntypedef long long ll;\\nll prime[1000001];\\nll length = 0;\\nvoid insert(ll p) { prime[length] = p; length++; return; }\\nint main() {\\n\\tinsert(2);\\n\\tfor (ll i = 3; i < 1000000; i += 2) {\\n\\t\\tfor (ll j = 0; j < length; j++)\\n\\t\\t\\tif (i%prime[j] == 0)goto cont;\\n\\t\\t\\telse if (prime[j] > sqrt(i))break;\\n\\t\\t\\tinsert(i);\\n\\t\\tcont:;\\n\\t}\\n\\tll a, b;\\n\\twhile (cin >> a >> b){\\n\\t\\tif (!a && !b)return 0;\\n\\t\\tll am, bm, ac = 0, bc = 0;\\n\\t\\tint i = 0;\\n\\t\\twhile (prime[i] <= a){\\n\\t\\t\\tif (a%prime[i] == 0) {\\n\\t\\t\\t\\tam = prime[i];\\n\\t\\t\\t\\tac += prime[i];\\n\\t\\t\\t\\twhile (a%prime[i] == 0)a /= prime[i];\\n\\t\\t\\t\\tif (a == 1)break;\\n\\t\\t\\t}\\n\\t\\t\\ti++;\\n\\t\\t}\\n\\t\\tac -= am; am -= ac;\\n\\t\\ti = 0;\\n\\t\\twhile (prime[i] <= b) {\\n\\t\\t\\tif (b%prime[i] == 0) {\\n\\t\\t\\t\\tbm = prime[i];\\n\\t\\t\\t\\tbc += prime[i];\\n\\t\\t\\t\\twhile (b%prime[i] == 0)b /= prime[i];\\n\\t\\t\\t\\tif (b == 1)break;\\n\\t\\t\\t}\\n\\t\\t\\ti++;\\n\\t\\t}\\n\\t\\tbc -= bm; bm -= bc;\\n\\t\\tif (am > bm)cout << \\\"a\\\\n\\\";\\n\\t\\telse cout << \\\"b\\\\n\\\";\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3652,\n \"score_of_the_acc\": -0.469,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2048_2097391\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n\\n#define NUM 1000500\\n\\nint main(){\\n\\tint* table = new int[NUM];\\n\\tint limit;\\n\\n\\tfor(int i=0; i < NUM;i++)table[i] = 1;\\n\\ttable[0] = 0;\\n\\ttable[1] = 0;\\n\\n\\tlimit = sqrt(NUM);\\n\\n\\tfor(int i=2;i<=limit;i++){\\n\\t\\tif(table[i] == 1){\\n\\t\\t\\tfor(int k=2*i;k < NUM; k += i){\\n\\t\\t\\t\\ttable[k] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint a,b,index,array[1000],sum,a_key,b_key;\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d\\\",&a,&b);\\n\\t\\tif(a == 0 && b == 0)break;\\n\\n\\t\\tlimit = a/2 + 100;\\n\\t\\tindex = 0;\\n\\n\\t\\tif(a%2 == 0)array[index++] = 2;\\n\\t\\twhile(a%2 == 0)a /= 2;\\n\\n\\t\\tfor(int i = 3; i <= limit; i += 2){\\n\\t\\t\\tif(table[i] == 1 && a%i == 0){\\n\\t\\t\\t\\tarray[index++] = i;\\n\\t\\t\\t\\twhile(a%i == 0){\\n\\t\\t\\t\\t\\ta /= i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tsum = 0;\\n\\n\\t\\tif(index == 0 && table[a] == 1){\\n\\t\\t\\ta_key = a;\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i <= index-2; i++){\\n\\t\\t\\t\\tsum += array[i];\\n\\t\\t\\t}\\n\\n\\t\\t\\ta_key = array[index-1] - sum;\\n\\t\\t}\\n\\n\\n\\t\\tlimit = b/2 + 100;\\n\\t\\tindex = 0;\\n\\n\\t\\tif(b%2 == 0)array[index++] = 2;\\n\\t\\twhile(b%2 == 0)b /= 2;\\n\\n\\t\\tfor(int i = 3; i <= limit; i += 2){\\n\\t\\t\\tif(table[i] == 1 && b%i == 0){\\n\\t\\t\\t\\tarray[index++] = i;\\n\\t\\t\\t\\twhile(b%i == 0){\\n\\t\\t\\t\\t\\tb /= i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tsum = 0;\\n\\n\\t\\tif(index == 0 && table[b] == 1){\\n\\t\\t\\tb_key = b;\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i <= index-2; i++){\\n\\t\\t\\t\\tsum += array[i];\\n\\t\\t\\t}\\n\\n\\t\\t\\tb_key = array[index-1] - sum;\\n\\t\\t}\\n\\n\\t\\tif(a_key > b_key)printf(\\\"a\\\\n\\\");\\n\\t\\telse{\\n\\t\\t\\tprintf(\\\"b\\\\n\\\");\\n\\t\\t}\\n\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 6496,\n \"score_of_the_acc\": -1.08,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2048_2097387\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n\\n#define NUM 1000500\\n\\nint main(){\\n\\tint* table = new int[NUM];\\n\\tint limit;\\n\\n\\tfor(int i=0; i < NUM;i++)table[i] = 1;\\n\\ttable[0] = 0;\\n\\ttable[1] = 0;\\n\\n\\tlimit = sqrt(NUM);\\n\\n\\tfor(int i=2;i<=limit;i++){\\n\\t\\tif(table[i] == 1){\\n\\t\\t\\tfor(int k=2*i;k < NUM; k += i){\\n\\t\\t\\t\\ttable[k] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint a,b,index,array[1000],sum,a_key,b_key;\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d\\\",&a,&b);\\n\\t\\tif(a == 0 && b == 0)break;\\n\\n\\t\\tlimit = a/2 + 100;\\n\\t\\tindex = 0;\\n\\n\\t\\tfor(int i = 2; i <= limit; i++){\\n\\t\\t\\tif(table[i] == 1 && a%i == 0){\\n\\t\\t\\t\\tarray[index++] = i;\\n\\t\\t\\t\\twhile(a%i == 0){\\n\\t\\t\\t\\t\\ta /= i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tsum = 0;\\n\\n\\t\\tif(index == 0 && table[a] == 1){\\n\\t\\t\\ta_key = a;\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i <= index-2; i++){\\n\\t\\t\\t\\tsum += array[i];\\n\\t\\t\\t}\\n\\n\\t\\t\\ta_key = array[index-1] - sum;\\n\\t\\t}\\n\\n\\n\\t\\tlimit = b/2 + 100;\\n\\t\\tindex = 0;\\n\\n\\t\\tfor(int i = 2; i <= limit; i++){\\n\\t\\t\\tif(table[i] == 1 && b%i == 0){\\n\\t\\t\\t\\tarray[index++] = i;\\n\\t\\t\\t\\twhile(b%i == 0){\\n\\t\\t\\t\\t\\tb /= i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tsum = 0;\\n\\n\\t\\tif(index == 0 && table[b] == 1){\\n\\t\\t\\tb_key = b;\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i <= index-2; i++){\\n\\t\\t\\t\\tsum += array[i];\\n\\t\\t\\t}\\n\\n\\t\\t\\tb_key = array[index-1] - sum;\\n\\t\\t}\\n\\n\\t\\tif(a_key > b_key)printf(\\\"a\\\\n\\\");\\n\\t\\telse{\\n\\t\\t\\tprintf(\\\"b\\\\n\\\");\\n\\t\\t}\\n\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 6484,\n \"score_of_the_acc\": -1.1119,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2048_2027319\",\n \"code_snippet\": \"//============================================================================\\n// Name : A.cpp\\n// Author : \\n// Version :\\n// Copyright : Your copyright notice\\n// Description : Hello World in C++, Ansi-style\\n//============================================================================\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\nbool is_prime(int a){\\n\\tfor (int i = 2; i * i <= a; ++i) {\\n\\t\\tif(a % i == 0) return false;\\n\\t}\\n\\treturn true;\\n}\\n\\nvector<int> ps;\\n\\nint f(int a){\\n\\tvector<ll> v;\\n\\tfor(int p : ps){\\n\\t\\tif(a % p == 0) v.push_back(p);\\n\\t}\\n\\tif(v.size() == 0) return 0;\\n\\tll ret = v.back();\\n\\tfor(int i = 0; i < (int)v.size() - 1; i++){\\n\\t\\tret -= v[i];\\n\\t}\\n\\treturn ret;\\n}\\n\\nint main() {\\n\\tfor(int i = 2; i <= 2000000; i++){\\n\\t\\tif(is_prime(i)) ps.push_back(i);\\n\\t}\\n\\n\\tint n, m;\\n\\twhile(cin >> n >> m , n + m){\\n\\t\\tif(f(n) > f(m)){\\n\\t\\t\\tcout << \\\"a\\\" << endl;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tcout << \\\"b\\\" <<endl;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 580,\n \"memory_kb\": 3708,\n \"score_of_the_acc\": -0.975,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2048_2023376\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n \\nvector<int> sieve(int n) {\\n vector<int> p(n);\\n for(int i=2; i<n; i++) p[i]=i;\\n for(int i=2; i*i<n; i++) {\\n if(p[i]) {\\n for(int j=i*i; j<n; j+=i) p[j]=0;\\n }\\n }\\n p.erase(remove(p.begin(),p.end(),0),p.end());\\n return p;\\n}\\n \\nint main() {\\n vector<int> p=sieve(1000000);\\n int a[2];\\n while(cin >> a[0] >> a[1]&&a[0]) {\\n int b[2]={0,0};\\n for(int j=0; j<2; j++) {\\n int k=1;\\n for(int i=p.size()-1; i>=0; i--) {\\n if(a[j]%p[i]==0) {\\n b[j]+=p[i]*k;\\n k=-1;\\n }\\n }\\n }\\n if(b[0]>b[1]) cout << 'a' << endl;\\n else cout << 'b' << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 6536,\n \"score_of_the_acc\": -1.0194,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2048_2022873\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint get_sum(set<int> a){\\n int sum=0;\\n set<int>::iterator it;\\n for(it=a.begin();it!=--a.end();it++)sum+=(*it);\\n return sum;\\n}\\n\\nint get_num(set<int> &a){\\n int res=*(--a.end());\\n return res;\\n}\\n\\n\\n\\nint main(){\\n\\n while(1){\\n int a,b;\\n cin>>a>>b;\\n if(!a&&!b)return 0;\\n set<int> A,B;\\n for(int i=2;a!=1;i++){\\n if(a%i==0)A.insert(i);\\n while(a%i==0)a/=i;\\n }\\n\\n for(int i=2;b!=1;i++){\\n if(b%i==0)B.insert(i);\\n while(b%i==0)b/=i;\\n }\\n\\n a=get_num(A)-get_sum(A);\\n b=get_num(B)-get_sum(B);\\n if(a>b) cout<<\\\"a\\\"<<endl;\\n else cout<<\\\"b\\\"<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 3080,\n \"score_of_the_acc\": -0.5208,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2048_2022871\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nvector<int> sieve(int n) {\\n vector<int> p(n);\\n for(int i=2; i<n; i++) p[i]=i;\\n for(int i=2; i*i<n; i++) {\\n if(p[i]) {\\n for(int j=i*i; j<n; j+=i) p[j]=0;\\n }\\n }\\n p.erase(remove(p.begin(),p.end(),0),p.end());\\n return p;\\n}\\n\\nint main() {\\n vector<int> p=sieve(1000000);\\n int a[2];\\n while(cin >> a[0] >> a[1]&&a[0]) {\\n int b[2]={0,0};\\n for(int j=0; j<2; j++) {\\n int k=1;\\n for(int i=p.size()-1; i>=0; i--) {\\n if(a[j]%p[i]==0) {\\n b[j]+=p[i]*k;\\n k=-1;\\n }\\n }\\n }\\n if(b[0]>b[1]) cout << 'a' << endl;\\n else cout << 'b' << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 6544,\n \"score_of_the_acc\": -1.0211,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2048_1882410\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint func(int n)\\n{\\n int sum = 0, largest = 0;\\n for (int i = 2; i <= n; i++) {\\n if (n % i == 0) {\\n sum += i;\\n largest = i;\\n while (n % i == 0) {\\n n /= i;\\n }\\n }\\n }\\n sum -= largest;\\n return largest - sum;\\n}\\n\\nint main()\\n{\\n int a, b;\\n while (cin >> a >> b, a) {\\n if (func(a) > func(b)) {\\n cout << 'a' << endl;\\n } else {\\n cout << 'b' << endl;\\n }\\n } \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3028,\n \"score_of_the_acc\": -0.3489,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2048_1867478\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nint a, b; bool prime[1111111];\\nint main() {\\n\\tfill(prime + 2, prime + 1000001, true);\\n\\tfor (int i = 2; i <= 1000; i++) {\\n\\t\\tif (!prime[i]) continue;\\n\\t\\tfor (int j = i * i; j <= 1000000; j += i) prime[j] = false;\\n\\t}\\n\\twhile (cin >> a >> b, a | b) {\\n\\t\\tint suma = 0, maxa = 0, sumb = 0, maxb = 0;\\n\\t\\tfor (int i = 2; i <= a; i++) {\\n\\t\\t\\tif (prime[i] && a % i == 0) suma += i, maxa = i;\\n\\t\\t}\\n\\t\\tfor (int i = 2; i <= b; i++) {\\n\\t\\t\\tif (prime[i] && b % i == 0) sumb += i, maxb = i;\\n\\t\\t}\\n\\t\\tint reta = maxa * 2 - suma, retb = maxb * 2 - sumb;\\n\\t\\tif (reta > retb) cout << \\\"a\\\" << endl;\\n\\t\\telse cout << \\\"b\\\" << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 4060,\n \"score_of_the_acc\": -0.8423,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2048_1781132\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<cstdio>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\nconst double PI=acos(-1);\\nconst double EPS=1e-10;\\nconst int inf=1e9;\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int,int> pii;\\nint main(){\\n\\t#define MAX 1000010\\n\\tbool sosu[MAX]={0};\\n\\tfor(int i=4;i<MAX;i+=2)sosu[i]=1;\\n\\tfor(int i=3;i*i<=MAX;i+=2)if(!sosu[i])\\n\\tfor(int j=i*3;j<MAX;j+=i*2)sosu[j]=1;\\n\\t\\n\\tint a,b;\\n\\twhile(cin>>a>>b,a+b){\\n\\t\\tint A=0,B=0;\\n\\t\\tbool ha=true;\\n\\t\\tfor(int i=a;i>1;i--)if(sosu[i]==0&&a%i==0){\\n\\t\\t\\tif(ha){\\n\\t\\t\\t\\tA+=i;\\n\\t\\t\\t\\tha=false;\\n\\t\\t\\t}else A-=i;\\n\\t\\t}\\n\\t\\tha=true;\\n\\t\\tfor(int i=b;i>1;i--)if(sosu[i]==0&&b%i==0){\\n\\t\\t\\tif(ha){\\n\\t\\t\\t\\tB+=i;\\n\\t\\t\\t\\tha=false;\\n\\t\\t\\t}else B-=i;\\n\\t\\t}\\n\\t\\tif(A>B)cout<<'a'<<endl;\\n\\t\\telse cout<<'b'<<endl;\\t\\t\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 430,\n \"memory_kb\": 2136,\n \"score_of_the_acc\": -0.4713,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":1078,"cells":{"group_id":{"kind":"string","value":"aoj_2045_cpp"},"problem_description":{"kind":"string","value":"Problem G:\nTurn Polygons\nHCII, the health committee for interstellar intelligence, aims to take care of the health of every\ninterstellar intelligence.\nStaff of HCII uses a special equipment for health checks of patients. This equipment looks like a\npolygon-shaped room with plenty of instruments. The staff puts a patient into the equipment,\nthen the equipment rotates clockwise to diagnose the patient from various angles. It fits many\nspecies without considering the variety of shapes, but not suitable for big patients. Furthermore,\neven if it fits the patient, it can hit the patient during rotation.\nFigure 1: The Equipment used by HCII\nThe interior shape of the equipment is a polygon with\nM\nvertices, and the shape of patients\nis a\nconvex\npolygon with\nN\nvertices. Your job is to calculate how much you can rotate the\nequipment clockwise without touching the patient, and output the angle in degrees.\nInput\nThe input consists of multiple data sets, followed by a line containing “0 0”. Each data set is\ngiven as follows:\nM N\npx\n1\npy\n1\npx\n2\npy\n2\n...\npx\nM\npy\nM\nqx\n1\nqy\n1\nqx\n2\nqy\n2\n...\nqx\nN\nqy\nN\ncx cy\nThe first line contains two integers\nM\nand\nN\n(3 ≤\nM, N\n≤ 10). The second line contains 2\nM\nintegers, where (\npx\nj\n,\npy\nj\n) are the coordinates of the\nj\n-th vertex of the equipment. The third\nline contains 2\nN\nintegers, where (\nqx\nj\n,\nqy\nj\n) are the coordinates of the\nj\n-th vertex of the patient.\nThe fourth line contains two integers\ncx\nand\ncy\n, which indicate the coordinates of the center of\nrotation.\nAll the coordinates are between -1000 and 1000, inclusive. The vertices of each polygon are\ngiven in counterclockwise order.\nAt the initial state, the patient is inside the equipment, and they don’t intersect each other.\nYou may assume that the equipment doesn’t approach patients closer than 10\n-6\nwithout hitting\npatients, and that the equipment gets the patient to stick out by the length greater than 10\n-6\nwhenever the equipment keeps its rotation after hitting the patient.\nOutput\nFor each data set, print the angle in degrees in a line. Each angle should be given as a decimal\nwith an arbitrary number of fractional digits, and with an absolute error of at most 10\n-7\n.\nIf the equipment never hit the patient during the rotation, print 360 as the angle.\nSample Input\n5 4\n0 0 20 0 20 10 0 10 1 5\n10 3 12 5 10 7 8 5\n10 5\n4 3\n0 0 10 0 10 5 0 5\n3 1 6 1 5 4\n0 0\n5 3\n0 0 10 0 10 10 0 10 3 5\n1 1 4 1 4 6\n0 0\n0 0\nOutput for the Sample Input\n360.0000000\n12.6803835\n3.3722867"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2045_5499629","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n//#define EPS 0.000000001\nusing namespace std;\n\n\n#define EPS 0.000000001\n#define SIZE 15\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\n\t\tif(fabs(x-p.x) > EPS){\n\n\t\t\treturn x < p.x;\n\t\t}else{\n\n\t\t\treturn y < p.y;\n\t\t}\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\n\tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\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 M,N;\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\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\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_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//線分ではなく直線と点の距離\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\nbool Cross_Check(Line A,Line B){\n\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn true;\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn true;\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn true;\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn true;\n\t}\n\n\treturn is_Cross(A,B);\n}\n\n\nbool is_Cross(Polygon a, Polygon b){\n\n\tfor(int i = 0; i < a.size(); i++){\n\n\t\tLine base_line = Line(a[i],a[(i+1)%a.size()]);\n\n\t\tfor(int k = 0; k < b.size(); k++){\n\n\t\t\tLine work_line = Line(b[k],b[(k+1)%b.size()]);\n\t\t\tif(getDistanceSP(work_line,a[i]) < EPS)return true;\n\n\t\t\tif(is_Cross(base_line,work_line)){\n\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn false;\n}\n\n\nvoid func(){\n\n\tPolygon BOX,poly;\n\n\tdouble x,y;\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tscanf(\"%lf %lf\",&x,&y);\n\t\tBOX.push_back(Point(x,y));\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&x,&y);\n\t\tpoly.push_back(Point(x,y));\n\t}\n\n\tPoint base;\n\tscanf(\"%lf %lf\",&base.x,&base.y);\n\n\tint NUM = 10000;\n\n\tdouble diff = 2*M_PI/NUM;\n\tdouble roll_rad = 0;\n\tdouble last = -1;\n\n\tfor(int i = 0; i < NUM; i++){\n\n\t\tPolygon tmp_B;\n\t\tfor(int k = 0; k < BOX.size(); k++){\n\n\t\t\tPoint tmp_p = rotate(base,BOX[k],-roll_rad);\n\t\t\ttmp_B.push_back(tmp_p);\n\t\t}\n\n\t\tif(is_Cross(poly,tmp_B)){\n\t\t\tlast = roll_rad;\n\t\t\tbreak;\n\t\t}\n\n\t\troll_rad += diff;\n\t}\n\n\tif(fabs(last+1.0) < EPS){\n\n\t\tprintf(\"360.0000000000000\\n\");\n\t\treturn;\n\t}\n\n\tdouble left = last-diff,right = last,mid = (left+right)/2;\n\tdouble ans = right;\n\n\tfor(int loop = 0; loop < 100; loop++){\n\n\t\tPolygon tmp_B;\n\t\tfor(int k = 0; k < BOX.size(); k++){\n\n\t\t\tPoint tmp_p = rotate(base,BOX[k],-mid);\n\t\t\ttmp_B.push_back(tmp_p);\n\t\t}\n\t\tif(is_Cross(poly,tmp_B)){\n\n\t\t\tans = mid;\n\t\t\tright = mid-EPS;\n\t\t}else{\n\n\t\t\tleft = mid+EPS;\n\t\t}\n\t\tmid = (left+right)/2;\n\t}\n\n\tprintf(\"%.12lf\\n\",ans*(180/M_PI));\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d %d\",&M,&N);\n\t\tif(M == 0 && N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":3190,"memory_kb":3616,"score_of_the_acc":-2,"final_rank":18},{"submission_id":"aoj_2045_3106374","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 L : array<P, 2>{\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\n L(){}\n};\nstruct C{\n P p;\n double r;\n C(const P& p, const double& r) : p(p), r(r) {}\n C(){}\n};\n\nnamespace std{\n bool operator < (const P& a, const P& b){\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\n }\n bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){\n return (conj(a)*b).X;\n}\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\n}\nint ccw(P a, P b, P c){\n b -= a;\n c -= a;\n if(cross(b,c) > EPS) return +1; //ccw\n if(cross(b,c) < -EPS) return -1; //cw\n if(dot(b,c) < -EPS) return +2; //c-a-b\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\n return 0; //a-c-b\n}\n\nP unit(const P &p){\n return p/abs(p);\n}\n\nbool intersectSP(const L& s, const P &p){\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\n}\n\nP projection(const L& l, const P& p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\ndouble distanceLP(const L &l, const P &p) {\n return abs(cross(l[1]-l[0], p-l[0])) /abs(l[1]-l[0]);\n}\n\n\nVP crosspointCL(const C &c, const L &l){\n VP ret;\n P mid = projection(l, c.p);\n double d = distanceLP(l, c.p);\n if(EQ(d, c.r)){\n ret.push_back(mid);\n }else if(d < c.r){\n double len = sqrt(c.r*c.r -d*d);\n ret.push_back(mid +len*unit(l[1]-l[0]));\n ret.push_back(mid -len*unit(l[1]-l[0]));\n }\n return ret;\n}\nVP crosspointCS(const C &c, const L &s){\n VP ret;\n VP cp = crosspointCL(c,s);\n for(int i=0; i<(int)cp.size(); i++){\n if(intersectSP(s, cp[i])){\n ret.push_back(cp[i]);\n }\n }\n return ret;\n}\n\ndouble getangle360(const P &p, const P &a, const P &b){\n P proj = projection(L(p,a), b);\n int sign= (dot(a-p, b-p)>0)? 1: -1;\n if(ccw(p,a,b)!=-1){\n return acos(sign*abs(proj-p)/abs(b-p));\n }else{\n return 2*PI - acos(sign*abs(proj-p)/abs(b-p));\n }\n}\n\nint main(){\n while(1){\n int m,n;\n cin >> m >> n;\n if(m == 0) break;\n\n VP p(m), q(n);\n for(int i=0; i<m; i++){\n double x,y;\n cin >> x >> y;\n p[i] = P(x, y);\n }\n for(int i=0; i<n; i++){\n double x,y;\n cin >> x >> y;\n q[i] = P(x, y);\n }\n double cx,cy;\n cin >> cx >> cy;\n P c(cx, cy);\n\n double ans = 2*PI;\n //すべての辺同士の組み合わせ\n for(int i=0; i<m; i++){\n for(int j=0; j<n; j++){\n L ei(p[i], p[(i+1)%m]), ej(q[j], q[(j+1)%n]);\n for(int d=0; d<2; d++){\n C ci(c, abs(ei[d] -c)), cj(c, abs(ej[d] -c));\n VP cpi = crosspointCS(ci, ej);\n for(P p: cpi){\n ans = min(ans, getangle360(c, p, ei[d]));\n }\n VP cpj = crosspointCS(cj, ei);\n for(P p: cpj){\n ans = min(ans, getangle360(c, ej[d], p));\n }\n }\n }\n } \n\n\n cout << fixed << setprecision(10);\n cout << ans*180/PI << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3608,"score_of_the_acc":-0.9971,"final_rank":17},{"submission_id":"aoj_2045_2859298","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\n\n/* 幾何の基本 */\n\n#include <complex>\n\ntypedef complex<ld> Point;\n\n\nconst ld pi = acos(-1.0);\nconst ld dtop = pi / 180.;\nconst ld ptod = 1. / dtop;\n\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() > rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\n// 点の入力\nPoint input_Point() {\n\tld x, y;\n\tcin >> x >> y;\n\treturn Point(x, y);\n}\n\n// 誤差つき等号判定\nbool eq(const ld a, const ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// 内積\nld dot(const Point& a, const Point& b) {\n\treturn real(conj(a) * b);\n}\n\n// 外積\nld cross(const Point& a, const Point& b) {\n\treturn imag(conj(a) * b);\n}\n\n// 直線の定義\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) : a(a), b(b) {}\n\tPoint operator[](const int _num)const {\n\t\tif (_num == 0)return a;\n\t\telse if (_num == 1)return b;\n\t\telse {\n\t\t\tassert(false);\n\t\t\treturn Point();\n\t\t}\n\t}\n};\n\n// 円の定義\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n\tCircle() : p(Point(0, 0)), r(0) {}\n\tCircle(Point p, ld r) : p(p), r(r) {}\n};\n\n// ccw\n// 1: a,b,cが反時計周りの順に並ぶ\n//-1: a,b,cが時計周りの順に並ぶ\n// 2: c,a,bの順に直線に並ぶ\n//-2: a,b,cの順に直線に並ぶ\n// 0: a,c,bの順に直線に並ぶ\nint ccw(const Point& a, const Point &b, const Point &c) {\n\tconst Point nb(b - a);\n\tconst Point nc(c - a);\n\tif (cross(nb, nc) > eps) return 1; // a,b,cが反時計周りの順に並ぶ\n\tif (cross(nb, nc) < -eps) return -1; // a,b,cが時計周りの順に並ぶ\n\tif (dot(nb, nc) < 0) return 2; // c,a,bの順に直線に並ぶ\n\tif (norm(nb) < norm(nc)) return -2; // a,b,cの順に直線に並ぶ\n\treturn 0; // a,c,bの順に直線に並ぶ\n}\n\n\n/* 交差判定 */\n\n// 直線と直線の交差判定\nbool isis_ll(const Line& l, const Line& m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// 直線と線分の交差判定\nbool isis_ls(const Line& l, const Line& s) {\n\treturn isis_ll(l, s) &&\n\t\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// 線分と線分の交差判定\nbool isis_ss(const Line& s, const Line& t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n\t\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// 点の直線上判定\nbool isis_lp(const Line& l, const Point& p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n\n// 点の線分上判定\nbool isis_sp(const Line& s, const Point& p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\n// 垂線の足\nPoint proj(const Line &l, const Point& p) {\n\tld t = dot(p - l.a, l.b - l.a) / norm(l.a - l.b);\n\treturn l.a + t * (l.b - l.a);\n}\n\n//線対象の位置にある点\nPoint reflect(const Line &l, const Point &p) {\n\tPoint pr = proj(l, p);\n\treturn pr * 2.l - p;\n}\n\n// 直線と直線の交点\nPoint is_ll(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tassert(cross(sv, tv) != 0);\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n// 直線と直線の交点\nvector<Point> is_ll2(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\n\telse {\n\t\tvector<Point>ans;\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\n\t\t\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\n\t\t}\n\t\treturn ans;\n\t}\n}\n// 線分と線分の交点\n// 重なってる部分あるとassert(false)\nPoint is_ss(const Line &s, const Line& t) {\n\tif (isis_ss(s, t)) {\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tfor (int l = 0; l < 2; ++l) {\n\t\t\t\tif (s[k] == t[l])return s[k];\n\t\t\t}\n\t\t}\n\t\treturn is_ll(s, t);\n\t}\n\telse {\n\t\t//先にisis_ssしてね\n\t\tassert(false);\n\t\treturn Point(0, 0);\n\t}\n}\n// 線分と線分の交点\nvector<Point> is_ss2(const Line &s, const Line& t) {\n\tvector<Point> kouho(is_ll2(s, t));\n\tvector<Point>ans;\n\tfor (auto p : kouho) {\n\t\tif (isis_sp(s, p) && isis_sp(t, p))ans.emplace_back(p);\n\t}\n\treturn ans;\n}\n// 直線と点の距離\nld dist_lp(const Line& l, const Point& p) {\n\treturn abs(p - proj(l, p));\n}\n\n//直線と直線の距離\nld dist_ll(const Line& l, const Line& m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\n// 直線と線分の距離\nld dist_ls(const Line& l, const Line& s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\n// 線分と点の距離\nld dist_sp(const Line& s, const Point& p) {\n\tPoint r = proj(s, p);\n\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\n}\n\n// 線分と線分の距離\nld dist_ss(const Line& s, const Line& t) {\n\tif (isis_ss(s, t)) return 0;\n\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\n}\n\n\n//直線と直線の二等分線のベクトル\nLine line_bisection(const Line &s, const Line &t) {\n\tconst Point laglanju(is_ll(s, t));\n\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\n\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\n\n\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\n}\n//点と点の垂直二等分線 aを左に見ながら\nLine point_bisection(const Point&a, const Point&b) {\n\tconst Point cen((a + b) / 2.l);\n\tconst Point vec = (b - a)*Point(0, 1);\n\treturn Line(cen, cen + vec);\n}\n\n//三つの点からなる外心\nPoint outer_center(const vector<Point>&ps) {\n\tassert(ps.size() == 3);\n\tLine l1 = point_bisection(ps[0], ps[1]);\n\tLine l2 = point_bisection(ps[1], ps[2]);\n\treturn is_ll(l1, l2);\n}\n\n\n//三つの直線からなる内心\n//三つの直線が並行でないことは確かめといてね\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(line_bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(line_bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//三つの直線からなる傍心\n//三つの直線が並行でないことは確かめといてね\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(line_bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(line_bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:並行\n//c:並行でない\n//三つの直線から同距離の位置を求める。\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(line_bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(line_bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(line_bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* 円 */\n\n// 円と円の交点\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n/*\n点が円の中にいるか\n0 => out\n1 => on\n2 => in*/\nint is_in_Circle(const Point& p, const Circle &cir) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\nint is_in_Circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n/*\n円lcが円rcの中にいるか\n0 => out\n1 => on\n2 => in*/\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// 円と直線の交点\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// 円と線分の距離\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// 円と点の接線\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// 円と円の接線\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), nret.begin(), nret.end());\n\t}\n\telse {\n\t\tPoint v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\n\t\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\n\t\tret.push_back(Line(q1, q1 + v));\n\t\tret.push_back(Line(q2, q2 + v));\n\t}\n\treturn ret;\n}\n//二つの円の重なり面積\nld two_Circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* 多角形 */\n\ntypedef vector<Point> Polygon;\n\n\n\n//多角形(複数の点)の最小包含円をO(N=頂点数)で求めるアルゴリズム\n//同一直線上に三つの点がないこと\n#include<random>\nCircle welzl(vector<Point>ps) {\n\tstruct solver {\n\t\tCircle solve(vector<Point>&ps, vector<Point>&rs) {\n\t\t\tif (ps.empty() || rs.size() == 3) {\n\t\t\t\tif (rs.size() == 1) {\n\t\t\t\t\treturn Circle(Point(rs[0]), 0);\n\t\t\t\t}\n\t\t\t\telse if (rs.size() == 2) {\n\t\t\t\t\treturn Circle((rs[0] + rs[1]) / 2.0l, abs(rs[1] - rs[0]) / 2);\n\t\t\t\t}\n\t\t\t\telse if (rs.size() == 3) {\n\t\t\t\t\tvector<Line> ls(3);\n\t\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\t\tls[i] = Line(rs[i], rs[(i + 1) % 3]);\n\t\t\t\t\t}\n\t\t\t\t\tPoint center = outer_center(rs);\n\t\t\t\t\treturn Circle(center, abs(center - rs[0]));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn Circle(Point(), 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\n\t\t\t\tPoint p_ba = ps.back();\n\t\t\t\tps.pop_back();\n\t\t\t\tCircle d = solve(ps, rs);\n\t\t\t\tps.push_back(p_ba);\n\t\t\t\tif (is_in_Circle(d, p_ba)) {\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\trs.push_back(p_ba);\n\t\t\t\t\tps.pop_back();\n\t\t\t\t\tauto ans = solve(ps, rs);\n\t\t\t\t\tps.push_back(p_ba);\n\t\t\t\t\trs.pop_back();\n\t\t\t\t\treturn ans;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}so;\n\tstd::random_device rd;\n\tstd::mt19937 mt(rd());\n\tshuffle(ps.begin(), ps.end(), mt);\n\tvector<Point>rs;\n\tCircle ans = so.solve(ps, rs);\n\treturn ans;\n}\n// 面積\nld get_area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tfor (int j = 0; j<n; ++j) res += cross(p[j], p[(j + 1) % n]);\n\treturn res / 2;\n}\n\n//多角形の回転方向\nbool is_counter_clockwise(const Polygon &poly) {\n\tld angle = 0;\n\tint n = poly.size();\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\n\t\tangle += arg((c - b) / (b - a));\n\t}\n\treturn angle > eps;\n}\n\n// 円の内外判定\n/*0 => out\n1 => on\n2 => in*/\nint is_in_Polygon(const Polygon &poly, const Point& p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n];\n\t\tif (isis_sp(Line(a, b), p)) return 1;\n\t\tangle += arg((b - p) / (a - p));\n\t}\n\treturn eq(angle, 0) ? 0 : 2;\n}\n//円の内外判定2 高速\nenum { out, on, in };\nint convex_contains(const Polygon &P, const Point &p) {\n\tconst int n = P.size();\n\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\n\tint a = 0, b = n;\n\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\n\t\tint c = (a + b) / 2;\n\t\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\n\t\t\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\n\t\t\telse a = c;\n\t\t}\n\t\telse {\n\t\t\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\n\t\t\telse b = c;\n\t\t}\n\t}\n\tb %= n;\n\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\n\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\n\treturn 1;\n}\n\n// 凸包\n//点や線を返すことも有り得るので注意\nPolygon convex_hull(vector<Point> ps) {\n\tint n = ps.size();\n\tint k = 0;\n\tsort(ps.begin(), ps.end());\n\tPolygon ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++])\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n\n\n//凸カット\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\n\tint n = ps.size();\n\tPolygon q;\n\tPolygon r;\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = ps[i], b = ps[(i + 1) % n];\n\t\tLine m = Line(a, b);\n\t\tif (ccw(l.a, l.b, a) != -1) q.push_back(a);\n\t\tif (ccw(l.a, l.b, a) != 1) r.push_back(a);\n\t\tif (ccw(l.a, l.b, a) * ccw(l.a, l.b, b) < 0 && isis_ll(l, m)) {\n\t\t\tq.push_back(is_ll(l, m));\n\t\t\tr.push_back(is_ll(l, m));\n\t\t}\n\t}\n\tconst vector<Polygon>polys{ q,r };\n\treturn polys;\n}\n\n\n\nint main() {\n\tcout<<setprecision(10)<<fixed;\n\tcout<<setprecision(10)<<fixed;\n\tcout<<setprecision(10)<<fixed;\n\tcout<<setprecision(10)<<fixed;\n\tcout<<setprecision(10)<<fixed;\n\twhile (true){\n\t\tint M,N;cin>>M>>N;\n\t\tif(!M)break;\n\t\tPolygon rooms,patient;\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tint x,y;cin>>x>>y;\n\t\t\trooms.emplace_back(x,y);\n\t\t}\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint x,y;cin>>x>>y;\n\t\t\tpatient.emplace_back(x,y);\n\t\t}\n\t\t{\n\t\t\tPoint center;\n\t\t\tint x,y;cin>>x>>y;\n\t\t\tcenter=Point(x,y);\n\t\t\tfor (auto &p : rooms) {\n\t\t\t\tp-=center;\n\t\t\t}\n\t\t\tfor (auto&p : patient) {\n\t\t\t\tp-=center;\n\t\t\t}\n\t\t}\n\n\t\tld ans=2*pi;\n\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tLine l(rooms[i],rooms[(i+1)%M]);\n\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\tPoint p(patient[j]);\n\t\t\t\tCircle c(Point(0,0),abs(p));\n\n\t\t\t\tauto ps=is_sc(c,l);\n\t\t\t\tfor (auto n : ps) {\n\t\t\t\t\tld theta1=atan2l(p.imag(),p.real());\n\t\t\t\t\tld theta2=atan2l(n.imag(),n.real());\n\t\t\t\t\tif(theta2<theta1)theta2+=2*pi;\n\n\t\t\t\t\tans=min(ans,theta2-theta1);\n\t\t\t\t}\n\t\t\t\t\n\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tLine l(patient[i], patient[(i + 1) % N]);\n\t\t\tfor (int j = 0; j < M; ++j) {\n\t\t\t\tPoint p(rooms[j]);\n\t\t\t\tCircle c(Point(0, 0), abs(p));\n\n\t\t\t\tauto ps = is_sc(c, l);\n\t\t\t\tfor (auto n : ps) {\n\t\t\t\t\tld theta1 = atan2l(p.imag(), p.real());\n\t\t\t\t\tld theta2 = atan2l(n.imag(), n.real());\n\t\t\t\t\tif (theta2<theta1)theta2 += 2 * pi;\n\n\t\t\t\t\tans = min(ans, 2*pi-(theta2 - theta1));\n\t\t\t\t}\n\n\n\t\t\t}\n\t\t}\n\t\tcout<<ans/(2*pi)*360<<endl;\n\t\t\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3284,"score_of_the_acc":-0.8851,"final_rank":14},{"submission_id":"aoj_2045_2276502","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n \nconst double PI=acos(-1);\nconst double PI2=PI*2.0;\nconst double eps=1e-10;\n \ntypedef complex<double> P;\ntypedef pair<P,P> S;\ntypedef pair<P,double> C;\ntypedef vector<P> vecP;\n \nbool eq(double a,double b){\n return -eps<a-b&&a-b<eps;\n}\n \ndouble Sqrt(double x){\n if(x<0)return x;\n return sqrt(x);\n}\n \nP normal( P a ){\n return a/abs(a);\n}\n \ndouble dot(P a,P b){\n return real( b*conj(a) );\n}\ndouble cross(P a,P b){\n return imag( b*conj(a) );\n}\ndouble getArg(P a,P b){\n return arg(b*conj(a));\n}\n \ndouble getTime(P a,P b){\n return ( dot(a,b) < 0 ? -1.0 : 1.0)*abs(b)/abs(a); \n}\n \nbool onSP(S s,P p){\n P a=s.first, b=s.second;\n return eq( abs(a-b) , abs(p-a)+abs(p-b) );\n}\n \nP project(P a,P b,P c){\n b-=a;c-=a;\n return a+b*real(c/b);\n}\n \ndouble getDistLP(S s,P p){\n P a=s.first, b=s.second;\n return abs( cross(b-a,p-a) / abs(b-a) );\n}\n \ndouble getDistSP(S s,P p){\n P a=s.first, b=s.second;\n if( dot(b-a,p-a) < eps )return abs(p-a);\n if( dot(a-b,p-b) < eps )return abs(p-b);\n return getDistLP(s,p);\n}\n \nbool isCrossCS(C c,S s){\n P a=s.first, b=s.second;\n double A=abs(c.second-a);\n double B=abs(c.second-b);\n double C=getDistSP(s,c.second);\n if( A < c.second+eps && B < c.second+eps )return false;\n if( c.second+eps < C )return false;\n return true;\n}\n \nvecP getCrossCL(C cir,S line){\n P a=line.first, b=line.second;\n double cr=cir.second;\n P cp=cir.first;\n vecP res;\n P base=b-a, target=project(a,b,cp);\n double length=abs(base), h=abs(cp-target);\n base/=length;\n \n if(cr+eps<h)return res;\n double w=Sqrt(cr*cr-h*h);\n double L=getTime( normal(b-a), target-a) -w , R=L+w*2.0;\n \n res.push_back( a+ base * L );\n if(eq(L,R))return res;\n res.push_back( a+ base * R );\n return res;\n}\n \nvecP getCrossCS(C cir,S s){\n vecP tmp=getCrossCL(cir,s);\n vecP res;\n for(int i=0;i<(int)tmp.size();i++)\n if( onSP(s,tmp[i]) )\n res.push_back( tmp[i] );\n \n return res;\n}\n \ndouble calc(P cen,S a,P b){\n if( eq(abs(cen-b),0) )return 1e10;\n \n vecP tp=getCrossCS( C(cen, abs(cen-b) ) , a );\n double res=1e10;\n \n for(int i=0;i<(int)tp.size();i++){\n P p=tp[i];\n double value=getArg(b-cen,p-cen);\n if( value < 0 )value+=PI2;\n res=min(res,value);\n }\n return res;\n}\n \ndouble calc2(P cen,S a,P b){\n if( eq(abs(cen-b),0) )return 1e10;\n \n vecP tp=getCrossCS( C(cen, abs(cen-b) ) , a );\n double res=1e10;\n \n for(int i=0;i<(int)tp.size();i++){\n P p=tp[i];\n double value=getArg(b-cen,p-cen);\n if( value < 0 )value+=PI2;\n res=min(res,PI2-value);\n }\n return res;\n}\n \ndouble calc(P cen,S a,S b){\n double res=1e10;\n res=min(res,calc(cen,a,b.first));\n res=min(res,calc(cen,a,b.second));\n res=min(res,calc2(cen,b,a.first));\n res=min(res,calc2(cen,b,a.second));\n return res;\n}\n \nP input(){\n int x,y;\n cin>>x>>y;\n return P(x,y);\n}\n \n \nS getS(const vecP& polygon,int index){\n int n=polygon.size();\n index%=n;\n return S(polygon[index], polygon[ (index+1) % n ]);\n}\n \nint main(){\n int M,N;\n P cen;\n while(1){\n cin>>M>>N;\n if(M==0&&N==0)break;\n vecP inpol,outpol;\n \n for(int i=0;i<M;i++){\n inpol.push_back( input() );\n }\n for(int i=0;i<N;i++){\n outpol.push_back( input() );\n }\n cen=input();\n \n double ans=1e10;\n for(int i=0;i<M;i++){\n for(int j=0;j<N;j++){\n ans=min(ans, calc(cen, getS(inpol,i) , getS(outpol,j) ) );\n }\n }\n printf(\"%.10f\\n\", min(360.0,ans/PI*180.0) );\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3384,"score_of_the_acc":-0.9185,"final_rank":15},{"submission_id":"aoj_2045_2275807","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nconst double PI=acos(-1);\nconst double PI2=PI*2.0;\nconst double eps=1e-10;\n\ntypedef complex<double> P;\ntypedef pair<P,P> S;\ntypedef pair<P,double> C;\ntypedef vector<P> vecP;\n\nbool eq(double a,double b){\n return -eps<a-b&&a-b<eps;\n}\n\ndouble Sqrt(double x){\n if(x<0)return x;\n return sqrt(x);\n}\n\nP normal( P a ){\n return a/abs(a);\n}\n\ndouble dot(P a,P b){\n return real( b*conj(a) );\n}\ndouble cross(P a,P b){\n return imag( b*conj(a) );\n}\ndouble getArg(P a,P b){\n return arg(b*conj(a));\n}\n\ndouble getTime(P a,P b){\n return ( dot(a,b) < 0 ? -1.0 : 1.0)*abs(b)/abs(a); \n}\n\nbool onSP(S s,P p){\n P a=s.first, b=s.second;\n return eq( abs(a-b) , abs(p-a)+abs(p-b) );\n}\n\nP project(P a,P b,P c){\n b-=a;c-=a;\n return a+b*real(c/b);\n}\n\ndouble getDistLP(S s,P p){\n P a=s.first, b=s.second;\n return abs( cross(b-a,p-a) / abs(b-a) );\n}\n\ndouble getDistSP(S s,P p){\n P a=s.first, b=s.second;\n if( dot(b-a,p-a) < eps )return abs(p-a);\n if( dot(a-b,p-b) < eps )return abs(p-b);\n return getDistLP(s,p);\n}\n\nbool isCrossCS(C c,S s){\n P a=s.first, b=s.second;\n double A=abs(c.second-a);\n double B=abs(c.second-b);\n double C=getDistSP(s,c.second);\n if( A < c.second+eps && B < c.second+eps )return false;\n if( c.second+eps < C )return false;\n return true;\n}\n\nvecP getCrossCL(C cir,S line){\n P a=line.first, b=line.second;\n double cr=cir.second;\n P cp=cir.first;\n vecP res;\n P base=b-a, target=project(a,b,cp);\n double length=abs(base), h=abs(cp-target);\n base/=length;\n\n if(cr+eps<h)return res;\n double w=Sqrt(cr*cr-h*h);\n double L=getTime( normal(b-a), target-a) -w , R=L+w*2.0;\n\n res.push_back( a+ base * L );\n if(eq(L,R))return res;\n res.push_back( a+ base * R );\n return res;\n}\n\nvecP getCrossCS(C cir,S s){\n vecP tmp=getCrossCL(cir,s);\n vecP res;\n for(int i=0;i<(int)tmp.size();i++)\n if( onSP(s,tmp[i]) )\n res.push_back( tmp[i] );\n\n return res;\n}\n\ndouble calc(P cen,S a,P b){\n if( eq(abs(cen-b),0) )return 1e10;\n \n vecP tp=getCrossCS( C(cen, abs(cen-b) ) , a );\n double res=1e10;\n \n for(int i=0;i<(int)tp.size();i++){\n P p=tp[i];\n double value=getArg(b-cen,p-cen);\n if( value < 0 )value+=PI2;\n res=min(res,value);\n }\n return res;\n}\n\ndouble calc2(P cen,S a,P b){\n if( eq(abs(cen-b),0) )return 1e10;\n \n vecP tp=getCrossCS( C(cen, abs(cen-b) ) , a );\n double res=1e10;\n \n for(int i=0;i<(int)tp.size();i++){\n P p=tp[i];\n double value=getArg(b-cen,p-cen);\n if( value < 0 )value+=PI2;\n res=min(res,PI2-value);\n }\n return res;\n}\n\ndouble calc(P cen,S a,S b){\n double res=1e10;\n res=min(res,calc(cen,a,b.first));\n res=min(res,calc(cen,a,b.second));\n res=min(res,calc2(cen,b,a.first));\n res=min(res,calc2(cen,b,a.second));\n return res;\n}\n\nP input(){\n int x,y;\n cin>>x>>y;\n return P(x,y);\n}\n\n\nS getS(const vecP& polygon,int index){\n int n=polygon.size();\n index%=n;\n return S(polygon[index], polygon[ (index+1) % n ]);\n}\n\nint main(){\n int M,N;\n P cen;\n while(1){\n cin>>M>>N;\n if(M==0&&N==0)break;\n vecP inpol,outpol;\n \n for(int i=0;i<M;i++){\n inpol.push_back( input() );\n }\n for(int i=0;i<N;i++){\n outpol.push_back( input() );\n }\n cen=input();\n\n double ans=1e10;\n for(int i=0;i<M;i++){\n for(int j=0;j<N;j++){\n ans=min(ans, calc(cen, getS(inpol,i) , getS(outpol,j) ) );\n }\n }\n printf(\"%.10f\\n\", min(360.0,ans/PI*180.0) );\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3404,"score_of_the_acc":-0.9258,"final_rank":16},{"submission_id":"aoj_2045_1094826","code_snippet":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <cstdio>\n#include <complex>\n#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <map>\n#include <set>\n#include <queue>\n#include <bitset>\n#include <stack>\n#include <utility>\n#include <numeric>\n#include <functional>\n#include <string>\n#include <cstring>\n#include <sstream>\n// #include <tuple>\n// #include <regex>\n \nusing namespace std;\ntypedef long long ll;\n \n#define ALL(c) (c).begin(),(c).end()\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\n#define EACH(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)\n#define IN(l,v,r) ((l)<=(v) && (v)<(r))\n \n \ntypedef long double D;\nconst D EPS = 1e-8,INF = 1e12;\n \ntemplate<typename T> int sig(T a,T b=0){return a<b-EPS?-1:a>b+EPS?1:0;}\ntemplate<typename T> bool eq(T a,T b){ return sig(abs(a-b))==0;}\ntemplate<typename T> D norm(T a){ return a*a;}\n \ntypedef complex<D> P,Vec;\n#define X real()\n#define Y imag()\n \nbool debug = false;\n \n \nnamespace std{\n bool operator < (const P& a,const P& b){\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\n }\n bool operator == (const P& a,const P& b){\n return eq(a,b);\n }\n};\n \n// a×b\nD cross(const Vec& a,const Vec& b){\n return imag(conj(a)*b);\n}\n// a・b\nD dot(const Vec& a,const Vec& b) {\n return real(conj(a)*b);\n}\n//射影ベクトル\nVec proj(Vec p,Vec b) {\n return b * dot(p,b) / norm(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//直線へ射影した時の点\nP projection(const L &l, const P &p) {\n return l[0] + proj(p-l[0],l[1]-l[0]);\n}\n \nD distanceLP(const L &l, const P &p) {\n return abs(p - projection(l, p));\n}\n \nstruct C {\n P o; D r;\n C(const P &o,D r) : o(o), r(r) { }\n};\n \nvector<P> intersectionLC(L l,C c){\n D d = distanceLP(l,c.o);\n vector <P> res;\n if(eq(d,c.r)){\n res.push_back(projection(l,c.o));\n }else if(sig(d,c.r)<0){\n P m = projection(l,c.o),u = (l[1]-l[0])/abs(l[1]-l[0]);\n D t = sqrt(c.r*c.r - d*d);\n res.push_back( m + t * u);res.push_back( m - t * u);\n }\n return res;\n}\n \nint ccw(const P& a,P b,P c){\n\t\tb -= a; c -= a;\n\t\tif (sig(cross(b,c))>0) return +1; // counter clockwise\n\t\tif (sig(cross(b,c))<0) return -1; // clockwise\n\t\tif (sig(dot(b,c)) < 0) return +2; // c--a--b on line\n\t\tif (sig(norm(b),norm(c))<0) return -2; // a--b--c on line\n\t\treturn 0;\n\t}\n \nvector<P> intersectionSC(L l,C c){\n vector<P> ps=intersectionLC(l,c),res;\n REP(i,ps.size()){\n if(ccw(ps[i],l[0],l[1])==+2 || ccw(ps[i],l[1],l[0])==+2){\n res.push_back(ps[i]);\n }\n }\n return res;\n}\n \n//浮動小数点modで非負の値のみかえす．\nD pfmod(D v,D M=2*M_PI){\n return fmod(fmod(v,M)+M,M);\n}\n \nint main(){\n cout <<fixed <<setprecision(20);\n cerr <<fixed <<setprecision(20);\n \n while(true){\n int m,n;cin >> m >> n;\n if(m==0 && n==0)break;\n \n vector<P> ps(m);\n REP(i,m){\n D x,y;cin >>x >> y;ps[i]=P(x,y); \n }\n vector<P> qs(n);\n REP(i,n){\n D x,y;cin >>x >> y;qs[i]=P(x,y); \n }\n P c;\n {\n D x,y;cin >>x >> y;c=P(x,y); \n }\n \n D ma = 2 * M_PI;\n REP(i,m){\n C ic(c,abs(ps[i]-c));\n REP(j,n){\n L l(qs[j],qs[(j+1)%n]);\n vector<P> ip=intersectionSC(l,ic);\n REP(k,ip.size()){\n D a=pfmod(arg(ps[i]-c)-arg(ip[k]-c));\n ma=min(ma,a);\n }\n }\n }\n REP(j,n){\n C ic(c,abs(qs[j]-c));\n REP(i,m){\n L l(ps[i],ps[(i+1)%m]);\n vector<P> ip=intersectionSC(l,ic);\n REP(k,ip.size()){\n D a=pfmod(arg(ip[k]-c)-arg(qs[j]-c));\n ma=min(ma,a);\n }\n }\n }\n \n cout << ma * 360.0/(2*M_PI)<<endl;\n }\n \n \n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1320,"score_of_the_acc":-0.1715,"final_rank":6},{"submission_id":"aoj_2045_1088814","code_snippet":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <cstdio>\n#include <complex>\n#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <map>\n#include <set>\n#include <queue>\n#include <bitset>\n#include <stack>\n#include <utility>\n#include <numeric>\n#include <functional>\n#include <string>\n#include <cstring>\n#include <sstream>\n// #include <tuple>\n// #include <regex>\n\nusing namespace std;\ntypedef long long ll;\n\n#define ALL(c) (c).begin(),(c).end()\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\n#define EACH(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)\n#define IN(l,v,r) ((l)<=(v) && (v)<(r))\n\n\ntypedef long double D;\nconst D EPS = 1e-8,INF = 1e12;\n\ntemplate<typename T> int sig(T a,T b=0){return a<b-EPS?-1:a>b+EPS?1:0;}\ntemplate<typename T> bool eq(T a,T b){ return sig(abs(a-b))==0;}\ntemplate<typename T> D norm(T a){ return a*a;}\n\ntypedef complex<D> P,Vec;\n#define X real()\n#define Y imag()\n\nbool debug = false;\n\n\nnamespace std{\n\tbool operator < (const P& a,const P& b){\n \t\treturn a.X != b.X ? a.X < b.X : a.Y < b.Y;\n \t}\n \tbool operator == (const P& a,const P& b){\n \t\treturn eq(a,b);\n \t}\n};\n\n// a×b\nD cross(const Vec& a,const Vec& b){\n\treturn imag(conj(a)*b);\n}\n// a・b\nD dot(const Vec& a,const Vec& b) {\n\treturn real(conj(a)*b);\n}\n//射影ベクトル\nVec proj(Vec p,Vec b) {\n\treturn b * dot(p,b) / norm(b);\n}\n\n//直線・線分\nstruct L : public vector<P> {\n\tL(const P &a, const P &b) {\n\t \tpush_back(a); push_back(b);\n\t }\n};\n\n//直線へ射影した時の点\nP projection(const L &l, const P &p) {\n\treturn l[0] + proj(p-l[0],l[1]-l[0]);\n}\n\nD distanceLP(const L &l, const P &p) {\n\treturn abs(p - projection(l, p));\n}\n\nstruct C {\n \tP o; D r;\n \tC(const P &o,D r) : o(o), r(r) { }\n};\n\nvector<P> intersectionLC(L l,C c){\n\tD d = distanceLP(l,c.o);\n\tvector <P> res;\n \tif(eq(d,c.r)){\n\t\tres.push_back(projection(l,c.o));\n\t}else if(sig(d,c.r)<0){\n\t\tP m = projection(l,c.o),u = (l[1]-l[0])/abs(l[1]-l[0]);\n\t \tD t = sqrt(c.r*c.r - d*d);\n\t\tres.push_back( m + t * u);res.push_back( m - t * u);\n\t}\n\treturn res;\n}\n\nint ccw(const P& a,P b,P c){\n\tb -= a; c -= a;\n\tif (cross(b,c) > EPS) return +1; \t// counter clockwise\n\tif (cross(b,c) < -EPS) return -1; \t// clockwise\n\tif (dot(b,c) < 0) return +2; // c--a--b on line\n\tif (norm(b) < norm(c)) return -2; // a--b--c on line\n\treturn 0; \t\t\t\t\t\t\t\t// a--c--b on line (or b==c)\n}\n\nvector<P> intersectionSC(L l,C c){\n\tvector<P> ps=intersectionLC(l,c),res;\n\tREP(i,ps.size()){\n\t\tif(ccw(ps[i],l[0],l[1])==+2 || ccw(ps[i],l[1],l[0])==+2){\n\t\t\tres.push_back(ps[i]);\n\t\t}\n\t}\n\treturn res;\n}\n\n//浮動小数点modで非負の値のみかえす．\nD pfmod(D v,D M=2*M_PI){\n\treturn fmod(fmod(v,M)+M,M);\n}\n\nint main(){\n\tcout <<fixed <<setprecision(20);\n\tcerr <<fixed <<setprecision(20);\n\n\twhile(true){\n\t\tint m,n;cin >> m >> n;\n\t\tif(m==0 && n==0)break;\n\n\t\tvector<P> ps(m);\n\t\tREP(i,m){\n\t\t\tD x,y;cin >>x >> y;ps[i]=P(x,y); \n\t\t}\n\t\tvector<P> qs(n);\n\t\tREP(i,n){\n\t\t\tD x,y;cin >>x >> y;qs[i]=P(x,y); \n\t\t}\n\t\tP c;\n\t\t{\n\t\t\tD x,y;cin >>x >> y;c=P(x,y); \n\t\t}\n\n\t\tD ma = 2 * M_PI;\n\t\tREP(i,m){\n\t\t\tC ic(c,abs(ps[i]-c));\n\t\t\tREP(j,n){\n\t\t\t\tL l(qs[j],qs[(j+1)%n]);\n\t\t\t\tvector<P> ip=intersectionSC(l,ic);\n\t\t\t\tREP(k,ip.size()){\n\t\t\t\t\tD a=pfmod(arg(ps[i]-c)-arg(ip[k]-c));\n\t\t\t\t\tma=min(ma,a);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tREP(j,n){\n\t\t\tC ic(c,abs(qs[j]-c));\n\t\t\tREP(i,m){\n\t\t\t\tL l(ps[i],ps[(i+1)%m]);\n\t\t\t\tvector<P> ip=intersectionSC(l,ic);\n\t\t\t\tREP(k,ip.size()){\n\t\t\t\t\tD a=pfmod(arg(ip[k]-c)-arg(qs[j]-c));\n\t\t\t\t\tma=min(ma,a);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcout << ma * 360.0/(2*M_PI)<<endl;\n\t}\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1320,"score_of_the_acc":-0.1715,"final_rank":6},{"submission_id":"aoj_2045_1088813","code_snippet":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <cstdio>\n#include <complex>\n#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <map>\n#include <set>\n#include <queue>\n#include <bitset>\n#include <stack>\n#include <utility>\n#include <numeric>\n#include <functional>\n#include <string>\n#include <cstring>\n#include <sstream>\n// #include <tuple>\n// #include <regex>\n\nusing namespace std;\ntypedef long long ll;\n\n#define ALL(c) (c).begin(),(c).end()\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\n#define EACH(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)\n#define IN(l,v,r) ((l)<=(v) && (v)<(r))\n\n\ntypedef long double D;\nconst D EPS = 1e-8,INF = 1e12;\n\ntemplate<typename T> int sig(T a,T b=0){return a<b-EPS?-1:a>b+EPS?1:0;}\ntemplate<typename T> bool eq(T a,T b){ return sig(abs(a-b))==0;}\ntemplate<typename T> D norm(T a){ return a*a;}\n\ntypedef complex<D> P,Vec;\n#define X real()\n#define Y imag()\n\nbool debug = false;\n\n\nnamespace std{\n\tbool operator < (const P& a,const P& b){\n \t\treturn a.X != b.X ? a.X < b.X : a.Y < b.Y;\n \t}\n \tbool operator == (const P& a,const P& b){\n \t\treturn eq(a,b);\n \t}\n};\n\n// a×b\nD cross(const Vec& a,const Vec& b){\n\treturn imag(conj(a)*b);\n}\n// a・b\nD dot(const Vec& a,const Vec& b) {\n\treturn real(conj(a)*b);\n}\n//射影ベクトル\nVec proj(Vec p,Vec b) {\n\treturn b * dot(p,b) / norm(b);\n}\n\n//直線・線分\nstruct L : public vector<P> {\n\tL(const P &a, const P &b) {\n\t \tpush_back(a); push_back(b);\n\t }\n};\n\n//直線へ射影した時の点\nP projection(const L &l, const P &p) {\n\treturn l[0] + proj(p-l[0],l[1]-l[0]);\n}\n\nD distanceLP(const L &l, const P &p) {\n\treturn abs(p - projection(l, p));\n}\n\nstruct C {\n \tP o; D r;\n \tC(const P &o,D r) : o(o), r(r) { }\n};\n\nvector<P> intersectionLC(L l,C c){\n\tD d = distanceLP(l,c.o);\n\tvector <P> res;\n \tif(eq(d,c.r)){\n\t\tres.push_back(projection(l,c.o));\n\t}else if(sig(d,c.r)<0){\n\t\tP m = projection(l,c.o),u = (l[1]-l[0])/abs(l[1]-l[0]);\n\t \tD t = sqrt(c.r*c.r - d*d);\n\t\tres.push_back( m + t * u);res.push_back( m - t * u);\n\t}\n\treturn res;\n}\n\n\nint ccw(const P& a,P b,P c){\n\tb -= a; c -= a;\n\tif (cross(b,c) > EPS) return +1; \t// counter clockwise\n\tif (cross(b,c) < -EPS) return -1; \t// clockwise\n\tif (dot(b,c) < 0) return +2; // c--a--b on line\n\tif (norm(b) < norm(c)) return -2; // a--b--c on line\n\treturn 0; \t\t\t\t\t\t\t\t// a--c--b on line (or b==c)\n}\n\nvector<P> intersectionSC(L l,C c){\n\tvector<P> ps=intersectionLC(l,c),res;\n\t// if(debug){\n\t// \tREP(i,ps.size()){\n\t// \t\tcerr <<ps[i]<<endl;\n\t// \t}\n\t// }\n\tREP(i,ps.size()){\n\t\t// cerr << ccw(ps[i],l[0],l[1])<<endl;\n\t\t// cerr << ccw(ps[i],l[1],l[0])<<endl;\n\t\tif(ccw(ps[i],l[0],l[1])==+2 || ccw(ps[i],l[1],l[0])==+2){\n\t\t\tres.push_back(ps[i]);\n\t\t}\n\t}\n\treturn res;\n}\n\n//浮動小数点modで非負の値のみかえす．\nD pfmod(D v,D M=2*M_PI){\n\treturn fmod(fmod(v,M)+M,M);\n}\n\nint main(){\n\tcout <<fixed <<setprecision(20);\n\tcerr <<fixed <<setprecision(20);\n\n\twhile(true){\n\t\tint m,n;cin >> m >> n;\n\t\tif(m==0 && n==0)break;\n\n\t\tvector<P> ps(m);\n\t\tREP(i,m){\n\t\t\tD x,y;cin >>x >> y;ps[i]=P(x,y); \n\t\t}\n\t\tvector<P> qs(n);\n\t\tREP(i,n){\n\t\t\tD x,y;cin >>x >> y;qs[i]=P(x,y); \n\t\t}\n\t\tP c;\n\t\t{\n\t\t\tD x,y;cin >>x >> y;c=P(x,y); \n\t\t}\n\n\t\tD ma = 2 * M_PI;\n\t\tREP(i,m){\n\t\t\tC ic(c,abs(ps[i]-c));\n\t\t\tREP(j,n){\n\t\t\t\tif(i==4 && j==2)debug=true;\n\t\t\t\tL l(qs[j],qs[(j+1)%n]);\n\t\t\t\tvector<P> ip=intersectionSC(l,ic);\n\n\t\t\t\t// if(i==4 && j==2){\n\t\t\t\t// \tcerr << i <<\" \" <<j <<endl;\n\t\t\t\t// \tcerr << c<<\" \"<<ps[i] << endl;\t\t\t\t\n\t\t\t\t// \tcerr << abs(ps[i]-c)<<endl;\n\t\t\t\t// \tcerr << l[0]<<\" \"<<l[1]<<endl;\t\n\t\t\t\t// \tcerr <<\"--\"<<endl;\t\t\t\n\t\t\t\t// \tREP(k,ip.size())cerr << ip[k]<<endl;\n\t\t\t\t// }\n\t\t\t\tREP(k,ip.size()){\n\t\t\t\t\tD a=pfmod(arg(ps[i]-c)-arg(ip[k]-c));\n\t//\t\t\t\tcerr << a <<endl;\n\t\t\t\t\tma=min(ma,a);\n\t\t\t\t}\n\n\t\t\t\t// cerr << ma<<endl;\n\t\t\t\t// cerr <<endl;\n\t\t\t\t// if(i==4 && j==2)debug=false;\n\t\t\t}\n\t\t}\n\t\tREP(j,n){\n\t\t\tC ic(c,abs(qs[j]-c));\n\t\t\tREP(i,m){\n\t\t\t\t// if(i==4 && j==2)debug=true;\n\t\t\t\tL l(ps[i],ps[(i+1)%m]);\n\t\t\t\tvector<P> ip=intersectionSC(l,ic);\n\n\t\t\t\t// if(i==4 && j==2){\n\t\t\t\t// \tcerr << i <<\" \" <<j <<endl;\n\t\t\t\t// \tcerr << c<<\" \"<<ps[i] << endl;\t\t\t\t\n\t\t\t\t// \tcerr << abs(ps[i]-c)<<endl;\n\t\t\t\t// \tcerr << l[0]<<\" \"<<l[1]<<endl;\t\n\t\t\t\t// \tcerr <<\"--\"<<endl;\t\t\t\n\t\t\t\t// \tREP(k,ip.size())cerr << ip[k]<<endl;\n\t\t\t\t// }\n\t\t\t\t\n\t\t\t\tREP(k,ip.size()){\n\t\t\t\t\tD a=pfmod(arg(ip[k]-c)-arg(qs[j]-c));\n\t\t\t\t\tma=min(ma,a);\n\t\t\t\t}\n\n\t\t\t\t// cerr << ma<<endl;\n\t\t\t\t// cerr <<endl;\n\n\t\t\t\t// if(i==4 && j==2)debug=false;\n\t\t\t}\n\t\t}\n\n\t\tcout << ma * 360.0/(2*M_PI)<<endl;\n\t}\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1320,"score_of_the_acc":-0.1715,"final_rank":6},{"submission_id":"aoj_2045_1046013","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\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\nclass Point{\npublic:\n double x,y;\n\n Point(double x = 0,double y = 0): x(x),y(y){}\n\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n bool operator == (const Segment& p)const { return ( p.p1 == p1 && p.p2 == p2 ) || ( p.p1 == p2 && p.p2 == p1 ); }\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\nostream& operator << (ostream& os,const Point& a){ os << \"(\" << a.x << \",\" << a.y << \")\"; }\n\nostream& operator << (ostream& os,const Segment& a){ os << \"( \" << a.p1 << \" , \" << a.p2 << \" )\"; }\n\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\n\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\n\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\n\ndouble abs(Point a){ return sqrt(norm(a)); }\n\n//rad は角度をラジアンで持たせること\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n\n// 度をラジアンに変換\ndouble toRad(double agl){ return agl*M_PI/180.0; }\n\n// a => prev, b => cur, c=> next\n// prev から cur へ行って next へ行く際の角度を求める\ndouble getArg(Point a,Point b,Point c){\n double arg1 = atan2(b.y-a.y,b.x-a.x);\n double arg2 = atan2(c.y-b.y,c.x-b.x);\n double arg = fabs( arg1 - arg2 );\n while( arg > M_PI ) arg -= 2.0 * M_PI;\n return fabs(arg);\n}\n\nint ccw(Point p0,Point p1,Point p2){\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS)return CLOCKWISE;\n if(dot(a,b) < -EPS)return ONLINE_BACK;\n if(norm(a) < norm(b))return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n\n// p0 を p1 を基準に時計回りで回した時の p2 までの角度\ndouble ccw_angle(Point p0,Point p1,Point p2){\n double ret = M_PI - getArg(p0,p1,p2);\n //cout << ret * 180 / M_PI << endl;\n if( ccw(p1,p0,p2) == COUNTER_CLOCKWISE ) ret = 2*M_PI - ret;\n return ret;\n}\n\n\ndouble cross3p(Point p,Point q,Point r) { return (r.x-q.x) * (p.y -q.y) - (r.y - q.y) * (p.x - q.x); }\n \nbool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }\n \nbool ccwtest(Point p,Point q,Point r) { return cross3p(p,q,r) > 0; }\n \nbool onSegment(Point p,Point q,Point r) { return collinear(p,q,r) && equals(sqrt(pow(p.x-r.x,2)+pow(p.y-r.y,2)) + sqrt(pow(r.x-q.x,2) + pow(r.y-q.y,2) ),sqrt(pow(p.x-q.x,2)+pow(p.y-q.y,2)) ) ; }\n\n\ntypedef pair<double,double> dd;\nconst double DINF = 1e20;\n#define pow2(a) ((a)*(a))\nbool LT(double a ,double b){ return !equals(a,b) && a < b; }\nbool LTE(double a,double b){ return equals(a,b) || a < b; }\n\ndd calc(double x1,double y1,double vx1,double vy1,\n double x2,double y2,double vx2,double vy2,double r){\n double VX = (vx1-vx2), X = (x1-x2), VY = (vy1-vy2), Y = (y1-y2);\n double a = pow2(VX) + pow2(VY), b = 2*(X*VX+Y*VY), c = pow2(X) + pow2(Y) - pow2(r);\n dd ret = dd(DINF,DINF);\n double D = b*b - 4 * a * c;\n\n if( LT(D,0.0) ) return ret;\n\n if( equals(a,0.0) ) {\n if( equals(b,0.0) ) return ret;\n if( LT(-c/b,0.0) ) return ret;\n ret.first = - c / b;\n return ret;\n }\n\n if( equals(D,0.0) ) D = 0;\n ret.first = ( -b - sqrt( D ) ) / ( 2 * a );\n ret.second = ( -b + sqrt( D ) ) / ( 2 * a );\n if( !equals(ret.first,ret.second) && ret.first > ret.second ) swap(ret.first,ret.second);\n return ret;\n}\n\n\nPoint c;\nPolygon poly,qoly;\n\n// type => 0 : CW, type => 1 : CCW\ndouble calc(Polygon &A,Polygon &B,int type){\n double ret = DINF;\n rep(i,A.size()){\n double cost = DINF;\n rep(j,B.size()){\n Vector e = ( B[j] - B[(j+1)%(int)B.size()] ) / abs( B[j] - B[(j+1)%(int)B.size()] );\n dd tmp = calc(c.x,c.y,0,0,\n B[j].x,B[j].y,e.x,e.y,abs(A[i]-c));\n vector<Point> vp;\n if( !equals(tmp.first ,DINF) ) vp.push_back(B[j]+e*tmp.first);\n if( !equals(tmp.second,DINF) ) vp.push_back(B[j]+e*tmp.second);\n rep(k,vp.size()) if( onSegment(B[j],B[(j+1)%(int)B.size()],vp[k]) ) {\n double theta = ccw_angle(A[i],c,vp[k]);\n cost = min(cost,(!type?theta:2*M_PI-theta));\n }\n }\n ret = min(ret,cost);\n }\n return ret;\n}\n\nvoid compute(){\n double mini = min(calc(poly,qoly,0),calc(qoly,poly,1));\n if( equals(mini,DINF) ) puts(\"360.0000000\");\n else printf(\"%.10lf\\n\",mini * 180.0 / M_PI); \n}\n\nint main(){\n int M,N;\n while( cin >> M >> N, M|N ){\n poly.resize(M); qoly.resize(N);\n rep(i,M) cin >> poly[i].x >> poly[i].y;\n rep(i,N) cin >> qoly[i].x >> qoly[i].y;\n cin >> c.x >> c.y;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1348,"score_of_the_acc":-0.1754,"final_rank":11},{"submission_id":"aoj_2045_1014584","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cassert>\n#include <algorithm>\n#include <complex>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\n#define EPS 1e-7\n#define INF 360\n#define PI M_PI\n\n\nint N, M;\n\ntypedef complex<double> Point;\n\nnamespace std{\n\tbool operator < (const Point &a, const Point &b){\n\t\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n\t}\n\tPoint operator / (const Point &p, const double &a){\n\t\treturn Point(real(p)/a, imag(p)/a);\n\t}\n\tPoint operator * (const Point &p, const double &a){\n\t\treturn Point(real(p) * a, imag(p)*a);\n\t}\n\tbool operator == (const Point &a, const Point &b){\n\t\treturn real(a) == real(b) && imag(a) == imag(b);\n\t}\n}\ntypedef vector<Point> Polygon;\nstruct Line : public vector<Point>{\n\tLine(){}\n\tLine (const Point &a, const Point &b){\n\t\tpush_back(a); push_back(b);\n\t}\n};\nstruct Circle{\n\tPoint c; double r;\n\tCircle(){}\n\tCircle(const Point &c, double r) : c(c), r(r){}\n};\n\ndouble distancePP(const Point &a, const Point &b){\n\treturn sqrt((real(a)-real(b))*(real(a)-real(b)) + (imag(a)-imag(b))*(imag(a)-imag(b)));\n}\n\ndouble cross(const Point &a, const Point &b){\n\treturn imag(conj(a)*b);\n}\n\ndouble dot(const Point &a, const Point &b){\n return real(conj(a) * b);\n}\n\nPoint projection(const Line &l, const Point &p){\n\tdouble t = dot(p-l[0], l[0] - l[1]) / norm(l[0]-l[1]);\n\treturn l[0] + t*(l[0]-l[1]);\n}\n\nvector<Point> crosspointLC(const Line &l, const Circle &c){\n\tvector<Point> ret;\n\tPoint center = projection(l, c.c);\n\tdouble d = abs(center - c.c);\n\tdouble t = sqrt(c.r * c.r - d*d);\n\tif(isnan(t)) return ret;\n\tPoint vect = (l[1] - l[0]);\n\tvect /= abs(vect);\n\tret.push_back(center - vect*t);\n\tret.push_back(center + vect * t);\n\treturn ret;\n}\n\nbool is_point_on_line(Point a, Point b, Point c) {\n\treturn abs(b-a) + EPS > max(abs(c-a), abs(c-b));\n}\n\ndouble calc(const Point &a, const Point &b, const Point &pp){\n\tdouble ta = arg(a-pp);\n\tdouble tb = arg(b-pp);\n\twhile (tb < ta + EPS) {\n\t\ttb += 2 * M_PI;\n\t}\n\treturn ((tb - ta)*180/PI);\n}\n\ndouble calc2(const Point &a, const Point &b, const Point &pp){\n\tdouble tb = arg(a-pp);\n\tdouble ta = arg(b-pp);\n\twhile (tb < ta + EPS) {\n\t\ttb += 2 * M_PI;\n\t}\n\treturn ((tb - ta)*180/PI);\n}\n\n\n\nint main(void){\n\tdouble cx, cy;\n\twhile(cin>>M>>N, M || N){\n\t\tPolygon out, in;\n\t\t\n\t\tfor(int i = 0; i < M; i++){\n\t\t\tdouble x, y;\n\t\t\tcin >> x >> y;\n\t\t\tout.push_back(Point(x, y));\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\tin.push_back(Point(x,y));\n\t\t}\n\t\tcin >> cx >> cy;\n\t\tdouble min_ans = INF;\n\t\tfor(int i = 0; i < in.size(); i++){\n\t\t\tPoint pp = Point(cx, cy);\n\t\t\tCircle c = Circle(pp, distancePP(pp, in[i]));\n\t\t\tfor(int j = 0; j < out.size(); j++){\n\t\t\t\tLine l = Line(out[(j+1)%out.size()], out[j]);\n\t\t\t\tvector<Point> cp = crosspointLC(l, c);\n\t\t\t\tif(cp.empty()) continue;\n\t\t\t\tdouble c1 = 360, c2 = 360;\n/*\ncout << real(in[i]) << \":\" << imag(in[i]) << \" and \"<< real(out[j]) << \":\" << imag(out[j]) << \" to \"<< real(out[j+1]) << \":\" << imag(out[j+1])<< endl;\ncout << real(cp[0]) << \":\" << imag(cp[0]) << \" and \"<< real(cp[1]) << \":\" << imag(cp[1]) << endl;\n*/\n\t\t\t\tif(is_point_on_line(out[(j+1)%out.size()], out[j], cp[0]))\n\t\t\t\t\tc1 = calc(in[i], cp[0], pp);\n\t\t\t\tif(is_point_on_line(out[(j+1)%out.size()], out[j], cp[1]))\n\t\t\t\t\tc2 = calc(in[i], cp[1], pp);\n//cout << \":\" << c1 << \" : \" << c2 << \" : \" << min_ans << endl;\n\t\t\t\tmin_ans = min(min_ans, min(c1, c2));\n\t\t\t}\n\t\t}\n\t\tswap(in, out);\n\t\tfor(int i = 0; i < in.size(); i++){\n\t\t\tPoint pp = Point(cx, cy);\n\t\t\tCircle c = Circle(pp, distancePP(pp, in[i]));\n\t\t\tfor(int j = 0; j < out.size(); j++){\n\t\t\t\tLine l = Line(out[(j+1)%out.size()], out[j]);\n\t\t\t\tvector<Point> cp = crosspointLC(l, c);\n\t\t\t\tif(cp.empty()) continue;\n\t\t\t\tdouble c1 = 360, c2 = 360;\n\t\t\t\tif(is_point_on_line(out[(j+1)%out.size()], out[j], cp[0]))\n\t\t\t\t\tc1 = calc2(in[i], cp[0], pp);\n\t\t\t\tif(is_point_on_line(out[(j+1)%out.size()], out[j], cp[1]))\n\t\t\t\t\tc2 = calc2(in[i], cp[1], pp);\n\t\t\t\tmin_ans = min(min_ans, min(c1, c2));\n\t\t\t}\n\t\t}\n\n\n\t\tprintf(\"%.9lf\\n\", min_ans);\n\t}\n\t\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1356,"score_of_the_acc":-0.1783,"final_rank":13},{"submission_id":"aoj_2045_815773","code_snippet":"#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\n\nusing namespace std;\ntypedef complex<double> Point;\nconst double EPS = 1e-6;\ndouble dot(Point a, Point b){\n return real(conj(a) * b);\n}\ndouble cross(Point a, Point b){\n return imag(conj(a) * b);\n}\nint ccw(Point a, Point b, Point c) {\n b -= a; c -= a;\n double len = abs(b) * abs(c); // 速さが気になるときは1にする\n if (cross(b, c) > +len * EPS) return +1; // 反時計回り\n if (cross(b, c) < -len * EPS) 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; // 点が線分ab上にある\n}\n\ndouble angle(Point a, Point b){\n double res = arg(conj(a) * b);\n if(res < 0) res += 2 * M_PI;\n return res;\n}\n\nstruct Line : public vector<Point> {\n Line(const Point& a, const Point& b) {\n push_back(a); push_back(b);\n }\n Point vector() const {\n return back() - front();\n }\n};\nstruct Circle {\n Point p;\n double r;\n Circle() {}\n Circle(Point p, double r) : p(p), r(r) { }\n};\nbool intersectSP(Line s, Point p) {\n return ccw(s[0], s[1], p) == 0;\n}\n\nPoint projection(Line l, Point p){\n double t = dot(p - l[0], l.vector()) / norm(l.vector());\n return l[0] + t * l.vector();\n}\n\nvector<Point> crosspointLC(const Line &l, const Circle &c) {\n vector<Point> res;\n Point center = projection(l, c.p);\n double d = abs(center - c.p);\n double tt = c.r * c.r - d * d;\n if(tt < 0 && tt > -EPS) tt = 0;\n if(tt < 0) return res;\n double t = sqrt(tt);\n Point vect = l.vector();\n vect /= abs(vect);\n res.push_back(center - vect * t);\n if (t > EPS) {\n res.push_back(center + vect * t);\n }\n return res;\n}\n\nvector<Point> crosspointSC(const Line &s, const Circle &c) {\n vector<Point> ret;\n vector<Point> nret = crosspointLC(s, c);\n for (int i = 0; i < nret.size(); i++) {\n if (intersectSP(s, nret[i])) ret.push_back(nret[i]);\n }\n return ret;\n}\n\nint main(){\n int M, N;\n while(cin >> M >> N && M){\n vector<Point> ps(M);\n vector<Point> qs(N);\n REP(i, M){\n double x, y;\n cin >> x >> y;\n ps[i] = Point(x, y);\n }\n REP(i, N){\n double x, y;\n cin >> x >> y;\n qs[i] = Point(x, y);\n }\n double cx, cy;\n cin >> cx >> cy;\n Point cp(cx, cy);\n double ans = 2.0 * M_PI;\n for(int i = 0; i < N; i++){\n Circle C(cp, abs(qs[i] - cp)); // qs[i]の軌道\n for(int j = 0; j < M; j++){\n Line s(ps[j], ps[(j == M - 1 ? 0 : j + 1)]);\n vector<Point> crosspv = crosspointSC(s, C);\n for(Point crossp : crosspv){\n //cout << \"Circle : \" << C.p << \" \" << C.r << \" cross with \" << s[0] << \" \" << s[1] << \" at \" << crossp << endl;\n ///cout << \"angle : \" << angle(qs[i] - cp, crossp - cp) << endl;\n ans = min(ans, angle(qs[i] - cp, crossp - cp));\n }\n }\n }\n for(int i = 0; i < M; i++){\n Circle C(cp, abs(ps[i] - cp)); // ps[i]の軌道\n for(int j = 0; j < N; j++){\n Line s(qs[j], qs[(j == N - 1 ? 0 : j + 1)]);\n vector<Point> crosspv = crosspointSC(s, C);\n for(Point crossp : crosspv){\n //cout << \"Circle : \" << C.p << \" \" << C.r << \" cross with \" << s[0] << \" \" << s[1] << \" at \" << crossp << endl;\n //cout << \"angle : \" << angle(crossp - cp, ps[i] - cp) << endl;\n ans = min(ans, angle(crossp - cp, ps[i] - cp));\n }\n }\n }\n printf(\"%.7f\\n\", ans / M_PI * 180.0);\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1336,"score_of_the_acc":-0.1742,"final_rank":10},{"submission_id":"aoj_2045_729090","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <complex>\n#include <cmath>\n#include <cstdio>\n#include <vector>\nusing namespace std;\n\ntypedef complex<double> P;\ntypedef pair<P,P> L;\n\nconst double EPS = 1e-8;\n\nstruct C{\n P c;\n double r;\n C(P c=P(0,0), double r=0.0):c(c),r(r){}\n};\n\ndouble dot(P a, P b){return real(conj(a)*b);}\ndouble cross(P a, P b){return imag(conj(a)*b);}\nbool equal(double a, double b){return fabs(a-b) < EPS;}\n\nP proj(P p, L l){\n return l.first + dot(p - l.first, l.second - l.first) / norm(l.second - l.first) * (l.second - l.first);\n}\n\nbool isInterSP(L s, P p){\n if(dot(s.second - s.first, p - s.first) < -EPS) return equal(0.0, abs(p-s.first));\n if(dot(s.first - s.second, p - s.second) < - EPS) return equal(0.0, abs(p-s.second));\n return equal(0.0, abs(cross(s.second - s.first, p - s.first) / abs(s.second - s.first)));\n}\n\nvector<P> getInterCS(C c, L s){\n vector<P> res;\n P h = proj(c.c, s);\n double d = abs(c.c - h);\n if(d > c.r + EPS);\n else if(d > c.r - EPS){\n if(isInterSP(s, h)) res.push_back(h);\n } else {\n P v = s.second - s.first;\n v = (sqrt(c.r*c.r - d*d) / abs(v)) * v;\n if(isInterSP(s, h+v)) res.push_back(h+v);\n if(isInterSP(s, h-v)) res.push_back(h-v);\n }\n return res;\n}\n\nint n,m;\nvector<P> v[2];\nP ce;\n\ndouble calc(P a, P b1, P b2){\n double res = arg(b2-a) - arg(b1-a);\n res *= 180.0 / M_PI;\n while(res < 0) res += 360.0;\n while(res > 360.0) res -= 360.0;\n return res;\n}\n\nvoid solve(){\n double ans = 360.0;\n for(int i=0;i<m;i++){\n C c = C(ce, abs(ce-v[1][i]));\n for(int j=0;j<n;j++){\n L l = L(v[0][j], v[0][(j+1)%n]);\n vector<P> cp = getInterCS(c, l);\n for(int k=0;k<cp.size();k++)\n\tans = min(ans, calc(ce, v[1][i], cp[k]));\n }\n }\n\n for(int i=0;i<n;i++){\n C c = C(ce, abs(ce-v[0][i]));\n for(int j=0;j<m;j++){\n L l = L(v[1][j], v[1][(j+1)%m]);\n vector<P> cp = getInterCS(c, l);\n for(int k=0;k<cp.size();k++)\n\tans = min(ans, calc(ce, cp[k], v[0][i]));\n }\n }\n\n\n printf(\"%.7f\\n\",ans);\n}\n\nint main(){\n while(cin >> n >> m && (n|m)){\n double x,y;\n for(int i=0;i<2;i++) v[i].clear();\n for(int i=0;i<n;i++){\n cin >> x >> y;\n v[0].push_back(P(x,y));\n }\n for(int i=0;i<m;i++){\n cin >> x >> y;\n v[1].push_back(P(x,y));\n }\n cin >> x >> y;\n ce = P(x,y);\n solve();\n }\n}","accuracy":1,"time_ms":10,"memory_kb":1352,"score_of_the_acc":-0.1737,"final_rank":9},{"submission_id":"aoj_2045_665618","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 <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()\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)\nconst int INF = 1<<29;\nconst double EPS = 1e-8;\nconst double PI = acos(-1);\ntypedef pair<int,int> pii;\ntypedef long long ll;\n\n\ntypedef complex<double> P;\nnamespace std {\n bool operator < (const P& a, const P& b) {\n // if (abs(a-b)<EPS) return 0;\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n }\n}\ndouble cross(const P& a, const P& b) {\n return imag(conj(a)*b);\n}\ndouble dot(const P& a, const P& b) {\n return real(conj(a)*b);\n}\nstruct L : public vector<P> {\n L(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n L() {}\n};\ntypedef vector<P> G;\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\nstruct C {\n P p; double r;\n C(const P &p, double r) : p(p), r(r) { }\n};\n\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > 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\n return 0;\n}\n\nP rotate(const P &p, double ang) {\n return p * P(cos(ang), sin(ang));\n}\n\nP projection(const L &l, const P &p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\nbool intersectSP(const L &s, const P &p) {\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\n}\n\nP 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]; // same line\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m[0] + B / A * (m[1] - m[0]);\n}\n\n\nvector<P> crosspointLC(const L &l, const C &c) {\n vector<P> ret;\n P center = projection(l, c.p);\n double d = abs(center - c.p);\n double t = sqrt(c.r * c.r - d * d);\n if (isnan(t)) { return ret; }\n P vect = (l[1] - l[0]);\n vect /= abs(vect);\n ret.push_back(center - vect * t);\n if (t > EPS) {\n ret.push_back(center + vect * t);\n }\n return ret;\n}\n\nvector<P> crosspointSC(const L &s, const C &c) {\n vector<P> ret;\n vector<P> nret = crosspointLC(s, c);\n FOR(it, nret)\n if (intersectSP(s, *it))\n ret.push_back(*it);\n return ret;\n}\n\ndouble angle(const P &a, const P &b) { // テ」ツδ凖」ツつッテ」ツδ暗」ツδォテッツスツ?」ツ?凝」ツつ嘉」ツ?ソテ」ツ?淌」ツδ凖」ツつッテ」ツδ暗」ツδォテッツスツづ」ツ?ョティツァツ津・ツコツヲテ」ツ?ョティツィツ暗ァツョツ夕0,2pi)\n double ret = arg(b)-arg(a);\n return (ret>=0) ? ret : ret + 2*PI;\n}\n\nP p[10];\nP q[10];\nP c;\nint main() {\n int m,n;\n while(cin >> m >> n, m||n) {\n REP(i,m) cin >> p[i].real() >> p[i].imag(); \n REP(i,n) cin >> q[i].real() >> q[i].imag();\n cin >> c.real() >> c.imag();\n double ans = 2*PI;\n REP(i,n) {\n REP(j,m) {\n vector<P> ps = crosspointSC(L(p[j],p[(j+1)%m]), C(c,abs(q[i]-c)));\n FOR(it, ps) {\n chmin(ans, angle(q[i]-c,*it-c));\n }\n ps = crosspointSC(L(q[i],q[(i+1)%n]), C(c,abs(p[j]-c)));\n FOR(it, ps) {\n chmin(ans, angle(*it-c,p[j]-c));\n }\n }\n }\n printf(\"%.10f\\n\", ans*180/PI);\n }\n}","accuracy":1,"time_ms":20,"memory_kb":1352,"score_of_the_acc":-0.1769,"final_rank":12},{"submission_id":"aoj_2045_657321","code_snippet":"#include<algorithm>\n#include<complex>\n#include<cstdio>\n#include<iostream>\n#include<queue>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\ntemplate<class T> T at(vector<T> v, int i) {return v[i % v.size()];}\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;\nconst D PI = acos(-1);\n\nint sig(D a, D b = 0) {return a < b - EPS ? -1 : a > b + EPS ? 1 : 0;}\nbool near(P a, P b) {return norm(a - b) < EPS;}\n\n// 比較関数\nnamespace std {\n bool operator<(P a, P b) {return sig(a.X, b.X) ? a.X < b.X : a.Y < b.Y;}\n}\n\nD sr(D a) {return sqrt(max(a, (D)0));}\n\n// 内積\nD dot(P a, P b) {return a.X * b.X + a.Y * b.Y;}\n// 外積\nD det(P a, P b) {return a.X * b.Y - a.Y * b.X;}\n\n// 線分のベクトル\nP vec(L a) {return a.b - a.a;}\n\n// 線分abに対する点cの位置\nenum CCW{FRONT = 1, RIGHT = 2, BACK = 4, LEFT = 8, ON = 16};\nint ccw(P a, P b, P c) {\n if (a == c || b == c) return ON;\n int s = sig(det(b - a, c - a));\n if (s) return s > 0 ? LEFT : RIGHT;\n return (a < b) == (b < c) ? FRONT : (c < a) == (a < b) ? BACK : ON;\n}\n\n// 有向角度\nD arg(P base, P a, P b) {\n D ang = arg((b - base) / (a - base));\n return ang > 0 ? ang : ang + 2 * PI;\n}\n\n// 射影\nP proj(P a, P b) {return a * dot(a, b) / norm(a);}\nP perp(L l, P p) {return l.a + proj(vec(l), p - l.a);}\n\n// 交点\nP pLL(L a, L b) {return a.a + vec(a) * (det(vec(b), b.a - a.a) / det(vec(b), vec(a)));}\n\n// 距離\nD dLP(L l, P p) {return abs(det(vec(l), p - l.a)) / abs(vec(l));}\n\n// 円\nstruct C{P c; D r;};\n\n// 交差判定\nbool iCL(C c, L l) {return sig(c.r, dLP(l, c.c)) >= 0;}\n\n// 交点\npair<P, P> pCL(C c, L l) {\n P x = perp(l, c.c);\n P y = vec(l) / abs(vec(l)) * sr(c.r * c.r - norm(x - c.c));\n return make_pair(x - y, x + y);\n}\n\nint main() {\n while (true) {\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0) break;\n Pol p(n), q(m);\n rep (i, n) cin >> p[i].X >> p[i].Y;\n rep (i, m) cin >> q[i].X >> q[i].Y;\n P c;\n cin >> c.X >> c.Y;\n D res = 2 * PI;\n rep (i, n) {\n\tif (near(c, p[i])) continue;\n\tC a = (C){c, abs(c - p[i])};\n\trep (j, m) {\n\t L s = (L){q[j], at(q, j + 1)};\n\t if (!iCL(a, s)) continue;\n\t pair<P, P> pp = pCL(a, s);\n\t if (ccw(s.a, s.b, pp.first) == ON) {\n\t res = min(res, arg(c, pp.first, p[i]));\n\t }\n\t if (ccw(s.a, s.b, pp.second) == ON) {\n\t res = min(res, arg(c, pp.second, p[i]));\n\t }\n\t}\n }\n swap(n, m);\n swap(p, q);\n rep (i, n) {\n\tif (near(c, p[i])) continue;\n\tC a = (C){c, abs(c - p[i])};\n\trep (j, m) {\n\t L s = (L){q[j], at(q, j + 1)};\n\t if (!iCL(a, s)) continue;\n\t pair<P, P> pp = pCL(a, s);\n\t if (ccw(s.a, s.b, pp.first) == ON) {\n\t res = min(res, arg(c, p[i], pp.first));\n\t }\n\t if (ccw(s.a, s.b, pp.second) == ON) {\n\t res = min(res, arg(c, p[i], pp.second));\n\t }\n\t}\n }\n printf(\"%.12Lf\\n\", res * 180 / PI);\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1280,"score_of_the_acc":-0.1537,"final_rank":4},{"submission_id":"aoj_2045_657320","code_snippet":"#include<algorithm>\n#include<complex>\n#include<cstdio>\n#include<iostream>\n#include<queue>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\ntemplate<class T> T at(vector<T> v, int i) {return v[i % v.size()];}\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;\nconst D PI = acos(-1);\n\nint sig(D a, D b = 0) {return a < b - EPS ? -1 : a > b + EPS ? 1 : 0;}\nbool near(P a, P b) {return norm(a - b) < EPS;}\n\n// テヲツッツ氾ィツシツεゥツ鳴「テヲツ閉ー\nnamespace std {\n bool operator<(P a, P b) {return sig(a.X, b.X) ? a.X < b.X : a.Y < b.Y;}\n bool operator<(L a, L b) {return !near(a.a, b.a) ? a.a < b.a : a.b < b.b;}\n}\n\nD sr(D a) {return sqrt(max(a, (D)0));}\n\n// テ・ツ??ァツゥツ?\nD dot(P a, P b) {return a.X * b.X + a.Y * b.Y;}\n// テ・ツ、ツ姪ァツゥツ?\nD det(P a, P b) {return a.X * b.Y - a.Y * b.X;}\n\n// テァツキツ堙・ツ按?」ツ?ョテ」ツδ凖」ツつッテ」ツδ暗」ツδォ\nP vec(L a) {return a.b - a.a;}\n\n// テァツキツ堙・ツ按?bテ」ツ?ォテ・ツッツセテ」ツ?凖」ツつ凝ァツつケcテ」ツ?ョテ、ツスツ催ァツスツョ\nenum CCW{FRONT = 1, RIGHT = 2, BACK = 4, LEFT = 8, ON = 16};\nint ccw(P a, P b, P c) {\n if (a == c || b == c) return ON;\n int s = sig(det(b - a, c - a));\n if (s) return s > 0 ? LEFT : RIGHT;\n return (a < b) == (b < c) ? FRONT : (c < a) == (a < b) ? BACK : ON;\n}\n\n// テヲツ慊嘉・ツ青妥ィツァツ津・ツコツヲ\nD arg(P base, P a, P b) {\n D ang = arg((b - base) / (a - base));\n return ang > 0 ? ang : ang + 2 * PI;\n}\nL sortBase;\nbool lessArg(P a, P b) {\n D ang1 = arg(sortBase.a, sortBase.b, a);\n D ang2 = arg(sortBase.a, sortBase.b, b);\n return sig(ang1, ang2) ? ang1 < ang2 : norm(a) > norm(b);\n}\n\n// テ・ツーツ?・ツスツア\nP proj(P a, P b) {return a * dot(a, b) / norm(a);}\nP perp(L l, P p) {return l.a + proj(vec(l), p - l.a);}\nP refl(L l, P p) {return perp(l, p) * (D)2 - p;}\n\n// テ、ツコツ、テ・ツキツョテ・ツ按、テ・ツョツ?\nbool eqL(L a, L b) {return !sig(det(vec(a), vec(b))) && !sig(det(vec(a), b.a - a.a));}\nbool iLL(L a, L b) {return sig(det(vec(a), vec(b))) || !sig(det(vec(a), b.a - a.a));}\nbool iLLs(L a, L b) {return sig(det(vec(a), vec(b)));}\nbool iLS(L a, L b) {return sig(det(vec(a), b.a - a.a)) * sig(det(vec(a), b.b - a.a)) <= 0;}\nbool iLSs(L a, L b) {return sig(det(vec(a), b.a - a.a)) * sig(det(vec(a), b.b - a.a)) < 0;}\nbool iSS(L a, L b) {\n int cwa = ccw(a.a, a.b, b.a) | ccw(a.a, a.b, b.b);\n int cwb = ccw(b.a, b.b, a.a) | ccw(b.a, b.b, a.b);\n return ((cwa | cwb) & ON) || ((cwa & cwb) == (LEFT | RIGHT));\n}\nbool iSSs(L a, L b) {\n int cwa = ccw(a.a, a.b, b.a) | ccw(a.a, a.b, b.b);\n int cwb = ccw(b.a, b.b, a.a) | ccw(b.a, b.b, a.b);\n return (cwa & cwb) == (LEFT | RIGHT);\n}\n\n// テ、ツコツ、テァツつケ\nP pLL(L a, L b) {return a.a + vec(a) * (det(vec(b), b.a - a.a) / det(vec(b), vec(a)));}\n\n// ティツキツ敕ゥツ崢「\nD dLP(L l, P p) {return abs(det(vec(l), p - l.a)) / abs(vec(l));}\nD dSP(L s, P p) {\n if (dot(vec(s), p - s.a) < 0) return abs(p - s.a);\n if (dot(vec(s), p - s.b) > 0) return abs(p - s.b);\n return dLP(s, p);\n}\nD dLL(L a, L b) {return iLL(a, b) ? 0 : dLP(a, b.a);}\nD dLS(L a, L b) {return iLS(a, b) ? 0 : min(dLP(a, b.a), dLP(a, b.b));}\nD dSS(L a, L b) {return iSS(a, b) ? 0 : min(min(dSP(a, b.a), dSP(a, b.b)), min(dSP(b, a.a), dSP(b, a.b)));}\n\n// テ・ツ??\nstruct C{P c; D r;};\n\n// 2テ・ツ??」ツ?ョテ、ツスツ催ァツスツョテゥツ鳴「テ、ツソツ?\nenum RELATION{SAME = 1, CONTAIN = 2, OVER = 4, NO_CROSS = 8, ONE_CROSS = 16, ONE_CONTAIN_CROSS = 32, ONE_OVER_CROSS = 64, TWO_CROSS = 128};\nint cRel(C c1, C c2) {\n D d = abs(c1.c - c2.c);\n if (near(c1.c, c2.c) && !sig(c1.r, c2.r)) return SAME;\n if (sig(d, c1.r - c2.r) < 0) return OVER;\n if (sig(d, c2.r - c1.r) < 0) return CONTAIN;\n if (!sig(d, c1.r - c2.r)) return ONE_OVER_CROSS;\n if (!sig(d, c2.r - c1.r)) return ONE_CONTAIN_CROSS;\n if (!sig(d, c1.r + c2.r)) return ONE_CROSS;\n if (sig(d, c1.r + c2.r) > 0) return NO_CROSS;\n return TWO_CROSS;\n}\n\n// テ、ツコツ、テ・ツキツョテ・ツ按、テ・ツョツ?\nbool iCP(C c, P p) {return sig(abs(p - c.c), c.r) <= 0;}\nbool iCL(C c, L l) {return sig(c.r, dLP(l, c.c)) >= 0;}\nbool iCS(C c, L s) {return sig(c.r, dSP(s, c.c)) >= 0;}\nbool iCSc(C c, L s) {return iCS(c, s) && sig(c.r, max(abs(s.a - c.c), abs(s.b - c.c))) >= 0;}\nbool iCC(C a, C b) {return sig(abs(a.c - b.c), a.r + b.r) <= 0;}\nbool iCCc(C a, C b) {return iCC(a, b) && sig(abs(a.c - b.c), abs(a.r - b.r)) >= 0;}\n\n// テ、ツコツ、テァツつケ\npair<P, P> pCC(C a, C b) {\n D x = (norm(a.c - b.c) + a.r * a.r - b.r * b.r) / (2 * abs(a.c - b.c));\n P e = (b.c - a.c) / abs(b.c - a.c);\n P y = e * P(0, sr(a.r * a.r - x * x));\n return make_pair(a.c + e * x - y, a.c + e * x + y);\n}\npair<P, P> pCL(C c, L l) {\n P x = perp(l, c.c);\n P y = vec(l) / abs(vec(l)) * sr(c.r * c.r - norm(x - c.c));\n return make_pair(x - y, x + y);\n}\n\n// ティツァツ津」ツ?ョテ・ツ??・ツ、ツ姪・ツ按、テ・ツョツ?ティツァツ誕bテ」ツ?ョテ・ツ??ゥツδィテ」ツ?ォテ」ツ?づ」ツつ古」ツ?ーテヲツュツ」テ」ツ??ィツセツコテ、ツクツ甘」ツ?ッ0テ」ツ??・ツ、ツ姪ゥツδィテ」ツ?ッティツイツ?\nint sAP(P a, P b, P c) {return sig(det(a, c)) - sig(det(b, c)) - sig(det(a, b));}\n\n// テ・ツ、ツ堙ィツァツ津・ツスツ「テ」ツ?ョテゥツ敖「テァツゥツ?\nD aPol(Pol vp) {\n D ret = 0;\n rep (i, vp.size()) ret += det(vp[i], at(vp, i + 1));\n return ret / 2;\n}\n\n// テ・ツ、ツ堙ィツァツ津・ツスツ「テ」ツ?ョテ・ツ??・ツ、ツ姪・ツ按、テ・ツョツ?テ・ツ??ゥツδィ:1テ」ツ??・ツ堕ィテ、ツクツ?0テ」ツ??・ツ、ツ姪ゥツδィ:-1\nint sGP(Pol pol, P p) {\n int side = -1;\n rep (i, pol.size()) {\n P p0 = pol[i] - p, p1 = at(pol, i + 1) - p;\n if (ccw(p0, p1, 0) == ON) return 0;\n if (p0.Y > p1.Y) swap(p0, p1);\n if (sig(p0.Y) <= 0 && 0 < sig(p1.Y) && sig(det(p0, p1)) > 0) side *= -1;\n }\n return side;\n}\n\n// テ・ツ?クテ・ツ個?\nPol convexHull(Pol p) {\n int m = -1, n = p.size();\n if (n < 3) return p;\n vector<P> q(n * 2);\n sort(p.begin(), p.end());\n for (int i = 0; i < n; q[++m] = p[i++])\n for (; m > 0 && ccw(q[m - 1], q[m], p[i]) != LEFT; --m);\n for (int i = n - 2, r = m; i >= 0; q[++m] = p[i--])\n for (; m > r && ccw(q[m - 1], q[m], p[i]) != LEFT; --m);\n q.resize(m);\n return q;\n}\n\n// テ・ツ?クテ・ツ個?」ツつォテ」ツδε」ツδ?\nPol convexCut(Pol p, L l) {\n vector<P> q;\n rep (i, p.size()) {\n if (ccw(l.a, l.b, p[i]) != RIGHT) q.push_back(p[i]);\n L s = {p[i], at(p, i + 1)};\n if (iLSs(l, s)) q.push_back(pLL(l, s));\n }\n return q;\n}\n\n// テァツキツ堙・ツ按?」ツつ津」ツδ榲」ツδシテ」ツつクテ」ツ?凖」ツつ?\nvector<L> merge(vector<L> s) {\n rep (i, s.size()) if (s[i].b < s[i].a) swap(s[i].a, s[i].b);\n sort(s.begin(), s.end());\n rep (i, s.size()) rep (j, i) if (iSS(s[i], s[j]) && !iLL(s[i], s[j])) {\n s[j].b = max(s[i].b, s[j].b);\n s.erase(s.begin() + i--);\n break;\n }\n return s;\n}\n\n// テァツキツ堙・ツ按?」ツつ「テ」ツδャテ」ツδウテ」ツつクテ」ツδ。テ」ツδウテ」ツδ?テゥツ堋」テ」ツ?ョテァツつケテ」ツ?クテ」ツ?ョティツセツコテ」ツ?ョテ」ツ?ソテ」ツつ津ヲツ個?」ツ?、\nvector<vector<int> > sArr(vector<L> s, vector<P> &vp) {\n s = merge(s);\n rep (i, s.size()) {\n vp.push_back(s[i].a);\n vp.push_back(s[i].b);\n }\n rep (i, s.size()) rep (j, i) if (iSS(s[i], s[j])) vp.push_back(pLL(s[i], s[j]));\n sort(vp.begin(), vp.end());\n vp.erase(unique(vp.begin(), vp.end(), near), vp.end());\n vector<vector<int> > g(vp.size());\n rep (i, s.size()) {\n vector<pair<D, int> > v;\n rep (j, vp.size()) if (ccw(s[i].a, s[i].b, vp[j]) == ON) {\n v.push_back(make_pair(norm(vp[j] - s[i].a), j));\n }\n sort(v.begin(), v.end());\n rep (j, v.size() - 1) {\n g[v[j + 1].second].push_back(v[j].second);\n g[v[j].second].push_back(v[j + 1].second);\n }\n }\n return g;\n}\n\nint main() {\n while (true) {\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0) break;\n Pol p(n), q(m);\n rep (i, n) cin >> p[i].X >> p[i].Y;\n rep (i, m) cin >> q[i].X >> q[i].Y;\n P c;\n cin >> c.X >> c.Y;\n D res = 2 * PI;\n rep (i, n) {\n\tif (near(c, p[i])) continue;\n\tC a = (C){c, abs(c - p[i])};\n\trep (j, m) {\n\t L s = (L){q[j], at(q, j + 1)};\n\t if (!iCL(a, s)) continue;\n\t pair<P, P> pp = pCL(a, s);\n\t if (ccw(s.a, s.b, pp.first) == ON) {\n\t res = min(res, arg(c, pp.first, p[i]));\n\t }\n\t if (ccw(s.a, s.b, pp.second) == ON) {\n\t res = min(res, arg(c, pp.second, p[i]));\n\t }\n\t}\n }\n swap(n, m);\n swap(p, q);\n rep (i, n) {\n\tif (near(c, p[i])) continue;\n\tC a = (C){c, abs(c - p[i])};\n\trep (j, m) {\n\t L s = (L){q[j], at(q, j + 1)};\n\t if (!iCL(a, s)) continue;\n\t pair<P, P> pp = pCL(a, s);\n\t if (ccw(s.a, s.b, pp.first) == ON) {\n\t res = min(res, arg(c, p[i], pp.first));\n\t }\n\t if (ccw(s.a, s.b, pp.second) == ON) {\n\t res = min(res, arg(c, p[i], pp.second));\n\t }\n\t}\n }\n printf(\"%.12Lf\\n\", res * 180 / PI);\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1292,"score_of_the_acc":-0.1581,"final_rank":5},{"submission_id":"aoj_2045_565636","code_snippet":"#include <cstdio>\n#include <complex>\n#include <cmath>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\ntypedef complex<double> P;\ntypedef const P &rP;\n\ndouble pi2;\n\nvector<double> intrarg(rP s, double r, rP p, rP q){\n\tvector<double> ret;\n\tP v = q - p;\n\tP w = p - s;\n\tdouble a = norm(v);\n\tdouble b = real(v) * real(w) + imag(v) * imag(w);\n\tdouble c = norm(w) - r * r;\n\tdouble D = b * b - a * c;\n\tdouble t;\n\tif(D >= 0.0){\n\t\tD = sqrt(D);\n\t\tfor(double sgn = -1.0; sgn < 2.0; sgn += 2.0){\n\t\t\tt = (-b + sgn * D) / a;\n\t\t\tif(t > 0.0 && t < 1.0){\n\t\t\t\tret.push_back(arg(w + t * v));\n\t\t\t}\n\t\t}\n\t}\n\treturn ret;\n}\n\ndouble difarg(double a, double b){\n\ta -= b;\n\twhile(a < 0.0) a += pi2;\n\twhile(a >= pi2) a -= pi2;\n\treturn a;\n}\n\nint main(){\n\tpi2 = acos(-1.0) * 2.0;\n\t\n\tint m, n;\n\tdouble x, y;\n\twhile(scanf(\"%d%d\", &m, &n), m){\n\t\tvector<P> p(m + 1), q(n + 1);\n\t\tfor(int i = 0; i < m; ++i){\n\t\t\tscanf(\"%lf%lf\", &x, &y);\n\t\t\tp[i] = P(x, y);\n\t\t}\n\t\tp[m] = p[0];\n\t\tfor(int i = 0; i < n; ++i){\n\t\t\tscanf(\"%lf%lf\", &x, &y);\n\t\t\tq[i] = P(x, y);\n\t\t}\n\t\tq[n] = q[0];\n\t\tscanf(\"%lf%lf\", &x, &y);\n\t\tP c(x, y);\n\n\t\tdouble ans = pi2;\n\n\t\tfor(int i = 0; i < n; ++i){\n\t\t\tdouble r1 = abs(q[i] - c);\n\t\t\tdouble base1 = arg(q[i] - c);\n\t\t\tfor(int j = 0; j < m; ++j){\n\t\t\t\tdouble r2 = abs(p[j] - c);\n\t\t\t\tdouble base2 = arg(p[j] - c);\n\n\t\t\t\tvector<double> ret = intrarg(c, r1, p[j], p[j+1]);\n\t\t\t\tfor(int k = 0; k < ret.size(); ++k){\n\t\t\t\t\tans = min(ans, difarg(ret[k], base1));\n\t\t\t\t}\n\n\t\t\t\tret = intrarg(c, r2, q[i], q[i+1]);\n\t\t\t\tfor(int k = 0; k < ret.size(); ++k){\n\t\t\t\t\tans = min(ans, difarg(base2, ret[k]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%.9f\\n\", ans / pi2 * 360.0);\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":1212,"score_of_the_acc":-0.1226,"final_rank":2},{"submission_id":"aoj_2045_406504","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\nconst double EPS=1e-9;\nconst double PI=acos(-1);\n\ntemplate<class T>\nstruct point{\n\tT x,y;\n\tpoint operator+(const point &a)const{ return (point){x+a.x,y+a.y}; }\n\tpoint operator-(const point &a)const{ return (point){x-a.x,y-a.y}; }\n};\n\ntemplate<class T>\npoint<T> operator*(T c,const point<T> &a){ return (point<T>){c*a.x,c*a.y}; }\n\ntemplate<class T>\npoint<double> operator/(const point<T> &a,double c){\n\treturn (point<double>){a.x/c,a.y/c};\n}\n\nbool operator<(const point<double> &a,const point<double> &b){\n\treturn a.x+EPS<b.x || abs(a.x-b.x)<EPS && a.y+EPS<b.y;\n}\n\ntemplate<class T>\nstruct line{ point<T> a,b; };\n\ntemplate<class T>\nstruct segment{\n\tpoint<T> a,b;\n\toperator line<T>()const{ return (line<T>){a,b}; }\n};\n\ntemplate<class T>\nstruct polygon:vector< point<T> >{\n\tpolygon(){}\n\tpolygon(int n):vector< point<T> >(n){}\n};\n\ntemplate<class T>\nT dot(const point<T> &a,const point<T> &b){ return a.x*b.x+a.y*b.y; }\n\ntemplate<class T>\nT cross(const point<T> &a,const point<T> &b){ return a.x*b.y-a.y*b.x; }\n\npoint<double> rot(const point<double> &a,double theta){\n\treturn (point<double>){a.x*cos(theta)-a.y*sin(theta),a.x*sin(theta)+a.y*cos(theta)};\n}\n\nenum {CCW=1,CW=-1,ON=0};\nint ccw(const point<double> &a,const point<double> &b,const point<double> &c){\n\tdouble rdir=cross(b-a,c-a);\n\tif(rdir> EPS) return CCW;\n\tif(rdir<-EPS) return CW;\n\treturn ON;\n}\n\nbool cover(const polygon<double> &G,const point<double> &p){\n\tint n=G.size();\n\tbool res=false;\n\trep(i,n){\n\t\tpoint<double> v1=G[i]-p,v2=G[(i+1)%n]-p;\n\t\tif(v1.y>v2.y) swap(v1,v2);\n\t\tif(v1.y<EPS && EPS<v2.y && cross(v1,v2)>EPS) res=!res;\n\t\tif(abs(cross(v1,v2))<EPS && dot(v1,v2)<EPS) return true;\n\t}\n\treturn res;\n}\n\nbool intersect(const segment<double> &S1,const segment<double> &S2){\n\tif(max(S1.a.x,S1.b.x)+EPS<min(S2.a.x,S2.b.x)\n\t|| max(S1.a.y,S1.b.y)+EPS<min(S2.a.y,S2.b.y)\n\t|| max(S2.a.x,S2.b.x)+EPS<min(S1.a.x,S1.b.x)\n\t|| max(S2.a.y,S2.b.y)+EPS<min(S1.a.y,S1.b.y)) return false;\n\treturn ccw(S1.a,S1.b,S2.a)*ccw(S1.a,S1.b,S2.b)<=0\n\t\t&& ccw(S2.a,S2.b,S1.a)*ccw(S2.a,S2.b,S1.b)<=0;\n}\n\npoint<double> get_intersect(const line<double> &L1,const line<double> &L2){\n\tdouble a1=cross(L1.b-L1.a,L2.b-L2.a);\n\tdouble a2=cross(L1.b-L1.a,L1.b-L2.a);\n\tif(abs(a1)<EPS) return L1.a;\n\treturn L2.a+a2/a1*(L2.b-L2.a);\n}\n\nbool cover(const polygon<double> &G,const polygon<double> &H){\n\tint m=G.size(),n=H.size();\n\n\trep(i,n){\n\t\tif(!cover(G,H[i])) return false;\n\n\t\tsegment<double> S={H[i],H[(i+1)%n]};\n\n\t\tvector< point<double> > cand; // H の辺 i と G との交点全体\n\t\tcand.push_back(S.a);\n\t\tcand.push_back(S.b);\n\t\trep(j,m){\n\t\t\tsegment<double> T={G[j],G[(j+1)%m]};\n\t\t\tif(intersect(S,T)){\n\t\t\t\tcand.push_back(get_intersect(S,T));\n\t\t\t}\n\t\t}\n\n\t\tsort(cand.begin(),cand.end());\n\t\trep(j,(int)cand.size()-1){\n\t\t\tpoint<double> p=(cand[j]+cand[j+1])/2;\n\t\t\tif(!cover(G,p)) return false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nint main(){\n\tfor(int m,n;scanf(\"%d%d\",&m,&n),m;){\n\t\tpolygon<double> G(m),H(n);\n\t\trep(i,m) scanf(\"%lf%lf\",&G[i].x,&G[i].y);\n\t\trep(i,n) scanf(\"%lf%lf\",&H[i].x,&H[i].y);\n\t\tpoint<double> c;\n\t\tscanf(\"%lf%lf\",&c.x,&c.y);\n\n\t\tpolygon<double> H2(n);\n\t\tint deg;\n\t\tfor(deg=1;deg<360;deg++){\n\t\t\trep(i,n) H2[i]=rot(H[i]-c,deg*PI/180)+c;\n\t\t\tif(!cover(G,H2)) break;\n\t\t}\n\n\t\tdouble lo=(deg-1)*PI/180,hi=deg*PI/180;\n\t\trep(_,30){\n\t\t\tdouble mi=(lo+hi)/2;\n\t\t\trep(i,n) H2[i]=rot(H[i]-c,mi)+c;\n\t\t\tif(cover(G,H2)) lo=mi; else hi=mi;\n\t\t}\n\t\tprintf(\"%.9f\\n\",(lo+hi)/2*180/PI);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":410,"memory_kb":876,"score_of_the_acc":-0.1258,"final_rank":3},{"submission_id":"aoj_2045_131631","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<complex>\n#include<vector>\n#include<cmath>\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define NEXT(i,n) ((i+1)%(n))\n#define mp make_pair\n#define pb push_back\nusing namespace std;\n\ntypedef complex<double> P;\n\nconst double pi = acos(-1);\n\npair<double,double> check(double dx,double dy,double rx,double ry,double r,\n\t\t\t bool &flag){\n double a=(dx*dx+dy*dy),b=-2*rx*dx-2*ry*dy,c=rx*rx+ry*ry-r*r;\n double D=b*b-4*a*c;\n if (D < 0)return mp(-1,-1);\n flag=true;\n return mp((-b-sqrt(D))/(2*a),(-b+sqrt(D))/(2*a));\n}\n\ninline P getnorm(P a){\n return a/abs(a);\n}\n\nbool isp(P a,P b,P c){\n return abs(a-c)+abs(b-c) < abs(a-b)+1e-10;\n}\n\n\nvoid getdata(vector<P> &p,vector<P> &e,vector<double> &a,bool flag){\n rep(i,p.size()){\n double r = abs(p[i]);\n double ori=arg(p[i]);\n rep(j,e.size()){\n bool cansolve=false;\n P norm=getnorm(e[NEXT(j,e.size())]-e[j]);\n pair<double,double> tmp=check(norm.real(),norm.imag(),-e[j].real(),-e[j].imag(),r,cansolve);\n if (!cansolve)continue;\n rep(k,2){\n\tP point=e[j]+tmp.first*norm;\n\tif (isp(e[j],e[NEXT(j,e.size())],point)){\n\t double t = arg(point);\n\t if (flag){\n\t if (t <ori)t+=2*pi;\n\t a.pb(t-ori);\n\t }else {\n\t if (ori < t)t-=2*pi;\n\t a.pb(ori-t);\n\t }\n\t}\n\tswap(tmp.first,tmp.second);\n }\n }\n }\n}\n\ndouble solve(vector<P> &p,vector<P> &e){//cx,cy=0,0\n vector<double> a;\n a.pb(2*pi);\n getdata(p,e,a,true);\n getdata(e,p,a,false);\n sort(a.begin(),a.end());\n return a[0]*180/pi;\n}\n\n\nmain(){\n int n,m;\n while(cin>>n>>m && n){\n vector<P> e(n),p(m);\n rep(i,e.size()){\n double x,y;cin>>x>>y;e[i]=P(x,y);\n }\n rep(i,p.size()){\n double x,y;cin>>x>>y;p[i]=P(x,y);\n }\n double cx,cy;\n cin>>cx>>cy;\n P minus=P(cx,cy);\n rep(i,e.size())e[i]-=minus;\n rep(i,p.size())p[i]-=minus;\n printf(\"%.7lf\\n\",solve(p,e));\n }\n\n}","accuracy":1,"time_ms":30,"memory_kb":1004,"score_of_the_acc":-0.053,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2045_5499629\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 1000000007\\n//#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define EPS 0.000000001\\n#define SIZE 15\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\n\\t\\tif(fabs(x-p.x) > EPS){\\n\\n\\t\\t\\treturn x < p.x;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn y < p.y;\\n\\t\\t}\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n\\t}\\n\\n\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)\\\\n\\\",x,y);\\n\\t}\\n\\n\\tdouble x,y;\\n};\\n\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\n\\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 M,N;\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\nstatic const int COUNTER_CLOCKWISE = 1;\\nstatic const int CLOCKWISE = -1;\\nstatic const int ONLINE_BACK = 2;\\nstatic const int ONLINE_FRONT = -2;\\nstatic const int ON_SEGMENT = 0;\\n\\n/*\\n * p0を基準点として、p1から見てp2が\\n * 反時計回り側にあれば\\n * COUNTER_CLOCKWISE\\n * */\\nint ccw(Point p0,Point p1,Point p2){\\n\\n\\tVector a = p1 - p0;\\n\\tVector b = p2 - p0;\\n\\n\\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\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\\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_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//線分ではなく直線と点の距離\\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\\nbool Cross_Check(Line A,Line B){\\n\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn true;\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn true;\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn true;\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn true;\\n\\t}\\n\\n\\treturn is_Cross(A,B);\\n}\\n\\n\\nbool is_Cross(Polygon a, Polygon b){\\n\\n\\tfor(int i = 0; i < a.size(); i++){\\n\\n\\t\\tLine base_line = Line(a[i],a[(i+1)%a.size()]);\\n\\n\\t\\tfor(int k = 0; k < b.size(); k++){\\n\\n\\t\\t\\tLine work_line = Line(b[k],b[(k+1)%b.size()]);\\n\\t\\t\\tif(getDistanceSP(work_line,a[i]) < EPS)return true;\\n\\n\\t\\t\\tif(is_Cross(base_line,work_line)){\\n\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn false;\\n}\\n\\n\\nvoid func(){\\n\\n\\tPolygon BOX,poly;\\n\\n\\tdouble x,y;\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&x,&y);\\n\\t\\tBOX.push_back(Point(x,y));\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&x,&y);\\n\\t\\tpoly.push_back(Point(x,y));\\n\\t}\\n\\n\\tPoint base;\\n\\tscanf(\\\"%lf %lf\\\",&base.x,&base.y);\\n\\n\\tint NUM = 10000;\\n\\n\\tdouble diff = 2*M_PI/NUM;\\n\\tdouble roll_rad = 0;\\n\\tdouble last = -1;\\n\\n\\tfor(int i = 0; i < NUM; i++){\\n\\n\\t\\tPolygon tmp_B;\\n\\t\\tfor(int k = 0; k < BOX.size(); k++){\\n\\n\\t\\t\\tPoint tmp_p = rotate(base,BOX[k],-roll_rad);\\n\\t\\t\\ttmp_B.push_back(tmp_p);\\n\\t\\t}\\n\\n\\t\\tif(is_Cross(poly,tmp_B)){\\n\\t\\t\\tlast = roll_rad;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\troll_rad += diff;\\n\\t}\\n\\n\\tif(fabs(last+1.0) < EPS){\\n\\n\\t\\tprintf(\\\"360.0000000000000\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tdouble left = last-diff,right = last,mid = (left+right)/2;\\n\\tdouble ans = right;\\n\\n\\tfor(int loop = 0; loop < 100; loop++){\\n\\n\\t\\tPolygon tmp_B;\\n\\t\\tfor(int k = 0; k < BOX.size(); k++){\\n\\n\\t\\t\\tPoint tmp_p = rotate(base,BOX[k],-mid);\\n\\t\\t\\ttmp_B.push_back(tmp_p);\\n\\t\\t}\\n\\t\\tif(is_Cross(poly,tmp_B)){\\n\\n\\t\\t\\tans = mid;\\n\\t\\t\\tright = mid-EPS;\\n\\t\\t}else{\\n\\n\\t\\t\\tleft = mid+EPS;\\n\\t\\t}\\n\\t\\tmid = (left+right)/2;\\n\\t}\\n\\n\\tprintf(\\\"%.12lf\\\\n\\\",ans*(180/M_PI));\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&M,&N);\\n\\t\\tif(M == 0 && N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3190,\n \"memory_kb\": 3616,\n \"score_of_the_acc\": -2,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2045_3106374\",\n \"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 L : array<P, 2>{\\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\\n L(){}\\n};\\nstruct C{\\n P p;\\n double r;\\n C(const P& p, const double& r) : p(p), r(r) {}\\n C(){}\\n};\\n\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\nint ccw(P a, P b, P c){\\n b -= a;\\n c -= a;\\n if(cross(b,c) > EPS) return +1; //ccw\\n if(cross(b,c) < -EPS) return -1; //cw\\n if(dot(b,c) < -EPS) return +2; //c-a-b\\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\\n return 0; //a-c-b\\n}\\n\\nP unit(const P &p){\\n return p/abs(p);\\n}\\n\\nbool intersectSP(const L& s, const P &p){\\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\\n}\\n\\nP projection(const L& l, const P& p) {\\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\\n return l[0] + t*(l[0]-l[1]);\\n}\\ndouble distanceLP(const L &l, const P &p) {\\n return abs(cross(l[1]-l[0], p-l[0])) /abs(l[1]-l[0]);\\n}\\n\\n\\nVP crosspointCL(const C &c, const L &l){\\n VP ret;\\n P mid = projection(l, c.p);\\n double d = distanceLP(l, c.p);\\n if(EQ(d, c.r)){\\n ret.push_back(mid);\\n }else if(d < c.r){\\n double len = sqrt(c.r*c.r -d*d);\\n ret.push_back(mid +len*unit(l[1]-l[0]));\\n ret.push_back(mid -len*unit(l[1]-l[0]));\\n }\\n return ret;\\n}\\nVP crosspointCS(const C &c, const L &s){\\n VP ret;\\n VP cp = crosspointCL(c,s);\\n for(int i=0; i<(int)cp.size(); i++){\\n if(intersectSP(s, cp[i])){\\n ret.push_back(cp[i]);\\n }\\n }\\n return ret;\\n}\\n\\ndouble getangle360(const P &p, const P &a, const P &b){\\n P proj = projection(L(p,a), b);\\n int sign= (dot(a-p, b-p)>0)? 1: -1;\\n if(ccw(p,a,b)!=-1){\\n return acos(sign*abs(proj-p)/abs(b-p));\\n }else{\\n return 2*PI - acos(sign*abs(proj-p)/abs(b-p));\\n }\\n}\\n\\nint main(){\\n while(1){\\n int m,n;\\n cin >> m >> n;\\n if(m == 0) break;\\n\\n VP p(m), q(n);\\n for(int i=0; i<m; i++){\\n double x,y;\\n cin >> x >> y;\\n p[i] = P(x, y);\\n }\\n for(int i=0; i<n; i++){\\n double x,y;\\n cin >> x >> y;\\n q[i] = P(x, y);\\n }\\n double cx,cy;\\n cin >> cx >> cy;\\n P c(cx, cy);\\n\\n double ans = 2*PI;\\n //すべての辺同士の組み合わせ\\n for(int i=0; i<m; i++){\\n for(int j=0; j<n; j++){\\n L ei(p[i], p[(i+1)%m]), ej(q[j], q[(j+1)%n]);\\n for(int d=0; d<2; d++){\\n C ci(c, abs(ei[d] -c)), cj(c, abs(ej[d] -c));\\n VP cpi = crosspointCS(ci, ej);\\n for(P p: cpi){\\n ans = min(ans, getangle360(c, p, ei[d]));\\n }\\n VP cpj = crosspointCS(cj, ei);\\n for(P p: cpj){\\n ans = min(ans, getangle360(c, ej[d], p));\\n }\\n }\\n }\\n } \\n\\n\\n cout << fixed << setprecision(10);\\n cout << ans*180/PI << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3608,\n \"score_of_the_acc\": -0.9971,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2045_2859298\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\n\\n/* 幾何の基本 */\\n\\n#include <complex>\\n\\ntypedef complex<ld> Point;\\n\\n\\nconst ld pi = acos(-1.0);\\nconst ld dtop = pi / 180.;\\nconst ld ptod = 1. / dtop;\\n\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() > rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\n// 点の入力\\nPoint input_Point() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn Point(x, y);\\n}\\n\\n// 誤差つき等号判定\\nbool eq(const ld a, const ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\n// 内積\\nld dot(const Point& a, const Point& b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\n// 外積\\nld cross(const Point& a, const Point& b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\n// 直線の定義\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\tPoint operator[](const int _num)const {\\n\\t\\tif (_num == 0)return a;\\n\\t\\telse if (_num == 1)return b;\\n\\t\\telse {\\n\\t\\t\\tassert(false);\\n\\t\\t\\treturn Point();\\n\\t\\t}\\n\\t}\\n};\\n\\n// 円の定義\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n\\tCircle() : p(Point(0, 0)), r(0) {}\\n\\tCircle(Point p, ld r) : p(p), r(r) {}\\n};\\n\\n// ccw\\n// 1: a,b,cが反時計周りの順に並ぶ\\n//-1: a,b,cが時計周りの順に並ぶ\\n// 2: c,a,bの順に直線に並ぶ\\n//-2: a,b,cの順に直線に並ぶ\\n// 0: a,c,bの順に直線に並ぶ\\nint ccw(const Point& a, const Point &b, const Point &c) {\\n\\tconst Point nb(b - a);\\n\\tconst Point nc(c - a);\\n\\tif (cross(nb, nc) > eps) return 1; // a,b,cが反時計周りの順に並ぶ\\n\\tif (cross(nb, nc) < -eps) return -1; // a,b,cが時計周りの順に並ぶ\\n\\tif (dot(nb, nc) < 0) return 2; // c,a,bの順に直線に並ぶ\\n\\tif (norm(nb) < norm(nc)) return -2; // a,b,cの順に直線に並ぶ\\n\\treturn 0; // a,c,bの順に直線に並ぶ\\n}\\n\\n\\n/* 交差判定 */\\n\\n// 直線と直線の交差判定\\nbool isis_ll(const Line& l, const Line& m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n\\n// 直線と線分の交差判定\\nbool isis_ls(const Line& l, const Line& s) {\\n\\treturn isis_ll(l, s) &&\\n\\t\\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// 線分と線分の交差判定\\nbool isis_ss(const Line& s, const Line& t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n\\t\\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// 点の直線上判定\\nbool isis_lp(const Line& l, const Point& p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n\\n// 点の線分上判定\\nbool isis_sp(const Line& s, const Point& p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\n// 垂線の足\\nPoint proj(const Line &l, const Point& p) {\\n\\tld t = dot(p - l.a, l.b - l.a) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.b - l.a);\\n}\\n\\n//線対象の位置にある点\\nPoint reflect(const Line &l, const Point &p) {\\n\\tPoint pr = proj(l, p);\\n\\treturn pr * 2.l - p;\\n}\\n\\n// 直線と直線の交点\\nPoint is_ll(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tassert(cross(sv, tv) != 0);\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n// 直線と直線の交点\\nvector<Point> is_ll2(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\\n\\telse {\\n\\t\\tvector<Point>ans;\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\\n\\t\\t\\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n// 線分と線分の交点\\n// 重なってる部分あるとassert(false)\\nPoint is_ss(const Line &s, const Line& t) {\\n\\tif (isis_ss(s, t)) {\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tfor (int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\tif (s[k] == t[l])return s[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn is_ll(s, t);\\n\\t}\\n\\telse {\\n\\t\\t//先にisis_ssしてね\\n\\t\\tassert(false);\\n\\t\\treturn Point(0, 0);\\n\\t}\\n}\\n// 線分と線分の交点\\nvector<Point> is_ss2(const Line &s, const Line& t) {\\n\\tvector<Point> kouho(is_ll2(s, t));\\n\\tvector<Point>ans;\\n\\tfor (auto p : kouho) {\\n\\t\\tif (isis_sp(s, p) && isis_sp(t, p))ans.emplace_back(p);\\n\\t}\\n\\treturn ans;\\n}\\n// 直線と点の距離\\nld dist_lp(const Line& l, const Point& p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\n//直線と直線の距離\\nld dist_ll(const Line& l, const Line& m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\n// 直線と線分の距離\\nld dist_ls(const Line& l, const Line& s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\n// 線分と点の距離\\nld dist_sp(const Line& s, const Point& p) {\\n\\tPoint r = proj(s, p);\\n\\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// 線分と線分の距離\\nld dist_ss(const Line& s, const Line& t) {\\n\\tif (isis_ss(s, t)) return 0;\\n\\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\\n}\\n\\n\\n//直線と直線の二等分線のベクトル\\nLine line_bisection(const Line &s, const Line &t) {\\n\\tconst Point laglanju(is_ll(s, t));\\n\\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\\n\\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\\n\\n\\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\\n}\\n//点と点の垂直二等分線 aを左に見ながら\\nLine point_bisection(const Point&a, const Point&b) {\\n\\tconst Point cen((a + b) / 2.l);\\n\\tconst Point vec = (b - a)*Point(0, 1);\\n\\treturn Line(cen, cen + vec);\\n}\\n\\n//三つの点からなる外心\\nPoint outer_center(const vector<Point>&ps) {\\n\\tassert(ps.size() == 3);\\n\\tLine l1 = point_bisection(ps[0], ps[1]);\\n\\tLine l2 = point_bisection(ps[1], ps[2]);\\n\\treturn is_ll(l1, l2);\\n}\\n\\n\\n//三つの直線からなる内心\\n//三つの直線が並行でないことは確かめといてね\\nPoint inner_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\\n\\tLine bi1(line_bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\\n\\tLine bi2(line_bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\\n\\tif (bi1[0] == bi2[0])return bi1[0];\\n\\telse {\\n\\t\\treturn is_ll(bi1, bi2);\\n\\t}\\n}\\n\\n//三つの直線からなる傍心\\n//三つの直線が並行でないことは確かめといてね\\nvector<Point> ex_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\\n\\tvector<Point>ecs;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tLine bi1(line_bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\\n\\t\\tLine bi2(line_bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\\n\\t\\tecs.push_back(is_ll(bi1, bi2));\\n\\t}\\n\\treturn ecs;\\n}\\n\\n\\n//a,b:並行\\n//c:並行でない\\n//三つの直線から同距離の位置を求める。\\nvector<Point> same_dis(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tvertics.push_back(is_ll(ls[0], ls[2]));\\n\\tvertics.push_back(is_ll(ls[1], ls[2]));\\n\\n\\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\\n\\tLine bis(line_bisection(ls[0], ls[1]));\\n\\tvector<Point>ecs;\\n\\n\\tLine abi(line_bisection(Line(vertics[0], vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, abi));\\n\\n\\n\\tLine bbi(line_bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, bbi));\\n\\n\\treturn ecs;\\n}\\n/* 円 */\\n\\n// 円と円の交点\\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps) dfr = 0.0;\\n\\telse if (dfr < 0.0) return res; // no intersection\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\n/*\\n点が円の中にいるか\\n0 => out\\n1 => on\\n2 => in*/\\nint is_in_Circle(const Point& p, const Circle &cir) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\nint is_in_Circle(const Circle &cir, const Point& p) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\n/*\\n円lcが円rcの中にいるか\\n0 => out\\n1 => on\\n2 => in*/\\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\\n\\tld dis = abs(lc.p - rc.p);\\n\\tif (dis < rc.r - lc.r - eps)return 2;\\n\\telse if (dis>rc.r - lc.r + eps)return 0;\\n\\telse return 1;\\n}\\n\\n// 円と直線の交点\\nvector<Point> is_lc(const Circle& c, const Line& l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d < c.r + eps) {\\n\\t\\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\\n\\t\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\t\\tres.push_back(proj(l, c.p) + len * nor);\\n\\t\\tres.push_back(proj(l, c.p) - len * nor);\\n\\t}\\n\\treturn res;\\n}\\n\\n// 円と線分の距離\\nvector<Point> is_sc(const Circle& c, const Line& l) {\\n\\tvector<Point> v = is_lc(c, l), res;\\n\\tfor (Point p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\n// 円と点の接線\\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\\n\\tvector<Line> ret;\\n\\tPoint v = c.p - p;\\n\\tld d = abs(v);\\n\\tld l = sqrt(norm(v) - c.r * c.r);\\n\\tif (isnan(l)) { return ret; }\\n\\tPoint v1 = v * Point(l / d, c.r / d);\\n\\tPoint v2 = v * Point(l / d, -c.r / d);\\n\\tret.push_back(Line(p, p + v1));\\n\\tif (l < eps) return ret;\\n\\tret.push_back(Line(p, p + v2));\\n\\treturn ret;\\n}\\n\\n// 円と円の接線\\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Line> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\\n\\t\\tret = tangent_cp(c1, center);\\n\\t}\\n\\tif (abs(c1.r - c2.r) > eps) {\\n\\t\\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<Line> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), nret.begin(), nret.end());\\n\\t}\\n\\telse {\\n\\t\\tPoint v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\\n\\t\\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\\n\\t\\tret.push_back(Line(q1, q1 + v));\\n\\t\\tret.push_back(Line(q2, q2 + v));\\n\\t}\\n\\treturn ret;\\n}\\n//二つの円の重なり面積\\nld two_Circle_area(const Circle&l, const Circle&r) {\\n\\tld dis = abs(l.p - r.p);\\n\\tif (dis > l.r + r.r)return 0;\\n\\telse if (dis + r.r < l.r) {\\n\\t\\treturn r.r*r.r*pi;\\n\\t}\\n\\telse if (dis + l.r < r.r) {\\n\\t\\treturn l.r*l.r*pi;\\n\\t}\\n\\telse {\\n\\t\\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\\n\\t\\t\\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\\n\\t\\t\\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n/* 多角形 */\\n\\ntypedef vector<Point> Polygon;\\n\\n\\n\\n//多角形(複数の点)の最小包含円をO(N=頂点数)で求めるアルゴリズム\\n//同一直線上に三つの点がないこと\\n#include<random>\\nCircle welzl(vector<Point>ps) {\\n\\tstruct solver {\\n\\t\\tCircle solve(vector<Point>&ps, vector<Point>&rs) {\\n\\t\\t\\tif (ps.empty() || rs.size() == 3) {\\n\\t\\t\\t\\tif (rs.size() == 1) {\\n\\t\\t\\t\\t\\treturn Circle(Point(rs[0]), 0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (rs.size() == 2) {\\n\\t\\t\\t\\t\\treturn Circle((rs[0] + rs[1]) / 2.0l, abs(rs[1] - rs[0]) / 2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (rs.size() == 3) {\\n\\t\\t\\t\\t\\tvector<Line> ls(3);\\n\\t\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\t\\tls[i] = Line(rs[i], rs[(i + 1) % 3]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tPoint center = outer_center(rs);\\n\\t\\t\\t\\t\\treturn Circle(center, abs(center - rs[0]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\treturn Circle(Point(), 0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\n\\t\\t\\t\\tPoint p_ba = ps.back();\\n\\t\\t\\t\\tps.pop_back();\\n\\t\\t\\t\\tCircle d = solve(ps, rs);\\n\\t\\t\\t\\tps.push_back(p_ba);\\n\\t\\t\\t\\tif (is_in_Circle(d, p_ba)) {\\n\\t\\t\\t\\t\\treturn d;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\trs.push_back(p_ba);\\n\\t\\t\\t\\t\\tps.pop_back();\\n\\t\\t\\t\\t\\tauto ans = solve(ps, rs);\\n\\t\\t\\t\\t\\tps.push_back(p_ba);\\n\\t\\t\\t\\t\\trs.pop_back();\\n\\t\\t\\t\\t\\treturn ans;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}so;\\n\\tstd::random_device rd;\\n\\tstd::mt19937 mt(rd());\\n\\tshuffle(ps.begin(), ps.end(), mt);\\n\\tvector<Point>rs;\\n\\tCircle ans = so.solve(ps, rs);\\n\\treturn ans;\\n}\\n// 面積\\nld get_area(const Polygon &p) {\\n\\tld res = 0;\\n\\tint n = p.size();\\n\\tfor (int j = 0; j<n; ++j) res += cross(p[j], p[(j + 1) % n]);\\n\\treturn res / 2;\\n}\\n\\n//多角形の回転方向\\nbool is_counter_clockwise(const Polygon &poly) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\\n\\t\\tangle += arg((c - b) / (b - a));\\n\\t}\\n\\treturn angle > eps;\\n}\\n\\n// 円の内外判定\\n/*0 => out\\n1 => on\\n2 => in*/\\nint is_in_Polygon(const Polygon &poly, const Point& p) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n];\\n\\t\\tif (isis_sp(Line(a, b), p)) return 1;\\n\\t\\tangle += arg((b - p) / (a - p));\\n\\t}\\n\\treturn eq(angle, 0) ? 0 : 2;\\n}\\n//円の内外判定2 高速\\nenum { out, on, in };\\nint convex_contains(const Polygon &P, const Point &p) {\\n\\tconst int n = P.size();\\n\\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\\n\\tint a = 0, b = n;\\n\\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\\n\\t\\tint c = (a + b) / 2;\\n\\t\\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\\n\\t\\t\\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\\n\\t\\t\\telse a = c;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\\n\\t\\t\\telse b = c;\\n\\t\\t}\\n\\t}\\n\\tb %= n;\\n\\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\\n\\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\\n\\treturn 1;\\n}\\n\\n// 凸包\\n//点や線を返すことも有り得るので注意\\nPolygon convex_hull(vector<Point> ps) {\\n\\tint n = ps.size();\\n\\tint k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tPolygon ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++])\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n\\n\\n//凸カット\\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\\n\\tint n = ps.size();\\n\\tPolygon q;\\n\\tPolygon r;\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = ps[i], b = ps[(i + 1) % n];\\n\\t\\tLine m = Line(a, b);\\n\\t\\tif (ccw(l.a, l.b, a) != -1) q.push_back(a);\\n\\t\\tif (ccw(l.a, l.b, a) != 1) r.push_back(a);\\n\\t\\tif (ccw(l.a, l.b, a) * ccw(l.a, l.b, b) < 0 && isis_ll(l, m)) {\\n\\t\\t\\tq.push_back(is_ll(l, m));\\n\\t\\t\\tr.push_back(is_ll(l, m));\\n\\t\\t}\\n\\t}\\n\\tconst vector<Polygon>polys{ q,r };\\n\\treturn polys;\\n}\\n\\n\\n\\nint main() {\\n\\tcout<<setprecision(10)<<fixed;\\n\\tcout<<setprecision(10)<<fixed;\\n\\tcout<<setprecision(10)<<fixed;\\n\\tcout<<setprecision(10)<<fixed;\\n\\tcout<<setprecision(10)<<fixed;\\n\\twhile (true){\\n\\t\\tint M,N;cin>>M>>N;\\n\\t\\tif(!M)break;\\n\\t\\tPolygon rooms,patient;\\n\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\tint x,y;cin>>x>>y;\\n\\t\\t\\trooms.emplace_back(x,y);\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tint x,y;cin>>x>>y;\\n\\t\\t\\tpatient.emplace_back(x,y);\\n\\t\\t}\\n\\t\\t{\\n\\t\\t\\tPoint center;\\n\\t\\t\\tint x,y;cin>>x>>y;\\n\\t\\t\\tcenter=Point(x,y);\\n\\t\\t\\tfor (auto &p : rooms) {\\n\\t\\t\\t\\tp-=center;\\n\\t\\t\\t}\\n\\t\\t\\tfor (auto&p : patient) {\\n\\t\\t\\t\\tp-=center;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tld ans=2*pi;\\n\\n\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\tLine l(rooms[i],rooms[(i+1)%M]);\\n\\t\\t\\tfor (int j = 0; j < N; ++j) {\\n\\t\\t\\t\\tPoint p(patient[j]);\\n\\t\\t\\t\\tCircle c(Point(0,0),abs(p));\\n\\n\\t\\t\\t\\tauto ps=is_sc(c,l);\\n\\t\\t\\t\\tfor (auto n : ps) {\\n\\t\\t\\t\\t\\tld theta1=atan2l(p.imag(),p.real());\\n\\t\\t\\t\\t\\tld theta2=atan2l(n.imag(),n.real());\\n\\t\\t\\t\\t\\tif(theta2<theta1)theta2+=2*pi;\\n\\n\\t\\t\\t\\t\\tans=min(ans,theta2-theta1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tLine l(patient[i], patient[(i + 1) % N]);\\n\\t\\t\\tfor (int j = 0; j < M; ++j) {\\n\\t\\t\\t\\tPoint p(rooms[j]);\\n\\t\\t\\t\\tCircle c(Point(0, 0), abs(p));\\n\\n\\t\\t\\t\\tauto ps = is_sc(c, l);\\n\\t\\t\\t\\tfor (auto n : ps) {\\n\\t\\t\\t\\t\\tld theta1 = atan2l(p.imag(), p.real());\\n\\t\\t\\t\\t\\tld theta2 = atan2l(n.imag(), n.real());\\n\\t\\t\\t\\t\\tif (theta2<theta1)theta2 += 2 * pi;\\n\\n\\t\\t\\t\\t\\tans = min(ans, 2*pi-(theta2 - theta1));\\n\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<ans/(2*pi)*360<<endl;\\n\\t\\t\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -0.8851,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2045_2276502\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n \\nconst double PI=acos(-1);\\nconst double PI2=PI*2.0;\\nconst double eps=1e-10;\\n \\ntypedef complex<double> P;\\ntypedef pair<P,P> S;\\ntypedef pair<P,double> C;\\ntypedef vector<P> vecP;\\n \\nbool eq(double a,double b){\\n return -eps<a-b&&a-b<eps;\\n}\\n \\ndouble Sqrt(double x){\\n if(x<0)return x;\\n return sqrt(x);\\n}\\n \\nP normal( P a ){\\n return a/abs(a);\\n}\\n \\ndouble dot(P a,P b){\\n return real( b*conj(a) );\\n}\\ndouble cross(P a,P b){\\n return imag( b*conj(a) );\\n}\\ndouble getArg(P a,P b){\\n return arg(b*conj(a));\\n}\\n \\ndouble getTime(P a,P b){\\n return ( dot(a,b) < 0 ? -1.0 : 1.0)*abs(b)/abs(a); \\n}\\n \\nbool onSP(S s,P p){\\n P a=s.first, b=s.second;\\n return eq( abs(a-b) , abs(p-a)+abs(p-b) );\\n}\\n \\nP project(P a,P b,P c){\\n b-=a;c-=a;\\n return a+b*real(c/b);\\n}\\n \\ndouble getDistLP(S s,P p){\\n P a=s.first, b=s.second;\\n return abs( cross(b-a,p-a) / abs(b-a) );\\n}\\n \\ndouble getDistSP(S s,P p){\\n P a=s.first, b=s.second;\\n if( dot(b-a,p-a) < eps )return abs(p-a);\\n if( dot(a-b,p-b) < eps )return abs(p-b);\\n return getDistLP(s,p);\\n}\\n \\nbool isCrossCS(C c,S s){\\n P a=s.first, b=s.second;\\n double A=abs(c.second-a);\\n double B=abs(c.second-b);\\n double C=getDistSP(s,c.second);\\n if( A < c.second+eps && B < c.second+eps )return false;\\n if( c.second+eps < C )return false;\\n return true;\\n}\\n \\nvecP getCrossCL(C cir,S line){\\n P a=line.first, b=line.second;\\n double cr=cir.second;\\n P cp=cir.first;\\n vecP res;\\n P base=b-a, target=project(a,b,cp);\\n double length=abs(base), h=abs(cp-target);\\n base/=length;\\n \\n if(cr+eps<h)return res;\\n double w=Sqrt(cr*cr-h*h);\\n double L=getTime( normal(b-a), target-a) -w , R=L+w*2.0;\\n \\n res.push_back( a+ base * L );\\n if(eq(L,R))return res;\\n res.push_back( a+ base * R );\\n return res;\\n}\\n \\nvecP getCrossCS(C cir,S s){\\n vecP tmp=getCrossCL(cir,s);\\n vecP res;\\n for(int i=0;i<(int)tmp.size();i++)\\n if( onSP(s,tmp[i]) )\\n res.push_back( tmp[i] );\\n \\n return res;\\n}\\n \\ndouble calc(P cen,S a,P b){\\n if( eq(abs(cen-b),0) )return 1e10;\\n \\n vecP tp=getCrossCS( C(cen, abs(cen-b) ) , a );\\n double res=1e10;\\n \\n for(int i=0;i<(int)tp.size();i++){\\n P p=tp[i];\\n double value=getArg(b-cen,p-cen);\\n if( value < 0 )value+=PI2;\\n res=min(res,value);\\n }\\n return res;\\n}\\n \\ndouble calc2(P cen,S a,P b){\\n if( eq(abs(cen-b),0) )return 1e10;\\n \\n vecP tp=getCrossCS( C(cen, abs(cen-b) ) , a );\\n double res=1e10;\\n \\n for(int i=0;i<(int)tp.size();i++){\\n P p=tp[i];\\n double value=getArg(b-cen,p-cen);\\n if( value < 0 )value+=PI2;\\n res=min(res,PI2-value);\\n }\\n return res;\\n}\\n \\ndouble calc(P cen,S a,S b){\\n double res=1e10;\\n res=min(res,calc(cen,a,b.first));\\n res=min(res,calc(cen,a,b.second));\\n res=min(res,calc2(cen,b,a.first));\\n res=min(res,calc2(cen,b,a.second));\\n return res;\\n}\\n \\nP input(){\\n int x,y;\\n cin>>x>>y;\\n return P(x,y);\\n}\\n \\n \\nS getS(const vecP& polygon,int index){\\n int n=polygon.size();\\n index%=n;\\n return S(polygon[index], polygon[ (index+1) % n ]);\\n}\\n \\nint main(){\\n int M,N;\\n P cen;\\n while(1){\\n cin>>M>>N;\\n if(M==0&&N==0)break;\\n vecP inpol,outpol;\\n \\n for(int i=0;i<M;i++){\\n inpol.push_back( input() );\\n }\\n for(int i=0;i<N;i++){\\n outpol.push_back( input() );\\n }\\n cen=input();\\n \\n double ans=1e10;\\n for(int i=0;i<M;i++){\\n for(int j=0;j<N;j++){\\n ans=min(ans, calc(cen, getS(inpol,i) , getS(outpol,j) ) );\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\", min(360.0,ans/PI*180.0) );\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3384,\n \"score_of_the_acc\": -0.9185,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2045_2275807\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nconst double PI=acos(-1);\\nconst double PI2=PI*2.0;\\nconst double eps=1e-10;\\n\\ntypedef complex<double> P;\\ntypedef pair<P,P> S;\\ntypedef pair<P,double> C;\\ntypedef vector<P> vecP;\\n\\nbool eq(double a,double b){\\n return -eps<a-b&&a-b<eps;\\n}\\n\\ndouble Sqrt(double x){\\n if(x<0)return x;\\n return sqrt(x);\\n}\\n\\nP normal( P a ){\\n return a/abs(a);\\n}\\n\\ndouble dot(P a,P b){\\n return real( b*conj(a) );\\n}\\ndouble cross(P a,P b){\\n return imag( b*conj(a) );\\n}\\ndouble getArg(P a,P b){\\n return arg(b*conj(a));\\n}\\n\\ndouble getTime(P a,P b){\\n return ( dot(a,b) < 0 ? -1.0 : 1.0)*abs(b)/abs(a); \\n}\\n\\nbool onSP(S s,P p){\\n P a=s.first, b=s.second;\\n return eq( abs(a-b) , abs(p-a)+abs(p-b) );\\n}\\n\\nP project(P a,P b,P c){\\n b-=a;c-=a;\\n return a+b*real(c/b);\\n}\\n\\ndouble getDistLP(S s,P p){\\n P a=s.first, b=s.second;\\n return abs( cross(b-a,p-a) / abs(b-a) );\\n}\\n\\ndouble getDistSP(S s,P p){\\n P a=s.first, b=s.second;\\n if( dot(b-a,p-a) < eps )return abs(p-a);\\n if( dot(a-b,p-b) < eps )return abs(p-b);\\n return getDistLP(s,p);\\n}\\n\\nbool isCrossCS(C c,S s){\\n P a=s.first, b=s.second;\\n double A=abs(c.second-a);\\n double B=abs(c.second-b);\\n double C=getDistSP(s,c.second);\\n if( A < c.second+eps && B < c.second+eps )return false;\\n if( c.second+eps < C )return false;\\n return true;\\n}\\n\\nvecP getCrossCL(C cir,S line){\\n P a=line.first, b=line.second;\\n double cr=cir.second;\\n P cp=cir.first;\\n vecP res;\\n P base=b-a, target=project(a,b,cp);\\n double length=abs(base), h=abs(cp-target);\\n base/=length;\\n\\n if(cr+eps<h)return res;\\n double w=Sqrt(cr*cr-h*h);\\n double L=getTime( normal(b-a), target-a) -w , R=L+w*2.0;\\n\\n res.push_back( a+ base * L );\\n if(eq(L,R))return res;\\n res.push_back( a+ base * R );\\n return res;\\n}\\n\\nvecP getCrossCS(C cir,S s){\\n vecP tmp=getCrossCL(cir,s);\\n vecP res;\\n for(int i=0;i<(int)tmp.size();i++)\\n if( onSP(s,tmp[i]) )\\n res.push_back( tmp[i] );\\n\\n return res;\\n}\\n\\ndouble calc(P cen,S a,P b){\\n if( eq(abs(cen-b),0) )return 1e10;\\n \\n vecP tp=getCrossCS( C(cen, abs(cen-b) ) , a );\\n double res=1e10;\\n \\n for(int i=0;i<(int)tp.size();i++){\\n P p=tp[i];\\n double value=getArg(b-cen,p-cen);\\n if( value < 0 )value+=PI2;\\n res=min(res,value);\\n }\\n return res;\\n}\\n\\ndouble calc2(P cen,S a,P b){\\n if( eq(abs(cen-b),0) )return 1e10;\\n \\n vecP tp=getCrossCS( C(cen, abs(cen-b) ) , a );\\n double res=1e10;\\n \\n for(int i=0;i<(int)tp.size();i++){\\n P p=tp[i];\\n double value=getArg(b-cen,p-cen);\\n if( value < 0 )value+=PI2;\\n res=min(res,PI2-value);\\n }\\n return res;\\n}\\n\\ndouble calc(P cen,S a,S b){\\n double res=1e10;\\n res=min(res,calc(cen,a,b.first));\\n res=min(res,calc(cen,a,b.second));\\n res=min(res,calc2(cen,b,a.first));\\n res=min(res,calc2(cen,b,a.second));\\n return res;\\n}\\n\\nP input(){\\n int x,y;\\n cin>>x>>y;\\n return P(x,y);\\n}\\n\\n\\nS getS(const vecP& polygon,int index){\\n int n=polygon.size();\\n index%=n;\\n return S(polygon[index], polygon[ (index+1) % n ]);\\n}\\n\\nint main(){\\n int M,N;\\n P cen;\\n while(1){\\n cin>>M>>N;\\n if(M==0&&N==0)break;\\n vecP inpol,outpol;\\n \\n for(int i=0;i<M;i++){\\n inpol.push_back( input() );\\n }\\n for(int i=0;i<N;i++){\\n outpol.push_back( input() );\\n }\\n cen=input();\\n\\n double ans=1e10;\\n for(int i=0;i<M;i++){\\n for(int j=0;j<N;j++){\\n ans=min(ans, calc(cen, getS(inpol,i) , getS(outpol,j) ) );\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\", min(360.0,ans/PI*180.0) );\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3404,\n \"score_of_the_acc\": -0.9258,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2045_1094826\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cassert>\\n#include <cctype>\\n#include <cstdio>\\n#include <complex>\\n#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <bitset>\\n#include <stack>\\n#include <utility>\\n#include <numeric>\\n#include <functional>\\n#include <string>\\n#include <cstring>\\n#include <sstream>\\n// #include <tuple>\\n// #include <regex>\\n \\nusing namespace std;\\ntypedef long long ll;\\n \\n#define ALL(c) (c).begin(),(c).end()\\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\\n#define EACH(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)\\n#define IN(l,v,r) ((l)<=(v) && (v)<(r))\\n \\n \\ntypedef long double D;\\nconst D EPS = 1e-8,INF = 1e12;\\n \\ntemplate<typename T> int sig(T a,T b=0){return a<b-EPS?-1:a>b+EPS?1:0;}\\ntemplate<typename T> bool eq(T a,T b){ return sig(abs(a-b))==0;}\\ntemplate<typename T> D norm(T a){ return a*a;}\\n \\ntypedef complex<D> P,Vec;\\n#define X real()\\n#define Y imag()\\n \\nbool debug = false;\\n \\n \\nnamespace std{\\n bool operator < (const P& a,const P& b){\\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\\n }\\n bool operator == (const P& a,const P& b){\\n return eq(a,b);\\n }\\n};\\n \\n// a×b\\nD cross(const Vec& a,const Vec& b){\\n return imag(conj(a)*b);\\n}\\n// a・b\\nD dot(const Vec& a,const Vec& b) {\\n return real(conj(a)*b);\\n}\\n//射影ベクトル\\nVec proj(Vec p,Vec b) {\\n return b * dot(p,b) / norm(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//直線へ射影した時の点\\nP projection(const L &l, const P &p) {\\n return l[0] + proj(p-l[0],l[1]-l[0]);\\n}\\n \\nD distanceLP(const L &l, const P &p) {\\n return abs(p - projection(l, p));\\n}\\n \\nstruct C {\\n P o; D r;\\n C(const P &o,D r) : o(o), r(r) { }\\n};\\n \\nvector<P> intersectionLC(L l,C c){\\n D d = distanceLP(l,c.o);\\n vector <P> res;\\n if(eq(d,c.r)){\\n res.push_back(projection(l,c.o));\\n }else if(sig(d,c.r)<0){\\n P m = projection(l,c.o),u = (l[1]-l[0])/abs(l[1]-l[0]);\\n D t = sqrt(c.r*c.r - d*d);\\n res.push_back( m + t * u);res.push_back( m - t * u);\\n }\\n return res;\\n}\\n \\nint ccw(const P& a,P b,P c){\\n\\t\\tb -= a; c -= a;\\n\\t\\tif (sig(cross(b,c))>0) return +1; // counter clockwise\\n\\t\\tif (sig(cross(b,c))<0) return -1; // clockwise\\n\\t\\tif (sig(dot(b,c)) < 0) return +2; // c--a--b on line\\n\\t\\tif (sig(norm(b),norm(c))<0) return -2; // a--b--c on line\\n\\t\\treturn 0;\\n\\t}\\n \\nvector<P> intersectionSC(L l,C c){\\n vector<P> ps=intersectionLC(l,c),res;\\n REP(i,ps.size()){\\n if(ccw(ps[i],l[0],l[1])==+2 || ccw(ps[i],l[1],l[0])==+2){\\n res.push_back(ps[i]);\\n }\\n }\\n return res;\\n}\\n \\n//浮動小数点modで非負の値のみかえす．\\nD pfmod(D v,D M=2*M_PI){\\n return fmod(fmod(v,M)+M,M);\\n}\\n \\nint main(){\\n cout <<fixed <<setprecision(20);\\n cerr <<fixed <<setprecision(20);\\n \\n while(true){\\n int m,n;cin >> m >> n;\\n if(m==0 && n==0)break;\\n \\n vector<P> ps(m);\\n REP(i,m){\\n D x,y;cin >>x >> y;ps[i]=P(x,y); \\n }\\n vector<P> qs(n);\\n REP(i,n){\\n D x,y;cin >>x >> y;qs[i]=P(x,y); \\n }\\n P c;\\n {\\n D x,y;cin >>x >> y;c=P(x,y); \\n }\\n \\n D ma = 2 * M_PI;\\n REP(i,m){\\n C ic(c,abs(ps[i]-c));\\n REP(j,n){\\n L l(qs[j],qs[(j+1)%n]);\\n vector<P> ip=intersectionSC(l,ic);\\n REP(k,ip.size()){\\n D a=pfmod(arg(ps[i]-c)-arg(ip[k]-c));\\n ma=min(ma,a);\\n }\\n }\\n }\\n REP(j,n){\\n C ic(c,abs(qs[j]-c));\\n REP(i,m){\\n L l(ps[i],ps[(i+1)%m]);\\n vector<P> ip=intersectionSC(l,ic);\\n REP(k,ip.size()){\\n D a=pfmod(arg(ip[k]-c)-arg(qs[j]-c));\\n ma=min(ma,a);\\n }\\n }\\n }\\n \\n cout << ma * 360.0/(2*M_PI)<<endl;\\n }\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1320,\n \"score_of_the_acc\": -0.1715,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2045_1088814\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cassert>\\n#include <cctype>\\n#include <cstdio>\\n#include <complex>\\n#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <bitset>\\n#include <stack>\\n#include <utility>\\n#include <numeric>\\n#include <functional>\\n#include <string>\\n#include <cstring>\\n#include <sstream>\\n// #include <tuple>\\n// #include <regex>\\n\\nusing namespace std;\\ntypedef long long ll;\\n\\n#define ALL(c) (c).begin(),(c).end()\\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\\n#define EACH(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)\\n#define IN(l,v,r) ((l)<=(v) && (v)<(r))\\n\\n\\ntypedef long double D;\\nconst D EPS = 1e-8,INF = 1e12;\\n\\ntemplate<typename T> int sig(T a,T b=0){return a<b-EPS?-1:a>b+EPS?1:0;}\\ntemplate<typename T> bool eq(T a,T b){ return sig(abs(a-b))==0;}\\ntemplate<typename T> D norm(T a){ return a*a;}\\n\\ntypedef complex<D> P,Vec;\\n#define X real()\\n#define Y imag()\\n\\nbool debug = false;\\n\\n\\nnamespace std{\\n\\tbool operator < (const P& a,const P& b){\\n \\t\\treturn a.X != b.X ? a.X < b.X : a.Y < b.Y;\\n \\t}\\n \\tbool operator == (const P& a,const P& b){\\n \\t\\treturn eq(a,b);\\n \\t}\\n};\\n\\n// a×b\\nD cross(const Vec& a,const Vec& b){\\n\\treturn imag(conj(a)*b);\\n}\\n// a・b\\nD dot(const Vec& a,const Vec& b) {\\n\\treturn real(conj(a)*b);\\n}\\n//射影ベクトル\\nVec proj(Vec p,Vec b) {\\n\\treturn b * dot(p,b) / norm(b);\\n}\\n\\n//直線・線分\\nstruct L : public vector<P> {\\n\\tL(const P &a, const P &b) {\\n\\t \\tpush_back(a); push_back(b);\\n\\t }\\n};\\n\\n//直線へ射影した時の点\\nP projection(const L &l, const P &p) {\\n\\treturn l[0] + proj(p-l[0],l[1]-l[0]);\\n}\\n\\nD distanceLP(const L &l, const P &p) {\\n\\treturn abs(p - projection(l, p));\\n}\\n\\nstruct C {\\n \\tP o; D r;\\n \\tC(const P &o,D r) : o(o), r(r) { }\\n};\\n\\nvector<P> intersectionLC(L l,C c){\\n\\tD d = distanceLP(l,c.o);\\n\\tvector <P> res;\\n \\tif(eq(d,c.r)){\\n\\t\\tres.push_back(projection(l,c.o));\\n\\t}else if(sig(d,c.r)<0){\\n\\t\\tP m = projection(l,c.o),u = (l[1]-l[0])/abs(l[1]-l[0]);\\n\\t \\tD t = sqrt(c.r*c.r - d*d);\\n\\t\\tres.push_back( m + t * u);res.push_back( m - t * u);\\n\\t}\\n\\treturn res;\\n}\\n\\nint ccw(const P& a,P b,P c){\\n\\tb -= a; c -= a;\\n\\tif (cross(b,c) > EPS) return +1; \\t// counter clockwise\\n\\tif (cross(b,c) < -EPS) return -1; \\t// clockwise\\n\\tif (dot(b,c) < 0) return +2; // c--a--b on line\\n\\tif (norm(b) < norm(c)) return -2; // a--b--c on line\\n\\treturn 0; \\t\\t\\t\\t\\t\\t\\t\\t// a--c--b on line (or b==c)\\n}\\n\\nvector<P> intersectionSC(L l,C c){\\n\\tvector<P> ps=intersectionLC(l,c),res;\\n\\tREP(i,ps.size()){\\n\\t\\tif(ccw(ps[i],l[0],l[1])==+2 || ccw(ps[i],l[1],l[0])==+2){\\n\\t\\t\\tres.push_back(ps[i]);\\n\\t\\t}\\n\\t}\\n\\treturn res;\\n}\\n\\n//浮動小数点modで非負の値のみかえす．\\nD pfmod(D v,D M=2*M_PI){\\n\\treturn fmod(fmod(v,M)+M,M);\\n}\\n\\nint main(){\\n\\tcout <<fixed <<setprecision(20);\\n\\tcerr <<fixed <<setprecision(20);\\n\\n\\twhile(true){\\n\\t\\tint m,n;cin >> m >> n;\\n\\t\\tif(m==0 && n==0)break;\\n\\n\\t\\tvector<P> ps(m);\\n\\t\\tREP(i,m){\\n\\t\\t\\tD x,y;cin >>x >> y;ps[i]=P(x,y); \\n\\t\\t}\\n\\t\\tvector<P> qs(n);\\n\\t\\tREP(i,n){\\n\\t\\t\\tD x,y;cin >>x >> y;qs[i]=P(x,y); \\n\\t\\t}\\n\\t\\tP c;\\n\\t\\t{\\n\\t\\t\\tD x,y;cin >>x >> y;c=P(x,y); \\n\\t\\t}\\n\\n\\t\\tD ma = 2 * M_PI;\\n\\t\\tREP(i,m){\\n\\t\\t\\tC ic(c,abs(ps[i]-c));\\n\\t\\t\\tREP(j,n){\\n\\t\\t\\t\\tL l(qs[j],qs[(j+1)%n]);\\n\\t\\t\\t\\tvector<P> ip=intersectionSC(l,ic);\\n\\t\\t\\t\\tREP(k,ip.size()){\\n\\t\\t\\t\\t\\tD a=pfmod(arg(ps[i]-c)-arg(ip[k]-c));\\n\\t\\t\\t\\t\\tma=min(ma,a);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tREP(j,n){\\n\\t\\t\\tC ic(c,abs(qs[j]-c));\\n\\t\\t\\tREP(i,m){\\n\\t\\t\\t\\tL l(ps[i],ps[(i+1)%m]);\\n\\t\\t\\t\\tvector<P> ip=intersectionSC(l,ic);\\n\\t\\t\\t\\tREP(k,ip.size()){\\n\\t\\t\\t\\t\\tD a=pfmod(arg(ip[k]-c)-arg(qs[j]-c));\\n\\t\\t\\t\\t\\tma=min(ma,a);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tcout << ma * 360.0/(2*M_PI)<<endl;\\n\\t}\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1320,\n \"score_of_the_acc\": -0.1715,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2045_1088813\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cassert>\\n#include <cctype>\\n#include <cstdio>\\n#include <complex>\\n#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <bitset>\\n#include <stack>\\n#include <utility>\\n#include <numeric>\\n#include <functional>\\n#include <string>\\n#include <cstring>\\n#include <sstream>\\n// #include <tuple>\\n// #include <regex>\\n\\nusing namespace std;\\ntypedef long long ll;\\n\\n#define ALL(c) (c).begin(),(c).end()\\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\\n#define EACH(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)\\n#define IN(l,v,r) ((l)<=(v) && (v)<(r))\\n\\n\\ntypedef long double D;\\nconst D EPS = 1e-8,INF = 1e12;\\n\\ntemplate<typename T> int sig(T a,T b=0){return a<b-EPS?-1:a>b+EPS?1:0;}\\ntemplate<typename T> bool eq(T a,T b){ return sig(abs(a-b))==0;}\\ntemplate<typename T> D norm(T a){ return a*a;}\\n\\ntypedef complex<D> P,Vec;\\n#define X real()\\n#define Y imag()\\n\\nbool debug = false;\\n\\n\\nnamespace std{\\n\\tbool operator < (const P& a,const P& b){\\n \\t\\treturn a.X != b.X ? a.X < b.X : a.Y < b.Y;\\n \\t}\\n \\tbool operator == (const P& a,const P& b){\\n \\t\\treturn eq(a,b);\\n \\t}\\n};\\n\\n// a×b\\nD cross(const Vec& a,const Vec& b){\\n\\treturn imag(conj(a)*b);\\n}\\n// a・b\\nD dot(const Vec& a,const Vec& b) {\\n\\treturn real(conj(a)*b);\\n}\\n//射影ベクトル\\nVec proj(Vec p,Vec b) {\\n\\treturn b * dot(p,b) / norm(b);\\n}\\n\\n//直線・線分\\nstruct L : public vector<P> {\\n\\tL(const P &a, const P &b) {\\n\\t \\tpush_back(a); push_back(b);\\n\\t }\\n};\\n\\n//直線へ射影した時の点\\nP projection(const L &l, const P &p) {\\n\\treturn l[0] + proj(p-l[0],l[1]-l[0]);\\n}\\n\\nD distanceLP(const L &l, const P &p) {\\n\\treturn abs(p - projection(l, p));\\n}\\n\\nstruct C {\\n \\tP o; D r;\\n \\tC(const P &o,D r) : o(o), r(r) { }\\n};\\n\\nvector<P> intersectionLC(L l,C c){\\n\\tD d = distanceLP(l,c.o);\\n\\tvector <P> res;\\n \\tif(eq(d,c.r)){\\n\\t\\tres.push_back(projection(l,c.o));\\n\\t}else if(sig(d,c.r)<0){\\n\\t\\tP m = projection(l,c.o),u = (l[1]-l[0])/abs(l[1]-l[0]);\\n\\t \\tD t = sqrt(c.r*c.r - d*d);\\n\\t\\tres.push_back( m + t * u);res.push_back( m - t * u);\\n\\t}\\n\\treturn res;\\n}\\n\\n\\nint ccw(const P& a,P b,P c){\\n\\tb -= a; c -= a;\\n\\tif (cross(b,c) > EPS) return +1; \\t// counter clockwise\\n\\tif (cross(b,c) < -EPS) return -1; \\t// clockwise\\n\\tif (dot(b,c) < 0) return +2; // c--a--b on line\\n\\tif (norm(b) < norm(c)) return -2; // a--b--c on line\\n\\treturn 0; \\t\\t\\t\\t\\t\\t\\t\\t// a--c--b on line (or b==c)\\n}\\n\\nvector<P> intersectionSC(L l,C c){\\n\\tvector<P> ps=intersectionLC(l,c),res;\\n\\t// if(debug){\\n\\t// \\tREP(i,ps.size()){\\n\\t// \\t\\tcerr <<ps[i]<<endl;\\n\\t// \\t}\\n\\t// }\\n\\tREP(i,ps.size()){\\n\\t\\t// cerr << ccw(ps[i],l[0],l[1])<<endl;\\n\\t\\t// cerr << ccw(ps[i],l[1],l[0])<<endl;\\n\\t\\tif(ccw(ps[i],l[0],l[1])==+2 || ccw(ps[i],l[1],l[0])==+2){\\n\\t\\t\\tres.push_back(ps[i]);\\n\\t\\t}\\n\\t}\\n\\treturn res;\\n}\\n\\n//浮動小数点modで非負の値のみかえす．\\nD pfmod(D v,D M=2*M_PI){\\n\\treturn fmod(fmod(v,M)+M,M);\\n}\\n\\nint main(){\\n\\tcout <<fixed <<setprecision(20);\\n\\tcerr <<fixed <<setprecision(20);\\n\\n\\twhile(true){\\n\\t\\tint m,n;cin >> m >> n;\\n\\t\\tif(m==0 && n==0)break;\\n\\n\\t\\tvector<P> ps(m);\\n\\t\\tREP(i,m){\\n\\t\\t\\tD x,y;cin >>x >> y;ps[i]=P(x,y); \\n\\t\\t}\\n\\t\\tvector<P> qs(n);\\n\\t\\tREP(i,n){\\n\\t\\t\\tD x,y;cin >>x >> y;qs[i]=P(x,y); \\n\\t\\t}\\n\\t\\tP c;\\n\\t\\t{\\n\\t\\t\\tD x,y;cin >>x >> y;c=P(x,y); \\n\\t\\t}\\n\\n\\t\\tD ma = 2 * M_PI;\\n\\t\\tREP(i,m){\\n\\t\\t\\tC ic(c,abs(ps[i]-c));\\n\\t\\t\\tREP(j,n){\\n\\t\\t\\t\\tif(i==4 && j==2)debug=true;\\n\\t\\t\\t\\tL l(qs[j],qs[(j+1)%n]);\\n\\t\\t\\t\\tvector<P> ip=intersectionSC(l,ic);\\n\\n\\t\\t\\t\\t// if(i==4 && j==2){\\n\\t\\t\\t\\t// \\tcerr << i <<\\\" \\\" <<j <<endl;\\n\\t\\t\\t\\t// \\tcerr << c<<\\\" \\\"<<ps[i] << endl;\\t\\t\\t\\t\\n\\t\\t\\t\\t// \\tcerr << abs(ps[i]-c)<<endl;\\n\\t\\t\\t\\t// \\tcerr << l[0]<<\\\" \\\"<<l[1]<<endl;\\t\\n\\t\\t\\t\\t// \\tcerr <<\\\"--\\\"<<endl;\\t\\t\\t\\n\\t\\t\\t\\t// \\tREP(k,ip.size())cerr << ip[k]<<endl;\\n\\t\\t\\t\\t// }\\n\\t\\t\\t\\tREP(k,ip.size()){\\n\\t\\t\\t\\t\\tD a=pfmod(arg(ps[i]-c)-arg(ip[k]-c));\\n\\t//\\t\\t\\t\\tcerr << a <<endl;\\n\\t\\t\\t\\t\\tma=min(ma,a);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// cerr << ma<<endl;\\n\\t\\t\\t\\t// cerr <<endl;\\n\\t\\t\\t\\t// if(i==4 && j==2)debug=false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tREP(j,n){\\n\\t\\t\\tC ic(c,abs(qs[j]-c));\\n\\t\\t\\tREP(i,m){\\n\\t\\t\\t\\t// if(i==4 && j==2)debug=true;\\n\\t\\t\\t\\tL l(ps[i],ps[(i+1)%m]);\\n\\t\\t\\t\\tvector<P> ip=intersectionSC(l,ic);\\n\\n\\t\\t\\t\\t// if(i==4 && j==2){\\n\\t\\t\\t\\t// \\tcerr << i <<\\\" \\\" <<j <<endl;\\n\\t\\t\\t\\t// \\tcerr << c<<\\\" \\\"<<ps[i] << endl;\\t\\t\\t\\t\\n\\t\\t\\t\\t// \\tcerr << abs(ps[i]-c)<<endl;\\n\\t\\t\\t\\t// \\tcerr << l[0]<<\\\" \\\"<<l[1]<<endl;\\t\\n\\t\\t\\t\\t// \\tcerr <<\\\"--\\\"<<endl;\\t\\t\\t\\n\\t\\t\\t\\t// \\tREP(k,ip.size())cerr << ip[k]<<endl;\\n\\t\\t\\t\\t// }\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tREP(k,ip.size()){\\n\\t\\t\\t\\t\\tD a=pfmod(arg(ip[k]-c)-arg(qs[j]-c));\\n\\t\\t\\t\\t\\tma=min(ma,a);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// cerr << ma<<endl;\\n\\t\\t\\t\\t// cerr <<endl;\\n\\n\\t\\t\\t\\t// if(i==4 && j==2)debug=false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tcout << ma * 360.0/(2*M_PI)<<endl;\\n\\t}\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1320,\n \"score_of_the_acc\": -0.1715,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2045_1046013\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-8) \\n#define equals(a,b) (fabs((a)-(b))<EPS)\\n\\nusing namespace std;\\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\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = 0,double y = 0): x(x),y(y){}\\n\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n bool operator == (const Segment& p)const { return ( p.p1 == p1 && p.p2 == p2 ) || ( p.p1 == p2 && p.p2 == p1 ); }\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\ntypedef vector<Point> Polygon;\\n\\nostream& operator << (ostream& os,const Point& a){ os << \\\"(\\\" << a.x << \\\",\\\" << a.y << \\\")\\\"; }\\n\\nostream& operator << (ostream& os,const Segment& a){ os << \\\"( \\\" << a.p1 << \\\" , \\\" << a.p2 << \\\" )\\\"; }\\n\\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\\n\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\n\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\n\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\n//rad は角度をラジアンで持たせること\\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n\\n// 度をラジアンに変換\\ndouble toRad(double agl){ return agl*M_PI/180.0; }\\n\\n// a => prev, b => cur, c=> next\\n// prev から cur へ行って next へ行く際の角度を求める\\ndouble getArg(Point a,Point b,Point c){\\n double arg1 = atan2(b.y-a.y,b.x-a.x);\\n double arg2 = atan2(c.y-b.y,c.x-b.x);\\n double arg = fabs( arg1 - arg2 );\\n while( arg > M_PI ) arg -= 2.0 * M_PI;\\n return fabs(arg);\\n}\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS)return CLOCKWISE;\\n if(dot(a,b) < -EPS)return ONLINE_BACK;\\n if(norm(a) < norm(b))return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n\\n// p0 を p1 を基準に時計回りで回した時の p2 までの角度\\ndouble ccw_angle(Point p0,Point p1,Point p2){\\n double ret = M_PI - getArg(p0,p1,p2);\\n //cout << ret * 180 / M_PI << endl;\\n if( ccw(p1,p0,p2) == COUNTER_CLOCKWISE ) ret = 2*M_PI - ret;\\n return ret;\\n}\\n\\n\\ndouble cross3p(Point p,Point q,Point r) { return (r.x-q.x) * (p.y -q.y) - (r.y - q.y) * (p.x - q.x); }\\n \\nbool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }\\n \\nbool ccwtest(Point p,Point q,Point r) { return cross3p(p,q,r) > 0; }\\n \\nbool onSegment(Point p,Point q,Point r) { return collinear(p,q,r) && equals(sqrt(pow(p.x-r.x,2)+pow(p.y-r.y,2)) + sqrt(pow(r.x-q.x,2) + pow(r.y-q.y,2) ),sqrt(pow(p.x-q.x,2)+pow(p.y-q.y,2)) ) ; }\\n\\n\\ntypedef pair<double,double> dd;\\nconst double DINF = 1e20;\\n#define pow2(a) ((a)*(a))\\nbool LT(double a ,double b){ return !equals(a,b) && a < b; }\\nbool LTE(double a,double b){ return equals(a,b) || a < b; }\\n\\ndd calc(double x1,double y1,double vx1,double vy1,\\n double x2,double y2,double vx2,double vy2,double r){\\n double VX = (vx1-vx2), X = (x1-x2), VY = (vy1-vy2), Y = (y1-y2);\\n double a = pow2(VX) + pow2(VY), b = 2*(X*VX+Y*VY), c = pow2(X) + pow2(Y) - pow2(r);\\n dd ret = dd(DINF,DINF);\\n double D = b*b - 4 * a * c;\\n\\n if( LT(D,0.0) ) return ret;\\n\\n if( equals(a,0.0) ) {\\n if( equals(b,0.0) ) return ret;\\n if( LT(-c/b,0.0) ) return ret;\\n ret.first = - c / b;\\n return ret;\\n }\\n\\n if( equals(D,0.0) ) D = 0;\\n ret.first = ( -b - sqrt( D ) ) / ( 2 * a );\\n ret.second = ( -b + sqrt( D ) ) / ( 2 * a );\\n if( !equals(ret.first,ret.second) && ret.first > ret.second ) swap(ret.first,ret.second);\\n return ret;\\n}\\n\\n\\nPoint c;\\nPolygon poly,qoly;\\n\\n// type => 0 : CW, type => 1 : CCW\\ndouble calc(Polygon &A,Polygon &B,int type){\\n double ret = DINF;\\n rep(i,A.size()){\\n double cost = DINF;\\n rep(j,B.size()){\\n Vector e = ( B[j] - B[(j+1)%(int)B.size()] ) / abs( B[j] - B[(j+1)%(int)B.size()] );\\n dd tmp = calc(c.x,c.y,0,0,\\n B[j].x,B[j].y,e.x,e.y,abs(A[i]-c));\\n vector<Point> vp;\\n if( !equals(tmp.first ,DINF) ) vp.push_back(B[j]+e*tmp.first);\\n if( !equals(tmp.second,DINF) ) vp.push_back(B[j]+e*tmp.second);\\n rep(k,vp.size()) if( onSegment(B[j],B[(j+1)%(int)B.size()],vp[k]) ) {\\n double theta = ccw_angle(A[i],c,vp[k]);\\n cost = min(cost,(!type?theta:2*M_PI-theta));\\n }\\n }\\n ret = min(ret,cost);\\n }\\n return ret;\\n}\\n\\nvoid compute(){\\n double mini = min(calc(poly,qoly,0),calc(qoly,poly,1));\\n if( equals(mini,DINF) ) puts(\\\"360.0000000\\\");\\n else printf(\\\"%.10lf\\\\n\\\",mini * 180.0 / M_PI); \\n}\\n\\nint main(){\\n int M,N;\\n while( cin >> M >> N, M|N ){\\n poly.resize(M); qoly.resize(N);\\n rep(i,M) cin >> poly[i].x >> poly[i].y;\\n rep(i,N) cin >> qoly[i].x >> qoly[i].y;\\n cin >> c.x >> c.y;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1348,\n \"score_of_the_acc\": -0.1754,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2045_1014584\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cassert>\\n#include <algorithm>\\n#include <complex>\\n#include <vector>\\n#include <cmath>\\nusing namespace std;\\n\\n#define EPS 1e-7\\n#define INF 360\\n#define PI M_PI\\n\\n\\nint N, M;\\n\\ntypedef complex<double> Point;\\n\\nnamespace std{\\n\\tbool operator < (const Point &a, const Point &b){\\n\\t\\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n\\t}\\n\\tPoint operator / (const Point &p, const double &a){\\n\\t\\treturn Point(real(p)/a, imag(p)/a);\\n\\t}\\n\\tPoint operator * (const Point &p, const double &a){\\n\\t\\treturn Point(real(p) * a, imag(p)*a);\\n\\t}\\n\\tbool operator == (const Point &a, const Point &b){\\n\\t\\treturn real(a) == real(b) && imag(a) == imag(b);\\n\\t}\\n}\\ntypedef vector<Point> Polygon;\\nstruct Line : public vector<Point>{\\n\\tLine(){}\\n\\tLine (const Point &a, const Point &b){\\n\\t\\tpush_back(a); push_back(b);\\n\\t}\\n};\\nstruct Circle{\\n\\tPoint c; double r;\\n\\tCircle(){}\\n\\tCircle(const Point &c, double r) : c(c), r(r){}\\n};\\n\\ndouble distancePP(const Point &a, const Point &b){\\n\\treturn sqrt((real(a)-real(b))*(real(a)-real(b)) + (imag(a)-imag(b))*(imag(a)-imag(b)));\\n}\\n\\ndouble cross(const Point &a, const Point &b){\\n\\treturn imag(conj(a)*b);\\n}\\n\\ndouble dot(const Point &a, const Point &b){\\n return real(conj(a) * b);\\n}\\n\\nPoint projection(const Line &l, const Point &p){\\n\\tdouble t = dot(p-l[0], l[0] - l[1]) / norm(l[0]-l[1]);\\n\\treturn l[0] + t*(l[0]-l[1]);\\n}\\n\\nvector<Point> crosspointLC(const Line &l, const Circle &c){\\n\\tvector<Point> ret;\\n\\tPoint center = projection(l, c.c);\\n\\tdouble d = abs(center - c.c);\\n\\tdouble t = sqrt(c.r * c.r - d*d);\\n\\tif(isnan(t)) return ret;\\n\\tPoint vect = (l[1] - l[0]);\\n\\tvect /= abs(vect);\\n\\tret.push_back(center - vect*t);\\n\\tret.push_back(center + vect * t);\\n\\treturn ret;\\n}\\n\\nbool is_point_on_line(Point a, Point b, Point c) {\\n\\treturn abs(b-a) + EPS > max(abs(c-a), abs(c-b));\\n}\\n\\ndouble calc(const Point &a, const Point &b, const Point &pp){\\n\\tdouble ta = arg(a-pp);\\n\\tdouble tb = arg(b-pp);\\n\\twhile (tb < ta + EPS) {\\n\\t\\ttb += 2 * M_PI;\\n\\t}\\n\\treturn ((tb - ta)*180/PI);\\n}\\n\\ndouble calc2(const Point &a, const Point &b, const Point &pp){\\n\\tdouble tb = arg(a-pp);\\n\\tdouble ta = arg(b-pp);\\n\\twhile (tb < ta + EPS) {\\n\\t\\ttb += 2 * M_PI;\\n\\t}\\n\\treturn ((tb - ta)*180/PI);\\n}\\n\\n\\n\\nint main(void){\\n\\tdouble cx, cy;\\n\\twhile(cin>>M>>N, M || N){\\n\\t\\tPolygon out, in;\\n\\t\\t\\n\\t\\tfor(int i = 0; i < M; i++){\\n\\t\\t\\tdouble x, y;\\n\\t\\t\\tcin >> x >> y;\\n\\t\\t\\tout.push_back(Point(x, y));\\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\\tin.push_back(Point(x,y));\\n\\t\\t}\\n\\t\\tcin >> cx >> cy;\\n\\t\\tdouble min_ans = INF;\\n\\t\\tfor(int i = 0; i < in.size(); i++){\\n\\t\\t\\tPoint pp = Point(cx, cy);\\n\\t\\t\\tCircle c = Circle(pp, distancePP(pp, in[i]));\\n\\t\\t\\tfor(int j = 0; j < out.size(); j++){\\n\\t\\t\\t\\tLine l = Line(out[(j+1)%out.size()], out[j]);\\n\\t\\t\\t\\tvector<Point> cp = crosspointLC(l, c);\\n\\t\\t\\t\\tif(cp.empty()) continue;\\n\\t\\t\\t\\tdouble c1 = 360, c2 = 360;\\n/*\\ncout << real(in[i]) << \\\":\\\" << imag(in[i]) << \\\" and \\\"<< real(out[j]) << \\\":\\\" << imag(out[j]) << \\\" to \\\"<< real(out[j+1]) << \\\":\\\" << imag(out[j+1])<< endl;\\ncout << real(cp[0]) << \\\":\\\" << imag(cp[0]) << \\\" and \\\"<< real(cp[1]) << \\\":\\\" << imag(cp[1]) << endl;\\n*/\\n\\t\\t\\t\\tif(is_point_on_line(out[(j+1)%out.size()], out[j], cp[0]))\\n\\t\\t\\t\\t\\tc1 = calc(in[i], cp[0], pp);\\n\\t\\t\\t\\tif(is_point_on_line(out[(j+1)%out.size()], out[j], cp[1]))\\n\\t\\t\\t\\t\\tc2 = calc(in[i], cp[1], pp);\\n//cout << \\\":\\\" << c1 << \\\" : \\\" << c2 << \\\" : \\\" << min_ans << endl;\\n\\t\\t\\t\\tmin_ans = min(min_ans, min(c1, c2));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tswap(in, out);\\n\\t\\tfor(int i = 0; i < in.size(); i++){\\n\\t\\t\\tPoint pp = Point(cx, cy);\\n\\t\\t\\tCircle c = Circle(pp, distancePP(pp, in[i]));\\n\\t\\t\\tfor(int j = 0; j < out.size(); j++){\\n\\t\\t\\t\\tLine l = Line(out[(j+1)%out.size()], out[j]);\\n\\t\\t\\t\\tvector<Point> cp = crosspointLC(l, c);\\n\\t\\t\\t\\tif(cp.empty()) continue;\\n\\t\\t\\t\\tdouble c1 = 360, c2 = 360;\\n\\t\\t\\t\\tif(is_point_on_line(out[(j+1)%out.size()], out[j], cp[0]))\\n\\t\\t\\t\\t\\tc1 = calc2(in[i], cp[0], pp);\\n\\t\\t\\t\\tif(is_point_on_line(out[(j+1)%out.size()], out[j], cp[1]))\\n\\t\\t\\t\\t\\tc2 = calc2(in[i], cp[1], pp);\\n\\t\\t\\t\\tmin_ans = min(min_ans, min(c1, c2));\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\n\\t\\tprintf(\\\"%.9lf\\\\n\\\", min_ans);\\n\\t}\\n\\t\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1356,\n \"score_of_the_acc\": -0.1783,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2045_815773\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\n\\nusing namespace std;\\ntypedef complex<double> Point;\\nconst double EPS = 1e-6;\\ndouble dot(Point a, Point b){\\n return real(conj(a) * b);\\n}\\ndouble cross(Point a, Point b){\\n return imag(conj(a) * b);\\n}\\nint ccw(Point a, Point b, Point c) {\\n b -= a; c -= a;\\n double len = abs(b) * abs(c); // 速さが気になるときは1にする\\n if (cross(b, c) > +len * EPS) return +1; // 反時計回り\\n if (cross(b, c) < -len * EPS) 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; // 点が線分ab上にある\\n}\\n\\ndouble angle(Point a, Point b){\\n double res = arg(conj(a) * b);\\n if(res < 0) res += 2 * M_PI;\\n return res;\\n}\\n\\nstruct Line : public vector<Point> {\\n Line(const Point& a, const Point& b) {\\n push_back(a); push_back(b);\\n }\\n Point vector() const {\\n return back() - front();\\n }\\n};\\nstruct Circle {\\n Point p;\\n double r;\\n Circle() {}\\n Circle(Point p, double r) : p(p), r(r) { }\\n};\\nbool intersectSP(Line s, Point p) {\\n return ccw(s[0], s[1], p) == 0;\\n}\\n\\nPoint projection(Line l, Point p){\\n double t = dot(p - l[0], l.vector()) / norm(l.vector());\\n return l[0] + t * l.vector();\\n}\\n\\nvector<Point> crosspointLC(const Line &l, const Circle &c) {\\n vector<Point> res;\\n Point center = projection(l, c.p);\\n double d = abs(center - c.p);\\n double tt = c.r * c.r - d * d;\\n if(tt < 0 && tt > -EPS) tt = 0;\\n if(tt < 0) return res;\\n double t = sqrt(tt);\\n Point vect = l.vector();\\n vect /= abs(vect);\\n res.push_back(center - vect * t);\\n if (t > EPS) {\\n res.push_back(center + vect * t);\\n }\\n return res;\\n}\\n\\nvector<Point> crosspointSC(const Line &s, const Circle &c) {\\n vector<Point> ret;\\n vector<Point> nret = crosspointLC(s, c);\\n for (int i = 0; i < nret.size(); i++) {\\n if (intersectSP(s, nret[i])) ret.push_back(nret[i]);\\n }\\n return ret;\\n}\\n\\nint main(){\\n int M, N;\\n while(cin >> M >> N && M){\\n vector<Point> ps(M);\\n vector<Point> qs(N);\\n REP(i, M){\\n double x, y;\\n cin >> x >> y;\\n ps[i] = Point(x, y);\\n }\\n REP(i, N){\\n double x, y;\\n cin >> x >> y;\\n qs[i] = Point(x, y);\\n }\\n double cx, cy;\\n cin >> cx >> cy;\\n Point cp(cx, cy);\\n double ans = 2.0 * M_PI;\\n for(int i = 0; i < N; i++){\\n Circle C(cp, abs(qs[i] - cp)); // qs[i]の軌道\\n for(int j = 0; j < M; j++){\\n Line s(ps[j], ps[(j == M - 1 ? 0 : j + 1)]);\\n vector<Point> crosspv = crosspointSC(s, C);\\n for(Point crossp : crosspv){\\n //cout << \\\"Circle : \\\" << C.p << \\\" \\\" << C.r << \\\" cross with \\\" << s[0] << \\\" \\\" << s[1] << \\\" at \\\" << crossp << endl;\\n ///cout << \\\"angle : \\\" << angle(qs[i] - cp, crossp - cp) << endl;\\n ans = min(ans, angle(qs[i] - cp, crossp - cp));\\n }\\n }\\n }\\n for(int i = 0; i < M; i++){\\n Circle C(cp, abs(ps[i] - cp)); // ps[i]の軌道\\n for(int j = 0; j < N; j++){\\n Line s(qs[j], qs[(j == N - 1 ? 0 : j + 1)]);\\n vector<Point> crosspv = crosspointSC(s, C);\\n for(Point crossp : crosspv){\\n //cout << \\\"Circle : \\\" << C.p << \\\" \\\" << C.r << \\\" cross with \\\" << s[0] << \\\" \\\" << s[1] << \\\" at \\\" << crossp << endl;\\n //cout << \\\"angle : \\\" << angle(crossp - cp, ps[i] - cp) << endl;\\n ans = min(ans, angle(crossp - cp, ps[i] - cp));\\n }\\n }\\n }\\n printf(\\\"%.7f\\\\n\\\", ans / M_PI * 180.0);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1336,\n \"score_of_the_acc\": -0.1742,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2045_729090\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <complex>\\n#include <cmath>\\n#include <cstdio>\\n#include <vector>\\nusing namespace std;\\n\\ntypedef complex<double> P;\\ntypedef pair<P,P> L;\\n\\nconst double EPS = 1e-8;\\n\\nstruct C{\\n P c;\\n double r;\\n C(P c=P(0,0), double r=0.0):c(c),r(r){}\\n};\\n\\ndouble dot(P a, P b){return real(conj(a)*b);}\\ndouble cross(P a, P b){return imag(conj(a)*b);}\\nbool equal(double a, double b){return fabs(a-b) < EPS;}\\n\\nP proj(P p, L l){\\n return l.first + dot(p - l.first, l.second - l.first) / norm(l.second - l.first) * (l.second - l.first);\\n}\\n\\nbool isInterSP(L s, P p){\\n if(dot(s.second - s.first, p - s.first) < -EPS) return equal(0.0, abs(p-s.first));\\n if(dot(s.first - s.second, p - s.second) < - EPS) return equal(0.0, abs(p-s.second));\\n return equal(0.0, abs(cross(s.second - s.first, p - s.first) / abs(s.second - s.first)));\\n}\\n\\nvector<P> getInterCS(C c, L s){\\n vector<P> res;\\n P h = proj(c.c, s);\\n double d = abs(c.c - h);\\n if(d > c.r + EPS);\\n else if(d > c.r - EPS){\\n if(isInterSP(s, h)) res.push_back(h);\\n } else {\\n P v = s.second - s.first;\\n v = (sqrt(c.r*c.r - d*d) / abs(v)) * v;\\n if(isInterSP(s, h+v)) res.push_back(h+v);\\n if(isInterSP(s, h-v)) res.push_back(h-v);\\n }\\n return res;\\n}\\n\\nint n,m;\\nvector<P> v[2];\\nP ce;\\n\\ndouble calc(P a, P b1, P b2){\\n double res = arg(b2-a) - arg(b1-a);\\n res *= 180.0 / M_PI;\\n while(res < 0) res += 360.0;\\n while(res > 360.0) res -= 360.0;\\n return res;\\n}\\n\\nvoid solve(){\\n double ans = 360.0;\\n for(int i=0;i<m;i++){\\n C c = C(ce, abs(ce-v[1][i]));\\n for(int j=0;j<n;j++){\\n L l = L(v[0][j], v[0][(j+1)%n]);\\n vector<P> cp = getInterCS(c, l);\\n for(int k=0;k<cp.size();k++)\\n\\tans = min(ans, calc(ce, v[1][i], cp[k]));\\n }\\n }\\n\\n for(int i=0;i<n;i++){\\n C c = C(ce, abs(ce-v[0][i]));\\n for(int j=0;j<m;j++){\\n L l = L(v[1][j], v[1][(j+1)%m]);\\n vector<P> cp = getInterCS(c, l);\\n for(int k=0;k<cp.size();k++)\\n\\tans = min(ans, calc(ce, cp[k], v[0][i]));\\n }\\n }\\n\\n\\n printf(\\\"%.7f\\\\n\\\",ans);\\n}\\n\\nint main(){\\n while(cin >> n >> m && (n|m)){\\n double x,y;\\n for(int i=0;i<2;i++) v[i].clear();\\n for(int i=0;i<n;i++){\\n cin >> x >> y;\\n v[0].push_back(P(x,y));\\n }\\n for(int i=0;i<m;i++){\\n cin >> x >> y;\\n v[1].push_back(P(x,y));\\n }\\n cin >> x >> y;\\n ce = P(x,y);\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1352,\n \"score_of_the_acc\": -0.1737,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2045_665618\",\n \"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 <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()\\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)\\nconst int INF = 1<<29;\\nconst double EPS = 1e-8;\\nconst double PI = acos(-1);\\ntypedef pair<int,int> pii;\\ntypedef long long ll;\\n\\n\\ntypedef complex<double> P;\\nnamespace std {\\n bool operator < (const P& a, const P& b) {\\n // if (abs(a-b)<EPS) return 0;\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n }\\n}\\ndouble cross(const P& a, const P& b) {\\n return imag(conj(a)*b);\\n}\\ndouble dot(const P& a, const P& b) {\\n return real(conj(a)*b);\\n}\\nstruct L : public vector<P> {\\n L(const P &a, const P &b) {\\n push_back(a); push_back(b);\\n }\\n L() {}\\n};\\ntypedef vector<P> G;\\n#define curr(P, i) P[i]\\n#define next(P, i) P[(i+1)%P.size()]\\nstruct C {\\n P p; double r;\\n C(const P &p, double r) : p(p), r(r) { }\\n};\\n\\nint ccw(P a, P b, P c) {\\n b -= a; c -= a;\\n if (cross(b, c) > 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\\n return 0;\\n}\\n\\nP rotate(const P &p, double ang) {\\n return p * P(cos(ang), sin(ang));\\n}\\n\\nP projection(const L &l, const P &p) {\\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\\n return l[0] + t*(l[0]-l[1]);\\n}\\nbool intersectSP(const L &s, const P &p) {\\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\\n}\\n\\nP 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]; // same line\\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n return m[0] + B / A * (m[1] - m[0]);\\n}\\n\\n\\nvector<P> crosspointLC(const L &l, const C &c) {\\n vector<P> ret;\\n P center = projection(l, c.p);\\n double d = abs(center - c.p);\\n double t = sqrt(c.r * c.r - d * d);\\n if (isnan(t)) { return ret; }\\n P vect = (l[1] - l[0]);\\n vect /= abs(vect);\\n ret.push_back(center - vect * t);\\n if (t > EPS) {\\n ret.push_back(center + vect * t);\\n }\\n return ret;\\n}\\n\\nvector<P> crosspointSC(const L &s, const C &c) {\\n vector<P> ret;\\n vector<P> nret = crosspointLC(s, c);\\n FOR(it, nret)\\n if (intersectSP(s, *it))\\n ret.push_back(*it);\\n return ret;\\n}\\n\\ndouble angle(const P &a, const P &b) { // テ」ツδ凖」ツつッテ」ツδ暗」ツδォテッツスツ?」ツ?凝」ツつ嘉」ツ?ソテ」ツ?淌」ツδ凖」ツつッテ」ツδ暗」ツδォテッツスツづ」ツ?ョティツァツ津・ツコツヲテ」ツ?ョティツィツ暗ァツョツ夕0,2pi)\\n double ret = arg(b)-arg(a);\\n return (ret>=0) ? ret : ret + 2*PI;\\n}\\n\\nP p[10];\\nP q[10];\\nP c;\\nint main() {\\n int m,n;\\n while(cin >> m >> n, m||n) {\\n REP(i,m) cin >> p[i].real() >> p[i].imag(); \\n REP(i,n) cin >> q[i].real() >> q[i].imag();\\n cin >> c.real() >> c.imag();\\n double ans = 2*PI;\\n REP(i,n) {\\n REP(j,m) {\\n vector<P> ps = crosspointSC(L(p[j],p[(j+1)%m]), C(c,abs(q[i]-c)));\\n FOR(it, ps) {\\n chmin(ans, angle(q[i]-c,*it-c));\\n }\\n ps = crosspointSC(L(q[i],q[(i+1)%n]), C(c,abs(p[j]-c)));\\n FOR(it, ps) {\\n chmin(ans, angle(*it-c,p[j]-c));\\n }\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\", ans*180/PI);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1352,\n \"score_of_the_acc\": -0.1769,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2045_657321\",\n \"code_snippet\": \"#include<algorithm>\\n#include<complex>\\n#include<cstdio>\\n#include<iostream>\\n#include<queue>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\\ntemplate<class T> T at(vector<T> v, int i) {return v[i % v.size()];}\\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;\\nconst D PI = acos(-1);\\n\\nint sig(D a, D b = 0) {return a < b - EPS ? -1 : a > b + EPS ? 1 : 0;}\\nbool near(P a, P b) {return norm(a - b) < EPS;}\\n\\n// 比較関数\\nnamespace std {\\n bool operator<(P a, P b) {return sig(a.X, b.X) ? a.X < b.X : a.Y < b.Y;}\\n}\\n\\nD sr(D a) {return sqrt(max(a, (D)0));}\\n\\n// 内積\\nD dot(P a, P b) {return a.X * b.X + a.Y * b.Y;}\\n// 外積\\nD det(P a, P b) {return a.X * b.Y - a.Y * b.X;}\\n\\n// 線分のベクトル\\nP vec(L a) {return a.b - a.a;}\\n\\n// 線分abに対する点cの位置\\nenum CCW{FRONT = 1, RIGHT = 2, BACK = 4, LEFT = 8, ON = 16};\\nint ccw(P a, P b, P c) {\\n if (a == c || b == c) return ON;\\n int s = sig(det(b - a, c - a));\\n if (s) return s > 0 ? LEFT : RIGHT;\\n return (a < b) == (b < c) ? FRONT : (c < a) == (a < b) ? BACK : ON;\\n}\\n\\n// 有向角度\\nD arg(P base, P a, P b) {\\n D ang = arg((b - base) / (a - base));\\n return ang > 0 ? ang : ang + 2 * PI;\\n}\\n\\n// 射影\\nP proj(P a, P b) {return a * dot(a, b) / norm(a);}\\nP perp(L l, P p) {return l.a + proj(vec(l), p - l.a);}\\n\\n// 交点\\nP pLL(L a, L b) {return a.a + vec(a) * (det(vec(b), b.a - a.a) / det(vec(b), vec(a)));}\\n\\n// 距離\\nD dLP(L l, P p) {return abs(det(vec(l), p - l.a)) / abs(vec(l));}\\n\\n// 円\\nstruct C{P c; D r;};\\n\\n// 交差判定\\nbool iCL(C c, L l) {return sig(c.r, dLP(l, c.c)) >= 0;}\\n\\n// 交点\\npair<P, P> pCL(C c, L l) {\\n P x = perp(l, c.c);\\n P y = vec(l) / abs(vec(l)) * sr(c.r * c.r - norm(x - c.c));\\n return make_pair(x - y, x + y);\\n}\\n\\nint main() {\\n while (true) {\\n int n, m;\\n cin >> n >> m;\\n if (n == 0 && m == 0) break;\\n Pol p(n), q(m);\\n rep (i, n) cin >> p[i].X >> p[i].Y;\\n rep (i, m) cin >> q[i].X >> q[i].Y;\\n P c;\\n cin >> c.X >> c.Y;\\n D res = 2 * PI;\\n rep (i, n) {\\n\\tif (near(c, p[i])) continue;\\n\\tC a = (C){c, abs(c - p[i])};\\n\\trep (j, m) {\\n\\t L s = (L){q[j], at(q, j + 1)};\\n\\t if (!iCL(a, s)) continue;\\n\\t pair<P, P> pp = pCL(a, s);\\n\\t if (ccw(s.a, s.b, pp.first) == ON) {\\n\\t res = min(res, arg(c, pp.first, p[i]));\\n\\t }\\n\\t if (ccw(s.a, s.b, pp.second) == ON) {\\n\\t res = min(res, arg(c, pp.second, p[i]));\\n\\t }\\n\\t}\\n }\\n swap(n, m);\\n swap(p, q);\\n rep (i, n) {\\n\\tif (near(c, p[i])) continue;\\n\\tC a = (C){c, abs(c - p[i])};\\n\\trep (j, m) {\\n\\t L s = (L){q[j], at(q, j + 1)};\\n\\t if (!iCL(a, s)) continue;\\n\\t pair<P, P> pp = pCL(a, s);\\n\\t if (ccw(s.a, s.b, pp.first) == ON) {\\n\\t res = min(res, arg(c, p[i], pp.first));\\n\\t }\\n\\t if (ccw(s.a, s.b, pp.second) == ON) {\\n\\t res = min(res, arg(c, p[i], pp.second));\\n\\t }\\n\\t}\\n }\\n printf(\\\"%.12Lf\\\\n\\\", res * 180 / PI);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.1537,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2045_657320\",\n \"code_snippet\": \"#include<algorithm>\\n#include<complex>\\n#include<cstdio>\\n#include<iostream>\\n#include<queue>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\\ntemplate<class T> T at(vector<T> v, int i) {return v[i % v.size()];}\\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;\\nconst D PI = acos(-1);\\n\\nint sig(D a, D b = 0) {return a < b - EPS ? -1 : a > b + EPS ? 1 : 0;}\\nbool near(P a, P b) {return norm(a - b) < EPS;}\\n\\n// テヲツッツ氾ィツシツεゥツ鳴「テヲツ閉ー\\nnamespace std {\\n bool operator<(P a, P b) {return sig(a.X, b.X) ? a.X < b.X : a.Y < b.Y;}\\n bool operator<(L a, L b) {return !near(a.a, b.a) ? a.a < b.a : a.b < b.b;}\\n}\\n\\nD sr(D a) {return sqrt(max(a, (D)0));}\\n\\n// テ・ツ??ァツゥツ?\\nD dot(P a, P b) {return a.X * b.X + a.Y * b.Y;}\\n// テ・ツ、ツ姪ァツゥツ?\\nD det(P a, P b) {return a.X * b.Y - a.Y * b.X;}\\n\\n// テァツキツ堙・ツ按?」ツ?ョテ」ツδ凖」ツつッテ」ツδ暗」ツδォ\\nP vec(L a) {return a.b - a.a;}\\n\\n// テァツキツ堙・ツ按?bテ」ツ?ォテ・ツッツセテ」ツ?凖」ツつ凝ァツつケcテ」ツ?ョテ、ツスツ催ァツスツョ\\nenum CCW{FRONT = 1, RIGHT = 2, BACK = 4, LEFT = 8, ON = 16};\\nint ccw(P a, P b, P c) {\\n if (a == c || b == c) return ON;\\n int s = sig(det(b - a, c - a));\\n if (s) return s > 0 ? LEFT : RIGHT;\\n return (a < b) == (b < c) ? FRONT : (c < a) == (a < b) ? BACK : ON;\\n}\\n\\n// テヲツ慊嘉・ツ青妥ィツァツ津・ツコツヲ\\nD arg(P base, P a, P b) {\\n D ang = arg((b - base) / (a - base));\\n return ang > 0 ? ang : ang + 2 * PI;\\n}\\nL sortBase;\\nbool lessArg(P a, P b) {\\n D ang1 = arg(sortBase.a, sortBase.b, a);\\n D ang2 = arg(sortBase.a, sortBase.b, b);\\n return sig(ang1, ang2) ? ang1 < ang2 : norm(a) > norm(b);\\n}\\n\\n// テ・ツーツ?・ツスツア\\nP proj(P a, P b) {return a * dot(a, b) / norm(a);}\\nP perp(L l, P p) {return l.a + proj(vec(l), p - l.a);}\\nP refl(L l, P p) {return perp(l, p) * (D)2 - p;}\\n\\n// テ、ツコツ、テ・ツキツョテ・ツ按、テ・ツョツ?\\nbool eqL(L a, L b) {return !sig(det(vec(a), vec(b))) && !sig(det(vec(a), b.a - a.a));}\\nbool iLL(L a, L b) {return sig(det(vec(a), vec(b))) || !sig(det(vec(a), b.a - a.a));}\\nbool iLLs(L a, L b) {return sig(det(vec(a), vec(b)));}\\nbool iLS(L a, L b) {return sig(det(vec(a), b.a - a.a)) * sig(det(vec(a), b.b - a.a)) <= 0;}\\nbool iLSs(L a, L b) {return sig(det(vec(a), b.a - a.a)) * sig(det(vec(a), b.b - a.a)) < 0;}\\nbool iSS(L a, L b) {\\n int cwa = ccw(a.a, a.b, b.a) | ccw(a.a, a.b, b.b);\\n int cwb = ccw(b.a, b.b, a.a) | ccw(b.a, b.b, a.b);\\n return ((cwa | cwb) & ON) || ((cwa & cwb) == (LEFT | RIGHT));\\n}\\nbool iSSs(L a, L b) {\\n int cwa = ccw(a.a, a.b, b.a) | ccw(a.a, a.b, b.b);\\n int cwb = ccw(b.a, b.b, a.a) | ccw(b.a, b.b, a.b);\\n return (cwa & cwb) == (LEFT | RIGHT);\\n}\\n\\n// テ、ツコツ、テァツつケ\\nP pLL(L a, L b) {return a.a + vec(a) * (det(vec(b), b.a - a.a) / det(vec(b), vec(a)));}\\n\\n// ティツキツ敕ゥツ崢「\\nD dLP(L l, P p) {return abs(det(vec(l), p - l.a)) / abs(vec(l));}\\nD dSP(L s, P p) {\\n if (dot(vec(s), p - s.a) < 0) return abs(p - s.a);\\n if (dot(vec(s), p - s.b) > 0) return abs(p - s.b);\\n return dLP(s, p);\\n}\\nD dLL(L a, L b) {return iLL(a, b) ? 0 : dLP(a, b.a);}\\nD dLS(L a, L b) {return iLS(a, b) ? 0 : min(dLP(a, b.a), dLP(a, b.b));}\\nD dSS(L a, L b) {return iSS(a, b) ? 0 : min(min(dSP(a, b.a), dSP(a, b.b)), min(dSP(b, a.a), dSP(b, a.b)));}\\n\\n// テ・ツ??\\nstruct C{P c; D r;};\\n\\n// 2テ・ツ??」ツ?ョテ、ツスツ催ァツスツョテゥツ鳴「テ、ツソツ?\\nenum RELATION{SAME = 1, CONTAIN = 2, OVER = 4, NO_CROSS = 8, ONE_CROSS = 16, ONE_CONTAIN_CROSS = 32, ONE_OVER_CROSS = 64, TWO_CROSS = 128};\\nint cRel(C c1, C c2) {\\n D d = abs(c1.c - c2.c);\\n if (near(c1.c, c2.c) && !sig(c1.r, c2.r)) return SAME;\\n if (sig(d, c1.r - c2.r) < 0) return OVER;\\n if (sig(d, c2.r - c1.r) < 0) return CONTAIN;\\n if (!sig(d, c1.r - c2.r)) return ONE_OVER_CROSS;\\n if (!sig(d, c2.r - c1.r)) return ONE_CONTAIN_CROSS;\\n if (!sig(d, c1.r + c2.r)) return ONE_CROSS;\\n if (sig(d, c1.r + c2.r) > 0) return NO_CROSS;\\n return TWO_CROSS;\\n}\\n\\n// テ、ツコツ、テ・ツキツョテ・ツ按、テ・ツョツ?\\nbool iCP(C c, P p) {return sig(abs(p - c.c), c.r) <= 0;}\\nbool iCL(C c, L l) {return sig(c.r, dLP(l, c.c)) >= 0;}\\nbool iCS(C c, L s) {return sig(c.r, dSP(s, c.c)) >= 0;}\\nbool iCSc(C c, L s) {return iCS(c, s) && sig(c.r, max(abs(s.a - c.c), abs(s.b - c.c))) >= 0;}\\nbool iCC(C a, C b) {return sig(abs(a.c - b.c), a.r + b.r) <= 0;}\\nbool iCCc(C a, C b) {return iCC(a, b) && sig(abs(a.c - b.c), abs(a.r - b.r)) >= 0;}\\n\\n// テ、ツコツ、テァツつケ\\npair<P, P> pCC(C a, C b) {\\n D x = (norm(a.c - b.c) + a.r * a.r - b.r * b.r) / (2 * abs(a.c - b.c));\\n P e = (b.c - a.c) / abs(b.c - a.c);\\n P y = e * P(0, sr(a.r * a.r - x * x));\\n return make_pair(a.c + e * x - y, a.c + e * x + y);\\n}\\npair<P, P> pCL(C c, L l) {\\n P x = perp(l, c.c);\\n P y = vec(l) / abs(vec(l)) * sr(c.r * c.r - norm(x - c.c));\\n return make_pair(x - y, x + y);\\n}\\n\\n// ティツァツ津」ツ?ョテ・ツ??・ツ、ツ姪・ツ按、テ・ツョツ?ティツァツ誕bテ」ツ?ョテ・ツ??ゥツδィテ」ツ?ォテ」ツ?づ」ツつ古」ツ?ーテヲツュツ」テ」ツ??ィツセツコテ、ツクツ甘」ツ?ッ0テ」ツ??・ツ、ツ姪ゥツδィテ」ツ?ッティツイツ?\\nint sAP(P a, P b, P c) {return sig(det(a, c)) - sig(det(b, c)) - sig(det(a, b));}\\n\\n// テ・ツ、ツ堙ィツァツ津・ツスツ「テ」ツ?ョテゥツ敖「テァツゥツ?\\nD aPol(Pol vp) {\\n D ret = 0;\\n rep (i, vp.size()) ret += det(vp[i], at(vp, i + 1));\\n return ret / 2;\\n}\\n\\n// テ・ツ、ツ堙ィツァツ津・ツスツ「テ」ツ?ョテ・ツ??・ツ、ツ姪・ツ按、テ・ツョツ?テ・ツ??ゥツδィ:1テ」ツ??・ツ堕ィテ、ツクツ?0テ」ツ??・ツ、ツ姪ゥツδィ:-1\\nint sGP(Pol pol, P p) {\\n int side = -1;\\n rep (i, pol.size()) {\\n P p0 = pol[i] - p, p1 = at(pol, i + 1) - p;\\n if (ccw(p0, p1, 0) == ON) return 0;\\n if (p0.Y > p1.Y) swap(p0, p1);\\n if (sig(p0.Y) <= 0 && 0 < sig(p1.Y) && sig(det(p0, p1)) > 0) side *= -1;\\n }\\n return side;\\n}\\n\\n// テ・ツ?クテ・ツ個?\\nPol convexHull(Pol p) {\\n int m = -1, n = p.size();\\n if (n < 3) return p;\\n vector<P> q(n * 2);\\n sort(p.begin(), p.end());\\n for (int i = 0; i < n; q[++m] = p[i++])\\n for (; m > 0 && ccw(q[m - 1], q[m], p[i]) != LEFT; --m);\\n for (int i = n - 2, r = m; i >= 0; q[++m] = p[i--])\\n for (; m > r && ccw(q[m - 1], q[m], p[i]) != LEFT; --m);\\n q.resize(m);\\n return q;\\n}\\n\\n// テ・ツ?クテ・ツ個?」ツつォテ」ツδε」ツδ?\\nPol convexCut(Pol p, L l) {\\n vector<P> q;\\n rep (i, p.size()) {\\n if (ccw(l.a, l.b, p[i]) != RIGHT) q.push_back(p[i]);\\n L s = {p[i], at(p, i + 1)};\\n if (iLSs(l, s)) q.push_back(pLL(l, s));\\n }\\n return q;\\n}\\n\\n// テァツキツ堙・ツ按?」ツつ津」ツδ榲」ツδシテ」ツつクテ」ツ?凖」ツつ?\\nvector<L> merge(vector<L> s) {\\n rep (i, s.size()) if (s[i].b < s[i].a) swap(s[i].a, s[i].b);\\n sort(s.begin(), s.end());\\n rep (i, s.size()) rep (j, i) if (iSS(s[i], s[j]) && !iLL(s[i], s[j])) {\\n s[j].b = max(s[i].b, s[j].b);\\n s.erase(s.begin() + i--);\\n break;\\n }\\n return s;\\n}\\n\\n// テァツキツ堙・ツ按?」ツつ「テ」ツδャテ」ツδウテ」ツつクテ」ツδ。テ」ツδウテ」ツδ?テゥツ堋」テ」ツ?ョテァツつケテ」ツ?クテ」ツ?ョティツセツコテ」ツ?ョテ」ツ?ソテ」ツつ津ヲツ個?」ツ?、\\nvector<vector<int> > sArr(vector<L> s, vector<P> &vp) {\\n s = merge(s);\\n rep (i, s.size()) {\\n vp.push_back(s[i].a);\\n vp.push_back(s[i].b);\\n }\\n rep (i, s.size()) rep (j, i) if (iSS(s[i], s[j])) vp.push_back(pLL(s[i], s[j]));\\n sort(vp.begin(), vp.end());\\n vp.erase(unique(vp.begin(), vp.end(), near), vp.end());\\n vector<vector<int> > g(vp.size());\\n rep (i, s.size()) {\\n vector<pair<D, int> > v;\\n rep (j, vp.size()) if (ccw(s[i].a, s[i].b, vp[j]) == ON) {\\n v.push_back(make_pair(norm(vp[j] - s[i].a), j));\\n }\\n sort(v.begin(), v.end());\\n rep (j, v.size() - 1) {\\n g[v[j + 1].second].push_back(v[j].second);\\n g[v[j].second].push_back(v[j + 1].second);\\n }\\n }\\n return g;\\n}\\n\\nint main() {\\n while (true) {\\n int n, m;\\n cin >> n >> m;\\n if (n == 0 && m == 0) break;\\n Pol p(n), q(m);\\n rep (i, n) cin >> p[i].X >> p[i].Y;\\n rep (i, m) cin >> q[i].X >> q[i].Y;\\n P c;\\n cin >> c.X >> c.Y;\\n D res = 2 * PI;\\n rep (i, n) {\\n\\tif (near(c, p[i])) continue;\\n\\tC a = (C){c, abs(c - p[i])};\\n\\trep (j, m) {\\n\\t L s = (L){q[j], at(q, j + 1)};\\n\\t if (!iCL(a, s)) continue;\\n\\t pair<P, P> pp = pCL(a, s);\\n\\t if (ccw(s.a, s.b, pp.first) == ON) {\\n\\t res = min(res, arg(c, pp.first, p[i]));\\n\\t }\\n\\t if (ccw(s.a, s.b, pp.second) == ON) {\\n\\t res = min(res, arg(c, pp.second, p[i]));\\n\\t }\\n\\t}\\n }\\n swap(n, m);\\n swap(p, q);\\n rep (i, n) {\\n\\tif (near(c, p[i])) continue;\\n\\tC a = (C){c, abs(c - p[i])};\\n\\trep (j, m) {\\n\\t L s = (L){q[j], at(q, j + 1)};\\n\\t if (!iCL(a, s)) continue;\\n\\t pair<P, P> pp = pCL(a, s);\\n\\t if (ccw(s.a, s.b, pp.first) == ON) {\\n\\t res = min(res, arg(c, p[i], pp.first));\\n\\t }\\n\\t if (ccw(s.a, s.b, pp.second) == ON) {\\n\\t res = min(res, arg(c, p[i], pp.second));\\n\\t }\\n\\t}\\n }\\n printf(\\\"%.12Lf\\\\n\\\", res * 180 / PI);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1292,\n \"score_of_the_acc\": -0.1581,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2045_565636\",\n \"code_snippet\": \"#include <cstdio>\\n#include <complex>\\n#include <cmath>\\n#include <algorithm>\\n#include <vector>\\nusing namespace std;\\n\\ntypedef complex<double> P;\\ntypedef const P &rP;\\n\\ndouble pi2;\\n\\nvector<double> intrarg(rP s, double r, rP p, rP q){\\n\\tvector<double> ret;\\n\\tP v = q - p;\\n\\tP w = p - s;\\n\\tdouble a = norm(v);\\n\\tdouble b = real(v) * real(w) + imag(v) * imag(w);\\n\\tdouble c = norm(w) - r * r;\\n\\tdouble D = b * b - a * c;\\n\\tdouble t;\\n\\tif(D >= 0.0){\\n\\t\\tD = sqrt(D);\\n\\t\\tfor(double sgn = -1.0; sgn < 2.0; sgn += 2.0){\\n\\t\\t\\tt = (-b + sgn * D) / a;\\n\\t\\t\\tif(t > 0.0 && t < 1.0){\\n\\t\\t\\t\\tret.push_back(arg(w + t * v));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\ndouble difarg(double a, double b){\\n\\ta -= b;\\n\\twhile(a < 0.0) a += pi2;\\n\\twhile(a >= pi2) a -= pi2;\\n\\treturn a;\\n}\\n\\nint main(){\\n\\tpi2 = acos(-1.0) * 2.0;\\n\\t\\n\\tint m, n;\\n\\tdouble x, y;\\n\\twhile(scanf(\\\"%d%d\\\", &m, &n), m){\\n\\t\\tvector<P> p(m + 1), q(n + 1);\\n\\t\\tfor(int i = 0; i < m; ++i){\\n\\t\\t\\tscanf(\\\"%lf%lf\\\", &x, &y);\\n\\t\\t\\tp[i] = P(x, y);\\n\\t\\t}\\n\\t\\tp[m] = p[0];\\n\\t\\tfor(int i = 0; i < n; ++i){\\n\\t\\t\\tscanf(\\\"%lf%lf\\\", &x, &y);\\n\\t\\t\\tq[i] = P(x, y);\\n\\t\\t}\\n\\t\\tq[n] = q[0];\\n\\t\\tscanf(\\\"%lf%lf\\\", &x, &y);\\n\\t\\tP c(x, y);\\n\\n\\t\\tdouble ans = pi2;\\n\\n\\t\\tfor(int i = 0; i < n; ++i){\\n\\t\\t\\tdouble r1 = abs(q[i] - c);\\n\\t\\t\\tdouble base1 = arg(q[i] - c);\\n\\t\\t\\tfor(int j = 0; j < m; ++j){\\n\\t\\t\\t\\tdouble r2 = abs(p[j] - c);\\n\\t\\t\\t\\tdouble base2 = arg(p[j] - c);\\n\\n\\t\\t\\t\\tvector<double> ret = intrarg(c, r1, p[j], p[j+1]);\\n\\t\\t\\t\\tfor(int k = 0; k < ret.size(); ++k){\\n\\t\\t\\t\\t\\tans = min(ans, difarg(ret[k], base1));\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tret = intrarg(c, r2, q[i], q[i+1]);\\n\\t\\t\\t\\tfor(int k = 0; k < ret.size(); ++k){\\n\\t\\t\\t\\t\\tans = min(ans, difarg(base2, ret[k]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"%.9f\\\\n\\\", ans / pi2 * 360.0);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1212,\n \"score_of_the_acc\": -0.1226,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2045_406504\",\n \"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\\nconst double EPS=1e-9;\\nconst double PI=acos(-1);\\n\\ntemplate<class T>\\nstruct point{\\n\\tT x,y;\\n\\tpoint operator+(const point &a)const{ return (point){x+a.x,y+a.y}; }\\n\\tpoint operator-(const point &a)const{ return (point){x-a.x,y-a.y}; }\\n};\\n\\ntemplate<class T>\\npoint<T> operator*(T c,const point<T> &a){ return (point<T>){c*a.x,c*a.y}; }\\n\\ntemplate<class T>\\npoint<double> operator/(const point<T> &a,double c){\\n\\treturn (point<double>){a.x/c,a.y/c};\\n}\\n\\nbool operator<(const point<double> &a,const point<double> &b){\\n\\treturn a.x+EPS<b.x || abs(a.x-b.x)<EPS && a.y+EPS<b.y;\\n}\\n\\ntemplate<class T>\\nstruct line{ point<T> a,b; };\\n\\ntemplate<class T>\\nstruct segment{\\n\\tpoint<T> a,b;\\n\\toperator line<T>()const{ return (line<T>){a,b}; }\\n};\\n\\ntemplate<class T>\\nstruct polygon:vector< point<T> >{\\n\\tpolygon(){}\\n\\tpolygon(int n):vector< point<T> >(n){}\\n};\\n\\ntemplate<class T>\\nT dot(const point<T> &a,const point<T> &b){ return a.x*b.x+a.y*b.y; }\\n\\ntemplate<class T>\\nT cross(const point<T> &a,const point<T> &b){ return a.x*b.y-a.y*b.x; }\\n\\npoint<double> rot(const point<double> &a,double theta){\\n\\treturn (point<double>){a.x*cos(theta)-a.y*sin(theta),a.x*sin(theta)+a.y*cos(theta)};\\n}\\n\\nenum {CCW=1,CW=-1,ON=0};\\nint ccw(const point<double> &a,const point<double> &b,const point<double> &c){\\n\\tdouble rdir=cross(b-a,c-a);\\n\\tif(rdir> EPS) return CCW;\\n\\tif(rdir<-EPS) return CW;\\n\\treturn ON;\\n}\\n\\nbool cover(const polygon<double> &G,const point<double> &p){\\n\\tint n=G.size();\\n\\tbool res=false;\\n\\trep(i,n){\\n\\t\\tpoint<double> v1=G[i]-p,v2=G[(i+1)%n]-p;\\n\\t\\tif(v1.y>v2.y) swap(v1,v2);\\n\\t\\tif(v1.y<EPS && EPS<v2.y && cross(v1,v2)>EPS) res=!res;\\n\\t\\tif(abs(cross(v1,v2))<EPS && dot(v1,v2)<EPS) return true;\\n\\t}\\n\\treturn res;\\n}\\n\\nbool intersect(const segment<double> &S1,const segment<double> &S2){\\n\\tif(max(S1.a.x,S1.b.x)+EPS<min(S2.a.x,S2.b.x)\\n\\t|| max(S1.a.y,S1.b.y)+EPS<min(S2.a.y,S2.b.y)\\n\\t|| max(S2.a.x,S2.b.x)+EPS<min(S1.a.x,S1.b.x)\\n\\t|| max(S2.a.y,S2.b.y)+EPS<min(S1.a.y,S1.b.y)) return false;\\n\\treturn ccw(S1.a,S1.b,S2.a)*ccw(S1.a,S1.b,S2.b)<=0\\n\\t\\t&& ccw(S2.a,S2.b,S1.a)*ccw(S2.a,S2.b,S1.b)<=0;\\n}\\n\\npoint<double> get_intersect(const line<double> &L1,const line<double> &L2){\\n\\tdouble a1=cross(L1.b-L1.a,L2.b-L2.a);\\n\\tdouble a2=cross(L1.b-L1.a,L1.b-L2.a);\\n\\tif(abs(a1)<EPS) return L1.a;\\n\\treturn L2.a+a2/a1*(L2.b-L2.a);\\n}\\n\\nbool cover(const polygon<double> &G,const polygon<double> &H){\\n\\tint m=G.size(),n=H.size();\\n\\n\\trep(i,n){\\n\\t\\tif(!cover(G,H[i])) return false;\\n\\n\\t\\tsegment<double> S={H[i],H[(i+1)%n]};\\n\\n\\t\\tvector< point<double> > cand; // H の辺 i と G との交点全体\\n\\t\\tcand.push_back(S.a);\\n\\t\\tcand.push_back(S.b);\\n\\t\\trep(j,m){\\n\\t\\t\\tsegment<double> T={G[j],G[(j+1)%m]};\\n\\t\\t\\tif(intersect(S,T)){\\n\\t\\t\\t\\tcand.push_back(get_intersect(S,T));\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tsort(cand.begin(),cand.end());\\n\\t\\trep(j,(int)cand.size()-1){\\n\\t\\t\\tpoint<double> p=(cand[j]+cand[j+1])/2;\\n\\t\\t\\tif(!cover(G,p)) return false;\\n\\t\\t}\\n\\t}\\n\\n\\treturn true;\\n}\\n\\nint main(){\\n\\tfor(int m,n;scanf(\\\"%d%d\\\",&m,&n),m;){\\n\\t\\tpolygon<double> G(m),H(n);\\n\\t\\trep(i,m) scanf(\\\"%lf%lf\\\",&G[i].x,&G[i].y);\\n\\t\\trep(i,n) scanf(\\\"%lf%lf\\\",&H[i].x,&H[i].y);\\n\\t\\tpoint<double> c;\\n\\t\\tscanf(\\\"%lf%lf\\\",&c.x,&c.y);\\n\\n\\t\\tpolygon<double> H2(n);\\n\\t\\tint deg;\\n\\t\\tfor(deg=1;deg<360;deg++){\\n\\t\\t\\trep(i,n) H2[i]=rot(H[i]-c,deg*PI/180)+c;\\n\\t\\t\\tif(!cover(G,H2)) break;\\n\\t\\t}\\n\\n\\t\\tdouble lo=(deg-1)*PI/180,hi=deg*PI/180;\\n\\t\\trep(_,30){\\n\\t\\t\\tdouble mi=(lo+hi)/2;\\n\\t\\t\\trep(i,n) H2[i]=rot(H[i]-c,mi)+c;\\n\\t\\t\\tif(cover(G,H2)) lo=mi; else hi=mi;\\n\\t\\t}\\n\\t\\tprintf(\\\"%.9f\\\\n\\\",(lo+hi)/2*180/PI);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 876,\n \"score_of_the_acc\": -0.1258,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2045_131631\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<complex>\\n#include<vector>\\n#include<cmath>\\n#define REP(i,b,n) for(int i=b;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define NEXT(i,n) ((i+1)%(n))\\n#define mp make_pair\\n#define pb push_back\\nusing namespace std;\\n\\ntypedef complex<double> P;\\n\\nconst double pi = acos(-1);\\n\\npair<double,double> check(double dx,double dy,double rx,double ry,double r,\\n\\t\\t\\t bool &flag){\\n double a=(dx*dx+dy*dy),b=-2*rx*dx-2*ry*dy,c=rx*rx+ry*ry-r*r;\\n double D=b*b-4*a*c;\\n if (D < 0)return mp(-1,-1);\\n flag=true;\\n return mp((-b-sqrt(D))/(2*a),(-b+sqrt(D))/(2*a));\\n}\\n\\ninline P getnorm(P a){\\n return a/abs(a);\\n}\\n\\nbool isp(P a,P b,P c){\\n return abs(a-c)+abs(b-c) < abs(a-b)+1e-10;\\n}\\n\\n\\nvoid getdata(vector<P> &p,vector<P> &e,vector<double> &a,bool flag){\\n rep(i,p.size()){\\n double r = abs(p[i]);\\n double ori=arg(p[i]);\\n rep(j,e.size()){\\n bool cansolve=false;\\n P norm=getnorm(e[NEXT(j,e.size())]-e[j]);\\n pair<double,double> tmp=check(norm.real(),norm.imag(),-e[j].real(),-e[j].imag(),r,cansolve);\\n if (!cansolve)continue;\\n rep(k,2){\\n\\tP point=e[j]+tmp.first*norm;\\n\\tif (isp(e[j],e[NEXT(j,e.size())],point)){\\n\\t double t = arg(point);\\n\\t if (flag){\\n\\t if (t <ori)t+=2*pi;\\n\\t a.pb(t-ori);\\n\\t }else {\\n\\t if (ori < t)t-=2*pi;\\n\\t a.pb(ori-t);\\n\\t }\\n\\t}\\n\\tswap(tmp.first,tmp.second);\\n }\\n }\\n }\\n}\\n\\ndouble solve(vector<P> &p,vector<P> &e){//cx,cy=0,0\\n vector<double> a;\\n a.pb(2*pi);\\n getdata(p,e,a,true);\\n getdata(e,p,a,false);\\n sort(a.begin(),a.end());\\n return a[0]*180/pi;\\n}\\n\\n\\nmain(){\\n int n,m;\\n while(cin>>n>>m && n){\\n vector<P> e(n),p(m);\\n rep(i,e.size()){\\n double x,y;cin>>x>>y;e[i]=P(x,y);\\n }\\n rep(i,p.size()){\\n double x,y;cin>>x>>y;p[i]=P(x,y);\\n }\\n double cx,cy;\\n cin>>cx>>cy;\\n P minus=P(cx,cy);\\n rep(i,e.size())e[i]-=minus;\\n rep(i,p.size())p[i]-=minus;\\n printf(\\\"%.7lf\\\\n\\\",solve(p,e));\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1004,\n \"score_of_the_acc\": -0.053,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1079,"cells":{"group_id":{"kind":"string","value":"aoj_2050_cpp"},"problem_description":{"kind":"string","value":"Problem C:\nDig or Climb\nBenjamin Forest VIII is a king of a country. One of his best friends Nod lives in a village far from\nhis castle. Nod gets seriously sick and is on the verge of death. Benjamin orders his subordinate\nRed to bring good medicine for him as soon as possible. However, there is no road from the\ncastle to the village. Therefore, Red needs to climb over mountains and across canyons to reach\nthe village. He has decided to get to the village on the shortest path on a map, that is, he will\nmove on the straight line between the castle and the village. Then his way can be considered as\npolyline with\nn\npoints (\nx\n1\n,\ny\n1\n) . . . (\nx\nn\n,\ny\nn\n) as illustlated in the following figure.\nFigure 1: An example route from the castle to the village\nHere,\nx\ni\nindicates the distance between the castle and the point\ni\n, as the crow flies, and\ny\ni\nindicates the height of the point\ni\n. The castle is located on the point (\nx\n1\n,\ny\n1\n), and the village is\nlocated on the point (\nx\nn\n,\ny\nn\n).\nRed can walk in speed\nv\nw\n. Also, since he has a skill to cut a tunnel through a mountain\nhorizontally, he can move inside the mountain in speed\nv\nc\n.\nYour job is to write a program to the minimum time to get to the village.\nInput\nThe input is a sequence of datasets. Each dataset is given in the following format:\nn\nv\nw\nv\nc\nx\n1\ny\n1\n...\nx\nn\ny\nn\nYou may assume all the following:\nn\n≤ 1,000, 1 ≤\nv\nw\n,\nv\nc\n≤ 10, -10,000 ≤\nx\ni\n,\ny\ni\n≤ 10,000, and\nx\ni\n<\nx\nj\nfor all\ni\n<\nj\n.\nThe input is terminated in case of\nn\n= 0. This is not part of any datasets and thus should not\nbe processed.\nOutput\nFor each dataset, you should print the minimum time required to get to the village in a line.\nEach minimum time should be given as a decimal with an arbitrary number of fractional digits\nand with an absolute error of at most 10\n-6\n. No extra space or character is allowed.\nSample Input\n3\n2 1\n0 0\n50 50\n100 0\n3\n1 1\n0 0\n50 50\n100 0\n3\n1 2\n0 0\n50 50\n100 0\n3\n2 1\n0 0\n100 100\n150 50\n6\n1 2\n0 0\n50 50\n100 0\n150 0\n200 50\n250 0\n0\nOutput for the Sample Input\n70.710678\n100.000000\n50.000000\n106.066017\n150.000000"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2050_3057190","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\n#include <map>\n#include <queue>\nusing namespace std;\nconst double EPS = 1e-6;\nconst double INF = 1e12;\nconst double PI = acos(-1);\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\n\ntypedef complex<double> P;\ntypedef vector<P> VP;\nstruct L : array<P, 2>{\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\n L(){}\n};\n\nnamespace std{\n bool operator < (const P& a, const P& b){\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\n }\n bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){\n return (conj(a)*b).X;\n}\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\n}\nint ccw(P a, P b, P c){\n b -= a;\n c -= a;\n if(cross(b,c) > EPS) return +1; //ccw\n if(cross(b,c) < -EPS) return -1; //cw\n if(dot(b,c) < -EPS) return +2; //c-a-b\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\n return 0; //a-c-b\n}\n\nbool intersectSS(const L& a, const L& b){\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\n}\nbool intersectSP(const L& s, const P &p){\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\n}\n\nbool isParallel(const P &a, const P &b){\n return abs(cross(a,b)) < EPS;\n}\nbool isParallel(const L &a, const L &b){\n return isParallel(a[1]-a[0], b[1]-b[0]);\n}\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1]-l[0], m[1]-m[0]);\n double B = cross(l[1]-l[0], l[1]-m[0]);\n return m[0] + B/A *(m[1]-m[0]);\n}\n\nint in_poly(const P &p, const VP &poly){\n int n = poly.size();\n int ret = -1;\n for(int i=0; i<n; i++){\n P a = poly[i]-p;\n P b = poly[(i+1)%n]-p;\n if(a.Y > b.Y) swap(a,b);\n if(intersectSP(L(a,b), P(0,0))) return 0;\n if(a.Y<=0 && b.Y>0 && cross(a,b)<0) ret = -ret;\n }\n return ret;\n}\n\npair<vector<vector<int> >, VP> arrangement(const vector<L> &l){\n vector<VP> cp(l.size());\n VP plist;\n for(int i=0; i<(int)l.size(); i++){\n for(int j=i+1; j<(int)l.size(); j++){\n if(!isParallel(l[i], l[j]) && intersectSS(l[i], l[j])){\n P cpij = crosspointLL(l[i], l[j]);\n cp[i].push_back(cpij);\n cp[j].push_back(cpij);\n plist.push_back(cpij);\n }\n }\n cp[i].push_back(l[i][0]);\n cp[i].push_back(l[i][1]);\n plist.push_back(l[i][0]);\n plist.push_back(l[i][1]);\n sort(cp[i].begin(), cp[i].end());\n cp[i].erase(unique(cp[i].begin(), cp[i].end()), cp[i].end());\n }\n sort(plist.begin(), plist.end());\n plist.erase(unique(plist.begin(), plist.end()), plist.end());\n\n int n = plist.size();\n map<P, int> conv;\n for(int i=0; i<n; i++){\n conv[plist[i]] = i;\n }\n vector<vector<int> > adj(n);\n for(int i=0; i<(int)cp.size(); i++){\n for(int j=0; j<(int)cp[i].size()-1; j++){\n int jidx = conv[cp[i][j]];\n int jp1idx = conv[cp[i][j+1]];\n adj[jidx].push_back(jp1idx);\n adj[jp1idx].push_back(jidx);\n }\n }\n for(int i=0; i<n; i++){\n sort(adj[i].begin(), adj[i].end());\n adj[i].erase(unique(adj[i].begin(), adj[i].end()), adj[i].end());\n }\n return make_pair(adj, plist);\n}\n\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n double vw,vc;\n cin >> vw >> vc;\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 double xmin = p[0].X, xmax = p[n-1].X;\n VP poly = p;\n reverse(poly.begin(), poly.end());\n poly.push_back(P(xmin, -2e4));\n poly.push_back(P(xmax, -2e4));\n\n vector<L> l;\n for(int i=0; i<n; i++){\n if(i != n-1){\n l.push_back(L(p[i], p[i+1]));\n }\n double y = p[i].Y;\n L cut(P(xmin, y), P(xmax, y));\n VP cp;\n for(int j=0; j<n-1; j++){\n L edge(p[j], p[j+1]);\n if(!isParallel(cut, edge) && intersectSS(cut, edge)){\n cp.push_back(crosspointLL(cut, edge));\n }\n }\n cp.erase(unique(cp.begin(), cp.end()), cp.end());\n int idx = lower_bound(cp.begin(), cp.end(), p[i]) -cp.begin();\n if(idx == (int)cp.size() || !(cp[idx] == p[i])){\n continue;\n }\n if(i > 0 && p[i-1].Y > p[i].Y +EPS && idx > 0){\n l.push_back(L(cp[idx-1], cp[idx]));\n }\n if(i < n-1 && p[i].Y +EPS < p[i+1].Y && idx < (int)cp.size()-1){\n l.push_back(L(cp[idx], cp[idx+1]));\n }\n }\n sort(l.begin(), l.end());\n l.erase(unique(l.begin(), l.end()), l.end());\n pair<vector<vector<int> >, VP> ret = arrangement(l);\n vector<vector<int> > &adj = ret.first;\n VP &plist = ret.second;\n\n vector<vector<pair<int, double> > > adj2(adj.size());\n for(int i=0; i<(int)adj.size(); i++){\n adj2[i].resize(adj[i].size());\n for(int j=0; j<(int)adj[i].size(); j++){\n P mid = (plist[i] +plist[adj[i][j]])/2.0;\n double cost;\n if(in_poly(mid, poly) == 1){\n cost = abs(plist[i] -plist[adj[i][j]]) /vc;\n }else{\n cost = abs(plist[i] -plist[adj[i][j]]) /vw;\n }\n adj2[i][j] = make_pair(adj[i][j], cost);\n }\n }\n\n priority_queue<pair<double, int> > wait;\n wait.push(make_pair(0, 0));\n vector<double> mincost(adj2.size(), INF);\n mincost[0] = 0;\n while(!wait.empty()){\n double cost = -wait.top().first;\n int pos = wait.top().second;\n wait.pop();\n if(cost > mincost[pos] +EPS) continue;\n if(pos == (int)adj2.size()-1) break;\n for(int i=0; i<(int)adj2[pos].size(); i++){\n int npos = adj2[pos][i].first;\n double ncost = cost +adj2[pos][i].second;\n if(ncost +EPS < mincost[npos]){\n mincost[npos] = ncost;\n wait.push(make_pair(-ncost, npos));\n }\n }\n }\n cout << fixed << setprecision(10);\n cout << mincost[adj2.size()-1] << endl;\n } \n return 0;\n}","accuracy":1,"time_ms":620,"memory_kb":3860,"score_of_the_acc":-1.3665,"final_rank":15},{"submission_id":"aoj_2050_1171326","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#include <complex>\n#include <assert.h>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <double,double> P;\n \nstatic const int tx[] = {+0,+1,+0,-1};\nstatic const int ty[] = {-1,+0,+1,+0};\n \nstatic const double EPS = 1e-8;\n\ntypedef complex<double> Point;\n\nnamespace std {\n bool operator < (const Point& a, const Point& b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n }\n}\n\ndouble cross(const Point& a, const Point& b) {\n return imag(conj(a)*b);\n}\ndouble dot(const Point& a, const Point& b) {\n return real(conj(a)*b);\n}\n\nstruct Line : public vector<Point> {\n Line(const Point &a, const Point &b) {\n push_back(a); push_back(b);\n }\n};\n\nint ccw(Point a, Point b, Point c) {\n b -= a; c -= a;\n if (cross(b, c) > 0) return +1; // counter clockwise\n if (cross(b, c) < 0) return -1; // clockwise\n if (dot(b, c) < 0) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line\n return 0;\n}\n\nbool intersectSS(const Line &s, const Line &t) {\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\n\nPoint crosspoint(const Line &l, const Line &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 if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m[0] + B / A * (m[1] - m[0]);\n}\n\ndouble compute_area(const Point &l,const Point &m){\n return abs(cross(l,m)) / 2.0;\n}\n\nbool is_equal(const Point &l,const Point &m){\n return ((abs(real(l) - real(m)) < EPS) && (abs(imag(l) - imag(m) < EPS)));\n}\n\nclass State {\npublic:\n int pos;\n double cost;\n State(int pos,double cost) :\n pos(pos), cost(cost) {}\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\ndouble dp[3001];\nvector<State> costs[3001];\n\nint main(){\n int n;\n while(~scanf(\"%d\",&n)){\n if(n == 0) break;\n\n double vw,vc; \n scanf(\"%lf %lf\",&vw,&vc);\n vector<Point> points;\n for(int i = 0; i < n; i++){\n double x,y;\n scanf(\"%lf %lf\",&x,&y);\n points.push_back(Point(x,y));\n }\n\n for(int i = 0; i <= 2000; i++){\n dp[i] = 1e10;\n costs[i].clear();\n }\n vector<double> x;\n for(int i = 0; i < n; i++){\n x.push_back(points[i].real());\n Line here2right(points[i],Point(1e10,points[i].imag()));\n for(int j = i + 1; j + 1 < n; j++){\n if(points[i].imag() + EPS >= points[j].imag()) break;\n Line target(points[j],points[j+1]);\n if(intersectSS(here2right,target)){\n x.push_back(crosspoint(here2right,target).real());\n break;\n }\n }\n\n Line here2left(Point(-1e10,points[i].imag()),points[i]);\n for(int j = i - 1; j - 1 >= 0; j--){\n if(points[i].imag() + EPS >= points[j].imag()) break;\n Line target(points[j-1],points[j]);\n if(intersectSS(here2left,target)){\n x.push_back(crosspoint(here2left,target).real());\n break;\n }\n }\n }\n sort(x.begin(),x.end());\n x.erase(unique(x.begin(),x.end()),x.end());\n\n for(int i = 0; i < n; i++){\n int from = lower_bound(x.begin(),x.end(),points[i].real() - EPS) - x.begin();\n if(i + 1 < n){\n int to = lower_bound(x.begin(),x.end(),points[i+1].real() - EPS) - x.begin(); \n costs[from].push_back(State(to,abs(points[i+1]-points[i])/vw));\n costs[to].push_back(State(from,abs(points[i+1]-points[i])/vw));\n }\n Line here2right(points[i],Point(1e10,points[i].imag()));\n for(int j = i + 1; j + 1 < n; j++){\n if(points[i].imag() + EPS >= points[j].imag()) break;\n Line target(points[j],points[j+1]);\n if(intersectSS(here2right,target)){\n Point p = crosspoint(here2right,target);\n int lhs = lower_bound(x.begin(),x.end(),points[j].real() - EPS) - x.begin(); \n int mid = lower_bound(x.begin(),x.end(),p.real() - EPS) - x.begin();\n int rhs = lower_bound(x.begin(),x.end(),points[j+1].real() - EPS) - x.begin(); \n\n costs[from].push_back(State(mid,abs(p - points[i])/vc));\n costs[mid].push_back(State(from,abs(p - points[i])/vc));\n\n costs[lhs].push_back(State(mid,abs(p - points[j])/vw));\n costs[mid].push_back(State(rhs,abs(p - points[j+1])/vw));\n\n costs[mid].push_back(State(lhs,abs(p - points[j])/vw));\n costs[rhs].push_back(State(mid,abs(p - points[j+1])/vw));\n break;\n }\n }\n\n Line here2left(Point(-1e10,points[i].imag()),points[i]);\n for(int j = i - 1; j - 1 >= 0; j--){\n if(points[i].imag() + EPS >= points[j].imag()) break;\n Line target(points[j-1],points[j]);\n if(intersectSS(here2left,target)){\n Point p = crosspoint(here2left,target);\n int rhs = lower_bound(x.begin(),x.end(),points[j].real() - EPS) - x.begin(); \n int mid = lower_bound(x.begin(),x.end(),p.real() - EPS) - x.begin();\n int lhs = lower_bound(x.begin(),x.end(),points[j-1].real() - EPS) - x.begin(); \n\n costs[from].push_back(State(mid,abs(p - points[i])/vc));\n costs[mid].push_back(State(from,abs(p - points[i])/vc));\n\n costs[rhs].push_back(State(mid,abs(p - points[j])/vw));\n costs[mid].push_back(State(rhs,abs(p - points[j])/vw));\n\n costs[mid].push_back(State(lhs,abs(p - points[j-1])/vw));\n costs[lhs].push_back(State(mid,abs(p - points[j-1])/vw));\n break;\n }\n }\n }\n \n int goal_pos = x.size() - 1;\n dp[0] = 0.0;\n priority_queue<State,vector<State>,greater<State> > que;\n que.push(State(0,0));\n\n while(!que.empty()){\n State s = que.top();\n que.pop();\n if(s.pos == goal_pos) break;\n\n for(int i = 0; i < costs[s.pos].size(); i++){\n int next_pos = costs[s.pos][i].pos;\n double next_cost = costs[s.pos][i].cost;\n if(dp[next_pos] > s.cost + next_cost){\n dp[next_pos] = s.cost + next_cost;\n que.push(State(next_pos,s.cost + next_cost));\n }\n }\n }\n printf(\"%.7lf\\n\",dp[goal_pos]);\n }\n}","accuracy":1,"time_ms":100,"memory_kb":1572,"score_of_the_acc":-0.2968,"final_rank":11},{"submission_id":"aoj_2050_949828","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-7)\n#define equals(a,b) (fabs((a)-(b)) < EPS)\n\nusing namespace std;\n\nconst int IINF = INT_MAX;\n\n// Library - template - begin\n\nclass Point{\npublic:\n double x,y;\n Point(double x = -IINF,double y = -IINF): x(x),y(y){}\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:y<p.y; }\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\n\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\ndouble abs(Point a){ return sqrt(norm(a)); }\n\n// Library - template - end\n\n// Library - intersect - begin\nPoint crosspoint(Line l, Line m) {\n double A = cross(l.p2 - l.p1, m.p2 - m.p1);\n double B = cross(l.p2 - l.p1, l.p2 - m.p1);\n if (abs(A) < EPS && abs(B) < EPS) return m.p1; // same line\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m.p1 + (m.p2 - m.p1) * (B / A);\n}\n// Library - intersect - end\n\nint V;\ndouble vw,vc;\nPoint ps[1010];\nbool here[1010]; // here is the point\ndouble mincost[1010];\n\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\n\nint main(){\n\n while( cin >> V, V ){\n cin >> vw >> vc;\n rep(i,V) cin >> ps[i].x >> ps[i].y;\n\n rep(i,V) mincost[i] = IINF;\n mincost[0] = 0;\n REP(i,1,V) mincost[i] = mincost[i-1] + abs(ps[i]-ps[i-1]) / vw;\n\n rep(i,V-2){\n if( !( LT(ps[i].y,ps[i+1].y) ) ) continue;\n double lower = ps[i+1].y;\n REP(k,i+2,V){\n if( !( ps[k-1].y > ps[k].y ) ) {\n lower = min(lower,ps[k].y);\n continue;\n }\n if( ps[k].y < lower ){\n double Y = max(ps[i].y,ps[k].y);\n Line line = Line(Point(-10100,Y),Point(10100,Y));\n Point sp = ps[i], gp = ps[k];\n Point np = crosspoint(line,Line(ps[i ],ps[i+1]));\n Point mp = crosspoint(line,Line(ps[k-1],ps[k]));\n double dist1 = abs(np-sp);\n double dist3 = abs(np-mp);\n double dist4 = abs(gp-mp);\n double time1 = dist1 / vw + dist3 / vc + dist4 / vw;\n if( LT(mincost[i]+time1,mincost[k]) ){\n mincost[k] = mincost[i]+time1;\n REP(j,k,V) mincost[j] = min(mincost[j],mincost[j-1] + abs(ps[j]-ps[j-1])/vw);\n }\n }\n lower = min(lower,ps[k].y);\n if( lower < ps[i].y ) break; //これ忘れてた\n }\n }\n printf(\"%.8f\\n\",mincost[V-1]);\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1272,"score_of_the_acc":-0.1536,"final_rank":6},{"submission_id":"aoj_2050_949827","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-7)\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)\n\nusing namespace std;\n\nconst int IINF = INT_MAX;\n\n// Library - template - begin\n\nclass Point{\npublic:\n double x,y;\n\n Point(double x = -IINF,double y = -IINF): x(x),y(y){}\n\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:y<p.y; }\n\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n bool operator == (const Segment& p)const { return p.p1 == p1 && p.p2 == p2; }\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\nostream& operator << (ostream& os,const Point& a){ os << \"(\" << a.x << \",\" << a.y << \")\"; }\n\nostream& operator << (ostream& os,const Segment& a){ os << \"( \" << a.p1 << \" , \" << a.p2 << \" )\"; }\n\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\n\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\n\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\n\ndouble abs(Point a){ return sqrt(norm(a)); }\n\n//rad は角度をラジアンで持たせること\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n\n// 度をラジアンに変換\ndouble toRad(double agl){ return agl*M_PI/180.0; }\n\n// Library - template - end\n\n\n// Library - ccw - bingin\n\nint ccw(Point p0,Point p1,Point p2){\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS)return CLOCKWISE;\n if(dot(a,b) < -EPS)return ONLINE_BACK;\n if(norm(a) < norm(b))return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n\n// Library - ccw - end\n\n// Library - intersect - begin\n\nbool intersectLL(Line l, Line m) {\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\n}\nbool intersectLS(Line l, Line s) {\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\n}\nbool intersectLP(Line l,Point p) {\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\n}\nbool intersectSS(Line s, Line t) {\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\n}\nbool intersectSP(Line s, Point p) {\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\n}\n\nPoint projection(Line l,Point p) {\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\n return l.p1 + (l.p1-l.p2)*t;\n}\nPoint reflection(Line l,Point p) {\n return p + (projection(l, p) - p) * 2;\n}\ndouble distanceLP(Line l, Point p) {\n return abs(p - projection(l, p));\n}\ndouble distanceLL(Line l, Line m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\n}\n\ndouble distanceLS(Line l, Line s) {\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\n}\ndouble distanceSP(Line s, Point p) {\n Point r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s.p1 - p), abs(s.p2 - p));\n}\n\ndouble distanceSS(Line s, Line t) {\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\n}\n\n/*\nsame lineの時注意\nもしm.p1が中心でなかったときに正しい答えとならない\nPoint crosspoint(Line l,Line m){\n double A = cross(l.p2-l.p1,m.p2-m.p1);\n double B = cross(l.p2-l.p1,l.p2-m.p1);\n if(abs(A) < EPS && abs(B) < EPS){\n vector<Point> vec;\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\n sort(vec.begin(),vec.end());\n assert(vec[1] == vec[2]);\n return vec[1];\n //return m.p1;\n }\n if(abs(A) < EPS)assert(false);\n return m.p1 + (m.p2-m.p1)*(B/A);\n}\n\n*/\nPoint crosspoint(Line l, Line m) {\n double A = cross(l.p2 - l.p1, m.p2 - m.p1);\n double B = cross(l.p2 - l.p1, l.p2 - m.p1);\n if (abs(A) < EPS && abs(B) < EPS) return m.p1; // same line\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m.p1 + (m.p2 - m.p1) * (B / A);\n}\n\n\n// Library - intersect - end\n\nint V;\ndouble vw,vc;\nPoint ps[1010];\nbool here[1010]; // here is the point\ndouble mincost[1010];\n\n// a < b\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\n\n// a <= b\ninline bool LTE(double a,double b) { return equals(a,b) || a < b; }\n\nint main(){\n\n while( cin >> V, V ){\n cin >> vw >> vc;\n rep(i,V) cin >> ps[i].x >> ps[i].y;\n\n rep(i,V) mincost[i] = IINF;\n mincost[0] = 0;\n REP(i,1,V) mincost[i] = mincost[i-1] + abs(ps[i]-ps[i-1]) / vw;\n\n rep(i,V-2){\n if( !( LT(ps[i].y,ps[i+1].y) ) ) continue;\n double lower = ps[i+1].y;\n //cout << \"start = \" << i << endl;\n REP(k,i+2,V){\n if( !( ps[k-1].y > ps[k].y ) ) {\n //cout << \"continue \" << k << endl;\n lower = min(lower,ps[k].y);\n continue;\n }\n if( ps[k].y < lower ){\n double Y = max(ps[i].y,ps[k].y);\n Line line = Line(Point(-10100,Y),Point(10100,Y));\n Point sp = ps[i], gp = ps[k];\n Point np = crosspoint(line,Line(ps[i ],ps[i+1]));\n Point mp = crosspoint(line,Line(ps[k-1],ps[k]));\n double dist1 = abs(np-sp);\n double dist3 = abs(np-mp);\n double dist4 = abs(gp-mp);\n double time1 = dist1 / vw + dist3 / vc + dist4 / vw;\n //cout << np << \" <=> \" << mp<<endl;\n //cout << \"time1 = \" << time1 << \" :: \" << mincost[i] + time1 << endl;\n if( LT(mincost[i]+time1,mincost[k]) ){\n mincost[k] = mincost[i]+time1;\n REP(j,k,V) mincost[j] = min(mincost[j],mincost[j-1] + abs(ps[j]-ps[j-1])/vw);\n }\n }\n\n lower = min(lower,ps[k].y);\n if( lower < ps[i].y ) break;\n //if( k == V-1) cout << \"BREAK \" << k << endl;\n }\n }\n\n //rep(i,V) cout << mincost[i] << \" \"; cout << endl;\n printf(\"%.8f\\n\",mincost[V-1]);\n\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1276,"score_of_the_acc":-0.1539,"final_rank":7},{"submission_id":"aoj_2050_772879","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 repi(i,a,b) for(int i = (a); i < (b); i++)\n#define rep(i,a) repi(i,0,a)\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\n#define pb push_back\n#define mp makek_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;\n\nint n, x[1024], y[1024];\ndouble vw, vc;\n\nconst int N = 4000;\n\ndouble mem[N];\n\nstruct edge\n{\n int v; double c;\n edge(int v, double c) : v(v), c(c) {}\n};\n\nstruct node\n{\n int v; double c;\n node(int v, double c) : v(v), c(c) {}\n bool operator <(const node& t) const {\n\treturn c > t.c;\n }\n};\n\nvector<vector<edge> > E;\n\nint main(){\n while (cin >> n && n) {\n\tcin >> vw >> vc;\n\tvw = 1.0 / vw;\n\tvc = 1.0 / vc;\n\trep(i, n)\n\t cin >> x[i] >> y[i];\n\n\tE.assign(n, vector<edge>());\n\trep(i, n - 1)\n\t E[i].pb(edge(i + 1, vw * hypot((double) (x[i + 1] - x[i]),\n\t\t\t\t\t (double) (y[i + 1] - y[i]))));\n\n\tstack<int> stk;\n\trep(i, n - 1) {\n\t if (y[i] < y[i + 1])\n\t\tstk.push(i);\n\t else if (y[i] == y[i + 1]) {\n\t\t//\n\t } else {\n\t\twhile (!stk.empty() && y[stk.top()] >= y[i + 1]) {\n\t\t int it = stk.top();\n\t\t stk.pop();\n\t\t if (y[it] == y[i + 1]) {\n\t\t\tE[it].pb(edge(i + 1, vc * (x[i + 1] - x[it])));\n\t\t\tcontinue;\n\t\t }\n\t\t double p = (double) (y[it] - y[i]) / (y[i + 1] - y[i]);\n\t\t double cx = p * x[i + 1] + (1 - p) * x[i];\n\t\t double cy = p * y[i + 1] + (1 - p) * y[i];\n\n\t\t int nv = E.size();\n\t\t E.pb(vector<edge>());\n\t\t E[it].pb(edge(nv, vc * (cx - x[it])));\n\t\t E[i].pb(edge(nv, vw * hypot((double) (cx - x[i]),\n\t\t\t\t\t\t(double) (cy - y[i]))));\n\t\t E[nv].pb(edge(i + 1, vw * hypot((double) (cx - x[i + 1]),\n\t\t\t\t\t\t (double) (cy - y[i + 1]))));\n\t\t}\n\t }\n\t}\n\n\tstk = stack<int>();\n\tfor (int i = n - 2; i >= 0; --i) {\n\t if (y[i] > y[i + 1])\n\t\tstk.push(i + 1);\n\t else if (y[i] == y[i + 1]) {\n\t\t//\n\t } else {\n\t\twhile (!stk.empty() && y[stk.top()] >= y[i]) {\n\t\t int it = stk.top();\n\t\t stk.pop();\n\t\t if (y[it] == y[i]) {\n\t\t\tE[i].pb(edge(it, vc * (x[it] - x[i])));\n\t\t\tcontinue;\n\t\t }\n\t\t double p = (double) (y[it] - y[i]) / (y[i + 1] - y[i]);\n\t\t double cx = p * x[i + 1] + (1 - p) * x[i];\n\t\t double cy = p * y[i + 1] + (1 - p) * y[i];\n\n\t\t int nv = E.size();\n\t\t E.pb(vector<edge>());\n\t\t E[nv].pb(edge(it, vc * (x[it] - cx)));\n\t\t E[i].pb(edge(nv, vw * hypot((double) (cx - x[i]),\n\t\t\t\t\t\t(double) (cy - y[i]))));\n\t\t E[nv].pb(edge(i + 1, vw * hypot((double) (cx - x[i + 1]),\n\t\t\t\t\t\t (double) (cy - y[i + 1]))));\n\t\t}\n\t }\n\t}\n\n\tfill(mem, mem + N, INF);\n\n\tpriority_queue<node> q;\n\tq.push(node(0, 0.0));\n\twhile (!q.empty()) {\n\t node tmp = q.top();\n\t int v = tmp.v;\n\t double c = tmp.c;\n\t q.pop();\n\n\t if (v == n - 1) {\n\t\tprintf(\"%.6f\\n\", c);\n\t\tbreak;\n\t }\n\t if (mem[v] <= c)\n\t\tcontinue;\n\t mem[v] = c;\n\n\t rep(i, E[v].size())\n\t\tq.push(node(E[v][i].v, c + E[v][i].c));\n\t}\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1456,"score_of_the_acc":-0.1382,"final_rank":5},{"submission_id":"aoj_2050_610312","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 Point{\n double x, y;\n Point(){}\n Point(double x, double y) : x(x), y(y) {}\n};\nstruct S{\n int line;\n int height;\n double cost;\n S(int l, int h, int c) :\n line(l), height(h), cost(c) {}\n bool operator < (const S& s) const {\n return cost > s.cost;\n }\n};\nint lb_index(vector<double>& v, int x){\n return lower_bound(v.begin(), v.end(), x) - v.begin();\n}\nbool valid_h(S& s, vector<Point>& ps, vector<double>& hs){\n return (s.height >= 0 && s.height < hs.size() && \n min(ps[s.line].y, ps[s.line + 1].y) <= hs[s.height] &&\n max(ps[s.line].y, ps[s.line + 1].y) >= hs[s.height] );\n}\nvoid update(priority_queue<S>& que, double cost[1000][1000], S& next){\n if(cost[next.line][next.height] > next.cost){\n cost[next.line][next.height] = next.cost;\n que.push(next);\n }\n}\nvoid print(S& s, vector<double>& hs, vector<Point>& ps){\n printf(\"line %d: (%.0lf, %.0lf) -> (%.0lf, %.0lf) | height %d: y = %.0lf | cost %lf\\n\",\n s.line, ps[s.line].x, ps[s.line].y, ps[s.line + 1].x, ps[s.line + 1].y,\n s.height, hs[s.height], s.cost);\n}\nint main(){\n int N;\n double v_w, v_c;\n while(cin >> N >> v_w >> v_c && N){ \n vector<Point> ps(N);\n REP(i, N) cin >> ps[i].x >> ps[i].y;\n vector<double> hs(N);\n REP(i, N) hs[i] = ps[i].y;\n sort(hs.begin(), hs.end());\n hs.erase(unique(hs.begin(), hs.end()), hs.end());\n int L = hs.size();\n vector< vector<int> > idxes(L); // y = hs[i]と交わる線分のインデックス\n REP(i, N - 1){\n REP(j, L){\n if(min(ps[i].y, ps[i + 1].y) <= hs[j] && hs[j] <= max(ps[i].y, ps[i + 1].y)){\n idxes[j].push_back(i);\n }\n }\n }\n /*\n REP(i, L){\n printf(\"idxes[%d]:\", i);\n debug(idxes[i].begin(), idxes[i].end());\n }\n */\n priority_queue<S> que;\n double cost[1000][1000] = {};\n REP(i, N) REP(j, L) cost[i][j] = INF;\n cost[0][lb_index(hs, ps[0].y)] = 0;\n que.push(S(0, lb_index(hs, ps[0].y), 0));\n while(!que.empty()){\n S s = que.top(); que.pop();\n //print(s, hs, ps);\n if(cost[s.line][s.height] < s.cost) continue;\n if(s.line == N - 2 && hs[s.height] == ps[s.line + 1].y){\n if(ps[s.line].y == ps[s.line + 1].y) s.cost += (ps[s.line + 1].x - ps[s.line].x) / v_w;\n printf(\"%.16lf\\n\", s.cost);\n break;\n }\n if(hs[s.height] == ps[s.line].y){\n if(s.line > 0){\n S next = s;\n next.line --;\n if(ps[next.line].y == ps[next.line + 1].y) next.cost += (ps[next.line + 1].x - ps[next.line].x) / v_w;\n update(que, cost, next);\n }\n }\n if(hs[s.height] == ps[s.line + 1].y){\n if(s.line < N - 2){\n S next = s;\n next.line ++;\n if(ps[s.line].y == ps[s.line + 1].y) next.cost += (ps[s.line + 1].x - ps[s.line].x) / v_w;\n update(que, cost, next);\n }\n }\n for(int d = -1; d <= 1; d += 2){\n S next = s;\n next.height += d;\n if(valid_h(next, ps, hs)){\n assert(ps[s.line + 1].y != ps[s.line].y);\n double C = (ps[s.line + 1].x - ps[s.line].x) / (ps[s.line + 1].y - ps[s.line].y);\n double dy = (hs[s.height + d] - hs[s.height]);\n double dx = C * dy;\n //printf(\"dx = %lf dy = %lf\\n\", dx, dy);\n next.cost += sqrt(dx*dx + dy*dy) / v_w; // ??\n update(que, cost, next);\n }\n }\n if(idxes[s.height].back() != s.line && ps[s.line + 1].y != hs[s.height] && ps[s.line].y < ps[s.line + 1].y){\n S next = s;\n next.line = *upper_bound(idxes[s.height].begin(), idxes[s.height].end(), s.line);\n //printf(\"go tonnnel -> %d\\n\", next.line);\n double x1 = ps[s.line].x + (ps[s.line + 1].x - ps[s.line].x) * (hs[s.height] - ps[s.line].y) / (ps[s.line + 1].y - ps[s.line].y);\n double x2 = ps[next.line].x +\n ((ps[next.line + 1].y == ps[next.line].y) ? 0 : (ps[next.line + 1].x - ps[next.line].x) * (hs[next.height] - ps[next.line].y) / (ps[next.line + 1].y - ps[next.line].y));\n next.cost += (x2 - x1) / v_c; // ???\n update(que, cost, next);\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":200,"memory_kb":10532,"score_of_the_acc":-1.3115,"final_rank":14},{"submission_id":"aoj_2050_572049","code_snippet":"#include<cmath>\n#include<queue>\n#include<cstdio>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nconst double EPS=1e-7;\nconst double INF=1e77;\n\nstruct point{\n\tdouble x,y;\n\tpoint():x(0),y(0){}\n\tpoint(double x,double y):x(x),y(y){}\n\tpoint operator+(const point &a)const{ return point(x+a.x,y+a.y); }\n\tpoint operator-(const point &a)const{ return point(x-a.x,y-a.y); }\n\tbool operator< (const point &a)const{ return x+EPS<a.x || abs(x-a.x)<EPS && y+EPS<a.y; }\n};\n\npoint operator*(double c,const point &a){ return point(c*a.x,c*a.y); }\n\ndouble dot(const point &a,const point &b){ return a.x*b.x+a.y*b.y; }\n\ndouble cross(const point &a,const point &b){ return a.x*b.y-a.y*b.x; }\n\ndouble abs(const point &a){ return sqrt(a.x*a.x+a.y*a.y); }\n\nstruct line{\n\tpoint a,b;\n\tline(const point &a,const point &b):a(a),b(b){}\n};\n\nstruct segment{\n\tpoint a,b;\n\tsegment(const point &a,const point &b):a(a),b(b){}\n};\n\nbool cover(const segment &S,const point &p){\n\treturn abs(cross(S.a-p,S.b-p))<EPS && dot(S.a-p,S.b-p)<EPS;\n}\n\npoint get_intersect(const line &L1,const line &L2){\n\tdouble a1=cross(L1.b-L1.a,L2.b-L2.a);\n\tdouble a2=cross(L1.b-L1.a,L1.b-L2.a);\n\tif(abs(a1)<EPS) return L1.a;\n\treturn L2.a+a2/a1*(L2.b-L2.a);\n}\n\nstruct edge{ int v; double cost; };\n\nint main(){\n\tfor(int n;scanf(\"%d\",&n),n;){\n\t\tdouble v1,v2; scanf(\"%lf%lf\",&v1,&v2);\n\t\tpoint p[2000];\n\t\trep(i,n) scanf(\"%lf%lf\",&p[i].x,&p[i].y);\n\n\t\tvector<edge> G[2000];\n\t\tint n2=0;\n\t\trep(i,n){\n\t\t\t// dig right\n\t\t\tif(i<n-1 && p[i].y<p[i+1].y){\n\t\t\t\tint j=i+1;\n\t\t\t\twhile(j<n && p[i].y<p[j].y) j++;\n\t\t\t\tif(j<n){\n\t\t\t\t\tp[n+n2]=get_intersect(line(p[j-1],p[j]),line(p[i],p[i]+point(1,0)));\n\t\t\t\t\tG[i].push_back((edge){n+n2,abs(p[i]-p[n+n2])/v2});\n\t\t\t\t\tn2++;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// dig left\n\t\t\tif(i>0 && p[i].y<p[i-1].y){\n\t\t\t\tint j=i-1;\n\t\t\t\twhile(j>=0 && p[i].y<p[j].y) j--;\n\t\t\t\tif(j>=0){\n\t\t\t\t\tp[n+n2]=get_intersect(line(p[j+1],p[j]),line(p[i],p[i]+point(1,0)));\n\t\t\t\t\tG[n+n2].push_back((edge){i,abs(p[i]-p[n+n2])/v2});\n\t\t\t\t\tn2++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\trep(i,n-1){\n\t\t\tvector< pair<point,int> > Q;\n\t\t\trep(j,n+n2){\n\t\t\t\tif(cover(segment(p[i],p[i+1]),p[j])) Q.push_back(make_pair(p[j],j));\n\t\t\t}\n\t\t\tsort(Q.begin(),Q.end());\n\t\t\trep(j,(int)Q.size()-1){\n\t\t\t\tint u=Q[j].second,v=Q[j+1].second;\n\t\t\t\tG[u].push_back((edge){v,abs(Q[j+1].first-Q[j].first)/v1});\n\t\t\t}\n\t\t}\n\n\t\tdouble d[2000];\n\t\trep(u,n+n2) d[u]=(u==0?0:INF);\n\n\t\tpriority_queue< pair<double,int> > Q;\n\t\tQ.push(make_pair(0,0));\n\t\twhile(!Q.empty()){\n\t\t\tdouble d_now=-Q.top().first;\n\t\t\tint u=Q.top().second; Q.pop();\n\n\t\t\tif(d[u]<d_now-EPS) continue;\n\n\t\t\trep(i,G[u].size()){\n\t\t\t\tint v=G[u][i].v;\n\t\t\t\tdouble cost=G[u][i].cost;\n\t\t\t\tif(d[v]>d[u]+cost+EPS){\n\t\t\t\t\td[v]=d[u]+cost;\n\t\t\t\t\tQ.push(make_pair(-d[v],v));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%.9f\\n\",d[n-1]);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":1336,"score_of_the_acc":-0.2252,"final_rank":8},{"submission_id":"aoj_2050_405863","code_snippet":"#include <cstdio>\n#include <iostream>\n#include <vector>\n#include <list>\n#include <cmath>\n#include <fstream>\n#include <algorithm>\n#include <string>\n#include <queue>\n#include <set>\n#include <map>\n#include <complex>\n#include <iterator>\n#include <cstdlib>\n#include <cstring>\n#include <sstream>\n\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 pair<P,P> Edge;\ntypedef long long ll;\n\nconst double PI=4*atan(1.0);\nconst int MAX_SIZE = 10000;\n\n// 内積\ndouble dot(P a, P b) {\n return (a.real() * b.real() + a.imag() * b.imag());\n}\n// 外積\ndouble cross(P a, P b) {\n return (a.real() * b.imag() - a.imag() * b.real());\n}\n// 点cが直線ab上にあるかないか\nint is_point_on_line(P a, P b, P c) {\n return EQ( cross(b-a, c-a), 0.0 );\n}\n// 2直線の直行判定\nint is_orthogonal(P a1, P a2, P b1, P b2) {\n return EQ( dot(a1-a2, b1-b2), 0.0 );\n}\n// 2直線の平行判定\nint is_parallel(P a1, P a2, P b1, P b2) {\n return EQ( cross(a1-a2, b1-b2), 0.0 );\n}\n// 点a,bを通る直線と点cの間の距離\ndouble distance_l_p(P a, P b, P c) {\n return abs(cross(b-a, c-a)) / abs(b-a);\n}\n// 点a,bを端点とする線分と点cとの距離\ndouble distance_ls_p(P a, P b, P c) {\n if ( dot(b-a, c-a) < EPS ) return abs(c-a);\n if ( dot(a-b, c-b) < EPS ) return abs(c-b);\n return abs(cross(b-a, c-a)) / abs(b-a);\n}\n// 点が多角形の中に存在するかどうか\nbool isInPolygon(vector<P> &points,P s){\n\tif(points.size()==1)return false;\n\tvector<P> v;\n\tfor(int i=0;i<(int)points.size();i++)v.push_back(points[i]-s);\n\tint sign=0;\n\tfor(int i=1;i<=(int)v.size();i++){\n\t\tint prv=(i-1+v.size())%v.size();\n\t\tint cur=i%v.size();\n\t\tdouble c=cross(v[prv],v[cur]);\n\t\tif(EQ(c,0))continue;\n\t\telse if(sign==0){\n\t\t\tif(c>0)sign=1;\n\t\t\telse sign=-1;\n\t\t}\n\t\telse{\n\t\t\tif(sign==-1&&c>0)return false;\n\t\t\telse if(sign==1&&c<0)return false;\n\t\t}\n\t}\n\treturn true;\n}\nstruct Rec{\n\tvector<P> p;\n};\n// a1,a2を端点とする線分とb1,b2を端点とする線分の交差判定\nint is_intersected_ls(P a1, P a2, P b1, P b2) {\n // 線分が平行な場合は重なっていないことにする\n if(abs(cross(a2-a1,b2-b1)) < EPS){\n return 0;\n }\n return ( cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1) < EPS ) &&\n ( cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1) < EPS );\n}\n// aとbの矩形が接しているかどうか(どちらかがどちからを含んでいるものもふくむ\nbool isTouchRectangle(Rec &a,Rec &b){\n // aの各頂点がbの中に存在しているかチェック\n for(int i=0;i<4;i++)if(isInPolygon(b.p,a.p[i]))return true;\n // 逆\n for(int i=0;i<4;i++)if(isInPolygon(a.p,b.p[i]))return true;\n // 各辺が他方のどれかの辺と接しているか\n for(int i=0;i<4;i++){\n int curi=i;\n int prvi=(i-1+4)%4;\n for(int j=0;j<4;j++){\n int curj=j;\n int prvj=(j-1+4)%4;\n if(is_intersected_ls(a.p[curi],a.p[prvi],b.p[curj],b.p[prvj]))return true;\n }\n }\n return false;\n}\n// a1,a2を端点とする線分とb1,b2を端点とする線分の交点計算\nP intersection_ls(P a1, P a2, P b1, P b2) {\n P b = b2-b1;\n double d1 = abs(cross(b, a1-b1));\n double d2 = abs(cross(b, a2-b1));\n double t = d1 / (d1 + d2);\n return a1 + (a2-a1) * t;\n}\n// a1,a2を通る直線とb1,b2を通る直線の交差判定\nint is_intersected_l(P a1, P a2, P b1, P b2) {\n return !EQ( cross(a1-a2, b1-b2), 0.0 );\n}\n// a1,a2を通る直線とb1,b2を通る直線の交点計算\nP intersection_l(P a1, P a2, P b1, P b2) {\n P a = a2 - a1; P b = b2 - b1;\n return a1 + a * cross(b, b1-a1) / cross(b, a);\n}\n// 単位ベクトルを求める\nP normalVector(P p){\n\treturn p/abs(p);\n}\n// 法線ベクトルを求める\nP unitVector(P a){\n\treturn P(-a.imag(),a.real());\n}\n// 単位法線ベクトルを求める\nP unitNormalVector(P tmp){\n\tP e=P(-tmp.imag(),tmp.real());\n\te/=abs(e);\n\treturn e;\n}\n// 座標の回転(座標pにある点を,半時計回りにa(ラジアン)回転)\nP roundPoint(P p,double a){\n\treturn P(cos(a)*p.real()-sin(a)*p.imag(),sin(a)*p.real()+cos(a)*p.imag());\n}\n/*\n円周と線分の交差判定\n*/\nbool isCircleCrossLine(P a,P b,P c,double r){\n\tdouble d1 = abs(a-c);\n\tdouble d2 = abs(b-c);\n // 線分が中に含まれるとき、ここのコメントアウトをはずせばtrue(交差)となる\n\t//if(d1<r&&d2<r)\n\t//\treturn true;\n\tdouble d = distance_ls_p(a,b,c);\n\treturn (EQ(d,r)||d<r);\n}\n// 三角形の内部に点があるかどうか\n// 外積の正負がすべて同じなら内部に点あり\nbool isInTriangle(P p1,P p2,P p3,P s){\n\tP a=p1-s;\n\tP b=p2-s;\n\tP c=p3-s;\n\treturn ((cross(a,b)>0&&cross(b,c)>0&&cross(c,a)>0)||(cross(a,b)<0&&cross(b,c)<0&&cross(c,a)<0));\n}\n// 矩形の中に点が存在するかどうか\nbool isInRectangle(P p1,P p2,P p3,P p4,P s){\n\tP a=p1-s;\n\tP b=p2-s;\n\tP c=p3-s;\n P d=p4-s;\n\treturn ((cross(a,b)>0&&cross(b,c)>0&&cross(c,d)>0&&cross(d,a)>0)\n ||(cross(a,b)<0&&cross(b,c)<0&&cross(c,d)<0&&cross(d,a)<0));\n}\n// 三角形の面積を座標から計算\ndouble calcAreaOfTriangle(P a,P b,P c){\n\treturn abs((b.real()-a.real())*(c.imag()-a.imag()) - (c.real()-a.real())*(b.imag()-a.imag()))/2;\n}\n// 与えられた円の範囲内に点が存在するかどうか\nbool isContainingDot(P c,double r,P a){\n\treturn (((c.real()-a.real())*(c.real()-a.real())\n\t\t+(c.imag()-a.imag())*(c.imag()-a.imag())<r*r)\n\t\t||EQ((c.real()-a.real())*(c.real()-a.real())\n\t\t+(c.imag()-a.imag())*(c.imag()-a.imag()),r*r));\n}\n// 多角形の面積公式\ndouble calcPolygonArea(vector<P> p){\n\tdouble sum=0;\n\tfor(int i = 0; i < p.size(); i++)\n\t\tsum+=cross(p[i],p[(i+1)%(p.size())]);\n\treturn abs(sum/2);\n}\n// 2ベクトル間の角度\n// aからbへ左周りで何度か(0->2*PI)\ndouble diffAngle(P a,P b){\n double angle=atan2(cross(a,b),dot(a,b));\n if(angle<0)\n return 2*PI+angle;\n return angle;\n}\n// 2つのベクトルの重なっている部分の長さを返す\n// もし重なっていなければ0を返す\ndouble multipleLength(P a,P b,P c,P d){\n Edge e1=make_pair(a,b);\n Edge e2=make_pair(c,d);\n // 平行であるかどうか\n if(!(is_parallel(e1.first,e2.first,e1.second,e2.second)\n &&is_parallel(e1.first,e1.second,e2.first,e2.second)))\n return 0;\n double dist=0;\n // 両方乗っている\n if(EQ(distance_ls_p(e1.first,e1.second,e2.first),0)&&EQ(distance_ls_p(e1.first,e1.second,e2.second),0))\n dist=abs(e2.first-e2.second);\n else if(EQ(distance_ls_p(e2.first,e2.second,e1.first),0)&&EQ(distance_ls_p(e2.first,e2.second,e1.second),0))\n dist=abs(e1.first-e1.second);\n else if(EQ(distance_ls_p(e1.first,e1.second,e2.first),0)){\n // どちらが線上にあるか\n if(EQ(distance_ls_p(e2.first,e2.second,e1.first),0))\n dist=abs(e1.first-e2.first);\n else\n dist=abs(e1.second-e2.first);\n }\n else if(EQ(distance_ls_p(e1.first,e1.second,e2.second),0)){\n if(EQ(distance_ls_p(e2.first,e2.second,e1.first),0))\n dist=abs(e1.first-e2.second);\n else\n dist=abs(e1.second-e2.second);\n }\n return dist;\n}\n// 2点を通る半径rの円の中点を求める\npair<P,P> calcCircleCenterPoint(P dot1,P dot2,double r){\n double v=abs(dot1-dot2);\n double x = sqrt(r*r - (v/2)*(v/2));\n // 二組の単位法線ベクトル\n P hose[2];\n double x1=-(dot1.imag()-dot2.imag());\n double y1=(dot1.real() - dot2.real());\n hose[0]=P(x1,y1);\n double y2=-y1;\n double x2=-x1;\n hose[1]=P(x2,y2);\n double dd1=abs(hose[0]);\n double dd2=abs(hose[1]);\n hose[0]/=dd1;hose[0]*=x;\n hose[1]/=dd2;hose[1]*=x;\n P tmp=(dot1+dot2);\n tmp/=2;\n hose[0]+=tmp;\n hose[1]+=tmp;\n return make_pair(hose[0],hose[1]);\n}\n// 4線分が端点以外でクロスしているかどうかを判定\nbool checkCross(const vector<Edge> &vec){\n for(int i=0;i<vec.size();i++){\n for(int j=i+1;j<vec.size();j++){\n // 線分がクロスしているかどうか\n if(is_intersected_ls(vec[i].first,vec[i].second,vec[j].first,vec[j].second)){\n // している場合、端点以外でクロスしているなら、false\n P p=intersection_ls(vec[i].first,vec[i].second,vec[j].first,vec[j].second);\n if(!(EQ(p,vec[i].first)||EQ(p,vec[i].second)))\n return false;\n }\n }\n }\n return true;\n}\n// 引き数で与えられた4つの点が矩形を作るどうかを判定\nbool checkRec(const vector<P> &squ){\n vector<int> v;\n for(int i=0;i<squ.size();i++)v.push_back(i);\n do{\n vector<Edge> ve;\n for(int i=0;i<4;i++)\n ve.push_back(make_pair(squ[v[i]],squ[v[(i+1)%4]]));\n // ここですべての線分がクロスするかどうかを計算\n if(checkCross(ve)){\n // 線分の長さを確認\n if(EQ(abs(ve[0].first-ve[0].second),abs(ve[2].first-ve[2].second)))\n if(EQ(abs(ve[1].first-ve[1].second),abs(ve[3].first-ve[3].second)))\n // 直行\n if(is_orthogonal(ve[0].first,ve[0].second,ve[1].first,ve[1].second))\n if(is_orthogonal(ve[2].first,ve[2].second,ve[3].first,ve[3].second))\n return true;\n }\n }while(next_permutation(v.begin(),v.end()));\n return false;\n}\n// 引き数で与えられた4つの点が正方形を作るかどうかを判定\nbool checkSqu(const vector<P> &squ){\n vector<int> v;\n for(int i=0;i<squ.size();i++)v.push_back(i);\n do{\n vector<Edge> ve;\n for(int i=0;i<4;i++)\n ve.push_back(make_pair(squ[v[i]],squ[v[(i+1)%4]]));\n // ここですべての線分がクロスするかどうかを計算\n if(checkCross(ve)){\n // 線分の長さを確認\n double d=abs(ve[0].first-ve[0].second);\n for(int i=1;i<4;i++){\n double d2=abs(ve[i].first-ve[i].second);\n if(!EQ(d,d2))return false;\n }\n // 直行確認\n if(is_orthogonal(ve[0].first,ve[0].second,ve[1].first,ve[1].second))\n if(is_orthogonal(ve[2].first,ve[2].second,ve[3].first,ve[3].second))\n return true;\n }\n }while(next_permutation(v.begin(),v.end()));\n return false;\n}\n// 二円の共通接線を構成する4直線を求める(二円はお互い接したりどちらかをふくんだりしない)\nvector<pair<P,P> > calcCommonTangentialLine(P p1,double r1,P p2,double r2){\n\tvector<pair<P,P> > res;\n\tif(r1>r2){\n\t\tswap(r1,r2);\n\t\tswap(p1,p2);\n\t}\n\t// 共通外接線\n\t{\n\t\tdouble d=abs(p1-p2);\n\t\tdouble a=abs(r1-r2);\n\t\tdouble b=sqrt(d*d-a*a);\n\t\tdouble sita=acos(b/d);\n\t\tP e=normalVector(roundPoint((roundPoint((p2-p1),sita)),PI/2));\n\t\tres.push_back(make_pair(e*r1+p1,e*r2+p2));\n\t\tP e2=normalVector(roundPoint((roundPoint((p2-p1),-sita)),-PI/2));\n\t\tres.push_back(make_pair(e2*r1+p1,e2*r2+p2));\n\t}\n\t// 共通内接線\n\t{\n\t\tP cp=(r1*p1+r2*p2)/(r1+r2);\n\t\tdouble u=abs(cp-p1);\n\t\tdouble sita=acos(r1/u);\n\t\tP e=normalVector(roundPoint(cp-p1,sita));\n\t\tres.push_back(make_pair(e*r1+p1,-e*r2+p2));\n\t\tP e2=normalVector(roundPoint(cp-p1,-sita));\n\t\tres.push_back(make_pair(e2*r1+p1,-e2*r2+p2));\n\t}\n\treturn res;\n}\n/*\n 与えられた3点a,b,c,をa->b->cと進むとき\n a->bで時計方向に折れて,b->c\n a->bで半時計方向に折れて,b->c\n a->bで逆を向いてaを通り越してb->c\n a->bでそのままb->c\n a->bで逆を向いてb->c\n のどれであるかを判定\n*/\nint ccw(P a,P b, P c){\n b-=a;c-=a;\n if(cross(b,c)>0&&!EQ(cross(b,c),0))return 1;// counter clockwise\n if(cross(b,c)<0&&!EQ(cross(b,c),0))return -1;// clockwise\n if(dot(b,c)<0&&!EQ(dot(b,c),0))return 2; // c-a-b on line\n if(!EQ(abs(b),abs(c))&&abs(b)<abs(c))return -2; // a-b-c on line\n return 0;\n}\n// 凸多角形の切断を行う\n// lineのfirst側から見て右の多角形が返る\n// 多角形は上が+y,右が+xの座標系で座標を時計周りに格納したvectorで表す\n// lineは基本的にmakeDivisorで作成\nvector<P> convex_cut(vector<P> polygon,pair<P,P> line){\n vector<P> resPolygon;\n int n=polygon.size();\n for(int i=0;i<n;i++){\n P A=polygon[i];\n P B=polygon[(i+1)%n];\n if(ccw(line.first,line.second,A)!=-1)\n resPolygon.push_back(A);\n if(ccw(line.first,line.second,A)*ccw(line.first,line.second,B)<0)\n resPolygon.push_back(intersection_l(A,B,line.first,line.second));\n }\n return resPolygon;\n}\n\nstruct Point{\n P p;\n Point(P _p){\n p=_p;\n }\n Point(){}\n bool operator<(const Point &op)const{\n if(EQ(p.real(),op.p.real())){\n if(EQ(p.imag(),op.p.imag()))return false;\n else return p.imag()<op.p.imag();\n }\n return p.real()<op.p.real();\n }\n};\nstruct edge{\n double dist;\n Point to;\n};\n\nconst int MAX_N=10000;\nconst int INF=1000000000;\nvector<edge> G[MAX_N];\ndouble d[MAX_N];\nvector<P> ps;\nset<Point> nodes;\nmap<Point,int> m;\nint idx;\nint n;\n\ntypedef pair<double,int> pii;\n\ndouble dijkstra(){\n for(int i=0;i<idx;i++)d[i]=INF;\n priority_queue<pii> pq;\n pq.push(pii(0,m[Point(ps[0])]));\n // start\n d[m[Point(ps[0])]]=0;\n while(pq.size()){\n pii p=pq.top();pq.pop();\n double cost=p.first;\n int node=p.second;\n if(!EQ(d[node],cost)&&d[node]<cost)continue;\n for(int i=0;i<G[node].size();i++){\n edge &e=G[node][i];\n if(!EQ(d[m[e.to]],cost+e.dist)&&d[m[e.to]]>cost+e.dist){\n\td[m[e.to]]=cost+e.dist;\n\tpq.push(pii(d[m[e.to]],m[e.to]));\n }\n }\n }\n // ゴールへの最短距離\n return d[m[Point(ps[n-1])]];\n}\n\nint main(){\n while(cin>>n&&n){\n double vw,vc;\n idx=0;ps.clear();m.clear();nodes.clear();\n cin>>vw>>vc;\n for(int i=0;i<n;i++){\n double x,y;\n cin>>x>>y;\n ps.push_back(P(x,y));\n }\n for(int i=0;i<n;i++){\n if(m.count(Point(ps[i]))==0){\n\tnodes.insert(Point(ps[i]));\n\tm[Point(ps[i])]=idx++;\n }\n // 谷の端点の場合、左右に伸ばす\n // 右 \n if((i+1<n&&!EQ(ps[i+1].imag(),ps[i].imag())&&(ps[i+1].imag()>ps[i].imag()))){\n\tfor(int j=i+1;j<n-1;j++){\n\t P a=ps[j];\n\t P b=ps[j+1];\n\t // 線分a--bとy=ps[i].imag()が交差するか？\n\t // 交差するなら,nodeを追加\n\t if(is_intersected_ls(a,b,P(-1000000,ps[i].imag()),P(1000000,ps[i].imag()))){\n\t P cp=intersection_ls(a,b,P(-1000000,ps[i].imag()),P(1000000,ps[i].imag()));\n\t if(m.count(Point(cp))==0){\n\t m[Point(cp)]=idx++;\n\t nodes.insert(Point(cp));\n\t }\n\t break;\n\t }\n\t // 平行かつy座標が同じ線分にぶつかった場合\n\t else if(EQ(ps[i].imag(),ps[j].imag())&&EQ(ps[j].imag(),ps[j+1].imag()))break;\n\t}\n }\n // 左\n if(i-1>=0&&!EQ(ps[i-1].imag(),ps[i].imag())&&(ps[i-1].imag()>ps[i].imag())){\n\tfor(int j=i-1;j>0;j--){\n\t P a=ps[j];\n\t P b=ps[j-1];\n\t // 線分a--bとy=ps[i].imag()が交差するか？\n\t // 交差するなら,nodeを追加\n\t if(is_intersected_ls(a,b,P(-1000000,ps[i].imag()),P(1000000,ps[i].imag()))){\n\t P cp=intersection_ls(a,b,P(-1000000,ps[i].imag()),P(1000000,ps[i].imag()));\n\t if(m.count(Point(cp))==0){\n\t nodes.insert(Point(cp));\n\t m[Point(cp)]=idx++;\n\t }\n\t break;\n\t }\n\t else if(EQ(ps[i].imag(),ps[j].imag())&&EQ(ps[j].imag(),ps[j-1].imag()))break;\n\t}\n }\n }\n // 交点の位置でソートしておき\n // 一つ隣の交点は通行可能\n // その他同じy座標を持つところにも通行可能\n for(set<Point>::iterator it=nodes.begin();it!=nodes.end();it++){\n //cout<<it->p<<endl;\n // 歩いていけるところにエッジを結ぶ\n set<Point>::iterator nxt=it;nxt++;\n if(nxt!=nodes.end()){\n\tedge e;\n\t// 隣接地点へ歩いて渡る\n\te.dist=abs((it->p)-(nxt->p))/vw;\n\te.to=*it;G[m[*nxt]].push_back(e);\n\te.to=*nxt;G[m[*it]].push_back(e);\n }\n // 同じy座標のノードを追加\n // x座標で隣接するものを使用\n int ang=-1;\n for(set<Point>::iterator iit=it;iit!=nodes.end();iit++){\n\t// 最初は一つ進めておく\n\tif(iit==it)iit++;\n\tif(iit==nodes.end())break;\n\tif(EQ(iit->p.imag(),it->p.imag())){\n\t set<Point>::iterator itnxt=it;itnxt++;\n\t // 隣は歩いていけるのでx\n\t if(itnxt!=iit){\n\t if(ang==0)continue;\n\t edge e;\n\t e.dist=abs((iit->p)-(it->p))/vc;\n\t e.to=*iit;\n\t G[m[*it]].push_back(e);\n\t }\n\t break;\n\t}\n\tif(ang==-1){\n\t if(iit->p.imag()>it->p.imag())ang=1;//zouka\n\t else ang=0;//heru\n\t}\n }\n // ang=-1;\n // for(set<Point>::iterator iit=it;;iit--){\n // \tif(iit==nodes.begin())break;\n // \t// 最初は一つ進めておく\n // \tif(iit==it)iit--;\n // \t// y座標が一致\n // \tif(EQ(iit->p.imag(),it->p.imag())){\n // \t set<Point>::iterator itnxt=it;itnxt--;\n // \t // 隣は歩いていけるのでx\n // \t if(itnxt!=iit){\n // \t if(ang==0)continue;\n // \t edge e;\n // \t e.dist=abs((iit->p)-(it->p))/vc;\n // \t e.to=*iit;\n // \t G[m[*it]].push_back(e);\n // \t }\n // \t break;\n // \t}\n // \tif(ang==-1){\n // \t if(iit->p.imag()>it->p.imag())ang=0;//zouka\n // \t else ang=1;//heru\n // \t}\n // \tif(iit==nodes.begin())break;\n // }\n }\n double res=dijkstra();\n printf(\"%.10f\\n\",res);\n for(int i=0;i<idx;i++)G[i].clear();\n }\n\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":0,"score_of_the_acc":-0.2787,"final_rank":10},{"submission_id":"aoj_2050_361775","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n\nusing namespace std;\n\nint main(){\n\tint n;\n\tint x[1000], y[1000];\n\tdouble xd[3000], yd[3000], dist[3000];\n\tint next[3000];\n\twhile(cin >> n, n){\n\t\tint vw, vc; cin >> vw >> vc;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin >> x[i] >> y[i];\n\t\t\txd[i] = x[i];\n\t\t\tyd[i] = y[i];\n\t\t\tnext[i] = -1;\n\t\t}\n\t\tint size = n;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(i+1 < n && y[i] < y[i+1]){\n\t\t\t\tfor(int j=i+1;j+1<n;j++){\n\t\t\t\t\tif(y[j+1] == y[i]){\n\t\t\t\t\t\tnext[i] = j+1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif(min(y[j], y[j+1]) <= y[i] && y[i] <= max(y[j], y[j+1])){\n\t\t\t\t\t\txd[size] = (y[i]-yd[j])*(xd[j+1]-xd[j])/(yd[j+1]-yd[j]) + xd[j];\n\t\t\t\t\t\tyd[size] = y[i];\n\t\t\t\t\t\tnext[i] = size;\n\t\t\t\t\t\tnext[size] = -1;\n\t\t\t\t\t\tsize++;\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(i-1 >= 0 && y[i] < y[i-1]){\n\t\t\t\tfor(int j=i-1;j-1>=0;j--){\n\t\t\t\t\tif(y[j-1] == y[i]){\n\t\t\t\t\t\tnext[j-1] = i;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif(min(y[j], y[j-1]) <= y[i] && y[i] <= max(y[j], y[j-1])){\n\t\t\t\t\t\txd[size] = (y[i]-yd[j])*(xd[j-1]-xd[j])/(yd[j-1]-yd[j]) + xd[j];\n\t\t\t\t\t\tyd[size] = y[i];\n\t\t\t\t\t\tnext[size] = i;\n\t\t\t\t\t\tsize++;\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\tvector< pair<double, int> > vp;\n\t\tfor(int i=0;i<size;i++){\n\t\t\tdist[i] = 1e12;\n\t\t\tvp.push_back(make_pair(xd[i], i));\n\t\t}\n\t\tsort(vp.begin(), vp.end());\n\t\tdist[0] = 0;\n\t\tfor(int i=0;i+1<vp.size();i++){\n\t\t\tint pos = vp[i].second;\n\t\t\tint npos = vp[i+1].second;\n\t\t\tdist[npos] = min(dist[npos], dist[pos] + hypot(xd[pos]-xd[npos], yd[pos]-yd[npos])/vw);\n\t\t\tif(next[pos] != -1)\n\t\t\t\tdist[next[pos]] = min(dist[next[pos]], dist[pos] + (xd[next[pos]] - xd[pos])/vc);\n\t\t}\n\t\tprintf(\"%.8lf\\n\", dist[n-1]);\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2050_350125","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;\ntypedef complex<double> P;\nnamespace std {\n bool operator < (const P& a, const P& b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n }\n}\ndouble cross(const P& a, const P& b) {\n return imag(conj(a)*b);\n}\ndouble dot(const P& a, const P& b) {\n return real(conj(a)*b);\n}\nstruct L : public vector<P> {\n L(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n};\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > 0) return +1; // counter clockwise\n if (cross(b, c) < 0) return -1; // clockwise\n if (dot(b, c) < 0) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line\n return 0;\n}\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}\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]; // same line\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m[0] + B / A * (m[1] - m[0]);\n}\ndouble dp[1001];\nP p[1001];\nint main() {\n int n;\n while(cin >> n, n) {\n int vw, vc;\n cin >> vw >> vc;\n REP(i, n) {\n int x, y;\n cin >> x >> y;\n p[i] = P(x,y);\n }\n REP(i, n) dp[i] = INF;\n dp[0] = 0;\n REP(i, n-1) {\n //cout << dp[i] << \" \";\n dp[i+1] = min(dp[i+1], dp[i] + abs(p[i] - p[i+1]) / vw);\n if (p[i+1].imag() > p[i].imag()) {\n int mi = p[i+1].imag();\n for (int j=i+2; j<n; ++j) {\n if (mi > p[j].imag()) {\n mi = p[j].imag();\n if (mi < p[i].imag()) {\n P q = crosspoint(L(p[i], p[i]+P(1,0)), L(p[j-1], p[j]));\n dp[j] = min(dp[j], dp[i] + (q.real()-p[i].real()) / vc + abs(p[j]-q) / vw);\n break;\n } else {\n P q = crosspoint(L(p[i], p[i+1]), L(p[j], p[j]+P(1,0)));\n dp[j] = min(dp[j], dp[i] + abs(p[i]-q) / vw + (p[j].real()-q.real()) / vc);\n }\n }\n }\n }\n }\n printf(\"%.8f\\n\", dp[n-1]);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2050_294796","code_snippet":"#include <iostream>\n#include <vector>\n#include <complex>\n#include <utility>\n#include <cstdio>\n#include <cassert>\n#include <algorithm>\n\nusing namespace std;\n\ntypedef complex<double> Vector;\ntypedef pair<Vector,Vector> Line;\n\nconst double EPS = 1e-7;\n\nnamespace std {\n bool operator < (const Vector &a, const Vector &b) {\n return a.real() < b.real();\n }\n};\n\ninline bool eqv(double a, double b) {\n return fabs(a-b) < EPS;\n}\n\nstruct Comp {\n vector<Vector> vs;\n Comp(const vector<Vector> &vs) : vs(vs) {}\n\n bool operator ()(const int a, const int b) const {\n if(eqv(vs[a].real(), vs[b].real())) return a < b;\n return vs[a] < vs[b];\n }\n};\n\n\n//Verified PKU 2812\ndouble cross(const Vector &v1, const Vector &v2) {\n return (v1.real()*v2.imag()) - (v1.imag()*v2.real());\n}\n\nbool intersect(const Vector &p11, const Vector &p12, const Vector &p21, const Vector &p22) {\n return (cross(p12-p11, p21-p11)*cross(p12-p11, p22-p11) < 0 &&\n cross(p22-p21, p11-p21)*cross(p22-p21, p12-p21) < 0 );\n}\n\n//Verified AOJ 0012\n//Verified PKU 3348\ndouble ccw(const Vector &p1, const Vector &p2, const Vector &p3) {\n return cross(p2-p1, p3-p1);\n}\n\n//Verified AOJ 1267(maybe too weak)\nVector crosspoint(const Line &l1, const Line &l2) {\n double a = cross(l1.second-l1.first, l2.second-l2.first);\n double b = cross(l1.second-l1.first, l1.second-l2.first);\n if(fabs(a) < EPS && fabs(b) < EPS) return l2.first;\n assert(fabs(a) >= EPS);\n return l2.first + b / a * (l2.second-l2.first);\n}\n\nint main() {\n while(true) {\n int N;\n cin >> N;\n if(!N) break;\n\n int VW, VC;\n cin >> VW >> VC;\n\n vector<Vector> vs(N);\n vector<vector<double> > cost(N*3, vector<double>(N*3, 1e12));\n for(int i = 0; i < N; ++i) {\n cin >> vs[i].real() >> vs[i].imag();\n }\n\n for(int i = N-1; i >= 0; --i) {\n //Search Right\n double y = vs[i].imag();\n if(i+1 < N && vs[i+1].imag() > y) {\n for(int j = i+1; j < N; ++j) {\n if(vs[j].imag() < y || eqv(vs[j].imag(), y)) {\n //intersect with line (vs[j], vs[j-1])\n //cout << \"intersect \" << vs[i] << ' ' << vs[j] << endl;\n Vector pt = crosspoint(Line(vs[j], vs[j-1]+(vs[j-1]-vs[j])), Line(vs[i], Vector(vs[j].real()+10, y)));\n vs.push_back(pt);\n int idx = (int)vs.size()-1;\n cost[idx][i] = (pt.real() - vs[i].real()) / VC;\n break;\n }\n }\n }\n\n //Search Left\n if(i-1 >= 0 && vs[i-1].imag() > y) {\n for(int j = i-1; j >= 0; --j) {\n if(vs[j].imag() < y || eqv(vs[j].imag(), y)) {\n //intersect with line (vs[j+1], vs[j])\n Vector pt = crosspoint(Line(vs[j+1], vs[j]+(vs[j]-vs[j+1])), Line(vs[i], Vector(vs[j].real()-10, y)));\n vs.push_back(pt);\n int idx = (int)vs.size()-1;\n cost[i][idx] = (vs[i].real() - pt.real()) / VC;\n break;\n }\n }\n }\n }\n\n vector<int> order(vs.size());\n for(int i = 0; i < order.size(); ++i) order[i] = i;\n sort(order.begin(), order.end(), Comp(vs));\n\n vector<double> best(vs.size(), 1e12);\n best[order[vs.size()-1]] = 0;\n for(int i = (int)vs.size()-1; i >= 1; --i) {\n int cur = order[i];\n int next = order[i-1];\n cost[cur][next] = abs(vs[next]-vs[cur]) / VW;\n\n for(int j = 0; j < i; ++j) {\n int nx = order[j];\n assert(cost[cur][nx] >= 0);\n best[nx] = min(best[nx], best[cur] + cost[cur][nx]);\n }\n //cout << best[cur] << endl;\n }\n\n printf(\"%.7f\\n\", best[order[0]]);\n }\n\n return 0;\n}","accuracy":1,"time_ms":620,"memory_kb":0,"score_of_the_acc":-1,"final_rank":12},{"submission_id":"aoj_2050_292136","code_snippet":"#include <cstdio>\n#include <vector>\n#include <queue>\n#include <complex>\nusing namespace std;\ntypedef complex<double> P;\nstatic const double EPS = 1e-6;\ninline double cross(const P& a, const P& b) { return a.real()*b.imag() - b.real()*a.imag(); }\n\nstruct line/*{{{*/\n{\n P a, b;\n line() {}\n line(const P& p, const P& q) : a(p), b(q) {}\n};/*}}}*/\n\nstruct segment/*{{{*/\n{\n P a, b;\n segment() {}\n segment(const P& x, const P& y) : a(x), b(y) {}\n\n inline bool intersects(const line& ln) const\n {\n return cross(ln.b - ln.a, a - ln.a) * cross(ln.b - ln.a, b - ln.a) < EPS;\n }\n\n inline P intersection(const line& ln) const\n {\n const P x = b - a;\n const P y = ln.b - ln.a;\n return a + x*(cross(y, ln.a - a))/cross(y, x);\n }\n};/*}}}*/\n\nint main()\n{\n int N;\n while (scanf(\"%d\", &N) != EOF && N != 0) {\n int vw, vc;\n scanf(\"%d %d\", &vw, &vc);\n vector<P> ps;\n for (int i = 0; i < N; i++) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n ps.push_back(P(x, y));\n }\n\n vector<vector<pair<int,double> > > g(3*N);\n for (int i = 0; i < N-1; i++) {\n g[3*i].push_back(make_pair(3*(i+1), abs(ps[i+1] - ps[i])/vw));\n }\n for (int i = 0; i < N; i++) {\n if (i > 0 && ps[i-1].imag() > ps[i].imag()) {\n // left edge\n const line ln(ps[i], ps[i] + P(1, 0));\n for (int j = i-2; j >= 0; j--) {\n const segment s(ps[j], ps[j+1]);\n if (s.intersects(ln)) {\n const P p = s.intersection(ln);\n const int n = 3*i+1;\n g[3*j].push_back(make_pair(n, abs(p - ps[j])/vw));\n g[n].push_back(make_pair(3*i, abs(ps[i] - p)/vc));\n break;\n }\n }\n }\n if (i < N-1 && ps[i].imag() < ps[i+1].imag()) {\n // right edge\n const line ln(ps[i], ps[i] + P(1, 0));\n for (int j = i+1; j < N-1; j++) {\n const segment s(ps[j], ps[j+1]);\n if (s.intersects(ln)) {\n const P p = s.intersection(ln);\n const int n = 3*i+2;\n g[3*i].push_back(make_pair(n, abs(p - ps[i])/vc));\n g[n].push_back(make_pair(3*(j+1), abs(ps[j+1] - p)/vw));\n break;\n }\n }\n }\n }\n\n static const double INF = 1e10;\n vector<double> dist(3*N, INF);\n dist[0] = 0;\n priority_queue<pair<double,int> > q;\n q.push(make_pair(0, 0));\n while (!q.empty()) {\n const double c = -q.top().first;\n const int n = q.top().second;\n q.pop();\n if (n == 3*(N-1)) {\n printf(\"%.6f\\n\", c);\n break;\n }\n if (c > dist[n]) {\n continue;\n }\n for (vector<pair<int,double> >::const_iterator it = g[n].begin(); it != g[n].end(); ++it) {\n const int m = it->first;\n const double cc = c + it->second;\n if (cc < dist[m]) {\n dist[m] = cc;\n q.push(make_pair(-cc, m));\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_2050_132887","code_snippet":"#include <iostream>\n#include <complex>\n#include <vector>\n#include <iomanip>\n#include <queue>\nusing namespace std;\n\ntypedef complex<double> P;\n#define EPS 1e-5\n#define INF 1e7\n\ntypedef pair<int, double> Node;\n\nclass State\n{\npublic:\n\tint n;\n\tdouble c;\n\tState(int n, double c)\n\t\t:n(n),c(c)\n\t{}\n\n\tbool operator<(const State& s) const\n\t{\n\t\treturn c>s.c;\n\t}\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\n//OÏ\ndouble cross(const P& a, const P& b) {\n return imag(conj(a)*b);\n}\n\ndouble dist(const P& a, const P& b)\n{\n\treturn abs(a-b);\n}\n\nbool intersect(L& a, L& b)\n{\n\tdouble t=max(a[0].imag(), a[1].imag());\n\tdouble l=min(a[0].imag(), a[1].imag());\n\n\treturn (t+EPS>b[0].imag()&&b[0].imag()>l-EPS);\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]; // same line\n return m[0] + B / A * (m[1] - m[0]);\n}\n\nint main()\n{\n\tcout << setprecision(10) << setiosflags(ios::fixed);\n\tdouble vw,vc;\n\tint N;\n\t\n\twhile(cin >> N, N)\n\t{\n\t\tvector<P> in;\n\n\t\tcin >> vw >> vc;\n\t\tfor(int i=0; i<N; i++)\n\t\t{\n\t\t\tdouble x,y;\n\t\t\tcin >> x >> y;\n\t\t\tin.push_back(P(x,y));\n\t\t}\n\n\t\tvector<Node> node[4000];\n\t\tfor(int i=0; i<N-1; i++)\n\t\t{\n\t\t\tnode[i].push_back(make_pair(i+1, dist(in[i], in[i+1])/vw));\n\t\t}\n\n\t\tfor(int i=0; i<N; i++)\n\t\t{\n\t\t\tL hz(P(-INF,in[i].imag()),P(INF,in[i].imag()));\n\t\t\tfor(int j=i-2; j>=0; j--)\n\t\t\t{\n\t\t\t\tif(in[i].imag()+EPS > in[j+1].imag()) break;\n\t\t\t\tL tmp(in[j], in[j+1]);\n\t\t\t\tif(intersect(tmp,hz))\n\t\t\t\t{\n\t\t\t\t\tP xp=crosspoint(hz,tmp);\n\t\t\t\t\tin.push_back(xp);\n\t\t\t\t\tint p=in.size();\n\t\t\t\t\tnode[j].push_back(make_pair(p, dist(in[j], xp)/vw));\n\t\t\t\t\tnode[p].push_back(make_pair(j+1, dist(in[j+1], xp)/vw));\n\t\t\t\t\tnode[p].push_back(make_pair(i, dist(in[i], xp)/vc));\n\t\t\t\t\t\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int j=i+1; j<N-1; j++)\n\t\t\t{\n\t\t\t\tif(in[i].imag()+EPS > in[j].imag()) break;\n\n\t\t\t\tL tmp(in[j], in[j+1]);\n\t\t\t\tif(intersect(tmp,hz))\n\t\t\t\t{\n\t\t\t\t\tP xp=crosspoint(hz,tmp);\n\t\t\t\t\tin.push_back(xp);\n\t\t\t\t\tint p=in.size();\n\t\t\t\t\tnode[j].push_back(make_pair(p, dist(in[j], xp)/vw));\n\t\t\t\t\tnode[p].push_back(make_pair(j+1, dist(in[j+1], xp)/vw));\n\t\t\t\t\tnode[i].push_back(make_pair(p, dist(in[i], xp)/vc));\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\n\t\tpriority_queue<State> q;\n\t\tq.push(State(0,0));\n\t\tbool v[4000]={0};\n\n\t\twhile(!q.empty())\n\t\t{\n\t\t\tState s=q.top(); q.pop();\n\t\t\tif(v[s.n]) continue;\n\t\t\tv[s.n]=1;\n\n\t\t\tif(s.n==N-1)\n\t\t\t{\n\t\t\t\tcout << s.c << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tfor(int i=0; i<node[s.n].size(); i++)\n\t\t\t{\n\t\t\t\tNode next=node[s.n][i];\n\t\t\t\tif(v[next.first]) continue;\n\n\t\t\t\tq.push(State(next.first, s.c+next.second));\n\t\t\t}\n\n\t\t}\n\n\n\t}\n}","accuracy":1,"time_ms":90,"memory_kb":1188,"score_of_the_acc":-0.2439,"final_rank":9},{"submission_id":"aoj_2050_71788","code_snippet":"#include<iostream>\n#include<cmath>\n#include<complex>\n#include<queue>\n#include<functional>\n#include<algorithm>\n#include<set>\n\nusing namespace std;\n\ntypedef double elem;\ntypedef complex<elem> point, vec;\ntypedef pair<point,point> line;\n\n#define N 1001\n\nconst elem eps = 1.0e-7;\nconst elem infty = 300000000.0;\n\nelem W[N][N];\nelem A[N];\nbool G[N][N];\n\nstruct State{\n int now;\n elem cost;\n bool operator>(const State&t)const{\n return cost > t.cost;\n }\n};\n\nelem cross(point a, point b){\n return a.real() * b.imag() - a.imag() * b.real();\n}\n\nelem dist(point a, point b){\n return abs(b-a);\n}\nelem dist(point a1, point a2, point x){\n return abs( cross(a2-a1,x-a1)) / abs(a2-a1);\n}\n\ninline bool intersected_seg(point a1, point a2, point b1, point b2){\n return (cross(a2-a1,b1-a1)*cross(a2-a1,b2-a1) < eps &&\n\t cross(b2-b1,a1-b1)*cross(b2-b1,a2-b1) < eps );\n}\n\ninline point intersection_seg(point a1, point a2, point b1, point b2){\n elem d1=dist(b1,b2,a1);\n elem d2=dist(b1,b2,a2);\n elem t=d1/(d1+d2);\n return a1+t*(a2-a1);\n}\n\nvoid ResetGraph(){\n for(int i = 0; i < N; ++i){\n A[i] = infty;\n for(int j = 0; j < N; ++j){\n W[i][j] = infty;\n G[i][j] = false;\n }\n }\n}\n\nelem dijkstra(int goal){\n priority_queue< State, vector<State>, greater<State> > pq;\n bool visited[N]={false,};\n State st;\n\n st.now = 0;\n visited[0] = true;\n st.cost = 0;\n A[0] = 0;\n pq.push( st );\n\n while( !pq.empty() ){\n st = pq.top();\n //cout << \" QUEUE SIZE \" << pq.size() << endl;\n pq.pop();\n\n //cout << \"NOW: \" << st.now << \" COST : \" << st.cost << endl;\n\n //visited[st.now] = false;\n if( st.now == goal ){\n return A[goal];\n }\n visited[st.now] = true;\n\n for(int i = 0; i < N; ++i){\n if( G[st.now][i] ){\n\tif( !visited[i] && A[st.now] + W[st.now][i] < A[i] ){\n\t State next;\n\t next.now = i;\n\t A[i] = A[st.now] + W[st.now][i];\n\t //cout << \"Goto : \" << i << endl;\n\t //cout << \"Right : \" << A[st.now] << \" + \" << W[st.now][i] << endl;\n\t next.cost = A[i];\n\t pq.push( next );\n\t}\n }\n }\n }\n return 0;\n}\n\nint main(){\n while(true){\n int n;\n double vw,vc;\n vector<point> vp;\n vector<line> lines;\n\n ResetGraph();\n cin >> n;\n if(n==0)break;\n cin >> vw >> vc;\n for(int i = 0; i < n; ++i){\n elem x,y;\n cin>>x>>y;\n point tp(x,y);\n if(i>0){\n\tline l = make_pair( vp.back(),tp );\n\tlines.push_back(l);\n }\n vp.push_back(tp);\n }\n\n for(int i = 0; i < lines.size(); ++i){\n //cout << lines[i].first << ' ' << lines[i].second << endl;\n G[i][i+1] = true;\n W[i][i+1] = dist(lines[i].first, lines[i].second) / vw;\n if( lines[i].second.imag() > lines[i].first.imag() ){\n\tline l = make_pair( lines[i].first, point(infty, lines[i].first.imag()) );\n\tfor(int j = i+1; j < lines.size(); ++j){\n\t //\t cout << l.first << ' ' << l.second << \" : \" << lines[j].first << ' ' << lines[j].second << endl;\n\t if( intersected_seg(l.first,\n\t\t\t l.second,\n\t\t\t lines[j].first,\n\t\t\t lines[j].second) ){\n\t point intersect = intersection_seg(\n\t\t\t\t\t l.first,\n\t\t\t\t\t l.second,\n\t\t\t\t\t lines[j].first,\n\t\t\t\t\t lines[j].second );\n\t //elem d = dist( intersect, lines[j].second );\n\t G[i][j+1] = true;\n\t W[i][j+1] = dist( lines[i].first, intersect ) / vc + dist( intersect, lines[j].second ) / vw;\n\t break;\n\t }\n\t}\n }\n if( lines[i].second.imag() < lines[i].first.imag() ){\n\tline l = make_pair( lines[i].second, point(-infty, lines[i].second.imag()) );\n\tfor(int j = i-1; j >= 0; --j){\n\t // cout << l.first << ' ' << l.second << \" : \" << lines[j].first << ' ' << lines[j].second << endl;\n\t if( intersected_seg(l.first,\n\t\t\t l.second,\n\t\t\t lines[j].first,\n\t\t\t lines[j].second) ){\n\t point intersect = intersection_seg(\n\t\t\t\t\t l.first,\n\t\t\t\t\t l.second,\n\t\t\t\t\t lines[j].first,\n\t\t\t\t\t lines[j].second );\n\t //elem d = dist( intersect, lines[j].second );\n\t G[j][i+1] = true;\n\t W[j][i+1] = dist( lines[i].second, intersect ) / vc + dist( intersect, lines[j].first ) / vw;\n\t break;\n\t }\n\t}\n }\n }\n /*\n for(int i = 0; i < N; ++i){\n for(int j = 0; j < N; ++j){\n\tif( G[i][j] ){\n\t cout << \"i:\" << i << \" j:\" << j << ' ' << vp[i] << \"->\" << vp[j] << \" COST: \" << W[i][j] << endl;\n\t}\n }\n }\n */\n\n printf(\"%.6lf\\n\", dijkstra(n-1));\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":9888,"score_of_the_acc":-1.152,"final_rank":13},{"submission_id":"aoj_2050_71609","code_snippet":"#include<map>\n#include<cmath>\n#include<vector>\n#include<iostream>\n#include<queue>\n#include<algorithm>\n#include<complex>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define ALL(C) (C).begin(),(C).end()\n#define pb push_back\n\n\nconst int N = 1000;\n\nclass Edge{\npublic:\n int to;\n double cost;\n};\n\nvector<Edge> edge[N];\n\ndouble dist(double x,double y){\n return sqrt(x*x+y*y);\n}\n\ndouble getx(double xa,double xb,double ya,double yb,double y){\n double A = (ya-yb)/(xa-xb);\n return (y-ya+A*xa)/A;\n}\n\nvoid makeedge(int n,double *x,double *y,double vd,double vwalk){\n rep(i,n-1){\n edge[i].pb((Edge){i+1,dist(x[i]-x[i+1],y[i]-y[i+1])/vwalk});\n }\n \n rep(i,n){\n REP(j,i+1,n-1){\n if (i+1 == j && y[j] <= y[i])break;\n if (y[j+1] <= y[i] && y[i] < y[j]){\n\tdouble tx = getx(x[j],x[j+1],y[j],y[j+1],y[i]);\n\tedge[i].push_back((Edge){j+1,(tx-x[i])/vd+dist(tx-x[j+1],y[i]-y[j+1])/vwalk});\n\tbreak;\n }\n }\n \n for(int j=i-1;j>=1;j--){\n if (i-1 == j && y[j] <= y[i])break;\n if (y[j-1] <= y[i] && y[i] < y[j]){\n\tdouble tx = getx(x[j],x[j-1],y[j],y[j-1],y[i]);\n\tedge[j-1].push_back(\n\t\t\t (Edge){i,(x[i]-tx)/vd+dist(tx-x[j-1],y[i]-y[j-1])/vwalk});\n\tbreak;\n }\n }\n }\n}\n\n\ndouble cost[N];\ndouble solve(int n,double *x,double *y,double vw,double vd){\n rep(i,n)edge[i].clear();\n makeedge(n,x,y,vd,vw);\n rep(i,n)cost[i] = 1e100;\n\n cost[0] = 0;\n rep(i,n){\n rep(j,edge[i].size()){\n int next = edge[i][j].to;\n cost[next]=min(cost[next],cost[i]+edge[i][j].cost);\n }\n }\n\n /*\n rep(i,n){\n cout << \"now \" << x[i] << \" \" << y[i]<<endl;\n puts(\"edge begin\");\n rep(j,edge[i].size()){\n int nex = edge[i][j].to;\n cout << x[nex] << \" \"<< y[nex] << \" \"<< edge[i][j].cost << endl;\n }\n puts(\"Edge end\");\n }\n */\n\n return cost[n-1];\n}\n\n\nmain(){\n int n;\n while(cin>>n && n){\n double vwalk,vd;\n cin>>vwalk>>vd;\n double x[n],y[n];\n rep(i,n)cin>>x[i]>>y[i];\n printf(\"%6lf\\n\",solve(n,x,y,vwalk,vd));\n }\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2050_3057190\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <array>\\n#include <map>\\n#include <queue>\\nusing namespace std;\\nconst double EPS = 1e-6;\\nconst double INF = 1e12;\\nconst double PI = acos(-1);\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\n\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\nstruct L : array<P, 2>{\\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\\n L(){}\\n};\\n\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\nint ccw(P a, P b, P c){\\n b -= a;\\n c -= a;\\n if(cross(b,c) > EPS) return +1; //ccw\\n if(cross(b,c) < -EPS) return -1; //cw\\n if(dot(b,c) < -EPS) return +2; //c-a-b\\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\\n return 0; //a-c-b\\n}\\n\\nbool intersectSS(const L& a, const L& b){\\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\\n}\\nbool intersectSP(const L& s, const P &p){\\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\\n}\\n\\nbool isParallel(const P &a, const P &b){\\n return abs(cross(a,b)) < EPS;\\n}\\nbool isParallel(const L &a, const L &b){\\n return isParallel(a[1]-a[0], b[1]-b[0]);\\n}\\nP crosspointLL(const L &l, const L &m) {\\n double A = cross(l[1]-l[0], m[1]-m[0]);\\n double B = cross(l[1]-l[0], l[1]-m[0]);\\n return m[0] + B/A *(m[1]-m[0]);\\n}\\n\\nint in_poly(const P &p, const VP &poly){\\n int n = poly.size();\\n int ret = -1;\\n for(int i=0; i<n; i++){\\n P a = poly[i]-p;\\n P b = poly[(i+1)%n]-p;\\n if(a.Y > b.Y) swap(a,b);\\n if(intersectSP(L(a,b), P(0,0))) return 0;\\n if(a.Y<=0 && b.Y>0 && cross(a,b)<0) ret = -ret;\\n }\\n return ret;\\n}\\n\\npair<vector<vector<int> >, VP> arrangement(const vector<L> &l){\\n vector<VP> cp(l.size());\\n VP plist;\\n for(int i=0; i<(int)l.size(); i++){\\n for(int j=i+1; j<(int)l.size(); j++){\\n if(!isParallel(l[i], l[j]) && intersectSS(l[i], l[j])){\\n P cpij = crosspointLL(l[i], l[j]);\\n cp[i].push_back(cpij);\\n cp[j].push_back(cpij);\\n plist.push_back(cpij);\\n }\\n }\\n cp[i].push_back(l[i][0]);\\n cp[i].push_back(l[i][1]);\\n plist.push_back(l[i][0]);\\n plist.push_back(l[i][1]);\\n sort(cp[i].begin(), cp[i].end());\\n cp[i].erase(unique(cp[i].begin(), cp[i].end()), cp[i].end());\\n }\\n sort(plist.begin(), plist.end());\\n plist.erase(unique(plist.begin(), plist.end()), plist.end());\\n\\n int n = plist.size();\\n map<P, int> conv;\\n for(int i=0; i<n; i++){\\n conv[plist[i]] = i;\\n }\\n vector<vector<int> > adj(n);\\n for(int i=0; i<(int)cp.size(); i++){\\n for(int j=0; j<(int)cp[i].size()-1; j++){\\n int jidx = conv[cp[i][j]];\\n int jp1idx = conv[cp[i][j+1]];\\n adj[jidx].push_back(jp1idx);\\n adj[jp1idx].push_back(jidx);\\n }\\n }\\n for(int i=0; i<n; i++){\\n sort(adj[i].begin(), adj[i].end());\\n adj[i].erase(unique(adj[i].begin(), adj[i].end()), adj[i].end());\\n }\\n return make_pair(adj, plist);\\n}\\n\\n\\nint main(){\\n while(1){\\n int n;\\n cin >> n;\\n if(n == 0) break;\\n\\n double vw,vc;\\n cin >> vw >> vc;\\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 double xmin = p[0].X, xmax = p[n-1].X;\\n VP poly = p;\\n reverse(poly.begin(), poly.end());\\n poly.push_back(P(xmin, -2e4));\\n poly.push_back(P(xmax, -2e4));\\n\\n vector<L> l;\\n for(int i=0; i<n; i++){\\n if(i != n-1){\\n l.push_back(L(p[i], p[i+1]));\\n }\\n double y = p[i].Y;\\n L cut(P(xmin, y), P(xmax, y));\\n VP cp;\\n for(int j=0; j<n-1; j++){\\n L edge(p[j], p[j+1]);\\n if(!isParallel(cut, edge) && intersectSS(cut, edge)){\\n cp.push_back(crosspointLL(cut, edge));\\n }\\n }\\n cp.erase(unique(cp.begin(), cp.end()), cp.end());\\n int idx = lower_bound(cp.begin(), cp.end(), p[i]) -cp.begin();\\n if(idx == (int)cp.size() || !(cp[idx] == p[i])){\\n continue;\\n }\\n if(i > 0 && p[i-1].Y > p[i].Y +EPS && idx > 0){\\n l.push_back(L(cp[idx-1], cp[idx]));\\n }\\n if(i < n-1 && p[i].Y +EPS < p[i+1].Y && idx < (int)cp.size()-1){\\n l.push_back(L(cp[idx], cp[idx+1]));\\n }\\n }\\n sort(l.begin(), l.end());\\n l.erase(unique(l.begin(), l.end()), l.end());\\n pair<vector<vector<int> >, VP> ret = arrangement(l);\\n vector<vector<int> > &adj = ret.first;\\n VP &plist = ret.second;\\n\\n vector<vector<pair<int, double> > > adj2(adj.size());\\n for(int i=0; i<(int)adj.size(); i++){\\n adj2[i].resize(adj[i].size());\\n for(int j=0; j<(int)adj[i].size(); j++){\\n P mid = (plist[i] +plist[adj[i][j]])/2.0;\\n double cost;\\n if(in_poly(mid, poly) == 1){\\n cost = abs(plist[i] -plist[adj[i][j]]) /vc;\\n }else{\\n cost = abs(plist[i] -plist[adj[i][j]]) /vw;\\n }\\n adj2[i][j] = make_pair(adj[i][j], cost);\\n }\\n }\\n\\n priority_queue<pair<double, int> > wait;\\n wait.push(make_pair(0, 0));\\n vector<double> mincost(adj2.size(), INF);\\n mincost[0] = 0;\\n while(!wait.empty()){\\n double cost = -wait.top().first;\\n int pos = wait.top().second;\\n wait.pop();\\n if(cost > mincost[pos] +EPS) continue;\\n if(pos == (int)adj2.size()-1) break;\\n for(int i=0; i<(int)adj2[pos].size(); i++){\\n int npos = adj2[pos][i].first;\\n double ncost = cost +adj2[pos][i].second;\\n if(ncost +EPS < mincost[npos]){\\n mincost[npos] = ncost;\\n wait.push(make_pair(-ncost, npos));\\n }\\n }\\n }\\n cout << fixed << setprecision(10);\\n cout << mincost[adj2.size()-1] << endl;\\n } \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 620,\n \"memory_kb\": 3860,\n \"score_of_the_acc\": -1.3665,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2050_1171326\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <cstdio>\\n#include <iostream>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n#include <complex>\\n#include <assert.h>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <double,double> P;\\n \\nstatic const int tx[] = {+0,+1,+0,-1};\\nstatic const int ty[] = {-1,+0,+1,+0};\\n \\nstatic const double EPS = 1e-8;\\n\\ntypedef complex<double> Point;\\n\\nnamespace std {\\n bool operator < (const Point& a, const Point& b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n }\\n}\\n\\ndouble cross(const Point& a, const Point& b) {\\n return imag(conj(a)*b);\\n}\\ndouble dot(const Point& a, const Point& b) {\\n return real(conj(a)*b);\\n}\\n\\nstruct Line : public vector<Point> {\\n Line(const Point &a, const Point &b) {\\n push_back(a); push_back(b);\\n }\\n};\\n\\nint ccw(Point a, Point b, Point c) {\\n b -= a; c -= a;\\n if (cross(b, c) > 0) return +1; // counter clockwise\\n if (cross(b, c) < 0) return -1; // clockwise\\n if (dot(b, c) < 0) return +2; // c--a--b on line\\n if (norm(b) < norm(c)) return -2; // a--b--c on line\\n return 0;\\n}\\n\\nbool intersectSS(const Line &s, const Line &t) {\\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\\n}\\n\\nPoint crosspoint(const Line &l, const Line &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 if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n return m[0] + B / A * (m[1] - m[0]);\\n}\\n\\ndouble compute_area(const Point &l,const Point &m){\\n return abs(cross(l,m)) / 2.0;\\n}\\n\\nbool is_equal(const Point &l,const Point &m){\\n return ((abs(real(l) - real(m)) < EPS) && (abs(imag(l) - imag(m) < EPS)));\\n}\\n\\nclass State {\\npublic:\\n int pos;\\n double cost;\\n State(int pos,double cost) :\\n pos(pos), cost(cost) {}\\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\\ndouble dp[3001];\\nvector<State> costs[3001];\\n\\nint main(){\\n int n;\\n while(~scanf(\\\"%d\\\",&n)){\\n if(n == 0) break;\\n\\n double vw,vc; \\n scanf(\\\"%lf %lf\\\",&vw,&vc);\\n vector<Point> points;\\n for(int i = 0; i < n; i++){\\n double x,y;\\n scanf(\\\"%lf %lf\\\",&x,&y);\\n points.push_back(Point(x,y));\\n }\\n\\n for(int i = 0; i <= 2000; i++){\\n dp[i] = 1e10;\\n costs[i].clear();\\n }\\n vector<double> x;\\n for(int i = 0; i < n; i++){\\n x.push_back(points[i].real());\\n Line here2right(points[i],Point(1e10,points[i].imag()));\\n for(int j = i + 1; j + 1 < n; j++){\\n if(points[i].imag() + EPS >= points[j].imag()) break;\\n Line target(points[j],points[j+1]);\\n if(intersectSS(here2right,target)){\\n x.push_back(crosspoint(here2right,target).real());\\n break;\\n }\\n }\\n\\n Line here2left(Point(-1e10,points[i].imag()),points[i]);\\n for(int j = i - 1; j - 1 >= 0; j--){\\n if(points[i].imag() + EPS >= points[j].imag()) break;\\n Line target(points[j-1],points[j]);\\n if(intersectSS(here2left,target)){\\n x.push_back(crosspoint(here2left,target).real());\\n break;\\n }\\n }\\n }\\n sort(x.begin(),x.end());\\n x.erase(unique(x.begin(),x.end()),x.end());\\n\\n for(int i = 0; i < n; i++){\\n int from = lower_bound(x.begin(),x.end(),points[i].real() - EPS) - x.begin();\\n if(i + 1 < n){\\n int to = lower_bound(x.begin(),x.end(),points[i+1].real() - EPS) - x.begin(); \\n costs[from].push_back(State(to,abs(points[i+1]-points[i])/vw));\\n costs[to].push_back(State(from,abs(points[i+1]-points[i])/vw));\\n }\\n Line here2right(points[i],Point(1e10,points[i].imag()));\\n for(int j = i + 1; j + 1 < n; j++){\\n if(points[i].imag() + EPS >= points[j].imag()) break;\\n Line target(points[j],points[j+1]);\\n if(intersectSS(here2right,target)){\\n Point p = crosspoint(here2right,target);\\n int lhs = lower_bound(x.begin(),x.end(),points[j].real() - EPS) - x.begin(); \\n int mid = lower_bound(x.begin(),x.end(),p.real() - EPS) - x.begin();\\n int rhs = lower_bound(x.begin(),x.end(),points[j+1].real() - EPS) - x.begin(); \\n\\n costs[from].push_back(State(mid,abs(p - points[i])/vc));\\n costs[mid].push_back(State(from,abs(p - points[i])/vc));\\n\\n costs[lhs].push_back(State(mid,abs(p - points[j])/vw));\\n costs[mid].push_back(State(rhs,abs(p - points[j+1])/vw));\\n\\n costs[mid].push_back(State(lhs,abs(p - points[j])/vw));\\n costs[rhs].push_back(State(mid,abs(p - points[j+1])/vw));\\n break;\\n }\\n }\\n\\n Line here2left(Point(-1e10,points[i].imag()),points[i]);\\n for(int j = i - 1; j - 1 >= 0; j--){\\n if(points[i].imag() + EPS >= points[j].imag()) break;\\n Line target(points[j-1],points[j]);\\n if(intersectSS(here2left,target)){\\n Point p = crosspoint(here2left,target);\\n int rhs = lower_bound(x.begin(),x.end(),points[j].real() - EPS) - x.begin(); \\n int mid = lower_bound(x.begin(),x.end(),p.real() - EPS) - x.begin();\\n int lhs = lower_bound(x.begin(),x.end(),points[j-1].real() - EPS) - x.begin(); \\n\\n costs[from].push_back(State(mid,abs(p - points[i])/vc));\\n costs[mid].push_back(State(from,abs(p - points[i])/vc));\\n\\n costs[rhs].push_back(State(mid,abs(p - points[j])/vw));\\n costs[mid].push_back(State(rhs,abs(p - points[j])/vw));\\n\\n costs[mid].push_back(State(lhs,abs(p - points[j-1])/vw));\\n costs[lhs].push_back(State(mid,abs(p - points[j-1])/vw));\\n break;\\n }\\n }\\n }\\n \\n int goal_pos = x.size() - 1;\\n dp[0] = 0.0;\\n priority_queue<State,vector<State>,greater<State> > que;\\n que.push(State(0,0));\\n\\n while(!que.empty()){\\n State s = que.top();\\n que.pop();\\n if(s.pos == goal_pos) break;\\n\\n for(int i = 0; i < costs[s.pos].size(); i++){\\n int next_pos = costs[s.pos][i].pos;\\n double next_cost = costs[s.pos][i].cost;\\n if(dp[next_pos] > s.cost + next_cost){\\n dp[next_pos] = s.cost + next_cost;\\n que.push(State(next_pos,s.cost + next_cost));\\n }\\n }\\n }\\n printf(\\\"%.7lf\\\\n\\\",dp[goal_pos]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 1572,\n \"score_of_the_acc\": -0.2968,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2050_949828\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-7)\\n#define equals(a,b) (fabs((a)-(b)) < EPS)\\n\\nusing namespace std;\\n\\nconst int IINF = INT_MAX;\\n\\n// Library - template - begin\\n\\nclass Point{\\npublic:\\n double x,y;\\n Point(double x = -IINF,double y = -IINF): x(x),y(y){}\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:y<p.y; }\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\n\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\n// Library - template - end\\n\\n// Library - intersect - begin\\nPoint crosspoint(Line l, Line m) {\\n double A = cross(l.p2 - l.p1, m.p2 - m.p1);\\n double B = cross(l.p2 - l.p1, l.p2 - m.p1);\\n if (abs(A) < EPS && abs(B) < EPS) return m.p1; // same line\\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n return m.p1 + (m.p2 - m.p1) * (B / A);\\n}\\n// Library - intersect - end\\n\\nint V;\\ndouble vw,vc;\\nPoint ps[1010];\\nbool here[1010]; // here is the point\\ndouble mincost[1010];\\n\\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\\n\\nint main(){\\n\\n while( cin >> V, V ){\\n cin >> vw >> vc;\\n rep(i,V) cin >> ps[i].x >> ps[i].y;\\n\\n rep(i,V) mincost[i] = IINF;\\n mincost[0] = 0;\\n REP(i,1,V) mincost[i] = mincost[i-1] + abs(ps[i]-ps[i-1]) / vw;\\n\\n rep(i,V-2){\\n if( !( LT(ps[i].y,ps[i+1].y) ) ) continue;\\n double lower = ps[i+1].y;\\n REP(k,i+2,V){\\n if( !( ps[k-1].y > ps[k].y ) ) {\\n lower = min(lower,ps[k].y);\\n continue;\\n }\\n if( ps[k].y < lower ){\\n double Y = max(ps[i].y,ps[k].y);\\n Line line = Line(Point(-10100,Y),Point(10100,Y));\\n Point sp = ps[i], gp = ps[k];\\n Point np = crosspoint(line,Line(ps[i ],ps[i+1]));\\n Point mp = crosspoint(line,Line(ps[k-1],ps[k]));\\n double dist1 = abs(np-sp);\\n double dist3 = abs(np-mp);\\n double dist4 = abs(gp-mp);\\n double time1 = dist1 / vw + dist3 / vc + dist4 / vw;\\n if( LT(mincost[i]+time1,mincost[k]) ){\\n mincost[k] = mincost[i]+time1;\\n REP(j,k,V) mincost[j] = min(mincost[j],mincost[j-1] + abs(ps[j]-ps[j-1])/vw);\\n }\\n }\\n lower = min(lower,ps[k].y);\\n if( lower < ps[i].y ) break; //これ忘れてた\\n }\\n }\\n printf(\\\"%.8f\\\\n\\\",mincost[V-1]);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1272,\n \"score_of_the_acc\": -0.1536,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2050_949827\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-7)\\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)\\n\\nusing namespace std;\\n\\nconst int IINF = INT_MAX;\\n\\n// Library - template - begin\\n\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = -IINF,double y = -IINF): x(x),y(y){}\\n\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:y<p.y; }\\n\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n bool operator == (const Segment& p)const { return p.p1 == p1 && p.p2 == p2; }\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\ntypedef vector<Point> Polygon;\\n\\nostream& operator << (ostream& os,const Point& a){ os << \\\"(\\\" << a.x << \\\",\\\" << a.y << \\\")\\\"; }\\n\\nostream& operator << (ostream& os,const Segment& a){ os << \\\"( \\\" << a.p1 << \\\" , \\\" << a.p2 << \\\" )\\\"; }\\n\\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\\n\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\n\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\n\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\n//rad は角度をラジアンで持たせること\\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n\\n// 度をラジアンに変換\\ndouble toRad(double agl){ return agl*M_PI/180.0; }\\n\\n// Library - template - end\\n\\n\\n// Library - ccw - bingin\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS)return CLOCKWISE;\\n if(dot(a,b) < -EPS)return ONLINE_BACK;\\n if(norm(a) < norm(b))return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n\\n// Library - ccw - end\\n\\n// Library - intersect - begin\\n\\nbool intersectLL(Line l, Line m) {\\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\\n}\\nbool intersectLS(Line l, Line s) {\\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(Line l,Point p) {\\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\\n}\\nbool intersectSS(Line s, Line t) {\\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\\n}\\nbool intersectSP(Line s, Point p) {\\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\\n}\\n\\nPoint projection(Line l,Point p) {\\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\\n return l.p1 + (l.p1-l.p2)*t;\\n}\\nPoint reflection(Line l,Point p) {\\n return p + (projection(l, p) - p) * 2;\\n}\\ndouble distanceLP(Line l, Point p) {\\n return abs(p - projection(l, p));\\n}\\ndouble distanceLL(Line l, Line m) {\\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\\n}\\n\\ndouble distanceLS(Line l, Line s) {\\n if (intersectLS(l, s)) return 0;\\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\\n}\\ndouble distanceSP(Line s, Point p) {\\n Point r = projection(s, p);\\n if (intersectSP(s, r)) return abs(r - p);\\n return min(abs(s.p1 - p), abs(s.p2 - p));\\n}\\n\\ndouble distanceSS(Line s, Line t) {\\n if (intersectSS(s, t)) return 0;\\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\\n}\\n\\n/*\\nsame lineの時注意\\nもしm.p1が中心でなかったときに正しい答えとならない\\nPoint crosspoint(Line l,Line m){\\n double A = cross(l.p2-l.p1,m.p2-m.p1);\\n double B = cross(l.p2-l.p1,l.p2-m.p1);\\n if(abs(A) < EPS && abs(B) < EPS){\\n vector<Point> vec;\\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\\n sort(vec.begin(),vec.end());\\n assert(vec[1] == vec[2]);\\n return vec[1];\\n //return m.p1;\\n }\\n if(abs(A) < EPS)assert(false);\\n return m.p1 + (m.p2-m.p1)*(B/A);\\n}\\n\\n*/\\nPoint crosspoint(Line l, Line m) {\\n double A = cross(l.p2 - l.p1, m.p2 - m.p1);\\n double B = cross(l.p2 - l.p1, l.p2 - m.p1);\\n if (abs(A) < EPS && abs(B) < EPS) return m.p1; // same line\\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n return m.p1 + (m.p2 - m.p1) * (B / A);\\n}\\n\\n\\n// Library - intersect - end\\n\\nint V;\\ndouble vw,vc;\\nPoint ps[1010];\\nbool here[1010]; // here is the point\\ndouble mincost[1010];\\n\\n// a < b\\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\\n\\n// a <= b\\ninline bool LTE(double a,double b) { return equals(a,b) || a < b; }\\n\\nint main(){\\n\\n while( cin >> V, V ){\\n cin >> vw >> vc;\\n rep(i,V) cin >> ps[i].x >> ps[i].y;\\n\\n rep(i,V) mincost[i] = IINF;\\n mincost[0] = 0;\\n REP(i,1,V) mincost[i] = mincost[i-1] + abs(ps[i]-ps[i-1]) / vw;\\n\\n rep(i,V-2){\\n if( !( LT(ps[i].y,ps[i+1].y) ) ) continue;\\n double lower = ps[i+1].y;\\n //cout << \\\"start = \\\" << i << endl;\\n REP(k,i+2,V){\\n if( !( ps[k-1].y > ps[k].y ) ) {\\n //cout << \\\"continue \\\" << k << endl;\\n lower = min(lower,ps[k].y);\\n continue;\\n }\\n if( ps[k].y < lower ){\\n double Y = max(ps[i].y,ps[k].y);\\n Line line = Line(Point(-10100,Y),Point(10100,Y));\\n Point sp = ps[i], gp = ps[k];\\n Point np = crosspoint(line,Line(ps[i ],ps[i+1]));\\n Point mp = crosspoint(line,Line(ps[k-1],ps[k]));\\n double dist1 = abs(np-sp);\\n double dist3 = abs(np-mp);\\n double dist4 = abs(gp-mp);\\n double time1 = dist1 / vw + dist3 / vc + dist4 / vw;\\n //cout << np << \\\" <=> \\\" << mp<<endl;\\n //cout << \\\"time1 = \\\" << time1 << \\\" :: \\\" << mincost[i] + time1 << endl;\\n if( LT(mincost[i]+time1,mincost[k]) ){\\n mincost[k] = mincost[i]+time1;\\n REP(j,k,V) mincost[j] = min(mincost[j],mincost[j-1] + abs(ps[j]-ps[j-1])/vw);\\n }\\n }\\n\\n lower = min(lower,ps[k].y);\\n if( lower < ps[i].y ) break;\\n //if( k == V-1) cout << \\\"BREAK \\\" << k << endl;\\n }\\n }\\n\\n //rep(i,V) cout << mincost[i] << \\\" \\\"; cout << endl;\\n printf(\\\"%.8f\\\\n\\\",mincost[V-1]);\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1276,\n \"score_of_the_acc\": -0.1539,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2050_772879\",\n \"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 repi(i,a,b) for(int i = (a); i < (b); i++)\\n#define rep(i,a) repi(i,0,a)\\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\\n#define pb push_back\\n#define mp makek_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;\\n\\nint n, x[1024], y[1024];\\ndouble vw, vc;\\n\\nconst int N = 4000;\\n\\ndouble mem[N];\\n\\nstruct edge\\n{\\n int v; double c;\\n edge(int v, double c) : v(v), c(c) {}\\n};\\n\\nstruct node\\n{\\n int v; double c;\\n node(int v, double c) : v(v), c(c) {}\\n bool operator <(const node& t) const {\\n\\treturn c > t.c;\\n }\\n};\\n\\nvector<vector<edge> > E;\\n\\nint main(){\\n while (cin >> n && n) {\\n\\tcin >> vw >> vc;\\n\\tvw = 1.0 / vw;\\n\\tvc = 1.0 / vc;\\n\\trep(i, n)\\n\\t cin >> x[i] >> y[i];\\n\\n\\tE.assign(n, vector<edge>());\\n\\trep(i, n - 1)\\n\\t E[i].pb(edge(i + 1, vw * hypot((double) (x[i + 1] - x[i]),\\n\\t\\t\\t\\t\\t (double) (y[i + 1] - y[i]))));\\n\\n\\tstack<int> stk;\\n\\trep(i, n - 1) {\\n\\t if (y[i] < y[i + 1])\\n\\t\\tstk.push(i);\\n\\t else if (y[i] == y[i + 1]) {\\n\\t\\t//\\n\\t } else {\\n\\t\\twhile (!stk.empty() && y[stk.top()] >= y[i + 1]) {\\n\\t\\t int it = stk.top();\\n\\t\\t stk.pop();\\n\\t\\t if (y[it] == y[i + 1]) {\\n\\t\\t\\tE[it].pb(edge(i + 1, vc * (x[i + 1] - x[it])));\\n\\t\\t\\tcontinue;\\n\\t\\t }\\n\\t\\t double p = (double) (y[it] - y[i]) / (y[i + 1] - y[i]);\\n\\t\\t double cx = p * x[i + 1] + (1 - p) * x[i];\\n\\t\\t double cy = p * y[i + 1] + (1 - p) * y[i];\\n\\n\\t\\t int nv = E.size();\\n\\t\\t E.pb(vector<edge>());\\n\\t\\t E[it].pb(edge(nv, vc * (cx - x[it])));\\n\\t\\t E[i].pb(edge(nv, vw * hypot((double) (cx - x[i]),\\n\\t\\t\\t\\t\\t\\t(double) (cy - y[i]))));\\n\\t\\t E[nv].pb(edge(i + 1, vw * hypot((double) (cx - x[i + 1]),\\n\\t\\t\\t\\t\\t\\t (double) (cy - y[i + 1]))));\\n\\t\\t}\\n\\t }\\n\\t}\\n\\n\\tstk = stack<int>();\\n\\tfor (int i = n - 2; i >= 0; --i) {\\n\\t if (y[i] > y[i + 1])\\n\\t\\tstk.push(i + 1);\\n\\t else if (y[i] == y[i + 1]) {\\n\\t\\t//\\n\\t } else {\\n\\t\\twhile (!stk.empty() && y[stk.top()] >= y[i]) {\\n\\t\\t int it = stk.top();\\n\\t\\t stk.pop();\\n\\t\\t if (y[it] == y[i]) {\\n\\t\\t\\tE[i].pb(edge(it, vc * (x[it] - x[i])));\\n\\t\\t\\tcontinue;\\n\\t\\t }\\n\\t\\t double p = (double) (y[it] - y[i]) / (y[i + 1] - y[i]);\\n\\t\\t double cx = p * x[i + 1] + (1 - p) * x[i];\\n\\t\\t double cy = p * y[i + 1] + (1 - p) * y[i];\\n\\n\\t\\t int nv = E.size();\\n\\t\\t E.pb(vector<edge>());\\n\\t\\t E[nv].pb(edge(it, vc * (x[it] - cx)));\\n\\t\\t E[i].pb(edge(nv, vw * hypot((double) (cx - x[i]),\\n\\t\\t\\t\\t\\t\\t(double) (cy - y[i]))));\\n\\t\\t E[nv].pb(edge(i + 1, vw * hypot((double) (cx - x[i + 1]),\\n\\t\\t\\t\\t\\t\\t (double) (cy - y[i + 1]))));\\n\\t\\t}\\n\\t }\\n\\t}\\n\\n\\tfill(mem, mem + N, INF);\\n\\n\\tpriority_queue<node> q;\\n\\tq.push(node(0, 0.0));\\n\\twhile (!q.empty()) {\\n\\t node tmp = q.top();\\n\\t int v = tmp.v;\\n\\t double c = tmp.c;\\n\\t q.pop();\\n\\n\\t if (v == n - 1) {\\n\\t\\tprintf(\\\"%.6f\\\\n\\\", c);\\n\\t\\tbreak;\\n\\t }\\n\\t if (mem[v] <= c)\\n\\t\\tcontinue;\\n\\t mem[v] = c;\\n\\n\\t rep(i, E[v].size())\\n\\t\\tq.push(node(E[v][i].v, c + E[v][i].c));\\n\\t}\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1456,\n \"score_of_the_acc\": -0.1382,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2050_610312\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\\\" \\\"; cerr<<endl; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\nstruct Point{\\n double x, y;\\n Point(){}\\n Point(double x, double y) : x(x), y(y) {}\\n};\\nstruct S{\\n int line;\\n int height;\\n double cost;\\n S(int l, int h, int c) :\\n line(l), height(h), cost(c) {}\\n bool operator < (const S& s) const {\\n return cost > s.cost;\\n }\\n};\\nint lb_index(vector<double>& v, int x){\\n return lower_bound(v.begin(), v.end(), x) - v.begin();\\n}\\nbool valid_h(S& s, vector<Point>& ps, vector<double>& hs){\\n return (s.height >= 0 && s.height < hs.size() && \\n min(ps[s.line].y, ps[s.line + 1].y) <= hs[s.height] &&\\n max(ps[s.line].y, ps[s.line + 1].y) >= hs[s.height] );\\n}\\nvoid update(priority_queue<S>& que, double cost[1000][1000], S& next){\\n if(cost[next.line][next.height] > next.cost){\\n cost[next.line][next.height] = next.cost;\\n que.push(next);\\n }\\n}\\nvoid print(S& s, vector<double>& hs, vector<Point>& ps){\\n printf(\\\"line %d: (%.0lf, %.0lf) -> (%.0lf, %.0lf) | height %d: y = %.0lf | cost %lf\\\\n\\\",\\n s.line, ps[s.line].x, ps[s.line].y, ps[s.line + 1].x, ps[s.line + 1].y,\\n s.height, hs[s.height], s.cost);\\n}\\nint main(){\\n int N;\\n double v_w, v_c;\\n while(cin >> N >> v_w >> v_c && N){ \\n vector<Point> ps(N);\\n REP(i, N) cin >> ps[i].x >> ps[i].y;\\n vector<double> hs(N);\\n REP(i, N) hs[i] = ps[i].y;\\n sort(hs.begin(), hs.end());\\n hs.erase(unique(hs.begin(), hs.end()), hs.end());\\n int L = hs.size();\\n vector< vector<int> > idxes(L); // y = hs[i]と交わる線分のインデックス\\n REP(i, N - 1){\\n REP(j, L){\\n if(min(ps[i].y, ps[i + 1].y) <= hs[j] && hs[j] <= max(ps[i].y, ps[i + 1].y)){\\n idxes[j].push_back(i);\\n }\\n }\\n }\\n /*\\n REP(i, L){\\n printf(\\\"idxes[%d]:\\\", i);\\n debug(idxes[i].begin(), idxes[i].end());\\n }\\n */\\n priority_queue<S> que;\\n double cost[1000][1000] = {};\\n REP(i, N) REP(j, L) cost[i][j] = INF;\\n cost[0][lb_index(hs, ps[0].y)] = 0;\\n que.push(S(0, lb_index(hs, ps[0].y), 0));\\n while(!que.empty()){\\n S s = que.top(); que.pop();\\n //print(s, hs, ps);\\n if(cost[s.line][s.height] < s.cost) continue;\\n if(s.line == N - 2 && hs[s.height] == ps[s.line + 1].y){\\n if(ps[s.line].y == ps[s.line + 1].y) s.cost += (ps[s.line + 1].x - ps[s.line].x) / v_w;\\n printf(\\\"%.16lf\\\\n\\\", s.cost);\\n break;\\n }\\n if(hs[s.height] == ps[s.line].y){\\n if(s.line > 0){\\n S next = s;\\n next.line --;\\n if(ps[next.line].y == ps[next.line + 1].y) next.cost += (ps[next.line + 1].x - ps[next.line].x) / v_w;\\n update(que, cost, next);\\n }\\n }\\n if(hs[s.height] == ps[s.line + 1].y){\\n if(s.line < N - 2){\\n S next = s;\\n next.line ++;\\n if(ps[s.line].y == ps[s.line + 1].y) next.cost += (ps[s.line + 1].x - ps[s.line].x) / v_w;\\n update(que, cost, next);\\n }\\n }\\n for(int d = -1; d <= 1; d += 2){\\n S next = s;\\n next.height += d;\\n if(valid_h(next, ps, hs)){\\n assert(ps[s.line + 1].y != ps[s.line].y);\\n double C = (ps[s.line + 1].x - ps[s.line].x) / (ps[s.line + 1].y - ps[s.line].y);\\n double dy = (hs[s.height + d] - hs[s.height]);\\n double dx = C * dy;\\n //printf(\\\"dx = %lf dy = %lf\\\\n\\\", dx, dy);\\n next.cost += sqrt(dx*dx + dy*dy) / v_w; // ??\\n update(que, cost, next);\\n }\\n }\\n if(idxes[s.height].back() != s.line && ps[s.line + 1].y != hs[s.height] && ps[s.line].y < ps[s.line + 1].y){\\n S next = s;\\n next.line = *upper_bound(idxes[s.height].begin(), idxes[s.height].end(), s.line);\\n //printf(\\\"go tonnnel -> %d\\\\n\\\", next.line);\\n double x1 = ps[s.line].x + (ps[s.line + 1].x - ps[s.line].x) * (hs[s.height] - ps[s.line].y) / (ps[s.line + 1].y - ps[s.line].y);\\n double x2 = ps[next.line].x +\\n ((ps[next.line + 1].y == ps[next.line].y) ? 0 : (ps[next.line + 1].x - ps[next.line].x) * (hs[next.height] - ps[next.line].y) / (ps[next.line + 1].y - ps[next.line].y));\\n next.cost += (x2 - x1) / v_c; // ???\\n update(que, cost, next);\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 10532,\n \"score_of_the_acc\": -1.3115,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2050_572049\",\n \"code_snippet\": \"#include<cmath>\\n#include<queue>\\n#include<cstdio>\\n#include<algorithm>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nconst double EPS=1e-7;\\nconst double INF=1e77;\\n\\nstruct point{\\n\\tdouble x,y;\\n\\tpoint():x(0),y(0){}\\n\\tpoint(double x,double y):x(x),y(y){}\\n\\tpoint operator+(const point &a)const{ return point(x+a.x,y+a.y); }\\n\\tpoint operator-(const point &a)const{ return point(x-a.x,y-a.y); }\\n\\tbool operator< (const point &a)const{ return x+EPS<a.x || abs(x-a.x)<EPS && y+EPS<a.y; }\\n};\\n\\npoint operator*(double c,const point &a){ return point(c*a.x,c*a.y); }\\n\\ndouble dot(const point &a,const point &b){ return a.x*b.x+a.y*b.y; }\\n\\ndouble cross(const point &a,const point &b){ return a.x*b.y-a.y*b.x; }\\n\\ndouble abs(const point &a){ return sqrt(a.x*a.x+a.y*a.y); }\\n\\nstruct line{\\n\\tpoint a,b;\\n\\tline(const point &a,const point &b):a(a),b(b){}\\n};\\n\\nstruct segment{\\n\\tpoint a,b;\\n\\tsegment(const point &a,const point &b):a(a),b(b){}\\n};\\n\\nbool cover(const segment &S,const point &p){\\n\\treturn abs(cross(S.a-p,S.b-p))<EPS && dot(S.a-p,S.b-p)<EPS;\\n}\\n\\npoint get_intersect(const line &L1,const line &L2){\\n\\tdouble a1=cross(L1.b-L1.a,L2.b-L2.a);\\n\\tdouble a2=cross(L1.b-L1.a,L1.b-L2.a);\\n\\tif(abs(a1)<EPS) return L1.a;\\n\\treturn L2.a+a2/a1*(L2.b-L2.a);\\n}\\n\\nstruct edge{ int v; double cost; };\\n\\nint main(){\\n\\tfor(int n;scanf(\\\"%d\\\",&n),n;){\\n\\t\\tdouble v1,v2; scanf(\\\"%lf%lf\\\",&v1,&v2);\\n\\t\\tpoint p[2000];\\n\\t\\trep(i,n) scanf(\\\"%lf%lf\\\",&p[i].x,&p[i].y);\\n\\n\\t\\tvector<edge> G[2000];\\n\\t\\tint n2=0;\\n\\t\\trep(i,n){\\n\\t\\t\\t// dig right\\n\\t\\t\\tif(i<n-1 && p[i].y<p[i+1].y){\\n\\t\\t\\t\\tint j=i+1;\\n\\t\\t\\t\\twhile(j<n && p[i].y<p[j].y) j++;\\n\\t\\t\\t\\tif(j<n){\\n\\t\\t\\t\\t\\tp[n+n2]=get_intersect(line(p[j-1],p[j]),line(p[i],p[i]+point(1,0)));\\n\\t\\t\\t\\t\\tG[i].push_back((edge){n+n2,abs(p[i]-p[n+n2])/v2});\\n\\t\\t\\t\\t\\tn2++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t// dig left\\n\\t\\t\\tif(i>0 && p[i].y<p[i-1].y){\\n\\t\\t\\t\\tint j=i-1;\\n\\t\\t\\t\\twhile(j>=0 && p[i].y<p[j].y) j--;\\n\\t\\t\\t\\tif(j>=0){\\n\\t\\t\\t\\t\\tp[n+n2]=get_intersect(line(p[j+1],p[j]),line(p[i],p[i]+point(1,0)));\\n\\t\\t\\t\\t\\tG[n+n2].push_back((edge){i,abs(p[i]-p[n+n2])/v2});\\n\\t\\t\\t\\t\\tn2++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\trep(i,n-1){\\n\\t\\t\\tvector< pair<point,int> > Q;\\n\\t\\t\\trep(j,n+n2){\\n\\t\\t\\t\\tif(cover(segment(p[i],p[i+1]),p[j])) Q.push_back(make_pair(p[j],j));\\n\\t\\t\\t}\\n\\t\\t\\tsort(Q.begin(),Q.end());\\n\\t\\t\\trep(j,(int)Q.size()-1){\\n\\t\\t\\t\\tint u=Q[j].second,v=Q[j+1].second;\\n\\t\\t\\t\\tG[u].push_back((edge){v,abs(Q[j+1].first-Q[j].first)/v1});\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tdouble d[2000];\\n\\t\\trep(u,n+n2) d[u]=(u==0?0:INF);\\n\\n\\t\\tpriority_queue< pair<double,int> > Q;\\n\\t\\tQ.push(make_pair(0,0));\\n\\t\\twhile(!Q.empty()){\\n\\t\\t\\tdouble d_now=-Q.top().first;\\n\\t\\t\\tint u=Q.top().second; Q.pop();\\n\\n\\t\\t\\tif(d[u]<d_now-EPS) continue;\\n\\n\\t\\t\\trep(i,G[u].size()){\\n\\t\\t\\t\\tint v=G[u][i].v;\\n\\t\\t\\t\\tdouble cost=G[u][i].cost;\\n\\t\\t\\t\\tif(d[v]>d[u]+cost+EPS){\\n\\t\\t\\t\\t\\td[v]=d[u]+cost;\\n\\t\\t\\t\\t\\tQ.push(make_pair(-d[v],v));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%.9f\\\\n\\\",d[n-1]);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1336,\n \"score_of_the_acc\": -0.2252,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2050_405863\",\n \"code_snippet\": \"#include <cstdio>\\n#include <iostream>\\n#include <vector>\\n#include <list>\\n#include <cmath>\\n#include <fstream>\\n#include <algorithm>\\n#include <string>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <complex>\\n#include <iterator>\\n#include <cstdlib>\\n#include <cstring>\\n#include <sstream>\\n\\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 pair<P,P> Edge;\\ntypedef long long ll;\\n\\nconst double PI=4*atan(1.0);\\nconst int MAX_SIZE = 10000;\\n\\n// 内積\\ndouble dot(P a, P b) {\\n return (a.real() * b.real() + a.imag() * b.imag());\\n}\\n// 外積\\ndouble cross(P a, P b) {\\n return (a.real() * b.imag() - a.imag() * b.real());\\n}\\n// 点cが直線ab上にあるかないか\\nint is_point_on_line(P a, P b, P c) {\\n return EQ( cross(b-a, c-a), 0.0 );\\n}\\n// 2直線の直行判定\\nint is_orthogonal(P a1, P a2, P b1, P b2) {\\n return EQ( dot(a1-a2, b1-b2), 0.0 );\\n}\\n// 2直線の平行判定\\nint is_parallel(P a1, P a2, P b1, P b2) {\\n return EQ( cross(a1-a2, b1-b2), 0.0 );\\n}\\n// 点a,bを通る直線と点cの間の距離\\ndouble distance_l_p(P a, P b, P c) {\\n return abs(cross(b-a, c-a)) / abs(b-a);\\n}\\n// 点a,bを端点とする線分と点cとの距離\\ndouble distance_ls_p(P a, P b, P c) {\\n if ( dot(b-a, c-a) < EPS ) return abs(c-a);\\n if ( dot(a-b, c-b) < EPS ) return abs(c-b);\\n return abs(cross(b-a, c-a)) / abs(b-a);\\n}\\n// 点が多角形の中に存在するかどうか\\nbool isInPolygon(vector<P> &points,P s){\\n\\tif(points.size()==1)return false;\\n\\tvector<P> v;\\n\\tfor(int i=0;i<(int)points.size();i++)v.push_back(points[i]-s);\\n\\tint sign=0;\\n\\tfor(int i=1;i<=(int)v.size();i++){\\n\\t\\tint prv=(i-1+v.size())%v.size();\\n\\t\\tint cur=i%v.size();\\n\\t\\tdouble c=cross(v[prv],v[cur]);\\n\\t\\tif(EQ(c,0))continue;\\n\\t\\telse if(sign==0){\\n\\t\\t\\tif(c>0)sign=1;\\n\\t\\t\\telse sign=-1;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tif(sign==-1&&c>0)return false;\\n\\t\\t\\telse if(sign==1&&c<0)return false;\\n\\t\\t}\\n\\t}\\n\\treturn true;\\n}\\nstruct Rec{\\n\\tvector<P> p;\\n};\\n// a1,a2を端点とする線分とb1,b2を端点とする線分の交差判定\\nint is_intersected_ls(P a1, P a2, P b1, P b2) {\\n // 線分が平行な場合は重なっていないことにする\\n if(abs(cross(a2-a1,b2-b1)) < EPS){\\n return 0;\\n }\\n return ( cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1) < EPS ) &&\\n ( cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1) < EPS );\\n}\\n// aとbの矩形が接しているかどうか(どちらかがどちからを含んでいるものもふくむ\\nbool isTouchRectangle(Rec &a,Rec &b){\\n // aの各頂点がbの中に存在しているかチェック\\n for(int i=0;i<4;i++)if(isInPolygon(b.p,a.p[i]))return true;\\n // 逆\\n for(int i=0;i<4;i++)if(isInPolygon(a.p,b.p[i]))return true;\\n // 各辺が他方のどれかの辺と接しているか\\n for(int i=0;i<4;i++){\\n int curi=i;\\n int prvi=(i-1+4)%4;\\n for(int j=0;j<4;j++){\\n int curj=j;\\n int prvj=(j-1+4)%4;\\n if(is_intersected_ls(a.p[curi],a.p[prvi],b.p[curj],b.p[prvj]))return true;\\n }\\n }\\n return false;\\n}\\n// a1,a2を端点とする線分とb1,b2を端点とする線分の交点計算\\nP intersection_ls(P a1, P a2, P b1, P b2) {\\n P b = b2-b1;\\n double d1 = abs(cross(b, a1-b1));\\n double d2 = abs(cross(b, a2-b1));\\n double t = d1 / (d1 + d2);\\n return a1 + (a2-a1) * t;\\n}\\n// a1,a2を通る直線とb1,b2を通る直線の交差判定\\nint is_intersected_l(P a1, P a2, P b1, P b2) {\\n return !EQ( cross(a1-a2, b1-b2), 0.0 );\\n}\\n// a1,a2を通る直線とb1,b2を通る直線の交点計算\\nP intersection_l(P a1, P a2, P b1, P b2) {\\n P a = a2 - a1; P b = b2 - b1;\\n return a1 + a * cross(b, b1-a1) / cross(b, a);\\n}\\n// 単位ベクトルを求める\\nP normalVector(P p){\\n\\treturn p/abs(p);\\n}\\n// 法線ベクトルを求める\\nP unitVector(P a){\\n\\treturn P(-a.imag(),a.real());\\n}\\n// 単位法線ベクトルを求める\\nP unitNormalVector(P tmp){\\n\\tP e=P(-tmp.imag(),tmp.real());\\n\\te/=abs(e);\\n\\treturn e;\\n}\\n// 座標の回転(座標pにある点を,半時計回りにa(ラジアン)回転)\\nP roundPoint(P p,double a){\\n\\treturn P(cos(a)*p.real()-sin(a)*p.imag(),sin(a)*p.real()+cos(a)*p.imag());\\n}\\n/*\\n円周と線分の交差判定\\n*/\\nbool isCircleCrossLine(P a,P b,P c,double r){\\n\\tdouble d1 = abs(a-c);\\n\\tdouble d2 = abs(b-c);\\n // 線分が中に含まれるとき、ここのコメントアウトをはずせばtrue(交差)となる\\n\\t//if(d1<r&&d2<r)\\n\\t//\\treturn true;\\n\\tdouble d = distance_ls_p(a,b,c);\\n\\treturn (EQ(d,r)||d<r);\\n}\\n// 三角形の内部に点があるかどうか\\n// 外積の正負がすべて同じなら内部に点あり\\nbool isInTriangle(P p1,P p2,P p3,P s){\\n\\tP a=p1-s;\\n\\tP b=p2-s;\\n\\tP c=p3-s;\\n\\treturn ((cross(a,b)>0&&cross(b,c)>0&&cross(c,a)>0)||(cross(a,b)<0&&cross(b,c)<0&&cross(c,a)<0));\\n}\\n// 矩形の中に点が存在するかどうか\\nbool isInRectangle(P p1,P p2,P p3,P p4,P s){\\n\\tP a=p1-s;\\n\\tP b=p2-s;\\n\\tP c=p3-s;\\n P d=p4-s;\\n\\treturn ((cross(a,b)>0&&cross(b,c)>0&&cross(c,d)>0&&cross(d,a)>0)\\n ||(cross(a,b)<0&&cross(b,c)<0&&cross(c,d)<0&&cross(d,a)<0));\\n}\\n// 三角形の面積を座標から計算\\ndouble calcAreaOfTriangle(P a,P b,P c){\\n\\treturn abs((b.real()-a.real())*(c.imag()-a.imag()) - (c.real()-a.real())*(b.imag()-a.imag()))/2;\\n}\\n// 与えられた円の範囲内に点が存在するかどうか\\nbool isContainingDot(P c,double r,P a){\\n\\treturn (((c.real()-a.real())*(c.real()-a.real())\\n\\t\\t+(c.imag()-a.imag())*(c.imag()-a.imag())<r*r)\\n\\t\\t||EQ((c.real()-a.real())*(c.real()-a.real())\\n\\t\\t+(c.imag()-a.imag())*(c.imag()-a.imag()),r*r));\\n}\\n// 多角形の面積公式\\ndouble calcPolygonArea(vector<P> p){\\n\\tdouble sum=0;\\n\\tfor(int i = 0; i < p.size(); i++)\\n\\t\\tsum+=cross(p[i],p[(i+1)%(p.size())]);\\n\\treturn abs(sum/2);\\n}\\n// 2ベクトル間の角度\\n// aからbへ左周りで何度か(0->2*PI)\\ndouble diffAngle(P a,P b){\\n double angle=atan2(cross(a,b),dot(a,b));\\n if(angle<0)\\n return 2*PI+angle;\\n return angle;\\n}\\n// 2つのベクトルの重なっている部分の長さを返す\\n// もし重なっていなければ0を返す\\ndouble multipleLength(P a,P b,P c,P d){\\n Edge e1=make_pair(a,b);\\n Edge e2=make_pair(c,d);\\n // 平行であるかどうか\\n if(!(is_parallel(e1.first,e2.first,e1.second,e2.second)\\n &&is_parallel(e1.first,e1.second,e2.first,e2.second)))\\n return 0;\\n double dist=0;\\n // 両方乗っている\\n if(EQ(distance_ls_p(e1.first,e1.second,e2.first),0)&&EQ(distance_ls_p(e1.first,e1.second,e2.second),0))\\n dist=abs(e2.first-e2.second);\\n else if(EQ(distance_ls_p(e2.first,e2.second,e1.first),0)&&EQ(distance_ls_p(e2.first,e2.second,e1.second),0))\\n dist=abs(e1.first-e1.second);\\n else if(EQ(distance_ls_p(e1.first,e1.second,e2.first),0)){\\n // どちらが線上にあるか\\n if(EQ(distance_ls_p(e2.first,e2.second,e1.first),0))\\n dist=abs(e1.first-e2.first);\\n else\\n dist=abs(e1.second-e2.first);\\n }\\n else if(EQ(distance_ls_p(e1.first,e1.second,e2.second),0)){\\n if(EQ(distance_ls_p(e2.first,e2.second,e1.first),0))\\n dist=abs(e1.first-e2.second);\\n else\\n dist=abs(e1.second-e2.second);\\n }\\n return dist;\\n}\\n// 2点を通る半径rの円の中点を求める\\npair<P,P> calcCircleCenterPoint(P dot1,P dot2,double r){\\n double v=abs(dot1-dot2);\\n double x = sqrt(r*r - (v/2)*(v/2));\\n // 二組の単位法線ベクトル\\n P hose[2];\\n double x1=-(dot1.imag()-dot2.imag());\\n double y1=(dot1.real() - dot2.real());\\n hose[0]=P(x1,y1);\\n double y2=-y1;\\n double x2=-x1;\\n hose[1]=P(x2,y2);\\n double dd1=abs(hose[0]);\\n double dd2=abs(hose[1]);\\n hose[0]/=dd1;hose[0]*=x;\\n hose[1]/=dd2;hose[1]*=x;\\n P tmp=(dot1+dot2);\\n tmp/=2;\\n hose[0]+=tmp;\\n hose[1]+=tmp;\\n return make_pair(hose[0],hose[1]);\\n}\\n// 4線分が端点以外でクロスしているかどうかを判定\\nbool checkCross(const vector<Edge> &vec){\\n for(int i=0;i<vec.size();i++){\\n for(int j=i+1;j<vec.size();j++){\\n // 線分がクロスしているかどうか\\n if(is_intersected_ls(vec[i].first,vec[i].second,vec[j].first,vec[j].second)){\\n // している場合、端点以外でクロスしているなら、false\\n P p=intersection_ls(vec[i].first,vec[i].second,vec[j].first,vec[j].second);\\n if(!(EQ(p,vec[i].first)||EQ(p,vec[i].second)))\\n return false;\\n }\\n }\\n }\\n return true;\\n}\\n// 引き数で与えられた4つの点が矩形を作るどうかを判定\\nbool checkRec(const vector<P> &squ){\\n vector<int> v;\\n for(int i=0;i<squ.size();i++)v.push_back(i);\\n do{\\n vector<Edge> ve;\\n for(int i=0;i<4;i++)\\n ve.push_back(make_pair(squ[v[i]],squ[v[(i+1)%4]]));\\n // ここですべての線分がクロスするかどうかを計算\\n if(checkCross(ve)){\\n // 線分の長さを確認\\n if(EQ(abs(ve[0].first-ve[0].second),abs(ve[2].first-ve[2].second)))\\n if(EQ(abs(ve[1].first-ve[1].second),abs(ve[3].first-ve[3].second)))\\n // 直行\\n if(is_orthogonal(ve[0].first,ve[0].second,ve[1].first,ve[1].second))\\n if(is_orthogonal(ve[2].first,ve[2].second,ve[3].first,ve[3].second))\\n return true;\\n }\\n }while(next_permutation(v.begin(),v.end()));\\n return false;\\n}\\n// 引き数で与えられた4つの点が正方形を作るかどうかを判定\\nbool checkSqu(const vector<P> &squ){\\n vector<int> v;\\n for(int i=0;i<squ.size();i++)v.push_back(i);\\n do{\\n vector<Edge> ve;\\n for(int i=0;i<4;i++)\\n ve.push_back(make_pair(squ[v[i]],squ[v[(i+1)%4]]));\\n // ここですべての線分がクロスするかどうかを計算\\n if(checkCross(ve)){\\n // 線分の長さを確認\\n double d=abs(ve[0].first-ve[0].second);\\n for(int i=1;i<4;i++){\\n double d2=abs(ve[i].first-ve[i].second);\\n if(!EQ(d,d2))return false;\\n }\\n // 直行確認\\n if(is_orthogonal(ve[0].first,ve[0].second,ve[1].first,ve[1].second))\\n if(is_orthogonal(ve[2].first,ve[2].second,ve[3].first,ve[3].second))\\n return true;\\n }\\n }while(next_permutation(v.begin(),v.end()));\\n return false;\\n}\\n// 二円の共通接線を構成する4直線を求める(二円はお互い接したりどちらかをふくんだりしない)\\nvector<pair<P,P> > calcCommonTangentialLine(P p1,double r1,P p2,double r2){\\n\\tvector<pair<P,P> > res;\\n\\tif(r1>r2){\\n\\t\\tswap(r1,r2);\\n\\t\\tswap(p1,p2);\\n\\t}\\n\\t// 共通外接線\\n\\t{\\n\\t\\tdouble d=abs(p1-p2);\\n\\t\\tdouble a=abs(r1-r2);\\n\\t\\tdouble b=sqrt(d*d-a*a);\\n\\t\\tdouble sita=acos(b/d);\\n\\t\\tP e=normalVector(roundPoint((roundPoint((p2-p1),sita)),PI/2));\\n\\t\\tres.push_back(make_pair(e*r1+p1,e*r2+p2));\\n\\t\\tP e2=normalVector(roundPoint((roundPoint((p2-p1),-sita)),-PI/2));\\n\\t\\tres.push_back(make_pair(e2*r1+p1,e2*r2+p2));\\n\\t}\\n\\t// 共通内接線\\n\\t{\\n\\t\\tP cp=(r1*p1+r2*p2)/(r1+r2);\\n\\t\\tdouble u=abs(cp-p1);\\n\\t\\tdouble sita=acos(r1/u);\\n\\t\\tP e=normalVector(roundPoint(cp-p1,sita));\\n\\t\\tres.push_back(make_pair(e*r1+p1,-e*r2+p2));\\n\\t\\tP e2=normalVector(roundPoint(cp-p1,-sita));\\n\\t\\tres.push_back(make_pair(e2*r1+p1,-e2*r2+p2));\\n\\t}\\n\\treturn res;\\n}\\n/*\\n 与えられた3点a,b,c,をa->b->cと進むとき\\n a->bで時計方向に折れて,b->c\\n a->bで半時計方向に折れて,b->c\\n a->bで逆を向いてaを通り越してb->c\\n a->bでそのままb->c\\n a->bで逆を向いてb->c\\n のどれであるかを判定\\n*/\\nint ccw(P a,P b, P c){\\n b-=a;c-=a;\\n if(cross(b,c)>0&&!EQ(cross(b,c),0))return 1;// counter clockwise\\n if(cross(b,c)<0&&!EQ(cross(b,c),0))return -1;// clockwise\\n if(dot(b,c)<0&&!EQ(dot(b,c),0))return 2; // c-a-b on line\\n if(!EQ(abs(b),abs(c))&&abs(b)<abs(c))return -2; // a-b-c on line\\n return 0;\\n}\\n// 凸多角形の切断を行う\\n// lineのfirst側から見て右の多角形が返る\\n// 多角形は上が+y,右が+xの座標系で座標を時計周りに格納したvectorで表す\\n// lineは基本的にmakeDivisorで作成\\nvector<P> convex_cut(vector<P> polygon,pair<P,P> line){\\n vector<P> resPolygon;\\n int n=polygon.size();\\n for(int i=0;i<n;i++){\\n P A=polygon[i];\\n P B=polygon[(i+1)%n];\\n if(ccw(line.first,line.second,A)!=-1)\\n resPolygon.push_back(A);\\n if(ccw(line.first,line.second,A)*ccw(line.first,line.second,B)<0)\\n resPolygon.push_back(intersection_l(A,B,line.first,line.second));\\n }\\n return resPolygon;\\n}\\n\\nstruct Point{\\n P p;\\n Point(P _p){\\n p=_p;\\n }\\n Point(){}\\n bool operator<(const Point &op)const{\\n if(EQ(p.real(),op.p.real())){\\n if(EQ(p.imag(),op.p.imag()))return false;\\n else return p.imag()<op.p.imag();\\n }\\n return p.real()<op.p.real();\\n }\\n};\\nstruct edge{\\n double dist;\\n Point to;\\n};\\n\\nconst int MAX_N=10000;\\nconst int INF=1000000000;\\nvector<edge> G[MAX_N];\\ndouble d[MAX_N];\\nvector<P> ps;\\nset<Point> nodes;\\nmap<Point,int> m;\\nint idx;\\nint n;\\n\\ntypedef pair<double,int> pii;\\n\\ndouble dijkstra(){\\n for(int i=0;i<idx;i++)d[i]=INF;\\n priority_queue<pii> pq;\\n pq.push(pii(0,m[Point(ps[0])]));\\n // start\\n d[m[Point(ps[0])]]=0;\\n while(pq.size()){\\n pii p=pq.top();pq.pop();\\n double cost=p.first;\\n int node=p.second;\\n if(!EQ(d[node],cost)&&d[node]<cost)continue;\\n for(int i=0;i<G[node].size();i++){\\n edge &e=G[node][i];\\n if(!EQ(d[m[e.to]],cost+e.dist)&&d[m[e.to]]>cost+e.dist){\\n\\td[m[e.to]]=cost+e.dist;\\n\\tpq.push(pii(d[m[e.to]],m[e.to]));\\n }\\n }\\n }\\n // ゴールへの最短距離\\n return d[m[Point(ps[n-1])]];\\n}\\n\\nint main(){\\n while(cin>>n&&n){\\n double vw,vc;\\n idx=0;ps.clear();m.clear();nodes.clear();\\n cin>>vw>>vc;\\n for(int i=0;i<n;i++){\\n double x,y;\\n cin>>x>>y;\\n ps.push_back(P(x,y));\\n }\\n for(int i=0;i<n;i++){\\n if(m.count(Point(ps[i]))==0){\\n\\tnodes.insert(Point(ps[i]));\\n\\tm[Point(ps[i])]=idx++;\\n }\\n // 谷の端点の場合、左右に伸ばす\\n // 右 \\n if((i+1<n&&!EQ(ps[i+1].imag(),ps[i].imag())&&(ps[i+1].imag()>ps[i].imag()))){\\n\\tfor(int j=i+1;j<n-1;j++){\\n\\t P a=ps[j];\\n\\t P b=ps[j+1];\\n\\t // 線分a--bとy=ps[i].imag()が交差するか？\\n\\t // 交差するなら,nodeを追加\\n\\t if(is_intersected_ls(a,b,P(-1000000,ps[i].imag()),P(1000000,ps[i].imag()))){\\n\\t P cp=intersection_ls(a,b,P(-1000000,ps[i].imag()),P(1000000,ps[i].imag()));\\n\\t if(m.count(Point(cp))==0){\\n\\t m[Point(cp)]=idx++;\\n\\t nodes.insert(Point(cp));\\n\\t }\\n\\t break;\\n\\t }\\n\\t // 平行かつy座標が同じ線分にぶつかった場合\\n\\t else if(EQ(ps[i].imag(),ps[j].imag())&&EQ(ps[j].imag(),ps[j+1].imag()))break;\\n\\t}\\n }\\n // 左\\n if(i-1>=0&&!EQ(ps[i-1].imag(),ps[i].imag())&&(ps[i-1].imag()>ps[i].imag())){\\n\\tfor(int j=i-1;j>0;j--){\\n\\t P a=ps[j];\\n\\t P b=ps[j-1];\\n\\t // 線分a--bとy=ps[i].imag()が交差するか？\\n\\t // 交差するなら,nodeを追加\\n\\t if(is_intersected_ls(a,b,P(-1000000,ps[i].imag()),P(1000000,ps[i].imag()))){\\n\\t P cp=intersection_ls(a,b,P(-1000000,ps[i].imag()),P(1000000,ps[i].imag()));\\n\\t if(m.count(Point(cp))==0){\\n\\t nodes.insert(Point(cp));\\n\\t m[Point(cp)]=idx++;\\n\\t }\\n\\t break;\\n\\t }\\n\\t else if(EQ(ps[i].imag(),ps[j].imag())&&EQ(ps[j].imag(),ps[j-1].imag()))break;\\n\\t}\\n }\\n }\\n // 交点の位置でソートしておき\\n // 一つ隣の交点は通行可能\\n // その他同じy座標を持つところにも通行可能\\n for(set<Point>::iterator it=nodes.begin();it!=nodes.end();it++){\\n //cout<<it->p<<endl;\\n // 歩いていけるところにエッジを結ぶ\\n set<Point>::iterator nxt=it;nxt++;\\n if(nxt!=nodes.end()){\\n\\tedge e;\\n\\t// 隣接地点へ歩いて渡る\\n\\te.dist=abs((it->p)-(nxt->p))/vw;\\n\\te.to=*it;G[m[*nxt]].push_back(e);\\n\\te.to=*nxt;G[m[*it]].push_back(e);\\n }\\n // 同じy座標のノードを追加\\n // x座標で隣接するものを使用\\n int ang=-1;\\n for(set<Point>::iterator iit=it;iit!=nodes.end();iit++){\\n\\t// 最初は一つ進めておく\\n\\tif(iit==it)iit++;\\n\\tif(iit==nodes.end())break;\\n\\tif(EQ(iit->p.imag(),it->p.imag())){\\n\\t set<Point>::iterator itnxt=it;itnxt++;\\n\\t // 隣は歩いていけるのでx\\n\\t if(itnxt!=iit){\\n\\t if(ang==0)continue;\\n\\t edge e;\\n\\t e.dist=abs((iit->p)-(it->p))/vc;\\n\\t e.to=*iit;\\n\\t G[m[*it]].push_back(e);\\n\\t }\\n\\t break;\\n\\t}\\n\\tif(ang==-1){\\n\\t if(iit->p.imag()>it->p.imag())ang=1;//zouka\\n\\t else ang=0;//heru\\n\\t}\\n }\\n // ang=-1;\\n // for(set<Point>::iterator iit=it;;iit--){\\n // \\tif(iit==nodes.begin())break;\\n // \\t// 最初は一つ進めておく\\n // \\tif(iit==it)iit--;\\n // \\t// y座標が一致\\n // \\tif(EQ(iit->p.imag(),it->p.imag())){\\n // \\t set<Point>::iterator itnxt=it;itnxt--;\\n // \\t // 隣は歩いていけるのでx\\n // \\t if(itnxt!=iit){\\n // \\t if(ang==0)continue;\\n // \\t edge e;\\n // \\t e.dist=abs((iit->p)-(it->p))/vc;\\n // \\t e.to=*iit;\\n // \\t G[m[*it]].push_back(e);\\n // \\t }\\n // \\t break;\\n // \\t}\\n // \\tif(ang==-1){\\n // \\t if(iit->p.imag()>it->p.imag())ang=0;//zouka\\n // \\t else ang=1;//heru\\n // \\t}\\n // \\tif(iit==nodes.begin())break;\\n // }\\n }\\n double res=dijkstra();\\n printf(\\\"%.10f\\\\n\\\",res);\\n for(int i=0;i<idx;i++)G[i].clear();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.2787,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2050_361775\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n\\nusing namespace std;\\n\\nint main(){\\n\\tint n;\\n\\tint x[1000], y[1000];\\n\\tdouble xd[3000], yd[3000], dist[3000];\\n\\tint next[3000];\\n\\twhile(cin >> n, n){\\n\\t\\tint vw, vc; cin >> vw >> vc;\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tcin >> x[i] >> y[i];\\n\\t\\t\\txd[i] = x[i];\\n\\t\\t\\tyd[i] = y[i];\\n\\t\\t\\tnext[i] = -1;\\n\\t\\t}\\n\\t\\tint size = n;\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tif(i+1 < n && y[i] < y[i+1]){\\n\\t\\t\\t\\tfor(int j=i+1;j+1<n;j++){\\n\\t\\t\\t\\t\\tif(y[j+1] == y[i]){\\n\\t\\t\\t\\t\\t\\tnext[i] = j+1;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(min(y[j], y[j+1]) <= y[i] && y[i] <= max(y[j], y[j+1])){\\n\\t\\t\\t\\t\\t\\txd[size] = (y[i]-yd[j])*(xd[j+1]-xd[j])/(yd[j+1]-yd[j]) + xd[j];\\n\\t\\t\\t\\t\\t\\tyd[size] = y[i];\\n\\t\\t\\t\\t\\t\\tnext[i] = size;\\n\\t\\t\\t\\t\\t\\tnext[size] = -1;\\n\\t\\t\\t\\t\\t\\tsize++;\\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(i-1 >= 0 && y[i] < y[i-1]){\\n\\t\\t\\t\\tfor(int j=i-1;j-1>=0;j--){\\n\\t\\t\\t\\t\\tif(y[j-1] == y[i]){\\n\\t\\t\\t\\t\\t\\tnext[j-1] = i;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(min(y[j], y[j-1]) <= y[i] && y[i] <= max(y[j], y[j-1])){\\n\\t\\t\\t\\t\\t\\txd[size] = (y[i]-yd[j])*(xd[j-1]-xd[j])/(yd[j-1]-yd[j]) + xd[j];\\n\\t\\t\\t\\t\\t\\tyd[size] = y[i];\\n\\t\\t\\t\\t\\t\\tnext[size] = i;\\n\\t\\t\\t\\t\\t\\tsize++;\\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\\tvector< pair<double, int> > vp;\\n\\t\\tfor(int i=0;i<size;i++){\\n\\t\\t\\tdist[i] = 1e12;\\n\\t\\t\\tvp.push_back(make_pair(xd[i], i));\\n\\t\\t}\\n\\t\\tsort(vp.begin(), vp.end());\\n\\t\\tdist[0] = 0;\\n\\t\\tfor(int i=0;i+1<vp.size();i++){\\n\\t\\t\\tint pos = vp[i].second;\\n\\t\\t\\tint npos = vp[i+1].second;\\n\\t\\t\\tdist[npos] = min(dist[npos], dist[pos] + hypot(xd[pos]-xd[npos], yd[pos]-yd[npos])/vw);\\n\\t\\t\\tif(next[pos] != -1)\\n\\t\\t\\t\\tdist[next[pos]] = min(dist[next[pos]], dist[pos] + (xd[next[pos]] - xd[pos])/vc);\\n\\t\\t}\\n\\t\\tprintf(\\\"%.8lf\\\\n\\\", dist[n-1]);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2050_350125\",\n \"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;\\ntypedef complex<double> P;\\nnamespace std {\\n bool operator < (const P& a, const P& b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n }\\n}\\ndouble cross(const P& a, const P& b) {\\n return imag(conj(a)*b);\\n}\\ndouble dot(const P& a, const P& b) {\\n return real(conj(a)*b);\\n}\\nstruct L : public vector<P> {\\n L(const P &a, const P &b) {\\n push_back(a); push_back(b);\\n }\\n};\\nint ccw(P a, P b, P c) {\\n b -= a; c -= a;\\n if (cross(b, c) > 0) return +1; // counter clockwise\\n if (cross(b, c) < 0) return -1; // clockwise\\n if (dot(b, c) < 0) return +2; // c--a--b on line\\n if (norm(b) < norm(c)) return -2; // a--b--c on line\\n return 0;\\n}\\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}\\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]; // same line\\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n return m[0] + B / A * (m[1] - m[0]);\\n}\\ndouble dp[1001];\\nP p[1001];\\nint main() {\\n int n;\\n while(cin >> n, n) {\\n int vw, vc;\\n cin >> vw >> vc;\\n REP(i, n) {\\n int x, y;\\n cin >> x >> y;\\n p[i] = P(x,y);\\n }\\n REP(i, n) dp[i] = INF;\\n dp[0] = 0;\\n REP(i, n-1) {\\n //cout << dp[i] << \\\" \\\";\\n dp[i+1] = min(dp[i+1], dp[i] + abs(p[i] - p[i+1]) / vw);\\n if (p[i+1].imag() > p[i].imag()) {\\n int mi = p[i+1].imag();\\n for (int j=i+2; j<n; ++j) {\\n if (mi > p[j].imag()) {\\n mi = p[j].imag();\\n if (mi < p[i].imag()) {\\n P q = crosspoint(L(p[i], p[i]+P(1,0)), L(p[j-1], p[j]));\\n dp[j] = min(dp[j], dp[i] + (q.real()-p[i].real()) / vc + abs(p[j]-q) / vw);\\n break;\\n } else {\\n P q = crosspoint(L(p[i], p[i+1]), L(p[j], p[j]+P(1,0)));\\n dp[j] = min(dp[j], dp[i] + abs(p[i]-q) / vw + (p[j].real()-q.real()) / vc);\\n }\\n }\\n }\\n }\\n }\\n printf(\\\"%.8f\\\\n\\\", dp[n-1]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2050_294796\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <complex>\\n#include <utility>\\n#include <cstdio>\\n#include <cassert>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\ntypedef complex<double> Vector;\\ntypedef pair<Vector,Vector> Line;\\n\\nconst double EPS = 1e-7;\\n\\nnamespace std {\\n bool operator < (const Vector &a, const Vector &b) {\\n return a.real() < b.real();\\n }\\n};\\n\\ninline bool eqv(double a, double b) {\\n return fabs(a-b) < EPS;\\n}\\n\\nstruct Comp {\\n vector<Vector> vs;\\n Comp(const vector<Vector> &vs) : vs(vs) {}\\n\\n bool operator ()(const int a, const int b) const {\\n if(eqv(vs[a].real(), vs[b].real())) return a < b;\\n return vs[a] < vs[b];\\n }\\n};\\n\\n\\n//Verified PKU 2812\\ndouble cross(const Vector &v1, const Vector &v2) {\\n return (v1.real()*v2.imag()) - (v1.imag()*v2.real());\\n}\\n\\nbool intersect(const Vector &p11, const Vector &p12, const Vector &p21, const Vector &p22) {\\n return (cross(p12-p11, p21-p11)*cross(p12-p11, p22-p11) < 0 &&\\n cross(p22-p21, p11-p21)*cross(p22-p21, p12-p21) < 0 );\\n}\\n\\n//Verified AOJ 0012\\n//Verified PKU 3348\\ndouble ccw(const Vector &p1, const Vector &p2, const Vector &p3) {\\n return cross(p2-p1, p3-p1);\\n}\\n\\n//Verified AOJ 1267(maybe too weak)\\nVector crosspoint(const Line &l1, const Line &l2) {\\n double a = cross(l1.second-l1.first, l2.second-l2.first);\\n double b = cross(l1.second-l1.first, l1.second-l2.first);\\n if(fabs(a) < EPS && fabs(b) < EPS) return l2.first;\\n assert(fabs(a) >= EPS);\\n return l2.first + b / a * (l2.second-l2.first);\\n}\\n\\nint main() {\\n while(true) {\\n int N;\\n cin >> N;\\n if(!N) break;\\n\\n int VW, VC;\\n cin >> VW >> VC;\\n\\n vector<Vector> vs(N);\\n vector<vector<double> > cost(N*3, vector<double>(N*3, 1e12));\\n for(int i = 0; i < N; ++i) {\\n cin >> vs[i].real() >> vs[i].imag();\\n }\\n\\n for(int i = N-1; i >= 0; --i) {\\n //Search Right\\n double y = vs[i].imag();\\n if(i+1 < N && vs[i+1].imag() > y) {\\n for(int j = i+1; j < N; ++j) {\\n if(vs[j].imag() < y || eqv(vs[j].imag(), y)) {\\n //intersect with line (vs[j], vs[j-1])\\n //cout << \\\"intersect \\\" << vs[i] << ' ' << vs[j] << endl;\\n Vector pt = crosspoint(Line(vs[j], vs[j-1]+(vs[j-1]-vs[j])), Line(vs[i], Vector(vs[j].real()+10, y)));\\n vs.push_back(pt);\\n int idx = (int)vs.size()-1;\\n cost[idx][i] = (pt.real() - vs[i].real()) / VC;\\n break;\\n }\\n }\\n }\\n\\n //Search Left\\n if(i-1 >= 0 && vs[i-1].imag() > y) {\\n for(int j = i-1; j >= 0; --j) {\\n if(vs[j].imag() < y || eqv(vs[j].imag(), y)) {\\n //intersect with line (vs[j+1], vs[j])\\n Vector pt = crosspoint(Line(vs[j+1], vs[j]+(vs[j]-vs[j+1])), Line(vs[i], Vector(vs[j].real()-10, y)));\\n vs.push_back(pt);\\n int idx = (int)vs.size()-1;\\n cost[i][idx] = (vs[i].real() - pt.real()) / VC;\\n break;\\n }\\n }\\n }\\n }\\n\\n vector<int> order(vs.size());\\n for(int i = 0; i < order.size(); ++i) order[i] = i;\\n sort(order.begin(), order.end(), Comp(vs));\\n\\n vector<double> best(vs.size(), 1e12);\\n best[order[vs.size()-1]] = 0;\\n for(int i = (int)vs.size()-1; i >= 1; --i) {\\n int cur = order[i];\\n int next = order[i-1];\\n cost[cur][next] = abs(vs[next]-vs[cur]) / VW;\\n\\n for(int j = 0; j < i; ++j) {\\n int nx = order[j];\\n assert(cost[cur][nx] >= 0);\\n best[nx] = min(best[nx], best[cur] + cost[cur][nx]);\\n }\\n //cout << best[cur] << endl;\\n }\\n\\n printf(\\\"%.7f\\\\n\\\", best[order[0]]);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 620,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -1,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2050_292136\",\n \"code_snippet\": \"#include <cstdio>\\n#include <vector>\\n#include <queue>\\n#include <complex>\\nusing namespace std;\\ntypedef complex<double> P;\\nstatic const double EPS = 1e-6;\\ninline double cross(const P& a, const P& b) { return a.real()*b.imag() - b.real()*a.imag(); }\\n\\nstruct line/*{{{*/\\n{\\n P a, b;\\n line() {}\\n line(const P& p, const P& q) : a(p), b(q) {}\\n};/*}}}*/\\n\\nstruct segment/*{{{*/\\n{\\n P a, b;\\n segment() {}\\n segment(const P& x, const P& y) : a(x), b(y) {}\\n\\n inline bool intersects(const line& ln) const\\n {\\n return cross(ln.b - ln.a, a - ln.a) * cross(ln.b - ln.a, b - ln.a) < EPS;\\n }\\n\\n inline P intersection(const line& ln) const\\n {\\n const P x = b - a;\\n const P y = ln.b - ln.a;\\n return a + x*(cross(y, ln.a - a))/cross(y, x);\\n }\\n};/*}}}*/\\n\\nint main()\\n{\\n int N;\\n while (scanf(\\\"%d\\\", &N) != EOF && N != 0) {\\n int vw, vc;\\n scanf(\\\"%d %d\\\", &vw, &vc);\\n vector<P> ps;\\n for (int i = 0; i < N; i++) {\\n int x, y;\\n scanf(\\\"%d %d\\\", &x, &y);\\n ps.push_back(P(x, y));\\n }\\n\\n vector<vector<pair<int,double> > > g(3*N);\\n for (int i = 0; i < N-1; i++) {\\n g[3*i].push_back(make_pair(3*(i+1), abs(ps[i+1] - ps[i])/vw));\\n }\\n for (int i = 0; i < N; i++) {\\n if (i > 0 && ps[i-1].imag() > ps[i].imag()) {\\n // left edge\\n const line ln(ps[i], ps[i] + P(1, 0));\\n for (int j = i-2; j >= 0; j--) {\\n const segment s(ps[j], ps[j+1]);\\n if (s.intersects(ln)) {\\n const P p = s.intersection(ln);\\n const int n = 3*i+1;\\n g[3*j].push_back(make_pair(n, abs(p - ps[j])/vw));\\n g[n].push_back(make_pair(3*i, abs(ps[i] - p)/vc));\\n break;\\n }\\n }\\n }\\n if (i < N-1 && ps[i].imag() < ps[i+1].imag()) {\\n // right edge\\n const line ln(ps[i], ps[i] + P(1, 0));\\n for (int j = i+1; j < N-1; j++) {\\n const segment s(ps[j], ps[j+1]);\\n if (s.intersects(ln)) {\\n const P p = s.intersection(ln);\\n const int n = 3*i+2;\\n g[3*i].push_back(make_pair(n, abs(p - ps[i])/vc));\\n g[n].push_back(make_pair(3*(j+1), abs(ps[j+1] - p)/vw));\\n break;\\n }\\n }\\n }\\n }\\n\\n static const double INF = 1e10;\\n vector<double> dist(3*N, INF);\\n dist[0] = 0;\\n priority_queue<pair<double,int> > q;\\n q.push(make_pair(0, 0));\\n while (!q.empty()) {\\n const double c = -q.top().first;\\n const int n = q.top().second;\\n q.pop();\\n if (n == 3*(N-1)) {\\n printf(\\\"%.6f\\\\n\\\", c);\\n break;\\n }\\n if (c > dist[n]) {\\n continue;\\n }\\n for (vector<pair<int,double> >::const_iterator it = g[n].begin(); it != g[n].end(); ++it) {\\n const int m = it->first;\\n const double cc = c + it->second;\\n if (cc < dist[m]) {\\n dist[m] = cc;\\n q.push(make_pair(-cc, m));\\n }\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2050_132887\",\n \"code_snippet\": \"#include <iostream>\\n#include <complex>\\n#include <vector>\\n#include <iomanip>\\n#include <queue>\\nusing namespace std;\\n\\ntypedef complex<double> P;\\n#define EPS 1e-5\\n#define INF 1e7\\n\\ntypedef pair<int, double> Node;\\n\\nclass State\\n{\\npublic:\\n\\tint n;\\n\\tdouble c;\\n\\tState(int n, double c)\\n\\t\\t:n(n),c(c)\\n\\t{}\\n\\n\\tbool operator<(const State& s) const\\n\\t{\\n\\t\\treturn c>s.c;\\n\\t}\\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\\n//OÏ\\ndouble cross(const P& a, const P& b) {\\n return imag(conj(a)*b);\\n}\\n\\ndouble dist(const P& a, const P& b)\\n{\\n\\treturn abs(a-b);\\n}\\n\\nbool intersect(L& a, L& b)\\n{\\n\\tdouble t=max(a[0].imag(), a[1].imag());\\n\\tdouble l=min(a[0].imag(), a[1].imag());\\n\\n\\treturn (t+EPS>b[0].imag()&&b[0].imag()>l-EPS);\\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]; // same line\\n return m[0] + B / A * (m[1] - m[0]);\\n}\\n\\nint main()\\n{\\n\\tcout << setprecision(10) << setiosflags(ios::fixed);\\n\\tdouble vw,vc;\\n\\tint N;\\n\\t\\n\\twhile(cin >> N, N)\\n\\t{\\n\\t\\tvector<P> in;\\n\\n\\t\\tcin >> vw >> vc;\\n\\t\\tfor(int i=0; i<N; i++)\\n\\t\\t{\\n\\t\\t\\tdouble x,y;\\n\\t\\t\\tcin >> x >> y;\\n\\t\\t\\tin.push_back(P(x,y));\\n\\t\\t}\\n\\n\\t\\tvector<Node> node[4000];\\n\\t\\tfor(int i=0; i<N-1; i++)\\n\\t\\t{\\n\\t\\t\\tnode[i].push_back(make_pair(i+1, dist(in[i], in[i+1])/vw));\\n\\t\\t}\\n\\n\\t\\tfor(int i=0; i<N; i++)\\n\\t\\t{\\n\\t\\t\\tL hz(P(-INF,in[i].imag()),P(INF,in[i].imag()));\\n\\t\\t\\tfor(int j=i-2; j>=0; j--)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(in[i].imag()+EPS > in[j+1].imag()) break;\\n\\t\\t\\t\\tL tmp(in[j], in[j+1]);\\n\\t\\t\\t\\tif(intersect(tmp,hz))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tP xp=crosspoint(hz,tmp);\\n\\t\\t\\t\\t\\tin.push_back(xp);\\n\\t\\t\\t\\t\\tint p=in.size();\\n\\t\\t\\t\\t\\tnode[j].push_back(make_pair(p, dist(in[j], xp)/vw));\\n\\t\\t\\t\\t\\tnode[p].push_back(make_pair(j+1, dist(in[j+1], xp)/vw));\\n\\t\\t\\t\\t\\tnode[p].push_back(make_pair(i, dist(in[i], xp)/vc));\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j=i+1; j<N-1; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(in[i].imag()+EPS > in[j].imag()) break;\\n\\n\\t\\t\\t\\tL tmp(in[j], in[j+1]);\\n\\t\\t\\t\\tif(intersect(tmp,hz))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tP xp=crosspoint(hz,tmp);\\n\\t\\t\\t\\t\\tin.push_back(xp);\\n\\t\\t\\t\\t\\tint p=in.size();\\n\\t\\t\\t\\t\\tnode[j].push_back(make_pair(p, dist(in[j], xp)/vw));\\n\\t\\t\\t\\t\\tnode[p].push_back(make_pair(j+1, dist(in[j+1], xp)/vw));\\n\\t\\t\\t\\t\\tnode[i].push_back(make_pair(p, dist(in[i], xp)/vc));\\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\\n\\t\\tpriority_queue<State> q;\\n\\t\\tq.push(State(0,0));\\n\\t\\tbool v[4000]={0};\\n\\n\\t\\twhile(!q.empty())\\n\\t\\t{\\n\\t\\t\\tState s=q.top(); q.pop();\\n\\t\\t\\tif(v[s.n]) continue;\\n\\t\\t\\tv[s.n]=1;\\n\\n\\t\\t\\tif(s.n==N-1)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcout << s.c << endl;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int i=0; i<node[s.n].size(); i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tNode next=node[s.n][i];\\n\\t\\t\\t\\tif(v[next.first]) continue;\\n\\n\\t\\t\\t\\tq.push(State(next.first, s.c+next.second));\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 1188,\n \"score_of_the_acc\": -0.2439,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2050_71788\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<complex>\\n#include<queue>\\n#include<functional>\\n#include<algorithm>\\n#include<set>\\n\\nusing namespace std;\\n\\ntypedef double elem;\\ntypedef complex<elem> point, vec;\\ntypedef pair<point,point> line;\\n\\n#define N 1001\\n\\nconst elem eps = 1.0e-7;\\nconst elem infty = 300000000.0;\\n\\nelem W[N][N];\\nelem A[N];\\nbool G[N][N];\\n\\nstruct State{\\n int now;\\n elem cost;\\n bool operator>(const State&t)const{\\n return cost > t.cost;\\n }\\n};\\n\\nelem cross(point a, point b){\\n return a.real() * b.imag() - a.imag() * b.real();\\n}\\n\\nelem dist(point a, point b){\\n return abs(b-a);\\n}\\nelem dist(point a1, point a2, point x){\\n return abs( cross(a2-a1,x-a1)) / abs(a2-a1);\\n}\\n\\ninline bool intersected_seg(point a1, point a2, point b1, point b2){\\n return (cross(a2-a1,b1-a1)*cross(a2-a1,b2-a1) < eps &&\\n\\t cross(b2-b1,a1-b1)*cross(b2-b1,a2-b1) < eps );\\n}\\n\\ninline point intersection_seg(point a1, point a2, point b1, point b2){\\n elem d1=dist(b1,b2,a1);\\n elem d2=dist(b1,b2,a2);\\n elem t=d1/(d1+d2);\\n return a1+t*(a2-a1);\\n}\\n\\nvoid ResetGraph(){\\n for(int i = 0; i < N; ++i){\\n A[i] = infty;\\n for(int j = 0; j < N; ++j){\\n W[i][j] = infty;\\n G[i][j] = false;\\n }\\n }\\n}\\n\\nelem dijkstra(int goal){\\n priority_queue< State, vector<State>, greater<State> > pq;\\n bool visited[N]={false,};\\n State st;\\n\\n st.now = 0;\\n visited[0] = true;\\n st.cost = 0;\\n A[0] = 0;\\n pq.push( st );\\n\\n while( !pq.empty() ){\\n st = pq.top();\\n //cout << \\\" QUEUE SIZE \\\" << pq.size() << endl;\\n pq.pop();\\n\\n //cout << \\\"NOW: \\\" << st.now << \\\" COST : \\\" << st.cost << endl;\\n\\n //visited[st.now] = false;\\n if( st.now == goal ){\\n return A[goal];\\n }\\n visited[st.now] = true;\\n\\n for(int i = 0; i < N; ++i){\\n if( G[st.now][i] ){\\n\\tif( !visited[i] && A[st.now] + W[st.now][i] < A[i] ){\\n\\t State next;\\n\\t next.now = i;\\n\\t A[i] = A[st.now] + W[st.now][i];\\n\\t //cout << \\\"Goto : \\\" << i << endl;\\n\\t //cout << \\\"Right : \\\" << A[st.now] << \\\" + \\\" << W[st.now][i] << endl;\\n\\t next.cost = A[i];\\n\\t pq.push( next );\\n\\t}\\n }\\n }\\n }\\n return 0;\\n}\\n\\nint main(){\\n while(true){\\n int n;\\n double vw,vc;\\n vector<point> vp;\\n vector<line> lines;\\n\\n ResetGraph();\\n cin >> n;\\n if(n==0)break;\\n cin >> vw >> vc;\\n for(int i = 0; i < n; ++i){\\n elem x,y;\\n cin>>x>>y;\\n point tp(x,y);\\n if(i>0){\\n\\tline l = make_pair( vp.back(),tp );\\n\\tlines.push_back(l);\\n }\\n vp.push_back(tp);\\n }\\n\\n for(int i = 0; i < lines.size(); ++i){\\n //cout << lines[i].first << ' ' << lines[i].second << endl;\\n G[i][i+1] = true;\\n W[i][i+1] = dist(lines[i].first, lines[i].second) / vw;\\n if( lines[i].second.imag() > lines[i].first.imag() ){\\n\\tline l = make_pair( lines[i].first, point(infty, lines[i].first.imag()) );\\n\\tfor(int j = i+1; j < lines.size(); ++j){\\n\\t //\\t cout << l.first << ' ' << l.second << \\\" : \\\" << lines[j].first << ' ' << lines[j].second << endl;\\n\\t if( intersected_seg(l.first,\\n\\t\\t\\t l.second,\\n\\t\\t\\t lines[j].first,\\n\\t\\t\\t lines[j].second) ){\\n\\t point intersect = intersection_seg(\\n\\t\\t\\t\\t\\t l.first,\\n\\t\\t\\t\\t\\t l.second,\\n\\t\\t\\t\\t\\t lines[j].first,\\n\\t\\t\\t\\t\\t lines[j].second );\\n\\t //elem d = dist( intersect, lines[j].second );\\n\\t G[i][j+1] = true;\\n\\t W[i][j+1] = dist( lines[i].first, intersect ) / vc + dist( intersect, lines[j].second ) / vw;\\n\\t break;\\n\\t }\\n\\t}\\n }\\n if( lines[i].second.imag() < lines[i].first.imag() ){\\n\\tline l = make_pair( lines[i].second, point(-infty, lines[i].second.imag()) );\\n\\tfor(int j = i-1; j >= 0; --j){\\n\\t // cout << l.first << ' ' << l.second << \\\" : \\\" << lines[j].first << ' ' << lines[j].second << endl;\\n\\t if( intersected_seg(l.first,\\n\\t\\t\\t l.second,\\n\\t\\t\\t lines[j].first,\\n\\t\\t\\t lines[j].second) ){\\n\\t point intersect = intersection_seg(\\n\\t\\t\\t\\t\\t l.first,\\n\\t\\t\\t\\t\\t l.second,\\n\\t\\t\\t\\t\\t lines[j].first,\\n\\t\\t\\t\\t\\t lines[j].second );\\n\\t //elem d = dist( intersect, lines[j].second );\\n\\t G[j][i+1] = true;\\n\\t W[j][i+1] = dist( lines[i].second, intersect ) / vc + dist( intersect, lines[j].first ) / vw;\\n\\t break;\\n\\t }\\n\\t}\\n }\\n }\\n /*\\n for(int i = 0; i < N; ++i){\\n for(int j = 0; j < N; ++j){\\n\\tif( G[i][j] ){\\n\\t cout << \\\"i:\\\" << i << \\\" j:\\\" << j << ' ' << vp[i] << \\\"->\\\" << vp[j] << \\\" COST: \\\" << W[i][j] << endl;\\n\\t}\\n }\\n }\\n */\\n\\n printf(\\\"%.6lf\\\\n\\\", dijkstra(n-1));\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 9888,\n \"score_of_the_acc\": -1.152,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2050_71609\",\n \"code_snippet\": \"#include<map>\\n#include<cmath>\\n#include<vector>\\n#include<iostream>\\n#include<queue>\\n#include<algorithm>\\n#include<complex>\\nusing namespace std;\\n#define REP(i,b,n) for(int i=b;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define ALL(C) (C).begin(),(C).end()\\n#define pb push_back\\n\\n\\nconst int N = 1000;\\n\\nclass Edge{\\npublic:\\n int to;\\n double cost;\\n};\\n\\nvector<Edge> edge[N];\\n\\ndouble dist(double x,double y){\\n return sqrt(x*x+y*y);\\n}\\n\\ndouble getx(double xa,double xb,double ya,double yb,double y){\\n double A = (ya-yb)/(xa-xb);\\n return (y-ya+A*xa)/A;\\n}\\n\\nvoid makeedge(int n,double *x,double *y,double vd,double vwalk){\\n rep(i,n-1){\\n edge[i].pb((Edge){i+1,dist(x[i]-x[i+1],y[i]-y[i+1])/vwalk});\\n }\\n \\n rep(i,n){\\n REP(j,i+1,n-1){\\n if (i+1 == j && y[j] <= y[i])break;\\n if (y[j+1] <= y[i] && y[i] < y[j]){\\n\\tdouble tx = getx(x[j],x[j+1],y[j],y[j+1],y[i]);\\n\\tedge[i].push_back((Edge){j+1,(tx-x[i])/vd+dist(tx-x[j+1],y[i]-y[j+1])/vwalk});\\n\\tbreak;\\n }\\n }\\n \\n for(int j=i-1;j>=1;j--){\\n if (i-1 == j && y[j] <= y[i])break;\\n if (y[j-1] <= y[i] && y[i] < y[j]){\\n\\tdouble tx = getx(x[j],x[j-1],y[j],y[j-1],y[i]);\\n\\tedge[j-1].push_back(\\n\\t\\t\\t (Edge){i,(x[i]-tx)/vd+dist(tx-x[j-1],y[i]-y[j-1])/vwalk});\\n\\tbreak;\\n }\\n }\\n }\\n}\\n\\n\\ndouble cost[N];\\ndouble solve(int n,double *x,double *y,double vw,double vd){\\n rep(i,n)edge[i].clear();\\n makeedge(n,x,y,vd,vw);\\n rep(i,n)cost[i] = 1e100;\\n\\n cost[0] = 0;\\n rep(i,n){\\n rep(j,edge[i].size()){\\n int next = edge[i][j].to;\\n cost[next]=min(cost[next],cost[i]+edge[i][j].cost);\\n }\\n }\\n\\n /*\\n rep(i,n){\\n cout << \\\"now \\\" << x[i] << \\\" \\\" << y[i]<<endl;\\n puts(\\\"edge begin\\\");\\n rep(j,edge[i].size()){\\n int nex = edge[i][j].to;\\n cout << x[nex] << \\\" \\\"<< y[nex] << \\\" \\\"<< edge[i][j].cost << endl;\\n }\\n puts(\\\"Edge end\\\");\\n }\\n */\\n\\n return cost[n-1];\\n}\\n\\n\\nmain(){\\n int n;\\n while(cin>>n && n){\\n double vwalk,vd;\\n cin>>vwalk>>vd;\\n double x[n],y[n];\\n rep(i,n)cin>>x[i]>>y[i];\\n printf(\\\"%6lf\\\\n\\\",solve(n,x,y,vwalk,vd));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1080,"cells":{"group_id":{"kind":"string","value":"aoj_2049_cpp"},"problem_description":{"kind":"string","value":"Problem B:\nHeadstrong Student\nYou are a teacher at a cram school for elementary school pupils.\nOne day, you showed your students how to calculate division of fraction in a class of mathematics.\nYour lesson was kind and fluent, and it seemed everything was going so well - except for one\nthing. After some experiences, a student Max got so curious about how precise he could compute\nthe quotient. He tried many divisions asking you for a help, and finally found a case where\nthe answer became an infinite fraction. He was fascinated with such a case, so he continued\ncomputing the answer. But it was clear for you the answer was an infinite fraction - no matter\nhow many digits he computed, he wouldn’t reach the end.\nSince you have many other things to tell in today’s class, you can’t leave this as it is. So you\ndecided to use a computer to calculate the answer in turn of him. Actually you succeeded to\npersuade him that he was going into a loop, so it was enough for him to know how long he could\ncompute before entering a loop.\nYour task now is to write a program which computes where the recurring part starts and the\nlength of the recurring part, for given dividend/divisor pairs. All computation should be done\nin decimal numbers. If the specified dividend/divisor pair gives a finite fraction, your program\nshould treat the length of the recurring part as 0.\nInput\nThe input consists of multiple datasets. Each line of the input describes a dataset. A dataset\nconsists of two positive integers\nx\nand\ny\n, which specifies the dividend and the divisor, respectively.\nYou may assume that 1 ≤\nx\n<\ny\n≤ 1,000,000.\nThe last dataset is followed by a line containing two zeros. This line is not a part of datasets\nand should not be processed.\nOutput\nFor each dataset, your program should output a line containing two integers separated by exactly\none blank character.\nThe former describes the number of digits after the decimal point before the recurring part\nstarts. And the latter describes the length of the recurring part.\nSample Input\n1 3\n1 6\n3 5\n2 200\n25 99\n0 0\nOutput for the Sample Input\n0 1\n1 1\n1 0\n2 0\n0 2"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2049_10748216","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint m[1000005];\n\nint main() {\n ios_base::sync_with_stdio(false); cin.tie(NULL);\n while (true) {\n int x, y; cin >> x >> y;\n if (!x) break;\n for (int i = 0;i < y;i++) m[i] = 0;\n int r = x % y;\n int cnt = 0;\n while (true) {\n if (m[r] || !r) break;\n m[r] = ++cnt;\n r = (r * 10) % y;\n }\n if (!r) {\n cout << cnt << \" 0\\n\";\n } else {\n cout << m[r] - 1 << \" \" << cnt - m[r] + 1 << \"\\n\";\n }\n }\n}","accuracy":1,"time_ms":240,"memory_kb":7284,"score_of_the_acc":-0.0181,"final_rank":9},{"submission_id":"aoj_2049_10747743","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint m[1000005];\n\nint main() {\n ios_base::sync_with_stdio(false); cin.tie(NULL);\n while (true) {\n int x, y; cin >> x >> y;\n if (!x) break;\n for (int i = 0;i < y;i++) m[i] = 0;\n int r = x;\n int cnt = 0;\n while (true) {\n if (m[r] || !r) break;\n m[r] = ++cnt;\n r = (r * 10) % y;\n }\n if (!r) {\n cout << cnt << \" 0\\n\";\n } else {\n cout << m[r] - 1 << \" \" << cnt - m[r] + 1 << \"\\n\";\n }\n }\n}","accuracy":1,"time_ms":240,"memory_kb":7200,"score_of_the_acc":-0.0157,"final_rank":7},{"submission_id":"aoj_2049_4109889","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\nusing namespace std;\ntypedef long long int ll;\n \nint main(){\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\twhile(1){\n\t\tint a,b; cin >> a >> b;\n\t\tif(a==0&&b==0)break;\n\t\tint g=__gcd(a,b);\n\t\ta/=g; b/=g;\n\t\tvector<int> seen(b,-1);\n\t\tseen[a]=0;\n\t\tfor(int c=1;;c++){\n\t\t\ta=(10*a)%b;\n\t\t\tif(a==0){\n\t\t\t\tcout << c << \" \" << 0 << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if(seen[a]!=-1){\n\t\t\t\tcout << seen[a] << \" \" << c-seen[a] << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tseen[a]=c;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":270,"memory_kb":6976,"score_of_the_acc":-0.0163,"final_rank":8},{"submission_id":"aoj_2049_2854533","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\nint adiv(int a) {\n\tmap<int,int>mp;\n\tint num(a);\n\tfor (int i = 2; i <= a; ++i) {\n\t\twhile (num%i == 0) {\n\t\t\tmp[i]++;\n\t\t\tnum/=i;\n\t\t}\n\t}\n\tint anum=0;\n\tfor (auto m : mp) {\n\t\tanum-=m.first;\n\t}\n\tanum+=2*prev(mp.end())->first;\n\treturn anum;\n}\n\nint main() {\n\twhile (true) {\n\n\t\tint x,y;cin>>x>>y;\n\t\tif(!x)break;\n\t\tmap<int,int>mp;\n\t\tvector<int>v(1e6+1,-1);\n\t\tint ans1=0,ans2=0;\n\t\twhile (true) {\n\t\t\tx*=10;\n\t\t\tint a=x/y;\n\t\t\tint b=x%y;\n\n\t\t\tif (b == 0) {\n\t\t\t\tans1++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (v[x/10]==-1) {\n\t\t\t\t\tv[x/10]=ans1;\n\t\t\t\t\tans1++;\n\t\t\t\t\tx = b;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tans2=ans1-v[x/10];\n\t\t\t\t\tans1=v[x/10];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<ans1<<\" \"<<ans2<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":360,"memory_kb":6992,"score_of_the_acc":-0.0371,"final_rank":11},{"submission_id":"aoj_2049_2341524","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int a,b;\n while(cin>>a>>b,a){\n int s[1000000]={},c=0,g=__gcd(a,b);\n a/=g,b/=g;\n while(!s[a]){\n s[a]=(++c);\n a=(a*10)%b;\n if(a<0)return 0;\n }\n if(a)c++;\n cout<<s[a]-1<<' '<<c-s[a]<<endl;\n }\n}","accuracy":1,"time_ms":250,"memory_kb":6948,"score_of_the_acc":-0.011,"final_rank":4},{"submission_id":"aoj_2049_2341523","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int a,b;\n while(cin>>a>>b,a){\n int s[1000000]={};\n int c=0,g=__gcd(a,b);\n a/=g,b/=g;\n while(!s[a]){\n s[a]=(++c);\n a=(a*10)%b;\n if(a<0)return 0;\n }\n if(a)c++;\n cout<<s[a]-1<<' '<<c-s[a]<<endl;\n }\n}","accuracy":1,"time_ms":250,"memory_kb":6940,"score_of_the_acc":-0.0107,"final_rank":3},{"submission_id":"aoj_2049_2340262","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n#define all(v) begin(v), end(v)\n#define reps(i, m, n) for(int i = (int)(m); i < (int)(n); i++)\n#define rep(i, n) reps(i, 0, n)\n\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\n\nconst int inf = 1LL << 55;\nconst int mod = 1e9 + 7;\n\nsigned main()\n{\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n int x, y;\n while(cin >> x >> y, x || y) {\n int used[1000010];\n memset(used, -1, sizeof(used));\n int i;\n used[x] = 0;\n x *= 10;\n for(i = 1; used[x%y] == -1; i++) {\n x %= y;\n used[x] = i;\n if(x == 0) break; \n x *= 10;\n }\n cout << used[x%y] << \" \" << i-used[x%y] << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":500,"memory_kb":10948,"score_of_the_acc":-0.1791,"final_rank":12},{"submission_id":"aoj_2049_2340147","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int x,y;\n while(cin>>x>>y,x){\n int s[1000000]={};\n int c=0,gc=__gcd(x,y);\n x/=gc,y/=gc;\n while(!s[x]){\n s[x]=++c;\n x=(x*10)%y;\n }\n if(x==0)c=s[x]-1;\n cout<<s[x]-1<<\" \"<<c-s[x]+1<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":260,"memory_kb":6944,"score_of_the_acc":-0.0131,"final_rank":6},{"submission_id":"aoj_2049_2340140","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint M[10000000];\n\nint main(){\n while(1){\n int n,d;\n cin>>n>>d;\n if(n==0&&d==0)break;\n \n memset(M,-1,sizeof(M));\n int cnt=0;\n while(n){\n int s = (n/d) * d;\n n -= s;\n if(M[n]!=-1)break;\n M[n] = cnt++;\n n*=10;\n }\n\n\n if(n == 0)cnt = M[n];\n cout<<M[n]<<\" \"<<cnt-M[n]<<endl; \n }\n return 0;\n}","accuracy":1,"time_ms":1740,"memory_kb":42112,"score_of_the_acc":-1.3292,"final_rank":14},{"submission_id":"aoj_2049_2340122","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nint m[1111111];\nsigned main(){\n int x,y;\n while(cin>>x>>y,x||y){\n int c=0;\n memset(m,-1,sizeof(m));\n while(m[x]<0){\n m[x]=c++;\n x=(x*10)%y;\n if(!x) break;\n }\n if(!x) cout<<c<<\" \"<<0<<endl;\n else cout<<m[x]<<\" \"<<c-m[x]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":570,"memory_kb":11716,"score_of_the_acc":-0.2164,"final_rank":13},{"submission_id":"aoj_2049_2143574","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\ntypedef long long int ll;\n\nusing namespace std;\n\nint* table;\n\nvoid func(int X,int Y){\n\n\tint current = X%Y,ans_left,ans_right;\n\n\ttable[current] = 0;\n\n\tfor(int i = 1;i < 1000000; i++){\n\t\tcurrent = (10*current)%Y;\n\n\t\tif(current == 0){ //?????????????????´???\n\t\t\tans_left = i;\n\t\t\tans_right = 0;\n\t\t\tbreak;\n\t\t}else{\n\t\t\tif(table[current] != -1){\n\t\t\t\tans_left = table[current];\n\t\t\t\tans_right = i - table[current];\n\t\t\t\tbreak;\n\t\t\t}else{\n\t\t\t\ttable[current] = i;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d %d\\n\",ans_left,ans_right);\n}\n\n\nint main(){\n\n\tint X,Y;\n\n\ttable = new int[1000010];\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&X,&Y);\n\t\tif(X == 0 && Y == 0)break;\n\n\t\tfor(int i = 0; i < Y; i++)table[i] = -1;\n\n\t\tfunc(X,Y);\n\t}\n\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":6660,"score_of_the_acc":-0.0097,"final_rank":2},{"submission_id":"aoj_2049_2143573","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\ntypedef long long int ll;\n\nusing namespace std;\n\nint* table;\n\nvoid func(int X,int Y){\n\n\tint current = X%Y,ans_left,ans_right;\n\n\ttable[current] = 0;\n\n\tfor(int i = 1;i < 1000000; i++){\n\t\tcurrent = (10*current)%Y;\n\n\t\tif(current == 0){ //?????????????????´???\n\t\t\tans_left = i;\n\t\t\tans_right = 0;\n\t\t\tbreak;\n\t\t}else{\n\t\t\tif(table[current] != -1){\n\t\t\t\tans_left = table[current];\n\t\t\t\tans_right = i - table[current];\n\t\t\t\tbreak;\n\t\t\t}else{\n\t\t\t\ttable[current] = i;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d %d\\n\",ans_left,ans_right);\n}\n\n\nint main(){\n\n\tint X,Y;\n\n\ttable = new int[1000010];\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&X,&Y);\n\t\tif(X == 0 && Y == 0)break;\n\n\t\tfor(int i = 0; i < 1000010; i++)table[i] = -1;\n\n\t\tfunc(X,Y);\n\t}\n\n return 0;\n}","accuracy":1,"time_ms":360,"memory_kb":6636,"score_of_the_acc":-0.0271,"final_rank":10},{"submission_id":"aoj_2049_2110627","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int x,y;\n while(cin >> x >> y && x) {\n x%=y;\n unordered_map<int,int> m;\n int i;\n for(i=0; i<1000000; i++) {\n if(!x) break;\n if(m.count(x)) {\n cout << m[x] << \" \" << i-m[x] << endl;\n goto next;\n }\n m[x]=i;\n x*=10;\n x%=y;\n }\n cout << i << \" \" << 0 << endl;\n next:;\n }\n return 0;\n}","accuracy":1,"time_ms":4410,"memory_kb":42412,"score_of_the_acc":-1.9417,"final_rank":17},{"submission_id":"aoj_2049_2110624","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n while(1){\n unordered_map<int,int> mp;\n int x,y,c=0;\n scanf(\"%d %d\",&x,&y);\n if(x==0&&y==0)break;\n \n while(x!=0&&mp.count(x)==0){\n mp[x]=c++;\n x*=10;\n x%=y;\n }\n if(x==0){\n cout<<c<<' '<<0<<endl;\n }else{\n cout<<mp[x]<<' '<<c-mp[x]<<endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":4540,"memory_kb":42476,"score_of_the_acc":-1.9729,"final_rank":19},{"submission_id":"aoj_2049_2110584","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n\nint x,y;\nint main(){\n while( cin >> x >> y && (x||y) ){\n unordered_map<int,int> mp;\n int cnt = 0;\n while( x ){ \n if( mp.count(x) ) {\n cout << mp[x] << \" \" << cnt - mp[x] << endl;\n break;\n }\n mp[x] = cnt++;\n x *= 10;\n x %= y; \n }\n if( x == 0 ) cout << cnt << \" 0\" << endl;\n }\n}","accuracy":1,"time_ms":4470,"memory_kb":42380,"score_of_the_acc":-1.9543,"final_rank":18},{"submission_id":"aoj_2049_2027335","code_snippet":"//============================================================================\n// Name : B.cpp\n// Author : \n// Version :\n// Copyright : Your copyright notice\n// Description : Hello World in C++, Ansi-style\n//============================================================================\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nint x,y;\n\nint dp[1000010];\npair<int,int> solve(int x, int y){\n\tmemset(dp, -1, sizeof dp);\n\tint c = x;\n\tfor(int i = 0;; ++i){\n\t\t//int q = c/y;\n\t\tint r = c%y;\n\t\tif(r == 0){\n\t\t\treturn make_pair(i, 0);\n\t\t}\n\t\tif(dp[r] != -1){\n\t\t\treturn make_pair(dp[r], i-dp[r]);\n\t\t}\n\t\tdp[r] = i;\n\t\tc = r*10;\n\t}\n}\n\nint main() {\n\twhile(cin >> x >> y && x){\n\t\tauto ans = solve(x,y);\n\t\tcout << ans.first << ' ' << ans.second << '\\n';\n\t}\n}","accuracy":1,"time_ms":250,"memory_kb":6956,"score_of_the_acc":-0.0112,"final_rank":5},{"submission_id":"aoj_2049_2023368","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 main() {\n\n for(int x, y; cin >> x >> y && (x && y);) {\n int mp[1000001]; memset(mp, -1, sizeof mp);\n int cnt = 0;\n while(!~mp[x % y]) {\n if(x % y == 0) {\n cout << cnt << \" 0\" << endl;\n goto exit;\n }\n mp[x % y] = cnt ++;\n x %= y;\n x *= 10;\n }\n cout << mp[x % y] << \" \" << cnt - mp[x % y] << endl;\n exit:;\n }\n \n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":6892,"score_of_the_acc":-0.0094,"final_rank":1},{"submission_id":"aoj_2049_2023366","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 main() {\n\n for(int x, y; cin >> x >> y && (x && y);) {\n unordered_map<int, int> mp;\n int cnt = 0;\n while(mp.find(x % y) == mp.end()) {\n if(x % y == 0) {\n cout << cnt << \" 0\" << endl;\n goto exit;\n }\n mp[x % y] = cnt ++;\n x %= y;\n x *= 10;\n }\n cout << mp[x % y] << \" \" << cnt - mp[x % y] << endl;\n exit:;\n }\n \n return 0;\n}","accuracy":1,"time_ms":4660,"memory_kb":42276,"score_of_the_acc":-1.9944,"final_rank":20},{"submission_id":"aoj_2049_2022987","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint check[10][1000001];\n\nint main()\n{\n int x, y;\n while(cin >> x >> y, x || y) {\n memset(check, -1, sizeof(check));\n int cnt = 0;\n x *= 10;\n bool flag = false;\n while(!~check[x/y][x%y]) {\n check[x/y][x%y] = cnt;\n if(x%y == 0) { flag = true; break; }\n cnt++;\n x %= y; x *= 10;\n }\n cout << check[x/y][x%y]+(int)flag << \" \" << cnt-check[x/y][x%y] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1920,"memory_kb":42136,"score_of_the_acc":-1.3706,"final_rank":16},{"submission_id":"aoj_2049_2022896","code_snippet":"#include<bits/stdc++.h>\n#define N 10000005\nusing namespace std;\nint m[N];\nint a,b,cnt,ans1,ans2;\n\nint main(){\n while(1){\n cin>>a>>b;\n if(!a&&!b)break;\n memset(m,-1,sizeof(m));\n a%=b;\n cnt=0;\n while(1){\n a*=10;\n if(m[a]!=-1){\n\tans1=m[a],ans2=cnt-m[a];\n\tbreak;\n }\n m[a]=cnt;\n a%=b;\n if(!a){\n\tans1=cnt+1,ans2=0;\n\tbreak;\n } \n cnt++;\n }\n cout<<ans1<<' '<<ans2<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1890,"memory_kb":42032,"score_of_the_acc":-1.3609,"final_rank":15}],"string":"[\n {\n \"submission_id\": \"aoj_2049_10748216\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint m[1000005];\\n\\nint main() {\\n ios_base::sync_with_stdio(false); cin.tie(NULL);\\n while (true) {\\n int x, y; cin >> x >> y;\\n if (!x) break;\\n for (int i = 0;i < y;i++) m[i] = 0;\\n int r = x % y;\\n int cnt = 0;\\n while (true) {\\n if (m[r] || !r) break;\\n m[r] = ++cnt;\\n r = (r * 10) % y;\\n }\\n if (!r) {\\n cout << cnt << \\\" 0\\\\n\\\";\\n } else {\\n cout << m[r] - 1 << \\\" \\\" << cnt - m[r] + 1 << \\\"\\\\n\\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 7284,\n \"score_of_the_acc\": -0.0181,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2049_10747743\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint m[1000005];\\n\\nint main() {\\n ios_base::sync_with_stdio(false); cin.tie(NULL);\\n while (true) {\\n int x, y; cin >> x >> y;\\n if (!x) break;\\n for (int i = 0;i < y;i++) m[i] = 0;\\n int r = x;\\n int cnt = 0;\\n while (true) {\\n if (m[r] || !r) break;\\n m[r] = ++cnt;\\n r = (r * 10) % y;\\n }\\n if (!r) {\\n cout << cnt << \\\" 0\\\\n\\\";\\n } else {\\n cout << m[r] - 1 << \\\" \\\" << cnt - m[r] + 1 << \\\"\\\\n\\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 7200,\n \"score_of_the_acc\": -0.0157,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2049_4109889\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\nusing namespace std;\\ntypedef long long int ll;\\n \\nint main(){\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\twhile(1){\\n\\t\\tint a,b; cin >> a >> b;\\n\\t\\tif(a==0&&b==0)break;\\n\\t\\tint g=__gcd(a,b);\\n\\t\\ta/=g; b/=g;\\n\\t\\tvector<int> seen(b,-1);\\n\\t\\tseen[a]=0;\\n\\t\\tfor(int c=1;;c++){\\n\\t\\t\\ta=(10*a)%b;\\n\\t\\t\\tif(a==0){\\n\\t\\t\\t\\tcout << c << \\\" \\\" << 0 << endl;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\telse if(seen[a]!=-1){\\n\\t\\t\\t\\tcout << seen[a] << \\\" \\\" << c-seen[a] << endl;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tseen[a]=c;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 6976,\n \"score_of_the_acc\": -0.0163,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2049_2854533\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = double;\\nconst ld eps = 1e-9;\\n\\nint adiv(int a) {\\n\\tmap<int,int>mp;\\n\\tint num(a);\\n\\tfor (int i = 2; i <= a; ++i) {\\n\\t\\twhile (num%i == 0) {\\n\\t\\t\\tmp[i]++;\\n\\t\\t\\tnum/=i;\\n\\t\\t}\\n\\t}\\n\\tint anum=0;\\n\\tfor (auto m : mp) {\\n\\t\\tanum-=m.first;\\n\\t}\\n\\tanum+=2*prev(mp.end())->first;\\n\\treturn anum;\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\n\\t\\tint x,y;cin>>x>>y;\\n\\t\\tif(!x)break;\\n\\t\\tmap<int,int>mp;\\n\\t\\tvector<int>v(1e6+1,-1);\\n\\t\\tint ans1=0,ans2=0;\\n\\t\\twhile (true) {\\n\\t\\t\\tx*=10;\\n\\t\\t\\tint a=x/y;\\n\\t\\t\\tint b=x%y;\\n\\n\\t\\t\\tif (b == 0) {\\n\\t\\t\\t\\tans1++;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (v[x/10]==-1) {\\n\\t\\t\\t\\t\\tv[x/10]=ans1;\\n\\t\\t\\t\\t\\tans1++;\\n\\t\\t\\t\\t\\tx = b;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tans2=ans1-v[x/10];\\n\\t\\t\\t\\t\\tans1=v[x/10];\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<ans1<<\\\" \\\"<<ans2<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 6992,\n \"score_of_the_acc\": -0.0371,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2049_2341524\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n int a,b;\\n while(cin>>a>>b,a){\\n int s[1000000]={},c=0,g=__gcd(a,b);\\n a/=g,b/=g;\\n while(!s[a]){\\n s[a]=(++c);\\n a=(a*10)%b;\\n if(a<0)return 0;\\n }\\n if(a)c++;\\n cout<<s[a]-1<<' '<<c-s[a]<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 6948,\n \"score_of_the_acc\": -0.011,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2049_2341523\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n int a,b;\\n while(cin>>a>>b,a){\\n int s[1000000]={};\\n int c=0,g=__gcd(a,b);\\n a/=g,b/=g;\\n while(!s[a]){\\n s[a]=(++c);\\n a=(a*10)%b;\\n if(a<0)return 0;\\n }\\n if(a)c++;\\n cout<<s[a]-1<<' '<<c-s[a]<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 6940,\n \"score_of_the_acc\": -0.0107,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2049_2340262\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define all(v) begin(v), end(v)\\n#define reps(i, m, n) for(int i = (int)(m); i < (int)(n); i++)\\n#define rep(i, n) reps(i, 0, n)\\n\\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\\n\\nconst int inf = 1LL << 55;\\nconst int mod = 1e9 + 7;\\n\\nsigned main()\\n{\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n cout << fixed << setprecision(12);\\n\\n int x, y;\\n while(cin >> x >> y, x || y) {\\n int used[1000010];\\n memset(used, -1, sizeof(used));\\n int i;\\n used[x] = 0;\\n x *= 10;\\n for(i = 1; used[x%y] == -1; i++) {\\n x %= y;\\n used[x] = i;\\n if(x == 0) break; \\n x *= 10;\\n }\\n cout << used[x%y] << \\\" \\\" << i-used[x%y] << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 500,\n \"memory_kb\": 10948,\n \"score_of_the_acc\": -0.1791,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2049_2340147\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n int x,y;\\n while(cin>>x>>y,x){\\n int s[1000000]={};\\n int c=0,gc=__gcd(x,y);\\n x/=gc,y/=gc;\\n while(!s[x]){\\n s[x]=++c;\\n x=(x*10)%y;\\n }\\n if(x==0)c=s[x]-1;\\n cout<<s[x]-1<<\\\" \\\"<<c-s[x]+1<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 6944,\n \"score_of_the_acc\": -0.0131,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2049_2340140\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint M[10000000];\\n\\nint main(){\\n while(1){\\n int n,d;\\n cin>>n>>d;\\n if(n==0&&d==0)break;\\n \\n memset(M,-1,sizeof(M));\\n int cnt=0;\\n while(n){\\n int s = (n/d) * d;\\n n -= s;\\n if(M[n]!=-1)break;\\n M[n] = cnt++;\\n n*=10;\\n }\\n\\n\\n if(n == 0)cnt = M[n];\\n cout<<M[n]<<\\\" \\\"<<cnt-M[n]<<endl; \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1740,\n \"memory_kb\": 42112,\n \"score_of_the_acc\": -1.3292,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2049_2340122\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\nint m[1111111];\\nsigned main(){\\n int x,y;\\n while(cin>>x>>y,x||y){\\n int c=0;\\n memset(m,-1,sizeof(m));\\n while(m[x]<0){\\n m[x]=c++;\\n x=(x*10)%y;\\n if(!x) break;\\n }\\n if(!x) cout<<c<<\\\" \\\"<<0<<endl;\\n else cout<<m[x]<<\\\" \\\"<<c-m[x]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 570,\n \"memory_kb\": 11716,\n \"score_of_the_acc\": -0.2164,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2049_2143574\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\ntypedef long long int ll;\\n\\nusing namespace std;\\n\\nint* table;\\n\\nvoid func(int X,int Y){\\n\\n\\tint current = X%Y,ans_left,ans_right;\\n\\n\\ttable[current] = 0;\\n\\n\\tfor(int i = 1;i < 1000000; i++){\\n\\t\\tcurrent = (10*current)%Y;\\n\\n\\t\\tif(current == 0){ //?????????????????´???\\n\\t\\t\\tans_left = i;\\n\\t\\t\\tans_right = 0;\\n\\t\\t\\tbreak;\\n\\t\\t}else{\\n\\t\\t\\tif(table[current] != -1){\\n\\t\\t\\t\\tans_left = table[current];\\n\\t\\t\\t\\tans_right = i - table[current];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ttable[current] = i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%d %d\\\\n\\\",ans_left,ans_right);\\n}\\n\\n\\nint main(){\\n\\n\\tint X,Y;\\n\\n\\ttable = new int[1000010];\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d\\\",&X,&Y);\\n\\t\\tif(X == 0 && Y == 0)break;\\n\\n\\t\\tfor(int i = 0; i < Y; i++)table[i] = -1;\\n\\n\\t\\tfunc(X,Y);\\n\\t}\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 6660,\n \"score_of_the_acc\": -0.0097,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2049_2143573\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\ntypedef long long int ll;\\n\\nusing namespace std;\\n\\nint* table;\\n\\nvoid func(int X,int Y){\\n\\n\\tint current = X%Y,ans_left,ans_right;\\n\\n\\ttable[current] = 0;\\n\\n\\tfor(int i = 1;i < 1000000; i++){\\n\\t\\tcurrent = (10*current)%Y;\\n\\n\\t\\tif(current == 0){ //?????????????????´???\\n\\t\\t\\tans_left = i;\\n\\t\\t\\tans_right = 0;\\n\\t\\t\\tbreak;\\n\\t\\t}else{\\n\\t\\t\\tif(table[current] != -1){\\n\\t\\t\\t\\tans_left = table[current];\\n\\t\\t\\t\\tans_right = i - table[current];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ttable[current] = i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%d %d\\\\n\\\",ans_left,ans_right);\\n}\\n\\n\\nint main(){\\n\\n\\tint X,Y;\\n\\n\\ttable = new int[1000010];\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d\\\",&X,&Y);\\n\\t\\tif(X == 0 && Y == 0)break;\\n\\n\\t\\tfor(int i = 0; i < 1000010; i++)table[i] = -1;\\n\\n\\t\\tfunc(X,Y);\\n\\t}\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 6636,\n \"score_of_the_acc\": -0.0271,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2049_2110627\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n int x,y;\\n while(cin >> x >> y && x) {\\n x%=y;\\n unordered_map<int,int> m;\\n int i;\\n for(i=0; i<1000000; i++) {\\n if(!x) break;\\n if(m.count(x)) {\\n cout << m[x] << \\\" \\\" << i-m[x] << endl;\\n goto next;\\n }\\n m[x]=i;\\n x*=10;\\n x%=y;\\n }\\n cout << i << \\\" \\\" << 0 << endl;\\n next:;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4410,\n \"memory_kb\": 42412,\n \"score_of_the_acc\": -1.9417,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2049_2110624\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint main(){\\n while(1){\\n unordered_map<int,int> mp;\\n int x,y,c=0;\\n scanf(\\\"%d %d\\\",&x,&y);\\n if(x==0&&y==0)break;\\n \\n while(x!=0&&mp.count(x)==0){\\n mp[x]=c++;\\n x*=10;\\n x%=y;\\n }\\n if(x==0){\\n cout<<c<<' '<<0<<endl;\\n }else{\\n cout<<mp[x]<<' '<<c-mp[x]<<endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4540,\n \"memory_kb\": 42476,\n \"score_of_the_acc\": -1.9729,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2049_2110584\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n\\nint x,y;\\nint main(){\\n while( cin >> x >> y && (x||y) ){\\n unordered_map<int,int> mp;\\n int cnt = 0;\\n while( x ){ \\n if( mp.count(x) ) {\\n cout << mp[x] << \\\" \\\" << cnt - mp[x] << endl;\\n break;\\n }\\n mp[x] = cnt++;\\n x *= 10;\\n x %= y; \\n }\\n if( x == 0 ) cout << cnt << \\\" 0\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4470,\n \"memory_kb\": 42380,\n \"score_of_the_acc\": -1.9543,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2049_2027335\",\n \"code_snippet\": \"//============================================================================\\n// Name : B.cpp\\n// Author : \\n// Version :\\n// Copyright : Your copyright notice\\n// Description : Hello World in C++, Ansi-style\\n//============================================================================\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint x,y;\\n\\nint dp[1000010];\\npair<int,int> solve(int x, int y){\\n\\tmemset(dp, -1, sizeof dp);\\n\\tint c = x;\\n\\tfor(int i = 0;; ++i){\\n\\t\\t//int q = c/y;\\n\\t\\tint r = c%y;\\n\\t\\tif(r == 0){\\n\\t\\t\\treturn make_pair(i, 0);\\n\\t\\t}\\n\\t\\tif(dp[r] != -1){\\n\\t\\t\\treturn make_pair(dp[r], i-dp[r]);\\n\\t\\t}\\n\\t\\tdp[r] = i;\\n\\t\\tc = r*10;\\n\\t}\\n}\\n\\nint main() {\\n\\twhile(cin >> x >> y && x){\\n\\t\\tauto ans = solve(x,y);\\n\\t\\tcout << ans.first << ' ' << ans.second << '\\\\n';\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 6956,\n \"score_of_the_acc\": -0.0112,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2049_2023368\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\\n#define rep(i,n) REP(i,0,n)\\n#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 main() {\\n\\n for(int x, y; cin >> x >> y && (x && y);) {\\n int mp[1000001]; memset(mp, -1, sizeof mp);\\n int cnt = 0;\\n while(!~mp[x % y]) {\\n if(x % y == 0) {\\n cout << cnt << \\\" 0\\\" << endl;\\n goto exit;\\n }\\n mp[x % y] = cnt ++;\\n x %= y;\\n x *= 10;\\n }\\n cout << mp[x % y] << \\\" \\\" << cnt - mp[x % y] << endl;\\n exit:;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 6892,\n \"score_of_the_acc\": -0.0094,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2049_2023366\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\\n#define rep(i,n) REP(i,0,n)\\n#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 main() {\\n\\n for(int x, y; cin >> x >> y && (x && y);) {\\n unordered_map<int, int> mp;\\n int cnt = 0;\\n while(mp.find(x % y) == mp.end()) {\\n if(x % y == 0) {\\n cout << cnt << \\\" 0\\\" << endl;\\n goto exit;\\n }\\n mp[x % y] = cnt ++;\\n x %= y;\\n x *= 10;\\n }\\n cout << mp[x % y] << \\\" \\\" << cnt - mp[x % y] << endl;\\n exit:;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4660,\n \"memory_kb\": 42276,\n \"score_of_the_acc\": -1.9944,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2049_2022987\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint check[10][1000001];\\n\\nint main()\\n{\\n int x, y;\\n while(cin >> x >> y, x || y) {\\n memset(check, -1, sizeof(check));\\n int cnt = 0;\\n x *= 10;\\n bool flag = false;\\n while(!~check[x/y][x%y]) {\\n check[x/y][x%y] = cnt;\\n if(x%y == 0) { flag = true; break; }\\n cnt++;\\n x %= y; x *= 10;\\n }\\n cout << check[x/y][x%y]+(int)flag << \\\" \\\" << cnt-check[x/y][x%y] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1920,\n \"memory_kb\": 42136,\n \"score_of_the_acc\": -1.3706,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2049_2022896\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define N 10000005\\nusing namespace std;\\nint m[N];\\nint a,b,cnt,ans1,ans2;\\n\\nint main(){\\n while(1){\\n cin>>a>>b;\\n if(!a&&!b)break;\\n memset(m,-1,sizeof(m));\\n a%=b;\\n cnt=0;\\n while(1){\\n a*=10;\\n if(m[a]!=-1){\\n\\tans1=m[a],ans2=cnt-m[a];\\n\\tbreak;\\n }\\n m[a]=cnt;\\n a%=b;\\n if(!a){\\n\\tans1=cnt+1,ans2=0;\\n\\tbreak;\\n } \\n cnt++;\\n }\\n cout<<ans1<<' '<<ans2<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1890,\n \"memory_kb\": 42032,\n \"score_of_the_acc\": -1.3609,\n \"final_rank\": 15\n }\n]","isConversational":false}}},{"rowIdx":1081,"cells":{"group_id":{"kind":"string","value":"aoj_2054_cpp"},"problem_description":{"kind":"string","value":"Problem G:\nEntangled Tree\nThe electronics division in Ishimatsu Company consists of various development departments\nfor electronic devices including disks and storages, network devices, mobile phones, and many\nothers. Each department covers a wide range of products. For example, the department of disks\nand storages develops internal and external hard disk drives, USB thumb drives, solid-state\ndrives, and so on. This situation brings staff in the product management division difficulty\ncategorizing these numerous products because of their poor understanding of computer devices.\nOne day, a staff member suggested a tree-based diagram named a\ncategory diagram\nin order to\nmake their tasks easier. A category diagram is depicted as follows. Firstly, they prepare one\nlarge sheet of paper. Secondly, they write down the names of the development departments\non the upper side of the sheet. These names represent the\nstart nodes\nof the diagram. Each\nstart node is connected to either a single\nsplit node\nor a single end node (these nodes will be\nmentioned soon later). Then they write down a number of questions that distinguish features\nof products in the middle, and these questions represent the split nodes of the diagram. Each\nsplit node is connected with other split nodes and end nodes, and each line from a split node\nis labeled with the answer to the question. Finally, they write down all category names on the\nlower side, which represents the\nend nodes\n.\nThe classification of each product is done like the following. They begin with the start node that\ncorresponds to the department developing the product. Visiting some split nodes, they traces\nthe lines down until they reach one of the end nodes labeled with a category name. Then they\nfind the product classified into the resultant category.\nThe visual appearance of a category diagram makes the diagram quite understandable even for\nnon-geek persons. However, product managers are not good at drawing the figures by hand, so\nmost of the diagrams were often messy due to many line crossings. For this reason, they hired\nyou, a talented programmer, to obtain the\nclean diagrams\nequivalent to their diagrams. Here,\nwe mean the clean diagrams as those with no line crossings.\nYour task is to write a program that finds the clean diagrams. For simplicity, we simply ignore\nthe questions of the split nodes, and use integers from 1 to\nN\ninstead of the category names.\nInput\nThe input consists of multiple datasets. Each dataset follows the format below:\nN M Q\nsplit node info\n1\nsplit node info\n2\n...\nsplit node info\nM\nquery\n1\nquery\n2\n...\nquery\nQ\nThe first line of each dataset contains three integers\nN\n(1 ≤\nN\n≤ 100000),\nM\n(0 ≤\nM\n≤\nN\n- 1),\nand\nQ\n(1 ≤\nQ\n≤ 1000,\nQ\n≤\nN\n), representing the number of end nodes and split nodes, and the\nnumber of queries respectively. Then\nM\nlines describing the split nodes follow. Each split node\nis described in the format below:\nY L label\n1\nlabel\n2\n. . .\nThe first two integers,\nY\n(0 ≤\nY\n≤ 10\n9\n) and\nL\n, wh\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2054_1679749","code_snippet":"#include <bits/stdc++.h>\n\n#define x first\n#define y second\n#define pb push_back\n#define pii pair<int,int>\n#define ll long long\n#define FOR(i, a, b) for(int i = (int)(a); i < (int)(b); i++)\n#define REP(i, a) FOR(i, 0, a)\n#define TRACE(x) cout << #x << \" \" << x << endl\n#define _ << \" _ \" <<\n\nusing namespace std;\n\n//#define task \"a\"\n#define oo 1e9\n\nconst int MAXM = 100010;\n\nclass inter {\n public:\n int h, l;\n vector<int> V;\n void reset() {\n h = l = 0;\n V.clear();\n }\n} a[MAXM*2];\n\nint n, m, q;\nint par[MAXM*2];\nvector<int> graf[MAXM*2];\n\nint nadji(int x) {\n if (par[x] == x) return x;\n return par[x] = nadji(par[x]);\n}\n\nvoid spoji(int i1, int i2) {\n i1 = nadji(i1);\n i2 = nadji(i2);\n par[i1] = i2;\n // printf(\"Spajam %d %d\\n\", i1, i2);\n}\n\nint cnt;\nint sol[MAXM*2];\nint bio[MAXM*2];\n\nint mini[MAXM*2];\n\nvoid DFS(int curr) {\n // TRACE(curr);\n mini[curr] = oo;\n if (curr <= n) {\n mini[curr] = curr;\n // sol[cnt++] = curr;\n // bio[curr] = 1;\n }\n for (auto it: graf[curr]) {\n DFS(it);\n mini[curr] = min(mini[curr], mini[it]);\n }\nsort(graf[curr].begin(), graf[curr].end(), [](const int &i1, const int &i2) { return mini[i1] < mini[i2]; });\n}\n\nvoid DFS2(int curr) {\nif (curr <= n) {\nsol[cnt++] = curr;\nbio[curr] = 1;\n}\n\nfor (auto it: graf[curr]) DFS2(it);\n\n}\n\nint main(){\n while(1==1) {\n cnt = 1;\n memset(sol, 0, sizeof sol);\n memset(bio, 0, sizeof bio);\n memset(mini, 0, sizeof mini);\n REP(i, MAXM*2) par[i] = i;\n // freopen(task \".in\", \"r\", stdin);\n // freopen(task \".out\", \"w\", stdout);\n\n scanf(\"%d%d%d\", &n, &m, &q);\n if (n == 0 && m == 0 && q == 0) break;\n REP(i, m) {\n scanf(\"%d%d\", &a[i].h, &a[i].l);\n REP(j, a[i].l) {\n\tint pom;\n\tscanf(\"%d\", &pom);\n\ta[i].V.pb(pom);\n }\n }\n sort(a, a + m, [](const inter &i1, const inter &i2){ return i1.h > i2.h; });\n\n int tr = n + 1;\n REP(i, m) {\n REP(j, a[i].V.size()) {\n\tint pom = nadji(a[i].V[j]);\n\tgraf[tr].pb(pom);\n\t//\tprintf(\"Edge %d %d\\n\", tr, pom);\n\tspoji(pom, tr);\n }\n tr++;\n }\n for (int i = tr - 1; i > 0; i--) {\n if (par[i] == i) {\n\tpar[i] = tr;\n\tgraf[tr].pb(i);\n\t//\tprintf(\"Edge %d %d\\n\", tr, i); \n }\n }\n \n DFS(tr);\n DFS2(tr);\n // FOR(i, 1, n+1) {\n // if (bio[i] == 0) sol[cnt++] = i;\n // }\n\n REP(i, q) {\n int pom;\n scanf(\"%d\", &pom);\n printf(\"%d\\n\", sol[pom]);\n }\n\n REP(i, tr+1) {\n graf[i].clear();\n a[i].reset();\n }\n printf(\"\\n\");\n }\n \n \n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":32704,"score_of_the_acc":-0.9998,"final_rank":1},{"submission_id":"aoj_2054_1679669","code_snippet":"#include <algorithm>\n#include <cassert>\n#include <cstring>\n#include <iostream>\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 TRACE(x) cout << #x << \" = \" << x << endl\n#define _ << \" _ \" <<\n\ntypedef long long llint;\n\nconst int MAX = 300100;\n\nvector<pair<int, vector<int>>> g;\npair<int, vector<int>> v[MAX];\nint dad[MAX], id[MAX];\nint idx[MAX];\nbool dead[MAX];\n\nint findset(int x) {\n return x == dad[x] ? x : dad[x] = findset(dad[x]);\n}\n\nint pos;\nvoid dfs(int x) {\n if (g[x].second.size() == 1) {\n idx[pos++] = g[x].first;\n return;\n }\n for (int y: g[x].second) dfs(y);\n}\n\nint main(void) {\n int n, m, q;\n while (scanf(\"%d %d %d\", &n, &m, &q) == 3) {\n if (n == 0) break;\n\n REP(i, m) {\n scanf(\"%d\", &v[i].first);\n int k; scanf(\"%d\", &k);\n v[i].second.resize(k);\n REP(j, k) {\n scanf(\"%d\", &v[i].second[j]);\n --v[i].second[j];\n }\n }\n\n sort(v, v + m);\n g.clear();\n REP(i, n) {\n g.push_back({i, {i}});\n id[i] = i;\n dad[i] = i;\n dead[i] = false;\n }\n\n for (int j = m-1; j >= 0; --j) {\n vector<int> w;\n for (int x: v[j].second) w.push_back(id[findset(x)]);\n sort(w.begin(), w.end(), [&] (const int& a, const int& b) {\n return g[a].first < g[b].first;\n }\n );\n \n int par = findset(v[j].second[0]);\n for (int x: v[j].second) dad[findset(x)] = par;\n id[par] = g.size();\n dead[g.size()] = false;\n for (int x: w) dead[x] = true;\n g.push_back({g[w[0]].first, w});\n }\n \n vector<int> w;\n REP(i, (int)g.size())\n if (!dead[i]) w.push_back(i);\n sort(w.begin(), w.end(), [&] (const int& a, const int& b) {\n return g[a].first < g[b].first;\n }\n );\n \n pos = 0;\n for (int x: w) dfs(x);\n\n REP(i, q) {\n int x;\n scanf(\"%d\", &x); --x;\n printf(\"%d\\n\", idx[x]+1);\n }\n putchar('\\n');\n }\n \n return 0;\n}","accuracy":1,"time_ms":220,"memory_kb":32708,"score_of_the_acc":-1.1304,"final_rank":3},{"submission_id":"aoj_2054_427652","code_snippet":"#include <stdio.h>\n#include <assert.h>\n#include <vector>\n#include <algorithm>\n#include <utility>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define mp make_pair\n\n#define NUM (120000)\nint N, M, Q, Y[NUM];\nvector<int> ls[NUM];\npair<int, int> ord[NUM];\nint hi[NUM], p[NUM], c[NUM], f[NUM], b[NUM], ans[NUM];\nvector<pair<int, int> > a[NUM];\n\nvoid fix(int k) {\n sort(a[k].begin(), a[k].end());\n f[k] = a[k][0].first;\n c[k] = 0;\n rep (i, a[k].size()) c[k] += a[k][i].second == -1 ? 1 : c[a[k][i].second];\n}\n\nvoid build() {\n Y[M] = -1;\n rep (i, N) hi[i] = -1;\n rep (i, M+1) ord[i] = mp(Y[i], i);\n sort(ord, ord+M+1);\n for (int ik = M; ik > 0; ik--) {\n const int k = ord[ik].second;\n a[k].clear();\n p[k] = -1;\n rep (i, ls[k].size()) {\n const int ix = ls[k][i]-1;\n if (hi[ix] == -1) a[k].push_back(mp(ix, -1));\n else {\n a[k].push_back(mp(f[hi[ix]], hi[ix]));\n assert(p[hi[ix]] == -1);\n p[hi[ix]] = i;\n }\n hi[ix] = k;\n }\n fix(k);\n }\n a[M].clear();\n rep (i, N) if (hi[i] == -1) a[M].push_back(mp(i, -1));\n rep (i, M) if (p[i] == -1) a[M].push_back(mp(f[i], i));\n fix(M);\n b[M] = 0;\n rep (ik, M+1) {\n const int k = ord[ik].second;\n int z = b[k];\n rep (i, a[k].size()) {\n if (a[k][i].second == -1) {\n ans[z] = a[k][i].first;\n z++;\n }\n else {\n b[a[k][i].second] = z;\n z += c[a[k][i].second];\n }\n }\n }\n}\n\nint main() {\n for (;;) {\n scanf(\"%d%d%d\", &N, &M, &Q);\n if (N == 0) return 0;\n rep (i, M) {\n scanf(\"%d\", Y+i);\n int L;\n scanf(\"%d\", &L);\n ls[i].resize(L);\n rep (j, L) scanf(\"%d\", &ls[i][j]);\n }\n build();\n rep (i, Q) {\n int q;\n scanf(\"%d\", &q);\n printf(\"%d\\n\", ans[q-1]+1);\n }\n printf(\"\\n\");\n }\n}","accuracy":1,"time_ms":420,"memory_kb":14000,"score_of_the_acc":-1,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_2054_1679749\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define x first\\n#define y second\\n#define pb push_back\\n#define pii pair<int,int>\\n#define ll long long\\n#define FOR(i, a, b) for(int i = (int)(a); i < (int)(b); i++)\\n#define REP(i, a) FOR(i, 0, a)\\n#define TRACE(x) cout << #x << \\\" \\\" << x << endl\\n#define _ << \\\" _ \\\" <<\\n\\nusing namespace std;\\n\\n//#define task \\\"a\\\"\\n#define oo 1e9\\n\\nconst int MAXM = 100010;\\n\\nclass inter {\\n public:\\n int h, l;\\n vector<int> V;\\n void reset() {\\n h = l = 0;\\n V.clear();\\n }\\n} a[MAXM*2];\\n\\nint n, m, q;\\nint par[MAXM*2];\\nvector<int> graf[MAXM*2];\\n\\nint nadji(int x) {\\n if (par[x] == x) return x;\\n return par[x] = nadji(par[x]);\\n}\\n\\nvoid spoji(int i1, int i2) {\\n i1 = nadji(i1);\\n i2 = nadji(i2);\\n par[i1] = i2;\\n // printf(\\\"Spajam %d %d\\\\n\\\", i1, i2);\\n}\\n\\nint cnt;\\nint sol[MAXM*2];\\nint bio[MAXM*2];\\n\\nint mini[MAXM*2];\\n\\nvoid DFS(int curr) {\\n // TRACE(curr);\\n mini[curr] = oo;\\n if (curr <= n) {\\n mini[curr] = curr;\\n // sol[cnt++] = curr;\\n // bio[curr] = 1;\\n }\\n for (auto it: graf[curr]) {\\n DFS(it);\\n mini[curr] = min(mini[curr], mini[it]);\\n }\\nsort(graf[curr].begin(), graf[curr].end(), [](const int &i1, const int &i2) { return mini[i1] < mini[i2]; });\\n}\\n\\nvoid DFS2(int curr) {\\nif (curr <= n) {\\nsol[cnt++] = curr;\\nbio[curr] = 1;\\n}\\n\\nfor (auto it: graf[curr]) DFS2(it);\\n\\n}\\n\\nint main(){\\n while(1==1) {\\n cnt = 1;\\n memset(sol, 0, sizeof sol);\\n memset(bio, 0, sizeof bio);\\n memset(mini, 0, sizeof mini);\\n REP(i, MAXM*2) par[i] = i;\\n // freopen(task \\\".in\\\", \\\"r\\\", stdin);\\n // freopen(task \\\".out\\\", \\\"w\\\", stdout);\\n\\n scanf(\\\"%d%d%d\\\", &n, &m, &q);\\n if (n == 0 && m == 0 && q == 0) break;\\n REP(i, m) {\\n scanf(\\\"%d%d\\\", &a[i].h, &a[i].l);\\n REP(j, a[i].l) {\\n\\tint pom;\\n\\tscanf(\\\"%d\\\", &pom);\\n\\ta[i].V.pb(pom);\\n }\\n }\\n sort(a, a + m, [](const inter &i1, const inter &i2){ return i1.h > i2.h; });\\n\\n int tr = n + 1;\\n REP(i, m) {\\n REP(j, a[i].V.size()) {\\n\\tint pom = nadji(a[i].V[j]);\\n\\tgraf[tr].pb(pom);\\n\\t//\\tprintf(\\\"Edge %d %d\\\\n\\\", tr, pom);\\n\\tspoji(pom, tr);\\n }\\n tr++;\\n }\\n for (int i = tr - 1; i > 0; i--) {\\n if (par[i] == i) {\\n\\tpar[i] = tr;\\n\\tgraf[tr].pb(i);\\n\\t//\\tprintf(\\\"Edge %d %d\\\\n\\\", tr, i); \\n }\\n }\\n \\n DFS(tr);\\n DFS2(tr);\\n // FOR(i, 1, n+1) {\\n // if (bio[i] == 0) sol[cnt++] = i;\\n // }\\n\\n REP(i, q) {\\n int pom;\\n scanf(\\\"%d\\\", &pom);\\n printf(\\\"%d\\\\n\\\", sol[pom]);\\n }\\n\\n REP(i, tr+1) {\\n graf[i].clear();\\n a[i].reset();\\n }\\n printf(\\\"\\\\n\\\");\\n }\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 32704,\n \"score_of_the_acc\": -0.9998,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2054_1679669\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cassert>\\n#include <cstring>\\n#include <iostream>\\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 TRACE(x) cout << #x << \\\" = \\\" << x << endl\\n#define _ << \\\" _ \\\" <<\\n\\ntypedef long long llint;\\n\\nconst int MAX = 300100;\\n\\nvector<pair<int, vector<int>>> g;\\npair<int, vector<int>> v[MAX];\\nint dad[MAX], id[MAX];\\nint idx[MAX];\\nbool dead[MAX];\\n\\nint findset(int x) {\\n return x == dad[x] ? x : dad[x] = findset(dad[x]);\\n}\\n\\nint pos;\\nvoid dfs(int x) {\\n if (g[x].second.size() == 1) {\\n idx[pos++] = g[x].first;\\n return;\\n }\\n for (int y: g[x].second) dfs(y);\\n}\\n\\nint main(void) {\\n int n, m, q;\\n while (scanf(\\\"%d %d %d\\\", &n, &m, &q) == 3) {\\n if (n == 0) break;\\n\\n REP(i, m) {\\n scanf(\\\"%d\\\", &v[i].first);\\n int k; scanf(\\\"%d\\\", &k);\\n v[i].second.resize(k);\\n REP(j, k) {\\n scanf(\\\"%d\\\", &v[i].second[j]);\\n --v[i].second[j];\\n }\\n }\\n\\n sort(v, v + m);\\n g.clear();\\n REP(i, n) {\\n g.push_back({i, {i}});\\n id[i] = i;\\n dad[i] = i;\\n dead[i] = false;\\n }\\n\\n for (int j = m-1; j >= 0; --j) {\\n vector<int> w;\\n for (int x: v[j].second) w.push_back(id[findset(x)]);\\n sort(w.begin(), w.end(), [&] (const int& a, const int& b) {\\n return g[a].first < g[b].first;\\n }\\n );\\n \\n int par = findset(v[j].second[0]);\\n for (int x: v[j].second) dad[findset(x)] = par;\\n id[par] = g.size();\\n dead[g.size()] = false;\\n for (int x: w) dead[x] = true;\\n g.push_back({g[w[0]].first, w});\\n }\\n \\n vector<int> w;\\n REP(i, (int)g.size())\\n if (!dead[i]) w.push_back(i);\\n sort(w.begin(), w.end(), [&] (const int& a, const int& b) {\\n return g[a].first < g[b].first;\\n }\\n );\\n \\n pos = 0;\\n for (int x: w) dfs(x);\\n\\n REP(i, q) {\\n int x;\\n scanf(\\\"%d\\\", &x); --x;\\n printf(\\\"%d\\\\n\\\", idx[x]+1);\\n }\\n putchar('\\\\n');\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 32708,\n \"score_of_the_acc\": -1.1304,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2054_427652\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <assert.h>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\nusing namespace std;\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define mp make_pair\\n\\n#define NUM (120000)\\nint N, M, Q, Y[NUM];\\nvector<int> ls[NUM];\\npair<int, int> ord[NUM];\\nint hi[NUM], p[NUM], c[NUM], f[NUM], b[NUM], ans[NUM];\\nvector<pair<int, int> > a[NUM];\\n\\nvoid fix(int k) {\\n sort(a[k].begin(), a[k].end());\\n f[k] = a[k][0].first;\\n c[k] = 0;\\n rep (i, a[k].size()) c[k] += a[k][i].second == -1 ? 1 : c[a[k][i].second];\\n}\\n\\nvoid build() {\\n Y[M] = -1;\\n rep (i, N) hi[i] = -1;\\n rep (i, M+1) ord[i] = mp(Y[i], i);\\n sort(ord, ord+M+1);\\n for (int ik = M; ik > 0; ik--) {\\n const int k = ord[ik].second;\\n a[k].clear();\\n p[k] = -1;\\n rep (i, ls[k].size()) {\\n const int ix = ls[k][i]-1;\\n if (hi[ix] == -1) a[k].push_back(mp(ix, -1));\\n else {\\n a[k].push_back(mp(f[hi[ix]], hi[ix]));\\n assert(p[hi[ix]] == -1);\\n p[hi[ix]] = i;\\n }\\n hi[ix] = k;\\n }\\n fix(k);\\n }\\n a[M].clear();\\n rep (i, N) if (hi[i] == -1) a[M].push_back(mp(i, -1));\\n rep (i, M) if (p[i] == -1) a[M].push_back(mp(f[i], i));\\n fix(M);\\n b[M] = 0;\\n rep (ik, M+1) {\\n const int k = ord[ik].second;\\n int z = b[k];\\n rep (i, a[k].size()) {\\n if (a[k][i].second == -1) {\\n ans[z] = a[k][i].first;\\n z++;\\n }\\n else {\\n b[a[k][i].second] = z;\\n z += c[a[k][i].second];\\n }\\n }\\n }\\n}\\n\\nint main() {\\n for (;;) {\\n scanf(\\\"%d%d%d\\\", &N, &M, &Q);\\n if (N == 0) return 0;\\n rep (i, M) {\\n scanf(\\\"%d\\\", Y+i);\\n int L;\\n scanf(\\\"%d\\\", &L);\\n ls[i].resize(L);\\n rep (j, L) scanf(\\\"%d\\\", &ls[i][j]);\\n }\\n build();\\n rep (i, Q) {\\n int q;\\n scanf(\\\"%d\\\", &q);\\n printf(\\\"%d\\\\n\\\", ans[q-1]+1);\\n }\\n printf(\\\"\\\\n\\\");\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 14000,\n \"score_of_the_acc\": -1,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":1082,"cells":{"group_id":{"kind":"string","value":"aoj_2055_cpp"},"problem_description":{"kind":"string","value":"Problem H:\nRamen Shop\nRon is a master of a ramen shop.\nRecently, he has noticed some customers wait for a long time. This has been caused by lack of\nseats during lunch time. Customers loses their satisfaction if they waits for a long time, and\neven some of them will give up waiting and go away. For this reason, he has decided to increase\nseats in his shop. To determine how many seats are appropriate, he has asked you, an excellent\nprogrammer, to write a simulator of customer behavior.\nCustomers come to his shop in groups, each of which is associated with the following four\nparameters:\nT\ni\n: when the group comes to the shop\nP\ni\n: number of customers\nW\ni\n: how long the group can wait for their seats\nE\ni\n: how long the group takes for eating\nThe\ni\n-th group comes to the shop with\nP\ni\ncustomers together at the time\nT\ni\n. If\nP\ni\nsuccessive\nseats are available at that time, the group takes their seats immediately. Otherwise, they waits\nfor such seats being available. When the group fails to take their seats within the time\nW\ni\n(inclusive) from their coming and strictly before the closing time, they give up waiting and go\naway. In addition, if there are other groups waiting, the new group cannot take their seats until\nthe earlier groups are taking seats or going away.\nThe shop has\nN\ncounters numbered uniquely from 1 to\nN\n. The\ni\n-th counter has\nC\ni\nseats. The\ngroup prefers “seats with a greater distance to the nearest group.” Precisely, the group takes\ntheir seats according to the criteria listed below. Here,\nS\nL\ndenotes the number of successive\nempty seats on the left side of the group after their seating, and\nS\nR\nthe number on the right\nside.\nS\nL\nand\nS\nR\nare considered to be infinity if there are no other customers on the left side\nand on the right side respectively.\nPrefers seats maximizing min{\nS\nL\n,\nS\nR\n}.\nIf there are multiple alternatives meeting the first criterion, prefers seats maximizing\n max{\nS\nL\n,\nS\nR\n}.\nIf there are still multiple alternatives, prefers the counter of the smallest number.\nIf there are still multiple alternatives, prefers the leftmost seats.\nWhen multiple groups are leaving the shop at the same time and some other group is waiting\nfor available seats, seat assignment for the waiting group should be made after all the finished\ngroups leave the shop.\nYour task is to calculate the average satisfaction over customers. The satisfaction of a customer\nin the\ni\n-th group is given as follows:\nIf the group goes away without eating, -1.\nOtherwise, (\nW\ni\n-\nt\ni\n)/\nW\ni\nwhere\nt\ni\nis the actual waiting time for the\ni\n-th group (the value ranges between 0 to 1 inclusive).\nInput\nThe input consists of multiple datasets.\nEach dataset has the following format:\nN M T\nC\n1\nC\n2\n...\nC\nN\nT\n1\nP\n1\nW\n1\nE\n1\nT\n2\nP\n2\nW\n2\nE\n2\n...\nT\nM\nP\nM\nW\nM\nE\nM\nN\nindicates the number of counters,\nM\nindicates the number of groups and\nT\nindicates the\nclosing time. The shop always opens at the time 0. All input values are integers.\nYou can assume that 1 ≤\nN\n≤ 100, 1 ≤\nM\n≤ 10\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2055_9149012","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 105\n#define SIZE2 10005\n\nenum Type{\n\ttype_END,\n\ttype_ATE,\n\ttype_WAIT_OUT,\n\ttype_IN,\n};\n\nstruct Info{\n\n\tint T,P,W,E;\n};\n\nstruct Event{\n\tEvent(int arg_T,int arg_ind,Type arg_type){\n\t\tT = arg_T;\n\t\tind = arg_ind;\n\t\ttype = arg_type;\n\t}\n\tEvent(){\n\n\t\tT = ind = 0;\n\t\ttype = type_IN;\n\t}\n\tbool operator<(const struct Event &arg) const{\n\t\tif(T != arg.T){\n\n\t\t\treturn T > arg.T; //時刻の昇順(PQ)\n\t\t}else{\n\n\t\t\treturn type > arg.type; //退出を先に処理(PQ)\n\t\t}\n\t}\n\n\tint T,ind;\n\tType type;\n};\n\nstruct DATA{\n\tvoid set(int arg_ind,int arg_SL,int arg_SR){\n\t\tind = arg_ind;\n\t\tSL = arg_SL;\n\t\tSR = arg_SR;\n\t}\n\n\tint ind,SL,SR;\n};\n\nstruct LOC{\n\tvoid set(int arg_c_ind,int arg_left){\n\t\tc_ind = arg_c_ind;\n\t\tleft = arg_left;\n\t}\n\n\tint c_ind,left;\n};\n\nint N,M,LAST;\nint C[SIZE]; //各カウンターに何席あるか\nmap<int,int> REV; //来店時刻からグループ番を引く\nmap<int,bool> MAP;\nbool table[SIZE][SIZE],after_wait[SIZE2];\nint nearL[SIZE][SIZE],nearR[SIZE][SIZE];\nint C_IND[SIZE2],LEFT[SIZE2];\nInfo info[SIZE2];\n\n//カウンター[c_ind]で、グループ[ind]が座る位置を探す(なければ-1)を返却\nDATA searchPos(int c_ind,int ind){ //100\n\n\tDATA ret;\n\tret.set(BIG_NUM,-1,-1);\n\n\tint min_maxi= -BIG_NUM,max_maxi = -BIG_NUM;\n\tint len = info[ind].P;\n\n\tfor(int i = 1; i+len-1 <= C[c_ind]; i++){ //左端候補を走査\n\n\t\tif((nearR[c_ind][i] <= i+len-1))continue;\n\n\t\tint SL = min(BIG_NUM,(i-nearL[c_ind][i])-1);\n\t\tint SR = min(BIG_NUM,(nearR[c_ind][i+len-1]-(i+len-1)-1));\n\n\t\tif(min(SL,SR) < min_maxi)continue;\n\n\t\tif(min(SL,SR) > min_maxi){ //最小値の最大値更新\n\n\t\t\tmin_maxi = min(SL,SR);\n\t\t\tmax_maxi = max(SL,SR);\n\t\t\tret.set(i,SL,SR);\n\n\t\t}else if(min(SL,SR) == min_maxi){ //最小値の最大値が同点\n\n\t\t\tif(max(SL,SR) > max_maxi){ //最大値更新\n\n\t\t\t\tmax_maxi = max(SL,SR);\n\t\t\t\tret.set(i,SL,SR);\n\n\t\t\t}\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nvoid updateDATA(int ind,bool is_in){ //カウンターの状態の更新\n\n\tint c_ind = C_IND[ind];\n\tint left = LEFT[ind];\n\tint len = info[ind].P;\n\n\tfor(int i = left; i <= left+len-1; i++){\n\n\t\tif(is_in){ //新しく座る\n\n\t\t\ttable[c_ind][i] = true;\n\n\t\t}else{ //席を立つ\n\n\t\t\ttable[c_ind][i] = false;\n\t\t}\n\t}\n\n\t//nearLの再計算\n\tint last = -(BIG_NUM+SIZE);\n\tfor(int i = 1; i <= C[c_ind]; i++){\n\n\t\tif(table[c_ind][i]){\n\n\t\t\tlast = i;\n\t\t\tnearL[c_ind][i] = i;\n\t\t}else{\n\n\t\t\tnearL[c_ind][i] = last;\n\t\t}\n\t}\n\n\t//nearRの再計算\n\tlast = BIG_NUM+SIZE;\n\tfor(int i = C[c_ind]; i >= 1; i--){\n\n\t\tif(table[c_ind][i]){\n\n\t\t\tlast = i;\n\t\t\tnearR[c_ind][i] = i;\n\t\t}else{\n\n\t\t\tnearR[c_ind][i] = last;\n\t\t}\n\t}\n}\n\nLOC searchLOC(int ind){ //座れるカウンターと、その位置を調べる\n\n\tLOC ret;\n\n\tret.set(-1,-1);\n\n\tint min_maxi = -BIG_NUM,max_maxi = -BIG_NUM;\n\n\n\tfor(int i = 0; i < N; i++){ //N個のカウンターすべてを見る\n\n\t\tDATA tmpD = searchPos(i,ind);\n\t\tif(tmpD.ind == BIG_NUM)continue; //座れる場所なし\n\n\t\tif(min_maxi < min(tmpD.SL,tmpD.SR)){ //最小値の最大値更新\n\t\t\tmin_maxi = min(tmpD.SL,tmpD.SR);\n\t\t\tmax_maxi = max(tmpD.SL,tmpD.SR);\n\t\t\tret.set(i,tmpD.ind);\n\n\t\t}else if(min_maxi == min(tmpD.SL,tmpD.SR)){ //最小値の最大値が同点\n\n\t\t\tif(max_maxi < max(tmpD.SL,tmpD.SR)){ //最大値の最大値更新\n\n\t\t\t\tmax_maxi = max(tmpD.SL,tmpD.SR);\n\t\t\t\tret.set(i,tmpD.ind);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nvoid func(){\n\n\tMAP.clear();\n\tREV.clear();\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%d\",&C[i]);\n\t}\n\n\tpriority_queue<Event> Q;\n\n\tint div = 0;\n\n\tfor(int i = 0; i < M; i++){//グループの情報を取得\n\n\t\tscanf(\"%d %d %d %d\",&info[i].T,&info[i].P,&info[i].W,&info[i].E);\n\n\t\tREV[info[i].T] = i; //来店時刻による逆引き表\n\t\tdiv += info[i].P;\n\n\t\tQ.push(Event(info[i].T,i,type_IN));\n\t}\n\n\tQ.push(Event(LAST,-1,type_END)); //閉店\n\n\t//カウンターの情報の初期化\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 1; k <= C[i]; k++){\n\n\t\t\ttable[i][k] = false;\n\t\t\tnearL[i][k] = -(BIG_NUM+SIZE); //kおよびkより左で、最も近い、誰かが座っている椅子の番号\n\t\t\tnearR[i][k] = BIG_NUM+SIZE; //kおよびkより右で、最も近い、誰かが座っている椅子の番号\n\t\t}\n\t}\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tafter_wait[i] = false;\n\t\tC_IND[i] = -1;\n\t}\n\n\n\tint now = 0;\n\tdouble ans = 0;\n\n\twhile(!Q.empty()){\n\t\tEvent event = Q.top();\n\t\tQ.pop();\n\n\t\tnow = event.T;\n\n\t\tif(now == LAST)break;\n\n\t\tif(event.type == type_IN){ //来店\n\n\t\t\tif(MAP.size() > 0){ //待ち行列あり\n\n\t\t\t\tMAP[info[event.ind].T] = true; //待ち行列に加える\n\t\t\t\tQ.push(Event(now+info[event.ind].W,event.ind,type_WAIT_OUT)); //食べずに退店イベントの追加\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t//MAP.size() == 0\n\n\t\t\tLOC loc = searchLOC(event.ind); //座れるカウンターと、その位置を調べる\n\n\t\t\tif(loc.c_ind == -1){ //現在座れる椅子がなかった場合\n\n\t\t\t\tMAP[info[event.ind].T] = true; //待ち行列に加える\n\t\t\t\tQ.push(Event(now+info[event.ind].W,event.ind,type_WAIT_OUT)); //食べずに退店イベントの追加\n\n\t\t\t}else{ //現在座れる椅子があった場合\n\n\t\t\t\tans += 1.0*info[event.ind].P; //待ち時間0\n\n\t\t\t\tC_IND[event.ind] = loc.c_ind;\n\t\t\t\tLEFT[event.ind] = loc.left;\n\n\t\t\t\tupdateDATA(event.ind,true);\n\n\t\t\t\tQ.push(Event(now+info[event.ind].E,event.ind,type_ATE)); //食べ終わって退店イベントの追加\n\t\t\t}\n\n\t\t}else{ //type_ATE または type_WAIT_OUT\n\n\t\t\tbool FLG = true; //待ち行列を消化して良いか\n\n\t\t\tset<int> SET;\n\n\t\t\tif(event.type == type_ATE){ //食べ終わり\n\n\t\t\t\t//■同時刻に退店するグループを、全て出す(食べて退店)→待ち行列にはいないはず\n\t\t\t\twhile(true){\n\n\t\t\t\t\t//退店処理\n\t\t\t\t\tupdateDATA(event.ind,false);\n\n\t\t\t\t\tif(Q.empty() || Q.top().T != now || Q.top().type != type_ATE)break;\n\n\t\t\t\t\tevent = Q.top();\n\t\t\t\t\tQ.pop();\n\t\t\t\t}\n\n\t\t\t}else if(event.type == type_WAIT_OUT){\n\n\t\t\t\t//■同時刻に退店するグループを、全て出す(食べずに退店)\n\n\t\t\t\twhile(true){\n\n\t\t\t\t\tif(!after_wait[event.ind]){ //待っている途中で席に座らなかった場合\n\n\t\t\t\t\t\tSET.insert(event.ind); //待ち行列にいるはず\n\t\t\t\t\t}\n\n\t\t\t\t\tif(Q.empty() || Q.top().T != now || Q.top().type != type_WAIT_OUT)break;\n\n\t\t\t\t\tevent = Q.top();\n\t\t\t\t\tQ.pop();\n\t\t\t\t}\n\n\t\t\t\tif(SET.size() == 0)continue; //有効な情報なし\n\n\t\t\t\tif(MAP.size() > 0){\n\n\t\t\t\t\tint work_ind = REV[MAP.begin()->first]; //待ち集団の先頭\n\n\t\t\t\t\tif(SET.count(work_ind) > 0){ //待ち集団の先頭の退出時刻が到来した場合\n\n\t\t\t\t\t\t//■■まずは先頭を消す\n\t\t\t\t\t\tans -= 1.0*info[work_ind].P;\n\n\t\t\t\t\t\tMAP.erase(info[work_ind].T);\n\n\t\t\t\t\t\tSET.erase(work_ind);\n\n\t\t\t\t\t}else{ //待ち行列の先頭が、引き続き待つ場合\n\n\t\t\t\t\t\tFLG = false; //待ち行列は消化しない\n\n\t\t\t\t\t\tfor(int g: SET){\n\n\t\t\t\t\t\t\tans -= 1.0*info[g].P;\n\t\t\t\t\t\t\tMAP.erase(info[g].T);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tSET.clear();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(!FLG)continue;\n\n\t\t\t//FLG == true;\n\n\t\t\t//新たに座れるようになった人々を座らせる\n\t\t\twhile(true){\n\n\t\t\t\tif(MAP.size() == 0)break;\n\n\t\t\t\tauto at = MAP.begin();\n\t\t\t\tint tmp_ind = REV[at->first]; //待ち行列の先頭グループ\n\n\t\t\t\tLOC loc = searchLOC(tmp_ind);\n\n\t\t\t\tif(loc.c_ind == -1){\n\t\t\t\t\tif(now == info[tmp_ind].T+info[tmp_ind].W){\n\n\t\t\t\t\t\tMAP.erase(info[tmp_ind].T);\n\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tbreak; //まだ座れない\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tafter_wait[tmp_ind] = true;\n\n\t\t\t\tdouble bunshi = info[tmp_ind].W - (now-info[tmp_ind].T);\n\t\t\t\tdouble bunbo = info[tmp_ind].W;\n\n\t\t\t\tans += (bunshi/bunbo)*info[tmp_ind].P;\n\n\t\t\t\tC_IND[tmp_ind] = loc.c_ind;\n\t\t\t\tLEFT[tmp_ind] = loc.left;\n\t\t\t\tupdateDATA(tmp_ind,true);\n\n\t\t\t\tQ.push(Event(now+info[tmp_ind].E,tmp_ind,type_ATE));\n\n\t\t\t\tSET.erase(tmp_ind);\n\t\t\t\tMAP.erase(info[tmp_ind].T);\n\t\t\t}\n\n\t\t\t//■■席に座れなかった、退出予定時刻到来者を待ち行列から消す\n\t\t\tfor(int g: SET){\n\n\t\t\t\tans -= 1.0*info[g].P;\n\t\t\t\tMAP.erase(info[g].T);\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(auto at = MAP.begin(); at != MAP.end(); at++){\n\n\t\tint tmp_ind = REV[at->first];\n\t\tans -= 1.0*info[tmp_ind].P;\n\t}\n\n\tprintf(\"%.16lf\\n\",ans/div);\n}\n\nint main(){\n\n\n\twhile(true){\n\t\tscanf(\"%d %d %d\",&N,&M,&LAST);\n\t\tif(N == 0 && M == 0 && LAST == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":320,"memory_kb":4808,"score_of_the_acc":-1,"final_rank":3},{"submission_id":"aoj_2055_472123","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\nclass Data\n{\npublic:\n long long time;\n int id;\n int kind; // 0 : 客の来店\n // 1 : 待ち時間が長く帰宅\n // 2 : 食事を終えて帰宅\n // 3 : 閉店\n Data(long long time0, int id0, int kind0){\n time = time0;\n id = id0;\n kind = kind0;\n }\n bool operator< (const Data& d) const{\n return make_pair(time, kind) < make_pair(d.time, d.kind);\n }\n};\n\npair<int, int> findCounter(const vector<vector<bool> >& used, int num)\n{\n int n = used.size();\n\n int sl = -1;\n int sr = -1;\n pair<int, int> ret(-1, -1);\n for(int i=0; i<n; ++i){\n int m = used[i].size();\n int size = 0;\n for(int j=0; j<m; ++j){\n if(used[i][j]){\n size = 0;\n continue;\n }\n\n ++ size;\n if(size >= num){\n int sl2;\n int sr2;\n int k;\n if(j+1 == size && j == m-1){\n sl2 = sr2 = INT_MAX;\n k = 0;\n }else if(j+1 == size){\n sl2 = INT_MAX;\n sr2 = size - num;\n k = 0;\n }else if(j == m-1){\n sl2 = size - num;\n sr2 = INT_MAX;\n k = j - num + 1;\n }else{\n sl2 = (size - num) / 2;\n sr2 = (size - num + 1) / 2;\n k = j - size + (size - num) / 2 + 1;\n }\n if(min(sl2, sr2) > min(sl, sr) || (min(sl2, sr2) == min(sl, sr) && max(sl2, sr2) > max(sl, sr))){\n sl = sl2;\n sr = sr2;\n ret = make_pair(i, k);\n }\n }\n }\n }\n\n return ret;\n}\n\nint main()\n{\n for(;;){\n int n, m, closeTime; // カウンター数、グループ数、閉店時間\n cin >> n >> m >> closeTime;\n if(n == 0)\n return 0;\n\n vector<int> counter(n); // 各カウンターの席の数\n for(int i=0; i<n; ++i)\n cin >> counter[i];\n vector<vector<bool> > used(n); // 使用中のカウンターの席\n for(int i=0; i<n; ++i)\n used[i].assign(counter[i], false);\n\n vector<int> come(m), num(m), wait(m), eat(m); // 来店時間、各グループの客の人数、最大待ち時間、食事時間\n for(int i=0; i<m; ++i)\n cin >> come[i] >> num[i] >> wait[i] >> eat[i];\n\n multiset<Data> ms;\n ms.insert(Data(closeTime, -1, 3));\n for(int i=0; i<m; ++i){\n ms.insert(Data(come[i], i, 0));\n ms.insert(Data(come[i] + wait[i], i, 1));\n }\n\n queue<int> q; // 待っているグループ\n vector<pair<int, int> > sit(m); // 各グループが使っているカウンターの位置\n vector<double> satisfaction(m, -1.0); // 各グループの満足度\n bool isClose = false; // 閉店時間を過ぎたかどうか\n while(!ms.empty()){\n long long time = ms.begin()->time;\n while(!ms.empty() && ms.begin()->time == time){\n Data d = *ms.begin();\n ms.erase(ms.begin());\n\n if(d.kind == 0){\n q.push(d.id);\n }else if(d.kind == 2){\n for(int i=0; i<num[d.id]; ++i)\n used[sit[d.id].first][sit[d.id].second + i] = false;\n }else if(d.kind == 3){\n isClose = true;\n }\n }\n if(isClose)\n break;\n\n while(!q.empty()){\n int id = q.front();\n if(time > come[id] + wait[id]){\n q.pop();\n continue;\n }\n\n pair<int, int> pos = findCounter(used, num[id]);\n if(pos.first == -1){\n if(time == come[id] + wait[id]){\n q.pop();\n continue;\n }\n break;\n }\n\n q.pop();\n for(int i=0; i<num[id]; ++i)\n used[pos.first][pos.second + i] = true;\n sit[id] = pos;\n satisfaction[id] = (wait[id] - (time - come[id])) / (double)wait[id];\n ms.insert(Data(time + eat[id], id, 2));\n }\n }\n\n double ret = 0.0;\n for(int i=0; i<m; ++i)\n ret += satisfaction[i] * num[i];\n ret /= accumulate(num.begin(), num.end(), 0);\n printf(\"%.10f\\n\", ret);\n }\n}","accuracy":1,"time_ms":1090,"memory_kb":2784,"score_of_the_acc":-0.9359,"final_rank":2},{"submission_id":"aoj_2055_361601","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <cstring>\n\nusing namespace std;\n\nclass Event{\npublic:\n\tint time, group, type;\n\tEvent(int t, int g, int p) : time(t), group(g), type(p) {}\n\tbool operator < (const Event &e) const { return make_pair(time,type) > make_pair(e.time,e.type); }\n};\n\nint main(){\n\tint n, m, t;\n\tint c[100], pos[10000], T[10000], P[10000], W[10000], E[10000];\n\tint seat[100][100];\n\tint left[100], right[100], seq[100];\n\tbool out[10000], in[10000];\n\tdouble score[10000];\n\twhile(cin >> n >> m >> t, n){\n\t\tfor(int i=0;i<n;i++) cin >> c[i];\n\t\tmemset(pos, -1, sizeof(pos));\n\t\tmemset(out,false,sizeof(out));\n\t\tmemset(in, false,sizeof(in));\n\t\tmemset(seat, -1, sizeof(seat));\n\t\tpriority_queue<Event> qu;\n\t\tqueue<int> wait;\n\t\tfor(int i=0;i<m;i++){\n\t\t\tcin >> T[i] >> P[i] >> W[i] >> E[i];\n\t\t\tqu.push(Event(T[i],i,1));\n\t\t\tqu.push(Event(T[i]+W[i],i,3));\n\t\t}\n\t\twhile(!qu.empty()){\n\t\t\tEvent e = qu.top(); qu.pop();\n\t\t\tif(e.type == 0){\n\t\t\t\tfor(int i=0;i<c[pos[e.group]];i++){\n\t\t\t\t\tif(seat[pos[e.group]][i] == e.group) seat[pos[e.group]][i] = -1;\n\t\t\t\t}\n\t\t\t\tif(e.time<t) qu.push(Event(e.time,-1,2));\n\t\t\t}\n\t\t\tif(e.type == 1){\n\t\t\t\twhile(!wait.empty()&&out[wait.front()]){ wait.pop(); }\n\t\t\t\tif(wait.empty()){\n\t\t\t\t\tint idxA = -1, idxB = -1, mScore = -1, MScore = -1;\n\t\t\t\t\tfor(int i=0;i<n;i++){\n\t\t\t\t\t\tif(c[i] < P[e.group]) continue;\n\t\t\t\t\t\tleft[0] = seat[i][0]==-1 ? 10000 : -1;\n\t\t\t\t\t\tfor(int j=1;j<c[i];j++){\n\t\t\t\t\t\t\tif(seat[i][j]!=-1) left[j] = -1;\n\t\t\t\t\t\t\telse if(left[j-1]==10000) left[j] = 10000;\n\t\t\t\t\t\t\telse left[j] = left[j-1]+1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tright[c[i]-1] = seat[i][c[i]-1]==-1 ? 10000 : -1;\n\t\t\t\t\t\tfor(int j=c[i]-2;j>=0;j--){\n\t\t\t\t\t\t\tif(seat[i][j]!=-1) right[j] = -1;\n\t\t\t\t\t\t\telse if(right[j+1]==10000) right[j] = 10000;\n\t\t\t\t\t\t\telse right[j] = right[j+1]+1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor(int j=0;j<c[i];j++){\n\t\t\t\t\t\t\tif(seat[i][j]!=-1) seq[j] = -1;\n\t\t\t\t\t\t\telse if(j==0) seq[j] = 0;\n\t\t\t\t\t\t\telse seq[j] = seq[j-1]+1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor(int j=0;j+P[e.group]-1<c[i];j++){\n\t\t\t\t\t\t\tif(left[j]!=-1&&seq[j]+P[e.group]-1==seq[j+P[e.group]-1]){\n\t\t\t\t\t\t\t\tif(idxA == -1||make_pair(mScore,MScore)<make_pair(min(left[j],right[j+P[e.group]-1]),max(left[j],right[j+P[e.group]-1]))){\n\t\t\t\t\t\t\t\t\tidxA = i; \n\t\t\t\t\t\t\t\t\tidxB = j; \n\t\t\t\t\t\t\t\t\tmScore = min(left[j],right[j+P[e.group]-1]);\n\t\t\t\t\t\t\t\t\tMScore = max(left[j],right[j+P[e.group]-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\tif(idxA == -1) { wait.push(e.group); continue; }\n\t\t\t\t\tfor(int i=0;i<P[e.group];i++) seat[idxA][idxB+i] = e.group;\n\t\t\t\t\tpos[e.group] = idxA;\n\t\t\t\t\tin[e.group] = true;\n\t\t\t\t\tscore[e.group] = 1.0;\n\t\t\t\t\tqu.push(Event(e.time+E[e.group], e.group, 0));\n\t\t\t\t} else {\n\t\t\t\t\twait.push(e.group);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(e.type == 2){\n\t\t\t\twhile(!wait.empty()){\n\t\t\t\t\tif(out[wait.front()]){ wait.pop(); continue; }\n\t\t\t\t\tint group = wait.front();\n\t\t\t\t\tint idxA = -1, idxB = -1, mScore = -1, MScore = -1;\n\t\t\t\t\tfor(int i=0;i<n;i++){\n\t\t\t\t\t\tif(c[i] < P[group]) continue;\n\t\t\t\t\t\tleft[0] = seat[i][0]==-1 ? 10000 : -1;\n\t\t\t\t\t\tfor(int j=1;j<c[i];j++){\n\t\t\t\t\t\t\tif(seat[i][j]!=-1) left[j] = -1;\n\t\t\t\t\t\t\telse if(left[j-1]==10000) left[j] = 10000;\n\t\t\t\t\t\t\telse left[j] = left[j-1]+1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tright[c[i]-1] = seat[i][c[i]-1]==-1 ? 10000 : -1;\n\t\t\t\t\t\tfor(int j=c[i]-2;j>=0;j--){\n\t\t\t\t\t\t\tif(seat[i][j]!=-1) right[j] = -1;\n\t\t\t\t\t\t\telse if(right[j+1]==10000) right[j] = 10000;\n\t\t\t\t\t\t\telse right[j] = right[j+1]+1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor(int j=0;j<c[i];j++){\n\t\t\t\t\t\t\tif(seat[i][j]!=-1) seq[j] = -1;\n\t\t\t\t\t\t\telse if(j==0) seq[j] = 0;\n\t\t\t\t\t\t\telse seq[j] = seq[j-1]+1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor(int j=0;j+P[group]-1<c[i];j++){\n\t\t\t\t\t\t\tif(left[j]!=-1&&seq[j]+P[group]-1==seq[j+P[group]-1]){\n\t\t\t\t\t\t\t\tif(idxA == -1||make_pair(mScore,MScore)<make_pair(min(left[j],right[j+P[group]-1]),max(left[j],right[j+P[group]-1]))){\n\t\t\t\t\t\t\t\t\tidxA = i; \n\t\t\t\t\t\t\t\t\tidxB = j; \n\t\t\t\t\t\t\t\t\tmScore = min(left[j],right[j+P[group]-1]);\n\t\t\t\t\t\t\t\t\tMScore = max(left[j],right[j+P[group]-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\tif(idxA == -1) break;\n\t\t\t\t\tfor(int i=0;i<P[group];i++) seat[idxA][idxB+i] = group;\n\t\t\t\t\tpos[group] = idxA;\n\n\t\t\t\t\tin[group] = true;\n\t\t\t\t\tscore[group] = (T[group]+W[group]-e.time)/(double)W[group];\n\t\t\t\t\tqu.push(Event(e.time+E[group], group, 0));\n\t\t\t\t\twait.pop();\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(e.type == 3){\n\t\t\t\tif(in[e.group] == true) continue;\n\t\t\t\tout[e.group] = true;\n\t\t\t\tscore[e.group] = -1.0;\n\t\t\t\tif(e.time<t) qu.push(Event(e.time,-1,2));\n\t\t\t}\n\t\t}\n\t\tdouble ans = 0.0;\n\t\tint sum = 0;\n\t\tfor(int i=0;i<m;i++){\n\t\t\tans += score[i]*P[i];\n\t\t\tsum += P[i];\n\t\t}\n\t\tprintf(\"%.10lf\\n\", ans/sum);\n\t}\n}","accuracy":1,"time_ms":1760,"memory_kb":1904,"score_of_the_acc":-1.1408,"final_rank":4},{"submission_id":"aoj_2055_133285","code_snippet":"#include<iostream>\n#include<cassert>\n#include<vector>\n#include<map>\n#include<cmath>\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)\n#define pb push_back\n#define ALL(C) (C).begin(),(C).end()\n\ntypedef long long ll;\n\nconst int N = 100;\nconst int M = 10000;\nconst int dinf=20000;\nconst ll inf = (1LL)<<50;\n\nclass Seat{\npublic:\n int a,b;\n ll time;\n bool operator<(const Seat & t)const{\n return a < t.a;\n }\n};\n\nint ind,amax,amin,al,ar;\n\nvoid update(int tindex,int l,int r,int posl,int posr){\n if (l > r)swap(l,r);\n \n if (ind==-1||\n (l>amin)||\n (l==amin&&r >amax)){\n //||(l==amin&&r==amax&&tindex < ind)||\n //(l==amin&&r==amax&&tindex==ind&&posl<al)){\n ind=tindex;\n amin=l;\n amax=r;\n al=posl;\n ar=posr;\n }\n}\n\nvoid makeupdate(int tindex,int b,int a,int cap,int req){\n int tmp = a-b-1;\n if (tmp < req)return;\n int val=tmp-req;\n int l,r;\n l=val/2;r=val/2;\n// if (tmp%2 == 1 && req%2 == 0){\n// r++;\n// }else if (tmp%2 == 0 && req%2 == 1){\n// r++;\n// }\n if (val%2 == 1)r++;\n update(tindex,l,r,b+1+l,a-1-r);\n}\n\nvoid check(int cap,vector<Seat> &info,int req,int tindex){\n if (info.size() == 0){\n if (req > cap)return;\n if(req-1<cap)update(tindex,dinf,dinf,0,req-1);\n return;\n }\n \n if (info[0].a >= req){\n update(tindex,dinf,info[0].a-req,0,req-1);\n } \n\n rep(i,(int)info.size()-1){\n makeupdate(tindex,info[i].b,info[i+1].a,cap,req);\n }\n\n if (cap-info[info.size()-1].b-1 >=req){\n update(tindex,cap-req-info[info.size()-1].b-1,dinf,cap-req,cap-1);\n }\n}\n\nvoid getseat(int n,vector<Seat> *a,int *cap,int req){\n rep(i,n){\n if (cap[i]>=req)check(cap[i],a[i],req,i);\n }\n}\n\ndouble solve(int n,int *cap,ll cl,int m,ll *come,int *num,ll *wait,ll *eat){\n ll now=-1;\n int top=0;\n double sum=0,div=0;\n vector<Seat> seat[N];\n rep(i,m)div+=num[i];\n \n while(top < m){\n ll fast=inf;\n rep(i,n){\n rep(j,seat[i].size()){\n\tfast=min(fast,seat[i][j].time);\n }\n }\n \n if (now < come[top] && come[top] < fast){//arrive\n now=come[top];\n }else if (fast != inf && fast > come[top]+wait[top]){//leave from queue\n now=come[top]+wait[top];\n sum+=(-1)*num[top];\n top++;\n }else now = fast;////leave from seat\n \n // cout << now <<\" \" << cl << endl;\n\n if (now >=cl)break;\n\n rep(i,n){\n for(int j=(int)seat[i].size()-1;j>=0;j--){\n\tif (seat[i][j].time <= now){\n\t seat[i].erase(seat[i].begin()+j);\n\t}\n }\n }\n\n// rep(i,n){\n// rep(j,seat[i].size()){\n// \tcout <<\"seat info \" <<i<<\" \" << seat[i][j].a <<\" \" << seat[i][j].b <<\" \" << seat[i][j].time<<endl;\n// }\n// }\n \n while(top < m){\n while(top<m){\n\tif (now > come[top]+wait[top]){\n\t sum+=(-1)*num[top];\n\t}else break;\n\ttop++;\n }\n \n if (top == m || now < come[top])break;\n \n ind=-1;\n getseat(n,seat,cap,num[top]);\n if (ind == -1)break;\n \n seat[ind].pb((Seat){al,ar,now+eat[top]});\n // cout << top <<\" can sit \" << ind <<\" \" << al <<\" \" << ar <<\" \"<<\n //\tnow <<\" \" << now+eat[top] << endl;\n sort(ALL(seat[ind]));\n sum+=((wait[top]-(now-come[top]))/(double)wait[top])*num[top];\n top++;\n }\n }\n REP(i,top,m)sum+=(-1)*num[i];\n return sum/div;\n}\n\nmain(){\n int n,m;\n ll t;\n int cap[N];\n int num[M];\n ll come[M],wait[M],eat[M];\n while(cin>>n>>m>>t && n){\n rep(i,n)cin>>cap[i];\n rep(i,m)cin>>come[i]>>num[i]>>wait[i]>>eat[i];\n printf(\"%.16lf\\n\",solve(n,cap,t,m,come,num,wait,eat));\n }\n return false;\n}\n\n\n/*\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29\n0 0 0 x x x 4 4 4 7 7 7 2 2 2 8 8 8 3 3 3 9 9 9 1 1 1 \n*/","accuracy":1,"time_ms":1190,"memory_kb":1428,"score_of_the_acc":-0.6042,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2055_9149012\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define chmin(x,y) x = min(x,y)\\n#define chmax(x,y) x = max(x,y)\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n#define SIZE 105\\n#define SIZE2 10005\\n\\nenum Type{\\n\\ttype_END,\\n\\ttype_ATE,\\n\\ttype_WAIT_OUT,\\n\\ttype_IN,\\n};\\n\\nstruct Info{\\n\\n\\tint T,P,W,E;\\n};\\n\\nstruct Event{\\n\\tEvent(int arg_T,int arg_ind,Type arg_type){\\n\\t\\tT = arg_T;\\n\\t\\tind = arg_ind;\\n\\t\\ttype = arg_type;\\n\\t}\\n\\tEvent(){\\n\\n\\t\\tT = ind = 0;\\n\\t\\ttype = type_IN;\\n\\t}\\n\\tbool operator<(const struct Event &arg) const{\\n\\t\\tif(T != arg.T){\\n\\n\\t\\t\\treturn T > arg.T; //時刻の昇順(PQ)\\n\\t\\t}else{\\n\\n\\t\\t\\treturn type > arg.type; //退出を先に処理(PQ)\\n\\t\\t}\\n\\t}\\n\\n\\tint T,ind;\\n\\tType type;\\n};\\n\\nstruct DATA{\\n\\tvoid set(int arg_ind,int arg_SL,int arg_SR){\\n\\t\\tind = arg_ind;\\n\\t\\tSL = arg_SL;\\n\\t\\tSR = arg_SR;\\n\\t}\\n\\n\\tint ind,SL,SR;\\n};\\n\\nstruct LOC{\\n\\tvoid set(int arg_c_ind,int arg_left){\\n\\t\\tc_ind = arg_c_ind;\\n\\t\\tleft = arg_left;\\n\\t}\\n\\n\\tint c_ind,left;\\n};\\n\\nint N,M,LAST;\\nint C[SIZE]; //各カウンターに何席あるか\\nmap<int,int> REV; //来店時刻からグループ番を引く\\nmap<int,bool> MAP;\\nbool table[SIZE][SIZE],after_wait[SIZE2];\\nint nearL[SIZE][SIZE],nearR[SIZE][SIZE];\\nint C_IND[SIZE2],LEFT[SIZE2];\\nInfo info[SIZE2];\\n\\n//カウンター[c_ind]で、グループ[ind]が座る位置を探す(なければ-1)を返却\\nDATA searchPos(int c_ind,int ind){ //100\\n\\n\\tDATA ret;\\n\\tret.set(BIG_NUM,-1,-1);\\n\\n\\tint min_maxi= -BIG_NUM,max_maxi = -BIG_NUM;\\n\\tint len = info[ind].P;\\n\\n\\tfor(int i = 1; i+len-1 <= C[c_ind]; i++){ //左端候補を走査\\n\\n\\t\\tif((nearR[c_ind][i] <= i+len-1))continue;\\n\\n\\t\\tint SL = min(BIG_NUM,(i-nearL[c_ind][i])-1);\\n\\t\\tint SR = min(BIG_NUM,(nearR[c_ind][i+len-1]-(i+len-1)-1));\\n\\n\\t\\tif(min(SL,SR) < min_maxi)continue;\\n\\n\\t\\tif(min(SL,SR) > min_maxi){ //最小値の最大値更新\\n\\n\\t\\t\\tmin_maxi = min(SL,SR);\\n\\t\\t\\tmax_maxi = max(SL,SR);\\n\\t\\t\\tret.set(i,SL,SR);\\n\\n\\t\\t}else if(min(SL,SR) == min_maxi){ //最小値の最大値が同点\\n\\n\\t\\t\\tif(max(SL,SR) > max_maxi){ //最大値更新\\n\\n\\t\\t\\t\\tmax_maxi = max(SL,SR);\\n\\t\\t\\t\\tret.set(i,SL,SR);\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nvoid updateDATA(int ind,bool is_in){ //カウンターの状態の更新\\n\\n\\tint c_ind = C_IND[ind];\\n\\tint left = LEFT[ind];\\n\\tint len = info[ind].P;\\n\\n\\tfor(int i = left; i <= left+len-1; i++){\\n\\n\\t\\tif(is_in){ //新しく座る\\n\\n\\t\\t\\ttable[c_ind][i] = true;\\n\\n\\t\\t}else{ //席を立つ\\n\\n\\t\\t\\ttable[c_ind][i] = false;\\n\\t\\t}\\n\\t}\\n\\n\\t//nearLの再計算\\n\\tint last = -(BIG_NUM+SIZE);\\n\\tfor(int i = 1; i <= C[c_ind]; i++){\\n\\n\\t\\tif(table[c_ind][i]){\\n\\n\\t\\t\\tlast = i;\\n\\t\\t\\tnearL[c_ind][i] = i;\\n\\t\\t}else{\\n\\n\\t\\t\\tnearL[c_ind][i] = last;\\n\\t\\t}\\n\\t}\\n\\n\\t//nearRの再計算\\n\\tlast = BIG_NUM+SIZE;\\n\\tfor(int i = C[c_ind]; i >= 1; i--){\\n\\n\\t\\tif(table[c_ind][i]){\\n\\n\\t\\t\\tlast = i;\\n\\t\\t\\tnearR[c_ind][i] = i;\\n\\t\\t}else{\\n\\n\\t\\t\\tnearR[c_ind][i] = last;\\n\\t\\t}\\n\\t}\\n}\\n\\nLOC searchLOC(int ind){ //座れるカウンターと、その位置を調べる\\n\\n\\tLOC ret;\\n\\n\\tret.set(-1,-1);\\n\\n\\tint min_maxi = -BIG_NUM,max_maxi = -BIG_NUM;\\n\\n\\n\\tfor(int i = 0; i < N; i++){ //N個のカウンターすべてを見る\\n\\n\\t\\tDATA tmpD = searchPos(i,ind);\\n\\t\\tif(tmpD.ind == BIG_NUM)continue; //座れる場所なし\\n\\n\\t\\tif(min_maxi < min(tmpD.SL,tmpD.SR)){ //最小値の最大値更新\\n\\t\\t\\tmin_maxi = min(tmpD.SL,tmpD.SR);\\n\\t\\t\\tmax_maxi = max(tmpD.SL,tmpD.SR);\\n\\t\\t\\tret.set(i,tmpD.ind);\\n\\n\\t\\t}else if(min_maxi == min(tmpD.SL,tmpD.SR)){ //最小値の最大値が同点\\n\\n\\t\\t\\tif(max_maxi < max(tmpD.SL,tmpD.SR)){ //最大値の最大値更新\\n\\n\\t\\t\\t\\tmax_maxi = max(tmpD.SL,tmpD.SR);\\n\\t\\t\\t\\tret.set(i,tmpD.ind);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nvoid func(){\\n\\n\\tMAP.clear();\\n\\tREV.clear();\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&C[i]);\\n\\t}\\n\\n\\tpriority_queue<Event> Q;\\n\\n\\tint div = 0;\\n\\n\\tfor(int i = 0; i < M; i++){//グループの情報を取得\\n\\n\\t\\tscanf(\\\"%d %d %d %d\\\",&info[i].T,&info[i].P,&info[i].W,&info[i].E);\\n\\n\\t\\tREV[info[i].T] = i; //来店時刻による逆引き表\\n\\t\\tdiv += info[i].P;\\n\\n\\t\\tQ.push(Event(info[i].T,i,type_IN));\\n\\t}\\n\\n\\tQ.push(Event(LAST,-1,type_END)); //閉店\\n\\n\\t//カウンターの情報の初期化\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 1; k <= C[i]; k++){\\n\\n\\t\\t\\ttable[i][k] = false;\\n\\t\\t\\tnearL[i][k] = -(BIG_NUM+SIZE); //kおよびkより左で、最も近い、誰かが座っている椅子の番号\\n\\t\\t\\tnearR[i][k] = BIG_NUM+SIZE; //kおよびkより右で、最も近い、誰かが座っている椅子の番号\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tafter_wait[i] = false;\\n\\t\\tC_IND[i] = -1;\\n\\t}\\n\\n\\n\\tint now = 0;\\n\\tdouble ans = 0;\\n\\n\\twhile(!Q.empty()){\\n\\t\\tEvent event = Q.top();\\n\\t\\tQ.pop();\\n\\n\\t\\tnow = event.T;\\n\\n\\t\\tif(now == LAST)break;\\n\\n\\t\\tif(event.type == type_IN){ //来店\\n\\n\\t\\t\\tif(MAP.size() > 0){ //待ち行列あり\\n\\n\\t\\t\\t\\tMAP[info[event.ind].T] = true; //待ち行列に加える\\n\\t\\t\\t\\tQ.push(Event(now+info[event.ind].W,event.ind,type_WAIT_OUT)); //食べずに退店イベントの追加\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\t//MAP.size() == 0\\n\\n\\t\\t\\tLOC loc = searchLOC(event.ind); //座れるカウンターと、その位置を調べる\\n\\n\\t\\t\\tif(loc.c_ind == -1){ //現在座れる椅子がなかった場合\\n\\n\\t\\t\\t\\tMAP[info[event.ind].T] = true; //待ち行列に加える\\n\\t\\t\\t\\tQ.push(Event(now+info[event.ind].W,event.ind,type_WAIT_OUT)); //食べずに退店イベントの追加\\n\\n\\t\\t\\t}else{ //現在座れる椅子があった場合\\n\\n\\t\\t\\t\\tans += 1.0*info[event.ind].P; //待ち時間0\\n\\n\\t\\t\\t\\tC_IND[event.ind] = loc.c_ind;\\n\\t\\t\\t\\tLEFT[event.ind] = loc.left;\\n\\n\\t\\t\\t\\tupdateDATA(event.ind,true);\\n\\n\\t\\t\\t\\tQ.push(Event(now+info[event.ind].E,event.ind,type_ATE)); //食べ終わって退店イベントの追加\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //type_ATE または type_WAIT_OUT\\n\\n\\t\\t\\tbool FLG = true; //待ち行列を消化して良いか\\n\\n\\t\\t\\tset<int> SET;\\n\\n\\t\\t\\tif(event.type == type_ATE){ //食べ終わり\\n\\n\\t\\t\\t\\t//■同時刻に退店するグループを、全て出す(食べて退店)→待ち行列にはいないはず\\n\\t\\t\\t\\twhile(true){\\n\\n\\t\\t\\t\\t\\t//退店処理\\n\\t\\t\\t\\t\\tupdateDATA(event.ind,false);\\n\\n\\t\\t\\t\\t\\tif(Q.empty() || Q.top().T != now || Q.top().type != type_ATE)break;\\n\\n\\t\\t\\t\\t\\tevent = Q.top();\\n\\t\\t\\t\\t\\tQ.pop();\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else if(event.type == type_WAIT_OUT){\\n\\n\\t\\t\\t\\t//■同時刻に退店するグループを、全て出す(食べずに退店)\\n\\n\\t\\t\\t\\twhile(true){\\n\\n\\t\\t\\t\\t\\tif(!after_wait[event.ind]){ //待っている途中で席に座らなかった場合\\n\\n\\t\\t\\t\\t\\t\\tSET.insert(event.ind); //待ち行列にいるはず\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(Q.empty() || Q.top().T != now || Q.top().type != type_WAIT_OUT)break;\\n\\n\\t\\t\\t\\t\\tevent = Q.top();\\n\\t\\t\\t\\t\\tQ.pop();\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(SET.size() == 0)continue; //有効な情報なし\\n\\n\\t\\t\\t\\tif(MAP.size() > 0){\\n\\n\\t\\t\\t\\t\\tint work_ind = REV[MAP.begin()->first]; //待ち集団の先頭\\n\\n\\t\\t\\t\\t\\tif(SET.count(work_ind) > 0){ //待ち集団の先頭の退出時刻が到来した場合\\n\\n\\t\\t\\t\\t\\t\\t//■■まずは先頭を消す\\n\\t\\t\\t\\t\\t\\tans -= 1.0*info[work_ind].P;\\n\\n\\t\\t\\t\\t\\t\\tMAP.erase(info[work_ind].T);\\n\\n\\t\\t\\t\\t\\t\\tSET.erase(work_ind);\\n\\n\\t\\t\\t\\t\\t}else{ //待ち行列の先頭が、引き続き待つ場合\\n\\n\\t\\t\\t\\t\\t\\tFLG = false; //待ち行列は消化しない\\n\\n\\t\\t\\t\\t\\t\\tfor(int g: SET){\\n\\n\\t\\t\\t\\t\\t\\t\\tans -= 1.0*info[g].P;\\n\\t\\t\\t\\t\\t\\t\\tMAP.erase(info[g].T);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tSET.clear();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\t//FLG == true;\\n\\n\\t\\t\\t//新たに座れるようになった人々を座らせる\\n\\t\\t\\twhile(true){\\n\\n\\t\\t\\t\\tif(MAP.size() == 0)break;\\n\\n\\t\\t\\t\\tauto at = MAP.begin();\\n\\t\\t\\t\\tint tmp_ind = REV[at->first]; //待ち行列の先頭グループ\\n\\n\\t\\t\\t\\tLOC loc = searchLOC(tmp_ind);\\n\\n\\t\\t\\t\\tif(loc.c_ind == -1){\\n\\t\\t\\t\\t\\tif(now == info[tmp_ind].T+info[tmp_ind].W){\\n\\n\\t\\t\\t\\t\\t\\tMAP.erase(info[tmp_ind].T);\\n\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tbreak; //まだ座れない\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tafter_wait[tmp_ind] = true;\\n\\n\\t\\t\\t\\tdouble bunshi = info[tmp_ind].W - (now-info[tmp_ind].T);\\n\\t\\t\\t\\tdouble bunbo = info[tmp_ind].W;\\n\\n\\t\\t\\t\\tans += (bunshi/bunbo)*info[tmp_ind].P;\\n\\n\\t\\t\\t\\tC_IND[tmp_ind] = loc.c_ind;\\n\\t\\t\\t\\tLEFT[tmp_ind] = loc.left;\\n\\t\\t\\t\\tupdateDATA(tmp_ind,true);\\n\\n\\t\\t\\t\\tQ.push(Event(now+info[tmp_ind].E,tmp_ind,type_ATE));\\n\\n\\t\\t\\t\\tSET.erase(tmp_ind);\\n\\t\\t\\t\\tMAP.erase(info[tmp_ind].T);\\n\\t\\t\\t}\\n\\n\\t\\t\\t//■■席に座れなかった、退出予定時刻到来者を待ち行列から消す\\n\\t\\t\\tfor(int g: SET){\\n\\n\\t\\t\\t\\tans -= 1.0*info[g].P;\\n\\t\\t\\t\\tMAP.erase(info[g].T);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(auto at = MAP.begin(); at != MAP.end(); at++){\\n\\n\\t\\tint tmp_ind = REV[at->first];\\n\\t\\tans -= 1.0*info[tmp_ind].P;\\n\\t}\\n\\n\\tprintf(\\\"%.16lf\\\\n\\\",ans/div);\\n}\\n\\nint main(){\\n\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d %d\\\",&N,&M,&LAST);\\n\\t\\tif(N == 0 && M == 0 && LAST == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 4808,\n \"score_of_the_acc\": -1,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2055_472123\",\n \"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\\nclass Data\\n{\\npublic:\\n long long time;\\n int id;\\n int kind; // 0 : 客の来店\\n // 1 : 待ち時間が長く帰宅\\n // 2 : 食事を終えて帰宅\\n // 3 : 閉店\\n Data(long long time0, int id0, int kind0){\\n time = time0;\\n id = id0;\\n kind = kind0;\\n }\\n bool operator< (const Data& d) const{\\n return make_pair(time, kind) < make_pair(d.time, d.kind);\\n }\\n};\\n\\npair<int, int> findCounter(const vector<vector<bool> >& used, int num)\\n{\\n int n = used.size();\\n\\n int sl = -1;\\n int sr = -1;\\n pair<int, int> ret(-1, -1);\\n for(int i=0; i<n; ++i){\\n int m = used[i].size();\\n int size = 0;\\n for(int j=0; j<m; ++j){\\n if(used[i][j]){\\n size = 0;\\n continue;\\n }\\n\\n ++ size;\\n if(size >= num){\\n int sl2;\\n int sr2;\\n int k;\\n if(j+1 == size && j == m-1){\\n sl2 = sr2 = INT_MAX;\\n k = 0;\\n }else if(j+1 == size){\\n sl2 = INT_MAX;\\n sr2 = size - num;\\n k = 0;\\n }else if(j == m-1){\\n sl2 = size - num;\\n sr2 = INT_MAX;\\n k = j - num + 1;\\n }else{\\n sl2 = (size - num) / 2;\\n sr2 = (size - num + 1) / 2;\\n k = j - size + (size - num) / 2 + 1;\\n }\\n if(min(sl2, sr2) > min(sl, sr) || (min(sl2, sr2) == min(sl, sr) && max(sl2, sr2) > max(sl, sr))){\\n sl = sl2;\\n sr = sr2;\\n ret = make_pair(i, k);\\n }\\n }\\n }\\n }\\n\\n return ret;\\n}\\n\\nint main()\\n{\\n for(;;){\\n int n, m, closeTime; // カウンター数、グループ数、閉店時間\\n cin >> n >> m >> closeTime;\\n if(n == 0)\\n return 0;\\n\\n vector<int> counter(n); // 各カウンターの席の数\\n for(int i=0; i<n; ++i)\\n cin >> counter[i];\\n vector<vector<bool> > used(n); // 使用中のカウンターの席\\n for(int i=0; i<n; ++i)\\n used[i].assign(counter[i], false);\\n\\n vector<int> come(m), num(m), wait(m), eat(m); // 来店時間、各グループの客の人数、最大待ち時間、食事時間\\n for(int i=0; i<m; ++i)\\n cin >> come[i] >> num[i] >> wait[i] >> eat[i];\\n\\n multiset<Data> ms;\\n ms.insert(Data(closeTime, -1, 3));\\n for(int i=0; i<m; ++i){\\n ms.insert(Data(come[i], i, 0));\\n ms.insert(Data(come[i] + wait[i], i, 1));\\n }\\n\\n queue<int> q; // 待っているグループ\\n vector<pair<int, int> > sit(m); // 各グループが使っているカウンターの位置\\n vector<double> satisfaction(m, -1.0); // 各グループの満足度\\n bool isClose = false; // 閉店時間を過ぎたかどうか\\n while(!ms.empty()){\\n long long time = ms.begin()->time;\\n while(!ms.empty() && ms.begin()->time == time){\\n Data d = *ms.begin();\\n ms.erase(ms.begin());\\n\\n if(d.kind == 0){\\n q.push(d.id);\\n }else if(d.kind == 2){\\n for(int i=0; i<num[d.id]; ++i)\\n used[sit[d.id].first][sit[d.id].second + i] = false;\\n }else if(d.kind == 3){\\n isClose = true;\\n }\\n }\\n if(isClose)\\n break;\\n\\n while(!q.empty()){\\n int id = q.front();\\n if(time > come[id] + wait[id]){\\n q.pop();\\n continue;\\n }\\n\\n pair<int, int> pos = findCounter(used, num[id]);\\n if(pos.first == -1){\\n if(time == come[id] + wait[id]){\\n q.pop();\\n continue;\\n }\\n break;\\n }\\n\\n q.pop();\\n for(int i=0; i<num[id]; ++i)\\n used[pos.first][pos.second + i] = true;\\n sit[id] = pos;\\n satisfaction[id] = (wait[id] - (time - come[id])) / (double)wait[id];\\n ms.insert(Data(time + eat[id], id, 2));\\n }\\n }\\n\\n double ret = 0.0;\\n for(int i=0; i<m; ++i)\\n ret += satisfaction[i] * num[i];\\n ret /= accumulate(num.begin(), num.end(), 0);\\n printf(\\\"%.10f\\\\n\\\", ret);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1090,\n \"memory_kb\": 2784,\n \"score_of_the_acc\": -0.9359,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2055_361601\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <cstring>\\n\\nusing namespace std;\\n\\nclass Event{\\npublic:\\n\\tint time, group, type;\\n\\tEvent(int t, int g, int p) : time(t), group(g), type(p) {}\\n\\tbool operator < (const Event &e) const { return make_pair(time,type) > make_pair(e.time,e.type); }\\n};\\n\\nint main(){\\n\\tint n, m, t;\\n\\tint c[100], pos[10000], T[10000], P[10000], W[10000], E[10000];\\n\\tint seat[100][100];\\n\\tint left[100], right[100], seq[100];\\n\\tbool out[10000], in[10000];\\n\\tdouble score[10000];\\n\\twhile(cin >> n >> m >> t, n){\\n\\t\\tfor(int i=0;i<n;i++) cin >> c[i];\\n\\t\\tmemset(pos, -1, sizeof(pos));\\n\\t\\tmemset(out,false,sizeof(out));\\n\\t\\tmemset(in, false,sizeof(in));\\n\\t\\tmemset(seat, -1, sizeof(seat));\\n\\t\\tpriority_queue<Event> qu;\\n\\t\\tqueue<int> wait;\\n\\t\\tfor(int i=0;i<m;i++){\\n\\t\\t\\tcin >> T[i] >> P[i] >> W[i] >> E[i];\\n\\t\\t\\tqu.push(Event(T[i],i,1));\\n\\t\\t\\tqu.push(Event(T[i]+W[i],i,3));\\n\\t\\t}\\n\\t\\twhile(!qu.empty()){\\n\\t\\t\\tEvent e = qu.top(); qu.pop();\\n\\t\\t\\tif(e.type == 0){\\n\\t\\t\\t\\tfor(int i=0;i<c[pos[e.group]];i++){\\n\\t\\t\\t\\t\\tif(seat[pos[e.group]][i] == e.group) seat[pos[e.group]][i] = -1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(e.time<t) qu.push(Event(e.time,-1,2));\\n\\t\\t\\t}\\n\\t\\t\\tif(e.type == 1){\\n\\t\\t\\t\\twhile(!wait.empty()&&out[wait.front()]){ wait.pop(); }\\n\\t\\t\\t\\tif(wait.empty()){\\n\\t\\t\\t\\t\\tint idxA = -1, idxB = -1, mScore = -1, MScore = -1;\\n\\t\\t\\t\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\t\\t\\t\\tif(c[i] < P[e.group]) continue;\\n\\t\\t\\t\\t\\t\\tleft[0] = seat[i][0]==-1 ? 10000 : -1;\\n\\t\\t\\t\\t\\t\\tfor(int j=1;j<c[i];j++){\\n\\t\\t\\t\\t\\t\\t\\tif(seat[i][j]!=-1) left[j] = -1;\\n\\t\\t\\t\\t\\t\\t\\telse if(left[j-1]==10000) left[j] = 10000;\\n\\t\\t\\t\\t\\t\\t\\telse left[j] = left[j-1]+1;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tright[c[i]-1] = seat[i][c[i]-1]==-1 ? 10000 : -1;\\n\\t\\t\\t\\t\\t\\tfor(int j=c[i]-2;j>=0;j--){\\n\\t\\t\\t\\t\\t\\t\\tif(seat[i][j]!=-1) right[j] = -1;\\n\\t\\t\\t\\t\\t\\t\\telse if(right[j+1]==10000) right[j] = 10000;\\n\\t\\t\\t\\t\\t\\t\\telse right[j] = right[j+1]+1;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tfor(int j=0;j<c[i];j++){\\n\\t\\t\\t\\t\\t\\t\\tif(seat[i][j]!=-1) seq[j] = -1;\\n\\t\\t\\t\\t\\t\\t\\telse if(j==0) seq[j] = 0;\\n\\t\\t\\t\\t\\t\\t\\telse seq[j] = seq[j-1]+1;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tfor(int j=0;j+P[e.group]-1<c[i];j++){\\n\\t\\t\\t\\t\\t\\t\\tif(left[j]!=-1&&seq[j]+P[e.group]-1==seq[j+P[e.group]-1]){\\n\\t\\t\\t\\t\\t\\t\\t\\tif(idxA == -1||make_pair(mScore,MScore)<make_pair(min(left[j],right[j+P[e.group]-1]),max(left[j],right[j+P[e.group]-1]))){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tidxA = i; \\n\\t\\t\\t\\t\\t\\t\\t\\t\\tidxB = j; \\n\\t\\t\\t\\t\\t\\t\\t\\t\\tmScore = min(left[j],right[j+P[e.group]-1]);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tMScore = max(left[j],right[j+P[e.group]-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\\tif(idxA == -1) { wait.push(e.group); continue; }\\n\\t\\t\\t\\t\\tfor(int i=0;i<P[e.group];i++) seat[idxA][idxB+i] = e.group;\\n\\t\\t\\t\\t\\tpos[e.group] = idxA;\\n\\t\\t\\t\\t\\tin[e.group] = true;\\n\\t\\t\\t\\t\\tscore[e.group] = 1.0;\\n\\t\\t\\t\\t\\tqu.push(Event(e.time+E[e.group], e.group, 0));\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\twait.push(e.group);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(e.type == 2){\\n\\t\\t\\t\\twhile(!wait.empty()){\\n\\t\\t\\t\\t\\tif(out[wait.front()]){ wait.pop(); continue; }\\n\\t\\t\\t\\t\\tint group = wait.front();\\n\\t\\t\\t\\t\\tint idxA = -1, idxB = -1, mScore = -1, MScore = -1;\\n\\t\\t\\t\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\t\\t\\t\\tif(c[i] < P[group]) continue;\\n\\t\\t\\t\\t\\t\\tleft[0] = seat[i][0]==-1 ? 10000 : -1;\\n\\t\\t\\t\\t\\t\\tfor(int j=1;j<c[i];j++){\\n\\t\\t\\t\\t\\t\\t\\tif(seat[i][j]!=-1) left[j] = -1;\\n\\t\\t\\t\\t\\t\\t\\telse if(left[j-1]==10000) left[j] = 10000;\\n\\t\\t\\t\\t\\t\\t\\telse left[j] = left[j-1]+1;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tright[c[i]-1] = seat[i][c[i]-1]==-1 ? 10000 : -1;\\n\\t\\t\\t\\t\\t\\tfor(int j=c[i]-2;j>=0;j--){\\n\\t\\t\\t\\t\\t\\t\\tif(seat[i][j]!=-1) right[j] = -1;\\n\\t\\t\\t\\t\\t\\t\\telse if(right[j+1]==10000) right[j] = 10000;\\n\\t\\t\\t\\t\\t\\t\\telse right[j] = right[j+1]+1;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tfor(int j=0;j<c[i];j++){\\n\\t\\t\\t\\t\\t\\t\\tif(seat[i][j]!=-1) seq[j] = -1;\\n\\t\\t\\t\\t\\t\\t\\telse if(j==0) seq[j] = 0;\\n\\t\\t\\t\\t\\t\\t\\telse seq[j] = seq[j-1]+1;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tfor(int j=0;j+P[group]-1<c[i];j++){\\n\\t\\t\\t\\t\\t\\t\\tif(left[j]!=-1&&seq[j]+P[group]-1==seq[j+P[group]-1]){\\n\\t\\t\\t\\t\\t\\t\\t\\tif(idxA == -1||make_pair(mScore,MScore)<make_pair(min(left[j],right[j+P[group]-1]),max(left[j],right[j+P[group]-1]))){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tidxA = i; \\n\\t\\t\\t\\t\\t\\t\\t\\t\\tidxB = j; \\n\\t\\t\\t\\t\\t\\t\\t\\t\\tmScore = min(left[j],right[j+P[group]-1]);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tMScore = max(left[j],right[j+P[group]-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\\tif(idxA == -1) break;\\n\\t\\t\\t\\t\\tfor(int i=0;i<P[group];i++) seat[idxA][idxB+i] = group;\\n\\t\\t\\t\\t\\tpos[group] = idxA;\\n\\n\\t\\t\\t\\t\\tin[group] = true;\\n\\t\\t\\t\\t\\tscore[group] = (T[group]+W[group]-e.time)/(double)W[group];\\n\\t\\t\\t\\t\\tqu.push(Event(e.time+E[group], group, 0));\\n\\t\\t\\t\\t\\twait.pop();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(e.type == 3){\\n\\t\\t\\t\\tif(in[e.group] == true) continue;\\n\\t\\t\\t\\tout[e.group] = true;\\n\\t\\t\\t\\tscore[e.group] = -1.0;\\n\\t\\t\\t\\tif(e.time<t) qu.push(Event(e.time,-1,2));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdouble ans = 0.0;\\n\\t\\tint sum = 0;\\n\\t\\tfor(int i=0;i<m;i++){\\n\\t\\t\\tans += score[i]*P[i];\\n\\t\\t\\tsum += P[i];\\n\\t\\t}\\n\\t\\tprintf(\\\"%.10lf\\\\n\\\", ans/sum);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1760,\n \"memory_kb\": 1904,\n \"score_of_the_acc\": -1.1408,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2055_133285\",\n \"code_snippet\": \"#include<iostream>\\n#include<cassert>\\n#include<vector>\\n#include<map>\\n#include<cmath>\\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)\\n#define pb push_back\\n#define ALL(C) (C).begin(),(C).end()\\n\\ntypedef long long ll;\\n\\nconst int N = 100;\\nconst int M = 10000;\\nconst int dinf=20000;\\nconst ll inf = (1LL)<<50;\\n\\nclass Seat{\\npublic:\\n int a,b;\\n ll time;\\n bool operator<(const Seat & t)const{\\n return a < t.a;\\n }\\n};\\n\\nint ind,amax,amin,al,ar;\\n\\nvoid update(int tindex,int l,int r,int posl,int posr){\\n if (l > r)swap(l,r);\\n \\n if (ind==-1||\\n (l>amin)||\\n (l==amin&&r >amax)){\\n //||(l==amin&&r==amax&&tindex < ind)||\\n //(l==amin&&r==amax&&tindex==ind&&posl<al)){\\n ind=tindex;\\n amin=l;\\n amax=r;\\n al=posl;\\n ar=posr;\\n }\\n}\\n\\nvoid makeupdate(int tindex,int b,int a,int cap,int req){\\n int tmp = a-b-1;\\n if (tmp < req)return;\\n int val=tmp-req;\\n int l,r;\\n l=val/2;r=val/2;\\n// if (tmp%2 == 1 && req%2 == 0){\\n// r++;\\n// }else if (tmp%2 == 0 && req%2 == 1){\\n// r++;\\n// }\\n if (val%2 == 1)r++;\\n update(tindex,l,r,b+1+l,a-1-r);\\n}\\n\\nvoid check(int cap,vector<Seat> &info,int req,int tindex){\\n if (info.size() == 0){\\n if (req > cap)return;\\n if(req-1<cap)update(tindex,dinf,dinf,0,req-1);\\n return;\\n }\\n \\n if (info[0].a >= req){\\n update(tindex,dinf,info[0].a-req,0,req-1);\\n } \\n\\n rep(i,(int)info.size()-1){\\n makeupdate(tindex,info[i].b,info[i+1].a,cap,req);\\n }\\n\\n if (cap-info[info.size()-1].b-1 >=req){\\n update(tindex,cap-req-info[info.size()-1].b-1,dinf,cap-req,cap-1);\\n }\\n}\\n\\nvoid getseat(int n,vector<Seat> *a,int *cap,int req){\\n rep(i,n){\\n if (cap[i]>=req)check(cap[i],a[i],req,i);\\n }\\n}\\n\\ndouble solve(int n,int *cap,ll cl,int m,ll *come,int *num,ll *wait,ll *eat){\\n ll now=-1;\\n int top=0;\\n double sum=0,div=0;\\n vector<Seat> seat[N];\\n rep(i,m)div+=num[i];\\n \\n while(top < m){\\n ll fast=inf;\\n rep(i,n){\\n rep(j,seat[i].size()){\\n\\tfast=min(fast,seat[i][j].time);\\n }\\n }\\n \\n if (now < come[top] && come[top] < fast){//arrive\\n now=come[top];\\n }else if (fast != inf && fast > come[top]+wait[top]){//leave from queue\\n now=come[top]+wait[top];\\n sum+=(-1)*num[top];\\n top++;\\n }else now = fast;////leave from seat\\n \\n // cout << now <<\\\" \\\" << cl << endl;\\n\\n if (now >=cl)break;\\n\\n rep(i,n){\\n for(int j=(int)seat[i].size()-1;j>=0;j--){\\n\\tif (seat[i][j].time <= now){\\n\\t seat[i].erase(seat[i].begin()+j);\\n\\t}\\n }\\n }\\n\\n// rep(i,n){\\n// rep(j,seat[i].size()){\\n// \\tcout <<\\\"seat info \\\" <<i<<\\\" \\\" << seat[i][j].a <<\\\" \\\" << seat[i][j].b <<\\\" \\\" << seat[i][j].time<<endl;\\n// }\\n// }\\n \\n while(top < m){\\n while(top<m){\\n\\tif (now > come[top]+wait[top]){\\n\\t sum+=(-1)*num[top];\\n\\t}else break;\\n\\ttop++;\\n }\\n \\n if (top == m || now < come[top])break;\\n \\n ind=-1;\\n getseat(n,seat,cap,num[top]);\\n if (ind == -1)break;\\n \\n seat[ind].pb((Seat){al,ar,now+eat[top]});\\n // cout << top <<\\\" can sit \\\" << ind <<\\\" \\\" << al <<\\\" \\\" << ar <<\\\" \\\"<<\\n //\\tnow <<\\\" \\\" << now+eat[top] << endl;\\n sort(ALL(seat[ind]));\\n sum+=((wait[top]-(now-come[top]))/(double)wait[top])*num[top];\\n top++;\\n }\\n }\\n REP(i,top,m)sum+=(-1)*num[i];\\n return sum/div;\\n}\\n\\nmain(){\\n int n,m;\\n ll t;\\n int cap[N];\\n int num[M];\\n ll come[M],wait[M],eat[M];\\n while(cin>>n>>m>>t && n){\\n rep(i,n)cin>>cap[i];\\n rep(i,m)cin>>come[i]>>num[i]>>wait[i]>>eat[i];\\n printf(\\\"%.16lf\\\\n\\\",solve(n,cap,t,m,come,num,wait,eat));\\n }\\n return false;\\n}\\n\\n\\n/*\\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29\\n0 0 0 x x x 4 4 4 7 7 7 2 2 2 8 8 8 3 3 3 9 9 9 1 1 1 \\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 1190,\n \"memory_kb\": 1428,\n \"score_of_the_acc\": -0.6042,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1083,"cells":{"group_id":{"kind":"string","value":"aoj_2051_cpp"},"problem_description":{"kind":"string","value":"Problem D:\nRotation Estimation\nMr. Nod is an astrologist and has defined a new constellation. He took two photos of the\nconstellation to foretell a future of his friend. The constellation consists of\nn\nstars. The shape\nof the constellation in these photos are the same, but the angle of them are different because\nthese photos were taken on a different day. He foretells a future by the difference of the angle\nof them.\nYour job is to write a program to calculate the difference of the angle of two constellation.\nInput\nThe input is a sequence of datasets. Each dataset is given in the following format:\nn\nx\n1,1\ny\n1,1\n...\nx\n1,\nn\ny\n1,\nn\nx\n2,1\ny\n2,1\n...\nx\n2,\nn\ny\n2,\nn\nThe first line of each dataset contains a positive integers\nn\n(\nn\n≤ 1,000). The next\nn\nlines contain\ntwo real numbers\nx\n1,\ni\nand\ny\n1,\ni\n(|\nx\n1,\ni\n|, |\ny\n1,\ni\n| ≤ 100), where (\nx\n1,\ni\n,\ny\n1,\ni\n) denotes the coordinates of\nthe\ni\n-th star of the constellation in the first photo. The next\nn\nlines contain two real numbers\nx\n2,\ni\nand\ny\n2,\ni\n(|\nx\n2,\ni\n|, |\ny\n2,\ni\n| ≤ 100), where (\nx\n2,\ni\n,\ny\n2,\ni\n) denotes the coordinates of the\ni\n-th star of the\nconstellation in the second photo.\nNote that the ordering of the stars does\nnot\nmatter for the sameness. It is guaranteed that\ndistance between every pair of stars in each photo is larger than 10\n-5\n.\nThe input is terminated in case of\nn\n= 0. This is not part of any datasets and thus should not\nbe processed.\nOutput\nFor each dataset, you should print a non-negative real number which is the difference of the\nangle of the constellation in the first photo and in the second photo. The difference should be in radian, and should not be negative. If there are two or more solutions, you should print\nthe smallest one. The difference may be printed with any number of digits after decimal point,\nprovided the absolute error does not exceed 10\n-7\n. No extra space or character is allowed.\nSample Input\n3\n0.0 0.0\n1.0 1.0\n0.0 1.0\n3.0 3.0\n2.0 2.0\n3.0 2.0\n0\nOutput for the Sample Input\n3.14159265359"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2051_5500120","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n//#define EPS 0.000000001\nusing namespace std;\n\n\n#define EPS 0.000000001\n#define SIZE 1005\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\n\t\tif(fabs(x-p.x) > EPS){\n\n\t\t\treturn x < p.x;\n\t\t}else{\n\n\t\t\treturn y < p.y;\n\t\t}\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\n\tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nint N;\nPoint A[SIZE],B[SIZE],work[SIZE];\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\n/*点moveをbaseを中心にradラジアン回転させる\nrad > 0なら反時計回り、rad < 0なら時計周り\n*/\nPoint rotate(Point base,Point move,double rad){\n\n\tPoint ret;\n\tmove = move-base;\n\n\tret.x = move.x*cos(rad)-move.y*sin(rad);\n\tret.y = move.x*sin(rad)+move.y*cos(rad);\n\n\tret = ret+base;\n\n\treturn ret;\n}\n\n//点のradを求める関数\ndouble calc_rad(Point p){\n\n\tif(p.y == 0){\n\n\t\tif(p.x > 0){\n\n\t\t\treturn 0;\n\n\t\t}else{ //p.x < 0\n\n\t\t\treturn M_PI;\n\t\t}\n\n\t}else if(p.x == 0){\n\n\t\tif(p.y > 0){\n\n\t\t\treturn M_PI/2.0;\n\t\t}else{\n\n\n\t\t\treturn 3*M_PI/2.0;\n\t\t}\n\n\t}else{\n\n\t\tdouble base = atan(fabs(p.y)/fabs(p.x));\n\n\t\tif(p.x > 0){\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn base;\n\n\t\t\t}else{ //p.y < 0\n\n\t\t\t\treturn 2*M_PI-base;\n\t\t\t}\n\n\t\t}else{ //p.x < 0\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn M_PI-base;\n\n\t\t\t}else{\n\n\t\t\t\treturn base+M_PI;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nvoid func(){\n\n\tPoint mid_A = Point(0,0);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&A[i].x,&A[i].y);\n\t\tmid_A = mid_A + A[i];\n\t}\n\tmid_A = mid_A/N;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tA[i] = A[i]-mid_A;\n\t}\n\tsort(A,A+N);\n\n\tPoint mid_B = Point(0,0);\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&B[i].x,&B[i].y);\n\t\tmid_B = mid_B + B[i];\n\t}\n\n\tmid_B = mid_B/N;\n\tfor(int i = 0; i < N; i++){\n\n\t\tB[i] = B[i]-mid_B;\n\t}\n\n\tdouble ans = BIG_NUM;\n\n\tdouble base_rad = calc_rad(A[0]);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tdouble tmp_rad = calc_rad(B[i]);\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\twork[k] = rotate(Point(0,0),B[k],base_rad-tmp_rad);\n\t\t}\n\t\tsort(work,work+N);\n\n\t\tbool FLG = true;\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tif(A[k] == work[k]){\n\n\t\t\t\t//Do nothing\n\n\t\t\t}else{\n\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(!FLG)continue;\n\n\t\tdouble diff = base_rad-tmp_rad;\n\t\tif(diff < 0){\n\n\t\t\tdiff += 2*M_PI;\n\t\t}\n\n\t\tif(diff > M_PI){\n\n\t\t\tdiff = 2*M_PI-diff;\n\t\t}\n\n\t\tans = min(ans,diff);\n\t}\n\n\tprintf(\"%.12lf\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":120,"memory_kb":3800,"score_of_the_acc":-1.2212,"final_rank":18},{"submission_id":"aoj_2051_5500115","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n//#define EPS 0.000000001\nusing namespace std;\n\n\n#define EPS 0.000000001\n#define SIZE 1005\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\n\t\tif(fabs(x-p.x) > EPS){\n\n\t\t\treturn x < p.x;\n\t\t}else{\n\n\t\t\treturn y < p.y;\n\t\t}\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\n\tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nint N;\nPoint A[SIZE],B[SIZE],work[SIZE];\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\n/*点moveをbaseを中心にradラジアン回転させる\nrad > 0なら反時計回り、rad < 0なら時計周り\n*/\nPoint rotate(Point base,Point move,double rad){\n\n\tPoint ret;\n\tmove = move-base;\n\n\tret.x = move.x*cos(rad)-move.y*sin(rad);\n\tret.y = move.x*sin(rad)+move.y*cos(rad);\n\n\tret = ret+base;\n\n\treturn ret;\n}\n\n//点のradを求める関数\ndouble calc_rad(Point p){\n\n\tif(p.y == 0){\n\n\t\tif(p.x > 0){\n\n\t\t\treturn 0;\n\n\t\t}else{ //p.x < 0\n\n\t\t\treturn M_PI;\n\t\t}\n\n\t}else if(p.x == 0){\n\n\t\tif(p.y > 0){\n\n\t\t\treturn M_PI/2.0;\n\t\t}else{\n\n\n\t\t\treturn 3*M_PI/2.0;\n\t\t}\n\n\t}else{\n\n\t\tdouble base = atan(fabs(p.y)/fabs(p.x));\n\n\t\tif(p.x > 0){\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn base;\n\n\t\t\t}else{ //p.y < 0\n\n\t\t\t\treturn 2*M_PI-base;\n\t\t\t}\n\n\t\t}else{ //p.x < 0\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn M_PI-base;\n\n\t\t\t}else{\n\n\t\t\t\treturn base+M_PI;\n\t\t\t}\n\t\t}\n\t}\n}\n\nbool DEBUG = false;\n\nvoid func(){\n\n\tPoint mid_A = Point(0,0);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&A[i].x,&A[i].y);\n\t\tmid_A = mid_A + A[i];\n\t}\n\tmid_A = mid_A/N;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tA[i] = A[i]-mid_A;\n\t}\n\tsort(A,A+N);\n\n\tif(DEBUG){\n\n\t\tfor(int i = 0; i < N; i++){\n\n\t\t\tprintf(\"A[%d] \",i);\n\t\t\tA[i].debug();\n\t\t}\n\t}\n\n\tPoint mid_B = Point(0,0);\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&B[i].x,&B[i].y);\n\t\tmid_B = mid_B + B[i];\n\t}\n\n\tmid_B = mid_B/N;\n\tfor(int i = 0; i < N; i++){\n\n\t\tB[i] = B[i]-mid_B;\n\t}\n\n\tdouble ans = BIG_NUM;\n\n\tdouble base_rad = calc_rad(A[0]);\n\n\tif(DEBUG){\n\n\t\tprintf(\"base_rad:%.3lf\\n\",base_rad);\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tdouble tmp_rad = calc_rad(B[i]);\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\twork[k] = rotate(Point(0,0),B[k],base_rad-tmp_rad);\n\t\t}\n\t\tsort(work,work+N);\n\n\t\tif(DEBUG){\n\t\t\tprintf(\"\\ni:%d\\n\",i);\n\t\t\tfor(int k = 0; k < N; k++){\n\n\t\t\t\twork[k].debug();\n\t\t\t}\n\t\t}\n\n\t\tbool FLG = true;\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tif(A[k] == work[k]){\n\n\t\t\t\t//Do nothing\n\n\t\t\t}else{\n\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(!FLG)continue;\n\n\t\tdouble diff = base_rad-tmp_rad;\n\t\tif(diff < 0){\n\n\t\t\tdiff += 2*M_PI;\n\t\t}\n\n\t\tif(diff > M_PI){\n\n\t\t\tdiff = 2*M_PI-diff;\n\t\t}\n\n\t\tif(DEBUG){\n\n\t\t\tprintf(\"diff:%.3lf\\n\",diff);\n\t\t}\n\n\t\tans = min(ans,diff);\n\t}\n\n\tprintf(\"%.12lf\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":110,"memory_kb":3780,"score_of_the_acc":-1.1925,"final_rank":17},{"submission_id":"aoj_2051_3948859","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 Point {\n\tdouble x, y;\n\tstruct Vector operator-(const Point& that) const;\n\tdouble distance_from(const Point& that) const;\n};\nstruct Vector {\n\tdouble dx, dy;\n\tdouble dot(const Vector& that) const;\n\tdouble cross(const Vector& that)const;\n\tdouble length() const;\n\tstruct Angle to_angle() const;\n\tstruct Angle angle_with(const Vector& that) const;\n\tVector rotate(const struct Angle& angle) const;\n\tVector operator-(const Vector& that) const;\n};\nstruct Angle {\n\tdouble sin, cos;\n\tdouble to_radian() const;\n\tAngle operator-() const;\n};\nint main() {\n\tstd::vector<double> result;\n\twhile (true) {\n\t\tint n; std::cin >> n; if (n == 0) break;\n\t\tstd::vector<Point> before_points(n), after_points(n);\n\t\tfor (auto& point : before_points) std::cin >> point.x >> point.y;\n\t\tfor (auto& point : after_points) std::cin >> point.x >> point.y;\n\t\tif (n == 1) {\n\t\t\t//std::cout << 0 << '\\n';\n\t\t\tresult.push_back(0);\n\t\t\tcontinue;\n\t\t}\n\t\tconst auto origin = *std::min_element(before_points.begin(), before_points.end(), [](const Point& a, const Point& b) {return (a.y != b.y) ? a.y < b.y : a.x < b.x; });\n\t\tstd::vector<Vector> before_vec; before_vec.reserve(n - 1);\n\t\tfor (const auto& point : before_points) {\n\t\t\tif (origin.distance_from(point) > 1e-9) before_vec.push_back(point - origin);\n\t\t}\n\t\tconst auto base = *std::max_element(before_vec.begin(), before_vec.end(), [](const Vector& a, const Vector& b) {return std::abs(a.cross(b)) <= 1e-9 ? a.length() < b.length() : a.cross(b) < 0; });\n\t\tconst auto angle = base.to_angle();\n\t\tfor (auto& vec : before_vec) vec = vec.rotate(-angle); \n\t\tstd::sort(before_vec.begin(), before_vec.end(), [base](const Vector& a, const Vector& b) { return std::abs(a.cross(b)) < 1e-12 ? a.length() < b.length() : a.cross(b) < 0; });\n\t\tdouble min_radian = DBL_MAX;\n\t\tfor (auto i = 0; i < n; ++i) {\n\t\t\tstd::vector<Vector> after_mapped; after_mapped.reserve(n - 1);\n\t\t\tfor (auto j = 0; j < n; ++j) if (i != j) after_mapped.push_back(after_points[j] - after_points[i]);\n\t\t\tconst auto new_base = *std::max_element(after_mapped.begin(), after_mapped.end(), [](const Vector& a, const Vector& b) {return std::abs(a.cross(b)) <= 1e-9 ? a.length() < b.length() : a.cross(b) < 0; });\n\t\t\tconst auto new_angle = new_base.to_angle();\n\t\t\tfor (auto& vec : after_mapped) vec = vec.rotate(-new_angle);\n\t\t\tif (std::any_of(after_mapped.begin(), after_mapped.end(), [](const Vector& a) {return a.dy < -1e-9; }))\n\t\t\t\tcontinue;\n\t\t\tstd::sort(after_mapped.begin(), after_mapped.end(), [](const Vector& a, const Vector& b) { return std::abs(a.cross(b)) < 1e-12 ? a.length() < b.length() : a.cross(b) < 0; });\n\t\t\tbool is_match = true;\n\t\t\tfor (auto j = 0; j < n - 1; ++j) {\n\t\t\t\tif ((after_mapped[j] - before_vec[j]).length() > 1e-6) {\n\t\t\t\t\tis_match = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (is_match) {\n\t\t\t\tmin_radian = std::min(min_radian, std::acos(base.angle_with(new_base).cos));\n\t\t\t}\n\t\t}\n\t\t//std::cout << std::setprecision(15) << std::fixed << min_radian << '\\n';\n\t\tresult.push_back(min_radian);\n\t}\n\tfor (const auto r : result) {\n\t\tstd::cout << std::setprecision(10) << std::fixed << r << '\\n';\n\t}\n}\n\n\nVector Point::operator-(const Point& that) const\n{\n\treturn Vector{ x - that.x, y - that.y };\n}\n\ndouble Point::distance_from(const Point& that) const\n{\n\treturn (*this - that).length();\n}\n\ndouble Vector::dot(const Vector& that) const\n{\n\treturn dx * that.dx + dy * that.dy;\n}\n\ndouble Vector::cross(const Vector& that) const\n{\n\treturn dx * that.dy - dy * that.dx;\n}\n\ndouble Vector::length() const\n{\n\treturn std::sqrt(dx * dx + dy * dy);\n}\n\nAngle Vector::to_angle() const\n{\n\tconst auto len = length();\n\treturn Angle{ dy / len, dx / len };\n}\n\nAngle Vector::angle_with(const Vector& that) const\n{\n\tconst auto len = length() * that.length();\n\treturn Angle{ cross(that) / len, dot(that) / len };\n}\n\nVector Vector::rotate(const Angle& angle) const\n{\n\treturn Vector{ dx * angle.cos - dy * angle.sin, dy * angle.cos + dx * angle.sin };\n}\n\nVector Vector::operator-(const Vector& that) const\n{\n\treturn Vector{ dx - that.dx, dy - that.dy };\n}\n\ndouble Angle::to_radian() const\n{\n\treturn (sin >= 0) ? std::acos(cos) : std::acos(-1) * 2 - std::acos(cos);\n}\n\nAngle Angle::operator-() const\n{\n\treturn Angle{ -sin, cos };\n}","accuracy":1,"time_ms":40,"memory_kb":3460,"score_of_the_acc":-0.9199,"final_rank":11},{"submission_id":"aoj_2051_3645090","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ll INF = mod * mod;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\nconst ld eps = 1e-4;\nconst ld pi = acos(-1.0);\ntypedef pair<ld, ld> LDP;\ntypedef pair<ll, ll> LP;\ntypedef vector<int> vec;\ntypedef vector<string> svec;\n\nbool eq(ld a, ld b) {\n\treturn (abs(a - b) < eps);\n}\n\nclass Line {\npublic:\n\tPoint a, b;\n};\nclass Circle {\npublic:\n\tPoint p; ld r;\n};\n\nld dot(Point a, Point b) {\n\treturn real(conj(a)*b);\n}\nld cross(Point a, Point b) {\n\treturn imag(conj(a)*b);\n}\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\treturn lhs.real() == rhs.real() ? lhs.imag() < rhs.imag() : lhs.real() < rhs.real();\n\t}\n}\nPoint proj(Line l, Point p) {\n\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + t * (l.a - l.b);\n}\n\nld dist_lp(Line l, Point p) {\n\treturn abs(p - proj(l, p));\n}\n\nint ccw(Point a, Point b, Point c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > eps)return 1;//a,b,cが反時計回り\n\tif (cross(b, c) < -eps)return -1;//a,b,cが時計回り\n\tif (dot(b, c) < 0)return 2;//c,a,bの順に一直線\n\tif (norm(b) < norm(c))return -2;//a,b,cの順に一直線\n\treturn 0;//a,c,bの順に一直線\n}\nbool isis_ll(Line l, Line m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\nPoint is_ll(Line s, Line t) {\n\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n\n//直線lに幅dをつける\nvector<Line> make_w(Line l, ld d) {\n\tPoint dif = l.b - l.a;\n\tdif = dif*Point{0, 1};\n\tdif = dif * (d / abs(dif));\n\tvector<Line> ret;\n\tfor (int id = 1; id >= -1; id -= 2) {\n\t\tPoint a = l.a + dif * (ld)id;\n\t\tPoint b = l.b + dif * (ld)id;\n\t\tret.push_back({ a,b });\n\t}\n\treturn ret;\n}\n\ntypedef vector<Point> polygon;\npolygon ConvexHull(polygon p) {\n\tint n = p.size();\n\tint k = 0;\n\tsort(p.begin(), p.end());\n\tpolygon ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = p[i++]) {\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], p[i]) <= 0)--k;\n\t}\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) {\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], p[i]) <= 0)--k;\n\t}\n\tch.resize(k - 1);\n\treturn ch;\n}\npolygon convex_cut(const polygon &p, Line l) {\n\tvector<Point> ret;\n\trep(i, p.size()) {\n\t\tPoint a = p[i], b = p[(i + 1) % p.size()];\n\t\tif (ccw(l.a, l.b, a) != -1)ret.push_back(a);\n\t\tif (ccw(l.a, l.b, a)*ccw(l.a, l.b, b)<0) {\n\t\t\tret.push_back(is_ll({ a,b }, l));\n\t\t}\n\t}\n\treturn ret;\n}\nld area(const polygon &p){\n\tld ret = 0;\n\tint n = p.size();\n\trep(j, n)ret += cross(p[j], p[(j + 1) % n]);\n\treturn ret / 2.0;\n}\nld max_distance(const polygon &p) {\n\t//assert(p.size()>1);\n\tpolygon g = ConvexHull(p);\n\tint n = g.size(), a = 0, b = 1;\n\tld ret = abs(g[0] - g[1]);\n\twhile (a < n) {\n\t\tPoint p1 = g[a%n], p2 = g[(a + 1) % n];\n\t\tPoint q1 = g[b%n], q2 = g[(b + 1) % n];\n\t\tif (arg((p2 - p1) / (q1 - q2)) > 0)++b; else ++a;\n\t\tret = max(ret, abs(p1 - q1));\n\t}\n\treturn ret;\n}\n\nvector<Point> is_cc(Circle c1, Circle c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d*d + c1.r*c1.r - c2.r*c2.r) / (2 * d);\n\tld dfr = c1.r*c1.r - rc * rc;\n\tif (abs(dfr) < eps)dfr = 0.0;\n\tif (dfr < 0.0)return res;\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0)res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\nbool in_Circle(Circle a, Circle b) {\n\tld dist = abs(b.p - a.p);\n\treturn dist < b.r - a.r+eps;\n}\n\nll gcd(ll x, ll y) {\n\tx = abs(x), y = abs(y);\n\tif (x < y)swap(x, y);\n\twhile (y) {\n\t\tll r = x % y; x = y; y = r;\n\t}\n\treturn x;\n}\n\n//0/0だけ気を付けて！\nstruct ratio {\n\tll a, b;\n\tratio(ll x) { a = x; b = 1; };\n\tratio(ll x, ll y) {\n\t\ta = x; b = y;\n\t\tll g = gcd(x, y);\n\t\tif (g > 0) {\n\t\t\ta /= g, b /= g;\n\t\t\tif (b < 0)a = -a, b = -b;\n\t\t}\n\t};\n\n};\n\nvoid normalize(ratio &r) {\n\tll g = gcd(r.a, r.b);\n\tr.a /= g; r.b /= g;\n\tif (r.b < 0)r.b = -r.b, r.a = -r.a;\n}\nbool operator<(const ratio &x, const ratio &y) {\n\treturn x.a*y.b < x.b*y.a;\n}\nbool operator==(const ratio &x, const ratio &y) {\n\treturn x.a*y.b == x.b*y.a;\n}\n\nbool isis_cc(Circle a, Circle b) {\n\tld dist = abs(b.p - a.p);\n\treturn dist < a.r + b.r;\n}\nint n;\n\nbool same(vector<Point> &a, vector<Point> &b, Point c, ld theta) {\n\tvector<Point>u;\n\trep(i, n) {\n\t\tPoint dif = a[i] - a[0];\n\t\tdif = dif * Point{ cos(theta),sin(theta) };\n\t\tPoint nex = a[0] + dif + c;\n\t\tu.push_back(nex);\n\t}\n\tsort(u.begin(), u.end());\n\trep(i, n) {\n\t\tif (abs(u[i] - b[i]) > eps)return false;\n\t}\n\treturn true;\n}\nvoid solve() {\n\tvector<Point> a(n), b(n);\n\trep(i, n) {\n\t\tld x, y; cin >> x >> y;\n\t\ta[i] = { x,y };\n\t}\n\trep(i, n) {\n\t\tld x, y; cin >> x >> y;\n\t\tb[i] = { x,y };\n\t}\n\tsort(b.begin(), b.end());\n\tld ans = mod;\n\trep(i, n) {\n\t\trep(j, n) {\n\t\t\tif (i == j)continue;\n\t\t\tld dist = abs(b[i] - b[j]);\n\t\t\tif (!eq(dist,abs(a[0] - a[1])))continue;\n\t\t\tPoint c = b[i] - a[0];\n\t\t\tld t1 = arg(a[1] - a[0]);\n\t\t\tld t2 = arg(b[j] - b[i]);\n\t\t\tld t = t2 - t1;\n\t\t\t//cout << t2 << \" \"<<t1 << endl;\n\t\t\twhile (t > 2 * pi)t -= 2 * pi;\n\t\t\twhile (t < 0)t += 2 * pi;\n\t\t\tif (eq(t, 2*pi))t = 0;\n\t\t\t//cout << t << endl;\n\t\t\tif (same(a, b, c, t)) {\n\t\t\t\tans = min(ans, t);\n\t\t\t\tans = min(ans, 2 * pi - t);\n\t\t\t}\n\t\t}\n\t}\n\tif (ans == mod)ans = 0;\n\tcout << ans << endl;\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << fixed << setprecision(11);\n\twhile (cin >> n, n) {\n\t\tsolve();\n\t}\n\t//solve();\n\t//stop\n\treturn 0;\n}","accuracy":1,"time_ms":240,"memory_kb":3656,"score_of_the_acc":-1.4142,"final_rank":19},{"submission_id":"aoj_2051_3643918","code_snippet":"#include<iomanip>\n#include<limits>\n#include<thread>\n#include<utility>\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<set>\n#include<map>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<cmath>\n#include<numeric>\n#include<cassert>\n#include<random>\n#include<chrono>\n#include<unordered_set>\n#include<unordered_map>\n#include<fstream>\n#include<list>\n#include<functional>\n#include<bitset>\n#include<complex>\n#include<tuple>\nusing namespace std;\ntypedef unsigned long long int ull;\ntypedef long long int ll;\ntypedef pair<ll,ll> pll;\ntypedef long double D;\ntypedef complex<D> P;\n#define F first\n#define S second\nconst ll E=1e18+7;\nconst ll MOD=1000000007;\n\n\ntemplate<typename T,typename U>istream & operator >> (istream &i,pair<T,U> &A){i>>A.F>>A.S; return i;}\ntemplate<typename T>istream & operator >> (istream &i,vector<T> &A){for(auto &I:A){i>>I;} return i;}\ntemplate<typename T,typename U>ostream & operator << (ostream &o,pair<T,U> &A){o<<A.F<<\" \"<<A.S; return o;}\ntemplate<typename T>ostream & operator << (ostream &o,vector<T> &A){ll i=A.size(); for(auto &I:A){o<<I<<(--i?\" \":\"\");} return o;}\ntemplate<typename T>vector<T> & cset(vector<T> &A,T e=T()){for(auto &I:A){I=e;} return A;}\n\nnamespace Geometry{\n typedef long double D;\n typedef complex<long double> P;\n typedef pair<P,D> C;\n \n const D EPS=1e-9;\n const D PI=asin(1)*2;\n const D INF=1e18;\n \n const static bool comp(const P &p1,const P &p2){return p1.real()==p2.real()?p1.imag()<p2.imag():p1.real()<p2.real();}\n \n D dot(P p1,P p2){return p1.real()*p2.real()+p1.imag()*p2.imag();}\n \n D cross(P p1,P p2){return p1.real()*p2.imag()-p1.imag()*p2.real();}\n \n P project(P vec,P x){return vec*(x/vec).real();}\n \n P project(P p1,P p2,P x){return p1+project(p2-p1,x-p1);}\n \n P reflect(P vec,P x){return vec*conj(x/vec);}\n \n P reflect(P p1,P p2,P x){return p1+reflect(p2-p1,x-p1);}\n \n bool intersectSL(P p1,P p2,P vec){vec/=abs(vec); p1/=vec; p2/=vec; return (p1.imag()<EPS && p2.imag()>-EPS) || (p1.imag()>-EPS && p2.imag()<EPS);}\n \n bool intersectSL(P p1,P p2,P p3,P p4){return intersectSL(p1-p4,p2-p4,p3-p4);}\n \n bool intersectSS(P p1,P p2,P p3,P p4){return (dot(p2-p1,p3-p1)<-EPS && dot(p2-p1,p4-p1)<-EPS) || (dot(p1-p2,p3-p2)<-EPS && dot(p1-p2,p4-p2)<-EPS)?false:intersectSL(p1,p2,p3,p4) && intersectSL(p3,p4,p1,p2);}\n \n D distLP(P vec,P x){return abs((x/vec).imag())*abs(vec);}\n \n D distLP(P p1,P p2,P x){return distLP(p2-p1,x-p1);}\n \n D distSP(P p1,P p2,P x){return dot(p2-p1,x-p1)<-EPS?abs(x-p1):dot(p1-p2,x-p2)<-EPS?abs(x-p2):distLP(p1,p2,x);}\n \n D distSS(P p1,P p2,P p3,P p4){return intersectSS(p1,p2,p3,p4)?0.0:min(min(distSP(p1,p2,p3),distSP(p1,p2,p4)),min(distSP(p3,p4,p1),distSP(p3,p4,p2)));}\n \n P crosspointLL(P p1,P p2,P vec){return abs(cross(p2-p1,vec))<EPS?vec:vec*cross(p2-p1,p2)/cross(p2-p1,vec);}\n \n P crosspointLL(P p1,P p2,P p3,P p4){return p4+crosspointLL(p1-p4,p2-p4,p3-p4);}\n \n P crosspointSS(P p1,P p2,P p3,P p4){return distSP(p1,p2,p3)<EPS?p3:distSP(p1,p2,p4)<EPS?p4:crosspointLL(p1,p2,p3,p4);}\n \n bool intersectShL(P p1,P p2,P vec){vec/=abs(vec); return intersectSL(p1,p2,vec) && crosspointLL(p1/vec,p2/vec,vec/vec).real()>-EPS;}\n \n bool intersectShL(P p1,P p2,P p3,P p4){return intersectShL(p1-p3,p2-p3,p4-p3);}\n \n //1::in,0::on edge,-1::out\n int contain(const vector<P> &poly,const P &p){\n vector<P> A={{65537,96847},{-24061,6701},{56369,-86509},{-93763,-78049},{56957,10007}};\n vector<bool> cnt(5,false);\n for(int i=1;i<=poly.size();i++){\n if(distSP(poly[i-1],poly[i%poly.size()],p)<EPS){return 0;}\n for(int j=0;j<5;j++){\n if(intersectShL(poly[i-1],poly[i%poly.size()],p,p+A[j])){cnt[j]=!cnt[j];}\n }\n }\n int in=0;\n for(int j=0;j<5;j++){if(cnt[j]){in++;}}\n return in>=3?1:-1;\n }\n \n vector<P> convexcut(const vector<P> &poly,P p1,P p2){\n vector<P> ret;\n for(int i=1;i<=poly.size();i++){\n if(cross(p2-p1,poly[i-1]-p1)>-EPS){ret.push_back(poly[i-1]);}\n if(intersectSL(poly[i-1],poly[i%poly.size()],p1,p2) && distLP(p1,p2,poly[i-1])>EPS && distLP(p1,p2,poly[i%poly.size()])>EPS){ret.push_back(crosspointLL(poly[i-1],poly[i%poly.size()],p1,p2));}\n }\n return ret;\n }\n \n D area(const vector<P> &poly){\n D ans=0;\n for(int i=2;i<poly.size();i++){ans+=cross(poly[i-1]-poly[0],poly[i]-poly[0]);}\n return abs(ans)/2;\n }\n \n vector<P> convexhull(vector<P> pts){\n vector<P> ret;\n sort(pts.begin(),pts.end(),comp);\n for(auto &I:pts){\n if(!ret.empty() && I==ret.back()){continue;}\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\n ret.push_back(I);\n }\n reverse(pts.begin(),pts.end());\n for(auto &I:pts){\n if(!ret.empty() && I==ret.back()){continue;}\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\n ret.push_back(I);\n }\n if(ret[0]==ret.back()){ret.pop_back();}\n return ret;\n }\n \n //4::seperate,3::circumscribe,2::intersect,1::inscribe,0::contain,-1::same\n int intersectCC(C c1,C c2){\n D d=abs(c1.F-c2.F),r=c1.S+c2.S,dif=abs(c2.S-c1.S);\n if(d<EPS && dif<EPS){return -1;}\n if(d-r>EPS){return 4;}\n if(d-r>-EPS){return 3;}\n if(d-dif>EPS){return 2;}\n if(d-dif>-EPS){return 1;}\n return 0;\n }\n \n vector<P> crosspointLC(P p1,P p2,C c){\n vector<P> ret;\n P pr=project(p1,p2,c.F);\n D d=distLP(p1,p2,c.F);\n if(d-c.S>EPS){return ret;}\n if(d-c.S>-EPS){ret.push_back(pr); return ret;}\n P vec=p2-p1; vec*=sqrt(c.S*c.S-d*d)/abs(vec);\n ret.push_back(pr-vec);\n ret.push_back(pr+vec);\n return ret;\n }\n \n vector<P> crosspointSC(P p1,P p2,C c){\n vector<P> ret;\n for(auto &I:crosspointLC(p1,p2,c)){if(distSP(p1,p2,I)<EPS){ret.push_back(I);}}\n return ret;\n }\n \n vector<P> crosspointCC(C c1,C c2){\n vector<P> ret;\n P vec=c2.F-c1.F;\n D base=(c1.S*c1.S+norm(vec)-c2.S*c2.S)/(2*abs(vec));\n D h=sqrt(c1.S*c1.S-base*base);\n vec/=abs(vec);\n ret.push_back(c1.F+vec*P(base,-h));\n ret.push_back(c1.F+vec*P(base,h));\n return ret;\n }\n \n vector<P> tangentCP(C c,P p){return crosspointCC(c,C(p,sqrt(norm(c.F-p)-c.S*c.S)));}\n \n vector<pair<P,P>> tangentCC(C c1,C c2){\n vector<pair<P,P>> ret;\n P d=c2.F-c1.F;\n for(D i:{-1,1}){\n D r=c1.S+c2.S*i;\n if(intersectCC(c1,c2)>i+1){\n for(P s:{-1i,1i}){\n P p=r+s*sqrt(norm(d)-norm(r));\n ret.push_back({c1.F+d*c1.S/norm(d)*p,c2.F-d*i*c2.S/norm(d)*p});\n }\n }\n }\n return ret;\n }\n \n D area(const vector<P> &poly,C c){\n D ret=0;\n for(int i=0;i<poly.size();i++){\n P a=poly[i]-c.F,b=poly[(i+1)%poly.size()]-c.F;\n if(abs(a)<c.S+EPS && abs(b)<c.S+EPS){ret+=cross(a,b);}\n else{\n vector<P> A=crosspointSC(a,b,{0,c.S});\n if(A.empty()){ret+=c.S*c.S*arg(b/a);}\n else{\n ret+=(abs(a)<c.S?cross(a,A[0]):c.S*c.S*arg(A[0]/a));\n ret+=(abs(b)<c.S?cross(A.back(),b):c.S*c.S*arg(b/A.back()));\n ret+=cross(A[0],A.back());\n }\n }\n }\n return abs(ret)/2;\n }\n \n //反時計回り\n D diameter(const vector<P> &poly){\n D ret=0;\n ll l=0,r=0,n=poly.size();\n if(n==2){return abs(poly[0]-poly[1]);}\n for(int i=0;i<n;i++){\n if(comp(poly[l],poly[i])){l=i;}\n if(comp(poly[i],poly[r])){r=i;}\n }\n ll sl=r,sr=l;\n while(sl!=l || sr!=r){\n ret=max(ret,abs(poly[r]-poly[l]));\n if(cross(poly[(l+1)%n]-poly[l],poly[(r+1)%n]-poly[r])<0){(++l)%=n;}\n else{(++r)%=n;}\n }\n return ret;\n }\n \n D closestpair(vector<P> pt){\n sort(pt.begin(),pt.end(),comp);\n D ret=INF;\n for(ll i=1;i<pt.size();i<<=1){\n for(ll j=0;i+j<pt.size();j+=i*2){\n ll m=i+j;\n vector<P> R;\n D l=-INF,r=INF;\n for(ll k=j;k<m;k++){l=max(l,pt[k].real());}\n for(ll k=0;m+k<pt.size() && k<i;k++){r=min(r,pt[m+k].real());}\n for(ll k=0;m+k<pt.size() && k<i;k++){if(pt[m+k].real()-l<ret){R.push_back(pt[m+k]);}}\n ll idx=0;\n for(ll k=j;k<m;k++){\n if(r-pt[k].real()>ret){continue;}\n while(idx<R.size() && pt[k].imag()-R[idx].imag()>ret){idx++;}\n for(ll n=idx;n<R.size() && R[n].imag()-pt[k].imag()<ret;n++){ret=min(ret,abs(R[n]-pt[k]));}\n }\n inplace_merge(pt.begin()+j,pt.begin()+m,j+i*2<pt.size()?pt.begin()+j+2*i:pt.end(),[](const P &a,const P &b){return a.imag()==b.imag()?a.real()<b.real():a.imag()<b.imag();});\n }\n }\n return ret;\n }\n \n P centerofgravity(const vector<P> &pt){\n P ret(0,0);\n D wt=0;\n for(int i=2;i<pt.size();i++){\n D w2=cross(pt[i-1]-pt[0],pt[i]-pt[0]);\n P p=(pt[0]+pt[i-1]+pt[i])/(D)3;\n wt+=w2;\n ret+=p*w2;\n }\n return ret/wt;\n }\n \n istream & operator >> (istream &i,P &p){D x,y; i>>x>>y; p={x,y}; return i;}\n istream & operator >> (istream &i,C &p){D x,y; i>>x>>y>>p.S; p.F={x,y}; return i;}\n};\n\nusing namespace Geometry;\n\n\n\n\nint main(){\n ll n;\n while(cin>>n,n){\n vector<P> A(n),B(n);\n cin>>A>>B;\n P mid1(0,0),mid2(0,0);\n for(auto &I:A){mid1+=I;} mid1/=n;\n for(auto &I:B){mid2+=I;} mid2/=n;\n for(auto &I:A){I-=mid1;}\n for(auto &I:B){I-=mid2;}\n sort(A.begin(),A.end(),[](P a,P b){return arg(a)+EPS<arg(b) || (abs(arg(a)-arg(b))<EPS*2 && abs(a)<abs(b));});\n sort(B.begin(),B.end(),[](P a,P b){return arg(a)+EPS<arg(b) || (abs(arg(a)-arg(b))<EPS*2 && abs(a)<abs(b));});\n //cout<<A<<endl<<B<<endl;\n D ans=E;\n ll k=-1;\n for(int i=0;i<n;i++){if(abs(B[i])>EPS){k=i;}}\n for(int i=0;i<n;i++){if(abs(B[i])>1){k=i;}}\n if(k==-1){ans=0;}\n for(int i=0;i<n && k!=-1;i++){\n D dif=0;\n P vec=A[i]/abs(A[i])/(B[k]/abs(B[k]));\n for(int j=0;j<n;j++){\n dif+=abs(A[(i+j)%n]/vec-B[(k+j)%n]);\n }\n if(dif<EPS*n){ans=min(ans,abs(arg(vec)));}\n }\n cout<<fixed<<setprecision(12)<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":3388,"score_of_the_acc":-1.0788,"final_rank":15},{"submission_id":"aoj_2051_3106199","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <set>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\nconst double PI = acos(-1);\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\n\ntypedef complex<double> P;\ntypedef vector<P> VP;\nnamespace std{\n bool operator < (const P& a, const P& b){\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\n }\n bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){\n return (conj(a)*b).X;\n}\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\n}\nint ccw(P a, P b, P c){\n b -= a;\n c -= a;\n if(cross(b,c) > EPS) return +1; //ccw\n if(cross(b,c) < -EPS) return -1; //cw\n if(dot(b,c) < -EPS) return +2; //c-a-b\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\n return 0; //a-c-b\n}\nP rotate(const P &p, double rad){\n return p *P(cos(rad), sin(rad));\n}\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n==0) break;\n\n if(n==1){\n double d;\n cin >> d >> d >> d >> d;\n cout << 0 << endl;\n continue;\n }\n\n //重心を原点に平行移動\n vector<VP> p(2, VP(n));\n for(int d=0; d<2; d++){\n P centroid(0, 0);\n for(int i=0; i<n; i++){\n double x,y;\n cin >> x >> y;\n p[d][i] = P(x, y);\n centroid += p[d][i];\n }\n centroid /= n;\n //p0が重心に重なると角度が取れなくなるので例外処理\n if(p[d][0] == centroid){\n swap(p[d][0], p[d][1]);\n }\n for(int i=0; i<n; i++){\n p[d][i] -= centroid;\n }\n }\n\n //同じ点が2点以上ないという仮定で、全部このsetに入って入ればokとする\n set<P> pset;\n for(int i=0; i<n; i++){\n pset.insert(p[0][i]);\n }\n double ans = INF;\n for(int i=0; i<n; i++){\n //p[1][i]を回転させてp[0][0]に合わせる\n if(!EQ(abs(p[0][0]), abs(p[1][i]))) continue;\n double angle = arg(p[1][i]/p[0][0]);\n bool ok = true;\n for(int j=0; j<n; j++){\n P rot = rotate(p[1][j], -angle);\n if(pset.find(rot) == pset.end()){\n ok = false;\n break;\n }\n }\n if(ok){\n ans = min(ans, abs(angle));\n }\n }\n cout << fixed << setprecision(10);\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3756,"score_of_the_acc":-1.0163,"final_rank":14},{"submission_id":"aoj_2051_2859319","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\n\n/* 幾何の基本 */\n\n#include <complex>\n\ntypedef complex<ld> Point;\n\n\nconst ld pi = acos(-1.0);\nconst ld dtop = pi / 180.;\nconst ld ptod = 1. / dtop;\n\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() > rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\n// 点の入力\nPoint input_Point() {\n\tld x, y;\n\tcin >> x >> y;\n\treturn Point(x, y);\n}\n\n// 誤差つき等号判定\nbool eq(const ld a, const ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// 内積\nld dot(const Point& a, const Point& b) {\n\treturn real(conj(a) * b);\n}\n\n// 外積\nld cross(const Point& a, const Point& b) {\n\treturn imag(conj(a) * b);\n}\n\n// 直線の定義\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) : a(a), b(b) {}\n\tPoint operator[](const int _num)const {\n\t\tif (_num == 0)return a;\n\t\telse if (_num == 1)return b;\n\t\telse {\n\t\t\tassert(false);\n\t\t\treturn Point();\n\t\t}\n\t}\n};\n\n// 円の定義\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n\tCircle() : p(Point(0, 0)), r(0) {}\n\tCircle(Point p, ld r) : p(p), r(r) {}\n};\n\n// ccw\n// 1: a,b,cが反時計周りの順に並ぶ\n//-1: a,b,cが時計周りの順に並ぶ\n// 2: c,a,bの順に直線に並ぶ\n//-2: a,b,cの順に直線に並ぶ\n// 0: a,c,bの順に直線に並ぶ\nint ccw(const Point& a, const Point &b, const Point &c) {\n\tconst Point nb(b - a);\n\tconst Point nc(c - a);\n\tif (cross(nb, nc) > eps) return 1; // a,b,cが反時計周りの順に並ぶ\n\tif (cross(nb, nc) < -eps) return -1; // a,b,cが時計周りの順に並ぶ\n\tif (dot(nb, nc) < 0) return 2; // c,a,bの順に直線に並ぶ\n\tif (norm(nb) < norm(nc)) return -2; // a,b,cの順に直線に並ぶ\n\treturn 0; // a,c,bの順に直線に並ぶ\n}\n\n\n/* 交差判定 */\n\n// 直線と直線の交差判定\nbool isis_ll(const Line& l, const Line& m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// 直線と線分の交差判定\nbool isis_ls(const Line& l, const Line& s) {\n\treturn isis_ll(l, s) &&\n\t\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// 線分と線分の交差判定\nbool isis_ss(const Line& s, const Line& t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n\t\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// 点の直線上判定\nbool isis_lp(const Line& l, const Point& p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n\n// 点の線分上判定\nbool isis_sp(const Line& s, const Point& p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\n// 垂線の足\nPoint proj(const Line &l, const Point& p) {\n\tld t = dot(p - l.a, l.b - l.a) / norm(l.a - l.b);\n\treturn l.a + t * (l.b - l.a);\n}\n\n//線対象の位置にある点\nPoint reflect(const Line &l, const Point &p) {\n\tPoint pr = proj(l, p);\n\treturn pr * 2.l - p;\n}\n\n// 直線と直線の交点\nPoint is_ll(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tassert(cross(sv, tv) != 0);\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n// 直線と直線の交点\nvector<Point> is_ll2(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\n\telse {\n\t\tvector<Point>ans;\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\n\t\t\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\n\t\t}\n\t\treturn ans;\n\t}\n}\n// 線分と線分の交点\n// 重なってる部分あるとassert(false)\nPoint is_ss(const Line &s, const Line& t) {\n\tif (isis_ss(s, t)) {\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tfor (int l = 0; l < 2; ++l) {\n\t\t\t\tif (s[k] == t[l])return s[k];\n\t\t\t}\n\t\t}\n\t\treturn is_ll(s, t);\n\t}\n\telse {\n\t\t//先にisis_ssしてね\n\t\tassert(false);\n\t\treturn Point(0, 0);\n\t}\n}\n// 線分と線分の交点\nvector<Point> is_ss2(const Line &s, const Line& t) {\n\tvector<Point> kouho(is_ll2(s, t));\n\tvector<Point>ans;\n\tfor (auto p : kouho) {\n\t\tif (isis_sp(s, p) && isis_sp(t, p))ans.emplace_back(p);\n\t}\n\treturn ans;\n}\n// 直線と点の距離\nld dist_lp(const Line& l, const Point& p) {\n\treturn abs(p - proj(l, p));\n}\n\n//直線と直線の距離\nld dist_ll(const Line& l, const Line& m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\n// 直線と線分の距離\nld dist_ls(const Line& l, const Line& s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\n// 線分と点の距離\nld dist_sp(const Line& s, const Point& p) {\n\tPoint r = proj(s, p);\n\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\n}\n\n// 線分と線分の距離\nld dist_ss(const Line& s, const Line& t) {\n\tif (isis_ss(s, t)) return 0;\n\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\n}\n\n\n//直線と直線の二等分線のベクトル\nLine line_bisection(const Line &s, const Line &t) {\n\tconst Point laglanju(is_ll(s, t));\n\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\n\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\n\n\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\n}\n//点と点の垂直二等分線 aを左に見ながら\nLine point_bisection(const Point&a, const Point&b) {\n\tconst Point cen((a + b) / 2.l);\n\tconst Point vec = (b - a)*Point(0, 1);\n\treturn Line(cen, cen + vec);\n}\n\n//三つの点からなる外心\nPoint outer_center(const vector<Point>&ps) {\n\tassert(ps.size() == 3);\n\tLine l1 = point_bisection(ps[0], ps[1]);\n\tLine l2 = point_bisection(ps[1], ps[2]);\n\treturn is_ll(l1, l2);\n}\n\n\n//三つの直線からなる内心\n//三つの直線が並行でないことは確かめといてね\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(line_bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(line_bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//三つの直線からなる傍心\n//三つの直線が並行でないことは確かめといてね\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(line_bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(line_bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:並行\n//c:並行でない\n//三つの直線から同距離の位置を求める。\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(line_bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(line_bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(line_bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* 円 */\n\n// 円と円の交点\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n/*\n点が円の中にいるか\n0 => out\n1 => on\n2 => in*/\nint is_in_Circle(const Point& p, const Circle &cir) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\nint is_in_Circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n/*\n円lcが円rcの中にいるか\n0 => out\n1 => on\n2 => in*/\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// 円と直線の交点\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// 円と線分の距離\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// 円と点の接線\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// 円と円の接線\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), nret.begin(), nret.end());\n\t}\n\telse {\n\t\tPoint v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\n\t\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\n\t\tret.push_back(Line(q1, q1 + v));\n\t\tret.push_back(Line(q2, q2 + v));\n\t}\n\treturn ret;\n}\n//二つの円の重なり面積\nld two_Circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* 多角形 */\n\ntypedef vector<Point> Polygon;\n\n\n\n//多角形(複数の点)の最小包含円をO(N=頂点数)で求めるアルゴリズム\n//同一直線上に三つの点がないこと\n#include<random>\nCircle welzl(vector<Point>ps) {\n\tstruct solver {\n\t\tCircle solve(vector<Point>&ps, vector<Point>&rs) {\n\t\t\tif (ps.empty() || rs.size() == 3) {\n\t\t\t\tif (rs.size() == 1) {\n\t\t\t\t\treturn Circle(Point(rs[0]), 0);\n\t\t\t\t}\n\t\t\t\telse if (rs.size() == 2) {\n\t\t\t\t\treturn Circle((rs[0] + rs[1]) / 2.0l, abs(rs[1] - rs[0]) / 2);\n\t\t\t\t}\n\t\t\t\telse if (rs.size() == 3) {\n\t\t\t\t\tvector<Line> ls(3);\n\t\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\t\tls[i] = Line(rs[i], rs[(i + 1) % 3]);\n\t\t\t\t\t}\n\t\t\t\t\tPoint center = outer_center(rs);\n\t\t\t\t\treturn Circle(center, abs(center - rs[0]));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn Circle(Point(), 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\n\t\t\t\tPoint p_ba = ps.back();\n\t\t\t\tps.pop_back();\n\t\t\t\tCircle d = solve(ps, rs);\n\t\t\t\tps.push_back(p_ba);\n\t\t\t\tif (is_in_Circle(d, p_ba)) {\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\trs.push_back(p_ba);\n\t\t\t\t\tps.pop_back();\n\t\t\t\t\tauto ans = solve(ps, rs);\n\t\t\t\t\tps.push_back(p_ba);\n\t\t\t\t\trs.pop_back();\n\t\t\t\t\treturn ans;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}so;\n\tstd::random_device rd;\n\tstd::mt19937 mt(rd());\n\tshuffle(ps.begin(), ps.end(), mt);\n\tvector<Point>rs;\n\tCircle ans = so.solve(ps, rs);\n\treturn ans;\n}\n// 面積\nld get_area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tfor (int j = 0; j<n; ++j) res += cross(p[j], p[(j + 1) % n]);\n\treturn res / 2;\n}\n\n//多角形の回転方向\nbool is_counter_clockwise(const Polygon &poly) {\n\tld angle = 0;\n\tint n = poly.size();\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\n\t\tangle += arg((c - b) / (b - a));\n\t}\n\treturn angle > eps;\n}\n\n// 円の内外判定\n/*0 => out\n1 => on\n2 => in*/\nint is_in_Polygon(const Polygon &poly, const Point& p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n];\n\t\tif (isis_sp(Line(a, b), p)) return 1;\n\t\tangle += arg((b - p) / (a - p));\n\t}\n\treturn eq(angle, 0) ? 0 : 2;\n}\n//円の内外判定2 高速\nenum { out, on, in };\nint convex_contains(const Polygon &P, const Point &p) {\n\tconst int n = P.size();\n\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\n\tint a = 0, b = n;\n\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\n\t\tint c = (a + b) / 2;\n\t\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\n\t\t\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\n\t\t\telse a = c;\n\t\t}\n\t\telse {\n\t\t\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\n\t\t\telse b = c;\n\t\t}\n\t}\n\tb %= n;\n\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\n\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\n\treturn 1;\n}\n\n// 凸包\n//点や線を返すことも有り得るので注意\nPolygon convex_hull(vector<Point> ps) {\n\tint n = ps.size();\n\tint k = 0;\n\tsort(ps.begin(), ps.end());\n\tPolygon ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++])\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n\n\n//凸カット\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\n\tint n = ps.size();\n\tPolygon q;\n\tPolygon r;\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = ps[i], b = ps[(i + 1) % n];\n\t\tLine m = Line(a, b);\n\t\tif (ccw(l.a, l.b, a) != -1) q.push_back(a);\n\t\tif (ccw(l.a, l.b, a) != 1) r.push_back(a);\n\t\tif (ccw(l.a, l.b, a) * ccw(l.a, l.b, b) < 0 && isis_ll(l, m)) {\n\t\t\tq.push_back(is_ll(l, m));\n\t\t\tr.push_back(is_ll(l, m));\n\t\t}\n\t}\n\tconst vector<Polygon>polys{ q,r };\n\treturn polys;\n}\n\nPolygon cen(Polygon po) {\n\tPoint cen;\n\tfor (auto p : po) {\n\t\tcen += p;\n\t}\n\tcen /= po.size();\n\tfor (auto&p : po) {\n\t\tp -= cen;\n\t}\n\treturn po;\n}\n\nint main() {\n\tcout<<setprecision(10)<<fixed;\n\tcout<<setprecision(10)<<fixed;\n\tcout<<setprecision(10)<<fixed;\n\tcout<<setprecision(10)<<fixed;\n\tcout<<setprecision(10)<<fixed;\n\twhile (true){\n\t\tint N;cin>>N;\n\t\tif(!N)break;\n\t\tPolygon p1,p2;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld x,y; cin>>x>>y;\n\t\t\tp1.emplace_back(x,y);\n\t\t}\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld x,y; cin>>x>>y;\n\t\t\tp2.emplace_back(x,y);\n\t\t}\n\t\tp1=cen(p1);\n\t\tp2=cen(p2);\n\n\t\tld ans=1e9;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tld theta1=atan2l(p1[0].imag(),p1[0].real());\n\t\t\tld theta2=atan2l(p2[i].imag(),p2[i].real());\n\n\t\t\tif (theta2 > theta1) {\n\t\t\t\ttheta1+=2*pi;\n\t\t\t}\n\t\t\tld sa_theta=theta1-theta2;\n\n\t\t\tPolygon next_poly(p2);\n\t\t\tfor (auto &p : next_poly) {\n\t\t\t\tPoint np;\n\t\t\t\tnp=Point(p.real()*cos(sa_theta)-p.imag()*sin(sa_theta),p.real()*(sin(sa_theta))+p.imag()*cos(sa_theta));\n\t\t\t\tp=np;\n\t\t\t}\n\n\t\t\tauto comp = [](const Point&l, const Point&r)-> bool { return abs(l.real() - r.real()) < eps ? abs(l.imag() - r.imag()) < eps ? false : l.imag() < r.imag() : l.real() < r.real(); };\n\t\t\t std::set <Point, decltype(comp)> aa(comp);\n\n\t\t\t for (auto p : next_poly) {\n\t\t\t\t aa.emplace(p);\n\t\t\t }\n\t\t\t for (auto p : p1) {\n\t\t\t\t aa.emplace(p);\n\t\t\t }\n\n\t\t\t if (aa.size() == N) {\n\t\t\t\t ans=min(ans,sa_theta);\n\t\t\t\t ans=min(ans,2*pi-sa_theta);\n\t\t\t }\n\n\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":490,"memory_kb":3820,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_2051_1679722","code_snippet":"#include <algorithm>\n#include <cassert>\n#include <cstring>\n#include <iostream>\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 TRACE(x) cout << #x << \" = \" << x << endl\n#define _ << \" _ \" <<\n\ntypedef long long llint;\n\nconst int MAXN = 1000;\nconst double eps = 1e-7;\n\ninline bool lt(double x, double y) { return x+eps < y; }\ninline bool gt(double x, double y) { return lt(y, x); }\ninline bool eq(double x, double y) { return !lt(x, y) && !gt(x, y); }\n\nstruct Pt {\n double x, y;\n Pt operator - (const Pt &b) { return Pt{x-b.x, y-b.y}; }\n};\n\ninline double norm(const Pt &a) {\n return sqrt(a.x*a.x + a.y*a.y);\n}\n\ninline double ccw(const Pt &a, const Pt &b, const Pt &c) {\n return a.x * (b.y-c.y) + b.x * (c.y-a.y) + c.x * (a.y-b.y);\n}\n\nint n;\nPt P1[MAXN], P2[MAXN], P3[MAXN];\nvector<Pt> H1, H2;\n\ndouble rot1, rot2, ans;\n\nbool load(void) {\n scanf(\"%d\", &n);\n if (n == 0) return false;\n REP (i, n) scanf(\"%lf%lf\", &P1[i].x, &P1[i].y);\n REP (i, n) scanf(\"%lf%lf\", &P2[i].x, &P2[i].y);\n return true;\n}\n\nbool cmp(const Pt &a, const Pt &b) {\n if (!eq(a.x, b.x)) return lt(a.x, b.x);\n return lt(a.y, b.y);\n}\n\nvoid convex_hull(Pt *P, int n, vector<Pt> &h) {\n sort(P, P+n, cmp);\n\n int lsize = 0, usize = 0;\n vector<Pt> lo, up;\n for (int i = 0; i < n; ++i) {\n while (lsize >= 2 && !lt(ccw(lo[lsize-2], lo[lsize-1], P[i]), 0.0)) {\n --lsize;\n lo.pop_back();\n }\n lo.push_back(P[i]);\n ++lsize;\n }\n\n for (int i = n-1; i >= 0; --i) {\n while (usize >= 2 && !lt(ccw(up[usize-2], up[usize-1], P[i]), 0.0)) {\n --usize;\n up.pop_back();\n }\n up.push_back(P[i]);\n ++usize;\n }\n\n h.clear();\n for (int i = 0; i < lsize; ++i)\n h.push_back(lo[i]);\n for (int i = 1; i < usize-1; ++i)\n h.push_back(up[i]);\n}\n\nvoid translate(Pt *p, int n, double dx, double dy) {\n REP (i, n) p[i].x += dx, p[i].y += dy;\n}\n\nvoid rotate(Pt *p, int n, double cos_alpha, double sin_alpha) {\n REP (i, n) {\n double nx = p[i].x * cos_alpha - p[i].y * sin_alpha,\n ny = p[i].x * sin_alpha + p[i].y * cos_alpha;\n p[i] = Pt{nx, ny};\n }\n}\n\nbool check(int id) {\n for (int sgn: {-1, 1}) {\n memcpy(P3, P2, sizeof P2);\n translate(P3, n, -H2[id].x, -H2[id].y); \n int nid = (id+1) % (int)H2.size();\n Pt v = H2[nid]-H2[id];\n rotate(P3, n, sgn*v.y/norm(v), sgn*v.x/norm(v));\n sort(P3, P3+n, cmp);\n\n bool ok = true;\n REP (i, n) {\n if (!eq(P1[i].x, P3[i].x)) { ok = false; break; }\n if (!eq(P1[i].y, P3[i].y)) { ok = false; break; }\n }\n if (ok) {\n rot2 = atan2(sgn*v.y, sgn*v.x);\n double tmp = rot2 - rot1 + 2*M_PI;\n while (gt(tmp, 2*M_PI)) tmp -= 2*M_PI;\n ans = min(ans, min(tmp, 2*M_PI-tmp));\n }\n }\n return false;\n}\n\nvoid solve(void) {\n if (n == 1) {\n printf(\"0.0\\n\");\n return;\n }\n\n ans = 10.0;\n\n convex_hull(P1, n, H1);\n convex_hull(P2, n, H2);\n\n translate(P1, n, -H1[0].x, -H1[0].y);\n Pt v = H1[1]-H1[0];\n rotate(P1, n, v.y/norm(v), v.x/norm(v));\n rot1 = atan2(v.y/norm(v), v.x/norm(v));\n sort(P1, P1+n, cmp);\n\n REP (i, n) check(i);\n printf(\"%.10lf\\n\", ans);\n}\n\n\nint main(void) {\n\n while (load()) solve();\n\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":3496,"score_of_the_acc":-1.1841,"final_rank":16},{"submission_id":"aoj_2051_1364823","code_snippet":"#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 1000;\n\nconst double DELTA = 1e-4;\nconst double DELTA2 = 1e-8;\nconst double PI = acos(-1);\nconst double PI2 = PI * 2;\n\n/* typedef */\n\ntemplate <typename T>\nstruct Pt {\n T x, y;\n\n Pt() {}\n Pt(T _x, T _y) : x(_x), y(_y) {}\n Pt(const Pt& pt) : x(pt.x), y(pt.y) {}\n\n bool operator==(const Pt pt) const { return x == pt.x && y == pt.y; }\n Pt<T> operator+(const Pt pt) const { return Pt<T>(x + pt.x, y + pt.y); }\n Pt<T> operator-() const { return Pt<T>(-x, -y); }\n Pt<T> operator-(const Pt pt) const { return Pt<T>(x - pt.x, y - pt.y); }\n Pt<T> operator*(T t) const { return Pt<T>(x * t, y * t); }\n Pt<T> operator/(T t) const { return Pt<T>(x / t, y / t); }\n T dot(Pt v) const { return x * v.x + y * v.y; }\n T cross(Pt v) const { return x * v.y - y * v.x; }\n Pt<T> mid(const Pt pt) { return Pt<T>((x + pt.x) / 2, (y + pt.y) / 2); }\n T d2() { return x * x + y * y; }\n double d() { return sqrt(d2()); }\n\n Pt<T> rot(double th) {\n double c = cos(th), s = sin(th);\n return Pt<T>(c * x - s * y, s * x + c * y);\n }\n\n bool operator<(const Pt& pt) const {\n return x < pt.x || (x == pt.x && y < pt.y);\n }\n\n void print(string format) {\n printf((\"(\" + format + \", \" + format + \")\\n\").c_str(), x, y);\n }\n void print() { print(\"%.6lf\"); }\n};\n\ntypedef Pt<double> pt;\n\n/* global variables */\n\nint n;\npt pts[2][MAX_N], rpts[MAX_N];\n\n/* subroutines */\n\nbool pt_comp(const pt& pt0, const pt& pt1) {\n double dx = pt0.x - pt1.x, dy = pt0.y - pt1.y;\n return (dx <= -DELTA) || (dx < DELTA && dy <= -DELTA);\n}\n\n/* main */\n\nint main() {\n for (;;) {\n cin >> n;\n if (n == 0) break;\n\n for (int j = 0; j < 2; j++) {\n pt ctr(0.0, 0.0);\n for (int i = 0; i < n; i++) {\n\tcin >> pts[j][i].x >> pts[j][i].y;\n\tctr = ctr + pts[j][i];\n }\n ctr = ctr / n;\n //ctr.print();\n\n for (int i = 0; i < n; i++)\n\tpts[j][i] = pts[j][i] - ctr;\n }\n\n pt *pts0 = pts[0], *pts1 = pts[1];\n double min_th = 10;\n\n pt& pto = pts0[0];\n double tho = atan2(pto.y, pto.x);\n double d2o = pto.d2();\n\n for (int i = 0; i < n; i++) {\n pt& pti = pts1[i];\n double d2i = pti.d2();\n if (abs(d2i - d2o) < DELTA2) {\n\tdouble thi = atan2(pti.y, pti.x);\n\tdouble dth = thi - tho;\n\tif (dth > PI) dth -= PI2;\n\telse if (dth < -PI) dth += PI2;\n\n\tdouble adth = abs(dth);\n\tif (min_th <= adth) continue;\n\t//cout << dth << endl;\n\n\tdouble cdth = cos(dth), sdth = sin(dth);\n\tfor (int j = 0; j < n; j++) {\n\t rpts[j].x = cdth * pts0[j].x - sdth * pts0[j].y;\n\t rpts[j].y = sdth * pts0[j].x + cdth * pts0[j].y;\n\t}\n\tsort(rpts, rpts + n, pt_comp);\n\n\tbool found = true;\n\tfor (int j = 0; j < n; j++)\n\t if (! binary_search(rpts, rpts + n, pts1[j], pt_comp)) {\n\t found = false;\n\t break;\n\t }\n\n\tif (found) min_th = adth;\n }\n }\n\n printf(\"%.10lf\\n\", min_th);\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1372,"score_of_the_acc":-0.0509,"final_rank":3},{"submission_id":"aoj_2051_1155675","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#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))\ntypedef double number;\ntypedef complex<double> Point;\nconst double EPS = 1e-5;\ntypedef Point P;\ntypedef vector<Point> Polygon;\ndouble dot(P a, P b){return real(conj(a) * b);}\ndouble cross(P a, P b){return imag(conj(a) * b);}\ndouble angle(P a, P b){return arg(conj(a) * b);}\nP rotate(P a, double b, P c = P()){return (a - c) * polar(1.0, b) + c;}\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > +EPS) return +1; // 反時計回り\n if (cross(b, c) < -EPS) return -1; // 時計回り\n if (dot(b, c) < 0) return +2; // c--a--b の順番で一直線上\n if (norm(b) < norm(c)) return -2; // a--b--c の順番で一直線上\n return 0; // 点が線分ab上にある\n}\nint sign(double x) {\n return (x > EPS) - (x < -EPS);\n}\nint comp(double x, double y) {\n return sign(x - y);\n}\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 return comp(a.real(), b.real()) ? comp(a.real(), b.real()) < 0 : comp(a.imag(), b.imag()) < 0;\n }\n};\nbool near(Point a, Point b) {\n return comp(a.real(), b.real()) == 0 && comp(a.imag(), b.imag()) == 0;\n}\nbool equal(Polygon p, Polygon q) {\n sort(p.begin(), p.end());\n sort(q.begin(), q.end());\n REP(i, p.size()) {\n if(!near(p[i], q[i])) return false;\n }\n return true;\n}\nPolygon convex_hull(vector<P> ps, vector<int>& res) {\n int n = ps.size(), k = 0;\n sort(ps.begin(), ps.end(),[](const P&a, const P&b){\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n });\n\n vector<P> ch(2*n);\n res.resize(2*n);\n for (int i = 0; i < n;\n res[k] = i, ch[k++] = ps[i++]){ // lower-hull\n while (k >= 2 && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;\n }\n for (int i = n-2, t = k+1; i >= 0;\n res[k] = i, ch[k++] = ps[i--]){ // upper-hull\n while (k >= t && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;\n }\n ch.resize(k-1);\n res.resize(k-1);\n return ch;\n}\npair<int, int> convex_diameter(const Polygon &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 number 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 make_pair(maxi, maxj); /* farthest pair is (maxi, maxj). */\n}\n\nint main(){\n int n;\n while(cin >> n && n > 0) {\n Polygon p(n), q(n);\n REP(i, n) {\n double x, y;\n cin >> x >> y;\n p[i] = {x, y};\n }\n REP(i, n) {\n double x, y;\n cin >> x >> y;\n q[i] = {x, y};\n }\n if(n == 1) {\n printf(\"%.10f\\n\", 0.0);\n continue;\n }\n vector<int> idx;\n auto pc = convex_hull(p, idx);\n auto max_p = convex_diameter(pc);\n int max_i = idx[max_p.first];\n int max_j = idx[max_p.second];\n double max_len = abs(p[max_i] - p[max_j]);\n double ans = 1e64;\n REP(i, n) REP(j, n) if(i != j) {\n double len = abs(q[i] - q[j]);\n if(comp(len, max_len) != 0) continue;\n auto qt = q;\n P dif = p[max_i] - qt[i];\n REP(k, qt.size()) {\n qt[k] += dif;\n }\n assert(near(p[max_i], qt[i]));\n // double th = angle(p[max_j] - p[max_i], qt[j] - qt[i]);\n // REP(k, qt.size()) {\n // qt[k] = rotate(qt[k], -th, qt[i]);\n // }\n double th = angle(qt[j] - qt[i], p[max_j] - p[max_i]);\n REP(k, qt.size()) {\n qt[k] = rotate(qt[k], th, qt[i]);\n }\n assert(near(p[max_i], qt[i]));\n assert(near(p[max_j], qt[j]));\n if(!equal(p, qt)) continue;\n th = abs(th);\n ans = min(ans, th);\n }\n printf(\"%.10f\\n\", ans);\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":1460,"score_of_the_acc":-0.2525,"final_rank":9},{"submission_id":"aoj_2051_1039771","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 \nclass Point{\npublic:\n double x,y;\n \n Point(double x = 0,double y = 0): x(x),y(y){}\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n \n};\n \nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n \nconst double DINF = 1e20;\nint n;\nPoint ps[2][1010],tmp[1010];\n \ninline double getDist(Point p){ return sqrt(p.x*p.x+p.y*p.y); }\ninline bool comp_arg(const double &a,const double &b) { return !equals(a,b) && a < b; }\n \nvoid compute(){\n Point grv[2] = {Point(),Point()};\n rep(i,2) rep(j,n) grv[i] = grv[i] + ps[i][j];\n rep(i,2) grv[i] = grv[i] / (double)n;\n rep(i,2) rep(j,n) ps[i][j] = ps[i][j] - grv[i];\n sort(ps[0],ps[0]+n);\n \n vector<double> arg_buf;\n rep(i,n) {\n double dist[2] = { getDist(ps[0][0]), getDist(ps[1][i]) };\n if( !equals(dist[0],dist[1]) ) continue;\n double arg = atan2(ps[0][0].y,ps[0][0].x) - atan2(ps[1][i].y,ps[1][i].x);\n while( arg < 0 ) arg += 2*M_PI;\n arg_buf.push_back(arg);\n }\n sort(arg_buf.begin(),arg_buf.end(),comp_arg);\n arg_buf.erase(unique(arg_buf.begin(),arg_buf.end()),arg_buf.end());\n\n double mini = DINF; \n rep(i,(int)arg_buf.size()){\n double arg = arg_buf[i];\n rep(j,n) tmp[j] = rotate(ps[1][j],arg);\n sort(tmp,tmp+n);\n bool failed = false;\n rep(j,n) if( !( tmp[j] == ps[0][j] ) ) { failed = true; break; }\n if( !failed ) mini = min(mini,min(arg,2*M_PI-arg));\n }\n printf(\"%.11lf\\n\",mini);\n}\n \nint main(){\n while( cin >> n, n ){\n rep(i,2) rep(j,n) cin >> ps[i][j].x >> ps[i][j].y;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1408,"score_of_the_acc":-0.1069,"final_rank":8},{"submission_id":"aoj_2051_1039768","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 \nclass Point{\npublic:\n double x,y;\n \n Point(double x = 0,double y = 0): x(x),y(y){}\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n \n};\n \nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n \nconst double DINF = 1e20;\nint n;\nPoint ps[2][1010],tmp[1010];\n \ninline double getDist(Point p){ return sqrt(p.x*p.x+p.y*p.y); }\n \nbool comp_arg(const double &a,const double &b) { return !equals(fabs(a),fabs(b)) && fabs(a) < fabs(b); }\n \nvoid compute(){\n Point grv[2] = {Point(),Point()};\n rep(i,2) rep(j,n) grv[i] = grv[i] + ps[i][j];\n rep(i,2) grv[i] = grv[i] / (double)n;\n rep(i,2) rep(j,n) ps[i][j] = ps[i][j] - grv[i];\n sort(ps[0],ps[0]+n);\n sort(ps[1],ps[1]+n);\n \n vector<double> arg_buf;\n rep(i,min(10,n)) rep(j,n) {\n double dist[2] = { getDist(ps[0][i]), getDist(ps[1][j]) };\n if( !equals(dist[0],dist[1]) ) continue;\n arg_buf.push_back( atan2(ps[0][i].y,ps[0][i].x) - atan2(ps[1][j].y,ps[1][j].x) );\n }\n \n sort(arg_buf.begin(),arg_buf.end(),comp_arg);\n arg_buf.erase(unique(arg_buf.begin(),arg_buf.end()),arg_buf.end());\n \n rep(i,(int)arg_buf.size()){\n double arg = arg_buf[i];\n rep(j,n) tmp[j] = rotate(ps[1][j],arg);\n sort(tmp,tmp+n);\n bool failed = false;\n rep(j,n) if( !( tmp[j] == ps[0][j] ) ) { failed = true; break; }\n if( !failed ) { printf(\"%.10lf\\n\",fabs(arg)); break; }\n }\n \n}\n \nint main(){\n while( cin >> n, n ){\n rep(i,2) rep(j,n) cin >> ps[i][j].x >> ps[i][j].y;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1512,"score_of_the_acc":-0.1064,"final_rank":6},{"submission_id":"aoj_2051_1039744","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 \nclass Point{\npublic:\n double x,y;\n \n Point(double x = 0,double y = 0): x(x),y(y){}\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n \n};\n \nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n \nconst double DINF = 1e20;\nint n;\nPoint ps[2][1010],tmp[1010];\n \ninline double getDist(Point p){ return sqrt(p.x*p.x+p.y*p.y); }\n \nbool comp_arg(const double &a,const double &b) { return !equals(fabs(a),fabs(b)) && fabs(a) < fabs(b); }\n \nvoid compute(){\n Point grv[2] = {Point(),Point()};\n rep(i,2) rep(j,n) grv[i] = grv[i] + ps[i][j];\n rep(i,2) grv[i] = grv[i] / (double)n;\n rep(i,2) rep(j,n) ps[i][j] = ps[i][j] - grv[i];\n sort(ps[0],ps[0]+n);\n \n vector<double> arg_buf;\n rep(i,min(10,n)) rep(j,n) {\n double dist[2] = { getDist(ps[0][i]), getDist(ps[1][j]) };\n if( !equals(dist[0],dist[1]) ) continue;\n arg_buf.push_back( atan2(ps[0][i].y,ps[0][i].x) - atan2(ps[1][j].y,ps[1][j].x) );\n }\n \n sort(arg_buf.begin(),arg_buf.end(),comp_arg);\n arg_buf.erase(unique(arg_buf.begin(),arg_buf.end()),arg_buf.end());\n \n rep(i,(int)arg_buf.size()){\n double arg = arg_buf[i];\n rep(j,n) tmp[j] = rotate(ps[1][j],arg);\n sort(tmp,tmp+n);\n bool failed = false;\n rep(j,n) if( !( tmp[j] == ps[0][j] ) ) { failed = true; break; }\n if( !failed ) { printf(\"%.10lf\\n\",fabs(arg)); break; }\n }\n \n}\n \nint main(){\n while( cin >> n, n ){\n rep(i,2) rep(j,n) cin >> ps[i][j].x >> ps[i][j].y;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1512,"score_of_the_acc":-0.1064,"final_rank":6},{"submission_id":"aoj_2051_1039740","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 \nclass Point{\npublic:\n double x,y;\n \n Point(double x = 0,double y = 0): x(x),y(y){}\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n \n};\n \nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n \nconst double DINF = 1e20;\nint n;\nPoint ps[2][1010],tmp[1010];\n \ninline double getDist(Point p){ return sqrt(p.x*p.x+p.y*p.y); }\n \nbool comp_arg(const double &a,const double &b) { return !equals(fabs(a),fabs(b)) && fabs(a) < fabs(b); }\n \nvoid compute(){\n Point grv[2] = {Point(),Point()};\n rep(i,2) rep(j,n) grv[i] = grv[i] + ps[i][j];\n rep(i,2) grv[i] = grv[i] / (double)n;\n rep(i,2) rep(j,n) ps[i][j] = ps[i][j] - grv[i];\n sort(ps[0],ps[0]+n);\n sort(ps[1],ps[1]+n);\n \n vector<double> arg_buf;\n rep(i,min(7,n)) rep(j,n) {\n double dist[2] = { getDist(ps[0][i]), getDist(ps[1][j]) };\n if( !equals(dist[0],dist[1]) ) continue;\n arg_buf.push_back( atan2(ps[0][i].y,ps[0][i].x) - atan2(ps[1][j].y,ps[1][j].x) );\n }\n \n sort(arg_buf.begin(),arg_buf.end(),comp_arg);\n arg_buf.erase(unique(arg_buf.begin(),arg_buf.end()),arg_buf.end());\n \n rep(i,(int)arg_buf.size()){\n double arg = arg_buf[i];\n rep(j,n) tmp[j] = rotate(ps[1][j],arg);\n sort(tmp,tmp+n);\n bool failed = false;\n rep(j,n) if( !( tmp[j] == ps[0][j] ) ) { failed = true; break; }\n if( !failed ) { printf(\"%.10lf\\n\",fabs(arg)); break; }\n }\n \n}\n \nint main(){\n while( cin >> n, n ){\n rep(i,2) rep(j,n) cin >> ps[i][j].x >> ps[i][j].y;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1468,"score_of_the_acc":-0.089,"final_rank":5},{"submission_id":"aoj_2051_1039737","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 \nclass Point{\npublic:\n double x,y;\n \n Point(double x = 0,double y = 0): x(x),y(y){}\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n \n};\n \nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n \nconst double DINF = 1e20;\nint n;\nPoint ps[2][1010],tmp[1010];\n \ninline double getDist(Point p){ return sqrt(p.x*p.x+p.y*p.y); }\n \nbool comp_arg(const double &a,const double &b) { return !equals(fabs(a),fabs(b)) && fabs(a) < fabs(b); }\n \nvoid compute(){\n Point grv[2] = {Point(),Point()};\n rep(i,2) rep(j,n) grv[i] = grv[i] + ps[i][j];\n rep(i,2) grv[i] = grv[i] / (double)n;\n rep(i,2) rep(j,n) ps[i][j] = ps[i][j] - grv[i];\n sort(ps[0],ps[0]+n);\n sort(ps[1],ps[1]+n);\n \n vector<double> arg_buf;\n rep(i,min(10,n)) rep(j,n) {\n double dist[2] = { getDist(ps[0][i]), getDist(ps[1][j]) };\n if( !equals(dist[0],dist[1]) ) continue;\n arg_buf.push_back( atan2(ps[0][i].y,ps[0][i].x) - atan2(ps[1][j].y,ps[1][j].x) );\n }\n \n sort(arg_buf.begin(),arg_buf.end(),comp_arg);\n arg_buf.erase(unique(arg_buf.begin(),arg_buf.end()),arg_buf.end());\n \n rep(i,(int)arg_buf.size()){\n double arg = arg_buf[i];\n rep(j,n) tmp[j] = rotate(ps[1][j],arg);\n sort(tmp,tmp+n);\n bool failed = false;\n rep(j,n) if( !( tmp[j] == ps[0][j] ) ) { failed = true; break; }\n if( !failed ) { printf(\"%.10lf\\n\",fabs(arg)); break; }\n }\n \n}\n \nint main(){\n while( cin >> n, n ){\n rep(i,2) rep(j,n) cin >> ps[i][j].x >> ps[i][j].y;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1512,"score_of_the_acc":-0.0856,"final_rank":4},{"submission_id":"aoj_2051_1039697","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\nclass Point{\npublic:\n double x,y;\n\n Point(double x = 0,double y = 0): x(x),y(y){}\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n\n};\n\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n\nconst double DINF = 1e20;\nint n;\nPoint ps[2][1010],tmp[1010];\n\ninline double getDist(Point p){ return sqrt(p.x*p.x+p.y*p.y); }\n\nbool comp_arg(const double &a,const double &b) { return !equals(fabs(a),fabs(b)) && fabs(a) < fabs(b); }\n\nvoid compute(){\n Point grv[2] = {Point(),Point()};\n rep(i,2) rep(j,n) grv[i] = grv[i] + ps[i][j];\n rep(i,2) grv[i] = grv[i] / (double)n;\n rep(i,2) rep(j,n) ps[i][j] = ps[i][j] - grv[i];\n sort(ps[0],ps[0]+n);\n sort(ps[1],ps[1]+n);\n\n vector<double> arg_buf;\n rep(i,n) rep(j,n) {\n double dist[2] = { getDist(ps[0][i]), getDist(ps[1][j]) };\n if( !equals(dist[0],dist[1]) ) continue;\n double arg = atan2(ps[0][i].y,ps[0][i].x) - atan2(ps[1][j].y,ps[1][j].x);\n arg_buf.push_back(arg);\n }\n\n sort(arg_buf.begin(),arg_buf.end(),comp_arg);\n arg_buf.erase(unique(arg_buf.begin(),arg_buf.end()),arg_buf.end());\n\n rep(i,(int)arg_buf.size()){\n double arg = arg_buf[i];\n rep(j,n) tmp[j] = rotate(ps[1][j],arg);\n sort(tmp,tmp+n);\n bool failed = false;\n rep(j,n) if( !( tmp[j] == ps[0][j] ) ) { failed = true; break; }\n if( !failed ) { printf(\"%.11lf\\n\",fabs(arg)); break; }\n }\n\n}\n\nint main(){\n while( cin >> n, n ){\n rep(i,2) rep(j,n) cin >> ps[i][j].x >> ps[i][j].y;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3356,"score_of_the_acc":-0.9412,"final_rank":12},{"submission_id":"aoj_2051_1039680","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\nclass Point{\npublic:\n double x,y;\n\n Point(double x = 0,double y = 0): x(x),y(y){}\n\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n\n};\n\n//rad は角度をラジアンで持たせること\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n\nconst double DINF = 1e20;\nint n;\nPoint ps[2][1010],tmp[1010];\n\ninline double getDist(Point p){ return sqrt(p.x*p.x+p.y*p.y); }\n\nbool comp_arg(const double &a,const double &b) { return !equals(fabs(a),fabs(b)) && fabs(a) < fabs(b); }\n\nvoid compute(){\n Point grv[2] = {Point(),Point()};\n rep(i,2) rep(j,n) grv[i] = grv[i] + ps[i][j];\n rep(i,2) grv[i] = grv[i] / (double)n;\n rep(i,2) rep(j,n) ps[i][j] = ps[i][j] - grv[i];\n sort(ps[0],ps[0]+n);\n sort(ps[1],ps[1]+n);\n\n vector<double> arg_buf;\n rep(i,n) rep(j,n) {\n double dist[2] = { getDist(ps[0][i]), getDist(ps[1][j]) };\n if( !equals(dist[0],dist[1]) ) continue;\n double arg = atan2(ps[0][i].y,ps[0][i].x) - atan2(ps[1][j].y,ps[1][j].x);\n arg_buf.push_back(arg);\n }\n\n sort(arg_buf.begin(),arg_buf.end(),comp_arg);\n arg_buf.erase(unique(arg_buf.begin(),arg_buf.end()),arg_buf.end());\n\n rep(i,(int)arg_buf.size()){\n double arg = arg_buf[i];\n rep(j,n) tmp[j] = rotate(ps[1][j],arg);\n sort(tmp,tmp+n);\n bool failed = false;\n rep(j,n) if( !( tmp[j] == ps[0][j] ) ) { failed = true; break; }\n if( !failed ) { printf(\"%.11lf\\n\",fabs(arg)); break; }\n }\n\n}\n\nint main(){\n while( cin >> n, n ){\n rep(i,2) rep(j,n) cin >> ps[i][j].x >> ps[i][j].y;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3360,"score_of_the_acc":-0.9427,"final_rank":13},{"submission_id":"aoj_2051_772883","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 repi(i,a,b) for(int i = (a); i < (b); i++)\n#define rep(i,a) repi(i,0,a)\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\n#define pb push_back\n#define mp make_pair\n#define INF 1e9\n#define EPS 1e-6\n#define PI acos(-1.0)\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef complex<double> P;\ntypedef vector<P> G;\nint n;\n\nnamespace std{\n bool operator<(const P &a, const P &b) {\n\treturn abs(real(a)-real(b)) > EPS ? real(a) < real(b): imag(a) < imag(b);\n }\n}\n\nstruct cmp\n{\n bool operator ()(const double &a, const double &b) {\n\treturn a + EPS < b;\n }\n};\n\nP rotate(const P &a, double th) { return a*polar(1.0, th); }\ndouble angle(const P &a, const P &b) { return arg(conj(a)*b); }\n\nP centerG(const G &g) {\n P p = P(0, 0);\n rep(i, n) p += g[i];\n p /= n;\n return p;\n}\n\nint main(){\n while(cin >> n, n) {\n\tG g1(n), g2(n);\n\trep(i, n) cin >> g1[i].real() >> g1[i].imag();\n\trep(i, n) cin >> g2[i].real() >> g2[i].imag();\n\tP c1 = centerG(g1), c2 = centerG(g2);\n\trep(i, n) {\n\t g1[i] -= c1;\n\t g2[i] -= c2;\n\t}\n\t//cout <<\"c \" << c1 << \" \" << c2 << endl;\n\tG tg = g2;\n\tdouble ans = INF;\n\tsort(all(g1));\n\trep(i, n) {\n\t g2 = tg;\n\t double th = angle(g2[i], g1[0]); \n\t rep(j, n) g2[j] = rotate(g2[j], th);\n\t bool flag = true;\n\t \n\t sort(all(g2));\n\t rep(j, n) if(abs(g1[j] - g2[j]) > EPS) flag = false;\n\t \n\t //cout << \"a \"<< i << endl;\n\t //rep(j, n) cout << g1[j] << g2[j] << endl;\n\t \n\t if(flag) {\n\t\tif(th < 0) th = -th;\n\t\tif(th > PI) th = 2*PI - th;\n\t\tans = min(ans, th);\n\t }\n\t}\n\tprintf(\"%.11f\\n\", ans);\n }\n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":1396,"score_of_the_acc":-0.4146,"final_rank":10},{"submission_id":"aoj_2051_572988","code_snippet":"#include<set>\n#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\nconst double EPS=1e-7; // EPS=1e-8 だと誤差で間違う\nconst double INF=1e77;\nconst double PI=acos(-1);\n\nstruct point{\n\tdouble x,y;\n\tpoint():x(0),y(0){}\n\tpoint(double x,double y):x(x),y(y){}\n\tpoint &operator+=(const point &a){ x+=a.x; y+=a.y; return *this; }\n\tpoint &operator-=(const point &a){ x-=a.x; y-=a.y; return *this; }\n\tpoint &operator/=(double c){ x/=c; y/=c; return *this; }\n\tpoint operator+(const point &a)const{ return point(x+a.x,y+a.y); }\n\tpoint operator-(const point &a)const{ return point(x-a.x,y-a.y); }\n\tbool operator< (const point &a)const{ return x+EPS<a.x || abs(x-a.x)<EPS && y+EPS<a.y; }\n};\n\ndouble cross(const point &a,const point &b){ return a.x*b.y-a.y*b.x; }\n\ndouble abs(const point &a){ return sqrt(a.x*a.x+a.y*a.y); }\n\ndouble arg(const point &a){ double t=atan2(a.y,a.x); return t<0?t+2*PI:t; }\n\npoint rot(const point &a,double theta){ return point(a.x*cos(theta)-a.y*sin(theta),a.x*sin(theta)+a.y*cos(theta)); }\n\ntypedef vector<point> polygon;\n\nenum{CCW=1,CW=-1,ON=0};\nint ccw(const point &a,const point &b,const point &c){\n\tdouble rdir=cross(b-a,c-a);\n\tif(rdir> EPS) return CCW;\n\tif(rdir<-EPS) return CW;\n\treturn ON;\n}\n\npolygon convex_hull(vector<point> &P){\n\tint n=P.size();\n\tpolygon CH;\n\tif(n<=1){\n\t\tCH.insert(CH.end(),P.begin(),P.end());\n\t\treturn CH;\n\t}\n\tsort(P.begin(),P.end());\n\n\trep(_,2){\n\t\tint m=0;\n\t\tvector<point> half(n);\n\t\trep(i,n){\n\t\t\thalf[m++]=P[i];\n\t\t\twhile(m>=3 && ccw(half[m-3],half[m-2],half[m-1])==CW){\n\t\t\t\thalf[m-2]=half[m-1];\n\t\t\t\tm--;\n\t\t\t}\n\t\t}\n\t\tCH.insert(CH.end(),half.begin(),half.begin()+m-1);\n\t\treverse(P.begin(),P.end());\n\t}\n\n\treturn CH;\n}\n\nint main(){\n\tfor(int n;scanf(\"%d\",&n),n;){\n\t\tvector<point> P(n),Q(n);\n\t\trep(i,n) scanf(\"%lf%lf\",&P[i].x,&P[i].y);\n\t\trep(i,n) scanf(\"%lf%lf\",&Q[i].x,&Q[i].y);\n\n\t\tif(n==1){\n\t\t\tputs(\"0\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tpolygon F=convex_hull(P);\n\t\tpolygon G=convex_hull(Q);\n\n\t\tset<point> S(Q.begin(),Q.end());\n\n\t\tdouble ans=INF;\n\t\trep(i,G.size()){\n\t\t\tpoint v=G[i]-F[0];\n\t\t\tdouble theta=arg(G[(i+1)%G.size()]-G[i])-arg(F[1]-F[0]);\n\n\t\t\tbool ok=true;\n\t\t\trep(j,n){\n\t\t\t\tif(S.count(rot(P[j]-F[0],theta)+F[0]+v)==0){\n\t\t\t\t\tok=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ok){\n\t\t\t\ttheta=abs(theta);\n\t\t\t\twhile(theta>2*PI) theta-=2*PI;\n\t\t\t\tans=min(ans,theta);\n\t\t\t\tans=min(ans,2*PI-theta);\n\t\t\t}\n\t\t}\n\t\tprintf(\"%.9f\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1296,"score_of_the_acc":-0.0417,"final_rank":1},{"submission_id":"aoj_2051_572987","code_snippet":"#include<set>\n#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\nconst double EPS=1e-7; // EPS=1e-8 だと誤差で間違う\nconst double INF=1e77;\nconst double PI=acos(-1);\n\nstruct point{\n\tdouble x,y;\n\tpoint():x(0),y(0){}\n\tpoint(double x,double y):x(x),y(y){}\n\tpoint &operator+=(const point &a){ x+=a.x; y+=a.y; return *this; }\n\tpoint &operator-=(const point &a){ x-=a.x; y-=a.y; return *this; }\n\tpoint &operator/=(double c){ x/=c; y/=c; return *this; }\n\tpoint operator+(const point &a)const{ return point(x+a.x,y+a.y); }\n\tpoint operator-(const point &a)const{ return point(x-a.x,y-a.y); }\n\tbool operator< (const point &a)const{ return x+EPS<a.x || abs(x-a.x)<EPS && y+EPS<a.y; }\n};\n\ndouble cross(const point &a,const point &b){ return a.x*b.y-a.y*b.x; }\n\ndouble abs(const point &a){ return sqrt(a.x*a.x+a.y*a.y); }\n\ndouble arg(const point &a){ double t=atan2(a.y,a.x); return t<0?t+2*PI:t; }\n\npoint rot(const point &a,double theta){ return point(a.x*cos(theta)-a.y*sin(theta),a.x*sin(theta)+a.y*cos(theta)); }\n\ntypedef vector<point> polygon;\n\nenum{CCW=1,CW=-1,ON=0};\nint ccw(const point &a,const point &b,const point &c){\n\tdouble rdir=cross(b-a,c-a);\n\tif(rdir> EPS) return CCW;\n\tif(rdir<-EPS) return CW;\n\treturn ON;\n}\n\npolygon convex_hull(vector<point> &P){\n\tint n=P.size();\n\tpolygon CH;\n\tif(n<=1){\n\t\tCH.insert(CH.end(),P.begin(),P.end());\n\t\treturn CH;\n\t}\n\tsort(P.begin(),P.end());\n\n\trep(_,2){\n\t\tint m=0;\n\t\tvector<point> half(n);\n\t\trep(i,n){\n\t\t\thalf[m++]=P[i];\n\t\t\twhile(m>=3 && ccw(half[m-3],half[m-2],half[m-1])==CW){\n\t\t\t\thalf[m-2]=half[m-1];\n\t\t\t\tm--;\n\t\t\t}\n\t\t}\n\t\tCH.insert(CH.end(),half.begin(),half.begin()+m-1);\n\t\treverse(P.begin(),P.end());\n\t}\n\n\treturn CH;\n}\n\nint main(){\n\tfor(int n;scanf(\"%d\",&n),n;){\n\t\tvector<point> P(n),Q(n);\n\t\trep(i,n) scanf(\"%lf%lf\",&P[i].x,&P[i].y);\n\t\trep(i,n) scanf(\"%lf%lf\",&Q[i].x,&Q[i].y);\n\n\t\tif(n==1){\n\t\t\tputs(\"0\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tpolygon F=convex_hull(P);\n\t\tpolygon G=convex_hull(Q);\n\n\t\tset<point> S(Q.begin(),Q.end());\n\n\t\tdouble ans=INF;\n\t\trep(_,2){\n\t\t\trep(i,G.size()){\n\t\t\t\tpoint v=G[i]-F[0];\n\t\t\t\tdouble theta=arg(G[(i+1)%G.size()]-G[i])-arg(F[1]-F[0]);\n\n\t\t\t\tbool ok=true;\n\t\t\t\trep(j,n){\n\t\t\t\t\tif(S.count(rot(P[j]-F[0],theta)+F[0]+v)==0){\n\t\t\t\t\t\tok=false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(ok){\n\t\t\t\t\ttheta=abs(theta);\n\t\t\t\t\twhile(theta>2*PI) theta-=2*PI;\n\t\t\t\t\tans=min(ans,theta);\n\t\t\t\t\tans=min(ans,2*PI-theta);\n\t\t\t\t}\n\t\t\t}\n\t\t\treverse(G.begin(),G.end());\n\t\t}\n\t\tprintf(\"%.9f\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1296,"score_of_the_acc":-0.0417,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2051_5500120\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 1000000007\\n//#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define EPS 0.000000001\\n#define SIZE 1005\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\n\\t\\tif(fabs(x-p.x) > EPS){\\n\\n\\t\\t\\treturn x < p.x;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn y < p.y;\\n\\t\\t}\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n\\t}\\n\\n\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)\\\\n\\\",x,y);\\n\\t}\\n\\n\\tdouble x,y;\\n};\\n\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\n\\nint N;\\nPoint A[SIZE],B[SIZE],work[SIZE];\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\nstatic const int COUNTER_CLOCKWISE = 1;\\nstatic const int CLOCKWISE = -1;\\nstatic const int ONLINE_BACK = 2;\\nstatic const int ONLINE_FRONT = -2;\\nstatic const int ON_SEGMENT = 0;\\n\\n/*\\n * p0を基準点として、p1から見てp2が\\n * 反時計回り側にあれば\\n * COUNTER_CLOCKWISE\\n * */\\nint ccw(Point p0,Point p1,Point p2){\\n\\n\\tVector a = p1 - p0;\\n\\tVector b = p2 - p0;\\n\\n\\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\n/*点moveをbaseを中心にradラジアン回転させる\\nrad > 0なら反時計回り、rad < 0なら時計周り\\n*/\\nPoint rotate(Point base,Point move,double rad){\\n\\n\\tPoint ret;\\n\\tmove = move-base;\\n\\n\\tret.x = move.x*cos(rad)-move.y*sin(rad);\\n\\tret.y = move.x*sin(rad)+move.y*cos(rad);\\n\\n\\tret = ret+base;\\n\\n\\treturn ret;\\n}\\n\\n//点のradを求める関数\\ndouble calc_rad(Point p){\\n\\n\\tif(p.y == 0){\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\treturn M_PI;\\n\\t\\t}\\n\\n\\t}else if(p.x == 0){\\n\\n\\t\\tif(p.y > 0){\\n\\n\\t\\t\\treturn M_PI/2.0;\\n\\t\\t}else{\\n\\n\\n\\t\\t\\treturn 3*M_PI/2.0;\\n\\t\\t}\\n\\n\\t}else{\\n\\n\\t\\tdouble base = atan(fabs(p.y)/fabs(p.x));\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn base;\\n\\n\\t\\t\\t}else{ //p.y < 0\\n\\n\\t\\t\\t\\treturn 2*M_PI-base;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn M_PI-base;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\treturn base+M_PI;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nvoid func(){\\n\\n\\tPoint mid_A = Point(0,0);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&A[i].x,&A[i].y);\\n\\t\\tmid_A = mid_A + A[i];\\n\\t}\\n\\tmid_A = mid_A/N;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tA[i] = A[i]-mid_A;\\n\\t}\\n\\tsort(A,A+N);\\n\\n\\tPoint mid_B = Point(0,0);\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&B[i].x,&B[i].y);\\n\\t\\tmid_B = mid_B + B[i];\\n\\t}\\n\\n\\tmid_B = mid_B/N;\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tB[i] = B[i]-mid_B;\\n\\t}\\n\\n\\tdouble ans = BIG_NUM;\\n\\n\\tdouble base_rad = calc_rad(A[0]);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tdouble tmp_rad = calc_rad(B[i]);\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\twork[k] = rotate(Point(0,0),B[k],base_rad-tmp_rad);\\n\\t\\t}\\n\\t\\tsort(work,work+N);\\n\\n\\t\\tbool FLG = true;\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tif(A[k] == work[k]){\\n\\n\\t\\t\\t\\t//Do nothing\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(!FLG)continue;\\n\\n\\t\\tdouble diff = base_rad-tmp_rad;\\n\\t\\tif(diff < 0){\\n\\n\\t\\t\\tdiff += 2*M_PI;\\n\\t\\t}\\n\\n\\t\\tif(diff > M_PI){\\n\\n\\t\\t\\tdiff = 2*M_PI-diff;\\n\\t\\t}\\n\\n\\t\\tans = min(ans,diff);\\n\\t}\\n\\n\\tprintf(\\\"%.12lf\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3800,\n \"score_of_the_acc\": -1.2212,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2051_5500115\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 1000000007\\n//#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define EPS 0.000000001\\n#define SIZE 1005\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\n\\t\\tif(fabs(x-p.x) > EPS){\\n\\n\\t\\t\\treturn x < p.x;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn y < p.y;\\n\\t\\t}\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n\\t}\\n\\n\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)\\\\n\\\",x,y);\\n\\t}\\n\\n\\tdouble x,y;\\n};\\n\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\n\\nint N;\\nPoint A[SIZE],B[SIZE],work[SIZE];\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\nstatic const int COUNTER_CLOCKWISE = 1;\\nstatic const int CLOCKWISE = -1;\\nstatic const int ONLINE_BACK = 2;\\nstatic const int ONLINE_FRONT = -2;\\nstatic const int ON_SEGMENT = 0;\\n\\n/*\\n * p0を基準点として、p1から見てp2が\\n * 反時計回り側にあれば\\n * COUNTER_CLOCKWISE\\n * */\\nint ccw(Point p0,Point p1,Point p2){\\n\\n\\tVector a = p1 - p0;\\n\\tVector b = p2 - p0;\\n\\n\\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\n/*点moveをbaseを中心にradラジアン回転させる\\nrad > 0なら反時計回り、rad < 0なら時計周り\\n*/\\nPoint rotate(Point base,Point move,double rad){\\n\\n\\tPoint ret;\\n\\tmove = move-base;\\n\\n\\tret.x = move.x*cos(rad)-move.y*sin(rad);\\n\\tret.y = move.x*sin(rad)+move.y*cos(rad);\\n\\n\\tret = ret+base;\\n\\n\\treturn ret;\\n}\\n\\n//点のradを求める関数\\ndouble calc_rad(Point p){\\n\\n\\tif(p.y == 0){\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\treturn M_PI;\\n\\t\\t}\\n\\n\\t}else if(p.x == 0){\\n\\n\\t\\tif(p.y > 0){\\n\\n\\t\\t\\treturn M_PI/2.0;\\n\\t\\t}else{\\n\\n\\n\\t\\t\\treturn 3*M_PI/2.0;\\n\\t\\t}\\n\\n\\t}else{\\n\\n\\t\\tdouble base = atan(fabs(p.y)/fabs(p.x));\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn base;\\n\\n\\t\\t\\t}else{ //p.y < 0\\n\\n\\t\\t\\t\\treturn 2*M_PI-base;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn M_PI-base;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\treturn base+M_PI;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nbool DEBUG = false;\\n\\nvoid func(){\\n\\n\\tPoint mid_A = Point(0,0);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&A[i].x,&A[i].y);\\n\\t\\tmid_A = mid_A + A[i];\\n\\t}\\n\\tmid_A = mid_A/N;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tA[i] = A[i]-mid_A;\\n\\t}\\n\\tsort(A,A+N);\\n\\n\\tif(DEBUG){\\n\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\t\\tprintf(\\\"A[%d] \\\",i);\\n\\t\\t\\tA[i].debug();\\n\\t\\t}\\n\\t}\\n\\n\\tPoint mid_B = Point(0,0);\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&B[i].x,&B[i].y);\\n\\t\\tmid_B = mid_B + B[i];\\n\\t}\\n\\n\\tmid_B = mid_B/N;\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tB[i] = B[i]-mid_B;\\n\\t}\\n\\n\\tdouble ans = BIG_NUM;\\n\\n\\tdouble base_rad = calc_rad(A[0]);\\n\\n\\tif(DEBUG){\\n\\n\\t\\tprintf(\\\"base_rad:%.3lf\\\\n\\\",base_rad);\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tdouble tmp_rad = calc_rad(B[i]);\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\twork[k] = rotate(Point(0,0),B[k],base_rad-tmp_rad);\\n\\t\\t}\\n\\t\\tsort(work,work+N);\\n\\n\\t\\tif(DEBUG){\\n\\t\\t\\tprintf(\\\"\\\\ni:%d\\\\n\\\",i);\\n\\t\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\t\\twork[k].debug();\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tbool FLG = true;\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tif(A[k] == work[k]){\\n\\n\\t\\t\\t\\t//Do nothing\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(!FLG)continue;\\n\\n\\t\\tdouble diff = base_rad-tmp_rad;\\n\\t\\tif(diff < 0){\\n\\n\\t\\t\\tdiff += 2*M_PI;\\n\\t\\t}\\n\\n\\t\\tif(diff > M_PI){\\n\\n\\t\\t\\tdiff = 2*M_PI-diff;\\n\\t\\t}\\n\\n\\t\\tif(DEBUG){\\n\\n\\t\\t\\tprintf(\\\"diff:%.3lf\\\\n\\\",diff);\\n\\t\\t}\\n\\n\\t\\tans = min(ans,diff);\\n\\t}\\n\\n\\tprintf(\\\"%.12lf\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3780,\n \"score_of_the_acc\": -1.1925,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2051_3948859\",\n \"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 Point {\\n\\tdouble x, y;\\n\\tstruct Vector operator-(const Point& that) const;\\n\\tdouble distance_from(const Point& that) const;\\n};\\nstruct Vector {\\n\\tdouble dx, dy;\\n\\tdouble dot(const Vector& that) const;\\n\\tdouble cross(const Vector& that)const;\\n\\tdouble length() const;\\n\\tstruct Angle to_angle() const;\\n\\tstruct Angle angle_with(const Vector& that) const;\\n\\tVector rotate(const struct Angle& angle) const;\\n\\tVector operator-(const Vector& that) const;\\n};\\nstruct Angle {\\n\\tdouble sin, cos;\\n\\tdouble to_radian() const;\\n\\tAngle operator-() const;\\n};\\nint main() {\\n\\tstd::vector<double> result;\\n\\twhile (true) {\\n\\t\\tint n; std::cin >> n; if (n == 0) break;\\n\\t\\tstd::vector<Point> before_points(n), after_points(n);\\n\\t\\tfor (auto& point : before_points) std::cin >> point.x >> point.y;\\n\\t\\tfor (auto& point : after_points) std::cin >> point.x >> point.y;\\n\\t\\tif (n == 1) {\\n\\t\\t\\t//std::cout << 0 << '\\\\n';\\n\\t\\t\\tresult.push_back(0);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tconst auto origin = *std::min_element(before_points.begin(), before_points.end(), [](const Point& a, const Point& b) {return (a.y != b.y) ? a.y < b.y : a.x < b.x; });\\n\\t\\tstd::vector<Vector> before_vec; before_vec.reserve(n - 1);\\n\\t\\tfor (const auto& point : before_points) {\\n\\t\\t\\tif (origin.distance_from(point) > 1e-9) before_vec.push_back(point - origin);\\n\\t\\t}\\n\\t\\tconst auto base = *std::max_element(before_vec.begin(), before_vec.end(), [](const Vector& a, const Vector& b) {return std::abs(a.cross(b)) <= 1e-9 ? a.length() < b.length() : a.cross(b) < 0; });\\n\\t\\tconst auto angle = base.to_angle();\\n\\t\\tfor (auto& vec : before_vec) vec = vec.rotate(-angle); \\n\\t\\tstd::sort(before_vec.begin(), before_vec.end(), [base](const Vector& a, const Vector& b) { return std::abs(a.cross(b)) < 1e-12 ? a.length() < b.length() : a.cross(b) < 0; });\\n\\t\\tdouble min_radian = DBL_MAX;\\n\\t\\tfor (auto i = 0; i < n; ++i) {\\n\\t\\t\\tstd::vector<Vector> after_mapped; after_mapped.reserve(n - 1);\\n\\t\\t\\tfor (auto j = 0; j < n; ++j) if (i != j) after_mapped.push_back(after_points[j] - after_points[i]);\\n\\t\\t\\tconst auto new_base = *std::max_element(after_mapped.begin(), after_mapped.end(), [](const Vector& a, const Vector& b) {return std::abs(a.cross(b)) <= 1e-9 ? a.length() < b.length() : a.cross(b) < 0; });\\n\\t\\t\\tconst auto new_angle = new_base.to_angle();\\n\\t\\t\\tfor (auto& vec : after_mapped) vec = vec.rotate(-new_angle);\\n\\t\\t\\tif (std::any_of(after_mapped.begin(), after_mapped.end(), [](const Vector& a) {return a.dy < -1e-9; }))\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tstd::sort(after_mapped.begin(), after_mapped.end(), [](const Vector& a, const Vector& b) { return std::abs(a.cross(b)) < 1e-12 ? a.length() < b.length() : a.cross(b) < 0; });\\n\\t\\t\\tbool is_match = true;\\n\\t\\t\\tfor (auto j = 0; j < n - 1; ++j) {\\n\\t\\t\\t\\tif ((after_mapped[j] - before_vec[j]).length() > 1e-6) {\\n\\t\\t\\t\\t\\tis_match = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (is_match) {\\n\\t\\t\\t\\tmin_radian = std::min(min_radian, std::acos(base.angle_with(new_base).cos));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//std::cout << std::setprecision(15) << std::fixed << min_radian << '\\\\n';\\n\\t\\tresult.push_back(min_radian);\\n\\t}\\n\\tfor (const auto r : result) {\\n\\t\\tstd::cout << std::setprecision(10) << std::fixed << r << '\\\\n';\\n\\t}\\n}\\n\\n\\nVector Point::operator-(const Point& that) const\\n{\\n\\treturn Vector{ x - that.x, y - that.y };\\n}\\n\\ndouble Point::distance_from(const Point& that) const\\n{\\n\\treturn (*this - that).length();\\n}\\n\\ndouble Vector::dot(const Vector& that) const\\n{\\n\\treturn dx * that.dx + dy * that.dy;\\n}\\n\\ndouble Vector::cross(const Vector& that) const\\n{\\n\\treturn dx * that.dy - dy * that.dx;\\n}\\n\\ndouble Vector::length() const\\n{\\n\\treturn std::sqrt(dx * dx + dy * dy);\\n}\\n\\nAngle Vector::to_angle() const\\n{\\n\\tconst auto len = length();\\n\\treturn Angle{ dy / len, dx / len };\\n}\\n\\nAngle Vector::angle_with(const Vector& that) const\\n{\\n\\tconst auto len = length() * that.length();\\n\\treturn Angle{ cross(that) / len, dot(that) / len };\\n}\\n\\nVector Vector::rotate(const Angle& angle) const\\n{\\n\\treturn Vector{ dx * angle.cos - dy * angle.sin, dy * angle.cos + dx * angle.sin };\\n}\\n\\nVector Vector::operator-(const Vector& that) const\\n{\\n\\treturn Vector{ dx - that.dx, dy - that.dy };\\n}\\n\\ndouble Angle::to_radian() const\\n{\\n\\treturn (sin >= 0) ? std::acos(cos) : std::acos(-1) * 2 - std::acos(cos);\\n}\\n\\nAngle Angle::operator-() const\\n{\\n\\treturn Angle{ -sin, cos };\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -0.9199,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2051_3645090\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\nconst ld eps = 1e-4;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ld, ld> LDP;\\ntypedef pair<ll, ll> LP;\\ntypedef vector<int> vec;\\ntypedef vector<string> svec;\\n\\nbool eq(ld a, ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n};\\nclass Circle {\\npublic:\\n\\tPoint p; ld r;\\n};\\n\\nld dot(Point a, Point b) {\\n\\treturn real(conj(a)*b);\\n}\\nld cross(Point a, Point b) {\\n\\treturn imag(conj(a)*b);\\n}\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\treturn lhs.real() == rhs.real() ? lhs.imag() < rhs.imag() : lhs.real() < rhs.real();\\n\\t}\\n}\\nPoint proj(Line l, Point p) {\\n\\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.a - l.b);\\n}\\n\\nld dist_lp(Line l, Point p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\nint ccw(Point a, Point b, Point c) {\\n\\tb -= a; c -= a;\\n\\tif (cross(b, c) > eps)return 1;//a,b,cが反時計回り\\n\\tif (cross(b, c) < -eps)return -1;//a,b,cが時計回り\\n\\tif (dot(b, c) < 0)return 2;//c,a,bの順に一直線\\n\\tif (norm(b) < norm(c))return -2;//a,b,cの順に一直線\\n\\treturn 0;//a,c,bの順に一直線\\n}\\nbool isis_ll(Line l, Line m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\nPoint is_ll(Line s, Line t) {\\n\\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n\\n//直線lに幅dをつける\\nvector<Line> make_w(Line l, ld d) {\\n\\tPoint dif = l.b - l.a;\\n\\tdif = dif*Point{0, 1};\\n\\tdif = dif * (d / abs(dif));\\n\\tvector<Line> ret;\\n\\tfor (int id = 1; id >= -1; id -= 2) {\\n\\t\\tPoint a = l.a + dif * (ld)id;\\n\\t\\tPoint b = l.b + dif * (ld)id;\\n\\t\\tret.push_back({ a,b });\\n\\t}\\n\\treturn ret;\\n}\\n\\ntypedef vector<Point> polygon;\\npolygon ConvexHull(polygon p) {\\n\\tint n = p.size();\\n\\tint k = 0;\\n\\tsort(p.begin(), p.end());\\n\\tpolygon ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = p[i++]) {\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], p[i]) <= 0)--k;\\n\\t}\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) {\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], p[i]) <= 0)--k;\\n\\t}\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\npolygon convex_cut(const polygon &p, Line l) {\\n\\tvector<Point> ret;\\n\\trep(i, p.size()) {\\n\\t\\tPoint a = p[i], b = p[(i + 1) % p.size()];\\n\\t\\tif (ccw(l.a, l.b, a) != -1)ret.push_back(a);\\n\\t\\tif (ccw(l.a, l.b, a)*ccw(l.a, l.b, b)<0) {\\n\\t\\t\\tret.push_back(is_ll({ a,b }, l));\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\nld area(const polygon &p){\\n\\tld ret = 0;\\n\\tint n = p.size();\\n\\trep(j, n)ret += cross(p[j], p[(j + 1) % n]);\\n\\treturn ret / 2.0;\\n}\\nld max_distance(const polygon &p) {\\n\\t//assert(p.size()>1);\\n\\tpolygon g = ConvexHull(p);\\n\\tint n = g.size(), a = 0, b = 1;\\n\\tld ret = abs(g[0] - g[1]);\\n\\twhile (a < n) {\\n\\t\\tPoint p1 = g[a%n], p2 = g[(a + 1) % n];\\n\\t\\tPoint q1 = g[b%n], q2 = g[(b + 1) % n];\\n\\t\\tif (arg((p2 - p1) / (q1 - q2)) > 0)++b; else ++a;\\n\\t\\tret = max(ret, abs(p1 - q1));\\n\\t}\\n\\treturn ret;\\n}\\n\\nvector<Point> is_cc(Circle c1, Circle c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d*d + c1.r*c1.r - c2.r*c2.r) / (2 * d);\\n\\tld dfr = c1.r*c1.r - rc * rc;\\n\\tif (abs(dfr) < eps)dfr = 0.0;\\n\\tif (dfr < 0.0)return res;\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0)res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\nbool in_Circle(Circle a, Circle b) {\\n\\tld dist = abs(b.p - a.p);\\n\\treturn dist < b.r - a.r+eps;\\n}\\n\\nll gcd(ll x, ll y) {\\n\\tx = abs(x), y = abs(y);\\n\\tif (x < y)swap(x, y);\\n\\twhile (y) {\\n\\t\\tll r = x % y; x = y; y = r;\\n\\t}\\n\\treturn x;\\n}\\n\\n//0/0だけ気を付けて！\\nstruct ratio {\\n\\tll a, b;\\n\\tratio(ll x) { a = x; b = 1; };\\n\\tratio(ll x, ll y) {\\n\\t\\ta = x; b = y;\\n\\t\\tll g = gcd(x, y);\\n\\t\\tif (g > 0) {\\n\\t\\t\\ta /= g, b /= g;\\n\\t\\t\\tif (b < 0)a = -a, b = -b;\\n\\t\\t}\\n\\t};\\n\\n};\\n\\nvoid normalize(ratio &r) {\\n\\tll g = gcd(r.a, r.b);\\n\\tr.a /= g; r.b /= g;\\n\\tif (r.b < 0)r.b = -r.b, r.a = -r.a;\\n}\\nbool operator<(const ratio &x, const ratio &y) {\\n\\treturn x.a*y.b < x.b*y.a;\\n}\\nbool operator==(const ratio &x, const ratio &y) {\\n\\treturn x.a*y.b == x.b*y.a;\\n}\\n\\nbool isis_cc(Circle a, Circle b) {\\n\\tld dist = abs(b.p - a.p);\\n\\treturn dist < a.r + b.r;\\n}\\nint n;\\n\\nbool same(vector<Point> &a, vector<Point> &b, Point c, ld theta) {\\n\\tvector<Point>u;\\n\\trep(i, n) {\\n\\t\\tPoint dif = a[i] - a[0];\\n\\t\\tdif = dif * Point{ cos(theta),sin(theta) };\\n\\t\\tPoint nex = a[0] + dif + c;\\n\\t\\tu.push_back(nex);\\n\\t}\\n\\tsort(u.begin(), u.end());\\n\\trep(i, n) {\\n\\t\\tif (abs(u[i] - b[i]) > eps)return false;\\n\\t}\\n\\treturn true;\\n}\\nvoid solve() {\\n\\tvector<Point> a(n), b(n);\\n\\trep(i, n) {\\n\\t\\tld x, y; cin >> x >> y;\\n\\t\\ta[i] = { x,y };\\n\\t}\\n\\trep(i, n) {\\n\\t\\tld x, y; cin >> x >> y;\\n\\t\\tb[i] = { x,y };\\n\\t}\\n\\tsort(b.begin(), b.end());\\n\\tld ans = mod;\\n\\trep(i, n) {\\n\\t\\trep(j, n) {\\n\\t\\t\\tif (i == j)continue;\\n\\t\\t\\tld dist = abs(b[i] - b[j]);\\n\\t\\t\\tif (!eq(dist,abs(a[0] - a[1])))continue;\\n\\t\\t\\tPoint c = b[i] - a[0];\\n\\t\\t\\tld t1 = arg(a[1] - a[0]);\\n\\t\\t\\tld t2 = arg(b[j] - b[i]);\\n\\t\\t\\tld t = t2 - t1;\\n\\t\\t\\t//cout << t2 << \\\" \\\"<<t1 << endl;\\n\\t\\t\\twhile (t > 2 * pi)t -= 2 * pi;\\n\\t\\t\\twhile (t < 0)t += 2 * pi;\\n\\t\\t\\tif (eq(t, 2*pi))t = 0;\\n\\t\\t\\t//cout << t << endl;\\n\\t\\t\\tif (same(a, b, c, t)) {\\n\\t\\t\\t\\tans = min(ans, t);\\n\\t\\t\\t\\tans = min(ans, 2 * pi - t);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (ans == mod)ans = 0;\\n\\tcout << ans << endl;\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << fixed << setprecision(11);\\n\\twhile (cin >> n, n) {\\n\\t\\tsolve();\\n\\t}\\n\\t//solve();\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 3656,\n \"score_of_the_acc\": -1.4142,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2051_3643918\",\n \"code_snippet\": \"#include<iomanip>\\n#include<limits>\\n#include<thread>\\n#include<utility>\\n#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<set>\\n#include<map>\\n#include<vector>\\n#include<stack>\\n#include<queue>\\n#include<cmath>\\n#include<numeric>\\n#include<cassert>\\n#include<random>\\n#include<chrono>\\n#include<unordered_set>\\n#include<unordered_map>\\n#include<fstream>\\n#include<list>\\n#include<functional>\\n#include<bitset>\\n#include<complex>\\n#include<tuple>\\nusing namespace std;\\ntypedef unsigned long long int ull;\\ntypedef long long int ll;\\ntypedef pair<ll,ll> pll;\\ntypedef long double D;\\ntypedef complex<D> P;\\n#define F first\\n#define S second\\nconst ll E=1e18+7;\\nconst ll MOD=1000000007;\\n\\n\\ntemplate<typename T,typename U>istream & operator >> (istream &i,pair<T,U> &A){i>>A.F>>A.S; return i;}\\ntemplate<typename T>istream & operator >> (istream &i,vector<T> &A){for(auto &I:A){i>>I;} return i;}\\ntemplate<typename T,typename U>ostream & operator << (ostream &o,pair<T,U> &A){o<<A.F<<\\\" \\\"<<A.S; return o;}\\ntemplate<typename T>ostream & operator << (ostream &o,vector<T> &A){ll i=A.size(); for(auto &I:A){o<<I<<(--i?\\\" \\\":\\\"\\\");} return o;}\\ntemplate<typename T>vector<T> & cset(vector<T> &A,T e=T()){for(auto &I:A){I=e;} return A;}\\n\\nnamespace Geometry{\\n typedef long double D;\\n typedef complex<long double> P;\\n typedef pair<P,D> C;\\n \\n const D EPS=1e-9;\\n const D PI=asin(1)*2;\\n const D INF=1e18;\\n \\n const static bool comp(const P &p1,const P &p2){return p1.real()==p2.real()?p1.imag()<p2.imag():p1.real()<p2.real();}\\n \\n D dot(P p1,P p2){return p1.real()*p2.real()+p1.imag()*p2.imag();}\\n \\n D cross(P p1,P p2){return p1.real()*p2.imag()-p1.imag()*p2.real();}\\n \\n P project(P vec,P x){return vec*(x/vec).real();}\\n \\n P project(P p1,P p2,P x){return p1+project(p2-p1,x-p1);}\\n \\n P reflect(P vec,P x){return vec*conj(x/vec);}\\n \\n P reflect(P p1,P p2,P x){return p1+reflect(p2-p1,x-p1);}\\n \\n bool intersectSL(P p1,P p2,P vec){vec/=abs(vec); p1/=vec; p2/=vec; return (p1.imag()<EPS && p2.imag()>-EPS) || (p1.imag()>-EPS && p2.imag()<EPS);}\\n \\n bool intersectSL(P p1,P p2,P p3,P p4){return intersectSL(p1-p4,p2-p4,p3-p4);}\\n \\n bool intersectSS(P p1,P p2,P p3,P p4){return (dot(p2-p1,p3-p1)<-EPS && dot(p2-p1,p4-p1)<-EPS) || (dot(p1-p2,p3-p2)<-EPS && dot(p1-p2,p4-p2)<-EPS)?false:intersectSL(p1,p2,p3,p4) && intersectSL(p3,p4,p1,p2);}\\n \\n D distLP(P vec,P x){return abs((x/vec).imag())*abs(vec);}\\n \\n D distLP(P p1,P p2,P x){return distLP(p2-p1,x-p1);}\\n \\n D distSP(P p1,P p2,P x){return dot(p2-p1,x-p1)<-EPS?abs(x-p1):dot(p1-p2,x-p2)<-EPS?abs(x-p2):distLP(p1,p2,x);}\\n \\n D distSS(P p1,P p2,P p3,P p4){return intersectSS(p1,p2,p3,p4)?0.0:min(min(distSP(p1,p2,p3),distSP(p1,p2,p4)),min(distSP(p3,p4,p1),distSP(p3,p4,p2)));}\\n \\n P crosspointLL(P p1,P p2,P vec){return abs(cross(p2-p1,vec))<EPS?vec:vec*cross(p2-p1,p2)/cross(p2-p1,vec);}\\n \\n P crosspointLL(P p1,P p2,P p3,P p4){return p4+crosspointLL(p1-p4,p2-p4,p3-p4);}\\n \\n P crosspointSS(P p1,P p2,P p3,P p4){return distSP(p1,p2,p3)<EPS?p3:distSP(p1,p2,p4)<EPS?p4:crosspointLL(p1,p2,p3,p4);}\\n \\n bool intersectShL(P p1,P p2,P vec){vec/=abs(vec); return intersectSL(p1,p2,vec) && crosspointLL(p1/vec,p2/vec,vec/vec).real()>-EPS;}\\n \\n bool intersectShL(P p1,P p2,P p3,P p4){return intersectShL(p1-p3,p2-p3,p4-p3);}\\n \\n //1::in,0::on edge,-1::out\\n int contain(const vector<P> &poly,const P &p){\\n vector<P> A={{65537,96847},{-24061,6701},{56369,-86509},{-93763,-78049},{56957,10007}};\\n vector<bool> cnt(5,false);\\n for(int i=1;i<=poly.size();i++){\\n if(distSP(poly[i-1],poly[i%poly.size()],p)<EPS){return 0;}\\n for(int j=0;j<5;j++){\\n if(intersectShL(poly[i-1],poly[i%poly.size()],p,p+A[j])){cnt[j]=!cnt[j];}\\n }\\n }\\n int in=0;\\n for(int j=0;j<5;j++){if(cnt[j]){in++;}}\\n return in>=3?1:-1;\\n }\\n \\n vector<P> convexcut(const vector<P> &poly,P p1,P p2){\\n vector<P> ret;\\n for(int i=1;i<=poly.size();i++){\\n if(cross(p2-p1,poly[i-1]-p1)>-EPS){ret.push_back(poly[i-1]);}\\n if(intersectSL(poly[i-1],poly[i%poly.size()],p1,p2) && distLP(p1,p2,poly[i-1])>EPS && distLP(p1,p2,poly[i%poly.size()])>EPS){ret.push_back(crosspointLL(poly[i-1],poly[i%poly.size()],p1,p2));}\\n }\\n return ret;\\n }\\n \\n D area(const vector<P> &poly){\\n D ans=0;\\n for(int i=2;i<poly.size();i++){ans+=cross(poly[i-1]-poly[0],poly[i]-poly[0]);}\\n return abs(ans)/2;\\n }\\n \\n vector<P> convexhull(vector<P> pts){\\n vector<P> ret;\\n sort(pts.begin(),pts.end(),comp);\\n for(auto &I:pts){\\n if(!ret.empty() && I==ret.back()){continue;}\\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\\n ret.push_back(I);\\n }\\n reverse(pts.begin(),pts.end());\\n for(auto &I:pts){\\n if(!ret.empty() && I==ret.back()){continue;}\\n while(ret.size()>=2 && cross(ret.back()-ret[ret.size()-2],I-ret.back())<-EPS){ret.pop_back();}\\n ret.push_back(I);\\n }\\n if(ret[0]==ret.back()){ret.pop_back();}\\n return ret;\\n }\\n \\n //4::seperate,3::circumscribe,2::intersect,1::inscribe,0::contain,-1::same\\n int intersectCC(C c1,C c2){\\n D d=abs(c1.F-c2.F),r=c1.S+c2.S,dif=abs(c2.S-c1.S);\\n if(d<EPS && dif<EPS){return -1;}\\n if(d-r>EPS){return 4;}\\n if(d-r>-EPS){return 3;}\\n if(d-dif>EPS){return 2;}\\n if(d-dif>-EPS){return 1;}\\n return 0;\\n }\\n \\n vector<P> crosspointLC(P p1,P p2,C c){\\n vector<P> ret;\\n P pr=project(p1,p2,c.F);\\n D d=distLP(p1,p2,c.F);\\n if(d-c.S>EPS){return ret;}\\n if(d-c.S>-EPS){ret.push_back(pr); return ret;}\\n P vec=p2-p1; vec*=sqrt(c.S*c.S-d*d)/abs(vec);\\n ret.push_back(pr-vec);\\n ret.push_back(pr+vec);\\n return ret;\\n }\\n \\n vector<P> crosspointSC(P p1,P p2,C c){\\n vector<P> ret;\\n for(auto &I:crosspointLC(p1,p2,c)){if(distSP(p1,p2,I)<EPS){ret.push_back(I);}}\\n return ret;\\n }\\n \\n vector<P> crosspointCC(C c1,C c2){\\n vector<P> ret;\\n P vec=c2.F-c1.F;\\n D base=(c1.S*c1.S+norm(vec)-c2.S*c2.S)/(2*abs(vec));\\n D h=sqrt(c1.S*c1.S-base*base);\\n vec/=abs(vec);\\n ret.push_back(c1.F+vec*P(base,-h));\\n ret.push_back(c1.F+vec*P(base,h));\\n return ret;\\n }\\n \\n vector<P> tangentCP(C c,P p){return crosspointCC(c,C(p,sqrt(norm(c.F-p)-c.S*c.S)));}\\n \\n vector<pair<P,P>> tangentCC(C c1,C c2){\\n vector<pair<P,P>> ret;\\n P d=c2.F-c1.F;\\n for(D i:{-1,1}){\\n D r=c1.S+c2.S*i;\\n if(intersectCC(c1,c2)>i+1){\\n for(P s:{-1i,1i}){\\n P p=r+s*sqrt(norm(d)-norm(r));\\n ret.push_back({c1.F+d*c1.S/norm(d)*p,c2.F-d*i*c2.S/norm(d)*p});\\n }\\n }\\n }\\n return ret;\\n }\\n \\n D area(const vector<P> &poly,C c){\\n D ret=0;\\n for(int i=0;i<poly.size();i++){\\n P a=poly[i]-c.F,b=poly[(i+1)%poly.size()]-c.F;\\n if(abs(a)<c.S+EPS && abs(b)<c.S+EPS){ret+=cross(a,b);}\\n else{\\n vector<P> A=crosspointSC(a,b,{0,c.S});\\n if(A.empty()){ret+=c.S*c.S*arg(b/a);}\\n else{\\n ret+=(abs(a)<c.S?cross(a,A[0]):c.S*c.S*arg(A[0]/a));\\n ret+=(abs(b)<c.S?cross(A.back(),b):c.S*c.S*arg(b/A.back()));\\n ret+=cross(A[0],A.back());\\n }\\n }\\n }\\n return abs(ret)/2;\\n }\\n \\n //反時計回り\\n D diameter(const vector<P> &poly){\\n D ret=0;\\n ll l=0,r=0,n=poly.size();\\n if(n==2){return abs(poly[0]-poly[1]);}\\n for(int i=0;i<n;i++){\\n if(comp(poly[l],poly[i])){l=i;}\\n if(comp(poly[i],poly[r])){r=i;}\\n }\\n ll sl=r,sr=l;\\n while(sl!=l || sr!=r){\\n ret=max(ret,abs(poly[r]-poly[l]));\\n if(cross(poly[(l+1)%n]-poly[l],poly[(r+1)%n]-poly[r])<0){(++l)%=n;}\\n else{(++r)%=n;}\\n }\\n return ret;\\n }\\n \\n D closestpair(vector<P> pt){\\n sort(pt.begin(),pt.end(),comp);\\n D ret=INF;\\n for(ll i=1;i<pt.size();i<<=1){\\n for(ll j=0;i+j<pt.size();j+=i*2){\\n ll m=i+j;\\n vector<P> R;\\n D l=-INF,r=INF;\\n for(ll k=j;k<m;k++){l=max(l,pt[k].real());}\\n for(ll k=0;m+k<pt.size() && k<i;k++){r=min(r,pt[m+k].real());}\\n for(ll k=0;m+k<pt.size() && k<i;k++){if(pt[m+k].real()-l<ret){R.push_back(pt[m+k]);}}\\n ll idx=0;\\n for(ll k=j;k<m;k++){\\n if(r-pt[k].real()>ret){continue;}\\n while(idx<R.size() && pt[k].imag()-R[idx].imag()>ret){idx++;}\\n for(ll n=idx;n<R.size() && R[n].imag()-pt[k].imag()<ret;n++){ret=min(ret,abs(R[n]-pt[k]));}\\n }\\n inplace_merge(pt.begin()+j,pt.begin()+m,j+i*2<pt.size()?pt.begin()+j+2*i:pt.end(),[](const P &a,const P &b){return a.imag()==b.imag()?a.real()<b.real():a.imag()<b.imag();});\\n }\\n }\\n return ret;\\n }\\n \\n P centerofgravity(const vector<P> &pt){\\n P ret(0,0);\\n D wt=0;\\n for(int i=2;i<pt.size();i++){\\n D w2=cross(pt[i-1]-pt[0],pt[i]-pt[0]);\\n P p=(pt[0]+pt[i-1]+pt[i])/(D)3;\\n wt+=w2;\\n ret+=p*w2;\\n }\\n return ret/wt;\\n }\\n \\n istream & operator >> (istream &i,P &p){D x,y; i>>x>>y; p={x,y}; return i;}\\n istream & operator >> (istream &i,C &p){D x,y; i>>x>>y>>p.S; p.F={x,y}; return i;}\\n};\\n\\nusing namespace Geometry;\\n\\n\\n\\n\\nint main(){\\n ll n;\\n while(cin>>n,n){\\n vector<P> A(n),B(n);\\n cin>>A>>B;\\n P mid1(0,0),mid2(0,0);\\n for(auto &I:A){mid1+=I;} mid1/=n;\\n for(auto &I:B){mid2+=I;} mid2/=n;\\n for(auto &I:A){I-=mid1;}\\n for(auto &I:B){I-=mid2;}\\n sort(A.begin(),A.end(),[](P a,P b){return arg(a)+EPS<arg(b) || (abs(arg(a)-arg(b))<EPS*2 && abs(a)<abs(b));});\\n sort(B.begin(),B.end(),[](P a,P b){return arg(a)+EPS<arg(b) || (abs(arg(a)-arg(b))<EPS*2 && abs(a)<abs(b));});\\n //cout<<A<<endl<<B<<endl;\\n D ans=E;\\n ll k=-1;\\n for(int i=0;i<n;i++){if(abs(B[i])>EPS){k=i;}}\\n for(int i=0;i<n;i++){if(abs(B[i])>1){k=i;}}\\n if(k==-1){ans=0;}\\n for(int i=0;i<n && k!=-1;i++){\\n D dif=0;\\n P vec=A[i]/abs(A[i])/(B[k]/abs(B[k]));\\n for(int j=0;j<n;j++){\\n dif+=abs(A[(i+j)%n]/vec-B[(k+j)%n]);\\n }\\n if(dif<EPS*n){ans=min(ans,abs(arg(vec)));}\\n }\\n cout<<fixed<<setprecision(12)<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3388,\n \"score_of_the_acc\": -1.0788,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2051_3106199\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <set>\\nusing namespace std;\\nconst double EPS = 1e-8;\\nconst double INF = 1e12;\\nconst double PI = acos(-1);\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\n\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\nint ccw(P a, P b, P c){\\n b -= a;\\n c -= a;\\n if(cross(b,c) > EPS) return +1; //ccw\\n if(cross(b,c) < -EPS) return -1; //cw\\n if(dot(b,c) < -EPS) return +2; //c-a-b\\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\\n return 0; //a-c-b\\n}\\nP rotate(const P &p, double rad){\\n return p *P(cos(rad), sin(rad));\\n}\\n\\nint main(){\\n while(1){\\n int n;\\n cin >> n;\\n if(n==0) break;\\n\\n if(n==1){\\n double d;\\n cin >> d >> d >> d >> d;\\n cout << 0 << endl;\\n continue;\\n }\\n\\n //重心を原点に平行移動\\n vector<VP> p(2, VP(n));\\n for(int d=0; d<2; d++){\\n P centroid(0, 0);\\n for(int i=0; i<n; i++){\\n double x,y;\\n cin >> x >> y;\\n p[d][i] = P(x, y);\\n centroid += p[d][i];\\n }\\n centroid /= n;\\n //p0が重心に重なると角度が取れなくなるので例外処理\\n if(p[d][0] == centroid){\\n swap(p[d][0], p[d][1]);\\n }\\n for(int i=0; i<n; i++){\\n p[d][i] -= centroid;\\n }\\n }\\n\\n //同じ点が2点以上ないという仮定で、全部このsetに入って入ればokとする\\n set<P> pset;\\n for(int i=0; i<n; i++){\\n pset.insert(p[0][i]);\\n }\\n double ans = INF;\\n for(int i=0; i<n; i++){\\n //p[1][i]を回転させてp[0][0]に合わせる\\n if(!EQ(abs(p[0][0]), abs(p[1][i]))) continue;\\n double angle = arg(p[1][i]/p[0][0]);\\n bool ok = true;\\n for(int j=0; j<n; j++){\\n P rot = rotate(p[1][j], -angle);\\n if(pset.find(rot) == pset.end()){\\n ok = false;\\n break;\\n }\\n }\\n if(ok){\\n ans = min(ans, abs(angle));\\n }\\n }\\n cout << fixed << setprecision(10);\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3756,\n \"score_of_the_acc\": -1.0163,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2051_2859319\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\n\\n/* 幾何の基本 */\\n\\n#include <complex>\\n\\ntypedef complex<ld> Point;\\n\\n\\nconst ld pi = acos(-1.0);\\nconst ld dtop = pi / 180.;\\nconst ld ptod = 1. / dtop;\\n\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() > rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\n// 点の入力\\nPoint input_Point() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn Point(x, y);\\n}\\n\\n// 誤差つき等号判定\\nbool eq(const ld a, const ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\n// 内積\\nld dot(const Point& a, const Point& b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\n// 外積\\nld cross(const Point& a, const Point& b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\n// 直線の定義\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\tPoint operator[](const int _num)const {\\n\\t\\tif (_num == 0)return a;\\n\\t\\telse if (_num == 1)return b;\\n\\t\\telse {\\n\\t\\t\\tassert(false);\\n\\t\\t\\treturn Point();\\n\\t\\t}\\n\\t}\\n};\\n\\n// 円の定義\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n\\tCircle() : p(Point(0, 0)), r(0) {}\\n\\tCircle(Point p, ld r) : p(p), r(r) {}\\n};\\n\\n// ccw\\n// 1: a,b,cが反時計周りの順に並ぶ\\n//-1: a,b,cが時計周りの順に並ぶ\\n// 2: c,a,bの順に直線に並ぶ\\n//-2: a,b,cの順に直線に並ぶ\\n// 0: a,c,bの順に直線に並ぶ\\nint ccw(const Point& a, const Point &b, const Point &c) {\\n\\tconst Point nb(b - a);\\n\\tconst Point nc(c - a);\\n\\tif (cross(nb, nc) > eps) return 1; // a,b,cが反時計周りの順に並ぶ\\n\\tif (cross(nb, nc) < -eps) return -1; // a,b,cが時計周りの順に並ぶ\\n\\tif (dot(nb, nc) < 0) return 2; // c,a,bの順に直線に並ぶ\\n\\tif (norm(nb) < norm(nc)) return -2; // a,b,cの順に直線に並ぶ\\n\\treturn 0; // a,c,bの順に直線に並ぶ\\n}\\n\\n\\n/* 交差判定 */\\n\\n// 直線と直線の交差判定\\nbool isis_ll(const Line& l, const Line& m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n\\n// 直線と線分の交差判定\\nbool isis_ls(const Line& l, const Line& s) {\\n\\treturn isis_ll(l, s) &&\\n\\t\\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// 線分と線分の交差判定\\nbool isis_ss(const Line& s, const Line& t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n\\t\\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// 点の直線上判定\\nbool isis_lp(const Line& l, const Point& p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n\\n// 点の線分上判定\\nbool isis_sp(const Line& s, const Point& p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\n// 垂線の足\\nPoint proj(const Line &l, const Point& p) {\\n\\tld t = dot(p - l.a, l.b - l.a) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.b - l.a);\\n}\\n\\n//線対象の位置にある点\\nPoint reflect(const Line &l, const Point &p) {\\n\\tPoint pr = proj(l, p);\\n\\treturn pr * 2.l - p;\\n}\\n\\n// 直線と直線の交点\\nPoint is_ll(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tassert(cross(sv, tv) != 0);\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n// 直線と直線の交点\\nvector<Point> is_ll2(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\\n\\telse {\\n\\t\\tvector<Point>ans;\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\\n\\t\\t\\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n// 線分と線分の交点\\n// 重なってる部分あるとassert(false)\\nPoint is_ss(const Line &s, const Line& t) {\\n\\tif (isis_ss(s, t)) {\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tfor (int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\tif (s[k] == t[l])return s[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn is_ll(s, t);\\n\\t}\\n\\telse {\\n\\t\\t//先にisis_ssしてね\\n\\t\\tassert(false);\\n\\t\\treturn Point(0, 0);\\n\\t}\\n}\\n// 線分と線分の交点\\nvector<Point> is_ss2(const Line &s, const Line& t) {\\n\\tvector<Point> kouho(is_ll2(s, t));\\n\\tvector<Point>ans;\\n\\tfor (auto p : kouho) {\\n\\t\\tif (isis_sp(s, p) && isis_sp(t, p))ans.emplace_back(p);\\n\\t}\\n\\treturn ans;\\n}\\n// 直線と点の距離\\nld dist_lp(const Line& l, const Point& p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\n//直線と直線の距離\\nld dist_ll(const Line& l, const Line& m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\n// 直線と線分の距離\\nld dist_ls(const Line& l, const Line& s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\n// 線分と点の距離\\nld dist_sp(const Line& s, const Point& p) {\\n\\tPoint r = proj(s, p);\\n\\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// 線分と線分の距離\\nld dist_ss(const Line& s, const Line& t) {\\n\\tif (isis_ss(s, t)) return 0;\\n\\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\\n}\\n\\n\\n//直線と直線の二等分線のベクトル\\nLine line_bisection(const Line &s, const Line &t) {\\n\\tconst Point laglanju(is_ll(s, t));\\n\\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\\n\\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\\n\\n\\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\\n}\\n//点と点の垂直二等分線 aを左に見ながら\\nLine point_bisection(const Point&a, const Point&b) {\\n\\tconst Point cen((a + b) / 2.l);\\n\\tconst Point vec = (b - a)*Point(0, 1);\\n\\treturn Line(cen, cen + vec);\\n}\\n\\n//三つの点からなる外心\\nPoint outer_center(const vector<Point>&ps) {\\n\\tassert(ps.size() == 3);\\n\\tLine l1 = point_bisection(ps[0], ps[1]);\\n\\tLine l2 = point_bisection(ps[1], ps[2]);\\n\\treturn is_ll(l1, l2);\\n}\\n\\n\\n//三つの直線からなる内心\\n//三つの直線が並行でないことは確かめといてね\\nPoint inner_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\\n\\tLine bi1(line_bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\\n\\tLine bi2(line_bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\\n\\tif (bi1[0] == bi2[0])return bi1[0];\\n\\telse {\\n\\t\\treturn is_ll(bi1, bi2);\\n\\t}\\n}\\n\\n//三つの直線からなる傍心\\n//三つの直線が並行でないことは確かめといてね\\nvector<Point> ex_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\\n\\tvector<Point>ecs;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tLine bi1(line_bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\\n\\t\\tLine bi2(line_bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\\n\\t\\tecs.push_back(is_ll(bi1, bi2));\\n\\t}\\n\\treturn ecs;\\n}\\n\\n\\n//a,b:並行\\n//c:並行でない\\n//三つの直線から同距離の位置を求める。\\nvector<Point> same_dis(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tvertics.push_back(is_ll(ls[0], ls[2]));\\n\\tvertics.push_back(is_ll(ls[1], ls[2]));\\n\\n\\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\\n\\tLine bis(line_bisection(ls[0], ls[1]));\\n\\tvector<Point>ecs;\\n\\n\\tLine abi(line_bisection(Line(vertics[0], vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, abi));\\n\\n\\n\\tLine bbi(line_bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, bbi));\\n\\n\\treturn ecs;\\n}\\n/* 円 */\\n\\n// 円と円の交点\\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps) dfr = 0.0;\\n\\telse if (dfr < 0.0) return res; // no intersection\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\n/*\\n点が円の中にいるか\\n0 => out\\n1 => on\\n2 => in*/\\nint is_in_Circle(const Point& p, const Circle &cir) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\nint is_in_Circle(const Circle &cir, const Point& p) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\n/*\\n円lcが円rcの中にいるか\\n0 => out\\n1 => on\\n2 => in*/\\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\\n\\tld dis = abs(lc.p - rc.p);\\n\\tif (dis < rc.r - lc.r - eps)return 2;\\n\\telse if (dis>rc.r - lc.r + eps)return 0;\\n\\telse return 1;\\n}\\n\\n// 円と直線の交点\\nvector<Point> is_lc(const Circle& c, const Line& l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d < c.r + eps) {\\n\\t\\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\\n\\t\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\t\\tres.push_back(proj(l, c.p) + len * nor);\\n\\t\\tres.push_back(proj(l, c.p) - len * nor);\\n\\t}\\n\\treturn res;\\n}\\n\\n// 円と線分の距離\\nvector<Point> is_sc(const Circle& c, const Line& l) {\\n\\tvector<Point> v = is_lc(c, l), res;\\n\\tfor (Point p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\n// 円と点の接線\\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\\n\\tvector<Line> ret;\\n\\tPoint v = c.p - p;\\n\\tld d = abs(v);\\n\\tld l = sqrt(norm(v) - c.r * c.r);\\n\\tif (isnan(l)) { return ret; }\\n\\tPoint v1 = v * Point(l / d, c.r / d);\\n\\tPoint v2 = v * Point(l / d, -c.r / d);\\n\\tret.push_back(Line(p, p + v1));\\n\\tif (l < eps) return ret;\\n\\tret.push_back(Line(p, p + v2));\\n\\treturn ret;\\n}\\n\\n// 円と円の接線\\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Line> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\\n\\t\\tret = tangent_cp(c1, center);\\n\\t}\\n\\tif (abs(c1.r - c2.r) > eps) {\\n\\t\\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<Line> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), nret.begin(), nret.end());\\n\\t}\\n\\telse {\\n\\t\\tPoint v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\\n\\t\\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\\n\\t\\tret.push_back(Line(q1, q1 + v));\\n\\t\\tret.push_back(Line(q2, q2 + v));\\n\\t}\\n\\treturn ret;\\n}\\n//二つの円の重なり面積\\nld two_Circle_area(const Circle&l, const Circle&r) {\\n\\tld dis = abs(l.p - r.p);\\n\\tif (dis > l.r + r.r)return 0;\\n\\telse if (dis + r.r < l.r) {\\n\\t\\treturn r.r*r.r*pi;\\n\\t}\\n\\telse if (dis + l.r < r.r) {\\n\\t\\treturn l.r*l.r*pi;\\n\\t}\\n\\telse {\\n\\t\\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\\n\\t\\t\\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\\n\\t\\t\\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n/* 多角形 */\\n\\ntypedef vector<Point> Polygon;\\n\\n\\n\\n//多角形(複数の点)の最小包含円をO(N=頂点数)で求めるアルゴリズム\\n//同一直線上に三つの点がないこと\\n#include<random>\\nCircle welzl(vector<Point>ps) {\\n\\tstruct solver {\\n\\t\\tCircle solve(vector<Point>&ps, vector<Point>&rs) {\\n\\t\\t\\tif (ps.empty() || rs.size() == 3) {\\n\\t\\t\\t\\tif (rs.size() == 1) {\\n\\t\\t\\t\\t\\treturn Circle(Point(rs[0]), 0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (rs.size() == 2) {\\n\\t\\t\\t\\t\\treturn Circle((rs[0] + rs[1]) / 2.0l, abs(rs[1] - rs[0]) / 2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (rs.size() == 3) {\\n\\t\\t\\t\\t\\tvector<Line> ls(3);\\n\\t\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\t\\tls[i] = Line(rs[i], rs[(i + 1) % 3]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tPoint center = outer_center(rs);\\n\\t\\t\\t\\t\\treturn Circle(center, abs(center - rs[0]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\treturn Circle(Point(), 0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\n\\t\\t\\t\\tPoint p_ba = ps.back();\\n\\t\\t\\t\\tps.pop_back();\\n\\t\\t\\t\\tCircle d = solve(ps, rs);\\n\\t\\t\\t\\tps.push_back(p_ba);\\n\\t\\t\\t\\tif (is_in_Circle(d, p_ba)) {\\n\\t\\t\\t\\t\\treturn d;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\trs.push_back(p_ba);\\n\\t\\t\\t\\t\\tps.pop_back();\\n\\t\\t\\t\\t\\tauto ans = solve(ps, rs);\\n\\t\\t\\t\\t\\tps.push_back(p_ba);\\n\\t\\t\\t\\t\\trs.pop_back();\\n\\t\\t\\t\\t\\treturn ans;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}so;\\n\\tstd::random_device rd;\\n\\tstd::mt19937 mt(rd());\\n\\tshuffle(ps.begin(), ps.end(), mt);\\n\\tvector<Point>rs;\\n\\tCircle ans = so.solve(ps, rs);\\n\\treturn ans;\\n}\\n// 面積\\nld get_area(const Polygon &p) {\\n\\tld res = 0;\\n\\tint n = p.size();\\n\\tfor (int j = 0; j<n; ++j) res += cross(p[j], p[(j + 1) % n]);\\n\\treturn res / 2;\\n}\\n\\n//多角形の回転方向\\nbool is_counter_clockwise(const Polygon &poly) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\\n\\t\\tangle += arg((c - b) / (b - a));\\n\\t}\\n\\treturn angle > eps;\\n}\\n\\n// 円の内外判定\\n/*0 => out\\n1 => on\\n2 => in*/\\nint is_in_Polygon(const Polygon &poly, const Point& p) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n];\\n\\t\\tif (isis_sp(Line(a, b), p)) return 1;\\n\\t\\tangle += arg((b - p) / (a - p));\\n\\t}\\n\\treturn eq(angle, 0) ? 0 : 2;\\n}\\n//円の内外判定2 高速\\nenum { out, on, in };\\nint convex_contains(const Polygon &P, const Point &p) {\\n\\tconst int n = P.size();\\n\\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\\n\\tint a = 0, b = n;\\n\\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\\n\\t\\tint c = (a + b) / 2;\\n\\t\\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\\n\\t\\t\\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\\n\\t\\t\\telse a = c;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\\n\\t\\t\\telse b = c;\\n\\t\\t}\\n\\t}\\n\\tb %= n;\\n\\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\\n\\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\\n\\treturn 1;\\n}\\n\\n// 凸包\\n//点や線を返すことも有り得るので注意\\nPolygon convex_hull(vector<Point> ps) {\\n\\tint n = ps.size();\\n\\tint k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tPolygon ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++])\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n\\n\\n//凸カット\\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\\n\\tint n = ps.size();\\n\\tPolygon q;\\n\\tPolygon r;\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = ps[i], b = ps[(i + 1) % n];\\n\\t\\tLine m = Line(a, b);\\n\\t\\tif (ccw(l.a, l.b, a) != -1) q.push_back(a);\\n\\t\\tif (ccw(l.a, l.b, a) != 1) r.push_back(a);\\n\\t\\tif (ccw(l.a, l.b, a) * ccw(l.a, l.b, b) < 0 && isis_ll(l, m)) {\\n\\t\\t\\tq.push_back(is_ll(l, m));\\n\\t\\t\\tr.push_back(is_ll(l, m));\\n\\t\\t}\\n\\t}\\n\\tconst vector<Polygon>polys{ q,r };\\n\\treturn polys;\\n}\\n\\nPolygon cen(Polygon po) {\\n\\tPoint cen;\\n\\tfor (auto p : po) {\\n\\t\\tcen += p;\\n\\t}\\n\\tcen /= po.size();\\n\\tfor (auto&p : po) {\\n\\t\\tp -= cen;\\n\\t}\\n\\treturn po;\\n}\\n\\nint main() {\\n\\tcout<<setprecision(10)<<fixed;\\n\\tcout<<setprecision(10)<<fixed;\\n\\tcout<<setprecision(10)<<fixed;\\n\\tcout<<setprecision(10)<<fixed;\\n\\tcout<<setprecision(10)<<fixed;\\n\\twhile (true){\\n\\t\\tint N;cin>>N;\\n\\t\\tif(!N)break;\\n\\t\\tPolygon p1,p2;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tld x,y; cin>>x>>y;\\n\\t\\t\\tp1.emplace_back(x,y);\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tld x,y; cin>>x>>y;\\n\\t\\t\\tp2.emplace_back(x,y);\\n\\t\\t}\\n\\t\\tp1=cen(p1);\\n\\t\\tp2=cen(p2);\\n\\n\\t\\tld ans=1e9;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tld theta1=atan2l(p1[0].imag(),p1[0].real());\\n\\t\\t\\tld theta2=atan2l(p2[i].imag(),p2[i].real());\\n\\n\\t\\t\\tif (theta2 > theta1) {\\n\\t\\t\\t\\ttheta1+=2*pi;\\n\\t\\t\\t}\\n\\t\\t\\tld sa_theta=theta1-theta2;\\n\\n\\t\\t\\tPolygon next_poly(p2);\\n\\t\\t\\tfor (auto &p : next_poly) {\\n\\t\\t\\t\\tPoint np;\\n\\t\\t\\t\\tnp=Point(p.real()*cos(sa_theta)-p.imag()*sin(sa_theta),p.real()*(sin(sa_theta))+p.imag()*cos(sa_theta));\\n\\t\\t\\t\\tp=np;\\n\\t\\t\\t}\\n\\n\\t\\t\\tauto comp = [](const Point&l, const Point&r)-> bool { return abs(l.real() - r.real()) < eps ? abs(l.imag() - r.imag()) < eps ? false : l.imag() < r.imag() : l.real() < r.real(); };\\n\\t\\t\\t std::set <Point, decltype(comp)> aa(comp);\\n\\n\\t\\t\\t for (auto p : next_poly) {\\n\\t\\t\\t\\t aa.emplace(p);\\n\\t\\t\\t }\\n\\t\\t\\t for (auto p : p1) {\\n\\t\\t\\t\\t aa.emplace(p);\\n\\t\\t\\t }\\n\\n\\t\\t\\t if (aa.size() == N) {\\n\\t\\t\\t\\t ans=min(ans,sa_theta);\\n\\t\\t\\t\\t ans=min(ans,2*pi-sa_theta);\\n\\t\\t\\t }\\n\\n\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 490,\n \"memory_kb\": 3820,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2051_1679722\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cassert>\\n#include <cstring>\\n#include <iostream>\\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 TRACE(x) cout << #x << \\\" = \\\" << x << endl\\n#define _ << \\\" _ \\\" <<\\n\\ntypedef long long llint;\\n\\nconst int MAXN = 1000;\\nconst double eps = 1e-7;\\n\\ninline bool lt(double x, double y) { return x+eps < y; }\\ninline bool gt(double x, double y) { return lt(y, x); }\\ninline bool eq(double x, double y) { return !lt(x, y) && !gt(x, y); }\\n\\nstruct Pt {\\n double x, y;\\n Pt operator - (const Pt &b) { return Pt{x-b.x, y-b.y}; }\\n};\\n\\ninline double norm(const Pt &a) {\\n return sqrt(a.x*a.x + a.y*a.y);\\n}\\n\\ninline double ccw(const Pt &a, const Pt &b, const Pt &c) {\\n return a.x * (b.y-c.y) + b.x * (c.y-a.y) + c.x * (a.y-b.y);\\n}\\n\\nint n;\\nPt P1[MAXN], P2[MAXN], P3[MAXN];\\nvector<Pt> H1, H2;\\n\\ndouble rot1, rot2, ans;\\n\\nbool load(void) {\\n scanf(\\\"%d\\\", &n);\\n if (n == 0) return false;\\n REP (i, n) scanf(\\\"%lf%lf\\\", &P1[i].x, &P1[i].y);\\n REP (i, n) scanf(\\\"%lf%lf\\\", &P2[i].x, &P2[i].y);\\n return true;\\n}\\n\\nbool cmp(const Pt &a, const Pt &b) {\\n if (!eq(a.x, b.x)) return lt(a.x, b.x);\\n return lt(a.y, b.y);\\n}\\n\\nvoid convex_hull(Pt *P, int n, vector<Pt> &h) {\\n sort(P, P+n, cmp);\\n\\n int lsize = 0, usize = 0;\\n vector<Pt> lo, up;\\n for (int i = 0; i < n; ++i) {\\n while (lsize >= 2 && !lt(ccw(lo[lsize-2], lo[lsize-1], P[i]), 0.0)) {\\n --lsize;\\n lo.pop_back();\\n }\\n lo.push_back(P[i]);\\n ++lsize;\\n }\\n\\n for (int i = n-1; i >= 0; --i) {\\n while (usize >= 2 && !lt(ccw(up[usize-2], up[usize-1], P[i]), 0.0)) {\\n --usize;\\n up.pop_back();\\n }\\n up.push_back(P[i]);\\n ++usize;\\n }\\n\\n h.clear();\\n for (int i = 0; i < lsize; ++i)\\n h.push_back(lo[i]);\\n for (int i = 1; i < usize-1; ++i)\\n h.push_back(up[i]);\\n}\\n\\nvoid translate(Pt *p, int n, double dx, double dy) {\\n REP (i, n) p[i].x += dx, p[i].y += dy;\\n}\\n\\nvoid rotate(Pt *p, int n, double cos_alpha, double sin_alpha) {\\n REP (i, n) {\\n double nx = p[i].x * cos_alpha - p[i].y * sin_alpha,\\n ny = p[i].x * sin_alpha + p[i].y * cos_alpha;\\n p[i] = Pt{nx, ny};\\n }\\n}\\n\\nbool check(int id) {\\n for (int sgn: {-1, 1}) {\\n memcpy(P3, P2, sizeof P2);\\n translate(P3, n, -H2[id].x, -H2[id].y); \\n int nid = (id+1) % (int)H2.size();\\n Pt v = H2[nid]-H2[id];\\n rotate(P3, n, sgn*v.y/norm(v), sgn*v.x/norm(v));\\n sort(P3, P3+n, cmp);\\n\\n bool ok = true;\\n REP (i, n) {\\n if (!eq(P1[i].x, P3[i].x)) { ok = false; break; }\\n if (!eq(P1[i].y, P3[i].y)) { ok = false; break; }\\n }\\n if (ok) {\\n rot2 = atan2(sgn*v.y, sgn*v.x);\\n double tmp = rot2 - rot1 + 2*M_PI;\\n while (gt(tmp, 2*M_PI)) tmp -= 2*M_PI;\\n ans = min(ans, min(tmp, 2*M_PI-tmp));\\n }\\n }\\n return false;\\n}\\n\\nvoid solve(void) {\\n if (n == 1) {\\n printf(\\\"0.0\\\\n\\\");\\n return;\\n }\\n\\n ans = 10.0;\\n\\n convex_hull(P1, n, H1);\\n convex_hull(P2, n, H2);\\n\\n translate(P1, n, -H1[0].x, -H1[0].y);\\n Pt v = H1[1]-H1[0];\\n rotate(P1, n, v.y/norm(v), v.x/norm(v));\\n rot1 = atan2(v.y/norm(v), v.x/norm(v));\\n sort(P1, P1+n, cmp);\\n\\n REP (i, n) check(i);\\n printf(\\\"%.10lf\\\\n\\\", ans);\\n}\\n\\n\\nint main(void) {\\n\\n while (load()) solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3496,\n \"score_of_the_acc\": -1.1841,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2051_1364823\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 1000;\\n\\nconst double DELTA = 1e-4;\\nconst double DELTA2 = 1e-8;\\nconst double PI = acos(-1);\\nconst double PI2 = PI * 2;\\n\\n/* typedef */\\n\\ntemplate <typename T>\\nstruct Pt {\\n T x, y;\\n\\n Pt() {}\\n Pt(T _x, T _y) : x(_x), y(_y) {}\\n Pt(const Pt& pt) : x(pt.x), y(pt.y) {}\\n\\n bool operator==(const Pt pt) const { return x == pt.x && y == pt.y; }\\n Pt<T> operator+(const Pt pt) const { return Pt<T>(x + pt.x, y + pt.y); }\\n Pt<T> operator-() const { return Pt<T>(-x, -y); }\\n Pt<T> operator-(const Pt pt) const { return Pt<T>(x - pt.x, y - pt.y); }\\n Pt<T> operator*(T t) const { return Pt<T>(x * t, y * t); }\\n Pt<T> operator/(T t) const { return Pt<T>(x / t, y / t); }\\n T dot(Pt v) const { return x * v.x + y * v.y; }\\n T cross(Pt v) const { return x * v.y - y * v.x; }\\n Pt<T> mid(const Pt pt) { return Pt<T>((x + pt.x) / 2, (y + pt.y) / 2); }\\n T d2() { return x * x + y * y; }\\n double d() { return sqrt(d2()); }\\n\\n Pt<T> rot(double th) {\\n double c = cos(th), s = sin(th);\\n return Pt<T>(c * x - s * y, s * x + c * y);\\n }\\n\\n bool operator<(const Pt& pt) const {\\n return x < pt.x || (x == pt.x && y < pt.y);\\n }\\n\\n void print(string format) {\\n printf((\\\"(\\\" + format + \\\", \\\" + format + \\\")\\\\n\\\").c_str(), x, y);\\n }\\n void print() { print(\\\"%.6lf\\\"); }\\n};\\n\\ntypedef Pt<double> pt;\\n\\n/* global variables */\\n\\nint n;\\npt pts[2][MAX_N], rpts[MAX_N];\\n\\n/* subroutines */\\n\\nbool pt_comp(const pt& pt0, const pt& pt1) {\\n double dx = pt0.x - pt1.x, dy = pt0.y - pt1.y;\\n return (dx <= -DELTA) || (dx < DELTA && dy <= -DELTA);\\n}\\n\\n/* main */\\n\\nint main() {\\n for (;;) {\\n cin >> n;\\n if (n == 0) break;\\n\\n for (int j = 0; j < 2; j++) {\\n pt ctr(0.0, 0.0);\\n for (int i = 0; i < n; i++) {\\n\\tcin >> pts[j][i].x >> pts[j][i].y;\\n\\tctr = ctr + pts[j][i];\\n }\\n ctr = ctr / n;\\n //ctr.print();\\n\\n for (int i = 0; i < n; i++)\\n\\tpts[j][i] = pts[j][i] - ctr;\\n }\\n\\n pt *pts0 = pts[0], *pts1 = pts[1];\\n double min_th = 10;\\n\\n pt& pto = pts0[0];\\n double tho = atan2(pto.y, pto.x);\\n double d2o = pto.d2();\\n\\n for (int i = 0; i < n; i++) {\\n pt& pti = pts1[i];\\n double d2i = pti.d2();\\n if (abs(d2i - d2o) < DELTA2) {\\n\\tdouble thi = atan2(pti.y, pti.x);\\n\\tdouble dth = thi - tho;\\n\\tif (dth > PI) dth -= PI2;\\n\\telse if (dth < -PI) dth += PI2;\\n\\n\\tdouble adth = abs(dth);\\n\\tif (min_th <= adth) continue;\\n\\t//cout << dth << endl;\\n\\n\\tdouble cdth = cos(dth), sdth = sin(dth);\\n\\tfor (int j = 0; j < n; j++) {\\n\\t rpts[j].x = cdth * pts0[j].x - sdth * pts0[j].y;\\n\\t rpts[j].y = sdth * pts0[j].x + cdth * pts0[j].y;\\n\\t}\\n\\tsort(rpts, rpts + n, pt_comp);\\n\\n\\tbool found = true;\\n\\tfor (int j = 0; j < n; j++)\\n\\t if (! binary_search(rpts, rpts + n, pts1[j], pt_comp)) {\\n\\t found = false;\\n\\t break;\\n\\t }\\n\\n\\tif (found) min_th = adth;\\n }\\n }\\n\\n printf(\\\"%.10lf\\\\n\\\", min_th);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1372,\n \"score_of_the_acc\": -0.0509,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2051_1155675\",\n \"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#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))\\ntypedef double number;\\ntypedef complex<double> Point;\\nconst double EPS = 1e-5;\\ntypedef Point P;\\ntypedef vector<Point> Polygon;\\ndouble dot(P a, P b){return real(conj(a) * b);}\\ndouble cross(P a, P b){return imag(conj(a) * b);}\\ndouble angle(P a, P b){return arg(conj(a) * b);}\\nP rotate(P a, double b, P c = P()){return (a - c) * polar(1.0, b) + c;}\\nint ccw(P a, P b, P c) {\\n b -= a; c -= a;\\n if (cross(b, c) > +EPS) return +1; // 反時計回り\\n if (cross(b, c) < -EPS) return -1; // 時計回り\\n if (dot(b, c) < 0) return +2; // c--a--b の順番で一直線上\\n if (norm(b) < norm(c)) return -2; // a--b--c の順番で一直線上\\n return 0; // 点が線分ab上にある\\n}\\nint sign(double x) {\\n return (x > EPS) - (x < -EPS);\\n}\\nint comp(double x, double y) {\\n return sign(x - y);\\n}\\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 return comp(a.real(), b.real()) ? comp(a.real(), b.real()) < 0 : comp(a.imag(), b.imag()) < 0;\\n }\\n};\\nbool near(Point a, Point b) {\\n return comp(a.real(), b.real()) == 0 && comp(a.imag(), b.imag()) == 0;\\n}\\nbool equal(Polygon p, Polygon q) {\\n sort(p.begin(), p.end());\\n sort(q.begin(), q.end());\\n REP(i, p.size()) {\\n if(!near(p[i], q[i])) return false;\\n }\\n return true;\\n}\\nPolygon convex_hull(vector<P> ps, vector<int>& res) {\\n int n = ps.size(), k = 0;\\n sort(ps.begin(), ps.end(),[](const P&a, const P&b){\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n });\\n\\n vector<P> ch(2*n);\\n res.resize(2*n);\\n for (int i = 0; i < n;\\n res[k] = i, ch[k++] = ps[i++]){ // lower-hull\\n while (k >= 2 && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;\\n }\\n for (int i = n-2, t = k+1; i >= 0;\\n res[k] = i, ch[k++] = ps[i--]){ // upper-hull\\n while (k >= t && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;\\n }\\n ch.resize(k-1);\\n res.resize(k-1);\\n return ch;\\n}\\npair<int, int> convex_diameter(const Polygon &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 number 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 make_pair(maxi, maxj); /* farthest pair is (maxi, maxj). */\\n}\\n\\nint main(){\\n int n;\\n while(cin >> n && n > 0) {\\n Polygon p(n), q(n);\\n REP(i, n) {\\n double x, y;\\n cin >> x >> y;\\n p[i] = {x, y};\\n }\\n REP(i, n) {\\n double x, y;\\n cin >> x >> y;\\n q[i] = {x, y};\\n }\\n if(n == 1) {\\n printf(\\\"%.10f\\\\n\\\", 0.0);\\n continue;\\n }\\n vector<int> idx;\\n auto pc = convex_hull(p, idx);\\n auto max_p = convex_diameter(pc);\\n int max_i = idx[max_p.first];\\n int max_j = idx[max_p.second];\\n double max_len = abs(p[max_i] - p[max_j]);\\n double ans = 1e64;\\n REP(i, n) REP(j, n) if(i != j) {\\n double len = abs(q[i] - q[j]);\\n if(comp(len, max_len) != 0) continue;\\n auto qt = q;\\n P dif = p[max_i] - qt[i];\\n REP(k, qt.size()) {\\n qt[k] += dif;\\n }\\n assert(near(p[max_i], qt[i]));\\n // double th = angle(p[max_j] - p[max_i], qt[j] - qt[i]);\\n // REP(k, qt.size()) {\\n // qt[k] = rotate(qt[k], -th, qt[i]);\\n // }\\n double th = angle(qt[j] - qt[i], p[max_j] - p[max_i]);\\n REP(k, qt.size()) {\\n qt[k] = rotate(qt[k], th, qt[i]);\\n }\\n assert(near(p[max_i], qt[i]));\\n assert(near(p[max_j], qt[j]));\\n if(!equal(p, qt)) continue;\\n th = abs(th);\\n ans = min(ans, th);\\n }\\n printf(\\\"%.10f\\\\n\\\", ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 1460,\n \"score_of_the_acc\": -0.2525,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2051_1039771\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n \\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-8)\\n#define equals(a,b) (fabs((a)-(b))<EPS)\\n \\nusing namespace std;\\n \\nclass Point{\\npublic:\\n double x,y;\\n \\n Point(double x = 0,double y = 0): x(x),y(y){}\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n \\n};\\n \\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n \\nconst double DINF = 1e20;\\nint n;\\nPoint ps[2][1010],tmp[1010];\\n \\ninline double getDist(Point p){ return sqrt(p.x*p.x+p.y*p.y); }\\ninline bool comp_arg(const double &a,const double &b) { return !equals(a,b) && a < b; }\\n \\nvoid compute(){\\n Point grv[2] = {Point(),Point()};\\n rep(i,2) rep(j,n) grv[i] = grv[i] + ps[i][j];\\n rep(i,2) grv[i] = grv[i] / (double)n;\\n rep(i,2) rep(j,n) ps[i][j] = ps[i][j] - grv[i];\\n sort(ps[0],ps[0]+n);\\n \\n vector<double> arg_buf;\\n rep(i,n) {\\n double dist[2] = { getDist(ps[0][0]), getDist(ps[1][i]) };\\n if( !equals(dist[0],dist[1]) ) continue;\\n double arg = atan2(ps[0][0].y,ps[0][0].x) - atan2(ps[1][i].y,ps[1][i].x);\\n while( arg < 0 ) arg += 2*M_PI;\\n arg_buf.push_back(arg);\\n }\\n sort(arg_buf.begin(),arg_buf.end(),comp_arg);\\n arg_buf.erase(unique(arg_buf.begin(),arg_buf.end()),arg_buf.end());\\n\\n double mini = DINF; \\n rep(i,(int)arg_buf.size()){\\n double arg = arg_buf[i];\\n rep(j,n) tmp[j] = rotate(ps[1][j],arg);\\n sort(tmp,tmp+n);\\n bool failed = false;\\n rep(j,n) if( !( tmp[j] == ps[0][j] ) ) { failed = true; break; }\\n if( !failed ) mini = min(mini,min(arg,2*M_PI-arg));\\n }\\n printf(\\\"%.11lf\\\\n\\\",mini);\\n}\\n \\nint main(){\\n while( cin >> n, n ){\\n rep(i,2) rep(j,n) cin >> ps[i][j].x >> ps[i][j].y;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1408,\n \"score_of_the_acc\": -0.1069,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2051_1039768\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n \\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-8)\\n#define equals(a,b) (fabs((a)-(b))<EPS)\\n \\nusing namespace std;\\n \\nclass Point{\\npublic:\\n double x,y;\\n \\n Point(double x = 0,double y = 0): x(x),y(y){}\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n \\n};\\n \\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n \\nconst double DINF = 1e20;\\nint n;\\nPoint ps[2][1010],tmp[1010];\\n \\ninline double getDist(Point p){ return sqrt(p.x*p.x+p.y*p.y); }\\n \\nbool comp_arg(const double &a,const double &b) { return !equals(fabs(a),fabs(b)) && fabs(a) < fabs(b); }\\n \\nvoid compute(){\\n Point grv[2] = {Point(),Point()};\\n rep(i,2) rep(j,n) grv[i] = grv[i] + ps[i][j];\\n rep(i,2) grv[i] = grv[i] / (double)n;\\n rep(i,2) rep(j,n) ps[i][j] = ps[i][j] - grv[i];\\n sort(ps[0],ps[0]+n);\\n sort(ps[1],ps[1]+n);\\n \\n vector<double> arg_buf;\\n rep(i,min(10,n)) rep(j,n) {\\n double dist[2] = { getDist(ps[0][i]), getDist(ps[1][j]) };\\n if( !equals(dist[0],dist[1]) ) continue;\\n arg_buf.push_back( atan2(ps[0][i].y,ps[0][i].x) - atan2(ps[1][j].y,ps[1][j].x) );\\n }\\n \\n sort(arg_buf.begin(),arg_buf.end(),comp_arg);\\n arg_buf.erase(unique(arg_buf.begin(),arg_buf.end()),arg_buf.end());\\n \\n rep(i,(int)arg_buf.size()){\\n double arg = arg_buf[i];\\n rep(j,n) tmp[j] = rotate(ps[1][j],arg);\\n sort(tmp,tmp+n);\\n bool failed = false;\\n rep(j,n) if( !( tmp[j] == ps[0][j] ) ) { failed = true; break; }\\n if( !failed ) { printf(\\\"%.10lf\\\\n\\\",fabs(arg)); break; }\\n }\\n \\n}\\n \\nint main(){\\n while( cin >> n, n ){\\n rep(i,2) rep(j,n) cin >> ps[i][j].x >> ps[i][j].y;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1512,\n \"score_of_the_acc\": -0.1064,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2051_1039744\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n \\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-8)\\n#define equals(a,b) (fabs((a)-(b))<EPS)\\n \\nusing namespace std;\\n \\nclass Point{\\npublic:\\n double x,y;\\n \\n Point(double x = 0,double y = 0): x(x),y(y){}\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n \\n};\\n \\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n \\nconst double DINF = 1e20;\\nint n;\\nPoint ps[2][1010],tmp[1010];\\n \\ninline double getDist(Point p){ return sqrt(p.x*p.x+p.y*p.y); }\\n \\nbool comp_arg(const double &a,const double &b) { return !equals(fabs(a),fabs(b)) && fabs(a) < fabs(b); }\\n \\nvoid compute(){\\n Point grv[2] = {Point(),Point()};\\n rep(i,2) rep(j,n) grv[i] = grv[i] + ps[i][j];\\n rep(i,2) grv[i] = grv[i] / (double)n;\\n rep(i,2) rep(j,n) ps[i][j] = ps[i][j] - grv[i];\\n sort(ps[0],ps[0]+n);\\n \\n vector<double> arg_buf;\\n rep(i,min(10,n)) rep(j,n) {\\n double dist[2] = { getDist(ps[0][i]), getDist(ps[1][j]) };\\n if( !equals(dist[0],dist[1]) ) continue;\\n arg_buf.push_back( atan2(ps[0][i].y,ps[0][i].x) - atan2(ps[1][j].y,ps[1][j].x) );\\n }\\n \\n sort(arg_buf.begin(),arg_buf.end(),comp_arg);\\n arg_buf.erase(unique(arg_buf.begin(),arg_buf.end()),arg_buf.end());\\n \\n rep(i,(int)arg_buf.size()){\\n double arg = arg_buf[i];\\n rep(j,n) tmp[j] = rotate(ps[1][j],arg);\\n sort(tmp,tmp+n);\\n bool failed = false;\\n rep(j,n) if( !( tmp[j] == ps[0][j] ) ) { failed = true; break; }\\n if( !failed ) { printf(\\\"%.10lf\\\\n\\\",fabs(arg)); break; }\\n }\\n \\n}\\n \\nint main(){\\n while( cin >> n, n ){\\n rep(i,2) rep(j,n) cin >> ps[i][j].x >> ps[i][j].y;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1512,\n \"score_of_the_acc\": -0.1064,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2051_1039740\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n \\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-8)\\n#define equals(a,b) (fabs((a)-(b))<EPS)\\n \\nusing namespace std;\\n \\nclass Point{\\npublic:\\n double x,y;\\n \\n Point(double x = 0,double y = 0): x(x),y(y){}\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n \\n};\\n \\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n \\nconst double DINF = 1e20;\\nint n;\\nPoint ps[2][1010],tmp[1010];\\n \\ninline double getDist(Point p){ return sqrt(p.x*p.x+p.y*p.y); }\\n \\nbool comp_arg(const double &a,const double &b) { return !equals(fabs(a),fabs(b)) && fabs(a) < fabs(b); }\\n \\nvoid compute(){\\n Point grv[2] = {Point(),Point()};\\n rep(i,2) rep(j,n) grv[i] = grv[i] + ps[i][j];\\n rep(i,2) grv[i] = grv[i] / (double)n;\\n rep(i,2) rep(j,n) ps[i][j] = ps[i][j] - grv[i];\\n sort(ps[0],ps[0]+n);\\n sort(ps[1],ps[1]+n);\\n \\n vector<double> arg_buf;\\n rep(i,min(7,n)) rep(j,n) {\\n double dist[2] = { getDist(ps[0][i]), getDist(ps[1][j]) };\\n if( !equals(dist[0],dist[1]) ) continue;\\n arg_buf.push_back( atan2(ps[0][i].y,ps[0][i].x) - atan2(ps[1][j].y,ps[1][j].x) );\\n }\\n \\n sort(arg_buf.begin(),arg_buf.end(),comp_arg);\\n arg_buf.erase(unique(arg_buf.begin(),arg_buf.end()),arg_buf.end());\\n \\n rep(i,(int)arg_buf.size()){\\n double arg = arg_buf[i];\\n rep(j,n) tmp[j] = rotate(ps[1][j],arg);\\n sort(tmp,tmp+n);\\n bool failed = false;\\n rep(j,n) if( !( tmp[j] == ps[0][j] ) ) { failed = true; break; }\\n if( !failed ) { printf(\\\"%.10lf\\\\n\\\",fabs(arg)); break; }\\n }\\n \\n}\\n \\nint main(){\\n while( cin >> n, n ){\\n rep(i,2) rep(j,n) cin >> ps[i][j].x >> ps[i][j].y;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1468,\n \"score_of_the_acc\": -0.089,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2051_1039737\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n \\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-8)\\n#define equals(a,b) (fabs((a)-(b))<EPS)\\n \\nusing namespace std;\\n \\nclass Point{\\npublic:\\n double x,y;\\n \\n Point(double x = 0,double y = 0): x(x),y(y){}\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n \\n};\\n \\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n \\nconst double DINF = 1e20;\\nint n;\\nPoint ps[2][1010],tmp[1010];\\n \\ninline double getDist(Point p){ return sqrt(p.x*p.x+p.y*p.y); }\\n \\nbool comp_arg(const double &a,const double &b) { return !equals(fabs(a),fabs(b)) && fabs(a) < fabs(b); }\\n \\nvoid compute(){\\n Point grv[2] = {Point(),Point()};\\n rep(i,2) rep(j,n) grv[i] = grv[i] + ps[i][j];\\n rep(i,2) grv[i] = grv[i] / (double)n;\\n rep(i,2) rep(j,n) ps[i][j] = ps[i][j] - grv[i];\\n sort(ps[0],ps[0]+n);\\n sort(ps[1],ps[1]+n);\\n \\n vector<double> arg_buf;\\n rep(i,min(10,n)) rep(j,n) {\\n double dist[2] = { getDist(ps[0][i]), getDist(ps[1][j]) };\\n if( !equals(dist[0],dist[1]) ) continue;\\n arg_buf.push_back( atan2(ps[0][i].y,ps[0][i].x) - atan2(ps[1][j].y,ps[1][j].x) );\\n }\\n \\n sort(arg_buf.begin(),arg_buf.end(),comp_arg);\\n arg_buf.erase(unique(arg_buf.begin(),arg_buf.end()),arg_buf.end());\\n \\n rep(i,(int)arg_buf.size()){\\n double arg = arg_buf[i];\\n rep(j,n) tmp[j] = rotate(ps[1][j],arg);\\n sort(tmp,tmp+n);\\n bool failed = false;\\n rep(j,n) if( !( tmp[j] == ps[0][j] ) ) { failed = true; break; }\\n if( !failed ) { printf(\\\"%.10lf\\\\n\\\",fabs(arg)); break; }\\n }\\n \\n}\\n \\nint main(){\\n while( cin >> n, n ){\\n rep(i,2) rep(j,n) cin >> ps[i][j].x >> ps[i][j].y;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1512,\n \"score_of_the_acc\": -0.0856,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2051_1039697\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-8)\\n#define equals(a,b) (fabs((a)-(b))<EPS)\\n\\nusing namespace std;\\n\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = 0,double y = 0): x(x),y(y){}\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n\\n};\\n\\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n\\nconst double DINF = 1e20;\\nint n;\\nPoint ps[2][1010],tmp[1010];\\n\\ninline double getDist(Point p){ return sqrt(p.x*p.x+p.y*p.y); }\\n\\nbool comp_arg(const double &a,const double &b) { return !equals(fabs(a),fabs(b)) && fabs(a) < fabs(b); }\\n\\nvoid compute(){\\n Point grv[2] = {Point(),Point()};\\n rep(i,2) rep(j,n) grv[i] = grv[i] + ps[i][j];\\n rep(i,2) grv[i] = grv[i] / (double)n;\\n rep(i,2) rep(j,n) ps[i][j] = ps[i][j] - grv[i];\\n sort(ps[0],ps[0]+n);\\n sort(ps[1],ps[1]+n);\\n\\n vector<double> arg_buf;\\n rep(i,n) rep(j,n) {\\n double dist[2] = { getDist(ps[0][i]), getDist(ps[1][j]) };\\n if( !equals(dist[0],dist[1]) ) continue;\\n double arg = atan2(ps[0][i].y,ps[0][i].x) - atan2(ps[1][j].y,ps[1][j].x);\\n arg_buf.push_back(arg);\\n }\\n\\n sort(arg_buf.begin(),arg_buf.end(),comp_arg);\\n arg_buf.erase(unique(arg_buf.begin(),arg_buf.end()),arg_buf.end());\\n\\n rep(i,(int)arg_buf.size()){\\n double arg = arg_buf[i];\\n rep(j,n) tmp[j] = rotate(ps[1][j],arg);\\n sort(tmp,tmp+n);\\n bool failed = false;\\n rep(j,n) if( !( tmp[j] == ps[0][j] ) ) { failed = true; break; }\\n if( !failed ) { printf(\\\"%.11lf\\\\n\\\",fabs(arg)); break; }\\n }\\n\\n}\\n\\nint main(){\\n while( cin >> n, n ){\\n rep(i,2) rep(j,n) cin >> ps[i][j].x >> ps[i][j].y;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3356,\n \"score_of_the_acc\": -0.9412,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2051_1039680\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-8)\\n#define equals(a,b) (fabs((a)-(b))<EPS)\\n\\nusing namespace std;\\n\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = 0,double y = 0): x(x),y(y){}\\n\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n\\n};\\n\\n//rad は角度をラジアンで持たせること\\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n\\nconst double DINF = 1e20;\\nint n;\\nPoint ps[2][1010],tmp[1010];\\n\\ninline double getDist(Point p){ return sqrt(p.x*p.x+p.y*p.y); }\\n\\nbool comp_arg(const double &a,const double &b) { return !equals(fabs(a),fabs(b)) && fabs(a) < fabs(b); }\\n\\nvoid compute(){\\n Point grv[2] = {Point(),Point()};\\n rep(i,2) rep(j,n) grv[i] = grv[i] + ps[i][j];\\n rep(i,2) grv[i] = grv[i] / (double)n;\\n rep(i,2) rep(j,n) ps[i][j] = ps[i][j] - grv[i];\\n sort(ps[0],ps[0]+n);\\n sort(ps[1],ps[1]+n);\\n\\n vector<double> arg_buf;\\n rep(i,n) rep(j,n) {\\n double dist[2] = { getDist(ps[0][i]), getDist(ps[1][j]) };\\n if( !equals(dist[0],dist[1]) ) continue;\\n double arg = atan2(ps[0][i].y,ps[0][i].x) - atan2(ps[1][j].y,ps[1][j].x);\\n arg_buf.push_back(arg);\\n }\\n\\n sort(arg_buf.begin(),arg_buf.end(),comp_arg);\\n arg_buf.erase(unique(arg_buf.begin(),arg_buf.end()),arg_buf.end());\\n\\n rep(i,(int)arg_buf.size()){\\n double arg = arg_buf[i];\\n rep(j,n) tmp[j] = rotate(ps[1][j],arg);\\n sort(tmp,tmp+n);\\n bool failed = false;\\n rep(j,n) if( !( tmp[j] == ps[0][j] ) ) { failed = true; break; }\\n if( !failed ) { printf(\\\"%.11lf\\\\n\\\",fabs(arg)); break; }\\n }\\n\\n}\\n\\nint main(){\\n while( cin >> n, n ){\\n rep(i,2) rep(j,n) cin >> ps[i][j].x >> ps[i][j].y;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3360,\n \"score_of_the_acc\": -0.9427,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2051_772883\",\n \"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 repi(i,a,b) for(int i = (a); i < (b); i++)\\n#define rep(i,a) repi(i,0,a)\\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\\n#define pb push_back\\n#define mp make_pair\\n#define INF 1e9\\n#define EPS 1e-6\\n#define PI acos(-1.0)\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef complex<double> P;\\ntypedef vector<P> G;\\nint n;\\n\\nnamespace std{\\n bool operator<(const P &a, const P &b) {\\n\\treturn abs(real(a)-real(b)) > EPS ? real(a) < real(b): imag(a) < imag(b);\\n }\\n}\\n\\nstruct cmp\\n{\\n bool operator ()(const double &a, const double &b) {\\n\\treturn a + EPS < b;\\n }\\n};\\n\\nP rotate(const P &a, double th) { return a*polar(1.0, th); }\\ndouble angle(const P &a, const P &b) { return arg(conj(a)*b); }\\n\\nP centerG(const G &g) {\\n P p = P(0, 0);\\n rep(i, n) p += g[i];\\n p /= n;\\n return p;\\n}\\n\\nint main(){\\n while(cin >> n, n) {\\n\\tG g1(n), g2(n);\\n\\trep(i, n) cin >> g1[i].real() >> g1[i].imag();\\n\\trep(i, n) cin >> g2[i].real() >> g2[i].imag();\\n\\tP c1 = centerG(g1), c2 = centerG(g2);\\n\\trep(i, n) {\\n\\t g1[i] -= c1;\\n\\t g2[i] -= c2;\\n\\t}\\n\\t//cout <<\\\"c \\\" << c1 << \\\" \\\" << c2 << endl;\\n\\tG tg = g2;\\n\\tdouble ans = INF;\\n\\tsort(all(g1));\\n\\trep(i, n) {\\n\\t g2 = tg;\\n\\t double th = angle(g2[i], g1[0]); \\n\\t rep(j, n) g2[j] = rotate(g2[j], th);\\n\\t bool flag = true;\\n\\t \\n\\t sort(all(g2));\\n\\t rep(j, n) if(abs(g1[j] - g2[j]) > EPS) flag = false;\\n\\t \\n\\t //cout << \\\"a \\\"<< i << endl;\\n\\t //rep(j, n) cout << g1[j] << g2[j] << endl;\\n\\t \\n\\t if(flag) {\\n\\t\\tif(th < 0) th = -th;\\n\\t\\tif(th > PI) th = 2*PI - th;\\n\\t\\tans = min(ans, th);\\n\\t }\\n\\t}\\n\\tprintf(\\\"%.11f\\\\n\\\", ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 1396,\n \"score_of_the_acc\": -0.4146,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2051_572988\",\n \"code_snippet\": \"#include<set>\\n#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\\nconst double EPS=1e-7; // EPS=1e-8 だと誤差で間違う\\nconst double INF=1e77;\\nconst double PI=acos(-1);\\n\\nstruct point{\\n\\tdouble x,y;\\n\\tpoint():x(0),y(0){}\\n\\tpoint(double x,double y):x(x),y(y){}\\n\\tpoint &operator+=(const point &a){ x+=a.x; y+=a.y; return *this; }\\n\\tpoint &operator-=(const point &a){ x-=a.x; y-=a.y; return *this; }\\n\\tpoint &operator/=(double c){ x/=c; y/=c; return *this; }\\n\\tpoint operator+(const point &a)const{ return point(x+a.x,y+a.y); }\\n\\tpoint operator-(const point &a)const{ return point(x-a.x,y-a.y); }\\n\\tbool operator< (const point &a)const{ return x+EPS<a.x || abs(x-a.x)<EPS && y+EPS<a.y; }\\n};\\n\\ndouble cross(const point &a,const point &b){ return a.x*b.y-a.y*b.x; }\\n\\ndouble abs(const point &a){ return sqrt(a.x*a.x+a.y*a.y); }\\n\\ndouble arg(const point &a){ double t=atan2(a.y,a.x); return t<0?t+2*PI:t; }\\n\\npoint rot(const point &a,double theta){ return point(a.x*cos(theta)-a.y*sin(theta),a.x*sin(theta)+a.y*cos(theta)); }\\n\\ntypedef vector<point> polygon;\\n\\nenum{CCW=1,CW=-1,ON=0};\\nint ccw(const point &a,const point &b,const point &c){\\n\\tdouble rdir=cross(b-a,c-a);\\n\\tif(rdir> EPS) return CCW;\\n\\tif(rdir<-EPS) return CW;\\n\\treturn ON;\\n}\\n\\npolygon convex_hull(vector<point> &P){\\n\\tint n=P.size();\\n\\tpolygon CH;\\n\\tif(n<=1){\\n\\t\\tCH.insert(CH.end(),P.begin(),P.end());\\n\\t\\treturn CH;\\n\\t}\\n\\tsort(P.begin(),P.end());\\n\\n\\trep(_,2){\\n\\t\\tint m=0;\\n\\t\\tvector<point> half(n);\\n\\t\\trep(i,n){\\n\\t\\t\\thalf[m++]=P[i];\\n\\t\\t\\twhile(m>=3 && ccw(half[m-3],half[m-2],half[m-1])==CW){\\n\\t\\t\\t\\thalf[m-2]=half[m-1];\\n\\t\\t\\t\\tm--;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tCH.insert(CH.end(),half.begin(),half.begin()+m-1);\\n\\t\\treverse(P.begin(),P.end());\\n\\t}\\n\\n\\treturn CH;\\n}\\n\\nint main(){\\n\\tfor(int n;scanf(\\\"%d\\\",&n),n;){\\n\\t\\tvector<point> P(n),Q(n);\\n\\t\\trep(i,n) scanf(\\\"%lf%lf\\\",&P[i].x,&P[i].y);\\n\\t\\trep(i,n) scanf(\\\"%lf%lf\\\",&Q[i].x,&Q[i].y);\\n\\n\\t\\tif(n==1){\\n\\t\\t\\tputs(\\\"0\\\");\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tpolygon F=convex_hull(P);\\n\\t\\tpolygon G=convex_hull(Q);\\n\\n\\t\\tset<point> S(Q.begin(),Q.end());\\n\\n\\t\\tdouble ans=INF;\\n\\t\\trep(i,G.size()){\\n\\t\\t\\tpoint v=G[i]-F[0];\\n\\t\\t\\tdouble theta=arg(G[(i+1)%G.size()]-G[i])-arg(F[1]-F[0]);\\n\\n\\t\\t\\tbool ok=true;\\n\\t\\t\\trep(j,n){\\n\\t\\t\\t\\tif(S.count(rot(P[j]-F[0],theta)+F[0]+v)==0){\\n\\t\\t\\t\\t\\tok=false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(ok){\\n\\t\\t\\t\\ttheta=abs(theta);\\n\\t\\t\\t\\twhile(theta>2*PI) theta-=2*PI;\\n\\t\\t\\t\\tans=min(ans,theta);\\n\\t\\t\\t\\tans=min(ans,2*PI-theta);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%.9f\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1296,\n \"score_of_the_acc\": -0.0417,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2051_572987\",\n \"code_snippet\": \"#include<set>\\n#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\\nconst double EPS=1e-7; // EPS=1e-8 だと誤差で間違う\\nconst double INF=1e77;\\nconst double PI=acos(-1);\\n\\nstruct point{\\n\\tdouble x,y;\\n\\tpoint():x(0),y(0){}\\n\\tpoint(double x,double y):x(x),y(y){}\\n\\tpoint &operator+=(const point &a){ x+=a.x; y+=a.y; return *this; }\\n\\tpoint &operator-=(const point &a){ x-=a.x; y-=a.y; return *this; }\\n\\tpoint &operator/=(double c){ x/=c; y/=c; return *this; }\\n\\tpoint operator+(const point &a)const{ return point(x+a.x,y+a.y); }\\n\\tpoint operator-(const point &a)const{ return point(x-a.x,y-a.y); }\\n\\tbool operator< (const point &a)const{ return x+EPS<a.x || abs(x-a.x)<EPS && y+EPS<a.y; }\\n};\\n\\ndouble cross(const point &a,const point &b){ return a.x*b.y-a.y*b.x; }\\n\\ndouble abs(const point &a){ return sqrt(a.x*a.x+a.y*a.y); }\\n\\ndouble arg(const point &a){ double t=atan2(a.y,a.x); return t<0?t+2*PI:t; }\\n\\npoint rot(const point &a,double theta){ return point(a.x*cos(theta)-a.y*sin(theta),a.x*sin(theta)+a.y*cos(theta)); }\\n\\ntypedef vector<point> polygon;\\n\\nenum{CCW=1,CW=-1,ON=0};\\nint ccw(const point &a,const point &b,const point &c){\\n\\tdouble rdir=cross(b-a,c-a);\\n\\tif(rdir> EPS) return CCW;\\n\\tif(rdir<-EPS) return CW;\\n\\treturn ON;\\n}\\n\\npolygon convex_hull(vector<point> &P){\\n\\tint n=P.size();\\n\\tpolygon CH;\\n\\tif(n<=1){\\n\\t\\tCH.insert(CH.end(),P.begin(),P.end());\\n\\t\\treturn CH;\\n\\t}\\n\\tsort(P.begin(),P.end());\\n\\n\\trep(_,2){\\n\\t\\tint m=0;\\n\\t\\tvector<point> half(n);\\n\\t\\trep(i,n){\\n\\t\\t\\thalf[m++]=P[i];\\n\\t\\t\\twhile(m>=3 && ccw(half[m-3],half[m-2],half[m-1])==CW){\\n\\t\\t\\t\\thalf[m-2]=half[m-1];\\n\\t\\t\\t\\tm--;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tCH.insert(CH.end(),half.begin(),half.begin()+m-1);\\n\\t\\treverse(P.begin(),P.end());\\n\\t}\\n\\n\\treturn CH;\\n}\\n\\nint main(){\\n\\tfor(int n;scanf(\\\"%d\\\",&n),n;){\\n\\t\\tvector<point> P(n),Q(n);\\n\\t\\trep(i,n) scanf(\\\"%lf%lf\\\",&P[i].x,&P[i].y);\\n\\t\\trep(i,n) scanf(\\\"%lf%lf\\\",&Q[i].x,&Q[i].y);\\n\\n\\t\\tif(n==1){\\n\\t\\t\\tputs(\\\"0\\\");\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tpolygon F=convex_hull(P);\\n\\t\\tpolygon G=convex_hull(Q);\\n\\n\\t\\tset<point> S(Q.begin(),Q.end());\\n\\n\\t\\tdouble ans=INF;\\n\\t\\trep(_,2){\\n\\t\\t\\trep(i,G.size()){\\n\\t\\t\\t\\tpoint v=G[i]-F[0];\\n\\t\\t\\t\\tdouble theta=arg(G[(i+1)%G.size()]-G[i])-arg(F[1]-F[0]);\\n\\n\\t\\t\\t\\tbool ok=true;\\n\\t\\t\\t\\trep(j,n){\\n\\t\\t\\t\\t\\tif(S.count(rot(P[j]-F[0],theta)+F[0]+v)==0){\\n\\t\\t\\t\\t\\t\\tok=false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(ok){\\n\\t\\t\\t\\t\\ttheta=abs(theta);\\n\\t\\t\\t\\t\\twhile(theta>2*PI) theta-=2*PI;\\n\\t\\t\\t\\t\\tans=min(ans,theta);\\n\\t\\t\\t\\t\\tans=min(ans,2*PI-theta);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treverse(G.begin(),G.end());\\n\\t\\t}\\n\\t\\tprintf(\\\"%.9f\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1296,\n \"score_of_the_acc\": -0.0417,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1084,"cells":{"group_id":{"kind":"string","value":"aoj_2053_cpp"},"problem_description":{"kind":"string","value":"Problem F:\nControlled Tournament\nNational Association of Tennis is planning to hold a tennis competition among professional\nplayers. The competition is going to be a knockout tournament, and you are assigned the task\nto make the arrangement of players in the tournament.\nYou are given the detailed report about all participants of the competition. The report contains\nthe results of recent matches between all pairs of the participants. Examining the data, you’ve\nnoticed that it is only up to the opponent whether one player wins or not.\nSince one of your special friends are attending the competition, you want him to get the best\nprize. So you want to know the possibility where he wins the gold medal. However it is not so\neasy to figure out because there are many participants. You have decided to write a program\nwhich calculates the number of possible arrangements of tournament in which your friend wins\nthe gold medal.\nIn order to make your trick hidden from everyone, you need to avoid making a factitive tourna-\nment tree. So you have to minimize the height of your tournament tree.\nInput\nThe input consists of multiple datasets. Each dataset has the format as described below.\nN M\nR\n11\nR\n12\n. . .\nR\n1\nN\nR\n21\nR\n22\n. . .\nR\n2\nN\n...\nR\nN\n1\nR\nN\n2\n. . .\nR\nNN\nN\n(2 ≤\nN\n≤ 16) is the number of player, and\nM\n(1 ≤\nM\n≤\nN\n) is your friend’s ID (numbered\nfrom 1).\nR\nij\nis the result of a match between the\ni\n-th player and the\nj\n-th player. When\ni\n-th\nplayer always wins,\nR\nij\n= 1. Otherwise,\nR\nij\n= 0. It is guaranteed that the matrix is consistent:\nfor all\ni\n≠\nj\n,\nR\nij\n= 0 if and only if\nR\nji\n= 1. The diagonal elements\nR\nii\nare just given for\nconvenience and are always 0.\nThe end of input is indicated by a line containing two zeros. This line is not a part of any\ndatasets and should not be processed.\nOutput\nFor each dataset, your program should output in a line the number of possible tournaments in\nwhich your friend wins the first prize.\nSample Input\n2 1\n0 1\n0 0\n2 1\n0 0\n1 0\n3 3\n0 1 1\n0 0 1\n0 0 0\n3 3\n0 1 0\n0 0 0\n1 1 0\n3 1\n0 1 0\n0 0 0\n1 1 0\n3 3\n0 1 0\n0 0 1\n1 0 0\n6 4\n0 0 0 0 0 1\n1 0 1 0 1 0\n1 0 0 1 1 0\n1 1 0 0 1 0\n1 0 0 0 0 0\n0 1 1 1 1 0\n7 2\n0 1 0 0 0 1 0\n0 0 1 0 1 1 1\n1 0 0 1 1 0 0\n1 1 0 0 0 1 0\n1 0 0 1 0 0 1\n0 0 1 0 1 0 0\n1 0 1 1 0 1 0\n8 6\n0 0 0 0 1 0 0 0\n1 0 1 1 0 0 0 0\n1 0 0 0 1 0 0 0\n1 0 1 0 0 1 0 1\n0 1 0 1 0 0 1 0\n1 1 1 0 1 0 0 1\n1 1 1 1 0 1 0 0\n1 1 1 0 1 0 1 0\n0 0\nOutput for the Sample Input\n1\n0\n0\n3\n0\n1\n11\n139\n78"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2053_10848151","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nconst int MAXN = 1 << 16;\nint n, m;\nint bit1[MAXN]; // 二进制数中有多少个 1\nint dp[20][10][MAXN];\nvector<int> G[20];\nint dfs(int u, int h, int bits) {\n if(bit1[bits] == 1) return 1;\n if((1 << h) < bit1[bits]) return 0;\n if(dp[u][h][bits] != -1) return dp[u][h][bits];\n else dp[u][h][bits] = 0;\n int& res = dp[u][h][bits];\n for(int i = bits & (bits - 1); i; i = bits & (i - 1)) {\n if((i >> u) & 1) {\n int j = bits ^ i;\n for(int k = 0; k < G[u].size(); k++) {\n int v = G[u][k];\n if((j >> v) & 1) {\n res += dfs(u, h - 1, i) * dfs(v, h - 1, j);\n }\n }\n }\n }\n return res;\n}\nint main() {\n for(int i = 0; i < MAXN; i++) {\n bit1[i] = bit1[i >> 1] + (i & 1);\n }\n while(cin >> n >> m && (n + m)) {\n memset(dp, -1, sizeof dp);\n for(int i = 0; i < n; i++) G[i].clear();\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < n; j++) {\n int x;\n cin >> x;\n if(x) G[i].push_back(j);\n }\n }\n int h = ceil(log(n) / log(2));\n cout << dfs(m - 1, h, (1 << n) - 1) << endl;\n }\n return 0;\n\n}","accuracy":1,"time_ms":3660,"memory_kb":54992,"score_of_the_acc":-1.0057,"final_rank":6},{"submission_id":"aoj_2053_10826910","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nconst int MAXN = 1 << 16;\nint n, m;\nint bit1[MAXN]; // 二进制数中有多少个 1\nint dp[20][10][MAXN];\nvector<int> G[20];\nint dfs(int u, int h, int bits) {\n if(bit1[bits] == 1) return 1;\n if((1 << h) < bit1[bits]) return 0;\n if(dp[u][h][bits] != -1) return dp[u][h][bits];\n else dp[u][h][bits] = 0;\n int& res = dp[u][h][bits];\n for(int i = bits & (bits - 1); i; i = bits & (i - 1)) { // 枚举 bits 里的 1 选或不选的情况\n if((i >> u) & 1) {\n int j = bits ^ i;\n for(int k = 0; k < G[u].size(); k++) {\n int v = G[u][k];\n if((j >> v) & 1) {\n res += dfs(u, h - 1, i) * dfs(v, h - 1, j);\n }\n }\n }\n }\n return res;\n}\nint main() {\n for(int i = 0; i < MAXN; i++) {\n bit1[i] = bit1[i >> 1] + (i & 1);\n }\n while(cin >> n >> m && (n + m)) {\n memset(dp, -1, sizeof dp);\n for(int i = 0; i < n; i++) G[i].clear();\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < n; j++) {\n int x;\n cin >> x;\n if(x) G[i].push_back(j);\n }\n }\n int h = ceil(log(n) / log(2));\n cout << dfs(m - 1, h, (1 << n) - 1) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":3670,"memory_kb":54724,"score_of_the_acc":-1.0037,"final_rank":5},{"submission_id":"aoj_2053_2380459","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nconst int MAXN = 1 << 16;\nint n, m;\nint bit1[MAXN]; // 二?制数中有多少个 1\nint dp[20][10][MAXN];\nvector<int> G[20];\nint dfs(int u, int h, int bits) {\n if(bit1[bits] == 1) return 1;\n if((1 << h) < bit1[bits]) return 0;\n if(dp[u][h][bits] != -1) return dp[u][h][bits];\n else dp[u][h][bits] = 0;\n int& res = dp[u][h][bits];\n for(int i = bits & (bits - 1); i; i = bits & (i - 1)) {\n if((i >> u) & 1) {\n int j = bits ^ i;\n for(int k = 0; k < G[u].size(); k++) {\n int v = G[u][k];\n if((j >> v) & 1) {\n res += dfs(u, h - 1, i) * dfs(v, h - 1, j);\n }\n }\n }\n }\n return res;\n}\nint main() {\n for(int i = 0; i < MAXN; i++) {\n bit1[i] = bit1[i >> 1] + (i & 1);\n }\n while(cin >> n >> m && (n + m)) {\n memset(dp, -1, sizeof dp);\n for(int i = 0; i < n; i++) G[i].clear();\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < n; j++) {\n int x;\n cin >> x;\n if(x) G[i].push_back(j);\n }\n }\n int h = ceil(log(n) / log(2));\n cout << dfs(m - 1, h, (1 << n) - 1) << endl;\n }\n return 0;\n\n}","accuracy":1,"time_ms":4070,"memory_kb":54852,"score_of_the_acc":-1.2346,"final_rank":8},{"submission_id":"aoj_2053_1679677","code_snippet":"#include <algorithm>\n#include <cassert>\n#include <cstring>\n#include <iostream>\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 TRACE(x) cout << #x << \" = \" << x << endl\n#define _ << \" _ \" <<\n\ntypedef long long llint;\n\nconst int MAX = 16;\n\nint R[MAX][MAX];\nint f[5][MAX][1<<MAX];\nint bio[5][MAX][1<<MAX];\nint cookie, n;\n\nint solve(int h, int w, int s) {\n if (bio[h][w][s] == cookie) return f[h][w][s];\n bio[h][w][s] = cookie;\n\n int cnt = 0;\n REP(i, n) \n if (s&(1<<i)) cnt++;\n if (cnt == 1) return f[h][w][s] = (s>>w) & 1;\n\n int nh = 0;\n while (cnt > 1) nh++, cnt = (cnt + 1) / 2;\n if (nh > h) return f[h][w][s] = 0;\n\n f[h][w][s] = 0;\n for (int s1 = s; s1 > 0; s1 = s & (s1 - 1))\n if ((s1 & s) == s1) {\n if (!(s1 & (1<<w))) continue;\n if (s1 == s) continue;\n\n int s2 = s ^ s1;\n\n REP(i, n)\n if (s2 & (1<<i))\n if (R[w][i]) f[h][w][s] += solve(h-1, w, s1) * solve(h-1, i, s2);\n }\n return f[h][w][s];\n}\n\nint main(void) {\n int m;\n while (scanf(\"%d %d\", &n, &m) == 2) {\n if (n == 0 && m == 0) break;\n\n --m;\n REP(i, n) REP(j, n) scanf(\"%d\", &R[i][j]);\n\n cookie++;\n int h = 0, tmp = n;\n while (tmp > 1) tmp = (tmp + 1) / 2, h++;\n printf(\"%d\\n\", solve(h, m, (1<<n) - 1));\n }\n \n return 0;\n}","accuracy":1,"time_ms":4110,"memory_kb":20112,"score_of_the_acc":-0.2646,"final_rank":2},{"submission_id":"aoj_2053_772930","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 repi(i,a,b) for(int i = (a); i < (b); i++)\n#define rep(i,a) repi(i,0,a)\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\n#define pb push_back\n#define mp makek_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;\n\nint N, M, R[16][16], mem[1<<16][16][8];\n\nint f(int s, int i, int h)\n{\n if (mem[s][i][h] >= 0) return mem[s][i][h];\n if (!(s >> i & 1)) return 0;\n int sz = __builtin_popcount(s);\n if (sz == 1) return 1;\n\n int ret = 0;\n int M = 1 << h - 1;\n int m = sz - M;\n int tmp = s ^ 1 << i;\n for (int t = tmp; t; --t, t &= tmp) {\n\tint k = __builtin_popcount(t);\n\tif (m <= k && k <= M)\n\t for (int j = 0; j < N; ++j)\n\t\tif (R[i][j])\n\t\t ret += f(s ^ t, i, h - 1) * f(t, j, h - 1);\n }\n return mem[s][i][h] = ret;\n}\n\nvoid solve()\n{\n memset(mem, -1, sizeof(mem));\n\n --M;\n rep(i,N) rep(j,N) cin >> R[i][j];\n\n cout << f((1 << N) - 1, M, 32 - __builtin_clz(N - 1)) << endl;\n}\n\nint main()\n{\n while (cin >> N >> M && N)\n\tsolve();\n\n return 0;\n}","accuracy":1,"time_ms":3650,"memory_kb":33940,"score_of_the_acc":-0.3984,"final_rank":3},{"submission_id":"aoj_2053_470930","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\ntemplate <size_t T>\nbool prevSubset(bitset<T>& bs, const bitset<T>& mask)\n{\n bs = bs.to_ulong() - 1ull;\n bs &= mask;\n if(bs.none())\n return false;\n return true;\n}\n\nint n, m;\nvector<vector<int> > r;\n\nvector<vector<vector<int> > > memo;\n\nint solve(int d, int win, bitset<16> rest)\n{\n if(rest.count() == 1)\n return 1;\n if(d == -1)\n return 0;\n\n if(memo[d][win][rest.to_ulong()] != -1)\n return memo[d][win][rest.to_ulong()];\n\n int ret = 0;\n bitset<16> bs1 = rest;\n while(prevSubset(bs1, rest)){\n bitset<16> bs2 = rest ^ bs1;\n if(bs1.count() > (1<<d) || bs2.count() > (1<<d))\n continue;\n if(!bs1[win])\n continue;\n\n for(int i=0; i<n; ++i){\n if(bs2[i] && r[win][i] == 1)\n ret += solve(d-1, win, bs1) * solve(d-1, i, bs2);\n }\n }\n\n return memo[d][win][rest.to_ulong()] = ret;\n}\n\nint main()\n{\n for(;;){\n cin >> n >> m;\n if(n == 0)\n return 0;\n\n r.assign(n, vector<int>(n));\n for(int i=0; i<n; ++i){\n for(int j=0; j<n; ++j){\n cin >> r[i][j];\n }\n }\n\n int d = 1;\n while((1 << d) < n)\n ++ d;\n\n memo.assign(d, vector<vector<int> >(n, vector<int>(1<<n, -1)));\n cout << solve(d-1, m-1, (1<<n)-1) << endl;\n }\n}","accuracy":1,"time_ms":5410,"memory_kb":24440,"score_of_the_acc":-1.1269,"final_rank":7},{"submission_id":"aoj_2053_361599","code_snippet":"#include <iostream>\n#include <cstring>\n\nusing namespace std;\n\nstatic int mem[16][1<<16][5];\nint vs[16][16];\nint lg[16] = {1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4};\n\nint search(int win, int lose, int cnt, int n){\n\tif(~mem[win][lose][cnt]) return mem[win][lose][cnt];\n\tif(!lose) return mem[win][lose][cnt] = 1;\n\tif(cnt == 0) return mem[win][lose][cnt] = 0;\n\tint res = 0, loseBit = 0;\n\tfor(int t=lose;t;t&=(t-1)) loseBit++;\n\tif(lg[loseBit] > cnt) return mem[win][lose][cnt] = 0;\n\tfor(int i=0;i<n;i++){\n\t\tif(!(lose&(1<<i))) continue;\n\t\tif(!vs[win][i]) continue;\n\t\tint mask = lose^(1<<i);\n\t\tint b = mask;\n\t\tdo{\n\t\t\tres += search(win, b, cnt-1, n) * search(i, mask^b, cnt-1, n);\n\t\t\tb = (b-1)&mask;\n\t\t} while (b != mask);\n\t}\n\treturn mem[win][lose][cnt] = res;\n}\n\nint main(){\n\tint n, m;\n\twhile(cin >> n >> m, 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 >> vs[i][j];\n\t\tmemset(mem,-1,sizeof(mem));\n\t\tcout << search(m-1, (((1<<n)-1)^(1<<(m-1))), lg[n-1], n) << endl;\n\t}\n}","accuracy":1,"time_ms":3940,"memory_kb":20000,"score_of_the_acc":-0.1648,"final_rank":1},{"submission_id":"aoj_2053_361597","code_snippet":"// Problem F : Controlled Tournament\n\n#include <iostream>\n#include <cstring>\n\nusing namespace std;\n\nstatic int mem[16][1<<16][5];\nint vs[16][16];\nint lg[16] = {1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4};\n\n// ツ講ツ評ツスツδ可イツドツつサツづ個づ慊づ慊づ個δδつ可サツ探ツ催オ\nint search(int win, int lose, int cnt, int n){\n\tif(cnt < 0) return 0;\n\tif(~mem[win][lose][cnt]) return mem[win][lose][cnt];\n\tif(!lose) return mem[win][lose][cnt] = 1;\n\tint res = 0, loseBit = 0;\n\tfor(int t=lose;t;t&=(t-1)) loseBit++;\n\tif(lg[loseBit] > cnt) return mem[win][lose][cnt] = 0;\n\tfor(int i=0;i<n;i++){\n\t\tif(!(lose&(1<<i))) continue;\n\t\tif(!vs[win][i]) continue;\n\t\tint mask = lose^(1<<i);\n\t\tint b = mask;\n\t\tdo{\n\t\t\tres += search(win, b, cnt-1, n) * search(i, mask^b, cnt-1, n);\n\t\t\tb = (b-1)&mask;\n\t\t} while (b != mask);\n\t}\n\treturn mem[win][lose][cnt] = res;\n}\n\nint main(){\n\tint n, m;\n\twhile(cin >> n >> m, 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 >> vs[i][j];\n\t\tmemset(mem,-1,sizeof(mem));\n\t\tcout << search(m-1, (((1<<n)-1)^(1<<(m-1))), lg[n-1], n) << endl;\n\t}\n}","accuracy":1,"time_ms":4460,"memory_kb":20000,"score_of_the_acc":-0.4602,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_2053_10848151\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nconst int MAXN = 1 << 16;\\nint n, m;\\nint bit1[MAXN]; // 二进制数中有多少个 1\\nint dp[20][10][MAXN];\\nvector<int> G[20];\\nint dfs(int u, int h, int bits) {\\n if(bit1[bits] == 1) return 1;\\n if((1 << h) < bit1[bits]) return 0;\\n if(dp[u][h][bits] != -1) return dp[u][h][bits];\\n else dp[u][h][bits] = 0;\\n int& res = dp[u][h][bits];\\n for(int i = bits & (bits - 1); i; i = bits & (i - 1)) {\\n if((i >> u) & 1) {\\n int j = bits ^ i;\\n for(int k = 0; k < G[u].size(); k++) {\\n int v = G[u][k];\\n if((j >> v) & 1) {\\n res += dfs(u, h - 1, i) * dfs(v, h - 1, j);\\n }\\n }\\n }\\n }\\n return res;\\n}\\nint main() {\\n for(int i = 0; i < MAXN; i++) {\\n bit1[i] = bit1[i >> 1] + (i & 1);\\n }\\n while(cin >> n >> m && (n + m)) {\\n memset(dp, -1, sizeof dp);\\n for(int i = 0; i < n; i++) G[i].clear();\\n for(int i = 0; i < n; i++) {\\n for(int j = 0; j < n; j++) {\\n int x;\\n cin >> x;\\n if(x) G[i].push_back(j);\\n }\\n }\\n int h = ceil(log(n) / log(2));\\n cout << dfs(m - 1, h, (1 << n) - 1) << endl;\\n }\\n return 0;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3660,\n \"memory_kb\": 54992,\n \"score_of_the_acc\": -1.0057,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2053_10826910\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nconst int MAXN = 1 << 16;\\nint n, m;\\nint bit1[MAXN]; // 二进制数中有多少个 1\\nint dp[20][10][MAXN];\\nvector<int> G[20];\\nint dfs(int u, int h, int bits) {\\n if(bit1[bits] == 1) return 1;\\n if((1 << h) < bit1[bits]) return 0;\\n if(dp[u][h][bits] != -1) return dp[u][h][bits];\\n else dp[u][h][bits] = 0;\\n int& res = dp[u][h][bits];\\n for(int i = bits & (bits - 1); i; i = bits & (i - 1)) { // 枚举 bits 里的 1 选或不选的情况\\n if((i >> u) & 1) {\\n int j = bits ^ i;\\n for(int k = 0; k < G[u].size(); k++) {\\n int v = G[u][k];\\n if((j >> v) & 1) {\\n res += dfs(u, h - 1, i) * dfs(v, h - 1, j);\\n }\\n }\\n }\\n }\\n return res;\\n}\\nint main() {\\n for(int i = 0; i < MAXN; i++) {\\n bit1[i] = bit1[i >> 1] + (i & 1);\\n }\\n while(cin >> n >> m && (n + m)) {\\n memset(dp, -1, sizeof dp);\\n for(int i = 0; i < n; i++) G[i].clear();\\n for(int i = 0; i < n; i++) {\\n for(int j = 0; j < n; j++) {\\n int x;\\n cin >> x;\\n if(x) G[i].push_back(j);\\n }\\n }\\n int h = ceil(log(n) / log(2));\\n cout << dfs(m - 1, h, (1 << n) - 1) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3670,\n \"memory_kb\": 54724,\n \"score_of_the_acc\": -1.0037,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2053_2380459\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nconst int MAXN = 1 << 16;\\nint n, m;\\nint bit1[MAXN]; // 二?制数中有多少个 1\\nint dp[20][10][MAXN];\\nvector<int> G[20];\\nint dfs(int u, int h, int bits) {\\n if(bit1[bits] == 1) return 1;\\n if((1 << h) < bit1[bits]) return 0;\\n if(dp[u][h][bits] != -1) return dp[u][h][bits];\\n else dp[u][h][bits] = 0;\\n int& res = dp[u][h][bits];\\n for(int i = bits & (bits - 1); i; i = bits & (i - 1)) {\\n if((i >> u) & 1) {\\n int j = bits ^ i;\\n for(int k = 0; k < G[u].size(); k++) {\\n int v = G[u][k];\\n if((j >> v) & 1) {\\n res += dfs(u, h - 1, i) * dfs(v, h - 1, j);\\n }\\n }\\n }\\n }\\n return res;\\n}\\nint main() {\\n for(int i = 0; i < MAXN; i++) {\\n bit1[i] = bit1[i >> 1] + (i & 1);\\n }\\n while(cin >> n >> m && (n + m)) {\\n memset(dp, -1, sizeof dp);\\n for(int i = 0; i < n; i++) G[i].clear();\\n for(int i = 0; i < n; i++) {\\n for(int j = 0; j < n; j++) {\\n int x;\\n cin >> x;\\n if(x) G[i].push_back(j);\\n }\\n }\\n int h = ceil(log(n) / log(2));\\n cout << dfs(m - 1, h, (1 << n) - 1) << endl;\\n }\\n return 0;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4070,\n \"memory_kb\": 54852,\n \"score_of_the_acc\": -1.2346,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2053_1679677\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cassert>\\n#include <cstring>\\n#include <iostream>\\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 TRACE(x) cout << #x << \\\" = \\\" << x << endl\\n#define _ << \\\" _ \\\" <<\\n\\ntypedef long long llint;\\n\\nconst int MAX = 16;\\n\\nint R[MAX][MAX];\\nint f[5][MAX][1<<MAX];\\nint bio[5][MAX][1<<MAX];\\nint cookie, n;\\n\\nint solve(int h, int w, int s) {\\n if (bio[h][w][s] == cookie) return f[h][w][s];\\n bio[h][w][s] = cookie;\\n\\n int cnt = 0;\\n REP(i, n) \\n if (s&(1<<i)) cnt++;\\n if (cnt == 1) return f[h][w][s] = (s>>w) & 1;\\n\\n int nh = 0;\\n while (cnt > 1) nh++, cnt = (cnt + 1) / 2;\\n if (nh > h) return f[h][w][s] = 0;\\n\\n f[h][w][s] = 0;\\n for (int s1 = s; s1 > 0; s1 = s & (s1 - 1))\\n if ((s1 & s) == s1) {\\n if (!(s1 & (1<<w))) continue;\\n if (s1 == s) continue;\\n\\n int s2 = s ^ s1;\\n\\n REP(i, n)\\n if (s2 & (1<<i))\\n if (R[w][i]) f[h][w][s] += solve(h-1, w, s1) * solve(h-1, i, s2);\\n }\\n return f[h][w][s];\\n}\\n\\nint main(void) {\\n int m;\\n while (scanf(\\\"%d %d\\\", &n, &m) == 2) {\\n if (n == 0 && m == 0) break;\\n\\n --m;\\n REP(i, n) REP(j, n) scanf(\\\"%d\\\", &R[i][j]);\\n\\n cookie++;\\n int h = 0, tmp = n;\\n while (tmp > 1) tmp = (tmp + 1) / 2, h++;\\n printf(\\\"%d\\\\n\\\", solve(h, m, (1<<n) - 1));\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4110,\n \"memory_kb\": 20112,\n \"score_of_the_acc\": -0.2646,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2053_772930\",\n \"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 repi(i,a,b) for(int i = (a); i < (b); i++)\\n#define rep(i,a) repi(i,0,a)\\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\\n#define pb push_back\\n#define mp makek_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;\\n\\nint N, M, R[16][16], mem[1<<16][16][8];\\n\\nint f(int s, int i, int h)\\n{\\n if (mem[s][i][h] >= 0) return mem[s][i][h];\\n if (!(s >> i & 1)) return 0;\\n int sz = __builtin_popcount(s);\\n if (sz == 1) return 1;\\n\\n int ret = 0;\\n int M = 1 << h - 1;\\n int m = sz - M;\\n int tmp = s ^ 1 << i;\\n for (int t = tmp; t; --t, t &= tmp) {\\n\\tint k = __builtin_popcount(t);\\n\\tif (m <= k && k <= M)\\n\\t for (int j = 0; j < N; ++j)\\n\\t\\tif (R[i][j])\\n\\t\\t ret += f(s ^ t, i, h - 1) * f(t, j, h - 1);\\n }\\n return mem[s][i][h] = ret;\\n}\\n\\nvoid solve()\\n{\\n memset(mem, -1, sizeof(mem));\\n\\n --M;\\n rep(i,N) rep(j,N) cin >> R[i][j];\\n\\n cout << f((1 << N) - 1, M, 32 - __builtin_clz(N - 1)) << endl;\\n}\\n\\nint main()\\n{\\n while (cin >> N >> M && N)\\n\\tsolve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3650,\n \"memory_kb\": 33940,\n \"score_of_the_acc\": -0.3984,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2053_470930\",\n \"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\\ntemplate <size_t T>\\nbool prevSubset(bitset<T>& bs, const bitset<T>& mask)\\n{\\n bs = bs.to_ulong() - 1ull;\\n bs &= mask;\\n if(bs.none())\\n return false;\\n return true;\\n}\\n\\nint n, m;\\nvector<vector<int> > r;\\n\\nvector<vector<vector<int> > > memo;\\n\\nint solve(int d, int win, bitset<16> rest)\\n{\\n if(rest.count() == 1)\\n return 1;\\n if(d == -1)\\n return 0;\\n\\n if(memo[d][win][rest.to_ulong()] != -1)\\n return memo[d][win][rest.to_ulong()];\\n\\n int ret = 0;\\n bitset<16> bs1 = rest;\\n while(prevSubset(bs1, rest)){\\n bitset<16> bs2 = rest ^ bs1;\\n if(bs1.count() > (1<<d) || bs2.count() > (1<<d))\\n continue;\\n if(!bs1[win])\\n continue;\\n\\n for(int i=0; i<n; ++i){\\n if(bs2[i] && r[win][i] == 1)\\n ret += solve(d-1, win, bs1) * solve(d-1, i, bs2);\\n }\\n }\\n\\n return memo[d][win][rest.to_ulong()] = ret;\\n}\\n\\nint main()\\n{\\n for(;;){\\n cin >> n >> m;\\n if(n == 0)\\n return 0;\\n\\n r.assign(n, vector<int>(n));\\n for(int i=0; i<n; ++i){\\n for(int j=0; j<n; ++j){\\n cin >> r[i][j];\\n }\\n }\\n\\n int d = 1;\\n while((1 << d) < n)\\n ++ d;\\n\\n memo.assign(d, vector<vector<int> >(n, vector<int>(1<<n, -1)));\\n cout << solve(d-1, m-1, (1<<n)-1) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5410,\n \"memory_kb\": 24440,\n \"score_of_the_acc\": -1.1269,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2053_361599\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstring>\\n\\nusing namespace std;\\n\\nstatic int mem[16][1<<16][5];\\nint vs[16][16];\\nint lg[16] = {1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4};\\n\\nint search(int win, int lose, int cnt, int n){\\n\\tif(~mem[win][lose][cnt]) return mem[win][lose][cnt];\\n\\tif(!lose) return mem[win][lose][cnt] = 1;\\n\\tif(cnt == 0) return mem[win][lose][cnt] = 0;\\n\\tint res = 0, loseBit = 0;\\n\\tfor(int t=lose;t;t&=(t-1)) loseBit++;\\n\\tif(lg[loseBit] > cnt) return mem[win][lose][cnt] = 0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tif(!(lose&(1<<i))) continue;\\n\\t\\tif(!vs[win][i]) continue;\\n\\t\\tint mask = lose^(1<<i);\\n\\t\\tint b = mask;\\n\\t\\tdo{\\n\\t\\t\\tres += search(win, b, cnt-1, n) * search(i, mask^b, cnt-1, n);\\n\\t\\t\\tb = (b-1)&mask;\\n\\t\\t} while (b != mask);\\n\\t}\\n\\treturn mem[win][lose][cnt] = res;\\n}\\n\\nint main(){\\n\\tint n, m;\\n\\twhile(cin >> n >> m, 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 >> vs[i][j];\\n\\t\\tmemset(mem,-1,sizeof(mem));\\n\\t\\tcout << search(m-1, (((1<<n)-1)^(1<<(m-1))), lg[n-1], n) << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3940,\n \"memory_kb\": 20000,\n \"score_of_the_acc\": -0.1648,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2053_361597\",\n \"code_snippet\": \"// Problem F : Controlled Tournament\\n\\n#include <iostream>\\n#include <cstring>\\n\\nusing namespace std;\\n\\nstatic int mem[16][1<<16][5];\\nint vs[16][16];\\nint lg[16] = {1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4};\\n\\n// ツ講ツ評ツスツδ可イツドツつサツづ個づ慊づ慊づ個δδつ可サツ探ツ催オ\\nint search(int win, int lose, int cnt, int n){\\n\\tif(cnt < 0) return 0;\\n\\tif(~mem[win][lose][cnt]) return mem[win][lose][cnt];\\n\\tif(!lose) return mem[win][lose][cnt] = 1;\\n\\tint res = 0, loseBit = 0;\\n\\tfor(int t=lose;t;t&=(t-1)) loseBit++;\\n\\tif(lg[loseBit] > cnt) return mem[win][lose][cnt] = 0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tif(!(lose&(1<<i))) continue;\\n\\t\\tif(!vs[win][i]) continue;\\n\\t\\tint mask = lose^(1<<i);\\n\\t\\tint b = mask;\\n\\t\\tdo{\\n\\t\\t\\tres += search(win, b, cnt-1, n) * search(i, mask^b, cnt-1, n);\\n\\t\\t\\tb = (b-1)&mask;\\n\\t\\t} while (b != mask);\\n\\t}\\n\\treturn mem[win][lose][cnt] = res;\\n}\\n\\nint main(){\\n\\tint n, m;\\n\\twhile(cin >> n >> m, 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 >> vs[i][j];\\n\\t\\tmemset(mem,-1,sizeof(mem));\\n\\t\\tcout << search(m-1, (((1<<n)-1)^(1<<(m-1))), lg[n-1], n) << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4460,\n \"memory_kb\": 20000,\n \"score_of_the_acc\": -0.4602,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1085,"cells":{"group_id":{"kind":"string","value":"aoj_2052_cpp"},"problem_description":{"kind":"string","value":"Problem E:\nOptimal Rest\nMusic Macro Language (MML) is a language for textual representation of musical scores. Although there are various dialects of MML, all of them provide a set of commands to describe\nscores, such as commands for notes, rests, octaves, volumes, and so forth.\nIn this problem, we focus on rests, i.e. intervals of silence. Each rest command consists of a\ncommand specifier ‘R’ followed by a duration specifier. Each duration specifier is basically one\nof the following numbers: ‘1’, ‘2’, ‘4’, ‘8’, ‘16’, ‘32’, and ‘64’, where ‘1’ denotes a whole (1), ‘2’\na half (1/2), ‘4’ a quarter (1/4), ‘8’ an eighth (1/8), and so on. This number is called the base\nduration, and optionally followed by one or more dots. The first dot adds the duration by the\nhalf of the base duration. For example, ‘4.’ denotes the duration of ‘4’ (a quarter) plus ‘8’ (an\neighth, i.e. the half of a quarter), or simply 1.5 times as long as ‘4’. In other words, ‘R4.’ is\nequivalent to ‘R4R8’. In case with two or more dots, each extra dot extends the duration by the\nhalf of the previous one. Thus ‘4..’ denotes the duration of ‘4’ plus ‘8’ plus ‘16’, ‘4...’ denotes\nthe duration of ‘4’ plus ‘8’ plus ‘16’ plus ‘32’, and so on. The duration extended by dots cannot\nbe shorter than ‘64’. For exapmle, neither ‘64.’ nor ‘16...’ will be accepted since both of the\nlast dots indicate the half of ‘64’ (i.e. the duration of 1/128).\nIn this problem, you are required to write a program that finds the shortest expressions equivalent\nto given sequences of rest commands.\nInput\nThe input consists of multiple datasets. The first line of the input contains the number of\ndatasets\nN\n. Then,\nN\ndatasets follow, each containing a sequence of valid rest commands in one\nline. You may assume that no sequence contains more than 100,000 characters.\nOutput\nFor each dataset, your program should output the shortest expression in one line. If there are\nmultiple expressions of the shortest length, output the lexicographically smallest one.\nSample Input\n3\nR2R2\nR1R2R4R8R16R32R64\nR1R4R16\nOutput for the Sample Input\nR1\nR1......\nR16R1R4"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2052_10233879","code_snippet":"// AOJ #2052 Optimal Rest\n// 2025.2.20\n\n#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1e9;\n\nstruct Coin {\n string s;\n int cost;\n int value;\n};\n \nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n int N;\n cin >> N;\n cin.ignore();\n \n vector<string> bases = {\"1\",\"2\",\"4\",\"8\",\"16\",\"32\",\"64\"};\n vector<Coin> coins;\n for(auto &b : bases){\n int baseVal = stoi(b);\n int baseLength = 64 / baseVal;\n int mmax = 0;\n while((1 << mmax) * baseVal <= 64) mmax++;\n mmax--;\n {\n Coin c;\n c.s = \"R\" + b;\n c.cost = (int)c.s.size();\n c.value = baseLength;\n coins.push_back(c);\n }\n for(int m=1; m<=mmax; m++){\n Coin c;\n c.s = \"R\" + b + string(m, '.');\n c.cost = (int)c.s.size();\n double factor = 2 - 1.0 / (1 << m);\n int add = 64 / (1 << m);\n c.value = (128 - add) / baseVal;\n coins.push_back(c);\n }\n }\n \n\n for(int cs=0; cs<N; cs++){\n string line;\n getline(cin, line);\n \n int T = 0;\n for (int i = 0; i < (int)line.size(); ){\n if(line[i]=='R'){\n i++;\n string num;\n while(i < (int)line.size() && isdigit(line[i])){\n num.push_back(line[i]);\n i++;\n }\n int baseVal = stoi(num);\n int baseLength = 64 / baseVal;\n int m = 0;\n while(i < (int)line.size() && line[i]=='.') m++, i++;\n\n if(m==0) T += baseLength;\n else {\n int add = 64 / (1 << m);\n int len = (128 - add) / baseVal;\n T += len;\n }\n } else i++;\n }\n \n vector<int> dp(T+1, INF);\n vector<int> prev(T+1, -1);\n vector<int> pick(T+1, -1);\n dp[0] = 0;\n for (int t = 0; t <= T; t++){\n if(dp[t] == INF) continue;\n for (int i = 0; i < (int)coins.size(); i++){\n int nt = t + coins[i].value;\n if(nt > T) continue;\n int nc = dp[t] + coins[i].cost;\n if(nc < dp[nt]){\n dp[nt] = nc;\n prev[nt] = t;\n pick[nt] = i;\n }\n }\n }\n \n vector<string> solCoins;\n for (int t = T; t > 0; ){\n int i = pick[t];\n solCoins.push_back(coins[i].s);\n t = prev[t];\n }\n \n auto cmp = [&](const string &a, const string &b){\n return a + b < b + a;\n };\n sort(solCoins.begin(), solCoins.end(), cmp);\n \n string ans;\n for(auto &s : solCoins) ans += s;\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":42860,"score_of_the_acc":-0.8454,"final_rank":6},{"submission_id":"aoj_2052_9637730","code_snippet":"#include<bits/stdc++.h>\n#define y second\n#define x first\n\nusing namespace std;\nusing namespace std::chrono;\nusing psi = pair<string, int>;\n\nconst int NN = 101010, MM = 32 * NN;\n\nchar s[NN];\n\nint dp[MM];\n\nint main() {\n int t; scanf(\"%d\", &t);\n vector<psi> vec;\n for(int i = 1; i <= 64; i *= 2) {\n string s = \"R\" + to_string(i);\n int val = 64 / i, x = val;\n for(int j = 0; x; j++) {\n vec.push_back({s, val});\n s += '.';\n x /= 2, val += x;\n }\n }\n\n for(int i = 1; i < MM; i++) {\n dp[i] = 1e9;\n for(psi p: vec) if(i >= p.y) {\n dp[i] = min(dp[i], dp[i - p.y] + (int)p.x.size());\n }\n }\n\n while(t--) {\n scanf(\"%s\", s);\n int all = 0, val = 0;\n for(int i = 0, x = 0; s[i]; i++) {\n if(s[i] == 'R') all += val, x = 0;\n else if(isdigit(s[i])) {\n x = 10 * x + s[i] - '0';\n if(!isdigit(s[i + 1])) x = 64 / x, val = x;\n }\n else x /= 2, val += x;\n }\n all += val;\n\n string ans;\n while(all) {\n psi mn = {\"R\", all};\n for(psi p: vec) if(all >= p.y && dp[all - p.y] + p.x.size() == dp[all]) {\n if(p.x + \"R\" < mn.x + \"R\") mn = p;\n }\n ans += mn.x;\n all -= mn.y;\n }\n printf(\"%s\\n\", ans.c_str());\n }\n}","accuracy":1,"time_ms":510,"memory_kb":16336,"score_of_the_acc":-0.4557,"final_rank":4},{"submission_id":"aoj_2052_2859466","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\n\n/* 幾何の基本 */\n\n#include <complex>\n\ntypedef complex<ld> Point;\n\n\nconst ld pi = acos(-1.0);\nconst ld dtop = pi / 180.;\nconst ld ptod = 1. / dtop;\n\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() > rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\n// 点の入力\nPoint input_Point() {\n\tld x, y;\n\tcin >> x >> y;\n\treturn Point(x, y);\n}\n\n// 誤差つき等号判定\nbool eq(const ld a, const ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// 内積\nld dot(const Point& a, const Point& b) {\n\treturn real(conj(a) * b);\n}\n\n// 外積\nld cross(const Point& a, const Point& b) {\n\treturn imag(conj(a) * b);\n}\n\n// 直線の定義\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) : a(a), b(b) {}\n\tPoint operator[](const int _num)const {\n\t\tif (_num == 0)return a;\n\t\telse if (_num == 1)return b;\n\t\telse {\n\t\t\tassert(false);\n\t\t\treturn Point();\n\t\t}\n\t}\n};\n\n// 円の定義\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n\tCircle() : p(Point(0, 0)), r(0) {}\n\tCircle(Point p, ld r) : p(p), r(r) {}\n};\n\n// ccw\n// 1: a,b,cが反時計周りの順に並ぶ\n//-1: a,b,cが時計周りの順に並ぶ\n// 2: c,a,bの順に直線に並ぶ\n//-2: a,b,cの順に直線に並ぶ\n// 0: a,c,bの順に直線に並ぶ\nint ccw(const Point& a, const Point &b, const Point &c) {\n\tconst Point nb(b - a);\n\tconst Point nc(c - a);\n\tif (cross(nb, nc) > eps) return 1; // a,b,cが反時計周りの順に並ぶ\n\tif (cross(nb, nc) < -eps) return -1; // a,b,cが時計周りの順に並ぶ\n\tif (dot(nb, nc) < 0) return 2; // c,a,bの順に直線に並ぶ\n\tif (norm(nb) < norm(nc)) return -2; // a,b,cの順に直線に並ぶ\n\treturn 0; // a,c,bの順に直線に並ぶ\n}\n\n\n/* 交差判定 */\n\n// 直線と直線の交差判定\nbool isis_ll(const Line& l, const Line& m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// 直線と線分の交差判定\nbool isis_ls(const Line& l, const Line& s) {\n\treturn isis_ll(l, s) &&\n\t\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// 線分と線分の交差判定\nbool isis_ss(const Line& s, const Line& t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n\t\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// 点の直線上判定\nbool isis_lp(const Line& l, const Point& p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n\n// 点の線分上判定\nbool isis_sp(const Line& s, const Point& p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\n// 垂線の足\nPoint proj(const Line &l, const Point& p) {\n\tld t = dot(p - l.a, l.b - l.a) / norm(l.a - l.b);\n\treturn l.a + t * (l.b - l.a);\n}\n\n//線対象の位置にある点\nPoint reflect(const Line &l, const Point &p) {\n\tPoint pr = proj(l, p);\n\treturn pr * 2.l - p;\n}\n\n// 直線と直線の交点\nPoint is_ll(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tassert(cross(sv, tv) != 0);\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n// 直線と直線の交点\nvector<Point> is_ll2(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\n\telse {\n\t\tvector<Point>ans;\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\n\t\t\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\n\t\t}\n\t\treturn ans;\n\t}\n}\n// 線分と線分の交点\n// 重なってる部分あるとassert(false)\nPoint is_ss(const Line &s, const Line& t) {\n\tif (isis_ss(s, t)) {\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tfor (int l = 0; l < 2; ++l) {\n\t\t\t\tif (s[k] == t[l])return s[k];\n\t\t\t}\n\t\t}\n\t\treturn is_ll(s, t);\n\t}\n\telse {\n\t\t//先にisis_ssしてね\n\t\tassert(false);\n\t\treturn Point(0, 0);\n\t}\n}\n// 線分と線分の交点\nvector<Point> is_ss2(const Line &s, const Line& t) {\n\tvector<Point> kouho(is_ll2(s, t));\n\tvector<Point>ans;\n\tfor (auto p : kouho) {\n\t\tif (isis_sp(s, p) && isis_sp(t, p))ans.emplace_back(p);\n\t}\n\treturn ans;\n}\n// 直線と点の距離\nld dist_lp(const Line& l, const Point& p) {\n\treturn abs(p - proj(l, p));\n}\n\n//直線と直線の距離\nld dist_ll(const Line& l, const Line& m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\n// 直線と線分の距離\nld dist_ls(const Line& l, const Line& s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\n// 線分と点の距離\nld dist_sp(const Line& s, const Point& p) {\n\tPoint r = proj(s, p);\n\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\n}\n\n// 線分と線分の距離\nld dist_ss(const Line& s, const Line& t) {\n\tif (isis_ss(s, t)) return 0;\n\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\n}\n\n\n//直線と直線の二等分線のベクトル\nLine line_bisection(const Line &s, const Line &t) {\n\tconst Point laglanju(is_ll(s, t));\n\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\n\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\n\n\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\n}\n//点と点の垂直二等分線 aを左に見ながら\nLine point_bisection(const Point&a, const Point&b) {\n\tconst Point cen((a + b) / 2.l);\n\tconst Point vec = (b - a)*Point(0, 1);\n\treturn Line(cen, cen + vec);\n}\n\n//三つの点からなる外心\nPoint outer_center(const vector<Point>&ps) {\n\tassert(ps.size() == 3);\n\tLine l1 = point_bisection(ps[0], ps[1]);\n\tLine l2 = point_bisection(ps[1], ps[2]);\n\treturn is_ll(l1, l2);\n}\n\n\n//三つの直線からなる内心\n//三つの直線が並行でないことは確かめといてね\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(line_bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(line_bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//三つの直線からなる傍心\n//三つの直線が並行でないことは確かめといてね\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(line_bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(line_bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:並行\n//c:並行でない\n//三つの直線から同距離の位置を求める。\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(line_bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(line_bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(line_bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* 円 */\n\n// 円と円の交点\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n/*\n点が円の中にいるか\n0 => out\n1 => on\n2 => in*/\nint is_in_Circle(const Point& p, const Circle &cir) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\nint is_in_Circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n/*\n円lcが円rcの中にいるか\n0 => out\n1 => on\n2 => in*/\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// 円と直線の交点\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// 円と線分の距離\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// 円と点の接線\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// 円と円の接線\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), nret.begin(), nret.end());\n\t}\n\telse {\n\t\tPoint v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\n\t\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\n\t\tret.push_back(Line(q1, q1 + v));\n\t\tret.push_back(Line(q2, q2 + v));\n\t}\n\treturn ret;\n}\n//二つの円の重なり面積\nld two_Circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* 多角形 */\n\ntypedef vector<Point> Polygon;\n\n\n\n//多角形(複数の点)の最小包含円をO(N=頂点数)で求めるアルゴリズム\n//同一直線上に三つの点がないこと\n#include<random>\nCircle welzl(vector<Point>ps) {\n\tstruct solver {\n\t\tCircle solve(vector<Point>&ps, vector<Point>&rs) {\n\t\t\tif (ps.empty() || rs.size() == 3) {\n\t\t\t\tif (rs.size() == 1) {\n\t\t\t\t\treturn Circle(Point(rs[0]), 0);\n\t\t\t\t}\n\t\t\t\telse if (rs.size() == 2) {\n\t\t\t\t\treturn Circle((rs[0] + rs[1]) / 2.0l, abs(rs[1] - rs[0]) / 2);\n\t\t\t\t}\n\t\t\t\telse if (rs.size() == 3) {\n\t\t\t\t\tvector<Line> ls(3);\n\t\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\t\tls[i] = Line(rs[i], rs[(i + 1) % 3]);\n\t\t\t\t\t}\n\t\t\t\t\tPoint center = outer_center(rs);\n\t\t\t\t\treturn Circle(center, abs(center - rs[0]));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn Circle(Point(), 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\n\t\t\t\tPoint p_ba = ps.back();\n\t\t\t\tps.pop_back();\n\t\t\t\tCircle d = solve(ps, rs);\n\t\t\t\tps.push_back(p_ba);\n\t\t\t\tif (is_in_Circle(d, p_ba)) {\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\trs.push_back(p_ba);\n\t\t\t\t\tps.pop_back();\n\t\t\t\t\tauto ans = solve(ps, rs);\n\t\t\t\t\tps.push_back(p_ba);\n\t\t\t\t\trs.pop_back();\n\t\t\t\t\treturn ans;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}so;\n\tstd::random_device rd;\n\tstd::mt19937 mt(rd());\n\tshuffle(ps.begin(), ps.end(), mt);\n\tvector<Point>rs;\n\tCircle ans = so.solve(ps, rs);\n\treturn ans;\n}\n// 面積\nld get_area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tfor (int j = 0; j<n; ++j) res += cross(p[j], p[(j + 1) % n]);\n\treturn res / 2;\n}\n\n//多角形の回転方向\nbool is_counter_clockwise(const Polygon &poly) {\n\tld angle = 0;\n\tint n = poly.size();\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\n\t\tangle += arg((c - b) / (b - a));\n\t}\n\treturn angle > eps;\n}\n\n// 円の内外判定\n/*0 => out\n1 => on\n2 => in*/\nint is_in_Polygon(const Polygon &poly, const Point& p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n];\n\t\tif (isis_sp(Line(a, b), p)) return 1;\n\t\tangle += arg((b - p) / (a - p));\n\t}\n\treturn eq(angle, 0) ? 0 : 2;\n}\n//円の内外判定2 高速\nenum { out, on, in };\nint convex_contains(const Polygon &P, const Point &p) {\n\tconst int n = P.size();\n\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\n\tint a = 0, b = n;\n\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\n\t\tint c = (a + b) / 2;\n\t\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\n\t\t\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\n\t\t\telse a = c;\n\t\t}\n\t\telse {\n\t\t\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\n\t\t\telse b = c;\n\t\t}\n\t}\n\tb %= n;\n\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\n\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\n\treturn 1;\n}\n\n// 凸包\n//点や線を返すことも有り得るので注意\nPolygon convex_hull(vector<Point> ps) {\n\tint n = ps.size();\n\tint k = 0;\n\tsort(ps.begin(), ps.end());\n\tPolygon ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++])\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n\n\n//凸カット\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\n\tint n = ps.size();\n\tPolygon q;\n\tPolygon r;\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = ps[i], b = ps[(i + 1) % n];\n\t\tLine m = Line(a, b);\n\t\tif (ccw(l.a, l.b, a) != -1) q.push_back(a);\n\t\tif (ccw(l.a, l.b, a) != 1) r.push_back(a);\n\t\tif (ccw(l.a, l.b, a) * ccw(l.a, l.b, b) < 0 && isis_ll(l, m)) {\n\t\t\tq.push_back(is_ll(l, m));\n\t\t\tr.push_back(is_ll(l, m));\n\t\t}\n\t}\n\tconst vector<Polygon>polys{ q,r };\n\treturn polys;\n}\n\nPolygon cen(Polygon po) {\n\tPoint cen;\n\tfor (auto p : po) {\n\t\tcen += p;\n\t}\n\tcen /= po.size();\n\tfor (auto&p : po) {\n\t\tp -= cen;\n\t}\n\treturn po;\n}\n\nint get_id(string st,int& a) {\n\tassert(st[a]=='R');\n\ta++;\n\tint num=0;\n\twhile (a != st.size() && st[a] != 'R'&&st[a]!='.') {\n\t\tnum*=10;\n\t\tnum+=st[a]-'0';\n\t\ta++;\n\t}\n\tnum=64/num;\n\tint k=num;\n\twhile (a != st.size() && st[a] != 'R') {\n\t\tassert(st[a]=='.');\n\t\tk/=2;\n\t\tnum+=k;\n\t\ta++;\n\t}\n\treturn num;\n}\n\nint get_num(string st) {\n\tint sum=0;\n\tint a=0;\n\twhile (a != st.size()) {\n\t\tsum+=get_id(st,a);\n\t}\n\treturn sum;\n}\n\nint main() {\n\tvector<string>dp(5000);\n\tdp[0]=\"\";\n\tmap<string,int>mp;\n\tfor (int k = 1; k <= 64; k *= 2) {\n\t\tint num=64/k;\n\t\tstring st=\"R\"+to_string(k);\n\t\tmp[st]=num;\n\t\tfor (int plus = k * 2; plus!=128; plus *= 2) {\n\t\t\tnum+=64/plus;\n\t\t\tst+='.';\n\t\t\tmp[st]=num;\n\t\t}\n\t}\n\tfor (int i = 0; i < 3000; ++i) {\n\t\tfor (auto&& m : mp) {\n\t\t\tint j=i+m.second;\n\t\t\tstring st=dp[i]+m.first;\n\t\t\tif (dp[j] == \"\" || (dp[j].size() > st.size()) || ((dp[j].size() == st.size() && dp[j] > st))) {\n\t\t\t\tdp[j] = st;\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 1000; i <= 2000; ++i) {\n\t\tint k=dp[i].find(\"R1.R1.\");\n\t\tassert(k!=-1);\n\t}\n\tint N;cin>>N;\n\twhile (N--){\n\t\tstring st;cin>>st;\n\t\tint n=get_num(st);\n\n\t\tif (n < 3000) {\n\t\t\tcout<<dp[n]<<endl;\n\t\t}\n\t\telse {\n\t\t\tint x=n%384;\n\t\t\tint t=x+1920;\n\n\t\t\tint sa=n-t;\n\t\t\tint need=sa/384;\n\n\t\t\tint place=dp[t].find(\"R1.R1.R1.R1.\");\n\t\t\tstring ans=dp[t];\n\t\t\tstring plus;\n\t\t\tfor (int k = 0; k < need; ++k) {\n\t\t\t\tplus+=\"R1.R1.R1.R1.\";\n\t\t\t}\n\t\t\tans.insert(ans.begin()+place,plus.begin(),plus.end());\n\t\t\tcout<<ans<<endl;\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":780,"memory_kb":3916,"score_of_the_acc":-0.3142,"final_rank":2},{"submission_id":"aoj_2052_1679577","code_snippet":"#include <algorithm>\n#include <cassert>\n#include <cstring>\n#include <iostream>\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 TRACE(x) cout << #x << \" = \" << x << endl\n#define _ << \" _ \" <<\n\ntypedef long long llint;\n\nconst int MAX = 64*100100;\nconst int inf = 1e9;\n\nchar s[MAX];\nint f[MAX];\nint nx[MAX], nr[MAX], ns[MAX];\n\n\nint main(void) {\n int t;\n scanf(\"%d\", &t);\n while (t--) {\n scanf(\"%s\", s);\n int len = strlen(s);\n int i = 0;\n int last = 0;\n int sum = 0;\n while (i < len) {\n if (s[i] == '.') {\n last /= 2;\n i++;\n } else {\n assert(s[i] == 'R');\n i++;\n int x = 0;\n while (i < len && isdigit(s[i])) x = x*10 + s[i++] - '0';\n last = 64 / x;\n }\n sum += last;\n }\n\n f[0] = 0;\n nx[0] = -1;\n FOR(s, 1, sum + 1) {\n f[s] = inf;\n auto test = [&] (int x, int d) {\n int len = 1 + 1 + (x >= 10) + d, tmp = x;\n int total = 64 / x;\n REP(i, d) total += 64 / (tmp *= 2);\n if (total > s) return;\n if (len + f[s - total] < f[s]) {\n f[s] = len + f[s - total];\n nx[s] = x, nr[s] = d, ns[s] = s - total;\n }\n };\n\n FOR(i, 1, 7) test(1, 7-i);\n REP(i, 7) test(16, 6-i);\n test(1, 0);\n for (int x: {2, 32, 4, 64, 8}) REP(i, 7) test(x, 6-i);\n }\n \n while (sum > 0) {\n putchar('R');\n printf(\"%d\", nx[sum]);\n REP(i, nr[sum]) putchar('.');\n sum = ns[sum];\n }\n putchar('\\n');\n }\n return 0;\n}","accuracy":1,"time_ms":2750,"memory_kb":53288,"score_of_the_acc":-2,"final_rank":8},{"submission_id":"aoj_2052_630129","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};\nconst int MAX_N = 5000000;\ntypedef pair<int, int> P;\nint trans(int n){\n return 64 / n;\n}\nint trans(string s){\n int base = 0;\n REP(i, s.size()) if(isdigit(s[i])) base = base * 10 + s[i] - '0';\n int all = trans(base);\n int cur = all;\n REP(i, s.size()) if(s[i] == '.'){\n cur /= 2;\n all += cur;\n }\n return all;\n}\n\nint main(){\n int T;\n cin >> T;\n static int dp[MAX_N];\n int val[7] = {64, 32, 16, 8, 4, 2, 1};\n int len[7] = {2, 2, 2, 2, 3, 3, 3};\n string expr[7] = {\"R1\", \"R2\", \"R4\", \"R8\", \"R16\", \"R32\", \"R64\"};\n vector<P> tool;\n vector<string> tool_expr;\n REP(i, 7){\n int sum = 0;\n int length = 0;\n string expression = \"\";\n for(int j = i; j < 7; j++){\n expression += (j == i) ? expr[i] : \".\";\n sum += val[j];\n length += (j == i) ? len[j] : 1;\n tool.push_back(make_pair(sum, length));\n tool_expr.push_back(expression);\n }\n }\n REP(i, MAX_N) dp[i] = INF;\n dp[0] = 0;\n REP(i, MAX_N){\n REP(j, tool.size()){\n int s = tool[j].first, l = tool[j].second;\n if(i + s < MAX_N) dp[i + s] = min(dp[i + s], dp[i] + l);\n }\n }\n while(T--){\n string s; cin >> s;\n REP(i, s.size()) if(s[i] == 'R') s[i] = ' ';\n stringstream ss(s);\n int seq = 0;\n int all = 0;\n while(ss >> s){\n all += trans(s);\n }\n int cur = all;\n string ans;\n while(cur > 0){\n string next = \"ZZZZZZZZZ\";\n int next_c = cur;\n REP(i, tool.size()){\n int s = tool[i].first, l = tool[i].second;\n if(cur - s >= 0 && dp[cur - s] + l == dp[cur] && next + \"RRRRRRRRR\" > tool_expr[i] + \"RRRRRRRR\"){\n next = tool_expr[i];\n next_c = cur - s;\n }\n }\n ans += next;\n cur = next_c;\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":440,"memory_kb":21108,"score_of_the_acc":-0.5226,"final_rank":5},{"submission_id":"aoj_2052_470732","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\nmap<string, int> rest;\n\nint getRest(const string& s)\n{\n int n = s.size();\n int i = 0;\n int t = 0;\n while(i < n){\n int j = i+1;\n while(j < n && s[j] != 'R')\n ++ j;\n t += rest[s.substr(i, j-i)];\n i = j;\n }\n return t;\n}\n\nint main()\n{\n for(int i=1; i<=64; i*=2){\n int len = 64 / i;\n string s = \"R\";\n if(i >= 10)\n s += i / 10 + '0';\n s += i % 10 + '0';\n rest[s] = len;\n\n for(int j=i*2; j<=64; j*=2){\n len += 64 / j;\n s += '.';\n rest[s] = len;\n }\n }\n\n vector<string> dp(2001, \"\");\n for(int i=0; i<=2000; ++i){\n for(map<string, int>::iterator it=rest.begin(); it!=rest.end(); ++it){\n int j = i + it->second;\n if(j > 2000)\n continue;\n\n string s = dp[i] + it->first;\n if(dp[j] == \"\" || s.size() < dp[j].size() || (s.size() == dp[j].size() && s < dp[j]))\n dp[j] = s;\n }\n }\n\n int d;\n cin >> d;\n\n while(--d >= 0){\n string s;\n cin >> s;\n\n int t = getRest(s);\n if(t <= 2000){\n cout << dp[t] << endl;\n continue;\n }\n\n string ret = dp[1952+t%32].substr(0, 20);\n while(ret[ret.size()-1] != 'R')\n ret = ret.substr(0, ret.size()-1);\n ret = ret.substr(0, ret.size()-1);\n\n t -= getRest(ret);\n while(t > 2000){\n ret += \"R1.\";\n t -= 64 + 32;\n }\n ret += dp[t];\n cout << ret << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1800,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2052_361570","code_snippet":"// Problem E : Optimal Rest\n\n#include <iostream>\n#include <string>\n#include <sstream>\n\nusing namespace std;\n\nint main(){\n\t// x\\»ðÅãÉRðÁ¦½êÌ«ÅSÊèðÀ×½àÌ\n\tstring str[] = {\"R1......\", \"R1.....\", \"R1....\", \"R1...\", \"R1..\", \"R1.\", \"R16..\", \"R16.\", \"R16\", \"R1\", \n\t\t\t\t \"R2.....\" , \"R2....\" , \"R2...\", \"R2..\", \"R2.\", \"R2\", \"R32.\", \"R32\",\n\t\t\t \t\"R4....\", \"R4...\", \"R4..\", \"R4.\", \"R4\", \"R64\", \"R8...\", \"R8..\", \"R8.\", \"R8\" };\n\t// ãÌÅx\\»Ì·³ð«ºµ½àÌ\n\tint back[] = {127, 126, 124, 120, 112, 96, 7, 6, 4, 64, 63, 62, 60, 56, 48, 32, 3, 2, 31, 30, 28, 24, 16, 1, 15, 14, 12, 8};\n\tstatic int len[3200001]; len[0] = 0;\n\tfor(int i=1;i<=3200000;i++){\n\t\tlen[i] = len[i-1]+3;\n\t\tfor(int j=0;j<28;j++){\n\t\t\tif(i-back[j] < 0) continue;\n\t\t\tlen[i] = min(len[i], len[i-back[j]] + (int)str[j].size());\n\t\t}\n\t}\n\tint test; cin >> test;\n\tstring s;\n\twhile(test--){\n\t\tcin >> s;\n\t\t// üͶñª\\»·éxÌ·³ð²×é\n\t\tfor(int i=0;i<s.size();i++) if(s[i]=='R') s[i] = ' ';\n\t\tistringstream iss(s);\n\t\tstring tmp;\n\t\tint lest = 0;\n\t\twhile(iss >> tmp){\n\t\t\ttmp = \"R\"+tmp;\n\t\t\tfor(int i=0;i<28;i++)\n\t\t\t\tif(tmp == str[i]) lest += back[i];\n\t\t}\n\t\twhile(lest > 0){\n\t\t\tfor(int i=0;i<28;i++){\n\t\t\t\tif(lest-back[i] < 0) continue;\n\t\t\t\tif(len[lest] == len[lest-back[i]] + str[i].size()){\n\t\t\t\t\tcout << str[i];\n\t\t\t\t\tlest -= back[i];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\t}\n}","accuracy":1,"time_ms":460,"memory_kb":13000,"score_of_the_acc":-0.3725,"final_rank":3},{"submission_id":"aoj_2052_147720","code_snippet":"#include<iostream>\n#include<algorithm>\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)\n#define pb push_back\n#define mp make_pair\n#define ALL(C) (C).begin(),(C).end()\n#define fi first\n#define se second\n\ntypedef pair<int,string> pis;\n\nconst int val[]={ 64, 32, 16, 8, 4, 2, 1};\nconst string str[]={\"R1\",\"R2\",\"R4\",\"R8\",\"R16\",\"R32\",\"R64\"};\n\nclass st{\npublic:\n int sc;\n string s;\n bool operator<(const st & a)const{\n if (s.size() != a.s.size())return s.size() < a.s.size();\n return s < a.s;\n }\n};\n\nvector<st> all;\nvoid make(){\n rep(i,7){\n int now =val[i];\n string snow=str[i];\n all.pb((st){now,snow});\n REP(j,i+1,7){\n now+=val[j];\n snow+=\".\";\n all.pb((st){now,snow});\n }\n }\n sort(ALL(all));\n //rep(i,all.size())printf(\"%4d %s\\n\",all[i].sc,all[i].s.c_str());\n}\n\nconst int N = 6400010;\nint dp[N];\nint path[N];\n\nint encode(string &in){\n int sum=0;\n int p=0;\n while(p < in.size()){\n p++;//in[p]='R';\n int now=0;\n while(p < in.size() && isdigit(in[p]))now=now*10+(in[p++]-'0');\n now = 64/now;\n sum+=now;\n while(p < in.size() && in[p] == '.')p++,sum+=now/2,now/=2;\n }\n return sum;\n}\n\nbool cmpstr(string &a,string &b){\n int len=min(a.size(),b.size());\n rep(i,len){\n if (a[i] != b[i])return a[i] < b[i];\n }\n return a.size() > b.size();\n}\n\nvoid solve(int tar){\n rep(i,tar+1)dp[i]=N*10,path[i]=-1;\n dp[0]=0;\n rep(i,tar+1){\n rep(j,all.size()){\n if (i-all[j].sc >= 0 && \n\t (all[j].s.size()+dp[i-all[j].sc] < dp[i] ||\n\t (all[j].s.size()+dp[i-all[j].sc]==dp[i]&& \n\t cmpstr(all[j].s,all[path[i]].s)))){\n\tdp[i]=all[j].s.size()+dp[i-all[j].sc];\n\tpath[i]=j;\n }\n }\n }\n while(path[tar] != -1){\n cout << all[path[tar]].s;\n tar=tar-all[path[tar]].sc;\n }\n cout << endl;\n}\n\nmain(){\n make();\n int te;\n cin>>te;\n while(te--){\n string in;\n cin>>in;\n solve(encode(in));\n }\n return false;\n}","accuracy":1,"time_ms":1220,"memory_kb":25000,"score_of_the_acc":-0.886,"final_rank":7}],"string":"[\n {\n \"submission_id\": \"aoj_2052_10233879\",\n \"code_snippet\": \"// AOJ #2052 Optimal Rest\\n// 2025.2.20\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nconst int INF = 1e9;\\n\\nstruct Coin {\\n string s;\\n int cost;\\n int value;\\n};\\n \\nint main() {\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n \\n int N;\\n cin >> N;\\n cin.ignore();\\n \\n vector<string> bases = {\\\"1\\\",\\\"2\\\",\\\"4\\\",\\\"8\\\",\\\"16\\\",\\\"32\\\",\\\"64\\\"};\\n vector<Coin> coins;\\n for(auto &b : bases){\\n int baseVal = stoi(b);\\n int baseLength = 64 / baseVal;\\n int mmax = 0;\\n while((1 << mmax) * baseVal <= 64) mmax++;\\n mmax--;\\n {\\n Coin c;\\n c.s = \\\"R\\\" + b;\\n c.cost = (int)c.s.size();\\n c.value = baseLength;\\n coins.push_back(c);\\n }\\n for(int m=1; m<=mmax; m++){\\n Coin c;\\n c.s = \\\"R\\\" + b + string(m, '.');\\n c.cost = (int)c.s.size();\\n double factor = 2 - 1.0 / (1 << m);\\n int add = 64 / (1 << m);\\n c.value = (128 - add) / baseVal;\\n coins.push_back(c);\\n }\\n }\\n \\n\\n for(int cs=0; cs<N; cs++){\\n string line;\\n getline(cin, line);\\n \\n int T = 0;\\n for (int i = 0; i < (int)line.size(); ){\\n if(line[i]=='R'){\\n i++;\\n string num;\\n while(i < (int)line.size() && isdigit(line[i])){\\n num.push_back(line[i]);\\n i++;\\n }\\n int baseVal = stoi(num);\\n int baseLength = 64 / baseVal;\\n int m = 0;\\n while(i < (int)line.size() && line[i]=='.') m++, i++;\\n\\n if(m==0) T += baseLength;\\n else {\\n int add = 64 / (1 << m);\\n int len = (128 - add) / baseVal;\\n T += len;\\n }\\n } else i++;\\n }\\n \\n vector<int> dp(T+1, INF);\\n vector<int> prev(T+1, -1);\\n vector<int> pick(T+1, -1);\\n dp[0] = 0;\\n for (int t = 0; t <= T; t++){\\n if(dp[t] == INF) continue;\\n for (int i = 0; i < (int)coins.size(); i++){\\n int nt = t + coins[i].value;\\n if(nt > T) continue;\\n int nc = dp[t] + coins[i].cost;\\n if(nc < dp[nt]){\\n dp[nt] = nc;\\n prev[nt] = t;\\n pick[nt] = i;\\n }\\n }\\n }\\n \\n vector<string> solCoins;\\n for (int t = T; t > 0; ){\\n int i = pick[t];\\n solCoins.push_back(coins[i].s);\\n t = prev[t];\\n }\\n \\n auto cmp = [&](const string &a, const string &b){\\n return a + b < b + a;\\n };\\n sort(solCoins.begin(), solCoins.end(), cmp);\\n \\n string ans;\\n for(auto &s : solCoins) ans += s;\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 42860,\n \"score_of_the_acc\": -0.8454,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2052_9637730\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define y second\\n#define x first\\n\\nusing namespace std;\\nusing namespace std::chrono;\\nusing psi = pair<string, int>;\\n\\nconst int NN = 101010, MM = 32 * NN;\\n\\nchar s[NN];\\n\\nint dp[MM];\\n\\nint main() {\\n int t; scanf(\\\"%d\\\", &t);\\n vector<psi> vec;\\n for(int i = 1; i <= 64; i *= 2) {\\n string s = \\\"R\\\" + to_string(i);\\n int val = 64 / i, x = val;\\n for(int j = 0; x; j++) {\\n vec.push_back({s, val});\\n s += '.';\\n x /= 2, val += x;\\n }\\n }\\n\\n for(int i = 1; i < MM; i++) {\\n dp[i] = 1e9;\\n for(psi p: vec) if(i >= p.y) {\\n dp[i] = min(dp[i], dp[i - p.y] + (int)p.x.size());\\n }\\n }\\n\\n while(t--) {\\n scanf(\\\"%s\\\", s);\\n int all = 0, val = 0;\\n for(int i = 0, x = 0; s[i]; i++) {\\n if(s[i] == 'R') all += val, x = 0;\\n else if(isdigit(s[i])) {\\n x = 10 * x + s[i] - '0';\\n if(!isdigit(s[i + 1])) x = 64 / x, val = x;\\n }\\n else x /= 2, val += x;\\n }\\n all += val;\\n\\n string ans;\\n while(all) {\\n psi mn = {\\\"R\\\", all};\\n for(psi p: vec) if(all >= p.y && dp[all - p.y] + p.x.size() == dp[all]) {\\n if(p.x + \\\"R\\\" < mn.x + \\\"R\\\") mn = p;\\n }\\n ans += mn.x;\\n all -= mn.y;\\n }\\n printf(\\\"%s\\\\n\\\", ans.c_str());\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 510,\n \"memory_kb\": 16336,\n \"score_of_the_acc\": -0.4557,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2052_2859466\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\n\\n/* 幾何の基本 */\\n\\n#include <complex>\\n\\ntypedef complex<ld> Point;\\n\\n\\nconst ld pi = acos(-1.0);\\nconst ld dtop = pi / 180.;\\nconst ld ptod = 1. / dtop;\\n\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() > rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\n// 点の入力\\nPoint input_Point() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn Point(x, y);\\n}\\n\\n// 誤差つき等号判定\\nbool eq(const ld a, const ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\n// 内積\\nld dot(const Point& a, const Point& b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\n// 外積\\nld cross(const Point& a, const Point& b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\n// 直線の定義\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\tPoint operator[](const int _num)const {\\n\\t\\tif (_num == 0)return a;\\n\\t\\telse if (_num == 1)return b;\\n\\t\\telse {\\n\\t\\t\\tassert(false);\\n\\t\\t\\treturn Point();\\n\\t\\t}\\n\\t}\\n};\\n\\n// 円の定義\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n\\tCircle() : p(Point(0, 0)), r(0) {}\\n\\tCircle(Point p, ld r) : p(p), r(r) {}\\n};\\n\\n// ccw\\n// 1: a,b,cが反時計周りの順に並ぶ\\n//-1: a,b,cが時計周りの順に並ぶ\\n// 2: c,a,bの順に直線に並ぶ\\n//-2: a,b,cの順に直線に並ぶ\\n// 0: a,c,bの順に直線に並ぶ\\nint ccw(const Point& a, const Point &b, const Point &c) {\\n\\tconst Point nb(b - a);\\n\\tconst Point nc(c - a);\\n\\tif (cross(nb, nc) > eps) return 1; // a,b,cが反時計周りの順に並ぶ\\n\\tif (cross(nb, nc) < -eps) return -1; // a,b,cが時計周りの順に並ぶ\\n\\tif (dot(nb, nc) < 0) return 2; // c,a,bの順に直線に並ぶ\\n\\tif (norm(nb) < norm(nc)) return -2; // a,b,cの順に直線に並ぶ\\n\\treturn 0; // a,c,bの順に直線に並ぶ\\n}\\n\\n\\n/* 交差判定 */\\n\\n// 直線と直線の交差判定\\nbool isis_ll(const Line& l, const Line& m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n\\n// 直線と線分の交差判定\\nbool isis_ls(const Line& l, const Line& s) {\\n\\treturn isis_ll(l, s) &&\\n\\t\\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// 線分と線分の交差判定\\nbool isis_ss(const Line& s, const Line& t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n\\t\\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// 点の直線上判定\\nbool isis_lp(const Line& l, const Point& p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n\\n// 点の線分上判定\\nbool isis_sp(const Line& s, const Point& p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\n// 垂線の足\\nPoint proj(const Line &l, const Point& p) {\\n\\tld t = dot(p - l.a, l.b - l.a) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.b - l.a);\\n}\\n\\n//線対象の位置にある点\\nPoint reflect(const Line &l, const Point &p) {\\n\\tPoint pr = proj(l, p);\\n\\treturn pr * 2.l - p;\\n}\\n\\n// 直線と直線の交点\\nPoint is_ll(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tassert(cross(sv, tv) != 0);\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n// 直線と直線の交点\\nvector<Point> is_ll2(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\\n\\telse {\\n\\t\\tvector<Point>ans;\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\\n\\t\\t\\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n// 線分と線分の交点\\n// 重なってる部分あるとassert(false)\\nPoint is_ss(const Line &s, const Line& t) {\\n\\tif (isis_ss(s, t)) {\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tfor (int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\tif (s[k] == t[l])return s[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn is_ll(s, t);\\n\\t}\\n\\telse {\\n\\t\\t//先にisis_ssしてね\\n\\t\\tassert(false);\\n\\t\\treturn Point(0, 0);\\n\\t}\\n}\\n// 線分と線分の交点\\nvector<Point> is_ss2(const Line &s, const Line& t) {\\n\\tvector<Point> kouho(is_ll2(s, t));\\n\\tvector<Point>ans;\\n\\tfor (auto p : kouho) {\\n\\t\\tif (isis_sp(s, p) && isis_sp(t, p))ans.emplace_back(p);\\n\\t}\\n\\treturn ans;\\n}\\n// 直線と点の距離\\nld dist_lp(const Line& l, const Point& p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\n//直線と直線の距離\\nld dist_ll(const Line& l, const Line& m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\n// 直線と線分の距離\\nld dist_ls(const Line& l, const Line& s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\n// 線分と点の距離\\nld dist_sp(const Line& s, const Point& p) {\\n\\tPoint r = proj(s, p);\\n\\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// 線分と線分の距離\\nld dist_ss(const Line& s, const Line& t) {\\n\\tif (isis_ss(s, t)) return 0;\\n\\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\\n}\\n\\n\\n//直線と直線の二等分線のベクトル\\nLine line_bisection(const Line &s, const Line &t) {\\n\\tconst Point laglanju(is_ll(s, t));\\n\\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\\n\\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\\n\\n\\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\\n}\\n//点と点の垂直二等分線 aを左に見ながら\\nLine point_bisection(const Point&a, const Point&b) {\\n\\tconst Point cen((a + b) / 2.l);\\n\\tconst Point vec = (b - a)*Point(0, 1);\\n\\treturn Line(cen, cen + vec);\\n}\\n\\n//三つの点からなる外心\\nPoint outer_center(const vector<Point>&ps) {\\n\\tassert(ps.size() == 3);\\n\\tLine l1 = point_bisection(ps[0], ps[1]);\\n\\tLine l2 = point_bisection(ps[1], ps[2]);\\n\\treturn is_ll(l1, l2);\\n}\\n\\n\\n//三つの直線からなる内心\\n//三つの直線が並行でないことは確かめといてね\\nPoint inner_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\\n\\tLine bi1(line_bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\\n\\tLine bi2(line_bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\\n\\tif (bi1[0] == bi2[0])return bi1[0];\\n\\telse {\\n\\t\\treturn is_ll(bi1, bi2);\\n\\t}\\n}\\n\\n//三つの直線からなる傍心\\n//三つの直線が並行でないことは確かめといてね\\nvector<Point> ex_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\\n\\tvector<Point>ecs;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tLine bi1(line_bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\\n\\t\\tLine bi2(line_bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\\n\\t\\tecs.push_back(is_ll(bi1, bi2));\\n\\t}\\n\\treturn ecs;\\n}\\n\\n\\n//a,b:並行\\n//c:並行でない\\n//三つの直線から同距離の位置を求める。\\nvector<Point> same_dis(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tvertics.push_back(is_ll(ls[0], ls[2]));\\n\\tvertics.push_back(is_ll(ls[1], ls[2]));\\n\\n\\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\\n\\tLine bis(line_bisection(ls[0], ls[1]));\\n\\tvector<Point>ecs;\\n\\n\\tLine abi(line_bisection(Line(vertics[0], vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, abi));\\n\\n\\n\\tLine bbi(line_bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, bbi));\\n\\n\\treturn ecs;\\n}\\n/* 円 */\\n\\n// 円と円の交点\\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps) dfr = 0.0;\\n\\telse if (dfr < 0.0) return res; // no intersection\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\n/*\\n点が円の中にいるか\\n0 => out\\n1 => on\\n2 => in*/\\nint is_in_Circle(const Point& p, const Circle &cir) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\nint is_in_Circle(const Circle &cir, const Point& p) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\n/*\\n円lcが円rcの中にいるか\\n0 => out\\n1 => on\\n2 => in*/\\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\\n\\tld dis = abs(lc.p - rc.p);\\n\\tif (dis < rc.r - lc.r - eps)return 2;\\n\\telse if (dis>rc.r - lc.r + eps)return 0;\\n\\telse return 1;\\n}\\n\\n// 円と直線の交点\\nvector<Point> is_lc(const Circle& c, const Line& l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d < c.r + eps) {\\n\\t\\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\\n\\t\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\t\\tres.push_back(proj(l, c.p) + len * nor);\\n\\t\\tres.push_back(proj(l, c.p) - len * nor);\\n\\t}\\n\\treturn res;\\n}\\n\\n// 円と線分の距離\\nvector<Point> is_sc(const Circle& c, const Line& l) {\\n\\tvector<Point> v = is_lc(c, l), res;\\n\\tfor (Point p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\n// 円と点の接線\\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\\n\\tvector<Line> ret;\\n\\tPoint v = c.p - p;\\n\\tld d = abs(v);\\n\\tld l = sqrt(norm(v) - c.r * c.r);\\n\\tif (isnan(l)) { return ret; }\\n\\tPoint v1 = v * Point(l / d, c.r / d);\\n\\tPoint v2 = v * Point(l / d, -c.r / d);\\n\\tret.push_back(Line(p, p + v1));\\n\\tif (l < eps) return ret;\\n\\tret.push_back(Line(p, p + v2));\\n\\treturn ret;\\n}\\n\\n// 円と円の接線\\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Line> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\\n\\t\\tret = tangent_cp(c1, center);\\n\\t}\\n\\tif (abs(c1.r - c2.r) > eps) {\\n\\t\\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<Line> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), nret.begin(), nret.end());\\n\\t}\\n\\telse {\\n\\t\\tPoint v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\\n\\t\\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\\n\\t\\tret.push_back(Line(q1, q1 + v));\\n\\t\\tret.push_back(Line(q2, q2 + v));\\n\\t}\\n\\treturn ret;\\n}\\n//二つの円の重なり面積\\nld two_Circle_area(const Circle&l, const Circle&r) {\\n\\tld dis = abs(l.p - r.p);\\n\\tif (dis > l.r + r.r)return 0;\\n\\telse if (dis + r.r < l.r) {\\n\\t\\treturn r.r*r.r*pi;\\n\\t}\\n\\telse if (dis + l.r < r.r) {\\n\\t\\treturn l.r*l.r*pi;\\n\\t}\\n\\telse {\\n\\t\\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\\n\\t\\t\\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\\n\\t\\t\\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n/* 多角形 */\\n\\ntypedef vector<Point> Polygon;\\n\\n\\n\\n//多角形(複数の点)の最小包含円をO(N=頂点数)で求めるアルゴリズム\\n//同一直線上に三つの点がないこと\\n#include<random>\\nCircle welzl(vector<Point>ps) {\\n\\tstruct solver {\\n\\t\\tCircle solve(vector<Point>&ps, vector<Point>&rs) {\\n\\t\\t\\tif (ps.empty() || rs.size() == 3) {\\n\\t\\t\\t\\tif (rs.size() == 1) {\\n\\t\\t\\t\\t\\treturn Circle(Point(rs[0]), 0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (rs.size() == 2) {\\n\\t\\t\\t\\t\\treturn Circle((rs[0] + rs[1]) / 2.0l, abs(rs[1] - rs[0]) / 2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (rs.size() == 3) {\\n\\t\\t\\t\\t\\tvector<Line> ls(3);\\n\\t\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\t\\tls[i] = Line(rs[i], rs[(i + 1) % 3]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tPoint center = outer_center(rs);\\n\\t\\t\\t\\t\\treturn Circle(center, abs(center - rs[0]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\treturn Circle(Point(), 0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\n\\t\\t\\t\\tPoint p_ba = ps.back();\\n\\t\\t\\t\\tps.pop_back();\\n\\t\\t\\t\\tCircle d = solve(ps, rs);\\n\\t\\t\\t\\tps.push_back(p_ba);\\n\\t\\t\\t\\tif (is_in_Circle(d, p_ba)) {\\n\\t\\t\\t\\t\\treturn d;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\trs.push_back(p_ba);\\n\\t\\t\\t\\t\\tps.pop_back();\\n\\t\\t\\t\\t\\tauto ans = solve(ps, rs);\\n\\t\\t\\t\\t\\tps.push_back(p_ba);\\n\\t\\t\\t\\t\\trs.pop_back();\\n\\t\\t\\t\\t\\treturn ans;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}so;\\n\\tstd::random_device rd;\\n\\tstd::mt19937 mt(rd());\\n\\tshuffle(ps.begin(), ps.end(), mt);\\n\\tvector<Point>rs;\\n\\tCircle ans = so.solve(ps, rs);\\n\\treturn ans;\\n}\\n// 面積\\nld get_area(const Polygon &p) {\\n\\tld res = 0;\\n\\tint n = p.size();\\n\\tfor (int j = 0; j<n; ++j) res += cross(p[j], p[(j + 1) % n]);\\n\\treturn res / 2;\\n}\\n\\n//多角形の回転方向\\nbool is_counter_clockwise(const Polygon &poly) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\\n\\t\\tangle += arg((c - b) / (b - a));\\n\\t}\\n\\treturn angle > eps;\\n}\\n\\n// 円の内外判定\\n/*0 => out\\n1 => on\\n2 => in*/\\nint is_in_Polygon(const Polygon &poly, const Point& p) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n];\\n\\t\\tif (isis_sp(Line(a, b), p)) return 1;\\n\\t\\tangle += arg((b - p) / (a - p));\\n\\t}\\n\\treturn eq(angle, 0) ? 0 : 2;\\n}\\n//円の内外判定2 高速\\nenum { out, on, in };\\nint convex_contains(const Polygon &P, const Point &p) {\\n\\tconst int n = P.size();\\n\\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\\n\\tint a = 0, b = n;\\n\\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\\n\\t\\tint c = (a + b) / 2;\\n\\t\\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\\n\\t\\t\\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\\n\\t\\t\\telse a = c;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\\n\\t\\t\\telse b = c;\\n\\t\\t}\\n\\t}\\n\\tb %= n;\\n\\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\\n\\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\\n\\treturn 1;\\n}\\n\\n// 凸包\\n//点や線を返すことも有り得るので注意\\nPolygon convex_hull(vector<Point> ps) {\\n\\tint n = ps.size();\\n\\tint k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tPolygon ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++])\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n\\n\\n//凸カット\\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\\n\\tint n = ps.size();\\n\\tPolygon q;\\n\\tPolygon r;\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = ps[i], b = ps[(i + 1) % n];\\n\\t\\tLine m = Line(a, b);\\n\\t\\tif (ccw(l.a, l.b, a) != -1) q.push_back(a);\\n\\t\\tif (ccw(l.a, l.b, a) != 1) r.push_back(a);\\n\\t\\tif (ccw(l.a, l.b, a) * ccw(l.a, l.b, b) < 0 && isis_ll(l, m)) {\\n\\t\\t\\tq.push_back(is_ll(l, m));\\n\\t\\t\\tr.push_back(is_ll(l, m));\\n\\t\\t}\\n\\t}\\n\\tconst vector<Polygon>polys{ q,r };\\n\\treturn polys;\\n}\\n\\nPolygon cen(Polygon po) {\\n\\tPoint cen;\\n\\tfor (auto p : po) {\\n\\t\\tcen += p;\\n\\t}\\n\\tcen /= po.size();\\n\\tfor (auto&p : po) {\\n\\t\\tp -= cen;\\n\\t}\\n\\treturn po;\\n}\\n\\nint get_id(string st,int& a) {\\n\\tassert(st[a]=='R');\\n\\ta++;\\n\\tint num=0;\\n\\twhile (a != st.size() && st[a] != 'R'&&st[a]!='.') {\\n\\t\\tnum*=10;\\n\\t\\tnum+=st[a]-'0';\\n\\t\\ta++;\\n\\t}\\n\\tnum=64/num;\\n\\tint k=num;\\n\\twhile (a != st.size() && st[a] != 'R') {\\n\\t\\tassert(st[a]=='.');\\n\\t\\tk/=2;\\n\\t\\tnum+=k;\\n\\t\\ta++;\\n\\t}\\n\\treturn num;\\n}\\n\\nint get_num(string st) {\\n\\tint sum=0;\\n\\tint a=0;\\n\\twhile (a != st.size()) {\\n\\t\\tsum+=get_id(st,a);\\n\\t}\\n\\treturn sum;\\n}\\n\\nint main() {\\n\\tvector<string>dp(5000);\\n\\tdp[0]=\\\"\\\";\\n\\tmap<string,int>mp;\\n\\tfor (int k = 1; k <= 64; k *= 2) {\\n\\t\\tint num=64/k;\\n\\t\\tstring st=\\\"R\\\"+to_string(k);\\n\\t\\tmp[st]=num;\\n\\t\\tfor (int plus = k * 2; plus!=128; plus *= 2) {\\n\\t\\t\\tnum+=64/plus;\\n\\t\\t\\tst+='.';\\n\\t\\t\\tmp[st]=num;\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < 3000; ++i) {\\n\\t\\tfor (auto&& m : mp) {\\n\\t\\t\\tint j=i+m.second;\\n\\t\\t\\tstring st=dp[i]+m.first;\\n\\t\\t\\tif (dp[j] == \\\"\\\" || (dp[j].size() > st.size()) || ((dp[j].size() == st.size() && dp[j] > st))) {\\n\\t\\t\\t\\tdp[j] = st;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 1000; i <= 2000; ++i) {\\n\\t\\tint k=dp[i].find(\\\"R1.R1.\\\");\\n\\t\\tassert(k!=-1);\\n\\t}\\n\\tint N;cin>>N;\\n\\twhile (N--){\\n\\t\\tstring st;cin>>st;\\n\\t\\tint n=get_num(st);\\n\\n\\t\\tif (n < 3000) {\\n\\t\\t\\tcout<<dp[n]<<endl;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint x=n%384;\\n\\t\\t\\tint t=x+1920;\\n\\n\\t\\t\\tint sa=n-t;\\n\\t\\t\\tint need=sa/384;\\n\\n\\t\\t\\tint place=dp[t].find(\\\"R1.R1.R1.R1.\\\");\\n\\t\\t\\tstring ans=dp[t];\\n\\t\\t\\tstring plus;\\n\\t\\t\\tfor (int k = 0; k < need; ++k) {\\n\\t\\t\\t\\tplus+=\\\"R1.R1.R1.R1.\\\";\\n\\t\\t\\t}\\n\\t\\t\\tans.insert(ans.begin()+place,plus.begin(),plus.end());\\n\\t\\t\\tcout<<ans<<endl;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 780,\n \"memory_kb\": 3916,\n \"score_of_the_acc\": -0.3142,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2052_1679577\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cassert>\\n#include <cstring>\\n#include <iostream>\\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 TRACE(x) cout << #x << \\\" = \\\" << x << endl\\n#define _ << \\\" _ \\\" <<\\n\\ntypedef long long llint;\\n\\nconst int MAX = 64*100100;\\nconst int inf = 1e9;\\n\\nchar s[MAX];\\nint f[MAX];\\nint nx[MAX], nr[MAX], ns[MAX];\\n\\n\\nint main(void) {\\n int t;\\n scanf(\\\"%d\\\", &t);\\n while (t--) {\\n scanf(\\\"%s\\\", s);\\n int len = strlen(s);\\n int i = 0;\\n int last = 0;\\n int sum = 0;\\n while (i < len) {\\n if (s[i] == '.') {\\n last /= 2;\\n i++;\\n } else {\\n assert(s[i] == 'R');\\n i++;\\n int x = 0;\\n while (i < len && isdigit(s[i])) x = x*10 + s[i++] - '0';\\n last = 64 / x;\\n }\\n sum += last;\\n }\\n\\n f[0] = 0;\\n nx[0] = -1;\\n FOR(s, 1, sum + 1) {\\n f[s] = inf;\\n auto test = [&] (int x, int d) {\\n int len = 1 + 1 + (x >= 10) + d, tmp = x;\\n int total = 64 / x;\\n REP(i, d) total += 64 / (tmp *= 2);\\n if (total > s) return;\\n if (len + f[s - total] < f[s]) {\\n f[s] = len + f[s - total];\\n nx[s] = x, nr[s] = d, ns[s] = s - total;\\n }\\n };\\n\\n FOR(i, 1, 7) test(1, 7-i);\\n REP(i, 7) test(16, 6-i);\\n test(1, 0);\\n for (int x: {2, 32, 4, 64, 8}) REP(i, 7) test(x, 6-i);\\n }\\n \\n while (sum > 0) {\\n putchar('R');\\n printf(\\\"%d\\\", nx[sum]);\\n REP(i, nr[sum]) putchar('.');\\n sum = ns[sum];\\n }\\n putchar('\\\\n');\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2750,\n \"memory_kb\": 53288,\n \"score_of_the_acc\": -2,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2052_630129\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\\\" \\\"; cerr<<endl; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\nconst int MAX_N = 5000000;\\ntypedef pair<int, int> P;\\nint trans(int n){\\n return 64 / n;\\n}\\nint trans(string s){\\n int base = 0;\\n REP(i, s.size()) if(isdigit(s[i])) base = base * 10 + s[i] - '0';\\n int all = trans(base);\\n int cur = all;\\n REP(i, s.size()) if(s[i] == '.'){\\n cur /= 2;\\n all += cur;\\n }\\n return all;\\n}\\n\\nint main(){\\n int T;\\n cin >> T;\\n static int dp[MAX_N];\\n int val[7] = {64, 32, 16, 8, 4, 2, 1};\\n int len[7] = {2, 2, 2, 2, 3, 3, 3};\\n string expr[7] = {\\\"R1\\\", \\\"R2\\\", \\\"R4\\\", \\\"R8\\\", \\\"R16\\\", \\\"R32\\\", \\\"R64\\\"};\\n vector<P> tool;\\n vector<string> tool_expr;\\n REP(i, 7){\\n int sum = 0;\\n int length = 0;\\n string expression = \\\"\\\";\\n for(int j = i; j < 7; j++){\\n expression += (j == i) ? expr[i] : \\\".\\\";\\n sum += val[j];\\n length += (j == i) ? len[j] : 1;\\n tool.push_back(make_pair(sum, length));\\n tool_expr.push_back(expression);\\n }\\n }\\n REP(i, MAX_N) dp[i] = INF;\\n dp[0] = 0;\\n REP(i, MAX_N){\\n REP(j, tool.size()){\\n int s = tool[j].first, l = tool[j].second;\\n if(i + s < MAX_N) dp[i + s] = min(dp[i + s], dp[i] + l);\\n }\\n }\\n while(T--){\\n string s; cin >> s;\\n REP(i, s.size()) if(s[i] == 'R') s[i] = ' ';\\n stringstream ss(s);\\n int seq = 0;\\n int all = 0;\\n while(ss >> s){\\n all += trans(s);\\n }\\n int cur = all;\\n string ans;\\n while(cur > 0){\\n string next = \\\"ZZZZZZZZZ\\\";\\n int next_c = cur;\\n REP(i, tool.size()){\\n int s = tool[i].first, l = tool[i].second;\\n if(cur - s >= 0 && dp[cur - s] + l == dp[cur] && next + \\\"RRRRRRRRR\\\" > tool_expr[i] + \\\"RRRRRRRR\\\"){\\n next = tool_expr[i];\\n next_c = cur - s;\\n }\\n }\\n ans += next;\\n cur = next_c;\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 440,\n \"memory_kb\": 21108,\n \"score_of_the_acc\": -0.5226,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2052_470732\",\n \"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\\nmap<string, int> rest;\\n\\nint getRest(const string& s)\\n{\\n int n = s.size();\\n int i = 0;\\n int t = 0;\\n while(i < n){\\n int j = i+1;\\n while(j < n && s[j] != 'R')\\n ++ j;\\n t += rest[s.substr(i, j-i)];\\n i = j;\\n }\\n return t;\\n}\\n\\nint main()\\n{\\n for(int i=1; i<=64; i*=2){\\n int len = 64 / i;\\n string s = \\\"R\\\";\\n if(i >= 10)\\n s += i / 10 + '0';\\n s += i % 10 + '0';\\n rest[s] = len;\\n\\n for(int j=i*2; j<=64; j*=2){\\n len += 64 / j;\\n s += '.';\\n rest[s] = len;\\n }\\n }\\n\\n vector<string> dp(2001, \\\"\\\");\\n for(int i=0; i<=2000; ++i){\\n for(map<string, int>::iterator it=rest.begin(); it!=rest.end(); ++it){\\n int j = i + it->second;\\n if(j > 2000)\\n continue;\\n\\n string s = dp[i] + it->first;\\n if(dp[j] == \\\"\\\" || s.size() < dp[j].size() || (s.size() == dp[j].size() && s < dp[j]))\\n dp[j] = s;\\n }\\n }\\n\\n int d;\\n cin >> d;\\n\\n while(--d >= 0){\\n string s;\\n cin >> s;\\n\\n int t = getRest(s);\\n if(t <= 2000){\\n cout << dp[t] << endl;\\n continue;\\n }\\n\\n string ret = dp[1952+t%32].substr(0, 20);\\n while(ret[ret.size()-1] != 'R')\\n ret = ret.substr(0, ret.size()-1);\\n ret = ret.substr(0, ret.size()-1);\\n\\n t -= getRest(ret);\\n while(t > 2000){\\n ret += \\\"R1.\\\";\\n t -= 64 + 32;\\n }\\n ret += dp[t];\\n cout << ret << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1800,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2052_361570\",\n \"code_snippet\": \"// Problem E : Optimal Rest\\n\\n#include <iostream>\\n#include <string>\\n#include <sstream>\\n\\nusing namespace std;\\n\\nint main(){\\n\\t// x\\\\»ðÅãÉRðÁ¦½êÌ«ÅSÊèðÀ×½àÌ\\n\\tstring str[] = {\\\"R1......\\\", \\\"R1.....\\\", \\\"R1....\\\", \\\"R1...\\\", \\\"R1..\\\", \\\"R1.\\\", \\\"R16..\\\", \\\"R16.\\\", \\\"R16\\\", \\\"R1\\\", \\n\\t\\t\\t\\t \\\"R2.....\\\" , \\\"R2....\\\" , \\\"R2...\\\", \\\"R2..\\\", \\\"R2.\\\", \\\"R2\\\", \\\"R32.\\\", \\\"R32\\\",\\n\\t\\t\\t \\t\\\"R4....\\\", \\\"R4...\\\", \\\"R4..\\\", \\\"R4.\\\", \\\"R4\\\", \\\"R64\\\", \\\"R8...\\\", \\\"R8..\\\", \\\"R8.\\\", \\\"R8\\\" };\\n\\t// ãÌÅx\\\\»Ì·³ð«ºµ½àÌ\\n\\tint back[] = {127, 126, 124, 120, 112, 96, 7, 6, 4, 64, 63, 62, 60, 56, 48, 32, 3, 2, 31, 30, 28, 24, 16, 1, 15, 14, 12, 8};\\n\\tstatic int len[3200001]; len[0] = 0;\\n\\tfor(int i=1;i<=3200000;i++){\\n\\t\\tlen[i] = len[i-1]+3;\\n\\t\\tfor(int j=0;j<28;j++){\\n\\t\\t\\tif(i-back[j] < 0) continue;\\n\\t\\t\\tlen[i] = min(len[i], len[i-back[j]] + (int)str[j].size());\\n\\t\\t}\\n\\t}\\n\\tint test; cin >> test;\\n\\tstring s;\\n\\twhile(test--){\\n\\t\\tcin >> s;\\n\\t\\t// üͶñª\\\\»·éxÌ·³ð²×é\\n\\t\\tfor(int i=0;i<s.size();i++) if(s[i]=='R') s[i] = ' ';\\n\\t\\tistringstream iss(s);\\n\\t\\tstring tmp;\\n\\t\\tint lest = 0;\\n\\t\\twhile(iss >> tmp){\\n\\t\\t\\ttmp = \\\"R\\\"+tmp;\\n\\t\\t\\tfor(int i=0;i<28;i++)\\n\\t\\t\\t\\tif(tmp == str[i]) lest += back[i];\\n\\t\\t}\\n\\t\\twhile(lest > 0){\\n\\t\\t\\tfor(int i=0;i<28;i++){\\n\\t\\t\\t\\tif(lest-back[i] < 0) continue;\\n\\t\\t\\t\\tif(len[lest] == len[lest-back[i]] + str[i].size()){\\n\\t\\t\\t\\t\\tcout << str[i];\\n\\t\\t\\t\\t\\tlest -= back[i];\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 13000,\n \"score_of_the_acc\": -0.3725,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2052_147720\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\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)\\n#define pb push_back\\n#define mp make_pair\\n#define ALL(C) (C).begin(),(C).end()\\n#define fi first\\n#define se second\\n\\ntypedef pair<int,string> pis;\\n\\nconst int val[]={ 64, 32, 16, 8, 4, 2, 1};\\nconst string str[]={\\\"R1\\\",\\\"R2\\\",\\\"R4\\\",\\\"R8\\\",\\\"R16\\\",\\\"R32\\\",\\\"R64\\\"};\\n\\nclass st{\\npublic:\\n int sc;\\n string s;\\n bool operator<(const st & a)const{\\n if (s.size() != a.s.size())return s.size() < a.s.size();\\n return s < a.s;\\n }\\n};\\n\\nvector<st> all;\\nvoid make(){\\n rep(i,7){\\n int now =val[i];\\n string snow=str[i];\\n all.pb((st){now,snow});\\n REP(j,i+1,7){\\n now+=val[j];\\n snow+=\\\".\\\";\\n all.pb((st){now,snow});\\n }\\n }\\n sort(ALL(all));\\n //rep(i,all.size())printf(\\\"%4d %s\\\\n\\\",all[i].sc,all[i].s.c_str());\\n}\\n\\nconst int N = 6400010;\\nint dp[N];\\nint path[N];\\n\\nint encode(string &in){\\n int sum=0;\\n int p=0;\\n while(p < in.size()){\\n p++;//in[p]='R';\\n int now=0;\\n while(p < in.size() && isdigit(in[p]))now=now*10+(in[p++]-'0');\\n now = 64/now;\\n sum+=now;\\n while(p < in.size() && in[p] == '.')p++,sum+=now/2,now/=2;\\n }\\n return sum;\\n}\\n\\nbool cmpstr(string &a,string &b){\\n int len=min(a.size(),b.size());\\n rep(i,len){\\n if (a[i] != b[i])return a[i] < b[i];\\n }\\n return a.size() > b.size();\\n}\\n\\nvoid solve(int tar){\\n rep(i,tar+1)dp[i]=N*10,path[i]=-1;\\n dp[0]=0;\\n rep(i,tar+1){\\n rep(j,all.size()){\\n if (i-all[j].sc >= 0 && \\n\\t (all[j].s.size()+dp[i-all[j].sc] < dp[i] ||\\n\\t (all[j].s.size()+dp[i-all[j].sc]==dp[i]&& \\n\\t cmpstr(all[j].s,all[path[i]].s)))){\\n\\tdp[i]=all[j].s.size()+dp[i-all[j].sc];\\n\\tpath[i]=j;\\n }\\n }\\n }\\n while(path[tar] != -1){\\n cout << all[path[tar]].s;\\n tar=tar-all[path[tar]].sc;\\n }\\n cout << endl;\\n}\\n\\nmain(){\\n make();\\n int te;\\n cin>>te;\\n while(te--){\\n string in;\\n cin>>in;\\n solve(encode(in));\\n }\\n return false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1220,\n \"memory_kb\": 25000,\n \"score_of_the_acc\": -0.886,\n \"final_rank\": 7\n }\n]","isConversational":false}}},{"rowIdx":1086,"cells":{"group_id":{"kind":"string","value":"aoj_2059_cpp"},"problem_description":{"kind":"string","value":"Problem B:\nRestaurant\nSteve runs a small restaurant in a city. Also, as he is the only cook in his restaurant, he cooks everything\nordered by customers.\nBasically he attends to orders by\nfirst-come-first-served\nprinciple. He takes some prescribed time to\nprepare each dish. As a customer can order more than one dish at a time, Steve starts his cooking with\nthe dish that takes the longest time to prepare. In case that there are two or more dishes that take\nthe same amount of time to prepare, he makes these dishes in the sequence as listed in the menu card\nof his restaurant. Note that he does not care in which order these dishes have been ordered. When he\ncompletes all dishes ordered by a customer, he immediately passes these dishes to the waitress and has\nthem served to the customer. Time for serving is negligible.\nOn the other hand, during his cooking for someone’s order, another customer may come and order dishes.\nFor his efficiency, he decided to prepare together multiple dishes of the same if possible. When he starts\ncooking for new dishes, he looks over the orders accepted by that time (including the order accepted\nexactly at that time if any), and counts the number of the same dishes he is going to cook next. Time\nrequired for cooking is the same no matter how many dishes he prepare at once. Unfortunately, he has\nonly limited capacity in the kitchen, and hence it is sometimes impossible that the requested number of\ndishes are prepared at once. In such cases, he just prepares as many dishes as possible.\nYour task is to write a program that simulates the restaurant. Given a list of dishes in the menu card\nand orders from customers with their accepted times, your program should output a list of times when\neach customer is served.\nInput\nThe input contains multiple data sets. Each data set is in the format below:\nN M\nName\n1\nLimit\n1\nTime\n1\n...\nName\nN\nLimit\nN\nTime\nN\nT\n1\nK\n1\nDish\n1,1\n. . .\nDish\n1,\nK\n1\n...\nT\nM\nK\nM\nDish\nM\n,1\n. . .\nDish\nM\n,\nK\nM\nHere,\nN\n(1 ≤\nN\n≤ 20) and\nM\n(1 ≤\nM\n≤ 100) specify the number of entries in the menu card and the\nnumber of orders that Steve will receive, respectively; each\nName\ni\nis the name of a dish of the\ni\n-th entry\nin the menu card, which consists of up to 20 alphabetical letters;\nLimit\ni\n(1 ≤\nLimit\ni\n≤ 10) is the number of dishes he can prepare at the same time;\nTime\ni\n(1 ≤\nTime\ni\n≤ 1000) is time required to prepare a dish\n(or dishes) of the\ni\n-th entry;\nT\nj\n(1 ≤\nT\nj\n≤ 10000000) is the time when the\nj\n-th order is accepted;\nK\nj\n(1 ≤\nK\nj\n≤ 10) is the number of dishes in the\nj\n-th order; and each\nDish\nj,k\nrepresents a dish in the\nj\n-th\norder.\nYou may assume that every dish in the orders is listed in the menu card, but you should note that each\norder may contain multiple occurrences of the same dishes. The orders are given in ascending order by\nT\nj\n, and no two orders are accepted at the same time.\nThe input is terminated with a line that contains two zeros. This is not part of data sets and hence\nshould not be processed.\nOu\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2059_1367835","code_snippet":"#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 20;\nconst int MAX_M = 100;\n\n/* typedef */\n\ntypedef vector<int> vi;\ntypedef set<int> si;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vpii;\n\nstruct Menu {\n int id, limit, time;\n string name;\n bool operator<(const Menu& m0) const {\n return time > m0.time || (time == m0.time && id < m0.id);\n }\n void print() {\n printf(\"Menu: id=%d, limit=%d, time=%d, name=%s\\n\",\n\t id, limit, time, name.c_str());\n }\n};\n\nstruct Order {\n int id, t, k, mnums[MAX_N];\n Order() { memset(mnums, 0, sizeof(mnums)); }\n void print() {\n printf(\"Order: id=%d, t=%d, k=%d: \", id, t, k);\n for (int i = 0; i < MAX_N; i++) {\n if (i > 0) putchar(',');\n printf(\"%d\", mnums[i]);\n }\n putchar('\\n');\n }\n};\n\nenum { C_IDLE, C_COOK, C_WAIT };\nenum { E_ORDER, E_CFIN, E_CST};\n\nstruct Event {\n int t, ev, oid;\n Event() {}\n Event(int _t, int _ev, int _oid) : t(_t), ev(_ev), oid(_oid) {}\n bool operator>(const Event& e0) const {\n return t > e0.t || (t == e0.t && ev > e0.ev);\n }\n void print() { printf(\"Event: t=%d, ev=%d, oid=%d\\n\", t, ev, oid); }\n};\n\n/* global variables */\n\nint n, m;\nMenu menu[MAX_N];\nOrder orders[MAX_M];\nint fts[MAX_M], omsums[MAX_N];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n for (bool first = true;; first = false) {\n cin >> n >> m;\n if (n == 0) break;\n\n for (int i = 0; i < n; i++) {\n cin >> menu[i].name >> menu[i].limit >> menu[i].time;\n menu[i].id = i;\n }\n sort(menu, menu + n);\n //for (int i = 0; i < n; i++) menu[i].print();\n \n for (int i = 0; i < m; i++) {\n cin >> orders[i].t >> orders[i].k;\n orders[i].id = i;\n for (int j = 0; j < orders[i].k; j++) {\n\tstring mname;\n\tcin >> mname;\n\tfor (int mi = 0; mi < n; mi++)\n\t if (menu[mi].name == mname) {\n\t orders[i].mnums[mi]++;\n\t break;\n\t }\n }\n }\n //for (int i = 0; i < m; i++) orders[i].print();\n\n priority_queue<Event, vector<Event>, greater<Event> > q;\n \n for (int i = 0; i < m; i++)\n q.push(Event(orders[i].t, E_ORDER, i));\n\n int cstat = C_IDLE, cmenu, cnum;\n vpii clist;\n si olist;\n\n memset(omsums, 0, sizeof(omsums));\n\n while (! q.empty()) {\n Event e = q.top();\n q.pop();\n //e.print();\n\n // order arrived\n if (e.ev == E_ORDER) {\n\tolist.insert(e.oid);\n\n\tfor (int i = 0; i < n; i++)\n\t omsums[i] += orders[e.oid].mnums[i];\n\t\n\tif (cstat == C_IDLE) {\n\t cstat = C_WAIT;\n\t q.push(Event(e.t, E_CST, -1));\n\t}\n }\n\n // finish cooking\n else if (e.ev == E_CFIN) {\n\tfor (int i = 0; i < clist.size(); i++) {\n\t int oid = clist[i].first;\n\t int num = clist[i].second;\n\t orders[oid].mnums[cmenu] -= num;\n\t orders[oid].k -= num;\n\t if (orders[oid].k == 0) {\n\t olist.erase(oid);\n\t fts[oid] = e.t;\n\t }\n\t}\n\n\tomsums[cmenu] -= cnum;\n\t\n\tcstat = C_IDLE;\n\tif (! olist.empty()) {\n\t cstat = C_WAIT;\n\t q.push(Event(e.t, E_CST, -1));\n\t}\n }\n\n // start cooking\n else if (e.ev == E_CST) {\n\tif (! olist.empty()) {\n\t int oid = *(olist.begin());\n\t for (cmenu = 0; cmenu < n; cmenu++)\n\t if (orders[oid].mnums[cmenu] > 0) break;\n\n\t cnum = omsums[cmenu];\n\t if (cnum > menu[cmenu].limit) cnum = menu[cmenu].limit;\n\n\t clist.clear();\n\t int num = cnum;\n\n\t for (si::iterator oit = olist.begin();\n\t num > 0 && oit != olist.end(); oit++) {\n\t int oid = *oit;\n\t int onum = orders[oid].mnums[cmenu];\n\t if (onum > 0) {\n\t if (num > onum) {\n\t\tclist.push_back(pii(oid, onum));\n\t\tnum -= onum;\n\t }\n\t else {\n\t\tclist.push_back(pii(oid, num));\n\t\tnum = 0;\n\t }\n\t }\n\t }\n\n\t cstat = C_COOK;\n\t q.push(Event(e.t + menu[cmenu].time, E_CFIN, -1));\n\t}\n\telse {\n\t cstat = C_IDLE;\n\t}\n }\n }\n\n if (! first) putchar('\\n');\n \n for (int i = 0; i < m; i++) cout << fts[i] << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1240,"score_of_the_acc":-0.9253,"final_rank":3},{"submission_id":"aoj_2059_773348","code_snippet":"#include<iostream>\n#include<map>\n#include<set>\n#include<algorithm>\n#include<cmath>\n#include<deque>\n#include<vector>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<28)\n#define MAX_N 21\n#define MAX_M 101\nusing namespace std;\ntypedef pair<int,int> ii;\n\n\nii ps[MAX_N];\nstruct P\n{\n int index;\n bool finish;\n P(int index=inf,bool finish=false):index(index),finish(finish){}\n bool operator < (const P& a)const\n {\n if(ps[index].second != ps[a.index].second)return ps[index].second > ps[a.index].second;\n return index < a.index;\n }\n};\n\n\nmap<string,int> list;\nstring names[MAX_N];\n\nii order[MAX_M];\nbool fin[MAX_M];\nint ans[MAX_M];\nvector<P> cust[MAX_M];\nint N,M;\n\nint main()\n{\n bool f = true;\n while(cin >> N >> M,N|M)\n {\n if(!f)cout << endl;\n f = false;\n rep(i,N)\n\t{\n\t cin >> names[i] >> ps[i].first >> ps[i].second;\n\t list[names[i]] = i;\n\t}\n rep(i,M)cust[i].clear(),fin[i] = false,ans[i] = inf;\n rep(i,M)\n\t{\n\t int k;\n\t cin >> order[i].first >> k;\n\t order[i].second = i;\n\n\t rep(j,k)\n\t {\n\t string name;\n\t cin >> name;\n\t cust[i].push_back(P(list[name]));\n\t }\n\t sort(cust[i].begin(),cust[i].end());\n\t}\n\n sort(order,order+M);\n\n\n\n int phase = order[0].first;\n bool update = true;\n while(update)\n\t{\n\t //cout << \"phase : \"<< phase << endl;\n\t update = false;\n\t int choice = inf;\n\t rep(i,M)\n\t {\n\t int cur = order[i].second;\n\t if(fin[cur])continue;\n\t if(order[i].first > phase)continue;\n\t rep(j,cust[cur].size())\n\t\t{\n\t\t if(cust[cur][j].finish)continue;\n\t\t update = true;\n\t\t choice = cust[cur][j].index;\n\t\t break;\n\t\t}\n\t if(update)break;\n\t fin[cur] = true;\n\t }\n\n \n\n\t if(!update)\n\t {\n\t rep(i,M)\n\t\t{\n\t\t int cur = order[i].second;\n\t\t if(fin[cur])continue;\n\t\t phase = order[i].first;\n\t\t update = true;\n\t\t break;\n\t\t}\n\t if(update)continue;\n\t break;\n\t }\n\t //cout << \"choice = \" << names[choice] <<endl;\n\t int S = ps[choice].first;\n\n\n\t rep(i,M)\n\t {\n\t int cur = order[i].second;\n\t if(fin[cur])continue;\n\t if(order[i].first > phase)continue;\n\t rep(j,cust[cur].size())\n\t\t{\n\t\t if(!cust[cur][j].finish && S > 0 && cust[cur][j].index == choice)\n\t\t {\n\t\t cust[cur][j].finish = true;\n\t\t S--;\n\t\t }\n\t\t}\n\t if(S <= 0)break;\n\t }\n\n\t phase += ps[choice].second;\n\t rep(i,M)\n\t {\n\t int cur = order[i].second;\n\t if(fin[cur])continue;\n\t bool ok = true;\n\t rep(j,cust[cur].size())\n\t\t{\n\t\t if(!cust[cur][j].finish)\n\t\t {\n\t\t ok = false;\n\t\t break;\n\t\t }\n\t\t}\n\t if(ok)ans[cur] = min(ans[cur],phase),fin[cur] = true;\n\t }\n\n\n\t}\n\n rep(i,M)cout << ans[i] << endl;\n\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1356,"score_of_the_acc":-1.0084,"final_rank":7},{"submission_id":"aoj_2059_609923","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 Event{\n // type 0 - order\n // type 1 - complete\n int type, time, dish, customer;\n Event(int ty, int t, int d, int c):\n type(ty), time(t), dish(d), customer(c) {}\n bool operator < (const Event& e) const {\n if(time != e.time) return time > e.time;\n if(type != e.type) return type > e.type;\n return dish > e.dish;\n }\n};\nstruct Dish{\n string name;\n int limit, time;\n Dish() {}\n bool operator < (const Dish& d) const {\n return time > d.time;\n }\n};\n\nint main(){\n int N, M;\n bool first = true;\n while(cin >> N >> M && N){\n if(first) first = false;\n else cout << endl;\n vector<Dish> dishes(N);\n REP(i, N) cin >> dishes[i].name >> dishes[i].limit >> dishes[i].time;\n stable_sort(dishes.begin(), dishes.end());\n map<string, int> name_to_index;\n REP(i, N) name_to_index[dishes[i].name] = i;\n priority_queue<Event> que;\n REP(i, M){\n int T, K; cin >> T >> K;\n REP(j, K){\n string name; cin >> name;\n que.push(Event(0, T, name_to_index[name], i));\n }\n }\n vector<int> answer(M);\n vector<Event> cook_queue;\n int cooking = 0;\n while(!que.empty()){\n Event e = que.top(); que.pop();\n if(e.type == 0){\n //printf(\"customer %d order %s : time %d\\n\", e.customer, dishes[e.dish].name.c_str(), e.time);\n cook_queue.push_back(Event(0, 0, e.dish, e.customer));\n }else if(e.type == 1){\n //printf(\"customer %d's %s is finshed: time %d\\n\", e.customer, dishes[e.dish].name.c_str(), e.time);\n cooking --;\n answer[e.customer] = e.time;\n }\n if(cooking == 0 && !cook_queue.empty() && (que.empty() || e.time != que.top().time)){\n // new dish\n int new_dish = cook_queue[0].dish;\n for(vector<Event>::iterator it = cook_queue.begin(); it != cook_queue.end(); ){\n if(it->dish == new_dish){\n //printf(\"customer %d's %s is started : time %d -> %d\\n\", it->customer, dishes[it->dish].name.c_str(), e.time, e.time + dishes[new_dish].time);\n que.push(Event(1, e.time + dishes[new_dish].time, it->dish, it->customer));\n cooking++;\n it = cook_queue.erase(it);\n if(cooking >= dishes[new_dish].limit) break;\n }else{\n it++;\n }\n }\n assert(cooking <= dishes[new_dish].limit);\n }\n }\n assert(cooking == 0);\n REP(i, M) cout << answer[i] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1288,"score_of_the_acc":-0.9597,"final_rank":5},{"submission_id":"aoj_2059_472208","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, m; // 料理の種類数、注文の数\n\nvector<string> name; // 料理の名前\nmap<string, int> index; // 料理の番号\nvector<int> limit, makeTime; // 一度に調理できる最大数、調理時間\n\nvector<int> come, dishNum; // 来店時間、各注文の料理の数\nvector<vector<string> > dish; // 注文された料理の名前\n\nclass Data\n{\npublic:\n int time, id;\n int a, b;\n Data(int time0, int id0, int a0, int b0){\n time = time0;\n id = id0;\n a = a0;\n b = b0;\n }\n bool operator< (const Data& d) const{\n if(time < d.time)\n return true;\n if(time == d.time){\n if(id == -1)\n return false;\n if(d.id == -1)\n return true;\n return make_pair(-makeTime[id], id) < make_pair(-makeTime[d.id], d.id);\n }\n return false;\n }\n};\n\nint main()\n{\n bool isFirst = true;\n\n for(;;){\n cin >> n >> m;\n if(n == 0)\n return 0;\n\n if(isFirst)\n isFirst = false;\n else\n cout << endl;\n\n name.resize(n);\n limit.resize(n);\n makeTime.resize(n);\n index.clear();\n for(int i=0; i<n; ++i){\n cin >> name[i] >> limit[i] >> makeTime[i];\n index[name[i]] = i;\n }\n\n come.resize(m);\n dishNum.resize(m);\n dish.resize(m);\n multiset<Data> ms1, ms2; // 各種イベント\n vector<vector<int> > finish(m); // 最後の料理が提供された時間\n for(int i=0; i<m; ++i){\n cin >> come[i] >> dishNum[i];\n dish[i].resize(dishNum[i]);\n finish[i].resize(dishNum[i], -1);\n for(int j=0; j<dishNum[i]; ++j){\n cin >> dish[i][j];\n ms1.insert(Data(come[i], index[dish[i][j]], i, j));\n }\n }\n\n vector<queue<pair<int, int> > > q(n); // 各料理の注文のキュー\n bool isFree = true; // 料理人が次の調理を始められるかどうか\n while(!ms1.empty()){\n int time = ms1.begin()->time;\n while(!ms1.empty() && time == ms1.begin()->time){\n Data d = *ms1.begin();\n ms1.erase(ms1.begin());\n\n if(d.id == -1){\n isFree = true;\n }else{\n q[d.id].push(make_pair(d.a, d.b));\n ms2.insert(d);\n }\n }\n\n while(isFree && !ms2.empty()){\n Data d = *ms2.begin();\n ms2.erase(ms2.begin());\n\n if(finish[d.a][d.b] == -1){\n int rest = limit[d.id];\n while(rest > 0 && !q[d.id].empty()){\n int a = q[d.id].front().first;\n int b = q[d.id].front().second;\n q[d.id].pop();\n\n if(finish[a][b] == -1){\n finish[a][b] = time + makeTime[d.id];\n -- rest;\n }\n }\n isFree = false;\n ms1.insert(Data(time + makeTime[d.id], -1, -1, -1));\n }\n }\n }\n\n for(int i=0; i<m; ++i)\n cout << *max_element(finish[i].begin(), finish[i].end()) << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":1396,"score_of_the_acc":-1.037,"final_rank":8},{"submission_id":"aoj_2059_411027","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 menu{\n\tchar name[21];\n\tint lim,t;\n};\n\nint n;\nmenu M[20];\n\nbool cmp(int a,int b){\n\treturn M[a].t>M[b].t || M[a].t==M[b].t && a<b;\n}\n\nint main(){\n\tfor(int test=0,m;scanf(\"%d%d\",&n,&m),n;test++){\n\t\tif(test>0) puts(\"\");\n\n\t\trep(i,n) scanf(\"%s%d%d\",&M[i].name,&M[i].lim,&M[i].t);\n\n\t\tpair< int,vector<int> > order[100]; // <到着時刻,注文内容>\n\t\trep(i,m){\n\t\t\tint k; scanf(\"%d%d\",&order[i].first,&k);\n\t\t\torder[i].second.resize(k);\n\t\t\trep(j,k){\n\t\t\t\tchar name[21]; scanf(\"%s\",name);\n\t\t\t\trep(l,n) if(strcmp(name,M[l].name)==0) { order[i].second[j]=l; break; }\n\t\t\t}\n\t\t\tsort(order[i].second.begin(),order[i].second.end(),cmp);\n\t\t}\n\n\t\tint fin[100]={},ans[100];\n\n\t\tdeque< pair<int,int> > wait; // <注文した人,調理待ちの料理>\n\t\tint cooking=0; // 今調理中かどうか\n\t\tpriority_queue< pair<int,int> > Q; // <-time,event_type>\n\t\trep(i,m) Q.push(make_pair(-order[i].first,i+1));\n\t\twhile(!Q.empty()){\n\t\t\tint t=-Q.top().first,type=Q.top().second; Q.pop();\n\n\t\t\t// 来客\n\t\t\tif(type>0){\n\t\t\t\ttype--;\n\n\t\t\t\tconst vector<int> &O=order[type].second;\n\t\t\t\trep(i,O.size()) wait.push_back(make_pair(type,O[i]));\n\t\t\t}\n\t\t\t// 料理ができた\n\t\t\telse{\n\t\t\t\ttype*=-1;\n\t\t\t\ttype--;\n\n\t\t\t\tfin[type]++;\n\t\t\t\tif(fin[type]==order[type].second.size()) ans[type]=t;\n\t\t\t\tcooking--;\n\t\t\t}\n\n\t\t\tif(cooking==0 && !wait.empty()){\n\t\t\t\tint a=wait.front().first,menuid=wait.front().second; wait.pop_front();\n\t\t\t\tQ.push(make_pair(-(t+M[menuid].t),-(a+1)));\n\t\t\t\tcooking++;\n\n\t\t\t\tint cnt=1;\n\t\t\t\trep(i,wait.size()) if(wait[i].second==menuid && cnt<M[menuid].lim) {\n\t\t\t\t\tQ.push(make_pair(-(t+M[menuid].t),-(wait[i].first+1)));\n\t\t\t\t\twait.erase(wait.begin()+i);\n\t\t\t\t\ti--;\n\t\t\t\t\tcnt++;\n\t\t\t\t\tcooking++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\trep(i,m) printf(\"%d\\n\",ans[i]);\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_2059_392488","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\nstruct Dish{\n string name;\n int time;\n int limit;\n int orderTime;\n int dishIdx;\n int whois;\n int ordNum;\n Dish(){}\n Dish(string _name,int _time,int _limit,int _orderTime,int _dishIdx,int _whois,int _ordNum){\n name=_name;\n time=_time;\n limit=_limit;\n orderTime=_orderTime;\n dishIdx=_dishIdx;\n whois=_whois;\n ordNum=_ordNum;\n }\n bool operator<(const Dish&dh)const{\n if(dh.orderTime!=orderTime)return dh.orderTime>this->orderTime;\n else if(dh.time!=this->time)return dh.time<this->time;\n else if(dh.dishIdx!=this->dishIdx)return dh.dishIdx>this->dishIdx;\n else if(dh.whois!=this->whois)return dh.whois>this->whois;\n return dh.ordNum<this->ordNum;\n }\n};\nstruct Event{\n int time;\n int idx;\n int dishIdx;\n int kind;\n vector<int> who;\n Event(){}\n Event(int _time,int _idx,int _dishIdx,int _kind){\n time=_time;\n idx=_idx;\n dishIdx=_dishIdx;\n kind=_kind;\n }\n bool operator<(const Event&e)const{\n if(e.time!=this->time)return e.time<this->time;\n return (e.kind<this->kind);\n }\n};\n\nset<Dish> waitDish;\nint N,M;\nDish ds[101];\nmap<string,int> ms;\nint T[101];\nint K[101];\nint leftDish[101];\nint finTimes[101];\nbool need[100001];\nvector<string> order[101];\n\nint main(){\n bool fst=true;\n while(cin>>N>>M&&(N|M)){\n if(fst)fst=false;\n else cout<<endl;\n waitDish.clear();\n ms.clear();\n for(int i=0;i<N;i++){\n cin>>ds[i].name>>ds[i].limit>>ds[i].time;\n ms[ds[i].name]=i;\n ds[i].dishIdx=i;\n }\n for(int i=0;i<M;i++){\n order[i].clear();\n cin>>T[i];\n cin>>K[i];\n leftDish[i]=K[i];\n for(int j=0;j<K[i];j++){\n string str;\n cin>>str;\n order[i].push_back(str);\n }\n }\n priority_queue<Event> pq;\n bool isCook=false;\n for(int i=0;i<M;i++){\n pq.push(Event(T[i],i,0,0));\n }\n while(pq.size()){\n Event e=pq.top();pq.pop();\n if(e.kind==0){\n for(int j=0;j<K[e.idx];j++){\n int dk=ms[order[e.idx][j]];\n Dish tmp=ds[dk];\n tmp.whois=e.idx;\n tmp.orderTime=e.time;\n tmp.ordNum=j;\n waitDish.insert(tmp);\n }\n Event ne=Event(e.time,0,0,2);\n pq.push(ne);\n }\n else if(e.kind==1){\n int dkind=e.idx;\n for(int i=0;i<e.who.size();i++){\n int user=e.who[i];\n leftDish[user]--;\n if(leftDish[user]==0)\n finTimes[user]=e.time;\n }\n isCook=false;\n Event ne=Event(e.time,0,0,2);\n pq.push(ne);\n }\n else{\n if(isCook||waitDish.size()==0)continue;\n isCook=true;\n Dish d=*(waitDish.begin());\n int lim=(waitDish.begin())->limit;\n Event ne=Event(e.time+(waitDish.begin())->time,0,d.dishIdx,1);\n vector<Dish> tmp;\n for(set<Dish>::iterator it=waitDish.begin();it!=waitDish.end();it++)\n tmp.push_back(*it);\n vector<int> idxs;\n for(int i=0;i<tmp.size();i++){\n if(lim>0&&tmp[i].dishIdx==d.dishIdx){\n ne.who.push_back(tmp[i].whois);\n lim--;\n }\n else idxs.push_back(i);\n }\n waitDish.clear();\n for(int i=0;i<idxs.size();i++){\n int cur=idxs[i];\n waitDish.insert(tmp[cur]);\n }\n pq.push(ne);\n }\n }\n for(int i=0;i<M;i++)\n cout<<finTimes[i]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":0,"score_of_the_acc":-1,"final_rank":6},{"submission_id":"aoj_2059_392485","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\nstruct Dish{\n string name;\n int time;\n int limit;\n int orderTime;\n int dishIdx;\n int whois;\n int ordNum;\n bool operator<(const Dish&dh)const{\n if(dh.orderTime!=orderTime)return dh.orderTime>this->orderTime;\n else if(dh.time!=this->time)return dh.time<this->time;\n else if(dh.dishIdx!=this->dishIdx)return dh.dishIdx>this->dishIdx;\n else if(dh.whois!=this->whois)return dh.whois>this->whois;\n return dh.ordNum<this->ordNum;\n }\n};\nstruct Event{\n int time;\n int idx;\n int dishIdx;\n int kind;\n vector<int> who;\n bool operator<(const Event&e)const{\n if(e.time!=this->time)return e.time<this->time;\n return (e.kind<this->kind);\n }\n};\n\nset<Dish> waitDish;\nint N,M;\nDish ds[101];\nmap<string,int> ms;\nint T[101];\nint K[101];\nint leftDish[101];\nint finTimes[101];\nbool need[100001];\nvector<string> order[101];\n\nint main(){\n bool fst=true;\n while(cin>>N>>M&&(N|M)){\n if(fst)fst=false;\n else cout<<endl;\n waitDish.clear();\n ms.clear();\n for(int i=0;i<N;i++){\n cin>>ds[i].name>>ds[i].limit>>ds[i].time;\n ms[ds[i].name]=i;\n ds[i].dishIdx=i;\n }\n for(int i=0;i<M;i++){\n order[i].clear();\n cin>>T[i];\n cin>>K[i];\n leftDish[i]=K[i];\n for(int j=0;j<K[i];j++){\n string str;\n cin>>str;\n order[i].push_back(str);\n }\n }\n priority_queue<Event> pq;\n bool isCook=false;\n for(int i=0;i<M;i++){\n Event e;\n e.kind=0;\n e.idx=i;\n e.time=T[i];\n pq.push(e);\n }\n while(pq.size()){\n Event e=pq.top();pq.pop();\n if(e.kind==0){\n for(int j=0;j<K[e.idx];j++){\n int dk=ms[order[e.idx][j]];\n Dish tmp=ds[dk];\n tmp.whois=e.idx;\n tmp.orderTime=e.time;\n tmp.ordNum=j;\n waitDish.insert(tmp);\n }\n Event ne;\n ne.time=e.time;\n ne.kind=2;\n pq.push(ne);\n }\n else if(e.kind==1){\n int dkind=e.idx;\n for(int i=0;i<e.who.size();i++){\n int user=e.who[i];\n leftDish[user]--;\n if(leftDish[user]==0){\n finTimes[user]=e.time;\n }\n }\n isCook=false;\n Event ne;\n ne.time=e.time;\n ne.kind=2;\n pq.push(ne);\n }\n else{\n if(isCook||waitDish.size()==0)continue;\n isCook=true;\n Dish d=*(waitDish.begin());\n int lim=(waitDish.begin())->limit;\n Event ne;ne.kind=1;ne.dishIdx=d.dishIdx;\n ne.time=e.time+(waitDish.begin())->time;\n vector<Dish> tmp;\n for(set<Dish>::iterator it=waitDish.begin();it!=waitDish.end();it++){\n tmp.push_back(*it);\n }\n vector<int> idxs;\n for(int i=0;i<tmp.size();i++){\n if(lim>0&&tmp[i].dishIdx==d.dishIdx){\n ne.who.push_back(tmp[i].whois);\n lim--;\n }\n else idxs.push_back(i);\n }\n waitDish.clear();\n for(int i=0;i<idxs.size();i++){\n int cur=idxs[i];\n waitDish.insert(tmp[cur]);\n }\n pq.push(ne);\n }\n }\n for(int i=0;i<M;i++)\n cout<<finTimes[i]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":1048,"score_of_the_acc":-1.7507,"final_rank":10},{"submission_id":"aoj_2059_392484","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\nstruct Dish{\n string name;\n int time;\n int limit;\n int orderTime;\n int dishIdx;\n int whois;\n int ordNum;\n bool operator<(const Dish&dh)const{\n if(dh.orderTime!=orderTime)return dh.orderTime>this->orderTime;\n else if(dh.time!=this->time)return dh.time<this->time;\n else if(dh.dishIdx!=this->dishIdx)return dh.dishIdx>this->dishIdx;\n else if(dh.whois!=this->whois)return dh.whois>this->whois;\n return dh.ordNum<this->ordNum;\n }\n};\nstruct Event{\n int time;\n int idx;\n int dishIdx;\n int kind;\n vector<int> who;\n bool operator<(const Event&e)const{\n if(e.time<this->time)return true;\n else if(e.time>this->time)return false;\n return (e.kind<this->kind);\n }\n};\n\nset<Dish> waitDish;\nint N,M;\nDish ds[101];\nmap<string,int> ms;\nint T[101];\nint K[101];\nint leftDish[101];\nint finTimes[101];\nbool need[100001];\nvector<string> order[101];\n\nint main(){\n bool fst=true;\n while(cin>>N>>M&&(N|M)){\n if(fst)fst=false;\n else cout<<endl;\n waitDish.clear();\n ms.clear();\n for(int i=0;i<N;i++){\n cin>>ds[i].name>>ds[i].limit>>ds[i].time;\n ms[ds[i].name]=i;\n ds[i].dishIdx=i;\n }\n for(int i=0;i<M;i++){\n order[i].clear();\n cin>>T[i];\n cin>>K[i];\n leftDish[i]=K[i];\n for(int j=0;j<K[i];j++){\n string str;\n cin>>str;\n order[i].push_back(str);\n }\n }\n priority_queue<Event> pq;\n bool isCook=false;\n for(int i=0;i<M;i++){\n Event e;\n e.kind=0;\n e.idx=i;\n e.time=T[i];\n pq.push(e);\n }\n while(pq.size()){\n Event e=pq.top();pq.pop();\n if(e.kind==0){\n for(int j=0;j<K[e.idx];j++){\n int dk=ms[order[e.idx][j]];\n Dish tmp=ds[dk];\n tmp.whois=e.idx;\n tmp.orderTime=e.time;\n tmp.ordNum=j;\n waitDish.insert(tmp);\n }\n Event ne;\n ne.time=e.time;\n ne.kind=2;\n pq.push(ne);\n }\n else if(e.kind==1){\n int dkind=e.idx;\n for(int i=0;i<e.who.size();i++){\n int user=e.who[i];\n leftDish[user]--;\n if(leftDish[user]==0){\n finTimes[user]=e.time;\n }\n }\n isCook=false;\n Event ne;\n ne.time=e.time;\n ne.kind=2;\n pq.push(ne);\n }\n else{\n if(isCook||waitDish.size()==0)continue;\n isCook=true;\n Dish d=*(waitDish.begin());\n int lim=(waitDish.begin())->limit;\n Event ne;ne.kind=1;ne.dishIdx=d.dishIdx;\n ne.time=e.time+(waitDish.begin())->time;\n vector<Dish> tmp;\n for(set<Dish>::iterator it=waitDish.begin();it!=waitDish.end();it++){\n tmp.push_back(*it);\n }\n vector<int> idxs;\n for(int i=0;i<tmp.size();i++){\n if(lim>0&&tmp[i].dishIdx==d.dishIdx){\n ne.who.push_back(tmp[i].whois);\n lim--;\n }\n else idxs.push_back(i);\n }\n waitDish.clear();\n for(int i=0;i<idxs.size();i++){\n int cur=idxs[i];\n waitDish.insert(tmp[cur]);\n }\n pq.push(ne);\n }\n }\n for(int i=0;i<M;i++)\n cout<<finTimes[i]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":1048,"score_of_the_acc":-1.7507,"final_rank":10},{"submission_id":"aoj_2059_392452","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\nstruct Dish{\n string name;\n int time;\n int limit;\n int orderTime;\n int dishIdx;\n int whois;\n int ordNum;\n bool operator<(const Dish&dh)const{\n if(dh.orderTime>this->orderTime)return true;\n else if(dh.orderTime<this->orderTime)return false;\n else if(dh.time<this->time)return true;\n else if(dh.time>this->time)return false;\n else if(dh.dishIdx>this->dishIdx)return true;\n else if(dh.dishIdx<this->dishIdx)return false;\n else if(dh.whois>this->whois)return true;\n else if(dh.whois<this->whois)return false;\n return dh.ordNum<this->ordNum;\n }\n};\nstruct Event{\n int time;\n int idx;\n int dishIdx;\n int kind;\n vector<int> who;\n bool operator<(const Event&e)const{\n if(e.time<this->time)return true;\n else if(e.time>this->time)return false;\n return (e.kind<this->kind);\n }\n};\n\nset<Dish> waitDish;\nint N,M;\nDish ds[101];\nmap<string,int> ms;\nint T[101];\nint K[101];\nint leftDish[101];\nint finTimes[101];\nbool need[100001];\nvector<string> order[101];\n\nint main(){\n bool fst=true;\n while(cin>>N>>M&&(N|M)){\n if(fst)fst=false;\n else cout<<endl;\n waitDish.clear();\n ms.clear();\n for(int i=0;i<N;i++){\n cin>>ds[i].name>>ds[i].limit>>ds[i].time;\n ms[ds[i].name]=i;\n ds[i].dishIdx=i;\n }\n for(int i=0;i<M;i++){\n order[i].clear();\n cin>>T[i];\n cin>>K[i];\n leftDish[i]=K[i];\n for(int j=0;j<K[i];j++){\n string str;\n cin>>str;\n order[i].push_back(str);\n }\n }\n priority_queue<Event> pq;\n bool isCook=false;\n for(int i=0;i<M;i++){\n Event e;\n e.kind=0;\n e.idx=i;\n e.time=T[i];\n pq.push(e);\n }\n while(pq.size()){\n Event e=pq.top();pq.pop();\n if(e.kind==0){\n for(int j=0;j<K[e.idx];j++){\n int dk=ms[order[e.idx][j]];\n Dish tmp=ds[dk];\n tmp.whois=e.idx;\n tmp.orderTime=e.time;\n tmp.ordNum=j;\n waitDish.insert(tmp);\n }\n Event ne;\n ne.time=e.time;\n ne.kind=2;\n pq.push(ne);\n }\n else if(e.kind==1){\n int dkind=e.idx;\n for(int i=0;i<e.who.size();i++){\n int user=e.who[i];\n leftDish[user]--;\n if(leftDish[user]==0){\n finTimes[user]=e.time;\n }\n }\n isCook=false;\n Event ne;\n ne.time=e.time;\n ne.kind=2;\n pq.push(ne);\n }\n else{\n if(isCook||waitDish.size()==0)continue;\n isCook=true;\n Dish d=*(waitDish.begin());\n int lim=(waitDish.begin())->limit;\n Event ne;ne.kind=1;ne.dishIdx=d.dishIdx;\n ne.time=e.time+(waitDish.begin())->time;\n vector<Dish> tmp;\n for(set<Dish>::iterator it=waitDish.begin();it!=waitDish.end();it++){\n tmp.push_back(*it);\n }\n vector<int> idxs;\n for(int i=0;i<tmp.size();i++){\n if(lim>0&&tmp[i].dishIdx==d.dishIdx){\n ne.who.push_back(tmp[i].whois);\n lim--;\n }\n else idxs.push_back(i);\n }\n waitDish.clear();\n for(int i=0;i<idxs.size();i++){\n int cur=idxs[i];\n waitDish.insert(tmp[cur]);\n }\n pq.push(ne);\n }\n }\n for(int i=0;i<M;i++)\n cout<<finTimes[i]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":1048,"score_of_the_acc":-1.7507,"final_rank":10},{"submission_id":"aoj_2059_392446","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\nstruct Dish{\n string name;\n int time;\n int limit;\n int orderTime;\n int idx;\n int whois;\n int ordNum;\n bool operator<(const Dish&dh)const{\n if(dh.orderTime>this->orderTime)return true;\n else if(dh.orderTime<this->orderTime)return false;\n else if(dh.time<this->time)return true;\n else if(dh.time>this->time)return false;\n else if(dh.idx>this->idx)return true;\n else if(dh.idx<this->idx)return false;\n else if(dh.whois>this->whois)return true;\n else if(dh.whois<this->whois)return false;\n return dh.ordNum<this->ordNum;\n }\n};\nstruct Event{\n int time;\n int idx;\n int kind;\n vector<int> who;\n bool operator<(const Event&e)const{\n if(e.time<this->time)return true;\n else if(e.time>this->time)return false;\n return (e.kind<this->kind);\n }\n};\n\nset<Dish> waitDish;\nint N,M;\nDish ds[101];\nmap<string,int> ms;\nint T[101];\nint K[101];\nint leftDish[101];\nint finTimes[101];\nbool need[100001];\nvector<string> order[101];\n\nint main(){\n bool fst=true;\n while(cin>>N>>M&&(N|M)){\n if(fst)fst=false;\n else cout<<endl;\n waitDish.clear();\n ms.clear();\n for(int i=0;i<N;i++){\n cin>>ds[i].name>>ds[i].limit>>ds[i].time;\n ms[ds[i].name]=i;\n ds[i].idx=i;\n }\n for(int i=0;i<M;i++){\n order[i].clear();\n cin>>T[i];\n cin>>K[i];\n leftDish[i]=K[i];\n for(int j=0;j<K[i];j++){\n string str;\n cin>>str;\n order[i].push_back(str);\n }\n }\n priority_queue<Event> pq;\n bool isCook=false;\n for(int i=0;i<M;i++){\n Event e;\n e.kind=0;\n e.idx=i;\n e.time=T[i];\n pq.push(e);\n }\n while(pq.size()){\n Event e=pq.top();pq.pop();\n if(e.kind==0){\n for(int j=0;j<K[e.idx];j++){\n int dk=ms[order[e.idx][j]];\n Dish tmp=ds[dk];\n tmp.whois=e.idx;\n tmp.orderTime=e.time;\n tmp.ordNum=j;\n waitDish.insert(tmp);\n }\n Event ne;\n ne.time=e.time;\n ne.kind=2;\n pq.push(ne);\n }\n else if(e.kind==1){\n int dkind=e.idx;\n for(int i=0;i<e.who.size();i++){\n int user=e.who[i];\n leftDish[user]--;\n if(leftDish[user]==0){\n finTimes[user]=e.time;\n }\n }\n isCook=false;\n Event ne;\n ne.time=e.time;\n ne.kind=2;\n pq.push(ne);\n }\n else{\n if(isCook||waitDish.size()==0)continue;\n isCook=true;\n Dish d=*(waitDish.begin());\n int lim=(waitDish.begin())->limit;\n Event ne;ne.kind=1;ne.idx=d.idx;\n ne.time=e.time+(waitDish.begin())->time;\n vector<Dish> tmp;\n for(set<Dish>::iterator it=waitDish.begin();it!=waitDish.end();it++){\n tmp.push_back(*it);\n }\n vector<int> idxs;\n for(int i=0;i<tmp.size();i++){\n if(lim>0&&tmp[i].idx==d.idx){\n ne.who.push_back(tmp[i].whois);\n lim--;\n }\n else idxs.push_back(i);\n }\n waitDish.clear();\n for(int i=0;i<idxs.size();i++){\n int cur=idxs[i];\n waitDish.insert(tmp[cur]);\n }\n pq.push(ne);\n }\n }\n for(int i=0;i<M;i++)\n cout<<finTimes[i]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":1052,"score_of_the_acc":-1.7536,"final_rank":13},{"submission_id":"aoj_2059_392445","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\n/*\n客がくる順番に注文を処理\n客の注文は、もっとも時間がかかる料理から処理\nおなじ時間の場合は、料理のindexが小さい方を先に処理\nまた、ある料理を調理開始する際,\nキューに同じ料理があれば、同時に料理する\nただし同時に料理可能な量は限られる\n*/\nstruct Dish{\n string name;\n int time;\n int limit;\n int orderTime;\n // 料理のidx\n int idx;\n // 注文した客のidx\n int whois;\n int ordNum;\n // かかる時間が長い順番でソート\n // 同じならidxで小さい順番にソート\n bool operator<(const Dish&dh)const{\n if(dh.orderTime>this->orderTime)return true;\n else if(dh.orderTime<this->orderTime)return false;\n else if(dh.time<this->time)return true;\n else if(dh.time>this->time)return false;\n else if(dh.idx>this->idx)return true;\n else if(dh.idx<this->idx)return false;\n // さらに同じなら、注文した客のidx順で取る\n else if(dh.whois>this->whois)return true;\n else if(dh.whois<this->whois)return false;\n return dh.ordNum<this->ordNum;\n }\n};\n\n/*\n{客が到着,\n料理終了,\n料理開始}\nのイベントを登録\n優先順位はこの順番で\n*/\nstruct Event{\n int time;\n // 料理の種類\n int idx;\n // kind=0 -> 客が到着,kind=1 -> 料理終了\n // kind=2 -> 料理開始\n int kind;\n // どの客の料理か\n vector<int> who;\n // 時間の小さい方を優先\n // 同じならば,優先順位が高いeventを優先\n bool operator<(const Event&e)const{\n if(e.time<this->time)return true;\n else if(e.time>this->time)return false;\n return (e.kind<this->kind);\n }\n};\n\n// 料理は客の頼んだ順番に関係なく\n// 今登録されている料理の情報に依存して決定される\nset<Dish> waitDish;\nint N,M;\nDish ds[101];\nmap<string,int> ms;\nint T[101];\nint K[101];\nint leftDish[101];\nint finTimes[101];\nbool need[100001];\nvector<string> order[101];\n\nint main(){\n bool fst=true;\n while(cin>>N>>M&&(N|M)){\n if(fst)fst=false;\n else cout<<endl;\n waitDish.clear();\n ms.clear();\n for(int i=0;i<N;i++){\n cin>>ds[i].name>>ds[i].limit>>ds[i].time;\n ms[ds[i].name]=i;\n ds[i].idx=i;\n }\n for(int i=0;i<M;i++){\n order[i].clear();\n cin>>T[i];\n cin>>K[i];\n // 残りの料理量\n leftDish[i]=K[i];\n for(int j=0;j<K[i];j++){\n string str;\n cin>>str;\n order[i].push_back(str);\n }\n }\n // 料理終了時か,客到着時に料理を開始\n priority_queue<Event> pq;\n bool isCook=false;\n // 客到着イベント登録\n for(int i=0;i<M;i++){\n Event e;\n e.kind=0;\n e.idx=i;\n e.time=T[i];\n pq.push(e);\n }\n while(pq.size()){\n Event e=pq.top();pq.pop();\n // 客到着\n if(e.kind==0){\n // 料理を登録\n for(int j=0;j<K[e.idx];j++){\n int dk=ms[order[e.idx][j]];\n Dish tmp=ds[dk];\n tmp.whois=e.idx;\n tmp.orderTime=e.time;\n tmp.ordNum=j;\n waitDish.insert(tmp);\n }\n // 料理開始イベントを登録\n Event ne;\n ne.time=e.time;\n ne.kind=2;\n pq.push(ne);\n }\n // 料理終了\n else if(e.kind==1){\n // 料理の種類\n int dkind=e.idx;\n // 登録してある料理を終了させる\n for(int i=0;i<e.who.size();i++){\n // ユーザのid\n int user=e.who[i];\n leftDish[user]--;\n // 注文終了時間を登録\n if(leftDish[user]==0){\n finTimes[user]=e.time;\n }\n }\n isCook=false;\n // 料理開始イベントを登録\n Event ne;\n ne.time=e.time;\n ne.kind=2;\n pq.push(ne);\n }\n // 料理開始\n else{\n // すでに料理を開始している\n // または待ち料理が存在しない\n if(isCook||waitDish.size()==0)continue;\n isCook=true;\n Dish d=*(waitDish.begin());\n int lim=(waitDish.begin())->limit;\n Event ne;ne.kind=1;ne.idx=d.idx;\n ne.time=e.time+(waitDish.begin())->time;\n vector<Dish> tmp;\n for(set<Dish>::iterator it=waitDish.begin();it!=waitDish.end();it++){\n tmp.push_back(*it);\n }\n vector<int> idxs;\n for(int i=0;i<tmp.size();i++){\n if(lim>0&&tmp[i].idx==d.idx){\n ne.who.push_back(tmp[i].whois);\n lim--;\n }\n else idxs.push_back(i);\n }\n waitDish.clear();\n for(int i=0;i<idxs.size();i++){\n int cur=idxs[i];\n waitDish.insert(tmp[cur]);\n }\n //// limが0になるまで\n //ne.who.push_back(waitDish.begin()->whois);\n //lim--;\n //waitDish.erase(waitDish.begin());\n //for(set<Dish>::iterator it=waitDish.begin();it!=waitDish.end();it++){\n // if(lim==0)break;\n // // 同じ料理ならば、登録\n // if(it->idx==d.idx){\n // ne.who.push_back(it->whois);\n // lim--;\n // waitDish.erase(it);\n // it=waitDish.begin();\n // }\n //}\n //// イベントを登録\n pq.push(ne);\n }\n }\n // 終了時間を表示\n for(int i=0;i<M;i++)\n cout<<finTimes[i]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":1052,"score_of_the_acc":-1.7536,"final_rank":13},{"submission_id":"aoj_2059_354149","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\nstruct Menu {\n int limit, time;\n int id;\n Menu(int limit, int time, int id) : limit(limit), time(time), id(id) {}\n Menu() {}\n};\nbool operator<(const Menu &a, const Menu &b) {\n return a.time != b.time ? a.time > b.time : a.id < b.id;\n};\n\nstruct Order {\n int T;\n Menu menu;\n int id;\n Order(int T, Menu menu, int id) : T(T), menu(menu), id(id) {}\n Order() {}\n};\nbool operator<(const Order &a, const Order &b) {\n return a.T != b.T ? a.T < b.T : a.menu < b.menu;\n}\n\nMenu menu[20];\nOrder order[1000];\nint ok[1000]; // »Ì¶ðoµIíÁ½Ô\nint K[100];\nint endTime[100][10];\n\nint main() {\n int n, m;\n int hoge = 0;\n while(cin >> n >> m, n || m) {\n if (hoge++) cout << endl;\n map<string, int> mp;\n REP(i, n) {\n string name;\n cin >> name >> menu[i].limit >> menu[i].time;\n menu[i].id = i;\n mp[name] = i;\n }\n int endnum[m];\n int num = 0;\n REP(i, m) {\n int T;\n cin >> T;\n cin >> K[i];\n REP(j, K[i]) {\n string dish;\n cin >> dish;\n order[num] = Order(T, menu[mp[dish]], i);\n num++;\n }\n }\n sort(order, order+num);\n ll nowtime = 0;\n memset(ok, -1, sizeof(ok));\n REP(i, num) {\n if (ok[i] >= 0) continue;\n nowtime = max(nowtime, (ll)order[i].T);\n //cout << i << \" \" << nowtime << \" \" << order[i].id << \" \" << order[i].menu.time << \" \" << order[i].menu.id << endl;\n ok[i] = nowtime + order[i].menu.time;\n int cnt = 1;\n for (int j=i+1; j<num && order[j].T<=nowtime && cnt<order[i].menu.limit; ++j) {\n if (order[j].menu.id == order[i].menu.id) {\n //cout << j << endl;\n ok[j] = nowtime + order[i].menu.time;\n cnt++;\n }\n }\n nowtime += order[i].menu.time;\n }\n int ans[m];\n memset(ans, 0, sizeof(ans));\n REP(i, num) {\n ans[order[i].id] = max(ans[order[i].id], ok[i]);\n }\n REP(i, m)\n cout << ans[i] << endl;\n }\n}","accuracy":1,"time_ms":40,"memory_kb":964,"score_of_the_acc":-0.8017,"final_rank":2},{"submission_id":"aoj_2059_134434","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<map>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define pb push_back\n\ntypedef long long ll;\nclass state{\npublic:\n int time,num;\n int cap;\n string name;\n bool operator<(const state& a)const{\n if (time != a.time)return time >a.time;\n return num < a.num;\n }\n};\n\nvector<ll> solve(vector<state> &dish,\n\t\t vector<int> &come,vector<vector<int> >&ord){\n ll now = 0;\n int p=0;\n vector<ll> ret(come.size(),(1LL)<<50);\n while(p < come.size()){\n if (come[p] > now)now=come[p];\n\n int cap=-1,num=-1;\n rep(i,dish.size()){\n if(ord[p][i] != 0){\n\tnum=i;\n\tcap=dish[i].cap;\n\tbreak;\n }\n }\n\n REP(i,p,ord.size() && cap){\n if (now < come[i])break;\n if (cap >= ord[i][num]){\n\tcap-=ord[i][num];\n\tord[i][num]=0;\n }else if (cap < ord[i][num]){\n\tord[i][num]-=cap;\n\tcap=0;\n }\n }\n\n now=now+dish[num].time;\n rep(i,ord.size()){\n bool isok=true;\n rep(j,ord[i].size())if (ord[i][j]!=0)isok=false;\n if (isok)ret[i]=min(ret[i],now);\n if (p == i && isok)p++;\n }\n }\n return ret;\n}\n\nint getindex(string a,map<string,int> &M){\n int index = M.size();\n if (M.count(a)==0)M[a]=index;\n return M[a];\n}\n\nmain(){\n int n,m;\n int te=0;\n while(cin>>n>>m && n){\n if( te++)cout << endl;\n vector<state> in(n);\n vector<int> come(m);\n vector<vector<int> > ord(m);\n map<string,int> M;\n \n rep(i,n){\n cin>>in[i].name>>in[i].cap>>in[i].time;\n in[i].num=i;\n }\n\n\n sort(in.begin(),in.end());\n rep(i,n)getindex(in[i].name,M);\n\n rep(i,m){\n cin>>come[i];\n rep(j,n)ord[i].pb(0);\n int k;\n cin>>k;\n rep(j,k){\n\tstring tmp;cin>>tmp;ord[i][getindex(tmp,M)]++;\n }\n }\n\n vector<ll> ans=solve(in,come,ord);\n rep(i,ans.size())cout << ans[i]<<endl;\n }\n return false;\n}","accuracy":1,"time_ms":80,"memory_kb":956,"score_of_the_acc":-0.9441,"final_rank":4},{"submission_id":"aoj_2059_26694","code_snippet":"#include <iostream>\n#include <string>\n#include <map>\n#include <queue>\n#include <algorithm>\nusing namespace std;\n\nenum EVENT{ORDER, COOKED};\n\nclass Event\n{\npublic:\n\tint c,t,s,id;\n\tEVENT e;\n\t\n\tEvent(int c, int t, int s, int id, EVENT e)\n\t:c(c),t(t),e(e),s(s),id(id)\n\t{}\n\t\n\tbool operator<(const Event& a) const\n\t{\n\t\tif(t!=a.t) return t>a.t;\n\t\tif(e!=a.e) return e<a.e;\n\t\tif(c==a.c) return s>a.s;\n\t\treturn c>a.c;\n\t}\n};\n\nclass Order\n{\npublic:\n\tint id,pt;\n\tOrder(int id, int pt)\n\t:id(id),pt(pt)\n\t{}\n\t\n\tbool operator<(const Order& a) const\n\t{\n\t\tif(pt!=a.pt) return pt>a.pt;\n\t\treturn id<a.id;\n\t}\n};\n\nint main()\n{\n\tbool f=true;\n\tint M,N;\n\twhile(cin >> M >> N, (M||N))\n\t{\n\t\tif(!f) cout << endl;\n\t\tf=false;\n\t\t\n\t\tint limit[20], time[20];\n\t\tmap<string, int> d;\n\t\tfor(int i=0; i<M; i++)\n\t\t{\n\t\t\tint l,t;\n\t\t\tstring n;\n\t\t\tcin >> n >> l >> t;\n\t\t\td[n]=i;\n\t\t\t\n\t\t\tlimit[i]=l; time[i]=t;\n\t\t}\n\t\t\n\t\tpriority_queue<Event> q;\n\t\t\n\t\tint order[100],cooked[100]={0},cookid=-1,cooking=0,cooktime=-1,served[100],pretime=-1;\n\t\tfor(int i=0; i<N; i++)\n\t\t{\n\t\t\tint t,o;\n\t\t\tcin >> t >> o;\n\t\t\torder[i]=o;\n\t\t\tvector<Order> seq;\n\t\t\tfor(int j=0; j<o; j++)\n\t\t\t{\n\t\t\t\tstring n;\n\t\t\t\tcin >> n;\n\t\t\t\tseq.push_back(Order(d[n], time[d[n]]));\n\t\t\t}\n\t\t\tsort(seq.begin(), seq.end());\n\t\t\tfor(int j=0; j<seq.size(); j++)\n\t\t\t{\n\t\t\t\tq.push(Event(i,t,j,seq[j].id,ORDER));\n\t\t\t}\n\t\t}\n\t\twhile(!q.empty())\n\t\t{\n\t\t\tEvent e=q.top(); q.pop();\n\t\t\tif(e.e==ORDER)\n\t\t\t{\n\t\t\t\tif(cookid==e.id&&cooking<limit[e.id]&&pretime==e.t||cooking==0)\n\t\t\t\t{\n\t\t\t\t\tint tm=e.t+time[e.id];\n\t\t\t\t\tpretime=e.t;\n\t\t\t\t\tcooktime=tm;\n\t\t\t\t\tcooking++;\n\t\t\t\t\tcookid=e.id;\n\t\t\t\t\tq.push(Event(e.c, tm,e.s, e.id,COOKED));\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tq.push(Event(e.c, cooktime,e.s, e.id,e.e));\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcooking--;\n\t\t\t\tcooked[e.c]++;\n\t\t\t\tif(cooked[e.c]==order[e.c])\n\t\t\t\t\tserved[e.c]=e.t;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i=0; i<N; i++)\n\t\t\tcout << served[i] << endl;\n\t}\n}","accuracy":1,"time_ms":160,"memory_kb":976,"score_of_the_acc":-1.2547,"final_rank":9}],"string":"[\n {\n \"submission_id\": \"aoj_2059_1367835\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 20;\\nconst int MAX_M = 100;\\n\\n/* typedef */\\n\\ntypedef vector<int> vi;\\ntypedef set<int> si;\\ntypedef pair<int,int> pii;\\ntypedef vector<pii> vpii;\\n\\nstruct Menu {\\n int id, limit, time;\\n string name;\\n bool operator<(const Menu& m0) const {\\n return time > m0.time || (time == m0.time && id < m0.id);\\n }\\n void print() {\\n printf(\\\"Menu: id=%d, limit=%d, time=%d, name=%s\\\\n\\\",\\n\\t id, limit, time, name.c_str());\\n }\\n};\\n\\nstruct Order {\\n int id, t, k, mnums[MAX_N];\\n Order() { memset(mnums, 0, sizeof(mnums)); }\\n void print() {\\n printf(\\\"Order: id=%d, t=%d, k=%d: \\\", id, t, k);\\n for (int i = 0; i < MAX_N; i++) {\\n if (i > 0) putchar(',');\\n printf(\\\"%d\\\", mnums[i]);\\n }\\n putchar('\\\\n');\\n }\\n};\\n\\nenum { C_IDLE, C_COOK, C_WAIT };\\nenum { E_ORDER, E_CFIN, E_CST};\\n\\nstruct Event {\\n int t, ev, oid;\\n Event() {}\\n Event(int _t, int _ev, int _oid) : t(_t), ev(_ev), oid(_oid) {}\\n bool operator>(const Event& e0) const {\\n return t > e0.t || (t == e0.t && ev > e0.ev);\\n }\\n void print() { printf(\\\"Event: t=%d, ev=%d, oid=%d\\\\n\\\", t, ev, oid); }\\n};\\n\\n/* global variables */\\n\\nint n, m;\\nMenu menu[MAX_N];\\nOrder orders[MAX_M];\\nint fts[MAX_M], omsums[MAX_N];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n for (bool first = true;; first = false) {\\n cin >> n >> m;\\n if (n == 0) break;\\n\\n for (int i = 0; i < n; i++) {\\n cin >> menu[i].name >> menu[i].limit >> menu[i].time;\\n menu[i].id = i;\\n }\\n sort(menu, menu + n);\\n //for (int i = 0; i < n; i++) menu[i].print();\\n \\n for (int i = 0; i < m; i++) {\\n cin >> orders[i].t >> orders[i].k;\\n orders[i].id = i;\\n for (int j = 0; j < orders[i].k; j++) {\\n\\tstring mname;\\n\\tcin >> mname;\\n\\tfor (int mi = 0; mi < n; mi++)\\n\\t if (menu[mi].name == mname) {\\n\\t orders[i].mnums[mi]++;\\n\\t break;\\n\\t }\\n }\\n }\\n //for (int i = 0; i < m; i++) orders[i].print();\\n\\n priority_queue<Event, vector<Event>, greater<Event> > q;\\n \\n for (int i = 0; i < m; i++)\\n q.push(Event(orders[i].t, E_ORDER, i));\\n\\n int cstat = C_IDLE, cmenu, cnum;\\n vpii clist;\\n si olist;\\n\\n memset(omsums, 0, sizeof(omsums));\\n\\n while (! q.empty()) {\\n Event e = q.top();\\n q.pop();\\n //e.print();\\n\\n // order arrived\\n if (e.ev == E_ORDER) {\\n\\tolist.insert(e.oid);\\n\\n\\tfor (int i = 0; i < n; i++)\\n\\t omsums[i] += orders[e.oid].mnums[i];\\n\\t\\n\\tif (cstat == C_IDLE) {\\n\\t cstat = C_WAIT;\\n\\t q.push(Event(e.t, E_CST, -1));\\n\\t}\\n }\\n\\n // finish cooking\\n else if (e.ev == E_CFIN) {\\n\\tfor (int i = 0; i < clist.size(); i++) {\\n\\t int oid = clist[i].first;\\n\\t int num = clist[i].second;\\n\\t orders[oid].mnums[cmenu] -= num;\\n\\t orders[oid].k -= num;\\n\\t if (orders[oid].k == 0) {\\n\\t olist.erase(oid);\\n\\t fts[oid] = e.t;\\n\\t }\\n\\t}\\n\\n\\tomsums[cmenu] -= cnum;\\n\\t\\n\\tcstat = C_IDLE;\\n\\tif (! olist.empty()) {\\n\\t cstat = C_WAIT;\\n\\t q.push(Event(e.t, E_CST, -1));\\n\\t}\\n }\\n\\n // start cooking\\n else if (e.ev == E_CST) {\\n\\tif (! olist.empty()) {\\n\\t int oid = *(olist.begin());\\n\\t for (cmenu = 0; cmenu < n; cmenu++)\\n\\t if (orders[oid].mnums[cmenu] > 0) break;\\n\\n\\t cnum = omsums[cmenu];\\n\\t if (cnum > menu[cmenu].limit) cnum = menu[cmenu].limit;\\n\\n\\t clist.clear();\\n\\t int num = cnum;\\n\\n\\t for (si::iterator oit = olist.begin();\\n\\t num > 0 && oit != olist.end(); oit++) {\\n\\t int oid = *oit;\\n\\t int onum = orders[oid].mnums[cmenu];\\n\\t if (onum > 0) {\\n\\t if (num > onum) {\\n\\t\\tclist.push_back(pii(oid, onum));\\n\\t\\tnum -= onum;\\n\\t }\\n\\t else {\\n\\t\\tclist.push_back(pii(oid, num));\\n\\t\\tnum = 0;\\n\\t }\\n\\t }\\n\\t }\\n\\n\\t cstat = C_COOK;\\n\\t q.push(Event(e.t + menu[cmenu].time, E_CFIN, -1));\\n\\t}\\n\\telse {\\n\\t cstat = C_IDLE;\\n\\t}\\n }\\n }\\n\\n if (! first) putchar('\\\\n');\\n \\n for (int i = 0; i < m; i++) cout << fts[i] << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1240,\n \"score_of_the_acc\": -0.9253,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2059_773348\",\n \"code_snippet\": \"#include<iostream>\\n#include<map>\\n#include<set>\\n#include<algorithm>\\n#include<cmath>\\n#include<deque>\\n#include<vector>\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define inf (1<<28)\\n#define MAX_N 21\\n#define MAX_M 101\\nusing namespace std;\\ntypedef pair<int,int> ii;\\n\\n\\nii ps[MAX_N];\\nstruct P\\n{\\n int index;\\n bool finish;\\n P(int index=inf,bool finish=false):index(index),finish(finish){}\\n bool operator < (const P& a)const\\n {\\n if(ps[index].second != ps[a.index].second)return ps[index].second > ps[a.index].second;\\n return index < a.index;\\n }\\n};\\n\\n\\nmap<string,int> list;\\nstring names[MAX_N];\\n\\nii order[MAX_M];\\nbool fin[MAX_M];\\nint ans[MAX_M];\\nvector<P> cust[MAX_M];\\nint N,M;\\n\\nint main()\\n{\\n bool f = true;\\n while(cin >> N >> M,N|M)\\n {\\n if(!f)cout << endl;\\n f = false;\\n rep(i,N)\\n\\t{\\n\\t cin >> names[i] >> ps[i].first >> ps[i].second;\\n\\t list[names[i]] = i;\\n\\t}\\n rep(i,M)cust[i].clear(),fin[i] = false,ans[i] = inf;\\n rep(i,M)\\n\\t{\\n\\t int k;\\n\\t cin >> order[i].first >> k;\\n\\t order[i].second = i;\\n\\n\\t rep(j,k)\\n\\t {\\n\\t string name;\\n\\t cin >> name;\\n\\t cust[i].push_back(P(list[name]));\\n\\t }\\n\\t sort(cust[i].begin(),cust[i].end());\\n\\t}\\n\\n sort(order,order+M);\\n\\n\\n\\n int phase = order[0].first;\\n bool update = true;\\n while(update)\\n\\t{\\n\\t //cout << \\\"phase : \\\"<< phase << endl;\\n\\t update = false;\\n\\t int choice = inf;\\n\\t rep(i,M)\\n\\t {\\n\\t int cur = order[i].second;\\n\\t if(fin[cur])continue;\\n\\t if(order[i].first > phase)continue;\\n\\t rep(j,cust[cur].size())\\n\\t\\t{\\n\\t\\t if(cust[cur][j].finish)continue;\\n\\t\\t update = true;\\n\\t\\t choice = cust[cur][j].index;\\n\\t\\t break;\\n\\t\\t}\\n\\t if(update)break;\\n\\t fin[cur] = true;\\n\\t }\\n\\n \\n\\n\\t if(!update)\\n\\t {\\n\\t rep(i,M)\\n\\t\\t{\\n\\t\\t int cur = order[i].second;\\n\\t\\t if(fin[cur])continue;\\n\\t\\t phase = order[i].first;\\n\\t\\t update = true;\\n\\t\\t break;\\n\\t\\t}\\n\\t if(update)continue;\\n\\t break;\\n\\t }\\n\\t //cout << \\\"choice = \\\" << names[choice] <<endl;\\n\\t int S = ps[choice].first;\\n\\n\\n\\t rep(i,M)\\n\\t {\\n\\t int cur = order[i].second;\\n\\t if(fin[cur])continue;\\n\\t if(order[i].first > phase)continue;\\n\\t rep(j,cust[cur].size())\\n\\t\\t{\\n\\t\\t if(!cust[cur][j].finish && S > 0 && cust[cur][j].index == choice)\\n\\t\\t {\\n\\t\\t cust[cur][j].finish = true;\\n\\t\\t S--;\\n\\t\\t }\\n\\t\\t}\\n\\t if(S <= 0)break;\\n\\t }\\n\\n\\t phase += ps[choice].second;\\n\\t rep(i,M)\\n\\t {\\n\\t int cur = order[i].second;\\n\\t if(fin[cur])continue;\\n\\t bool ok = true;\\n\\t rep(j,cust[cur].size())\\n\\t\\t{\\n\\t\\t if(!cust[cur][j].finish)\\n\\t\\t {\\n\\t\\t ok = false;\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t}\\n\\t if(ok)ans[cur] = min(ans[cur],phase),fin[cur] = true;\\n\\t }\\n\\n\\n\\t}\\n\\n rep(i,M)cout << ans[i] << endl;\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1356,\n \"score_of_the_acc\": -1.0084,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2059_609923\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\\\" \\\"; cerr<<endl; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\nstruct Event{\\n // type 0 - order\\n // type 1 - complete\\n int type, time, dish, customer;\\n Event(int ty, int t, int d, int c):\\n type(ty), time(t), dish(d), customer(c) {}\\n bool operator < (const Event& e) const {\\n if(time != e.time) return time > e.time;\\n if(type != e.type) return type > e.type;\\n return dish > e.dish;\\n }\\n};\\nstruct Dish{\\n string name;\\n int limit, time;\\n Dish() {}\\n bool operator < (const Dish& d) const {\\n return time > d.time;\\n }\\n};\\n\\nint main(){\\n int N, M;\\n bool first = true;\\n while(cin >> N >> M && N){\\n if(first) first = false;\\n else cout << endl;\\n vector<Dish> dishes(N);\\n REP(i, N) cin >> dishes[i].name >> dishes[i].limit >> dishes[i].time;\\n stable_sort(dishes.begin(), dishes.end());\\n map<string, int> name_to_index;\\n REP(i, N) name_to_index[dishes[i].name] = i;\\n priority_queue<Event> que;\\n REP(i, M){\\n int T, K; cin >> T >> K;\\n REP(j, K){\\n string name; cin >> name;\\n que.push(Event(0, T, name_to_index[name], i));\\n }\\n }\\n vector<int> answer(M);\\n vector<Event> cook_queue;\\n int cooking = 0;\\n while(!que.empty()){\\n Event e = que.top(); que.pop();\\n if(e.type == 0){\\n //printf(\\\"customer %d order %s : time %d\\\\n\\\", e.customer, dishes[e.dish].name.c_str(), e.time);\\n cook_queue.push_back(Event(0, 0, e.dish, e.customer));\\n }else if(e.type == 1){\\n //printf(\\\"customer %d's %s is finshed: time %d\\\\n\\\", e.customer, dishes[e.dish].name.c_str(), e.time);\\n cooking --;\\n answer[e.customer] = e.time;\\n }\\n if(cooking == 0 && !cook_queue.empty() && (que.empty() || e.time != que.top().time)){\\n // new dish\\n int new_dish = cook_queue[0].dish;\\n for(vector<Event>::iterator it = cook_queue.begin(); it != cook_queue.end(); ){\\n if(it->dish == new_dish){\\n //printf(\\\"customer %d's %s is started : time %d -> %d\\\\n\\\", it->customer, dishes[it->dish].name.c_str(), e.time, e.time + dishes[new_dish].time);\\n que.push(Event(1, e.time + dishes[new_dish].time, it->dish, it->customer));\\n cooking++;\\n it = cook_queue.erase(it);\\n if(cooking >= dishes[new_dish].limit) break;\\n }else{\\n it++;\\n }\\n }\\n assert(cooking <= dishes[new_dish].limit);\\n }\\n }\\n assert(cooking == 0);\\n REP(i, M) cout << answer[i] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1288,\n \"score_of_the_acc\": -0.9597,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2059_472208\",\n \"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, m; // 料理の種類数、注文の数\\n\\nvector<string> name; // 料理の名前\\nmap<string, int> index; // 料理の番号\\nvector<int> limit, makeTime; // 一度に調理できる最大数、調理時間\\n\\nvector<int> come, dishNum; // 来店時間、各注文の料理の数\\nvector<vector<string> > dish; // 注文された料理の名前\\n\\nclass Data\\n{\\npublic:\\n int time, id;\\n int a, b;\\n Data(int time0, int id0, int a0, int b0){\\n time = time0;\\n id = id0;\\n a = a0;\\n b = b0;\\n }\\n bool operator< (const Data& d) const{\\n if(time < d.time)\\n return true;\\n if(time == d.time){\\n if(id == -1)\\n return false;\\n if(d.id == -1)\\n return true;\\n return make_pair(-makeTime[id], id) < make_pair(-makeTime[d.id], d.id);\\n }\\n return false;\\n }\\n};\\n\\nint main()\\n{\\n bool isFirst = true;\\n\\n for(;;){\\n cin >> n >> m;\\n if(n == 0)\\n return 0;\\n\\n if(isFirst)\\n isFirst = false;\\n else\\n cout << endl;\\n\\n name.resize(n);\\n limit.resize(n);\\n makeTime.resize(n);\\n index.clear();\\n for(int i=0; i<n; ++i){\\n cin >> name[i] >> limit[i] >> makeTime[i];\\n index[name[i]] = i;\\n }\\n\\n come.resize(m);\\n dishNum.resize(m);\\n dish.resize(m);\\n multiset<Data> ms1, ms2; // 各種イベント\\n vector<vector<int> > finish(m); // 最後の料理が提供された時間\\n for(int i=0; i<m; ++i){\\n cin >> come[i] >> dishNum[i];\\n dish[i].resize(dishNum[i]);\\n finish[i].resize(dishNum[i], -1);\\n for(int j=0; j<dishNum[i]; ++j){\\n cin >> dish[i][j];\\n ms1.insert(Data(come[i], index[dish[i][j]], i, j));\\n }\\n }\\n\\n vector<queue<pair<int, int> > > q(n); // 各料理の注文のキュー\\n bool isFree = true; // 料理人が次の調理を始められるかどうか\\n while(!ms1.empty()){\\n int time = ms1.begin()->time;\\n while(!ms1.empty() && time == ms1.begin()->time){\\n Data d = *ms1.begin();\\n ms1.erase(ms1.begin());\\n\\n if(d.id == -1){\\n isFree = true;\\n }else{\\n q[d.id].push(make_pair(d.a, d.b));\\n ms2.insert(d);\\n }\\n }\\n\\n while(isFree && !ms2.empty()){\\n Data d = *ms2.begin();\\n ms2.erase(ms2.begin());\\n\\n if(finish[d.a][d.b] == -1){\\n int rest = limit[d.id];\\n while(rest > 0 && !q[d.id].empty()){\\n int a = q[d.id].front().first;\\n int b = q[d.id].front().second;\\n q[d.id].pop();\\n\\n if(finish[a][b] == -1){\\n finish[a][b] = time + makeTime[d.id];\\n -- rest;\\n }\\n }\\n isFree = false;\\n ms1.insert(Data(time + makeTime[d.id], -1, -1, -1));\\n }\\n }\\n }\\n\\n for(int i=0; i<m; ++i)\\n cout << *max_element(finish[i].begin(), finish[i].end()) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1396,\n \"score_of_the_acc\": -1.037,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2059_411027\",\n \"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 menu{\\n\\tchar name[21];\\n\\tint lim,t;\\n};\\n\\nint n;\\nmenu M[20];\\n\\nbool cmp(int a,int b){\\n\\treturn M[a].t>M[b].t || M[a].t==M[b].t && a<b;\\n}\\n\\nint main(){\\n\\tfor(int test=0,m;scanf(\\\"%d%d\\\",&n,&m),n;test++){\\n\\t\\tif(test>0) puts(\\\"\\\");\\n\\n\\t\\trep(i,n) scanf(\\\"%s%d%d\\\",&M[i].name,&M[i].lim,&M[i].t);\\n\\n\\t\\tpair< int,vector<int> > order[100]; // <到着時刻,注文内容>\\n\\t\\trep(i,m){\\n\\t\\t\\tint k; scanf(\\\"%d%d\\\",&order[i].first,&k);\\n\\t\\t\\torder[i].second.resize(k);\\n\\t\\t\\trep(j,k){\\n\\t\\t\\t\\tchar name[21]; scanf(\\\"%s\\\",name);\\n\\t\\t\\t\\trep(l,n) if(strcmp(name,M[l].name)==0) { order[i].second[j]=l; break; }\\n\\t\\t\\t}\\n\\t\\t\\tsort(order[i].second.begin(),order[i].second.end(),cmp);\\n\\t\\t}\\n\\n\\t\\tint fin[100]={},ans[100];\\n\\n\\t\\tdeque< pair<int,int> > wait; // <注文した人,調理待ちの料理>\\n\\t\\tint cooking=0; // 今調理中かどうか\\n\\t\\tpriority_queue< pair<int,int> > Q; // <-time,event_type>\\n\\t\\trep(i,m) Q.push(make_pair(-order[i].first,i+1));\\n\\t\\twhile(!Q.empty()){\\n\\t\\t\\tint t=-Q.top().first,type=Q.top().second; Q.pop();\\n\\n\\t\\t\\t// 来客\\n\\t\\t\\tif(type>0){\\n\\t\\t\\t\\ttype--;\\n\\n\\t\\t\\t\\tconst vector<int> &O=order[type].second;\\n\\t\\t\\t\\trep(i,O.size()) wait.push_back(make_pair(type,O[i]));\\n\\t\\t\\t}\\n\\t\\t\\t// 料理ができた\\n\\t\\t\\telse{\\n\\t\\t\\t\\ttype*=-1;\\n\\t\\t\\t\\ttype--;\\n\\n\\t\\t\\t\\tfin[type]++;\\n\\t\\t\\t\\tif(fin[type]==order[type].second.size()) ans[type]=t;\\n\\t\\t\\t\\tcooking--;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(cooking==0 && !wait.empty()){\\n\\t\\t\\t\\tint a=wait.front().first,menuid=wait.front().second; wait.pop_front();\\n\\t\\t\\t\\tQ.push(make_pair(-(t+M[menuid].t),-(a+1)));\\n\\t\\t\\t\\tcooking++;\\n\\n\\t\\t\\t\\tint cnt=1;\\n\\t\\t\\t\\trep(i,wait.size()) if(wait[i].second==menuid && cnt<M[menuid].lim) {\\n\\t\\t\\t\\t\\tQ.push(make_pair(-(t+M[menuid].t),-(wait[i].first+1)));\\n\\t\\t\\t\\t\\twait.erase(wait.begin()+i);\\n\\t\\t\\t\\t\\ti--;\\n\\t\\t\\t\\t\\tcnt++;\\n\\t\\t\\t\\t\\tcooking++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\trep(i,m) printf(\\\"%d\\\\n\\\",ans[i]);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2059_392488\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <string>\\n\\nusing namespace std;\\n\\nstruct Dish{\\n string name;\\n int time;\\n int limit;\\n int orderTime;\\n int dishIdx;\\n int whois;\\n int ordNum;\\n Dish(){}\\n Dish(string _name,int _time,int _limit,int _orderTime,int _dishIdx,int _whois,int _ordNum){\\n name=_name;\\n time=_time;\\n limit=_limit;\\n orderTime=_orderTime;\\n dishIdx=_dishIdx;\\n whois=_whois;\\n ordNum=_ordNum;\\n }\\n bool operator<(const Dish&dh)const{\\n if(dh.orderTime!=orderTime)return dh.orderTime>this->orderTime;\\n else if(dh.time!=this->time)return dh.time<this->time;\\n else if(dh.dishIdx!=this->dishIdx)return dh.dishIdx>this->dishIdx;\\n else if(dh.whois!=this->whois)return dh.whois>this->whois;\\n return dh.ordNum<this->ordNum;\\n }\\n};\\nstruct Event{\\n int time;\\n int idx;\\n int dishIdx;\\n int kind;\\n vector<int> who;\\n Event(){}\\n Event(int _time,int _idx,int _dishIdx,int _kind){\\n time=_time;\\n idx=_idx;\\n dishIdx=_dishIdx;\\n kind=_kind;\\n }\\n bool operator<(const Event&e)const{\\n if(e.time!=this->time)return e.time<this->time;\\n return (e.kind<this->kind);\\n }\\n};\\n\\nset<Dish> waitDish;\\nint N,M;\\nDish ds[101];\\nmap<string,int> ms;\\nint T[101];\\nint K[101];\\nint leftDish[101];\\nint finTimes[101];\\nbool need[100001];\\nvector<string> order[101];\\n\\nint main(){\\n bool fst=true;\\n while(cin>>N>>M&&(N|M)){\\n if(fst)fst=false;\\n else cout<<endl;\\n waitDish.clear();\\n ms.clear();\\n for(int i=0;i<N;i++){\\n cin>>ds[i].name>>ds[i].limit>>ds[i].time;\\n ms[ds[i].name]=i;\\n ds[i].dishIdx=i;\\n }\\n for(int i=0;i<M;i++){\\n order[i].clear();\\n cin>>T[i];\\n cin>>K[i];\\n leftDish[i]=K[i];\\n for(int j=0;j<K[i];j++){\\n string str;\\n cin>>str;\\n order[i].push_back(str);\\n }\\n }\\n priority_queue<Event> pq;\\n bool isCook=false;\\n for(int i=0;i<M;i++){\\n pq.push(Event(T[i],i,0,0));\\n }\\n while(pq.size()){\\n Event e=pq.top();pq.pop();\\n if(e.kind==0){\\n for(int j=0;j<K[e.idx];j++){\\n int dk=ms[order[e.idx][j]];\\n Dish tmp=ds[dk];\\n tmp.whois=e.idx;\\n tmp.orderTime=e.time;\\n tmp.ordNum=j;\\n waitDish.insert(tmp);\\n }\\n Event ne=Event(e.time,0,0,2);\\n pq.push(ne);\\n }\\n else if(e.kind==1){\\n int dkind=e.idx;\\n for(int i=0;i<e.who.size();i++){\\n int user=e.who[i];\\n leftDish[user]--;\\n if(leftDish[user]==0)\\n finTimes[user]=e.time;\\n }\\n isCook=false;\\n Event ne=Event(e.time,0,0,2);\\n pq.push(ne);\\n }\\n else{\\n if(isCook||waitDish.size()==0)continue;\\n isCook=true;\\n Dish d=*(waitDish.begin());\\n int lim=(waitDish.begin())->limit;\\n Event ne=Event(e.time+(waitDish.begin())->time,0,d.dishIdx,1);\\n vector<Dish> tmp;\\n for(set<Dish>::iterator it=waitDish.begin();it!=waitDish.end();it++)\\n tmp.push_back(*it);\\n vector<int> idxs;\\n for(int i=0;i<tmp.size();i++){\\n if(lim>0&&tmp[i].dishIdx==d.dishIdx){\\n ne.who.push_back(tmp[i].whois);\\n lim--;\\n }\\n else idxs.push_back(i);\\n }\\n waitDish.clear();\\n for(int i=0;i<idxs.size();i++){\\n int cur=idxs[i];\\n waitDish.insert(tmp[cur]);\\n }\\n pq.push(ne);\\n }\\n }\\n for(int i=0;i<M;i++)\\n cout<<finTimes[i]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -1,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2059_392485\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <string>\\n\\nusing namespace std;\\n\\nstruct Dish{\\n string name;\\n int time;\\n int limit;\\n int orderTime;\\n int dishIdx;\\n int whois;\\n int ordNum;\\n bool operator<(const Dish&dh)const{\\n if(dh.orderTime!=orderTime)return dh.orderTime>this->orderTime;\\n else if(dh.time!=this->time)return dh.time<this->time;\\n else if(dh.dishIdx!=this->dishIdx)return dh.dishIdx>this->dishIdx;\\n else if(dh.whois!=this->whois)return dh.whois>this->whois;\\n return dh.ordNum<this->ordNum;\\n }\\n};\\nstruct Event{\\n int time;\\n int idx;\\n int dishIdx;\\n int kind;\\n vector<int> who;\\n bool operator<(const Event&e)const{\\n if(e.time!=this->time)return e.time<this->time;\\n return (e.kind<this->kind);\\n }\\n};\\n\\nset<Dish> waitDish;\\nint N,M;\\nDish ds[101];\\nmap<string,int> ms;\\nint T[101];\\nint K[101];\\nint leftDish[101];\\nint finTimes[101];\\nbool need[100001];\\nvector<string> order[101];\\n\\nint main(){\\n bool fst=true;\\n while(cin>>N>>M&&(N|M)){\\n if(fst)fst=false;\\n else cout<<endl;\\n waitDish.clear();\\n ms.clear();\\n for(int i=0;i<N;i++){\\n cin>>ds[i].name>>ds[i].limit>>ds[i].time;\\n ms[ds[i].name]=i;\\n ds[i].dishIdx=i;\\n }\\n for(int i=0;i<M;i++){\\n order[i].clear();\\n cin>>T[i];\\n cin>>K[i];\\n leftDish[i]=K[i];\\n for(int j=0;j<K[i];j++){\\n string str;\\n cin>>str;\\n order[i].push_back(str);\\n }\\n }\\n priority_queue<Event> pq;\\n bool isCook=false;\\n for(int i=0;i<M;i++){\\n Event e;\\n e.kind=0;\\n e.idx=i;\\n e.time=T[i];\\n pq.push(e);\\n }\\n while(pq.size()){\\n Event e=pq.top();pq.pop();\\n if(e.kind==0){\\n for(int j=0;j<K[e.idx];j++){\\n int dk=ms[order[e.idx][j]];\\n Dish tmp=ds[dk];\\n tmp.whois=e.idx;\\n tmp.orderTime=e.time;\\n tmp.ordNum=j;\\n waitDish.insert(tmp);\\n }\\n Event ne;\\n ne.time=e.time;\\n ne.kind=2;\\n pq.push(ne);\\n }\\n else if(e.kind==1){\\n int dkind=e.idx;\\n for(int i=0;i<e.who.size();i++){\\n int user=e.who[i];\\n leftDish[user]--;\\n if(leftDish[user]==0){\\n finTimes[user]=e.time;\\n }\\n }\\n isCook=false;\\n Event ne;\\n ne.time=e.time;\\n ne.kind=2;\\n pq.push(ne);\\n }\\n else{\\n if(isCook||waitDish.size()==0)continue;\\n isCook=true;\\n Dish d=*(waitDish.begin());\\n int lim=(waitDish.begin())->limit;\\n Event ne;ne.kind=1;ne.dishIdx=d.dishIdx;\\n ne.time=e.time+(waitDish.begin())->time;\\n vector<Dish> tmp;\\n for(set<Dish>::iterator it=waitDish.begin();it!=waitDish.end();it++){\\n tmp.push_back(*it);\\n }\\n vector<int> idxs;\\n for(int i=0;i<tmp.size();i++){\\n if(lim>0&&tmp[i].dishIdx==d.dishIdx){\\n ne.who.push_back(tmp[i].whois);\\n lim--;\\n }\\n else idxs.push_back(i);\\n }\\n waitDish.clear();\\n for(int i=0;i<idxs.size();i++){\\n int cur=idxs[i];\\n waitDish.insert(tmp[cur]);\\n }\\n pq.push(ne);\\n }\\n }\\n for(int i=0;i<M;i++)\\n cout<<finTimes[i]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 1048,\n \"score_of_the_acc\": -1.7507,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2059_392484\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <string>\\n\\nusing namespace std;\\n\\nstruct Dish{\\n string name;\\n int time;\\n int limit;\\n int orderTime;\\n int dishIdx;\\n int whois;\\n int ordNum;\\n bool operator<(const Dish&dh)const{\\n if(dh.orderTime!=orderTime)return dh.orderTime>this->orderTime;\\n else if(dh.time!=this->time)return dh.time<this->time;\\n else if(dh.dishIdx!=this->dishIdx)return dh.dishIdx>this->dishIdx;\\n else if(dh.whois!=this->whois)return dh.whois>this->whois;\\n return dh.ordNum<this->ordNum;\\n }\\n};\\nstruct Event{\\n int time;\\n int idx;\\n int dishIdx;\\n int kind;\\n vector<int> who;\\n bool operator<(const Event&e)const{\\n if(e.time<this->time)return true;\\n else if(e.time>this->time)return false;\\n return (e.kind<this->kind);\\n }\\n};\\n\\nset<Dish> waitDish;\\nint N,M;\\nDish ds[101];\\nmap<string,int> ms;\\nint T[101];\\nint K[101];\\nint leftDish[101];\\nint finTimes[101];\\nbool need[100001];\\nvector<string> order[101];\\n\\nint main(){\\n bool fst=true;\\n while(cin>>N>>M&&(N|M)){\\n if(fst)fst=false;\\n else cout<<endl;\\n waitDish.clear();\\n ms.clear();\\n for(int i=0;i<N;i++){\\n cin>>ds[i].name>>ds[i].limit>>ds[i].time;\\n ms[ds[i].name]=i;\\n ds[i].dishIdx=i;\\n }\\n for(int i=0;i<M;i++){\\n order[i].clear();\\n cin>>T[i];\\n cin>>K[i];\\n leftDish[i]=K[i];\\n for(int j=0;j<K[i];j++){\\n string str;\\n cin>>str;\\n order[i].push_back(str);\\n }\\n }\\n priority_queue<Event> pq;\\n bool isCook=false;\\n for(int i=0;i<M;i++){\\n Event e;\\n e.kind=0;\\n e.idx=i;\\n e.time=T[i];\\n pq.push(e);\\n }\\n while(pq.size()){\\n Event e=pq.top();pq.pop();\\n if(e.kind==0){\\n for(int j=0;j<K[e.idx];j++){\\n int dk=ms[order[e.idx][j]];\\n Dish tmp=ds[dk];\\n tmp.whois=e.idx;\\n tmp.orderTime=e.time;\\n tmp.ordNum=j;\\n waitDish.insert(tmp);\\n }\\n Event ne;\\n ne.time=e.time;\\n ne.kind=2;\\n pq.push(ne);\\n }\\n else if(e.kind==1){\\n int dkind=e.idx;\\n for(int i=0;i<e.who.size();i++){\\n int user=e.who[i];\\n leftDish[user]--;\\n if(leftDish[user]==0){\\n finTimes[user]=e.time;\\n }\\n }\\n isCook=false;\\n Event ne;\\n ne.time=e.time;\\n ne.kind=2;\\n pq.push(ne);\\n }\\n else{\\n if(isCook||waitDish.size()==0)continue;\\n isCook=true;\\n Dish d=*(waitDish.begin());\\n int lim=(waitDish.begin())->limit;\\n Event ne;ne.kind=1;ne.dishIdx=d.dishIdx;\\n ne.time=e.time+(waitDish.begin())->time;\\n vector<Dish> tmp;\\n for(set<Dish>::iterator it=waitDish.begin();it!=waitDish.end();it++){\\n tmp.push_back(*it);\\n }\\n vector<int> idxs;\\n for(int i=0;i<tmp.size();i++){\\n if(lim>0&&tmp[i].dishIdx==d.dishIdx){\\n ne.who.push_back(tmp[i].whois);\\n lim--;\\n }\\n else idxs.push_back(i);\\n }\\n waitDish.clear();\\n for(int i=0;i<idxs.size();i++){\\n int cur=idxs[i];\\n waitDish.insert(tmp[cur]);\\n }\\n pq.push(ne);\\n }\\n }\\n for(int i=0;i<M;i++)\\n cout<<finTimes[i]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 1048,\n \"score_of_the_acc\": -1.7507,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2059_392452\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <string>\\n\\nusing namespace std;\\n\\nstruct Dish{\\n string name;\\n int time;\\n int limit;\\n int orderTime;\\n int dishIdx;\\n int whois;\\n int ordNum;\\n bool operator<(const Dish&dh)const{\\n if(dh.orderTime>this->orderTime)return true;\\n else if(dh.orderTime<this->orderTime)return false;\\n else if(dh.time<this->time)return true;\\n else if(dh.time>this->time)return false;\\n else if(dh.dishIdx>this->dishIdx)return true;\\n else if(dh.dishIdx<this->dishIdx)return false;\\n else if(dh.whois>this->whois)return true;\\n else if(dh.whois<this->whois)return false;\\n return dh.ordNum<this->ordNum;\\n }\\n};\\nstruct Event{\\n int time;\\n int idx;\\n int dishIdx;\\n int kind;\\n vector<int> who;\\n bool operator<(const Event&e)const{\\n if(e.time<this->time)return true;\\n else if(e.time>this->time)return false;\\n return (e.kind<this->kind);\\n }\\n};\\n\\nset<Dish> waitDish;\\nint N,M;\\nDish ds[101];\\nmap<string,int> ms;\\nint T[101];\\nint K[101];\\nint leftDish[101];\\nint finTimes[101];\\nbool need[100001];\\nvector<string> order[101];\\n\\nint main(){\\n bool fst=true;\\n while(cin>>N>>M&&(N|M)){\\n if(fst)fst=false;\\n else cout<<endl;\\n waitDish.clear();\\n ms.clear();\\n for(int i=0;i<N;i++){\\n cin>>ds[i].name>>ds[i].limit>>ds[i].time;\\n ms[ds[i].name]=i;\\n ds[i].dishIdx=i;\\n }\\n for(int i=0;i<M;i++){\\n order[i].clear();\\n cin>>T[i];\\n cin>>K[i];\\n leftDish[i]=K[i];\\n for(int j=0;j<K[i];j++){\\n string str;\\n cin>>str;\\n order[i].push_back(str);\\n }\\n }\\n priority_queue<Event> pq;\\n bool isCook=false;\\n for(int i=0;i<M;i++){\\n Event e;\\n e.kind=0;\\n e.idx=i;\\n e.time=T[i];\\n pq.push(e);\\n }\\n while(pq.size()){\\n Event e=pq.top();pq.pop();\\n if(e.kind==0){\\n for(int j=0;j<K[e.idx];j++){\\n int dk=ms[order[e.idx][j]];\\n Dish tmp=ds[dk];\\n tmp.whois=e.idx;\\n tmp.orderTime=e.time;\\n tmp.ordNum=j;\\n waitDish.insert(tmp);\\n }\\n Event ne;\\n ne.time=e.time;\\n ne.kind=2;\\n pq.push(ne);\\n }\\n else if(e.kind==1){\\n int dkind=e.idx;\\n for(int i=0;i<e.who.size();i++){\\n int user=e.who[i];\\n leftDish[user]--;\\n if(leftDish[user]==0){\\n finTimes[user]=e.time;\\n }\\n }\\n isCook=false;\\n Event ne;\\n ne.time=e.time;\\n ne.kind=2;\\n pq.push(ne);\\n }\\n else{\\n if(isCook||waitDish.size()==0)continue;\\n isCook=true;\\n Dish d=*(waitDish.begin());\\n int lim=(waitDish.begin())->limit;\\n Event ne;ne.kind=1;ne.dishIdx=d.dishIdx;\\n ne.time=e.time+(waitDish.begin())->time;\\n vector<Dish> tmp;\\n for(set<Dish>::iterator it=waitDish.begin();it!=waitDish.end();it++){\\n tmp.push_back(*it);\\n }\\n vector<int> idxs;\\n for(int i=0;i<tmp.size();i++){\\n if(lim>0&&tmp[i].dishIdx==d.dishIdx){\\n ne.who.push_back(tmp[i].whois);\\n lim--;\\n }\\n else idxs.push_back(i);\\n }\\n waitDish.clear();\\n for(int i=0;i<idxs.size();i++){\\n int cur=idxs[i];\\n waitDish.insert(tmp[cur]);\\n }\\n pq.push(ne);\\n }\\n }\\n for(int i=0;i<M;i++)\\n cout<<finTimes[i]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 1048,\n \"score_of_the_acc\": -1.7507,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2059_392446\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <string>\\n\\nusing namespace std;\\n\\nstruct Dish{\\n string name;\\n int time;\\n int limit;\\n int orderTime;\\n int idx;\\n int whois;\\n int ordNum;\\n bool operator<(const Dish&dh)const{\\n if(dh.orderTime>this->orderTime)return true;\\n else if(dh.orderTime<this->orderTime)return false;\\n else if(dh.time<this->time)return true;\\n else if(dh.time>this->time)return false;\\n else if(dh.idx>this->idx)return true;\\n else if(dh.idx<this->idx)return false;\\n else if(dh.whois>this->whois)return true;\\n else if(dh.whois<this->whois)return false;\\n return dh.ordNum<this->ordNum;\\n }\\n};\\nstruct Event{\\n int time;\\n int idx;\\n int kind;\\n vector<int> who;\\n bool operator<(const Event&e)const{\\n if(e.time<this->time)return true;\\n else if(e.time>this->time)return false;\\n return (e.kind<this->kind);\\n }\\n};\\n\\nset<Dish> waitDish;\\nint N,M;\\nDish ds[101];\\nmap<string,int> ms;\\nint T[101];\\nint K[101];\\nint leftDish[101];\\nint finTimes[101];\\nbool need[100001];\\nvector<string> order[101];\\n\\nint main(){\\n bool fst=true;\\n while(cin>>N>>M&&(N|M)){\\n if(fst)fst=false;\\n else cout<<endl;\\n waitDish.clear();\\n ms.clear();\\n for(int i=0;i<N;i++){\\n cin>>ds[i].name>>ds[i].limit>>ds[i].time;\\n ms[ds[i].name]=i;\\n ds[i].idx=i;\\n }\\n for(int i=0;i<M;i++){\\n order[i].clear();\\n cin>>T[i];\\n cin>>K[i];\\n leftDish[i]=K[i];\\n for(int j=0;j<K[i];j++){\\n string str;\\n cin>>str;\\n order[i].push_back(str);\\n }\\n }\\n priority_queue<Event> pq;\\n bool isCook=false;\\n for(int i=0;i<M;i++){\\n Event e;\\n e.kind=0;\\n e.idx=i;\\n e.time=T[i];\\n pq.push(e);\\n }\\n while(pq.size()){\\n Event e=pq.top();pq.pop();\\n if(e.kind==0){\\n for(int j=0;j<K[e.idx];j++){\\n int dk=ms[order[e.idx][j]];\\n Dish tmp=ds[dk];\\n tmp.whois=e.idx;\\n tmp.orderTime=e.time;\\n tmp.ordNum=j;\\n waitDish.insert(tmp);\\n }\\n Event ne;\\n ne.time=e.time;\\n ne.kind=2;\\n pq.push(ne);\\n }\\n else if(e.kind==1){\\n int dkind=e.idx;\\n for(int i=0;i<e.who.size();i++){\\n int user=e.who[i];\\n leftDish[user]--;\\n if(leftDish[user]==0){\\n finTimes[user]=e.time;\\n }\\n }\\n isCook=false;\\n Event ne;\\n ne.time=e.time;\\n ne.kind=2;\\n pq.push(ne);\\n }\\n else{\\n if(isCook||waitDish.size()==0)continue;\\n isCook=true;\\n Dish d=*(waitDish.begin());\\n int lim=(waitDish.begin())->limit;\\n Event ne;ne.kind=1;ne.idx=d.idx;\\n ne.time=e.time+(waitDish.begin())->time;\\n vector<Dish> tmp;\\n for(set<Dish>::iterator it=waitDish.begin();it!=waitDish.end();it++){\\n tmp.push_back(*it);\\n }\\n vector<int> idxs;\\n for(int i=0;i<tmp.size();i++){\\n if(lim>0&&tmp[i].idx==d.idx){\\n ne.who.push_back(tmp[i].whois);\\n lim--;\\n }\\n else idxs.push_back(i);\\n }\\n waitDish.clear();\\n for(int i=0;i<idxs.size();i++){\\n int cur=idxs[i];\\n waitDish.insert(tmp[cur]);\\n }\\n pq.push(ne);\\n }\\n }\\n for(int i=0;i<M;i++)\\n cout<<finTimes[i]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 1052,\n \"score_of_the_acc\": -1.7536,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2059_392445\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <string>\\n\\nusing namespace std;\\n\\n/*\\n客がくる順番に注文を処理\\n客の注文は、もっとも時間がかかる料理から処理\\nおなじ時間の場合は、料理のindexが小さい方を先に処理\\nまた、ある料理を調理開始する際,\\nキューに同じ料理があれば、同時に料理する\\nただし同時に料理可能な量は限られる\\n*/\\nstruct Dish{\\n string name;\\n int time;\\n int limit;\\n int orderTime;\\n // 料理のidx\\n int idx;\\n // 注文した客のidx\\n int whois;\\n int ordNum;\\n // かかる時間が長い順番でソート\\n // 同じならidxで小さい順番にソート\\n bool operator<(const Dish&dh)const{\\n if(dh.orderTime>this->orderTime)return true;\\n else if(dh.orderTime<this->orderTime)return false;\\n else if(dh.time<this->time)return true;\\n else if(dh.time>this->time)return false;\\n else if(dh.idx>this->idx)return true;\\n else if(dh.idx<this->idx)return false;\\n // さらに同じなら、注文した客のidx順で取る\\n else if(dh.whois>this->whois)return true;\\n else if(dh.whois<this->whois)return false;\\n return dh.ordNum<this->ordNum;\\n }\\n};\\n\\n/*\\n{客が到着,\\n料理終了,\\n料理開始}\\nのイベントを登録\\n優先順位はこの順番で\\n*/\\nstruct Event{\\n int time;\\n // 料理の種類\\n int idx;\\n // kind=0 -> 客が到着,kind=1 -> 料理終了\\n // kind=2 -> 料理開始\\n int kind;\\n // どの客の料理か\\n vector<int> who;\\n // 時間の小さい方を優先\\n // 同じならば,優先順位が高いeventを優先\\n bool operator<(const Event&e)const{\\n if(e.time<this->time)return true;\\n else if(e.time>this->time)return false;\\n return (e.kind<this->kind);\\n }\\n};\\n\\n// 料理は客の頼んだ順番に関係なく\\n// 今登録されている料理の情報に依存して決定される\\nset<Dish> waitDish;\\nint N,M;\\nDish ds[101];\\nmap<string,int> ms;\\nint T[101];\\nint K[101];\\nint leftDish[101];\\nint finTimes[101];\\nbool need[100001];\\nvector<string> order[101];\\n\\nint main(){\\n bool fst=true;\\n while(cin>>N>>M&&(N|M)){\\n if(fst)fst=false;\\n else cout<<endl;\\n waitDish.clear();\\n ms.clear();\\n for(int i=0;i<N;i++){\\n cin>>ds[i].name>>ds[i].limit>>ds[i].time;\\n ms[ds[i].name]=i;\\n ds[i].idx=i;\\n }\\n for(int i=0;i<M;i++){\\n order[i].clear();\\n cin>>T[i];\\n cin>>K[i];\\n // 残りの料理量\\n leftDish[i]=K[i];\\n for(int j=0;j<K[i];j++){\\n string str;\\n cin>>str;\\n order[i].push_back(str);\\n }\\n }\\n // 料理終了時か,客到着時に料理を開始\\n priority_queue<Event> pq;\\n bool isCook=false;\\n // 客到着イベント登録\\n for(int i=0;i<M;i++){\\n Event e;\\n e.kind=0;\\n e.idx=i;\\n e.time=T[i];\\n pq.push(e);\\n }\\n while(pq.size()){\\n Event e=pq.top();pq.pop();\\n // 客到着\\n if(e.kind==0){\\n // 料理を登録\\n for(int j=0;j<K[e.idx];j++){\\n int dk=ms[order[e.idx][j]];\\n Dish tmp=ds[dk];\\n tmp.whois=e.idx;\\n tmp.orderTime=e.time;\\n tmp.ordNum=j;\\n waitDish.insert(tmp);\\n }\\n // 料理開始イベントを登録\\n Event ne;\\n ne.time=e.time;\\n ne.kind=2;\\n pq.push(ne);\\n }\\n // 料理終了\\n else if(e.kind==1){\\n // 料理の種類\\n int dkind=e.idx;\\n // 登録してある料理を終了させる\\n for(int i=0;i<e.who.size();i++){\\n // ユーザのid\\n int user=e.who[i];\\n leftDish[user]--;\\n // 注文終了時間を登録\\n if(leftDish[user]==0){\\n finTimes[user]=e.time;\\n }\\n }\\n isCook=false;\\n // 料理開始イベントを登録\\n Event ne;\\n ne.time=e.time;\\n ne.kind=2;\\n pq.push(ne);\\n }\\n // 料理開始\\n else{\\n // すでに料理を開始している\\n // または待ち料理が存在しない\\n if(isCook||waitDish.size()==0)continue;\\n isCook=true;\\n Dish d=*(waitDish.begin());\\n int lim=(waitDish.begin())->limit;\\n Event ne;ne.kind=1;ne.idx=d.idx;\\n ne.time=e.time+(waitDish.begin())->time;\\n vector<Dish> tmp;\\n for(set<Dish>::iterator it=waitDish.begin();it!=waitDish.end();it++){\\n tmp.push_back(*it);\\n }\\n vector<int> idxs;\\n for(int i=0;i<tmp.size();i++){\\n if(lim>0&&tmp[i].idx==d.idx){\\n ne.who.push_back(tmp[i].whois);\\n lim--;\\n }\\n else idxs.push_back(i);\\n }\\n waitDish.clear();\\n for(int i=0;i<idxs.size();i++){\\n int cur=idxs[i];\\n waitDish.insert(tmp[cur]);\\n }\\n //// limが0になるまで\\n //ne.who.push_back(waitDish.begin()->whois);\\n //lim--;\\n //waitDish.erase(waitDish.begin());\\n //for(set<Dish>::iterator it=waitDish.begin();it!=waitDish.end();it++){\\n // if(lim==0)break;\\n // // 同じ料理ならば、登録\\n // if(it->idx==d.idx){\\n // ne.who.push_back(it->whois);\\n // lim--;\\n // waitDish.erase(it);\\n // it=waitDish.begin();\\n // }\\n //}\\n //// イベントを登録\\n pq.push(ne);\\n }\\n }\\n // 終了時間を表示\\n for(int i=0;i<M;i++)\\n cout<<finTimes[i]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 1052,\n \"score_of_the_acc\": -1.7536,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2059_354149\",\n \"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\\nstruct Menu {\\n int limit, time;\\n int id;\\n Menu(int limit, int time, int id) : limit(limit), time(time), id(id) {}\\n Menu() {}\\n};\\nbool operator<(const Menu &a, const Menu &b) {\\n return a.time != b.time ? a.time > b.time : a.id < b.id;\\n};\\n\\nstruct Order {\\n int T;\\n Menu menu;\\n int id;\\n Order(int T, Menu menu, int id) : T(T), menu(menu), id(id) {}\\n Order() {}\\n};\\nbool operator<(const Order &a, const Order &b) {\\n return a.T != b.T ? a.T < b.T : a.menu < b.menu;\\n}\\n\\nMenu menu[20];\\nOrder order[1000];\\nint ok[1000]; // »Ì¶ðoµIíÁ½Ô\\nint K[100];\\nint endTime[100][10];\\n\\nint main() {\\n int n, m;\\n int hoge = 0;\\n while(cin >> n >> m, n || m) {\\n if (hoge++) cout << endl;\\n map<string, int> mp;\\n REP(i, n) {\\n string name;\\n cin >> name >> menu[i].limit >> menu[i].time;\\n menu[i].id = i;\\n mp[name] = i;\\n }\\n int endnum[m];\\n int num = 0;\\n REP(i, m) {\\n int T;\\n cin >> T;\\n cin >> K[i];\\n REP(j, K[i]) {\\n string dish;\\n cin >> dish;\\n order[num] = Order(T, menu[mp[dish]], i);\\n num++;\\n }\\n }\\n sort(order, order+num);\\n ll nowtime = 0;\\n memset(ok, -1, sizeof(ok));\\n REP(i, num) {\\n if (ok[i] >= 0) continue;\\n nowtime = max(nowtime, (ll)order[i].T);\\n //cout << i << \\\" \\\" << nowtime << \\\" \\\" << order[i].id << \\\" \\\" << order[i].menu.time << \\\" \\\" << order[i].menu.id << endl;\\n ok[i] = nowtime + order[i].menu.time;\\n int cnt = 1;\\n for (int j=i+1; j<num && order[j].T<=nowtime && cnt<order[i].menu.limit; ++j) {\\n if (order[j].menu.id == order[i].menu.id) {\\n //cout << j << endl;\\n ok[j] = nowtime + order[i].menu.time;\\n cnt++;\\n }\\n }\\n nowtime += order[i].menu.time;\\n }\\n int ans[m];\\n memset(ans, 0, sizeof(ans));\\n REP(i, num) {\\n ans[order[i].id] = max(ans[order[i].id], ok[i]);\\n }\\n REP(i, m)\\n cout << ans[i] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 964,\n \"score_of_the_acc\": -0.8017,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2059_134434\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<map>\\nusing namespace std;\\n#define REP(i,b,n) for(int i=b;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define pb push_back\\n\\ntypedef long long ll;\\nclass state{\\npublic:\\n int time,num;\\n int cap;\\n string name;\\n bool operator<(const state& a)const{\\n if (time != a.time)return time >a.time;\\n return num < a.num;\\n }\\n};\\n\\nvector<ll> solve(vector<state> &dish,\\n\\t\\t vector<int> &come,vector<vector<int> >&ord){\\n ll now = 0;\\n int p=0;\\n vector<ll> ret(come.size(),(1LL)<<50);\\n while(p < come.size()){\\n if (come[p] > now)now=come[p];\\n\\n int cap=-1,num=-1;\\n rep(i,dish.size()){\\n if(ord[p][i] != 0){\\n\\tnum=i;\\n\\tcap=dish[i].cap;\\n\\tbreak;\\n }\\n }\\n\\n REP(i,p,ord.size() && cap){\\n if (now < come[i])break;\\n if (cap >= ord[i][num]){\\n\\tcap-=ord[i][num];\\n\\tord[i][num]=0;\\n }else if (cap < ord[i][num]){\\n\\tord[i][num]-=cap;\\n\\tcap=0;\\n }\\n }\\n\\n now=now+dish[num].time;\\n rep(i,ord.size()){\\n bool isok=true;\\n rep(j,ord[i].size())if (ord[i][j]!=0)isok=false;\\n if (isok)ret[i]=min(ret[i],now);\\n if (p == i && isok)p++;\\n }\\n }\\n return ret;\\n}\\n\\nint getindex(string a,map<string,int> &M){\\n int index = M.size();\\n if (M.count(a)==0)M[a]=index;\\n return M[a];\\n}\\n\\nmain(){\\n int n,m;\\n int te=0;\\n while(cin>>n>>m && n){\\n if( te++)cout << endl;\\n vector<state> in(n);\\n vector<int> come(m);\\n vector<vector<int> > ord(m);\\n map<string,int> M;\\n \\n rep(i,n){\\n cin>>in[i].name>>in[i].cap>>in[i].time;\\n in[i].num=i;\\n }\\n\\n\\n sort(in.begin(),in.end());\\n rep(i,n)getindex(in[i].name,M);\\n\\n rep(i,m){\\n cin>>come[i];\\n rep(j,n)ord[i].pb(0);\\n int k;\\n cin>>k;\\n rep(j,k){\\n\\tstring tmp;cin>>tmp;ord[i][getindex(tmp,M)]++;\\n }\\n }\\n\\n vector<ll> ans=solve(in,come,ord);\\n rep(i,ans.size())cout << ans[i]<<endl;\\n }\\n return false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 956,\n \"score_of_the_acc\": -0.9441,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2059_26694\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <map>\\n#include <queue>\\n#include <algorithm>\\nusing namespace std;\\n\\nenum EVENT{ORDER, COOKED};\\n\\nclass Event\\n{\\npublic:\\n\\tint c,t,s,id;\\n\\tEVENT e;\\n\\t\\n\\tEvent(int c, int t, int s, int id, EVENT e)\\n\\t:c(c),t(t),e(e),s(s),id(id)\\n\\t{}\\n\\t\\n\\tbool operator<(const Event& a) const\\n\\t{\\n\\t\\tif(t!=a.t) return t>a.t;\\n\\t\\tif(e!=a.e) return e<a.e;\\n\\t\\tif(c==a.c) return s>a.s;\\n\\t\\treturn c>a.c;\\n\\t}\\n};\\n\\nclass Order\\n{\\npublic:\\n\\tint id,pt;\\n\\tOrder(int id, int pt)\\n\\t:id(id),pt(pt)\\n\\t{}\\n\\t\\n\\tbool operator<(const Order& a) const\\n\\t{\\n\\t\\tif(pt!=a.pt) return pt>a.pt;\\n\\t\\treturn id<a.id;\\n\\t}\\n};\\n\\nint main()\\n{\\n\\tbool f=true;\\n\\tint M,N;\\n\\twhile(cin >> M >> N, (M||N))\\n\\t{\\n\\t\\tif(!f) cout << endl;\\n\\t\\tf=false;\\n\\t\\t\\n\\t\\tint limit[20], time[20];\\n\\t\\tmap<string, int> d;\\n\\t\\tfor(int i=0; i<M; i++)\\n\\t\\t{\\n\\t\\t\\tint l,t;\\n\\t\\t\\tstring n;\\n\\t\\t\\tcin >> n >> l >> t;\\n\\t\\t\\td[n]=i;\\n\\t\\t\\t\\n\\t\\t\\tlimit[i]=l; time[i]=t;\\n\\t\\t}\\n\\t\\t\\n\\t\\tpriority_queue<Event> q;\\n\\t\\t\\n\\t\\tint order[100],cooked[100]={0},cookid=-1,cooking=0,cooktime=-1,served[100],pretime=-1;\\n\\t\\tfor(int i=0; i<N; i++)\\n\\t\\t{\\n\\t\\t\\tint t,o;\\n\\t\\t\\tcin >> t >> o;\\n\\t\\t\\torder[i]=o;\\n\\t\\t\\tvector<Order> seq;\\n\\t\\t\\tfor(int j=0; j<o; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tstring n;\\n\\t\\t\\t\\tcin >> n;\\n\\t\\t\\t\\tseq.push_back(Order(d[n], time[d[n]]));\\n\\t\\t\\t}\\n\\t\\t\\tsort(seq.begin(), seq.end());\\n\\t\\t\\tfor(int j=0; j<seq.size(); j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tq.push(Event(i,t,j,seq[j].id,ORDER));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\twhile(!q.empty())\\n\\t\\t{\\n\\t\\t\\tEvent e=q.top(); q.pop();\\n\\t\\t\\tif(e.e==ORDER)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(cookid==e.id&&cooking<limit[e.id]&&pretime==e.t||cooking==0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tint tm=e.t+time[e.id];\\n\\t\\t\\t\\t\\tpretime=e.t;\\n\\t\\t\\t\\t\\tcooktime=tm;\\n\\t\\t\\t\\t\\tcooking++;\\n\\t\\t\\t\\t\\tcookid=e.id;\\n\\t\\t\\t\\t\\tq.push(Event(e.c, tm,e.s, e.id,COOKED));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tq.push(Event(e.c, cooktime,e.s, e.id,e.e));\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tcooking--;\\n\\t\\t\\t\\tcooked[e.c]++;\\n\\t\\t\\t\\tif(cooked[e.c]==order[e.c])\\n\\t\\t\\t\\t\\tserved[e.c]=e.t;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int i=0; i<N; i++)\\n\\t\\t\\tcout << served[i] << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 976,\n \"score_of_the_acc\": -1.2547,\n \"final_rank\": 9\n }\n]","isConversational":false}}},{"rowIdx":1087,"cells":{"group_id":{"kind":"string","value":"aoj_2058_cpp"},"problem_description":{"kind":"string","value":"Problem A:\nModuic Squares\nHave you ever heard of Moduic Squares? They are like 3 × 3 Magic Squares, but each of them has one\nextra cell called a moduic cell. Hence a Moduic Square has the following form.\nFigure 1: A Moduic Square\nEach of cells labeled from A to J contains one number from 1 to 10, where no two cells contain the same\nnumber. The sums of three numbers in the same rows, in the same columns, and in the diagonals in the\n3 × 3 cells must be congruent modulo the number in the moduic cell. Here is an example Moduic Square:\nFigure 2: An example Moduic Square\nYou can easily see that all the sums are congruent to 0 modulo 5.\nNow, we can consider interesting puzzles in which we complete Moduic Squares with partially filled cells.\nFor example, we can complete the following square by filling 4 into the empty cell on the left and 9 on\nthe right. Alternatively, we can also complete the square by filling 9 on the left and 4 on the right. So\nthis puzzle has two possible solutions.\nFigure 3: A Moduic Square as a puzzle\nYour task is to write a program that determines the number of solutions for each given puzzle.\nInput\nThe input contains multiple test cases. Each test case is specified on a single line made of 10 integers\nthat represent cells A, B, C, D, E, F, G, H, I, and J as shown in the first figure of the problem statement.\nPositive integer means that the corresponding cell is already filled with the integer. Zero means that the\ncorresponding cell is left empty.\nThe end of input is identified with a line containing ten of -1’s. This is not part of test cases.\nOutput\nFor each test case, output a single integer indicating the number of solutions on a line. There may be\ncases with no solutions, in which you should output 0 as the number.\nSample Input\n3 1 6 8 10 7 0 0 2 5\n0 0 0 0 0 0 0 0 0 1\n-1 -1 -1 -1 -1 -1 -1 -1 -1 -1\nOutput for the Sample Input\n2\n362880"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2058_6825904","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint a[3][3], m, ans;\nbool chk[11];\n\nvoid f(int p) {\n\tif (p == 10) {\n\t\tset<int> num, mod;\n\t\tnum.insert(m);\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tfor (int j = 0; j < 3; j++) num.insert(a[i][j]);\n\t\t\tmod.insert((a[i][0] + a[i][1] + a[i][2]) % m);\n\t\t\tmod.insert((a[0][i] + a[1][i] + a[2][i]) % m);\n\t\t}\n\t\tmod.insert((a[0][0] + a[1][1] + a[2][2]) % m);\n\t\tmod.insert((a[0][2] + a[1][1] + a[2][0]) % m);\n\t\tif (num.size() == 10 && mod.size() == 1) ans++;\n\t\treturn;\n\t}\n\tif (p == 9) {\n\t\tif (m > 0) f(p + 1);\n\t\telse {\n\t\t\tfor (int i = 1; i <= 10; i++) {\n\t\t\t\tif (chk[i]) continue;\n\t\t\t\tm = i;\n\t\t\t\tf(p + 1);\n\t\t\t\tm = 0;\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tint r = p / 3, c = p % 3;\n\t\tif (a[r][c] > 0) f(p + 1);\n\t\telse {\n\t\t\tfor (int i = 1; i <= 10; i++) {\n\t\t\t\tif (chk[i]) continue;\n\t\t\t\tchk[i] = true, a[r][c] = i;\n\t\t\t\tf(p + 1);\n\t\t\t\tchk[i] = false, a[r][c] = 0;\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main() {\n\tcin.tie(0);\n\tios_base::sync_with_stdio(0);\n\n\twhile (true) {\n\t\tmemset(chk, 0, sizeof(chk));\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tfor (int j = 0; j < 3; j++) {\n\t\t\t\tcin >> a[i][j];\n\t\t\t\tif (a[i][j] > 0) chk[a[i][j]] = true;\n\t\t\t}\n\t\t}\n\t\tcin >> m; if (m == -1) break;\n\t\tif (m) chk[m] = true;\n\n\t\tans = 0; f(0);\n\t\tcout << ans << '\\n';\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":2740,"memory_kb":3124,"score_of_the_acc":-1.0767,"final_rank":18},{"submission_id":"aoj_2058_3763247","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nint main(){\n vector<vector<int>> v;\n vector<int> x(10);\n for(int i = 0; i < 10; i++) x[i] = i+1;\n do{\n int z = (x[0]+x[1]+x[2])%x[9];\n bool judge = true;\n for(int i = 0; i < 3; i++){\n judge &= (x[3*i]+x[3*i+1]+x[3*i+2])%x[9] == z;\n judge &= (x[i]+x[3+i]+x[6+i])%x[9] == z;\n }\n judge &= (x[0]+x[4]+x[8])%x[9] == z;\n judge &= (x[2]+x[4]+x[6])%x[9] == z;\n if(judge) v.push_back(x);\n }while(next_permutation(x.begin(),x.end()));\n \n while(1){\n for(int i = 0; i < 10; i++) cin >> x[i];\n if(x[0] == -1) break;\n int ans = 0;\n for(vector<int> y : v){\n bool judge = true;\n for(int i = 0; i < 10; i++){\n judge &= x[i]==0 || x[i]==y[i];\n }\n if(judge) ans++;\n }\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":28348,"score_of_the_acc":-1.0855,"final_rank":19},{"submission_id":"aoj_2058_2861147","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\tvector<int>v(10);\n\tiota(v.begin(),v.end(),1);\n\n\tvector<vector<int>>anss;\n\tdo {\n\t\tvector<vector<int>>field(3,vector<int>(3));\n\t\tconst int mod=v[9];\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tfor (int j = 0; j < 3; ++j) {\n\t\t\t\tfield[i][j]=v[i*3+j];\n\t\t\t}\n\t\t}\n\t\tbool ok=true;\n\t\tint need=field[0][0]+field[1][1]+field[2][2];\n\t\tneed%=mod;\n\t\tfor (int y = 0; y < 3; ++y) {\n\t\t\tint asum=0;\n\t\t\tfor (int x = 0; x < 3; ++x) {\n\t\t\t\tasum+=field[y][x];\n\t\t\t}\n\t\t\tif(asum%mod!=need)ok=false;\n\t\t}\n\t\tfor (int x = 0; x < 3; ++x) {\n\t\t\tint asum=0;\n\t\t\tfor (int y = 0; y < 3; ++y) {\n\t\t\t\tasum+=field[y][x];\n\t\t\t}\n\t\t\tif(asum%mod != need)ok=false;\n\t\t}\n\t\tfor (int i = 0; i < 2; ++i) {\n\t\t\tint asum=0;\n\t\t\tfor (int j = 0; j < 3; ++j) {\n\t\t\t\tasum+=field[j][i?j:2-j];\n\t\t\t}\n\t\t\tif(asum%mod != need)ok=false;\n\t\t}\n\t\tif (ok) {\n\t\t\tanss.emplace_back(v);\n\t\t}\n\t}while(next_permutation(v.begin(),v.end()));\n\n\twhile (true){\n\t\tvector<int>v(10);\n\t\tfor(int i=0;i<10;++i)cin>>v[i];\n\t\tif(v[0]==-1)break;\n\t\tint sum=0;\n\t\tfor (auto && ans : anss) {\n\t\t\tbool ok=true;\n\t\t\tfor (int i = 0; i < 10; ++i) {\n\t\t\t\tif(v[i]&&v[i]!=ans[i])ok=false;\n\t\t\t}\n\t\t\tif(ok)sum++;\n\t\t}\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":580,"memory_kb":28260,"score_of_the_acc":-1.1938,"final_rank":20},{"submission_id":"aoj_2058_2584461","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 table[3][3];\n\tint mod_num,used,decided_num;\n};\n\nint POW[11];\n\nint ans;\n\nbool check(Info info){\n\n\tbool check_table[10];\n\tfor(int i = 0; i < 10; i++)check_table[i] = false;\n\tint row_0_num,row_1_num,row_2_num,col_0_num,col_1_num,col_2_num,cross_0_num,cross_1_num;\n\n\tif(info.table[0][0] == 0 || info.table[0][1] == 0 || info.table[0][2] == 0){\n\n\t}else{\n\t\trow_0_num = (info.table[0][0]+info.table[0][1]+info.table[0][2])%info.mod_num;\n\t\tcheck_table[row_0_num] = true;\n\t}\n\n\tif(info.table[1][0] == 0 || info.table[1][1] == 0 || info.table[1][2] == 0){\n\n\t}else{\n\t\trow_1_num = (info.table[1][0]+info.table[1][1]+info.table[1][2])%info.mod_num;\n\t\tcheck_table[row_1_num] = true;\n\t}\n\n\tif(info.table[2][0] == 0 || info.table[2][1] == 0 || info.table[2][2] == 0){\n\n\t}else{\n\t\trow_2_num = (info.table[2][0]+info.table[2][1]+info.table[2][2])%info.mod_num;\n\t\tcheck_table[row_2_num] = true;\n\t}\n\n\tif(info.table[0][0] == 0 || info.table[1][0] == 0 || info.table[2][0] == 0){\n\n\t}else{\n\t\tcol_0_num = (info.table[0][0]+info.table[1][0]+info.table[2][0])%info.mod_num;\n\t\tcheck_table[col_0_num] = true;\n\t}\n\n\tif(info.table[0][1] == 0 || info.table[1][1] == 0 || info.table[2][1] == 0){\n\n\t}else{\n\t\tcol_1_num = (info.table[0][1]+info.table[1][1]+info.table[2][1])%info.mod_num;\n\t\tcheck_table[col_1_num] = true;\n\t}\n\n\tif(info.table[0][2] == 0 || info.table[1][2] == 0 || info.table[2][2] == 0){\n\n\t}else{\n\t\tcol_2_num = (info.table[0][2]+info.table[1][2]+info.table[2][2])%info.mod_num;\n\t\tcheck_table[col_2_num] = true;\n\t}\n\n\tif(info.table[0][0] == 0 || info.table[1][1] == 0 || info.table[2][2] == 0){\n\n\t}else{\n\t\tcross_0_num = (info.table[0][0]+info.table[1][1]+info.table[2][2])%info.mod_num;\n\t\tcheck_table[cross_0_num] = true;\n\t}\n\n\tif(info.table[0][2] == 0 || info.table[1][1] == 0 || info.table[2][0] == 0){\n\n\t}else{\n\t\tcross_1_num = (info.table[0][2]+info.table[1][1]+info.table[2][0])%info.mod_num;\n\t\tcheck_table[cross_1_num] = true;\n\t}\n\n\tint count = 0;\n\tfor(int i = 0; i < 10; i++){\n\t\tif(check_table[i]){\n\t\t\tcount++;\n\t\t}\n\t}\n\n\treturn count <= 1;\n\n}\n\nvoid copyInfo(Info& to,Info from){\n\tfor(int row = 0; row < 3; row++){\n\t\tfor(int col = 0; col < 3; col++){\n\t\t\tto.table[row][col] = from.table[row][col];\n\t\t}\n\t}\n\tto.mod_num = from.mod_num;\n}\n\nvoid recursive(Info info){\n\n\tif(info.decided_num == 10){\n\n\t\tif(check(info)){\n\t\t\tans++;\n\t\t}\n\t\treturn;\n\t}\n\n\n\tif(info.mod_num == 0){\n\t\tfor(int loop = 1; loop <= 10; loop++){\n\t\t\tif(info.used & (1 << loop)){\n\t\t\t\t//Do nothing\n\t\t\t}else{\n\t\t\t\tInfo new_info;\n\t\t\t\tcopyInfo(new_info,info);\n\t\t\t\tnew_info.mod_num = loop;\n\t\t\t\tnew_info.decided_num = info.decided_num+1;\n\t\t\t\tnew_info.used = info.used + POW[loop];\n\t\t\t\tif(check(new_info)){\n\t\t\t\t\trecursive(new_info);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn;\n\t}\n\n\tfor(int row = 0; row < 3; row++){\n\t\tfor(int col = 0; col < 3; col++){\n\t\t\tif(info.table[row][col] == 0){\n\t\t\t\tfor(int loop = 1; loop <= 10; loop++){\n\t\t\t\t\tif(info.used & (1 << loop)){\n\t\t\t\t\t\t//Do nothing\n\t\t\t\t\t}else{\n\t\t\t\t\t\tInfo new_info;\n\t\t\t\t\t\tcopyInfo(new_info,info);\n\t\t\t\t\t\tnew_info.table[row][col] = loop;\n\t\t\t\t\t\tnew_info.decided_num = info.decided_num+1;\n\t\t\t\t\t\tnew_info.used = info.used + POW[loop];\n\t\t\t\t\t\tif(check(new_info)){\n\t\t\t\t\t\t\trecursive(new_info);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nint main(){\n\n\tfor(int i = 1; i <= 10; i++)POW[i] = pow(2,i);\n\n\twhile(true){\n\t\tInfo first;\n\t\tfor(int row = 0; row < 3; row++){\n\t\t\tfor(int col = 0; col < 3; col++)scanf(\"%d\",&first.table[row][col]);\n\t\t}\n\t\tscanf(\"%d\",&first.mod_num);\n\n\t\tif(first.table[0][0] == -1)break;\n\n\t\tfirst.used = 0;\n\t\tfirst.decided_num = 0;\n\n\t\tfor(int row = 0; row < 3; row++){\n\t\t\tfor(int col = 0; col < 3; col++){\n\t\t\t\tif(first.table[row][col] != 0){\n\t\t\t\t\tfirst.used += POW[first.table[row][col]];\n\t\t\t\t\tfirst.decided_num++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif(first.mod_num != 0){\n\t\t\tfirst.used += POW[first.mod_num];\n\t\t\tfirst.decided_num++;\n\t\t}\n\n\t\tans = 0;\n\n\t\trecursive(first);\n\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":170,"memory_kb":3316,"score_of_the_acc":-0.1284,"final_rank":10},{"submission_id":"aoj_2058_2324903","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint t[9],d;\nbool used[11];\nbool C(void){\n int r=(t[0]+t[1]+t[2])%t[9];\n return ((t[3]+t[4]+t[5])%t[9]==r&&(t[6]+t[7]+t[8])%t[9]==r&&(t[0]+t[3]+t[6])%t[9]==r&&(t[1]+t[4]+t[7])%t[9]==r&&(t[2]+t[5]+t[8])%t[9]==r&&(t[0]+t[4]+t[8])%t[9]==r&&(t[2]+t[4]+t[6])%t[9]==r);\n}\n \nint dfs(int d){\n if(d==10)return C()?1:0;\n if(t[d]!=0)return dfs(d+1);\n int res = 0;\n for(int i=1;i<=10;i++){\n if(!used[i]){\n t[d]=i;\n used[i]=1;\n res+=dfs(d+1);\n used[i]=0;\n t[d]=0;\n }\n }\n return res;\n}\nmain(){\n while(1){\n memset(used,0,sizeof(used));\n for(int i=0;i<10;i++){\n cin>>t[i];\n if(t[i]>0)used[t[i]]=1;\n }\n if(t[0]==-1)break;\n cout<<dfs(0)<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":3040,"score_of_the_acc":-0.1071,"final_rank":8},{"submission_id":"aoj_2058_2324900","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint t[9],d;\nbool used[11];\nbool C(void){\n int r=(t[0]+t[1]+t[2])%t[9];\n return ((t[3]+t[4]+t[5])%t[9]==r&&(t[6]+t[7]+t[8])%t[9]==r&&(t[0]+t[3]+t[6])%t[9]==r&&(t[1]+t[4]+t[7])%t[9]==r&&(t[2]+t[5]+t[8])%t[9]==r&&(t[0]+t[4]+t[8])%t[9]==r&&(t[2]+t[4]+t[6])%t[9]==r);\n}\n \nint dfs(int d){\n if(d==10)return C()?1:0;\n if(t[d]!=0)return dfs(d+1);\n int res = 0;\n for(int i=1;i<=10;i++){\n if(!used[i]){\n t[d] = i;\n used[i] = true;\n res+=dfs(d+1);\n used[i] = false;\n t[d] = 0;\n }\n }\n return res;\n}\nmain(){\n while(1){\n memset(used,0,sizeof(used));\n for(int i=0;i<10;i++){\n cin>>t[i];\n if(t[i]>0)used[t[i]]=1;\n }\n if(t[0]==-1)break;\n cout<<dfs(0)<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":2964,"score_of_the_acc":-0.1043,"final_rank":7},{"submission_id":"aoj_2058_2276281","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nbool u[11];\nint a[10],x,y;\nbool ck() {\n if(a[0]&&a[1]&&a[2]&&(a[0]+a[1]+a[2])%x!=y) return 0;\n if(a[3]&&a[4]&&a[5]&&(a[3]+a[4]+a[5])%x!=y) return 0;\n if(a[6]&&a[7]&&a[8]&&(a[6]+a[7]+a[8])%x!=y) return 0;\n if(a[0]&&a[3]&&a[6]&&(a[0]+a[3]+a[6])%x!=y) return 0;\n if(a[1]&&a[4]&&a[7]&&(a[1]+a[4]+a[7])%x!=y) return 0;\n if(a[2]&&a[5]&&a[8]&&(a[2]+a[5]+a[8])%x!=y) return 0;\n if(a[0]&&a[4]&&a[8]&&(a[0]+a[4]+a[8])%x!=y) return 0;\n if(a[2]&&a[4]&&a[6]&&(a[2]+a[4]+a[6])%x!=y) return 0;\n return 1;\n}\n \nint dfs(int k) {\n if(!ck()) return 0;\n if(k==9) return 1;\n int ans=0;\n if(a[k]) ans+=dfs(k+1);\n else {\n for(int i=1; i<=10; i++) {\n if(u[i]) continue;\n a[k]=i;u[i]=1;\n ans+=dfs(k+1);\n a[k]=0;u[i]=0;\n }\n }\n return ans;\n}\n \nint main() {\n while(1) {\n memset(u,0,sizeof(u));\n for(int i=0; i<10; i++) {\n cin >> a[i];\n u[a[i]]=1;\n }\n if(a[0]==-1) break;\n x=a[9];\n int ans=0;\n if(!x) {\n for(int i=1; i<11; i++) {\n if(u[i]) continue;\n x=i;\n u[i]=1;\n for(int j=0; j<x; j++) {y=j;ans+=dfs(0);}\n u[i]=0;\n }\n } else {\n for(int j=0; j<x; j++) {y=j;ans+=dfs(0);}\n }\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3092,"score_of_the_acc":-0.083,"final_rank":5},{"submission_id":"aoj_2058_2275830","code_snippet":"#include<bits/stdc++.h>\n#define index ffff\nusing namespace std;\n\nint d[10],ans;\nint index[10];\nint M;\n\nint cal(int a,int b,int c){\n \n return (index[a]+index[b]+index[c])%M;\n \n}\n\n\nbool check(){\n \n M=index[9];\n \n int X=cal(0,1,2);\n \n if(X!=cal(3,4,5))return false;\n \n if(X!=cal(6,7,8))return false;\n\n if(X!=cal(0,3,6))return false;\n\n if(X!=cal(1,4,7))return false;\n \n if(X!=cal(2,5,8))return false;\n \n if(X!=cal(0,4,8))return false;\n \n if(X!=cal(2,4,6))return false;\n\n return true;\n \n}\n\nvoid solve(){\n \n\n for(int i=0;i<10;i++) index[i]=i+1;\n\n\n do{\n int f=0;\n \n for(int i=0;i<10;i++)\n if(d[i]!=0&&d[i]!=index[i]){\n\tf=1;\n\tbreak;\n }\n\n if(f)continue;\n \n if(check())ans++;\n \n }while(next_permutation(index,index+10));\n \n}\n\n\nint main(){\n\n while(1){\n \n for(int i=0;i<10;i++) cin>>d[i];\n \n if(d[0]<0)break;\n\n ans=0;\n \n solve();\n \n cout<<ans<<endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":390,"memory_kb":3016,"score_of_the_acc":-0.1992,"final_rank":13},{"submission_id":"aoj_2058_2275811","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nbool u[11];\nint a[10],x,y;\nbool ck() {\n if(a[0]&&a[1]&&a[2]&&(a[0]+a[1]+a[2])%x!=y) return 0;\n if(a[3]&&a[4]&&a[5]&&(a[3]+a[4]+a[5])%x!=y) return 0;\n if(a[6]&&a[7]&&a[8]&&(a[6]+a[7]+a[8])%x!=y) return 0;\n if(a[0]&&a[3]&&a[6]&&(a[0]+a[3]+a[6])%x!=y) return 0;\n if(a[1]&&a[4]&&a[7]&&(a[1]+a[4]+a[7])%x!=y) return 0;\n if(a[2]&&a[5]&&a[8]&&(a[2]+a[5]+a[8])%x!=y) return 0;\n if(a[0]&&a[4]&&a[8]&&(a[0]+a[4]+a[8])%x!=y) return 0;\n if(a[2]&&a[4]&&a[6]&&(a[2]+a[4]+a[6])%x!=y) return 0;\n return 1;\n}\n\nint dfs(int k) {\n if(!ck()) return 0;\n if(k==9) return 1;\n int ans=0;\n if(a[k]) ans+=dfs(k+1);\n else {\n for(int i=1; i<=10; i++) {\n if(u[i]) continue;\n a[k]=i;\n u[i]=1;\n ans+=dfs(k+1);\n a[k]=0;\n u[i]=0;\n }\n }\n return ans;\n}\n\nint main() {\n while(1) {\n memset(u,0,sizeof(u));\n for(int i=0; i<10; i++) {\n cin >> a[i];\n u[a[i]]=1;\n }\n if(a[0]==-1) break;\n x=a[9];\n int ans=0;\n if(!x) {\n for(int i=1; i<11; i++) {\n if(u[i]) continue;\n x=i;\n u[i]=1;\n for(int j=0; j<x; j++) {\n y=j;\n ans+=dfs(0);\n }\n u[i]=0;\n }\n } else {\n for(int j=0; j<x; j++) {\n y=j;\n ans+=dfs(0);\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3096,"score_of_the_acc":-0.0868,"final_rank":6},{"submission_id":"aoj_2058_2275714","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nint diff[10];\nint num[]={1,2,3,4,5,6,7,8,9,10};\n\nbool check(){\n int A[3][3],mod = num[9];\n for(int i=0;i<10;i++)if(diff[i]>0&&num[i]!=diff[i])return 0;\n for(int i=0;i<9;i++) A[i/3][i%3] = num[i];\n\n\n int used[20]={};\n for(int i=0;i<3;i++){\n int a=0,b=0; \n for(int j=0;j<3;j++)a+=A[i][j],b+=A[j][i];\n a%=mod,b%=mod;\n used[a]++;\n used[b]++;\n if(used[a]!=(i+1)*2)return 0; \n }\n \nint a =A[0][0]+A[1][1]+A[2][2],b = A[0][2]+A[1][1]+A[2][0];\nused[a%mod]++,used[b%mod]++;\n return used[a%mod] == 8;\n}\n\nsigned main(){\n\n while(1){\n int Exit = 1;\n for(int i=0;i<10;i++)cin>>diff[i],Exit*=(diff[i]<0);\n if(Exit) return 0;\n\n for(int i=0;i<10;i++)num[i] = i+1;\n\n int ans=0;\n do{\n ans+=check();\n }while(next_permutation(num,num+10));\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":570,"memory_kb":3032,"score_of_the_acc":-0.2667,"final_rank":15},{"submission_id":"aoj_2058_1893505","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nint m;\nvi tmp;\nint w[8][3]={\n\t{0,1,2},\n\t{3,4,5},\n\t{6,7,8},\n\t{0,3,6},\n\t{1,4,7},\n\t{2,5,8},\n\t{0,4,8},\n\t{2,4,6}\n};\nvi in;\nbool f(){\n\tvi su(8);\n\trep(i,8){\n\t\tint sum=0;\n\t\trep(j,3)sum+=tmp[w[i][j]];\n\t\tsu[i]=sum%m;\n\t}\n\tbool h=true;\n\trep(i,8)if(su[0]!=su[i])h=false;\n\treturn h;\n}\nint main(){\n\twhile(1){\n\t\tin=vi(10);\n\t\trep(i,10)cin>>in[i];\n\t\tif(in[0]==-1)break;\n\t\ttmp=vi(11);\n\t\trep(i,10)tmp[in[i]]++;\n\t\tvi per;\n\t\trep(i,10)if(tmp[i+1]==0)per.pb(i+1);\n\t\tint out=0;\n\t\tdo{\n\t\t\ttmp=in;\n\t\t\tint c=0;\n\t\t\trep(i,10)if(tmp[i]==0)tmp[i]=per[c],c++;\n\t\t\tm=tmp[9];\n\t\t\tout+=f();\n\t\t}while(next_permutation(all(per)));\n\t\tcout<<out<<endl;\n\t}\n}","accuracy":1,"time_ms":430,"memory_kb":1216,"score_of_the_acc":-0.1481,"final_rank":12},{"submission_id":"aoj_2058_1882421","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define rep(i,n) for(int i = 0 ; i < n ; i++)\n \nint c[10];\n \nbool check(){\n int sum = 0, MOD = c[9];\n rep(i,3) sum = (sum + c[i]) % MOD; \n if((c[3]+c[4]+c[5])%MOD != sum) return false;\n if((c[6]+c[7]+c[8])%MOD != sum) return false;\n if((c[0]+c[3]+c[6])%MOD != sum) return false;\n if((c[1]+c[4]+c[7])%MOD != sum) return false;\n if((c[2]+c[5]+c[8])%MOD != sum) return false;\n if((c[0]+c[4]+c[8])%MOD != sum) return false;\n if((c[2]+c[4]+c[6])%MOD != sum) return false;\n return true;\n}\n \nint rec(int p,int S){\n int res = 0;\n if(__builtin_popcount(S) == 10){\n\treturn check();\n }\n if(!c[p]){\n\trep(i,10){\n\t if((S >> i) & 1) continue;\n\t c[p] = i+1;\n\t res += rec(p+1,S|(1<<i));\n\t c[p] = 0;\n\t}\n }else{\n\tres += rec(p+1,S);\n }\n return res;\n}\n \nint main(){\n while(true){\n\tint S = 0;\n\tbool EXIT = false;\n\trep(i,10){\n\t cin >> c[i];\n\t if(c[i] > 0){\n\t\tS |= 1<<(c[i]-1);\n\t }else if(c[i] == -1){\n\t\tEXIT = true;\n\t }\n\t}\n\tif(EXIT) break;\n\tcout << rec(0,S) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":200,"memory_kb":3048,"score_of_the_acc":-0.1297,"final_rank":11},{"submission_id":"aoj_2058_1822775","code_snippet":"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint a[10];\nint main() {\n\twhile (true) {\n\t\tfor (int i = 0; i < 10; i++)cin >> a[i];\n\t\tif (a[0] == -1)break;\n\t\tint b[10] = { 0,1,2,3,4,5,6,7,8,9 }; int cnt = 0;\n\t\tdo {\n\t\t\tint OK = 1; int f[10];\n\t\t\tfor (int i = 0; i < 10; i++)f[i] = b[i] + 1;\n\t\t\tfor (int i = 0; i < 10; i++) {\n\t\t\t\tif (a[i] >= 1 && a[i] != f[i])OK = 0;\n\t\t\t}\n\t\t\tif (OK == 0)continue;\n\t\t\tint c[4][4];\n\t\t\tfor (int i = 0; i < 16; i++)c[i / 4][i % 4] = 0;\n\t\t\tfor (int i = 0; i < 9; i++) {\n\t\t\t\tc[i / 3][i % 3] = f[i];\n\t\t\t\tc[3][i % 3] += f[i]; c[3][i % 3] %= f[9];\n\t\t\t\tc[i / 3][3] += f[i]; c[i / 3][3] %= f[9];\n\t\t\t}\n\t\t\tif (c[3][0] != c[3][1] || c[3][1] != c[3][2])continue;\n\t\t\tif (c[0][3] != c[1][3] || c[1][3] != c[2][3])continue;\n\t\t\tint d1 = c[0][0] + c[1][1] + c[2][2]; d1 %= f[9];\n\t\t\tint d2 = c[0][2] + c[1][1] + c[2][0]; d2 %= f[9];\n\t\t\tif (c[3][0] != d1 || d1 != d2)continue;\n\t\t\tcnt++;\n\t\t} while (next_permutation(b, b + 10));\n\t\tcout << cnt << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1570,"memory_kb":1160,"score_of_the_acc":-0.5699,"final_rank":17},{"submission_id":"aoj_2058_1819961","code_snippet":"#include <cstdio>\nint a[10], e[8], used[11];\nbool ok() {\n\tfor (int i = 0; i < 3; i++) e[i] = (a[i] + a[i + 3] + a[i + 6]) % a[9];\n\tfor (int i = 0; i < 3; i++) e[i + 3] = (a[i * 3] + a[i * 3 + 1] + a[i * 3 + 2]) % a[9];\n\te[6] = (a[2] + a[4] + a[6]) % a[9];\n\te[7] = (a[0] + a[4] + a[8]) % a[9];\n\tfor (int i = 0; i < 7; i++) if (e[i] != e[i + 1]) return false;\n\treturn true;\n}\nint solve(int depth) {\n\tif (depth == 10) return ok() ? 1 : 0;\n\tif (a[depth]) return solve(depth + 1);\n\tint ret = 0;\n\tfor (int i = 1; i <= 10; i++) {\n\t\tif (!used[i]) {\n\t\t\tused[i] = 1; a[depth] = i;\n\t\t\tret += solve(depth + 1);\n\t\t\tused[i] = a[depth] = 0;\n\t\t}\n\t}\n\treturn ret;\n}\nint main() {\n\twhile (true) {\n\t\tfor (int i = 1; i < 11; i++) used[i] = 0;\n\t\tfor (int i = 0; i < 10; i++) {\n\t\t\tscanf(\"%d\", a + i);\n\t\t\tif (a[i]) used[a[i]] = 1;\n\t\t}\n\t\tif (a[0] == -1) break;\n\t\tprintf(\"%d\\n\", solve(0));\n\t}\n}","accuracy":1,"time_ms":190,"memory_kb":2604,"score_of_the_acc":-0.1097,"final_rank":9},{"submission_id":"aoj_2058_1366604","code_snippet":"#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\n/* typedef */\n\n/* global variables */\n\nint ds[10];\nbool used[11];\n\n/* subroutines */\n\ninline int dsum(int i0, int i1, int i2) {\n return (ds[i0] + ds[i1] + ds[i2]) % ds[9];\n}\n\nbool check() {\n int diag0 = dsum(0, 4, 8);\n return\n dsum(2, 4, 6) == diag0 &&\n dsum(0, 1, 2) == diag0 &&\n dsum(3, 4, 5) == diag0 &&\n dsum(6, 7, 8) == diag0 &&\n dsum(0, 3, 6) == diag0 &&\n dsum(1, 4, 7) == diag0 &&\n dsum(2, 5, 8) == diag0;\n}\n\nint rec(int k) {\n if (k >= 10) return check();\n\n if (ds[k] == 0) {\n int sum = 0;\n for (int d = 1; d <= 10; d++)\n if (! used[d]) {\n\tds[k] = d;\n\tused[d] = true;\n\tsum += rec(k + 1);\n\tds[k] = 0;\n\tused[d] = false;\n }\n return sum;\n }\n\n return rec(k + 1);\n}\n\n/* main */\n\nint main() {\n for (;;) {\n cin >> ds[0];\n if (ds[0] == -1) break;\n\n for (int i = 1; i < 10; i++) cin >> ds[i];\n\n memset(used, false, sizeof(used));\n\n for (int i = 0; i < 10; i++)\n if (ds[i] > 0) used[ds[i]] = true;\n\n cout << rec(0) << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":200,"memory_kb":1160,"score_of_the_acc":-0.0606,"final_rank":4},{"submission_id":"aoj_2058_1171624","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#include <complex>\n#include <assert.h>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <double,double> P;\n \nstatic const int tx[] = {+0,+1,+0,-1};\nstatic const int ty[] = {-1,+0,+1,+0};\n \nstatic const double EPS = 1e-8;\n\nint table[3][3];\n\nbool check(int mod){\n set<int> result;\n for(int y = 0; y < 3; y++){\n int sum = 0;\n for(int x = 0; x < 3; x++){\n sum += table[y][x];\n }\n result.insert(sum % mod);\n }\n if(result.size() > 1) return false;\n\n for(int x = 0; x < 3; x++){\n int sum = 0;\n for(int y = 0; y < 3; y++){\n sum += table[y][x];\n }\n result.insert(sum % mod);\n }\n if(result.size() > 1) return false;\n\n result.insert((table[0][0] + table[1][1] + table[2][2]) % mod);\n result.insert((table[0][2] + table[1][1] + table[2][0]) % mod);\n return (result.size() == 1);\n}\n\nint dfs(int pos,int used,int mod){\n if(pos >= 9 && check(mod)){\n return 1;\n }\n else if(pos >= 9){\n return 0;\n }\n int res = 0;\n int x = pos % 3;\n int y = pos / 3;\n\n if(table[y][x] == 0){\n for(int i = 1; i <= 10; i++){\n if(used & (1<<i)) continue;\n table[y][x] = i;\n res += dfs(pos + 1, used | (1<<i),mod);\n table[y][x] = 0;\n }\n }\n else{\n res += dfs(pos + 1, used,mod);\n }\n return res;\n}\n\nint main(){\n while(~scanf(\"%d\",&table[0][0])){\n int used = 0;\n if(table[0][0] != 0){\n used |= (1<<table[0][0]);\n }\n\n for(int y = 0; y < 3; y++){\n for(int x = 0; x < 3; x++){\n if(y == 0 && x == 0) continue;\n scanf(\"%d\",&table[y][x]);\n if(table[y][x] != 0){\n used |= (1<<table[y][x]);\n }\n }\n }\n int mod;\n scanf(\"%d\",&mod);\n if(mod == -1) break;\n\n used |= (1<<mod);\n int res = 0;\n if(mod == 0){\n int prev = used;\n for(int i = 1; i <= 10; i++){\n if(used & (1<<i)) continue;\n used |= (1<<i);\n mod = i;\n res += dfs(0,used,mod);\n used = prev;\n }\n }\n else{\n res += dfs(0,used,mod);\n }\n printf(\"%d\\n\",res);\n }\n}","accuracy":1,"time_ms":730,"memory_kb":1184,"score_of_the_acc":-0.2585,"final_rank":14},{"submission_id":"aoj_2058_1171623","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#include <complex>\n#include <assert.h>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <double,double> P;\n \nstatic const int tx[] = {+0,+1,+0,-1};\nstatic const int ty[] = {-1,+0,+1,+0};\n \nstatic const double EPS = 1e-8;\n\nint table[3][3];\n\nbool check(int mod){\n set<int> result;\n for(int y = 0; y < 3; y++){\n int sum = 0;\n for(int x = 0; x < 3; x++){\n sum += table[y][x];\n }\n result.insert(sum % mod);\n }\n for(int x = 0; x < 3; x++){\n int sum = 0;\n for(int y = 0; y < 3; y++){\n sum += table[y][x];\n }\n result.insert(sum % mod);\n }\n result.insert((table[0][0] + table[1][1] + table[2][2]) % mod);\n result.insert((table[0][2] + table[1][1] + table[2][0]) % mod);\n return (result.size() == 1);\n}\n\nint dfs(int pos,int used,int mod){\n if(pos >= 9 && check(mod)){\n return 1;\n }\n else if(pos >= 9){\n return 0;\n }\n int res = 0;\n int x = pos % 3;\n int y = pos / 3;\n\n if(table[y][x] == 0){\n for(int i = 1; i <= 10; i++){\n if(used & (1<<i)) continue;\n table[y][x] = i;\n res += dfs(pos + 1, used | (1<<i),mod);\n table[y][x] = 0;\n }\n }\n else{\n res += dfs(pos + 1, used,mod);\n }\n return res;\n}\n\nint main(){\n while(~scanf(\"%d\",&table[0][0])){\n int used = 0;\n if(table[0][0] != 0){\n used |= (1<<table[0][0]);\n }\n\n for(int y = 0; y < 3; y++){\n for(int x = 0; x < 3; x++){\n if(y == 0 && x == 0) continue;\n scanf(\"%d\",&table[y][x]);\n if(table[y][x] != 0){\n used |= (1<<table[y][x]);\n }\n }\n }\n int mod;\n scanf(\"%d\",&mod);\n if(mod == -1) break;\n\n used |= (1<<mod);\n int res = 0;\n if(mod == 0){\n int prev = used;\n for(int i = 1; i <= 10; i++){\n if(used & (1<<i)) continue;\n used |= (1<<i);\n mod = i;\n res += dfs(0,used,mod);\n used = prev;\n }\n }\n else{\n res += dfs(0,used,mod);\n }\n printf(\"%d\\n\",res);\n }\n}","accuracy":1,"time_ms":1310,"memory_kb":1188,"score_of_the_acc":-0.4743,"final_rank":16},{"submission_id":"aoj_2058_1123659","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\n\n\nint p[11] = {};\nint can[11] = {};\nint m;\n\nint check(int t){\n\tif( t < 4 ) return true;\n\t//if( t == 4 ) return (p[1]+p[4]+p[7]) % p[9] == 0;\n\tint c = (p[1]+p[4]+p[7]) % p[9];\n\tif( t == 5 ) return (p[0]+p[4]+p[8]) % p[9] == c;\n\tif( t == 6 ) return (p[0]+p[1]+p[2]) % p[9] == c;\n\tif( t == 7 ) return (p[2]+p[5]+p[8]) % p[9] == c;\n\tif( t == 8 ) return (p[6]+p[7]+p[8]) % p[9] == c && (p[2]+p[4]+p[6]) % p[9] == c;\n\tif( t == 9 ) return (p[0]+p[3]+p[6]) % p[9] == c && (p[3]+p[4]+p[5]) % p[9] == c;\n\treturn true;\n}\n//\n\nint d[] = {9,0,1,4,7,8,2,5,6,3};\n\nint solve(int t){\n\t/*cout << t << endl;\n\tcout << \"[\" << p[9] << \"]\" << endl;\n\tfor(int i = 0 ; i < 3 ; i++){\n\t\tfor(int j = 0 ; j < 3 ; j++) cout << p[i*3+j] << \" \";\n\t\tcout << endl;\n\t}\n\t*/\n\tif( !check(t-1) ) return 0;\n\tif( t == 10 ){\n\t\treturn 1;\n\t}\n\tint x = d[t];\n\tif( p[x] == 0 ){\n\t\tint ans = 0;\n\t\tfor(int i = 1 ; i <= 10 ; i++){\n\t\t\tif( can[i] ){\n\t\t\t\tcan[i] = false;\n\t\t\t\tp[x] = i;\n\t\t\t\tans += solve(t+1);\n\t\t\t\tp[x] = 0;\n\t\t\t\tcan[i] = true;\n\t\t\t}\n\t\t}\n\t\treturn ans;\n\t}else{\n\t\treturn solve(t+1);\n\t\t\n\t}\n}\n\nint main(){\n\twhile(1){\n\t\tfor(int i = 0 ; i < 11 ; i++) can[i] = true;\n\t\t\n\t\tfor(int i = 0 ; i < 10 ; i++){\n\t\t\tcin >> p[i];\n\t\t\tcan[p[i]] = false;\n\t\t}\n\t\tif(p[0]==-1)break;\n\t\tcout << solve(0) << endl;\n\t}\n}","accuracy":1,"time_ms":50,"memory_kb":1160,"score_of_the_acc":-0.0048,"final_rank":2},{"submission_id":"aoj_2058_1110749","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint a[11];\nint used[11];\nint sv=0;\nint solve(int v){\n\tif(v==9){\n\t//\tfor(int i=1;i<11;i++)if(!used[i])return 0;\n\t\treturn 1;\n\t}\n\tint ret=0;\n\tif(a[v]){\n\t\tbool ok=true;\n\t\tint i=a[v];\n\t\tif(v==2)sv=(a[0]+a[1]+a[2])%a[9];\n\t\tif(v%3==2){\n\t\t\tif((a[v-2]+a[v-1]+i)%a[9]!=sv)ok=false;\n\t\t}\n\t\tif(v>=6){\n\t\t\tif((a[v-6]+a[v-3]+i)%a[9]!=sv)ok=false;\n\t\t}\n\t\tif(v==6){\n\t\t\tif((a[2]+a[4]+i)%a[9]!=sv)ok=false;\n\t\t}\n\t\tif(v==8){\n\t\t\tif((a[0]+a[4]+i)%a[9]!=sv)ok=false;\n\t\t}\n\t\tif(ok){\n\t\t\treturn solve(v+1);\n\t\t}else return 0;\n\t}\n\tfor(int i=1;i<=10;i++){\n\t\tif(used[i])continue;\n\t\tbool ok=true;\n\t\tif(v==2)sv=(a[0]+a[1]+i)%a[9];\n\t\tif(v%3==2){\n\t\t\tif((a[v-2]+a[v-1]+i)%a[9]!=sv)ok=false;\n\t\t}\n\t\tif(v>=6){\n\t\t\tif((a[v-6]+a[v-3]+i)%a[9]!=sv)ok=false;\n\t\t}\n\t\tif(v==6){\n\t\t\tif((a[2]+a[4]+i)%a[9]!=sv)ok=false;\n\t\t}\n\t\tif(v==8){\n\t\t\tif((a[0]+a[4]+i)%a[9]!=sv)ok=false;\n\t\t}\n\t\tif(!ok)continue;\n\t\tused[i]=1;\n\t\ta[v]=i;\n\t\tret+=solve(v+1);\n\t\tused[i]=0;\n\t\ta[v]=0;\n\t}\n\t//printf(\"%d: %d\\n\",v,ret);\n\treturn ret;\n}\nint main(){\n\twhile(1){\n\t\tfor(int i=0;i<10;i++)scanf(\"%d\",a+i);\n\t\tif(a[0]==-1)break;\n\t\tfor(int i=0;i<11;i++)used[i]=0;\n\t\tfor(int i=0;i<10;i++)if(a[i])used[a[i]]=1;\n\t\tif(a[9]){\n\t\t\tprintf(\"%d\\n\",solve(0));\n\t\t}else{\n\t\t\tint ret=0;\n\t\t\tfor(int i=1;i<=10;i++){\n\t\t\t\tif(used[i])continue;\n\t\t\t\tused[i]=1;\n\t\t\t\ta[9]=i;\n\t\t\t\tret+=solve(0);\n\t\t\t\tused[i]=0;\n\t\t\t}\n\t\t\tprintf(\"%d\\n\",ret);\n\t\t}\n\t}\n}","accuracy":1,"time_ms":60,"memory_kb":1028,"score_of_the_acc":-0.0037,"final_rank":1},{"submission_id":"aoj_2058_1097307","code_snippet":"#include<iostream>\n\nusing namespace std;\n\nint a[10];\n\nbool check(){\n static int c[][3]={\n {0,1,2},\n {3,4,5},\n {6,7,8},\n {0,3,6},\n {1,4,7},\n {2,5,8},\n {0,4,8},\n {2,4,6},\n };\n int r=-1;\n bool f=false;\n for(int j=0;j<8;j++){\n if(a[c[j][0]]==0||a[c[j][1]]==0||a[c[j][2]]==0)continue;\n int s=(a[c[j][0]]+a[c[j][1]]+a[c[j][2]])%a[9];\n if(r==-1){\n r=s;\n }else if(r!=s){\n f=true;\n }\n }\n return !f;\n}\n\nint dfs(int x,int u){\n if(x<0)return check();\n if(a[x])return dfs(x-1,u);\n int s=0;\n for(int i=1;i<=10;i++){\n if(u>>i&1)continue;\n a[x]=i;\n if(check()){\n s+=dfs(x-1,u|1<<i);\n }\n a[x]=0;\n }\n return s;\n}\n\nint main(){\n for(;;){\n int u=0;\n for(auto &e:a){\n cin>>e;\n u|=1<<e;\n }\n if(a[0]==-1)break;\n cout<<dfs(9,u)<<endl;\n }\n}","accuracy":1,"time_ms":120,"memory_kb":1160,"score_of_the_acc":-0.0309,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_2058_6825904\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint a[3][3], m, ans;\\nbool chk[11];\\n\\nvoid f(int p) {\\n\\tif (p == 10) {\\n\\t\\tset<int> num, mod;\\n\\t\\tnum.insert(m);\\n\\t\\tfor (int i = 0; i < 3; i++) {\\n\\t\\t\\tfor (int j = 0; j < 3; j++) num.insert(a[i][j]);\\n\\t\\t\\tmod.insert((a[i][0] + a[i][1] + a[i][2]) % m);\\n\\t\\t\\tmod.insert((a[0][i] + a[1][i] + a[2][i]) % m);\\n\\t\\t}\\n\\t\\tmod.insert((a[0][0] + a[1][1] + a[2][2]) % m);\\n\\t\\tmod.insert((a[0][2] + a[1][1] + a[2][0]) % m);\\n\\t\\tif (num.size() == 10 && mod.size() == 1) ans++;\\n\\t\\treturn;\\n\\t}\\n\\tif (p == 9) {\\n\\t\\tif (m > 0) f(p + 1);\\n\\t\\telse {\\n\\t\\t\\tfor (int i = 1; i <= 10; i++) {\\n\\t\\t\\t\\tif (chk[i]) continue;\\n\\t\\t\\t\\tm = i;\\n\\t\\t\\t\\tf(p + 1);\\n\\t\\t\\t\\tm = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\telse {\\n\\t\\tint r = p / 3, c = p % 3;\\n\\t\\tif (a[r][c] > 0) f(p + 1);\\n\\t\\telse {\\n\\t\\t\\tfor (int i = 1; i <= 10; i++) {\\n\\t\\t\\t\\tif (chk[i]) continue;\\n\\t\\t\\t\\tchk[i] = true, a[r][c] = i;\\n\\t\\t\\t\\tf(p + 1);\\n\\t\\t\\t\\tchk[i] = false, a[r][c] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint main() {\\n\\tcin.tie(0);\\n\\tios_base::sync_with_stdio(0);\\n\\n\\twhile (true) {\\n\\t\\tmemset(chk, 0, sizeof(chk));\\n\\t\\tfor (int i = 0; i < 3; i++) {\\n\\t\\t\\tfor (int j = 0; j < 3; j++) {\\n\\t\\t\\t\\tcin >> a[i][j];\\n\\t\\t\\t\\tif (a[i][j] > 0) chk[a[i][j]] = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcin >> m; if (m == -1) break;\\n\\t\\tif (m) chk[m] = true;\\n\\n\\t\\tans = 0; f(0);\\n\\t\\tcout << ans << '\\\\n';\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2740,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -1.0767,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2058_3763247\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\nusing namespace std;\\n\\nint main(){\\n vector<vector<int>> v;\\n vector<int> x(10);\\n for(int i = 0; i < 10; i++) x[i] = i+1;\\n do{\\n int z = (x[0]+x[1]+x[2])%x[9];\\n bool judge = true;\\n for(int i = 0; i < 3; i++){\\n judge &= (x[3*i]+x[3*i+1]+x[3*i+2])%x[9] == z;\\n judge &= (x[i]+x[3+i]+x[6+i])%x[9] == z;\\n }\\n judge &= (x[0]+x[4]+x[8])%x[9] == z;\\n judge &= (x[2]+x[4]+x[6])%x[9] == z;\\n if(judge) v.push_back(x);\\n }while(next_permutation(x.begin(),x.end()));\\n \\n while(1){\\n for(int i = 0; i < 10; i++) cin >> x[i];\\n if(x[0] == -1) break;\\n int ans = 0;\\n for(vector<int> y : v){\\n bool judge = true;\\n for(int i = 0; i < 10; i++){\\n judge &= x[i]==0 || x[i]==y[i];\\n }\\n if(judge) ans++;\\n }\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 28348,\n \"score_of_the_acc\": -1.0855,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2058_2861147\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\nint main() {\\n\\tvector<int>v(10);\\n\\tiota(v.begin(),v.end(),1);\\n\\n\\tvector<vector<int>>anss;\\n\\tdo {\\n\\t\\tvector<vector<int>>field(3,vector<int>(3));\\n\\t\\tconst int mod=v[9];\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tfor (int j = 0; j < 3; ++j) {\\n\\t\\t\\t\\tfield[i][j]=v[i*3+j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbool ok=true;\\n\\t\\tint need=field[0][0]+field[1][1]+field[2][2];\\n\\t\\tneed%=mod;\\n\\t\\tfor (int y = 0; y < 3; ++y) {\\n\\t\\t\\tint asum=0;\\n\\t\\t\\tfor (int x = 0; x < 3; ++x) {\\n\\t\\t\\t\\tasum+=field[y][x];\\n\\t\\t\\t}\\n\\t\\t\\tif(asum%mod!=need)ok=false;\\n\\t\\t}\\n\\t\\tfor (int x = 0; x < 3; ++x) {\\n\\t\\t\\tint asum=0;\\n\\t\\t\\tfor (int y = 0; y < 3; ++y) {\\n\\t\\t\\t\\tasum+=field[y][x];\\n\\t\\t\\t}\\n\\t\\t\\tif(asum%mod != need)ok=false;\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < 2; ++i) {\\n\\t\\t\\tint asum=0;\\n\\t\\t\\tfor (int j = 0; j < 3; ++j) {\\n\\t\\t\\t\\tasum+=field[j][i?j:2-j];\\n\\t\\t\\t}\\n\\t\\t\\tif(asum%mod != need)ok=false;\\n\\t\\t}\\n\\t\\tif (ok) {\\n\\t\\t\\tanss.emplace_back(v);\\n\\t\\t}\\n\\t}while(next_permutation(v.begin(),v.end()));\\n\\n\\twhile (true){\\n\\t\\tvector<int>v(10);\\n\\t\\tfor(int i=0;i<10;++i)cin>>v[i];\\n\\t\\tif(v[0]==-1)break;\\n\\t\\tint sum=0;\\n\\t\\tfor (auto && ans : anss) {\\n\\t\\t\\tbool ok=true;\\n\\t\\t\\tfor (int i = 0; i < 10; ++i) {\\n\\t\\t\\t\\tif(v[i]&&v[i]!=ans[i])ok=false;\\n\\t\\t\\t}\\n\\t\\t\\tif(ok)sum++;\\n\\t\\t}\\n\\t\\tcout<<sum<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 580,\n \"memory_kb\": 28260,\n \"score_of_the_acc\": -1.1938,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2058_2584461\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\nstruct Info{\\n\\tint table[3][3];\\n\\tint mod_num,used,decided_num;\\n};\\n\\nint POW[11];\\n\\nint ans;\\n\\nbool check(Info info){\\n\\n\\tbool check_table[10];\\n\\tfor(int i = 0; i < 10; i++)check_table[i] = false;\\n\\tint row_0_num,row_1_num,row_2_num,col_0_num,col_1_num,col_2_num,cross_0_num,cross_1_num;\\n\\n\\tif(info.table[0][0] == 0 || info.table[0][1] == 0 || info.table[0][2] == 0){\\n\\n\\t}else{\\n\\t\\trow_0_num = (info.table[0][0]+info.table[0][1]+info.table[0][2])%info.mod_num;\\n\\t\\tcheck_table[row_0_num] = true;\\n\\t}\\n\\n\\tif(info.table[1][0] == 0 || info.table[1][1] == 0 || info.table[1][2] == 0){\\n\\n\\t}else{\\n\\t\\trow_1_num = (info.table[1][0]+info.table[1][1]+info.table[1][2])%info.mod_num;\\n\\t\\tcheck_table[row_1_num] = true;\\n\\t}\\n\\n\\tif(info.table[2][0] == 0 || info.table[2][1] == 0 || info.table[2][2] == 0){\\n\\n\\t}else{\\n\\t\\trow_2_num = (info.table[2][0]+info.table[2][1]+info.table[2][2])%info.mod_num;\\n\\t\\tcheck_table[row_2_num] = true;\\n\\t}\\n\\n\\tif(info.table[0][0] == 0 || info.table[1][0] == 0 || info.table[2][0] == 0){\\n\\n\\t}else{\\n\\t\\tcol_0_num = (info.table[0][0]+info.table[1][0]+info.table[2][0])%info.mod_num;\\n\\t\\tcheck_table[col_0_num] = true;\\n\\t}\\n\\n\\tif(info.table[0][1] == 0 || info.table[1][1] == 0 || info.table[2][1] == 0){\\n\\n\\t}else{\\n\\t\\tcol_1_num = (info.table[0][1]+info.table[1][1]+info.table[2][1])%info.mod_num;\\n\\t\\tcheck_table[col_1_num] = true;\\n\\t}\\n\\n\\tif(info.table[0][2] == 0 || info.table[1][2] == 0 || info.table[2][2] == 0){\\n\\n\\t}else{\\n\\t\\tcol_2_num = (info.table[0][2]+info.table[1][2]+info.table[2][2])%info.mod_num;\\n\\t\\tcheck_table[col_2_num] = true;\\n\\t}\\n\\n\\tif(info.table[0][0] == 0 || info.table[1][1] == 0 || info.table[2][2] == 0){\\n\\n\\t}else{\\n\\t\\tcross_0_num = (info.table[0][0]+info.table[1][1]+info.table[2][2])%info.mod_num;\\n\\t\\tcheck_table[cross_0_num] = true;\\n\\t}\\n\\n\\tif(info.table[0][2] == 0 || info.table[1][1] == 0 || info.table[2][0] == 0){\\n\\n\\t}else{\\n\\t\\tcross_1_num = (info.table[0][2]+info.table[1][1]+info.table[2][0])%info.mod_num;\\n\\t\\tcheck_table[cross_1_num] = true;\\n\\t}\\n\\n\\tint count = 0;\\n\\tfor(int i = 0; i < 10; i++){\\n\\t\\tif(check_table[i]){\\n\\t\\t\\tcount++;\\n\\t\\t}\\n\\t}\\n\\n\\treturn count <= 1;\\n\\n}\\n\\nvoid copyInfo(Info& to,Info from){\\n\\tfor(int row = 0; row < 3; row++){\\n\\t\\tfor(int col = 0; col < 3; col++){\\n\\t\\t\\tto.table[row][col] = from.table[row][col];\\n\\t\\t}\\n\\t}\\n\\tto.mod_num = from.mod_num;\\n}\\n\\nvoid recursive(Info info){\\n\\n\\tif(info.decided_num == 10){\\n\\n\\t\\tif(check(info)){\\n\\t\\t\\tans++;\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\n\\n\\tif(info.mod_num == 0){\\n\\t\\tfor(int loop = 1; loop <= 10; loop++){\\n\\t\\t\\tif(info.used & (1 << loop)){\\n\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tInfo new_info;\\n\\t\\t\\t\\tcopyInfo(new_info,info);\\n\\t\\t\\t\\tnew_info.mod_num = loop;\\n\\t\\t\\t\\tnew_info.decided_num = info.decided_num+1;\\n\\t\\t\\t\\tnew_info.used = info.used + POW[loop];\\n\\t\\t\\t\\tif(check(new_info)){\\n\\t\\t\\t\\t\\trecursive(new_info);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\n\\tfor(int row = 0; row < 3; row++){\\n\\t\\tfor(int col = 0; col < 3; col++){\\n\\t\\t\\tif(info.table[row][col] == 0){\\n\\t\\t\\t\\tfor(int loop = 1; loop <= 10; loop++){\\n\\t\\t\\t\\t\\tif(info.used & (1 << loop)){\\n\\t\\t\\t\\t\\t\\t//Do nothing\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tInfo new_info;\\n\\t\\t\\t\\t\\t\\tcopyInfo(new_info,info);\\n\\t\\t\\t\\t\\t\\tnew_info.table[row][col] = loop;\\n\\t\\t\\t\\t\\t\\tnew_info.decided_num = info.decided_num+1;\\n\\t\\t\\t\\t\\t\\tnew_info.used = info.used + POW[loop];\\n\\t\\t\\t\\t\\t\\tif(check(new_info)){\\n\\t\\t\\t\\t\\t\\t\\trecursive(new_info);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\tfor(int i = 1; i <= 10; i++)POW[i] = pow(2,i);\\n\\n\\twhile(true){\\n\\t\\tInfo first;\\n\\t\\tfor(int row = 0; row < 3; row++){\\n\\t\\t\\tfor(int col = 0; col < 3; col++)scanf(\\\"%d\\\",&first.table[row][col]);\\n\\t\\t}\\n\\t\\tscanf(\\\"%d\\\",&first.mod_num);\\n\\n\\t\\tif(first.table[0][0] == -1)break;\\n\\n\\t\\tfirst.used = 0;\\n\\t\\tfirst.decided_num = 0;\\n\\n\\t\\tfor(int row = 0; row < 3; row++){\\n\\t\\t\\tfor(int col = 0; col < 3; col++){\\n\\t\\t\\t\\tif(first.table[row][col] != 0){\\n\\t\\t\\t\\t\\tfirst.used += POW[first.table[row][col]];\\n\\t\\t\\t\\t\\tfirst.decided_num++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(first.mod_num != 0){\\n\\t\\t\\tfirst.used += POW[first.mod_num];\\n\\t\\t\\tfirst.decided_num++;\\n\\t\\t}\\n\\n\\t\\tans = 0;\\n\\n\\t\\trecursive(first);\\n\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -0.1284,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2058_2324903\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint t[9],d;\\nbool used[11];\\nbool C(void){\\n int r=(t[0]+t[1]+t[2])%t[9];\\n return ((t[3]+t[4]+t[5])%t[9]==r&&(t[6]+t[7]+t[8])%t[9]==r&&(t[0]+t[3]+t[6])%t[9]==r&&(t[1]+t[4]+t[7])%t[9]==r&&(t[2]+t[5]+t[8])%t[9]==r&&(t[0]+t[4]+t[8])%t[9]==r&&(t[2]+t[4]+t[6])%t[9]==r);\\n}\\n \\nint dfs(int d){\\n if(d==10)return C()?1:0;\\n if(t[d]!=0)return dfs(d+1);\\n int res = 0;\\n for(int i=1;i<=10;i++){\\n if(!used[i]){\\n t[d]=i;\\n used[i]=1;\\n res+=dfs(d+1);\\n used[i]=0;\\n t[d]=0;\\n }\\n }\\n return res;\\n}\\nmain(){\\n while(1){\\n memset(used,0,sizeof(used));\\n for(int i=0;i<10;i++){\\n cin>>t[i];\\n if(t[i]>0)used[t[i]]=1;\\n }\\n if(t[0]==-1)break;\\n cout<<dfs(0)<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3040,\n \"score_of_the_acc\": -0.1071,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2058_2324900\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint t[9],d;\\nbool used[11];\\nbool C(void){\\n int r=(t[0]+t[1]+t[2])%t[9];\\n return ((t[3]+t[4]+t[5])%t[9]==r&&(t[6]+t[7]+t[8])%t[9]==r&&(t[0]+t[3]+t[6])%t[9]==r&&(t[1]+t[4]+t[7])%t[9]==r&&(t[2]+t[5]+t[8])%t[9]==r&&(t[0]+t[4]+t[8])%t[9]==r&&(t[2]+t[4]+t[6])%t[9]==r);\\n}\\n \\nint dfs(int d){\\n if(d==10)return C()?1:0;\\n if(t[d]!=0)return dfs(d+1);\\n int res = 0;\\n for(int i=1;i<=10;i++){\\n if(!used[i]){\\n t[d] = i;\\n used[i] = true;\\n res+=dfs(d+1);\\n used[i] = false;\\n t[d] = 0;\\n }\\n }\\n return res;\\n}\\nmain(){\\n while(1){\\n memset(used,0,sizeof(used));\\n for(int i=0;i<10;i++){\\n cin>>t[i];\\n if(t[i]>0)used[t[i]]=1;\\n }\\n if(t[0]==-1)break;\\n cout<<dfs(0)<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 2964,\n \"score_of_the_acc\": -0.1043,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2058_2276281\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nbool u[11];\\nint a[10],x,y;\\nbool ck() {\\n if(a[0]&&a[1]&&a[2]&&(a[0]+a[1]+a[2])%x!=y) return 0;\\n if(a[3]&&a[4]&&a[5]&&(a[3]+a[4]+a[5])%x!=y) return 0;\\n if(a[6]&&a[7]&&a[8]&&(a[6]+a[7]+a[8])%x!=y) return 0;\\n if(a[0]&&a[3]&&a[6]&&(a[0]+a[3]+a[6])%x!=y) return 0;\\n if(a[1]&&a[4]&&a[7]&&(a[1]+a[4]+a[7])%x!=y) return 0;\\n if(a[2]&&a[5]&&a[8]&&(a[2]+a[5]+a[8])%x!=y) return 0;\\n if(a[0]&&a[4]&&a[8]&&(a[0]+a[4]+a[8])%x!=y) return 0;\\n if(a[2]&&a[4]&&a[6]&&(a[2]+a[4]+a[6])%x!=y) return 0;\\n return 1;\\n}\\n \\nint dfs(int k) {\\n if(!ck()) return 0;\\n if(k==9) return 1;\\n int ans=0;\\n if(a[k]) ans+=dfs(k+1);\\n else {\\n for(int i=1; i<=10; i++) {\\n if(u[i]) continue;\\n a[k]=i;u[i]=1;\\n ans+=dfs(k+1);\\n a[k]=0;u[i]=0;\\n }\\n }\\n return ans;\\n}\\n \\nint main() {\\n while(1) {\\n memset(u,0,sizeof(u));\\n for(int i=0; i<10; i++) {\\n cin >> a[i];\\n u[a[i]]=1;\\n }\\n if(a[0]==-1) break;\\n x=a[9];\\n int ans=0;\\n if(!x) {\\n for(int i=1; i<11; i++) {\\n if(u[i]) continue;\\n x=i;\\n u[i]=1;\\n for(int j=0; j<x; j++) {y=j;ans+=dfs(0);}\\n u[i]=0;\\n }\\n } else {\\n for(int j=0; j<x; j++) {y=j;ans+=dfs(0);}\\n }\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3092,\n \"score_of_the_acc\": -0.083,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2058_2275830\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define index ffff\\nusing namespace std;\\n\\nint d[10],ans;\\nint index[10];\\nint M;\\n\\nint cal(int a,int b,int c){\\n \\n return (index[a]+index[b]+index[c])%M;\\n \\n}\\n\\n\\nbool check(){\\n \\n M=index[9];\\n \\n int X=cal(0,1,2);\\n \\n if(X!=cal(3,4,5))return false;\\n \\n if(X!=cal(6,7,8))return false;\\n\\n if(X!=cal(0,3,6))return false;\\n\\n if(X!=cal(1,4,7))return false;\\n \\n if(X!=cal(2,5,8))return false;\\n \\n if(X!=cal(0,4,8))return false;\\n \\n if(X!=cal(2,4,6))return false;\\n\\n return true;\\n \\n}\\n\\nvoid solve(){\\n \\n\\n for(int i=0;i<10;i++) index[i]=i+1;\\n\\n\\n do{\\n int f=0;\\n \\n for(int i=0;i<10;i++)\\n if(d[i]!=0&&d[i]!=index[i]){\\n\\tf=1;\\n\\tbreak;\\n }\\n\\n if(f)continue;\\n \\n if(check())ans++;\\n \\n }while(next_permutation(index,index+10));\\n \\n}\\n\\n\\nint main(){\\n\\n while(1){\\n \\n for(int i=0;i<10;i++) cin>>d[i];\\n \\n if(d[0]<0)break;\\n\\n ans=0;\\n \\n solve();\\n \\n cout<<ans<<endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 3016,\n \"score_of_the_acc\": -0.1992,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2058_2275811\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nbool u[11];\\nint a[10],x,y;\\nbool ck() {\\n if(a[0]&&a[1]&&a[2]&&(a[0]+a[1]+a[2])%x!=y) return 0;\\n if(a[3]&&a[4]&&a[5]&&(a[3]+a[4]+a[5])%x!=y) return 0;\\n if(a[6]&&a[7]&&a[8]&&(a[6]+a[7]+a[8])%x!=y) return 0;\\n if(a[0]&&a[3]&&a[6]&&(a[0]+a[3]+a[6])%x!=y) return 0;\\n if(a[1]&&a[4]&&a[7]&&(a[1]+a[4]+a[7])%x!=y) return 0;\\n if(a[2]&&a[5]&&a[8]&&(a[2]+a[5]+a[8])%x!=y) return 0;\\n if(a[0]&&a[4]&&a[8]&&(a[0]+a[4]+a[8])%x!=y) return 0;\\n if(a[2]&&a[4]&&a[6]&&(a[2]+a[4]+a[6])%x!=y) return 0;\\n return 1;\\n}\\n\\nint dfs(int k) {\\n if(!ck()) return 0;\\n if(k==9) return 1;\\n int ans=0;\\n if(a[k]) ans+=dfs(k+1);\\n else {\\n for(int i=1; i<=10; i++) {\\n if(u[i]) continue;\\n a[k]=i;\\n u[i]=1;\\n ans+=dfs(k+1);\\n a[k]=0;\\n u[i]=0;\\n }\\n }\\n return ans;\\n}\\n\\nint main() {\\n while(1) {\\n memset(u,0,sizeof(u));\\n for(int i=0; i<10; i++) {\\n cin >> a[i];\\n u[a[i]]=1;\\n }\\n if(a[0]==-1) break;\\n x=a[9];\\n int ans=0;\\n if(!x) {\\n for(int i=1; i<11; i++) {\\n if(u[i]) continue;\\n x=i;\\n u[i]=1;\\n for(int j=0; j<x; j++) {\\n y=j;\\n ans+=dfs(0);\\n }\\n u[i]=0;\\n }\\n } else {\\n for(int j=0; j<x; j++) {\\n y=j;\\n ans+=dfs(0);\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3096,\n \"score_of_the_acc\": -0.0868,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2058_2275714\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\nint diff[10];\\nint num[]={1,2,3,4,5,6,7,8,9,10};\\n\\nbool check(){\\n int A[3][3],mod = num[9];\\n for(int i=0;i<10;i++)if(diff[i]>0&&num[i]!=diff[i])return 0;\\n for(int i=0;i<9;i++) A[i/3][i%3] = num[i];\\n\\n\\n int used[20]={};\\n for(int i=0;i<3;i++){\\n int a=0,b=0; \\n for(int j=0;j<3;j++)a+=A[i][j],b+=A[j][i];\\n a%=mod,b%=mod;\\n used[a]++;\\n used[b]++;\\n if(used[a]!=(i+1)*2)return 0; \\n }\\n \\nint a =A[0][0]+A[1][1]+A[2][2],b = A[0][2]+A[1][1]+A[2][0];\\nused[a%mod]++,used[b%mod]++;\\n return used[a%mod] == 8;\\n}\\n\\nsigned main(){\\n\\n while(1){\\n int Exit = 1;\\n for(int i=0;i<10;i++)cin>>diff[i],Exit*=(diff[i]<0);\\n if(Exit) return 0;\\n\\n for(int i=0;i<10;i++)num[i] = i+1;\\n\\n int ans=0;\\n do{\\n ans+=check();\\n }while(next_permutation(num,num+10));\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 570,\n \"memory_kb\": 3032,\n \"score_of_the_acc\": -0.2667,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2058_1893505\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef pair<int,pii> pip;\\ntypedef vector<pip>vip;\\nconst double PI=acos(-1);\\nconst double EPS=1e-8;\\nconst int inf=1e8;\\nint m;\\nvi tmp;\\nint w[8][3]={\\n\\t{0,1,2},\\n\\t{3,4,5},\\n\\t{6,7,8},\\n\\t{0,3,6},\\n\\t{1,4,7},\\n\\t{2,5,8},\\n\\t{0,4,8},\\n\\t{2,4,6}\\n};\\nvi in;\\nbool f(){\\n\\tvi su(8);\\n\\trep(i,8){\\n\\t\\tint sum=0;\\n\\t\\trep(j,3)sum+=tmp[w[i][j]];\\n\\t\\tsu[i]=sum%m;\\n\\t}\\n\\tbool h=true;\\n\\trep(i,8)if(su[0]!=su[i])h=false;\\n\\treturn h;\\n}\\nint main(){\\n\\twhile(1){\\n\\t\\tin=vi(10);\\n\\t\\trep(i,10)cin>>in[i];\\n\\t\\tif(in[0]==-1)break;\\n\\t\\ttmp=vi(11);\\n\\t\\trep(i,10)tmp[in[i]]++;\\n\\t\\tvi per;\\n\\t\\trep(i,10)if(tmp[i+1]==0)per.pb(i+1);\\n\\t\\tint out=0;\\n\\t\\tdo{\\n\\t\\t\\ttmp=in;\\n\\t\\t\\tint c=0;\\n\\t\\t\\trep(i,10)if(tmp[i]==0)tmp[i]=per[c],c++;\\n\\t\\t\\tm=tmp[9];\\n\\t\\t\\tout+=f();\\n\\t\\t}while(next_permutation(all(per)));\\n\\t\\tcout<<out<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 430,\n \"memory_kb\": 1216,\n \"score_of_the_acc\": -0.1481,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2058_1882421\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\\n \\nint c[10];\\n \\nbool check(){\\n int sum = 0, MOD = c[9];\\n rep(i,3) sum = (sum + c[i]) % MOD; \\n if((c[3]+c[4]+c[5])%MOD != sum) return false;\\n if((c[6]+c[7]+c[8])%MOD != sum) return false;\\n if((c[0]+c[3]+c[6])%MOD != sum) return false;\\n if((c[1]+c[4]+c[7])%MOD != sum) return false;\\n if((c[2]+c[5]+c[8])%MOD != sum) return false;\\n if((c[0]+c[4]+c[8])%MOD != sum) return false;\\n if((c[2]+c[4]+c[6])%MOD != sum) return false;\\n return true;\\n}\\n \\nint rec(int p,int S){\\n int res = 0;\\n if(__builtin_popcount(S) == 10){\\n\\treturn check();\\n }\\n if(!c[p]){\\n\\trep(i,10){\\n\\t if((S >> i) & 1) continue;\\n\\t c[p] = i+1;\\n\\t res += rec(p+1,S|(1<<i));\\n\\t c[p] = 0;\\n\\t}\\n }else{\\n\\tres += rec(p+1,S);\\n }\\n return res;\\n}\\n \\nint main(){\\n while(true){\\n\\tint S = 0;\\n\\tbool EXIT = false;\\n\\trep(i,10){\\n\\t cin >> c[i];\\n\\t if(c[i] > 0){\\n\\t\\tS |= 1<<(c[i]-1);\\n\\t }else if(c[i] == -1){\\n\\t\\tEXIT = true;\\n\\t }\\n\\t}\\n\\tif(EXIT) break;\\n\\tcout << rec(0,S) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 3048,\n \"score_of_the_acc\": -0.1297,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2058_1822775\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\nusing namespace std;\\nint a[10];\\nint main() {\\n\\twhile (true) {\\n\\t\\tfor (int i = 0; i < 10; i++)cin >> a[i];\\n\\t\\tif (a[0] == -1)break;\\n\\t\\tint b[10] = { 0,1,2,3,4,5,6,7,8,9 }; int cnt = 0;\\n\\t\\tdo {\\n\\t\\t\\tint OK = 1; int f[10];\\n\\t\\t\\tfor (int i = 0; i < 10; i++)f[i] = b[i] + 1;\\n\\t\\t\\tfor (int i = 0; i < 10; i++) {\\n\\t\\t\\t\\tif (a[i] >= 1 && a[i] != f[i])OK = 0;\\n\\t\\t\\t}\\n\\t\\t\\tif (OK == 0)continue;\\n\\t\\t\\tint c[4][4];\\n\\t\\t\\tfor (int i = 0; i < 16; i++)c[i / 4][i % 4] = 0;\\n\\t\\t\\tfor (int i = 0; i < 9; i++) {\\n\\t\\t\\t\\tc[i / 3][i % 3] = f[i];\\n\\t\\t\\t\\tc[3][i % 3] += f[i]; c[3][i % 3] %= f[9];\\n\\t\\t\\t\\tc[i / 3][3] += f[i]; c[i / 3][3] %= f[9];\\n\\t\\t\\t}\\n\\t\\t\\tif (c[3][0] != c[3][1] || c[3][1] != c[3][2])continue;\\n\\t\\t\\tif (c[0][3] != c[1][3] || c[1][3] != c[2][3])continue;\\n\\t\\t\\tint d1 = c[0][0] + c[1][1] + c[2][2]; d1 %= f[9];\\n\\t\\t\\tint d2 = c[0][2] + c[1][1] + c[2][0]; d2 %= f[9];\\n\\t\\t\\tif (c[3][0] != d1 || d1 != d2)continue;\\n\\t\\t\\tcnt++;\\n\\t\\t} while (next_permutation(b, b + 10));\\n\\t\\tcout << cnt << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1570,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": -0.5699,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2058_1819961\",\n \"code_snippet\": \"#include <cstdio>\\nint a[10], e[8], used[11];\\nbool ok() {\\n\\tfor (int i = 0; i < 3; i++) e[i] = (a[i] + a[i + 3] + a[i + 6]) % a[9];\\n\\tfor (int i = 0; i < 3; i++) e[i + 3] = (a[i * 3] + a[i * 3 + 1] + a[i * 3 + 2]) % a[9];\\n\\te[6] = (a[2] + a[4] + a[6]) % a[9];\\n\\te[7] = (a[0] + a[4] + a[8]) % a[9];\\n\\tfor (int i = 0; i < 7; i++) if (e[i] != e[i + 1]) return false;\\n\\treturn true;\\n}\\nint solve(int depth) {\\n\\tif (depth == 10) return ok() ? 1 : 0;\\n\\tif (a[depth]) return solve(depth + 1);\\n\\tint ret = 0;\\n\\tfor (int i = 1; i <= 10; i++) {\\n\\t\\tif (!used[i]) {\\n\\t\\t\\tused[i] = 1; a[depth] = i;\\n\\t\\t\\tret += solve(depth + 1);\\n\\t\\t\\tused[i] = a[depth] = 0;\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\nint main() {\\n\\twhile (true) {\\n\\t\\tfor (int i = 1; i < 11; i++) used[i] = 0;\\n\\t\\tfor (int i = 0; i < 10; i++) {\\n\\t\\t\\tscanf(\\\"%d\\\", a + i);\\n\\t\\t\\tif (a[i]) used[a[i]] = 1;\\n\\t\\t}\\n\\t\\tif (a[0] == -1) break;\\n\\t\\tprintf(\\\"%d\\\\n\\\", solve(0));\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 2604,\n \"score_of_the_acc\": -0.1097,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2058_1366604\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\n/* typedef */\\n\\n/* global variables */\\n\\nint ds[10];\\nbool used[11];\\n\\n/* subroutines */\\n\\ninline int dsum(int i0, int i1, int i2) {\\n return (ds[i0] + ds[i1] + ds[i2]) % ds[9];\\n}\\n\\nbool check() {\\n int diag0 = dsum(0, 4, 8);\\n return\\n dsum(2, 4, 6) == diag0 &&\\n dsum(0, 1, 2) == diag0 &&\\n dsum(3, 4, 5) == diag0 &&\\n dsum(6, 7, 8) == diag0 &&\\n dsum(0, 3, 6) == diag0 &&\\n dsum(1, 4, 7) == diag0 &&\\n dsum(2, 5, 8) == diag0;\\n}\\n\\nint rec(int k) {\\n if (k >= 10) return check();\\n\\n if (ds[k] == 0) {\\n int sum = 0;\\n for (int d = 1; d <= 10; d++)\\n if (! used[d]) {\\n\\tds[k] = d;\\n\\tused[d] = true;\\n\\tsum += rec(k + 1);\\n\\tds[k] = 0;\\n\\tused[d] = false;\\n }\\n return sum;\\n }\\n\\n return rec(k + 1);\\n}\\n\\n/* main */\\n\\nint main() {\\n for (;;) {\\n cin >> ds[0];\\n if (ds[0] == -1) break;\\n\\n for (int i = 1; i < 10; i++) cin >> ds[i];\\n\\n memset(used, false, sizeof(used));\\n\\n for (int i = 0; i < 10; i++)\\n if (ds[i] > 0) used[ds[i]] = true;\\n\\n cout << rec(0) << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": -0.0606,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2058_1171624\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <cstdio>\\n#include <iostream>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n#include <complex>\\n#include <assert.h>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <double,double> P;\\n \\nstatic const int tx[] = {+0,+1,+0,-1};\\nstatic const int ty[] = {-1,+0,+1,+0};\\n \\nstatic const double EPS = 1e-8;\\n\\nint table[3][3];\\n\\nbool check(int mod){\\n set<int> result;\\n for(int y = 0; y < 3; y++){\\n int sum = 0;\\n for(int x = 0; x < 3; x++){\\n sum += table[y][x];\\n }\\n result.insert(sum % mod);\\n }\\n if(result.size() > 1) return false;\\n\\n for(int x = 0; x < 3; x++){\\n int sum = 0;\\n for(int y = 0; y < 3; y++){\\n sum += table[y][x];\\n }\\n result.insert(sum % mod);\\n }\\n if(result.size() > 1) return false;\\n\\n result.insert((table[0][0] + table[1][1] + table[2][2]) % mod);\\n result.insert((table[0][2] + table[1][1] + table[2][0]) % mod);\\n return (result.size() == 1);\\n}\\n\\nint dfs(int pos,int used,int mod){\\n if(pos >= 9 && check(mod)){\\n return 1;\\n }\\n else if(pos >= 9){\\n return 0;\\n }\\n int res = 0;\\n int x = pos % 3;\\n int y = pos / 3;\\n\\n if(table[y][x] == 0){\\n for(int i = 1; i <= 10; i++){\\n if(used & (1<<i)) continue;\\n table[y][x] = i;\\n res += dfs(pos + 1, used | (1<<i),mod);\\n table[y][x] = 0;\\n }\\n }\\n else{\\n res += dfs(pos + 1, used,mod);\\n }\\n return res;\\n}\\n\\nint main(){\\n while(~scanf(\\\"%d\\\",&table[0][0])){\\n int used = 0;\\n if(table[0][0] != 0){\\n used |= (1<<table[0][0]);\\n }\\n\\n for(int y = 0; y < 3; y++){\\n for(int x = 0; x < 3; x++){\\n if(y == 0 && x == 0) continue;\\n scanf(\\\"%d\\\",&table[y][x]);\\n if(table[y][x] != 0){\\n used |= (1<<table[y][x]);\\n }\\n }\\n }\\n int mod;\\n scanf(\\\"%d\\\",&mod);\\n if(mod == -1) break;\\n\\n used |= (1<<mod);\\n int res = 0;\\n if(mod == 0){\\n int prev = used;\\n for(int i = 1; i <= 10; i++){\\n if(used & (1<<i)) continue;\\n used |= (1<<i);\\n mod = i;\\n res += dfs(0,used,mod);\\n used = prev;\\n }\\n }\\n else{\\n res += dfs(0,used,mod);\\n }\\n printf(\\\"%d\\\\n\\\",res);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 730,\n \"memory_kb\": 1184,\n \"score_of_the_acc\": -0.2585,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2058_1171623\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <cstdio>\\n#include <iostream>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n#include <complex>\\n#include <assert.h>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <double,double> P;\\n \\nstatic const int tx[] = {+0,+1,+0,-1};\\nstatic const int ty[] = {-1,+0,+1,+0};\\n \\nstatic const double EPS = 1e-8;\\n\\nint table[3][3];\\n\\nbool check(int mod){\\n set<int> result;\\n for(int y = 0; y < 3; y++){\\n int sum = 0;\\n for(int x = 0; x < 3; x++){\\n sum += table[y][x];\\n }\\n result.insert(sum % mod);\\n }\\n for(int x = 0; x < 3; x++){\\n int sum = 0;\\n for(int y = 0; y < 3; y++){\\n sum += table[y][x];\\n }\\n result.insert(sum % mod);\\n }\\n result.insert((table[0][0] + table[1][1] + table[2][2]) % mod);\\n result.insert((table[0][2] + table[1][1] + table[2][0]) % mod);\\n return (result.size() == 1);\\n}\\n\\nint dfs(int pos,int used,int mod){\\n if(pos >= 9 && check(mod)){\\n return 1;\\n }\\n else if(pos >= 9){\\n return 0;\\n }\\n int res = 0;\\n int x = pos % 3;\\n int y = pos / 3;\\n\\n if(table[y][x] == 0){\\n for(int i = 1; i <= 10; i++){\\n if(used & (1<<i)) continue;\\n table[y][x] = i;\\n res += dfs(pos + 1, used | (1<<i),mod);\\n table[y][x] = 0;\\n }\\n }\\n else{\\n res += dfs(pos + 1, used,mod);\\n }\\n return res;\\n}\\n\\nint main(){\\n while(~scanf(\\\"%d\\\",&table[0][0])){\\n int used = 0;\\n if(table[0][0] != 0){\\n used |= (1<<table[0][0]);\\n }\\n\\n for(int y = 0; y < 3; y++){\\n for(int x = 0; x < 3; x++){\\n if(y == 0 && x == 0) continue;\\n scanf(\\\"%d\\\",&table[y][x]);\\n if(table[y][x] != 0){\\n used |= (1<<table[y][x]);\\n }\\n }\\n }\\n int mod;\\n scanf(\\\"%d\\\",&mod);\\n if(mod == -1) break;\\n\\n used |= (1<<mod);\\n int res = 0;\\n if(mod == 0){\\n int prev = used;\\n for(int i = 1; i <= 10; i++){\\n if(used & (1<<i)) continue;\\n used |= (1<<i);\\n mod = i;\\n res += dfs(0,used,mod);\\n used = prev;\\n }\\n }\\n else{\\n res += dfs(0,used,mod);\\n }\\n printf(\\\"%d\\\\n\\\",res);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1310,\n \"memory_kb\": 1188,\n \"score_of_the_acc\": -0.4743,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2058_1123659\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\n\\n\\nint p[11] = {};\\nint can[11] = {};\\nint m;\\n\\nint check(int t){\\n\\tif( t < 4 ) return true;\\n\\t//if( t == 4 ) return (p[1]+p[4]+p[7]) % p[9] == 0;\\n\\tint c = (p[1]+p[4]+p[7]) % p[9];\\n\\tif( t == 5 ) return (p[0]+p[4]+p[8]) % p[9] == c;\\n\\tif( t == 6 ) return (p[0]+p[1]+p[2]) % p[9] == c;\\n\\tif( t == 7 ) return (p[2]+p[5]+p[8]) % p[9] == c;\\n\\tif( t == 8 ) return (p[6]+p[7]+p[8]) % p[9] == c && (p[2]+p[4]+p[6]) % p[9] == c;\\n\\tif( t == 9 ) return (p[0]+p[3]+p[6]) % p[9] == c && (p[3]+p[4]+p[5]) % p[9] == c;\\n\\treturn true;\\n}\\n//\\n\\nint d[] = {9,0,1,4,7,8,2,5,6,3};\\n\\nint solve(int t){\\n\\t/*cout << t << endl;\\n\\tcout << \\\"[\\\" << p[9] << \\\"]\\\" << endl;\\n\\tfor(int i = 0 ; i < 3 ; i++){\\n\\t\\tfor(int j = 0 ; j < 3 ; j++) cout << p[i*3+j] << \\\" \\\";\\n\\t\\tcout << endl;\\n\\t}\\n\\t*/\\n\\tif( !check(t-1) ) return 0;\\n\\tif( t == 10 ){\\n\\t\\treturn 1;\\n\\t}\\n\\tint x = d[t];\\n\\tif( p[x] == 0 ){\\n\\t\\tint ans = 0;\\n\\t\\tfor(int i = 1 ; i <= 10 ; i++){\\n\\t\\t\\tif( can[i] ){\\n\\t\\t\\t\\tcan[i] = false;\\n\\t\\t\\t\\tp[x] = i;\\n\\t\\t\\t\\tans += solve(t+1);\\n\\t\\t\\t\\tp[x] = 0;\\n\\t\\t\\t\\tcan[i] = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}else{\\n\\t\\treturn solve(t+1);\\n\\t\\t\\n\\t}\\n}\\n\\nint main(){\\n\\twhile(1){\\n\\t\\tfor(int i = 0 ; i < 11 ; i++) can[i] = true;\\n\\t\\t\\n\\t\\tfor(int i = 0 ; i < 10 ; i++){\\n\\t\\t\\tcin >> p[i];\\n\\t\\t\\tcan[p[i]] = false;\\n\\t\\t}\\n\\t\\tif(p[0]==-1)break;\\n\\t\\tcout << solve(0) << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": -0.0048,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2058_1110749\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nint a[11];\\nint used[11];\\nint sv=0;\\nint solve(int v){\\n\\tif(v==9){\\n\\t//\\tfor(int i=1;i<11;i++)if(!used[i])return 0;\\n\\t\\treturn 1;\\n\\t}\\n\\tint ret=0;\\n\\tif(a[v]){\\n\\t\\tbool ok=true;\\n\\t\\tint i=a[v];\\n\\t\\tif(v==2)sv=(a[0]+a[1]+a[2])%a[9];\\n\\t\\tif(v%3==2){\\n\\t\\t\\tif((a[v-2]+a[v-1]+i)%a[9]!=sv)ok=false;\\n\\t\\t}\\n\\t\\tif(v>=6){\\n\\t\\t\\tif((a[v-6]+a[v-3]+i)%a[9]!=sv)ok=false;\\n\\t\\t}\\n\\t\\tif(v==6){\\n\\t\\t\\tif((a[2]+a[4]+i)%a[9]!=sv)ok=false;\\n\\t\\t}\\n\\t\\tif(v==8){\\n\\t\\t\\tif((a[0]+a[4]+i)%a[9]!=sv)ok=false;\\n\\t\\t}\\n\\t\\tif(ok){\\n\\t\\t\\treturn solve(v+1);\\n\\t\\t}else return 0;\\n\\t}\\n\\tfor(int i=1;i<=10;i++){\\n\\t\\tif(used[i])continue;\\n\\t\\tbool ok=true;\\n\\t\\tif(v==2)sv=(a[0]+a[1]+i)%a[9];\\n\\t\\tif(v%3==2){\\n\\t\\t\\tif((a[v-2]+a[v-1]+i)%a[9]!=sv)ok=false;\\n\\t\\t}\\n\\t\\tif(v>=6){\\n\\t\\t\\tif((a[v-6]+a[v-3]+i)%a[9]!=sv)ok=false;\\n\\t\\t}\\n\\t\\tif(v==6){\\n\\t\\t\\tif((a[2]+a[4]+i)%a[9]!=sv)ok=false;\\n\\t\\t}\\n\\t\\tif(v==8){\\n\\t\\t\\tif((a[0]+a[4]+i)%a[9]!=sv)ok=false;\\n\\t\\t}\\n\\t\\tif(!ok)continue;\\n\\t\\tused[i]=1;\\n\\t\\ta[v]=i;\\n\\t\\tret+=solve(v+1);\\n\\t\\tused[i]=0;\\n\\t\\ta[v]=0;\\n\\t}\\n\\t//printf(\\\"%d: %d\\\\n\\\",v,ret);\\n\\treturn ret;\\n}\\nint main(){\\n\\twhile(1){\\n\\t\\tfor(int i=0;i<10;i++)scanf(\\\"%d\\\",a+i);\\n\\t\\tif(a[0]==-1)break;\\n\\t\\tfor(int i=0;i<11;i++)used[i]=0;\\n\\t\\tfor(int i=0;i<10;i++)if(a[i])used[a[i]]=1;\\n\\t\\tif(a[9]){\\n\\t\\t\\tprintf(\\\"%d\\\\n\\\",solve(0));\\n\\t\\t}else{\\n\\t\\t\\tint ret=0;\\n\\t\\t\\tfor(int i=1;i<=10;i++){\\n\\t\\t\\t\\tif(used[i])continue;\\n\\t\\t\\t\\tused[i]=1;\\n\\t\\t\\t\\ta[9]=i;\\n\\t\\t\\t\\tret+=solve(0);\\n\\t\\t\\t\\tused[i]=0;\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"%d\\\\n\\\",ret);\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1028,\n \"score_of_the_acc\": -0.0037,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2058_1097307\",\n \"code_snippet\": \"#include<iostream>\\n\\nusing namespace std;\\n\\nint a[10];\\n\\nbool check(){\\n static int c[][3]={\\n {0,1,2},\\n {3,4,5},\\n {6,7,8},\\n {0,3,6},\\n {1,4,7},\\n {2,5,8},\\n {0,4,8},\\n {2,4,6},\\n };\\n int r=-1;\\n bool f=false;\\n for(int j=0;j<8;j++){\\n if(a[c[j][0]]==0||a[c[j][1]]==0||a[c[j][2]]==0)continue;\\n int s=(a[c[j][0]]+a[c[j][1]]+a[c[j][2]])%a[9];\\n if(r==-1){\\n r=s;\\n }else if(r!=s){\\n f=true;\\n }\\n }\\n return !f;\\n}\\n\\nint dfs(int x,int u){\\n if(x<0)return check();\\n if(a[x])return dfs(x-1,u);\\n int s=0;\\n for(int i=1;i<=10;i++){\\n if(u>>i&1)continue;\\n a[x]=i;\\n if(check()){\\n s+=dfs(x-1,u|1<<i);\\n }\\n a[x]=0;\\n }\\n return s;\\n}\\n\\nint main(){\\n for(;;){\\n int u=0;\\n for(auto &e:a){\\n cin>>e;\\n u|=1<<e;\\n }\\n if(a[0]==-1)break;\\n cout<<dfs(9,u)<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": -0.0309,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":1088,"cells":{"group_id":{"kind":"string","value":"aoj_2062_cpp"},"problem_description":{"kind":"string","value":"Problem E:\nHide-and-seek\nHide-and-seek\nis a children’s game. Players hide here and there, and one player called\nit\ntries to find all\nthe other players.\nNow you played\nit\nand found all the players, so it’s turn to hide from\nit\n. Since you have got tired of\nrunning around for finding players, you don’t want to play\nit\nagain. So you are going to hide yourself at\nthe place as far as possible from\nit\n. But where is that?\nYour task is to find the place and calculate the maximum possible distance from\nit\nto the place to hide.\nInput\nThe input contains a number of test cases.\nThe first line of each test case contains a positive integer\nN\n(\nN\n≤ 1000). The following N lines give\nthe map where hide-and-seek is played. The map consists of\nN corridors\n. Each line contains four real\nnumbers\nx\n1\n,\ny\n1\n,\nx\n2\n, and\ny\n2\n, where (\nx\n1\n,\ny\n1\n) and (\nx\n2\n,\ny\n2\n) indicate the two end points of the corridor. All\ncorridors are straight, and their widths are negligible. After these\nN\nlines, there is a line containing two\nreal numbers\nsx\nand\nsy\n, indicating the position of\nit\n. You can hide at an arbitrary place of any corridor,\nand\nit\nalways walks along corridors. Numbers in the same line are separated by a single space.\nIt is guaranteed that\nits\nstarting position (\nsx\n,\nsy\n) is located on some corridor and linked to all corridors\ndirectly or indirectly.\nThe end of the input is indicated by a line containing a single zero.\nOutput\nFor each test case, output a line containing the distance along the corridors from ‘it”s starting position\nto the farthest position. The value may contain an error less than or equal to 0.001. You may print any\nnumber of digits below the decimal point.\nSample Input\n2\n0 0 3 3\n0 4 3 1\n1 1\n0\nOutput for the Sample Input\n4.243"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2062_3114687","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\n#include <map>\n#include <utility>\n#include <queue>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\nconst double PI = acos(-1);\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\n\ntypedef complex<double> P;\ntypedef vector<P> VP;\nstruct L : array<P, 2>{\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\n L(){}\n};\n\nnamespace std{\n bool operator < (const P& a, const P& b){\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\n }\n bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){\n return (conj(a)*b).X;\n}\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\n}\nint ccw(P a, P b, P c){\n b -= a;\n c -= a;\n if(cross(b,c) > EPS) return +1; //ccw\n if(cross(b,c) < -EPS) return -1; //cw\n if(dot(b,c) < -EPS) return +2; //c-a-b\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\n return 0; //a-c-b\n}\n\nbool intersectSS(const L& a, const L& b){\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\n}\nbool intersectSP(const L& s, const P &p){\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\n}\n\nbool isParallel(const P &a, const P &b){\n return abs(cross(a,b)) < EPS;\n}\nbool isParallel(const L &a, const L &b){\n return isParallel(a[1]-a[0], b[1]-b[0]);\n}\n\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1]-l[0], m[1]-m[0]);\n double B = cross(l[1]-l[0], l[1]-m[0]);\n return m[0] + B/A *(m[1]-m[0]);\n}\n\npair<vector<vector<pair<int, double> > >, VP> arrangementEX(const vector<L> &l, const P &sp){\n vector<VP> cp(l.size());\n VP plist;\n plist.push_back(sp);\n for(int i=0; i<(int)l.size(); i++){\n for(int j=i+1; j<(int)l.size(); j++){\n if(!isParallel(l[i], l[j]) && intersectSS(l[i], l[j])){\n P cpij = crosspointLL(l[i], l[j]);\n cp[i].push_back(cpij);\n cp[j].push_back(cpij);\n plist.push_back(cpij);\n }\n }\n if(intersectSP(l[i], sp)){\n cp[i].push_back(sp);\n }\n cp[i].push_back(l[i][0]);\n cp[i].push_back(l[i][1]);\n plist.push_back(l[i][0]);\n plist.push_back(l[i][1]);\n sort(cp[i].begin(), cp[i].end());\n cp[i].erase(unique(cp[i].begin(), cp[i].end()), cp[i].end());\n for(int j=cp[i].size()-2; j>=0; j--){\n P mid = (cp[i][j] +cp[i][j+1]) /2.0;\n cp[i].push_back(mid);\n plist.push_back(mid);\n }\n sort(cp[i].begin(), cp[i].end());\n cp[i].erase(unique(cp[i].begin(), cp[i].end()), cp[i].end());\n }\n sort(plist.begin(), plist.end());\n plist.erase(unique(plist.begin(), plist.end()), plist.end());\n\n int n = plist.size();\n map<P, int> conv;\n for(int i=0; i<n; i++){\n conv[plist[i]] = i;\n }\n vector<vector<pair<int, double> > > adj(n);\n for(int i=0; i<(int)cp.size(); i++){\n for(int j=0; j<(int)cp[i].size()-1; j++){\n int jidx = conv[cp[i][j]];\n int jp1idx = conv[cp[i][j+1]];\n double dist = abs(cp[i][j] -cp[i][j+1]);\n adj[jidx].emplace_back(jp1idx, dist);\n adj[jp1idx].emplace_back(jidx, dist);\n }\n }\n for(int i=0; i<n; i++){\n sort(adj[i].begin(), adj[i].end());\n adj[i].erase(unique(adj[i].begin(), adj[i].end()), adj[i].end());\n }\n return make_pair(adj, plist);\n}\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n vector<L> l(n);\n for(int i=0; i<n; i++){\n double xs,ys,xt,yt;\n cin >> xs >> ys >> xt >> yt;\n l[i] = L(P(xs, ys), P(xt, yt));\n }\n double sx,sy;\n cin >> sx >> sy;\n P s(sx, sy);\n\n pair<vector<vector<pair<int, double> > >, VP> ret = arrangementEX(l, s);\n vector<vector<pair<int, double> > > &adj = ret.first;\n VP &plist = ret.second;\n int m = plist.size();\n int sidx = lower_bound(plist.begin(), plist.end(), s) -plist.begin();\n\n priority_queue<pair<double, int> > wait;\n wait.push(make_pair(0, sidx));\n vector<double> mincost(m, INF);\n mincost[sidx] = 0;\n while(!wait.empty()){\n double dist = -wait.top().first;\n int pos = wait.top().second;\n wait.pop();\n if(dist > mincost[pos]) continue;\n\n for(pair<int, double> next: adj[pos]){\n int npos = next.first;\n double ndist = dist +next.second;\n if(ndist +EPS < mincost[npos]){\n mincost[npos] = ndist;\n wait.push(make_pair(-ndist, npos));\n }\n }\n }\n\n cout << fixed << setprecision(10);\n cout << *max_element(mincost.begin(), mincost.end()) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1140,"memory_kb":33364,"score_of_the_acc":-1.1653,"final_rank":13},{"submission_id":"aoj_2062_2062641","code_snippet":"#include<bits/stdc++.h>\n#define MAX 100000\n#define inf 1<<29\n#define linf 1e18\n#define eps (1e-8)\n#define mod 1000000007\n#define pi M_PI\n#define f first\n#define s second\n#define mp make_pair\n#define pb push_back\n#define all(a) (a).begin(),(a).end()\n#define pd(a) printf(\"%.10f\\n\",(double)(a))\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define RFOR(i,a,b) for(int i=(a)-1;(b)<=i;i--)\n#define equals(a,b) (fabs((a)-(b))<eps)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef pair<double,int> pdi;\ntypedef pair<int,double> pid;\ntypedef vector<int> vi;\ntypedef vector<pii> vpi;\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\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<-eps : y-p.y<-eps);}\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 \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\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\nGraph g;\nvector<Point> vp;\nint n;\nvector<Segment> vs;\nPoint s;\nint start;\ndouble d[MAX];\n\nvoid init(){\n vs.clear();\n vp.clear();\n g.clear();\n}\n\nvoid dijkstra(){\n FOR(i,0,MAX)d[i]=linf;\n priority_queue<pdi,vector<pdi>,greater<pdi> > pq;\n pq.push(mp(0.0,start));\n d[start]=0.0;\n\n while(pq.size()){\n pdi u=pq.top();\n pq.pop();\n\n if(d[u.s]-u.f<-eps)continue;\n\n FOR(i,0,g[u.s].size()){\n int next=g[u.s][i];\n double cost=abs(vp[u.s]-vp[next]);\n if(u.f+cost-d[next]<-eps){\n d[next]=u.f+cost;\n pq.push(mp(d[next],next));\n }\n }\n }\n}\n\ndouble solve(){\n double res=0;\n vp.pb(s);\n g=SegmentArrangement(vs,vp);\n FOR(i,0,vp.size())if(s==vp[i])start=i;\n dijkstra();\n FOR(i,0,vp.size()){\n if(d[i]!=linf){\n res=max(res,d[i]);\n FOR(j,0,g[i].size()){\n int next=g[i][j];\n double cost=abs(vp[next]-vp[i]);\n res=max(res,min(d[i],d[next])+(cost-abs(d[i]-d[next]))/2.0);\n }\n }\n }\n return res;\n}\n\nint main()\n{\n while(1){\n cin>>n;\n if(n==0)break;\n init();\n FOR(i,0,n){\n double a,b,c,d;\n cin>>a>>b>>c>>d;\n vs.pb(Segment(Point(a,b),Point(c,d)));\n }\n cin>>s.x>>s.y;\n pd(solve());\n }\n return 0;\n}","accuracy":1,"time_ms":1360,"memory_kb":9472,"score_of_the_acc":-0.3386,"final_rank":4},{"submission_id":"aoj_2062_2062638","code_snippet":"#include<bits/stdc++.h>\n#define MAX 100000\n#define inf 1<<29\n#define linf 1e18\n#define eps (1e-8)\n#define mod 1000000007\n#define pi M_PI\n#define f first\n#define s second\n#define mp make_pair\n#define pb push_back\n#define all(a) (a).begin(),(a).end()\n#define pd(a) printf(\"%.10f\\n\",(double)(a))\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define RFOR(i,a,b) for(int i=(a)-1;(b)<=i;i--)\n#define equals(a,b) (fabs((a)-(b))<eps)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef pair<double,int> pdi;\ntypedef pair<int,double> pid;\ntypedef vector<int> vi;\ntypedef vector<pii> vpi;\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\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<-eps : y-p.y<-eps);}\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\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\nGraph g;\nvector<Point> vp;\nint n;\nvector<Segment> vs;\nPoint s;\nint start;\ndouble d[MAX];\n\nvoid init(){\n vs.clear();\n vp.clear();\n g.clear();\n}\n\nvoid dijkstra(){\n FOR(i,0,MAX)d[i]=linf;\n priority_queue<pdi,vector<pdi>,greater<pdi> > pq;\n pq.push(mp(0.0,start));\n d[start]=0.0;\n\n while(pq.size()){\n pdi u=pq.top();\n pq.pop();\n\n if(d[u.s]-u.f<-eps)continue;\n\n FOR(i,0,g[u.s].size()){\n int next=g[u.s][i];\n double cost=abs(vp[u.s]-vp[next]);\n if(u.f+cost-d[next]<-eps){\n d[next]=u.f+cost;\n pq.push(mp(d[next],next));\n }\n }\n }\n}\n\ndouble solve(){\n double res=0;\n vp.pb(s);\n g=SegmentArrangement(vs,vp);\n FOR(i,0,vp.size())if(s==vp[i])start=i;\n dijkstra();\n FOR(i,0,vp.size()){\n if(d[i]!=linf){\n res=max(res,d[i]);\n FOR(j,0,g[i].size()){\n int next=g[i][j];\n double cost=abs(vp[next]-vp[i]);\n res=max(res,min(d[i],d[next])+(cost-abs(d[i]-d[next]))/2.0);\n }\n }\n }\n return res;\n}\n\nint main()\n{\n while(cin>>n && n){\n init();\n FOR(i,0,n){\n double a,b,c,d;\n cin>>a>>b>>c>>d;\n vs.pb(Segment(Point(a,b),Point(c,d)));\n }\n cin>>s.x>>s.y;\n pd(solve());\n }\n return 0;\n}","accuracy":1,"time_ms":1360,"memory_kb":9452,"score_of_the_acc":-0.3379,"final_rank":3},{"submission_id":"aoj_2062_2062264","code_snippet":"#include<bits/stdc++.h>\n#define MAX 100000\n#define inf 1<<29\n#define linf 1e18\n#define eps (1e-8)\n#define mod 1000000007\n#define pi M_PI\n#define f first\n#define s second\n#define mp make_pair\n#define pb push_back\n#define all(a) (a).begin(),(a).end()\n#define pd(a) printf(\"%.10f\\n\",(double)(a))\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define RFOR(i,a,b) for(int i=(a)-1;(b)<=i;i--)\n#define equals(a,b) (fabs((a)-(b))<eps)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef pair<double,int> pdi;\ntypedef pair<int,double> pid;\ntypedef vector<int> vi;\ntypedef vector<pii> vpi;\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\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\nGraph g;\nvector<Point> vp;\nint n;\nvector<Segment> vs;\nPoint s;\nint start;\ndouble d[MAX];\n\nvoid init(){\n vs.clear();\n vp.clear();\n g.clear();\n}\n\nvoid dijkstra(){\n FOR(i,0,MAX)d[i]=linf;\n priority_queue<pdi,vector<pdi>,greater<pdi> > pq;\n pq.push(mp(0.0,start));\n d[start]=0.0;\n\n while(pq.size()){\n pdi u=pq.top();\n pq.pop();\n\n if(d[u.s]-u.f<-eps)continue;\n\n FOR(i,0,g[u.s].size()){\n int next=g[u.s][i];\n double cost=abs(vp[u.s]-vp[next]);\n if(u.f+cost-d[next]<-eps){\n d[next]=u.f+cost;\n pq.push(mp(d[next],next));\n }\n }\n }\n}\n\ndouble solve(){\n double res=0;\n merge(vs);\n vp.pb(s);\n g=SegmentArrangement(vs,vp);\n FOR(i,0,vp.size())if(s==vp[i])start=i;\n dijkstra();\n FOR(i,0,vp.size()){\n if(d[i]!=linf){\n res=max(res,d[i]);\n FOR(j,0,g[i].size()){\n int next=g[i][j];\n double cost=abs(vp[next]-vp[i]);\n res=max(res,min(d[i],d[next])+(cost-abs(d[i]-d[next]))/2.0);\n }\n }\n }\n return res;\n}\n\nint main()\n{\n while(cin>>n && n){\n init();\n FOR(i,0,n){\n double a,b,c,d;\n cin>>a>>b>>c>>d;\n vs.pb(Segment(Point(a,b),Point(c,d)));\n }\n cin>>s.x>>s.y;\n pd(solve());\n }\n return 0;\n}","accuracy":1,"time_ms":1320,"memory_kb":9516,"score_of_the_acc":-0.332,"final_rank":2},{"submission_id":"aoj_2062_1925170","code_snippet":"#include <iostream>\n#include <vector>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <set>\n#include <functional>\n#include <ctime>\n#include <numeric>\n\nusing namespace std;\n\n#define fst first\n#define snd second\n#define all(c) ((c).begin()), ((c).end())\n#define TEST(x,a) { auto y=(x); if (sign(y-a)) { cout << \"line \" << __LINE__ << #x << \" = \" << y << \" != \" << a << endl; exit(-1); } }\ndouble urand() { return rand() / (1.0 + RAND_MAX); }\n\nconst double PI = acos(-1.0);\n\n// implementation note: use EPS only this function\n// usage note: check sign(x) < 0, sign(x) > 0, or sign(x) == 0\n// notice: should be normalize to O(1)\nconst double EPS = 1e-8;\nint sign(double x) {\n if (x < -EPS) return -1;\n if (x > +EPS) return +1;\n return 0;\n}\nstruct point {\n typedef double T;\n T x, y; \n point &operator+=(point p) { x += p.x; y += p.y; return *this; }\n point &operator-=(point p) { x -= p.x; y -= p.y; return *this; }\n point &operator*=(T a) { x *= a; y *= a; return *this; }\n point &operator/=(T a) { return *this *= (1.0/a); }\n point operator-() const { return {-x, -y}; }\n bool operator==(point p) const { return !sign(x-p.x) && !sign(y-p.y); }\n bool operator<(point p) const { return x!=p.x ? x<p.x : y<p.y; } // for sort\n};\npoint operator+(point p, point q) { return p += q; }\npoint operator-(point p, point q) { return p -= q; }\npoint operator*(point::T a, point p) { return p *= a; }\npoint operator*(point p, point::T a) { return p *= a; }\npoint operator/(point p, point::T a) { return p /= a; }\npoint::T dot(point p, point q) { return p.x*q.x+p.y*q.y; }\npoint::T cross(point p, point q) { return p.x*q.y-p.y*q.x; } // left turn > 0\npoint::T norm2(point p) { return dot(p,p); }\npoint orth(point p) { return {-p.y, p.x}; }\npoint::T norm(point p) { return sqrt(dot(p,p)); }\n\nstruct segment { point p, q; };\n\nvector<point> intersect(segment s, segment t) {\n auto a = cross(s.q - s.p, t.q - t.p);\n auto b = cross(t.p - s.p, t.q - t.p); \n auto c = cross(s.q - s.p, s.p - t.p);\n if (a < 0) { a = -a; b = -b; c = -c; }\n if (sign(b) < 0 || sign(a-b) < 0 ||\n sign(c) < 0 || sign(a-c) < 0) return {}; // disjoint\n if (sign(a) != 0) return {s.p + b/a*(s.q - s.p)}; // properly crossing\n vector<point> ps; // same line\n auto insert_if_possible = [&](point p) {\n for (auto q: ps) if (sign(dot(p-q, p-q)) == 0) return;\n ps.push_back(p);\n };\n if (sign(dot(s.p-t.p, s.q-t.p)) <= 0) insert_if_possible(t.p);\n if (sign(dot(s.p-t.q, s.q-t.q)) <= 0) insert_if_possible(t.q);\n if (sign(dot(t.p-s.p, t.q-s.p)) <= 0) insert_if_possible(s.p);\n if (sign(dot(t.p-s.q, t.q-s.q)) <= 0) insert_if_possible(s.q);\n return ps;\n}\n\nstruct arrangement {\n struct edge {\n int src, dst;\n point::T weight;\n };\n int n;\n vector<point> ps; // ps[id[p]] = p, id[ps[k]] = k\n map<point,int> id; \n vector<vector<edge>> adj;\n\n arrangement(vector<segment> ss) : n(0) {\n vector<vector<pair<point::T, int>>> group(ss.size());\n auto append = [&](int i, point p) {\n if (!id.count(p)) { id[p] = n++; ps.push_back(p); }\n group[i].push_back({norm(ss[i].p - p), id[p]});\n };\n for (int i = 0; i < ss.size(); ++i) {\n append(i, ss[i].p);\n append(i, ss[i].q);\n for (int j = 0; j < i; ++j) {\n auto qs = intersect(ss[i], ss[j]);\n if (qs.size() == 1) {\n append(i, qs[0]);\n append(j, qs[0]);\n }\n }\n }\n adj.resize(n);\n for (auto &vs: group) {\n sort(all(vs));\n for (int i = 0; i+1 < vs.size(); ++i) {\n auto u = vs[i].snd, v = vs[i+1].snd;\n if (u == v) continue;\n auto len = vs[i+1].fst - vs[i].fst;\n adj[u].push_back({u, v, len});\n adj[v].push_back({v, u, len});\n }\n }\n }\n void shortest_path(point sp) {\n int s = id[sp];\n vector<point::T> dist(n, 1.0/0.0);\n vector<int> prev(n, -1);\n typedef pair<point::T, int> node;\n priority_queue<node, vector<node>, greater<node>> Q;\n Q.push(node(dist[s] = 0, s));\n while (!Q.empty()) {\n node z = Q.top(); Q.pop();\n if (dist[z.snd] <= z.fst) {\n for (auto e: adj[z.snd]) {\n if (dist[e.dst] > dist[e.src] + e.weight) {\n dist[e.dst] = dist[e.src] + e.weight;\n prev[e.dst] = e.src;\n Q.push({dist[e.dst], e.dst});\n }\n }\n }\n }\n point::T ans = 0;\n for (int u = 0; u < n; ++u) {\n for (edge e: adj[u]) {\n point::T s = (dist[e.dst] - dist[e.src] + e.weight)/2;\n ans = max(ans, dist[e.src] + s);\n }\n }\n printf(\"%.12lf\\n\", ans);\n }\n};\n\n\nint main() {\n for (int m; ~scanf(\"%d\", &m) && m != 0; ) {\n vector<segment> ss;\n for (int i = 0; i < m; ++i) {\n segment s;\n scanf(\"%lf %lf %lf %lf\", &s.p.x, &s.p.y, &s.q.x, &s.q.y);\n ss.push_back(s);\n }\n point p; \n scanf(\"%lf %lf\", &p.x, &p.y);\n ss.push_back({p, p});\n arrangement arr(ss);\n arr.shortest_path(p);\n }\n}","accuracy":1,"time_ms":340,"memory_kb":11888,"score_of_the_acc":-0.2161,"final_rank":1},{"submission_id":"aoj_2062_1094812","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 <utility>\n#include <complex>\n#include <numeric>\n#include <functional>\n#include <random>\n#include <regex>\nusing namespace std;\ntypedef long long ll;\n\n#define ALL(c) (c).begin(),(c).end()\n#define FOR(i,l,r) for(int i=(int)l;i<(int)r;++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORr(i,l,r) for(int i=(int)r-1;i>=(int)l;--i)\n#define REPr(i,n) FORr(i,0,n)\n#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define IN(l,v,r) ((l)<=(v) && (v)<(r))\n#define UNIQUE(v) v.erase(unique(ALL(v)),v.end())\n\n// must template\ntypedef long double D;\nconst D INF = 1e20,EPS = 1e-10;\n\nint sig(D a,D b=0){return a<b-EPS?-1:a>b+EPS?1:0;}\ntemplate<typename T> bool eq(const T& a,const T& b){return sig(abs(a-b))==0;}\n\n\ntypedef D Cost;Cost CINF=1e20;\nstruct Edge{\n\tint from,to;Cost cost;\n\tEdge(int from,int to,Cost cost) : from(from),to(to),cost(cost) {};\n\tbool operator<(Edge r) const{return cost<r.cost;}\n\tbool operator>(Edge r) const{return cost>r.cost;}\n};\ntypedef vector<vector<Edge> > Graph;\ntypedef complex<D> P;\n#define X real()\n#define Y imag()\n\nbool compX (const P& a,const P& b){return !eq(a.X,b.X)?sig(a.X,b.X)<0:sig(a.Y,b.Y)<0;}\nistream& operator >> (istream& is,P& p){D x,y;is >> x >> y;p=P(x,y);return is;}\n\nnamespace std{\n\tbool operator < (const P& a,const P& b){return compX(a,b);}\n \tbool operator == (const P& a,const P& b){return eq(a,b);}\n};\n\n// a×b\nD cross(const P& a,const P& b){return imag(conj(a)*b);}\n// a・b\nD dot(const P& a,const P& b) {return real(conj(a)*b);}\n\nint ccw(const P& a,P b,P c){\n\tb -= a; c -= a;\n\tif (sig(cross(b,c)) > 0) return +1; // counter clockwise\n\tif (sig(cross(b,c)) < 0) return -1; // clockwise\n\tif (sig(dot(b,c)) < 0) return +2; // c--a--b on line\n\tif (sig(norm(b),norm(c))<0) return -2; // a--b--c on line\n\treturn 0; //a--c--b on line or c==a or c==b\n}\n\n//直線・線分\nstruct L : public vector<P> {\n\tP vec() const {return this->at(1)-this->at(0);}\n\tL(const P &a, const P &b){push_back(a); push_back(b);}\n\tL(){push_back(P(0,0));push_back(P(0,0));}\n};\nistream& operator >> (istream& is,L& l){is >> l[0] >> l[1];return is;}\n\nbool isIntersectLL(const L &l, const L &m) {\n \treturn sig(cross(l.vec(), m.vec()))!=0 || // non-parallel\n\tsig(cross(l.vec(), m[0]-l[0])) == 0; // same line\n}\nbool isIntersectLS(const L &l, const L &s) {\n\treturn sig(cross(l.vec(), s[0]-l[0])* // s[0] is left of l\n\t\tcross(l.vec(), s[1]-l[0]))<=0; // s[1] is right of l\n}\nbool isIntersectLP(const L &l, const P &p) {return sig(cross(l[1]-p, l[0]-p))==0;}\n\n// verified by ACAC003 B\n// http://judge.u-aizu.ac.jp/onlinejudge/creview.jsp?rid=899178&cid=ACAC003\nbool isIntersectSS(const L &s, const L &t) {\n\treturn ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n\t\tccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\nbool isIntersectSP(const L &s, const P &p) {\n\treturn sig(abs(s[0]-p)+abs(s[1]-p),abs(s[1]-s[0])) <=0; // triangle inequality\n}\nP crosspoint(const L &l, const L &m) {\n\tD A = cross(l.vec(), m.vec());\n\tD B = cross(l.vec(), l[1] - m[0]);\n\tif (sig(A)==0 && sig(B)==0) return m[0]; // same line\n\tif (sig(A)==0) assert(false); //交点を持たない．\n\treturn m[0] + B / A * m.vec();\n}\n\nbool parallel(const L &l, const L &m) { return eq<P>(cross(l.vec(), m.vec()), 0); }\nbool sameline(const L &l, const L &m) { return parallel(l, m) && eq<P>(cross(l.vec(), m[1]-l[0]), 0); }\n\n// オーバーラップした線分を1つにマージする．\n// O(n^2)\nvector<L> merge_segments(vector<L>& ss){\n\tREP(i,ss.size())if(ss[i][1]<ss[i][0])swap(ss[i][0],ss[i][1]);\n\tREP(i,ss.size())FOR(j,i+1,ss.size()){\n\t\tif(sameline(ss[i],ss[j]) && !ccw(ss[i][0],ss[i][1],ss[j][0])){\n\t\t\tss[i] = L(min(ss[i][0],ss[j][0]), max(ss[i][1],ss[j][1]));\n\t\t\tss[j--]=ss.back();ss.pop_back();\n\t\t}\n\t}\n\treturn ss;\n}\n\n// 線分アレンジメント\n// ps[i]=頂点iに対応するP\n// O(n^2logn)\n// 制約 : 線分のオーバーラップがない．\nGraph segmentArrangement(vector<L> ss, vector<P> &ps) {\n\tvector<vector<D>> vs(ss.size());\n\tREP(i,ss.size()){vs[i].push_back(0);vs[i].push_back(abs(ss[i][1]-ss[i][0]));}\n\tREP(i,ss.size())REP(j,ps.size())if(isIntersectSP(ss[i], ps[j]))\n\t\tvs[i].push_back(abs(ps[j]-ss[i][0]));\n\t\n\tREP(i,ss.size())FOR(j,i+1,ss.size()){\n\t\tL& a=ss[i],b=ss[j];\n\t\tif(isIntersectSS(a,b)){\n\t\t\tP p = crosspoint(a,b);\n\t\t\tvs[i].push_back(abs(p-a[0]));vs[j].push_back(abs(p-b[0]));\t\t\t\t\n\t\t}\n\t}\n\tREP(i,vs.size()){sort(ALL(vs[i]));vs[i].erase(unique(ALL(vs[i]),eq<D>),vs[i].end());}\n\tREP(i,vs.size())REP(j,vs[i].size())ps.push_back(ss[i][0]+vs[i][j]*ss[i].vec()/abs(ss[i].vec()));\n\tsort(ALL(ps));UNIQUE(ps);\n\n\tGraph g(ps.size());\n\tREP(i,vs.size()){\n\t\tvector<D>& cut=vs[i];\n\t\tREP(j,cut.size()-1){\n\t\t\tP a = ss[i][0] + vs[i][j]*ss[i].vec()/abs(ss[i].vec()),b = ss[i][0] + vs[i][j+1]*ss[i].vec()/abs(ss[i].vec());\n\t\t\tint f=distance(ps.begin(),lower_bound(ALL(ps),a)), t=distance(ps.begin(),lower_bound(ALL(ps),b));\n\t\t\tg[f].push_back(Edge(f,t,abs(a-b)));g[t].push_back(Edge(t,f,abs(a-b)));\n\t\t}\n\t}\n\treturn g;\n}\n\nstruct Task{\n int prev,pos;Cost cost;\n Task(int prev,int pos,Cost cost)\n :prev(prev),pos(pos),cost(cost){};\n bool operator>(const Task& r) const{ return cost > r.cost;}\n};\n\n//verified by codoforces 144D http://codeforces.com/contest/144/submission/4976825\n// // 負の辺がない\n// // O(E*logV)\nvector<Cost> dijkstra(const Graph& g,const int s,vector<int>& prev){\n const int V=g.size();\n vector<Cost> d(V,CINF);d[s]=0;\n fill(ALL(prev), -2);\n \n priority_queue<Task,vector<Task>,greater<Task> > que;que.push(Task(-1,s,0));// [ ,e,,f, ] <=> e.cost < e.cost\n vector<bool> visited(V);\n while(!que.empty()){\n Task task=que.top();que.pop();\n if(visited[task.pos])continue;\n visited[task.pos]=true;\n prev[task.pos]=task.prev;\n EACH(e,g[task.pos])if(d[e->to]>d[e->from]+e->cost){\n d[e->to]=d[e->from]+e->cost;\n que.push(Task(e->from,e->to,d[e->to]));\n }\n }\n return d;\n}\nvector<Cost> dijkstra(const Graph& g,const int s){\n vector<int> prev(g.size());return dijkstra(g,s,prev);\n}\n\nint main(){\n\t// ifstream cin( \"in\" );\n\t// ofstream cout( \"out\" );\n\tcout << fixed <<setprecision(20);\n\tcerr << fixed <<setprecision(20);\n\tcin.tie(0); ios::sync_with_stdio(false);\n\n\twhile(true){\n\t\tint N;cin >> N;if(N==0)break;\n\t\tvector<L> ls(N);REP(i,N) cin >> ls[i];\n\t\tP p;cin >> p;\n\t\tvector<P> ps;ps.push_back(p);\n\t\tGraph g=segmentArrangement(ls,ps);\n\t\t\n\t\tint si=-1;REP(i,ps.size())if(p==ps[i])si=i;\n\t\tvector<Cost> ds = dijkstra(g,si);\n\n\t\tD Mv=*max_element(ALL(ds));\n\t\tREP(i,g.size())EACH(e,g[i]){\n\t\t\tD a=abs(ds[e->from]-ds[e->to]);\n\t\t\tD d=abs(ps[e->from]-ps[e->to]);\n\t\t\tMv=max(Mv,min(ds[e->from],ds[e->to])+(a+d)/2);\n\t\t}\n\t\tcout << Mv <<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1130,"memory_kb":13256,"score_of_the_acc":-0.4292,"final_rank":5},{"submission_id":"aoj_2062_1094764","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 <utility>\n#include <complex>\n#include <numeric>\n#include <functional>\n#include <random>\n#include <regex>\nusing namespace std;\ntypedef long long ll;\n\n#define ALL(c) (c).begin(),(c).end()\n#define FOR(i,l,r) for(int i=(int)l;i<(int)r;++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORr(i,l,r) for(int i=(int)r-1;i>=(int)l;--i)\n#define REPr(i,n) FORr(i,0,n)\n#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define IN(l,v,r) ((l)<=(v) && (v)<(r))\n#define UNIQUE(v) v.erase(unique(ALL(v)),v.end())\n\n// must template\ntypedef long double D;\nconst D INF = 1e20,EPS = 1e-10;\n\nint sig(D a,D b=0){return a<b-EPS?-1:a>b+EPS?1:0;}\nbool eq(D a,D b){ return sig(abs(a-b))==0;}\n// D norm(D a){ return a*a;}\n\ntypedef D Cost;Cost CINF=1e20;\nstruct Edge{\n\tint from,to;Cost cost;\n\tEdge(int from,int to,Cost cost) : from(from),to(to),cost(cost) {};\n\tbool operator<(Edge r) const{return cost<r.cost;}\n\tbool operator>(Edge r) const{return cost>r.cost;}\n};\ntypedef vector<vector<Edge> > Graph;\ntypedef complex<D> P;\n#define X real()\n#define Y imag()\n\nbool eq(const P& a,const P& b){ return sig(abs(a-b))==0;}\nbool compX (const P& a,const P& b){return sig(a.X,b.X)!=0 ? a.X < b.X : a.Y < b.Y;}\n\nistream& operator >> (istream& is,P& p){D x,y;is >> x >> y;p=P(x,y);return is;}\n\nnamespace std{\n\tbool operator < (const P& a,const P& b){return compX(a,b);}\n \tbool operator == (const P& a,const P& b){return eq(a,b);}\n};\n\n// a×b\nD cross(const P& a,const P& b){return imag(conj(a)*b);}\n// a・b\nD dot(const P& a,const P& b) {return real(conj(a)*b);}\n\nint ccw(const P& a,P b,P c){\n\tb -= a; c -= a;\n\tif (sig(cross(b,c)) > 0) return +1; // counter clockwise\n\tif (sig(cross(b,c)) < 0) return -1; // clockwise\n\tif (sig(dot(b,c)) < 0) return +2; // c--a--b on line\n\tif (sig(norm(b),norm(c))<0) return -2; // a--b--c on line\n\treturn 0; //a--c--b on line or c==a or c==b\n}\n\n//直線・線分\nstruct L : public vector<P> {\n\tP vec() const {return this->at(1)-this->at(0);}\n\tL(const P &a, const P &b){push_back(a); push_back(b);}\n\tL(){push_back(P(0,0));push_back(P(0,0));}\n};\nistream& operator >> (istream& is,L& l){is >> l[0] >> l[1];return is;}\n\nbool isIntersectLL(const L &l, const L &m) {\n \treturn sig(cross(l.vec(), m.vec()))!=0 || // non-parallel\n\tsig(cross(l.vec(), m[0]-l[0])) == 0; // same line\n}\nbool isIntersectLS(const L &l, const L &s) {\n\treturn sig(cross(l.vec(), s[0]-l[0])* // s[0] is left of l\n\t\tcross(l.vec(), s[1]-l[0]))<=0; // s[1] is right of l\n}\nbool isIntersectLP(const L &l, const P &p) {return sig(cross(l[1]-p, l[0]-p))==0;}\n\n// verified by ACAC003 B\n// http://judge.u-aizu.ac.jp/onlinejudge/creview.jsp?rid=899178&cid=ACAC003\nbool isIntersectSS(const L &s, const L &t) {\n\treturn ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n\t\tccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\nbool isIntersectSP(const L &s, const P &p) {\n\treturn sig(abs(s[0]-p)+abs(s[1]-p),abs(s[1]-s[0])) <=0; // triangle inequality\n}\nP crosspoint(const L &l, const L &m) {\n\tD A = cross(l.vec(), m.vec());\n\tD B = cross(l.vec(), l[1] - m[0]);\n\tif (sig(A)==0 && sig(B)==0) return m[0]; // same line\n\tif (sig(A)==0) assert(false); //交点を持たない．\n\treturn m[0] + B / A * m.vec();\n}\n\nbool parallel(const L &l, const L &m) { return eq(cross(l.vec(), m.vec()), 0); }\nbool sameline(const L &l, const L &m) { return parallel(l, m) && eq(cross(l.vec(), m[1]-l[0]), 0); }\n\n// 線分アレンジメント\n// ps[i]=頂点iに対応するP\n// O(n^2logn)\nGraph segmentArrangement(vector<L> ss, vector<P> &ps) {\n\t// merge\n\t// REP(i,ss.size())if(ss[i][1]<ss[i][0])swap(ss[i][0],ss[i][1]);\n\t// REP(i,ss.size())FOR(j,i+1,ss.size()){\n\t// \tif(sameline(ss[i],ss[j]) && !ccw(ss[i][0],ss[i][1],ss[j][0])){\n\t// \t\tss[i] = L(min(ss[i][0],ss[j][0]), max(ss[i][1],ss[j][1]));\n\t// \t\t// swap(ss[j],ss.back());\n\t// \t\tss[j--] = ss.back();\n\t// \t\tss.pop_back();\n\t// \t}\n\t// }\n\tvector<vector<D>> vs(ss.size());\n\tREP(i,ss.size()){\n\t\tvs[i].push_back(0);vs[i].push_back(abs(ss[i][1]-ss[i][0]));\n\t\tREP(j,ps.size())if (isIntersectSP(ss[i], ps[j]))\n\t\t\tvs[i].push_back(abs(ps[j]-ss[i][0]));\n\t}\n\tREP(i,ss.size())FOR(j,i+1,ss.size()){\n\t\tL a=ss[i],b=ss[j];\n\t\tif(isIntersectSS(a,b)){\n\t\t\tP p = crosspoint(a,b);\n\t\t\tvs[i].push_back(abs(p-ss[i][0]));vs[j].push_back(abs(p-ss[j][0]));\t\t\t\t\n\t\t}\n\t}\n\tREP(i,vs.size()){sort(ALL(vs[i]));vs[i].erase(unique(ALL(vs[i]),[](D a,D b)->bool{return abs(a-b)<EPS;}),vs[i].end());}\n\tREP(i,vs.size())REP(j,vs[i].size())ps.push_back(ss[i][0]+vs[i][j]*ss[i].vec()/abs(ss[i].vec()));\n\tsort(ALL(ps));UNIQUE(ps);\n\t// ps.erase(unique(ALL(ps),[](const P& a,const P& b)->bool{return eq(a,b);}),ps.end());\n\t// cerr << ps.size()<<endl;\n\t// REP(i,ps.size())cerr << ps[i] <<endl;\n\t// cerr << endl;\n\tGraph g(ps.size());\n\tREP(i,vs.size()){\n\t\tvector<D>& cut=vs[i];\n\t\tREP(j,cut.size()-1){\n\t\t\tP a = ss[i][0] + vs[i][j]*ss[i].vec()/abs(ss[i].vec()),b = ss[i][0] + vs[i][j+1]*ss[i].vec()/abs(ss[i].vec());\n\t\t\tint f=distance(ps.begin(), lower_bound(ALL(ps),a,[](const P& a,const P& b)->bool{return !eq(a.X,b.X)?a.X<b.X:a.Y+EPS<b.Y;})),\n\t\t\t\tt=distance(ps.begin(), lower_bound(ALL(ps),b,[](const P& a,const P& b)->bool{return !eq(a.X,b.X)?a.X<b.X:a.Y+EPS<b.Y;}));\n\t\t\t// cerr << f <<\" \" << t <<endl;\n\t\t\t// cerr << a <<\" \" << b <<endl;\n\t\t\t// cerr << compX(ps[9],b)<<endl;\n\t\t\t// cerr << compX(ps[10],b)<<endl;\n\n\t\t\tg[f].push_back(Edge(f,t,abs(a-b)));\n\t\t\tg[t].push_back(Edge(t,f,abs(a-b)));\n\t\t}\n\t}\n\treturn g;\n}\n\nstruct Task{\n int prev,pos;Cost cost;\n Task(int prev,int pos,Cost cost)\n :prev(prev),pos(pos),cost(cost){};\n bool operator>(const Task& r) const{ return cost > r.cost;}\n};\n\n//verified by codoforces 144D http://codeforces.com/contest/144/submission/4976825\n// // 負の辺がない\n// // O(E*logV)\nvector<Cost> dijkstra(const Graph& g,const int s,vector<int>& prev){\n const int V=g.size();\n vector<Cost> d(V,CINF);d[s]=0;\n fill(ALL(prev), -2);\n \n priority_queue<Task,vector<Task>,greater<Task> > que;que.push(Task(-1,s,0));// [ ,e,,f, ] <=> e.cost < e.cost\n vector<bool> visited(V);\n while(!que.empty()){\n Task task=que.top();que.pop();\n if(visited[task.pos])continue;\n visited[task.pos]=true;\n prev[task.pos]=task.prev;\n EACH(e,g[task.pos])if(d[e->to]>d[e->from]+e->cost){\n d[e->to]=d[e->from]+e->cost;\n que.push(Task(e->from,e->to,d[e->to]));\n }\n }\n return d;\n}\nvector<Cost> dijkstra(const Graph& g,const int s){\n vector<int> prev(g.size());return dijkstra(g,s,prev);\n}\n\nint main(){\n\t// ifstream cin( \"in\" );\n\t// ofstream cout( \"out\" );\n\tcout << fixed <<setprecision(20);\n\tcerr << fixed <<setprecision(20);\n\tcin.tie(0); ios::sync_with_stdio(false);\n\n\twhile(true){\n\t\tint N;cin >> N;if(N==0)break;\n\t\tvector<L> ls(N);REP(i,N) cin >> ls[i];\n\t\tP p;cin >> p;\n\t\tvector<P> ps;ps.push_back(p);\n\t\tGraph g=segmentArrangement(ls,ps);\n\t\t\n\t\tint si=-1;REP(i,ps.size())if(p==ps[i])si=i;\n\t\tvector<Cost> ds = dijkstra(g,si);\n\n\t\t// cout << ps.size() <<endl;\n\t\t// REP(i,ps.size())cout << ps[i]<<endl;\n\t\t//check\n\t\tD Mv=*max_element(ALL(ds));\n\t\tREP(i,g.size())EACH(e,g[i]){\n\t\t\tif (eq(abs(ds[e->from] - ds[e->to]), abs(ps[e->from] - ps[e->to]))) continue;\n \n\t\t\tD a=abs(ds[e->from]-ds[e->to]);\n\t\t\tD d=abs(ps[e->from]-ps[e->to]);\n\t\t\tMv=max(Mv,min(ds[e->from],ds[e->to])+(a+d)/2);\n\t\t}\n\t\tcout << Mv <<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1280,"memory_kb":13784,"score_of_the_acc":-0.4795,"final_rank":7},{"submission_id":"aoj_2062_1046786","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 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)\n\nusing namespace std;\n\nclass Point{\npublic:\n double x,y;\n Point(double x = 0,double y = 0): x(x),y(y){}\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n bool operator == (const Segment& p)const { return ( p.p1 == p1 && p.p2 == p2 ) || ( p.p1 == p2 && p.p2 == p1 ); }\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\n\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\ndouble abs(Point a){ return sqrt(norm(a)); }\n\nint ccw(Point p0,Point p1,Point p2){\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS)return CLOCKWISE;\n if(dot(a,b) < -EPS)return ONLINE_BACK;\n if(norm(a) < norm(b))return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n\nbool intersectSS(Line s, Line t) {\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\n}\nbool intersectSP(Line s, Point p) { return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; }\n\nPoint projection(Line l,Point p) {\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\n return l.p1 + (l.p1-l.p2)*t;\n}\n\nPoint reflection(Line l,Point p) { return p + (projection(l, p) - p) * 2; }\n\nPoint crosspoint(Line l,Line m){\n double A = cross(l.p2-l.p1,m.p2-m.p1);\n double B = cross(l.p2-l.p1,l.p2-m.p1);\n if(abs(A) < EPS && abs(B) < EPS){\n vector<Point> vec;\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\n sort(vec.begin(),vec.end());\n assert(vec[1] == vec[2]); //同じセグメントかもよ\n return vec[1];\n }\n if(abs(A) < EPS)assert(false);\n return m.p1 + (m.p2-m.p1)*(B/A);\n}\n\nstruct Edge {\n int from,to;\n double cost;\n Edge(int from=0,int to=0,double cost=0):from(from),to(to),cost(cost){}\n bool operator < (const Edge& a)const { return !equals(cost,a.cost) && cost < a.cost; }\n};\n\nPoint sp;\n\nvector<vector<Edge> > segmentArrangement(vector<Segment> &vs,vector<Point> &ps) {\n ps.push_back(sp);\n rep(i,vs.size()) ps.push_back( (vs[i].p1+vs[i].p2) / 2.0 );\n rep(i,vs.size()) ps.push_back(vs[i].p1), ps.push_back(vs[i].p2);\n rep(i,vs.size()) REP(j,i+1,vs.size()) if(intersectSS(vs[i],vs[j])) ps.push_back(Point(crosspoint(vs[i],vs[j])));\n sort(ps.begin(),ps.end()); \n ps.erase(unique(ps.begin(),ps.end()),ps.end());\n\n vector<vector<Edge> > ret(ps.size());\n\n for(int i=0;i<vs.size();i++){\n vector<pair<double,int> > list;\n rep(j,ps.size()) if(intersectSP(vs[i],ps[j]))list.push_back(pair<double,int>(norm(vs[i].p1-ps[j]),j));\n sort(list.begin(),list.end());\n for(int j=0;j+1<list.size();++j) {\n int from = list[j].second, to = list[j+1].second;\n double cost = abs(ps[from]-ps[to]);\n ret[from].push_back(Edge(from,to,cost));\n ret[to].push_back(Edge(to,from,cost));\n }\n } \n return ret;\n}\n\nint E;\nvector<Segment> segs;\n\nbool LT(double a,double b) { return !equals(a,b) && a < b; }\nbool LTE(double a,double b) { return equals(a,b) || a < b; }\n\n// --作成中-- \n\nPoint vir;\nbool comp_dist(const Point &a,const Point &b){ return LT(abs(vir-a),abs(vir-b)); }\n\nconst int MAX_N = 2000;\nint uf[MAX_N];\nvoid init(int N=MAX_N) { rep(i,N) uf[i] = i; }\nint find(int x) { \n if( x == uf[x] ) return x;\n return uf[x] = find(uf[x]);\n}\nvoid unit(int x,int y){\n x = find(x), y = find(y);\n if( x != y ) uf[x] = y; \n}\n\nvoid segmentMerge(vector<Segment> &vec,vector<Segment> &ret){\n init(vec.size());\n rep(i,vec.size()) {\n rep(j,vec.size()) {\n if( equals(cross(vec[i].p1-vec[i].p2,vec[j].p1-vec[j].p2),0.0) && intersectSS(vec[i],vec[j]) ) unit(i,j);\n }\n }\n\n ret.clear();\n vector<int> color;\n rep(i,vec.size()) color.push_back(find(i));\n sort(color.begin(),color.end());\n color.erase(unique(color.begin(),color.end()),color.end());\n rep(i,color.size()) {\n vector<Point> vp;\n rep(j,vec.size()) if( color[i] == find(j) ) vp.push_back(vec[j].p1), vp.push_back(vec[j].p2);\n sort(vp.begin(),vp.end());\n vp.erase(unique(vp.begin(),vp.end()),vp.end());\n assert( vp.size() >= 2 ); // 線分じゃなくて点\n vir = vp[0];\n sort(vp.begin(),vp.end(),comp_dist);\n ret.push_back(Segment(vp.front(),vp.back()));\n }\n}\n\n// --作成中--\n\nconst double DINF = 1e20;\n\nstruct Data {\n int cur;\n double weight;\n bool operator < ( const Data &data ) const { return !equals(weight,data.weight) && weight > data.weight; }\n};\n\nvoid dijkstra(vector<vector<Edge> > &G,vector<Point> &ps){\n int sindex = -1;\n rep(i,(int)ps.size()) if( ps[i] == sp ) { sindex = i; break; }\n\n int V = ps.size();\n priority_queue<Data> Q;\n Q.push((Data){sindex,0});\n vector<double> mindist(V,DINF);\n mindist[sindex] = 0;\n while( !Q.empty() ){\n Data data = Q.top(); Q.pop();\n if( LT(mindist[data.cur],data.weight) ) continue;\n rep(i,G[data.cur].size()){\n int to = G[data.cur][i].to;\n if( LT(data.weight+G[data.cur][i].cost,mindist[to]) ){\n mindist[to] = data.weight+G[data.cur][i].cost;\n Q.push((Data){to,mindist[to]});\n }\n }\n }\n\n double maxi = 0;\n rep(i,V) {\n assert( !equals(DINF,mindist[i]) );\n maxi = max(maxi,mindist[i]);\n }\n printf(\"%.10lf\\n\",maxi);\n}\n\nvoid compute(){\n vector<Segment> buf;\n segmentMerge(segs,buf); \n vector<Point> ps;\n vector<vector<Edge> > G = segmentArrangement(buf,ps);\n dijkstra(G,ps);\n}\n\nint main(){\n while( cin >> E, E ){\n segs.resize(E);\n rep(i,E) cin >> segs[i].p1.x >> segs[i].p1.y >> segs[i].p2.x >> segs[i].p2.y;\n cin >> sp.x >> sp.y;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":5170,"memory_kb":5996,"score_of_the_acc":-0.999,"final_rank":11},{"submission_id":"aoj_2062_1046785","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 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)\n\nusing namespace std;\n\nclass Point{\npublic:\n double x,y;\n\n Point(double x = 0,double y = 0): x(x),y(y){}\n\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n bool operator == (const Segment& p)const { return ( p.p1 == p1 && p.p2 == p2 ) || ( p.p1 == p2 && p.p2 == p1 ); }\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\nostream& operator << (ostream& os,const Point& a){ os << \"(\" << a.x << \",\" << a.y << \")\"; }\n\nostream& operator << (ostream& os,const Segment& a){ os << \"( \" << a.p1 << \" , \" << a.p2 << \" )\"; }\n\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\n\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\n\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\n\ndouble abs(Point a){ return sqrt(norm(a)); }\n\n//rad は角度をラジアンで持たせること\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n\n// 度をラジアンに変換\ndouble toRad(double agl){ return agl*M_PI/180.0; }\n\n// a => prev, b => cur, c=> next\n// prev から cur へ行って next へ行く際の角度を求める\ndouble getArg(Point a,Point b,Point c){\n double arg1 = atan2(b.y-a.y,b.x-a.x);\n double arg2 = atan2(c.y-b.y,c.x-b.x);\n double arg = fabs( arg1 - arg2 );\n while( arg > M_PI ) arg -= 2.0 * M_PI;\n return fabs(arg);\n}\n\n\nint ccw(Point p0,Point p1,Point p2){\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS)return CLOCKWISE;\n if(dot(a,b) < -EPS)return ONLINE_BACK;\n if(norm(a) < norm(b))return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n\nbool intersectLL(Line l, Line m) {\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\n}\nbool intersectLS(Line l, Line s) {\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\n}\nbool intersectLP(Line l,Point p) {\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\n}\nbool intersectSS(Line s, Line t) {\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\n}\nbool intersectSP(Line s, Point p) {\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\n}\n\nPoint projection(Line l,Point p) {\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\n return l.p1 + (l.p1-l.p2)*t;\n}\nPoint reflection(Line l,Point p) {\n return p + (projection(l, p) - p) * 2;\n}\ndouble distanceLP(Line l, Point p) {\n return abs(p - projection(l, p));\n}\ndouble distanceLL(Line l, Line m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\n}\n\ndouble distanceLS(Line l, Line s) {\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\n}\ndouble distanceSP(Line s, Point p) {\n Point r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s.p1 - p), abs(s.p2 - p));\n}\n\ndouble distanceSS(Line s, Line t) {\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\n}\n\nPoint crosspoint(Line l,Line m){\n double A = cross(l.p2-l.p1,m.p2-m.p1);\n double B = cross(l.p2-l.p1,l.p2-m.p1);\n if(abs(A) < EPS && abs(B) < EPS){\n vector<Point> vec;\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\n sort(vec.begin(),vec.end());\n assert(vec[1] == vec[2]); //同じセグメントかもよ\n return vec[1];\n //return m.p1;\n }\n if(abs(A) < EPS)assert(false);\n return m.p1 + (m.p2-m.p1)*(B/A);\n}\n\nstruct Edge {\n int from,to;\n double cost;\n Edge(int from=0,int to=0,double cost=0):from(from),to(to),cost(cost){}\n bool operator < (const Edge& a)const { return !equals(cost,a.cost) && cost < a.cost; }\n};\n\nPoint sp;\n\nvector<vector<Edge> > segmentArrangement(vector<Segment> &vs,vector<Point> &ps) {\n ps.push_back(sp);\n\n rep(i,vs.size()) ps.push_back( (vs[i].p1+vs[i].p2) / 2.0 );\n\n rep(i,vs.size()) ps.push_back(vs[i].p1), ps.push_back(vs[i].p2);\n rep(i,vs.size()) REP(j,i+1,vs.size()) if(intersectSS(vs[i],vs[j])) ps.push_back(Point(crosspoint(vs[i],vs[j])));\n\n sort(ps.begin(),ps.end()); \n ps.erase(unique(ps.begin(),ps.end()),ps.end());\n\n vector<vector<Edge> > ret(ps.size());\n\n for(int i=0;i<vs.size();i++){\n vector<pair<double,int> > list;\n rep(j,ps.size()) if(intersectSP(vs[i],ps[j]))list.push_back(pair<double,int>(norm(vs[i].p1-ps[j]),j));\n sort(list.begin(),list.end());\n for(int j=0;j+1<list.size();++j) {\n int from = list[j].second, to = list[j+1].second;\n double cost = abs(ps[from]-ps[to]);\n ret[from].push_back(Edge(from,to,cost));\n ret[to].push_back(Edge(to,from,cost));\n }\n } \n return ret;\n}\n\nint E;\nvector<Segment> segs;\n\nbool LT(double a,double b) { return !equals(a,b) && a < b; }\nbool LTE(double a,double b) { return equals(a,b) || a < b; }\n\n// --作成中-- \n\nPoint vir;\nbool comp_dist(const Point &a,const Point &b){ return LT(abs(vir-a),abs(vir-b)); }\n\nconst int MAX_N = 2000;\nint uf[MAX_N];\nvoid init(int N=MAX_N) { rep(i,N) uf[i] = i; }\nint find(int x) { \n if( x == uf[x] ) return x;\n return uf[x] = find(uf[x]);\n}\nvoid unit(int x,int y){\n x = find(x), y = find(y);\n if( x != y ) uf[x] = y; \n}\n\nvoid segmentMerge(vector<Segment> &vec,vector<Segment> &ret){\n init(vec.size());\n rep(i,vec.size()) {\n rep(j,vec.size()) {\n if( equals(cross(vec[i].p1-vec[i].p2,vec[j].p1-vec[j].p2),0.0) && intersectSS(vec[i],vec[j]) ) unit(i,j);\n }\n }\n\n ret.clear();\n vector<int> color;\n rep(i,vec.size()) color.push_back(find(i));\n sort(color.begin(),color.end());\n color.erase(unique(color.begin(),color.end()),color.end());\n rep(i,color.size()) {\n vector<Point> vp;\n rep(j,vec.size()) if( color[i] == find(j) ) vp.push_back(vec[j].p1), vp.push_back(vec[j].p2);\n sort(vp.begin(),vp.end());\n vp.erase(unique(vp.begin(),vp.end()),vp.end());\n assert( vp.size() >= 2 ); // 線分じゃなくて点\n vir = vp[0];\n sort(vp.begin(),vp.end(),comp_dist);\n ret.push_back(Segment(vp.front(),vp.back()));\n }\n}\n\n// --作成中--\n\nconst double DINF = 1e20;\n\nstruct Data {\n int cur;\n double weight;\n bool operator < ( const Data &data ) const { return !equals(weight,data.weight) && weight > data.weight; }\n};\n\nvoid dijkstra(vector<vector<Edge> > &G,vector<Point> &ps){\n int sindex = -1;\n rep(i,(int)ps.size()) if( ps[i] == sp ) { sindex = i; break; }\n assert( sindex != -1 );\n\n int V = ps.size();\n priority_queue<Data> Q;\n Q.push((Data){sindex,0});\n vector<double> mindist(V,DINF);\n mindist[sindex] = 0;\n while( !Q.empty() ){\n Data data = Q.top(); Q.pop();\n \n if( LT(mindist[data.cur],data.weight) ) continue;\n\n rep(i,G[data.cur].size()){\n int to = G[data.cur][i].to;\n if( LT(data.weight+G[data.cur][i].cost,mindist[to]) ){\n mindist[to] = data.weight+G[data.cur][i].cost;\n Q.push((Data){to,mindist[to]});\n }\n }\n\n }\n\n double maxi = 0;\n rep(i,V) {\n assert( !equals(DINF,mindist[i]) );\n maxi = max(maxi,mindist[i]);\n }\n\n printf(\"%.10lf\\n\",maxi);\n\n}\n\nvoid compute(){\n vector<Segment> buf = segs;\n //segmentMerge(segs,buf); \n\n vector<Point> ps;\n vector<vector<Edge> > G = segmentArrangement(buf,ps);\n\n dijkstra(G,ps);\n\n}\n\nint main(){\n while( cin >> E, E ){\n segs.resize(E);\n rep(i,E) cin >> segs[i].p1.x >> segs[i].p1.y >> segs[i].p2.x >> segs[i].p2.y;\n cin >> sp.x >> sp.y;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":5130,"memory_kb":5968,"score_of_the_acc":-0.9897,"final_rank":10},{"submission_id":"aoj_2062_1046783","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 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)\n\nusing namespace std;\n\nclass Point{\npublic:\n double x,y;\n\n Point(double x = 0,double y = 0): x(x),y(y){}\n\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n bool operator == (const Segment& p)const { return ( p.p1 == p1 && p.p2 == p2 ) || ( p.p1 == p2 && p.p2 == p1 ); }\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\nostream& operator << (ostream& os,const Point& a){ os << \"(\" << a.x << \",\" << a.y << \")\"; }\n\nostream& operator << (ostream& os,const Segment& a){ os << \"( \" << a.p1 << \" , \" << a.p2 << \" )\"; }\n\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\n\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\n\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\n\ndouble abs(Point a){ return sqrt(norm(a)); }\n\n//rad は角度をラジアンで持たせること\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n\n// 度をラジアンに変換\ndouble toRad(double agl){ return agl*M_PI/180.0; }\n\n// a => prev, b => cur, c=> next\n// prev から cur へ行って next へ行く際の角度を求める\ndouble getArg(Point a,Point b,Point c){\n double arg1 = atan2(b.y-a.y,b.x-a.x);\n double arg2 = atan2(c.y-b.y,c.x-b.x);\n double arg = fabs( arg1 - arg2 );\n while( arg > M_PI ) arg -= 2.0 * M_PI;\n return fabs(arg);\n}\n\n\nint ccw(Point p0,Point p1,Point p2){\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS)return CLOCKWISE;\n if(dot(a,b) < -EPS)return ONLINE_BACK;\n if(norm(a) < norm(b))return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n\nbool intersectLL(Line l, Line m) {\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\n}\nbool intersectLS(Line l, Line s) {\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\n}\nbool intersectLP(Line l,Point p) {\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\n}\nbool intersectSS(Line s, Line t) {\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\n}\nbool intersectSP(Line s, Point p) {\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\n}\n\nPoint projection(Line l,Point p) {\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\n return l.p1 + (l.p1-l.p2)*t;\n}\nPoint reflection(Line l,Point p) {\n return p + (projection(l, p) - p) * 2;\n}\ndouble distanceLP(Line l, Point p) {\n return abs(p - projection(l, p));\n}\ndouble distanceLL(Line l, Line m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\n}\n\ndouble distanceLS(Line l, Line s) {\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\n}\ndouble distanceSP(Line s, Point p) {\n Point r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s.p1 - p), abs(s.p2 - p));\n}\n\ndouble distanceSS(Line s, Line t) {\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\n}\n\nPoint crosspoint(Line l,Line m){\n double A = cross(l.p2-l.p1,m.p2-m.p1);\n double B = cross(l.p2-l.p1,l.p2-m.p1);\n if(abs(A) < EPS && abs(B) < EPS){\n vector<Point> vec;\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\n sort(vec.begin(),vec.end());\n assert(vec[1] == vec[2]); //同じセグメントかもよ\n return vec[1];\n //return m.p1;\n }\n if(abs(A) < EPS)assert(false);\n return m.p1 + (m.p2-m.p1)*(B/A);\n}\n\nstruct Edge {\n int from,to;\n double cost;\n Edge(int from=0,int to=0,double cost=0):from(from),to(to),cost(cost){}\n bool operator < (const Edge& a)const { return !equals(cost,a.cost) && cost < a.cost; }\n};\n\nPoint sp;\n\nvector<vector<Edge> > segmentArrangement(vector<Segment> &vs,vector<Point> &ps) {\n ps.push_back(sp);\n\n rep(i,vs.size()) ps.push_back( (vs[i].p1+vs[i].p2) / 2.0 );\n\n rep(i,vs.size()) ps.push_back(vs[i].p1), ps.push_back(vs[i].p2);\n rep(i,vs.size()) REP(j,i+1,vs.size()) if(intersectSS(vs[i],vs[j])) ps.push_back(Point(crosspoint(vs[i],vs[j])));\n\n sort(ps.begin(),ps.end()); \n ps.erase(unique(ps.begin(),ps.end()),ps.end());\n\n vector<vector<Edge> > ret(ps.size());\n\n for(int i=0;i<vs.size();i++){\n vector<pair<double,int> > list;\n rep(j,ps.size()) if(intersectSP(vs[i],ps[j]))list.push_back(pair<double,int>(norm(vs[i].p1-ps[j]),j));\n sort(list.begin(),list.end());\n for(int j=0;j+1<list.size();++j) {\n int from = list[j].second, to = list[j+1].second;\n double cost = abs(ps[from]-ps[to]);\n ret[from].push_back(Edge(from,to,cost));\n ret[to].push_back(Edge(to,from,cost));\n }\n } \n return ret;\n}\n\nint E;\nvector<Segment> segs;\n\nbool LT(double a,double b) { return !equals(a,b) && a < b; }\nbool LTE(double a,double b) { return equals(a,b) || a < b; }\n\n// --作成中-- \n\nPoint vir;\nbool comp_dist(const Point &a,const Point &b){ return LT(abs(vir-a),abs(vir-b)); }\n\nconst int MAX_N = 2000;\nint uf[MAX_N];\nvoid init(int N=MAX_N) { rep(i,N) uf[i] = i; }\nint find(int x) { \n if( x == uf[x] ) return x;\n return uf[x] = find(uf[x]);\n}\nvoid unit(int x,int y){\n x = find(x), y = find(y);\n if( x != y ) uf[x] = y; \n}\n\nvoid segmentMerge(vector<Segment> &vec,vector<Segment> &ret){\n init(vec.size());\n rep(i,vec.size()) {\n rep(j,vec.size()) {\n if( equals(cross(vec[i].p1-vec[i].p2,vec[j].p1-vec[j].p2),0.0) && intersectSS(vec[i],vec[j]) ) unit(i,j);\n }\n }\n\n ret.clear();\n vector<int> color;\n rep(i,vec.size()) color.push_back(find(i));\n sort(color.begin(),color.end());\n color.erase(unique(color.begin(),color.end()),color.end());\n rep(i,color.size()) {\n vector<Point> vp;\n rep(j,vec.size()) if( color[i] == find(j) ) vp.push_back(vec[j].p1), vp.push_back(vec[j].p2);\n sort(vp.begin(),vp.end());\n vp.erase(unique(vp.begin(),vp.end()),vp.end());\n assert( vp.size() >= 2 ); // 線分じゃなくて点\n vir = vp[0];\n sort(vp.begin(),vp.end(),comp_dist);\n ret.push_back(Segment(vp.front(),vp.back()));\n }\n}\n\n// --作成中--\n\nconst double DINF = 1e20;\n\nstruct Data {\n int cur;\n double weight;\n bool operator < ( const Data &data ) const { return !equals(weight,data.weight) && weight > data.weight; }\n};\n\nvoid dijkstra(vector<vector<Edge> > &G,vector<Point> &ps){\n int sindex = -1;\n rep(i,(int)ps.size()) if( ps[i] == sp ) { sindex = i; break; }\n assert( sindex != -1 );\n\n int V = ps.size();\n priority_queue<Data> Q;\n Q.push((Data){sindex,0});\n vector<double> mindist(V,DINF);\n mindist[sindex] = 0;\n while( !Q.empty() ){\n Data data = Q.top(); Q.pop();\n \n if( LT(mindist[data.cur],data.weight) ) continue;\n\n rep(i,G[data.cur].size()){\n int to = G[data.cur][i].to;\n if( LT(data.weight+G[data.cur][i].cost,mindist[to]) ){\n mindist[to] = data.weight+G[data.cur][i].cost;\n Q.push((Data){to,mindist[to]});\n }\n }\n\n }\n\n double maxi = 0;\n rep(i,V) {\n assert( !equals(DINF,mindist[i]) );\n maxi = max(maxi,mindist[i]);\n }\n\n printf(\"%.10lf\\n\",maxi);\n\n}\n\nvoid compute(){\n vector<Segment> buf;\n segmentMerge(segs,buf); \n\n //rep(i,buf.size()) cout << i << \"-th : \" << buf[i] << endl;\n\n vector<Point> ps;\n vector<vector<Edge> > G = segmentArrangement(buf,ps);\n\n dijkstra(G,ps);\n\n}\n\nint main(){\n while( cin >> E, E ){\n segs.resize(E);\n rep(i,E) cin >> segs[i].p1.x >> segs[i].p1.y >> segs[i].p2.x >> segs[i].p2.y;\n cin >> sp.x >> sp.y;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":5180,"memory_kb":6000,"score_of_the_acc":-1.0012,"final_rank":12},{"submission_id":"aoj_2062_713277","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\n#include <string>\n#include <cmath>\n#include <cassert>\n#include <queue>\n#include <set>\n#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)\n// #define double long double\nconst int INF = 1<<29;\nconst double EPS = 1e-8;\nconst double PI = acos(-1);\ntypedef pair<int,int> pii;\ntypedef long long ll;\n\ntypedef double 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};\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}\n\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\n\n// 道程がいらない場合\nvector<Weight> dijkstra(const Graph &g, int s) {\n vector<Weight> dist(g.size(), INF);\n dist[s] = 0;\n priority_queue<Edge> Q; // \"e < f\" <=> \"e.weight > f.weight\"\n for (Q.push(Edge(-2, s, 0)); !Q.empty(); ) {\n Edge e = Q.top(); Q.pop();\n if (dist[e.dst] < e.weight) continue;\n FOR(f,g[e.dst]) {\n if (dist[f->dst] > e.weight+f->weight) {\n dist[f->dst] = e.weight+f->weight;\n Q.push(Edge(f->src, f->dst, e.weight+f->weight));\n }\n }\n }\n return dist;\n}\n\n\ntypedef complex<double> P;\nnamespace std {\n bool operator < (const P& a, const P& b) {\n if (abs(a-b)<EPS) return 0;\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n }\n}\ndouble cross(const P& a, const P& b) {\n return imag(conj(a)*b);\n}\ndouble dot(const P& a, const P& b) {\n return real(conj(a)*b);\n}\nstruct L : public vector<P> {\n L(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n L() {resize(2);}\n};\nostream &operator<<(ostream &os, const L &a) {\n os << a[0] << \" -> \" << a[1];\n return os;\n}\n\ntypedef vector<P> G;\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\nstruct C {\n P p; double r;\n C(const P &p, double r) : p(p), r(r) { }\n};\n\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > 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\n return 0;\n}\n\nP rotate(const P &p, double ang) {\n return p * P(cos(ang), sin(ang));\n}\n\nP projection(const L &l, const P &p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\nP reflection(const L &l, const P &p) {\n return p + P(2,0) * (projection(l, p) - p);\n}\n\ndouble distanceLP(const L &l, const P &p) {\n return abs(p - projection(l, p));\n}\n\nbool intersectSP(const L &s, const P &p) {\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\n}\nbool intersectLL(const L &l, const L &m) {\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel\n abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line\n}\nbool intersectLS(const L &l, const L &s) {\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\n}\nbool intersectLP(const L &l, const P &p) {\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\n}\nbool intersectSS(const L &s, const L &t) {\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\nbool intersectSS2(const L &s, const L &t) {\n if (intersectSP(s,t[0]) || intersectSP(s,t[1]) ||\n intersectSP(t,s[0]) || intersectSP(t,s[1])) return 0;\n return intersectSS(s,t);\n}\nbool intersectHS(const L &h, const L &s) {\n if (intersectLP(h,s[0]) || intersectLP(h,s[1]) ||\n intersectLP(s,h[0]) || intersectLP(s,h[1])) return 0;\n if (intersectSS(h,s)) return 1;\n if (!intersectLS(h,s)) return 0;\n return (ccw(s[0],s[1],h[0]) == 1) ^ (cross(s[1]-s[0], h[1]-h[0]) > 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) {\n // sameline\n if (intersectSP(l,m[0]) && intersectSP(l,m[1])) return P(0.5)*(m[0]+m[1]);\n if (intersectSP(m,l[0]) && intersectSP(m,l[1])) return P(0.5)*(l[0]+l[1]);\n REP(i,2) REP(j,2)\n if (intersectSP(l,m[i]) && intersectSP(m,l[j])) return P(0.5)*(m[i]+l[j]);\n }\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m[0] + B / A * (m[1] - m[0]);\n}\n\nbool EQ(double a, double b) {\n return abs(a-b) < EPS;\n}\nbool EQP(const P &a, const P &b) {\n return norm(a-b) < EPS*EPS;\n}\n\n#define index_of(ps, p) \\\n distance(ps.begin(), lower_bound(ps.begin(), ps.end(), p))\nGraph arrangement(const vector<L>& segs, vector<P>& pt) {\n vector< vector<double> > V(segs.size());\n for (int i = 0; i < segs.size(); ++i) {\n pt.push_back( segs[i][0] );\n pt.push_back( segs[i][1] );\n V[i].push_back(0);\n V[i].push_back(1);\n for (int j = i+1; j < segs.size(); ++j) {\n L a = segs[i], b = segs[j];\n if (intersectSS(a, b)) {\n double D = cross(b[1]-b[0], a[1]-a[0]);\n if (abs(D) < EPS) continue;\n double t = cross(b[1]-b[0], b[0]-a[0]) / D;\n double s = cross(a[0]-b[0], a[1]-a[0]) / D;\n V[i].push_back(t);\n V[j].push_back(s);\n pt.push_back( a[0]+(a[1]-a[0])*t );\n }\n }\n }\n sort(pt.begin(), pt.end());\n pt.erase(unique(pt.begin(), pt.end(), EQP), pt.end());\n\n Graph g(pt.size());\n for (int i = 0; i < V.size(); ++i) {\n vector<double>& cut = V[i];\n sort(cut.begin(), cut.end());\n cut.erase(unique(cut.begin(), cut.end(), EQ), cut.end());\n for (int j = 0; j+1 < cut.size(); ++j) {\n P a = segs[i][0] + (segs[i][1] - segs[i][0]) * cut[j];\n P b = segs[i][0] + (segs[i][1] - segs[i][0]) * cut[j+1];\n int src = index_of(pt, a), dst = index_of(pt, b);\n // cout << g.size() << \" \" << src << \" \" << dst << \" \" << abs(a-b) << endl;\n g[src].push_back( Edge(src, dst, abs(a-b)) );\n g[dst].push_back( Edge(dst, src, abs(a-b)) );\n }\n }\n return g;\n}\n\nGraph segmentArrangement(const vector<L> &ss, vector<P> &ps) {\n int n = ss.size();\n REP(i,n) {\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 if (intersectSS(ss[i], ss[j]))\n ps.push_back( crosspoint(ss[i], ss[j]) );\n }\n sort(ALL(ps)); ps.erase(unique(ALL(ps)), ps.end());\n\n Graph g(ps.size());\n for (int i = 0; i < ss.size(); ++i) {\n int pre = -1;\n for (int j = 0; j < ps.size(); ++j)\n if (intersectSP(ss[i], ps[j])) {\n if (pre != -1) {\n double d = abs(ps[pre]-ps[j]);\n g[pre].push_back(Edge(pre,j,d));\n g[j].push_back(Edge(j,pre,d));\n }\n pre = j;\n }\n }\n return g;\n}\n\nvector<Edge> graph[300000];\nint pid[1004][1004];\n\nGraph segmentArrangement2(const vector<L> &ss, vector<P> &ps) {\n memset(pid,-1,sizeof(pid));\n REP(i,300000) graph[i].clear();\n int n = ss.size();\n REP(i,n) {\n int beg = ps.size();\n ps.push_back(ss[i][0]);\n ps.push_back(ss[i][1]);\n REP(j,n) {\n if (i == j) continue;\n if (intersectSS(ss[i],ss[j])) {\n int b = ps.size();\n if (i>j) {\n int a = pid[j][i];\n // cout << ps[a] << \" \"<< crosspoint(ss[i],ss[j]) << endl;\n graph[a].push_back(Edge(a,b,0));\n graph[b].push_back(Edge(b,a,0));\n } else {\n pid[i][j] = b;\n }\n ps.push_back(crosspoint(ss[i],ss[j]));\n }\n }\n vector<pair<P,int> > v(ps.size()-beg);\n for (int i=beg; i<ps.size(); ++i)\n v[i-beg] = make_pair(ps[i],i);\n sort(ALL(v));\n REP(i,v.size()-1) {\n int a = v[i].second, b = v[i+1].second;\n double c = abs(v[i].first-v[i+1].first);\n graph[a].push_back(Edge(a,b,c));\n graph[b].push_back(Edge(b,a,c));\n }\n }\n Graph g(ps.size());\n REP(i,ps.size()) {\n g[i] = graph[i];\n }\n return g;\n}\n\n\nint main() {\n int n;\n while(cin >> n, n) {\n vector<L> segs;\n REP(i,n) {\n P a, b;\n cin >> a.real() >> a.imag();\n cin >> b.real() >> b.imag();\n segs.push_back(L(a,b));\n }\n P s;\n cin >> s.real() >> s.imag();\n REP(i,n) {\n if (intersectSP(segs[i],s)) {\n segs.push_back(L(segs[i][0],s));\n segs.push_back(L(s,segs[i][1]));\n break;\n }\n }\n vector<P> pv;\n // Graph g = arrangement(segs,pv);\n Graph g = segmentArrangement2(segs,pv);\n int sid = -1;\n REP(i,pv.size()) {\n if (abs(pv[i]-s) < EPS) sid = i;\n }\n assert(sid != -1);\n // REP(i,g.size()) {\n // cout << i << endl;\n // FOR(it, g[i]) {\n // cout << it->dst << \" \" << it->weight << endl;\n // }\n // }\n // cout << sid << endl;\n vector<double> dis = dijkstra(g,sid);\n double ans = 0;\n REP(i,g.size()) {\n FOR(it, g[i]) {\n int a = it->src;\n int b = it->dst;\n double x = (dis[b]-dis[a]+it->weight) / 2;\n chmax(ans, dis[a] + x);\n }\n }\n cout << setprecision(10) << fixed << ans << endl;\n // printf(\"%.10Lf\\n\", ans);\n }\n}","accuracy":1,"time_ms":700,"memory_kb":25688,"score_of_the_acc":-0.7942,"final_rank":9},{"submission_id":"aoj_2062_666097","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\n#include <string>\n#include <cmath>\n#include <cassert>\n#include <queue>\n#include <set>\n#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)\n#define double long double\nconst int INF = 1<<29;\nconst double EPS = 1e-8;\nconst double PI = acos(-1);\ntypedef pair<int,int> pii;\ntypedef long long ll;\n\ntypedef double 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};\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}\n\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\n\n// テゥツ?禿ァツィツ凝」ツ?古」ツ??」ツつ嘉」ツ?ェテ」ツ??・ツ?エテ・ツ青?\nvector<Weight> dijkstra(const Graph &g, int s) {\n vector<Weight> dist(g.size(), INF);\n dist[s] = 0;\n priority_queue<Edge> Q; // \"e < f\" <=> \"e.weight > f.weight\"\n for (Q.push(Edge(-2, s, 0)); !Q.empty(); ) {\n Edge e = Q.top(); Q.pop();\n if (dist[e.dst] < e.weight) continue;\n FOR(f,g[e.dst]) {\n if (dist[f->dst] > e.weight+f->weight) {\n dist[f->dst] = e.weight+f->weight;\n Q.push(Edge(f->src, f->dst, e.weight+f->weight));\n }\n }\n }\n return dist;\n}\n\n\ntypedef complex<double> P;\nnamespace std {\n bool operator < (const P& a, const P& b) {\n if (abs(a-b)<EPS) return 0;\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n }\n}\ndouble cross(const P& a, const P& b) {\n return imag(conj(a)*b);\n}\ndouble dot(const P& a, const P& b) {\n return real(conj(a)*b);\n}\nstruct L : public vector<P> {\n L(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n L() {resize(2);}\n};\nostream &operator<<(ostream &os, const L &a) {\n os << a[0] << \" -> \" << a[1];\n return os;\n}\n\ntypedef vector<P> G;\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\nstruct C {\n P p; double r;\n C(const P &p, double r) : p(p), r(r) { }\n};\n\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > 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\n return 0;\n}\n\nP rotate(const P &p, double ang) {\n return p * P(cos(ang), sin(ang));\n}\n\nP projection(const L &l, const P &p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\nP reflection(const L &l, const P &p) {\n return p + P(2,0) * (projection(l, p) - p);\n}\n\ndouble distanceLP(const L &l, const P &p) {\n return abs(p - projection(l, p));\n}\n\nbool intersectSP(const L &s, const P &p) {\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\n}\nbool intersectLL(const L &l, const L &m) {\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel\n abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line\n}\nbool intersectLS(const L &l, const L &s) {\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\n}\nbool intersectLP(const L &l, const P &p) {\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\n}\nbool intersectSS(const L &s, const L &t) {\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\nbool intersectSS2(const L &s, const L &t) {\n if (intersectSP(s,t[0]) || intersectSP(s,t[1]) ||\n intersectSP(t,s[0]) || intersectSP(t,s[1])) return 0;\n return intersectSS(s,t);\n}\nbool intersectHS(const L &h, const L &s) {\n if (intersectLP(h,s[0]) || intersectLP(h,s[1]) ||\n intersectLP(s,h[0]) || intersectLP(s,h[1])) return 0;\n if (intersectSS(h,s)) return 1;\n if (!intersectLS(h,s)) return 0;\n return (ccw(s[0],s[1],h[0]) == 1) ^ (cross(s[1]-s[0], h[1]-h[0]) > 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]; // same line\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m[0] + B / A * (m[1] - m[0]);\n}\n\nbool EQ(double a, double b) {\n return abs(a-b) < EPS;\n}\nbool EQP(const P &a, const P &b) {\n return norm(a-b) < EPS*EPS;\n}\n\n#define index_of(ps, p) \\\n distance(ps.begin(), lower_bound(ps.begin(), ps.end(), p))\nGraph arrangement(const vector<L>& segs, vector<P>& pt) {\n vector< vector<double> > V(segs.size());\n for (int i = 0; i < segs.size(); ++i) {\n pt.push_back( segs[i][0] );\n pt.push_back( segs[i][1] );\n V[i].push_back(0);\n V[i].push_back(1);\n for (int j = i+1; j < segs.size(); ++j) {\n L a = segs[i], b = segs[j];\n if (intersectSS(a, b)) {\n double D = cross(b[1]-b[0], a[1]-a[0]);\n if (abs(D) < EPS) continue;\n double t = cross(b[1]-b[0], b[0]-a[0]) / D;\n double s = cross(a[0]-b[0], a[1]-a[0]) / D;\n V[i].push_back(t);\n V[j].push_back(s);\n pt.push_back( a[0]+(a[1]-a[0])*t );\n }\n }\n }\n sort(pt.begin(), pt.end());\n pt.erase(unique(pt.begin(), pt.end(), EQP), pt.end());\n\n Graph g(pt.size());\n for (int i = 0; i < V.size(); ++i) {\n vector<double>& cut = V[i];\n sort(cut.begin(), cut.end());\n cut.erase(unique(cut.begin(), cut.end(), EQ), cut.end());\n for (int j = 0; j+1 < cut.size(); ++j) {\n P a = segs[i][0] + (segs[i][1] - segs[i][0]) * cut[j];\n P b = segs[i][0] + (segs[i][1] - segs[i][0]) * cut[j+1];\n int src = index_of(pt, a), dst = index_of(pt, b);\n // cout << g.size() << \" \" << src << \" \" << dst << \" \" << abs(a-b) << endl;\n g[src].push_back( Edge(src, dst, abs(a-b)) );\n g[dst].push_back( Edge(dst, src, abs(a-b)) );\n }\n }\n return g;\n}\n\nint main() {\n int n;\n while(cin >> n, n) {\n vector<L> segs;\n REP(i,n) {\n P a, b;\n cin >> a.real() >> a.imag();\n cin >> b.real() >> b.imag();\n segs.push_back(L(a,b));\n }\n P s;\n cin >> s.real() >> s.imag();\n REP(i,n) {\n if (intersectSP(segs[i],s)) {\n segs.push_back(L(segs[i][0],s));\n segs.push_back(L(s,segs[i][1]));\n }\n }\n vector<P> pv;\n Graph g = arrangement(segs,pv);\n int sid = -1;\n REP(i,pv.size()) {\n if (abs(pv[i]-s) < EPS) sid = i;\n }\n assert(sid != -1);\n // REP(i,g.size()) {\n // cout << i << endl;\n // FOR(it, g[i]) {\n // cout << it->dst << \" \" << it->weight << endl;\n // }\n // }\n // cout << sid << endl;\n vector<double> dis = dijkstra(g,sid);\n double ans = 0;\n REP(i,g.size()) {\n FOR(it, g[i]) {\n int a = it->src;\n int b = it->dst;\n double x = (dis[b]-dis[a]+it->weight) / 2;\n chmax(ans, dis[a] + x);\n }\n }\n cout << setprecision(10) << fixed << ans << endl;\n // printf(\"%.10Lf\\n\", ans);\n }\n}","accuracy":1,"time_ms":2000,"memory_kb":11556,"score_of_the_acc":-0.5469,"final_rank":8},{"submission_id":"aoj_2062_249871","code_snippet":"#include<iostream>\n#include<stdio.h>\n#include<complex>\n#include<cfloat>\n#include<cassert>\n#include<cmath>\n#include<vector>\n#include<queue>\n#include<algorithm>\n\nusing namespace std;\n\n\n\n#define EPS (1e-8)\n#define equals(a, b) (abs((a) - (b)) < EPS )\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 ){\n\treturn Point(x + p.x, y + p.y);\n }\n\n Point operator - ( Point p ){\n\treturn Point(x - p.x, y - p.y);\n }\n\n Point operator * ( double a ){\n\treturn Point(a*x, a*y);\n }\n\n double absolute() { 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 abs(x-p.x) < EPS && abs(y-p.y) < EPS;\n }\n};\n\ntypedef Point Vector;\n\nclass Segment{\n public:\n Point source, target;\n Segment(Point s = Point(), Point t = Point()): source(s), target(t){}\n};\n\ndouble norm( Vector a ){\n return a.x*a.x + a.y*a.y;\n}\n\ndouble absolute( Vector a ){\n return sqrt(norm(a));\n}\n\ndouble getDistance(Vector a, Vector b){\n return absolute(a - b); \n}\n\n// dot product\ndouble dot(Vector a, Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\n// cross product\ndouble cross(Vector a, Vector b){\n return a.x*b.y - a.y*b.x;\n}\n\nPoint project( Segment s, Point p ){\n Vector base = s.target - s.source;\n double t = dot(p - s.source, base)/norm(base);\n return s.source + (base)*t;\n}\n\nPoint reflect( Segment s, Point p ){\n return p + (project(s, p) - p)*2.0;\n}\n\n// verified by uoa2062\nbool isOnSegment( Point a, Point b, Point c){\n if ( a == c || b == c ) return true;\n return (absolute(a-c) + absolute(c-b) < absolute(a-b) + EPS );\n}\n\nbool isOrthogonal( Vector a, Vector b ){\n return equals( dot(a, b), 0.0 );\n}\n\nbool isOrthogonal( Point a1, Point a2, Point b1, Point b2 ){\n return isOrthogonal( a1 - a2, b1 - b2 );\n}\n\nbool isOrthogonal( Segment s1, Segment s2 ){\n return equals( dot(s1.target - s1.source, s2.target - s2.source), 0.0 );\n}\n\nbool isParallel( Vector a, Vector b ){\n return equals( cross(a, b), 0.0 );\n}\n\nbool isParallel( Point a1, Point a2, Point b1, Point b2){\n return isParallel( a1 - a2, b1 - b2 );\n}\n\nbool isParallel( Segment s1, Segment s2 ){\n return equals( cross(s1.target - s1.source, s2.target - s2.source), 0.0 );\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 return ON_SEGMENT;\n}\n\n// intersect Segment p1-p2 and Segment p3-p4 ?\nbool isIntersect(Point p1, Point p2, Point p3, Point p4){\n return ( ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&\n\t ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0 );\n}\n\n// intersect Segment s1 and Segment s2 ?\n// verified by 920, 833, 866, uoa2062\nbool isIntersect(Segment s1, Segment s2){\n return isIntersect(s1.source, s1.target, s2.source, s2.target);\n}\n\n// verified by 920, 833, uoa2062\nPoint getCrossPoint(Segment s1, Segment s2){\n assert( isIntersect(s1, s2) );\n Vector base = s2.target - s2.source;\n double d1 = absolute(cross(base, s1.source - s2.source));\n double d2 = absolute(cross(base, s1.target - s2.source));\n double t = d1/(d1 + d2);\n return s1.source + (s1.target - s1.source)*t;\n}\n\n\n#define MAX 2000\n#define NMAX 80000\n#define LIMIT FLT_MAX\n\nclass Edge{\n public:\n int target;\n double dist;\n Edge(){}\n Edge(int target, double dist): target(target), dist(double(dist)){}\n};\n\nclass Graph{\n public:\n vector<Edge> adjList[NMAX];\n int start;\n\n Graph(){\n\tfor ( int i = 0; i < NMAX; i++ ) adjList[i].clear();\n }\n \n void connect( int i, int j, double d ){\n\tadjList[i].push_back(Edge(j, d));\n\tadjList[j].push_back(Edge(i, d));\n }\n};\n\nclass QNode{\n public:\n int index;\n double cost;\n QNode(){}\n QNode( int index, double cost ): index(index), cost(cost){}\n \n bool operator < ( const QNode &q ) const { return cost > q.cost; }\n};\n\nclass Node{\n public:\n Point p;\n int id;\n Node(){}\n Node( Point p, int id): p(p), id(id){}\n bool operator < ( const Node &n) const {\n\treturn p < n.p;\n }\n};\n\nint nnode;\nPoint SP[NMAX];\n\nint getIndex( Point p ){\n SP[nnode++] = p;\n return nnode-1;\n}\n\nvoid makeGraph(Graph &g, Segment S[MAX], int N, Point s ){\n Segment base, target;\n Node L[NMAX];\n int beg, p = 0;\n bool startSet = false;\n nnode = 0;\n for ( int b = 0; b < N; b++ ){\n\tbase = S[b];\n\tbeg = p;\n\n\tif ( !startSet && isOnSegment(base.source, base.target, s) ){\n\t L[p++] = Node(s, getIndex(s));\n\t startSet = true;\n\t}\n\n\tL[p++] = Node(base.source, getIndex(base.source));\n\tL[p++] = Node(base.target, getIndex(base.target));\n\n\tfor ( int t = 0; t < N; t++ ){\n\t if ( t == b ) continue;\n\t target = S[t];\n\t if ( !isIntersect(base, target) ) continue;\n\t Point cp = getCrossPoint(base, target);\n\t L[p++] = Node(cp, getIndex(cp));\n\t}\n\n\tsort(L + beg, L + p );\n\n\tfor ( int i = beg; i < p-1; i++ ){\n\t g.connect(L[i].id, L[i+1].id, getDistance(L[i].p, L[i+1].p));\n\t}\n }\n\n sort( L, L + p );\n\n for ( int i = 0; i < p-1; i++ ){\n //\tif ( eq(L[i].p, L[i+1].p) ) \n if ( L[i].p == L[i+1].p ) \n\t g.connect( L[i].id, L[i+1].id, 0.0);\n //\tif ( eq(L[i].p, s) ) g.start = L[i].id;\n if ( L[i].p == s ) g.start = L[i].id;\n }\n\n}\n\ndouble dijkstra(Graph g){\n bool visited[NMAX];\n double D[NMAX];\n priority_queue<QNode> PQ;\n \n for ( int i = 0; i < nnode; i++ ) {\n\tvisited[i] = false;\n\tD[i] = LIMIT;\n }\n\n for ( int i = 0; i < g.adjList[g.start].size(); i++ ){\n\tEdge v = g.adjList[g.start][i];\n\tPQ.push(QNode(v.target, v.dist) );\n\tD[v.target] = v.dist;\n }\n\n visited[g.start] = true;\n D[g.start] = 0.0;\n\n QNode u;\n\n while( !PQ.empty() ){\n\tu = PQ.top(); PQ.pop();\n\tif ( visited[u.index] ) continue;\n\tvisited[u.index] = true;\n\tfor ( int i = 0; i < g.adjList[u.index].size(); i++ ){\n\t Edge v = g.adjList[u.index][i];\n\t if ( visited[v.target] ) continue;\n\t if ( D[u.index] + v.dist < D[v.target] ){\n\t\tD[v.target] = D[u.index] + v.dist;\n\t\tPQ.push(QNode(v.target, D[v.target]));\n\t }\n\t}\n }\n\n double mdist = 0.0;\n\n for ( int i = 0; i < nnode; i++ ){\n\tmdist = max(mdist, D[i] );\n\tfor ( int k = 0; k < g.adjList[i].size(); k++ ){\n\t int j = g.adjList[i][k].target;\n\t double d = getDistance(SP[i], SP[j]);\n\t mdist = max(mdist, (double)(min(D[i], D[j]) + (d - abs(D[i]-D[j]))/2.0));\n\t}\n }\n return mdist;\n}\n\nint main(){\n int N;\n Segment S[MAX];\n\n while( cin >> N && N ){\n\tPoint p1, p2;\n\tfor ( int i = 0; i < N; i++ ){\n\t cin >> p1.x; cin >> p1.y;\n\t cin >> p2.x; cin >> p2.y;\n\t S[i] = Segment(p1, p2);\n\t}\n\tcin >> p1.x; cin >> p1.y;\n\tGraph g;\n\tmakeGraph(g, S, N, p1);\n\tprintf(\"%.5lf\\n\", dijkstra(g));\n }\n\n return 0;\n}\n\n/**\ndaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaadaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaa\n\n\n*/","accuracy":1,"time_ms":1570,"memory_kb":12000,"score_of_the_acc":-0.4743,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_2062_3114687\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <array>\\n#include <map>\\n#include <utility>\\n#include <queue>\\nusing namespace std;\\nconst double EPS = 1e-8;\\nconst double INF = 1e12;\\nconst double PI = acos(-1);\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\n\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\nstruct L : array<P, 2>{\\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\\n L(){}\\n};\\n\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\nint ccw(P a, P b, P c){\\n b -= a;\\n c -= a;\\n if(cross(b,c) > EPS) return +1; //ccw\\n if(cross(b,c) < -EPS) return -1; //cw\\n if(dot(b,c) < -EPS) return +2; //c-a-b\\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\\n return 0; //a-c-b\\n}\\n\\nbool intersectSS(const L& a, const L& b){\\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\\n}\\nbool intersectSP(const L& s, const P &p){\\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\\n}\\n\\nbool isParallel(const P &a, const P &b){\\n return abs(cross(a,b)) < EPS;\\n}\\nbool isParallel(const L &a, const L &b){\\n return isParallel(a[1]-a[0], b[1]-b[0]);\\n}\\n\\nP crosspointLL(const L &l, const L &m) {\\n double A = cross(l[1]-l[0], m[1]-m[0]);\\n double B = cross(l[1]-l[0], l[1]-m[0]);\\n return m[0] + B/A *(m[1]-m[0]);\\n}\\n\\npair<vector<vector<pair<int, double> > >, VP> arrangementEX(const vector<L> &l, const P &sp){\\n vector<VP> cp(l.size());\\n VP plist;\\n plist.push_back(sp);\\n for(int i=0; i<(int)l.size(); i++){\\n for(int j=i+1; j<(int)l.size(); j++){\\n if(!isParallel(l[i], l[j]) && intersectSS(l[i], l[j])){\\n P cpij = crosspointLL(l[i], l[j]);\\n cp[i].push_back(cpij);\\n cp[j].push_back(cpij);\\n plist.push_back(cpij);\\n }\\n }\\n if(intersectSP(l[i], sp)){\\n cp[i].push_back(sp);\\n }\\n cp[i].push_back(l[i][0]);\\n cp[i].push_back(l[i][1]);\\n plist.push_back(l[i][0]);\\n plist.push_back(l[i][1]);\\n sort(cp[i].begin(), cp[i].end());\\n cp[i].erase(unique(cp[i].begin(), cp[i].end()), cp[i].end());\\n for(int j=cp[i].size()-2; j>=0; j--){\\n P mid = (cp[i][j] +cp[i][j+1]) /2.0;\\n cp[i].push_back(mid);\\n plist.push_back(mid);\\n }\\n sort(cp[i].begin(), cp[i].end());\\n cp[i].erase(unique(cp[i].begin(), cp[i].end()), cp[i].end());\\n }\\n sort(plist.begin(), plist.end());\\n plist.erase(unique(plist.begin(), plist.end()), plist.end());\\n\\n int n = plist.size();\\n map<P, int> conv;\\n for(int i=0; i<n; i++){\\n conv[plist[i]] = i;\\n }\\n vector<vector<pair<int, double> > > adj(n);\\n for(int i=0; i<(int)cp.size(); i++){\\n for(int j=0; j<(int)cp[i].size()-1; j++){\\n int jidx = conv[cp[i][j]];\\n int jp1idx = conv[cp[i][j+1]];\\n double dist = abs(cp[i][j] -cp[i][j+1]);\\n adj[jidx].emplace_back(jp1idx, dist);\\n adj[jp1idx].emplace_back(jidx, dist);\\n }\\n }\\n for(int i=0; i<n; i++){\\n sort(adj[i].begin(), adj[i].end());\\n adj[i].erase(unique(adj[i].begin(), adj[i].end()), adj[i].end());\\n }\\n return make_pair(adj, plist);\\n}\\n\\nint main(){\\n while(1){\\n int n;\\n cin >> n;\\n if(n == 0) break;\\n\\n vector<L> l(n);\\n for(int i=0; i<n; i++){\\n double xs,ys,xt,yt;\\n cin >> xs >> ys >> xt >> yt;\\n l[i] = L(P(xs, ys), P(xt, yt));\\n }\\n double sx,sy;\\n cin >> sx >> sy;\\n P s(sx, sy);\\n\\n pair<vector<vector<pair<int, double> > >, VP> ret = arrangementEX(l, s);\\n vector<vector<pair<int, double> > > &adj = ret.first;\\n VP &plist = ret.second;\\n int m = plist.size();\\n int sidx = lower_bound(plist.begin(), plist.end(), s) -plist.begin();\\n\\n priority_queue<pair<double, int> > wait;\\n wait.push(make_pair(0, sidx));\\n vector<double> mincost(m, INF);\\n mincost[sidx] = 0;\\n while(!wait.empty()){\\n double dist = -wait.top().first;\\n int pos = wait.top().second;\\n wait.pop();\\n if(dist > mincost[pos]) continue;\\n\\n for(pair<int, double> next: adj[pos]){\\n int npos = next.first;\\n double ndist = dist +next.second;\\n if(ndist +EPS < mincost[npos]){\\n mincost[npos] = ndist;\\n wait.push(make_pair(-ndist, npos));\\n }\\n }\\n }\\n\\n cout << fixed << setprecision(10);\\n cout << *max_element(mincost.begin(), mincost.end()) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1140,\n \"memory_kb\": 33364,\n \"score_of_the_acc\": -1.1653,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2062_2062641\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define MAX 100000\\n#define inf 1<<29\\n#define linf 1e18\\n#define eps (1e-8)\\n#define mod 1000000007\\n#define pi M_PI\\n#define f first\\n#define s second\\n#define mp make_pair\\n#define pb push_back\\n#define all(a) (a).begin(),(a).end()\\n#define pd(a) printf(\\\"%.10f\\\\n\\\",(double)(a))\\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\\n#define RFOR(i,a,b) for(int i=(a)-1;(b)<=i;i--)\\n#define equals(a,b) (fabs((a)-(b))<eps)\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<int,int> pii;\\ntypedef pair<double,int> pdi;\\ntypedef pair<int,double> pid;\\ntypedef vector<int> vi;\\ntypedef vector<pii> vpi;\\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\\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<-eps : y-p.y<-eps);}\\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 \\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\\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\\nGraph g;\\nvector<Point> vp;\\nint n;\\nvector<Segment> vs;\\nPoint s;\\nint start;\\ndouble d[MAX];\\n\\nvoid init(){\\n vs.clear();\\n vp.clear();\\n g.clear();\\n}\\n\\nvoid dijkstra(){\\n FOR(i,0,MAX)d[i]=linf;\\n priority_queue<pdi,vector<pdi>,greater<pdi> > pq;\\n pq.push(mp(0.0,start));\\n d[start]=0.0;\\n\\n while(pq.size()){\\n pdi u=pq.top();\\n pq.pop();\\n\\n if(d[u.s]-u.f<-eps)continue;\\n\\n FOR(i,0,g[u.s].size()){\\n int next=g[u.s][i];\\n double cost=abs(vp[u.s]-vp[next]);\\n if(u.f+cost-d[next]<-eps){\\n d[next]=u.f+cost;\\n pq.push(mp(d[next],next));\\n }\\n }\\n }\\n}\\n\\ndouble solve(){\\n double res=0;\\n vp.pb(s);\\n g=SegmentArrangement(vs,vp);\\n FOR(i,0,vp.size())if(s==vp[i])start=i;\\n dijkstra();\\n FOR(i,0,vp.size()){\\n if(d[i]!=linf){\\n res=max(res,d[i]);\\n FOR(j,0,g[i].size()){\\n int next=g[i][j];\\n double cost=abs(vp[next]-vp[i]);\\n res=max(res,min(d[i],d[next])+(cost-abs(d[i]-d[next]))/2.0);\\n }\\n }\\n }\\n return res;\\n}\\n\\nint main()\\n{\\n while(1){\\n cin>>n;\\n if(n==0)break;\\n init();\\n FOR(i,0,n){\\n double a,b,c,d;\\n cin>>a>>b>>c>>d;\\n vs.pb(Segment(Point(a,b),Point(c,d)));\\n }\\n cin>>s.x>>s.y;\\n pd(solve());\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1360,\n \"memory_kb\": 9472,\n \"score_of_the_acc\": -0.3386,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2062_2062638\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define MAX 100000\\n#define inf 1<<29\\n#define linf 1e18\\n#define eps (1e-8)\\n#define mod 1000000007\\n#define pi M_PI\\n#define f first\\n#define s second\\n#define mp make_pair\\n#define pb push_back\\n#define all(a) (a).begin(),(a).end()\\n#define pd(a) printf(\\\"%.10f\\\\n\\\",(double)(a))\\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\\n#define RFOR(i,a,b) for(int i=(a)-1;(b)<=i;i--)\\n#define equals(a,b) (fabs((a)-(b))<eps)\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<int,int> pii;\\ntypedef pair<double,int> pdi;\\ntypedef pair<int,double> pid;\\ntypedef vector<int> vi;\\ntypedef vector<pii> vpi;\\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\\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<-eps : y-p.y<-eps);}\\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\\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\\nGraph g;\\nvector<Point> vp;\\nint n;\\nvector<Segment> vs;\\nPoint s;\\nint start;\\ndouble d[MAX];\\n\\nvoid init(){\\n vs.clear();\\n vp.clear();\\n g.clear();\\n}\\n\\nvoid dijkstra(){\\n FOR(i,0,MAX)d[i]=linf;\\n priority_queue<pdi,vector<pdi>,greater<pdi> > pq;\\n pq.push(mp(0.0,start));\\n d[start]=0.0;\\n\\n while(pq.size()){\\n pdi u=pq.top();\\n pq.pop();\\n\\n if(d[u.s]-u.f<-eps)continue;\\n\\n FOR(i,0,g[u.s].size()){\\n int next=g[u.s][i];\\n double cost=abs(vp[u.s]-vp[next]);\\n if(u.f+cost-d[next]<-eps){\\n d[next]=u.f+cost;\\n pq.push(mp(d[next],next));\\n }\\n }\\n }\\n}\\n\\ndouble solve(){\\n double res=0;\\n vp.pb(s);\\n g=SegmentArrangement(vs,vp);\\n FOR(i,0,vp.size())if(s==vp[i])start=i;\\n dijkstra();\\n FOR(i,0,vp.size()){\\n if(d[i]!=linf){\\n res=max(res,d[i]);\\n FOR(j,0,g[i].size()){\\n int next=g[i][j];\\n double cost=abs(vp[next]-vp[i]);\\n res=max(res,min(d[i],d[next])+(cost-abs(d[i]-d[next]))/2.0);\\n }\\n }\\n }\\n return res;\\n}\\n\\nint main()\\n{\\n while(cin>>n && n){\\n init();\\n FOR(i,0,n){\\n double a,b,c,d;\\n cin>>a>>b>>c>>d;\\n vs.pb(Segment(Point(a,b),Point(c,d)));\\n }\\n cin>>s.x>>s.y;\\n pd(solve());\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1360,\n \"memory_kb\": 9452,\n \"score_of_the_acc\": -0.3379,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2062_2062264\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define MAX 100000\\n#define inf 1<<29\\n#define linf 1e18\\n#define eps (1e-8)\\n#define mod 1000000007\\n#define pi M_PI\\n#define f first\\n#define s second\\n#define mp make_pair\\n#define pb push_back\\n#define all(a) (a).begin(),(a).end()\\n#define pd(a) printf(\\\"%.10f\\\\n\\\",(double)(a))\\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\\n#define RFOR(i,a,b) for(int i=(a)-1;(b)<=i;i--)\\n#define equals(a,b) (fabs((a)-(b))<eps)\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<int,int> pii;\\ntypedef pair<double,int> pdi;\\ntypedef pair<int,double> pid;\\ntypedef vector<int> vi;\\ntypedef vector<pii> vpi;\\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\\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\\nGraph g;\\nvector<Point> vp;\\nint n;\\nvector<Segment> vs;\\nPoint s;\\nint start;\\ndouble d[MAX];\\n\\nvoid init(){\\n vs.clear();\\n vp.clear();\\n g.clear();\\n}\\n\\nvoid dijkstra(){\\n FOR(i,0,MAX)d[i]=linf;\\n priority_queue<pdi,vector<pdi>,greater<pdi> > pq;\\n pq.push(mp(0.0,start));\\n d[start]=0.0;\\n\\n while(pq.size()){\\n pdi u=pq.top();\\n pq.pop();\\n\\n if(d[u.s]-u.f<-eps)continue;\\n\\n FOR(i,0,g[u.s].size()){\\n int next=g[u.s][i];\\n double cost=abs(vp[u.s]-vp[next]);\\n if(u.f+cost-d[next]<-eps){\\n d[next]=u.f+cost;\\n pq.push(mp(d[next],next));\\n }\\n }\\n }\\n}\\n\\ndouble solve(){\\n double res=0;\\n merge(vs);\\n vp.pb(s);\\n g=SegmentArrangement(vs,vp);\\n FOR(i,0,vp.size())if(s==vp[i])start=i;\\n dijkstra();\\n FOR(i,0,vp.size()){\\n if(d[i]!=linf){\\n res=max(res,d[i]);\\n FOR(j,0,g[i].size()){\\n int next=g[i][j];\\n double cost=abs(vp[next]-vp[i]);\\n res=max(res,min(d[i],d[next])+(cost-abs(d[i]-d[next]))/2.0);\\n }\\n }\\n }\\n return res;\\n}\\n\\nint main()\\n{\\n while(cin>>n && n){\\n init();\\n FOR(i,0,n){\\n double a,b,c,d;\\n cin>>a>>b>>c>>d;\\n vs.pb(Segment(Point(a,b),Point(c,d)));\\n }\\n cin>>s.x>>s.y;\\n pd(solve());\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1320,\n \"memory_kb\": 9516,\n \"score_of_the_acc\": -0.332,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2062_1925170\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cstdio>\\n#include <algorithm>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <functional>\\n#include <ctime>\\n#include <numeric>\\n\\nusing namespace std;\\n\\n#define fst first\\n#define snd second\\n#define all(c) ((c).begin()), ((c).end())\\n#define TEST(x,a) { auto y=(x); if (sign(y-a)) { cout << \\\"line \\\" << __LINE__ << #x << \\\" = \\\" << y << \\\" != \\\" << a << endl; exit(-1); } }\\ndouble urand() { return rand() / (1.0 + RAND_MAX); }\\n\\nconst double PI = acos(-1.0);\\n\\n// implementation note: use EPS only this function\\n// usage note: check sign(x) < 0, sign(x) > 0, or sign(x) == 0\\n// notice: should be normalize to O(1)\\nconst double EPS = 1e-8;\\nint sign(double x) {\\n if (x < -EPS) return -1;\\n if (x > +EPS) return +1;\\n return 0;\\n}\\nstruct point {\\n typedef double T;\\n T x, y; \\n point &operator+=(point p) { x += p.x; y += p.y; return *this; }\\n point &operator-=(point p) { x -= p.x; y -= p.y; return *this; }\\n point &operator*=(T a) { x *= a; y *= a; return *this; }\\n point &operator/=(T a) { return *this *= (1.0/a); }\\n point operator-() const { return {-x, -y}; }\\n bool operator==(point p) const { return !sign(x-p.x) && !sign(y-p.y); }\\n bool operator<(point p) const { return x!=p.x ? x<p.x : y<p.y; } // for sort\\n};\\npoint operator+(point p, point q) { return p += q; }\\npoint operator-(point p, point q) { return p -= q; }\\npoint operator*(point::T a, point p) { return p *= a; }\\npoint operator*(point p, point::T a) { return p *= a; }\\npoint operator/(point p, point::T a) { return p /= a; }\\npoint::T dot(point p, point q) { return p.x*q.x+p.y*q.y; }\\npoint::T cross(point p, point q) { return p.x*q.y-p.y*q.x; } // left turn > 0\\npoint::T norm2(point p) { return dot(p,p); }\\npoint orth(point p) { return {-p.y, p.x}; }\\npoint::T norm(point p) { return sqrt(dot(p,p)); }\\n\\nstruct segment { point p, q; };\\n\\nvector<point> intersect(segment s, segment t) {\\n auto a = cross(s.q - s.p, t.q - t.p);\\n auto b = cross(t.p - s.p, t.q - t.p); \\n auto c = cross(s.q - s.p, s.p - t.p);\\n if (a < 0) { a = -a; b = -b; c = -c; }\\n if (sign(b) < 0 || sign(a-b) < 0 ||\\n sign(c) < 0 || sign(a-c) < 0) return {}; // disjoint\\n if (sign(a) != 0) return {s.p + b/a*(s.q - s.p)}; // properly crossing\\n vector<point> ps; // same line\\n auto insert_if_possible = [&](point p) {\\n for (auto q: ps) if (sign(dot(p-q, p-q)) == 0) return;\\n ps.push_back(p);\\n };\\n if (sign(dot(s.p-t.p, s.q-t.p)) <= 0) insert_if_possible(t.p);\\n if (sign(dot(s.p-t.q, s.q-t.q)) <= 0) insert_if_possible(t.q);\\n if (sign(dot(t.p-s.p, t.q-s.p)) <= 0) insert_if_possible(s.p);\\n if (sign(dot(t.p-s.q, t.q-s.q)) <= 0) insert_if_possible(s.q);\\n return ps;\\n}\\n\\nstruct arrangement {\\n struct edge {\\n int src, dst;\\n point::T weight;\\n };\\n int n;\\n vector<point> ps; // ps[id[p]] = p, id[ps[k]] = k\\n map<point,int> id; \\n vector<vector<edge>> adj;\\n\\n arrangement(vector<segment> ss) : n(0) {\\n vector<vector<pair<point::T, int>>> group(ss.size());\\n auto append = [&](int i, point p) {\\n if (!id.count(p)) { id[p] = n++; ps.push_back(p); }\\n group[i].push_back({norm(ss[i].p - p), id[p]});\\n };\\n for (int i = 0; i < ss.size(); ++i) {\\n append(i, ss[i].p);\\n append(i, ss[i].q);\\n for (int j = 0; j < i; ++j) {\\n auto qs = intersect(ss[i], ss[j]);\\n if (qs.size() == 1) {\\n append(i, qs[0]);\\n append(j, qs[0]);\\n }\\n }\\n }\\n adj.resize(n);\\n for (auto &vs: group) {\\n sort(all(vs));\\n for (int i = 0; i+1 < vs.size(); ++i) {\\n auto u = vs[i].snd, v = vs[i+1].snd;\\n if (u == v) continue;\\n auto len = vs[i+1].fst - vs[i].fst;\\n adj[u].push_back({u, v, len});\\n adj[v].push_back({v, u, len});\\n }\\n }\\n }\\n void shortest_path(point sp) {\\n int s = id[sp];\\n vector<point::T> dist(n, 1.0/0.0);\\n vector<int> prev(n, -1);\\n typedef pair<point::T, int> node;\\n priority_queue<node, vector<node>, greater<node>> Q;\\n Q.push(node(dist[s] = 0, s));\\n while (!Q.empty()) {\\n node z = Q.top(); Q.pop();\\n if (dist[z.snd] <= z.fst) {\\n for (auto e: adj[z.snd]) {\\n if (dist[e.dst] > dist[e.src] + e.weight) {\\n dist[e.dst] = dist[e.src] + e.weight;\\n prev[e.dst] = e.src;\\n Q.push({dist[e.dst], e.dst});\\n }\\n }\\n }\\n }\\n point::T ans = 0;\\n for (int u = 0; u < n; ++u) {\\n for (edge e: adj[u]) {\\n point::T s = (dist[e.dst] - dist[e.src] + e.weight)/2;\\n ans = max(ans, dist[e.src] + s);\\n }\\n }\\n printf(\\\"%.12lf\\\\n\\\", ans);\\n }\\n};\\n\\n\\nint main() {\\n for (int m; ~scanf(\\\"%d\\\", &m) && m != 0; ) {\\n vector<segment> ss;\\n for (int i = 0; i < m; ++i) {\\n segment s;\\n scanf(\\\"%lf %lf %lf %lf\\\", &s.p.x, &s.p.y, &s.q.x, &s.q.y);\\n ss.push_back(s);\\n }\\n point p; \\n scanf(\\\"%lf %lf\\\", &p.x, &p.y);\\n ss.push_back({p, p});\\n arrangement arr(ss);\\n arr.shortest_path(p);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 11888,\n \"score_of_the_acc\": -0.2161,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2062_1094812\",\n \"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 <utility>\\n#include <complex>\\n#include <numeric>\\n#include <functional>\\n#include <random>\\n#include <regex>\\nusing namespace std;\\ntypedef long long ll;\\n\\n#define ALL(c) (c).begin(),(c).end()\\n#define FOR(i,l,r) for(int i=(int)l;i<(int)r;++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORr(i,l,r) for(int i=(int)r-1;i>=(int)l;--i)\\n#define REPr(i,n) FORr(i,0,n)\\n#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\\n#define IN(l,v,r) ((l)<=(v) && (v)<(r))\\n#define UNIQUE(v) v.erase(unique(ALL(v)),v.end())\\n\\n// must template\\ntypedef long double D;\\nconst D INF = 1e20,EPS = 1e-10;\\n\\nint sig(D a,D b=0){return a<b-EPS?-1:a>b+EPS?1:0;}\\ntemplate<typename T> bool eq(const T& a,const T& b){return sig(abs(a-b))==0;}\\n\\n\\ntypedef D Cost;Cost CINF=1e20;\\nstruct Edge{\\n\\tint from,to;Cost cost;\\n\\tEdge(int from,int to,Cost cost) : from(from),to(to),cost(cost) {};\\n\\tbool operator<(Edge r) const{return cost<r.cost;}\\n\\tbool operator>(Edge r) const{return cost>r.cost;}\\n};\\ntypedef vector<vector<Edge> > Graph;\\ntypedef complex<D> P;\\n#define X real()\\n#define Y imag()\\n\\nbool compX (const P& a,const P& b){return !eq(a.X,b.X)?sig(a.X,b.X)<0:sig(a.Y,b.Y)<0;}\\nistream& operator >> (istream& is,P& p){D x,y;is >> x >> y;p=P(x,y);return is;}\\n\\nnamespace std{\\n\\tbool operator < (const P& a,const P& b){return compX(a,b);}\\n \\tbool operator == (const P& a,const P& b){return eq(a,b);}\\n};\\n\\n// a×b\\nD cross(const P& a,const P& b){return imag(conj(a)*b);}\\n// a・b\\nD dot(const P& a,const P& b) {return real(conj(a)*b);}\\n\\nint ccw(const P& a,P b,P c){\\n\\tb -= a; c -= a;\\n\\tif (sig(cross(b,c)) > 0) return +1; // counter clockwise\\n\\tif (sig(cross(b,c)) < 0) return -1; // clockwise\\n\\tif (sig(dot(b,c)) < 0) return +2; // c--a--b on line\\n\\tif (sig(norm(b),norm(c))<0) return -2; // a--b--c on line\\n\\treturn 0; //a--c--b on line or c==a or c==b\\n}\\n\\n//直線・線分\\nstruct L : public vector<P> {\\n\\tP vec() const {return this->at(1)-this->at(0);}\\n\\tL(const P &a, const P &b){push_back(a); push_back(b);}\\n\\tL(){push_back(P(0,0));push_back(P(0,0));}\\n};\\nistream& operator >> (istream& is,L& l){is >> l[0] >> l[1];return is;}\\n\\nbool isIntersectLL(const L &l, const L &m) {\\n \\treturn sig(cross(l.vec(), m.vec()))!=0 || // non-parallel\\n\\tsig(cross(l.vec(), m[0]-l[0])) == 0; // same line\\n}\\nbool isIntersectLS(const L &l, const L &s) {\\n\\treturn sig(cross(l.vec(), s[0]-l[0])* // s[0] is left of l\\n\\t\\tcross(l.vec(), s[1]-l[0]))<=0; // s[1] is right of l\\n}\\nbool isIntersectLP(const L &l, const P &p) {return sig(cross(l[1]-p, l[0]-p))==0;}\\n\\n// verified by ACAC003 B\\n// http://judge.u-aizu.ac.jp/onlinejudge/creview.jsp?rid=899178&cid=ACAC003\\nbool isIntersectSS(const L &s, const L &t) {\\n\\treturn ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\\n\\t\\tccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\\n}\\nbool isIntersectSP(const L &s, const P &p) {\\n\\treturn sig(abs(s[0]-p)+abs(s[1]-p),abs(s[1]-s[0])) <=0; // triangle inequality\\n}\\nP crosspoint(const L &l, const L &m) {\\n\\tD A = cross(l.vec(), m.vec());\\n\\tD B = cross(l.vec(), l[1] - m[0]);\\n\\tif (sig(A)==0 && sig(B)==0) return m[0]; // same line\\n\\tif (sig(A)==0) assert(false); //交点を持たない．\\n\\treturn m[0] + B / A * m.vec();\\n}\\n\\nbool parallel(const L &l, const L &m) { return eq<P>(cross(l.vec(), m.vec()), 0); }\\nbool sameline(const L &l, const L &m) { return parallel(l, m) && eq<P>(cross(l.vec(), m[1]-l[0]), 0); }\\n\\n// オーバーラップした線分を1つにマージする．\\n// O(n^2)\\nvector<L> merge_segments(vector<L>& ss){\\n\\tREP(i,ss.size())if(ss[i][1]<ss[i][0])swap(ss[i][0],ss[i][1]);\\n\\tREP(i,ss.size())FOR(j,i+1,ss.size()){\\n\\t\\tif(sameline(ss[i],ss[j]) && !ccw(ss[i][0],ss[i][1],ss[j][0])){\\n\\t\\t\\tss[i] = L(min(ss[i][0],ss[j][0]), max(ss[i][1],ss[j][1]));\\n\\t\\t\\tss[j--]=ss.back();ss.pop_back();\\n\\t\\t}\\n\\t}\\n\\treturn ss;\\n}\\n\\n// 線分アレンジメント\\n// ps[i]=頂点iに対応するP\\n// O(n^2logn)\\n// 制約 : 線分のオーバーラップがない．\\nGraph segmentArrangement(vector<L> ss, vector<P> &ps) {\\n\\tvector<vector<D>> vs(ss.size());\\n\\tREP(i,ss.size()){vs[i].push_back(0);vs[i].push_back(abs(ss[i][1]-ss[i][0]));}\\n\\tREP(i,ss.size())REP(j,ps.size())if(isIntersectSP(ss[i], ps[j]))\\n\\t\\tvs[i].push_back(abs(ps[j]-ss[i][0]));\\n\\t\\n\\tREP(i,ss.size())FOR(j,i+1,ss.size()){\\n\\t\\tL& a=ss[i],b=ss[j];\\n\\t\\tif(isIntersectSS(a,b)){\\n\\t\\t\\tP p = crosspoint(a,b);\\n\\t\\t\\tvs[i].push_back(abs(p-a[0]));vs[j].push_back(abs(p-b[0]));\\t\\t\\t\\t\\n\\t\\t}\\n\\t}\\n\\tREP(i,vs.size()){sort(ALL(vs[i]));vs[i].erase(unique(ALL(vs[i]),eq<D>),vs[i].end());}\\n\\tREP(i,vs.size())REP(j,vs[i].size())ps.push_back(ss[i][0]+vs[i][j]*ss[i].vec()/abs(ss[i].vec()));\\n\\tsort(ALL(ps));UNIQUE(ps);\\n\\n\\tGraph g(ps.size());\\n\\tREP(i,vs.size()){\\n\\t\\tvector<D>& cut=vs[i];\\n\\t\\tREP(j,cut.size()-1){\\n\\t\\t\\tP a = ss[i][0] + vs[i][j]*ss[i].vec()/abs(ss[i].vec()),b = ss[i][0] + vs[i][j+1]*ss[i].vec()/abs(ss[i].vec());\\n\\t\\t\\tint f=distance(ps.begin(),lower_bound(ALL(ps),a)), t=distance(ps.begin(),lower_bound(ALL(ps),b));\\n\\t\\t\\tg[f].push_back(Edge(f,t,abs(a-b)));g[t].push_back(Edge(t,f,abs(a-b)));\\n\\t\\t}\\n\\t}\\n\\treturn g;\\n}\\n\\nstruct Task{\\n int prev,pos;Cost cost;\\n Task(int prev,int pos,Cost cost)\\n :prev(prev),pos(pos),cost(cost){};\\n bool operator>(const Task& r) const{ return cost > r.cost;}\\n};\\n\\n//verified by codoforces 144D http://codeforces.com/contest/144/submission/4976825\\n// // 負の辺がない\\n// // O(E*logV)\\nvector<Cost> dijkstra(const Graph& g,const int s,vector<int>& prev){\\n const int V=g.size();\\n vector<Cost> d(V,CINF);d[s]=0;\\n fill(ALL(prev), -2);\\n \\n priority_queue<Task,vector<Task>,greater<Task> > que;que.push(Task(-1,s,0));// [ ,e,,f, ] <=> e.cost < e.cost\\n vector<bool> visited(V);\\n while(!que.empty()){\\n Task task=que.top();que.pop();\\n if(visited[task.pos])continue;\\n visited[task.pos]=true;\\n prev[task.pos]=task.prev;\\n EACH(e,g[task.pos])if(d[e->to]>d[e->from]+e->cost){\\n d[e->to]=d[e->from]+e->cost;\\n que.push(Task(e->from,e->to,d[e->to]));\\n }\\n }\\n return d;\\n}\\nvector<Cost> dijkstra(const Graph& g,const int s){\\n vector<int> prev(g.size());return dijkstra(g,s,prev);\\n}\\n\\nint main(){\\n\\t// ifstream cin( \\\"in\\\" );\\n\\t// ofstream cout( \\\"out\\\" );\\n\\tcout << fixed <<setprecision(20);\\n\\tcerr << fixed <<setprecision(20);\\n\\tcin.tie(0); ios::sync_with_stdio(false);\\n\\n\\twhile(true){\\n\\t\\tint N;cin >> N;if(N==0)break;\\n\\t\\tvector<L> ls(N);REP(i,N) cin >> ls[i];\\n\\t\\tP p;cin >> p;\\n\\t\\tvector<P> ps;ps.push_back(p);\\n\\t\\tGraph g=segmentArrangement(ls,ps);\\n\\t\\t\\n\\t\\tint si=-1;REP(i,ps.size())if(p==ps[i])si=i;\\n\\t\\tvector<Cost> ds = dijkstra(g,si);\\n\\n\\t\\tD Mv=*max_element(ALL(ds));\\n\\t\\tREP(i,g.size())EACH(e,g[i]){\\n\\t\\t\\tD a=abs(ds[e->from]-ds[e->to]);\\n\\t\\t\\tD d=abs(ps[e->from]-ps[e->to]);\\n\\t\\t\\tMv=max(Mv,min(ds[e->from],ds[e->to])+(a+d)/2);\\n\\t\\t}\\n\\t\\tcout << Mv <<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1130,\n \"memory_kb\": 13256,\n \"score_of_the_acc\": -0.4292,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2062_1094764\",\n \"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 <utility>\\n#include <complex>\\n#include <numeric>\\n#include <functional>\\n#include <random>\\n#include <regex>\\nusing namespace std;\\ntypedef long long ll;\\n\\n#define ALL(c) (c).begin(),(c).end()\\n#define FOR(i,l,r) for(int i=(int)l;i<(int)r;++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORr(i,l,r) for(int i=(int)r-1;i>=(int)l;--i)\\n#define REPr(i,n) FORr(i,0,n)\\n#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\\n#define IN(l,v,r) ((l)<=(v) && (v)<(r))\\n#define UNIQUE(v) v.erase(unique(ALL(v)),v.end())\\n\\n// must template\\ntypedef long double D;\\nconst D INF = 1e20,EPS = 1e-10;\\n\\nint sig(D a,D b=0){return a<b-EPS?-1:a>b+EPS?1:0;}\\nbool eq(D a,D b){ return sig(abs(a-b))==0;}\\n// D norm(D a){ return a*a;}\\n\\ntypedef D Cost;Cost CINF=1e20;\\nstruct Edge{\\n\\tint from,to;Cost cost;\\n\\tEdge(int from,int to,Cost cost) : from(from),to(to),cost(cost) {};\\n\\tbool operator<(Edge r) const{return cost<r.cost;}\\n\\tbool operator>(Edge r) const{return cost>r.cost;}\\n};\\ntypedef vector<vector<Edge> > Graph;\\ntypedef complex<D> P;\\n#define X real()\\n#define Y imag()\\n\\nbool eq(const P& a,const P& b){ return sig(abs(a-b))==0;}\\nbool compX (const P& a,const P& b){return sig(a.X,b.X)!=0 ? a.X < b.X : a.Y < b.Y;}\\n\\nistream& operator >> (istream& is,P& p){D x,y;is >> x >> y;p=P(x,y);return is;}\\n\\nnamespace std{\\n\\tbool operator < (const P& a,const P& b){return compX(a,b);}\\n \\tbool operator == (const P& a,const P& b){return eq(a,b);}\\n};\\n\\n// a×b\\nD cross(const P& a,const P& b){return imag(conj(a)*b);}\\n// a・b\\nD dot(const P& a,const P& b) {return real(conj(a)*b);}\\n\\nint ccw(const P& a,P b,P c){\\n\\tb -= a; c -= a;\\n\\tif (sig(cross(b,c)) > 0) return +1; // counter clockwise\\n\\tif (sig(cross(b,c)) < 0) return -1; // clockwise\\n\\tif (sig(dot(b,c)) < 0) return +2; // c--a--b on line\\n\\tif (sig(norm(b),norm(c))<0) return -2; // a--b--c on line\\n\\treturn 0; //a--c--b on line or c==a or c==b\\n}\\n\\n//直線・線分\\nstruct L : public vector<P> {\\n\\tP vec() const {return this->at(1)-this->at(0);}\\n\\tL(const P &a, const P &b){push_back(a); push_back(b);}\\n\\tL(){push_back(P(0,0));push_back(P(0,0));}\\n};\\nistream& operator >> (istream& is,L& l){is >> l[0] >> l[1];return is;}\\n\\nbool isIntersectLL(const L &l, const L &m) {\\n \\treturn sig(cross(l.vec(), m.vec()))!=0 || // non-parallel\\n\\tsig(cross(l.vec(), m[0]-l[0])) == 0; // same line\\n}\\nbool isIntersectLS(const L &l, const L &s) {\\n\\treturn sig(cross(l.vec(), s[0]-l[0])* // s[0] is left of l\\n\\t\\tcross(l.vec(), s[1]-l[0]))<=0; // s[1] is right of l\\n}\\nbool isIntersectLP(const L &l, const P &p) {return sig(cross(l[1]-p, l[0]-p))==0;}\\n\\n// verified by ACAC003 B\\n// http://judge.u-aizu.ac.jp/onlinejudge/creview.jsp?rid=899178&cid=ACAC003\\nbool isIntersectSS(const L &s, const L &t) {\\n\\treturn ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\\n\\t\\tccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\\n}\\nbool isIntersectSP(const L &s, const P &p) {\\n\\treturn sig(abs(s[0]-p)+abs(s[1]-p),abs(s[1]-s[0])) <=0; // triangle inequality\\n}\\nP crosspoint(const L &l, const L &m) {\\n\\tD A = cross(l.vec(), m.vec());\\n\\tD B = cross(l.vec(), l[1] - m[0]);\\n\\tif (sig(A)==0 && sig(B)==0) return m[0]; // same line\\n\\tif (sig(A)==0) assert(false); //交点を持たない．\\n\\treturn m[0] + B / A * m.vec();\\n}\\n\\nbool parallel(const L &l, const L &m) { return eq(cross(l.vec(), m.vec()), 0); }\\nbool sameline(const L &l, const L &m) { return parallel(l, m) && eq(cross(l.vec(), m[1]-l[0]), 0); }\\n\\n// 線分アレンジメント\\n// ps[i]=頂点iに対応するP\\n// O(n^2logn)\\nGraph segmentArrangement(vector<L> ss, vector<P> &ps) {\\n\\t// merge\\n\\t// REP(i,ss.size())if(ss[i][1]<ss[i][0])swap(ss[i][0],ss[i][1]);\\n\\t// REP(i,ss.size())FOR(j,i+1,ss.size()){\\n\\t// \\tif(sameline(ss[i],ss[j]) && !ccw(ss[i][0],ss[i][1],ss[j][0])){\\n\\t// \\t\\tss[i] = L(min(ss[i][0],ss[j][0]), max(ss[i][1],ss[j][1]));\\n\\t// \\t\\t// swap(ss[j],ss.back());\\n\\t// \\t\\tss[j--] = ss.back();\\n\\t// \\t\\tss.pop_back();\\n\\t// \\t}\\n\\t// }\\n\\tvector<vector<D>> vs(ss.size());\\n\\tREP(i,ss.size()){\\n\\t\\tvs[i].push_back(0);vs[i].push_back(abs(ss[i][1]-ss[i][0]));\\n\\t\\tREP(j,ps.size())if (isIntersectSP(ss[i], ps[j]))\\n\\t\\t\\tvs[i].push_back(abs(ps[j]-ss[i][0]));\\n\\t}\\n\\tREP(i,ss.size())FOR(j,i+1,ss.size()){\\n\\t\\tL a=ss[i],b=ss[j];\\n\\t\\tif(isIntersectSS(a,b)){\\n\\t\\t\\tP p = crosspoint(a,b);\\n\\t\\t\\tvs[i].push_back(abs(p-ss[i][0]));vs[j].push_back(abs(p-ss[j][0]));\\t\\t\\t\\t\\n\\t\\t}\\n\\t}\\n\\tREP(i,vs.size()){sort(ALL(vs[i]));vs[i].erase(unique(ALL(vs[i]),[](D a,D b)->bool{return abs(a-b)<EPS;}),vs[i].end());}\\n\\tREP(i,vs.size())REP(j,vs[i].size())ps.push_back(ss[i][0]+vs[i][j]*ss[i].vec()/abs(ss[i].vec()));\\n\\tsort(ALL(ps));UNIQUE(ps);\\n\\t// ps.erase(unique(ALL(ps),[](const P& a,const P& b)->bool{return eq(a,b);}),ps.end());\\n\\t// cerr << ps.size()<<endl;\\n\\t// REP(i,ps.size())cerr << ps[i] <<endl;\\n\\t// cerr << endl;\\n\\tGraph g(ps.size());\\n\\tREP(i,vs.size()){\\n\\t\\tvector<D>& cut=vs[i];\\n\\t\\tREP(j,cut.size()-1){\\n\\t\\t\\tP a = ss[i][0] + vs[i][j]*ss[i].vec()/abs(ss[i].vec()),b = ss[i][0] + vs[i][j+1]*ss[i].vec()/abs(ss[i].vec());\\n\\t\\t\\tint f=distance(ps.begin(), lower_bound(ALL(ps),a,[](const P& a,const P& b)->bool{return !eq(a.X,b.X)?a.X<b.X:a.Y+EPS<b.Y;})),\\n\\t\\t\\t\\tt=distance(ps.begin(), lower_bound(ALL(ps),b,[](const P& a,const P& b)->bool{return !eq(a.X,b.X)?a.X<b.X:a.Y+EPS<b.Y;}));\\n\\t\\t\\t// cerr << f <<\\\" \\\" << t <<endl;\\n\\t\\t\\t// cerr << a <<\\\" \\\" << b <<endl;\\n\\t\\t\\t// cerr << compX(ps[9],b)<<endl;\\n\\t\\t\\t// cerr << compX(ps[10],b)<<endl;\\n\\n\\t\\t\\tg[f].push_back(Edge(f,t,abs(a-b)));\\n\\t\\t\\tg[t].push_back(Edge(t,f,abs(a-b)));\\n\\t\\t}\\n\\t}\\n\\treturn g;\\n}\\n\\nstruct Task{\\n int prev,pos;Cost cost;\\n Task(int prev,int pos,Cost cost)\\n :prev(prev),pos(pos),cost(cost){};\\n bool operator>(const Task& r) const{ return cost > r.cost;}\\n};\\n\\n//verified by codoforces 144D http://codeforces.com/contest/144/submission/4976825\\n// // 負の辺がない\\n// // O(E*logV)\\nvector<Cost> dijkstra(const Graph& g,const int s,vector<int>& prev){\\n const int V=g.size();\\n vector<Cost> d(V,CINF);d[s]=0;\\n fill(ALL(prev), -2);\\n \\n priority_queue<Task,vector<Task>,greater<Task> > que;que.push(Task(-1,s,0));// [ ,e,,f, ] <=> e.cost < e.cost\\n vector<bool> visited(V);\\n while(!que.empty()){\\n Task task=que.top();que.pop();\\n if(visited[task.pos])continue;\\n visited[task.pos]=true;\\n prev[task.pos]=task.prev;\\n EACH(e,g[task.pos])if(d[e->to]>d[e->from]+e->cost){\\n d[e->to]=d[e->from]+e->cost;\\n que.push(Task(e->from,e->to,d[e->to]));\\n }\\n }\\n return d;\\n}\\nvector<Cost> dijkstra(const Graph& g,const int s){\\n vector<int> prev(g.size());return dijkstra(g,s,prev);\\n}\\n\\nint main(){\\n\\t// ifstream cin( \\\"in\\\" );\\n\\t// ofstream cout( \\\"out\\\" );\\n\\tcout << fixed <<setprecision(20);\\n\\tcerr << fixed <<setprecision(20);\\n\\tcin.tie(0); ios::sync_with_stdio(false);\\n\\n\\twhile(true){\\n\\t\\tint N;cin >> N;if(N==0)break;\\n\\t\\tvector<L> ls(N);REP(i,N) cin >> ls[i];\\n\\t\\tP p;cin >> p;\\n\\t\\tvector<P> ps;ps.push_back(p);\\n\\t\\tGraph g=segmentArrangement(ls,ps);\\n\\t\\t\\n\\t\\tint si=-1;REP(i,ps.size())if(p==ps[i])si=i;\\n\\t\\tvector<Cost> ds = dijkstra(g,si);\\n\\n\\t\\t// cout << ps.size() <<endl;\\n\\t\\t// REP(i,ps.size())cout << ps[i]<<endl;\\n\\t\\t//check\\n\\t\\tD Mv=*max_element(ALL(ds));\\n\\t\\tREP(i,g.size())EACH(e,g[i]){\\n\\t\\t\\tif (eq(abs(ds[e->from] - ds[e->to]), abs(ps[e->from] - ps[e->to]))) continue;\\n \\n\\t\\t\\tD a=abs(ds[e->from]-ds[e->to]);\\n\\t\\t\\tD d=abs(ps[e->from]-ps[e->to]);\\n\\t\\t\\tMv=max(Mv,min(ds[e->from],ds[e->to])+(a+d)/2);\\n\\t\\t}\\n\\t\\tcout << Mv <<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1280,\n \"memory_kb\": 13784,\n \"score_of_the_acc\": -0.4795,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2062_1046786\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-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)\\n\\nusing namespace std;\\n\\nclass Point{\\npublic:\\n double x,y;\\n Point(double x = 0,double y = 0): x(x),y(y){}\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n bool operator == (const Segment& p)const { return ( p.p1 == p1 && p.p2 == p2 ) || ( p.p1 == p2 && p.p2 == p1 ); }\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\n\\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS)return CLOCKWISE;\\n if(dot(a,b) < -EPS)return ONLINE_BACK;\\n if(norm(a) < norm(b))return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n\\nbool intersectSS(Line s, Line t) {\\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\\n}\\nbool intersectSP(Line s, Point p) { return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; }\\n\\nPoint projection(Line l,Point p) {\\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\\n return l.p1 + (l.p1-l.p2)*t;\\n}\\n\\nPoint reflection(Line l,Point p) { return p + (projection(l, p) - p) * 2; }\\n\\nPoint crosspoint(Line l,Line m){\\n double A = cross(l.p2-l.p1,m.p2-m.p1);\\n double B = cross(l.p2-l.p1,l.p2-m.p1);\\n if(abs(A) < EPS && abs(B) < EPS){\\n vector<Point> vec;\\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\\n sort(vec.begin(),vec.end());\\n assert(vec[1] == vec[2]); //同じセグメントかもよ\\n return vec[1];\\n }\\n if(abs(A) < EPS)assert(false);\\n return m.p1 + (m.p2-m.p1)*(B/A);\\n}\\n\\nstruct Edge {\\n int from,to;\\n double cost;\\n Edge(int from=0,int to=0,double cost=0):from(from),to(to),cost(cost){}\\n bool operator < (const Edge& a)const { return !equals(cost,a.cost) && cost < a.cost; }\\n};\\n\\nPoint sp;\\n\\nvector<vector<Edge> > segmentArrangement(vector<Segment> &vs,vector<Point> &ps) {\\n ps.push_back(sp);\\n rep(i,vs.size()) ps.push_back( (vs[i].p1+vs[i].p2) / 2.0 );\\n rep(i,vs.size()) ps.push_back(vs[i].p1), ps.push_back(vs[i].p2);\\n rep(i,vs.size()) REP(j,i+1,vs.size()) if(intersectSS(vs[i],vs[j])) ps.push_back(Point(crosspoint(vs[i],vs[j])));\\n sort(ps.begin(),ps.end()); \\n ps.erase(unique(ps.begin(),ps.end()),ps.end());\\n\\n vector<vector<Edge> > ret(ps.size());\\n\\n for(int i=0;i<vs.size();i++){\\n vector<pair<double,int> > list;\\n rep(j,ps.size()) if(intersectSP(vs[i],ps[j]))list.push_back(pair<double,int>(norm(vs[i].p1-ps[j]),j));\\n sort(list.begin(),list.end());\\n for(int j=0;j+1<list.size();++j) {\\n int from = list[j].second, to = list[j+1].second;\\n double cost = abs(ps[from]-ps[to]);\\n ret[from].push_back(Edge(from,to,cost));\\n ret[to].push_back(Edge(to,from,cost));\\n }\\n } \\n return ret;\\n}\\n\\nint E;\\nvector<Segment> segs;\\n\\nbool LT(double a,double b) { return !equals(a,b) && a < b; }\\nbool LTE(double a,double b) { return equals(a,b) || a < b; }\\n\\n// --作成中-- \\n\\nPoint vir;\\nbool comp_dist(const Point &a,const Point &b){ return LT(abs(vir-a),abs(vir-b)); }\\n\\nconst int MAX_N = 2000;\\nint uf[MAX_N];\\nvoid init(int N=MAX_N) { rep(i,N) uf[i] = i; }\\nint find(int x) { \\n if( x == uf[x] ) return x;\\n return uf[x] = find(uf[x]);\\n}\\nvoid unit(int x,int y){\\n x = find(x), y = find(y);\\n if( x != y ) uf[x] = y; \\n}\\n\\nvoid segmentMerge(vector<Segment> &vec,vector<Segment> &ret){\\n init(vec.size());\\n rep(i,vec.size()) {\\n rep(j,vec.size()) {\\n if( equals(cross(vec[i].p1-vec[i].p2,vec[j].p1-vec[j].p2),0.0) && intersectSS(vec[i],vec[j]) ) unit(i,j);\\n }\\n }\\n\\n ret.clear();\\n vector<int> color;\\n rep(i,vec.size()) color.push_back(find(i));\\n sort(color.begin(),color.end());\\n color.erase(unique(color.begin(),color.end()),color.end());\\n rep(i,color.size()) {\\n vector<Point> vp;\\n rep(j,vec.size()) if( color[i] == find(j) ) vp.push_back(vec[j].p1), vp.push_back(vec[j].p2);\\n sort(vp.begin(),vp.end());\\n vp.erase(unique(vp.begin(),vp.end()),vp.end());\\n assert( vp.size() >= 2 ); // 線分じゃなくて点\\n vir = vp[0];\\n sort(vp.begin(),vp.end(),comp_dist);\\n ret.push_back(Segment(vp.front(),vp.back()));\\n }\\n}\\n\\n// --作成中--\\n\\nconst double DINF = 1e20;\\n\\nstruct Data {\\n int cur;\\n double weight;\\n bool operator < ( const Data &data ) const { return !equals(weight,data.weight) && weight > data.weight; }\\n};\\n\\nvoid dijkstra(vector<vector<Edge> > &G,vector<Point> &ps){\\n int sindex = -1;\\n rep(i,(int)ps.size()) if( ps[i] == sp ) { sindex = i; break; }\\n\\n int V = ps.size();\\n priority_queue<Data> Q;\\n Q.push((Data){sindex,0});\\n vector<double> mindist(V,DINF);\\n mindist[sindex] = 0;\\n while( !Q.empty() ){\\n Data data = Q.top(); Q.pop();\\n if( LT(mindist[data.cur],data.weight) ) continue;\\n rep(i,G[data.cur].size()){\\n int to = G[data.cur][i].to;\\n if( LT(data.weight+G[data.cur][i].cost,mindist[to]) ){\\n mindist[to] = data.weight+G[data.cur][i].cost;\\n Q.push((Data){to,mindist[to]});\\n }\\n }\\n }\\n\\n double maxi = 0;\\n rep(i,V) {\\n assert( !equals(DINF,mindist[i]) );\\n maxi = max(maxi,mindist[i]);\\n }\\n printf(\\\"%.10lf\\\\n\\\",maxi);\\n}\\n\\nvoid compute(){\\n vector<Segment> buf;\\n segmentMerge(segs,buf); \\n vector<Point> ps;\\n vector<vector<Edge> > G = segmentArrangement(buf,ps);\\n dijkstra(G,ps);\\n}\\n\\nint main(){\\n while( cin >> E, E ){\\n segs.resize(E);\\n rep(i,E) cin >> segs[i].p1.x >> segs[i].p1.y >> segs[i].p2.x >> segs[i].p2.y;\\n cin >> sp.x >> sp.y;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5170,\n \"memory_kb\": 5996,\n \"score_of_the_acc\": -0.999,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2062_1046785\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-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)\\n\\nusing namespace std;\\n\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = 0,double y = 0): x(x),y(y){}\\n\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n bool operator == (const Segment& p)const { return ( p.p1 == p1 && p.p2 == p2 ) || ( p.p1 == p2 && p.p2 == p1 ); }\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\ntypedef vector<Point> Polygon;\\n\\nostream& operator << (ostream& os,const Point& a){ os << \\\"(\\\" << a.x << \\\",\\\" << a.y << \\\")\\\"; }\\n\\nostream& operator << (ostream& os,const Segment& a){ os << \\\"( \\\" << a.p1 << \\\" , \\\" << a.p2 << \\\" )\\\"; }\\n\\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\\n\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\n\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\n\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\n//rad は角度をラジアンで持たせること\\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n\\n// 度をラジアンに変換\\ndouble toRad(double agl){ return agl*M_PI/180.0; }\\n\\n// a => prev, b => cur, c=> next\\n// prev から cur へ行って next へ行く際の角度を求める\\ndouble getArg(Point a,Point b,Point c){\\n double arg1 = atan2(b.y-a.y,b.x-a.x);\\n double arg2 = atan2(c.y-b.y,c.x-b.x);\\n double arg = fabs( arg1 - arg2 );\\n while( arg > M_PI ) arg -= 2.0 * M_PI;\\n return fabs(arg);\\n}\\n\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS)return CLOCKWISE;\\n if(dot(a,b) < -EPS)return ONLINE_BACK;\\n if(norm(a) < norm(b))return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n\\nbool intersectLL(Line l, Line m) {\\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\\n}\\nbool intersectLS(Line l, Line s) {\\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(Line l,Point p) {\\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\\n}\\nbool intersectSS(Line s, Line t) {\\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\\n}\\nbool intersectSP(Line s, Point p) {\\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\\n}\\n\\nPoint projection(Line l,Point p) {\\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\\n return l.p1 + (l.p1-l.p2)*t;\\n}\\nPoint reflection(Line l,Point p) {\\n return p + (projection(l, p) - p) * 2;\\n}\\ndouble distanceLP(Line l, Point p) {\\n return abs(p - projection(l, p));\\n}\\ndouble distanceLL(Line l, Line m) {\\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\\n}\\n\\ndouble distanceLS(Line l, Line s) {\\n if (intersectLS(l, s)) return 0;\\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\\n}\\ndouble distanceSP(Line s, Point p) {\\n Point r = projection(s, p);\\n if (intersectSP(s, r)) return abs(r - p);\\n return min(abs(s.p1 - p), abs(s.p2 - p));\\n}\\n\\ndouble distanceSS(Line s, Line t) {\\n if (intersectSS(s, t)) return 0;\\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\\n}\\n\\nPoint crosspoint(Line l,Line m){\\n double A = cross(l.p2-l.p1,m.p2-m.p1);\\n double B = cross(l.p2-l.p1,l.p2-m.p1);\\n if(abs(A) < EPS && abs(B) < EPS){\\n vector<Point> vec;\\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\\n sort(vec.begin(),vec.end());\\n assert(vec[1] == vec[2]); //同じセグメントかもよ\\n return vec[1];\\n //return m.p1;\\n }\\n if(abs(A) < EPS)assert(false);\\n return m.p1 + (m.p2-m.p1)*(B/A);\\n}\\n\\nstruct Edge {\\n int from,to;\\n double cost;\\n Edge(int from=0,int to=0,double cost=0):from(from),to(to),cost(cost){}\\n bool operator < (const Edge& a)const { return !equals(cost,a.cost) && cost < a.cost; }\\n};\\n\\nPoint sp;\\n\\nvector<vector<Edge> > segmentArrangement(vector<Segment> &vs,vector<Point> &ps) {\\n ps.push_back(sp);\\n\\n rep(i,vs.size()) ps.push_back( (vs[i].p1+vs[i].p2) / 2.0 );\\n\\n rep(i,vs.size()) ps.push_back(vs[i].p1), ps.push_back(vs[i].p2);\\n rep(i,vs.size()) REP(j,i+1,vs.size()) if(intersectSS(vs[i],vs[j])) ps.push_back(Point(crosspoint(vs[i],vs[j])));\\n\\n sort(ps.begin(),ps.end()); \\n ps.erase(unique(ps.begin(),ps.end()),ps.end());\\n\\n vector<vector<Edge> > ret(ps.size());\\n\\n for(int i=0;i<vs.size();i++){\\n vector<pair<double,int> > list;\\n rep(j,ps.size()) if(intersectSP(vs[i],ps[j]))list.push_back(pair<double,int>(norm(vs[i].p1-ps[j]),j));\\n sort(list.begin(),list.end());\\n for(int j=0;j+1<list.size();++j) {\\n int from = list[j].second, to = list[j+1].second;\\n double cost = abs(ps[from]-ps[to]);\\n ret[from].push_back(Edge(from,to,cost));\\n ret[to].push_back(Edge(to,from,cost));\\n }\\n } \\n return ret;\\n}\\n\\nint E;\\nvector<Segment> segs;\\n\\nbool LT(double a,double b) { return !equals(a,b) && a < b; }\\nbool LTE(double a,double b) { return equals(a,b) || a < b; }\\n\\n// --作成中-- \\n\\nPoint vir;\\nbool comp_dist(const Point &a,const Point &b){ return LT(abs(vir-a),abs(vir-b)); }\\n\\nconst int MAX_N = 2000;\\nint uf[MAX_N];\\nvoid init(int N=MAX_N) { rep(i,N) uf[i] = i; }\\nint find(int x) { \\n if( x == uf[x] ) return x;\\n return uf[x] = find(uf[x]);\\n}\\nvoid unit(int x,int y){\\n x = find(x), y = find(y);\\n if( x != y ) uf[x] = y; \\n}\\n\\nvoid segmentMerge(vector<Segment> &vec,vector<Segment> &ret){\\n init(vec.size());\\n rep(i,vec.size()) {\\n rep(j,vec.size()) {\\n if( equals(cross(vec[i].p1-vec[i].p2,vec[j].p1-vec[j].p2),0.0) && intersectSS(vec[i],vec[j]) ) unit(i,j);\\n }\\n }\\n\\n ret.clear();\\n vector<int> color;\\n rep(i,vec.size()) color.push_back(find(i));\\n sort(color.begin(),color.end());\\n color.erase(unique(color.begin(),color.end()),color.end());\\n rep(i,color.size()) {\\n vector<Point> vp;\\n rep(j,vec.size()) if( color[i] == find(j) ) vp.push_back(vec[j].p1), vp.push_back(vec[j].p2);\\n sort(vp.begin(),vp.end());\\n vp.erase(unique(vp.begin(),vp.end()),vp.end());\\n assert( vp.size() >= 2 ); // 線分じゃなくて点\\n vir = vp[0];\\n sort(vp.begin(),vp.end(),comp_dist);\\n ret.push_back(Segment(vp.front(),vp.back()));\\n }\\n}\\n\\n// --作成中--\\n\\nconst double DINF = 1e20;\\n\\nstruct Data {\\n int cur;\\n double weight;\\n bool operator < ( const Data &data ) const { return !equals(weight,data.weight) && weight > data.weight; }\\n};\\n\\nvoid dijkstra(vector<vector<Edge> > &G,vector<Point> &ps){\\n int sindex = -1;\\n rep(i,(int)ps.size()) if( ps[i] == sp ) { sindex = i; break; }\\n assert( sindex != -1 );\\n\\n int V = ps.size();\\n priority_queue<Data> Q;\\n Q.push((Data){sindex,0});\\n vector<double> mindist(V,DINF);\\n mindist[sindex] = 0;\\n while( !Q.empty() ){\\n Data data = Q.top(); Q.pop();\\n \\n if( LT(mindist[data.cur],data.weight) ) continue;\\n\\n rep(i,G[data.cur].size()){\\n int to = G[data.cur][i].to;\\n if( LT(data.weight+G[data.cur][i].cost,mindist[to]) ){\\n mindist[to] = data.weight+G[data.cur][i].cost;\\n Q.push((Data){to,mindist[to]});\\n }\\n }\\n\\n }\\n\\n double maxi = 0;\\n rep(i,V) {\\n assert( !equals(DINF,mindist[i]) );\\n maxi = max(maxi,mindist[i]);\\n }\\n\\n printf(\\\"%.10lf\\\\n\\\",maxi);\\n\\n}\\n\\nvoid compute(){\\n vector<Segment> buf = segs;\\n //segmentMerge(segs,buf); \\n\\n vector<Point> ps;\\n vector<vector<Edge> > G = segmentArrangement(buf,ps);\\n\\n dijkstra(G,ps);\\n\\n}\\n\\nint main(){\\n while( cin >> E, E ){\\n segs.resize(E);\\n rep(i,E) cin >> segs[i].p1.x >> segs[i].p1.y >> segs[i].p2.x >> segs[i].p2.y;\\n cin >> sp.x >> sp.y;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5130,\n \"memory_kb\": 5968,\n \"score_of_the_acc\": -0.9897,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2062_1046783\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-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)\\n\\nusing namespace std;\\n\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = 0,double y = 0): x(x),y(y){}\\n\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n bool operator == (const Segment& p)const { return ( p.p1 == p1 && p.p2 == p2 ) || ( p.p1 == p2 && p.p2 == p1 ); }\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\ntypedef vector<Point> Polygon;\\n\\nostream& operator << (ostream& os,const Point& a){ os << \\\"(\\\" << a.x << \\\",\\\" << a.y << \\\")\\\"; }\\n\\nostream& operator << (ostream& os,const Segment& a){ os << \\\"( \\\" << a.p1 << \\\" , \\\" << a.p2 << \\\" )\\\"; }\\n\\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\\n\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\n\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\n\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\n//rad は角度をラジアンで持たせること\\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n\\n// 度をラジアンに変換\\ndouble toRad(double agl){ return agl*M_PI/180.0; }\\n\\n// a => prev, b => cur, c=> next\\n// prev から cur へ行って next へ行く際の角度を求める\\ndouble getArg(Point a,Point b,Point c){\\n double arg1 = atan2(b.y-a.y,b.x-a.x);\\n double arg2 = atan2(c.y-b.y,c.x-b.x);\\n double arg = fabs( arg1 - arg2 );\\n while( arg > M_PI ) arg -= 2.0 * M_PI;\\n return fabs(arg);\\n}\\n\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS)return CLOCKWISE;\\n if(dot(a,b) < -EPS)return ONLINE_BACK;\\n if(norm(a) < norm(b))return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n\\nbool intersectLL(Line l, Line m) {\\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\\n}\\nbool intersectLS(Line l, Line s) {\\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(Line l,Point p) {\\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\\n}\\nbool intersectSS(Line s, Line t) {\\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\\n}\\nbool intersectSP(Line s, Point p) {\\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\\n}\\n\\nPoint projection(Line l,Point p) {\\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\\n return l.p1 + (l.p1-l.p2)*t;\\n}\\nPoint reflection(Line l,Point p) {\\n return p + (projection(l, p) - p) * 2;\\n}\\ndouble distanceLP(Line l, Point p) {\\n return abs(p - projection(l, p));\\n}\\ndouble distanceLL(Line l, Line m) {\\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\\n}\\n\\ndouble distanceLS(Line l, Line s) {\\n if (intersectLS(l, s)) return 0;\\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\\n}\\ndouble distanceSP(Line s, Point p) {\\n Point r = projection(s, p);\\n if (intersectSP(s, r)) return abs(r - p);\\n return min(abs(s.p1 - p), abs(s.p2 - p));\\n}\\n\\ndouble distanceSS(Line s, Line t) {\\n if (intersectSS(s, t)) return 0;\\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\\n}\\n\\nPoint crosspoint(Line l,Line m){\\n double A = cross(l.p2-l.p1,m.p2-m.p1);\\n double B = cross(l.p2-l.p1,l.p2-m.p1);\\n if(abs(A) < EPS && abs(B) < EPS){\\n vector<Point> vec;\\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\\n sort(vec.begin(),vec.end());\\n assert(vec[1] == vec[2]); //同じセグメントかもよ\\n return vec[1];\\n //return m.p1;\\n }\\n if(abs(A) < EPS)assert(false);\\n return m.p1 + (m.p2-m.p1)*(B/A);\\n}\\n\\nstruct Edge {\\n int from,to;\\n double cost;\\n Edge(int from=0,int to=0,double cost=0):from(from),to(to),cost(cost){}\\n bool operator < (const Edge& a)const { return !equals(cost,a.cost) && cost < a.cost; }\\n};\\n\\nPoint sp;\\n\\nvector<vector<Edge> > segmentArrangement(vector<Segment> &vs,vector<Point> &ps) {\\n ps.push_back(sp);\\n\\n rep(i,vs.size()) ps.push_back( (vs[i].p1+vs[i].p2) / 2.0 );\\n\\n rep(i,vs.size()) ps.push_back(vs[i].p1), ps.push_back(vs[i].p2);\\n rep(i,vs.size()) REP(j,i+1,vs.size()) if(intersectSS(vs[i],vs[j])) ps.push_back(Point(crosspoint(vs[i],vs[j])));\\n\\n sort(ps.begin(),ps.end()); \\n ps.erase(unique(ps.begin(),ps.end()),ps.end());\\n\\n vector<vector<Edge> > ret(ps.size());\\n\\n for(int i=0;i<vs.size();i++){\\n vector<pair<double,int> > list;\\n rep(j,ps.size()) if(intersectSP(vs[i],ps[j]))list.push_back(pair<double,int>(norm(vs[i].p1-ps[j]),j));\\n sort(list.begin(),list.end());\\n for(int j=0;j+1<list.size();++j) {\\n int from = list[j].second, to = list[j+1].second;\\n double cost = abs(ps[from]-ps[to]);\\n ret[from].push_back(Edge(from,to,cost));\\n ret[to].push_back(Edge(to,from,cost));\\n }\\n } \\n return ret;\\n}\\n\\nint E;\\nvector<Segment> segs;\\n\\nbool LT(double a,double b) { return !equals(a,b) && a < b; }\\nbool LTE(double a,double b) { return equals(a,b) || a < b; }\\n\\n// --作成中-- \\n\\nPoint vir;\\nbool comp_dist(const Point &a,const Point &b){ return LT(abs(vir-a),abs(vir-b)); }\\n\\nconst int MAX_N = 2000;\\nint uf[MAX_N];\\nvoid init(int N=MAX_N) { rep(i,N) uf[i] = i; }\\nint find(int x) { \\n if( x == uf[x] ) return x;\\n return uf[x] = find(uf[x]);\\n}\\nvoid unit(int x,int y){\\n x = find(x), y = find(y);\\n if( x != y ) uf[x] = y; \\n}\\n\\nvoid segmentMerge(vector<Segment> &vec,vector<Segment> &ret){\\n init(vec.size());\\n rep(i,vec.size()) {\\n rep(j,vec.size()) {\\n if( equals(cross(vec[i].p1-vec[i].p2,vec[j].p1-vec[j].p2),0.0) && intersectSS(vec[i],vec[j]) ) unit(i,j);\\n }\\n }\\n\\n ret.clear();\\n vector<int> color;\\n rep(i,vec.size()) color.push_back(find(i));\\n sort(color.begin(),color.end());\\n color.erase(unique(color.begin(),color.end()),color.end());\\n rep(i,color.size()) {\\n vector<Point> vp;\\n rep(j,vec.size()) if( color[i] == find(j) ) vp.push_back(vec[j].p1), vp.push_back(vec[j].p2);\\n sort(vp.begin(),vp.end());\\n vp.erase(unique(vp.begin(),vp.end()),vp.end());\\n assert( vp.size() >= 2 ); // 線分じゃなくて点\\n vir = vp[0];\\n sort(vp.begin(),vp.end(),comp_dist);\\n ret.push_back(Segment(vp.front(),vp.back()));\\n }\\n}\\n\\n// --作成中--\\n\\nconst double DINF = 1e20;\\n\\nstruct Data {\\n int cur;\\n double weight;\\n bool operator < ( const Data &data ) const { return !equals(weight,data.weight) && weight > data.weight; }\\n};\\n\\nvoid dijkstra(vector<vector<Edge> > &G,vector<Point> &ps){\\n int sindex = -1;\\n rep(i,(int)ps.size()) if( ps[i] == sp ) { sindex = i; break; }\\n assert( sindex != -1 );\\n\\n int V = ps.size();\\n priority_queue<Data> Q;\\n Q.push((Data){sindex,0});\\n vector<double> mindist(V,DINF);\\n mindist[sindex] = 0;\\n while( !Q.empty() ){\\n Data data = Q.top(); Q.pop();\\n \\n if( LT(mindist[data.cur],data.weight) ) continue;\\n\\n rep(i,G[data.cur].size()){\\n int to = G[data.cur][i].to;\\n if( LT(data.weight+G[data.cur][i].cost,mindist[to]) ){\\n mindist[to] = data.weight+G[data.cur][i].cost;\\n Q.push((Data){to,mindist[to]});\\n }\\n }\\n\\n }\\n\\n double maxi = 0;\\n rep(i,V) {\\n assert( !equals(DINF,mindist[i]) );\\n maxi = max(maxi,mindist[i]);\\n }\\n\\n printf(\\\"%.10lf\\\\n\\\",maxi);\\n\\n}\\n\\nvoid compute(){\\n vector<Segment> buf;\\n segmentMerge(segs,buf); \\n\\n //rep(i,buf.size()) cout << i << \\\"-th : \\\" << buf[i] << endl;\\n\\n vector<Point> ps;\\n vector<vector<Edge> > G = segmentArrangement(buf,ps);\\n\\n dijkstra(G,ps);\\n\\n}\\n\\nint main(){\\n while( cin >> E, E ){\\n segs.resize(E);\\n rep(i,E) cin >> segs[i].p1.x >> segs[i].p1.y >> segs[i].p2.x >> segs[i].p2.y;\\n cin >> sp.x >> sp.y;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5180,\n \"memory_kb\": 6000,\n \"score_of_the_acc\": -1.0012,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2062_713277\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <cstring>\\n#include <cstdlib>\\n#include <string>\\n#include <cmath>\\n#include <cassert>\\n#include <queue>\\n#include <set>\\n#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)\\n// #define double long double\\nconst int INF = 1<<29;\\nconst double EPS = 1e-8;\\nconst double PI = acos(-1);\\ntypedef pair<int,int> pii;\\ntypedef long long ll;\\n\\ntypedef double 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};\\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}\\n\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\n\\n// 道程がいらない場合\\nvector<Weight> dijkstra(const Graph &g, int s) {\\n vector<Weight> dist(g.size(), INF);\\n dist[s] = 0;\\n priority_queue<Edge> Q; // \\\"e < f\\\" <=> \\\"e.weight > f.weight\\\"\\n for (Q.push(Edge(-2, s, 0)); !Q.empty(); ) {\\n Edge e = Q.top(); Q.pop();\\n if (dist[e.dst] < e.weight) continue;\\n FOR(f,g[e.dst]) {\\n if (dist[f->dst] > e.weight+f->weight) {\\n dist[f->dst] = e.weight+f->weight;\\n Q.push(Edge(f->src, f->dst, e.weight+f->weight));\\n }\\n }\\n }\\n return dist;\\n}\\n\\n\\ntypedef complex<double> P;\\nnamespace std {\\n bool operator < (const P& a, const P& b) {\\n if (abs(a-b)<EPS) return 0;\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n }\\n}\\ndouble cross(const P& a, const P& b) {\\n return imag(conj(a)*b);\\n}\\ndouble dot(const P& a, const P& b) {\\n return real(conj(a)*b);\\n}\\nstruct L : public vector<P> {\\n L(const P &a, const P &b) {\\n push_back(a); push_back(b);\\n }\\n L() {resize(2);}\\n};\\nostream &operator<<(ostream &os, const L &a) {\\n os << a[0] << \\\" -> \\\" << a[1];\\n return os;\\n}\\n\\ntypedef vector<P> G;\\n#define curr(P, i) P[i]\\n#define next(P, i) P[(i+1)%P.size()]\\nstruct C {\\n P p; double r;\\n C(const P &p, double r) : p(p), r(r) { }\\n};\\n\\nint ccw(P a, P b, P c) {\\n b -= a; c -= a;\\n if (cross(b, c) > 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\\n return 0;\\n}\\n\\nP rotate(const P &p, double ang) {\\n return p * P(cos(ang), sin(ang));\\n}\\n\\nP projection(const L &l, const P &p) {\\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\\n return l[0] + t*(l[0]-l[1]);\\n}\\nP reflection(const L &l, const P &p) {\\n return p + P(2,0) * (projection(l, p) - p);\\n}\\n\\ndouble distanceLP(const L &l, const P &p) {\\n return abs(p - projection(l, p));\\n}\\n\\nbool intersectSP(const L &s, const P &p) {\\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\\n}\\nbool intersectLL(const L &l, const L &m) {\\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel\\n abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line\\n}\\nbool intersectLS(const L &l, const L &s) {\\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(const L &l, const P &p) {\\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\\n}\\nbool intersectSS(const L &s, const L &t) {\\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\\n}\\nbool intersectSS2(const L &s, const L &t) {\\n if (intersectSP(s,t[0]) || intersectSP(s,t[1]) ||\\n intersectSP(t,s[0]) || intersectSP(t,s[1])) return 0;\\n return intersectSS(s,t);\\n}\\nbool intersectHS(const L &h, const L &s) {\\n if (intersectLP(h,s[0]) || intersectLP(h,s[1]) ||\\n intersectLP(s,h[0]) || intersectLP(s,h[1])) return 0;\\n if (intersectSS(h,s)) return 1;\\n if (!intersectLS(h,s)) return 0;\\n return (ccw(s[0],s[1],h[0]) == 1) ^ (cross(s[1]-s[0], h[1]-h[0]) > 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) {\\n // sameline\\n if (intersectSP(l,m[0]) && intersectSP(l,m[1])) return P(0.5)*(m[0]+m[1]);\\n if (intersectSP(m,l[0]) && intersectSP(m,l[1])) return P(0.5)*(l[0]+l[1]);\\n REP(i,2) REP(j,2)\\n if (intersectSP(l,m[i]) && intersectSP(m,l[j])) return P(0.5)*(m[i]+l[j]);\\n }\\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n return m[0] + B / A * (m[1] - m[0]);\\n}\\n\\nbool EQ(double a, double b) {\\n return abs(a-b) < EPS;\\n}\\nbool EQP(const P &a, const P &b) {\\n return norm(a-b) < EPS*EPS;\\n}\\n\\n#define index_of(ps, p) \\\\\\n distance(ps.begin(), lower_bound(ps.begin(), ps.end(), p))\\nGraph arrangement(const vector<L>& segs, vector<P>& pt) {\\n vector< vector<double> > V(segs.size());\\n for (int i = 0; i < segs.size(); ++i) {\\n pt.push_back( segs[i][0] );\\n pt.push_back( segs[i][1] );\\n V[i].push_back(0);\\n V[i].push_back(1);\\n for (int j = i+1; j < segs.size(); ++j) {\\n L a = segs[i], b = segs[j];\\n if (intersectSS(a, b)) {\\n double D = cross(b[1]-b[0], a[1]-a[0]);\\n if (abs(D) < EPS) continue;\\n double t = cross(b[1]-b[0], b[0]-a[0]) / D;\\n double s = cross(a[0]-b[0], a[1]-a[0]) / D;\\n V[i].push_back(t);\\n V[j].push_back(s);\\n pt.push_back( a[0]+(a[1]-a[0])*t );\\n }\\n }\\n }\\n sort(pt.begin(), pt.end());\\n pt.erase(unique(pt.begin(), pt.end(), EQP), pt.end());\\n\\n Graph g(pt.size());\\n for (int i = 0; i < V.size(); ++i) {\\n vector<double>& cut = V[i];\\n sort(cut.begin(), cut.end());\\n cut.erase(unique(cut.begin(), cut.end(), EQ), cut.end());\\n for (int j = 0; j+1 < cut.size(); ++j) {\\n P a = segs[i][0] + (segs[i][1] - segs[i][0]) * cut[j];\\n P b = segs[i][0] + (segs[i][1] - segs[i][0]) * cut[j+1];\\n int src = index_of(pt, a), dst = index_of(pt, b);\\n // cout << g.size() << \\\" \\\" << src << \\\" \\\" << dst << \\\" \\\" << abs(a-b) << endl;\\n g[src].push_back( Edge(src, dst, abs(a-b)) );\\n g[dst].push_back( Edge(dst, src, abs(a-b)) );\\n }\\n }\\n return g;\\n}\\n\\nGraph segmentArrangement(const vector<L> &ss, vector<P> &ps) {\\n int n = ss.size();\\n REP(i,n) {\\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 if (intersectSS(ss[i], ss[j]))\\n ps.push_back( crosspoint(ss[i], ss[j]) );\\n }\\n sort(ALL(ps)); ps.erase(unique(ALL(ps)), ps.end());\\n\\n Graph g(ps.size());\\n for (int i = 0; i < ss.size(); ++i) {\\n int pre = -1;\\n for (int j = 0; j < ps.size(); ++j)\\n if (intersectSP(ss[i], ps[j])) {\\n if (pre != -1) {\\n double d = abs(ps[pre]-ps[j]);\\n g[pre].push_back(Edge(pre,j,d));\\n g[j].push_back(Edge(j,pre,d));\\n }\\n pre = j;\\n }\\n }\\n return g;\\n}\\n\\nvector<Edge> graph[300000];\\nint pid[1004][1004];\\n\\nGraph segmentArrangement2(const vector<L> &ss, vector<P> &ps) {\\n memset(pid,-1,sizeof(pid));\\n REP(i,300000) graph[i].clear();\\n int n = ss.size();\\n REP(i,n) {\\n int beg = ps.size();\\n ps.push_back(ss[i][0]);\\n ps.push_back(ss[i][1]);\\n REP(j,n) {\\n if (i == j) continue;\\n if (intersectSS(ss[i],ss[j])) {\\n int b = ps.size();\\n if (i>j) {\\n int a = pid[j][i];\\n // cout << ps[a] << \\\" \\\"<< crosspoint(ss[i],ss[j]) << endl;\\n graph[a].push_back(Edge(a,b,0));\\n graph[b].push_back(Edge(b,a,0));\\n } else {\\n pid[i][j] = b;\\n }\\n ps.push_back(crosspoint(ss[i],ss[j]));\\n }\\n }\\n vector<pair<P,int> > v(ps.size()-beg);\\n for (int i=beg; i<ps.size(); ++i)\\n v[i-beg] = make_pair(ps[i],i);\\n sort(ALL(v));\\n REP(i,v.size()-1) {\\n int a = v[i].second, b = v[i+1].second;\\n double c = abs(v[i].first-v[i+1].first);\\n graph[a].push_back(Edge(a,b,c));\\n graph[b].push_back(Edge(b,a,c));\\n }\\n }\\n Graph g(ps.size());\\n REP(i,ps.size()) {\\n g[i] = graph[i];\\n }\\n return g;\\n}\\n\\n\\nint main() {\\n int n;\\n while(cin >> n, n) {\\n vector<L> segs;\\n REP(i,n) {\\n P a, b;\\n cin >> a.real() >> a.imag();\\n cin >> b.real() >> b.imag();\\n segs.push_back(L(a,b));\\n }\\n P s;\\n cin >> s.real() >> s.imag();\\n REP(i,n) {\\n if (intersectSP(segs[i],s)) {\\n segs.push_back(L(segs[i][0],s));\\n segs.push_back(L(s,segs[i][1]));\\n break;\\n }\\n }\\n vector<P> pv;\\n // Graph g = arrangement(segs,pv);\\n Graph g = segmentArrangement2(segs,pv);\\n int sid = -1;\\n REP(i,pv.size()) {\\n if (abs(pv[i]-s) < EPS) sid = i;\\n }\\n assert(sid != -1);\\n // REP(i,g.size()) {\\n // cout << i << endl;\\n // FOR(it, g[i]) {\\n // cout << it->dst << \\\" \\\" << it->weight << endl;\\n // }\\n // }\\n // cout << sid << endl;\\n vector<double> dis = dijkstra(g,sid);\\n double ans = 0;\\n REP(i,g.size()) {\\n FOR(it, g[i]) {\\n int a = it->src;\\n int b = it->dst;\\n double x = (dis[b]-dis[a]+it->weight) / 2;\\n chmax(ans, dis[a] + x);\\n }\\n }\\n cout << setprecision(10) << fixed << ans << endl;\\n // printf(\\\"%.10Lf\\\\n\\\", ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 25688,\n \"score_of_the_acc\": -0.7942,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2062_666097\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <cstring>\\n#include <cstdlib>\\n#include <string>\\n#include <cmath>\\n#include <cassert>\\n#include <queue>\\n#include <set>\\n#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)\\n#define double long double\\nconst int INF = 1<<29;\\nconst double EPS = 1e-8;\\nconst double PI = acos(-1);\\ntypedef pair<int,int> pii;\\ntypedef long long ll;\\n\\ntypedef double 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};\\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}\\n\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\n\\n// テゥツ?禿ァツィツ凝」ツ?古」ツ??」ツつ嘉」ツ?ェテ」ツ??・ツ?エテ・ツ青?\\nvector<Weight> dijkstra(const Graph &g, int s) {\\n vector<Weight> dist(g.size(), INF);\\n dist[s] = 0;\\n priority_queue<Edge> Q; // \\\"e < f\\\" <=> \\\"e.weight > f.weight\\\"\\n for (Q.push(Edge(-2, s, 0)); !Q.empty(); ) {\\n Edge e = Q.top(); Q.pop();\\n if (dist[e.dst] < e.weight) continue;\\n FOR(f,g[e.dst]) {\\n if (dist[f->dst] > e.weight+f->weight) {\\n dist[f->dst] = e.weight+f->weight;\\n Q.push(Edge(f->src, f->dst, e.weight+f->weight));\\n }\\n }\\n }\\n return dist;\\n}\\n\\n\\ntypedef complex<double> P;\\nnamespace std {\\n bool operator < (const P& a, const P& b) {\\n if (abs(a-b)<EPS) return 0;\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n }\\n}\\ndouble cross(const P& a, const P& b) {\\n return imag(conj(a)*b);\\n}\\ndouble dot(const P& a, const P& b) {\\n return real(conj(a)*b);\\n}\\nstruct L : public vector<P> {\\n L(const P &a, const P &b) {\\n push_back(a); push_back(b);\\n }\\n L() {resize(2);}\\n};\\nostream &operator<<(ostream &os, const L &a) {\\n os << a[0] << \\\" -> \\\" << a[1];\\n return os;\\n}\\n\\ntypedef vector<P> G;\\n#define curr(P, i) P[i]\\n#define next(P, i) P[(i+1)%P.size()]\\nstruct C {\\n P p; double r;\\n C(const P &p, double r) : p(p), r(r) { }\\n};\\n\\nint ccw(P a, P b, P c) {\\n b -= a; c -= a;\\n if (cross(b, c) > 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\\n return 0;\\n}\\n\\nP rotate(const P &p, double ang) {\\n return p * P(cos(ang), sin(ang));\\n}\\n\\nP projection(const L &l, const P &p) {\\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\\n return l[0] + t*(l[0]-l[1]);\\n}\\nP reflection(const L &l, const P &p) {\\n return p + P(2,0) * (projection(l, p) - p);\\n}\\n\\ndouble distanceLP(const L &l, const P &p) {\\n return abs(p - projection(l, p));\\n}\\n\\nbool intersectSP(const L &s, const P &p) {\\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\\n}\\nbool intersectLL(const L &l, const L &m) {\\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel\\n abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line\\n}\\nbool intersectLS(const L &l, const L &s) {\\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(const L &l, const P &p) {\\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\\n}\\nbool intersectSS(const L &s, const L &t) {\\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\\n}\\nbool intersectSS2(const L &s, const L &t) {\\n if (intersectSP(s,t[0]) || intersectSP(s,t[1]) ||\\n intersectSP(t,s[0]) || intersectSP(t,s[1])) return 0;\\n return intersectSS(s,t);\\n}\\nbool intersectHS(const L &h, const L &s) {\\n if (intersectLP(h,s[0]) || intersectLP(h,s[1]) ||\\n intersectLP(s,h[0]) || intersectLP(s,h[1])) return 0;\\n if (intersectSS(h,s)) return 1;\\n if (!intersectLS(h,s)) return 0;\\n return (ccw(s[0],s[1],h[0]) == 1) ^ (cross(s[1]-s[0], h[1]-h[0]) > 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]; // same line\\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n return m[0] + B / A * (m[1] - m[0]);\\n}\\n\\nbool EQ(double a, double b) {\\n return abs(a-b) < EPS;\\n}\\nbool EQP(const P &a, const P &b) {\\n return norm(a-b) < EPS*EPS;\\n}\\n\\n#define index_of(ps, p) \\\\\\n distance(ps.begin(), lower_bound(ps.begin(), ps.end(), p))\\nGraph arrangement(const vector<L>& segs, vector<P>& pt) {\\n vector< vector<double> > V(segs.size());\\n for (int i = 0; i < segs.size(); ++i) {\\n pt.push_back( segs[i][0] );\\n pt.push_back( segs[i][1] );\\n V[i].push_back(0);\\n V[i].push_back(1);\\n for (int j = i+1; j < segs.size(); ++j) {\\n L a = segs[i], b = segs[j];\\n if (intersectSS(a, b)) {\\n double D = cross(b[1]-b[0], a[1]-a[0]);\\n if (abs(D) < EPS) continue;\\n double t = cross(b[1]-b[0], b[0]-a[0]) / D;\\n double s = cross(a[0]-b[0], a[1]-a[0]) / D;\\n V[i].push_back(t);\\n V[j].push_back(s);\\n pt.push_back( a[0]+(a[1]-a[0])*t );\\n }\\n }\\n }\\n sort(pt.begin(), pt.end());\\n pt.erase(unique(pt.begin(), pt.end(), EQP), pt.end());\\n\\n Graph g(pt.size());\\n for (int i = 0; i < V.size(); ++i) {\\n vector<double>& cut = V[i];\\n sort(cut.begin(), cut.end());\\n cut.erase(unique(cut.begin(), cut.end(), EQ), cut.end());\\n for (int j = 0; j+1 < cut.size(); ++j) {\\n P a = segs[i][0] + (segs[i][1] - segs[i][0]) * cut[j];\\n P b = segs[i][0] + (segs[i][1] - segs[i][0]) * cut[j+1];\\n int src = index_of(pt, a), dst = index_of(pt, b);\\n // cout << g.size() << \\\" \\\" << src << \\\" \\\" << dst << \\\" \\\" << abs(a-b) << endl;\\n g[src].push_back( Edge(src, dst, abs(a-b)) );\\n g[dst].push_back( Edge(dst, src, abs(a-b)) );\\n }\\n }\\n return g;\\n}\\n\\nint main() {\\n int n;\\n while(cin >> n, n) {\\n vector<L> segs;\\n REP(i,n) {\\n P a, b;\\n cin >> a.real() >> a.imag();\\n cin >> b.real() >> b.imag();\\n segs.push_back(L(a,b));\\n }\\n P s;\\n cin >> s.real() >> s.imag();\\n REP(i,n) {\\n if (intersectSP(segs[i],s)) {\\n segs.push_back(L(segs[i][0],s));\\n segs.push_back(L(s,segs[i][1]));\\n }\\n }\\n vector<P> pv;\\n Graph g = arrangement(segs,pv);\\n int sid = -1;\\n REP(i,pv.size()) {\\n if (abs(pv[i]-s) < EPS) sid = i;\\n }\\n assert(sid != -1);\\n // REP(i,g.size()) {\\n // cout << i << endl;\\n // FOR(it, g[i]) {\\n // cout << it->dst << \\\" \\\" << it->weight << endl;\\n // }\\n // }\\n // cout << sid << endl;\\n vector<double> dis = dijkstra(g,sid);\\n double ans = 0;\\n REP(i,g.size()) {\\n FOR(it, g[i]) {\\n int a = it->src;\\n int b = it->dst;\\n double x = (dis[b]-dis[a]+it->weight) / 2;\\n chmax(ans, dis[a] + x);\\n }\\n }\\n cout << setprecision(10) << fixed << ans << endl;\\n // printf(\\\"%.10Lf\\\\n\\\", ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2000,\n \"memory_kb\": 11556,\n \"score_of_the_acc\": -0.5469,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2062_249871\",\n \"code_snippet\": \"#include<iostream>\\n#include<stdio.h>\\n#include<complex>\\n#include<cfloat>\\n#include<cassert>\\n#include<cmath>\\n#include<vector>\\n#include<queue>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\n\\n\\n#define EPS (1e-8)\\n#define equals(a, b) (abs((a) - (b)) < EPS )\\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 ){\\n\\treturn Point(x + p.x, y + p.y);\\n }\\n\\n Point operator - ( Point p ){\\n\\treturn Point(x - p.x, y - p.y);\\n }\\n\\n Point operator * ( double a ){\\n\\treturn Point(a*x, a*y);\\n }\\n\\n double absolute() { 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 abs(x-p.x) < EPS && abs(y-p.y) < EPS;\\n }\\n};\\n\\ntypedef Point Vector;\\n\\nclass Segment{\\n public:\\n Point source, target;\\n Segment(Point s = Point(), Point t = Point()): source(s), target(t){}\\n};\\n\\ndouble norm( Vector a ){\\n return a.x*a.x + a.y*a.y;\\n}\\n\\ndouble absolute( Vector a ){\\n return sqrt(norm(a));\\n}\\n\\ndouble getDistance(Vector a, Vector b){\\n return absolute(a - b); \\n}\\n\\n// dot product\\ndouble dot(Vector a, Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\n// cross product\\ndouble cross(Vector a, Vector b){\\n return a.x*b.y - a.y*b.x;\\n}\\n\\nPoint project( Segment s, Point p ){\\n Vector base = s.target - s.source;\\n double t = dot(p - s.source, base)/norm(base);\\n return s.source + (base)*t;\\n}\\n\\nPoint reflect( Segment s, Point p ){\\n return p + (project(s, p) - p)*2.0;\\n}\\n\\n// verified by uoa2062\\nbool isOnSegment( Point a, Point b, Point c){\\n if ( a == c || b == c ) return true;\\n return (absolute(a-c) + absolute(c-b) < absolute(a-b) + EPS );\\n}\\n\\nbool isOrthogonal( Vector a, Vector b ){\\n return equals( dot(a, b), 0.0 );\\n}\\n\\nbool isOrthogonal( Point a1, Point a2, Point b1, Point b2 ){\\n return isOrthogonal( a1 - a2, b1 - b2 );\\n}\\n\\nbool isOrthogonal( Segment s1, Segment s2 ){\\n return equals( dot(s1.target - s1.source, s2.target - s2.source), 0.0 );\\n}\\n\\nbool isParallel( Vector a, Vector b ){\\n return equals( cross(a, b), 0.0 );\\n}\\n\\nbool isParallel( Point a1, Point a2, Point b1, Point b2){\\n return isParallel( a1 - a2, b1 - b2 );\\n}\\n\\nbool isParallel( Segment s1, Segment s2 ){\\n return equals( cross(s1.target - s1.source, s2.target - s2.source), 0.0 );\\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 return ON_SEGMENT;\\n}\\n\\n// intersect Segment p1-p2 and Segment p3-p4 ?\\nbool isIntersect(Point p1, Point p2, Point p3, Point p4){\\n return ( ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&\\n\\t ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0 );\\n}\\n\\n// intersect Segment s1 and Segment s2 ?\\n// verified by 920, 833, 866, uoa2062\\nbool isIntersect(Segment s1, Segment s2){\\n return isIntersect(s1.source, s1.target, s2.source, s2.target);\\n}\\n\\n// verified by 920, 833, uoa2062\\nPoint getCrossPoint(Segment s1, Segment s2){\\n assert( isIntersect(s1, s2) );\\n Vector base = s2.target - s2.source;\\n double d1 = absolute(cross(base, s1.source - s2.source));\\n double d2 = absolute(cross(base, s1.target - s2.source));\\n double t = d1/(d1 + d2);\\n return s1.source + (s1.target - s1.source)*t;\\n}\\n\\n\\n#define MAX 2000\\n#define NMAX 80000\\n#define LIMIT FLT_MAX\\n\\nclass Edge{\\n public:\\n int target;\\n double dist;\\n Edge(){}\\n Edge(int target, double dist): target(target), dist(double(dist)){}\\n};\\n\\nclass Graph{\\n public:\\n vector<Edge> adjList[NMAX];\\n int start;\\n\\n Graph(){\\n\\tfor ( int i = 0; i < NMAX; i++ ) adjList[i].clear();\\n }\\n \\n void connect( int i, int j, double d ){\\n\\tadjList[i].push_back(Edge(j, d));\\n\\tadjList[j].push_back(Edge(i, d));\\n }\\n};\\n\\nclass QNode{\\n public:\\n int index;\\n double cost;\\n QNode(){}\\n QNode( int index, double cost ): index(index), cost(cost){}\\n \\n bool operator < ( const QNode &q ) const { return cost > q.cost; }\\n};\\n\\nclass Node{\\n public:\\n Point p;\\n int id;\\n Node(){}\\n Node( Point p, int id): p(p), id(id){}\\n bool operator < ( const Node &n) const {\\n\\treturn p < n.p;\\n }\\n};\\n\\nint nnode;\\nPoint SP[NMAX];\\n\\nint getIndex( Point p ){\\n SP[nnode++] = p;\\n return nnode-1;\\n}\\n\\nvoid makeGraph(Graph &g, Segment S[MAX], int N, Point s ){\\n Segment base, target;\\n Node L[NMAX];\\n int beg, p = 0;\\n bool startSet = false;\\n nnode = 0;\\n for ( int b = 0; b < N; b++ ){\\n\\tbase = S[b];\\n\\tbeg = p;\\n\\n\\tif ( !startSet && isOnSegment(base.source, base.target, s) ){\\n\\t L[p++] = Node(s, getIndex(s));\\n\\t startSet = true;\\n\\t}\\n\\n\\tL[p++] = Node(base.source, getIndex(base.source));\\n\\tL[p++] = Node(base.target, getIndex(base.target));\\n\\n\\tfor ( int t = 0; t < N; t++ ){\\n\\t if ( t == b ) continue;\\n\\t target = S[t];\\n\\t if ( !isIntersect(base, target) ) continue;\\n\\t Point cp = getCrossPoint(base, target);\\n\\t L[p++] = Node(cp, getIndex(cp));\\n\\t}\\n\\n\\tsort(L + beg, L + p );\\n\\n\\tfor ( int i = beg; i < p-1; i++ ){\\n\\t g.connect(L[i].id, L[i+1].id, getDistance(L[i].p, L[i+1].p));\\n\\t}\\n }\\n\\n sort( L, L + p );\\n\\n for ( int i = 0; i < p-1; i++ ){\\n //\\tif ( eq(L[i].p, L[i+1].p) ) \\n if ( L[i].p == L[i+1].p ) \\n\\t g.connect( L[i].id, L[i+1].id, 0.0);\\n //\\tif ( eq(L[i].p, s) ) g.start = L[i].id;\\n if ( L[i].p == s ) g.start = L[i].id;\\n }\\n\\n}\\n\\ndouble dijkstra(Graph g){\\n bool visited[NMAX];\\n double D[NMAX];\\n priority_queue<QNode> PQ;\\n \\n for ( int i = 0; i < nnode; i++ ) {\\n\\tvisited[i] = false;\\n\\tD[i] = LIMIT;\\n }\\n\\n for ( int i = 0; i < g.adjList[g.start].size(); i++ ){\\n\\tEdge v = g.adjList[g.start][i];\\n\\tPQ.push(QNode(v.target, v.dist) );\\n\\tD[v.target] = v.dist;\\n }\\n\\n visited[g.start] = true;\\n D[g.start] = 0.0;\\n\\n QNode u;\\n\\n while( !PQ.empty() ){\\n\\tu = PQ.top(); PQ.pop();\\n\\tif ( visited[u.index] ) continue;\\n\\tvisited[u.index] = true;\\n\\tfor ( int i = 0; i < g.adjList[u.index].size(); i++ ){\\n\\t Edge v = g.adjList[u.index][i];\\n\\t if ( visited[v.target] ) continue;\\n\\t if ( D[u.index] + v.dist < D[v.target] ){\\n\\t\\tD[v.target] = D[u.index] + v.dist;\\n\\t\\tPQ.push(QNode(v.target, D[v.target]));\\n\\t }\\n\\t}\\n }\\n\\n double mdist = 0.0;\\n\\n for ( int i = 0; i < nnode; i++ ){\\n\\tmdist = max(mdist, D[i] );\\n\\tfor ( int k = 0; k < g.adjList[i].size(); k++ ){\\n\\t int j = g.adjList[i][k].target;\\n\\t double d = getDistance(SP[i], SP[j]);\\n\\t mdist = max(mdist, (double)(min(D[i], D[j]) + (d - abs(D[i]-D[j]))/2.0));\\n\\t}\\n }\\n return mdist;\\n}\\n\\nint main(){\\n int N;\\n Segment S[MAX];\\n\\n while( cin >> N && N ){\\n\\tPoint p1, p2;\\n\\tfor ( int i = 0; i < N; i++ ){\\n\\t cin >> p1.x; cin >> p1.y;\\n\\t cin >> p2.x; cin >> p2.y;\\n\\t S[i] = Segment(p1, p2);\\n\\t}\\n\\tcin >> p1.x; cin >> p1.y;\\n\\tGraph g;\\n\\tmakeGraph(g, S, N, p1);\\n\\tprintf(\\\"%.5lf\\\\n\\\", dijkstra(g));\\n }\\n\\n return 0;\\n}\\n\\n/**\\ndaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaadaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaadaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaa\\naaaaaaaaaaaaaaaaaaaaaaaaaaaa\\n\\n\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 1570,\n \"memory_kb\": 12000,\n \"score_of_the_acc\": -0.4743,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":1089,"cells":{"group_id":{"kind":"string","value":"aoj_2063_cpp"},"problem_description":{"kind":"string","value":"Problem F:\nTV Watching\nYou are addicted to watching TV, and you watch so many TV programs every day. You have been in\ntrouble recently: the airtimes of your favorite TV programs overlap.\nFortunately, you have both a TV and a video recorder at your home. You can therefore watch a program\non air while another program (on a different channel) is recorded to a video at the same time. However,\nit is not easy to decide which programs should be watched on air or recorded to a video. As you are a\ntalented computer programmer, you have decided to write a program to find the way of watching TV\nprograms which gives you the greatest possible satisfaction.\nYour program (for a computer) will be given TV listing of a day along with your\nscore\nfor each TV\nprogram. Each score represents how much you will be satisfied if you watch the corresponding TV\nprogram on air or with a video. Your program should compute the maximum possible sum of the scores\nof the TV programs that you can watch.\nInput\nThe input consists of several scenarios.\nThe first line of each scenario contains an integer\nN\n(1 ≤\nN\n≤ 1000) that represents the number of\nprograms. Each of the following\nN\nlines contains program information in the format below:\nT\nT\nb\nT\ne\nR\n1\nR\n2\nT\nis the title of the program and is composed by up to 32 alphabetical letters.\nT\nb\nand\nT\ne\nspecify the\nstart time and the end time of broadcasting, respectively.\nR\n1\nand\nR\n2\nindicate the score when you watch\nthe program on air and when you have the program recorded, respectively.\nAll times given in the input have the form of “hh:mm” and range from 00:00 to 23:59. You may assume\nthat no program is broadcast across the twelve midnight.\nThe end of the input is indicated by a line containing only a single zero. This is not part of scenarios.\nOutput\nFor each scenario, output the maximum possible score in a line.\nSample Input\n4\nOmoikkiriTV 12:00 13:00 5 1\nWaratteIitomo 12:00 13:00 10 2\nWatarusekennhaOnibakari 20:00 21:00 10 3\nSuzumiyaharuhiNoYuuutsu 23:00 23:30 100 40\n5\na 0:00 1:00 100 100\nb 0:00 1:00 101 101\nc 0:00 1:00 102 102\nd 0:00 1:00 103 103\ne 0:00 1:00 104 104\n0\nOutput for the Sample Input\n121\n207"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2063_10312968","code_snippet":"// AOJ #2063 TV Watching\n// 2025.3.20\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Prog { int s, e, r1, r2; };\n\nint toMin(const string &t) {\n int hh = stoi(t.substr(0, t.find(':')));\n int mm = stoi(t.substr(t.find(':')+1));\n return hh * 60 + mm;\n}\n\nint n;\nvector<Prog> p;\n\nvector<vector<int>> dp;\n\nint recDP(int i, int j) {\n int &res = dp[i][j];\n if(res != -1) return res;\n int base = max(i, j) + 1;\n res = 0;\n int lo = base, hi = n+1;\n while(lo < hi) {\n int mid = (lo+hi)/2;\n if(p[mid].s < p[i].e) lo = mid+1;\n else hi = mid;\n }\n int startTV = lo;\n for (int k = max(startTV, base); k <= n; k++) {\n if(p[k].s >= p[i].e) res = max(res, p[k].r1 + recDP(k, j));\n }\n lo = base, hi = n+1;\n while(lo < hi) {\n int mid = (lo+hi)/2;\n if(p[mid].s < p[j].e) lo = mid+1;\n else hi = mid;\n }\n int startR = lo;\n for (int k = max(startR, base); k <= n; k++) {\n if(p[k].s >= p[j].e) res = max(res, p[k].r2 + recDP(i, k));\n }\n return res;\n}\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n while(true) {\n cin >> n;\n if(n==0) break;\n\n p.assign(n+1, Prog());\n p[0] = {0, 0, 0, 0};\n string t, tb, te;\n int r1, r2;\n for (int i = 1; i <= n; i++) {\n cin >> t >> tb >> te >> r1 >> r2;\n p[i].s = toMin(tb);\n p[i].e = toMin(te);\n p[i].r1 = r1;\n p[i].r2 = r2;\n }\n sort(p.begin()+1, p.end(), [](const Prog &a, const Prog &b) {\n return a.s < b.s || (a.s == b.s && a.e < b.e);\n });\n dp.assign(n+1, vector<int>(n+1, -1));\n cout << recDP(0, 0) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":2570,"memory_kb":6836,"score_of_the_acc":-1.2879,"final_rank":14},{"submission_id":"aoj_2063_3103772","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 1440\n\nstruct Info{\n\tInfo(int arg_end_time,int arg_live_value,int arg_record_value){\n\t\tend_time = arg_end_time;\n\t\tlive_value = arg_live_value;\n\t\trecord_value = arg_record_value;\n\t}\n\tint end_time,live_value,record_value;\n};\n\nint N;\nint dp[NUM][NUM];\nvector<Info> G[NUM];\n\nint get_time(char buf[6]){\n\tint hour = 10*(buf[0]-'0')+buf[1]-'0';\n\tint minute = 10*(buf[3]-'0')+buf[4]-'0';\n\treturn 60*hour+minute;\n}\n\nint recursive(int live_time,int record_time){\n\n\tif(dp[live_time][record_time] != -1){\n\t\treturn dp[live_time][record_time];\n\t}\n\n\tint ret = 0;\n\n\tif(live_time < record_time){\n\n\t\tret = max(ret,recursive(live_time+1,record_time));\n\n\t\tfor(int i = 0; i < G[live_time].size(); i++){\n\n\t\t\tret = max(ret,recursive(G[live_time][i].end_time,record_time)+G[live_time][i].live_value);\n\t\t}\n\n\t\treturn dp[live_time][record_time] = ret;\n\n\t}else if(live_time > record_time){\n\n\t\tret = max(ret,recursive(live_time,record_time+1));\n\n\t\tfor(int i = 0; i < G[record_time].size(); i++){\n\t\t\tret = max(ret,recursive(live_time,G[record_time][i].end_time)+G[record_time][i].record_value);\n\t\t}\n\t\treturn dp[live_time][record_time] = ret;\n\n\t}else{ //live_time == record_time\n\n\t\tif(live_time == NUM-1){\n\n\t\t\treturn 0;\n\t\t}\n\n\t\tret = max(ret,recursive(live_time+1,record_time+1));\n\n\t\tfor(int i = 0; i < G[live_time].size(); i++){\n\t\t\tret = max(ret,recursive(G[live_time][i].end_time,record_time+1)+G[live_time][i].live_value);\n\t\t}\n\n\t\tfor(int i = 0; i < G[record_time].size(); i++){\n\t\t\tret = max(ret,recursive(live_time+1,G[record_time][i].end_time)+G[record_time][i].record_value);\n\t\t}\n\n\t\tif(G[live_time].size() > 1){\n\t\t\tfor(int i = 0; i < G[live_time].size(); i++){\n\t\t\t\tfor(int k = 0; k < G[live_time].size(); k++){\n\t\t\t\t\tif(k == i)continue;\n\n\t\t\t\t\tret = max(ret,recursive(G[live_time][i].end_time,G[live_time][k].end_time)+\n\t\t\t\t\t\t\tG[live_time][i].live_value+G[live_time][k].record_value);\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn dp[live_time][record_time] = ret;\n\t}\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < NUM; i++){\n\t\tG[i].clear();\n\t}\n\n\tint live_value,record_value,start_time,end_time;\n\tchar name[33],start_buf[6],end_buf[6];\n\n\tfor(int loop = 0; loop < N; loop++){\n\n\t\tscanf(\"%s %s %s %d %d\",name,start_buf,end_buf,&live_value,&record_value);\n\t\tstart_time = get_time(start_buf);\n\t\tend_time = get_time(end_buf);\n\n\t\tG[start_time].push_back(Info(end_time,live_value,record_value));\n\t}\n\n\tfor(int i = 0; i < NUM; i++){\n\t\tfor(int k = 0; k < NUM; k++){\n\t\t\tdp[i][k] = -1;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",recursive(0,0));\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":70,"memory_kb":11496,"score_of_the_acc":-1.0196,"final_rank":13},{"submission_id":"aoj_2063_2285258","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint N;\nint dp[1011][1011];\n\nvoid update( int &a, int b ){\n a = max( a, b );\n}\n\nint main(){\n while( ~scanf(\"%d\",&N) && N ) {\n vector<int> S1(N),S2(N);\n vector<int> Ts[60*25], Te[60*25];\n char buf[256];\n for(int i=0;i<N;i++){\n int tb1,tb2,te1,te2;\n scanf(\"%s %d:%d %d:%d %d %d\",buf,&tb1,&tb2,&te1,&te2,&S1[i],&S2[i]);\n int ts = tb1 * 60 + tb2, te = te1 * 60 + te2;\n Ts[ts].emplace_back( i );\n Te[te].emplace_back( i );\n }\n vector<int> G(N+1);\n vector<int> nx(N+1);\n int cur = N;\n for(int i=60*24;i>-1;i--){\n for( int id : Ts[i] ) {\n G[--cur] = id;\n }\n for( int id : Te[i] ) {\n nx[id] = cur;\n }\n }\n\n \n\n fill( dp[0], dp[N], 0 );\n for(int i=0;i<=N;i++){\n for(int j=0;j<=N;j++){\n int a = G[i], b = G[j];\n if( i == j ) {\n if( i == N ) continue;\n update( dp[i+1][j+1], dp[i][j] );\n update( dp[nx[a]][j+1], dp[i][j] + S1[a] );\n update( dp[i+1][nx[b]], dp[i][j] + S2[b] );\n } else if( i < j ) {\n update( dp[i+1][j], dp[i][j] );\n update( dp[nx[a]][j], dp[i][j] + S1[a] );\n } else {\n update( dp[i][j+1], dp[i][j] );\n update( dp[i][nx[b]], dp[i][j] + S2[b] );\n }\n }\n }\n printf(\"%d\\n\",dp[N][N]);\n } \n}","accuracy":1,"time_ms":20,"memory_kb":7108,"score_of_the_acc":-0.3295,"final_rank":4},{"submission_id":"aoj_2063_1195834","code_snippet":"#include<iostream>\n#include<vector>\n#include<cmath>\n#include<string>\n#include<sstream>\n#include<algorithm>\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 ++)\n\nusing namespace std;\n\nstruct Data{\n int start,end,onAir,recorded;\n bool operator<(const Data &data) const{\n if(end != data.end) return end < data.end;\n if(start != data.start) return start < data.start;\n return (onAir != data.onAir ) ? onAir < data.onAir : recorded < data.recorded;\n }\n};\n\nconst int MAX_N = 1100;\nint N,dp[2000][2000],h,m;\nvector<int> buf;\n\n\nint toTime(string s){\n rep(i,(int)s.size()) if(s[i] == ':') s[i] = ' ';\n stringstream ss(s);\n ss >> h >> m;\n return h * 60 + m;\n}\n\nint main(void){\n while(cin>>N,N){\n vector<Data> vec(N);\n rep(i,N){\n string a,b,c;\n cin>>a>>b>>c>>vec[i].onAir>>vec[i].recorded;\n vec[i].start = toTime(b); vec[i].end = toTime(c); \n }\n vec.push_back((Data){0,0,0,0});\n rep(i,N+2)rep(j,N+2)dp[i][j] = 0;\n sort(vec.begin(),vec.end());\n buf.clear();\n rep(i,vec.size())buf.push_back(vec[i].end);\n rep(i,vec.size()){\n rep(j,vec.size()){\n if(i==j)dp[i][j] = max((i?dp[i-1][j]:0),(j?dp[i][j-1]:0));\n else if(i<j){\n int prev = upper_bound(buf.begin(),buf.begin()+j,vec[j].start) - buf.begin() - 1;\n dp[i][j] = max(dp[i][j-1],((prev!=-1)?dp[i][prev]:0)+vec[j].recorded);\n }else{\n int prev = upper_bound(buf.begin(),buf.begin()+i,vec[i].start) - buf.begin() - 1;\n dp[i][j] = max(dp[i-1][j],((prev!=-1)?dp[prev][j]:0)+vec[i].onAir);\n }\n }\n }\n cout<<dp[(int)vec.size()-1][(int)vec.size()-1]<<endl;\n }\n}","accuracy":1,"time_ms":100,"memory_kb":9452,"score_of_the_acc":-0.719,"final_rank":8},{"submission_id":"aoj_2063_1150157","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nchar in[11100];\nvector<pair<int,pair<int,int> > >g[1500];\nint dp[1500][1500];\nint main(){\n\tint a;\n\twhile(scanf(\"%d\",&a),a){\n\t\tfor(int i=0;i<1500;i++)g[i].clear();\n\t\tfor(int i=0;i<a;i++){\n\t\t\tint ph,pm,qh,qm,r,s;\n\t\t\tscanf(\"%s%d:%d%d:%d%d%d\",in,&ph,&pm,&qh,&qm,&r,&s);\n\t\t\tint p=ph*60+pm;\n\t\t\tint q=qh*60+qm;\n\t\t\tg[p].push_back(make_pair(q,make_pair(r,s)));\n\t\t}\n\t\tfor(int i=0;i<1500;i++)for(int j=0;j<1500;j++)\n\t\t\tdp[i][j]=-999999999;\n\t\tdp[0][0]=0;\n\t\tfor(int i=0;i<1450;i++){\n\t\t\tfor(int j=0;j<1450;j++){\n\t\t\t\tif(i<j){\n\t\t\t\t\tdp[i+1][j]=max(dp[i+1][j],dp[i][j]);\n\t\t\t\t\tfor(int k=0;k<g[i].size();k++){\n\t\t\t\t\t\tdp[g[i][k].first][j]=max(dp[g[i][k].first][j],dp[i][j]+g[i][k].second.first);\n\t\t\t\t\t}\n\t\t\t\t}else if(i>j){\n\t\t\t\t\tdp[i][j+1]=max(dp[i][j+1],dp[i][j]);\n\t\t\t\t\tfor(int k=0;k<g[j].size();k++){\n\t\t\t\t\t\tdp[i][g[j][k].first]=max(dp[i][g[j][k].first],dp[i][j]+g[j][k].second.second);\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tdp[i+1][j]=max(dp[i+1][j],dp[i][j]);\n\t\t\t\t\tdp[i][j+1]=max(dp[i][j+1],dp[i][j]);\n\t\t\t\t\tfor(int k=0;k<g[i].size();k++)for(int l=0;l<g[i].size();l++){\n\t\t\t\t\t\tif(k==l)continue;\n\t\t\t\t\t\tdp[g[i][k].first][g[i][l].first]=max(dp[g[i][k].first][g[i][l].first],dp[i][j]+g[i][k].second.first+g[i][l].second.second);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ret=0;\n\t\tfor(int i=0;i<1450;i++)for(int j=0;j<1450;j++)ret=max(ret,dp[i][j]);\n\t\tprintf(\"%d\\n\",ret);\n\t}\n}","accuracy":1,"time_ms":110,"memory_kb":9908,"score_of_the_acc":-0.7926,"final_rank":12},{"submission_id":"aoj_2063_1124192","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-9;\ntypedef long long ll;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define rev(i,n) for(int i=n-1;i>=0;i--)\n#define sz(a) a.size()\n#define all(a) a.begin(),a.end()\n#define mp(a,b) make_pair(a,b)\n#define pb(a) push_back(a)\n#define SS stringstream\n#define DBG1(a) rep(_X,sz(a)){printf(\"%d \",a[_X]);}puts(\"\");\n#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf(\"%d \",a[_X][_Y]);puts(\"\");}\n#define bitcount(b) __builtin_popcount(b)\n#define REP(i, s, e) for ( int i = s; i <= e; i++ ) \n#define fi first\n#define se second\nint dp[1024][1024];\nstruct Item{\n\tint l,r,S1,S2;\n};\nvector<Item> item;\nbool operator < (const Item &a,const Item &b){\n\tif( a.l != b.l ) return a.l < b.l;\n\treturn a.r < b.r;\n}\n\nint nextNode[1024];\nint n;\nint dfs(int x,int y){\n\tif( dp[x][y] != -1) return dp[x][y];\n\tint ans = 0;\n\tint xNext = nextNode[x];\n\tint yNext = nextNode[y];\n\tif( x == n && y == n ) return 0;\n\telse if( x == n ){\n\t\treturn dp[x][y] = max( dfs(x,y+1) , dfs(x,yNext)+item[y].S2 );\n\t}else if( y == n){\n\t\treturn dp[x][y] = max( dfs(x+1,y) , dfs(xNext,y)+item[x].S1 );\n\t}\n\tif( y < x ){\n\t\tans = max( ans , dfs(x,y+1) );\n\t\tans = max( ans , dfs(x,yNext) + item[y].S2 );\n\t}else if( x == y ){\n\t\tans = max( ans , dfs(x+1,y+1) );\n\t\tans = max( ans , dfs(xNext,y+1) + item[x].S1);\n\t\tans = max( ans , dfs(x+1,yNext) + item[y].S2);\n\t}else{\n\t\tans = max( ans , dfs(x+1,y) );\n\t\tans = max( ans , dfs(xNext,y) + item[x].S1 );\n\t}\n\treturn dp[x][y] = ans;\n}\n\n\nint conv(string t){\n\tt[2] = ' ';\n\tstringstream ss(t);\n\tint h,m;\n\tss >> h >> m;\n\t\n\treturn h * 60 + m;\n}\n\nint main(){\n\twhile(cin >> n && n){\n\t\tmemset(dp,-1,sizeof(dp));\n\t\titem.clear();\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\tstring nm;\n\t\t\tstring a,b;\n\t\t\tcin >> nm >> a >> b;\n\t\t\tint r1,r2;\n\t\t\tcin >> r1 >> r2;\n\t\t\titem.push_back({conv(a),conv(b),r1,r2});\n\t\t\t//cout << a << \" \" << b << endl;\n\t\t}\n\t\tsort(item.begin(),item.end());\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\tnextNode[i] = n;\n\t\t\tfor(int j = i+1 ; j < n ; j++)\n\t\t\t\tif( item[i].r <= item[j].l ){\n\t\t\t\t\tnextNode[i] = j;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t}\n\t\tcout << dfs(0,0) << endl;\n\t}\n\t\n\t\n}","accuracy":1,"time_ms":50,"memory_kb":5456,"score_of_the_acc":-0.0888,"final_rank":2},{"submission_id":"aoj_2063_1059969","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nusing namespace std;\n\nstruct Data {\n int start,end,onAir,recorded;\n bool operator < ( const Data &data ) const {\n if( end != data.end ) return end < data.end;\n if( start != data.start ) return start < data.start;\n return ( onAir != data.onAir ) ? onAir < data.onAir : recorded < data.recorded;\n }\n};\n\nconst int MAX_N = 1100;\nint N,dp[2000][2000],h,m;\nvector<int> buf;\n\nint toTime(string s){\n rep(i,(int)s.size()) if( s[i] == ':' ) s[i] = ' ';\n stringstream ss(s);\n ss >> h >> m;\n return h * 60 + m;\n}\n\nint main(){\n while( cin >> N, N ){\n vector<Data> vec(N);\n rep(i,N) {\n string a,b,c;\n cin >> a >> b >> c >> vec[i].onAir >> vec[i].recorded;\n vec[i].start = toTime(b), vec[i].end = toTime(c);\n }\n vec.push_back((Data){0,0,0,0});\n rep(i,N+2) rep(j,N+2) dp[i][j] = 0; \n sort(vec.begin(),vec.end());\n buf.clear();\n rep(i,vec.size()) buf.push_back(vec[i].end);\n rep(i,vec.size()){\n rep(j,vec.size()){\n if( i == j ) dp[i][j] = max((i?dp[i-1][j]:0),(j?dp[i][j-1]:0));\n else if( i < j ) {\n int prev = upper_bound(buf.begin(),buf.begin()+j,vec[j].start) - buf.begin() - 1;\n dp[i][j] = max(dp[i][j-1],((prev!=-1)?dp[i][prev]:0)+vec[j].recorded);\n } else {\n int prev = upper_bound(buf.begin(),buf.begin()+i,vec[i].start) - buf.begin() - 1;\n dp[i][j] = max(dp[i-1][j],((prev!=-1)?dp[prev][j]:0)+vec[i].onAir);\n }\n }\n }\n printf(\"%d\\n\",dp[(int)vec.size()-1][(int)vec.size()-1]);\n }\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":9448,"score_of_the_acc":-0.7145,"final_rank":5},{"submission_id":"aoj_2063_1059964","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nusing namespace std;\n\nstruct Data {\n int start,end,onAir,recorded;\n bool operator < ( const Data &data ) const {\n if( end != data.end ) return end < data.end;\n if( start != data.start ) return start < data.start;\n return ( onAir != data.onAir ) ? onAir < data.onAir : recorded < data.recorded;\n }\n};\n\nconst int MAX_N = 1100;\nint N,dp[2000][2000],h,m;\nvector<int> buf;\n\nint toTime(string s){\n rep(i,(int)s.size()) if( s[i] == ':' ) s[i] = ' ';\n stringstream ss(s);\n ss >> h >> m;\n return h * 60 + m;\n}\n\nint main(){\n while( cin >> N, N ){\n vector<Data> vec(N);\n rep(i,N) {\n string a,b,c;\n cin >> a >> b >> c >> vec[i].onAir >> vec[i].recorded;\n vec[i].start = toTime(b), vec[i].end = toTime(c);\n }\n vec.push_back((Data){0,0,0,0});\n rep(i,N+2) rep(j,N+2) dp[i][j] = 0; \n sort(vec.begin(),vec.end());\n buf.clear();\n rep(i,vec.size()) buf.push_back(vec[i].end);\n rep(i,vec.size()){\n rep(j,vec.size()){\n if( i == j ) dp[i][j] = max((i?dp[i-1][j]:0),(j?dp[i][j-1]:0));\n else if( i < j ) {\n dp[i][j] = dp[i][j-1];\n int prev = upper_bound(buf.begin(),buf.begin()+j,vec[j].start) - buf.begin() - 1;\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[i][prev]:0)+vec[j].recorded);\n } else {\n dp[i][j] = dp[i-1][j];\n int prev = upper_bound(buf.begin(),buf.begin()+i,vec[i].start) - buf.begin() - 1;\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[prev][j]:0)+vec[i].onAir);\n }\n }\n }\n printf(\"%d\\n\",dp[(int)vec.size()-1][(int)vec.size()-1]);\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":9448,"score_of_the_acc":-0.7184,"final_rank":6},{"submission_id":"aoj_2063_1059950","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nusing namespace std;\n\nstruct Data {\n int start,end,onAir,recorded;\n bool operator < ( const Data &data ) const {\n if( end != data.end ) return end < data.end;\n if( start != data.start ) return start < data.start;\n return ( onAir != data.onAir ) ? onAir < data.onAir : recorded < data.recorded;\n }\n};\n\nconst int MAX_N = 1100;\nconst int IINF = INT_MAX;\nint N,dp[2000][2000],h,m;\nvector<int> buf;\n\nint toTime(string s){\n rep(i,(int)s.size()) if( s[i] == ':' ) s[i] = ' ';\n stringstream ss(s);\n ss >> h >> m;\n return h * 60 + m;\n}\n\nint main(){\n while( cin >> N, N ){\n vector<Data> vec(N);\n rep(i,N) {\n string a,b,c;\n cin >> a >> b >> c >> vec[i].onAir >> vec[i].recorded;\n vec[i].start = toTime(b), vec[i].end = toTime(c);\n }\n vec.push_back((Data){0,0,0,0});\n rep(i,N+2) rep(j,N+2) dp[i][j] = 0; \n sort(vec.begin(),vec.end());\n buf.clear();\n int maxi = 0;\n rep(i,vec.size()) buf.push_back(vec[i].end);\n rep(i,vec.size()){\n rep(j,vec.size()){\n if( i == j ) dp[i][j] = max((i?dp[i-1][j]:0),(j?dp[i][j-1]:0));\n else if( i < j ) {\n dp[i][j] = dp[i][j-1];\n int prev = upper_bound(buf.begin(),buf.begin()+j,vec[j].start) - buf.begin() - 1;\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[i][prev]:0)+vec[j].recorded);\n } else {\n dp[i][j] = dp[i-1][j];\n int prev = upper_bound(buf.begin(),buf.begin()+i,vec[i].start) - buf.begin() - 1;\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[prev][j]:0)+vec[i].onAir);\n }\n maxi = max(maxi,dp[i][j]);\n }\n }\n printf(\"%d\\n\",maxi);\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":9448,"score_of_the_acc":-0.7184,"final_rank":6},{"submission_id":"aoj_2063_1059947","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nusing namespace std;\n\nstruct Data {\n int start,end,onAir,recorded;\n bool operator < ( const Data &data ) const {\n if( end != data.end ) return end < data.end;\n if( start != data.start ) return start < data.start;\n return ( onAir != data.onAir ) ? onAir < data.onAir : recorded < data.recorded;\n }\n};\n\nconst int MAX_N = 1100;\nconst int IINF = INT_MAX;\nint N,s[MAX_N],t[MAX_N],score[MAX_N][2],dp[2000][2000];\nvector<int> buf;\n\nint toTime(string s){\n rep(i,(int)s.size()) if( s[i] == ':' ) s[i] = ' ';\n stringstream ss;\n ss << s;\n int h,m;\n ss >> h >> m;\n return h * 60 + m;\n}\n\nint main(){\n while( cin >> N, N ){\n vector<Data> vec;\n rep(i,N) {\n string a,b,c;\n cin >> a >> b >> c >> score[i][0] >> score[i][1];\n assert( b != c );\n s[i] = toTime(b), t[i] = toTime(c);\n vec.push_back((Data){s[i],t[i],score[i][0],score[i][1]});\n }\n vec.push_back((Data){0,0,0,0});\n vec.push_back((Data){IINF,IINF,0,0});\n rep(i,N+2) rep(j,N+2) dp[i][j] = 0; \n sort(vec.begin(),vec.end());\n buf.clear();\n int maxi = 0;\n rep(i,vec.size()) buf.push_back(vec[i].end);\n rep(i,vec.size()){\n rep(j,vec.size()){\n if( i == j ) {\n dp[i][j] = max((i?dp[i-1][j]:0),(j?dp[i][j-1]:0));\n } else if( i < j ) {\n dp[i][j] = dp[i][j-1];\n int prev = upper_bound(buf.begin(),buf.begin()+j,vec[j].start) - buf.begin() - 1;\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[i][prev]:0)+vec[j].recorded);\n } else {\n dp[i][j] = dp[i-1][j];\n int prev = upper_bound(buf.begin(),buf.begin()+i,vec[i].start) - buf.begin() - 1;\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[prev][j]:0)+vec[i].onAir);\n }\n maxi = max(maxi,dp[i][j]);\n }\n }\n cout << maxi << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":9476,"score_of_the_acc":-0.7227,"final_rank":9},{"submission_id":"aoj_2063_1059946","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nusing namespace std;\n\nstruct Data {\n int start,end,onAir,recorded;\n bool operator < ( const Data &data ) const {\n if( end != data.end ) return end < data.end;\n if( start != data.start ) return start < data.start;\n return ( onAir != data.onAir ) ? onAir < data.onAir : recorded < data.recorded;\n }\n};\n\nconst int MAX_N = 1100;\nconst int IINF = INT_MAX;\nint N,s[MAX_N],t[MAX_N],score[MAX_N][2],dp[2000][2000];\nvector<int> buf;\n\nint toTime(string s){\n rep(i,(int)s.size()) if( s[i] == ':' ) s[i] = ' ';\n stringstream ss;\n ss << s;\n int h,m;\n ss >> h >> m;\n return h * 60 + m;\n}\n\nint main(){\n while( cin >> N, N ){\n vector<Data> vec;\n rep(i,N) {\n string a,b,c;\n cin >> a >> b >> c >> score[i][0] >> score[i][1];\n assert( b != c );\n s[i] = toTime(b), t[i] = toTime(c);\n vec.push_back((Data){s[i],t[i],score[i][0],score[i][1]});\n }\n vec.push_back((Data){0,0,0,0});\n vec.push_back((Data){IINF,IINF,0,0});\n rep(i,N+2) rep(j,N+2) dp[i][j] = 0; \n sort(vec.begin(),vec.end());\n buf.clear();\n int maxi = 0;\n rep(i,vec.size()) buf.push_back(vec[i].end);\n rep(i,vec.size()){\n rep(j,vec.size()){\n if( i == j ) {\n dp[i][j] = max((i?dp[i-1][j]:0),(j?dp[i][j-1]:0));\n } else if( i < j ) {\n dp[i][j] = dp[i][j-1];\n int prev = upper_bound(buf.begin(),buf.begin()+j,vec[j].start) - buf.begin();\n if( buf[prev] > vec[j].start ) --prev;\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[i][prev]:0)+vec[j].recorded);\n } else {\n dp[i][j] = dp[i-1][j];\n int prev = upper_bound(buf.begin(),buf.begin()+i,vec[i].start) - buf.begin();\n if( buf[prev] > vec[i].start ) --prev;\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[prev][j]:0)+vec[i].onAir);\n }\n maxi = max(maxi,dp[i][j]);\n }\n }\n cout << maxi << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":9476,"score_of_the_acc":-0.7227,"final_rank":9},{"submission_id":"aoj_2063_1059944","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nusing namespace std;\n\nstruct Data {\n int start,end,onAir,recorded;\n bool operator < ( const Data &data ) const {\n if( end != data.end ) return end < data.end;\n if( start != data.start ) return start < data.start;\n return ( onAir != data.onAir ) ? onAir < data.onAir : recorded < data.recorded;\n }\n};\n\nconst int MAX_N = 1100;\nconst int IINF = INT_MAX;\nint N,s[MAX_N],t[MAX_N],score[MAX_N][2],dp[2000][2000];\nvector<int> buf;\n\nint toTime(string s){\n rep(i,(int)s.size()) if( s[i] == ':' ) s[i] = ' ';\n stringstream ss;\n ss << s;\n int h,m;\n ss >> h >> m;\n return h * 60 + m;\n}\n\nint main(){\n while( cin >> N, N ){\n vector<Data> vec;\n rep(i,N) {\n string a,b,c;\n cin >> a >> b >> c >> score[i][0] >> score[i][1];\n assert( b != c );\n s[i] = toTime(b), t[i] = toTime(c);\n vec.push_back((Data){s[i],t[i],score[i][0],score[i][1]});\n }\n vec.push_back((Data){0,0,0,0});\n vec.push_back((Data){IINF,IINF,0,0});\n rep(i,N+2) rep(j,N+2) dp[i][j] = 0; \n sort(vec.begin(),vec.end());\n //rep(i,vec.size()) cout << \"[\" <<vec[i].start << \",\" << vec[i].end << \"] : \" << vec[i].onAir << \" and \" << vec[i].recorded << endl;\n buf.clear();\n int maxi = 0;\n rep(i,vec.size()) buf.push_back(vec[i].end);\n rep(i,vec.size()){\n rep(j,vec.size()){\n if( i == j ) {\n dp[i][j] = max((i?dp[i-1][j]:0),(j?dp[i][j-1]:0));\n } else if( i < j ) {\n dp[i][j] = dp[i][j-1];\n int prev = upper_bound(buf.begin(),buf.begin()+j,vec[j].start) - buf.begin();\n //if( prev == j ) -- prev;\n if( buf[prev] > vec[j].start ) --prev;\n\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[i][prev]:0)+vec[j].recorded);\n } else {\n dp[i][j] = dp[i-1][j];\n int prev = upper_bound(buf.begin(),buf.begin()+i,vec[i].start) - buf.begin();\n //if( prev == i ) -- prev;\n if( buf[prev] > vec[i].start ) --prev;\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[prev][j]:0)+vec[i].onAir);\n }\n maxi = max(maxi,dp[i][j]);\n //cout << \"dp[\" << i << \"][\" << j << \"] = \" << dp[i][j] << endl;\n }\n }\n cout << maxi << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":9476,"score_of_the_acc":-0.7227,"final_rank":9},{"submission_id":"aoj_2063_613129","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 pair<int, int> P;\nstruct TV{\n P time;\n int r1, r2;\n bool operator < (const TV& t) const{\n return time < t.time;\n }\n TV() {}\n TV(int f) { time = P(f, 0); }\n};\nvoid update(int& x, int y){\n if(x < y) x = y;\n}\n\nint main(){\n int N;\n while(cin >> N && N){\n int dp[1001][1001] = {};\n vector<TV> tv(N);\n REP(i, N){\n char tmp[100];\n int a, b, c, d;\n scanf(\"%s %d:%d %d:%d %d %d\", tmp, &a, &b, &c, &d, &tv[i].r1, &tv[i].r2);\n tv[i].time = P(a * 60 + b , c * 60 + d);\n }\n sort(tv.begin(), tv.end());\n for(int i = 0; i <= N; i++){\n for(int j = 0; j <= N; j++){\n if(i < N){\n int ni = lower_bound(tv.begin(), tv.end(), TV(tv[i].time.second)) - tv.begin();\n update(dp[ni][max(i + 1, j)], dp[i][j] + tv[i].r1);\n update(dp[i + 1][j], dp[i][j]);\n }\n if(j < N){\n int nj = lower_bound(tv.begin(), tv.end(), TV(tv[j].time.second)) - tv.begin();\n update(dp[max(j + 1, i)][nj], dp[i][j] + tv[j].r2);\n update(dp[i][j + 1], dp[i][j]);\n }\n }\n }\n cout << dp[N][N] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":260,"memory_kb":5184,"score_of_the_acc":-0.1296,"final_rank":3},{"submission_id":"aoj_2063_472724","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\nclass Data\n{\npublic:\n int t1, t2, r1, r2;\n bool operator< (const Data& d) const{\n return t1 < d.t1;\n }\n};\n\nint n;\nvector<Data> d;\nvector<int> nextTV;\n\nvector<vector<int> > memo;\n\nint solve(int a, int b)\n{\n if(a == n+1 || b == n+1)\n return 0;\n if(a == n && b == n)\n return 0;\n if(memo[a][b] != -1)\n return memo[a][b];\n\n int ret = 0;\n ret = max(ret, solve(a, b+1));\n ret = max(ret, solve(a+1, b));\n if(a == b){\n ret = max(ret, d[a].r1 + solve(nextTV[a], b+1));\n ret = max(ret, d[b].r2 + solve(a+1, nextTV[b]));\n }else if(a > b){\n ret = max(ret, d[b].r2 + solve(a, nextTV[b]));\n }else{\n ret = max(ret, d[a].r1 + solve(nextTV[a], b));\n }\n\n return memo[a][b] = ret;\n}\n\nint main()\n{\n for(;;){\n cin >> n;\n if(n == 0)\n return 0;\n\n d.resize(n+1);\n for(int i=0; i<n; ++i){\n string s;\n int h1, m1, h2, m2;\n char c;\n cin >> s >> h1 >> c >> m1 >> h2 >> c >> m2 >> d[i].r1 >> d[i].r2;\n d[i].t1 = h1 * 60 + m1;\n d[i].t2 = h2 * 60 + m2;\n }\n d[n].t1 = INT_MAX / 2;\n d[n].t2 = INT_MAX / 2 + 1;\n d[n].r1 = d[n].r2 = 0;\n sort(d.begin(), d.end());\n\n nextTV.resize(n+1);\n for(int i=0; i<=n; ++i){\n Data tmp;\n tmp.t1 = d[i].t2;\n nextTV[i] = lower_bound(d.begin(), d.end(), tmp) - d.begin();\n }\n\n memo.assign(n+1, vector<int>(n+1, -1));\n cout << solve(0, 0) << endl;\n }\n}","accuracy":1,"time_ms":110,"memory_kb":4952,"score_of_the_acc":-0.0353,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2063_10312968\",\n \"code_snippet\": \"// AOJ #2063 TV Watching\\n// 2025.3.20\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct Prog { int s, e, r1, r2; };\\n\\nint toMin(const string &t) {\\n int hh = stoi(t.substr(0, t.find(':')));\\n int mm = stoi(t.substr(t.find(':')+1));\\n return hh * 60 + mm;\\n}\\n\\nint n;\\nvector<Prog> p;\\n\\nvector<vector<int>> dp;\\n\\nint recDP(int i, int j) {\\n int &res = dp[i][j];\\n if(res != -1) return res;\\n int base = max(i, j) + 1;\\n res = 0;\\n int lo = base, hi = n+1;\\n while(lo < hi) {\\n int mid = (lo+hi)/2;\\n if(p[mid].s < p[i].e) lo = mid+1;\\n else hi = mid;\\n }\\n int startTV = lo;\\n for (int k = max(startTV, base); k <= n; k++) {\\n if(p[k].s >= p[i].e) res = max(res, p[k].r1 + recDP(k, j));\\n }\\n lo = base, hi = n+1;\\n while(lo < hi) {\\n int mid = (lo+hi)/2;\\n if(p[mid].s < p[j].e) lo = mid+1;\\n else hi = mid;\\n }\\n int startR = lo;\\n for (int k = max(startR, base); k <= n; k++) {\\n if(p[k].s >= p[j].e) res = max(res, p[k].r2 + recDP(i, k));\\n }\\n return res;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n\\n while(true) {\\n cin >> n;\\n if(n==0) break;\\n\\n p.assign(n+1, Prog());\\n p[0] = {0, 0, 0, 0};\\n string t, tb, te;\\n int r1, r2;\\n for (int i = 1; i <= n; i++) {\\n cin >> t >> tb >> te >> r1 >> r2;\\n p[i].s = toMin(tb);\\n p[i].e = toMin(te);\\n p[i].r1 = r1;\\n p[i].r2 = r2;\\n }\\n sort(p.begin()+1, p.end(), [](const Prog &a, const Prog &b) {\\n return a.s < b.s || (a.s == b.s && a.e < b.e);\\n });\\n dp.assign(n+1, vector<int>(n+1, -1));\\n cout << recDP(0, 0) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2570,\n \"memory_kb\": 6836,\n \"score_of_the_acc\": -1.2879,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2063_3103772\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 1440\\n\\nstruct Info{\\n\\tInfo(int arg_end_time,int arg_live_value,int arg_record_value){\\n\\t\\tend_time = arg_end_time;\\n\\t\\tlive_value = arg_live_value;\\n\\t\\trecord_value = arg_record_value;\\n\\t}\\n\\tint end_time,live_value,record_value;\\n};\\n\\nint N;\\nint dp[NUM][NUM];\\nvector<Info> G[NUM];\\n\\nint get_time(char buf[6]){\\n\\tint hour = 10*(buf[0]-'0')+buf[1]-'0';\\n\\tint minute = 10*(buf[3]-'0')+buf[4]-'0';\\n\\treturn 60*hour+minute;\\n}\\n\\nint recursive(int live_time,int record_time){\\n\\n\\tif(dp[live_time][record_time] != -1){\\n\\t\\treturn dp[live_time][record_time];\\n\\t}\\n\\n\\tint ret = 0;\\n\\n\\tif(live_time < record_time){\\n\\n\\t\\tret = max(ret,recursive(live_time+1,record_time));\\n\\n\\t\\tfor(int i = 0; i < G[live_time].size(); i++){\\n\\n\\t\\t\\tret = max(ret,recursive(G[live_time][i].end_time,record_time)+G[live_time][i].live_value);\\n\\t\\t}\\n\\n\\t\\treturn dp[live_time][record_time] = ret;\\n\\n\\t}else if(live_time > record_time){\\n\\n\\t\\tret = max(ret,recursive(live_time,record_time+1));\\n\\n\\t\\tfor(int i = 0; i < G[record_time].size(); i++){\\n\\t\\t\\tret = max(ret,recursive(live_time,G[record_time][i].end_time)+G[record_time][i].record_value);\\n\\t\\t}\\n\\t\\treturn dp[live_time][record_time] = ret;\\n\\n\\t}else{ //live_time == record_time\\n\\n\\t\\tif(live_time == NUM-1){\\n\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\n\\t\\tret = max(ret,recursive(live_time+1,record_time+1));\\n\\n\\t\\tfor(int i = 0; i < G[live_time].size(); i++){\\n\\t\\t\\tret = max(ret,recursive(G[live_time][i].end_time,record_time+1)+G[live_time][i].live_value);\\n\\t\\t}\\n\\n\\t\\tfor(int i = 0; i < G[record_time].size(); i++){\\n\\t\\t\\tret = max(ret,recursive(live_time+1,G[record_time][i].end_time)+G[record_time][i].record_value);\\n\\t\\t}\\n\\n\\t\\tif(G[live_time].size() > 1){\\n\\t\\t\\tfor(int i = 0; i < G[live_time].size(); i++){\\n\\t\\t\\t\\tfor(int k = 0; k < G[live_time].size(); k++){\\n\\t\\t\\t\\t\\tif(k == i)continue;\\n\\n\\t\\t\\t\\t\\tret = max(ret,recursive(G[live_time][i].end_time,G[live_time][k].end_time)+\\n\\t\\t\\t\\t\\t\\t\\tG[live_time][i].live_value+G[live_time][k].record_value);\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn dp[live_time][record_time] = ret;\\n\\t}\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < NUM; i++){\\n\\t\\tG[i].clear();\\n\\t}\\n\\n\\tint live_value,record_value,start_time,end_time;\\n\\tchar name[33],start_buf[6],end_buf[6];\\n\\n\\tfor(int loop = 0; loop < N; loop++){\\n\\n\\t\\tscanf(\\\"%s %s %s %d %d\\\",name,start_buf,end_buf,&live_value,&record_value);\\n\\t\\tstart_time = get_time(start_buf);\\n\\t\\tend_time = get_time(end_buf);\\n\\n\\t\\tG[start_time].push_back(Info(end_time,live_value,record_value));\\n\\t}\\n\\n\\tfor(int i = 0; i < NUM; i++){\\n\\t\\tfor(int k = 0; k < NUM; k++){\\n\\t\\t\\tdp[i][k] = -1;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",recursive(0,0));\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 11496,\n \"score_of_the_acc\": -1.0196,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2063_2285258\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint N;\\nint dp[1011][1011];\\n\\nvoid update( int &a, int b ){\\n a = max( a, b );\\n}\\n\\nint main(){\\n while( ~scanf(\\\"%d\\\",&N) && N ) {\\n vector<int> S1(N),S2(N);\\n vector<int> Ts[60*25], Te[60*25];\\n char buf[256];\\n for(int i=0;i<N;i++){\\n int tb1,tb2,te1,te2;\\n scanf(\\\"%s %d:%d %d:%d %d %d\\\",buf,&tb1,&tb2,&te1,&te2,&S1[i],&S2[i]);\\n int ts = tb1 * 60 + tb2, te = te1 * 60 + te2;\\n Ts[ts].emplace_back( i );\\n Te[te].emplace_back( i );\\n }\\n vector<int> G(N+1);\\n vector<int> nx(N+1);\\n int cur = N;\\n for(int i=60*24;i>-1;i--){\\n for( int id : Ts[i] ) {\\n G[--cur] = id;\\n }\\n for( int id : Te[i] ) {\\n nx[id] = cur;\\n }\\n }\\n\\n \\n\\n fill( dp[0], dp[N], 0 );\\n for(int i=0;i<=N;i++){\\n for(int j=0;j<=N;j++){\\n int a = G[i], b = G[j];\\n if( i == j ) {\\n if( i == N ) continue;\\n update( dp[i+1][j+1], dp[i][j] );\\n update( dp[nx[a]][j+1], dp[i][j] + S1[a] );\\n update( dp[i+1][nx[b]], dp[i][j] + S2[b] );\\n } else if( i < j ) {\\n update( dp[i+1][j], dp[i][j] );\\n update( dp[nx[a]][j], dp[i][j] + S1[a] );\\n } else {\\n update( dp[i][j+1], dp[i][j] );\\n update( dp[i][nx[b]], dp[i][j] + S2[b] );\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\",dp[N][N]);\\n } \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 7108,\n \"score_of_the_acc\": -0.3295,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2063_1195834\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<cmath>\\n#include<string>\\n#include<sstream>\\n#include<algorithm>\\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 ++)\\n\\nusing namespace std;\\n\\nstruct Data{\\n int start,end,onAir,recorded;\\n bool operator<(const Data &data) const{\\n if(end != data.end) return end < data.end;\\n if(start != data.start) return start < data.start;\\n return (onAir != data.onAir ) ? onAir < data.onAir : recorded < data.recorded;\\n }\\n};\\n\\nconst int MAX_N = 1100;\\nint N,dp[2000][2000],h,m;\\nvector<int> buf;\\n\\n\\nint toTime(string s){\\n rep(i,(int)s.size()) if(s[i] == ':') s[i] = ' ';\\n stringstream ss(s);\\n ss >> h >> m;\\n return h * 60 + m;\\n}\\n\\nint main(void){\\n while(cin>>N,N){\\n vector<Data> vec(N);\\n rep(i,N){\\n string a,b,c;\\n cin>>a>>b>>c>>vec[i].onAir>>vec[i].recorded;\\n vec[i].start = toTime(b); vec[i].end = toTime(c); \\n }\\n vec.push_back((Data){0,0,0,0});\\n rep(i,N+2)rep(j,N+2)dp[i][j] = 0;\\n sort(vec.begin(),vec.end());\\n buf.clear();\\n rep(i,vec.size())buf.push_back(vec[i].end);\\n rep(i,vec.size()){\\n rep(j,vec.size()){\\n if(i==j)dp[i][j] = max((i?dp[i-1][j]:0),(j?dp[i][j-1]:0));\\n else if(i<j){\\n int prev = upper_bound(buf.begin(),buf.begin()+j,vec[j].start) - buf.begin() - 1;\\n dp[i][j] = max(dp[i][j-1],((prev!=-1)?dp[i][prev]:0)+vec[j].recorded);\\n }else{\\n int prev = upper_bound(buf.begin(),buf.begin()+i,vec[i].start) - buf.begin() - 1;\\n dp[i][j] = max(dp[i-1][j],((prev!=-1)?dp[prev][j]:0)+vec[i].onAir);\\n }\\n }\\n }\\n cout<<dp[(int)vec.size()-1][(int)vec.size()-1]<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 9452,\n \"score_of_the_acc\": -0.719,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2063_1150157\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<vector>\\nusing namespace std;\\nchar in[11100];\\nvector<pair<int,pair<int,int> > >g[1500];\\nint dp[1500][1500];\\nint main(){\\n\\tint a;\\n\\twhile(scanf(\\\"%d\\\",&a),a){\\n\\t\\tfor(int i=0;i<1500;i++)g[i].clear();\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tint ph,pm,qh,qm,r,s;\\n\\t\\t\\tscanf(\\\"%s%d:%d%d:%d%d%d\\\",in,&ph,&pm,&qh,&qm,&r,&s);\\n\\t\\t\\tint p=ph*60+pm;\\n\\t\\t\\tint q=qh*60+qm;\\n\\t\\t\\tg[p].push_back(make_pair(q,make_pair(r,s)));\\n\\t\\t}\\n\\t\\tfor(int i=0;i<1500;i++)for(int j=0;j<1500;j++)\\n\\t\\t\\tdp[i][j]=-999999999;\\n\\t\\tdp[0][0]=0;\\n\\t\\tfor(int i=0;i<1450;i++){\\n\\t\\t\\tfor(int j=0;j<1450;j++){\\n\\t\\t\\t\\tif(i<j){\\n\\t\\t\\t\\t\\tdp[i+1][j]=max(dp[i+1][j],dp[i][j]);\\n\\t\\t\\t\\t\\tfor(int k=0;k<g[i].size();k++){\\n\\t\\t\\t\\t\\t\\tdp[g[i][k].first][j]=max(dp[g[i][k].first][j],dp[i][j]+g[i][k].second.first);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else if(i>j){\\n\\t\\t\\t\\t\\tdp[i][j+1]=max(dp[i][j+1],dp[i][j]);\\n\\t\\t\\t\\t\\tfor(int k=0;k<g[j].size();k++){\\n\\t\\t\\t\\t\\t\\tdp[i][g[j][k].first]=max(dp[i][g[j][k].first],dp[i][j]+g[j][k].second.second);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tdp[i+1][j]=max(dp[i+1][j],dp[i][j]);\\n\\t\\t\\t\\t\\tdp[i][j+1]=max(dp[i][j+1],dp[i][j]);\\n\\t\\t\\t\\t\\tfor(int k=0;k<g[i].size();k++)for(int l=0;l<g[i].size();l++){\\n\\t\\t\\t\\t\\t\\tif(k==l)continue;\\n\\t\\t\\t\\t\\t\\tdp[g[i][k].first][g[i][l].first]=max(dp[g[i][k].first][g[i][l].first],dp[i][j]+g[i][k].second.first+g[i][l].second.second);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint ret=0;\\n\\t\\tfor(int i=0;i<1450;i++)for(int j=0;j<1450;j++)ret=max(ret,dp[i][j]);\\n\\t\\tprintf(\\\"%d\\\\n\\\",ret);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 9908,\n \"score_of_the_acc\": -0.7926,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2063_1124192\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <climits>\\n#include <cfloat>\\n#include <map>\\n#include <utility>\\n#include <set>\\n#include <iostream>\\n#include <memory>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <functional>\\n#include <sstream>\\n#include <complex>\\n#include <stack>\\n#include <queue>\\n#include <cstring>\\nusing namespace std;\\nstatic const double EPS = 1e-9;\\ntypedef long long ll;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define rev(i,n) for(int i=n-1;i>=0;i--)\\n#define sz(a) a.size()\\n#define all(a) a.begin(),a.end()\\n#define mp(a,b) make_pair(a,b)\\n#define pb(a) push_back(a)\\n#define SS stringstream\\n#define DBG1(a) rep(_X,sz(a)){printf(\\\"%d \\\",a[_X]);}puts(\\\"\\\");\\n#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf(\\\"%d \\\",a[_X][_Y]);puts(\\\"\\\");}\\n#define bitcount(b) __builtin_popcount(b)\\n#define REP(i, s, e) for ( int i = s; i <= e; i++ ) \\n#define fi first\\n#define se second\\nint dp[1024][1024];\\nstruct Item{\\n\\tint l,r,S1,S2;\\n};\\nvector<Item> item;\\nbool operator < (const Item &a,const Item &b){\\n\\tif( a.l != b.l ) return a.l < b.l;\\n\\treturn a.r < b.r;\\n}\\n\\nint nextNode[1024];\\nint n;\\nint dfs(int x,int y){\\n\\tif( dp[x][y] != -1) return dp[x][y];\\n\\tint ans = 0;\\n\\tint xNext = nextNode[x];\\n\\tint yNext = nextNode[y];\\n\\tif( x == n && y == n ) return 0;\\n\\telse if( x == n ){\\n\\t\\treturn dp[x][y] = max( dfs(x,y+1) , dfs(x,yNext)+item[y].S2 );\\n\\t}else if( y == n){\\n\\t\\treturn dp[x][y] = max( dfs(x+1,y) , dfs(xNext,y)+item[x].S1 );\\n\\t}\\n\\tif( y < x ){\\n\\t\\tans = max( ans , dfs(x,y+1) );\\n\\t\\tans = max( ans , dfs(x,yNext) + item[y].S2 );\\n\\t}else if( x == y ){\\n\\t\\tans = max( ans , dfs(x+1,y+1) );\\n\\t\\tans = max( ans , dfs(xNext,y+1) + item[x].S1);\\n\\t\\tans = max( ans , dfs(x+1,yNext) + item[y].S2);\\n\\t}else{\\n\\t\\tans = max( ans , dfs(x+1,y) );\\n\\t\\tans = max( ans , dfs(xNext,y) + item[x].S1 );\\n\\t}\\n\\treturn dp[x][y] = ans;\\n}\\n\\n\\nint conv(string t){\\n\\tt[2] = ' ';\\n\\tstringstream ss(t);\\n\\tint h,m;\\n\\tss >> h >> m;\\n\\t\\n\\treturn h * 60 + m;\\n}\\n\\nint main(){\\n\\twhile(cin >> n && n){\\n\\t\\tmemset(dp,-1,sizeof(dp));\\n\\t\\titem.clear();\\n\\t\\tfor(int i = 0 ; i < n ; i++){\\n\\t\\t\\tstring nm;\\n\\t\\t\\tstring a,b;\\n\\t\\t\\tcin >> nm >> a >> b;\\n\\t\\t\\tint r1,r2;\\n\\t\\t\\tcin >> r1 >> r2;\\n\\t\\t\\titem.push_back({conv(a),conv(b),r1,r2});\\n\\t\\t\\t//cout << a << \\\" \\\" << b << endl;\\n\\t\\t}\\n\\t\\tsort(item.begin(),item.end());\\n\\t\\tfor(int i = 0 ; i < n ; i++){\\n\\t\\t\\tnextNode[i] = n;\\n\\t\\t\\tfor(int j = i+1 ; j < n ; j++)\\n\\t\\t\\t\\tif( item[i].r <= item[j].l ){\\n\\t\\t\\t\\t\\tnextNode[i] = j;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << dfs(0,0) << endl;\\n\\t}\\n\\t\\n\\t\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5456,\n \"score_of_the_acc\": -0.0888,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2063_1059969\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nusing namespace std;\\n\\nstruct Data {\\n int start,end,onAir,recorded;\\n bool operator < ( const Data &data ) const {\\n if( end != data.end ) return end < data.end;\\n if( start != data.start ) return start < data.start;\\n return ( onAir != data.onAir ) ? onAir < data.onAir : recorded < data.recorded;\\n }\\n};\\n\\nconst int MAX_N = 1100;\\nint N,dp[2000][2000],h,m;\\nvector<int> buf;\\n\\nint toTime(string s){\\n rep(i,(int)s.size()) if( s[i] == ':' ) s[i] = ' ';\\n stringstream ss(s);\\n ss >> h >> m;\\n return h * 60 + m;\\n}\\n\\nint main(){\\n while( cin >> N, N ){\\n vector<Data> vec(N);\\n rep(i,N) {\\n string a,b,c;\\n cin >> a >> b >> c >> vec[i].onAir >> vec[i].recorded;\\n vec[i].start = toTime(b), vec[i].end = toTime(c);\\n }\\n vec.push_back((Data){0,0,0,0});\\n rep(i,N+2) rep(j,N+2) dp[i][j] = 0; \\n sort(vec.begin(),vec.end());\\n buf.clear();\\n rep(i,vec.size()) buf.push_back(vec[i].end);\\n rep(i,vec.size()){\\n rep(j,vec.size()){\\n if( i == j ) dp[i][j] = max((i?dp[i-1][j]:0),(j?dp[i][j-1]:0));\\n else if( i < j ) {\\n int prev = upper_bound(buf.begin(),buf.begin()+j,vec[j].start) - buf.begin() - 1;\\n dp[i][j] = max(dp[i][j-1],((prev!=-1)?dp[i][prev]:0)+vec[j].recorded);\\n } else {\\n int prev = upper_bound(buf.begin(),buf.begin()+i,vec[i].start) - buf.begin() - 1;\\n dp[i][j] = max(dp[i-1][j],((prev!=-1)?dp[prev][j]:0)+vec[i].onAir);\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\",dp[(int)vec.size()-1][(int)vec.size()-1]);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 9448,\n \"score_of_the_acc\": -0.7145,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2063_1059964\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nusing namespace std;\\n\\nstruct Data {\\n int start,end,onAir,recorded;\\n bool operator < ( const Data &data ) const {\\n if( end != data.end ) return end < data.end;\\n if( start != data.start ) return start < data.start;\\n return ( onAir != data.onAir ) ? onAir < data.onAir : recorded < data.recorded;\\n }\\n};\\n\\nconst int MAX_N = 1100;\\nint N,dp[2000][2000],h,m;\\nvector<int> buf;\\n\\nint toTime(string s){\\n rep(i,(int)s.size()) if( s[i] == ':' ) s[i] = ' ';\\n stringstream ss(s);\\n ss >> h >> m;\\n return h * 60 + m;\\n}\\n\\nint main(){\\n while( cin >> N, N ){\\n vector<Data> vec(N);\\n rep(i,N) {\\n string a,b,c;\\n cin >> a >> b >> c >> vec[i].onAir >> vec[i].recorded;\\n vec[i].start = toTime(b), vec[i].end = toTime(c);\\n }\\n vec.push_back((Data){0,0,0,0});\\n rep(i,N+2) rep(j,N+2) dp[i][j] = 0; \\n sort(vec.begin(),vec.end());\\n buf.clear();\\n rep(i,vec.size()) buf.push_back(vec[i].end);\\n rep(i,vec.size()){\\n rep(j,vec.size()){\\n if( i == j ) dp[i][j] = max((i?dp[i-1][j]:0),(j?dp[i][j-1]:0));\\n else if( i < j ) {\\n dp[i][j] = dp[i][j-1];\\n int prev = upper_bound(buf.begin(),buf.begin()+j,vec[j].start) - buf.begin() - 1;\\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[i][prev]:0)+vec[j].recorded);\\n } else {\\n dp[i][j] = dp[i-1][j];\\n int prev = upper_bound(buf.begin(),buf.begin()+i,vec[i].start) - buf.begin() - 1;\\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[prev][j]:0)+vec[i].onAir);\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\",dp[(int)vec.size()-1][(int)vec.size()-1]);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 9448,\n \"score_of_the_acc\": -0.7184,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2063_1059950\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nusing namespace std;\\n\\nstruct Data {\\n int start,end,onAir,recorded;\\n bool operator < ( const Data &data ) const {\\n if( end != data.end ) return end < data.end;\\n if( start != data.start ) return start < data.start;\\n return ( onAir != data.onAir ) ? onAir < data.onAir : recorded < data.recorded;\\n }\\n};\\n\\nconst int MAX_N = 1100;\\nconst int IINF = INT_MAX;\\nint N,dp[2000][2000],h,m;\\nvector<int> buf;\\n\\nint toTime(string s){\\n rep(i,(int)s.size()) if( s[i] == ':' ) s[i] = ' ';\\n stringstream ss(s);\\n ss >> h >> m;\\n return h * 60 + m;\\n}\\n\\nint main(){\\n while( cin >> N, N ){\\n vector<Data> vec(N);\\n rep(i,N) {\\n string a,b,c;\\n cin >> a >> b >> c >> vec[i].onAir >> vec[i].recorded;\\n vec[i].start = toTime(b), vec[i].end = toTime(c);\\n }\\n vec.push_back((Data){0,0,0,0});\\n rep(i,N+2) rep(j,N+2) dp[i][j] = 0; \\n sort(vec.begin(),vec.end());\\n buf.clear();\\n int maxi = 0;\\n rep(i,vec.size()) buf.push_back(vec[i].end);\\n rep(i,vec.size()){\\n rep(j,vec.size()){\\n if( i == j ) dp[i][j] = max((i?dp[i-1][j]:0),(j?dp[i][j-1]:0));\\n else if( i < j ) {\\n dp[i][j] = dp[i][j-1];\\n int prev = upper_bound(buf.begin(),buf.begin()+j,vec[j].start) - buf.begin() - 1;\\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[i][prev]:0)+vec[j].recorded);\\n } else {\\n dp[i][j] = dp[i-1][j];\\n int prev = upper_bound(buf.begin(),buf.begin()+i,vec[i].start) - buf.begin() - 1;\\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[prev][j]:0)+vec[i].onAir);\\n }\\n maxi = max(maxi,dp[i][j]);\\n }\\n }\\n printf(\\\"%d\\\\n\\\",maxi);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 9448,\n \"score_of_the_acc\": -0.7184,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2063_1059947\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nusing namespace std;\\n\\nstruct Data {\\n int start,end,onAir,recorded;\\n bool operator < ( const Data &data ) const {\\n if( end != data.end ) return end < data.end;\\n if( start != data.start ) return start < data.start;\\n return ( onAir != data.onAir ) ? onAir < data.onAir : recorded < data.recorded;\\n }\\n};\\n\\nconst int MAX_N = 1100;\\nconst int IINF = INT_MAX;\\nint N,s[MAX_N],t[MAX_N],score[MAX_N][2],dp[2000][2000];\\nvector<int> buf;\\n\\nint toTime(string s){\\n rep(i,(int)s.size()) if( s[i] == ':' ) s[i] = ' ';\\n stringstream ss;\\n ss << s;\\n int h,m;\\n ss >> h >> m;\\n return h * 60 + m;\\n}\\n\\nint main(){\\n while( cin >> N, N ){\\n vector<Data> vec;\\n rep(i,N) {\\n string a,b,c;\\n cin >> a >> b >> c >> score[i][0] >> score[i][1];\\n assert( b != c );\\n s[i] = toTime(b), t[i] = toTime(c);\\n vec.push_back((Data){s[i],t[i],score[i][0],score[i][1]});\\n }\\n vec.push_back((Data){0,0,0,0});\\n vec.push_back((Data){IINF,IINF,0,0});\\n rep(i,N+2) rep(j,N+2) dp[i][j] = 0; \\n sort(vec.begin(),vec.end());\\n buf.clear();\\n int maxi = 0;\\n rep(i,vec.size()) buf.push_back(vec[i].end);\\n rep(i,vec.size()){\\n rep(j,vec.size()){\\n if( i == j ) {\\n dp[i][j] = max((i?dp[i-1][j]:0),(j?dp[i][j-1]:0));\\n } else if( i < j ) {\\n dp[i][j] = dp[i][j-1];\\n int prev = upper_bound(buf.begin(),buf.begin()+j,vec[j].start) - buf.begin() - 1;\\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[i][prev]:0)+vec[j].recorded);\\n } else {\\n dp[i][j] = dp[i-1][j];\\n int prev = upper_bound(buf.begin(),buf.begin()+i,vec[i].start) - buf.begin() - 1;\\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[prev][j]:0)+vec[i].onAir);\\n }\\n maxi = max(maxi,dp[i][j]);\\n }\\n }\\n cout << maxi << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 9476,\n \"score_of_the_acc\": -0.7227,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2063_1059946\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nusing namespace std;\\n\\nstruct Data {\\n int start,end,onAir,recorded;\\n bool operator < ( const Data &data ) const {\\n if( end != data.end ) return end < data.end;\\n if( start != data.start ) return start < data.start;\\n return ( onAir != data.onAir ) ? onAir < data.onAir : recorded < data.recorded;\\n }\\n};\\n\\nconst int MAX_N = 1100;\\nconst int IINF = INT_MAX;\\nint N,s[MAX_N],t[MAX_N],score[MAX_N][2],dp[2000][2000];\\nvector<int> buf;\\n\\nint toTime(string s){\\n rep(i,(int)s.size()) if( s[i] == ':' ) s[i] = ' ';\\n stringstream ss;\\n ss << s;\\n int h,m;\\n ss >> h >> m;\\n return h * 60 + m;\\n}\\n\\nint main(){\\n while( cin >> N, N ){\\n vector<Data> vec;\\n rep(i,N) {\\n string a,b,c;\\n cin >> a >> b >> c >> score[i][0] >> score[i][1];\\n assert( b != c );\\n s[i] = toTime(b), t[i] = toTime(c);\\n vec.push_back((Data){s[i],t[i],score[i][0],score[i][1]});\\n }\\n vec.push_back((Data){0,0,0,0});\\n vec.push_back((Data){IINF,IINF,0,0});\\n rep(i,N+2) rep(j,N+2) dp[i][j] = 0; \\n sort(vec.begin(),vec.end());\\n buf.clear();\\n int maxi = 0;\\n rep(i,vec.size()) buf.push_back(vec[i].end);\\n rep(i,vec.size()){\\n rep(j,vec.size()){\\n if( i == j ) {\\n dp[i][j] = max((i?dp[i-1][j]:0),(j?dp[i][j-1]:0));\\n } else if( i < j ) {\\n dp[i][j] = dp[i][j-1];\\n int prev = upper_bound(buf.begin(),buf.begin()+j,vec[j].start) - buf.begin();\\n if( buf[prev] > vec[j].start ) --prev;\\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[i][prev]:0)+vec[j].recorded);\\n } else {\\n dp[i][j] = dp[i-1][j];\\n int prev = upper_bound(buf.begin(),buf.begin()+i,vec[i].start) - buf.begin();\\n if( buf[prev] > vec[i].start ) --prev;\\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[prev][j]:0)+vec[i].onAir);\\n }\\n maxi = max(maxi,dp[i][j]);\\n }\\n }\\n cout << maxi << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 9476,\n \"score_of_the_acc\": -0.7227,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2063_1059944\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nusing namespace std;\\n\\nstruct Data {\\n int start,end,onAir,recorded;\\n bool operator < ( const Data &data ) const {\\n if( end != data.end ) return end < data.end;\\n if( start != data.start ) return start < data.start;\\n return ( onAir != data.onAir ) ? onAir < data.onAir : recorded < data.recorded;\\n }\\n};\\n\\nconst int MAX_N = 1100;\\nconst int IINF = INT_MAX;\\nint N,s[MAX_N],t[MAX_N],score[MAX_N][2],dp[2000][2000];\\nvector<int> buf;\\n\\nint toTime(string s){\\n rep(i,(int)s.size()) if( s[i] == ':' ) s[i] = ' ';\\n stringstream ss;\\n ss << s;\\n int h,m;\\n ss >> h >> m;\\n return h * 60 + m;\\n}\\n\\nint main(){\\n while( cin >> N, N ){\\n vector<Data> vec;\\n rep(i,N) {\\n string a,b,c;\\n cin >> a >> b >> c >> score[i][0] >> score[i][1];\\n assert( b != c );\\n s[i] = toTime(b), t[i] = toTime(c);\\n vec.push_back((Data){s[i],t[i],score[i][0],score[i][1]});\\n }\\n vec.push_back((Data){0,0,0,0});\\n vec.push_back((Data){IINF,IINF,0,0});\\n rep(i,N+2) rep(j,N+2) dp[i][j] = 0; \\n sort(vec.begin(),vec.end());\\n //rep(i,vec.size()) cout << \\\"[\\\" <<vec[i].start << \\\",\\\" << vec[i].end << \\\"] : \\\" << vec[i].onAir << \\\" and \\\" << vec[i].recorded << endl;\\n buf.clear();\\n int maxi = 0;\\n rep(i,vec.size()) buf.push_back(vec[i].end);\\n rep(i,vec.size()){\\n rep(j,vec.size()){\\n if( i == j ) {\\n dp[i][j] = max((i?dp[i-1][j]:0),(j?dp[i][j-1]:0));\\n } else if( i < j ) {\\n dp[i][j] = dp[i][j-1];\\n int prev = upper_bound(buf.begin(),buf.begin()+j,vec[j].start) - buf.begin();\\n //if( prev == j ) -- prev;\\n if( buf[prev] > vec[j].start ) --prev;\\n\\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[i][prev]:0)+vec[j].recorded);\\n } else {\\n dp[i][j] = dp[i-1][j];\\n int prev = upper_bound(buf.begin(),buf.begin()+i,vec[i].start) - buf.begin();\\n //if( prev == i ) -- prev;\\n if( buf[prev] > vec[i].start ) --prev;\\n dp[i][j] = max(dp[i][j],((prev!=-1)?dp[prev][j]:0)+vec[i].onAir);\\n }\\n maxi = max(maxi,dp[i][j]);\\n //cout << \\\"dp[\\\" << i << \\\"][\\\" << j << \\\"] = \\\" << dp[i][j] << endl;\\n }\\n }\\n cout << maxi << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 9476,\n \"score_of_the_acc\": -0.7227,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2063_613129\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\\\" \\\"; cerr<<endl; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\ntypedef pair<int, int> P;\\nstruct TV{\\n P time;\\n int r1, r2;\\n bool operator < (const TV& t) const{\\n return time < t.time;\\n }\\n TV() {}\\n TV(int f) { time = P(f, 0); }\\n};\\nvoid update(int& x, int y){\\n if(x < y) x = y;\\n}\\n\\nint main(){\\n int N;\\n while(cin >> N && N){\\n int dp[1001][1001] = {};\\n vector<TV> tv(N);\\n REP(i, N){\\n char tmp[100];\\n int a, b, c, d;\\n scanf(\\\"%s %d:%d %d:%d %d %d\\\", tmp, &a, &b, &c, &d, &tv[i].r1, &tv[i].r2);\\n tv[i].time = P(a * 60 + b , c * 60 + d);\\n }\\n sort(tv.begin(), tv.end());\\n for(int i = 0; i <= N; i++){\\n for(int j = 0; j <= N; j++){\\n if(i < N){\\n int ni = lower_bound(tv.begin(), tv.end(), TV(tv[i].time.second)) - tv.begin();\\n update(dp[ni][max(i + 1, j)], dp[i][j] + tv[i].r1);\\n update(dp[i + 1][j], dp[i][j]);\\n }\\n if(j < N){\\n int nj = lower_bound(tv.begin(), tv.end(), TV(tv[j].time.second)) - tv.begin();\\n update(dp[max(j + 1, i)][nj], dp[i][j] + tv[j].r2);\\n update(dp[i][j + 1], dp[i][j]);\\n }\\n }\\n }\\n cout << dp[N][N] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 5184,\n \"score_of_the_acc\": -0.1296,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2063_472724\",\n \"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\\nclass Data\\n{\\npublic:\\n int t1, t2, r1, r2;\\n bool operator< (const Data& d) const{\\n return t1 < d.t1;\\n }\\n};\\n\\nint n;\\nvector<Data> d;\\nvector<int> nextTV;\\n\\nvector<vector<int> > memo;\\n\\nint solve(int a, int b)\\n{\\n if(a == n+1 || b == n+1)\\n return 0;\\n if(a == n && b == n)\\n return 0;\\n if(memo[a][b] != -1)\\n return memo[a][b];\\n\\n int ret = 0;\\n ret = max(ret, solve(a, b+1));\\n ret = max(ret, solve(a+1, b));\\n if(a == b){\\n ret = max(ret, d[a].r1 + solve(nextTV[a], b+1));\\n ret = max(ret, d[b].r2 + solve(a+1, nextTV[b]));\\n }else if(a > b){\\n ret = max(ret, d[b].r2 + solve(a, nextTV[b]));\\n }else{\\n ret = max(ret, d[a].r1 + solve(nextTV[a], b));\\n }\\n\\n return memo[a][b] = ret;\\n}\\n\\nint main()\\n{\\n for(;;){\\n cin >> n;\\n if(n == 0)\\n return 0;\\n\\n d.resize(n+1);\\n for(int i=0; i<n; ++i){\\n string s;\\n int h1, m1, h2, m2;\\n char c;\\n cin >> s >> h1 >> c >> m1 >> h2 >> c >> m2 >> d[i].r1 >> d[i].r2;\\n d[i].t1 = h1 * 60 + m1;\\n d[i].t2 = h2 * 60 + m2;\\n }\\n d[n].t1 = INT_MAX / 2;\\n d[n].t2 = INT_MAX / 2 + 1;\\n d[n].r1 = d[n].r2 = 0;\\n sort(d.begin(), d.end());\\n\\n nextTV.resize(n+1);\\n for(int i=0; i<=n; ++i){\\n Data tmp;\\n tmp.t1 = d[i].t2;\\n nextTV[i] = lower_bound(d.begin(), d.end(), tmp) - d.begin();\\n }\\n\\n memo.assign(n+1, vector<int>(n+1, -1));\\n cout << solve(0, 0) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 4952,\n \"score_of_the_acc\": -0.0353,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1090,"cells":{"group_id":{"kind":"string","value":"aoj_2066_cpp"},"problem_description":{"kind":"string","value":"Problem I:\nRoads in a City\nRoads in a city play important roles in development of the city. Once a road is built, people start their\nliving around the road. A broader road has a bigger capacity, that is, people can live on a wider area\naround the road.\nInterstellar Conglomerate of Plantation and Colonization (ICPC) is now planning to develop roads on\na new territory. The new territory is a square and is completely clear. ICPC has already made several\nplans, but there are some difficulties in judging which plan is the best.\nTherefore, ICPC has collected several great programmers including you, and asked them to write programs\nthat compute several metrics for each plan. Fortunately your task is a rather simple one. You are asked to\ncompute the area where people can live from the given information about the locations and the capacities\nof the roads.\nThe following figure shows the first plan given as the sample input.\nFigure 1: The first plan given as the sample input\nInput\nThe input consists of a number of plans. The first line of each plan denotes the number\nn\nof roads\n(\nn\n≤ 50), and the following\nn\nlines provide five integers\nx\n1\n,\ny\n1\n,\nx\n2\n,\ny\n2\n, and\nr\n, separated by a space.\n(\nx\n1\n,\ny\n1\n) and (\nx\n2\n,\ny\n2\n) denote the two endpoints of a road (-15 ≤\nx\n1\n,\ny\n1\n,\nx\n2\n,\ny\n2\n≤ 15), and the value\nr\ndenotes the capacity that is represented by the maximum distance from the road where people can live\n(\nr\n≤ 10).\nThe end of the input is indicated by a line that contains only a single zero.\nThe territory is located at -5 ≤\nx\n,\ny\n≤ 5. You may assume that each road forms a straight line segment\nand that any lines do not degenerate.\nOutput\nPrint the area where people can live in one line for each plan. You may print an arbitrary number of\ndigits after the decimal points, provided that difference from the exact answer is not greater than 0.01.\nSample Input\n2\n0 -12 0 0 2\n0 0 12 0 2\n0\nOutput for the Sample Input\n39.14159"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2066_5469291","code_snippet":"#include <bits/stdc++.h>\n#include <stdlib.h>\n#include <cassert>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vec;\n\n#define _GLIBCXX_DEBUG\n#define REP(i,a,b) for(int i=(int)a;i<(int)b;i++)\n#define rep(i,n) REP(i,0,n)\n#define pb push_back\n\n\nstruct Vec2{\n double x;\n double y;\n Vec2(double X, double Y) : x(X), y(Y) {}\n bool operator==(const Vec2& rhs) const{\n return x==rhs.x ? y==rhs.y : false;\n }\n\n bool operator!=(const Vec2& rhs) const{\n return (*this)==rhs ? false: true;\n }\n Vec2 operator=(const Vec2& rhs){\n x=rhs.x; y=rhs.y;\n return (*this);\n }\n Vec2 operator+(const Vec2& rhs) const{\n return Vec2(this->x+rhs.x, this->y+rhs.y);\n }\n Vec2 operator-(const Vec2& rhs) const{\n return Vec2(this->x-rhs.x, this->y-rhs.y);\n }\n Vec2 operator*(const double &rhs) const{\n return Vec2(this->x*rhs,this->y*rhs);\n }\n\n Vec2 operator/(const double &rhs) const{\n assert(rhs>0);\n return Vec2(this->x/rhs,this->y/rhs);\n }\n \n double operator*(const Vec2 &rhs) const{\n return this->x*rhs.x+this->y*rhs.y;\n }\n \n};\ndouble length(const Vec2 &a){\n return sqrt(a*a);\n}\n\nVec2 normalize(const Vec2 &a){\n double len=length(a);\n return len>0 ? a/len : a;\n}\n\nVec2 sui(const Vec2 &a){\n Vec2 aa=normalize(a);\n return Vec2(aa.y,-aa.x);\n}\n\nconst double OUT=5000000;\n\ndouble given_x(Vec2 a, Vec2 b, double xx, bool senbun=true);\ndouble given_y(Vec2 a, Vec2 b, double yy, bool senbun=true);\n\nstruct circle{\n Vec2 mid;\n double r;\n circle(Vec2 mid_, double r_):mid(mid_),r(r_){}\n bool inside(Vec2 p) const{\n return length(p-mid)<r;\n }\n};\n\nstruct rectangle{\n Vec2 a;\n Vec2 b;\n double r;\n vector<Vec2> corners;\n rectangle(Vec2 a_, Vec2 b_, double r_) : a(a_), b(b_), r(r_){\n Vec2 s=sui(b-a)*r;\n corners.pb(a+s);\n corners.pb(a-s);\n corners.pb(b-s);\n corners.pb(b+s);\n }\n void print() const{\n cout<<\"rectangle is \";\n for(auto e: corners) cout<<e.x<<' '<<e.y<<\", \";\n cout<<endl;\n }\n};\n\nstruct square{\n Vec2 mid;\n double len;\n vector<Vec2> corners;\n double xl,xu,yl,yu;\n square(Vec2 mid_,double len_):mid(mid_),len(len_) ,xl(mid.x-len/2), xu(mid.x+len/2), yl(mid.y-len/2), yu(mid.y+len/2) {\n corners.pb(Vec2(xl,yl));\n corners.pb(Vec2(xu,yl));\n corners.pb(Vec2(xu,yu));\n corners.pb(Vec2(xl,yu));\n }\n bool inside(Vec2 p) const{\n if(abs(p.x-mid.x)>len/2) return false;\n if(abs(p.y-mid.y)>len/2) return false;\n return true;\n }\n\n int judge(const circle &c) const{\n bool memo=c.inside(corners[0]);\n REP(i,1,4) if(memo!=c.inside(corners[i])) return 0; //0は混在\n if(memo) return 1; // 1は完全に含まれている\n if(length(this->mid-c.mid)<c.r+len/2) return 0;\n return -1;\n }\n\n int judge(const rectangle &c) const;\n void print() const{\n cout<<\"square is \";\n for(auto e: corners) cout<<e.x<<' '<<e.y<<\", \";\n cout<<endl;\n }\n};\n\n\n\ndouble given_x(Vec2 a, Vec2 b, double xx, bool senbun){\n if(senbun && a.x>xx && b.x>xx) return OUT;\n if(senbun && a.x<xx && b.x<xx) return OUT;\n if(a.x==xx) return a.y;\n if(b.x==xx) return b.y;\n double Y=b.y-a.y, X=b.x-a.x, XX=xx-a.x;\n if(!X) return a.y+Y/2;\n return a.y+Y*XX/X;\n}\n\ndouble given_y(Vec2 a, Vec2 b, double yy, bool senbun){\n if(senbun && a.y>yy && b.y>yy) return OUT;\n if(senbun && a.y<yy && b.y<yy) return OUT;\n if(a.y==yy) return a.x;\n if(b.y==yy) return b.x;\n double Y=b.y-a.y, X=b.x-a.x, YY=yy-a.y;\n if(!Y) return a.x+X/2;\n return a.x+X*YY/Y;\n}\nbool cross(square s, Vec2 a, Vec2 b){\n if(a.x<s.xl && b.x<s.xl) return false;\n if(a.x>s.xu && b.x>s.xu) return false;\n if(a.y<s.yl && b.y<s.yl) return false;\n if(a.y>s.yu && b.y>s.yu) return false;\n if(a.x==b.x) return true;\n if(a.y==b.y) return true;\n double XL=given_x(a,b,s.xl);\n if(s.yl<=XL && XL<=s.yu) return true;\n double XU=given_x(a,b,s.xu);\n if(s.yl<=XU && XU<=s.yu) return true;\n double YL=given_y(a,b,s.yl);\n if(s.xl<=YL && YL<=s.xu) return true;\n double YU=given_y(a,b,s.yu);\n if(s.xl<=YU && YU<=s.xu) return true;\n return false;\n}\n\nint square::judge(const rectangle &c) const{\n rep(i,4) if(this->inside(c.corners[i])) return 0;\n rep(i,4) if(cross((*this),c.corners[i],c.corners[(i+1)%4])) return 0;\n double big=OUT,small=OUT;\n rep(i,4) {\n auto tmp=given_x(c.corners[i], c.corners[(i+1)%4], xl);\n if(c.corners[i].x!=xl || c.corners[(i+1)%4].x!=xl) {\n if(tmp!=OUT){\n if(tmp>=yu) big=tmp;\n if(tmp<=yl) small=tmp;\n }\n }\n }\n /*this->print();\n c.print();\n cout<<big<<' '<<small<<endl;*/\n if(big==OUT) return -1;\n if(small==OUT) return -1;\n return 1;\n}\n\n\ndouble smallest=(1e-8);\n\nstruct one_question{\n ll N,R,C; \n vector<rectangle> rec;\n vector<circle> cir;\n \n one_question(ll N_) :N(N_){\n rep(i,N){\n double a,b,c,d,r; cin>>a>>b>>c>>d>>r;\n Vec2 A(a,b), B(c,d);\n cir.pb(circle(A,r));\n if(A!=B){\n cir.pb(circle(B,r));\n rec.pb(rectangle(A,B,r));\n }\n }\n R=rec.size(); C=cir.size();\n }\n double Solve(const square& s, vec rec_memo, vec cir_memo){\n double full=s.len*s.len;\n if(full<=smallest) return full/2;\n bool nothing=true;\n rep(i,R) if(!rec_memo[i]){\n rec_memo[i]=s.judge(rec[i]);\n if(rec_memo[i]==1) return full;\n if(rec_memo[i]==0) nothing=false;\n }\n rep(i,C) if(!cir_memo[i]){\n cir_memo[i]=s.judge(cir[i]);\n if(cir_memo[i]==1) return full;\n if(cir_memo[i]==0) nothing=false;\n }\n if(nothing) return 0;\n double ret=0;\n rep(i,4){\n square tmp((s.mid+s.corners[i])/2,s.len/2);\n ret+=Solve(tmp,rec_memo,cir_memo);\n }\n return ret;\n\n }\n double ans(){\n square start(Vec2(0,0),10);\n vec rec_memo(R,0);\n vec cir_memo(C,0);\n return Solve(start,rec_memo,cir_memo);\n }\n\n};\n \n\nint main(){\n vector<double> ret;\n while(true){\n ll n; cin>>n;\n if(!n) break;\n one_question tmp(n);\n ret.pb(tmp.ans());\n }\n for(auto e: ret) cout<<setprecision(8)<<e<<endl;\n}","accuracy":1,"time_ms":1870,"memory_kb":3616,"score_of_the_acc":-2,"final_rank":5},{"submission_id":"aoj_2066_5469258","code_snippet":"#include <bits/stdc++.h>\n#include <stdlib.h>\n#include <cassert>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\ntypedef vector<double> Vec;\ntypedef vector<Vec> Mat;\ntypedef pair<ll,ll> P;\ntypedef pair<double,ll> Pd;\ntypedef pair<double,double> PD;\ntypedef priority_queue<P,vector<P>,greater<P> > P_queue;\ntypedef priority_queue<Pd,vector<Pd>,greater<Pd> > Pd_queue;\n\nconst ll MOD=998244353;\nconst ll mod=1000000007;\nconst ll INF=1e15;\nconst ll MAXINF=9223372036854775806;\nconst double DEL=1e-7;\nconst double PI=3.14159265359;\n\n#define _GLIBCXX_DEBUG\n#define REP(i,a,b) for(int i=(int)a;i<(int)b;i++)\n#define rep(i,n) REP(i,0,n)\n#define pb push_back\n#define mp make_pair\n#define ALL(a) a.begin(),a.end()\n#define SORT(a) sort(ALL(a))\n#define U_ERASE(V) V.erase(unique(ALL(V)), V.end());\n\n\n\n\n\nstruct Vec2{\n double x;\n double y;\n Vec2(double X, double Y) : x(X), y(Y) {}\n Vec2(PD a):x(a.first), y(a.second) {}\n bool operator==(const Vec2& rhs) const{\n return x==rhs.x ? y==rhs.y : false;\n }\n\n bool operator!=(const Vec2& rhs) const{\n return (*this)==rhs ? false: true;\n }\n Vec2 operator=(const Vec2& rhs){\n x=rhs.x; y=rhs.y;\n return (*this);\n }\n Vec2 operator+(const Vec2& rhs) const{\n return Vec2(this->x+rhs.x, this->y+rhs.y);\n }\n Vec2 operator-(const Vec2& rhs) const{\n return Vec2(this->x-rhs.x, this->y-rhs.y);\n }\n Vec2 operator*(const double &rhs) const{\n return Vec2(this->x*rhs,this->y*rhs);\n }\n\n Vec2 operator/(const double &rhs) const{\n assert(rhs>0);\n return Vec2(this->x/rhs,this->y/rhs);\n }\n double operator*(const Vec2 &rhs) const{\n return this->x*rhs.x+this->y*rhs.y;\n }\n \n};\ndouble length(const Vec2 &a){\n return sqrt(a*a);\n}\n\nVec2 normalize(const Vec2 &a){\n double len=length(a);\n return len>0 ? a/len : a;\n}\n\nVec2 sui(const Vec2 &a){\n Vec2 aa=normalize(a);\n return Vec2(aa.y,-aa.x);\n}\n\nconst double OUT=5000000;\n\ndouble given_x(Vec2 a, Vec2 b, double xx, bool senbun=true);\ndouble given_y(Vec2 a, Vec2 b, double yy, bool senbun=true);\n\nstruct circle{\n Vec2 mid;\n double r;\n circle(Vec2 mid_, double r_):mid(mid_),r(r_){}\n bool inside(Vec2 p) const{\n return length(p-mid)<r;\n }\n};\n\nstruct rectangle{\n Vec2 a;\n Vec2 b;\n double r;\n vector<Vec2> corners;\n rectangle(Vec2 a_, Vec2 b_, double r_) : a(a_), b(b_), r(r_){\n Vec2 s=sui(b-a)*r;\n corners.pb(a+s);\n corners.pb(a-s);\n corners.pb(b-s);\n corners.pb(b+s);\n }\n void print() const{\n cout<<\"rectangle is \";\n for(auto e: corners) cout<<e.x<<' '<<e.y<<\", \";\n cout<<endl;\n }\n};\n\nstruct square{\n Vec2 mid;\n double len;\n vector<Vec2> corners;\n double xl,xu,yl,yu;\n square(Vec2 mid_,double len_):mid(mid_),len(len_) ,xl(mid.x-len/2), xu(mid.x+len/2), yl(mid.y-len/2), yu(mid.y+len/2) {\n corners.pb(Vec2(xl,yl));\n corners.pb(Vec2(xu,yl));\n corners.pb(Vec2(xu,yu));\n corners.pb(Vec2(xl,yu));\n }\n bool inside(Vec2 p) const{\n if(abs(p.x-mid.x)>len/2) return false;\n if(abs(p.y-mid.y)>len/2) return false;\n return true;\n }\n\n int judge(const circle &c) const{\n bool memo=c.inside(corners[0]);\n REP(i,1,4) if(memo!=c.inside(corners[i])) return 0; //0は混在\n if(memo) return 1; // 1は完全に含まれている\n if(length(this->mid-c.mid)<c.r+len/2) return 0;\n return -1;\n }\n\n int judge(const rectangle &c) const;\n void print() const{\n cout<<\"square is \";\n for(auto e: corners) cout<<e.x<<' '<<e.y<<\", \";\n cout<<endl;\n }\n};\n\n\n\ndouble given_x(Vec2 a, Vec2 b, double xx, bool senbun){\n if(senbun && a.x>xx && b.x>xx) return OUT;\n if(senbun && a.x<xx && b.x<xx) return OUT;\n if(a.x==xx) return a.y;\n if(b.x==xx) return b.y;\n double Y=b.y-a.y, X=b.x-a.x, XX=xx-a.x;\n if(!X) return a.y+Y/2;\n return a.y+Y*XX/X;\n}\n\ndouble given_y(Vec2 a, Vec2 b, double yy, bool senbun){\n if(senbun && a.y>yy && b.y>yy) return OUT;\n if(senbun && a.y<yy && b.y<yy) return OUT;\n if(a.y==yy) return a.x;\n if(b.y==yy) return b.x;\n double Y=b.y-a.y, X=b.x-a.x, YY=yy-a.y;\n if(!Y) return a.x+X/2;\n return a.x+X*YY/Y;\n}\nbool cross(square s, Vec2 a, Vec2 b){\n if(a.x<s.xl && b.x<s.xl) return false;\n if(a.x>s.xu && b.x>s.xu) return false;\n if(a.y<s.yl && b.y<s.yl) return false;\n if(a.y>s.yu && b.y>s.yu) return false;\n if(a.x==b.x) return true;\n if(a.y==b.y) return true;\n double XL=given_x(a,b,s.xl);\n if(s.yl<=XL && XL<=s.yu) return true;\n double XU=given_x(a,b,s.xu);\n if(s.yl<=XU && XU<=s.yu) return true;\n double YL=given_y(a,b,s.yl);\n if(s.xl<=YL && YL<=s.xu) return true;\n double YU=given_y(a,b,s.yu);\n if(s.xl<=YU && YU<=s.xu) return true;\n return false;\n}\n\nint square::judge(const rectangle &c) const{\n rep(i,4) if(this->inside(c.corners[i])) return 0;\n rep(i,4) if(cross((*this),c.corners[i],c.corners[(i+1)%4])) return 0;\n double big=OUT,small=OUT;\n rep(i,4) {\n auto tmp=given_x(c.corners[i], c.corners[(i+1)%4], xl);\n if(c.corners[i].x!=xl || c.corners[(i+1)%4].x!=xl) {\n if(tmp!=OUT){\n if(tmp>=yu) big=tmp;\n if(tmp<=yl) small=tmp;\n }\n }\n }\n /*this->print();\n c.print();\n cout<<big<<' '<<small<<endl;*/\n if(big==OUT) return -1;\n if(small==OUT) return -1;\n return 1;\n}\n\n\ndouble smallest=(1e-8);\n\nstruct one_question{\n ll N,R,C; \n vector<rectangle> rec;\n vector<circle> cir;\n \n one_question(ll N_) :N(N_){\n rep(i,N){\n double a,b,c,d,r; cin>>a>>b>>c>>d>>r;\n Vec2 A(a,b), B(c,d);\n cir.pb(circle(A,r));\n if(A!=B){\n cir.pb(circle(B,r));\n rec.pb(rectangle(A,B,r));\n }\n }\n R=rec.size(); C=cir.size();\n }\n double Solve(const square& s, vec rec_memo, vec cir_memo){\n double full=s.len*s.len;\n if(full<=smallest) return full/2;\n bool nothing=true;\n rep(i,R) if(!rec_memo[i]){\n rec_memo[i]=s.judge(rec[i]);\n if(rec_memo[i]==1) return full;\n if(rec_memo[i]==0) nothing=false;\n }\n rep(i,C) if(!cir_memo[i]){\n cir_memo[i]=s.judge(cir[i]);\n if(cir_memo[i]==1) return full;\n if(cir_memo[i]==0) nothing=false;\n }\n if(nothing) return 0;\n double ret=0;\n rep(i,4){\n square tmp((s.mid+s.corners[i])/2,s.len/2);\n ret+=Solve(tmp,rec_memo,cir_memo);\n }\n return ret;\n\n }\n double ans(){\n square start(Vec2(0,0),10);\n vec rec_memo(R,0);\n vec cir_memo(C,0);\n return Solve(start,rec_memo,cir_memo);\n }\n\n};\n\n\n\n\n \n\nint main(){\n vector<double> ret;\n while(true){\n ll n; cin>>n;\n if(!n) break;\n one_question tmp(n);\n ret.pb(tmp.ans());\n }\n for(auto e: ret) cout<<setprecision(8)<<e<<endl;\n}","accuracy":1,"time_ms":1870,"memory_kb":3504,"score_of_the_acc":-1.9514,"final_rank":4},{"submission_id":"aoj_2066_3172671","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\nusing namespace std;\nconst double EPS = 1e-10;\nconst double INF = 1e12;\nconst double PI = acos(-1);\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\n\ntypedef complex<double> P;\ntypedef vector<P> VP;\nstruct L : array<P, 2>{\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\n L(){}\n};\nstruct C{\n P p;\n double r;\n C(const P& p, const double& r) : p(p), r(r) {}\n C(){}\n};\n\nnamespace std{\n bool operator < (const P& a, const P& b){\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\n }\n bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){\n return (conj(a)*b).X;\n}\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\n}\nint ccw(P a, P b, P c){\n b -= a;\n c -= a;\n if(cross(b,c) > EPS) return +1; //ccw\n if(cross(b,c) < -EPS) return -1; //cw\n if(dot(b,c) < -EPS) return +2; //c-a-b\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\n return 0; //a-c-b\n}\nP unit(const P &p){\n return p/abs(p);\n}\nP rotate(const P &p, double rad){\n return p *P(cos(rad), sin(rad));\n}\n\nbool intersectSS(const L& a, const L& b){\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\n}\nbool intersectSP(const L& s, const P &p){\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\n}\nP projection(const L& l, const P& p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\ndouble distanceLP(const L &l, const P &p) {\n return abs(cross(l[1]-l[0], p-l[0])) /abs(l[1]-l[0]);\n}\n\nbool isParallel(const P &a, const P &b){\n return abs(cross(a,b)) < EPS;\n}\nbool isParallel(const L &a, const L &b){\n return isParallel(a[1]-a[0], b[1]-b[0]);\n}\n\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1]-l[0], m[1]-m[0]);\n double B = cross(l[1]-l[0], l[1]-m[0]);\n return m[0] + B/A *(m[1]-m[0]);\n}\n\nVP crosspointCL(const C &c, const L &l){\n VP ret;\n P mid = projection(l, c.p);\n double d = distanceLP(l, c.p);\n if(EQ(d, c.r)){\n ret.push_back(mid);\n }else if(d < c.r){\n double len = sqrt(c.r*c.r -d*d);\n ret.push_back(mid +len*unit(l[1]-l[0]));\n ret.push_back(mid -len*unit(l[1]-l[0]));\n }\n return ret;\n}\nVP crosspointCS(const C &c, const L &s){\n VP ret;\n VP cp = crosspointCL(c,s);\n for(int i=0; i<(int)cp.size(); i++){\n if(intersectSP(s, cp[i])){\n ret.push_back(cp[i]);\n }\n }\n return ret;\n}\n\nint in_poly(const P &p, const VP &poly){\n int n = poly.size();\n int ret = -1;\n for(int i=0; i<n; i++){\n P a = poly[i]-p;\n P b = poly[(i+1)%n]-p;\n if(a.Y > b.Y) swap(a,b);\n if(intersectSP(L(a,b), P(0,0))) return 0;\n if(a.Y<=0 && b.Y>0 && cross(a,b)<0) ret = -ret;\n }\n return ret;\n}\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n vector<VP> rect(n, VP(4));\n vector<C> circle(2*n);\n for(int i=0; i<n; i++){\n double xs,ys,xt,yt,r;\n cin >> xs >> ys >> xt >> yt >> r;\n P s(xs, ys), t(xt, yt);\n P cn = unit(t -s) *r *P(0, 1);\n rect[i][0] = t +cn;\n rect[i][1] = s +cn;\n rect[i][2] = s -cn;\n rect[i][3] = t -cn;\n circle[2*i +0] = C(s, r);\n circle[2*i +1] = C(t, r);\n }\n\n double lbx=-5, ubx=5;\n double lby=-5, uby=5;\n int splitnum = 1e3;\n double dx = (ubx -lbx) /splitnum;\n double ans = 0;\n for(int i=0; i<splitnum; i++){\n double x = lbx +(i+0.5)*dx;\n L seg(P(x, lby), P(x, uby));\n VP cp{seg[0], seg[1]};\n for(int j=0; j<n; j++){\n for(int k=0; k<4; k++){\n L edge(rect[j][k], rect[j][(k+1)%4]);\n if(!isParallel(seg, edge) && intersectSS(seg, edge)){\n cp.push_back(crosspointLL(seg, edge));\n }\n }\n }\n for(int j=0; j<2*n; j++){\n VP ret = crosspointCS(circle[j], seg);\n cp.insert(cp.end(), ret.begin(), ret.end());\n }\n sort(cp.begin(), cp.end());\n cp.erase(unique(cp.begin(), cp.end()), cp.end());\n double len = 0;\n for(int j=0; j<(int)cp.size()-1; j++){\n P mid = (cp[j] +cp[j+1]) /2.0;\n bool in = false;\n for(int k=0; k<n && !in; k++){\n if(in_poly(mid, rect[k]) > 0){\n in = true;\n }\n }\n for(int k=0; k<2*n && !in; k++){\n if(abs(mid -circle[k].p) < circle[k].r){\n in = true;\n }\n }\n if(in){\n len += abs(cp[j+1] -cp[j]);\n }\n }\n ans += dx*len;\n }\n cout << fixed << setprecision(5);\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3252,"score_of_the_acc":-0.842,"final_rank":2},{"submission_id":"aoj_2066_3172670","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\nusing namespace std;\nconst double EPS = 1e-10;\nconst double INF = 1e12;\nconst double PI = acos(-1);\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\n\ntypedef complex<double> P;\ntypedef vector<P> VP;\nstruct L : array<P, 2>{\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\n L(){}\n};\nstruct C{\n P p;\n double r;\n C(const P& p, const double& r) : p(p), r(r) {}\n C(){}\n};\n\nnamespace std{\n bool operator < (const P& a, const P& b){\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\n }\n bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){\n return (conj(a)*b).X;\n}\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\n}\nint ccw(P a, P b, P c){\n b -= a;\n c -= a;\n if(cross(b,c) > EPS) return +1; //ccw\n if(cross(b,c) < -EPS) return -1; //cw\n if(dot(b,c) < -EPS) return +2; //c-a-b\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\n return 0; //a-c-b\n}\nP unit(const P &p){\n return p/abs(p);\n}\nP rotate(const P &p, double rad){\n return p *P(cos(rad), sin(rad));\n}\n\nbool intersectSS(const L& a, const L& b){\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\n}\nbool intersectSP(const L& s, const P &p){\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\n}\nP projection(const L& l, const P& p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\ndouble distanceLP(const L &l, const P &p) {\n return abs(cross(l[1]-l[0], p-l[0])) /abs(l[1]-l[0]);\n}\n\nbool isParallel(const P &a, const P &b){\n return abs(cross(a,b)) < EPS;\n}\nbool isParallel(const L &a, const L &b){\n return isParallel(a[1]-a[0], b[1]-b[0]);\n}\n\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1]-l[0], m[1]-m[0]);\n double B = cross(l[1]-l[0], l[1]-m[0]);\n return m[0] + B/A *(m[1]-m[0]);\n}\n\nVP crosspointCL(const C &c, const L &l){\n VP ret;\n P mid = projection(l, c.p);\n double d = distanceLP(l, c.p);\n if(EQ(d, c.r)){\n ret.push_back(mid);\n }else if(d < c.r){\n double len = sqrt(c.r*c.r -d*d);\n ret.push_back(mid +len*unit(l[1]-l[0]));\n ret.push_back(mid -len*unit(l[1]-l[0]));\n }\n return ret;\n}\nVP crosspointCS(const C &c, const L &s){\n VP ret;\n VP cp = crosspointCL(c,s);\n for(int i=0; i<(int)cp.size(); i++){\n if(intersectSP(s, cp[i])){\n ret.push_back(cp[i]);\n }\n }\n return ret;\n}\n\nint in_poly(const P &p, const VP &poly){\n int n = poly.size();\n int ret = -1;\n for(int i=0; i<n; i++){\n P a = poly[i]-p;\n P b = poly[(i+1)%n]-p;\n if(a.Y > b.Y) swap(a,b);\n if(intersectSP(L(a,b), P(0,0))) return 0;\n if(a.Y<=0 && b.Y>0 && cross(a,b)<0) ret = -ret;\n }\n return ret;\n}\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n vector<VP> rect(n, VP(4));\n vector<C> circle(2*n);\n for(int i=0; i<n; i++){\n double xs,ys,xt,yt,r;\n cin >> xs >> ys >> xt >> yt >> r;\n P s(xs, ys), t(xt, yt);\n P cn = unit(t -s) *r *P(0, 1);\n rect[i][0] = t +cn;\n rect[i][1] = s +cn;\n rect[i][2] = s -cn;\n rect[i][3] = t -cn;\n circle[2*i +0] = C(s, r);\n circle[2*i +1] = C(t, r);\n }\n\n double lbx=-5, ubx=5;\n double lby=-5, uby=5;\n int splitnum = 1e4;\n double dx = (ubx -lbx) /splitnum;\n double ans = 0;\n for(int i=0; i<splitnum; i++){\n double x = lbx +(i+0.5)*dx;\n L seg(P(x, lby), P(x, uby));\n VP cp{seg[0], seg[1]};\n for(int j=0; j<n; j++){\n for(int k=0; k<4; k++){\n L edge(rect[j][k], rect[j][(k+1)%4]);\n if(!isParallel(seg, edge) && intersectSS(seg, edge)){\n cp.push_back(crosspointLL(seg, edge));\n }\n }\n }\n for(int j=0; j<2*n; j++){\n VP ret = crosspointCS(circle[j], seg);\n cp.insert(cp.end(), ret.begin(), ret.end());\n }\n sort(cp.begin(), cp.end());\n cp.erase(unique(cp.begin(), cp.end()), cp.end());\n double len = 0;\n for(int j=0; j<(int)cp.size()-1; j++){\n P mid = (cp[j] +cp[j+1]) /2.0;\n bool in = false;\n for(int k=0; k<n && !in; k++){\n if(in_poly(mid, rect[k]) > 0){\n in = true;\n }\n }\n for(int k=0; k<2*n && !in; k++){\n if(abs(mid -circle[k].p) < circle[k].r){\n in = true;\n }\n }\n if(in){\n len += abs(cp[j+1] -cp[j]);\n }\n }\n ans += dx*len;\n }\n cout << fixed << setprecision(5);\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":920,"memory_kb":3312,"score_of_the_acc":-1.3432,"final_rank":3},{"submission_id":"aoj_2066_1124279","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\nusing namespace std;\nstatic const double EPS = 1e-10;\ntypedef long long ll;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define rev(i,n) for(int i=n-1;i>=0;i--)\n#define sz(a) a.size()\n#define all(a) a.begin(),a.end()\n#define mp(a,b) make_pair(a,b)\n#define pb(a) push_back(a)\n#define SS stringstream\n#define DBG1(a) rep(_X,sz(a)){printf(\"%d \",a[_X]);}puts(\"\");\n#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf(\"%d \",a[_X][_Y]);puts(\"\");}\n#define bitcount(b) __builtin_popcount(b)\n#define REP(i, s, e) for ( int i = s; i <= e; i++ ) \n \nconst double INF = 1e12;\ntypedef complex<double> P,point;\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;\nnamespace std {bool operator < (const P& a, const P& b) {return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);} }\ndouble cross(const P& a, const P& b) {return imag(conj(a)*b);}\ndouble dot(const P& a, const P& b) {return real(conj(a)*b);}\nstruct L : public vector<P> {L(const P &a, const P &b) {push_back(a); push_back(b);} };\nstruct C {P p; double r;C(const P &p, double r) : p(p), r(r) { } C(){} };\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// Check Funcs //\nbool intersectLL(const L &l, const L &m) {return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || abs(cross(l[1]-l[0], m[0]-l[0])) < EPS;}\nbool intersectLS(const L &l, const L &s) {return cross(l[1]-l[0], s[0]-l[0])*cross(l[1]-l[0], s[1]-l[0]) < EPS;}\nbool intersectLP(const L &l, const P &p) {return abs(cross(l[1]-p, l[0]-p)) < EPS;}\nbool intersectSS(const L &s, const L &t) {return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 && ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;}\nbool intersectSP(const L &s, const P &p) {return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS;}\n \n// Where is Point in Polygon? //\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\nenum { OUT, ON, IN };\nint contains(const polygon& P, const point& p) {\n\tbool in = false;\n\tfor (int i = 0; i < P.size(); ++i) {\n\t\tpoint a = curr(P,i) - p, b = next(P,i) - p;\n\t\tif (imag(a) > imag(b)) swap(a, b);\n\t\tif (imag(a) <= 0 && 0 < imag(b))\n\t\t\tif (cross(a, b) < 0) in = !in;\n\t\tif (cross(a, b) == 0 && dot(a, b) <= 0) return ON;\n\t}\n\treturn in ? IN : OUT;\n}\n// Area of Polygon //\ndouble area2(const polygon& P) {\n\tdouble A = 0;\n\tfor (int i = 0; i < P.size(); ++i)A += cross(curr(P, i), next(P, i));\n\treturn A;\n}\n// Totsuhou! Andrew's Monotone Chain //\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 \nP projection(const L &l, const P &p) {double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);return l[0] + t*(l[0]-l[1]);}\nP reflection(const L &l, const P &p) {return p + 2.0 * (projection(l, p) - p);}\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\treturn intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\ndouble distanceLS(const L &l, const L &s) {\n\tif (intersectLS(l, s)) return 0;\n\treturn min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\ndouble distanceSP(const L &s, const P &p) {\n\tconst P r = projection(s, p);\n\tif (intersectSP(s, r)) return abs(r - p);\n\treturn min(abs(s[0] - p), abs(s[1] - p));\n}\ndouble distanceSS(const L &s, const L &t) {\n\tif (intersectSS(s, t)) return 0;\n\treturn min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),min(distanceSP(t, s[0]), distanceSP(t, s[1])));\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}\n \nvector<P> C_cp(C a,C b){\n\tvector<P> ret;\n\tdouble L = abs(a.p-b.p);\n \n\t/* anma dekitenai */\n\tif(\tL-a.r-b.r > EPS || (abs(a.p-b.p)<EPS && fabs(a.r-b.r)<EPS) || \n\t\tabs(a.p-b.p) < abs(a.r-b.r)\n\t)return ret;\n \n\tdouble theta = atan2(b.p.imag()-a.p.imag(),b.p.real()-a.p.real());\n\tdouble c = (L*L+a.r*a.r-b.r*b.r)/(2*L*a.r);\n\tret.push_back(\n\t\tP(a.p.real()+a.r*cos(theta+acos(c)),\n\t\t a.p.imag()+a.r*sin(theta+acos(c)))\n\t);\n\tif(fabs(L-a.r-b.r) > EPS)\n\t\tret.push_back(\n\t\t\tP(a.p.real()+a.r*cos(theta-acos(c)),\n\t\t\t a.p.imag()+a.r*sin(theta-acos(c)))\n\t\t);\n\treturn ret;\n}\n \n \nP getPedal(L l, P p){\n\tdouble A;\n\tif(abs(l[1].real()-l[0].real()) < EPS){\n\t\treturn P(l[1].real(),p.imag()); // important\n\t}else{\n\t\tA = (l[1].imag()-l[0].imag())/(l[1].real()-l[0].real());\n\t}\n\tdouble a = -A , b = 1 , c = A*l[0].real() - l[0].imag();\n\tdouble t = (a*p.real() + b*p.imag() + c)/(a*a+b*b);\n\treturn p-t * P(a,b);\n}\n \nvector<P> crosspointCL(const L l, const C c){\n\tvector<P> ret;\n\tP p = getPedal(l,c.p);\n\tif(\tabs(p-c.p) > c.r+EPS)return ret;\n\tP e = P((l[1]-l[0])/abs(l[1]-l[0]));\n\tdouble S = sqrt(c.r*c.r-abs(p-c.p)*abs(p-c.p));\n\tret.push_back(p+S*e);\n\tret.push_back(p-S*e);\n\treturn ret;\n}\n \nP getCircumcenter(P a,P b,P c){\n\tdouble A1 = 2 * ( b.real() - a.real() );\n\tdouble B1 = 2 * ( b.imag() - a.imag() );\n\tdouble C1 = pow(a.real(),2)-pow(b.real(),2) + pow(a.imag(),2)-pow(b.imag(),2);\n\tdouble A2 = 2 * ( c.real() - a.real() );\n\tdouble B2 = 2 * ( c.imag() - a.imag() );\n\tdouble C2 = pow(a.real(),2)-pow(c.real(),2) + pow(a.imag(),2)-pow(c.imag(),2);\n\tdouble X = (B1 * C2 - B2 * C1) / (A1 * B2 - A2 * B1);\n\tdouble Y = (C1 * A2 - C2 * A1) / (A1 * B2 - A2 * B1);\n\treturn P(X,Y);\n}\n \ndouble AreaOfPolygon(vector<P> p){\n\tdouble S = 0 ; \n\tp.push_back(p[0]);\n\t/* 多角形の面積公式 (反時計回りの場合) */\n\tfor(int i = 0 ; i < p.size()-1 ; i++){\n\t\tS += (p[i].real() - p[i+1].real()) * (p[i].imag()+p[i+1].imag());\n\t}\n\tS /= 2.0;\n\treturn S;\n}\nvector<vector<L> > rect;\n\nvector<C> c;\ndouble seg(double y){\n\tL l = L(P(0,y),P(1,y));\n\tvector< pair<double,double> > segs;\n\tfor(int i = 0 ; i < c.size() ; i++){\n\t\tvector<P> cp = crosspointCL(l,c[i]);\n\t\tif( cp.size() ){\n\t\t\tdouble a = cp[0].real(), b = cp[1].real();\n\t\t\tif( a > b ) swap(a,b);\n\t\t\tsegs.push_back(mp(a,b));\n\t\t}\n\t}\n\tfor(int i = 0 ; i < rect.size() ; i++){\n\t\tdouble mx = -1e9;\n\t\tdouble mi = 1e9;\n\t\tfor(int j = 0 ; j < 4 ; j++){\n\t\t\tif( intersectLS(l,rect[i][j]) ){\n\t\t\t\tdouble x = crosspoint(rect[i][j],l).real();\n\t\t\t\tmx = max(mx,x);\n\t\t\t\tmi = min(mi,x);\n\t\t\t}\n\t\t}\n\t\tif( mi > mx ) continue;\n\t\t//cout << mi << \" \" << mx << endl;\n\t\tsegs.push_back(mp(mi,mx));\n\t}\n\tvector< pair<double,double> > tmpseg;\n\tfor(int i = 0 ; i < segs.size() ; i++){\n\t\tif( segs[i].second < -5 ) continue;\n\t\tif( segs[i].first > 5 ) continue;\n\t\tsegs[i].first = max(-5.,segs[i].first);\n\t\tsegs[i].second = min(5.,segs[i].second);\n\t\ttmpseg.push_back(segs[i]);\n\t}\n\tsegs = tmpseg;\n\t\n\tif( segs.size() == 0 ) return 0.0;\n\tsort(segs.begin(),segs.end());\n\tdouble st = segs[0].first;\n\tdouble en = segs[0].second;\n\tdouble ans = 0;\n\tfor(int i = 1 ; i < segs.size() ; i++){\n\n\t\tif( en < segs[i].first ){\n\t\t\tans += en - st;\n\t\t\tst = segs[i].first;\n\t\t\ten = segs[i].second;\n\t\t}else{\n\t\t\ten = max(en,segs[i].second);\n\t\t}\n\t}\n\tans += en - st;\n\treturn ans;\n}\nint main(){\n\tint N;\n\twhile(cin >> N && N){\n\t\tc.clear();\n\t\trect.clear();\n\t\tfor(int i = 0 ; i < N ; i++){\n\t\t\tP a,b;\n\t\t\tdouble r;\n\t\t\tcin >> a >> b >> r;\n\t\t\tP e = (b - a) / abs(b-a);\n\t\t\te = P(-e.imag(),e.real());\n\t\t\tvector<L> ln;\n\t\t\tP A = a + e * r;\n\t\t\tP B = a - e * r;\n\t\t\tP C = b - e * r;\n\t\t\tP D = b + e * r;\n\t\t\tln.push_back(L(A,B));\n\t\t\tln.push_back(L(B,C));\n\t\t\tln.push_back(L(C,D));\n\t\t\tln.push_back(L(D,A));\n\t\t\t\n\t\t\trect.push_back(ln);\n\t\t\tc.push_back(::C(a,r));\n\t\t\tc.push_back(::C(b,r));\n\t\t}\n\t\tdouble ans = 0;\n\t\tint D = 20000;\n\t\t//cout << seg(1.3) << endl;\n\t\t//return 0;\n\t\tfor(int i = 0 ; i < D ; i++){\n\t\t\tdouble y = -5 + 10. * i / D;\n\t\t\tans += seg(y) * (1./D);\n\t\t}\n\t\tprintf(\"%.10lf%c\",ans*10,10);\n\t}\n}","accuracy":1,"time_ms":960,"memory_kb":1312,"score_of_the_acc":-0.4972,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2066_5469291\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <stdlib.h>\\n#include <cassert>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vec;\\n\\n#define _GLIBCXX_DEBUG\\n#define REP(i,a,b) for(int i=(int)a;i<(int)b;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define pb push_back\\n\\n\\nstruct Vec2{\\n double x;\\n double y;\\n Vec2(double X, double Y) : x(X), y(Y) {}\\n bool operator==(const Vec2& rhs) const{\\n return x==rhs.x ? y==rhs.y : false;\\n }\\n\\n bool operator!=(const Vec2& rhs) const{\\n return (*this)==rhs ? false: true;\\n }\\n Vec2 operator=(const Vec2& rhs){\\n x=rhs.x; y=rhs.y;\\n return (*this);\\n }\\n Vec2 operator+(const Vec2& rhs) const{\\n return Vec2(this->x+rhs.x, this->y+rhs.y);\\n }\\n Vec2 operator-(const Vec2& rhs) const{\\n return Vec2(this->x-rhs.x, this->y-rhs.y);\\n }\\n Vec2 operator*(const double &rhs) const{\\n return Vec2(this->x*rhs,this->y*rhs);\\n }\\n\\n Vec2 operator/(const double &rhs) const{\\n assert(rhs>0);\\n return Vec2(this->x/rhs,this->y/rhs);\\n }\\n \\n double operator*(const Vec2 &rhs) const{\\n return this->x*rhs.x+this->y*rhs.y;\\n }\\n \\n};\\ndouble length(const Vec2 &a){\\n return sqrt(a*a);\\n}\\n\\nVec2 normalize(const Vec2 &a){\\n double len=length(a);\\n return len>0 ? a/len : a;\\n}\\n\\nVec2 sui(const Vec2 &a){\\n Vec2 aa=normalize(a);\\n return Vec2(aa.y,-aa.x);\\n}\\n\\nconst double OUT=5000000;\\n\\ndouble given_x(Vec2 a, Vec2 b, double xx, bool senbun=true);\\ndouble given_y(Vec2 a, Vec2 b, double yy, bool senbun=true);\\n\\nstruct circle{\\n Vec2 mid;\\n double r;\\n circle(Vec2 mid_, double r_):mid(mid_),r(r_){}\\n bool inside(Vec2 p) const{\\n return length(p-mid)<r;\\n }\\n};\\n\\nstruct rectangle{\\n Vec2 a;\\n Vec2 b;\\n double r;\\n vector<Vec2> corners;\\n rectangle(Vec2 a_, Vec2 b_, double r_) : a(a_), b(b_), r(r_){\\n Vec2 s=sui(b-a)*r;\\n corners.pb(a+s);\\n corners.pb(a-s);\\n corners.pb(b-s);\\n corners.pb(b+s);\\n }\\n void print() const{\\n cout<<\\\"rectangle is \\\";\\n for(auto e: corners) cout<<e.x<<' '<<e.y<<\\\", \\\";\\n cout<<endl;\\n }\\n};\\n\\nstruct square{\\n Vec2 mid;\\n double len;\\n vector<Vec2> corners;\\n double xl,xu,yl,yu;\\n square(Vec2 mid_,double len_):mid(mid_),len(len_) ,xl(mid.x-len/2), xu(mid.x+len/2), yl(mid.y-len/2), yu(mid.y+len/2) {\\n corners.pb(Vec2(xl,yl));\\n corners.pb(Vec2(xu,yl));\\n corners.pb(Vec2(xu,yu));\\n corners.pb(Vec2(xl,yu));\\n }\\n bool inside(Vec2 p) const{\\n if(abs(p.x-mid.x)>len/2) return false;\\n if(abs(p.y-mid.y)>len/2) return false;\\n return true;\\n }\\n\\n int judge(const circle &c) const{\\n bool memo=c.inside(corners[0]);\\n REP(i,1,4) if(memo!=c.inside(corners[i])) return 0; //0は混在\\n if(memo) return 1; // 1は完全に含まれている\\n if(length(this->mid-c.mid)<c.r+len/2) return 0;\\n return -1;\\n }\\n\\n int judge(const rectangle &c) const;\\n void print() const{\\n cout<<\\\"square is \\\";\\n for(auto e: corners) cout<<e.x<<' '<<e.y<<\\\", \\\";\\n cout<<endl;\\n }\\n};\\n\\n\\n\\ndouble given_x(Vec2 a, Vec2 b, double xx, bool senbun){\\n if(senbun && a.x>xx && b.x>xx) return OUT;\\n if(senbun && a.x<xx && b.x<xx) return OUT;\\n if(a.x==xx) return a.y;\\n if(b.x==xx) return b.y;\\n double Y=b.y-a.y, X=b.x-a.x, XX=xx-a.x;\\n if(!X) return a.y+Y/2;\\n return a.y+Y*XX/X;\\n}\\n\\ndouble given_y(Vec2 a, Vec2 b, double yy, bool senbun){\\n if(senbun && a.y>yy && b.y>yy) return OUT;\\n if(senbun && a.y<yy && b.y<yy) return OUT;\\n if(a.y==yy) return a.x;\\n if(b.y==yy) return b.x;\\n double Y=b.y-a.y, X=b.x-a.x, YY=yy-a.y;\\n if(!Y) return a.x+X/2;\\n return a.x+X*YY/Y;\\n}\\nbool cross(square s, Vec2 a, Vec2 b){\\n if(a.x<s.xl && b.x<s.xl) return false;\\n if(a.x>s.xu && b.x>s.xu) return false;\\n if(a.y<s.yl && b.y<s.yl) return false;\\n if(a.y>s.yu && b.y>s.yu) return false;\\n if(a.x==b.x) return true;\\n if(a.y==b.y) return true;\\n double XL=given_x(a,b,s.xl);\\n if(s.yl<=XL && XL<=s.yu) return true;\\n double XU=given_x(a,b,s.xu);\\n if(s.yl<=XU && XU<=s.yu) return true;\\n double YL=given_y(a,b,s.yl);\\n if(s.xl<=YL && YL<=s.xu) return true;\\n double YU=given_y(a,b,s.yu);\\n if(s.xl<=YU && YU<=s.xu) return true;\\n return false;\\n}\\n\\nint square::judge(const rectangle &c) const{\\n rep(i,4) if(this->inside(c.corners[i])) return 0;\\n rep(i,4) if(cross((*this),c.corners[i],c.corners[(i+1)%4])) return 0;\\n double big=OUT,small=OUT;\\n rep(i,4) {\\n auto tmp=given_x(c.corners[i], c.corners[(i+1)%4], xl);\\n if(c.corners[i].x!=xl || c.corners[(i+1)%4].x!=xl) {\\n if(tmp!=OUT){\\n if(tmp>=yu) big=tmp;\\n if(tmp<=yl) small=tmp;\\n }\\n }\\n }\\n /*this->print();\\n c.print();\\n cout<<big<<' '<<small<<endl;*/\\n if(big==OUT) return -1;\\n if(small==OUT) return -1;\\n return 1;\\n}\\n\\n\\ndouble smallest=(1e-8);\\n\\nstruct one_question{\\n ll N,R,C; \\n vector<rectangle> rec;\\n vector<circle> cir;\\n \\n one_question(ll N_) :N(N_){\\n rep(i,N){\\n double a,b,c,d,r; cin>>a>>b>>c>>d>>r;\\n Vec2 A(a,b), B(c,d);\\n cir.pb(circle(A,r));\\n if(A!=B){\\n cir.pb(circle(B,r));\\n rec.pb(rectangle(A,B,r));\\n }\\n }\\n R=rec.size(); C=cir.size();\\n }\\n double Solve(const square& s, vec rec_memo, vec cir_memo){\\n double full=s.len*s.len;\\n if(full<=smallest) return full/2;\\n bool nothing=true;\\n rep(i,R) if(!rec_memo[i]){\\n rec_memo[i]=s.judge(rec[i]);\\n if(rec_memo[i]==1) return full;\\n if(rec_memo[i]==0) nothing=false;\\n }\\n rep(i,C) if(!cir_memo[i]){\\n cir_memo[i]=s.judge(cir[i]);\\n if(cir_memo[i]==1) return full;\\n if(cir_memo[i]==0) nothing=false;\\n }\\n if(nothing) return 0;\\n double ret=0;\\n rep(i,4){\\n square tmp((s.mid+s.corners[i])/2,s.len/2);\\n ret+=Solve(tmp,rec_memo,cir_memo);\\n }\\n return ret;\\n\\n }\\n double ans(){\\n square start(Vec2(0,0),10);\\n vec rec_memo(R,0);\\n vec cir_memo(C,0);\\n return Solve(start,rec_memo,cir_memo);\\n }\\n\\n};\\n \\n\\nint main(){\\n vector<double> ret;\\n while(true){\\n ll n; cin>>n;\\n if(!n) break;\\n one_question tmp(n);\\n ret.pb(tmp.ans());\\n }\\n for(auto e: ret) cout<<setprecision(8)<<e<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1870,\n \"memory_kb\": 3616,\n \"score_of_the_acc\": -2,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2066_5469258\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <stdlib.h>\\n#include <cassert>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\ntypedef vector<double> Vec;\\ntypedef vector<Vec> Mat;\\ntypedef pair<ll,ll> P;\\ntypedef pair<double,ll> Pd;\\ntypedef pair<double,double> PD;\\ntypedef priority_queue<P,vector<P>,greater<P> > P_queue;\\ntypedef priority_queue<Pd,vector<Pd>,greater<Pd> > Pd_queue;\\n\\nconst ll MOD=998244353;\\nconst ll mod=1000000007;\\nconst ll INF=1e15;\\nconst ll MAXINF=9223372036854775806;\\nconst double DEL=1e-7;\\nconst double PI=3.14159265359;\\n\\n#define _GLIBCXX_DEBUG\\n#define REP(i,a,b) for(int i=(int)a;i<(int)b;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define pb push_back\\n#define mp make_pair\\n#define ALL(a) a.begin(),a.end()\\n#define SORT(a) sort(ALL(a))\\n#define U_ERASE(V) V.erase(unique(ALL(V)), V.end());\\n\\n\\n\\n\\n\\nstruct Vec2{\\n double x;\\n double y;\\n Vec2(double X, double Y) : x(X), y(Y) {}\\n Vec2(PD a):x(a.first), y(a.second) {}\\n bool operator==(const Vec2& rhs) const{\\n return x==rhs.x ? y==rhs.y : false;\\n }\\n\\n bool operator!=(const Vec2& rhs) const{\\n return (*this)==rhs ? false: true;\\n }\\n Vec2 operator=(const Vec2& rhs){\\n x=rhs.x; y=rhs.y;\\n return (*this);\\n }\\n Vec2 operator+(const Vec2& rhs) const{\\n return Vec2(this->x+rhs.x, this->y+rhs.y);\\n }\\n Vec2 operator-(const Vec2& rhs) const{\\n return Vec2(this->x-rhs.x, this->y-rhs.y);\\n }\\n Vec2 operator*(const double &rhs) const{\\n return Vec2(this->x*rhs,this->y*rhs);\\n }\\n\\n Vec2 operator/(const double &rhs) const{\\n assert(rhs>0);\\n return Vec2(this->x/rhs,this->y/rhs);\\n }\\n double operator*(const Vec2 &rhs) const{\\n return this->x*rhs.x+this->y*rhs.y;\\n }\\n \\n};\\ndouble length(const Vec2 &a){\\n return sqrt(a*a);\\n}\\n\\nVec2 normalize(const Vec2 &a){\\n double len=length(a);\\n return len>0 ? a/len : a;\\n}\\n\\nVec2 sui(const Vec2 &a){\\n Vec2 aa=normalize(a);\\n return Vec2(aa.y,-aa.x);\\n}\\n\\nconst double OUT=5000000;\\n\\ndouble given_x(Vec2 a, Vec2 b, double xx, bool senbun=true);\\ndouble given_y(Vec2 a, Vec2 b, double yy, bool senbun=true);\\n\\nstruct circle{\\n Vec2 mid;\\n double r;\\n circle(Vec2 mid_, double r_):mid(mid_),r(r_){}\\n bool inside(Vec2 p) const{\\n return length(p-mid)<r;\\n }\\n};\\n\\nstruct rectangle{\\n Vec2 a;\\n Vec2 b;\\n double r;\\n vector<Vec2> corners;\\n rectangle(Vec2 a_, Vec2 b_, double r_) : a(a_), b(b_), r(r_){\\n Vec2 s=sui(b-a)*r;\\n corners.pb(a+s);\\n corners.pb(a-s);\\n corners.pb(b-s);\\n corners.pb(b+s);\\n }\\n void print() const{\\n cout<<\\\"rectangle is \\\";\\n for(auto e: corners) cout<<e.x<<' '<<e.y<<\\\", \\\";\\n cout<<endl;\\n }\\n};\\n\\nstruct square{\\n Vec2 mid;\\n double len;\\n vector<Vec2> corners;\\n double xl,xu,yl,yu;\\n square(Vec2 mid_,double len_):mid(mid_),len(len_) ,xl(mid.x-len/2), xu(mid.x+len/2), yl(mid.y-len/2), yu(mid.y+len/2) {\\n corners.pb(Vec2(xl,yl));\\n corners.pb(Vec2(xu,yl));\\n corners.pb(Vec2(xu,yu));\\n corners.pb(Vec2(xl,yu));\\n }\\n bool inside(Vec2 p) const{\\n if(abs(p.x-mid.x)>len/2) return false;\\n if(abs(p.y-mid.y)>len/2) return false;\\n return true;\\n }\\n\\n int judge(const circle &c) const{\\n bool memo=c.inside(corners[0]);\\n REP(i,1,4) if(memo!=c.inside(corners[i])) return 0; //0は混在\\n if(memo) return 1; // 1は完全に含まれている\\n if(length(this->mid-c.mid)<c.r+len/2) return 0;\\n return -1;\\n }\\n\\n int judge(const rectangle &c) const;\\n void print() const{\\n cout<<\\\"square is \\\";\\n for(auto e: corners) cout<<e.x<<' '<<e.y<<\\\", \\\";\\n cout<<endl;\\n }\\n};\\n\\n\\n\\ndouble given_x(Vec2 a, Vec2 b, double xx, bool senbun){\\n if(senbun && a.x>xx && b.x>xx) return OUT;\\n if(senbun && a.x<xx && b.x<xx) return OUT;\\n if(a.x==xx) return a.y;\\n if(b.x==xx) return b.y;\\n double Y=b.y-a.y, X=b.x-a.x, XX=xx-a.x;\\n if(!X) return a.y+Y/2;\\n return a.y+Y*XX/X;\\n}\\n\\ndouble given_y(Vec2 a, Vec2 b, double yy, bool senbun){\\n if(senbun && a.y>yy && b.y>yy) return OUT;\\n if(senbun && a.y<yy && b.y<yy) return OUT;\\n if(a.y==yy) return a.x;\\n if(b.y==yy) return b.x;\\n double Y=b.y-a.y, X=b.x-a.x, YY=yy-a.y;\\n if(!Y) return a.x+X/2;\\n return a.x+X*YY/Y;\\n}\\nbool cross(square s, Vec2 a, Vec2 b){\\n if(a.x<s.xl && b.x<s.xl) return false;\\n if(a.x>s.xu && b.x>s.xu) return false;\\n if(a.y<s.yl && b.y<s.yl) return false;\\n if(a.y>s.yu && b.y>s.yu) return false;\\n if(a.x==b.x) return true;\\n if(a.y==b.y) return true;\\n double XL=given_x(a,b,s.xl);\\n if(s.yl<=XL && XL<=s.yu) return true;\\n double XU=given_x(a,b,s.xu);\\n if(s.yl<=XU && XU<=s.yu) return true;\\n double YL=given_y(a,b,s.yl);\\n if(s.xl<=YL && YL<=s.xu) return true;\\n double YU=given_y(a,b,s.yu);\\n if(s.xl<=YU && YU<=s.xu) return true;\\n return false;\\n}\\n\\nint square::judge(const rectangle &c) const{\\n rep(i,4) if(this->inside(c.corners[i])) return 0;\\n rep(i,4) if(cross((*this),c.corners[i],c.corners[(i+1)%4])) return 0;\\n double big=OUT,small=OUT;\\n rep(i,4) {\\n auto tmp=given_x(c.corners[i], c.corners[(i+1)%4], xl);\\n if(c.corners[i].x!=xl || c.corners[(i+1)%4].x!=xl) {\\n if(tmp!=OUT){\\n if(tmp>=yu) big=tmp;\\n if(tmp<=yl) small=tmp;\\n }\\n }\\n }\\n /*this->print();\\n c.print();\\n cout<<big<<' '<<small<<endl;*/\\n if(big==OUT) return -1;\\n if(small==OUT) return -1;\\n return 1;\\n}\\n\\n\\ndouble smallest=(1e-8);\\n\\nstruct one_question{\\n ll N,R,C; \\n vector<rectangle> rec;\\n vector<circle> cir;\\n \\n one_question(ll N_) :N(N_){\\n rep(i,N){\\n double a,b,c,d,r; cin>>a>>b>>c>>d>>r;\\n Vec2 A(a,b), B(c,d);\\n cir.pb(circle(A,r));\\n if(A!=B){\\n cir.pb(circle(B,r));\\n rec.pb(rectangle(A,B,r));\\n }\\n }\\n R=rec.size(); C=cir.size();\\n }\\n double Solve(const square& s, vec rec_memo, vec cir_memo){\\n double full=s.len*s.len;\\n if(full<=smallest) return full/2;\\n bool nothing=true;\\n rep(i,R) if(!rec_memo[i]){\\n rec_memo[i]=s.judge(rec[i]);\\n if(rec_memo[i]==1) return full;\\n if(rec_memo[i]==0) nothing=false;\\n }\\n rep(i,C) if(!cir_memo[i]){\\n cir_memo[i]=s.judge(cir[i]);\\n if(cir_memo[i]==1) return full;\\n if(cir_memo[i]==0) nothing=false;\\n }\\n if(nothing) return 0;\\n double ret=0;\\n rep(i,4){\\n square tmp((s.mid+s.corners[i])/2,s.len/2);\\n ret+=Solve(tmp,rec_memo,cir_memo);\\n }\\n return ret;\\n\\n }\\n double ans(){\\n square start(Vec2(0,0),10);\\n vec rec_memo(R,0);\\n vec cir_memo(C,0);\\n return Solve(start,rec_memo,cir_memo);\\n }\\n\\n};\\n\\n\\n\\n\\n \\n\\nint main(){\\n vector<double> ret;\\n while(true){\\n ll n; cin>>n;\\n if(!n) break;\\n one_question tmp(n);\\n ret.pb(tmp.ans());\\n }\\n for(auto e: ret) cout<<setprecision(8)<<e<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1870,\n \"memory_kb\": 3504,\n \"score_of_the_acc\": -1.9514,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2066_3172671\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <array>\\nusing namespace std;\\nconst double EPS = 1e-10;\\nconst double INF = 1e12;\\nconst double PI = acos(-1);\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\n\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\nstruct L : array<P, 2>{\\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\\n L(){}\\n};\\nstruct C{\\n P p;\\n double r;\\n C(const P& p, const double& r) : p(p), r(r) {}\\n C(){}\\n};\\n\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\nint ccw(P a, P b, P c){\\n b -= a;\\n c -= a;\\n if(cross(b,c) > EPS) return +1; //ccw\\n if(cross(b,c) < -EPS) return -1; //cw\\n if(dot(b,c) < -EPS) return +2; //c-a-b\\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\\n return 0; //a-c-b\\n}\\nP unit(const P &p){\\n return p/abs(p);\\n}\\nP rotate(const P &p, double rad){\\n return p *P(cos(rad), sin(rad));\\n}\\n\\nbool intersectSS(const L& a, const L& b){\\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\\n}\\nbool intersectSP(const L& s, const P &p){\\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\\n}\\nP projection(const L& l, const P& p) {\\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\\n return l[0] + t*(l[0]-l[1]);\\n}\\ndouble distanceLP(const L &l, const P &p) {\\n return abs(cross(l[1]-l[0], p-l[0])) /abs(l[1]-l[0]);\\n}\\n\\nbool isParallel(const P &a, const P &b){\\n return abs(cross(a,b)) < EPS;\\n}\\nbool isParallel(const L &a, const L &b){\\n return isParallel(a[1]-a[0], b[1]-b[0]);\\n}\\n\\nP crosspointLL(const L &l, const L &m) {\\n double A = cross(l[1]-l[0], m[1]-m[0]);\\n double B = cross(l[1]-l[0], l[1]-m[0]);\\n return m[0] + B/A *(m[1]-m[0]);\\n}\\n\\nVP crosspointCL(const C &c, const L &l){\\n VP ret;\\n P mid = projection(l, c.p);\\n double d = distanceLP(l, c.p);\\n if(EQ(d, c.r)){\\n ret.push_back(mid);\\n }else if(d < c.r){\\n double len = sqrt(c.r*c.r -d*d);\\n ret.push_back(mid +len*unit(l[1]-l[0]));\\n ret.push_back(mid -len*unit(l[1]-l[0]));\\n }\\n return ret;\\n}\\nVP crosspointCS(const C &c, const L &s){\\n VP ret;\\n VP cp = crosspointCL(c,s);\\n for(int i=0; i<(int)cp.size(); i++){\\n if(intersectSP(s, cp[i])){\\n ret.push_back(cp[i]);\\n }\\n }\\n return ret;\\n}\\n\\nint in_poly(const P &p, const VP &poly){\\n int n = poly.size();\\n int ret = -1;\\n for(int i=0; i<n; i++){\\n P a = poly[i]-p;\\n P b = poly[(i+1)%n]-p;\\n if(a.Y > b.Y) swap(a,b);\\n if(intersectSP(L(a,b), P(0,0))) return 0;\\n if(a.Y<=0 && b.Y>0 && cross(a,b)<0) ret = -ret;\\n }\\n return ret;\\n}\\n\\nint main(){\\n while(1){\\n int n;\\n cin >> n;\\n if(n == 0) break;\\n\\n vector<VP> rect(n, VP(4));\\n vector<C> circle(2*n);\\n for(int i=0; i<n; i++){\\n double xs,ys,xt,yt,r;\\n cin >> xs >> ys >> xt >> yt >> r;\\n P s(xs, ys), t(xt, yt);\\n P cn = unit(t -s) *r *P(0, 1);\\n rect[i][0] = t +cn;\\n rect[i][1] = s +cn;\\n rect[i][2] = s -cn;\\n rect[i][3] = t -cn;\\n circle[2*i +0] = C(s, r);\\n circle[2*i +1] = C(t, r);\\n }\\n\\n double lbx=-5, ubx=5;\\n double lby=-5, uby=5;\\n int splitnum = 1e3;\\n double dx = (ubx -lbx) /splitnum;\\n double ans = 0;\\n for(int i=0; i<splitnum; i++){\\n double x = lbx +(i+0.5)*dx;\\n L seg(P(x, lby), P(x, uby));\\n VP cp{seg[0], seg[1]};\\n for(int j=0; j<n; j++){\\n for(int k=0; k<4; k++){\\n L edge(rect[j][k], rect[j][(k+1)%4]);\\n if(!isParallel(seg, edge) && intersectSS(seg, edge)){\\n cp.push_back(crosspointLL(seg, edge));\\n }\\n }\\n }\\n for(int j=0; j<2*n; j++){\\n VP ret = crosspointCS(circle[j], seg);\\n cp.insert(cp.end(), ret.begin(), ret.end());\\n }\\n sort(cp.begin(), cp.end());\\n cp.erase(unique(cp.begin(), cp.end()), cp.end());\\n double len = 0;\\n for(int j=0; j<(int)cp.size()-1; j++){\\n P mid = (cp[j] +cp[j+1]) /2.0;\\n bool in = false;\\n for(int k=0; k<n && !in; k++){\\n if(in_poly(mid, rect[k]) > 0){\\n in = true;\\n }\\n }\\n for(int k=0; k<2*n && !in; k++){\\n if(abs(mid -circle[k].p) < circle[k].r){\\n in = true;\\n }\\n }\\n if(in){\\n len += abs(cp[j+1] -cp[j]);\\n }\\n }\\n ans += dx*len;\\n }\\n cout << fixed << setprecision(5);\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3252,\n \"score_of_the_acc\": -0.842,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2066_3172670\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <array>\\nusing namespace std;\\nconst double EPS = 1e-10;\\nconst double INF = 1e12;\\nconst double PI = acos(-1);\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\n\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\nstruct L : array<P, 2>{\\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\\n L(){}\\n};\\nstruct C{\\n P p;\\n double r;\\n C(const P& p, const double& r) : p(p), r(r) {}\\n C(){}\\n};\\n\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\nint ccw(P a, P b, P c){\\n b -= a;\\n c -= a;\\n if(cross(b,c) > EPS) return +1; //ccw\\n if(cross(b,c) < -EPS) return -1; //cw\\n if(dot(b,c) < -EPS) return +2; //c-a-b\\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\\n return 0; //a-c-b\\n}\\nP unit(const P &p){\\n return p/abs(p);\\n}\\nP rotate(const P &p, double rad){\\n return p *P(cos(rad), sin(rad));\\n}\\n\\nbool intersectSS(const L& a, const L& b){\\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\\n}\\nbool intersectSP(const L& s, const P &p){\\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\\n}\\nP projection(const L& l, const P& p) {\\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\\n return l[0] + t*(l[0]-l[1]);\\n}\\ndouble distanceLP(const L &l, const P &p) {\\n return abs(cross(l[1]-l[0], p-l[0])) /abs(l[1]-l[0]);\\n}\\n\\nbool isParallel(const P &a, const P &b){\\n return abs(cross(a,b)) < EPS;\\n}\\nbool isParallel(const L &a, const L &b){\\n return isParallel(a[1]-a[0], b[1]-b[0]);\\n}\\n\\nP crosspointLL(const L &l, const L &m) {\\n double A = cross(l[1]-l[0], m[1]-m[0]);\\n double B = cross(l[1]-l[0], l[1]-m[0]);\\n return m[0] + B/A *(m[1]-m[0]);\\n}\\n\\nVP crosspointCL(const C &c, const L &l){\\n VP ret;\\n P mid = projection(l, c.p);\\n double d = distanceLP(l, c.p);\\n if(EQ(d, c.r)){\\n ret.push_back(mid);\\n }else if(d < c.r){\\n double len = sqrt(c.r*c.r -d*d);\\n ret.push_back(mid +len*unit(l[1]-l[0]));\\n ret.push_back(mid -len*unit(l[1]-l[0]));\\n }\\n return ret;\\n}\\nVP crosspointCS(const C &c, const L &s){\\n VP ret;\\n VP cp = crosspointCL(c,s);\\n for(int i=0; i<(int)cp.size(); i++){\\n if(intersectSP(s, cp[i])){\\n ret.push_back(cp[i]);\\n }\\n }\\n return ret;\\n}\\n\\nint in_poly(const P &p, const VP &poly){\\n int n = poly.size();\\n int ret = -1;\\n for(int i=0; i<n; i++){\\n P a = poly[i]-p;\\n P b = poly[(i+1)%n]-p;\\n if(a.Y > b.Y) swap(a,b);\\n if(intersectSP(L(a,b), P(0,0))) return 0;\\n if(a.Y<=0 && b.Y>0 && cross(a,b)<0) ret = -ret;\\n }\\n return ret;\\n}\\n\\nint main(){\\n while(1){\\n int n;\\n cin >> n;\\n if(n == 0) break;\\n\\n vector<VP> rect(n, VP(4));\\n vector<C> circle(2*n);\\n for(int i=0; i<n; i++){\\n double xs,ys,xt,yt,r;\\n cin >> xs >> ys >> xt >> yt >> r;\\n P s(xs, ys), t(xt, yt);\\n P cn = unit(t -s) *r *P(0, 1);\\n rect[i][0] = t +cn;\\n rect[i][1] = s +cn;\\n rect[i][2] = s -cn;\\n rect[i][3] = t -cn;\\n circle[2*i +0] = C(s, r);\\n circle[2*i +1] = C(t, r);\\n }\\n\\n double lbx=-5, ubx=5;\\n double lby=-5, uby=5;\\n int splitnum = 1e4;\\n double dx = (ubx -lbx) /splitnum;\\n double ans = 0;\\n for(int i=0; i<splitnum; i++){\\n double x = lbx +(i+0.5)*dx;\\n L seg(P(x, lby), P(x, uby));\\n VP cp{seg[0], seg[1]};\\n for(int j=0; j<n; j++){\\n for(int k=0; k<4; k++){\\n L edge(rect[j][k], rect[j][(k+1)%4]);\\n if(!isParallel(seg, edge) && intersectSS(seg, edge)){\\n cp.push_back(crosspointLL(seg, edge));\\n }\\n }\\n }\\n for(int j=0; j<2*n; j++){\\n VP ret = crosspointCS(circle[j], seg);\\n cp.insert(cp.end(), ret.begin(), ret.end());\\n }\\n sort(cp.begin(), cp.end());\\n cp.erase(unique(cp.begin(), cp.end()), cp.end());\\n double len = 0;\\n for(int j=0; j<(int)cp.size()-1; j++){\\n P mid = (cp[j] +cp[j+1]) /2.0;\\n bool in = false;\\n for(int k=0; k<n && !in; k++){\\n if(in_poly(mid, rect[k]) > 0){\\n in = true;\\n }\\n }\\n for(int k=0; k<2*n && !in; k++){\\n if(abs(mid -circle[k].p) < circle[k].r){\\n in = true;\\n }\\n }\\n if(in){\\n len += abs(cp[j+1] -cp[j]);\\n }\\n }\\n ans += dx*len;\\n }\\n cout << fixed << setprecision(5);\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 920,\n \"memory_kb\": 3312,\n \"score_of_the_acc\": -1.3432,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2066_1124279\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <climits>\\n#include <cfloat>\\n#include <map>\\n#include <utility>\\n#include <set>\\n#include <iostream>\\n#include <memory>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <functional>\\n#include <sstream>\\n#include <complex>\\n#include <stack>\\n#include <queue>\\nusing namespace std;\\nstatic const double EPS = 1e-10;\\ntypedef long long ll;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define rev(i,n) for(int i=n-1;i>=0;i--)\\n#define sz(a) a.size()\\n#define all(a) a.begin(),a.end()\\n#define mp(a,b) make_pair(a,b)\\n#define pb(a) push_back(a)\\n#define SS stringstream\\n#define DBG1(a) rep(_X,sz(a)){printf(\\\"%d \\\",a[_X]);}puts(\\\"\\\");\\n#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf(\\\"%d \\\",a[_X][_Y]);puts(\\\"\\\");}\\n#define bitcount(b) __builtin_popcount(b)\\n#define REP(i, s, e) for ( int i = s; i <= e; i++ ) \\n \\nconst double INF = 1e12;\\ntypedef complex<double> P,point;\\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;\\nnamespace std {bool operator < (const P& a, const P& b) {return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);} }\\ndouble cross(const P& a, const P& b) {return imag(conj(a)*b);}\\ndouble dot(const P& a, const P& b) {return real(conj(a)*b);}\\nstruct L : public vector<P> {L(const P &a, const P &b) {push_back(a); push_back(b);} };\\nstruct C {P p; double r;C(const P &p, double r) : p(p), r(r) { } C(){} };\\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// Check Funcs //\\nbool intersectLL(const L &l, const L &m) {return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || abs(cross(l[1]-l[0], m[0]-l[0])) < EPS;}\\nbool intersectLS(const L &l, const L &s) {return cross(l[1]-l[0], s[0]-l[0])*cross(l[1]-l[0], s[1]-l[0]) < EPS;}\\nbool intersectLP(const L &l, const P &p) {return abs(cross(l[1]-p, l[0]-p)) < EPS;}\\nbool intersectSS(const L &s, const L &t) {return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 && ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;}\\nbool intersectSP(const L &s, const P &p) {return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS;}\\n \\n// Where is Point in Polygon? //\\n#define curr(P, i) P[i]\\n#define next(P, i) P[(i+1)%P.size()]\\nenum { OUT, ON, IN };\\nint contains(const polygon& P, const point& p) {\\n\\tbool in = false;\\n\\tfor (int i = 0; i < P.size(); ++i) {\\n\\t\\tpoint a = curr(P,i) - p, b = next(P,i) - p;\\n\\t\\tif (imag(a) > imag(b)) swap(a, b);\\n\\t\\tif (imag(a) <= 0 && 0 < imag(b))\\n\\t\\t\\tif (cross(a, b) < 0) in = !in;\\n\\t\\tif (cross(a, b) == 0 && dot(a, b) <= 0) return ON;\\n\\t}\\n\\treturn in ? IN : OUT;\\n}\\n// Area of Polygon //\\ndouble area2(const polygon& P) {\\n\\tdouble A = 0;\\n\\tfor (int i = 0; i < P.size(); ++i)A += cross(curr(P, i), next(P, i));\\n\\treturn A;\\n}\\n// Totsuhou! Andrew's Monotone Chain //\\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 \\nP projection(const L &l, const P &p) {double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);return l[0] + t*(l[0]-l[1]);}\\nP reflection(const L &l, const P &p) {return p + 2.0 * (projection(l, p) - p);}\\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\\treturn intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\\n}\\ndouble distanceLS(const L &l, const L &s) {\\n\\tif (intersectLS(l, s)) return 0;\\n\\treturn min(distanceLP(l, s[0]), distanceLP(l, s[1]));\\n}\\ndouble distanceSP(const L &s, const P &p) {\\n\\tconst P r = projection(s, p);\\n\\tif (intersectSP(s, r)) return abs(r - p);\\n\\treturn min(abs(s[0] - p), abs(s[1] - p));\\n}\\ndouble distanceSS(const L &s, const L &t) {\\n\\tif (intersectSS(s, t)) return 0;\\n\\treturn min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),min(distanceSP(t, s[0]), distanceSP(t, s[1])));\\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}\\n \\nvector<P> C_cp(C a,C b){\\n\\tvector<P> ret;\\n\\tdouble L = abs(a.p-b.p);\\n \\n\\t/* anma dekitenai */\\n\\tif(\\tL-a.r-b.r > EPS || (abs(a.p-b.p)<EPS && fabs(a.r-b.r)<EPS) || \\n\\t\\tabs(a.p-b.p) < abs(a.r-b.r)\\n\\t)return ret;\\n \\n\\tdouble theta = atan2(b.p.imag()-a.p.imag(),b.p.real()-a.p.real());\\n\\tdouble c = (L*L+a.r*a.r-b.r*b.r)/(2*L*a.r);\\n\\tret.push_back(\\n\\t\\tP(a.p.real()+a.r*cos(theta+acos(c)),\\n\\t\\t a.p.imag()+a.r*sin(theta+acos(c)))\\n\\t);\\n\\tif(fabs(L-a.r-b.r) > EPS)\\n\\t\\tret.push_back(\\n\\t\\t\\tP(a.p.real()+a.r*cos(theta-acos(c)),\\n\\t\\t\\t a.p.imag()+a.r*sin(theta-acos(c)))\\n\\t\\t);\\n\\treturn ret;\\n}\\n \\n \\nP getPedal(L l, P p){\\n\\tdouble A;\\n\\tif(abs(l[1].real()-l[0].real()) < EPS){\\n\\t\\treturn P(l[1].real(),p.imag()); // important\\n\\t}else{\\n\\t\\tA = (l[1].imag()-l[0].imag())/(l[1].real()-l[0].real());\\n\\t}\\n\\tdouble a = -A , b = 1 , c = A*l[0].real() - l[0].imag();\\n\\tdouble t = (a*p.real() + b*p.imag() + c)/(a*a+b*b);\\n\\treturn p-t * P(a,b);\\n}\\n \\nvector<P> crosspointCL(const L l, const C c){\\n\\tvector<P> ret;\\n\\tP p = getPedal(l,c.p);\\n\\tif(\\tabs(p-c.p) > c.r+EPS)return ret;\\n\\tP e = P((l[1]-l[0])/abs(l[1]-l[0]));\\n\\tdouble S = sqrt(c.r*c.r-abs(p-c.p)*abs(p-c.p));\\n\\tret.push_back(p+S*e);\\n\\tret.push_back(p-S*e);\\n\\treturn ret;\\n}\\n \\nP getCircumcenter(P a,P b,P c){\\n\\tdouble A1 = 2 * ( b.real() - a.real() );\\n\\tdouble B1 = 2 * ( b.imag() - a.imag() );\\n\\tdouble C1 = pow(a.real(),2)-pow(b.real(),2) + pow(a.imag(),2)-pow(b.imag(),2);\\n\\tdouble A2 = 2 * ( c.real() - a.real() );\\n\\tdouble B2 = 2 * ( c.imag() - a.imag() );\\n\\tdouble C2 = pow(a.real(),2)-pow(c.real(),2) + pow(a.imag(),2)-pow(c.imag(),2);\\n\\tdouble X = (B1 * C2 - B2 * C1) / (A1 * B2 - A2 * B1);\\n\\tdouble Y = (C1 * A2 - C2 * A1) / (A1 * B2 - A2 * B1);\\n\\treturn P(X,Y);\\n}\\n \\ndouble AreaOfPolygon(vector<P> p){\\n\\tdouble S = 0 ; \\n\\tp.push_back(p[0]);\\n\\t/* 多角形の面積公式 (反時計回りの場合) */\\n\\tfor(int i = 0 ; i < p.size()-1 ; i++){\\n\\t\\tS += (p[i].real() - p[i+1].real()) * (p[i].imag()+p[i+1].imag());\\n\\t}\\n\\tS /= 2.0;\\n\\treturn S;\\n}\\nvector<vector<L> > rect;\\n\\nvector<C> c;\\ndouble seg(double y){\\n\\tL l = L(P(0,y),P(1,y));\\n\\tvector< pair<double,double> > segs;\\n\\tfor(int i = 0 ; i < c.size() ; i++){\\n\\t\\tvector<P> cp = crosspointCL(l,c[i]);\\n\\t\\tif( cp.size() ){\\n\\t\\t\\tdouble a = cp[0].real(), b = cp[1].real();\\n\\t\\t\\tif( a > b ) swap(a,b);\\n\\t\\t\\tsegs.push_back(mp(a,b));\\n\\t\\t}\\n\\t}\\n\\tfor(int i = 0 ; i < rect.size() ; i++){\\n\\t\\tdouble mx = -1e9;\\n\\t\\tdouble mi = 1e9;\\n\\t\\tfor(int j = 0 ; j < 4 ; j++){\\n\\t\\t\\tif( intersectLS(l,rect[i][j]) ){\\n\\t\\t\\t\\tdouble x = crosspoint(rect[i][j],l).real();\\n\\t\\t\\t\\tmx = max(mx,x);\\n\\t\\t\\t\\tmi = min(mi,x);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif( mi > mx ) continue;\\n\\t\\t//cout << mi << \\\" \\\" << mx << endl;\\n\\t\\tsegs.push_back(mp(mi,mx));\\n\\t}\\n\\tvector< pair<double,double> > tmpseg;\\n\\tfor(int i = 0 ; i < segs.size() ; i++){\\n\\t\\tif( segs[i].second < -5 ) continue;\\n\\t\\tif( segs[i].first > 5 ) continue;\\n\\t\\tsegs[i].first = max(-5.,segs[i].first);\\n\\t\\tsegs[i].second = min(5.,segs[i].second);\\n\\t\\ttmpseg.push_back(segs[i]);\\n\\t}\\n\\tsegs = tmpseg;\\n\\t\\n\\tif( segs.size() == 0 ) return 0.0;\\n\\tsort(segs.begin(),segs.end());\\n\\tdouble st = segs[0].first;\\n\\tdouble en = segs[0].second;\\n\\tdouble ans = 0;\\n\\tfor(int i = 1 ; i < segs.size() ; i++){\\n\\n\\t\\tif( en < segs[i].first ){\\n\\t\\t\\tans += en - st;\\n\\t\\t\\tst = segs[i].first;\\n\\t\\t\\ten = segs[i].second;\\n\\t\\t}else{\\n\\t\\t\\ten = max(en,segs[i].second);\\n\\t\\t}\\n\\t}\\n\\tans += en - st;\\n\\treturn ans;\\n}\\nint main(){\\n\\tint N;\\n\\twhile(cin >> N && N){\\n\\t\\tc.clear();\\n\\t\\trect.clear();\\n\\t\\tfor(int i = 0 ; i < N ; i++){\\n\\t\\t\\tP a,b;\\n\\t\\t\\tdouble r;\\n\\t\\t\\tcin >> a >> b >> r;\\n\\t\\t\\tP e = (b - a) / abs(b-a);\\n\\t\\t\\te = P(-e.imag(),e.real());\\n\\t\\t\\tvector<L> ln;\\n\\t\\t\\tP A = a + e * r;\\n\\t\\t\\tP B = a - e * r;\\n\\t\\t\\tP C = b - e * r;\\n\\t\\t\\tP D = b + e * r;\\n\\t\\t\\tln.push_back(L(A,B));\\n\\t\\t\\tln.push_back(L(B,C));\\n\\t\\t\\tln.push_back(L(C,D));\\n\\t\\t\\tln.push_back(L(D,A));\\n\\t\\t\\t\\n\\t\\t\\trect.push_back(ln);\\n\\t\\t\\tc.push_back(::C(a,r));\\n\\t\\t\\tc.push_back(::C(b,r));\\n\\t\\t}\\n\\t\\tdouble ans = 0;\\n\\t\\tint D = 20000;\\n\\t\\t//cout << seg(1.3) << endl;\\n\\t\\t//return 0;\\n\\t\\tfor(int i = 0 ; i < D ; i++){\\n\\t\\t\\tdouble y = -5 + 10. * i / D;\\n\\t\\t\\tans += seg(y) * (1./D);\\n\\t\\t}\\n\\t\\tprintf(\\\"%.10lf%c\\\",ans*10,10);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 960,\n \"memory_kb\": 1312,\n \"score_of_the_acc\": -0.4972,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1091,"cells":{"group_id":{"kind":"string","value":"aoj_2057_cpp"},"problem_description":{"kind":"string","value":"The Closest Circle\nYou are given\nN\nnon-overlapping circles in xy-plane. The radius of each circle varies, but the radius of\nthe largest circle is not double longer than that of the smallest.\nFigure 1: The Sample Input\nThe distance between two circles\nC\n1\nand\nC\n2\nis given by the usual formula\nwhere (\nx\ni\n,\ny\ni\n) is the coordinates of the center of the circle\nC\ni\n, and\nr\ni\nis the radius of\nC\ni\n, for\ni\n= 1, 2.\nYour task is to write a program that finds the closest pair of circles and print their distance.\nInput\nThe input consists of a series of test cases, followed by a single line only containing a single zero, which\nindicates the end of input.\nEach test case begins with a line containing an integer\nN\n(2 ≤\nN\n≤ 100000), which indicates the number\nof circles in the test case.\nN\nlines describing the circles follow. Each of the\nN\nlines has three decimal\nnumbers\nR\n,\nX\n, and\nY\n. R represents the radius of the circle.\nX\nand\nY\nrepresent the\nx\n- and\ny\n-coordinates of\nthe center of the circle, respectively.\nOutput\nFor each test case, print the distance between the closest circles. You may print any number of digits\nafter the decimal point, but the error must not exceed 0.00001.\nSample Input\n4\n1.0 0.0 0.0\n1.5 0.0 3.0\n2.0 4.0 0.0\n1.0 3.0 4.0\n0\nOutput for the Sample Input\n0.5"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2057_10946135","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <cmath>\n#define ele int\nusing namespace std;\n#define maxn 100010\n#define INF 1e18\n#define eps 1e-7\nstruct circle{\n\tdouble x,y,r;\n};\nele n;\ndouble R;\ncircle a[maxn];\ninline bool cmp1(circle a,circle b){\n\treturn a.x<b.x;\n}\ninline bool cmp2(circle a,circle b){\n\treturn a.y<b.y;\n}\ninline double dis(circle a,circle b){\n\treturn sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y))-a.r-b.r;\n}\ndouble solve(ele l,ele r){\n\tif (r-l+1<=2){\n\t\tdouble ans=INF;\n\t\tfor (int i=l; i<=r; ++i)\n\t\t\tfor (int j=i+1; j<=r; ++j)\n\t\t\t\tans=min(ans,dis(a[i],a[j]));\n\t\treturn ans;\n\t}\n\tele mid=(l+r)>>1;\n\tdouble ans=min(solve(l,mid-1),solve(mid+1,r));\n\tfor (int i=l; i<=r; ++i)\n\t\tif (i!=mid) ans=min(ans,dis(a[i],a[mid]));\n\tstatic circle p[maxn],q[maxn];\n\tele u=0,v=0;\n\tfor (int i=l; i<mid; ++i)\n\t\tif (a[mid].x-a[i].x<ans+R*2+eps) p[u++]=a[i];\n\tfor (int i=mid+1; i<=r; ++i)\n\t\tif (a[i].x-a[mid].x<ans+R*2+eps) q[v++]=a[i];\n\tif (!v) return ans;\n\tsort(p,p+u,cmp2); sort(q,q+v,cmp2);\n\tele s=0,t=0;\n\tfor (int i=0; i<u; ++i){\n\t\twhile (s<v-1 && p[i].y-q[s].y>ans+R*2+eps) ++s;\n\t\twhile (t<v-1 && q[t+1].y-p[i].y<ans+R*2+eps) ++t;\n\t\tfor (int j=s; j<=t; ++j) ans=min(ans,dis(p[i],q[j]));\n\t}\n\treturn ans;\n}\nint main(){\n\twhile (scanf(\"%d\",&n),n){\n\t\tR=0;\n\t\tfor (int i=0; i<n; ++i){\n\t\t\tscanf(\"%lf%lf%lf\",&a[i].r,&a[i].x,&a[i].y);\n\t\t\tR=max(R,a[i].r);\n\t\t}\n\t\tsort(a,a+n,cmp1);\n\t\tprintf(\"%.10lf\\n\",solve(0,n-1));\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":180,"memory_kb":9072,"score_of_the_acc":-0.3064,"final_rank":9},{"submission_id":"aoj_2057_7290550","code_snippet":"#include <bits/stdc++.h>\n#include <iomanip>\nusing namespace std;\n\nint n;\nconst double INF = 1e9;\ndouble pr, px, py;\n\nstruct circle {\n\tdouble r, x, y;\n\n\tbool operator < (const circle& rhs) const\n\t{\n\t\treturn x < rhs.x || (x == rhs.x && y < rhs.y);\n\t}\n};\n\ncircle a[100000];\n\nbool compare_y(circle a, circle b) {\n\treturn a.y < b.y;\n}\n\ndouble closest_pair(circle* a, int n) {\n\tif (n <= 1)\n\t\treturn INF;\n\n\tint m = n / 2;\n\tdouble x = a[m].x, r = a[m].r;\n\tdouble d = min(closest_pair(a, m), closest_pair(a + m, n - m));\n\tinplace_merge(a, a + m, a + n, compare_y);\n\n\tvector<circle> b;\n\n\tfor (int i = 0; i < n; i++) {\n\t\tif (fabs(a[i].x - x) >= d + r + a[i].r)\n\t\t\tcontinue;\n\n\t\tint w = b.size();\n\n\t\tfor (int j = 0; j < w; j++) {\n\t\t\tdouble dx = a[i].x - b[w - j - 1].x;\n\t\t\tdouble dy = a[i].y - b[w - j - 1].y;\n\n\t\t\tif (dy >= d + r + a[i].r)\n\t\t\t\tbreak;\n\n\t\t\td = min(d, sqrt(dx * dx + dy * dy) - a[i].r - b[w - j - 1].r);\n\t\t}\n\n\t\tb.push_back(a[i]);\n\t}\n\n\treturn d;\n}\n\nint main()\n{\n\tcin >> n;\n\n\twhile (n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> pr >> px >> py;\n\t\t\tcircle w = { pr, px, py };\n\t\t\ta[i] = w;\n\t\t}\n\n\t\tsort(a, a + n);\n\n\t\tcout << setiosflags(ios::fixed | ios::showpoint) << setprecision(6)\n\t\t\t<< closest_pair(a, n) << endl;\n\n\t\tcin >> n;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":480,"memory_kb":10800,"score_of_the_acc":-0.4444,"final_rank":14},{"submission_id":"aoj_2057_6894832","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\n#include <cmath>\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\nstruct point {\n double x, y, r;\n};\n\nconst ll inf = 1e18;\n\nvoid chmin(double& x, double y) { x = min(x, y); }\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)) - a.r - b.r;\n}\n\ndouble closestpair(vi<point>& d, int l, int r, const double mxr) {\n if (r - l == 1) return inf;\n const int mid = (l + r) / 2;\n point m = d[mid];\n double vl = closestpair(d, l, mid, mxr);\n double vr = closestpair(d, mid, r, mxr);\n double ans = min(vl, vr);\n inplace_merge(d.begin() + l, d.begin() + mid, d.begin() + r, \n [&](point a, point b) {return a.y < b.y; });\n\n vi<point> midreg;\n for (int i = l; i < r; i++) {\n if (abs(d[i].x - m.x) >= ans + mxr * 2) continue;\n int len = midreg.size();\n for (int j = len - 1; j >= 0; j--) {\n if (d[i].y - midreg[j].y >= ans + mxr * 2) break;\n chmin(ans, dist(d[i], midreg[j]));\n }\n midreg.push_back(d[i]);\n }\n return ans;\n}\n\nint main()\n{\n int n;\n while (cin >> n, n) {\n vi<point> d(n);\n rep(i, n) cin >> d[i].r >> d[i].x >> d[i].y;\n double mxr = 0;\n rep(i, n) mxr = max(mxr, d[i].r);\n sort(d.begin(), d.end(), [&](point a, point b) {return a.x < b.x; });\n double res = closestpair(d, 0, n, mxr);\n cout << fixed << setprecision(12) << res << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":380,"memory_kb":11336,"score_of_the_acc":-0.4577,"final_rank":15},{"submission_id":"aoj_2057_5146090","code_snippet":"// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing pii = pair<int, int>;\nusing vvl = vector<vector<ll>>;\nusing vvi = vector<vector<int>>;\nusing vvpll = vector<vector<pll>>;\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--)\n#define pb push_back\n#define tostr to_string\n#define ALL(A) A.begin(), A.end()\n#define elif else if\n// constexpr ll INF = LONG_LONG_MAX;\nconstexpr ll INF = 1e18;\nconstexpr ll MOD = 1000000007;\n\nconst string digits = \"0123456789\";\nconst string ascii_lowercase = \"abcdefghijklmnopqrstuvwxyz\";\nconst string ascii_uppercase = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\n\ntemplate<typename T> vector<vector<T>> list2d(int N, int M, T init) { return vector<vector<T>>(N, vector<T>(M, init)); }\ntemplate<typename T> vector<vector<vector<T>>> list3d(int N, int M, int L, T init) { return vector<vector<vector<T>>>(N, vector<vector<T>>(M, vector<T>(L, init))); }\ntemplate<typename T> vector<vector<vector<vector<T>>>> list4d(int N, int M, int L, int O, T init) { return vector<vector<vector<vector<T>>>>(N, vector<vector<vector<T>>>(M, vector<vector<T>>(L, vector<T>(O, init)))); }\n\nvector<ll> LIST(ll N) { vector<ll> A(N); rep(i, 0, N) cin >> A[i]; return A; }\n\nvoid print(ld out) { cout << fixed << setprecision(15) << out << '\\n'; }\nvoid print(double out) { cout << fixed << setprecision(15) << out << '\\n'; }\ntemplate<typename T> void print(T out) { cout << out << '\\n'; }\ntemplate<typename T1, typename T2> void print(pair<T1, T2> out) { cout << out.first << ' ' << out.second << '\\n'; }\ntemplate<typename T> void print(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\\n' : ' '); } }\ntemplate<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }\n\nvoid Yes() { print(\"Yes\"); }\nvoid No() { print(\"No\"); }\nvoid YES() { print(\"YES\"); }\nvoid NO() { print(\"NO\"); }\n\nll floor(ll a, ll b) { if (a < 0) { return (a-b+1) / b; } else { return a / b; } }\nll ceil(ll a, ll b) { if (a >= 0) { return (a+b-1) / b; } else { return a / b; } }\npll divmod(ll a, ll b) { ll d = a / b; ll m = a % b; return {d, m}; }\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\ntemplate<typename T> bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; }\n\ntemplate<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }\ntemplate<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }\ntemplate<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }\n\nll toint(string s) { ll res = 0; for (char c : s) { res *= 10; res += (c - '0'); } return res; }\nint toint(char num) { return num - '0'; }\nchar tochar(int num) { return '0' + num; }\nint ord(char c) { return (int)c; }\nchar chr(int a) { return (char)a; }\n\nll pow(ll x, ll n) { ll res = 1; rep(_, 0, n) res *= x; return res; }\nll pow(ll x, ll n, int mod) { ll res = 1; while (n > 0) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; }\n\nint popcount(ll S) { return __builtin_popcountll(S); }\nll gcd(ll a, ll b) { return __gcd(a, b); }\nll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }\n\ntemplate<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }\ntemplate<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while (1) {\n ll N;\n cin >> N;\n if (N == 0) break;\n\n vector<tuple<ld, ld, ld>> XY;\n rep(i, 0, N) {\n ld x, y, r;\n cin >> r >> x >> y;\n XY.pb({x, y, r});\n }\n sort(ALL(XY));\n\n auto rec = [&](auto&& f, vector<tuple<ld, ld, ld>> XY) -> ld {\n ll n = XY.size();\n if (n <= 1) return INF;\n ll m = n/2;\n ld l = get<0>(XY[m]);\n ld d = min(f(f, vector<tuple<ld, ld, ld>>(XY.begin(), XY.begin()+m)), \n f(f, vector<tuple<ld, ld, ld>>(XY.begin()+m, XY.end())));\n\n sort(ALL(XY), [](tuple<ld, ld, ld> a, tuple<ld, ld, ld> b) { return get<1>(a) < get<1>(b); });\n ld mxr = 0;\n for (auto& [x, y, r] : XY) chmax(mxr, r);\n rep(i, 0, n) {\n auto [x1, y1, r1] = XY[i];\n if (abs(l-x1)-mxr*2 >= d) continue;\n rep(j, i+1, n) {\n auto [x2, y2, r2] = XY[j];\n if (abs(y1-y2)-mxr*2 >= d) break;\n chmin(d, sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2))-r1-r2);\n }\n }\n return d;\n };\n ld ans = rec(rec, XY);\n print(ans);\n }\n return 0;\n}","accuracy":1,"time_ms":420,"memory_kb":22224,"score_of_the_acc":-1.0443,"final_rank":20},{"submission_id":"aoj_2057_3167870","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define EPS 1e-10\ntypedef pair<double,int> P;\nstruct Point{double x,y,r;};\nint n;\nPoint p[100010];\n\ndouble cl(int i,int j,double k=0.0){\n return sqrt(pow(p[i].x-p[j].x,2)+pow(p[i].y-p[j].y,2))-(p[i].r+p[j].r+k*2.0);\n}\n\nint solve(double k){\n \n vector<P> events;\n \n for(int i=0;i<n;i++){\n double x1=p[i].x-p[i].r-k;\n double x2=p[i].x+p[i].r+k;\n events.push_back(P(x1,i));\n events.push_back(P(x2,i+n));\n }\n sort(events.begin(),events.end());\n\n set<P> outers;\n for(int i=0;i<events.size();i++){\n int id=events[i].second%n;\n if(events[i].second<n){\n set<P>::iterator it = outers.lower_bound(P(p[id].y,id));\n if(it!=outers.end()&&cl(id,it->second,k)<=0)return 0;\n if(it!=outers.begin()&&cl(id,(--it)->second,k)<=0)return 0;\n outers.insert(P(p[id].y,id));\n }else{\n outers.erase(P(p[id].y,id));\n }\n }\n return 1;\n}\n\nint main(){\n \n while(cin>>n,n){\n\n for(int i=0;i<n;i++){\n cin>>p[i].r>>p[i].x>>p[i].y;\n }\n\n double ok=0,ng=cl(0,1),mid;\n while(ng-ok>EPS){\n mid=(ok+ng)/2.0;\n if(solve(mid))ok=mid;\n else ng=mid;\n }\n \n printf(\"%.10lf\\n\",ok*2.0);\n }\n return 0;\n}","accuracy":1,"time_ms":2980,"memory_kb":14704,"score_of_the_acc":-1.0342,"final_rank":19},{"submission_id":"aoj_2057_3047498","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <iomanip>\n#include <cmath>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e18;\ntypedef complex<double> P;\n#define X real()\n#define Y imag()\nstruct C{\n P p;\n double r;\n C(const P& p, const double& r) : p(p), r(r) {}\n C(){}\n};\nbool xcomp(const C &a, const C &b){\n return (a.p.X != b.p.X)? a.p.X<b.p.X : a.p.Y<b.p.Y;\n}\nbool ycomp(const C &a, const C &b){\n return (a.p.Y != b.p.Y)? a.p.Y<b.p.Y : a.p.X<b.p.X;\n}\n\ndouble closest(vector<C> &c, int first, int last, double rmax){\n if(last -first <= 1) return INF;\n int mid = (first +last)/2;\n double midx = c[mid].p.X;\n double d = min(closest(c, first, mid, rmax), closest(c, mid, last, rmax));\n inplace_merge(c.begin()+first, c.begin()+mid, c.begin()+last, ycomp);\n\n vector<C> near;\n for(int i=first; i<last; i++){\n if(abs(c[i].p.X -midx) -c[i].r -rmax > d +EPS) continue;\n for(int j=near.size()-1; j>=0; j--){\n if(abs(c[i].p.Y -near[j].p.Y) -c[i].r -rmax > d +EPS){\n break;\n }\n d = min(d, abs(c[i].p -near[j].p) -c[i].r -near[j].r);\n }\n near.push_back(c[i]);\n }\n return d;\n}\n \nint main(){\n while(1){\n int n;\n cin >> n;\n if(n==0) break;\n\n vector<C> c(n);\n double rmax = 0;\n for(int i=0; i<n; i++){\n double r,x,y;\n cin >> r >> x >> y;\n c[i] = C(P(x, y), r);\n rmax = max(rmax, r);\n }\n sort(c.begin(), c.end(), xcomp);\n\n cout << fixed << setprecision(10);\n cout << closest(c, 0, n, rmax) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":500,"memory_kb":10736,"score_of_the_acc":-0.444,"final_rank":13},{"submission_id":"aoj_2057_2812321","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\tbool operator<(const struct Info &arg) const{\n\t\tif(x != arg.x){\n\t\t\treturn x < arg.x;\n\t\t}else{\n\t\t\treturn y < arg.y;\n\t\t}\n\t}\n\tdouble x,y,r;\n};\n\nint N;\nInfo info[100001];\n\nbool compare_y(Info left,Info right){\n\n\treturn left.y < right.y;\n\n}\n\ndouble calc_dist(int a,int b){\n\treturn sqrt((info[a].x-info[b].x)*(info[a].x-info[b].x)+(info[a].y-info[b].y)*(info[a].y-info[b].y))-(info[a].r+info[b].r);\n}\n\ndouble calc_y_dist(int a,int b){\n\treturn (info[b].y-info[b].r)-(info[a].y+info[a].r);\n}\n\ndouble closest_pair(Info* array,int tmp_N){\n\tif(tmp_N <= 1)return DBL_MAX;\n\n\tint mid = tmp_N/2;\n\n\tdouble x = array[mid].x;\n\tdouble dist = min(closest_pair(array,mid),closest_pair(array+mid,tmp_N-mid));\n\tinplace_merge(array,array+mid,array+tmp_N,compare_y);\n\n\tvector<int> V;\n\n\n\tint left,right,m,search_left;\n\n\tfor(int i = 0; i < tmp_N; i++){\n\n\t\tfor(int k = 0; k < min((int)V.size(),2); k++){\n\t\t\tdist = min(dist,calc_dist(V[V.size()-1-k],i));\n\t\t}\n\n\t\tV.push_back(i);\n\t}\n\treturn dist;\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%lf %lf %lf\",&info[i].r,&info[i].x,&info[i].y);\n\t}\n\tsort(info,info+N);\n\n\tprintf(\"%.10lf\\n\",closest_pair(info,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":240,"memory_kb":6924,"score_of_the_acc":-0.2011,"final_rank":5},{"submission_id":"aoj_2057_2812122","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\tbool operator<(const struct Info &arg) const{\n\t\tif(x != arg.x){\n\t\t\treturn x < arg.x;\n\t\t}else{\n\t\t\treturn y < arg.y;\n\t\t}\n\t}\n\tdouble x,y,r;\n};\n\nint N;\nInfo info[100001];\n\nbool compare_y(Info left,Info right){ //順序付け関数\n\n\treturn left.y < right.y;\n\n}\n\nbool is_OK(int index,double x,double dist){\n\tif(info[index].x < x){ //基準線より中心が左\n\t\tif(info[index].x+info[index].r+dist < x){\n\t\t\treturn false;\n\t\t}\n\n\t}else{ //基準線より中心が右\n\t\tif(info[index].x-info[index].r-dist > x){\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\ndouble calc_dist(int a,int b){\n\treturn sqrt((info[a].x-info[b].x)*(info[a].x-info[b].x)+(info[a].y-info[b].y)*(info[a].y-info[b].y))-(info[a].r+info[b].r);\n}\n\ndouble calc_y_dist(int a,int b){\n\treturn (info[b].y-info[b].r)-(info[a].y+info[a].r);\n}\n\ndouble closest_pair(Info* array,int tmp_N){\n\tif(tmp_N <= 1)return DBL_MAX;\n\n\tint mid = tmp_N/2; //中央のインデックス\n\n\tdouble x = array[mid].x; //基準線x\n\tdouble dist = min(closest_pair(array,mid),closest_pair(array+mid,tmp_N-mid)); //集合を2分割し、再帰的に最小距離を求める\n\tinplace_merge(array,array+mid,array+tmp_N,compare_y); //2つのソート済の範囲をマージ\n\n\tvector<int> V; //★★再帰毎にメモリを確保(indexをpush)★★\n\n\n\tint left,right,m,search_left;\n\n\tfor(int i = 0; i < tmp_N; i++){\n\t\t//if(!is_OK(i,x,dist))continue; //基準線より最小距離以上離れている点は無視(★異なる領域間での、新最小値を作り得ないということ★)\n\n\t\t//★★Vはyの昇順に並んでいる:自分よりy座標が小さいもののみ、入っている★★\n\n\t\t//2分探索で、検索範囲を定める\n\t\t/*left = 0,right = V.size()-1,m = (left+right)/2;\n\t\tsearch_left = 0;\n\n\t\twhile(left <= right){\n\t\t\tif(calc_y_dist(V[m],i) < dist){ //y座標の差がdist未満\n\t\t\t\tsearch_left = 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\n\t\t/*for(int k = search_left; k < V.size(); k++){\n\t\t\tdist = min(dist,calc_dist(V[k],i));\n\t\t}*/\n\n\t\tfor(int k = 0; k < min((int)V.size(),2); k++){\n\t\t\tdist = min(dist,calc_dist(V[V.size()-1-k],i));\n\t\t}\n\n\t\tV.push_back(i); //可能性あり集合に、iを追加\n\t}\n\treturn dist;\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%lf %lf %lf\",&info[i].r,&info[i].x,&info[i].y);\n\t}\n\tsort(info,info+N);\n\n\tprintf(\"%.10lf\\n\",closest_pair(info,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":240,"memory_kb":6936,"score_of_the_acc":-0.2017,"final_rank":6},{"submission_id":"aoj_2057_2646312","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\n\n#define EPS (1e-10)\n#define equals(a,b) (fabs((a)-(b)) < EPS)\n#define PI 3.141592653589793238\n \n// COUNTER CLOCKWISE\nstatic const int CCW_COUNTER_CLOCKWISE = 1;\nstatic const int CCW_CLOCKWISE = -1;\nstatic const int CCW_ONLINE_BACK = 2;\nstatic const int CCW_ONLINE_FRONT = -2;\nstatic const int CCW_ON_SEGMENT = 0;\n\n//Intercsect Circle & Circle\nstatic const int ICC_SEPERATE = 4;\nstatic const int ICC_CIRCUMSCRIBE = 3;\nstatic const int ICC_INTERSECT = 2;\nstatic const int ICC_INSCRIBE = 1;\nstatic const int ICC_CONTAIN = 0;\n\nstruct Point{\n double x,y;\n Point(){}\n Point(double x,double y) :x(x),y(y){}\n Point operator+(Point p) {return Point(x+p.x,y+p.y);}\n Point operator-(Point p) {return Point(x-p.x,y-p.y);}\n Point operator*(double k){return Point(x*k,y*k);}\n Point operator/(double k){return Point(x/k,y/k);}\n double norm(){return x*x+y*y;}\n double abs(){return sqrt(norm());}\n\n bool operator < (const Point &p) const{\n return x!=p.x?x<p.x:y<p.y;\n //grid-point only\n //return !equals(x,p.x)?x<p.x:!equals(y,p.y)?y<p.y:0;\n }\n\n bool operator == (const Point &p) const{\n return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;\n }\n};\n\nistream &operator >> (istream &is,Point &p){\n is>>p.x>>p.y;\n return is;\n}\n\nostream &operator << (ostream &os,Point p){\n os<<fixed<<setprecision(12)<<p.x<<\" \"<<p.y;\n return os;\n}\n\nbool sort_x(Point a,Point b){\n return a.x!=b.x?a.x<b.x:a.y<b.y;\n}\n\nbool sort_y(Point a,Point b){\n return a.y!=b.y?a.y<b.y:a.x<b.x;\n}\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nistream &operator >> (istream &is,Polygon &p){\n for(int i=0;i<(int)p.size();i++) cin>>p[i];\n return is;\n}\n\nstruct Segment{\n Point p1,p2;\n Segment(){}\n Segment(Point p1, Point p2):p1(p1),p2(p2){}\n};\ntypedef Segment Line;\n\nistream &operator >> (istream &is,Segment &s){\n is>>s.p1>>s.p2;\n return is;\n}\n\nstruct Circle{\n Point c;\n double r;\n Circle(){}\n Circle(Point c,double r):c(c),r(r){}\n};\n\nistream &operator >> (istream &is,Circle &c){\n is>>c.c>>c.r;\n return is;\n}\n\ndouble norm(Vector a){\n return a.x*a.x+a.y*a.y;\n}\ndouble abs(Vector a){\n return sqrt(norm(a));\n}\ndouble dot(Vector a,Vector b){\n return a.x*b.x+a.y*b.y;\n}\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\nbool isOrthogonal(Vector a,Vector b){\n return equals(dot(a,b),0.0);\n}\n\nbool isOrthogonal(Point a1,Point a2,Point b1,Point b2){\n return isOrthogonal(a1-a2,b1-b2);\n}\n\nbool isOrthogonal(Segment s1,Segment s2){\n return equals(dot(s1.p2-s1.p1,s2.p2-s2.p1),0.0);\n}\n\nbool isParallel(Vector a,Vector b){\n return equals(cross(a,b),0.0);\n}\n\nbool isParallel(Point a1,Point a2,Point b1,Point b2){\n return isParallel(a1-a2,b1-b2);\n}\n\nbool isParallel(Segment s1,Segment s2){\n return equals(cross(s1.p2-s1.p1,s2.p2-s2.p1),0.0); \n}\n\nPoint project(Segment s,Point p){\n Vector base=s.p2-s.p1;\n double r=dot(p-s.p1,base)/norm(base);\n return s.p1+base*r;\n}\n\nPoint reflect(Segment s,Point p){\n return p+(project(s,p)-p)*2.0;\n}\n\ndouble arg(Vector p){\n return atan2(p.y,p.x);\n}\n\nVector polar(double a,double r){\n return Point(cos(r)*a,sin(r)*a);\n}\n\nint ccw(Point p0,Point p1,Point p2);\nbool intersectSS(Point p1,Point p2,Point p3,Point p4);\nbool intersectSS(Segment s1,Segment s2);\nbool intersectPS(Polygon p,Segment l);\nint intersectCC(Circle c1,Circle c2);\nbool intersectSC(Segment s,Circle c);\ndouble getDistanceLP(Line l,Point p);\ndouble getDistanceSP(Segment s,Point p);\ndouble getDistanceSS(Segment s1,Segment s2);\nPoint getCrossPointSS(Segment s1,Segment s2);\nPoint getCrossPointLL(Line l1,Line l2);\nPolygon getCrossPointCL(Circle c,Line l);\nPolygon getCrossPointCC(Circle c1,Circle c2);\nint contains(Polygon g,Point p);\nPolygon andrewScan(Polygon s);\nPolygon convex_hull(Polygon ps);\ndouble diameter(Polygon s);\nbool isConvex(Polygon p);\ndouble area(Polygon s);\nPolygon convexCut(Polygon p,Line l);\nLine bisector(Point p1,Point p2);\nVector translate(Vector v,double theta);\nvector<Line> corner(Line l1,Line l2);\n\nint ccw(Point p0,Point p1,Point p2){\n Vector a = p1-p0;\n Vector b = p2-p0;\n if(cross(a,b) > EPS) return CCW_COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS) return CCW_CLOCKWISE;\n if(dot(a,b) < -EPS) return CCW_ONLINE_BACK;\n if(a.norm()<b.norm()) return CCW_ONLINE_FRONT;\n return CCW_ON_SEGMENT;\n}\n\nbool intersectSS(Point p1,Point p2,Point p3,Point p4){\n return (ccw(p1,p2,p3)*ccw(p1,p2,p4) <= 0 &&\n\t ccw(p3,p4,p1)*ccw(p3,p4,p2) <= 0 );\n}\n\nbool intersectSS(Segment s1,Segment s2){\n return intersectSS(s1.p1,s1.p2,s2.p1,s2.p2);\n}\n\nbool intersectPS(Polygon p,Segment l){\n int n=p.size();\n for(int i=0;i<n;i++)\n if(intersectSS(Segment(p[i],p[(i+1)%n]),l)) return 1;\n return 0;\n}\n\nint intersectCC(Circle c1,Circle c2){\n if(c1.r<c2.r) swap(c1,c2);\n double d=abs(c1.c-c2.c);\n double r=c1.r+c2.r;\n if(equals(d,r)) return ICC_CIRCUMSCRIBE;\n if(d>r) return ICC_SEPERATE;\n if(equals(d+c2.r,c1.r)) return ICC_INSCRIBE;\n if(d+c2.r<c1.r) return ICC_CONTAIN;\n return ICC_INTERSECT;\n}\n\nbool intersectSC(Segment s,Circle c){\n double d=getDistanceSP(s,c.c);\n return d<=c.r;\n}\n\ndouble getDistanceLP(Line l,Point p){\n return abs(cross(l.p2-l.p1,p-l.p1)/abs(l.p2-l.p1));\n}\n\ndouble getDistanceSP(Segment s,Point p){\n if(dot(s.p2-s.p1,p-s.p1) < 0.0 ) return abs(p-s.p1);\n if(dot(s.p1-s.p2,p-s.p2) < 0.0 ) return abs(p-s.p2);\n return getDistanceLP(s,p);\n}\n\ndouble getDistanceSS(Segment s1,Segment s2){\n if(intersectSS(s1,s2)) return 0.0;\n return min(min(getDistanceSP(s1,s2.p1),getDistanceSP(s1,s2.p2)),\n\t min(getDistanceSP(s2,s1.p1),getDistanceSP(s2,s1.p2)));\n}\n\nPoint getCrossPointSS(Segment s1,Segment s2){\n Vector base=s2.p2-s2.p1;\n double d1=abs(cross(base,s1.p1-s2.p1));\n double d2=abs(cross(base,s1.p2-s2.p1));\n double t=d1/(d1+d2);\n return s1.p1+(s1.p2-s1.p1)*t;\n}\n\nPoint getCrossPointLL(Line l1,Line l2){\n double a=cross(l1.p2-l1.p1,l2.p2-l2.p1);\n double b=cross(l1.p2-l1.p1,l1.p2-l2.p1);\n if(abs(a)<EPS&&abs(b)<EPS) return l2.p1;\n return l2.p1+(l2.p2-l2.p1)*(b/a);\n}\n\nPolygon getCrossPointCL(Circle c,Line l){\n Polygon p(2);\n Vector pr=project(l,c.c);\n Vector e=(l.p2-l.p1)/abs(l.p2-l.p1);\n double base=sqrt(c.r*c.r-norm(pr-c.c));\n p[0]=pr+e*base;\n p[1]=pr-e*base;\n return p;\n}\n\nPolygon getCrossPointCC(Circle c1,Circle c2){\n Polygon p(2);\n double d=abs(c1.c-c2.c);\n double a=acos((c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d));\n double t=arg(c2.c-c1.c);\n p[0]=c1.c+polar(c1.r,t+a);\n p[1]=c1.c+polar(c1.r,t-a);\n return p;\n}\n\n// IN:2 ON:1 OUT:0\nint contains(Polygon g,Point p){\n int n=g.size();\n bool x=false;\n for(int i=0;i<n;i++){\n Point a=g[i]-p,b=g[(i+1)%n]-p;\n if(fabs(cross(a,b)) < EPS && dot(a,b) < EPS) return 1;\n if(a.y>b.y) swap(a,b);\n if(a.y < EPS && EPS < b.y && cross(a,b) > EPS ) x = !x;\n }\n return (x?2:0);\n}\n\nPolygon andrewScan(Polygon s){\n Polygon u,l;\n if(s.size()<3) return s;\n sort(s.begin(),s.end());\n u.push_back(s[0]);\n u.push_back(s[1]);\n l.push_back(s[s.size()-1]);\n l.push_back(s[s.size()-2]);\n for(int i=2;i<(int)s.size();i++){\n for(int n=u.size();n>=2&&ccw(u[n-2],u[n-1],s[i])!=CCW_CLOCKWISE;n--){\n u.pop_back();\n }\n u.push_back(s[i]);\n } \n for(int i=s.size()-3;i>=0;i--){\n for(int n=l.size();n>=2&&ccw(l[n-2],l[n-1],s[i])!=CCW_CLOCKWISE;n--){\n l.pop_back();\n }\n l.push_back(s[i]);\n }\n reverse(l.begin(),l.end());\n for(int i=u.size()-2;i>=1;i--) l.push_back(u[i]);\n return l;\n} \n\nPolygon convex_hull(Polygon ps){\n int n=ps.size();\n sort(ps.begin(),ps.end(),sort_y);\n int k=0;\n Polygon qs(n*2);\n for(int i=0;i<n;i++){\n while(k>1&&cross(qs[k-1]-qs[k-2],ps[i]-qs[k-1])<0) k--;\n qs[k++]=ps[i];\n }\n for(int i=n-2,t=k;i>=0;i--){\n while(k>t&&cross(qs[k-1]-qs[k-2],ps[i]-qs[k-1])<0) k--;\n qs[k++]=ps[i];\n }\n qs.resize(k-1);\n return qs;\n}\n\ndouble diameter(Polygon s){\n Polygon p=s;\n int n=p.size();\n if(n==2) return abs(p[0]-p[1]);\n int i=0,j=0;\n for(int k=0;k<n;k++){\n if(p[i]<p[k]) i=k;\n if(!(p[j]<p[k])) j=k;\n }\n double res=0;\n int si=i,sj=j;\n while(i!=sj||j!=si){\n res=max(res,abs(p[i]-p[j]));\n if(cross(p[(i+1)%n]-p[i],p[(j+1)%n]-p[j])<0.0){\n i=(i+1)%n;\n }else{\n j=(j+1)%n;\n }\n }\n return res;\n}\n\nbool isConvex(Polygon p){\n bool f=1;\n int n=p.size();\n for(int i=0;i<n;i++){\n int t=ccw(p[(i+n-1)%n],p[i],p[(i+1)%n]);\n f&=t!=CCW_CLOCKWISE;\n }\n return f;\n}\n\ndouble area(Polygon s){\n double res=0;\n for(int i=0;i<(int)s.size();i++){\n res+=cross(s[i],s[(i+1)%s.size()])/2.0;\n }\n return abs(res);\n}\n\ndouble area(Circle c1,Circle c2){\n double d=abs(c1.c-c2.c);\n if(c1.r+c2.r<=d+EPS) return 0;\n if(d<=abs(c1.r-c2.r)){\n double r=min(c1.r,c2.r);\n return PI*r*r;\n }\n double rc=(d*d+c1.r*c1.r-c2.r*c2.r)/(2*d);\n double th=acos(rc/c1.r);\n double ph=acos((d-rc)/c2.r);\n return c1.r*c1.r*th+c2.r*c2.r*ph-d*c1.r*sin(th);\n}\n\nPolygon convexCut(Polygon p,Line l){\n Polygon q;\n for(int i=0;i<(int)p.size();i++){\n Point a=p[i],b=p[(i+1)%p.size()];\n if(ccw(l.p1,l.p2,a)!=-1) q.push_back(a);\n if(ccw(l.p1,l.p2,a)*ccw(l.p1,l.p2,b)<0)\n q.push_back(getCrossPointLL(Line(a,b),l));\n }\n return q;\n}\n\nLine bisector(Point p1,Point p2){\n Circle c1=Circle(p1,abs(p1-p2)),c2=Circle(p2,abs(p1-p2));\n Polygon p=getCrossPointCC(c1,c2);\n if(cross(p2-p1,p[0]-p1)>0) swap(p[0],p[1]);\n return Line(p[0],p[1]);\n}\n\nVector translate(Vector v,double theta){\n Vector res;\n res.x=cos(theta)*v.x-sin(theta)*v.y;\n res.y=sin(theta)*v.x+cos(theta)*v.y;\n return res;\n}\n\nvector<Line> corner(Line l1,Line l2){\n vector<Line> res;\n if(isParallel(l1,l2)){\n double d=getDistanceLP(l1,l2.p1)/2.0;\n Vector v1=l1.p2-l1.p1;\n v1=v1/v1.abs()*d;\n Point p=l2.p1+translate(v1,90.0*(PI/180.0));\n double d1=getDistanceLP(l1,p);\n double d2=getDistanceLP(l2,p);\n if(abs(d1-d2)>d){\n p=l2.p1+translate(v1,-90.0*(PI/180.0));\n }\n res.push_back(Line(p,p+v1));\n }else{\n Point p=getCrossPointLL(l1,l2);\n Vector v1=l1.p2-l1.p1,v2=l2.p2-l2.p1;\n v1=v1/v1.abs();\n v2=v2/v2.abs();\n res.push_back(Line(p,p+(v1+v2)));\n res.push_back(Line(p,p+translate(v1+v2,90.0*(PI/180.0))));\n }\n return res;\n}\n\nPolygon tangent(Circle c1,Point p2){\n Circle c2=Circle(p2,sqrt(norm(c1.c-p2)-c1.r*c1.r));\n Polygon p=getCrossPointCC(c1,c2);\n sort(p.begin(),p.end());\n return p;\n}\n\n\ntemplate<typename T>\nvoid chmin(T &a,T b){if(a>b) a=b;}\ntemplate<typename T>\nvoid chmax(T &a,T b){if(a<b) a=b;}\n\n\nsigned main(){\n int n;\n while(cin>>n,n){\n vector<Circle> v(n);\n for(int i=0;i<n;i++) cin>>v[i].r>>v[i].c;\n auto calc=[](Circle a,Circle b){\n return abs(a.c-b.c)-(a.r+b.r);\n };\n double ans=calc(v[0],v[1]);\n for(int k=0;k<10;k++){\n sort(v.begin(),v.end(),[](Circle a,Circle b){return sort_x(a.c,b.c);});\n for(int i=0;i<n-1;i++) chmin(ans,calc(v[i],v[i+1]));\n sort(v.begin(),v.end(),[](Circle a,Circle b){return sort_y(a.c,b.c);});\n for(int i=0;i<n-1;i++) chmin(ans,calc(v[i],v[i+1]));\n for(int i=0;i<n;i++) v[i].c=translate(v[i].c,PI/100);\n }\n cout<<fixed<<setprecision(12)<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":690,"memory_kb":5708,"score_of_the_acc":-0.2049,"final_rank":7},{"submission_id":"aoj_2057_2645155","code_snippet":"#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\n \ntypedef pair<double,double> P;\ntypedef pair<P,double> P2;\n \nP rot(P p, double a){\n a=a*M_PI/180.0;\n return P(p.first*cos(a)+p.second*(-sin(a)),\n p.first*sin(a)+p.second*cos(a));\n}\n \ndouble abss(P a,P b){\n return sqrt((a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second));\n}\n \ndouble x,y,r;int tt;\nvector<P2>v;\nint main(){\n \n int n;\n while(cin >> n,n){\n \n double ans=1e13;\n \n v.clear();\n \n r(i,n){\n cin>>r>>x>>y;\n v.push_back(P2(P(x,y),r));\n }\n \n r(i,1){\n sort(v.begin(),v.end());\n r(j,n){\n for(int k=j+1,c=0;k<n;k++,c++){\n if(c>50)break;\n ans=min(ans,abss(v[k].first,v[j].first)-v[k].second-v[j].second);\n }\n }\n r(j,n)v[i].first=rot(v[i].first,0.5);\n }\n \n printf(\"%.9f\\n\",ans);\n \n }\n \n return 0;\n}","accuracy":1,"time_ms":460,"memory_kb":6220,"score_of_the_acc":-0.1971,"final_rank":4},{"submission_id":"aoj_2057_2644955","code_snippet":"#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\n\ntypedef pair<double,double> P;\ntypedef pair<P,double> P2;\n\nP rot(P p, double a){\n a=a*M_PI/180.0;\n return P(p.first*cos(a)+p.second*(-sin(a)),\n p.first*sin(a)+p.second*cos(a));\n}\n\ndouble abss(P a,P b){\n return sqrt((a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second));\n}\n\ndouble x,y,r;int tt;\nvector<P2>v;\nint main(){\n\n int n;\n while(cin >> n,n){\n\n double ans=1e13;\n \n v.clear();\n \n r(i,n){\n cin>>r>>x>>y;\n v.push_back(P2(P(x,y),r));\n }\n\n r(i,1){\n sort(v.begin(),v.end());\n r(j,n){\n\tfor(int k=j+1,c=0;k<n;k++,c++){\n\t if(c>50)break;\n\t ans=min(ans,abss(v[k].first,v[j].first)-v[k].second-v[j].second);\n\t}\n }\n r(j,n)v[i].first=rot(v[i].first,0.5);\n }\n\n printf(\"%.9f\\n\",ans);\n \n }\n \n return 0;\n}","accuracy":1,"time_ms":460,"memory_kb":6212,"score_of_the_acc":-0.1967,"final_rank":3},{"submission_id":"aoj_2057_2589403","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <cmath>\n#define ele int\nusing namespace std;\n#define maxn 100010\n#define INF 1e18\n#define eps 1e-7\nstruct circle{\n\tdouble x,y,r;\n};\nele n;\ndouble R;\ncircle a[maxn];\ninline bool cmp1(circle a,circle b){\n\treturn a.x<b.x;\n}\ninline bool cmp2(circle a,circle b){\n\treturn a.y<b.y;\n}\ninline double dis(circle a,circle b){\n\treturn sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y))-a.r-b.r;\n}\ndouble solve(ele l,ele r){\n\tif (r-l+1<=10){\n\t\tdouble ans=INF;\n\t\tfor (int i=l; i<=r; ++i)\n\t\t\tfor (int j=i+1; j<=r; ++j)\n\t\t\t\tans=min(ans,dis(a[i],a[j]));\n\t\treturn ans;\n\t}\n\tele mid=(l+r)>>1;\n\tdouble ans=min(solve(l,mid-1),solve(mid+1,r));\n\tfor (int i=l; i<=r; ++i)\n\t\tif (i!=mid) ans=min(ans,dis(a[i],a[mid]));\n\tstatic circle p[maxn],q[maxn];\n\tele u=0,v=0;\n\tfor (int i=l; i<mid; ++i)\n\t\tif (a[mid].x-a[i].x<ans+R*2+eps) p[u++]=a[i];\n\tfor (int i=mid+1; i<=r; ++i)\n\t\tif (a[i].x-a[mid].x<ans+R*2+eps) q[v++]=a[i];\n\tif (!v) return ans;\n\tsort(p,p+u,cmp2); sort(q,q+v,cmp2);\n\tele s=0,t=0;\n\tfor (int i=0; i<u; ++i){\n\t\twhile (s<v-1 && p[i].y-q[s].y>ans+R*2+eps) ++s;\n\t\twhile (t<v-1 && q[t+1].y-p[i].y<ans+R*2+eps) ++t;\n\t\tfor (int j=s; j<=t; ++j) ans=min(ans,dis(p[i],q[j]));\n\t}\n\treturn ans;\n}\nint main(){\n\twhile (scanf(\"%d\",&n),n){\n\t\tR=0;\n\t\tfor (int i=0; i<n; ++i){\n\t\t\tscanf(\"%lf%lf%lf\",&a[i].r,&a[i].x,&a[i].y);\n\t\t\tR=max(R,a[i].r);\n\t\t}\n\t\tsort(a,a+n,cmp1);\n\t\tprintf(\"%.10lf\\n\",solve(0,n-1));\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":230,"memory_kb":7312,"score_of_the_acc":-0.2202,"final_rank":8},{"submission_id":"aoj_2057_2104768","code_snippet":"#include <iomanip>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nstruct circle { double x, y, r; };\nint n; circle x[100009];\nbool operator<(const circle& c1, const circle& c2) {\n\treturn c1.x - c1.r < c2.x - c2.r;\n}\nint main() {\n\twhile (cin >> n, n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tscanf(\"%lf%lf%lf\", &x[i].r, &x[i].x, &x[i].y);\n\t\t\tdouble ex = x[i].x * 0.28 - x[i].y * 0.96;\n\t\t\tdouble ey = x[i].x * 0.96 + x[i].y * 0.28;\n\t\t\tx[i].x = ex, x[i].y = ey;\n\t\t}\n\t\tsort(x, x + n);\n\t\tdouble ret = 1.0e+9;\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 (x[i].x + x[i].r + ret < x[j].x - x[j].r) break;\n\t\t\t\tdouble dist = hypot(x[i].x - x[j].x, x[i].y - x[j].y) - x[i].r - x[j].r;\n\t\t\t\tret = min(ret, dist);\n\t\t\t}\n\t\t}\n\t\tprintf(\"%.15lf\\n\", ret);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":130,"memory_kb":5628,"score_of_the_acc":-0.1152,"final_rank":2},{"submission_id":"aoj_2057_1899541","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#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 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}\ndouble min(double a,double b){return a<b?a:b;}\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;cin>>a;\n\t\t\tP p=pin();\n\t\t\t//p=turn(p,17);\n\t\t\tc.pb(C(p,a));\n\t\t}\n\t\tsort(all(c),[](C a,C b){\n\t\t\treturn a.c<b.c;\n\t\t});\n\t\tdouble out=inf;\n\t\trep(i,n){\n\t\t\tint r=max(0,i-10),l=min(i+10,n);\n\t\t\tloop(j,r,l)if(j!=i){\n\t\t\t\tout=min(out,abs(c[i].c-c[j].c)-c[i].r-c[j].r);\n\t\t\t}\n\t\t}\n\t\tcout<<shosu(9)<<out<<endl;\n\t}\n}","accuracy":1,"time_ms":450,"memory_kb":8624,"score_of_the_acc":-0.3238,"final_rank":11},{"submission_id":"aoj_2057_1899536","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#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 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}\ndouble min(double a,double b){return a<b?a:b;}\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;cin>>a;\n\t\t\tP p=pin();\n\t\t\tp=turn(p,17);\n\t\t\tc.pb(C(p,a));\n\t\t}\n\t\tsort(all(c),[](C a,C b){\n\t\t\treturn a.c<b.c;\n\t\t});\n\t\tdouble out=inf;\n\t\trep(i,n){\n\t\t\tint r=max(0,i-10),l=min(i+10,n);\n\t\t\tloop(j,r,l)if(j!=i){\n\t\t\t\tout=min(out,abs(c[i].c-c[j].c)-c[i].r-c[j].r);\n\t\t\t}\n\t\t}\n\t\tcout<<shosu(9)<<out<<endl;\n\t}\n}","accuracy":1,"time_ms":450,"memory_kb":8640,"score_of_the_acc":-0.3246,"final_rank":12},{"submission_id":"aoj_2057_1722145","code_snippet":"#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n\nusing namespace std;\n\nstruct Circle{\n\tdouble x,y,r;\n\tbool operator < (const Circle &)const;\n};\n\nbool Circle::operator < (const Circle &a)const{\n\treturn (x*x+y*y)<(a.x*a.x+a.y*a.y);\n}\n\ndouble dist(const Circle &a,const Circle &b){\n\treturn sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y))-a.r-b.r;\n}\n\nconst int MAX_N=100000;\n\nint N;\nCircle c[MAX_N];\n\nvector<double> out;\n\nint main(){\n\tdo{\n\t\tscanf(\"%d\",&N);\n\t\tif (N){\n\t\t\tfor (int i=0;i<N;i++){\n\t\t\t\tscanf(\"%lf %lf %lf\",&c[i].r,&c[i].x,&c[i].y);\n\t\t\t}\n\t\t\tsort(c,c+N);\n\t\t\tdouble ans=1e50;\n\t\t\tfor (int i=0;i<N;i++){\n\t\t\t\tfor (int j=i+1;j<min(N,i+4001);j++){\n\t\t\t\t\tans=min(ans,dist(c[i],c[j]));\n\t\t\t\t}\n\t\t\t}\n\t\t\tout.push_back(ans);\n\t\t}\n\t}while(N);\n\tfor (int i=0;i<out.size();i++){\n\t\tprintf(\"%.12f\\n\",out[i]);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":6680,"memory_kb":3468,"score_of_the_acc":-1,"final_rank":18},{"submission_id":"aoj_2057_1539332","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <cmath>\n#define INF 1e10\nusing namespace std;\n\nint n;\nstruct P{\n\tdouble x,y,r;\n\tP(){}\n\tP(double xx,double yy,double rr){\n\t\tx=xx;\n\t\ty=yy;\n\t\tr=rr;\n\t}\n\tbool operator<(const P &p1)const{\n\t\treturn x<p1.x;\n\t}\n};\n\nbool compare_y(P a,P b){\n\treturn a.y<b.y;\n}\n\n\ndouble closest_pair(P *a,int n){\n\tif(n<=1)return INF;\n\tint m=n/2;\n\tdouble x=a[m].x;\n\tdouble r=a[m].r;\n\tdouble d=min(closest_pair(a,m),closest_pair(a+m,n-m));\n\tinplace_merge(a,a+m,a+n,compare_y);\n\tvector<P> b;\n\tfor(int i=0;i<n;i++){\n\t\tif(fabs(a[i].x-x)-a[i].r-r>=d)continue;\n\t\tfor(int j=0;j<b.size();j++){\n\t\t\tdouble dx=a[i].x-b[b.size()-j-1].x;\n\t\t\tdouble dy=a[i].y-b[b.size()-j-1].y;\n\t\t\tif(dy>=d+r+a[i].r)break;\n\t\t\td=min(d,sqrt(dx*dx+dy*dy)-b[b.size()-j-1].r-a[i].r);\n\t\t}\n\t\tb.push_back(a[i]);\n\t\tr=max(a[i].r,r);\n\t}\n\treturn d;\n}\n\nP p[100001];\n\nint main(void){\n\twhile(1){\n\t\tscanf(\"%d\",&n);\n\t\tif(n==0)break;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tscanf(\"%lf %lf %lf\",&p[i].r,&p[i].x,&p[i].y);\n\t\t}\n\t\tsort(p,p+n);\n\t\tprintf(\"%.9f\\n\",closest_pair(p,n));\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":280,"memory_kb":8840,"score_of_the_acc":-0.3093,"final_rank":10},{"submission_id":"aoj_2057_1110780","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<math.h>\nusing namespace std;\ndouble x[110000];\ndouble y[110000];\ndouble r[110000];\npair<double,int>p[110000];\nint main(){\n\tint a;\n\twhile(scanf(\"%d\",&a),a){\n\t\tfor(int i=0;i<a;i++){\n\t\t\tdouble tx,ty;\n\t\t\tscanf(\"%lf%lf%lf\",r+i,&tx,&ty);\n\t\t\tx[i]=cos(1)*tx-sin(1)*ty;\n\t\t\ty[i]=sin(1)*tx+cos(1)*ty;\n\t\t}\n\t\tdouble ret=sqrt((x[0]-x[1])*(x[0]-x[1])+(y[0]-y[1])*(y[0]-y[1]))-r[0]-r[1];\n\t\tfor(int i=0;i<a;i++){\n\t\t\tp[i]=make_pair(x[i]+r[i],i);\n\t\t}\n\t\tstd::sort(p,p+a);\n\t\tfor(int i=0;i<a;i++){\n\t\t\tfor(int j=i-1;j>=0;j--){\n\t\t\t\tif(p[i].first-r[p[i].second]*2-p[j].first>ret)break;\n\t\t\t\tint L=p[i].second;\n\t\t\t\tint R=p[j].second;\n\t\t\t\tret=min(ret,sqrt((x[L]-x[R])*(x[L]-x[R])+(y[L]-y[R])*(y[L]-y[R]))-r[L]-r[R]);\n\t\t\t}\n\t\t}\n\t\tprintf(\"%.12f\\n\",ret);\n\t}\n}","accuracy":1,"time_ms":170,"memory_kb":5324,"score_of_the_acc":-0.1051,"final_rank":1},{"submission_id":"aoj_2057_1092044","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\n\ntypedef double DD;\n\nconst DD INF = 1LL<<60;\nconst DD EPS = 1e-10;\nconst DD PI = acos(-1.0);\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\nDD todeg(DD ang) {return ang * 180 / PI;}\n\nstruct Point {\n DD x, y;\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \", \" << p.y << ')';}\n};\n\nPoint operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\nPoint operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\nPoint operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\nPoint operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\nPoint operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\nPoint operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\nPoint conj(const Point &p) {return Point(p.x, -p.y);}\nPoint rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\nPoint rot90(const Point &p) {return Point(-p.y, p.x);}\nDD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\nDD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\nDD norm(const Point &p) {return dot(p, p);}\nDD abs(const Point &p) {return sqrt(dot(p, p));}\nDD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\nbool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\nbool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\nbool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\nPoint operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\n\nint ccw(const Point &a, const Point &b, const Point &c) {\n if (cross(b-a, c-a) > EPS) return 1;\n if (cross(b-a, c-a) < -EPS) return -1;\n if (dot(b-a, c-a) < -EPS) return 2;\n if (norm(b-a) < norm(c-a) - EPS) return -2;\n return 0;\n}\n\nstruct Line : vector<Point> {\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\n this->push_back(a);\n this->push_back(b);\n }\n};\n\nstruct Circle : Point{\n DD r;\n Circle(Point p = Point(0.0, 0.0), DD r = 0.0) : Point(p), r(r) {}\n};\n\n\nDD MAX_R;\nbool compare_y(Circle a, Circle b) { return a.y < b.y; }\n\nDD Rec(vector<Circle>::iterator it, int n) {\n if (n <= 1) return INF;\n int m = n/2;\n DD x = it[m].x;\n DD d = min(Rec(it, m), Rec(it+m, n-m));\n inplace_merge(it, it+m, it+n, compare_y);\n \n vector<Circle> vec;\n for (int i = 0; i < n; ++i) {\n if (fabs(it[i].x - x) >= d + MAX_R*2) continue;\n for (int j = 0; j < vec.size(); ++j) {\n DD dx = it[i].x - vec[vec.size()-j-1].x;\n DD dy = it[i].y - vec[vec.size()-j-1].y;\n if (dy >= d + MAX_R*2) break;\n d = min(d, abs(sqrt(dx*dx+dy*dy) - it[i].r - vec[vec.size()-j-1].r));\n }\n vec.push_back(it[i]);\n }\n return d;\n}\n\nDD Closet(vector<Circle> vc) {\n int n = vc.size();\n sort(vc.begin(), vc.end());\n return Rec(vc.begin(), n);\n}\n\n\nint n;\ndouble r, x, y;\n\nint main() {\n while (cin >> n) {\n if (n == 0) break;\n MAX_R = 0.0;\n vector<Circle> vc(n);\n for (int i = 0; i < n; ++i) cin >> vc[i].r >> vc[i].x >> vc[i].y, chmax(MAX_R, vc[i].r);\n double res = Closet(vc);\n cout << fixed << setprecision(9) << res << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":630,"memory_kb":11160,"score_of_the_acc":-0.4864,"final_rank":16},{"submission_id":"aoj_2057_1092029","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\n\n\ntypedef double DD;\n\nconst DD INF = 1LL<<60;\nconst DD EPS = 1e-10;\nconst DD PI = acos(-1.0);\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\nDD todeg(DD ang) {return ang * 180 / PI;}\n\nstruct Point {\n DD x, y;\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \", \" << p.y << ')';}\n};\n\nPoint operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\nPoint operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\nPoint operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\nPoint operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\nPoint operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\nPoint operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\nPoint conj(const Point &p) {return Point(p.x, -p.y);}\nPoint rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\nPoint rot90(const Point &p) {return Point(-p.y, p.x);}\nDD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\nDD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\nDD norm(const Point &p) {return dot(p, p);}\nDD abs(const Point &p) {return sqrt(dot(p, p));}\nDD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\nbool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\nbool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\nbool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\nPoint operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\n\nint ccw(const Point &a, const Point &b, const Point &c) {\n if (cross(b-a, c-a) > EPS) return 1;\n if (cross(b-a, c-a) < -EPS) return -1;\n if (dot(b-a, c-a) < -EPS) return 2;\n if (norm(b-a) < norm(c-a) - EPS) return -2;\n return 0;\n}\n\nstruct Line : vector<Point> {\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\n this->push_back(a);\n this->push_back(b);\n }\n};\n\nstruct Circle : Point{\n DD r;\n Circle(Point p = Point(0.0, 0.0), DD r = 0.0) : Point(p), r(r) {}\n};\n\n\nDD MAX_R;\nbool compare_y(Circle a, Circle b) { return a.y < b.y; }\n\nDD Rec(vector<Circle>::iterator it, int n) {\n if (n <= 1) return INF;\n int m = n/2;\n DD x = it[m].x;\n DD d = min(Rec(it, m), Rec(it+m, n-m));\n inplace_merge(it, it+m, it+n, compare_y);\n \n vector<Circle> vec;\n for (int i = 0; i < n; ++i) {\n if (fabs(it[i].x - x) >= d + MAX_R*2) continue;\n for (int j = 0; j < vec.size(); ++j) {\n DD dx = it[i].x - vec[vec.size()-j-1].x;\n DD dy = it[i].y - vec[vec.size()-j-1].y;\n if (dy >= d + MAX_R*2) break;\n d = min(d, abs(sqrt(dx*dx+dy*dy) - it[i].r - vec[vec.size()-j-1].r));\n }\n vec.push_back(it[i]);\n }\n return d;\n}\n\nDD Closet(vector<Circle> vc) {\n int n = vc.size();\n sort(vc.begin(), vc.end());\n return Rec(vc.begin(), n);\n}\n\n\nint n;\ndouble r, x, y;\n\nint main() {\n while (cin >> n) {\n if (n == 0) break;\n MAX_R = 0.0;\n vector<Circle> vc(n);\n for (int i = 0; i < n; ++i) cin >> vc[i].r >> vc[i].x >> vc[i].y, chmax(MAX_R, vc[i].r);\n double res = Closet(vc);\n cout << fixed << setprecision(9) << res << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":620,"memory_kb":11360,"score_of_the_acc":-0.4956,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_2057_10946135\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <cmath>\\n#define ele int\\nusing namespace std;\\n#define maxn 100010\\n#define INF 1e18\\n#define eps 1e-7\\nstruct circle{\\n\\tdouble x,y,r;\\n};\\nele n;\\ndouble R;\\ncircle a[maxn];\\ninline bool cmp1(circle a,circle b){\\n\\treturn a.x<b.x;\\n}\\ninline bool cmp2(circle a,circle b){\\n\\treturn a.y<b.y;\\n}\\ninline double dis(circle a,circle b){\\n\\treturn sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y))-a.r-b.r;\\n}\\ndouble solve(ele l,ele r){\\n\\tif (r-l+1<=2){\\n\\t\\tdouble ans=INF;\\n\\t\\tfor (int i=l; i<=r; ++i)\\n\\t\\t\\tfor (int j=i+1; j<=r; ++j)\\n\\t\\t\\t\\tans=min(ans,dis(a[i],a[j]));\\n\\t\\treturn ans;\\n\\t}\\n\\tele mid=(l+r)>>1;\\n\\tdouble ans=min(solve(l,mid-1),solve(mid+1,r));\\n\\tfor (int i=l; i<=r; ++i)\\n\\t\\tif (i!=mid) ans=min(ans,dis(a[i],a[mid]));\\n\\tstatic circle p[maxn],q[maxn];\\n\\tele u=0,v=0;\\n\\tfor (int i=l; i<mid; ++i)\\n\\t\\tif (a[mid].x-a[i].x<ans+R*2+eps) p[u++]=a[i];\\n\\tfor (int i=mid+1; i<=r; ++i)\\n\\t\\tif (a[i].x-a[mid].x<ans+R*2+eps) q[v++]=a[i];\\n\\tif (!v) return ans;\\n\\tsort(p,p+u,cmp2); sort(q,q+v,cmp2);\\n\\tele s=0,t=0;\\n\\tfor (int i=0; i<u; ++i){\\n\\t\\twhile (s<v-1 && p[i].y-q[s].y>ans+R*2+eps) ++s;\\n\\t\\twhile (t<v-1 && q[t+1].y-p[i].y<ans+R*2+eps) ++t;\\n\\t\\tfor (int j=s; j<=t; ++j) ans=min(ans,dis(p[i],q[j]));\\n\\t}\\n\\treturn ans;\\n}\\nint main(){\\n\\twhile (scanf(\\\"%d\\\",&n),n){\\n\\t\\tR=0;\\n\\t\\tfor (int i=0; i<n; ++i){\\n\\t\\t\\tscanf(\\\"%lf%lf%lf\\\",&a[i].r,&a[i].x,&a[i].y);\\n\\t\\t\\tR=max(R,a[i].r);\\n\\t\\t}\\n\\t\\tsort(a,a+n,cmp1);\\n\\t\\tprintf(\\\"%.10lf\\\\n\\\",solve(0,n-1));\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 9072,\n \"score_of_the_acc\": -0.3064,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2057_7290550\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <iomanip>\\nusing namespace std;\\n\\nint n;\\nconst double INF = 1e9;\\ndouble pr, px, py;\\n\\nstruct circle {\\n\\tdouble r, x, y;\\n\\n\\tbool operator < (const circle& rhs) const\\n\\t{\\n\\t\\treturn x < rhs.x || (x == rhs.x && y < rhs.y);\\n\\t}\\n};\\n\\ncircle a[100000];\\n\\nbool compare_y(circle a, circle b) {\\n\\treturn a.y < b.y;\\n}\\n\\ndouble closest_pair(circle* a, int n) {\\n\\tif (n <= 1)\\n\\t\\treturn INF;\\n\\n\\tint m = n / 2;\\n\\tdouble x = a[m].x, r = a[m].r;\\n\\tdouble d = min(closest_pair(a, m), closest_pair(a + m, n - m));\\n\\tinplace_merge(a, a + m, a + n, compare_y);\\n\\n\\tvector<circle> b;\\n\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tif (fabs(a[i].x - x) >= d + r + a[i].r)\\n\\t\\t\\tcontinue;\\n\\n\\t\\tint w = b.size();\\n\\n\\t\\tfor (int j = 0; j < w; j++) {\\n\\t\\t\\tdouble dx = a[i].x - b[w - j - 1].x;\\n\\t\\t\\tdouble dy = a[i].y - b[w - j - 1].y;\\n\\n\\t\\t\\tif (dy >= d + r + a[i].r)\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\td = min(d, sqrt(dx * dx + dy * dy) - a[i].r - b[w - j - 1].r);\\n\\t\\t}\\n\\n\\t\\tb.push_back(a[i]);\\n\\t}\\n\\n\\treturn d;\\n}\\n\\nint main()\\n{\\n\\tcin >> n;\\n\\n\\twhile (n) {\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tcin >> pr >> px >> py;\\n\\t\\t\\tcircle w = { pr, px, py };\\n\\t\\t\\ta[i] = w;\\n\\t\\t}\\n\\n\\t\\tsort(a, a + n);\\n\\n\\t\\tcout << setiosflags(ios::fixed | ios::showpoint) << setprecision(6)\\n\\t\\t\\t<< closest_pair(a, n) << endl;\\n\\n\\t\\tcin >> n;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 10800,\n \"score_of_the_acc\": -0.4444,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2057_6894832\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <cmath>\\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\\nstruct point {\\n double x, y, r;\\n};\\n\\nconst ll inf = 1e18;\\n\\nvoid chmin(double& x, double y) { x = min(x, y); }\\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)) - a.r - b.r;\\n}\\n\\ndouble closestpair(vi<point>& d, int l, int r, const double mxr) {\\n if (r - l == 1) return inf;\\n const int mid = (l + r) / 2;\\n point m = d[mid];\\n double vl = closestpair(d, l, mid, mxr);\\n double vr = closestpair(d, mid, r, mxr);\\n double ans = min(vl, vr);\\n inplace_merge(d.begin() + l, d.begin() + mid, d.begin() + r, \\n [&](point a, point b) {return a.y < b.y; });\\n\\n vi<point> midreg;\\n for (int i = l; i < r; i++) {\\n if (abs(d[i].x - m.x) >= ans + mxr * 2) continue;\\n int len = midreg.size();\\n for (int j = len - 1; j >= 0; j--) {\\n if (d[i].y - midreg[j].y >= ans + mxr * 2) break;\\n chmin(ans, dist(d[i], midreg[j]));\\n }\\n midreg.push_back(d[i]);\\n }\\n return ans;\\n}\\n\\nint main()\\n{\\n int n;\\n while (cin >> n, n) {\\n vi<point> d(n);\\n rep(i, n) cin >> d[i].r >> d[i].x >> d[i].y;\\n double mxr = 0;\\n rep(i, n) mxr = max(mxr, d[i].r);\\n sort(d.begin(), d.end(), [&](point a, point b) {return a.x < b.x; });\\n double res = closestpair(d, 0, n, mxr);\\n cout << fixed << setprecision(12) << res << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 11336,\n \"score_of_the_acc\": -0.4577,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2057_5146090\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing pll = pair<ll, ll>;\\nusing pii = pair<int, int>;\\nusing vvl = vector<vector<ll>>;\\nusing vvi = vector<vector<int>>;\\nusing vvpll = vector<vector<pll>>;\\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--)\\n#define pb push_back\\n#define tostr to_string\\n#define ALL(A) A.begin(), A.end()\\n#define elif else if\\n// constexpr ll INF = LONG_LONG_MAX;\\nconstexpr ll INF = 1e18;\\nconstexpr ll MOD = 1000000007;\\n\\nconst string digits = \\\"0123456789\\\";\\nconst string ascii_lowercase = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string ascii_uppercase = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string ascii_letters = ascii_lowercase + ascii_uppercase;\\n\\ntemplate<typename T> vector<vector<T>> list2d(int N, int M, T init) { return vector<vector<T>>(N, vector<T>(M, init)); }\\ntemplate<typename T> vector<vector<vector<T>>> list3d(int N, int M, int L, T init) { return vector<vector<vector<T>>>(N, vector<vector<T>>(M, vector<T>(L, init))); }\\ntemplate<typename T> vector<vector<vector<vector<T>>>> list4d(int N, int M, int L, int O, T init) { return vector<vector<vector<vector<T>>>>(N, vector<vector<vector<T>>>(M, vector<vector<T>>(L, vector<T>(O, init)))); }\\n\\nvector<ll> LIST(ll N) { vector<ll> A(N); rep(i, 0, N) cin >> A[i]; return A; }\\n\\nvoid print(ld out) { cout << fixed << setprecision(15) << out << '\\\\n'; }\\nvoid print(double out) { cout << fixed << setprecision(15) << out << '\\\\n'; }\\ntemplate<typename T> void print(T out) { cout << out << '\\\\n'; }\\ntemplate<typename T1, typename T2> void print(pair<T1, T2> out) { cout << out.first << ' ' << out.second << '\\\\n'; }\\ntemplate<typename T> void print(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\\\\n' : ' '); } }\\ntemplate<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }\\n\\nvoid Yes() { print(\\\"Yes\\\"); }\\nvoid No() { print(\\\"No\\\"); }\\nvoid YES() { print(\\\"YES\\\"); }\\nvoid NO() { print(\\\"NO\\\"); }\\n\\nll floor(ll a, ll b) { if (a < 0) { return (a-b+1) / b; } else { return a / b; } }\\nll ceil(ll a, ll b) { if (a >= 0) { return (a+b-1) / b; } else { return a / b; } }\\npll divmod(ll a, ll b) { ll d = a / b; ll m = a % b; return {d, m}; }\\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\\ntemplate<typename T> bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; }\\n\\ntemplate<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }\\ntemplate<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }\\ntemplate<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }\\n\\nll toint(string s) { ll res = 0; for (char c : s) { res *= 10; res += (c - '0'); } return res; }\\nint toint(char num) { return num - '0'; }\\nchar tochar(int num) { return '0' + num; }\\nint ord(char c) { return (int)c; }\\nchar chr(int a) { return (char)a; }\\n\\nll pow(ll x, ll n) { ll res = 1; rep(_, 0, n) res *= x; return res; }\\nll pow(ll x, ll n, int mod) { ll res = 1; while (n > 0) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; }\\n\\nint popcount(ll S) { return __builtin_popcountll(S); }\\nll gcd(ll a, ll b) { return __gcd(a, b); }\\nll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }\\n\\ntemplate<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }\\ntemplate<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n while (1) {\\n ll N;\\n cin >> N;\\n if (N == 0) break;\\n\\n vector<tuple<ld, ld, ld>> XY;\\n rep(i, 0, N) {\\n ld x, y, r;\\n cin >> r >> x >> y;\\n XY.pb({x, y, r});\\n }\\n sort(ALL(XY));\\n\\n auto rec = [&](auto&& f, vector<tuple<ld, ld, ld>> XY) -> ld {\\n ll n = XY.size();\\n if (n <= 1) return INF;\\n ll m = n/2;\\n ld l = get<0>(XY[m]);\\n ld d = min(f(f, vector<tuple<ld, ld, ld>>(XY.begin(), XY.begin()+m)), \\n f(f, vector<tuple<ld, ld, ld>>(XY.begin()+m, XY.end())));\\n\\n sort(ALL(XY), [](tuple<ld, ld, ld> a, tuple<ld, ld, ld> b) { return get<1>(a) < get<1>(b); });\\n ld mxr = 0;\\n for (auto& [x, y, r] : XY) chmax(mxr, r);\\n rep(i, 0, n) {\\n auto [x1, y1, r1] = XY[i];\\n if (abs(l-x1)-mxr*2 >= d) continue;\\n rep(j, i+1, n) {\\n auto [x2, y2, r2] = XY[j];\\n if (abs(y1-y2)-mxr*2 >= d) break;\\n chmin(d, sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2))-r1-r2);\\n }\\n }\\n return d;\\n };\\n ld ans = rec(rec, XY);\\n print(ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 22224,\n \"score_of_the_acc\": -1.0443,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2057_3167870\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define EPS 1e-10\\ntypedef pair<double,int> P;\\nstruct Point{double x,y,r;};\\nint n;\\nPoint p[100010];\\n\\ndouble cl(int i,int j,double k=0.0){\\n return sqrt(pow(p[i].x-p[j].x,2)+pow(p[i].y-p[j].y,2))-(p[i].r+p[j].r+k*2.0);\\n}\\n\\nint solve(double k){\\n \\n vector<P> events;\\n \\n for(int i=0;i<n;i++){\\n double x1=p[i].x-p[i].r-k;\\n double x2=p[i].x+p[i].r+k;\\n events.push_back(P(x1,i));\\n events.push_back(P(x2,i+n));\\n }\\n sort(events.begin(),events.end());\\n\\n set<P> outers;\\n for(int i=0;i<events.size();i++){\\n int id=events[i].second%n;\\n if(events[i].second<n){\\n set<P>::iterator it = outers.lower_bound(P(p[id].y,id));\\n if(it!=outers.end()&&cl(id,it->second,k)<=0)return 0;\\n if(it!=outers.begin()&&cl(id,(--it)->second,k)<=0)return 0;\\n outers.insert(P(p[id].y,id));\\n }else{\\n outers.erase(P(p[id].y,id));\\n }\\n }\\n return 1;\\n}\\n\\nint main(){\\n \\n while(cin>>n,n){\\n\\n for(int i=0;i<n;i++){\\n cin>>p[i].r>>p[i].x>>p[i].y;\\n }\\n\\n double ok=0,ng=cl(0,1),mid;\\n while(ng-ok>EPS){\\n mid=(ok+ng)/2.0;\\n if(solve(mid))ok=mid;\\n else ng=mid;\\n }\\n \\n printf(\\\"%.10lf\\\\n\\\",ok*2.0);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2980,\n \"memory_kb\": 14704,\n \"score_of_the_acc\": -1.0342,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2057_3047498\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <iomanip>\\n#include <cmath>\\nusing namespace std;\\nconst double EPS = 1e-8;\\nconst double INF = 1e18;\\ntypedef complex<double> P;\\n#define X real()\\n#define Y imag()\\nstruct C{\\n P p;\\n double r;\\n C(const P& p, const double& r) : p(p), r(r) {}\\n C(){}\\n};\\nbool xcomp(const C &a, const C &b){\\n return (a.p.X != b.p.X)? a.p.X<b.p.X : a.p.Y<b.p.Y;\\n}\\nbool ycomp(const C &a, const C &b){\\n return (a.p.Y != b.p.Y)? a.p.Y<b.p.Y : a.p.X<b.p.X;\\n}\\n\\ndouble closest(vector<C> &c, int first, int last, double rmax){\\n if(last -first <= 1) return INF;\\n int mid = (first +last)/2;\\n double midx = c[mid].p.X;\\n double d = min(closest(c, first, mid, rmax), closest(c, mid, last, rmax));\\n inplace_merge(c.begin()+first, c.begin()+mid, c.begin()+last, ycomp);\\n\\n vector<C> near;\\n for(int i=first; i<last; i++){\\n if(abs(c[i].p.X -midx) -c[i].r -rmax > d +EPS) continue;\\n for(int j=near.size()-1; j>=0; j--){\\n if(abs(c[i].p.Y -near[j].p.Y) -c[i].r -rmax > d +EPS){\\n break;\\n }\\n d = min(d, abs(c[i].p -near[j].p) -c[i].r -near[j].r);\\n }\\n near.push_back(c[i]);\\n }\\n return d;\\n}\\n \\nint main(){\\n while(1){\\n int n;\\n cin >> n;\\n if(n==0) break;\\n\\n vector<C> c(n);\\n double rmax = 0;\\n for(int i=0; i<n; i++){\\n double r,x,y;\\n cin >> r >> x >> y;\\n c[i] = C(P(x, y), r);\\n rmax = max(rmax, r);\\n }\\n sort(c.begin(), c.end(), xcomp);\\n\\n cout << fixed << setprecision(10);\\n cout << closest(c, 0, n, rmax) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 500,\n \"memory_kb\": 10736,\n \"score_of_the_acc\": -0.444,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2057_2812321\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nstruct Info{\\n\\tbool operator<(const struct Info &arg) const{\\n\\t\\tif(x != arg.x){\\n\\t\\t\\treturn x < arg.x;\\n\\t\\t}else{\\n\\t\\t\\treturn y < arg.y;\\n\\t\\t}\\n\\t}\\n\\tdouble x,y,r;\\n};\\n\\nint N;\\nInfo info[100001];\\n\\nbool compare_y(Info left,Info right){\\n\\n\\treturn left.y < right.y;\\n\\n}\\n\\ndouble calc_dist(int a,int b){\\n\\treturn sqrt((info[a].x-info[b].x)*(info[a].x-info[b].x)+(info[a].y-info[b].y)*(info[a].y-info[b].y))-(info[a].r+info[b].r);\\n}\\n\\ndouble calc_y_dist(int a,int b){\\n\\treturn (info[b].y-info[b].r)-(info[a].y+info[a].r);\\n}\\n\\ndouble closest_pair(Info* array,int tmp_N){\\n\\tif(tmp_N <= 1)return DBL_MAX;\\n\\n\\tint mid = tmp_N/2;\\n\\n\\tdouble x = array[mid].x;\\n\\tdouble dist = min(closest_pair(array,mid),closest_pair(array+mid,tmp_N-mid));\\n\\tinplace_merge(array,array+mid,array+tmp_N,compare_y);\\n\\n\\tvector<int> V;\\n\\n\\n\\tint left,right,m,search_left;\\n\\n\\tfor(int i = 0; i < tmp_N; i++){\\n\\n\\t\\tfor(int k = 0; k < min((int)V.size(),2); k++){\\n\\t\\t\\tdist = min(dist,calc_dist(V[V.size()-1-k],i));\\n\\t\\t}\\n\\n\\t\\tV.push_back(i);\\n\\t}\\n\\treturn dist;\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%lf %lf %lf\\\",&info[i].r,&info[i].x,&info[i].y);\\n\\t}\\n\\tsort(info,info+N);\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",closest_pair(info,N));\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 6924,\n \"score_of_the_acc\": -0.2011,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2057_2812122\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nstruct Info{\\n\\tbool operator<(const struct Info &arg) const{\\n\\t\\tif(x != arg.x){\\n\\t\\t\\treturn x < arg.x;\\n\\t\\t}else{\\n\\t\\t\\treturn y < arg.y;\\n\\t\\t}\\n\\t}\\n\\tdouble x,y,r;\\n};\\n\\nint N;\\nInfo info[100001];\\n\\nbool compare_y(Info left,Info right){ //順序付け関数\\n\\n\\treturn left.y < right.y;\\n\\n}\\n\\nbool is_OK(int index,double x,double dist){\\n\\tif(info[index].x < x){ //基準線より中心が左\\n\\t\\tif(info[index].x+info[index].r+dist < x){\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t}else{ //基準線より中心が右\\n\\t\\tif(info[index].x-info[index].r-dist > x){\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\n\\treturn true;\\n}\\n\\ndouble calc_dist(int a,int b){\\n\\treturn sqrt((info[a].x-info[b].x)*(info[a].x-info[b].x)+(info[a].y-info[b].y)*(info[a].y-info[b].y))-(info[a].r+info[b].r);\\n}\\n\\ndouble calc_y_dist(int a,int b){\\n\\treturn (info[b].y-info[b].r)-(info[a].y+info[a].r);\\n}\\n\\ndouble closest_pair(Info* array,int tmp_N){\\n\\tif(tmp_N <= 1)return DBL_MAX;\\n\\n\\tint mid = tmp_N/2; //中央のインデックス\\n\\n\\tdouble x = array[mid].x; //基準線x\\n\\tdouble dist = min(closest_pair(array,mid),closest_pair(array+mid,tmp_N-mid)); //集合を2分割し、再帰的に最小距離を求める\\n\\tinplace_merge(array,array+mid,array+tmp_N,compare_y); //2つのソート済の範囲をマージ\\n\\n\\tvector<int> V; //★★再帰毎にメモリを確保(indexをpush)★★\\n\\n\\n\\tint left,right,m,search_left;\\n\\n\\tfor(int i = 0; i < tmp_N; i++){\\n\\t\\t//if(!is_OK(i,x,dist))continue; //基準線より最小距離以上離れている点は無視(★異なる領域間での、新最小値を作り得ないということ★)\\n\\n\\t\\t//★★Vはyの昇順に並んでいる:自分よりy座標が小さいもののみ、入っている★★\\n\\n\\t\\t//2分探索で、検索範囲を定める\\n\\t\\t/*left = 0,right = V.size()-1,m = (left+right)/2;\\n\\t\\tsearch_left = 0;\\n\\n\\t\\twhile(left <= right){\\n\\t\\t\\tif(calc_y_dist(V[m],i) < dist){ //y座標の差がdist未満\\n\\t\\t\\t\\tsearch_left = 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\\n\\t\\t/*for(int k = search_left; k < V.size(); k++){\\n\\t\\t\\tdist = min(dist,calc_dist(V[k],i));\\n\\t\\t}*/\\n\\n\\t\\tfor(int k = 0; k < min((int)V.size(),2); k++){\\n\\t\\t\\tdist = min(dist,calc_dist(V[V.size()-1-k],i));\\n\\t\\t}\\n\\n\\t\\tV.push_back(i); //可能性あり集合に、iを追加\\n\\t}\\n\\treturn dist;\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%lf %lf %lf\\\",&info[i].r,&info[i].x,&info[i].y);\\n\\t}\\n\\tsort(info,info+N);\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",closest_pair(info,N));\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 6936,\n \"score_of_the_acc\": -0.2017,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2057_2646312\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\n\\n#define EPS (1e-10)\\n#define equals(a,b) (fabs((a)-(b)) < EPS)\\n#define PI 3.141592653589793238\\n \\n// COUNTER CLOCKWISE\\nstatic const int CCW_COUNTER_CLOCKWISE = 1;\\nstatic const int CCW_CLOCKWISE = -1;\\nstatic const int CCW_ONLINE_BACK = 2;\\nstatic const int CCW_ONLINE_FRONT = -2;\\nstatic const int CCW_ON_SEGMENT = 0;\\n\\n//Intercsect Circle & Circle\\nstatic const int ICC_SEPERATE = 4;\\nstatic const int ICC_CIRCUMSCRIBE = 3;\\nstatic const int ICC_INTERSECT = 2;\\nstatic const int ICC_INSCRIBE = 1;\\nstatic const int ICC_CONTAIN = 0;\\n\\nstruct Point{\\n double x,y;\\n Point(){}\\n Point(double x,double y) :x(x),y(y){}\\n Point operator+(Point p) {return Point(x+p.x,y+p.y);}\\n Point operator-(Point p) {return Point(x-p.x,y-p.y);}\\n Point operator*(double k){return Point(x*k,y*k);}\\n Point operator/(double k){return Point(x/k,y/k);}\\n double norm(){return x*x+y*y;}\\n double abs(){return sqrt(norm());}\\n\\n bool operator < (const Point &p) const{\\n return x!=p.x?x<p.x:y<p.y;\\n //grid-point only\\n //return !equals(x,p.x)?x<p.x:!equals(y,p.y)?y<p.y:0;\\n }\\n\\n bool operator == (const Point &p) const{\\n return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;\\n }\\n};\\n\\nistream &operator >> (istream &is,Point &p){\\n is>>p.x>>p.y;\\n return is;\\n}\\n\\nostream &operator << (ostream &os,Point p){\\n os<<fixed<<setprecision(12)<<p.x<<\\\" \\\"<<p.y;\\n return os;\\n}\\n\\nbool sort_x(Point a,Point b){\\n return a.x!=b.x?a.x<b.x:a.y<b.y;\\n}\\n\\nbool sort_y(Point a,Point b){\\n return a.y!=b.y?a.y<b.y:a.x<b.x;\\n}\\n\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\n\\nistream &operator >> (istream &is,Polygon &p){\\n for(int i=0;i<(int)p.size();i++) cin>>p[i];\\n return is;\\n}\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(){}\\n Segment(Point p1, Point p2):p1(p1),p2(p2){}\\n};\\ntypedef Segment Line;\\n\\nistream &operator >> (istream &is,Segment &s){\\n is>>s.p1>>s.p2;\\n return is;\\n}\\n\\nstruct Circle{\\n Point c;\\n double r;\\n Circle(){}\\n Circle(Point c,double r):c(c),r(r){}\\n};\\n\\nistream &operator >> (istream &is,Circle &c){\\n is>>c.c>>c.r;\\n return is;\\n}\\n\\ndouble norm(Vector a){\\n return a.x*a.x+a.y*a.y;\\n}\\ndouble abs(Vector a){\\n return sqrt(norm(a));\\n}\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x+a.y*b.y;\\n}\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\nbool isOrthogonal(Vector a,Vector b){\\n return equals(dot(a,b),0.0);\\n}\\n\\nbool isOrthogonal(Point a1,Point a2,Point b1,Point b2){\\n return isOrthogonal(a1-a2,b1-b2);\\n}\\n\\nbool isOrthogonal(Segment s1,Segment s2){\\n return equals(dot(s1.p2-s1.p1,s2.p2-s2.p1),0.0);\\n}\\n\\nbool isParallel(Vector a,Vector b){\\n return equals(cross(a,b),0.0);\\n}\\n\\nbool isParallel(Point a1,Point a2,Point b1,Point b2){\\n return isParallel(a1-a2,b1-b2);\\n}\\n\\nbool isParallel(Segment s1,Segment s2){\\n return equals(cross(s1.p2-s1.p1,s2.p2-s2.p1),0.0); \\n}\\n\\nPoint project(Segment s,Point p){\\n Vector base=s.p2-s.p1;\\n double r=dot(p-s.p1,base)/norm(base);\\n return s.p1+base*r;\\n}\\n\\nPoint reflect(Segment s,Point p){\\n return p+(project(s,p)-p)*2.0;\\n}\\n\\ndouble arg(Vector p){\\n return atan2(p.y,p.x);\\n}\\n\\nVector polar(double a,double r){\\n return Point(cos(r)*a,sin(r)*a);\\n}\\n\\nint ccw(Point p0,Point p1,Point p2);\\nbool intersectSS(Point p1,Point p2,Point p3,Point p4);\\nbool intersectSS(Segment s1,Segment s2);\\nbool intersectPS(Polygon p,Segment l);\\nint intersectCC(Circle c1,Circle c2);\\nbool intersectSC(Segment s,Circle c);\\ndouble getDistanceLP(Line l,Point p);\\ndouble getDistanceSP(Segment s,Point p);\\ndouble getDistanceSS(Segment s1,Segment s2);\\nPoint getCrossPointSS(Segment s1,Segment s2);\\nPoint getCrossPointLL(Line l1,Line l2);\\nPolygon getCrossPointCL(Circle c,Line l);\\nPolygon getCrossPointCC(Circle c1,Circle c2);\\nint contains(Polygon g,Point p);\\nPolygon andrewScan(Polygon s);\\nPolygon convex_hull(Polygon ps);\\ndouble diameter(Polygon s);\\nbool isConvex(Polygon p);\\ndouble area(Polygon s);\\nPolygon convexCut(Polygon p,Line l);\\nLine bisector(Point p1,Point p2);\\nVector translate(Vector v,double theta);\\nvector<Line> corner(Line l1,Line l2);\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Vector a = p1-p0;\\n Vector b = p2-p0;\\n if(cross(a,b) > EPS) return CCW_COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS) return CCW_CLOCKWISE;\\n if(dot(a,b) < -EPS) return CCW_ONLINE_BACK;\\n if(a.norm()<b.norm()) return CCW_ONLINE_FRONT;\\n return CCW_ON_SEGMENT;\\n}\\n\\nbool intersectSS(Point p1,Point p2,Point p3,Point p4){\\n return (ccw(p1,p2,p3)*ccw(p1,p2,p4) <= 0 &&\\n\\t ccw(p3,p4,p1)*ccw(p3,p4,p2) <= 0 );\\n}\\n\\nbool intersectSS(Segment s1,Segment s2){\\n return intersectSS(s1.p1,s1.p2,s2.p1,s2.p2);\\n}\\n\\nbool intersectPS(Polygon p,Segment l){\\n int n=p.size();\\n for(int i=0;i<n;i++)\\n if(intersectSS(Segment(p[i],p[(i+1)%n]),l)) return 1;\\n return 0;\\n}\\n\\nint intersectCC(Circle c1,Circle c2){\\n if(c1.r<c2.r) swap(c1,c2);\\n double d=abs(c1.c-c2.c);\\n double r=c1.r+c2.r;\\n if(equals(d,r)) return ICC_CIRCUMSCRIBE;\\n if(d>r) return ICC_SEPERATE;\\n if(equals(d+c2.r,c1.r)) return ICC_INSCRIBE;\\n if(d+c2.r<c1.r) return ICC_CONTAIN;\\n return ICC_INTERSECT;\\n}\\n\\nbool intersectSC(Segment s,Circle c){\\n double d=getDistanceSP(s,c.c);\\n return d<=c.r;\\n}\\n\\ndouble getDistanceLP(Line l,Point p){\\n return abs(cross(l.p2-l.p1,p-l.p1)/abs(l.p2-l.p1));\\n}\\n\\ndouble getDistanceSP(Segment s,Point p){\\n if(dot(s.p2-s.p1,p-s.p1) < 0.0 ) return abs(p-s.p1);\\n if(dot(s.p1-s.p2,p-s.p2) < 0.0 ) return abs(p-s.p2);\\n return getDistanceLP(s,p);\\n}\\n\\ndouble getDistanceSS(Segment s1,Segment s2){\\n if(intersectSS(s1,s2)) return 0.0;\\n return min(min(getDistanceSP(s1,s2.p1),getDistanceSP(s1,s2.p2)),\\n\\t min(getDistanceSP(s2,s1.p1),getDistanceSP(s2,s1.p2)));\\n}\\n\\nPoint getCrossPointSS(Segment s1,Segment s2){\\n Vector base=s2.p2-s2.p1;\\n double d1=abs(cross(base,s1.p1-s2.p1));\\n double d2=abs(cross(base,s1.p2-s2.p1));\\n double t=d1/(d1+d2);\\n return s1.p1+(s1.p2-s1.p1)*t;\\n}\\n\\nPoint getCrossPointLL(Line l1,Line l2){\\n double a=cross(l1.p2-l1.p1,l2.p2-l2.p1);\\n double b=cross(l1.p2-l1.p1,l1.p2-l2.p1);\\n if(abs(a)<EPS&&abs(b)<EPS) return l2.p1;\\n return l2.p1+(l2.p2-l2.p1)*(b/a);\\n}\\n\\nPolygon getCrossPointCL(Circle c,Line l){\\n Polygon p(2);\\n Vector pr=project(l,c.c);\\n Vector e=(l.p2-l.p1)/abs(l.p2-l.p1);\\n double base=sqrt(c.r*c.r-norm(pr-c.c));\\n p[0]=pr+e*base;\\n p[1]=pr-e*base;\\n return p;\\n}\\n\\nPolygon getCrossPointCC(Circle c1,Circle c2){\\n Polygon p(2);\\n double d=abs(c1.c-c2.c);\\n double a=acos((c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d));\\n double t=arg(c2.c-c1.c);\\n p[0]=c1.c+polar(c1.r,t+a);\\n p[1]=c1.c+polar(c1.r,t-a);\\n return p;\\n}\\n\\n// IN:2 ON:1 OUT:0\\nint contains(Polygon g,Point p){\\n int n=g.size();\\n bool x=false;\\n for(int i=0;i<n;i++){\\n Point a=g[i]-p,b=g[(i+1)%n]-p;\\n if(fabs(cross(a,b)) < EPS && dot(a,b) < EPS) return 1;\\n if(a.y>b.y) swap(a,b);\\n if(a.y < EPS && EPS < b.y && cross(a,b) > EPS ) x = !x;\\n }\\n return (x?2:0);\\n}\\n\\nPolygon andrewScan(Polygon s){\\n Polygon u,l;\\n if(s.size()<3) return s;\\n sort(s.begin(),s.end());\\n u.push_back(s[0]);\\n u.push_back(s[1]);\\n l.push_back(s[s.size()-1]);\\n l.push_back(s[s.size()-2]);\\n for(int i=2;i<(int)s.size();i++){\\n for(int n=u.size();n>=2&&ccw(u[n-2],u[n-1],s[i])!=CCW_CLOCKWISE;n--){\\n u.pop_back();\\n }\\n u.push_back(s[i]);\\n } \\n for(int i=s.size()-3;i>=0;i--){\\n for(int n=l.size();n>=2&&ccw(l[n-2],l[n-1],s[i])!=CCW_CLOCKWISE;n--){\\n l.pop_back();\\n }\\n l.push_back(s[i]);\\n }\\n reverse(l.begin(),l.end());\\n for(int i=u.size()-2;i>=1;i--) l.push_back(u[i]);\\n return l;\\n} \\n\\nPolygon convex_hull(Polygon ps){\\n int n=ps.size();\\n sort(ps.begin(),ps.end(),sort_y);\\n int k=0;\\n Polygon qs(n*2);\\n for(int i=0;i<n;i++){\\n while(k>1&&cross(qs[k-1]-qs[k-2],ps[i]-qs[k-1])<0) k--;\\n qs[k++]=ps[i];\\n }\\n for(int i=n-2,t=k;i>=0;i--){\\n while(k>t&&cross(qs[k-1]-qs[k-2],ps[i]-qs[k-1])<0) k--;\\n qs[k++]=ps[i];\\n }\\n qs.resize(k-1);\\n return qs;\\n}\\n\\ndouble diameter(Polygon s){\\n Polygon p=s;\\n int n=p.size();\\n if(n==2) return abs(p[0]-p[1]);\\n int i=0,j=0;\\n for(int k=0;k<n;k++){\\n if(p[i]<p[k]) i=k;\\n if(!(p[j]<p[k])) j=k;\\n }\\n double res=0;\\n int si=i,sj=j;\\n while(i!=sj||j!=si){\\n res=max(res,abs(p[i]-p[j]));\\n if(cross(p[(i+1)%n]-p[i],p[(j+1)%n]-p[j])<0.0){\\n i=(i+1)%n;\\n }else{\\n j=(j+1)%n;\\n }\\n }\\n return res;\\n}\\n\\nbool isConvex(Polygon p){\\n bool f=1;\\n int n=p.size();\\n for(int i=0;i<n;i++){\\n int t=ccw(p[(i+n-1)%n],p[i],p[(i+1)%n]);\\n f&=t!=CCW_CLOCKWISE;\\n }\\n return f;\\n}\\n\\ndouble area(Polygon s){\\n double res=0;\\n for(int i=0;i<(int)s.size();i++){\\n res+=cross(s[i],s[(i+1)%s.size()])/2.0;\\n }\\n return abs(res);\\n}\\n\\ndouble area(Circle c1,Circle c2){\\n double d=abs(c1.c-c2.c);\\n if(c1.r+c2.r<=d+EPS) return 0;\\n if(d<=abs(c1.r-c2.r)){\\n double r=min(c1.r,c2.r);\\n return PI*r*r;\\n }\\n double rc=(d*d+c1.r*c1.r-c2.r*c2.r)/(2*d);\\n double th=acos(rc/c1.r);\\n double ph=acos((d-rc)/c2.r);\\n return c1.r*c1.r*th+c2.r*c2.r*ph-d*c1.r*sin(th);\\n}\\n\\nPolygon convexCut(Polygon p,Line l){\\n Polygon q;\\n for(int i=0;i<(int)p.size();i++){\\n Point a=p[i],b=p[(i+1)%p.size()];\\n if(ccw(l.p1,l.p2,a)!=-1) q.push_back(a);\\n if(ccw(l.p1,l.p2,a)*ccw(l.p1,l.p2,b)<0)\\n q.push_back(getCrossPointLL(Line(a,b),l));\\n }\\n return q;\\n}\\n\\nLine bisector(Point p1,Point p2){\\n Circle c1=Circle(p1,abs(p1-p2)),c2=Circle(p2,abs(p1-p2));\\n Polygon p=getCrossPointCC(c1,c2);\\n if(cross(p2-p1,p[0]-p1)>0) swap(p[0],p[1]);\\n return Line(p[0],p[1]);\\n}\\n\\nVector translate(Vector v,double theta){\\n Vector res;\\n res.x=cos(theta)*v.x-sin(theta)*v.y;\\n res.y=sin(theta)*v.x+cos(theta)*v.y;\\n return res;\\n}\\n\\nvector<Line> corner(Line l1,Line l2){\\n vector<Line> res;\\n if(isParallel(l1,l2)){\\n double d=getDistanceLP(l1,l2.p1)/2.0;\\n Vector v1=l1.p2-l1.p1;\\n v1=v1/v1.abs()*d;\\n Point p=l2.p1+translate(v1,90.0*(PI/180.0));\\n double d1=getDistanceLP(l1,p);\\n double d2=getDistanceLP(l2,p);\\n if(abs(d1-d2)>d){\\n p=l2.p1+translate(v1,-90.0*(PI/180.0));\\n }\\n res.push_back(Line(p,p+v1));\\n }else{\\n Point p=getCrossPointLL(l1,l2);\\n Vector v1=l1.p2-l1.p1,v2=l2.p2-l2.p1;\\n v1=v1/v1.abs();\\n v2=v2/v2.abs();\\n res.push_back(Line(p,p+(v1+v2)));\\n res.push_back(Line(p,p+translate(v1+v2,90.0*(PI/180.0))));\\n }\\n return res;\\n}\\n\\nPolygon tangent(Circle c1,Point p2){\\n Circle c2=Circle(p2,sqrt(norm(c1.c-p2)-c1.r*c1.r));\\n Polygon p=getCrossPointCC(c1,c2);\\n sort(p.begin(),p.end());\\n return p;\\n}\\n\\n\\ntemplate<typename T>\\nvoid chmin(T &a,T b){if(a>b) a=b;}\\ntemplate<typename T>\\nvoid chmax(T &a,T b){if(a<b) a=b;}\\n\\n\\nsigned main(){\\n int n;\\n while(cin>>n,n){\\n vector<Circle> v(n);\\n for(int i=0;i<n;i++) cin>>v[i].r>>v[i].c;\\n auto calc=[](Circle a,Circle b){\\n return abs(a.c-b.c)-(a.r+b.r);\\n };\\n double ans=calc(v[0],v[1]);\\n for(int k=0;k<10;k++){\\n sort(v.begin(),v.end(),[](Circle a,Circle b){return sort_x(a.c,b.c);});\\n for(int i=0;i<n-1;i++) chmin(ans,calc(v[i],v[i+1]));\\n sort(v.begin(),v.end(),[](Circle a,Circle b){return sort_y(a.c,b.c);});\\n for(int i=0;i<n-1;i++) chmin(ans,calc(v[i],v[i+1]));\\n for(int i=0;i<n;i++) v[i].c=translate(v[i].c,PI/100);\\n }\\n cout<<fixed<<setprecision(12)<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 690,\n \"memory_kb\": 5708,\n \"score_of_the_acc\": -0.2049,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2057_2645155\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\n \\ntypedef pair<double,double> P;\\ntypedef pair<P,double> P2;\\n \\nP rot(P p, double a){\\n a=a*M_PI/180.0;\\n return P(p.first*cos(a)+p.second*(-sin(a)),\\n p.first*sin(a)+p.second*cos(a));\\n}\\n \\ndouble abss(P a,P b){\\n return sqrt((a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second));\\n}\\n \\ndouble x,y,r;int tt;\\nvector<P2>v;\\nint main(){\\n \\n int n;\\n while(cin >> n,n){\\n \\n double ans=1e13;\\n \\n v.clear();\\n \\n r(i,n){\\n cin>>r>>x>>y;\\n v.push_back(P2(P(x,y),r));\\n }\\n \\n r(i,1){\\n sort(v.begin(),v.end());\\n r(j,n){\\n for(int k=j+1,c=0;k<n;k++,c++){\\n if(c>50)break;\\n ans=min(ans,abss(v[k].first,v[j].first)-v[k].second-v[j].second);\\n }\\n }\\n r(j,n)v[i].first=rot(v[i].first,0.5);\\n }\\n \\n printf(\\\"%.9f\\\\n\\\",ans);\\n \\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 6220,\n \"score_of_the_acc\": -0.1971,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2057_2644955\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\n\\ntypedef pair<double,double> P;\\ntypedef pair<P,double> P2;\\n\\nP rot(P p, double a){\\n a=a*M_PI/180.0;\\n return P(p.first*cos(a)+p.second*(-sin(a)),\\n p.first*sin(a)+p.second*cos(a));\\n}\\n\\ndouble abss(P a,P b){\\n return sqrt((a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second));\\n}\\n\\ndouble x,y,r;int tt;\\nvector<P2>v;\\nint main(){\\n\\n int n;\\n while(cin >> n,n){\\n\\n double ans=1e13;\\n \\n v.clear();\\n \\n r(i,n){\\n cin>>r>>x>>y;\\n v.push_back(P2(P(x,y),r));\\n }\\n\\n r(i,1){\\n sort(v.begin(),v.end());\\n r(j,n){\\n\\tfor(int k=j+1,c=0;k<n;k++,c++){\\n\\t if(c>50)break;\\n\\t ans=min(ans,abss(v[k].first,v[j].first)-v[k].second-v[j].second);\\n\\t}\\n }\\n r(j,n)v[i].first=rot(v[i].first,0.5);\\n }\\n\\n printf(\\\"%.9f\\\\n\\\",ans);\\n \\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 6212,\n \"score_of_the_acc\": -0.1967,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2057_2589403\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <cmath>\\n#define ele int\\nusing namespace std;\\n#define maxn 100010\\n#define INF 1e18\\n#define eps 1e-7\\nstruct circle{\\n\\tdouble x,y,r;\\n};\\nele n;\\ndouble R;\\ncircle a[maxn];\\ninline bool cmp1(circle a,circle b){\\n\\treturn a.x<b.x;\\n}\\ninline bool cmp2(circle a,circle b){\\n\\treturn a.y<b.y;\\n}\\ninline double dis(circle a,circle b){\\n\\treturn sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y))-a.r-b.r;\\n}\\ndouble solve(ele l,ele r){\\n\\tif (r-l+1<=10){\\n\\t\\tdouble ans=INF;\\n\\t\\tfor (int i=l; i<=r; ++i)\\n\\t\\t\\tfor (int j=i+1; j<=r; ++j)\\n\\t\\t\\t\\tans=min(ans,dis(a[i],a[j]));\\n\\t\\treturn ans;\\n\\t}\\n\\tele mid=(l+r)>>1;\\n\\tdouble ans=min(solve(l,mid-1),solve(mid+1,r));\\n\\tfor (int i=l; i<=r; ++i)\\n\\t\\tif (i!=mid) ans=min(ans,dis(a[i],a[mid]));\\n\\tstatic circle p[maxn],q[maxn];\\n\\tele u=0,v=0;\\n\\tfor (int i=l; i<mid; ++i)\\n\\t\\tif (a[mid].x-a[i].x<ans+R*2+eps) p[u++]=a[i];\\n\\tfor (int i=mid+1; i<=r; ++i)\\n\\t\\tif (a[i].x-a[mid].x<ans+R*2+eps) q[v++]=a[i];\\n\\tif (!v) return ans;\\n\\tsort(p,p+u,cmp2); sort(q,q+v,cmp2);\\n\\tele s=0,t=0;\\n\\tfor (int i=0; i<u; ++i){\\n\\t\\twhile (s<v-1 && p[i].y-q[s].y>ans+R*2+eps) ++s;\\n\\t\\twhile (t<v-1 && q[t+1].y-p[i].y<ans+R*2+eps) ++t;\\n\\t\\tfor (int j=s; j<=t; ++j) ans=min(ans,dis(p[i],q[j]));\\n\\t}\\n\\treturn ans;\\n}\\nint main(){\\n\\twhile (scanf(\\\"%d\\\",&n),n){\\n\\t\\tR=0;\\n\\t\\tfor (int i=0; i<n; ++i){\\n\\t\\t\\tscanf(\\\"%lf%lf%lf\\\",&a[i].r,&a[i].x,&a[i].y);\\n\\t\\t\\tR=max(R,a[i].r);\\n\\t\\t}\\n\\t\\tsort(a,a+n,cmp1);\\n\\t\\tprintf(\\\"%.10lf\\\\n\\\",solve(0,n-1));\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 7312,\n \"score_of_the_acc\": -0.2202,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2057_2104768\",\n \"code_snippet\": \"#include <iomanip>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nstruct circle { double x, y, r; };\\nint n; circle x[100009];\\nbool operator<(const circle& c1, const circle& c2) {\\n\\treturn c1.x - c1.r < c2.x - c2.r;\\n}\\nint main() {\\n\\twhile (cin >> n, n) {\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tscanf(\\\"%lf%lf%lf\\\", &x[i].r, &x[i].x, &x[i].y);\\n\\t\\t\\tdouble ex = x[i].x * 0.28 - x[i].y * 0.96;\\n\\t\\t\\tdouble ey = x[i].x * 0.96 + x[i].y * 0.28;\\n\\t\\t\\tx[i].x = ex, x[i].y = ey;\\n\\t\\t}\\n\\t\\tsort(x, x + n);\\n\\t\\tdouble ret = 1.0e+9;\\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 (x[i].x + x[i].r + ret < x[j].x - x[j].r) break;\\n\\t\\t\\t\\tdouble dist = hypot(x[i].x - x[j].x, x[i].y - x[j].y) - x[i].r - x[j].r;\\n\\t\\t\\t\\tret = min(ret, dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%.15lf\\\\n\\\", ret);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 5628,\n \"score_of_the_acc\": -0.1152,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2057_1899541\",\n \"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#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 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}\\ndouble min(double a,double b){return a<b?a:b;}\\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;cin>>a;\\n\\t\\t\\tP p=pin();\\n\\t\\t\\t//p=turn(p,17);\\n\\t\\t\\tc.pb(C(p,a));\\n\\t\\t}\\n\\t\\tsort(all(c),[](C a,C b){\\n\\t\\t\\treturn a.c<b.c;\\n\\t\\t});\\n\\t\\tdouble out=inf;\\n\\t\\trep(i,n){\\n\\t\\t\\tint r=max(0,i-10),l=min(i+10,n);\\n\\t\\t\\tloop(j,r,l)if(j!=i){\\n\\t\\t\\t\\tout=min(out,abs(c[i].c-c[j].c)-c[i].r-c[j].r);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<shosu(9)<<out<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 450,\n \"memory_kb\": 8624,\n \"score_of_the_acc\": -0.3238,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2057_1899536\",\n \"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#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 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}\\ndouble min(double a,double b){return a<b?a:b;}\\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;cin>>a;\\n\\t\\t\\tP p=pin();\\n\\t\\t\\tp=turn(p,17);\\n\\t\\t\\tc.pb(C(p,a));\\n\\t\\t}\\n\\t\\tsort(all(c),[](C a,C b){\\n\\t\\t\\treturn a.c<b.c;\\n\\t\\t});\\n\\t\\tdouble out=inf;\\n\\t\\trep(i,n){\\n\\t\\t\\tint r=max(0,i-10),l=min(i+10,n);\\n\\t\\t\\tloop(j,r,l)if(j!=i){\\n\\t\\t\\t\\tout=min(out,abs(c[i].c-c[j].c)-c[i].r-c[j].r);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<shosu(9)<<out<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 450,\n \"memory_kb\": 8640,\n \"score_of_the_acc\": -0.3246,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2057_1722145\",\n \"code_snippet\": \"#include <cstdio>\\n#include <algorithm>\\n#include <cmath>\\n#include <vector>\\n\\nusing namespace std;\\n\\nstruct Circle{\\n\\tdouble x,y,r;\\n\\tbool operator < (const Circle &)const;\\n};\\n\\nbool Circle::operator < (const Circle &a)const{\\n\\treturn (x*x+y*y)<(a.x*a.x+a.y*a.y);\\n}\\n\\ndouble dist(const Circle &a,const Circle &b){\\n\\treturn sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y))-a.r-b.r;\\n}\\n\\nconst int MAX_N=100000;\\n\\nint N;\\nCircle c[MAX_N];\\n\\nvector<double> out;\\n\\nint main(){\\n\\tdo{\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif (N){\\n\\t\\t\\tfor (int i=0;i<N;i++){\\n\\t\\t\\t\\tscanf(\\\"%lf %lf %lf\\\",&c[i].r,&c[i].x,&c[i].y);\\n\\t\\t\\t}\\n\\t\\t\\tsort(c,c+N);\\n\\t\\t\\tdouble ans=1e50;\\n\\t\\t\\tfor (int i=0;i<N;i++){\\n\\t\\t\\t\\tfor (int j=i+1;j<min(N,i+4001);j++){\\n\\t\\t\\t\\t\\tans=min(ans,dist(c[i],c[j]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tout.push_back(ans);\\n\\t\\t}\\n\\t}while(N);\\n\\tfor (int i=0;i<out.size();i++){\\n\\t\\tprintf(\\\"%.12f\\\\n\\\",out[i]);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6680,\n \"memory_kb\": 3468,\n \"score_of_the_acc\": -1,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2057_1539332\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <cmath>\\n#define INF 1e10\\nusing namespace std;\\n\\nint n;\\nstruct P{\\n\\tdouble x,y,r;\\n\\tP(){}\\n\\tP(double xx,double yy,double rr){\\n\\t\\tx=xx;\\n\\t\\ty=yy;\\n\\t\\tr=rr;\\n\\t}\\n\\tbool operator<(const P &p1)const{\\n\\t\\treturn x<p1.x;\\n\\t}\\n};\\n\\nbool compare_y(P a,P b){\\n\\treturn a.y<b.y;\\n}\\n\\n\\ndouble closest_pair(P *a,int n){\\n\\tif(n<=1)return INF;\\n\\tint m=n/2;\\n\\tdouble x=a[m].x;\\n\\tdouble r=a[m].r;\\n\\tdouble d=min(closest_pair(a,m),closest_pair(a+m,n-m));\\n\\tinplace_merge(a,a+m,a+n,compare_y);\\n\\tvector<P> b;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tif(fabs(a[i].x-x)-a[i].r-r>=d)continue;\\n\\t\\tfor(int j=0;j<b.size();j++){\\n\\t\\t\\tdouble dx=a[i].x-b[b.size()-j-1].x;\\n\\t\\t\\tdouble dy=a[i].y-b[b.size()-j-1].y;\\n\\t\\t\\tif(dy>=d+r+a[i].r)break;\\n\\t\\t\\td=min(d,sqrt(dx*dx+dy*dy)-b[b.size()-j-1].r-a[i].r);\\n\\t\\t}\\n\\t\\tb.push_back(a[i]);\\n\\t\\tr=max(a[i].r,r);\\n\\t}\\n\\treturn d;\\n}\\n\\nP p[100001];\\n\\nint main(void){\\n\\twhile(1){\\n\\t\\tscanf(\\\"%d\\\",&n);\\n\\t\\tif(n==0)break;\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tscanf(\\\"%lf %lf %lf\\\",&p[i].r,&p[i].x,&p[i].y);\\n\\t\\t}\\n\\t\\tsort(p,p+n);\\n\\t\\tprintf(\\\"%.9f\\\\n\\\",closest_pair(p,n));\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 8840,\n \"score_of_the_acc\": -0.3093,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2057_1110780\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<math.h>\\nusing namespace std;\\ndouble x[110000];\\ndouble y[110000];\\ndouble r[110000];\\npair<double,int>p[110000];\\nint main(){\\n\\tint a;\\n\\twhile(scanf(\\\"%d\\\",&a),a){\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tdouble tx,ty;\\n\\t\\t\\tscanf(\\\"%lf%lf%lf\\\",r+i,&tx,&ty);\\n\\t\\t\\tx[i]=cos(1)*tx-sin(1)*ty;\\n\\t\\t\\ty[i]=sin(1)*tx+cos(1)*ty;\\n\\t\\t}\\n\\t\\tdouble ret=sqrt((x[0]-x[1])*(x[0]-x[1])+(y[0]-y[1])*(y[0]-y[1]))-r[0]-r[1];\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tp[i]=make_pair(x[i]+r[i],i);\\n\\t\\t}\\n\\t\\tstd::sort(p,p+a);\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tfor(int j=i-1;j>=0;j--){\\n\\t\\t\\t\\tif(p[i].first-r[p[i].second]*2-p[j].first>ret)break;\\n\\t\\t\\t\\tint L=p[i].second;\\n\\t\\t\\t\\tint R=p[j].second;\\n\\t\\t\\t\\tret=min(ret,sqrt((x[L]-x[R])*(x[L]-x[R])+(y[L]-y[R])*(y[L]-y[R]))-r[L]-r[R]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%.12f\\\\n\\\",ret);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 5324,\n \"score_of_the_acc\": -0.1051,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2057_1092044\",\n \"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\\n\\ntypedef double DD;\\n\\nconst DD INF = 1LL<<60;\\nconst DD EPS = 1e-10;\\nconst DD PI = acos(-1.0);\\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\\nDD todeg(DD ang) {return ang * 180 / PI;}\\n\\nstruct Point {\\n DD x, y;\\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \\\", \\\" << p.y << ')';}\\n};\\n\\nPoint operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\\nPoint operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\\nPoint operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\\nPoint operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\\nPoint operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\\nPoint operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\\nPoint conj(const Point &p) {return Point(p.x, -p.y);}\\nPoint rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\\nPoint rot90(const Point &p) {return Point(-p.y, p.x);}\\nDD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\\nDD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\\nDD norm(const Point &p) {return dot(p, p);}\\nDD abs(const Point &p) {return sqrt(dot(p, p));}\\nDD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\\nbool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\\nbool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\\nbool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\\nPoint operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\\n\\nint ccw(const Point &a, const Point &b, const Point &c) {\\n if (cross(b-a, c-a) > EPS) return 1;\\n if (cross(b-a, c-a) < -EPS) return -1;\\n if (dot(b-a, c-a) < -EPS) return 2;\\n if (norm(b-a) < norm(c-a) - EPS) return -2;\\n return 0;\\n}\\n\\nstruct Line : vector<Point> {\\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\\n this->push_back(a);\\n this->push_back(b);\\n }\\n};\\n\\nstruct Circle : Point{\\n DD r;\\n Circle(Point p = Point(0.0, 0.0), DD r = 0.0) : Point(p), r(r) {}\\n};\\n\\n\\nDD MAX_R;\\nbool compare_y(Circle a, Circle b) { return a.y < b.y; }\\n\\nDD Rec(vector<Circle>::iterator it, int n) {\\n if (n <= 1) return INF;\\n int m = n/2;\\n DD x = it[m].x;\\n DD d = min(Rec(it, m), Rec(it+m, n-m));\\n inplace_merge(it, it+m, it+n, compare_y);\\n \\n vector<Circle> vec;\\n for (int i = 0; i < n; ++i) {\\n if (fabs(it[i].x - x) >= d + MAX_R*2) continue;\\n for (int j = 0; j < vec.size(); ++j) {\\n DD dx = it[i].x - vec[vec.size()-j-1].x;\\n DD dy = it[i].y - vec[vec.size()-j-1].y;\\n if (dy >= d + MAX_R*2) break;\\n d = min(d, abs(sqrt(dx*dx+dy*dy) - it[i].r - vec[vec.size()-j-1].r));\\n }\\n vec.push_back(it[i]);\\n }\\n return d;\\n}\\n\\nDD Closet(vector<Circle> vc) {\\n int n = vc.size();\\n sort(vc.begin(), vc.end());\\n return Rec(vc.begin(), n);\\n}\\n\\n\\nint n;\\ndouble r, x, y;\\n\\nint main() {\\n while (cin >> n) {\\n if (n == 0) break;\\n MAX_R = 0.0;\\n vector<Circle> vc(n);\\n for (int i = 0; i < n; ++i) cin >> vc[i].r >> vc[i].x >> vc[i].y, chmax(MAX_R, vc[i].r);\\n double res = Closet(vc);\\n cout << fixed << setprecision(9) << res << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 630,\n \"memory_kb\": 11160,\n \"score_of_the_acc\": -0.4864,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2057_1092029\",\n \"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\\n\\n\\ntypedef double DD;\\n\\nconst DD INF = 1LL<<60;\\nconst DD EPS = 1e-10;\\nconst DD PI = acos(-1.0);\\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\\nDD todeg(DD ang) {return ang * 180 / PI;}\\n\\nstruct Point {\\n DD x, y;\\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \\\", \\\" << p.y << ')';}\\n};\\n\\nPoint operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\\nPoint operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\\nPoint operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\\nPoint operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\\nPoint operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\\nPoint operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\\nPoint conj(const Point &p) {return Point(p.x, -p.y);}\\nPoint rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\\nPoint rot90(const Point &p) {return Point(-p.y, p.x);}\\nDD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\\nDD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\\nDD norm(const Point &p) {return dot(p, p);}\\nDD abs(const Point &p) {return sqrt(dot(p, p));}\\nDD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\\nbool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\\nbool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\\nbool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\\nPoint operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\\n\\nint ccw(const Point &a, const Point &b, const Point &c) {\\n if (cross(b-a, c-a) > EPS) return 1;\\n if (cross(b-a, c-a) < -EPS) return -1;\\n if (dot(b-a, c-a) < -EPS) return 2;\\n if (norm(b-a) < norm(c-a) - EPS) return -2;\\n return 0;\\n}\\n\\nstruct Line : vector<Point> {\\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\\n this->push_back(a);\\n this->push_back(b);\\n }\\n};\\n\\nstruct Circle : Point{\\n DD r;\\n Circle(Point p = Point(0.0, 0.0), DD r = 0.0) : Point(p), r(r) {}\\n};\\n\\n\\nDD MAX_R;\\nbool compare_y(Circle a, Circle b) { return a.y < b.y; }\\n\\nDD Rec(vector<Circle>::iterator it, int n) {\\n if (n <= 1) return INF;\\n int m = n/2;\\n DD x = it[m].x;\\n DD d = min(Rec(it, m), Rec(it+m, n-m));\\n inplace_merge(it, it+m, it+n, compare_y);\\n \\n vector<Circle> vec;\\n for (int i = 0; i < n; ++i) {\\n if (fabs(it[i].x - x) >= d + MAX_R*2) continue;\\n for (int j = 0; j < vec.size(); ++j) {\\n DD dx = it[i].x - vec[vec.size()-j-1].x;\\n DD dy = it[i].y - vec[vec.size()-j-1].y;\\n if (dy >= d + MAX_R*2) break;\\n d = min(d, abs(sqrt(dx*dx+dy*dy) - it[i].r - vec[vec.size()-j-1].r));\\n }\\n vec.push_back(it[i]);\\n }\\n return d;\\n}\\n\\nDD Closet(vector<Circle> vc) {\\n int n = vc.size();\\n sort(vc.begin(), vc.end());\\n return Rec(vc.begin(), n);\\n}\\n\\n\\nint n;\\ndouble r, x, y;\\n\\nint main() {\\n while (cin >> n) {\\n if (n == 0) break;\\n MAX_R = 0.0;\\n vector<Circle> vc(n);\\n for (int i = 0; i < n; ++i) cin >> vc[i].r >> vc[i].x >> vc[i].y, chmax(MAX_R, vc[i].r);\\n double res = Closet(vc);\\n cout << fixed << setprecision(9) << res << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 620,\n \"memory_kb\": 11360,\n \"score_of_the_acc\": -0.4956,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":1092,"cells":{"group_id":{"kind":"string","value":"aoj_2065_cpp"},"problem_description":{"kind":"string","value":"Problem H:\nSlippy Floors\nThe princess of the Fancy Kingdom has been loved by many people for her lovely face. However the\nwitch of the Snow World has been jealous of the princess being loved. For her jealousy, the witch has\nshut the princess into the Ice Tower built by the witch’s extreme magical power.\nAs the Ice Tower is made of cubic ice blocks that stick hardly, the tower can be regarded to be composed\nof\nlevels\neach of which is represented by a 2D grid map. The only way for the princess to escape from the\ntower is to reach downward stairs on every level. However, many magical traps set by the witch obstruct\nher moving ways. In addition, because of being made of ice, the floor is so slippy that movement of the\nprincess is very restricted. To be precise, the princess can only press on one adjacent wall to move against\nthe wall as the reaction. She is only allowed to move in the vertical or horizontal direction, not in the\ndiagonal direction. Moreover, she is forced to keep moving without changing the direction until she is\nprevented from further moving by the wall, or she reaches a stairway or a magical trap. She must avoid\nthe traps by any means because her being caught by any of these traps implies her immediate death by\nits magic. These restriction on her movement makes her escape from the tower impossible, so she would\nbe frozen to death without any help.\nYou are a servant of the witch of the Snow World, but unlike the witch you love the princess as many other\npeople do. So you decided to help her with her escape. However, if you would go help her directly in the\nIce Tower, the witch would notice your act to cause your immediate death along with her. Considering\nthis matter and your ability, all you can do for her is to generate\nsnowmans\nat arbitrary places (grid\ncells) neither occupied by the traps nor specified as the cell where the princess is initially placed. These\nsnowmans are equivalent to walls, thus the princess may utilize them for her escape. On the other hand,\nyour magical power is limited, so you should generate the least number of snowmans needed for her\nescape.\nYou are required to write a program that solves placement of snowmans for given a map on each level,\nsuch that the number of generated snowmans are minimized.\nInput\nThe first line of the input contains a single integer that represents the number of levels in the Ice Tower.\nEach level is given by a line containing two integers\nNY\n(3 ≤\nNY\n≤ 30) and\nNX\n(3 ≤\nNX\n≤ 30) that\nindicate the vertical and horizontal sizes of the grid map respectively, and following\nNY\nlines that specify\nthe grid map. Each of the\nNY\nlines contain\nNX\ncharacters, where ‘A’ represents the initial place of the\nprincess, ‘>’ the downward stairs, ‘.’ a place outside the tower, ‘_’ an ordinary floor, ‘#’ a wall, and ‘^’ a\nmagical trap. Every map has exactly one ‘A’ and one ‘>’.\nYou may assume that there is no way of the princess moving to places outside the tower or beyond the\nmaps, and every case can be\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2065_861603","code_snippet":"/*\n00:42 - 01:17\n */\n\n#include<iostream>\n#include<algorithm>\n#include<climits>\n#include<cstdio>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define IINF (INT_MAX)\n#define MAX 31\nusing namespace std;\n\nint H,W;\nbool used[MAX][MAX];\nchar G[MAX][MAX];\nint sp,mincost;\nint dx[] = {0,1,0,-1};\nint dy[] = {1,0,-1,0};\n\ninline bool isValid(int x,int y){ return ( 0 <= x && x < W && 0 <= y && y < H); }\n\nvoid dfs(int cur,int cost,int pdir){\n\n if(cost >= 10)return;\n if(mincost <= cost)return;\n int x = cur % W, y = cur / W;\n\n if(G[y][x] == '>'){\n mincost = min(mincost,cost);\n return;\n }\n\n if(used[y][x])return;\n\n rep(i,4){\n if(i == pdir)continue;\n\n int rnx = x + dx[(i+2)%4], rny = y + dy[(i+2)%4];//テヲツャツ。テ」ツ?ォテゥツ?イテ」ツつ?ヲツ鳴ケテ・ツ青妥」ツ?ョテゥツ??\n if( G[rny][rnx] == '#' ){\n\n used[y][x] = true;\n int nx = x + dx[i], ny = y + dy[i];\n while( G[ny][nx] == '_' ){ \n\tif( G[ny+dy[i]][nx+dx[i]] == '^' )break;\n\tif( G[ny+dy[i]][nx+dx[i]] == '_'){\n\t G[ny+dy[i]][nx+dx[i]] = '#';\n\t dfs(nx+ny*W,cost+1,(i+2)%4);\n\t G[ny+dy[i]][nx+dx[i]] = '_';\n\t}\n\t nx += dx[i], ny += dy[i];\n }\n if( G[ny][nx] == '>' )dfs(nx+ny*W,cost,(i+2)%4);\n if( G[ny][nx] == '#'){\n\tnx -= dx[i], ny -= dy[i];\n\tdfs(nx+ny*W,cost,(i+2)%4);\n }\n used[y][x] = false;\n } else if( rnx+rny*W != sp && G[rny][rnx] == '_' ) {\n G[rny][rnx] = '#';\n dfs(cur,cost+1,pdir);\n G[rny][rnx] = '_';\n }\n }\n}\n\nint main(){\n int T;\n scanf(\"%d\",&T);\n while(T--){\n scanf(\"%d %d\",&H,&W);\n rep(y,H)rep(x,W){\n cin >> G[y][x];\n if(G[y][x] == 'A')sp = x + y * W, G[y][x] = '_';\n used[y][x] = false;\n }\n \n mincost = IINF;\n dfs(sp,0,IINF);\n if(mincost == IINF)puts(\"10\");\n else printf(\"%d\\n\",mincost);\n\n }\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":1232,"score_of_the_acc":-1,"final_rank":2},{"submission_id":"aoj_2065_861602","code_snippet":"/*\n00:42 - 01:17\n */\n\n#include<iostream>\n#include<algorithm>\n#include<climits>\n#include<cstdio>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define IINF (INT_MAX)\n#define MAX 31\nusing namespace std;\n\nint H,W;\nbool used[MAX][MAX];\nchar G[MAX][MAX];\nint sp,mincost;\nint dx[] = {0,1,0,-1};\nint dy[] = {1,0,-1,0};\n\ninline bool isValid(int x,int y){ return ( 0 <= x && x < W && 0 <= y && y < H); }\n\nvoid dfs(int cur,int cost,int pdir){\n\n if(cost >= 10)return;\n if(mincost <= cost)return;\n int x = cur % W, y = cur / W;\n\n if(G[y][x] == '>'){\n mincost = min(mincost,cost);\n return;\n }\n\n if(used[y][x])return;\n\n rep(i,4){\n //if(i == pdir)continue;\n\n int rnx = x + dx[(i+2)%4], rny = y + dy[(i+2)%4];//次に進む方向の逆\n if( G[rny][rnx] == '#' ){\n\n used[y][x] = true;\n int nx = x + dx[i], ny = y + dy[i];\n while( G[ny][nx] == '_' ){ \n\tif( G[ny+dy[i]][nx+dx[i]] == '^' )break;\n\tif( G[ny+dy[i]][nx+dx[i]] == '_'){\n\t G[ny+dy[i]][nx+dx[i]] = '#';\n\t dfs(nx+ny*W,cost+1,(i+2)%4);\n\t G[ny+dy[i]][nx+dx[i]] = '_';\n\t}\n\t nx += dx[i], ny += dy[i];\n }\n if( G[ny][nx] == '>' )dfs(nx+ny*W,cost,(i+2)%4);\n if( G[ny][nx] == '#'){\n\tnx -= dx[i], ny -= dy[i];\n\tdfs(nx+ny*W,cost,(i+2)%4);\n }\n used[y][x] = false;\n } else if( rnx+rny*W != sp && G[rny][rnx] == '_' ) {\n G[rny][rnx] = '#';\n dfs(cur,cost+1,pdir);\n G[rny][rnx] = '_';\n }\n }\n}\n\nint main(){\n int T;\n scanf(\"%d\",&T);\n while(T--){\n scanf(\"%d %d\",&H,&W);\n rep(y,H)rep(x,W){\n cin >> G[y][x];\n if(G[y][x] == 'A')sp = x + y * W, G[y][x] = '_';\n used[y][x] = false;\n }\n \n mincost = IINF;\n dfs(sp,0,IINF);\n if(mincost == IINF)puts(\"10\");\n else printf(\"%d\\n\",mincost);\n\n }\n return 0;\n}","accuracy":1,"time_ms":2530,"memory_kb":1228,"score_of_the_acc":-1,"final_rank":2},{"submission_id":"aoj_2065_861601","code_snippet":"/*\n00:42 - 01:17\n */\n\n#include<iostream>\n#include<cmath>\n#include<vector>\n#include<deque>\n#include<queue>\n#include<algorithm>\n#include<climits>\n#include<cassert>\n#include<cstdio>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define IINF (INT_MAX)\n#define MAX 31\nusing namespace std;\n\nint H,W;\nbool used[MAX][MAX];\nchar G[MAX][MAX];\nint sp,mincost;\nint dx[] = {0,1,0,-1};\nint dy[] = {1,0,-1,0};\n\ninline bool isValid(int x,int y){ return ( 0 <= x && x < W && 0 <= y && y < H); }\n\nvoid dfs(int cur,int cost,int pdir){\n\n if(cost >= 10)return;\n if(mincost <= cost)return;\n int x = cur % W, y = cur / W;\n\n if(G[y][x] == '>'){\n mincost = min(mincost,cost);\n return;\n }\n\n if(used[y][x])return;\n\n rep(i,4){\n if(i == pdir)continue;\n\n int rnx = x + dx[(i+2)%4], rny = y + dy[(i+2)%4];//次に進む方向の逆\n if( G[rny][rnx] == '#' ){\n\n used[y][x] = true;\n int nx = x + dx[i], ny = y + dy[i];\n while( G[ny][nx] == '_' ){ \n\tif( G[ny+dy[i]][nx+dx[i]] == '^' )break;\n\tif( G[ny+dy[i]][nx+dx[i]] == '_'){\n\t G[ny+dy[i]][nx+dx[i]] = '#';\n\t dfs(nx+ny*W,cost+1,(i+2)%4);\n\t G[ny+dy[i]][nx+dx[i]] = '_';\n\t}\n\t nx += dx[i], ny += dy[i];\n }\n if( G[ny][nx] == '>' )dfs(nx+ny*W,cost,(i+2)%4);\n if( G[ny][nx] == '#'){\n\tnx -= dx[i], ny -= dy[i];\n\tdfs(nx+ny*W,cost,(i+2)%4);\n }\n used[y][x] = false;\n } else if( rnx+rny*W != sp && G[rny][rnx] == '_' ) {\n G[rny][rnx] = '#';\n dfs(cur,cost+1,pdir);\n G[rny][rnx] = '_';\n }\n }\n}\n\nint main(){\n int T;\n scanf(\"%d\",&T);\n while(T--){\n scanf(\"%d %d\",&H,&W);\n rep(y,H)rep(x,W){\n cin >> G[y][x];\n if(G[y][x] == 'A')sp = x + y * W, G[y][x] = '_';\n used[y][x] = false;\n }\n \n mincost = IINF;\n dfs(sp,0,IINF);\n if(mincost == IINF)puts(\"10\");\n else printf(\"%d\\n\",mincost);\n\n }\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":1228,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2065_861603\",\n \"code_snippet\": \"/*\\n00:42 - 01:17\\n */\\n\\n#include<iostream>\\n#include<algorithm>\\n#include<climits>\\n#include<cstdio>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define IINF (INT_MAX)\\n#define MAX 31\\nusing namespace std;\\n\\nint H,W;\\nbool used[MAX][MAX];\\nchar G[MAX][MAX];\\nint sp,mincost;\\nint dx[] = {0,1,0,-1};\\nint dy[] = {1,0,-1,0};\\n\\ninline bool isValid(int x,int y){ return ( 0 <= x && x < W && 0 <= y && y < H); }\\n\\nvoid dfs(int cur,int cost,int pdir){\\n\\n if(cost >= 10)return;\\n if(mincost <= cost)return;\\n int x = cur % W, y = cur / W;\\n\\n if(G[y][x] == '>'){\\n mincost = min(mincost,cost);\\n return;\\n }\\n\\n if(used[y][x])return;\\n\\n rep(i,4){\\n if(i == pdir)continue;\\n\\n int rnx = x + dx[(i+2)%4], rny = y + dy[(i+2)%4];//テヲツャツ。テ」ツ?ォテゥツ?イテ」ツつ?ヲツ鳴ケテ・ツ青妥」ツ?ョテゥツ??\\n if( G[rny][rnx] == '#' ){\\n\\n used[y][x] = true;\\n int nx = x + dx[i], ny = y + dy[i];\\n while( G[ny][nx] == '_' ){ \\n\\tif( G[ny+dy[i]][nx+dx[i]] == '^' )break;\\n\\tif( G[ny+dy[i]][nx+dx[i]] == '_'){\\n\\t G[ny+dy[i]][nx+dx[i]] = '#';\\n\\t dfs(nx+ny*W,cost+1,(i+2)%4);\\n\\t G[ny+dy[i]][nx+dx[i]] = '_';\\n\\t}\\n\\t nx += dx[i], ny += dy[i];\\n }\\n if( G[ny][nx] == '>' )dfs(nx+ny*W,cost,(i+2)%4);\\n if( G[ny][nx] == '#'){\\n\\tnx -= dx[i], ny -= dy[i];\\n\\tdfs(nx+ny*W,cost,(i+2)%4);\\n }\\n used[y][x] = false;\\n } else if( rnx+rny*W != sp && G[rny][rnx] == '_' ) {\\n G[rny][rnx] = '#';\\n dfs(cur,cost+1,pdir);\\n G[rny][rnx] = '_';\\n }\\n }\\n}\\n\\nint main(){\\n int T;\\n scanf(\\\"%d\\\",&T);\\n while(T--){\\n scanf(\\\"%d %d\\\",&H,&W);\\n rep(y,H)rep(x,W){\\n cin >> G[y][x];\\n if(G[y][x] == 'A')sp = x + y * W, G[y][x] = '_';\\n used[y][x] = false;\\n }\\n \\n mincost = IINF;\\n dfs(sp,0,IINF);\\n if(mincost == IINF)puts(\\\"10\\\");\\n else printf(\\\"%d\\\\n\\\",mincost);\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 1232,\n \"score_of_the_acc\": -1,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2065_861602\",\n \"code_snippet\": \"/*\\n00:42 - 01:17\\n */\\n\\n#include<iostream>\\n#include<algorithm>\\n#include<climits>\\n#include<cstdio>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define IINF (INT_MAX)\\n#define MAX 31\\nusing namespace std;\\n\\nint H,W;\\nbool used[MAX][MAX];\\nchar G[MAX][MAX];\\nint sp,mincost;\\nint dx[] = {0,1,0,-1};\\nint dy[] = {1,0,-1,0};\\n\\ninline bool isValid(int x,int y){ return ( 0 <= x && x < W && 0 <= y && y < H); }\\n\\nvoid dfs(int cur,int cost,int pdir){\\n\\n if(cost >= 10)return;\\n if(mincost <= cost)return;\\n int x = cur % W, y = cur / W;\\n\\n if(G[y][x] == '>'){\\n mincost = min(mincost,cost);\\n return;\\n }\\n\\n if(used[y][x])return;\\n\\n rep(i,4){\\n //if(i == pdir)continue;\\n\\n int rnx = x + dx[(i+2)%4], rny = y + dy[(i+2)%4];//次に進む方向の逆\\n if( G[rny][rnx] == '#' ){\\n\\n used[y][x] = true;\\n int nx = x + dx[i], ny = y + dy[i];\\n while( G[ny][nx] == '_' ){ \\n\\tif( G[ny+dy[i]][nx+dx[i]] == '^' )break;\\n\\tif( G[ny+dy[i]][nx+dx[i]] == '_'){\\n\\t G[ny+dy[i]][nx+dx[i]] = '#';\\n\\t dfs(nx+ny*W,cost+1,(i+2)%4);\\n\\t G[ny+dy[i]][nx+dx[i]] = '_';\\n\\t}\\n\\t nx += dx[i], ny += dy[i];\\n }\\n if( G[ny][nx] == '>' )dfs(nx+ny*W,cost,(i+2)%4);\\n if( G[ny][nx] == '#'){\\n\\tnx -= dx[i], ny -= dy[i];\\n\\tdfs(nx+ny*W,cost,(i+2)%4);\\n }\\n used[y][x] = false;\\n } else if( rnx+rny*W != sp && G[rny][rnx] == '_' ) {\\n G[rny][rnx] = '#';\\n dfs(cur,cost+1,pdir);\\n G[rny][rnx] = '_';\\n }\\n }\\n}\\n\\nint main(){\\n int T;\\n scanf(\\\"%d\\\",&T);\\n while(T--){\\n scanf(\\\"%d %d\\\",&H,&W);\\n rep(y,H)rep(x,W){\\n cin >> G[y][x];\\n if(G[y][x] == 'A')sp = x + y * W, G[y][x] = '_';\\n used[y][x] = false;\\n }\\n \\n mincost = IINF;\\n dfs(sp,0,IINF);\\n if(mincost == IINF)puts(\\\"10\\\");\\n else printf(\\\"%d\\\\n\\\",mincost);\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2530,\n \"memory_kb\": 1228,\n \"score_of_the_acc\": -1,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2065_861601\",\n \"code_snippet\": \"/*\\n00:42 - 01:17\\n */\\n\\n#include<iostream>\\n#include<cmath>\\n#include<vector>\\n#include<deque>\\n#include<queue>\\n#include<algorithm>\\n#include<climits>\\n#include<cassert>\\n#include<cstdio>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define IINF (INT_MAX)\\n#define MAX 31\\nusing namespace std;\\n\\nint H,W;\\nbool used[MAX][MAX];\\nchar G[MAX][MAX];\\nint sp,mincost;\\nint dx[] = {0,1,0,-1};\\nint dy[] = {1,0,-1,0};\\n\\ninline bool isValid(int x,int y){ return ( 0 <= x && x < W && 0 <= y && y < H); }\\n\\nvoid dfs(int cur,int cost,int pdir){\\n\\n if(cost >= 10)return;\\n if(mincost <= cost)return;\\n int x = cur % W, y = cur / W;\\n\\n if(G[y][x] == '>'){\\n mincost = min(mincost,cost);\\n return;\\n }\\n\\n if(used[y][x])return;\\n\\n rep(i,4){\\n if(i == pdir)continue;\\n\\n int rnx = x + dx[(i+2)%4], rny = y + dy[(i+2)%4];//次に進む方向の逆\\n if( G[rny][rnx] == '#' ){\\n\\n used[y][x] = true;\\n int nx = x + dx[i], ny = y + dy[i];\\n while( G[ny][nx] == '_' ){ \\n\\tif( G[ny+dy[i]][nx+dx[i]] == '^' )break;\\n\\tif( G[ny+dy[i]][nx+dx[i]] == '_'){\\n\\t G[ny+dy[i]][nx+dx[i]] = '#';\\n\\t dfs(nx+ny*W,cost+1,(i+2)%4);\\n\\t G[ny+dy[i]][nx+dx[i]] = '_';\\n\\t}\\n\\t nx += dx[i], ny += dy[i];\\n }\\n if( G[ny][nx] == '>' )dfs(nx+ny*W,cost,(i+2)%4);\\n if( G[ny][nx] == '#'){\\n\\tnx -= dx[i], ny -= dy[i];\\n\\tdfs(nx+ny*W,cost,(i+2)%4);\\n }\\n used[y][x] = false;\\n } else if( rnx+rny*W != sp && G[rny][rnx] == '_' ) {\\n G[rny][rnx] = '#';\\n dfs(cur,cost+1,pdir);\\n G[rny][rnx] = '_';\\n }\\n }\\n}\\n\\nint main(){\\n int T;\\n scanf(\\\"%d\\\",&T);\\n while(T--){\\n scanf(\\\"%d %d\\\",&H,&W);\\n rep(y,H)rep(x,W){\\n cin >> G[y][x];\\n if(G[y][x] == 'A')sp = x + y * W, G[y][x] = '_';\\n used[y][x] = false;\\n }\\n \\n mincost = IINF;\\n dfs(sp,0,IINF);\\n if(mincost == IINF)puts(\\\"10\\\");\\n else printf(\\\"%d\\\\n\\\",mincost);\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 1228,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1093,"cells":{"group_id":{"kind":"string","value":"aoj_2061_cpp"},"problem_description":{"kind":"string","value":"Problem D:\nInternational Party\nIsaac H. Ives is attending an international student party (maybe for girl-hunting). Students there enjoy\ntalking in groups with excellent foods and drinks. However, since students come to the party from all\nover the world, groups may not have a language spoken by all students of the group. In such groups,\nsome student(s) need to work as interpreters, but intervals caused by interpretation make their talking\nless exciting.\nNeedless to say, students want exciting talks. To have talking exciting as much as possible, Isaac proposed\nthe following rule: the number of languages used in talking should be as little as possible, and not exceed\nfive. Many students agreed with his proposal, but it is not easy for them to find languages each student\nshould speak. So he calls you for help.\nYour task is to write a program that shows the minimum set of languages to make talking possible, given\nlists of languages each student speaks.\nInput\nThe input consists of a series of data sets.\nThe first line of each data set contains two integers\nN\n(1 ≤\nN\n≤ 30) and\nM\n(2 ≤\nM\n≤ 20) separated\nby a blank, which represent the numbers of languages and students respectively. The following\nN\nlines\ncontain language names, one name per line. The following\nM\nlines describe students in the group. The\ni\n-th line consists of an integer\nK\ni\nthat indicates the number of languages the\ni\n-th student speaks, and\nK\ni\nlanguage names separated by a single space. Each language name consists of up to twenty alphabetic\nletters.\nA line that contains two zeros indicates the end of input and is not part of a data set.\nOutput\nPrint a line that contains the minimum number\nL\nof languages to be spoken, followed by\nL\nlanguage\nnames in any order. Each language name should be printed in a separate line. In case two or more sets of\nthe same size is possible, you may print any one of them. If it is impossible for the group to enjoy talking\nwith not more than five languages, you should print a single line that contains “Impossible” (without\nquotes).\nPrint an empty line between data sets.\nSample Input\n3 4\nEnglish\nFrench\nJapanese\n1 English\n2 French English\n2 Japanese English\n1 Japanese\n2 2\nEnglish\nJapanese\n1 English\n1 Japanese\n6 7\nEnglish\nDutch\nGerman\nFrench\nItalian\nSpanish\n1 English\n2 English Dutch\n2 Dutch German\n2 German French\n2 French Italian\n2 Italian Spanish\n1 Spanish\n0 0\nOutput for the Sample Input\n2\nEnglish\nJapanese\n\nImpossible\n\nImpossible"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2061_10532388","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};\ntemplate <typename Type3>\nclass union_find\n{\nprivate:\n vector<Type3> graph;\n vector<Type3> sum;\n\npublic:\n // n頂点のグラフを作成(添字は0から)\n union_find(Type3 n)\n {\n graph.resize(n);\n sum.resize(n);\n for (int i = 0; i < n; i++)\n {\n graph[i] = i;\n sum[i] = 1;\n }\n }\n // 頂点nの根を返す\n Type3 root(Type3 n)\n {\n if (graph[n] == n)\n return n;\n else\n {\n graph[n] = root(graph[n]);\n return graph[n];\n }\n }\n // union_findの内部構造,デバッグ\n void debug()\n {\n for (unsigned i = 0; i < graph.size(); i++)\n {\n cout << graph[i] << \" \";\n }\n cout << endl;\n for (unsigned i = 0; i < graph.size(); i++)\n {\n cout << sum[i] << \" \";\n }\n cout << endl;\n }\n // 頂点mから頂点nに向かって辺を引く\n void line(Type3 m, Type3 n)\n {\n if (check(m, n))\n return;\n sum[root(m)] += sum[root(n)];\n sum[root(n)] = 0;\n graph[root(n)] = root(m);\n graph[n] = root(m);\n }\n // 頂点nが属する連結成分の大きさを返す\n Type3 size(Type3 n)\n {\n return sum[root(n)];\n }\n // 頂点mと頂点nが連結なら1,非連結なら0を返す\n bool check(Type3 m, Type3 n)\n {\n return root(m) == root(n);\n }\n};\n/////////////////////////////////////////////////////////////////////////////////////////\n\n////////////////////////////////////////////\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n bool isfirst = true;\n while (true)\n {\n ll n, m;\n cin >> n >> m;\n if (n == 0)\n {\n break;\n }\n else\n {\n if (isfirst)\n {\n isfirst = false;\n }\n else\n {\n cout << endl;\n }\n }\n vector<string> a(n);\n map<string, ll> mp;\n rep(i, 0, n)\n {\n string s;\n cin >> s;\n a[i] = s;\n mp[s] = i;\n }\n vector<vector<ll>> b(n);\n rep(i, 0, m)\n {\n ll t;\n cin >> t;\n rep(j, 0, t)\n {\n string s;\n cin >> s;\n b[mp[s]].push_back(i);\n }\n }\n bool f = false;\n rep(i, 1, min(n, 5LL) + 1)\n {\n vector<ll> ar(n, 0);\n rep(j, 0, i)\n {\n ar[j] = 1;\n }\n srt(ar);\n do\n {\n union_find<ll> uf(m);\n rep(j, 0, n)\n {\n if (ar[j] == 1)\n {\n rep(k, 0, b[j].size())\n {\n uf.line(b[j][0], b[j][k]);\n }\n }\n }\n if (uf.size(0) == m)\n {\n f = true;\n cout << i << endl;\n rep(j, 0, n)\n {\n if (ar[j] == 1)\n {\n cout << a[j] << endl;\n }\n }\n goto nxt;\n }\n } while (next_permutation(all(ar)));\n }\n nxt:\n if (!f)\n {\n cout << \"Impossible\" << endl;\n }\n }\n}","accuracy":1,"time_ms":200,"memory_kb":3456,"score_of_the_acc":-1.0276,"final_rank":9},{"submission_id":"aoj_2061_2864863","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\ntemplate < class BidirectionalIterator >\nbool next_combination(BidirectionalIterator first1,\n\tBidirectionalIterator last1,\n\tBidirectionalIterator first2,\n\tBidirectionalIterator last2)\n{\n\tif ((first1 == last1) || (first2 == last2)) {\n\t\treturn false;\n\t}\n\tBidirectionalIterator m1 = last1;\n\tBidirectionalIterator m2 = last2; --m2;\n\twhile (--m1 != first1 && !(*m1 < *m2)) {\n\t}\n\tbool result = (m1 == first1) && !(*first1 < *m2);\n\tif (!result) {\n\t\t// ①\n\t\twhile (first2 != m2 && !(*m1 < *first2)) {\n\t\t\t++first2;\n\t\t}\n\t\tfirst1 = m1;\n\t\tstd::iter_swap(first1, first2);\n\t\t++first1;\n\t\t++first2;\n\t}\n\tif ((first1 != last1) && (first2 != last2)) {\n\t\t// ②\n\t\tm1 = last1; m2 = first2;\n\t\twhile ((m1 != first1) && (m2 != last2)) {\n\t\t\tstd::iter_swap(--m1, m2);\n\t\t\t++m2;\n\t\t}\n\t\t// ③\n\t\tstd::reverse(first1, m1);\n\t\tstd::reverse(first1, last1);\n\t\tstd::reverse(m2, last2);\n\t\tstd::reverse(first2, last2);\n\t}\n\treturn !result;\n}\n\ntemplate < class BidirectionalIterator >\nbool next_combination(BidirectionalIterator first,\n\tBidirectionalIterator middle,\n\tBidirectionalIterator last)\n{\n\treturn next_combination(first, middle, middle, last);\n}\n\n\nstruct UnionFind {\n\tvector<int> data;\n\tUnionFind(int size) : data(size, -1) { }\n\tbool unionSet(int x, int y) {\n\t\tx = root(x); y = root(y);\n\t\tif (x != y) {\n\t\t\tif (data[y] < data[x]) swap(x, y);\n\t\t\tdata[x] += data[y]; data[y] = x;\n\t\t}\n\t\treturn x != y;\n\t}\n\tint root(int x) {\n\t\treturn data[x] < 0 ? x : data[x] = root(data[x]);\n\t}\n\tint size(int x) {\n\t\treturn -data[root(x)];\n\t}\n};\n\n\nint main() {\n\tcout<<setprecision(10)<<fixed;\n\n\tint tt=false;\n\twhile (true){\n\t\tint N,M;cin>>N>>M;\n\t\tif(!N)break;\n\n\t\tif (tt)cout << endl;\n\t\ttt = true;\n\t\tmap<string,int>mp;\n\t\tmap<int,string>revmp;\n\t\t{\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tstring st;cin>>st;\n\t\t\t\tmp[st]=i;\n\t\t\t\trevmp[i]=st;\n\t\t\t}\n\t\t}\n\t\tvector<vector<int>>langs(M,vector<int>(N));\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tint k;cin>>k;\n\t\t\tfor (int j = 0; j < k; ++j) {\n\t\t\t\tstring st;cin>>st;\n\t\t\t\tlangs[i][mp[st]]=true;\n\t\t\t}\n\t\t}\n\t\tvector<int>perms(N);\n\t\tiota(perms.begin(),perms.end(),0);\n\n\t\tvector<string>anss;\n\n\t\tfor (int t = 1; t <= (min(N, 5)); ++t) {\n\t\t\tdo {\n\t\t\t\tUnionFind uf(M + min(N, 5));\n\t\t\t\tfor (int i = 0; i < M; ++i) {\n\t\t\t\t\tfor (int j = 0; j < t; ++j) {\n\t\t\t\t\t\tint lang_id = perms[j];\n\t\t\t\t\t\tif (langs[i][lang_id])uf.unionSet(i, M + j);\n\n\t\t\t\t\t\tfor (int k = 1; k <t; ++k) {\n\t\t\t\t\t\t\tint lang_id2 = perms[k];\n\t\t\t\t\t\t\tif (langs[i][lang_id] && langs[i][lang_id2]) {\n\t\t\t\t\t\t\t\tuf.unionSet(M + j, M + k);\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\tset<int>aset;\n\t\t\t\tfor (int i = 0; i < M + t; ++i) {\n\t\t\t\t\taset.emplace(uf.root(i));\n\t\t\t\t}\n\t\t\t\tif (aset.size() == 1) {\n\t\t\t\t\tfor (int i = 0; i < t; ++i) {\n\t\t\t\t\t\tanss.emplace_back(revmp[perms[i]]);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t} while (next_combination(perms.begin(), perms.begin() + t, perms.end()));\n\t\t\tif(!anss.empty())break;\n\t\t}\n\t\tif (anss.empty()) {\n\t\t\tcout << \"Impossible\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcout<<anss.size()<<endl;\n\t\t\tfor(auto ans:anss)cout<<ans<<endl;\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1720,"memory_kb":3068,"score_of_the_acc":-1.1101,"final_rank":13},{"submission_id":"aoj_2061_2610874","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\nint N,M;\nchar name[30][21];\n\nint check[20];\n\nint boss[20],height[20];\nint POW[31];\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\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 < M; i++){\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t}\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\nint data_set = 0;\n\nvoid func(){\n\n\tif(data_set != 0){\n\t\tprintf(\"\\n\");\n\t}\n\tdata_set++;\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%s\",name[i]);\n\t}\n\n\tfor(int i = 0; i < M; i++)check[i] = 0;\n\n\tchar buf[21];\n\tint num;\n\n\tfor(int i = 0; i < M; i++){\n\t\tscanf(\"%d\",&num);\n\t\tfor(int k = 0; k < num; k++){\n\t\t\tscanf(\"%s\",buf);\n\t\t\tfor(int p = 0; p < N; p++){\n\t\t\t\tif(strCmp(name[p],buf)){\n\t\t\t\t\tcheck[i] += POW[p];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tbool FLG;\n\tint S;\n\n\tfor(int a = 0; a < N; a++){\n\t\tFLG = true;\n\t\tS = POW[a];\n\n\t\tfor(int i = 0; i < M; i++){\n\t\t\tif((check[i] & S) == 0){\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\tprintf(\"1\\n\");\n\t\t\tprintf(\"%s\\n\",name[a]);\n\t\t\treturn;\n\t\t}\n\t}\n\n\tif(N == 1){\n\t\tprintf(\"Impossible\\n\");\n\t\treturn;\n\t}\n\n\tint count;\n\n\tfor(int a = 0; a < N-1; a++){\n\t\tfor(int b = a+1; b < N; b++){\n\t\t\tS = POW[a]+POW[b];\n\t\t\tinit();\n\n\t\t\tfor(int i = 0; i < M-1; i++){\n\t\t\t\tfor(int k = i+1; k < M; k++){\n\t\t\t\t\tif(check[i]&check[k]&S){\n\t\t\t\t\t\tunite(i,k);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tcount = 0;\n\t\t\tfor(int i = 0; i < M; i++){\n\t\t\t\tif(get_boss(i) == i)count++;\n\t\t\t}\n\n\t\t\tif(count == 1){\n\t\t\t\tprintf(\"2\\n\");\n\t\t\t\tprintf(\"%s\\n\",name[a]);\n\t\t\t\tprintf(\"%s\\n\",name[b]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\n\tif(N == 2){\n\t\tprintf(\"Impossible\\n\");\n\t\treturn;\n\t}\n\n\n\tfor(int a = 0; a < N-2; a++){\n\t\tfor(int b = a+1; b < N-1; b++){\n\t\t\tfor(int c = b+1; c < N; c++){\n\t\t\t\tS = POW[a]+POW[b]+POW[c];\n\t\t\t\tinit();\n\n\t\t\t\tfor(int i = 0; i < M-1; i++){\n\t\t\t\t\tfor(int k = i+1; k < M; k++){\n\t\t\t\t\t\tif(check[i]&check[k]&S){\n\t\t\t\t\t\t\tunite(i,k);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tcount = 0;\n\t\t\t\tfor(int i = 0; i < M; i++){\n\t\t\t\t\tif(get_boss(i) == i)count++;\n\t\t\t\t}\n\n\t\t\t\tif(count == 1){\n\n\t\t\t\t\tprintf(\"3\\n\");\n\t\t\t\t\tprintf(\"%s\\n\",name[a]);\n\t\t\t\t\tprintf(\"%s\\n\",name[b]);\n\t\t\t\t\tprintf(\"%s\\n\",name[c]);\n\t\t\t\t\treturn;\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif(N == 3){\n\t\tprintf(\"Impossible\\n\");\n\t\treturn;\n\t}\n\n\tfor(int a = 0; a < N-3; a++){\n\t\tfor(int b = a+1; b < N-2; b++){\n\t\t\tfor(int c = b+1; c < N-1; c++){\n\t\t\t\tfor(int d = c+1; d < N; d++){\n\t\t\t\t\tS = POW[a]+POW[b]+POW[c]+POW[d];\n\t\t\t\t\tinit();\n\n\t\t\t\t\tfor(int i = 0; i < M-1; i++){\n\t\t\t\t\t\tfor(int k = i+1; k < M; k++){\n\t\t\t\t\t\t\tif(check[i]&check[k]&S){\n\t\t\t\t\t\t\t\tunite(i,k);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tcount = 0;\n\t\t\t\t\tfor(int i = 0; i < M; i++){\n\t\t\t\t\t\tif(get_boss(i) == i)count++;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(count == 1){\n\t\t\t\t\t\tprintf(\"4\\n\");\n\t\t\t\t\t\tprintf(\"%s\\n\",name[a]);\n\t\t\t\t\t\tprintf(\"%s\\n\",name[b]);\n\t\t\t\t\t\tprintf(\"%s\\n\",name[c]);\n\t\t\t\t\t\tprintf(\"%s\\n\",name[d]);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif(N == 4){\n\t\tprintf(\"Impossible\\n\");\n\t\treturn;\n\t}\n\n\tfor(int a = 0; a < N-4; a++){\n\t\tfor(int b = a+1; b < N-3; b++){\n\t\t\tfor(int c = b+1; c < N-2; c++){\n\t\t\t\tfor(int d = c+1; d < N-1; d++){\n\t\t\t\t\tfor(int e = d+1; e < N; e++){\n\t\t\t\t\t\tS = POW[a]+POW[b]+POW[c]+POW[d]+POW[e];\n\t\t\t\t\t\tinit();\n\n\t\t\t\t\t\tfor(int i = 0; i < M-1; i++){\n\t\t\t\t\t\t\tfor(int k = i+1; k < M; k++){\n\t\t\t\t\t\t\t\tif(check[i]&check[k]&S){\n\t\t\t\t\t\t\t\t\tunite(i,k);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tcount = 0;\n\t\t\t\t\t\tfor(int i = 0; i < M; i++){\n\t\t\t\t\t\t\tif(get_boss(i) == i)count++;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(count == 1){\n\t\t\t\t\t\t\tprintf(\"5\\n\");\n\t\t\t\t\t\t\tprintf(\"%s\\n\",name[a]);\n\t\t\t\t\t\t\tprintf(\"%s\\n\",name[b]);\n\t\t\t\t\t\t\tprintf(\"%s\\n\",name[c]);\n\t\t\t\t\t\t\tprintf(\"%s\\n\",name[d]);\n\t\t\t\t\t\t\tprintf(\"%s\\n\",name[e]);\n\t\t\t\t\t\t\treturn;\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\tprintf(\"Impossible\\n\");\n}\n\nint main(){\n\n\tfor(int i = 0; i < 31; i++)POW[i] = pow(2,i);\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&N,&M);\n\t\tif(N == 0 && M == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":550,"memory_kb":3328,"score_of_the_acc":-1.0302,"final_rank":11},{"submission_id":"aoj_2061_2610868","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\nint N,M;\nchar name[30][21];\n\nint check[20];\n\nint boss[20],height[20];\nint POW[31];\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\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 < M; i++){\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t}\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\nint data_set = 0;\n\nvoid func(){\n\n\tif(data_set != 0){\n\t\tprintf(\"\\n\");\n\t}\n\tdata_set++;\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%s\",name[i]);\n\t}\n\n\tfor(int i = 0; i < M; i++)check[i] = 0;\n\n\tchar buf[21];\n\tint num;\n\n\tfor(int i = 0; i < M; i++){\n\t\tscanf(\"%d\",&num);\n\t\tfor(int k = 0; k < num; k++){\n\t\t\tscanf(\"%s\",buf);\n\t\t\tfor(int p = 0; p < N; p++){\n\t\t\t\tif(strCmp(name[p],buf)){\n\t\t\t\t\tcheck[i] += POW[p];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tbool FLG;\n\tint S;\n\n\tfor(int a = 0; a < N; a++){\n\t\tFLG = true;\n\t\tS = POW[a];\n\n\t\tfor(int i = 0; i < M; i++){\n\t\t\tif((check[i] & S) == 0){\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\tprintf(\"1\\n\");\n\t\t\tprintf(\"%s\\n\",name[a]);\n\t\t\treturn;\n\t\t}\n\t}\n\n\tint count;\n\n\tfor(int a = 0; a < N-1; a++){\n\t\tfor(int b = a+1; b < N; b++){\n\t\t\tS = POW[a]+POW[b];\n\t\t\tinit();\n\n\t\t\tfor(int i = 0; i < M-1; i++){\n\t\t\t\tfor(int k = i+1; k < M; k++){\n\t\t\t\t\tif(check[i]&check[k]&S){\n\t\t\t\t\t\tunite(i,k);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tcount = 0;\n\t\t\tfor(int i = 0; i < M; i++){\n\t\t\t\tif(get_boss(i) == i)count++;\n\t\t\t}\n\n\t\t\tif(count == 1){\n\t\t\t\tprintf(\"2\\n\");\n\t\t\t\tprintf(\"%s\\n\",name[a]);\n\t\t\t\tprintf(\"%s\\n\",name[b]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\n\n\tfor(int a = 0; a < N-2; a++){\n\t\tfor(int b = a+1; b < N-1; b++){\n\t\t\tfor(int c = b+1; c < N; c++){\n\t\t\t\tS = POW[a]+POW[b]+POW[c];\n\t\t\t\tinit();\n\n\t\t\t\tfor(int i = 0; i < M-1; i++){\n\t\t\t\t\tfor(int k = i+1; k < M; k++){\n\t\t\t\t\t\tif(check[i]&check[k]&S){\n\t\t\t\t\t\t\tunite(i,k);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tcount = 0;\n\t\t\t\tfor(int i = 0; i < M; i++){\n\t\t\t\t\tif(get_boss(i) == i)count++;\n\t\t\t\t}\n\n\t\t\t\tif(count == 1){\n\n\t\t\t\t\tprintf(\"3\\n\");\n\t\t\t\t\tprintf(\"%s\\n\",name[a]);\n\t\t\t\t\tprintf(\"%s\\n\",name[b]);\n\t\t\t\t\tprintf(\"%s\\n\",name[c]);\n\t\t\t\t\treturn;\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int a = 0; a < N-3; a++){\n\t\tfor(int b = a+1; b < N-2; b++){\n\t\t\tfor(int c = b+1; c < N-1; c++){\n\t\t\t\tfor(int d = c+1; d < N; d++){\n\t\t\t\t\tS = POW[a]+POW[b]+POW[c]+POW[d];\n\t\t\t\t\tinit();\n\n\t\t\t\t\tfor(int i = 0; i < M-1; i++){\n\t\t\t\t\t\tfor(int k = i+1; k < M; k++){\n\t\t\t\t\t\t\tif(check[i]&check[k]&S){\n\t\t\t\t\t\t\t\tunite(i,k);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tcount = 0;\n\t\t\t\t\tfor(int i = 0; i < M; i++){\n\t\t\t\t\t\tif(get_boss(i) == i)count++;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(count == 1){\n\t\t\t\t\t\tprintf(\"4\\n\");\n\t\t\t\t\t\tprintf(\"%s\\n\",name[a]);\n\t\t\t\t\t\tprintf(\"%s\\n\",name[b]);\n\t\t\t\t\t\tprintf(\"%s\\n\",name[c]);\n\t\t\t\t\t\tprintf(\"%s\\n\",name[d]);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int a = 0; a < N-4; a++){\n\t\tfor(int b = a+1; b < N-3; b++){\n\t\t\tfor(int c = b+1; c < N-2; c++){\n\t\t\t\tfor(int d = c+1; d < N-1; d++){\n\t\t\t\t\tfor(int e = d+1; e < N; e++){\n\t\t\t\t\t\tS = POW[a]+POW[b]+POW[c]+POW[d]+POW[e];\n\t\t\t\t\t\tinit();\n\n\t\t\t\t\t\tfor(int i = 0; i < M-1; i++){\n\t\t\t\t\t\t\tfor(int k = i+1; k < M; k++){\n\t\t\t\t\t\t\t\tif(check[i]&check[k]&S){\n\t\t\t\t\t\t\t\t\tunite(i,k);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tcount = 0;\n\t\t\t\t\t\tfor(int i = 0; i < M; i++){\n\t\t\t\t\t\t\tif(get_boss(i) == i)count++;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(count == 1){\n\t\t\t\t\t\t\tprintf(\"5\\n\");\n\t\t\t\t\t\t\tprintf(\"%s\\n\",name[a]);\n\t\t\t\t\t\t\tprintf(\"%s\\n\",name[b]);\n\t\t\t\t\t\t\tprintf(\"%s\\n\",name[c]);\n\t\t\t\t\t\t\tprintf(\"%s\\n\",name[d]);\n\t\t\t\t\t\t\tprintf(\"%s\\n\",name[e]);\n\t\t\t\t\t\t\treturn;\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\tprintf(\"Impossible\\n\");\n}\n\nint main(){\n\n\tfor(int i = 0; i < 31; i++)POW[i] = pow(2,i);\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&N,&M);\n\t\tif(N == 0 && M == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":580,"memory_kb":3328,"score_of_the_acc":-1.0351,"final_rank":12},{"submission_id":"aoj_2061_2310191","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n#define all(v) begin(v), end(v)\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)\n\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\n\nusing pint = pair<int, int>;\nusing tint = tuple<int, int, int>;\nusing vint = vector<int>;\n\nconst int inf = 1LL << 55;\nconst int mod = 1e9 + 7;\n\nstruct UnionFind\n{\n vector<int> data;\n UnionFind(){}\n UnionFind(int sz):data(sz, -1){};\n int size(int x) { return -data[find(x)]; }\n int find(int x) { return data[x] < 0 ? x : data[x] = find(data[x]); }\n bool same(int x, int y) { return find(x) == find(y); }\n int unite(int x, int y)\n {\n x = find(x), y = find(y);\n if(x != y) {\n if(data[x] < data[y]) swap(x, y);\n data[x] += data[y]; data[y] = x;\n }\n return -data[x];\n }\n void init(int sz) {\n data.clear();\n data.resize(sz, -1);\n }\n};\n\nUnionFind uf;\n\nint N, M;\nvector<string> lang;\nmap<string, int> mp;\nmap<string, int> group;\nvector<int> vec;\nvector<string> ans;\n\nbool input() {\n cin >> N >> M;\n if(!N && !M) return false;\n\n lang.clear();\n mp.clear();\n rep(i, N) {\n string l;\n cin >> l;\n lang.push_back(l);\n mp[l] = i;\n }\n\n vec.clear();\n group.clear();\n rep(i, M) {\n int k; cin >> k;\n int bit = 0;\n rep(j, k) {\n string l; cin >> l;\n bit |= 1<<mp[l];\n group[l] |= 1<<i;\n }\n vec.push_back(bit);\n }\n\n return true;\n}\n\nvoid solve(int idx, int bit) {\n if(__builtin_popcount(bit) > 5) return;\n if(uf.size(N) == __builtin_popcount(bit)+M) {\n if(ans.empty() || __builtin_popcountll(bit) < ans.size()) {\n ans.clear();\n rep(i, N) if((bit>>i)&1) ans.push_back(lang[i]);\n }\n }\n\n reps(i, idx, N) {\n if((bit>>i)&1) continue;\n UnionFind tmp = uf;\n rep(j, M) if((vec[j]>>i)&1) uf.unite(i, N+j);\n solve(i+1, bit|(1<<i));\n uf = tmp;\n }\n}\n\nsigned main()\n{\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n bool flag = false;\n while(input()) {\n if(flag) cout << endl;\n flag = true;\n\n ans.clear();\n uf.init(N+M);\n solve(0, 0);\n if(ans.size()) {\n cout << ans.size() << endl;\n for(string l : ans) cout << l << endl;\n } else {\n cout << \"Impossible\" << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":2090,"memory_kb":3044,"score_of_the_acc":-1.1601,"final_rank":15},{"submission_id":"aoj_2061_2309651","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint p[51],r[51];\nvoid init(){for(int i=0;i<50;i++)p[i]=i,r[i]=0;}\nint find(int x){return (p[x]==x)?x:(p[x]=find(p[x]));}\nvoid unite(int x,int y) {\n x=find(x),y=find(y);\n if(x==y)return;\n if(r[x]<r[y])p[x]=y;\n else{p[y]=x;if(r[x]==r[y])r[x]++;}\n}\nbool same(int x,int y){return find(x)==find(y);}\nvector<string> s,ans;\nset<string> se[50];\nint n,m;\n \nvoid dfs(int k,int t) {\n bool f=1;\n for(int i=1; i<m; i++) if(!same(0,i)) {f=0;break;}\n if(f) {\n if(!ans.size()||ans.size()>__builtin_popcount(t)) {\n ans.clear();\n for(int i=0; i<n; i++) if(t&(1<<i)) ans.push_back(s[i]);\n }\n return;\n }\n if(k>=n) return;\n for(int i=k; i<n; i++) {\n if(__builtin_popcount(t|(1<<i))>5) continue;\n int l=0;\n while(l<m&&!se[l].count(s[i])) l++;\n if(l==m) continue;\n int pp[m],rr[m];\n for(int j=0; j<m; j++) pp[j]=p[j],rr[j]=r[j];\n for(int j=l+1; j<m; j++) {\n if(se[j].count(s[i])) unite(l,j);\n }\n dfs(i+1,t|(1<<i));\n for(int j=0; j<m; j++) p[j]=pp[j],r[j]=rr[j];\n }\n}\n \nint main() {\n int f=0;\n while(cin>>n>>m&&n) {\n if(f) cout<<endl;\n f=1;\n init();\n ans.clear();\n s.clear();\n for(int i=0; i<n; i++) {\n string t;cin>>t;\n s.push_back(t);\n }\n for(int i=0; i<m; i++) {\n se[i].clear();\n int k;cin>>k;\n for(int j=0; j<k; j++) {\n string t;cin>>t;\n se[i].insert(t);\n }\n }\n dfs(0,0);\n if(ans.size()) {\n cout<<ans.size()<<endl;\n for(int i=0; i<ans.size(); i++)cout<<ans[i]<<endl;\n } else cout<<\"Impossible\"<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1930,"memory_kb":3088,"score_of_the_acc":-1.1527,"final_rank":14},{"submission_id":"aoj_2061_2309147","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint A[21];\nint lan[30];\nint m,n;\n\nvector<int>ans,used;\n\nvoid dfs(int dep,int member,int use){\n if(member == (1<<n)-1) {\n if(ans.size()==0 || ans.size()> used.size()) ans = used;\n return ;\n }\n \n if(dep >= m || dep>=5)return;\n \n for(int i=0;i<m;i++){\n if(use&&(use>>i&1)==0) continue;\n \n int nmember = member | lan[i];\n int nuse = use;\n for(int j=0;j<n;j++)\n if(lan[i]>>j&1) nuse |= A[j];\n \n used.push_back(i);\n dfs(dep+1,nmember,nuse);\n used.pop_back();\n }\n}\n\nint main(){\n int flg = 0;\n while(1){\n \n cin>>m>>n;\n if(!m&&!n)break;\n if(flg++) cout<<endl;\n map<string,int> M;\n string name[30];\n for(int i=0;i<m;i++){\n string str;\n cin>>str;\n M[str] = i;\n name[i] = str;\n }\n\n memset(lan,0,sizeof(lan));\n memset(A,0,sizeof(A));\n \n for(int i=0;i<n;i++){\n int k;\n cin>>k;\n for(int j=0;j<k;j++){\n string str;\n cin>>str;\n A[i] |= 1<<M[str];\n lan[M[str]] |= 1<<i;\n }\n }\n\n ans.clear();used.clear();\n dfs(0,0,0);\n if(ans.size()==0) cout<<\"Impossible\"<<endl;\n else {\n cout<<ans.size()<<endl;\n for(int i=0;i<ans.size();i++)cout<<name[ans[i]]<<endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":6180,"memory_kb":3188,"score_of_the_acc":-1.8862,"final_rank":20},{"submission_id":"aoj_2061_2308833","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint p[51],r[51];\nvoid init(){for(int i=0;i<50;i++)p[i]=i,r[i]=0;}\nint find(int x){return (p[x]==x)?x:(p[x]=find(p[x]));}\nvoid unite(int x,int y) {\n x=find(x),y=find(y);\n if(x==y)return;\n if(r[x]<r[y])p[x]=y;\n else{p[y]=x;if(r[x]==r[y])r[x]++;}\n}\nbool same(int x,int y){return find(x)==find(y);}\nvector<string> s,ans;\nset<string> se[50];\nint n,m;\n\nvoid dfs(int k,int t) {\n bool f=1;\n for(int i=1; i<m; i++) if(!same(0,i)) f=0;\n if(f) {\n if(!ans.size()||ans.size()>__builtin_popcount(t)) {\n ans.clear();\n for(int i=0; i<n; i++) {\n if(t&(1<<i)) ans.push_back(s[i]);\n }\n }\n return;\n }\n if(k>=n) return;\n for(int i=k; i<n; i++) {\n if(__builtin_popcount(t|(1<<i))>5) continue;\n int l=0;\n while(l<m&&!se[l].count(s[i])) l++;\n if(l==m) continue;\n int pp[m],rr[m];\n for(int j=0; j<m; j++) pp[j]=p[j],rr[j]=r[j];\n for(int j=l+1; j<m; j++) {\n if(se[j].count(s[i])) unite(l,j);\n }\n dfs(i+1,t|(1<<i));\n for(int j=0; j<m; j++) p[j]=pp[j],r[j]=rr[j];\n }\n}\n\nint main() {\n int f=0;\n while(cin >> n >> m && n) {\n if(f) cout << endl;\n f=1;\n init();\n ans.clear();\n s.clear();\n for(int i=0; i<n; i++) {\n string t;\n cin >> t;\n s.push_back(t);\n }\n for(int i=0; i<m; i++) {\n se[i].clear();\n int k;\n cin >> k;\n for(int j=0; j<k; j++) {\n string t;\n cin >> t;\n se[i].insert(t);\n }\n }\n dfs(0,0);\n if(ans.size()) {\n cout << ans.size() << endl;\n for(int i=0; i<ans.size(); i++) cout << ans[i] << endl;\n } else cout << \"Impossible\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":2300,"memory_kb":3168,"score_of_the_acc":-1.2469,"final_rank":17},{"submission_id":"aoj_2061_2041075","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\nnamespace tree {\nstruct union_find {\n static const int Max = 22;\n int par[Max], rank[Max], size[Max], compnum;\n\n union_find(int N) {\n compnum = N;\n for(int i=0; i<N; i++) {\n par[i] = i;\n rank[i] = 0;\n size[i] = 1;\n }\n }\n\n int root(int x) {\n return par[x] == x ? x : par[x] = root(par[x]);\n }\n\n void unite(int x, int y) {\n x = root(x), y = root(y);\n if(x == y) return;\n if(rank[x] < rank[y]) {\n par[x] = y, size[y] += size[x];\n } else {\n par[y] = x, size[x] += size[y];\n if(rank[x] == rank[y]) rank[x]++;\n }\n compnum--;\n }\n\n int operator[](int x) { return root(x); }\n void operator()(int x, int y) { return unite(x, y); }\n\n bool same(int x, int y) { return root(x) == root(y); }\n int size_of(int x) { return size[root(x)]; }\n int num_of_comps() { return compnum; }\n};\n}\n\nint N, M;\nunordered_map<string, int> idmap;\nvector<string> langs;\nbool speaks[23][33];\n\nvoid input() {\n langs.clear(); langs.resize(N);\n rep(i, N) {\n cin >> langs[i];\n idmap[langs[i]] = i;\n }\n memset(speaks, 0, sizeof speaks);\n rep(i, M) {\n int k; cin >> k;\n rep(_, k) {\n string s; cin >> s;\n speaks[i][idmap[s]] = 1;\n }\n }\n}\n\nbool next_combination(int& comb, int const BitSize) {\n int x = comb & -comb, y = comb + x;\n comb = ((comb & ~y) / x >> 1) | y;\n return comb < 1 << BitSize;\n}\n\nvoid solve() {\n\n REP(K, 1, min(N + 1, 6)) {\n int comb = (1 << K) - 1;\n do {\n vector<int> uselangs;\n rep(i, N) {\n if(!(comb & 1 << i)) continue;\n uselangs.push_back(i);\n }\n\n tree::union_find uf(M);\n\n rep(i, M) REP(j, i + 1, M)\n for(auto langid: uselangs)\n if(speaks[i][langid] && speaks[j][langid])\n uf(i, j);\n\n if(uf.num_of_comps() == 1) {\n printf(\"%d\\n\", (int)uselangs.size());\n for(auto e: uselangs) printf(\"%s\\n\", langs[e].c_str());\n return;\n }\n } while(next_combination(comb, N));\n }\n puts(\"Impossible\");\n}\n\nint main() {\n bool first = 0;\n for(; cin >> N >> M && (N|M);) {\n if(first) cout << endl;\n first = 1;\n input();\n solve();\n }\n \n return 0;\n}","accuracy":1,"time_ms":2100,"memory_kb":3364,"score_of_the_acc":-1.2975,"final_rank":19},{"submission_id":"aoj_2061_2041049","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\nnamespace tree {\nstruct union_find {\n static const int Max = 22;\n int par[Max], rank[Max], size[Max], compnum;\n\n union_find(int N) {\n compnum = N;\n for(int i=0; i<N; i++) {\n par[i] = i;\n rank[i] = 0;\n size[i] = 1;\n }\n }\n\n int root(int x) {\n return par[x] == x ? x : par[x] = root(par[x]);\n }\n\n void unite(int x, int y) {\n x = root(x), y = root(y);\n if(x == y) return;\n if(rank[x] < rank[y]) {\n par[x] = y, size[y] += size[x];\n } else {\n par[y] = x, size[x] += size[y];\n if(rank[x] == rank[y]) rank[x]++;\n }\n compnum--;\n }\n\n int operator[](int x) { return root(x); }\n void operator()(int x, int y) { return unite(x, y); }\n\n bool same(int x, int y) { return root(x) == root(y); }\n int size_of(int x) { return size[root(x)]; }\n int num_of_comps() { return compnum; }\n};\n}\n\nint N, M;\nunordered_map<string, int> idmap;\nvector<string> langs;\nbool speaks[23][33];\n\nvoid input() {\n langs.clear(); langs.resize(N);\n rep(i, N) {\n cin >> langs[i];\n idmap[langs[i]] = i;\n }\n memset(speaks, 0, sizeof speaks);\n rep(i, M) {\n int k; cin >> k;\n rep(_, k) {\n string s; cin >> s;\n speaks[i][idmap[s]] = 1;\n }\n }\n}\n\nbool next_combination(int& comb, int const BitSize) {\n // Assume: comb := (1 << K) - 1, K <= BitSize\n int x = comb & -comb, y = comb + x;\n comb = ((comb & ~y) / x >> 1) | y;\n return comb < 1 << BitSize;\n}\n\nvoid solve() {\n\n REP(K, 1, min(N + 1, 6)) {\n int comb = (1 << K) - 1;\n do {\n vector<int> uselangs;\n rep(i, N) {\n if(!(comb & 1 << i)) continue;\n uselangs.push_back(i);\n }\n\n tree::union_find uf(M);\n\n rep(i, M) REP(j, i + 1, M)\n for(auto langid: uselangs)\n if(speaks[i][langid] && speaks[j][langid])\n uf(i, j);\n\n if(uf.num_of_comps() == 1) {\n printf(\"%d\\n\", (int)uselangs.size());\n for(auto e: uselangs) printf(\"%s\\n\", langs[e].c_str());\n return;\n }\n } while(next_combination(comb, N));\n }\n puts(\"Impossible\");\n}\n\nstring to_binary(int x, int const LeastDigit = 0) {\n string ret;\n while(x) ret.push_back(x % 2 + '0'), x /= 2;\n for(int i=ret.size(); i<LeastDigit; i++) ret.push_back('0');\n reverse(ret.begin(), ret.end());\n return ret;\n}\n\nint main() {\n bool first = 0;\n for(; cin >> N >> M && (N|M);) {\n if(first) cout << endl;\n first = 1;\n input();\n solve();\n }\n \n return 0;\n}","accuracy":1,"time_ms":2050,"memory_kb":3376,"score_of_the_acc":-1.2945,"final_rank":18},{"submission_id":"aoj_2061_1882442","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX_N 30\n#define MAX_M 20\n#define INF (1<<29)\n \nint N,M,mini,ansS;\nbool edge[MAX_M][MAX_N];\n \nclass Union_Find{\npublic:\n int par[MAX_M],rank[MAX_M],size[MAX_M];\n Union_Find(int N){\n\tfor(int i = 0 ; i < N ; i++){\n\t par[i] = i;\n\t rank[i] = 0;\n\t size[i] = 1;\n\t}\n }\n \n int find(int x){\n\tif(par[x] == x){\n\t return x;\n\t}\n\treturn par[x] = find(par[x]);\n }\n \n void unite(int x,int y){\n\tx = find(x);\n\ty = find(y);\n\tif(x == y) return;\n\tif(rank[x] < rank[y]){\n\t par[x] = y;\n\t size[y] += size[x];\n\t}else{\n\t par[y] = x;\n\t size[x] += size[y];\n\t if(rank[x] == rank[y]){\n\t\trank[x]++;\n\t }\n\t}\n }\n \n bool same(int x,int y){\n\treturn find(x) == find(y);\n }\n \n int getSize(int x){\n\treturn size[find(x)];\n }\n};\n \nbool check(int S){\n int idx = 0,arr[MAX_M];\n if(S == 0) return false;\n for(int i = 0 ; i < N ; i++){\n\tif(S >> i & 1){\n\t arr[idx++] = i;\n\t}\n }\n Union_Find uf(M);\n for(int i = 0 ; i < M ; i++){\n\tfor(int j = i+1 ; j < M ; j++){\n\t if(uf.same(i,j)) continue;\n\t for(int k = 0 ; k < idx ; k++){\n\t\tif(edge[i][arr[k]] && edge[j][arr[k]]){\n\t\t uf.unite(i,j);\n\t\t}\n\t }\n\t}\n }\n return (uf.getSize(0) == M);\n}\n \nvoid rec(int idx,int S,int num){\n if(num < mini && check(S)){\n\tmini = num; ansS = S;\n\treturn;\n }\n if(num == 5 || num >= mini) return;\n for(int i = idx ; i < N ; i++){\n\tif(S >> i & 1) continue;\n\trec(i+1,S|(1<<i),num+1);\n }\n}\n \nint main(){\n int K;\n bool blank = false;\n string lang[MAX_N],in;\n while(cin >> N >> M, N){\n\tmap<string,int> mp;\n\tmemset(edge,false,sizeof(edge));\n\tif(blank){ cout << endl; }\n\tblank = true;\n\tfor(int i = 0 ; i < N ; i++){\n\t cin >> lang[i];\n\t mp[lang[i]] = i;\n\t}\n\tfor(int i = 0 ; i < M ; i++){\n\t cin >> K;\n\t for(int j = 0 ; j < K ; j++){\n\t\tcin >> in;\n\t\tedge[i][mp[in]] = true;\n\t }\n\t}\n\tmini = INF;\n\trec(0,0,0);\n\tif(mini == INF){\n\t cout << \"Impossible\" << endl;\n\t}else{\n\t cout << __builtin_popcount(ansS) << endl;\n\t for(int i = 0 ; i < N ; i++){\n\t\tif(ansS >> i & 1){\n\t\t cout << lang[i] << endl;\n\t\t}\n\t }\n\t}\n }\n return 0;\n}","accuracy":1,"time_ms":2350,"memory_kb":3148,"score_of_the_acc":-1.2465,"final_rank":16},{"submission_id":"aoj_2061_1594337","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <complex>\n#include <assert.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair <int,int> P;\n\nstatic const double EPS = 1e-12;\n\nstatic const int tx[] = {+0,+1,+0,-1};\nstatic const int ty[] = {-1,+0,+1,+0};\n\nclass UnionFindTree {\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[] _par;\n delete[] _rank;\n }\n\n int find(int u){\n if(_par[u] == u) return u;\n return find(_par[u]);\n }\n\n bool unite(int u,int v){\n u = find(u);\n v = find(v);\n if(u == v) return false;\n \n if(_rank[u] < _rank[v]){\n _par[u] = v;\n }\n else{\n _par[v] = u;\n if(_rank[u] == _rank[v]) _rank[u]++;\n }\n return true;\n }\n};\n\nint main(){\n int num_of_languages;\n int num_of_students;\n bool is_first = true;\n while(~scanf(\"%d %d\",&num_of_languages,&num_of_students)){\n if(num_of_languages == 0 && num_of_students == 0){\n break;\n }\n if(!is_first){\n printf(\"\\n\");\n }\n map<string,int> lang2idx;\n map<int,string> idx2lang;\n for(int lang_i = 0; lang_i < num_of_languages; lang_i++){\n string lang;\n cin >> lang;\n lang2idx[lang] = lang_i;\n idx2lang[lang_i] = lang;\n }\n\n int students[21] = {};\n for(int student_i = 0; student_i < num_of_students; student_i++){\n int num_of_skills;\n scanf(\"%d\",&num_of_skills);\n for(int skill_i = 0; skill_i < num_of_skills; skill_i++){\n string skill;\n cin >> skill;\n students[student_i] |= (1 << lang2idx[skill]);\n }\n }\n\n int res = 0;\n\n\n for(int used = 1; used <= 5; used++){\n vector<int> languages;\n for(int i = 0; i < min(used,num_of_languages); i++){\n languages.push_back(1);\n }\n for(int i = 0; i < num_of_languages - used; i++){\n languages.push_back(0);\n }\n \n sort(languages.begin(),languages.end());\n do {\n int S = 0;\n for(int i = 0; i < languages.size(); i++){\n if(languages[i] == 1){\n S |= (1<<i);\n }\n }\n UnionFindTree uft(30);\n for(int student_i = 0; student_i < num_of_students; student_i++){\n for(int student_j = student_i + 1; student_j < num_of_students; student_j++){\n if(students[student_i] & students[student_j] & S){\n uft.unite(student_i,student_j);\n }\n }\n }\n \n set<int> parents;\n for(int student_i = 0; student_i < num_of_students; student_i++){\n parents.insert(uft.find(student_i));\n }\n if(parents.size() == 1){\n res = S;\n goto found;\n }\n } while(next_permutation(languages.begin(),languages.end()));\n }\n found:;\n\n if(res != 0){\n cout << __builtin_popcount(res) << endl;\n for(int lang_i = 0; lang_i < num_of_languages; lang_i++){\n if(res & (1<<lang_i)){\n cout << idx2lang[lang_i] << endl;\n }\n }\n }\n else{\n cout << \"Impossible\" << endl;\n }\n is_first = false;\n }\n}","accuracy":1,"time_ms":1340,"memory_kb":1292,"score_of_the_acc":-0.2945,"final_rank":5},{"submission_id":"aoj_2061_1326048","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX_N 30\n#define MAX_M 20\n#define INF (1<<29)\n\nint N,M,mini,ansS;\nbool edge[MAX_M][MAX_N];\n\nclass Union_Find{\npublic:\n int par[MAX_M],rank[MAX_M],size[MAX_M];\n Union_Find(int N){\n for(int i = 0 ; i < N ; i++){\n par[i] = i;\n rank[i] = 0;\n size[i] = 1;\n }\n }\n\n int find(int x){\n if(par[x] == x){\n return x;\n }\n return par[x] = find(par[x]);\n }\n\n void unite(int x,int y){\n x = find(x);\n y = find(y);\n if(x == y){ return; }\n if(rank[x] < rank[y]){\n par[x] = y;\n size[y] += size[x];\n }else{\n par[y] = x;\n size[x] += size[y];\n if(rank[x] == rank[y]){\n rank[x]++;\n }\n }\n }\n\n bool same(int x,int y){\n return find(x) == find(y);\n }\n\n int getSize(int x){\n return size[find(x)];\n }\n};\n\nbool check(int S){\n int idx = 0,arr[MAX_M];\n if(S == 0){ return false; }\n for(int i = 0 ; i < N ; i++){\n if(S >> i & 1){\n arr[idx++] = i;\n }\n }\n Union_Find uf(M);\n for(int i = 0 ; i < M ; i++){\n for(int j = i+1 ; j < M ; j++){\n if(uf.same(i,j)){ continue; }\n for(int k = 0 ; k < idx ; k++){\n if(edge[i][arr[k]] && edge[j][arr[k]]){\n uf.unite(i,j);\n }\n }\n }\n }\n return (uf.getSize(0) == M);\n}\n\nvoid rec(int idx,int S,int num){\n if(num < mini && check(S)){\n mini = num; ansS = S;\n return;\n }\n if(num == 5 || num >= mini){ return; }\n for(int i = idx ; i < N ; i++){\n if(S >> i & 1){ continue; }\n rec(i+1,S|(1<<i),num+1);\n }\n}\n\nint main(){\n int K;\n bool blank = false;\n string lang[MAX_N],in;\n while(cin >> N >> M, N){\n map<string,int> mp;\n memset(edge,false,sizeof(edge));\n if(blank){ cout << endl; }\n blank = true;\n for(int i = 0 ; i < N ; i++){\n cin >> lang[i];\n mp[lang[i]] = i;\n }\n for(int i = 0 ; i < M ; i++){\n cin >> K;\n for(int j = 0 ; j < K ; j++){\n cin >> in;\n edge[i][mp[in]] = true;\n }\n }\n mini = INF;\n rec(0,0,0);\n if(mini == INF){\n cout << \"Impossible\" << endl;\n }else{\n cout << __builtin_popcount(ansS) << endl;\n for(int i = 0 ; i < N ; i++){\n if(ansS >> i & 1){\n cout << lang[i] << endl;\n }\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":3090,"memory_kb":1224,"score_of_the_acc":-0.5502,"final_rank":7},{"submission_id":"aoj_2061_1150021","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<string>\n#include<map>\nusing namespace std;\nchar in[1100];\nint c[40][40];\nstring t[40];\nint v[40];\nint n;\nint sz;\nint ret;\nint ans[40];\nint UF[40];\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}\nvoid solve(int a,int b){\n\tif(ret==a)return ;\n\tbool ok=true;\n\tfor(int i=0;i<sz;i++)UF[i]=-1;\n\tfor(int i=0;i<sz;i++){\n\t\tfor(int j=i+1;j<sz;j++){\n\t\t\tbool OK=false;\n\t\t\tfor(int k=0;k<a;k++)if(c[i][v[k]]&&c[j][v[k]])OK=true;\n\t\t\tif(OK)UNION(i,j);\n\t\t}\n\t}\n\tif(UF[FIND(0)]==-sz){\n\t\tret=a;\n\t\tfor(int i=0;i<a;i++)ans[i]=v[i];\n\t\treturn;\n\t}\n\tfor(int i=b;i<n;i++){\n\t\tv[a]=i;\n\t\tsolve(a+1,i+1);\n\t}\n}\nint main(){\n\tint a,b;\n\tbool se=false;\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tif(se)printf(\"\\n\");\n\t\tse=true;\n\t\tmap<string,int>m;\n\t\tn=a;\n\t\tsz=b;\n\t\tret=6;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tscanf(\"%s\",in);\n\t\t\tstring tmp=in;\n\t\t\tt[i]=tmp;\n\t\t\tm[tmp]=i;\n\t\t}\n\t\tfor(int i=0;i<40;i++)for(int j=0;j<40;j++)c[i][j]=0;\n\t\tfor(int i=0;i<b;i++){\n\t\t\tint d;scanf(\"%d\",&d);\n\t\t\tfor(int j=0;j<d;j++){\n\t\t\t\tscanf(\"%s\",in);\n\t\t\t\tstring tmp=in;\n\t\t\t\tc[i][m[tmp]]=1;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i=0;i<a;i++)v[i]=0;\n\t\tsolve(0,0);\n\t\tif(ret==6){\n\t\t\tprintf(\"Impossible\\n\");\n\t\t}else{\n\t\t\tprintf(\"%d\\n\",ret);\n\t\t\tfor(int i=0;i<ret;i++)printf(\"%s\\n\",t[ans[i]].c_str());\n\t\t}\n\t}\n}","accuracy":1,"time_ms":2220,"memory_kb":1100,"score_of_the_acc":-0.3561,"final_rank":6},{"submission_id":"aoj_2061_1123839","code_snippet":"#include <iostream>\n#include <vector>\n#include <set>\n#include <algorithm>\n#include <map>\n#include <complex>\n#include <cstdio>\nusing namespace std;\n\nstruct UnionFind {\n vector<int> data;\n UnionFind(int size) : data(size, -1) { }\n bool unionSet(int x, int y) {\n x = root(x); y = root(y);\n if (x != y) {\n if (data[y] < data[x]) swap(x, y);\n data[x] += data[y]; data[y] = x;\n }\n return x != y;\n }\n bool findSet(int x, int y) {\n return root(x) == root(y);\n }\n int root(int x) {\n return data[x] < 0 ? x : data[x] = root(data[x]);\n }\n int size(int x) {\n return -data[root(x)];\n }\n};\n\n\nint N,M;\nvector<string> cand;\nmap<string, vector<int> > dic;\nmap<string,int> id;\n\nint check(vector<string> lan){\n\tUnionFind uf(N+M);\n\tfor( auto item : lan ){\n\t\tint u = id[item];\n\t\t\n\t\tfor( auto v : dic[item] )\n\t\t\tuf.unionSet(u+M,v);\n\t}\n\n\tfor(int i = 0 ; i < M ; i++)\n\t\tif( !uf.findSet(0,i) ) return false;\n\treturn true;\n}\nint good = 6;\nvector<string> answer;\nvector<string> now;\nint cur;\nint dfs(int x){\n\tif( good <= cur ) return 0;\n\tif( check(now) ){\n\t\tanswer = now;\n\t\tgood = cur;\n\t\treturn 0;\n\t}\n\tif( N <= x ) return 0;\n\tdfs(x+1);\n\t\n\tcur++;\n\tnow.push_back(cand[x]);\n\tdfs(x+1);\n\tnow.pop_back();\n\tcur--;\n\t\n}\nint main(){\n\tint fst = 0;\n\twhile(cin >> N >> M && N){\n\t\tif(fst++)cout << endl;\n\t\tcand.clear();\n\t\tdic.clear();\n\t\tfor(int i = 0 ; i < N ; i++){\n\t\t\tstring t;\n\t\t\tcin >> t;\n\t\t\tcand.push_back(t);\n\t\t}\n\t\tfor(int k = 0 ; k < M ; k++){\n\t\t\tint t;\n\t\t\tcin >> t;\n\t\t\tfor(int j = 0 ; j < t ; j++){\n\t\t\t\tstring s;\n\t\t\t\tcin >> s;\n\t\t\t\tdic[s].push_back(k);\n\t\t\t}\n\t\t}\n\t\tint k = 0;\n\t\tfor( auto x : dic){\n\t\t\tid[x.first] = k++;\n\t\t}\n\t\tgood = 6;\n\t\tcur = 0;\n\t\tdfs(0);\n\t\tif( good >= 6 ){\n\t\t\tcout << \"Impossible\" << endl;\n\t\t}else{\n\t\t\tcout << good << endl;\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}","accuracy":1,"time_ms":5670,"memory_kb":1364,"score_of_the_acc":-1.0291,"final_rank":10},{"submission_id":"aoj_2061_851813","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cmath>\n#include<cassert>\n#include<climits>\n#include<set>\n#include<vector>\n#include<algorithm>\n#include<map>\n#include<bitset>\n#include<deque>\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 35\n \nusing namespace std;\n \nint N,M,dex,limit;\ndeque<int> ans;\nvector<string> LG;\nmap<string,int> Index;\nvector<int> G[MAX];\nvector<int> bitG;\nset<int> input[MAX];\nstring country;\nbool used[MAX];\n \nvoid cdfs(int cur,deque<int>& selected){\n if(used[cur])return;\n used[cur] = true;\n //cout << \"cur = \" << cur << endl;\n for(int i=0;i<G[cur].size();i++){\n int next = G[cur][i];\n \n if(used[next])continue;\n \n bool ok = false;\n for(int j=0;j<selected.size();j++){\n int one = selected[j];\n if( ( (bitG[one]>>cur) & 1 ) && ( (bitG[one]>>next) & 1 ) ){\n ok = true;\n break;\n }\n }\n\n if(ok){\n //cout << \"from \" << cur << \" to \" << next << endl;\n cdfs(next,selected);\n }\n }\n}\n \n \nbool check(deque<int>& selected){\n for(int i=0;i<M;i++)used[i] = false;\n \n int OK = bitG[selected[0]];\n while(OK){\n int use = OK & -OK;\n int cur = log2(use);\n OK -= use;\n cdfs(cur,selected);\n }\n \n for(int i=0;i<M;i++)if(!used[i])return false;\n return true;\n}\n \nvoid dfs(int cur,int language,int student,deque<int>& selected){\n \n if(language >= limit || language >= 6){\n return;\n }\n \n if(student == (1<<M)-1){\n if(!check(selected))return;\n if(limit > language){\n limit = language;\n ans = selected;\n }\n return;\n }\n \n for(int i=cur;i<N;i++){\n selected.push_back(i);\n dfs(i+1,language+1,student|bitG[i],selected);\n selected.pop_back();\n }\n \n}\n \n \nint main(){\n \n bool first = true;\n while(cin >> N >> M,N|M){\n \n if(!first)puts(\"\");\n first = false;\n \n //init\n LG.clear();\n dex = 0;\n Index.clear();\n bitG.clear();\n ans.clear();\n for(int i=0;i<max(N,M);i++){\n G[i].clear();\n input[i].clear();\n }\n \n bitG.resize(N,0);\n \n for(int i=0;i<N;i++){\n cin >> country;\n LG.push_back(country);\n Index[country] = dex++;\n }\n \n int k;\n for(int i=0;i<M;i++){\n cin >> k;\n for(int j=0;j<k;j++){\n cin >> country;\n int index = Index[country];\n input[i].insert(index);\n bitG[index] |= (1<<i);\n }\n }\n \n //make graph\n for(int i=0;i<M;i++){\n for(int j=i+1;j<M;j++){\n for(set<int>::iterator it = input[i].begin(); it != input[i].end(); it++){\n int value = *it;\n if(input[j].find(value) != input[j].end()){\n G[i].push_back(j);\n G[j].push_back(i);\n }\n }\n }\n }\n \n limit = IINF;\n deque<int> deq;\n dfs(0,0,0,deq);\n \n if(limit == IINF){\n cout << \"Impossible\" << endl;\n } else {\n cout << limit << endl;\n for(int i=0;i<limit;i++){\n cout << LG[ans[i]] << endl;\n }\n }\n \n \n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1320,"score_of_the_acc":-0.0934,"final_rank":1},{"submission_id":"aoj_2061_851694","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cmath>\n#include<cassert>\n#include<climits>\n#include<set>\n#include<vector>\n#include<algorithm>\n#include<map>\n#include<bitset>\n#include<deque>\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 35\n\nusing namespace std;\n\nint N,M,dex,limit;\ndeque<int> ans;\nvector<string> LG;\nmap<string,int> Index;\nvector<int> G[MAX];\nvector<int> bitG;\nset<int> input[MAX];\nstring country;\nbool used[MAX];\n\nvoid cdfs(int cur,deque<int>& selected){\n if(used[cur])return;\n used[cur] = true;\n //cout << \"cur = \" << cur << endl;\n for(int i=0;i<G[cur].size();i++){\n int next = G[cur][i];\n\n if(used[next])continue;\n\n bool ok = false;\n for(int j=0;j<selected.size();j++){\n int one = selected[j];\n if( ( (bitG[one]>>cur) & 1 ) && ( (bitG[one]>>next) & 1 ) ){\n\tok = true;\n\tbreak;\n }\n }\n /*\n for(int j=0;j<selected.size();j++){\n int one = selected[j];\n for(int k=j;k<selected.size();k++){\n\tint two = selected[k];\n\tif( ( ((bitG[one]>>cur)&1) & ((bitG[two]>>next)&1) ) || ( ((bitG[two]>>cur)&1) & ((bitG[one]>>next)&1) ) ){\n\t cout << \"from \" << cur << \" to \" << next << \" is ok because they have \" << LG[one] << \" and \" << LG[two] << endl;\n\t ok = true;\n\t goto Skip;\n\t}\n }\n }\n Skip:;\n */\n if(ok){\n //cout << \"from \" << cur << \" to \" << next << endl;\n cdfs(next,selected);\n }\n }\n}\n\n\nbool check(deque<int>& selected){\n for(int i=0;i<M;i++)used[i] = false;\n\n int OK = bitG[selected[0]];\n while(OK){\n int use = OK & -OK;\n int cur = log2(use);\n OK -= use;\n cdfs(cur,selected);\n }\n\n for(int i=0;i<M;i++)if(!used[i])return false;\n return true;\n}\n\nvoid dfs(int cur,int language,int student,deque<int>& selected){\n\n if(language >= limit || language >= 6){\n return;\n }\n\n if(student == (1<<M)-1){\n if(!check(selected))return;\n if(limit > language){\n limit = language;\n ans = selected;\n }\n return;\n }\n\n for(int i=cur;i<N;i++){\n selected.push_back(i);\n dfs(i+1,language+1,student|bitG[i],selected);\n selected.pop_back();\n }\n\n}\n\n\nint main(){\n\n bool first = true;\n while(cin >> N >> M,N|M){\n\n if(!first)puts(\"\");\n first = false;\n\n //init\n LG.clear();\n dex = 0;\n Index.clear();\n bitG.clear();\n ans.clear();\n for(int i=0;i<max(N,M);i++){\n G[i].clear();\n input[i].clear();\n }\n \n bitG.resize(N,0);\n\n for(int i=0;i<N;i++){\n cin >> country;\n LG.push_back(country);\n Index[country] = dex++;\n }\n\n int k;\n for(int i=0;i<M;i++){\n cin >> k;\n for(int j=0;j<k;j++){\n\tcin >> country;\n\tint index = Index[country];\n\tinput[i].insert(index);\n\tbitG[index] |= (1<<i);\n }\n }\n\n //make graph\n for(int i=0;i<M;i++){\n for(int j=i+1;j<M;j++){\n\tfor(set<int>::iterator it = input[i].begin(); it != input[i].end(); it++){\n\t int value = *it;\n\t if(input[j].find(value) != input[j].end()){\n\t G[i].push_back(j);\n\t G[j].push_back(i);\n\t }\n\t}\n }\n }\n /* \n rep(i,N){\n bitset<10> state = bitG[Index[LG[i]]];\n cout << LG[i] << \" = \" << Index[LG[i]] << \" \" << state << endl;\n }\n\n deque<int> deq;\n deq.push_back(0);\n deq.push_back(1);\n deq.push_back(3);\n deq.push_back(5);\n cout << check(deq) << endl;\n */\n limit = IINF;\n deque<int> deq;\n dfs(0,0,0,deq);\n\n if(limit == IINF){\n cout << \"Impossible\" << endl;\n } else {\n cout << limit << endl;\n for(int i=0;i<limit;i++){\n\tcout << LG[ans[i]] << endl;\n }\n }\n\n\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1320,"score_of_the_acc":-0.0934,"final_rank":1},{"submission_id":"aoj_2061_771806","code_snippet":"#include <iostream>\n#include <sstream>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <cassert>\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\n\nusing namespace std;\ntypedef long long ll;\n\nconst int INF = 1000000000;\nconst int MOD = 1000000007;\nconst double EPS = 1e-8;\n\nint nextcomb(int S){\n int x = S & -S;\n int y = S + x;\n S = ((S & ~y) / x >> 1) | y;\n return S;\n}\n\nint main(){\n for(int N, M, first = 1; cin >> N >> M && N; first = 0){\n if(!first) cout << endl;\n\n vector<string> lang(N);\n map<string, int> lang_dic;\n REP(i, N){\n string s; cin >> s;\n lang[i] = s;\n lang_dic[s] = i;\n }\n\n bool have[30][30] = {};\n for(int i = 0; i < M; i++){\n int K; cin >> K;\n while(K--){\n string s;\n cin >> s;\n have[i][ lang_dic[s] ] = true;\n }\n }\n\n vector<int> ans;\n\n bool b[30][30] = {};\n REP(i, N) REP(j, N) REP(k, M)\n b[i][j] |= have[k][i] & have[k][j];\n\n for(int K = 1; K < 6; K++){\n if(ans.size() > 0) break;\n int S = (1 << K) - 1;\n while(S < 1 << N){\n vector<int> v;\n for(int i = 0; i < N; i++) if(S >> i & 1) v.push_back(i);\n S = nextcomb(S);\n bool ok = true;\n\n REP(i, M) if(none_of(v.begin(), v.end(), [&](int vi){ return have[i][vi]; })) ok = false;\n\n if(not ok) continue;\n\n bool bb[30][30] = {};\n for(auto vi : v) for(auto vj : v) bb[vi][vj] = b[vi][vj];\n for(auto vk : v) for(auto vi : v) for(auto vj : v) bb[vi][vj] |= bb[vi][vk] & bb[vk][vj];\n\n REP(i, M) REP(j, i){\n bool talk = false;\n for(auto vi : v) for(auto vj : v) if(bb[vi][vj] && have[i][vi] && have[j][vj]){\n goto NEXT;\n }\n ok = false;\n goto NEXT2;\n\n NEXT:;\n }\n\n if(ok) ans = v;\n NEXT2:;\n\n }\n }\n if(ans.empty()){\n cout << \"Impossible\" << endl;\n continue;\n }\n cout << ans.size() << endl;\n for(auto ai : ans){\n cout << lang[ai] << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":590,"memory_kb":1240,"score_of_the_acc":-0.1505,"final_rank":3},{"submission_id":"aoj_2061_677236","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <map>\n#include <vector>\nusing namespace std;\n\nconst int MAXN = 50;\nconst int MAXM = 40;\n\nclass UnionFind {\nprivate:\n int n;\n int *par, *rank;\npublic:\n UnionFind(int _n) {\n n = _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 ~UnionFind() {\n delete [] par;\n delete [] rank;\n }\n\n int find(int x) {\n if(par[x] == x) return x;\n return par[x] = find(par[x]);\n }\n\n bool same(int x, int y) {\n return find(x) == find(y);\n }\n\n void unite(int x, int y) {\n x = find(x);\n y = find(y);\n if(x == y) return;\n if(rank[x] < rank[y]) {\n par[x] = y;\n } else {\n par[y] = x;\n if(rank[x] == rank[y]) {\n ++rank[x];\n }\n }\n }\n};\n\nstruct Edge {\n int a, b;\n};\n\nint N, M;\nmap<string, int> L;\nvector<string> rL;\nvector<int> S;\nvector<int> V[6];\nvector<Edge> E[MAXN];\n\nvoid rec(int k, int i, int bit) {\n V[k].push_back(bit);\n if(k == 5) return;\n for(; i < N; ++i) {\n if(bit & (1<<i)) continue;\n rec(k+1, i+1, bit|(1<<i));\n }\n}\n\nbool test(int bit) {\n UnionFind uf(M);\n int cnt = 0;\n for(int i = 0; i < N; ++i) {\n if(bit & (1<<i)) {\n for(int j = 0; j < E[i].size(); ++j) {\n const Edge &e = E[i][j];\n if(!uf.same(e.a, e.b)) {\n uf.unite(e.a, e.b);\n ++cnt;\n }\n }\n }\n }\n return cnt == M-1;\n}\n\nint main() {\n bool first = true;\n while(cin >> N >> M && (N|M)) {\n L.clear();\n rL.clear();\n for(int i = 0; i < N; ++i) {\n string s;\n cin >> s;\n L[s] = L.size()-1;\n rL.push_back(s);\n }\n S = vector<int>(M, 0);\n for(int j = 0; j < M; ++j) {\n int k;\n cin >> k;\n while(k--) {\n string s;\n cin >> s;\n S[j] |= (1<<L[s]);\n }\n }\n for(int i = 0; i < 6; ++i) V[i].clear();\n rec(0,0,0);\n\n for(int i = 0; i < MAXN; ++i) E[i].clear();\n for(int a = 0; a < M; ++a) {\n for(int b = a+1; b < M; ++b) {\n int bit = (S[a] & S[b]);\n for(int k = 0; k < N; ++k) {\n if(bit & (1<<k)) {\n E[k].push_back((Edge){a,b});\n }\n }\n }\n }\n\n int ans = 0;\n try {\n for(int i = 1; i <= 5; ++i) {\n for(int j = 0; j < V[i].size(); ++j) {\n if(test(V[i][j])) {\n ans = V[i][j];\n throw 0;\n }\n }\n }\n } catch(...) {}\n\n if(first) first = false;\n else cout << endl;\n if(ans) {\n vector<string> v;\n for(int i = 0; i < N; ++i) {\n if(ans & (1<<i)) v.push_back(rL[i]);\n }\n cout << v.size() << endl;\n for(int i = 0; i < v.size(); ++i) {\n cout << v[i] << endl;\n }\n } else {\n cout << \"Impossible\" << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":490,"memory_kb":2468,"score_of_the_acc":-0.6554,"final_rank":8},{"submission_id":"aoj_2061_472541","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\nclass UnionFindTree\n{\n int n;\n vector<int> parent; // 親ノード\n vector<int> rank; // 木の高さの上限\n vector<int> num; // グループの要素数\n int find(int x){\n if(parent[x] == x)\n return x;\n return parent[x] = find(parent[x]);\n }\npublic:\n UnionFindTree(int n0){ // コンストラクタ\n n = n0;\n parent.resize(n);\n for(int i=0; i<n; ++i)\n parent[i] = i;\n rank.assign(n, 0);\n num.assign(n, 1);\n }\n void unite(int x, int y){ // xとyのグループを併合\n if((x = find(x)) != (y = find(y))){\n if(rank[x] < rank[y]){\n parent[x] = y;\n num[y] += num[x];\n }else{\n parent[y] = x;\n if(rank[x] == rank[y])\n ++ rank[x];\n num[x] += num[y];\n }\n -- n;\n }\n }\n bool same(int x, int y){ // xとyのグループが同じかを調べる\n return find(x) == find(y);\n }\n int getNum(){ // グループの数を返す\n return n;\n }\n int getNum(int x){ // xのグループの要素数を返す\n return num[find(x)];\n }\n};\n\ntemplate <size_t T>\nbool nextBitset(bitset<T> &bs, int digit)\n{\n if(bs.none())\n return false;\n bitset<T> x, y, z;\n x = bs.to_ulong() & (~(bs.to_ulong()) + 1ULL);\n y = bs.to_ulong() + x.to_ulong() + 0ULL;\n z = bs & ~y;\n if(bs[digit-1] && bs == z)\n return false;\n bs = ((z.to_ulong() / x.to_ulong()) >> 1) + 0ULL;\n bs |= y;\n return true;\n}\n\nint n, m;\nvector<string> name;\nvector<bitset<30> > use;\n\nvoid solve()\n{\n for(int i=1; i<=min(5, n); ++i){\n bitset<30> bs((1<<i)-1);\n do{\n UnionFindTree uft(m);\n for(int j=0; j<m; ++j){\n for(int k=0; k<j; ++k){\n if((use[j] & use[k] & bs).any())\n uft.unite(j, k);\n }\n }\n\n if(uft.getNum() == 1){\n cout << i << endl;\n for(int j=0; j<n; ++j){\n if(bs[j])\n cout << name[j] << endl;\n }\n return;\n }\n }while(nextBitset(bs, n));\n }\n\n cout << \"Impossible\" << endl;\n}\n\nint main()\n{\n bool isFirst = true;\n\n for(;;){\n cin >> n >> m;\n if(n == 0)\n return 0;\n\n name.resize(n);\n map<string, int> index;\n for(int i=0; i<n; ++i){\n cin >> name[i];\n index[name[i]] = i;\n }\n\n use.assign(m, 0);\n for(int i=0; i<m; ++i){\n int a;\n cin >> a;\n for(int j=0; j<a; ++j){\n string s;\n cin >> s;\n use[i][index[s]] = true;\n }\n }\n\n if(isFirst)\n isFirst = false;\n else\n cout << endl;\n\n solve();\n }\n}","accuracy":1,"time_ms":730,"memory_kb":1232,"score_of_the_acc":-0.1698,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_2061_10532388\",\n \"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};\\ntemplate <typename Type3>\\nclass union_find\\n{\\nprivate:\\n vector<Type3> graph;\\n vector<Type3> sum;\\n\\npublic:\\n // n頂点のグラフを作成(添字は0から)\\n union_find(Type3 n)\\n {\\n graph.resize(n);\\n sum.resize(n);\\n for (int i = 0; i < n; i++)\\n {\\n graph[i] = i;\\n sum[i] = 1;\\n }\\n }\\n // 頂点nの根を返す\\n Type3 root(Type3 n)\\n {\\n if (graph[n] == n)\\n return n;\\n else\\n {\\n graph[n] = root(graph[n]);\\n return graph[n];\\n }\\n }\\n // union_findの内部構造,デバッグ\\n void debug()\\n {\\n for (unsigned i = 0; i < graph.size(); i++)\\n {\\n cout << graph[i] << \\\" \\\";\\n }\\n cout << endl;\\n for (unsigned i = 0; i < graph.size(); i++)\\n {\\n cout << sum[i] << \\\" \\\";\\n }\\n cout << endl;\\n }\\n // 頂点mから頂点nに向かって辺を引く\\n void line(Type3 m, Type3 n)\\n {\\n if (check(m, n))\\n return;\\n sum[root(m)] += sum[root(n)];\\n sum[root(n)] = 0;\\n graph[root(n)] = root(m);\\n graph[n] = root(m);\\n }\\n // 頂点nが属する連結成分の大きさを返す\\n Type3 size(Type3 n)\\n {\\n return sum[root(n)];\\n }\\n // 頂点mと頂点nが連結なら1,非連結なら0を返す\\n bool check(Type3 m, Type3 n)\\n {\\n return root(m) == root(n);\\n }\\n};\\n/////////////////////////////////////////////////////////////////////////////////////////\\n\\n////////////////////////////////////////////\\nint main()\\n{\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n bool isfirst = true;\\n while (true)\\n {\\n ll n, m;\\n cin >> n >> m;\\n if (n == 0)\\n {\\n break;\\n }\\n else\\n {\\n if (isfirst)\\n {\\n isfirst = false;\\n }\\n else\\n {\\n cout << endl;\\n }\\n }\\n vector<string> a(n);\\n map<string, ll> mp;\\n rep(i, 0, n)\\n {\\n string s;\\n cin >> s;\\n a[i] = s;\\n mp[s] = i;\\n }\\n vector<vector<ll>> b(n);\\n rep(i, 0, m)\\n {\\n ll t;\\n cin >> t;\\n rep(j, 0, t)\\n {\\n string s;\\n cin >> s;\\n b[mp[s]].push_back(i);\\n }\\n }\\n bool f = false;\\n rep(i, 1, min(n, 5LL) + 1)\\n {\\n vector<ll> ar(n, 0);\\n rep(j, 0, i)\\n {\\n ar[j] = 1;\\n }\\n srt(ar);\\n do\\n {\\n union_find<ll> uf(m);\\n rep(j, 0, n)\\n {\\n if (ar[j] == 1)\\n {\\n rep(k, 0, b[j].size())\\n {\\n uf.line(b[j][0], b[j][k]);\\n }\\n }\\n }\\n if (uf.size(0) == m)\\n {\\n f = true;\\n cout << i << endl;\\n rep(j, 0, n)\\n {\\n if (ar[j] == 1)\\n {\\n cout << a[j] << endl;\\n }\\n }\\n goto nxt;\\n }\\n } while (next_permutation(all(ar)));\\n }\\n nxt:\\n if (!f)\\n {\\n cout << \\\"Impossible\\\" << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -1.0276,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2061_2864863\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\ntemplate < class BidirectionalIterator >\\nbool next_combination(BidirectionalIterator first1,\\n\\tBidirectionalIterator last1,\\n\\tBidirectionalIterator first2,\\n\\tBidirectionalIterator last2)\\n{\\n\\tif ((first1 == last1) || (first2 == last2)) {\\n\\t\\treturn false;\\n\\t}\\n\\tBidirectionalIterator m1 = last1;\\n\\tBidirectionalIterator m2 = last2; --m2;\\n\\twhile (--m1 != first1 && !(*m1 < *m2)) {\\n\\t}\\n\\tbool result = (m1 == first1) && !(*first1 < *m2);\\n\\tif (!result) {\\n\\t\\t// ①\\n\\t\\twhile (first2 != m2 && !(*m1 < *first2)) {\\n\\t\\t\\t++first2;\\n\\t\\t}\\n\\t\\tfirst1 = m1;\\n\\t\\tstd::iter_swap(first1, first2);\\n\\t\\t++first1;\\n\\t\\t++first2;\\n\\t}\\n\\tif ((first1 != last1) && (first2 != last2)) {\\n\\t\\t// ②\\n\\t\\tm1 = last1; m2 = first2;\\n\\t\\twhile ((m1 != first1) && (m2 != last2)) {\\n\\t\\t\\tstd::iter_swap(--m1, m2);\\n\\t\\t\\t++m2;\\n\\t\\t}\\n\\t\\t// ③\\n\\t\\tstd::reverse(first1, m1);\\n\\t\\tstd::reverse(first1, last1);\\n\\t\\tstd::reverse(m2, last2);\\n\\t\\tstd::reverse(first2, last2);\\n\\t}\\n\\treturn !result;\\n}\\n\\ntemplate < class BidirectionalIterator >\\nbool next_combination(BidirectionalIterator first,\\n\\tBidirectionalIterator middle,\\n\\tBidirectionalIterator last)\\n{\\n\\treturn next_combination(first, middle, middle, last);\\n}\\n\\n\\nstruct UnionFind {\\n\\tvector<int> data;\\n\\tUnionFind(int size) : data(size, -1) { }\\n\\tbool unionSet(int x, int y) {\\n\\t\\tx = root(x); y = root(y);\\n\\t\\tif (x != y) {\\n\\t\\t\\tif (data[y] < data[x]) swap(x, y);\\n\\t\\t\\tdata[x] += data[y]; data[y] = x;\\n\\t\\t}\\n\\t\\treturn x != y;\\n\\t}\\n\\tint root(int x) {\\n\\t\\treturn data[x] < 0 ? x : data[x] = root(data[x]);\\n\\t}\\n\\tint size(int x) {\\n\\t\\treturn -data[root(x)];\\n\\t}\\n};\\n\\n\\nint main() {\\n\\tcout<<setprecision(10)<<fixed;\\n\\n\\tint tt=false;\\n\\twhile (true){\\n\\t\\tint N,M;cin>>N>>M;\\n\\t\\tif(!N)break;\\n\\n\\t\\tif (tt)cout << endl;\\n\\t\\ttt = true;\\n\\t\\tmap<string,int>mp;\\n\\t\\tmap<int,string>revmp;\\n\\t\\t{\\n\\t\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\t\\tstring st;cin>>st;\\n\\t\\t\\t\\tmp[st]=i;\\n\\t\\t\\t\\trevmp[i]=st;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<int>>langs(M,vector<int>(N));\\n\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\tint k;cin>>k;\\n\\t\\t\\tfor (int j = 0; j < k; ++j) {\\n\\t\\t\\t\\tstring st;cin>>st;\\n\\t\\t\\t\\tlangs[i][mp[st]]=true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<int>perms(N);\\n\\t\\tiota(perms.begin(),perms.end(),0);\\n\\n\\t\\tvector<string>anss;\\n\\n\\t\\tfor (int t = 1; t <= (min(N, 5)); ++t) {\\n\\t\\t\\tdo {\\n\\t\\t\\t\\tUnionFind uf(M + min(N, 5));\\n\\t\\t\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\t\\t\\tfor (int j = 0; j < t; ++j) {\\n\\t\\t\\t\\t\\t\\tint lang_id = perms[j];\\n\\t\\t\\t\\t\\t\\tif (langs[i][lang_id])uf.unionSet(i, M + j);\\n\\n\\t\\t\\t\\t\\t\\tfor (int k = 1; k <t; ++k) {\\n\\t\\t\\t\\t\\t\\t\\tint lang_id2 = perms[k];\\n\\t\\t\\t\\t\\t\\t\\tif (langs[i][lang_id] && langs[i][lang_id2]) {\\n\\t\\t\\t\\t\\t\\t\\t\\tuf.unionSet(M + j, M + k);\\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\\tset<int>aset;\\n\\t\\t\\t\\tfor (int i = 0; i < M + t; ++i) {\\n\\t\\t\\t\\t\\taset.emplace(uf.root(i));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (aset.size() == 1) {\\n\\t\\t\\t\\t\\tfor (int i = 0; i < t; ++i) {\\n\\t\\t\\t\\t\\t\\tanss.emplace_back(revmp[perms[i]]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t} while (next_combination(perms.begin(), perms.begin() + t, perms.end()));\\n\\t\\t\\tif(!anss.empty())break;\\n\\t\\t}\\n\\t\\tif (anss.empty()) {\\n\\t\\t\\tcout << \\\"Impossible\\\" << endl;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcout<<anss.size()<<endl;\\n\\t\\t\\tfor(auto ans:anss)cout<<ans<<endl;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1720,\n \"memory_kb\": 3068,\n \"score_of_the_acc\": -1.1101,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2061_2610874\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\nint N,M;\\nchar name[30][21];\\n\\nint check[20];\\n\\nint boss[20],height[20];\\nint POW[31];\\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\\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 < M; i++){\\n\\t\\tboss[i] = i;\\n\\t\\theight[i] = 0;\\n\\t}\\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\\nint data_set = 0;\\n\\nvoid func(){\\n\\n\\tif(data_set != 0){\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t}\\n\\tdata_set++;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%s\\\",name[i]);\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++)check[i] = 0;\\n\\n\\tchar buf[21];\\n\\tint num;\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\t\\tscanf(\\\"%d\\\",&num);\\n\\t\\tfor(int k = 0; k < num; k++){\\n\\t\\t\\tscanf(\\\"%s\\\",buf);\\n\\t\\t\\tfor(int p = 0; p < N; p++){\\n\\t\\t\\t\\tif(strCmp(name[p],buf)){\\n\\t\\t\\t\\t\\tcheck[i] += POW[p];\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tbool FLG;\\n\\tint S;\\n\\n\\tfor(int a = 0; a < N; a++){\\n\\t\\tFLG = true;\\n\\t\\tS = POW[a];\\n\\n\\t\\tfor(int i = 0; i < M; i++){\\n\\t\\t\\tif((check[i] & S) == 0){\\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\\tprintf(\\\"1\\\\n\\\");\\n\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[a]);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n\\n\\tif(N == 1){\\n\\t\\tprintf(\\\"Impossible\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tint count;\\n\\n\\tfor(int a = 0; a < N-1; a++){\\n\\t\\tfor(int b = a+1; b < N; b++){\\n\\t\\t\\tS = POW[a]+POW[b];\\n\\t\\t\\tinit();\\n\\n\\t\\t\\tfor(int i = 0; i < M-1; i++){\\n\\t\\t\\t\\tfor(int k = i+1; k < M; k++){\\n\\t\\t\\t\\t\\tif(check[i]&check[k]&S){\\n\\t\\t\\t\\t\\t\\tunite(i,k);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tcount = 0;\\n\\t\\t\\tfor(int i = 0; i < M; i++){\\n\\t\\t\\t\\tif(get_boss(i) == i)count++;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(count == 1){\\n\\t\\t\\t\\tprintf(\\\"2\\\\n\\\");\\n\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[a]);\\n\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[b]);\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tif(N == 2){\\n\\t\\tprintf(\\\"Impossible\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\n\\tfor(int a = 0; a < N-2; a++){\\n\\t\\tfor(int b = a+1; b < N-1; b++){\\n\\t\\t\\tfor(int c = b+1; c < N; c++){\\n\\t\\t\\t\\tS = POW[a]+POW[b]+POW[c];\\n\\t\\t\\t\\tinit();\\n\\n\\t\\t\\t\\tfor(int i = 0; i < M-1; i++){\\n\\t\\t\\t\\t\\tfor(int k = i+1; k < M; k++){\\n\\t\\t\\t\\t\\t\\tif(check[i]&check[k]&S){\\n\\t\\t\\t\\t\\t\\t\\tunite(i,k);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tcount = 0;\\n\\t\\t\\t\\tfor(int i = 0; i < M; i++){\\n\\t\\t\\t\\t\\tif(get_boss(i) == i)count++;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(count == 1){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"3\\\\n\\\");\\n\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[a]);\\n\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[b]);\\n\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[c]);\\n\\t\\t\\t\\t\\treturn;\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tif(N == 3){\\n\\t\\tprintf(\\\"Impossible\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tfor(int a = 0; a < N-3; a++){\\n\\t\\tfor(int b = a+1; b < N-2; b++){\\n\\t\\t\\tfor(int c = b+1; c < N-1; c++){\\n\\t\\t\\t\\tfor(int d = c+1; d < N; d++){\\n\\t\\t\\t\\t\\tS = POW[a]+POW[b]+POW[c]+POW[d];\\n\\t\\t\\t\\t\\tinit();\\n\\n\\t\\t\\t\\t\\tfor(int i = 0; i < M-1; i++){\\n\\t\\t\\t\\t\\t\\tfor(int k = i+1; k < M; k++){\\n\\t\\t\\t\\t\\t\\t\\tif(check[i]&check[k]&S){\\n\\t\\t\\t\\t\\t\\t\\t\\tunite(i,k);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tcount = 0;\\n\\t\\t\\t\\t\\tfor(int i = 0; i < M; i++){\\n\\t\\t\\t\\t\\t\\tif(get_boss(i) == i)count++;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(count == 1){\\n\\t\\t\\t\\t\\t\\tprintf(\\\"4\\\\n\\\");\\n\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[a]);\\n\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[b]);\\n\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[c]);\\n\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[d]);\\n\\t\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tif(N == 4){\\n\\t\\tprintf(\\\"Impossible\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tfor(int a = 0; a < N-4; a++){\\n\\t\\tfor(int b = a+1; b < N-3; b++){\\n\\t\\t\\tfor(int c = b+1; c < N-2; c++){\\n\\t\\t\\t\\tfor(int d = c+1; d < N-1; d++){\\n\\t\\t\\t\\t\\tfor(int e = d+1; e < N; e++){\\n\\t\\t\\t\\t\\t\\tS = POW[a]+POW[b]+POW[c]+POW[d]+POW[e];\\n\\t\\t\\t\\t\\t\\tinit();\\n\\n\\t\\t\\t\\t\\t\\tfor(int i = 0; i < M-1; i++){\\n\\t\\t\\t\\t\\t\\t\\tfor(int k = i+1; k < M; k++){\\n\\t\\t\\t\\t\\t\\t\\t\\tif(check[i]&check[k]&S){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tunite(i,k);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tcount = 0;\\n\\t\\t\\t\\t\\t\\tfor(int i = 0; i < M; i++){\\n\\t\\t\\t\\t\\t\\t\\tif(get_boss(i) == i)count++;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif(count == 1){\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"5\\\\n\\\");\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[a]);\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[b]);\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[c]);\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[d]);\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[e]);\\n\\t\\t\\t\\t\\t\\t\\treturn;\\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\\tprintf(\\\"Impossible\\\\n\\\");\\n}\\n\\nint main(){\\n\\n\\tfor(int i = 0; i < 31; i++)POW[i] = pow(2,i);\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\t\\tif(N == 0 && M == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 550,\n \"memory_kb\": 3328,\n \"score_of_the_acc\": -1.0302,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2061_2610868\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\nint N,M;\\nchar name[30][21];\\n\\nint check[20];\\n\\nint boss[20],height[20];\\nint POW[31];\\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\\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 < M; i++){\\n\\t\\tboss[i] = i;\\n\\t\\theight[i] = 0;\\n\\t}\\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\\nint data_set = 0;\\n\\nvoid func(){\\n\\n\\tif(data_set != 0){\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t}\\n\\tdata_set++;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%s\\\",name[i]);\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++)check[i] = 0;\\n\\n\\tchar buf[21];\\n\\tint num;\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\t\\tscanf(\\\"%d\\\",&num);\\n\\t\\tfor(int k = 0; k < num; k++){\\n\\t\\t\\tscanf(\\\"%s\\\",buf);\\n\\t\\t\\tfor(int p = 0; p < N; p++){\\n\\t\\t\\t\\tif(strCmp(name[p],buf)){\\n\\t\\t\\t\\t\\tcheck[i] += POW[p];\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tbool FLG;\\n\\tint S;\\n\\n\\tfor(int a = 0; a < N; a++){\\n\\t\\tFLG = true;\\n\\t\\tS = POW[a];\\n\\n\\t\\tfor(int i = 0; i < M; i++){\\n\\t\\t\\tif((check[i] & S) == 0){\\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\\tprintf(\\\"1\\\\n\\\");\\n\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[a]);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n\\n\\tint count;\\n\\n\\tfor(int a = 0; a < N-1; a++){\\n\\t\\tfor(int b = a+1; b < N; b++){\\n\\t\\t\\tS = POW[a]+POW[b];\\n\\t\\t\\tinit();\\n\\n\\t\\t\\tfor(int i = 0; i < M-1; i++){\\n\\t\\t\\t\\tfor(int k = i+1; k < M; k++){\\n\\t\\t\\t\\t\\tif(check[i]&check[k]&S){\\n\\t\\t\\t\\t\\t\\tunite(i,k);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tcount = 0;\\n\\t\\t\\tfor(int i = 0; i < M; i++){\\n\\t\\t\\t\\tif(get_boss(i) == i)count++;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(count == 1){\\n\\t\\t\\t\\tprintf(\\\"2\\\\n\\\");\\n\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[a]);\\n\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[b]);\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\n\\tfor(int a = 0; a < N-2; a++){\\n\\t\\tfor(int b = a+1; b < N-1; b++){\\n\\t\\t\\tfor(int c = b+1; c < N; c++){\\n\\t\\t\\t\\tS = POW[a]+POW[b]+POW[c];\\n\\t\\t\\t\\tinit();\\n\\n\\t\\t\\t\\tfor(int i = 0; i < M-1; i++){\\n\\t\\t\\t\\t\\tfor(int k = i+1; k < M; k++){\\n\\t\\t\\t\\t\\t\\tif(check[i]&check[k]&S){\\n\\t\\t\\t\\t\\t\\t\\tunite(i,k);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tcount = 0;\\n\\t\\t\\t\\tfor(int i = 0; i < M; i++){\\n\\t\\t\\t\\t\\tif(get_boss(i) == i)count++;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(count == 1){\\n\\n\\t\\t\\t\\t\\tprintf(\\\"3\\\\n\\\");\\n\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[a]);\\n\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[b]);\\n\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[c]);\\n\\t\\t\\t\\t\\treturn;\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int a = 0; a < N-3; a++){\\n\\t\\tfor(int b = a+1; b < N-2; b++){\\n\\t\\t\\tfor(int c = b+1; c < N-1; c++){\\n\\t\\t\\t\\tfor(int d = c+1; d < N; d++){\\n\\t\\t\\t\\t\\tS = POW[a]+POW[b]+POW[c]+POW[d];\\n\\t\\t\\t\\t\\tinit();\\n\\n\\t\\t\\t\\t\\tfor(int i = 0; i < M-1; i++){\\n\\t\\t\\t\\t\\t\\tfor(int k = i+1; k < M; k++){\\n\\t\\t\\t\\t\\t\\t\\tif(check[i]&check[k]&S){\\n\\t\\t\\t\\t\\t\\t\\t\\tunite(i,k);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tcount = 0;\\n\\t\\t\\t\\t\\tfor(int i = 0; i < M; i++){\\n\\t\\t\\t\\t\\t\\tif(get_boss(i) == i)count++;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(count == 1){\\n\\t\\t\\t\\t\\t\\tprintf(\\\"4\\\\n\\\");\\n\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[a]);\\n\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[b]);\\n\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[c]);\\n\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[d]);\\n\\t\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int a = 0; a < N-4; a++){\\n\\t\\tfor(int b = a+1; b < N-3; b++){\\n\\t\\t\\tfor(int c = b+1; c < N-2; c++){\\n\\t\\t\\t\\tfor(int d = c+1; d < N-1; d++){\\n\\t\\t\\t\\t\\tfor(int e = d+1; e < N; e++){\\n\\t\\t\\t\\t\\t\\tS = POW[a]+POW[b]+POW[c]+POW[d]+POW[e];\\n\\t\\t\\t\\t\\t\\tinit();\\n\\n\\t\\t\\t\\t\\t\\tfor(int i = 0; i < M-1; i++){\\n\\t\\t\\t\\t\\t\\t\\tfor(int k = i+1; k < M; k++){\\n\\t\\t\\t\\t\\t\\t\\t\\tif(check[i]&check[k]&S){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tunite(i,k);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tcount = 0;\\n\\t\\t\\t\\t\\t\\tfor(int i = 0; i < M; i++){\\n\\t\\t\\t\\t\\t\\t\\tif(get_boss(i) == i)count++;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif(count == 1){\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"5\\\\n\\\");\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[a]);\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[b]);\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[c]);\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[d]);\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"%s\\\\n\\\",name[e]);\\n\\t\\t\\t\\t\\t\\t\\treturn;\\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\\tprintf(\\\"Impossible\\\\n\\\");\\n}\\n\\nint main(){\\n\\n\\tfor(int i = 0; i < 31; i++)POW[i] = pow(2,i);\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\t\\tif(N == 0 && M == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 580,\n \"memory_kb\": 3328,\n \"score_of_the_acc\": -1.0351,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2061_2310191\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define all(v) begin(v), end(v)\\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\\n#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)\\n\\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\\n\\nusing pint = pair<int, int>;\\nusing tint = tuple<int, int, int>;\\nusing vint = vector<int>;\\n\\nconst int inf = 1LL << 55;\\nconst int mod = 1e9 + 7;\\n\\nstruct UnionFind\\n{\\n vector<int> data;\\n UnionFind(){}\\n UnionFind(int sz):data(sz, -1){};\\n int size(int x) { return -data[find(x)]; }\\n int find(int x) { return data[x] < 0 ? x : data[x] = find(data[x]); }\\n bool same(int x, int y) { return find(x) == find(y); }\\n int unite(int x, int y)\\n {\\n x = find(x), y = find(y);\\n if(x != y) {\\n if(data[x] < data[y]) swap(x, y);\\n data[x] += data[y]; data[y] = x;\\n }\\n return -data[x];\\n }\\n void init(int sz) {\\n data.clear();\\n data.resize(sz, -1);\\n }\\n};\\n\\nUnionFind uf;\\n\\nint N, M;\\nvector<string> lang;\\nmap<string, int> mp;\\nmap<string, int> group;\\nvector<int> vec;\\nvector<string> ans;\\n\\nbool input() {\\n cin >> N >> M;\\n if(!N && !M) return false;\\n\\n lang.clear();\\n mp.clear();\\n rep(i, N) {\\n string l;\\n cin >> l;\\n lang.push_back(l);\\n mp[l] = i;\\n }\\n\\n vec.clear();\\n group.clear();\\n rep(i, M) {\\n int k; cin >> k;\\n int bit = 0;\\n rep(j, k) {\\n string l; cin >> l;\\n bit |= 1<<mp[l];\\n group[l] |= 1<<i;\\n }\\n vec.push_back(bit);\\n }\\n\\n return true;\\n}\\n\\nvoid solve(int idx, int bit) {\\n if(__builtin_popcount(bit) > 5) return;\\n if(uf.size(N) == __builtin_popcount(bit)+M) {\\n if(ans.empty() || __builtin_popcountll(bit) < ans.size()) {\\n ans.clear();\\n rep(i, N) if((bit>>i)&1) ans.push_back(lang[i]);\\n }\\n }\\n\\n reps(i, idx, N) {\\n if((bit>>i)&1) continue;\\n UnionFind tmp = uf;\\n rep(j, M) if((vec[j]>>i)&1) uf.unite(i, N+j);\\n solve(i+1, bit|(1<<i));\\n uf = tmp;\\n }\\n}\\n\\nsigned main()\\n{\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n cout << fixed << setprecision(12);\\n\\n bool flag = false;\\n while(input()) {\\n if(flag) cout << endl;\\n flag = true;\\n\\n ans.clear();\\n uf.init(N+M);\\n solve(0, 0);\\n if(ans.size()) {\\n cout << ans.size() << endl;\\n for(string l : ans) cout << l << endl;\\n } else {\\n cout << \\\"Impossible\\\" << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2090,\n \"memory_kb\": 3044,\n \"score_of_the_acc\": -1.1601,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2061_2309651\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint p[51],r[51];\\nvoid init(){for(int i=0;i<50;i++)p[i]=i,r[i]=0;}\\nint find(int x){return (p[x]==x)?x:(p[x]=find(p[x]));}\\nvoid unite(int x,int y) {\\n x=find(x),y=find(y);\\n if(x==y)return;\\n if(r[x]<r[y])p[x]=y;\\n else{p[y]=x;if(r[x]==r[y])r[x]++;}\\n}\\nbool same(int x,int y){return find(x)==find(y);}\\nvector<string> s,ans;\\nset<string> se[50];\\nint n,m;\\n \\nvoid dfs(int k,int t) {\\n bool f=1;\\n for(int i=1; i<m; i++) if(!same(0,i)) {f=0;break;}\\n if(f) {\\n if(!ans.size()||ans.size()>__builtin_popcount(t)) {\\n ans.clear();\\n for(int i=0; i<n; i++) if(t&(1<<i)) ans.push_back(s[i]);\\n }\\n return;\\n }\\n if(k>=n) return;\\n for(int i=k; i<n; i++) {\\n if(__builtin_popcount(t|(1<<i))>5) continue;\\n int l=0;\\n while(l<m&&!se[l].count(s[i])) l++;\\n if(l==m) continue;\\n int pp[m],rr[m];\\n for(int j=0; j<m; j++) pp[j]=p[j],rr[j]=r[j];\\n for(int j=l+1; j<m; j++) {\\n if(se[j].count(s[i])) unite(l,j);\\n }\\n dfs(i+1,t|(1<<i));\\n for(int j=0; j<m; j++) p[j]=pp[j],r[j]=rr[j];\\n }\\n}\\n \\nint main() {\\n int f=0;\\n while(cin>>n>>m&&n) {\\n if(f) cout<<endl;\\n f=1;\\n init();\\n ans.clear();\\n s.clear();\\n for(int i=0; i<n; i++) {\\n string t;cin>>t;\\n s.push_back(t);\\n }\\n for(int i=0; i<m; i++) {\\n se[i].clear();\\n int k;cin>>k;\\n for(int j=0; j<k; j++) {\\n string t;cin>>t;\\n se[i].insert(t);\\n }\\n }\\n dfs(0,0);\\n if(ans.size()) {\\n cout<<ans.size()<<endl;\\n for(int i=0; i<ans.size(); i++)cout<<ans[i]<<endl;\\n } else cout<<\\\"Impossible\\\"<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1930,\n \"memory_kb\": 3088,\n \"score_of_the_acc\": -1.1527,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2061_2309147\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint A[21];\\nint lan[30];\\nint m,n;\\n\\nvector<int>ans,used;\\n\\nvoid dfs(int dep,int member,int use){\\n if(member == (1<<n)-1) {\\n if(ans.size()==0 || ans.size()> used.size()) ans = used;\\n return ;\\n }\\n \\n if(dep >= m || dep>=5)return;\\n \\n for(int i=0;i<m;i++){\\n if(use&&(use>>i&1)==0) continue;\\n \\n int nmember = member | lan[i];\\n int nuse = use;\\n for(int j=0;j<n;j++)\\n if(lan[i]>>j&1) nuse |= A[j];\\n \\n used.push_back(i);\\n dfs(dep+1,nmember,nuse);\\n used.pop_back();\\n }\\n}\\n\\nint main(){\\n int flg = 0;\\n while(1){\\n \\n cin>>m>>n;\\n if(!m&&!n)break;\\n if(flg++) cout<<endl;\\n map<string,int> M;\\n string name[30];\\n for(int i=0;i<m;i++){\\n string str;\\n cin>>str;\\n M[str] = i;\\n name[i] = str;\\n }\\n\\n memset(lan,0,sizeof(lan));\\n memset(A,0,sizeof(A));\\n \\n for(int i=0;i<n;i++){\\n int k;\\n cin>>k;\\n for(int j=0;j<k;j++){\\n string str;\\n cin>>str;\\n A[i] |= 1<<M[str];\\n lan[M[str]] |= 1<<i;\\n }\\n }\\n\\n ans.clear();used.clear();\\n dfs(0,0,0);\\n if(ans.size()==0) cout<<\\\"Impossible\\\"<<endl;\\n else {\\n cout<<ans.size()<<endl;\\n for(int i=0;i<ans.size();i++)cout<<name[ans[i]]<<endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6180,\n \"memory_kb\": 3188,\n \"score_of_the_acc\": -1.8862,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2061_2308833\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint p[51],r[51];\\nvoid init(){for(int i=0;i<50;i++)p[i]=i,r[i]=0;}\\nint find(int x){return (p[x]==x)?x:(p[x]=find(p[x]));}\\nvoid unite(int x,int y) {\\n x=find(x),y=find(y);\\n if(x==y)return;\\n if(r[x]<r[y])p[x]=y;\\n else{p[y]=x;if(r[x]==r[y])r[x]++;}\\n}\\nbool same(int x,int y){return find(x)==find(y);}\\nvector<string> s,ans;\\nset<string> se[50];\\nint n,m;\\n\\nvoid dfs(int k,int t) {\\n bool f=1;\\n for(int i=1; i<m; i++) if(!same(0,i)) f=0;\\n if(f) {\\n if(!ans.size()||ans.size()>__builtin_popcount(t)) {\\n ans.clear();\\n for(int i=0; i<n; i++) {\\n if(t&(1<<i)) ans.push_back(s[i]);\\n }\\n }\\n return;\\n }\\n if(k>=n) return;\\n for(int i=k; i<n; i++) {\\n if(__builtin_popcount(t|(1<<i))>5) continue;\\n int l=0;\\n while(l<m&&!se[l].count(s[i])) l++;\\n if(l==m) continue;\\n int pp[m],rr[m];\\n for(int j=0; j<m; j++) pp[j]=p[j],rr[j]=r[j];\\n for(int j=l+1; j<m; j++) {\\n if(se[j].count(s[i])) unite(l,j);\\n }\\n dfs(i+1,t|(1<<i));\\n for(int j=0; j<m; j++) p[j]=pp[j],r[j]=rr[j];\\n }\\n}\\n\\nint main() {\\n int f=0;\\n while(cin >> n >> m && n) {\\n if(f) cout << endl;\\n f=1;\\n init();\\n ans.clear();\\n s.clear();\\n for(int i=0; i<n; i++) {\\n string t;\\n cin >> t;\\n s.push_back(t);\\n }\\n for(int i=0; i<m; i++) {\\n se[i].clear();\\n int k;\\n cin >> k;\\n for(int j=0; j<k; j++) {\\n string t;\\n cin >> t;\\n se[i].insert(t);\\n }\\n }\\n dfs(0,0);\\n if(ans.size()) {\\n cout << ans.size() << endl;\\n for(int i=0; i<ans.size(); i++) cout << ans[i] << endl;\\n } else cout << \\\"Impossible\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2300,\n \"memory_kb\": 3168,\n \"score_of_the_acc\": -1.2469,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2061_2041075\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nnamespace tree {\\nstruct union_find {\\n static const int Max = 22;\\n int par[Max], rank[Max], size[Max], compnum;\\n\\n union_find(int N) {\\n compnum = N;\\n for(int i=0; i<N; i++) {\\n par[i] = i;\\n rank[i] = 0;\\n size[i] = 1;\\n }\\n }\\n\\n int root(int x) {\\n return par[x] == x ? x : par[x] = root(par[x]);\\n }\\n\\n void unite(int x, int y) {\\n x = root(x), y = root(y);\\n if(x == y) return;\\n if(rank[x] < rank[y]) {\\n par[x] = y, size[y] += size[x];\\n } else {\\n par[y] = x, size[x] += size[y];\\n if(rank[x] == rank[y]) rank[x]++;\\n }\\n compnum--;\\n }\\n\\n int operator[](int x) { return root(x); }\\n void operator()(int x, int y) { return unite(x, y); }\\n\\n bool same(int x, int y) { return root(x) == root(y); }\\n int size_of(int x) { return size[root(x)]; }\\n int num_of_comps() { return compnum; }\\n};\\n}\\n\\nint N, M;\\nunordered_map<string, int> idmap;\\nvector<string> langs;\\nbool speaks[23][33];\\n\\nvoid input() {\\n langs.clear(); langs.resize(N);\\n rep(i, N) {\\n cin >> langs[i];\\n idmap[langs[i]] = i;\\n }\\n memset(speaks, 0, sizeof speaks);\\n rep(i, M) {\\n int k; cin >> k;\\n rep(_, k) {\\n string s; cin >> s;\\n speaks[i][idmap[s]] = 1;\\n }\\n }\\n}\\n\\nbool next_combination(int& comb, int const BitSize) {\\n int x = comb & -comb, y = comb + x;\\n comb = ((comb & ~y) / x >> 1) | y;\\n return comb < 1 << BitSize;\\n}\\n\\nvoid solve() {\\n\\n REP(K, 1, min(N + 1, 6)) {\\n int comb = (1 << K) - 1;\\n do {\\n vector<int> uselangs;\\n rep(i, N) {\\n if(!(comb & 1 << i)) continue;\\n uselangs.push_back(i);\\n }\\n\\n tree::union_find uf(M);\\n\\n rep(i, M) REP(j, i + 1, M)\\n for(auto langid: uselangs)\\n if(speaks[i][langid] && speaks[j][langid])\\n uf(i, j);\\n\\n if(uf.num_of_comps() == 1) {\\n printf(\\\"%d\\\\n\\\", (int)uselangs.size());\\n for(auto e: uselangs) printf(\\\"%s\\\\n\\\", langs[e].c_str());\\n return;\\n }\\n } while(next_combination(comb, N));\\n }\\n puts(\\\"Impossible\\\");\\n}\\n\\nint main() {\\n bool first = 0;\\n for(; cin >> N >> M && (N|M);) {\\n if(first) cout << endl;\\n first = 1;\\n input();\\n solve();\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2100,\n \"memory_kb\": 3364,\n \"score_of_the_acc\": -1.2975,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2061_2041049\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nnamespace tree {\\nstruct union_find {\\n static const int Max = 22;\\n int par[Max], rank[Max], size[Max], compnum;\\n\\n union_find(int N) {\\n compnum = N;\\n for(int i=0; i<N; i++) {\\n par[i] = i;\\n rank[i] = 0;\\n size[i] = 1;\\n }\\n }\\n\\n int root(int x) {\\n return par[x] == x ? x : par[x] = root(par[x]);\\n }\\n\\n void unite(int x, int y) {\\n x = root(x), y = root(y);\\n if(x == y) return;\\n if(rank[x] < rank[y]) {\\n par[x] = y, size[y] += size[x];\\n } else {\\n par[y] = x, size[x] += size[y];\\n if(rank[x] == rank[y]) rank[x]++;\\n }\\n compnum--;\\n }\\n\\n int operator[](int x) { return root(x); }\\n void operator()(int x, int y) { return unite(x, y); }\\n\\n bool same(int x, int y) { return root(x) == root(y); }\\n int size_of(int x) { return size[root(x)]; }\\n int num_of_comps() { return compnum; }\\n};\\n}\\n\\nint N, M;\\nunordered_map<string, int> idmap;\\nvector<string> langs;\\nbool speaks[23][33];\\n\\nvoid input() {\\n langs.clear(); langs.resize(N);\\n rep(i, N) {\\n cin >> langs[i];\\n idmap[langs[i]] = i;\\n }\\n memset(speaks, 0, sizeof speaks);\\n rep(i, M) {\\n int k; cin >> k;\\n rep(_, k) {\\n string s; cin >> s;\\n speaks[i][idmap[s]] = 1;\\n }\\n }\\n}\\n\\nbool next_combination(int& comb, int const BitSize) {\\n // Assume: comb := (1 << K) - 1, K <= BitSize\\n int x = comb & -comb, y = comb + x;\\n comb = ((comb & ~y) / x >> 1) | y;\\n return comb < 1 << BitSize;\\n}\\n\\nvoid solve() {\\n\\n REP(K, 1, min(N + 1, 6)) {\\n int comb = (1 << K) - 1;\\n do {\\n vector<int> uselangs;\\n rep(i, N) {\\n if(!(comb & 1 << i)) continue;\\n uselangs.push_back(i);\\n }\\n\\n tree::union_find uf(M);\\n\\n rep(i, M) REP(j, i + 1, M)\\n for(auto langid: uselangs)\\n if(speaks[i][langid] && speaks[j][langid])\\n uf(i, j);\\n\\n if(uf.num_of_comps() == 1) {\\n printf(\\\"%d\\\\n\\\", (int)uselangs.size());\\n for(auto e: uselangs) printf(\\\"%s\\\\n\\\", langs[e].c_str());\\n return;\\n }\\n } while(next_combination(comb, N));\\n }\\n puts(\\\"Impossible\\\");\\n}\\n\\nstring to_binary(int x, int const LeastDigit = 0) {\\n string ret;\\n while(x) ret.push_back(x % 2 + '0'), x /= 2;\\n for(int i=ret.size(); i<LeastDigit; i++) ret.push_back('0');\\n reverse(ret.begin(), ret.end());\\n return ret;\\n}\\n\\nint main() {\\n bool first = 0;\\n for(; cin >> N >> M && (N|M);) {\\n if(first) cout << endl;\\n first = 1;\\n input();\\n solve();\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2050,\n \"memory_kb\": 3376,\n \"score_of_the_acc\": -1.2945,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2061_1882442\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define MAX_N 30\\n#define MAX_M 20\\n#define INF (1<<29)\\n \\nint N,M,mini,ansS;\\nbool edge[MAX_M][MAX_N];\\n \\nclass Union_Find{\\npublic:\\n int par[MAX_M],rank[MAX_M],size[MAX_M];\\n Union_Find(int N){\\n\\tfor(int i = 0 ; i < N ; i++){\\n\\t par[i] = i;\\n\\t rank[i] = 0;\\n\\t size[i] = 1;\\n\\t}\\n }\\n \\n int find(int x){\\n\\tif(par[x] == x){\\n\\t return x;\\n\\t}\\n\\treturn par[x] = find(par[x]);\\n }\\n \\n void unite(int x,int y){\\n\\tx = find(x);\\n\\ty = find(y);\\n\\tif(x == y) return;\\n\\tif(rank[x] < rank[y]){\\n\\t par[x] = y;\\n\\t size[y] += size[x];\\n\\t}else{\\n\\t par[y] = x;\\n\\t size[x] += size[y];\\n\\t if(rank[x] == rank[y]){\\n\\t\\trank[x]++;\\n\\t }\\n\\t}\\n }\\n \\n bool same(int x,int y){\\n\\treturn find(x) == find(y);\\n }\\n \\n int getSize(int x){\\n\\treturn size[find(x)];\\n }\\n};\\n \\nbool check(int S){\\n int idx = 0,arr[MAX_M];\\n if(S == 0) return false;\\n for(int i = 0 ; i < N ; i++){\\n\\tif(S >> i & 1){\\n\\t arr[idx++] = i;\\n\\t}\\n }\\n Union_Find uf(M);\\n for(int i = 0 ; i < M ; i++){\\n\\tfor(int j = i+1 ; j < M ; j++){\\n\\t if(uf.same(i,j)) continue;\\n\\t for(int k = 0 ; k < idx ; k++){\\n\\t\\tif(edge[i][arr[k]] && edge[j][arr[k]]){\\n\\t\\t uf.unite(i,j);\\n\\t\\t}\\n\\t }\\n\\t}\\n }\\n return (uf.getSize(0) == M);\\n}\\n \\nvoid rec(int idx,int S,int num){\\n if(num < mini && check(S)){\\n\\tmini = num; ansS = S;\\n\\treturn;\\n }\\n if(num == 5 || num >= mini) return;\\n for(int i = idx ; i < N ; i++){\\n\\tif(S >> i & 1) continue;\\n\\trec(i+1,S|(1<<i),num+1);\\n }\\n}\\n \\nint main(){\\n int K;\\n bool blank = false;\\n string lang[MAX_N],in;\\n while(cin >> N >> M, N){\\n\\tmap<string,int> mp;\\n\\tmemset(edge,false,sizeof(edge));\\n\\tif(blank){ cout << endl; }\\n\\tblank = true;\\n\\tfor(int i = 0 ; i < N ; i++){\\n\\t cin >> lang[i];\\n\\t mp[lang[i]] = i;\\n\\t}\\n\\tfor(int i = 0 ; i < M ; i++){\\n\\t cin >> K;\\n\\t for(int j = 0 ; j < K ; j++){\\n\\t\\tcin >> in;\\n\\t\\tedge[i][mp[in]] = true;\\n\\t }\\n\\t}\\n\\tmini = INF;\\n\\trec(0,0,0);\\n\\tif(mini == INF){\\n\\t cout << \\\"Impossible\\\" << endl;\\n\\t}else{\\n\\t cout << __builtin_popcount(ansS) << endl;\\n\\t for(int i = 0 ; i < N ; i++){\\n\\t\\tif(ansS >> i & 1){\\n\\t\\t cout << lang[i] << endl;\\n\\t\\t}\\n\\t }\\n\\t}\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2350,\n \"memory_kb\": 3148,\n \"score_of_the_acc\": -1.2465,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2061_1594337\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <complex>\\n#include <assert.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair <int,int> P;\\n\\nstatic const double EPS = 1e-12;\\n\\nstatic const int tx[] = {+0,+1,+0,-1};\\nstatic const int ty[] = {-1,+0,+1,+0};\\n\\nclass UnionFindTree {\\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[] _par;\\n delete[] _rank;\\n }\\n\\n int find(int u){\\n if(_par[u] == u) return u;\\n return find(_par[u]);\\n }\\n\\n bool unite(int u,int v){\\n u = find(u);\\n v = find(v);\\n if(u == v) return false;\\n \\n if(_rank[u] < _rank[v]){\\n _par[u] = v;\\n }\\n else{\\n _par[v] = u;\\n if(_rank[u] == _rank[v]) _rank[u]++;\\n }\\n return true;\\n }\\n};\\n\\nint main(){\\n int num_of_languages;\\n int num_of_students;\\n bool is_first = true;\\n while(~scanf(\\\"%d %d\\\",&num_of_languages,&num_of_students)){\\n if(num_of_languages == 0 && num_of_students == 0){\\n break;\\n }\\n if(!is_first){\\n printf(\\\"\\\\n\\\");\\n }\\n map<string,int> lang2idx;\\n map<int,string> idx2lang;\\n for(int lang_i = 0; lang_i < num_of_languages; lang_i++){\\n string lang;\\n cin >> lang;\\n lang2idx[lang] = lang_i;\\n idx2lang[lang_i] = lang;\\n }\\n\\n int students[21] = {};\\n for(int student_i = 0; student_i < num_of_students; student_i++){\\n int num_of_skills;\\n scanf(\\\"%d\\\",&num_of_skills);\\n for(int skill_i = 0; skill_i < num_of_skills; skill_i++){\\n string skill;\\n cin >> skill;\\n students[student_i] |= (1 << lang2idx[skill]);\\n }\\n }\\n\\n int res = 0;\\n\\n\\n for(int used = 1; used <= 5; used++){\\n vector<int> languages;\\n for(int i = 0; i < min(used,num_of_languages); i++){\\n languages.push_back(1);\\n }\\n for(int i = 0; i < num_of_languages - used; i++){\\n languages.push_back(0);\\n }\\n \\n sort(languages.begin(),languages.end());\\n do {\\n int S = 0;\\n for(int i = 0; i < languages.size(); i++){\\n if(languages[i] == 1){\\n S |= (1<<i);\\n }\\n }\\n UnionFindTree uft(30);\\n for(int student_i = 0; student_i < num_of_students; student_i++){\\n for(int student_j = student_i + 1; student_j < num_of_students; student_j++){\\n if(students[student_i] & students[student_j] & S){\\n uft.unite(student_i,student_j);\\n }\\n }\\n }\\n \\n set<int> parents;\\n for(int student_i = 0; student_i < num_of_students; student_i++){\\n parents.insert(uft.find(student_i));\\n }\\n if(parents.size() == 1){\\n res = S;\\n goto found;\\n }\\n } while(next_permutation(languages.begin(),languages.end()));\\n }\\n found:;\\n\\n if(res != 0){\\n cout << __builtin_popcount(res) << endl;\\n for(int lang_i = 0; lang_i < num_of_languages; lang_i++){\\n if(res & (1<<lang_i)){\\n cout << idx2lang[lang_i] << endl;\\n }\\n }\\n }\\n else{\\n cout << \\\"Impossible\\\" << endl;\\n }\\n is_first = false;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1340,\n \"memory_kb\": 1292,\n \"score_of_the_acc\": -0.2945,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2061_1326048\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define MAX_N 30\\n#define MAX_M 20\\n#define INF (1<<29)\\n\\nint N,M,mini,ansS;\\nbool edge[MAX_M][MAX_N];\\n\\nclass Union_Find{\\npublic:\\n int par[MAX_M],rank[MAX_M],size[MAX_M];\\n Union_Find(int N){\\n for(int i = 0 ; i < N ; i++){\\n par[i] = i;\\n rank[i] = 0;\\n size[i] = 1;\\n }\\n }\\n\\n int find(int x){\\n if(par[x] == x){\\n return x;\\n }\\n return par[x] = find(par[x]);\\n }\\n\\n void unite(int x,int y){\\n x = find(x);\\n y = find(y);\\n if(x == y){ return; }\\n if(rank[x] < rank[y]){\\n par[x] = y;\\n size[y] += size[x];\\n }else{\\n par[y] = x;\\n size[x] += size[y];\\n if(rank[x] == rank[y]){\\n rank[x]++;\\n }\\n }\\n }\\n\\n bool same(int x,int y){\\n return find(x) == find(y);\\n }\\n\\n int getSize(int x){\\n return size[find(x)];\\n }\\n};\\n\\nbool check(int S){\\n int idx = 0,arr[MAX_M];\\n if(S == 0){ return false; }\\n for(int i = 0 ; i < N ; i++){\\n if(S >> i & 1){\\n arr[idx++] = i;\\n }\\n }\\n Union_Find uf(M);\\n for(int i = 0 ; i < M ; i++){\\n for(int j = i+1 ; j < M ; j++){\\n if(uf.same(i,j)){ continue; }\\n for(int k = 0 ; k < idx ; k++){\\n if(edge[i][arr[k]] && edge[j][arr[k]]){\\n uf.unite(i,j);\\n }\\n }\\n }\\n }\\n return (uf.getSize(0) == M);\\n}\\n\\nvoid rec(int idx,int S,int num){\\n if(num < mini && check(S)){\\n mini = num; ansS = S;\\n return;\\n }\\n if(num == 5 || num >= mini){ return; }\\n for(int i = idx ; i < N ; i++){\\n if(S >> i & 1){ continue; }\\n rec(i+1,S|(1<<i),num+1);\\n }\\n}\\n\\nint main(){\\n int K;\\n bool blank = false;\\n string lang[MAX_N],in;\\n while(cin >> N >> M, N){\\n map<string,int> mp;\\n memset(edge,false,sizeof(edge));\\n if(blank){ cout << endl; }\\n blank = true;\\n for(int i = 0 ; i < N ; i++){\\n cin >> lang[i];\\n mp[lang[i]] = i;\\n }\\n for(int i = 0 ; i < M ; i++){\\n cin >> K;\\n for(int j = 0 ; j < K ; j++){\\n cin >> in;\\n edge[i][mp[in]] = true;\\n }\\n }\\n mini = INF;\\n rec(0,0,0);\\n if(mini == INF){\\n cout << \\\"Impossible\\\" << endl;\\n }else{\\n cout << __builtin_popcount(ansS) << endl;\\n for(int i = 0 ; i < N ; i++){\\n if(ansS >> i & 1){\\n cout << lang[i] << endl;\\n }\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3090,\n \"memory_kb\": 1224,\n \"score_of_the_acc\": -0.5502,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2061_1150021\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<string>\\n#include<map>\\nusing namespace std;\\nchar in[1100];\\nint c[40][40];\\nstring t[40];\\nint v[40];\\nint n;\\nint sz;\\nint ret;\\nint ans[40];\\nint UF[40];\\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}\\nvoid solve(int a,int b){\\n\\tif(ret==a)return ;\\n\\tbool ok=true;\\n\\tfor(int i=0;i<sz;i++)UF[i]=-1;\\n\\tfor(int i=0;i<sz;i++){\\n\\t\\tfor(int j=i+1;j<sz;j++){\\n\\t\\t\\tbool OK=false;\\n\\t\\t\\tfor(int k=0;k<a;k++)if(c[i][v[k]]&&c[j][v[k]])OK=true;\\n\\t\\t\\tif(OK)UNION(i,j);\\n\\t\\t}\\n\\t}\\n\\tif(UF[FIND(0)]==-sz){\\n\\t\\tret=a;\\n\\t\\tfor(int i=0;i<a;i++)ans[i]=v[i];\\n\\t\\treturn;\\n\\t}\\n\\tfor(int i=b;i<n;i++){\\n\\t\\tv[a]=i;\\n\\t\\tsolve(a+1,i+1);\\n\\t}\\n}\\nint main(){\\n\\tint a,b;\\n\\tbool se=false;\\n\\twhile(scanf(\\\"%d%d\\\",&a,&b),a){\\n\\t\\tif(se)printf(\\\"\\\\n\\\");\\n\\t\\tse=true;\\n\\t\\tmap<string,int>m;\\n\\t\\tn=a;\\n\\t\\tsz=b;\\n\\t\\tret=6;\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tscanf(\\\"%s\\\",in);\\n\\t\\t\\tstring tmp=in;\\n\\t\\t\\tt[i]=tmp;\\n\\t\\t\\tm[tmp]=i;\\n\\t\\t}\\n\\t\\tfor(int i=0;i<40;i++)for(int j=0;j<40;j++)c[i][j]=0;\\n\\t\\tfor(int i=0;i<b;i++){\\n\\t\\t\\tint d;scanf(\\\"%d\\\",&d);\\n\\t\\t\\tfor(int j=0;j<d;j++){\\n\\t\\t\\t\\tscanf(\\\"%s\\\",in);\\n\\t\\t\\t\\tstring tmp=in;\\n\\t\\t\\t\\tc[i][m[tmp]]=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int i=0;i<a;i++)v[i]=0;\\n\\t\\tsolve(0,0);\\n\\t\\tif(ret==6){\\n\\t\\t\\tprintf(\\\"Impossible\\\\n\\\");\\n\\t\\t}else{\\n\\t\\t\\tprintf(\\\"%d\\\\n\\\",ret);\\n\\t\\t\\tfor(int i=0;i<ret;i++)printf(\\\"%s\\\\n\\\",t[ans[i]].c_str());\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2220,\n \"memory_kb\": 1100,\n \"score_of_the_acc\": -0.3561,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2061_1123839\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <set>\\n#include <algorithm>\\n#include <map>\\n#include <complex>\\n#include <cstdio>\\nusing namespace std;\\n\\nstruct UnionFind {\\n vector<int> data;\\n UnionFind(int size) : data(size, -1) { }\\n bool unionSet(int x, int y) {\\n x = root(x); y = root(y);\\n if (x != y) {\\n if (data[y] < data[x]) swap(x, y);\\n data[x] += data[y]; data[y] = x;\\n }\\n return x != y;\\n }\\n bool findSet(int x, int y) {\\n return root(x) == root(y);\\n }\\n int root(int x) {\\n return data[x] < 0 ? x : data[x] = root(data[x]);\\n }\\n int size(int x) {\\n return -data[root(x)];\\n }\\n};\\n\\n\\nint N,M;\\nvector<string> cand;\\nmap<string, vector<int> > dic;\\nmap<string,int> id;\\n\\nint check(vector<string> lan){\\n\\tUnionFind uf(N+M);\\n\\tfor( auto item : lan ){\\n\\t\\tint u = id[item];\\n\\t\\t\\n\\t\\tfor( auto v : dic[item] )\\n\\t\\t\\tuf.unionSet(u+M,v);\\n\\t}\\n\\n\\tfor(int i = 0 ; i < M ; i++)\\n\\t\\tif( !uf.findSet(0,i) ) return false;\\n\\treturn true;\\n}\\nint good = 6;\\nvector<string> answer;\\nvector<string> now;\\nint cur;\\nint dfs(int x){\\n\\tif( good <= cur ) return 0;\\n\\tif( check(now) ){\\n\\t\\tanswer = now;\\n\\t\\tgood = cur;\\n\\t\\treturn 0;\\n\\t}\\n\\tif( N <= x ) return 0;\\n\\tdfs(x+1);\\n\\t\\n\\tcur++;\\n\\tnow.push_back(cand[x]);\\n\\tdfs(x+1);\\n\\tnow.pop_back();\\n\\tcur--;\\n\\t\\n}\\nint main(){\\n\\tint fst = 0;\\n\\twhile(cin >> N >> M && N){\\n\\t\\tif(fst++)cout << endl;\\n\\t\\tcand.clear();\\n\\t\\tdic.clear();\\n\\t\\tfor(int i = 0 ; i < N ; i++){\\n\\t\\t\\tstring t;\\n\\t\\t\\tcin >> t;\\n\\t\\t\\tcand.push_back(t);\\n\\t\\t}\\n\\t\\tfor(int k = 0 ; k < M ; k++){\\n\\t\\t\\tint t;\\n\\t\\t\\tcin >> t;\\n\\t\\t\\tfor(int j = 0 ; j < t ; j++){\\n\\t\\t\\t\\tstring s;\\n\\t\\t\\t\\tcin >> s;\\n\\t\\t\\t\\tdic[s].push_back(k);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint k = 0;\\n\\t\\tfor( auto x : dic){\\n\\t\\t\\tid[x.first] = k++;\\n\\t\\t}\\n\\t\\tgood = 6;\\n\\t\\tcur = 0;\\n\\t\\tdfs(0);\\n\\t\\tif( good >= 6 ){\\n\\t\\t\\tcout << \\\"Impossible\\\" << endl;\\n\\t\\t}else{\\n\\t\\t\\tcout << good << endl;\\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}\",\n \"accuracy\": 1,\n \"time_ms\": 5670,\n \"memory_kb\": 1364,\n \"score_of_the_acc\": -1.0291,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2061_851813\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cmath>\\n#include<cassert>\\n#include<climits>\\n#include<set>\\n#include<vector>\\n#include<algorithm>\\n#include<map>\\n#include<bitset>\\n#include<deque>\\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 35\\n \\nusing namespace std;\\n \\nint N,M,dex,limit;\\ndeque<int> ans;\\nvector<string> LG;\\nmap<string,int> Index;\\nvector<int> G[MAX];\\nvector<int> bitG;\\nset<int> input[MAX];\\nstring country;\\nbool used[MAX];\\n \\nvoid cdfs(int cur,deque<int>& selected){\\n if(used[cur])return;\\n used[cur] = true;\\n //cout << \\\"cur = \\\" << cur << endl;\\n for(int i=0;i<G[cur].size();i++){\\n int next = G[cur][i];\\n \\n if(used[next])continue;\\n \\n bool ok = false;\\n for(int j=0;j<selected.size();j++){\\n int one = selected[j];\\n if( ( (bitG[one]>>cur) & 1 ) && ( (bitG[one]>>next) & 1 ) ){\\n ok = true;\\n break;\\n }\\n }\\n\\n if(ok){\\n //cout << \\\"from \\\" << cur << \\\" to \\\" << next << endl;\\n cdfs(next,selected);\\n }\\n }\\n}\\n \\n \\nbool check(deque<int>& selected){\\n for(int i=0;i<M;i++)used[i] = false;\\n \\n int OK = bitG[selected[0]];\\n while(OK){\\n int use = OK & -OK;\\n int cur = log2(use);\\n OK -= use;\\n cdfs(cur,selected);\\n }\\n \\n for(int i=0;i<M;i++)if(!used[i])return false;\\n return true;\\n}\\n \\nvoid dfs(int cur,int language,int student,deque<int>& selected){\\n \\n if(language >= limit || language >= 6){\\n return;\\n }\\n \\n if(student == (1<<M)-1){\\n if(!check(selected))return;\\n if(limit > language){\\n limit = language;\\n ans = selected;\\n }\\n return;\\n }\\n \\n for(int i=cur;i<N;i++){\\n selected.push_back(i);\\n dfs(i+1,language+1,student|bitG[i],selected);\\n selected.pop_back();\\n }\\n \\n}\\n \\n \\nint main(){\\n \\n bool first = true;\\n while(cin >> N >> M,N|M){\\n \\n if(!first)puts(\\\"\\\");\\n first = false;\\n \\n //init\\n LG.clear();\\n dex = 0;\\n Index.clear();\\n bitG.clear();\\n ans.clear();\\n for(int i=0;i<max(N,M);i++){\\n G[i].clear();\\n input[i].clear();\\n }\\n \\n bitG.resize(N,0);\\n \\n for(int i=0;i<N;i++){\\n cin >> country;\\n LG.push_back(country);\\n Index[country] = dex++;\\n }\\n \\n int k;\\n for(int i=0;i<M;i++){\\n cin >> k;\\n for(int j=0;j<k;j++){\\n cin >> country;\\n int index = Index[country];\\n input[i].insert(index);\\n bitG[index] |= (1<<i);\\n }\\n }\\n \\n //make graph\\n for(int i=0;i<M;i++){\\n for(int j=i+1;j<M;j++){\\n for(set<int>::iterator it = input[i].begin(); it != input[i].end(); it++){\\n int value = *it;\\n if(input[j].find(value) != input[j].end()){\\n G[i].push_back(j);\\n G[j].push_back(i);\\n }\\n }\\n }\\n }\\n \\n limit = IINF;\\n deque<int> deq;\\n dfs(0,0,0,deq);\\n \\n if(limit == IINF){\\n cout << \\\"Impossible\\\" << endl;\\n } else {\\n cout << limit << endl;\\n for(int i=0;i<limit;i++){\\n cout << LG[ans[i]] << endl;\\n }\\n }\\n \\n \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1320,\n \"score_of_the_acc\": -0.0934,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2061_851694\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cmath>\\n#include<cassert>\\n#include<climits>\\n#include<set>\\n#include<vector>\\n#include<algorithm>\\n#include<map>\\n#include<bitset>\\n#include<deque>\\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 35\\n\\nusing namespace std;\\n\\nint N,M,dex,limit;\\ndeque<int> ans;\\nvector<string> LG;\\nmap<string,int> Index;\\nvector<int> G[MAX];\\nvector<int> bitG;\\nset<int> input[MAX];\\nstring country;\\nbool used[MAX];\\n\\nvoid cdfs(int cur,deque<int>& selected){\\n if(used[cur])return;\\n used[cur] = true;\\n //cout << \\\"cur = \\\" << cur << endl;\\n for(int i=0;i<G[cur].size();i++){\\n int next = G[cur][i];\\n\\n if(used[next])continue;\\n\\n bool ok = false;\\n for(int j=0;j<selected.size();j++){\\n int one = selected[j];\\n if( ( (bitG[one]>>cur) & 1 ) && ( (bitG[one]>>next) & 1 ) ){\\n\\tok = true;\\n\\tbreak;\\n }\\n }\\n /*\\n for(int j=0;j<selected.size();j++){\\n int one = selected[j];\\n for(int k=j;k<selected.size();k++){\\n\\tint two = selected[k];\\n\\tif( ( ((bitG[one]>>cur)&1) & ((bitG[two]>>next)&1) ) || ( ((bitG[two]>>cur)&1) & ((bitG[one]>>next)&1) ) ){\\n\\t cout << \\\"from \\\" << cur << \\\" to \\\" << next << \\\" is ok because they have \\\" << LG[one] << \\\" and \\\" << LG[two] << endl;\\n\\t ok = true;\\n\\t goto Skip;\\n\\t}\\n }\\n }\\n Skip:;\\n */\\n if(ok){\\n //cout << \\\"from \\\" << cur << \\\" to \\\" << next << endl;\\n cdfs(next,selected);\\n }\\n }\\n}\\n\\n\\nbool check(deque<int>& selected){\\n for(int i=0;i<M;i++)used[i] = false;\\n\\n int OK = bitG[selected[0]];\\n while(OK){\\n int use = OK & -OK;\\n int cur = log2(use);\\n OK -= use;\\n cdfs(cur,selected);\\n }\\n\\n for(int i=0;i<M;i++)if(!used[i])return false;\\n return true;\\n}\\n\\nvoid dfs(int cur,int language,int student,deque<int>& selected){\\n\\n if(language >= limit || language >= 6){\\n return;\\n }\\n\\n if(student == (1<<M)-1){\\n if(!check(selected))return;\\n if(limit > language){\\n limit = language;\\n ans = selected;\\n }\\n return;\\n }\\n\\n for(int i=cur;i<N;i++){\\n selected.push_back(i);\\n dfs(i+1,language+1,student|bitG[i],selected);\\n selected.pop_back();\\n }\\n\\n}\\n\\n\\nint main(){\\n\\n bool first = true;\\n while(cin >> N >> M,N|M){\\n\\n if(!first)puts(\\\"\\\");\\n first = false;\\n\\n //init\\n LG.clear();\\n dex = 0;\\n Index.clear();\\n bitG.clear();\\n ans.clear();\\n for(int i=0;i<max(N,M);i++){\\n G[i].clear();\\n input[i].clear();\\n }\\n \\n bitG.resize(N,0);\\n\\n for(int i=0;i<N;i++){\\n cin >> country;\\n LG.push_back(country);\\n Index[country] = dex++;\\n }\\n\\n int k;\\n for(int i=0;i<M;i++){\\n cin >> k;\\n for(int j=0;j<k;j++){\\n\\tcin >> country;\\n\\tint index = Index[country];\\n\\tinput[i].insert(index);\\n\\tbitG[index] |= (1<<i);\\n }\\n }\\n\\n //make graph\\n for(int i=0;i<M;i++){\\n for(int j=i+1;j<M;j++){\\n\\tfor(set<int>::iterator it = input[i].begin(); it != input[i].end(); it++){\\n\\t int value = *it;\\n\\t if(input[j].find(value) != input[j].end()){\\n\\t G[i].push_back(j);\\n\\t G[j].push_back(i);\\n\\t }\\n\\t}\\n }\\n }\\n /* \\n rep(i,N){\\n bitset<10> state = bitG[Index[LG[i]]];\\n cout << LG[i] << \\\" = \\\" << Index[LG[i]] << \\\" \\\" << state << endl;\\n }\\n\\n deque<int> deq;\\n deq.push_back(0);\\n deq.push_back(1);\\n deq.push_back(3);\\n deq.push_back(5);\\n cout << check(deq) << endl;\\n */\\n limit = IINF;\\n deque<int> deq;\\n dfs(0,0,0,deq);\\n\\n if(limit == IINF){\\n cout << \\\"Impossible\\\" << endl;\\n } else {\\n cout << limit << endl;\\n for(int i=0;i<limit;i++){\\n\\tcout << LG[ans[i]] << endl;\\n }\\n }\\n\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1320,\n \"score_of_the_acc\": -0.0934,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2061_771806\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <cstdio>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cassert>\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\n\\nusing namespace std;\\ntypedef long long ll;\\n\\nconst int INF = 1000000000;\\nconst int MOD = 1000000007;\\nconst double EPS = 1e-8;\\n\\nint nextcomb(int S){\\n int x = S & -S;\\n int y = S + x;\\n S = ((S & ~y) / x >> 1) | y;\\n return S;\\n}\\n\\nint main(){\\n for(int N, M, first = 1; cin >> N >> M && N; first = 0){\\n if(!first) cout << endl;\\n\\n vector<string> lang(N);\\n map<string, int> lang_dic;\\n REP(i, N){\\n string s; cin >> s;\\n lang[i] = s;\\n lang_dic[s] = i;\\n }\\n\\n bool have[30][30] = {};\\n for(int i = 0; i < M; i++){\\n int K; cin >> K;\\n while(K--){\\n string s;\\n cin >> s;\\n have[i][ lang_dic[s] ] = true;\\n }\\n }\\n\\n vector<int> ans;\\n\\n bool b[30][30] = {};\\n REP(i, N) REP(j, N) REP(k, M)\\n b[i][j] |= have[k][i] & have[k][j];\\n\\n for(int K = 1; K < 6; K++){\\n if(ans.size() > 0) break;\\n int S = (1 << K) - 1;\\n while(S < 1 << N){\\n vector<int> v;\\n for(int i = 0; i < N; i++) if(S >> i & 1) v.push_back(i);\\n S = nextcomb(S);\\n bool ok = true;\\n\\n REP(i, M) if(none_of(v.begin(), v.end(), [&](int vi){ return have[i][vi]; })) ok = false;\\n\\n if(not ok) continue;\\n\\n bool bb[30][30] = {};\\n for(auto vi : v) for(auto vj : v) bb[vi][vj] = b[vi][vj];\\n for(auto vk : v) for(auto vi : v) for(auto vj : v) bb[vi][vj] |= bb[vi][vk] & bb[vk][vj];\\n\\n REP(i, M) REP(j, i){\\n bool talk = false;\\n for(auto vi : v) for(auto vj : v) if(bb[vi][vj] && have[i][vi] && have[j][vj]){\\n goto NEXT;\\n }\\n ok = false;\\n goto NEXT2;\\n\\n NEXT:;\\n }\\n\\n if(ok) ans = v;\\n NEXT2:;\\n\\n }\\n }\\n if(ans.empty()){\\n cout << \\\"Impossible\\\" << endl;\\n continue;\\n }\\n cout << ans.size() << endl;\\n for(auto ai : ans){\\n cout << lang[ai] << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 590,\n \"memory_kb\": 1240,\n \"score_of_the_acc\": -0.1505,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2061_677236\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <map>\\n#include <vector>\\nusing namespace std;\\n\\nconst int MAXN = 50;\\nconst int MAXM = 40;\\n\\nclass UnionFind {\\nprivate:\\n int n;\\n int *par, *rank;\\npublic:\\n UnionFind(int _n) {\\n n = _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 ~UnionFind() {\\n delete [] par;\\n delete [] rank;\\n }\\n\\n int find(int x) {\\n if(par[x] == x) return x;\\n return par[x] = find(par[x]);\\n }\\n\\n bool same(int x, int y) {\\n return find(x) == find(y);\\n }\\n\\n void unite(int x, int y) {\\n x = find(x);\\n y = find(y);\\n if(x == y) return;\\n if(rank[x] < rank[y]) {\\n par[x] = y;\\n } else {\\n par[y] = x;\\n if(rank[x] == rank[y]) {\\n ++rank[x];\\n }\\n }\\n }\\n};\\n\\nstruct Edge {\\n int a, b;\\n};\\n\\nint N, M;\\nmap<string, int> L;\\nvector<string> rL;\\nvector<int> S;\\nvector<int> V[6];\\nvector<Edge> E[MAXN];\\n\\nvoid rec(int k, int i, int bit) {\\n V[k].push_back(bit);\\n if(k == 5) return;\\n for(; i < N; ++i) {\\n if(bit & (1<<i)) continue;\\n rec(k+1, i+1, bit|(1<<i));\\n }\\n}\\n\\nbool test(int bit) {\\n UnionFind uf(M);\\n int cnt = 0;\\n for(int i = 0; i < N; ++i) {\\n if(bit & (1<<i)) {\\n for(int j = 0; j < E[i].size(); ++j) {\\n const Edge &e = E[i][j];\\n if(!uf.same(e.a, e.b)) {\\n uf.unite(e.a, e.b);\\n ++cnt;\\n }\\n }\\n }\\n }\\n return cnt == M-1;\\n}\\n\\nint main() {\\n bool first = true;\\n while(cin >> N >> M && (N|M)) {\\n L.clear();\\n rL.clear();\\n for(int i = 0; i < N; ++i) {\\n string s;\\n cin >> s;\\n L[s] = L.size()-1;\\n rL.push_back(s);\\n }\\n S = vector<int>(M, 0);\\n for(int j = 0; j < M; ++j) {\\n int k;\\n cin >> k;\\n while(k--) {\\n string s;\\n cin >> s;\\n S[j] |= (1<<L[s]);\\n }\\n }\\n for(int i = 0; i < 6; ++i) V[i].clear();\\n rec(0,0,0);\\n\\n for(int i = 0; i < MAXN; ++i) E[i].clear();\\n for(int a = 0; a < M; ++a) {\\n for(int b = a+1; b < M; ++b) {\\n int bit = (S[a] & S[b]);\\n for(int k = 0; k < N; ++k) {\\n if(bit & (1<<k)) {\\n E[k].push_back((Edge){a,b});\\n }\\n }\\n }\\n }\\n\\n int ans = 0;\\n try {\\n for(int i = 1; i <= 5; ++i) {\\n for(int j = 0; j < V[i].size(); ++j) {\\n if(test(V[i][j])) {\\n ans = V[i][j];\\n throw 0;\\n }\\n }\\n }\\n } catch(...) {}\\n\\n if(first) first = false;\\n else cout << endl;\\n if(ans) {\\n vector<string> v;\\n for(int i = 0; i < N; ++i) {\\n if(ans & (1<<i)) v.push_back(rL[i]);\\n }\\n cout << v.size() << endl;\\n for(int i = 0; i < v.size(); ++i) {\\n cout << v[i] << endl;\\n }\\n } else {\\n cout << \\\"Impossible\\\" << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 490,\n \"memory_kb\": 2468,\n \"score_of_the_acc\": -0.6554,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2061_472541\",\n \"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\\nclass UnionFindTree\\n{\\n int n;\\n vector<int> parent; // 親ノード\\n vector<int> rank; // 木の高さの上限\\n vector<int> num; // グループの要素数\\n int find(int x){\\n if(parent[x] == x)\\n return x;\\n return parent[x] = find(parent[x]);\\n }\\npublic:\\n UnionFindTree(int n0){ // コンストラクタ\\n n = n0;\\n parent.resize(n);\\n for(int i=0; i<n; ++i)\\n parent[i] = i;\\n rank.assign(n, 0);\\n num.assign(n, 1);\\n }\\n void unite(int x, int y){ // xとyのグループを併合\\n if((x = find(x)) != (y = find(y))){\\n if(rank[x] < rank[y]){\\n parent[x] = y;\\n num[y] += num[x];\\n }else{\\n parent[y] = x;\\n if(rank[x] == rank[y])\\n ++ rank[x];\\n num[x] += num[y];\\n }\\n -- n;\\n }\\n }\\n bool same(int x, int y){ // xとyのグループが同じかを調べる\\n return find(x) == find(y);\\n }\\n int getNum(){ // グループの数を返す\\n return n;\\n }\\n int getNum(int x){ // xのグループの要素数を返す\\n return num[find(x)];\\n }\\n};\\n\\ntemplate <size_t T>\\nbool nextBitset(bitset<T> &bs, int digit)\\n{\\n if(bs.none())\\n return false;\\n bitset<T> x, y, z;\\n x = bs.to_ulong() & (~(bs.to_ulong()) + 1ULL);\\n y = bs.to_ulong() + x.to_ulong() + 0ULL;\\n z = bs & ~y;\\n if(bs[digit-1] && bs == z)\\n return false;\\n bs = ((z.to_ulong() / x.to_ulong()) >> 1) + 0ULL;\\n bs |= y;\\n return true;\\n}\\n\\nint n, m;\\nvector<string> name;\\nvector<bitset<30> > use;\\n\\nvoid solve()\\n{\\n for(int i=1; i<=min(5, n); ++i){\\n bitset<30> bs((1<<i)-1);\\n do{\\n UnionFindTree uft(m);\\n for(int j=0; j<m; ++j){\\n for(int k=0; k<j; ++k){\\n if((use[j] & use[k] & bs).any())\\n uft.unite(j, k);\\n }\\n }\\n\\n if(uft.getNum() == 1){\\n cout << i << endl;\\n for(int j=0; j<n; ++j){\\n if(bs[j])\\n cout << name[j] << endl;\\n }\\n return;\\n }\\n }while(nextBitset(bs, n));\\n }\\n\\n cout << \\\"Impossible\\\" << endl;\\n}\\n\\nint main()\\n{\\n bool isFirst = true;\\n\\n for(;;){\\n cin >> n >> m;\\n if(n == 0)\\n return 0;\\n\\n name.resize(n);\\n map<string, int> index;\\n for(int i=0; i<n; ++i){\\n cin >> name[i];\\n index[name[i]] = i;\\n }\\n\\n use.assign(m, 0);\\n for(int i=0; i<m; ++i){\\n int a;\\n cin >> a;\\n for(int j=0; j<a; ++j){\\n string s;\\n cin >> s;\\n use[i][index[s]] = true;\\n }\\n }\\n\\n if(isFirst)\\n isFirst = false;\\n else\\n cout << endl;\\n\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 730,\n \"memory_kb\": 1232,\n \"score_of_the_acc\": -0.1698,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1094,"cells":{"group_id":{"kind":"string","value":"aoj_2060_cpp"},"problem_description":{"kind":"string","value":"Problem C:\nTetrahedra\nPeter P. Pepper is facing a difficulty.\nAfter fierce battles with the Principality of Croode, the Aaronbarc Kingdom, for which he serves, had\nthe last laugh in the end. Peter had done great service in the war, and the king decided to give him a\nbig reward. But alas, the mean king gave him a hard question to try his intelligence. Peter is given a\nnumber of sticks, and he is requested to form a tetrahedral vessel with these sticks. Then he will be, said\nthe king, given as much patas (currency in this kingdom) as the volume of the vessel. In the situation,\nhe has only to form a frame of a vessel.\nFigure 1: An example tetrahedron vessel\nThe king posed two rules to him in forming a vessel: (1) he need not use all of the given sticks, and (2)\nhe must not glue two or more sticks together in order to make a longer stick.\nNeedless to say, he wants to obtain as much patas as possible. Thus he wants to know the maximum\npatas he can be given. So he called you, a friend of him, and asked to write a program to solve the\nproblem.\nInput\nThe input consists of multiple test cases. Each test case is given in a line in the format below:\nN a\n1\na\n2\n. . . a\nN\nwhere\nN\nindicates the number of sticks Peter is given, and\na\ni\nindicates the length (in centimeters) of\neach stick. You may assume 6 ≤\nN\n≤ 15 and 1 ≤\na\ni\n≤ 100.\nThe input terminates with the line containing a single zero.\nOutput\nFor each test case, print the maximum possible volume (in cubic centimeters) of a tetrahedral vessel\nwhich can be formed with the given sticks. You may print an arbitrary number of digits after the decimal\npoint, provided that the printed value does not contain an error greater than 10\n-6\n.\nIt is guaranteed that for each test case, at least one tetrahedral vessel can be formed.\nSample Input\n7 1 2 2 2 2 2 2\n0\nOutput for the Sample Input\n0.942809"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2060_9723100","code_snippet":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nint s[3];\n\nbool f1(int a, int b, int c) {\n s[0] = a, s[1] = b, s[2] = c;\n sort(s, s + 3);\n return s[0] + s[1] > s[2];\n}\n\ndouble f2(double l1, double l2, double l3, double l4, double l5, double l6) {\n double X = (l6 - l1 + l5) * (l1 + l5 + l6);\n double x = (l1 - l5 + l6) * (l5 - l6 + l1);\n double Y = (l4 - l2 + l6) * (l2 + l6 + l4);\n double y = (l2 - l6 + l4) * (l6 - l4 + l2);\n double Z = (l5 - l3 + l4) * (l3 + l4 + l5);\n double z = (l3 - l4 + l5) * (l4 - l5 + l3);\n double a = sqrt(x * Y * Z);\n double b = sqrt(y * Z * X);\n double c = sqrt(z * X * Y);\n double d = sqrt(x * y * z);\n return sqrt((-a + b + c + d) * (a - b + c + d) * (a + b - c + d) * (a + b + c - d)) / (192 * l4 * l5 * l6);\n}\n\nint A[15], p[15], q[6];\n\nsigned main() {\n int n;\n while (cin >> n) {\n if (!n) break;\n double ans = 0;\n for (int i = 0; i < n; i++) cin >> A[i];\n for (int i = 0; i < 6; i++) p[i] = 1;\n for (int i = 6; i < 15; i++) p[i] = 0;\n do {\n int it = 0;\n for (int i = 0; i < n; i++) if (p[i] == 1) q[it++] = i;\n do {\n int a = A[q[0]];\n int b = A[q[1]];\n int c = A[q[2]];\n int d = A[q[3]];\n int e = A[q[4]];\n int f = A[q[5]];\n if (f1(a, b, c) && f1(a, e, f) && f1(b, f, d) && f1(c, d, e))\n ans = max(ans, f2(a, b, c, d, e, f));\n } while (next_permutation(q, q + 6));\n } while (prev_permutation(p, p + n));\n cout << setprecision(6) << fixed << ans << '\\n';\n }\n}","accuracy":1,"time_ms":2970,"memory_kb":3516,"score_of_the_acc":-0.5074,"final_rank":12},{"submission_id":"aoj_2060_9722826","code_snippet":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nint s[3];\n\nbool f1(int a, int b, int c) {\n s[0] = a, s[1] = b, s[2] = c;\n sort(s, s + 3);\n return s[0] + s[1] > s[2];\n}\n\ndouble f2(double l1, double l2, double l3, double l4, double l5, double l6) {\n double X = (l6 - l1 + l5) * (l1 + l5 + l6);\n double x = (l1 - l5 + l6) * (l5 - l6 + l1);\n double Y = (l4 - l2 + l6) * (l2 + l6 + l4);\n double y = (l2 - l6 + l4) * (l6 - l4 + l2);\n double Z = (l5 - l3 + l4) * (l3 + l4 + l5);\n double z = (l3 - l4 + l5) * (l4 - l5 + l3);\n double a = sqrt(x * Y * Z);\n double b = sqrt(y * Z * X);\n double c = sqrt(z * X * Y);\n double d = sqrt(x * y * z);\n return sqrt((-a + b + c + d) * (a - b + c + d) * (a + b - c + d) * (a + b + c - d)) / (192 * l4 * l5 * l6);\n}\n\nint A[15], p[15], q[6];\n\nsigned main() {\n int n;\n while (cin >> n) {\n if (!n) break;\n double ans = 0;\n for (int i = 0; i < n; i++) cin >> A[i];\n for (int i = 0; i < 6; i++) p[i] = 1;\n for (int i = 6; i < 15; i++) p[i] = 0;\n do {\n int it = 0;\n for (int i = 0; i < n; i++) if (p[i] == 1) q[it++] = i;\n do {\n int a = A[q[0]];\n int b = A[q[1]];\n int c = A[q[2]];\n int d = A[q[3]];\n int e = A[q[4]];\n int f = A[q[5]];\n if (f1(a, b, c) && f1(a, e, f) && f1(b, f, d) && f1(c, d, e))\n ans = max(ans, f2(a, b, c, d, e, f));\n } while (next_permutation(q, q + 5));\n } while (prev_permutation(p, p + n));\n cout << setprecision(6) << fixed << ans << '\\n';\n }\n}","accuracy":1,"time_ms":480,"memory_kb":3596,"score_of_the_acc":-0.0899,"final_rank":3},{"submission_id":"aoj_2060_6826168","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define all(x) (x).begin(), (x).end()\n\nbool tri(int a, int b, int c) {\n\tvector<int> v = { a, b, c };\n\tsort(all(v));\n\treturn v[0] + v[1] > v[2];\n}\n\ndouble vol(int U, int V, int W, int u, int v, int w) {\n\tdouble X = (w - U + v) * (U + v + w),\n\t\tY = (u - V + w) * (V + w + u),\n\t\tZ = (v - W + u) * (W + u + v);\n\tdouble x = (U - v + w) * (v - w + U),\n\t\ty = (V - w + u) * (w - u + V),\n\t\tz = (W - u + v) * (u - v + W);\n\tdouble k = sqrt(x * Y * Z),\n\t\te = sqrt(y * Z * X),\n\t\tt = sqrt(z * X * Y),\n\t\tl = sqrt(x * y * z);\n\treturn sqrt((k + e + t - l) * (l + k + e - t) * (e + t + l - k) * (t + l + k - e)) / (192 * u * v * w);\n}\n\nint main() {\n\tcin.tie(0);\n\tios_base::sync_with_stdio(0);\n\n\twhile (true) {\n\t\tint n; cin >> n;\n\t\tif (!n) break;\n\t\tvector<int> a(n);\n\t\tfor (auto& i : a) cin >> i;\n\n\t\tvector<bool> p(n);\n\t\tfill(p.begin(), p.begin() + 6, true);\n\t\tdouble ans = .0;\n\t\tdo {\n\t\t\tvector<int> q;\n\t\t\tint c = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (p[i]) q.push_back(i);\n\t\t\t}\n\t\t\tdo {\n\t\t\t\tint U = a[q[0]], V = a[q[1]], W = a[q[2]];\n\t\t\t\tint u = a[q[3]], v = a[q[4]], w = a[q[5]];\n\t\t\t\tif (tri(U, V, W) && tri(u, v, W) && tri(v, w, U) && tri(w, u, V)) {\n\t\t\t\t\tans = max(ans, vol(U, V, W, u, v, w));\n\t\t\t\t}\n\t\t\t} while (next_permutation(all(q) - 1));\n\t\t} while (prev_permutation(all(p)));\n\t\tcout << fixed << setprecision(10) << ans << '\\n';\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":860,"memory_kb":3620,"score_of_the_acc":-0.154,"final_rank":4},{"submission_id":"aoj_2060_5500450","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 4000005\n\nint N,num_data;\nint table[SIZE][6],work[6],tri[4][3] = {{0,1,2},{0,3,4},{1,4,5},{2,5,3}};\ndouble A[20];\nbool used[20];\n\nvoid dfs(int index){\n\n\tif(index == 6){\n\n\t\tfor(int i = 0; i < 6; i++){\n\n\t\t\ttable[num_data][i] = work[i];\n\t\t}\n\t\tnum_data++;\n\n\t\treturn;\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(used[i])continue;\n\t\tused[i] = true;\n\n\t\twork[index] = i;\n\n\t\tdfs(index+1);\n\t\tused[i] = false;\n\t}\n}\n\n//三角形が作れるか\nbool check(int table[3]){\n\n\tsort(table,table+3);\n\n\treturn (table[0]+table[1] > table[2]+EPS);\n}\n\ndouble yogen(double a,double b, double c){\n\n\tdouble ret = (b*b+c*c-a*a)/(2*b*c);\n\treturn ret;\n}\n\ndouble calc_V(int index){\n\n\tdouble a = A[table[index][3]];\n\tdouble b = A[table[index][4]];\n\tdouble c = A[table[index][5]];\n\n\tdouble alpha = yogen(A[table[index][0]],A[table[index][3]],A[table[index][4]]);\n\tdouble beta = yogen(A[table[index][1]],A[table[index][4]],A[table[index][5]]);\n\tdouble gamma = yogen(A[table[index][2]],A[table[index][5]],A[table[index][3]]);\n\n\tdouble V = (a*b*c)/6.0*sqrt(1+2*alpha*beta*gamma-(alpha*alpha + beta*beta + gamma*gamma));\n\n\treturn V;\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf\",&A[i]);\n\t}\n\tnum_data = 0;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tused[i] = false;\n\t}\n\n\tdfs(0);\n\n\tdouble ans = 0;\n\n\tfor(int i = 0; i < num_data; i++){\n\n\t\tint TMP[3];\n\n\t\tbool FLG = true;\n\n\t\tfor(int k = 0; k < 4; k++){\n\t\t\tfor(int p = 0; p < 3; p++){\n\n\t\t\t\tTMP[p] = A[table[i][tri[k][p]]];\n\t\t\t}\n\t\t\tif(!check(TMP)){\n\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(!FLG)continue;\n\n\t\tdouble tmp_V = calc_V(i);\n\t\tans = max(ans,tmp_V);\n\t}\n\n\tprintf(\"%.12lf\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":3580,"memory_kb":87688,"score_of_the_acc":-1.5815,"final_rank":20},{"submission_id":"aoj_2060_3062329","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\n\ntypedef complex<double> P;\ntypedef vector<P> VP;\nstruct L : array<P, 2>{\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\n L(){}\n};\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 bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){\n return (conj(a)*b).X;\n}\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\n}\nint ccw(P a, P b, P c){\n b -= a;\n c -= a;\n if(cross(b,c) > EPS) return +1; //ccw\n if(cross(b,c) < -EPS) return -1; //cw\n if(dot(b,c) < -EPS) return +2; //c-a-b\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\n return 0; //a-c-b\n}\nP unit(const P &p){\n return p/abs(p);\n}\n\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1]-l[0], m[1]-m[0]);\n double B = cross(l[1]-l[0], l[1]-m[0]);\n return m[0] + B/A *(m[1]-m[0]);\n}\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n==0) break;\n\n vector<double> len(n);\n for(int i=0; i<n; i++){\n cin >> len[i];\n }\n vector<bool> choose(n, false);\n for(int i=0; i<3; i++){\n choose[n-i-1] = true;\n }\n\n double ans = 0;\n do{\n //底面を作る3角形の選び方\n vector<double> base;\n for(int i=0; i<n; i++){\n if(choose[i]) base.push_back(len[i]);\n }\n sort(base.begin(), base.end());\n if(base[0] +base[1] < base[2] +EPS) continue;\n\n P p[3];\n p[0] = P(0, 0);\n p[1] = P(base[0], 0);\n double c2x = (base[2]*base[2] -base[1]*base[1] +base[0]*base[0]) /(2*base[0]);\n double c2y = sqrt(base[2]*base[2] -c2x*c2x);\n p[2] = P(c2x, c2y);\n\n //底面から生やす辺の選び方\n for(int i=0; i<n; i++){\n if(choose[i]) continue;\n for(int j=0; j<n; j++){\n if(choose[j] || j==i) continue;\n for(int k=0; k<n; k++){\n if(choose[k] || k==i || k==j) continue;\n //3角形が作れるか\n bool ok = true;\n double hlen[3] = {len[i], len[j], len[k]};\n L lines[3];\n for(int d=0; d<3; d++){\n if(hlen[d] +hlen[(d+1)%3] < base[d] || abs(hlen[d] -hlen[(d+1)%3]) > base[d]){\n ok = false;\n break;\n }\n double dist = (hlen[d]*hlen[d] -hlen[(d+1)%3]*hlen[(d+1)%3] +base[d]*base[d]) /(2*base[d]);\n P dir = dist * unit(p[(d+1)%3] -p[d]);\n lines[d][0] = p[d] +dir;\n lines[d][1] = lines[d][0] +dir *P(0, 1);\n }\n if(ok){\n P cp1 = crosspointLL(lines[0], lines[1]);\n double h = sqrt(hlen[0]*hlen[0] -norm(cp1));\n ans = max(ans, cross(p[1], p[2]) *h /6);\n }\n }\n }\n }\n }while(next_permutation(choose.begin(), choose.end()));\n\n cout << fixed << setprecision(10);\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":360,"memory_kb":3368,"score_of_the_acc":-0.0671,"final_rank":2},{"submission_id":"aoj_2060_2863144","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 tri_valid(int a, int b, int c) {\n\tvector<int>v{ a,b,c };\n\tsort(v.begin(),v.end());\n\treturn v[2]<v[0]+v[1];\n}\n\nld get_theta(ld a1, ld a2, ld x) {\n\treturn (a1*a1+a2*a2-x*x)/(2*a1*a2);\n}\n\nint main() {\n\tcout<<setprecision(10)<<fixed;\n\twhile (true){\n\t\tint N;cin>>N;\n\t\tif(!N)break;\n\t\tvector<int>sticks(N);\n\t\tfor(int i=0;i<N;++i)cin>>sticks[i];\n\n\t\tvector<int>av(6);\n\t\tld ans=0;\n\t\tfor (av[0] = 0; av[0] < N; ++av[0]) {\n\t\t\tfor ( av[1] = av[0]+1; av[1] < N; ++av[1]) {\n\t\t\t\tfor ( av[2] = av[1]+1; av[2] < N; ++av[2]) {\n\t\t\t\t\tfor (av[3] = 0; av[3] < N; ++av[3]) {\n\t\t\t\t\t\tfor ( av[4] = 0; av[4] < N; ++av[4]) {\n\t\t\t\t\t\t\tfor ( av[5] = 0; av[5] < N; ++av[5]) {\n\t\t\t\t\t\t\t\tbool ok=true;\n\t\t\t\t\t\t\t\tfor (int i = 0; i < 6; ++i) {\n\t\t\t\t\t\t\t\t\tfor (int j = i + 1; j < 6; ++j) {\n\t\t\t\t\t\t\t\t\t\tif(av[i]==av[j])ok=false;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(!ok)continue;\n\t\t\t\t\t\t\t\tvector<int>v(6);\n\t\t\t\t\t\t\t\tfor(int i=0;i<6;++i)v[i]=sticks[av[i]];\n\t\t\t\t\t\t\t\tif(!tri_valid(v[0],v[1],v[2]))ok=false;\n\t\t\t\t\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\t\t\t\t\tif(!tri_valid(v[i],v[3+(i+1)%3],v[3+(i+2)%3]))ok=false;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(!ok)continue;\n\n\t\t\t\t\t\t\t\tvector<ld>thetas(3);\n\t\t\t\t\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\t\t\t\t\tthetas[i]=get_theta(v[3+(i+1)%3],v[3+(i+2)%3],v[i]);\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tld num=1+2*thetas[0]*thetas[1]*thetas[2]-(pow(thetas[0],2)+pow(thetas[1],2)+pow(thetas[2],2));\n\t\t\t\t\t\t\t\tif (num > 0) {\n\t\t\t\t\t\t\t\t\tans=max(ans,v[3]*v[4]*v[5]*sqrt(num)/6.0);\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\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":3240,"memory_kb":3112,"score_of_the_acc":-0.5481,"final_rank":13},{"submission_id":"aoj_2060_2585981","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define EPS (1e-10)\nusing Int = long long;\n\n//BEGIN CUT HERE\ntypedef vector<double> arr;\ntypedef vector<arr> mat;\n\ndouble det(mat A){\n int n=A.size();\n double res=1;\n for(int i=0;i<n;i++){\n int pivot=i;\n for(int j=i+1;j<n;j++)\n if(abs(A[j][i])>abs(A[pivot][i])) pivot=j;\n swap(A[pivot],A[i]);\n res*=A[i][i]*(i!=pivot?-1:1);\n if(abs(A[i][i])<EPS) break;\n for(int j=i+1;j<n;j++)\n for(int k=n-1;k>=i;k--)\n\tA[j][k]-=A[i][k]*A[j][i]/A[i][i];\n }\n return res;\n}\n\nbool isTriangle(double a1,double a2,double a3){\n if(a1+a2<=a3||a2+a3<=a1||a3+a1<=a2) return 0;\n return 1;\n}\ndouble tetrahedra(double OA,double OB,double OC,double AB,double AC,double BC){\n if(!isTriangle(OA,OB,AB)) return 0;\n if(!isTriangle(OB,OC,BC)) return 0;\n if(!isTriangle(OC,OA,AC)) return 0;\n if(!isTriangle(AB,AC,BC)) return 0;\n mat A(5,arr(5,0));\n A[0][0]= 0;A[0][1]=AB*AB;A[0][2]=AC*AC;A[0][3]=OA*OA;A[0][4]=1;\n A[1][0]=AB*AB;A[1][1]= 0;A[1][2]=BC*BC;A[1][3]=OB*OB;A[1][4]=1;\n A[2][0]=AC*AC;A[2][1]=BC*BC;A[2][2]= 0;A[2][3]=OC*OC;A[2][4]=1;\n A[3][0]=OA*OA;A[3][1]=OB*OB;A[3][2]=OC*OC;A[3][3]= 0;A[3][4]=1;\n A[4][0]= 1;A[4][1]= 1;A[4][2]= 1;A[4][3]= 1;A[4][4]=0;\n //cout<<\"det(A):\"<<det(A)<<endl;\n if(det(A)<=0) return 0; \n return sqrt(det(A)/288.0);\n}\n//END CUT HERE\n\nsigned main(){\n int n;\n while(cin>>n,n){\n double a[n];\n double ans=0;\n for(int i=0;i<n;i++) cin>>a[i];\n for(int i=0;i<n;i++){\n for(int j=i+1;j<n;j++){\n\tfor(int k=j+1;k<n;k++){\n\t for(int x=0;x<n;x++){\n\t if(i==x||j==x||k==x) continue;\n\t for(int y=0;y<n;y++){\n\t if(i==y||j==y||k==y||x==y) continue;\n\t for(int z=0;z<n;z++){\n\t\tif(i==z||j==z||k==z||x==z||y==z) continue;\n\t\tans=max(ans,tetrahedra(a[i],a[j],a[k],a[x],a[y],a[z]));\n\t }\n\t }\n\t }\n\t}\n }\n }\n printf(\"%.10f\\n\",ans);\n }\n return 0;\n}\n\n\n/*\nverified on 2017/04/26\nhttp://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2060\n*/","accuracy":1,"time_ms":1820,"memory_kb":3196,"score_of_the_acc":-0.3105,"final_rank":9},{"submission_id":"aoj_2060_2285200","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define EPS (1e-10)\n#define int long long\n\ntypedef vector<double> arr;\ntypedef vector<arr> mat;\n\ndouble det(mat A){\n int n=A.size();\n double res=1;\n for(int i=0;i<n;i++){\n int pivot=i;\n for(int j=i+1;j<n;j++)\n if(abs(A[j][i])>abs(A[pivot][i])) pivot=j;\n swap(A[pivot],A[i]);\n res*=A[i][i]*(i!=pivot?-1:1);\n if(abs(A[i][i])<EPS) break;\n for(int j=i+1;j<n;j++)\n for(int k=n-1;k>=i;k--)\n\tA[j][k]-=A[i][k]*A[j][i]/A[i][i];\n }\n return res;\n}\n\nbool isTriangle(double a1,double a2,double a3){\n if(a1+a2<=a3||a2+a3<=a1||a3+a1<=a2) return 0;\n return 1;\n}\ndouble tetrahedra(double OA,double OB,double OC,double AB,double AC,double BC){\n if(!isTriangle(OA,OB,AB)) return 0;\n if(!isTriangle(OB,OC,BC)) return 0;\n if(!isTriangle(OC,OA,AC)) return 0;\n if(!isTriangle(AB,AC,BC)) return 0;\n mat A(5,arr(5,0));\n A[0][0]= 0;A[0][1]=AB*AB;A[0][2]=AC*AC;A[0][3]=OA*OA;A[0][4]=1;\n A[1][0]=AB*AB;A[1][1]= 0;A[1][2]=BC*BC;A[1][3]=OB*OB;A[1][4]=1;\n A[2][0]=AC*AC;A[2][1]=BC*BC;A[2][2]= 0;A[2][3]=OC*OC;A[2][4]=1;\n A[3][0]=OA*OA;A[3][1]=OB*OB;A[3][2]=OC*OC;A[3][3]= 0;A[3][4]=1;\n A[4][0]= 1;A[4][1]= 1;A[4][2]= 1;A[4][3]= 1;A[4][4]=0;\n //cout<<\"det(A):\"<<det(A)<<endl;\n if(det(A)<=0) return 0; \n return sqrt(det(A)/288.0);\n}\nsigned main(){\n int n;\n while(cin>>n,n){\n double a[n];\n double ans=0;\n for(int i=0;i<n;i++) cin>>a[i];\n for(int i=0;i<n;i++){\n for(int j=i+1;j<n;j++){\n\tfor(int k=j+1;k<n;k++){\n\t for(int x=0;x<n;x++){\n\t if(i==x||j==x||k==x) continue;\n\t for(int y=0;y<n;y++){\n\t if(i==y||j==y||k==y||x==y) continue;\n\t for(int z=0;z<n;z++){\n\t\tif(i==z||j==z||k==z||x==z||y==z) continue;\n\t\tans=max(ans,tetrahedra(a[i],a[j],a[k],a[x],a[y],a[z]));\n\t }\n\t }\n\t }\n\t}\n }\n }\n printf(\"%.10f\\n\",ans);\n }\n return 0;\n}\n\n\n/*\nverified on 2017/04/26\nhttp://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2060\n*/","accuracy":1,"time_ms":1780,"memory_kb":3080,"score_of_the_acc":-0.3024,"final_rank":7},{"submission_id":"aoj_2060_2280286","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define EPS (1e-10)\n#define int long long\n\ntypedef vector<double> arr;\ntypedef vector<arr> mat;\n\ndouble det(mat A){\n int n=A.size();\n double res=1;\n for(int i=0;i<n;i++){\n int pivot=i;\n for(int j=i+1;j<n;j++)\n if(abs(A[j][i])>abs(A[pivot][i])) pivot=j;\n swap(A[pivot],A[i]);\n res*=A[i][i]*(i!=pivot?-1:1);\n if(abs(A[i][i])<EPS) break;\n for(int j=i+1;j<n;j++)\n for(int k=n-1;k>=i;k--)\n\tA[j][k]-=A[i][k]*A[j][i]/A[i][i];\n }\n return res;\n}\n\nbool tri(double a1,double a2,double a3){\n if(a1+a2<=a3||a2+a3<=a1||a3+a1<=a2) return 1;\n return 0;\n}\ndouble tetrahedra(double OA,double OB,double OC,double AB,double AC,double BC){\n if(tri(OA,OB,AB)) return 0;\n if(tri(OB,OC,BC)) return 0;\n if(tri(OC,OA,AC)) return 0;\n if(tri(AB,AC,BC)) return 0;\n mat A(5,arr(5,0));\n A[0][0]= 0;A[0][1]=AB*AB;A[0][2]=AC*AC;A[0][3]=OA*OA;A[0][4]=1;\n A[1][0]=AB*AB;A[1][1]= 0;A[1][2]=BC*BC;A[1][3]=OB*OB;A[1][4]=1;\n A[2][0]=AC*AC;A[2][1]=BC*BC;A[2][2]= 0;A[2][3]=OC*OC;A[2][4]=1;\n A[3][0]=OA*OA;A[3][1]=OB*OB;A[3][2]=OC*OC;A[3][3]= 0;A[3][4]=1;\n A[4][0]= 1;A[4][1]= 1;A[4][2]= 1;A[4][3]= 1;A[4][4]=0;\n //cout<<\"det(A):\"<<det(A)<<endl;\n if(det(A)<=0) return 0; \n return sqrt(det(A)/288.0);\n}\nsigned main(){\n int n;\n while(cin>>n,n){\n double a[n];\n double ans=0;\n for(int i=0;i<n;i++) cin>>a[i];\n for(int i=0;i<n;i++){\n for(int j=i+1;j<n;j++){\n\tfor(int k=j+1;k<n;k++){\n\t for(int x=0;x<n;x++){\n\t if(i==x||j==x||k==x) continue;\n\t for(int y=0;y<n;y++){\n\t if(i==y||j==y||k==y||x==y) continue;\n\t for(int z=0;z<n;z++){\n\t\tif(i==z||j==z||k==z||x==z||y==z) continue;\n\t\tans=max(ans,tetrahedra(a[i],a[j],a[k],a[x],a[y],a[z]));\n\t }\n\t }\n\t }\n\t}\n }\n }\n printf(\"%.10f\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":1790,"memory_kb":3256,"score_of_the_acc":-0.3061,"final_rank":8},{"submission_id":"aoj_2060_2276503","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef complex<double> P;\ntypedef pair<P,double> C;\ntypedef pair<P,P> L;\n \nconst double eps=1e-8;\n \nbool eq(double a,double b){\n return -eps<a-b&&a-b<eps;\n}\n \ndouble cross(P a,P b){\n return imag(b*conj(a));\n}\n \nbool isCrossCC(C a,C b){\n double ar=a.second, br=b.second;\n double dist=abs(a.first-b.first);\n if( dist > ar+br+eps)return false;\n if( dist > ar+br-eps )return true;\n if( dist > abs(ar-br)+eps)return true;\n if( dist > abs(ar-br)-eps)return true;\n return false;\n}\n \ndouble Sqrt(double x){\n if(x<0)return 0;\n return sqrt(x);\n}\n \nP reflect(P a,P b,P c){\n b-=a;\n c-=a;\n return a+ conj(c/b)*b;\n}\n \nP getCrossCC(C a,C b){\n P p1=a.first,p2=b.first;\n double r1=a.second, r2=b.second;\n double cA = (r1*r1+norm(p1-p2)-r2*r2) / (2.0*r1*abs(p1-p2));\n return p1+(p2-p1)/abs(p1-p2)*r1*P(cA, Sqrt(1.0-cA*cA) );\n}\n \nint n;\nint t[15];\nint u[6];\nbool used[15];\ndouble ans=-1;\n \ndouble calcArea(double a,double b,double c){\n P p1=P(0,0);\n P p2=P(b,0);\n P p3=getCrossCC( C(p1,a) , C(p2,c) );\n return abs( cross( p1-p3 , p2-p3 )*0.5 );\n}\n \nP getCrossLL(L line0,L line1){\n P a=line0.first, b=line0.second;\n P c=line1.first, d=line1.second;\n a-=d;b-=d;c-=d;\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\n}\n \nbool check(int a,int b,int c){\n if(a<b)swap(a,b);\n if(b<c)swap(b,c);\n if(a<b)swap(a,b);\n return ( a < b + c );\n}\n \n \nvoid check(){\n \n \n double S=calcArea(u[0],u[1],u[2]);\n \n double h=1e9;\n \n C ca = C( P(0,0) , u[4] );\n C cb = C( P(u[1],0) , u[5] );\n C cc = C( getCrossCC( C(ca.first,u[0]) , C(cb.first,u[2]) ) , u[3] );\n \n if( isCrossCC(ca,cb) == false )return;\n if( isCrossCC(cc,cb) == false )return;\n if( isCrossCC(ca,cc) == false )return;\n \n L fi = L( getCrossCC(ca,cb) , getCrossCC(cb,ca) );\n if( abs(fi.second-fi.first ) < eps )return;\n \n L se = L( getCrossCC(cc,ca) , getCrossCC(ca,cc) );\n if( abs(se.second-se.first ) < eps )return;\n \n \n L th = L( getCrossCC(cc,cb) , getCrossCC(cb,cc) );\n \n P target=getCrossLL(fi,se);\n \n P target2 = getCrossLL( th,se);\n if( abs(target-target2) > eps )return;\n \n double di;\n \n di=abs(P(0,0)-target);\n double Ah=min(h, Sqrt(u[4]*u[4]-di*di) );\n \n di=abs(P(u[1],0)-target);\n double Bh=min(h, Sqrt(u[5]*u[5]-di*di) );\n \n di=abs(cc.first-target);\n double Ch=min(h, Sqrt(cc.second*cc.second-di*di) );\n if( !eq(Ah,Ch) )return;\n if( !eq(Ah,Bh) )return;\n if( !eq(Bh,Ch) )return;\n h=min( Ah, Bh);\n h=min( h, Ah);\n \n ans=max(ans, h*S/3.0);\n}\n \nvoid dfs(int cnt){\n if(cnt>=3 && !check(u[0],u[1],u[2]))return;\n if(cnt>=5 && !check(u[0],u[3],u[4]))return;\n if(cnt>=6 && !check(u[1],u[4],u[5]))return;\n if(cnt>=6 && !check(u[2],u[3],u[5]))return;\n \n if(cnt==6){\n check();\n }else{\n for(int i=0;i<n;i++){\n if(used[i])continue;\n used[i]=true;\n u[cnt]=t[i];\n dfs(cnt+1);\n used[i]=false;\n }\n }\n}\n \nint main(){\n while(1){\n scanf(\"%d\",&n);\n if(n==0)break;\n \n for(int i=0;i<n;i++){\n scanf(\"%d\",&t[i]);\n }\n \n sort(t,t+n);\n \n memset(used,false,sizeof(used));\n ans=-1;\n dfs(0);\n printf(\"%.10f\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":6070,"memory_kb":3304,"score_of_the_acc":-1.026,"final_rank":18},{"submission_id":"aoj_2060_2275914","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef complex<double> P;\ntypedef pair<P,double> C;\ntypedef pair<P,P> L;\n\nconst double eps=1e-8;\n\nbool eq(double a,double b){\n return -eps<a-b&&a-b<eps;\n}\n\ndouble cross(P a,P b){\n return imag(b*conj(a));\n}\n\nbool isCrossCC(C a,C b){\n double ar=a.second, br=b.second;\n double dist=abs(a.first-b.first);\n if( dist > ar+br+eps)return false;\n if( dist > ar+br-eps )return true;\n if( dist > abs(ar-br)+eps)return true;\n if( dist > abs(ar-br)-eps)return true;\n return false;\n}\n\ndouble Sqrt(double x){\n if(x<0)return 0;\n return sqrt(x);\n}\n\nP reflect(P a,P b,P c){\n b-=a;\n c-=a;\n return a+ conj(c/b)*b;\n}\n\nP getCrossCC(C a,C b){\n P p1=a.first,p2=b.first;\n double r1=a.second, r2=b.second;\n double cA = (r1*r1+norm(p1-p2)-r2*r2) / (2.0*r1*abs(p1-p2));\n return p1+(p2-p1)/abs(p1-p2)*r1*P(cA, Sqrt(1.0-cA*cA) );\n}\n\nint n;\nint t[15];\nint u[6];\nbool used[15];\ndouble ans=-1;\n\ndouble calcArea(double a,double b,double c){\n P p1=P(0,0);\n P p2=P(b,0);\n P p3=getCrossCC( C(p1,a) , C(p2,c) );\n return abs( cross( p1-p3 , p2-p3 )*0.5 );\n}\n\nP getCrossLL(L line0,L line1){\n P a=line0.first, b=line0.second;\n P c=line1.first, d=line1.second;\n a-=d;b-=d;c-=d;\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\n}\n\nbool check(int a,int b,int c){\n if(a<b)swap(a,b);\n if(b<c)swap(b,c);\n if(a<b)swap(a,b);\n return ( a < b + c );\n}\n\n\nvoid check(){\n\n \n double S=calcArea(u[0],u[1],u[2]);\n\n double h=1e9;\n \n C ca = C( P(0,0) , u[4] );\n C cb = C( P(u[1],0) , u[5] );\n C cc = C( getCrossCC( C(ca.first,u[0]) , C(cb.first,u[2]) ) , u[3] );\n\n if( isCrossCC(ca,cb) == false )return;\n if( isCrossCC(cc,cb) == false )return;\n if( isCrossCC(ca,cc) == false )return;\n \n L fi = L( getCrossCC(ca,cb) , getCrossCC(cb,ca) );\n if( abs(fi.second-fi.first ) < eps )return;\n \n L se = L( getCrossCC(cc,ca) , getCrossCC(ca,cc) );\n if( abs(se.second-se.first ) < eps )return;\n \n\n L th = L( getCrossCC(cc,cb) , getCrossCC(cb,cc) );\n \n P target=getCrossLL(fi,se);\n\n P target2 = getCrossLL( th,se);\n if( abs(target-target2) > eps )return;\n \n double di;\n \n di=abs(P(0,0)-target);\n double Ah=min(h, Sqrt(u[4]*u[4]-di*di) );\n\n di=abs(P(u[1],0)-target);\n double Bh=min(h, Sqrt(u[5]*u[5]-di*di) );\n\n di=abs(cc.first-target);\n double Ch=min(h, Sqrt(cc.second*cc.second-di*di) );\n if( !eq(Ah,Ch) )return;\n if( !eq(Ah,Bh) )return;\n if( !eq(Bh,Ch) )return;\n h=min( Ah, Bh);\n h=min( h, Ah);\n\n ans=max(ans, h*S/3.0);\n}\n\nvoid dfs(int cnt){\n if(cnt>=3 && !check(u[0],u[1],u[2]))return;\n if(cnt>=5 && !check(u[0],u[3],u[4]))return;\n if(cnt>=6 && !check(u[1],u[4],u[5]))return;\n if(cnt>=6 && !check(u[2],u[3],u[5]))return;\n \n if(cnt==6){\n check();\n }else{\n for(int i=0;i<n;i++){\n if(used[i])continue;\n used[i]=true;\n u[cnt]=t[i];\n dfs(cnt+1);\n used[i]=false;\n }\n }\n}\n\nint main(){\n while(1){\n scanf(\"%d\",&n);\n if(n==0)break;\n \n for(int i=0;i<n;i++){\n scanf(\"%d\",&t[i]);\n }\n\n sort(t,t+n);\n \n memset(used,false,sizeof(used));\n ans=-1;\n dfs(0);\n printf(\"%.10f\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":6070,"memory_kb":3324,"score_of_the_acc":-1.0262,"final_rank":19},{"submission_id":"aoj_2060_1882430","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX_N 15\n \nbool isTri(double a,double b,double c){\n if(c < a+b && a < b+c && b < c+a){\n\treturn true;\n }\n return false;\n}\n \ndouble getArea(double a,double b,double c){\n double s = (a+b+c)/2.0;\n return sqrt(s*(s-a)*(s-b)*(s-c)); \n}\n \ndouble S(double x){\n return x*x;\n}\n \ndouble calc(vector<double> &v){\n double a = S(v[0])*S(v[4])*(S(v[1])+S(v[2])+S(v[3])+S(v[5])-S(v[0])-S(v[4]));\n double b = S(v[1])*S(v[5])*(S(v[0])+S(v[2])+S(v[3])+S(v[4])-S(v[1])-S(v[5]));\n double c = S(v[2])*S(v[3])*(S(v[0])+S(v[1])+S(v[4])+S(v[5])-S(v[2])-S(v[3]));\n double d = -S(v[0])*S(v[1])*S(v[3])-(S(v[1])*S(v[2]))*S(v[4])-\n\tS(v[0])*S(v[2])*S(v[5])-S(v[3])*S(v[4])*S(v[5]);\n return sqrt((a+b+c+d)/144.0);\n}\n \ndouble getVolume(vector<double> &v){\n if(!isTri(v[0],v[1],v[3])) return 0.0; \n if(!isTri(v[0],v[2],v[5])) return 0.0; \n if(!isTri(v[1],v[2],v[4])) return 0.0; \n if(!isTri(v[3],v[4],v[5])) return 0.0; \n return calc(v);\n}\n \ndouble solve(int S,vector<double> &v,vector<double> &a){\n if(__builtin_popcount(S) == 6){\n\treturn getVolume(v);\n }\n double res = 0;\n for(int i = 0 ; i < (int)a.size() ; i++){\n\tif((S >> i) & 1) continue;\n\tv.push_back(a[i]);\n\tres = max(res,solve(S|(1<<i),v,a));\n\tv.pop_back();\n }\n return res;\n}\n \nint main(){\n int N;\n while(cin >> N,N){\n\tvector<double> a(N),v;\n\tfor(int i = 0 ; i < N ; i++){\n\t cin >> a[i];\n\t}\n\tprintf(\"%.10f\\n\",solve(0,v,a));\n }\n return 0;\n}","accuracy":1,"time_ms":1550,"memory_kb":3200,"score_of_the_acc":-0.2651,"final_rank":6},{"submission_id":"aoj_2060_1255269","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX_N 15\n \nbool isTri(double a,double b,double c){\n if(c < a+b && a < b+c && b < c+a){\n return true;\n }\n return false;\n}\n \ndouble getArea(double a,double b,double c){\n double s = (a+b+c)/2.0;\n return sqrt(s*(s-a)*(s-b)*(s-c)); \n}\n \ndouble S(double x){\n return x*x;\n}\n \ndouble calc(vector<double> &v){\n double a = S(v[0])*S(v[4])*(S(v[1])+S(v[2])+S(v[3])+S(v[5])-S(v[0])-S(v[4]));\n double b = S(v[1])*S(v[5])*(S(v[0])+S(v[2])+S(v[3])+S(v[4])-S(v[1])-S(v[5]));\n double c = S(v[2])*S(v[3])*(S(v[0])+S(v[1])+S(v[4])+S(v[5])-S(v[2])-S(v[3]));\n double d = -S(v[0])*S(v[1])*S(v[3])-(S(v[1])*S(v[2]))*S(v[4])-\n S(v[0])*S(v[2])*S(v[5])-S(v[3])*S(v[4])*S(v[5]);\n return sqrt((a+b+c+d)/144.0);\n}\n \ndouble getVolume(vector<double> &v){\n if(!isTri(v[0],v[1],v[3])){ return 0.0; }\n if(!isTri(v[0],v[2],v[5])){ return 0.0; }\n if(!isTri(v[1],v[2],v[4])){ return 0.0; }\n if(!isTri(v[3],v[4],v[5])){ return 0.0; }\n return calc(v);\n}\n \ndouble solve(int S,vector<double> &v,vector<double> &a){\n if(__builtin_popcount(S) == 6){\n return getVolume(v);\n }\n double res = 0;\n for(int i = 0 ; i < (int)a.size() ; i++){\n if((S >> i) & 1){ continue; }\n v.push_back(a[i]);\n res = max(res,solve(S|(1<<i),v,a));\n v.pop_back();\n }\n return res;\n}\n \nint main(){\n int N;\n while(cin >> N,N){\n vector<double> a(N),v;\n for(int i = 0 ; i < N ; i++){\n cin >> a[i];\n }\n printf(\"%.10f\\n\",solve(0,v,a));\n }\n return 0;\n}","accuracy":1,"time_ms":2440,"memory_kb":1280,"score_of_the_acc":-0.3925,"final_rank":11},{"submission_id":"aoj_2060_1155568","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;\nbool tri(int a, int b, int c) {\n return a <= b + c && b <= c + a && c <= a + b;\n}\n\ndouble calc(double a, double b, double c, double l, double m, double n) {\n a *= a;\n b *= b;\n c *= c;\n l *= l;\n m *= m;\n n *= n;\n double tmp =\n +a*l*(-a+b+c-l+m+n)\n +b*m*(a-b+c+l-m+n)\n +c*n*(a+b-c+l+m-n)\n -l*b*c-a*m*c-a*b*n-l*m*n;\n if(tmp < 0) return 0;\n return sqrt(tmp) / 12;\n}\n\nint main(){\n int num;\n while(cin >> num && num > 0) {\n vector<int> v(num);\n REP(i, num) cin >> v[i];\n double ans = 0.0;\n REP(i, num) REP(j, i) REP(k, j) {\n int l = v[i], m = v[j], n = v[k];\n if(!tri(l, m, n)) continue;\n REP(p, num) if(p != i && p != j && p != k) \n REP(q, num) if(q != p && q != i && q != j && q != k)\n REP(r, num) if(r != q && r != p && r != i && r != j && r != k) {\n int a = v[p], b = v[q], c = v[r];\n if(!tri(a, b, n)) continue;\n if(!tri(b, c, l)) continue;\n if(!tri(c, a, m)) continue;\n ans = max(ans, calc(a, b, c, l, m, n));\n }\n }\n printf(\"%.12f\\n\", ans);\n }\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":1220,"score_of_the_acc":-0.0019,"final_rank":1},{"submission_id":"aoj_2060_1123787","code_snippet":"#include <iostream>\n#include <vector>\n#include <set>\n#include <algorithm>\n#include <complex>\n#include <cstdio>\nusing namespace std;\n\ndouble EPS = 1e-8;\ntypedef complex<double> P,point;\n\nstruct C {P p; double r; C(const P &p,double r) : p(p), r(r){} C(){} };\n\n\ntypedef double number;\nconst number eps = 1e-8;\ntypedef vector<number> Array;\ntypedef vector<Array> matrix;\n\n// O( n )\nmatrix identity(int n) {\n matrix A(n, Array(n));\n for (int i = 0; i < n; ++i) A[i][i] = 1;\n return A;\n}\n// O( n )\nnumber inner_product(const Array &a, const Array &b) {\n number ans = 0;\n for (int i = 0; i < a.size(); ++i)\n ans += a[i] * b[i];\n return ans;\n}\n// O( n^2 )\nArray mul(const matrix &A, const Array &x) {\n Array y(A.size());\n for (int i = 0; i < A.size(); ++i)\n for (int j = 0; j < A[0].size(); ++j)\n y[i] = A[i][j] * x[j];\n return y;\n}\n// O( n^3 )\nmatrix mul(const matrix &A, const matrix &B) {\n matrix C(A.size(), Array(B[0].size()));\n for (int i = 0; i < C.size(); ++i)\n for (int j = 0; j < C[i].size(); ++j)\n for (int k = 0; k < A[i].size(); ++k)\n C[i][j] += A[i][k] * B[k][j];\n return C;\n}\n// O( n^3 log e )\nmatrix pow(const matrix &A, int e) {\n return e == 0 ? identity(A.size()) :\n e % 2 == 0 ? pow(mul(A, A), e/2) : mul(A, pow(A, e-1));\n}\n// O( n^3 )\nnumber det(matrix A) {\n const int n = A.size();\n number D = 1;\n for (int i = 0; i < n; ++i) {\n int pivot = i;\n for (int j = i+1; j < n; ++j)\n if (abs(A[j][i]) > abs(A[pivot][i])) pivot = j;\n swap(A[pivot], A[i]);\n D *= A[i][i] * (i != pivot ? -1 : 1);\n if (abs(A[i][i]) < eps) break;\n for(int j = i+1; j < n; ++j)\n for(int k = n-1; k >= i; --k)\n A[j][k] -= A[i][k] * A[j][i] / A[i][i];\n }\n return D;\n}\n// O(n)\nnumber tr(const matrix &A) {\n number ans = 0;\n for (int i = 0; i < A.size(); ++i)\n ans += A[i][i];\n return ans;\n}\n// O( n^3 ).\nint rank(matrix A) {\n const int n = A.size(), m = A[0].size();\n int r = 0;\n for (int i = 0; r < n && i < m; ++i) {\n int pivot = r;\n for (int j = r+1; j < n; ++j)\n if (abs(A[j][i]) > abs(A[pivot][i])) pivot = j;\n swap(A[pivot], A[r]);\n if (abs(A[r][i]) < eps) continue;\n for (int k = m-1; k >= i; --k)\n A[r][k] /= A[r][i];\n for(int j = r+1; j < n; ++j)\n for(int k = i; k < m; ++k)\n A[j][k] -= A[r][k] * A[j][i];\n ++r;\n }\n return r;\n}\n\ndouble chk(double a,double b,double c){\n\tif( a > b ) swap(a,b);\n\tif( b > c ) swap(b,c);\n\tif( a > b ) swap(a,b);\n\treturn a + b >= c;\n}\ndouble calc(double a,double b,double c,double d,double e,double f){\n\tdouble x = a*a*d*d*(b*b+c*c+e*e+f*f-a*a-d*d)+b*b*e*e*(c*c+a*a+f*f+d*d-b*b-e*e)+c*c*f*f*(a*a+b*b+d*d+e*e-c*c-f*f)-a*a*b*b*c*c-a*a*e*e*f*f-d*d*b*b*f*f-d*d*e*e*c*c;\n\treturn x>0?sqrt(x / 144):0;\n}\nint main(){\n\tint N;\n\twhile(cin >> N && N){\n\t\tvector<int> t(N);\n\t\tdouble ans = 0;\n\t\tvector<int> reflesh(6,0);\n\t\t\n\t\tint cnt = 0;\n\t\t//cout << calc(P(0,0),P(0,1),P(1,1),1,1,1) << endl;\n\t\tfor(int i = 0 ; i < N ; i++) cin >> t[i];\n\t\tsort(t.begin(),t.end());\n\t\tfor(int i = 0 ; i < (1<<N) ; i++){\n\t\t\tif( __builtin_popcount(i) == 6 ){\n\t\t\t\tvector<int> v;\n\t\t\t\tfor(int j = 0 ; j < N ; j++) if(i>>j&1)v.push_back(t[j]);\n\t\t\t\tdo{\n\t\t\t\t\tdouble a,b,c,d,e,f;\n\t\t\t\t\ttie(a,b,c,d,e,f) = tuple<double,double,double,double,double,double>{v[0],v[1],v[2],v[3],v[4],v[5]};\n\t\t\t\t\tif( chk(a,e,f) && chk(a,b,c) && chk(e,d,c) && chk(d,b,f) ){\n\t\t\t\t\t\tans = max(ans,calc(v[0],v[1],v[2],v[3],v[4],v[5]));\n\t\t\t\t\t}\n\t\t\t\t}while( next_permutation(v.begin(),v.end()) );\n\t\t\t}\n\t\t}\n\t\t//cout << cnt << endl;\n\t\tif(ans == 0){\n\t\t\tfor(int i = 0 ; i < N ; i++) cout << t[i] << \" \"; cout << endl;\n\t\t}\n\t\tprintf(\"%.10lf%c\",ans,10);\n\t}\n}","accuracy":1,"time_ms":1550,"memory_kb":1232,"score_of_the_acc":-0.2424,"final_rank":5},{"submission_id":"aoj_2060_1002134","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-7)\n#define equals(a,b) (fabs((a)-(b))<EPS)\n\nusing namespace std;\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;\nconst int IINF = INT_MAX;\nconst int inf = INT_MAX;\n//\nclass Point{\npublic:\n double x,y;\n\n Point(double x = -IINF,double y = -IINF): x(x),y(y){}\n\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:y<p.y; }\n\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n bool operator == (const Segment& p)const { return p.p1 == p1 && p.p2 == p2; }\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\nostream& operator << (ostream& os,const Point& a){ os << \"(\" << a.x << \",\" << a.y << \")\"; }\n\nostream& operator << (ostream& os,const Segment& a){ os << \"( \" << a.p1 << \" , \" << a.p2 << \" )\"; }\n\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\n\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\n\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\n\ndouble abs(Point a){ return sqrt(norm(a)); }\n\n//rad は角度をラジアンで持たせること\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n\n// 度をラジアンに変換\ndouble toRad(double agl){ return agl*M_PI/180.0; }\n\n// a => prev, b => cur, c=> next\n// prev から cur へ行って next へ行く際の角度を求める\ndouble getArg(Point a,Point b,Point c){\n double arg1 = atan2(b.y-a.y,b.x-a.x);\n double arg2 = atan2(c.y-b.y,c.x-b.x);\n double arg = fabs( arg1 - arg2 );\n while( arg > M_PI ) arg -= 2.0 * M_PI;\n return fabs(arg);\n}\n//\n\n// CCW\nint ccw(Point p0,Point p1,Point p2){\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS)return CLOCKWISE;\n if(dot(a,b) < -EPS)return ONLINE_BACK;\n if(norm(a) < norm(b))return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n// CCW END\n\n// intersect\nbool intersectLL(Line l, Line m) {\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\n}\nbool intersectLS(Line l, Line s) {\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\n}\nbool intersectLP(Line l,Point p) {\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\n}\nbool intersectSS(Line s, Line t) {\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\n}\nbool intersectSP(Line s, Point p) {\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\n}\n\nPoint projection(Line l,Point p) {\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\n return l.p1 + (l.p1-l.p2)*t;\n}\nPoint reflection(Line l,Point p) {\n return p + (projection(l, p) - p) * 2;\n}\ndouble distanceLP(Line l, Point p) {\n return abs(p - projection(l, p));\n}\ndouble distanceLL(Line l, Line m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\n}\n\ndouble distanceLS(Line l, Line s) {\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\n}\ndouble distanceSP(Line s, Point p) {\n Point r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s.p1 - p), abs(s.p2 - p));\n}\n\ndouble distanceSS(Line s, Line t) {\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\n}\n\n/*\nsame lineの時注意\nもしm.p1が中心でなかったときに正しい答えとならない\nPoint crosspoint(Line l,Line m){\n double A = cross(l.p2-l.p1,m.p2-m.p1);\n double B = cross(l.p2-l.p1,l.p2-m.p1);\n if(abs(A) < EPS && abs(B) < EPS){\n vector<Point> vec;\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\n sort(vec.begin(),vec.end());\n assert(vec[1] == vec[2]);\n return vec[1];\n //return m.p1;\n }\n if(abs(A) < EPS)assert(false);\n return m.p1 + (m.p2-m.p1)*(B/A);\n}\n\n*/\nPoint crosspoint(Line l, Line m) {\n double A = cross(l.p2 - l.p1, m.p2 - m.p1);\n double B = cross(l.p2 - l.p1, l.p2 - m.p1);\n if (abs(A) < EPS && abs(B) < EPS) return m.p1; // same line\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m.p1 + (m.p2 - m.p1) * (B / A);\n}\n\n// intersect END\n\nint array[6000];\n\ndouble areaT(double a,double b,double c){\n double s = (a+b+c)/2.0;\n return sqrt(s*(s-a)*(s-b)*(s-c));\n}\n\ndouble areaH(double h,double *a){ return ( areaT(a[0],a[1],a[2]) * h) / 3.0; }\n\nbool LTE(double a,double b){ return equals(a,b) || a < b; }\n\nbool LT(double a,double b){ return !equals(a,b) && a < b; }\n\nbool GTE(double a,double b){ return equals(a,b) || a > b; }\n\nbool check1(double a,double b,double c){ return a + b >= c; }\n\nbool checkT(double a,double b,double c){ return LT(a,b+c) && LT(b,a+c) && LT(c,a+b); }\n\nbool check2(double h,double *a){\n if( LTE(a[3]*a[3]-h*h,0) || LTE(a[4]*a[4]-h*h,0) || LTE(a[5]*a[5]-h*h,0) ) return false;\n double L1 = sqrt(a[3]*a[3]-h*h);\n double L2 = sqrt(a[4]*a[4]-h*h);\n double L3 = sqrt(a[5]*a[5]-h*h);\n if( LTE(L1,0) || LTE(L2,0) || LTE(L3,0) ) return false;\n if( !checkT(L1,L2,a[0]) || !checkT(L2,L3,a[2]) || !checkT(L2,L3,a[2]) ) return false;\n cout << endl;\n cout << L1 << \" \" << L2 << \" \" << L3 << endl;\n double tmp_area = areaT(L1,L2,a[0]) + areaT(L2,L3,a[2]) + areaT(L1,L3,a[1]);\n cout << tmp_area << \" (\" << areaT(L1,L2,a[0]) << \"+\" << areaT(L2,L3,a[2]) << \"+\" << areaT(L1,L3,a[1]) << \") \"<< \" ?= \" << areaT(a[0],a[1],a[2]) << endl;\n return equals(tmp_area,areaT(a[0],a[1],a[2]));\n}\n\nSegment gen(Point p1,Point p2,double a,double b,double c,bool &error){\n double S = areaT(a,b,c);\n cout << \"S = \" << S << endl;\n double h = 2 * S / a;\n if( LTE(h,0) ) error = true;\n if( LTE(b*b-h*h,0) ) error = true;\n if( error ) return Segment();\n cout << c * c << \" - \" << h*h << endl; \ndouble x = sqrt(c*c-h*h);\n cout << h << \",\" << x << endl;\n Segment seg;\n seg.p1 = p1;\n Vector v = p2 - p1;\n Vector ve = v / abs(v);\n seg.p2 = p1 + ve * x;\n cout << v << endl;\n v = rotate(v,toRad(90));\n cout << v << endl;\n ve = v / abs(v);\n seg.p2 = seg.p2 + ve * h;\n return seg;\n}\n\n//\n typedef vector<int> VI;\n typedef vector<VI> VVI;\n typedef VVI matrix;\n\n\n\nmatrix identity(int n)\n{\n matrix A(n,vector<int>(n));\n for(int i=0;i<n;i++) A[i][i] = 1;\n return A;\n}\n\n\nvector<int> multi(const matrix& A,const vector<int>& B)\n{\n vector<int> ret(A.size());\n for(int i=0;i<A.size();++i)\n for(int j=0;j<A[0].size();++j)\n ret[i] += A[i][j]*B[j];\n return ret;\n}\n\n\nmatrix multi(const matrix& A,const matrix& B)\n{\n matrix C(A.size(),vector<int>(B[0].size()));\n for(int i=0;i<C.size();++i)\n for(int j=0;j<C[i].size();++j)\n for(int k=0;k<A[i].size();++k)\n\tC[i][j] += A[i][k]*B[k][j];\n return C;\n}\n\n\n\nmatrix pow(const matrix& A,int e)\n{\n return !e?identity(A.size()):\n (e%2?multi(A,pow(A,e-1)):pow(multi(A,A),e/2));\n}\n/*\n冪乗に関するちょいと解説\n行列をAする\nA^2 = A*A, A^4 = (A^2)*(A^2), A^8 = (A^4)*(A^4) ・・・・と計算している\n行列に限ったことでなく、普通の値の冪乗でも同じように考えることができる\n*/\n\n\nint extgcd(int a,int b,int& x,int& y)\n{\n int d = a;\n if(b != 0){\n d = extgcd(b,a%b,y,x);\n y -= (a/b)*x;\n }\n else\n x = 1,y = 0;\n return d;\n}\n\nint mod_inv(int a,int m)\n{\n int x,y;\n extgcd(a,m,x,y);\n return (m+x%m)%m;\n}\n\n\nint rank(vector<vector<int> > A,int mod)\n{\n int H = A.size(), W = A[0].size();\n int r = 0;\n rep(x,W)\n { \n int pivot = inf;\n REP(y,r,H)\n\tif(A[y][x])\n\t {\n\t pivot = y;\n\t break;\n\t }\n if(pivot == inf)continue;\n swap(A[r],A[pivot]);\n\n REP(y,r+1,H)\n\t{\n\t int value = A[y][x] * mod_inv(A[r][x],mod) % mod;\n\t if(value)REP(x2,x,W)\n\t\t A[y][x2] = ((A[y][x2] - A[r][x2] * value)%mod + mod ) % mod; \n\t}\n r++;\n }\n return r;\n}\n\n\n/*\n\nAx=bが解を持つ必要十分条件は、\nrank(A) = rank(A|b)\nであり、\nAx=bが一意の解を持つ必要十分条件は、\nrank(A) = rank(A|b) = n\n*/\n\nbool modGaussElimination(vector<vector<int> > &A, vector<int> &b, int m, vector<int> &res) {\n int n = A.size();\n vector<vector<int> > B(n, vector<int>(n+1));\n rep(i,n) rep(j,n)\n B[i][j] = A[i][j];\n rep(i, n) B[i][n] = b[i];\n \n int nowy = 0;\n rep(x, n) {\n int pivot = -1;\n for (int j=nowy; j<n; ++j)\n if (B[j][x]) {\n pivot = j;break;\n }\n if (pivot == -1) continue;\n swap(B[nowy], B[pivot]);\n\n for (int j=nowy+1; j<n; ++j) {\n int t = B[j][x] * mod_inv(B[nowy][x], m) % m;\n if (t)\n for (int k=x; k<=n; ++k)\n B[j][k] = ((B[j][k] - B[nowy][k] * t)%m + m )%m;\n }\n nowy++;\n \n }\n\n res.clear();\n for (int y=nowy; y<n; ++y)\n if (B[y][n]) // rank(A) != rank(A|b)\n return 0;\n if (nowy != n) { // rank(A) == rank(A|b) != n\n // 解が一意でない。ひとつ求める\n res = vector<int>(n,inf); // INFは任意を表す\n for (int y=n-1; y>=0; --y) {\n int x;\n for (x=y; x<n; ++x) {\n if (B[y][x])\n break;\n }\n if (x==n) continue;\n int sum = B[y][n];\n \n for (int i=x+1; i<n; ++i) {\n if (res[i] == inf) res[i] = 0; // この時点でres[i]が決まってなかったら0とする\n sum = ((sum - res[i] * B[y][i])%m + m)%m;\n }\n res[x] = sum * mod_inv(B[y][x], m) % m;\n }\n rep(i, n) if (res[i]==inf) res[i] = 0;\n return 0;\n }\n // 解が一意に決まる。普通に後退代入\n res.resize(n);\n for (int x=n-1; x>=0; --x) {\n int sum = B[x][n];\n for (int i=n-1; i>x; --i) {\n sum = ((sum - res[i] * B[x][i])%m + m)%m; \n }\n res[x] = sum * mod_inv(B[x][x], m) % m;\n }\n return 1;\n}\n\n//double det(vector<vector<double> > &A) {\ndouble det(double A[5][5]){\n const int n = 5;\n double D = 1;\n for (int i = 0; i < n; ++i) {\n int pivot = i;\n for (int j = i+1; j < n; ++j)\n if (abs(A[j][i]) > abs(A[pivot][i])) pivot = j;\n swap(A[pivot], A[i]);\n D *= A[i][i] * (i != pivot ? -1 : 1);\n if (abs(A[i][i]) < EPS) break;\n for(int j = i+1; j < n; ++j)\n for(int k = n-1; k >= i; --k)\n A[j][k] -= A[i][k] * A[j][i] / A[i][i];\n }\n return D;\n}\n\n\n//\n\ndouble getAreaTetrahedra(double *A){\n double a = A[3], b = A[1], c = A[0], p = A[5], q = A[4], r = A[2];\n\n /*\n vector<vector<double> > mat(5,vector<double>(5,0));\n mat[0][1] = p*p, mat[0][2] = q*q, mat[0][3] = a*a, mat[0][4] = 1;\n mat[1][0] = p*p, mat[1][2] = r*r, mat[1][3] = b*b, mat[1][4] = 1;\n mat[2][0] = q*q, mat[2][1] = r*r, mat[2][3] = c*c, mat[2][4] = 1;\n mat[3][0] = a*a, mat[3][1] = b*b, mat[3][2] = c*c, mat[3][4] = 1;\n mat[4][0] = 1, mat[4][1] = 1, mat[4][2] = 1, mat[4][3] = 1;\n */\n double mat[5][5] = {{0,p*p,q*q,a*a,1},{p*p,0,r*r,b*b,1},{q*q,r*r,0,c*c,1},{a*a,b*b,c*c,0,1},{1,1,1,1,0}};\n return sqrt(det(mat)/288.0);\n}\n\ndouble calc(double *a){\n double ret = 0;\n do{\n if( !checkT(a[0],a[1],a[2]) || !checkT(a[0],a[3],a[4]) || !checkT(a[1],a[3],a[5]) || !checkT(a[2],a[4],a[5]) ) continue;\n /*\n Point p1(0,0);\n Point p2(a[1],0);\n double theta = acos( ( a[0]*a[0] + a[1]*a[1] - a[2]*a[2] ) / ( 2*a[0]*a[1] ) );\n Point p3(a[0]*cos(theta),a[0]*sin(theta));\n //cout << p1 << \" \" << p2 << \" \" << p3 << endl;\n double A = a[1], b =a[0], c = a[2];\n double x0 = (A*A-b*b-c*c)/(2*A);\n //cout << \"(\" << (A*A-b*b-c*c)/(2*A) << \",\" << sqrt(b*b-x0*x0)<<\")\"<<endl;\n */\n //if( error ) continue;\n //if( error ) continue;\n //if( LTE(a[3]*a[3]-x*x,0) ) continue;\n //if( LTE(h,0) ) continue;\n ret = max(ret,getAreaTetrahedra(a));\n }while(next_permutation(a,a+6));\n return ret;\n}\n\nint main(){\n /*\n double a[6] = {2,2,2,2,2,2};\n cout << calc(a) << endl;\n return 0;\n */\n int dex = 0;\n rep(i,(1<<15)) if( __builtin_popcount(i) == 6 ) array[dex++] = i;\n int N,input[16];\n while( scanf(\"%d\",&N), N ){\n rep(i,N) scanf(\"%d\",input+i);\n sort(input,input+N);\n double maxi = 0;\n rep(k,dex){\n int bitmask = array[k];\n if( bitmask >= (1<<N) ) break;\n double buf[6];\n int cur = 0;\n rep(j,N) if( (bitmask>>j) & 1 ) buf[cur++] = input[j];\n maxi = max(maxi,calc(buf));\n }\n printf(\"%.10f\\n\",maxi);\n }\n return 0;\n}","accuracy":1,"time_ms":5320,"memory_kb":1288,"score_of_the_acc":-0.8767,"final_rank":16},{"submission_id":"aoj_2060_1002131","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-7)\n#define equals(a,b) (fabs((a)-(b))<EPS)\n\nusing namespace std;\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;\nconst int IINF = INT_MAX;\nconst int inf = INT_MAX;\n//\nclass Point{\npublic:\n double x,y;\n\n Point(double x = -IINF,double y = -IINF): x(x),y(y){}\n\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:y<p.y; }\n\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n bool operator == (const Segment& p)const { return p.p1 == p1 && p.p2 == p2; }\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\nostream& operator << (ostream& os,const Point& a){ os << \"(\" << a.x << \",\" << a.y << \")\"; }\n\nostream& operator << (ostream& os,const Segment& a){ os << \"( \" << a.p1 << \" , \" << a.p2 << \" )\"; }\n\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\n\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\n\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\n\ndouble abs(Point a){ return sqrt(norm(a)); }\n\n//rad は角度をラジアンで持たせること\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n\n// 度をラジアンに変換\ndouble toRad(double agl){ return agl*M_PI/180.0; }\n\n// a => prev, b => cur, c=> next\n// prev から cur へ行って next へ行く際の角度を求める\ndouble getArg(Point a,Point b,Point c){\n double arg1 = atan2(b.y-a.y,b.x-a.x);\n double arg2 = atan2(c.y-b.y,c.x-b.x);\n double arg = fabs( arg1 - arg2 );\n while( arg > M_PI ) arg -= 2.0 * M_PI;\n return fabs(arg);\n}\n//\n\n// CCW\nint ccw(Point p0,Point p1,Point p2){\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS)return CLOCKWISE;\n if(dot(a,b) < -EPS)return ONLINE_BACK;\n if(norm(a) < norm(b))return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n// CCW END\n\n// intersect\nbool intersectLL(Line l, Line m) {\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\n}\nbool intersectLS(Line l, Line s) {\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\n}\nbool intersectLP(Line l,Point p) {\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\n}\nbool intersectSS(Line s, Line t) {\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\n}\nbool intersectSP(Line s, Point p) {\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\n}\n\nPoint projection(Line l,Point p) {\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\n return l.p1 + (l.p1-l.p2)*t;\n}\nPoint reflection(Line l,Point p) {\n return p + (projection(l, p) - p) * 2;\n}\ndouble distanceLP(Line l, Point p) {\n return abs(p - projection(l, p));\n}\ndouble distanceLL(Line l, Line m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\n}\n\ndouble distanceLS(Line l, Line s) {\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\n}\ndouble distanceSP(Line s, Point p) {\n Point r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s.p1 - p), abs(s.p2 - p));\n}\n\ndouble distanceSS(Line s, Line t) {\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\n}\n\n/*\nsame lineの時注意\nもしm.p1が中心でなかったときに正しい答えとならない\nPoint crosspoint(Line l,Line m){\n double A = cross(l.p2-l.p1,m.p2-m.p1);\n double B = cross(l.p2-l.p1,l.p2-m.p1);\n if(abs(A) < EPS && abs(B) < EPS){\n vector<Point> vec;\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\n sort(vec.begin(),vec.end());\n assert(vec[1] == vec[2]);\n return vec[1];\n //return m.p1;\n }\n if(abs(A) < EPS)assert(false);\n return m.p1 + (m.p2-m.p1)*(B/A);\n}\n\n*/\nPoint crosspoint(Line l, Line m) {\n double A = cross(l.p2 - l.p1, m.p2 - m.p1);\n double B = cross(l.p2 - l.p1, l.p2 - m.p1);\n if (abs(A) < EPS && abs(B) < EPS) return m.p1; // same line\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m.p1 + (m.p2 - m.p1) * (B / A);\n}\n\n// intersect END\n\nint array[6000];\n\ndouble areaT(double a,double b,double c){\n double s = (a+b+c)/2.0;\n return sqrt(s*(s-a)*(s-b)*(s-c));\n}\n\ndouble areaH(double h,double *a){ return ( areaT(a[0],a[1],a[2]) * h) / 3.0; }\n\nbool LTE(double a,double b){ return equals(a,b) || a < b; }\n\nbool LT(double a,double b){ return !equals(a,b) && a < b; }\n\nbool GTE(double a,double b){ return equals(a,b) || a > b; }\n\nbool check1(double a,double b,double c){ return a + b >= c; }\n\nbool checkT(double a,double b,double c){ return LT(a,b+c) && LT(b,a+c) && LT(c,a+b); }\n\nbool check2(double h,double *a){\n if( LTE(a[3]*a[3]-h*h,0) || LTE(a[4]*a[4]-h*h,0) || LTE(a[5]*a[5]-h*h,0) ) return false;\n double L1 = sqrt(a[3]*a[3]-h*h);\n double L2 = sqrt(a[4]*a[4]-h*h);\n double L3 = sqrt(a[5]*a[5]-h*h);\n if( LTE(L1,0) || LTE(L2,0) || LTE(L3,0) ) return false;\n if( !checkT(L1,L2,a[0]) || !checkT(L2,L3,a[2]) || !checkT(L2,L3,a[2]) ) return false;\n cout << endl;\n cout << L1 << \" \" << L2 << \" \" << L3 << endl;\n double tmp_area = areaT(L1,L2,a[0]) + areaT(L2,L3,a[2]) + areaT(L1,L3,a[1]);\n cout << tmp_area << \" (\" << areaT(L1,L2,a[0]) << \"+\" << areaT(L2,L3,a[2]) << \"+\" << areaT(L1,L3,a[1]) << \") \"<< \" ?= \" << areaT(a[0],a[1],a[2]) << endl;\n return equals(tmp_area,areaT(a[0],a[1],a[2]));\n}\n\nSegment gen(Point p1,Point p2,double a,double b,double c,bool &error){\n double S = areaT(a,b,c);\n cout << \"S = \" << S << endl;\n double h = 2 * S / a;\n if( LTE(h,0) ) error = true;\n if( LTE(b*b-h*h,0) ) error = true;\n if( error ) return Segment();\n cout << c * c << \" - \" << h*h << endl; \ndouble x = sqrt(c*c-h*h);\n cout << h << \",\" << x << endl;\n Segment seg;\n seg.p1 = p1;\n Vector v = p2 - p1;\n Vector ve = v / abs(v);\n seg.p2 = p1 + ve * x;\n cout << v << endl;\n v = rotate(v,toRad(90));\n cout << v << endl;\n ve = v / abs(v);\n seg.p2 = seg.p2 + ve * h;\n return seg;\n}\n\n//\n typedef vector<int> VI;\n typedef vector<VI> VVI;\n typedef VVI matrix;\n\n\n\nmatrix identity(int n)\n{\n matrix A(n,vector<int>(n));\n for(int i=0;i<n;i++) A[i][i] = 1;\n return A;\n}\n\n\nvector<int> multi(const matrix& A,const vector<int>& B)\n{\n vector<int> ret(A.size());\n for(int i=0;i<A.size();++i)\n for(int j=0;j<A[0].size();++j)\n ret[i] += A[i][j]*B[j];\n return ret;\n}\n\n\nmatrix multi(const matrix& A,const matrix& B)\n{\n matrix C(A.size(),vector<int>(B[0].size()));\n for(int i=0;i<C.size();++i)\n for(int j=0;j<C[i].size();++j)\n for(int k=0;k<A[i].size();++k)\n\tC[i][j] += A[i][k]*B[k][j];\n return C;\n}\n\n\n\nmatrix pow(const matrix& A,int e)\n{\n return !e?identity(A.size()):\n (e%2?multi(A,pow(A,e-1)):pow(multi(A,A),e/2));\n}\n/*\n冪乗に関するちょいと解説\n行列をAする\nA^2 = A*A, A^4 = (A^2)*(A^2), A^8 = (A^4)*(A^4) ・・・・と計算している\n行列に限ったことでなく、普通の値の冪乗でも同じように考えることができる\n*/\n\n\nint extgcd(int a,int b,int& x,int& y)\n{\n int d = a;\n if(b != 0){\n d = extgcd(b,a%b,y,x);\n y -= (a/b)*x;\n }\n else\n x = 1,y = 0;\n return d;\n}\n\nint mod_inv(int a,int m)\n{\n int x,y;\n extgcd(a,m,x,y);\n return (m+x%m)%m;\n}\n\n\nint rank(vector<vector<int> > A,int mod)\n{\n int H = A.size(), W = A[0].size();\n int r = 0;\n rep(x,W)\n { \n int pivot = inf;\n REP(y,r,H)\n\tif(A[y][x])\n\t {\n\t pivot = y;\n\t break;\n\t }\n if(pivot == inf)continue;\n swap(A[r],A[pivot]);\n\n REP(y,r+1,H)\n\t{\n\t int value = A[y][x] * mod_inv(A[r][x],mod) % mod;\n\t if(value)REP(x2,x,W)\n\t\t A[y][x2] = ((A[y][x2] - A[r][x2] * value)%mod + mod ) % mod; \n\t}\n r++;\n }\n return r;\n}\n\n\n/*\n\nAx=bが解を持つ必要十分条件は、\nrank(A) = rank(A|b)\nであり、\nAx=bが一意の解を持つ必要十分条件は、\nrank(A) = rank(A|b) = n\n*/\n\nbool modGaussElimination(vector<vector<int> > &A, vector<int> &b, int m, vector<int> &res) {\n int n = A.size();\n vector<vector<int> > B(n, vector<int>(n+1));\n rep(i,n) rep(j,n)\n B[i][j] = A[i][j];\n rep(i, n) B[i][n] = b[i];\n \n int nowy = 0;\n rep(x, n) {\n int pivot = -1;\n for (int j=nowy; j<n; ++j)\n if (B[j][x]) {\n pivot = j;break;\n }\n if (pivot == -1) continue;\n swap(B[nowy], B[pivot]);\n\n for (int j=nowy+1; j<n; ++j) {\n int t = B[j][x] * mod_inv(B[nowy][x], m) % m;\n if (t)\n for (int k=x; k<=n; ++k)\n B[j][k] = ((B[j][k] - B[nowy][k] * t)%m + m )%m;\n }\n nowy++;\n \n }\n\n res.clear();\n for (int y=nowy; y<n; ++y)\n if (B[y][n]) // rank(A) != rank(A|b)\n return 0;\n if (nowy != n) { // rank(A) == rank(A|b) != n\n // 解が一意でない。ひとつ求める\n res = vector<int>(n,inf); // INFは任意を表す\n for (int y=n-1; y>=0; --y) {\n int x;\n for (x=y; x<n; ++x) {\n if (B[y][x])\n break;\n }\n if (x==n) continue;\n int sum = B[y][n];\n \n for (int i=x+1; i<n; ++i) {\n if (res[i] == inf) res[i] = 0; // この時点でres[i]が決まってなかったら0とする\n sum = ((sum - res[i] * B[y][i])%m + m)%m;\n }\n res[x] = sum * mod_inv(B[y][x], m) % m;\n }\n rep(i, n) if (res[i]==inf) res[i] = 0;\n return 0;\n }\n // 解が一意に決まる。普通に後退代入\n res.resize(n);\n for (int x=n-1; x>=0; --x) {\n int sum = B[x][n];\n for (int i=n-1; i>x; --i) {\n sum = ((sum - res[i] * B[x][i])%m + m)%m; \n }\n res[x] = sum * mod_inv(B[x][x], m) % m;\n }\n return 1;\n}\n\n//double det(vector<vector<double> > &A) {\ndouble det(double A[5][5]) {\n const int n = 5;\n double D = 1;\n for (int i = 0; i < n; ++i) {\n int pivot = i;\n for (int j = i+1; j < n; ++j)\n if (abs(A[j][i]) > abs(A[pivot][i])) pivot = j;\n swap(A[pivot], A[i]);\n D *= A[i][i] * (i != pivot ? -1 : 1);\n if (abs(A[i][i]) < EPS) break;\n for(int j = i+1; j < n; ++j)\n for(int k = n-1; k >= i; --k)\n A[j][k] -= A[i][k] * A[j][i] / A[i][i];\n }\n return D;\n}\n\n\n//\n\ndouble getAreaTetrahedra(double *A){\n double a = A[3], b = A[1], c = A[0], p = A[5], q = A[4], r = A[2];\n\n /*\n vector<vector<double> > mat(5,vector<double>(5,0));\n mat[0][1] = p*p, mat[0][2] = q*q, mat[0][3] = a*a, mat[0][4] = 1;\n mat[1][0] = p*p, mat[1][2] = r*r, mat[1][3] = b*b, mat[1][4] = 1;\n mat[2][0] = q*q, mat[2][1] = r*r, mat[2][3] = c*c, mat[2][4] = 1;\n mat[3][0] = a*a, mat[3][1] = b*b, mat[3][2] = c*c, mat[3][4] = 1;\n mat[4][0] = 1, mat[4][1] = 1, mat[4][2] = 1, mat[4][3] = 1;\n */\n double mat[5][5] = {{0,p*p,q*q,a*a,1},{p*p,0,r*r,b*b,1},{q*q,r*r,0,c*c,1},{a*a,b*b,c*c,0,1},{1,1,1,1,0}};\n return det(mat)/288.0;\n}\n\ndouble calc(double *a){\n double ret = 0;\n do{\n if( !checkT(a[0],a[1],a[2]) || !checkT(a[0],a[3],a[4]) || !checkT(a[1],a[3],a[5]) || !checkT(a[2],a[4],a[5]) ) continue;\n /*\n Point p1(0,0);\n Point p2(a[1],0);\n double theta = acos( ( a[0]*a[0] + a[1]*a[1] - a[2]*a[2] ) / ( 2*a[0]*a[1] ) );\n Point p3(a[0]*cos(theta),a[0]*sin(theta));\n //cout << p1 << \" \" << p2 << \" \" << p3 << endl;\n double A = a[1], b =a[0], c = a[2];\n double x0 = (A*A-b*b-c*c)/(2*A);\n //cout << \"(\" << (A*A-b*b-c*c)/(2*A) << \",\" << sqrt(b*b-x0*x0)<<\")\"<<endl;\n */\n //if( error ) continue;\n //if( error ) continue;\n //if( LTE(a[3]*a[3]-x*x,0) ) continue;\n //if( LTE(h,0) ) continue;\n ret = max(ret,sqrt(getAreaTetrahedra(a)));\n }while(next_permutation(a,a+6));\n return ret;\n}\n\nint main(){\n /*\n double a[6] = {2,2,2,2,2,2};\n cout << calc(a) << endl;\n return 0;\n */\n int dex = 0;\n rep(i,(1<<15)) if( __builtin_popcount(i) == 6 ) array[dex++] = i;\n int N,input[16];\n while( scanf(\"%d\",&N), N ){\n rep(i,N) scanf(\"%d\",input+i);\n sort(input,input+N);\n double maxi = 0;\n rep(k,dex){\n int bitmask = array[k];\n if( bitmask >= (1<<N) ) break;\n double buf[6];\n int cur = 0;\n rep(j,N) if( (bitmask>>j) & 1 ) buf[cur++] = input[j];\n maxi = max(maxi,calc(buf));\n }\n printf(\"%.10f\\n\",maxi);\n }\n return 0;\n}","accuracy":1,"time_ms":5250,"memory_kb":1288,"score_of_the_acc":-0.8649,"final_rank":15},{"submission_id":"aoj_2060_551697","code_snippet":"#include<iostream>\n#include<cmath>\n#include<cstdio>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\n\ndouble a[20];\nint index[6], n;\n\nbool ng(double a, double b, double c) {\n if (a + b <= c) return true;\n if (b + c <= a) return true;\n if (c + a <= b) return true;\n return false;\n}\n\t\t\t\t \n\ndouble solve(int m) {\n if (m == 6) {\n if (ng(a[index[0]], a[index[1]], a[index[2]])) return 0;\n if (ng(a[index[0]], a[index[3]], a[index[4]])) return 0;\n if (ng(a[index[1]], a[index[4]], a[index[5]])) return 0;\n if (ng(a[index[2]], a[index[5]], a[index[3]])) return 0;\n double aa[3], bb[3], t, pi[4];\n aa[0] = a[index[0]];\n aa[1] = a[index[1]];\n aa[2] = a[index[2]];\n bb[0] = a[index[5]];\n bb[1] = a[index[3]];\n bb[2] = a[index[4]];\n t = 0;\n rep (i, 3) t += aa[i] * aa[i];\n rep (i, 3) t += bb[i] * bb[i];\n t = sqrt(max(t, 0.));\n pi[0] = aa[0] * aa[1] * aa[2];\n pi[1] = aa[0] * bb[1] * bb[2];\n pi[2] = aa[1] * bb[2] * bb[0];\n pi[3] = aa[2] * bb[0] * bb[1];\n double v = 0;\n rep (i, 3) v += aa[i] * aa[i] * bb[i] * bb[i] * (t * t- 2 * aa[i] * aa[i] - 2 * bb[i] * bb[i]);\n rep (i, 4) v -= pi[i] * pi[i];\n return sqrt(max(v, 0.)) / 12;\n }\n double res = 0;\n rep (i, n) {\n bool ok = true;\n rep (j, m) if (index[j] == i) ok = false;\n if (ok) {\n index[m] = i;\n res = max(solve(m + 1), res);\n }\n }\n return res;\n}\n\nint main() {\n while (true) {\n cin >> n;\n if (n == 0) break;\n rep (i, n) cin >> a[i];\n printf(\"%.12f\\n\", solve(0));\n }\n return 0;\n}","accuracy":1,"time_ms":2390,"memory_kb":1244,"score_of_the_acc":-0.3837,"final_rank":10},{"submission_id":"aoj_2060_472504","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;\n\ndouble determinant(vector<vector<double> > mat)\n{ \n const int n = mat.size();\n double ret = 1.0;\n for(int i=0; i<n; ++i){\n int tmp = i;\n for(int j=i+1; j<n; ++j){\n if(abs(mat[j][i]) > abs(mat[tmp][i]))\n tmp = j;\n }\n if(abs(mat[tmp][i]) < EPS)\n return 0.0;\n if(tmp != i){\n mat[i].swap(mat[tmp]);\n ret *= -1.0;\n }\n\n for(int j=i+1; j<n; ++j){\n for(int k=n-1; k>=i; --k){\n mat[j][k] -= mat[i][k] * (mat[j][i] / mat[i][i]);\n }\n }\n ret *= mat[i][i];\n }\n return ret;\n}\n\ndouble tetrahedronVolume(const vector<double>& len)\n{\n const int a[][3] = {{0,1,3}, {1,2,4}, {0,2,5}, {3,4,5}};\n for(int i=0; i<4; ++i){\n vector<double> b(3);\n for(int j=0; j<3; ++j)\n b[j] = len[a[i][j]];\n sort(b.begin(), b.end());\n if(b[2] > b[0] + b[1] - EPS)\n return 0.0;\n }\n\n const int y[] = {0, 3, 1, 3, 2, 3, 0, 1, 1, 2, 0, 2};\n const int x[] = {3, 0, 3, 1, 3, 2, 1, 0, 2, 1, 2, 0};\n\n vector<vector<double> > mat(5, vector<double>(5, 1.0));\n for(int i=0; i<12; ++i)\n mat[y[i]][x[i]] = pow(len[i/2], 2.0);\n for(int i=0; i<5; ++i)\n mat[i][i] = 0.0;\n\n return sqrt(determinant(mat) / 288.0);\n}\n\ntemplate <size_t T>\nbool nextBitset(bitset<T> &bs, int digit)\n{\n if(bs.none())\n return false;\n bitset<T> x, y, z;\n x = bs.to_ulong() & (~(bs.to_ulong()) + 1ULL);\n y = bs.to_ulong() + x.to_ulong() + 0ULL;\n z = bs & ~y;\n if(bs[digit-1] && bs == z)\n return false;\n bs = ((z.to_ulong() / x.to_ulong()) >> 1) + 0ULL;\n bs |= y;\n return true;\n}\n\nint main()\n{\n for(;;){\n int n;\n cin >> n;\n if(n == 0)\n return 0;\n\n vector<double> len(n);\n for(int i=0; i<n; ++i)\n cin >> len[i];\n\n double ret = 0.0;\n bitset<15> used;\n for(int i=0; i<n; ++i){\n for(int j=0; j<i; ++j){\n for(int k=0; k<j; ++k){\n used[i] = used[j] = used[k] = true;\n\n for(int a=0; a<n; ++a){\n for(int b=0; b<n; ++b){\n for(int c=0; c<n; ++c){\n if(a == b || b == c || c == a)\n continue;\n if(used[a] || used[b] || used[c])\n continue;\n\n vector<double> len2(6);\n len2[0] = len[a];\n len2[1] = len[b];\n len2[2] = len[c];\n len2[3] = len[i];\n len2[4] = len[j];\n len2[5] = len[k];\n ret = max(ret, tetrahedronVolume(len2));\n ;\n }\n }\n }\n\n used[i] = used[j] = used[k] = false;\n }\n }\n }\n\n printf(\"%.10f\\n\", ret);\n }\n}","accuracy":1,"time_ms":3930,"memory_kb":1272,"score_of_the_acc":-0.6429,"final_rank":14},{"submission_id":"aoj_2060_418972","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\ntypedef long long ll;\n\nint n;\nint t[20];\nvector<int> v[20];\n\nvoid makePattern(int idx, int cnt, int bit){\n if(cnt > 6) return;\n if(idx == n){\n if(cnt == 6){\n v[n].push_back(bit);\n }\n return;\n }\n\n makePattern(idx + 1, cnt, bit);\n makePattern(idx + 1, cnt + 1, bit | (1 << idx));\n}\n\nbool check(ll x, ll y, ll z){\n return x + y > z && x + z > y && y + z > x;\n}\n\nvoid solve(){\n double ans = 0;\n\n for(int i = 0; i < v[n].size(); i++){\n vector<int> a;\n\n for(int j = 0; j < n; j++){\n if(v[n][i] & (1 << j)){\n a.push_back(t[j]);\n }\n }\n\n sort(a.begin(), a.end());\n\n do{\n ll A = a[0];\n ll B = a[1];\n ll C = a[2];\n ll X = a[3];\n ll Y = a[4];\n ll Z = a[5];\n\n if(!check(A, B, C) || !check(A, Y, Z) ||\n !check(B, X, Z) || !check(C, Y, Z)){\n continue;\n }\n\n A *= A;\n B *= B;\n C *= C;\n X *= X;\n Y *= Y;\n Z *= Z;\n\n ll V =\n A * X * (B + C - A + Y + Z - X) +\n B * Y * (C + A - B + Z + X - Y) +\n C * Z * (A + B - C + X + Y - Z) -\n A * Y * Z -\n B * Z * X -\n C * X * Y -\n A * B * C;\n\n ans = max(ans, sqrt((double)V / 144));\n }while(next_permutation(a.begin(), a.end()));\n }\n\n printf(\"%.6f\\n\", ans);\n}\n\nint main(){\n for(n = 6; n <= 15; n++){\n makePattern(0, 0, 0);\n }\n\n while(cin >> n, n){\n for(int i = 0; i < n; i++){\n cin >> t[i];\n }\n solve();\n }\n}","accuracy":1,"time_ms":5420,"memory_kb":1052,"score_of_the_acc":-0.8908,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_2060_9723100\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\n\\nint s[3];\\n\\nbool f1(int a, int b, int c) {\\n s[0] = a, s[1] = b, s[2] = c;\\n sort(s, s + 3);\\n return s[0] + s[1] > s[2];\\n}\\n\\ndouble f2(double l1, double l2, double l3, double l4, double l5, double l6) {\\n double X = (l6 - l1 + l5) * (l1 + l5 + l6);\\n double x = (l1 - l5 + l6) * (l5 - l6 + l1);\\n double Y = (l4 - l2 + l6) * (l2 + l6 + l4);\\n double y = (l2 - l6 + l4) * (l6 - l4 + l2);\\n double Z = (l5 - l3 + l4) * (l3 + l4 + l5);\\n double z = (l3 - l4 + l5) * (l4 - l5 + l3);\\n double a = sqrt(x * Y * Z);\\n double b = sqrt(y * Z * X);\\n double c = sqrt(z * X * Y);\\n double d = sqrt(x * y * z);\\n return sqrt((-a + b + c + d) * (a - b + c + d) * (a + b - c + d) * (a + b + c - d)) / (192 * l4 * l5 * l6);\\n}\\n\\nint A[15], p[15], q[6];\\n\\nsigned main() {\\n int n;\\n while (cin >> n) {\\n if (!n) break;\\n double ans = 0;\\n for (int i = 0; i < n; i++) cin >> A[i];\\n for (int i = 0; i < 6; i++) p[i] = 1;\\n for (int i = 6; i < 15; i++) p[i] = 0;\\n do {\\n int it = 0;\\n for (int i = 0; i < n; i++) if (p[i] == 1) q[it++] = i;\\n do {\\n int a = A[q[0]];\\n int b = A[q[1]];\\n int c = A[q[2]];\\n int d = A[q[3]];\\n int e = A[q[4]];\\n int f = A[q[5]];\\n if (f1(a, b, c) && f1(a, e, f) && f1(b, f, d) && f1(c, d, e))\\n ans = max(ans, f2(a, b, c, d, e, f));\\n } while (next_permutation(q, q + 6));\\n } while (prev_permutation(p, p + n));\\n cout << setprecision(6) << fixed << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2970,\n \"memory_kb\": 3516,\n \"score_of_the_acc\": -0.5074,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2060_9722826\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\n\\nint s[3];\\n\\nbool f1(int a, int b, int c) {\\n s[0] = a, s[1] = b, s[2] = c;\\n sort(s, s + 3);\\n return s[0] + s[1] > s[2];\\n}\\n\\ndouble f2(double l1, double l2, double l3, double l4, double l5, double l6) {\\n double X = (l6 - l1 + l5) * (l1 + l5 + l6);\\n double x = (l1 - l5 + l6) * (l5 - l6 + l1);\\n double Y = (l4 - l2 + l6) * (l2 + l6 + l4);\\n double y = (l2 - l6 + l4) * (l6 - l4 + l2);\\n double Z = (l5 - l3 + l4) * (l3 + l4 + l5);\\n double z = (l3 - l4 + l5) * (l4 - l5 + l3);\\n double a = sqrt(x * Y * Z);\\n double b = sqrt(y * Z * X);\\n double c = sqrt(z * X * Y);\\n double d = sqrt(x * y * z);\\n return sqrt((-a + b + c + d) * (a - b + c + d) * (a + b - c + d) * (a + b + c - d)) / (192 * l4 * l5 * l6);\\n}\\n\\nint A[15], p[15], q[6];\\n\\nsigned main() {\\n int n;\\n while (cin >> n) {\\n if (!n) break;\\n double ans = 0;\\n for (int i = 0; i < n; i++) cin >> A[i];\\n for (int i = 0; i < 6; i++) p[i] = 1;\\n for (int i = 6; i < 15; i++) p[i] = 0;\\n do {\\n int it = 0;\\n for (int i = 0; i < n; i++) if (p[i] == 1) q[it++] = i;\\n do {\\n int a = A[q[0]];\\n int b = A[q[1]];\\n int c = A[q[2]];\\n int d = A[q[3]];\\n int e = A[q[4]];\\n int f = A[q[5]];\\n if (f1(a, b, c) && f1(a, e, f) && f1(b, f, d) && f1(c, d, e))\\n ans = max(ans, f2(a, b, c, d, e, f));\\n } while (next_permutation(q, q + 5));\\n } while (prev_permutation(p, p + n));\\n cout << setprecision(6) << fixed << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -0.0899,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2060_6826168\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define all(x) (x).begin(), (x).end()\\n\\nbool tri(int a, int b, int c) {\\n\\tvector<int> v = { a, b, c };\\n\\tsort(all(v));\\n\\treturn v[0] + v[1] > v[2];\\n}\\n\\ndouble vol(int U, int V, int W, int u, int v, int w) {\\n\\tdouble X = (w - U + v) * (U + v + w),\\n\\t\\tY = (u - V + w) * (V + w + u),\\n\\t\\tZ = (v - W + u) * (W + u + v);\\n\\tdouble x = (U - v + w) * (v - w + U),\\n\\t\\ty = (V - w + u) * (w - u + V),\\n\\t\\tz = (W - u + v) * (u - v + W);\\n\\tdouble k = sqrt(x * Y * Z),\\n\\t\\te = sqrt(y * Z * X),\\n\\t\\tt = sqrt(z * X * Y),\\n\\t\\tl = sqrt(x * y * z);\\n\\treturn sqrt((k + e + t - l) * (l + k + e - t) * (e + t + l - k) * (t + l + k - e)) / (192 * u * v * w);\\n}\\n\\nint main() {\\n\\tcin.tie(0);\\n\\tios_base::sync_with_stdio(0);\\n\\n\\twhile (true) {\\n\\t\\tint n; cin >> n;\\n\\t\\tif (!n) break;\\n\\t\\tvector<int> a(n);\\n\\t\\tfor (auto& i : a) cin >> i;\\n\\n\\t\\tvector<bool> p(n);\\n\\t\\tfill(p.begin(), p.begin() + 6, true);\\n\\t\\tdouble ans = .0;\\n\\t\\tdo {\\n\\t\\t\\tvector<int> q;\\n\\t\\t\\tint c = 0;\\n\\t\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\t\\tif (p[i]) q.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\tdo {\\n\\t\\t\\t\\tint U = a[q[0]], V = a[q[1]], W = a[q[2]];\\n\\t\\t\\t\\tint u = a[q[3]], v = a[q[4]], w = a[q[5]];\\n\\t\\t\\t\\tif (tri(U, V, W) && tri(u, v, W) && tri(v, w, U) && tri(w, u, V)) {\\n\\t\\t\\t\\t\\tans = max(ans, vol(U, V, W, u, v, w));\\n\\t\\t\\t\\t}\\n\\t\\t\\t} while (next_permutation(all(q) - 1));\\n\\t\\t} while (prev_permutation(all(p)));\\n\\t\\tcout << fixed << setprecision(10) << ans << '\\\\n';\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 860,\n \"memory_kb\": 3620,\n \"score_of_the_acc\": -0.154,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2060_5500450\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 4000005\\n\\nint N,num_data;\\nint table[SIZE][6],work[6],tri[4][3] = {{0,1,2},{0,3,4},{1,4,5},{2,5,3}};\\ndouble A[20];\\nbool used[20];\\n\\nvoid dfs(int index){\\n\\n\\tif(index == 6){\\n\\n\\t\\tfor(int i = 0; i < 6; i++){\\n\\n\\t\\t\\ttable[num_data][i] = work[i];\\n\\t\\t}\\n\\t\\tnum_data++;\\n\\n\\t\\treturn;\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(used[i])continue;\\n\\t\\tused[i] = true;\\n\\n\\t\\twork[index] = i;\\n\\n\\t\\tdfs(index+1);\\n\\t\\tused[i] = false;\\n\\t}\\n}\\n\\n//三角形が作れるか\\nbool check(int table[3]){\\n\\n\\tsort(table,table+3);\\n\\n\\treturn (table[0]+table[1] > table[2]+EPS);\\n}\\n\\ndouble yogen(double a,double b, double c){\\n\\n\\tdouble ret = (b*b+c*c-a*a)/(2*b*c);\\n\\treturn ret;\\n}\\n\\ndouble calc_V(int index){\\n\\n\\tdouble a = A[table[index][3]];\\n\\tdouble b = A[table[index][4]];\\n\\tdouble c = A[table[index][5]];\\n\\n\\tdouble alpha = yogen(A[table[index][0]],A[table[index][3]],A[table[index][4]]);\\n\\tdouble beta = yogen(A[table[index][1]],A[table[index][4]],A[table[index][5]]);\\n\\tdouble gamma = yogen(A[table[index][2]],A[table[index][5]],A[table[index][3]]);\\n\\n\\tdouble V = (a*b*c)/6.0*sqrt(1+2*alpha*beta*gamma-(alpha*alpha + beta*beta + gamma*gamma));\\n\\n\\treturn V;\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf\\\",&A[i]);\\n\\t}\\n\\tnum_data = 0;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tused[i] = false;\\n\\t}\\n\\n\\tdfs(0);\\n\\n\\tdouble ans = 0;\\n\\n\\tfor(int i = 0; i < num_data; i++){\\n\\n\\t\\tint TMP[3];\\n\\n\\t\\tbool FLG = true;\\n\\n\\t\\tfor(int k = 0; k < 4; k++){\\n\\t\\t\\tfor(int p = 0; p < 3; p++){\\n\\n\\t\\t\\t\\tTMP[p] = A[table[i][tri[k][p]]];\\n\\t\\t\\t}\\n\\t\\t\\tif(!check(TMP)){\\n\\n\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!FLG)continue;\\n\\n\\t\\tdouble tmp_V = calc_V(i);\\n\\t\\tans = max(ans,tmp_V);\\n\\t}\\n\\n\\tprintf(\\\"%.12lf\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3580,\n \"memory_kb\": 87688,\n \"score_of_the_acc\": -1.5815,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2060_3062329\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <array>\\nusing namespace std;\\nconst double EPS = 1e-8;\\nconst double INF = 1e12;\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\n\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\nstruct L : array<P, 2>{\\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\\n L(){}\\n};\\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 bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\nint ccw(P a, P b, P c){\\n b -= a;\\n c -= a;\\n if(cross(b,c) > EPS) return +1; //ccw\\n if(cross(b,c) < -EPS) return -1; //cw\\n if(dot(b,c) < -EPS) return +2; //c-a-b\\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\\n return 0; //a-c-b\\n}\\nP unit(const P &p){\\n return p/abs(p);\\n}\\n\\nP crosspointLL(const L &l, const L &m) {\\n double A = cross(l[1]-l[0], m[1]-m[0]);\\n double B = cross(l[1]-l[0], l[1]-m[0]);\\n return m[0] + B/A *(m[1]-m[0]);\\n}\\n\\nint main(){\\n while(1){\\n int n;\\n cin >> n;\\n if(n==0) break;\\n\\n vector<double> len(n);\\n for(int i=0; i<n; i++){\\n cin >> len[i];\\n }\\n vector<bool> choose(n, false);\\n for(int i=0; i<3; i++){\\n choose[n-i-1] = true;\\n }\\n\\n double ans = 0;\\n do{\\n //底面を作る3角形の選び方\\n vector<double> base;\\n for(int i=0; i<n; i++){\\n if(choose[i]) base.push_back(len[i]);\\n }\\n sort(base.begin(), base.end());\\n if(base[0] +base[1] < base[2] +EPS) continue;\\n\\n P p[3];\\n p[0] = P(0, 0);\\n p[1] = P(base[0], 0);\\n double c2x = (base[2]*base[2] -base[1]*base[1] +base[0]*base[0]) /(2*base[0]);\\n double c2y = sqrt(base[2]*base[2] -c2x*c2x);\\n p[2] = P(c2x, c2y);\\n\\n //底面から生やす辺の選び方\\n for(int i=0; i<n; i++){\\n if(choose[i]) continue;\\n for(int j=0; j<n; j++){\\n if(choose[j] || j==i) continue;\\n for(int k=0; k<n; k++){\\n if(choose[k] || k==i || k==j) continue;\\n //3角形が作れるか\\n bool ok = true;\\n double hlen[3] = {len[i], len[j], len[k]};\\n L lines[3];\\n for(int d=0; d<3; d++){\\n if(hlen[d] +hlen[(d+1)%3] < base[d] || abs(hlen[d] -hlen[(d+1)%3]) > base[d]){\\n ok = false;\\n break;\\n }\\n double dist = (hlen[d]*hlen[d] -hlen[(d+1)%3]*hlen[(d+1)%3] +base[d]*base[d]) /(2*base[d]);\\n P dir = dist * unit(p[(d+1)%3] -p[d]);\\n lines[d][0] = p[d] +dir;\\n lines[d][1] = lines[d][0] +dir *P(0, 1);\\n }\\n if(ok){\\n P cp1 = crosspointLL(lines[0], lines[1]);\\n double h = sqrt(hlen[0]*hlen[0] -norm(cp1));\\n ans = max(ans, cross(p[1], p[2]) *h /6);\\n }\\n }\\n }\\n }\\n }while(next_permutation(choose.begin(), choose.end()));\\n\\n cout << fixed << setprecision(10);\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.0671,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2060_2863144\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\nbool tri_valid(int a, int b, int c) {\\n\\tvector<int>v{ a,b,c };\\n\\tsort(v.begin(),v.end());\\n\\treturn v[2]<v[0]+v[1];\\n}\\n\\nld get_theta(ld a1, ld a2, ld x) {\\n\\treturn (a1*a1+a2*a2-x*x)/(2*a1*a2);\\n}\\n\\nint main() {\\n\\tcout<<setprecision(10)<<fixed;\\n\\twhile (true){\\n\\t\\tint N;cin>>N;\\n\\t\\tif(!N)break;\\n\\t\\tvector<int>sticks(N);\\n\\t\\tfor(int i=0;i<N;++i)cin>>sticks[i];\\n\\n\\t\\tvector<int>av(6);\\n\\t\\tld ans=0;\\n\\t\\tfor (av[0] = 0; av[0] < N; ++av[0]) {\\n\\t\\t\\tfor ( av[1] = av[0]+1; av[1] < N; ++av[1]) {\\n\\t\\t\\t\\tfor ( av[2] = av[1]+1; av[2] < N; ++av[2]) {\\n\\t\\t\\t\\t\\tfor (av[3] = 0; av[3] < N; ++av[3]) {\\n\\t\\t\\t\\t\\t\\tfor ( av[4] = 0; av[4] < N; ++av[4]) {\\n\\t\\t\\t\\t\\t\\t\\tfor ( av[5] = 0; av[5] < N; ++av[5]) {\\n\\t\\t\\t\\t\\t\\t\\t\\tbool ok=true;\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (int i = 0; i < 6; ++i) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (int j = i + 1; j < 6; ++j) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif(av[i]==av[j])ok=false;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\tif(!ok)continue;\\n\\t\\t\\t\\t\\t\\t\\t\\tvector<int>v(6);\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int i=0;i<6;++i)v[i]=sticks[av[i]];\\n\\t\\t\\t\\t\\t\\t\\t\\tif(!tri_valid(v[0],v[1],v[2]))ok=false;\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(!tri_valid(v[i],v[3+(i+1)%3],v[3+(i+2)%3]))ok=false;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\tif(!ok)continue;\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tvector<ld>thetas(3);\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tthetas[i]=get_theta(v[3+(i+1)%3],v[3+(i+2)%3],v[i]);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tld num=1+2*thetas[0]*thetas[1]*thetas[2]-(pow(thetas[0],2)+pow(thetas[1],2)+pow(thetas[2],2));\\n\\t\\t\\t\\t\\t\\t\\t\\tif (num > 0) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tans=max(ans,v[3]*v[4]*v[5]*sqrt(num)/6.0);\\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\\tcout<<ans<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3240,\n \"memory_kb\": 3112,\n \"score_of_the_acc\": -0.5481,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2060_2585981\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define EPS (1e-10)\\nusing Int = long long;\\n\\n//BEGIN CUT HERE\\ntypedef vector<double> arr;\\ntypedef vector<arr> mat;\\n\\ndouble det(mat A){\\n int n=A.size();\\n double res=1;\\n for(int i=0;i<n;i++){\\n int pivot=i;\\n for(int j=i+1;j<n;j++)\\n if(abs(A[j][i])>abs(A[pivot][i])) pivot=j;\\n swap(A[pivot],A[i]);\\n res*=A[i][i]*(i!=pivot?-1:1);\\n if(abs(A[i][i])<EPS) break;\\n for(int j=i+1;j<n;j++)\\n for(int k=n-1;k>=i;k--)\\n\\tA[j][k]-=A[i][k]*A[j][i]/A[i][i];\\n }\\n return res;\\n}\\n\\nbool isTriangle(double a1,double a2,double a3){\\n if(a1+a2<=a3||a2+a3<=a1||a3+a1<=a2) return 0;\\n return 1;\\n}\\ndouble tetrahedra(double OA,double OB,double OC,double AB,double AC,double BC){\\n if(!isTriangle(OA,OB,AB)) return 0;\\n if(!isTriangle(OB,OC,BC)) return 0;\\n if(!isTriangle(OC,OA,AC)) return 0;\\n if(!isTriangle(AB,AC,BC)) return 0;\\n mat A(5,arr(5,0));\\n A[0][0]= 0;A[0][1]=AB*AB;A[0][2]=AC*AC;A[0][3]=OA*OA;A[0][4]=1;\\n A[1][0]=AB*AB;A[1][1]= 0;A[1][2]=BC*BC;A[1][3]=OB*OB;A[1][4]=1;\\n A[2][0]=AC*AC;A[2][1]=BC*BC;A[2][2]= 0;A[2][3]=OC*OC;A[2][4]=1;\\n A[3][0]=OA*OA;A[3][1]=OB*OB;A[3][2]=OC*OC;A[3][3]= 0;A[3][4]=1;\\n A[4][0]= 1;A[4][1]= 1;A[4][2]= 1;A[4][3]= 1;A[4][4]=0;\\n //cout<<\\\"det(A):\\\"<<det(A)<<endl;\\n if(det(A)<=0) return 0; \\n return sqrt(det(A)/288.0);\\n}\\n//END CUT HERE\\n\\nsigned main(){\\n int n;\\n while(cin>>n,n){\\n double a[n];\\n double ans=0;\\n for(int i=0;i<n;i++) cin>>a[i];\\n for(int i=0;i<n;i++){\\n for(int j=i+1;j<n;j++){\\n\\tfor(int k=j+1;k<n;k++){\\n\\t for(int x=0;x<n;x++){\\n\\t if(i==x||j==x||k==x) continue;\\n\\t for(int y=0;y<n;y++){\\n\\t if(i==y||j==y||k==y||x==y) continue;\\n\\t for(int z=0;z<n;z++){\\n\\t\\tif(i==z||j==z||k==z||x==z||y==z) continue;\\n\\t\\tans=max(ans,tetrahedra(a[i],a[j],a[k],a[x],a[y],a[z]));\\n\\t }\\n\\t }\\n\\t }\\n\\t}\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\",ans);\\n }\\n return 0;\\n}\\n\\n\\n/*\\nverified on 2017/04/26\\nhttp://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2060\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 1820,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -0.3105,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2060_2285200\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define EPS (1e-10)\\n#define int long long\\n\\ntypedef vector<double> arr;\\ntypedef vector<arr> mat;\\n\\ndouble det(mat A){\\n int n=A.size();\\n double res=1;\\n for(int i=0;i<n;i++){\\n int pivot=i;\\n for(int j=i+1;j<n;j++)\\n if(abs(A[j][i])>abs(A[pivot][i])) pivot=j;\\n swap(A[pivot],A[i]);\\n res*=A[i][i]*(i!=pivot?-1:1);\\n if(abs(A[i][i])<EPS) break;\\n for(int j=i+1;j<n;j++)\\n for(int k=n-1;k>=i;k--)\\n\\tA[j][k]-=A[i][k]*A[j][i]/A[i][i];\\n }\\n return res;\\n}\\n\\nbool isTriangle(double a1,double a2,double a3){\\n if(a1+a2<=a3||a2+a3<=a1||a3+a1<=a2) return 0;\\n return 1;\\n}\\ndouble tetrahedra(double OA,double OB,double OC,double AB,double AC,double BC){\\n if(!isTriangle(OA,OB,AB)) return 0;\\n if(!isTriangle(OB,OC,BC)) return 0;\\n if(!isTriangle(OC,OA,AC)) return 0;\\n if(!isTriangle(AB,AC,BC)) return 0;\\n mat A(5,arr(5,0));\\n A[0][0]= 0;A[0][1]=AB*AB;A[0][2]=AC*AC;A[0][3]=OA*OA;A[0][4]=1;\\n A[1][0]=AB*AB;A[1][1]= 0;A[1][2]=BC*BC;A[1][3]=OB*OB;A[1][4]=1;\\n A[2][0]=AC*AC;A[2][1]=BC*BC;A[2][2]= 0;A[2][3]=OC*OC;A[2][4]=1;\\n A[3][0]=OA*OA;A[3][1]=OB*OB;A[3][2]=OC*OC;A[3][3]= 0;A[3][4]=1;\\n A[4][0]= 1;A[4][1]= 1;A[4][2]= 1;A[4][3]= 1;A[4][4]=0;\\n //cout<<\\\"det(A):\\\"<<det(A)<<endl;\\n if(det(A)<=0) return 0; \\n return sqrt(det(A)/288.0);\\n}\\nsigned main(){\\n int n;\\n while(cin>>n,n){\\n double a[n];\\n double ans=0;\\n for(int i=0;i<n;i++) cin>>a[i];\\n for(int i=0;i<n;i++){\\n for(int j=i+1;j<n;j++){\\n\\tfor(int k=j+1;k<n;k++){\\n\\t for(int x=0;x<n;x++){\\n\\t if(i==x||j==x||k==x) continue;\\n\\t for(int y=0;y<n;y++){\\n\\t if(i==y||j==y||k==y||x==y) continue;\\n\\t for(int z=0;z<n;z++){\\n\\t\\tif(i==z||j==z||k==z||x==z||y==z) continue;\\n\\t\\tans=max(ans,tetrahedra(a[i],a[j],a[k],a[x],a[y],a[z]));\\n\\t }\\n\\t }\\n\\t }\\n\\t}\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\",ans);\\n }\\n return 0;\\n}\\n\\n\\n/*\\nverified on 2017/04/26\\nhttp://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2060\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 1780,\n \"memory_kb\": 3080,\n \"score_of_the_acc\": -0.3024,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2060_2280286\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define EPS (1e-10)\\n#define int long long\\n\\ntypedef vector<double> arr;\\ntypedef vector<arr> mat;\\n\\ndouble det(mat A){\\n int n=A.size();\\n double res=1;\\n for(int i=0;i<n;i++){\\n int pivot=i;\\n for(int j=i+1;j<n;j++)\\n if(abs(A[j][i])>abs(A[pivot][i])) pivot=j;\\n swap(A[pivot],A[i]);\\n res*=A[i][i]*(i!=pivot?-1:1);\\n if(abs(A[i][i])<EPS) break;\\n for(int j=i+1;j<n;j++)\\n for(int k=n-1;k>=i;k--)\\n\\tA[j][k]-=A[i][k]*A[j][i]/A[i][i];\\n }\\n return res;\\n}\\n\\nbool tri(double a1,double a2,double a3){\\n if(a1+a2<=a3||a2+a3<=a1||a3+a1<=a2) return 1;\\n return 0;\\n}\\ndouble tetrahedra(double OA,double OB,double OC,double AB,double AC,double BC){\\n if(tri(OA,OB,AB)) return 0;\\n if(tri(OB,OC,BC)) return 0;\\n if(tri(OC,OA,AC)) return 0;\\n if(tri(AB,AC,BC)) return 0;\\n mat A(5,arr(5,0));\\n A[0][0]= 0;A[0][1]=AB*AB;A[0][2]=AC*AC;A[0][3]=OA*OA;A[0][4]=1;\\n A[1][0]=AB*AB;A[1][1]= 0;A[1][2]=BC*BC;A[1][3]=OB*OB;A[1][4]=1;\\n A[2][0]=AC*AC;A[2][1]=BC*BC;A[2][2]= 0;A[2][3]=OC*OC;A[2][4]=1;\\n A[3][0]=OA*OA;A[3][1]=OB*OB;A[3][2]=OC*OC;A[3][3]= 0;A[3][4]=1;\\n A[4][0]= 1;A[4][1]= 1;A[4][2]= 1;A[4][3]= 1;A[4][4]=0;\\n //cout<<\\\"det(A):\\\"<<det(A)<<endl;\\n if(det(A)<=0) return 0; \\n return sqrt(det(A)/288.0);\\n}\\nsigned main(){\\n int n;\\n while(cin>>n,n){\\n double a[n];\\n double ans=0;\\n for(int i=0;i<n;i++) cin>>a[i];\\n for(int i=0;i<n;i++){\\n for(int j=i+1;j<n;j++){\\n\\tfor(int k=j+1;k<n;k++){\\n\\t for(int x=0;x<n;x++){\\n\\t if(i==x||j==x||k==x) continue;\\n\\t for(int y=0;y<n;y++){\\n\\t if(i==y||j==y||k==y||x==y) continue;\\n\\t for(int z=0;z<n;z++){\\n\\t\\tif(i==z||j==z||k==z||x==z||y==z) continue;\\n\\t\\tans=max(ans,tetrahedra(a[i],a[j],a[k],a[x],a[y],a[z]));\\n\\t }\\n\\t }\\n\\t }\\n\\t}\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1790,\n \"memory_kb\": 3256,\n \"score_of_the_acc\": -0.3061,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2060_2276503\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef complex<double> P;\\ntypedef pair<P,double> C;\\ntypedef pair<P,P> L;\\n \\nconst double eps=1e-8;\\n \\nbool eq(double a,double b){\\n return -eps<a-b&&a-b<eps;\\n}\\n \\ndouble cross(P a,P b){\\n return imag(b*conj(a));\\n}\\n \\nbool isCrossCC(C a,C b){\\n double ar=a.second, br=b.second;\\n double dist=abs(a.first-b.first);\\n if( dist > ar+br+eps)return false;\\n if( dist > ar+br-eps )return true;\\n if( dist > abs(ar-br)+eps)return true;\\n if( dist > abs(ar-br)-eps)return true;\\n return false;\\n}\\n \\ndouble Sqrt(double x){\\n if(x<0)return 0;\\n return sqrt(x);\\n}\\n \\nP reflect(P a,P b,P c){\\n b-=a;\\n c-=a;\\n return a+ conj(c/b)*b;\\n}\\n \\nP getCrossCC(C a,C b){\\n P p1=a.first,p2=b.first;\\n double r1=a.second, r2=b.second;\\n double cA = (r1*r1+norm(p1-p2)-r2*r2) / (2.0*r1*abs(p1-p2));\\n return p1+(p2-p1)/abs(p1-p2)*r1*P(cA, Sqrt(1.0-cA*cA) );\\n}\\n \\nint n;\\nint t[15];\\nint u[6];\\nbool used[15];\\ndouble ans=-1;\\n \\ndouble calcArea(double a,double b,double c){\\n P p1=P(0,0);\\n P p2=P(b,0);\\n P p3=getCrossCC( C(p1,a) , C(p2,c) );\\n return abs( cross( p1-p3 , p2-p3 )*0.5 );\\n}\\n \\nP getCrossLL(L line0,L line1){\\n P a=line0.first, b=line0.second;\\n P c=line1.first, d=line1.second;\\n a-=d;b-=d;c-=d;\\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\\n}\\n \\nbool check(int a,int b,int c){\\n if(a<b)swap(a,b);\\n if(b<c)swap(b,c);\\n if(a<b)swap(a,b);\\n return ( a < b + c );\\n}\\n \\n \\nvoid check(){\\n \\n \\n double S=calcArea(u[0],u[1],u[2]);\\n \\n double h=1e9;\\n \\n C ca = C( P(0,0) , u[4] );\\n C cb = C( P(u[1],0) , u[5] );\\n C cc = C( getCrossCC( C(ca.first,u[0]) , C(cb.first,u[2]) ) , u[3] );\\n \\n if( isCrossCC(ca,cb) == false )return;\\n if( isCrossCC(cc,cb) == false )return;\\n if( isCrossCC(ca,cc) == false )return;\\n \\n L fi = L( getCrossCC(ca,cb) , getCrossCC(cb,ca) );\\n if( abs(fi.second-fi.first ) < eps )return;\\n \\n L se = L( getCrossCC(cc,ca) , getCrossCC(ca,cc) );\\n if( abs(se.second-se.first ) < eps )return;\\n \\n \\n L th = L( getCrossCC(cc,cb) , getCrossCC(cb,cc) );\\n \\n P target=getCrossLL(fi,se);\\n \\n P target2 = getCrossLL( th,se);\\n if( abs(target-target2) > eps )return;\\n \\n double di;\\n \\n di=abs(P(0,0)-target);\\n double Ah=min(h, Sqrt(u[4]*u[4]-di*di) );\\n \\n di=abs(P(u[1],0)-target);\\n double Bh=min(h, Sqrt(u[5]*u[5]-di*di) );\\n \\n di=abs(cc.first-target);\\n double Ch=min(h, Sqrt(cc.second*cc.second-di*di) );\\n if( !eq(Ah,Ch) )return;\\n if( !eq(Ah,Bh) )return;\\n if( !eq(Bh,Ch) )return;\\n h=min( Ah, Bh);\\n h=min( h, Ah);\\n \\n ans=max(ans, h*S/3.0);\\n}\\n \\nvoid dfs(int cnt){\\n if(cnt>=3 && !check(u[0],u[1],u[2]))return;\\n if(cnt>=5 && !check(u[0],u[3],u[4]))return;\\n if(cnt>=6 && !check(u[1],u[4],u[5]))return;\\n if(cnt>=6 && !check(u[2],u[3],u[5]))return;\\n \\n if(cnt==6){\\n check();\\n }else{\\n for(int i=0;i<n;i++){\\n if(used[i])continue;\\n used[i]=true;\\n u[cnt]=t[i];\\n dfs(cnt+1);\\n used[i]=false;\\n }\\n }\\n}\\n \\nint main(){\\n while(1){\\n scanf(\\\"%d\\\",&n);\\n if(n==0)break;\\n \\n for(int i=0;i<n;i++){\\n scanf(\\\"%d\\\",&t[i]);\\n }\\n \\n sort(t,t+n);\\n \\n memset(used,false,sizeof(used));\\n ans=-1;\\n dfs(0);\\n printf(\\\"%.10f\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6070,\n \"memory_kb\": 3304,\n \"score_of_the_acc\": -1.026,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2060_2275914\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef complex<double> P;\\ntypedef pair<P,double> C;\\ntypedef pair<P,P> L;\\n\\nconst double eps=1e-8;\\n\\nbool eq(double a,double b){\\n return -eps<a-b&&a-b<eps;\\n}\\n\\ndouble cross(P a,P b){\\n return imag(b*conj(a));\\n}\\n\\nbool isCrossCC(C a,C b){\\n double ar=a.second, br=b.second;\\n double dist=abs(a.first-b.first);\\n if( dist > ar+br+eps)return false;\\n if( dist > ar+br-eps )return true;\\n if( dist > abs(ar-br)+eps)return true;\\n if( dist > abs(ar-br)-eps)return true;\\n return false;\\n}\\n\\ndouble Sqrt(double x){\\n if(x<0)return 0;\\n return sqrt(x);\\n}\\n\\nP reflect(P a,P b,P c){\\n b-=a;\\n c-=a;\\n return a+ conj(c/b)*b;\\n}\\n\\nP getCrossCC(C a,C b){\\n P p1=a.first,p2=b.first;\\n double r1=a.second, r2=b.second;\\n double cA = (r1*r1+norm(p1-p2)-r2*r2) / (2.0*r1*abs(p1-p2));\\n return p1+(p2-p1)/abs(p1-p2)*r1*P(cA, Sqrt(1.0-cA*cA) );\\n}\\n\\nint n;\\nint t[15];\\nint u[6];\\nbool used[15];\\ndouble ans=-1;\\n\\ndouble calcArea(double a,double b,double c){\\n P p1=P(0,0);\\n P p2=P(b,0);\\n P p3=getCrossCC( C(p1,a) , C(p2,c) );\\n return abs( cross( p1-p3 , p2-p3 )*0.5 );\\n}\\n\\nP getCrossLL(L line0,L line1){\\n P a=line0.first, b=line0.second;\\n P c=line1.first, d=line1.second;\\n a-=d;b-=d;c-=d;\\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\\n}\\n\\nbool check(int a,int b,int c){\\n if(a<b)swap(a,b);\\n if(b<c)swap(b,c);\\n if(a<b)swap(a,b);\\n return ( a < b + c );\\n}\\n\\n\\nvoid check(){\\n\\n \\n double S=calcArea(u[0],u[1],u[2]);\\n\\n double h=1e9;\\n \\n C ca = C( P(0,0) , u[4] );\\n C cb = C( P(u[1],0) , u[5] );\\n C cc = C( getCrossCC( C(ca.first,u[0]) , C(cb.first,u[2]) ) , u[3] );\\n\\n if( isCrossCC(ca,cb) == false )return;\\n if( isCrossCC(cc,cb) == false )return;\\n if( isCrossCC(ca,cc) == false )return;\\n \\n L fi = L( getCrossCC(ca,cb) , getCrossCC(cb,ca) );\\n if( abs(fi.second-fi.first ) < eps )return;\\n \\n L se = L( getCrossCC(cc,ca) , getCrossCC(ca,cc) );\\n if( abs(se.second-se.first ) < eps )return;\\n \\n\\n L th = L( getCrossCC(cc,cb) , getCrossCC(cb,cc) );\\n \\n P target=getCrossLL(fi,se);\\n\\n P target2 = getCrossLL( th,se);\\n if( abs(target-target2) > eps )return;\\n \\n double di;\\n \\n di=abs(P(0,0)-target);\\n double Ah=min(h, Sqrt(u[4]*u[4]-di*di) );\\n\\n di=abs(P(u[1],0)-target);\\n double Bh=min(h, Sqrt(u[5]*u[5]-di*di) );\\n\\n di=abs(cc.first-target);\\n double Ch=min(h, Sqrt(cc.second*cc.second-di*di) );\\n if( !eq(Ah,Ch) )return;\\n if( !eq(Ah,Bh) )return;\\n if( !eq(Bh,Ch) )return;\\n h=min( Ah, Bh);\\n h=min( h, Ah);\\n\\n ans=max(ans, h*S/3.0);\\n}\\n\\nvoid dfs(int cnt){\\n if(cnt>=3 && !check(u[0],u[1],u[2]))return;\\n if(cnt>=5 && !check(u[0],u[3],u[4]))return;\\n if(cnt>=6 && !check(u[1],u[4],u[5]))return;\\n if(cnt>=6 && !check(u[2],u[3],u[5]))return;\\n \\n if(cnt==6){\\n check();\\n }else{\\n for(int i=0;i<n;i++){\\n if(used[i])continue;\\n used[i]=true;\\n u[cnt]=t[i];\\n dfs(cnt+1);\\n used[i]=false;\\n }\\n }\\n}\\n\\nint main(){\\n while(1){\\n scanf(\\\"%d\\\",&n);\\n if(n==0)break;\\n \\n for(int i=0;i<n;i++){\\n scanf(\\\"%d\\\",&t[i]);\\n }\\n\\n sort(t,t+n);\\n \\n memset(used,false,sizeof(used));\\n ans=-1;\\n dfs(0);\\n printf(\\\"%.10f\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6070,\n \"memory_kb\": 3324,\n \"score_of_the_acc\": -1.0262,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2060_1882430\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define MAX_N 15\\n \\nbool isTri(double a,double b,double c){\\n if(c < a+b && a < b+c && b < c+a){\\n\\treturn true;\\n }\\n return false;\\n}\\n \\ndouble getArea(double a,double b,double c){\\n double s = (a+b+c)/2.0;\\n return sqrt(s*(s-a)*(s-b)*(s-c)); \\n}\\n \\ndouble S(double x){\\n return x*x;\\n}\\n \\ndouble calc(vector<double> &v){\\n double a = S(v[0])*S(v[4])*(S(v[1])+S(v[2])+S(v[3])+S(v[5])-S(v[0])-S(v[4]));\\n double b = S(v[1])*S(v[5])*(S(v[0])+S(v[2])+S(v[3])+S(v[4])-S(v[1])-S(v[5]));\\n double c = S(v[2])*S(v[3])*(S(v[0])+S(v[1])+S(v[4])+S(v[5])-S(v[2])-S(v[3]));\\n double d = -S(v[0])*S(v[1])*S(v[3])-(S(v[1])*S(v[2]))*S(v[4])-\\n\\tS(v[0])*S(v[2])*S(v[5])-S(v[3])*S(v[4])*S(v[5]);\\n return sqrt((a+b+c+d)/144.0);\\n}\\n \\ndouble getVolume(vector<double> &v){\\n if(!isTri(v[0],v[1],v[3])) return 0.0; \\n if(!isTri(v[0],v[2],v[5])) return 0.0; \\n if(!isTri(v[1],v[2],v[4])) return 0.0; \\n if(!isTri(v[3],v[4],v[5])) return 0.0; \\n return calc(v);\\n}\\n \\ndouble solve(int S,vector<double> &v,vector<double> &a){\\n if(__builtin_popcount(S) == 6){\\n\\treturn getVolume(v);\\n }\\n double res = 0;\\n for(int i = 0 ; i < (int)a.size() ; i++){\\n\\tif((S >> i) & 1) continue;\\n\\tv.push_back(a[i]);\\n\\tres = max(res,solve(S|(1<<i),v,a));\\n\\tv.pop_back();\\n }\\n return res;\\n}\\n \\nint main(){\\n int N;\\n while(cin >> N,N){\\n\\tvector<double> a(N),v;\\n\\tfor(int i = 0 ; i < N ; i++){\\n\\t cin >> a[i];\\n\\t}\\n\\tprintf(\\\"%.10f\\\\n\\\",solve(0,v,a));\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1550,\n \"memory_kb\": 3200,\n \"score_of_the_acc\": -0.2651,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2060_1255269\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define MAX_N 15\\n \\nbool isTri(double a,double b,double c){\\n if(c < a+b && a < b+c && b < c+a){\\n return true;\\n }\\n return false;\\n}\\n \\ndouble getArea(double a,double b,double c){\\n double s = (a+b+c)/2.0;\\n return sqrt(s*(s-a)*(s-b)*(s-c)); \\n}\\n \\ndouble S(double x){\\n return x*x;\\n}\\n \\ndouble calc(vector<double> &v){\\n double a = S(v[0])*S(v[4])*(S(v[1])+S(v[2])+S(v[3])+S(v[5])-S(v[0])-S(v[4]));\\n double b = S(v[1])*S(v[5])*(S(v[0])+S(v[2])+S(v[3])+S(v[4])-S(v[1])-S(v[5]));\\n double c = S(v[2])*S(v[3])*(S(v[0])+S(v[1])+S(v[4])+S(v[5])-S(v[2])-S(v[3]));\\n double d = -S(v[0])*S(v[1])*S(v[3])-(S(v[1])*S(v[2]))*S(v[4])-\\n S(v[0])*S(v[2])*S(v[5])-S(v[3])*S(v[4])*S(v[5]);\\n return sqrt((a+b+c+d)/144.0);\\n}\\n \\ndouble getVolume(vector<double> &v){\\n if(!isTri(v[0],v[1],v[3])){ return 0.0; }\\n if(!isTri(v[0],v[2],v[5])){ return 0.0; }\\n if(!isTri(v[1],v[2],v[4])){ return 0.0; }\\n if(!isTri(v[3],v[4],v[5])){ return 0.0; }\\n return calc(v);\\n}\\n \\ndouble solve(int S,vector<double> &v,vector<double> &a){\\n if(__builtin_popcount(S) == 6){\\n return getVolume(v);\\n }\\n double res = 0;\\n for(int i = 0 ; i < (int)a.size() ; i++){\\n if((S >> i) & 1){ continue; }\\n v.push_back(a[i]);\\n res = max(res,solve(S|(1<<i),v,a));\\n v.pop_back();\\n }\\n return res;\\n}\\n \\nint main(){\\n int N;\\n while(cin >> N,N){\\n vector<double> a(N),v;\\n for(int i = 0 ; i < N ; i++){\\n cin >> a[i];\\n }\\n printf(\\\"%.10f\\\\n\\\",solve(0,v,a));\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2440,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.3925,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2060_1155568\",\n \"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;\\nbool tri(int a, int b, int c) {\\n return a <= b + c && b <= c + a && c <= a + b;\\n}\\n\\ndouble calc(double a, double b, double c, double l, double m, double n) {\\n a *= a;\\n b *= b;\\n c *= c;\\n l *= l;\\n m *= m;\\n n *= n;\\n double tmp =\\n +a*l*(-a+b+c-l+m+n)\\n +b*m*(a-b+c+l-m+n)\\n +c*n*(a+b-c+l+m-n)\\n -l*b*c-a*m*c-a*b*n-l*m*n;\\n if(tmp < 0) return 0;\\n return sqrt(tmp) / 12;\\n}\\n\\nint main(){\\n int num;\\n while(cin >> num && num > 0) {\\n vector<int> v(num);\\n REP(i, num) cin >> v[i];\\n double ans = 0.0;\\n REP(i, num) REP(j, i) REP(k, j) {\\n int l = v[i], m = v[j], n = v[k];\\n if(!tri(l, m, n)) continue;\\n REP(p, num) if(p != i && p != j && p != k) \\n REP(q, num) if(q != p && q != i && q != j && q != k)\\n REP(r, num) if(r != q && r != p && r != i && r != j && r != k) {\\n int a = v[p], b = v[q], c = v[r];\\n if(!tri(a, b, n)) continue;\\n if(!tri(b, c, l)) continue;\\n if(!tri(c, a, m)) continue;\\n ans = max(ans, calc(a, b, c, l, m, n));\\n }\\n }\\n printf(\\\"%.12f\\\\n\\\", ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 1220,\n \"score_of_the_acc\": -0.0019,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2060_1123787\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <set>\\n#include <algorithm>\\n#include <complex>\\n#include <cstdio>\\nusing namespace std;\\n\\ndouble EPS = 1e-8;\\ntypedef complex<double> P,point;\\n\\nstruct C {P p; double r; C(const P &p,double r) : p(p), r(r){} C(){} };\\n\\n\\ntypedef double number;\\nconst number eps = 1e-8;\\ntypedef vector<number> Array;\\ntypedef vector<Array> matrix;\\n\\n// O( n )\\nmatrix identity(int n) {\\n matrix A(n, Array(n));\\n for (int i = 0; i < n; ++i) A[i][i] = 1;\\n return A;\\n}\\n// O( n )\\nnumber inner_product(const Array &a, const Array &b) {\\n number ans = 0;\\n for (int i = 0; i < a.size(); ++i)\\n ans += a[i] * b[i];\\n return ans;\\n}\\n// O( n^2 )\\nArray mul(const matrix &A, const Array &x) {\\n Array y(A.size());\\n for (int i = 0; i < A.size(); ++i)\\n for (int j = 0; j < A[0].size(); ++j)\\n y[i] = A[i][j] * x[j];\\n return y;\\n}\\n// O( n^3 )\\nmatrix mul(const matrix &A, const matrix &B) {\\n matrix C(A.size(), Array(B[0].size()));\\n for (int i = 0; i < C.size(); ++i)\\n for (int j = 0; j < C[i].size(); ++j)\\n for (int k = 0; k < A[i].size(); ++k)\\n C[i][j] += A[i][k] * B[k][j];\\n return C;\\n}\\n// O( n^3 log e )\\nmatrix pow(const matrix &A, int e) {\\n return e == 0 ? identity(A.size()) :\\n e % 2 == 0 ? pow(mul(A, A), e/2) : mul(A, pow(A, e-1));\\n}\\n// O( n^3 )\\nnumber det(matrix A) {\\n const int n = A.size();\\n number D = 1;\\n for (int i = 0; i < n; ++i) {\\n int pivot = i;\\n for (int j = i+1; j < n; ++j)\\n if (abs(A[j][i]) > abs(A[pivot][i])) pivot = j;\\n swap(A[pivot], A[i]);\\n D *= A[i][i] * (i != pivot ? -1 : 1);\\n if (abs(A[i][i]) < eps) break;\\n for(int j = i+1; j < n; ++j)\\n for(int k = n-1; k >= i; --k)\\n A[j][k] -= A[i][k] * A[j][i] / A[i][i];\\n }\\n return D;\\n}\\n// O(n)\\nnumber tr(const matrix &A) {\\n number ans = 0;\\n for (int i = 0; i < A.size(); ++i)\\n ans += A[i][i];\\n return ans;\\n}\\n// O( n^3 ).\\nint rank(matrix A) {\\n const int n = A.size(), m = A[0].size();\\n int r = 0;\\n for (int i = 0; r < n && i < m; ++i) {\\n int pivot = r;\\n for (int j = r+1; j < n; ++j)\\n if (abs(A[j][i]) > abs(A[pivot][i])) pivot = j;\\n swap(A[pivot], A[r]);\\n if (abs(A[r][i]) < eps) continue;\\n for (int k = m-1; k >= i; --k)\\n A[r][k] /= A[r][i];\\n for(int j = r+1; j < n; ++j)\\n for(int k = i; k < m; ++k)\\n A[j][k] -= A[r][k] * A[j][i];\\n ++r;\\n }\\n return r;\\n}\\n\\ndouble chk(double a,double b,double c){\\n\\tif( a > b ) swap(a,b);\\n\\tif( b > c ) swap(b,c);\\n\\tif( a > b ) swap(a,b);\\n\\treturn a + b >= c;\\n}\\ndouble calc(double a,double b,double c,double d,double e,double f){\\n\\tdouble x = a*a*d*d*(b*b+c*c+e*e+f*f-a*a-d*d)+b*b*e*e*(c*c+a*a+f*f+d*d-b*b-e*e)+c*c*f*f*(a*a+b*b+d*d+e*e-c*c-f*f)-a*a*b*b*c*c-a*a*e*e*f*f-d*d*b*b*f*f-d*d*e*e*c*c;\\n\\treturn x>0?sqrt(x / 144):0;\\n}\\nint main(){\\n\\tint N;\\n\\twhile(cin >> N && N){\\n\\t\\tvector<int> t(N);\\n\\t\\tdouble ans = 0;\\n\\t\\tvector<int> reflesh(6,0);\\n\\t\\t\\n\\t\\tint cnt = 0;\\n\\t\\t//cout << calc(P(0,0),P(0,1),P(1,1),1,1,1) << endl;\\n\\t\\tfor(int i = 0 ; i < N ; i++) cin >> t[i];\\n\\t\\tsort(t.begin(),t.end());\\n\\t\\tfor(int i = 0 ; i < (1<<N) ; i++){\\n\\t\\t\\tif( __builtin_popcount(i) == 6 ){\\n\\t\\t\\t\\tvector<int> v;\\n\\t\\t\\t\\tfor(int j = 0 ; j < N ; j++) if(i>>j&1)v.push_back(t[j]);\\n\\t\\t\\t\\tdo{\\n\\t\\t\\t\\t\\tdouble a,b,c,d,e,f;\\n\\t\\t\\t\\t\\ttie(a,b,c,d,e,f) = tuple<double,double,double,double,double,double>{v[0],v[1],v[2],v[3],v[4],v[5]};\\n\\t\\t\\t\\t\\tif( chk(a,e,f) && chk(a,b,c) && chk(e,d,c) && chk(d,b,f) ){\\n\\t\\t\\t\\t\\t\\tans = max(ans,calc(v[0],v[1],v[2],v[3],v[4],v[5]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}while( next_permutation(v.begin(),v.end()) );\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//cout << cnt << endl;\\n\\t\\tif(ans == 0){\\n\\t\\t\\tfor(int i = 0 ; i < N ; i++) cout << t[i] << \\\" \\\"; cout << endl;\\n\\t\\t}\\n\\t\\tprintf(\\\"%.10lf%c\\\",ans,10);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1550,\n \"memory_kb\": 1232,\n \"score_of_the_acc\": -0.2424,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2060_1002134\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-7)\\n#define equals(a,b) (fabs((a)-(b))<EPS)\\n\\nusing namespace std;\\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;\\nconst int IINF = INT_MAX;\\nconst int inf = INT_MAX;\\n//\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = -IINF,double y = -IINF): x(x),y(y){}\\n\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:y<p.y; }\\n\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n bool operator == (const Segment& p)const { return p.p1 == p1 && p.p2 == p2; }\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\ntypedef vector<Point> Polygon;\\n\\nostream& operator << (ostream& os,const Point& a){ os << \\\"(\\\" << a.x << \\\",\\\" << a.y << \\\")\\\"; }\\n\\nostream& operator << (ostream& os,const Segment& a){ os << \\\"( \\\" << a.p1 << \\\" , \\\" << a.p2 << \\\" )\\\"; }\\n\\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\\n\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\n\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\n\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\n//rad は角度をラジアンで持たせること\\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n\\n// 度をラジアンに変換\\ndouble toRad(double agl){ return agl*M_PI/180.0; }\\n\\n// a => prev, b => cur, c=> next\\n// prev から cur へ行って next へ行く際の角度を求める\\ndouble getArg(Point a,Point b,Point c){\\n double arg1 = atan2(b.y-a.y,b.x-a.x);\\n double arg2 = atan2(c.y-b.y,c.x-b.x);\\n double arg = fabs( arg1 - arg2 );\\n while( arg > M_PI ) arg -= 2.0 * M_PI;\\n return fabs(arg);\\n}\\n//\\n\\n// CCW\\nint ccw(Point p0,Point p1,Point p2){\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS)return CLOCKWISE;\\n if(dot(a,b) < -EPS)return ONLINE_BACK;\\n if(norm(a) < norm(b))return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n// CCW END\\n\\n// intersect\\nbool intersectLL(Line l, Line m) {\\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\\n}\\nbool intersectLS(Line l, Line s) {\\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(Line l,Point p) {\\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\\n}\\nbool intersectSS(Line s, Line t) {\\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\\n}\\nbool intersectSP(Line s, Point p) {\\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\\n}\\n\\nPoint projection(Line l,Point p) {\\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\\n return l.p1 + (l.p1-l.p2)*t;\\n}\\nPoint reflection(Line l,Point p) {\\n return p + (projection(l, p) - p) * 2;\\n}\\ndouble distanceLP(Line l, Point p) {\\n return abs(p - projection(l, p));\\n}\\ndouble distanceLL(Line l, Line m) {\\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\\n}\\n\\ndouble distanceLS(Line l, Line s) {\\n if (intersectLS(l, s)) return 0;\\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\\n}\\ndouble distanceSP(Line s, Point p) {\\n Point r = projection(s, p);\\n if (intersectSP(s, r)) return abs(r - p);\\n return min(abs(s.p1 - p), abs(s.p2 - p));\\n}\\n\\ndouble distanceSS(Line s, Line t) {\\n if (intersectSS(s, t)) return 0;\\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\\n}\\n\\n/*\\nsame lineの時注意\\nもしm.p1が中心でなかったときに正しい答えとならない\\nPoint crosspoint(Line l,Line m){\\n double A = cross(l.p2-l.p1,m.p2-m.p1);\\n double B = cross(l.p2-l.p1,l.p2-m.p1);\\n if(abs(A) < EPS && abs(B) < EPS){\\n vector<Point> vec;\\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\\n sort(vec.begin(),vec.end());\\n assert(vec[1] == vec[2]);\\n return vec[1];\\n //return m.p1;\\n }\\n if(abs(A) < EPS)assert(false);\\n return m.p1 + (m.p2-m.p1)*(B/A);\\n}\\n\\n*/\\nPoint crosspoint(Line l, Line m) {\\n double A = cross(l.p2 - l.p1, m.p2 - m.p1);\\n double B = cross(l.p2 - l.p1, l.p2 - m.p1);\\n if (abs(A) < EPS && abs(B) < EPS) return m.p1; // same line\\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n return m.p1 + (m.p2 - m.p1) * (B / A);\\n}\\n\\n// intersect END\\n\\nint array[6000];\\n\\ndouble areaT(double a,double b,double c){\\n double s = (a+b+c)/2.0;\\n return sqrt(s*(s-a)*(s-b)*(s-c));\\n}\\n\\ndouble areaH(double h,double *a){ return ( areaT(a[0],a[1],a[2]) * h) / 3.0; }\\n\\nbool LTE(double a,double b){ return equals(a,b) || a < b; }\\n\\nbool LT(double a,double b){ return !equals(a,b) && a < b; }\\n\\nbool GTE(double a,double b){ return equals(a,b) || a > b; }\\n\\nbool check1(double a,double b,double c){ return a + b >= c; }\\n\\nbool checkT(double a,double b,double c){ return LT(a,b+c) && LT(b,a+c) && LT(c,a+b); }\\n\\nbool check2(double h,double *a){\\n if( LTE(a[3]*a[3]-h*h,0) || LTE(a[4]*a[4]-h*h,0) || LTE(a[5]*a[5]-h*h,0) ) return false;\\n double L1 = sqrt(a[3]*a[3]-h*h);\\n double L2 = sqrt(a[4]*a[4]-h*h);\\n double L3 = sqrt(a[5]*a[5]-h*h);\\n if( LTE(L1,0) || LTE(L2,0) || LTE(L3,0) ) return false;\\n if( !checkT(L1,L2,a[0]) || !checkT(L2,L3,a[2]) || !checkT(L2,L3,a[2]) ) return false;\\n cout << endl;\\n cout << L1 << \\\" \\\" << L2 << \\\" \\\" << L3 << endl;\\n double tmp_area = areaT(L1,L2,a[0]) + areaT(L2,L3,a[2]) + areaT(L1,L3,a[1]);\\n cout << tmp_area << \\\" (\\\" << areaT(L1,L2,a[0]) << \\\"+\\\" << areaT(L2,L3,a[2]) << \\\"+\\\" << areaT(L1,L3,a[1]) << \\\") \\\"<< \\\" ?= \\\" << areaT(a[0],a[1],a[2]) << endl;\\n return equals(tmp_area,areaT(a[0],a[1],a[2]));\\n}\\n\\nSegment gen(Point p1,Point p2,double a,double b,double c,bool &error){\\n double S = areaT(a,b,c);\\n cout << \\\"S = \\\" << S << endl;\\n double h = 2 * S / a;\\n if( LTE(h,0) ) error = true;\\n if( LTE(b*b-h*h,0) ) error = true;\\n if( error ) return Segment();\\n cout << c * c << \\\" - \\\" << h*h << endl; \\ndouble x = sqrt(c*c-h*h);\\n cout << h << \\\",\\\" << x << endl;\\n Segment seg;\\n seg.p1 = p1;\\n Vector v = p2 - p1;\\n Vector ve = v / abs(v);\\n seg.p2 = p1 + ve * x;\\n cout << v << endl;\\n v = rotate(v,toRad(90));\\n cout << v << endl;\\n ve = v / abs(v);\\n seg.p2 = seg.p2 + ve * h;\\n return seg;\\n}\\n\\n//\\n typedef vector<int> VI;\\n typedef vector<VI> VVI;\\n typedef VVI matrix;\\n\\n\\n\\nmatrix identity(int n)\\n{\\n matrix A(n,vector<int>(n));\\n for(int i=0;i<n;i++) A[i][i] = 1;\\n return A;\\n}\\n\\n\\nvector<int> multi(const matrix& A,const vector<int>& B)\\n{\\n vector<int> ret(A.size());\\n for(int i=0;i<A.size();++i)\\n for(int j=0;j<A[0].size();++j)\\n ret[i] += A[i][j]*B[j];\\n return ret;\\n}\\n\\n\\nmatrix multi(const matrix& A,const matrix& B)\\n{\\n matrix C(A.size(),vector<int>(B[0].size()));\\n for(int i=0;i<C.size();++i)\\n for(int j=0;j<C[i].size();++j)\\n for(int k=0;k<A[i].size();++k)\\n\\tC[i][j] += A[i][k]*B[k][j];\\n return C;\\n}\\n\\n\\n\\nmatrix pow(const matrix& A,int e)\\n{\\n return !e?identity(A.size()):\\n (e%2?multi(A,pow(A,e-1)):pow(multi(A,A),e/2));\\n}\\n/*\\n冪乗に関するちょいと解説\\n行列をAする\\nA^2 = A*A, A^4 = (A^2)*(A^2), A^8 = (A^4)*(A^4) ・・・・と計算している\\n行列に限ったことでなく、普通の値の冪乗でも同じように考えることができる\\n*/\\n\\n\\nint extgcd(int a,int b,int& x,int& y)\\n{\\n int d = a;\\n if(b != 0){\\n d = extgcd(b,a%b,y,x);\\n y -= (a/b)*x;\\n }\\n else\\n x = 1,y = 0;\\n return d;\\n}\\n\\nint mod_inv(int a,int m)\\n{\\n int x,y;\\n extgcd(a,m,x,y);\\n return (m+x%m)%m;\\n}\\n\\n\\nint rank(vector<vector<int> > A,int mod)\\n{\\n int H = A.size(), W = A[0].size();\\n int r = 0;\\n rep(x,W)\\n { \\n int pivot = inf;\\n REP(y,r,H)\\n\\tif(A[y][x])\\n\\t {\\n\\t pivot = y;\\n\\t break;\\n\\t }\\n if(pivot == inf)continue;\\n swap(A[r],A[pivot]);\\n\\n REP(y,r+1,H)\\n\\t{\\n\\t int value = A[y][x] * mod_inv(A[r][x],mod) % mod;\\n\\t if(value)REP(x2,x,W)\\n\\t\\t A[y][x2] = ((A[y][x2] - A[r][x2] * value)%mod + mod ) % mod; \\n\\t}\\n r++;\\n }\\n return r;\\n}\\n\\n\\n/*\\n\\nAx=bが解を持つ必要十分条件は、\\nrank(A) = rank(A|b)\\nであり、\\nAx=bが一意の解を持つ必要十分条件は、\\nrank(A) = rank(A|b) = n\\n*/\\n\\nbool modGaussElimination(vector<vector<int> > &A, vector<int> &b, int m, vector<int> &res) {\\n int n = A.size();\\n vector<vector<int> > B(n, vector<int>(n+1));\\n rep(i,n) rep(j,n)\\n B[i][j] = A[i][j];\\n rep(i, n) B[i][n] = b[i];\\n \\n int nowy = 0;\\n rep(x, n) {\\n int pivot = -1;\\n for (int j=nowy; j<n; ++j)\\n if (B[j][x]) {\\n pivot = j;break;\\n }\\n if (pivot == -1) continue;\\n swap(B[nowy], B[pivot]);\\n\\n for (int j=nowy+1; j<n; ++j) {\\n int t = B[j][x] * mod_inv(B[nowy][x], m) % m;\\n if (t)\\n for (int k=x; k<=n; ++k)\\n B[j][k] = ((B[j][k] - B[nowy][k] * t)%m + m )%m;\\n }\\n nowy++;\\n \\n }\\n\\n res.clear();\\n for (int y=nowy; y<n; ++y)\\n if (B[y][n]) // rank(A) != rank(A|b)\\n return 0;\\n if (nowy != n) { // rank(A) == rank(A|b) != n\\n // 解が一意でない。ひとつ求める\\n res = vector<int>(n,inf); // INFは任意を表す\\n for (int y=n-1; y>=0; --y) {\\n int x;\\n for (x=y; x<n; ++x) {\\n if (B[y][x])\\n break;\\n }\\n if (x==n) continue;\\n int sum = B[y][n];\\n \\n for (int i=x+1; i<n; ++i) {\\n if (res[i] == inf) res[i] = 0; // この時点でres[i]が決まってなかったら0とする\\n sum = ((sum - res[i] * B[y][i])%m + m)%m;\\n }\\n res[x] = sum * mod_inv(B[y][x], m) % m;\\n }\\n rep(i, n) if (res[i]==inf) res[i] = 0;\\n return 0;\\n }\\n // 解が一意に決まる。普通に後退代入\\n res.resize(n);\\n for (int x=n-1; x>=0; --x) {\\n int sum = B[x][n];\\n for (int i=n-1; i>x; --i) {\\n sum = ((sum - res[i] * B[x][i])%m + m)%m; \\n }\\n res[x] = sum * mod_inv(B[x][x], m) % m;\\n }\\n return 1;\\n}\\n\\n//double det(vector<vector<double> > &A) {\\ndouble det(double A[5][5]){\\n const int n = 5;\\n double D = 1;\\n for (int i = 0; i < n; ++i) {\\n int pivot = i;\\n for (int j = i+1; j < n; ++j)\\n if (abs(A[j][i]) > abs(A[pivot][i])) pivot = j;\\n swap(A[pivot], A[i]);\\n D *= A[i][i] * (i != pivot ? -1 : 1);\\n if (abs(A[i][i]) < EPS) break;\\n for(int j = i+1; j < n; ++j)\\n for(int k = n-1; k >= i; --k)\\n A[j][k] -= A[i][k] * A[j][i] / A[i][i];\\n }\\n return D;\\n}\\n\\n\\n//\\n\\ndouble getAreaTetrahedra(double *A){\\n double a = A[3], b = A[1], c = A[0], p = A[5], q = A[4], r = A[2];\\n\\n /*\\n vector<vector<double> > mat(5,vector<double>(5,0));\\n mat[0][1] = p*p, mat[0][2] = q*q, mat[0][3] = a*a, mat[0][4] = 1;\\n mat[1][0] = p*p, mat[1][2] = r*r, mat[1][3] = b*b, mat[1][4] = 1;\\n mat[2][0] = q*q, mat[2][1] = r*r, mat[2][3] = c*c, mat[2][4] = 1;\\n mat[3][0] = a*a, mat[3][1] = b*b, mat[3][2] = c*c, mat[3][4] = 1;\\n mat[4][0] = 1, mat[4][1] = 1, mat[4][2] = 1, mat[4][3] = 1;\\n */\\n double mat[5][5] = {{0,p*p,q*q,a*a,1},{p*p,0,r*r,b*b,1},{q*q,r*r,0,c*c,1},{a*a,b*b,c*c,0,1},{1,1,1,1,0}};\\n return sqrt(det(mat)/288.0);\\n}\\n\\ndouble calc(double *a){\\n double ret = 0;\\n do{\\n if( !checkT(a[0],a[1],a[2]) || !checkT(a[0],a[3],a[4]) || !checkT(a[1],a[3],a[5]) || !checkT(a[2],a[4],a[5]) ) continue;\\n /*\\n Point p1(0,0);\\n Point p2(a[1],0);\\n double theta = acos( ( a[0]*a[0] + a[1]*a[1] - a[2]*a[2] ) / ( 2*a[0]*a[1] ) );\\n Point p3(a[0]*cos(theta),a[0]*sin(theta));\\n //cout << p1 << \\\" \\\" << p2 << \\\" \\\" << p3 << endl;\\n double A = a[1], b =a[0], c = a[2];\\n double x0 = (A*A-b*b-c*c)/(2*A);\\n //cout << \\\"(\\\" << (A*A-b*b-c*c)/(2*A) << \\\",\\\" << sqrt(b*b-x0*x0)<<\\\")\\\"<<endl;\\n */\\n //if( error ) continue;\\n //if( error ) continue;\\n //if( LTE(a[3]*a[3]-x*x,0) ) continue;\\n //if( LTE(h,0) ) continue;\\n ret = max(ret,getAreaTetrahedra(a));\\n }while(next_permutation(a,a+6));\\n return ret;\\n}\\n\\nint main(){\\n /*\\n double a[6] = {2,2,2,2,2,2};\\n cout << calc(a) << endl;\\n return 0;\\n */\\n int dex = 0;\\n rep(i,(1<<15)) if( __builtin_popcount(i) == 6 ) array[dex++] = i;\\n int N,input[16];\\n while( scanf(\\\"%d\\\",&N), N ){\\n rep(i,N) scanf(\\\"%d\\\",input+i);\\n sort(input,input+N);\\n double maxi = 0;\\n rep(k,dex){\\n int bitmask = array[k];\\n if( bitmask >= (1<<N) ) break;\\n double buf[6];\\n int cur = 0;\\n rep(j,N) if( (bitmask>>j) & 1 ) buf[cur++] = input[j];\\n maxi = max(maxi,calc(buf));\\n }\\n printf(\\\"%.10f\\\\n\\\",maxi);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5320,\n \"memory_kb\": 1288,\n \"score_of_the_acc\": -0.8767,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2060_1002131\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-7)\\n#define equals(a,b) (fabs((a)-(b))<EPS)\\n\\nusing namespace std;\\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;\\nconst int IINF = INT_MAX;\\nconst int inf = INT_MAX;\\n//\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = -IINF,double y = -IINF): x(x),y(y){}\\n\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:y<p.y; }\\n\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n bool operator == (const Segment& p)const { return p.p1 == p1 && p.p2 == p2; }\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\ntypedef vector<Point> Polygon;\\n\\nostream& operator << (ostream& os,const Point& a){ os << \\\"(\\\" << a.x << \\\",\\\" << a.y << \\\")\\\"; }\\n\\nostream& operator << (ostream& os,const Segment& a){ os << \\\"( \\\" << a.p1 << \\\" , \\\" << a.p2 << \\\" )\\\"; }\\n\\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\\n\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\n\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\n\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\n//rad は角度をラジアンで持たせること\\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n\\n// 度をラジアンに変換\\ndouble toRad(double agl){ return agl*M_PI/180.0; }\\n\\n// a => prev, b => cur, c=> next\\n// prev から cur へ行って next へ行く際の角度を求める\\ndouble getArg(Point a,Point b,Point c){\\n double arg1 = atan2(b.y-a.y,b.x-a.x);\\n double arg2 = atan2(c.y-b.y,c.x-b.x);\\n double arg = fabs( arg1 - arg2 );\\n while( arg > M_PI ) arg -= 2.0 * M_PI;\\n return fabs(arg);\\n}\\n//\\n\\n// CCW\\nint ccw(Point p0,Point p1,Point p2){\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS)return CLOCKWISE;\\n if(dot(a,b) < -EPS)return ONLINE_BACK;\\n if(norm(a) < norm(b))return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n// CCW END\\n\\n// intersect\\nbool intersectLL(Line l, Line m) {\\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\\n}\\nbool intersectLS(Line l, Line s) {\\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(Line l,Point p) {\\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\\n}\\nbool intersectSS(Line s, Line t) {\\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\\n}\\nbool intersectSP(Line s, Point p) {\\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\\n}\\n\\nPoint projection(Line l,Point p) {\\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\\n return l.p1 + (l.p1-l.p2)*t;\\n}\\nPoint reflection(Line l,Point p) {\\n return p + (projection(l, p) - p) * 2;\\n}\\ndouble distanceLP(Line l, Point p) {\\n return abs(p - projection(l, p));\\n}\\ndouble distanceLL(Line l, Line m) {\\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\\n}\\n\\ndouble distanceLS(Line l, Line s) {\\n if (intersectLS(l, s)) return 0;\\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\\n}\\ndouble distanceSP(Line s, Point p) {\\n Point r = projection(s, p);\\n if (intersectSP(s, r)) return abs(r - p);\\n return min(abs(s.p1 - p), abs(s.p2 - p));\\n}\\n\\ndouble distanceSS(Line s, Line t) {\\n if (intersectSS(s, t)) return 0;\\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\\n}\\n\\n/*\\nsame lineの時注意\\nもしm.p1が中心でなかったときに正しい答えとならない\\nPoint crosspoint(Line l,Line m){\\n double A = cross(l.p2-l.p1,m.p2-m.p1);\\n double B = cross(l.p2-l.p1,l.p2-m.p1);\\n if(abs(A) < EPS && abs(B) < EPS){\\n vector<Point> vec;\\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\\n sort(vec.begin(),vec.end());\\n assert(vec[1] == vec[2]);\\n return vec[1];\\n //return m.p1;\\n }\\n if(abs(A) < EPS)assert(false);\\n return m.p1 + (m.p2-m.p1)*(B/A);\\n}\\n\\n*/\\nPoint crosspoint(Line l, Line m) {\\n double A = cross(l.p2 - l.p1, m.p2 - m.p1);\\n double B = cross(l.p2 - l.p1, l.p2 - m.p1);\\n if (abs(A) < EPS && abs(B) < EPS) return m.p1; // same line\\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n return m.p1 + (m.p2 - m.p1) * (B / A);\\n}\\n\\n// intersect END\\n\\nint array[6000];\\n\\ndouble areaT(double a,double b,double c){\\n double s = (a+b+c)/2.0;\\n return sqrt(s*(s-a)*(s-b)*(s-c));\\n}\\n\\ndouble areaH(double h,double *a){ return ( areaT(a[0],a[1],a[2]) * h) / 3.0; }\\n\\nbool LTE(double a,double b){ return equals(a,b) || a < b; }\\n\\nbool LT(double a,double b){ return !equals(a,b) && a < b; }\\n\\nbool GTE(double a,double b){ return equals(a,b) || a > b; }\\n\\nbool check1(double a,double b,double c){ return a + b >= c; }\\n\\nbool checkT(double a,double b,double c){ return LT(a,b+c) && LT(b,a+c) && LT(c,a+b); }\\n\\nbool check2(double h,double *a){\\n if( LTE(a[3]*a[3]-h*h,0) || LTE(a[4]*a[4]-h*h,0) || LTE(a[5]*a[5]-h*h,0) ) return false;\\n double L1 = sqrt(a[3]*a[3]-h*h);\\n double L2 = sqrt(a[4]*a[4]-h*h);\\n double L3 = sqrt(a[5]*a[5]-h*h);\\n if( LTE(L1,0) || LTE(L2,0) || LTE(L3,0) ) return false;\\n if( !checkT(L1,L2,a[0]) || !checkT(L2,L3,a[2]) || !checkT(L2,L3,a[2]) ) return false;\\n cout << endl;\\n cout << L1 << \\\" \\\" << L2 << \\\" \\\" << L3 << endl;\\n double tmp_area = areaT(L1,L2,a[0]) + areaT(L2,L3,a[2]) + areaT(L1,L3,a[1]);\\n cout << tmp_area << \\\" (\\\" << areaT(L1,L2,a[0]) << \\\"+\\\" << areaT(L2,L3,a[2]) << \\\"+\\\" << areaT(L1,L3,a[1]) << \\\") \\\"<< \\\" ?= \\\" << areaT(a[0],a[1],a[2]) << endl;\\n return equals(tmp_area,areaT(a[0],a[1],a[2]));\\n}\\n\\nSegment gen(Point p1,Point p2,double a,double b,double c,bool &error){\\n double S = areaT(a,b,c);\\n cout << \\\"S = \\\" << S << endl;\\n double h = 2 * S / a;\\n if( LTE(h,0) ) error = true;\\n if( LTE(b*b-h*h,0) ) error = true;\\n if( error ) return Segment();\\n cout << c * c << \\\" - \\\" << h*h << endl; \\ndouble x = sqrt(c*c-h*h);\\n cout << h << \\\",\\\" << x << endl;\\n Segment seg;\\n seg.p1 = p1;\\n Vector v = p2 - p1;\\n Vector ve = v / abs(v);\\n seg.p2 = p1 + ve * x;\\n cout << v << endl;\\n v = rotate(v,toRad(90));\\n cout << v << endl;\\n ve = v / abs(v);\\n seg.p2 = seg.p2 + ve * h;\\n return seg;\\n}\\n\\n//\\n typedef vector<int> VI;\\n typedef vector<VI> VVI;\\n typedef VVI matrix;\\n\\n\\n\\nmatrix identity(int n)\\n{\\n matrix A(n,vector<int>(n));\\n for(int i=0;i<n;i++) A[i][i] = 1;\\n return A;\\n}\\n\\n\\nvector<int> multi(const matrix& A,const vector<int>& B)\\n{\\n vector<int> ret(A.size());\\n for(int i=0;i<A.size();++i)\\n for(int j=0;j<A[0].size();++j)\\n ret[i] += A[i][j]*B[j];\\n return ret;\\n}\\n\\n\\nmatrix multi(const matrix& A,const matrix& B)\\n{\\n matrix C(A.size(),vector<int>(B[0].size()));\\n for(int i=0;i<C.size();++i)\\n for(int j=0;j<C[i].size();++j)\\n for(int k=0;k<A[i].size();++k)\\n\\tC[i][j] += A[i][k]*B[k][j];\\n return C;\\n}\\n\\n\\n\\nmatrix pow(const matrix& A,int e)\\n{\\n return !e?identity(A.size()):\\n (e%2?multi(A,pow(A,e-1)):pow(multi(A,A),e/2));\\n}\\n/*\\n冪乗に関するちょいと解説\\n行列をAする\\nA^2 = A*A, A^4 = (A^2)*(A^2), A^8 = (A^4)*(A^4) ・・・・と計算している\\n行列に限ったことでなく、普通の値の冪乗でも同じように考えることができる\\n*/\\n\\n\\nint extgcd(int a,int b,int& x,int& y)\\n{\\n int d = a;\\n if(b != 0){\\n d = extgcd(b,a%b,y,x);\\n y -= (a/b)*x;\\n }\\n else\\n x = 1,y = 0;\\n return d;\\n}\\n\\nint mod_inv(int a,int m)\\n{\\n int x,y;\\n extgcd(a,m,x,y);\\n return (m+x%m)%m;\\n}\\n\\n\\nint rank(vector<vector<int> > A,int mod)\\n{\\n int H = A.size(), W = A[0].size();\\n int r = 0;\\n rep(x,W)\\n { \\n int pivot = inf;\\n REP(y,r,H)\\n\\tif(A[y][x])\\n\\t {\\n\\t pivot = y;\\n\\t break;\\n\\t }\\n if(pivot == inf)continue;\\n swap(A[r],A[pivot]);\\n\\n REP(y,r+1,H)\\n\\t{\\n\\t int value = A[y][x] * mod_inv(A[r][x],mod) % mod;\\n\\t if(value)REP(x2,x,W)\\n\\t\\t A[y][x2] = ((A[y][x2] - A[r][x2] * value)%mod + mod ) % mod; \\n\\t}\\n r++;\\n }\\n return r;\\n}\\n\\n\\n/*\\n\\nAx=bが解を持つ必要十分条件は、\\nrank(A) = rank(A|b)\\nであり、\\nAx=bが一意の解を持つ必要十分条件は、\\nrank(A) = rank(A|b) = n\\n*/\\n\\nbool modGaussElimination(vector<vector<int> > &A, vector<int> &b, int m, vector<int> &res) {\\n int n = A.size();\\n vector<vector<int> > B(n, vector<int>(n+1));\\n rep(i,n) rep(j,n)\\n B[i][j] = A[i][j];\\n rep(i, n) B[i][n] = b[i];\\n \\n int nowy = 0;\\n rep(x, n) {\\n int pivot = -1;\\n for (int j=nowy; j<n; ++j)\\n if (B[j][x]) {\\n pivot = j;break;\\n }\\n if (pivot == -1) continue;\\n swap(B[nowy], B[pivot]);\\n\\n for (int j=nowy+1; j<n; ++j) {\\n int t = B[j][x] * mod_inv(B[nowy][x], m) % m;\\n if (t)\\n for (int k=x; k<=n; ++k)\\n B[j][k] = ((B[j][k] - B[nowy][k] * t)%m + m )%m;\\n }\\n nowy++;\\n \\n }\\n\\n res.clear();\\n for (int y=nowy; y<n; ++y)\\n if (B[y][n]) // rank(A) != rank(A|b)\\n return 0;\\n if (nowy != n) { // rank(A) == rank(A|b) != n\\n // 解が一意でない。ひとつ求める\\n res = vector<int>(n,inf); // INFは任意を表す\\n for (int y=n-1; y>=0; --y) {\\n int x;\\n for (x=y; x<n; ++x) {\\n if (B[y][x])\\n break;\\n }\\n if (x==n) continue;\\n int sum = B[y][n];\\n \\n for (int i=x+1; i<n; ++i) {\\n if (res[i] == inf) res[i] = 0; // この時点でres[i]が決まってなかったら0とする\\n sum = ((sum - res[i] * B[y][i])%m + m)%m;\\n }\\n res[x] = sum * mod_inv(B[y][x], m) % m;\\n }\\n rep(i, n) if (res[i]==inf) res[i] = 0;\\n return 0;\\n }\\n // 解が一意に決まる。普通に後退代入\\n res.resize(n);\\n for (int x=n-1; x>=0; --x) {\\n int sum = B[x][n];\\n for (int i=n-1; i>x; --i) {\\n sum = ((sum - res[i] * B[x][i])%m + m)%m; \\n }\\n res[x] = sum * mod_inv(B[x][x], m) % m;\\n }\\n return 1;\\n}\\n\\n//double det(vector<vector<double> > &A) {\\ndouble det(double A[5][5]) {\\n const int n = 5;\\n double D = 1;\\n for (int i = 0; i < n; ++i) {\\n int pivot = i;\\n for (int j = i+1; j < n; ++j)\\n if (abs(A[j][i]) > abs(A[pivot][i])) pivot = j;\\n swap(A[pivot], A[i]);\\n D *= A[i][i] * (i != pivot ? -1 : 1);\\n if (abs(A[i][i]) < EPS) break;\\n for(int j = i+1; j < n; ++j)\\n for(int k = n-1; k >= i; --k)\\n A[j][k] -= A[i][k] * A[j][i] / A[i][i];\\n }\\n return D;\\n}\\n\\n\\n//\\n\\ndouble getAreaTetrahedra(double *A){\\n double a = A[3], b = A[1], c = A[0], p = A[5], q = A[4], r = A[2];\\n\\n /*\\n vector<vector<double> > mat(5,vector<double>(5,0));\\n mat[0][1] = p*p, mat[0][2] = q*q, mat[0][3] = a*a, mat[0][4] = 1;\\n mat[1][0] = p*p, mat[1][2] = r*r, mat[1][3] = b*b, mat[1][4] = 1;\\n mat[2][0] = q*q, mat[2][1] = r*r, mat[2][3] = c*c, mat[2][4] = 1;\\n mat[3][0] = a*a, mat[3][1] = b*b, mat[3][2] = c*c, mat[3][4] = 1;\\n mat[4][0] = 1, mat[4][1] = 1, mat[4][2] = 1, mat[4][3] = 1;\\n */\\n double mat[5][5] = {{0,p*p,q*q,a*a,1},{p*p,0,r*r,b*b,1},{q*q,r*r,0,c*c,1},{a*a,b*b,c*c,0,1},{1,1,1,1,0}};\\n return det(mat)/288.0;\\n}\\n\\ndouble calc(double *a){\\n double ret = 0;\\n do{\\n if( !checkT(a[0],a[1],a[2]) || !checkT(a[0],a[3],a[4]) || !checkT(a[1],a[3],a[5]) || !checkT(a[2],a[4],a[5]) ) continue;\\n /*\\n Point p1(0,0);\\n Point p2(a[1],0);\\n double theta = acos( ( a[0]*a[0] + a[1]*a[1] - a[2]*a[2] ) / ( 2*a[0]*a[1] ) );\\n Point p3(a[0]*cos(theta),a[0]*sin(theta));\\n //cout << p1 << \\\" \\\" << p2 << \\\" \\\" << p3 << endl;\\n double A = a[1], b =a[0], c = a[2];\\n double x0 = (A*A-b*b-c*c)/(2*A);\\n //cout << \\\"(\\\" << (A*A-b*b-c*c)/(2*A) << \\\",\\\" << sqrt(b*b-x0*x0)<<\\\")\\\"<<endl;\\n */\\n //if( error ) continue;\\n //if( error ) continue;\\n //if( LTE(a[3]*a[3]-x*x,0) ) continue;\\n //if( LTE(h,0) ) continue;\\n ret = max(ret,sqrt(getAreaTetrahedra(a)));\\n }while(next_permutation(a,a+6));\\n return ret;\\n}\\n\\nint main(){\\n /*\\n double a[6] = {2,2,2,2,2,2};\\n cout << calc(a) << endl;\\n return 0;\\n */\\n int dex = 0;\\n rep(i,(1<<15)) if( __builtin_popcount(i) == 6 ) array[dex++] = i;\\n int N,input[16];\\n while( scanf(\\\"%d\\\",&N), N ){\\n rep(i,N) scanf(\\\"%d\\\",input+i);\\n sort(input,input+N);\\n double maxi = 0;\\n rep(k,dex){\\n int bitmask = array[k];\\n if( bitmask >= (1<<N) ) break;\\n double buf[6];\\n int cur = 0;\\n rep(j,N) if( (bitmask>>j) & 1 ) buf[cur++] = input[j];\\n maxi = max(maxi,calc(buf));\\n }\\n printf(\\\"%.10f\\\\n\\\",maxi);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5250,\n \"memory_kb\": 1288,\n \"score_of_the_acc\": -0.8649,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2060_551697\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<cstdio>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\\n\\ndouble a[20];\\nint index[6], n;\\n\\nbool ng(double a, double b, double c) {\\n if (a + b <= c) return true;\\n if (b + c <= a) return true;\\n if (c + a <= b) return true;\\n return false;\\n}\\n\\t\\t\\t\\t \\n\\ndouble solve(int m) {\\n if (m == 6) {\\n if (ng(a[index[0]], a[index[1]], a[index[2]])) return 0;\\n if (ng(a[index[0]], a[index[3]], a[index[4]])) return 0;\\n if (ng(a[index[1]], a[index[4]], a[index[5]])) return 0;\\n if (ng(a[index[2]], a[index[5]], a[index[3]])) return 0;\\n double aa[3], bb[3], t, pi[4];\\n aa[0] = a[index[0]];\\n aa[1] = a[index[1]];\\n aa[2] = a[index[2]];\\n bb[0] = a[index[5]];\\n bb[1] = a[index[3]];\\n bb[2] = a[index[4]];\\n t = 0;\\n rep (i, 3) t += aa[i] * aa[i];\\n rep (i, 3) t += bb[i] * bb[i];\\n t = sqrt(max(t, 0.));\\n pi[0] = aa[0] * aa[1] * aa[2];\\n pi[1] = aa[0] * bb[1] * bb[2];\\n pi[2] = aa[1] * bb[2] * bb[0];\\n pi[3] = aa[2] * bb[0] * bb[1];\\n double v = 0;\\n rep (i, 3) v += aa[i] * aa[i] * bb[i] * bb[i] * (t * t- 2 * aa[i] * aa[i] - 2 * bb[i] * bb[i]);\\n rep (i, 4) v -= pi[i] * pi[i];\\n return sqrt(max(v, 0.)) / 12;\\n }\\n double res = 0;\\n rep (i, n) {\\n bool ok = true;\\n rep (j, m) if (index[j] == i) ok = false;\\n if (ok) {\\n index[m] = i;\\n res = max(solve(m + 1), res);\\n }\\n }\\n return res;\\n}\\n\\nint main() {\\n while (true) {\\n cin >> n;\\n if (n == 0) break;\\n rep (i, n) cin >> a[i];\\n printf(\\\"%.12f\\\\n\\\", solve(0));\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2390,\n \"memory_kb\": 1244,\n \"score_of_the_acc\": -0.3837,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2060_472504\",\n \"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;\\n\\ndouble determinant(vector<vector<double> > mat)\\n{ \\n const int n = mat.size();\\n double ret = 1.0;\\n for(int i=0; i<n; ++i){\\n int tmp = i;\\n for(int j=i+1; j<n; ++j){\\n if(abs(mat[j][i]) > abs(mat[tmp][i]))\\n tmp = j;\\n }\\n if(abs(mat[tmp][i]) < EPS)\\n return 0.0;\\n if(tmp != i){\\n mat[i].swap(mat[tmp]);\\n ret *= -1.0;\\n }\\n\\n for(int j=i+1; j<n; ++j){\\n for(int k=n-1; k>=i; --k){\\n mat[j][k] -= mat[i][k] * (mat[j][i] / mat[i][i]);\\n }\\n }\\n ret *= mat[i][i];\\n }\\n return ret;\\n}\\n\\ndouble tetrahedronVolume(const vector<double>& len)\\n{\\n const int a[][3] = {{0,1,3}, {1,2,4}, {0,2,5}, {3,4,5}};\\n for(int i=0; i<4; ++i){\\n vector<double> b(3);\\n for(int j=0; j<3; ++j)\\n b[j] = len[a[i][j]];\\n sort(b.begin(), b.end());\\n if(b[2] > b[0] + b[1] - EPS)\\n return 0.0;\\n }\\n\\n const int y[] = {0, 3, 1, 3, 2, 3, 0, 1, 1, 2, 0, 2};\\n const int x[] = {3, 0, 3, 1, 3, 2, 1, 0, 2, 1, 2, 0};\\n\\n vector<vector<double> > mat(5, vector<double>(5, 1.0));\\n for(int i=0; i<12; ++i)\\n mat[y[i]][x[i]] = pow(len[i/2], 2.0);\\n for(int i=0; i<5; ++i)\\n mat[i][i] = 0.0;\\n\\n return sqrt(determinant(mat) / 288.0);\\n}\\n\\ntemplate <size_t T>\\nbool nextBitset(bitset<T> &bs, int digit)\\n{\\n if(bs.none())\\n return false;\\n bitset<T> x, y, z;\\n x = bs.to_ulong() & (~(bs.to_ulong()) + 1ULL);\\n y = bs.to_ulong() + x.to_ulong() + 0ULL;\\n z = bs & ~y;\\n if(bs[digit-1] && bs == z)\\n return false;\\n bs = ((z.to_ulong() / x.to_ulong()) >> 1) + 0ULL;\\n bs |= y;\\n return true;\\n}\\n\\nint main()\\n{\\n for(;;){\\n int n;\\n cin >> n;\\n if(n == 0)\\n return 0;\\n\\n vector<double> len(n);\\n for(int i=0; i<n; ++i)\\n cin >> len[i];\\n\\n double ret = 0.0;\\n bitset<15> used;\\n for(int i=0; i<n; ++i){\\n for(int j=0; j<i; ++j){\\n for(int k=0; k<j; ++k){\\n used[i] = used[j] = used[k] = true;\\n\\n for(int a=0; a<n; ++a){\\n for(int b=0; b<n; ++b){\\n for(int c=0; c<n; ++c){\\n if(a == b || b == c || c == a)\\n continue;\\n if(used[a] || used[b] || used[c])\\n continue;\\n\\n vector<double> len2(6);\\n len2[0] = len[a];\\n len2[1] = len[b];\\n len2[2] = len[c];\\n len2[3] = len[i];\\n len2[4] = len[j];\\n len2[5] = len[k];\\n ret = max(ret, tetrahedronVolume(len2));\\n ;\\n }\\n }\\n }\\n\\n used[i] = used[j] = used[k] = false;\\n }\\n }\\n }\\n\\n printf(\\\"%.10f\\\\n\\\", ret);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3930,\n \"memory_kb\": 1272,\n \"score_of_the_acc\": -0.6429,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2060_418972\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\nint n;\\nint t[20];\\nvector<int> v[20];\\n\\nvoid makePattern(int idx, int cnt, int bit){\\n if(cnt > 6) return;\\n if(idx == n){\\n if(cnt == 6){\\n v[n].push_back(bit);\\n }\\n return;\\n }\\n\\n makePattern(idx + 1, cnt, bit);\\n makePattern(idx + 1, cnt + 1, bit | (1 << idx));\\n}\\n\\nbool check(ll x, ll y, ll z){\\n return x + y > z && x + z > y && y + z > x;\\n}\\n\\nvoid solve(){\\n double ans = 0;\\n\\n for(int i = 0; i < v[n].size(); i++){\\n vector<int> a;\\n\\n for(int j = 0; j < n; j++){\\n if(v[n][i] & (1 << j)){\\n a.push_back(t[j]);\\n }\\n }\\n\\n sort(a.begin(), a.end());\\n\\n do{\\n ll A = a[0];\\n ll B = a[1];\\n ll C = a[2];\\n ll X = a[3];\\n ll Y = a[4];\\n ll Z = a[5];\\n\\n if(!check(A, B, C) || !check(A, Y, Z) ||\\n !check(B, X, Z) || !check(C, Y, Z)){\\n continue;\\n }\\n\\n A *= A;\\n B *= B;\\n C *= C;\\n X *= X;\\n Y *= Y;\\n Z *= Z;\\n\\n ll V =\\n A * X * (B + C - A + Y + Z - X) +\\n B * Y * (C + A - B + Z + X - Y) +\\n C * Z * (A + B - C + X + Y - Z) -\\n A * Y * Z -\\n B * Z * X -\\n C * X * Y -\\n A * B * C;\\n\\n ans = max(ans, sqrt((double)V / 144));\\n }while(next_permutation(a.begin(), a.end()));\\n }\\n\\n printf(\\\"%.6f\\\\n\\\", ans);\\n}\\n\\nint main(){\\n for(n = 6; n <= 15; n++){\\n makePattern(0, 0, 0);\\n }\\n\\n while(cin >> n, n){\\n for(int i = 0; i < n; i++){\\n cin >> t[i];\\n }\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5420,\n \"memory_kb\": 1052,\n \"score_of_the_acc\": -0.8908,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":1095,"cells":{"group_id":{"kind":"string","value":"aoj_2064_cpp"},"problem_description":{"kind":"string","value":"Problem G:\nMake Friendships\nIsaac H. Ives attended an international student party and made a lot of girl friends (as many other persons\nexpected). To strike up a good friendship with them, he decided to have dates with them. However, it\nis hard for him to schedule dates because he made so many friends. Thus he decided to find the best\nschedule using a computer program. The most important criterion in scheduling is how many different\ngirl friends he will date. Of course, the more friends he will date, the better the schedule is. However,\nthough he has the ability to write a program finding the best schedule, he doesn’t have enough time to\nwrite it.\nYour task is to write a program to find the best schedule instead of him.\nInput\nThe input consists of a series of data sets. The first line of each data set contains a single positive integer\nN\n(\nN\n≤ 1,000) that represents the number of persons Isaac made friends with in the party. The next line\ngives Isaac’s schedule, followed by\nN\nlines that give his new friends’ schedules. Each schedule consists of\na positive integer\nM\nthat represents the number of available days followed by\nM\npositive integers each\nof which represents an available day.\nThe input is terminated by a line that contains a single zero. This is not part of data sets and should\nnot be processed.\nOutput\nFor each data set, print a line that contains the maximum number of girl friends Isaac can have dates\nwith.\nSample Input\n3\n3 1 3 5\n2 1 4\n4 1 2 3 6\n1 3\n0\nOutput for the Sample Input\n2"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2064_11055694","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)\n#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)\n#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)\n#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)\n#define each(p,a) for(auto &p:a)\ntypedef vector<ll> vll;\ntypedef vector<pair<ll ,ll>> vpll;\ntypedef vector<vector<pair<ll ,ll>>> vvpll;\ntypedef vector<vector<ll>> vvll;\ntypedef vector<vector<vector<ll>>> vvvll;\ntypedef set<ll> sll;\ntypedef map<ll , ll> mpll;\ntypedef pair<ll ,ll> pll;\ntypedef tuple<ll , ll , ll> tpl3;\ntypedef tuple<ll , ll , ll , ll> tpl4;\ntypedef tuple<ll , ll , ll , ll , ll> tpl5;\ntypedef tuple<ll , ll , ll , ll , ll , ll> tpl6;\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\n#define all(a) (a).begin(),(a).end()\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n#define sz(x) (ll)x.size()\n// << std::fixed << std::setprecision(10)\nconst ll INF = 1LL << 60;\nconst ld EPS = 1e-9;\n \nll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}\nll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\n//0indexed\ninline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}\ninline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}\ntemplate<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}\ntemplate<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\ntemplate<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\" \":\"\");}return os;}\ntemplate<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << \"{\" << p.first << \",\" << p.second << \"}\";return os;}\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\nvoid print(){cout << endl;}\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\nvoid perr(){cerr << endl;}\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\nvoid yes(bool i = true){ return print(i?\"yes\":\"no\"); }\nvoid Yes(bool i = true){ return print(i?\"Yes\":\"No\"); }\nvoid YES(bool i = true){ return print(i?\"YES\":\"NO\"); }\ntemplate <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}\ntemplate <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}\ntemplate <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}\ntemplate <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}\n//grid探索用\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\n \nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \nconst ll MOD9 = 998244353LL;\nconst ll MOD10 = 1000000007LL;\n\nstruct Edge {\n ll to,cap,rev;\n};\n\nclass MaximumFlow{\n public:\n ll siz = 0;\n vector<bool> used;\n vector<vector<Edge>> G;\n MaximumFlow(ll n){\n siz = n;\n used.resize(n+1);\n G.resize(n+1);\n }\n\n // a からbにcリットル流せる辺を追加\n void add_edge(ll a,ll b , ll c){\n ll ga_size = G[a].size();\n ll gb_size = G[b].size();\n G[a].push_back({b,c,gb_size });\n G[b].push_back({a,0,ga_size });\n }\n\n //Fはスタートからposまでの残余グラフの辺の容量の最小値\n //返り値は流したフローの量\n ll dfs(ll pos,ll goal,ll F){\n // ゴールに到着\n if(pos == goal) return F;\n used[pos] = true;\n for(ll i = 0; i < (ll)G[pos].size();i++){\n // 容量0の辺は使えない\n if(G[pos][i].cap == 0)continue;\n //探索済みだった\n if(used[G[pos][i].to] == true) continue;\n\n ll flow = dfs(G[pos][i].to,goal,min(F,G[pos][i].cap));\n\n // フローを流せるとき、残余グラフの容量をflowだけ増減\n if(flow > 0){\n G[pos][i].cap -= flow;\n G[G[pos][i].to][G[pos][i].rev].cap += flow;\n return flow;\n }\n }\n // 見つからず\n return 0;\n }\n\n ll max_flow(ll s,ll t){\n ll Total_Flow = 0;\n while(true){\n for(ll i = 0;i < siz;i++)used[i] = false;\n ll F = dfs(s,t,INF);\n\n //流せなくなった\n if(F== 0)break;\n Total_Flow += F;\n }\n return Total_Flow;\n }\n};\n \nint main(){\n ios::sync_with_stdio(false);cin.tie(nullptr);\n while(true){\n LL(n);\n if(n == 0)break;\n LL(m);\n map<ll,ll> mp;\n rep(i,m){\n LL(u);\n ll siz = sz(mp);\n if(!mp.contains(u)){\n mp[u] = siz;\n }\n }\n MaximumFlow mf(n+m+2);\n rep(i,m){\n mf.add_edge(n+m,i,1);\n }\n rep(i,n){\n LL(x);\n rep(j,x){\n LL(v);\n if(mp.contains(v)){\n mf.add_edge(mp[v],i+m,1);\n }\n }\n mf.add_edge(i+m,n+m+1,1);\n }\n cout << mf.max_flow(n+m,n+m+1) << endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":4096,"score_of_the_acc":-0.5697,"final_rank":12},{"submission_id":"aoj_2064_11055691","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)\n#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)\n#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)\n#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)\n#define each(p,a) for(auto &p:a)\ntypedef vector<ll> vll;\ntypedef vector<pair<ll ,ll>> vpll;\ntypedef vector<vector<pair<ll ,ll>>> vvpll;\ntypedef vector<vector<ll>> vvll;\ntypedef vector<vector<vector<ll>>> vvvll;\ntypedef set<ll> sll;\ntypedef map<ll , ll> mpll;\ntypedef pair<ll ,ll> pll;\ntypedef tuple<ll , ll , ll> tpl3;\ntypedef tuple<ll , ll , ll , ll> tpl4;\ntypedef tuple<ll , ll , ll , ll , ll> tpl5;\ntypedef tuple<ll , ll , ll , ll , ll , ll> tpl6;\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\n#define all(a) (a).begin(),(a).end()\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n#define sz(x) (ll)x.size()\n// << std::fixed << std::setprecision(10)\nconst ll INF = 1LL << 60;\nconst ld EPS = 1e-9;\n \nll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}\nll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\n//0indexed\ninline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}\ninline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}\ntemplate<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}\ntemplate<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\ntemplate<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\" \":\"\");}return os;}\ntemplate<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << \"{\" << p.first << \",\" << p.second << \"}\";return os;}\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\nvoid print(){cout << endl;}\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\nvoid perr(){cerr << endl;}\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\nvoid yes(bool i = true){ return print(i?\"yes\":\"no\"); }\nvoid Yes(bool i = true){ return print(i?\"Yes\":\"No\"); }\nvoid YES(bool i = true){ return print(i?\"YES\":\"NO\"); }\ntemplate <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}\ntemplate <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}\ntemplate <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}\ntemplate <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}\n//grid探索用\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\n \nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \nconst ll MOD9 = 998244353LL;\nconst ll MOD10 = 1000000007LL;\n\nstruct Edge {\n ll to,cap,rev;\n};\n\nclass MaximumFlow{\n public:\n ll siz = 0;\n vector<bool> used;\n vector<vector<Edge>> G;\n MaximumFlow(ll n){\n siz = n;\n used.resize(n+1);\n G.resize(n+1);\n }\n\n // a からbにcリットル流せる辺を追加\n void add_edge(ll a,ll b , ll c){\n ll ga_size = G[a].size();\n ll gb_size = G[b].size();\n G[a].push_back({b,c,gb_size });\n G[b].push_back({a,0,ga_size });\n }\n\n //Fはスタートからposまでの残余グラフの辺の容量の最小値\n //返り値は流したフローの量\n ll dfs(ll pos,ll goal,ll F){\n // ゴールに到着\n if(pos == goal) return F;\n used[pos] = true;\n for(ll i = 0; i < (ll)G[pos].size();i++){\n // 容量0の辺は使えない\n if(G[pos][i].cap == 0)continue;\n //探索済みだった\n if(used[G[pos][i].to] == true) continue;\n\n ll flow = dfs(G[pos][i].to,goal,min(F,G[pos][i].cap));\n\n // フローを流せるとき、残余グラフの容量をflowだけ増減\n if(flow > 0){\n G[pos][i].cap -= flow;\n G[G[pos][i].to][G[pos][i].rev].cap += flow;\n return flow;\n }\n }\n // 見つからず\n return 0;\n }\n\n ll max_flow(ll s,ll t){\n ll Total_Flow = 0;\n while(true){\n for(ll i = 0;i < siz;i++)used[i] = false;\n ll F = dfs(s,t,INF);\n\n //流せなくなった\n if(F== 0)break;\n Total_Flow += F;\n }\n return Total_Flow;\n }\n};\n \nint main(){\n ios::sync_with_stdio(false);cin.tie(nullptr);\n while(true){\n LL(n);\n if(n == 0)break;\n LL(m);\n map<ll,ll> mp;\n rep(i,m){\n LL(u);\n ll siz = sz(mp);\n mp[u];\n }\n ll idx = 0;\n for (auto& elem : mp) elem.second = idx++;\n MaximumFlow mf(n+m+2);\n rep(i,m){\n mf.add_edge(n+m,i,1);\n }\n rep(i,n){\n LL(x);\n rep(j,x){\n LL(v);\n if(mp.contains(v)){\n mf.add_edge(mp[v],i+m,1);\n }\n }\n mf.add_edge(i+m,n+m+1,1);\n }\n cout << mf.max_flow(n+m,n+m+1) << endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":4096,"score_of_the_acc":-0.5697,"final_rank":12},{"submission_id":"aoj_2064_9341738","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nstruct Dinic {\nprivate:\n const long long inf = 1e18;\n vector<int> dist; //sからの距離\n vector<int> iter; //どこまで調べたか\npublic:\n struct edge {\n int to, rev; long long cap;\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\n };\n\n int n;\n vector<vector<edge>> to;\n\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\n\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\n int su = (int)to[u].size(), sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap });\n to[v].push_back({ u, su, 0 });\n }\n\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\n if (v == t) return f;\n int sv = (int)to[v].size();\n for (int& i = iter[v]; i < sv; i++) {\n edge& nv = to[v][i];\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\n long long nf = dfs(nv.to, t, min(f, nv.cap));\n if (nf > 0) {\n nv.cap -= nf;\n to[nv.to][nv.rev].cap += nf;\n return nf;\n }\n }\n return 0;\n }\n\n void bfs(int s) {\n dist.assign(n, -1);\n queue<int> q;\n q.push(s);\n dist[s] = 0;\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (auto nv : to[v]) {\n if (nv.cap > 0 && dist[nv.to] < 0) {\n dist[nv.to] = dist[v] + 1;\n q.push(nv.to);\n }\n }\n }\n }\n\n long long maxflow(int s, int t) {//s:始点, t:終点\n long long res = 0, flow = 0;\n while (true) {\n bfs(s);\n if (dist[t] < 0) break;\n\n iter.assign(n, 0);\n while (flow = dfs(s, t, inf)) res += flow;\n };\n return res;\n }\n};\n\n\nint main()\n{ \n int n;\n while (cin >> n, n) {\n int m;\n cin >> m;\n map<int, int> mp;\n rep(i, m) {\n int x;\n cin >> x;\n mp[x];\n }\n int idx = 0;\n for (auto& elem : mp) elem.second = idx++;\n\n Dinic dn(m + n + 2);\n int S = m + n, T = m + n + 1;\n rep(i, m) dn.addedge(S, i, 1);\n rep(i, n) dn.addedge(i + m, T, 1);\n\n rep(i, n) {\n int mg = 0;\n cin >> mg;\n rep(j, mg) {\n int x;\n cin >> x;\n if (mp.count(x)) dn.addedge(mp[x], i + m, 1);\n }\n }\n\n int flow = dn.maxflow(S, T);\n cout << flow << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3696,"score_of_the_acc":-0.6677,"final_rank":14},{"submission_id":"aoj_2064_2743724","code_snippet":"#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n \nusing namespace std;\n \n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n \ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\" \"; cerr<<endl; }\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\n \ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n \nstruct edge { int to, cap, rev; };\nconst int MAX_V = 100000;\n \nvector<edge> G[MAX_V];\nint level[MAX_V];\nint iter[MAX_V];\n \nvoid add_edge(int from, int to, int cap){\n //printf(\"add %d -> %d (%d)\\n\", from, to, cap);\n G[from].push_back((edge){to, cap, G[to].size()});\n G[to].push_back((edge){from, 0, G[from].size()-1});\n}\nvoid bfs(int s){\n memset(level, -1, sizeof(level));\n queue<int> que;\n level[s] = 0;\n que.push(s);\n while(!que.empty()){\n int v = que.front(); que.pop();\n for(int i = 0; i < 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 \nint dfs(int v, int t, int f){\n if(v == t) return f;\n for (int &i = iter[v]; i < G[v].size(); i++){\n edge &e = G[v][i];\n if(e.cap > 0 && level[v] < level[e.to]){\n int d = dfs(e.to, t, min(f, e.cap));\n if(d > 0){\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n}\n \nint Denic(int s, int t){\n int flow = 0;\n while(true){\n bfs(s);\n if(level[t] < 0) break;;\n memset(iter, 0, sizeof(iter));\n int f;\n while((f = dfs(s, t, INF)) > 0){\n flow += f;\n }\n }\n return flow;\n}\nint main(){\n int N;\n while(cin>>N && N){\n REP(i, MAX_V) G[i].clear();\n int M; cin>>M;\n vector<int> myday;\n REP(i, M){\n int t; cin>>t;\n myday.push_back(t);\n }\n sort(myday.begin(), myday.end());\n REP(i, N){\n int M2;\n cin>>M2;\n while(M2--){\n int t; cin>>t;\n if(binary_search(myday.begin(), myday.end(), t)){\n int idx = lower_bound(myday.begin(), myday.end(), t) - myday.begin();\n add_edge(i, N + idx, 1);\n }\n }\n }\n const int S = N + M;\n const int G = S + 1;\n REP(i, N){\n add_edge(S, i, 1);\n }\n REP(i, M){\n add_edge(N + i, G, 1);\n }\n cout<<Denic(S, G)<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":6232,"score_of_the_acc":-1.2857,"final_rank":19},{"submission_id":"aoj_2064_2741021","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#define NUM 3000\n\n\n//辺を表す構造体(行先、容量、逆辺のインデックス)\nstruct Edge{\n\tEdge(int arg_to,int arg_capacity,int arg_rev_index){\n\t\tto = arg_to;\n\t\tcapacity = arg_capacity;\n\t\trev_index = arg_rev_index;\n\t}\n\tint to,capacity,rev_index;\n};\n\nint V,E;\nint N;\nmap<int,int> MAP;\nvector<Edge> G[NUM]; //グラフの隣接リスト表現\nint dist[NUM]; //sourceからの距離\nint cheked_index[NUM]; //どこまで調べ終わったか\n\n//fromからtoへ向かう容量capacityの辺をグラフに追加する\nvoid add_edge(int from,int to,int capacity){\n\tG[from].push_back(Edge(to,capacity,G[to].size()));\n\tG[to].push_back(Edge(from,0,G[from].size()-1)); //逆辺の、初期容量は0\n}\n\n//sourceからの最短距離をBFSで計算する\nvoid bfs(int source){\n\tfor(int i = 0; i < V; i++)dist[i] = -1;\n\tqueue<int> Q;\n\tdist[source] = 0;\n\tQ.push(source);\n\n\twhile(!Q.empty()){\n\t\tint node_id = Q.front();\n\t\tQ.pop();\n\t\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\t\tEdge &e = G[node_id][i];\n\t\t\tif(e.capacity > 0 && dist[e.to] < 0){ //辺の容量が正で、かつエッジの行先に未訪問の場合\n\t\t\t\tdist[e.to] = dist[node_id]+1;\n\t\t\t\tQ.push(e.to);\n\t\t\t}\n\t\t}\n\t}\n}\n\n//増加パスをDFSで探す\nint dfs(int node_id,int sink,int flow){\n\tif(node_id == sink)return flow; //終点についたらflowをreturn\n\n\tfor(int &i = cheked_index[node_id]; i < G[node_id].size(); i++){ //node_idから出ているエッジを調査\n\t\tEdge &e = G[node_id][i];\n\t\tif(e.capacity > 0 && dist[node_id] < dist[e.to]){ //流せる余裕があり、かつsourceからの距離が増加する方法である場合\n\t\t\tint tmp_flow = dfs(e.to,sink,min(flow,e.capacity)); //流せるだけ流す\n\t\t\tif(tmp_flow > 0){ //流せた場合\n\t\t\t\te.capacity -= tmp_flow; //流した分、エッジの容量を削減する\n\t\t\t\tG[e.to][e.rev_index].capacity += tmp_flow; //逆辺の容量を、流した分だけ増加させる\n\t\t\t\treturn tmp_flow;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\n\n//sourceからsinkへの最大流を求める\nint max_flow(int source,int sink){ //source:始点 sink:終点\n\tint flow = 0,add;\n\twhile(true){ //増加パスが存在する限り、流量を追加し続ける\n\t\tbfs(source);\n\t\tif(dist[sink] < 0)break; //sourceからsinkへと辿り着く残余グラフがない、つまり増加パスが無くなった場合、break\n\t\tfor(int i = 0; i < V; i++)cheked_index[i] = 0;\n\t\twhile((add = dfs(source,sink,BIG_NUM)) > 0){ //増加パスが見つかる間、加算\n\t\t\tflow += add;\n\t\t}\n\t}\n\treturn flow;\n}\n\nvoid func(){\n\n\tMAP.clear();\n\tfor(int i = 0; i < NUM; i++)G[i].clear();\n\n\tint num,tmp,index = 2;\n\tscanf(\"%d\",&num);\n\n\tint source = 0,sink = 1;\n\n\tfor(int loop = 0; loop < num; loop++){\n\t\tscanf(\"%d\",&tmp);\n\t\tMAP[tmp] = index;\n\t\tadd_edge(source,index,1); //sourceからindexに、容量1の辺を張る\n\t\tindex++;\n\t}\n\n\tint integrate;\n\n\tfor(int loop = 0; loop < N; loop++){\n\t\tscanf(\"%d\",&num);\n\t\tadd_edge(index,sink,1); //1人の人物につき、最大流量1の集約路を張る\n\t\tintegrate = index;\n\t\tindex++;\n\n\t\tfor(int i = 0; i < num; i++){\n\t\t\tscanf(\"%d\",&tmp);\n\t\t\tauto at = MAP.find(tmp);\n\t\t\tif(at == MAP.end())continue; //Isaccの都合の良い日でなければ無視\n\t\t\tadd_edge(MAP[tmp],integrate,1); //Isaccの都合の良い日から、\n\t\t}\n\t}\n\n\tV = index;\n\n\tprintf(\"%d\\n\", max_flow(source,sink));\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":3476,"score_of_the_acc":-0.4805,"final_rank":7},{"submission_id":"aoj_2064_2729687","code_snippet":"#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nstruct Dinic{\n const int INF=1<<28;\n \n struct edge {\n int to,cap,rev;\n edge(){}\n edge(int to,int cap,int rev):to(to),cap(cap),rev(rev){}\n };\n\n int n;\n vector<vector<edge> > G;\n vector<map<int,int> > M;\n vector<int> level,iter;\n\n Dinic(){}\n Dinic(int sz):n(sz),G(n),M(n),level(n),iter(n){}\n \n void add_edge(int from,int to,int cap){\n M[from][to]=G[from].size();\n M[to][from]=G[to].size();\n G[from].push_back(edge(to,cap,G[to].size()));\n // undirected\n //G[to].push_back(edge(from,cap,G[from].size()-1));\n // directed\n G[to].push_back(edge(from,0,G[from].size()-1));\n }\n \n void bfs(int s){\n fill(level.begin(),level.end(),-1);\n queue<int> que;\n level[s]=0;\n que.push(s);\n while(!que.empty()){\n int v=que.front();que.pop();\n for(int i=0;i<(int)G[v].size();i++){\n edge &e = G[v][i];\n if(e.cap>0&&level[e.to]<0){\n level[e.to]=level[v]+1;\n que.push(e.to);\n }\n }\n }\n }\n \n int dfs(int v,int t,int f){\n if(v==t) return f;\n for(int &i=iter[v];i<(int)G[v].size();i++){\n edge &e=G[v][i];\n if(e.cap>0&&level[v]<level[e.to]){\n int d = dfs(e.to,t,min(f,e.cap));\n if(d>0){\n e.cap-=d;\n G[e.to][e.rev].cap+=d;\n return d;\n }\n }\n }\n return 0;\n }\n \n int flow(int s,int t,int lim){\n int fl=0;\n for(;;){\n bfs(s);\n if(level[t]<0||lim==0) return fl;\n fill(iter.begin(),iter.end(),0);\n int f;\n while((f=dfs(s,t,lim))>0){\n fl+=f;\n lim-=f;\n }\n }\n }\n\n int flow(int s,int t){\n return flow(s,t,INF);\n }\n\n //cap==1 only\n bool back_edge(int s,int t,int from, int to){\n for(int i=0;i<(int)G[from].size();i++) {\n edge& e=G[from][i];\n if(e.to==to) {\n if(e.cap==0&&flow(from,to,1)==0) {\n flow(from,s,1);\n flow(t,to,1);\n return 1;\n }\n }\n }\n return 0;\n }\n};\nint main(){\n int n,m,x,N;\n while(cin>>n,n){\n map<int,int>M;\n cin>>N;\n r(i,N){\n cin>>x;\n M[x]=i;\n }\n Dinic d(N+n+2);\n r(i,N)d.add_edge(N+n,i,1);\n r(i,n)d.add_edge(N+i,N+n+1,1);\n r(i,n){\n cin>>m;\n r(j,m){\n cin>>x;\n if(M.count(x))d.add_edge(M[x],N+i,1);\n }\n }\n cout<<d.flow(N+n,N+n+1,1e8)<<endl;\n }\n}","accuracy":1,"time_ms":110,"memory_kb":3676,"score_of_the_acc":-0.7708,"final_rank":16},{"submission_id":"aoj_2064_2488730","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\nstruct Dinic {\n\tusing Flow = int;\n\tstruct Edge {\n\t\tint to, rev;\n\t\tFlow cap;\n\t\tEdge() {}\n\t\tEdge(int to, int rev, Flow cap) :to(to), rev(rev), cap(cap) {}\n\t};\n\tint n;\n\tvector<vector<Edge>> g;\n\tvector<bool> used;\n\tvector<int> level;\n\tvector<int> iter;\n\tDinic(int n) :n(n), g(n), used(n), level(n), iter(n) {};\n\tvoid addArc(int from, int to, Flow cap) {\n\t\tg[from].emplace_back(to, (int)g[to].size(), cap);\n\t\tg[to].emplace_back(from, (int)g[from].size() - 1, 0);\n\t}\n\tvoid addEdge(int a, int b, Flow cap) {\n\t\tg[a].emplace_back(b, (int)g[b].size(), cap);\n\t\tg[b].emplace_back(a, (int)g[a].size() - 1, cap);\n\t}\n\tFlow maximumFlow(int s, int t) {\n\t\tFlow total = 0;\n\t\twhile (true) {\n\t\t\tlevelize(s);\n\t\t\tif (level[t] < 0)return total;\n\t\t\tfill(iter.begin(), iter.end(), 0);\n\t\t\tFlow f;\n\t\t\twhile (true) {\n\t\t\t\tf = augment(s, t, INF);\n\t\t\t\tif (f == 0)break;\n\t\t\t\ttotal += f;\n\t\t\t}\n\t\t}\n\t}\n\tFlow augment(int v, int t, Flow f) {\n\t\tif (v == t)return f;\n\t\tfor (int &i = iter[v]; i < g[v].size(); i++) {\n\t\t\tEdge &e = g[v][i];\n\t\t\tif (e.cap > 0 && level[v] < level[e.to]) {\n\t\t\t\tFlow d = augment(e.to, t, min(f, e.cap));\n\t\t\t\tif (d > 0) {\n\t\t\t\t\te.cap -= d;\n\t\t\t\t\tg[e.to][e.rev].cap += d;\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\tvoid levelize(int s) {\n\t\tfill(level.begin(), level.end(), -1);\n\t\tqueue<int> q;\n\t\tlevel[s] = 0;\n\t\tq.push(s);\n\t\twhile (q.size()) {\n\t\t\tint v = q.front(); q.pop();\n\t\t\tfor (int i = 0; i < g[v].size(); i++) {\n\t\t\t\tEdge &e = g[v][i];\n\t\t\t\tif (e.cap > 0 && level[e.to] < 0) {\n\t\t\t\t\tlevel[e.to] = level[v] + 1;\n\t\t\t\t\tq.push(e.to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n};\n\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tfor (int N; cin >> N&&N;) {\n\t\tint M; cin >> M;\n\t\tDinic dinic(M + N + 2);\n\t\tint s = dinic.n - 2, t = s + 1;\n\t\tunordered_map<int, int> mp;\n\t\trep(i, 0, M) { int d; cin >> d; mp[d] = i; }\n\t\trep(i, 0, N) {\n\t\t\tint m; cin >> m;\n\t\t\trep(j, 0, m) {\n\t\t\t\tint d; cin >> d;\n\t\t\t\tif (mp.count(d))\n\t\t\t\t\tdinic.addArc(mp[d], M + i, 1);\n\t\t\t}\n\t\t}\n\t\trep(i, 0, M)dinic.addArc(s, i, 1);\n\t\trep(i, 0, N)dinic.addArc(M + i, t, 1);\n\t\tcout << dinic.maximumFlow(s, t) << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3288,"score_of_the_acc":-0.4069,"final_rank":2},{"submission_id":"aoj_2064_2414678","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\nstruct edge{int to,cap,rev;};\n\nconst int MAX_V = 2000;\nconst int F_INF = 19191919;\nvector<edge> G[MAX_V];\nint lv[MAX_V], it[MAX_V];\n\nvoid add_edge(int from, int to, int cap){\n G[from].pb({to,cap,(int)G[to].size()});\n G[to].pb({from,0,(int)G[from].size()-1});\n}\n\nvoid dinic_bfs(int s){\n fill(lv,lv+MAX_V,-1);\n queue<int> que;\n lv[s]=0;\n que.push(s);\n while(!que.empty()){\n int v = que.front(); que.pop();\n rep(i,G[v].size()){\n edge &e = G[v][i];\n if(e.cap>0 && lv[e.to]<0){\n lv[e.to] = lv[v]+1;\n que.push(e.to);\n }\n }\n }\n}\n\nint dinic_dfs(int v, int t, int f){\n if(v==t) return f;\n for(int &i=it[v]; i<G[v].size(); ++i){\n edge &e = G[v][i];\n if(e.cap>0 && lv[v]<lv[e.to]){\n int 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\nint max_flow(int s, int t){\n int flow = 0;\n while(1){\n dinic_bfs(s);\n if(lv[t]<0) return flow;\n fill(it,it+MAX_V,0);\n int f;\n while((f=dinic_dfs(s,t,F_INF))>0) flow+=f;\n }\n}\n\nint main()\n{\n int n;\n while(scanf(\" %d\", &n),n)\n {\n rep(i,MAX_V) G[i].clear();\n\n unordered_map<int,int> m;\n int M = 0;\n\n int ISSAC;\n scanf(\" %d\", &ISSAC);\n while(ISSAC--)\n {\n int day;\n scanf(\" %d\", &day);\n if(!m.count(day)) m[day] = M++;\n }\n\n vector<int> k(n);\n vector<vector<int>> s(n);\n\n rep(i,n)\n {\n scanf(\" %d\", &k[i]);\n rep(j,k[i])\n {\n int day;\n scanf(\" %d\", &day);\n if(m.count(day)) s[i].pb(m[day]);\n }\n k[i] = s[i].size();\n }\n\n int S = n+M, T = S+1;\n rep(i,n)\n {\n add_edge(S,i,1);\n rep(j,k[i]) add_edge(i,n+s[i][j],1);\n }\n rep(i,M) add_edge(n+i,T,1);\n\n printf(\"%d\\n\", max_flow(S,T));\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3688,"score_of_the_acc":-0.5232,"final_rank":11},{"submission_id":"aoj_2064_2198699","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#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)\n\nconst int inf = 1e9;\n\n#define MAX_V 3000\n\nstruct edge {\n int to, cap, rev;\n edge(){}\n edge(int to, int cap, int rev):to(to), cap(cap), rev(rev){}\n};\nvector<edge> graph[MAX_V];\nint level[MAX_V], iter[MAX_V];\nvoid add_edge(int from, int to, int cap) {\n graph[from].emplace_back(to, cap, (int)graph[to].size());\n graph[to].emplace_back(from, 0, (int)graph[from].size()-1);\n}\nvoid bfs(int s) {\n memset(level, -1, sizeof(level));\n level[s] = 0;\n queue<int> que;\n que.push(s);\n while(que.size()) {\n int v = que.front(); que.pop();\n for(edge& e : graph[v]) {\n if(e.cap > 0 && level[e.to] < 0) {\n\tlevel[e.to] = level[v] + 1;\n\tque.push(e.to);\n }\n }\n }\n}\nint dfs(int v, int t, int f) {\n if(v == t) return f;\n for(int& i = iter[v]; i < (int)graph[v].size(); i++) {\n edge& e = graph[v][i];\n if(e.cap > 0 && level[v] < level[e.to]) {\n int d = dfs(e.to, t, min(e.cap, f));\n if(d > 0) {\n\te.cap -= d;\n\tgraph[e.to][e.rev].cap += d;\n\treturn d;\n }\n }\n }\n return 0;\n}\nint max_flow(int s, int t) {\n int flow = 0;\n while(1) {\n bfs(s);\n if(level[t] < 0) return flow;\n memset(iter, 0, sizeof(iter));\n int f; while((f = dfs(s, t, inf)) > 0) flow += f;\n }\n}\n\n\nint N, M;\nmap<int, int> mp;\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, N) {\n int s = 0, t = 1, V = 2;\n rep(i, MAX_V) graph[i].clear();\n mp.clear();\n cin >> M;\n rep(i, M) {\n int d; cin >> d;\n mp[d] = V++;\n }\n for(auto p : mp) add_edge(s, p.second, 1);\n rep(i, N) {\n cin >> M;\n rep(j, M) {\n\tint d; cin >> d;\n\tif(mp.count(d)) add_edge(mp[d], V+i, 1);\n }\n add_edge(V+i, t, 1);\n }\n cout << max_flow(s, t) << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3268,"score_of_the_acc":-0.4743,"final_rank":6},{"submission_id":"aoj_2064_2173833","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nstruct BipartiteMatching {\n\tint V;\n\tvector<vector<bool> > G;\n\tvector<int> match;\n\tvector<bool> used;\n\n\tBipartiteMatching(int v) {\n\t\tV = v;\n\t\tG = vector<vector<bool> >(v, vector<bool>(v));\n\t\tmatch = vector<int>(v);\n\t\tused = vector<bool>(v);\n\t}\n\n\tvoid add_edge(int v, int u) {\n\t\tG[v][u] = G[u][v] = true;\n\t}\n\n\tbool dfs(int v) {\n\t\tused[v] = true;\n\t\tfor(int i = 0; i < V; i++) {\n\t\t\tif(!G[v][i]) continue;\n\t\t\tint u = i, w = match[u];\n\t\t\tif(w < 0 || (!used[w] && dfs(w))) {\n\t\t\t\tmatch[v] = u;\n\t\t\t\tmatch[u] = v;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\tint calc() {\n\t\tint res = 0;\n\t\tfill(match.begin(), match.end(), -1);\n\t\tfor(int v = 0; v < V; v++) {\n\t\t\tif(match[v] < 0) {\n\t\t\t\tfill(used.begin(), used.end(), false);\n\t\t\t\tif(dfs(v)) {\n\t\t\t\t\tres++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n};\n\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint N;\n\twhile(cin >> N, N) {\n\t\tint M;\n\t\tcin >> M;\n\t\tmap<int, int> id;\n\t\tfor(int i = 0; i < M; i++) {\n\t\t\tint a;\n\t\t\tcin >> a;\n\t\t\tid[a] = -1;\n\t\t}\n\t\tint cnt = 0;\n\t\tfor(auto v : id) {\n\t\t\tid[v.first] = cnt++;\n\t\t}\n\n\t\tBipartiteMatching bm(cnt + N);\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tcin >> M;\n\t\t\tfor(int j = 0; j < M; j++) {\n\t\t\t\tint a;\n\t\t\t\tcin >> a;\n\t\t\t\tif(id.count(a) == 0) continue;\n\t\t\t\tbm.add_edge(id[a], cnt + i);\n\t\t\t}\n\t\t}\n\n\t\tcout << bm.calc() << endl;\n\t}\n\n}","accuracy":1,"time_ms":250,"memory_kb":3256,"score_of_the_acc":-1.1862,"final_rank":18},{"submission_id":"aoj_2064_2040185","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 \nnamespace flow {\n \nclass bipartite_matching {\nprivate:\n \n int V;\n vector<vector<int>> G;\n vector<int> match;\n vector<bool> used;\n \n bool dfs(int v) {\n used[v] = 1;\n for(auto& u: G[v]) {\n int 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 \n \npublic:\n \n bipartite_matching(int V): V(V) {\n G.resize(V), match.resize(V), used.resize(V);\n }\n \n void add_edge(int u, int v) {\n G[u].push_back(v);\n G[v].push_back(u);\n }\n \n int maximum_matching() {\n int ret = 0;\n match.clear(), match.resize(V, -1);\n rep(v, V) {\n if(match[v] < 0) {\n used.clear(), used.resize(V, 0);\n if(dfs(v)) { ret ++; }\n }\n }\n return ret;\n }\n};\n \n}\n \nint main() {\n \n for(int N; cin >> N && N;) {\n int M; cin >> M;\n \n int dcnt = 0;\n unordered_map<int, int> dayidx;\n rep(i, M) {\n int x; cin >> x;\n if(dayidx.find(x) == dayidx.end()) {\n dayidx[x] = dcnt++;\n }\n }\n \n flow::bipartite_matching bp(dcnt + N);\n \n rep(girl, N) {\n cin >> M;\n rep(i, M) {\n int k; cin >> k;\n if(dayidx.find(k) != dayidx.end())\n bp.add_edge(dayidx[k], dcnt + girl);\n }\n }\n \n cout << bp.maximum_matching() << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":3212,"score_of_the_acc":-0.6773,"final_rank":15},{"submission_id":"aoj_2064_2040159","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\nnamespace flow {\n\nclass bipartite_matching {\nprivate:\n\n int V;\n vector<vector<int>> G;\n vector<int> match;\n vector<bool> used;\n\n bool dfs(int v) {\n used[v] = 1;\n for(auto& u: G[v]) {\n int 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\n\npublic:\n\n bipartite_matching(int V): V(V) {\n G.resize(V), match.resize(V), used.resize(V);\n }\n\n void add_edge(int u, int v) {\n G[u].push_back(v);\n G[v].push_back(u);\n }\n\n int maximum_matching() {\n int ret = 0;\n match.clear(), match.resize(V, -1);\n rep(v, V) {\n if(match[v] < 0) {\n used.clear(), used.resize(V, 0);\n if(dfs(v)) { ret ++; }\n }\n }\n return ret;\n }\n};\n\n}\n\nint main() {\n\n for(int N; cin >> N && N;) {\n int M; cin >> M;\n\n int dcnt = 0;\n map<int, int> dayidx;\n rep(i, M) {\n int x; cin >> x;\n if(dayidx.find(x) == dayidx.end()) {\n dayidx[x] = dcnt++;\n }\n }\n\n flow::bipartite_matching bp(dcnt + N);\n\n rep(girl, N) {\n cin >> M;\n rep(i, M) {\n int k; cin >> k;\n if(dayidx.find(k) != dayidx.end())\n bp.add_edge(dayidx[k], dcnt + girl);\n }\n }\n\n cout << bp.maximum_matching() << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":3232,"score_of_the_acc":-0.7885,"final_rank":17},{"submission_id":"aoj_2064_1914970","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX_V 3000\n#define INF 1e9\n \nstruct edge{ int to,cap,rev; };\n \nvector<edge> G[MAX_V];\nint level[MAX_V],iter[MAX_V];\n \nvoid add_edge(int from,int to,int cap){\n G[from].push_back((edge){to,cap,G[to].size()});\n G[to].push_back((edge){from,0,G[from].size()-1});\n}\n \nvoid bfs(int s){\n memset(level,-1,sizeof(level));\n queue<int> Q;\n level[s] = 0;\n Q.push(s);\n while(!Q.empty()){\n\tint v = Q.front(); Q.pop();\n\tfor(int i = 0 ; i < (int)G[v].size() ; i++){\n\t edge &e = G[v][i];\n\t if(e.cap > 0 && level[e.to] < 0){\n\t\tlevel[e.to] = level[v] + 1;\n\t\tQ.push(e.to);\n\t }\n\t}\n }\n}\n \nint dfs(int v,int t,int f){\n if(v == t) return f;\n for(int &i = iter[v] ; i < (int)G[v].size() ; i++){\n\tedge &e = G[v][i];\n\tif(e.cap > 0 && level[v] < level[e.to]){\n\t int d = dfs(e.to,t,min(f,e.cap));\n\t if(d > 0){\n\t\te.cap -= d;\n\t\tG[e.to][e.rev].cap += d;\n\t\treturn d;\n\t }\n\t}\n }\n return 0;\n}\n \nint max_flow(int s,int t){\n int flow = 0;\n for(;;){\n\tbfs(s);\n\tif(level[t] < 0) return flow;\n\tmemset(iter,0,sizeof(iter));\n\tint f;\n\twhile((f = dfs(s,t,INF)) > 0){\n\t flow += f;\n\t}\n }\n}\n \nint main(){\n int N;\n while(cin >> N,N){\n\tfor(int i = 0 ; i < MAX_V ; i++){\n\t G[i].clear();\n\t}\n\tint k,x,n;\n\tcin >> n;\n\tint S = N+n,T = S+1;\n\tmap<int,int> mp;\n\tfor(int i = 0 ; i < n ; i++){\n\t cin >> x;\n\t mp[x] = i;\n\t}\n\tmap<int,int>::iterator it;\n\tfor(it = mp.begin() ; it != mp.end() ; ++it){\n\t add_edge(S,it->second,1);\n\t}\n\tfor(int i = 0 ; i < N ; i++){\n\t cin >> k;\n\t for(int j = 0 ; j < k ; j++){\n\t\tcin >> x;\n\t\tif(mp.find(x) != mp.end()){\n\t\t add_edge(mp[x],n+i,1);\n\t\t}\n\t }\n\t add_edge(n+i,T,1);\n\t}\n\tcout << max_flow(S,T) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":1532,"score_of_the_acc":-0.446,"final_rank":3},{"submission_id":"aoj_2064_1331970","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX_V 3000\n#define INF 1e9\n\nstruct edge{ int to,cap,rev; };\n\nvector<edge> G[MAX_V];\nint level[MAX_V],iter[MAX_V];\n\nvoid add_edge(int from,int to,int cap){\n G[from].push_back((edge){to,cap,G[to].size()});\n G[to].push_back((edge){from,0,G[from].size()-1});\n}\n\nvoid bfs(int s){\n memset(level,-1,sizeof(level));\n queue<int> Q;\n level[s] = 0;\n Q.push(s);\n while(!Q.empty()){\n int v = Q.front(); Q.pop();\n for(int i = 0 ; i < (int)G[v].size() ; i++){\n edge &e = G[v][i];\n if(e.cap > 0 && level[e.to] < 0){\n level[e.to] = level[v] + 1;\n Q.push(e.to);\n }\n }\n }\n}\n\nint dfs(int v,int t,int f){\n if(v == t) return f;\n for(int &i = iter[v] ; i < (int)G[v].size() ; i++){\n edge &e = G[v][i];\n if(e.cap > 0 && level[v] < level[e.to]){\n int d = dfs(e.to,t,min(f,e.cap));\n if(d > 0){\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n}\n\nint max_flow(int s,int t){\n int flow = 0;\n for(;;){\n bfs(s);\n if(level[t] < 0) return flow;\n memset(iter,0,sizeof(iter));\n int f;\n while((f = dfs(s,t,INF)) > 0){\n flow += f;\n }\n }\n}\n\nint main(){\n int N;\n while(cin >> N,N){\n for(int i = 0 ; i < MAX_V ; i++){\n G[i].clear();\n }\n int k,x,n;\n cin >> n;\n int S = N+n,T = S+1;\n map<int,int> mp;\n for(int i = 0 ; i < n ; i++){\n cin >> x;\n mp[x] = i;\n }\n map<int,int>::iterator it;\n for(it = mp.begin() ; it != mp.end() ; ++it){\n add_edge(S,it->second,1);\n }\n for(int i = 0 ; i < N ; i++){\n cin >> k;\n for(int j = 0 ; j < k ; j++){\n cin >> x;\n if(mp.find(x) != mp.end()){\n add_edge(mp[x],n+i,1);\n }\n }\n add_edge(n+i,T,1);\n }\n cout << max_flow(S,T) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":1532,"score_of_the_acc":-0.446,"final_rank":3},{"submission_id":"aoj_2064_1150189","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\nusing namespace std;\nconst int D_MAX_V=2102;\nconst int D_v_size=2102;\nstruct D_wolf{\n\tint t,c,r;\n\tD_wolf(){t=c=r=0;}\n\tD_wolf(int t1,int 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,int 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}\nint D_dfs(int v,int t,int 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\tint 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}\nint max_flow(int s,int t){\n\tint 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\tint f;\n\t\twhile((f=D_dfs(s,t,99999999))>0){flow+=f;}\n\t}\n\treturn 0;\n}\nint main(){\n\tint a;\n\twhile(scanf(\"%d\",&a),a){\n\t\tfor(int i=0;i<2102;i++){\n\t\t\tD_G[i].clear();\n\t\t\tD_iter[i]=D_level[i]=0;\n\t\t}\n\t\tint n;scanf(\"%d\",&n);\n\t\tmap<int,int>c;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint b;scanf(\"%d\",&b);\n\t\t\tc[b]=i;\n\t\t}\n\t\tint s=2100;\n\t\tint t=2101;\n\t\tfor(int i=0;i<n;i++)add_edge(s,i,1);\n\t\tfor(int i=0;i<a;i++){\n\t\t\tint m;scanf(\"%d\",&m);\n\t\t\tfor(int j=0;j<m;j++){\n\t\t\t\tint p;scanf(\"%d\",&p);\n\t\t\t\tif(c.count(p)){\n\t\t\t\t\tadd_edge(c[p],i+n,1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<a;i++)add_edge(i+n,t,1);\n\t\tprintf(\"%d\\n\",max_flow(s,t));\n\t}\n}","accuracy":1,"time_ms":80,"memory_kb":1268,"score_of_the_acc":-0.1786,"final_rank":1},{"submission_id":"aoj_2064_1124230","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 <cassert>\n#include <queue>\n#include <cstring>\nusing namespace std;\nstatic const double EPS = 1e-9;\ntypedef long long ll;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define rev(i,n) for(int i=n-1;i>=0;i--)\n#define sz(a) a.size()\n#define all(a) a.begin(),a.end()\n#define mp(a,b) make_pair(a,b)\n#define pb(a) push_back(a)\n#define SS stringstream\n#define DBG1(a) rep(_X,sz(a)){printf(\"%d \",a[_X]);}puts(\"\");\n#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf(\"%d \",a[_X][_Y]);puts(\"\");}\n#define bitcount(b) __builtin_popcount(b)\n#define fi first\n#define se second\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 Edge(int src, int dst) :\n src(src), dst(dst), weight(0) { }\n};\nbool operator < (const Edge &e, const Edge &f) {\n return e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!\n e.src != f.src ? e.src < f.src : e.dst < f.dst;\n}\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\ntypedef vector<Weight> Array;\ntypedef vector<Array> Matrix;\n\nbool augment(const Graph& g, int u,\n vector<int>& matchTo, vector<bool>& visited) {\n if (u < 0) return true;\n FOR(e, g[u]) if (!visited[e->dst]) {\n visited[e->dst] = true;\n if (augment(g, matchTo[e->dst], matchTo, visited)) {\n matchTo[e->src] = e->dst;\n matchTo[e->dst] = e->src;\n return true;\n }\n }\n return false;\n}\nint bipartiteMatching(const Graph& g, int L, Edges& matching) {\n const int n = g.size();\n vector<int> matchTo(n, -1);\n int match = 0;\n REP(u, L) {\n vector<bool> visited(n);\n if (augment(g, u, matchTo, visited)) ++match;\n }\n REP(u, L) if (matchTo[u] >= 0) // make explicit matching\n matching.push_back( Edge(u, matchTo[u]) );\n return match;\n}\n\nint main(){\n\tint N;\n\twhile(cin >> N && N){\n\t\tset<int> w;\n\t\tint a,b;\n\t\tcin >> a;\n\t\tvector<int> day;\n\t\tfor(int i = 0 ; i < a ; i++){\n\t\t\tcin >> b;\n\t\t\tb--;\n\t\t\tw.insert(b);\n\t\t\tday.push_back(b);\n\t\t}\n\t\tEdges edge;\n\t\tfor(int i = 0 ; i < N ; i++){\n\t\t\tint t;\n\t\t\tcin >> t;\n\t\t\tfor(int j = 0 ; j < t ; j++){\n\t\t\t\tint s;\n\t\t\t\tcin >> s;\n\t\t\t\ts--;\n\t\t\t\tif(w.count(s)) edge.push_back(Edge(i,s));\n\t\t\t\tday.push_back(s);\n\t\t\t}\n\t\t}\n\t\tsort(day.begin(),day.end());\n\t\tday.erase(unique(day.begin(),day.end()),day.end());\n\t\tint ub = max(N,(int)day.size());\n\t\tGraph g(2*ub);\n\t\tfor(int i = 0 ; i < edge.size() ; i++){\n\t\t\tint a = edge[i].src;\n\t\t\tint b = ub + lower_bound(day.begin(),day.end(),edge[i].dst) - day.begin();\n\t\t\tg[a].push_back(Edge(a,b));\n\t\t\tg[b].push_back(Edge(b,a));\n\t\t\t//cout << a << \" \" << b << endl;\n\t\t}\n\t\tEdges tmp;\n\t\tcout << bipartiteMatching(g,ub,tmp) << endl;\n\t\t\n\t\t\n\t}\n}","accuracy":1,"time_ms":310,"memory_kb":4820,"score_of_the_acc":-1.7156,"final_rank":20},{"submission_id":"aoj_2064_799240","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<map>\n#include<cstring>\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 all(n) (n).begin(),(n).end()\n#define MAX_V 1100\nusing namespace std;\n \n//follow\nstruct edge\n{\n int to,cap,rev;\n edge(int to=inf,int cap=inf,int rev=inf):to(to),cap(cap),rev(rev){}\n};\n \nvector<edge> G[MAX_V];\nint level[MAX_V];\nint iter[MAX_V];\nbool used[MAX_V];\n \nvoid init(int V)\n{\n rep(i,V)G[i].clear();\n}\n \nvoid add_edge(int from,int to,int cap)\n{\n G[from].push_back(edge(to,cap,G[to].size()));\n G[to].push_back(edge(from,0,G[from].size()-1));\n}\n \nint dfs(int v,int t,int f)\n{\n if(v == t)return f;\n used[v] = true;\n for(int i=0;i<G[v].size();i++)\n {\n edge &e = G[v][i];\n if(e.cap > 0 && !used[e.to])\n {\n int d = dfs(e.to,t,min(f,e.cap));\n if(d > 0)\n {\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n}\n \nint max_flow(int s,int t)\n{\n int flow = 0;\n for(;;)\n {\n memset(used,0,sizeof(used));\n int f = dfs(s,t,inf);\n if(f == 0)\n {\n return flow;\n }\n flow += f;\n }\n}\n \n//\n \nint main()\n{\n int N,k,K,s,t,day;\n while(cin >> N,N)\n {\n cin >> k;\n K = k;\n s = k + N;\n t = s + 1;\n init(t+1);\n map<int,int> days;\n vector<int> vday;\n rep(i,k)\n {\n cin >> day;\n vday.push_back(day);\n }\n sort(all(vday));\n vday.erase(unique(all(vday)),vday.end());\n rep(i,vday.size())\n {\n days[vday[i]] = i;\n add_edge(s,i,1);\n }\n \n rep(i,N)\n {\n cin >> k;\n rep(j,k)\n {\n cin >> day;\n if(days.find(day) != days.end())\n {\n add_edge(days[day],K+i,1);\n }\n }\n add_edge(K+i,t,1);\n }\n \n cout << max_flow(s,t) << endl;\n \n }\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":1536,"score_of_the_acc":-0.4826,"final_rank":10},{"submission_id":"aoj_2064_798627","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<map>\n\n#define MAX_V 5000\n#define INF (1<<29)\n\nusing namespace std;\n\nstruct edge{int to,cap,rev;};\n\nvector<edge>g[MAX_V];\nbool used[MAX_V];\n\nvoid add_edge(int from,int to,int cap){\n g[from].push_back((edge){to,cap,g[to].size()});\n g[to].push_back((edge){from,0,g[from].size()-1});\n}\n\nint dfs(int v,int t,int f){\n if(v==t)return f;\n used[v]=true;\n for(int i=0;i<g[v].size();i++){\n edge &e=g[v][i];\n if(!used[e.to] && e.cap>0){\n int d=dfs(e.to,t,min(f,e.cap));\n if(d>0){\n e.cap-=d;\n g[e.to][e.rev].cap+=d;\n return d;\n }\n }\n }\n return 0;\n}\n\nint max_flow(int s,int t){\n int flow=0;\n for(;;){\n fill(used,used+MAX_V,false);\n int f=dfs(s,t,INF);\n if(f==0)return flow;\n flow+=f;\n }\n}\n\nint main(void){\n\n int n;\n while(cin >> n,n){\n\n for(int i=0;i<MAX_V;i++)g[i].clear();\n\n vector<int>a;\n map<int,int>mp;\n int m,in,tmp;\n cin >> tmp;\n for(int i=0;i<tmp;i++){\n cin >> in;\n add_edge(n+tmp,i,1);\n a.push_back(in);\n mp[in]=i;\n }\n\n for(int i=0;i<n;i++){\n cin >> m;\n vector<int>b(m);\n for(int j=0;j<m;j++)cin >> b[j];\n for(int j=0;j<m;j++){\n if(mp.count(b[j])){\n add_edge(mp[b[j]],i+tmp,1);\n }\n }\n }\n\n for(int i=0;i<n;i++){\n add_edge(i+tmp,n+tmp+1,1);\n }\n cout << max_flow(n+tmp,n+tmp+1) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":1532,"score_of_the_acc":-0.4818,"final_rank":8},{"submission_id":"aoj_2064_798621","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cassert>\n#include<map>\n\n#define MAX_V 5000\n#define INF (1<<29)\n\nusing namespace std;\n\nstruct edge{int to,cap,rev;};\n\nvector<edge>g[MAX_V];\nbool used[MAX_V];\n\nvoid add_edge(int from,int to,int cap){\n g[from].push_back((edge){to,cap,g[to].size()});\n g[to].push_back((edge){from,0,g[from].size()-1});\n}\n\nint dfs(int v,int t,int f){\n if(v==t)return f;\n used[v]=true;\n for(int i=0;i<g[v].size();i++){\n edge &e=g[v][i];\n if(!used[e.to] && e.cap>0){\n int d=dfs(e.to,t,min(f,e.cap));\n if(d>0){\n e.cap-=d;\n g[e.to][e.rev].cap+=d;\n return d;\n }\n }\n }\n return 0;\n}\n\nint max_flow(int s,int t){\n int flow=0;\n for(;;){\n fill(used,used+MAX_V,false);\n int f=dfs(s,t,INF);\n if(f==0)return flow;\n flow+=f;\n }\n}\nint main(void){\n\n int n;\n while(cin >> n,n){\n\n for(int i=0;i<MAX_V;i++)g[i].clear();\n\n vector<int>a;\n map<int,int>mp;\n int m,in,tmp;\n cin >> tmp;\n for(int i=0;i<tmp;i++){\n cin >> in;\n add_edge(n+tmp,i,1);\n a.push_back(in);\n mp[in]=i;\n }\n\n for(int i=0;i<n;i++){\n cin >> m;\n vector<int>b(m);\n for(int j=0;j<m;j++)cin >> b[j];\n for(int j=0;j<m;j++){\n if(mp.count(b[j])){\n add_edge(mp[b[j]],i+tmp,1);\n }\n }\n }\n\n for(int i=0;i<n;i++){\n add_edge(i+tmp,n+tmp+1,1);\n }\n cout << max_flow(n+tmp,n+tmp+1) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":1532,"score_of_the_acc":-0.4818,"final_rank":8},{"submission_id":"aoj_2064_798518","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<map>\n#include<cstring>\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 all(n) (n).begin(),(n).end()\n#define MAX_V 1100\nusing namespace std;\n\n//follow\nstruct edge\n{\n int to,cap,rev;\n edge(int to=inf,int cap=inf,int rev=inf):to(to),cap(cap),rev(rev){}\n};\n \nvector<edge> G[MAX_V];\nint level[MAX_V];\nint iter[MAX_V];\nbool used[MAX_V];\n \nvoid init(int V)\n{\n rep(i,V)G[i].clear();\n}\n \nvoid add_edge(int from,int to,int cap)\n{\n G[from].push_back(edge(to,cap,G[to].size()));\n G[to].push_back(edge(from,0,G[from].size()-1));\n}\n\nint dfs(int v,int t,int f)\n{\n if(v == t)return f;\n used[v] = true;\n for(int i=0;i<G[v].size();i++)\n {\n edge &e = G[v][i];\n if(e.cap > 0 && !used[e.to])\n\t{\n\t int d = dfs(e.to,t,min(f,e.cap));\n\t if(d > 0)\n\t {\n\t e.cap -= d;\n\t G[e.to][e.rev].cap += d;\n\t return d;\n\t }\n\t}\n }\n return 0;\n}\n \nint max_flow(int s,int t)\n{\n int flow = 0;\n for(;;)\n {\n memset(used,0,sizeof(used));\n int f = dfs(s,t,inf);\n if(f == 0)\n\t{\n\t return flow;\n\t}\n flow += f;\n }\n}\n \n//\n\nint main()\n{\n int N,k,K,s,t,day;\n while(cin >> N,N)\n {\n cin >> k;\n K = k;\n s = k + N;\n t = s + 1;\n init(t+1);\n map<int,int> days;\n vector<int> vday;\n rep(i,k)\n\t{\n\t cin >> day;\n\t vday.push_back(day);\n\t}\n sort(all(vday));\n vday.erase(unique(all(vday)),vday.end());\n rep(i,vday.size())\n\t{\n\t days[vday[i]] = i;\n\t add_edge(s,i,1);\n\t}\n\n rep(i,N)\n\t{\n\t cin >> k;\n\t rep(j,k)\n\t {\n\t cin >> day;\n\t if(days.find(day) != days.end())\n\t\t{\n\t\t add_edge(days[day],K+i,1);\n\t\t}\n\t }\n\t add_edge(K+i,t,1);\n\t}\n\n cout << max_flow(s,t) << endl;\n\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":1536,"score_of_the_acc":-0.4468,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_2064_11055694\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef long double ld;\\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\\n#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)\\n#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)\\n#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)\\n#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)\\n#define each(p,a) for(auto &p:a)\\ntypedef vector<ll> vll;\\ntypedef vector<pair<ll ,ll>> vpll;\\ntypedef vector<vector<pair<ll ,ll>>> vvpll;\\ntypedef vector<vector<ll>> vvll;\\ntypedef vector<vector<vector<ll>>> vvvll;\\ntypedef set<ll> sll;\\ntypedef map<ll , ll> mpll;\\ntypedef pair<ll ,ll> pll;\\ntypedef tuple<ll , ll , ll> tpl3;\\ntypedef tuple<ll , ll , ll , ll> tpl4;\\ntypedef tuple<ll , ll , ll , ll , ll> tpl5;\\ntypedef tuple<ll , ll , ll , ll , ll , ll> tpl6;\\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\\n#define all(a) (a).begin(),(a).end()\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n#define sz(x) (ll)x.size()\\n// << std::fixed << std::setprecision(10)\\nconst ll INF = 1LL << 60;\\nconst ld EPS = 1e-9;\\n \\nll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}\\nll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}\\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\\n//0indexed\\ninline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}\\ninline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}\\ntemplate<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}\\ntemplate<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\\ntemplate<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\\\" \\\":\\\"\\\");}return os;}\\ntemplate<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << \\\"{\\\" << p.first << \\\",\\\" << p.second << \\\"}\\\";return os;}\\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\\nvoid print(){cout << endl;}\\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\\nvoid perr(){cerr << endl;}\\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\\nvoid yes(bool i = true){ return print(i?\\\"yes\\\":\\\"no\\\"); }\\nvoid Yes(bool i = true){ return print(i?\\\"Yes\\\":\\\"No\\\"); }\\nvoid YES(bool i = true){ return print(i?\\\"YES\\\":\\\"NO\\\"); }\\ntemplate <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}\\ntemplate <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}\\ntemplate <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}\\ntemplate <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}\\n//grid探索用\\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\\n \\nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \\nconst ll MOD9 = 998244353LL;\\nconst ll MOD10 = 1000000007LL;\\n\\nstruct Edge {\\n ll to,cap,rev;\\n};\\n\\nclass MaximumFlow{\\n public:\\n ll siz = 0;\\n vector<bool> used;\\n vector<vector<Edge>> G;\\n MaximumFlow(ll n){\\n siz = n;\\n used.resize(n+1);\\n G.resize(n+1);\\n }\\n\\n // a からbにcリットル流せる辺を追加\\n void add_edge(ll a,ll b , ll c){\\n ll ga_size = G[a].size();\\n ll gb_size = G[b].size();\\n G[a].push_back({b,c,gb_size });\\n G[b].push_back({a,0,ga_size });\\n }\\n\\n //Fはスタートからposまでの残余グラフの辺の容量の最小値\\n //返り値は流したフローの量\\n ll dfs(ll pos,ll goal,ll F){\\n // ゴールに到着\\n if(pos == goal) return F;\\n used[pos] = true;\\n for(ll i = 0; i < (ll)G[pos].size();i++){\\n // 容量0の辺は使えない\\n if(G[pos][i].cap == 0)continue;\\n //探索済みだった\\n if(used[G[pos][i].to] == true) continue;\\n\\n ll flow = dfs(G[pos][i].to,goal,min(F,G[pos][i].cap));\\n\\n // フローを流せるとき、残余グラフの容量をflowだけ増減\\n if(flow > 0){\\n G[pos][i].cap -= flow;\\n G[G[pos][i].to][G[pos][i].rev].cap += flow;\\n return flow;\\n }\\n }\\n // 見つからず\\n return 0;\\n }\\n\\n ll max_flow(ll s,ll t){\\n ll Total_Flow = 0;\\n while(true){\\n for(ll i = 0;i < siz;i++)used[i] = false;\\n ll F = dfs(s,t,INF);\\n\\n //流せなくなった\\n if(F== 0)break;\\n Total_Flow += F;\\n }\\n return Total_Flow;\\n }\\n};\\n \\nint main(){\\n ios::sync_with_stdio(false);cin.tie(nullptr);\\n while(true){\\n LL(n);\\n if(n == 0)break;\\n LL(m);\\n map<ll,ll> mp;\\n rep(i,m){\\n LL(u);\\n ll siz = sz(mp);\\n if(!mp.contains(u)){\\n mp[u] = siz;\\n }\\n }\\n MaximumFlow mf(n+m+2);\\n rep(i,m){\\n mf.add_edge(n+m,i,1);\\n }\\n rep(i,n){\\n LL(x);\\n rep(j,x){\\n LL(v);\\n if(mp.contains(v)){\\n mf.add_edge(mp[v],i+m,1);\\n }\\n }\\n mf.add_edge(i+m,n+m+1,1);\\n }\\n cout << mf.max_flow(n+m,n+m+1) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4096,\n \"score_of_the_acc\": -0.5697,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2064_11055691\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef long double ld;\\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\\n#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)\\n#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)\\n#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)\\n#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)\\n#define each(p,a) for(auto &p:a)\\ntypedef vector<ll> vll;\\ntypedef vector<pair<ll ,ll>> vpll;\\ntypedef vector<vector<pair<ll ,ll>>> vvpll;\\ntypedef vector<vector<ll>> vvll;\\ntypedef vector<vector<vector<ll>>> vvvll;\\ntypedef set<ll> sll;\\ntypedef map<ll , ll> mpll;\\ntypedef pair<ll ,ll> pll;\\ntypedef tuple<ll , ll , ll> tpl3;\\ntypedef tuple<ll , ll , ll , ll> tpl4;\\ntypedef tuple<ll , ll , ll , ll , ll> tpl5;\\ntypedef tuple<ll , ll , ll , ll , ll , ll> tpl6;\\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\\n#define all(a) (a).begin(),(a).end()\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n#define sz(x) (ll)x.size()\\n// << std::fixed << std::setprecision(10)\\nconst ll INF = 1LL << 60;\\nconst ld EPS = 1e-9;\\n \\nll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}\\nll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}\\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\\n//0indexed\\ninline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}\\ninline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}\\ntemplate<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}\\ntemplate<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\\ntemplate<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\\\" \\\":\\\"\\\");}return os;}\\ntemplate<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << \\\"{\\\" << p.first << \\\",\\\" << p.second << \\\"}\\\";return os;}\\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\\nvoid print(){cout << endl;}\\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\\nvoid perr(){cerr << endl;}\\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\\nvoid yes(bool i = true){ return print(i?\\\"yes\\\":\\\"no\\\"); }\\nvoid Yes(bool i = true){ return print(i?\\\"Yes\\\":\\\"No\\\"); }\\nvoid YES(bool i = true){ return print(i?\\\"YES\\\":\\\"NO\\\"); }\\ntemplate <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}\\ntemplate <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}\\ntemplate <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}\\ntemplate <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}\\n//grid探索用\\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\\n \\nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \\nconst ll MOD9 = 998244353LL;\\nconst ll MOD10 = 1000000007LL;\\n\\nstruct Edge {\\n ll to,cap,rev;\\n};\\n\\nclass MaximumFlow{\\n public:\\n ll siz = 0;\\n vector<bool> used;\\n vector<vector<Edge>> G;\\n MaximumFlow(ll n){\\n siz = n;\\n used.resize(n+1);\\n G.resize(n+1);\\n }\\n\\n // a からbにcリットル流せる辺を追加\\n void add_edge(ll a,ll b , ll c){\\n ll ga_size = G[a].size();\\n ll gb_size = G[b].size();\\n G[a].push_back({b,c,gb_size });\\n G[b].push_back({a,0,ga_size });\\n }\\n\\n //Fはスタートからposまでの残余グラフの辺の容量の最小値\\n //返り値は流したフローの量\\n ll dfs(ll pos,ll goal,ll F){\\n // ゴールに到着\\n if(pos == goal) return F;\\n used[pos] = true;\\n for(ll i = 0; i < (ll)G[pos].size();i++){\\n // 容量0の辺は使えない\\n if(G[pos][i].cap == 0)continue;\\n //探索済みだった\\n if(used[G[pos][i].to] == true) continue;\\n\\n ll flow = dfs(G[pos][i].to,goal,min(F,G[pos][i].cap));\\n\\n // フローを流せるとき、残余グラフの容量をflowだけ増減\\n if(flow > 0){\\n G[pos][i].cap -= flow;\\n G[G[pos][i].to][G[pos][i].rev].cap += flow;\\n return flow;\\n }\\n }\\n // 見つからず\\n return 0;\\n }\\n\\n ll max_flow(ll s,ll t){\\n ll Total_Flow = 0;\\n while(true){\\n for(ll i = 0;i < siz;i++)used[i] = false;\\n ll F = dfs(s,t,INF);\\n\\n //流せなくなった\\n if(F== 0)break;\\n Total_Flow += F;\\n }\\n return Total_Flow;\\n }\\n};\\n \\nint main(){\\n ios::sync_with_stdio(false);cin.tie(nullptr);\\n while(true){\\n LL(n);\\n if(n == 0)break;\\n LL(m);\\n map<ll,ll> mp;\\n rep(i,m){\\n LL(u);\\n ll siz = sz(mp);\\n mp[u];\\n }\\n ll idx = 0;\\n for (auto& elem : mp) elem.second = idx++;\\n MaximumFlow mf(n+m+2);\\n rep(i,m){\\n mf.add_edge(n+m,i,1);\\n }\\n rep(i,n){\\n LL(x);\\n rep(j,x){\\n LL(v);\\n if(mp.contains(v)){\\n mf.add_edge(mp[v],i+m,1);\\n }\\n }\\n mf.add_edge(i+m,n+m+1,1);\\n }\\n cout << mf.max_flow(n+m,n+m+1) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4096,\n \"score_of_the_acc\": -0.5697,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2064_9341738\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\nstruct Dinic {\\nprivate:\\n const long long inf = 1e18;\\n vector<int> dist; //sからの距離\\n vector<int> iter; //どこまで調べたか\\npublic:\\n struct edge {\\n int to, rev; long long cap;\\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\\n };\\n\\n int n;\\n vector<vector<edge>> to;\\n\\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\\n\\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\\n int su = (int)to[u].size(), sv = (int)to[v].size();\\n to[u].push_back({ v, sv, cap });\\n to[v].push_back({ u, su, 0 });\\n }\\n\\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\\n if (v == t) return f;\\n int sv = (int)to[v].size();\\n for (int& i = iter[v]; i < sv; i++) {\\n edge& nv = to[v][i];\\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\\n long long nf = dfs(nv.to, t, min(f, nv.cap));\\n if (nf > 0) {\\n nv.cap -= nf;\\n to[nv.to][nv.rev].cap += nf;\\n return nf;\\n }\\n }\\n return 0;\\n }\\n\\n void bfs(int s) {\\n dist.assign(n, -1);\\n queue<int> q;\\n q.push(s);\\n dist[s] = 0;\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for (auto nv : to[v]) {\\n if (nv.cap > 0 && dist[nv.to] < 0) {\\n dist[nv.to] = dist[v] + 1;\\n q.push(nv.to);\\n }\\n }\\n }\\n }\\n\\n long long maxflow(int s, int t) {//s:始点, t:終点\\n long long res = 0, flow = 0;\\n while (true) {\\n bfs(s);\\n if (dist[t] < 0) break;\\n\\n iter.assign(n, 0);\\n while (flow = dfs(s, t, inf)) res += flow;\\n };\\n return res;\\n }\\n};\\n\\n\\nint main()\\n{ \\n int n;\\n while (cin >> n, n) {\\n int m;\\n cin >> m;\\n map<int, int> mp;\\n rep(i, m) {\\n int x;\\n cin >> x;\\n mp[x];\\n }\\n int idx = 0;\\n for (auto& elem : mp) elem.second = idx++;\\n\\n Dinic dn(m + n + 2);\\n int S = m + n, T = m + n + 1;\\n rep(i, m) dn.addedge(S, i, 1);\\n rep(i, n) dn.addedge(i + m, T, 1);\\n\\n rep(i, n) {\\n int mg = 0;\\n cin >> mg;\\n rep(j, mg) {\\n int x;\\n cin >> x;\\n if (mp.count(x)) dn.addedge(mp[x], i + m, 1);\\n }\\n }\\n\\n int flow = dn.maxflow(S, T);\\n cout << flow << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3696,\n \"score_of_the_acc\": -0.6677,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2064_2743724\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n \\nusing namespace std;\\n \\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n \\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\\\" \\\"; cerr<<endl; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n \\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n \\nstruct edge { int to, cap, rev; };\\nconst int MAX_V = 100000;\\n \\nvector<edge> G[MAX_V];\\nint level[MAX_V];\\nint iter[MAX_V];\\n \\nvoid add_edge(int from, int to, int cap){\\n //printf(\\\"add %d -> %d (%d)\\\\n\\\", from, to, cap);\\n G[from].push_back((edge){to, cap, G[to].size()});\\n G[to].push_back((edge){from, 0, G[from].size()-1});\\n}\\nvoid bfs(int s){\\n memset(level, -1, sizeof(level));\\n queue<int> que;\\n level[s] = 0;\\n que.push(s);\\n while(!que.empty()){\\n int v = que.front(); que.pop();\\n for(int i = 0; i < 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 \\nint dfs(int v, int t, int f){\\n if(v == t) return f;\\n for (int &i = iter[v]; i < G[v].size(); i++){\\n edge &e = G[v][i];\\n if(e.cap > 0 && level[v] < level[e.to]){\\n int d = dfs(e.to, t, min(f, e.cap));\\n if(d > 0){\\n e.cap -= d;\\n G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n}\\n \\nint Denic(int s, int t){\\n int flow = 0;\\n while(true){\\n bfs(s);\\n if(level[t] < 0) break;;\\n memset(iter, 0, sizeof(iter));\\n int f;\\n while((f = dfs(s, t, INF)) > 0){\\n flow += f;\\n }\\n }\\n return flow;\\n}\\nint main(){\\n int N;\\n while(cin>>N && N){\\n REP(i, MAX_V) G[i].clear();\\n int M; cin>>M;\\n vector<int> myday;\\n REP(i, M){\\n int t; cin>>t;\\n myday.push_back(t);\\n }\\n sort(myday.begin(), myday.end());\\n REP(i, N){\\n int M2;\\n cin>>M2;\\n while(M2--){\\n int t; cin>>t;\\n if(binary_search(myday.begin(), myday.end(), t)){\\n int idx = lower_bound(myday.begin(), myday.end(), t) - myday.begin();\\n add_edge(i, N + idx, 1);\\n }\\n }\\n }\\n const int S = N + M;\\n const int G = S + 1;\\n REP(i, N){\\n add_edge(S, i, 1);\\n }\\n REP(i, M){\\n add_edge(N + i, G, 1);\\n }\\n cout<<Denic(S, G)<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 6232,\n \"score_of_the_acc\": -1.2857,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2064_2741021\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n#define NUM 3000\\n\\n\\n//辺を表す構造体(行先、容量、逆辺のインデックス)\\nstruct Edge{\\n\\tEdge(int arg_to,int arg_capacity,int arg_rev_index){\\n\\t\\tto = arg_to;\\n\\t\\tcapacity = arg_capacity;\\n\\t\\trev_index = arg_rev_index;\\n\\t}\\n\\tint to,capacity,rev_index;\\n};\\n\\nint V,E;\\nint N;\\nmap<int,int> MAP;\\nvector<Edge> G[NUM]; //グラフの隣接リスト表現\\nint dist[NUM]; //sourceからの距離\\nint cheked_index[NUM]; //どこまで調べ終わったか\\n\\n//fromからtoへ向かう容量capacityの辺をグラフに追加する\\nvoid add_edge(int from,int to,int capacity){\\n\\tG[from].push_back(Edge(to,capacity,G[to].size()));\\n\\tG[to].push_back(Edge(from,0,G[from].size()-1)); //逆辺の、初期容量は0\\n}\\n\\n//sourceからの最短距離をBFSで計算する\\nvoid bfs(int source){\\n\\tfor(int i = 0; i < V; i++)dist[i] = -1;\\n\\tqueue<int> Q;\\n\\tdist[source] = 0;\\n\\tQ.push(source);\\n\\n\\twhile(!Q.empty()){\\n\\t\\tint node_id = Q.front();\\n\\t\\tQ.pop();\\n\\t\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\t\\tEdge &e = G[node_id][i];\\n\\t\\t\\tif(e.capacity > 0 && dist[e.to] < 0){ //辺の容量が正で、かつエッジの行先に未訪問の場合\\n\\t\\t\\t\\tdist[e.to] = dist[node_id]+1;\\n\\t\\t\\t\\tQ.push(e.to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n//増加パスをDFSで探す\\nint dfs(int node_id,int sink,int flow){\\n\\tif(node_id == sink)return flow; //終点についたらflowをreturn\\n\\n\\tfor(int &i = cheked_index[node_id]; i < G[node_id].size(); i++){ //node_idから出ているエッジを調査\\n\\t\\tEdge &e = G[node_id][i];\\n\\t\\tif(e.capacity > 0 && dist[node_id] < dist[e.to]){ //流せる余裕があり、かつsourceからの距離が増加する方法である場合\\n\\t\\t\\tint tmp_flow = dfs(e.to,sink,min(flow,e.capacity)); //流せるだけ流す\\n\\t\\t\\tif(tmp_flow > 0){ //流せた場合\\n\\t\\t\\t\\te.capacity -= tmp_flow; //流した分、エッジの容量を削減する\\n\\t\\t\\t\\tG[e.to][e.rev_index].capacity += tmp_flow; //逆辺の容量を、流した分だけ増加させる\\n\\t\\t\\t\\treturn tmp_flow;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\\n\\n\\n//sourceからsinkへの最大流を求める\\nint max_flow(int source,int sink){ //source:始点 sink:終点\\n\\tint flow = 0,add;\\n\\twhile(true){ //増加パスが存在する限り、流量を追加し続ける\\n\\t\\tbfs(source);\\n\\t\\tif(dist[sink] < 0)break; //sourceからsinkへと辿り着く残余グラフがない、つまり増加パスが無くなった場合、break\\n\\t\\tfor(int i = 0; i < V; i++)cheked_index[i] = 0;\\n\\t\\twhile((add = dfs(source,sink,BIG_NUM)) > 0){ //増加パスが見つかる間、加算\\n\\t\\t\\tflow += add;\\n\\t\\t}\\n\\t}\\n\\treturn flow;\\n}\\n\\nvoid func(){\\n\\n\\tMAP.clear();\\n\\tfor(int i = 0; i < NUM; i++)G[i].clear();\\n\\n\\tint num,tmp,index = 2;\\n\\tscanf(\\\"%d\\\",&num);\\n\\n\\tint source = 0,sink = 1;\\n\\n\\tfor(int loop = 0; loop < num; loop++){\\n\\t\\tscanf(\\\"%d\\\",&tmp);\\n\\t\\tMAP[tmp] = index;\\n\\t\\tadd_edge(source,index,1); //sourceからindexに、容量1の辺を張る\\n\\t\\tindex++;\\n\\t}\\n\\n\\tint integrate;\\n\\n\\tfor(int loop = 0; loop < N; loop++){\\n\\t\\tscanf(\\\"%d\\\",&num);\\n\\t\\tadd_edge(index,sink,1); //1人の人物につき、最大流量1の集約路を張る\\n\\t\\tintegrate = index;\\n\\t\\tindex++;\\n\\n\\t\\tfor(int i = 0; i < num; i++){\\n\\t\\t\\tscanf(\\\"%d\\\",&tmp);\\n\\t\\t\\tauto at = MAP.find(tmp);\\n\\t\\t\\tif(at == MAP.end())continue; //Isaccの都合の良い日でなければ無視\\n\\t\\t\\tadd_edge(MAP[tmp],integrate,1); //Isaccの都合の良い日から、\\n\\t\\t}\\n\\t}\\n\\n\\tV = index;\\n\\n\\tprintf(\\\"%d\\\\n\\\", max_flow(source,sink));\\n}\\n\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3476,\n \"score_of_the_acc\": -0.4805,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2064_2729687\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\nstruct Dinic{\\n const int INF=1<<28;\\n \\n struct edge {\\n int to,cap,rev;\\n edge(){}\\n edge(int to,int cap,int rev):to(to),cap(cap),rev(rev){}\\n };\\n\\n int n;\\n vector<vector<edge> > G;\\n vector<map<int,int> > M;\\n vector<int> level,iter;\\n\\n Dinic(){}\\n Dinic(int sz):n(sz),G(n),M(n),level(n),iter(n){}\\n \\n void add_edge(int from,int to,int cap){\\n M[from][to]=G[from].size();\\n M[to][from]=G[to].size();\\n G[from].push_back(edge(to,cap,G[to].size()));\\n // undirected\\n //G[to].push_back(edge(from,cap,G[from].size()-1));\\n // directed\\n G[to].push_back(edge(from,0,G[from].size()-1));\\n }\\n \\n void bfs(int s){\\n fill(level.begin(),level.end(),-1);\\n queue<int> que;\\n level[s]=0;\\n que.push(s);\\n while(!que.empty()){\\n int v=que.front();que.pop();\\n for(int i=0;i<(int)G[v].size();i++){\\n edge &e = G[v][i];\\n if(e.cap>0&&level[e.to]<0){\\n level[e.to]=level[v]+1;\\n que.push(e.to);\\n }\\n }\\n }\\n }\\n \\n int dfs(int v,int t,int f){\\n if(v==t) return f;\\n for(int &i=iter[v];i<(int)G[v].size();i++){\\n edge &e=G[v][i];\\n if(e.cap>0&&level[v]<level[e.to]){\\n int d = dfs(e.to,t,min(f,e.cap));\\n if(d>0){\\n e.cap-=d;\\n G[e.to][e.rev].cap+=d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n \\n int flow(int s,int t,int lim){\\n int fl=0;\\n for(;;){\\n bfs(s);\\n if(level[t]<0||lim==0) return fl;\\n fill(iter.begin(),iter.end(),0);\\n int f;\\n while((f=dfs(s,t,lim))>0){\\n fl+=f;\\n lim-=f;\\n }\\n }\\n }\\n\\n int flow(int s,int t){\\n return flow(s,t,INF);\\n }\\n\\n //cap==1 only\\n bool back_edge(int s,int t,int from, int to){\\n for(int i=0;i<(int)G[from].size();i++) {\\n edge& e=G[from][i];\\n if(e.to==to) {\\n if(e.cap==0&&flow(from,to,1)==0) {\\n flow(from,s,1);\\n flow(t,to,1);\\n return 1;\\n }\\n }\\n }\\n return 0;\\n }\\n};\\nint main(){\\n int n,m,x,N;\\n while(cin>>n,n){\\n map<int,int>M;\\n cin>>N;\\n r(i,N){\\n cin>>x;\\n M[x]=i;\\n }\\n Dinic d(N+n+2);\\n r(i,N)d.add_edge(N+n,i,1);\\n r(i,n)d.add_edge(N+i,N+n+1,1);\\n r(i,n){\\n cin>>m;\\n r(j,m){\\n cin>>x;\\n if(M.count(x))d.add_edge(M[x],N+i,1);\\n }\\n }\\n cout<<d.flow(N+n,N+n+1,1e8)<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3676,\n \"score_of_the_acc\": -0.7708,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2064_2488730\",\n \"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\\nstruct Dinic {\\n\\tusing Flow = int;\\n\\tstruct Edge {\\n\\t\\tint to, rev;\\n\\t\\tFlow cap;\\n\\t\\tEdge() {}\\n\\t\\tEdge(int to, int rev, Flow cap) :to(to), rev(rev), cap(cap) {}\\n\\t};\\n\\tint n;\\n\\tvector<vector<Edge>> g;\\n\\tvector<bool> used;\\n\\tvector<int> level;\\n\\tvector<int> iter;\\n\\tDinic(int n) :n(n), g(n), used(n), level(n), iter(n) {};\\n\\tvoid addArc(int from, int to, Flow cap) {\\n\\t\\tg[from].emplace_back(to, (int)g[to].size(), cap);\\n\\t\\tg[to].emplace_back(from, (int)g[from].size() - 1, 0);\\n\\t}\\n\\tvoid addEdge(int a, int b, Flow cap) {\\n\\t\\tg[a].emplace_back(b, (int)g[b].size(), cap);\\n\\t\\tg[b].emplace_back(a, (int)g[a].size() - 1, cap);\\n\\t}\\n\\tFlow maximumFlow(int s, int t) {\\n\\t\\tFlow total = 0;\\n\\t\\twhile (true) {\\n\\t\\t\\tlevelize(s);\\n\\t\\t\\tif (level[t] < 0)return total;\\n\\t\\t\\tfill(iter.begin(), iter.end(), 0);\\n\\t\\t\\tFlow f;\\n\\t\\t\\twhile (true) {\\n\\t\\t\\t\\tf = augment(s, t, INF);\\n\\t\\t\\t\\tif (f == 0)break;\\n\\t\\t\\t\\ttotal += f;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tFlow augment(int v, int t, Flow f) {\\n\\t\\tif (v == t)return f;\\n\\t\\tfor (int &i = iter[v]; i < g[v].size(); i++) {\\n\\t\\t\\tEdge &e = g[v][i];\\n\\t\\t\\tif (e.cap > 0 && level[v] < level[e.to]) {\\n\\t\\t\\t\\tFlow d = augment(e.to, t, min(f, e.cap));\\n\\t\\t\\t\\tif (d > 0) {\\n\\t\\t\\t\\t\\te.cap -= d;\\n\\t\\t\\t\\t\\tg[e.to][e.rev].cap += d;\\n\\t\\t\\t\\t\\treturn d;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\tvoid levelize(int s) {\\n\\t\\tfill(level.begin(), level.end(), -1);\\n\\t\\tqueue<int> q;\\n\\t\\tlevel[s] = 0;\\n\\t\\tq.push(s);\\n\\t\\twhile (q.size()) {\\n\\t\\t\\tint v = q.front(); q.pop();\\n\\t\\t\\tfor (int i = 0; i < g[v].size(); i++) {\\n\\t\\t\\t\\tEdge &e = g[v][i];\\n\\t\\t\\t\\tif (e.cap > 0 && level[e.to] < 0) {\\n\\t\\t\\t\\t\\tlevel[e.to] = level[v] + 1;\\n\\t\\t\\t\\t\\tq.push(e.to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n};\\n\\nsigned main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tfor (int N; cin >> N&&N;) {\\n\\t\\tint M; cin >> M;\\n\\t\\tDinic dinic(M + N + 2);\\n\\t\\tint s = dinic.n - 2, t = s + 1;\\n\\t\\tunordered_map<int, int> mp;\\n\\t\\trep(i, 0, M) { int d; cin >> d; mp[d] = i; }\\n\\t\\trep(i, 0, N) {\\n\\t\\t\\tint m; cin >> m;\\n\\t\\t\\trep(j, 0, m) {\\n\\t\\t\\t\\tint d; cin >> d;\\n\\t\\t\\t\\tif (mp.count(d))\\n\\t\\t\\t\\t\\tdinic.addArc(mp[d], M + i, 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(i, 0, M)dinic.addArc(s, i, 1);\\n\\t\\trep(i, 0, N)dinic.addArc(M + i, t, 1);\\n\\t\\tcout << dinic.maximumFlow(s, t) << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3288,\n \"score_of_the_acc\": -0.4069,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2064_2414678\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\nstruct edge{int to,cap,rev;};\\n\\nconst int MAX_V = 2000;\\nconst int F_INF = 19191919;\\nvector<edge> G[MAX_V];\\nint lv[MAX_V], it[MAX_V];\\n\\nvoid add_edge(int from, int to, int cap){\\n G[from].pb({to,cap,(int)G[to].size()});\\n G[to].pb({from,0,(int)G[from].size()-1});\\n}\\n\\nvoid dinic_bfs(int s){\\n fill(lv,lv+MAX_V,-1);\\n queue<int> que;\\n lv[s]=0;\\n que.push(s);\\n while(!que.empty()){\\n int v = que.front(); que.pop();\\n rep(i,G[v].size()){\\n edge &e = G[v][i];\\n if(e.cap>0 && lv[e.to]<0){\\n lv[e.to] = lv[v]+1;\\n que.push(e.to);\\n }\\n }\\n }\\n}\\n\\nint dinic_dfs(int v, int t, int f){\\n if(v==t) return f;\\n for(int &i=it[v]; i<G[v].size(); ++i){\\n edge &e = G[v][i];\\n if(e.cap>0 && lv[v]<lv[e.to]){\\n int 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\\nint max_flow(int s, int t){\\n int flow = 0;\\n while(1){\\n dinic_bfs(s);\\n if(lv[t]<0) return flow;\\n fill(it,it+MAX_V,0);\\n int f;\\n while((f=dinic_dfs(s,t,F_INF))>0) flow+=f;\\n }\\n}\\n\\nint main()\\n{\\n int n;\\n while(scanf(\\\" %d\\\", &n),n)\\n {\\n rep(i,MAX_V) G[i].clear();\\n\\n unordered_map<int,int> m;\\n int M = 0;\\n\\n int ISSAC;\\n scanf(\\\" %d\\\", &ISSAC);\\n while(ISSAC--)\\n {\\n int day;\\n scanf(\\\" %d\\\", &day);\\n if(!m.count(day)) m[day] = M++;\\n }\\n\\n vector<int> k(n);\\n vector<vector<int>> s(n);\\n\\n rep(i,n)\\n {\\n scanf(\\\" %d\\\", &k[i]);\\n rep(j,k[i])\\n {\\n int day;\\n scanf(\\\" %d\\\", &day);\\n if(m.count(day)) s[i].pb(m[day]);\\n }\\n k[i] = s[i].size();\\n }\\n\\n int S = n+M, T = S+1;\\n rep(i,n)\\n {\\n add_edge(S,i,1);\\n rep(j,k[i]) add_edge(i,n+s[i][j],1);\\n }\\n rep(i,M) add_edge(n+i,T,1);\\n\\n printf(\\\"%d\\\\n\\\", max_flow(S,T));\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3688,\n \"score_of_the_acc\": -0.5232,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2064_2198699\",\n \"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#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)\\n\\nconst int inf = 1e9;\\n\\n#define MAX_V 3000\\n\\nstruct edge {\\n int to, cap, rev;\\n edge(){}\\n edge(int to, int cap, int rev):to(to), cap(cap), rev(rev){}\\n};\\nvector<edge> graph[MAX_V];\\nint level[MAX_V], iter[MAX_V];\\nvoid add_edge(int from, int to, int cap) {\\n graph[from].emplace_back(to, cap, (int)graph[to].size());\\n graph[to].emplace_back(from, 0, (int)graph[from].size()-1);\\n}\\nvoid bfs(int s) {\\n memset(level, -1, sizeof(level));\\n level[s] = 0;\\n queue<int> que;\\n que.push(s);\\n while(que.size()) {\\n int v = que.front(); que.pop();\\n for(edge& e : graph[v]) {\\n if(e.cap > 0 && level[e.to] < 0) {\\n\\tlevel[e.to] = level[v] + 1;\\n\\tque.push(e.to);\\n }\\n }\\n }\\n}\\nint dfs(int v, int t, int f) {\\n if(v == t) return f;\\n for(int& i = iter[v]; i < (int)graph[v].size(); i++) {\\n edge& e = graph[v][i];\\n if(e.cap > 0 && level[v] < level[e.to]) {\\n int d = dfs(e.to, t, min(e.cap, f));\\n if(d > 0) {\\n\\te.cap -= d;\\n\\tgraph[e.to][e.rev].cap += d;\\n\\treturn d;\\n }\\n }\\n }\\n return 0;\\n}\\nint max_flow(int s, int t) {\\n int flow = 0;\\n while(1) {\\n bfs(s);\\n if(level[t] < 0) return flow;\\n memset(iter, 0, sizeof(iter));\\n int f; while((f = dfs(s, t, inf)) > 0) flow += f;\\n }\\n}\\n\\n\\nint N, M;\\nmap<int, int> mp;\\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, N) {\\n int s = 0, t = 1, V = 2;\\n rep(i, MAX_V) graph[i].clear();\\n mp.clear();\\n cin >> M;\\n rep(i, M) {\\n int d; cin >> d;\\n mp[d] = V++;\\n }\\n for(auto p : mp) add_edge(s, p.second, 1);\\n rep(i, N) {\\n cin >> M;\\n rep(j, M) {\\n\\tint d; cin >> d;\\n\\tif(mp.count(d)) add_edge(mp[d], V+i, 1);\\n }\\n add_edge(V+i, t, 1);\\n }\\n cout << max_flow(s, t) << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3268,\n \"score_of_the_acc\": -0.4743,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2064_2173833\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\nstruct BipartiteMatching {\\n\\tint V;\\n\\tvector<vector<bool> > G;\\n\\tvector<int> match;\\n\\tvector<bool> used;\\n\\n\\tBipartiteMatching(int v) {\\n\\t\\tV = v;\\n\\t\\tG = vector<vector<bool> >(v, vector<bool>(v));\\n\\t\\tmatch = vector<int>(v);\\n\\t\\tused = vector<bool>(v);\\n\\t}\\n\\n\\tvoid add_edge(int v, int u) {\\n\\t\\tG[v][u] = G[u][v] = true;\\n\\t}\\n\\n\\tbool dfs(int v) {\\n\\t\\tused[v] = true;\\n\\t\\tfor(int i = 0; i < V; i++) {\\n\\t\\t\\tif(!G[v][i]) continue;\\n\\t\\t\\tint u = i, w = match[u];\\n\\t\\t\\tif(w < 0 || (!used[w] && dfs(w))) {\\n\\t\\t\\t\\tmatch[v] = u;\\n\\t\\t\\t\\tmatch[u] = v;\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\\n\\n\\tint calc() {\\n\\t\\tint res = 0;\\n\\t\\tfill(match.begin(), match.end(), -1);\\n\\t\\tfor(int v = 0; v < V; v++) {\\n\\t\\t\\tif(match[v] < 0) {\\n\\t\\t\\t\\tfill(used.begin(), used.end(), false);\\n\\t\\t\\t\\tif(dfs(v)) {\\n\\t\\t\\t\\t\\tres++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n};\\n\\n\\nint main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\n\\tint N;\\n\\twhile(cin >> N, N) {\\n\\t\\tint M;\\n\\t\\tcin >> M;\\n\\t\\tmap<int, int> id;\\n\\t\\tfor(int i = 0; i < M; i++) {\\n\\t\\t\\tint a;\\n\\t\\t\\tcin >> a;\\n\\t\\t\\tid[a] = -1;\\n\\t\\t}\\n\\t\\tint cnt = 0;\\n\\t\\tfor(auto v : id) {\\n\\t\\t\\tid[v.first] = cnt++;\\n\\t\\t}\\n\\n\\t\\tBipartiteMatching bm(cnt + N);\\n\\t\\tfor(int i = 0; i < N; i++) {\\n\\t\\t\\tcin >> M;\\n\\t\\t\\tfor(int j = 0; j < M; j++) {\\n\\t\\t\\t\\tint a;\\n\\t\\t\\t\\tcin >> a;\\n\\t\\t\\t\\tif(id.count(a) == 0) continue;\\n\\t\\t\\t\\tbm.add_edge(id[a], cnt + i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tcout << bm.calc() << endl;\\n\\t}\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 3256,\n \"score_of_the_acc\": -1.1862,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2064_2040185\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\\n#define rep(i,n) REP(i,0,n)\\n#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 \\nnamespace flow {\\n \\nclass bipartite_matching {\\nprivate:\\n \\n int V;\\n vector<vector<int>> G;\\n vector<int> match;\\n vector<bool> used;\\n \\n bool dfs(int v) {\\n used[v] = 1;\\n for(auto& u: G[v]) {\\n int 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 \\n \\npublic:\\n \\n bipartite_matching(int V): V(V) {\\n G.resize(V), match.resize(V), used.resize(V);\\n }\\n \\n void add_edge(int u, int v) {\\n G[u].push_back(v);\\n G[v].push_back(u);\\n }\\n \\n int maximum_matching() {\\n int ret = 0;\\n match.clear(), match.resize(V, -1);\\n rep(v, V) {\\n if(match[v] < 0) {\\n used.clear(), used.resize(V, 0);\\n if(dfs(v)) { ret ++; }\\n }\\n }\\n return ret;\\n }\\n};\\n \\n}\\n \\nint main() {\\n \\n for(int N; cin >> N && N;) {\\n int M; cin >> M;\\n \\n int dcnt = 0;\\n unordered_map<int, int> dayidx;\\n rep(i, M) {\\n int x; cin >> x;\\n if(dayidx.find(x) == dayidx.end()) {\\n dayidx[x] = dcnt++;\\n }\\n }\\n \\n flow::bipartite_matching bp(dcnt + N);\\n \\n rep(girl, N) {\\n cin >> M;\\n rep(i, M) {\\n int k; cin >> k;\\n if(dayidx.find(k) != dayidx.end())\\n bp.add_edge(dayidx[k], dcnt + girl);\\n }\\n }\\n \\n cout << bp.maximum_matching() << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3212,\n \"score_of_the_acc\": -0.6773,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2064_2040159\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\\n#define rep(i,n) REP(i,0,n)\\n#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\\nnamespace flow {\\n\\nclass bipartite_matching {\\nprivate:\\n\\n int V;\\n vector<vector<int>> G;\\n vector<int> match;\\n vector<bool> used;\\n\\n bool dfs(int v) {\\n used[v] = 1;\\n for(auto& u: G[v]) {\\n int 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\\n\\npublic:\\n\\n bipartite_matching(int V): V(V) {\\n G.resize(V), match.resize(V), used.resize(V);\\n }\\n\\n void add_edge(int u, int v) {\\n G[u].push_back(v);\\n G[v].push_back(u);\\n }\\n\\n int maximum_matching() {\\n int ret = 0;\\n match.clear(), match.resize(V, -1);\\n rep(v, V) {\\n if(match[v] < 0) {\\n used.clear(), used.resize(V, 0);\\n if(dfs(v)) { ret ++; }\\n }\\n }\\n return ret;\\n }\\n};\\n\\n}\\n\\nint main() {\\n\\n for(int N; cin >> N && N;) {\\n int M; cin >> M;\\n\\n int dcnt = 0;\\n map<int, int> dayidx;\\n rep(i, M) {\\n int x; cin >> x;\\n if(dayidx.find(x) == dayidx.end()) {\\n dayidx[x] = dcnt++;\\n }\\n }\\n\\n flow::bipartite_matching bp(dcnt + N);\\n\\n rep(girl, N) {\\n cin >> M;\\n rep(i, M) {\\n int k; cin >> k;\\n if(dayidx.find(k) != dayidx.end())\\n bp.add_edge(dayidx[k], dcnt + girl);\\n }\\n }\\n\\n cout << bp.maximum_matching() << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3232,\n \"score_of_the_acc\": -0.7885,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2064_1914970\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define MAX_V 3000\\n#define INF 1e9\\n \\nstruct edge{ int to,cap,rev; };\\n \\nvector<edge> G[MAX_V];\\nint level[MAX_V],iter[MAX_V];\\n \\nvoid add_edge(int from,int to,int cap){\\n G[from].push_back((edge){to,cap,G[to].size()});\\n G[to].push_back((edge){from,0,G[from].size()-1});\\n}\\n \\nvoid bfs(int s){\\n memset(level,-1,sizeof(level));\\n queue<int> Q;\\n level[s] = 0;\\n Q.push(s);\\n while(!Q.empty()){\\n\\tint v = Q.front(); Q.pop();\\n\\tfor(int i = 0 ; i < (int)G[v].size() ; i++){\\n\\t edge &e = G[v][i];\\n\\t if(e.cap > 0 && level[e.to] < 0){\\n\\t\\tlevel[e.to] = level[v] + 1;\\n\\t\\tQ.push(e.to);\\n\\t }\\n\\t}\\n }\\n}\\n \\nint dfs(int v,int t,int f){\\n if(v == t) return f;\\n for(int &i = iter[v] ; i < (int)G[v].size() ; i++){\\n\\tedge &e = G[v][i];\\n\\tif(e.cap > 0 && level[v] < level[e.to]){\\n\\t int d = dfs(e.to,t,min(f,e.cap));\\n\\t if(d > 0){\\n\\t\\te.cap -= d;\\n\\t\\tG[e.to][e.rev].cap += d;\\n\\t\\treturn d;\\n\\t }\\n\\t}\\n }\\n return 0;\\n}\\n \\nint max_flow(int s,int t){\\n int flow = 0;\\n for(;;){\\n\\tbfs(s);\\n\\tif(level[t] < 0) return flow;\\n\\tmemset(iter,0,sizeof(iter));\\n\\tint f;\\n\\twhile((f = dfs(s,t,INF)) > 0){\\n\\t flow += f;\\n\\t}\\n }\\n}\\n \\nint main(){\\n int N;\\n while(cin >> N,N){\\n\\tfor(int i = 0 ; i < MAX_V ; i++){\\n\\t G[i].clear();\\n\\t}\\n\\tint k,x,n;\\n\\tcin >> n;\\n\\tint S = N+n,T = S+1;\\n\\tmap<int,int> mp;\\n\\tfor(int i = 0 ; i < n ; i++){\\n\\t cin >> x;\\n\\t mp[x] = i;\\n\\t}\\n\\tmap<int,int>::iterator it;\\n\\tfor(it = mp.begin() ; it != mp.end() ; ++it){\\n\\t add_edge(S,it->second,1);\\n\\t}\\n\\tfor(int i = 0 ; i < N ; i++){\\n\\t cin >> k;\\n\\t for(int j = 0 ; j < k ; j++){\\n\\t\\tcin >> x;\\n\\t\\tif(mp.find(x) != mp.end()){\\n\\t\\t add_edge(mp[x],n+i,1);\\n\\t\\t}\\n\\t }\\n\\t add_edge(n+i,T,1);\\n\\t}\\n\\tcout << max_flow(S,T) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 1532,\n \"score_of_the_acc\": -0.446,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2064_1331970\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define MAX_V 3000\\n#define INF 1e9\\n\\nstruct edge{ int to,cap,rev; };\\n\\nvector<edge> G[MAX_V];\\nint level[MAX_V],iter[MAX_V];\\n\\nvoid add_edge(int from,int to,int cap){\\n G[from].push_back((edge){to,cap,G[to].size()});\\n G[to].push_back((edge){from,0,G[from].size()-1});\\n}\\n\\nvoid bfs(int s){\\n memset(level,-1,sizeof(level));\\n queue<int> Q;\\n level[s] = 0;\\n Q.push(s);\\n while(!Q.empty()){\\n int v = Q.front(); Q.pop();\\n for(int i = 0 ; i < (int)G[v].size() ; i++){\\n edge &e = G[v][i];\\n if(e.cap > 0 && level[e.to] < 0){\\n level[e.to] = level[v] + 1;\\n Q.push(e.to);\\n }\\n }\\n }\\n}\\n\\nint dfs(int v,int t,int f){\\n if(v == t) return f;\\n for(int &i = iter[v] ; i < (int)G[v].size() ; i++){\\n edge &e = G[v][i];\\n if(e.cap > 0 && level[v] < level[e.to]){\\n int d = dfs(e.to,t,min(f,e.cap));\\n if(d > 0){\\n e.cap -= d;\\n G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n}\\n\\nint max_flow(int s,int t){\\n int flow = 0;\\n for(;;){\\n bfs(s);\\n if(level[t] < 0) return flow;\\n memset(iter,0,sizeof(iter));\\n int f;\\n while((f = dfs(s,t,INF)) > 0){\\n flow += f;\\n }\\n }\\n}\\n\\nint main(){\\n int N;\\n while(cin >> N,N){\\n for(int i = 0 ; i < MAX_V ; i++){\\n G[i].clear();\\n }\\n int k,x,n;\\n cin >> n;\\n int S = N+n,T = S+1;\\n map<int,int> mp;\\n for(int i = 0 ; i < n ; i++){\\n cin >> x;\\n mp[x] = i;\\n }\\n map<int,int>::iterator it;\\n for(it = mp.begin() ; it != mp.end() ; ++it){\\n add_edge(S,it->second,1);\\n }\\n for(int i = 0 ; i < N ; i++){\\n cin >> k;\\n for(int j = 0 ; j < k ; j++){\\n cin >> x;\\n if(mp.find(x) != mp.end()){\\n add_edge(mp[x],n+i,1);\\n }\\n }\\n add_edge(n+i,T,1);\\n }\\n cout << max_flow(S,T) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 1532,\n \"score_of_the_acc\": -0.446,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2064_1150189\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<vector>\\n#include<queue>\\n#include<map>\\nusing namespace std;\\nconst int D_MAX_V=2102;\\nconst int D_v_size=2102;\\nstruct D_wolf{\\n\\tint t,c,r;\\n\\tD_wolf(){t=c=r=0;}\\n\\tD_wolf(int t1,int 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,int 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}\\nint D_dfs(int v,int t,int 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\\tint 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}\\nint max_flow(int s,int t){\\n\\tint 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\\tint f;\\n\\t\\twhile((f=D_dfs(s,t,99999999))>0){flow+=f;}\\n\\t}\\n\\treturn 0;\\n}\\nint main(){\\n\\tint a;\\n\\twhile(scanf(\\\"%d\\\",&a),a){\\n\\t\\tfor(int i=0;i<2102;i++){\\n\\t\\t\\tD_G[i].clear();\\n\\t\\t\\tD_iter[i]=D_level[i]=0;\\n\\t\\t}\\n\\t\\tint n;scanf(\\\"%d\\\",&n);\\n\\t\\tmap<int,int>c;\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tint b;scanf(\\\"%d\\\",&b);\\n\\t\\t\\tc[b]=i;\\n\\t\\t}\\n\\t\\tint s=2100;\\n\\t\\tint t=2101;\\n\\t\\tfor(int i=0;i<n;i++)add_edge(s,i,1);\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tint m;scanf(\\\"%d\\\",&m);\\n\\t\\t\\tfor(int j=0;j<m;j++){\\n\\t\\t\\t\\tint p;scanf(\\\"%d\\\",&p);\\n\\t\\t\\t\\tif(c.count(p)){\\n\\t\\t\\t\\t\\tadd_edge(c[p],i+n,1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<a;i++)add_edge(i+n,t,1);\\n\\t\\tprintf(\\\"%d\\\\n\\\",max_flow(s,t));\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 1268,\n \"score_of_the_acc\": -0.1786,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2064_1124230\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <climits>\\n#include <cfloat>\\n#include <map>\\n#include <utility>\\n#include <set>\\n#include <iostream>\\n#include <memory>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <functional>\\n#include <sstream>\\n#include <complex>\\n#include <stack>\\n#include <cassert>\\n#include <queue>\\n#include <cstring>\\nusing namespace std;\\nstatic const double EPS = 1e-9;\\ntypedef long long ll;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define rev(i,n) for(int i=n-1;i>=0;i--)\\n#define sz(a) a.size()\\n#define all(a) a.begin(),a.end()\\n#define mp(a,b) make_pair(a,b)\\n#define pb(a) push_back(a)\\n#define SS stringstream\\n#define DBG1(a) rep(_X,sz(a)){printf(\\\"%d \\\",a[_X]);}puts(\\\"\\\");\\n#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf(\\\"%d \\\",a[_X][_Y]);puts(\\\"\\\");}\\n#define bitcount(b) __builtin_popcount(b)\\n#define fi first\\n#define se second\\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 Edge(int src, int dst) :\\n src(src), dst(dst), weight(0) { }\\n};\\nbool operator < (const Edge &e, const Edge &f) {\\n return e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!\\n e.src != f.src ? e.src < f.src : e.dst < f.dst;\\n}\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\ntypedef vector<Weight> Array;\\ntypedef vector<Array> Matrix;\\n\\nbool augment(const Graph& g, int u,\\n vector<int>& matchTo, vector<bool>& visited) {\\n if (u < 0) return true;\\n FOR(e, g[u]) if (!visited[e->dst]) {\\n visited[e->dst] = true;\\n if (augment(g, matchTo[e->dst], matchTo, visited)) {\\n matchTo[e->src] = e->dst;\\n matchTo[e->dst] = e->src;\\n return true;\\n }\\n }\\n return false;\\n}\\nint bipartiteMatching(const Graph& g, int L, Edges& matching) {\\n const int n = g.size();\\n vector<int> matchTo(n, -1);\\n int match = 0;\\n REP(u, L) {\\n vector<bool> visited(n);\\n if (augment(g, u, matchTo, visited)) ++match;\\n }\\n REP(u, L) if (matchTo[u] >= 0) // make explicit matching\\n matching.push_back( Edge(u, matchTo[u]) );\\n return match;\\n}\\n\\nint main(){\\n\\tint N;\\n\\twhile(cin >> N && N){\\n\\t\\tset<int> w;\\n\\t\\tint a,b;\\n\\t\\tcin >> a;\\n\\t\\tvector<int> day;\\n\\t\\tfor(int i = 0 ; i < a ; i++){\\n\\t\\t\\tcin >> b;\\n\\t\\t\\tb--;\\n\\t\\t\\tw.insert(b);\\n\\t\\t\\tday.push_back(b);\\n\\t\\t}\\n\\t\\tEdges edge;\\n\\t\\tfor(int i = 0 ; i < N ; i++){\\n\\t\\t\\tint t;\\n\\t\\t\\tcin >> t;\\n\\t\\t\\tfor(int j = 0 ; j < t ; j++){\\n\\t\\t\\t\\tint s;\\n\\t\\t\\t\\tcin >> s;\\n\\t\\t\\t\\ts--;\\n\\t\\t\\t\\tif(w.count(s)) edge.push_back(Edge(i,s));\\n\\t\\t\\t\\tday.push_back(s);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsort(day.begin(),day.end());\\n\\t\\tday.erase(unique(day.begin(),day.end()),day.end());\\n\\t\\tint ub = max(N,(int)day.size());\\n\\t\\tGraph g(2*ub);\\n\\t\\tfor(int i = 0 ; i < edge.size() ; i++){\\n\\t\\t\\tint a = edge[i].src;\\n\\t\\t\\tint b = ub + lower_bound(day.begin(),day.end(),edge[i].dst) - day.begin();\\n\\t\\t\\tg[a].push_back(Edge(a,b));\\n\\t\\t\\tg[b].push_back(Edge(b,a));\\n\\t\\t\\t//cout << a << \\\" \\\" << b << endl;\\n\\t\\t}\\n\\t\\tEdges tmp;\\n\\t\\tcout << bipartiteMatching(g,ub,tmp) << endl;\\n\\t\\t\\n\\t\\t\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 4820,\n \"score_of_the_acc\": -1.7156,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2064_799240\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<map>\\n#include<cstring>\\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 all(n) (n).begin(),(n).end()\\n#define MAX_V 1100\\nusing namespace std;\\n \\n//follow\\nstruct edge\\n{\\n int to,cap,rev;\\n edge(int to=inf,int cap=inf,int rev=inf):to(to),cap(cap),rev(rev){}\\n};\\n \\nvector<edge> G[MAX_V];\\nint level[MAX_V];\\nint iter[MAX_V];\\nbool used[MAX_V];\\n \\nvoid init(int V)\\n{\\n rep(i,V)G[i].clear();\\n}\\n \\nvoid add_edge(int from,int to,int cap)\\n{\\n G[from].push_back(edge(to,cap,G[to].size()));\\n G[to].push_back(edge(from,0,G[from].size()-1));\\n}\\n \\nint dfs(int v,int t,int f)\\n{\\n if(v == t)return f;\\n used[v] = true;\\n for(int i=0;i<G[v].size();i++)\\n {\\n edge &e = G[v][i];\\n if(e.cap > 0 && !used[e.to])\\n {\\n int d = dfs(e.to,t,min(f,e.cap));\\n if(d > 0)\\n {\\n e.cap -= d;\\n G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n}\\n \\nint max_flow(int s,int t)\\n{\\n int flow = 0;\\n for(;;)\\n {\\n memset(used,0,sizeof(used));\\n int f = dfs(s,t,inf);\\n if(f == 0)\\n {\\n return flow;\\n }\\n flow += f;\\n }\\n}\\n \\n//\\n \\nint main()\\n{\\n int N,k,K,s,t,day;\\n while(cin >> N,N)\\n {\\n cin >> k;\\n K = k;\\n s = k + N;\\n t = s + 1;\\n init(t+1);\\n map<int,int> days;\\n vector<int> vday;\\n rep(i,k)\\n {\\n cin >> day;\\n vday.push_back(day);\\n }\\n sort(all(vday));\\n vday.erase(unique(all(vday)),vday.end());\\n rep(i,vday.size())\\n {\\n days[vday[i]] = i;\\n add_edge(s,i,1);\\n }\\n \\n rep(i,N)\\n {\\n cin >> k;\\n rep(j,k)\\n {\\n cin >> day;\\n if(days.find(day) != days.end())\\n {\\n add_edge(days[day],K+i,1);\\n }\\n }\\n add_edge(K+i,t,1);\\n }\\n \\n cout << max_flow(s,t) << endl;\\n \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 1536,\n \"score_of_the_acc\": -0.4826,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2064_798627\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<cassert>\\n#include<map>\\n\\n#define MAX_V 5000\\n#define INF (1<<29)\\n\\nusing namespace std;\\n\\nstruct edge{int to,cap,rev;};\\n\\nvector<edge>g[MAX_V];\\nbool used[MAX_V];\\n\\nvoid add_edge(int from,int to,int cap){\\n g[from].push_back((edge){to,cap,g[to].size()});\\n g[to].push_back((edge){from,0,g[from].size()-1});\\n}\\n\\nint dfs(int v,int t,int f){\\n if(v==t)return f;\\n used[v]=true;\\n for(int i=0;i<g[v].size();i++){\\n edge &e=g[v][i];\\n if(!used[e.to] && e.cap>0){\\n int d=dfs(e.to,t,min(f,e.cap));\\n if(d>0){\\n e.cap-=d;\\n g[e.to][e.rev].cap+=d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n}\\n\\nint max_flow(int s,int t){\\n int flow=0;\\n for(;;){\\n fill(used,used+MAX_V,false);\\n int f=dfs(s,t,INF);\\n if(f==0)return flow;\\n flow+=f;\\n }\\n}\\n\\nint main(void){\\n\\n int n;\\n while(cin >> n,n){\\n\\n for(int i=0;i<MAX_V;i++)g[i].clear();\\n\\n vector<int>a;\\n map<int,int>mp;\\n int m,in,tmp;\\n cin >> tmp;\\n for(int i=0;i<tmp;i++){\\n cin >> in;\\n add_edge(n+tmp,i,1);\\n a.push_back(in);\\n mp[in]=i;\\n }\\n\\n for(int i=0;i<n;i++){\\n cin >> m;\\n vector<int>b(m);\\n for(int j=0;j<m;j++)cin >> b[j];\\n for(int j=0;j<m;j++){\\n if(mp.count(b[j])){\\n add_edge(mp[b[j]],i+tmp,1);\\n }\\n }\\n }\\n\\n for(int i=0;i<n;i++){\\n add_edge(i+tmp,n+tmp+1,1);\\n }\\n cout << max_flow(n+tmp,n+tmp+1) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 1532,\n \"score_of_the_acc\": -0.4818,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2064_798621\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<cassert>\\n#include<map>\\n\\n#define MAX_V 5000\\n#define INF (1<<29)\\n\\nusing namespace std;\\n\\nstruct edge{int to,cap,rev;};\\n\\nvector<edge>g[MAX_V];\\nbool used[MAX_V];\\n\\nvoid add_edge(int from,int to,int cap){\\n g[from].push_back((edge){to,cap,g[to].size()});\\n g[to].push_back((edge){from,0,g[from].size()-1});\\n}\\n\\nint dfs(int v,int t,int f){\\n if(v==t)return f;\\n used[v]=true;\\n for(int i=0;i<g[v].size();i++){\\n edge &e=g[v][i];\\n if(!used[e.to] && e.cap>0){\\n int d=dfs(e.to,t,min(f,e.cap));\\n if(d>0){\\n e.cap-=d;\\n g[e.to][e.rev].cap+=d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n}\\n\\nint max_flow(int s,int t){\\n int flow=0;\\n for(;;){\\n fill(used,used+MAX_V,false);\\n int f=dfs(s,t,INF);\\n if(f==0)return flow;\\n flow+=f;\\n }\\n}\\nint main(void){\\n\\n int n;\\n while(cin >> n,n){\\n\\n for(int i=0;i<MAX_V;i++)g[i].clear();\\n\\n vector<int>a;\\n map<int,int>mp;\\n int m,in,tmp;\\n cin >> tmp;\\n for(int i=0;i<tmp;i++){\\n cin >> in;\\n add_edge(n+tmp,i,1);\\n a.push_back(in);\\n mp[in]=i;\\n }\\n\\n for(int i=0;i<n;i++){\\n cin >> m;\\n vector<int>b(m);\\n for(int j=0;j<m;j++)cin >> b[j];\\n for(int j=0;j<m;j++){\\n if(mp.count(b[j])){\\n add_edge(mp[b[j]],i+tmp,1);\\n }\\n }\\n }\\n\\n for(int i=0;i<n;i++){\\n add_edge(i+tmp,n+tmp+1,1);\\n }\\n cout << max_flow(n+tmp,n+tmp+1) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 1532,\n \"score_of_the_acc\": -0.4818,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2064_798518\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<map>\\n#include<cstring>\\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 all(n) (n).begin(),(n).end()\\n#define MAX_V 1100\\nusing namespace std;\\n\\n//follow\\nstruct edge\\n{\\n int to,cap,rev;\\n edge(int to=inf,int cap=inf,int rev=inf):to(to),cap(cap),rev(rev){}\\n};\\n \\nvector<edge> G[MAX_V];\\nint level[MAX_V];\\nint iter[MAX_V];\\nbool used[MAX_V];\\n \\nvoid init(int V)\\n{\\n rep(i,V)G[i].clear();\\n}\\n \\nvoid add_edge(int from,int to,int cap)\\n{\\n G[from].push_back(edge(to,cap,G[to].size()));\\n G[to].push_back(edge(from,0,G[from].size()-1));\\n}\\n\\nint dfs(int v,int t,int f)\\n{\\n if(v == t)return f;\\n used[v] = true;\\n for(int i=0;i<G[v].size();i++)\\n {\\n edge &e = G[v][i];\\n if(e.cap > 0 && !used[e.to])\\n\\t{\\n\\t int d = dfs(e.to,t,min(f,e.cap));\\n\\t if(d > 0)\\n\\t {\\n\\t e.cap -= d;\\n\\t G[e.to][e.rev].cap += d;\\n\\t return d;\\n\\t }\\n\\t}\\n }\\n return 0;\\n}\\n \\nint max_flow(int s,int t)\\n{\\n int flow = 0;\\n for(;;)\\n {\\n memset(used,0,sizeof(used));\\n int f = dfs(s,t,inf);\\n if(f == 0)\\n\\t{\\n\\t return flow;\\n\\t}\\n flow += f;\\n }\\n}\\n \\n//\\n\\nint main()\\n{\\n int N,k,K,s,t,day;\\n while(cin >> N,N)\\n {\\n cin >> k;\\n K = k;\\n s = k + N;\\n t = s + 1;\\n init(t+1);\\n map<int,int> days;\\n vector<int> vday;\\n rep(i,k)\\n\\t{\\n\\t cin >> day;\\n\\t vday.push_back(day);\\n\\t}\\n sort(all(vday));\\n vday.erase(unique(all(vday)),vday.end());\\n rep(i,vday.size())\\n\\t{\\n\\t days[vday[i]] = i;\\n\\t add_edge(s,i,1);\\n\\t}\\n\\n rep(i,N)\\n\\t{\\n\\t cin >> k;\\n\\t rep(j,k)\\n\\t {\\n\\t cin >> day;\\n\\t if(days.find(day) != days.end())\\n\\t\\t{\\n\\t\\t add_edge(days[day],K+i,1);\\n\\t\\t}\\n\\t }\\n\\t add_edge(K+i,t,1);\\n\\t}\\n\\n cout << max_flow(s,t) << endl;\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 1536,\n \"score_of_the_acc\": -0.4468,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1096,"cells":{"group_id":{"kind":"string","value":"aoj_2067_cpp"},"problem_description":{"kind":"string","value":"Reading Brackets in English\nShun and his professor are studying Lisp and S-expressions. Shun is in Tokyo in order to make a presen-\ntation of their research. His professor cannot go with him because of another work today.\nHe was making final checks for his slides an hour ago. Then, unfortunately, he found some serious\nmistakes! He called his professor immediately since he did not have enough data in his hand to fix the\nmistakes.\nTheir discussion is still going on now. The discussion looks proceeding with difficulty. Most of their data\nare written in S-expressions, so they have to exchange S-expressions via telephone.\nYour task is to write a program that outputs S-expressions represented by a given English phrase.\nInput\nThe first line of the input contains a single positive integer\nN\n, which represents the number of test cases.\nThen\nN\ntest cases follow.\nEach case consists of a line. The line contains an English phrase that represents an S-expression. The\nlength of the phrase is up to 1000 characters.\nThe rules to translate an S-expression are as follows.\nAn S-expression which has one element is translated into “a list of <\nthe element of the S-expression\n>”. (e.g. “(A)” will be “a list of A”)\nAn S-expression which has two elements is translated into “a list of <\nthe first element of the S-expression\n> and <\nthe second element of the S-expression\n>”. (e.g. “(A B)” will be “a list of A and B”)\nAn S-expression which has more than three elements is translated into “a list of <\nthe first element of the S-expression\n>, <\nthe second element of the S-expression\n>, . . . and <\nthe last element\n of the S-expression\n>”. (e.g. “(A B C D)” will be “a list of A, B, C and D”)\nThe above rules are applied recursively. (e.g. “(A (P Q) B (X Y Z) C)” will be “a list of\n A, a list of P and Q, B, a list of X, Y and Z and C”)\nEach atomic element of an S-expression is a string made of less than 10 capital letters. All words (“a”,\n“list”, “of” and “and”) and atomic elements of S-expressions are separated by a single space character,\nbut no space character is inserted before comma (”,”). No phrases for empty S-expressions occur in the\ninput. You can assume that all test cases can be translated into S-expressions, but the possible expressions\nmay not be unique.\nOutput\nFor each test case, output the corresponding S-expression in a separate line. If the given phrase involves\ntwo or more different S-expressions, output “AMBIGUOUS” (without quotes).\nA single space character should be inserted between the elements of the S-expression, while no space\ncharacter should be inserted after open brackets (“(”) and before closing brackets (“)”).\nSample Input\n4\na list of A, B, C and D\na list of A, a list of P and Q, B, a list of X, Y and Z and C\na list of A\na list of a list of A and B\nOutput for the Sample Input\n(A B C D)\n(A (P Q) B (X Y Z) C)\n(A)\nAMBIGUOUS"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2067_10313005","code_snippet":"// AOJ #2067 Reading Brackets in English\n// 2025.3.20\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Ans {\n bool valid, amb;\n string s;\n};\n\nAns mergeAns(const Ans &a, const Ans &b) {\n if(!a.valid) return b;\n if(!b.valid) return a;\n Ans ret;\n ret.valid = true;\n if(a.amb || b.amb || a.s != b.s) ret.amb = true;\n else {\n ret.amb = false;\n ret.s = a.s;\n }\n return ret;\n}\n\ntypedef unordered_map<int, Ans> MapAns;\n\nvoid unionMap(MapAns &dest, const MapAns &src) {\n for(auto &pr : src) {\n int pos = pr.first;\n if(dest.find(pos) == dest.end()) dest[pos] = pr.second;\n else dest[pos] = mergeAns(dest[pos], pr.second);\n }\n}\n\nvector<string> T;\n\nunordered_map<int, MapAns> memoS, memoE, memoL, memoList;\n\nMapAns parseS(int);\nMapAns parseE(int);\nMapAns parseL(int);\nMapAns parseList(int);\n\nMapAns parseS(int i) {\n if(memoS.count(i)) return memoS[i];\n MapAns res;\n if(i+3 <= (int)T.size() && T[i]==\"a\" && T[i+1]==\"list\" && T[i+2]==\"of\") {\n MapAns mL = parseL(i+3);\n for(auto &pr : mL) {\n int pos = pr.first;\n Ans an;\n an.valid = pr.second.valid;\n an.amb = pr.second.amb;\n an.s = \"(\" + pr.second.s + \")\";\n res[pos] = an;\n }\n }\n memoS[i] = res;\n return res;\n}\n\nMapAns parseE(int i) {\n if(memoE.count(i)) return memoE[i];\n MapAns res;\n MapAns mS = parseS(i);\n unionMap(res, mS);\n if(i+1 <= (int)T.size()) {\n string tok = T[i];\n bool isAtom = true;\n for(char c : tok) {\n if(!isupper(c)) { isAtom = false; break; }\n }\n if(isAtom) {\n Ans an;\n an.valid = true;\n an.amb = false;\n an.s = tok;\n res[i+1] = an;\n }\n }\n memoE[i] = res;\n return res;\n}\n\nMapAns parseList(int i) {\n if(memoList.count(i)) return memoList[i];\n MapAns res;\n MapAns mE = parseE(i);\n for(auto &pr : mE) {\n int pos = pr.first;\n res[pos] = mergeAns(res[pos], pr.second);\n if(pos < (int)T.size() && T[pos] == \",\") {\n MapAns mList = parseList(pos+1);\n for(auto &pr2 : mList) {\n int pos2 = pr2.first;\n Ans an;\n if(pr.second.valid && pr2.second.valid) {\n an.valid = true;\n string cand = pr.second.s + \" \" + pr2.second.s;\n an.amb = pr.second.amb || pr2.second.amb;\n an.s = cand;\n } else an.valid = false;\n res[pos2] = mergeAns(res[pos2], an);\n }\n }\n }\n memoList[i] = res;\n return res;\n}\n\nMapAns parseL(int i) {\n if(memoL.count(i)) return memoL[i];\n MapAns res;\n MapAns mE = parseE(i);\n unionMap(res, mE);\n MapAns mList = parseList(i);\n for(auto &pr : mList) {\n int pos = pr.first;\n if(pos < (int)T.size() && T[pos]==\"and\") {\n MapAns mE2 = parseE(pos+1);\n for(auto &pr2 : mE2) {\n int pos2 = pr2.first;\n Ans an;\n if(pr.second.valid && pr2.second.valid) {\n an.valid = true;\n string cand = pr.second.s + \" \" + pr2.second.s;\n an.s = cand;\n an.amb = pr.second.amb || pr2.second.amb;\n } else an.valid = false;\n res[pos2] = mergeAns(res[pos2], an);\n }\n }\n }\n memoL[i] = res;\n return res;\n}\n\nvector<string> tokenize(const string &s) {\n vector<string> ret;\n istringstream iss(s);\n string token;\n while(iss >> token) {\n while(!token.empty() && token.back()==','){\n token.pop_back();\n ret.push_back(token);\n ret.push_back(\",\");\n token = \"\";\n }\n if(!token.empty()) ret.push_back(token);\n }\n return ret;\n}\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N; cin >> N;\n cin.ignore();\n for(int tc=0; tc<N; tc++){\n string line;\n getline(cin, line);\n T = tokenize(line);\n memoS.clear(); memoE.clear(); memoL.clear(); memoList.clear();\n MapAns mS = parseS(0);\n Ans finalAns; finalAns.valid = false;\n for(auto &pr : mS) {\n if(pr.first == (int)T.size() && pr.second.valid) {\n finalAns = mergeAns(finalAns, pr.second);\n }\n }\n if(finalAns.valid && !finalAns.amb) cout << finalAns.s << endl;\n else cout << \"AMBIGUOUS\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":19940,"score_of_the_acc":-0.4811,"final_rank":4},{"submission_id":"aoj_2067_3037167","code_snippet":"#include <cstdio>\n#include <cctype>\n#include <cassert>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <functional>\n\nvoid preprocess(const std::string &s, std::vector<std::string> &t) {\n t.clear();\n for (size_t i=0; i<s.length(); ++i) {\n if (s[i] == 'a') {\n if (s[i+1] == ' ') {\n // \"a list of \"\n t.push_back(\"(\");\n i += 9;\n } else if (s[i+1] == 'n') {\n // \"and \"\n t.push_back(\"&\");\n i += 3;\n } else {\n assert(false);\n }\n continue;\n }\n\n std::string word(1, s[i]);\n while (++i < s.length() && isupper(s[i]))\n word += s[i];\n\n t.push_back(word);\n if (i < s.length() && s[i] == ',') {\n ++i;\n }\n }\n}\n\nvoid debug(const std::vector<std::string> &s) {\n fprintf(stderr, \"> \");\n for (size_t i=0; i<s.size(); ++i)\n fprintf(stderr, \"%s%c\", s[i].c_str(), i+1<s.size()? ' ':'\\n');\n}\n\nstd::string cyk(const std::vector<std::string> &s) {\n /*\n S-Expr -> \"(\" Element\n | \"(\" Elements\n Element -> Upper\n | S-Expr\n Elements -> Element \"and\" Element\n | Element Elements\n ---\n\n S-Expr -> \"(\" Elements\n | \"(\" Upper\n | \"(\" S-Expr\n Elements -> Upper Elements\n | Upper AndElement\n | S-Expr Elements\n | S-Expr AndElement\n AndElement -> \"and\" Upper\n | \"and\" S-Expr\n */ \n enum Symbol {\n INVALID,\n // non-terminals\n S_EXPR, ELEMS, AND_ELEM,\n // terminals\n PAREN=9, AND, UPPER,\n };\n std::vector<std::string> types={\n \"0\", \"S-expr\", \"Elems\", \"AndElem\",\n \"0\", \"0\", \"0\", \"0\", \"0\", \"\\\"(\\\"\", \"\\\"and\\\"\", \"[A-Z]+\"\n };\n \n auto category=[](const std::string &token) {\n if (token == \"(\") return PAREN;\n if (token == \"&\") return AND;\n if (isupper(token[0])) return UPPER;\n return INVALID;\n };\n\n std::vector<Symbol> term={PAREN, AND, UPPER};\n std::vector<std::vector<Symbol>> prod={\n {S_EXPR, PAREN, ELEMS},\n {S_EXPR, PAREN, UPPER},\n {S_EXPR, PAREN, S_EXPR},\n {ELEMS, UPPER, ELEMS},\n {ELEMS, UPPER, AND_ELEM},\n {ELEMS, S_EXPR, ELEMS},\n {ELEMS, S_EXPR, AND_ELEM},\n {AND_ELEM, AND, UPPER},\n {AND_ELEM, AND, S_EXPR},\n };\n\n std::vector<std::vector<std::vector<int>>> dp(\n s.size(), std::vector<std::vector<int>>(\n s.size(), std::vector<int>(prod.size()+term.size())));\n\n for (size_t i=0; i<s.size(); ++i) {\n Symbol cat=category(s[i]);\n if (cat != INVALID) {\n dp[0][i][cat] = 1;\n }\n }\n\n struct Left {\n size_t length, pos;\n Symbol symb;\n Left(size_t i, size_t j, Symbol a): length(i), pos(j), symb(a) {}\n bool operator <(const Left &oth) const {\n if (length != oth.length) return length < oth.length;\n if (pos != oth.pos) return pos < oth.pos;\n return symb < oth.symb;\n }\n };\n\n struct Right {\n size_t part;\n Symbol symb1, symb2;\n Right(size_t k, Symbol b, Symbol c): part(k), symb1(b), symb2(c) {}\n };\n\n std::map<Left, Right> via;\n size_t n=s.size();\n for (size_t i=1; i<n; ++i) {\n for (size_t j=0; j<n-i; ++j) {\n for (size_t k=1; k<=i; ++k) {\n for (const auto &pp: prod) {\n Symbol a=pp[0], b=pp[1], c=pp[2];\n if (dp[k-1][j][b] && dp[i-k][j+k][c]) {\n dp[i][j][a] += std::max(dp[k-1][j][b], dp[i-k][j+k][c]);\n if (dp[i][j][a] > 2) dp[i][j][a] = 2;\n via.emplace(Left(i, j, a), Right(k, b, c));\n }\n }\n }\n }\n }\n if (dp[n-1][0][1] > 1) return \"AMBIGUOUS\";\n\n assert(dp[n-1][0][1]);\n std::function<std::string (Left)> dfs=[&](const Left &left) {\n if (left.length == 0) return s[left.pos];\n Right right=via.at(left);\n size_t i=left.length, j=left.pos, k=right.part;\n Symbol a=left.symb, b=right.symb1, c=right.symb2;\n\n std::string sb=dfs(Left(k-1, j, b)), sc=dfs(Left(i-k, j+k, c));\n\n if (a == S_EXPR) {\n return sb + sc + \")\";\n } else if (a == ELEMS) {\n return sb + \" \" + sc;\n } else if (a == AND_ELEM) {\n assert(sb == \"&\");\n return sc;\n } else {\n assert(false);\n }\n };\n return dfs(Left(n-1, 0, S_EXPR));\n}\n\nvoid solve_testcase() {\n char buf[1024];\n scanf(\"\\n%[^\\n]\", buf);\n std::string s=buf;\n std::vector<std::string> t;\n preprocess(s, t);\n printf(\"%s\\n\", cyk(t).c_str());\n}\n\nint main() {\n int N;\n scanf(\"%d\", &N);\n for (int i=0; i<N; ++i)\n solve_testcase();\n}","accuracy":1,"time_ms":6450,"memory_kb":12072,"score_of_the_acc":-1.2589,"final_rank":6},{"submission_id":"aoj_2067_2131263","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define pb push_back\n#define vi vector<int>\n#define vvi vector<vi>\n#define va vector<array<int,6>>\n#define vva vector<va>\n\nvector<string> toVs(string s){\n\tvector<string> ret;\n\tstring buf = \"\";\n\t\n\trep(i,s.size()){\n\t\tif(i+9<=s.size()&&s.substr(i,9)==\"a list of\"){\n\t\t\tbuf+=\"<\";\n\t\t\ti+=8;\n\t\t}\n\t\telse if(i+3<=s.size()&&s.substr(i,3)==\"and\"){\n\t\t\tbuf+=\"&\";\n\t\t\ti+=2;\n\t\t}\n\t\telse if(isalpha(s[i]))buf+=s[i];\n\t\telse if(s[i]==' '){\n\t\t\tret.pb(buf);\n\t\t\tbuf = \"\";\n\t\t}\n\t}\n\tif(buf.size())ret.pb(buf);\n\treturn ret;\n}\n\n\nvector<char> toWordClass(vector<string> vs){\n\tvector<char> ret;\n\trep(i,vs.size()){\n\t\tstring s = vs[i];\n\t\tif(s==\"<\")ret.pb('L');\n\t\telse if(s==\"&\")ret.pb('A');\n\t\telse ret.pb('T');\n\t}\n\treturn ret;\n}\n\n\ndeque<string> dfs(int a,int b,int c,vector<vva> &bef,vector<string> &vs){\n\tif(a==b){\n\t\tif(vs[a]==\"<\"||vs[a]==\"&\")return deque<string>();\n\t\tdeque<string> ret;\n\t\tret.push_back(vs[a]);\n\t\treturn ret;\n\t}\n\t\n\tarray<int,3> l,r;\n\trep(i,3)l[i] = bef[a][b][c][i];\n\trep(i,3)r[i] = bef[a][b][c][i+3];\n\t\n\tdeque<string> ret,y;\n\tret = dfs(l[0],l[1],l[2],bef,vs);\n\ty = dfs(r[0],r[1],r[2],bef,vs);\n\t\n\tfor(auto &e:y){\n\t\tret.push_back(e);\n\t}\n\t\n\tif(c==0){\n\t\tret.push_front(\"(\");\n\t\tret.push_back(\")\");\n\t}\n\t\n\treturn ret;\n}\n\n\nint main(){\n\tvector<pii> rule[3] = {\n\t\t{pii(4,3),pii(4,0),pii(4,1)},\t\t\t//S\n\t\t{pii(3,2),pii(0,2),pii(3,1),pii(0,1)},\t//P\n\t\t{pii(5,3),pii(5,0)}\t\t\t\t\t\t//Q\n\t};\n\t\n\tint n;\n\tcin>>n;\n\tcin.ignore();\n\twhile(n--){\n\t\tstring s;\n\t\tgetline(cin,s);\n\t\tvector<string> vs = toVs(s);\n\t\tint N = vs.size();\n\t\tvector<char> wc = toWordClass(vs);\n\t\t\n\t\tvector<vvi> dp(N,vvi(N,vi(6,0)));\n\t\tvector<vva> bef(N,vva(N,va(6,array<int,6>{-1,-1,-1,-1,-1,-1})));\n\t\t\n\t\trep(i,N){\n\t\t\tif(wc[i]=='T')dp[i][i][3]=1;\n\t\t\tif(wc[i]=='L')dp[i][i][4]=1;\n\t\t\tif(wc[i]=='A')dp[i][i][5]=1;\n\t\t}\n\t\t\n\t\tfor(int wid = 2;wid<=N;wid++){\n\t\t\tfor(int l = 0;l<N;l++){\n\t\t\t\tint r = l+wid-1;\n\t\t\t\tif(r>=N)continue;\n\t\t\t\trep(i,3){\n\t\t\t\t\tfor(int p = l;p<=r-1;p++){\n\t\t\t\t\t\trep(j,rule[i].size()){\n\t\t\t\t\t\t\tint x,y;\n\t\t\t\t\t\t\ttie(x,y) = rule[i][j];\n\t\t\t\t\t\t\tif(dp[l][p][x]!=0 && dp[p+1][r][y]!=0){\n\t\t\t\t\t\t\t\tdp[l][r][i]+=dp[l][p][x]*dp[p+1][r][y];\n\t\t\t\t\t\t\t\tif(dp[l][r][i]>2)dp[l][r][i] = 2;\n\t\t\t\t\t\t\t\tbef[l][r][i] = array<int,6>{l,p,x,p+1,r,y};\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\t\n\t\tif(dp[0][N-1][0]>=2){\n\t\t\tcout<<\"AMBIGUOUS\"<<endl;\n\t\t\tcontinue;\n\t\t}\n\t\tassert(dp[0][N-1][0]!=0);\n\t\t\n\t\t\n\t\tdeque<string> ans = dfs(0,N-1,0,bef,vs);\n\t\t\n\t\tvector<string> a;\n\t\tfor(auto &e:ans)a.pb(e);\n\t\t\n\t\trep(i,a.size()){\n\t\t\tif(a[i]==\"(\"||(i+1<a.size()&&a[i+1]==\")\")||i==a.size()-1)cout<<a[i];\n\t\t\telse cout<<a[i]<<\" \";\n\t\t}\n\t\tcout<<endl;\n\t}\n}","accuracy":1,"time_ms":5110,"memory_kb":29164,"score_of_the_acc":-1.5118,"final_rank":7},{"submission_id":"aoj_2067_2093243","code_snippet":"#include <vector>\n#include <iostream>\n#include <utility>\n#include <algorithm>\n#include <string>\n#include <deque>\n#include <tuple>\n#include <queue>\n#include <functional>\n#include <cmath>\n#include <iomanip>\n#include <map>\n#include <numeric>\n#include <unordered_map>\n#include <unordered_set>\n#include <complex>\n#include <iterator>\n#include <array>\n#include <chrono>\n//cin.sync_with_stdio(false);\n//streambuf\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef pair<double, double> pdd;\nusing vi = vector<int>;\nusing vll = vector<ll>;\nusing vpii = vector<pii>;\ntemplate<class T, int s>using va = vector<array<T, s>>;\ntemplate<class T, class T2> using umap = unordered_map<T, T2>;\ntemplate<class T> using uset = unordered_set<T>;\ntemplate<class T, class S> void cmin(T &a, const S&&b) { if (a > b)a = b; }\ntemplate<class T, class S> void cmax(T &a, const S&&b) { if (a < b)a = b; }\n#define ALL(a) a.begin(),a.end()\n#define rep(i,a) for(int i=0;i<a;i++)\n#define rep1(i,a) for(int i=1;i<=a;i++)\n#define rrep(i,a) for(int i=a-1;i>=0;i--)\n#define rrep1(i,a) for(int i=a;i;i--)\nconst ll mod = 1000000007;\n#ifndef INT_MAX\nconst int INT_MAX = numeric_limits<signed>().max();\n#endif\ntemplate<class T>using heap = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T>using pque = priority_queue<T, vector<T>, function<T(T, T)>>;\ntemplate <class T>\ninline void hash_combine(size_t & seed, const T & v) {\n\thash<T> hasher;\n\tseed ^= hasher(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2);\n}\nnamespace std {\n\n\ttemplate<typename S, typename T> struct hash<pair<S, T>> {\n\t\tinline size_t operator()(const pair<S, T> & v) const {\n\t\t\tsize_t seed = 0;\n\t\t\thash_combine(seed, v.first);\n\t\t\thash_combine(seed, v.second);\n\t\t\treturn seed;\n\t\t}\n\t};\n\t// Recursive template code derived from Matthieu M.\n\ttemplate <class Tuple, size_t Index = std::tuple_size<Tuple>::value - 1>\n\tstruct HashValueImpl\n\t{\n\t\tstatic void apply(size_t& seed, Tuple const& tuple)\n\t\t{\n\t\t\tHashValueImpl<Tuple, Index - 1>::apply(seed, tuple);\n\t\t\thash_combine(seed, std::get<Index>(tuple));\n\t\t}\n\t};\n\n\ttemplate <class Tuple>\n\tstruct HashValueImpl<Tuple, 0>\n\t{\n\t\tstatic void apply(size_t& seed, Tuple const& tuple)\n\t\t{\n\t\t\thash_combine(seed, std::get<0>(tuple));\n\t\t}\n\t};\n\n\ttemplate <typename ... TT>\n\tstruct hash<std::tuple<TT...>>\n\t{\n\t\tsize_t\n\t\t\toperator()(std::tuple<TT...> const& tt) const\n\t\t{\n\t\t\tsize_t seed = 0;\n\t\t\tHashValueImpl<std::tuple<TT...> >::apply(seed, tt);\n\t\t\treturn seed;\n\t\t}\n\n\t};\n}\nll pow(ll base, ll i, ll mod) {\n\tll a = 1;\n\twhile (i) {\n\t\tif (i & 1) {\n\t\t\ta *= base;\n\t\t\ta %= mod;\n\t\t}\n\t\tbase *= base;\n\t\tbase %= mod;\n\t\ti /= 2;\n\t}\n\treturn a;\n}\nclass unionfind {\n\tvector<int> par, rank, size_;//????????§??????????????¢???????????????????????????rank???????????????size?????????\npublic:\n\tunionfind(int n) :par(n), rank(n), size_(n, 1) {\n\t\tiota(ALL(par), 0);\n\t}\n\tint find(int x) {\n\t\tif (par[x] == x)return x;\n\t\treturn par[x] = find(par[x]);\n\t}\n\tvoid unite(int x, int y) {\n\t\tx = find(x), y = find(y);\n\t\tif (x == y)return;\n\t\tif (rank[x] < rank[y])swap(x, y);\n\t\tpar[y] = x;\n\t\tsize_[x] += size_[y];\n\t\tif (rank[x] == rank[y])rank[x]++;\n\t}\n\tbool same(int x, int y) {\n\t\treturn find(x) == find(y);\n\t}\n\tint size(int x) {\n\t\treturn size_[find(x)];\n\t}\n};\nll gcd(ll a, ll b) {\n\twhile (b) {\n\t\tll c = a%b;\n\t\ta = b;\n\t\tb = c;\n\t}\n\treturn a;\n}\nll lcm(ll a, ll b) {\n\treturn a / gcd(a, b)*b;\n}\nint popcnt(unsigned long long a) {\n\ta = (a & 0x5555555555555555) + (a >> 1 & 0x5555555555555555);\n\ta = (a & 0x3333333333333333) + (a >> 2 & 0x3333333333333333);\n\ta = (a & 0x0f0f0f0f0f0f0f0f) + (a >> 4 & 0x0f0f0f0f0f0f0f0f);\n\ta = (a & 0x00ff00ff00ff00ff) + (a >> 8 & 0x00ff00ff00ff00ff);\n\ta = (a & 0x0000ffff0000ffff) + (a >> 16 & 0x0000ffff0000ffff);\n\treturn (a & 0xffffffff) + (a >> 32);\n}\ntemplate<class T, class Func = function<T(T, T)>>\nclass segtree {\n\tvector<T> obj;\n\tint offset;\n\tFunc updater;\n\tT e;\n\tint bufsize(int num) {\n\t\tint i = 1;\n\t\tfor (; num >i; i <<= 1);\n\t\toffset = i - 1;\n\t\treturn (i << 1) - 1;\n\t}\n\tT query(int a, int b, int k, int l, int r) {\n\t\tif (r <= a || b <= l)return e;\n\t\tif (a <= l && r <= b)return obj[k];\n\t\telse return updater(query(a, b, k * 2 + 1, l, (l + r) / 2), query(a, b, k * 2 + 2, (l + r) / 2, r));\n\t}\npublic:\n\tT query(int a, int b) {//[a,b)\n\t\treturn query(a, b, 0, 0, offset + 1);\n\t}\n\tvoid updateall(int l = 0, int r = -1) {\n\t\tif (r < 0)r = offset + 1;\n\t\tl += offset, r += offset;\n\t\tdo {\n\t\t\tl = l - 1 >> 1, r = r - 1 >> 1;\n\t\t\tfor (int i = l; i < r; i++)obj[i] = updater(obj[i * 2 + 1], obj[i * 2 + 2]);\n\t\t} while (l);\n\t}\n\tvoid update(int k, T &a) {\n\t\tk += offset;\n\t\tobj[k] = a;\n\t\twhile (k) {\n\t\t\tk = k - 1 >> 1;\n\t\t\tobj[k] = updater(obj[k * 2 + 1], obj[k * 2 + 2]);\n\t\t}\n\t}\n\tsegtree(int n, T e, const Func &updater_ = Func()) :obj(bufsize(n), e), e(e), updater(updater_) {}\n\tsegtree(vector<T> &vec, T e, const Func &updater = Func()) :obj(bufsize(vec.size()), e), e(e), updater(updater) {\n\t\tcopy(vec.begin(), vec.end(), obj.begin() + offset);\n\t\tupdateall();\n\t}\n\ttypename vector<T>::reference operator[](int n) {\n\t\treturn obj[n + offset];\n\t}\n};\ntemplate<class T>\nclass matrix {\n\tvector<vector<T>> obj;\n\tpair<int, int> s;\npublic:\n\tmatrix(pair<int, int> size, T e = 0) :matrix(size.first, size.second, e) {}\n\tmatrix(int n, int m = -1, T e = 0) :obj(n, vector<T>(m == -1 ? n : m, e)), s(n, m == -1 ? n : m) {}\n\tstatic matrix e(int n) {\n\t\tmatrix a = (n);\n\t\tfor (int i = 0; i < n; i++)a[i][i] = 1;\n\t\treturn a;\n\t}\n\tmatrix& operator+=(const matrix &p) {\n\t\tif (s != p.s)throw runtime_error(\"matrix error\");\n\t\tfor (int i = 0; i < s.first; i++)\n\t\t\tfor (int j = 0; j < s.second; j++)obj[i][j] += p.obj[i][j];\n\t\treturn *this;\n\t}\n\tmatrix operator+(const matrix &p) {\n\t\tmatrix res(*this);\n\t\treturn res += p;\n\t}\n\tmatrix& operator-=(const matrix &p) {\n\t\tif (s != p.s)throw runtime_error(\"matrix error\");\n\t\tfor (int i = 0; i < s.first; i++)\n\t\t\tfor (int j = 0; j < s.second; j++)obj[i][j] -= p.obj[i][j];\n\t\treturn *this;\n\t}\n\tmatrix operator-(const matrix &p) {\n\t\tmatrix res(*this);\n\t\treturn res -= p;\n\t}\n\tmatrix& operator*=(T p) {\n\t\tfor (auto &a : obj)\n\t\t\tfor (auto &b : a)b *= p;\n\t\treturn *this;\n\t}\n\tmatrix operator*(T p) {\n\t\tmatrix res(*this);\n\t\treturn res *= p;\n\t}\n\tmatrix operator*(const matrix &p) {\n\t\tif (s.second != p.s.first)throw runtime_error(\"matrix error\");\n\t\tmatrix ret(s.first, p.s.second);\n\t\tfor (int i = 0; i < s.first; i++)\n\t\t\tfor (int j = 0; j < s.second; j++)\n\t\t\t\tfor (int k = 0; k < p.s.second; k++)ret[i][k] += obj[i][j] * p.obj[j][k];\n\t\treturn ret;\n\t}\n\tmatrix &operator*=(const matrix &p) {\n\t\treturn *this = *this*p;\n\t}\n\tpair<int, int> size() const {\n\t\treturn s;\n\t}\n\tmatrix &mod(T m) {\n\t\tfor (auto &a : obj)\n\t\t\tfor (auto &b : a)b %= m;\n\t\treturn *this;\n\t}\n\ttypename vector<vector<T>>::reference operator[](int t) {\n\t\treturn obj[t];\n\t}\n};\ntemplate<class T> inline\nmatrix<T> pow(matrix<T> &base, unsigned exp) {\n\tauto base_(base);\n\tif (base_.size().first != base_.size().second)throw runtime_error(\"matrix error\");\n\tmatrix<T> res = matrix<T>::e(base_.size().first);\n\tfor (;;) {\n\t\tif (exp & 1)res *= base_;\n\t\tif (!(exp /= 2))break;\n\t\tbase_ *= base_;\n\t}\n\treturn res;\n}\ntemplate<class T> inline\nmatrix<T> modpow(matrix<T> &base, unsigned exp, T m) {\n\tauto base_(base);\n\tif (base.size().first != base_.size().second)throw runtime_error(\"matrix error\");\n\tmatrix<T> res = matrix<T>::e(base_.size().first);\n\tfor (;;) {\n\t\tif (exp & 1)(res *= base_).mod(m);\n\t\tif (!(exp /= 2))break;\n\t\t(base_ *= base_).mod(m);\n\t}\n\treturn res;\n}\ntemplate<class T>int id(vector<T> &a, T b) {\n\treturn lower_bound(ALL(a), b) - a.begin();\n}\nclass Flow {\n\tint V;\n\tstruct edge { int to, cap, rev, cost; };\n\tvector<vector<edge>> G;\n\tvector<int> level, iter, h, dist, prevv, preve;\n\tFlow(int size) :G(size + 1), V(size + 1) {\n\t}\n\tvoid add_edge(int from, int to, int cap, int cost = 0) {\n\t\tG[from].push_back(edge{ to, cap, (int)G[to].size(),cost });\n\t\tG[to].push_back(edge{ from,0,(int)G[from].size() - 1,-cost });\n\t}\n\tvoid bfs(int s) {\n\t\tfill(level.begin(), level.end(), -1);\n\t\tqueue<int> que;\n\t\tlevel[s] = 0;\n\t\tque.push(s);\n\t\twhile (!que.empty()) {\n\t\t\tint v = que.front(); que.pop();\n\t\t\tfor (int i = 0; i < G[v].size(); i++) {\n\t\t\t\tedge &e = G[v][i];\n\t\t\t\tif (e.cap > 0 && level[e.to] < 0) {\n\t\t\t\t\tlevel[e.to] = level[v] + 1;\n\t\t\t\t\tque.push(e.to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint dfs(int v, int t, int f) {\n\t\tif (v == t)return f;\n\t\tfor (int &i = iter[v]; i < G[v].size(); i++) {\n\t\t\tedge &e = G[v][i];\n\t\t\tif (e.cap > 0 && level[v] < level[e.to]) {\n\t\t\t\tint d = dfs(e.to, t, min(f, e.cap));\n\t\t\t\tif (d > 0) {\n\t\t\t\t\te.cap -= d;\n\t\t\t\t\tG[e.to][e.rev].cap += d;\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\tint max_flow(int s, int t) {\n\t\tlevel.resize(V);\n\t\titer.resize(V);\n\t\tint flow = 0;\n\t\tfor (;;) {\n\t\t\tbfs(s);\n\t\t\tif (level[t] < 0)return flow;\n\t\t\tfill(iter.begin(), iter.end(), 0);\n\t\t\tint f;\n\t\t\twhile ((f = dfs(s, t, numeric_limits<int>::max()))>0) {\n\t\t\t\tflow += f;\n\t\t\t}\n\t\t}\n\t}\n\ttypedef pair<int, int> P;\n\tint min_cost_flow(int s, int t, int f) {\n\t\tint res = 0;\n\t\th.resize(V);\n\t\tdist.resize(V);\n\t\tprevv.resize(V);\n\t\tpreve.resize(V);\n\t\tfill(h.begin(), h.end(), 0);\n\t\twhile (f > 0) {\n\t\t\tpriority_queue<P, vector<P>, greater<P>> que;\n\t\t\tfill(dist.begin(), dist.end(), numeric_limits<int>::max());\n\t\t\tdist[s] = 0;\n\t\t\tque.push({ 0,s });\n\t\t\twhile (!que.empty()) {\n\t\t\t\tP p = que.top(); que.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.to]>dist[v] + e.cost + h[v] - h[e.to]) {\n\t\t\t\t\t\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n\t\t\t\t\t\tprevv[e.to] = v;\n\t\t\t\t\t\tpreve[e.to] = i;\n\t\t\t\t\t\tque.push({ dist[e.to],e.to });\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist[t] == numeric_limits<int>::max()) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tfor (int v = 0; v < V; v++)h[v] += dist[v];\n\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.rev].cap += d;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n};\nconst ld eps = 1e-11, pi = acos(-1.0);\ntypedef complex<ld> P;\ntypedef vector<P> VP;\nld dot(P a, P b) { return real(conj(a) * b); }\nld cross(P a, P b) { return imag(conj(a) * b); }\n\nnamespace std {\n\tbool operator<(const P &a, const P &b) {\n\t\treturn abs(a.real() - b.real()) < eps ? a.imag() < b.imag() : a.real() < b.real();\n\t}\n}\n\nstruct L { P a, b; };//line->l,segment->s\nstruct C { P p; ld r; };\n\nint ccw(P a, P b, P c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > eps) return 1; // counter clockwise\n\tif (cross(b, c) < -eps) return -1; // clockwise\n\tif (dot(b, c) < 0) return 2; // c--a--b on line\n\tif (norm(b) < norm(c)) return -2; // a--b--c on line\n\treturn 0; // a--c--b on line\n}\n\nbool isis_ll(L l, L m) {//is intersect\n\treturn abs(cross(l.b - l.a, m.b - m.a)) > eps;\n}\n\nbool isis_ls(L l, L s) {\n\tld a = cross(l.b - l.a, s.a - l.a);\n\tld b = cross(l.b - l.a, s.b - l.a);\n\treturn (a * b < eps);\n}\n\nbool isis_lp(L l, P p) {\n\treturn abs(cross(l.b - p, l.a - p)) < eps;\n}\n\nbool isis_ss(L s, L 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\nP is_ll(L s, L t) { //intersect\n\tP sv = s.b - s.a, tv = t.b - t.a;\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n\nbool isis_sp(L s, P p) {\n\treturn abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps;\n}\n\nP proj(L l, P p) {\n\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + t * (l.a - l.b);\n}\n\nld dist_lp(L l, P p) {\n\treturn abs(p - proj(l, p));\n}\n\nld dist_ll(L l, L m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\nld dist_ls(L l, L s) {\n\tif (isis_ls(l, s)) return 0;\n\treturn min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\nld dist_sp(L s, P p) {\n\tP r = proj(s, p);\n\tif (isis_sp(s, r)) return abs(r - p);\n\treturn min(abs(s.a - p), abs(s.b - p));\n}\n\nld dist_ss(L s, L t) {\n\tif (isis_ss(s, t)) return 0;\n\tld a = min(dist_sp(s, t.a), dist_sp(t, s.a));\n\tld b = min(dist_sp(s, t.b), dist_sp(t, s.b));\n\treturn min(a, b);\n}\n\nVP is_cc(C c1, C c2) {\n\tVP 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\tP diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * P(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * P(rc, -rs));\n\treturn res;\n}\n\nbool isis_vc(vector<C> vc) {\n\tVP crs;\n\tint n = vc.size();\n\trep(i, n)rep(j, i)\n\t\tfor (P p : is_cc(vc[i], vc[j]))\n\t\t\tcrs.push_back(p);\n\trep(i, n)\n\t\tcrs.push_back(vc[i].p);\n\tfor (P p : crs) {\n\t\tbool valid = true;\n\t\trep(i, n)\n\t\t\tif (abs(p - vc[i].p)>vc[i].r + eps)\n\t\t\t\tvalid = false;\n\t\tif (valid) return true;\n\t}\n\treturn false;\n}\n\nVP is_lc(C c, L l) {\n\tVP 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\tP 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\nVP is_sc(C c, L l) {\n\tVP v = is_lc(c, l), res;\n\tfor (P p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\nvector<L> tangent_cp(C c, P p) {//????????\\????\n\tvector<L> ret;\n\tP 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\tP v1 = v * P(l / d, c.r / d);\n\tP v2 = v * P(l / d, -c.r / d);\n\tret.push_back(L{ p, p + v1 });\n\tif (l < eps) return ret;\n\tret.push_back(L{ p, p + v2 });\n\treturn ret;\n}\n\nvector<L> tangent_cc(C c1, C c2) {\n\tvector<L> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tP 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\tP out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<L> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), ALL(nret));\n\t}\n\telse {\n\t\tP v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tP q1 = c1.p + v * P(0, 1) * c1.r;\n\t\tP q2 = c1.p + v * P(0, -1) * c1.r;\n\t\tret.push_back(L{ q1, q1 + v });\n\t\tret.push_back(L{ q2, q2 + v });\n\t}\n\treturn ret;\n}\n\nld area(const VP &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\nbool is_polygon(L l, VP &g) {\n\tint n = g.size();\n\tfor (int i = 0; i < n; i++) {\n\t\tP a = g[i];\n\t\tP b = g[(i + 1) % n];\n\t\tif (isis_ss(l, L{ a, b })) return true;\n\t}\n\treturn false;\n}\n\nint is_in_Polygon(const VP &g, P p) {\n\tbool in = false;\n\tint n = g.size();\n\tfor (int i = 0; i < n; i++) {\n\t\tP a = g[i] - p, 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))\n\t\t\tif (cross(a, b) < 0) in = !in;\n\t\tif (abs(cross(a, b)) < eps && dot(a, b) < eps) return 0; // on\n\t}\n\tif (in) return 1; // in\n\treturn -1; // out\n}\n\nVP ConvexHull(VP ps) {\n\tint n = ps.size();\n\tint k = 0;\n\tsort(ps.begin(), ps.end());\n\tVP 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\nVP ConvexCut(const VP &ps, L l) {\n\tVP Q;\n\tfor (int i = 0; i < (int)ps.size(); i++) {\n\t\tP A = ps[i], B = ps[(i + 1) % ps.size()];\n\t\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\n\t\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0)\n\t\t\tQ.push_back(is_ll(L{ A, B }, l));\n\t}\n\treturn Q;\n}\ndouble dist2(P a) {\n\treturn real(a)*real(a) + imag(a)*imag(a);\n}\n// Suffix Array\t?????????O(|S|log^2|S|), ????´¢O(|T|log|S|), ?????????????§????O(|S|)\nclass StringSearch {\n\tconst int n;\n\tstring S;\npublic:\n\tvector<int> sa, rank;\n\tStringSearch(const string &S_) :n(S_.size()), S(S_), sa(n + 1), rank(n + 1) {\n\t\tfor (int i = 0; i <= n; i++) {\n\t\t\tsa[i] = i;\n\t\t\trank[i] = i < n ? S[i] : -1;\n\t\t}\n\t\tvector<int> tmp(n + 1);\n\t\tfor (int k = 1; k <= n; k *= 2) {\n\t\t\tauto Compare_SA = [=](int i, int j) {\n\t\t\t\tif (this->rank[i] != this->rank[j]) return this->rank[i] < this->rank[j];\n\n\t\t\t\tint ri = i + k <= n ? this->rank[i + k] : -1;\n\t\t\t\tint rj = j + k <= n ? this->rank[j + k] : -1;\n\t\t\t\treturn ri < rj;\n\t\t\t};\n\t\t\tsort(sa.begin(), sa.end(), Compare_SA);\n\t\t\ttmp[sa[0]] = 0;\n\t\t\tfor (int i = 1; i <= n; i++) {\n\t\t\t\ttmp[sa[i]] = tmp[sa[i - 1]] + (Compare_SA(sa[i - 1], sa[i]) ? 1 : 0);\n\t\t\t}\n\t\t\tfor (int i = 0; i <= n; i++) {\n\t\t\t\tthis->rank[i] = tmp[i];\n\t\t\t}\n\t\t}\n\t}\n\tbool Contain(const string &T) {\n\t\tint a = 0, b = n;\n\t\twhile (b - a > 1) {\n\t\t\tint c = (a + b) / 2;\n\t\t\tif (S.compare(sa[c], T.length(), T) < 0) a = c;\n\t\t\telse b = c;\n\t\t}\n\t\treturn S.compare(sa[b], T.length(), T) == 0;\n\t}\n\tvector<int> LCPArray() {\n\t\tfor (int i = 0; i <= n; i++) rank[sa[i]] = i;\n\t\tint h = 0;\n\t\tvector<int> lcp(n + 1);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint j = sa[rank[i] - 1];\n\t\t\tif (h > 0) h--;\n\t\t\tfor (; j + h < n && i + h < n; h++) {\n\t\t\t\tif (S[j + h] != S[i + h]) break;\n\t\t\t}\n\t\t\tlcp[rank[i] - 1] = h;\n\t\t}\n\t\treturn lcp;\n\t}\n};\n//0l \n//1A\n//141\n//101\n//2a\n//301\n//331\n//432\nint dp[340][340][5];\nvector<string> t;\nstring f4(int i, int j);\nstring f1(int i, int j) {\n\tif (i == j)return t[i];\n\trep(k, j - i) {\n\t\tif (dp[i][k][4] && dp[i + k + 1][j - k - 1 - i][1])return f4(i, i + k) + f1(i + k + 1, j) + ')';\n\t\tif (dp[i][k][0] && dp[i + k + 1][j - k - 1 - i][1])return '(' + f1(i + k + 1, j) + ')';\n\t}\n\treturn \"\";\n}\nstring f3(int i, int j) {\n\trep(k, j - i) {\n\t\tif (dp[i][k][0] && dp[i + k + 1][j - k - 1-i][1])return '(' + f1(i + k + 1, j);\n\t\tif (dp[i][k][3] && dp[i + k + 1][j - k - 1-i][1])return f3(i, i + k) + \" \" + f1(i + k + 1, j);\n\t}\n\treturn \"\";\n}\nstring f4(int i, int j) {\n\trep(k, j - i) {\n\t\tif (dp[i][k][3] && dp[i + k + 1][j - k - 1-i][2])return f3(i, i + k) + \" \";\n\t}\n}\nint main() {\n\tint n;\n\tcin >> n;\n\tstring tmp;\n\tgetline(cin, tmp);\n\twhile (n--) {\n\t\tstring s;\n\t\tgetline(cin, s);\n\t\tt.clear();\n\t\trep(i, s.size()) {\n\t\t\tif (s[i] >= 'A'&&s[i] <= 'Z') {\n\t\t\t\ttmp = \"\";\n\t\t\t\twhile (s[i] >= 'A'&&s[i] <= 'Z')tmp += s[i++];\n\t\t\t\tt.push_back(tmp);\n\t\t\t}\n\t\t\tif (s[i] == 'l'&&s[i + 1] == 'i')t.push_back(\"l\");\n\t\t\tif (s[i] == 'a'&&s[i + 1] == 'n')t.push_back(\"a\");\n\t\t}\n\t\tfill(dp[0][0], dp[340][0], 0);\n\t\trep(i, t.size())dp[i][0][(t[i] == \"l\" ? 0 : t[i] == \"a\" ? 2 : 1)] = 1;\n\t\trep1(i, t.size() - 1) {\n\t\t\trep(j, t.size() - i) {\n\t\t\t\trep(k, i) {\n\t\t\t\t\tdp[j][i][1] = min(dp[j][i][1] + dp[j][k][4] * dp[j + k + 1][i - k - 1][1] + dp[j][k][0] * dp[j + k + 1][i - k - 1][1], 20000);\n\t\t\t\t\tdp[j][i][4] = min(dp[j][i][4] + dp[j][k][3] * dp[j + k + 1][i - k - 1][2], 20000);\n\t\t\t\t\tdp[j][i][3] = min(dp[j][i][3] + dp[j][k][0] * dp[j + k + 1][i - k - 1][1] + dp[j][k][3] * dp[j+k+1][i - k - 1][1], 20000);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dp[0][t.size() - 1][1] == 1) {\n\t\t\tcout << f1(0, t.size() - 1) << endl;\n\t\t}\n\t\telse cout << \"AMBIGUOUS\" << endl;\n\t}\n}","accuracy":1,"time_ms":1990,"memory_kb":5344,"score_of_the_acc":-0.3563,"final_rank":3},{"submission_id":"aoj_2067_1464103","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nusing namespace std;\n\ntypedef pair<int,int> ii;\n\nconst string FAIL = \"AMBIGUOUS\";\nint dp[1000][1000][6]; // dp[][][0] -> the number of L, dp[][][1] -> A, dp[][][2] -> T, dp[][][3] -> S, dp[][][4] -> P, dp[][][5] -> Q\nint path[1000][1000][6]; // 2??\\????????´???????????????????????????????????????????????????????????????AMBIGUOUS????????????????????????\nint topv[1000][1000][6];\nint rigv[1000][1000][6];\n\n/*\n ????§??¨???? S\n L ::= \"list\"\n A ::= \"and\"\n T ::= \"A\" | \"B\" | ... | \"Z\"\n S ::= L E | L P\n E ::= T | S\n P ::= E A E | E P\n \n -> Chomsky Normal Form\n L ::= \"list\"\n A ::= \"and\"\n T ::= \"A\" | \"B\" | ... | \"Z\" <- ??¬??\\??§????????°?????\\???????????????????????????????????????????????????????????\\??????????????????????????§?????????????????????\n S ::= L P | L T | L S\n P ::= T P | S P | T Q | S Q\n Q ::= A T | A S \n \n */\n\nvector<string> alphas;\nvector<char> lexer(string context){\n vector<char> vec;\n rep(i,(int)context.size()) if( context[i] == ',' ) context[i] = ' ';\n stringstream ss;\n ss << context;\n string token;\n while( !( ss >> token ).fail() ){\n if( token == \"a\" || token[0] == 'o' ) continue;\n alphas.push_back(\"$\");\n if( token[0] == 'l' ) vec.push_back('L'); // List\n else if( token[0] == 'a' ) vec.push_back('A'); // And\n else {\n vec.push_back('T'); // Terminal\n alphas.back() = token;\n }\n }\n return vec;\n}\n\ninline int getType(char c) { \n return ( c == 'L' ) ? 0 : ( ( c == 'A' ) ? 1 : ( ( 'A' <= c && c <= 'Z' ) ? 2 : ( ( c == 'S' ) ? 3 : ( ( c == 'P' ) ? 4 : 5 ) ) ) );\n}\n\ninline int reduce(int a,int b) {\n if( a == 0 && b == 4 ) return 3; // S ::= L P\n if( a == 0 && b == 2 ) return 3; // S ::= L T\n if( a == 0 && b == 3 ) return 3; // S ::= L S\n if( a == 2 && b == 4 ) return 4; // P ::= T P\n if( a == 3 && b == 4 ) return 4; // P ::= S P\n if( a == 2 && b == 5 ) return 4; // P ::= T Q\n if( a == 3 && b == 5 ) return 4; // P ::= S Q\n if( a == 1 && b == 2 ) return 5; // Q ::= A T\n if( a == 1 && b == 3 ) return 5; // Q ::= A S\n return -1;\n}\n\nvoid dfs(int L,int R,int type,vector<ii> &buf){\n if( L == R ) return;\n if( type == 3 ) buf.push_back(ii(L,R));\n dfs(L,path[L][R][type],topv[L][R][type],buf);\n dfs(path[L][R][type]+1,R,rigv[L][R][type],buf);\n}\n\nconst int LIMIT = 100;\nvoid compute(string context){\n alphas.clear();\n vector<char> tokens = lexer(context);\n int n = tokens.size();\n rep(i,n) rep(j,n) rep(k,6) dp[i][j][k] = 0;\n rep(i,n) dp[i][i][getType(tokens[i])] = 1;\n for(int l=1;l<n;l++){\n for(int i=0;i+l<n;i++){\n int j = i + l;\n for(int k=i;k<j;k++){\n\t//dp[i][j] = dp[i][k] + dp[k+1][j]\n\trep(tpv,6) if( dp[i][k][tpv] ) {\n\t rep(riv,6) if( dp[k+1][j][riv] ) {\n\t int response = reduce(tpv,riv);\n\t if( response == -1 ) continue; // no such rule\n\t dp[i][j][response] += dp[i][k][tpv] * dp[k+1][j][riv];\n\t dp[i][j][response] = min(dp[i][j][response],LIMIT);\n\t path[i][j][response] = k;\n\t topv[i][j][response] = tpv;\n\t rigv[i][j][response] = riv;\n\t }\n\t}\n }\n }\n }\n \n assert( dp[0][n-1][3] >= 0LL );\n if( dp[0][n-1][3] > 1LL ) puts(FAIL.c_str());\n else {\n vector<ii> buf;\n dfs(0,n-1,3,buf);\n string answer = \"\";\n vector<int> pR(n,0),pL(n,0);\n rep(i,(int)buf.size()) ++pR[buf[i].second], ++pL[buf[i].first];\n rep(i,(int)alphas.size()) {\n answer += string(pL[i],'(');\n if( alphas[i] != \"$\" ) answer += \"!\"+alphas[i]+\"?\";\n answer += string(pR[i],')');\n }\n string new_answer = \"\";\n int p = 0;\n rep(i,(int)answer.size()) {\n if( answer[i] == '(' ) ++p;\n if( answer[i] == ')' ) --p;\n new_answer += answer[i];\n if( answer[i] == ')' || answer[i] == '?' ) {\n\tif( i+1 < (int)answer.size() && answer[i+1] == ')' ) continue;\n\tnew_answer += \" \";\n }\n }\n string new_answer3 = \"\";\n rep(i,(int)new_answer.size()-1) {\n if( new_answer[i] == '!' || new_answer[i] == '?' ) continue;\n if( i+1 < (int)new_answer.size() && new_answer[i] == '(' && new_answer[i+1] == ' ' ) continue;\n if( i+1 < (int)new_answer.size() && new_answer[i] == ' ' && new_answer[i+1] == ')' ) continue;\n new_answer3 += new_answer[i];\n }\n cout << new_answer3 << endl;\n }\n}\n\nint main(){\n /*\n int n = 5;\n for(int l=1;l<n;l++){\n for(int i=0;i+l<n;i++){\n int j = i + l;\n for(int k=i;k<j;k++){\n\t//dp[i][j] = dp[i][k] + dp[k+1][j]\n\t cout << \"[\" << i << \",\" << j << \"] = [\" << i << \"][\" << k << \"][\" << k+1 << \"][\" << j << \"]\" << endl;\n }\n }\n }\n cout << \"final => [\" << 0 << \",\" << n-1 << \"]\" << endl;\n return 0;\n */\n int T;\n cin >> T;\n cin.ignore();\n while( T-- ) {\n string context;\n getline(cin,context);\n compute(context);\n }\n return 0;\n}","accuracy":1,"time_ms":3840,"memory_kb":39100,"score_of_the_acc":-1.5797,"final_rank":8},{"submission_id":"aoj_2067_605267","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <deque>\n#include <string>\n#include <algorithm>\n#include <cctype>\n#include <cstring>\nusing namespace std;\n\nint tbl[6][6] = {\n\t{-1, 1, 1, -1, -1, -1},\n\t{-1, -1, -1, -1, -1, -1},\n\t{-1, -1, -1, -1, -1, -1},\n\t{0, 0, -1, -1, -1, 0},\n\t{2, -1, -1, -1, -1, 2},\n\t{-1, 1, 1, -1, -1, -1},\n};\n\nint cnt[500][500][6];\nint dat[500][500][6];\nint lft[500][500][6];\nint rgt[500][500][6];\nvector<string> name;\n\n\nvoid tostr(int i, int j, int t, bool space, string &res){\n\tif(cnt[i][j][t] != 1){ throw 0; }\n\n\tint k = dat[i][j][t];\n\tint x = lft[i][j][t];\n\tint y = rgt[i][j][t];\n\n\tif(t == 0){\n\t\ttostr(i, k, x, false, res);\n\t\tif(space){ res += ' '; }\n\t\tres += '(';\n\t\ttostr(k, j, y, false, res);\n\t\tres += ')';\n\t}\n\telse if(t == 1 || t == 2){\n\t\ttostr(i, k, x, space, res);\n\t\ttostr(k, j, y, true, res);\n\t}\n\telse if(t == 5){\n\t\tif(space){ res += ' '; }\n\t\tres += name[k];\n\t}\n}\n\n\nstring solve(const string &s){\n\tmemset(cnt, 0, sizeof cnt);\n\tname.clear();\n\n\tint n = 0;\n\tchar buf[32] = {};\n\tfor(int i = 0; i < s.size(); ++i){\n\t\tif(s[i] == 'l'){\n\t\t\tcnt[n][n+1][3] = 1;\n\t\t\t++n;\n\t\t}\n\t\telse if(s[i] == 'n'){\n\t\t\tcnt[n][n+1][4] = 1;\n\t\t\t++n;\n\t\t}\n\t\telse if(isupper(s[i])){\n\t\t\tsscanf(s.c_str() + i, \"%[A-Z]\", buf);\n\t\t\tcnt[n][n+1][5] = 1;\n\t\t\tdat[n][n+1][5] = name.size();\n\t\t\tname.push_back(buf);\n\t\t\ti += name.back().size() - 1;\n\t\t\t++n;\n\t\t}\n\t}\n\n\tfor(int len = 2; len <= n; ++len){\n\t\tfor(int i = 0; i + len <= n; ++i){\n\t\t\tint j = i + len;\n\t\t\tfor(int k = i; k < i + len; ++k){\n\t\t\t\tfor(int x = 0; x < 6; ++x){\n\t\t\t\t\tif(cnt[i][k][x] == 0){ continue; }\n\t\t\t\t\tfor(int y = 0; y < 6; ++y){\n\t\t\t\t\t\tint t = tbl[x][y];\n\t\t\t\t\t\tif(cnt[k][j][y] == 0 || t == -1){ continue; }\n\t\t\t\t\t\tif(++cnt[i][j][t] == 1){\n\t\t\t\t\t\t\tdat[i][j][t] = k;\n\t\t\t\t\t\t\tlft[i][j][t] = x;\n\t\t\t\t\t\t\trgt[i][j][t] = y;\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\tif(cnt[0][n][0] == 1){\n\t\ttry{\n\t\t\tstring ans;\n\t\t\ttostr(0, n, 0, false, ans);\n\t\t\treturn ans;\n\t\t}catch(...){}\n\t}\n\n\treturn \"AMBIGUOUS\";\n}\n\n\nint main(){\n\tname.reserve(500);\n\n\tint n;\n\tcin >> n;\n\tcin.get();\n\tstring s;\n\tfor(int i = 0; i < n; ++i){\n\t\tgetline(cin, s);\n\t\tcout << solve(s) << '\\n';\n\t}\n}","accuracy":1,"time_ms":3320,"memory_kb":24416,"score_of_the_acc":-1.0934,"final_rank":5},{"submission_id":"aoj_2067_604448","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 replace(string& s, const string& from, const string& to){\n string::size_type pos = s.find(from);\n while(pos != string::npos){\n s.replace(pos, from.size(), to);\n pos = s.find(from, pos + to.size());\n }\n}\nstruct Result{\n string value;\n int p;\n Result(string s, int p) : value(s), p(p){}\n};\nmap<int, vector<Result> > memo[1000];\nbool used[1000];\nmap<int, vector<Result> > expr(const string& s, int p){\n int P = p; \n assert(P >= 0 && P < 1000);\n if(used[P]) return memo[P];\n assert(s[p] == '[');\n p++;\n queue<Result> que;\n map<int, vector<Result> >& res = memo[P];\n vector<int> cnt(s.size() + 1);\n if(isupper(s[p])){\n string word;\n while(isupper(s[p])) word += s[p++];\n Result r(\"(\" + word, p);\n que.push(r);\n res[r.p].push_back(Result(r.value + \")\", r.p));\n }else{\n map<int, vector<Result> > rvm = expr(s, p);\n FORIT(it_, rvm)FORIT(it, it_->second){\n que.push(Result(\"(\" + it->value, it->p));\n res[it->p].push_back(Result(\"(\" + it->value + \")\", it->p));\n }\n }\n while(!que.empty()){\n Result r = que.front(); que.pop();\n if(s[r.p] == ','){\n if(s[r.p + 1] == '['){\n map<int, vector<Result> > rvm = expr(s, r.p + 1);\n FORIT(it_, rvm) FORIT(it, it_->second) if(cnt[it->p] < 2){\n cnt[it->p]++;\n que.push(Result(r.value + \" \" + it->value, it->p));\n }\n }else if(isupper(s[r.p + 1])){\n string word;\n while(isupper(s[r.p + 1])) word += s[++r.p];\n if(cnt[r.p + 1] < 2){\n cnt[r.p + 1]++;\n que.push(Result(r.value + \" \" + word, r.p + 1));\n }\n }else{\n assert(false);\n }\n }else if(s[r.p] == '&'){\n if(s[r.p + 1] == '['){\n map<int, vector<Result> > rvm = expr(s, r.p + 1);\n FORIT(it_, rvm) FORIT(it, (it_->second)) if(res[it->p].size() < 2){\n res[it->p].push_back(Result(r.value + \" \" + it->value + \")\", it->p));\n }\n }else if(isupper(s[r.p + 1])){\n string word;\n while(isupper(s[r.p + 1])) word += s[++r.p];\n if(res[r.p + 1].size() < 2){\n res[r.p + 1].push_back(Result(r.value + \" \" + word + \")\", r.p + 1));\n }\n }else{\n assert(false);\n }\n }else {\n assert(r.p == (int)s.size());\n }\n }\n used[P] = true;\n return res;\n}\nint main(){\n int N;\n cin >> N;\n cin.ignore();\n while(N--){\n string s;\n REP(i, 1000) memo[i].clear();\n REP(i, 1000) used[i] = false;\n getline(cin, s);\n replace(s, \"a list of\", \"[\");\n replace(s, \"and\", \"&\");\n replace(s, \" \", \"\");\n map<int, vector<Result> > rvm = expr(s, 0);\n if(rvm[s.size()].size() == 1){\n cout << rvm[s.size()][0].value << endl;\n }else if(rvm[s.size()].size() > 1){\n cout << \"AMBIGUOUS\" << endl;\n }else{\n cout << \"NULL\"<<endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":240,"memory_kb":2628,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2067_604446","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 replace(string& s, const string& from, const string& to){\n string::size_type pos = s.find(from);\n while(pos != string::npos){\n s.replace(pos, from.size(), to);\n pos = s.find(from, pos + to.size());\n }\n}\nstruct Result{\n string value;\n int p;\n Result(string s, int p) : value(s), p(p){}\n};\nmap<int, vector<Result> > memo[1000];\nbool used[1000];\nmap<int, vector<Result> > expr(const string& s, int p){\n int P = p; \n assert(P >= 0 && P < 1000);\n if(used[P]) return memo[P];\n //printf(\"expr %d %s\\n\", p, (s.substr(0, p) + \"*\" + s.substr(p + 1)).c_str());\n assert(s[p] == '[');\n p++;\n queue<Result> que;\n map<int, vector<Result> >& res = memo[P];\n vector<int> cnt(s.size() + 1);\n if(isupper(s[p])){\n string word;\n while(isupper(s[p])) word += s[p++];\n Result r(\"(\" + word, p);\n que.push(r);\n //printf(\"\\t(expr %d) push_back R(%s, %d)\\n\", P, (r.value + \")\").c_str(), r.p);\n res[r.p].push_back(Result(r.value + \")\", r.p));\n }else{\n //printf(\"\\t(expr %d) call1 expr %d\\n\", P, p);\n map<int, vector<Result> > rvm = expr(s, p);\n FORIT(it_, rvm)FORIT(it, it_->second){\n que.push(Result(\"(\" + it->value, it->p));\n //printf(\"\\t(expr %d) push_back R(%s, %d)\\n\", P, (\"(\" + it->value + \")\").c_str(), it->p);\n res[it->p].push_back(Result(\"(\" + it->value + \")\", it->p));\n }\n }\n while(!que.empty()){\n Result r = que.front(); que.pop();\n //printf(\"\\tque R(%s, %d)\\n\", r.value.c_str(), r.p);\n if(s[r.p] == ','){\n if(s[r.p + 1] == '['){\n //printf(\"\\t(expr %d) call2 expr %d\\n\", P, r.p + 1);\n map<int, vector<Result> > rvm = expr(s, r.p + 1);\n FORIT(it_, rvm) FORIT(it, it_->second) if(cnt[it->p] < 2){\n cnt[it->p]++;\n que.push(Result(r.value + \" \" + it->value, it->p));\n //res[it->p].push_back(Result(r.value + \" \" + it->value + \")\", it->p));\n }\n }else if(isupper(s[r.p + 1])){\n string word;\n while(isupper(s[r.p + 1])) word += s[++r.p];\n if(cnt[r.p + 1] < 2){\n cnt[r.p + 1]++;\n que.push(Result(r.value + \" \" + word, r.p + 1));\n //res[r.p + 1].push_back(Result(r.value + \" \" + word + \")\", r.p + 1));\n }\n }else{\n assert(false);\n }\n }else if(s[r.p] == '&'){\n if(s[r.p + 1] == '['){\n //printf(\"\\tcall3 expr %d\\n\", r.p + 1);\n map<int, vector<Result> > rvm = expr(s, r.p + 1);\n FORIT(it_, rvm) FORIT(it, (it_->second)) if(res[it->p].size() < 2){\n res[it->p].push_back(Result(r.value + \" \" + it->value + \")\", it->p));\n //printf(\"\\t(expr %d) push_back R(%s, %d)\\n\", P, (\"(\" + it->value + \")\").c_str(), it->p);\n }\n }else if(isupper(s[r.p + 1])){\n string word;\n while(isupper(s[r.p + 1])) word += s[++r.p];\n if(res[r.p + 1].size() < 2){\n res[r.p + 1].push_back(Result(r.value + \" \" + word + \")\", r.p + 1));\n //printf(\"\\t(expr %d) push_back R(%s, %d)\\n\", P, (r.value + \" \" + word + \")\").c_str(), r.p + 1);\n }\n }else{\n assert(false);\n }\n }else {\n assert(r.p == (int)s.size());\n }\n }\n used[P] = true;\n //printf(\"(expr %d) return\\n\", P);\n return res;\n}\nint main(){\n int N;\n cin >> N;\n cin.ignore();\n while(N--){\n string s;\n REP(i, 1000) memo[i].clear();\n REP(i, 1000) used[i] = false;\n getline(cin, s);\n //cout << \"#\" << s << endl;\n replace(s, \"a list of\", \"[\");\n replace(s, \"and\", \"&\");\n replace(s, \" \", \"\");\n map<int, vector<Result> > rvm = expr(s, 0);\n if(rvm[s.size()].size() == 1){\n cout << rvm[s.size()][0].value << endl;\n }else if(rvm[s.size()].size() > 1){\n cout << \"AMBIGUOUS\" << endl;\n }else{\n cout << \"NULL\"<<endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":240,"memory_kb":2628,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2067_10313005\",\n \"code_snippet\": \"// AOJ #2067 Reading Brackets in English\\n// 2025.3.20\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct Ans {\\n bool valid, amb;\\n string s;\\n};\\n\\nAns mergeAns(const Ans &a, const Ans &b) {\\n if(!a.valid) return b;\\n if(!b.valid) return a;\\n Ans ret;\\n ret.valid = true;\\n if(a.amb || b.amb || a.s != b.s) ret.amb = true;\\n else {\\n ret.amb = false;\\n ret.s = a.s;\\n }\\n return ret;\\n}\\n\\ntypedef unordered_map<int, Ans> MapAns;\\n\\nvoid unionMap(MapAns &dest, const MapAns &src) {\\n for(auto &pr : src) {\\n int pos = pr.first;\\n if(dest.find(pos) == dest.end()) dest[pos] = pr.second;\\n else dest[pos] = mergeAns(dest[pos], pr.second);\\n }\\n}\\n\\nvector<string> T;\\n\\nunordered_map<int, MapAns> memoS, memoE, memoL, memoList;\\n\\nMapAns parseS(int);\\nMapAns parseE(int);\\nMapAns parseL(int);\\nMapAns parseList(int);\\n\\nMapAns parseS(int i) {\\n if(memoS.count(i)) return memoS[i];\\n MapAns res;\\n if(i+3 <= (int)T.size() && T[i]==\\\"a\\\" && T[i+1]==\\\"list\\\" && T[i+2]==\\\"of\\\") {\\n MapAns mL = parseL(i+3);\\n for(auto &pr : mL) {\\n int pos = pr.first;\\n Ans an;\\n an.valid = pr.second.valid;\\n an.amb = pr.second.amb;\\n an.s = \\\"(\\\" + pr.second.s + \\\")\\\";\\n res[pos] = an;\\n }\\n }\\n memoS[i] = res;\\n return res;\\n}\\n\\nMapAns parseE(int i) {\\n if(memoE.count(i)) return memoE[i];\\n MapAns res;\\n MapAns mS = parseS(i);\\n unionMap(res, mS);\\n if(i+1 <= (int)T.size()) {\\n string tok = T[i];\\n bool isAtom = true;\\n for(char c : tok) {\\n if(!isupper(c)) { isAtom = false; break; }\\n }\\n if(isAtom) {\\n Ans an;\\n an.valid = true;\\n an.amb = false;\\n an.s = tok;\\n res[i+1] = an;\\n }\\n }\\n memoE[i] = res;\\n return res;\\n}\\n\\nMapAns parseList(int i) {\\n if(memoList.count(i)) return memoList[i];\\n MapAns res;\\n MapAns mE = parseE(i);\\n for(auto &pr : mE) {\\n int pos = pr.first;\\n res[pos] = mergeAns(res[pos], pr.second);\\n if(pos < (int)T.size() && T[pos] == \\\",\\\") {\\n MapAns mList = parseList(pos+1);\\n for(auto &pr2 : mList) {\\n int pos2 = pr2.first;\\n Ans an;\\n if(pr.second.valid && pr2.second.valid) {\\n an.valid = true;\\n string cand = pr.second.s + \\\" \\\" + pr2.second.s;\\n an.amb = pr.second.amb || pr2.second.amb;\\n an.s = cand;\\n } else an.valid = false;\\n res[pos2] = mergeAns(res[pos2], an);\\n }\\n }\\n }\\n memoList[i] = res;\\n return res;\\n}\\n\\nMapAns parseL(int i) {\\n if(memoL.count(i)) return memoL[i];\\n MapAns res;\\n MapAns mE = parseE(i);\\n unionMap(res, mE);\\n MapAns mList = parseList(i);\\n for(auto &pr : mList) {\\n int pos = pr.first;\\n if(pos < (int)T.size() && T[pos]==\\\"and\\\") {\\n MapAns mE2 = parseE(pos+1);\\n for(auto &pr2 : mE2) {\\n int pos2 = pr2.first;\\n Ans an;\\n if(pr.second.valid && pr2.second.valid) {\\n an.valid = true;\\n string cand = pr.second.s + \\\" \\\" + pr2.second.s;\\n an.s = cand;\\n an.amb = pr.second.amb || pr2.second.amb;\\n } else an.valid = false;\\n res[pos2] = mergeAns(res[pos2], an);\\n }\\n }\\n }\\n memoL[i] = res;\\n return res;\\n}\\n\\nvector<string> tokenize(const string &s) {\\n vector<string> ret;\\n istringstream iss(s);\\n string token;\\n while(iss >> token) {\\n while(!token.empty() && token.back()==','){\\n token.pop_back();\\n ret.push_back(token);\\n ret.push_back(\\\",\\\");\\n token = \\\"\\\";\\n }\\n if(!token.empty()) ret.push_back(token);\\n }\\n return ret;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n\\n int N; cin >> N;\\n cin.ignore();\\n for(int tc=0; tc<N; tc++){\\n string line;\\n getline(cin, line);\\n T = tokenize(line);\\n memoS.clear(); memoE.clear(); memoL.clear(); memoList.clear();\\n MapAns mS = parseS(0);\\n Ans finalAns; finalAns.valid = false;\\n for(auto &pr : mS) {\\n if(pr.first == (int)T.size() && pr.second.valid) {\\n finalAns = mergeAns(finalAns, pr.second);\\n }\\n }\\n if(finalAns.valid && !finalAns.amb) cout << finalAns.s << endl;\\n else cout << \\\"AMBIGUOUS\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 19940,\n \"score_of_the_acc\": -0.4811,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2067_3037167\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cctype>\\n#include <cassert>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <functional>\\n\\nvoid preprocess(const std::string &s, std::vector<std::string> &t) {\\n t.clear();\\n for (size_t i=0; i<s.length(); ++i) {\\n if (s[i] == 'a') {\\n if (s[i+1] == ' ') {\\n // \\\"a list of \\\"\\n t.push_back(\\\"(\\\");\\n i += 9;\\n } else if (s[i+1] == 'n') {\\n // \\\"and \\\"\\n t.push_back(\\\"&\\\");\\n i += 3;\\n } else {\\n assert(false);\\n }\\n continue;\\n }\\n\\n std::string word(1, s[i]);\\n while (++i < s.length() && isupper(s[i]))\\n word += s[i];\\n\\n t.push_back(word);\\n if (i < s.length() && s[i] == ',') {\\n ++i;\\n }\\n }\\n}\\n\\nvoid debug(const std::vector<std::string> &s) {\\n fprintf(stderr, \\\"> \\\");\\n for (size_t i=0; i<s.size(); ++i)\\n fprintf(stderr, \\\"%s%c\\\", s[i].c_str(), i+1<s.size()? ' ':'\\\\n');\\n}\\n\\nstd::string cyk(const std::vector<std::string> &s) {\\n /*\\n S-Expr -> \\\"(\\\" Element\\n | \\\"(\\\" Elements\\n Element -> Upper\\n | S-Expr\\n Elements -> Element \\\"and\\\" Element\\n | Element Elements\\n ---\\n\\n S-Expr -> \\\"(\\\" Elements\\n | \\\"(\\\" Upper\\n | \\\"(\\\" S-Expr\\n Elements -> Upper Elements\\n | Upper AndElement\\n | S-Expr Elements\\n | S-Expr AndElement\\n AndElement -> \\\"and\\\" Upper\\n | \\\"and\\\" S-Expr\\n */ \\n enum Symbol {\\n INVALID,\\n // non-terminals\\n S_EXPR, ELEMS, AND_ELEM,\\n // terminals\\n PAREN=9, AND, UPPER,\\n };\\n std::vector<std::string> types={\\n \\\"0\\\", \\\"S-expr\\\", \\\"Elems\\\", \\\"AndElem\\\",\\n \\\"0\\\", \\\"0\\\", \\\"0\\\", \\\"0\\\", \\\"0\\\", \\\"\\\\\\\"(\\\\\\\"\\\", \\\"\\\\\\\"and\\\\\\\"\\\", \\\"[A-Z]+\\\"\\n };\\n \\n auto category=[](const std::string &token) {\\n if (token == \\\"(\\\") return PAREN;\\n if (token == \\\"&\\\") return AND;\\n if (isupper(token[0])) return UPPER;\\n return INVALID;\\n };\\n\\n std::vector<Symbol> term={PAREN, AND, UPPER};\\n std::vector<std::vector<Symbol>> prod={\\n {S_EXPR, PAREN, ELEMS},\\n {S_EXPR, PAREN, UPPER},\\n {S_EXPR, PAREN, S_EXPR},\\n {ELEMS, UPPER, ELEMS},\\n {ELEMS, UPPER, AND_ELEM},\\n {ELEMS, S_EXPR, ELEMS},\\n {ELEMS, S_EXPR, AND_ELEM},\\n {AND_ELEM, AND, UPPER},\\n {AND_ELEM, AND, S_EXPR},\\n };\\n\\n std::vector<std::vector<std::vector<int>>> dp(\\n s.size(), std::vector<std::vector<int>>(\\n s.size(), std::vector<int>(prod.size()+term.size())));\\n\\n for (size_t i=0; i<s.size(); ++i) {\\n Symbol cat=category(s[i]);\\n if (cat != INVALID) {\\n dp[0][i][cat] = 1;\\n }\\n }\\n\\n struct Left {\\n size_t length, pos;\\n Symbol symb;\\n Left(size_t i, size_t j, Symbol a): length(i), pos(j), symb(a) {}\\n bool operator <(const Left &oth) const {\\n if (length != oth.length) return length < oth.length;\\n if (pos != oth.pos) return pos < oth.pos;\\n return symb < oth.symb;\\n }\\n };\\n\\n struct Right {\\n size_t part;\\n Symbol symb1, symb2;\\n Right(size_t k, Symbol b, Symbol c): part(k), symb1(b), symb2(c) {}\\n };\\n\\n std::map<Left, Right> via;\\n size_t n=s.size();\\n for (size_t i=1; i<n; ++i) {\\n for (size_t j=0; j<n-i; ++j) {\\n for (size_t k=1; k<=i; ++k) {\\n for (const auto &pp: prod) {\\n Symbol a=pp[0], b=pp[1], c=pp[2];\\n if (dp[k-1][j][b] && dp[i-k][j+k][c]) {\\n dp[i][j][a] += std::max(dp[k-1][j][b], dp[i-k][j+k][c]);\\n if (dp[i][j][a] > 2) dp[i][j][a] = 2;\\n via.emplace(Left(i, j, a), Right(k, b, c));\\n }\\n }\\n }\\n }\\n }\\n if (dp[n-1][0][1] > 1) return \\\"AMBIGUOUS\\\";\\n\\n assert(dp[n-1][0][1]);\\n std::function<std::string (Left)> dfs=[&](const Left &left) {\\n if (left.length == 0) return s[left.pos];\\n Right right=via.at(left);\\n size_t i=left.length, j=left.pos, k=right.part;\\n Symbol a=left.symb, b=right.symb1, c=right.symb2;\\n\\n std::string sb=dfs(Left(k-1, j, b)), sc=dfs(Left(i-k, j+k, c));\\n\\n if (a == S_EXPR) {\\n return sb + sc + \\\")\\\";\\n } else if (a == ELEMS) {\\n return sb + \\\" \\\" + sc;\\n } else if (a == AND_ELEM) {\\n assert(sb == \\\"&\\\");\\n return sc;\\n } else {\\n assert(false);\\n }\\n };\\n return dfs(Left(n-1, 0, S_EXPR));\\n}\\n\\nvoid solve_testcase() {\\n char buf[1024];\\n scanf(\\\"\\\\n%[^\\\\n]\\\", buf);\\n std::string s=buf;\\n std::vector<std::string> t;\\n preprocess(s, t);\\n printf(\\\"%s\\\\n\\\", cyk(t).c_str());\\n}\\n\\nint main() {\\n int N;\\n scanf(\\\"%d\\\", &N);\\n for (int i=0; i<N; ++i)\\n solve_testcase();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6450,\n \"memory_kb\": 12072,\n \"score_of_the_acc\": -1.2589,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2067_2131263\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define pb push_back\\n#define vi vector<int>\\n#define vvi vector<vi>\\n#define va vector<array<int,6>>\\n#define vva vector<va>\\n\\nvector<string> toVs(string s){\\n\\tvector<string> ret;\\n\\tstring buf = \\\"\\\";\\n\\t\\n\\trep(i,s.size()){\\n\\t\\tif(i+9<=s.size()&&s.substr(i,9)==\\\"a list of\\\"){\\n\\t\\t\\tbuf+=\\\"<\\\";\\n\\t\\t\\ti+=8;\\n\\t\\t}\\n\\t\\telse if(i+3<=s.size()&&s.substr(i,3)==\\\"and\\\"){\\n\\t\\t\\tbuf+=\\\"&\\\";\\n\\t\\t\\ti+=2;\\n\\t\\t}\\n\\t\\telse if(isalpha(s[i]))buf+=s[i];\\n\\t\\telse if(s[i]==' '){\\n\\t\\t\\tret.pb(buf);\\n\\t\\t\\tbuf = \\\"\\\";\\n\\t\\t}\\n\\t}\\n\\tif(buf.size())ret.pb(buf);\\n\\treturn ret;\\n}\\n\\n\\nvector<char> toWordClass(vector<string> vs){\\n\\tvector<char> ret;\\n\\trep(i,vs.size()){\\n\\t\\tstring s = vs[i];\\n\\t\\tif(s==\\\"<\\\")ret.pb('L');\\n\\t\\telse if(s==\\\"&\\\")ret.pb('A');\\n\\t\\telse ret.pb('T');\\n\\t}\\n\\treturn ret;\\n}\\n\\n\\ndeque<string> dfs(int a,int b,int c,vector<vva> &bef,vector<string> &vs){\\n\\tif(a==b){\\n\\t\\tif(vs[a]==\\\"<\\\"||vs[a]==\\\"&\\\")return deque<string>();\\n\\t\\tdeque<string> ret;\\n\\t\\tret.push_back(vs[a]);\\n\\t\\treturn ret;\\n\\t}\\n\\t\\n\\tarray<int,3> l,r;\\n\\trep(i,3)l[i] = bef[a][b][c][i];\\n\\trep(i,3)r[i] = bef[a][b][c][i+3];\\n\\t\\n\\tdeque<string> ret,y;\\n\\tret = dfs(l[0],l[1],l[2],bef,vs);\\n\\ty = dfs(r[0],r[1],r[2],bef,vs);\\n\\t\\n\\tfor(auto &e:y){\\n\\t\\tret.push_back(e);\\n\\t}\\n\\t\\n\\tif(c==0){\\n\\t\\tret.push_front(\\\"(\\\");\\n\\t\\tret.push_back(\\\")\\\");\\n\\t}\\n\\t\\n\\treturn ret;\\n}\\n\\n\\nint main(){\\n\\tvector<pii> rule[3] = {\\n\\t\\t{pii(4,3),pii(4,0),pii(4,1)},\\t\\t\\t//S\\n\\t\\t{pii(3,2),pii(0,2),pii(3,1),pii(0,1)},\\t//P\\n\\t\\t{pii(5,3),pii(5,0)}\\t\\t\\t\\t\\t\\t//Q\\n\\t};\\n\\t\\n\\tint n;\\n\\tcin>>n;\\n\\tcin.ignore();\\n\\twhile(n--){\\n\\t\\tstring s;\\n\\t\\tgetline(cin,s);\\n\\t\\tvector<string> vs = toVs(s);\\n\\t\\tint N = vs.size();\\n\\t\\tvector<char> wc = toWordClass(vs);\\n\\t\\t\\n\\t\\tvector<vvi> dp(N,vvi(N,vi(6,0)));\\n\\t\\tvector<vva> bef(N,vva(N,va(6,array<int,6>{-1,-1,-1,-1,-1,-1})));\\n\\t\\t\\n\\t\\trep(i,N){\\n\\t\\t\\tif(wc[i]=='T')dp[i][i][3]=1;\\n\\t\\t\\tif(wc[i]=='L')dp[i][i][4]=1;\\n\\t\\t\\tif(wc[i]=='A')dp[i][i][5]=1;\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int wid = 2;wid<=N;wid++){\\n\\t\\t\\tfor(int l = 0;l<N;l++){\\n\\t\\t\\t\\tint r = l+wid-1;\\n\\t\\t\\t\\tif(r>=N)continue;\\n\\t\\t\\t\\trep(i,3){\\n\\t\\t\\t\\t\\tfor(int p = l;p<=r-1;p++){\\n\\t\\t\\t\\t\\t\\trep(j,rule[i].size()){\\n\\t\\t\\t\\t\\t\\t\\tint x,y;\\n\\t\\t\\t\\t\\t\\t\\ttie(x,y) = rule[i][j];\\n\\t\\t\\t\\t\\t\\t\\tif(dp[l][p][x]!=0 && dp[p+1][r][y]!=0){\\n\\t\\t\\t\\t\\t\\t\\t\\tdp[l][r][i]+=dp[l][p][x]*dp[p+1][r][y];\\n\\t\\t\\t\\t\\t\\t\\t\\tif(dp[l][r][i]>2)dp[l][r][i] = 2;\\n\\t\\t\\t\\t\\t\\t\\t\\tbef[l][r][i] = array<int,6>{l,p,x,p+1,r,y};\\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\\t\\n\\t\\tif(dp[0][N-1][0]>=2){\\n\\t\\t\\tcout<<\\\"AMBIGUOUS\\\"<<endl;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tassert(dp[0][N-1][0]!=0);\\n\\t\\t\\n\\t\\t\\n\\t\\tdeque<string> ans = dfs(0,N-1,0,bef,vs);\\n\\t\\t\\n\\t\\tvector<string> a;\\n\\t\\tfor(auto &e:ans)a.pb(e);\\n\\t\\t\\n\\t\\trep(i,a.size()){\\n\\t\\t\\tif(a[i]==\\\"(\\\"||(i+1<a.size()&&a[i+1]==\\\")\\\")||i==a.size()-1)cout<<a[i];\\n\\t\\t\\telse cout<<a[i]<<\\\" \\\";\\n\\t\\t}\\n\\t\\tcout<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5110,\n \"memory_kb\": 29164,\n \"score_of_the_acc\": -1.5118,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2067_2093243\",\n \"code_snippet\": \"#include <vector>\\n#include <iostream>\\n#include <utility>\\n#include <algorithm>\\n#include <string>\\n#include <deque>\\n#include <tuple>\\n#include <queue>\\n#include <functional>\\n#include <cmath>\\n#include <iomanip>\\n#include <map>\\n#include <numeric>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <complex>\\n#include <iterator>\\n#include <array>\\n#include <chrono>\\n//cin.sync_with_stdio(false);\\n//streambuf\\nusing namespace std;\\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\ntypedef pair<double, double> pdd;\\nusing vi = vector<int>;\\nusing vll = vector<ll>;\\nusing vpii = vector<pii>;\\ntemplate<class T, int s>using va = vector<array<T, s>>;\\ntemplate<class T, class T2> using umap = unordered_map<T, T2>;\\ntemplate<class T> using uset = unordered_set<T>;\\ntemplate<class T, class S> void cmin(T &a, const S&&b) { if (a > b)a = b; }\\ntemplate<class T, class S> void cmax(T &a, const S&&b) { if (a < b)a = b; }\\n#define ALL(a) a.begin(),a.end()\\n#define rep(i,a) for(int i=0;i<a;i++)\\n#define rep1(i,a) for(int i=1;i<=a;i++)\\n#define rrep(i,a) for(int i=a-1;i>=0;i--)\\n#define rrep1(i,a) for(int i=a;i;i--)\\nconst ll mod = 1000000007;\\n#ifndef INT_MAX\\nconst int INT_MAX = numeric_limits<signed>().max();\\n#endif\\ntemplate<class T>using heap = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T>using pque = priority_queue<T, vector<T>, function<T(T, T)>>;\\ntemplate <class T>\\ninline void hash_combine(size_t & seed, const T & v) {\\n\\thash<T> hasher;\\n\\tseed ^= hasher(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2);\\n}\\nnamespace std {\\n\\n\\ttemplate<typename S, typename T> struct hash<pair<S, T>> {\\n\\t\\tinline size_t operator()(const pair<S, T> & v) const {\\n\\t\\t\\tsize_t seed = 0;\\n\\t\\t\\thash_combine(seed, v.first);\\n\\t\\t\\thash_combine(seed, v.second);\\n\\t\\t\\treturn seed;\\n\\t\\t}\\n\\t};\\n\\t// Recursive template code derived from Matthieu M.\\n\\ttemplate <class Tuple, size_t Index = std::tuple_size<Tuple>::value - 1>\\n\\tstruct HashValueImpl\\n\\t{\\n\\t\\tstatic void apply(size_t& seed, Tuple const& tuple)\\n\\t\\t{\\n\\t\\t\\tHashValueImpl<Tuple, Index - 1>::apply(seed, tuple);\\n\\t\\t\\thash_combine(seed, std::get<Index>(tuple));\\n\\t\\t}\\n\\t};\\n\\n\\ttemplate <class Tuple>\\n\\tstruct HashValueImpl<Tuple, 0>\\n\\t{\\n\\t\\tstatic void apply(size_t& seed, Tuple const& tuple)\\n\\t\\t{\\n\\t\\t\\thash_combine(seed, std::get<0>(tuple));\\n\\t\\t}\\n\\t};\\n\\n\\ttemplate <typename ... TT>\\n\\tstruct hash<std::tuple<TT...>>\\n\\t{\\n\\t\\tsize_t\\n\\t\\t\\toperator()(std::tuple<TT...> const& tt) const\\n\\t\\t{\\n\\t\\t\\tsize_t seed = 0;\\n\\t\\t\\tHashValueImpl<std::tuple<TT...> >::apply(seed, tt);\\n\\t\\t\\treturn seed;\\n\\t\\t}\\n\\n\\t};\\n}\\nll pow(ll base, ll i, ll mod) {\\n\\tll a = 1;\\n\\twhile (i) {\\n\\t\\tif (i & 1) {\\n\\t\\t\\ta *= base;\\n\\t\\t\\ta %= mod;\\n\\t\\t}\\n\\t\\tbase *= base;\\n\\t\\tbase %= mod;\\n\\t\\ti /= 2;\\n\\t}\\n\\treturn a;\\n}\\nclass unionfind {\\n\\tvector<int> par, rank, size_;//????????§??????????????¢???????????????????????????rank???????????????size?????????\\npublic:\\n\\tunionfind(int n) :par(n), rank(n), size_(n, 1) {\\n\\t\\tiota(ALL(par), 0);\\n\\t}\\n\\tint find(int x) {\\n\\t\\tif (par[x] == x)return x;\\n\\t\\treturn par[x] = find(par[x]);\\n\\t}\\n\\tvoid unite(int x, int y) {\\n\\t\\tx = find(x), y = find(y);\\n\\t\\tif (x == y)return;\\n\\t\\tif (rank[x] < rank[y])swap(x, y);\\n\\t\\tpar[y] = x;\\n\\t\\tsize_[x] += size_[y];\\n\\t\\tif (rank[x] == rank[y])rank[x]++;\\n\\t}\\n\\tbool same(int x, int y) {\\n\\t\\treturn find(x) == find(y);\\n\\t}\\n\\tint size(int x) {\\n\\t\\treturn size_[find(x)];\\n\\t}\\n};\\nll gcd(ll a, ll b) {\\n\\twhile (b) {\\n\\t\\tll c = a%b;\\n\\t\\ta = b;\\n\\t\\tb = c;\\n\\t}\\n\\treturn a;\\n}\\nll lcm(ll a, ll b) {\\n\\treturn a / gcd(a, b)*b;\\n}\\nint popcnt(unsigned long long a) {\\n\\ta = (a & 0x5555555555555555) + (a >> 1 & 0x5555555555555555);\\n\\ta = (a & 0x3333333333333333) + (a >> 2 & 0x3333333333333333);\\n\\ta = (a & 0x0f0f0f0f0f0f0f0f) + (a >> 4 & 0x0f0f0f0f0f0f0f0f);\\n\\ta = (a & 0x00ff00ff00ff00ff) + (a >> 8 & 0x00ff00ff00ff00ff);\\n\\ta = (a & 0x0000ffff0000ffff) + (a >> 16 & 0x0000ffff0000ffff);\\n\\treturn (a & 0xffffffff) + (a >> 32);\\n}\\ntemplate<class T, class Func = function<T(T, T)>>\\nclass segtree {\\n\\tvector<T> obj;\\n\\tint offset;\\n\\tFunc updater;\\n\\tT e;\\n\\tint bufsize(int num) {\\n\\t\\tint i = 1;\\n\\t\\tfor (; num >i; i <<= 1);\\n\\t\\toffset = i - 1;\\n\\t\\treturn (i << 1) - 1;\\n\\t}\\n\\tT query(int a, int b, int k, int l, int r) {\\n\\t\\tif (r <= a || b <= l)return e;\\n\\t\\tif (a <= l && r <= b)return obj[k];\\n\\t\\telse return updater(query(a, b, k * 2 + 1, l, (l + r) / 2), query(a, b, k * 2 + 2, (l + r) / 2, r));\\n\\t}\\npublic:\\n\\tT query(int a, int b) {//[a,b)\\n\\t\\treturn query(a, b, 0, 0, offset + 1);\\n\\t}\\n\\tvoid updateall(int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = offset + 1;\\n\\t\\tl += offset, r += offset;\\n\\t\\tdo {\\n\\t\\t\\tl = l - 1 >> 1, r = r - 1 >> 1;\\n\\t\\t\\tfor (int i = l; i < r; i++)obj[i] = updater(obj[i * 2 + 1], obj[i * 2 + 2]);\\n\\t\\t} while (l);\\n\\t}\\n\\tvoid update(int k, T &a) {\\n\\t\\tk += offset;\\n\\t\\tobj[k] = a;\\n\\t\\twhile (k) {\\n\\t\\t\\tk = k - 1 >> 1;\\n\\t\\t\\tobj[k] = updater(obj[k * 2 + 1], obj[k * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tsegtree(int n, T e, const Func &updater_ = Func()) :obj(bufsize(n), e), e(e), updater(updater_) {}\\n\\tsegtree(vector<T> &vec, T e, const Func &updater = Func()) :obj(bufsize(vec.size()), e), e(e), updater(updater) {\\n\\t\\tcopy(vec.begin(), vec.end(), obj.begin() + offset);\\n\\t\\tupdateall();\\n\\t}\\n\\ttypename vector<T>::reference operator[](int n) {\\n\\t\\treturn obj[n + offset];\\n\\t}\\n};\\ntemplate<class T>\\nclass matrix {\\n\\tvector<vector<T>> obj;\\n\\tpair<int, int> s;\\npublic:\\n\\tmatrix(pair<int, int> size, T e = 0) :matrix(size.first, size.second, e) {}\\n\\tmatrix(int n, int m = -1, T e = 0) :obj(n, vector<T>(m == -1 ? n : m, e)), s(n, m == -1 ? n : m) {}\\n\\tstatic matrix e(int n) {\\n\\t\\tmatrix a = (n);\\n\\t\\tfor (int i = 0; i < n; i++)a[i][i] = 1;\\n\\t\\treturn a;\\n\\t}\\n\\tmatrix& operator+=(const matrix &p) {\\n\\t\\tif (s != p.s)throw runtime_error(\\\"matrix error\\\");\\n\\t\\tfor (int i = 0; i < s.first; i++)\\n\\t\\t\\tfor (int j = 0; j < s.second; j++)obj[i][j] += p.obj[i][j];\\n\\t\\treturn *this;\\n\\t}\\n\\tmatrix operator+(const matrix &p) {\\n\\t\\tmatrix res(*this);\\n\\t\\treturn res += p;\\n\\t}\\n\\tmatrix& operator-=(const matrix &p) {\\n\\t\\tif (s != p.s)throw runtime_error(\\\"matrix error\\\");\\n\\t\\tfor (int i = 0; i < s.first; i++)\\n\\t\\t\\tfor (int j = 0; j < s.second; j++)obj[i][j] -= p.obj[i][j];\\n\\t\\treturn *this;\\n\\t}\\n\\tmatrix operator-(const matrix &p) {\\n\\t\\tmatrix res(*this);\\n\\t\\treturn res -= p;\\n\\t}\\n\\tmatrix& operator*=(T p) {\\n\\t\\tfor (auto &a : obj)\\n\\t\\t\\tfor (auto &b : a)b *= p;\\n\\t\\treturn *this;\\n\\t}\\n\\tmatrix operator*(T p) {\\n\\t\\tmatrix res(*this);\\n\\t\\treturn res *= p;\\n\\t}\\n\\tmatrix operator*(const matrix &p) {\\n\\t\\tif (s.second != p.s.first)throw runtime_error(\\\"matrix error\\\");\\n\\t\\tmatrix ret(s.first, p.s.second);\\n\\t\\tfor (int i = 0; i < s.first; i++)\\n\\t\\t\\tfor (int j = 0; j < s.second; j++)\\n\\t\\t\\t\\tfor (int k = 0; k < p.s.second; k++)ret[i][k] += obj[i][j] * p.obj[j][k];\\n\\t\\treturn ret;\\n\\t}\\n\\tmatrix &operator*=(const matrix &p) {\\n\\t\\treturn *this = *this*p;\\n\\t}\\n\\tpair<int, int> size() const {\\n\\t\\treturn s;\\n\\t}\\n\\tmatrix &mod(T m) {\\n\\t\\tfor (auto &a : obj)\\n\\t\\t\\tfor (auto &b : a)b %= m;\\n\\t\\treturn *this;\\n\\t}\\n\\ttypename vector<vector<T>>::reference operator[](int t) {\\n\\t\\treturn obj[t];\\n\\t}\\n};\\ntemplate<class T> inline\\nmatrix<T> pow(matrix<T> &base, unsigned exp) {\\n\\tauto base_(base);\\n\\tif (base_.size().first != base_.size().second)throw runtime_error(\\\"matrix error\\\");\\n\\tmatrix<T> res = matrix<T>::e(base_.size().first);\\n\\tfor (;;) {\\n\\t\\tif (exp & 1)res *= base_;\\n\\t\\tif (!(exp /= 2))break;\\n\\t\\tbase_ *= base_;\\n\\t}\\n\\treturn res;\\n}\\ntemplate<class T> inline\\nmatrix<T> modpow(matrix<T> &base, unsigned exp, T m) {\\n\\tauto base_(base);\\n\\tif (base.size().first != base_.size().second)throw runtime_error(\\\"matrix error\\\");\\n\\tmatrix<T> res = matrix<T>::e(base_.size().first);\\n\\tfor (;;) {\\n\\t\\tif (exp & 1)(res *= base_).mod(m);\\n\\t\\tif (!(exp /= 2))break;\\n\\t\\t(base_ *= base_).mod(m);\\n\\t}\\n\\treturn res;\\n}\\ntemplate<class T>int id(vector<T> &a, T b) {\\n\\treturn lower_bound(ALL(a), b) - a.begin();\\n}\\nclass Flow {\\n\\tint V;\\n\\tstruct edge { int to, cap, rev, cost; };\\n\\tvector<vector<edge>> G;\\n\\tvector<int> level, iter, h, dist, prevv, preve;\\n\\tFlow(int size) :G(size + 1), V(size + 1) {\\n\\t}\\n\\tvoid add_edge(int from, int to, int cap, int cost = 0) {\\n\\t\\tG[from].push_back(edge{ to, cap, (int)G[to].size(),cost });\\n\\t\\tG[to].push_back(edge{ from,0,(int)G[from].size() - 1,-cost });\\n\\t}\\n\\tvoid bfs(int s) {\\n\\t\\tfill(level.begin(), level.end(), -1);\\n\\t\\tqueue<int> que;\\n\\t\\tlevel[s] = 0;\\n\\t\\tque.push(s);\\n\\t\\twhile (!que.empty()) {\\n\\t\\t\\tint v = que.front(); que.pop();\\n\\t\\t\\tfor (int i = 0; i < G[v].size(); i++) {\\n\\t\\t\\t\\tedge &e = G[v][i];\\n\\t\\t\\t\\tif (e.cap > 0 && level[e.to] < 0) {\\n\\t\\t\\t\\t\\tlevel[e.to] = level[v] + 1;\\n\\t\\t\\t\\t\\tque.push(e.to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint dfs(int v, int t, int f) {\\n\\t\\tif (v == t)return f;\\n\\t\\tfor (int &i = iter[v]; i < G[v].size(); i++) {\\n\\t\\t\\tedge &e = G[v][i];\\n\\t\\t\\tif (e.cap > 0 && level[v] < level[e.to]) {\\n\\t\\t\\t\\tint d = dfs(e.to, t, min(f, e.cap));\\n\\t\\t\\t\\tif (d > 0) {\\n\\t\\t\\t\\t\\te.cap -= d;\\n\\t\\t\\t\\t\\tG[e.to][e.rev].cap += d;\\n\\t\\t\\t\\t\\treturn d;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\tint max_flow(int s, int t) {\\n\\t\\tlevel.resize(V);\\n\\t\\titer.resize(V);\\n\\t\\tint flow = 0;\\n\\t\\tfor (;;) {\\n\\t\\t\\tbfs(s);\\n\\t\\t\\tif (level[t] < 0)return flow;\\n\\t\\t\\tfill(iter.begin(), iter.end(), 0);\\n\\t\\t\\tint f;\\n\\t\\t\\twhile ((f = dfs(s, t, numeric_limits<int>::max()))>0) {\\n\\t\\t\\t\\tflow += f;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\ttypedef pair<int, int> P;\\n\\tint min_cost_flow(int s, int t, int f) {\\n\\t\\tint res = 0;\\n\\t\\th.resize(V);\\n\\t\\tdist.resize(V);\\n\\t\\tprevv.resize(V);\\n\\t\\tpreve.resize(V);\\n\\t\\tfill(h.begin(), h.end(), 0);\\n\\t\\twhile (f > 0) {\\n\\t\\t\\tpriority_queue<P, vector<P>, greater<P>> que;\\n\\t\\t\\tfill(dist.begin(), dist.end(), numeric_limits<int>::max());\\n\\t\\t\\tdist[s] = 0;\\n\\t\\t\\tque.push({ 0,s });\\n\\t\\t\\twhile (!que.empty()) {\\n\\t\\t\\t\\tP p = que.top(); que.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.to]>dist[v] + e.cost + h[v] - h[e.to]) {\\n\\t\\t\\t\\t\\t\\tdist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\\n\\t\\t\\t\\t\\t\\tprevv[e.to] = v;\\n\\t\\t\\t\\t\\t\\tpreve[e.to] = i;\\n\\t\\t\\t\\t\\t\\tque.push({ dist[e.to],e.to });\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (dist[t] == numeric_limits<int>::max()) {\\n\\t\\t\\t\\treturn -1;\\n\\t\\t\\t}\\n\\t\\t\\tfor (int v = 0; v < V; v++)h[v] += dist[v];\\n\\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.rev].cap += d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n};\\nconst ld eps = 1e-11, pi = acos(-1.0);\\ntypedef complex<ld> P;\\ntypedef vector<P> VP;\\nld dot(P a, P b) { return real(conj(a) * b); }\\nld cross(P a, P b) { return imag(conj(a) * b); }\\n\\nnamespace std {\\n\\tbool operator<(const P &a, const P &b) {\\n\\t\\treturn abs(a.real() - b.real()) < eps ? a.imag() < b.imag() : a.real() < b.real();\\n\\t}\\n}\\n\\nstruct L { P a, b; };//line->l,segment->s\\nstruct C { P p; ld r; };\\n\\nint ccw(P a, P b, P c) {\\n\\tb -= a; c -= a;\\n\\tif (cross(b, c) > eps) return 1; // counter clockwise\\n\\tif (cross(b, c) < -eps) return -1; // clockwise\\n\\tif (dot(b, c) < 0) return 2; // c--a--b on line\\n\\tif (norm(b) < norm(c)) return -2; // a--b--c on line\\n\\treturn 0; // a--c--b on line\\n}\\n\\nbool isis_ll(L l, L m) {//is intersect\\n\\treturn abs(cross(l.b - l.a, m.b - m.a)) > eps;\\n}\\n\\nbool isis_ls(L l, L s) {\\n\\tld a = cross(l.b - l.a, s.a - l.a);\\n\\tld b = cross(l.b - l.a, s.b - l.a);\\n\\treturn (a * b < eps);\\n}\\n\\nbool isis_lp(L l, P p) {\\n\\treturn abs(cross(l.b - p, l.a - p)) < eps;\\n}\\n\\nbool isis_ss(L s, L 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\\nP is_ll(L s, L t) { //intersect\\n\\tP sv = s.b - s.a, tv = t.b - t.a;\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n\\nbool isis_sp(L s, P p) {\\n\\treturn abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps;\\n}\\n\\nP proj(L l, P p) {\\n\\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.a - l.b);\\n}\\n\\nld dist_lp(L l, P p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\nld dist_ll(L l, L m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\nld dist_ls(L l, L s) {\\n\\tif (isis_ls(l, s)) return 0;\\n\\treturn min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\nld dist_sp(L s, P p) {\\n\\tP r = proj(s, p);\\n\\tif (isis_sp(s, r)) return abs(r - p);\\n\\treturn min(abs(s.a - p), abs(s.b - p));\\n}\\n\\nld dist_ss(L s, L t) {\\n\\tif (isis_ss(s, t)) return 0;\\n\\tld a = min(dist_sp(s, t.a), dist_sp(t, s.a));\\n\\tld b = min(dist_sp(s, t.b), dist_sp(t, s.b));\\n\\treturn min(a, b);\\n}\\n\\nVP is_cc(C c1, C c2) {\\n\\tVP 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\\tP diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * P(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * P(rc, -rs));\\n\\treturn res;\\n}\\n\\nbool isis_vc(vector<C> vc) {\\n\\tVP crs;\\n\\tint n = vc.size();\\n\\trep(i, n)rep(j, i)\\n\\t\\tfor (P p : is_cc(vc[i], vc[j]))\\n\\t\\t\\tcrs.push_back(p);\\n\\trep(i, n)\\n\\t\\tcrs.push_back(vc[i].p);\\n\\tfor (P p : crs) {\\n\\t\\tbool valid = true;\\n\\t\\trep(i, n)\\n\\t\\t\\tif (abs(p - vc[i].p)>vc[i].r + eps)\\n\\t\\t\\t\\tvalid = false;\\n\\t\\tif (valid) return true;\\n\\t}\\n\\treturn false;\\n}\\n\\nVP is_lc(C c, L l) {\\n\\tVP 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\\tP 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\\nVP is_sc(C c, L l) {\\n\\tVP v = is_lc(c, l), res;\\n\\tfor (P p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\nvector<L> tangent_cp(C c, P p) {//????????\\\\????\\n\\tvector<L> ret;\\n\\tP 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\\tP v1 = v * P(l / d, c.r / d);\\n\\tP v2 = v * P(l / d, -c.r / d);\\n\\tret.push_back(L{ p, p + v1 });\\n\\tif (l < eps) return ret;\\n\\tret.push_back(L{ p, p + v2 });\\n\\treturn ret;\\n}\\n\\nvector<L> tangent_cc(C c1, C c2) {\\n\\tvector<L> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tP 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\\tP out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<L> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), ALL(nret));\\n\\t}\\n\\telse {\\n\\t\\tP v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tP q1 = c1.p + v * P(0, 1) * c1.r;\\n\\t\\tP q2 = c1.p + v * P(0, -1) * c1.r;\\n\\t\\tret.push_back(L{ q1, q1 + v });\\n\\t\\tret.push_back(L{ q2, q2 + v });\\n\\t}\\n\\treturn ret;\\n}\\n\\nld area(const VP &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\\nbool is_polygon(L l, VP &g) {\\n\\tint n = g.size();\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tP a = g[i];\\n\\t\\tP b = g[(i + 1) % n];\\n\\t\\tif (isis_ss(l, L{ a, b })) return true;\\n\\t}\\n\\treturn false;\\n}\\n\\nint is_in_Polygon(const VP &g, P p) {\\n\\tbool in = false;\\n\\tint n = g.size();\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tP a = g[i] - p, 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))\\n\\t\\t\\tif (cross(a, b) < 0) in = !in;\\n\\t\\tif (abs(cross(a, b)) < eps && dot(a, b) < eps) return 0; // on\\n\\t}\\n\\tif (in) return 1; // in\\n\\treturn -1; // out\\n}\\n\\nVP ConvexHull(VP ps) {\\n\\tint n = ps.size();\\n\\tint k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tVP 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\\nVP ConvexCut(const VP &ps, L l) {\\n\\tVP Q;\\n\\tfor (int i = 0; i < (int)ps.size(); i++) {\\n\\t\\tP A = ps[i], B = ps[(i + 1) % ps.size()];\\n\\t\\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0)\\n\\t\\t\\tQ.push_back(is_ll(L{ A, B }, l));\\n\\t}\\n\\treturn Q;\\n}\\ndouble dist2(P a) {\\n\\treturn real(a)*real(a) + imag(a)*imag(a);\\n}\\n// Suffix Array\\t?????????O(|S|log^2|S|), ????´¢O(|T|log|S|), ?????????????§????O(|S|)\\nclass StringSearch {\\n\\tconst int n;\\n\\tstring S;\\npublic:\\n\\tvector<int> sa, rank;\\n\\tStringSearch(const string &S_) :n(S_.size()), S(S_), sa(n + 1), rank(n + 1) {\\n\\t\\tfor (int i = 0; i <= n; i++) {\\n\\t\\t\\tsa[i] = i;\\n\\t\\t\\trank[i] = i < n ? S[i] : -1;\\n\\t\\t}\\n\\t\\tvector<int> tmp(n + 1);\\n\\t\\tfor (int k = 1; k <= n; k *= 2) {\\n\\t\\t\\tauto Compare_SA = [=](int i, int j) {\\n\\t\\t\\t\\tif (this->rank[i] != this->rank[j]) return this->rank[i] < this->rank[j];\\n\\n\\t\\t\\t\\tint ri = i + k <= n ? this->rank[i + k] : -1;\\n\\t\\t\\t\\tint rj = j + k <= n ? this->rank[j + k] : -1;\\n\\t\\t\\t\\treturn ri < rj;\\n\\t\\t\\t};\\n\\t\\t\\tsort(sa.begin(), sa.end(), Compare_SA);\\n\\t\\t\\ttmp[sa[0]] = 0;\\n\\t\\t\\tfor (int i = 1; i <= n; i++) {\\n\\t\\t\\t\\ttmp[sa[i]] = tmp[sa[i - 1]] + (Compare_SA(sa[i - 1], sa[i]) ? 1 : 0);\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i = 0; i <= n; i++) {\\n\\t\\t\\t\\tthis->rank[i] = tmp[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tbool Contain(const string &T) {\\n\\t\\tint a = 0, b = n;\\n\\t\\twhile (b - a > 1) {\\n\\t\\t\\tint c = (a + b) / 2;\\n\\t\\t\\tif (S.compare(sa[c], T.length(), T) < 0) a = c;\\n\\t\\t\\telse b = c;\\n\\t\\t}\\n\\t\\treturn S.compare(sa[b], T.length(), T) == 0;\\n\\t}\\n\\tvector<int> LCPArray() {\\n\\t\\tfor (int i = 0; i <= n; i++) rank[sa[i]] = i;\\n\\t\\tint h = 0;\\n\\t\\tvector<int> lcp(n + 1);\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tint j = sa[rank[i] - 1];\\n\\t\\t\\tif (h > 0) h--;\\n\\t\\t\\tfor (; j + h < n && i + h < n; h++) {\\n\\t\\t\\t\\tif (S[j + h] != S[i + h]) break;\\n\\t\\t\\t}\\n\\t\\t\\tlcp[rank[i] - 1] = h;\\n\\t\\t}\\n\\t\\treturn lcp;\\n\\t}\\n};\\n//0l \\n//1A\\n//141\\n//101\\n//2a\\n//301\\n//331\\n//432\\nint dp[340][340][5];\\nvector<string> t;\\nstring f4(int i, int j);\\nstring f1(int i, int j) {\\n\\tif (i == j)return t[i];\\n\\trep(k, j - i) {\\n\\t\\tif (dp[i][k][4] && dp[i + k + 1][j - k - 1 - i][1])return f4(i, i + k) + f1(i + k + 1, j) + ')';\\n\\t\\tif (dp[i][k][0] && dp[i + k + 1][j - k - 1 - i][1])return '(' + f1(i + k + 1, j) + ')';\\n\\t}\\n\\treturn \\\"\\\";\\n}\\nstring f3(int i, int j) {\\n\\trep(k, j - i) {\\n\\t\\tif (dp[i][k][0] && dp[i + k + 1][j - k - 1-i][1])return '(' + f1(i + k + 1, j);\\n\\t\\tif (dp[i][k][3] && dp[i + k + 1][j - k - 1-i][1])return f3(i, i + k) + \\\" \\\" + f1(i + k + 1, j);\\n\\t}\\n\\treturn \\\"\\\";\\n}\\nstring f4(int i, int j) {\\n\\trep(k, j - i) {\\n\\t\\tif (dp[i][k][3] && dp[i + k + 1][j - k - 1-i][2])return f3(i, i + k) + \\\" \\\";\\n\\t}\\n}\\nint main() {\\n\\tint n;\\n\\tcin >> n;\\n\\tstring tmp;\\n\\tgetline(cin, tmp);\\n\\twhile (n--) {\\n\\t\\tstring s;\\n\\t\\tgetline(cin, s);\\n\\t\\tt.clear();\\n\\t\\trep(i, s.size()) {\\n\\t\\t\\tif (s[i] >= 'A'&&s[i] <= 'Z') {\\n\\t\\t\\t\\ttmp = \\\"\\\";\\n\\t\\t\\t\\twhile (s[i] >= 'A'&&s[i] <= 'Z')tmp += s[i++];\\n\\t\\t\\t\\tt.push_back(tmp);\\n\\t\\t\\t}\\n\\t\\t\\tif (s[i] == 'l'&&s[i + 1] == 'i')t.push_back(\\\"l\\\");\\n\\t\\t\\tif (s[i] == 'a'&&s[i + 1] == 'n')t.push_back(\\\"a\\\");\\n\\t\\t}\\n\\t\\tfill(dp[0][0], dp[340][0], 0);\\n\\t\\trep(i, t.size())dp[i][0][(t[i] == \\\"l\\\" ? 0 : t[i] == \\\"a\\\" ? 2 : 1)] = 1;\\n\\t\\trep1(i, t.size() - 1) {\\n\\t\\t\\trep(j, t.size() - i) {\\n\\t\\t\\t\\trep(k, i) {\\n\\t\\t\\t\\t\\tdp[j][i][1] = min(dp[j][i][1] + dp[j][k][4] * dp[j + k + 1][i - k - 1][1] + dp[j][k][0] * dp[j + k + 1][i - k - 1][1], 20000);\\n\\t\\t\\t\\t\\tdp[j][i][4] = min(dp[j][i][4] + dp[j][k][3] * dp[j + k + 1][i - k - 1][2], 20000);\\n\\t\\t\\t\\t\\tdp[j][i][3] = min(dp[j][i][3] + dp[j][k][0] * dp[j + k + 1][i - k - 1][1] + dp[j][k][3] * dp[j+k+1][i - k - 1][1], 20000);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (dp[0][t.size() - 1][1] == 1) {\\n\\t\\t\\tcout << f1(0, t.size() - 1) << endl;\\n\\t\\t}\\n\\t\\telse cout << \\\"AMBIGUOUS\\\" << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1990,\n \"memory_kb\": 5344,\n \"score_of_the_acc\": -0.3563,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2067_1464103\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nusing namespace std;\\n\\ntypedef pair<int,int> ii;\\n\\nconst string FAIL = \\\"AMBIGUOUS\\\";\\nint dp[1000][1000][6]; // dp[][][0] -> the number of L, dp[][][1] -> A, dp[][][2] -> T, dp[][][3] -> S, dp[][][4] -> P, dp[][][5] -> Q\\nint path[1000][1000][6]; // 2??\\\\????????´???????????????????????????????????????????????????????????????AMBIGUOUS????????????????????????\\nint topv[1000][1000][6];\\nint rigv[1000][1000][6];\\n\\n/*\\n ????§??¨???? S\\n L ::= \\\"list\\\"\\n A ::= \\\"and\\\"\\n T ::= \\\"A\\\" | \\\"B\\\" | ... | \\\"Z\\\"\\n S ::= L E | L P\\n E ::= T | S\\n P ::= E A E | E P\\n \\n -> Chomsky Normal Form\\n L ::= \\\"list\\\"\\n A ::= \\\"and\\\"\\n T ::= \\\"A\\\" | \\\"B\\\" | ... | \\\"Z\\\" <- ??¬??\\\\??§????????°?????\\\\???????????????????????????????????????????????????????????\\\\??????????????????????????§?????????????????????\\n S ::= L P | L T | L S\\n P ::= T P | S P | T Q | S Q\\n Q ::= A T | A S \\n \\n */\\n\\nvector<string> alphas;\\nvector<char> lexer(string context){\\n vector<char> vec;\\n rep(i,(int)context.size()) if( context[i] == ',' ) context[i] = ' ';\\n stringstream ss;\\n ss << context;\\n string token;\\n while( !( ss >> token ).fail() ){\\n if( token == \\\"a\\\" || token[0] == 'o' ) continue;\\n alphas.push_back(\\\"$\\\");\\n if( token[0] == 'l' ) vec.push_back('L'); // List\\n else if( token[0] == 'a' ) vec.push_back('A'); // And\\n else {\\n vec.push_back('T'); // Terminal\\n alphas.back() = token;\\n }\\n }\\n return vec;\\n}\\n\\ninline int getType(char c) { \\n return ( c == 'L' ) ? 0 : ( ( c == 'A' ) ? 1 : ( ( 'A' <= c && c <= 'Z' ) ? 2 : ( ( c == 'S' ) ? 3 : ( ( c == 'P' ) ? 4 : 5 ) ) ) );\\n}\\n\\ninline int reduce(int a,int b) {\\n if( a == 0 && b == 4 ) return 3; // S ::= L P\\n if( a == 0 && b == 2 ) return 3; // S ::= L T\\n if( a == 0 && b == 3 ) return 3; // S ::= L S\\n if( a == 2 && b == 4 ) return 4; // P ::= T P\\n if( a == 3 && b == 4 ) return 4; // P ::= S P\\n if( a == 2 && b == 5 ) return 4; // P ::= T Q\\n if( a == 3 && b == 5 ) return 4; // P ::= S Q\\n if( a == 1 && b == 2 ) return 5; // Q ::= A T\\n if( a == 1 && b == 3 ) return 5; // Q ::= A S\\n return -1;\\n}\\n\\nvoid dfs(int L,int R,int type,vector<ii> &buf){\\n if( L == R ) return;\\n if( type == 3 ) buf.push_back(ii(L,R));\\n dfs(L,path[L][R][type],topv[L][R][type],buf);\\n dfs(path[L][R][type]+1,R,rigv[L][R][type],buf);\\n}\\n\\nconst int LIMIT = 100;\\nvoid compute(string context){\\n alphas.clear();\\n vector<char> tokens = lexer(context);\\n int n = tokens.size();\\n rep(i,n) rep(j,n) rep(k,6) dp[i][j][k] = 0;\\n rep(i,n) dp[i][i][getType(tokens[i])] = 1;\\n for(int l=1;l<n;l++){\\n for(int i=0;i+l<n;i++){\\n int j = i + l;\\n for(int k=i;k<j;k++){\\n\\t//dp[i][j] = dp[i][k] + dp[k+1][j]\\n\\trep(tpv,6) if( dp[i][k][tpv] ) {\\n\\t rep(riv,6) if( dp[k+1][j][riv] ) {\\n\\t int response = reduce(tpv,riv);\\n\\t if( response == -1 ) continue; // no such rule\\n\\t dp[i][j][response] += dp[i][k][tpv] * dp[k+1][j][riv];\\n\\t dp[i][j][response] = min(dp[i][j][response],LIMIT);\\n\\t path[i][j][response] = k;\\n\\t topv[i][j][response] = tpv;\\n\\t rigv[i][j][response] = riv;\\n\\t }\\n\\t}\\n }\\n }\\n }\\n \\n assert( dp[0][n-1][3] >= 0LL );\\n if( dp[0][n-1][3] > 1LL ) puts(FAIL.c_str());\\n else {\\n vector<ii> buf;\\n dfs(0,n-1,3,buf);\\n string answer = \\\"\\\";\\n vector<int> pR(n,0),pL(n,0);\\n rep(i,(int)buf.size()) ++pR[buf[i].second], ++pL[buf[i].first];\\n rep(i,(int)alphas.size()) {\\n answer += string(pL[i],'(');\\n if( alphas[i] != \\\"$\\\" ) answer += \\\"!\\\"+alphas[i]+\\\"?\\\";\\n answer += string(pR[i],')');\\n }\\n string new_answer = \\\"\\\";\\n int p = 0;\\n rep(i,(int)answer.size()) {\\n if( answer[i] == '(' ) ++p;\\n if( answer[i] == ')' ) --p;\\n new_answer += answer[i];\\n if( answer[i] == ')' || answer[i] == '?' ) {\\n\\tif( i+1 < (int)answer.size() && answer[i+1] == ')' ) continue;\\n\\tnew_answer += \\\" \\\";\\n }\\n }\\n string new_answer3 = \\\"\\\";\\n rep(i,(int)new_answer.size()-1) {\\n if( new_answer[i] == '!' || new_answer[i] == '?' ) continue;\\n if( i+1 < (int)new_answer.size() && new_answer[i] == '(' && new_answer[i+1] == ' ' ) continue;\\n if( i+1 < (int)new_answer.size() && new_answer[i] == ' ' && new_answer[i+1] == ')' ) continue;\\n new_answer3 += new_answer[i];\\n }\\n cout << new_answer3 << endl;\\n }\\n}\\n\\nint main(){\\n /*\\n int n = 5;\\n for(int l=1;l<n;l++){\\n for(int i=0;i+l<n;i++){\\n int j = i + l;\\n for(int k=i;k<j;k++){\\n\\t//dp[i][j] = dp[i][k] + dp[k+1][j]\\n\\t cout << \\\"[\\\" << i << \\\",\\\" << j << \\\"] = [\\\" << i << \\\"][\\\" << k << \\\"][\\\" << k+1 << \\\"][\\\" << j << \\\"]\\\" << endl;\\n }\\n }\\n }\\n cout << \\\"final => [\\\" << 0 << \\\",\\\" << n-1 << \\\"]\\\" << endl;\\n return 0;\\n */\\n int T;\\n cin >> T;\\n cin.ignore();\\n while( T-- ) {\\n string context;\\n getline(cin,context);\\n compute(context);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3840,\n \"memory_kb\": 39100,\n \"score_of_the_acc\": -1.5797,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2067_605267\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <vector>\\n#include <deque>\\n#include <string>\\n#include <algorithm>\\n#include <cctype>\\n#include <cstring>\\nusing namespace std;\\n\\nint tbl[6][6] = {\\n\\t{-1, 1, 1, -1, -1, -1},\\n\\t{-1, -1, -1, -1, -1, -1},\\n\\t{-1, -1, -1, -1, -1, -1},\\n\\t{0, 0, -1, -1, -1, 0},\\n\\t{2, -1, -1, -1, -1, 2},\\n\\t{-1, 1, 1, -1, -1, -1},\\n};\\n\\nint cnt[500][500][6];\\nint dat[500][500][6];\\nint lft[500][500][6];\\nint rgt[500][500][6];\\nvector<string> name;\\n\\n\\nvoid tostr(int i, int j, int t, bool space, string &res){\\n\\tif(cnt[i][j][t] != 1){ throw 0; }\\n\\n\\tint k = dat[i][j][t];\\n\\tint x = lft[i][j][t];\\n\\tint y = rgt[i][j][t];\\n\\n\\tif(t == 0){\\n\\t\\ttostr(i, k, x, false, res);\\n\\t\\tif(space){ res += ' '; }\\n\\t\\tres += '(';\\n\\t\\ttostr(k, j, y, false, res);\\n\\t\\tres += ')';\\n\\t}\\n\\telse if(t == 1 || t == 2){\\n\\t\\ttostr(i, k, x, space, res);\\n\\t\\ttostr(k, j, y, true, res);\\n\\t}\\n\\telse if(t == 5){\\n\\t\\tif(space){ res += ' '; }\\n\\t\\tres += name[k];\\n\\t}\\n}\\n\\n\\nstring solve(const string &s){\\n\\tmemset(cnt, 0, sizeof cnt);\\n\\tname.clear();\\n\\n\\tint n = 0;\\n\\tchar buf[32] = {};\\n\\tfor(int i = 0; i < s.size(); ++i){\\n\\t\\tif(s[i] == 'l'){\\n\\t\\t\\tcnt[n][n+1][3] = 1;\\n\\t\\t\\t++n;\\n\\t\\t}\\n\\t\\telse if(s[i] == 'n'){\\n\\t\\t\\tcnt[n][n+1][4] = 1;\\n\\t\\t\\t++n;\\n\\t\\t}\\n\\t\\telse if(isupper(s[i])){\\n\\t\\t\\tsscanf(s.c_str() + i, \\\"%[A-Z]\\\", buf);\\n\\t\\t\\tcnt[n][n+1][5] = 1;\\n\\t\\t\\tdat[n][n+1][5] = name.size();\\n\\t\\t\\tname.push_back(buf);\\n\\t\\t\\ti += name.back().size() - 1;\\n\\t\\t\\t++n;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int len = 2; len <= n; ++len){\\n\\t\\tfor(int i = 0; i + len <= n; ++i){\\n\\t\\t\\tint j = i + len;\\n\\t\\t\\tfor(int k = i; k < i + len; ++k){\\n\\t\\t\\t\\tfor(int x = 0; x < 6; ++x){\\n\\t\\t\\t\\t\\tif(cnt[i][k][x] == 0){ continue; }\\n\\t\\t\\t\\t\\tfor(int y = 0; y < 6; ++y){\\n\\t\\t\\t\\t\\t\\tint t = tbl[x][y];\\n\\t\\t\\t\\t\\t\\tif(cnt[k][j][y] == 0 || t == -1){ continue; }\\n\\t\\t\\t\\t\\t\\tif(++cnt[i][j][t] == 1){\\n\\t\\t\\t\\t\\t\\t\\tdat[i][j][t] = k;\\n\\t\\t\\t\\t\\t\\t\\tlft[i][j][t] = x;\\n\\t\\t\\t\\t\\t\\t\\trgt[i][j][t] = y;\\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\\tif(cnt[0][n][0] == 1){\\n\\t\\ttry{\\n\\t\\t\\tstring ans;\\n\\t\\t\\ttostr(0, n, 0, false, ans);\\n\\t\\t\\treturn ans;\\n\\t\\t}catch(...){}\\n\\t}\\n\\n\\treturn \\\"AMBIGUOUS\\\";\\n}\\n\\n\\nint main(){\\n\\tname.reserve(500);\\n\\n\\tint n;\\n\\tcin >> n;\\n\\tcin.get();\\n\\tstring s;\\n\\tfor(int i = 0; i < n; ++i){\\n\\t\\tgetline(cin, s);\\n\\t\\tcout << solve(s) << '\\\\n';\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3320,\n \"memory_kb\": 24416,\n \"score_of_the_acc\": -1.0934,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2067_604448\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\\\" \\\"; cerr<<endl; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\nvoid replace(string& s, const string& from, const string& to){\\n string::size_type pos = s.find(from);\\n while(pos != string::npos){\\n s.replace(pos, from.size(), to);\\n pos = s.find(from, pos + to.size());\\n }\\n}\\nstruct Result{\\n string value;\\n int p;\\n Result(string s, int p) : value(s), p(p){}\\n};\\nmap<int, vector<Result> > memo[1000];\\nbool used[1000];\\nmap<int, vector<Result> > expr(const string& s, int p){\\n int P = p; \\n assert(P >= 0 && P < 1000);\\n if(used[P]) return memo[P];\\n assert(s[p] == '[');\\n p++;\\n queue<Result> que;\\n map<int, vector<Result> >& res = memo[P];\\n vector<int> cnt(s.size() + 1);\\n if(isupper(s[p])){\\n string word;\\n while(isupper(s[p])) word += s[p++];\\n Result r(\\\"(\\\" + word, p);\\n que.push(r);\\n res[r.p].push_back(Result(r.value + \\\")\\\", r.p));\\n }else{\\n map<int, vector<Result> > rvm = expr(s, p);\\n FORIT(it_, rvm)FORIT(it, it_->second){\\n que.push(Result(\\\"(\\\" + it->value, it->p));\\n res[it->p].push_back(Result(\\\"(\\\" + it->value + \\\")\\\", it->p));\\n }\\n }\\n while(!que.empty()){\\n Result r = que.front(); que.pop();\\n if(s[r.p] == ','){\\n if(s[r.p + 1] == '['){\\n map<int, vector<Result> > rvm = expr(s, r.p + 1);\\n FORIT(it_, rvm) FORIT(it, it_->second) if(cnt[it->p] < 2){\\n cnt[it->p]++;\\n que.push(Result(r.value + \\\" \\\" + it->value, it->p));\\n }\\n }else if(isupper(s[r.p + 1])){\\n string word;\\n while(isupper(s[r.p + 1])) word += s[++r.p];\\n if(cnt[r.p + 1] < 2){\\n cnt[r.p + 1]++;\\n que.push(Result(r.value + \\\" \\\" + word, r.p + 1));\\n }\\n }else{\\n assert(false);\\n }\\n }else if(s[r.p] == '&'){\\n if(s[r.p + 1] == '['){\\n map<int, vector<Result> > rvm = expr(s, r.p + 1);\\n FORIT(it_, rvm) FORIT(it, (it_->second)) if(res[it->p].size() < 2){\\n res[it->p].push_back(Result(r.value + \\\" \\\" + it->value + \\\")\\\", it->p));\\n }\\n }else if(isupper(s[r.p + 1])){\\n string word;\\n while(isupper(s[r.p + 1])) word += s[++r.p];\\n if(res[r.p + 1].size() < 2){\\n res[r.p + 1].push_back(Result(r.value + \\\" \\\" + word + \\\")\\\", r.p + 1));\\n }\\n }else{\\n assert(false);\\n }\\n }else {\\n assert(r.p == (int)s.size());\\n }\\n }\\n used[P] = true;\\n return res;\\n}\\nint main(){\\n int N;\\n cin >> N;\\n cin.ignore();\\n while(N--){\\n string s;\\n REP(i, 1000) memo[i].clear();\\n REP(i, 1000) used[i] = false;\\n getline(cin, s);\\n replace(s, \\\"a list of\\\", \\\"[\\\");\\n replace(s, \\\"and\\\", \\\"&\\\");\\n replace(s, \\\" \\\", \\\"\\\");\\n map<int, vector<Result> > rvm = expr(s, 0);\\n if(rvm[s.size()].size() == 1){\\n cout << rvm[s.size()][0].value << endl;\\n }else if(rvm[s.size()].size() > 1){\\n cout << \\\"AMBIGUOUS\\\" << endl;\\n }else{\\n cout << \\\"NULL\\\"<<endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 2628,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2067_604446\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\\\" \\\"; cerr<<endl; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\nvoid replace(string& s, const string& from, const string& to){\\n string::size_type pos = s.find(from);\\n while(pos != string::npos){\\n s.replace(pos, from.size(), to);\\n pos = s.find(from, pos + to.size());\\n }\\n}\\nstruct Result{\\n string value;\\n int p;\\n Result(string s, int p) : value(s), p(p){}\\n};\\nmap<int, vector<Result> > memo[1000];\\nbool used[1000];\\nmap<int, vector<Result> > expr(const string& s, int p){\\n int P = p; \\n assert(P >= 0 && P < 1000);\\n if(used[P]) return memo[P];\\n //printf(\\\"expr %d %s\\\\n\\\", p, (s.substr(0, p) + \\\"*\\\" + s.substr(p + 1)).c_str());\\n assert(s[p] == '[');\\n p++;\\n queue<Result> que;\\n map<int, vector<Result> >& res = memo[P];\\n vector<int> cnt(s.size() + 1);\\n if(isupper(s[p])){\\n string word;\\n while(isupper(s[p])) word += s[p++];\\n Result r(\\\"(\\\" + word, p);\\n que.push(r);\\n //printf(\\\"\\\\t(expr %d) push_back R(%s, %d)\\\\n\\\", P, (r.value + \\\")\\\").c_str(), r.p);\\n res[r.p].push_back(Result(r.value + \\\")\\\", r.p));\\n }else{\\n //printf(\\\"\\\\t(expr %d) call1 expr %d\\\\n\\\", P, p);\\n map<int, vector<Result> > rvm = expr(s, p);\\n FORIT(it_, rvm)FORIT(it, it_->second){\\n que.push(Result(\\\"(\\\" + it->value, it->p));\\n //printf(\\\"\\\\t(expr %d) push_back R(%s, %d)\\\\n\\\", P, (\\\"(\\\" + it->value + \\\")\\\").c_str(), it->p);\\n res[it->p].push_back(Result(\\\"(\\\" + it->value + \\\")\\\", it->p));\\n }\\n }\\n while(!que.empty()){\\n Result r = que.front(); que.pop();\\n //printf(\\\"\\\\tque R(%s, %d)\\\\n\\\", r.value.c_str(), r.p);\\n if(s[r.p] == ','){\\n if(s[r.p + 1] == '['){\\n //printf(\\\"\\\\t(expr %d) call2 expr %d\\\\n\\\", P, r.p + 1);\\n map<int, vector<Result> > rvm = expr(s, r.p + 1);\\n FORIT(it_, rvm) FORIT(it, it_->second) if(cnt[it->p] < 2){\\n cnt[it->p]++;\\n que.push(Result(r.value + \\\" \\\" + it->value, it->p));\\n //res[it->p].push_back(Result(r.value + \\\" \\\" + it->value + \\\")\\\", it->p));\\n }\\n }else if(isupper(s[r.p + 1])){\\n string word;\\n while(isupper(s[r.p + 1])) word += s[++r.p];\\n if(cnt[r.p + 1] < 2){\\n cnt[r.p + 1]++;\\n que.push(Result(r.value + \\\" \\\" + word, r.p + 1));\\n //res[r.p + 1].push_back(Result(r.value + \\\" \\\" + word + \\\")\\\", r.p + 1));\\n }\\n }else{\\n assert(false);\\n }\\n }else if(s[r.p] == '&'){\\n if(s[r.p + 1] == '['){\\n //printf(\\\"\\\\tcall3 expr %d\\\\n\\\", r.p + 1);\\n map<int, vector<Result> > rvm = expr(s, r.p + 1);\\n FORIT(it_, rvm) FORIT(it, (it_->second)) if(res[it->p].size() < 2){\\n res[it->p].push_back(Result(r.value + \\\" \\\" + it->value + \\\")\\\", it->p));\\n //printf(\\\"\\\\t(expr %d) push_back R(%s, %d)\\\\n\\\", P, (\\\"(\\\" + it->value + \\\")\\\").c_str(), it->p);\\n }\\n }else if(isupper(s[r.p + 1])){\\n string word;\\n while(isupper(s[r.p + 1])) word += s[++r.p];\\n if(res[r.p + 1].size() < 2){\\n res[r.p + 1].push_back(Result(r.value + \\\" \\\" + word + \\\")\\\", r.p + 1));\\n //printf(\\\"\\\\t(expr %d) push_back R(%s, %d)\\\\n\\\", P, (r.value + \\\" \\\" + word + \\\")\\\").c_str(), r.p + 1);\\n }\\n }else{\\n assert(false);\\n }\\n }else {\\n assert(r.p == (int)s.size());\\n }\\n }\\n used[P] = true;\\n //printf(\\\"(expr %d) return\\\\n\\\", P);\\n return res;\\n}\\nint main(){\\n int N;\\n cin >> N;\\n cin.ignore();\\n while(N--){\\n string s;\\n REP(i, 1000) memo[i].clear();\\n REP(i, 1000) used[i] = false;\\n getline(cin, s);\\n //cout << \\\"#\\\" << s << endl;\\n replace(s, \\\"a list of\\\", \\\"[\\\");\\n replace(s, \\\"and\\\", \\\"&\\\");\\n replace(s, \\\" \\\", \\\"\\\");\\n map<int, vector<Result> > rvm = expr(s, 0);\\n if(rvm[s.size()].size() == 1){\\n cout << rvm[s.size()][0].value << endl;\\n }else if(rvm[s.size()].size() > 1){\\n cout << \\\"AMBIGUOUS\\\" << endl;\\n }else{\\n cout << \\\"NULL\\\"<<endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 2628,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1097,"cells":{"group_id":{"kind":"string","value":"aoj_2073_cpp"},"problem_description":{"kind":"string","value":"The Phantom\nMr. Hoge is in trouble. He just bought a new mansion, but it’s haunted by a phantom. He asked a famous conjurer\nDr. Huga to get rid of the phantom. Dr. Huga went to see the mansion, and found that the phantom is scared by\nits own mirror images. Dr. Huga set two flat mirrors in order to get rid of the phantom.\nAs you may know, you can make many mirror images even with only two mirrors. You are to count up the\nnumber of the images as his assistant. Given the coordinates of the mirrors and the phantom, show the number\nof images of the phantom which can be seen through the mirrors.\nInput\nThe input consists of multiple test cases. Each test cases starts with a line which contains two positive integers,\np\nx\nand\np\ny\n(1 ≤\np\nx\n,\np\ny\n≤ 50), which are the\nx\n- and\ny\n-coordinate of the phantom. In the next two lines, each line\ncontains four positive integers\nu\nx\n,\nu\ny\n,\nv\nx\nand\nv\ny\n(1 ≤\nu\nx\n,\nu\ny\n,\nv\nx\n,\nv\ny\n≤ 50), which are the coordinates of the mirror.\nEach mirror can be seen as a line segment, and its thickness is negligible. No mirror touches or crosses with\nanother mirror. Also, you can assume that no images will appear within the distance of 10\n-5\nfrom the endpoints\nof the mirrors.\nThe input ends with a line which contains two zeros.\nOutput\nFor each case, your program should output one line to the standard output, which contains the number of images\nrecognized by the phantom. If the number is equal to or greater than 100, print “TOO MANY” instead.\nSample Input\n4 4\n3 3 5 3\n3 5 5 6\n4 4\n3 3 5 3\n3 5 5 5\n0 0\nOutput for the Sample Input\n4\nTOO MANY"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2073_3224441","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\n#include <utility>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\n\ntypedef complex<double> P;\ntypedef vector<P> VP;\nstruct L : array<P, 2>{\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\n L(){}\n};\n\nnamespace std{\n bool operator < (const P& a, const P& b){\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\n }\n bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){\n return (conj(a)*b).X;\n}\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\n}\nint ccw(P a, P b, P c){\n b -= a;\n c -= a;\n if(cross(b,c) > EPS) return +1; //ccw\n if(cross(b,c) < -EPS) return -1; //cw\n if(dot(b,c) < -EPS) return +2; //c-a-b\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\n return 0; //a-c-b\n}\n\nbool intersectSS(const L& a, const L& b){\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\n}\nbool intersectSP(const L& s, const P &p){\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\n}\n\nP projection(const L& l, const P& p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\nP reflection(const L& l, const P& p) {\n return p + 2.0*(projection(l, p) -p);\n}\nL reflection(const L& l, const L& m){\n return L(reflection(l, m[0]), reflection(l, m[1]));\n}\n\nbool isParallel(const P &a, const P &b){\n return abs(cross(a,b)) < EPS;\n}\nbool isParallel(const L &a, const L &b){\n return isParallel(a[1]-a[0], b[1]-b[0]);\n}\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1]-l[0], m[1]-m[0]);\n double B = cross(l[1]-l[0], l[1]-m[0]);\n return m[0] + B/A *(m[1]-m[0]);\n}\n\nconst int maxrep = 1300;\n\nint main(){\n while(1){\n int sx,sy;\n cin >> sx >> sy;\n if(sx == 0) break;\n\n P s(sx, sy);\n vector<L> mirror(2);\n for(int d=0; d<2; d++){\n int xs,ys,xt,yt;\n cin >> xs >> ys >> xt >> yt;\n mirror[d] = L(P(xs, ys), P(xt, yt));\n }\n\n //反射後の鏡・幽霊の位置\n vector<vector<L> > w(2, vector<L>(maxrep));\n vector<vector<P> > p(2, vector<P>(maxrep));\n for(int d=0; d<2; d++){\n w[d][0] = mirror[1-d];\n w[d][1] = mirror[d];\n p[d][0] = s;\n p[d][1] = reflection(w[d][1], p[d][0]);\n for(int i=2; i<maxrep; i++){\n w[d][i] = reflection(w[d][i-1], w[d][i-2]);\n p[d][i] = reflection(w[d][i], p[d][i-1]);\n }\n }\n \n int ans = 0;\n for(int d=0; d<2; d++){\n for(int i=1; i<maxrep && ans<100; i++){\n L ray(p[d][0], p[d][i]);\n //コーナーケース:別の鏡に遮られる\n if(!isParallel(ray, w[d][0]) && intersectSS(ray, w[d][0])){\n L ray2(crosspointLL(ray, w[d][0]), ray[1]);\n if(intersectSS(ray2, w[d][1])) continue;\n }\n //順番に通過していればよい\n bool ok = true;\n for(int j=1; j<=i; j++){\n if(isParallel(ray, w[d][j]) || !intersectSS(ray, w[d][j])){\n ok = false;\n break;\n }\n ray[0] = crosspointLL(ray, w[d][j]);\n }\n if(ok){\n ans++;\n }\n }\n }\n if(ans >= 100){\n cout << \"TOO MANY\" << endl;\n }else{\n cout << ans << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3280,"score_of_the_acc":-1,"final_rank":1},{"submission_id":"aoj_2073_1469066","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-7)\n#define equals(a,b) (fabs((a)-(b)) < EPS)\n#define COUNTER_CLOCKWISE 1\n#define CLOCKWISE -1 \n#define ONLINE_BACK 2\n#define ONLINE_FRONT -2\n#define ON_SEGMENT 0\n\nusing namespace std;\n\nclass Point{\npublic:\n double x,y;\n\n Point(double x = 0,double y = 0): x(x),y(y){}\n\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n bool operator < (const Segment& s) const { return ( p2 == s.p2 ) ? p1 < s.p1 : p2 < s.p2; }\n bool operator == (const Segment& s) const { return ( s.p1 == p1 && s.p2 == p2 ) || ( s.p1 == p2 && s.p2 == p1 ); }\n\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\n\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\n\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\n\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\n\ndouble abs(Point a){ return sqrt(norm(a)); }\n\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n\ndouble toRad(double agl){ return agl*M_PI/180.0; }\n\nint ccw(Point p0,Point p1,Point p2){\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS)return CLOCKWISE;\n if(dot(a,b) < -EPS)return ONLINE_BACK;\n if(norm(a) < norm(b))return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n\nbool intersectLL(Line l, Line m) {\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\n}\n\nbool intersectLS(Line l, Line s) {\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\n}\n\nbool intersectLP(Line l,Point p) { return abs(cross(l.p2-p, l.p1-p)) < EPS; }\n\nbool intersectSS(Line s, Line t) {\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\n}\n\nbool intersectSP(Line s, Point p) { return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; }\n\nPoint projection(Line l,Point p) {\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\n return l.p1 + (l.p1-l.p2)*t;\n}\n\nPoint reflection(Line l,Point p) { return p + (projection(l, p) - p) * 2; }\n\ndouble distanceSP(Line s, Point p) {\n Point r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s.p1 - p), abs(s.p2 - p));\n}\n\nPoint crosspoint(Line l,Line m){\n double A = cross(l.p2-l.p1,m.p2-m.p1);\n double B = cross(l.p2-l.p1,l.p2-m.p1);\n if(abs(A) < EPS && abs(B) < EPS){\n vector<Point> vec;\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\n sort(vec.begin(),vec.end());\n assert(vec[1] == vec[2]); //???????????°??????????????????\n return vec[1];\n //return m.p1;\n }\n if(abs(A) < EPS)assert(false);\n return m.p1 + (m.p2-m.p1)*(B/A);\n}\n\n// --------\n\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\ninline bool LTE(double a,double b) { return equals(a,b) || a < b; }\n\nconst double PI2 = M_PI * 2.0;\nstruct AngleRange {\n Point o; // ?????????, ???????????????????§???? ????????¨???????????????????????????,????????????\n double mini,maxi; // mini <= maxi | 0 <= mini,maxi <= 720\n // ?????°?????????????????§abs(maxi-mini)???180??????\n\n AngleRange( Point p, Segment seg ) {\n o = p;\n seg.p1 = seg.p1 - o, seg.p2 = seg.p2 - o;\n complex<double> p1(seg.p1.x,seg.p1.y);\n complex<double> p2(seg.p2.x,seg.p2.y);\n double tmp = arg( p1 / p2 ); // ???????????? p1 ??¨ p2 ??????????§? arg( p1 / p2 )\n mini = LT(0.0,tmp) ? arg(p2) : arg(p1);\n if( LT(mini,0) ) mini += PI2;\n maxi = abs(tmp) + mini;\n }\n\n bool fail(){ return equals(mini,maxi); }\n\n // mini < a < maxi\n bool contains(double a) const { \n return ( LT(mini,a-PI2) && LT(a-PI2,maxi) ) || ( LT(mini,a) && LT(a,maxi) ) || ( LT(mini,a+PI2) && LT(a+PI2,maxi) );\n }\n\n bool contains(Point p) const {\n p = p - o;\n complex<double> cp(p.x,p.y);\n return contains(arg(cp));\n }\n\n void update( AngleRange ar ) {\n if( contains(ar.mini) ) {\n if( contains(ar.maxi) ) mini = ar.mini, maxi = ar.maxi;\n else mini = ar.mini;\n } else { \n if( contains(ar.maxi) ) maxi = ar.maxi;\n else if( !ar.contains(mini) && !equals(mini,ar.mini) ) maxi = mini;\n }\n if( LT(maxi-mini,0) ) maxi += PI2;\n if( LTE(PI2,maxi-mini) ) maxi -= PI2;\n }\n\n};\n\nostream& operator << (ostream& os,const AngleRange& a){ os << \"[ \" << a.mini*180.0/M_PI << \" , \" << a.maxi*180.0/M_PI << \" ]\"; }\n\nSegment reflection(Line line, Segment seg){\n return Segment(reflection(line,seg.p1),reflection(line,seg.p2));\n}\n\ndouble distance(Segment s,Point p1,Point p2){\n Segment t = Segment(p1,p2);\n Point cp = crosspoint(s,Line(p1,p2));\n return abs(p1-cp);\n}\n\nPoint vp;\ndouble distance2(Segment s,double rad){\n Vector e = Point(10,0);\n e = rotate(e,rad);\n Point cp = crosspoint(s,Line(vp,vp+e));\n return abs(cp-vp);\n}\n\nconst int loop_limit = 100000;\nvoid compute(Point phantom,Segment mirror1,Segment mirror2){\n \n vp = phantom;\n\n Point iPhantom[2] = { reflection(mirror1,phantom), reflection(mirror2,phantom) }; \n Segment nmirror[2] = { mirror1, mirror2 };\n AngleRange range[2] = { AngleRange(phantom,mirror1), AngleRange(phantom,mirror2) };\n int cnt = 0;\n int i = 0;\n while( i < loop_limit && cnt <= 100 && !( range[0].fail() && range[1].fail() ) ){\n if( !range[0].fail() )\n if( !intersectSS(Segment(phantom,iPhantom[0]),mirror2) || !LT(distance(mirror2,phantom,iPhantom[0]),distance(mirror1,phantom,iPhantom[0])) ) {\n if( range[0].contains(iPhantom[0]) ) ++cnt;\n }\n\n if( !range[1].fail() )\n if( !intersectSS(Segment(phantom,iPhantom[1]),mirror1) || !LT(distance(mirror1,phantom,iPhantom[1]),distance(mirror2,phantom,iPhantom[1])) ) {\n if( range[1].contains(iPhantom[1]) ) ++cnt;\n }\n \n Segment tmp1 = reflection(mirror1,nmirror[1]);\n Segment tmp2 = reflection(mirror2,nmirror[0]);\n Point tmp3 = reflection(mirror1,iPhantom[1]);\n Point tmp4 = reflection(mirror2,iPhantom[0]);\n\n AngleRange tmpR(phantom,tmp1);\n range[0].update(tmpR);\n tmpR = AngleRange(phantom,tmp2);\n range[1].update(tmpR);\n\n double mid = ( range[0].mini + range[0].maxi ) / 2;\n if( !range[0].fail() && LT(distance2(tmp1,mid),distance2(nmirror[0],mid)) ) range[0].mini = range[0].maxi = 0;\n mid = ( range[1].mini + range[1].maxi ) / 2;\n if( !range[1].fail() && LT(distance2(tmp2,mid),distance2(nmirror[1],mid)) ) range[1].mini = range[1].maxi = 0;\n\n nmirror[0] = tmp1;\n nmirror[1] = tmp2;\n iPhantom[0] = tmp3;\n iPhantom[1] = tmp4;\n\n ++i;\n \n }\n\n if( cnt > 100 ) puts(\"TOO MANY\");\n else cout << cnt << endl;\n}\n\nint main(){\n int sx,sy;\n while( cin >> sx >> sy, sx | sy ){\n Point sp = Point(sx,sy);\n Segment segs[2];\n rep(i,2) cin >> segs[i].p1.x >> segs[i].p1.y >> segs[i].p2.x >> segs[i].p2.y;\n compute(sp,segs[0],segs[1]);\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":1336,"score_of_the_acc":-1,"final_rank":1},{"submission_id":"aoj_2073_1468969","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-7)\n#define equals(a,b) (fabs((a)-(b)) < EPS)\n#define COUNTER_CLOCKWISE 1\n#define CLOCKWISE -1 \n#define ONLINE_BACK 2\n#define ONLINE_FRONT -2\n#define ON_SEGMENT 0\n\nusing namespace std;\n\nclass Point{\npublic:\n double x,y;\n\n Point(double x = 0,double y = 0): x(x),y(y){}\n\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n bool operator < (const Segment& s) const { return ( p2 == s.p2 ) ? p1 < s.p1 : p2 < s.p2; }\n bool operator == (const Segment& s) const { return ( s.p1 == p1 && s.p2 == p2 ) || ( s.p1 == p2 && s.p2 == p1 ); }\n\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\nostream& operator << (ostream& os,const Point& a){ os << \"(\" << a.x << \",\" << a.y << \")\"; }\n\nostream& operator << (ostream& os,const Segment& a){ os << \"( \" << a.p1 << \" , \" << a.p2 << \" )\"; }\n\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\n\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\n\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\n\ndouble abs(Point a){ return sqrt(norm(a)); }\n\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n\ndouble toRad(double agl){ return agl*M_PI/180.0; }\n\n// a => prev, b => cur, c=> next\n// prev ?????? cur ????????£??? next ????????????????§????????±???????\ndouble getArg(Point a,Point b,Point c){\n double arg1 = atan2(b.y-a.y,b.x-a.x);\n double arg2 = atan2(c.y-b.y,c.x-b.x);\n double arg = fabs( arg1 - arg2 );\n while( arg > M_PI ) arg -= 2.0 * M_PI;\n return fabs(arg);\n}\n\nint ccw(Point p0,Point p1,Point p2){\n Point a = p1-p0;\n Point b = p2-p0;\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS)return CLOCKWISE;\n if(dot(a,b) < -EPS)return ONLINE_BACK;\n if(norm(a) < norm(b))return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n\nbool intersectLL(Line l, Line m) {\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\n}\nbool intersectLS(Line l, Line s) {\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\n}\nbool intersectLP(Line l,Point p) {\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\n}\nbool intersectSS(Line s, Line t) {\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\n}\nbool intersectSP(Line s, Point p) {\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\n}\n\nPoint projection(Line l,Point p) {\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\n return l.p1 + (l.p1-l.p2)*t;\n}\nPoint reflection(Line l,Point p) {\n return p + (projection(l, p) - p) * 2;\n}\ndouble distanceLP(Line l, Point p) {\n return abs(p - projection(l, p));\n}\ndouble distanceLL(Line l, Line m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\n}\n\ndouble distanceLS(Line l, Line s) {\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\n}\ndouble distanceSP(Line s, Point p) {\n Point r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s.p1 - p), abs(s.p2 - p));\n}\n\ndouble distanceSS(Line s, Line t) {\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\n}\n\nPoint crosspoint(Line l,Line m){\n double A = cross(l.p2-l.p1,m.p2-m.p1);\n double B = cross(l.p2-l.p1,l.p2-m.p1);\n if(abs(A) < EPS && abs(B) < EPS){\n vector<Point> vec;\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\n sort(vec.begin(),vec.end());\n assert(vec[1] == vec[2]); //???????????°??????????????????\n return vec[1];\n //return m.p1;\n }\n if(abs(A) < EPS)assert(false);\n return m.p1 + (m.p2-m.p1)*(B/A);\n}\n\n\n//cross product of pq and pr\ndouble cross3p(Point p,Point q,Point r) { return (r.x-q.x) * (p.y -q.y) - (r.y - q.y) * (p.x - q.x); }\n \n//returns true if point r is on the same line as the line pq\nbool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }\n \n//returns true if point t is on the left side of line pq\nbool ccwtest(Point p,Point q,Point r){\n return cross3p(p,q,r) > 0; //can be modified to accept collinear points\n}\n \nbool onSegment(Point p,Point q,Point r){\n return collinear(p,q,r) && equals(sqrt(pow(p.x-r.x,2)+pow(p.y-r.y,2)) + sqrt(pow(r.x-q.x,2) + pow(r.y-q.y,2) ),sqrt(pow(p.x-q.x,2)+pow(p.y-q.y,2)) ) ;\n}\n\n// --------\n\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\ninline bool LTE(double a,double b) { return equals(a,b) || a < b; }\n\n\nconst double PI2 = M_PI * 2.0;\nstruct AngleRange {\n Point o; // ?????????, ???????????????????§???? ????????¨???????????????????????????,????????????\n double mini,maxi; // mini <= maxi | 0 <= mini,maxi <= 720\n // ?????°?????????????????§abs(maxi-mini)???180??????\n\n AngleRange( Point p, Segment seg ) {\n o = p;\n seg.p1 = seg.p1 - o, seg.p2 = seg.p2 - o;\n complex<double> p1(seg.p1.x,seg.p1.y);\n complex<double> p2(seg.p2.x,seg.p2.y);\n double tmp = arg( p1 / p2 ); // ???????????? p1 ??¨ p2 ??????????§? arg( p1 / p2 )\n mini = LT(0.0,tmp) ? arg(p2) : arg(p1);\n if( LT(mini,0) ) mini += PI2;\n maxi = abs(tmp) + mini;\n }\n\n bool fail(){ return equals(mini,maxi); }\n\n // mini < a < maxi\n bool contains(double a) const { \n return ( LT(mini,a-PI2) && LT(a-PI2,maxi) ) || ( LT(mini,a) && LT(a,maxi) ) || ( LT(mini,a+PI2) && LT(a+PI2,maxi) );\n }\n\n bool contains(Point p) const {\n p = p - o;\n complex<double> cp(p.x,p.y);\n return contains(arg(cp));\n }\n\n void update( AngleRange ar ) {\n if( contains(ar.mini) ) {\n if( contains(ar.maxi) ) mini = ar.mini, maxi = ar.maxi;\n else mini = ar.mini;\n } else { \n if( contains(ar.maxi) ) maxi = ar.maxi;\n else if( !ar.contains(mini) && !equals(mini,ar.mini) ) maxi = mini;\n }\n if( LT(maxi-mini,0) ) maxi += PI2;\n if( LTE(PI2,maxi-mini) ) maxi -= PI2;\n }\n\n};\n\n\nostream& operator << (ostream& os,const AngleRange& a){ os << \"[ \" << a.mini*180.0/M_PI << \" , \" << a.maxi*180.0/M_PI << \" ]\"; }\n\nSegment reflection(Line line, Segment seg){\n return Segment(reflection(line,seg.p1),reflection(line,seg.p2));\n}\n\ndouble distance(Segment s,Point p1,Point p2){\n Segment t = Segment(p1,p2);\n Point cp = crosspoint(s,Line(p1,p2));\n return abs(p1-cp);\n}\n\nPoint vp;\ndouble distance2(Segment s,double rad){\n Vector e = Point(10,0);\n e = rotate(e,rad);\n Point cp = crosspoint(s,Line(vp,vp+e));\n return abs(cp-vp);\n}\n\nconst int loop_limit = 100000;\nvoid compute(Point phantom,Segment mirror1,Segment mirror2){\n \n\n vp = phantom;\n\n Point iPhantom[2] = { reflection(mirror1,phantom), reflection(mirror2,phantom) }; \n Segment nmirror[2] = { mirror1, mirror2 };\n AngleRange range[2] = { AngleRange(phantom,mirror1), AngleRange(phantom,mirror2) };\n int cnt = 0;\n /*\n puts(\"------------\");\n cout << \"mirror1 = \" << mirror1 << endl;\n cout << \"nmirror[0] = \" << nmirror[0] << endl;\n cout << \"iPhantom[0] = \" << iPhantom[0] << endl;\n cout << \"range[0] = \" << range[0] << endl;\n cout << \"mirror2 = \" << mirror2 << endl;\n cout << \"nmirror[1] = \" << nmirror[1] << endl;\n cout << \"iPhantom[1] = \" << iPhantom[1] << endl;\n cout << \"range[1] = \" << range[1] << endl;\n */\n int i = 0;\n while( i < loop_limit && cnt <= 100 && !( range[0].fail() && range[1].fail() ) ){\n //cout << \"nmirror[0] = \" << nmirror[0] << endl;\n //cout << \"nmirror[1] = \" << nmirror[1] << endl;\n //puts(\"\");\n if( !range[0].fail() )\n if( !intersectSS(Segment(phantom,iPhantom[0]),mirror2) || !LT(distance(mirror2,phantom,iPhantom[0]),distance(mirror1,phantom,iPhantom[0])) ) {\n //if( !intersectSS(Segment(phantom,iPhantom[0]),mirror2) ) {\n if( range[0].contains(iPhantom[0]) ) {\n\t//cout << \"iPhantom[0] success!!!\" << endl;\n\t++cnt;\n }\n }\n\n if( !range[1].fail() )\n if( !intersectSS(Segment(phantom,iPhantom[1]),mirror1) || !LT(distance(mirror1,phantom,iPhantom[1]),distance(mirror2,phantom,iPhantom[1])) ) {\n //if( !intersectSS(Segment(phantom,iPhantom[1]),mirror1) ) {\n if( range[1].contains(iPhantom[1]) ) {\n\t//cout << \"iPhantom[1] success!!!\" << endl;\n\t++cnt;\n }\n }\n \n Segment tmp1 = reflection(mirror1,nmirror[1]);\n Segment tmp2 = reflection(mirror2,nmirror[0]);\n Point tmp3 = reflection(mirror1,iPhantom[1]);\n Point tmp4 = reflection(mirror2,iPhantom[0]);\n\n AngleRange tmpR(phantom,tmp1);\n range[0].update(tmpR);\n tmpR = AngleRange(phantom,tmp2);\n range[1].update(tmpR);\n\n double mid = ( range[0].mini + range[0].maxi ) / 2;\n /*\n cout << \"tmp = \" << tmp1 << endl;\n cout << \"mir = \" << nmirror[0] << endl;\n cout << distance2(tmp1,mid) << \" and \" << distance2(nmirror[0],mid) << endl;\n */\n if( !range[0].fail() && LT(distance2(tmp1,mid),distance2(nmirror[0],mid)) ) range[0].mini = range[0].maxi = 0;\n mid = ( range[1].mini + range[1].maxi ) / 2;\n if( !range[1].fail() && LT(distance2(tmp2,mid),distance2(nmirror[1],mid)) ) range[1].mini = range[1].maxi = 0;\n\n nmirror[0] = tmp1;\n nmirror[1] = tmp2;\n iPhantom[0] = tmp3;\n iPhantom[1] = tmp4;\n /*\n AngleRange tmpR(phantom,nmirror[0]);\n range[0].update(tmpR);\n tmpR = AngleRange(phantom,nmirror[1]);\n range[1].update(tmpR);\n */\n \n\n ++i;\n \n }\n //cout << \"cnt = \" << cnt << endl;\n if( cnt > 100 ) puts(\"TOO MANY\");\n else cout << cnt << endl;\n}\n\nint main(){\n /*\n Segment s;\n cin >> s.p1.x >> s.p1.y >> s.p2.x >>s.p2.y;\n AngleRange range(Point(0,0),s);\n cout << \"[\" << range.mini*180.0/M_PI << \",\" << range.maxi*180.0/M_PI << \"]\" << endl;\n while(1){\n Segment t;\n cin >> t.p1.x >> t.p1.y >> t.p2.x >> t.p2.y;\n AngleRange trange(Point(0,0),t);\n cout << \"* [\" << trange.mini*180.0/M_PI << \",\" << trange.maxi*180.0/M_PI << \"]\" << endl;\n range.update(trange);\n cout << \"= [\" << range.mini*180.0/M_PI << \",\" << range.maxi*180.0/M_PI << \"]\" << endl;\n }\n return 0;\n */\n int sx,sy;\n while( cin >> sx >> sy, sx | sy ){\n Point sp = Point(sx,sy);\n Segment segs[2];\n rep(i,2) cin >> segs[i].p1.x >> segs[i].p1.y >> segs[i].p2.x >> segs[i].p2.y;\n compute(sp,segs[0],segs[1]);\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":1336,"score_of_the_acc":-1,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2073_3224441\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <array>\\n#include <utility>\\nusing namespace std;\\nconst double EPS = 1e-8;\\nconst double INF = 1e12;\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\n\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\nstruct L : array<P, 2>{\\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\\n L(){}\\n};\\n\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\nint ccw(P a, P b, P c){\\n b -= a;\\n c -= a;\\n if(cross(b,c) > EPS) return +1; //ccw\\n if(cross(b,c) < -EPS) return -1; //cw\\n if(dot(b,c) < -EPS) return +2; //c-a-b\\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\\n return 0; //a-c-b\\n}\\n\\nbool intersectSS(const L& a, const L& b){\\n return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&\\n ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );\\n}\\nbool intersectSP(const L& s, const P &p){\\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\\n}\\n\\nP projection(const L& l, const P& p) {\\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\\n return l[0] + t*(l[0]-l[1]);\\n}\\nP reflection(const L& l, const P& p) {\\n return p + 2.0*(projection(l, p) -p);\\n}\\nL reflection(const L& l, const L& m){\\n return L(reflection(l, m[0]), reflection(l, m[1]));\\n}\\n\\nbool isParallel(const P &a, const P &b){\\n return abs(cross(a,b)) < EPS;\\n}\\nbool isParallel(const L &a, const L &b){\\n return isParallel(a[1]-a[0], b[1]-b[0]);\\n}\\nP crosspointLL(const L &l, const L &m) {\\n double A = cross(l[1]-l[0], m[1]-m[0]);\\n double B = cross(l[1]-l[0], l[1]-m[0]);\\n return m[0] + B/A *(m[1]-m[0]);\\n}\\n\\nconst int maxrep = 1300;\\n\\nint main(){\\n while(1){\\n int sx,sy;\\n cin >> sx >> sy;\\n if(sx == 0) break;\\n\\n P s(sx, sy);\\n vector<L> mirror(2);\\n for(int d=0; d<2; d++){\\n int xs,ys,xt,yt;\\n cin >> xs >> ys >> xt >> yt;\\n mirror[d] = L(P(xs, ys), P(xt, yt));\\n }\\n\\n //反射後の鏡・幽霊の位置\\n vector<vector<L> > w(2, vector<L>(maxrep));\\n vector<vector<P> > p(2, vector<P>(maxrep));\\n for(int d=0; d<2; d++){\\n w[d][0] = mirror[1-d];\\n w[d][1] = mirror[d];\\n p[d][0] = s;\\n p[d][1] = reflection(w[d][1], p[d][0]);\\n for(int i=2; i<maxrep; i++){\\n w[d][i] = reflection(w[d][i-1], w[d][i-2]);\\n p[d][i] = reflection(w[d][i], p[d][i-1]);\\n }\\n }\\n \\n int ans = 0;\\n for(int d=0; d<2; d++){\\n for(int i=1; i<maxrep && ans<100; i++){\\n L ray(p[d][0], p[d][i]);\\n //コーナーケース:別の鏡に遮られる\\n if(!isParallel(ray, w[d][0]) && intersectSS(ray, w[d][0])){\\n L ray2(crosspointLL(ray, w[d][0]), ray[1]);\\n if(intersectSS(ray2, w[d][1])) continue;\\n }\\n //順番に通過していればよい\\n bool ok = true;\\n for(int j=1; j<=i; j++){\\n if(isParallel(ray, w[d][j]) || !intersectSS(ray, w[d][j])){\\n ok = false;\\n break;\\n }\\n ray[0] = crosspointLL(ray, w[d][j]);\\n }\\n if(ok){\\n ans++;\\n }\\n }\\n }\\n if(ans >= 100){\\n cout << \\\"TOO MANY\\\" << endl;\\n }else{\\n cout << ans << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3280,\n \"score_of_the_acc\": -1,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2073_1469066\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-7)\\n#define equals(a,b) (fabs((a)-(b)) < EPS)\\n#define COUNTER_CLOCKWISE 1\\n#define CLOCKWISE -1 \\n#define ONLINE_BACK 2\\n#define ONLINE_FRONT -2\\n#define ON_SEGMENT 0\\n\\nusing namespace std;\\n\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = 0,double y = 0): x(x),y(y){}\\n\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n bool operator < (const Segment& s) const { return ( p2 == s.p2 ) ? p1 < s.p1 : p2 < s.p2; }\\n bool operator == (const Segment& s) const { return ( s.p1 == p1 && s.p2 == p2 ) || ( s.p1 == p2 && s.p2 == p1 ); }\\n\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\n\\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\\n\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\n\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\n\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n\\ndouble toRad(double agl){ return agl*M_PI/180.0; }\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS)return CLOCKWISE;\\n if(dot(a,b) < -EPS)return ONLINE_BACK;\\n if(norm(a) < norm(b))return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n\\nbool intersectLL(Line l, Line m) {\\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\\n}\\n\\nbool intersectLS(Line l, Line s) {\\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\\n}\\n\\nbool intersectLP(Line l,Point p) { return abs(cross(l.p2-p, l.p1-p)) < EPS; }\\n\\nbool intersectSS(Line s, Line t) {\\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\\n}\\n\\nbool intersectSP(Line s, Point p) { return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; }\\n\\nPoint projection(Line l,Point p) {\\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\\n return l.p1 + (l.p1-l.p2)*t;\\n}\\n\\nPoint reflection(Line l,Point p) { return p + (projection(l, p) - p) * 2; }\\n\\ndouble distanceSP(Line s, Point p) {\\n Point r = projection(s, p);\\n if (intersectSP(s, r)) return abs(r - p);\\n return min(abs(s.p1 - p), abs(s.p2 - p));\\n}\\n\\nPoint crosspoint(Line l,Line m){\\n double A = cross(l.p2-l.p1,m.p2-m.p1);\\n double B = cross(l.p2-l.p1,l.p2-m.p1);\\n if(abs(A) < EPS && abs(B) < EPS){\\n vector<Point> vec;\\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\\n sort(vec.begin(),vec.end());\\n assert(vec[1] == vec[2]); //???????????°??????????????????\\n return vec[1];\\n //return m.p1;\\n }\\n if(abs(A) < EPS)assert(false);\\n return m.p1 + (m.p2-m.p1)*(B/A);\\n}\\n\\n// --------\\n\\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\\ninline bool LTE(double a,double b) { return equals(a,b) || a < b; }\\n\\nconst double PI2 = M_PI * 2.0;\\nstruct AngleRange {\\n Point o; // ?????????, ???????????????????§???? ????????¨???????????????????????????,????????????\\n double mini,maxi; // mini <= maxi | 0 <= mini,maxi <= 720\\n // ?????°?????????????????§abs(maxi-mini)???180??????\\n\\n AngleRange( Point p, Segment seg ) {\\n o = p;\\n seg.p1 = seg.p1 - o, seg.p2 = seg.p2 - o;\\n complex<double> p1(seg.p1.x,seg.p1.y);\\n complex<double> p2(seg.p2.x,seg.p2.y);\\n double tmp = arg( p1 / p2 ); // ???????????? p1 ??¨ p2 ??????????§? arg( p1 / p2 )\\n mini = LT(0.0,tmp) ? arg(p2) : arg(p1);\\n if( LT(mini,0) ) mini += PI2;\\n maxi = abs(tmp) + mini;\\n }\\n\\n bool fail(){ return equals(mini,maxi); }\\n\\n // mini < a < maxi\\n bool contains(double a) const { \\n return ( LT(mini,a-PI2) && LT(a-PI2,maxi) ) || ( LT(mini,a) && LT(a,maxi) ) || ( LT(mini,a+PI2) && LT(a+PI2,maxi) );\\n }\\n\\n bool contains(Point p) const {\\n p = p - o;\\n complex<double> cp(p.x,p.y);\\n return contains(arg(cp));\\n }\\n\\n void update( AngleRange ar ) {\\n if( contains(ar.mini) ) {\\n if( contains(ar.maxi) ) mini = ar.mini, maxi = ar.maxi;\\n else mini = ar.mini;\\n } else { \\n if( contains(ar.maxi) ) maxi = ar.maxi;\\n else if( !ar.contains(mini) && !equals(mini,ar.mini) ) maxi = mini;\\n }\\n if( LT(maxi-mini,0) ) maxi += PI2;\\n if( LTE(PI2,maxi-mini) ) maxi -= PI2;\\n }\\n\\n};\\n\\nostream& operator << (ostream& os,const AngleRange& a){ os << \\\"[ \\\" << a.mini*180.0/M_PI << \\\" , \\\" << a.maxi*180.0/M_PI << \\\" ]\\\"; }\\n\\nSegment reflection(Line line, Segment seg){\\n return Segment(reflection(line,seg.p1),reflection(line,seg.p2));\\n}\\n\\ndouble distance(Segment s,Point p1,Point p2){\\n Segment t = Segment(p1,p2);\\n Point cp = crosspoint(s,Line(p1,p2));\\n return abs(p1-cp);\\n}\\n\\nPoint vp;\\ndouble distance2(Segment s,double rad){\\n Vector e = Point(10,0);\\n e = rotate(e,rad);\\n Point cp = crosspoint(s,Line(vp,vp+e));\\n return abs(cp-vp);\\n}\\n\\nconst int loop_limit = 100000;\\nvoid compute(Point phantom,Segment mirror1,Segment mirror2){\\n \\n vp = phantom;\\n\\n Point iPhantom[2] = { reflection(mirror1,phantom), reflection(mirror2,phantom) }; \\n Segment nmirror[2] = { mirror1, mirror2 };\\n AngleRange range[2] = { AngleRange(phantom,mirror1), AngleRange(phantom,mirror2) };\\n int cnt = 0;\\n int i = 0;\\n while( i < loop_limit && cnt <= 100 && !( range[0].fail() && range[1].fail() ) ){\\n if( !range[0].fail() )\\n if( !intersectSS(Segment(phantom,iPhantom[0]),mirror2) || !LT(distance(mirror2,phantom,iPhantom[0]),distance(mirror1,phantom,iPhantom[0])) ) {\\n if( range[0].contains(iPhantom[0]) ) ++cnt;\\n }\\n\\n if( !range[1].fail() )\\n if( !intersectSS(Segment(phantom,iPhantom[1]),mirror1) || !LT(distance(mirror1,phantom,iPhantom[1]),distance(mirror2,phantom,iPhantom[1])) ) {\\n if( range[1].contains(iPhantom[1]) ) ++cnt;\\n }\\n \\n Segment tmp1 = reflection(mirror1,nmirror[1]);\\n Segment tmp2 = reflection(mirror2,nmirror[0]);\\n Point tmp3 = reflection(mirror1,iPhantom[1]);\\n Point tmp4 = reflection(mirror2,iPhantom[0]);\\n\\n AngleRange tmpR(phantom,tmp1);\\n range[0].update(tmpR);\\n tmpR = AngleRange(phantom,tmp2);\\n range[1].update(tmpR);\\n\\n double mid = ( range[0].mini + range[0].maxi ) / 2;\\n if( !range[0].fail() && LT(distance2(tmp1,mid),distance2(nmirror[0],mid)) ) range[0].mini = range[0].maxi = 0;\\n mid = ( range[1].mini + range[1].maxi ) / 2;\\n if( !range[1].fail() && LT(distance2(tmp2,mid),distance2(nmirror[1],mid)) ) range[1].mini = range[1].maxi = 0;\\n\\n nmirror[0] = tmp1;\\n nmirror[1] = tmp2;\\n iPhantom[0] = tmp3;\\n iPhantom[1] = tmp4;\\n\\n ++i;\\n \\n }\\n\\n if( cnt > 100 ) puts(\\\"TOO MANY\\\");\\n else cout << cnt << endl;\\n}\\n\\nint main(){\\n int sx,sy;\\n while( cin >> sx >> sy, sx | sy ){\\n Point sp = Point(sx,sy);\\n Segment segs[2];\\n rep(i,2) cin >> segs[i].p1.x >> segs[i].p1.y >> segs[i].p2.x >> segs[i].p2.y;\\n compute(sp,segs[0],segs[1]);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1336,\n \"score_of_the_acc\": -1,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2073_1468969\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-7)\\n#define equals(a,b) (fabs((a)-(b)) < EPS)\\n#define COUNTER_CLOCKWISE 1\\n#define CLOCKWISE -1 \\n#define ONLINE_BACK 2\\n#define ONLINE_FRONT -2\\n#define ON_SEGMENT 0\\n\\nusing namespace std;\\n\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = 0,double y = 0): x(x),y(y){}\\n\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n bool operator < (const Segment& s) const { return ( p2 == s.p2 ) ? p1 < s.p1 : p2 < s.p2; }\\n bool operator == (const Segment& s) const { return ( s.p1 == p1 && s.p2 == p2 ) || ( s.p1 == p2 && s.p2 == p1 ); }\\n\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\ntypedef vector<Point> Polygon;\\n\\nostream& operator << (ostream& os,const Point& a){ os << \\\"(\\\" << a.x << \\\",\\\" << a.y << \\\")\\\"; }\\n\\nostream& operator << (ostream& os,const Segment& a){ os << \\\"( \\\" << a.p1 << \\\" , \\\" << a.p2 << \\\" )\\\"; }\\n\\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\\n\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\n\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\n\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n\\ndouble toRad(double agl){ return agl*M_PI/180.0; }\\n\\n// a => prev, b => cur, c=> next\\n// prev ?????? cur ????????£??? next ????????????????§????????±???????\\ndouble getArg(Point a,Point b,Point c){\\n double arg1 = atan2(b.y-a.y,b.x-a.x);\\n double arg2 = atan2(c.y-b.y,c.x-b.x);\\n double arg = fabs( arg1 - arg2 );\\n while( arg > M_PI ) arg -= 2.0 * M_PI;\\n return fabs(arg);\\n}\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Point a = p1-p0;\\n Point b = p2-p0;\\n if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS)return CLOCKWISE;\\n if(dot(a,b) < -EPS)return ONLINE_BACK;\\n if(norm(a) < norm(b))return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n\\nbool intersectLL(Line l, Line m) {\\n return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel\\n abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS; // same line\\n}\\nbool intersectLS(Line l, Line s) {\\n return cross(l.p2-l.p1, s.p1-l.p1)* // s[0] is left of l\\n cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(Line l,Point p) {\\n return abs(cross(l.p2-p, l.p1-p)) < EPS;\\n}\\nbool intersectSS(Line s, Line t) {\\n return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&\\n ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;\\n}\\nbool intersectSP(Line s, Point p) {\\n return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality\\n}\\n\\nPoint projection(Line l,Point p) {\\n double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);\\n return l.p1 + (l.p1-l.p2)*t;\\n}\\nPoint reflection(Line l,Point p) {\\n return p + (projection(l, p) - p) * 2;\\n}\\ndouble distanceLP(Line l, Point p) {\\n return abs(p - projection(l, p));\\n}\\ndouble distanceLL(Line l, Line m) {\\n return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);\\n}\\n\\ndouble distanceLS(Line l, Line s) {\\n if (intersectLS(l, s)) return 0;\\n return min(distanceLP(l, s.p1), distanceLP(l, s.p2));\\n}\\ndouble distanceSP(Line s, Point p) {\\n Point r = projection(s, p);\\n if (intersectSP(s, r)) return abs(r - p);\\n return min(abs(s.p1 - p), abs(s.p2 - p));\\n}\\n\\ndouble distanceSS(Line s, Line t) {\\n if (intersectSS(s, t)) return 0;\\n return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),\\n min(distanceSP(t, s.p1), distanceSP(t, s.p2)));\\n}\\n\\nPoint crosspoint(Line l,Line m){\\n double A = cross(l.p2-l.p1,m.p2-m.p1);\\n double B = cross(l.p2-l.p1,l.p2-m.p1);\\n if(abs(A) < EPS && abs(B) < EPS){\\n vector<Point> vec;\\n vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);\\n sort(vec.begin(),vec.end());\\n assert(vec[1] == vec[2]); //???????????°??????????????????\\n return vec[1];\\n //return m.p1;\\n }\\n if(abs(A) < EPS)assert(false);\\n return m.p1 + (m.p2-m.p1)*(B/A);\\n}\\n\\n\\n//cross product of pq and pr\\ndouble cross3p(Point p,Point q,Point r) { return (r.x-q.x) * (p.y -q.y) - (r.y - q.y) * (p.x - q.x); }\\n \\n//returns true if point r is on the same line as the line pq\\nbool collinear(Point p,Point q,Point r) { return fabs(cross3p(p,q,r)) < EPS; }\\n \\n//returns true if point t is on the left side of line pq\\nbool ccwtest(Point p,Point q,Point r){\\n return cross3p(p,q,r) > 0; //can be modified to accept collinear points\\n}\\n \\nbool onSegment(Point p,Point q,Point r){\\n return collinear(p,q,r) && equals(sqrt(pow(p.x-r.x,2)+pow(p.y-r.y,2)) + sqrt(pow(r.x-q.x,2) + pow(r.y-q.y,2) ),sqrt(pow(p.x-q.x,2)+pow(p.y-q.y,2)) ) ;\\n}\\n\\n// --------\\n\\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\\ninline bool LTE(double a,double b) { return equals(a,b) || a < b; }\\n\\n\\nconst double PI2 = M_PI * 2.0;\\nstruct AngleRange {\\n Point o; // ?????????, ???????????????????§???? ????????¨???????????????????????????,????????????\\n double mini,maxi; // mini <= maxi | 0 <= mini,maxi <= 720\\n // ?????°?????????????????§abs(maxi-mini)???180??????\\n\\n AngleRange( Point p, Segment seg ) {\\n o = p;\\n seg.p1 = seg.p1 - o, seg.p2 = seg.p2 - o;\\n complex<double> p1(seg.p1.x,seg.p1.y);\\n complex<double> p2(seg.p2.x,seg.p2.y);\\n double tmp = arg( p1 / p2 ); // ???????????? p1 ??¨ p2 ??????????§? arg( p1 / p2 )\\n mini = LT(0.0,tmp) ? arg(p2) : arg(p1);\\n if( LT(mini,0) ) mini += PI2;\\n maxi = abs(tmp) + mini;\\n }\\n\\n bool fail(){ return equals(mini,maxi); }\\n\\n // mini < a < maxi\\n bool contains(double a) const { \\n return ( LT(mini,a-PI2) && LT(a-PI2,maxi) ) || ( LT(mini,a) && LT(a,maxi) ) || ( LT(mini,a+PI2) && LT(a+PI2,maxi) );\\n }\\n\\n bool contains(Point p) const {\\n p = p - o;\\n complex<double> cp(p.x,p.y);\\n return contains(arg(cp));\\n }\\n\\n void update( AngleRange ar ) {\\n if( contains(ar.mini) ) {\\n if( contains(ar.maxi) ) mini = ar.mini, maxi = ar.maxi;\\n else mini = ar.mini;\\n } else { \\n if( contains(ar.maxi) ) maxi = ar.maxi;\\n else if( !ar.contains(mini) && !equals(mini,ar.mini) ) maxi = mini;\\n }\\n if( LT(maxi-mini,0) ) maxi += PI2;\\n if( LTE(PI2,maxi-mini) ) maxi -= PI2;\\n }\\n\\n};\\n\\n\\nostream& operator << (ostream& os,const AngleRange& a){ os << \\\"[ \\\" << a.mini*180.0/M_PI << \\\" , \\\" << a.maxi*180.0/M_PI << \\\" ]\\\"; }\\n\\nSegment reflection(Line line, Segment seg){\\n return Segment(reflection(line,seg.p1),reflection(line,seg.p2));\\n}\\n\\ndouble distance(Segment s,Point p1,Point p2){\\n Segment t = Segment(p1,p2);\\n Point cp = crosspoint(s,Line(p1,p2));\\n return abs(p1-cp);\\n}\\n\\nPoint vp;\\ndouble distance2(Segment s,double rad){\\n Vector e = Point(10,0);\\n e = rotate(e,rad);\\n Point cp = crosspoint(s,Line(vp,vp+e));\\n return abs(cp-vp);\\n}\\n\\nconst int loop_limit = 100000;\\nvoid compute(Point phantom,Segment mirror1,Segment mirror2){\\n \\n\\n vp = phantom;\\n\\n Point iPhantom[2] = { reflection(mirror1,phantom), reflection(mirror2,phantom) }; \\n Segment nmirror[2] = { mirror1, mirror2 };\\n AngleRange range[2] = { AngleRange(phantom,mirror1), AngleRange(phantom,mirror2) };\\n int cnt = 0;\\n /*\\n puts(\\\"------------\\\");\\n cout << \\\"mirror1 = \\\" << mirror1 << endl;\\n cout << \\\"nmirror[0] = \\\" << nmirror[0] << endl;\\n cout << \\\"iPhantom[0] = \\\" << iPhantom[0] << endl;\\n cout << \\\"range[0] = \\\" << range[0] << endl;\\n cout << \\\"mirror2 = \\\" << mirror2 << endl;\\n cout << \\\"nmirror[1] = \\\" << nmirror[1] << endl;\\n cout << \\\"iPhantom[1] = \\\" << iPhantom[1] << endl;\\n cout << \\\"range[1] = \\\" << range[1] << endl;\\n */\\n int i = 0;\\n while( i < loop_limit && cnt <= 100 && !( range[0].fail() && range[1].fail() ) ){\\n //cout << \\\"nmirror[0] = \\\" << nmirror[0] << endl;\\n //cout << \\\"nmirror[1] = \\\" << nmirror[1] << endl;\\n //puts(\\\"\\\");\\n if( !range[0].fail() )\\n if( !intersectSS(Segment(phantom,iPhantom[0]),mirror2) || !LT(distance(mirror2,phantom,iPhantom[0]),distance(mirror1,phantom,iPhantom[0])) ) {\\n //if( !intersectSS(Segment(phantom,iPhantom[0]),mirror2) ) {\\n if( range[0].contains(iPhantom[0]) ) {\\n\\t//cout << \\\"iPhantom[0] success!!!\\\" << endl;\\n\\t++cnt;\\n }\\n }\\n\\n if( !range[1].fail() )\\n if( !intersectSS(Segment(phantom,iPhantom[1]),mirror1) || !LT(distance(mirror1,phantom,iPhantom[1]),distance(mirror2,phantom,iPhantom[1])) ) {\\n //if( !intersectSS(Segment(phantom,iPhantom[1]),mirror1) ) {\\n if( range[1].contains(iPhantom[1]) ) {\\n\\t//cout << \\\"iPhantom[1] success!!!\\\" << endl;\\n\\t++cnt;\\n }\\n }\\n \\n Segment tmp1 = reflection(mirror1,nmirror[1]);\\n Segment tmp2 = reflection(mirror2,nmirror[0]);\\n Point tmp3 = reflection(mirror1,iPhantom[1]);\\n Point tmp4 = reflection(mirror2,iPhantom[0]);\\n\\n AngleRange tmpR(phantom,tmp1);\\n range[0].update(tmpR);\\n tmpR = AngleRange(phantom,tmp2);\\n range[1].update(tmpR);\\n\\n double mid = ( range[0].mini + range[0].maxi ) / 2;\\n /*\\n cout << \\\"tmp = \\\" << tmp1 << endl;\\n cout << \\\"mir = \\\" << nmirror[0] << endl;\\n cout << distance2(tmp1,mid) << \\\" and \\\" << distance2(nmirror[0],mid) << endl;\\n */\\n if( !range[0].fail() && LT(distance2(tmp1,mid),distance2(nmirror[0],mid)) ) range[0].mini = range[0].maxi = 0;\\n mid = ( range[1].mini + range[1].maxi ) / 2;\\n if( !range[1].fail() && LT(distance2(tmp2,mid),distance2(nmirror[1],mid)) ) range[1].mini = range[1].maxi = 0;\\n\\n nmirror[0] = tmp1;\\n nmirror[1] = tmp2;\\n iPhantom[0] = tmp3;\\n iPhantom[1] = tmp4;\\n /*\\n AngleRange tmpR(phantom,nmirror[0]);\\n range[0].update(tmpR);\\n tmpR = AngleRange(phantom,nmirror[1]);\\n range[1].update(tmpR);\\n */\\n \\n\\n ++i;\\n \\n }\\n //cout << \\\"cnt = \\\" << cnt << endl;\\n if( cnt > 100 ) puts(\\\"TOO MANY\\\");\\n else cout << cnt << endl;\\n}\\n\\nint main(){\\n /*\\n Segment s;\\n cin >> s.p1.x >> s.p1.y >> s.p2.x >>s.p2.y;\\n AngleRange range(Point(0,0),s);\\n cout << \\\"[\\\" << range.mini*180.0/M_PI << \\\",\\\" << range.maxi*180.0/M_PI << \\\"]\\\" << endl;\\n while(1){\\n Segment t;\\n cin >> t.p1.x >> t.p1.y >> t.p2.x >> t.p2.y;\\n AngleRange trange(Point(0,0),t);\\n cout << \\\"* [\\\" << trange.mini*180.0/M_PI << \\\",\\\" << trange.maxi*180.0/M_PI << \\\"]\\\" << endl;\\n range.update(trange);\\n cout << \\\"= [\\\" << range.mini*180.0/M_PI << \\\",\\\" << range.maxi*180.0/M_PI << \\\"]\\\" << endl;\\n }\\n return 0;\\n */\\n int sx,sy;\\n while( cin >> sx >> sy, sx | sy ){\\n Point sp = Point(sx,sy);\\n Segment segs[2];\\n rep(i,2) cin >> segs[i].p1.x >> segs[i].p1.y >> segs[i].p2.x >> segs[i].p2.y;\\n compute(sp,segs[0],segs[1]);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1336,\n \"score_of_the_acc\": -1,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1098,"cells":{"group_id":{"kind":"string","value":"aoj_2075_cpp"},"problem_description":{"kind":"string","value":"Dock to the Future\nYou had long wanted a spaceship, and finally you bought a used one yesterday! You have heard that the most\ndifficult thing on spaceship driving is to stop your ship at the right position in the dock. Of course you are no\nexception. After a dozen of failures, you gave up doing all the docking process manually. You began to write a\nsimple program that helps you to stop a spaceship.\nFirst, you somehow put the spaceship on the straight course to the dock manually. Let the distance to the limit\nline be\nx\n[m], and the speed against the dock be\nv\n[m/s]. Now you turn on the decelerating rocket. Then, your\nprogram will control the rocket to stop the spaceship at the best position.\nYour spaceship is equipped with a decelerating rocket with n modes. When the spaceship is in mode-\ni\n(0 ≤\ni\n<\nn\n),\nthe deceleration rate is\na\ni\n[m/s\n2\n]. You cannot re-accelerate the spaceship. The accelerating rocket is too powerful\nto be used during docking. Also, you cannot turn off-and-on the decelerating rocket, because your spaceship is a\nused and old one, once you stopped the rocket, it is less certain whether you can turn it on again. In other words,\nthe time you turn off the rocket is the time you stop your spaceship at the right position.\nAfter turning on the deceleration rocket, your program can change the mode or stop the rocket at every sec-\nond, starting at the very moment the deceleration began. Given\nx\nand\nv\n, your program have to make a plan of\ndeceleration. The purpose and the priority of your program is as follows:\nStop the spaceship exactly at the limit line. If this is possible, print “perfect”.\nIf it is impossible, then stop the spaceship at the position nearest possible to the limit line, but\nbefore\nthe\n line. In this case, print “good\nd\n”, where\nd\nis the distance between the limit line and the stopped position.\n Print three digits after the decimal point.\nIf it is impossible again, decelerate the spaceship to have negative speed, and print “try again”.\nIf all of these three cases are impossible, then the spaceship cannot avoid overrunning the limit line. In this\n case, print “crash”.\nInput\nThe first line of the input consists of a single integer\nc\n, the number of test cases.\nEach test case begins with a single integer\nn\n(1 ≤\nn\n≤ 10), the number of deceleration modes. The following line\ncontains\nn\npositive integers\na\n0\n, . . . ,\na\nn-1\n(1 ≤\na\ni\n≤ 100), each denoting the deceleration rate of each mode.\nThe next line contains a single integer\nq\n(1 ≤\nq\n≤ 20), and then\nq\nlines follow. Each of them contains two positive\nintegers\nx\nand\nv\n(1 ≤\nx\n,\nv\n≤ 100) defined in the problem statement.\nOutput\nFor each pair of\nx\nand\nv\n, print the result in one line. A blank line should be inserted between the test cases.\nSample Input\n1\n3\n2 4 6\n4\n10 100\n2 3\n10 6\n7 6\nOutput for the Sample Input\ncrash\ntry again\ngood 1.000\nperfect"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2075_9659676","code_snippet":"#include <iostream>\n#include <vector>\n#include <iomanip>\nusing namespace std;\nvoid solve(){\n int n, q;\n cin >> n;\n vector<int> a(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n cin >> q;\n while (q--){\n int x, v;\n cin >> x >> v;\n vector<vector<int> > dp(2 * x + 1, vector<int> (v + 1, 0));\n dp[2 * x][v] = 1;\n for (int i = 2 * x; i >= 0; i--){\n for (int j = v; j >= 0; j--){\n if (!dp[i][j]) continue;\n for (int p = 0; p < n; p++){\n if (i - 2 * j + a[p] < 0 || j - a[p] < 0) continue;\n dp[i - 2 * j + a[p]][j - a[p]] = 1;\n }\n }\n }\n int mx = 0;\n for (int i = 0; i < n; i++) mx = max(mx, a[i]);\n if (v * v > 2 * mx * x){\n cout << \"crash\" << endl;\n continue;\n }\n \n if (dp[0][0]){\n cout << \"perfect\" << endl;\n continue;\n }\n double ans = -1;\n for (int i = 1; i <= 2 * x; i++){\n if (dp[i][0]){\n ans = i;\n break;\n }\n }\n if (ans != -1){\n cout << \"good \" << ans / 2 << endl;\n continue;\n }\n cout << \"try again\" << endl;\n }\n}\nint main() {\n cout << fixed << setprecision(3);\n int t;\n cin >> t;\n while (t--){\n solve();\n if (t > 0) cout << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3304,"score_of_the_acc":-1.2086,"final_rank":3},{"submission_id":"aoj_2075_9659666","code_snippet":"#include <iostream>\n#include <vector>\n#include <iomanip>\n#include <algorithm>\nusing namespace std;\nvoid solve(){\n int n, q;\n cin >> n;\n vector<int> a(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n int mx = 0;\n for (int i = 0; i < n; i++) mx = max(mx, a[i]);\n cin >> q;\n while (q--){\n int x, v;\n cin >> x >> v;\n vector<vector<int> > dp(2 * x + 1, vector<int> (v + 1, 0));\n dp[2 * x][v] = 1;\n for (int i = 2 * x; i >= 0; i--){\n for (int j = v; j >= 0; j--){\n if (!dp[i][j]) continue;\n for (int p = 0; p < n; p++){\n if (i - 2 * j + a[p] < 0 || j - a[p] < 0) continue;\n dp[i - 2 * j + a[p]][j - a[p]] = 1;\n }\n }\n }\n if (v * v > 2 * mx * x){\n cout << \"crash\" << endl;\n continue;\n }\n if (dp[0][0]){\n cout << \"perfect\" << endl;\n continue;\n }\n double ans = -1;\n for (int i = 1; i <= 2 * x; i++){\n if (dp[i][0]){\n ans = i;\n break;\n }\n }\n if (ans != -1){\n cout << \"good \" << ans / 2 << endl;\n continue;\n }\n cout << \"try again\" << endl;\n }\n}\nint main() {\n cout << fixed << setprecision(3);\n int t;\n cin >> t;\n while (t--){\n solve();\n if (t > 0) cout << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3392,"score_of_the_acc":-1.25,"final_rank":5},{"submission_id":"aoj_2075_9659652","code_snippet":"#include <iostream>\n#include <vector>\n#include <iomanip>\n#include <algorithm>\nusing namespace std;\nvoid solve(){\n int n, q;\n cin >> n;\n vector<int> a(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n sort(a.begin(), a.end());\n cin >> q;\n while (q--){\n int x, v;\n cin >> x >> v;\n vector<vector<int> > dp(2 * x + 1, vector<int> (v + 1, 0));\n dp[2 * x][v] = 1;\n for (int i = 2 * x; i >= 0; i--){\n for (int j = v; j >= 0; j--){\n if (!dp[i][j]) continue;\n for (int p = 0; p < n; p++){\n if (i - 2 * j + a[p] < 0 || j - a[p] < 0) continue;\n dp[i - 2 * j + a[p]][j - a[p]] = 1;\n }\n }\n }\n if (v * v > 2 * a[n - 1] * x){\n cout << \"crash\" << endl;\n continue;\n }\n if (dp[0][0]){\n cout << \"perfect\" << endl;\n continue;\n }\n double ans = -1;\n for (int i = 1; i <= 2 * x; i++){\n if (dp[i][0]){\n ans = i;\n break;\n }\n }\n if (ans != -1){\n cout << \"good \" << ans / 2 << endl;\n continue;\n }\n cout << \"try again\" << endl;\n }\n}\nint main() {\n cout << fixed << setprecision(3);\n int t;\n cin >> t;\n while (t--){\n solve();\n if (t > 0) cout << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3312,"score_of_the_acc":-1.2123,"final_rank":4},{"submission_id":"aoj_2075_9659649","code_snippet":"#include <iostream>\n#include <vector>\n#include <iomanip>\n#include <algorithm>\nusing namespace std;\nvoid solve(){\n int n, q;\n cin >> n;\n vector<int> a(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n sort(a.begin(), a.end());\n cin >> q;\n while (q--){\n int x, v;\n cin >> x >> v;\n vector<vector<int> > dp(2 * x + 1, vector<int> (v + 1, 0));\n if (v * v > 2 * a[n - 1] * x){\n cout << \"crash\" << endl;\n continue;\n }\n dp[2 * x][v] = 1;\n for (int i = 2 * x; i >= 0; i--){\n for (int j = v; j >= 0; j--){\n if (!dp[i][j]) continue;\n for (int p = 0; p < n; p++){\n if (i - 2 * j + a[p] < 0 || j - a[p] < 0) continue;\n dp[i - 2 * j + a[p]][j - a[p]] = 1;\n }\n }\n }\n if (dp[0][0]){\n cout << \"perfect\" << endl;\n continue;\n }\n double ans = -1;\n for (int i = 1; i <= 2 * x; i++){\n if (dp[i][0]){\n ans = i;\n break;\n }\n }\n if (ans != -1){\n cout << \"good \" << ans / 2 << endl;\n continue;\n }\n cout << \"try again\" << endl;\n }\n}\nint main() {\n cout << fixed << setprecision(3);\n int t;\n cin >> t;\n while (t--){\n solve();\n if (t > 0) cout << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3392,"score_of_the_acc":-1.25,"final_rank":5},{"submission_id":"aoj_2075_1667651","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#pragma warning(disable:4996)\nusing namespace std;\n\ndouble eps = 1e-9;\nint main() {\n int A; cin >> A;\n while (A--) {\n int N; cin >> N;\n vector<int>as;\n for (int i = 0; i < N; ++i) {\n int a; cin >> a;\n as.push_back(a);\n }\n sort(as.begin(), as.end());\n int Q; cin >> Q;\n for (int t = 0; t< Q; ++t) {\n int x, v; cin >> x >> v;\n double stoptime = double(v) / as.back();\n if (x + eps < stoptime*v / 2) {\n cout << \"crash\" << endl;\n }\n else {\n bool dp[201][101];\n memset(dp, false, sizeof(dp));\n dp[2 * x][v] = true;\n for (int i = 2 * x; i >0; --i) {\n for (int j = 1; j <= v; ++j) {\n if (dp[i][j]) {\n for (int k = 0; k < as.size(); ++k) {\n int nextspeed = j - as[k];\n if (nextspeed >= 0) {\n if (i - j - nextspeed >= 0) {\n dp[i - j - nextspeed][nextspeed] = true;\n }\n }\n }\n }\n \n }\n }\n int dis = 9999;\n for (int i = 0; i <= 2 * x; ++i) {\n if (dp[i][0]) {\n dis = min(dis, i);\n }\n }\n if (dis == 9999) {\n cout << \"try again\" << endl;\n }\n else if (dis > 0) {\n cout << setprecision(3) << fixed << \"good \";\n printf(\"%.3f\", double(dis)/2);\n cout << endl;\n } \n else {\n cout << \"perfect\" << endl;\n }\n }\n }\n if (A)cout << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3144,"score_of_the_acc":-0.8832,"final_rank":1},{"submission_id":"aoj_2075_474165","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;\nvector<int> a;\n\nstring solve(int x, int v)\n{\n if(v * v > x * (2 * a[n-1]))\n return \"crash\";\n\n x *= 2;\n vector<vector<bool> > dp(x+1, vector<bool>(v+1, false));\n dp[x][v] = true;\n\n for(int i=x; i>=0; --i){\n for(int j=v; j>=0; --j){\n if(!dp[i][j])\n continue;\n for(int k=0; k<n; ++k){\n int i2 = i - 2 * j + a[k];\n int j2 = j - a[k];\n if(i2 >= 0 && j2 >= 0)\n dp[i2][j2] = true;\n }\n }\n }\n\n if(dp[0][0])\n return \"perfect\";\n\n for(int i=0; i<x; ++i){\n if(dp[i][0]){\n ostringstream oss;\n oss << \"good \" << (i / 2);\n if(i % 2 == 0)\n oss << \".000\";\n else\n oss << \".500\";\n return oss.str();\n }\n }\n\n return \"try again\";\n}\n\nint main()\n{\n int c;\n cin >> c;\n\n while(--c >= 0){\n cin >> n;\n a.resize(n);\n for(int i=0; i<n; ++i)\n cin >> a[i];\n sort(a.begin(), a.end());\n\n int q;\n cin >> q;\n while(--q >= 0){\n int x, v;\n cin >> x >> v;\n cout << solve(x, v) << endl;\n }\n\n if(c > 0)\n cout << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":1268,"score_of_the_acc":-1,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_2075_9659676\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <iomanip>\\nusing namespace std;\\nvoid solve(){\\n int n, q;\\n cin >> n;\\n vector<int> a(n);\\n for (int i = 0; i < n; i++) cin >> a[i];\\n cin >> q;\\n while (q--){\\n int x, v;\\n cin >> x >> v;\\n vector<vector<int> > dp(2 * x + 1, vector<int> (v + 1, 0));\\n dp[2 * x][v] = 1;\\n for (int i = 2 * x; i >= 0; i--){\\n for (int j = v; j >= 0; j--){\\n if (!dp[i][j]) continue;\\n for (int p = 0; p < n; p++){\\n if (i - 2 * j + a[p] < 0 || j - a[p] < 0) continue;\\n dp[i - 2 * j + a[p]][j - a[p]] = 1;\\n }\\n }\\n }\\n int mx = 0;\\n for (int i = 0; i < n; i++) mx = max(mx, a[i]);\\n if (v * v > 2 * mx * x){\\n cout << \\\"crash\\\" << endl;\\n continue;\\n }\\n \\n if (dp[0][0]){\\n cout << \\\"perfect\\\" << endl;\\n continue;\\n }\\n double ans = -1;\\n for (int i = 1; i <= 2 * x; i++){\\n if (dp[i][0]){\\n ans = i;\\n break;\\n }\\n }\\n if (ans != -1){\\n cout << \\\"good \\\" << ans / 2 << endl;\\n continue;\\n }\\n cout << \\\"try again\\\" << endl;\\n }\\n}\\nint main() {\\n cout << fixed << setprecision(3);\\n int t;\\n cin >> t;\\n while (t--){\\n solve();\\n if (t > 0) cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3304,\n \"score_of_the_acc\": -1.2086,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2075_9659666\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <iomanip>\\n#include <algorithm>\\nusing namespace std;\\nvoid solve(){\\n int n, q;\\n cin >> n;\\n vector<int> a(n);\\n for (int i = 0; i < n; i++) cin >> a[i];\\n int mx = 0;\\n for (int i = 0; i < n; i++) mx = max(mx, a[i]);\\n cin >> q;\\n while (q--){\\n int x, v;\\n cin >> x >> v;\\n vector<vector<int> > dp(2 * x + 1, vector<int> (v + 1, 0));\\n dp[2 * x][v] = 1;\\n for (int i = 2 * x; i >= 0; i--){\\n for (int j = v; j >= 0; j--){\\n if (!dp[i][j]) continue;\\n for (int p = 0; p < n; p++){\\n if (i - 2 * j + a[p] < 0 || j - a[p] < 0) continue;\\n dp[i - 2 * j + a[p]][j - a[p]] = 1;\\n }\\n }\\n }\\n if (v * v > 2 * mx * x){\\n cout << \\\"crash\\\" << endl;\\n continue;\\n }\\n if (dp[0][0]){\\n cout << \\\"perfect\\\" << endl;\\n continue;\\n }\\n double ans = -1;\\n for (int i = 1; i <= 2 * x; i++){\\n if (dp[i][0]){\\n ans = i;\\n break;\\n }\\n }\\n if (ans != -1){\\n cout << \\\"good \\\" << ans / 2 << endl;\\n continue;\\n }\\n cout << \\\"try again\\\" << endl;\\n }\\n}\\nint main() {\\n cout << fixed << setprecision(3);\\n int t;\\n cin >> t;\\n while (t--){\\n solve();\\n if (t > 0) cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3392,\n \"score_of_the_acc\": -1.25,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2075_9659652\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <iomanip>\\n#include <algorithm>\\nusing namespace std;\\nvoid solve(){\\n int n, q;\\n cin >> n;\\n vector<int> a(n);\\n for (int i = 0; i < n; i++) cin >> a[i];\\n sort(a.begin(), a.end());\\n cin >> q;\\n while (q--){\\n int x, v;\\n cin >> x >> v;\\n vector<vector<int> > dp(2 * x + 1, vector<int> (v + 1, 0));\\n dp[2 * x][v] = 1;\\n for (int i = 2 * x; i >= 0; i--){\\n for (int j = v; j >= 0; j--){\\n if (!dp[i][j]) continue;\\n for (int p = 0; p < n; p++){\\n if (i - 2 * j + a[p] < 0 || j - a[p] < 0) continue;\\n dp[i - 2 * j + a[p]][j - a[p]] = 1;\\n }\\n }\\n }\\n if (v * v > 2 * a[n - 1] * x){\\n cout << \\\"crash\\\" << endl;\\n continue;\\n }\\n if (dp[0][0]){\\n cout << \\\"perfect\\\" << endl;\\n continue;\\n }\\n double ans = -1;\\n for (int i = 1; i <= 2 * x; i++){\\n if (dp[i][0]){\\n ans = i;\\n break;\\n }\\n }\\n if (ans != -1){\\n cout << \\\"good \\\" << ans / 2 << endl;\\n continue;\\n }\\n cout << \\\"try again\\\" << endl;\\n }\\n}\\nint main() {\\n cout << fixed << setprecision(3);\\n int t;\\n cin >> t;\\n while (t--){\\n solve();\\n if (t > 0) cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3312,\n \"score_of_the_acc\": -1.2123,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2075_9659649\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <iomanip>\\n#include <algorithm>\\nusing namespace std;\\nvoid solve(){\\n int n, q;\\n cin >> n;\\n vector<int> a(n);\\n for (int i = 0; i < n; i++) cin >> a[i];\\n sort(a.begin(), a.end());\\n cin >> q;\\n while (q--){\\n int x, v;\\n cin >> x >> v;\\n vector<vector<int> > dp(2 * x + 1, vector<int> (v + 1, 0));\\n if (v * v > 2 * a[n - 1] * x){\\n cout << \\\"crash\\\" << endl;\\n continue;\\n }\\n dp[2 * x][v] = 1;\\n for (int i = 2 * x; i >= 0; i--){\\n for (int j = v; j >= 0; j--){\\n if (!dp[i][j]) continue;\\n for (int p = 0; p < n; p++){\\n if (i - 2 * j + a[p] < 0 || j - a[p] < 0) continue;\\n dp[i - 2 * j + a[p]][j - a[p]] = 1;\\n }\\n }\\n }\\n if (dp[0][0]){\\n cout << \\\"perfect\\\" << endl;\\n continue;\\n }\\n double ans = -1;\\n for (int i = 1; i <= 2 * x; i++){\\n if (dp[i][0]){\\n ans = i;\\n break;\\n }\\n }\\n if (ans != -1){\\n cout << \\\"good \\\" << ans / 2 << endl;\\n continue;\\n }\\n cout << \\\"try again\\\" << endl;\\n }\\n}\\nint main() {\\n cout << fixed << setprecision(3);\\n int t;\\n cin >> t;\\n while (t--){\\n solve();\\n if (t > 0) cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3392,\n \"score_of_the_acc\": -1.25,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2075_1667651\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#pragma warning(disable:4996)\\nusing namespace std;\\n\\ndouble eps = 1e-9;\\nint main() {\\n int A; cin >> A;\\n while (A--) {\\n int N; cin >> N;\\n vector<int>as;\\n for (int i = 0; i < N; ++i) {\\n int a; cin >> a;\\n as.push_back(a);\\n }\\n sort(as.begin(), as.end());\\n int Q; cin >> Q;\\n for (int t = 0; t< Q; ++t) {\\n int x, v; cin >> x >> v;\\n double stoptime = double(v) / as.back();\\n if (x + eps < stoptime*v / 2) {\\n cout << \\\"crash\\\" << endl;\\n }\\n else {\\n bool dp[201][101];\\n memset(dp, false, sizeof(dp));\\n dp[2 * x][v] = true;\\n for (int i = 2 * x; i >0; --i) {\\n for (int j = 1; j <= v; ++j) {\\n if (dp[i][j]) {\\n for (int k = 0; k < as.size(); ++k) {\\n int nextspeed = j - as[k];\\n if (nextspeed >= 0) {\\n if (i - j - nextspeed >= 0) {\\n dp[i - j - nextspeed][nextspeed] = true;\\n }\\n }\\n }\\n }\\n \\n }\\n }\\n int dis = 9999;\\n for (int i = 0; i <= 2 * x; ++i) {\\n if (dp[i][0]) {\\n dis = min(dis, i);\\n }\\n }\\n if (dis == 9999) {\\n cout << \\\"try again\\\" << endl;\\n }\\n else if (dis > 0) {\\n cout << setprecision(3) << fixed << \\\"good \\\";\\n printf(\\\"%.3f\\\", double(dis)/2);\\n cout << endl;\\n } \\n else {\\n cout << \\\"perfect\\\" << endl;\\n }\\n }\\n }\\n if (A)cout << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3144,\n \"score_of_the_acc\": -0.8832,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2075_474165\",\n \"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;\\nvector<int> a;\\n\\nstring solve(int x, int v)\\n{\\n if(v * v > x * (2 * a[n-1]))\\n return \\\"crash\\\";\\n\\n x *= 2;\\n vector<vector<bool> > dp(x+1, vector<bool>(v+1, false));\\n dp[x][v] = true;\\n\\n for(int i=x; i>=0; --i){\\n for(int j=v; j>=0; --j){\\n if(!dp[i][j])\\n continue;\\n for(int k=0; k<n; ++k){\\n int i2 = i - 2 * j + a[k];\\n int j2 = j - a[k];\\n if(i2 >= 0 && j2 >= 0)\\n dp[i2][j2] = true;\\n }\\n }\\n }\\n\\n if(dp[0][0])\\n return \\\"perfect\\\";\\n\\n for(int i=0; i<x; ++i){\\n if(dp[i][0]){\\n ostringstream oss;\\n oss << \\\"good \\\" << (i / 2);\\n if(i % 2 == 0)\\n oss << \\\".000\\\";\\n else\\n oss << \\\".500\\\";\\n return oss.str();\\n }\\n }\\n\\n return \\\"try again\\\";\\n}\\n\\nint main()\\n{\\n int c;\\n cin >> c;\\n\\n while(--c >= 0){\\n cin >> n;\\n a.resize(n);\\n for(int i=0; i<n; ++i)\\n cin >> a[i];\\n sort(a.begin(), a.end());\\n\\n int q;\\n cin >> q;\\n while(--q >= 0){\\n int x, v;\\n cin >> x >> v;\\n cout << solve(x, v) << endl;\\n }\\n\\n if(c > 0)\\n cout << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1268,\n \"score_of_the_acc\": -1,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":1099,"cells":{"group_id":{"kind":"string","value":"aoj_2071_cpp"},"problem_description":{"kind":"string","value":"Web 0.5\nIn a forest, there lived a spider named Tim. Tim was so smart that he created a huge, well-structured web.\nSurprisingly, his web forms a set of equilateral and concentric\nN\n-sided polygons whose edge lengths\nform an arithmetic sequence.\nFigure 1: An example web of Tim\nCorresponding vertices of the N-sided polygons lie on a straight line, each apart from neighboring ver-\ntices by distance 1. Neighboring vertices are connected by a thread (shown in the figure as solid lines),\non which Tim can walk (you may regard Tim as a point). Radial axes are numbered from 1 to\nN\nin a\nrotational order, so you can denote by (\nr\n,\ni\n) the vertex on axis\ni\nand apart from the center of the web by\ndistance\nr\n. You may consider the web as infinitely large, i.e. consisting of infinite number of\nN\n-sided\npolygons, since the web is so gigantic.\nTim’s web is thus marvelous, but currently has one problem: due to rainstorms, some of the threads are\ndamaged and Tim can’t walk on those parts.\nNow, a bug has been caught on the web. Thanks to the web having so organized a structure, Tim accu-\nrately figures out where the bug is, and heads out for that position. You, as a biologist, are interested in\nwhether Tim is smart enough to move through the shortest possible route. To judge that, however, you\nneed to know the length of the shortest route yourself, and thereby decided to write a program which\ncalculates that length.\nInput\nThe input consists of multiple test cases. Each test case begins with a line containing two integers\nN\n(3 ≤\nN\n≤ 100) and\nX\n(0 ≤\nX\n≤ 100), where\nN\nis as described above and\nX\ndenotes the number of\ndamaged threads. Next line contains four integers\nr\nS\n,\ni\nS\n,\nr\nT\n, and\ni\nT\n, meaning that Tim is starting at (\nr\nS\n,\ni\nS\n) and the bug is at (\nr\nT\n,\ni\nT\n). This line is followed by\nX\nlines, each containing four integers\nr\nA\n,\ni\nA\n,\nr\nB\n, and\ni\nB\n, meaning that a thread connecting (\nr\nA\n,\ni\nA\n) and (\nr\nB\n,\ni\nB\n) is damaged. Here (\nr\nA\n,\ni\nA\n) and (\nr\nB\n,\ni\nB\n) will be\nalways neighboring to each other. Also, for all vertices (\nr\n,\ni\n) given above, you may assume 1 ≤\nr\n≤ 10\n7\nand 1 ≤\ni\n≤\nN\n.\nThere will be at most 200 test cases. You may also assume that Tim is always able to reach where the\nbug is.\nThe input is terminated by a line containing two zeros.\nOutput\nFor each test case, print the length of the shortest route in a line. You may print any number of digits\nafter the decimal point, but the error must not be greater than 0.01.\nSample Input\n5 1\n2 1 3 2\n2 1 2 2\n0 0\nOutput for the Sample Input\n4.18"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2071_4823005","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\n#define SIZE 605\n\nint N,X;\n\nstruct Info{\n\tInfo(int arg_from_dist,int arg_from_line,int arg_to_dist,int arg_to_line){\n\t\tfrom_dist = arg_from_dist;\n\t\tfrom_line = arg_from_line;\n\t\tto_dist = arg_to_dist;\n\t\tto_line = arg_to_line;\n\t}\n\tint from_dist,from_line,to_dist,to_line;\n};\n\nstruct Info2{\n\tInfo2(int arg_to_index,int arg_to_line){\n\t\tto_index = arg_to_index;\n\t\tto_line = arg_to_line;\n\t}\n\tint to_index,to_line;\n};\n\nstruct Edge{\n\tEdge(int arg_to_index,int arg_to_line,double arg_cost){\n\t\tto_index = arg_to_index;\n\t\tto_line = arg_to_line;\n\t\tcost = arg_cost;\n\t}\n\tint to_index,to_line;\n\tdouble cost;\n};\n\nstruct State{\n\tState(int arg_layer_index,int arg_line,double arg_sum_dist){\n\t\tlayer_index = arg_layer_index;\n\t\tline = arg_line;\n\t\tsum_dist = arg_sum_dist;\n\t}\n\tbool operator<(const struct State &arg) const{\n\n\t\treturn sum_dist > arg.sum_dist; //総距離の昇順\n\t}\n\n\tint layer_index,line;\n\tdouble sum_dist;\n};\n\nint dist_table[SIZE];\nint start_dist,start_line;\nint goal_dist,goal_line;\nmap<int,int> MAP;\nvector<int> V;\ndouble min_dist[SIZE][105];\nvector<Edge> G[SIZE][105];\nvector<Info> info;\nvector<Info2> INFO[SIZE][105];\n\n\n//前後のレイヤを追加\nvoid add_dist(int dist){\n\n\tV.push_back(dist+1);\n\tif(dist > 1){\n\t\tV.push_back(dist-1);\n\t}\n}\n\n\nvoid func(){\n\n\tfor(int i = 0; i < SIZE; i++){\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tG[i][k].clear();\n\t\t\tINFO[i][k].clear();\n\t\t}\n\t}\n\tMAP.clear();\n\tV.clear();\n\tinfo.clear();\n\n\tV.push_back(1); //★★一番内側★★\n\n\tscanf(\"%d %d\",&start_dist,&start_line);\n\tstart_line--;\n\tscanf(\"%d %d\",&goal_dist,&goal_line);\n\tgoal_line--;\n\n\tV.push_back(start_dist);\n\tadd_dist(start_dist);\n\n\tV.push_back(goal_dist);\n\tadd_dist(goal_dist);\n\n\tint dist1,line1,dist2,line2;\n\n\tfor(int i = 0; i < X; i++){\n\n\t\tscanf(\"%d %d %d %d\",&dist1,&line1,&dist2,&line2);\n\t\tline1--;\n\t\tline2--;\n\n\t\tinfo.push_back(Info(dist1,line1,dist2,line2));\n\n\t\tif(dist1 == dist2){ //横\n\n\t\t\tV.push_back(dist1);\n\t\t\tadd_dist(dist1);\n\n\t\t}else{ //縦\n\n\t\t\tV.push_back(dist1);\n\t\t\tadd_dist(dist1);\n\n\t\t\tV.push_back(dist2);\n\t\t\tadd_dist(dist2);\n\t\t}\n\t}\n\n\tsort(V.begin(),V.end());\n\tV.erase(unique(V.begin(),V.end()),V.end());\n\n\tint num_layer = 0;\n\tint index;\n\n\tfor(int i = 0; i < V.size(); i++){\n\n\t\tMAP[V[i]] = num_layer;\n\t\tdist_table[num_layer++] = V[i];\n\t}\n\n\t//infoの仕分け\n\tfor(int i = 0; i < info.size(); i++){\n\n\t\tint from_index = MAP[info[i].from_dist];\n\t\tint to_index = MAP[info[i].to_dist];\n\t\tINFO[from_index][info[i].from_line].push_back(Info2(to_index,info[i].to_line));\n\t\tINFO[to_index][info[i].to_line].push_back(Info2(from_index,info[i].from_line));\n\t}\n\n\n\tint start_index = -1,goal_index = -1;\n\tfor(int i = 0; i < num_layer; i++){\n\t\tif(dist_table[i] == start_dist){\n\n\t\t\tstart_index = i;\n\t\t}\n\t\tif(dist_table[i] == goal_dist){\n\n\t\t\tgoal_index = i;\n\t\t}\n\t}\n\n\tdouble center_rad = 2*M_PI/(double)N; //多角形の中心角\n\n\t//隣接するノードにのみエッジを張る\n\tfor(int i = 0; i < num_layer; i++){\n\n\t\tdouble a = dist_table[i];\n\t\tdouble len = sqrt(2*a*a-2*a*a*cos(center_rad));\n\n\t\tint tmp_dist = dist_table[i];\n\n\t\t//同レイヤ\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\tint from = k;\n\t\t\tint to = (k+1)%N;\n\n\t\t\tbool FLG = true;\n\n\t\t\tfor(int p = 0; p < INFO[i][from].size(); p++){\n\t\t\t\tif(INFO[i][from][p].to_index == i && INFO[i][from][p].to_line == to){\n\n\t\t\t\t\tFLG = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!FLG)continue;\n\n\t\t\tG[i][from].push_back(Edge(i,to,len));\n\t\t\tG[i][to].push_back(Edge(i,from,len));\n\t\t}\n\n\t\tif(i == num_layer-1)continue;\n\n\t\t//次のレイヤと\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\tbool FLG = true;\n\n\t\t\tfor(int p = 0; p < INFO[i][k].size(); p++){\n\t\t\t\tif(INFO[i][k][p].to_index == i+1 && INFO[i][k][p].to_line == k){\n\n\t\t\t\t\tFLG = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!FLG)continue;\n\n\t\t\tint diff = dist_table[i+1]-dist_table[i];\n\n\t\t\tG[i][k].push_back(Edge(i+1,k,diff));\n\t\t\tG[i+1][k].push_back(Edge(i,k,diff));\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_layer; i++){\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\tmin_dist[i][k] = BIG_NUM;\n\t\t}\n\t}\n\n\tpriority_queue<State> Q;\n\tmin_dist[start_index][start_line] = 0;\n\tQ.push(State(start_index,start_line,0));\n\n\n\tint next_index,next_line;\n\tdouble next_cost;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.top().sum_dist > min_dist[Q.top().layer_index][Q.top().line]+EPS){\n\n\t\t\tQ.pop();\n\n\t\t}else if(Q.top().layer_index == goal_index && Q.top().line == goal_line){\n\n\t\t\tprintf(\"%.10lf\\n\",Q.top().sum_dist);\n\t\t\treturn;\n\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < G[Q.top().layer_index][Q.top().line].size(); i++){\n\n\t\t\t\tnext_index = G[Q.top().layer_index][Q.top().line][i].to_index;\n\t\t\t\tnext_line = G[Q.top().layer_index][Q.top().line][i].to_line;\n\t\t\t\tnext_cost = Q.top().sum_dist+ G[Q.top().layer_index][Q.top().line][i].cost;\n\n\t\t\t\tif(min_dist[next_index][next_line] > next_cost+EPS){\n\n\t\t\t\t\tmin_dist[next_index][next_line] = next_cost+EPS;\n\t\t\t\t\tQ.push(State(next_index,next_line,next_cost));\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\twhile(true){\n\n\t\tscanf(\"%d %d\",&N,&X);\n\t\tif(N == 0 && X == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":9564,"score_of_the_acc":-0.9568,"final_rank":7},{"submission_id":"aoj_2071_3117720","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <map>\n#include <set>\n#include <utility>\n#include <queue>\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()\ntypedef complex<double> P;\n\nstruct Pos{\n int r,i;\n Pos(int r, int i):r(r),i(i){}\n Pos(){}\n bool operator<(const Pos &a) const{\n return (r!=a.r)? r<a.r: i<a.i;\n }\n bool operator==(const Pos &a) const{\n return r==a.r && i==a.i;\n }\n};\n\nP convert(const Pos &pos, int n){\n double angle = 2*PI*pos.i/n;\n return P(pos.r, 0) *P(cos(angle), sin(angle));\n}\n\nint main(){\n while(1){\n int n,x;\n cin >> n >> x;\n if(n==0) break;\n\n Pos s,t;\n cin >> s.r >> s.i >> t.r >> t.i;\n s.i--; t.i--;\n set<pair<Pos, Pos> > ng;\n for(int i=0; i<x; i++){\n int rs,is,rt,it;\n cin >> rs >> is >> rt >> it;\n is--; it--;\n pair<Pos, Pos> edge(Pos(rs, is), Pos(rt, it));\n if(edge.second < edge.first){\n swap(edge.first, edge.second);\n }\n ng.insert(edge);\n }\n\n vector<int> rlist;\n rlist.push_back(s.r);\n rlist.push_back(t.r);\n rlist.push_back(1);\n for(const pair<Pos, Pos> &e: ng){\n rlist.push_back(e.first.r);\n rlist.push_back(e.second.r);\n }\n for(int i=rlist.size()-1; i>=0; i--){\n rlist.push_back(rlist[i]-1);\n rlist.push_back(rlist[i]+1);\n }\n sort(rlist.begin(), rlist.end());\n rlist.erase(unique(rlist.begin(), rlist.end()), rlist.end());\n rlist.erase(rlist.begin());\n rlist.push_back(1e8);\n\n map<Pos, vector<pair<Pos, double> > > adj;\n for(int i=0; i<(int)rlist.size()-1; i++){\n for(int j=0; j<n; j++){\n Pos curr(rlist[i], j);\n Pos next[2];\n next[0] = Pos(rlist[i], (j+1)%n);\n next[1] = Pos(rlist[i+1], j);\n for(int d=0; d<2; d++){\n pair<Pos, Pos> edge(curr, next[d]);\n if(edge.second < edge.first) swap(edge.first, edge.second);\n if(ng.find(edge) == ng.end()){\n double dist = abs(convert(curr, n) -convert(next[d], n));\n adj[curr].emplace_back(next[d], dist);\n adj[next[d]].emplace_back(curr, dist);\n }\n }\n }\n }\n\n priority_queue<pair<double, Pos> > wait;\n wait.push(make_pair(0, s));\n map<Pos, double> mincost;\n for(const auto &key: adj){\n mincost[key.first] = INF;\n }\n mincost[s] = 0;\n while(!wait.empty()){\n double dist = -wait.top().first;\n Pos pos = wait.top().second;\n wait.pop();\n if(dist > mincost[pos] +EPS) continue;\n if(pos == t) break;\n for(const auto &next: adj[pos]){\n double ndist = dist +next.second;\n Pos npos = next.first;\n if(ndist +EPS < mincost[npos]){\n mincost[npos] = ndist;\n wait.push(make_pair(-ndist, npos));\n }\n }\n }\n cout << fixed << setprecision(5);\n cout << mincost[t] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":310,"memory_kb":9932,"score_of_the_acc":-2,"final_rank":8},{"submission_id":"aoj_2071_2289642","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n#define all(v) begin(v), end(v)\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)\n\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\n\nusing pint = pair<int, int>;\nusing tint = tuple<int, int, int>;\nusing vint = vector<int>;\n\nconst int inf = 1LL << 55;\nconst int mod = 1e9 + 7;\n\nint N, X;\nint sr, sc, tr, tc;\nint ar[101], ac[101];\nint br[101], bc[101];\nvint R; // compress\nmap<int, int> mp; // uncompress\nset< pair<pint, pint> > st; // non-exist edge\n\ndouble base;\n\ndouble distance(int ar, int br) {\n return (ar == br ? (R[ar]+1)*base : abs(R[ar] - R[br]));\n}\n\ndouble mincost[808][101];\n\nusing State = tuple<double, int, int>;\n\nconst int dr[] = {0, 1, 0, -1};\nconst int dc[] = {1, 0, -1, 0};\n\ndouble dijkstra() {\n priority_queue<State, vector<State>, greater<State> > que;\n fill(mincost[0], mincost[808], DBL_MAX/2);\n que.emplace(0, sr, sc);\n mincost[sr][sc] = 0;\n while(!que.empty()) {\n double cost; int r, c;\n tie(cost, r, c) = que.top(); que.pop();\n if(mincost[r][c] < cost) continue;\n if(r == tr && c == tc) return cost;\n rep(i, 4) {\n int nr = r + dr[i], nc = (c+dc[i]+N)%N;\n if(nr < 0 || R.size() <= nr) continue;\n auto u = make_pair(r, c);\n auto v = make_pair(nr, nc);\n if(st.count(make_pair(u, v))) continue;\n double dist = cost + distance(r, nr);\n if(dist < mincost[nr][nc]) {\n\tmincost[nr][nc] = dist;\n\tque.emplace(dist, nr, nc);\n }\n }\n }\n return -1;\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 >> X, N) {\n cin >> sr >> sc >> tr >> tc;\n --sr, --sc, --tr, --tc;\n R.clear();\n R.push_back(0);\n R.push_back(sr);\n R.push_back(tr);\n rep(i, X) {\n cin >> ar[i] >> ac[i] >> br[i] >> bc[i];\n --ar[i], --ac[i], --br[i], --bc[i];\n if(ar[i]) R.push_back(ar[i]-1);\n R.push_back(ar[i]);\n R.push_back(ar[i]+1);\n if(br[i]) R.push_back(br[i]-1);\n R.push_back(br[i]);\n R.push_back(br[i]+1);\n }\n sort(all(R));\n R.erase(unique(all(R)), R.end());\n mp.clear();\n st.clear();\n rep(i, R.size()) mp[R[i]] = i;\n sr = mp[sr], tr = mp[tr];\n rep(i, X) {\n ar[i] = mp[ar[i]], br[i] = mp[br[i]];\n auto u = make_pair(ar[i], ac[i]);\n auto v = make_pair(br[i], bc[i]);\n st.emplace(u, v);\n st.emplace(v, u);\n }\n base = sqrt(2.0-2.0*cos(2.0*acos(-1)/(double)N));\n cout << dijkstra() << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4364,"score_of_the_acc":-0.3459,"final_rank":5},{"submission_id":"aoj_2071_800006","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <queue>\n#include <set>\n#include <cmath>\n#include <cstdio>\nusing namespace std;\n \nconst int MAXH = 400;\nconst int MAXW = 105;\nconst int MAXX = 101;\nconst double inf = 1e100;\nconst int di[] = {0,1,0,-1};\nconst int dj[] = {1,0,-1,0};\n \nint N, X;\nint si, sj, ti, tj;\nint pi[MAXX], pj[MAXX], qi[MAXX], qj[MAXX];\nvector<int> vi;\nmap<int,int> mi, rmi;\nint H;\nset<pair<pair<int,int>, pair<int,int> > > wall;\ndouble x;\n \nstruct State {\n int pi, pj;\n double cost;\n bool operator < (const State &s) const {\n return cost > s.cost;\n }\n};\ndouble cost[MAXH][MAXW];\n \ndouble getDist(int si, int sj, int ti, int tj) {\n if(si == ti) {\n return rmi[si] * x;\n } else {\n return abs(rmi[si]-rmi[ti]);\n }\n}\n \ndouble dijkstra(int si, int sj, int ti, int tj) {\n priority_queue<State> que;\n fill(cost[0], cost[MAXH], inf);\n que.push((State){si,sj,0.0});\n cost[si][sj] = 0.0;\n while(!que.empty()) {\n const State s = que.top();\n que.pop();\n if(cost[s.pi][s.pj] < s.cost) continue;\n if(s.pi == ti && s.pj == tj) return s.cost;\n for(int k = 0; k < 4; ++k) {\n State t = s;\n t.pi += di[k];\n t.pj = (t.pj + dj[k] + N) % N;\n if(t.pi >= H) continue;\n if(t.pi < 0) continue;\n if(wall.count(make_pair(make_pair(s.pi,s.pj),make_pair(t.pi,t.pj)))) continue;\n t.cost += getDist(s.pi, s.pj, t.pi, t.pj);\n if(cost[t.pi][t.pj] <= t.cost) continue;\n que.push(t);\n cost[t.pi][t.pj] = t.cost;\n }\n }\n return inf;\n}\n \nint main() {\n while(cin >> N >> X && (N|X)) {\n cin >> si >> sj >> ti >> tj;\n --sj; --tj;\n for(int i = 0; i < X; ++i) {\n cin >> pi[i] >> pj[i] >> qi[i] >> qj[i];\n --pj[i]; --qj[i];\n }\n\n vi.clear();\n vi.push_back(1);\n vi.push_back(si);\n vi.push_back(ti);\n for(int i = 0; i < X; ++i) {\n if(pi[i]-1 >= 1) vi.push_back(pi[i]-1);\n vi.push_back(pi[i]);\n vi.push_back(pi[i]+1);\n if(qi[i]-1 >= 1) vi.push_back(qi[i]-1);\n vi.push_back(qi[i]);\n vi.push_back(qi[i]+1);\n }\n sort(vi.begin(), vi.end());\n vi.erase(unique(vi.begin(), vi.end()), vi.end());\n \n mi.clear();\n rmi.clear();\n for(int i = 0; i < vi.size(); ++i) {\n mi[vi[i]] = i;\n rmi[i] = vi[i];\n }\n \n H = vi.size();\n si = mi[si];\n ti = mi[ti];\n for(int i = 0; i < X; ++i) {\n pi[i] = mi[pi[i]];\n qi[i] = mi[qi[i]];\n }\n \n wall.clear();\n for(int i = 0; i < X; ++i) {\n pair<pair<int,int>, pair<int,int> > p = make_pair(make_pair(pi[i],pj[i]),make_pair(qi[i],qj[i]));\n wall.insert(p);\n swap(p.first, p.second);\n wall.insert(p);\n }\n \n x = sqrt(2.0 - 2.0*cos(M_PI*2.0/(double)N));\n \n printf(\"%.2f\\n\", dijkstra(si, sj, ti, tj));\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1704,"score_of_the_acc":-0.1023,"final_rank":4},{"submission_id":"aoj_2071_538586","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 pair<int, int> P;\ntypedef pair<P, P> S;\ntypedef pair<double, P> state;\n\nint main(){\n int N, X;\n while(cin>>N>>X && N){\n set<int> r_set;\n r_set.insert(1); r_set.insert(2);\n set<S> damage;\n int sr, sp, gr, gp;\n cin>>sr>>sp>>gr>>gp;\n sp--; gp--;\n r_set.insert(sr);\n r_set.insert(gr);\n REP(i, X){\n int r1, p1, r2, p2;\n cin>>r1>>p1>>r2>>p2;\n p1--; p2--;\n damage.insert(S(P(r1, p1), P(r2, p2)));\n damage.insert(S(P(r2, p2), P(r1, p1)));\n r_set.insert(r1);\n r_set.insert(r2);\n r_set.insert(r1 + 1);\n r_set.insert(r2 + 1);\n if(r1 >= 2) r_set.insert(r1 - 1);\n else r_set.insert(2);\n if(r2 >= 2) r_set.insert(r2 - 1);\n else r_set.insert(2);\n }\n vector<int> rs(r_set.begin(), r_set.end());\n int R = rs.size();\n //double dist[1000][100] = {};\n //REP(i, R)REP(j, N) dist[i][j] = 1e16;\n bool dist[1000][100] = {};\n int s_ridx = lower_bound(rs.begin(), rs.end(), sr) - rs.begin();\n priority_queue<state, vector<state>, greater<state> > que;\n que.push(state(0, P(s_ridx, sp)));\n while(!que.empty()){\n state s = que.top(); que.pop();\n int r_idx = s.second.first;\n int p = s.second.second;\n double d = s.first;\n //printf(\"(rs[%d]=%d, %d) = %lf\\n\", r_idx, rs[r_idx], p, d);\n if(rs[r_idx] == gr && p == gp){\n printf(\"%.2lf\\n\", d);\n break;\n }\n //if(dist[r_idx][p] < d) continue;\n if(dist[r_idx][p]) continue; dist[r_idx][p] = true;\n REP(r, 4){\n if(r % 2){\n int nr_idx = r_idx + r - 2;\n double nd = d + abs(rs[nr_idx] - rs[r_idx]);\n /*\n if(nr_idx >= 0 && nr_idx < R && dist[nr_idx][p] > nd && !damage.count(S(P(rs[r_idx], p), P(rs[nr_idx], p)))){\n */\n if(nr_idx >= 0 && nr_idx < R && !dist[nr_idx][p] && !damage.count(S(P(rs[r_idx], p), P(rs[nr_idx], p)))){\n //dist[r_idx][np] = nd;\n que.push(state(nd, P(nr_idx, p)));\n }\n }else{\n int np = (p + r - 1 + N) % N;\n double nd = (double)d + 2.0 * rs[r_idx] * sin(M_PI/N);\n /*\n if(dist[r_idx][np] > nd && !damage.count(S(P(rs[r_idx], p), P(rs[r_idx], np)))){\n */\n if(!dist[r_idx][np] && !damage.count(S(P(rs[r_idx], p), P(rs[r_idx], np)))){\n //dist[r_idx][np] = nd;\n que.push(state(nd, P(r_idx, np)));\n }\n }\n }\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1420,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2071_538585","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 pair<int, int> P;\ntypedef pair<P, P> S;\ntypedef pair<double, P> state;\n\nint main(){\n int N, X;\n while(cin>>N>>X && N){\n set<int> r_set;\n r_set.insert(1); r_set.insert(2);\n set<S> damage;\n int sr, sp, gr, gp;\n cin>>sr>>sp>>gr>>gp;\n sp--; gp--;\n r_set.insert(sr);\n r_set.insert(gr);\n r_set.insert(sr + 1);\n r_set.insert(gr + 1);\n if(sr != 1) r_set.insert(sr);\n if(gr != 1) r_set.insert(gr);\n REP(i, X){\n int r1, p1, r2, p2;\n cin>>r1>>p1>>r2>>p2;\n p1--; p2--;\n damage.insert(S(P(r1, p1), P(r2, p2)));\n damage.insert(S(P(r2, p2), P(r1, p1)));\n r_set.insert(r1);\n r_set.insert(r2);\n r_set.insert(r1 + 1);\n r_set.insert(r2 + 1);\n if(r1 >= 2) r_set.insert(r1 - 1);\n else r_set.insert(2);\n if(r2 >= 2) r_set.insert(r2 - 1);\n else r_set.insert(2);\n }\n vector<int> rs(r_set.begin(), r_set.end());\n int R = rs.size();\n //double dist[1000][100] = {};\n //REP(i, R)REP(j, N) dist[i][j] = 1e16;\n bool dist[1000][100] = {};\n int s_ridx = lower_bound(rs.begin(), rs.end(), sr) - rs.begin();\n priority_queue<state, vector<state>, greater<state> > que;\n que.push(state(0, P(s_ridx, sp)));\n while(!que.empty()){\n state s = que.top(); que.pop();\n int r_idx = s.second.first;\n int p = s.second.second;\n double d = s.first;\n //printf(\"(rs[%d]=%d, %d) = %lf\\n\", r_idx, rs[r_idx], p, d);\n if(rs[r_idx] == gr && p == gp){\n printf(\"%.2lf\\n\", d);\n break;\n }\n //if(dist[r_idx][p] < d) continue;\n if(dist[r_idx][p]) continue; dist[r_idx][p] = true;\n REP(r, 4){\n if(r % 2){\n int nr_idx = r_idx + r - 2;\n double nd = d + abs(rs[nr_idx] - rs[r_idx]);\n /*\n if(nr_idx >= 0 && nr_idx < R && dist[nr_idx][p] > nd && !damage.count(S(P(rs[r_idx], p), P(rs[nr_idx], p)))){\n */\n if(nr_idx >= 0 && nr_idx < R && !dist[nr_idx][p] && !damage.count(S(P(rs[r_idx], p), P(rs[nr_idx], p)))){\n //dist[r_idx][np] = nd;\n que.push(state(nd, P(nr_idx, p)));\n }\n }else{\n int np = (p + r - 1 + N) % N;\n double nd = (double)d + 2.0 * rs[r_idx] * sin(M_PI/N);\n /*\n if(dist[r_idx][np] > nd && !damage.count(S(P(rs[r_idx], p), P(rs[r_idx], np)))){\n */\n if(!dist[r_idx][np] && !damage.count(S(P(rs[r_idx], p), P(rs[r_idx], np)))){\n //dist[r_idx][np] = nd;\n que.push(state(nd, P(r_idx, np)));\n }\n }\n }\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1420,"score_of_the_acc":-0.0345,"final_rank":2},{"submission_id":"aoj_2071_493711","code_snippet":"#include<cmath>\n#include<queue>\n#include<cstdio>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nconst double INF=1e77;\nconst double PI=acos(-1);\n\nstruct point{\n\tint r,i;\n\tbool operator==(const point &p)const{ return r==p.r && i==p.i; }\n};\n\nstruct edge{ int v; double cost; };\n\nint main(){\n\tfor(int n,m;scanf(\"%d%d\",&n,&m),n||m;){\n\t\tconst double COST=2*sin(PI/n); // 正 n 角形の一辺の長さ\n\n\t\tpoint s,t;\n\t\tscanf(\"%d%d%d%d\",&s.r,&s.i,&t.r,&t.i); s.i--; t.i--;\n\t\tpoint bad[100][2];\n\t\trep(i,m) rep(j,2) scanf(\"%d%d\",&bad[i][j].r,&bad[i][j].i), bad[i][j].i--;\n\n\t\tvector<int> R; // 候補となる頂点の r の値\n\t\tR.push_back(1);\n\t\tR.push_back(s.r);\n\t\tR.push_back(t.r);\n\t\trep(i,m) rep(j,2) {\n\t\t\tR.push_back(bad[i][j].r);\n\t\t\tR.push_back(bad[i][j].r+1);\n\t\t\tR.push_back(max(bad[i][j].r-1,1));\n\t\t}\n\t\tsort(R.begin(),R.end());\n\t\tR.erase(unique(R.begin(),R.end()),R.end());\n\n\t\tint N=n*R.size();\n\t\tstatic vector<edge> G[60300];\n\t\trep(u,N) G[u].clear();\n\t\trep(i,R.size()){\n\t\t\tint r=R[i];\n\t\t\trep(j,n){\n\t\t\t\t// 左\n\t\t\t\tbool ok=true;\n\t\t\t\trep(k,m){\n\t\t\t\t\tif(bad[k][0]==(point){r,j} && bad[k][1]==(point){r,(j-1+n)%n}\n\t\t\t\t\t|| bad[k][1]==(point){r,j} && bad[k][0]==(point){r,(j-1+n)%n}) ok=false;\n\t\t\t\t}\n\t\t\t\tif(ok){\n\t\t\t\t\tint u=n*i+j,v=n*i+(j-1+n)%n;\n\t\t\t\t\tG[u].push_back((edge){v,r*COST});\n\t\t\t\t\tG[v].push_back((edge){u,r*COST});\n\t\t\t\t}\n\n\t\t\t\t// 上\n\t\t\t\tif(i+1<R.size()){\n\t\t\t\t\tok=true;\n\t\t\t\t\tint r2=R[i+1];\n\t\t\t\t\trep(k,m){\n\t\t\t\t\t\tif(bad[k][0]==(point){r,j} && bad[k][1]==(point){r2,j}\n\t\t\t\t\t\t|| bad[k][1]==(point){r,j} && bad[k][0]==(point){r2,j}) ok=false;\n\t\t\t\t\t}\n\t\t\t\t\tif(ok){\n\t\t\t\t\t\tint u=n*i+j,v=n*(i+1)+j;\n\t\t\t\t\t\tG[u].push_back((edge){v,r2-r});\n\t\t\t\t\t\tG[v].push_back((edge){u,r2-r});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Dijkstra\n\t\tint s_id=n*(find(R.begin(),R.end(),s.r)-R.begin())+s.i;\n\t\tint t_id=n*(find(R.begin(),R.end(),t.r)-R.begin())+t.i;\n\t\tstatic double d[60300];\n\t\trep(u,N){\n\t\t\td[u]=(u==s_id?0:INF);\n\t\t}\n\t\tpriority_queue< pair<double,int> > Q; Q.push(make_pair(0,s_id));\n\t\twhile(!Q.empty()){\n\t\t\tdouble d_now=-Q.top().first;\n\t\t\tint u=Q.top().second; Q.pop();\n\n\t\t\tif(d_now>d[u]) continue;\n\n\t\t\trep(i,G[u].size()){\n\t\t\t\tedge e=G[u][i];\n\t\t\t\tif(d[e.v]>d[u]+e.cost){\n\t\t\t\t\td[e.v]=d[u]+e.cost;\n\t\t\t\t\tQ.push(make_pair(-d[e.v],e.v));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%.9f\\n\",d[t_id]);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":100,"memory_kb":5068,"score_of_the_acc":-0.7044,"final_rank":6},{"submission_id":"aoj_2071_473189","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 PI = acos(-1.0);\nconst double EPS = 1.0e-10;\nconst double INF = DBL_MAX / 1000;\n\nint main()\n{\n int _tmp = 0;\n\n for(;;){\n int n, x;\n cin >> n >> x;\n if(n == 0)\n return 0;\n\n int rStart, iStart, rGoal, iGoal;\n cin >> rStart >> iStart >> rGoal >> iGoal;\n \n vector<int> r1(x), i1(x), r2(x), i2(x);\n for(int j=0; j<x; ++j)\n cin >> r1[j] >> i1[j] >> r2[j] >> i2[j];\n\n // スタート、ゴール、失われた辺が位置する多角形と、その前後の多角形のみに注目\n // また、一番中央にある多角形にも注目する\n map<int, int> rIndex;\n rIndex[1];\n for(int j=0; j<3; ++j){\n rIndex[rStart - 1 + j];\n rIndex[rGoal - 1 + j];\n }\n for(int j=0; j<x; ++j){\n for(int k=0; k<3; ++k){\n rIndex[r1[j] - 1 + k];\n rIndex[r2[j] - 1 + k];\n }\n }\n if(rIndex.begin()->first == 0)\n rIndex.erase(rIndex.begin());\n\n int m = 0; // 注目する多角形の数\n vector<int> rPos; // 注目する多角形の位置\n for(map<int, int>::iterator it=rIndex.begin(); it!=rIndex.end(); ++it){\n it->second = m;\n ++ m;\n rPos.push_back(it->first);\n }\n\n set<pair<pair<int, int>, pair<int, int> > > damage;\n for(int j=0; j<x; ++j){\n damage.insert(make_pair(make_pair(rIndex[r1[j]], i1[j]), make_pair(rIndex[r2[j]], i2[j])));\n damage.insert(make_pair(make_pair(rIndex[r2[j]], i2[j]), make_pair(rIndex[r1[j]], i1[j])));\n }\n\n vector<vector<double> > minDist(m, vector<double>(n+1, INF));\n minDist[rIndex[rStart]][iStart] = 0.0;\n multimap<double, pair<int, int> > mm;\n mm.insert(make_pair(0.0, make_pair(rIndex[rStart], iStart)));\n\n for(;;){\n double dist0 = mm.begin()->first;\n int r0 = mm.begin()->second.first;\n int i0 = mm.begin()->second.second;\n mm.erase(mm.begin());\n if(dist0 > minDist[r0][i0] + EPS)\n continue;\n\n if(r0 == rIndex[rGoal] && i0 == iGoal){\n printf(\"%.10f\\n\", dist0);\n break;\n }\n\n for(int j=0; j<4; ++j){\n double dist = dist0;\n int r = r0;\n int i = i0;\n if(j % 2 == 0){\n r = r - 1 + j;\n if(r == -1 || r == m)\n continue;\n dist += abs(rPos[r] - rPos[r0]);\n }else{\n i = (i - 3 + j + n) % n + 1;\n dist += rPos[r] * sin(PI / n) * 2.0;\n }\n\n if(damage.find(make_pair(make_pair(r0, i0), make_pair(r, i))) != damage.end())\n continue;\n\n if(dist < minDist[r][i] - EPS){\n minDist[r][i] = dist;\n mm.insert(make_pair(dist, make_pair(r, i)));\n }\n }\n }\n }\n}","accuracy":1,"time_ms":30,"memory_kb":1588,"score_of_the_acc":-0.0542,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_2071_4823005\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 605\\n\\nint N,X;\\n\\nstruct Info{\\n\\tInfo(int arg_from_dist,int arg_from_line,int arg_to_dist,int arg_to_line){\\n\\t\\tfrom_dist = arg_from_dist;\\n\\t\\tfrom_line = arg_from_line;\\n\\t\\tto_dist = arg_to_dist;\\n\\t\\tto_line = arg_to_line;\\n\\t}\\n\\tint from_dist,from_line,to_dist,to_line;\\n};\\n\\nstruct Info2{\\n\\tInfo2(int arg_to_index,int arg_to_line){\\n\\t\\tto_index = arg_to_index;\\n\\t\\tto_line = arg_to_line;\\n\\t}\\n\\tint to_index,to_line;\\n};\\n\\nstruct Edge{\\n\\tEdge(int arg_to_index,int arg_to_line,double arg_cost){\\n\\t\\tto_index = arg_to_index;\\n\\t\\tto_line = arg_to_line;\\n\\t\\tcost = arg_cost;\\n\\t}\\n\\tint to_index,to_line;\\n\\tdouble cost;\\n};\\n\\nstruct State{\\n\\tState(int arg_layer_index,int arg_line,double arg_sum_dist){\\n\\t\\tlayer_index = arg_layer_index;\\n\\t\\tline = arg_line;\\n\\t\\tsum_dist = arg_sum_dist;\\n\\t}\\n\\tbool operator<(const struct State &arg) const{\\n\\n\\t\\treturn sum_dist > arg.sum_dist; //総距離の昇順\\n\\t}\\n\\n\\tint layer_index,line;\\n\\tdouble sum_dist;\\n};\\n\\nint dist_table[SIZE];\\nint start_dist,start_line;\\nint goal_dist,goal_line;\\nmap<int,int> MAP;\\nvector<int> V;\\ndouble min_dist[SIZE][105];\\nvector<Edge> G[SIZE][105];\\nvector<Info> info;\\nvector<Info2> INFO[SIZE][105];\\n\\n\\n//前後のレイヤを追加\\nvoid add_dist(int dist){\\n\\n\\tV.push_back(dist+1);\\n\\tif(dist > 1){\\n\\t\\tV.push_back(dist-1);\\n\\t}\\n}\\n\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tG[i][k].clear();\\n\\t\\t\\tINFO[i][k].clear();\\n\\t\\t}\\n\\t}\\n\\tMAP.clear();\\n\\tV.clear();\\n\\tinfo.clear();\\n\\n\\tV.push_back(1); //★★一番内側★★\\n\\n\\tscanf(\\\"%d %d\\\",&start_dist,&start_line);\\n\\tstart_line--;\\n\\tscanf(\\\"%d %d\\\",&goal_dist,&goal_line);\\n\\tgoal_line--;\\n\\n\\tV.push_back(start_dist);\\n\\tadd_dist(start_dist);\\n\\n\\tV.push_back(goal_dist);\\n\\tadd_dist(goal_dist);\\n\\n\\tint dist1,line1,dist2,line2;\\n\\n\\tfor(int i = 0; i < X; i++){\\n\\n\\t\\tscanf(\\\"%d %d %d %d\\\",&dist1,&line1,&dist2,&line2);\\n\\t\\tline1--;\\n\\t\\tline2--;\\n\\n\\t\\tinfo.push_back(Info(dist1,line1,dist2,line2));\\n\\n\\t\\tif(dist1 == dist2){ //横\\n\\n\\t\\t\\tV.push_back(dist1);\\n\\t\\t\\tadd_dist(dist1);\\n\\n\\t\\t}else{ //縦\\n\\n\\t\\t\\tV.push_back(dist1);\\n\\t\\t\\tadd_dist(dist1);\\n\\n\\t\\t\\tV.push_back(dist2);\\n\\t\\t\\tadd_dist(dist2);\\n\\t\\t}\\n\\t}\\n\\n\\tsort(V.begin(),V.end());\\n\\tV.erase(unique(V.begin(),V.end()),V.end());\\n\\n\\tint num_layer = 0;\\n\\tint index;\\n\\n\\tfor(int i = 0; i < V.size(); i++){\\n\\n\\t\\tMAP[V[i]] = num_layer;\\n\\t\\tdist_table[num_layer++] = V[i];\\n\\t}\\n\\n\\t//infoの仕分け\\n\\tfor(int i = 0; i < info.size(); i++){\\n\\n\\t\\tint from_index = MAP[info[i].from_dist];\\n\\t\\tint to_index = MAP[info[i].to_dist];\\n\\t\\tINFO[from_index][info[i].from_line].push_back(Info2(to_index,info[i].to_line));\\n\\t\\tINFO[to_index][info[i].to_line].push_back(Info2(from_index,info[i].from_line));\\n\\t}\\n\\n\\n\\tint start_index = -1,goal_index = -1;\\n\\tfor(int i = 0; i < num_layer; i++){\\n\\t\\tif(dist_table[i] == start_dist){\\n\\n\\t\\t\\tstart_index = i;\\n\\t\\t}\\n\\t\\tif(dist_table[i] == goal_dist){\\n\\n\\t\\t\\tgoal_index = i;\\n\\t\\t}\\n\\t}\\n\\n\\tdouble center_rad = 2*M_PI/(double)N; //多角形の中心角\\n\\n\\t//隣接するノードにのみエッジを張る\\n\\tfor(int i = 0; i < num_layer; i++){\\n\\n\\t\\tdouble a = dist_table[i];\\n\\t\\tdouble len = sqrt(2*a*a-2*a*a*cos(center_rad));\\n\\n\\t\\tint tmp_dist = dist_table[i];\\n\\n\\t\\t//同レイヤ\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\tint from = k;\\n\\t\\t\\tint to = (k+1)%N;\\n\\n\\t\\t\\tbool FLG = true;\\n\\n\\t\\t\\tfor(int p = 0; p < INFO[i][from].size(); p++){\\n\\t\\t\\t\\tif(INFO[i][from][p].to_index == i && INFO[i][from][p].to_line == to){\\n\\n\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\tG[i][from].push_back(Edge(i,to,len));\\n\\t\\t\\tG[i][to].push_back(Edge(i,from,len));\\n\\t\\t}\\n\\n\\t\\tif(i == num_layer-1)continue;\\n\\n\\t\\t//次のレイヤと\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\tbool FLG = true;\\n\\n\\t\\t\\tfor(int p = 0; p < INFO[i][k].size(); p++){\\n\\t\\t\\t\\tif(INFO[i][k][p].to_index == i+1 && INFO[i][k][p].to_line == k){\\n\\n\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\tint diff = dist_table[i+1]-dist_table[i];\\n\\n\\t\\t\\tG[i][k].push_back(Edge(i+1,k,diff));\\n\\t\\t\\tG[i+1][k].push_back(Edge(i,k,diff));\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_layer; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\tmin_dist[i][k] = BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tpriority_queue<State> Q;\\n\\tmin_dist[start_index][start_line] = 0;\\n\\tQ.push(State(start_index,start_line,0));\\n\\n\\n\\tint next_index,next_line;\\n\\tdouble next_cost;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif(Q.top().sum_dist > min_dist[Q.top().layer_index][Q.top().line]+EPS){\\n\\n\\t\\t\\tQ.pop();\\n\\n\\t\\t}else if(Q.top().layer_index == goal_index && Q.top().line == goal_line){\\n\\n\\t\\t\\tprintf(\\\"%.10lf\\\\n\\\",Q.top().sum_dist);\\n\\t\\t\\treturn;\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i < G[Q.top().layer_index][Q.top().line].size(); i++){\\n\\n\\t\\t\\t\\tnext_index = G[Q.top().layer_index][Q.top().line][i].to_index;\\n\\t\\t\\t\\tnext_line = G[Q.top().layer_index][Q.top().line][i].to_line;\\n\\t\\t\\t\\tnext_cost = Q.top().sum_dist+ G[Q.top().layer_index][Q.top().line][i].cost;\\n\\n\\t\\t\\t\\tif(min_dist[next_index][next_line] > next_cost+EPS){\\n\\n\\t\\t\\t\\t\\tmin_dist[next_index][next_line] = next_cost+EPS;\\n\\t\\t\\t\\t\\tQ.push(State(next_index,next_line,next_cost));\\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\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&N,&X);\\n\\t\\tif(N == 0 && X == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 9564,\n \"score_of_the_acc\": -0.9568,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2071_3117720\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <map>\\n#include <set>\\n#include <utility>\\n#include <queue>\\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()\\ntypedef complex<double> P;\\n\\nstruct Pos{\\n int r,i;\\n Pos(int r, int i):r(r),i(i){}\\n Pos(){}\\n bool operator<(const Pos &a) const{\\n return (r!=a.r)? r<a.r: i<a.i;\\n }\\n bool operator==(const Pos &a) const{\\n return r==a.r && i==a.i;\\n }\\n};\\n\\nP convert(const Pos &pos, int n){\\n double angle = 2*PI*pos.i/n;\\n return P(pos.r, 0) *P(cos(angle), sin(angle));\\n}\\n\\nint main(){\\n while(1){\\n int n,x;\\n cin >> n >> x;\\n if(n==0) break;\\n\\n Pos s,t;\\n cin >> s.r >> s.i >> t.r >> t.i;\\n s.i--; t.i--;\\n set<pair<Pos, Pos> > ng;\\n for(int i=0; i<x; i++){\\n int rs,is,rt,it;\\n cin >> rs >> is >> rt >> it;\\n is--; it--;\\n pair<Pos, Pos> edge(Pos(rs, is), Pos(rt, it));\\n if(edge.second < edge.first){\\n swap(edge.first, edge.second);\\n }\\n ng.insert(edge);\\n }\\n\\n vector<int> rlist;\\n rlist.push_back(s.r);\\n rlist.push_back(t.r);\\n rlist.push_back(1);\\n for(const pair<Pos, Pos> &e: ng){\\n rlist.push_back(e.first.r);\\n rlist.push_back(e.second.r);\\n }\\n for(int i=rlist.size()-1; i>=0; i--){\\n rlist.push_back(rlist[i]-1);\\n rlist.push_back(rlist[i]+1);\\n }\\n sort(rlist.begin(), rlist.end());\\n rlist.erase(unique(rlist.begin(), rlist.end()), rlist.end());\\n rlist.erase(rlist.begin());\\n rlist.push_back(1e8);\\n\\n map<Pos, vector<pair<Pos, double> > > adj;\\n for(int i=0; i<(int)rlist.size()-1; i++){\\n for(int j=0; j<n; j++){\\n Pos curr(rlist[i], j);\\n Pos next[2];\\n next[0] = Pos(rlist[i], (j+1)%n);\\n next[1] = Pos(rlist[i+1], j);\\n for(int d=0; d<2; d++){\\n pair<Pos, Pos> edge(curr, next[d]);\\n if(edge.second < edge.first) swap(edge.first, edge.second);\\n if(ng.find(edge) == ng.end()){\\n double dist = abs(convert(curr, n) -convert(next[d], n));\\n adj[curr].emplace_back(next[d], dist);\\n adj[next[d]].emplace_back(curr, dist);\\n }\\n }\\n }\\n }\\n\\n priority_queue<pair<double, Pos> > wait;\\n wait.push(make_pair(0, s));\\n map<Pos, double> mincost;\\n for(const auto &key: adj){\\n mincost[key.first] = INF;\\n }\\n mincost[s] = 0;\\n while(!wait.empty()){\\n double dist = -wait.top().first;\\n Pos pos = wait.top().second;\\n wait.pop();\\n if(dist > mincost[pos] +EPS) continue;\\n if(pos == t) break;\\n for(const auto &next: adj[pos]){\\n double ndist = dist +next.second;\\n Pos npos = next.first;\\n if(ndist +EPS < mincost[npos]){\\n mincost[npos] = ndist;\\n wait.push(make_pair(-ndist, npos));\\n }\\n }\\n }\\n cout << fixed << setprecision(5);\\n cout << mincost[t] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 9932,\n \"score_of_the_acc\": -2,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2071_2289642\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define all(v) begin(v), end(v)\\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\\n#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)\\n\\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\\n\\nusing pint = pair<int, int>;\\nusing tint = tuple<int, int, int>;\\nusing vint = vector<int>;\\n\\nconst int inf = 1LL << 55;\\nconst int mod = 1e9 + 7;\\n\\nint N, X;\\nint sr, sc, tr, tc;\\nint ar[101], ac[101];\\nint br[101], bc[101];\\nvint R; // compress\\nmap<int, int> mp; // uncompress\\nset< pair<pint, pint> > st; // non-exist edge\\n\\ndouble base;\\n\\ndouble distance(int ar, int br) {\\n return (ar == br ? (R[ar]+1)*base : abs(R[ar] - R[br]));\\n}\\n\\ndouble mincost[808][101];\\n\\nusing State = tuple<double, int, int>;\\n\\nconst int dr[] = {0, 1, 0, -1};\\nconst int dc[] = {1, 0, -1, 0};\\n\\ndouble dijkstra() {\\n priority_queue<State, vector<State>, greater<State> > que;\\n fill(mincost[0], mincost[808], DBL_MAX/2);\\n que.emplace(0, sr, sc);\\n mincost[sr][sc] = 0;\\n while(!que.empty()) {\\n double cost; int r, c;\\n tie(cost, r, c) = que.top(); que.pop();\\n if(mincost[r][c] < cost) continue;\\n if(r == tr && c == tc) return cost;\\n rep(i, 4) {\\n int nr = r + dr[i], nc = (c+dc[i]+N)%N;\\n if(nr < 0 || R.size() <= nr) continue;\\n auto u = make_pair(r, c);\\n auto v = make_pair(nr, nc);\\n if(st.count(make_pair(u, v))) continue;\\n double dist = cost + distance(r, nr);\\n if(dist < mincost[nr][nc]) {\\n\\tmincost[nr][nc] = dist;\\n\\tque.emplace(dist, nr, nc);\\n }\\n }\\n }\\n return -1;\\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 >> X, N) {\\n cin >> sr >> sc >> tr >> tc;\\n --sr, --sc, --tr, --tc;\\n R.clear();\\n R.push_back(0);\\n R.push_back(sr);\\n R.push_back(tr);\\n rep(i, X) {\\n cin >> ar[i] >> ac[i] >> br[i] >> bc[i];\\n --ar[i], --ac[i], --br[i], --bc[i];\\n if(ar[i]) R.push_back(ar[i]-1);\\n R.push_back(ar[i]);\\n R.push_back(ar[i]+1);\\n if(br[i]) R.push_back(br[i]-1);\\n R.push_back(br[i]);\\n R.push_back(br[i]+1);\\n }\\n sort(all(R));\\n R.erase(unique(all(R)), R.end());\\n mp.clear();\\n st.clear();\\n rep(i, R.size()) mp[R[i]] = i;\\n sr = mp[sr], tr = mp[tr];\\n rep(i, X) {\\n ar[i] = mp[ar[i]], br[i] = mp[br[i]];\\n auto u = make_pair(ar[i], ac[i]);\\n auto v = make_pair(br[i], bc[i]);\\n st.emplace(u, v);\\n st.emplace(v, u);\\n }\\n base = sqrt(2.0-2.0*cos(2.0*acos(-1)/(double)N));\\n cout << dijkstra() << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4364,\n \"score_of_the_acc\": -0.3459,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2071_800006\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <cmath>\\n#include <cstdio>\\nusing namespace std;\\n \\nconst int MAXH = 400;\\nconst int MAXW = 105;\\nconst int MAXX = 101;\\nconst double inf = 1e100;\\nconst int di[] = {0,1,0,-1};\\nconst int dj[] = {1,0,-1,0};\\n \\nint N, X;\\nint si, sj, ti, tj;\\nint pi[MAXX], pj[MAXX], qi[MAXX], qj[MAXX];\\nvector<int> vi;\\nmap<int,int> mi, rmi;\\nint H;\\nset<pair<pair<int,int>, pair<int,int> > > wall;\\ndouble x;\\n \\nstruct State {\\n int pi, pj;\\n double cost;\\n bool operator < (const State &s) const {\\n return cost > s.cost;\\n }\\n};\\ndouble cost[MAXH][MAXW];\\n \\ndouble getDist(int si, int sj, int ti, int tj) {\\n if(si == ti) {\\n return rmi[si] * x;\\n } else {\\n return abs(rmi[si]-rmi[ti]);\\n }\\n}\\n \\ndouble dijkstra(int si, int sj, int ti, int tj) {\\n priority_queue<State> que;\\n fill(cost[0], cost[MAXH], inf);\\n que.push((State){si,sj,0.0});\\n cost[si][sj] = 0.0;\\n while(!que.empty()) {\\n const State s = que.top();\\n que.pop();\\n if(cost[s.pi][s.pj] < s.cost) continue;\\n if(s.pi == ti && s.pj == tj) return s.cost;\\n for(int k = 0; k < 4; ++k) {\\n State t = s;\\n t.pi += di[k];\\n t.pj = (t.pj + dj[k] + N) % N;\\n if(t.pi >= H) continue;\\n if(t.pi < 0) continue;\\n if(wall.count(make_pair(make_pair(s.pi,s.pj),make_pair(t.pi,t.pj)))) continue;\\n t.cost += getDist(s.pi, s.pj, t.pi, t.pj);\\n if(cost[t.pi][t.pj] <= t.cost) continue;\\n que.push(t);\\n cost[t.pi][t.pj] = t.cost;\\n }\\n }\\n return inf;\\n}\\n \\nint main() {\\n while(cin >> N >> X && (N|X)) {\\n cin >> si >> sj >> ti >> tj;\\n --sj; --tj;\\n for(int i = 0; i < X; ++i) {\\n cin >> pi[i] >> pj[i] >> qi[i] >> qj[i];\\n --pj[i]; --qj[i];\\n }\\n\\n vi.clear();\\n vi.push_back(1);\\n vi.push_back(si);\\n vi.push_back(ti);\\n for(int i = 0; i < X; ++i) {\\n if(pi[i]-1 >= 1) vi.push_back(pi[i]-1);\\n vi.push_back(pi[i]);\\n vi.push_back(pi[i]+1);\\n if(qi[i]-1 >= 1) vi.push_back(qi[i]-1);\\n vi.push_back(qi[i]);\\n vi.push_back(qi[i]+1);\\n }\\n sort(vi.begin(), vi.end());\\n vi.erase(unique(vi.begin(), vi.end()), vi.end());\\n \\n mi.clear();\\n rmi.clear();\\n for(int i = 0; i < vi.size(); ++i) {\\n mi[vi[i]] = i;\\n rmi[i] = vi[i];\\n }\\n \\n H = vi.size();\\n si = mi[si];\\n ti = mi[ti];\\n for(int i = 0; i < X; ++i) {\\n pi[i] = mi[pi[i]];\\n qi[i] = mi[qi[i]];\\n }\\n \\n wall.clear();\\n for(int i = 0; i < X; ++i) {\\n pair<pair<int,int>, pair<int,int> > p = make_pair(make_pair(pi[i],pj[i]),make_pair(qi[i],qj[i]));\\n wall.insert(p);\\n swap(p.first, p.second);\\n wall.insert(p);\\n }\\n \\n x = sqrt(2.0 - 2.0*cos(M_PI*2.0/(double)N));\\n \\n printf(\\\"%.2f\\\\n\\\", dijkstra(si, sj, ti, tj));\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1704,\n \"score_of_the_acc\": -0.1023,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2071_538586\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\\\" \\\"; cerr<<endl; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\ntypedef pair<int, int> P;\\ntypedef pair<P, P> S;\\ntypedef pair<double, P> state;\\n\\nint main(){\\n int N, X;\\n while(cin>>N>>X && N){\\n set<int> r_set;\\n r_set.insert(1); r_set.insert(2);\\n set<S> damage;\\n int sr, sp, gr, gp;\\n cin>>sr>>sp>>gr>>gp;\\n sp--; gp--;\\n r_set.insert(sr);\\n r_set.insert(gr);\\n REP(i, X){\\n int r1, p1, r2, p2;\\n cin>>r1>>p1>>r2>>p2;\\n p1--; p2--;\\n damage.insert(S(P(r1, p1), P(r2, p2)));\\n damage.insert(S(P(r2, p2), P(r1, p1)));\\n r_set.insert(r1);\\n r_set.insert(r2);\\n r_set.insert(r1 + 1);\\n r_set.insert(r2 + 1);\\n if(r1 >= 2) r_set.insert(r1 - 1);\\n else r_set.insert(2);\\n if(r2 >= 2) r_set.insert(r2 - 1);\\n else r_set.insert(2);\\n }\\n vector<int> rs(r_set.begin(), r_set.end());\\n int R = rs.size();\\n //double dist[1000][100] = {};\\n //REP(i, R)REP(j, N) dist[i][j] = 1e16;\\n bool dist[1000][100] = {};\\n int s_ridx = lower_bound(rs.begin(), rs.end(), sr) - rs.begin();\\n priority_queue<state, vector<state>, greater<state> > que;\\n que.push(state(0, P(s_ridx, sp)));\\n while(!que.empty()){\\n state s = que.top(); que.pop();\\n int r_idx = s.second.first;\\n int p = s.second.second;\\n double d = s.first;\\n //printf(\\\"(rs[%d]=%d, %d) = %lf\\\\n\\\", r_idx, rs[r_idx], p, d);\\n if(rs[r_idx] == gr && p == gp){\\n printf(\\\"%.2lf\\\\n\\\", d);\\n break;\\n }\\n //if(dist[r_idx][p] < d) continue;\\n if(dist[r_idx][p]) continue; dist[r_idx][p] = true;\\n REP(r, 4){\\n if(r % 2){\\n int nr_idx = r_idx + r - 2;\\n double nd = d + abs(rs[nr_idx] - rs[r_idx]);\\n /*\\n if(nr_idx >= 0 && nr_idx < R && dist[nr_idx][p] > nd && !damage.count(S(P(rs[r_idx], p), P(rs[nr_idx], p)))){\\n */\\n if(nr_idx >= 0 && nr_idx < R && !dist[nr_idx][p] && !damage.count(S(P(rs[r_idx], p), P(rs[nr_idx], p)))){\\n //dist[r_idx][np] = nd;\\n que.push(state(nd, P(nr_idx, p)));\\n }\\n }else{\\n int np = (p + r - 1 + N) % N;\\n double nd = (double)d + 2.0 * rs[r_idx] * sin(M_PI/N);\\n /*\\n if(dist[r_idx][np] > nd && !damage.count(S(P(rs[r_idx], p), P(rs[r_idx], np)))){\\n */\\n if(!dist[r_idx][np] && !damage.count(S(P(rs[r_idx], p), P(rs[r_idx], np)))){\\n //dist[r_idx][np] = nd;\\n que.push(state(nd, P(r_idx, np)));\\n }\\n }\\n }\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1420,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2071_538585\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\\\" \\\"; cerr<<endl; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\ntypedef pair<int, int> P;\\ntypedef pair<P, P> S;\\ntypedef pair<double, P> state;\\n\\nint main(){\\n int N, X;\\n while(cin>>N>>X && N){\\n set<int> r_set;\\n r_set.insert(1); r_set.insert(2);\\n set<S> damage;\\n int sr, sp, gr, gp;\\n cin>>sr>>sp>>gr>>gp;\\n sp--; gp--;\\n r_set.insert(sr);\\n r_set.insert(gr);\\n r_set.insert(sr + 1);\\n r_set.insert(gr + 1);\\n if(sr != 1) r_set.insert(sr);\\n if(gr != 1) r_set.insert(gr);\\n REP(i, X){\\n int r1, p1, r2, p2;\\n cin>>r1>>p1>>r2>>p2;\\n p1--; p2--;\\n damage.insert(S(P(r1, p1), P(r2, p2)));\\n damage.insert(S(P(r2, p2), P(r1, p1)));\\n r_set.insert(r1);\\n r_set.insert(r2);\\n r_set.insert(r1 + 1);\\n r_set.insert(r2 + 1);\\n if(r1 >= 2) r_set.insert(r1 - 1);\\n else r_set.insert(2);\\n if(r2 >= 2) r_set.insert(r2 - 1);\\n else r_set.insert(2);\\n }\\n vector<int> rs(r_set.begin(), r_set.end());\\n int R = rs.size();\\n //double dist[1000][100] = {};\\n //REP(i, R)REP(j, N) dist[i][j] = 1e16;\\n bool dist[1000][100] = {};\\n int s_ridx = lower_bound(rs.begin(), rs.end(), sr) - rs.begin();\\n priority_queue<state, vector<state>, greater<state> > que;\\n que.push(state(0, P(s_ridx, sp)));\\n while(!que.empty()){\\n state s = que.top(); que.pop();\\n int r_idx = s.second.first;\\n int p = s.second.second;\\n double d = s.first;\\n //printf(\\\"(rs[%d]=%d, %d) = %lf\\\\n\\\", r_idx, rs[r_idx], p, d);\\n if(rs[r_idx] == gr && p == gp){\\n printf(\\\"%.2lf\\\\n\\\", d);\\n break;\\n }\\n //if(dist[r_idx][p] < d) continue;\\n if(dist[r_idx][p]) continue; dist[r_idx][p] = true;\\n REP(r, 4){\\n if(r % 2){\\n int nr_idx = r_idx + r - 2;\\n double nd = d + abs(rs[nr_idx] - rs[r_idx]);\\n /*\\n if(nr_idx >= 0 && nr_idx < R && dist[nr_idx][p] > nd && !damage.count(S(P(rs[r_idx], p), P(rs[nr_idx], p)))){\\n */\\n if(nr_idx >= 0 && nr_idx < R && !dist[nr_idx][p] && !damage.count(S(P(rs[r_idx], p), P(rs[nr_idx], p)))){\\n //dist[r_idx][np] = nd;\\n que.push(state(nd, P(nr_idx, p)));\\n }\\n }else{\\n int np = (p + r - 1 + N) % N;\\n double nd = (double)d + 2.0 * rs[r_idx] * sin(M_PI/N);\\n /*\\n if(dist[r_idx][np] > nd && !damage.count(S(P(rs[r_idx], p), P(rs[r_idx], np)))){\\n */\\n if(!dist[r_idx][np] && !damage.count(S(P(rs[r_idx], p), P(rs[r_idx], np)))){\\n //dist[r_idx][np] = nd;\\n que.push(state(nd, P(r_idx, np)));\\n }\\n }\\n }\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1420,\n \"score_of_the_acc\": -0.0345,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2071_493711\",\n \"code_snippet\": \"#include<cmath>\\n#include<queue>\\n#include<cstdio>\\n#include<algorithm>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nconst double INF=1e77;\\nconst double PI=acos(-1);\\n\\nstruct point{\\n\\tint r,i;\\n\\tbool operator==(const point &p)const{ return r==p.r && i==p.i; }\\n};\\n\\nstruct edge{ int v; double cost; };\\n\\nint main(){\\n\\tfor(int n,m;scanf(\\\"%d%d\\\",&n,&m),n||m;){\\n\\t\\tconst double COST=2*sin(PI/n); // 正 n 角形の一辺の長さ\\n\\n\\t\\tpoint s,t;\\n\\t\\tscanf(\\\"%d%d%d%d\\\",&s.r,&s.i,&t.r,&t.i); s.i--; t.i--;\\n\\t\\tpoint bad[100][2];\\n\\t\\trep(i,m) rep(j,2) scanf(\\\"%d%d\\\",&bad[i][j].r,&bad[i][j].i), bad[i][j].i--;\\n\\n\\t\\tvector<int> R; // 候補となる頂点の r の値\\n\\t\\tR.push_back(1);\\n\\t\\tR.push_back(s.r);\\n\\t\\tR.push_back(t.r);\\n\\t\\trep(i,m) rep(j,2) {\\n\\t\\t\\tR.push_back(bad[i][j].r);\\n\\t\\t\\tR.push_back(bad[i][j].r+1);\\n\\t\\t\\tR.push_back(max(bad[i][j].r-1,1));\\n\\t\\t}\\n\\t\\tsort(R.begin(),R.end());\\n\\t\\tR.erase(unique(R.begin(),R.end()),R.end());\\n\\n\\t\\tint N=n*R.size();\\n\\t\\tstatic vector<edge> G[60300];\\n\\t\\trep(u,N) G[u].clear();\\n\\t\\trep(i,R.size()){\\n\\t\\t\\tint r=R[i];\\n\\t\\t\\trep(j,n){\\n\\t\\t\\t\\t// 左\\n\\t\\t\\t\\tbool ok=true;\\n\\t\\t\\t\\trep(k,m){\\n\\t\\t\\t\\t\\tif(bad[k][0]==(point){r,j} && bad[k][1]==(point){r,(j-1+n)%n}\\n\\t\\t\\t\\t\\t|| bad[k][1]==(point){r,j} && bad[k][0]==(point){r,(j-1+n)%n}) ok=false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(ok){\\n\\t\\t\\t\\t\\tint u=n*i+j,v=n*i+(j-1+n)%n;\\n\\t\\t\\t\\t\\tG[u].push_back((edge){v,r*COST});\\n\\t\\t\\t\\t\\tG[v].push_back((edge){u,r*COST});\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// 上\\n\\t\\t\\t\\tif(i+1<R.size()){\\n\\t\\t\\t\\t\\tok=true;\\n\\t\\t\\t\\t\\tint r2=R[i+1];\\n\\t\\t\\t\\t\\trep(k,m){\\n\\t\\t\\t\\t\\t\\tif(bad[k][0]==(point){r,j} && bad[k][1]==(point){r2,j}\\n\\t\\t\\t\\t\\t\\t|| bad[k][1]==(point){r,j} && bad[k][0]==(point){r2,j}) ok=false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(ok){\\n\\t\\t\\t\\t\\t\\tint u=n*i+j,v=n*(i+1)+j;\\n\\t\\t\\t\\t\\t\\tG[u].push_back((edge){v,r2-r});\\n\\t\\t\\t\\t\\t\\tG[v].push_back((edge){u,r2-r});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// Dijkstra\\n\\t\\tint s_id=n*(find(R.begin(),R.end(),s.r)-R.begin())+s.i;\\n\\t\\tint t_id=n*(find(R.begin(),R.end(),t.r)-R.begin())+t.i;\\n\\t\\tstatic double d[60300];\\n\\t\\trep(u,N){\\n\\t\\t\\td[u]=(u==s_id?0:INF);\\n\\t\\t}\\n\\t\\tpriority_queue< pair<double,int> > Q; Q.push(make_pair(0,s_id));\\n\\t\\twhile(!Q.empty()){\\n\\t\\t\\tdouble d_now=-Q.top().first;\\n\\t\\t\\tint u=Q.top().second; Q.pop();\\n\\n\\t\\t\\tif(d_now>d[u]) continue;\\n\\n\\t\\t\\trep(i,G[u].size()){\\n\\t\\t\\t\\tedge e=G[u][i];\\n\\t\\t\\t\\tif(d[e.v]>d[u]+e.cost){\\n\\t\\t\\t\\t\\td[e.v]=d[u]+e.cost;\\n\\t\\t\\t\\t\\tQ.push(make_pair(-d[e.v],e.v));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"%.9f\\\\n\\\",d[t_id]);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 5068,\n \"score_of_the_acc\": -0.7044,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2071_473189\",\n \"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 PI = acos(-1.0);\\nconst double EPS = 1.0e-10;\\nconst double INF = DBL_MAX / 1000;\\n\\nint main()\\n{\\n int _tmp = 0;\\n\\n for(;;){\\n int n, x;\\n cin >> n >> x;\\n if(n == 0)\\n return 0;\\n\\n int rStart, iStart, rGoal, iGoal;\\n cin >> rStart >> iStart >> rGoal >> iGoal;\\n \\n vector<int> r1(x), i1(x), r2(x), i2(x);\\n for(int j=0; j<x; ++j)\\n cin >> r1[j] >> i1[j] >> r2[j] >> i2[j];\\n\\n // スタート、ゴール、失われた辺が位置する多角形と、その前後の多角形のみに注目\\n // また、一番中央にある多角形にも注目する\\n map<int, int> rIndex;\\n rIndex[1];\\n for(int j=0; j<3; ++j){\\n rIndex[rStart - 1 + j];\\n rIndex[rGoal - 1 + j];\\n }\\n for(int j=0; j<x; ++j){\\n for(int k=0; k<3; ++k){\\n rIndex[r1[j] - 1 + k];\\n rIndex[r2[j] - 1 + k];\\n }\\n }\\n if(rIndex.begin()->first == 0)\\n rIndex.erase(rIndex.begin());\\n\\n int m = 0; // 注目する多角形の数\\n vector<int> rPos; // 注目する多角形の位置\\n for(map<int, int>::iterator it=rIndex.begin(); it!=rIndex.end(); ++it){\\n it->second = m;\\n ++ m;\\n rPos.push_back(it->first);\\n }\\n\\n set<pair<pair<int, int>, pair<int, int> > > damage;\\n for(int j=0; j<x; ++j){\\n damage.insert(make_pair(make_pair(rIndex[r1[j]], i1[j]), make_pair(rIndex[r2[j]], i2[j])));\\n damage.insert(make_pair(make_pair(rIndex[r2[j]], i2[j]), make_pair(rIndex[r1[j]], i1[j])));\\n }\\n\\n vector<vector<double> > minDist(m, vector<double>(n+1, INF));\\n minDist[rIndex[rStart]][iStart] = 0.0;\\n multimap<double, pair<int, int> > mm;\\n mm.insert(make_pair(0.0, make_pair(rIndex[rStart], iStart)));\\n\\n for(;;){\\n double dist0 = mm.begin()->first;\\n int r0 = mm.begin()->second.first;\\n int i0 = mm.begin()->second.second;\\n mm.erase(mm.begin());\\n if(dist0 > minDist[r0][i0] + EPS)\\n continue;\\n\\n if(r0 == rIndex[rGoal] && i0 == iGoal){\\n printf(\\\"%.10f\\\\n\\\", dist0);\\n break;\\n }\\n\\n for(int j=0; j<4; ++j){\\n double dist = dist0;\\n int r = r0;\\n int i = i0;\\n if(j % 2 == 0){\\n r = r - 1 + j;\\n if(r == -1 || r == m)\\n continue;\\n dist += abs(rPos[r] - rPos[r0]);\\n }else{\\n i = (i - 3 + j + n) % n + 1;\\n dist += rPos[r] * sin(PI / n) * 2.0;\\n }\\n\\n if(damage.find(make_pair(make_pair(r0, i0), make_pair(r, i))) != damage.end())\\n continue;\\n\\n if(dist < minDist[r][i] - EPS){\\n minDist[r][i] = dist;\\n mm.insert(make_pair(dist, make_pair(r, i)));\\n }\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1588,\n \"score_of_the_acc\": -0.0542,\n \"final_rank\": 3\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":10,"numItemsPerPage":100,"numTotalItems":2103,"offset":1000,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTczNzgwNywic3ViIjoiL2RhdGFzZXRzL09OTFlTTElNRS9BT0otQ29kZVJhbmstQmVuY2htYXJrIiwiZXhwIjoxNzc5NzQxNDA3LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.JpQBXyTCHB0qb49cp4qcQdQ8dWmw70E3T00r3Y6Yqnjqz_mmKyjVq21XmQpi3_VubQTj52BfkIwWGsiPj2k4Cw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":2103,"numBytesParquet":46097533}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
group_id stringlengths 12 18 | problem_description stringlengths 85 3.02k | candidates listlengths 3 20 |
|---|---|---|
aoj_1630_cpp | Expression Mining
Consider an arithmetic expression built by combining single-digit positive integers
with addition symbols
+
, multiplication symbols
*
,
and parentheses
(
)
,
defined by the following grammar rules with the start symbol
E
.
E ::= T | E '+' T
T ::= F | T '*' F
F ::= '1' | '2' | '3' | '4' | '5' | '6... | [
{
"submission_id": "aoj_1630_10665435",
"code_snippet": "// C++ includes used for precompiling -*- C++ -*-\n// Copyright (C) 2003-2013 Free Software Foundation, Inc.\n//\n// This file is part of the GNU ISO C++ Library. This library is free\n// software; you can redistribute it and/or modify it under the\n... |
aoj_1629_cpp | Equilateral Triangular Fence
Ms. Misumi owns an orchard along a straight road.
Recently, wild boars have been witnessed strolling around the orchard aiming at pears, and she plans to construct a fence around many of the pear trees.
The orchard contains
n
pear trees, whose locations are given by the two-dimensional Eucl... | [
{
"submission_id": "aoj_1629_10852996",
"code_snippet": "#include <cstdio>\n#include <cmath>\n#include <algorithm>\nconst int N = 1e6 + 7;\ndouble sq3 = sqrt(3.0);\nstruct Node {\n int x, y;\n double dx, dy;\n} p[N], left[N], right[N], l[N], r[N];\nint n, k;\nbool cmp1(const Node &a, const Node &b) {\n retu... |
aoj_1632_cpp | Scores of Final Examination
I am a junior high school teacher.
The final examination has just finished, and I have
all the students' scores of all the subjects.
I want to know the highest total score among the students,
but it is not an easy task as the student scores are
listed separately for each subject.
I would lik... | [
{
"submission_id": "aoj_1632_10882956",
"code_snippet": "#include <iostream>\n#include <vector>\n\ntemplate <typename T>\nclass matrix: public std::vector< std::vector<T> >\n{\npublic:\n\tmatrix(int m = 0, int n = 0, const T& v = T()):\n\t\tstd::vector< std::vector<T> >(m, std::vector<T>(n, v)) {}\n\tint ro... |
aoj_1631_cpp | For Programming Excellence
A countless number of skills are required to be an excellent programmer.
Different skills have different importance degrees,
and the total programming competence is measured by
the sum of products of levels and importance degrees of his/her skills.
In this summer season,
you are plann... | [
{
"submission_id": "aoj_1631_10853852",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\nconst ll BIG_NUM = 2e9;\nconst ll HUGE_NUM = 99999999999999999;\nconst ll MOD = 1e9+7;\nconst double EPS = 1e-9;\n\nusing namespace std;\n\nconst int SIZE = 100... |
aoj_1633_cpp | On-Screen Keyboard
You are to input a string with an OSK (on-screen keyboard).
A remote control with five buttons, four arrows and an OK (Fig. B-1),
is used for the OSK.
Find the minimum number of button presses required
to input a given string with the given OSK.
Fig. B-1 Remote control
Fig. B-2 An on-... | [
{
"submission_id": "aoj_1633_10897969",
"code_snippet": "/*\n * author : cellul4r\n */\n#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\ntypedef pair<int, int> pi;\ntypedef pair<ll,ll> pl;\ntypedef pair<ld,ld> pd;\n#define all(x) x.begin(), x.end()\nconst ch... |
aoj_1638_cpp | Let's Move Tiles!
You have a framed square board forming a grid of square cells.
Each of the cells is either empty or with a square tile fitting in the cell engraved with a Roman character.
You can tilt the board to one of four directions, away from you, toward you, to the left, or to the right,
making all the tiles sl... | [
{
"submission_id": "aoj_1638_10865908",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define ALL(v) begin(v),end(v)\n#define REP(i,n) for(int i=0;i<(n);++i)\n#define RREP(i,n) for(int i=(n)-1;i>=0;--i)\n\ntypedef long long LL;\ntypedef vector<int> vint;\n\nconst int targets[4][9] = {\n\... |
aoj_1635_cpp | Tally Counters
A number of tally counters are placed in a row.
Pushing the button on a counter will increment the displayed value by one, or, when the value is already the maximum, it goes down to one.
All the counters are of the same model with the same maximum value.
Fig. D-1 Tally Counters
Starting from the values i... | [
{
"submission_id": "aoj_1635_10898275",
"code_snippet": "/*\n * author : cellul4r\n */\n#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\ntypedef pair<int, int> pi;\ntypedef pair<ll,ll> pl;\ntypedef pair<ld,ld> pd;\n#define all(x) x.begin(), x.end()\nconst ch... |
aoj_1634_cpp | Balance Scale
You, an experimental chemist, have a balance scale and a kit of
weights for measuring weights of powder chemicals.
For work efficiency, a single use of the balance scale should be
enough for measurement of each amount. You can use any number of
weights at a time, placing them either on the ba... | [
{
"submission_id": "aoj_1634_10898057",
"code_snippet": "/*\n * author : cellul4r\n */\n#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\ntypedef pair<int, int> pi;\ntypedef pair<ll,ll> pl;\ntypedef pair<ld,ld> pd;\n#define all(x) x.begin(), x.end()\nconst ch... |
aoj_1636_cpp | Cube Surface Puzzle
Given a set of six pieces, “Cube Surface Puzzle” is to construct a hollow cube with filled surface.
Pieces of a puzzle is made of a number of small unit cubes laid grid-aligned on a plane.
For a puzzle constructing a cube of its side length
n
,
unit cubes are on either of the following two areas.
Co... | [
{
"submission_id": "aoj_1636_10851082",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\n\nstruct jie{\n char s[10][10][10];\n}mp[7];\nchar a[15][15][15];\nint n;\nint flag,us[15];\nvoid dfs(int m){\n if(m>6){\n flag=1;\n return;\n }\n for(i... |
aoj_1639_cpp | Addition on Convex Polygons
Mr. Convexman likes convex polygons very much.
During his study on convex polygons, he has come up with the following elegant addition on convex polygons.
The sum of two points in the
xy
-plane,
(
x
1
,
y
1
) and
(
x
2
,
y
2
)
is defined as
(
x
1
+
x
2
,
y
1
+
y
2
).
A polygon is treated as... | [
{
"submission_id": "aoj_1639_10849688",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <utility>\nusing namespace std;\n\ntypedef long long LL;\ntypedef pair<LL,LL> pll;\n\npll add(const pll &a, const pll &b){\n\treturn pll(a.first + b.first, a.second + b.second);\n}... |
aoj_1637_cpp | Flipping Colors
You are given an undirected complete graph.
Every pair of the nodes in the graph is connected by an edge,
colored either red or black.
Each edge is associated with an integer value called
penalty.
By repeating certain operations on the given graph,
a “spanning tree” should be formed with only the red ed... | [
{
"submission_id": "aoj_1637_10853073",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)\n#define ALL(v) (v).begin(),(v).end()\n#define CLR(t,v) memset(t,(v),sizeof(t))\ntemplate<class T1,class T2>ostream& operator<<... |
aoj_1646_cpp | Avoiding Three Cs
You are a member of ICPC Company, and planning to place seats in the new office.
Your task is to place as many seats as possible in the room while
satisfying the conditions for
avoiding three Cs
.
You decided to solve the problem through simulation on a grid.
In the simulation, the room is... | [
{
"submission_id": "aoj_1646_9417671",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\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() ... |
aoj_1643_cpp | Icpcan Alphabet
Figure D-1 A picture of two expressions engraved on a stone wall.
Research on the civilization of old kingdom of Icpca has been carried out at the Investigation Center for Prehistoric Civilization (ICPC).
Their recent excavation found two expressions engraved on a stone wall at the ruins of Icpca.
The e... | [
{
"submission_id": "aoj_1643_10881117",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\n// clang-format off\n\nint n;\nstring a;\nstring S, T;\n\nchar val(const string& P, int& r, char tchar, int mask) {\n ++r;\n if (P[r-1]==tchar) return 1;\n int idx=P[r... |
aoj_1642_cpp | Luggage
Mr. Yokohama is estimating the delivery fare for a number of luggage
pieces.
The fare for a piece is determined by its width
w
, depth
d
and height
h
, each rounded up to an integer.
The fare is proportional to the
sum
of them.
The list of the luggage pieces is at hand,
but the list has
the
product
w
×
d
×
h
f... | [
{
"submission_id": "aoj_1642_10849119",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int N=4e7+3;\nbool isComposite[N];\nlong long primes[N], sz;\nvoid sieve() { // save the all primes till N in linear time\n isComposite[0] = isComposite[1] = true;\n for (int i = 2; i < N; +... |
aoj_1644_cpp | Keima
You are given a set of points aligned in a grid of
N
rows and
M
columns.
Each of the points is named
P
i
,
j
with its row number
i
(1 ≤
i
≤
N
)
and its column number
j
(1 ≤
j
≤
M
).
Each point is colored either white or black.
Your task is to compute the number of subsets
T
of white points
satisfying the followin... | [
{
"submission_id": "aoj_1644_10666042",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<int MOD>\nstruct modint {\n modint() : x(0) {}\n modint(long long v) {\n long long y = v % m();\n if (y < 0) y += m();\n x = (unsigned int)(y);\n }\n static mo... |
aoj_1645_cpp | Evacuation Site
The council of your home city decided to build a public evacuation site to prepare for natural disasters.
The evacuation site is desired to be built at a location reachable from as many locations across the city
as possible, even when many road segments are closed due to a natural disaster.
Given the ro... | [
{
"submission_id": "aoj_1645_10672181",
"code_snippet": "#line 1 \"library/Template/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin()... |
aoj_1649_cpp | Hundred-Cell Calculation Puzzles
The
hundred-cell calculation
is a kind of calculation training.
In hundred-cell calculation, a sheet with ten by ten empty cells is
given. Numbers, 0 through 9, are written on the top of the ten columns in
an arbitrary order. 0 through 9 are also written at the left of the
ten rows in ... | [
{
"submission_id": "aoj_1649_10643103",
"code_snippet": "#include <bits/stdc++.h>\n#define ll long long\n#define ld long double\nusing namespace std;\n\n\nll detA(vector<vector<ld>> M, ll n){\n ll t = 1;\n ll det = 1;\n for (int i = 1; i < n; i++){\n if (M[i][i] == 0){\n for (int ... |
aoj_1647_cpp | Idealistic Canister
The Ideally Compact Packaging Canisters (ICPC) corporation is a
package manufacturer specialized in canisters (cylindrical containers),
designing and manufacturing canisters satisfying clients' demands.
The corporation has taken an order of a canister to pack two different products together.
Both pr... | [
{
"submission_id": "aoj_1647_9994054",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nclass point2d {\npublic:\n double x, y;\n point2d() : x(0.0), y(0.0) {};\n point2d(double x_, double y_) : x(x_), y(y_) {};\n point2d& operator+=(const point2d& p) { x += p.x; y += p.y; retu... |
aoj_1650_cpp | Tree Transformation Puzzle
Let's get started with a puzzle!
First, you are given an arithmetic expression, which solely consists of integers, operator symbols
+
and
−
, and parentheses.
(4−1)−(2+3)−(5+6)
is an example of such an expression.
As is well known, the structure of an arithmetic expression is naturally repres... | [
{
"submission_id": "aoj_1650_10845127",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n//https://onlinejudge.u-aizu.ac.jp/services/ice/?problemId=1650\n//模擬解答を参考\n\nconst int INF = 1e9; //非常に大きな値\n\nstruct Node {\n char op; // '+', '-', or '@' (葉ノード)\n int val; // if op == '@'\n ... |
aoj_1651_cpp | Handing out Balloons
Each time an ICPC participant team has successfully solved a
problem at the competition site, a balloon of a color specific to that
problem is delivered to that team. You had thus prepared enough
number of balloons of various colors for the case when all the teams solved
all the
problems, but many... | [
{
"submission_id": "aoj_1651_10684431",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing B = bitset<2501>;\n\nvoid solve(int n) {\n vector<int> a(n);\n int sm = 0;\n for (auto &i: a) {\n cin >> i;\n sm += i;\n }\n vector<B> dp(2501);\n dp[0][0] = 1;\n ... |
aoj_1652_cpp | Time is Money
The city of ICPC has made excessive pedestrian separation, making
transportation in the city quite complicated. Citizens of the ICPC
city thus have big concern on efficient transportation to save
time.
The residents are eager to reach their destinations as fast as possible
by repeatin... | [
{
"submission_id": "aoj_1652_10675436",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing H = pair<ll, ll>;\nusing P = pair<ll, H>;\nusing vi = vector<int>;\nusing vl = vector<ll>;\n#define all(a) (a).begin(), (a)... |
aoj_1660_cpp | Problem E
Village of Lore
Icpca village, said to lie in a deep jungle, is known by strange, contradictory lore.
Some say there lies a epitome of happiness while others say it is a terrible fortress of horror.
An old soothsayer, who is a precious source of information, reported that Icpca village has a rectangular form ... | [
{
"submission_id": "aoj_1660_10676160",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n/*\n#include <atcoder/all>\nusing namespace atcoder;\nusing mint = modint998244353;\n// using mint = modint1000000007;\n//*/\n\nusing ll = long long;\nusing i128 = __int128_t;\nusing pll = pair<ll, ll>... |
aoj_1653_cpp | Princess' Perfectionism
The princess has
n
spies, and she is planning to assign exactly
n
tasks to them.
Skills of the spies constrain the eligibilities for the tasks.
The princess is a perfectionist, and she is not satisfied unless
each spy is assigned exactly one task, and
each task is assigned to exactly one spy.
Fo... | [
{
"submission_id": "aoj_1653_10625084",
"code_snippet": "#line 2 \"/home/nixos/workspace/CompPro-Make/library/KowerKoint/stl-expansion.hpp\"\n#include <bits/stdc++.h>\n\ntemplate <typename T1, typename T2>\nstd::istream& operator>>(std::istream& is, std::pair<T1, T2>& p) {\n is >> p.first >> p.second;\n ... |
aoj_1663_cpp | Problem H
Artist in Agony
You, an artist, prepared a sufficient number of balls and also strings to link them for your artwork. Balls are to be given sequential numbers eventually, but only one of the balls is given number 1 at the beginning. No other balls are numbered and no balls are linked to any other balls yet.
... | [
{
"submission_id": "aoj_1663_10569153",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing uint = unsigned int;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntemplate <class T, class U>\ninline b... |
aoj_1662_cpp | Problem G
Keep in Touch
Two agents A and B, known as a great combination, are conducting the infiltration mission to a secret base.
Due to the strict security of the base, two agents have decided to follow the prechecked safe infiltration routes
R
A
and
R
B
, respectively.
Each infiltration route is a two-dimensional p... | [
{
"submission_id": "aoj_1662_10203399",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <math.h>\n#include <algorithm>\n#include <set>\n#include <map>\n\nusing namespace std;\nusing ld = long double;\n\nld eps = 1e-10;\nld INF = 1e9;\n\nstruct point {\n\tld x, y;\n\tpoint() {\n\t\tx = 0;\n... |
aoj_1657_cpp | Problem B
Leave No One Behind
A card game similar to Old Maid is played by
n
players
P
1
, ..., and
P
n
,
sitting clockwise in this order.
For this game,
n
pairs of cards numbered 1 through
n
are used.
Each player has two cards at hand to start with.
First, any player who has a pair of cards with the same number di... | [
{
"submission_id": "aoj_1657_10684192",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <math.h>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <functional>\n#include <cassert>\nusing namespace std;\n#define rep(i, n)... |
aoj_1666_cpp | Problem C
Changing the Sitting Arrangement
You are the teacher of a class of
n
2
pupils at an elementary school.
Seats in the classroom are set up in a square shape of
n
rows (row 1 through row
n
) by
n
columns (column 1 through column
n
).
You are planning a change in the sitting arrangement.
In order for your pupils ... | [
{
"submission_id": "aoj_1666_10669785",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)\n#define rrep(i, s, t) for(ll i = (ll)(t) - 1; i >= (ll)(s); i--)\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x),... |
aoj_1661_cpp | Problem F
Trim It Step by Step
The intelligence agency of the Kingdom uses a unique encryption method;
a nonempty message consisting only of lowercase letters is encrypted into an expression <expr> complying with the grammar described by the following BNF.
<expr>
::=
<char> | <expr><expr> |
?(
<expr>
)
<char>
::=
a
|
b... | [
{
"submission_id": "aoj_1661_10483298",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nvoid solve() {\n string s; cin >> s;\n int n = ssize(s);\n vector<int> closing(n, -1);\n stack<int> stk;\n for(int i = 0; i < n; i++) {\n if(s[i] == '?') stk.push(i);\n e... |
aoj_1658_cpp | Problem C
Training Schedule for ICPC
With little time remaining until ICPC, you decided to reschedule your training plan. As maintaining both mental and physical vitality is important, you decided to spend
n
days of the remaining
n
+
m
days for training, and
m
days for repose. The question is which days should be use... | [
{
"submission_id": "aoj_1658_10684472",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n long long n,m;\n vector<long long> lastans;\n while(true){\n cin >> n >> m;\n if(n==0&&m==0){\n break;\n }\n long long ans=n*n-m*m;\n ... |
aoj_1659_cpp | Problem D
Audience Queue
You are working as a staff member at a concert venue, organizing the audience queue.
Everyone in the queue holds one ticket with a seat number printed.
The seat numbers are integers from 1 to
n
without duplicates.
Since this is a very popular concert,
all the seats are reserved and exactly
n
p... | [
{
"submission_id": "aoj_1659_10676345",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll mod = 998244353;\n\nll powmod(ll a, ll b) {\n ll ret = 1;\n ll k = a;\n while (b) {\n if (b & 1) {\n ret *= k;\n ret %= mod;\n ... |
aoj_1673_cpp | Problem B
Overtaking
Two athletes run a long-distance race, but the race is
different from usual athletics events.
They run for a predetermined duration, and the one who runs longer will be the winner.
At every minute after the start, the distances both runners ran
in the previous one minute are recorded.
You are expec... | [
{
"submission_id": "aoj_1673_9694077",
"code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing namespace std;\n#undef long\n#define long long long\n#define vec vector\nvoid solve()\n{\n int n;\n cin >> n;\n if (n == 0)\n exit(0);\n vec<int> a... |
aoj_1665_cpp | Problem B
Amidakuji
Amidakuji is a method of lottery popular in East Asia.
It is often used when a number of gifts are distributed to people
or when a number of tasks are assigned.
Figure B-1: An example of amidakuji
Figure B-1 shows an example of amidakuji, which corresponds to the first dataset of Sample Input.
A num... | [
{
"submission_id": "aoj_1665_10845715",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n while(true){\n int n, m, p, q;\n cin >> n >> m >> p >> q;\n if(!n) break;\n\n vector<int> amida(m);\n for(auto& i:amida) cin >> i;\n\n int save_p... |
aoj_1667_cpp | Problem D
Efficient Problem Set
You are planning a problem set for the upcoming programming contest.
The problem set should consist of one or more problems each allocated with a certain amount of points, which is a positive integer.
The score of each contestant is the sum of the points of the problems that the contesta... | [
{
"submission_id": "aoj_1667_10824752",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define MAXS 100 // 最大データセット数\n#define MAXN 100 // 最大満点\n\n\n\nint solve(int n, const string& s) {\n for (int k = 1; k <= n; ++k) {\n bool found = false;\n vector<int> tmp;\n\n ... |
aoj_1669_cpp | Problem F
Villa of Emblem Shape
The princess has a vast private estate.
She has decided to build a new villa there.
According to her creative request, the ground floor outline of the main house of the villa must be derived from the emblem of the royal family.
The emblem is a simple polygon.
Four examples are shown in F... | [
{
"submission_id": "aoj_1669_10958528",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <vector>\ntypedef long long ll;\ntypedef double ld;\ninline int sign(const ll& x) { return x < 0 ? -1 : !!x; }\n\nint N;\nstruct Pos {\n\tint x, y, ... |
aoj_1670_cpp | Problem G
Fair Deal of Dice
You are serving as the gamemaster of a two-player game in which several cubic dice are used.
Each face of the dice has a number on it.
Unlike conventional dice, the numbers are not necessarily one through six.
Before starting a game, you select a predefined number of dice from the set of dic... | [
{
"submission_id": "aoj_1670_10567721",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntemplate <class T, class U>\ninline bool chmax(T& a, U b) {\n if (a < b) {\n a = b;\n ... |
aoj_1678_cpp | Problem G
Two Sets of Cards
As an entertainment after the programming contest, you hold a game event for the participants.
Two sets of cards, red ones and blue ones, are used in the game.
Both of the two sets have the same number of cards as the number of the participants, and each card has one integer written on it.
I... | [
{
"submission_id": "aoj_1678_10781175",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin>>n;\n//\tn=10;\n\twhile(n)\n\t{\n//\t\tvector<int>a0(n+1),b0;\n//\t\tfor(int i=1;i<=n;i++)a0[i]=rand()%151-75;\n//\t\tb0=a0;\n//\t\tfor(int i=n;i>1;i--)\n//\t\t\tswap(b0[i],... |
aoj_1668_cpp | Problem E
Tampered Records
In ancient times, the International Collegiate Puzzle Contest (ICPC) was held annually.
Each of the annual contests consisted of two rounds: the morning round and the afternoon round.
In both of the two rounds, the participants posed one puzzle made on their own to all the other participa... | [
{
"submission_id": "aoj_1668_10683499",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#include <atcoder/all>\nusing namespace atcoder;\n\nbool solve() {\n int N;\n cin >> N;\n if(N == 0) return false;\n using P = pair<int, int>;\n const P MINF = P{0, -1};\n vector<P> d... |
aoj_1677_cpp | Problem F
Billiards
You are challenging a game with prizes, which is similar to billiards.
This game uses a kind of billiard table, several balls of the same size, and a prize coin.
The top of the table has a flat rectangular cloth-covered area bounded by
elastic bumpers, called
cushions.
The balls can move... | [
{
"submission_id": "aoj_1677_10850999",
"code_snippet": "// I made some changes to the original code.\n\n// #include<bits/stdc++.h>\n#include<iostream>\n#include<algorithm>\n#include<set>\n#include<tuple>\n#include<vector>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> ... |
aoj_1674_cpp | Problem C
Honeycomb Distance
A plane is tiled completely with regular hexagons.
Each hexagon is called a cell.
You can move in one step from a cell to one of its adjacent cells that share an edge.
You want to know the minimum number of steps to move from the central cell to the specified cell.
Each cell is specified ... | [
{
"submission_id": "aoj_1674_10687657",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing pint = pair<int,int>;\nusing pll = pair<long long, long long>;\n\n#define rrep1(a) for(ll i = (ll)(a-1); i >= (ll)0 ; i--)\n#define rrep2(i, a) for(ll i = (ll)... |
aoj_1675_cpp | Problem D
A Bug That's Not a Pill Bug
A bug that looks like a pill bug is walking on a plane.
A Cartesian coordinate system is defined on the plane,
in which its
x-
axis is directed from west to east,
while its
y-
axis is directed from south to north.
The bug is initially at a lattice point (a point where both the
x-
a... | [
{
"submission_id": "aoj_1675_10681419",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)\n#define rrep(i, s, t) for(ll i = (ll)(t) - 1; i >= (ll)(s); i--)\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x),... |
aoj_2004_cpp | Data Center on Fire
今から少し未来の話である．高密度記憶および長期保存可能である記録デバイスが開発されてきたが，コンテンツが生み出される速度が異常なほどに速かったため，データセンターを設立した．データセンターを設立した当初は小さな建物だったが，増え続けるデータにあわせて何度も拡張工事をしたため，性能の異なるエレベータを何基も持つこととなった．
ところが，データセンターで火災が発生した．火は一定時間だけ経過すると上の階ないし下の階に燃え広がる．また，火がついてから一定時間だけ経過するとその階は焼失してしまう．そこでエレベータを使ってデバイスを運び出すこととした．このエレベータは耐火性能が完璧であるため，階の焼失に関... | [
{
"submission_id": "aoj_2004_9173332",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに... |
aoj_2002_cpp | X-Ray Screening System
これは 20XX 年の話である．再生発電網による安定したエネルギー供給，および液化合成燃料の発明によって航空旅客数は鰻登りに増加した．しかし，航空機によるテロリズムの脅威は依然として存在するため，高速でかつ高い信頼性をもつ自動手荷物検査システムの重要性が高まっている．検査官が全部の荷物を調べることは実際問題として困難であることから，自動検査において疑わしいと判断された手荷物だけを検査官で改めて調べるという仕組みを整えたいわけである．
航空機業界からの要請を受け，国際客室保護会社（International Cabin Protection Company）では，新たな自動検査システムを開... | [
{
"submission_id": "aoj_2002_10848556",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint N, H, W;\n\tcin >> N;\n\twhile (N--) {\n\t\tcin >> H >> W;\n\t\tvector<int> used(26), xma(26), xmi(26, 100), yma(26), ymi(26, 100);\n\t\tvector<vector<char>> a(H, vector<char>(W));... |
aoj_2001_cpp | Amida, the City of Miracle
奇跡の都市アミダ（Amida, the City of Miracle）の市長は他の市のように選挙で選ぶのではない．かつて長い政権闘争と天変地異により疲弊したこの都市は，候補者全員を公平に選び，かつ幸運の星の下に生まれた者を市長にするために，候補者全員の運命をくじにゆだねることにしたのである．後にあみだくじと呼ばれるくじである．
選挙は以下のように行われる．候補者数と同数の長い縦線が引かれ，さらにいくつかの横線がそこに引かれる．横線は隣接した縦線の途中同士を結ぶように引かれる．いずれかの縦線の下には「当選」と書かれている．どの縦線が当選であるかは候補者からわからないように隠される... | [
{
"submission_id": "aoj_2001_10849592",
"code_snippet": "#include \"bits/stdc++.h\"\n\nusing namespace std;\n#define FOR(i,s,t) for (int i = s; i < t; i++)\n#define SZ(x) (int)x.size()\nusing LL = long long; using ll = LL;\nusing VI = vector<int>; using VL = vector<LL>;\nconst LL INF = 1e9; const LL LINF = ... |
aoj_2007_cpp | Problem B:
Make Purse Light
Mr. Bill は店で買い物をしている。 彼の財布にはいくらかの硬貨（10 円玉、50 円玉、100 円玉、500 円玉）が入っているが、彼は今この小銭をできるだけ消費しようとしている。 つまり、適切な枚数の硬貨によって品物の代金を払うことで、釣り銭を受け取った後における硬貨の合計枚数を最小にしようとしている。
幸いなことに、この店の店員はとても律儀かつ親切であるため、釣り銭は常に最適な方法で渡される。 したがって、例えば 1 枚の 500 円玉の代わりに 5 枚の 100 円玉が渡されるようなことはない。 また、例えば 10 円玉を 5 枚出して、50 円玉を釣り銭として受... | [
{
"submission_id": "aoj_2007_10852642",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nint main() {\n int n;\n int q = 0;\n while(cin >> n, n) {\n if(q != 0) {\n cout << endl;\n }\n q++;\n int a, b, c, d;\n c... |
aoj_2005_cpp | Water Pipe Construction
21XX 年，ついに人類は火星への移住計画を開始させた．火星への移住第一陣に選抜されたあなたは，火星行政中央局（the Administrative Center of Mars）に配属され，火星で起こる様々な問題に対処している．行政中央局の目下の最大の問題は自立した需要供給サイクルの確保である．月からの援助物資が届くまでには数ヶ月単位の時間がかかるため，基本的には火星内の需要は火星内で解決する必要がある．それに加えて，循環システムを確立するまでは資源を極力節約することが求められる．
行政中央局は極地にある氷の採掘を開始した．太陽光でこれを溶かし，水として個々の基地に供給することが最終... | [
{
"submission_id": "aoj_2005_10852719",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing VS = vector<string>; using LL = long long;\nusing VI = vector<int>; using VVI = vector<VI>;\nusing PII = pair<int, int>; using PLL = pair<LL, LL>;\nusing VL = vector<LL>; using ... |
aoj_2003_cpp | Railroad Conflict
Nate U. Smith は大都市圏の鉄道会社を経営している．この大都市圏には，彼の鉄道会社以外にライバルの鉄道会社がある．2 社は互いに競合関係にある．
この大都市圏では，列車の運行を容易にするため，全ての路線は両端の駅を結んだ線分を経路としている．また，踏切等の設置をさけるため，全ての路線は高架または地下に敷設されている．既存路線は，全線にわたって高架を走るか，または全線にわたって地下を走るかのいずれかである．
ところで，最近，この大都市圏にある 2 つの街区 A，B がさかんに開発されていることから，Nate の会社ではこれらの街区の間に新しい路線を設けることを決断した．この新路線は，従来... | [
{
"submission_id": "aoj_2003_10851339",
"code_snippet": "#define _USE_MATH_DEFIMES\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include ... |
aoj_2009_cpp | Problem D:
Area Separation
Mr. Yamada Springfield Tanaka は、国家区画整理事業局局長補佐代理という大任を任されていた。
現在、彼の国は大規模な区画整理の最中であり、この区画整理をスムーズに終わらせることができたならば彼の昇進は間違いなしであるとされている。
ところが、そんな彼の出世を快く思わない者も多くいるのだ。 そんな人間の 1 人に、Mr.Sato Seabreeze Suzuki がいた。
彼は、ことあるごとに Mr. Yamada の足を引っ張ろうと画策してきた。 今回も Mr. Sato は足を引っ張るために、実際の区画整理を担当している組織に圧力をかけて... | [
{
"submission_id": "aoj_2009_10854083",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\ntypedef complex<double> P;\nconst double EPS = 1e-12;\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n\ndouble cross(P a, P b) {\n\treturn (conj(a)*b).imag();\n}\n\nP crosspointLL(P a1, P ... |
aoj_2008_cpp | Problem C:
Dragon Fantasy
永遠に続くと思われていた平和は突然終わりを告げた。 はるか昔に封印されていた魔王がついに復活を遂げたのである。 だが、今まさに世界が闇に覆われようとしているとき、1 人の勇者が現れた。 そしてその勇者は、世界各地に散らばっている伝説のクリスタルを集める旅に出た。 伝説によると、全てのクリスタルを集めることができたならば、どのような願いでもかなえられるという伝説の龍神を呼び出すことができると伝えられている。 その龍神の力を借りれば魔王を倒すことも可能なはずだ。
クリスタルは世界各地に散らばっている。 勇者はそれらを 1 つずつ、自らの手で集めていく必要がある。 なぜなら、勇者以外の者... | [
{
"submission_id": "aoj_2008_9626361",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long double ld;\n#define FOR(i,l,r) for(auto i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define F first\n#define S second\nint main(){\n while(1){\n int N;cin>>N;\n vector<pair<int... |
aoj_2010_cpp | Problem E:
Poor Mail Forwarding
Masa 君が住んでいる地域の郵便システムは少々変わっている。
この地域では、各々の郵便局に対して 1 から順に連続した異なる番号がつけられており、ある郵便局に届けられた郵便物は、その郵便局からいくつかの郵便局を経由して目的の郵便局に届けられる。
郵便物の「転送」は、特定の郵便局の間でしか行われない。 ただし、転送が行われる郵便局同士の間では、転送は双方向に行われる。
ある郵便局から宛先まで郵便物を転送するための経路が複数存在する場合は、 宛先までの距離が最短となるような経路を使用する。
したがって、転送先はそのような最短経路における次の郵便局となる。... | [
{
"submission_id": "aoj_2010_10204478",
"code_snippet": "// AOJ #2010\n// Poor Mail Forwarding 2025.2.8\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n const int INF = 1000000000;\n \nstruct Mail {\n int src, dest;\n ll start_time;\n string label;\n ll delivered_time;\... |
aoj_2011_cpp | Problem F:
Gather the Maps!
はるか昔、八尾氏が残したとされる伝説の秘宝が八王子のどこかに眠っているという。 その在処を示すとされる宝の地図は、いくつかの断片に分割された状態で、八尾氏の
n
人の子孫達によって受け継がれている。
今、八尾氏の子孫達は協力してその秘宝を手に入れようとしていた。 ところが、秘宝の在処を指し示す宝の地図の一部分だけでは秘宝を見つけることができない。 そこで、八尾氏の子孫達は全員で集まって地図を 1 ヶ所に集めようとした。
ところが、いざ実行に移そうとしてもなかなか予定が合わずに集まることができない。 しかしこの秘宝に関する情報は、一族において秘密裏に伝えられてきた貴重な情報... | [
{
"submission_id": "aoj_2011_10853823",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\twhile (cin >> n, n) {\n\t\tvector<vector<int>> v(31);\n\t\tfor (int i = 0, f; i < n; i++) {\n\t\t\tcin >> f;\n\t\t\tfor (int j = 0, d; j < f; j++) {\n\t\t\t\tcin >> d;\n\t\t\... |
aoj_2013_cpp | Osaki
大崎
English text is not available in this practice contest.
山手線は東京 23 区内に敷設されている環状鉄道路線である．総路線距離は 34.5km であり，1 周にはおよそ 1 時間を要する．駅は全部で 29 駅存在する．ラインカラーはウグイス色である．ピーク時の混雑率は 200% を超え，日本の鉄道路線の中で最も混雑している路線の 1 つである．最も混雑する時間帯では 3 分に 1 本の列車が走っており，東京に初めて来た人々はその光景に驚くものである．
鉄子さんは山手線を愛してやまない生粋の鉄道好きである．ある日，彼女は愛読書である JR 時刻表を読みながら次の... | [
{
"submission_id": "aoj_2013_11060394",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < n; ++i)\n\nint time_to_int(string s) {\n int h = stoi(s.substr(0, 2));\n int m = stoi(s.substr(3, 2));\n int sec = stoi(s.substr(6,... |
aoj_2014_cpp | Surrounding Area
土地囲い
English text is not available in this practice contest.
ある 2 人の不動産屋が，客船に乗って南の島に向かっていた．青い空，さわやかな風…．2 人は他の乗客とともに船旅を楽しんでいた．ところが，ある日突然発生した竜巻によって客船が沈んでしまった．他の乗客は救助隊によって救助されたが，どういうわけかこの 2 人だけ見落とされてしまった．数日の漂流の後，彼らはある無人島に流れ着いた．この無人島は長方形であり，以下の図のように格子に区切られていた．
図 C-1: 無人島の形状
彼らはとても欲深かったので，助けを呼ぶことではなく，この無人島の... | [
{
"submission_id": "aoj_2014_10588904",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nbool solve() {\n int H, W;\n cin >> W >> H;\n if (H == 0 && W == 0) return false;\n vector<string> S(H);\n for (int i = 0; i < H; i++) cin >> S[i];\n int D[5] = {0, 1, 0, -1, 0};\n ... |
aoj_2012_cpp | Space Coconut Crab
宇宙ヤシガニ
English text is not available in this practice contest.
ケン・マリンブルーは，宇宙ヤシガニを求めて全銀河を旅するスペースハンターである．宇宙ヤシガニは，宇宙最大とされる甲殻類であり，成長後の体長は 400 メートル以上，足を広げれば 1,000 メートル以上にもなると言われている．既に多数の人々が宇宙ヤシガニを目撃しているが，誰一人として捕らえることに成功していない．
ケンは，長期間の調査によって，宇宙ヤシガニの生態に関する重要な事実を解明した．宇宙ヤシガニは，驚くべきことに，相転移航法と呼ばれる最新のワープ技術と同等のことを... | [
{
"submission_id": "aoj_2012_10848222",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define FOR(i,s,t) for(int i = s; i < t ; i++)\nusing LL = long long; using VL = vector<LL>;\ntemplate<class T> using V = vector<T>; template<class T> using VV = V<V<T>>;\nconst LL LINF = 1e18;\n\nvoid so... |
aoj_2015_cpp | Square Route
スクウェア・ルート
English text is not available in this practice contest.
このたび新しい豪邸を建てることを決めた大富豪の品田氏は，どの街に新邸を建てようかと悩んでいる．実は，品田氏は正方形がとても好きという変わった人物であり，そのため少しでも正方形の多い街に住みたいと思っている．
品田氏は，碁盤目状に道路の整備された街の一覧を手に入れて，それぞれの街について，道路により形作られる正方形の個数を数えることにした．ところが，道と道の間隔は一定とは限らないため，手作業で正方形を数えるのは大変である．そこであなたには，碁盤目状の道路の情報が与えられたときに，... | [
{
"submission_id": "aoj_2015_10848499",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n int n,m;\n while(cin>>n>>m,n){\n vector<int>h(n),w(m);\n for(int i=0;i<n;++i){\n cin>>h[i];\n }\n for(int i=0;i<m;++i){\n cin>>w[i... |
aoj_2017_cpp | Karakuri Doll
からくり人形
English text is not available in this practice contest.
からくり人形師の JAG 氏は，長年の研究の果てに，伝統技術と最新技術を融合させたすばらしいお茶汲み人形の開発に成功した．このお茶汲み人形は，下の図のように格子に区切られた家の中で，台所（K）でお茶の入った湯飲みを乗せるとそれを主人（M）の居場所まで持っていき，主人が飲み終わった湯飲みを乗せると台所まで戻っていくという仕事をする．ただし，この人形は台所と主人の間の往復経路を自分で見つけられるほど賢くはない．使用者はこの人形にプログラムをあらかじめ入力して，人形がきちんと往復できるよ... | [
{
"submission_id": "aoj_2017_9409644",
"code_snippet": "#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing... |
aoj_2016_cpp | Lifeguard in the Pool
プールの監視員
English text is not available in this practice contest.
Horton Moore はプールの監視員として働いている．彼が見回りのためにプールの縁を歩いていたところ，プールの中で一人の少女がおぼれていることに気づいた．もちろん，彼は直ちに救助に向かわなければならない．しかも，少女の身に何かあっては大変であるから，少しでも早く少女のもとにたどり着きたい．
あなたの仕事は，プールの形状（頂点数が 3〜10 の凸多角形），地上および水中における監視員の単位距離あたりの移動時間，そして監視員と少女の初期位置が与えられたときに，監... | [
{
"submission_id": "aoj_2016_10848573",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,a,b) for (int i=(a);i<=(b);++i)\n#define ROF(i,a,b) for (int i=(a);i>=(b);--i)\n#define fi first\n#define se second\n#define pb push_back\n#define mp make_pair\n#define pDI pair<double,int>... |
aoj_2019_cpp | Princess' Marriage
お姫様の嫁入り
English text is not available in this practice contest.
ある貧乏な国のおてんばで勇敢なお姫様は，ギャンブルの配当がパリミュチュエル方式で決定される事を知ることにより，ギャンブルについて詳しくなった気がしてギャンブルでの勝利を確信した．その結果，今までよりも更に多額のお金をつぎ込み，国民が納めた税金をすべて失うほどの負けを喫してしまった．この事態を重く受け止めた王様は，お姫様を隣の国へ嫁がせることにした．こうすることにより，お姫様を日頃の行いを反省させ，同時に隣国との交友を深めて財政援助をしてもらおうと考えたからである．
お姫... | [
{
"submission_id": "aoj_2019_10731946",
"code_snippet": "//問題:https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2015&lang=jp\n//判定:AC\n\n//学習コメント:\n//辺の長さが同じ正方形を同時に数える処理に少し手間取った。\n\n#include <iostream> \n#include <vector> \n#include <algorithm> \n#include <utility>\nusing namespace std;\n\nint Prin(... |
aoj_2022_cpp | Princess, a Cryptanalyst
お姫様の暗号解読
English text is not available in this practice contest.
ある貧乏な国のおてんばで勇敢なお姫様は，お忍びで出かけた町である日本語で書かれた古文書を手に入れた．お姫様は日本語ができるため，さっそくこの古文書を読んでみた．すると，驚くべき事が分かった．この古文書は，古の秘宝の在処を示していたのである．ところが，秘宝の在処は暗号になっており，容易には分からないようになっていた．そこでお姫様は，従者であるあなたに暗号の解読を手伝うように命令を下した．
あなたはお姫様を助けるため昼夜を問わず調査を行った．その結果，Shor... | [
{
"submission_id": "aoj_2022_5538521",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 110;\nint main(){\n while (true){\n int N;\n cin >> N;\n if (N == 0){\n break;\n }\n vector<string> S(N);\n for (int i = 0; i < N; i++){\n cin >> S[i];\n }\... |
aoj_2027_cpp | Problem E:
Reading a Chord
In this problem, you are required to write a program that enumerates all chord names for given
tones.
We suppose an ordinary scale that consists of the following 12 tones:
C, C
#
, D, D
#
, E, F, F
#
, G, G
#
, A, A
#
, B
Two adjacent tones are different by a
half
step; the right one is highe... | [
{
"submission_id": "aoj_2027_3269182",
"code_snippet": "#include \"bits/stdc++.h\"\n\n#pragma warning(disable:4996)\nusing namespace std;\nstring root_sts = \"C ,C#,D ,D#,E ,F ,F#,G ,G#,A ,A#,B \";\n\nint get_num(string name) {\n\n\tint k= root_sts.find(name);\n\tstring l= root_sts.substr(0,k);\n\treturn co... |
aoj_2029_cpp | Problem I:
Light The Room
You are given plans of rooms of polygonal shapes. The walls of the rooms on the plans are
placed parallel to either
x
-axis or
y
-axis. In addition, the walls are made of special materials so
they reflect light from sources as mirrors do, but only once. In other words, the walls do not
reflect... | [
{
"submission_id": "aoj_2029_3168624",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\nusing namespace std;\nconst double EPS = 1e-6;\nconst double INF = 1e12;\nconst double PI = acos(-1);\n#define EQ(... |
aoj_2023_cpp | Princess, a Strategist
お姫様は戦略家
English text is not available in this practice contest.
ある貧乏な国の勇敢なお姫様は，お城を抜け出して古の秘宝を手に入れる冒険に出かける算段をしている．ところが，古の秘宝の周囲は複数のガーディアンによって守られており，普通の方法では辿り着くことができない．そこで，お姫様は従者であるあなたを囮にし，ガーディアン達の注意を惹きつけている間に秘宝を取って来るという作戦を考えた．そのような事をされては命がいくつあっても足りない，しかしお姫様の命令に従わないわけにもいかない．そこで，まずあなたはあらかじめ偵察をし，どのように動... | [
{
"submission_id": "aoj_2023_6005917",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return... |
aoj_2021_cpp | Princess in Danger
お姫様の危機
English text is not available in this practice contest.
ある貧乏な国のおてんばで勇敢なお姫様が，政略結婚のため別の国に嫁ぐことになった．ところが，お姫様を亡き者としようとしている悪漢に嫁ぎ先への道中で襲われお姫様が大けがをしてしまい，近くの病院に搬送された．ところが，悪漢はお姫様は確実に亡き者とするため特殊な毒を使っていた．そのため，お姫様を助けるには本国から特別な薬と冷凍された肉親の血液を大急ぎで運ばなければならなくなった．
この血液は冷凍状態で輸送されるのだが，鮮度を保つため，前回の冷凍から最大
M
分以内に血液冷凍施設で... | [
{
"submission_id": "aoj_2021_10617724",
"code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n// #ifndef ONLINE_JUDGE\n// #define _GLIBCXX_DEBUG // 配列外参照のエラー\n// #endif\n\n// スタンダードライブラリ\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型関... |
aoj_2032_cpp | Problem C:
Online Quizu System
ICPC (Internet Contents Providing Company) is working on a killer game named Quiz Millionaire Attack.
It is a quiz system played over the Internet. You are joining ICPC as an engineer, and you are responsible
for designing a protocol between clients and the game server for this system. As... | [
{
"submission_id": "aoj_2032_1354222",
"code_snippet": "#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#in... |
aoj_2026_cpp | Problem D:
Divisor is the Conqueror
Divisor is the Conquerer
is a solitaire card game. Although this simple game itself is a great
way to pass one’s time, you, a programmer, always kill your time by programming. Your task
is to write a computer program that automatically solves
Divisor is the Conquerer
games. Here
is t... | [
{
"submission_id": "aoj_2026_10848967",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\nvector<int> cur;\n\nint cnt[14];\nbool rec(int n, int sum)\n{\n if(n == 0)\n return 1;\n\n for(int i = 1; i <= 13; i++){\n if(cnt[i] != 0 && sum % i == 0){\n ... |
aoj_2028_cpp | Problem G:
Gather on the Clock
There is a self-playing game called
Gather on the Clock
.
At the beginning of a game, a number of cards are placed on a ring. Each card is labeled by a
value.
In each step of a game, you pick up any one of the cards on the ring and put it on the next one
in clockwise order. You will gain ... | [
{
"submission_id": "aoj_2028_10853924",
"code_snippet": "#include <cmath>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nint Q, n;\nint main() {\n\tcin >> Q;\n\twhile (Q--) {\n\t\tcin >> n;\n\t\tvector<int> a(n);\n\t\tfor (int i = 0; i < n; i++) cin >> a[i];\n\t\tint re... |
aoj_2031_cpp | Problem B:
Hyper Rock-Scissors-Paper
Rock-Scissors-Paper is a game played with hands and often used for random choice of a person for some
purpose. Today, we have got an extended version, namely,
Hyper Rock-Scissors-Paper
(or Hyper RSP
for short).
In a game of Hyper RSP, the players simultaneously presents their hands ... | [
{
"submission_id": "aoj_2031_10858250",
"code_snippet": "#include <string>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nvector<string> r = {\n\t\"Rock\",\n\t\"Gun\",\n\t\"Lightning\",\n\t\"Devil\",\n\t\"Dragon\",\n\t\"Water\",\n\t\"Air\",\n\t\"Paper\",\n\t\"Sponge\",\... |
aoj_2036_cpp | Problem G:
Traffic
You are a resident of Kyoot (oh, well, it’s not a misspelling!) city. All streets there are neatly built on a
grid; some streets run in a meridional (north-south) direction and others in a zonal (east-west) direction.
The streets that run from north to south are called avenues, whereas those which ru... | [
{
"submission_id": "aoj_2036_6775560",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに... |
aoj_2030_cpp | Problem A:
Ruins
In 1936, a dictator Hiedler who aimed at world domination had a deep obsession with
the Lost Ark
. A
person with this ark would gain mystic power according to legend. To break the ambition of the dictator,
ACM (the Alliance of Crusaders against Mazis) entrusted a secret task to an archeologist Indiana ... | [
{
"submission_id": "aoj_2030_2645406",
"code_snippet": "#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\n\nvector<long long int> divisor(long long int n) {\n\tvector<long long int> res;\n\tfor (long long int i = 1; i * i <= n;... |
aoj_2034_cpp | Problem E:
Autocorrelation Function
Nathan O. Davis is taking a class of signal processing as a student in engineering. Today’s topic of the
class was autocorrelation. It is a mathematical tool for analysis of signals represented by functions or
series of values. Autocorrelation gives correlation of a signal with itsel... | [
{
"submission_id": "aoj_2034_10794058",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n cout.setf(ios::fixed);\n cout << setprecision(15);\n\n int n;\n long double r;\n while ( (cin >> n >> r) ) {... |
aoj_2035_cpp | Problem F:
It Prefokery Pio
You are a member of a secret society named
Japanese Abekobe Group
, which is called J. A. G. for short.
Those who belong to this society often exchange encrypted messages. You received lots of encrypted
messages this morning, and you tried to decrypt them as usual. However, because you recei... | [
{
"submission_id": "aoj_2035_10722445",
"code_snippet": "#include<bits/stdc++.h>\n//#include<atcoder/all>\nusing namespace std;\n//using namespace atcoder;\n\nusing ll = long long;\nusing ld = long double;\n\n//using mint = modint998244353;\n//using mint = modint1000000007;\n\ntemplate<class T> using pq = p... |
aoj_2041_cpp | Problem C:
Disarmament of the Units
This is a story in a country far away. In this country, two armed groups, ACM and ICPC, have
fought in the civil war for many years. However, today October 21, reconciliation was approved
between them; they have marked a turning point in their histories.
In this country, there are a ... | [
{
"submission_id": "aoj_2041_124929",
"code_snippet": "#include<iostream>\n#include<complex>\n#include<map>\n#include<algorithm>\n#include<set>\n#include<queue>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define pb push_back\n#define mp make_pair\n#define ... |
aoj_2033_cpp | Problem D:
Rock Man
You were the master craftsman in the stone age, and you devoted your life to carving many varieties of
tools out of natural stones. Your works have ever been displayed respectfully in many museums, even in
2006 A.D. However, most people visiting the museums do not spend so much time to look at your ... | [
{
"submission_id": "aoj_2033_10852644",
"code_snippet": "#include <bits/stdc++.h>\n \n#define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ )\n#define REP(i,n) FOR(i,0,n)\n#define YYS(x,arr) for(auto& x:arr)\n#define ALL(x) (x).begin(),(x).end()\n#define SORT(x) sort( (x).begin(),(x).end() )\n#define RE... |
aoj_2044_cpp | Problem F:
Lying about Your Age
You have moved to a new town. As starting a new life, you have made up your mind to do
one thing: lying about your age. Since no person in this town knows your history, you don’t
have to worry about immediate exposure. Also, in order to ease your conscience somewhat,
you have decided to ... | [
{
"submission_id": "aoj_2044_9685683",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int a,b,c;\n while(cin >> a >> b >> c && a!=-1) {\n bool f=0;\n for(int i=2; i<17; i++) {\n int x=0,z=a;\n string s=\"\";\n while(z) {\n s+=(char)(z%i+'0');\... |
aoj_2042_cpp | Problem D:
So Sleepy
You have an appointment to meet a friend of yours today, but you are so sleepy because you
didn’t sleep well last night.
As you will go by trains to the station for the rendezvous, you can have a sleep on a train. You
can start to sleep as soon as you get on a train and keep asleep just until you g... | [
{
"submission_id": "aoj_2042_10850499",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <vector>\n\nusing namespace std;\n\nint dp[1000][24 * 60][2];\nint n, m, dest, destTime;\n\nvector<pair<int, int>> lines[100], stationInfo[1000][24 * 60]; // time, station / line index\n\nint getAns(int ... |
aoj_2046_cpp | Problem H:
Robot's Crash
Prof. Jenifer A. Gibson is carrying out experiments with many robots. Since those robots are
expensive, she wants to avoid their crashes during her experiments at her all effort. So she asked
you, her assistant, as follows.
“Suppose that we have
n
(2 ≤
n
≤ 100000) robots of the circular shape w... | [
{
"submission_id": "aoj_2046_8436730",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに... |
aoj_2040_cpp | Problem B:
Sort the Panels
There was an explorer Henry Nelson traveling all over the world. One day he reached an ancient
building. He decided to enter this building for his interest, but its entrance seemed to be locked
by a strange security system.
There were some black and white panels placed on a line at equal inte... | [
{
"submission_id": "aoj_2040_10853102",
"code_snippet": "#include <cstring>\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint getStat(string arg) {\n\tint ret = 0;\n\tfor(char ch: arg)\n\t\tif(ch == 'B') ret = ret * 2 + 1;\n\t\telse ret *= 2;\n\treturn ret;\n}\n\nint dp[1 << 16][16];\ni... |
aoj_2039_cpp | Problem A:
Space Coconut Crab II
A space hunter, Ken Marineblue traveled the universe, looking for the space coconut crab. The
space coconut crab was a crustacean known to be the largest in the universe. It was said that
the space coconut crab had a body of more than 400 meters long and a leg span of no shorter
than 10... | [
{
"submission_id": "aoj_2039_10850472",
"code_snippet": "#include <stdio.h>\n#define MAX 30010\n\nint dy[MAX], prime[MAX];\nint n, pcnt;\nbool p[MAX];\n\nvoid getprime(void){\n\tint i, j;\n\tfor (i=2;i<=15000;i++){\n\t\tif (p[i]) continue;\n\t\tprime[++pcnt]=i;\n\t\tfor (j=i*i;j<=15000;j+=i){\n\t\t\tp[j]=1;... |
aoj_2048_cpp | Problem A:
Everlasting...?
Everlasting Sa-Ga, a new, hot and very popular role-playing game, is out on October 19, 2008.
Fans have been looking forward to a new title of Everlasting Sa-Ga.
Little Jimmy is in trouble. He is a seven-year-old boy, and he obtained the Everlasting Sa-Ga
and is attempting to reach the end of... | [
{
"submission_id": "aoj_2048_4109877",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\nusing namespace std;\ntypedef long long int ll;\n\nint key(int x){\n\tint s=0,m=0;\n\tfor(int i=2;i<=x;i++){\n\t\tif(x%i==0){\n\t\t\ts+=i;\n\t\t\tm=i;\n\t\t\twhile(x%i==0){\n... |
aoj_2045_cpp | Problem G:
Turn Polygons
HCII, the health committee for interstellar intelligence, aims to take care of the health of every
interstellar intelligence.
Staff of HCII uses a special equipment for health checks of patients. This equipment looks like a
polygon-shaped room with plenty of instruments. The staff puts a patien... | [
{
"submission_id": "aoj_2045_5499629",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n//#define EPS 0.000000001\nusing namespace std;\n\n\n#define... |
aoj_2050_cpp | Problem C:
Dig or Climb
Benjamin Forest VIII is a king of a country. One of his best friends Nod lives in a village far from
his castle. Nod gets seriously sick and is on the verge of death. Benjamin orders his subordinate
Red to bring good medicine for him as soon as possible. However, there is no road from the
castle... | [
{
"submission_id": "aoj_2050_3057190",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\n#include <map>\n#include <queue>\nusing namespace std;\nconst double EPS = 1e-6;\nconst double INF = 1e12;\nconst ... |
aoj_2049_cpp | Problem B:
Headstrong Student
You are a teacher at a cram school for elementary school pupils.
One day, you showed your students how to calculate division of fraction in a class of mathematics.
Your lesson was kind and fluent, and it seemed everything was going so well - except for one
thing. After some experiences, a ... | [
{
"submission_id": "aoj_2049_10748216",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint m[1000005];\n\nint main() {\n ios_base::sync_with_stdio(false); cin.tie(NULL);\n while (true) {\n int x, y; cin >> x >> y;\n if (!x) break;\n for (int i = 0;i < y;i++) m[i]... |
aoj_2054_cpp | Problem G:
Entangled Tree
The electronics division in Ishimatsu Company consists of various development departments
for electronic devices including disks and storages, network devices, mobile phones, and many
others. Each department covers a wide range of products. For example, the department of disks
and storages dev... | [
{
"submission_id": "aoj_2054_1679749",
"code_snippet": "#include <bits/stdc++.h>\n\n#define x first\n#define y second\n#define pb push_back\n#define pii pair<int,int>\n#define ll long long\n#define FOR(i, a, b) for(int i = (int)(a); i < (int)(b); i++)\n#define REP(i, a) FOR(i, 0, a)\n#define TRACE(x) cout <... |
aoj_2055_cpp | Problem H:
Ramen Shop
Ron is a master of a ramen shop.
Recently, he has noticed some customers wait for a long time. This has been caused by lack of
seats during lunch time. Customers loses their satisfaction if they waits for a long time, and
even some of them will give up waiting and go away. For this reason, he has ... | [
{
"submission_id": "aoj_2055_9149012",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに... |
aoj_2051_cpp | Problem D:
Rotation Estimation
Mr. Nod is an astrologist and has defined a new constellation. He took two photos of the
constellation to foretell a future of his friend. The constellation consists of
n
stars. The shape
of the constellation in these photos are the same, but the angle of them are different because
these ... | [
{
"submission_id": "aoj_2051_5500120",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n//#define EPS 0.000000001\nusing namespace std;\n\n\n#define... |
aoj_2053_cpp | Problem F:
Controlled Tournament
National Association of Tennis is planning to hold a tennis competition among professional
players. The competition is going to be a knockout tournament, and you are assigned the task
to make the arrangement of players in the tournament.
You are given the detailed report about all parti... | [
{
"submission_id": "aoj_2053_10848151",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nconst int MAXN = 1 << 16;\nint n, m;\nint bit1[MAXN]; // 二进制数中有多少个 1\nint dp[20][10][MAXN];\nvector<int> G[20];\nint dfs(int u, int h, int bits) {\n if(bit1[bits] == 1) return 1;\n if((1 << h) < bit... |
aoj_2052_cpp | Problem E:
Optimal Rest
Music Macro Language (MML) is a language for textual representation of musical scores. Although there are various dialects of MML, all of them provide a set of commands to describe
scores, such as commands for notes, rests, octaves, volumes, and so forth.
In this problem, we focus on rests, i.e.... | [
{
"submission_id": "aoj_2052_10233879",
"code_snippet": "// AOJ #2052 Optimal Rest\n// 2025.2.20\n\n#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1e9;\n\nstruct Coin {\n string s;\n int cost;\n int value;\n};\n \nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n ... |
aoj_2059_cpp | Problem B:
Restaurant
Steve runs a small restaurant in a city. Also, as he is the only cook in his restaurant, he cooks everything
ordered by customers.
Basically he attends to orders by
first-come-first-served
principle. He takes some prescribed time to
prepare each dish. As a customer can order more than one dish at ... | [
{
"submission_id": "aoj_2059_1367835",
"code_snippet": "#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#in... |
aoj_2058_cpp | Problem A:
Moduic Squares
Have you ever heard of Moduic Squares? They are like 3 × 3 Magic Squares, but each of them has one
extra cell called a moduic cell. Hence a Moduic Square has the following form.
Figure 1: A Moduic Square
Each of cells labeled from A to J contains one number from 1 to 10, where no two cells con... | [
{
"submission_id": "aoj_2058_6825904",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint a[3][3], m, ans;\nbool chk[11];\n\nvoid f(int p) {\n\tif (p == 10) {\n\t\tset<int> num, mod;\n\t\tnum.insert(m);\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tfor (int j = 0; j < 3; j++) num.insert(a[i]... |
aoj_2062_cpp | Problem E:
Hide-and-seek
Hide-and-seek
is a children’s game. Players hide here and there, and one player called
it
tries to find all
the other players.
Now you played
it
and found all the players, so it’s turn to hide from
it
. Since you have got tired of
running around for finding players, you don’t want to play
it
ag... | [
{
"submission_id": "aoj_2062_3114687",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\n#include <map>\n#include <utility>\n#include <queue>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double... |
aoj_2063_cpp | Problem F:
TV Watching
You are addicted to watching TV, and you watch so many TV programs every day. You have been in
trouble recently: the airtimes of your favorite TV programs overlap.
Fortunately, you have both a TV and a video recorder at your home. You can therefore watch a program
on air while another program (on... | [
{
"submission_id": "aoj_2063_10312968",
"code_snippet": "// AOJ #2063 TV Watching\n// 2025.3.20\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Prog { int s, e, r1, r2; };\n\nint toMin(const string &t) {\n int hh = stoi(t.substr(0, t.find(':')));\n int mm = stoi(t.substr(t.find(':')+1));\n... |
aoj_2066_cpp | Problem I:
Roads in a City
Roads in a city play important roles in development of the city. Once a road is built, people start their
living around the road. A broader road has a bigger capacity, that is, people can live on a wider area
around the road.
Interstellar Conglomerate of Plantation and Colonization (ICPC) is ... | [
{
"submission_id": "aoj_2066_5469291",
"code_snippet": "#include <bits/stdc++.h>\n#include <stdlib.h>\n#include <cassert>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vec;\n\n#define _GLIBCXX_DEBUG\n#define REP(i,a,b) for(int i=(int)a;i<(int)b;i++)\n#define rep(i,n) REP(i,0,n)\n#define p... |
aoj_2057_cpp | The Closest Circle
You are given
N
non-overlapping circles in xy-plane. The radius of each circle varies, but the radius of
the largest circle is not double longer than that of the smallest.
Figure 1: The Sample Input
The distance between two circles
C
1
and
C
2
is given by the usual formula
where (
x
i
,
y
i
) is the ... | [
{
"submission_id": "aoj_2057_10946135",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <cmath>\n#define ele int\nusing namespace std;\n#define maxn 100010\n#define INF 1e18\n#define eps 1e-7\nstruct circle{\n\tdouble x,y,r;\n};\nele n;\ndouble R;\ncircle a[maxn];\ninl... |
aoj_2065_cpp | Problem H:
Slippy Floors
The princess of the Fancy Kingdom has been loved by many people for her lovely face. However the
witch of the Snow World has been jealous of the princess being loved. For her jealousy, the witch has
shut the princess into the Ice Tower built by the witch’s extreme magical power.
As the Ice Towe... | [
{
"submission_id": "aoj_2065_861603",
"code_snippet": "/*\n00:42 - 01:17\n */\n\n#include<iostream>\n#include<algorithm>\n#include<climits>\n#include<cstdio>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define IINF (INT_MAX)\n#define MAX 31\nusing namespace std;\n\nint H,W;\nboo... |
aoj_2061_cpp | Problem D:
International Party
Isaac H. Ives is attending an international student party (maybe for girl-hunting). Students there enjoy
talking in groups with excellent foods and drinks. However, since students come to the party from all
over the world, groups may not have a language spoken by all students of the group... | [
{
"submission_id": "aoj_2061_10532388",
"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;\nusin... |
aoj_2060_cpp | Problem C:
Tetrahedra
Peter P. Pepper is facing a difficulty.
After fierce battles with the Principality of Croode, the Aaronbarc Kingdom, for which he serves, had
the last laugh in the end. Peter had done great service in the war, and the king decided to give him a
big reward. But alas, the mean king gave him a hard q... | [
{
"submission_id": "aoj_2060_9723100",
"code_snippet": "#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nint s[3];\n\nbool f1(int a, int b, int c) {\n s[0] = a, s[1] = b, s[2] = c;\n sort(s, s + 3);\n return s[0] + s[1] > s[2];\n}\n\ndouble f2(double l1, double l2, double l3, double l4, double... |
aoj_2064_cpp | Problem G:
Make Friendships
Isaac H. Ives attended an international student party and made a lot of girl friends (as many other persons
expected). To strike up a good friendship with them, he decided to have dates with them. However, it
is hard for him to schedule dates because he made so many friends. Thus he decided ... | [
{
"submission_id": "aoj_2064_11055694",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)\n#defi... |
aoj_2067_cpp | Reading Brackets in English
Shun and his professor are studying Lisp and S-expressions. Shun is in Tokyo in order to make a presen-
tation of their research. His professor cannot go with him because of another work today.
He was making final checks for his slides an hour ago. Then, unfortunately, he found some serious
... | [
{
"submission_id": "aoj_2067_10313005",
"code_snippet": "// AOJ #2067 Reading Brackets in English\n// 2025.3.20\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Ans {\n bool valid, amb;\n string s;\n};\n\nAns mergeAns(const Ans &a, const Ans &b) {\n if(!a.valid) return b;\n if(!b.vali... |
aoj_2073_cpp | The Phantom
Mr. Hoge is in trouble. He just bought a new mansion, but it’s haunted by a phantom. He asked a famous conjurer
Dr. Huga to get rid of the phantom. Dr. Huga went to see the mansion, and found that the phantom is scared by
its own mirror images. Dr. Huga set two flat mirrors in order to get rid of the phanto... | [
{
"submission_id": "aoj_2073_3224441",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\n#include <utility>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\n#define EQ(n,m) (abs... |
aoj_2075_cpp | Dock to the Future
You had long wanted a spaceship, and finally you bought a used one yesterday! You have heard that the most
difficult thing on spaceship driving is to stop your ship at the right position in the dock. Of course you are no
exception. After a dozen of failures, you gave up doing all the docking process ... | [
{
"submission_id": "aoj_2075_9659676",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <iomanip>\nusing namespace std;\nvoid solve(){\n int n, q;\n cin >> n;\n vector<int> a(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n cin >> q;\n while (q--){\n int x, v;\n ... |
aoj_2071_cpp | Web 0.5
In a forest, there lived a spider named Tim. Tim was so smart that he created a huge, well-structured web.
Surprisingly, his web forms a set of equilateral and concentric
N
-sided polygons whose edge lengths
form an arithmetic sequence.
Figure 1: An example web of Tim
Corresponding vertices of the N-sided polyg... | [
{
"submission_id": "aoj_2071_4823005",
"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\n#define SIZE 605\n\n... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.