Submission #785732

# Submission time Handle Problem Language Result Execution time Memory
785732 2023-07-17T13:54:39 Z QwertyPi The Big Prize (IOI17_prize) C++14
97.54 / 100
51 ms 1044 KB
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

map<int, vector<int>> M, Li;
vector<int> self_ask(int i){
	if(!M.count(i)) M[i] = ask(i); vector<int> r = M[i];
	Li[r[0] + r[1]].push_back(i);
	return r;
}

vector<int> b;

bool failed = false, done = false, un = true;
mt19937 rng(0);
int cc, ans;
void solve(int l, int r, int lc, int rc){
	if(l > r || lc == rc) return;
	int L = (l + r) / 2, R = (l + r) / 2 + 1, F = 0;
	int c; vector<int> a;
	while(true){
		c = F ? R++ : L--; F ^= 1;
		a = self_ask(c);
		if(a[0] + a[1] == 0){
			done = true; failed = true; ans = c;
		}
		if(un || a[0] + a[1] > cc){
			failed = true; un = false; cc = a[0] + a[1];
			return;
		}
		if(a[0] + a[1] == cc || R - L - 1 == rc - lc){
			break;
		}
	}
	if(R - L + 1 == rc - lc && a[0] + a[1] != cc) return;
	if(c == L + 1){
		solve(l, L, lc, a[0]); if(failed) return;
		solve(R, r, a[0] + (R - L - 2), rc); if(failed) return;
	}else{
		solve(l, L, lc, a[0] - (R - L - 2)); if(failed) return;
		solve(R, r, a[0], rc); if(failed) return;
	}
}

int find_best(int n) {
	cc = n;
	do{
		failed = false;
		solve(0, n - 1, 0, cc);
		if(done) break;
	}while(failed);
	if(done){
		return ans;
	}
}

Compilation message

prize.cpp: In function 'std::vector<int> self_ask(int)':
prize.cpp:8:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
    8 |  if(!M.count(i)) M[i] = ask(i); vector<int> r = M[i];
      |  ^~
prize.cpp:8:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
    8 |  if(!M.count(i)) M[i] = ask(i); vector<int> r = M[i];
      |                                 ^~~~~~
prize.cpp: In function 'int find_best(int)':
prize.cpp:56:1: warning: control reaches end of non-void function [-Wreturn-type]
   56 | }
      | ^
# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 0 ms 304 KB Output is correct
5 Correct 0 ms 296 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 0 ms 292 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 304 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 292 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 3 ms 312 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 5 ms 296 KB Output is correct
16 Correct 36 ms 764 KB Output is correct
17 Correct 0 ms 296 KB Output is correct
18 Partially correct 45 ms 852 KB Partially correct - number of queries: 5028
19 Correct 1 ms 308 KB Output is correct
20 Correct 15 ms 336 KB Output is correct
21 Correct 16 ms 392 KB Output is correct
22 Correct 4 ms 336 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 292 KB Output is correct
25 Correct 13 ms 624 KB Output is correct
26 Correct 19 ms 540 KB Output is correct
27 Correct 1 ms 284 KB Output is correct
28 Correct 18 ms 780 KB Output is correct
29 Correct 29 ms 584 KB Output is correct
30 Partially correct 44 ms 824 KB Partially correct - number of queries: 5024
31 Correct 1 ms 304 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 17 ms 416 KB Output is correct
35 Correct 2 ms 292 KB Output is correct
36 Correct 7 ms 336 KB Output is correct
37 Correct 1 ms 304 KB Output is correct
38 Correct 0 ms 304 KB Output is correct
39 Correct 9 ms 540 KB Output is correct
40 Correct 35 ms 704 KB Output is correct
41 Correct 14 ms 616 KB Output is correct
42 Correct 26 ms 584 KB Output is correct
43 Correct 10 ms 592 KB Output is correct
44 Correct 14 ms 488 KB Output is correct
45 Correct 12 ms 452 KB Output is correct
46 Correct 1 ms 292 KB Output is correct
47 Correct 9 ms 516 KB Output is correct
48 Correct 30 ms 584 KB Output is correct
49 Correct 4 ms 344 KB Output is correct
50 Partially correct 44 ms 768 KB Partially correct - number of queries: 5056
51 Correct 8 ms 464 KB Output is correct
52 Correct 1 ms 296 KB Output is correct
53 Correct 1 ms 316 KB Output is correct
54 Correct 20 ms 428 KB Output is correct
55 Correct 1 ms 208 KB Output is correct
56 Partially correct 43 ms 820 KB Partially correct - number of queries: 5058
57 Correct 20 ms 596 KB Output is correct
58 Correct 33 ms 664 KB Output is correct
59 Correct 26 ms 564 KB Output is correct
60 Correct 16 ms 572 KB Output is correct
61 Correct 2 ms 296 KB Output is correct
62 Correct 1 ms 296 KB Output is correct
63 Correct 1 ms 312 KB Output is correct
64 Correct 1 ms 308 KB Output is correct
65 Correct 1 ms 292 KB Output is correct
66 Correct 6 ms 400 KB Output is correct
67 Correct 1 ms 308 KB Output is correct
68 Correct 3 ms 336 KB Output is correct
69 Correct 4 ms 296 KB Output is correct
70 Correct 2 ms 320 KB Output is correct
71 Correct 39 ms 824 KB Output is correct
72 Correct 3 ms 324 KB Output is correct
73 Correct 38 ms 796 KB Output is correct
74 Correct 34 ms 812 KB Output is correct
75 Correct 1 ms 208 KB Output is correct
76 Correct 27 ms 688 KB Output is correct
77 Partially correct 33 ms 788 KB Partially correct - number of queries: 5214
78 Correct 4 ms 336 KB Output is correct
79 Correct 23 ms 556 KB Output is correct
80 Partially correct 46 ms 1028 KB Partially correct - number of queries: 5246
81 Partially correct 39 ms 832 KB Partially correct - number of queries: 5210
82 Partially correct 51 ms 864 KB Partially correct - number of queries: 5201
83 Correct 1 ms 300 KB Output is correct
84 Correct 24 ms 1044 KB Output is correct
85 Partially correct 42 ms 856 KB Partially correct - number of queries: 5180
86 Correct 6 ms 316 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 5 ms 336 KB Output is correct
89 Correct 6 ms 352 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 3 ms 336 KB Output is correct
92 Correct 5 ms 336 KB Output is correct
93 Correct 3 ms 336 KB Output is correct
94 Correct 2 ms 336 KB Output is correct
95 Correct 4 ms 328 KB Output is correct
96 Correct 3 ms 336 KB Output is correct
97 Correct 1 ms 208 KB Output is correct