Submission #931443

# Submission time Handle Problem Language Result Execution time Memory
931443 2024-02-21T19:40:13 Z Lobo The Big Prize (IOI17_prize) C++17
97.61 / 100
29 ms 1788 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/512;
 	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+1)/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 716 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 448 KB Output is correct
6 Correct 3 ms 700 KB Output is correct
7 Correct 2 ms 444 KB Output is correct
8 Correct 2 ms 704 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 3 ms 968 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 456 KB Output is correct
2 Correct 2 ms 700 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 2 ms 456 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 948 KB Output is correct
9 Correct 1 ms 448 KB Output is correct
10 Correct 3 ms 968 KB Output is correct
11 Correct 3 ms 452 KB Output is correct
12 Correct 5 ms 716 KB Output is correct
13 Correct 0 ms 440 KB Output is correct
14 Correct 5 ms 952 KB Output is correct
15 Correct 19 ms 1608 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Partially correct 25 ms 1708 KB Partially correct - number of queries: 5080
18 Correct 1 ms 344 KB Output is correct
19 Correct 23 ms 1436 KB Output is correct
20 Correct 15 ms 772 KB Output is correct
21 Correct 17 ms 800 KB Output is correct
22 Correct 18 ms 1080 KB Output is correct
23 Correct 4 ms 704 KB Output is correct
24 Correct 4 ms 712 KB Output is correct
25 Correct 11 ms 1012 KB Output is correct
26 Correct 11 ms 1072 KB Output is correct
27 Correct 2 ms 452 KB Output is correct
28 Correct 2 ms 704 KB Output is correct
29 Correct 3 ms 708 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 24 ms 1428 KB Output is correct
32 Correct 1 ms 444 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 20 ms 1552 KB Output is correct
35 Correct 1 ms 616 KB Output is correct
36 Correct 19 ms 1552 KB Output is correct
37 Correct 3 ms 720 KB Output is correct
38 Correct 4 ms 700 KB Output is correct
39 Correct 14 ms 1304 KB Output is correct
40 Correct 1 ms 600 KB Output is correct
41 Correct 10 ms 1068 KB Output is correct
42 Correct 12 ms 1524 KB Output is correct
43 Correct 10 ms 1276 KB Output is correct
44 Correct 17 ms 1580 KB Output is correct
45 Correct 17 ms 976 KB Output is correct
46 Partially correct 27 ms 844 KB Partially correct - number of queries: 5141
47 Correct 12 ms 1020 KB Output is correct
48 Correct 7 ms 1268 KB Output is correct
49 Correct 20 ms 1348 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 22 ms 1324 KB Output is correct
52 Partially correct 24 ms 1672 KB Partially correct - number of queries: 5042
53 Correct 1 ms 436 KB Output is correct
54 Correct 15 ms 1076 KB Output is correct
55 Partially correct 29 ms 1256 KB Partially correct - number of queries: 5057
56 Correct 1 ms 344 KB Output is correct
57 Correct 7 ms 1476 KB Output is correct
58 Correct 8 ms 1004 KB Output is correct
59 Correct 10 ms 1268 KB Output is correct
60 Correct 10 ms 776 KB Output is correct
61 Correct 1 ms 636 KB Output is correct
62 Correct 3 ms 704 KB Output is correct
63 Correct 1 ms 612 KB Output is correct
64 Correct 2 ms 440 KB Output is correct
65 Correct 0 ms 600 KB Output is correct
66 Correct 1 ms 596 KB Output is correct
67 Correct 3 ms 596 KB Output is correct
68 Correct 4 ms 964 KB Output is correct
69 Correct 1 ms 600 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 24 ms 1196 KB Output is correct
72 Correct 4 ms 740 KB Output is correct
73 Correct 23 ms 1408 KB Output is correct
74 Correct 20 ms 916 KB Output is correct
75 Correct 3 ms 724 KB Output is correct
76 Correct 20 ms 1324 KB Output is correct
77 Partially correct 27 ms 1532 KB Partially correct - number of queries: 5216
78 Correct 5 ms 708 KB Output is correct
79 Correct 12 ms 1208 KB Output is correct
80 Partially correct 26 ms 1308 KB Partially correct - number of queries: 5198
81 Partially correct 25 ms 1788 KB Partially correct - number of queries: 5236
82 Partially correct 29 ms 1228 KB Partially correct - number of queries: 5235
83 Correct 4 ms 1208 KB Output is correct
84 Correct 28 ms 1292 KB Output is correct
85 Partially correct 25 ms 1076 KB Partially correct - number of queries: 5239
86 Correct 3 ms 952 KB Output is correct
87 Correct 3 ms 700 KB Output is correct
88 Correct 3 ms 692 KB Output is correct
89 Correct 2 ms 696 KB Output is correct
90 Correct 2 ms 444 KB Output is correct
91 Correct 3 ms 956 KB Output is correct
92 Correct 2 ms 700 KB Output is correct
93 Correct 3 ms 728 KB Output is correct
94 Correct 4 ms 708 KB Output is correct
95 Correct 4 ms 708 KB Output is correct
96 Correct 3 ms 724 KB Output is correct
97 Correct 0 ms 436 KB Output is correct