#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5,S=200;
int ans[N][2];
int find_best(int n) {
int s=0,mx=0;
for (int i=0;i<min(S,n);i++){
vector<int> v=ask(i);
ans[i][0]=v[0];
ans[i][1]=v[1];
if (v[0]+v[1]==0) return i;
if (v[0]+v[1]>mx){
mx=v[0]+v[1];
s=i;
}
}
//cout<<s<<endl;
for (int i=s;i+S<n;i+=S){
vector<int> v=ask(i+S);
ans[i+S][0]=v[0];
ans[i+S][1]=v[1];
if (v[0]+v[1]==0) return i+S;
if (v[0]==ans[i][0] && v[1]==ans[i][1]) continue;
for (int j=i+1;j<i+S;j++){
v=ask(j);
ans[j][0]=v[0];
ans[j][1]=v[1];
if (v[0]+v[1]==0) return j;
}
}
for (int i=max(0,n-S);i<n;i++){
vector<int> v=ask(i);
ans[i][0]=v[0];
ans[i][1]=v[1];
if (v[0]+v[1]==0) return i;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
600 KB |
Output is correct |
2 |
Correct |
3 ms |
1368 KB |
Output is correct |
3 |
Correct |
4 ms |
1112 KB |
Output is correct |
4 |
Correct |
7 ms |
1828 KB |
Output is correct |
5 |
Correct |
3 ms |
1112 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
3 ms |
1112 KB |
Output is correct |
8 |
Correct |
4 ms |
1112 KB |
Output is correct |
9 |
Correct |
4 ms |
1112 KB |
Output is correct |
10 |
Correct |
10 ms |
1880 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
600 KB |
Output is correct |
2 |
Correct |
4 ms |
1368 KB |
Output is correct |
3 |
Correct |
4 ms |
1412 KB |
Output is correct |
4 |
Correct |
7 ms |
1880 KB |
Output is correct |
5 |
Correct |
5 ms |
1112 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
3 ms |
1112 KB |
Output is correct |
8 |
Correct |
4 ms |
1112 KB |
Output is correct |
9 |
Correct |
4 ms |
1112 KB |
Output is correct |
10 |
Correct |
6 ms |
1880 KB |
Output is correct |
11 |
Correct |
24 ms |
1068 KB |
Output is correct |
12 |
Correct |
2 ms |
344 KB |
Output is correct |
13 |
Partially correct |
31 ms |
1856 KB |
Partially correct - number of queries: 7821 |
14 |
Correct |
8 ms |
456 KB |
Output is correct |
15 |
Incorrect |
70 ms |
716 KB |
Incorrect |
16 |
Halted |
0 ms |
0 KB |
- |