oj.uz

Submission #931917

# Submission time Handle Problem Language Result Execution time Memory
931917 2024-02-22T14:34:57 Z Lobo The Big Prize (IOI17_prize) C++17
99.65 / 100
 30 ms 2128 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/420;
 	queue<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.front().fr;
 		int r = q.front().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));

 		// int ml = (2*l+r)/3;
 		// int mr = (l+2*r)/3;
 		// q.push(mp(l,ml));
 		// q.push(mp(ml,mr));
 		// q.push(mp(mr,r));
 	}

 	assert(false);
 	return -1;


}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 2 ms 452 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 456 KB Output is correct
5 Correct 2 ms 616 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 444 KB Output is correct
9 Correct 2 ms 456 KB Output is correct
10 Correct 2 ms 464 KB Output is correct

Subtask #2
79.65 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 956 KB Output is correct
2 Correct 2 ms 456 KB Output is correct
3 Correct 3 ms 944 KB Output is correct
4 Correct 2 ms 700 KB Output is correct
5 Correct 2 ms 456 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 2 ms 456 KB Output is correct
8 Correct 2 ms 892 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 2 ms 456 KB Output is correct
12 Correct 4 ms 716 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 4 ms 692 KB Output is correct
15 Correct 18 ms 736 KB Output is correct
16 Correct 13 ms 1500 KB Output is correct
17 Correct 18 ms 1028 KB Output is correct
18 Correct 21 ms 1024 KB Output is correct
19 Correct 26 ms 1260 KB Output is correct
20 Correct 11 ms 1268 KB Output is correct
21 Correct 19 ms 960 KB Output is correct
22 Correct 16 ms 964 KB Output is correct
23 Correct 3 ms 452 KB Output is correct
24 Correct 3 ms 720 KB Output is correct
25 Correct 21 ms 1360 KB Output is correct
26 Correct 10 ms 784 KB Output is correct
27 Correct 2 ms 456 KB Output is correct
28 Correct 24 ms 1328 KB Output is correct
29 Correct 14 ms 1268 KB Output is correct
30 Correct 21 ms 728 KB Output is correct
31 Correct 22 ms 960 KB Output is correct
32 Correct 3 ms 868 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 21 ms 1132 KB Output is correct
35 Correct 3 ms 708 KB Output is correct
36 Correct 20 ms 1680 KB Output is correct
37 Correct 3 ms 468 KB Output is correct
38 Correct 2 ms 712 KB Output is correct
39 Correct 24 ms 1256 KB Output is correct
40 Correct 22 ms 1560 KB Output is correct
41 Correct 22 ms 1156 KB Output is correct
42 Correct 24 ms 984 KB Output is correct
43 Correct 16 ms 1044 KB Output is correct
44 Correct 17 ms 2128 KB Output is correct
45 Correct 17 ms 780 KB Output is correct
46 Correct 23 ms 1052 KB Output is correct
47 Correct 21 ms 856 KB Output is correct
48 Correct 21 ms 1192 KB Output is correct
49 Correct 18 ms 1116 KB Output is correct
50 Correct 21 ms 1192 KB Output is correct
51 Correct 20 ms 740 KB Output is correct
52 Correct 12 ms 1032 KB Output is correct
53 Correct 2 ms 708 KB Output is correct
54 Correct 12 ms 1504 KB Output is correct
55 Correct 17 ms 1860 KB Output is correct
56 Correct 24 ms 1012 KB Output is correct
57 Correct 21 ms 1004 KB Output is correct
58 Correct 22 ms 988 KB Output is correct
59 Correct 20 ms 1296 KB Output is correct
60 Correct 21 ms 848 KB Output is correct
61 Correct 2 ms 460 KB Output is correct
62 Correct 2 ms 456 KB Output is correct
63 Correct 2 ms 692 KB Output is correct
64 Correct 2 ms 716 KB Output is correct
65 Correct 2 ms 708 KB Output is correct
66 Correct 3 ms 1212 KB Output is correct
67 Correct 2 ms 696 KB Output is correct
68 Correct 2 ms 712 KB Output is correct
69 Correct 2 ms 708 KB Output is correct
70 Correct 2 ms 460 KB Output is correct
71 Correct 20 ms 948 KB Output is correct
72 Correct 3 ms 456 KB Output is correct
73 Correct 24 ms 1364 KB Output is correct
74 Correct 26 ms 804 KB Output is correct
75 Correct 2 ms 464 KB Output is correct
76 Correct 19 ms 1388 KB Output is correct
77 Partially correct 28 ms 1888 KB Partially correct - number of queries: 5034
78 Correct 3 ms 952 KB Output is correct
79 Correct 14 ms 944 KB Output is correct
80 Correct 24 ms 1732 KB Output is correct
81 Partially correct 26 ms 2004 KB Partially correct - number of queries: 5035
82 Correct 30 ms 716 KB Output is correct
83 Correct 2 ms 696 KB Output is correct
84 Correct 25 ms 1344 KB Output is correct
85 Correct 25 ms 1972 KB Output is correct
86 Correct 3 ms 892 KB Output is correct
87 Correct 3 ms 700 KB Output is correct
88 Correct 2 ms 436 KB Output is correct
89 Correct 2 ms 692 KB Output is correct
90 Correct 2 ms 696 KB Output is correct
91 Correct 3 ms 692 KB Output is correct
92 Correct 2 ms 704 KB Output is correct
93 Correct 4 ms 468 KB Output is correct
94 Correct 5 ms 464 KB Output is correct
95 Correct 4 ms 976 KB Output is correct
96 Correct 5 ms 716 KB Output is correct
97 Correct 2 ms 972 KB Output is correct