oj.uz

Submission #132100

# Submission time Handle Problem Language Result Execution time Memory
132100 2019-07-18T10:00:42 Z MoNsTeR_CuBe The Big Prize (IOI17_prize) C++17
20 / 100
 156 ms 44776 KB 
#include <bits/stdc++.h>
#include "prize.h"
using namespace std;

vector< vector< int > > memo;

int TOT = 0;

vector< int > ASK(int a){
	if(memo[a][0] != -1) return memo[a];
	else{
		TOT++;
		assert(TOT < 10000);
		return memo[a] = ask(a);
	} 
}

int find_best(int n) {
	int poppy_index = -1;
	int poppy_tot = 0;
	
	vector< vector< int > > rem(n+1, vector< int > (2));
	
	memo.resize(n, vector< int >(2,-1));
	
	for(int i = 0; i < min(n,446); i++){
		vector< int > query = ASK(i);
		rem[query[0] + query[1]] = query;
		if(query[0] + query[1] >= poppy_tot){
			poppy_tot = query[0] + query[1];
			poppy_index = i;
		}else if(query[0] + query[1] == 0){
			return i;
		}
	}
	
	int curr = poppy_index+1;
	
	while(curr < n){
		vector< int > query = ASK(curr);
		rem[query[0] + query[1]] = query;
		if(query[0] + query[1] == 0) return curr;
		while(query[0] + query[1] != poppy_tot){
			curr++;
			query = ASK(curr);
			rem[query[0] + query[1]] = query;
			if(query[0] + query[1] == 0) return curr;
		}
		int left = curr+1;
		int right = n-1;
		
		while(left < right){
			int mid = (left+right)/2;
			vector< int > Q = ASK(mid);
			if(Q[0] + Q[1] == 0) return mid;
			if(Q[0] + Q[1] == poppy_tot && Q[0] - query[0] == 0){
				left = mid+1;
				rem[Q[0] + Q[1]] = Q;
			} 
			else if(Q[0] + Q[1] == poppy_tot && Q[0] - query[0] > 0) right = mid-1;
			else if(Q[0] + Q[1] != poppy_tot && Q[0] - rem[Q[0] + Q[1]][0] == 0){
				left = mid+1;
				rem[Q[0] + Q[1]] = Q;
			} 
			else right = mid;
		}
		
		curr = left;
	}
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 22136 KB Output is correct
2 Correct 43 ms 22264 KB Output is correct
3 Correct 41 ms 22136 KB Output is correct
4 Correct 41 ms 22136 KB Output is correct
5 Correct 41 ms 22136 KB Output is correct
6 Correct 41 ms 22292 KB Output is correct
7 Correct 40 ms 22136 KB Output is correct
8 Correct 39 ms 22192 KB Output is correct
9 Correct 41 ms 22136 KB Output is correct
10 Correct 41 ms 22264 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 22184 KB Output is correct
2 Correct 47 ms 22136 KB Output is correct
3 Correct 42 ms 22244 KB Output is correct
4 Correct 43 ms 22248 KB Output is correct
5 Correct 42 ms 22136 KB Output is correct
6 Correct 41 ms 22264 KB Output is correct
7 Correct 42 ms 22284 KB Output is correct
8 Correct 39 ms 22136 KB Output is correct
9 Correct 39 ms 22196 KB Output is correct
10 Correct 41 ms 22136 KB Output is correct
11 Correct 44 ms 22136 KB Output is correct
12 Correct 41 ms 22404 KB Output is correct
13 Correct 45 ms 22136 KB Output is correct
14 Correct 12 ms 2700 KB Output is correct
15 Correct 51 ms 22136 KB Output is correct
16 Partially correct 101 ms 22308 KB Partially correct - number of queries: 6943
17 Correct 38 ms 22392 KB Output is correct
18 Partially correct 115 ms 22264 KB Partially correct - number of queries: 7621
19 Correct 40 ms 22192 KB Output is correct
20 Correct 39 ms 11256 KB Output is correct
21 Correct 59 ms 22280 KB Output is correct
22 Correct 49 ms 22252 KB Output is correct
23 Correct 43 ms 22252 KB Output is correct
24 Correct 46 ms 22240 KB Output is correct
25 Correct 95 ms 22284 KB Output is correct
26 Correct 75 ms 22280 KB Output is correct
27 Correct 42 ms 22264 KB Output is correct
28 Partially correct 100 ms 22140 KB Partially correct - number of queries: 6907
29 Partially correct 95 ms 22248 KB Partially correct - number of queries: 5805
30 Partially correct 91 ms 22280 KB Partially correct - number of queries: 7976
31 Correct 39 ms 22196 KB Output is correct
32 Correct 41 ms 22240 KB Output is correct
33 Correct 2 ms 300 KB Output is correct
34 Correct 67 ms 22248 KB Output is correct
35 Correct 40 ms 22240 KB Output is correct
36 Correct 61 ms 22252 KB Output is correct
37 Correct 44 ms 22252 KB Output is correct
38 Correct 41 ms 22264 KB Output is correct
39 Correct 78 ms 22264 KB Output is correct
40 Partially correct 91 ms 22248 KB Partially correct - number of queries: 6907
41 Correct 81 ms 22248 KB Output is correct
42 Correct 85 ms 22256 KB Output is correct
43 Correct 62 ms 22280 KB Output is correct
44 Correct 79 ms 22268 KB Output is correct
45 Correct 58 ms 22260 KB Output is correct
46 Correct 40 ms 22280 KB Output is correct
47 Correct 66 ms 22240 KB Output is correct
48 Partially correct 92 ms 22264 KB Partially correct - number of queries: 6089
49 Correct 43 ms 22252 KB Output is correct
50 Partially correct 108 ms 22200 KB Partially correct - number of queries: 7831
51 Correct 53 ms 22264 KB Output is correct
52 Correct 40 ms 22196 KB Output is correct
53 Correct 44 ms 22204 KB Output is correct
54 Correct 73 ms 22244 KB Output is correct
55 Correct 39 ms 22192 KB Output is correct
56 Partially correct 115 ms 22136 KB Partially correct - number of queries: 7840
57 Partially correct 89 ms 22192 KB Partially correct - number of queries: 5635
58 Partially correct 106 ms 22244 KB Partially correct - number of queries: 5825
59 Correct 65 ms 22136 KB Output is correct
60 Correct 65 ms 22244 KB Output is correct
61 Correct 41 ms 22144 KB Output is correct
62 Correct 43 ms 22200 KB Output is correct
63 Correct 43 ms 22208 KB Output is correct
64 Correct 39 ms 22196 KB Output is correct
65 Correct 41 ms 22184 KB Output is correct
66 Correct 39 ms 22252 KB Output is correct
67 Correct 41 ms 22236 KB Output is correct
68 Correct 39 ms 22196 KB Output is correct
69 Correct 47 ms 22196 KB Output is correct
70 Correct 39 ms 22180 KB Output is correct
71 Partially correct 122 ms 22272 KB Partially correct - number of queries: 8206
72 Correct 48 ms 22136 KB Output is correct
73 Partially correct 119 ms 22252 KB Partially correct - number of queries: 8094
74 Partially correct 92 ms 22180 KB Partially correct - number of queries: 8152
75 Correct 40 ms 22280 KB Output is correct
76 Partially correct 106 ms 22176 KB Partially correct - number of queries: 7069
77 Partially correct 114 ms 22244 KB Partially correct - number of queries: 7740
78 Correct 48 ms 22256 KB Output is correct
79 Correct 66 ms 22264 KB Output is correct
80 Partially correct 101 ms 22196 KB Partially correct - number of queries: 7584
81 Partially correct 96 ms 22244 KB Partially correct - number of queries: 6991
82 Partially correct 82 ms 22244 KB Partially correct - number of queries: 7779
83 Correct 41 ms 22252 KB Output is correct
84 Partially correct 94 ms 22184 KB Partially correct - number of queries: 6593
85 Partially correct 111 ms 22136 KB Partially correct - number of queries: 7774
86 Runtime error 156 ms 44776 KB Execution killed with signal 11 (could be triggered by violating memory limits)
87 Halted 0 ms 0 KB -