답안 #931897

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931897 2024-02-22T14:16:37 Z Lobo 커다란 상품 (IOI17_prize) C++17
98.67 / 100
30 ms 1952 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/430;
 	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;


}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 684 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 2 ms 696 KB Output is correct
7 Correct 1 ms 436 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 2 ms 864 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 2 ms 696 KB Output is correct
7 Correct 2 ms 436 KB Output is correct
8 Correct 1 ms 436 KB Output is correct
9 Correct 1 ms 688 KB Output is correct
10 Correct 2 ms 712 KB Output is correct
11 Correct 2 ms 696 KB Output is correct
12 Correct 3 ms 720 KB Output is correct
13 Correct 0 ms 428 KB Output is correct
14 Correct 7 ms 696 KB Output is correct
15 Correct 19 ms 1600 KB Output is correct
16 Correct 4 ms 972 KB Output is correct
17 Partially correct 23 ms 1952 KB Partially correct - number of queries: 5067
18 Correct 1 ms 344 KB Output is correct
19 Correct 26 ms 932 KB Output is correct
20 Correct 8 ms 1260 KB Output is correct
21 Correct 15 ms 776 KB Output is correct
22 Correct 22 ms 1500 KB Output is correct
23 Correct 2 ms 708 KB Output is correct
24 Correct 3 ms 724 KB Output is correct
25 Correct 11 ms 1312 KB Output is correct
26 Correct 11 ms 1036 KB Output is correct
27 Correct 3 ms 696 KB Output is correct
28 Correct 2 ms 692 KB Output is correct
29 Correct 2 ms 460 KB Output is correct
30 Correct 0 ms 428 KB Output is correct
31 Partially correct 29 ms 1348 KB Partially correct - number of queries: 5011
32 Correct 2 ms 436 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 15 ms 1308 KB Output is correct
35 Correct 2 ms 436 KB Output is correct
36 Correct 21 ms 1228 KB Output is correct
37 Correct 3 ms 712 KB Output is correct
38 Correct 2 ms 716 KB Output is correct
39 Correct 16 ms 1260 KB Output is correct
40 Correct 1 ms 540 KB Output is correct
41 Correct 10 ms 884 KB Output is correct
42 Correct 11 ms 760 KB Output is correct
43 Correct 12 ms 732 KB Output is correct
44 Correct 14 ms 1824 KB Output is correct
45 Correct 17 ms 1316 KB Output is correct
46 Partially correct 23 ms 1360 KB Partially correct - number of queries: 5059
47 Correct 14 ms 1816 KB Output is correct
48 Correct 7 ms 712 KB Output is correct
49 Correct 23 ms 1132 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 14 ms 540 KB Output is correct
52 Partially correct 24 ms 728 KB Partially correct - number of queries: 5049
53 Correct 1 ms 436 KB Output is correct
54 Correct 17 ms 1236 KB Output is correct
55 Partially correct 26 ms 988 KB Partially correct - number of queries: 5070
56 Correct 0 ms 344 KB Output is correct
57 Correct 7 ms 720 KB Output is correct
58 Correct 7 ms 1012 KB Output is correct
59 Correct 11 ms 1172 KB Output is correct
60 Correct 13 ms 976 KB Output is correct
61 Correct 0 ms 436 KB Output is correct
62 Correct 2 ms 956 KB Output is correct
63 Correct 1 ms 436 KB Output is correct
64 Correct 1 ms 696 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 0 ms 596 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 2 ms 708 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 27 ms 1348 KB Output is correct
72 Correct 5 ms 1228 KB Output is correct
73 Correct 24 ms 1320 KB Output is correct
74 Correct 21 ms 1136 KB Output is correct
75 Correct 2 ms 716 KB Output is correct
76 Correct 18 ms 1424 KB Output is correct
77 Partially correct 29 ms 1564 KB Partially correct - number of queries: 5042
78 Correct 4 ms 956 KB Output is correct
79 Correct 10 ms 956 KB Output is correct
80 Partially correct 25 ms 1488 KB Partially correct - number of queries: 5133
81 Partially correct 24 ms 1236 KB Partially correct - number of queries: 5086
82 Partially correct 25 ms 1860 KB Partially correct - number of queries: 5027
83 Correct 2 ms 692 KB Output is correct
84 Correct 24 ms 1308 KB Output is correct
85 Partially correct 30 ms 1460 KB Partially correct - number of queries: 5062
86 Correct 2 ms 704 KB Output is correct
87 Correct 2 ms 952 KB Output is correct
88 Correct 2 ms 700 KB Output is correct
89 Correct 2 ms 964 KB Output is correct
90 Correct 2 ms 436 KB Output is correct
91 Correct 2 ms 696 KB Output is correct
92 Correct 2 ms 440 KB Output is correct
93 Correct 3 ms 716 KB Output is correct
94 Correct 3 ms 972 KB Output is correct
95 Correct 4 ms 708 KB Output is correct
96 Correct 3 ms 720 KB Output is correct
97 Correct 0 ms 444 KB Output is correct