#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200100;
bool visited[maxn];
int find_best(int n) {
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
srand(time(NULL));
if(n <= 10000) {
for(int i=1;i<=n;i++) {
vector<int>v = ask(i);
if(v[0] == v[1]) return i;
}
}
int fst = 0, lst = INT_MAX;
for(int i=1;i<=4500;i++) {
int x = uniform_int_distribution<int>(0, n)(rng);
while(visited[x]) x = uniform_int_distribution<int>(0, n)(rng);
visited[x] = true;
vector<int>v = ask(x);
if(v[0] == v[1]) return x;
// looking for the last {0, 1}
// looking for the first {1, 0}
if(v[0] == 0) fst = max(fst, x);
else if(v[1] == 0) lst = min(lst, x);
}
for(int i=fst;i<=lst;i++) {
vector<int>v = ask(i);
if(v[0] == v[1]) return i;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
33 ms |
512 KB |
Output is correct |
2 |
Correct |
28 ms |
504 KB |
Output is correct |
3 |
Correct |
29 ms |
504 KB |
Output is correct |
4 |
Correct |
16 ms |
512 KB |
Output is correct |
5 |
Correct |
16 ms |
512 KB |
Output is correct |
6 |
Correct |
42 ms |
512 KB |
Output is correct |
7 |
Correct |
16 ms |
568 KB |
Output is correct |
8 |
Correct |
30 ms |
572 KB |
Output is correct |
9 |
Correct |
51 ms |
504 KB |
Output is correct |
10 |
Correct |
51 ms |
512 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
38 ms |
504 KB |
Output is correct |
2 |
Correct |
37 ms |
512 KB |
Output is correct |
3 |
Correct |
48 ms |
504 KB |
Output is correct |
4 |
Correct |
33 ms |
504 KB |
Output is correct |
5 |
Correct |
37 ms |
504 KB |
Output is correct |
6 |
Correct |
44 ms |
512 KB |
Output is correct |
7 |
Correct |
45 ms |
512 KB |
Output is correct |
8 |
Correct |
37 ms |
508 KB |
Output is correct |
9 |
Correct |
38 ms |
512 KB |
Output is correct |
10 |
Correct |
46 ms |
512 KB |
Output is correct |
11 |
Incorrect |
3 ms |
384 KB |
answer is not correct |
12 |
Halted |
0 ms |
0 KB |
- |