# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
299564 |
2020-09-15T08:06:21 Z |
E869120 |
Colors (BOI20_colors) |
C++14 |
|
1 ms |
384 KB |
#include <bits/stdc++.h>
using namespace std;
int Debug = 1;
long long N;
long long C = 8;
long long prevs = 0;
int getans(long long pos) {
cout << "? " << pos << endl;
if (Debug == 1) {
int x;
cin >> x;
return x;
}
if (Debug == 2) {
int x = -1;
if (abs(prevs - pos) < C) x = 0;
else x = 1;
prevs = pos;
return x;
}
return -1;
}
int main() {
// Step #1. Input
cin >> N;
if (N == 1) {
cout << "= 1" << endl;
return 0;
}
// Step #2. Get Answer
long long cl = 1, cr = (N / 2) + 1, cm, minx = N;
long long pre = -1;
map<long long, int> Map;
for (int i = 0; i < 100; i++) {
cm = (cl + cr) / 2; if (Map[cm] == 1) break;
Map[cm] = 1;
int z1 = getans(cm);
if (pre != -1LL && z1 == 1) minx = min(minx, abs(pre - cm));
pre = cm;
int z2 = getans(N + 1LL - cm);
if (pre != -1LL && z2 == 1) minx = min(minx, abs(pre - (N + 1LL - cm)));
pre = N + 1LL - cm;
if (z2 == 1) { cl = cm; }
else { cr = cm; }
}
// Step #3. Baaiwake
if (N % 2LL == 1LL) {
int z3 = getans(N / 2LL + 1LL);
if (pre != -1LL && z3 == 1) minx = min(minx, abs(pre - (N / 2LL + 1LL)));
}
// Step #4. Get Answer
cout << "= " << minx << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
OK (5 queries) |
2 |
Correct |
1 ms |
256 KB |
OK (11 queries) |
3 |
Correct |
1 ms |
384 KB |
OK (6 queries) |
4 |
Correct |
1 ms |
384 KB |
OK (8 queries) |
5 |
Correct |
1 ms |
288 KB |
OK (7 queries) |
6 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
7 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
8 |
Correct |
1 ms |
384 KB |
OK (9 queries) |
9 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
10 |
Correct |
1 ms |
256 KB |
OK (7 queries) |
11 |
Correct |
1 ms |
288 KB |
OK (6 queries) |
12 |
Correct |
1 ms |
256 KB |
OK (7 queries) |
13 |
Correct |
1 ms |
256 KB |
OK (11 queries) |
14 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
15 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
16 |
Incorrect |
1 ms |
256 KB |
Wrong guess |
17 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
OK (5 queries) |
2 |
Correct |
1 ms |
256 KB |
OK (11 queries) |
3 |
Correct |
1 ms |
384 KB |
OK (6 queries) |
4 |
Correct |
1 ms |
384 KB |
OK (8 queries) |
5 |
Correct |
1 ms |
288 KB |
OK (7 queries) |
6 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
7 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
8 |
Correct |
1 ms |
384 KB |
OK (9 queries) |
9 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
10 |
Correct |
1 ms |
256 KB |
OK (7 queries) |
11 |
Correct |
1 ms |
288 KB |
OK (6 queries) |
12 |
Correct |
1 ms |
256 KB |
OK (7 queries) |
13 |
Correct |
1 ms |
256 KB |
OK (11 queries) |
14 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
15 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
16 |
Incorrect |
1 ms |
256 KB |
Wrong guess |
17 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
OK (5 queries) |
2 |
Correct |
1 ms |
256 KB |
OK (11 queries) |
3 |
Correct |
1 ms |
384 KB |
OK (6 queries) |
4 |
Correct |
1 ms |
384 KB |
OK (8 queries) |
5 |
Correct |
1 ms |
288 KB |
OK (7 queries) |
6 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
7 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
8 |
Correct |
1 ms |
384 KB |
OK (9 queries) |
9 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
10 |
Correct |
1 ms |
256 KB |
OK (7 queries) |
11 |
Correct |
1 ms |
288 KB |
OK (6 queries) |
12 |
Correct |
1 ms |
256 KB |
OK (7 queries) |
13 |
Correct |
1 ms |
256 KB |
OK (11 queries) |
14 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
15 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
16 |
Incorrect |
1 ms |
256 KB |
Wrong guess |
17 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
OK (5 queries) |
2 |
Correct |
1 ms |
256 KB |
OK (11 queries) |
3 |
Correct |
1 ms |
384 KB |
OK (6 queries) |
4 |
Correct |
1 ms |
384 KB |
OK (8 queries) |
5 |
Correct |
1 ms |
288 KB |
OK (7 queries) |
6 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
7 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
8 |
Correct |
1 ms |
384 KB |
OK (9 queries) |
9 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
10 |
Correct |
1 ms |
256 KB |
OK (7 queries) |
11 |
Correct |
1 ms |
288 KB |
OK (6 queries) |
12 |
Correct |
1 ms |
256 KB |
OK (7 queries) |
13 |
Correct |
1 ms |
256 KB |
OK (11 queries) |
14 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
15 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
16 |
Incorrect |
1 ms |
256 KB |
Wrong guess |
17 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
OK (5 queries) |
2 |
Correct |
1 ms |
256 KB |
OK (11 queries) |
3 |
Correct |
1 ms |
384 KB |
OK (6 queries) |
4 |
Correct |
1 ms |
384 KB |
OK (8 queries) |
5 |
Correct |
1 ms |
288 KB |
OK (7 queries) |
6 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
7 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
8 |
Correct |
1 ms |
384 KB |
OK (9 queries) |
9 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
10 |
Correct |
1 ms |
256 KB |
OK (7 queries) |
11 |
Correct |
1 ms |
288 KB |
OK (6 queries) |
12 |
Correct |
1 ms |
256 KB |
OK (7 queries) |
13 |
Correct |
1 ms |
256 KB |
OK (11 queries) |
14 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
15 |
Correct |
1 ms |
256 KB |
OK (10 queries) |
16 |
Incorrect |
1 ms |
256 KB |
Wrong guess |
17 |
Halted |
0 ms |
0 KB |
- |