답안 #931900

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931900 2024-02-22T14:21:40 Z Lobo 커다란 상품 (IOI17_prize) C++17
99.17 / 100
36 ms 1880 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;
 	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(mid,r));
 		q.push(mp(l,mid));
 	}

 	assert(false);
 	return -1;


}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 456 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 1 ms 436 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 1200 KB Output is correct
10 Correct 2 ms 456 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 456 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 1 ms 436 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 3 ms 956 KB Output is correct
7 Correct 2 ms 692 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 444 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 2 ms 712 KB Output is correct
12 Correct 3 ms 728 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 4 ms 952 KB Output is correct
15 Correct 20 ms 1296 KB Output is correct
16 Correct 4 ms 712 KB Output is correct
17 Partially correct 25 ms 1548 KB Partially correct - number of queries: 5063
18 Correct 0 ms 344 KB Output is correct
19 Correct 22 ms 1024 KB Output is correct
20 Correct 10 ms 1284 KB Output is correct
21 Correct 14 ms 800 KB Output is correct
22 Correct 18 ms 1268 KB Output is correct
23 Correct 2 ms 700 KB Output is correct
24 Correct 3 ms 728 KB Output is correct
25 Correct 10 ms 1520 KB Output is correct
26 Correct 10 ms 1544 KB Output is correct
27 Correct 2 ms 948 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 25 ms 1068 KB Partially correct - number of queries: 5006
32 Correct 1 ms 440 KB Output is correct
33 Correct 0 ms 596 KB Output is correct
34 Correct 16 ms 1572 KB Output is correct
35 Correct 1 ms 436 KB Output is correct
36 Correct 18 ms 1336 KB Output is correct
37 Correct 3 ms 720 KB Output is correct
38 Correct 2 ms 884 KB Output is correct
39 Correct 15 ms 1072 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 10 ms 1048 KB Output is correct
42 Correct 11 ms 1544 KB Output is correct
43 Correct 16 ms 716 KB Output is correct
44 Correct 14 ms 1480 KB Output is correct
45 Correct 15 ms 980 KB Output is correct
46 Partially correct 35 ms 816 KB Partially correct - number of queries: 5045
47 Correct 13 ms 980 KB Output is correct
48 Correct 7 ms 708 KB Output is correct
49 Correct 20 ms 1332 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 15 ms 1096 KB Output is correct
52 Partially correct 26 ms 1880 KB Partially correct - number of queries: 5037
53 Correct 1 ms 436 KB Output is correct
54 Correct 20 ms 744 KB Output is correct
55 Partially correct 29 ms 1616 KB Partially correct - number of queries: 5008
56 Correct 0 ms 344 KB Output is correct
57 Correct 6 ms 776 KB Output is correct
58 Correct 9 ms 712 KB Output is correct
59 Correct 9 ms 1048 KB Output is correct
60 Correct 12 ms 1272 KB Output is correct
61 Correct 1 ms 692 KB Output is correct
62 Correct 2 ms 696 KB Output is correct
63 Correct 1 ms 644 KB Output is correct
64 Correct 1 ms 440 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 1 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 2 ms 628 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 1 ms 600 KB Output is correct
71 Correct 21 ms 1432 KB Output is correct
72 Correct 3 ms 980 KB Output is correct
73 Correct 24 ms 1160 KB Output is correct
74 Correct 25 ms 1424 KB Output is correct
75 Correct 3 ms 448 KB Output is correct
76 Correct 22 ms 1580 KB Output is correct
77 Partially correct 24 ms 1480 KB Partially correct - number of queries: 5083
78 Correct 3 ms 948 KB Output is correct
79 Correct 13 ms 1472 KB Output is correct
80 Partially correct 31 ms 1612 KB Partially correct - number of queries: 5079
81 Partially correct 36 ms 1264 KB Partially correct - number of queries: 5061
82 Correct 24 ms 1248 KB Output is correct
83 Correct 2 ms 436 KB Output is correct
84 Correct 26 ms 1584 KB Output is correct
85 Partially correct 32 ms 944 KB Partially correct - number of queries: 5075
86 Correct 3 ms 696 KB Output is correct
87 Correct 2 ms 692 KB Output is correct
88 Correct 2 ms 696 KB Output is correct
89 Correct 2 ms 696 KB Output is correct
90 Correct 2 ms 440 KB Output is correct
91 Correct 2 ms 444 KB Output is correct
92 Correct 3 ms 700 KB Output is correct
93 Correct 3 ms 976 KB Output is correct
94 Correct 3 ms 480 KB Output is correct
95 Correct 3 ms 736 KB Output is correct
96 Correct 5 ms 960 KB Output is correct
97 Correct 1 ms 440 KB Output is correct