# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
986037 | 2024-05-19T16:37:42 Z | AlphaMale06 | The Big Prize (IOI17_prize) | C++17 | 47 ms | 600 KB |
#include <bits/stdc++.h> #include "prize.h" using namespace std; //vector<int> ask(int i); int find_best(int n){ if(n<=5000){ for(int i=0; i<n; i++){ vector<int> ans = ask(i); if(ans[0]==0 && ans[1]==0)return i; } } int summ = 0; for(int i=0; i<8; i++){ int ind = rand()%n; vector<int> ans = ask(ind); summ=max(summ, ans[0]+ans[1]); if(ans[0]==0 && ans[1]==0)return ind; } int prev=-1; for(int i=0; i<summ; i++){ int l = prev+1, r = n-1; int best = n; while(l<=r){ int s = l+r>>1; vector<int> ans = ask(s); if(ans[0]+ans[1]==0)return s; if(ans[0]+ans[1]==summ){ if(ans[0]>i){ best=s-1; r=s-1; } else l=s+1; } else{ best = s; r=s-1; } } vector<int> ans = ask(best); if(ans[0]+ans[1]==0)return best; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Correct | 0 ms | 344 KB | Output is correct |
7 | Correct | 0 ms | 344 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Correct | 1 ms | 344 KB | Output is correct |
10 | Correct | 1 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 1 ms | 344 KB | Output is correct |
6 | Correct | 1 ms | 344 KB | Output is correct |
7 | Correct | 1 ms | 344 KB | Output is correct |
8 | Correct | 1 ms | 540 KB | Output is correct |
9 | Correct | 0 ms | 424 KB | Output is correct |
10 | Correct | 0 ms | 344 KB | Output is correct |
11 | Correct | 1 ms | 344 KB | Output is correct |
12 | Correct | 0 ms | 344 KB | Output is correct |
13 | Correct | 3 ms | 344 KB | Output is correct |
14 | Correct | 2 ms | 344 KB | Output is correct |
15 | Correct | 5 ms | 344 KB | Output is correct |
16 | Partially correct | 32 ms | 420 KB | Partially correct - number of queries: 7308 |
17 | Correct | 1 ms | 344 KB | Output is correct |
18 | Partially correct | 42 ms | 600 KB | Partially correct - number of queries: 8815 |
19 | Correct | 0 ms | 344 KB | Output is correct |
20 | Correct | 12 ms | 344 KB | Output is correct |
21 | Correct | 14 ms | 344 KB | Output is correct |
22 | Correct | 4 ms | 344 KB | Output is correct |
23 | Correct | 1 ms | 344 KB | Output is correct |
24 | Correct | 0 ms | 344 KB | Output is correct |
25 | Correct | 24 ms | 344 KB | Output is correct |
26 | Correct | 27 ms | 600 KB | Output is correct |
27 | Correct | 1 ms | 344 KB | Output is correct |
28 | Partially correct | 40 ms | 596 KB | Partially correct - number of queries: 8348 |
29 | Partially correct | 33 ms | 344 KB | Partially correct - number of queries: 6241 |
30 | Partially correct | 34 ms | 344 KB | Partially correct - number of queries: 8750 |
31 | Correct | 0 ms | 344 KB | Output is correct |
32 | Correct | 2 ms | 344 KB | Output is correct |
33 | Correct | 1 ms | 344 KB | Output is correct |
34 | Correct | 10 ms | 344 KB | Output is correct |
35 | Correct | 1 ms | 344 KB | Output is correct |
36 | Correct | 7 ms | 344 KB | Output is correct |
37 | Correct | 1 ms | 344 KB | Output is correct |
38 | Correct | 0 ms | 344 KB | Output is correct |
39 | Correct | 16 ms | 344 KB | Output is correct |
40 | Partially correct | 33 ms | 500 KB | Partially correct - number of queries: 7469 |
41 | Partially correct | 25 ms | 344 KB | Partially correct - number of queries: 5045 |
42 | Partially correct | 27 ms | 344 KB | Partially correct - number of queries: 5045 |
43 | Correct | 16 ms | 344 KB | Output is correct |
44 | Correct | 14 ms | 344 KB | Output is correct |
45 | Correct | 27 ms | 344 KB | Output is correct |
46 | Correct | 1 ms | 344 KB | Output is correct |
47 | Correct | 21 ms | 344 KB | Output is correct |
48 | Partially correct | 26 ms | 600 KB | Partially correct - number of queries: 6281 |
49 | Correct | 3 ms | 344 KB | Output is correct |
50 | Partially correct | 47 ms | 344 KB | Partially correct - number of queries: 8824 |
51 | Correct | 13 ms | 344 KB | Output is correct |
52 | Correct | 1 ms | 344 KB | Output is correct |
53 | Correct | 1 ms | 344 KB | Output is correct |
54 | Correct | 15 ms | 600 KB | Output is correct |
55 | Correct | 1 ms | 344 KB | Output is correct |
56 | Partially correct | 41 ms | 344 KB | Partially correct - number of queries: 8841 |
57 | Partially correct | 28 ms | 344 KB | Partially correct - number of queries: 6190 |
58 | Incorrect | 42 ms | 424 KB | Integer 200000 violates the range [0, 199999] |
59 | Halted | 0 ms | 0 KB | - |