Submission #117562

# Submission time Handle Problem Language Result Execution time Memory
117562 2019-06-16T14:49:26 Z nvmdava The Big Prize (IOI17_prize) C++17
97.61 / 100
62 ms 5388 KB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> ask(int i);

vector<int> res[200005];
int ans;
int big, nn;

vector<int> query(int i){
   if(i == 0)
      return vector<int>({0, big});
   if(i == nn + 1)
      return vector<int>({big, 0});
   return ask(i - 1);
}

void find(int l, int r){
   if(ans) return;
   if(res[l][0] == res[r][0]) return;
   int ll, rr, m = (l + r) >> 1;
   res[m] = query(m);
   if(res[m][0] + res[m][1] == big){
      find(l, m);
      find(m, r);
      return;
   }

   if(res[m][0] + res[m][1] == 0){
         ans = m;return;
   }
   for(rr = m + 1; rr < r; rr++){
      res[rr] = query(rr);
      if(res[rr][0] + res[rr][1] == big){
         find(rr, r);
         break;
      }
      if(res[rr][0] + res[rr][1] == 0){
         ans = rr;
         return;
      }
   }
   for(ll = m - 1; ll > l; ll--){
      res[ll] = query(ll);
      if(res[ll][0] + res[ll][1] == big){
         find(l, ll);
         break;
      }
      if(res[ll][0] + res[ll][1] == 0){
         ans = ll;
         return;
      }
   }

}

