답안 #931509

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931509 2024-02-22T01:12:38 Z Lobo 커다란 상품 (IOI17_prize) C++17
97.41 / 100
29 ms 1944 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/1000;
 	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 4 ms 1232 KB Output is correct
2 Correct 2 ms 444 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 2 ms 456 KB Output is correct
6 Correct 4 ms 732 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 2 ms 456 KB Output is correct
10 Correct 4 ms 500 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 724 KB Output is correct
2 Correct 4 ms 708 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 4 ms 992 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 4 ms 964 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 5 ms 728 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 6 ms 460 KB Output is correct
13 Correct 1 ms 444 KB Output is correct
14 Correct 7 ms 1228 KB Output is correct
15 Correct 26 ms 780 KB Output is correct
16 Correct 4 ms 984 KB Output is correct
17 Partially correct 29 ms 980 KB Partially correct - number of queries: 5142
18 Correct 0 ms 344 KB Output is correct
19 Correct 22 ms 1448 KB Output is correct
20 Correct 10 ms 1516 KB Output is correct
21 Correct 18 ms 1264 KB Output is correct
22 Correct 17 ms 732 KB Output is correct
23 Correct 4 ms 976 KB Output is correct
24 Correct 5 ms 768 KB Output is correct
25 Correct 11 ms 532 KB Output is correct
26 Correct 10 ms 1556 KB Output is correct
27 Correct 3 ms 476 KB Output is correct
28 Correct 1 ms 704 KB Output is correct
29 Correct 4 ms 1140 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Partially correct 22 ms 1944 KB Partially correct - number of queries: 5063
32 Correct 2 ms 712 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 20 ms 1324 KB Output is correct
35 Correct 2 ms 464 KB Output is correct
36 Correct 18 ms 1248 KB Output is correct
37 Correct 5 ms 980 KB Output is correct
38 Correct 4 ms 972 KB Output is correct
39 Correct 15 ms 1336 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 10 ms 804 KB Output is correct
42 Correct 10 ms 1040 KB Output is correct
43 Correct 12 ms 888 KB Output is correct
44 Correct 13 ms 1084 KB Output is correct
45 Correct 18 ms 1316 KB Output is correct
46 Partially correct 20 ms 1408 KB Partially correct - number of queries: 5109
47 Correct 14 ms 1016 KB Output is correct
48 Correct 8 ms 720 KB Output is correct
49 Correct 22 ms 1368 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 16 ms 1064 KB Output is correct
52 Partially correct 28 ms 1648 KB Partially correct - number of queries: 5046
53 Correct 1 ms 444 KB Output is correct
54 Correct 11 ms 980 KB Output is correct
55 Partially correct 27 ms 1592 KB Partially correct - number of queries: 5154
56 Correct 0 ms 340 KB Output is correct
57 Correct 6 ms 512 KB Output is correct
58 Correct 8 ms 1256 KB Output is correct
59 Correct 11 ms 1012 KB Output is correct
60 Correct 10 ms 1564 KB Output is correct
61 Correct 1 ms 448 KB Output is correct
62 Correct 7 ms 708 KB Output is correct
63 Correct 1 ms 440 KB Output is correct
64 Correct 2 ms 716 KB Output is correct
65 Correct 0 ms 420 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 1 ms 344 KB Output is correct
68 Correct 6 ms 984 KB Output is correct
69 Correct 1 ms 344 KB Output is correct
70 Correct 0 ms 600 KB Output is correct
71 Correct 23 ms 1348 KB Output is correct
72 Correct 6 ms 760 KB Output is correct
73 Correct 21 ms 1872 KB Output is correct
74 Correct 24 ms 1376 KB Output is correct
75 Correct 7 ms 740 KB Output is correct
76 Correct 19 ms 1648 KB Output is correct
77 Partially correct 25 ms 704 KB Partially correct - number of queries: 5212
78 Correct 5 ms 1468 KB Output is correct
79 Correct 13 ms 1752 KB Output is correct
80 Partially correct 27 ms 1064 KB Partially correct - number of queries: 5259
81 Partially correct 25 ms 1464 KB Partially correct - number of queries: 5237
82 Partially correct 24 ms 1568 KB Partially correct - number of queries: 5188
83 Correct 4 ms 952 KB Output is correct
84 Correct 19 ms 1216 KB Output is correct
85 Partially correct 24 ms 1512 KB Partially correct - number of queries: 5247
86 Correct 4 ms 1212 KB Output is correct
87 Correct 4 ms 692 KB Output is correct
88 Correct 5 ms 1216 KB Output is correct
89 Correct 4 ms 956 KB Output is correct
90 Correct 4 ms 960 KB Output is correct
91 Correct 6 ms 1212 KB Output is correct
92 Correct 5 ms 980 KB Output is correct
93 Correct 7 ms 976 KB Output is correct
94 Correct 5 ms 756 KB Output is correct
95 Correct 7 ms 892 KB Output is correct
96 Correct 5 ms 992 KB Output is correct
97 Correct 1 ms 444 KB Output is correct