oj.uz

Submission #117540

# Submission time Handle Problem Language Result Execution time Memory
117540 2019-06-16T13:24:29 Z nvmdava The Big Prize (IOI17_prize) C++17
20 / 100
 40 ms 5248 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 cnt = res[r][0] - res[l][0];

   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;
   }
   cnt--;

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

}

int find_best(int n) {
   nn = n;
	for(int i = 0; i < 3; i++) {
		vector<int> res = ask(i);
		if(res[0] + res[1] == 0)
			return i;
      big = max(big, res[0] + res[1]);
	}
   res[0] = query(0);
   res[nn + 1] = query(nn + 1);

   find(0, nn + 1);

	return ans - 1;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5088 KB Output is correct
2 Correct 5 ms 5116 KB Output is correct
3 Correct 6 ms 4992 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 7 ms 4992 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 5 ms 5112 KB Output is correct
8 Correct 6 ms 5016 KB Output is correct
9 Correct 6 ms 5120 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5020 KB Output is correct
2 Correct 6 ms 4912 KB Output is correct
3 Correct 6 ms 4992 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 6 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 6 ms 5132 KB Output is correct
12 Correct 6 ms 4992 KB Output is correct
13 Correct 7 ms 5136 KB Output is correct
14 Correct 8 ms 4992 KB Output is correct
15 Correct 10 ms 4992 KB Output is correct
16 Correct 17 ms 5164 KB Output is correct
17 Correct 6 ms 4992 KB Output is correct
18 Correct 19 ms 5248 KB Output is correct
19 Correct 6 ms 4992 KB Output is correct
20 Correct 9 ms 5120 KB Output is correct
21 Correct 21 ms 4992 KB Output is correct
22 Correct 10 ms 4992 KB Output is correct
23 Correct 6 ms 4992 KB Output is correct
24 Correct 7 ms 4992 KB Output is correct
25 Correct 22 ms 5124 KB Output is correct
26 Correct 24 ms 4992 KB Output is correct
27 Correct 6 ms 5120 KB Output is correct
28 Correct 17 ms 5240 KB Output is correct
29 Correct 18 ms 5196 KB Output is correct
30 Correct 39 ms 5112 KB Output is correct
31 Correct 6 ms 5112 KB Output is correct
32 Correct 7 ms 5124 KB Output is correct
33 Correct 5 ms 4992 KB Output is correct
34 Correct 13 ms 4992 KB Output is correct
35 Correct 7 ms 4992 KB Output is correct
36 Correct 13 ms 4944 KB Output is correct
37 Correct 7 ms 4992 KB Output is correct
38 Correct 6 ms 4992 KB Output is correct
39 Correct 17 ms 4992 KB Output is correct
40 Correct 28 ms 5176 KB Output is correct
41 Correct 33 ms 5068 KB Output is correct
42 Correct 40 ms 4992 KB Output is correct
43 Correct 14 ms 5184 KB Output is correct
44 Correct 11 ms 5060 KB Output is correct
45 Correct 9 ms 5152 KB Output is correct
46 Correct 6 ms 4992 KB Output is correct
47 Correct 22 ms 4992 KB Output is correct
48 Correct 32 ms 5112 KB Output is correct
49 Correct 9 ms 5112 KB Output is correct
50 Correct 39 ms 5112 KB Output is correct
51 Correct 11 ms 5172 KB Output is correct
52 Correct 6 ms 4992 KB Output is correct
53 Correct 7 ms 4992 KB Output is correct
54 Correct 17 ms 5112 KB Output is correct
55 Correct 6 ms 5112 KB Output is correct
56 Correct 32 ms 5112 KB Output is correct
57 Correct 31 ms 4992 KB Output is correct
58 Correct 14 ms 5192 KB Output is correct
59 Correct 32 ms 5032 KB Output is correct
60 Correct 18 ms 5164 KB Output is correct
61 Correct 6 ms 5020 KB Output is correct
62 Correct 7 ms 4992 KB Output is correct
63 Correct 6 ms 4992 KB Output is correct
64 Correct 8 ms 4992 KB Output is correct
65 Incorrect 6 ms 5008 KB Integer -1 violates the range [0, 199999]
66 Halted 0 ms 0 KB -