int find_best(int n) {
   nn = n;
   int lol = 0;
	for(int i = 0; i < 480; i++) {
		res[i + 1] = ask(i);
		if(res[i + 1][0] + res[i + 1][1] == 0)
			return i;
      if(big <= res[i + 1][0] + res[i + 1][1]){
         big = res[i + 1][0] + res[i + 1][1];
         lol = i + 1;
      }
	}
   res[0] = query(0);
   res[nn + 1] = query(nn + 1);

   find(lol, nn + 1);

	return ans - 1;
}
# Verdict Execution time Memory Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 8 ms 5120 KB Output is correct
3 Correct 9 ms 4992 KB Output is correct
4 Correct 8 ms 4992 KB Output is correct
5 Correct 10 ms 4916 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 8 ms 5120 KB Output is correct
8 Correct 11 ms 4992 KB Output is correct
9 Correct 9 ms 5112 KB Output is correct
10 Correct 8 ms 4992 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 12 ms 4992 KB Output is correct
2 Correct 7 ms 5136 KB Output is correct
3 Correct 12 ms 4992 KB Output is correct
4 Correct 8 ms 5124 KB Output is correct
5 Correct 9 ms 4992 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 8 ms 5120 KB Output is correct
8 Correct 10 ms 5160 KB Output is correct
9 Correct 9 ms 4992 KB Output is correct
10 Correct 12 ms 4992 KB Output is correct
11 Correct 9 ms 5136 KB Output is correct
12 Correct 14 ms 4992 KB Output is correct
13 Correct 18 ms 4992 KB Output is correct
14 Correct 12 ms 4992 KB Output is correct
15 Correct 9 ms 5152 KB Output is correct
16 Correct 56 ms 5088 KB Output is correct
17 Correct 9 ms 4992 KB Output is correct
18 Partially correct 41 ms 5240 KB Partially correct - number of queries: 5094
19 Correct 11 ms 4992 KB Output is correct
20 Correct 21 ms 5112 KB Output is correct
21 Correct 13 ms 5104 KB Output is correct
22 Correct 13 ms 4992 KB Output is correct
23 Correct 11 ms 4992 KB Output is correct
24 Correct 7 ms 5136 KB Output is correct
25 Correct 32 ms 4992 KB Output is correct
26 Correct 28 ms 5032 KB Output is correct
27 Correct 9 ms 4992 KB Output is correct
28 Correct 37 ms 5076 KB Output is correct
29 Correct 38 ms 5112 KB Output is correct
30 Partially correct 21 ms 5272 KB Partially correct - number of queries: 5066
31 Correct 7 ms 5128 KB Output is correct
32 Correct 12 ms 5032 KB Output is correct
33 Correct 5 ms 4992 KB Output is correct
34 Correct 12 ms 5064 KB Output is correct
35 Correct 13 ms 5112 KB Output is correct
36 Correct 16 ms 4992 KB Output is correct
37 Correct 11 ms 4992 KB Output is correct
38 Correct 8 ms 4992 KB Output is correct
39 Correct 13 ms 5084 KB Output is correct
40 Correct 26 ms 5232 KB Output is correct
41 Correct 30 ms 5092 KB Output is correct
42 Correct 20 ms 5100 KB Output is correct
43 Correct 21 ms 5136 KB Output is correct
44 Correct 13 ms 5164 KB Output is correct
45 Correct 24 ms 5032 KB Output is correct
46 Correct 7 ms 5048 KB Output is correct
47 Correct 29 ms 5076 KB Output is correct
48 Correct 41 ms 5120 KB Output is correct
49 Correct 9 ms 5140 KB Output is correct
50 Partially correct 24 ms 5388 KB Partially correct - number of queries: 5043
51 Correct 26 ms 5112 KB Output is correct
52 Correct 9 ms 4992 KB Output is correct
53 Correct 11 ms 4992 KB Output is correct
54 Correct 33 ms 4992 KB Output is correct
55 Correct 7 ms 5024 KB Output is correct
56 Partially correct 24 ms 5272 KB Partially correct - number of queries: 5098
57 Correct 18 ms 5228 KB Output is correct
58 Correct 20 ms 5212 KB Output is correct
59 Correct 34 ms 5112 KB Output is correct
60 Correct 16 ms 5164 KB Output is correct
61 Correct 10 ms 5136 KB Output is correct
62 Correct 12 ms 4992 KB Output is correct
63 Correct 8 ms 5136 KB Output is correct
64 Correct 8 ms 5128 KB Output is correct
65 Correct 11 ms 5112 KB Output is correct
66 Correct 14 ms 5136 KB Output is correct
67 Correct 9 ms 5136 KB Output is correct
68 Correct 11 ms 4992 KB Output is correct
69 Correct 9 ms 5028 KB Output is correct
70 Correct 11 ms 4992 KB Output is correct
71 Partially correct 42 ms 5148 KB Partially correct - number of queries: 5239
72 Correct 12 ms 4992 KB Output is correct
73 Partially correct 62 ms 5112 KB Partially correct - number of queries: 5176
74 Partially correct 50 ms 5240 KB Partially correct - number of queries: 5203
75 Correct 9 ms 4992 KB Output is correct
76 Correct 45 ms 5180 KB Output is correct
77 Partially correct 23 ms 5248 KB Partially correct - number of queries: 5213
78 Correct 11 ms 4992 KB Output is correct
79 Correct 16 ms 5020 KB Output is correct
80 Partially correct 62 ms 5132 KB Partially correct - number of queries: 5217
81 Partially correct 59 ms 5148 KB Partially correct - number of queries: 5192
82 Partially correct 45 ms 5120 KB Partially correct - number of queries: 5173
83 Correct 12 ms 4992 KB Output is correct
84 Correct 42 ms 5112 KB Output is correct
85 Partially correct 59 ms 5204 KB Partially correct - number of queries: 5175
86 Correct 8 ms 5100 KB Output is correct
87 Correct 9 ms 4992 KB Output is correct
88 Correct 11 ms 4992 KB Output is correct
89 Correct 7 ms 5128 KB Output is correct
90 Correct 10 ms 4992 KB Output is correct
91 Correct 10 ms 4992 KB Output is correct
92 Correct 11 ms 4992 KB Output is correct
93 Correct 11 ms 4992 KB Output is correct
94 Correct 11 ms 4992 KB Output is correct
95 Correct 15 ms 4992 KB Output is correct
96 Correct 8 ms 5040 KB Output is correct
97 Correct 9 ms 4992 KB Output is correct