// In the name of Allah
#include <bits/stdc++.h>
#include "prize.h"
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef complex<ld> cld;
#define all(x) (x).begin(),(x).end()
#define len(x) ((ll) (x).size())
#define F first
#define S second
#define pb push_back
#define sep ' '
#define endl '\n'
#define Mp make_pair
#define kill(x) cout << x << '\n', exit(0)
#define set_dec(x) cout << fixed << setprecision(x);
#define file_io(x,y) freopen(x, "r", stdin); freopen(y, "w", stdout);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 2e5 + 7;
int n;
pii A[maxn];
void askx(int i) {
if (A[i].F != -1) return ;
vector<int> res = ask(i);
A[i] = Mp(res[0], res[1]);
return ;
}
int find_best(int n) {
fill(A, A + n, Mp(-1, -1));
if (n <= 5000) {
for (int i = 0; i < n; i++) {
askx(i);
if (A[i].F + A[i].S == 0) return i;
}
return -1;
}
int mx = 0;
for (int i = 0; i < 475; i++) {
askx(i);
if (A[i].F + A[i].S == 0) return i;
mx = max(mx, A[i].F + A[i].S);
}
int i = 0;
while (i < n) {
askx(i);
if (A[i].F + A[i].S == 0) return i;
else if (A[i].F + A[i].S != mx) {
i++;
continue;
}
int M = 1024;
if (i + M < n) {
int j = i + M; askx(j);
if (A[j].F + A[j].S == 0) return j;
if (A[j].F + A[j].S == mx && A[j].F == A[i].F) {
i = j + 1;
continue;
}
}
bool flag = 0;
int l = i, r = min(n, i + 1024);
while (r - l > 1) {
int mid = (l + r) / 2;
int j = mid; askx(j);
if (A[j].F + A[j].S == 0) return j;
if (A[j].F + A[j].S == mx && A[j].F == A[i].F) {
l = mid;
if (!flag) break;
}
else r = mid;
flag = 1;
}
i = l + 1;
}
return -1;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 2 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 3 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 4 |
Correct |
7 ms |
1980 KB |
Output is correct |
| 5 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1972 KB |
Output is correct |
| 7 |
Correct |
3 ms |
1880 KB |
Output is correct |
| 8 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 9 |
Correct |
4 ms |
1980 KB |
Output is correct |
| 10 |
Correct |
4 ms |
1880 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
1972 KB |
Output is correct |
| 2 |
Correct |
5 ms |
1880 KB |
Output is correct |
| 3 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 4 |
Correct |
5 ms |
1880 KB |
Output is correct |
| 5 |
Correct |
5 ms |
1880 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1980 KB |
Output is correct |
| 7 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 8 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 9 |
Correct |
5 ms |
1880 KB |
Output is correct |
| 10 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 11 |
Correct |
6 ms |
1880 KB |
Output is correct |
| 12 |
Correct |
3 ms |
1880 KB |
Output is correct |
| 13 |
Correct |
7 ms |
1880 KB |
Output is correct |
| 14 |
Correct |
5 ms |
600 KB |
Output is correct |
| 15 |
Correct |
8 ms |
1880 KB |
Output is correct |
| 16 |
Correct |
25 ms |
1880 KB |
Output is correct |
| 17 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 18 |
Partially correct |
23 ms |
1880 KB |
Partially correct - number of queries: 5831 |
| 19 |
Correct |
3 ms |
1880 KB |
Output is correct |
| 20 |
Correct |
12 ms |
1112 KB |
Output is correct |
| 21 |
Correct |
10 ms |
1980 KB |
Output is correct |
| 22 |
Correct |
5 ms |
1880 KB |
Output is correct |
| 23 |
Correct |
3 ms |
1880 KB |
Output is correct |
| 24 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 25 |
Correct |
16 ms |
1880 KB |
Output is correct |
| 26 |
Correct |
14 ms |
1880 KB |
Output is correct |
| 27 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 28 |
Partially correct |
29 ms |
1972 KB |
Partially correct - number of queries: 5925 |
| 29 |
Correct |
19 ms |
1880 KB |
Output is correct |
| 30 |
Partially correct |
33 ms |
1884 KB |
Partially correct - number of queries: 5710 |
| 31 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 32 |
Correct |
6 ms |
1880 KB |
Output is correct |
| 33 |
Correct |
0 ms |
344 KB |
Output is correct |
| 34 |
Correct |
9 ms |
1880 KB |
Output is correct |
| 35 |
Correct |
3 ms |
1880 KB |
Output is correct |
| 36 |
Correct |
8 ms |
1880 KB |
Output is correct |
| 37 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 38 |
Correct |
2 ms |
1880 KB |
Output is correct |
| 39 |
Correct |
13 ms |
1880 KB |
Output is correct |
| 40 |
Partially correct |
23 ms |
1880 KB |
Partially correct - number of queries: 5010 |
| 41 |
Correct |
14 ms |
2132 KB |
Output is correct |
| 42 |
Correct |
17 ms |
1880 KB |
Output is correct |
| 43 |
Correct |
14 ms |
1880 KB |
Output is correct |
| 44 |
Correct |
9 ms |
1880 KB |
Output is correct |
| 45 |
Correct |
9 ms |
1880 KB |
Output is correct |
| 46 |
Correct |
2 ms |
1880 KB |
Output is correct |
| 47 |
Correct |
14 ms |
1880 KB |
Output is correct |
| 48 |
Correct |
19 ms |
1980 KB |
Output is correct |
| 49 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 50 |
Partially correct |
24 ms |
1880 KB |
Partially correct - number of queries: 5849 |
| 51 |
Correct |
11 ms |
1880 KB |
Output is correct |
| 52 |
Correct |
3 ms |
1880 KB |
Output is correct |
| 53 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 54 |
Correct |
16 ms |
1880 KB |
Output is correct |
| 55 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 56 |
Partially correct |
38 ms |
1880 KB |
Partially correct - number of queries: 5838 |
| 57 |
Correct |
22 ms |
1880 KB |
Output is correct |
| 58 |
Correct |
20 ms |
1880 KB |
Output is correct |
| 59 |
Correct |
13 ms |
1880 KB |
Output is correct |
| 60 |
Correct |
20 ms |
1880 KB |
Output is correct |
| 61 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 62 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 63 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 64 |
Correct |
5 ms |
1880 KB |
Output is correct |
| 65 |
Correct |
5 ms |
1976 KB |
Output is correct |
| 66 |
Correct |
7 ms |
1880 KB |
Output is correct |
| 67 |
Correct |
3 ms |
1880 KB |
Output is correct |
| 68 |
Correct |
3 ms |
1880 KB |
Output is correct |
| 69 |
Correct |
5 ms |
1880 KB |
Output is correct |
| 70 |
Correct |
5 ms |
1880 KB |
Output is correct |
| 71 |
Partially correct |
24 ms |
1880 KB |
Partially correct - number of queries: 5044 |
| 72 |
Correct |
9 ms |
1880 KB |
Output is correct |
| 73 |
Correct |
28 ms |
2132 KB |
Output is correct |
| 74 |
Partially correct |
25 ms |
1880 KB |
Partially correct - number of queries: 5012 |
| 75 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 76 |
Correct |
19 ms |
1880 KB |
Output is correct |
| 77 |
Partially correct |
30 ms |
1880 KB |
Partially correct - number of queries: 5674 |
| 78 |
Correct |
9 ms |
1880 KB |
Output is correct |
| 79 |
Correct |
12 ms |
1880 KB |
Output is correct |
| 80 |
Partially correct |
24 ms |
1880 KB |
Partially correct - number of queries: 5688 |
| 81 |
Partially correct |
20 ms |
2132 KB |
Partially correct - number of queries: 5637 |
| 82 |
Partially correct |
30 ms |
1880 KB |
Partially correct - number of queries: 5636 |
| 83 |
Correct |
4 ms |
1880 KB |
Output is correct |
| 84 |
Correct |
21 ms |
1880 KB |
Output is correct |
| 85 |
Partially correct |
29 ms |
1880 KB |
Partially correct - number of queries: 5607 |
| 86 |
Correct |
5 ms |
1880 KB |
Output is correct |
| 87 |
Correct |
5 ms |
1880 KB |
Output is correct |
| 88 |
Correct |
7 ms |
1880 KB |
Output is correct |
| 89 |
Correct |
5 ms |
1880 KB |
Output is correct |
| 90 |
Correct |
5 ms |
1880 KB |
Output is correct |
| 91 |
Correct |
6 ms |
1880 KB |
Output is correct |
| 92 |
Correct |
5 ms |
1880 KB |
Output is correct |
| 93 |
Correct |
8 ms |
1880 KB |
Output is correct |
| 94 |
Correct |
6 ms |
1880 KB |
Output is correct |
| 95 |
Correct |
6 ms |
1880 KB |
Output is correct |
| 96 |
Correct |
6 ms |
1880 KB |
Output is correct |
| 97 |
Correct |
5 ms |
1880 KB |
Output is correct |
