結果
問題 | No.1152 10億ゲーム |
ユーザー | Enjapma_kyopro |
提出日時 | 2020-08-07 21:45:26 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,280 bytes |
コンパイル時間 | 1,775 ms |
コンパイル使用メモリ | 171,820 KB |
実行使用メモリ | 24,528 KB |
平均クエリ数 | 26.84 |
最終ジャッジ日時 | 2023-09-24 04:18:49 |
合計ジャッジ時間 | 8,074 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
24,192 KB |
testcase_01 | AC | 66 ms
23,580 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 66 ms
23,616 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 65 ms
23,496 KB |
testcase_09 | AC | 65 ms
23,592 KB |
testcase_10 | AC | 65 ms
23,580 KB |
testcase_11 | AC | 65 ms
23,340 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 65 ms
23,376 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 66 ms
23,892 KB |
testcase_21 | AC | 67 ms
23,448 KB |
testcase_22 | AC | 66 ms
23,436 KB |
testcase_23 | AC | 66 ms
23,472 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | AC | 66 ms
23,352 KB |
testcase_41 | AC | 68 ms
24,240 KB |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | AC | 67 ms
23,592 KB |
testcase_47 | AC | 66 ms
23,604 KB |
testcase_48 | AC | 66 ms
23,436 KB |
testcase_49 | AC | 67 ms
24,084 KB |
コンパイルメッセージ
次のファイルから読み込み: /usr/local/gcc7/include/c++/12.2.0/istream:39, 次から読み込み: /usr/local/gcc7/include/c++/12.2.0/sstream:38, 次から読み込み: /usr/local/gcc7/include/c++/12.2.0/complex:45, 次から読み込み: /usr/local/gcc7/include/c++/12.2.0/ccomplex:39, 次から読み込み: /usr/local/gcc7/include/c++/12.2.0/x86_64-pc-linux-gnu/bits/stdc++.h:54, 次から読み込み: main.cpp:1: メンバ関数 ‘std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(long long int) [with _CharT = char; _Traits = std::char_traits<char>]’ 内, inlined from ‘void solve()’ at main.cpp:155:9: /usr/local/gcc7/include/c++/12.2.0/ostream:202:25: 警告: ‘p’ may be used uninitialized [-Wmaybe-uninitialized] 202 | { return _M_insert(__n); } | ~~~~~~~~~^~~~~ main.cpp: 関数 ‘void solve()’ 内: main.cpp:147:12: 備考: ‘p’ はここで定義されています 147 | ll p; | ^
ソースコード
#include <bits/stdc++.h> #include <unistd.h> #include <sys/time.h> #include <stdlib.h> using namespace std; typedef long long ll; typedef pair<ll, ll> P; typedef pair<P, ll> T; typedef pair<long double , ll> Ps; typedef pair<ll, bool> Pb; const ll INF = 1e18; const ll fact_table = 3200008; long double Pi = 3.1415926535897932384626; priority_queue <ll> pql; priority_queue <P> pqp; priority_queue <P> bag; //big priority queue priority_queue <ll, vector<ll>, greater<ll> > pqls; priority_queue <P, vector<P>, greater<P> > pqps; //small priority queue //top pop ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1}; ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1}; //↓,→,↑,← /* #define endl "\n" #ifdef ENJAPMA #undef endl #endif */ #define p(x) cout<<x<<endl; #define el cout<<endl; #define pe(x) cout<<x<<" "; #define ps(x) cout<<fixed<<setprecision(25)<<x<<endl; #define pu(x) cout<<(x); #define pb push_back #define lb lower_bound #define ub upper_bound #define CLEAR(a) a = decltype(a)(); #define pc(x) cout << x << ","; #define rep(i, n) for (ll i = 0; i < (n); i ++) // const ll mod = 998244353ll; const ll mod = 1000000007ll; ll mypow(ll a, ll b, ll mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= mod; b >>= 1;}(x *= a) %= mod; b--;} return x;} void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;} void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;} void line() { p("--------------------"); return;} /* ll fact[fact_table + 5], rfact[fact_table + 5]; void c3_init() { fact[0] = rfact[0] = 1; for (ll i = 1; i <= fact_table; i++) { fact[i] = (fact[i - 1] * i) % mod; } rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod); for (ll i = fact_table; i >= 1; i--) { rfact[i - 1] = rfact[i] * i; rfact[i - 1] %= mod; } return; } ll c3(ll n, ll r) { return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod; } */ struct Timer { int64_t start; const int64_t CYCLES_PER_SEC = 2800000000; Timer() { reset(); } void reset() { start = getCycle(); } inline double get() { return (double)(getCycle() - start) / CYCLES_PER_SEC; } inline int64_t getCycle() { uint32_t low, high; __asm__ volatile ("rdtsc" : "=a" (low), "=d" (high)); return ((int64_t)low) | ((int64_t)high << 32); } }; Timer timer; bool multicase = false; ll n, m, k, w, num, a, b, c, d, e, h, q, ans, sum, l; typedef vector<ll> vec; typedef vector<vector<ll>> mat; P decode(ll a){ ll cnt1 = 0, cnt2 = 0; while(a % 2 == 0) { a /= 2; cnt1 ++; } while(a % 5 == 0) { a /= 5; cnt2 ++; } return P(cnt1, cnt2); } ll encode(ll a, ll dx, ll dy) { if (dx == 1) return 2ll * a; if (dx == -1) return a / 2ll; if (dy == 1) return 5ll * a; if (dy == -1) return a / 5ll; return -1; } void solve(){ cin >> a >> b; ll turn = 0; while(true){ P i = decode(a); ll na; if (i == P(4, 4)) break; if (i.first < 4) { na = encode(a, 1, 0); } else if (i.first > 4) { na = encode(a, -1, 0); } else if (i.second > 4) { na = encode(a, 0, -1); } else { na = encode(a, 0, 1); } p(na); a = na; if (a == b) return; cin >> b; if (a == b) return; } while(true){ turn ++; if (turn > 35) assert(false); P i = decode(a), you = decode(b); ll dx = i.first - you.first; ll dy = i.second - you.second; ll p; if (abs(dx) > abs(dy)) { if (dx > 0) p = encode(a, -1, 0); if (dx < 0) p = encode(a, 1, 0); } else { if (dy > 0) p = encode(a, 0, -1); if (dy < 0) p = encode(a, 0, 1); } p(p); a = p; if (a == b) return; cin >> b; if (a == b) return; } return; } int main() { // init(); ios::sync_with_stdio(false); cin.tie(nullptr); ll q, testcase = 1; if (multicase) { cin >> q; } else { q = 1; } while (q--) { // pu("Case ");pu("#");pu(testcase);pu(": "); solve(); testcase++; } // solve(); return 0; }