結果
問題 | No.1830 Balanced Majority |
ユーザー | Carpenters-Cat |
提出日時 | 2022-02-04 23:00:20 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,266 bytes |
コンパイル時間 | 2,101 ms |
コンパイル使用メモリ | 202,392 KB |
実行使用メモリ | 25,604 KB |
平均クエリ数 | 11.81 |
最終ジャッジ日時 | 2024-06-11 12:37:05 |
合計ジャッジ時間 | 4,176 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 22 ms
25,208 KB |
testcase_01 | AC | 19 ms
25,208 KB |
testcase_02 | AC | 19 ms
24,824 KB |
testcase_03 | AC | 20 ms
24,952 KB |
testcase_04 | AC | 20 ms
24,668 KB |
testcase_05 | AC | 20 ms
24,952 KB |
testcase_06 | AC | 20 ms
24,824 KB |
testcase_07 | AC | 22 ms
24,580 KB |
testcase_08 | AC | 22 ms
24,836 KB |
testcase_09 | AC | 22 ms
25,476 KB |
testcase_10 | AC | 21 ms
24,964 KB |
testcase_11 | AC | 21 ms
24,964 KB |
testcase_12 | AC | 20 ms
24,964 KB |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | AC | 21 ms
25,220 KB |
testcase_21 | AC | 21 ms
25,208 KB |
testcase_22 | AC | 22 ms
24,964 KB |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | AC | 20 ms
24,580 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; int calc(int i, int x) { return x - (i - x); } int main () { int N; cin >> N; int b = N / 2; int a = N / 4; int c = a + b; int p, q, r; cout << "? " << a << endl; cin >> p; cout << "? " << b << endl; cin >> q; cout << "? " << c << endl; cin >> r; p = calc(a, p); q = calc(b, q); r = calc(c, r); if (p == 0) { cout << "! " << a + 1 << " " << N << endl; cin >> N; if (N == -1) { return 139; } return 0; } if (q == 0) { cout << "! " << b + 1 << " " << N << endl; cin >> N; if (N == -1) { return 139; } return 0; } if (r == 0) { cout << "! " << 1 << " " << c << endl; cin >> N; if (N == -1) { return 139; } return 0; } if (p == r) { cout << "! " << a + 1 << " " << c << endl; int x; cin >> x; if (x == -1) { return 139; } return 0; } int mi = 1; int ma = a; if ((p > 0) != (q > 0)) { mi = a; ma = b; while (mi != ma) { int mu = (mi + ma) / 2; cout << "? " << mu << endl; int x; cin >> x; if (x == -1) { return 139; } x = calc(mu, x); if (x == 0) { ma = mi = mu; } if ((p > 0) == (x > 0)) { mi = mu + 1; } else { ma = mu - 1; } } cout << "! " << mi + 1 << " " << N << endl; int x; cin >> x; if (x == -1) { return 139; } return 0; } if ((q > 0) != (r > 0)) { mi = b; ma = c; while (mi != ma) { int mu = (mi + ma) / 2; cout << "? " << mu << endl; int x; cin >> x; if (x == -1) { return 139; } x = calc(mu, x); if (x == 0) { ma = mi = mu; } if ((q > 0) == (x > 0)) { mi = mu + 1; } else { ma = mu - 1; } } cout << "! " << 1 << " " << mi << endl; int x; cin >> x; if (x == -1) { return 139; } return 0; } if (abs(r) > abs(p)) { mi = c; ma = N; swap(r, p); } while (ma != mi) { int mu = (ma + mi) / 2; cout << "? " << mu << endl; int x; cin >> x; if (x == -1) { return 139; } x = calc(mu, x); if (x == r) { ma = mi = mu; } else if ((x < r) == (x < p)) { if (mi >= c) { ma = mu; } else { mi = mu + 1; } } else { if (mi >= c) { mi = mu + 1; } else { ma = mu; } } } if (mi >= c) { cout << "! " << a + 1 << ' ' << mi << endl; } else { cout << "! " << mi + 1 << " " << c << endl; } }