답안 #931506

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931506 2024-02-22T01:11:48 Z Lobo 커다란 상품 (IOI17_prize) C++17
97.83 / 100
37 ms 1828 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/300;
 	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 704 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 1 ms 680 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 1 ms 440 KB Output is correct
7 Correct 1 ms 448 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 436 KB Output is correct
10 Correct 2 ms 456 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 444 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 1 ms 436 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 1 ms 436 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 1 ms 436 KB Output is correct
9 Correct 1 ms 444 KB Output is correct
10 Correct 2 ms 456 KB Output is correct
11 Correct 2 ms 696 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 5 ms 704 KB Output is correct
15 Correct 19 ms 984 KB Output is correct
16 Correct 4 ms 472 KB Output is correct
17 Partially correct 24 ms 1660 KB Partially correct - number of queries: 5022
18 Correct 0 ms 344 KB Output is correct
19 Correct 29 ms 1036 KB Output is correct
20 Correct 11 ms 1288 KB Output is correct
21 Correct 15 ms 1312 KB Output is correct
22 Correct 15 ms 736 KB Output is correct
23 Correct 2 ms 696 KB Output is correct
24 Correct 3 ms 708 KB Output is correct
25 Correct 15 ms 460 KB Output is correct
26 Correct 9 ms 1812 KB Output is correct
27 Correct 1 ms 440 KB Output is correct
28 Correct 1 ms 436 KB Output is correct
29 Correct 2 ms 708 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Partially correct 21 ms 1312 KB Partially correct - number of queries: 5001
32 Correct 1 ms 440 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 16 ms 1088 KB Output is correct
35 Correct 1 ms 440 KB Output is correct
36 Correct 18 ms 1364 KB Output is correct
37 Correct 2 ms 456 KB Output is correct
38 Correct 1 ms 456 KB Output is correct
39 Correct 13 ms 504 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 10 ms 732 KB Output is correct
42 Correct 10 ms 756 KB Output is correct
43 Correct 10 ms 1008 KB Output is correct
44 Correct 18 ms 516 KB Output is correct
45 Correct 14 ms 1100 KB Output is correct
46 Partially correct 31 ms 1368 KB Partially correct - number of queries: 5052
47 Correct 11 ms 756 KB Output is correct
48 Correct 6 ms 1256 KB Output is correct
49 Correct 24 ms 1636 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 15 ms 1064 KB Output is correct
52 Partially correct 23 ms 1208 KB Partially correct - number of queries: 5069
53 Correct 1 ms 344 KB Output is correct
54 Correct 16 ms 1564 KB Output is correct
55 Partially correct 29 ms 1172 KB Partially correct - number of queries: 5075
56 Correct 0 ms 344 KB Output is correct
57 Correct 7 ms 1272 KB Output is correct
58 Correct 6 ms 976 KB Output is correct
59 Correct 9 ms 760 KB Output is correct
60 Correct 14 ms 824 KB Output is correct
61 Correct 0 ms 340 KB Output is correct
62 Correct 2 ms 460 KB Output is correct
63 Correct 1 ms 432 KB Output is correct
64 Correct 1 ms 440 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 1 ms 436 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 32 ms 1008 KB Output is correct
72 Correct 4 ms 724 KB Output is correct
73 Correct 28 ms 1092 KB Output is correct
74 Correct 24 ms 1588 KB Output is correct
75 Correct 2 ms 460 KB Output is correct
76 Correct 27 ms 912 KB Output is correct
77 Partially correct 26 ms 1828 KB Partially correct - number of queries: 5165
78 Correct 5 ms 948 KB Output is correct
79 Correct 17 ms 952 KB Output is correct
80 Partially correct 29 ms 1344 KB Partially correct - number of queries: 5217
81 Partially correct 25 ms 1208 KB Partially correct - number of queries: 5172
82 Partially correct 31 ms 1780 KB Partially correct - number of queries: 5094
83 Correct 2 ms 692 KB Output is correct
84 Correct 20 ms 1724 KB Output is correct
85 Partially correct 37 ms 1352 KB Partially correct - number of queries: 5131
86 Correct 3 ms 952 KB Output is correct
87 Correct 2 ms 696 KB Output is correct
88 Correct 2 ms 440 KB Output is correct
89 Correct 2 ms 688 KB Output is correct
90 Correct 2 ms 696 KB Output is correct
91 Correct 2 ms 700 KB Output is correct
92 Correct 1 ms 692 KB Output is correct
93 Correct 3 ms 460 KB Output is correct
94 Correct 2 ms 456 KB Output is correct
95 Correct 3 ms 472 KB Output is correct
96 Correct 2 ms 452 KB Output is correct
97 Correct 1 ms 344 KB Output is correct