Submission #931890

# Submission time Handle Problem Language Result Execution time Memory
931890 2024-02-22T14:13:51 Z Lobo The Big Prize (IOI17_prize) C++17
98.65 / 100
30 ms 2076 KB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
map<int,pair<int,pair<int,int>>> qr;
 
int cnt = 0;
int cntnonlol;
int n;
pair<int,pair<int,int>> query(int i) {
	if(i == n) return mp(cntnonlol,mp(cntnonlol,0));
	if(qr.count(i)) return qr[i];
	++cnt;
	vector<int> perg = ask(i);
	return qr[i] = mp(perg[0]+perg[1],mp(perg[0],perg[1]));
}
 
int find_best(int N) {
 	n = N;
 	if(n <= 5000) {
 		for(int i = 0; i < n; i++) {
 			if(query(i).fr == 0) return i;
 		}
 	}
 	int S = n/450;
 	stack<pair<int,int>> q;

 	for(int i = 0; i*S < n; i++) {
 		// i*S,(i+1)*S
 		int l = i*S;
 		int r = min(n-1,(i+1)*S);

		q.push(mp(l,r)); 		
 	}

 	while(q.size()) {
 		int l = q.top().fr;
 		int r = q.top().sc;
 		q.pop();
 		if(l > r) continue;

 		if(query(l).fr == 0) return l;
 		if(query(r).fr == 0) return r;
 		if(r-l+1 <= 2) continue;

 		if(query(l) == query(r)) continue;
 		int mid = (l+r)/2;
 		q.push(mp(l,mid));
 		q.push(mp(mid,r));
 	}

 	assert(false);
 	return -1;


}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 452 KB Output is correct
2 Correct 1 ms 948 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 448 KB Output is correct
6 Correct 2 ms 436 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 1 ms 616 KB Output is correct
9 Correct 1 ms 692 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 2 ms 444 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 2 ms 448 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 1 ms 440 KB Output is correct
8 Correct 1 ms 704 KB Output is correct
9 Correct 1 ms 696 KB Output is correct
10 Correct 2 ms 712 KB Output is correct
11 Correct 2 ms 700 KB Output is correct
12 Correct 3 ms 472 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 5 ms 692 KB Output is correct
15 Correct 20 ms 804 KB Output is correct
16 Correct 4 ms 712 KB Output is correct
17 Partially correct 24 ms 1392 KB Partially correct - number of queries: 5083
18 Correct 0 ms 344 KB Output is correct
19 Correct 27 ms 1112 KB Output is correct
20 Correct 11 ms 1236 KB Output is correct
21 Correct 18 ms 1288 KB Output is correct
22 Correct 20 ms 1112 KB Output is correct
23 Correct 2 ms 960 KB Output is correct
24 Correct 4 ms 716 KB Output is correct
25 Correct 11 ms 804 KB Output is correct
26 Correct 10 ms 1512 KB Output is correct
27 Correct 2 ms 712 KB Output is correct
28 Correct 1 ms 448 KB Output is correct
29 Correct 3 ms 700 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Partially correct 22 ms 1564 KB Partially correct - number of queries: 5028
32 Correct 1 ms 444 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 17 ms 992 KB Output is correct
35 Correct 2 ms 704 KB Output is correct
36 Correct 20 ms 1556 KB Output is correct
37 Correct 3 ms 468 KB Output is correct
38 Correct 3 ms 960 KB Output is correct
39 Correct 19 ms 1000 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 11 ms 1488 KB Output is correct
42 Correct 10 ms 2076 KB Output is correct
43 Correct 11 ms 812 KB Output is correct
44 Correct 15 ms 1080 KB Output is correct
45 Correct 19 ms 1748 KB Output is correct
46 Partially correct 24 ms 1576 KB Partially correct - number of queries: 5107
47 Correct 12 ms 1508 KB Output is correct
48 Correct 7 ms 1268 KB Output is correct
49 Correct 23 ms 1016 KB Output is correct
50 Correct 1 ms 596 KB Output is correct
51 Correct 12 ms 1116 KB Output is correct
52 Partially correct 30 ms 1588 KB Partially correct - number of queries: 5047
53 Correct 1 ms 692 KB Output is correct
54 Correct 17 ms 968 KB Output is correct
55 Partially correct 27 ms 1504 KB Partially correct - number of queries: 5075
56 Correct 1 ms 344 KB Output is correct
57 Correct 7 ms 1272 KB Output is correct
58 Correct 7 ms 1276 KB Output is correct
59 Correct 9 ms 976 KB Output is correct
60 Correct 9 ms 1004 KB Output is correct
61 Correct 1 ms 440 KB Output is correct
62 Correct 2 ms 452 KB Output is correct
63 Correct 1 ms 436 KB Output is correct
64 Correct 1 ms 444 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 1 ms 344 KB Output is correct
68 Correct 3 ms 968 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 24 ms 1688 KB Output is correct
72 Correct 4 ms 712 KB Output is correct
73 Correct 24 ms 1352 KB Output is correct
74 Correct 26 ms 884 KB Output is correct
75 Correct 2 ms 468 KB Output is correct
76 Correct 20 ms 1036 KB Output is correct
77 Partially correct 24 ms 976 KB Partially correct - number of queries: 5117
78 Correct 3 ms 952 KB Output is correct
79 Correct 10 ms 796 KB Output is correct
80 Partially correct 23 ms 1748 KB Partially correct - number of queries: 5069
81 Partially correct 25 ms 1424 KB Partially correct - number of queries: 5074
82 Partially correct 27 ms 1648 KB Partially correct - number of queries: 5081
83 Correct 3 ms 696 KB Output is correct
84 Correct 22 ms 1272 KB Output is correct
85 Partially correct 24 ms 1316 KB Partially correct - number of queries: 5135
86 Correct 2 ms 692 KB Output is correct
87 Correct 3 ms 1468 KB Output is correct
88 Correct 2 ms 700 KB Output is correct
89 Correct 2 ms 956 KB Output is correct
90 Correct 2 ms 692 KB Output is correct
91 Correct 3 ms 952 KB Output is correct
92 Correct 2 ms 1208 KB Output is correct
93 Correct 3 ms 728 KB Output is correct
94 Correct 3 ms 708 KB Output is correct
95 Correct 4 ms 1156 KB Output is correct
96 Correct 3 ms 480 KB Output is correct
97 Correct 1 ms 436 KB Output is correct